1 /* Handle parameterized types (templates) for GNU C++.
2 Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
3 2001, 2002, 2003, 2004, 2005, 2007, 2008, 2009, 2010, 2011
4 Free Software Foundation, Inc.
5 Written by Ken Raeburn (raeburn@cygnus.com) while at Watchmaker Computing.
6 Rewritten by Jason Merrill (jason@cygnus.com).
8 This file is part of GCC.
10 GCC is free software; you can redistribute it and/or modify
11 it under the terms of the GNU General Public License as published by
12 the Free Software Foundation; either version 3, or (at your option)
15 GCC is distributed in the hope that it will be useful,
16 but WITHOUT ANY WARRANTY; without even the implied warranty of
17 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
18 GNU General Public License for more details.
20 You should have received a copy of the GNU General Public License
21 along with GCC; see the file COPYING3. If not see
22 <http://www.gnu.org/licenses/>. */
24 /* Known bugs or deficiencies include:
26 all methods must be provided in header files; can't use a source
27 file that contains only the method templates and "just win". */
31 #include "coretypes.h"
35 #include "pointer-set.h"
38 #include "c-family/c-common.h"
39 #include "c-family/c-objc.h"
40 #include "cp-objcp-common.h"
41 #include "tree-inline.h"
46 #include "tree-iterator.h"
49 /* The type of functions taking a tree, and some additional data, and
51 typedef int (*tree_fn_t
) (tree
, void*);
53 /* The PENDING_TEMPLATES is a TREE_LIST of templates whose
54 instantiations have been deferred, either because their definitions
55 were not yet available, or because we were putting off doing the work. */
56 struct GTY ((chain_next ("%h.next"))) pending_template
{
57 struct pending_template
*next
;
58 struct tinst_level
*tinst
;
61 static GTY(()) struct pending_template
*pending_templates
;
62 static GTY(()) struct pending_template
*last_pending_template
;
64 int processing_template_parmlist
;
65 static int template_header_count
;
67 static GTY(()) tree saved_trees
;
68 static VEC(int,heap
) *inline_parm_levels
;
70 static GTY(()) struct tinst_level
*current_tinst_level
;
72 static GTY(()) tree saved_access_scope
;
74 /* Live only within one (recursive) call to tsubst_expr. We use
75 this to pass the statement expression node from the STMT_EXPR
76 to the EXPR_STMT that is its result. */
77 static tree cur_stmt_expr
;
79 /* A map from local variable declarations in the body of the template
80 presently being instantiated to the corresponding instantiated
82 static htab_t local_specializations
;
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
,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 void push_deduction_access_scope (tree
);
121 static void pop_deduction_access_scope (tree
);
122 static bool resolve_overloaded_unification (tree
, tree
, tree
, tree
,
123 unification_kind_t
, int,
125 static int try_one_overload (tree
, tree
, tree
, tree
, tree
,
126 unification_kind_t
, int, bool, bool);
127 static int unify (tree
, tree
, tree
, tree
, int, bool);
128 static void add_pending_template (tree
);
129 static tree
reopen_tinst_level (struct tinst_level
*);
130 static tree
tsubst_initializer_list (tree
, tree
);
131 static tree
get_class_bindings (tree
, tree
, tree
);
132 static tree
coerce_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,
143 static void note_template_header (int);
144 static tree
convert_nontype_argument_function (tree
, tree
);
145 static tree
convert_nontype_argument (tree
, tree
, tsubst_flags_t
);
146 static tree
convert_template_argument (tree
, tree
, tree
,
147 tsubst_flags_t
, int, tree
);
148 static int for_each_template_parm (tree
, tree_fn_t
, void*,
149 struct pointer_set_t
*, bool);
150 static tree
expand_template_argument_pack (tree
);
151 static tree
build_template_parm_index (int, int, int, int, tree
, tree
);
152 static bool inline_needs_template_parms (tree
);
153 static void push_inline_template_parms_recursive (tree
, int);
154 static tree
retrieve_local_specialization (tree
);
155 static void register_local_specialization (tree
, tree
);
156 static hashval_t
hash_specialization (const void *p
);
157 static tree
reduce_template_parm_level (tree
, tree
, int, tree
, tsubst_flags_t
);
158 static int mark_template_parm (tree
, void *);
159 static int template_parm_this_level_p (tree
, void *);
160 static tree
tsubst_friend_function (tree
, tree
);
161 static tree
tsubst_friend_class (tree
, tree
);
162 static int can_complete_type_without_circularity (tree
);
163 static tree
get_bindings (tree
, tree
, tree
, bool);
164 static int template_decl_level (tree
);
165 static int check_cv_quals_for_unify (int, tree
, tree
);
166 static void template_parm_level_and_index (tree
, int*, int*);
167 static int unify_pack_expansion (tree
, tree
, tree
,
168 tree
, unification_kind_t
, bool, bool);
169 static tree
tsubst_template_arg (tree
, tree
, tsubst_flags_t
, tree
);
170 static tree
tsubst_template_args (tree
, tree
, tsubst_flags_t
, tree
);
171 static tree
tsubst_template_parms (tree
, tree
, tsubst_flags_t
);
172 static void regenerate_decl_from_template (tree
, tree
);
173 static tree
most_specialized_class (tree
, tree
, tsubst_flags_t
);
174 static tree
tsubst_aggr_type (tree
, tree
, tsubst_flags_t
, tree
, int);
175 static tree
tsubst_arg_types (tree
, tree
, tsubst_flags_t
, tree
);
176 static tree
tsubst_function_type (tree
, tree
, tsubst_flags_t
, tree
);
177 static bool check_specialization_scope (void);
178 static tree
process_partial_specialization (tree
);
179 static void set_current_access_from_decl (tree
);
180 static enum template_base_result
get_template_base (tree
, tree
, tree
, tree
,
182 static tree
try_class_unification (tree
, tree
, tree
, tree
, bool);
183 static int coerce_template_template_parms (tree
, tree
, tsubst_flags_t
,
185 static bool template_template_parm_bindings_ok_p (tree
, tree
);
186 static int template_args_equal (tree
, tree
);
187 static void tsubst_default_arguments (tree
);
188 static tree
for_each_template_parm_r (tree
*, int *, void *);
189 static tree
copy_default_args_to_explicit_spec_1 (tree
, tree
);
190 static void copy_default_args_to_explicit_spec (tree
);
191 static int invalid_nontype_parm_type_p (tree
, tsubst_flags_t
);
192 static int eq_local_specializations (const void *, const void *);
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 bool arg_from_parm_pack_p (tree
, tree
);
207 static tree
current_template_args (void);
208 static tree
fixup_template_type_parm_type (tree
, int);
209 static tree
fixup_template_parm_index (tree
, tree
, int);
210 static tree
tsubst_template_parm (tree
, tree
, tsubst_flags_t
);
212 /* Make the current scope suitable for access checking when we are
213 processing T. T can be FUNCTION_DECL for instantiated function
214 template, or VAR_DECL for static member variable (need by
215 instantiate_decl). */
218 push_access_scope (tree t
)
220 gcc_assert (TREE_CODE (t
) == FUNCTION_DECL
221 || TREE_CODE (t
) == VAR_DECL
);
223 if (DECL_FRIEND_CONTEXT (t
))
224 push_nested_class (DECL_FRIEND_CONTEXT (t
));
225 else if (DECL_CLASS_SCOPE_P (t
))
226 push_nested_class (DECL_CONTEXT (t
));
228 push_to_top_level ();
230 if (TREE_CODE (t
) == FUNCTION_DECL
)
232 saved_access_scope
= tree_cons
233 (NULL_TREE
, current_function_decl
, saved_access_scope
);
234 current_function_decl
= t
;
238 /* Restore the scope set up by push_access_scope. T is the node we
242 pop_access_scope (tree t
)
244 if (TREE_CODE (t
) == FUNCTION_DECL
)
246 current_function_decl
= TREE_VALUE (saved_access_scope
);
247 saved_access_scope
= TREE_CHAIN (saved_access_scope
);
250 if (DECL_FRIEND_CONTEXT (t
) || DECL_CLASS_SCOPE_P (t
))
253 pop_from_top_level ();
256 /* Do any processing required when DECL (a member template
257 declaration) is finished. Returns the TEMPLATE_DECL corresponding
258 to DECL, unless it is a specialization, in which case the DECL
259 itself is returned. */
262 finish_member_template_decl (tree decl
)
264 if (decl
== error_mark_node
)
265 return error_mark_node
;
267 gcc_assert (DECL_P (decl
));
269 if (TREE_CODE (decl
) == TYPE_DECL
)
273 type
= TREE_TYPE (decl
);
274 if (type
== error_mark_node
)
275 return error_mark_node
;
276 if (MAYBE_CLASS_TYPE_P (type
)
277 && CLASSTYPE_TEMPLATE_INFO (type
)
278 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
280 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
281 check_member_template (tmpl
);
286 else if (TREE_CODE (decl
) == FIELD_DECL
)
287 error ("data member %qD cannot be a member template", decl
);
288 else if (DECL_TEMPLATE_INFO (decl
))
290 if (!DECL_TEMPLATE_SPECIALIZATION (decl
))
292 check_member_template (DECL_TI_TEMPLATE (decl
));
293 return DECL_TI_TEMPLATE (decl
);
299 error ("invalid member template declaration %qD", decl
);
301 return error_mark_node
;
304 /* Create a template info node. */
307 build_template_info (tree template_decl
, tree template_args
)
309 tree result
= make_node (TEMPLATE_INFO
);
310 TI_TEMPLATE (result
) = template_decl
;
311 TI_ARGS (result
) = template_args
;
315 /* Return the template info node corresponding to T, whatever T is. */
318 get_template_info (const_tree t
)
320 tree tinfo
= NULL_TREE
;
322 if (!t
|| t
== error_mark_node
)
325 if (DECL_P (t
) && DECL_LANG_SPECIFIC (t
))
326 tinfo
= DECL_TEMPLATE_INFO (t
);
328 if (!tinfo
&& DECL_IMPLICIT_TYPEDEF_P (t
))
331 if (TAGGED_TYPE_P (t
))
332 tinfo
= TYPE_TEMPLATE_INFO (t
);
333 else if (TREE_CODE (t
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
334 tinfo
= TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t
);
339 /* Returns the template nesting level of the indicated class TYPE.
349 A<T>::B<U> has depth two, while A<T> has depth one.
350 Both A<T>::B<int> and A<int>::B<U> have depth one, if
351 they are instantiations, not specializations.
353 This function is guaranteed to return 0 if passed NULL_TREE so
354 that, for example, `template_class_depth (current_class_type)' is
358 template_class_depth (tree type
)
363 type
&& TREE_CODE (type
) != NAMESPACE_DECL
;
364 type
= (TREE_CODE (type
) == FUNCTION_DECL
)
365 ? CP_DECL_CONTEXT (type
) : CP_TYPE_CONTEXT (type
))
367 tree tinfo
= get_template_info (type
);
369 if (tinfo
&& PRIMARY_TEMPLATE_P (TI_TEMPLATE (tinfo
))
370 && uses_template_parms (INNERMOST_TEMPLATE_ARGS (TI_ARGS (tinfo
))))
377 /* Subroutine of maybe_begin_member_template_processing.
378 Returns true if processing DECL needs us to push template parms. */
381 inline_needs_template_parms (tree decl
)
383 if (! DECL_TEMPLATE_INFO (decl
))
386 return (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (most_general_template (decl
)))
387 > (processing_template_decl
+ DECL_TEMPLATE_SPECIALIZATION (decl
)));
390 /* Subroutine of maybe_begin_member_template_processing.
391 Push the template parms in PARMS, starting from LEVELS steps into the
392 chain, and ending at the beginning, since template parms are listed
396 push_inline_template_parms_recursive (tree parmlist
, int levels
)
398 tree parms
= TREE_VALUE (parmlist
);
402 push_inline_template_parms_recursive (TREE_CHAIN (parmlist
), levels
- 1);
404 ++processing_template_decl
;
405 current_template_parms
406 = tree_cons (size_int (processing_template_decl
),
407 parms
, current_template_parms
);
408 TEMPLATE_PARMS_FOR_INLINE (current_template_parms
) = 1;
410 begin_scope (TREE_VEC_LENGTH (parms
) ? sk_template_parms
: sk_template_spec
,
412 for (i
= 0; i
< TREE_VEC_LENGTH (parms
); ++i
)
414 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
416 if (parm
== error_mark_node
)
419 gcc_assert (DECL_P (parm
));
421 switch (TREE_CODE (parm
))
430 /* Make a CONST_DECL as is done in process_template_parm.
431 It is ugly that we recreate this here; the original
432 version built in process_template_parm is no longer
434 tree decl
= build_decl (DECL_SOURCE_LOCATION (parm
),
435 CONST_DECL
, DECL_NAME (parm
),
437 DECL_ARTIFICIAL (decl
) = 1;
438 TREE_CONSTANT (decl
) = 1;
439 TREE_READONLY (decl
) = 1;
440 DECL_INITIAL (decl
) = DECL_INITIAL (parm
);
441 SET_DECL_TEMPLATE_PARM_P (decl
);
452 /* Restore the template parameter context for a member template or
453 a friend template defined in a class definition. */
456 maybe_begin_member_template_processing (tree decl
)
461 if (inline_needs_template_parms (decl
))
463 parms
= DECL_TEMPLATE_PARMS (most_general_template (decl
));
464 levels
= TMPL_PARMS_DEPTH (parms
) - processing_template_decl
;
466 if (DECL_TEMPLATE_SPECIALIZATION (decl
))
469 parms
= TREE_CHAIN (parms
);
472 push_inline_template_parms_recursive (parms
, levels
);
475 /* Remember how many levels of template parameters we pushed so that
476 we can pop them later. */
477 VEC_safe_push (int, heap
, inline_parm_levels
, levels
);
480 /* Undo the effects of maybe_begin_member_template_processing. */
483 maybe_end_member_template_processing (void)
488 if (VEC_length (int, inline_parm_levels
) == 0)
491 last
= VEC_pop (int, inline_parm_levels
);
492 for (i
= 0; i
< last
; ++i
)
494 --processing_template_decl
;
495 current_template_parms
= TREE_CHAIN (current_template_parms
);
500 /* Return a new template argument vector which contains all of ARGS,
501 but has as its innermost set of arguments the EXTRA_ARGS. */
504 add_to_template_args (tree args
, tree extra_args
)
511 if (args
== NULL_TREE
|| extra_args
== error_mark_node
)
514 extra_depth
= TMPL_ARGS_DEPTH (extra_args
);
515 new_args
= make_tree_vec (TMPL_ARGS_DEPTH (args
) + extra_depth
);
517 for (i
= 1; i
<= TMPL_ARGS_DEPTH (args
); ++i
)
518 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (args
, i
));
520 for (j
= 1; j
<= extra_depth
; ++j
, ++i
)
521 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (extra_args
, j
));
526 /* Like add_to_template_args, but only the outermost ARGS are added to
527 the EXTRA_ARGS. In particular, all but TMPL_ARGS_DEPTH
528 (EXTRA_ARGS) levels are added. This function is used to combine
529 the template arguments from a partial instantiation with the
530 template arguments used to attain the full instantiation from the
531 partial instantiation. */
534 add_outermost_template_args (tree args
, tree extra_args
)
538 /* If there are more levels of EXTRA_ARGS than there are ARGS,
539 something very fishy is going on. */
540 gcc_assert (TMPL_ARGS_DEPTH (args
) >= TMPL_ARGS_DEPTH (extra_args
));
542 /* If *all* the new arguments will be the EXTRA_ARGS, just return
544 if (TMPL_ARGS_DEPTH (args
) == TMPL_ARGS_DEPTH (extra_args
))
547 /* For the moment, we make ARGS look like it contains fewer levels. */
548 TREE_VEC_LENGTH (args
) -= TMPL_ARGS_DEPTH (extra_args
);
550 new_args
= add_to_template_args (args
, extra_args
);
552 /* Now, we restore ARGS to its full dimensions. */
553 TREE_VEC_LENGTH (args
) += TMPL_ARGS_DEPTH (extra_args
);
558 /* Return the N levels of innermost template arguments from the ARGS. */
561 get_innermost_template_args (tree args
, int n
)
569 /* If N is 1, just return the innermost set of template arguments. */
571 return TMPL_ARGS_LEVEL (args
, TMPL_ARGS_DEPTH (args
));
573 /* If we're not removing anything, just return the arguments we were
575 extra_levels
= TMPL_ARGS_DEPTH (args
) - n
;
576 gcc_assert (extra_levels
>= 0);
577 if (extra_levels
== 0)
580 /* Make a new set of arguments, not containing the outer arguments. */
581 new_args
= make_tree_vec (n
);
582 for (i
= 1; i
<= n
; ++i
)
583 SET_TMPL_ARGS_LEVEL (new_args
, i
,
584 TMPL_ARGS_LEVEL (args
, i
+ extra_levels
));
589 /* The inverse of get_innermost_template_args: Return all but the innermost
590 EXTRA_LEVELS levels of template arguments from the ARGS. */
593 strip_innermost_template_args (tree args
, int extra_levels
)
596 int n
= TMPL_ARGS_DEPTH (args
) - extra_levels
;
601 /* If N is 1, just return the outermost set of template arguments. */
603 return TMPL_ARGS_LEVEL (args
, 1);
605 /* If we're not removing anything, just return the arguments we were
607 gcc_assert (extra_levels
>= 0);
608 if (extra_levels
== 0)
611 /* Make a new set of arguments, not containing the inner arguments. */
612 new_args
= make_tree_vec (n
);
613 for (i
= 1; i
<= n
; ++i
)
614 SET_TMPL_ARGS_LEVEL (new_args
, i
,
615 TMPL_ARGS_LEVEL (args
, i
));
620 /* We've got a template header coming up; push to a new level for storing
624 begin_template_parm_list (void)
626 /* We use a non-tag-transparent scope here, which causes pushtag to
627 put tags in this scope, rather than in the enclosing class or
628 namespace scope. This is the right thing, since we want
629 TEMPLATE_DECLS, and not TYPE_DECLS for template classes. For a
630 global template class, push_template_decl handles putting the
631 TEMPLATE_DECL into top-level scope. For a nested template class,
634 template <class T> struct S1 {
635 template <class T> struct S2 {};
638 pushtag contains special code to call pushdecl_with_scope on the
639 TEMPLATE_DECL for S2. */
640 begin_scope (sk_template_parms
, NULL
);
641 ++processing_template_decl
;
642 ++processing_template_parmlist
;
643 note_template_header (0);
646 /* This routine is called when a specialization is declared. If it is
647 invalid to declare a specialization here, an error is reported and
648 false is returned, otherwise this routine will return true. */
651 check_specialization_scope (void)
653 tree scope
= current_scope ();
657 An explicit specialization shall be declared in the namespace of
658 which the template is a member, or, for member templates, in the
659 namespace of which the enclosing class or enclosing class
660 template is a member. An explicit specialization of a member
661 function, member class or static data member of a class template
662 shall be declared in the namespace of which the class template
664 if (scope
&& TREE_CODE (scope
) != NAMESPACE_DECL
)
666 error ("explicit specialization in non-namespace scope %qD", scope
);
672 In an explicit specialization declaration for a member of a class
673 template or a member template that appears in namespace scope,
674 the member template and some of its enclosing class templates may
675 remain unspecialized, except that the declaration shall not
676 explicitly specialize a class member template if its enclosing
677 class templates are not explicitly specialized as well. */
678 if (current_template_parms
)
680 error ("enclosing class templates are not explicitly specialized");
687 /* We've just seen template <>. */
690 begin_specialization (void)
692 begin_scope (sk_template_spec
, NULL
);
693 note_template_header (1);
694 return check_specialization_scope ();
697 /* Called at then end of processing a declaration preceded by
701 end_specialization (void)
704 reset_specialization ();
707 /* Any template <>'s that we have seen thus far are not referring to a
708 function specialization. */
711 reset_specialization (void)
713 processing_specialization
= 0;
714 template_header_count
= 0;
717 /* We've just seen a template header. If SPECIALIZATION is nonzero,
718 it was of the form template <>. */
721 note_template_header (int specialization
)
723 processing_specialization
= specialization
;
724 template_header_count
++;
727 /* We're beginning an explicit instantiation. */
730 begin_explicit_instantiation (void)
732 gcc_assert (!processing_explicit_instantiation
);
733 processing_explicit_instantiation
= true;
738 end_explicit_instantiation (void)
740 gcc_assert (processing_explicit_instantiation
);
741 processing_explicit_instantiation
= false;
744 /* An explicit specialization or partial specialization TMPL is being
745 declared. Check that the namespace in which the specialization is
746 occurring is permissible. Returns false iff it is invalid to
747 specialize TMPL in the current namespace. */
750 check_specialization_namespace (tree tmpl
)
752 tree tpl_ns
= decl_namespace_context (tmpl
);
756 An explicit specialization shall be declared in the namespace of
757 which the template is a member, or, for member templates, in the
758 namespace of which the enclosing class or enclosing class
759 template is a member. An explicit specialization of a member
760 function, member class or static data member of a class template
761 shall be declared in the namespace of which the class template is
763 if (current_scope() != DECL_CONTEXT (tmpl
)
764 && !at_namespace_scope_p ())
766 error ("specialization of %qD must appear at namespace scope", tmpl
);
769 if (is_associated_namespace (current_namespace
, tpl_ns
))
770 /* Same or super-using namespace. */
774 permerror (input_location
, "specialization of %qD in different namespace", tmpl
);
775 permerror (input_location
, " from definition of %q+#D", tmpl
);
780 /* SPEC is an explicit instantiation. Check that it is valid to
781 perform this explicit instantiation in the current namespace. */
784 check_explicit_instantiation_namespace (tree spec
)
788 /* DR 275: An explicit instantiation shall appear in an enclosing
789 namespace of its template. */
790 ns
= decl_namespace_context (spec
);
791 if (!is_ancestor (current_namespace
, ns
))
792 permerror (input_location
, "explicit instantiation of %qD in namespace %qD "
793 "(which does not enclose namespace %qD)",
794 spec
, current_namespace
, ns
);
797 /* The TYPE is being declared. If it is a template type, that means it
798 is a partial specialization. Do appropriate error-checking. */
801 maybe_process_partial_specialization (tree type
)
805 if (type
== error_mark_node
)
806 return error_mark_node
;
808 if (TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
810 error ("name of class shadows template template parameter %qD",
812 return error_mark_node
;
815 context
= TYPE_CONTEXT (type
);
817 if ((CLASS_TYPE_P (type
) && CLASSTYPE_USE_TEMPLATE (type
))
818 /* Consider non-class instantiations of alias templates as
821 && TYPE_TEMPLATE_INFO (type
)
822 && DECL_LANG_SPECIFIC (TYPE_NAME (type
))
823 && DECL_USE_TEMPLATE (TYPE_NAME (type
))))
825 /* This is for ordinary explicit specialization and partial
826 specialization of a template class such as:
828 template <> class C<int>;
832 template <class T> class C<T*>;
834 Make sure that `C<int>' and `C<T*>' are implicit instantiations. */
836 if (CLASS_TYPE_P (type
)
837 && CLASSTYPE_IMPLICIT_INSTANTIATION (type
)
838 && !COMPLETE_TYPE_P (type
))
840 check_specialization_namespace (CLASSTYPE_TI_TEMPLATE (type
));
841 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type
);
842 if (processing_template_decl
)
844 if (push_template_decl (TYPE_MAIN_DECL (type
))
846 return error_mark_node
;
849 else if (CLASS_TYPE_P (type
)
850 && CLASSTYPE_TEMPLATE_INSTANTIATION (type
))
851 error ("specialization of %qT after instantiation", type
);
853 if (DECL_ALIAS_TEMPLATE_P (TYPE_TI_TEMPLATE (type
)))
855 error ("partial specialization of alias template %qD",
856 TYPE_TI_TEMPLATE (type
));
857 return error_mark_node
;
860 else if (CLASS_TYPE_P (type
)
861 && !CLASSTYPE_USE_TEMPLATE (type
)
862 && CLASSTYPE_TEMPLATE_INFO (type
)
863 && context
&& CLASS_TYPE_P (context
)
864 && CLASSTYPE_TEMPLATE_INFO (context
))
866 /* This is for an explicit specialization of member class
867 template according to [temp.expl.spec/18]:
869 template <> template <class U> class C<int>::D;
871 The context `C<int>' must be an implicit instantiation.
872 Otherwise this is just a member class template declared
875 template <> class C<int> { template <class U> class D; };
876 template <> template <class U> class C<int>::D;
878 In the first case, `C<int>::D' is a specialization of `C<T>::D'
879 while in the second case, `C<int>::D' is a primary template
880 and `C<T>::D' may not exist. */
882 if (CLASSTYPE_IMPLICIT_INSTANTIATION (context
)
883 && !COMPLETE_TYPE_P (type
))
886 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
888 if (current_namespace
889 != decl_namespace_context (tmpl
))
891 permerror (input_location
, "specializing %q#T in different namespace", type
);
892 permerror (input_location
, " from definition of %q+#D", tmpl
);
895 /* Check for invalid specialization after instantiation:
897 template <> template <> class C<int>::D<int>;
898 template <> template <class U> class C<int>::D; */
900 for (t
= DECL_TEMPLATE_INSTANTIATIONS (tmpl
);
901 t
; t
= TREE_CHAIN (t
))
903 tree inst
= TREE_VALUE (t
);
904 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (inst
))
906 /* We already have a full specialization of this partial
907 instantiation. Reassign it to the new member
908 specialization template. */
913 elt
.tmpl
= most_general_template (tmpl
);
914 elt
.args
= CLASSTYPE_TI_ARGS (inst
);
917 htab_remove_elt (type_specializations
, &elt
);
920 elt
.args
= INNERMOST_TEMPLATE_ARGS (elt
.args
);
922 slot
= htab_find_slot (type_specializations
, &elt
, INSERT
);
923 entry
= ggc_alloc_spec_entry ();
927 else if (COMPLETE_OR_OPEN_TYPE_P (inst
))
928 /* But if we've had an implicit instantiation, that's a
929 problem ([temp.expl.spec]/6). */
930 error ("specialization %qT after instantiation %qT",
934 /* Mark TYPE as a specialization. And as a result, we only
935 have one level of template argument for the innermost
937 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type
);
938 CLASSTYPE_TI_ARGS (type
)
939 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type
));
942 else if (processing_specialization
)
944 /* Someday C++0x may allow for enum template specialization. */
945 if (cxx_dialect
> cxx98
&& TREE_CODE (type
) == ENUMERAL_TYPE
946 && CLASS_TYPE_P (context
) && CLASSTYPE_USE_TEMPLATE (context
))
947 pedwarn (input_location
, OPT_pedantic
, "template specialization "
948 "of %qD not allowed by ISO C++", type
);
951 error ("explicit specialization of non-template %qT", type
);
952 return error_mark_node
;
959 /* Returns nonzero if we can optimize the retrieval of specializations
960 for TMPL, a TEMPLATE_DECL. In particular, for such a template, we
961 do not use DECL_TEMPLATE_SPECIALIZATIONS at all. */
964 optimize_specialization_lookup_p (tree tmpl
)
966 return (DECL_FUNCTION_TEMPLATE_P (tmpl
)
967 && DECL_CLASS_SCOPE_P (tmpl
)
968 /* DECL_CLASS_SCOPE_P holds of T::f even if T is a template
970 && CLASS_TYPE_P (DECL_CONTEXT (tmpl
))
971 /* The optimized lookup depends on the fact that the
972 template arguments for the member function template apply
973 purely to the containing class, which is not true if the
974 containing class is an explicit or partial
976 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (tmpl
))
977 && !DECL_MEMBER_TEMPLATE_P (tmpl
)
978 && !DECL_CONV_FN_P (tmpl
)
979 /* It is possible to have a template that is not a member
980 template and is not a member of a template class:
982 template <typename T>
983 struct S { friend A::f(); };
985 Here, the friend function is a template, but the context does
986 not have template information. The optimized lookup relies
987 on having ARGS be the template arguments for both the class
988 and the function template. */
989 && !DECL_FRIEND_P (DECL_TEMPLATE_RESULT (tmpl
)));
992 /* Retrieve the specialization (in the sense of [temp.spec] - a
993 specialization is either an instantiation or an explicit
994 specialization) of TMPL for the given template ARGS. If there is
995 no such specialization, return NULL_TREE. The ARGS are a vector of
996 arguments, or a vector of vectors of arguments, in the case of
997 templates with more than one level of parameters.
999 If TMPL is a type template and CLASS_SPECIALIZATIONS_P is true,
1000 then we search for a partial specialization matching ARGS. This
1001 parameter is ignored if TMPL is not a class template. */
1004 retrieve_specialization (tree tmpl
, tree args
, hashval_t hash
)
1006 if (args
== error_mark_node
)
1009 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
);
1011 /* There should be as many levels of arguments as there are
1012 levels of parameters. */
1013 gcc_assert (TMPL_ARGS_DEPTH (args
)
1014 == TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
)));
1016 if (optimize_specialization_lookup_p (tmpl
))
1018 tree class_template
;
1019 tree class_specialization
;
1020 VEC(tree
,gc
) *methods
;
1024 /* The template arguments actually apply to the containing
1025 class. Find the class specialization with those
1027 class_template
= CLASSTYPE_TI_TEMPLATE (DECL_CONTEXT (tmpl
));
1028 class_specialization
1029 = retrieve_specialization (class_template
, args
, 0);
1030 if (!class_specialization
)
1032 /* Now, find the appropriate entry in the CLASSTYPE_METHOD_VEC
1033 for the specialization. */
1034 idx
= class_method_index_for_fn (class_specialization
, tmpl
);
1037 /* Iterate through the methods with the indicated name, looking
1038 for the one that has an instance of TMPL. */
1039 methods
= CLASSTYPE_METHOD_VEC (class_specialization
);
1040 for (fns
= VEC_index (tree
, methods
, idx
); fns
; fns
= OVL_NEXT (fns
))
1042 tree fn
= OVL_CURRENT (fns
);
1043 if (DECL_TEMPLATE_INFO (fn
) && DECL_TI_TEMPLATE (fn
) == tmpl
1044 /* using-declarations can add base methods to the method vec,
1045 and we don't want those here. */
1046 && DECL_CONTEXT (fn
) == class_specialization
)
1055 htab_t specializations
;
1059 elt
.spec
= NULL_TREE
;
1061 if (DECL_CLASS_TEMPLATE_P (tmpl
))
1062 specializations
= type_specializations
;
1064 specializations
= decl_specializations
;
1067 hash
= hash_specialization (&elt
);
1068 found
= (spec_entry
*) htab_find_with_hash (specializations
, &elt
, hash
);
1076 /* Like retrieve_specialization, but for local declarations. */
1079 retrieve_local_specialization (tree tmpl
)
1083 if (local_specializations
== NULL
)
1086 spec
= (tree
) htab_find_with_hash (local_specializations
, tmpl
,
1087 htab_hash_pointer (tmpl
));
1088 return spec
? TREE_PURPOSE (spec
) : NULL_TREE
;
1091 /* Returns nonzero iff DECL is a specialization of TMPL. */
1094 is_specialization_of (tree decl
, tree tmpl
)
1098 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1102 t
= DECL_TEMPLATE_INFO (t
) ? DECL_TI_TEMPLATE (t
) : NULL_TREE
)
1108 gcc_assert (TREE_CODE (decl
) == TYPE_DECL
);
1110 for (t
= TREE_TYPE (decl
);
1112 t
= CLASSTYPE_USE_TEMPLATE (t
)
1113 ? TREE_TYPE (CLASSTYPE_TI_TEMPLATE (t
)) : NULL_TREE
)
1114 if (same_type_ignoring_top_level_qualifiers_p (t
, TREE_TYPE (tmpl
)))
1121 /* Returns nonzero iff DECL is a specialization of friend declaration
1122 FRIEND_DECL according to [temp.friend]. */
1125 is_specialization_of_friend (tree decl
, tree friend_decl
)
1127 bool need_template
= true;
1130 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
1131 || TREE_CODE (decl
) == TYPE_DECL
);
1133 /* For [temp.friend/6] when FRIEND_DECL is an ordinary member function
1134 of a template class, we want to check if DECL is a specialization
1136 if (TREE_CODE (friend_decl
) == FUNCTION_DECL
1137 && DECL_TEMPLATE_INFO (friend_decl
)
1138 && !DECL_USE_TEMPLATE (friend_decl
))
1140 /* We want a TEMPLATE_DECL for `is_specialization_of'. */
1141 friend_decl
= DECL_TI_TEMPLATE (friend_decl
);
1142 need_template
= false;
1144 else if (TREE_CODE (friend_decl
) == TEMPLATE_DECL
1145 && !PRIMARY_TEMPLATE_P (friend_decl
))
1146 need_template
= false;
1148 /* There is nothing to do if this is not a template friend. */
1149 if (TREE_CODE (friend_decl
) != TEMPLATE_DECL
)
1152 if (is_specialization_of (decl
, friend_decl
))
1156 A member of a class template may be declared to be a friend of a
1157 non-template class. In this case, the corresponding member of
1158 every specialization of the class template is a friend of the
1159 class granting friendship.
1161 For example, given a template friend declaration
1163 template <class T> friend void A<T>::f();
1165 the member function below is considered a friend
1167 template <> struct A<int> {
1171 For this type of template friend, TEMPLATE_DEPTH below will be
1172 nonzero. To determine if DECL is a friend of FRIEND, we first
1173 check if the enclosing class is a specialization of another. */
1175 template_depth
= template_class_depth (CP_DECL_CONTEXT (friend_decl
));
1177 && DECL_CLASS_SCOPE_P (decl
)
1178 && is_specialization_of (TYPE_NAME (DECL_CONTEXT (decl
)),
1179 CLASSTYPE_TI_TEMPLATE (DECL_CONTEXT (friend_decl
))))
1181 /* Next, we check the members themselves. In order to handle
1182 a few tricky cases, such as when FRIEND_DECL's are
1184 template <class T> friend void A<T>::g(T t);
1185 template <class T> template <T t> friend void A<T>::h();
1189 void A<int>::g(int);
1190 template <int> void A<int>::h();
1192 we need to figure out ARGS, the template arguments from
1193 the context of DECL. This is required for template substitution
1194 of `T' in the function parameter of `g' and template parameter
1195 of `h' in the above examples. Here ARGS corresponds to `int'. */
1197 tree context
= DECL_CONTEXT (decl
);
1198 tree args
= NULL_TREE
;
1199 int current_depth
= 0;
1201 while (current_depth
< template_depth
)
1203 if (CLASSTYPE_TEMPLATE_INFO (context
))
1205 if (current_depth
== 0)
1206 args
= TYPE_TI_ARGS (context
);
1208 args
= add_to_template_args (TYPE_TI_ARGS (context
), args
);
1211 context
= TYPE_CONTEXT (context
);
1214 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1219 tree friend_args_type
;
1220 tree decl_args_type
;
1222 /* Make sure that both DECL and FRIEND_DECL are templates or
1224 is_template
= DECL_TEMPLATE_INFO (decl
)
1225 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl
));
1226 if (need_template
^ is_template
)
1228 else if (is_template
)
1230 /* If both are templates, check template parameter list. */
1232 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_decl
),
1234 if (!comp_template_parms
1235 (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (decl
)),
1239 decl_type
= TREE_TYPE (DECL_TI_TEMPLATE (decl
));
1242 decl_type
= TREE_TYPE (decl
);
1244 friend_type
= tsubst_function_type (TREE_TYPE (friend_decl
), args
,
1245 tf_none
, NULL_TREE
);
1246 if (friend_type
== error_mark_node
)
1249 /* Check if return types match. */
1250 if (!same_type_p (TREE_TYPE (decl_type
), TREE_TYPE (friend_type
)))
1253 /* Check if function parameter types match, ignoring the
1254 `this' parameter. */
1255 friend_args_type
= TYPE_ARG_TYPES (friend_type
);
1256 decl_args_type
= TYPE_ARG_TYPES (decl_type
);
1257 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (friend_decl
))
1258 friend_args_type
= TREE_CHAIN (friend_args_type
);
1259 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1260 decl_args_type
= TREE_CHAIN (decl_args_type
);
1262 return compparms (decl_args_type
, friend_args_type
);
1266 /* DECL is a TYPE_DECL */
1268 tree decl_type
= TREE_TYPE (decl
);
1270 /* Make sure that both DECL and FRIEND_DECL are templates or
1273 = CLASSTYPE_TEMPLATE_INFO (decl_type
)
1274 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (decl_type
));
1276 if (need_template
^ is_template
)
1278 else if (is_template
)
1281 /* If both are templates, check the name of the two
1282 TEMPLATE_DECL's first because is_friend didn't. */
1283 if (DECL_NAME (CLASSTYPE_TI_TEMPLATE (decl_type
))
1284 != DECL_NAME (friend_decl
))
1287 /* Now check template parameter list. */
1289 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_decl
),
1291 return comp_template_parms
1292 (DECL_TEMPLATE_PARMS (CLASSTYPE_TI_TEMPLATE (decl_type
)),
1296 return (DECL_NAME (decl
)
1297 == DECL_NAME (friend_decl
));
1303 /* Register the specialization SPEC as a specialization of TMPL with
1304 the indicated ARGS. IS_FRIEND indicates whether the specialization
1305 is actually just a friend declaration. Returns SPEC, or an
1306 equivalent prior declaration, if available. */
1309 register_specialization (tree spec
, tree tmpl
, tree args
, bool is_friend
,
1316 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
&& DECL_P (spec
));
1318 if (TREE_CODE (spec
) == FUNCTION_DECL
1319 && uses_template_parms (DECL_TI_ARGS (spec
)))
1320 /* This is the FUNCTION_DECL for a partial instantiation. Don't
1321 register it; we want the corresponding TEMPLATE_DECL instead.
1322 We use `uses_template_parms (DECL_TI_ARGS (spec))' rather than
1323 the more obvious `uses_template_parms (spec)' to avoid problems
1324 with default function arguments. In particular, given
1325 something like this:
1327 template <class T> void f(T t1, T t = T())
1329 the default argument expression is not substituted for in an
1330 instantiation unless and until it is actually needed. */
1333 if (optimize_specialization_lookup_p (tmpl
))
1334 /* We don't put these specializations in the hash table, but we might
1335 want to give an error about a mismatch. */
1336 fn
= retrieve_specialization (tmpl
, args
, 0);
1344 hash
= hash_specialization (&elt
);
1347 htab_find_slot_with_hash (decl_specializations
, &elt
, hash
, INSERT
);
1349 fn
= ((spec_entry
*) *slot
)->spec
;
1354 /* We can sometimes try to re-register a specialization that we've
1355 already got. In particular, regenerate_decl_from_template calls
1356 duplicate_decls which will update the specialization list. But,
1357 we'll still get called again here anyhow. It's more convenient
1358 to simply allow this than to try to prevent it. */
1361 else if (fn
&& DECL_TEMPLATE_SPECIALIZATION (spec
))
1363 if (DECL_TEMPLATE_INSTANTIATION (fn
))
1365 if (DECL_ODR_USED (fn
)
1366 || DECL_EXPLICIT_INSTANTIATION (fn
))
1368 error ("specialization of %qD after instantiation",
1370 return error_mark_node
;
1375 /* This situation should occur only if the first
1376 specialization is an implicit instantiation, the
1377 second is an explicit specialization, and the
1378 implicit instantiation has not yet been used. That
1379 situation can occur if we have implicitly
1380 instantiated a member function and then specialized
1383 We can also wind up here if a friend declaration that
1384 looked like an instantiation turns out to be a
1387 template <class T> void foo(T);
1388 class S { friend void foo<>(int) };
1389 template <> void foo(int);
1391 We transform the existing DECL in place so that any
1392 pointers to it become pointers to the updated
1395 If there was a definition for the template, but not
1396 for the specialization, we want this to look as if
1397 there were no definition, and vice versa. */
1398 DECL_INITIAL (fn
) = NULL_TREE
;
1399 duplicate_decls (spec
, fn
, is_friend
);
1400 /* The call to duplicate_decls will have applied
1403 An explicit specialization of a function template
1404 is inline only if it is explicitly declared to be,
1405 and independently of whether its function template
1408 to the primary function; now copy the inline bits to
1409 the various clones. */
1410 FOR_EACH_CLONE (clone
, fn
)
1412 DECL_DECLARED_INLINE_P (clone
)
1413 = DECL_DECLARED_INLINE_P (fn
);
1414 DECL_SOURCE_LOCATION (clone
)
1415 = DECL_SOURCE_LOCATION (fn
);
1417 check_specialization_namespace (fn
);
1422 else if (DECL_TEMPLATE_SPECIALIZATION (fn
))
1424 if (!duplicate_decls (spec
, fn
, is_friend
) && DECL_INITIAL (spec
))
1425 /* Dup decl failed, but this is a new definition. Set the
1426 line number so any errors match this new
1428 DECL_SOURCE_LOCATION (fn
) = DECL_SOURCE_LOCATION (spec
);
1434 return duplicate_decls (spec
, fn
, is_friend
);
1436 /* A specialization must be declared in the same namespace as the
1437 template it is specializing. */
1438 if (DECL_TEMPLATE_SPECIALIZATION (spec
)
1439 && !check_specialization_namespace (tmpl
))
1440 DECL_CONTEXT (spec
) = DECL_CONTEXT (tmpl
);
1442 if (slot
!= NULL
/* !optimize_specialization_lookup_p (tmpl) */)
1444 spec_entry
*entry
= ggc_alloc_spec_entry ();
1445 gcc_assert (tmpl
&& args
&& spec
);
1448 if (TREE_CODE (spec
) == FUNCTION_DECL
&& DECL_NAMESPACE_SCOPE_P (spec
)
1449 && PRIMARY_TEMPLATE_P (tmpl
)
1450 && DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (tmpl
)) == NULL_TREE
)
1451 /* TMPL is a forward declaration of a template function; keep a list
1452 of all specializations in case we need to reassign them to a friend
1453 template later in tsubst_friend_function. */
1454 DECL_TEMPLATE_INSTANTIATIONS (tmpl
)
1455 = tree_cons (args
, spec
, DECL_TEMPLATE_INSTANTIATIONS (tmpl
));
1461 /* Returns true iff two spec_entry nodes are equivalent. Only compares the
1462 TMPL and ARGS members, ignores SPEC. */
1465 eq_specializations (const void *p1
, const void *p2
)
1467 const spec_entry
*e1
= (const spec_entry
*)p1
;
1468 const spec_entry
*e2
= (const spec_entry
*)p2
;
1470 return (e1
->tmpl
== e2
->tmpl
1471 && comp_template_args (e1
->args
, e2
->args
));
1474 /* Returns a hash for a template TMPL and template arguments ARGS. */
1477 hash_tmpl_and_args (tree tmpl
, tree args
)
1479 hashval_t val
= DECL_UID (tmpl
);
1480 return iterative_hash_template_arg (args
, val
);
1483 /* Returns a hash for a spec_entry node based on the TMPL and ARGS members,
1487 hash_specialization (const void *p
)
1489 const spec_entry
*e
= (const spec_entry
*)p
;
1490 return hash_tmpl_and_args (e
->tmpl
, e
->args
);
1493 /* Recursively calculate a hash value for a template argument ARG, for use
1494 in the hash tables of template specializations. */
1497 iterative_hash_template_arg (tree arg
, hashval_t val
)
1499 unsigned HOST_WIDE_INT i
;
1500 enum tree_code code
;
1503 if (arg
== NULL_TREE
)
1504 return iterative_hash_object (arg
, val
);
1509 if (TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
1510 /* We can get one of these when re-hashing a previous entry in the middle
1511 of substituting into a pack expansion. Just look through it. */
1512 arg
= ARGUMENT_PACK_SELECT_FROM_PACK (arg
);
1514 code
= TREE_CODE (arg
);
1515 tclass
= TREE_CODE_CLASS (code
);
1517 val
= iterative_hash_object (code
, val
);
1524 case IDENTIFIER_NODE
:
1525 return iterative_hash_object (IDENTIFIER_HASH_VALUE (arg
), val
);
1529 int i
, len
= TREE_VEC_LENGTH (arg
);
1530 for (i
= 0; i
< len
; ++i
)
1531 val
= iterative_hash_template_arg (TREE_VEC_ELT (arg
, i
), val
);
1535 case TYPE_PACK_EXPANSION
:
1536 case EXPR_PACK_EXPANSION
:
1537 val
= iterative_hash_template_arg (PACK_EXPANSION_PATTERN (arg
), val
);
1538 return iterative_hash_template_arg (PACK_EXPANSION_EXTRA_ARGS (arg
), val
);
1540 case TYPE_ARGUMENT_PACK
:
1541 case NONTYPE_ARGUMENT_PACK
:
1542 return iterative_hash_template_arg (ARGUMENT_PACK_ARGS (arg
), val
);
1545 for (; arg
; arg
= TREE_CHAIN (arg
))
1546 val
= iterative_hash_template_arg (TREE_VALUE (arg
), val
);
1550 for (; arg
; arg
= OVL_NEXT (arg
))
1551 val
= iterative_hash_template_arg (OVL_CURRENT (arg
), val
);
1557 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (arg
), i
, field
, value
)
1559 val
= iterative_hash_template_arg (field
, val
);
1560 val
= iterative_hash_template_arg (value
, val
);
1566 if (!DECL_ARTIFICIAL (arg
))
1568 val
= iterative_hash_object (DECL_PARM_INDEX (arg
), val
);
1569 val
= iterative_hash_object (DECL_PARM_LEVEL (arg
), val
);
1571 return iterative_hash_template_arg (TREE_TYPE (arg
), val
);
1574 return iterative_hash_template_arg (TARGET_EXPR_INITIAL (arg
), val
);
1577 val
= iterative_hash_template_arg (PTRMEM_CST_CLASS (arg
), val
);
1578 return iterative_hash_template_arg (PTRMEM_CST_MEMBER (arg
), val
);
1580 case TEMPLATE_PARM_INDEX
:
1581 val
= iterative_hash_template_arg
1582 (TREE_TYPE (TEMPLATE_PARM_DECL (arg
)), val
);
1583 val
= iterative_hash_object (TEMPLATE_PARM_LEVEL (arg
), val
);
1584 return iterative_hash_object (TEMPLATE_PARM_IDX (arg
), val
);
1587 val
= iterative_hash_object (TRAIT_EXPR_KIND (arg
), val
);
1588 val
= iterative_hash_template_arg (TRAIT_EXPR_TYPE1 (arg
), val
);
1589 return iterative_hash_template_arg (TRAIT_EXPR_TYPE2 (arg
), val
);
1592 val
= iterative_hash_template_arg (BINFO_TYPE (BASELINK_BINFO (arg
)),
1594 return iterative_hash_template_arg (DECL_NAME (get_first_fn (arg
)),
1598 val
= iterative_hash_template_arg (TREE_OPERAND (arg
, 0), val
);
1599 code
= TREE_CODE (TREE_OPERAND (arg
, 1));
1600 val
= iterative_hash_object (code
, val
);
1601 return iterative_hash_template_arg (TREE_OPERAND (arg
, 2), val
);
1604 /* A lambda can't appear in a template arg, but don't crash on
1606 gcc_assert (seen_error ());
1610 case IMPLICIT_CONV_EXPR
:
1611 case STATIC_CAST_EXPR
:
1612 case REINTERPRET_CAST_EXPR
:
1613 case CONST_CAST_EXPR
:
1614 case DYNAMIC_CAST_EXPR
:
1616 val
= iterative_hash_template_arg (TREE_TYPE (arg
), val
);
1617 /* Now hash operands as usual. */
1627 if (TYPE_CANONICAL (arg
))
1628 return iterative_hash_object (TYPE_HASH (TYPE_CANONICAL (arg
)),
1630 else if (TREE_CODE (arg
) == DECLTYPE_TYPE
)
1631 return iterative_hash_template_arg (DECLTYPE_TYPE_EXPR (arg
), val
);
1632 /* Otherwise just compare the types during lookup. */
1635 case tcc_declaration
:
1637 return iterative_hash_expr (arg
, val
);
1640 gcc_assert (IS_EXPR_CODE_CLASS (tclass
));
1642 unsigned n
= cp_tree_operand_length (arg
);
1643 for (i
= 0; i
< n
; ++i
)
1644 val
= iterative_hash_template_arg (TREE_OPERAND (arg
, i
), val
);
1652 /* Unregister the specialization SPEC as a specialization of TMPL.
1653 Replace it with NEW_SPEC, if NEW_SPEC is non-NULL. Returns true
1654 if the SPEC was listed as a specialization of TMPL.
1656 Note that SPEC has been ggc_freed, so we can't look inside it. */
1659 reregister_specialization (tree spec
, tree tinfo
, tree new_spec
)
1664 elt
.tmpl
= most_general_template (TI_TEMPLATE (tinfo
));
1665 elt
.args
= TI_ARGS (tinfo
);
1666 elt
.spec
= NULL_TREE
;
1668 entry
= (spec_entry
*) htab_find (decl_specializations
, &elt
);
1671 gcc_assert (entry
->spec
== spec
|| entry
->spec
== new_spec
);
1672 gcc_assert (new_spec
!= NULL_TREE
);
1673 entry
->spec
= new_spec
;
1680 /* Compare an entry in the local specializations hash table P1 (which
1681 is really a pointer to a TREE_LIST) with P2 (which is really a
1685 eq_local_specializations (const void *p1
, const void *p2
)
1687 return TREE_VALUE ((const_tree
) p1
) == (const_tree
) p2
;
1690 /* Hash P1, an entry in the local specializations table. */
1693 hash_local_specialization (const void* p1
)
1695 return htab_hash_pointer (TREE_VALUE ((const_tree
) p1
));
1698 /* Like register_specialization, but for local declarations. We are
1699 registering SPEC, an instantiation of TMPL. */
1702 register_local_specialization (tree spec
, tree tmpl
)
1706 slot
= htab_find_slot_with_hash (local_specializations
, tmpl
,
1707 htab_hash_pointer (tmpl
), INSERT
);
1708 *slot
= build_tree_list (spec
, tmpl
);
1711 /* TYPE is a class type. Returns true if TYPE is an explicitly
1712 specialized class. */
1715 explicit_class_specialization_p (tree type
)
1717 if (!CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
1719 return !uses_template_parms (CLASSTYPE_TI_ARGS (type
));
1722 /* Print the list of functions at FNS, going through all the overloads
1723 for each element of the list. Alternatively, FNS can not be a
1724 TREE_LIST, in which case it will be printed together with all the
1727 MORE and *STR should respectively be FALSE and NULL when the function
1728 is called from the outside. They are used internally on recursive
1729 calls. print_candidates manages the two parameters and leaves NULL
1730 in *STR when it ends. */
1733 print_candidates_1 (tree fns
, bool more
, const char **str
)
1736 char *spaces
= NULL
;
1738 for (fn
= fns
; fn
; fn
= OVL_NEXT (fn
))
1739 if (TREE_CODE (fn
) == TREE_LIST
)
1741 for (fn2
= fn
; fn2
!= NULL_TREE
; fn2
= TREE_CHAIN (fn2
))
1742 print_candidates_1 (TREE_VALUE (fn2
),
1743 TREE_CHAIN (fn2
) || more
, str
);
1749 /* Pick the prefix string. */
1750 if (!more
&& !OVL_NEXT (fns
))
1752 error ("candidate is: %+#D", OVL_CURRENT (fn
));
1756 *str
= _("candidates are:");
1757 spaces
= get_spaces (*str
);
1759 error ("%s %+#D", *str
, OVL_CURRENT (fn
));
1760 *str
= spaces
? spaces
: *str
;
1770 /* Print the list of candidate FNS in an error message. FNS can also
1771 be a TREE_LIST of non-functions in the case of an ambiguous lookup. */
1774 print_candidates (tree fns
)
1776 const char *str
= NULL
;
1777 print_candidates_1 (fns
, false, &str
);
1778 gcc_assert (str
== NULL
);
1781 /* Returns the template (one of the functions given by TEMPLATE_ID)
1782 which can be specialized to match the indicated DECL with the
1783 explicit template args given in TEMPLATE_ID. The DECL may be
1784 NULL_TREE if none is available. In that case, the functions in
1785 TEMPLATE_ID are non-members.
1787 If NEED_MEMBER_TEMPLATE is nonzero the function is known to be a
1788 specialization of a member template.
1790 The TEMPLATE_COUNT is the number of references to qualifying
1791 template classes that appeared in the name of the function. See
1792 check_explicit_specialization for a more accurate description.
1794 TSK indicates what kind of template declaration (if any) is being
1795 declared. TSK_TEMPLATE indicates that the declaration given by
1796 DECL, though a FUNCTION_DECL, has template parameters, and is
1797 therefore a template function.
1799 The template args (those explicitly specified and those deduced)
1800 are output in a newly created vector *TARGS_OUT.
1802 If it is impossible to determine the result, an error message is
1803 issued. The error_mark_node is returned to indicate failure. */
1806 determine_specialization (tree template_id
,
1809 int need_member_template
,
1815 tree explicit_targs
;
1816 tree candidates
= NULL_TREE
;
1817 /* A TREE_LIST of templates of which DECL may be a specialization.
1818 The TREE_VALUE of each node is a TEMPLATE_DECL. The
1819 corresponding TREE_PURPOSE is the set of template arguments that,
1820 when used to instantiate the template, would produce a function
1821 with the signature of DECL. */
1822 tree templates
= NULL_TREE
;
1824 cp_binding_level
*b
;
1826 *targs_out
= NULL_TREE
;
1828 if (template_id
== error_mark_node
|| decl
== error_mark_node
)
1829 return error_mark_node
;
1831 fns
= TREE_OPERAND (template_id
, 0);
1832 explicit_targs
= TREE_OPERAND (template_id
, 1);
1834 if (fns
== error_mark_node
)
1835 return error_mark_node
;
1837 /* Check for baselinks. */
1838 if (BASELINK_P (fns
))
1839 fns
= BASELINK_FUNCTIONS (fns
);
1841 if (!is_overloaded_fn (fns
))
1843 error ("%qD is not a function template", fns
);
1844 return error_mark_node
;
1847 /* Count the number of template headers specified for this
1850 for (b
= current_binding_level
;
1851 b
->kind
== sk_template_parms
;
1855 for (; fns
; fns
= OVL_NEXT (fns
))
1857 tree fn
= OVL_CURRENT (fns
);
1859 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
1861 tree decl_arg_types
;
1864 /* In case of explicit specialization, we need to check if
1865 the number of template headers appearing in the specialization
1866 is correct. This is usually done in check_explicit_specialization,
1867 but the check done there cannot be exhaustive when specializing
1868 member functions. Consider the following code:
1870 template <> void A<int>::f(int);
1871 template <> template <> void A<int>::f(int);
1873 Assuming that A<int> is not itself an explicit specialization
1874 already, the first line specializes "f" which is a non-template
1875 member function, whilst the second line specializes "f" which
1876 is a template member function. So both lines are syntactically
1877 correct, and check_explicit_specialization does not reject
1880 Here, we can do better, as we are matching the specialization
1881 against the declarations. We count the number of template
1882 headers, and we check if they match TEMPLATE_COUNT + 1
1883 (TEMPLATE_COUNT is the number of qualifying template classes,
1884 plus there must be another header for the member template
1887 Notice that if header_count is zero, this is not a
1888 specialization but rather a template instantiation, so there
1889 is no check we can perform here. */
1890 if (header_count
&& header_count
!= template_count
+ 1)
1893 /* Check that the number of template arguments at the
1894 innermost level for DECL is the same as for FN. */
1895 if (current_binding_level
->kind
== sk_template_parms
1896 && !current_binding_level
->explicit_spec_p
1897 && (TREE_VEC_LENGTH (DECL_INNERMOST_TEMPLATE_PARMS (fn
))
1898 != TREE_VEC_LENGTH (INNERMOST_TEMPLATE_PARMS
1899 (current_template_parms
))))
1902 /* DECL might be a specialization of FN. */
1903 decl_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
1904 fn_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
1906 /* For a non-static member function, we need to make sure
1907 that the const qualification is the same. Since
1908 get_bindings does not try to merge the "this" parameter,
1909 we must do the comparison explicitly. */
1910 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
1911 && !same_type_p (TREE_VALUE (fn_arg_types
),
1912 TREE_VALUE (decl_arg_types
)))
1915 /* Skip the "this" parameter and, for constructors of
1916 classes with virtual bases, the VTT parameter. A
1917 full specialization of a constructor will have a VTT
1918 parameter, but a template never will. */
1920 = skip_artificial_parms_for (decl
, decl_arg_types
);
1922 = skip_artificial_parms_for (fn
, fn_arg_types
);
1924 /* Check that the number of function parameters matches.
1926 template <class T> void f(int i = 0);
1927 template <> void f<int>();
1928 The specialization f<int> is invalid but is not caught
1929 by get_bindings below. */
1930 if (list_length (fn_arg_types
) != list_length (decl_arg_types
))
1933 /* Function templates cannot be specializations; there are
1934 no partial specializations of functions. Therefore, if
1935 the type of DECL does not match FN, there is no
1937 if (tsk
== tsk_template
)
1939 if (compparms (fn_arg_types
, decl_arg_types
))
1940 candidates
= tree_cons (NULL_TREE
, fn
, candidates
);
1944 /* See whether this function might be a specialization of this
1946 targs
= get_bindings (fn
, decl
, explicit_targs
, /*check_ret=*/true);
1949 /* We cannot deduce template arguments that when used to
1950 specialize TMPL will produce DECL. */
1953 /* Save this template, and the arguments deduced. */
1954 templates
= tree_cons (targs
, fn
, templates
);
1956 else if (need_member_template
)
1957 /* FN is an ordinary member function, and we need a
1958 specialization of a member template. */
1960 else if (TREE_CODE (fn
) != FUNCTION_DECL
)
1961 /* We can get IDENTIFIER_NODEs here in certain erroneous
1964 else if (!DECL_FUNCTION_MEMBER_P (fn
))
1965 /* This is just an ordinary non-member function. Nothing can
1966 be a specialization of that. */
1968 else if (DECL_ARTIFICIAL (fn
))
1969 /* Cannot specialize functions that are created implicitly. */
1973 tree decl_arg_types
;
1975 /* This is an ordinary member function. However, since
1976 we're here, we can assume it's enclosing class is a
1977 template class. For example,
1979 template <typename T> struct S { void f(); };
1980 template <> void S<int>::f() {}
1982 Here, S<int>::f is a non-template, but S<int> is a
1983 template class. If FN has the same type as DECL, we
1984 might be in business. */
1986 if (!DECL_TEMPLATE_INFO (fn
))
1987 /* Its enclosing class is an explicit specialization
1988 of a template class. This is not a candidate. */
1991 if (!same_type_p (TREE_TYPE (TREE_TYPE (decl
)),
1992 TREE_TYPE (TREE_TYPE (fn
))))
1993 /* The return types differ. */
1996 /* Adjust the type of DECL in case FN is a static member. */
1997 decl_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
1998 if (DECL_STATIC_FUNCTION_P (fn
)
1999 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
2000 decl_arg_types
= TREE_CHAIN (decl_arg_types
);
2002 if (compparms (TYPE_ARG_TYPES (TREE_TYPE (fn
)),
2005 candidates
= tree_cons (NULL_TREE
, fn
, candidates
);
2009 if (templates
&& TREE_CHAIN (templates
))
2015 It is possible for a specialization with a given function
2016 signature to be instantiated from more than one function
2017 template. In such cases, explicit specification of the
2018 template arguments must be used to uniquely identify the
2019 function template specialization being specialized.
2021 Note that here, there's no suggestion that we're supposed to
2022 determine which of the candidate templates is most
2023 specialized. However, we, also have:
2027 Partial ordering of overloaded function template
2028 declarations is used in the following contexts to select
2029 the function template to which a function template
2030 specialization refers:
2032 -- when an explicit specialization refers to a function
2035 So, we do use the partial ordering rules, at least for now.
2036 This extension can only serve to make invalid programs valid,
2037 so it's safe. And, there is strong anecdotal evidence that
2038 the committee intended the partial ordering rules to apply;
2039 the EDG front end has that behavior, and John Spicer claims
2040 that the committee simply forgot to delete the wording in
2041 [temp.expl.spec]. */
2042 tree tmpl
= most_specialized_instantiation (templates
);
2043 if (tmpl
!= error_mark_node
)
2046 TREE_CHAIN (templates
) = NULL_TREE
;
2050 if (templates
== NULL_TREE
&& candidates
== NULL_TREE
)
2052 error ("template-id %qD for %q+D does not match any template "
2053 "declaration", template_id
, decl
);
2054 if (header_count
&& header_count
!= template_count
+ 1)
2055 inform (input_location
, "saw %d %<template<>%>, need %d for "
2056 "specializing a member function template",
2057 header_count
, template_count
+ 1);
2058 return error_mark_node
;
2060 else if ((templates
&& TREE_CHAIN (templates
))
2061 || (candidates
&& TREE_CHAIN (candidates
))
2062 || (templates
&& candidates
))
2064 error ("ambiguous template specialization %qD for %q+D",
2066 candidates
= chainon (candidates
, templates
);
2067 print_candidates (candidates
);
2068 return error_mark_node
;
2071 /* We have one, and exactly one, match. */
2074 tree fn
= TREE_VALUE (candidates
);
2075 *targs_out
= copy_node (DECL_TI_ARGS (fn
));
2076 /* DECL is a re-declaration or partial instantiation of a template
2078 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
2080 /* It was a specialization of an ordinary member function in a
2082 return DECL_TI_TEMPLATE (fn
);
2085 /* It was a specialization of a template. */
2086 targs
= DECL_TI_ARGS (DECL_TEMPLATE_RESULT (TREE_VALUE (templates
)));
2087 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (targs
))
2089 *targs_out
= copy_node (targs
);
2090 SET_TMPL_ARGS_LEVEL (*targs_out
,
2091 TMPL_ARGS_DEPTH (*targs_out
),
2092 TREE_PURPOSE (templates
));
2095 *targs_out
= TREE_PURPOSE (templates
);
2096 return TREE_VALUE (templates
);
2099 /* Returns a chain of parameter types, exactly like the SPEC_TYPES,
2100 but with the default argument values filled in from those in the
2104 copy_default_args_to_explicit_spec_1 (tree spec_types
,
2107 tree new_spec_types
;
2112 if (spec_types
== void_list_node
)
2113 return void_list_node
;
2115 /* Substitute into the rest of the list. */
2117 copy_default_args_to_explicit_spec_1 (TREE_CHAIN (spec_types
),
2118 TREE_CHAIN (tmpl_types
));
2120 /* Add the default argument for this parameter. */
2121 return hash_tree_cons (TREE_PURPOSE (tmpl_types
),
2122 TREE_VALUE (spec_types
),
2126 /* DECL is an explicit specialization. Replicate default arguments
2127 from the template it specializes. (That way, code like:
2129 template <class T> void f(T = 3);
2130 template <> void f(double);
2133 works, as required.) An alternative approach would be to look up
2134 the correct default arguments at the call-site, but this approach
2135 is consistent with how implicit instantiations are handled. */
2138 copy_default_args_to_explicit_spec (tree decl
)
2143 tree new_spec_types
;
2147 tree object_type
= NULL_TREE
;
2148 tree in_charge
= NULL_TREE
;
2149 tree vtt
= NULL_TREE
;
2151 /* See if there's anything we need to do. */
2152 tmpl
= DECL_TI_TEMPLATE (decl
);
2153 tmpl_types
= TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (tmpl
)));
2154 for (t
= tmpl_types
; t
; t
= TREE_CHAIN (t
))
2155 if (TREE_PURPOSE (t
))
2160 old_type
= TREE_TYPE (decl
);
2161 spec_types
= TYPE_ARG_TYPES (old_type
);
2163 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
2165 /* Remove the this pointer, but remember the object's type for
2167 object_type
= TREE_TYPE (TREE_VALUE (spec_types
));
2168 spec_types
= TREE_CHAIN (spec_types
);
2169 tmpl_types
= TREE_CHAIN (tmpl_types
);
2171 if (DECL_HAS_IN_CHARGE_PARM_P (decl
))
2173 /* DECL may contain more parameters than TMPL due to the extra
2174 in-charge parameter in constructors and destructors. */
2175 in_charge
= spec_types
;
2176 spec_types
= TREE_CHAIN (spec_types
);
2178 if (DECL_HAS_VTT_PARM_P (decl
))
2181 spec_types
= TREE_CHAIN (spec_types
);
2185 /* Compute the merged default arguments. */
2187 copy_default_args_to_explicit_spec_1 (spec_types
, tmpl_types
);
2189 /* Compute the new FUNCTION_TYPE. */
2193 new_spec_types
= hash_tree_cons (TREE_PURPOSE (vtt
),
2198 /* Put the in-charge parameter back. */
2199 new_spec_types
= hash_tree_cons (TREE_PURPOSE (in_charge
),
2200 TREE_VALUE (in_charge
),
2203 new_type
= build_method_type_directly (object_type
,
2204 TREE_TYPE (old_type
),
2208 new_type
= build_function_type (TREE_TYPE (old_type
),
2210 new_type
= cp_build_type_attribute_variant (new_type
,
2211 TYPE_ATTRIBUTES (old_type
));
2212 new_type
= build_exception_variant (new_type
,
2213 TYPE_RAISES_EXCEPTIONS (old_type
));
2214 TREE_TYPE (decl
) = new_type
;
2217 /* Check to see if the function just declared, as indicated in
2218 DECLARATOR, and in DECL, is a specialization of a function
2219 template. We may also discover that the declaration is an explicit
2220 instantiation at this point.
2222 Returns DECL, or an equivalent declaration that should be used
2223 instead if all goes well. Issues an error message if something is
2224 amiss. Returns error_mark_node if the error is not easily
2227 FLAGS is a bitmask consisting of the following flags:
2229 2: The function has a definition.
2230 4: The function is a friend.
2232 The TEMPLATE_COUNT is the number of references to qualifying
2233 template classes that appeared in the name of the function. For
2236 template <class T> struct S { void f(); };
2239 the TEMPLATE_COUNT would be 1. However, explicitly specialized
2240 classes are not counted in the TEMPLATE_COUNT, so that in
2242 template <class T> struct S {};
2243 template <> struct S<int> { void f(); }
2244 template <> void S<int>::f();
2246 the TEMPLATE_COUNT would be 0. (Note that this declaration is
2247 invalid; there should be no template <>.)
2249 If the function is a specialization, it is marked as such via
2250 DECL_TEMPLATE_SPECIALIZATION. Furthermore, its DECL_TEMPLATE_INFO
2251 is set up correctly, and it is added to the list of specializations
2252 for that template. */
2255 check_explicit_specialization (tree declarator
,
2260 int have_def
= flags
& 2;
2261 int is_friend
= flags
& 4;
2262 int specialization
= 0;
2263 int explicit_instantiation
= 0;
2264 int member_specialization
= 0;
2265 tree ctype
= DECL_CLASS_CONTEXT (decl
);
2266 tree dname
= DECL_NAME (decl
);
2271 if (!processing_specialization
)
2274 tsk
= tsk_excessive_parms
;
2277 tsk
= current_tmpl_spec_kind (template_count
);
2282 if (processing_specialization
)
2285 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
2287 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
2290 /* This could be something like:
2292 template <class T> void f(T);
2293 class S { friend void f<>(int); } */
2297 /* This case handles bogus declarations like template <>
2298 template <class T> void f<int>(); */
2300 error ("template-id %qD in declaration of primary template",
2307 case tsk_invalid_member_spec
:
2308 /* The error has already been reported in
2309 check_specialization_scope. */
2310 return error_mark_node
;
2312 case tsk_invalid_expl_inst
:
2313 error ("template parameter list used in explicit instantiation");
2319 error ("definition provided for explicit instantiation");
2321 explicit_instantiation
= 1;
2324 case tsk_excessive_parms
:
2325 case tsk_insufficient_parms
:
2326 if (tsk
== tsk_excessive_parms
)
2327 error ("too many template parameter lists in declaration of %qD",
2329 else if (template_header_count
)
2330 error("too few template parameter lists in declaration of %qD", decl
);
2332 error("explicit specialization of %qD must be introduced by "
2333 "%<template <>%>", decl
);
2337 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
2339 member_specialization
= 1;
2345 if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
2347 /* This case handles bogus declarations like template <>
2348 template <class T> void f<int>(); */
2350 if (uses_template_parms (declarator
))
2351 error ("function template partial specialization %qD "
2352 "is not allowed", declarator
);
2354 error ("template-id %qD in declaration of primary template",
2359 if (ctype
&& CLASSTYPE_TEMPLATE_INSTANTIATION (ctype
))
2360 /* This is a specialization of a member template, without
2361 specialization the containing class. Something like:
2363 template <class T> struct S {
2364 template <class U> void f (U);
2366 template <> template <class U> void S<int>::f(U) {}
2368 That's a specialization -- but of the entire template. */
2376 if (specialization
|| member_specialization
)
2378 tree t
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
2379 for (; t
; t
= TREE_CHAIN (t
))
2380 if (TREE_PURPOSE (t
))
2382 permerror (input_location
,
2383 "default argument specified in explicit specialization");
2388 if (specialization
|| member_specialization
|| explicit_instantiation
)
2390 tree tmpl
= NULL_TREE
;
2391 tree targs
= NULL_TREE
;
2393 /* Make sure that the declarator is a TEMPLATE_ID_EXPR. */
2394 if (TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
2398 gcc_assert (TREE_CODE (declarator
) == IDENTIFIER_NODE
);
2403 /* If there is no class context, the explicit instantiation
2404 must be at namespace scope. */
2405 gcc_assert (DECL_NAMESPACE_SCOPE_P (decl
));
2407 /* Find the namespace binding, using the declaration
2409 fns
= lookup_qualified_name (CP_DECL_CONTEXT (decl
), dname
,
2411 if (fns
== error_mark_node
|| !is_overloaded_fn (fns
))
2413 error ("%qD is not a template function", dname
);
2414 fns
= error_mark_node
;
2418 tree fn
= OVL_CURRENT (fns
);
2419 if (!is_associated_namespace (CP_DECL_CONTEXT (decl
),
2420 CP_DECL_CONTEXT (fn
)))
2421 error ("%qD is not declared in %qD",
2422 decl
, current_namespace
);
2426 declarator
= lookup_template_function (fns
, NULL_TREE
);
2429 if (declarator
== error_mark_node
)
2430 return error_mark_node
;
2432 if (ctype
!= NULL_TREE
&& TYPE_BEING_DEFINED (ctype
))
2434 if (!explicit_instantiation
)
2435 /* A specialization in class scope. This is invalid,
2436 but the error will already have been flagged by
2437 check_specialization_scope. */
2438 return error_mark_node
;
2441 /* It's not valid to write an explicit instantiation in
2444 class C { template void f(); }
2446 This case is caught by the parser. However, on
2449 template class C { void f(); };
2451 (which is invalid) we can get here. The error will be
2458 else if (ctype
!= NULL_TREE
2459 && (TREE_CODE (TREE_OPERAND (declarator
, 0)) ==
2462 /* Find the list of functions in ctype that have the same
2463 name as the declared function. */
2464 tree name
= TREE_OPERAND (declarator
, 0);
2465 tree fns
= NULL_TREE
;
2468 if (constructor_name_p (name
, ctype
))
2470 int is_constructor
= DECL_CONSTRUCTOR_P (decl
);
2472 if (is_constructor
? !TYPE_HAS_USER_CONSTRUCTOR (ctype
)
2473 : !CLASSTYPE_DESTRUCTORS (ctype
))
2475 /* From [temp.expl.spec]:
2477 If such an explicit specialization for the member
2478 of a class template names an implicitly-declared
2479 special member function (clause _special_), the
2480 program is ill-formed.
2482 Similar language is found in [temp.explicit]. */
2483 error ("specialization of implicitly-declared special member function");
2484 return error_mark_node
;
2487 name
= is_constructor
? ctor_identifier
: dtor_identifier
;
2490 if (!DECL_CONV_FN_P (decl
))
2492 idx
= lookup_fnfields_1 (ctype
, name
);
2494 fns
= VEC_index (tree
, CLASSTYPE_METHOD_VEC (ctype
), idx
);
2498 VEC(tree
,gc
) *methods
;
2501 /* For a type-conversion operator, we cannot do a
2502 name-based lookup. We might be looking for `operator
2503 int' which will be a specialization of `operator T'.
2504 So, we find *all* the conversion operators, and then
2505 select from them. */
2508 methods
= CLASSTYPE_METHOD_VEC (ctype
);
2510 for (idx
= CLASSTYPE_FIRST_CONVERSION_SLOT
;
2511 VEC_iterate (tree
, methods
, idx
, ovl
);
2514 if (!DECL_CONV_FN_P (OVL_CURRENT (ovl
)))
2515 /* There are no more conversion functions. */
2518 /* Glue all these conversion functions together
2519 with those we already have. */
2520 for (; ovl
; ovl
= OVL_NEXT (ovl
))
2521 fns
= ovl_cons (OVL_CURRENT (ovl
), fns
);
2525 if (fns
== NULL_TREE
)
2527 error ("no member function %qD declared in %qT", name
, ctype
);
2528 return error_mark_node
;
2531 TREE_OPERAND (declarator
, 0) = fns
;
2534 /* Figure out what exactly is being specialized at this point.
2535 Note that for an explicit instantiation, even one for a
2536 member function, we cannot tell apriori whether the
2537 instantiation is for a member template, or just a member
2538 function of a template class. Even if a member template is
2539 being instantiated, the member template arguments may be
2540 elided if they can be deduced from the rest of the
2542 tmpl
= determine_specialization (declarator
, decl
,
2544 member_specialization
,
2548 if (!tmpl
|| tmpl
== error_mark_node
)
2549 /* We couldn't figure out what this declaration was
2551 return error_mark_node
;
2554 tree gen_tmpl
= most_general_template (tmpl
);
2556 if (explicit_instantiation
)
2558 /* We don't set DECL_EXPLICIT_INSTANTIATION here; that
2559 is done by do_decl_instantiation later. */
2561 int arg_depth
= TMPL_ARGS_DEPTH (targs
);
2562 int parm_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
2564 if (arg_depth
> parm_depth
)
2566 /* If TMPL is not the most general template (for
2567 example, if TMPL is a friend template that is
2568 injected into namespace scope), then there will
2569 be too many levels of TARGS. Remove some of them
2574 new_targs
= make_tree_vec (parm_depth
);
2575 for (i
= arg_depth
- parm_depth
; i
< arg_depth
; ++i
)
2576 TREE_VEC_ELT (new_targs
, i
- (arg_depth
- parm_depth
))
2577 = TREE_VEC_ELT (targs
, i
);
2581 return instantiate_template (tmpl
, targs
, tf_error
);
2584 /* If we thought that the DECL was a member function, but it
2585 turns out to be specializing a static member function,
2586 make DECL a static member function as well. */
2587 if (DECL_STATIC_FUNCTION_P (tmpl
)
2588 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
2589 revert_static_member_fn (decl
);
2591 /* If this is a specialization of a member template of a
2592 template class, we want to return the TEMPLATE_DECL, not
2593 the specialization of it. */
2594 if (tsk
== tsk_template
)
2596 tree result
= DECL_TEMPLATE_RESULT (tmpl
);
2597 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
2598 DECL_INITIAL (result
) = NULL_TREE
;
2602 DECL_SOURCE_LOCATION (tmpl
) = DECL_SOURCE_LOCATION (decl
);
2603 DECL_SOURCE_LOCATION (result
)
2604 = DECL_SOURCE_LOCATION (decl
);
2605 /* We want to use the argument list specified in the
2606 definition, not in the original declaration. */
2607 DECL_ARGUMENTS (result
) = DECL_ARGUMENTS (decl
);
2608 for (parm
= DECL_ARGUMENTS (result
); parm
;
2609 parm
= DECL_CHAIN (parm
))
2610 DECL_CONTEXT (parm
) = result
;
2612 return register_specialization (tmpl
, gen_tmpl
, targs
,
2616 /* Set up the DECL_TEMPLATE_INFO for DECL. */
2617 DECL_TEMPLATE_INFO (decl
) = build_template_info (tmpl
, targs
);
2619 /* Inherit default function arguments from the template
2620 DECL is specializing. */
2621 copy_default_args_to_explicit_spec (decl
);
2623 /* This specialization has the same protection as the
2624 template it specializes. */
2625 TREE_PRIVATE (decl
) = TREE_PRIVATE (gen_tmpl
);
2626 TREE_PROTECTED (decl
) = TREE_PROTECTED (gen_tmpl
);
2628 /* 7.1.1-1 [dcl.stc]
2630 A storage-class-specifier shall not be specified in an
2631 explicit specialization...
2633 The parser rejects these, so unless action is taken here,
2634 explicit function specializations will always appear with
2637 The action recommended by the C++ CWG in response to C++
2638 defect report 605 is to make the storage class and linkage
2639 of the explicit specialization match the templated function:
2641 http://www.open-std.org/jtc1/sc22/wg21/docs/cwg_active.html#605
2643 if (tsk
== tsk_expl_spec
&& DECL_FUNCTION_TEMPLATE_P (gen_tmpl
))
2645 tree tmpl_func
= DECL_TEMPLATE_RESULT (gen_tmpl
);
2646 gcc_assert (TREE_CODE (tmpl_func
) == FUNCTION_DECL
);
2648 /* This specialization has the same linkage and visibility as
2649 the function template it specializes. */
2650 TREE_PUBLIC (decl
) = TREE_PUBLIC (tmpl_func
);
2651 if (! TREE_PUBLIC (decl
))
2653 DECL_INTERFACE_KNOWN (decl
) = 1;
2654 DECL_NOT_REALLY_EXTERN (decl
) = 1;
2656 DECL_THIS_STATIC (decl
) = DECL_THIS_STATIC (tmpl_func
);
2657 if (DECL_VISIBILITY_SPECIFIED (tmpl_func
))
2659 DECL_VISIBILITY_SPECIFIED (decl
) = 1;
2660 DECL_VISIBILITY (decl
) = DECL_VISIBILITY (tmpl_func
);
2664 /* If DECL is a friend declaration, declared using an
2665 unqualified name, the namespace associated with DECL may
2666 have been set incorrectly. For example, in:
2668 template <typename T> void f(T);
2670 struct S { friend void f<int>(int); }
2673 we will have set the DECL_CONTEXT for the friend
2674 declaration to N, rather than to the global namespace. */
2675 if (DECL_NAMESPACE_SCOPE_P (decl
))
2676 DECL_CONTEXT (decl
) = DECL_CONTEXT (tmpl
);
2678 if (is_friend
&& !have_def
)
2679 /* This is not really a declaration of a specialization.
2680 It's just the name of an instantiation. But, it's not
2681 a request for an instantiation, either. */
2682 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
2683 else if (DECL_CONSTRUCTOR_P (decl
) || DECL_DESTRUCTOR_P (decl
))
2684 /* This is indeed a specialization. In case of constructors
2685 and destructors, we need in-charge and not-in-charge
2686 versions in V3 ABI. */
2687 clone_function_decl (decl
, /*update_method_vec_p=*/0);
2689 /* Register this specialization so that we can find it
2691 decl
= register_specialization (decl
, gen_tmpl
, targs
, is_friend
, 0);
2698 /* Returns 1 iff PARMS1 and PARMS2 are identical sets of template
2699 parameters. These are represented in the same format used for
2700 DECL_TEMPLATE_PARMS. */
2703 comp_template_parms (const_tree parms1
, const_tree parms2
)
2708 if (parms1
== parms2
)
2711 for (p1
= parms1
, p2
= parms2
;
2712 p1
!= NULL_TREE
&& p2
!= NULL_TREE
;
2713 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
))
2715 tree t1
= TREE_VALUE (p1
);
2716 tree t2
= TREE_VALUE (p2
);
2719 gcc_assert (TREE_CODE (t1
) == TREE_VEC
);
2720 gcc_assert (TREE_CODE (t2
) == TREE_VEC
);
2722 if (TREE_VEC_LENGTH (t1
) != TREE_VEC_LENGTH (t2
))
2725 for (i
= 0; i
< TREE_VEC_LENGTH (t2
); ++i
)
2727 tree parm1
= TREE_VALUE (TREE_VEC_ELT (t1
, i
));
2728 tree parm2
= TREE_VALUE (TREE_VEC_ELT (t2
, i
));
2730 /* If either of the template parameters are invalid, assume
2731 they match for the sake of error recovery. */
2732 if (parm1
== error_mark_node
|| parm2
== error_mark_node
)
2735 if (TREE_CODE (parm1
) != TREE_CODE (parm2
))
2738 if (TREE_CODE (parm1
) == TEMPLATE_TYPE_PARM
2739 && (TEMPLATE_TYPE_PARAMETER_PACK (parm1
)
2740 == TEMPLATE_TYPE_PARAMETER_PACK (parm2
)))
2742 else if (!same_type_p (TREE_TYPE (parm1
), TREE_TYPE (parm2
)))
2747 if ((p1
!= NULL_TREE
) != (p2
!= NULL_TREE
))
2748 /* One set of parameters has more parameters lists than the
2755 /* Determine whether PARM is a parameter pack. */
2758 template_parameter_pack_p (const_tree parm
)
2760 /* Determine if we have a non-type template parameter pack. */
2761 if (TREE_CODE (parm
) == PARM_DECL
)
2762 return (DECL_TEMPLATE_PARM_P (parm
)
2763 && TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)));
2764 if (TREE_CODE (parm
) == TEMPLATE_PARM_INDEX
)
2765 return TEMPLATE_PARM_PARAMETER_PACK (parm
);
2767 /* If this is a list of template parameters, we could get a
2768 TYPE_DECL or a TEMPLATE_DECL. */
2769 if (TREE_CODE (parm
) == TYPE_DECL
|| TREE_CODE (parm
) == TEMPLATE_DECL
)
2770 parm
= TREE_TYPE (parm
);
2772 /* Otherwise it must be a type template parameter. */
2773 return ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
2774 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
)
2775 && TEMPLATE_TYPE_PARAMETER_PACK (parm
));
2778 /* Determine if T is a function parameter pack. */
2781 function_parameter_pack_p (const_tree t
)
2783 if (t
&& TREE_CODE (t
) == PARM_DECL
)
2784 return FUNCTION_PARAMETER_PACK_P (t
);
2788 /* Return the function template declaration of PRIMARY_FUNC_TMPL_INST.
2789 PRIMARY_FUNC_TMPL_INST is a primary function template instantiation. */
2792 get_function_template_decl (const_tree primary_func_tmpl_inst
)
2794 if (! primary_func_tmpl_inst
2795 || TREE_CODE (primary_func_tmpl_inst
) != FUNCTION_DECL
2796 || ! primary_template_instantiation_p (primary_func_tmpl_inst
))
2799 return DECL_TEMPLATE_RESULT (DECL_TI_TEMPLATE (primary_func_tmpl_inst
));
2802 /* Return true iff the function parameter PARAM_DECL was expanded
2803 from the function parameter pack PACK. */
2806 function_parameter_expanded_from_pack_p (tree param_decl
, tree pack
)
2808 if (DECL_ARTIFICIAL (param_decl
)
2809 || !function_parameter_pack_p (pack
))
2812 /* The parameter pack and its pack arguments have the same
2814 return DECL_PARM_INDEX (pack
) == DECL_PARM_INDEX (param_decl
);
2817 /* Determine whether ARGS describes a variadic template args list,
2818 i.e., one that is terminated by a template argument pack. */
2821 template_args_variadic_p (tree args
)
2826 if (args
== NULL_TREE
)
2829 args
= INNERMOST_TEMPLATE_ARGS (args
);
2830 nargs
= TREE_VEC_LENGTH (args
);
2835 last_parm
= TREE_VEC_ELT (args
, nargs
- 1);
2837 return ARGUMENT_PACK_P (last_parm
);
2840 /* Generate a new name for the parameter pack name NAME (an
2841 IDENTIFIER_NODE) that incorporates its */
2844 make_ith_pack_parameter_name (tree name
, int i
)
2846 /* Munge the name to include the parameter index. */
2847 #define NUMBUF_LEN 128
2848 char numbuf
[NUMBUF_LEN
];
2852 snprintf (numbuf
, NUMBUF_LEN
, "%i", i
);
2853 newname_len
= IDENTIFIER_LENGTH (name
)
2854 + strlen (numbuf
) + 2;
2855 newname
= (char*)alloca (newname_len
);
2856 snprintf (newname
, newname_len
,
2857 "%s#%i", IDENTIFIER_POINTER (name
), i
);
2858 return get_identifier (newname
);
2861 /* Return true if T is a primary function, class or alias template
2865 primary_template_instantiation_p (const_tree t
)
2870 if (TREE_CODE (t
) == FUNCTION_DECL
)
2871 return DECL_LANG_SPECIFIC (t
)
2872 && DECL_TEMPLATE_INSTANTIATION (t
)
2873 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (t
));
2874 else if (CLASS_TYPE_P (t
) && !TYPE_DECL_ALIAS_P (TYPE_NAME (t
)))
2875 return CLASSTYPE_TEMPLATE_INSTANTIATION (t
)
2876 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (t
));
2878 && TYPE_TEMPLATE_INFO (t
)
2879 && PRIMARY_TEMPLATE_P (TYPE_TI_TEMPLATE (t
))
2880 && DECL_TEMPLATE_INSTANTIATION (TYPE_NAME (t
)))
2885 /* Return true if PARM is a template template parameter. */
2888 template_template_parameter_p (const_tree parm
)
2890 return DECL_TEMPLATE_TEMPLATE_PARM_P (parm
);
2893 /* Return the template parameters of T if T is a
2894 primary template instantiation, NULL otherwise. */
2897 get_primary_template_innermost_parameters (const_tree t
)
2899 tree parms
= NULL
, template_info
= NULL
;
2901 if ((template_info
= get_template_info (t
))
2902 && primary_template_instantiation_p (t
))
2903 parms
= INNERMOST_TEMPLATE_PARMS
2904 (DECL_TEMPLATE_PARMS (TI_TEMPLATE (template_info
)));
2909 /* Return the template parameters of the LEVELth level from the full list
2910 of template parameters PARMS. */
2913 get_template_parms_at_level (tree parms
, int level
)
2917 || TREE_CODE (parms
) != TREE_LIST
2918 || level
> TMPL_PARMS_DEPTH (parms
))
2921 for (p
= parms
; p
; p
= TREE_CHAIN (p
))
2922 if (TMPL_PARMS_DEPTH (p
) == level
)
2928 /* Returns the template arguments of T if T is a template instantiation,
2932 get_template_innermost_arguments (const_tree t
)
2934 tree args
= NULL
, template_info
= NULL
;
2936 if ((template_info
= get_template_info (t
))
2937 && TI_ARGS (template_info
))
2938 args
= INNERMOST_TEMPLATE_ARGS (TI_ARGS (template_info
));
2943 /* Return the argument pack elements of T if T is a template argument pack,
2947 get_template_argument_pack_elems (const_tree t
)
2949 if (TREE_CODE (t
) != TYPE_ARGUMENT_PACK
2950 && TREE_CODE (t
) != NONTYPE_ARGUMENT_PACK
)
2953 return ARGUMENT_PACK_ARGS (t
);
2956 /* Structure used to track the progress of find_parameter_packs_r. */
2957 struct find_parameter_pack_data
2959 /* TREE_LIST that will contain all of the parameter packs found by
2961 tree
* parameter_packs
;
2963 /* Set of AST nodes that have been visited by the traversal. */
2964 struct pointer_set_t
*visited
;
2967 /* Identifies all of the argument packs that occur in a template
2968 argument and appends them to the TREE_LIST inside DATA, which is a
2969 find_parameter_pack_data structure. This is a subroutine of
2970 make_pack_expansion and uses_parameter_packs. */
2972 find_parameter_packs_r (tree
*tp
, int *walk_subtrees
, void* data
)
2975 struct find_parameter_pack_data
* ppd
=
2976 (struct find_parameter_pack_data
*)data
;
2977 bool parameter_pack_p
= false;
2979 /* Identify whether this is a parameter pack or not. */
2980 switch (TREE_CODE (t
))
2982 case TEMPLATE_PARM_INDEX
:
2983 if (TEMPLATE_PARM_PARAMETER_PACK (t
))
2984 parameter_pack_p
= true;
2987 case TEMPLATE_TYPE_PARM
:
2988 t
= TYPE_MAIN_VARIANT (t
);
2989 case TEMPLATE_TEMPLATE_PARM
:
2990 if (TEMPLATE_TYPE_PARAMETER_PACK (t
))
2991 parameter_pack_p
= true;
2995 if (FUNCTION_PARAMETER_PACK_P (t
))
2997 /* We don't want to walk into the type of a PARM_DECL,
2998 because we don't want to see the type parameter pack. */
3000 parameter_pack_p
= true;
3005 parameter_pack_p
= true;
3008 /* Not a parameter pack. */
3012 if (parameter_pack_p
)
3014 /* Add this parameter pack to the list. */
3015 *ppd
->parameter_packs
= tree_cons (NULL_TREE
, t
, *ppd
->parameter_packs
);
3019 cp_walk_tree (&TYPE_CONTEXT (t
),
3020 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3022 /* This switch statement will return immediately if we don't find a
3024 switch (TREE_CODE (t
))
3026 case TEMPLATE_PARM_INDEX
:
3029 case BOUND_TEMPLATE_TEMPLATE_PARM
:
3030 /* Check the template itself. */
3031 cp_walk_tree (&TREE_TYPE (TYPE_TI_TEMPLATE (t
)),
3032 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3033 /* Check the template arguments. */
3034 cp_walk_tree (&TYPE_TI_ARGS (t
), &find_parameter_packs_r
, ppd
,
3039 case TEMPLATE_TYPE_PARM
:
3040 case TEMPLATE_TEMPLATE_PARM
:
3047 if (TYPE_PTRMEMFUNC_P (t
))
3053 if (TYPE_TEMPLATE_INFO (t
))
3054 cp_walk_tree (&TI_ARGS (TYPE_TEMPLATE_INFO (t
)),
3055 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3062 cp_walk_tree (&TREE_TYPE (t
),
3063 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3067 cp_walk_tree (&TYPENAME_TYPE_FULLNAME (t
), &find_parameter_packs_r
,
3072 case TYPE_PACK_EXPANSION
:
3073 case EXPR_PACK_EXPANSION
:
3078 cp_walk_tree (&TYPE_MAX_VALUE (t
), &find_parameter_packs_r
,
3083 case IDENTIFIER_NODE
:
3084 cp_walk_tree (&TREE_TYPE (t
), &find_parameter_packs_r
, ppd
,
3096 /* Determines if the expression or type T uses any parameter packs. */
3098 uses_parameter_packs (tree t
)
3100 tree parameter_packs
= NULL_TREE
;
3101 struct find_parameter_pack_data ppd
;
3102 ppd
.parameter_packs
= ¶meter_packs
;
3103 ppd
.visited
= pointer_set_create ();
3104 cp_walk_tree (&t
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
3105 pointer_set_destroy (ppd
.visited
);
3106 return parameter_packs
!= NULL_TREE
;
3109 /* Turn ARG, which may be an expression, type, or a TREE_LIST
3110 representation a base-class initializer into a parameter pack
3111 expansion. If all goes well, the resulting node will be an
3112 EXPR_PACK_EXPANSION, TYPE_PACK_EXPANSION, or TREE_LIST,
3115 make_pack_expansion (tree arg
)
3118 tree parameter_packs
= NULL_TREE
;
3119 bool for_types
= false;
3120 struct find_parameter_pack_data ppd
;
3122 if (!arg
|| arg
== error_mark_node
)
3125 if (TREE_CODE (arg
) == TREE_LIST
)
3127 /* The only time we will see a TREE_LIST here is for a base
3128 class initializer. In this case, the TREE_PURPOSE will be a
3129 _TYPE node (representing the base class expansion we're
3130 initializing) and the TREE_VALUE will be a TREE_LIST
3131 containing the initialization arguments.
3133 The resulting expansion looks somewhat different from most
3134 expansions. Rather than returning just one _EXPANSION, we
3135 return a TREE_LIST whose TREE_PURPOSE is a
3136 TYPE_PACK_EXPANSION containing the bases that will be
3137 initialized. The TREE_VALUE will be identical to the
3138 original TREE_VALUE, which is a list of arguments that will
3139 be passed to each base. We do not introduce any new pack
3140 expansion nodes into the TREE_VALUE (although it is possible
3141 that some already exist), because the TREE_PURPOSE and
3142 TREE_VALUE all need to be expanded together with the same
3143 _EXPANSION node. Note that the TYPE_PACK_EXPANSION in the
3144 resulting TREE_PURPOSE will mention the parameter packs in
3145 both the bases and the arguments to the bases. */
3148 tree parameter_packs
= NULL_TREE
;
3150 /* Determine which parameter packs will be used by the base
3152 ppd
.visited
= pointer_set_create ();
3153 ppd
.parameter_packs
= ¶meter_packs
;
3154 cp_walk_tree (&TREE_PURPOSE (arg
), &find_parameter_packs_r
,
3157 if (parameter_packs
== NULL_TREE
)
3159 error ("base initializer expansion %<%T%> contains no parameter packs", arg
);
3160 pointer_set_destroy (ppd
.visited
);
3161 return error_mark_node
;
3164 if (TREE_VALUE (arg
) != void_type_node
)
3166 /* Collect the sets of parameter packs used in each of the
3167 initialization arguments. */
3168 for (value
= TREE_VALUE (arg
); value
; value
= TREE_CHAIN (value
))
3170 /* Determine which parameter packs will be expanded in this
3172 cp_walk_tree (&TREE_VALUE (value
), &find_parameter_packs_r
,
3177 pointer_set_destroy (ppd
.visited
);
3179 /* Create the pack expansion type for the base type. */
3180 purpose
= cxx_make_type (TYPE_PACK_EXPANSION
);
3181 SET_PACK_EXPANSION_PATTERN (purpose
, TREE_PURPOSE (arg
));
3182 PACK_EXPANSION_PARAMETER_PACKS (purpose
) = parameter_packs
;
3184 /* Just use structural equality for these TYPE_PACK_EXPANSIONS;
3185 they will rarely be compared to anything. */
3186 SET_TYPE_STRUCTURAL_EQUALITY (purpose
);
3188 return tree_cons (purpose
, TREE_VALUE (arg
), NULL_TREE
);
3191 if (TYPE_P (arg
) || TREE_CODE (arg
) == TEMPLATE_DECL
)
3194 /* Build the PACK_EXPANSION_* node. */
3196 ? cxx_make_type (TYPE_PACK_EXPANSION
)
3197 : make_node (EXPR_PACK_EXPANSION
);
3198 SET_PACK_EXPANSION_PATTERN (result
, arg
);
3199 if (TREE_CODE (result
) == EXPR_PACK_EXPANSION
)
3201 /* Propagate type and const-expression information. */
3202 TREE_TYPE (result
) = TREE_TYPE (arg
);
3203 TREE_CONSTANT (result
) = TREE_CONSTANT (arg
);
3206 /* Just use structural equality for these TYPE_PACK_EXPANSIONS;
3207 they will rarely be compared to anything. */
3208 SET_TYPE_STRUCTURAL_EQUALITY (result
);
3210 /* Determine which parameter packs will be expanded. */
3211 ppd
.parameter_packs
= ¶meter_packs
;
3212 ppd
.visited
= pointer_set_create ();
3213 cp_walk_tree (&arg
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
3214 pointer_set_destroy (ppd
.visited
);
3216 /* Make sure we found some parameter packs. */
3217 if (parameter_packs
== NULL_TREE
)
3220 error ("expansion pattern %<%T%> contains no argument packs", arg
);
3222 error ("expansion pattern %<%E%> contains no argument packs", arg
);
3223 return error_mark_node
;
3225 PACK_EXPANSION_PARAMETER_PACKS (result
) = parameter_packs
;
3230 /* Checks T for any "bare" parameter packs, which have not yet been
3231 expanded, and issues an error if any are found. This operation can
3232 only be done on full expressions or types (e.g., an expression
3233 statement, "if" condition, etc.), because we could have expressions like:
3235 foo(f(g(h(args)))...)
3237 where "args" is a parameter pack. check_for_bare_parameter_packs
3238 should not be called for the subexpressions args, h(args),
3239 g(h(args)), or f(g(h(args))), because we would produce erroneous
3242 Returns TRUE and emits an error if there were bare parameter packs,
3243 returns FALSE otherwise. */
3245 check_for_bare_parameter_packs (tree t
)
3247 tree parameter_packs
= NULL_TREE
;
3248 struct find_parameter_pack_data ppd
;
3250 if (!processing_template_decl
|| !t
|| t
== error_mark_node
)
3253 if (TREE_CODE (t
) == TYPE_DECL
)
3256 ppd
.parameter_packs
= ¶meter_packs
;
3257 ppd
.visited
= pointer_set_create ();
3258 cp_walk_tree (&t
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
3259 pointer_set_destroy (ppd
.visited
);
3261 if (parameter_packs
)
3263 error ("parameter packs not expanded with %<...%>:");
3264 while (parameter_packs
)
3266 tree pack
= TREE_VALUE (parameter_packs
);
3267 tree name
= NULL_TREE
;
3269 if (TREE_CODE (pack
) == TEMPLATE_TYPE_PARM
3270 || TREE_CODE (pack
) == TEMPLATE_TEMPLATE_PARM
)
3271 name
= TYPE_NAME (pack
);
3272 else if (TREE_CODE (pack
) == TEMPLATE_PARM_INDEX
)
3273 name
= DECL_NAME (TEMPLATE_PARM_DECL (pack
));
3275 name
= DECL_NAME (pack
);
3278 inform (input_location
, " %qD", name
);
3280 inform (input_location
, " <anonymous>");
3282 parameter_packs
= TREE_CHAIN (parameter_packs
);
3291 /* Expand any parameter packs that occur in the template arguments in
3294 expand_template_argument_pack (tree args
)
3296 tree result_args
= NULL_TREE
;
3297 int in_arg
, out_arg
= 0, nargs
= args
? TREE_VEC_LENGTH (args
) : 0;
3298 int num_result_args
= -1;
3299 int non_default_args_count
= -1;
3301 /* First, determine if we need to expand anything, and the number of
3302 slots we'll need. */
3303 for (in_arg
= 0; in_arg
< nargs
; ++in_arg
)
3305 tree arg
= TREE_VEC_ELT (args
, in_arg
);
3306 if (arg
== NULL_TREE
)
3308 if (ARGUMENT_PACK_P (arg
))
3310 int num_packed
= TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg
));
3311 if (num_result_args
< 0)
3312 num_result_args
= in_arg
+ num_packed
;
3314 num_result_args
+= num_packed
;
3318 if (num_result_args
>= 0)
3323 /* If no expansion is necessary, we're done. */
3324 if (num_result_args
< 0)
3327 /* Expand arguments. */
3328 result_args
= make_tree_vec (num_result_args
);
3329 if (NON_DEFAULT_TEMPLATE_ARGS_COUNT (args
))
3330 non_default_args_count
=
3331 GET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (args
);
3332 for (in_arg
= 0; in_arg
< nargs
; ++in_arg
)
3334 tree arg
= TREE_VEC_ELT (args
, in_arg
);
3335 if (ARGUMENT_PACK_P (arg
))
3337 tree packed
= ARGUMENT_PACK_ARGS (arg
);
3338 int i
, num_packed
= TREE_VEC_LENGTH (packed
);
3339 for (i
= 0; i
< num_packed
; ++i
, ++out_arg
)
3340 TREE_VEC_ELT (result_args
, out_arg
) = TREE_VEC_ELT(packed
, i
);
3341 if (non_default_args_count
> 0)
3342 non_default_args_count
+= num_packed
;
3346 TREE_VEC_ELT (result_args
, out_arg
) = arg
;
3350 if (non_default_args_count
>= 0)
3351 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (result_args
, non_default_args_count
);
3355 /* Checks if DECL shadows a template parameter.
3357 [temp.local]: A template-parameter shall not be redeclared within its
3358 scope (including nested scopes).
3360 Emits an error and returns TRUE if the DECL shadows a parameter,
3361 returns FALSE otherwise. */
3364 check_template_shadow (tree decl
)
3368 /* If we're not in a template, we can't possibly shadow a template
3370 if (!current_template_parms
)
3373 /* Figure out what we're shadowing. */
3374 if (TREE_CODE (decl
) == OVERLOAD
)
3375 decl
= OVL_CURRENT (decl
);
3376 olddecl
= innermost_non_namespace_value (DECL_NAME (decl
));
3378 /* If there's no previous binding for this name, we're not shadowing
3379 anything, let alone a template parameter. */
3383 /* If we're not shadowing a template parameter, we're done. Note
3384 that OLDDECL might be an OVERLOAD (or perhaps even an
3385 ERROR_MARK), so we can't just blithely assume it to be a _DECL
3387 if (!DECL_P (olddecl
) || !DECL_TEMPLATE_PARM_P (olddecl
))
3390 /* We check for decl != olddecl to avoid bogus errors for using a
3391 name inside a class. We check TPFI to avoid duplicate errors for
3392 inline member templates. */
3394 || TEMPLATE_PARMS_FOR_INLINE (current_template_parms
))
3397 error ("declaration of %q+#D", decl
);
3398 error (" shadows template parm %q+#D", olddecl
);
3402 /* Return a new TEMPLATE_PARM_INDEX with the indicated INDEX, LEVEL,
3403 ORIG_LEVEL, DECL, and TYPE. NUM_SIBLINGS is the total number of
3404 template parameters. */
3407 build_template_parm_index (int index
,
3414 tree t
= make_node (TEMPLATE_PARM_INDEX
);
3415 TEMPLATE_PARM_IDX (t
) = index
;
3416 TEMPLATE_PARM_LEVEL (t
) = level
;
3417 TEMPLATE_PARM_ORIG_LEVEL (t
) = orig_level
;
3418 TEMPLATE_PARM_NUM_SIBLINGS (t
) = num_siblings
;
3419 TEMPLATE_PARM_DECL (t
) = decl
;
3420 TREE_TYPE (t
) = type
;
3421 TREE_CONSTANT (t
) = TREE_CONSTANT (decl
);
3422 TREE_READONLY (t
) = TREE_READONLY (decl
);
3427 /* Find the canonical type parameter for the given template type
3428 parameter. Returns the canonical type parameter, which may be TYPE
3429 if no such parameter existed. */
3432 canonical_type_parameter (tree type
)
3435 int idx
= TEMPLATE_TYPE_IDX (type
);
3436 if (!canonical_template_parms
)
3437 canonical_template_parms
= VEC_alloc (tree
, gc
, idx
+1);
3439 while (VEC_length (tree
, canonical_template_parms
) <= (unsigned)idx
)
3440 VEC_safe_push (tree
, gc
, canonical_template_parms
, NULL_TREE
);
3442 list
= VEC_index (tree
, canonical_template_parms
, idx
);
3443 while (list
&& !comptypes (type
, TREE_VALUE (list
), COMPARE_STRUCTURAL
))
3444 list
= TREE_CHAIN (list
);
3447 return TREE_VALUE (list
);
3450 VEC_replace(tree
, canonical_template_parms
, idx
,
3451 tree_cons (NULL_TREE
, type
,
3452 VEC_index (tree
, canonical_template_parms
, idx
)));
3457 /* Return a TEMPLATE_PARM_INDEX, similar to INDEX, but whose
3458 TEMPLATE_PARM_LEVEL has been decreased by LEVELS. If such a
3459 TEMPLATE_PARM_INDEX already exists, it is returned; otherwise, a
3460 new one is created. */
3463 reduce_template_parm_level (tree index
, tree type
, int levels
, tree args
,
3464 tsubst_flags_t complain
)
3466 if (TEMPLATE_PARM_DESCENDANTS (index
) == NULL_TREE
3467 || (TEMPLATE_PARM_LEVEL (TEMPLATE_PARM_DESCENDANTS (index
))
3468 != TEMPLATE_PARM_LEVEL (index
) - levels
)
3469 || !same_type_p (type
, TREE_TYPE (TEMPLATE_PARM_DESCENDANTS (index
))))
3471 tree orig_decl
= TEMPLATE_PARM_DECL (index
);
3474 decl
= build_decl (DECL_SOURCE_LOCATION (orig_decl
),
3475 TREE_CODE (orig_decl
), DECL_NAME (orig_decl
), type
);
3476 TREE_CONSTANT (decl
) = TREE_CONSTANT (orig_decl
);
3477 TREE_READONLY (decl
) = TREE_READONLY (orig_decl
);
3478 DECL_ARTIFICIAL (decl
) = 1;
3479 SET_DECL_TEMPLATE_PARM_P (decl
);
3481 t
= build_template_parm_index (TEMPLATE_PARM_IDX (index
),
3482 TEMPLATE_PARM_LEVEL (index
) - levels
,
3483 TEMPLATE_PARM_ORIG_LEVEL (index
),
3484 TEMPLATE_PARM_NUM_SIBLINGS (index
),
3486 TEMPLATE_PARM_DESCENDANTS (index
) = t
;
3487 TEMPLATE_PARM_PARAMETER_PACK (t
)
3488 = TEMPLATE_PARM_PARAMETER_PACK (index
);
3490 /* Template template parameters need this. */
3491 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
3492 DECL_TEMPLATE_PARMS (decl
) = tsubst_template_parms
3493 (DECL_TEMPLATE_PARMS (TEMPLATE_PARM_DECL (index
)),
3497 return TEMPLATE_PARM_DESCENDANTS (index
);
3500 /* Process information from new template parameter PARM and append it
3501 to the LIST being built. This new parameter is a non-type
3502 parameter iff IS_NON_TYPE is true. This new parameter is a
3503 parameter pack iff IS_PARAMETER_PACK is true. The location of PARM
3504 is in PARM_LOC. NUM_TEMPLATE_PARMS is the size of the template
3505 parameter list PARM belongs to. This is used used to create a
3506 proper canonical type for the type of PARM that is to be created,
3507 iff PARM is a type. If the size is not known, this parameter shall
3511 process_template_parm (tree list
, location_t parm_loc
, tree parm
,
3512 bool is_non_type
, bool is_parameter_pack
,
3513 unsigned num_template_parms
)
3520 gcc_assert (TREE_CODE (parm
) == TREE_LIST
);
3521 defval
= TREE_PURPOSE (parm
);
3525 tree p
= tree_last (list
);
3527 if (p
&& TREE_VALUE (p
) != error_mark_node
)
3530 if (TREE_CODE (p
) == TYPE_DECL
|| TREE_CODE (p
) == TEMPLATE_DECL
)
3531 idx
= TEMPLATE_TYPE_IDX (TREE_TYPE (p
));
3533 idx
= TEMPLATE_PARM_IDX (DECL_INITIAL (p
));
3543 parm
= TREE_VALUE (parm
);
3545 SET_DECL_TEMPLATE_PARM_P (parm
);
3547 if (TREE_TYPE (parm
) == error_mark_node
)
3549 err_parm_list
= build_tree_list (defval
, parm
);
3550 TREE_VALUE (err_parm_list
) = error_mark_node
;
3551 return chainon (list
, err_parm_list
);
3557 The top-level cv-qualifiers on the template-parameter are
3558 ignored when determining its type. */
3559 TREE_TYPE (parm
) = TYPE_MAIN_VARIANT (TREE_TYPE (parm
));
3560 if (invalid_nontype_parm_type_p (TREE_TYPE (parm
), 1))
3562 err_parm_list
= build_tree_list (defval
, parm
);
3563 TREE_VALUE (err_parm_list
) = error_mark_node
;
3564 return chainon (list
, err_parm_list
);
3567 if (uses_parameter_packs (TREE_TYPE (parm
)) && !is_parameter_pack
)
3569 /* This template parameter is not a parameter pack, but it
3570 should be. Complain about "bare" parameter packs. */
3571 check_for_bare_parameter_packs (TREE_TYPE (parm
));
3573 /* Recover by calling this a parameter pack. */
3574 is_parameter_pack
= true;
3578 /* A template parameter is not modifiable. */
3579 TREE_CONSTANT (parm
) = 1;
3580 TREE_READONLY (parm
) = 1;
3581 decl
= build_decl (parm_loc
,
3582 CONST_DECL
, DECL_NAME (parm
), TREE_TYPE (parm
));
3583 TREE_CONSTANT (decl
) = 1;
3584 TREE_READONLY (decl
) = 1;
3585 DECL_INITIAL (parm
) = DECL_INITIAL (decl
)
3586 = build_template_parm_index (idx
, processing_template_decl
,
3587 processing_template_decl
,
3589 decl
, TREE_TYPE (parm
));
3591 TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
))
3592 = is_parameter_pack
;
3597 parm
= TREE_VALUE (TREE_VALUE (parm
));
3599 if (parm
&& TREE_CODE (parm
) == TEMPLATE_DECL
)
3601 t
= cxx_make_type (TEMPLATE_TEMPLATE_PARM
);
3602 /* This is for distinguishing between real templates and template
3603 template parameters */
3604 TREE_TYPE (parm
) = t
;
3605 TREE_TYPE (DECL_TEMPLATE_RESULT (parm
)) = t
;
3610 t
= cxx_make_type (TEMPLATE_TYPE_PARM
);
3611 /* parm is either IDENTIFIER_NODE or NULL_TREE. */
3612 decl
= build_decl (parm_loc
,
3613 TYPE_DECL
, parm
, t
);
3616 TYPE_NAME (t
) = decl
;
3617 TYPE_STUB_DECL (t
) = decl
;
3619 TEMPLATE_TYPE_PARM_INDEX (t
)
3620 = build_template_parm_index (idx
, processing_template_decl
,
3621 processing_template_decl
,
3623 decl
, TREE_TYPE (parm
));
3624 TEMPLATE_TYPE_PARAMETER_PACK (t
) = is_parameter_pack
;
3625 TYPE_CANONICAL (t
) = canonical_type_parameter (t
);
3627 DECL_ARTIFICIAL (decl
) = 1;
3628 SET_DECL_TEMPLATE_PARM_P (decl
);
3630 parm
= build_tree_list (defval
, parm
);
3631 return chainon (list
, parm
);
3634 /* The end of a template parameter list has been reached. Process the
3635 tree list into a parameter vector, converting each parameter into a more
3636 useful form. Type parameters are saved as IDENTIFIER_NODEs, and others
3640 end_template_parm_list (tree parms
)
3644 tree saved_parmlist
= make_tree_vec (list_length (parms
));
3646 current_template_parms
3647 = tree_cons (size_int (processing_template_decl
),
3648 saved_parmlist
, current_template_parms
);
3650 for (parm
= parms
, nparms
= 0; parm
; parm
= next
, nparms
++)
3652 next
= TREE_CHAIN (parm
);
3653 TREE_VEC_ELT (saved_parmlist
, nparms
) = parm
;
3654 TREE_CHAIN (parm
) = NULL_TREE
;
3657 --processing_template_parmlist
;
3659 return saved_parmlist
;
3662 /* Create a new type almost identical to TYPE but which has the
3663 following differences:
3665 1/ T has a new TEMPLATE_PARM_INDEX that carries the new number of
3666 template sibling parameters of T.
3668 2/ T has a new canonical type that matches the new number
3671 3/ From now on, T is going to be what lookups referring to the
3672 name of TYPE will return. No lookup should return TYPE anymore.
3674 NUM_PARMS is the new number of sibling parms TYPE belongs to.
3676 This is a subroutine of fixup_template_parms. */
3679 fixup_template_type_parm_type (tree type
, int num_parms
)
3681 tree orig_idx
= TEMPLATE_TYPE_PARM_INDEX (type
), idx
;
3683 /* This is the decl which name is inserted into the symbol table for
3684 the template parm type. So whenever we lookup the type name, this
3685 is the DECL we get. */
3688 /* Do not fix up the type twice. */
3689 if (orig_idx
&& TEMPLATE_PARM_NUM_SIBLINGS (orig_idx
) != 0)
3692 t
= copy_type (type
);
3693 decl
= TYPE_NAME (t
);
3695 TYPE_MAIN_VARIANT (t
) = t
;
3696 TYPE_NEXT_VARIANT (t
)= NULL_TREE
;
3697 TYPE_POINTER_TO (t
) = 0;
3698 TYPE_REFERENCE_TO (t
) = 0;
3700 idx
= build_template_parm_index (TEMPLATE_PARM_IDX (orig_idx
),
3701 TEMPLATE_PARM_LEVEL (orig_idx
),
3702 TEMPLATE_PARM_ORIG_LEVEL (orig_idx
),
3705 TEMPLATE_PARM_DESCENDANTS (idx
) = TEMPLATE_PARM_DESCENDANTS (orig_idx
);
3706 TEMPLATE_PARM_PARAMETER_PACK (idx
) = TEMPLATE_PARM_PARAMETER_PACK (orig_idx
);
3707 TEMPLATE_TYPE_PARM_INDEX (t
) = idx
;
3709 TYPE_STUB_DECL (t
) = decl
;
3710 TEMPLATE_TYPE_DECL (t
) = decl
;
3711 if (TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
)
3712 TREE_TYPE (DECL_TEMPLATE_RESULT (decl
)) = t
;
3714 /* Update the type associated to the type name stored in the symbol
3715 table. Now, whenever the type name is looked up, the resulting
3716 type is properly fixed up. */
3717 TREE_TYPE (decl
) = t
;
3719 TYPE_CANONICAL (t
) = canonical_type_parameter (t
);
3724 /* Create and return a new TEMPLATE_PARM_INDEX that is almost
3725 identical to I, but that is fixed up as to:
3727 1/ carry the number of sibling parms (NUM_PARMS) of the template
3728 parm represented by I.
3730 2/ replace all references to template parm types declared before I
3731 (in the same template parm list as I) by references to template
3732 parm types contained in ARGS. ARGS should contain the list of
3733 template parms that have been fixed up so far, in a form suitable
3734 to be passed to tsubst.
3736 This is a subroutine of fixup_template_parms. */
3739 fixup_template_parm_index (tree i
, tree args
, int num_parms
)
3741 tree index
, decl
, type
;
3744 || TREE_CODE (i
) != TEMPLATE_PARM_INDEX
3745 /* Do not fix up the index twice. */
3746 || (TEMPLATE_PARM_NUM_SIBLINGS (i
) != 0))
3749 decl
= TEMPLATE_PARM_DECL (i
);
3750 type
= TREE_TYPE (decl
);
3752 index
= build_template_parm_index (TEMPLATE_PARM_IDX (i
),
3753 TEMPLATE_PARM_LEVEL (i
),
3754 TEMPLATE_PARM_ORIG_LEVEL (i
),
3758 TEMPLATE_PARM_DESCENDANTS (index
) = TEMPLATE_PARM_DESCENDANTS (i
);
3759 TEMPLATE_PARM_PARAMETER_PACK (index
) = TEMPLATE_PARM_PARAMETER_PACK (i
);
3761 type
= tsubst (type
, args
, tf_none
, NULL_TREE
);
3763 TREE_TYPE (decl
) = type
;
3764 TREE_TYPE (index
) = type
;
3770 This is a subroutine of fixup_template_parms.
3772 It computes the canonical type of the type of the template
3773 parameter PARM_DESC and update all references to that type so that
3774 they use the newly computed canonical type. No access check is
3775 performed during the fixup. PARM_DESC is a TREE_LIST which
3776 TREE_VALUE is the template parameter and its TREE_PURPOSE is the
3777 default argument of the template parm if any. IDX is the index of
3778 the template parameter, starting at 0. NUM_PARMS is the number of
3779 template parameters in the set PARM_DESC belongs to. ARGLIST is a
3780 TREE_VEC containing the full set of template parameters in a form
3781 suitable to be passed to substs functions as their ARGS
3782 argument. This is what current_template_args returns for a given
3783 template. The innermost vector of args in ARGLIST is the set of
3784 template parms that have been fixed up so far. This function adds
3785 the fixed up parameter into that vector. */
3788 fixup_template_parm (tree parm_desc
,
3793 tree parm
= TREE_VALUE (parm_desc
);
3794 tree fixedup_args
= INNERMOST_TEMPLATE_ARGS (arglist
);
3796 push_deferring_access_checks (dk_no_check
);
3798 if (TREE_CODE (parm
) == TYPE_DECL
)
3800 /* PARM is a template type parameter. Fix up its type, add
3801 the fixed-up template parm to the vector of fixed-up
3802 template parms so far, and substitute the fixed-up
3803 template parms into the default argument of this
3806 fixup_template_type_parm_type (TREE_TYPE (parm
), num_parms
);
3807 TREE_TYPE (parm
) = t
;
3809 TREE_VEC_ELT (fixedup_args
, idx
) = template_parm_to_arg (parm_desc
);
3811 else if (TREE_CODE (parm
) == TEMPLATE_DECL
)
3813 /* PARM is a template template parameter. This is going to
3815 tree tparms
, targs
, innermost_args
, t
;
3818 /* First, fix up the parms of the template template parm
3819 because the parms are involved in defining the new canonical
3820 type of the template template parm. */
3822 /* So we need to substitute the template parm types that have
3823 been fixed up so far into the template parms of this template
3824 template parm. E.g, consider this:
3826 template<class T, template<T u> class TT> class S;
3828 In this case we want to substitute T into the
3829 template parameters of TT.
3831 So let's walk the template parms of PARM here, and
3832 tsubst ARGLIST into into each of the template
3835 /* For this substitution we need to build the full set of
3836 template parameters and use that as arguments for the
3837 tsubsting function. */
3838 tparms
= INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (parm
));
3840 /* This will contain the innermost parms of PARM into which
3841 we have substituted so far. */
3842 innermost_args
= make_tree_vec (TREE_VEC_LENGTH (tparms
));
3843 targs
= add_to_template_args (arglist
, innermost_args
);
3844 for (j
= 0; j
< TREE_VEC_LENGTH (tparms
); ++j
)
3848 parameter
= TREE_VEC_ELT (tparms
, j
);
3850 /* INNERMOST_ARGS needs to have at least the same number
3851 of elements as the index PARAMETER, ortherwise
3852 tsubsting into PARAMETER will result in partially
3853 instantiating it, reducing its tempate parm
3854 level. Let's tactically fill INNERMOST_ARGS for that
3856 TREE_VEC_ELT (innermost_args
, j
) =
3857 template_parm_to_arg (parameter
);
3859 fixup_template_parm (parameter
, j
,
3860 TREE_VEC_LENGTH (tparms
),
3864 /* Now fix up the type of the template template parm. */
3866 t
= fixup_template_type_parm_type (TREE_TYPE (parm
), num_parms
);
3867 TREE_TYPE (parm
) = t
;
3869 TREE_VEC_ELT (fixedup_args
, idx
) =
3870 template_parm_to_arg (parm_desc
);
3872 else if (TREE_CODE (parm
) == PARM_DECL
)
3874 /* PARM is a non-type template parameter. We need to:
3876 * Fix up its TEMPLATE_PARM_INDEX to make it carry the
3877 proper number of sibling parameters.
3879 * Make lookups of the template parameter return a reference
3880 to the fixed-up index. No lookup should return references
3881 to the former index anymore.
3883 * Substitute the template parms that got fixed up so far
3885 * into the type of PARM. */
3887 tree index
= DECL_INITIAL (parm
);
3889 /* PUSHED_DECL is the decl added to the symbol table with
3890 the name of the parameter. E,g:
3892 template<class T, T u> //#0
3893 auto my_function(T t) -> decltype(u); //#1
3895 Here, when looking up u at //#1, we get the decl of u
3896 resulting from the declaration in #0. This is what
3897 PUSHED_DECL is. We need to replace the reference to the
3898 old TEMPLATE_PARM_INDEX carried by PUSHED_DECL by the
3899 fixed-up TEMPLATE_PARM_INDEX. */
3900 tree pushed_decl
= TEMPLATE_PARM_DECL (index
);
3902 /* Let's fix up the TEMPLATE_PARM_INDEX then. Note that we must
3903 fixup the type of PUSHED_DECL as well and luckily
3904 fixup_template_parm_index does it for us too. */
3905 tree fixed_up_index
=
3906 fixup_template_parm_index (index
, arglist
, num_parms
);
3908 DECL_INITIAL (pushed_decl
) = DECL_INITIAL (parm
) = fixed_up_index
;
3910 /* Add this fixed up PARM to the template parms we've fixed
3911 up so far and use that to substitute the fixed-up
3912 template parms into the type of PARM. */
3913 TREE_VEC_ELT (fixedup_args
, idx
) =
3914 template_parm_to_arg (parm_desc
);
3915 TREE_TYPE (parm
) = tsubst (TREE_TYPE (parm
), arglist
,
3916 tf_none
, NULL_TREE
);
3919 TREE_PURPOSE (parm_desc
) =
3920 tsubst_template_arg (TREE_PURPOSE (parm_desc
),
3921 arglist
, tf_none
, parm
);
3923 pop_deferring_access_checks ();
3926 /* Walk the current template parms and properly compute the canonical
3927 types of the dependent types created during
3928 cp_parser_template_parameter_list. */
3931 fixup_template_parms (void)
3938 parameter_vec
= INNERMOST_TEMPLATE_PARMS (current_template_parms
);
3939 if (parameter_vec
== NULL_TREE
)
3942 num_parms
= TREE_VEC_LENGTH (parameter_vec
);
3944 /* This vector contains the current innermost template parms that
3945 have been fixed up so far. The form of FIXEDUP_ARGS is suitable
3946 to be passed to tsubst* functions as their ARGS argument. */
3947 fixedup_args
= make_tree_vec (num_parms
);
3949 /* This vector contains the full set of template parms in a form
3950 suitable to be passed to substs functions as their ARGS
3952 arglist
= current_template_args ();
3953 arglist
= add_outermost_template_args (arglist
, fixedup_args
);
3955 /* Let's do the proper fixup now. */
3956 for (i
= 0; i
< num_parms
; ++i
)
3957 fixup_template_parm (TREE_VEC_ELT (parameter_vec
, i
),
3958 i
, num_parms
, arglist
);
3961 /* end_template_decl is called after a template declaration is seen. */
3964 end_template_decl (void)
3966 reset_specialization ();
3968 if (! processing_template_decl
)
3971 /* This matches the pushlevel in begin_template_parm_list. */
3974 --processing_template_decl
;
3975 current_template_parms
= TREE_CHAIN (current_template_parms
);
3978 /* Takes a TREE_LIST representing a template parameter and convert it
3979 into an argument suitable to be passed to the type substitution
3980 functions. Note that If the TREE_LIST contains an error_mark
3981 node, the returned argument is error_mark_node. */
3984 template_parm_to_arg (tree t
)
3988 || TREE_CODE (t
) != TREE_LIST
)
3991 if (error_operand_p (TREE_VALUE (t
)))
3992 return error_mark_node
;
3996 if (TREE_CODE (t
) == TYPE_DECL
3997 || TREE_CODE (t
) == TEMPLATE_DECL
)
4001 if (TEMPLATE_TYPE_PARAMETER_PACK (t
))
4003 /* Turn this argument into a TYPE_ARGUMENT_PACK
4004 with a single element, which expands T. */
4005 tree vec
= make_tree_vec (1);
4006 #ifdef ENABLE_CHECKING
4007 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT
4008 (vec
, TREE_VEC_LENGTH (vec
));
4010 TREE_VEC_ELT (vec
, 0) = make_pack_expansion (t
);
4012 t
= cxx_make_type (TYPE_ARGUMENT_PACK
);
4013 SET_ARGUMENT_PACK_ARGS (t
, vec
);
4018 t
= DECL_INITIAL (t
);
4020 if (TEMPLATE_PARM_PARAMETER_PACK (t
))
4022 /* Turn this argument into a NONTYPE_ARGUMENT_PACK
4023 with a single element, which expands T. */
4024 tree vec
= make_tree_vec (1);
4025 tree type
= TREE_TYPE (TEMPLATE_PARM_DECL (t
));
4026 #ifdef ENABLE_CHECKING
4027 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT
4028 (vec
, TREE_VEC_LENGTH (vec
));
4030 TREE_VEC_ELT (vec
, 0) = make_pack_expansion (t
);
4032 t
= make_node (NONTYPE_ARGUMENT_PACK
);
4033 SET_ARGUMENT_PACK_ARGS (t
, vec
);
4034 TREE_TYPE (t
) = type
;
4040 /* This function returns TRUE if PARM_PACK is a template parameter
4041 pack and if ARG_PACK is what template_parm_to_arg returned when
4042 passed PARM_PACK. */
4045 arg_from_parm_pack_p (tree arg_pack
, tree parm_pack
)
4047 /* For clarity in the comments below let's use the representation
4048 argument_pack<elements>' to denote an argument pack and its
4051 In the 'if' block below, we want to detect cases where
4052 ARG_PACK is argument_pack<PARM_PACK...>. I.e, we want to
4053 check if ARG_PACK is an argument pack which sole element is
4054 the expansion of PARM_PACK. That argument pack is typically
4055 created by template_parm_to_arg when passed a parameter
4059 && TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg_pack
)) == 1
4060 && PACK_EXPANSION_P (TREE_VEC_ELT (ARGUMENT_PACK_ARGS (arg_pack
), 0)))
4062 tree expansion
= TREE_VEC_ELT (ARGUMENT_PACK_ARGS (arg_pack
), 0);
4063 tree pattern
= PACK_EXPANSION_PATTERN (expansion
);
4064 /* So we have an argument_pack<P...>. We want to test if P
4065 is actually PARM_PACK. We will not use cp_tree_equal to
4066 test P and PARM_PACK because during type fixup (by
4067 fixup_template_parm) P can be a pre-fixup version of a
4068 type and PARM_PACK be its post-fixup version.
4069 cp_tree_equal would consider them as different even
4070 though we would want to consider them compatible for our
4071 precise purpose here.
4073 Thus we are going to consider that P and PARM_PACK are
4074 compatible if they have the same DECL. */
4075 if ((/* If ARG_PACK is a type parameter pack named by the
4076 same DECL as parm_pack ... */
4078 && TYPE_P (parm_pack
)
4079 && TYPE_NAME (pattern
) == TYPE_NAME (parm_pack
))
4080 /* ... or if PARM_PACK is a non-type parameter named by the
4081 same DECL as ARG_PACK. Note that PARM_PACK being a
4082 non-type parameter means it's either a PARM_DECL or a
4083 TEMPLATE_PARM_INDEX. */
4084 || (TREE_CODE (pattern
) == TEMPLATE_PARM_INDEX
4085 && ((TREE_CODE (parm_pack
) == PARM_DECL
4086 && (TEMPLATE_PARM_DECL (pattern
)
4087 == TEMPLATE_PARM_DECL (DECL_INITIAL (parm_pack
))))
4088 || (TREE_CODE (parm_pack
) == TEMPLATE_PARM_INDEX
4089 && (TEMPLATE_PARM_DECL (pattern
)
4090 == TEMPLATE_PARM_DECL (parm_pack
))))))
4091 && template_parameter_pack_p (pattern
))
4097 /* Within the declaration of a template, return all levels of template
4098 parameters that apply. The template parameters are represented as
4099 a TREE_VEC, in the form documented in cp-tree.h for template
4103 current_template_args (void)
4106 tree args
= NULL_TREE
;
4107 int length
= TMPL_PARMS_DEPTH (current_template_parms
);
4110 /* If there is only one level of template parameters, we do not
4111 create a TREE_VEC of TREE_VECs. Instead, we return a single
4112 TREE_VEC containing the arguments. */
4114 args
= make_tree_vec (length
);
4116 for (header
= current_template_parms
; header
; header
= TREE_CHAIN (header
))
4118 tree a
= copy_node (TREE_VALUE (header
));
4121 TREE_TYPE (a
) = NULL_TREE
;
4122 for (i
= TREE_VEC_LENGTH (a
) - 1; i
>= 0; --i
)
4123 TREE_VEC_ELT (a
, i
) = template_parm_to_arg (TREE_VEC_ELT (a
, i
));
4125 #ifdef ENABLE_CHECKING
4126 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (a
, TREE_VEC_LENGTH (a
));
4130 TREE_VEC_ELT (args
, --l
) = a
;
4135 if (length
> 1 && TREE_VEC_ELT (args
, 0) == NULL_TREE
)
4136 /* This can happen for template parms of a template template
4139 template<template<class T, class U> class TT> struct S;
4141 Consider the level of the parms of TT; T and U both have
4142 level 2; TT has no template parm of level 1. So in this case
4143 the first element of full_template_args is NULL_TREE. If we
4144 leave it like this TMPL_ARG_DEPTH on args returns 1 instead
4145 of 2. This will make tsubst wrongly consider that T and U
4146 have level 1. Instead, let's create a dummy vector as the
4147 first element of full_template_args so that TMPL_ARG_DEPTH
4148 returns the correct depth for args. */
4149 TREE_VEC_ELT (args
, 0) = make_tree_vec (1);
4153 /* Update the declared TYPE by doing any lookups which were thought to be
4154 dependent, but are not now that we know the SCOPE of the declarator. */
4157 maybe_update_decl_type (tree orig_type
, tree scope
)
4159 tree type
= orig_type
;
4161 if (type
== NULL_TREE
)
4164 if (TREE_CODE (orig_type
) == TYPE_DECL
)
4165 type
= TREE_TYPE (type
);
4167 if (scope
&& TYPE_P (scope
) && dependent_type_p (scope
)
4168 && dependent_type_p (type
)
4169 /* Don't bother building up the args in this case. */
4170 && TREE_CODE (type
) != TEMPLATE_TYPE_PARM
)
4172 /* tsubst in the args corresponding to the template parameters,
4173 including auto if present. Most things will be unchanged, but
4174 make_typename_type and tsubst_qualified_id will resolve
4175 TYPENAME_TYPEs and SCOPE_REFs that were previously dependent. */
4176 tree args
= current_template_args ();
4177 tree auto_node
= type_uses_auto (type
);
4181 tree auto_vec
= make_tree_vec (1);
4182 TREE_VEC_ELT (auto_vec
, 0) = auto_node
;
4183 args
= add_to_template_args (args
, auto_vec
);
4185 pushed
= push_scope (scope
);
4186 type
= tsubst (type
, args
, tf_warning_or_error
, NULL_TREE
);
4191 if (type
== error_mark_node
)
4194 if (TREE_CODE (orig_type
) == TYPE_DECL
)
4196 if (same_type_p (type
, TREE_TYPE (orig_type
)))
4199 type
= TYPE_NAME (type
);
4204 /* Return a TEMPLATE_DECL corresponding to DECL, using the indicated
4205 template PARMS. If MEMBER_TEMPLATE_P is true, the new template is
4206 a member template. Used by push_template_decl below. */
4209 build_template_decl (tree decl
, tree parms
, bool member_template_p
)
4211 tree tmpl
= build_lang_decl (TEMPLATE_DECL
, DECL_NAME (decl
), NULL_TREE
);
4212 DECL_TEMPLATE_PARMS (tmpl
) = parms
;
4213 DECL_CONTEXT (tmpl
) = DECL_CONTEXT (decl
);
4214 DECL_SOURCE_LOCATION (tmpl
) = DECL_SOURCE_LOCATION (decl
);
4215 DECL_MEMBER_TEMPLATE_P (tmpl
) = member_template_p
;
4220 struct template_parm_data
4222 /* The level of the template parameters we are currently
4226 /* The index of the specialization argument we are currently
4230 /* An array whose size is the number of template parameters. The
4231 elements are nonzero if the parameter has been used in any one
4232 of the arguments processed so far. */
4235 /* An array whose size is the number of template arguments. The
4236 elements are nonzero if the argument makes use of template
4237 parameters of this level. */
4238 int* arg_uses_template_parms
;
4241 /* Subroutine of push_template_decl used to see if each template
4242 parameter in a partial specialization is used in the explicit
4243 argument list. If T is of the LEVEL given in DATA (which is
4244 treated as a template_parm_data*), then DATA->PARMS is marked
4248 mark_template_parm (tree t
, void* data
)
4252 struct template_parm_data
* tpd
= (struct template_parm_data
*) data
;
4254 if (TREE_CODE (t
) == TEMPLATE_PARM_INDEX
)
4256 level
= TEMPLATE_PARM_LEVEL (t
);
4257 idx
= TEMPLATE_PARM_IDX (t
);
4261 level
= TEMPLATE_TYPE_LEVEL (t
);
4262 idx
= TEMPLATE_TYPE_IDX (t
);
4265 if (level
== tpd
->level
)
4267 tpd
->parms
[idx
] = 1;
4268 tpd
->arg_uses_template_parms
[tpd
->current_arg
] = 1;
4271 /* Return zero so that for_each_template_parm will continue the
4272 traversal of the tree; we want to mark *every* template parm. */
4276 /* Process the partial specialization DECL. */
4279 process_partial_specialization (tree decl
)
4281 tree type
= TREE_TYPE (decl
);
4282 tree maintmpl
= CLASSTYPE_TI_TEMPLATE (type
);
4283 tree specargs
= CLASSTYPE_TI_ARGS (type
);
4284 tree inner_args
= INNERMOST_TEMPLATE_ARGS (specargs
);
4285 tree main_inner_parms
= DECL_INNERMOST_TEMPLATE_PARMS (maintmpl
);
4288 int nargs
= TREE_VEC_LENGTH (inner_args
);
4291 bool did_error_intro
= false;
4292 struct template_parm_data tpd
;
4293 struct template_parm_data tpd2
;
4295 gcc_assert (current_template_parms
);
4297 inner_parms
= INNERMOST_TEMPLATE_PARMS (current_template_parms
);
4298 ntparms
= TREE_VEC_LENGTH (inner_parms
);
4300 /* We check that each of the template parameters given in the
4301 partial specialization is used in the argument list to the
4302 specialization. For example:
4304 template <class T> struct S;
4305 template <class T> struct S<T*>;
4307 The second declaration is OK because `T*' uses the template
4308 parameter T, whereas
4310 template <class T> struct S<int>;
4312 is no good. Even trickier is:
4323 The S2<T> declaration is actually invalid; it is a
4324 full-specialization. Of course,
4327 struct S2<T (*)(U)>;
4329 or some such would have been OK. */
4330 tpd
.level
= TMPL_PARMS_DEPTH (current_template_parms
);
4331 tpd
.parms
= XALLOCAVEC (int, ntparms
);
4332 memset (tpd
.parms
, 0, sizeof (int) * ntparms
);
4334 tpd
.arg_uses_template_parms
= XALLOCAVEC (int, nargs
);
4335 memset (tpd
.arg_uses_template_parms
, 0, sizeof (int) * nargs
);
4336 for (i
= 0; i
< nargs
; ++i
)
4338 tpd
.current_arg
= i
;
4339 for_each_template_parm (TREE_VEC_ELT (inner_args
, i
),
4340 &mark_template_parm
,
4343 /*include_nondeduced_p=*/false);
4345 for (i
= 0; i
< ntparms
; ++i
)
4346 if (tpd
.parms
[i
] == 0)
4348 /* One of the template parms was not used in the
4350 if (!did_error_intro
)
4352 error ("template parameters not used in partial specialization:");
4353 did_error_intro
= true;
4356 error (" %qD", TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
)));
4359 if (did_error_intro
)
4360 return error_mark_node
;
4362 /* [temp.class.spec]
4364 The argument list of the specialization shall not be identical to
4365 the implicit argument list of the primary template. */
4366 if (comp_template_args
4368 INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE
4370 error ("partial specialization %qT does not specialize any template arguments", type
);
4372 /* [temp.class.spec]
4374 A partially specialized non-type argument expression shall not
4375 involve template parameters of the partial specialization except
4376 when the argument expression is a simple identifier.
4378 The type of a template parameter corresponding to a specialized
4379 non-type argument shall not be dependent on a parameter of the
4382 Also, we verify that pack expansions only occur at the
4383 end of the argument list. */
4384 gcc_assert (nargs
== DECL_NTPARMS (maintmpl
));
4386 for (i
= 0; i
< nargs
; ++i
)
4388 tree parm
= TREE_VALUE (TREE_VEC_ELT (main_inner_parms
, i
));
4389 tree arg
= TREE_VEC_ELT (inner_args
, i
);
4390 tree packed_args
= NULL_TREE
;
4393 if (ARGUMENT_PACK_P (arg
))
4395 /* Extract the arguments from the argument pack. We'll be
4396 iterating over these in the following loop. */
4397 packed_args
= ARGUMENT_PACK_ARGS (arg
);
4398 len
= TREE_VEC_LENGTH (packed_args
);
4401 for (j
= 0; j
< len
; j
++)
4404 /* Get the Jth argument in the parameter pack. */
4405 arg
= TREE_VEC_ELT (packed_args
, j
);
4407 if (PACK_EXPANSION_P (arg
))
4409 /* Pack expansions must come at the end of the
4411 if ((packed_args
&& j
< len
- 1)
4412 || (!packed_args
&& i
< nargs
- 1))
4414 if (TREE_CODE (arg
) == EXPR_PACK_EXPANSION
)
4415 error ("parameter pack argument %qE must be at the "
4416 "end of the template argument list", arg
);
4418 error ("parameter pack argument %qT must be at the "
4419 "end of the template argument list", arg
);
4423 if (TREE_CODE (arg
) == EXPR_PACK_EXPANSION
)
4424 /* We only care about the pattern. */
4425 arg
= PACK_EXPANSION_PATTERN (arg
);
4427 if (/* These first two lines are the `non-type' bit. */
4429 && TREE_CODE (arg
) != TEMPLATE_DECL
4430 /* This next line is the `argument expression is not just a
4431 simple identifier' condition and also the `specialized
4432 non-type argument' bit. */
4433 && TREE_CODE (arg
) != TEMPLATE_PARM_INDEX
)
4435 if ((!packed_args
&& tpd
.arg_uses_template_parms
[i
])
4436 || (packed_args
&& uses_template_parms (arg
)))
4437 error ("template argument %qE involves template parameter(s)",
4441 /* Look at the corresponding template parameter,
4442 marking which template parameters its type depends
4444 tree type
= TREE_TYPE (parm
);
4448 /* We haven't yet initialized TPD2. Do so now. */
4449 tpd2
.arg_uses_template_parms
= XALLOCAVEC (int, nargs
);
4450 /* The number of parameters here is the number in the
4451 main template, which, as checked in the assertion
4453 tpd2
.parms
= XALLOCAVEC (int, nargs
);
4455 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (maintmpl
));
4458 /* Mark the template parameters. But this time, we're
4459 looking for the template parameters of the main
4460 template, not in the specialization. */
4461 tpd2
.current_arg
= i
;
4462 tpd2
.arg_uses_template_parms
[i
] = 0;
4463 memset (tpd2
.parms
, 0, sizeof (int) * nargs
);
4464 for_each_template_parm (type
,
4465 &mark_template_parm
,
4468 /*include_nondeduced_p=*/false);
4470 if (tpd2
.arg_uses_template_parms
[i
])
4472 /* The type depended on some template parameters.
4473 If they are fully specialized in the
4474 specialization, that's OK. */
4477 for (j
= 0; j
< nargs
; ++j
)
4478 if (tpd2
.parms
[j
] != 0
4479 && tpd
.arg_uses_template_parms
[j
])
4482 error_n (input_location
, count
,
4483 "type %qT of template argument %qE depends "
4484 "on a template parameter",
4485 "type %qT of template argument %qE depends "
4486 "on template parameters",
4495 /* We should only get here once. */
4496 gcc_assert (!COMPLETE_TYPE_P (type
));
4498 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)
4499 = tree_cons (specargs
, inner_parms
,
4500 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
));
4501 TREE_TYPE (DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)) = type
;
4503 for (inst
= DECL_TEMPLATE_INSTANTIATIONS (maintmpl
); inst
;
4504 inst
= TREE_CHAIN (inst
))
4506 tree inst_type
= TREE_VALUE (inst
);
4507 if (COMPLETE_TYPE_P (inst_type
)
4508 && CLASSTYPE_IMPLICIT_INSTANTIATION (inst_type
))
4510 tree spec
= most_specialized_class (inst_type
, maintmpl
, tf_none
);
4511 if (spec
&& TREE_TYPE (spec
) == type
)
4512 permerror (input_location
,
4513 "partial specialization of %qT after instantiation "
4514 "of %qT", type
, inst_type
);
4521 /* Check that a template declaration's use of default arguments and
4522 parameter packs is not invalid. Here, PARMS are the template
4523 parameters. IS_PRIMARY is nonzero if DECL is the thing declared by
4524 a primary template. IS_PARTIAL is nonzero if DECL is a partial
4528 IS_FRIEND_DECL is nonzero if DECL is a friend function template
4529 declaration (but not a definition); 1 indicates a declaration, 2
4530 indicates a redeclaration. When IS_FRIEND_DECL=2, no errors are
4531 emitted for extraneous default arguments.
4533 Returns TRUE if there were no errors found, FALSE otherwise. */
4536 check_default_tmpl_args (tree decl
, tree parms
, int is_primary
,
4537 int is_partial
, int is_friend_decl
)
4540 int last_level_to_check
;
4542 bool no_errors
= true;
4546 A default template-argument shall not be specified in a
4547 function template declaration or a function template definition, nor
4548 in the template-parameter-list of the definition of a member of a
4551 if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == FUNCTION_DECL
)
4552 /* You can't have a function template declaration in a local
4553 scope, nor you can you define a member of a class template in a
4557 if (current_class_type
4558 && !TYPE_BEING_DEFINED (current_class_type
)
4559 && DECL_LANG_SPECIFIC (decl
)
4560 && DECL_DECLARES_FUNCTION_P (decl
)
4561 /* If this is either a friend defined in the scope of the class
4562 or a member function. */
4563 && (DECL_FUNCTION_MEMBER_P (decl
)
4564 ? same_type_p (DECL_CONTEXT (decl
), current_class_type
)
4565 : DECL_FRIEND_CONTEXT (decl
)
4566 ? same_type_p (DECL_FRIEND_CONTEXT (decl
), current_class_type
)
4568 /* And, if it was a member function, it really was defined in
4569 the scope of the class. */
4570 && (!DECL_FUNCTION_MEMBER_P (decl
)
4571 || DECL_INITIALIZED_IN_CLASS_P (decl
)))
4572 /* We already checked these parameters when the template was
4573 declared, so there's no need to do it again now. This function
4574 was defined in class scope, but we're processing it's body now
4575 that the class is complete. */
4578 /* Core issue 226 (C++0x only): the following only applies to class
4580 if ((cxx_dialect
== cxx98
) || TREE_CODE (decl
) != FUNCTION_DECL
)
4584 If a template-parameter has a default template-argument, all
4585 subsequent template-parameters shall have a default
4586 template-argument supplied. */
4587 for (parm_level
= parms
; parm_level
; parm_level
= TREE_CHAIN (parm_level
))
4589 tree inner_parms
= TREE_VALUE (parm_level
);
4590 int ntparms
= TREE_VEC_LENGTH (inner_parms
);
4591 int seen_def_arg_p
= 0;
4594 for (i
= 0; i
< ntparms
; ++i
)
4596 tree parm
= TREE_VEC_ELT (inner_parms
, i
);
4598 if (parm
== error_mark_node
)
4601 if (TREE_PURPOSE (parm
))
4603 else if (seen_def_arg_p
4604 && !template_parameter_pack_p (TREE_VALUE (parm
)))
4606 error ("no default argument for %qD", TREE_VALUE (parm
));
4607 /* For better subsequent error-recovery, we indicate that
4608 there should have been a default argument. */
4609 TREE_PURPOSE (parm
) = error_mark_node
;
4615 /* Don't complain about an enclosing partial
4617 && parm_level
== parms
4618 && TREE_CODE (decl
) == TYPE_DECL
4620 && template_parameter_pack_p (TREE_VALUE (parm
)))
4622 /* A primary class template can only have one
4623 parameter pack, at the end of the template
4626 if (TREE_CODE (TREE_VALUE (parm
)) == PARM_DECL
)
4627 error ("parameter pack %qE must be at the end of the"
4628 " template parameter list", TREE_VALUE (parm
));
4630 error ("parameter pack %qT must be at the end of the"
4631 " template parameter list",
4632 TREE_TYPE (TREE_VALUE (parm
)));
4634 TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
))
4642 if (((cxx_dialect
== cxx98
) && TREE_CODE (decl
) != TYPE_DECL
)
4646 /* For an ordinary class template, default template arguments are
4647 allowed at the innermost level, e.g.:
4648 template <class T = int>
4650 but, in a partial specialization, they're not allowed even
4651 there, as we have in [temp.class.spec]:
4653 The template parameter list of a specialization shall not
4654 contain default template argument values.
4656 So, for a partial specialization, or for a function template
4657 (in C++98/C++03), we look at all of them. */
4660 /* But, for a primary class template that is not a partial
4661 specialization we look at all template parameters except the
4663 parms
= TREE_CHAIN (parms
);
4665 /* Figure out what error message to issue. */
4666 if (is_friend_decl
== 2)
4667 msg
= G_("default template arguments may not be used in function template "
4668 "friend re-declaration");
4669 else if (is_friend_decl
)
4670 msg
= G_("default template arguments may not be used in function template "
4671 "friend declarations");
4672 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& (cxx_dialect
== cxx98
))
4673 msg
= G_("default template arguments may not be used in function templates "
4674 "without -std=c++11 or -std=gnu++11");
4675 else if (is_partial
)
4676 msg
= G_("default template arguments may not be used in "
4677 "partial specializations");
4679 msg
= G_("default argument for template parameter for class enclosing %qD");
4681 if (current_class_type
&& TYPE_BEING_DEFINED (current_class_type
))
4682 /* If we're inside a class definition, there's no need to
4683 examine the parameters to the class itself. On the one
4684 hand, they will be checked when the class is defined, and,
4685 on the other, default arguments are valid in things like:
4686 template <class T = double>
4687 struct S { template <class U> void f(U); };
4688 Here the default argument for `S' has no bearing on the
4689 declaration of `f'. */
4690 last_level_to_check
= template_class_depth (current_class_type
) + 1;
4692 /* Check everything. */
4693 last_level_to_check
= 0;
4695 for (parm_level
= parms
;
4696 parm_level
&& TMPL_PARMS_DEPTH (parm_level
) >= last_level_to_check
;
4697 parm_level
= TREE_CHAIN (parm_level
))
4699 tree inner_parms
= TREE_VALUE (parm_level
);
4703 ntparms
= TREE_VEC_LENGTH (inner_parms
);
4704 for (i
= 0; i
< ntparms
; ++i
)
4706 if (TREE_VEC_ELT (inner_parms
, i
) == error_mark_node
)
4709 if (TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)))
4714 if (is_friend_decl
== 2)
4721 /* Clear out the default argument so that we are not
4723 TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)) = NULL_TREE
;
4727 /* At this point, if we're still interested in issuing messages,
4728 they must apply to classes surrounding the object declared. */
4730 msg
= G_("default argument for template parameter for class "
4737 /* Worker for push_template_decl_real, called via
4738 for_each_template_parm. DATA is really an int, indicating the
4739 level of the parameters we are interested in. If T is a template
4740 parameter of that level, return nonzero. */
4743 template_parm_this_level_p (tree t
, void* data
)
4745 int this_level
= *(int *)data
;
4748 if (TREE_CODE (t
) == TEMPLATE_PARM_INDEX
)
4749 level
= TEMPLATE_PARM_LEVEL (t
);
4751 level
= TEMPLATE_TYPE_LEVEL (t
);
4752 return level
== this_level
;
4755 /* Creates a TEMPLATE_DECL for the indicated DECL using the template
4756 parameters given by current_template_args, or reuses a
4757 previously existing one, if appropriate. Returns the DECL, or an
4758 equivalent one, if it is replaced via a call to duplicate_decls.
4760 If IS_FRIEND is true, DECL is a friend declaration. */
4763 push_template_decl_real (tree decl
, bool is_friend
)
4771 int new_template_p
= 0;
4772 /* True if the template is a member template, in the sense of
4774 bool member_template_p
= false;
4776 if (decl
== error_mark_node
|| !current_template_parms
)
4777 return error_mark_node
;
4779 /* See if this is a partial specialization. */
4780 is_partial
= (DECL_IMPLICIT_TYPEDEF_P (decl
)
4781 && TREE_CODE (TREE_TYPE (decl
)) != ENUMERAL_TYPE
4782 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)));
4784 if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_FRIEND_P (decl
))
4788 /* For a friend, we want the context of the friend function, not
4789 the type of which it is a friend. */
4790 ctx
= CP_DECL_CONTEXT (decl
);
4791 else if (CP_DECL_CONTEXT (decl
)
4792 && TREE_CODE (CP_DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
4793 /* In the case of a virtual function, we want the class in which
4795 ctx
= CP_DECL_CONTEXT (decl
);
4797 /* Otherwise, if we're currently defining some class, the DECL
4798 is assumed to be a member of the class. */
4799 ctx
= current_scope ();
4801 if (ctx
&& TREE_CODE (ctx
) == NAMESPACE_DECL
)
4804 if (!DECL_CONTEXT (decl
))
4805 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
4807 /* See if this is a primary template. */
4808 if (is_friend
&& ctx
)
4809 /* A friend template that specifies a class context, i.e.
4810 template <typename T> friend void A<T>::f();
4814 primary
= template_parm_scope_p ();
4818 if (DECL_CLASS_SCOPE_P (decl
))
4819 member_template_p
= true;
4820 if (TREE_CODE (decl
) == TYPE_DECL
4821 && ANON_AGGRNAME_P (DECL_NAME (decl
)))
4823 error ("template class without a name");
4824 return error_mark_node
;
4826 else if (TREE_CODE (decl
) == FUNCTION_DECL
)
4828 if (DECL_DESTRUCTOR_P (decl
))
4832 A destructor shall not be a member template. */
4833 error ("destructor %qD declared as member template", decl
);
4834 return error_mark_node
;
4836 if (NEW_DELETE_OPNAME_P (DECL_NAME (decl
))
4837 && (!prototype_p (TREE_TYPE (decl
))
4838 || TYPE_ARG_TYPES (TREE_TYPE (decl
)) == void_list_node
4839 || !TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)))
4840 || (TREE_CHAIN (TYPE_ARG_TYPES ((TREE_TYPE (decl
))))
4841 == void_list_node
)))
4843 /* [basic.stc.dynamic.allocation]
4845 An allocation function can be a function
4846 template. ... Template allocation functions shall
4847 have two or more parameters. */
4848 error ("invalid template declaration of %qD", decl
);
4849 return error_mark_node
;
4852 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
4853 && CLASS_TYPE_P (TREE_TYPE (decl
)))
4855 else if (TREE_CODE (decl
) == TYPE_DECL
4856 && TYPE_DECL_ALIAS_P (decl
))
4857 /* alias-declaration */
4858 gcc_assert (!DECL_ARTIFICIAL (decl
));
4861 error ("template declaration of %q#D", decl
);
4862 return error_mark_node
;
4866 /* Check to see that the rules regarding the use of default
4867 arguments are not being violated. */
4868 check_default_tmpl_args (decl
, current_template_parms
,
4869 primary
, is_partial
, /*is_friend_decl=*/0);
4871 /* Ensure that there are no parameter packs in the type of this
4872 declaration that have not been expanded. */
4873 if (TREE_CODE (decl
) == FUNCTION_DECL
)
4875 /* Check each of the arguments individually to see if there are
4876 any bare parameter packs. */
4877 tree type
= TREE_TYPE (decl
);
4878 tree arg
= DECL_ARGUMENTS (decl
);
4879 tree argtype
= TYPE_ARG_TYPES (type
);
4881 while (arg
&& argtype
)
4883 if (!FUNCTION_PARAMETER_PACK_P (arg
)
4884 && check_for_bare_parameter_packs (TREE_TYPE (arg
)))
4886 /* This is a PARM_DECL that contains unexpanded parameter
4887 packs. We have already complained about this in the
4888 check_for_bare_parameter_packs call, so just replace
4889 these types with ERROR_MARK_NODE. */
4890 TREE_TYPE (arg
) = error_mark_node
;
4891 TREE_VALUE (argtype
) = error_mark_node
;
4894 arg
= DECL_CHAIN (arg
);
4895 argtype
= TREE_CHAIN (argtype
);
4898 /* Check for bare parameter packs in the return type and the
4899 exception specifiers. */
4900 if (check_for_bare_parameter_packs (TREE_TYPE (type
)))
4901 /* Errors were already issued, set return type to int
4902 as the frontend doesn't expect error_mark_node as
4904 TREE_TYPE (type
) = integer_type_node
;
4905 if (check_for_bare_parameter_packs (TYPE_RAISES_EXCEPTIONS (type
)))
4906 TYPE_RAISES_EXCEPTIONS (type
) = NULL_TREE
;
4908 else if (check_for_bare_parameter_packs (TREE_TYPE (decl
)))
4910 TREE_TYPE (decl
) = error_mark_node
;
4911 return error_mark_node
;
4915 return process_partial_specialization (decl
);
4917 args
= current_template_args ();
4920 || TREE_CODE (ctx
) == FUNCTION_DECL
4921 || (CLASS_TYPE_P (ctx
) && TYPE_BEING_DEFINED (ctx
))
4922 || (is_friend
&& !DECL_TEMPLATE_INFO (decl
)))
4924 if (DECL_LANG_SPECIFIC (decl
)
4925 && DECL_TEMPLATE_INFO (decl
)
4926 && DECL_TI_TEMPLATE (decl
))
4927 tmpl
= DECL_TI_TEMPLATE (decl
);
4928 /* If DECL is a TYPE_DECL for a class-template, then there won't
4929 be DECL_LANG_SPECIFIC. The information equivalent to
4930 DECL_TEMPLATE_INFO is found in TYPE_TEMPLATE_INFO instead. */
4931 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
4932 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl
))
4933 && TYPE_TI_TEMPLATE (TREE_TYPE (decl
)))
4935 /* Since a template declaration already existed for this
4936 class-type, we must be redeclaring it here. Make sure
4937 that the redeclaration is valid. */
4938 redeclare_class_template (TREE_TYPE (decl
),
4939 current_template_parms
);
4940 /* We don't need to create a new TEMPLATE_DECL; just use the
4941 one we already had. */
4942 tmpl
= TYPE_TI_TEMPLATE (TREE_TYPE (decl
));
4946 tmpl
= build_template_decl (decl
, current_template_parms
,
4950 if (DECL_LANG_SPECIFIC (decl
)
4951 && DECL_TEMPLATE_SPECIALIZATION (decl
))
4953 /* A specialization of a member template of a template
4955 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
4956 DECL_TEMPLATE_INFO (tmpl
) = DECL_TEMPLATE_INFO (decl
);
4957 DECL_TEMPLATE_INFO (decl
) = NULL_TREE
;
4963 tree a
, t
, current
, parms
;
4965 tree tinfo
= get_template_info (decl
);
4969 error ("template definition of non-template %q#D", decl
);
4970 return error_mark_node
;
4973 tmpl
= TI_TEMPLATE (tinfo
);
4975 if (DECL_FUNCTION_TEMPLATE_P (tmpl
)
4976 && DECL_TEMPLATE_INFO (decl
) && DECL_TI_ARGS (decl
)
4977 && DECL_TEMPLATE_SPECIALIZATION (decl
)
4978 && DECL_MEMBER_TEMPLATE_P (tmpl
))
4982 /* The declaration is a specialization of a member
4983 template, declared outside the class. Therefore, the
4984 innermost template arguments will be NULL, so we
4985 replace them with the arguments determined by the
4986 earlier call to check_explicit_specialization. */
4987 args
= DECL_TI_ARGS (decl
);
4990 = build_template_decl (decl
, current_template_parms
,
4992 DECL_TEMPLATE_RESULT (new_tmpl
) = decl
;
4993 TREE_TYPE (new_tmpl
) = TREE_TYPE (decl
);
4994 DECL_TI_TEMPLATE (decl
) = new_tmpl
;
4995 SET_DECL_TEMPLATE_SPECIALIZATION (new_tmpl
);
4996 DECL_TEMPLATE_INFO (new_tmpl
)
4997 = build_template_info (tmpl
, args
);
4999 register_specialization (new_tmpl
,
5000 most_general_template (tmpl
),
5006 /* Make sure the template headers we got make sense. */
5008 parms
= DECL_TEMPLATE_PARMS (tmpl
);
5009 i
= TMPL_PARMS_DEPTH (parms
);
5010 if (TMPL_ARGS_DEPTH (args
) != i
)
5012 error ("expected %d levels of template parms for %q#D, got %d",
5013 i
, decl
, TMPL_ARGS_DEPTH (args
));
5016 for (current
= decl
; i
> 0; --i
, parms
= TREE_CHAIN (parms
))
5018 a
= TMPL_ARGS_LEVEL (args
, i
);
5019 t
= INNERMOST_TEMPLATE_PARMS (parms
);
5021 if (TREE_VEC_LENGTH (t
) != TREE_VEC_LENGTH (a
))
5023 if (current
== decl
)
5024 error ("got %d template parameters for %q#D",
5025 TREE_VEC_LENGTH (a
), decl
);
5027 error ("got %d template parameters for %q#T",
5028 TREE_VEC_LENGTH (a
), current
);
5029 error (" but %d required", TREE_VEC_LENGTH (t
));
5030 return error_mark_node
;
5033 if (current
== decl
)
5035 else if (current
== NULL_TREE
)
5036 /* Can happen in erroneous input. */
5039 current
= (TYPE_P (current
)
5040 ? TYPE_CONTEXT (current
)
5041 : DECL_CONTEXT (current
));
5044 /* Check that the parms are used in the appropriate qualifying scopes
5045 in the declarator. */
5046 if (!comp_template_args
5048 TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (tmpl
)))))
5051 template arguments to %qD do not match original template %qD",
5052 decl
, DECL_TEMPLATE_RESULT (tmpl
));
5053 if (!uses_template_parms (TI_ARGS (tinfo
)))
5054 inform (input_location
, "use template<> for an explicit specialization");
5055 /* Avoid crash in import_export_decl. */
5056 DECL_INTERFACE_KNOWN (decl
) = 1;
5057 return error_mark_node
;
5061 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
5062 TREE_TYPE (tmpl
) = TREE_TYPE (decl
);
5064 /* Push template declarations for global functions and types. Note
5065 that we do not try to push a global template friend declared in a
5066 template class; such a thing may well depend on the template
5067 parameters of the class. */
5068 if (new_template_p
&& !ctx
5069 && !(is_friend
&& template_class_depth (current_class_type
) > 0))
5071 tmpl
= pushdecl_namespace_level (tmpl
, is_friend
);
5072 if (tmpl
== error_mark_node
)
5073 return error_mark_node
;
5075 /* Hide template friend classes that haven't been declared yet. */
5076 if (is_friend
&& TREE_CODE (decl
) == TYPE_DECL
)
5078 DECL_ANTICIPATED (tmpl
) = 1;
5079 DECL_FRIEND_P (tmpl
) = 1;
5085 tree parms
= DECL_TEMPLATE_PARMS (tmpl
);
5088 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
5089 if (DECL_CONV_FN_P (tmpl
))
5091 int depth
= TMPL_PARMS_DEPTH (parms
);
5093 /* It is a conversion operator. See if the type converted to
5094 depends on innermost template operands. */
5096 if (uses_template_parms_level (TREE_TYPE (TREE_TYPE (tmpl
)),
5098 DECL_TEMPLATE_CONV_FN_P (tmpl
) = 1;
5101 /* Give template template parms a DECL_CONTEXT of the template
5102 for which they are a parameter. */
5103 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
5104 for (i
= TREE_VEC_LENGTH (parms
) - 1; i
>= 0; --i
)
5106 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
5107 if (TREE_CODE (parm
) == TEMPLATE_DECL
)
5108 DECL_CONTEXT (parm
) = tmpl
;
5112 /* The DECL_TI_ARGS of DECL contains full set of arguments referring
5113 back to its most general template. If TMPL is a specialization,
5114 ARGS may only have the innermost set of arguments. Add the missing
5115 argument levels if necessary. */
5116 if (DECL_TEMPLATE_INFO (tmpl
))
5117 args
= add_outermost_template_args (DECL_TI_ARGS (tmpl
), args
);
5119 info
= build_template_info (tmpl
, args
);
5121 if (DECL_IMPLICIT_TYPEDEF_P (decl
))
5122 SET_TYPE_TEMPLATE_INFO (TREE_TYPE (tmpl
), info
);
5125 if (primary
&& !DECL_LANG_SPECIFIC (decl
))
5126 retrofit_lang_decl (decl
);
5127 if (DECL_LANG_SPECIFIC (decl
))
5128 DECL_TEMPLATE_INFO (decl
) = info
;
5131 return DECL_TEMPLATE_RESULT (tmpl
);
5135 push_template_decl (tree decl
)
5137 return push_template_decl_real (decl
, false);
5140 /* Called when a class template TYPE is redeclared with the indicated
5141 template PARMS, e.g.:
5143 template <class T> struct S;
5144 template <class T> struct S {}; */
5147 redeclare_class_template (tree type
, tree parms
)
5153 if (!TYPE_TEMPLATE_INFO (type
))
5155 error ("%qT is not a template type", type
);
5159 tmpl
= TYPE_TI_TEMPLATE (type
);
5160 if (!PRIMARY_TEMPLATE_P (tmpl
))
5161 /* The type is nested in some template class. Nothing to worry
5162 about here; there are no new template parameters for the nested
5168 error ("template specifiers not specified in declaration of %qD",
5173 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
5174 tmpl_parms
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl
);
5176 if (TREE_VEC_LENGTH (parms
) != TREE_VEC_LENGTH (tmpl_parms
))
5178 error_n (input_location
, TREE_VEC_LENGTH (parms
),
5179 "redeclared with %d template parameter",
5180 "redeclared with %d template parameters",
5181 TREE_VEC_LENGTH (parms
));
5182 inform_n (input_location
, TREE_VEC_LENGTH (tmpl_parms
),
5183 "previous declaration %q+D used %d template parameter",
5184 "previous declaration %q+D used %d template parameters",
5185 tmpl
, TREE_VEC_LENGTH (tmpl_parms
));
5189 for (i
= 0; i
< TREE_VEC_LENGTH (tmpl_parms
); ++i
)
5196 if (TREE_VEC_ELT (tmpl_parms
, i
) == error_mark_node
5197 || TREE_VEC_ELT (parms
, i
) == error_mark_node
)
5200 tmpl_parm
= TREE_VALUE (TREE_VEC_ELT (tmpl_parms
, i
));
5201 if (tmpl_parm
== error_mark_node
)
5204 parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
5205 tmpl_default
= TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
));
5206 parm_default
= TREE_PURPOSE (TREE_VEC_ELT (parms
, i
));
5208 /* TMPL_PARM and PARM can be either TYPE_DECL, PARM_DECL, or
5210 if (TREE_CODE (tmpl_parm
) != TREE_CODE (parm
)
5211 || (TREE_CODE (tmpl_parm
) != TYPE_DECL
5212 && !same_type_p (TREE_TYPE (tmpl_parm
), TREE_TYPE (parm
)))
5213 || (TREE_CODE (tmpl_parm
) != PARM_DECL
5214 && (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (tmpl_parm
))
5215 != TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
))))
5216 || (TREE_CODE (tmpl_parm
) == PARM_DECL
5217 && (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (tmpl_parm
))
5218 != TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))))
5220 error ("template parameter %q+#D", tmpl_parm
);
5221 error ("redeclared here as %q#D", parm
);
5225 if (tmpl_default
!= NULL_TREE
&& parm_default
!= NULL_TREE
)
5227 /* We have in [temp.param]:
5229 A template-parameter may not be given default arguments
5230 by two different declarations in the same scope. */
5231 error_at (input_location
, "redefinition of default argument for %q#D", parm
);
5232 inform (DECL_SOURCE_LOCATION (tmpl_parm
),
5233 "original definition appeared here");
5237 if (parm_default
!= NULL_TREE
)
5238 /* Update the previous template parameters (which are the ones
5239 that will really count) with the new default value. */
5240 TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
)) = parm_default
;
5241 else if (tmpl_default
!= NULL_TREE
)
5242 /* Update the new parameters, too; they'll be used as the
5243 parameters for any members. */
5244 TREE_PURPOSE (TREE_VEC_ELT (parms
, i
)) = tmpl_default
;
5250 /* Simplify EXPR if it is a non-dependent expression. Returns the
5251 (possibly simplified) expression. */
5254 fold_non_dependent_expr_sfinae (tree expr
, tsubst_flags_t complain
)
5256 if (expr
== NULL_TREE
)
5259 /* If we're in a template, but EXPR isn't value dependent, simplify
5260 it. We're supposed to treat:
5262 template <typename T> void f(T[1 + 1]);
5263 template <typename T> void f(T[2]);
5265 as two declarations of the same function, for example. */
5266 if (processing_template_decl
5267 && !type_dependent_expression_p (expr
)
5268 && potential_constant_expression (expr
)
5269 && !value_dependent_expression_p (expr
))
5271 HOST_WIDE_INT saved_processing_template_decl
;
5273 saved_processing_template_decl
= processing_template_decl
;
5274 processing_template_decl
= 0;
5275 expr
= tsubst_copy_and_build (expr
,
5278 /*in_decl=*/NULL_TREE
,
5279 /*function_p=*/false,
5280 /*integral_constant_expression_p=*/true);
5281 processing_template_decl
= saved_processing_template_decl
;
5287 fold_non_dependent_expr (tree expr
)
5289 return fold_non_dependent_expr_sfinae (expr
, tf_error
);
5292 /* Return TRUE iff T is a type alias, a TEMPLATE_DECL for an alias
5293 template declaration, or a TYPE_DECL for an alias declaration. */
5296 alias_type_or_template_p (tree t
)
5300 return ((TREE_CODE (t
) == TYPE_DECL
&& TYPE_DECL_ALIAS_P (t
))
5303 && TYPE_DECL_ALIAS_P (TYPE_NAME (t
)))
5304 || DECL_ALIAS_TEMPLATE_P (t
));
5307 /* Return TRUE iff is a specialization of an alias template. */
5310 alias_template_specialization_p (tree t
)
5314 return (primary_template_instantiation_p (t
)
5315 && DECL_ALIAS_TEMPLATE_P (TYPE_TI_TEMPLATE (t
)));
5318 /* Subroutine of convert_nontype_argument. Converts EXPR to TYPE, which
5319 must be a function or a pointer-to-function type, as specified
5320 in [temp.arg.nontype]: disambiguate EXPR if it is an overload set,
5321 and check that the resulting function has external linkage. */
5324 convert_nontype_argument_function (tree type
, tree expr
)
5328 linkage_kind linkage
;
5330 fn
= instantiate_type (type
, fns
, tf_none
);
5331 if (fn
== error_mark_node
)
5332 return error_mark_node
;
5335 if (TREE_CODE (fn_no_ptr
) == ADDR_EXPR
)
5336 fn_no_ptr
= TREE_OPERAND (fn_no_ptr
, 0);
5337 if (BASELINK_P (fn_no_ptr
))
5338 fn_no_ptr
= BASELINK_FUNCTIONS (fn_no_ptr
);
5340 /* [temp.arg.nontype]/1
5342 A template-argument for a non-type, non-template template-parameter
5345 -- the address of an object or function with external [C++11: or
5346 internal] linkage. */
5347 linkage
= decl_linkage (fn_no_ptr
);
5348 if (cxx_dialect
>= cxx0x
? linkage
== lk_none
: linkage
!= lk_external
)
5350 if (cxx_dialect
>= cxx0x
)
5351 error ("%qE is not a valid template argument for type %qT "
5352 "because %qD has no linkage",
5353 expr
, type
, fn_no_ptr
);
5355 error ("%qE is not a valid template argument for type %qT "
5356 "because %qD does not have external linkage",
5357 expr
, type
, fn_no_ptr
);
5364 /* Subroutine of convert_nontype_argument.
5365 Check if EXPR of type TYPE is a valid pointer-to-member constant.
5366 Emit an error otherwise. */
5369 check_valid_ptrmem_cst_expr (tree type
, tree expr
,
5370 tsubst_flags_t complain
)
5373 if (expr
&& (null_ptr_cst_p (expr
) || TREE_CODE (expr
) == PTRMEM_CST
))
5375 if (cxx_dialect
>= cxx0x
&& null_member_pointer_value_p (expr
))
5377 if (complain
& tf_error
)
5379 error ("%qE is not a valid template argument for type %qT",
5381 error ("it must be a pointer-to-member of the form %<&X::Y%>");
5386 /* Returns TRUE iff the address of OP is value-dependent.
5388 14.6.2.4 [temp.dep.temp]:
5389 A non-integral non-type template-argument is dependent if its type is
5390 dependent or it has either of the following forms
5393 and contains a nested-name-specifier which specifies a class-name that
5394 names a dependent type.
5396 We generalize this to just say that the address of a member of a
5397 dependent class is value-dependent; the above doesn't cover the
5398 address of a static data member named with an unqualified-id. */
5401 has_value_dependent_address (tree op
)
5403 /* We could use get_inner_reference here, but there's no need;
5404 this is only relevant for template non-type arguments, which
5405 can only be expressed as &id-expression. */
5408 tree ctx
= CP_DECL_CONTEXT (op
);
5409 if (TYPE_P (ctx
) && dependent_type_p (ctx
))
5416 /* The next set of functions are used for providing helpful explanatory
5417 diagnostics for failed overload resolution. Their messages should be
5418 indented by two spaces for consistency with the messages in
5422 unify_success (bool explain_p ATTRIBUTE_UNUSED
)
5428 unify_parameter_deduction_failure (bool explain_p
, tree parm
)
5431 inform (input_location
,
5432 " couldn't deduce template parameter %qD", parm
);
5437 unify_invalid (bool explain_p ATTRIBUTE_UNUSED
)
5443 unify_cv_qual_mismatch (bool explain_p
, tree parm
, tree arg
)
5446 inform (input_location
,
5447 " types %qT and %qT have incompatible cv-qualifiers",
5453 unify_type_mismatch (bool explain_p
, tree parm
, tree arg
)
5456 inform (input_location
, " mismatched types %qT and %qT", parm
, arg
);
5461 unify_parameter_pack_mismatch (bool explain_p
, tree parm
, tree arg
)
5464 inform (input_location
,
5465 " template parameter %qD is not a parameter pack, but "
5472 unify_ptrmem_cst_mismatch (bool explain_p
, tree parm
, tree arg
)
5475 inform (input_location
,
5476 " template argument %qE does not match "
5477 "pointer-to-member constant %qE",
5483 unify_expression_unequal (bool explain_p
, tree parm
, tree arg
)
5486 inform (input_location
, " %qE is not equivalent to %qE", parm
, arg
);
5491 unify_parameter_pack_inconsistent (bool explain_p
, tree old_arg
, tree new_arg
)
5494 inform (input_location
,
5495 " inconsistent parameter pack deduction with %qT and %qT",
5501 unify_inconsistency (bool explain_p
, tree parm
, tree first
, tree second
)
5506 inform (input_location
,
5507 " deduced conflicting types for parameter %qT (%qT and %qT)",
5508 parm
, first
, second
);
5510 inform (input_location
,
5511 " deduced conflicting values for non-type parameter "
5512 "%qE (%qE and %qE)", parm
, first
, second
);
5518 unify_vla_arg (bool explain_p
, tree arg
)
5521 inform (input_location
,
5522 " variable-sized array type %qT is not "
5523 "a valid template argument",
5529 unify_method_type_error (bool explain_p
, tree arg
)
5532 inform (input_location
,
5533 " member function type %qT is not a valid template argument",
5539 unify_arity (bool explain_p
, int have
, int wanted
)
5542 inform_n (input_location
, wanted
,
5543 " candidate expects %d argument, %d provided",
5544 " candidate expects %d arguments, %d provided",
5550 unify_too_many_arguments (bool explain_p
, int have
, int wanted
)
5552 return unify_arity (explain_p
, have
, wanted
);
5556 unify_too_few_arguments (bool explain_p
, int have
, int wanted
)
5558 return unify_arity (explain_p
, have
, wanted
);
5562 unify_arg_conversion (bool explain_p
, tree to_type
,
5563 tree from_type
, tree arg
)
5566 inform (input_location
, " cannot convert %qE (type %qT) to type %qT",
5567 arg
, from_type
, to_type
);
5572 unify_no_common_base (bool explain_p
, enum template_base_result r
,
5573 tree parm
, tree arg
)
5578 case tbr_ambiguous_baseclass
:
5579 inform (input_location
, " %qT is an ambiguous base class of %qT",
5583 inform (input_location
, " %qT is not derived from %qT", arg
, parm
);
5590 unify_inconsistent_template_template_parameters (bool explain_p
)
5593 inform (input_location
,
5594 " template parameters of a template template argument are "
5595 "inconsistent with other deduced template arguments");
5600 unify_template_deduction_failure (bool explain_p
, tree parm
, tree arg
)
5603 inform (input_location
,
5604 " can't deduce a template for %qT from non-template type %qT",
5610 unify_template_argument_mismatch (bool explain_p
, tree parm
, tree arg
)
5613 inform (input_location
,
5614 " template argument %qE does not match %qD", arg
, parm
);
5619 unify_overload_resolution_failure (bool explain_p
, tree arg
)
5622 inform (input_location
,
5623 " could not resolve address from overloaded function %qE",
5628 /* Attempt to convert the non-type template parameter EXPR to the
5629 indicated TYPE. If the conversion is successful, return the
5630 converted value. If the conversion is unsuccessful, return
5631 NULL_TREE if we issued an error message, or error_mark_node if we
5632 did not. We issue error messages for out-and-out bad template
5633 parameters, but not simply because the conversion failed, since we
5634 might be just trying to do argument deduction. Both TYPE and EXPR
5635 must be non-dependent.
5637 The conversion follows the special rules described in
5638 [temp.arg.nontype], and it is much more strict than an implicit
5641 This function is called twice for each template argument (see
5642 lookup_template_class for a more accurate description of this
5643 problem). This means that we need to handle expressions which
5644 are not valid in a C++ source, but can be created from the
5645 first call (for instance, casts to perform conversions). These
5646 hacks can go away after we fix the double coercion problem. */
5649 convert_nontype_argument (tree type
, tree expr
, tsubst_flags_t complain
)
5653 /* Detect immediately string literals as invalid non-type argument.
5654 This special-case is not needed for correctness (we would easily
5655 catch this later), but only to provide better diagnostic for this
5656 common user mistake. As suggested by DR 100, we do not mention
5657 linkage issues in the diagnostic as this is not the point. */
5658 /* FIXME we're making this OK. */
5659 if (TREE_CODE (expr
) == STRING_CST
)
5661 if (complain
& tf_error
)
5662 error ("%qE is not a valid template argument for type %qT "
5663 "because string literals can never be used in this context",
5668 /* Add the ADDR_EXPR now for the benefit of
5669 value_dependent_expression_p. */
5670 if (TYPE_PTROBV_P (type
)
5671 && TREE_CODE (TREE_TYPE (expr
)) == ARRAY_TYPE
)
5672 expr
= decay_conversion (expr
);
5674 /* If we are in a template, EXPR may be non-dependent, but still
5675 have a syntactic, rather than semantic, form. For example, EXPR
5676 might be a SCOPE_REF, rather than the VAR_DECL to which the
5677 SCOPE_REF refers. Preserving the qualifying scope is necessary
5678 so that access checking can be performed when the template is
5679 instantiated -- but here we need the resolved form so that we can
5680 convert the argument. */
5681 if (TYPE_REF_OBJ_P (type
)
5682 && has_value_dependent_address (expr
))
5683 /* If we want the address and it's value-dependent, don't fold. */;
5684 else if (!type_unknown_p (expr
))
5685 expr
= fold_non_dependent_expr_sfinae (expr
, complain
);
5686 if (error_operand_p (expr
))
5687 return error_mark_node
;
5688 expr_type
= TREE_TYPE (expr
);
5689 if (TREE_CODE (type
) == REFERENCE_TYPE
)
5690 expr
= mark_lvalue_use (expr
);
5692 expr
= mark_rvalue_use (expr
);
5694 /* 14.3.2/5: The null pointer{,-to-member} conversion is applied
5695 to a non-type argument of "nullptr". */
5696 if (expr
== nullptr_node
5697 && (TYPE_PTR_P (type
) || TYPE_PTR_TO_MEMBER_P (type
)))
5698 expr
= convert (type
, expr
);
5700 /* In C++11, integral or enumeration non-type template arguments can be
5701 arbitrary constant expressions. Pointer and pointer to
5702 member arguments can be general constant expressions that evaluate
5703 to a null value, but otherwise still need to be of a specific form. */
5704 if (cxx_dialect
>= cxx0x
)
5706 if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
5707 expr
= maybe_constant_value (expr
);
5708 else if (TYPE_PTR_P (type
)
5709 || (TYPE_PTR_TO_MEMBER_P (type
)
5710 && TREE_CODE (expr
) != PTRMEM_CST
))
5712 tree folded
= maybe_constant_value (expr
);
5713 if (TYPE_PTR_P (type
) ? integer_zerop (folded
)
5714 : null_member_pointer_value_p (folded
))
5719 /* HACK: Due to double coercion, we can get a
5720 NOP_EXPR<REFERENCE_TYPE>(ADDR_EXPR<POINTER_TYPE> (arg)) here,
5721 which is the tree that we built on the first call (see
5722 below when coercing to reference to object or to reference to
5723 function). We just strip everything and get to the arg.
5724 See g++.old-deja/g++.oliva/template4.C and g++.dg/template/nontype9.C
5726 if (TYPE_REF_OBJ_P (type
) || TYPE_REFFN_P (type
))
5728 tree probe_type
, probe
= expr
;
5729 if (REFERENCE_REF_P (probe
))
5730 probe
= TREE_OPERAND (probe
, 0);
5731 probe_type
= TREE_TYPE (probe
);
5732 if (TREE_CODE (probe
) == NOP_EXPR
)
5734 /* ??? Maybe we could use convert_from_reference here, but we
5735 would need to relax its constraints because the NOP_EXPR
5736 could actually change the type to something more cv-qualified,
5737 and this is not folded by convert_from_reference. */
5738 tree addr
= TREE_OPERAND (probe
, 0);
5739 gcc_assert (TREE_CODE (probe_type
) == REFERENCE_TYPE
);
5740 gcc_assert (TREE_CODE (addr
) == ADDR_EXPR
);
5741 gcc_assert (TREE_CODE (TREE_TYPE (addr
)) == POINTER_TYPE
);
5742 gcc_assert (same_type_ignoring_top_level_qualifiers_p
5743 (TREE_TYPE (probe_type
),
5744 TREE_TYPE (TREE_TYPE (addr
))));
5746 expr
= TREE_OPERAND (addr
, 0);
5747 expr_type
= TREE_TYPE (expr
);
5751 /* We could also generate a NOP_EXPR(ADDR_EXPR()) when the
5752 parameter is a pointer to object, through decay and
5753 qualification conversion. Let's strip everything. */
5754 else if (TREE_CODE (expr
) == NOP_EXPR
&& TYPE_PTROBV_P (type
))
5757 gcc_assert (TREE_CODE (expr
) == ADDR_EXPR
);
5758 gcc_assert (TREE_CODE (TREE_TYPE (expr
)) == POINTER_TYPE
);
5759 /* Skip the ADDR_EXPR only if it is part of the decay for
5760 an array. Otherwise, it is part of the original argument
5761 in the source code. */
5762 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (expr
, 0))) == ARRAY_TYPE
)
5763 expr
= TREE_OPERAND (expr
, 0);
5764 expr_type
= TREE_TYPE (expr
);
5767 /* [temp.arg.nontype]/5, bullet 1
5769 For a non-type template-parameter of integral or enumeration type,
5770 integral promotions (_conv.prom_) and integral conversions
5771 (_conv.integral_) are applied. */
5772 if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
5774 tree t
= build_integral_nontype_arg_conv (type
, expr
, complain
);
5775 t
= maybe_constant_value (t
);
5776 if (t
!= error_mark_node
)
5779 if (!same_type_ignoring_top_level_qualifiers_p (type
, TREE_TYPE (expr
)))
5780 return error_mark_node
;
5782 /* Notice that there are constant expressions like '4 % 0' which
5783 do not fold into integer constants. */
5784 if (TREE_CODE (expr
) != INTEGER_CST
)
5786 if (complain
& tf_error
)
5788 int errs
= errorcount
, warns
= warningcount
;
5789 expr
= cxx_constant_value (expr
);
5790 if (errorcount
> errs
|| warningcount
> warns
)
5791 inform (EXPR_LOC_OR_HERE (expr
),
5792 "in template argument for type %qT ", type
);
5793 if (expr
== error_mark_node
)
5795 /* else cxx_constant_value complained but gave us
5796 a real constant, so go ahead. */
5797 gcc_assert (TREE_CODE (expr
) == INTEGER_CST
);
5803 /* [temp.arg.nontype]/5, bullet 2
5805 For a non-type template-parameter of type pointer to object,
5806 qualification conversions (_conv.qual_) and the array-to-pointer
5807 conversion (_conv.array_) are applied. */
5808 else if (TYPE_PTROBV_P (type
))
5810 /* [temp.arg.nontype]/1 (TC1 version, DR 49):
5812 A template-argument for a non-type, non-template template-parameter
5813 shall be one of: [...]
5815 -- the name of a non-type template-parameter;
5816 -- the address of an object or function with external linkage, [...]
5817 expressed as "& id-expression" where the & is optional if the name
5818 refers to a function or array, or if the corresponding
5819 template-parameter is a reference.
5821 Here, we do not care about functions, as they are invalid anyway
5822 for a parameter of type pointer-to-object. */
5824 if (DECL_P (expr
) && DECL_TEMPLATE_PARM_P (expr
))
5825 /* Non-type template parameters are OK. */
5827 else if (cxx_dialect
>= cxx0x
&& integer_zerop (expr
))
5828 /* Null pointer values are OK in C++11. */;
5829 else if (TREE_CODE (expr
) != ADDR_EXPR
5830 && TREE_CODE (expr_type
) != ARRAY_TYPE
)
5832 if (TREE_CODE (expr
) == VAR_DECL
)
5834 error ("%qD is not a valid template argument "
5835 "because %qD is a variable, not the address of "
5840 /* Other values, like integer constants, might be valid
5841 non-type arguments of some other type. */
5842 return error_mark_node
;
5848 decl
= ((TREE_CODE (expr
) == ADDR_EXPR
)
5849 ? TREE_OPERAND (expr
, 0) : expr
);
5850 if (TREE_CODE (decl
) != VAR_DECL
)
5852 error ("%qE is not a valid template argument of type %qT "
5853 "because %qE is not a variable",
5857 else if (cxx_dialect
< cxx0x
&& !DECL_EXTERNAL_LINKAGE_P (decl
))
5859 error ("%qE is not a valid template argument of type %qT "
5860 "because %qD does not have external linkage",
5864 else if (cxx_dialect
>= cxx0x
&& decl_linkage (decl
) == lk_none
)
5866 error ("%qE is not a valid template argument of type %qT "
5867 "because %qD has no linkage",
5873 expr
= decay_conversion (expr
);
5874 if (expr
== error_mark_node
)
5875 return error_mark_node
;
5877 expr
= perform_qualification_conversions (type
, expr
);
5878 if (expr
== error_mark_node
)
5879 return error_mark_node
;
5881 /* [temp.arg.nontype]/5, bullet 3
5883 For a non-type template-parameter of type reference to object, no
5884 conversions apply. The type referred to by the reference may be more
5885 cv-qualified than the (otherwise identical) type of the
5886 template-argument. The template-parameter is bound directly to the
5887 template-argument, which must be an lvalue. */
5888 else if (TYPE_REF_OBJ_P (type
))
5890 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type
),
5892 return error_mark_node
;
5894 if (!at_least_as_qualified_p (TREE_TYPE (type
), expr_type
))
5896 error ("%qE is not a valid template argument for type %qT "
5897 "because of conflicts in cv-qualification", expr
, type
);
5901 if (!real_lvalue_p (expr
))
5903 error ("%qE is not a valid template argument for type %qT "
5904 "because it is not an lvalue", expr
, type
);
5908 /* [temp.arg.nontype]/1
5910 A template-argument for a non-type, non-template template-parameter
5911 shall be one of: [...]
5913 -- the address of an object or function with external linkage. */
5914 if (TREE_CODE (expr
) == INDIRECT_REF
5915 && TYPE_REF_OBJ_P (TREE_TYPE (TREE_OPERAND (expr
, 0))))
5917 expr
= TREE_OPERAND (expr
, 0);
5920 error ("%q#D is not a valid template argument for type %qT "
5921 "because a reference variable does not have a constant "
5922 "address", expr
, type
);
5929 error ("%qE is not a valid template argument for type %qT "
5930 "because it is not an object with external linkage",
5935 if (!DECL_EXTERNAL_LINKAGE_P (expr
))
5937 error ("%qE is not a valid template argument for type %qT "
5938 "because object %qD has not external linkage",
5943 expr
= build_nop (type
, build_address (expr
));
5945 /* [temp.arg.nontype]/5, bullet 4
5947 For a non-type template-parameter of type pointer to function, only
5948 the function-to-pointer conversion (_conv.func_) is applied. If the
5949 template-argument represents a set of overloaded functions (or a
5950 pointer to such), the matching function is selected from the set
5952 else if (TYPE_PTRFN_P (type
))
5954 /* If the argument is a template-id, we might not have enough
5955 context information to decay the pointer. */
5956 if (!type_unknown_p (expr_type
))
5958 expr
= decay_conversion (expr
);
5959 if (expr
== error_mark_node
)
5960 return error_mark_node
;
5963 if (cxx_dialect
>= cxx0x
&& integer_zerop (expr
))
5964 /* Null pointer values are OK in C++11. */
5965 return perform_qualification_conversions (type
, expr
);
5967 expr
= convert_nontype_argument_function (type
, expr
);
5968 if (!expr
|| expr
== error_mark_node
)
5971 if (TREE_CODE (expr
) != ADDR_EXPR
)
5973 error ("%qE is not a valid template argument for type %qT", expr
, type
);
5974 error ("it must be the address of a function with external linkage");
5978 /* [temp.arg.nontype]/5, bullet 5
5980 For a non-type template-parameter of type reference to function, no
5981 conversions apply. If the template-argument represents a set of
5982 overloaded functions, the matching function is selected from the set
5984 else if (TYPE_REFFN_P (type
))
5986 if (TREE_CODE (expr
) == ADDR_EXPR
)
5988 error ("%qE is not a valid template argument for type %qT "
5989 "because it is a pointer", expr
, type
);
5990 inform (input_location
, "try using %qE instead", TREE_OPERAND (expr
, 0));
5994 expr
= convert_nontype_argument_function (TREE_TYPE (type
), expr
);
5995 if (!expr
|| expr
== error_mark_node
)
5998 expr
= build_nop (type
, build_address (expr
));
6000 /* [temp.arg.nontype]/5, bullet 6
6002 For a non-type template-parameter of type pointer to member function,
6003 no conversions apply. If the template-argument represents a set of
6004 overloaded member functions, the matching member function is selected
6005 from the set (_over.over_). */
6006 else if (TYPE_PTRMEMFUNC_P (type
))
6008 expr
= instantiate_type (type
, expr
, tf_none
);
6009 if (expr
== error_mark_node
)
6010 return error_mark_node
;
6012 /* [temp.arg.nontype] bullet 1 says the pointer to member
6013 expression must be a pointer-to-member constant. */
6014 if (!check_valid_ptrmem_cst_expr (type
, expr
, complain
))
6015 return error_mark_node
;
6017 /* There is no way to disable standard conversions in
6018 resolve_address_of_overloaded_function (called by
6019 instantiate_type). It is possible that the call succeeded by
6020 converting &B::I to &D::I (where B is a base of D), so we need
6021 to reject this conversion here.
6023 Actually, even if there was a way to disable standard conversions,
6024 it would still be better to reject them here so that we can
6025 provide a superior diagnostic. */
6026 if (!same_type_p (TREE_TYPE (expr
), type
))
6028 error ("%qE is not a valid template argument for type %qT "
6029 "because it is of type %qT", expr
, type
,
6031 /* If we are just one standard conversion off, explain. */
6032 if (can_convert (type
, TREE_TYPE (expr
)))
6033 inform (input_location
,
6034 "standard conversions are not allowed in this context");
6038 /* [temp.arg.nontype]/5, bullet 7
6040 For a non-type template-parameter of type pointer to data member,
6041 qualification conversions (_conv.qual_) are applied. */
6042 else if (TYPE_PTRMEM_P (type
))
6044 /* [temp.arg.nontype] bullet 1 says the pointer to member
6045 expression must be a pointer-to-member constant. */
6046 if (!check_valid_ptrmem_cst_expr (type
, expr
, complain
))
6047 return error_mark_node
;
6049 expr
= perform_qualification_conversions (type
, expr
);
6050 if (expr
== error_mark_node
)
6053 else if (NULLPTR_TYPE_P (type
))
6055 if (expr
!= nullptr_node
)
6057 error ("%qE is not a valid template argument for type %qT "
6058 "because it is of type %qT", expr
, type
, TREE_TYPE (expr
));
6063 /* A template non-type parameter must be one of the above. */
6067 /* Sanity check: did we actually convert the argument to the
6069 gcc_assert (same_type_ignoring_top_level_qualifiers_p
6070 (type
, TREE_TYPE (expr
)));
6074 /* Subroutine of coerce_template_template_parms, which returns 1 if
6075 PARM_PARM and ARG_PARM match using the rule for the template
6076 parameters of template template parameters. Both PARM and ARG are
6077 template parameters; the rest of the arguments are the same as for
6078 coerce_template_template_parms.
6081 coerce_template_template_parm (tree parm
,
6083 tsubst_flags_t complain
,
6087 if (arg
== NULL_TREE
|| arg
== error_mark_node
6088 || parm
== NULL_TREE
|| parm
== error_mark_node
)
6091 if (TREE_CODE (arg
) != TREE_CODE (parm
))
6094 switch (TREE_CODE (parm
))
6097 /* We encounter instantiations of templates like
6098 template <template <template <class> class> class TT>
6101 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
6102 tree argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
6104 if (!coerce_template_template_parms
6105 (parmparm
, argparm
, complain
, in_decl
, outer_args
))
6111 if (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (arg
))
6112 && !TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
)))
6113 /* Argument is a parameter pack but parameter is not. */
6118 /* The tsubst call is used to handle cases such as
6120 template <int> class C {};
6121 template <class T, template <T> class TT> class D {};
6124 i.e. the parameter list of TT depends on earlier parameters. */
6125 if (!uses_template_parms (TREE_TYPE (arg
))
6127 (tsubst (TREE_TYPE (parm
), outer_args
, complain
, in_decl
),
6131 if (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (arg
))
6132 && !TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))
6133 /* Argument is a parameter pack but parameter is not. */
6146 /* Return 1 if PARM_PARMS and ARG_PARMS matches using rule for
6147 template template parameters. Both PARM_PARMS and ARG_PARMS are
6148 vectors of TREE_LIST nodes containing TYPE_DECL, TEMPLATE_DECL
6151 Consider the example:
6152 template <class T> class A;
6153 template<template <class U> class TT> class B;
6155 For B<A>, PARM_PARMS are the parameters to TT, while ARG_PARMS are
6156 the parameters to A, and OUTER_ARGS contains A. */
6159 coerce_template_template_parms (tree parm_parms
,
6161 tsubst_flags_t complain
,
6165 int nparms
, nargs
, i
;
6169 gcc_assert (TREE_CODE (parm_parms
) == TREE_VEC
);
6170 gcc_assert (TREE_CODE (arg_parms
) == TREE_VEC
);
6172 nparms
= TREE_VEC_LENGTH (parm_parms
);
6173 nargs
= TREE_VEC_LENGTH (arg_parms
);
6175 /* Determine whether we have a parameter pack at the end of the
6176 template template parameter's template parameter list. */
6177 if (TREE_VEC_ELT (parm_parms
, nparms
- 1) != error_mark_node
)
6179 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, nparms
- 1));
6181 if (parm
== error_mark_node
)
6184 switch (TREE_CODE (parm
))
6188 if (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
)))
6193 if (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))
6203 && !(variadic_p
&& nargs
>= nparms
- 1))
6206 /* Check all of the template parameters except the parameter pack at
6207 the end (if any). */
6208 for (i
= 0; i
< nparms
- variadic_p
; ++i
)
6210 if (TREE_VEC_ELT (parm_parms
, i
) == error_mark_node
6211 || TREE_VEC_ELT (arg_parms
, i
) == error_mark_node
)
6214 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
6215 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
6217 if (!coerce_template_template_parm (parm
, arg
, complain
, in_decl
,
6225 /* Check each of the template parameters in the template
6226 argument against the template parameter pack at the end of
6227 the template template parameter. */
6228 if (TREE_VEC_ELT (parm_parms
, i
) == error_mark_node
)
6231 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
6233 for (; i
< nargs
; ++i
)
6235 if (TREE_VEC_ELT (arg_parms
, i
) == error_mark_node
)
6238 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
6240 if (!coerce_template_template_parm (parm
, arg
, complain
, in_decl
,
6249 /* Verifies that the deduced template arguments (in TARGS) for the
6250 template template parameters (in TPARMS) represent valid bindings,
6251 by comparing the template parameter list of each template argument
6252 to the template parameter list of its corresponding template
6253 template parameter, in accordance with DR150. This
6254 routine can only be called after all template arguments have been
6255 deduced. It will return TRUE if all of the template template
6256 parameter bindings are okay, FALSE otherwise. */
6258 template_template_parm_bindings_ok_p (tree tparms
, tree targs
)
6260 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
6263 /* We're dealing with template parms in this process. */
6264 ++processing_template_decl
;
6266 targs
= INNERMOST_TEMPLATE_ARGS (targs
);
6268 for (i
= 0; i
< ntparms
; ++i
)
6270 tree tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
6271 tree targ
= TREE_VEC_ELT (targs
, i
);
6273 if (TREE_CODE (tparm
) == TEMPLATE_DECL
&& targ
)
6275 tree packed_args
= NULL_TREE
;
6278 if (ARGUMENT_PACK_P (targ
))
6280 /* Look inside the argument pack. */
6281 packed_args
= ARGUMENT_PACK_ARGS (targ
);
6282 len
= TREE_VEC_LENGTH (packed_args
);
6285 for (idx
= 0; idx
< len
; ++idx
)
6287 tree targ_parms
= NULL_TREE
;
6290 /* Extract the next argument from the argument
6292 targ
= TREE_VEC_ELT (packed_args
, idx
);
6294 if (PACK_EXPANSION_P (targ
))
6295 /* Look at the pattern of the pack expansion. */
6296 targ
= PACK_EXPANSION_PATTERN (targ
);
6298 /* Extract the template parameters from the template
6300 if (TREE_CODE (targ
) == TEMPLATE_DECL
)
6301 targ_parms
= DECL_INNERMOST_TEMPLATE_PARMS (targ
);
6302 else if (TREE_CODE (targ
) == TEMPLATE_TEMPLATE_PARM
)
6303 targ_parms
= DECL_INNERMOST_TEMPLATE_PARMS (TYPE_NAME (targ
));
6305 /* Verify that we can coerce the template template
6306 parameters from the template argument to the template
6307 parameter. This requires an exact match. */
6309 && !coerce_template_template_parms
6310 (DECL_INNERMOST_TEMPLATE_PARMS (tparm
),
6325 --processing_template_decl
;
6329 /* Since type attributes aren't mangled, we need to strip them from
6330 template type arguments. */
6333 canonicalize_type_argument (tree arg
, tsubst_flags_t complain
)
6336 if (!arg
|| arg
== error_mark_node
|| arg
== TYPE_CANONICAL (arg
))
6338 mv
= TYPE_MAIN_VARIANT (arg
);
6339 arg
= strip_typedefs (arg
);
6340 if (TYPE_ALIGN (arg
) != TYPE_ALIGN (mv
)
6341 || TYPE_ATTRIBUTES (arg
) != TYPE_ATTRIBUTES (mv
))
6343 if (complain
& tf_warning
)
6344 warning (0, "ignoring attributes on template argument %qT", arg
);
6345 arg
= build_aligned_type (arg
, TYPE_ALIGN (mv
));
6346 arg
= cp_build_type_attribute_variant (arg
, TYPE_ATTRIBUTES (mv
));
6351 /* Convert the indicated template ARG as necessary to match the
6352 indicated template PARM. Returns the converted ARG, or
6353 error_mark_node if the conversion was unsuccessful. Error and
6354 warning messages are issued under control of COMPLAIN. This
6355 conversion is for the Ith parameter in the parameter list. ARGS is
6356 the full set of template arguments deduced so far. */
6359 convert_template_argument (tree parm
,
6362 tsubst_flags_t complain
,
6368 int is_type
, requires_type
, is_tmpl_type
, requires_tmpl_type
;
6370 if (TREE_CODE (arg
) == TREE_LIST
6371 && TREE_CODE (TREE_VALUE (arg
)) == OFFSET_REF
)
6373 /* The template argument was the name of some
6374 member function. That's usually
6375 invalid, but static members are OK. In any
6376 case, grab the underlying fields/functions
6377 and issue an error later if required. */
6378 orig_arg
= TREE_VALUE (arg
);
6379 TREE_TYPE (arg
) = unknown_type_node
;
6384 requires_tmpl_type
= TREE_CODE (parm
) == TEMPLATE_DECL
;
6385 requires_type
= (TREE_CODE (parm
) == TYPE_DECL
6386 || requires_tmpl_type
);
6388 /* When determining whether an argument pack expansion is a template,
6389 look at the pattern. */
6390 if (TREE_CODE (arg
) == TYPE_PACK_EXPANSION
)
6391 arg
= PACK_EXPANSION_PATTERN (arg
);
6393 /* Deal with an injected-class-name used as a template template arg. */
6394 if (requires_tmpl_type
&& CLASS_TYPE_P (arg
))
6396 tree t
= maybe_get_template_decl_from_type_decl (TYPE_NAME (arg
));
6397 if (TREE_CODE (t
) == TEMPLATE_DECL
)
6399 if (cxx_dialect
>= cxx0x
)
6400 /* OK under DR 1004. */;
6401 else if (complain
& tf_warning_or_error
)
6402 pedwarn (input_location
, OPT_pedantic
, "injected-class-name %qD"
6403 " used as template template argument", TYPE_NAME (arg
));
6404 else if (flag_pedantic_errors
)
6412 ((TREE_CODE (arg
) == TEMPLATE_DECL
6413 && TREE_CODE (DECL_TEMPLATE_RESULT (arg
)) == TYPE_DECL
)
6414 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
6415 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
);
6418 && (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
6419 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
))
6420 arg
= TYPE_STUB_DECL (arg
);
6422 is_type
= TYPE_P (arg
) || is_tmpl_type
;
6424 if (requires_type
&& ! is_type
&& TREE_CODE (arg
) == SCOPE_REF
6425 && TREE_CODE (TREE_OPERAND (arg
, 0)) == TEMPLATE_TYPE_PARM
)
6427 permerror (input_location
, "to refer to a type member of a template parameter, "
6428 "use %<typename %E%>", orig_arg
);
6430 orig_arg
= make_typename_type (TREE_OPERAND (arg
, 0),
6431 TREE_OPERAND (arg
, 1),
6433 complain
& tf_error
);
6437 if (is_type
!= requires_type
)
6441 if (complain
& tf_error
)
6443 error ("type/value mismatch at argument %d in template "
6444 "parameter list for %qD",
6447 error (" expected a constant of type %qT, got %qT",
6449 (DECL_P (arg
) ? DECL_NAME (arg
) : orig_arg
));
6450 else if (requires_tmpl_type
)
6451 error (" expected a class template, got %qE", orig_arg
);
6453 error (" expected a type, got %qE", orig_arg
);
6456 return error_mark_node
;
6458 if (is_tmpl_type
^ requires_tmpl_type
)
6460 if (in_decl
&& (complain
& tf_error
))
6462 error ("type/value mismatch at argument %d in template "
6463 "parameter list for %qD",
6466 error (" expected a type, got %qT", DECL_NAME (arg
));
6468 error (" expected a class template, got %qT", orig_arg
);
6470 return error_mark_node
;
6475 if (requires_tmpl_type
)
6477 if (TREE_CODE (TREE_TYPE (arg
)) == UNBOUND_CLASS_TEMPLATE
)
6478 /* The number of argument required is not known yet.
6479 Just accept it for now. */
6480 val
= TREE_TYPE (arg
);
6483 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
6486 argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
6488 if (coerce_template_template_parms (parmparm
, argparm
,
6494 /* TEMPLATE_TEMPLATE_PARM node is preferred over
6496 if (val
!= error_mark_node
)
6498 if (DECL_TEMPLATE_TEMPLATE_PARM_P (val
))
6499 val
= TREE_TYPE (val
);
6500 if (TREE_CODE (orig_arg
) == TYPE_PACK_EXPANSION
)
6501 val
= make_pack_expansion (val
);
6506 if (in_decl
&& (complain
& tf_error
))
6508 error ("type/value mismatch at argument %d in "
6509 "template parameter list for %qD",
6511 error (" expected a template of type %qD, got %qT",
6515 val
= error_mark_node
;
6521 /* We only form one instance of each template specialization.
6522 Therefore, if we use a non-canonical variant (i.e., a
6523 typedef), any future messages referring to the type will use
6524 the typedef, which is confusing if those future uses do not
6525 themselves also use the typedef. */
6527 val
= canonicalize_type_argument (val
, complain
);
6531 tree t
= tsubst (TREE_TYPE (parm
), args
, complain
, in_decl
);
6533 if (invalid_nontype_parm_type_p (t
, complain
))
6534 return error_mark_node
;
6536 if (template_parameter_pack_p (parm
) && ARGUMENT_PACK_P (orig_arg
))
6538 if (same_type_p (t
, TREE_TYPE (orig_arg
)))
6542 /* Not sure if this is reachable, but it doesn't hurt
6544 error ("type mismatch in nontype parameter pack");
6545 val
= error_mark_node
;
6548 else if (!uses_template_parms (orig_arg
) && !uses_template_parms (t
))
6549 /* We used to call digest_init here. However, digest_init
6550 will report errors, which we don't want when complain
6551 is zero. More importantly, digest_init will try too
6552 hard to convert things: for example, `0' should not be
6553 converted to pointer type at this point according to
6554 the standard. Accepting this is not merely an
6555 extension, since deciding whether or not these
6556 conversions can occur is part of determining which
6557 function template to call, or whether a given explicit
6558 argument specification is valid. */
6559 val
= convert_nontype_argument (t
, orig_arg
, complain
);
6563 if (val
== NULL_TREE
)
6564 val
= error_mark_node
;
6565 else if (val
== error_mark_node
&& (complain
& tf_error
))
6566 error ("could not convert template argument %qE to %qT", orig_arg
, t
);
6568 if (TREE_CODE (val
) == SCOPE_REF
)
6570 /* Strip typedefs from the SCOPE_REF. */
6571 tree type
= canonicalize_type_argument (TREE_TYPE (val
), complain
);
6572 tree scope
= canonicalize_type_argument (TREE_OPERAND (val
, 0),
6574 val
= build_qualified_name (type
, scope
, TREE_OPERAND (val
, 1),
6575 QUALIFIED_NAME_IS_TEMPLATE (val
));
6582 /* Coerces the remaining template arguments in INNER_ARGS (from
6583 ARG_IDX to the end) into the parameter pack at PARM_IDX in PARMS.
6584 Returns the coerced argument pack. PARM_IDX is the position of this
6585 parameter in the template parameter list. ARGS is the original
6586 template argument list. */
6588 coerce_template_parameter_pack (tree parms
,
6596 tsubst_flags_t complain
)
6598 tree parm
= TREE_VEC_ELT (parms
, parm_idx
);
6599 int nargs
= inner_args
? NUM_TMPL_ARGS (inner_args
) : 0;
6602 tree packed_types
= NULL_TREE
;
6604 if (arg_idx
> nargs
)
6607 packed_args
= make_tree_vec (nargs
- arg_idx
);
6609 if (TREE_CODE (TREE_VALUE (parm
)) == PARM_DECL
6610 && uses_parameter_packs (TREE_TYPE (TREE_VALUE (parm
))))
6612 /* When the template parameter is a non-type template
6613 parameter pack whose type uses parameter packs, we need
6614 to look at each of the template arguments
6615 separately. Build a vector of the types for these
6616 non-type template parameters in PACKED_TYPES. */
6618 = make_pack_expansion (TREE_TYPE (TREE_VALUE (parm
)));
6619 packed_types
= tsubst_pack_expansion (expansion
, args
,
6622 if (packed_types
== error_mark_node
)
6623 return error_mark_node
;
6625 /* Check that we have the right number of arguments. */
6627 && !PACK_EXPANSION_P (TREE_VEC_ELT (inner_args
, arg_idx
))
6628 && nargs
- arg_idx
!= TREE_VEC_LENGTH (packed_types
))
6631 = TREE_VEC_LENGTH (parms
) - 1 + TREE_VEC_LENGTH (packed_types
);
6632 error ("wrong number of template arguments (%d, should be %d)",
6633 nargs
, needed_parms
);
6634 return error_mark_node
;
6637 /* If we aren't able to check the actual arguments now
6638 (because they haven't been expanded yet), we can at least
6639 verify that all of the types used for the non-type
6640 template parameter pack are, in fact, valid for non-type
6641 template parameters. */
6643 && PACK_EXPANSION_P (TREE_VEC_ELT (inner_args
, arg_idx
)))
6645 int j
, len
= TREE_VEC_LENGTH (packed_types
);
6646 for (j
= 0; j
< len
; ++j
)
6648 tree t
= TREE_VEC_ELT (packed_types
, j
);
6649 if (invalid_nontype_parm_type_p (t
, complain
))
6650 return error_mark_node
;
6655 /* Convert the remaining arguments, which will be a part of the
6656 parameter pack "parm". */
6657 for (; arg_idx
< nargs
; ++arg_idx
)
6659 tree arg
= TREE_VEC_ELT (inner_args
, arg_idx
);
6660 tree actual_parm
= TREE_VALUE (parm
);
6662 if (packed_types
&& !PACK_EXPANSION_P (arg
))
6664 /* When we have a vector of types (corresponding to the
6665 non-type template parameter pack that uses parameter
6666 packs in its type, as mention above), and the
6667 argument is not an expansion (which expands to a
6668 currently unknown number of arguments), clone the
6669 parm and give it the next type in PACKED_TYPES. */
6670 actual_parm
= copy_node (actual_parm
);
6671 TREE_TYPE (actual_parm
) =
6672 TREE_VEC_ELT (packed_types
, arg_idx
- parm_idx
);
6675 if (arg
!= error_mark_node
)
6676 arg
= convert_template_argument (actual_parm
,
6677 arg
, new_args
, complain
, parm_idx
,
6679 if (arg
== error_mark_node
)
6681 TREE_VEC_ELT (packed_args
, arg_idx
- parm_idx
) = arg
;
6684 if (TREE_CODE (TREE_VALUE (parm
)) == TYPE_DECL
6685 || TREE_CODE (TREE_VALUE (parm
)) == TEMPLATE_DECL
)
6686 argument_pack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
6689 argument_pack
= make_node (NONTYPE_ARGUMENT_PACK
);
6690 TREE_TYPE (argument_pack
)
6691 = tsubst (TREE_TYPE (TREE_VALUE (parm
)), new_args
, complain
, in_decl
);
6692 TREE_CONSTANT (argument_pack
) = 1;
6695 SET_ARGUMENT_PACK_ARGS (argument_pack
, packed_args
);
6696 #ifdef ENABLE_CHECKING
6697 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (packed_args
,
6698 TREE_VEC_LENGTH (packed_args
));
6700 return argument_pack
;
6703 /* Convert all template arguments to their appropriate types, and
6704 return a vector containing the innermost resulting template
6705 arguments. If any error occurs, return error_mark_node. Error and
6706 warning messages are issued under control of COMPLAIN.
6708 If REQUIRE_ALL_ARGS is false, argument deduction will be performed
6709 for arguments not specified in ARGS. Otherwise, if
6710 USE_DEFAULT_ARGS is true, default arguments will be used to fill in
6711 unspecified arguments. If REQUIRE_ALL_ARGS is true, but
6712 USE_DEFAULT_ARGS is false, then all arguments must be specified in
6716 coerce_template_parms (tree parms
,
6719 tsubst_flags_t complain
,
6720 bool require_all_args
,
6721 bool use_default_args
)
6723 int nparms
, nargs
, parm_idx
, arg_idx
, lost
= 0;
6726 tree new_inner_args
;
6727 int saved_unevaluated_operand
;
6728 int saved_inhibit_evaluation_warnings
;
6730 /* When used as a boolean value, indicates whether this is a
6731 variadic template parameter list. Since it's an int, we can also
6732 subtract it from nparms to get the number of non-variadic
6735 int post_variadic_parms
= 0;
6737 if (args
== error_mark_node
)
6738 return error_mark_node
;
6740 nparms
= TREE_VEC_LENGTH (parms
);
6742 /* Determine if there are any parameter packs. */
6743 for (parm_idx
= 0; parm_idx
< nparms
; ++parm_idx
)
6745 tree tparm
= TREE_VALUE (TREE_VEC_ELT (parms
, parm_idx
));
6747 ++post_variadic_parms
;
6748 if (template_parameter_pack_p (tparm
))
6752 inner_args
= INNERMOST_TEMPLATE_ARGS (args
);
6753 /* If there are no parameters that follow a parameter pack, we need to
6754 expand any argument packs so that we can deduce a parameter pack from
6755 some non-packed args followed by an argument pack, as in variadic85.C.
6756 If there are such parameters, we need to leave argument packs intact
6757 so the arguments are assigned properly. This can happen when dealing
6758 with a nested class inside a partial specialization of a class
6759 template, as in variadic92.C, or when deducing a template parameter pack
6760 from a sub-declarator, as in variadic114.C. */
6761 if (!post_variadic_parms
)
6762 inner_args
= expand_template_argument_pack (inner_args
);
6764 nargs
= inner_args
? NUM_TMPL_ARGS (inner_args
) : 0;
6765 if ((nargs
> nparms
&& !variadic_p
)
6766 || (nargs
< nparms
- variadic_p
6768 && (!use_default_args
6769 || (TREE_VEC_ELT (parms
, nargs
) != error_mark_node
6770 && !TREE_PURPOSE (TREE_VEC_ELT (parms
, nargs
))))))
6772 if (complain
& tf_error
)
6776 nparms
-= variadic_p
;
6777 error ("wrong number of template arguments "
6778 "(%d, should be %d or more)", nargs
, nparms
);
6781 error ("wrong number of template arguments "
6782 "(%d, should be %d)", nargs
, nparms
);
6785 error ("provided for %q+D", in_decl
);
6788 return error_mark_node
;
6791 /* We need to evaluate the template arguments, even though this
6792 template-id may be nested within a "sizeof". */
6793 saved_unevaluated_operand
= cp_unevaluated_operand
;
6794 cp_unevaluated_operand
= 0;
6795 saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
6796 c_inhibit_evaluation_warnings
= 0;
6797 new_inner_args
= make_tree_vec (nparms
);
6798 new_args
= add_outermost_template_args (args
, new_inner_args
);
6799 for (parm_idx
= 0, arg_idx
= 0; parm_idx
< nparms
; parm_idx
++, arg_idx
++)
6804 /* Get the Ith template parameter. */
6805 parm
= TREE_VEC_ELT (parms
, parm_idx
);
6807 if (parm
== error_mark_node
)
6809 TREE_VEC_ELT (new_inner_args
, arg_idx
) = error_mark_node
;
6813 /* Calculate the next argument. */
6814 if (arg_idx
< nargs
)
6815 arg
= TREE_VEC_ELT (inner_args
, arg_idx
);
6819 if (template_parameter_pack_p (TREE_VALUE (parm
))
6820 && !(arg
&& ARGUMENT_PACK_P (arg
)))
6822 /* All remaining arguments will be placed in the
6823 template parameter pack PARM. */
6824 arg
= coerce_template_parameter_pack (parms
, parm_idx
, args
,
6825 inner_args
, arg_idx
,
6829 /* Store this argument. */
6830 if (arg
== error_mark_node
)
6832 TREE_VEC_ELT (new_inner_args
, parm_idx
) = arg
;
6834 /* We are done with all of the arguments. */
6841 if (PACK_EXPANSION_P (arg
))
6843 /* We don't know how many args we have yet, just
6844 use the unconverted ones for now. */
6845 new_inner_args
= args
;
6849 else if (require_all_args
)
6851 /* There must be a default arg in this case. */
6852 arg
= tsubst_template_arg (TREE_PURPOSE (parm
), new_args
,
6854 /* The position of the first default template argument,
6855 is also the number of non-defaulted arguments in NEW_INNER_ARGS.
6857 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
))
6858 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
, arg_idx
);
6863 if (arg
== error_mark_node
)
6865 if (complain
& tf_error
)
6866 error ("template argument %d is invalid", arg_idx
+ 1);
6869 /* This only occurs if there was an error in the template
6870 parameter list itself (which we would already have
6871 reported) that we are trying to recover from, e.g., a class
6872 template with a parameter list such as
6873 template<typename..., typename>. */
6876 arg
= convert_template_argument (TREE_VALUE (parm
),
6877 arg
, new_args
, complain
,
6880 if (arg
== error_mark_node
)
6882 TREE_VEC_ELT (new_inner_args
, arg_idx
) = arg
;
6884 cp_unevaluated_operand
= saved_unevaluated_operand
;
6885 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
6888 return error_mark_node
;
6890 #ifdef ENABLE_CHECKING
6891 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
))
6892 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
,
6893 TREE_VEC_LENGTH (new_inner_args
));
6896 return new_inner_args
;
6899 /* Returns 1 if template args OT and NT are equivalent. */
6902 template_args_equal (tree ot
, tree nt
)
6906 if (nt
== NULL_TREE
|| ot
== NULL_TREE
)
6909 if (TREE_CODE (nt
) == TREE_VEC
)
6910 /* For member templates */
6911 return TREE_CODE (ot
) == TREE_VEC
&& comp_template_args (ot
, nt
);
6912 else if (PACK_EXPANSION_P (ot
))
6913 return (PACK_EXPANSION_P (nt
)
6914 && template_args_equal (PACK_EXPANSION_PATTERN (ot
),
6915 PACK_EXPANSION_PATTERN (nt
))
6916 && template_args_equal (PACK_EXPANSION_EXTRA_ARGS (ot
),
6917 PACK_EXPANSION_EXTRA_ARGS (nt
)));
6918 else if (ARGUMENT_PACK_P (ot
))
6923 if (!ARGUMENT_PACK_P (nt
))
6926 opack
= ARGUMENT_PACK_ARGS (ot
);
6927 npack
= ARGUMENT_PACK_ARGS (nt
);
6928 len
= TREE_VEC_LENGTH (opack
);
6929 if (TREE_VEC_LENGTH (npack
) != len
)
6931 for (i
= 0; i
< len
; ++i
)
6932 if (!template_args_equal (TREE_VEC_ELT (opack
, i
),
6933 TREE_VEC_ELT (npack
, i
)))
6937 else if (ot
&& TREE_CODE (ot
) == ARGUMENT_PACK_SELECT
)
6939 /* We get here probably because we are in the middle of substituting
6940 into the pattern of a pack expansion. In that case the
6941 ARGUMENT_PACK_SELECT temporarily replaces the pack argument we are
6942 interested in. So we want to use the initial pack argument for
6944 ot
= ARGUMENT_PACK_SELECT_FROM_PACK (ot
);
6945 if (nt
&& TREE_CODE (nt
) == ARGUMENT_PACK_SELECT
)
6946 nt
= ARGUMENT_PACK_SELECT_FROM_PACK (nt
);
6947 return template_args_equal (ot
, nt
);
6949 else if (TYPE_P (nt
))
6950 return TYPE_P (ot
) && same_type_p (ot
, nt
);
6951 else if (TREE_CODE (ot
) == TREE_VEC
|| TYPE_P (ot
))
6954 return cp_tree_equal (ot
, nt
);
6957 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets of
6958 template arguments. Returns 0 otherwise, and updates OLDARG_PTR and
6959 NEWARG_PTR with the offending arguments if they are non-NULL. */
6962 comp_template_args_with_info (tree oldargs
, tree newargs
,
6963 tree
*oldarg_ptr
, tree
*newarg_ptr
)
6967 if (oldargs
== newargs
)
6970 if (!oldargs
|| !newargs
)
6973 if (TREE_VEC_LENGTH (oldargs
) != TREE_VEC_LENGTH (newargs
))
6976 for (i
= 0; i
< TREE_VEC_LENGTH (oldargs
); ++i
)
6978 tree nt
= TREE_VEC_ELT (newargs
, i
);
6979 tree ot
= TREE_VEC_ELT (oldargs
, i
);
6981 if (! template_args_equal (ot
, nt
))
6983 if (oldarg_ptr
!= NULL
)
6985 if (newarg_ptr
!= NULL
)
6993 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets
6994 of template arguments. Returns 0 otherwise. */
6997 comp_template_args (tree oldargs
, tree newargs
)
6999 return comp_template_args_with_info (oldargs
, newargs
, NULL
, NULL
);
7003 add_pending_template (tree d
)
7005 tree ti
= (TYPE_P (d
)
7006 ? CLASSTYPE_TEMPLATE_INFO (d
)
7007 : DECL_TEMPLATE_INFO (d
));
7008 struct pending_template
*pt
;
7011 if (TI_PENDING_TEMPLATE_FLAG (ti
))
7014 /* We are called both from instantiate_decl, where we've already had a
7015 tinst_level pushed, and instantiate_template, where we haven't.
7017 level
= !current_tinst_level
|| current_tinst_level
->decl
!= d
;
7020 push_tinst_level (d
);
7022 pt
= ggc_alloc_pending_template ();
7024 pt
->tinst
= current_tinst_level
;
7025 if (last_pending_template
)
7026 last_pending_template
->next
= pt
;
7028 pending_templates
= pt
;
7030 last_pending_template
= pt
;
7032 TI_PENDING_TEMPLATE_FLAG (ti
) = 1;
7039 /* Return a TEMPLATE_ID_EXPR corresponding to the indicated FNS and
7040 ARGLIST. Valid choices for FNS are given in the cp-tree.def
7041 documentation for TEMPLATE_ID_EXPR. */
7044 lookup_template_function (tree fns
, tree arglist
)
7048 if (fns
== error_mark_node
|| arglist
== error_mark_node
)
7049 return error_mark_node
;
7051 gcc_assert (!arglist
|| TREE_CODE (arglist
) == TREE_VEC
);
7053 if (!is_overloaded_fn (fns
) && TREE_CODE (fns
) != IDENTIFIER_NODE
)
7055 error ("%q#D is not a function template", fns
);
7056 return error_mark_node
;
7059 if (BASELINK_P (fns
))
7061 BASELINK_FUNCTIONS (fns
) = build2 (TEMPLATE_ID_EXPR
,
7063 BASELINK_FUNCTIONS (fns
),
7068 type
= TREE_TYPE (fns
);
7069 if (TREE_CODE (fns
) == OVERLOAD
|| !type
)
7070 type
= unknown_type_node
;
7072 return build2 (TEMPLATE_ID_EXPR
, type
, fns
, arglist
);
7075 /* Within the scope of a template class S<T>, the name S gets bound
7076 (in build_self_reference) to a TYPE_DECL for the class, not a
7077 TEMPLATE_DECL. If DECL is a TYPE_DECL for current_class_type,
7078 or one of its enclosing classes, and that type is a template,
7079 return the associated TEMPLATE_DECL. Otherwise, the original
7082 Also handle the case when DECL is a TREE_LIST of ambiguous
7083 injected-class-names from different bases. */
7086 maybe_get_template_decl_from_type_decl (tree decl
)
7088 if (decl
== NULL_TREE
)
7091 /* DR 176: A lookup that finds an injected-class-name (10.2
7092 [class.member.lookup]) can result in an ambiguity in certain cases
7093 (for example, if it is found in more than one base class). If all of
7094 the injected-class-names that are found refer to specializations of
7095 the same class template, and if the name is followed by a
7096 template-argument-list, the reference refers to the class template
7097 itself and not a specialization thereof, and is not ambiguous. */
7098 if (TREE_CODE (decl
) == TREE_LIST
)
7100 tree t
, tmpl
= NULL_TREE
;
7101 for (t
= decl
; t
; t
= TREE_CHAIN (t
))
7103 tree elt
= maybe_get_template_decl_from_type_decl (TREE_VALUE (t
));
7106 else if (tmpl
!= elt
)
7109 if (tmpl
&& t
== NULL_TREE
)
7115 return (decl
!= NULL_TREE
7116 && DECL_SELF_REFERENCE_P (decl
)
7117 && CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (decl
)))
7118 ? CLASSTYPE_TI_TEMPLATE (TREE_TYPE (decl
)) : decl
;
7121 /* Given an IDENTIFIER_NODE (type TEMPLATE_DECL) and a chain of
7122 parameters, find the desired type.
7124 D1 is the PTYPENAME terminal, and ARGLIST is the list of arguments.
7126 IN_DECL, if non-NULL, is the template declaration we are trying to
7129 If ENTERING_SCOPE is nonzero, we are about to enter the scope of
7130 the class we are looking up.
7132 Issue error and warning messages under control of COMPLAIN.
7134 If the template class is really a local class in a template
7135 function, then the FUNCTION_CONTEXT is the function in which it is
7138 ??? Note that this function is currently called *twice* for each
7139 template-id: the first time from the parser, while creating the
7140 incomplete type (finish_template_type), and the second type during the
7141 real instantiation (instantiate_template_class). This is surely something
7142 that we want to avoid. It also causes some problems with argument
7143 coercion (see convert_nontype_argument for more information on this). */
7146 lookup_template_class_1 (tree d1
, tree arglist
, tree in_decl
, tree context
,
7147 int entering_scope
, tsubst_flags_t complain
)
7149 tree templ
= NULL_TREE
, parmlist
;
7156 if (TREE_CODE (d1
) == IDENTIFIER_NODE
)
7158 tree value
= innermost_non_namespace_value (d1
);
7159 if (value
&& DECL_TEMPLATE_TEMPLATE_PARM_P (value
))
7164 push_decl_namespace (context
);
7165 templ
= lookup_name (d1
);
7166 templ
= maybe_get_template_decl_from_type_decl (templ
);
7168 pop_decl_namespace ();
7171 context
= DECL_CONTEXT (templ
);
7173 else if (TREE_CODE (d1
) == TYPE_DECL
&& MAYBE_CLASS_TYPE_P (TREE_TYPE (d1
)))
7175 tree type
= TREE_TYPE (d1
);
7177 /* If we are declaring a constructor, say A<T>::A<T>, we will get
7178 an implicit typename for the second A. Deal with it. */
7179 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
7180 type
= TREE_TYPE (type
);
7182 if (CLASSTYPE_TEMPLATE_INFO (type
))
7184 templ
= CLASSTYPE_TI_TEMPLATE (type
);
7185 d1
= DECL_NAME (templ
);
7188 else if (TREE_CODE (d1
) == ENUMERAL_TYPE
7189 || (TYPE_P (d1
) && MAYBE_CLASS_TYPE_P (d1
)))
7191 templ
= TYPE_TI_TEMPLATE (d1
);
7192 d1
= DECL_NAME (templ
);
7194 else if (TREE_CODE (d1
) == TEMPLATE_DECL
7195 && DECL_TEMPLATE_RESULT (d1
)
7196 && TREE_CODE (DECL_TEMPLATE_RESULT (d1
)) == TYPE_DECL
)
7199 d1
= DECL_NAME (templ
);
7200 context
= DECL_CONTEXT (templ
);
7203 /* Issue an error message if we didn't find a template. */
7206 if (complain
& tf_error
)
7207 error ("%qT is not a template", d1
);
7208 return error_mark_node
;
7211 if (TREE_CODE (templ
) != TEMPLATE_DECL
7212 /* Make sure it's a user visible template, if it was named by
7214 || ((complain
& tf_user
) && !DECL_TEMPLATE_PARM_P (templ
)
7215 && !PRIMARY_TEMPLATE_P (templ
)))
7217 if (complain
& tf_error
)
7219 error ("non-template type %qT used as a template", d1
);
7221 error ("for template declaration %q+D", in_decl
);
7223 return error_mark_node
;
7226 complain
&= ~tf_user
;
7228 if (DECL_TEMPLATE_TEMPLATE_PARM_P (templ
))
7230 /* Create a new TEMPLATE_DECL and TEMPLATE_TEMPLATE_PARM node to store
7231 template arguments */
7237 parmlist
= DECL_INNERMOST_TEMPLATE_PARMS (templ
);
7239 /* Consider an example where a template template parameter declared as
7241 template <class T, class U = std::allocator<T> > class TT
7243 The template parameter level of T and U are one level larger than
7244 of TT. To proper process the default argument of U, say when an
7245 instantiation `TT<int>' is seen, we need to build the full
7246 arguments containing {int} as the innermost level. Outer levels,
7247 available when not appearing as default template argument, can be
7248 obtained from the arguments of the enclosing template.
7250 Suppose that TT is later substituted with std::vector. The above
7251 instantiation is `TT<int, std::allocator<T> >' with TT at
7252 level 1, and T at level 2, while the template arguments at level 1
7253 becomes {std::vector} and the inner level 2 is {int}. */
7255 outer
= DECL_CONTEXT (templ
);
7257 outer
= TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (outer
)));
7258 else if (current_template_parms
)
7259 /* This is an argument of the current template, so we haven't set
7260 DECL_CONTEXT yet. */
7261 outer
= current_template_args ();
7264 arglist
= add_to_template_args (outer
, arglist
);
7266 arglist2
= coerce_template_parms (parmlist
, arglist
, templ
,
7268 /*require_all_args=*/true,
7269 /*use_default_args=*/true);
7270 if (arglist2
== error_mark_node
7271 || (!uses_template_parms (arglist2
)
7272 && check_instantiated_args (templ
, arglist2
, complain
)))
7273 return error_mark_node
;
7275 parm
= bind_template_template_parm (TREE_TYPE (templ
), arglist2
);
7280 tree template_type
= TREE_TYPE (templ
);
7283 tree found
= NULL_TREE
;
7286 int is_dependent_type
;
7287 int use_partial_inst_tmpl
= false;
7289 if (template_type
== error_mark_node
)
7290 /* An error occured while building the template TEMPL, and a
7291 diagnostic has most certainly been emitted for that
7292 already. Let's propagate that error. */
7293 return error_mark_node
;
7295 gen_tmpl
= most_general_template (templ
);
7296 parmlist
= DECL_TEMPLATE_PARMS (gen_tmpl
);
7297 parm_depth
= TMPL_PARMS_DEPTH (parmlist
);
7298 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
7300 if (arg_depth
== 1 && parm_depth
> 1)
7302 /* We've been given an incomplete set of template arguments.
7305 template <class T> struct S1 {
7306 template <class U> struct S2 {};
7307 template <class U> struct S2<U*> {};
7310 we will be called with an ARGLIST of `U*', but the
7311 TEMPLATE will be `template <class T> template
7312 <class U> struct S1<T>::S2'. We must fill in the missing
7315 = add_outermost_template_args (TYPE_TI_ARGS (TREE_TYPE (templ
)),
7317 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
7320 /* Now we should have enough arguments. */
7321 gcc_assert (parm_depth
== arg_depth
);
7323 /* From here on, we're only interested in the most general
7326 /* Calculate the BOUND_ARGS. These will be the args that are
7327 actually tsubst'd into the definition to create the
7331 /* We have multiple levels of arguments to coerce, at once. */
7333 int saved_depth
= TMPL_ARGS_DEPTH (arglist
);
7335 tree bound_args
= make_tree_vec (parm_depth
);
7337 for (i
= saved_depth
,
7338 t
= DECL_TEMPLATE_PARMS (gen_tmpl
);
7339 i
> 0 && t
!= NULL_TREE
;
7340 --i
, t
= TREE_CHAIN (t
))
7343 if (i
== saved_depth
)
7344 a
= coerce_template_parms (TREE_VALUE (t
),
7347 /*require_all_args=*/true,
7348 /*use_default_args=*/true);
7350 /* Outer levels should have already been coerced. */
7351 a
= TMPL_ARGS_LEVEL (arglist
, i
);
7353 /* Don't process further if one of the levels fails. */
7354 if (a
== error_mark_node
)
7356 /* Restore the ARGLIST to its full size. */
7357 TREE_VEC_LENGTH (arglist
) = saved_depth
;
7358 return error_mark_node
;
7361 SET_TMPL_ARGS_LEVEL (bound_args
, i
, a
);
7363 /* We temporarily reduce the length of the ARGLIST so
7364 that coerce_template_parms will see only the arguments
7365 corresponding to the template parameters it is
7367 TREE_VEC_LENGTH (arglist
)--;
7370 /* Restore the ARGLIST to its full size. */
7371 TREE_VEC_LENGTH (arglist
) = saved_depth
;
7373 arglist
= bound_args
;
7377 = coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parmlist
),
7378 INNERMOST_TEMPLATE_ARGS (arglist
),
7381 /*require_all_args=*/true,
7382 /*use_default_args=*/true);
7384 if (arglist
== error_mark_node
)
7385 /* We were unable to bind the arguments. */
7386 return error_mark_node
;
7388 /* In the scope of a template class, explicit references to the
7389 template class refer to the type of the template, not any
7390 instantiation of it. For example, in:
7392 template <class T> class C { void f(C<T>); }
7394 the `C<T>' is just the same as `C'. Outside of the
7395 class, however, such a reference is an instantiation. */
7397 || !PRIMARY_TEMPLATE_P (gen_tmpl
)
7398 || currently_open_class (template_type
))
7399 /* comp_template_args is expensive, check it last. */
7400 && comp_template_args (TYPE_TI_ARGS (template_type
),
7402 return template_type
;
7404 /* If we already have this specialization, return it. */
7405 elt
.tmpl
= gen_tmpl
;
7407 hash
= hash_specialization (&elt
);
7408 entry
= (spec_entry
*) htab_find_with_hash (type_specializations
,
7414 is_dependent_type
= uses_template_parms (arglist
);
7416 /* If the deduced arguments are invalid, then the binding
7418 if (!is_dependent_type
7419 && check_instantiated_args (gen_tmpl
,
7420 INNERMOST_TEMPLATE_ARGS (arglist
),
7422 return error_mark_node
;
7424 if (!is_dependent_type
7425 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
7426 && !LAMBDA_TYPE_P (TREE_TYPE (gen_tmpl
))
7427 && TREE_CODE (CP_DECL_CONTEXT (gen_tmpl
)) == NAMESPACE_DECL
)
7429 found
= xref_tag_from_type (TREE_TYPE (gen_tmpl
),
7430 DECL_NAME (gen_tmpl
),
7431 /*tag_scope=*/ts_global
);
7435 context
= tsubst (DECL_CONTEXT (gen_tmpl
), arglist
,
7438 context
= global_namespace
;
7440 /* Create the type. */
7441 if (TREE_CODE (template_type
) == ENUMERAL_TYPE
)
7443 if (!is_dependent_type
)
7445 set_current_access_from_decl (TYPE_NAME (template_type
));
7446 t
= start_enum (TYPE_IDENTIFIER (template_type
), NULL_TREE
,
7447 tsubst (ENUM_UNDERLYING_TYPE (template_type
),
7448 arglist
, complain
, in_decl
),
7449 SCOPED_ENUM_P (template_type
), NULL
);
7453 /* We don't want to call start_enum for this type, since
7454 the values for the enumeration constants may involve
7455 template parameters. And, no one should be interested
7456 in the enumeration constants for such a type. */
7457 t
= cxx_make_type (ENUMERAL_TYPE
);
7458 SET_SCOPED_ENUM_P (t
, SCOPED_ENUM_P (template_type
));
7460 SET_OPAQUE_ENUM_P (t
, OPAQUE_ENUM_P (template_type
));
7461 ENUM_FIXED_UNDERLYING_TYPE_P (t
)
7462 = ENUM_FIXED_UNDERLYING_TYPE_P (template_type
);
7464 else if (DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
7466 /* The user referred to a specialization of an alias
7467 template represented by GEN_TMPL.
7469 [temp.alias]/2 says:
7471 When a template-id refers to the specialization of an
7472 alias template, it is equivalent to the associated
7473 type obtained by substitution of its
7474 template-arguments for the template-parameters in the
7475 type-id of the alias template. */
7477 t
= tsubst (TREE_TYPE (gen_tmpl
), arglist
, complain
, in_decl
);
7478 /* Note that the call above (by indirectly calling
7479 register_specialization in tsubst_decl) registers the
7480 TYPE_DECL representing the specialization of the alias
7481 template. So next time someone substitutes ARGLIST for
7482 the template parms into the alias template (GEN_TMPL),
7483 she'll get that TYPE_DECL back. */
7485 if (t
== error_mark_node
)
7488 else if (CLASS_TYPE_P (template_type
))
7490 t
= make_class_type (TREE_CODE (template_type
));
7491 CLASSTYPE_DECLARED_CLASS (t
)
7492 = CLASSTYPE_DECLARED_CLASS (template_type
);
7493 SET_CLASSTYPE_IMPLICIT_INSTANTIATION (t
);
7494 TYPE_FOR_JAVA (t
) = TYPE_FOR_JAVA (template_type
);
7496 /* A local class. Make sure the decl gets registered properly. */
7497 if (context
== current_function_decl
)
7498 pushtag (DECL_NAME (gen_tmpl
), t
, /*tag_scope=*/ts_current
);
7500 if (comp_template_args (CLASSTYPE_TI_ARGS (template_type
), arglist
))
7501 /* This instantiation is another name for the primary
7502 template type. Set the TYPE_CANONICAL field
7504 TYPE_CANONICAL (t
) = template_type
;
7505 else if (any_template_arguments_need_structural_equality_p (arglist
))
7506 /* Some of the template arguments require structural
7507 equality testing, so this template class requires
7508 structural equality testing. */
7509 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7514 /* If we called start_enum or pushtag above, this information
7515 will already be set up. */
7518 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
7520 type_decl
= create_implicit_typedef (DECL_NAME (gen_tmpl
), t
);
7521 DECL_CONTEXT (type_decl
) = TYPE_CONTEXT (t
);
7522 DECL_SOURCE_LOCATION (type_decl
)
7523 = DECL_SOURCE_LOCATION (TYPE_STUB_DECL (template_type
));
7526 type_decl
= TYPE_NAME (t
);
7528 if (CLASS_TYPE_P (template_type
))
7530 TREE_PRIVATE (type_decl
)
7531 = TREE_PRIVATE (TYPE_STUB_DECL (template_type
));
7532 TREE_PROTECTED (type_decl
)
7533 = TREE_PROTECTED (TYPE_STUB_DECL (template_type
));
7534 if (CLASSTYPE_VISIBILITY_SPECIFIED (template_type
))
7536 DECL_VISIBILITY_SPECIFIED (type_decl
) = 1;
7537 DECL_VISIBILITY (type_decl
) = CLASSTYPE_VISIBILITY (template_type
);
7541 /* Let's consider the explicit specialization of a member
7542 of a class template specialization that is implicitely instantiated,
7547 template<class U> struct M {}; //#0
7552 struct S<int>::M<char> //#1
7556 [temp.expl.spec]/4 says this is valid.
7558 In this case, when we write:
7561 M is instantiated from the CLASSTYPE_TI_TEMPLATE of #1, not from
7564 When we encounter #1, we want to store the partial instantiation
7565 of M (template<class T> S<int>::M<T>) in it's CLASSTYPE_TI_TEMPLATE.
7567 For all cases other than this "explicit specialization of member of a
7568 class template", we just want to store the most general template into
7569 the CLASSTYPE_TI_TEMPLATE of M.
7571 This case of "explicit specialization of member of a class template"
7573 1/ the enclosing class is an instantiation of, and therefore not
7574 the same as, the context of the most general template, and
7575 2/ we aren't looking at the partial instantiation itself, i.e.
7576 the innermost arguments are not the same as the innermost parms of
7577 the most general template.
7579 So it's only when 1/ and 2/ happens that we want to use the partial
7580 instantiation of the member template in lieu of its most general
7583 if (PRIMARY_TEMPLATE_P (gen_tmpl
)
7584 && TMPL_ARGS_HAVE_MULTIPLE_LEVELS (arglist
)
7585 /* the enclosing class must be an instantiation... */
7586 && CLASS_TYPE_P (context
)
7587 && !same_type_p (context
, DECL_CONTEXT (gen_tmpl
)))
7589 tree partial_inst_args
;
7590 TREE_VEC_LENGTH (arglist
)--;
7591 ++processing_template_decl
;
7593 tsubst (INNERMOST_TEMPLATE_ARGS
7594 (TYPE_TI_ARGS (TREE_TYPE (gen_tmpl
))),
7595 arglist
, complain
, NULL_TREE
);
7596 --processing_template_decl
;
7597 TREE_VEC_LENGTH (arglist
)++;
7598 use_partial_inst_tmpl
=
7599 /*...and we must not be looking at the partial instantiation
7601 !comp_template_args (INNERMOST_TEMPLATE_ARGS (arglist
),
7605 if (!use_partial_inst_tmpl
)
7606 /* This case is easy; there are no member templates involved. */
7610 /* This is a full instantiation of a member template. Find
7611 the partial instantiation of which this is an instance. */
7613 /* Temporarily reduce by one the number of levels in the ARGLIST
7614 so as to avoid comparing the last set of arguments. */
7615 TREE_VEC_LENGTH (arglist
)--;
7616 found
= tsubst (gen_tmpl
, arglist
, complain
, NULL_TREE
);
7617 TREE_VEC_LENGTH (arglist
)++;
7618 /* FOUND is either a proper class type, or an alias
7619 template specialization. In the later case, it's a
7620 TYPE_DECL, resulting from the substituting of arguments
7621 for parameters in the TYPE_DECL of the alias template
7622 done earlier. So be careful while getting the template
7624 found
= TREE_CODE (found
) == TYPE_DECL
7625 ? TYPE_TI_TEMPLATE (TREE_TYPE (found
))
7626 : CLASSTYPE_TI_TEMPLATE (found
);
7629 SET_TYPE_TEMPLATE_INFO (t
, build_template_info (found
, arglist
));
7632 slot
= htab_find_slot_with_hash (type_specializations
,
7633 &elt
, hash
, INSERT
);
7634 entry
= ggc_alloc_spec_entry ();
7638 /* Note this use of the partial instantiation so we can check it
7639 later in maybe_process_partial_specialization. */
7640 DECL_TEMPLATE_INSTANTIATIONS (templ
)
7641 = tree_cons (arglist
, t
,
7642 DECL_TEMPLATE_INSTANTIATIONS (templ
));
7644 if (TREE_CODE (t
) == ENUMERAL_TYPE
&& !is_dependent_type
)
7645 /* Now that the type has been registered on the instantiations
7646 list, we set up the enumerators. Because the enumeration
7647 constants may involve the enumeration type itself, we make
7648 sure to register the type first, and then create the
7649 constants. That way, doing tsubst_expr for the enumeration
7650 constants won't result in recursive calls here; we'll find
7651 the instantiation and exit above. */
7652 tsubst_enum (template_type
, t
, arglist
);
7654 if (CLASS_TYPE_P (template_type
) && is_dependent_type
)
7655 /* If the type makes use of template parameters, the
7656 code that generates debugging information will crash. */
7657 DECL_IGNORED_P (TYPE_STUB_DECL (t
)) = 1;
7659 /* Possibly limit visibility based on template args. */
7660 TREE_PUBLIC (type_decl
) = 1;
7661 determine_visibility (type_decl
);
7667 /* Wrapper for lookup_template_class_1. */
7670 lookup_template_class (tree d1
, tree arglist
, tree in_decl
, tree context
,
7671 int entering_scope
, tsubst_flags_t complain
)
7674 timevar_push (TV_TEMPLATE_INST
);
7675 ret
= lookup_template_class_1 (d1
, arglist
, in_decl
, context
,
7676 entering_scope
, complain
);
7677 timevar_pop (TV_TEMPLATE_INST
);
7685 /* True when we should also visit template parameters that occur in
7686 non-deduced contexts. */
7687 bool include_nondeduced_p
;
7688 struct pointer_set_t
*visited
;
7691 /* Called from for_each_template_parm via walk_tree. */
7694 for_each_template_parm_r (tree
*tp
, int *walk_subtrees
, void *d
)
7697 struct pair_fn_data
*pfd
= (struct pair_fn_data
*) d
;
7698 tree_fn_t fn
= pfd
->fn
;
7699 void *data
= pfd
->data
;
7702 && (pfd
->include_nondeduced_p
|| TREE_CODE (t
) != TYPENAME_TYPE
)
7703 && for_each_template_parm (TYPE_CONTEXT (t
), fn
, data
, pfd
->visited
,
7704 pfd
->include_nondeduced_p
))
7705 return error_mark_node
;
7707 switch (TREE_CODE (t
))
7710 if (TYPE_PTRMEMFUNC_P (t
))
7716 if (!TYPE_TEMPLATE_INFO (t
))
7718 else if (for_each_template_parm (TI_ARGS (TYPE_TEMPLATE_INFO (t
)),
7719 fn
, data
, pfd
->visited
,
7720 pfd
->include_nondeduced_p
))
7721 return error_mark_node
;
7725 if (for_each_template_parm (TYPE_MIN_VALUE (t
),
7726 fn
, data
, pfd
->visited
,
7727 pfd
->include_nondeduced_p
)
7728 || for_each_template_parm (TYPE_MAX_VALUE (t
),
7729 fn
, data
, pfd
->visited
,
7730 pfd
->include_nondeduced_p
))
7731 return error_mark_node
;
7735 /* Since we're not going to walk subtrees, we have to do this
7737 if (for_each_template_parm (TYPE_METHOD_BASETYPE (t
), fn
, data
,
7738 pfd
->visited
, pfd
->include_nondeduced_p
))
7739 return error_mark_node
;
7743 /* Check the return type. */
7744 if (for_each_template_parm (TREE_TYPE (t
), fn
, data
, pfd
->visited
,
7745 pfd
->include_nondeduced_p
))
7746 return error_mark_node
;
7748 /* Check the parameter types. Since default arguments are not
7749 instantiated until they are needed, the TYPE_ARG_TYPES may
7750 contain expressions that involve template parameters. But,
7751 no-one should be looking at them yet. And, once they're
7752 instantiated, they don't contain template parameters, so
7753 there's no point in looking at them then, either. */
7757 for (parm
= TYPE_ARG_TYPES (t
); parm
; parm
= TREE_CHAIN (parm
))
7758 if (for_each_template_parm (TREE_VALUE (parm
), fn
, data
,
7759 pfd
->visited
, pfd
->include_nondeduced_p
))
7760 return error_mark_node
;
7762 /* Since we've already handled the TYPE_ARG_TYPES, we don't
7763 want walk_tree walking into them itself. */
7769 case UNDERLYING_TYPE
:
7770 if (pfd
->include_nondeduced_p
7771 && for_each_template_parm (TYPE_FIELDS (t
), fn
, data
,
7773 pfd
->include_nondeduced_p
))
7774 return error_mark_node
;
7779 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
)
7780 && for_each_template_parm (DECL_TI_ARGS (t
), fn
, data
,
7781 pfd
->visited
, pfd
->include_nondeduced_p
))
7782 return error_mark_node
;
7787 if (TREE_CODE (t
) == CONST_DECL
&& DECL_TEMPLATE_PARM_P (t
)
7788 && for_each_template_parm (DECL_INITIAL (t
), fn
, data
,
7789 pfd
->visited
, pfd
->include_nondeduced_p
))
7790 return error_mark_node
;
7791 if (DECL_CONTEXT (t
)
7792 && pfd
->include_nondeduced_p
7793 && for_each_template_parm (DECL_CONTEXT (t
), fn
, data
,
7794 pfd
->visited
, pfd
->include_nondeduced_p
))
7795 return error_mark_node
;
7798 case BOUND_TEMPLATE_TEMPLATE_PARM
:
7799 /* Record template parameters such as `T' inside `TT<T>'. */
7800 if (for_each_template_parm (TYPE_TI_ARGS (t
), fn
, data
, pfd
->visited
,
7801 pfd
->include_nondeduced_p
))
7802 return error_mark_node
;
7805 case TEMPLATE_TEMPLATE_PARM
:
7806 case TEMPLATE_TYPE_PARM
:
7807 case TEMPLATE_PARM_INDEX
:
7808 if (fn
&& (*fn
)(t
, data
))
7809 return error_mark_node
;
7811 return error_mark_node
;
7815 /* A template template parameter is encountered. */
7816 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
)
7817 && for_each_template_parm (TREE_TYPE (t
), fn
, data
, pfd
->visited
,
7818 pfd
->include_nondeduced_p
))
7819 return error_mark_node
;
7821 /* Already substituted template template parameter */
7827 || for_each_template_parm (TYPENAME_TYPE_FULLNAME (t
), fn
,
7829 pfd
->include_nondeduced_p
))
7830 return error_mark_node
;
7834 if (TREE_TYPE (t
) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t
))
7835 && pfd
->include_nondeduced_p
7836 && for_each_template_parm (TYPE_PTRMEMFUNC_FN_TYPE
7837 (TREE_TYPE (t
)), fn
, data
,
7838 pfd
->visited
, pfd
->include_nondeduced_p
))
7839 return error_mark_node
;
7844 /* If there's no type, then this thing must be some expression
7845 involving template parameters. */
7846 if (!fn
&& !TREE_TYPE (t
))
7847 return error_mark_node
;
7852 case IMPLICIT_CONV_EXPR
:
7853 case REINTERPRET_CAST_EXPR
:
7854 case CONST_CAST_EXPR
:
7855 case STATIC_CAST_EXPR
:
7856 case DYNAMIC_CAST_EXPR
:
7860 case PSEUDO_DTOR_EXPR
:
7862 return error_mark_node
;
7869 /* We didn't find any template parameters we liked. */
7873 /* For each TEMPLATE_TYPE_PARM, TEMPLATE_TEMPLATE_PARM,
7874 BOUND_TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX in T,
7875 call FN with the parameter and the DATA.
7876 If FN returns nonzero, the iteration is terminated, and
7877 for_each_template_parm returns 1. Otherwise, the iteration
7878 continues. If FN never returns a nonzero value, the value
7879 returned by for_each_template_parm is 0. If FN is NULL, it is
7880 considered to be the function which always returns 1.
7882 If INCLUDE_NONDEDUCED_P, then this routine will also visit template
7883 parameters that occur in non-deduced contexts. When false, only
7884 visits those template parameters that can be deduced. */
7887 for_each_template_parm (tree t
, tree_fn_t fn
, void* data
,
7888 struct pointer_set_t
*visited
,
7889 bool include_nondeduced_p
)
7891 struct pair_fn_data pfd
;
7897 pfd
.include_nondeduced_p
= include_nondeduced_p
;
7899 /* Walk the tree. (Conceptually, we would like to walk without
7900 duplicates, but for_each_template_parm_r recursively calls
7901 for_each_template_parm, so we would need to reorganize a fair
7902 bit to use walk_tree_without_duplicates, so we keep our own
7905 pfd
.visited
= visited
;
7907 pfd
.visited
= pointer_set_create ();
7908 result
= cp_walk_tree (&t
,
7909 for_each_template_parm_r
,
7911 pfd
.visited
) != NULL_TREE
;
7916 pointer_set_destroy (pfd
.visited
);
7923 /* Returns true if T depends on any template parameter. */
7926 uses_template_parms (tree t
)
7929 int saved_processing_template_decl
;
7931 saved_processing_template_decl
= processing_template_decl
;
7932 if (!saved_processing_template_decl
)
7933 processing_template_decl
= 1;
7935 dependent_p
= dependent_type_p (t
);
7936 else if (TREE_CODE (t
) == TREE_VEC
)
7937 dependent_p
= any_dependent_template_arguments_p (t
);
7938 else if (TREE_CODE (t
) == TREE_LIST
)
7939 dependent_p
= (uses_template_parms (TREE_VALUE (t
))
7940 || uses_template_parms (TREE_CHAIN (t
)));
7941 else if (TREE_CODE (t
) == TYPE_DECL
)
7942 dependent_p
= dependent_type_p (TREE_TYPE (t
));
7945 || TREE_CODE (t
) == TEMPLATE_PARM_INDEX
7946 || TREE_CODE (t
) == OVERLOAD
7948 || TREE_CODE (t
) == IDENTIFIER_NODE
7949 || TREE_CODE (t
) == TRAIT_EXPR
7950 || TREE_CODE (t
) == CONSTRUCTOR
7951 || CONSTANT_CLASS_P (t
))
7952 dependent_p
= (type_dependent_expression_p (t
)
7953 || value_dependent_expression_p (t
));
7956 gcc_assert (t
== error_mark_node
);
7957 dependent_p
= false;
7960 processing_template_decl
= saved_processing_template_decl
;
7965 /* Returns true if T depends on any template parameter with level LEVEL. */
7968 uses_template_parms_level (tree t
, int level
)
7970 return for_each_template_parm (t
, template_parm_this_level_p
, &level
, NULL
,
7971 /*include_nondeduced_p=*/true);
7974 /* Returns TRUE iff INST is an instantiation we don't need to do in an
7975 ill-formed translation unit, i.e. a variable or function that isn't
7976 usable in a constant expression. */
7979 neglectable_inst_p (tree d
)
7982 && !(TREE_CODE (d
) == FUNCTION_DECL
? DECL_DECLARED_CONSTEXPR_P (d
)
7983 : decl_maybe_constant_var_p (d
)));
7986 /* Returns TRUE iff we should refuse to instantiate DECL because it's
7987 neglectable and instantiated from within an erroneous instantiation. */
7990 limit_bad_template_recursion (tree decl
)
7992 struct tinst_level
*lev
= current_tinst_level
;
7993 int errs
= errorcount
+ sorrycount
;
7994 if (lev
== NULL
|| errs
== 0 || !neglectable_inst_p (decl
))
7997 for (; lev
; lev
= lev
->next
)
7998 if (neglectable_inst_p (lev
->decl
))
8001 return (lev
&& errs
> lev
->errors
);
8004 static int tinst_depth
;
8005 extern int max_tinst_depth
;
8006 #ifdef GATHER_STATISTICS
8009 static GTY(()) struct tinst_level
*last_error_tinst_level
;
8011 /* We're starting to instantiate D; record the template instantiation context
8012 for diagnostics and to restore it later. */
8015 push_tinst_level (tree d
)
8017 struct tinst_level
*new_level
;
8019 if (tinst_depth
>= max_tinst_depth
)
8021 last_error_tinst_level
= current_tinst_level
;
8022 if (TREE_CODE (d
) == TREE_LIST
)
8023 error ("template instantiation depth exceeds maximum of %d (use "
8024 "-ftemplate-depth= to increase the maximum) substituting %qS",
8025 max_tinst_depth
, d
);
8027 error ("template instantiation depth exceeds maximum of %d (use "
8028 "-ftemplate-depth= to increase the maximum) instantiating %qD",
8029 max_tinst_depth
, d
);
8031 print_instantiation_context ();
8036 /* If the current instantiation caused problems, don't let it instantiate
8037 anything else. Do allow deduction substitution and decls usable in
8038 constant expressions. */
8039 if (limit_bad_template_recursion (d
))
8042 new_level
= ggc_alloc_tinst_level ();
8043 new_level
->decl
= d
;
8044 new_level
->locus
= input_location
;
8045 new_level
->errors
= errorcount
+sorrycount
;
8046 new_level
->in_system_header_p
= in_system_header
;
8047 new_level
->next
= current_tinst_level
;
8048 current_tinst_level
= new_level
;
8051 #ifdef GATHER_STATISTICS
8052 if (tinst_depth
> depth_reached
)
8053 depth_reached
= tinst_depth
;
8059 /* We're done instantiating this template; return to the instantiation
8063 pop_tinst_level (void)
8065 /* Restore the filename and line number stashed away when we started
8066 this instantiation. */
8067 input_location
= current_tinst_level
->locus
;
8068 current_tinst_level
= current_tinst_level
->next
;
8072 /* We're instantiating a deferred template; restore the template
8073 instantiation context in which the instantiation was requested, which
8074 is one step out from LEVEL. Return the corresponding DECL or TYPE. */
8077 reopen_tinst_level (struct tinst_level
*level
)
8079 struct tinst_level
*t
;
8082 for (t
= level
; t
; t
= t
->next
)
8085 current_tinst_level
= level
;
8087 if (current_tinst_level
)
8088 current_tinst_level
->errors
= errorcount
+sorrycount
;
8092 /* Returns the TINST_LEVEL which gives the original instantiation
8095 struct tinst_level
*
8096 outermost_tinst_level (void)
8098 struct tinst_level
*level
= current_tinst_level
;
8101 level
= level
->next
;
8105 /* Returns TRUE if PARM is a parameter of the template TEMPL. */
8108 parameter_of_template_p (tree parm
, tree templ
)
8113 if (!parm
|| !templ
)
8116 gcc_assert (DECL_TEMPLATE_PARM_P (parm
));
8117 gcc_assert (TREE_CODE (templ
) == TEMPLATE_DECL
);
8119 parms
= DECL_TEMPLATE_PARMS (templ
);
8120 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
8122 for (i
= 0; i
< TREE_VEC_LENGTH (parms
); ++i
)
8124 tree p
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
8126 || (DECL_INITIAL (parm
)
8127 && DECL_INITIAL (parm
) == DECL_INITIAL (p
)))
8134 /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the
8135 vector of template arguments, as for tsubst.
8137 Returns an appropriate tsubst'd friend declaration. */
8140 tsubst_friend_function (tree decl
, tree args
)
8144 if (TREE_CODE (decl
) == FUNCTION_DECL
8145 && DECL_TEMPLATE_INSTANTIATION (decl
)
8146 && TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
8147 /* This was a friend declared with an explicit template
8148 argument list, e.g.:
8152 to indicate that f was a template instantiation, not a new
8153 function declaration. Now, we have to figure out what
8154 instantiation of what template. */
8156 tree template_id
, arglist
, fns
;
8159 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (current_class_type
));
8161 /* Friend functions are looked up in the containing namespace scope.
8162 We must enter that scope, to avoid finding member functions of the
8163 current class with same name. */
8164 push_nested_namespace (ns
);
8165 fns
= tsubst_expr (DECL_TI_TEMPLATE (decl
), args
,
8166 tf_warning_or_error
, NULL_TREE
,
8167 /*integral_constant_expression_p=*/false);
8168 pop_nested_namespace (ns
);
8169 arglist
= tsubst (DECL_TI_ARGS (decl
), args
,
8170 tf_warning_or_error
, NULL_TREE
);
8171 template_id
= lookup_template_function (fns
, arglist
);
8173 new_friend
= tsubst (decl
, args
, tf_warning_or_error
, NULL_TREE
);
8174 tmpl
= determine_specialization (template_id
, new_friend
,
8176 /*need_member_template=*/0,
8177 TREE_VEC_LENGTH (args
),
8179 return instantiate_template (tmpl
, new_args
, tf_error
);
8182 new_friend
= tsubst (decl
, args
, tf_warning_or_error
, NULL_TREE
);
8184 /* The NEW_FRIEND will look like an instantiation, to the
8185 compiler, but is not an instantiation from the point of view of
8186 the language. For example, we might have had:
8188 template <class T> struct S {
8189 template <class U> friend void f(T, U);
8192 Then, in S<int>, template <class U> void f(int, U) is not an
8193 instantiation of anything. */
8194 if (new_friend
== error_mark_node
)
8195 return error_mark_node
;
8197 DECL_USE_TEMPLATE (new_friend
) = 0;
8198 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
8200 DECL_USE_TEMPLATE (DECL_TEMPLATE_RESULT (new_friend
)) = 0;
8201 DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (new_friend
))
8202 = DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (decl
));
8205 /* The mangled name for the NEW_FRIEND is incorrect. The function
8206 is not a template instantiation and should not be mangled like
8207 one. Therefore, we forget the mangling here; we'll recompute it
8208 later if we need it. */
8209 if (TREE_CODE (new_friend
) != TEMPLATE_DECL
)
8211 SET_DECL_RTL (new_friend
, NULL
);
8212 SET_DECL_ASSEMBLER_NAME (new_friend
, NULL_TREE
);
8215 if (DECL_NAMESPACE_SCOPE_P (new_friend
))
8218 tree new_friend_template_info
;
8219 tree new_friend_result_template_info
;
8221 int new_friend_is_defn
;
8223 /* We must save some information from NEW_FRIEND before calling
8224 duplicate decls since that function will free NEW_FRIEND if
8226 new_friend_template_info
= DECL_TEMPLATE_INFO (new_friend
);
8227 new_friend_is_defn
=
8228 (DECL_INITIAL (DECL_TEMPLATE_RESULT
8229 (template_for_substitution (new_friend
)))
8231 if (TREE_CODE (new_friend
) == TEMPLATE_DECL
)
8233 /* This declaration is a `primary' template. */
8234 DECL_PRIMARY_TEMPLATE (new_friend
) = new_friend
;
8236 new_friend_result_template_info
8237 = DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (new_friend
));
8240 new_friend_result_template_info
= NULL_TREE
;
8242 /* Make the init_value nonzero so pushdecl knows this is a defn. */
8243 if (new_friend_is_defn
)
8244 DECL_INITIAL (new_friend
) = error_mark_node
;
8246 /* Inside pushdecl_namespace_level, we will push into the
8247 current namespace. However, the friend function should go
8248 into the namespace of the template. */
8249 ns
= decl_namespace_context (new_friend
);
8250 push_nested_namespace (ns
);
8251 old_decl
= pushdecl_namespace_level (new_friend
, /*is_friend=*/true);
8252 pop_nested_namespace (ns
);
8254 if (old_decl
== error_mark_node
)
8255 return error_mark_node
;
8257 if (old_decl
!= new_friend
)
8259 /* This new friend declaration matched an existing
8260 declaration. For example, given:
8262 template <class T> void f(T);
8263 template <class U> class C {
8264 template <class T> friend void f(T) {}
8267 the friend declaration actually provides the definition
8268 of `f', once C has been instantiated for some type. So,
8269 old_decl will be the out-of-class template declaration,
8270 while new_friend is the in-class definition.
8272 But, if `f' was called before this point, the
8273 instantiation of `f' will have DECL_TI_ARGS corresponding
8274 to `T' but not to `U', references to which might appear
8275 in the definition of `f'. Previously, the most general
8276 template for an instantiation of `f' was the out-of-class
8277 version; now it is the in-class version. Therefore, we
8278 run through all specialization of `f', adding to their
8279 DECL_TI_ARGS appropriately. In particular, they need a
8280 new set of outer arguments, corresponding to the
8281 arguments for this class instantiation.
8283 The same situation can arise with something like this:
8286 template <class T> class C {
8290 when `C<int>' is instantiated. Now, `f(int)' is defined
8293 if (!new_friend_is_defn
)
8294 /* On the other hand, if the in-class declaration does
8295 *not* provide a definition, then we don't want to alter
8296 existing definitions. We can just leave everything
8301 tree new_template
= TI_TEMPLATE (new_friend_template_info
);
8302 tree new_args
= TI_ARGS (new_friend_template_info
);
8304 /* Overwrite whatever template info was there before, if
8305 any, with the new template information pertaining to
8307 DECL_TEMPLATE_INFO (old_decl
) = new_friend_template_info
;
8309 if (TREE_CODE (old_decl
) != TEMPLATE_DECL
)
8311 /* We should have called reregister_specialization in
8313 gcc_assert (retrieve_specialization (new_template
,
8317 /* Instantiate it if the global has already been used. */
8318 if (DECL_ODR_USED (old_decl
))
8319 instantiate_decl (old_decl
, /*defer_ok=*/true,
8320 /*expl_inst_class_mem_p=*/false);
8326 /* Indicate that the old function template is a partial
8328 DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (old_decl
))
8329 = new_friend_result_template_info
;
8331 gcc_assert (new_template
8332 == most_general_template (new_template
));
8333 gcc_assert (new_template
!= old_decl
);
8335 /* Reassign any specializations already in the hash table
8336 to the new more general template, and add the
8337 additional template args. */
8338 for (t
= DECL_TEMPLATE_INSTANTIATIONS (old_decl
);
8342 tree spec
= TREE_VALUE (t
);
8345 elt
.tmpl
= old_decl
;
8346 elt
.args
= DECL_TI_ARGS (spec
);
8347 elt
.spec
= NULL_TREE
;
8349 htab_remove_elt (decl_specializations
, &elt
);
8352 = add_outermost_template_args (new_args
,
8353 DECL_TI_ARGS (spec
));
8355 register_specialization
8356 (spec
, new_template
, DECL_TI_ARGS (spec
), true, 0);
8359 DECL_TEMPLATE_INSTANTIATIONS (old_decl
) = NULL_TREE
;
8363 /* The information from NEW_FRIEND has been merged into OLD_DECL
8364 by duplicate_decls. */
8365 new_friend
= old_decl
;
8370 tree context
= DECL_CONTEXT (new_friend
);
8374 template <class T> class C {
8375 template <class U> friend void C1<U>::f (); // case 1
8376 friend void C2<T>::f (); // case 2
8378 we only need to make sure CONTEXT is a complete type for
8379 case 2. To distinguish between the two cases, we note that
8380 CONTEXT of case 1 remains dependent type after tsubst while
8381 this isn't true for case 2. */
8382 ++processing_template_decl
;
8383 dependent_p
= dependent_type_p (context
);
8384 --processing_template_decl
;
8387 && !complete_type_or_else (context
, NULL_TREE
))
8388 return error_mark_node
;
8390 if (COMPLETE_TYPE_P (context
))
8392 /* Check to see that the declaration is really present, and,
8393 possibly obtain an improved declaration. */
8394 tree fn
= check_classfn (context
,
8395 new_friend
, NULL_TREE
);
8405 /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of
8406 template arguments, as for tsubst.
8408 Returns an appropriate tsubst'd friend type or error_mark_node on
8412 tsubst_friend_class (tree friend_tmpl
, tree args
)
8418 context
= CP_DECL_CONTEXT (friend_tmpl
);
8420 if (context
!= global_namespace
)
8422 if (TREE_CODE (context
) == NAMESPACE_DECL
)
8423 push_nested_namespace (context
);
8425 push_nested_class (tsubst (context
, args
, tf_none
, NULL_TREE
));
8428 /* Look for a class template declaration. We look for hidden names
8429 because two friend declarations of the same template are the
8430 same. For example, in:
8433 template <typename> friend class F;
8435 template <typename> struct B {
8436 template <typename> friend class F;
8439 both F templates are the same. */
8440 tmpl
= lookup_name_real (DECL_NAME (friend_tmpl
), 0, 0,
8441 /*block_p=*/true, 0,
8442 LOOKUP_COMPLAIN
| LOOKUP_HIDDEN
);
8444 /* But, if we don't find one, it might be because we're in a
8445 situation like this:
8453 Here, in the scope of (say) S<int>, `S' is bound to a TYPE_DECL
8454 for `S<int>', not the TEMPLATE_DECL. */
8455 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
8457 tmpl
= lookup_name_prefer_type (DECL_NAME (friend_tmpl
), 1);
8458 tmpl
= maybe_get_template_decl_from_type_decl (tmpl
);
8461 if (tmpl
&& DECL_CLASS_TEMPLATE_P (tmpl
))
8463 /* The friend template has already been declared. Just
8464 check to see that the declarations match, and install any new
8465 default parameters. We must tsubst the default parameters,
8466 of course. We only need the innermost template parameters
8467 because that is all that redeclare_class_template will look
8469 if (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (friend_tmpl
))
8470 > TMPL_ARGS_DEPTH (args
))
8473 location_t saved_input_location
;
8474 parms
= tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_tmpl
),
8475 args
, tf_warning_or_error
);
8477 saved_input_location
= input_location
;
8478 input_location
= DECL_SOURCE_LOCATION (friend_tmpl
);
8479 redeclare_class_template (TREE_TYPE (tmpl
), parms
);
8480 input_location
= saved_input_location
;
8484 friend_type
= TREE_TYPE (tmpl
);
8488 /* The friend template has not already been declared. In this
8489 case, the instantiation of the template class will cause the
8490 injection of this template into the global scope. */
8491 tmpl
= tsubst (friend_tmpl
, args
, tf_warning_or_error
, NULL_TREE
);
8492 if (tmpl
== error_mark_node
)
8493 return error_mark_node
;
8495 /* The new TMPL is not an instantiation of anything, so we
8496 forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE for
8497 the new type because that is supposed to be the corresponding
8498 template decl, i.e., TMPL. */
8499 DECL_USE_TEMPLATE (tmpl
) = 0;
8500 DECL_TEMPLATE_INFO (tmpl
) = NULL_TREE
;
8501 CLASSTYPE_USE_TEMPLATE (TREE_TYPE (tmpl
)) = 0;
8502 CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl
))
8503 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl
)));
8505 /* Inject this template into the global scope. */
8506 friend_type
= TREE_TYPE (pushdecl_top_level_maybe_friend (tmpl
, true));
8509 if (context
!= global_namespace
)
8511 if (TREE_CODE (context
) == NAMESPACE_DECL
)
8512 pop_nested_namespace (context
);
8514 pop_nested_class ();
8520 /* Returns zero if TYPE cannot be completed later due to circularity.
8521 Otherwise returns one. */
8524 can_complete_type_without_circularity (tree type
)
8526 if (type
== NULL_TREE
|| type
== error_mark_node
)
8528 else if (COMPLETE_TYPE_P (type
))
8530 else if (TREE_CODE (type
) == ARRAY_TYPE
&& TYPE_DOMAIN (type
))
8531 return can_complete_type_without_circularity (TREE_TYPE (type
));
8532 else if (CLASS_TYPE_P (type
)
8533 && TYPE_BEING_DEFINED (TYPE_MAIN_VARIANT (type
)))
8539 /* Apply any attributes which had to be deferred until instantiation
8540 time. DECL_P, ATTRIBUTES and ATTR_FLAGS are as cplus_decl_attributes;
8541 ARGS, COMPLAIN, IN_DECL are as tsubst. */
8544 apply_late_template_attributes (tree
*decl_p
, tree attributes
, int attr_flags
,
8545 tree args
, tsubst_flags_t complain
, tree in_decl
)
8547 tree last_dep
= NULL_TREE
;
8551 for (t
= attributes
; t
; t
= TREE_CHAIN (t
))
8552 if (ATTR_IS_DEPENDENT (t
))
8555 attributes
= copy_list (attributes
);
8559 if (DECL_P (*decl_p
))
8561 if (TREE_TYPE (*decl_p
) == error_mark_node
)
8563 p
= &DECL_ATTRIBUTES (*decl_p
);
8566 p
= &TYPE_ATTRIBUTES (*decl_p
);
8570 tree late_attrs
= NULL_TREE
;
8571 tree
*q
= &late_attrs
;
8573 for (*p
= attributes
; *p
; )
8576 if (ATTR_IS_DEPENDENT (t
))
8578 *p
= TREE_CHAIN (t
);
8579 TREE_CHAIN (t
) = NULL_TREE
;
8580 /* If the first attribute argument is an identifier, don't
8581 pass it through tsubst. Attributes like mode, format,
8582 cleanup and several target specific attributes expect it
8585 && TREE_CODE (TREE_VALUE (t
)) == TREE_LIST
8586 && TREE_VALUE (TREE_VALUE (t
))
8587 && (TREE_CODE (TREE_VALUE (TREE_VALUE (t
)))
8588 == IDENTIFIER_NODE
))
8591 = tsubst_expr (TREE_CHAIN (TREE_VALUE (t
)), args
, complain
,
8593 /*integral_constant_expression_p=*/false);
8594 if (chain
!= TREE_CHAIN (TREE_VALUE (t
)))
8596 = tree_cons (NULL_TREE
, TREE_VALUE (TREE_VALUE (t
)),
8601 = tsubst_expr (TREE_VALUE (t
), args
, complain
, in_decl
,
8602 /*integral_constant_expression_p=*/false);
8604 q
= &TREE_CHAIN (t
);
8607 p
= &TREE_CHAIN (t
);
8610 cplus_decl_attributes (decl_p
, late_attrs
, attr_flags
);
8614 /* Perform (or defer) access check for typedefs that were referenced
8615 from within the template TMPL code.
8616 This is a subroutine of instantiate_template and instantiate_class_template.
8617 TMPL is the template to consider and TARGS is the list of arguments of
8621 perform_typedefs_access_check (tree tmpl
, tree targs
)
8623 location_t saved_location
;
8625 qualified_typedef_usage_t
*iter
;
8628 || (!CLASS_TYPE_P (tmpl
)
8629 && TREE_CODE (tmpl
) != FUNCTION_DECL
))
8632 saved_location
= input_location
;
8633 FOR_EACH_VEC_ELT (qualified_typedef_usage_t
,
8634 get_types_needing_access_check (tmpl
),
8637 tree type_decl
= iter
->typedef_decl
;
8638 tree type_scope
= iter
->context
;
8640 if (!type_decl
|| !type_scope
|| !CLASS_TYPE_P (type_scope
))
8643 if (uses_template_parms (type_decl
))
8644 type_decl
= tsubst (type_decl
, targs
, tf_error
, NULL_TREE
);
8645 if (uses_template_parms (type_scope
))
8646 type_scope
= tsubst (type_scope
, targs
, tf_error
, NULL_TREE
);
8648 /* Make access check error messages point to the location
8649 of the use of the typedef. */
8650 input_location
= iter
->locus
;
8651 perform_or_defer_access_check (TYPE_BINFO (type_scope
),
8652 type_decl
, type_decl
);
8654 input_location
= saved_location
;
8658 instantiate_class_template_1 (tree type
)
8660 tree templ
, args
, pattern
, t
, member
;
8664 unsigned int saved_maximum_field_alignment
;
8666 if (type
== error_mark_node
)
8667 return error_mark_node
;
8669 if (COMPLETE_OR_OPEN_TYPE_P (type
)
8670 || uses_template_parms (type
))
8673 /* Figure out which template is being instantiated. */
8674 templ
= most_general_template (CLASSTYPE_TI_TEMPLATE (type
));
8675 gcc_assert (TREE_CODE (templ
) == TEMPLATE_DECL
);
8677 /* Determine what specialization of the original template to
8679 t
= most_specialized_class (type
, templ
, tf_warning_or_error
);
8680 if (t
== error_mark_node
)
8682 TYPE_BEING_DEFINED (type
) = 1;
8683 return error_mark_node
;
8687 /* This TYPE is actually an instantiation of a partial
8688 specialization. We replace the innermost set of ARGS with
8689 the arguments appropriate for substitution. For example,
8692 template <class T> struct S {};
8693 template <class T> struct S<T*> {};
8695 and supposing that we are instantiating S<int*>, ARGS will
8696 presently be {int*} -- but we need {int}. */
8697 pattern
= TREE_TYPE (t
);
8698 args
= TREE_PURPOSE (t
);
8702 pattern
= TREE_TYPE (templ
);
8703 args
= CLASSTYPE_TI_ARGS (type
);
8706 /* If the template we're instantiating is incomplete, then clearly
8707 there's nothing we can do. */
8708 if (!COMPLETE_TYPE_P (pattern
))
8711 /* If we've recursively instantiated too many templates, stop. */
8712 if (! push_tinst_level (type
))
8715 /* Now we're really doing the instantiation. Mark the type as in
8716 the process of being defined. */
8717 TYPE_BEING_DEFINED (type
) = 1;
8719 /* We may be in the middle of deferred access check. Disable
8721 push_deferring_access_checks (dk_no_deferred
);
8723 push_to_top_level ();
8724 /* Use #pragma pack from the template context. */
8725 saved_maximum_field_alignment
= maximum_field_alignment
;
8726 maximum_field_alignment
= TYPE_PRECISION (pattern
);
8728 SET_CLASSTYPE_INTERFACE_UNKNOWN (type
);
8730 /* Set the input location to the most specialized template definition.
8731 This is needed if tsubsting causes an error. */
8732 typedecl
= TYPE_MAIN_DECL (pattern
);
8733 input_location
= DECL_SOURCE_LOCATION (TYPE_NAME (type
)) =
8734 DECL_SOURCE_LOCATION (typedecl
);
8736 TYPE_PACKED (type
) = TYPE_PACKED (pattern
);
8737 TYPE_ALIGN (type
) = TYPE_ALIGN (pattern
);
8738 TYPE_USER_ALIGN (type
) = TYPE_USER_ALIGN (pattern
);
8739 TYPE_FOR_JAVA (type
) = TYPE_FOR_JAVA (pattern
); /* For libjava's JArray<T> */
8740 if (ANON_AGGR_TYPE_P (pattern
))
8741 SET_ANON_AGGR_TYPE_P (type
);
8742 if (CLASSTYPE_VISIBILITY_SPECIFIED (pattern
))
8744 CLASSTYPE_VISIBILITY_SPECIFIED (type
) = 1;
8745 CLASSTYPE_VISIBILITY (type
) = CLASSTYPE_VISIBILITY (pattern
);
8746 /* Adjust visibility for template arguments. */
8747 determine_visibility (TYPE_MAIN_DECL (type
));
8749 CLASSTYPE_FINAL (type
) = CLASSTYPE_FINAL (pattern
);
8751 pbinfo
= TYPE_BINFO (pattern
);
8753 /* We should never instantiate a nested class before its enclosing
8754 class; we need to look up the nested class by name before we can
8755 instantiate it, and that lookup should instantiate the enclosing
8757 gcc_assert (!DECL_CLASS_SCOPE_P (TYPE_MAIN_DECL (pattern
))
8758 || COMPLETE_OR_OPEN_TYPE_P (TYPE_CONTEXT (type
)));
8760 base_list
= NULL_TREE
;
8761 if (BINFO_N_BASE_BINFOS (pbinfo
))
8767 /* We must enter the scope containing the type, as that is where
8768 the accessibility of types named in dependent bases are
8770 pushed_scope
= push_scope (CP_TYPE_CONTEXT (type
));
8772 /* Substitute into each of the bases to determine the actual
8774 for (i
= 0; BINFO_BASE_ITERATE (pbinfo
, i
, pbase_binfo
); i
++)
8777 tree access
= BINFO_BASE_ACCESS (pbinfo
, i
);
8778 tree expanded_bases
= NULL_TREE
;
8781 if (PACK_EXPANSION_P (BINFO_TYPE (pbase_binfo
)))
8784 tsubst_pack_expansion (BINFO_TYPE (pbase_binfo
),
8785 args
, tf_error
, NULL_TREE
);
8786 if (expanded_bases
== error_mark_node
)
8789 len
= TREE_VEC_LENGTH (expanded_bases
);
8792 for (idx
= 0; idx
< len
; idx
++)
8795 /* Extract the already-expanded base class. */
8796 base
= TREE_VEC_ELT (expanded_bases
, idx
);
8798 /* Substitute to figure out the base class. */
8799 base
= tsubst (BINFO_TYPE (pbase_binfo
), args
, tf_error
,
8802 if (base
== error_mark_node
)
8805 base_list
= tree_cons (access
, base
, base_list
);
8806 if (BINFO_VIRTUAL_P (pbase_binfo
))
8807 TREE_TYPE (base_list
) = integer_type_node
;
8811 /* The list is now in reverse order; correct that. */
8812 base_list
= nreverse (base_list
);
8815 pop_scope (pushed_scope
);
8817 /* Now call xref_basetypes to set up all the base-class
8819 xref_basetypes (type
, base_list
);
8821 apply_late_template_attributes (&type
, TYPE_ATTRIBUTES (pattern
),
8822 (int) ATTR_FLAG_TYPE_IN_PLACE
,
8823 args
, tf_error
, NULL_TREE
);
8824 fixup_attribute_variants (type
);
8826 /* Now that our base classes are set up, enter the scope of the
8827 class, so that name lookups into base classes, etc. will work
8828 correctly. This is precisely analogous to what we do in
8829 begin_class_definition when defining an ordinary non-template
8830 class, except we also need to push the enclosing classes. */
8831 push_nested_class (type
);
8833 /* Now members are processed in the order of declaration. */
8834 for (member
= CLASSTYPE_DECL_LIST (pattern
);
8835 member
; member
= TREE_CHAIN (member
))
8837 tree t
= TREE_VALUE (member
);
8839 if (TREE_PURPOSE (member
))
8843 /* Build new CLASSTYPE_NESTED_UTDS. */
8846 bool class_template_p
;
8848 class_template_p
= (TREE_CODE (t
) != ENUMERAL_TYPE
8849 && TYPE_LANG_SPECIFIC (t
)
8850 && CLASSTYPE_IS_TEMPLATE (t
));
8851 /* If the member is a class template, then -- even after
8852 substitution -- there may be dependent types in the
8853 template argument list for the class. We increment
8854 PROCESSING_TEMPLATE_DECL so that dependent_type_p, as
8855 that function will assume that no types are dependent
8856 when outside of a template. */
8857 if (class_template_p
)
8858 ++processing_template_decl
;
8859 newtag
= tsubst (t
, args
, tf_error
, NULL_TREE
);
8860 if (class_template_p
)
8861 --processing_template_decl
;
8862 if (newtag
== error_mark_node
)
8865 if (TREE_CODE (newtag
) != ENUMERAL_TYPE
)
8867 tree name
= TYPE_IDENTIFIER (t
);
8869 if (class_template_p
)
8870 /* Unfortunately, lookup_template_class sets
8871 CLASSTYPE_IMPLICIT_INSTANTIATION for a partial
8872 instantiation (i.e., for the type of a member
8873 template class nested within a template class.)
8874 This behavior is required for
8875 maybe_process_partial_specialization to work
8876 correctly, but is not accurate in this case;
8877 the TAG is not an instantiation of anything.
8878 (The corresponding TEMPLATE_DECL is an
8879 instantiation, but the TYPE is not.) */
8880 CLASSTYPE_USE_TEMPLATE (newtag
) = 0;
8882 /* Now, we call pushtag to put this NEWTAG into the scope of
8883 TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid
8884 pushtag calling push_template_decl. We don't have to do
8885 this for enums because it will already have been done in
8888 SET_IDENTIFIER_TYPE_VALUE (name
, newtag
);
8889 pushtag (name
, newtag
, /*tag_scope=*/ts_current
);
8892 else if (TREE_CODE (t
) == FUNCTION_DECL
8893 || DECL_FUNCTION_TEMPLATE_P (t
))
8895 /* Build new TYPE_METHODS. */
8898 if (TREE_CODE (t
) == TEMPLATE_DECL
)
8899 ++processing_template_decl
;
8900 r
= tsubst (t
, args
, tf_error
, NULL_TREE
);
8901 if (TREE_CODE (t
) == TEMPLATE_DECL
)
8902 --processing_template_decl
;
8903 set_current_access_from_decl (r
);
8904 finish_member_declaration (r
);
8905 /* Instantiate members marked with attribute used. */
8906 if (r
!= error_mark_node
&& DECL_PRESERVE_P (r
))
8911 /* Build new TYPE_FIELDS. */
8912 if (TREE_CODE (t
) == STATIC_ASSERT
)
8915 tsubst_expr (STATIC_ASSERT_CONDITION (t
), args
,
8916 tf_warning_or_error
, NULL_TREE
,
8917 /*integral_constant_expression_p=*/true);
8918 finish_static_assert (condition
,
8919 STATIC_ASSERT_MESSAGE (t
),
8920 STATIC_ASSERT_SOURCE_LOCATION (t
),
8923 else if (TREE_CODE (t
) != CONST_DECL
)
8927 /* The file and line for this declaration, to
8928 assist in error message reporting. Since we
8929 called push_tinst_level above, we don't need to
8931 input_location
= DECL_SOURCE_LOCATION (t
);
8933 if (TREE_CODE (t
) == TEMPLATE_DECL
)
8934 ++processing_template_decl
;
8935 r
= tsubst (t
, args
, tf_warning_or_error
, NULL_TREE
);
8936 if (TREE_CODE (t
) == TEMPLATE_DECL
)
8937 --processing_template_decl
;
8938 if (TREE_CODE (r
) == VAR_DECL
)
8942 [t]he initialization (and any associated
8943 side-effects) of a static data member does
8944 not occur unless the static data member is
8945 itself used in a way that requires the
8946 definition of the static data member to
8949 Therefore, we do not substitute into the
8950 initialized for the static data member here. */
8951 finish_static_data_member_decl
8954 /*init_const_expr_p=*/false,
8955 /*asmspec_tree=*/NULL_TREE
,
8957 /* Instantiate members marked with attribute used. */
8958 if (r
!= error_mark_node
&& DECL_PRESERVE_P (r
))
8961 else if (TREE_CODE (r
) == FIELD_DECL
)
8963 /* Determine whether R has a valid type and can be
8964 completed later. If R is invalid, then it is
8965 replaced by error_mark_node so that it will not be
8966 added to TYPE_FIELDS. */
8967 tree rtype
= TREE_TYPE (r
);
8968 if (can_complete_type_without_circularity (rtype
))
8969 complete_type (rtype
);
8971 if (!COMPLETE_TYPE_P (rtype
))
8973 cxx_incomplete_type_error (r
, rtype
);
8974 r
= error_mark_node
;
8978 /* If it is a TYPE_DECL for a class-scoped ENUMERAL_TYPE,
8979 such a thing will already have been added to the field
8980 list by tsubst_enum in finish_member_declaration in the
8981 CLASSTYPE_NESTED_UTDS case above. */
8982 if (!(TREE_CODE (r
) == TYPE_DECL
8983 && TREE_CODE (TREE_TYPE (r
)) == ENUMERAL_TYPE
8984 && DECL_ARTIFICIAL (r
)))
8986 set_current_access_from_decl (r
);
8987 finish_member_declaration (r
);
8994 if (TYPE_P (t
) || DECL_CLASS_TEMPLATE_P (t
))
8996 /* Build new CLASSTYPE_FRIEND_CLASSES. */
8998 tree friend_type
= t
;
8999 bool adjust_processing_template_decl
= false;
9001 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
9003 /* template <class T> friend class C; */
9004 friend_type
= tsubst_friend_class (friend_type
, args
);
9005 adjust_processing_template_decl
= true;
9007 else if (TREE_CODE (friend_type
) == UNBOUND_CLASS_TEMPLATE
)
9009 /* template <class T> friend class C::D; */
9010 friend_type
= tsubst (friend_type
, args
,
9011 tf_warning_or_error
, NULL_TREE
);
9012 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
9013 friend_type
= TREE_TYPE (friend_type
);
9014 adjust_processing_template_decl
= true;
9016 else if (TREE_CODE (friend_type
) == TYPENAME_TYPE
9017 || TREE_CODE (friend_type
) == TEMPLATE_TYPE_PARM
)
9019 /* This could be either
9023 when dependent_type_p is false or
9025 template <class U> friend class T::C;
9028 friend_type
= tsubst (friend_type
, args
,
9029 tf_warning_or_error
, NULL_TREE
);
9030 /* Bump processing_template_decl for correct
9031 dependent_type_p calculation. */
9032 ++processing_template_decl
;
9033 if (dependent_type_p (friend_type
))
9034 adjust_processing_template_decl
= true;
9035 --processing_template_decl
;
9037 else if (!CLASSTYPE_USE_TEMPLATE (friend_type
)
9038 && hidden_name_p (TYPE_NAME (friend_type
)))
9042 where C hasn't been declared yet. Let's lookup name
9043 from namespace scope directly, bypassing any name that
9044 come from dependent base class. */
9045 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (friend_type
));
9047 /* The call to xref_tag_from_type does injection for friend
9049 push_nested_namespace (ns
);
9051 xref_tag_from_type (friend_type
, NULL_TREE
,
9052 /*tag_scope=*/ts_current
);
9053 pop_nested_namespace (ns
);
9055 else if (uses_template_parms (friend_type
))
9056 /* friend class C<T>; */
9057 friend_type
= tsubst (friend_type
, args
,
9058 tf_warning_or_error
, NULL_TREE
);
9063 where C is already declared or
9065 friend class C<int>;
9067 We don't have to do anything in these cases. */
9069 if (adjust_processing_template_decl
)
9070 /* Trick make_friend_class into realizing that the friend
9071 we're adding is a template, not an ordinary class. It's
9072 important that we use make_friend_class since it will
9073 perform some error-checking and output cross-reference
9075 ++processing_template_decl
;
9077 if (friend_type
!= error_mark_node
)
9078 make_friend_class (type
, friend_type
, /*complain=*/false);
9080 if (adjust_processing_template_decl
)
9081 --processing_template_decl
;
9085 /* Build new DECL_FRIENDLIST. */
9088 /* The file and line for this declaration, to
9089 assist in error message reporting. Since we
9090 called push_tinst_level above, we don't need to
9092 input_location
= DECL_SOURCE_LOCATION (t
);
9094 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9096 ++processing_template_decl
;
9097 push_deferring_access_checks (dk_no_check
);
9100 r
= tsubst_friend_function (t
, args
);
9101 add_friend (type
, r
, /*complain=*/false);
9102 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9104 pop_deferring_access_checks ();
9105 --processing_template_decl
;
9111 if (CLASSTYPE_LAMBDA_EXPR (type
))
9113 tree decl
= lambda_function (type
);
9116 tree lambda
= CLASSTYPE_LAMBDA_EXPR (type
);
9117 if (LAMBDA_EXPR_DEDUCE_RETURN_TYPE_P (lambda
))
9119 apply_lambda_return_type (lambda
, void_type_node
);
9120 LAMBDA_EXPR_RETURN_TYPE (lambda
) = NULL_TREE
;
9122 instantiate_decl (decl
, false, false);
9123 maybe_add_lambda_conv_op (type
);
9126 gcc_assert (errorcount
);
9129 /* Set the file and line number information to whatever is given for
9130 the class itself. This puts error messages involving generated
9131 implicit functions at a predictable point, and the same point
9132 that would be used for non-template classes. */
9133 input_location
= DECL_SOURCE_LOCATION (typedecl
);
9135 unreverse_member_declarations (type
);
9136 finish_struct_1 (type
);
9137 TYPE_BEING_DEFINED (type
) = 0;
9139 /* We don't instantiate default arguments for member functions. 14.7.1:
9141 The implicit instantiation of a class template specialization causes
9142 the implicit instantiation of the declarations, but not of the
9143 definitions or default arguments, of the class member functions,
9144 member classes, static data members and member templates.... */
9146 /* Some typedefs referenced from within the template code need to be access
9147 checked at template instantiation time, i.e now. These types were
9148 added to the template at parsing time. Let's get those and perform
9149 the access checks then. */
9150 perform_typedefs_access_check (pattern
, args
);
9151 perform_deferred_access_checks ();
9152 pop_nested_class ();
9153 maximum_field_alignment
= saved_maximum_field_alignment
;
9154 pop_from_top_level ();
9155 pop_deferring_access_checks ();
9158 /* The vtable for a template class can be emitted in any translation
9159 unit in which the class is instantiated. When there is no key
9160 method, however, finish_struct_1 will already have added TYPE to
9161 the keyed_classes list. */
9162 if (TYPE_CONTAINS_VPTR_P (type
) && CLASSTYPE_KEY_METHOD (type
))
9163 keyed_classes
= tree_cons (NULL_TREE
, type
, keyed_classes
);
9168 /* Wrapper for instantiate_class_template_1. */
9171 instantiate_class_template (tree type
)
9174 timevar_push (TV_TEMPLATE_INST
);
9175 ret
= instantiate_class_template_1 (type
);
9176 timevar_pop (TV_TEMPLATE_INST
);
9181 tsubst_template_arg (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
9187 else if (TYPE_P (t
))
9188 r
= tsubst (t
, args
, complain
, in_decl
);
9191 if (!(complain
& tf_warning
))
9192 ++c_inhibit_evaluation_warnings
;
9193 r
= tsubst_expr (t
, args
, complain
, in_decl
,
9194 /*integral_constant_expression_p=*/true);
9195 if (!(complain
& tf_warning
))
9196 --c_inhibit_evaluation_warnings
;
9197 /* Preserve the raw-reference nature of T. */
9198 if (TREE_TYPE (t
) && TREE_CODE (TREE_TYPE (t
)) == REFERENCE_TYPE
9199 && REFERENCE_REF_P (r
))
9200 r
= TREE_OPERAND (r
, 0);
9205 /* Given a function parameter pack TMPL_PARM and some function parameters
9206 instantiated from it at *SPEC_P, return a NONTYPE_ARGUMENT_PACK of them
9207 and set *SPEC_P to point at the next point in the list. */
9210 extract_fnparm_pack (tree tmpl_parm
, tree
*spec_p
)
9212 /* Collect all of the extra "packed" parameters into an
9216 tree argpack
= make_node (NONTYPE_ARGUMENT_PACK
);
9217 tree argtypepack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
9218 tree spec_parm
= *spec_p
;
9221 for (len
= 0; spec_parm
; ++len
, spec_parm
= TREE_CHAIN (spec_parm
))
9223 && !function_parameter_expanded_from_pack_p (spec_parm
, tmpl_parm
))
9226 /* Fill in PARMVEC and PARMTYPEVEC with all of the parameters. */
9227 parmvec
= make_tree_vec (len
);
9228 parmtypevec
= make_tree_vec (len
);
9229 spec_parm
= *spec_p
;
9230 for (i
= 0; i
< len
; i
++, spec_parm
= DECL_CHAIN (spec_parm
))
9232 TREE_VEC_ELT (parmvec
, i
) = spec_parm
;
9233 TREE_VEC_ELT (parmtypevec
, i
) = TREE_TYPE (spec_parm
);
9236 /* Build the argument packs. */
9237 SET_ARGUMENT_PACK_ARGS (argpack
, parmvec
);
9238 SET_ARGUMENT_PACK_ARGS (argtypepack
, parmtypevec
);
9239 TREE_TYPE (argpack
) = argtypepack
;
9240 *spec_p
= spec_parm
;
9245 /* Give a chain SPEC_PARM of PARM_DECLs, pack them into a
9246 NONTYPE_ARGUMENT_PACK. */
9249 make_fnparm_pack (tree spec_parm
)
9251 return extract_fnparm_pack (NULL_TREE
, &spec_parm
);
9254 /* Substitute ARGS into T, which is an pack expansion
9255 (i.e. TYPE_PACK_EXPANSION or EXPR_PACK_EXPANSION). Returns a
9256 TREE_VEC with the substituted arguments, a PACK_EXPANSION_* node
9257 (if only a partial substitution could be performed) or
9258 ERROR_MARK_NODE if there was an error. */
9260 tsubst_pack_expansion (tree t
, tree args
, tsubst_flags_t complain
,
9264 tree pack
, packs
= NULL_TREE
;
9265 bool unsubstituted_packs
= false;
9266 bool real_packs
= false;
9267 int missing_level
= 0;
9270 htab_t saved_local_specializations
= NULL
;
9273 gcc_assert (PACK_EXPANSION_P (t
));
9274 pattern
= PACK_EXPANSION_PATTERN (t
);
9276 /* Add in any args remembered from an earlier partial instantiation. */
9277 args
= add_to_template_args (PACK_EXPANSION_EXTRA_ARGS (t
), args
);
9279 levels
= TMPL_ARGS_DEPTH (args
);
9281 /* Determine the argument packs that will instantiate the parameter
9282 packs used in the expansion expression. While we're at it,
9283 compute the number of arguments to be expanded and make sure it
9285 for (pack
= PACK_EXPANSION_PARAMETER_PACKS (t
); pack
;
9286 pack
= TREE_CHAIN (pack
))
9288 tree parm_pack
= TREE_VALUE (pack
);
9289 tree arg_pack
= NULL_TREE
;
9290 tree orig_arg
= NULL_TREE
;
9293 if (TREE_CODE (parm_pack
) == BASES
)
9295 if (BASES_DIRECT (parm_pack
))
9296 return calculate_direct_bases (tsubst_expr (BASES_TYPE (parm_pack
),
9297 args
, complain
, in_decl
, false));
9299 return calculate_bases (tsubst_expr (BASES_TYPE (parm_pack
),
9300 args
, complain
, in_decl
, false));
9302 if (TREE_CODE (parm_pack
) == PARM_DECL
)
9304 if (!cp_unevaluated_operand
)
9305 arg_pack
= retrieve_local_specialization (parm_pack
);
9308 /* We can't rely on local_specializations for a parameter
9309 name used later in a function declaration (such as in a
9310 late-specified return type). Even if it exists, it might
9311 have the wrong value for a recursive call. Just make a
9312 dummy decl, since it's only used for its type. */
9313 arg_pack
= tsubst_decl (parm_pack
, args
, complain
);
9314 if (arg_pack
&& FUNCTION_PARAMETER_PACK_P (arg_pack
))
9315 /* Partial instantiation of the parm_pack, we can't build
9316 up an argument pack yet. */
9317 arg_pack
= NULL_TREE
;
9319 arg_pack
= make_fnparm_pack (arg_pack
);
9325 template_parm_level_and_index (parm_pack
, &level
, &idx
);
9327 if (level
<= levels
)
9328 arg_pack
= TMPL_ARG (args
, level
, idx
);
9331 orig_arg
= arg_pack
;
9332 if (arg_pack
&& TREE_CODE (arg_pack
) == ARGUMENT_PACK_SELECT
)
9333 arg_pack
= ARGUMENT_PACK_SELECT_FROM_PACK (arg_pack
);
9335 if (arg_pack
&& !ARGUMENT_PACK_P (arg_pack
))
9336 /* This can only happen if we forget to expand an argument
9337 pack somewhere else. Just return an error, silently. */
9339 result
= make_tree_vec (1);
9340 TREE_VEC_ELT (result
, 0) = error_mark_node
;
9344 if (arg_from_parm_pack_p (arg_pack
, parm_pack
))
9345 /* The argument pack that the parameter maps to is just an
9346 expansion of the parameter itself, such as one would find
9347 in the implicit typedef of a class inside the class itself.
9348 Consider this parameter "unsubstituted", so that we will
9349 maintain the outer pack expansion. */
9350 arg_pack
= NULL_TREE
;
9355 TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg_pack
));
9357 /* Don't bother trying to do a partial substitution with
9358 incomplete packs; we'll try again after deduction. */
9359 if (ARGUMENT_PACK_INCOMPLETE_P (arg_pack
))
9364 else if (len
!= my_len
)
9366 if (!(complain
& tf_error
))
9367 /* Fail quietly. */;
9368 else if (TREE_CODE (t
) == TYPE_PACK_EXPANSION
)
9369 error ("mismatched argument pack lengths while expanding "
9373 error ("mismatched argument pack lengths while expanding "
9376 return error_mark_node
;
9379 if (TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg_pack
)) == 1
9380 && PACK_EXPANSION_P (TREE_VEC_ELT (ARGUMENT_PACK_ARGS (arg_pack
),
9382 /* This isn't a real argument pack yet. */;
9386 /* Keep track of the parameter packs and their corresponding
9388 packs
= tree_cons (parm_pack
, arg_pack
, packs
);
9389 TREE_TYPE (packs
) = orig_arg
;
9393 /* We can't substitute for this parameter pack. We use a flag as
9394 well as the missing_level counter because function parameter
9395 packs don't have a level. */
9396 unsubstituted_packs
= true;
9397 if (!missing_level
|| missing_level
> level
)
9398 missing_level
= level
;
9402 /* We cannot expand this expansion expression, because we don't have
9403 all of the argument packs we need. */
9404 if (unsubstituted_packs
)
9408 /* We got some full packs, but we can't substitute them in until we
9409 have values for all the packs. So remember these until then. */
9412 t
= make_pack_expansion (pattern
);
9414 /* The call to add_to_template_args above assumes no overlap
9415 between saved args and new args, so prune away any fake
9416 args, i.e. those that satisfied arg_from_parm_pack_p above. */
9417 if (missing_level
&& levels
>= missing_level
)
9419 gcc_assert (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
)
9420 && missing_level
> 1);
9421 TREE_VEC_LENGTH (args
) = missing_level
- 1;
9422 save_args
= copy_node (args
);
9423 TREE_VEC_LENGTH (args
) = levels
;
9428 PACK_EXPANSION_EXTRA_ARGS (t
) = save_args
;
9432 /* There were no real arguments, we're just replacing a parameter
9433 pack with another version of itself. Substitute into the
9434 pattern and return a PACK_EXPANSION_*. The caller will need to
9436 if (TREE_CODE (t
) == EXPR_PACK_EXPANSION
)
9437 t
= tsubst_expr (pattern
, args
, complain
, in_decl
,
9438 /*integral_constant_expression_p=*/false);
9440 t
= tsubst (pattern
, args
, complain
, in_decl
);
9441 t
= make_pack_expansion (t
);
9446 /* We could not find any argument packs that work. */
9448 return error_mark_node
;
9450 if (cp_unevaluated_operand
)
9452 /* We're in a late-specified return type, so create our own local
9453 specializations table; the current table is either NULL or (in the
9454 case of recursive unification) might have bindings that we don't
9455 want to use or alter. */
9456 saved_local_specializations
= local_specializations
;
9457 local_specializations
= htab_create (37,
9458 hash_local_specialization
,
9459 eq_local_specializations
,
9463 /* For each argument in each argument pack, substitute into the
9465 result
= make_tree_vec (len
);
9466 for (i
= 0; i
< len
; ++i
)
9468 /* For parameter pack, change the substitution of the parameter
9469 pack to the ith argument in its argument pack, then expand
9471 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
9473 tree parm
= TREE_PURPOSE (pack
);
9476 /* Select the Ith argument from the pack. */
9477 if (TREE_CODE (parm
) == PARM_DECL
)
9481 arg
= make_node (ARGUMENT_PACK_SELECT
);
9482 ARGUMENT_PACK_SELECT_FROM_PACK (arg
) = TREE_VALUE (pack
);
9484 register_local_specialization (arg
, parm
);
9487 arg
= retrieve_local_specialization (parm
);
9492 template_parm_level_and_index (parm
, &level
, &idx
);
9496 arg
= make_node (ARGUMENT_PACK_SELECT
);
9497 ARGUMENT_PACK_SELECT_FROM_PACK (arg
) = TREE_VALUE (pack
);
9498 /* Update the corresponding argument. */
9499 TMPL_ARG (args
, level
, idx
) = arg
;
9502 /* Re-use the ARGUMENT_PACK_SELECT. */
9503 arg
= TMPL_ARG (args
, level
, idx
);
9505 ARGUMENT_PACK_SELECT_INDEX (arg
) = i
;
9508 /* Substitute into the PATTERN with the altered arguments. */
9509 if (TREE_CODE (t
) == EXPR_PACK_EXPANSION
)
9510 TREE_VEC_ELT (result
, i
) =
9511 tsubst_expr (pattern
, args
, complain
, in_decl
,
9512 /*integral_constant_expression_p=*/false);
9514 TREE_VEC_ELT (result
, i
) = tsubst (pattern
, args
, complain
, in_decl
);
9516 if (TREE_VEC_ELT (result
, i
) == error_mark_node
)
9518 result
= error_mark_node
;
9523 /* Update ARGS to restore the substitution from parameter packs to
9524 their argument packs. */
9525 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
9527 tree parm
= TREE_PURPOSE (pack
);
9529 if (TREE_CODE (parm
) == PARM_DECL
)
9530 register_local_specialization (TREE_TYPE (pack
), parm
);
9534 template_parm_level_and_index (parm
, &level
, &idx
);
9536 /* Update the corresponding argument. */
9537 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
9538 TREE_VEC_ELT (TREE_VEC_ELT (args
, level
-1 ), idx
) =
9541 TREE_VEC_ELT (args
, idx
) = TREE_TYPE (pack
);
9545 if (saved_local_specializations
)
9547 htab_delete (local_specializations
);
9548 local_specializations
= saved_local_specializations
;
9554 /* Given PARM_DECL PARM, find the corresponding PARM_DECL in the template
9555 TMPL. We do this using DECL_PARM_INDEX, which should work even with
9556 parameter packs; all parms generated from a function parameter pack will
9557 have the same DECL_PARM_INDEX. */
9560 get_pattern_parm (tree parm
, tree tmpl
)
9562 tree pattern
= DECL_TEMPLATE_RESULT (tmpl
);
9565 if (DECL_ARTIFICIAL (parm
))
9567 for (patparm
= DECL_ARGUMENTS (pattern
);
9568 patparm
; patparm
= DECL_CHAIN (patparm
))
9569 if (DECL_ARTIFICIAL (patparm
)
9570 && DECL_NAME (parm
) == DECL_NAME (patparm
))
9575 patparm
= FUNCTION_FIRST_USER_PARM (DECL_TEMPLATE_RESULT (tmpl
));
9576 patparm
= chain_index (DECL_PARM_INDEX (parm
)-1, patparm
);
9577 gcc_assert (DECL_PARM_INDEX (patparm
)
9578 == DECL_PARM_INDEX (parm
));
9584 /* Substitute ARGS into the vector or list of template arguments T. */
9587 tsubst_template_args (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
9590 int len
, need_new
= 0, i
, expanded_len_adjust
= 0, out
;
9593 if (t
== error_mark_node
)
9594 return error_mark_node
;
9596 len
= TREE_VEC_LENGTH (t
);
9597 elts
= XALLOCAVEC (tree
, len
);
9599 for (i
= 0; i
< len
; i
++)
9601 tree orig_arg
= TREE_VEC_ELT (t
, i
);
9604 if (TREE_CODE (orig_arg
) == TREE_VEC
)
9605 new_arg
= tsubst_template_args (orig_arg
, args
, complain
, in_decl
);
9606 else if (PACK_EXPANSION_P (orig_arg
))
9608 /* Substitute into an expansion expression. */
9609 new_arg
= tsubst_pack_expansion (orig_arg
, args
, complain
, in_decl
);
9611 if (TREE_CODE (new_arg
) == TREE_VEC
)
9612 /* Add to the expanded length adjustment the number of
9613 expanded arguments. We subtract one from this
9614 measurement, because the argument pack expression
9615 itself is already counted as 1 in
9616 LEN. EXPANDED_LEN_ADJUST can actually be negative, if
9617 the argument pack is empty. */
9618 expanded_len_adjust
+= TREE_VEC_LENGTH (new_arg
) - 1;
9620 else if (ARGUMENT_PACK_P (orig_arg
))
9622 /* Substitute into each of the arguments. */
9623 new_arg
= TYPE_P (orig_arg
)
9624 ? cxx_make_type (TREE_CODE (orig_arg
))
9625 : make_node (TREE_CODE (orig_arg
));
9627 SET_ARGUMENT_PACK_ARGS (
9629 tsubst_template_args (ARGUMENT_PACK_ARGS (orig_arg
),
9630 args
, complain
, in_decl
));
9632 if (ARGUMENT_PACK_ARGS (new_arg
) == error_mark_node
)
9633 new_arg
= error_mark_node
;
9635 if (TREE_CODE (new_arg
) == NONTYPE_ARGUMENT_PACK
) {
9636 TREE_TYPE (new_arg
) = tsubst (TREE_TYPE (orig_arg
), args
,
9638 TREE_CONSTANT (new_arg
) = TREE_CONSTANT (orig_arg
);
9640 if (TREE_TYPE (new_arg
) == error_mark_node
)
9641 new_arg
= error_mark_node
;
9645 new_arg
= tsubst_template_arg (orig_arg
, args
, complain
, in_decl
);
9647 if (new_arg
== error_mark_node
)
9648 return error_mark_node
;
9651 if (new_arg
!= orig_arg
)
9658 /* Make space for the expanded arguments coming from template
9660 t
= make_tree_vec (len
+ expanded_len_adjust
);
9661 /* ORIG_T can contain TREE_VECs. That happens if ORIG_T contains the
9662 arguments for a member template.
9663 In that case each TREE_VEC in ORIG_T represents a level of template
9664 arguments, and ORIG_T won't carry any non defaulted argument count.
9665 It will rather be the nested TREE_VECs that will carry one.
9666 In other words, ORIG_T carries a non defaulted argument count only
9667 if it doesn't contain any nested TREE_VEC. */
9668 if (NON_DEFAULT_TEMPLATE_ARGS_COUNT (orig_t
))
9670 int count
= GET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (orig_t
);
9671 count
+= expanded_len_adjust
;
9672 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (t
, count
);
9674 for (i
= 0, out
= 0; i
< len
; i
++)
9676 if ((PACK_EXPANSION_P (TREE_VEC_ELT (orig_t
, i
))
9677 || ARGUMENT_PACK_P (TREE_VEC_ELT (orig_t
, i
)))
9678 && TREE_CODE (elts
[i
]) == TREE_VEC
)
9682 /* Now expand the template argument pack "in place". */
9683 for (idx
= 0; idx
< TREE_VEC_LENGTH (elts
[i
]); idx
++, out
++)
9684 TREE_VEC_ELT (t
, out
) = TREE_VEC_ELT (elts
[i
], idx
);
9688 TREE_VEC_ELT (t
, out
) = elts
[i
];
9696 /* Return the result of substituting ARGS into the template parameters
9697 given by PARMS. If there are m levels of ARGS and m + n levels of
9698 PARMS, then the result will contain n levels of PARMS. For
9699 example, if PARMS is `template <class T> template <class U>
9700 template <T*, U, class V>' and ARGS is {{int}, {double}} then the
9701 result will be `template <int*, double, class V>'. */
9704 tsubst_template_parms (tree parms
, tree args
, tsubst_flags_t complain
)
9709 /* When substituting into a template, we must set
9710 PROCESSING_TEMPLATE_DECL as the template parameters may be
9711 dependent if they are based on one-another, and the dependency
9712 predicates are short-circuit outside of templates. */
9713 ++processing_template_decl
;
9715 for (new_parms
= &r
;
9716 TMPL_PARMS_DEPTH (parms
) > TMPL_ARGS_DEPTH (args
);
9717 new_parms
= &(TREE_CHAIN (*new_parms
)),
9718 parms
= TREE_CHAIN (parms
))
9721 make_tree_vec (TREE_VEC_LENGTH (TREE_VALUE (parms
)));
9724 for (i
= 0; i
< TREE_VEC_LENGTH (new_vec
); ++i
)
9728 if (parms
== error_mark_node
)
9731 tuple
= TREE_VEC_ELT (TREE_VALUE (parms
), i
);
9733 if (tuple
== error_mark_node
)
9736 TREE_VEC_ELT (new_vec
, i
) =
9737 tsubst_template_parm (tuple
, args
, complain
);
9741 tree_cons (size_int (TMPL_PARMS_DEPTH (parms
)
9742 - TMPL_ARGS_DEPTH (args
)),
9743 new_vec
, NULL_TREE
);
9746 --processing_template_decl
;
9751 /* Return the result of substituting ARGS into one template parameter
9752 given by T. T Must be a TREE_LIST which TREE_VALUE is the template
9753 parameter and which TREE_PURPOSE is the default argument of the
9754 template parameter. */
9757 tsubst_template_parm (tree t
, tree args
, tsubst_flags_t complain
)
9759 tree default_value
, parm_decl
;
9761 if (args
== NULL_TREE
9763 || t
== error_mark_node
)
9766 gcc_assert (TREE_CODE (t
) == TREE_LIST
);
9768 default_value
= TREE_PURPOSE (t
);
9769 parm_decl
= TREE_VALUE (t
);
9771 parm_decl
= tsubst (parm_decl
, args
, complain
, NULL_TREE
);
9772 if (TREE_CODE (parm_decl
) == PARM_DECL
9773 && invalid_nontype_parm_type_p (TREE_TYPE (parm_decl
), complain
))
9774 parm_decl
= error_mark_node
;
9775 default_value
= tsubst_template_arg (default_value
, args
,
9776 complain
, NULL_TREE
);
9778 return build_tree_list (default_value
, parm_decl
);
9781 /* Substitute the ARGS into the indicated aggregate (or enumeration)
9782 type T. If T is not an aggregate or enumeration type, it is
9783 handled as if by tsubst. IN_DECL is as for tsubst. If
9784 ENTERING_SCOPE is nonzero, T is the context for a template which
9785 we are presently tsubst'ing. Return the substituted value. */
9788 tsubst_aggr_type (tree t
,
9790 tsubst_flags_t complain
,
9797 switch (TREE_CODE (t
))
9800 if (TYPE_PTRMEMFUNC_P (t
))
9801 return tsubst (TYPE_PTRMEMFUNC_FN_TYPE (t
), args
, complain
, in_decl
);
9803 /* Else fall through. */
9806 if (TYPE_TEMPLATE_INFO (t
) && uses_template_parms (t
))
9811 int saved_unevaluated_operand
;
9812 int saved_inhibit_evaluation_warnings
;
9814 /* In "sizeof(X<I>)" we need to evaluate "I". */
9815 saved_unevaluated_operand
= cp_unevaluated_operand
;
9816 cp_unevaluated_operand
= 0;
9817 saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
9818 c_inhibit_evaluation_warnings
= 0;
9820 /* First, determine the context for the type we are looking
9822 context
= TYPE_CONTEXT (t
);
9823 if (context
&& TYPE_P (context
))
9825 context
= tsubst_aggr_type (context
, args
, complain
,
9826 in_decl
, /*entering_scope=*/1);
9827 /* If context is a nested class inside a class template,
9828 it may still need to be instantiated (c++/33959). */
9829 context
= complete_type (context
);
9832 /* Then, figure out what arguments are appropriate for the
9833 type we are trying to find. For example, given:
9835 template <class T> struct S;
9836 template <class T, class U> void f(T, U) { S<U> su; }
9838 and supposing that we are instantiating f<int, double>,
9839 then our ARGS will be {int, double}, but, when looking up
9840 S we only want {double}. */
9841 argvec
= tsubst_template_args (TYPE_TI_ARGS (t
), args
,
9843 if (argvec
== error_mark_node
)
9844 r
= error_mark_node
;
9847 r
= lookup_template_class (t
, argvec
, in_decl
, context
,
9848 entering_scope
, complain
);
9849 r
= cp_build_qualified_type_real (r
, cp_type_quals (t
), complain
);
9852 cp_unevaluated_operand
= saved_unevaluated_operand
;
9853 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
9858 /* This is not a template type, so there's nothing to do. */
9862 return tsubst (t
, args
, complain
, in_decl
);
9866 /* Substitute into the default argument ARG (a default argument for
9867 FN), which has the indicated TYPE. */
9870 tsubst_default_argument (tree fn
, tree type
, tree arg
)
9872 tree saved_class_ptr
= NULL_TREE
;
9873 tree saved_class_ref
= NULL_TREE
;
9875 /* This can happen in invalid code. */
9876 if (TREE_CODE (arg
) == DEFAULT_ARG
)
9879 /* This default argument came from a template. Instantiate the
9880 default argument here, not in tsubst. In the case of
9889 we must be careful to do name lookup in the scope of S<T>,
9890 rather than in the current class. */
9891 push_access_scope (fn
);
9892 /* The "this" pointer is not valid in a default argument. */
9895 saved_class_ptr
= current_class_ptr
;
9896 cp_function_chain
->x_current_class_ptr
= NULL_TREE
;
9897 saved_class_ref
= current_class_ref
;
9898 cp_function_chain
->x_current_class_ref
= NULL_TREE
;
9901 push_deferring_access_checks(dk_no_deferred
);
9902 /* The default argument expression may cause implicitly defined
9903 member functions to be synthesized, which will result in garbage
9904 collection. We must treat this situation as if we were within
9905 the body of function so as to avoid collecting live data on the
9908 arg
= tsubst_expr (arg
, DECL_TI_ARGS (fn
),
9909 tf_warning_or_error
, NULL_TREE
,
9910 /*integral_constant_expression_p=*/false);
9912 pop_deferring_access_checks();
9914 /* Restore the "this" pointer. */
9917 cp_function_chain
->x_current_class_ptr
= saved_class_ptr
;
9918 cp_function_chain
->x_current_class_ref
= saved_class_ref
;
9921 /* Make sure the default argument is reasonable. */
9922 arg
= check_default_argument (type
, arg
);
9924 pop_access_scope (fn
);
9929 /* Substitute into all the default arguments for FN. */
9932 tsubst_default_arguments (tree fn
)
9937 tmpl_args
= DECL_TI_ARGS (fn
);
9939 /* If this function is not yet instantiated, we certainly don't need
9940 its default arguments. */
9941 if (uses_template_parms (tmpl_args
))
9943 /* Don't do this again for clones. */
9944 if (DECL_CLONED_FUNCTION_P (fn
))
9947 for (arg
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
9949 arg
= TREE_CHAIN (arg
))
9950 if (TREE_PURPOSE (arg
))
9951 TREE_PURPOSE (arg
) = tsubst_default_argument (fn
,
9953 TREE_PURPOSE (arg
));
9956 /* Substitute the ARGS into the T, which is a _DECL. Return the
9957 result of the substitution. Issue error and warning messages under
9958 control of COMPLAIN. */
9961 tsubst_decl (tree t
, tree args
, tsubst_flags_t complain
)
9963 #define RETURN(EXP) do { r = (EXP); goto out; } while(0)
9964 location_t saved_loc
;
9969 /* Set the filename and linenumber to improve error-reporting. */
9970 saved_loc
= input_location
;
9971 input_location
= DECL_SOURCE_LOCATION (t
);
9973 switch (TREE_CODE (t
))
9977 /* We can get here when processing a member function template,
9978 member class template, or template template parameter. */
9979 tree decl
= DECL_TEMPLATE_RESULT (t
);
9984 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
9986 /* Template template parameter is treated here. */
9987 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
9988 if (new_type
== error_mark_node
)
9989 RETURN (error_mark_node
);
9992 DECL_CHAIN (r
) = NULL_TREE
;
9993 TREE_TYPE (r
) = new_type
;
9994 DECL_TEMPLATE_RESULT (r
)
9995 = build_decl (DECL_SOURCE_LOCATION (decl
),
9996 TYPE_DECL
, DECL_NAME (decl
), new_type
);
9997 DECL_TEMPLATE_PARMS (r
)
9998 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
,
10000 TYPE_NAME (new_type
) = r
;
10004 /* We might already have an instance of this template.
10005 The ARGS are for the surrounding class type, so the
10006 full args contain the tsubst'd args for the context,
10007 plus the innermost args from the template decl. */
10008 tmpl_args
= DECL_CLASS_TEMPLATE_P (t
)
10009 ? CLASSTYPE_TI_ARGS (TREE_TYPE (t
))
10010 : DECL_TI_ARGS (DECL_TEMPLATE_RESULT (t
));
10011 /* Because this is a template, the arguments will still be
10012 dependent, even after substitution. If
10013 PROCESSING_TEMPLATE_DECL is not set, the dependency
10014 predicates will short-circuit. */
10015 ++processing_template_decl
;
10016 full_args
= tsubst_template_args (tmpl_args
, args
,
10017 complain
, in_decl
);
10018 --processing_template_decl
;
10019 if (full_args
== error_mark_node
)
10020 RETURN (error_mark_node
);
10022 /* If this is a default template template argument,
10023 tsubst might not have changed anything. */
10024 if (full_args
== tmpl_args
)
10027 hash
= hash_tmpl_and_args (t
, full_args
);
10028 spec
= retrieve_specialization (t
, full_args
, hash
);
10029 if (spec
!= NULL_TREE
)
10035 /* Make a new template decl. It will be similar to the
10036 original, but will record the current template arguments.
10037 We also create a new function declaration, which is just
10038 like the old one, but points to this new template, rather
10039 than the old one. */
10041 gcc_assert (DECL_LANG_SPECIFIC (r
) != 0);
10042 DECL_CHAIN (r
) = NULL_TREE
;
10044 DECL_TEMPLATE_INFO (r
) = build_template_info (t
, args
);
10046 if (TREE_CODE (decl
) == TYPE_DECL
10047 && !TYPE_DECL_ALIAS_P (decl
))
10050 ++processing_template_decl
;
10051 new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
10052 --processing_template_decl
;
10053 if (new_type
== error_mark_node
)
10054 RETURN (error_mark_node
);
10056 TREE_TYPE (r
) = new_type
;
10057 CLASSTYPE_TI_TEMPLATE (new_type
) = r
;
10058 DECL_TEMPLATE_RESULT (r
) = TYPE_MAIN_DECL (new_type
);
10059 DECL_TI_ARGS (r
) = CLASSTYPE_TI_ARGS (new_type
);
10060 DECL_CONTEXT (r
) = TYPE_CONTEXT (new_type
);
10065 ++processing_template_decl
;
10066 new_decl
= tsubst (decl
, args
, complain
, in_decl
);
10067 --processing_template_decl
;
10068 if (new_decl
== error_mark_node
)
10069 RETURN (error_mark_node
);
10071 DECL_TEMPLATE_RESULT (r
) = new_decl
;
10072 DECL_TI_TEMPLATE (new_decl
) = r
;
10073 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
10074 DECL_TI_ARGS (r
) = DECL_TI_ARGS (new_decl
);
10075 DECL_CONTEXT (r
) = DECL_CONTEXT (new_decl
);
10078 SET_DECL_IMPLICIT_INSTANTIATION (r
);
10079 DECL_TEMPLATE_INSTANTIATIONS (r
) = NULL_TREE
;
10080 DECL_TEMPLATE_SPECIALIZATIONS (r
) = NULL_TREE
;
10082 /* The template parameters for this new template are all the
10083 template parameters for the old template, except the
10084 outermost level of parameters. */
10085 DECL_TEMPLATE_PARMS (r
)
10086 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
,
10089 if (PRIMARY_TEMPLATE_P (t
))
10090 DECL_PRIMARY_TEMPLATE (r
) = r
;
10092 if (TREE_CODE (decl
) != TYPE_DECL
)
10093 /* Record this non-type partial instantiation. */
10094 register_specialization (r
, t
,
10095 DECL_TI_ARGS (DECL_TEMPLATE_RESULT (r
)),
10100 case FUNCTION_DECL
:
10103 tree argvec
= NULL_TREE
;
10111 /* Nobody should be tsubst'ing into non-template functions. */
10112 gcc_assert (DECL_TEMPLATE_INFO (t
) != NULL_TREE
);
10114 if (TREE_CODE (DECL_TI_TEMPLATE (t
)) == TEMPLATE_DECL
)
10119 /* If T is not dependent, just return it. We have to
10120 increment PROCESSING_TEMPLATE_DECL because
10121 value_dependent_expression_p assumes that nothing is
10122 dependent when PROCESSING_TEMPLATE_DECL is zero. */
10123 ++processing_template_decl
;
10124 dependent_p
= value_dependent_expression_p (t
);
10125 --processing_template_decl
;
10129 /* Calculate the most general template of which R is a
10130 specialization, and the complete set of arguments used to
10132 gen_tmpl
= most_general_template (DECL_TI_TEMPLATE (t
));
10133 argvec
= tsubst_template_args (DECL_TI_ARGS
10134 (DECL_TEMPLATE_RESULT
10135 (DECL_TI_TEMPLATE (t
))),
10136 args
, complain
, in_decl
);
10137 if (argvec
== error_mark_node
)
10138 RETURN (error_mark_node
);
10140 /* Check to see if we already have this specialization. */
10141 hash
= hash_tmpl_and_args (gen_tmpl
, argvec
);
10142 spec
= retrieve_specialization (gen_tmpl
, argvec
, hash
);
10150 /* We can see more levels of arguments than parameters if
10151 there was a specialization of a member template, like
10154 template <class T> struct S { template <class U> void f(); }
10155 template <> template <class U> void S<int>::f(U);
10157 Here, we'll be substituting into the specialization,
10158 because that's where we can find the code we actually
10159 want to generate, but we'll have enough arguments for
10160 the most general template.
10162 We also deal with the peculiar case:
10164 template <class T> struct S {
10165 template <class U> friend void f();
10167 template <class U> void f() {}
10169 template void f<double>();
10171 Here, the ARGS for the instantiation of will be {int,
10172 double}. But, we only need as many ARGS as there are
10173 levels of template parameters in CODE_PATTERN. We are
10174 careful not to get fooled into reducing the ARGS in
10177 template <class T> struct S { template <class U> void f(U); }
10178 template <class T> template <> void S<T>::f(int) {}
10180 which we can spot because the pattern will be a
10181 specialization in this case. */
10182 args_depth
= TMPL_ARGS_DEPTH (args
);
10184 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (t
)));
10185 if (args_depth
> parms_depth
10186 && !DECL_TEMPLATE_SPECIALIZATION (t
))
10187 args
= get_innermost_template_args (args
, parms_depth
);
10191 /* This special case arises when we have something like this:
10193 template <class T> struct S {
10194 friend void f<int>(int, double);
10197 Here, the DECL_TI_TEMPLATE for the friend declaration
10198 will be an IDENTIFIER_NODE. We are being called from
10199 tsubst_friend_function, and we want only to create a
10200 new decl (R) with appropriate types so that we can call
10201 determine_specialization. */
10202 gen_tmpl
= NULL_TREE
;
10205 if (DECL_CLASS_SCOPE_P (t
))
10207 if (DECL_NAME (t
) == constructor_name (DECL_CONTEXT (t
)))
10211 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
,
10212 complain
, t
, /*entering_scope=*/1);
10217 ctx
= DECL_CONTEXT (t
);
10219 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
10220 if (type
== error_mark_node
)
10221 RETURN (error_mark_node
);
10223 /* We do NOT check for matching decls pushed separately at this
10224 point, as they may not represent instantiations of this
10225 template, and in any case are considered separate under the
10228 DECL_USE_TEMPLATE (r
) = 0;
10229 TREE_TYPE (r
) = type
;
10230 /* Clear out the mangled name and RTL for the instantiation. */
10231 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
10232 SET_DECL_RTL (r
, NULL
);
10233 /* Leave DECL_INITIAL set on deleted instantiations. */
10234 if (!DECL_DELETED_FN (r
))
10235 DECL_INITIAL (r
) = NULL_TREE
;
10236 DECL_CONTEXT (r
) = ctx
;
10238 if (member
&& DECL_CONV_FN_P (r
))
10239 /* Type-conversion operator. Reconstruct the name, in
10240 case it's the name of one of the template's parameters. */
10241 DECL_NAME (r
) = mangle_conv_op_name_for_type (TREE_TYPE (type
));
10243 DECL_ARGUMENTS (r
) = tsubst (DECL_ARGUMENTS (t
), args
,
10245 DECL_RESULT (r
) = NULL_TREE
;
10247 TREE_STATIC (r
) = 0;
10248 TREE_PUBLIC (r
) = TREE_PUBLIC (t
);
10249 DECL_EXTERNAL (r
) = 1;
10250 /* If this is an instantiation of a function with internal
10251 linkage, we already know what object file linkage will be
10252 assigned to the instantiation. */
10253 DECL_INTERFACE_KNOWN (r
) = !TREE_PUBLIC (r
);
10254 DECL_DEFER_OUTPUT (r
) = 0;
10255 DECL_CHAIN (r
) = NULL_TREE
;
10256 DECL_PENDING_INLINE_INFO (r
) = 0;
10257 DECL_PENDING_INLINE_P (r
) = 0;
10258 DECL_SAVED_TREE (r
) = NULL_TREE
;
10259 DECL_STRUCT_FUNCTION (r
) = NULL
;
10261 /* We'll re-clone as appropriate in instantiate_template. */
10262 DECL_CLONED_FUNCTION (r
) = NULL_TREE
;
10264 /* If we aren't complaining now, return on error before we register
10265 the specialization so that we'll complain eventually. */
10266 if ((complain
& tf_error
) == 0
10267 && IDENTIFIER_OPNAME_P (DECL_NAME (r
))
10268 && !grok_op_properties (r
, /*complain=*/false))
10269 RETURN (error_mark_node
);
10271 /* Set up the DECL_TEMPLATE_INFO for R. There's no need to do
10272 this in the special friend case mentioned above where
10273 GEN_TMPL is NULL. */
10276 DECL_TEMPLATE_INFO (r
)
10277 = build_template_info (gen_tmpl
, argvec
);
10278 SET_DECL_IMPLICIT_INSTANTIATION (r
);
10279 register_specialization (r
, gen_tmpl
, argvec
, false, hash
);
10281 /* We're not supposed to instantiate default arguments
10282 until they are called, for a template. But, for a
10285 template <class T> void f ()
10286 { extern void g(int i = T()); }
10288 we should do the substitution when the template is
10289 instantiated. We handle the member function case in
10290 instantiate_class_template since the default arguments
10291 might refer to other members of the class. */
10293 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
10294 && !uses_template_parms (argvec
))
10295 tsubst_default_arguments (r
);
10298 DECL_TEMPLATE_INFO (r
) = NULL_TREE
;
10300 /* Copy the list of befriending classes. */
10301 for (friends
= &DECL_BEFRIENDING_CLASSES (r
);
10303 friends
= &TREE_CHAIN (*friends
))
10305 *friends
= copy_node (*friends
);
10306 TREE_VALUE (*friends
) = tsubst (TREE_VALUE (*friends
),
10311 if (DECL_CONSTRUCTOR_P (r
) || DECL_DESTRUCTOR_P (r
))
10313 maybe_retrofit_in_chrg (r
);
10314 if (DECL_CONSTRUCTOR_P (r
))
10315 grok_ctor_properties (ctx
, r
);
10316 /* If this is an instantiation of a member template, clone it.
10317 If it isn't, that'll be handled by
10318 clone_constructors_and_destructors. */
10319 if (PRIMARY_TEMPLATE_P (gen_tmpl
))
10320 clone_function_decl (r
, /*update_method_vec_p=*/0);
10322 else if ((complain
& tf_error
) != 0
10323 && IDENTIFIER_OPNAME_P (DECL_NAME (r
))
10324 && !grok_op_properties (r
, /*complain=*/true))
10325 RETURN (error_mark_node
);
10327 if (DECL_FRIEND_P (t
) && DECL_FRIEND_CONTEXT (t
))
10328 SET_DECL_FRIEND_CONTEXT (r
,
10329 tsubst (DECL_FRIEND_CONTEXT (t
),
10330 args
, complain
, in_decl
));
10332 /* Possibly limit visibility based on template args. */
10333 DECL_VISIBILITY (r
) = VISIBILITY_DEFAULT
;
10334 if (DECL_VISIBILITY_SPECIFIED (t
))
10336 DECL_VISIBILITY_SPECIFIED (r
) = 0;
10337 DECL_ATTRIBUTES (r
)
10338 = remove_attribute ("visibility", DECL_ATTRIBUTES (r
));
10340 determine_visibility (r
);
10341 if (DECL_DEFAULTED_OUTSIDE_CLASS_P (r
)
10342 && !processing_template_decl
)
10343 defaulted_late_check (r
);
10345 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
10346 args
, complain
, in_decl
);
10352 tree type
= NULL_TREE
;
10354 tree expanded_types
= NULL_TREE
;
10355 tree prev_r
= NULL_TREE
;
10356 tree first_r
= NULL_TREE
;
10358 if (FUNCTION_PARAMETER_PACK_P (t
))
10360 /* If there is a local specialization that isn't a
10361 parameter pack, it means that we're doing a "simple"
10362 substitution from inside tsubst_pack_expansion. Just
10363 return the local specialization (which will be a single
10365 tree spec
= retrieve_local_specialization (t
);
10367 && TREE_CODE (spec
) == PARM_DECL
10368 && TREE_CODE (TREE_TYPE (spec
)) != TYPE_PACK_EXPANSION
)
10371 /* Expand the TYPE_PACK_EXPANSION that provides the types for
10372 the parameters in this function parameter pack. */
10373 expanded_types
= tsubst_pack_expansion (TREE_TYPE (t
), args
,
10374 complain
, in_decl
);
10375 if (TREE_CODE (expanded_types
) == TREE_VEC
)
10377 len
= TREE_VEC_LENGTH (expanded_types
);
10379 /* Zero-length parameter packs are boring. Just substitute
10382 RETURN (tsubst (TREE_CHAIN (t
), args
, complain
,
10387 /* All we did was update the type. Make a note of that. */
10388 type
= expanded_types
;
10389 expanded_types
= NULL_TREE
;
10393 /* Loop through all of the parameter's we'll build. When T is
10394 a function parameter pack, LEN is the number of expanded
10395 types in EXPANDED_TYPES; otherwise, LEN is 1. */
10397 for (i
= 0; i
< len
; ++i
)
10401 if (DECL_TEMPLATE_PARM_P (t
))
10402 SET_DECL_TEMPLATE_PARM_P (r
);
10404 if (expanded_types
)
10405 /* We're on the Ith parameter of the function parameter
10408 /* An argument of a function parameter pack is not a parameter
10410 FUNCTION_PARAMETER_PACK_P (r
) = false;
10412 /* Get the Ith type. */
10413 type
= TREE_VEC_ELT (expanded_types
, i
);
10416 /* Rename the parameter to include the index. */
10418 make_ith_pack_parameter_name (DECL_NAME (r
), i
);
10421 /* We're dealing with a normal parameter. */
10422 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
10424 type
= type_decays_to (type
);
10425 TREE_TYPE (r
) = type
;
10426 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
10428 if (DECL_INITIAL (r
))
10430 if (TREE_CODE (DECL_INITIAL (r
)) != TEMPLATE_PARM_INDEX
)
10431 DECL_INITIAL (r
) = TREE_TYPE (r
);
10433 DECL_INITIAL (r
) = tsubst (DECL_INITIAL (r
), args
,
10434 complain
, in_decl
);
10437 DECL_CONTEXT (r
) = NULL_TREE
;
10439 if (!DECL_TEMPLATE_PARM_P (r
))
10440 DECL_ARG_TYPE (r
) = type_passed_as (type
);
10442 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
10443 args
, complain
, in_decl
);
10445 /* Keep track of the first new parameter we
10446 generate. That's what will be returned to the
10451 /* Build a proper chain of parameters when substituting
10452 into a function parameter pack. */
10454 DECL_CHAIN (prev_r
) = r
;
10457 if (DECL_CHAIN (t
))
10458 DECL_CHAIN (r
) = tsubst (DECL_CHAIN (t
), args
,
10459 complain
, DECL_CHAIN (t
));
10461 /* FIRST_R contains the start of the chain we've built. */
10471 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
10472 if (type
== error_mark_node
)
10473 RETURN (error_mark_node
);
10474 TREE_TYPE (r
) = type
;
10475 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
10477 if (DECL_C_BIT_FIELD (r
))
10478 /* For bit-fields, DECL_INITIAL gives the number of bits. For
10479 non-bit-fields DECL_INITIAL is a non-static data member
10480 initializer, which gets deferred instantiation. */
10482 = tsubst_expr (DECL_INITIAL (t
), args
,
10484 /*integral_constant_expression_p=*/true);
10485 else if (DECL_INITIAL (t
))
10487 /* Set up DECL_TEMPLATE_INFO so that we can get at the
10488 NSDMI in perform_member_init. Still set DECL_INITIAL
10489 so that we know there is one. */
10490 DECL_INITIAL (r
) = void_zero_node
;
10491 gcc_assert (DECL_LANG_SPECIFIC (r
) == NULL
);
10492 retrofit_lang_decl (r
);
10493 DECL_TEMPLATE_INFO (r
) = build_template_info (t
, args
);
10495 /* We don't have to set DECL_CONTEXT here; it is set by
10496 finish_member_declaration. */
10497 DECL_CHAIN (r
) = NULL_TREE
;
10498 if (VOID_TYPE_P (type
))
10499 error ("instantiation of %q+D as type %qT", r
, type
);
10501 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
10502 args
, complain
, in_decl
);
10507 /* We reach here only for member using decls. */
10508 if (DECL_DEPENDENT_P (t
))
10510 r
= do_class_using_decl
10511 (tsubst_copy (USING_DECL_SCOPE (t
), args
, complain
, in_decl
),
10512 tsubst_copy (DECL_NAME (t
), args
, complain
, in_decl
));
10514 r
= error_mark_node
;
10517 TREE_PROTECTED (r
) = TREE_PROTECTED (t
);
10518 TREE_PRIVATE (r
) = TREE_PRIVATE (t
);
10524 DECL_CHAIN (r
) = NULL_TREE
;
10531 tree argvec
= NULL_TREE
;
10532 tree gen_tmpl
= NULL_TREE
;
10534 tree tmpl
= NULL_TREE
;
10536 tree type
= NULL_TREE
;
10539 if (TREE_CODE (t
) == TYPE_DECL
10540 && t
== TYPE_MAIN_DECL (TREE_TYPE (t
)))
10542 /* If this is the canonical decl, we don't have to
10543 mess with instantiations, and often we can't (for
10544 typename, template type parms and such). Note that
10545 TYPE_NAME is not correct for the above test if
10546 we've copied the type for a typedef. */
10547 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
10548 if (type
== error_mark_node
)
10549 RETURN (error_mark_node
);
10550 r
= TYPE_NAME (type
);
10554 /* Check to see if we already have the specialization we
10557 if (DECL_CLASS_SCOPE_P (t
) || DECL_NAMESPACE_SCOPE_P (t
))
10559 /* T is a static data member or namespace-scope entity.
10560 We have to substitute into namespace-scope variables
10561 (even though such entities are never templates) because
10564 template <class T> void f() { extern T t; }
10566 where the entity referenced is not known until
10567 instantiation time. */
10569 ctx
= DECL_CONTEXT (t
);
10570 if (DECL_CLASS_SCOPE_P (t
))
10572 ctx
= tsubst_aggr_type (ctx
, args
,
10574 in_decl
, /*entering_scope=*/1);
10575 /* If CTX is unchanged, then T is in fact the
10576 specialization we want. That situation occurs when
10577 referencing a static data member within in its own
10578 class. We can use pointer equality, rather than
10579 same_type_p, because DECL_CONTEXT is always
10581 if (ctx
== DECL_CONTEXT (t
)
10582 && (TREE_CODE (t
) != TYPE_DECL
10583 /* ... unless T is a member template; in which
10584 case our caller can be willing to create a
10585 specialization of that template represented
10587 || !(DECL_TI_TEMPLATE (t
)
10588 && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (t
)))))
10594 tmpl
= DECL_TI_TEMPLATE (t
);
10595 gen_tmpl
= most_general_template (tmpl
);
10596 argvec
= tsubst (DECL_TI_ARGS (t
), args
, complain
, in_decl
);
10597 hash
= hash_tmpl_and_args (gen_tmpl
, argvec
);
10598 spec
= retrieve_specialization (gen_tmpl
, argvec
, hash
);
10603 /* A local variable. */
10605 /* Subsequent calls to pushdecl will fill this in. */
10607 spec
= retrieve_local_specialization (t
);
10609 /* If we already have the specialization we need, there is
10610 nothing more to do. */
10617 /* Create a new node for the specialization we need. */
10619 if (type
== NULL_TREE
)
10621 if (is_typedef_decl (t
))
10622 type
= DECL_ORIGINAL_TYPE (t
);
10624 type
= TREE_TYPE (t
);
10625 if (TREE_CODE (t
) == VAR_DECL
10626 && VAR_HAD_UNKNOWN_BOUND (t
)
10627 && type
!= error_mark_node
)
10628 type
= strip_array_domain (type
);
10629 type
= tsubst (type
, args
, complain
, in_decl
);
10631 if (TREE_CODE (r
) == VAR_DECL
)
10633 /* Even if the original location is out of scope, the
10634 newly substituted one is not. */
10635 DECL_DEAD_FOR_LOCAL (r
) = 0;
10636 DECL_INITIALIZED_P (r
) = 0;
10637 DECL_TEMPLATE_INSTANTIATED (r
) = 0;
10638 if (type
== error_mark_node
)
10639 RETURN (error_mark_node
);
10640 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10642 /* It may seem that this case cannot occur, since:
10647 declares a function, not a variable. However:
10650 template <typename T> void g() { T t; }
10651 template void g<f>();
10653 is an attempt to declare a variable with function
10655 error ("variable %qD has function type",
10656 /* R is not yet sufficiently initialized, so we
10657 just use its name. */
10659 RETURN (error_mark_node
);
10661 type
= complete_type (type
);
10662 /* Wait until cp_finish_decl to set this again, to handle
10663 circular dependency (template/instantiate6.C). */
10664 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r
) = 0;
10665 type
= check_var_type (DECL_NAME (r
), type
);
10667 if (DECL_HAS_VALUE_EXPR_P (t
))
10669 tree ve
= DECL_VALUE_EXPR (t
);
10670 ve
= tsubst_expr (ve
, args
, complain
, in_decl
,
10671 /*constant_expression_p=*/false);
10672 if (REFERENCE_REF_P (ve
))
10674 gcc_assert (TREE_CODE (type
) == REFERENCE_TYPE
);
10675 ve
= TREE_OPERAND (ve
, 0);
10677 SET_DECL_VALUE_EXPR (r
, ve
);
10680 else if (DECL_SELF_REFERENCE_P (t
))
10681 SET_DECL_SELF_REFERENCE_P (r
);
10682 TREE_TYPE (r
) = type
;
10683 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
10684 DECL_CONTEXT (r
) = ctx
;
10685 /* Clear out the mangled name and RTL for the instantiation. */
10686 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
10687 if (CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_DECL_WRTL
))
10688 SET_DECL_RTL (r
, NULL
);
10689 /* The initializer must not be expanded until it is required;
10690 see [temp.inst]. */
10691 DECL_INITIAL (r
) = NULL_TREE
;
10692 if (CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_DECL_WRTL
))
10693 SET_DECL_RTL (r
, NULL
);
10694 DECL_SIZE (r
) = DECL_SIZE_UNIT (r
) = 0;
10695 if (TREE_CODE (r
) == VAR_DECL
)
10697 /* Possibly limit visibility based on template args. */
10698 DECL_VISIBILITY (r
) = VISIBILITY_DEFAULT
;
10699 if (DECL_VISIBILITY_SPECIFIED (t
))
10701 DECL_VISIBILITY_SPECIFIED (r
) = 0;
10702 DECL_ATTRIBUTES (r
)
10703 = remove_attribute ("visibility", DECL_ATTRIBUTES (r
));
10705 determine_visibility (r
);
10710 /* A static data member declaration is always marked
10711 external when it is declared in-class, even if an
10712 initializer is present. We mimic the non-template
10713 processing here. */
10714 DECL_EXTERNAL (r
) = 1;
10716 register_specialization (r
, gen_tmpl
, argvec
, false, hash
);
10717 DECL_TEMPLATE_INFO (r
) = build_template_info (tmpl
, argvec
);
10718 SET_DECL_IMPLICIT_INSTANTIATION (r
);
10720 else if (cp_unevaluated_operand
)
10722 /* We're substituting this var in a decltype outside of its
10723 scope, such as for a lambda return type. Don't add it to
10724 local_specializations, do perform auto deduction. */
10725 tree auto_node
= type_uses_auto (type
);
10729 = tsubst_expr (DECL_INITIAL (t
), args
, complain
, in_decl
,
10730 /*constant_expression_p=*/false);
10731 init
= resolve_nondeduced_context (init
);
10732 TREE_TYPE (r
) = type
10733 = do_auto_deduction (type
, init
, auto_node
);
10737 register_local_specialization (r
, t
);
10739 DECL_CHAIN (r
) = NULL_TREE
;
10741 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
),
10743 args
, complain
, in_decl
);
10745 /* Preserve a typedef that names a type. */
10746 if (is_typedef_decl (r
))
10748 DECL_ORIGINAL_TYPE (r
) = NULL_TREE
;
10749 set_underlying_type (r
);
10752 layout_decl (r
, 0);
10757 gcc_unreachable ();
10762 /* Restore the file and line information. */
10763 input_location
= saved_loc
;
10768 /* Substitute into the ARG_TYPES of a function type. */
10771 tsubst_arg_types (tree arg_types
,
10773 tsubst_flags_t complain
,
10776 tree remaining_arg_types
;
10777 tree type
= NULL_TREE
;
10779 tree expanded_args
= NULL_TREE
;
10782 if (!arg_types
|| arg_types
== void_list_node
)
10785 remaining_arg_types
= tsubst_arg_types (TREE_CHAIN (arg_types
),
10786 args
, complain
, in_decl
);
10787 if (remaining_arg_types
== error_mark_node
)
10788 return error_mark_node
;
10790 if (PACK_EXPANSION_P (TREE_VALUE (arg_types
)))
10792 /* For a pack expansion, perform substitution on the
10793 entire expression. Later on, we'll handle the arguments
10795 expanded_args
= tsubst_pack_expansion (TREE_VALUE (arg_types
),
10796 args
, complain
, in_decl
);
10798 if (TREE_CODE (expanded_args
) == TREE_VEC
)
10799 /* So that we'll spin through the parameters, one by one. */
10800 i
= TREE_VEC_LENGTH (expanded_args
);
10803 /* We only partially substituted into the parameter
10804 pack. Our type is TYPE_PACK_EXPANSION. */
10805 type
= expanded_args
;
10806 expanded_args
= NULL_TREE
;
10814 type
= TREE_VEC_ELT (expanded_args
, i
);
10816 type
= tsubst (TREE_VALUE (arg_types
), args
, complain
, in_decl
);
10818 if (type
== error_mark_node
)
10819 return error_mark_node
;
10820 if (VOID_TYPE_P (type
))
10822 if (complain
& tf_error
)
10824 error ("invalid parameter type %qT", type
);
10826 error ("in declaration %q+D", in_decl
);
10828 return error_mark_node
;
10831 /* Do array-to-pointer, function-to-pointer conversion, and ignore
10832 top-level qualifiers as required. */
10833 type
= cv_unqualified (type_decays_to (type
));
10835 /* We do not substitute into default arguments here. The standard
10836 mandates that they be instantiated only when needed, which is
10837 done in build_over_call. */
10838 default_arg
= TREE_PURPOSE (arg_types
);
10840 if (default_arg
&& TREE_CODE (default_arg
) == DEFAULT_ARG
)
10842 /* We've instantiated a template before its default arguments
10843 have been parsed. This can happen for a nested template
10844 class, and is not an error unless we require the default
10845 argument in a call of this function. */
10846 remaining_arg_types
=
10847 tree_cons (default_arg
, type
, remaining_arg_types
);
10848 VEC_safe_push (tree
, gc
, DEFARG_INSTANTIATIONS (default_arg
),
10849 remaining_arg_types
);
10852 remaining_arg_types
=
10853 hash_tree_cons (default_arg
, type
, remaining_arg_types
);
10856 return remaining_arg_types
;
10859 /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does
10860 *not* handle the exception-specification for FNTYPE, because the
10861 initial substitution of explicitly provided template parameters
10862 during argument deduction forbids substitution into the
10863 exception-specification:
10867 All references in the function type of the function template to the
10868 corresponding template parameters are replaced by the specified tem-
10869 plate argument values. If a substitution in a template parameter or
10870 in the function type of the function template results in an invalid
10871 type, type deduction fails. [Note: The equivalent substitution in
10872 exception specifications is done only when the function is instanti-
10873 ated, at which point a program is ill-formed if the substitution
10874 results in an invalid type.] */
10877 tsubst_function_type (tree t
,
10879 tsubst_flags_t complain
,
10886 /* The TYPE_CONTEXT is not used for function/method types. */
10887 gcc_assert (TYPE_CONTEXT (t
) == NULL_TREE
);
10889 /* Substitute the return type. */
10890 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
10891 if (return_type
== error_mark_node
)
10892 return error_mark_node
;
10893 /* The standard does not presently indicate that creation of a
10894 function type with an invalid return type is a deduction failure.
10895 However, that is clearly analogous to creating an array of "void"
10896 or a reference to a reference. This is core issue #486. */
10897 if (TREE_CODE (return_type
) == ARRAY_TYPE
10898 || TREE_CODE (return_type
) == FUNCTION_TYPE
)
10900 if (complain
& tf_error
)
10902 if (TREE_CODE (return_type
) == ARRAY_TYPE
)
10903 error ("function returning an array");
10905 error ("function returning a function");
10907 return error_mark_node
;
10910 /* Substitute the argument types. */
10911 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
,
10912 complain
, in_decl
);
10913 if (arg_types
== error_mark_node
)
10914 return error_mark_node
;
10916 /* Construct a new type node and return it. */
10917 if (TREE_CODE (t
) == FUNCTION_TYPE
)
10919 fntype
= build_function_type (return_type
, arg_types
);
10920 fntype
= apply_memfn_quals (fntype
, type_memfn_quals (t
));
10924 tree r
= TREE_TYPE (TREE_VALUE (arg_types
));
10925 if (! MAYBE_CLASS_TYPE_P (r
))
10929 Type deduction may fail for any of the following
10932 -- Attempting to create "pointer to member of T" when T
10933 is not a class type. */
10934 if (complain
& tf_error
)
10935 error ("creating pointer to member function of non-class type %qT",
10937 return error_mark_node
;
10940 fntype
= build_method_type_directly (r
, return_type
,
10941 TREE_CHAIN (arg_types
));
10943 fntype
= cp_build_type_attribute_variant (fntype
, TYPE_ATTRIBUTES (t
));
10948 /* FNTYPE is a FUNCTION_TYPE or METHOD_TYPE. Substitute the template
10949 ARGS into that specification, and return the substituted
10950 specification. If there is no specification, return NULL_TREE. */
10953 tsubst_exception_specification (tree fntype
,
10955 tsubst_flags_t complain
,
10962 specs
= TYPE_RAISES_EXCEPTIONS (fntype
);
10963 new_specs
= NULL_TREE
;
10964 if (specs
&& TREE_PURPOSE (specs
))
10966 /* A noexcept-specifier. */
10967 tree expr
= TREE_PURPOSE (specs
);
10968 if (expr
== boolean_true_node
|| expr
== boolean_false_node
)
10972 /* Defer instantiation of noexcept-specifiers to avoid
10973 excessive instantiations (c++/49107). */
10974 new_specs
= make_node (DEFERRED_NOEXCEPT
);
10975 if (DEFERRED_NOEXCEPT_SPEC_P (specs
))
10977 /* We already partially instantiated this member template,
10978 so combine the new args with the old. */
10979 DEFERRED_NOEXCEPT_PATTERN (new_specs
)
10980 = DEFERRED_NOEXCEPT_PATTERN (expr
);
10981 DEFERRED_NOEXCEPT_ARGS (new_specs
)
10982 = add_to_template_args (DEFERRED_NOEXCEPT_ARGS (expr
), args
);
10986 DEFERRED_NOEXCEPT_PATTERN (new_specs
) = expr
;
10987 DEFERRED_NOEXCEPT_ARGS (new_specs
) = args
;
10991 new_specs
= tsubst_copy_and_build
10992 (expr
, args
, complain
, in_decl
, /*function_p=*/false,
10993 /*integral_constant_expression_p=*/true);
10994 new_specs
= build_noexcept_spec (new_specs
, complain
);
10998 if (! TREE_VALUE (specs
))
11005 tree expanded_specs
= NULL_TREE
;
11007 if (PACK_EXPANSION_P (TREE_VALUE (specs
)))
11009 /* Expand the pack expansion type. */
11010 expanded_specs
= tsubst_pack_expansion (TREE_VALUE (specs
),
11014 if (expanded_specs
== error_mark_node
)
11015 return error_mark_node
;
11016 else if (TREE_CODE (expanded_specs
) == TREE_VEC
)
11017 len
= TREE_VEC_LENGTH (expanded_specs
);
11020 /* We're substituting into a member template, so
11021 we got a TYPE_PACK_EXPANSION back. Add that
11022 expansion and move on. */
11023 gcc_assert (TREE_CODE (expanded_specs
)
11024 == TYPE_PACK_EXPANSION
);
11025 new_specs
= add_exception_specifier (new_specs
,
11028 specs
= TREE_CHAIN (specs
);
11033 for (i
= 0; i
< len
; ++i
)
11035 if (expanded_specs
)
11036 spec
= TREE_VEC_ELT (expanded_specs
, i
);
11038 spec
= tsubst (TREE_VALUE (specs
), args
, complain
, in_decl
);
11039 if (spec
== error_mark_node
)
11041 new_specs
= add_exception_specifier (new_specs
, spec
,
11045 specs
= TREE_CHAIN (specs
);
11051 /* Take the tree structure T and replace template parameters used
11052 therein with the argument vector ARGS. IN_DECL is an associated
11053 decl for diagnostics. If an error occurs, returns ERROR_MARK_NODE.
11054 Issue error and warning messages under control of COMPLAIN. Note
11055 that we must be relatively non-tolerant of extensions here, in
11056 order to preserve conformance; if we allow substitutions that
11057 should not be allowed, we may allow argument deductions that should
11058 not succeed, and therefore report ambiguous overload situations
11059 where there are none. In theory, we could allow the substitution,
11060 but indicate that it should have failed, and allow our caller to
11061 make sure that the right thing happens, but we don't try to do this
11064 This function is used for dealing with types, decls and the like;
11065 for expressions, use tsubst_expr or tsubst_copy. */
11068 tsubst (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
11070 enum tree_code code
;
11071 tree type
, r
= NULL_TREE
;
11073 if (t
== NULL_TREE
|| t
== error_mark_node
11074 || t
== integer_type_node
11075 || t
== void_type_node
11076 || t
== char_type_node
11077 || t
== unknown_type_node
11078 || TREE_CODE (t
) == NAMESPACE_DECL
11079 || TREE_CODE (t
) == TRANSLATION_UNIT_DECL
)
11083 return tsubst_decl (t
, args
, complain
);
11085 if (args
== NULL_TREE
)
11088 code
= TREE_CODE (t
);
11090 if (code
== IDENTIFIER_NODE
)
11091 type
= IDENTIFIER_TYPE_VALUE (t
);
11093 type
= TREE_TYPE (t
);
11095 gcc_assert (type
!= unknown_type_node
);
11097 /* Reuse typedefs. We need to do this to handle dependent attributes,
11098 such as attribute aligned. */
11100 && typedef_variant_p (t
))
11102 tree decl
= TYPE_NAME (t
);
11104 if (TYPE_DECL_ALIAS_P (decl
)
11105 && DECL_LANG_SPECIFIC (decl
)
11106 && DECL_TEMPLATE_INFO (decl
)
11107 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl
)))
11109 /* DECL represents an alias template and we want to
11110 instantiate it. Let's substitute our arguments for the
11111 template parameters into the declaration and get the
11113 r
= tsubst (decl
, args
, complain
, decl
);
11115 else if (DECL_CLASS_SCOPE_P (decl
)
11116 && CLASSTYPE_TEMPLATE_INFO (DECL_CONTEXT (decl
))
11117 && uses_template_parms (DECL_CONTEXT (decl
)))
11119 tree tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
11120 tree gen_args
= tsubst (DECL_TI_ARGS (decl
), args
, complain
, in_decl
);
11121 r
= retrieve_specialization (tmpl
, gen_args
, 0);
11123 else if (DECL_FUNCTION_SCOPE_P (decl
)
11124 && DECL_TEMPLATE_INFO (DECL_CONTEXT (decl
))
11125 && uses_template_parms (DECL_TI_ARGS (DECL_CONTEXT (decl
))))
11126 r
= retrieve_local_specialization (decl
);
11128 /* The typedef is from a non-template context. */
11134 r
= cp_build_qualified_type_real
11135 (r
, cp_type_quals (t
) | cp_type_quals (r
),
11136 complain
| tf_ignore_bad_quals
);
11139 /* Else we must be instantiating the typedef, so fall through. */
11143 && code
!= TYPENAME_TYPE
11144 && code
!= TEMPLATE_TYPE_PARM
11145 && code
!= IDENTIFIER_NODE
11146 && code
!= FUNCTION_TYPE
11147 && code
!= METHOD_TYPE
)
11148 type
= tsubst (type
, args
, complain
, in_decl
);
11149 if (type
== error_mark_node
)
11150 return error_mark_node
;
11156 case ENUMERAL_TYPE
:
11157 return tsubst_aggr_type (t
, args
, complain
, in_decl
,
11158 /*entering_scope=*/0);
11161 case IDENTIFIER_NODE
:
11172 if (t
== integer_type_node
)
11175 if (TREE_CODE (TYPE_MIN_VALUE (t
)) == INTEGER_CST
11176 && TREE_CODE (TYPE_MAX_VALUE (t
)) == INTEGER_CST
)
11180 tree max
, omax
= TREE_OPERAND (TYPE_MAX_VALUE (t
), 0);
11182 max
= tsubst_expr (omax
, args
, complain
, in_decl
,
11183 /*integral_constant_expression_p=*/false);
11185 /* Fix up type of the magic NOP_EXPR with TREE_SIDE_EFFECTS if
11187 if (TREE_CODE (max
) == NOP_EXPR
11188 && TREE_SIDE_EFFECTS (omax
)
11189 && !TREE_TYPE (max
))
11190 TREE_TYPE (max
) = TREE_TYPE (TREE_OPERAND (max
, 0));
11192 /* If we're in a partial instantiation, preserve the magic NOP_EXPR
11193 with TREE_SIDE_EFFECTS that indicates this is not an integral
11194 constant expression. */
11195 if (processing_template_decl
11196 && TREE_SIDE_EFFECTS (omax
) && TREE_CODE (omax
) == NOP_EXPR
)
11198 gcc_assert (TREE_CODE (max
) == NOP_EXPR
);
11199 TREE_SIDE_EFFECTS (max
) = 1;
11202 return compute_array_index_type (NULL_TREE
, max
, complain
);
11205 case TEMPLATE_TYPE_PARM
:
11206 case TEMPLATE_TEMPLATE_PARM
:
11207 case BOUND_TEMPLATE_TEMPLATE_PARM
:
11208 case TEMPLATE_PARM_INDEX
:
11213 tree arg
= NULL_TREE
;
11217 gcc_assert (TREE_VEC_LENGTH (args
) > 0);
11218 template_parm_level_and_index (t
, &level
, &idx
);
11220 levels
= TMPL_ARGS_DEPTH (args
);
11221 if (level
<= levels
)
11223 arg
= TMPL_ARG (args
, level
, idx
);
11225 if (arg
&& TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
11226 /* See through ARGUMENT_PACK_SELECT arguments. */
11227 arg
= ARGUMENT_PACK_SELECT_ARG (arg
);
11230 if (arg
== error_mark_node
)
11231 return error_mark_node
;
11232 else if (arg
!= NULL_TREE
)
11234 if (ARGUMENT_PACK_P (arg
))
11235 /* If ARG is an argument pack, we don't actually want to
11236 perform a substitution here, because substitutions
11237 for argument packs are only done
11238 element-by-element. We can get to this point when
11239 substituting the type of a non-type template
11240 parameter pack, when that type actually contains
11241 template parameter packs from an outer template, e.g.,
11243 template<typename... Types> struct A {
11244 template<Types... Values> struct B { };
11248 if (code
== TEMPLATE_TYPE_PARM
)
11251 gcc_assert (TYPE_P (arg
));
11253 quals
= cp_type_quals (arg
) | cp_type_quals (t
);
11255 return cp_build_qualified_type_real
11256 (arg
, quals
, complain
| tf_ignore_bad_quals
);
11258 else if (code
== BOUND_TEMPLATE_TEMPLATE_PARM
)
11260 /* We are processing a type constructed from a
11261 template template parameter. */
11262 tree argvec
= tsubst (TYPE_TI_ARGS (t
),
11263 args
, complain
, in_decl
);
11264 if (argvec
== error_mark_node
)
11265 return error_mark_node
;
11267 gcc_assert (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
11268 || TREE_CODE (arg
) == TEMPLATE_DECL
11269 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
);
11271 if (TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
)
11272 /* Consider this code:
11274 template <template <class> class Template>
11276 template <class Arg> using Bind = Template<Arg>;
11279 template <template <class> class Template, class Arg>
11280 using Instantiate = Template<Arg>; //#0
11282 template <template <class> class Template,
11285 Instantiate<Internal<Template>::template Bind,
11288 When #1 is parsed, the
11289 BOUND_TEMPLATE_TEMPLATE_PARM representing the
11290 parameter `Template' in #0 matches the
11291 UNBOUND_CLASS_TEMPLATE representing the argument
11292 `Internal<Template>::template Bind'; We then want
11293 to assemble the type `Bind<Argument>' that can't
11294 be fully created right now, because
11295 `Internal<Template>' not being complete, the Bind
11296 template cannot be looked up in that context. So
11297 we need to "store" `Bind<Argument>' for later
11298 when the context of Bind becomes complete. Let's
11299 store that in a TYPENAME_TYPE. */
11300 return make_typename_type (TYPE_CONTEXT (arg
),
11301 build_nt (TEMPLATE_ID_EXPR
,
11302 TYPE_IDENTIFIER (arg
),
11307 /* We can get a TEMPLATE_TEMPLATE_PARM here when we
11308 are resolving nested-types in the signature of a
11309 member function templates. Otherwise ARG is a
11310 TEMPLATE_DECL and is the real template to be
11312 if (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
11313 arg
= TYPE_NAME (arg
);
11315 r
= lookup_template_class (arg
,
11317 DECL_CONTEXT (arg
),
11318 /*entering_scope=*/0,
11320 return cp_build_qualified_type_real
11321 (r
, cp_type_quals (t
), complain
);
11324 /* TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX. */
11325 return convert_from_reference (unshare_expr (arg
));
11329 /* This can happen during the attempted tsubst'ing in
11330 unify. This means that we don't yet have any information
11331 about the template parameter in question. */
11334 /* If we get here, we must have been looking at a parm for a
11335 more deeply nested template. Make a new version of this
11336 template parameter, but with a lower level. */
11339 case TEMPLATE_TYPE_PARM
:
11340 case TEMPLATE_TEMPLATE_PARM
:
11341 case BOUND_TEMPLATE_TEMPLATE_PARM
:
11342 if (cp_type_quals (t
))
11344 r
= tsubst (TYPE_MAIN_VARIANT (t
), args
, complain
, in_decl
);
11345 r
= cp_build_qualified_type_real
11346 (r
, cp_type_quals (t
),
11347 complain
| (code
== TEMPLATE_TYPE_PARM
11348 ? tf_ignore_bad_quals
: 0));
11353 TEMPLATE_TYPE_PARM_INDEX (r
)
11354 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (t
),
11355 r
, levels
, args
, complain
);
11356 TYPE_STUB_DECL (r
) = TYPE_NAME (r
) = TEMPLATE_TYPE_DECL (r
);
11357 TYPE_MAIN_VARIANT (r
) = r
;
11358 TYPE_POINTER_TO (r
) = NULL_TREE
;
11359 TYPE_REFERENCE_TO (r
) = NULL_TREE
;
11361 if (TREE_CODE (r
) == TEMPLATE_TEMPLATE_PARM
)
11362 /* We have reduced the level of the template
11363 template parameter, but not the levels of its
11364 template parameters, so canonical_type_parameter
11365 will not be able to find the canonical template
11366 template parameter for this level. Thus, we
11367 require structural equality checking to compare
11368 TEMPLATE_TEMPLATE_PARMs. */
11369 SET_TYPE_STRUCTURAL_EQUALITY (r
);
11370 else if (TYPE_STRUCTURAL_EQUALITY_P (t
))
11371 SET_TYPE_STRUCTURAL_EQUALITY (r
);
11373 TYPE_CANONICAL (r
) = canonical_type_parameter (r
);
11375 if (code
== BOUND_TEMPLATE_TEMPLATE_PARM
)
11377 tree argvec
= tsubst (TYPE_TI_ARGS (t
), args
,
11378 complain
, in_decl
);
11379 if (argvec
== error_mark_node
)
11380 return error_mark_node
;
11382 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (r
)
11383 = build_template_info (TYPE_TI_TEMPLATE (t
), argvec
);
11388 case TEMPLATE_PARM_INDEX
:
11389 r
= reduce_template_parm_level (t
, type
, levels
, args
, complain
);
11393 gcc_unreachable ();
11401 tree purpose
, value
, chain
;
11403 if (t
== void_list_node
)
11406 purpose
= TREE_PURPOSE (t
);
11409 purpose
= tsubst (purpose
, args
, complain
, in_decl
);
11410 if (purpose
== error_mark_node
)
11411 return error_mark_node
;
11413 value
= TREE_VALUE (t
);
11416 value
= tsubst (value
, args
, complain
, in_decl
);
11417 if (value
== error_mark_node
)
11418 return error_mark_node
;
11420 chain
= TREE_CHAIN (t
);
11421 if (chain
&& chain
!= void_type_node
)
11423 chain
= tsubst (chain
, args
, complain
, in_decl
);
11424 if (chain
== error_mark_node
)
11425 return error_mark_node
;
11427 if (purpose
== TREE_PURPOSE (t
)
11428 && value
== TREE_VALUE (t
)
11429 && chain
== TREE_CHAIN (t
))
11431 return hash_tree_cons (purpose
, value
, chain
);
11435 /* We should never be tsubsting a binfo. */
11436 gcc_unreachable ();
11439 /* A vector of template arguments. */
11440 gcc_assert (!type
);
11441 return tsubst_template_args (t
, args
, complain
, in_decl
);
11444 case REFERENCE_TYPE
:
11446 if (type
== TREE_TYPE (t
) && TREE_CODE (type
) != METHOD_TYPE
)
11451 Type deduction may fail for any of the following
11454 -- Attempting to create a pointer to reference type.
11455 -- Attempting to create a reference to a reference type or
11456 a reference to void.
11458 Core issue 106 says that creating a reference to a reference
11459 during instantiation is no longer a cause for failure. We
11460 only enforce this check in strict C++98 mode. */
11461 if ((TREE_CODE (type
) == REFERENCE_TYPE
11462 && (((cxx_dialect
== cxx98
) && flag_iso
) || code
!= REFERENCE_TYPE
))
11463 || (code
== REFERENCE_TYPE
&& TREE_CODE (type
) == VOID_TYPE
))
11465 static location_t last_loc
;
11467 /* We keep track of the last time we issued this error
11468 message to avoid spewing a ton of messages during a
11469 single bad template instantiation. */
11470 if (complain
& tf_error
11471 && last_loc
!= input_location
)
11473 if (TREE_CODE (type
) == VOID_TYPE
)
11474 error ("forming reference to void");
11475 else if (code
== POINTER_TYPE
)
11476 error ("forming pointer to reference type %qT", type
);
11478 error ("forming reference to reference type %qT", type
);
11479 last_loc
= input_location
;
11482 return error_mark_node
;
11484 else if (code
== POINTER_TYPE
)
11486 r
= build_pointer_type (type
);
11487 if (TREE_CODE (type
) == METHOD_TYPE
)
11488 r
= build_ptrmemfunc_type (r
);
11490 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
11491 /* In C++0x, during template argument substitution, when there is an
11492 attempt to create a reference to a reference type, reference
11493 collapsing is applied as described in [14.3.1/4 temp.arg.type]:
11495 "If a template-argument for a template-parameter T names a type
11496 that is a reference to a type A, an attempt to create the type
11497 'lvalue reference to cv T' creates the type 'lvalue reference to
11498 A,' while an attempt to create the type type rvalue reference to
11499 cv T' creates the type T"
11501 r
= cp_build_reference_type
11503 TYPE_REF_IS_RVALUE (t
) && TYPE_REF_IS_RVALUE (type
));
11505 r
= cp_build_reference_type (type
, TYPE_REF_IS_RVALUE (t
));
11506 r
= cp_build_qualified_type_real (r
, cp_type_quals (t
), complain
);
11508 if (r
!= error_mark_node
)
11509 /* Will this ever be needed for TYPE_..._TO values? */
11516 r
= tsubst (TYPE_OFFSET_BASETYPE (t
), args
, complain
, in_decl
);
11517 if (r
== error_mark_node
|| !MAYBE_CLASS_TYPE_P (r
))
11521 Type deduction may fail for any of the following
11524 -- Attempting to create "pointer to member of T" when T
11525 is not a class type. */
11526 if (complain
& tf_error
)
11527 error ("creating pointer to member of non-class type %qT", r
);
11528 return error_mark_node
;
11530 if (TREE_CODE (type
) == REFERENCE_TYPE
)
11532 if (complain
& tf_error
)
11533 error ("creating pointer to member reference type %qT", type
);
11534 return error_mark_node
;
11536 if (TREE_CODE (type
) == VOID_TYPE
)
11538 if (complain
& tf_error
)
11539 error ("creating pointer to member of type void");
11540 return error_mark_node
;
11542 gcc_assert (TREE_CODE (type
) != METHOD_TYPE
);
11543 if (TREE_CODE (type
) == FUNCTION_TYPE
)
11545 /* The type of the implicit object parameter gets its
11546 cv-qualifiers from the FUNCTION_TYPE. */
11548 tree method_type
= build_memfn_type (type
, r
, type_memfn_quals (type
));
11549 memptr
= build_ptrmemfunc_type (build_pointer_type (method_type
));
11550 return cp_build_qualified_type_real (memptr
, cp_type_quals (t
),
11554 return cp_build_qualified_type_real (build_ptrmem_type (r
, type
),
11558 case FUNCTION_TYPE
:
11563 fntype
= tsubst_function_type (t
, args
, complain
, in_decl
);
11564 if (fntype
== error_mark_node
)
11565 return error_mark_node
;
11567 /* Substitute the exception specification. */
11568 specs
= tsubst_exception_specification (t
, args
, complain
,
11569 in_decl
, /*defer_ok*/true);
11570 if (specs
== error_mark_node
)
11571 return error_mark_node
;
11573 fntype
= build_exception_variant (fntype
, specs
);
11578 tree domain
= tsubst (TYPE_DOMAIN (t
), args
, complain
, in_decl
);
11579 if (domain
== error_mark_node
)
11580 return error_mark_node
;
11582 /* As an optimization, we avoid regenerating the array type if
11583 it will obviously be the same as T. */
11584 if (type
== TREE_TYPE (t
) && domain
== TYPE_DOMAIN (t
))
11587 /* These checks should match the ones in grokdeclarator.
11591 The deduction may fail for any of the following reasons:
11593 -- Attempting to create an array with an element type that
11594 is void, a function type, or a reference type, or [DR337]
11595 an abstract class type. */
11596 if (TREE_CODE (type
) == VOID_TYPE
11597 || TREE_CODE (type
) == FUNCTION_TYPE
11598 || TREE_CODE (type
) == REFERENCE_TYPE
)
11600 if (complain
& tf_error
)
11601 error ("creating array of %qT", type
);
11602 return error_mark_node
;
11604 if (CLASS_TYPE_P (type
) && CLASSTYPE_PURE_VIRTUALS (type
))
11606 if (complain
& tf_error
)
11607 error ("creating array of %qT, which is an abstract class type",
11609 return error_mark_node
;
11612 r
= build_cplus_array_type (type
, domain
);
11614 if (TYPE_USER_ALIGN (t
))
11616 TYPE_ALIGN (r
) = TYPE_ALIGN (t
);
11617 TYPE_USER_ALIGN (r
) = 1;
11623 case TYPENAME_TYPE
:
11625 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
11626 in_decl
, /*entering_scope=*/1);
11627 tree f
= tsubst_copy (TYPENAME_TYPE_FULLNAME (t
), args
,
11628 complain
, in_decl
);
11630 if (ctx
== error_mark_node
|| f
== error_mark_node
)
11631 return error_mark_node
;
11633 if (!MAYBE_CLASS_TYPE_P (ctx
))
11635 if (complain
& tf_error
)
11636 error ("%qT is not a class, struct, or union type", ctx
);
11637 return error_mark_node
;
11639 else if (!uses_template_parms (ctx
) && !TYPE_BEING_DEFINED (ctx
))
11641 /* Normally, make_typename_type does not require that the CTX
11642 have complete type in order to allow things like:
11644 template <class T> struct S { typename S<T>::X Y; };
11646 But, such constructs have already been resolved by this
11647 point, so here CTX really should have complete type, unless
11648 it's a partial instantiation. */
11649 ctx
= complete_type (ctx
);
11650 if (!COMPLETE_TYPE_P (ctx
))
11652 if (complain
& tf_error
)
11653 cxx_incomplete_type_error (NULL_TREE
, ctx
);
11654 return error_mark_node
;
11658 f
= make_typename_type (ctx
, f
, typename_type
,
11659 (complain
& tf_error
) | tf_keep_type_decl
);
11660 if (f
== error_mark_node
)
11662 if (TREE_CODE (f
) == TYPE_DECL
)
11664 complain
|= tf_ignore_bad_quals
;
11668 if (TREE_CODE (f
) != TYPENAME_TYPE
)
11670 if (TYPENAME_IS_ENUM_P (t
) && TREE_CODE (f
) != ENUMERAL_TYPE
)
11672 if (complain
& tf_error
)
11673 error ("%qT resolves to %qT, which is not an enumeration type",
11676 return error_mark_node
;
11678 else if (TYPENAME_IS_CLASS_P (t
) && !CLASS_TYPE_P (f
))
11680 if (complain
& tf_error
)
11681 error ("%qT resolves to %qT, which is is not a class type",
11684 return error_mark_node
;
11688 return cp_build_qualified_type_real
11689 (f
, cp_type_quals (f
) | cp_type_quals (t
), complain
);
11692 case UNBOUND_CLASS_TEMPLATE
:
11694 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
11695 in_decl
, /*entering_scope=*/1);
11696 tree name
= TYPE_IDENTIFIER (t
);
11697 tree parm_list
= DECL_TEMPLATE_PARMS (TYPE_NAME (t
));
11699 if (ctx
== error_mark_node
|| name
== error_mark_node
)
11700 return error_mark_node
;
11703 parm_list
= tsubst_template_parms (parm_list
, args
, complain
);
11704 return make_unbound_class_template (ctx
, name
, parm_list
, complain
);
11711 ++cp_unevaluated_operand
;
11712 ++c_inhibit_evaluation_warnings
;
11714 type
= tsubst_expr (TYPEOF_TYPE_EXPR (t
), args
,
11716 /*integral_constant_expression_p=*/false);
11718 --cp_unevaluated_operand
;
11719 --c_inhibit_evaluation_warnings
;
11721 type
= finish_typeof (type
);
11722 return cp_build_qualified_type_real (type
,
11724 | cp_type_quals (type
),
11728 case DECLTYPE_TYPE
:
11732 ++cp_unevaluated_operand
;
11733 ++c_inhibit_evaluation_warnings
;
11735 type
= tsubst_expr (DECLTYPE_TYPE_EXPR (t
), args
,
11737 /*integral_constant_expression_p=*/false);
11739 --cp_unevaluated_operand
;
11740 --c_inhibit_evaluation_warnings
;
11742 if (DECLTYPE_FOR_LAMBDA_CAPTURE (t
))
11743 type
= lambda_capture_field_type (type
);
11744 else if (DECLTYPE_FOR_LAMBDA_PROXY (t
))
11745 type
= lambda_proxy_type (type
);
11747 type
= finish_decltype_type
11748 (type
, DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t
), complain
);
11749 return cp_build_qualified_type_real (type
,
11751 | cp_type_quals (type
),
11755 case UNDERLYING_TYPE
:
11757 tree type
= tsubst (UNDERLYING_TYPE_TYPE (t
), args
,
11758 complain
, in_decl
);
11759 return finish_underlying_type (type
);
11762 case TYPE_ARGUMENT_PACK
:
11763 case NONTYPE_ARGUMENT_PACK
:
11765 tree r
= TYPE_P (t
) ? cxx_make_type (code
) : make_node (code
);
11767 tsubst_template_args (ARGUMENT_PACK_ARGS (t
),
11771 SET_ARGUMENT_PACK_ARGS (r
, packed_out
);
11773 /* For template nontype argument packs, also substitute into
11775 if (code
== NONTYPE_ARGUMENT_PACK
)
11776 TREE_TYPE (r
) = tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11794 /* We should use one of the expression tsubsts for these codes. */
11795 gcc_unreachable ();
11798 sorry ("use of %qs in template", tree_code_name
[(int) code
]);
11799 return error_mark_node
;
11803 /* Like tsubst_expr for a BASELINK. OBJECT_TYPE, if non-NULL, is the
11804 type of the expression on the left-hand side of the "." or "->"
11808 tsubst_baselink (tree baselink
, tree object_type
,
11809 tree args
, tsubst_flags_t complain
, tree in_decl
)
11812 tree qualifying_scope
;
11815 tree template_args
= 0;
11816 bool template_id_p
= false;
11818 /* A baselink indicates a function from a base class. Both the
11819 BASELINK_ACCESS_BINFO and the base class referenced may
11820 indicate bases of the template class, rather than the
11821 instantiated class. In addition, lookups that were not
11822 ambiguous before may be ambiguous now. Therefore, we perform
11823 the lookup again. */
11824 qualifying_scope
= BINFO_TYPE (BASELINK_ACCESS_BINFO (baselink
));
11825 qualifying_scope
= tsubst (qualifying_scope
, args
,
11826 complain
, in_decl
);
11827 fns
= BASELINK_FUNCTIONS (baselink
);
11828 optype
= tsubst (BASELINK_OPTYPE (baselink
), args
, complain
, in_decl
);
11829 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
11831 template_id_p
= true;
11832 template_args
= TREE_OPERAND (fns
, 1);
11833 fns
= TREE_OPERAND (fns
, 0);
11835 template_args
= tsubst_template_args (template_args
, args
,
11836 complain
, in_decl
);
11838 name
= DECL_NAME (get_first_fn (fns
));
11839 if (IDENTIFIER_TYPENAME_P (name
))
11840 name
= mangle_conv_op_name_for_type (optype
);
11841 baselink
= lookup_fnfields (qualifying_scope
, name
, /*protect=*/1);
11843 return error_mark_node
;
11845 /* If lookup found a single function, mark it as used at this
11846 point. (If it lookup found multiple functions the one selected
11847 later by overload resolution will be marked as used at that
11849 if (BASELINK_P (baselink
))
11850 fns
= BASELINK_FUNCTIONS (baselink
);
11851 if (!template_id_p
&& !really_overloaded_fn (fns
))
11852 mark_used (OVL_CURRENT (fns
));
11854 /* Add back the template arguments, if present. */
11855 if (BASELINK_P (baselink
) && template_id_p
)
11856 BASELINK_FUNCTIONS (baselink
)
11857 = build_nt (TEMPLATE_ID_EXPR
,
11858 BASELINK_FUNCTIONS (baselink
),
11860 /* Update the conversion operator type. */
11861 BASELINK_OPTYPE (baselink
) = optype
;
11864 object_type
= current_class_type
;
11865 return adjust_result_of_qualified_name_lookup (baselink
,
11870 /* Like tsubst_expr for a SCOPE_REF, given by QUALIFIED_ID. DONE is
11871 true if the qualified-id will be a postfix-expression in-and-of
11872 itself; false if more of the postfix-expression follows the
11873 QUALIFIED_ID. ADDRESS_P is true if the qualified-id is the operand
11877 tsubst_qualified_id (tree qualified_id
, tree args
,
11878 tsubst_flags_t complain
, tree in_decl
,
11879 bool done
, bool address_p
)
11885 tree template_args
;
11887 gcc_assert (TREE_CODE (qualified_id
) == SCOPE_REF
);
11889 /* Figure out what name to look up. */
11890 name
= TREE_OPERAND (qualified_id
, 1);
11891 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
11893 is_template
= true;
11894 template_args
= TREE_OPERAND (name
, 1);
11896 template_args
= tsubst_template_args (template_args
, args
,
11897 complain
, in_decl
);
11898 name
= TREE_OPERAND (name
, 0);
11902 is_template
= false;
11903 template_args
= NULL_TREE
;
11906 /* Substitute into the qualifying scope. When there are no ARGS, we
11907 are just trying to simplify a non-dependent expression. In that
11908 case the qualifying scope may be dependent, and, in any case,
11909 substituting will not help. */
11910 scope
= TREE_OPERAND (qualified_id
, 0);
11913 scope
= tsubst (scope
, args
, complain
, in_decl
);
11914 expr
= tsubst_copy (name
, args
, complain
, in_decl
);
11919 if (dependent_scope_p (scope
))
11922 expr
= build_min_nt (TEMPLATE_ID_EXPR
, expr
, template_args
);
11923 return build_qualified_name (NULL_TREE
, scope
, expr
,
11924 QUALIFIED_NAME_IS_TEMPLATE (qualified_id
));
11927 if (!BASELINK_P (name
) && !DECL_P (expr
))
11929 if (TREE_CODE (expr
) == BIT_NOT_EXPR
)
11931 /* A BIT_NOT_EXPR is used to represent a destructor. */
11932 if (!check_dtor_name (scope
, TREE_OPERAND (expr
, 0)))
11934 error ("qualifying type %qT does not match destructor name ~%qT",
11935 scope
, TREE_OPERAND (expr
, 0));
11936 expr
= error_mark_node
;
11939 expr
= lookup_qualified_name (scope
, complete_dtor_identifier
,
11940 /*is_type_p=*/0, false);
11943 expr
= lookup_qualified_name (scope
, expr
, /*is_type_p=*/0, false);
11944 if (TREE_CODE (TREE_CODE (expr
) == TEMPLATE_DECL
11945 ? DECL_TEMPLATE_RESULT (expr
) : expr
) == TYPE_DECL
)
11947 if (complain
& tf_error
)
11949 error ("dependent-name %qE is parsed as a non-type, but "
11950 "instantiation yields a type", qualified_id
);
11951 inform (input_location
, "say %<typename %E%> if a type is meant", qualified_id
);
11953 return error_mark_node
;
11959 check_accessibility_of_qualified_id (expr
, /*object_type=*/NULL_TREE
,
11961 /* Remember that there was a reference to this entity. */
11965 if (expr
== error_mark_node
|| TREE_CODE (expr
) == TREE_LIST
)
11967 if (complain
& tf_error
)
11968 qualified_name_lookup_error (scope
,
11969 TREE_OPERAND (qualified_id
, 1),
11970 expr
, input_location
);
11971 return error_mark_node
;
11975 expr
= lookup_template_function (expr
, template_args
);
11977 if (expr
== error_mark_node
&& complain
& tf_error
)
11978 qualified_name_lookup_error (scope
, TREE_OPERAND (qualified_id
, 1),
11979 expr
, input_location
);
11980 else if (TYPE_P (scope
))
11982 expr
= (adjust_result_of_qualified_name_lookup
11983 (expr
, scope
, current_class_type
));
11984 expr
= (finish_qualified_id_expr
11985 (scope
, expr
, done
, address_p
&& PTRMEM_OK_P (qualified_id
),
11986 QUALIFIED_NAME_IS_TEMPLATE (qualified_id
),
11987 /*template_arg_p=*/false));
11990 /* Expressions do not generally have reference type. */
11991 if (TREE_CODE (expr
) != SCOPE_REF
11992 /* However, if we're about to form a pointer-to-member, we just
11993 want the referenced member referenced. */
11994 && TREE_CODE (expr
) != OFFSET_REF
)
11995 expr
= convert_from_reference (expr
);
12000 /* Like tsubst, but deals with expressions. This function just replaces
12001 template parms; to finish processing the resultant expression, use
12002 tsubst_copy_and_build or tsubst_expr. */
12005 tsubst_copy (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
12007 enum tree_code code
;
12010 if (t
== NULL_TREE
|| t
== error_mark_node
|| args
== NULL_TREE
)
12013 code
= TREE_CODE (t
);
12018 r
= retrieve_local_specialization (t
);
12024 /* We get here for a use of 'this' in an NSDMI. */
12025 if (DECL_NAME (t
) == this_identifier
12026 && at_function_scope_p ()
12027 && DECL_CONSTRUCTOR_P (current_function_decl
))
12028 return current_class_ptr
;
12030 /* This can happen for a parameter name used later in a function
12031 declaration (such as in a late-specified return type). Just
12032 make a dummy decl, since it's only used for its type. */
12033 gcc_assert (cp_unevaluated_operand
!= 0);
12034 /* We copy T because want to tsubst the PARM_DECL only,
12035 not the following PARM_DECLs that are chained to T. */
12037 r
= tsubst_decl (c
, args
, complain
);
12038 /* Give it the template pattern as its context; its true context
12039 hasn't been instantiated yet and this is good enough for
12041 DECL_CONTEXT (r
) = DECL_CONTEXT (t
);
12044 if (TREE_CODE (r
) == ARGUMENT_PACK_SELECT
)
12045 r
= ARGUMENT_PACK_SELECT_ARG (r
);
12054 if (DECL_TEMPLATE_PARM_P (t
))
12055 return tsubst_copy (DECL_INITIAL (t
), args
, complain
, in_decl
);
12056 /* There is no need to substitute into namespace-scope
12058 if (DECL_NAMESPACE_SCOPE_P (t
))
12060 /* If ARGS is NULL, then T is known to be non-dependent. */
12061 if (args
== NULL_TREE
)
12062 return integral_constant_value (t
);
12064 /* Unfortunately, we cannot just call lookup_name here.
12067 template <int I> int f() {
12069 struct S { void g() { E e = a; } };
12072 When we instantiate f<7>::S::g(), say, lookup_name is not
12073 clever enough to find f<7>::a. */
12075 = tsubst_aggr_type (TREE_TYPE (t
), args
, complain
, in_decl
,
12076 /*entering_scope=*/0);
12078 for (v
= TYPE_VALUES (enum_type
);
12080 v
= TREE_CHAIN (v
))
12081 if (TREE_PURPOSE (v
) == DECL_NAME (t
))
12082 return TREE_VALUE (v
);
12084 /* We didn't find the name. That should never happen; if
12085 name-lookup found it during preliminary parsing, we
12086 should find it again here during instantiation. */
12087 gcc_unreachable ();
12092 if (DECL_CONTEXT (t
))
12096 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
12097 /*entering_scope=*/1);
12098 if (ctx
!= DECL_CONTEXT (t
))
12100 tree r
= lookup_field (ctx
, DECL_NAME (t
), 0, false);
12103 if (complain
& tf_error
)
12104 error ("using invalid field %qD", t
);
12105 return error_mark_node
;
12114 case FUNCTION_DECL
:
12115 if ((DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
))
12116 || local_variable_p (t
))
12117 t
= tsubst (t
, args
, complain
, in_decl
);
12121 case NAMESPACE_DECL
:
12125 /* An OVERLOAD will always be a non-dependent overload set; an
12126 overload set from function scope will just be represented with an
12127 IDENTIFIER_NODE, and from class scope with a BASELINK. */
12128 gcc_assert (!uses_template_parms (t
));
12132 return tsubst_baselink (t
, current_class_type
, args
, complain
, in_decl
);
12134 case TEMPLATE_DECL
:
12135 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
12136 return tsubst (TREE_TYPE (DECL_TEMPLATE_RESULT (t
)),
12137 args
, complain
, in_decl
);
12138 else if (DECL_FUNCTION_TEMPLATE_P (t
) && DECL_MEMBER_TEMPLATE_P (t
))
12139 return tsubst (t
, args
, complain
, in_decl
);
12140 else if (DECL_CLASS_SCOPE_P (t
)
12141 && uses_template_parms (DECL_CONTEXT (t
)))
12143 /* Template template argument like the following example need
12146 template <template <class> class TT> struct C {};
12147 template <class T> struct D {
12148 template <class U> struct E {};
12153 We are processing the template argument `E' in #1 for
12154 the template instantiation #2. Originally, `E' is a
12155 TEMPLATE_DECL with `D<T>' as its DECL_CONTEXT. Now we
12156 have to substitute this with one having context `D<int>'. */
12158 tree context
= tsubst (DECL_CONTEXT (t
), args
, complain
, in_decl
);
12159 return lookup_field (context
, DECL_NAME(t
), 0, false);
12162 /* Ordinary template template argument. */
12166 case REINTERPRET_CAST_EXPR
:
12167 case CONST_CAST_EXPR
:
12168 case STATIC_CAST_EXPR
:
12169 case DYNAMIC_CAST_EXPR
:
12170 case IMPLICIT_CONV_EXPR
:
12174 (code
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
12175 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
));
12178 if (PACK_EXPANSION_P (TREE_OPERAND (t
, 0)))
12184 ++cp_unevaluated_operand
;
12185 ++c_inhibit_evaluation_warnings
;
12186 /* We only want to compute the number of arguments. */
12187 expanded
= tsubst_pack_expansion (TREE_OPERAND (t
, 0), args
,
12188 complain
, in_decl
);
12189 --cp_unevaluated_operand
;
12190 --c_inhibit_evaluation_warnings
;
12192 if (TREE_CODE (expanded
) == TREE_VEC
)
12193 len
= TREE_VEC_LENGTH (expanded
);
12195 if (expanded
== error_mark_node
)
12196 return error_mark_node
;
12197 else if (PACK_EXPANSION_P (expanded
)
12198 || (TREE_CODE (expanded
) == TREE_VEC
12200 && PACK_EXPANSION_P (TREE_VEC_ELT (expanded
, len
-1))))
12202 if (TREE_CODE (expanded
) == TREE_VEC
)
12203 expanded
= TREE_VEC_ELT (expanded
, len
- 1);
12205 if (TYPE_P (expanded
))
12206 return cxx_sizeof_or_alignof_type (expanded
, SIZEOF_EXPR
,
12207 complain
& tf_error
);
12209 return cxx_sizeof_or_alignof_expr (expanded
, SIZEOF_EXPR
,
12210 complain
& tf_error
);
12213 return build_int_cst (size_type_node
, len
);
12219 case TRUTH_NOT_EXPR
:
12222 case UNARY_PLUS_EXPR
: /* Unary + */
12224 case AT_ENCODE_EXPR
:
12228 case REALPART_EXPR
:
12229 case IMAGPART_EXPR
:
12231 (code
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
12232 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
));
12234 case COMPONENT_REF
:
12239 object
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
12240 name
= TREE_OPERAND (t
, 1);
12241 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
12243 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
12244 complain
, in_decl
);
12245 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
12247 else if (TREE_CODE (name
) == SCOPE_REF
12248 && TREE_CODE (TREE_OPERAND (name
, 1)) == BIT_NOT_EXPR
)
12250 tree base
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
12251 complain
, in_decl
);
12252 name
= TREE_OPERAND (name
, 1);
12253 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
12254 complain
, in_decl
);
12255 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
12256 name
= build_qualified_name (/*type=*/NULL_TREE
,
12258 /*template_p=*/false);
12260 else if (BASELINK_P (name
))
12261 name
= tsubst_baselink (name
,
12262 non_reference (TREE_TYPE (object
)),
12266 name
= tsubst_copy (name
, args
, complain
, in_decl
);
12267 return build_nt (COMPONENT_REF
, object
, name
, NULL_TREE
);
12273 case TRUNC_DIV_EXPR
:
12274 case CEIL_DIV_EXPR
:
12275 case FLOOR_DIV_EXPR
:
12276 case ROUND_DIV_EXPR
:
12277 case EXACT_DIV_EXPR
:
12281 case TRUNC_MOD_EXPR
:
12282 case FLOOR_MOD_EXPR
:
12283 case TRUTH_ANDIF_EXPR
:
12284 case TRUTH_ORIF_EXPR
:
12285 case TRUTH_AND_EXPR
:
12286 case TRUTH_OR_EXPR
:
12299 case COMPOUND_EXPR
:
12302 case PREDECREMENT_EXPR
:
12303 case PREINCREMENT_EXPR
:
12304 case POSTDECREMENT_EXPR
:
12305 case POSTINCREMENT_EXPR
:
12307 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
12308 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
));
12311 return build_qualified_name (/*type=*/NULL_TREE
,
12312 tsubst_copy (TREE_OPERAND (t
, 0),
12313 args
, complain
, in_decl
),
12314 tsubst_copy (TREE_OPERAND (t
, 1),
12315 args
, complain
, in_decl
),
12316 QUALIFIED_NAME_IS_TEMPLATE (t
));
12321 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
12322 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
),
12323 NULL_TREE
, NULL_TREE
);
12327 int n
= VL_EXP_OPERAND_LENGTH (t
);
12328 tree result
= build_vl_exp (CALL_EXPR
, n
);
12330 for (i
= 0; i
< n
; i
++)
12331 TREE_OPERAND (t
, i
) = tsubst_copy (TREE_OPERAND (t
, i
), args
,
12332 complain
, in_decl
);
12338 case PSEUDO_DTOR_EXPR
:
12341 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
12342 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
),
12343 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
));
12344 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
12351 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
12352 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
),
12353 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
));
12354 NEW_EXPR_USE_GLOBAL (r
) = NEW_EXPR_USE_GLOBAL (t
);
12361 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
12362 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
));
12363 DELETE_EXPR_USE_GLOBAL (r
) = DELETE_EXPR_USE_GLOBAL (t
);
12364 DELETE_EXPR_USE_VEC (r
) = DELETE_EXPR_USE_VEC (t
);
12368 case TEMPLATE_ID_EXPR
:
12370 /* Substituted template arguments */
12371 tree fn
= TREE_OPERAND (t
, 0);
12372 tree targs
= TREE_OPERAND (t
, 1);
12374 fn
= tsubst_copy (fn
, args
, complain
, in_decl
);
12376 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
12378 return lookup_template_function (fn
, targs
);
12383 tree purpose
, value
, chain
;
12385 if (t
== void_list_node
)
12388 purpose
= TREE_PURPOSE (t
);
12390 purpose
= tsubst_copy (purpose
, args
, complain
, in_decl
);
12391 value
= TREE_VALUE (t
);
12393 value
= tsubst_copy (value
, args
, complain
, in_decl
);
12394 chain
= TREE_CHAIN (t
);
12395 if (chain
&& chain
!= void_type_node
)
12396 chain
= tsubst_copy (chain
, args
, complain
, in_decl
);
12397 if (purpose
== TREE_PURPOSE (t
)
12398 && value
== TREE_VALUE (t
)
12399 && chain
== TREE_CHAIN (t
))
12401 return tree_cons (purpose
, value
, chain
);
12406 case ENUMERAL_TYPE
:
12408 case TEMPLATE_TYPE_PARM
:
12409 case TEMPLATE_TEMPLATE_PARM
:
12410 case BOUND_TEMPLATE_TEMPLATE_PARM
:
12411 case TEMPLATE_PARM_INDEX
:
12413 case REFERENCE_TYPE
:
12415 case FUNCTION_TYPE
:
12418 case TYPENAME_TYPE
:
12419 case UNBOUND_CLASS_TEMPLATE
:
12421 case DECLTYPE_TYPE
:
12423 return tsubst (t
, args
, complain
, in_decl
);
12425 case IDENTIFIER_NODE
:
12426 if (IDENTIFIER_TYPENAME_P (t
))
12428 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12429 return mangle_conv_op_name_for_type (new_type
);
12435 /* This is handled by tsubst_copy_and_build. */
12436 gcc_unreachable ();
12439 return build_x_va_arg (tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
,
12441 tsubst (TREE_TYPE (t
), args
, complain
, in_decl
));
12443 case CLEANUP_POINT_EXPR
:
12444 /* We shouldn't have built any of these during initial template
12445 generation. Instead, they should be built during instantiation
12446 in response to the saved STMT_IS_FULL_EXPR_P setting. */
12447 gcc_unreachable ();
12451 (code
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
12452 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
12453 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
));
12454 PTRMEM_OK_P (r
) = PTRMEM_OK_P (t
);
12455 mark_used (TREE_OPERAND (r
, 1));
12458 case EXPR_PACK_EXPANSION
:
12459 error ("invalid use of pack expansion expression");
12460 return error_mark_node
;
12462 case NONTYPE_ARGUMENT_PACK
:
12463 error ("use %<...%> to expand argument pack");
12464 return error_mark_node
;
12471 /* Instantiate any typedefs in the type. */
12472 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12473 r
= fold_convert (type
, t
);
12474 gcc_assert (TREE_CODE (r
) == code
);
12479 /* These can sometimes show up in a partial instantiation, but never
12480 involve template parms. */
12481 gcc_assert (!uses_template_parms (t
));
12485 /* We shouldn't get here, but keep going if !ENABLE_CHECKING. */
12486 gcc_checking_assert (false);
12491 /* Like tsubst_copy, but specifically for OpenMP clauses. */
12494 tsubst_omp_clauses (tree clauses
, tree args
, tsubst_flags_t complain
,
12497 tree new_clauses
= NULL
, nc
, oc
;
12499 for (oc
= clauses
; oc
; oc
= OMP_CLAUSE_CHAIN (oc
))
12501 nc
= copy_node (oc
);
12502 OMP_CLAUSE_CHAIN (nc
) = new_clauses
;
12505 switch (OMP_CLAUSE_CODE (nc
))
12507 case OMP_CLAUSE_LASTPRIVATE
:
12508 if (OMP_CLAUSE_LASTPRIVATE_STMT (oc
))
12510 OMP_CLAUSE_LASTPRIVATE_STMT (nc
) = push_stmt_list ();
12511 tsubst_expr (OMP_CLAUSE_LASTPRIVATE_STMT (oc
), args
, complain
,
12512 in_decl
, /*integral_constant_expression_p=*/false);
12513 OMP_CLAUSE_LASTPRIVATE_STMT (nc
)
12514 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (nc
));
12517 case OMP_CLAUSE_PRIVATE
:
12518 case OMP_CLAUSE_SHARED
:
12519 case OMP_CLAUSE_FIRSTPRIVATE
:
12520 case OMP_CLAUSE_REDUCTION
:
12521 case OMP_CLAUSE_COPYIN
:
12522 case OMP_CLAUSE_COPYPRIVATE
:
12523 case OMP_CLAUSE_IF
:
12524 case OMP_CLAUSE_NUM_THREADS
:
12525 case OMP_CLAUSE_SCHEDULE
:
12526 case OMP_CLAUSE_COLLAPSE
:
12527 case OMP_CLAUSE_FINAL
:
12528 OMP_CLAUSE_OPERAND (nc
, 0)
12529 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 0), args
, complain
,
12530 in_decl
, /*integral_constant_expression_p=*/false);
12532 case OMP_CLAUSE_NOWAIT
:
12533 case OMP_CLAUSE_ORDERED
:
12534 case OMP_CLAUSE_DEFAULT
:
12535 case OMP_CLAUSE_UNTIED
:
12536 case OMP_CLAUSE_MERGEABLE
:
12539 gcc_unreachable ();
12543 return finish_omp_clauses (nreverse (new_clauses
));
12546 /* Like tsubst_copy_and_build, but unshare TREE_LIST nodes. */
12549 tsubst_copy_asm_operands (tree t
, tree args
, tsubst_flags_t complain
,
12552 #define RECUR(t) tsubst_copy_asm_operands (t, args, complain, in_decl)
12554 tree purpose
, value
, chain
;
12559 if (TREE_CODE (t
) != TREE_LIST
)
12560 return tsubst_copy_and_build (t
, args
, complain
, in_decl
,
12561 /*function_p=*/false,
12562 /*integral_constant_expression_p=*/false);
12564 if (t
== void_list_node
)
12567 purpose
= TREE_PURPOSE (t
);
12569 purpose
= RECUR (purpose
);
12570 value
= TREE_VALUE (t
);
12571 if (value
&& TREE_CODE (value
) != LABEL_DECL
)
12572 value
= RECUR (value
);
12573 chain
= TREE_CHAIN (t
);
12574 if (chain
&& chain
!= void_type_node
)
12575 chain
= RECUR (chain
);
12576 return tree_cons (purpose
, value
, chain
);
12580 /* Substitute one OMP_FOR iterator. */
12583 tsubst_omp_for_iterator (tree t
, int i
, tree declv
, tree initv
,
12584 tree condv
, tree incrv
, tree
*clauses
,
12585 tree args
, tsubst_flags_t complain
, tree in_decl
,
12586 bool integral_constant_expression_p
)
12588 #define RECUR(NODE) \
12589 tsubst_expr ((NODE), args, complain, in_decl, \
12590 integral_constant_expression_p)
12591 tree decl
, init
, cond
, incr
, auto_node
;
12593 init
= TREE_VEC_ELT (OMP_FOR_INIT (t
), i
);
12594 gcc_assert (TREE_CODE (init
) == MODIFY_EXPR
);
12595 decl
= RECUR (TREE_OPERAND (init
, 0));
12596 init
= TREE_OPERAND (init
, 1);
12597 auto_node
= type_uses_auto (TREE_TYPE (decl
));
12598 if (auto_node
&& init
)
12600 tree init_expr
= init
;
12601 if (TREE_CODE (init_expr
) == DECL_EXPR
)
12602 init_expr
= DECL_INITIAL (DECL_EXPR_DECL (init_expr
));
12603 init_expr
= RECUR (init_expr
);
12605 = do_auto_deduction (TREE_TYPE (decl
), init_expr
, auto_node
);
12607 gcc_assert (!type_dependent_expression_p (decl
));
12609 if (!CLASS_TYPE_P (TREE_TYPE (decl
)))
12611 cond
= RECUR (TREE_VEC_ELT (OMP_FOR_COND (t
), i
));
12612 incr
= TREE_VEC_ELT (OMP_FOR_INCR (t
), i
);
12613 if (TREE_CODE (incr
) == MODIFY_EXPR
)
12614 incr
= build_x_modify_expr (RECUR (TREE_OPERAND (incr
, 0)), NOP_EXPR
,
12615 RECUR (TREE_OPERAND (incr
, 1)),
12618 incr
= RECUR (incr
);
12619 TREE_VEC_ELT (declv
, i
) = decl
;
12620 TREE_VEC_ELT (initv
, i
) = init
;
12621 TREE_VEC_ELT (condv
, i
) = cond
;
12622 TREE_VEC_ELT (incrv
, i
) = incr
;
12626 if (init
&& TREE_CODE (init
) != DECL_EXPR
)
12629 for (c
= *clauses
; c
; c
= OMP_CLAUSE_CHAIN (c
))
12631 if ((OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_PRIVATE
12632 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_LASTPRIVATE
)
12633 && OMP_CLAUSE_DECL (c
) == decl
)
12635 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_FIRSTPRIVATE
12636 && OMP_CLAUSE_DECL (c
) == decl
)
12637 error ("iteration variable %qD should not be firstprivate", decl
);
12638 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
12639 && OMP_CLAUSE_DECL (c
) == decl
)
12640 error ("iteration variable %qD should not be reduction", decl
);
12644 c
= build_omp_clause (input_location
, OMP_CLAUSE_PRIVATE
);
12645 OMP_CLAUSE_DECL (c
) = decl
;
12646 c
= finish_omp_clauses (c
);
12649 OMP_CLAUSE_CHAIN (c
) = *clauses
;
12654 cond
= TREE_VEC_ELT (OMP_FOR_COND (t
), i
);
12655 if (COMPARISON_CLASS_P (cond
))
12656 cond
= build2 (TREE_CODE (cond
), boolean_type_node
,
12657 RECUR (TREE_OPERAND (cond
, 0)),
12658 RECUR (TREE_OPERAND (cond
, 1)));
12660 cond
= RECUR (cond
);
12661 incr
= TREE_VEC_ELT (OMP_FOR_INCR (t
), i
);
12662 switch (TREE_CODE (incr
))
12664 case PREINCREMENT_EXPR
:
12665 case PREDECREMENT_EXPR
:
12666 case POSTINCREMENT_EXPR
:
12667 case POSTDECREMENT_EXPR
:
12668 incr
= build2 (TREE_CODE (incr
), TREE_TYPE (decl
),
12669 RECUR (TREE_OPERAND (incr
, 0)), NULL_TREE
);
12672 if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
12673 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
12675 tree rhs
= TREE_OPERAND (incr
, 1);
12676 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
),
12677 RECUR (TREE_OPERAND (incr
, 0)),
12678 build2 (TREE_CODE (rhs
), TREE_TYPE (decl
),
12679 RECUR (TREE_OPERAND (rhs
, 0)),
12680 RECUR (TREE_OPERAND (rhs
, 1))));
12683 incr
= RECUR (incr
);
12686 if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
12687 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
12689 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
12690 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
12691 build2 (TREE_CODE (TREE_OPERAND (incr
, 1)),
12692 TREE_TYPE (decl
), lhs
,
12693 RECUR (TREE_OPERAND (incr
, 2))));
12695 else if (TREE_CODE (TREE_OPERAND (incr
, 1)) == NOP_EXPR
12696 && (TREE_CODE (TREE_OPERAND (incr
, 2)) == PLUS_EXPR
12697 || (TREE_CODE (TREE_OPERAND (incr
, 2)) == MINUS_EXPR
)))
12699 tree rhs
= TREE_OPERAND (incr
, 2);
12700 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
),
12701 RECUR (TREE_OPERAND (incr
, 0)),
12702 build2 (TREE_CODE (rhs
), TREE_TYPE (decl
),
12703 RECUR (TREE_OPERAND (rhs
, 0)),
12704 RECUR (TREE_OPERAND (rhs
, 1))));
12707 incr
= RECUR (incr
);
12710 incr
= RECUR (incr
);
12714 TREE_VEC_ELT (declv
, i
) = decl
;
12715 TREE_VEC_ELT (initv
, i
) = init
;
12716 TREE_VEC_ELT (condv
, i
) = cond
;
12717 TREE_VEC_ELT (incrv
, i
) = incr
;
12721 /* Like tsubst_copy for expressions, etc. but also does semantic
12725 tsubst_expr (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
,
12726 bool integral_constant_expression_p
)
12728 #define RECUR(NODE) \
12729 tsubst_expr ((NODE), args, complain, in_decl, \
12730 integral_constant_expression_p)
12734 if (t
== NULL_TREE
|| t
== error_mark_node
)
12737 if (EXPR_HAS_LOCATION (t
))
12738 input_location
= EXPR_LOCATION (t
);
12739 if (STATEMENT_CODE_P (TREE_CODE (t
)))
12740 current_stmt_tree ()->stmts_are_full_exprs_p
= STMT_IS_FULL_EXPR_P (t
);
12742 switch (TREE_CODE (t
))
12744 case STATEMENT_LIST
:
12746 tree_stmt_iterator i
;
12747 for (i
= tsi_start (t
); !tsi_end_p (i
); tsi_next (&i
))
12748 RECUR (tsi_stmt (i
));
12752 case CTOR_INITIALIZER
:
12753 finish_mem_initializers (tsubst_initializer_list
12754 (TREE_OPERAND (t
, 0), args
));
12758 finish_return_stmt (RECUR (TREE_OPERAND (t
, 0)));
12762 tmp
= RECUR (EXPR_STMT_EXPR (t
));
12763 if (EXPR_STMT_STMT_EXPR_RESULT (t
))
12764 finish_stmt_expr_expr (tmp
, cur_stmt_expr
);
12766 finish_expr_stmt (tmp
);
12770 do_using_directive (USING_STMT_NAMESPACE (t
));
12775 tree decl
, pattern_decl
;
12778 pattern_decl
= decl
= DECL_EXPR_DECL (t
);
12779 if (TREE_CODE (decl
) == LABEL_DECL
)
12780 finish_label_decl (DECL_NAME (decl
));
12781 else if (TREE_CODE (decl
) == USING_DECL
)
12783 tree scope
= USING_DECL_SCOPE (decl
);
12784 tree name
= DECL_NAME (decl
);
12787 scope
= tsubst (scope
, args
, complain
, in_decl
);
12788 decl
= lookup_qualified_name (scope
, name
,
12789 /*is_type_p=*/false,
12790 /*complain=*/false);
12791 if (decl
== error_mark_node
|| TREE_CODE (decl
) == TREE_LIST
)
12792 qualified_name_lookup_error (scope
, name
, decl
, input_location
);
12794 do_local_using_decl (decl
, scope
, name
);
12798 init
= DECL_INITIAL (decl
);
12799 decl
= tsubst (decl
, args
, complain
, in_decl
);
12800 if (decl
!= error_mark_node
)
12802 /* By marking the declaration as instantiated, we avoid
12803 trying to instantiate it. Since instantiate_decl can't
12804 handle local variables, and since we've already done
12805 all that needs to be done, that's the right thing to
12807 if (TREE_CODE (decl
) == VAR_DECL
)
12808 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
12809 if (TREE_CODE (decl
) == VAR_DECL
12810 && ANON_AGGR_TYPE_P (TREE_TYPE (decl
)))
12811 /* Anonymous aggregates are a special case. */
12812 finish_anon_union (decl
);
12813 else if (is_capture_proxy (DECL_EXPR_DECL (t
)))
12815 DECL_CONTEXT (decl
) = current_function_decl
;
12816 insert_capture_proxy (decl
);
12820 int const_init
= false;
12821 maybe_push_decl (decl
);
12822 if (TREE_CODE (decl
) == VAR_DECL
12823 && DECL_PRETTY_FUNCTION_P (decl
))
12825 /* For __PRETTY_FUNCTION__ we have to adjust the
12827 const char *const name
12828 = cxx_printable_name (current_function_decl
, 2);
12829 init
= cp_fname_init (name
, &TREE_TYPE (decl
));
12833 tree t
= RECUR (init
);
12837 /* If we had an initializer but it
12838 instantiated to nothing,
12839 value-initialize the object. This will
12840 only occur when the initializer was a
12841 pack expansion where the parameter packs
12842 used in that expansion were of length
12844 init
= build_value_init (TREE_TYPE (decl
),
12846 if (TREE_CODE (init
) == AGGR_INIT_EXPR
)
12847 init
= get_target_expr_sfinae (init
, complain
);
12853 if (TREE_CODE (decl
) == VAR_DECL
)
12854 const_init
= (DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P
12856 cp_finish_decl (decl
, init
, const_init
, NULL_TREE
, 0);
12861 /* A DECL_EXPR can also be used as an expression, in the condition
12862 clause of an if/for/while construct. */
12867 stmt
= begin_for_stmt (NULL_TREE
, NULL_TREE
);
12868 RECUR (FOR_INIT_STMT (t
));
12869 finish_for_init_stmt (stmt
);
12870 tmp
= RECUR (FOR_COND (t
));
12871 finish_for_cond (tmp
, stmt
);
12872 tmp
= RECUR (FOR_EXPR (t
));
12873 finish_for_expr (tmp
, stmt
);
12874 RECUR (FOR_BODY (t
));
12875 finish_for_stmt (stmt
);
12878 case RANGE_FOR_STMT
:
12881 stmt
= begin_for_stmt (NULL_TREE
, NULL_TREE
);
12882 decl
= RANGE_FOR_DECL (t
);
12883 decl
= tsubst (decl
, args
, complain
, in_decl
);
12884 maybe_push_decl (decl
);
12885 expr
= RECUR (RANGE_FOR_EXPR (t
));
12886 stmt
= cp_convert_range_for (stmt
, decl
, expr
);
12887 RECUR (RANGE_FOR_BODY (t
));
12888 finish_for_stmt (stmt
);
12893 stmt
= begin_while_stmt ();
12894 tmp
= RECUR (WHILE_COND (t
));
12895 finish_while_stmt_cond (tmp
, stmt
);
12896 RECUR (WHILE_BODY (t
));
12897 finish_while_stmt (stmt
);
12901 stmt
= begin_do_stmt ();
12902 RECUR (DO_BODY (t
));
12903 finish_do_body (stmt
);
12904 tmp
= RECUR (DO_COND (t
));
12905 finish_do_stmt (tmp
, stmt
);
12909 stmt
= begin_if_stmt ();
12910 tmp
= RECUR (IF_COND (t
));
12911 finish_if_stmt_cond (tmp
, stmt
);
12912 RECUR (THEN_CLAUSE (t
));
12913 finish_then_clause (stmt
);
12915 if (ELSE_CLAUSE (t
))
12917 begin_else_clause (stmt
);
12918 RECUR (ELSE_CLAUSE (t
));
12919 finish_else_clause (stmt
);
12922 finish_if_stmt (stmt
);
12926 if (BIND_EXPR_BODY_BLOCK (t
))
12927 stmt
= begin_function_body ();
12929 stmt
= begin_compound_stmt (BIND_EXPR_TRY_BLOCK (t
)
12930 ? BCS_TRY_BLOCK
: 0);
12932 RECUR (BIND_EXPR_BODY (t
));
12934 if (BIND_EXPR_BODY_BLOCK (t
))
12935 finish_function_body (stmt
);
12937 finish_compound_stmt (stmt
);
12941 finish_break_stmt ();
12944 case CONTINUE_STMT
:
12945 finish_continue_stmt ();
12949 stmt
= begin_switch_stmt ();
12950 tmp
= RECUR (SWITCH_STMT_COND (t
));
12951 finish_switch_cond (tmp
, stmt
);
12952 RECUR (SWITCH_STMT_BODY (t
));
12953 finish_switch_stmt (stmt
);
12956 case CASE_LABEL_EXPR
:
12957 finish_case_label (EXPR_LOCATION (t
),
12958 RECUR (CASE_LOW (t
)),
12959 RECUR (CASE_HIGH (t
)));
12964 tree decl
= LABEL_EXPR_LABEL (t
);
12967 label
= finish_label_stmt (DECL_NAME (decl
));
12968 if (DECL_ATTRIBUTES (decl
) != NULL_TREE
)
12969 cplus_decl_attributes (&label
, DECL_ATTRIBUTES (decl
), 0);
12974 tmp
= GOTO_DESTINATION (t
);
12975 if (TREE_CODE (tmp
) != LABEL_DECL
)
12976 /* Computed goto's must be tsubst'd into. On the other hand,
12977 non-computed gotos must not be; the identifier in question
12978 will have no binding. */
12981 tmp
= DECL_NAME (tmp
);
12982 finish_goto_stmt (tmp
);
12986 tmp
= finish_asm_stmt
12987 (ASM_VOLATILE_P (t
),
12988 RECUR (ASM_STRING (t
)),
12989 tsubst_copy_asm_operands (ASM_OUTPUTS (t
), args
, complain
, in_decl
),
12990 tsubst_copy_asm_operands (ASM_INPUTS (t
), args
, complain
, in_decl
),
12991 tsubst_copy_asm_operands (ASM_CLOBBERS (t
), args
, complain
, in_decl
),
12992 tsubst_copy_asm_operands (ASM_LABELS (t
), args
, complain
, in_decl
));
12994 tree asm_expr
= tmp
;
12995 if (TREE_CODE (asm_expr
) == CLEANUP_POINT_EXPR
)
12996 asm_expr
= TREE_OPERAND (asm_expr
, 0);
12997 ASM_INPUT_P (asm_expr
) = ASM_INPUT_P (t
);
13004 stmt
= begin_try_block ();
13005 RECUR (TRY_STMTS (t
));
13006 finish_cleanup_try_block (stmt
);
13007 finish_cleanup (RECUR (TRY_HANDLERS (t
)), stmt
);
13011 tree compound_stmt
= NULL_TREE
;
13013 if (FN_TRY_BLOCK_P (t
))
13014 stmt
= begin_function_try_block (&compound_stmt
);
13016 stmt
= begin_try_block ();
13018 RECUR (TRY_STMTS (t
));
13020 if (FN_TRY_BLOCK_P (t
))
13021 finish_function_try_block (stmt
);
13023 finish_try_block (stmt
);
13025 RECUR (TRY_HANDLERS (t
));
13026 if (FN_TRY_BLOCK_P (t
))
13027 finish_function_handler_sequence (stmt
, compound_stmt
);
13029 finish_handler_sequence (stmt
);
13035 tree decl
= HANDLER_PARMS (t
);
13039 decl
= tsubst (decl
, args
, complain
, in_decl
);
13040 /* Prevent instantiate_decl from trying to instantiate
13041 this variable. We've already done all that needs to be
13043 if (decl
!= error_mark_node
)
13044 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
13046 stmt
= begin_handler ();
13047 finish_handler_parms (decl
, stmt
);
13048 RECUR (HANDLER_BODY (t
));
13049 finish_handler (stmt
);
13054 tsubst (TREE_TYPE (t
), args
, complain
, NULL_TREE
);
13057 case STATIC_ASSERT
:
13060 tsubst_expr (STATIC_ASSERT_CONDITION (t
),
13063 /*integral_constant_expression_p=*/true);
13064 finish_static_assert (condition
,
13065 STATIC_ASSERT_MESSAGE (t
),
13066 STATIC_ASSERT_SOURCE_LOCATION (t
),
13067 /*member_p=*/false);
13072 tmp
= tsubst_omp_clauses (OMP_PARALLEL_CLAUSES (t
),
13073 args
, complain
, in_decl
);
13074 stmt
= begin_omp_parallel ();
13075 RECUR (OMP_PARALLEL_BODY (t
));
13076 OMP_PARALLEL_COMBINED (finish_omp_parallel (tmp
, stmt
))
13077 = OMP_PARALLEL_COMBINED (t
);
13081 tmp
= tsubst_omp_clauses (OMP_TASK_CLAUSES (t
),
13082 args
, complain
, in_decl
);
13083 stmt
= begin_omp_task ();
13084 RECUR (OMP_TASK_BODY (t
));
13085 finish_omp_task (tmp
, stmt
);
13090 tree clauses
, body
, pre_body
;
13091 tree declv
, initv
, condv
, incrv
;
13094 clauses
= tsubst_omp_clauses (OMP_FOR_CLAUSES (t
),
13095 args
, complain
, in_decl
);
13096 declv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
13097 initv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
13098 condv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
13099 incrv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
13101 for (i
= 0; i
< TREE_VEC_LENGTH (OMP_FOR_INIT (t
)); i
++)
13102 tsubst_omp_for_iterator (t
, i
, declv
, initv
, condv
, incrv
,
13103 &clauses
, args
, complain
, in_decl
,
13104 integral_constant_expression_p
);
13106 stmt
= begin_omp_structured_block ();
13108 for (i
= 0; i
< TREE_VEC_LENGTH (initv
); i
++)
13109 if (TREE_VEC_ELT (initv
, i
) == NULL
13110 || TREE_CODE (TREE_VEC_ELT (initv
, i
)) != DECL_EXPR
)
13111 TREE_VEC_ELT (initv
, i
) = RECUR (TREE_VEC_ELT (initv
, i
));
13112 else if (CLASS_TYPE_P (TREE_TYPE (TREE_VEC_ELT (initv
, i
))))
13114 tree init
= RECUR (TREE_VEC_ELT (initv
, i
));
13115 gcc_assert (init
== TREE_VEC_ELT (declv
, i
));
13116 TREE_VEC_ELT (initv
, i
) = NULL_TREE
;
13120 tree decl_expr
= TREE_VEC_ELT (initv
, i
);
13121 tree init
= DECL_INITIAL (DECL_EXPR_DECL (decl_expr
));
13122 gcc_assert (init
!= NULL
);
13123 TREE_VEC_ELT (initv
, i
) = RECUR (init
);
13124 DECL_INITIAL (DECL_EXPR_DECL (decl_expr
)) = NULL
;
13126 DECL_INITIAL (DECL_EXPR_DECL (decl_expr
)) = init
;
13129 pre_body
= push_stmt_list ();
13130 RECUR (OMP_FOR_PRE_BODY (t
));
13131 pre_body
= pop_stmt_list (pre_body
);
13133 body
= push_stmt_list ();
13134 RECUR (OMP_FOR_BODY (t
));
13135 body
= pop_stmt_list (body
);
13137 t
= finish_omp_for (EXPR_LOCATION (t
), declv
, initv
, condv
, incrv
,
13138 body
, pre_body
, clauses
);
13140 add_stmt (finish_omp_structured_block (stmt
));
13146 tmp
= tsubst_omp_clauses (OMP_CLAUSES (t
), args
, complain
, in_decl
);
13147 stmt
= push_stmt_list ();
13148 RECUR (OMP_BODY (t
));
13149 stmt
= pop_stmt_list (stmt
);
13152 OMP_BODY (t
) = stmt
;
13153 OMP_CLAUSES (t
) = tmp
;
13161 stmt
= push_stmt_list ();
13162 RECUR (OMP_BODY (t
));
13163 stmt
= pop_stmt_list (stmt
);
13166 OMP_BODY (t
) = stmt
;
13171 gcc_assert (OMP_ATOMIC_DEPENDENT_P (t
));
13172 if (TREE_CODE (TREE_OPERAND (t
, 1)) != MODIFY_EXPR
)
13174 tree op1
= TREE_OPERAND (t
, 1);
13175 tree rhs1
= NULL_TREE
;
13177 if (TREE_CODE (op1
) == COMPOUND_EXPR
)
13179 rhs1
= RECUR (TREE_OPERAND (op1
, 0));
13180 op1
= TREE_OPERAND (op1
, 1);
13182 lhs
= RECUR (TREE_OPERAND (op1
, 0));
13183 rhs
= RECUR (TREE_OPERAND (op1
, 1));
13184 finish_omp_atomic (OMP_ATOMIC
, TREE_CODE (op1
), lhs
, rhs
,
13185 NULL_TREE
, NULL_TREE
, rhs1
);
13189 tree op1
= TREE_OPERAND (t
, 1);
13190 tree v
= NULL_TREE
, lhs
, rhs
= NULL_TREE
, lhs1
= NULL_TREE
;
13191 tree rhs1
= NULL_TREE
;
13192 enum tree_code code
= TREE_CODE (TREE_OPERAND (op1
, 1));
13193 enum tree_code opcode
= NOP_EXPR
;
13194 if (code
== OMP_ATOMIC_READ
)
13196 v
= RECUR (TREE_OPERAND (op1
, 0));
13197 lhs
= RECUR (TREE_OPERAND (TREE_OPERAND (op1
, 1), 0));
13199 else if (code
== OMP_ATOMIC_CAPTURE_OLD
13200 || code
== OMP_ATOMIC_CAPTURE_NEW
)
13202 tree op11
= TREE_OPERAND (TREE_OPERAND (op1
, 1), 1);
13203 v
= RECUR (TREE_OPERAND (op1
, 0));
13204 lhs1
= RECUR (TREE_OPERAND (TREE_OPERAND (op1
, 1), 0));
13205 if (TREE_CODE (op11
) == COMPOUND_EXPR
)
13207 rhs1
= RECUR (TREE_OPERAND (op11
, 0));
13208 op11
= TREE_OPERAND (op11
, 1);
13210 lhs
= RECUR (TREE_OPERAND (op11
, 0));
13211 rhs
= RECUR (TREE_OPERAND (op11
, 1));
13212 opcode
= TREE_CODE (op11
);
13217 lhs
= RECUR (TREE_OPERAND (op1
, 0));
13218 rhs
= RECUR (TREE_OPERAND (op1
, 1));
13220 finish_omp_atomic (code
, opcode
, lhs
, rhs
, v
, lhs1
, rhs1
);
13224 case TRANSACTION_EXPR
:
13227 flags
|= (TRANSACTION_EXPR_OUTER (t
) ? TM_STMT_ATTR_OUTER
: 0);
13228 flags
|= (TRANSACTION_EXPR_RELAXED (t
) ? TM_STMT_ATTR_RELAXED
: 0);
13230 if (TRANSACTION_EXPR_IS_STMT (t
))
13232 stmt
= begin_transaction_stmt (input_location
, NULL
, flags
);
13233 RECUR (TRANSACTION_EXPR_BODY (t
));
13234 finish_transaction_stmt (stmt
, NULL
, flags
);
13238 stmt
= build_transaction_expr (EXPR_LOCATION (t
),
13239 RECUR (TRANSACTION_EXPR_BODY (t
)),
13246 case EXPR_PACK_EXPANSION
:
13247 error ("invalid use of pack expansion expression");
13248 return error_mark_node
;
13250 case NONTYPE_ARGUMENT_PACK
:
13251 error ("use %<...%> to expand argument pack");
13252 return error_mark_node
;
13255 gcc_assert (!STATEMENT_CODE_P (TREE_CODE (t
)));
13257 return tsubst_copy_and_build (t
, args
, complain
, in_decl
,
13258 /*function_p=*/false,
13259 integral_constant_expression_p
);
13266 /* T is a postfix-expression that is not being used in a function
13267 call. Return the substituted version of T. */
13270 tsubst_non_call_postfix_expression (tree t
, tree args
,
13271 tsubst_flags_t complain
,
13274 if (TREE_CODE (t
) == SCOPE_REF
)
13275 t
= tsubst_qualified_id (t
, args
, complain
, in_decl
,
13276 /*done=*/false, /*address_p=*/false);
13278 t
= tsubst_copy_and_build (t
, args
, complain
, in_decl
,
13279 /*function_p=*/false,
13280 /*integral_constant_expression_p=*/false);
13285 /* Like tsubst but deals with expressions and performs semantic
13286 analysis. FUNCTION_P is true if T is the "F" in "F (ARGS)". */
13289 tsubst_copy_and_build (tree t
,
13291 tsubst_flags_t complain
,
13294 bool integral_constant_expression_p
)
13296 #define RECUR(NODE) \
13297 tsubst_copy_and_build (NODE, args, complain, in_decl, \
13298 /*function_p=*/false, \
13299 integral_constant_expression_p)
13303 if (t
== NULL_TREE
|| t
== error_mark_node
)
13306 switch (TREE_CODE (t
))
13310 /* Fall through. */
13311 case IDENTIFIER_NODE
:
13315 bool non_integral_constant_expression_p
;
13316 const char *error_msg
;
13318 if (IDENTIFIER_TYPENAME_P (t
))
13320 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13321 t
= mangle_conv_op_name_for_type (new_type
);
13324 /* Look up the name. */
13325 decl
= lookup_name (t
);
13327 /* By convention, expressions use ERROR_MARK_NODE to indicate
13328 failure, not NULL_TREE. */
13329 if (decl
== NULL_TREE
)
13330 decl
= error_mark_node
;
13332 decl
= finish_id_expression (t
, decl
, NULL_TREE
,
13334 integral_constant_expression_p
,
13335 /*allow_non_integral_constant_expression_p=*/(cxx_dialect
>= cxx0x
),
13336 &non_integral_constant_expression_p
,
13337 /*template_p=*/false,
13339 /*address_p=*/false,
13340 /*template_arg_p=*/false,
13345 if (!function_p
&& TREE_CODE (decl
) == IDENTIFIER_NODE
)
13347 if (complain
& tf_error
)
13348 unqualified_name_lookup_error (decl
);
13349 decl
= error_mark_node
;
13354 case TEMPLATE_ID_EXPR
:
13357 tree templ
= RECUR (TREE_OPERAND (t
, 0));
13358 tree targs
= TREE_OPERAND (t
, 1);
13361 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
13363 if (TREE_CODE (templ
) == COMPONENT_REF
)
13365 object
= TREE_OPERAND (templ
, 0);
13366 templ
= TREE_OPERAND (templ
, 1);
13369 object
= NULL_TREE
;
13370 templ
= lookup_template_function (templ
, targs
);
13373 return build3 (COMPONENT_REF
, TREE_TYPE (templ
),
13374 object
, templ
, NULL_TREE
);
13376 return baselink_for_fns (templ
);
13381 tree r
= RECUR (TREE_OPERAND (t
, 0));
13383 if (REFERENCE_REF_P (t
))
13385 /* A type conversion to reference type will be enclosed in
13386 such an indirect ref, but the substitution of the cast
13387 will have also added such an indirect ref. */
13388 if (TREE_CODE (TREE_TYPE (r
)) == REFERENCE_TYPE
)
13389 r
= convert_from_reference (r
);
13392 r
= build_x_indirect_ref (r
, RO_UNARY_STAR
, complain
);
13398 (tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
13399 RECUR (TREE_OPERAND (t
, 0)));
13401 case IMPLICIT_CONV_EXPR
:
13403 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13404 tree expr
= RECUR (TREE_OPERAND (t
, 0));
13405 int flags
= LOOKUP_IMPLICIT
;
13406 if (IMPLICIT_CONV_EXPR_DIRECT_INIT (t
))
13407 flags
= LOOKUP_NORMAL
;
13408 return perform_implicit_conversion_flags (type
, expr
, complain
,
13415 tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
13416 RECUR (TREE_OPERAND (t
, 0)));
13419 case REINTERPRET_CAST_EXPR
:
13420 case CONST_CAST_EXPR
:
13421 case DYNAMIC_CAST_EXPR
:
13422 case STATIC_CAST_EXPR
:
13427 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13428 if (integral_constant_expression_p
13429 && !cast_valid_in_integral_constant_expression_p (type
))
13431 if (complain
& tf_error
)
13432 error ("a cast to a type other than an integral or "
13433 "enumeration type cannot appear in a constant-expression");
13434 return error_mark_node
;
13437 op
= RECUR (TREE_OPERAND (t
, 0));
13439 switch (TREE_CODE (t
))
13442 return build_functional_cast (type
, op
, complain
);
13443 case REINTERPRET_CAST_EXPR
:
13444 return build_reinterpret_cast (type
, op
, complain
);
13445 case CONST_CAST_EXPR
:
13446 return build_const_cast (type
, op
, complain
);
13447 case DYNAMIC_CAST_EXPR
:
13448 return build_dynamic_cast (type
, op
, complain
);
13449 case STATIC_CAST_EXPR
:
13450 return build_static_cast (type
, op
, complain
);
13452 gcc_unreachable ();
13456 case POSTDECREMENT_EXPR
:
13457 case POSTINCREMENT_EXPR
:
13458 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
13459 args
, complain
, in_decl
);
13460 return build_x_unary_op (TREE_CODE (t
), op1
, complain
);
13462 case PREDECREMENT_EXPR
:
13463 case PREINCREMENT_EXPR
:
13467 case TRUTH_NOT_EXPR
:
13468 case UNARY_PLUS_EXPR
: /* Unary + */
13469 case REALPART_EXPR
:
13470 case IMAGPART_EXPR
:
13471 return build_x_unary_op (TREE_CODE (t
), RECUR (TREE_OPERAND (t
, 0)),
13474 case FIX_TRUNC_EXPR
:
13475 return cp_build_unary_op (FIX_TRUNC_EXPR
, RECUR (TREE_OPERAND (t
, 0)),
13479 op1
= TREE_OPERAND (t
, 0);
13480 if (TREE_CODE (op1
) == LABEL_DECL
)
13481 return finish_label_address_expr (DECL_NAME (op1
),
13482 EXPR_LOCATION (op1
));
13483 if (TREE_CODE (op1
) == SCOPE_REF
)
13484 op1
= tsubst_qualified_id (op1
, args
, complain
, in_decl
,
13485 /*done=*/true, /*address_p=*/true);
13487 op1
= tsubst_non_call_postfix_expression (op1
, args
, complain
,
13489 return build_x_unary_op (ADDR_EXPR
, op1
, complain
);
13494 case TRUNC_DIV_EXPR
:
13495 case CEIL_DIV_EXPR
:
13496 case FLOOR_DIV_EXPR
:
13497 case ROUND_DIV_EXPR
:
13498 case EXACT_DIV_EXPR
:
13502 case TRUNC_MOD_EXPR
:
13503 case FLOOR_MOD_EXPR
:
13504 case TRUTH_ANDIF_EXPR
:
13505 case TRUTH_ORIF_EXPR
:
13506 case TRUTH_AND_EXPR
:
13507 case TRUTH_OR_EXPR
:
13522 return build_x_binary_op
13524 RECUR (TREE_OPERAND (t
, 0)),
13525 (TREE_NO_WARNING (TREE_OPERAND (t
, 0))
13527 : TREE_CODE (TREE_OPERAND (t
, 0))),
13528 RECUR (TREE_OPERAND (t
, 1)),
13529 (TREE_NO_WARNING (TREE_OPERAND (t
, 1))
13531 : TREE_CODE (TREE_OPERAND (t
, 1))),
13536 return tsubst_qualified_id (t
, args
, complain
, in_decl
, /*done=*/true,
13537 /*address_p=*/false);
13539 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
13540 args
, complain
, in_decl
);
13541 return build_x_array_ref (op1
, RECUR (TREE_OPERAND (t
, 1)), complain
);
13544 if (PACK_EXPANSION_P (TREE_OPERAND (t
, 0)))
13545 return tsubst_copy (t
, args
, complain
, in_decl
);
13549 op1
= TREE_OPERAND (t
, 0);
13552 /* When there are no ARGS, we are trying to evaluate a
13553 non-dependent expression from the parser. Trying to do
13554 the substitutions may not work. */
13556 op1
= TREE_TYPE (op1
);
13560 ++cp_unevaluated_operand
;
13561 ++c_inhibit_evaluation_warnings
;
13562 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
13563 /*function_p=*/false,
13564 /*integral_constant_expression_p=*/false);
13565 --cp_unevaluated_operand
;
13566 --c_inhibit_evaluation_warnings
;
13569 return cxx_sizeof_or_alignof_type (op1
, TREE_CODE (t
),
13570 complain
& tf_error
);
13572 return cxx_sizeof_or_alignof_expr (op1
, TREE_CODE (t
),
13573 complain
& tf_error
);
13575 case AT_ENCODE_EXPR
:
13577 op1
= TREE_OPERAND (t
, 0);
13578 ++cp_unevaluated_operand
;
13579 ++c_inhibit_evaluation_warnings
;
13580 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
13581 /*function_p=*/false,
13582 /*integral_constant_expression_p=*/false);
13583 --cp_unevaluated_operand
;
13584 --c_inhibit_evaluation_warnings
;
13585 return objc_build_encode_expr (op1
);
13588 case NOEXCEPT_EXPR
:
13589 op1
= TREE_OPERAND (t
, 0);
13590 ++cp_unevaluated_operand
;
13591 ++c_inhibit_evaluation_warnings
;
13592 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
13593 /*function_p=*/false,
13594 /*integral_constant_expression_p=*/false);
13595 --cp_unevaluated_operand
;
13596 --c_inhibit_evaluation_warnings
;
13597 return finish_noexcept_expr (op1
, complain
);
13601 tree r
= build_x_modify_expr
13602 (RECUR (TREE_OPERAND (t
, 0)),
13603 TREE_CODE (TREE_OPERAND (t
, 1)),
13604 RECUR (TREE_OPERAND (t
, 2)),
13606 /* TREE_NO_WARNING must be set if either the expression was
13607 parenthesized or it uses an operator such as >>= rather
13608 than plain assignment. In the former case, it was already
13609 set and must be copied. In the latter case,
13610 build_x_modify_expr sets it and it must not be reset
13612 if (TREE_NO_WARNING (t
))
13613 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
13618 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
13619 args
, complain
, in_decl
);
13620 /* Remember that there was a reference to this entity. */
13623 return build_x_arrow (op1
);
13627 tree placement
= RECUR (TREE_OPERAND (t
, 0));
13628 tree init
= RECUR (TREE_OPERAND (t
, 3));
13629 VEC(tree
,gc
) *placement_vec
;
13630 VEC(tree
,gc
) *init_vec
;
13633 if (placement
== NULL_TREE
)
13634 placement_vec
= NULL
;
13637 placement_vec
= make_tree_vector ();
13638 for (; placement
!= NULL_TREE
; placement
= TREE_CHAIN (placement
))
13639 VEC_safe_push (tree
, gc
, placement_vec
, TREE_VALUE (placement
));
13642 /* If there was an initializer in the original tree, but it
13643 instantiated to an empty list, then we should pass a
13644 non-NULL empty vector to tell build_new that it was an
13645 empty initializer() rather than no initializer. This can
13646 only happen when the initializer is a pack expansion whose
13647 parameter packs are of length zero. */
13648 if (init
== NULL_TREE
&& TREE_OPERAND (t
, 3) == NULL_TREE
)
13652 init_vec
= make_tree_vector ();
13653 if (init
== void_zero_node
)
13654 gcc_assert (init_vec
!= NULL
);
13657 for (; init
!= NULL_TREE
; init
= TREE_CHAIN (init
))
13658 VEC_safe_push (tree
, gc
, init_vec
, TREE_VALUE (init
));
13662 ret
= build_new (&placement_vec
,
13663 tsubst (TREE_OPERAND (t
, 1), args
, complain
, in_decl
),
13664 RECUR (TREE_OPERAND (t
, 2)),
13666 NEW_EXPR_USE_GLOBAL (t
),
13669 if (placement_vec
!= NULL
)
13670 release_tree_vector (placement_vec
);
13671 if (init_vec
!= NULL
)
13672 release_tree_vector (init_vec
);
13678 return delete_sanity
13679 (RECUR (TREE_OPERAND (t
, 0)),
13680 RECUR (TREE_OPERAND (t
, 1)),
13681 DELETE_EXPR_USE_VEC (t
),
13682 DELETE_EXPR_USE_GLOBAL (t
),
13685 case COMPOUND_EXPR
:
13686 return build_x_compound_expr (RECUR (TREE_OPERAND (t
, 0)),
13687 RECUR (TREE_OPERAND (t
, 1)),
13693 VEC(tree
,gc
) *call_args
;
13694 unsigned int nargs
, i
;
13699 function
= CALL_EXPR_FN (t
);
13700 /* When we parsed the expression, we determined whether or
13701 not Koenig lookup should be performed. */
13702 koenig_p
= KOENIG_LOOKUP_P (t
);
13703 if (TREE_CODE (function
) == SCOPE_REF
)
13705 qualified_p
= true;
13706 function
= tsubst_qualified_id (function
, args
, complain
, in_decl
,
13708 /*address_p=*/false);
13710 else if (koenig_p
&& TREE_CODE (function
) == IDENTIFIER_NODE
)
13712 /* Do nothing; calling tsubst_copy_and_build on an identifier
13713 would incorrectly perform unqualified lookup again.
13715 Note that we can also have an IDENTIFIER_NODE if the earlier
13716 unqualified lookup found a member function; in that case
13717 koenig_p will be false and we do want to do the lookup
13718 again to find the instantiated member function.
13720 FIXME but doing that causes c++/15272, so we need to stop
13721 using IDENTIFIER_NODE in that situation. */
13722 qualified_p
= false;
13726 if (TREE_CODE (function
) == COMPONENT_REF
)
13728 tree op
= TREE_OPERAND (function
, 1);
13730 qualified_p
= (TREE_CODE (op
) == SCOPE_REF
13731 || (BASELINK_P (op
)
13732 && BASELINK_QUALIFIED_P (op
)));
13735 qualified_p
= false;
13737 function
= tsubst_copy_and_build (function
, args
, complain
,
13740 integral_constant_expression_p
);
13742 if (BASELINK_P (function
))
13743 qualified_p
= true;
13746 nargs
= call_expr_nargs (t
);
13747 call_args
= make_tree_vector ();
13748 for (i
= 0; i
< nargs
; ++i
)
13750 tree arg
= CALL_EXPR_ARG (t
, i
);
13752 if (!PACK_EXPANSION_P (arg
))
13753 VEC_safe_push (tree
, gc
, call_args
,
13754 RECUR (CALL_EXPR_ARG (t
, i
)));
13757 /* Expand the pack expansion and push each entry onto
13759 arg
= tsubst_pack_expansion (arg
, args
, complain
, in_decl
);
13760 if (TREE_CODE (arg
) == TREE_VEC
)
13762 unsigned int len
, j
;
13764 len
= TREE_VEC_LENGTH (arg
);
13765 for (j
= 0; j
< len
; ++j
)
13767 tree value
= TREE_VEC_ELT (arg
, j
);
13768 if (value
!= NULL_TREE
)
13769 value
= convert_from_reference (value
);
13770 VEC_safe_push (tree
, gc
, call_args
, value
);
13775 /* A partial substitution. Add one entry. */
13776 VEC_safe_push (tree
, gc
, call_args
, arg
);
13781 /* We do not perform argument-dependent lookup if normal
13782 lookup finds a non-function, in accordance with the
13783 expected resolution of DR 218. */
13785 && ((is_overloaded_fn (function
)
13786 /* If lookup found a member function, the Koenig lookup is
13787 not appropriate, even if an unqualified-name was used
13788 to denote the function. */
13789 && !DECL_FUNCTION_MEMBER_P (get_first_fn (function
)))
13790 || TREE_CODE (function
) == IDENTIFIER_NODE
)
13791 /* Only do this when substitution turns a dependent call
13792 into a non-dependent call. */
13793 && type_dependent_expression_p_push (t
)
13794 && !any_type_dependent_arguments_p (call_args
))
13795 function
= perform_koenig_lookup (function
, call_args
, false,
13798 if (TREE_CODE (function
) == IDENTIFIER_NODE
13799 && !any_type_dependent_arguments_p (call_args
))
13801 if (koenig_p
&& (complain
& tf_warning_or_error
))
13803 /* For backwards compatibility and good diagnostics, try
13804 the unqualified lookup again if we aren't in SFINAE
13806 tree unq
= (tsubst_copy_and_build
13807 (function
, args
, complain
, in_decl
, true,
13808 integral_constant_expression_p
));
13809 if (unq
== error_mark_node
)
13810 return error_mark_node
;
13812 if (unq
!= function
)
13815 if (TREE_CODE (fn
) == INDIRECT_REF
)
13816 fn
= TREE_OPERAND (fn
, 0);
13817 if (TREE_CODE (fn
) == COMPONENT_REF
)
13818 fn
= TREE_OPERAND (fn
, 1);
13819 if (is_overloaded_fn (fn
))
13820 fn
= get_first_fn (fn
);
13821 permerror (EXPR_LOC_OR_HERE (t
),
13822 "%qD was not declared in this scope, "
13823 "and no declarations were found by "
13824 "argument-dependent lookup at the point "
13825 "of instantiation", function
);
13827 /* Can't say anything more. */;
13828 else if (DECL_CLASS_SCOPE_P (fn
))
13830 inform (EXPR_LOC_OR_HERE (t
),
13831 "declarations in dependent base %qT are "
13832 "not found by unqualified lookup",
13833 DECL_CLASS_CONTEXT (fn
));
13834 if (current_class_ptr
)
13835 inform (EXPR_LOC_OR_HERE (t
),
13836 "use %<this->%D%> instead", function
);
13838 inform (EXPR_LOC_OR_HERE (t
),
13839 "use %<%T::%D%> instead",
13840 current_class_name
, function
);
13843 inform (0, "%q+D declared here, later in the "
13844 "translation unit", fn
);
13848 if (TREE_CODE (function
) == IDENTIFIER_NODE
)
13850 unqualified_name_lookup_error (function
);
13851 release_tree_vector (call_args
);
13852 return error_mark_node
;
13856 /* Remember that there was a reference to this entity. */
13857 if (DECL_P (function
))
13858 mark_used (function
);
13860 if (TREE_CODE (function
) == OFFSET_REF
)
13861 ret
= build_offset_ref_call_from_tree (function
, &call_args
);
13862 else if (TREE_CODE (function
) == COMPONENT_REF
)
13864 tree instance
= TREE_OPERAND (function
, 0);
13865 tree fn
= TREE_OPERAND (function
, 1);
13867 if (processing_template_decl
13868 && (type_dependent_expression_p (instance
)
13869 || (!BASELINK_P (fn
)
13870 && TREE_CODE (fn
) != FIELD_DECL
)
13871 || type_dependent_expression_p (fn
)
13872 || any_type_dependent_arguments_p (call_args
)))
13873 ret
= build_nt_call_vec (function
, call_args
);
13874 else if (!BASELINK_P (fn
))
13875 ret
= finish_call_expr (function
, &call_args
,
13876 /*disallow_virtual=*/false,
13877 /*koenig_p=*/false,
13880 ret
= (build_new_method_call
13882 &call_args
, NULL_TREE
,
13883 qualified_p
? LOOKUP_NONVIRTUAL
: LOOKUP_NORMAL
,
13888 ret
= finish_call_expr (function
, &call_args
,
13889 /*disallow_virtual=*/qualified_p
,
13893 release_tree_vector (call_args
);
13899 return build_x_conditional_expr
13900 (RECUR (TREE_OPERAND (t
, 0)),
13901 RECUR (TREE_OPERAND (t
, 1)),
13902 RECUR (TREE_OPERAND (t
, 2)),
13905 case PSEUDO_DTOR_EXPR
:
13906 return finish_pseudo_destructor_expr
13907 (RECUR (TREE_OPERAND (t
, 0)),
13908 RECUR (TREE_OPERAND (t
, 1)),
13909 tsubst (TREE_OPERAND (t
, 2), args
, complain
, in_decl
));
13913 tree purpose
, value
, chain
;
13915 if (t
== void_list_node
)
13918 if ((TREE_PURPOSE (t
) && PACK_EXPANSION_P (TREE_PURPOSE (t
)))
13919 || (TREE_VALUE (t
) && PACK_EXPANSION_P (TREE_VALUE (t
))))
13921 /* We have pack expansions, so expand those and
13922 create a new list out of it. */
13923 tree purposevec
= NULL_TREE
;
13924 tree valuevec
= NULL_TREE
;
13928 /* Expand the argument expressions. */
13929 if (TREE_PURPOSE (t
))
13930 purposevec
= tsubst_pack_expansion (TREE_PURPOSE (t
), args
,
13931 complain
, in_decl
);
13932 if (TREE_VALUE (t
))
13933 valuevec
= tsubst_pack_expansion (TREE_VALUE (t
), args
,
13934 complain
, in_decl
);
13936 /* Build the rest of the list. */
13937 chain
= TREE_CHAIN (t
);
13938 if (chain
&& chain
!= void_type_node
)
13939 chain
= RECUR (chain
);
13941 /* Determine the number of arguments. */
13942 if (purposevec
&& TREE_CODE (purposevec
) == TREE_VEC
)
13944 len
= TREE_VEC_LENGTH (purposevec
);
13945 gcc_assert (!valuevec
|| len
== TREE_VEC_LENGTH (valuevec
));
13947 else if (TREE_CODE (valuevec
) == TREE_VEC
)
13948 len
= TREE_VEC_LENGTH (valuevec
);
13951 /* Since we only performed a partial substitution into
13952 the argument pack, we only return a single list
13954 if (purposevec
== TREE_PURPOSE (t
)
13955 && valuevec
== TREE_VALUE (t
)
13956 && chain
== TREE_CHAIN (t
))
13959 return tree_cons (purposevec
, valuevec
, chain
);
13962 /* Convert the argument vectors into a TREE_LIST */
13966 /* Grab the Ith values. */
13968 purpose
= purposevec
? TREE_VEC_ELT (purposevec
, i
)
13971 = valuevec
? convert_from_reference (TREE_VEC_ELT (valuevec
, i
))
13974 /* Build the list (backwards). */
13975 chain
= tree_cons (purpose
, value
, chain
);
13981 purpose
= TREE_PURPOSE (t
);
13983 purpose
= RECUR (purpose
);
13984 value
= TREE_VALUE (t
);
13986 value
= RECUR (value
);
13987 chain
= TREE_CHAIN (t
);
13988 if (chain
&& chain
!= void_type_node
)
13989 chain
= RECUR (chain
);
13990 if (purpose
== TREE_PURPOSE (t
)
13991 && value
== TREE_VALUE (t
)
13992 && chain
== TREE_CHAIN (t
))
13994 return tree_cons (purpose
, value
, chain
);
13997 case COMPONENT_REF
:
14003 object
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
14004 args
, complain
, in_decl
);
14005 /* Remember that there was a reference to this entity. */
14006 if (DECL_P (object
))
14007 mark_used (object
);
14008 object_type
= TREE_TYPE (object
);
14010 member
= TREE_OPERAND (t
, 1);
14011 if (BASELINK_P (member
))
14012 member
= tsubst_baselink (member
,
14013 non_reference (TREE_TYPE (object
)),
14014 args
, complain
, in_decl
);
14016 member
= tsubst_copy (member
, args
, complain
, in_decl
);
14017 if (member
== error_mark_node
)
14018 return error_mark_node
;
14020 if (type_dependent_expression_p (object
))
14021 /* We can't do much here. */;
14022 else if (!CLASS_TYPE_P (object_type
))
14024 if (SCALAR_TYPE_P (object_type
))
14026 tree s
= NULL_TREE
;
14027 tree dtor
= member
;
14029 if (TREE_CODE (dtor
) == SCOPE_REF
)
14031 s
= TREE_OPERAND (dtor
, 0);
14032 dtor
= TREE_OPERAND (dtor
, 1);
14034 if (TREE_CODE (dtor
) == BIT_NOT_EXPR
)
14036 dtor
= TREE_OPERAND (dtor
, 0);
14038 return finish_pseudo_destructor_expr (object
, s
, dtor
);
14042 else if (TREE_CODE (member
) == SCOPE_REF
14043 && TREE_CODE (TREE_OPERAND (member
, 1)) == TEMPLATE_ID_EXPR
)
14045 /* Lookup the template functions now that we know what the
14047 tree scope
= TREE_OPERAND (member
, 0);
14048 tree tmpl
= TREE_OPERAND (TREE_OPERAND (member
, 1), 0);
14049 tree args
= TREE_OPERAND (TREE_OPERAND (member
, 1), 1);
14050 member
= lookup_qualified_name (scope
, tmpl
,
14051 /*is_type_p=*/false,
14052 /*complain=*/false);
14053 if (BASELINK_P (member
))
14055 BASELINK_FUNCTIONS (member
)
14056 = build_nt (TEMPLATE_ID_EXPR
, BASELINK_FUNCTIONS (member
),
14058 member
= (adjust_result_of_qualified_name_lookup
14059 (member
, BINFO_TYPE (BASELINK_BINFO (member
)),
14064 qualified_name_lookup_error (scope
, tmpl
, member
,
14066 return error_mark_node
;
14069 else if (TREE_CODE (member
) == SCOPE_REF
14070 && !CLASS_TYPE_P (TREE_OPERAND (member
, 0))
14071 && TREE_CODE (TREE_OPERAND (member
, 0)) != NAMESPACE_DECL
)
14073 if (complain
& tf_error
)
14075 if (TYPE_P (TREE_OPERAND (member
, 0)))
14076 error ("%qT is not a class or namespace",
14077 TREE_OPERAND (member
, 0));
14079 error ("%qD is not a class or namespace",
14080 TREE_OPERAND (member
, 0));
14082 return error_mark_node
;
14084 else if (TREE_CODE (member
) == FIELD_DECL
)
14085 return finish_non_static_data_member (member
, object
, NULL_TREE
);
14087 return finish_class_member_access_expr (object
, member
,
14088 /*template_p=*/false,
14094 (RECUR (TREE_OPERAND (t
, 0)));
14098 VEC(constructor_elt
,gc
) *n
;
14099 constructor_elt
*ce
;
14100 unsigned HOST_WIDE_INT idx
;
14101 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14102 bool process_index_p
;
14104 bool need_copy_p
= false;
14107 if (type
== error_mark_node
)
14108 return error_mark_node
;
14110 /* digest_init will do the wrong thing if we let it. */
14111 if (type
&& TYPE_PTRMEMFUNC_P (type
))
14114 /* We do not want to process the index of aggregate
14115 initializers as they are identifier nodes which will be
14116 looked up by digest_init. */
14117 process_index_p
= !(type
&& MAYBE_CLASS_TYPE_P (type
));
14119 n
= VEC_copy (constructor_elt
, gc
, CONSTRUCTOR_ELTS (t
));
14120 newlen
= VEC_length (constructor_elt
, n
);
14121 FOR_EACH_VEC_ELT (constructor_elt
, n
, idx
, ce
)
14123 if (ce
->index
&& process_index_p
)
14124 ce
->index
= RECUR (ce
->index
);
14126 if (PACK_EXPANSION_P (ce
->value
))
14128 /* Substitute into the pack expansion. */
14129 ce
->value
= tsubst_pack_expansion (ce
->value
, args
, complain
,
14132 if (ce
->value
== error_mark_node
14133 || PACK_EXPANSION_P (ce
->value
))
14135 else if (TREE_VEC_LENGTH (ce
->value
) == 1)
14136 /* Just move the argument into place. */
14137 ce
->value
= TREE_VEC_ELT (ce
->value
, 0);
14140 /* Update the length of the final CONSTRUCTOR
14141 arguments vector, and note that we will need to
14143 newlen
= newlen
+ TREE_VEC_LENGTH (ce
->value
) - 1;
14144 need_copy_p
= true;
14148 ce
->value
= RECUR (ce
->value
);
14153 VEC(constructor_elt
,gc
) *old_n
= n
;
14155 n
= VEC_alloc (constructor_elt
, gc
, newlen
);
14156 FOR_EACH_VEC_ELT (constructor_elt
, old_n
, idx
, ce
)
14158 if (TREE_CODE (ce
->value
) == TREE_VEC
)
14160 int i
, len
= TREE_VEC_LENGTH (ce
->value
);
14161 for (i
= 0; i
< len
; ++i
)
14162 CONSTRUCTOR_APPEND_ELT (n
, 0,
14163 TREE_VEC_ELT (ce
->value
, i
));
14166 CONSTRUCTOR_APPEND_ELT (n
, 0, ce
->value
);
14170 r
= build_constructor (init_list_type_node
, n
);
14171 CONSTRUCTOR_IS_DIRECT_INIT (r
) = CONSTRUCTOR_IS_DIRECT_INIT (t
);
14173 if (TREE_HAS_CONSTRUCTOR (t
))
14174 return finish_compound_literal (type
, r
, complain
);
14176 TREE_TYPE (r
) = type
;
14182 tree operand_0
= TREE_OPERAND (t
, 0);
14183 if (TYPE_P (operand_0
))
14185 operand_0
= tsubst (operand_0
, args
, complain
, in_decl
);
14186 return get_typeid (operand_0
);
14190 operand_0
= RECUR (operand_0
);
14191 return build_typeid (operand_0
);
14202 tree r
= tsubst_copy (t
, args
, complain
, in_decl
);
14204 if (TREE_CODE (TREE_TYPE (t
)) != REFERENCE_TYPE
)
14205 /* If the original type was a reference, we'll be wrapped in
14206 the appropriate INDIRECT_REF. */
14207 r
= convert_from_reference (r
);
14212 return build_x_va_arg (RECUR (TREE_OPERAND (t
, 0)),
14213 tsubst (TREE_TYPE (t
), args
, complain
, in_decl
));
14215 case OFFSETOF_EXPR
:
14216 return finish_offsetof (RECUR (TREE_OPERAND (t
, 0)));
14220 tree type1
= tsubst_copy (TRAIT_EXPR_TYPE1 (t
), args
,
14221 complain
, in_decl
);
14223 tree type2
= TRAIT_EXPR_TYPE2 (t
);
14225 type2
= tsubst_copy (type2
, args
, complain
, in_decl
);
14227 return finish_trait_expr (TRAIT_EXPR_KIND (t
), type1
, type2
);
14232 tree old_stmt_expr
= cur_stmt_expr
;
14233 tree stmt_expr
= begin_stmt_expr ();
14235 cur_stmt_expr
= stmt_expr
;
14236 tsubst_expr (STMT_EXPR_STMT (t
), args
, complain
, in_decl
,
14237 integral_constant_expression_p
);
14238 stmt_expr
= finish_stmt_expr (stmt_expr
, false);
14239 cur_stmt_expr
= old_stmt_expr
;
14241 /* If the resulting list of expression statement is empty,
14242 fold it further into void_zero_node. */
14243 if (empty_expr_stmt_p (stmt_expr
))
14244 stmt_expr
= void_zero_node
;
14250 t
= tsubst_copy (t
, args
, complain
, in_decl
);
14251 /* As in finish_id_expression, we resolve enumeration constants
14252 to their underlying values. */
14253 if (TREE_CODE (t
) == CONST_DECL
&& !processing_template_decl
)
14255 used_types_insert (TREE_TYPE (t
));
14256 return DECL_INITIAL (t
);
14262 tree r
= build_lambda_expr ();
14264 tree type
= tsubst (LAMBDA_EXPR_CLOSURE (t
), args
, complain
, NULL_TREE
);
14265 LAMBDA_EXPR_CLOSURE (r
) = type
;
14266 CLASSTYPE_LAMBDA_EXPR (type
) = r
;
14268 LAMBDA_EXPR_LOCATION (r
)
14269 = LAMBDA_EXPR_LOCATION (t
);
14270 LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (r
)
14271 = LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (t
);
14272 LAMBDA_EXPR_MUTABLE_P (r
) = LAMBDA_EXPR_MUTABLE_P (t
);
14273 LAMBDA_EXPR_DISCRIMINATOR (r
)
14274 = (LAMBDA_EXPR_DISCRIMINATOR (t
));
14275 LAMBDA_EXPR_EXTRA_SCOPE (r
)
14276 = RECUR (LAMBDA_EXPR_EXTRA_SCOPE (t
));
14277 if (LAMBDA_EXPR_RETURN_TYPE (t
) == dependent_lambda_return_type_node
)
14279 LAMBDA_EXPR_RETURN_TYPE (r
) = dependent_lambda_return_type_node
;
14280 LAMBDA_EXPR_DEDUCE_RETURN_TYPE_P (r
) = true;
14283 LAMBDA_EXPR_RETURN_TYPE (r
)
14284 = tsubst (LAMBDA_EXPR_RETURN_TYPE (t
), args
, complain
, in_decl
);
14286 gcc_assert (LAMBDA_EXPR_THIS_CAPTURE (t
) == NULL_TREE
14287 && LAMBDA_EXPR_PENDING_PROXIES (t
) == NULL
);
14289 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
14290 determine_visibility (TYPE_NAME (type
));
14291 /* Now that we know visibility, instantiate the type so we have a
14292 declaration of the op() for later calls to lambda_function. */
14293 complete_type (type
);
14295 /* The capture list refers to closure members, so this needs to
14296 wait until after we finish instantiating the type. */
14297 LAMBDA_EXPR_CAPTURE_LIST (r
)
14298 = RECUR (LAMBDA_EXPR_CAPTURE_LIST (t
));
14300 return build_lambda_object (r
);
14304 /* We can get here for a constant initializer of non-dependent type.
14305 FIXME stop folding in cp_parser_initializer_clause. */
14306 gcc_assert (TREE_CONSTANT (t
));
14308 tree r
= get_target_expr (RECUR (TARGET_EXPR_INITIAL (t
)));
14309 TREE_CONSTANT (r
) = true;
14313 case TRANSACTION_EXPR
:
14314 return tsubst_expr(t
, args
, complain
, in_decl
,
14315 integral_constant_expression_p
);
14318 /* Handle Objective-C++ constructs, if appropriate. */
14321 = objcp_tsubst_copy_and_build (t
, args
, complain
,
14322 in_decl
, /*function_p=*/false);
14326 return tsubst_copy (t
, args
, complain
, in_decl
);
14332 /* Verify that the instantiated ARGS are valid. For type arguments,
14333 make sure that the type's linkage is ok. For non-type arguments,
14334 make sure they are constants if they are integral or enumerations.
14335 Emit an error under control of COMPLAIN, and return TRUE on error. */
14338 check_instantiated_arg (tree tmpl
, tree t
, tsubst_flags_t complain
)
14340 if (ARGUMENT_PACK_P (t
))
14342 tree vec
= ARGUMENT_PACK_ARGS (t
);
14343 int len
= TREE_VEC_LENGTH (vec
);
14344 bool result
= false;
14347 for (i
= 0; i
< len
; ++i
)
14348 if (check_instantiated_arg (tmpl
, TREE_VEC_ELT (vec
, i
), complain
))
14352 else if (TYPE_P (t
))
14354 /* [basic.link]: A name with no linkage (notably, the name
14355 of a class or enumeration declared in a local scope)
14356 shall not be used to declare an entity with linkage.
14357 This implies that names with no linkage cannot be used as
14360 DR 757 relaxes this restriction for C++0x. */
14361 tree nt
= (cxx_dialect
> cxx98
? NULL_TREE
14362 : no_linkage_check (t
, /*relaxed_p=*/false));
14366 /* DR 488 makes use of a type with no linkage cause
14367 type deduction to fail. */
14368 if (complain
& tf_error
)
14370 if (TYPE_ANONYMOUS_P (nt
))
14371 error ("%qT is/uses anonymous type", t
);
14373 error ("template argument for %qD uses local type %qT",
14378 /* In order to avoid all sorts of complications, we do not
14379 allow variably-modified types as template arguments. */
14380 else if (variably_modified_type_p (t
, NULL_TREE
))
14382 if (complain
& tf_error
)
14383 error ("%qT is a variably modified type", t
);
14387 /* A non-type argument of integral or enumerated type must be a
14389 else if (TREE_TYPE (t
)
14390 && INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (t
))
14391 && !TREE_CONSTANT (t
))
14393 if (complain
& tf_error
)
14394 error ("integral expression %qE is not constant", t
);
14401 check_instantiated_args (tree tmpl
, tree args
, tsubst_flags_t complain
)
14403 int ix
, len
= DECL_NTPARMS (tmpl
);
14404 bool result
= false;
14406 for (ix
= 0; ix
!= len
; ix
++)
14408 if (check_instantiated_arg (tmpl
, TREE_VEC_ELT (args
, ix
), complain
))
14411 if (result
&& (complain
& tf_error
))
14412 error (" trying to instantiate %qD", tmpl
);
14416 /* In C++0x, it's possible to have a function template whose type depends
14417 on itself recursively. This is most obvious with decltype, but can also
14418 occur with enumeration scope (c++/48969). So we need to catch infinite
14419 recursion and reject the substitution at deduction time; this function
14420 will return error_mark_node for any repeated substitution.
14422 This also catches excessive recursion such as when f<N> depends on
14423 f<N-1> across all integers, and returns error_mark_node for all the
14424 substitutions back up to the initial one.
14426 This is, of course, not reentrant. */
14429 deduction_tsubst_fntype (tree fn
, tree targs
, tsubst_flags_t complain
)
14431 static bool excessive_deduction_depth
;
14432 static int deduction_depth
;
14433 struct pending_template
*old_last_pend
= last_pending_template
;
14434 struct tinst_level
*old_error_tinst
= last_error_tinst_level
;
14436 tree fntype
= TREE_TYPE (fn
);
14440 if (excessive_deduction_depth
)
14441 return error_mark_node
;
14443 tinst
= build_tree_list (fn
, targs
);
14444 if (!push_tinst_level (tinst
))
14446 excessive_deduction_depth
= true;
14448 return error_mark_node
;
14451 input_location
= DECL_SOURCE_LOCATION (fn
);
14453 push_deduction_access_scope (fn
);
14454 r
= tsubst (fntype
, targs
, complain
, NULL_TREE
);
14455 pop_deduction_access_scope (fn
);
14458 if (excessive_deduction_depth
)
14460 r
= error_mark_node
;
14461 if (deduction_depth
== 0)
14462 /* Reset once we're all the way out. */
14463 excessive_deduction_depth
= false;
14466 pop_tinst_level ();
14467 /* We can't free this if a pending_template entry or last_error_tinst_level
14468 is pointing at it. */
14469 if (last_pending_template
== old_last_pend
14470 && last_error_tinst_level
== old_error_tinst
)
14475 /* Instantiate the indicated variable or function template TMPL with
14476 the template arguments in TARG_PTR. */
14479 instantiate_template_1 (tree tmpl
, tree orig_args
, tsubst_flags_t complain
)
14481 tree targ_ptr
= orig_args
;
14485 HOST_WIDE_INT saved_processing_template_decl
;
14487 if (tmpl
== error_mark_node
)
14488 return error_mark_node
;
14490 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
);
14492 /* If this function is a clone, handle it specially. */
14493 if (DECL_CLONED_FUNCTION_P (tmpl
))
14498 /* Use DECL_ABSTRACT_ORIGIN because only FUNCTION_DECLs have
14499 DECL_CLONED_FUNCTION. */
14500 spec
= instantiate_template (DECL_ABSTRACT_ORIGIN (tmpl
),
14501 targ_ptr
, complain
);
14502 if (spec
== error_mark_node
)
14503 return error_mark_node
;
14505 /* Look for the clone. */
14506 FOR_EACH_CLONE (clone
, spec
)
14507 if (DECL_NAME (clone
) == DECL_NAME (tmpl
))
14509 /* We should always have found the clone by now. */
14510 gcc_unreachable ();
14514 /* Check to see if we already have this specialization. */
14515 gen_tmpl
= most_general_template (tmpl
);
14516 if (tmpl
!= gen_tmpl
)
14517 /* The TMPL is a partial instantiation. To get a full set of
14518 arguments we must add the arguments used to perform the
14519 partial instantiation. */
14520 targ_ptr
= add_outermost_template_args (DECL_TI_ARGS (tmpl
),
14523 /* It would be nice to avoid hashing here and then again in tsubst_decl,
14524 but it doesn't seem to be on the hot path. */
14525 spec
= retrieve_specialization (gen_tmpl
, targ_ptr
, 0);
14527 gcc_assert (tmpl
== gen_tmpl
14528 || ((fndecl
= retrieve_specialization (tmpl
, orig_args
, 0))
14530 || fndecl
== NULL_TREE
);
14532 if (spec
!= NULL_TREE
)
14535 if (check_instantiated_args (gen_tmpl
, INNERMOST_TEMPLATE_ARGS (targ_ptr
),
14537 return error_mark_node
;
14539 /* We are building a FUNCTION_DECL, during which the access of its
14540 parameters and return types have to be checked. However this
14541 FUNCTION_DECL which is the desired context for access checking
14542 is not built yet. We solve this chicken-and-egg problem by
14543 deferring all checks until we have the FUNCTION_DECL. */
14544 push_deferring_access_checks (dk_deferred
);
14546 /* Although PROCESSING_TEMPLATE_DECL may be true at this point
14547 (because, for example, we have encountered a non-dependent
14548 function call in the body of a template function and must now
14549 determine which of several overloaded functions will be called),
14550 within the instantiation itself we are not processing a
14552 saved_processing_template_decl
= processing_template_decl
;
14553 processing_template_decl
= 0;
14554 /* Substitute template parameters to obtain the specialization. */
14555 fndecl
= tsubst (DECL_TEMPLATE_RESULT (gen_tmpl
),
14556 targ_ptr
, complain
, gen_tmpl
);
14557 processing_template_decl
= saved_processing_template_decl
;
14558 if (fndecl
== error_mark_node
)
14559 return error_mark_node
;
14561 /* Now we know the specialization, compute access previously
14563 push_access_scope (fndecl
);
14565 /* Some typedefs referenced from within the template code need to be access
14566 checked at template instantiation time, i.e now. These types were
14567 added to the template at parsing time. Let's get those and perfom
14568 the acces checks then. */
14569 perform_typedefs_access_check (DECL_TEMPLATE_RESULT (tmpl
), targ_ptr
);
14570 perform_deferred_access_checks ();
14571 pop_access_scope (fndecl
);
14572 pop_deferring_access_checks ();
14574 /* The DECL_TI_TEMPLATE should always be the immediate parent
14575 template, not the most general template. */
14576 DECL_TI_TEMPLATE (fndecl
) = tmpl
;
14578 /* If we've just instantiated the main entry point for a function,
14579 instantiate all the alternate entry points as well. We do this
14580 by cloning the instantiation of the main entry point, not by
14581 instantiating the template clones. */
14582 if (DECL_CHAIN (gen_tmpl
) && DECL_CLONED_FUNCTION_P (DECL_CHAIN (gen_tmpl
)))
14583 clone_function_decl (fndecl
, /*update_method_vec_p=*/0);
14588 /* Wrapper for instantiate_template_1. */
14591 instantiate_template (tree tmpl
, tree orig_args
, tsubst_flags_t complain
)
14594 timevar_push (TV_TEMPLATE_INST
);
14595 ret
= instantiate_template_1 (tmpl
, orig_args
, complain
);
14596 timevar_pop (TV_TEMPLATE_INST
);
14600 /* We're going to do deduction substitution on the type of TMPL, a function
14601 template. In C++11 mode, push into that access scope. In C++03 mode,
14602 disable access checking. */
14605 push_deduction_access_scope (tree tmpl
)
14607 if (cxx_dialect
>= cxx0x
)
14609 int ptd
= processing_template_decl
;
14610 push_access_scope (DECL_TEMPLATE_RESULT (tmpl
));
14611 /* Preserve processing_template_decl across push_to_top_level. */
14612 if (ptd
&& !processing_template_decl
)
14613 ++processing_template_decl
;
14616 push_deferring_access_checks (dk_no_check
);
14619 /* And pop back out. */
14622 pop_deduction_access_scope (tree tmpl
)
14624 if (cxx_dialect
>= cxx0x
)
14625 pop_access_scope (DECL_TEMPLATE_RESULT (tmpl
));
14627 pop_deferring_access_checks ();
14630 /* PARM is a template parameter pack for FN. Returns true iff
14631 PARM is used in a deducible way in the argument list of FN. */
14634 pack_deducible_p (tree parm
, tree fn
)
14636 tree t
= FUNCTION_FIRST_USER_PARMTYPE (fn
);
14637 for (; t
; t
= TREE_CHAIN (t
))
14639 tree type
= TREE_VALUE (t
);
14641 if (!PACK_EXPANSION_P (type
))
14643 for (packs
= PACK_EXPANSION_PARAMETER_PACKS (type
);
14644 packs
; packs
= TREE_CHAIN (packs
))
14645 if (TREE_VALUE (packs
) == parm
)
14647 /* The template parameter pack is used in a function parameter
14648 pack. If this is the end of the parameter list, the
14649 template parameter pack is deducible. */
14650 if (TREE_CHAIN (t
) == void_list_node
)
14653 /* Otherwise, not. Well, it could be deduced from
14654 a non-pack parameter, but doing so would end up with
14655 a deduction mismatch, so don't bother. */
14659 /* The template parameter pack isn't used in any function parameter
14660 packs, but it might be used deeper, e.g. tuple<Args...>. */
14664 /* The FN is a TEMPLATE_DECL for a function. ARGS is an array with
14665 NARGS elements of the arguments that are being used when calling
14666 it. TARGS is a vector into which the deduced template arguments
14669 Return zero for success, 2 for an incomplete match that doesn't resolve
14670 all the types, and 1 for complete failure. An error message will be
14671 printed only for an incomplete match.
14673 If FN is a conversion operator, or we are trying to produce a specific
14674 specialization, RETURN_TYPE is the return type desired.
14676 The EXPLICIT_TARGS are explicit template arguments provided via a
14679 The parameter STRICT is one of:
14682 We are deducing arguments for a function call, as in
14683 [temp.deduct.call].
14686 We are deducing arguments for a conversion function, as in
14687 [temp.deduct.conv].
14690 We are deducing arguments when doing an explicit instantiation
14691 as in [temp.explicit], when determining an explicit specialization
14692 as in [temp.expl.spec], or when taking the address of a function
14693 template, as in [temp.deduct.funcaddr]. */
14696 fn_type_unification (tree fn
,
14697 tree explicit_targs
,
14700 unsigned int nargs
,
14702 unification_kind_t strict
,
14710 gcc_assert (TREE_CODE (fn
) == TEMPLATE_DECL
);
14712 fntype
= TREE_TYPE (fn
);
14713 if (explicit_targs
)
14717 The specified template arguments must match the template
14718 parameters in kind (i.e., type, nontype, template), and there
14719 must not be more arguments than there are parameters;
14720 otherwise type deduction fails.
14722 Nontype arguments must match the types of the corresponding
14723 nontype template parameters, or must be convertible to the
14724 types of the corresponding nontype parameters as specified in
14725 _temp.arg.nontype_, otherwise type deduction fails.
14727 All references in the function type of the function template
14728 to the corresponding template parameters are replaced by the
14729 specified template argument values. If a substitution in a
14730 template parameter or in the function type of the function
14731 template results in an invalid type, type deduction fails. */
14732 tree tparms
= DECL_INNERMOST_TEMPLATE_PARMS (fn
);
14733 int i
, len
= TREE_VEC_LENGTH (tparms
);
14734 tree converted_args
;
14735 bool incomplete
= false;
14737 if (explicit_targs
== error_mark_node
)
14738 return unify_invalid (explain_p
);
14741 = (coerce_template_parms (tparms
, explicit_targs
, NULL_TREE
,
14743 ? tf_warning_or_error
14745 /*require_all_args=*/false,
14746 /*use_default_args=*/false));
14747 if (converted_args
== error_mark_node
)
14750 /* Substitute the explicit args into the function type. This is
14751 necessary so that, for instance, explicitly declared function
14752 arguments can match null pointed constants. If we were given
14753 an incomplete set of explicit args, we must not do semantic
14754 processing during substitution as we could create partial
14756 for (i
= 0; i
< len
; i
++)
14758 tree parm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
14759 bool parameter_pack
= false;
14760 tree targ
= TREE_VEC_ELT (converted_args
, i
);
14762 /* Dig out the actual parm. */
14763 if (TREE_CODE (parm
) == TYPE_DECL
14764 || TREE_CODE (parm
) == TEMPLATE_DECL
)
14766 parm
= TREE_TYPE (parm
);
14767 parameter_pack
= TEMPLATE_TYPE_PARAMETER_PACK (parm
);
14769 else if (TREE_CODE (parm
) == PARM_DECL
)
14771 parm
= DECL_INITIAL (parm
);
14772 parameter_pack
= TEMPLATE_PARM_PARAMETER_PACK (parm
);
14775 if (!parameter_pack
&& targ
== NULL_TREE
)
14776 /* No explicit argument for this template parameter. */
14779 if (parameter_pack
&& pack_deducible_p (parm
, fn
))
14781 /* Mark the argument pack as "incomplete". We could
14782 still deduce more arguments during unification.
14783 We remove this mark in type_unification_real. */
14786 ARGUMENT_PACK_INCOMPLETE_P(targ
) = 1;
14787 ARGUMENT_PACK_EXPLICIT_ARGS (targ
)
14788 = ARGUMENT_PACK_ARGS (targ
);
14791 /* We have some incomplete argument packs. */
14796 processing_template_decl
+= incomplete
;
14797 fntype
= deduction_tsubst_fntype (fn
, converted_args
,
14799 ? tf_warning_or_error
14801 processing_template_decl
-= incomplete
;
14803 if (fntype
== error_mark_node
)
14806 /* Place the explicitly specified arguments in TARGS. */
14807 for (i
= NUM_TMPL_ARGS (converted_args
); i
--;)
14808 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (converted_args
, i
);
14811 /* Never do unification on the 'this' parameter. */
14812 parms
= skip_artificial_parms_for (fn
, TYPE_ARG_TYPES (fntype
));
14818 parms
= tree_cons (NULL_TREE
, TREE_TYPE (fntype
), parms
);
14819 new_args
= XALLOCAVEC (tree
, nargs
+ 1);
14820 new_args
[0] = return_type
;
14821 memcpy (new_args
+ 1, args
, nargs
* sizeof (tree
));
14826 /* We allow incomplete unification without an error message here
14827 because the standard doesn't seem to explicitly prohibit it. Our
14828 callers must be ready to deal with unification failures in any
14830 result
= type_unification_real (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
14831 targs
, parms
, args
, nargs
, /*subr=*/0,
14832 strict
, flags
, explain_p
);
14834 /* Now that we have bindings for all of the template arguments,
14835 ensure that the arguments deduced for the template template
14836 parameters have compatible template parameter lists. We cannot
14837 check this property before we have deduced all template
14838 arguments, because the template parameter types of a template
14839 template parameter might depend on prior template parameters
14840 deduced after the template template parameter. The following
14841 ill-formed example illustrates this issue:
14843 template<typename T, template<T> class C> void f(C<5>, T);
14845 template<int N> struct X {};
14848 f(X<5>(), 5l); // error: template argument deduction fails
14851 The template parameter list of 'C' depends on the template type
14852 parameter 'T', but 'C' is deduced to 'X' before 'T' is deduced to
14853 'long'. Thus, we can't check that 'C' cannot bind to 'X' at the
14854 time that we deduce 'C'. */
14856 && !template_template_parm_bindings_ok_p
14857 (DECL_INNERMOST_TEMPLATE_PARMS (fn
), targs
))
14858 return unify_inconsistent_template_template_parameters (explain_p
);
14861 /* All is well so far. Now, check:
14865 When all template arguments have been deduced, all uses of
14866 template parameters in nondeduced contexts are replaced with
14867 the corresponding deduced argument values. If the
14868 substitution results in an invalid type, as described above,
14869 type deduction fails. */
14871 tree substed
= deduction_tsubst_fntype (fn
, targs
,
14873 ? tf_warning_or_error
14875 if (substed
== error_mark_node
)
14878 /* If we're looking for an exact match, check that what we got
14879 is indeed an exact match. It might not be if some template
14880 parameters are used in non-deduced contexts. */
14881 if (strict
== DEDUCE_EXACT
)
14886 = skip_artificial_parms_for (fn
, TYPE_ARG_TYPES (substed
));
14888 sarg
= tree_cons (NULL_TREE
, TREE_TYPE (substed
), sarg
);
14889 for (i
= 0; i
< nargs
&& sarg
; ++i
, sarg
= TREE_CHAIN (sarg
))
14890 if (!same_type_p (args
[i
], TREE_VALUE (sarg
)))
14891 return unify_type_mismatch (explain_p
, args
[i
],
14892 TREE_VALUE (sarg
));
14899 /* Adjust types before performing type deduction, as described in
14900 [temp.deduct.call] and [temp.deduct.conv]. The rules in these two
14901 sections are symmetric. PARM is the type of a function parameter
14902 or the return type of the conversion function. ARG is the type of
14903 the argument passed to the call, or the type of the value
14904 initialized with the result of the conversion function.
14905 ARG_EXPR is the original argument expression, which may be null. */
14908 maybe_adjust_types_for_deduction (unification_kind_t strict
,
14922 /* Swap PARM and ARG throughout the remainder of this
14923 function; the handling is precisely symmetric since PARM
14924 will initialize ARG rather than vice versa. */
14932 /* Core issue #873: Do the DR606 thing (see below) for these cases,
14933 too, but here handle it by stripping the reference from PARM
14934 rather than by adding it to ARG. */
14935 if (TREE_CODE (*parm
) == REFERENCE_TYPE
14936 && TYPE_REF_IS_RVALUE (*parm
)
14937 && TREE_CODE (TREE_TYPE (*parm
)) == TEMPLATE_TYPE_PARM
14938 && cp_type_quals (TREE_TYPE (*parm
)) == TYPE_UNQUALIFIED
14939 && TREE_CODE (*arg
) == REFERENCE_TYPE
14940 && !TYPE_REF_IS_RVALUE (*arg
))
14941 *parm
= TREE_TYPE (*parm
);
14942 /* Nothing else to do in this case. */
14946 gcc_unreachable ();
14949 if (TREE_CODE (*parm
) != REFERENCE_TYPE
)
14951 /* [temp.deduct.call]
14953 If P is not a reference type:
14955 --If A is an array type, the pointer type produced by the
14956 array-to-pointer standard conversion (_conv.array_) is
14957 used in place of A for type deduction; otherwise,
14959 --If A is a function type, the pointer type produced by
14960 the function-to-pointer standard conversion
14961 (_conv.func_) is used in place of A for type deduction;
14964 --If A is a cv-qualified type, the top level
14965 cv-qualifiers of A's type are ignored for type
14967 if (TREE_CODE (*arg
) == ARRAY_TYPE
)
14968 *arg
= build_pointer_type (TREE_TYPE (*arg
));
14969 else if (TREE_CODE (*arg
) == FUNCTION_TYPE
)
14970 *arg
= build_pointer_type (*arg
);
14972 *arg
= TYPE_MAIN_VARIANT (*arg
);
14975 /* From C++0x [14.8.2.1/3 temp.deduct.call] (after DR606), "If P is
14976 of the form T&&, where T is a template parameter, and the argument
14977 is an lvalue, T is deduced as A& */
14978 if (TREE_CODE (*parm
) == REFERENCE_TYPE
14979 && TYPE_REF_IS_RVALUE (*parm
)
14980 && TREE_CODE (TREE_TYPE (*parm
)) == TEMPLATE_TYPE_PARM
14981 && cp_type_quals (TREE_TYPE (*parm
)) == TYPE_UNQUALIFIED
14982 && (arg_expr
? real_lvalue_p (arg_expr
)
14983 /* try_one_overload doesn't provide an arg_expr, but
14984 functions are always lvalues. */
14985 : TREE_CODE (*arg
) == FUNCTION_TYPE
))
14986 *arg
= build_reference_type (*arg
);
14988 /* [temp.deduct.call]
14990 If P is a cv-qualified type, the top level cv-qualifiers
14991 of P's type are ignored for type deduction. If P is a
14992 reference type, the type referred to by P is used for
14994 *parm
= TYPE_MAIN_VARIANT (*parm
);
14995 if (TREE_CODE (*parm
) == REFERENCE_TYPE
)
14997 *parm
= TREE_TYPE (*parm
);
14998 result
|= UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
15001 /* DR 322. For conversion deduction, remove a reference type on parm
15002 too (which has been swapped into ARG). */
15003 if (strict
== DEDUCE_CONV
&& TREE_CODE (*arg
) == REFERENCE_TYPE
)
15004 *arg
= TREE_TYPE (*arg
);
15009 /* Subroutine of unify_one_argument. PARM is a function parameter of a
15010 template which does contain any deducible template parameters; check if
15011 ARG is a suitable match for it. STRICT, FLAGS and EXPLAIN_P are as in
15012 unify_one_argument. */
15015 check_non_deducible_conversion (tree parm
, tree arg
, int strict
,
15016 int flags
, bool explain_p
)
15021 type
= TREE_TYPE (arg
);
15025 if (same_type_p (parm
, type
))
15026 return unify_success (explain_p
);
15028 if (strict
== DEDUCE_CONV
)
15030 if (can_convert_arg (type
, parm
, NULL_TREE
, flags
))
15031 return unify_success (explain_p
);
15033 else if (strict
!= DEDUCE_EXACT
)
15035 if (can_convert_arg (parm
, type
,
15036 TYPE_P (arg
) ? NULL_TREE
: arg
,
15038 return unify_success (explain_p
);
15041 if (strict
== DEDUCE_EXACT
)
15042 return unify_type_mismatch (explain_p
, parm
, arg
);
15044 return unify_arg_conversion (explain_p
, parm
, type
, arg
);
15047 /* Subroutine of type_unification_real and unify_pack_expansion to
15048 handle unification of a single P/A pair. Parameters are as
15049 for those functions. */
15052 unify_one_argument (tree tparms
, tree targs
, tree parm
, tree arg
,
15053 int subr
, unification_kind_t strict
, int flags
,
15056 tree arg_expr
= NULL_TREE
;
15059 if (arg
== error_mark_node
|| parm
== error_mark_node
)
15060 return unify_invalid (explain_p
);
15061 if (arg
== unknown_type_node
)
15062 /* We can't deduce anything from this, but we might get all the
15063 template args from other function args. */
15064 return unify_success (explain_p
);
15066 /* FIXME uses_deducible_template_parms */
15067 if (TYPE_P (parm
) && !uses_template_parms (parm
))
15068 return check_non_deducible_conversion (parm
, arg
, strict
, flags
,
15074 arg_strict
= (UNIFY_ALLOW_OUTER_LEVEL
15075 | UNIFY_ALLOW_MORE_CV_QUAL
15076 | UNIFY_ALLOW_DERIVED
);
15080 arg_strict
= UNIFY_ALLOW_LESS_CV_QUAL
;
15084 arg_strict
= UNIFY_ALLOW_NONE
;
15088 gcc_unreachable ();
15091 /* We only do these transformations if this is the top-level
15092 parameter_type_list in a call or declaration matching; in other
15093 situations (nested function declarators, template argument lists) we
15094 won't be comparing a type to an expression, and we don't do any type
15100 gcc_assert (TREE_TYPE (arg
) != NULL_TREE
);
15101 if (type_unknown_p (arg
))
15103 /* [temp.deduct.type] A template-argument can be
15104 deduced from a pointer to function or pointer
15105 to member function argument if the set of
15106 overloaded functions does not contain function
15107 templates and at most one of a set of
15108 overloaded functions provides a unique
15111 if (resolve_overloaded_unification
15112 (tparms
, targs
, parm
, arg
, strict
,
15113 arg_strict
, explain_p
))
15114 return unify_success (explain_p
);
15115 return unify_overload_resolution_failure (explain_p
, arg
);
15119 arg
= unlowered_expr_type (arg
);
15120 if (arg
== error_mark_node
)
15121 return unify_invalid (explain_p
);
15125 maybe_adjust_types_for_deduction (strict
, &parm
, &arg
, arg_expr
);
15128 gcc_assert ((TYPE_P (parm
) || TREE_CODE (parm
) == TEMPLATE_DECL
)
15129 == (TYPE_P (arg
) || TREE_CODE (arg
) == TEMPLATE_DECL
));
15131 /* For deduction from an init-list we need the actual list. */
15132 if (arg_expr
&& BRACE_ENCLOSED_INITIALIZER_P (arg_expr
))
15134 return unify (tparms
, targs
, parm
, arg
, arg_strict
, explain_p
);
15137 /* Most parms like fn_type_unification.
15139 If SUBR is 1, we're being called recursively (to unify the
15140 arguments of a function or method parameter of a function
15144 type_unification_real (tree tparms
,
15148 unsigned int xnargs
,
15150 unification_kind_t strict
,
15156 int ntparms
= TREE_VEC_LENGTH (tparms
);
15157 int saw_undeduced
= 0;
15160 unsigned int nargs
;
15163 gcc_assert (TREE_CODE (tparms
) == TREE_VEC
);
15164 gcc_assert (xparms
== NULL_TREE
|| TREE_CODE (xparms
) == TREE_LIST
);
15165 gcc_assert (ntparms
> 0);
15167 /* Reset the number of non-defaulted template arguments contained
15169 NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
) = NULL_TREE
;
15177 while (parms
&& parms
!= void_list_node
15180 parm
= TREE_VALUE (parms
);
15182 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
15183 && (!TREE_CHAIN (parms
) || TREE_CHAIN (parms
) == void_list_node
))
15184 /* For a function parameter pack that occurs at the end of the
15185 parameter-declaration-list, the type A of each remaining
15186 argument of the call is compared with the type P of the
15187 declarator-id of the function parameter pack. */
15190 parms
= TREE_CHAIN (parms
);
15192 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
)
15193 /* For a function parameter pack that does not occur at the
15194 end of the parameter-declaration-list, the type of the
15195 parameter pack is a non-deduced context. */
15201 if (unify_one_argument (tparms
, targs
, parm
, arg
, subr
, strict
,
15207 && parms
!= void_list_node
15208 && TREE_CODE (TREE_VALUE (parms
)) == TYPE_PACK_EXPANSION
)
15210 /* Unify the remaining arguments with the pack expansion type. */
15212 tree parmvec
= make_tree_vec (1);
15214 /* Allocate a TREE_VEC and copy in all of the arguments */
15215 argvec
= make_tree_vec (nargs
- ia
);
15216 for (i
= 0; ia
< nargs
; ++ia
, ++i
)
15217 TREE_VEC_ELT (argvec
, i
) = args
[ia
];
15219 /* Copy the parameter into parmvec. */
15220 TREE_VEC_ELT (parmvec
, 0) = TREE_VALUE (parms
);
15221 if (unify_pack_expansion (tparms
, targs
, parmvec
, argvec
, strict
,
15222 /*subr=*/subr
, explain_p
))
15225 /* Advance to the end of the list of parameters. */
15226 parms
= TREE_CHAIN (parms
);
15229 /* Fail if we've reached the end of the parm list, and more args
15230 are present, and the parm list isn't variadic. */
15231 if (ia
< nargs
&& parms
== void_list_node
)
15232 return unify_too_many_arguments (explain_p
, nargs
, ia
);
15233 /* Fail if parms are left and they don't have default values. */
15234 if (parms
&& parms
!= void_list_node
15235 && TREE_PURPOSE (parms
) == NULL_TREE
)
15237 unsigned int count
= nargs
;
15239 while (p
&& p
!= void_list_node
)
15242 p
= TREE_CHAIN (p
);
15244 return unify_too_few_arguments (explain_p
, ia
, count
);
15249 tsubst_flags_t complain
= (explain_p
15250 ? tf_warning_or_error
15253 /* Check to see if we need another pass before we start clearing
15254 ARGUMENT_PACK_INCOMPLETE_P. */
15255 for (i
= 0; i
< ntparms
; i
++)
15257 tree targ
= TREE_VEC_ELT (targs
, i
);
15258 tree tparm
= TREE_VEC_ELT (tparms
, i
);
15260 if (targ
|| tparm
== error_mark_node
)
15262 tparm
= TREE_VALUE (tparm
);
15264 /* If this is an undeduced nontype parameter that depends on
15265 a type parameter, try another pass; its type may have been
15266 deduced from a later argument than the one from which
15267 this parameter can be deduced. */
15268 if (TREE_CODE (tparm
) == PARM_DECL
15269 && uses_template_parms (TREE_TYPE (tparm
))
15270 && !saw_undeduced
++)
15274 for (i
= 0; i
< ntparms
; i
++)
15276 tree targ
= TREE_VEC_ELT (targs
, i
);
15277 tree tparm
= TREE_VEC_ELT (tparms
, i
);
15279 /* Clear the "incomplete" flags on all argument packs now so that
15280 substituting them into later default arguments works. */
15281 if (targ
&& ARGUMENT_PACK_P (targ
))
15283 ARGUMENT_PACK_INCOMPLETE_P (targ
) = 0;
15284 ARGUMENT_PACK_EXPLICIT_ARGS (targ
) = NULL_TREE
;
15287 if (targ
|| tparm
== error_mark_node
)
15289 tparm
= TREE_VALUE (tparm
);
15291 /* Core issue #226 (C++0x) [temp.deduct]:
15293 If a template argument has not been deduced, its
15294 default template argument, if any, is used.
15296 When we are in C++98 mode, TREE_PURPOSE will either
15297 be NULL_TREE or ERROR_MARK_NODE, so we do not need
15298 to explicitly check cxx_dialect here. */
15299 if (TREE_PURPOSE (TREE_VEC_ELT (tparms
, i
)))
15301 tree parm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
15302 tree arg
= TREE_PURPOSE (TREE_VEC_ELT (tparms
, i
));
15303 location_t save_loc
= input_location
;
15305 input_location
= DECL_SOURCE_LOCATION (parm
);
15306 arg
= tsubst_template_arg (arg
, targs
, complain
, NULL_TREE
);
15307 arg
= convert_template_argument (parm
, arg
, targs
, complain
,
15309 input_location
= save_loc
;
15310 if (arg
== error_mark_node
)
15314 TREE_VEC_ELT (targs
, i
) = arg
;
15315 /* The position of the first default template argument,
15316 is also the number of non-defaulted arguments in TARGS.
15318 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
))
15319 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
, i
);
15324 /* If the type parameter is a parameter pack, then it will
15325 be deduced to an empty parameter pack. */
15326 if (template_parameter_pack_p (tparm
))
15330 if (TREE_CODE (tparm
) == TEMPLATE_PARM_INDEX
)
15332 arg
= make_node (NONTYPE_ARGUMENT_PACK
);
15333 TREE_TYPE (arg
) = TREE_TYPE (TEMPLATE_PARM_DECL (tparm
));
15334 TREE_CONSTANT (arg
) = 1;
15337 arg
= cxx_make_type (TYPE_ARGUMENT_PACK
);
15339 SET_ARGUMENT_PACK_ARGS (arg
, make_tree_vec (0));
15341 TREE_VEC_ELT (targs
, i
) = arg
;
15345 return unify_parameter_deduction_failure (explain_p
, tparm
);
15348 #ifdef ENABLE_CHECKING
15349 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
))
15350 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
, TREE_VEC_LENGTH (targs
));
15353 return unify_success (explain_p
);
15356 /* Subroutine of type_unification_real. Args are like the variables
15357 at the call site. ARG is an overloaded function (or template-id);
15358 we try deducing template args from each of the overloads, and if
15359 only one succeeds, we go with that. Modifies TARGS and returns
15360 true on success. */
15363 resolve_overloaded_unification (tree tparms
,
15367 unification_kind_t strict
,
15371 tree tempargs
= copy_node (targs
);
15373 tree goodfn
= NULL_TREE
;
15376 if (TREE_CODE (arg
) == ADDR_EXPR
)
15378 arg
= TREE_OPERAND (arg
, 0);
15384 if (TREE_CODE (arg
) == COMPONENT_REF
)
15385 /* Handle `&x' where `x' is some static or non-static member
15387 arg
= TREE_OPERAND (arg
, 1);
15389 if (TREE_CODE (arg
) == OFFSET_REF
)
15390 arg
= TREE_OPERAND (arg
, 1);
15392 /* Strip baselink information. */
15393 if (BASELINK_P (arg
))
15394 arg
= BASELINK_FUNCTIONS (arg
);
15396 if (TREE_CODE (arg
) == TEMPLATE_ID_EXPR
)
15398 /* If we got some explicit template args, we need to plug them into
15399 the affected templates before we try to unify, in case the
15400 explicit args will completely resolve the templates in question. */
15403 tree expl_subargs
= TREE_OPERAND (arg
, 1);
15404 arg
= TREE_OPERAND (arg
, 0);
15406 for (; arg
; arg
= OVL_NEXT (arg
))
15408 tree fn
= OVL_CURRENT (arg
);
15409 tree subargs
, elem
;
15411 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
15414 ++processing_template_decl
;
15415 subargs
= get_bindings (fn
, DECL_TEMPLATE_RESULT (fn
),
15416 expl_subargs
, /*check_ret=*/false);
15417 if (subargs
&& !any_dependent_template_arguments_p (subargs
))
15419 elem
= tsubst (TREE_TYPE (fn
), subargs
, tf_none
, NULL_TREE
);
15420 if (try_one_overload (tparms
, targs
, tempargs
, parm
,
15421 elem
, strict
, sub_strict
, addr_p
, explain_p
)
15422 && (!goodfn
|| !decls_match (goodfn
, elem
)))
15430 --processing_template_decl
;
15432 /* If no templates (or more than one) are fully resolved by the
15433 explicit arguments, this template-id is a non-deduced context; it
15434 could still be OK if we deduce all template arguments for the
15435 enclosing call through other arguments. */
15439 else if (TREE_CODE (arg
) != OVERLOAD
15440 && TREE_CODE (arg
) != FUNCTION_DECL
)
15441 /* If ARG is, for example, "(0, &f)" then its type will be unknown
15442 -- but the deduction does not succeed because the expression is
15443 not just the function on its own. */
15446 for (; arg
; arg
= OVL_NEXT (arg
))
15447 if (try_one_overload (tparms
, targs
, tempargs
, parm
,
15448 TREE_TYPE (OVL_CURRENT (arg
)),
15449 strict
, sub_strict
, addr_p
, explain_p
)
15450 && (!goodfn
|| !decls_match (goodfn
, OVL_CURRENT (arg
))))
15452 goodfn
= OVL_CURRENT (arg
);
15456 /* [temp.deduct.type] A template-argument can be deduced from a pointer
15457 to function or pointer to member function argument if the set of
15458 overloaded functions does not contain function templates and at most
15459 one of a set of overloaded functions provides a unique match.
15461 So if we found multiple possibilities, we return success but don't
15462 deduce anything. */
15466 int i
= TREE_VEC_LENGTH (targs
);
15468 if (TREE_VEC_ELT (tempargs
, i
))
15469 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (tempargs
, i
);
15477 /* Core DR 115: In contexts where deduction is done and fails, or in
15478 contexts where deduction is not done, if a template argument list is
15479 specified and it, along with any default template arguments, identifies
15480 a single function template specialization, then the template-id is an
15481 lvalue for the function template specialization. */
15484 resolve_nondeduced_context (tree orig_expr
)
15486 tree expr
, offset
, baselink
;
15489 if (!type_unknown_p (orig_expr
))
15494 offset
= NULL_TREE
;
15495 baselink
= NULL_TREE
;
15497 if (TREE_CODE (expr
) == ADDR_EXPR
)
15499 expr
= TREE_OPERAND (expr
, 0);
15502 if (TREE_CODE (expr
) == OFFSET_REF
)
15505 expr
= TREE_OPERAND (expr
, 1);
15507 if (BASELINK_P (expr
))
15510 expr
= BASELINK_FUNCTIONS (expr
);
15513 if (TREE_CODE (expr
) == TEMPLATE_ID_EXPR
)
15516 tree goodfn
= NULL_TREE
;
15518 /* If we got some explicit template args, we need to plug them into
15519 the affected templates before we try to unify, in case the
15520 explicit args will completely resolve the templates in question. */
15522 tree expl_subargs
= TREE_OPERAND (expr
, 1);
15523 tree arg
= TREE_OPERAND (expr
, 0);
15524 tree badfn
= NULL_TREE
;
15525 tree badargs
= NULL_TREE
;
15527 for (; arg
; arg
= OVL_NEXT (arg
))
15529 tree fn
= OVL_CURRENT (arg
);
15530 tree subargs
, elem
;
15532 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
15535 ++processing_template_decl
;
15536 subargs
= get_bindings (fn
, DECL_TEMPLATE_RESULT (fn
),
15537 expl_subargs
, /*check_ret=*/false);
15538 if (subargs
&& !any_dependent_template_arguments_p (subargs
))
15540 elem
= instantiate_template (fn
, subargs
, tf_none
);
15541 if (elem
== error_mark_node
)
15546 else if (elem
&& (!goodfn
|| !decls_match (goodfn
, elem
)))
15552 --processing_template_decl
;
15556 mark_used (goodfn
);
15559 expr
= build_baselink (BASELINK_BINFO (baselink
),
15560 BASELINK_ACCESS_BINFO (baselink
),
15561 expr
, BASELINK_OPTYPE (baselink
));
15565 = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (offset
, 0)));
15566 expr
= build_offset_ref (base
, expr
, addr
);
15569 expr
= cp_build_addr_expr (expr
, tf_warning_or_error
);
15572 else if (good
== 0 && badargs
)
15573 /* There were no good options and at least one bad one, so let the
15574 user know what the problem is. */
15575 instantiate_template (badfn
, badargs
, tf_warning_or_error
);
15580 /* Subroutine of resolve_overloaded_unification; does deduction for a single
15581 overload. Fills TARGS with any deduced arguments, or error_mark_node if
15582 different overloads deduce different arguments for a given parm.
15583 ADDR_P is true if the expression for which deduction is being
15584 performed was of the form "& fn" rather than simply "fn".
15586 Returns 1 on success. */
15589 try_one_overload (tree tparms
,
15594 unification_kind_t strict
,
15603 /* [temp.deduct.type] A template-argument can be deduced from a pointer
15604 to function or pointer to member function argument if the set of
15605 overloaded functions does not contain function templates and at most
15606 one of a set of overloaded functions provides a unique match.
15608 So if this is a template, just return success. */
15610 if (uses_template_parms (arg
))
15613 if (TREE_CODE (arg
) == METHOD_TYPE
)
15614 arg
= build_ptrmemfunc_type (build_pointer_type (arg
));
15616 arg
= build_pointer_type (arg
);
15618 sub_strict
|= maybe_adjust_types_for_deduction (strict
, &parm
, &arg
, NULL
);
15620 /* We don't copy orig_targs for this because if we have already deduced
15621 some template args from previous args, unify would complain when we
15622 try to deduce a template parameter for the same argument, even though
15623 there isn't really a conflict. */
15624 nargs
= TREE_VEC_LENGTH (targs
);
15625 tempargs
= make_tree_vec (nargs
);
15627 if (unify (tparms
, tempargs
, parm
, arg
, sub_strict
, explain_p
))
15630 /* First make sure we didn't deduce anything that conflicts with
15631 explicitly specified args. */
15632 for (i
= nargs
; i
--; )
15634 tree elt
= TREE_VEC_ELT (tempargs
, i
);
15635 tree oldelt
= TREE_VEC_ELT (orig_targs
, i
);
15639 else if (uses_template_parms (elt
))
15640 /* Since we're unifying against ourselves, we will fill in
15641 template args used in the function parm list with our own
15642 template parms. Discard them. */
15643 TREE_VEC_ELT (tempargs
, i
) = NULL_TREE
;
15644 else if (oldelt
&& !template_args_equal (oldelt
, elt
))
15648 for (i
= nargs
; i
--; )
15650 tree elt
= TREE_VEC_ELT (tempargs
, i
);
15653 TREE_VEC_ELT (targs
, i
) = elt
;
15659 /* PARM is a template class (perhaps with unbound template
15660 parameters). ARG is a fully instantiated type. If ARG can be
15661 bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and
15662 TARGS are as for unify. */
15665 try_class_unification (tree tparms
, tree targs
, tree parm
, tree arg
,
15668 tree copy_of_targs
;
15670 if (!CLASSTYPE_TEMPLATE_INFO (arg
)
15671 || (most_general_template (CLASSTYPE_TI_TEMPLATE (arg
))
15672 != most_general_template (CLASSTYPE_TI_TEMPLATE (parm
))))
15675 /* We need to make a new template argument vector for the call to
15676 unify. If we used TARGS, we'd clutter it up with the result of
15677 the attempted unification, even if this class didn't work out.
15678 We also don't want to commit ourselves to all the unifications
15679 we've already done, since unification is supposed to be done on
15680 an argument-by-argument basis. In other words, consider the
15681 following pathological case:
15683 template <int I, int J, int K>
15686 template <int I, int J>
15687 struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {};
15689 template <int I, int J, int K>
15690 void f(S<I, J, K>, S<I, I, I>);
15699 Now, by the time we consider the unification involving `s2', we
15700 already know that we must have `f<0, 0, 0>'. But, even though
15701 `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is invalid
15702 because there are two ways to unify base classes of S<0, 1, 2>
15703 with S<I, I, I>. If we kept the already deduced knowledge, we
15704 would reject the possibility I=1. */
15705 copy_of_targs
= make_tree_vec (TREE_VEC_LENGTH (targs
));
15707 /* If unification failed, we're done. */
15708 if (unify (tparms
, copy_of_targs
, CLASSTYPE_TI_ARGS (parm
),
15709 CLASSTYPE_TI_ARGS (arg
), UNIFY_ALLOW_NONE
, explain_p
))
15715 /* Given a template type PARM and a class type ARG, find the unique
15716 base type in ARG that is an instance of PARM. We do not examine
15717 ARG itself; only its base-classes. If there is not exactly one
15718 appropriate base class, return NULL_TREE. PARM may be the type of
15719 a partial specialization, as well as a plain template type. Used
15722 static enum template_base_result
15723 get_template_base (tree tparms
, tree targs
, tree parm
, tree arg
,
15724 bool explain_p
, tree
*result
)
15726 tree rval
= NULL_TREE
;
15729 gcc_assert (RECORD_OR_UNION_CODE_P (TREE_CODE (arg
)));
15731 binfo
= TYPE_BINFO (complete_type (arg
));
15734 /* The type could not be completed. */
15735 *result
= NULL_TREE
;
15736 return tbr_incomplete_type
;
15739 /* Walk in inheritance graph order. The search order is not
15740 important, and this avoids multiple walks of virtual bases. */
15741 for (binfo
= TREE_CHAIN (binfo
); binfo
; binfo
= TREE_CHAIN (binfo
))
15743 tree r
= try_class_unification (tparms
, targs
, parm
,
15744 BINFO_TYPE (binfo
), explain_p
);
15748 /* If there is more than one satisfactory baseclass, then:
15752 If they yield more than one possible deduced A, the type
15756 if (rval
&& !same_type_p (r
, rval
))
15758 *result
= NULL_TREE
;
15759 return tbr_ambiguous_baseclass
;
15767 return tbr_success
;
15770 /* Returns the level of DECL, which declares a template parameter. */
15773 template_decl_level (tree decl
)
15775 switch (TREE_CODE (decl
))
15778 case TEMPLATE_DECL
:
15779 return TEMPLATE_TYPE_LEVEL (TREE_TYPE (decl
));
15782 return TEMPLATE_PARM_LEVEL (DECL_INITIAL (decl
));
15785 gcc_unreachable ();
15790 /* Decide whether ARG can be unified with PARM, considering only the
15791 cv-qualifiers of each type, given STRICT as documented for unify.
15792 Returns nonzero iff the unification is OK on that basis. */
15795 check_cv_quals_for_unify (int strict
, tree arg
, tree parm
)
15797 int arg_quals
= cp_type_quals (arg
);
15798 int parm_quals
= cp_type_quals (parm
);
15800 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
15801 && !(strict
& UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
15803 /* Although a CVR qualifier is ignored when being applied to a
15804 substituted template parameter ([8.3.2]/1 for example), that
15805 does not allow us to unify "const T" with "int&" because both
15806 types are not of the form "cv-list T" [14.8.2.5 temp.deduct.type].
15807 It is ok when we're allowing additional CV qualifiers
15808 at the outer level [14.8.2.1]/3,1st bullet. */
15809 if ((TREE_CODE (arg
) == REFERENCE_TYPE
15810 || TREE_CODE (arg
) == FUNCTION_TYPE
15811 || TREE_CODE (arg
) == METHOD_TYPE
)
15812 && (parm_quals
& (TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
)))
15815 if ((!POINTER_TYPE_P (arg
) && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
)
15816 && (parm_quals
& TYPE_QUAL_RESTRICT
))
15820 if (!(strict
& (UNIFY_ALLOW_MORE_CV_QUAL
| UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
15821 && (arg_quals
& parm_quals
) != parm_quals
)
15824 if (!(strict
& (UNIFY_ALLOW_LESS_CV_QUAL
| UNIFY_ALLOW_OUTER_LESS_CV_QUAL
))
15825 && (parm_quals
& arg_quals
) != arg_quals
)
15831 /* Determines the LEVEL and INDEX for the template parameter PARM. */
15833 template_parm_level_and_index (tree parm
, int* level
, int* index
)
15835 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
15836 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
15837 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
15839 *index
= TEMPLATE_TYPE_IDX (parm
);
15840 *level
= TEMPLATE_TYPE_LEVEL (parm
);
15844 *index
= TEMPLATE_PARM_IDX (parm
);
15845 *level
= TEMPLATE_PARM_LEVEL (parm
);
15849 #define RECUR_AND_CHECK_FAILURE(TP, TA, P, A, S, EP) \
15851 if (unify (TP, TA, P, A, S, EP)) \
15855 /* Unifies the remaining arguments in PACKED_ARGS with the pack
15856 expansion at the end of PACKED_PARMS. Returns 0 if the type
15857 deduction succeeds, 1 otherwise. STRICT is the same as in
15858 unify. CALL_ARGS_P is true iff PACKED_ARGS is actually a function
15859 call argument list. We'll need to adjust the arguments to make them
15860 types. SUBR tells us if this is from a recursive call to
15861 type_unification_real, or for comparing two template argument
15865 unify_pack_expansion (tree tparms
, tree targs
, tree packed_parms
,
15866 tree packed_args
, unification_kind_t strict
,
15867 bool subr
, bool explain_p
)
15870 = TREE_VEC_ELT (packed_parms
, TREE_VEC_LENGTH (packed_parms
) - 1);
15871 tree pattern
= PACK_EXPANSION_PATTERN (parm
);
15872 tree pack
, packs
= NULL_TREE
;
15873 int i
, start
= TREE_VEC_LENGTH (packed_parms
) - 1;
15874 int len
= TREE_VEC_LENGTH (packed_args
);
15876 /* Determine the parameter packs we will be deducing from the
15877 pattern, and record their current deductions. */
15878 for (pack
= PACK_EXPANSION_PARAMETER_PACKS (parm
);
15879 pack
; pack
= TREE_CHAIN (pack
))
15881 tree parm_pack
= TREE_VALUE (pack
);
15884 /* Determine the index and level of this parameter pack. */
15885 template_parm_level_and_index (parm_pack
, &level
, &idx
);
15887 /* Keep track of the parameter packs and their corresponding
15889 packs
= tree_cons (parm_pack
, TMPL_ARG (targs
, level
, idx
), packs
);
15890 TREE_TYPE (packs
) = make_tree_vec (len
- start
);
15893 /* Loop through all of the arguments that have not yet been
15894 unified and unify each with the pattern. */
15895 for (i
= start
; i
< len
; i
++)
15898 bool any_explicit
= false;
15899 tree arg
= TREE_VEC_ELT (packed_args
, i
);
15901 /* For each parameter pack, set its TMPL_ARG to either NULL_TREE
15902 or the element of its argument pack at the current index if
15903 this argument was explicitly specified. */
15904 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
15908 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
15911 if (TREE_VALUE (pack
)
15912 && (pargs
= ARGUMENT_PACK_EXPLICIT_ARGS (TREE_VALUE (pack
)))
15913 && (i
< TREE_VEC_LENGTH (pargs
)))
15915 any_explicit
= true;
15916 arg
= TREE_VEC_ELT (pargs
, i
);
15918 TMPL_ARG (targs
, level
, idx
) = arg
;
15921 /* If we had explicit template arguments, substitute them into the
15922 pattern before deduction. */
15925 /* Some arguments might still be unspecified or dependent. */
15927 ++processing_template_decl
;
15928 dependent
= any_dependent_template_arguments_p (targs
);
15930 --processing_template_decl
;
15931 parm
= tsubst (pattern
, targs
,
15932 explain_p
? tf_warning_or_error
: tf_none
,
15935 --processing_template_decl
;
15936 if (parm
== error_mark_node
)
15942 /* Unify the pattern with the current argument. */
15943 if (unify_one_argument (tparms
, targs
, parm
, arg
, subr
, strict
,
15944 LOOKUP_IMPLICIT
, explain_p
))
15947 /* For each parameter pack, collect the deduced value. */
15948 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
15951 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
15953 TREE_VEC_ELT (TREE_TYPE (pack
), i
- start
) =
15954 TMPL_ARG (targs
, level
, idx
);
15958 /* Verify that the results of unification with the parameter packs
15959 produce results consistent with what we've seen before, and make
15960 the deduced argument packs available. */
15961 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
15963 tree old_pack
= TREE_VALUE (pack
);
15964 tree new_args
= TREE_TYPE (pack
);
15965 int i
, len
= TREE_VEC_LENGTH (new_args
);
15967 bool nondeduced_p
= false;
15969 /* By default keep the original deduced argument pack.
15970 If necessary, more specific code is going to update the
15971 resulting deduced argument later down in this function. */
15972 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
15973 TMPL_ARG (targs
, level
, idx
) = old_pack
;
15975 /* If NEW_ARGS contains any NULL_TREE entries, we didn't
15976 actually deduce anything. */
15977 for (i
= 0; i
< len
&& !nondeduced_p
; ++i
)
15978 if (TREE_VEC_ELT (new_args
, i
) == NULL_TREE
)
15979 nondeduced_p
= true;
15983 if (old_pack
&& ARGUMENT_PACK_INCOMPLETE_P (old_pack
))
15985 /* If we had fewer function args than explicit template args,
15986 just use the explicits. */
15987 tree explicit_args
= ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
);
15988 int explicit_len
= TREE_VEC_LENGTH (explicit_args
);
15989 if (len
< explicit_len
)
15990 new_args
= explicit_args
;
15996 /* Build the deduced *_ARGUMENT_PACK. */
15997 if (TREE_CODE (TREE_PURPOSE (pack
)) == TEMPLATE_PARM_INDEX
)
15999 result
= make_node (NONTYPE_ARGUMENT_PACK
);
16000 TREE_TYPE (result
) =
16001 TREE_TYPE (TEMPLATE_PARM_DECL (TREE_PURPOSE (pack
)));
16002 TREE_CONSTANT (result
) = 1;
16005 result
= cxx_make_type (TYPE_ARGUMENT_PACK
);
16007 SET_ARGUMENT_PACK_ARGS (result
, new_args
);
16009 /* Note the deduced argument packs for this parameter
16011 TMPL_ARG (targs
, level
, idx
) = result
;
16013 else if (ARGUMENT_PACK_INCOMPLETE_P (old_pack
)
16014 && (ARGUMENT_PACK_ARGS (old_pack
)
16015 == ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
)))
16017 /* We only had the explicitly-provided arguments before, but
16018 now we have a complete set of arguments. */
16019 tree explicit_args
= ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
);
16021 SET_ARGUMENT_PACK_ARGS (old_pack
, new_args
);
16022 ARGUMENT_PACK_INCOMPLETE_P (old_pack
) = 1;
16023 ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
) = explicit_args
;
16027 tree bad_old_arg
= NULL_TREE
, bad_new_arg
= NULL_TREE
;
16028 tree old_args
= ARGUMENT_PACK_ARGS (old_pack
);
16030 if (!comp_template_args_with_info (old_args
, new_args
,
16031 &bad_old_arg
, &bad_new_arg
))
16032 /* Inconsistent unification of this parameter pack. */
16033 return unify_parameter_pack_inconsistent (explain_p
,
16039 return unify_success (explain_p
);
16042 /* Deduce the value of template parameters. TPARMS is the (innermost)
16043 set of template parameters to a template. TARGS is the bindings
16044 for those template parameters, as determined thus far; TARGS may
16045 include template arguments for outer levels of template parameters
16046 as well. PARM is a parameter to a template function, or a
16047 subcomponent of that parameter; ARG is the corresponding argument.
16048 This function attempts to match PARM with ARG in a manner
16049 consistent with the existing assignments in TARGS. If more values
16050 are deduced, then TARGS is updated.
16052 Returns 0 if the type deduction succeeds, 1 otherwise. The
16053 parameter STRICT is a bitwise or of the following flags:
16056 Require an exact match between PARM and ARG.
16057 UNIFY_ALLOW_MORE_CV_QUAL:
16058 Allow the deduced ARG to be more cv-qualified (by qualification
16059 conversion) than ARG.
16060 UNIFY_ALLOW_LESS_CV_QUAL:
16061 Allow the deduced ARG to be less cv-qualified than ARG.
16062 UNIFY_ALLOW_DERIVED:
16063 Allow the deduced ARG to be a template base class of ARG,
16064 or a pointer to a template base class of the type pointed to by
16066 UNIFY_ALLOW_INTEGER:
16067 Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX
16068 case for more information.
16069 UNIFY_ALLOW_OUTER_LEVEL:
16070 This is the outermost level of a deduction. Used to determine validity
16071 of qualification conversions. A valid qualification conversion must
16072 have const qualified pointers leading up to the inner type which
16073 requires additional CV quals, except at the outer level, where const
16074 is not required [conv.qual]. It would be normal to set this flag in
16075 addition to setting UNIFY_ALLOW_MORE_CV_QUAL.
16076 UNIFY_ALLOW_OUTER_MORE_CV_QUAL:
16077 This is the outermost level of a deduction, and PARM can be more CV
16078 qualified at this point.
16079 UNIFY_ALLOW_OUTER_LESS_CV_QUAL:
16080 This is the outermost level of a deduction, and PARM can be less CV
16081 qualified at this point. */
16084 unify (tree tparms
, tree targs
, tree parm
, tree arg
, int strict
,
16090 int strict_in
= strict
;
16092 /* I don't think this will do the right thing with respect to types.
16093 But the only case I've seen it in so far has been array bounds, where
16094 signedness is the only information lost, and I think that will be
16096 while (TREE_CODE (parm
) == NOP_EXPR
)
16097 parm
= TREE_OPERAND (parm
, 0);
16099 if (arg
== error_mark_node
)
16100 return unify_invalid (explain_p
);
16101 if (arg
== unknown_type_node
16102 || arg
== init_list_type_node
)
16103 /* We can't deduce anything from this, but we might get all the
16104 template args from other function args. */
16105 return unify_success (explain_p
);
16107 /* If PARM uses template parameters, then we can't bail out here,
16108 even if ARG == PARM, since we won't record unifications for the
16109 template parameters. We might need them if we're trying to
16110 figure out which of two things is more specialized. */
16111 if (arg
== parm
&& !uses_template_parms (parm
))
16112 return unify_success (explain_p
);
16114 /* Handle init lists early, so the rest of the function can assume
16115 we're dealing with a type. */
16116 if (BRACE_ENCLOSED_INITIALIZER_P (arg
))
16120 tree orig_parm
= parm
;
16122 /* Replace T with std::initializer_list<T> for deduction. */
16123 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
16124 && flag_deduce_init_list
)
16125 parm
= listify (parm
);
16127 if (!is_std_init_list (parm
))
16128 /* We can only deduce from an initializer list argument if the
16129 parameter is std::initializer_list; otherwise this is a
16130 non-deduced context. */
16131 return unify_success (explain_p
);
16133 elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (parm
), 0);
16135 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (arg
), i
, elt
)
16137 int elt_strict
= strict
;
16139 if (elt
== error_mark_node
)
16140 return unify_invalid (explain_p
);
16142 if (!BRACE_ENCLOSED_INITIALIZER_P (elt
))
16144 tree type
= TREE_TYPE (elt
);
16145 /* It should only be possible to get here for a call. */
16146 gcc_assert (elt_strict
& UNIFY_ALLOW_OUTER_LEVEL
);
16147 elt_strict
|= maybe_adjust_types_for_deduction
16148 (DEDUCE_CALL
, &elttype
, &type
, elt
);
16152 RECUR_AND_CHECK_FAILURE (tparms
, targs
, elttype
, elt
, elt_strict
,
16156 /* If the std::initializer_list<T> deduction worked, replace the
16157 deduced A with std::initializer_list<A>. */
16158 if (orig_parm
!= parm
)
16160 idx
= TEMPLATE_TYPE_IDX (orig_parm
);
16161 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
16162 targ
= listify (targ
);
16163 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = targ
;
16165 return unify_success (explain_p
);
16168 /* Immediately reject some pairs that won't unify because of
16169 cv-qualification mismatches. */
16170 if (TREE_CODE (arg
) == TREE_CODE (parm
)
16172 /* It is the elements of the array which hold the cv quals of an array
16173 type, and the elements might be template type parms. We'll check
16174 when we recurse. */
16175 && TREE_CODE (arg
) != ARRAY_TYPE
16176 /* We check the cv-qualifiers when unifying with template type
16177 parameters below. We want to allow ARG `const T' to unify with
16178 PARM `T' for example, when computing which of two templates
16179 is more specialized, for example. */
16180 && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
16181 && !check_cv_quals_for_unify (strict_in
, arg
, parm
))
16182 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
16184 if (!(strict
& UNIFY_ALLOW_OUTER_LEVEL
)
16185 && TYPE_P (parm
) && !CP_TYPE_CONST_P (parm
))
16186 strict
&= ~UNIFY_ALLOW_MORE_CV_QUAL
;
16187 strict
&= ~UNIFY_ALLOW_OUTER_LEVEL
;
16188 strict
&= ~UNIFY_ALLOW_DERIVED
;
16189 strict
&= ~UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
16190 strict
&= ~UNIFY_ALLOW_OUTER_LESS_CV_QUAL
;
16192 switch (TREE_CODE (parm
))
16194 case TYPENAME_TYPE
:
16196 case UNBOUND_CLASS_TEMPLATE
:
16197 /* In a type which contains a nested-name-specifier, template
16198 argument values cannot be deduced for template parameters used
16199 within the nested-name-specifier. */
16200 return unify_success (explain_p
);
16202 case TEMPLATE_TYPE_PARM
:
16203 case TEMPLATE_TEMPLATE_PARM
:
16204 case BOUND_TEMPLATE_TEMPLATE_PARM
:
16205 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
16206 if (tparm
== error_mark_node
)
16207 return unify_invalid (explain_p
);
16209 if (TEMPLATE_TYPE_LEVEL (parm
)
16210 != template_decl_level (tparm
))
16211 /* The PARM is not one we're trying to unify. Just check
16212 to see if it matches ARG. */
16214 if (TREE_CODE (arg
) == TREE_CODE (parm
)
16215 && same_type_p (parm
, arg
))
16216 return unify_success (explain_p
);
16218 return unify_type_mismatch (explain_p
, parm
, arg
);
16220 idx
= TEMPLATE_TYPE_IDX (parm
);
16221 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
16222 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, idx
));
16224 /* Check for mixed types and values. */
16225 if ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
16226 && TREE_CODE (tparm
) != TYPE_DECL
)
16227 || (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
16228 && TREE_CODE (tparm
) != TEMPLATE_DECL
))
16229 gcc_unreachable ();
16231 if (TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
16233 /* ARG must be constructed from a template class or a template
16234 template parameter. */
16235 if (TREE_CODE (arg
) != BOUND_TEMPLATE_TEMPLATE_PARM
16236 && !CLASSTYPE_SPECIALIZATION_OF_PRIMARY_TEMPLATE_P (arg
))
16237 return unify_template_deduction_failure (explain_p
, parm
, arg
);
16240 tree parmvec
= TYPE_TI_ARGS (parm
);
16241 tree argvec
= INNERMOST_TEMPLATE_ARGS (TYPE_TI_ARGS (arg
));
16242 tree full_argvec
= add_to_template_args (targs
, argvec
);
16244 = DECL_INNERMOST_TEMPLATE_PARMS
16245 (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (parm
));
16247 int parm_variadic_p
= 0;
16249 /* The resolution to DR150 makes clear that default
16250 arguments for an N-argument may not be used to bind T
16251 to a template template parameter with fewer than N
16252 parameters. It is not safe to permit the binding of
16253 default arguments as an extension, as that may change
16254 the meaning of a conforming program. Consider:
16256 struct Dense { static const unsigned int dim = 1; };
16258 template <template <typename> class View,
16260 void operator+(float, View<Block> const&);
16262 template <typename Block,
16263 unsigned int Dim = Block::dim>
16264 struct Lvalue_proxy { operator float() const; };
16268 Lvalue_proxy<Dense> p;
16273 Here, if Lvalue_proxy is permitted to bind to View, then
16274 the global operator+ will be used; if they are not, the
16275 Lvalue_proxy will be converted to float. */
16276 if (coerce_template_parms (parm_parms
,
16278 TYPE_TI_TEMPLATE (parm
),
16280 ? tf_warning_or_error
16282 /*require_all_args=*/true,
16283 /*use_default_args=*/false)
16284 == error_mark_node
)
16287 /* Deduce arguments T, i from TT<T> or TT<i>.
16288 We check each element of PARMVEC and ARGVEC individually
16289 rather than the whole TREE_VEC since they can have
16290 different number of elements. */
16292 parmvec
= expand_template_argument_pack (parmvec
);
16293 argvec
= expand_template_argument_pack (argvec
);
16295 len
= TREE_VEC_LENGTH (parmvec
);
16297 /* Check if the parameters end in a pack, making them
16300 && PACK_EXPANSION_P (TREE_VEC_ELT (parmvec
, len
- 1)))
16301 parm_variadic_p
= 1;
16303 if (TREE_VEC_LENGTH (argvec
) < len
- parm_variadic_p
)
16304 return unify_too_few_arguments (explain_p
,
16305 TREE_VEC_LENGTH (argvec
), len
);
16307 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
16309 RECUR_AND_CHECK_FAILURE (tparms
, targs
,
16310 TREE_VEC_ELT (parmvec
, i
),
16311 TREE_VEC_ELT (argvec
, i
),
16312 UNIFY_ALLOW_NONE
, explain_p
);
16315 if (parm_variadic_p
16316 && unify_pack_expansion (tparms
, targs
,
16319 /*subr=*/true, explain_p
))
16322 arg
= TYPE_TI_TEMPLATE (arg
);
16324 /* Fall through to deduce template name. */
16327 if (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
16328 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
16330 /* Deduce template name TT from TT, TT<>, TT<T> and TT<i>. */
16332 /* Simple cases: Value already set, does match or doesn't. */
16333 if (targ
!= NULL_TREE
&& template_args_equal (targ
, arg
))
16334 return unify_success (explain_p
);
16336 return unify_inconsistency (explain_p
, parm
, targ
, arg
);
16340 /* If PARM is `const T' and ARG is only `int', we don't have
16341 a match unless we are allowing additional qualification.
16342 If ARG is `const int' and PARM is just `T' that's OK;
16343 that binds `const int' to `T'. */
16344 if (!check_cv_quals_for_unify (strict_in
| UNIFY_ALLOW_LESS_CV_QUAL
,
16346 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
16348 /* Consider the case where ARG is `const volatile int' and
16349 PARM is `const T'. Then, T should be `volatile int'. */
16350 arg
= cp_build_qualified_type_real
16351 (arg
, cp_type_quals (arg
) & ~cp_type_quals (parm
), tf_none
);
16352 if (arg
== error_mark_node
)
16353 return unify_invalid (explain_p
);
16355 /* Simple cases: Value already set, does match or doesn't. */
16356 if (targ
!= NULL_TREE
&& same_type_p (targ
, arg
))
16357 return unify_success (explain_p
);
16359 return unify_inconsistency (explain_p
, parm
, targ
, arg
);
16361 /* Make sure that ARG is not a variable-sized array. (Note
16362 that were talking about variable-sized arrays (like
16363 `int[n]'), rather than arrays of unknown size (like
16364 `int[]').) We'll get very confused by such a type since
16365 the bound of the array is not constant, and therefore
16366 not mangleable. Besides, such types are not allowed in
16367 ISO C++, so we can do as we please here. We do allow
16368 them for 'auto' deduction, since that isn't ABI-exposed. */
16369 if (!is_auto (parm
) && variably_modified_type_p (arg
, NULL_TREE
))
16370 return unify_vla_arg (explain_p
, arg
);
16372 /* Strip typedefs as in convert_template_argument. */
16373 arg
= canonicalize_type_argument (arg
, tf_none
);
16376 /* If ARG is a parameter pack or an expansion, we cannot unify
16377 against it unless PARM is also a parameter pack. */
16378 if ((template_parameter_pack_p (arg
) || PACK_EXPANSION_P (arg
))
16379 && !template_parameter_pack_p (parm
))
16380 return unify_parameter_pack_mismatch (explain_p
, parm
, arg
);
16382 /* If the argument deduction results is a METHOD_TYPE,
16383 then there is a problem.
16384 METHOD_TYPE doesn't map to any real C++ type the result of
16385 the deduction can not be of that type. */
16386 if (TREE_CODE (arg
) == METHOD_TYPE
)
16387 return unify_method_type_error (explain_p
, arg
);
16389 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = arg
;
16390 return unify_success (explain_p
);
16392 case TEMPLATE_PARM_INDEX
:
16393 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
16394 if (tparm
== error_mark_node
)
16395 return unify_invalid (explain_p
);
16397 if (TEMPLATE_PARM_LEVEL (parm
)
16398 != template_decl_level (tparm
))
16400 /* The PARM is not one we're trying to unify. Just check
16401 to see if it matches ARG. */
16402 int result
= !(TREE_CODE (arg
) == TREE_CODE (parm
)
16403 && cp_tree_equal (parm
, arg
));
16405 unify_expression_unequal (explain_p
, parm
, arg
);
16409 idx
= TEMPLATE_PARM_IDX (parm
);
16410 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
16414 int x
= !cp_tree_equal (targ
, arg
);
16416 unify_inconsistency (explain_p
, parm
, targ
, arg
);
16420 /* [temp.deduct.type] If, in the declaration of a function template
16421 with a non-type template-parameter, the non-type
16422 template-parameter is used in an expression in the function
16423 parameter-list and, if the corresponding template-argument is
16424 deduced, the template-argument type shall match the type of the
16425 template-parameter exactly, except that a template-argument
16426 deduced from an array bound may be of any integral type.
16427 The non-type parameter might use already deduced type parameters. */
16428 tparm
= tsubst (TREE_TYPE (parm
), targs
, 0, NULL_TREE
);
16429 if (!TREE_TYPE (arg
))
16430 /* Template-parameter dependent expression. Just accept it for now.
16431 It will later be processed in convert_template_argument. */
16433 else if (same_type_p (TREE_TYPE (arg
), tparm
))
16435 else if ((strict
& UNIFY_ALLOW_INTEGER
)
16436 && (TREE_CODE (tparm
) == INTEGER_TYPE
16437 || TREE_CODE (tparm
) == BOOLEAN_TYPE
))
16438 /* Convert the ARG to the type of PARM; the deduced non-type
16439 template argument must exactly match the types of the
16440 corresponding parameter. */
16441 arg
= fold (build_nop (tparm
, arg
));
16442 else if (uses_template_parms (tparm
))
16443 /* We haven't deduced the type of this parameter yet. Try again
16445 return unify_success (explain_p
);
16447 return unify_type_mismatch (explain_p
, tparm
, arg
);
16449 /* If ARG is a parameter pack or an expansion, we cannot unify
16450 against it unless PARM is also a parameter pack. */
16451 if ((template_parameter_pack_p (arg
) || PACK_EXPANSION_P (arg
))
16452 && !TEMPLATE_PARM_PARAMETER_PACK (parm
))
16453 return unify_parameter_pack_mismatch (explain_p
, parm
, arg
);
16455 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = arg
;
16456 return unify_success (explain_p
);
16460 /* A pointer-to-member constant can be unified only with
16461 another constant. */
16462 if (TREE_CODE (arg
) != PTRMEM_CST
)
16463 return unify_ptrmem_cst_mismatch (explain_p
, parm
, arg
);
16465 /* Just unify the class member. It would be useless (and possibly
16466 wrong, depending on the strict flags) to unify also
16467 PTRMEM_CST_CLASS, because we want to be sure that both parm and
16468 arg refer to the same variable, even if through different
16469 classes. For instance:
16471 struct A { int x; };
16474 Unification of &A::x and &B::x must succeed. */
16475 return unify (tparms
, targs
, PTRMEM_CST_MEMBER (parm
),
16476 PTRMEM_CST_MEMBER (arg
), strict
, explain_p
);
16481 if (TREE_CODE (arg
) != POINTER_TYPE
)
16482 return unify_type_mismatch (explain_p
, parm
, arg
);
16484 /* [temp.deduct.call]
16486 A can be another pointer or pointer to member type that can
16487 be converted to the deduced A via a qualification
16488 conversion (_conv.qual_).
16490 We pass down STRICT here rather than UNIFY_ALLOW_NONE.
16491 This will allow for additional cv-qualification of the
16492 pointed-to types if appropriate. */
16494 if (TREE_CODE (TREE_TYPE (arg
)) == RECORD_TYPE
)
16495 /* The derived-to-base conversion only persists through one
16496 level of pointers. */
16497 strict
|= (strict_in
& UNIFY_ALLOW_DERIVED
);
16499 return unify (tparms
, targs
, TREE_TYPE (parm
),
16500 TREE_TYPE (arg
), strict
, explain_p
);
16503 case REFERENCE_TYPE
:
16504 if (TREE_CODE (arg
) != REFERENCE_TYPE
)
16505 return unify_type_mismatch (explain_p
, parm
, arg
);
16506 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
16507 strict
& UNIFY_ALLOW_MORE_CV_QUAL
, explain_p
);
16510 if (TREE_CODE (arg
) != ARRAY_TYPE
)
16511 return unify_type_mismatch (explain_p
, parm
, arg
);
16512 if ((TYPE_DOMAIN (parm
) == NULL_TREE
)
16513 != (TYPE_DOMAIN (arg
) == NULL_TREE
))
16514 return unify_type_mismatch (explain_p
, parm
, arg
);
16515 if (TYPE_DOMAIN (parm
) != NULL_TREE
)
16522 /* Our representation of array types uses "N - 1" as the
16523 TYPE_MAX_VALUE for an array with "N" elements, if "N" is
16524 not an integer constant. We cannot unify arbitrarily
16525 complex expressions, so we eliminate the MINUS_EXPRs
16527 parm_max
= TYPE_MAX_VALUE (TYPE_DOMAIN (parm
));
16528 parm_cst
= TREE_CODE (parm_max
) == INTEGER_CST
;
16531 gcc_assert (TREE_CODE (parm_max
) == MINUS_EXPR
);
16532 parm_max
= TREE_OPERAND (parm_max
, 0);
16534 arg_max
= TYPE_MAX_VALUE (TYPE_DOMAIN (arg
));
16535 arg_cst
= TREE_CODE (arg_max
) == INTEGER_CST
;
16538 /* The ARG_MAX may not be a simple MINUS_EXPR, if we are
16539 trying to unify the type of a variable with the type
16540 of a template parameter. For example:
16542 template <unsigned int N>
16543 void f (char (&) [N]);
16550 Here, the type of the ARG will be "int [g(i)]", and
16551 may be a SAVE_EXPR, etc. */
16552 if (TREE_CODE (arg_max
) != MINUS_EXPR
)
16553 return unify_vla_arg (explain_p
, arg
);
16554 arg_max
= TREE_OPERAND (arg_max
, 0);
16557 /* If only one of the bounds used a MINUS_EXPR, compensate
16558 by adding one to the other bound. */
16559 if (parm_cst
&& !arg_cst
)
16560 parm_max
= fold_build2_loc (input_location
, PLUS_EXPR
,
16564 else if (arg_cst
&& !parm_cst
)
16565 arg_max
= fold_build2_loc (input_location
, PLUS_EXPR
,
16570 RECUR_AND_CHECK_FAILURE (tparms
, targs
, parm_max
, arg_max
,
16571 UNIFY_ALLOW_INTEGER
, explain_p
);
16573 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
16574 strict
& UNIFY_ALLOW_MORE_CV_QUAL
, explain_p
);
16581 case ENUMERAL_TYPE
:
16583 if (TREE_CODE (arg
) != TREE_CODE (parm
))
16584 return unify_type_mismatch (explain_p
, parm
, arg
);
16586 /* We have already checked cv-qualification at the top of the
16588 if (!same_type_ignoring_top_level_qualifiers_p (arg
, parm
))
16589 return unify_type_mismatch (explain_p
, parm
, arg
);
16591 /* As far as unification is concerned, this wins. Later checks
16592 will invalidate it if necessary. */
16593 return unify_success (explain_p
);
16595 /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */
16596 /* Type INTEGER_CST can come from ordinary constant template args. */
16598 while (TREE_CODE (arg
) == NOP_EXPR
)
16599 arg
= TREE_OPERAND (arg
, 0);
16601 if (TREE_CODE (arg
) != INTEGER_CST
)
16602 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
16603 return (tree_int_cst_equal (parm
, arg
)
16604 ? unify_success (explain_p
)
16605 : unify_template_argument_mismatch (explain_p
, parm
, arg
));
16609 int i
, len
, argslen
;
16610 int parm_variadic_p
= 0;
16612 if (TREE_CODE (arg
) != TREE_VEC
)
16613 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
16615 len
= TREE_VEC_LENGTH (parm
);
16616 argslen
= TREE_VEC_LENGTH (arg
);
16618 /* Check for pack expansions in the parameters. */
16619 for (i
= 0; i
< len
; ++i
)
16621 if (PACK_EXPANSION_P (TREE_VEC_ELT (parm
, i
)))
16624 /* We can unify against something with a trailing
16626 parm_variadic_p
= 1;
16628 /* [temp.deduct.type]/9: If the template argument list of
16629 P contains a pack expansion that is not the last
16630 template argument, the entire template argument list
16631 is a non-deduced context. */
16632 return unify_success (explain_p
);
16636 /* If we don't have enough arguments to satisfy the parameters
16637 (not counting the pack expression at the end), or we have
16638 too many arguments for a parameter list that doesn't end in
16639 a pack expression, we can't unify. */
16640 if (parm_variadic_p
16641 ? argslen
< len
- parm_variadic_p
16643 return unify_arity (explain_p
, TREE_VEC_LENGTH (arg
), len
);
16645 /* Unify all of the parameters that precede the (optional)
16646 pack expression. */
16647 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
16649 RECUR_AND_CHECK_FAILURE (tparms
, targs
,
16650 TREE_VEC_ELT (parm
, i
),
16651 TREE_VEC_ELT (arg
, i
),
16652 UNIFY_ALLOW_NONE
, explain_p
);
16654 if (parm_variadic_p
)
16655 return unify_pack_expansion (tparms
, targs
, parm
, arg
,
16657 /*subr=*/true, explain_p
);
16658 return unify_success (explain_p
);
16663 if (TREE_CODE (arg
) != TREE_CODE (parm
))
16664 return unify_type_mismatch (explain_p
, parm
, arg
);
16666 if (TYPE_PTRMEMFUNC_P (parm
))
16668 if (!TYPE_PTRMEMFUNC_P (arg
))
16669 return unify_type_mismatch (explain_p
, parm
, arg
);
16671 return unify (tparms
, targs
,
16672 TYPE_PTRMEMFUNC_FN_TYPE (parm
),
16673 TYPE_PTRMEMFUNC_FN_TYPE (arg
),
16674 strict
, explain_p
);
16677 if (CLASSTYPE_TEMPLATE_INFO (parm
))
16679 tree t
= NULL_TREE
;
16681 if (strict_in
& UNIFY_ALLOW_DERIVED
)
16683 /* First, we try to unify the PARM and ARG directly. */
16684 t
= try_class_unification (tparms
, targs
,
16685 parm
, arg
, explain_p
);
16689 /* Fallback to the special case allowed in
16690 [temp.deduct.call]:
16692 If P is a class, and P has the form
16693 template-id, then A can be a derived class of
16694 the deduced A. Likewise, if P is a pointer to
16695 a class of the form template-id, A can be a
16696 pointer to a derived class pointed to by the
16698 enum template_base_result r
;
16699 r
= get_template_base (tparms
, targs
, parm
, arg
,
16703 return unify_no_common_base (explain_p
, r
, parm
, arg
);
16706 else if (CLASSTYPE_TEMPLATE_INFO (arg
)
16707 && (CLASSTYPE_TI_TEMPLATE (parm
)
16708 == CLASSTYPE_TI_TEMPLATE (arg
)))
16709 /* Perhaps PARM is something like S<U> and ARG is S<int>.
16710 Then, we should unify `int' and `U'. */
16713 /* There's no chance of unification succeeding. */
16714 return unify_type_mismatch (explain_p
, parm
, arg
);
16716 return unify (tparms
, targs
, CLASSTYPE_TI_ARGS (parm
),
16717 CLASSTYPE_TI_ARGS (t
), UNIFY_ALLOW_NONE
, explain_p
);
16719 else if (!same_type_ignoring_top_level_qualifiers_p (parm
, arg
))
16720 return unify_type_mismatch (explain_p
, parm
, arg
);
16721 return unify_success (explain_p
);
16724 case FUNCTION_TYPE
:
16726 unsigned int nargs
;
16731 if (TREE_CODE (arg
) != TREE_CODE (parm
))
16732 return unify_type_mismatch (explain_p
, parm
, arg
);
16734 /* CV qualifications for methods can never be deduced, they must
16735 match exactly. We need to check them explicitly here,
16736 because type_unification_real treats them as any other
16737 cv-qualified parameter. */
16738 if (TREE_CODE (parm
) == METHOD_TYPE
16739 && (!check_cv_quals_for_unify
16741 class_of_this_parm (arg
),
16742 class_of_this_parm (parm
))))
16743 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
16745 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TREE_TYPE (parm
),
16746 TREE_TYPE (arg
), UNIFY_ALLOW_NONE
, explain_p
);
16748 nargs
= list_length (TYPE_ARG_TYPES (arg
));
16749 args
= XALLOCAVEC (tree
, nargs
);
16750 for (a
= TYPE_ARG_TYPES (arg
), i
= 0;
16751 a
!= NULL_TREE
&& a
!= void_list_node
;
16752 a
= TREE_CHAIN (a
), ++i
)
16753 args
[i
] = TREE_VALUE (a
);
16756 return type_unification_real (tparms
, targs
, TYPE_ARG_TYPES (parm
),
16757 args
, nargs
, 1, DEDUCE_EXACT
,
16758 LOOKUP_NORMAL
, explain_p
);
16762 /* Unify a pointer to member with a pointer to member function, which
16763 deduces the type of the member as a function type. */
16764 if (TYPE_PTRMEMFUNC_P (arg
))
16769 /* Check top-level cv qualifiers */
16770 if (!check_cv_quals_for_unify (UNIFY_ALLOW_NONE
, arg
, parm
))
16771 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
16773 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
16774 TYPE_PTRMEMFUNC_OBJECT_TYPE (arg
),
16775 UNIFY_ALLOW_NONE
, explain_p
);
16777 /* Determine the type of the function we are unifying against. */
16778 method_type
= TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (arg
));
16780 build_function_type (TREE_TYPE (method_type
),
16781 TREE_CHAIN (TYPE_ARG_TYPES (method_type
)));
16783 /* Extract the cv-qualifiers of the member function from the
16784 implicit object parameter and place them on the function
16785 type to be restored later. */
16786 fntype
= apply_memfn_quals (fntype
, type_memfn_quals (method_type
));
16787 return unify (tparms
, targs
, TREE_TYPE (parm
), fntype
, strict
, explain_p
);
16790 if (TREE_CODE (arg
) != OFFSET_TYPE
)
16791 return unify_type_mismatch (explain_p
, parm
, arg
);
16792 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
16793 TYPE_OFFSET_BASETYPE (arg
),
16794 UNIFY_ALLOW_NONE
, explain_p
);
16795 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
16796 strict
, explain_p
);
16799 if (DECL_TEMPLATE_PARM_P (parm
))
16800 return unify (tparms
, targs
, DECL_INITIAL (parm
), arg
, strict
, explain_p
);
16801 if (arg
!= integral_constant_value (parm
))
16802 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
16803 return unify_success (explain_p
);
16806 case TEMPLATE_DECL
:
16807 /* Matched cases are handled by the ARG == PARM test above. */
16808 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
16811 /* A non-type template parameter that is a variable should be a
16812 an integral constant, in which case, it whould have been
16813 folded into its (constant) value. So we should not be getting
16814 a variable here. */
16815 gcc_unreachable ();
16817 case TYPE_ARGUMENT_PACK
:
16818 case NONTYPE_ARGUMENT_PACK
:
16819 return unify (tparms
, targs
, ARGUMENT_PACK_ARGS (parm
),
16820 ARGUMENT_PACK_ARGS (arg
), strict
, explain_p
);
16823 case DECLTYPE_TYPE
:
16824 case UNDERLYING_TYPE
:
16825 /* Cannot deduce anything from TYPEOF_TYPE, DECLTYPE_TYPE,
16826 or UNDERLYING_TYPE nodes. */
16827 return unify_success (explain_p
);
16830 /* Unification fails if we hit an error node. */
16831 return unify_invalid (explain_p
);
16834 /* An unresolved overload is a nondeduced context. */
16835 if (type_unknown_p (parm
))
16836 return unify_success (explain_p
);
16837 gcc_assert (EXPR_P (parm
));
16839 /* We must be looking at an expression. This can happen with
16843 void foo(S<I>, S<I + 2>);
16845 This is a "nondeduced context":
16849 The nondeduced contexts are:
16851 --A type that is a template-id in which one or more of
16852 the template-arguments is an expression that references
16853 a template-parameter.
16855 In these cases, we assume deduction succeeded, but don't
16856 actually infer any unifications. */
16858 if (!uses_template_parms (parm
)
16859 && !template_args_equal (parm
, arg
))
16860 return unify_expression_unequal (explain_p
, parm
, arg
);
16862 return unify_success (explain_p
);
16865 #undef RECUR_AND_CHECK_FAILURE
16867 /* Note that DECL can be defined in this translation unit, if
16871 mark_definable (tree decl
)
16874 DECL_NOT_REALLY_EXTERN (decl
) = 1;
16875 FOR_EACH_CLONE (clone
, decl
)
16876 DECL_NOT_REALLY_EXTERN (clone
) = 1;
16879 /* Called if RESULT is explicitly instantiated, or is a member of an
16880 explicitly instantiated class. */
16883 mark_decl_instantiated (tree result
, int extern_p
)
16885 SET_DECL_EXPLICIT_INSTANTIATION (result
);
16887 /* If this entity has already been written out, it's too late to
16888 make any modifications. */
16889 if (TREE_ASM_WRITTEN (result
))
16892 if (TREE_CODE (result
) != FUNCTION_DECL
)
16893 /* The TREE_PUBLIC flag for function declarations will have been
16894 set correctly by tsubst. */
16895 TREE_PUBLIC (result
) = 1;
16897 /* This might have been set by an earlier implicit instantiation. */
16898 DECL_COMDAT (result
) = 0;
16901 DECL_NOT_REALLY_EXTERN (result
) = 0;
16904 mark_definable (result
);
16905 /* Always make artificials weak. */
16906 if (DECL_ARTIFICIAL (result
) && flag_weak
)
16907 comdat_linkage (result
);
16908 /* For WIN32 we also want to put explicit instantiations in
16909 linkonce sections. */
16910 else if (TREE_PUBLIC (result
))
16911 maybe_make_one_only (result
);
16914 /* If EXTERN_P, then this function will not be emitted -- unless
16915 followed by an explicit instantiation, at which point its linkage
16916 will be adjusted. If !EXTERN_P, then this function will be
16917 emitted here. In neither circumstance do we want
16918 import_export_decl to adjust the linkage. */
16919 DECL_INTERFACE_KNOWN (result
) = 1;
16922 /* Subroutine of more_specialized_fn: check whether TARGS is missing any
16923 important template arguments. If any are missing, we check whether
16924 they're important by using error_mark_node for substituting into any
16925 args that were used for partial ordering (the ones between ARGS and END)
16926 and seeing if it bubbles up. */
16929 check_undeduced_parms (tree targs
, tree args
, tree end
)
16931 bool found
= false;
16933 for (i
= TREE_VEC_LENGTH (targs
) - 1; i
>= 0; --i
)
16934 if (TREE_VEC_ELT (targs
, i
) == NULL_TREE
)
16937 TREE_VEC_ELT (targs
, i
) = error_mark_node
;
16941 for (; args
!= end
; args
= TREE_CHAIN (args
))
16943 tree substed
= tsubst (TREE_VALUE (args
), targs
, tf_none
, NULL_TREE
);
16944 if (substed
== error_mark_node
)
16951 /* Given two function templates PAT1 and PAT2, return:
16953 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order].
16954 -1 if PAT2 is more specialized than PAT1.
16955 0 if neither is more specialized.
16957 LEN indicates the number of parameters we should consider
16958 (defaulted parameters should not be considered).
16960 The 1998 std underspecified function template partial ordering, and
16961 DR214 addresses the issue. We take pairs of arguments, one from
16962 each of the templates, and deduce them against each other. One of
16963 the templates will be more specialized if all the *other*
16964 template's arguments deduce against its arguments and at least one
16965 of its arguments *does* *not* deduce against the other template's
16966 corresponding argument. Deduction is done as for class templates.
16967 The arguments used in deduction have reference and top level cv
16968 qualifiers removed. Iff both arguments were originally reference
16969 types *and* deduction succeeds in both directions, the template
16970 with the more cv-qualified argument wins for that pairing (if
16971 neither is more cv-qualified, they both are equal). Unlike regular
16972 deduction, after all the arguments have been deduced in this way,
16973 we do *not* verify the deduced template argument values can be
16974 substituted into non-deduced contexts.
16976 The logic can be a bit confusing here, because we look at deduce1 and
16977 targs1 to see if pat2 is at least as specialized, and vice versa; if we
16978 can find template arguments for pat1 to make arg1 look like arg2, that
16979 means that arg2 is at least as specialized as arg1. */
16982 more_specialized_fn (tree pat1
, tree pat2
, int len
)
16984 tree decl1
= DECL_TEMPLATE_RESULT (pat1
);
16985 tree decl2
= DECL_TEMPLATE_RESULT (pat2
);
16986 tree targs1
= make_tree_vec (DECL_NTPARMS (pat1
));
16987 tree targs2
= make_tree_vec (DECL_NTPARMS (pat2
));
16988 tree tparms1
= DECL_INNERMOST_TEMPLATE_PARMS (pat1
);
16989 tree tparms2
= DECL_INNERMOST_TEMPLATE_PARMS (pat2
);
16990 tree args1
= TYPE_ARG_TYPES (TREE_TYPE (decl1
));
16991 tree args2
= TYPE_ARG_TYPES (TREE_TYPE (decl2
));
16992 tree origs1
, origs2
;
16993 bool lose1
= false;
16994 bool lose2
= false;
16996 /* Remove the this parameter from non-static member functions. If
16997 one is a non-static member function and the other is not a static
16998 member function, remove the first parameter from that function
16999 also. This situation occurs for operator functions where we
17000 locate both a member function (with this pointer) and non-member
17001 operator (with explicit first operand). */
17002 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl1
))
17004 len
--; /* LEN is the number of significant arguments for DECL1 */
17005 args1
= TREE_CHAIN (args1
);
17006 if (!DECL_STATIC_FUNCTION_P (decl2
))
17007 args2
= TREE_CHAIN (args2
);
17009 else if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl2
))
17011 args2
= TREE_CHAIN (args2
);
17012 if (!DECL_STATIC_FUNCTION_P (decl1
))
17015 args1
= TREE_CHAIN (args1
);
17019 /* If only one is a conversion operator, they are unordered. */
17020 if (DECL_CONV_FN_P (decl1
) != DECL_CONV_FN_P (decl2
))
17023 /* Consider the return type for a conversion function */
17024 if (DECL_CONV_FN_P (decl1
))
17026 args1
= tree_cons (NULL_TREE
, TREE_TYPE (TREE_TYPE (decl1
)), args1
);
17027 args2
= tree_cons (NULL_TREE
, TREE_TYPE (TREE_TYPE (decl2
)), args2
);
17031 processing_template_decl
++;
17037 /* Stop when an ellipsis is seen. */
17038 && args1
!= NULL_TREE
&& args2
!= NULL_TREE
)
17040 tree arg1
= TREE_VALUE (args1
);
17041 tree arg2
= TREE_VALUE (args2
);
17042 int deduce1
, deduce2
;
17046 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
17047 && TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
17049 /* When both arguments are pack expansions, we need only
17050 unify the patterns themselves. */
17051 arg1
= PACK_EXPANSION_PATTERN (arg1
);
17052 arg2
= PACK_EXPANSION_PATTERN (arg2
);
17054 /* This is the last comparison we need to do. */
17058 if (TREE_CODE (arg1
) == REFERENCE_TYPE
)
17060 arg1
= TREE_TYPE (arg1
);
17061 quals1
= cp_type_quals (arg1
);
17064 if (TREE_CODE (arg2
) == REFERENCE_TYPE
)
17066 arg2
= TREE_TYPE (arg2
);
17067 quals2
= cp_type_quals (arg2
);
17070 if ((quals1
< 0) != (quals2
< 0))
17072 /* Only of the args is a reference, see if we should apply
17073 array/function pointer decay to it. This is not part of
17074 DR214, but is, IMHO, consistent with the deduction rules
17075 for the function call itself, and with our earlier
17076 implementation of the underspecified partial ordering
17077 rules. (nathan). */
17080 switch (TREE_CODE (arg1
))
17083 arg1
= TREE_TYPE (arg1
);
17085 case FUNCTION_TYPE
:
17086 arg1
= build_pointer_type (arg1
);
17095 switch (TREE_CODE (arg2
))
17098 arg2
= TREE_TYPE (arg2
);
17100 case FUNCTION_TYPE
:
17101 arg2
= build_pointer_type (arg2
);
17110 arg1
= TYPE_MAIN_VARIANT (arg1
);
17111 arg2
= TYPE_MAIN_VARIANT (arg2
);
17113 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
)
17115 int i
, len2
= list_length (args2
);
17116 tree parmvec
= make_tree_vec (1);
17117 tree argvec
= make_tree_vec (len2
);
17120 /* Setup the parameter vector, which contains only ARG1. */
17121 TREE_VEC_ELT (parmvec
, 0) = arg1
;
17123 /* Setup the argument vector, which contains the remaining
17125 for (i
= 0; i
< len2
; i
++, ta
= TREE_CHAIN (ta
))
17126 TREE_VEC_ELT (argvec
, i
) = TREE_VALUE (ta
);
17128 deduce1
= (unify_pack_expansion (tparms1
, targs1
, parmvec
,
17129 argvec
, DEDUCE_EXACT
,
17130 /*subr=*/true, /*explain_p=*/false)
17133 /* We cannot deduce in the other direction, because ARG1 is
17134 a pack expansion but ARG2 is not. */
17137 else if (TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
17139 int i
, len1
= list_length (args1
);
17140 tree parmvec
= make_tree_vec (1);
17141 tree argvec
= make_tree_vec (len1
);
17144 /* Setup the parameter vector, which contains only ARG1. */
17145 TREE_VEC_ELT (parmvec
, 0) = arg2
;
17147 /* Setup the argument vector, which contains the remaining
17149 for (i
= 0; i
< len1
; i
++, ta
= TREE_CHAIN (ta
))
17150 TREE_VEC_ELT (argvec
, i
) = TREE_VALUE (ta
);
17152 deduce2
= (unify_pack_expansion (tparms2
, targs2
, parmvec
,
17153 argvec
, DEDUCE_EXACT
,
17154 /*subr=*/true, /*explain_p=*/false)
17157 /* We cannot deduce in the other direction, because ARG2 is
17158 a pack expansion but ARG1 is not.*/
17164 /* The normal case, where neither argument is a pack
17166 deduce1
= (unify (tparms1
, targs1
, arg1
, arg2
,
17167 UNIFY_ALLOW_NONE
, /*explain_p=*/false)
17169 deduce2
= (unify (tparms2
, targs2
, arg2
, arg1
,
17170 UNIFY_ALLOW_NONE
, /*explain_p=*/false)
17174 /* If we couldn't deduce arguments for tparms1 to make arg1 match
17175 arg2, then arg2 is not as specialized as arg1. */
17181 /* "If, for a given type, deduction succeeds in both directions
17182 (i.e., the types are identical after the transformations above)
17183 and if the type from the argument template is more cv-qualified
17184 than the type from the parameter template (as described above)
17185 that type is considered to be more specialized than the other. If
17186 neither type is more cv-qualified than the other then neither type
17187 is more specialized than the other." */
17189 if (deduce1
&& deduce2
17190 && quals1
!= quals2
&& quals1
>= 0 && quals2
>= 0)
17192 if ((quals1
& quals2
) == quals2
)
17194 if ((quals1
& quals2
) == quals1
)
17198 if (lose1
&& lose2
)
17199 /* We've failed to deduce something in either direction.
17200 These must be unordered. */
17203 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
17204 || TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
17205 /* We have already processed all of the arguments in our
17206 handing of the pack expansion type. */
17209 args1
= TREE_CHAIN (args1
);
17210 args2
= TREE_CHAIN (args2
);
17213 /* "In most cases, all template parameters must have values in order for
17214 deduction to succeed, but for partial ordering purposes a template
17215 parameter may remain without a value provided it is not used in the
17216 types being used for partial ordering."
17218 Thus, if we are missing any of the targs1 we need to substitute into
17219 origs1, then pat2 is not as specialized as pat1. This can happen when
17220 there is a nondeduced context. */
17221 if (!lose2
&& check_undeduced_parms (targs1
, origs1
, args1
))
17223 if (!lose1
&& check_undeduced_parms (targs2
, origs2
, args2
))
17226 processing_template_decl
--;
17228 /* All things being equal, if the next argument is a pack expansion
17229 for one function but not for the other, prefer the
17230 non-variadic function. FIXME this is bogus; see c++/41958. */
17232 && args1
&& TREE_VALUE (args1
)
17233 && args2
&& TREE_VALUE (args2
))
17235 lose1
= TREE_CODE (TREE_VALUE (args1
)) == TYPE_PACK_EXPANSION
;
17236 lose2
= TREE_CODE (TREE_VALUE (args2
)) == TYPE_PACK_EXPANSION
;
17239 if (lose1
== lose2
)
17247 /* Determine which of two partial specializations is more specialized.
17249 PAT1 is a TREE_LIST whose TREE_TYPE is the _TYPE node corresponding
17250 to the first partial specialization. The TREE_VALUE is the
17251 innermost set of template parameters for the partial
17252 specialization. PAT2 is similar, but for the second template.
17254 Return 1 if the first partial specialization is more specialized;
17255 -1 if the second is more specialized; 0 if neither is more
17258 See [temp.class.order] for information about determining which of
17259 two templates is more specialized. */
17262 more_specialized_class (tree pat1
, tree pat2
)
17267 bool any_deductions
= false;
17269 tmpl1
= TREE_TYPE (pat1
);
17270 tmpl2
= TREE_TYPE (pat2
);
17272 /* Just like what happens for functions, if we are ordering between
17273 different class template specializations, we may encounter dependent
17274 types in the arguments, and we need our dependency check functions
17275 to behave correctly. */
17276 ++processing_template_decl
;
17277 targs
= get_class_bindings (TREE_VALUE (pat1
),
17278 CLASSTYPE_TI_ARGS (tmpl1
),
17279 CLASSTYPE_TI_ARGS (tmpl2
));
17283 any_deductions
= true;
17286 targs
= get_class_bindings (TREE_VALUE (pat2
),
17287 CLASSTYPE_TI_ARGS (tmpl2
),
17288 CLASSTYPE_TI_ARGS (tmpl1
));
17292 any_deductions
= true;
17294 --processing_template_decl
;
17296 /* In the case of a tie where at least one of the class templates
17297 has a parameter pack at the end, the template with the most
17298 non-packed parameters wins. */
17301 && (template_args_variadic_p (TREE_PURPOSE (pat1
))
17302 || template_args_variadic_p (TREE_PURPOSE (pat2
))))
17304 tree args1
= INNERMOST_TEMPLATE_ARGS (TREE_PURPOSE (pat1
));
17305 tree args2
= INNERMOST_TEMPLATE_ARGS (TREE_PURPOSE (pat2
));
17306 int len1
= TREE_VEC_LENGTH (args1
);
17307 int len2
= TREE_VEC_LENGTH (args2
);
17309 /* We don't count the pack expansion at the end. */
17310 if (template_args_variadic_p (TREE_PURPOSE (pat1
)))
17312 if (template_args_variadic_p (TREE_PURPOSE (pat2
)))
17317 else if (len1
< len2
)
17324 /* Return the template arguments that will produce the function signature
17325 DECL from the function template FN, with the explicit template
17326 arguments EXPLICIT_ARGS. If CHECK_RETTYPE is true, the return type must
17327 also match. Return NULL_TREE if no satisfactory arguments could be
17331 get_bindings (tree fn
, tree decl
, tree explicit_args
, bool check_rettype
)
17333 int ntparms
= DECL_NTPARMS (fn
);
17334 tree targs
= make_tree_vec (ntparms
);
17336 tree decl_arg_types
;
17338 unsigned int nargs
, ix
;
17341 /* Substitute the explicit template arguments into the type of DECL.
17342 The call to fn_type_unification will handle substitution into the
17344 decl_type
= TREE_TYPE (decl
);
17345 if (explicit_args
&& uses_template_parms (decl_type
))
17348 tree converted_args
;
17350 if (DECL_TEMPLATE_INFO (decl
))
17351 tmpl
= DECL_TI_TEMPLATE (decl
);
17353 /* We can get here for some invalid specializations. */
17357 = coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
17358 explicit_args
, NULL_TREE
,
17360 /*require_all_args=*/false,
17361 /*use_default_args=*/false);
17362 if (converted_args
== error_mark_node
)
17365 decl_type
= tsubst (decl_type
, converted_args
, tf_none
, NULL_TREE
);
17366 if (decl_type
== error_mark_node
)
17370 /* Never do unification on the 'this' parameter. */
17371 decl_arg_types
= skip_artificial_parms_for (decl
,
17372 TYPE_ARG_TYPES (decl_type
));
17374 nargs
= list_length (decl_arg_types
);
17375 args
= XALLOCAVEC (tree
, nargs
);
17376 for (arg
= decl_arg_types
, ix
= 0;
17377 arg
!= NULL_TREE
&& arg
!= void_list_node
;
17378 arg
= TREE_CHAIN (arg
), ++ix
)
17379 args
[ix
] = TREE_VALUE (arg
);
17381 if (fn_type_unification (fn
, explicit_args
, targs
,
17383 (check_rettype
|| DECL_CONV_FN_P (fn
)
17384 ? TREE_TYPE (decl_type
) : NULL_TREE
),
17385 DEDUCE_EXACT
, LOOKUP_NORMAL
, /*explain_p=*/false))
17391 /* Return the innermost template arguments that, when applied to a
17392 template specialization whose innermost template parameters are
17393 TPARMS, and whose specialization arguments are SPEC_ARGS, yield the
17396 For example, suppose we have:
17398 template <class T, class U> struct S {};
17399 template <class T> struct S<T*, int> {};
17401 Then, suppose we want to get `S<double*, int>'. The TPARMS will be
17402 {T}, the SPEC_ARGS will be {T*, int} and the ARGS will be {double*,
17403 int}. The resulting vector will be {double}, indicating that `T'
17404 is bound to `double'. */
17407 get_class_bindings (tree tparms
, tree spec_args
, tree args
)
17409 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
17411 tree innermost_deduced_args
;
17413 innermost_deduced_args
= make_tree_vec (ntparms
);
17414 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
17416 deduced_args
= copy_node (args
);
17417 SET_TMPL_ARGS_LEVEL (deduced_args
,
17418 TMPL_ARGS_DEPTH (deduced_args
),
17419 innermost_deduced_args
);
17422 deduced_args
= innermost_deduced_args
;
17424 if (unify (tparms
, deduced_args
,
17425 INNERMOST_TEMPLATE_ARGS (spec_args
),
17426 INNERMOST_TEMPLATE_ARGS (args
),
17427 UNIFY_ALLOW_NONE
, /*explain_p=*/false))
17430 for (i
= 0; i
< ntparms
; ++i
)
17431 if (! TREE_VEC_ELT (innermost_deduced_args
, i
))
17434 /* Verify that nondeduced template arguments agree with the type
17435 obtained from argument deduction.
17439 struct A { typedef int X; };
17440 template <class T, class U> struct C {};
17441 template <class T> struct C<T, typename T::X> {};
17443 Then with the instantiation `C<A, int>', we can deduce that
17444 `T' is `A' but unify () does not check whether `typename T::X'
17446 spec_args
= tsubst (spec_args
, deduced_args
, tf_none
, NULL_TREE
);
17447 if (spec_args
== error_mark_node
17448 /* We only need to check the innermost arguments; the other
17449 arguments will always agree. */
17450 || !comp_template_args (INNERMOST_TEMPLATE_ARGS (spec_args
),
17451 INNERMOST_TEMPLATE_ARGS (args
)))
17454 /* Now that we have bindings for all of the template arguments,
17455 ensure that the arguments deduced for the template template
17456 parameters have compatible template parameter lists. See the use
17457 of template_template_parm_bindings_ok_p in fn_type_unification
17458 for more information. */
17459 if (!template_template_parm_bindings_ok_p (tparms
, deduced_args
))
17462 return deduced_args
;
17465 /* TEMPLATES is a TREE_LIST. Each TREE_VALUE is a TEMPLATE_DECL.
17466 Return the TREE_LIST node with the most specialized template, if
17467 any. If there is no most specialized template, the error_mark_node
17470 Note that this function does not look at, or modify, the
17471 TREE_PURPOSE or TREE_TYPE of any of the nodes. Since the node
17472 returned is one of the elements of INSTANTIATIONS, callers may
17473 store information in the TREE_PURPOSE or TREE_TYPE of the nodes,
17474 and retrieve it from the value returned. */
17477 most_specialized_instantiation (tree templates
)
17481 ++processing_template_decl
;
17484 for (fn
= TREE_CHAIN (templates
); fn
; fn
= TREE_CHAIN (fn
))
17488 if (get_bindings (TREE_VALUE (champ
),
17489 DECL_TEMPLATE_RESULT (TREE_VALUE (fn
)),
17490 NULL_TREE
, /*check_ret=*/true))
17493 if (get_bindings (TREE_VALUE (fn
),
17494 DECL_TEMPLATE_RESULT (TREE_VALUE (champ
)),
17495 NULL_TREE
, /*check_ret=*/true))
17502 /* Equally specialized, move to next function. If there
17503 is no next function, nothing's most specialized. */
17504 fn
= TREE_CHAIN (fn
);
17512 /* Now verify that champ is better than everything earlier in the
17513 instantiation list. */
17514 for (fn
= templates
; fn
!= champ
; fn
= TREE_CHAIN (fn
))
17515 if (get_bindings (TREE_VALUE (champ
),
17516 DECL_TEMPLATE_RESULT (TREE_VALUE (fn
)),
17517 NULL_TREE
, /*check_ret=*/true)
17518 || !get_bindings (TREE_VALUE (fn
),
17519 DECL_TEMPLATE_RESULT (TREE_VALUE (champ
)),
17520 NULL_TREE
, /*check_ret=*/true))
17526 processing_template_decl
--;
17529 return error_mark_node
;
17534 /* If DECL is a specialization of some template, return the most
17535 general such template. Otherwise, returns NULL_TREE.
17537 For example, given:
17539 template <class T> struct S { template <class U> void f(U); };
17541 if TMPL is `template <class U> void S<int>::f(U)' this will return
17542 the full template. This function will not trace past partial
17543 specializations, however. For example, given in addition:
17545 template <class T> struct S<T*> { template <class U> void f(U); };
17547 if TMPL is `template <class U> void S<int*>::f(U)' this will return
17548 `template <class T> template <class U> S<T*>::f(U)'. */
17551 most_general_template (tree decl
)
17553 /* If DECL is a FUNCTION_DECL, find the TEMPLATE_DECL of which it is
17554 an immediate specialization. */
17555 if (TREE_CODE (decl
) == FUNCTION_DECL
)
17557 if (DECL_TEMPLATE_INFO (decl
)) {
17558 decl
= DECL_TI_TEMPLATE (decl
);
17560 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE for a
17561 template friend. */
17562 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
17568 /* Look for more and more general templates. */
17569 while (DECL_TEMPLATE_INFO (decl
))
17571 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE in some cases.
17572 (See cp-tree.h for details.) */
17573 if (TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
17576 if (CLASS_TYPE_P (TREE_TYPE (decl
))
17577 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)))
17580 /* Stop if we run into an explicitly specialized class template. */
17581 if (!DECL_NAMESPACE_SCOPE_P (decl
)
17582 && DECL_CONTEXT (decl
)
17583 && CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (decl
)))
17586 decl
= DECL_TI_TEMPLATE (decl
);
17592 /* Return the most specialized of the class template partial
17593 specializations of TMPL which can produce TYPE, a specialization of
17594 TMPL. The value returned is actually a TREE_LIST; the TREE_TYPE is
17595 a _TYPE node corresponding to the partial specialization, while the
17596 TREE_PURPOSE is the set of template arguments that must be
17597 substituted into the TREE_TYPE in order to generate TYPE.
17599 If the choice of partial specialization is ambiguous, a diagnostic
17600 is issued, and the error_mark_node is returned. If there are no
17601 partial specializations of TMPL matching TYPE, then NULL_TREE is
17605 most_specialized_class (tree type
, tree tmpl
, tsubst_flags_t complain
)
17607 tree list
= NULL_TREE
;
17613 tree outer_args
= NULL_TREE
;
17615 tmpl
= most_general_template (tmpl
);
17616 args
= CLASSTYPE_TI_ARGS (type
);
17618 /* For determining which partial specialization to use, only the
17619 innermost args are interesting. */
17620 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
17622 outer_args
= strip_innermost_template_args (args
, 1);
17623 args
= INNERMOST_TEMPLATE_ARGS (args
);
17626 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
); t
; t
= TREE_CHAIN (t
))
17628 tree partial_spec_args
;
17630 tree parms
= TREE_VALUE (t
);
17632 partial_spec_args
= CLASSTYPE_TI_ARGS (TREE_TYPE (t
));
17634 ++processing_template_decl
;
17640 /* Discard the outer levels of args, and then substitute in the
17641 template args from the enclosing class. */
17642 partial_spec_args
= INNERMOST_TEMPLATE_ARGS (partial_spec_args
);
17643 partial_spec_args
= tsubst_template_args
17644 (partial_spec_args
, outer_args
, tf_none
, NULL_TREE
);
17646 /* PARMS already refers to just the innermost parms, but the
17647 template parms in partial_spec_args had their levels lowered
17648 by tsubst, so we need to do the same for the parm list. We
17649 can't just tsubst the TREE_VEC itself, as tsubst wants to
17650 treat a TREE_VEC as an argument vector. */
17651 parms
= copy_node (parms
);
17652 for (i
= TREE_VEC_LENGTH (parms
) - 1; i
>= 0; --i
)
17653 TREE_VEC_ELT (parms
, i
) =
17654 tsubst (TREE_VEC_ELT (parms
, i
), outer_args
, tf_none
, NULL_TREE
);
17658 partial_spec_args
=
17659 coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
17660 add_to_template_args (outer_args
,
17661 partial_spec_args
),
17663 /*require_all_args=*/true,
17664 /*use_default_args=*/true);
17666 --processing_template_decl
;
17668 if (partial_spec_args
== error_mark_node
)
17669 return error_mark_node
;
17671 spec_args
= get_class_bindings (parms
,
17677 spec_args
= add_to_template_args (outer_args
, spec_args
);
17678 list
= tree_cons (spec_args
, TREE_VALUE (t
), list
);
17679 TREE_TYPE (list
) = TREE_TYPE (t
);
17686 ambiguous_p
= false;
17689 t
= TREE_CHAIN (t
);
17690 for (; t
; t
= TREE_CHAIN (t
))
17692 fate
= more_specialized_class (champ
, t
);
17699 t
= TREE_CHAIN (t
);
17702 ambiguous_p
= true;
17711 for (t
= list
; t
&& t
!= champ
; t
= TREE_CHAIN (t
))
17713 fate
= more_specialized_class (champ
, t
);
17716 ambiguous_p
= true;
17724 char *spaces
= NULL
;
17725 if (!(complain
& tf_error
))
17726 return error_mark_node
;
17727 error ("ambiguous class template instantiation for %q#T", type
);
17728 str
= ngettext ("candidate is:", "candidates are:", list_length (list
));
17729 for (t
= list
; t
; t
= TREE_CHAIN (t
))
17731 error ("%s %+#T", spaces
? spaces
: str
, TREE_TYPE (t
));
17732 spaces
= spaces
? spaces
: get_spaces (str
);
17735 return error_mark_node
;
17741 /* Explicitly instantiate DECL. */
17744 do_decl_instantiation (tree decl
, tree storage
)
17746 tree result
= NULL_TREE
;
17749 if (!decl
|| decl
== error_mark_node
)
17750 /* An error occurred, for which grokdeclarator has already issued
17751 an appropriate message. */
17753 else if (! DECL_LANG_SPECIFIC (decl
))
17755 error ("explicit instantiation of non-template %q#D", decl
);
17758 else if (TREE_CODE (decl
) == VAR_DECL
)
17760 /* There is an asymmetry here in the way VAR_DECLs and
17761 FUNCTION_DECLs are handled by grokdeclarator. In the case of
17762 the latter, the DECL we get back will be marked as a
17763 template instantiation, and the appropriate
17764 DECL_TEMPLATE_INFO will be set up. This does not happen for
17765 VAR_DECLs so we do the lookup here. Probably, grokdeclarator
17766 should handle VAR_DECLs as it currently handles
17768 if (!DECL_CLASS_SCOPE_P (decl
))
17770 error ("%qD is not a static data member of a class template", decl
);
17773 result
= lookup_field (DECL_CONTEXT (decl
), DECL_NAME (decl
), 0, false);
17774 if (!result
|| TREE_CODE (result
) != VAR_DECL
)
17776 error ("no matching template for %qD found", decl
);
17779 if (!same_type_p (TREE_TYPE (result
), TREE_TYPE (decl
)))
17781 error ("type %qT for explicit instantiation %qD does not match "
17782 "declared type %qT", TREE_TYPE (result
), decl
,
17787 else if (TREE_CODE (decl
) != FUNCTION_DECL
)
17789 error ("explicit instantiation of %q#D", decl
);
17795 /* Check for various error cases. Note that if the explicit
17796 instantiation is valid the RESULT will currently be marked as an
17797 *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set
17798 until we get here. */
17800 if (DECL_TEMPLATE_SPECIALIZATION (result
))
17802 /* DR 259 [temp.spec].
17804 Both an explicit instantiation and a declaration of an explicit
17805 specialization shall not appear in a program unless the explicit
17806 instantiation follows a declaration of the explicit specialization.
17808 For a given set of template parameters, if an explicit
17809 instantiation of a template appears after a declaration of an
17810 explicit specialization for that template, the explicit
17811 instantiation has no effect. */
17814 else if (DECL_EXPLICIT_INSTANTIATION (result
))
17818 No program shall explicitly instantiate any template more
17821 We check DECL_NOT_REALLY_EXTERN so as not to complain when
17822 the first instantiation was `extern' and the second is not,
17823 and EXTERN_P for the opposite case. */
17824 if (DECL_NOT_REALLY_EXTERN (result
) && !extern_p
)
17825 permerror (input_location
, "duplicate explicit instantiation of %q#D", result
);
17826 /* If an "extern" explicit instantiation follows an ordinary
17827 explicit instantiation, the template is instantiated. */
17831 else if (!DECL_IMPLICIT_INSTANTIATION (result
))
17833 error ("no matching template for %qD found", result
);
17836 else if (!DECL_TEMPLATE_INFO (result
))
17838 permerror (input_location
, "explicit instantiation of non-template %q#D", result
);
17842 if (storage
== NULL_TREE
)
17844 else if (storage
== ridpointers
[(int) RID_EXTERN
])
17846 if (!in_system_header
&& (cxx_dialect
== cxx98
))
17847 pedwarn (input_location
, OPT_pedantic
,
17848 "ISO C++ 1998 forbids the use of %<extern%> on explicit "
17853 error ("storage class %qD applied to template instantiation", storage
);
17855 check_explicit_instantiation_namespace (result
);
17856 mark_decl_instantiated (result
, extern_p
);
17858 instantiate_decl (result
, /*defer_ok=*/1,
17859 /*expl_inst_class_mem_p=*/false);
17863 mark_class_instantiated (tree t
, int extern_p
)
17865 SET_CLASSTYPE_EXPLICIT_INSTANTIATION (t
);
17866 SET_CLASSTYPE_INTERFACE_KNOWN (t
);
17867 CLASSTYPE_INTERFACE_ONLY (t
) = extern_p
;
17868 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (t
)) = extern_p
;
17871 CLASSTYPE_DEBUG_REQUESTED (t
) = 1;
17872 rest_of_type_compilation (t
, 1);
17876 /* Called from do_type_instantiation through binding_table_foreach to
17877 do recursive instantiation for the type bound in ENTRY. */
17879 bt_instantiate_type_proc (binding_entry entry
, void *data
)
17881 tree storage
= *(tree
*) data
;
17883 if (MAYBE_CLASS_TYPE_P (entry
->type
)
17884 && !uses_template_parms (CLASSTYPE_TI_ARGS (entry
->type
)))
17885 do_type_instantiation (TYPE_MAIN_DECL (entry
->type
), storage
, 0);
17888 /* Called from do_type_instantiation to instantiate a member
17889 (a member function or a static member variable) of an
17890 explicitly instantiated class template. */
17892 instantiate_class_member (tree decl
, int extern_p
)
17894 mark_decl_instantiated (decl
, extern_p
);
17896 instantiate_decl (decl
, /*defer_ok=*/1,
17897 /*expl_inst_class_mem_p=*/true);
17900 /* Perform an explicit instantiation of template class T. STORAGE, if
17901 non-null, is the RID for extern, inline or static. COMPLAIN is
17902 nonzero if this is called from the parser, zero if called recursively,
17903 since the standard is unclear (as detailed below). */
17906 do_type_instantiation (tree t
, tree storage
, tsubst_flags_t complain
)
17911 int previous_instantiation_extern_p
= 0;
17913 if (TREE_CODE (t
) == TYPE_DECL
)
17916 if (! CLASS_TYPE_P (t
) || ! CLASSTYPE_TEMPLATE_INFO (t
))
17919 (TYPE_TEMPLATE_INFO (t
)) ? TYPE_TI_TEMPLATE (t
) : NULL
;
17921 error ("explicit instantiation of non-class template %qD", tmpl
);
17923 error ("explicit instantiation of non-template type %qT", t
);
17929 if (!COMPLETE_TYPE_P (t
))
17931 if (complain
& tf_error
)
17932 error ("explicit instantiation of %q#T before definition of template",
17937 if (storage
!= NULL_TREE
)
17939 if (!in_system_header
)
17941 if (storage
== ridpointers
[(int) RID_EXTERN
])
17943 if (cxx_dialect
== cxx98
)
17944 pedwarn (input_location
, OPT_pedantic
,
17945 "ISO C++ 1998 forbids the use of %<extern%> on "
17946 "explicit instantiations");
17949 pedwarn (input_location
, OPT_pedantic
,
17950 "ISO C++ forbids the use of %qE"
17951 " on explicit instantiations", storage
);
17954 if (storage
== ridpointers
[(int) RID_INLINE
])
17956 else if (storage
== ridpointers
[(int) RID_EXTERN
])
17958 else if (storage
== ridpointers
[(int) RID_STATIC
])
17962 error ("storage class %qD applied to template instantiation",
17968 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
17970 /* DR 259 [temp.spec].
17972 Both an explicit instantiation and a declaration of an explicit
17973 specialization shall not appear in a program unless the explicit
17974 instantiation follows a declaration of the explicit specialization.
17976 For a given set of template parameters, if an explicit
17977 instantiation of a template appears after a declaration of an
17978 explicit specialization for that template, the explicit
17979 instantiation has no effect. */
17982 else if (CLASSTYPE_EXPLICIT_INSTANTIATION (t
))
17986 No program shall explicitly instantiate any template more
17989 If PREVIOUS_INSTANTIATION_EXTERN_P, then the first explicit
17990 instantiation was `extern'. If EXTERN_P then the second is.
17991 These cases are OK. */
17992 previous_instantiation_extern_p
= CLASSTYPE_INTERFACE_ONLY (t
);
17994 if (!previous_instantiation_extern_p
&& !extern_p
17995 && (complain
& tf_error
))
17996 permerror (input_location
, "duplicate explicit instantiation of %q#T", t
);
17998 /* If we've already instantiated the template, just return now. */
17999 if (!CLASSTYPE_INTERFACE_ONLY (t
))
18003 check_explicit_instantiation_namespace (TYPE_NAME (t
));
18004 mark_class_instantiated (t
, extern_p
);
18012 /* In contrast to implicit instantiation, where only the
18013 declarations, and not the definitions, of members are
18014 instantiated, we have here:
18018 The explicit instantiation of a class template specialization
18019 implies the instantiation of all of its members not
18020 previously explicitly specialized in the translation unit
18021 containing the explicit instantiation.
18023 Of course, we can't instantiate member template classes, since
18024 we don't have any arguments for them. Note that the standard
18025 is unclear on whether the instantiation of the members are
18026 *explicit* instantiations or not. However, the most natural
18027 interpretation is that it should be an explicit instantiation. */
18030 for (tmp
= TYPE_METHODS (t
); tmp
; tmp
= DECL_CHAIN (tmp
))
18031 if (TREE_CODE (tmp
) == FUNCTION_DECL
18032 && DECL_TEMPLATE_INSTANTIATION (tmp
))
18033 instantiate_class_member (tmp
, extern_p
);
18035 for (tmp
= TYPE_FIELDS (t
); tmp
; tmp
= DECL_CHAIN (tmp
))
18036 if (TREE_CODE (tmp
) == VAR_DECL
&& DECL_TEMPLATE_INSTANTIATION (tmp
))
18037 instantiate_class_member (tmp
, extern_p
);
18039 if (CLASSTYPE_NESTED_UTDS (t
))
18040 binding_table_foreach (CLASSTYPE_NESTED_UTDS (t
),
18041 bt_instantiate_type_proc
, &storage
);
18045 /* Given a function DECL, which is a specialization of TMPL, modify
18046 DECL to be a re-instantiation of TMPL with the same template
18047 arguments. TMPL should be the template into which tsubst'ing
18048 should occur for DECL, not the most general template.
18050 One reason for doing this is a scenario like this:
18053 void f(const T&, int i);
18055 void g() { f(3, 7); }
18058 void f(const T& t, const int i) { }
18060 Note that when the template is first instantiated, with
18061 instantiate_template, the resulting DECL will have no name for the
18062 first parameter, and the wrong type for the second. So, when we go
18063 to instantiate the DECL, we regenerate it. */
18066 regenerate_decl_from_template (tree decl
, tree tmpl
)
18068 /* The arguments used to instantiate DECL, from the most general
18073 args
= DECL_TI_ARGS (decl
);
18074 code_pattern
= DECL_TEMPLATE_RESULT (tmpl
);
18076 /* Make sure that we can see identifiers, and compute access
18078 push_access_scope (decl
);
18080 if (TREE_CODE (decl
) == FUNCTION_DECL
)
18088 args_depth
= TMPL_ARGS_DEPTH (args
);
18089 parms_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
18090 if (args_depth
> parms_depth
)
18091 args
= get_innermost_template_args (args
, parms_depth
);
18093 specs
= tsubst_exception_specification (TREE_TYPE (code_pattern
),
18094 args
, tf_error
, NULL_TREE
,
18095 /*defer_ok*/false);
18096 if (specs
&& specs
!= error_mark_node
)
18097 TREE_TYPE (decl
) = build_exception_variant (TREE_TYPE (decl
),
18100 /* Merge parameter declarations. */
18101 decl_parm
= skip_artificial_parms_for (decl
,
18102 DECL_ARGUMENTS (decl
));
18104 = skip_artificial_parms_for (code_pattern
,
18105 DECL_ARGUMENTS (code_pattern
));
18106 while (decl_parm
&& !FUNCTION_PARAMETER_PACK_P (pattern_parm
))
18111 if (DECL_NAME (decl_parm
) != DECL_NAME (pattern_parm
))
18112 DECL_NAME (decl_parm
) = DECL_NAME (pattern_parm
);
18113 parm_type
= tsubst (TREE_TYPE (pattern_parm
), args
, tf_error
,
18115 parm_type
= type_decays_to (parm_type
);
18116 if (!same_type_p (TREE_TYPE (decl_parm
), parm_type
))
18117 TREE_TYPE (decl_parm
) = parm_type
;
18118 attributes
= DECL_ATTRIBUTES (pattern_parm
);
18119 if (DECL_ATTRIBUTES (decl_parm
) != attributes
)
18121 DECL_ATTRIBUTES (decl_parm
) = attributes
;
18122 cplus_decl_attributes (&decl_parm
, attributes
, /*flags=*/0);
18124 decl_parm
= DECL_CHAIN (decl_parm
);
18125 pattern_parm
= DECL_CHAIN (pattern_parm
);
18127 /* Merge any parameters that match with the function parameter
18129 if (pattern_parm
&& FUNCTION_PARAMETER_PACK_P (pattern_parm
))
18132 tree expanded_types
;
18133 /* Expand the TYPE_PACK_EXPANSION that provides the types for
18134 the parameters in this function parameter pack. */
18135 expanded_types
= tsubst_pack_expansion (TREE_TYPE (pattern_parm
),
18136 args
, tf_error
, NULL_TREE
);
18137 len
= TREE_VEC_LENGTH (expanded_types
);
18138 for (i
= 0; i
< len
; i
++)
18143 if (DECL_NAME (decl_parm
) != DECL_NAME (pattern_parm
))
18144 /* Rename the parameter to include the index. */
18145 DECL_NAME (decl_parm
) =
18146 make_ith_pack_parameter_name (DECL_NAME (pattern_parm
), i
);
18147 parm_type
= TREE_VEC_ELT (expanded_types
, i
);
18148 parm_type
= type_decays_to (parm_type
);
18149 if (!same_type_p (TREE_TYPE (decl_parm
), parm_type
))
18150 TREE_TYPE (decl_parm
) = parm_type
;
18151 attributes
= DECL_ATTRIBUTES (pattern_parm
);
18152 if (DECL_ATTRIBUTES (decl_parm
) != attributes
)
18154 DECL_ATTRIBUTES (decl_parm
) = attributes
;
18155 cplus_decl_attributes (&decl_parm
, attributes
, /*flags=*/0);
18157 decl_parm
= DECL_CHAIN (decl_parm
);
18160 /* Merge additional specifiers from the CODE_PATTERN. */
18161 if (DECL_DECLARED_INLINE_P (code_pattern
)
18162 && !DECL_DECLARED_INLINE_P (decl
))
18163 DECL_DECLARED_INLINE_P (decl
) = 1;
18165 else if (TREE_CODE (decl
) == VAR_DECL
)
18167 DECL_INITIAL (decl
) =
18168 tsubst_expr (DECL_INITIAL (code_pattern
), args
,
18169 tf_error
, DECL_TI_TEMPLATE (decl
),
18170 /*integral_constant_expression_p=*/false);
18171 if (VAR_HAD_UNKNOWN_BOUND (decl
))
18172 TREE_TYPE (decl
) = tsubst (TREE_TYPE (code_pattern
), args
,
18173 tf_error
, DECL_TI_TEMPLATE (decl
));
18176 gcc_unreachable ();
18178 pop_access_scope (decl
);
18181 /* Return the TEMPLATE_DECL into which DECL_TI_ARGS(DECL) should be
18182 substituted to get DECL. */
18185 template_for_substitution (tree decl
)
18187 tree tmpl
= DECL_TI_TEMPLATE (decl
);
18189 /* Set TMPL to the template whose DECL_TEMPLATE_RESULT is the pattern
18190 for the instantiation. This is not always the most general
18191 template. Consider, for example:
18194 struct S { template <class U> void f();
18195 template <> void f<int>(); };
18197 and an instantiation of S<double>::f<int>. We want TD to be the
18198 specialization S<T>::f<int>, not the more general S<T>::f<U>. */
18199 while (/* An instantiation cannot have a definition, so we need a
18200 more general template. */
18201 DECL_TEMPLATE_INSTANTIATION (tmpl
)
18202 /* We must also deal with friend templates. Given:
18204 template <class T> struct S {
18205 template <class U> friend void f() {};
18208 S<int>::f<U> say, is not an instantiation of S<T>::f<U>,
18209 so far as the language is concerned, but that's still
18210 where we get the pattern for the instantiation from. On
18211 other hand, if the definition comes outside the class, say:
18213 template <class T> struct S {
18214 template <class U> friend void f();
18216 template <class U> friend void f() {}
18218 we don't need to look any further. That's what the check for
18219 DECL_INITIAL is for. */
18220 || (TREE_CODE (decl
) == FUNCTION_DECL
18221 && DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (tmpl
)
18222 && !DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl
))))
18224 /* The present template, TD, should not be a definition. If it
18225 were a definition, we should be using it! Note that we
18226 cannot restructure the loop to just keep going until we find
18227 a template with a definition, since that might go too far if
18228 a specialization was declared, but not defined. */
18229 gcc_assert (TREE_CODE (decl
) != VAR_DECL
18230 || DECL_IN_AGGR_P (DECL_TEMPLATE_RESULT (tmpl
)));
18232 /* Fetch the more general template. */
18233 tmpl
= DECL_TI_TEMPLATE (tmpl
);
18239 /* Returns true if we need to instantiate this template instance even if we
18240 know we aren't going to emit it.. */
18243 always_instantiate_p (tree decl
)
18245 /* We always instantiate inline functions so that we can inline them. An
18246 explicit instantiation declaration prohibits implicit instantiation of
18247 non-inline functions. With high levels of optimization, we would
18248 normally inline non-inline functions -- but we're not allowed to do
18249 that for "extern template" functions. Therefore, we check
18250 DECL_DECLARED_INLINE_P, rather than possibly_inlined_p. */
18251 return ((TREE_CODE (decl
) == FUNCTION_DECL
18252 && DECL_DECLARED_INLINE_P (decl
))
18253 /* And we need to instantiate static data members so that
18254 their initializers are available in integral constant
18256 || (TREE_CODE (decl
) == VAR_DECL
18257 && decl_maybe_constant_var_p (decl
)));
18260 /* If FN has a noexcept-specifier that hasn't been instantiated yet,
18261 instantiate it now, modifying TREE_TYPE (fn). */
18264 maybe_instantiate_noexcept (tree fn
)
18266 tree fntype
, spec
, noex
, clone
;
18268 if (DECL_CLONED_FUNCTION_P (fn
))
18269 fn
= DECL_CLONED_FUNCTION (fn
);
18270 fntype
= TREE_TYPE (fn
);
18271 spec
= TYPE_RAISES_EXCEPTIONS (fntype
);
18273 if (!DEFERRED_NOEXCEPT_SPEC_P (spec
))
18276 noex
= TREE_PURPOSE (spec
);
18278 if (TREE_CODE (noex
) == DEFERRED_NOEXCEPT
)
18280 if (push_tinst_level (fn
))
18282 push_access_scope (fn
);
18283 input_location
= DECL_SOURCE_LOCATION (fn
);
18284 noex
= tsubst_copy_and_build (DEFERRED_NOEXCEPT_PATTERN (noex
),
18285 DEFERRED_NOEXCEPT_ARGS (noex
),
18286 tf_warning_or_error
, fn
,
18287 /*function_p=*/false,
18288 /*integral_constant_expression_p=*/true);
18289 pop_access_scope (fn
);
18290 pop_tinst_level ();
18291 spec
= build_noexcept_spec (noex
, tf_warning_or_error
);
18292 if (spec
== error_mark_node
)
18293 spec
= noexcept_false_spec
;
18296 spec
= noexcept_false_spec
;
18300 /* This is an implicitly declared function, so NOEX is a list of
18301 other functions to evaluate and merge. */
18303 spec
= noexcept_true_spec
;
18304 for (elt
= noex
; elt
; elt
= OVL_NEXT (elt
))
18306 tree fn
= OVL_CURRENT (elt
);
18308 maybe_instantiate_noexcept (fn
);
18309 subspec
= TYPE_RAISES_EXCEPTIONS (TREE_TYPE (fn
));
18310 spec
= merge_exception_specifiers (spec
, subspec
, NULL_TREE
);
18314 TREE_TYPE (fn
) = build_exception_variant (fntype
, spec
);
18316 FOR_EACH_CLONE (clone
, fn
)
18318 if (TREE_TYPE (clone
) == fntype
)
18319 TREE_TYPE (clone
) = TREE_TYPE (fn
);
18321 TREE_TYPE (clone
) = build_exception_variant (TREE_TYPE (clone
), spec
);
18325 /* Produce the definition of D, a _DECL generated from a template. If
18326 DEFER_OK is nonzero, then we don't have to actually do the
18327 instantiation now; we just have to do it sometime. Normally it is
18328 an error if this is an explicit instantiation but D is undefined.
18329 EXPL_INST_CLASS_MEM_P is true iff D is a member of an
18330 explicitly instantiated class template. */
18333 instantiate_decl (tree d
, int defer_ok
,
18334 bool expl_inst_class_mem_p
)
18336 tree tmpl
= DECL_TI_TEMPLATE (d
);
18343 bool pattern_defined
;
18345 location_t saved_loc
= input_location
;
18348 /* This function should only be used to instantiate templates for
18349 functions and static member variables. */
18350 gcc_assert (TREE_CODE (d
) == FUNCTION_DECL
18351 || TREE_CODE (d
) == VAR_DECL
);
18353 /* Variables are never deferred; if instantiation is required, they
18354 are instantiated right away. That allows for better code in the
18355 case that an expression refers to the value of the variable --
18356 if the variable has a constant value the referring expression can
18357 take advantage of that fact. */
18358 if (TREE_CODE (d
) == VAR_DECL
18359 || DECL_DECLARED_CONSTEXPR_P (d
))
18362 /* Don't instantiate cloned functions. Instead, instantiate the
18363 functions they cloned. */
18364 if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_CLONED_FUNCTION_P (d
))
18365 d
= DECL_CLONED_FUNCTION (d
);
18367 if (DECL_TEMPLATE_INSTANTIATED (d
)
18368 || (TREE_CODE (d
) == FUNCTION_DECL
18369 && DECL_DEFAULTED_FN (d
) && DECL_INITIAL (d
))
18370 || DECL_TEMPLATE_SPECIALIZATION (d
))
18371 /* D has already been instantiated or explicitly specialized, so
18372 there's nothing for us to do here.
18374 It might seem reasonable to check whether or not D is an explicit
18375 instantiation, and, if so, stop here. But when an explicit
18376 instantiation is deferred until the end of the compilation,
18377 DECL_EXPLICIT_INSTANTIATION is set, even though we still need to do
18378 the instantiation. */
18381 /* Check to see whether we know that this template will be
18382 instantiated in some other file, as with "extern template"
18384 external_p
= (DECL_INTERFACE_KNOWN (d
) && DECL_REALLY_EXTERN (d
));
18386 /* In general, we do not instantiate such templates. */
18387 if (external_p
&& !always_instantiate_p (d
))
18390 gen_tmpl
= most_general_template (tmpl
);
18391 gen_args
= DECL_TI_ARGS (d
);
18393 if (tmpl
!= gen_tmpl
)
18394 /* We should already have the extra args. */
18395 gcc_assert (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (gen_tmpl
))
18396 == TMPL_ARGS_DEPTH (gen_args
));
18397 /* And what's in the hash table should match D. */
18398 gcc_assert ((spec
= retrieve_specialization (gen_tmpl
, gen_args
, 0)) == d
18399 || spec
== NULL_TREE
);
18401 /* This needs to happen before any tsubsting. */
18402 if (! push_tinst_level (d
))
18405 timevar_push (TV_TEMPLATE_INST
);
18407 /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern
18408 for the instantiation. */
18409 td
= template_for_substitution (d
);
18410 code_pattern
= DECL_TEMPLATE_RESULT (td
);
18412 /* We should never be trying to instantiate a member of a class
18413 template or partial specialization. */
18414 gcc_assert (d
!= code_pattern
);
18416 if ((DECL_NAMESPACE_SCOPE_P (d
) && !DECL_INITIALIZED_IN_CLASS_P (d
))
18417 || DECL_TEMPLATE_SPECIALIZATION (td
))
18418 /* In the case of a friend template whose definition is provided
18419 outside the class, we may have too many arguments. Drop the
18420 ones we don't need. The same is true for specializations. */
18421 args
= get_innermost_template_args
18422 (gen_args
, TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (td
)));
18426 if (TREE_CODE (d
) == FUNCTION_DECL
)
18427 pattern_defined
= (DECL_SAVED_TREE (code_pattern
) != NULL_TREE
18428 || DECL_DEFAULTED_OUTSIDE_CLASS_P (code_pattern
));
18430 pattern_defined
= ! DECL_IN_AGGR_P (code_pattern
);
18432 /* We may be in the middle of deferred access check. Disable it now. */
18433 push_deferring_access_checks (dk_no_deferred
);
18435 /* Unless an explicit instantiation directive has already determined
18436 the linkage of D, remember that a definition is available for
18438 if (pattern_defined
18439 && !DECL_INTERFACE_KNOWN (d
)
18440 && !DECL_NOT_REALLY_EXTERN (d
))
18441 mark_definable (d
);
18443 DECL_SOURCE_LOCATION (td
) = DECL_SOURCE_LOCATION (code_pattern
);
18444 DECL_SOURCE_LOCATION (d
) = DECL_SOURCE_LOCATION (code_pattern
);
18445 input_location
= DECL_SOURCE_LOCATION (d
);
18447 /* If D is a member of an explicitly instantiated class template,
18448 and no definition is available, treat it like an implicit
18450 if (!pattern_defined
&& expl_inst_class_mem_p
18451 && DECL_EXPLICIT_INSTANTIATION (d
))
18453 /* Leave linkage flags alone on instantiations with anonymous
18455 if (TREE_PUBLIC (d
))
18457 DECL_NOT_REALLY_EXTERN (d
) = 0;
18458 DECL_INTERFACE_KNOWN (d
) = 0;
18460 SET_DECL_IMPLICIT_INSTANTIATION (d
);
18463 if (TREE_CODE (d
) == FUNCTION_DECL
)
18464 maybe_instantiate_noexcept (d
);
18466 /* Recheck the substitutions to obtain any warning messages
18467 about ignoring cv qualifiers. Don't do this for artificial decls,
18468 as it breaks the context-sensitive substitution for lambda op(). */
18469 if (!defer_ok
&& !DECL_ARTIFICIAL (d
))
18471 tree gen
= DECL_TEMPLATE_RESULT (gen_tmpl
);
18472 tree type
= TREE_TYPE (gen
);
18474 /* Make sure that we can see identifiers, and compute access
18475 correctly. D is already the target FUNCTION_DECL with the
18477 push_access_scope (d
);
18479 if (TREE_CODE (gen
) == FUNCTION_DECL
)
18481 tsubst (DECL_ARGUMENTS (gen
), gen_args
, tf_warning_or_error
, d
);
18482 tsubst_exception_specification (type
, gen_args
, tf_warning_or_error
,
18483 d
, /*defer_ok*/true);
18484 /* Don't simply tsubst the function type, as that will give
18485 duplicate warnings about poor parameter qualifications.
18486 The function arguments are the same as the decl_arguments
18487 without the top level cv qualifiers. */
18488 type
= TREE_TYPE (type
);
18490 tsubst (type
, gen_args
, tf_warning_or_error
, d
);
18492 pop_access_scope (d
);
18495 /* Defer all other templates, unless we have been explicitly
18496 forbidden from doing so. */
18497 if (/* If there is no definition, we cannot instantiate the
18500 /* If it's OK to postpone instantiation, do so. */
18502 /* If this is a static data member that will be defined
18503 elsewhere, we don't want to instantiate the entire data
18504 member, but we do want to instantiate the initializer so that
18505 we can substitute that elsewhere. */
18506 || (external_p
&& TREE_CODE (d
) == VAR_DECL
))
18508 /* The definition of the static data member is now required so
18509 we must substitute the initializer. */
18510 if (TREE_CODE (d
) == VAR_DECL
18511 && !DECL_INITIAL (d
)
18512 && DECL_INITIAL (code_pattern
))
18516 bool const_init
= false;
18518 ns
= decl_namespace_context (d
);
18519 push_nested_namespace (ns
);
18520 push_nested_class (DECL_CONTEXT (d
));
18521 init
= tsubst_expr (DECL_INITIAL (code_pattern
),
18523 tf_warning_or_error
, NULL_TREE
,
18524 /*integral_constant_expression_p=*/false);
18525 /* Make sure the initializer is still constant, in case of
18526 circular dependency (template/instantiate6.C). */
18528 = DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (code_pattern
);
18529 cp_finish_decl (d
, init
, /*init_const_expr_p=*/const_init
,
18530 /*asmspec_tree=*/NULL_TREE
,
18531 LOOKUP_ONLYCONVERTING
);
18532 pop_nested_class ();
18533 pop_nested_namespace (ns
);
18536 /* We restore the source position here because it's used by
18537 add_pending_template. */
18538 input_location
= saved_loc
;
18540 if (at_eof
&& !pattern_defined
18541 && DECL_EXPLICIT_INSTANTIATION (d
)
18542 && DECL_NOT_REALLY_EXTERN (d
))
18545 The definition of a non-exported function template, a
18546 non-exported member function template, or a non-exported
18547 member function or static data member of a class template
18548 shall be present in every translation unit in which it is
18549 explicitly instantiated. */
18550 permerror (input_location
, "explicit instantiation of %qD "
18551 "but no definition available", d
);
18553 /* If we're in unevaluated context, we just wanted to get the
18554 constant value; this isn't an odr use, so don't queue
18555 a full instantiation. */
18556 if (cp_unevaluated_operand
!= 0)
18558 /* ??? Historically, we have instantiated inline functions, even
18559 when marked as "extern template". */
18560 if (!(external_p
&& TREE_CODE (d
) == VAR_DECL
))
18561 add_pending_template (d
);
18564 /* Tell the repository that D is available in this translation unit
18565 -- and see if it is supposed to be instantiated here. */
18566 if (TREE_PUBLIC (d
) && !DECL_REALLY_EXTERN (d
) && !repo_emit_p (d
))
18568 /* In a PCH file, despite the fact that the repository hasn't
18569 requested instantiation in the PCH it is still possible that
18570 an instantiation will be required in a file that includes the
18573 add_pending_template (d
);
18574 /* Instantiate inline functions so that the inliner can do its
18575 job, even though we'll not be emitting a copy of this
18577 if (!(TREE_CODE (d
) == FUNCTION_DECL
&& possibly_inlined_p (d
)))
18581 need_push
= !cfun
|| !global_bindings_p ();
18583 push_to_top_level ();
18585 /* Mark D as instantiated so that recursive calls to
18586 instantiate_decl do not try to instantiate it again. */
18587 DECL_TEMPLATE_INSTANTIATED (d
) = 1;
18589 /* Regenerate the declaration in case the template has been modified
18590 by a subsequent redeclaration. */
18591 regenerate_decl_from_template (d
, td
);
18593 /* We already set the file and line above. Reset them now in case
18594 they changed as a result of calling regenerate_decl_from_template. */
18595 input_location
= DECL_SOURCE_LOCATION (d
);
18597 if (TREE_CODE (d
) == VAR_DECL
)
18600 bool const_init
= false;
18602 /* Clear out DECL_RTL; whatever was there before may not be right
18603 since we've reset the type of the declaration. */
18604 SET_DECL_RTL (d
, NULL
);
18605 DECL_IN_AGGR_P (d
) = 0;
18607 /* The initializer is placed in DECL_INITIAL by
18608 regenerate_decl_from_template so we don't need to
18609 push/pop_access_scope again here. Pull it out so that
18610 cp_finish_decl can process it. */
18611 init
= DECL_INITIAL (d
);
18612 DECL_INITIAL (d
) = NULL_TREE
;
18613 DECL_INITIALIZED_P (d
) = 0;
18615 /* Clear DECL_EXTERNAL so that cp_finish_decl will process the
18616 initializer. That function will defer actual emission until
18617 we have a chance to determine linkage. */
18618 DECL_EXTERNAL (d
) = 0;
18620 /* Enter the scope of D so that access-checking works correctly. */
18621 push_nested_class (DECL_CONTEXT (d
));
18622 const_init
= DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (code_pattern
);
18623 cp_finish_decl (d
, init
, const_init
, NULL_TREE
, 0);
18624 pop_nested_class ();
18626 else if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_DEFAULTED_FN (code_pattern
))
18627 synthesize_method (d
);
18628 else if (TREE_CODE (d
) == FUNCTION_DECL
)
18630 htab_t saved_local_specializations
;
18635 /* Save away the current list, in case we are instantiating one
18636 template from within the body of another. */
18637 saved_local_specializations
= local_specializations
;
18639 /* Set up the list of local specializations. */
18640 local_specializations
= htab_create (37,
18641 hash_local_specialization
,
18642 eq_local_specializations
,
18645 /* Set up context. */
18646 start_preparsed_function (d
, NULL_TREE
, SF_PRE_PARSED
);
18648 /* Create substitution entries for the parameters. */
18649 subst_decl
= DECL_TEMPLATE_RESULT (template_for_substitution (d
));
18650 tmpl_parm
= DECL_ARGUMENTS (subst_decl
);
18651 spec_parm
= DECL_ARGUMENTS (d
);
18652 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (d
))
18654 register_local_specialization (spec_parm
, tmpl_parm
);
18655 spec_parm
= skip_artificial_parms_for (d
, spec_parm
);
18656 tmpl_parm
= skip_artificial_parms_for (subst_decl
, tmpl_parm
);
18658 for (; tmpl_parm
; tmpl_parm
= DECL_CHAIN (tmpl_parm
))
18660 if (!FUNCTION_PARAMETER_PACK_P (tmpl_parm
))
18662 register_local_specialization (spec_parm
, tmpl_parm
);
18663 spec_parm
= DECL_CHAIN (spec_parm
);
18667 /* Register the (value) argument pack as a specialization of
18668 TMPL_PARM, then move on. */
18669 tree argpack
= extract_fnparm_pack (tmpl_parm
, &spec_parm
);
18670 register_local_specialization (argpack
, tmpl_parm
);
18673 gcc_assert (!spec_parm
);
18675 /* Substitute into the body of the function. */
18676 tsubst_expr (DECL_SAVED_TREE (code_pattern
), args
,
18677 tf_warning_or_error
, tmpl
,
18678 /*integral_constant_expression_p=*/false);
18680 /* Set the current input_location to the end of the function
18681 so that finish_function knows where we are. */
18682 input_location
= DECL_STRUCT_FUNCTION (code_pattern
)->function_end_locus
;
18684 /* We don't need the local specializations any more. */
18685 htab_delete (local_specializations
);
18686 local_specializations
= saved_local_specializations
;
18688 /* Finish the function. */
18689 d
= finish_function (0);
18690 expand_or_defer_fn (d
);
18693 /* We're not deferring instantiation any more. */
18694 TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (d
)) = 0;
18697 pop_from_top_level ();
18700 input_location
= saved_loc
;
18701 pop_deferring_access_checks ();
18702 pop_tinst_level ();
18704 timevar_pop (TV_TEMPLATE_INST
);
18709 /* Run through the list of templates that we wish we could
18710 instantiate, and instantiate any we can. RETRIES is the
18711 number of times we retry pending template instantiation. */
18714 instantiate_pending_templates (int retries
)
18717 location_t saved_loc
= input_location
;
18719 /* Instantiating templates may trigger vtable generation. This in turn
18720 may require further template instantiations. We place a limit here
18721 to avoid infinite loop. */
18722 if (pending_templates
&& retries
>= max_tinst_depth
)
18724 tree decl
= pending_templates
->tinst
->decl
;
18726 error ("template instantiation depth exceeds maximum of %d"
18727 " instantiating %q+D, possibly from virtual table generation"
18728 " (use -ftemplate-depth= to increase the maximum)",
18729 max_tinst_depth
, decl
);
18730 if (TREE_CODE (decl
) == FUNCTION_DECL
)
18731 /* Pretend that we defined it. */
18732 DECL_INITIAL (decl
) = error_mark_node
;
18738 struct pending_template
**t
= &pending_templates
;
18739 struct pending_template
*last
= NULL
;
18743 tree instantiation
= reopen_tinst_level ((*t
)->tinst
);
18744 bool complete
= false;
18746 if (TYPE_P (instantiation
))
18750 if (!COMPLETE_TYPE_P (instantiation
))
18752 instantiate_class_template (instantiation
);
18753 if (CLASSTYPE_TEMPLATE_INSTANTIATION (instantiation
))
18754 for (fn
= TYPE_METHODS (instantiation
);
18756 fn
= TREE_CHAIN (fn
))
18757 if (! DECL_ARTIFICIAL (fn
))
18758 instantiate_decl (fn
,
18760 /*expl_inst_class_mem_p=*/false);
18761 if (COMPLETE_TYPE_P (instantiation
))
18765 complete
= COMPLETE_TYPE_P (instantiation
);
18769 if (!DECL_TEMPLATE_SPECIALIZATION (instantiation
)
18770 && !DECL_TEMPLATE_INSTANTIATED (instantiation
))
18773 = instantiate_decl (instantiation
,
18775 /*expl_inst_class_mem_p=*/false);
18776 if (DECL_TEMPLATE_INSTANTIATED (instantiation
))
18780 complete
= (DECL_TEMPLATE_SPECIALIZATION (instantiation
)
18781 || DECL_TEMPLATE_INSTANTIATED (instantiation
));
18785 /* If INSTANTIATION has been instantiated, then we don't
18786 need to consider it again in the future. */
18794 current_tinst_level
= NULL
;
18796 last_pending_template
= last
;
18798 while (reconsider
);
18800 input_location
= saved_loc
;
18803 /* Substitute ARGVEC into T, which is a list of initializers for
18804 either base class or a non-static data member. The TREE_PURPOSEs
18805 are DECLs, and the TREE_VALUEs are the initializer values. Used by
18806 instantiate_decl. */
18809 tsubst_initializer_list (tree t
, tree argvec
)
18811 tree inits
= NULL_TREE
;
18813 for (; t
; t
= TREE_CHAIN (t
))
18817 tree expanded_bases
= NULL_TREE
;
18818 tree expanded_arguments
= NULL_TREE
;
18821 if (TREE_CODE (TREE_PURPOSE (t
)) == TYPE_PACK_EXPANSION
)
18826 /* Expand the base class expansion type into separate base
18828 expanded_bases
= tsubst_pack_expansion (TREE_PURPOSE (t
), argvec
,
18829 tf_warning_or_error
,
18831 if (expanded_bases
== error_mark_node
)
18834 /* We'll be building separate TREE_LISTs of arguments for
18836 len
= TREE_VEC_LENGTH (expanded_bases
);
18837 expanded_arguments
= make_tree_vec (len
);
18838 for (i
= 0; i
< len
; i
++)
18839 TREE_VEC_ELT (expanded_arguments
, i
) = NULL_TREE
;
18841 /* Build a dummy EXPR_PACK_EXPANSION that will be used to
18842 expand each argument in the TREE_VALUE of t. */
18843 expr
= make_node (EXPR_PACK_EXPANSION
);
18844 PACK_EXPANSION_PARAMETER_PACKS (expr
) =
18845 PACK_EXPANSION_PARAMETER_PACKS (TREE_PURPOSE (t
));
18847 if (TREE_VALUE (t
) == void_type_node
)
18848 /* VOID_TYPE_NODE is used to indicate
18849 value-initialization. */
18851 for (i
= 0; i
< len
; i
++)
18852 TREE_VEC_ELT (expanded_arguments
, i
) = void_type_node
;
18856 /* Substitute parameter packs into each argument in the
18858 in_base_initializer
= 1;
18859 for (arg
= TREE_VALUE (t
); arg
; arg
= TREE_CHAIN (arg
))
18861 tree expanded_exprs
;
18863 /* Expand the argument. */
18864 SET_PACK_EXPANSION_PATTERN (expr
, TREE_VALUE (arg
));
18866 = tsubst_pack_expansion (expr
, argvec
,
18867 tf_warning_or_error
,
18869 if (expanded_exprs
== error_mark_node
)
18872 /* Prepend each of the expanded expressions to the
18873 corresponding TREE_LIST in EXPANDED_ARGUMENTS. */
18874 for (i
= 0; i
< len
; i
++)
18876 TREE_VEC_ELT (expanded_arguments
, i
) =
18877 tree_cons (NULL_TREE
,
18878 TREE_VEC_ELT (expanded_exprs
, i
),
18879 TREE_VEC_ELT (expanded_arguments
, i
));
18882 in_base_initializer
= 0;
18884 /* Reverse all of the TREE_LISTs in EXPANDED_ARGUMENTS,
18885 since we built them backwards. */
18886 for (i
= 0; i
< len
; i
++)
18888 TREE_VEC_ELT (expanded_arguments
, i
) =
18889 nreverse (TREE_VEC_ELT (expanded_arguments
, i
));
18894 for (i
= 0; i
< len
; ++i
)
18896 if (expanded_bases
)
18898 decl
= TREE_VEC_ELT (expanded_bases
, i
);
18899 decl
= expand_member_init (decl
);
18900 init
= TREE_VEC_ELT (expanded_arguments
, i
);
18904 decl
= tsubst_copy (TREE_PURPOSE (t
), argvec
,
18905 tf_warning_or_error
, NULL_TREE
);
18907 decl
= expand_member_init (decl
);
18908 if (decl
&& !DECL_P (decl
))
18909 in_base_initializer
= 1;
18911 init
= TREE_VALUE (t
);
18912 if (init
!= void_type_node
)
18913 init
= tsubst_expr (init
, argvec
,
18914 tf_warning_or_error
, NULL_TREE
,
18915 /*integral_constant_expression_p=*/false);
18916 in_base_initializer
= 0;
18921 init
= build_tree_list (decl
, init
);
18922 TREE_CHAIN (init
) = inits
;
18930 /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */
18933 set_current_access_from_decl (tree decl
)
18935 if (TREE_PRIVATE (decl
))
18936 current_access_specifier
= access_private_node
;
18937 else if (TREE_PROTECTED (decl
))
18938 current_access_specifier
= access_protected_node
;
18940 current_access_specifier
= access_public_node
;
18943 /* Instantiate an enumerated type. TAG is the template type, NEWTAG
18944 is the instantiation (which should have been created with
18945 start_enum) and ARGS are the template arguments to use. */
18948 tsubst_enum (tree tag
, tree newtag
, tree args
)
18952 if (SCOPED_ENUM_P (newtag
))
18953 begin_scope (sk_scoped_enum
, newtag
);
18955 for (e
= TYPE_VALUES (tag
); e
; e
= TREE_CHAIN (e
))
18960 decl
= TREE_VALUE (e
);
18961 /* Note that in a template enum, the TREE_VALUE is the
18962 CONST_DECL, not the corresponding INTEGER_CST. */
18963 value
= tsubst_expr (DECL_INITIAL (decl
),
18964 args
, tf_warning_or_error
, NULL_TREE
,
18965 /*integral_constant_expression_p=*/true);
18967 /* Give this enumeration constant the correct access. */
18968 set_current_access_from_decl (decl
);
18970 /* Actually build the enumerator itself. */
18972 (DECL_NAME (decl
), value
, newtag
, DECL_SOURCE_LOCATION (decl
));
18975 if (SCOPED_ENUM_P (newtag
))
18978 finish_enum_value_list (newtag
);
18979 finish_enum (newtag
);
18981 DECL_SOURCE_LOCATION (TYPE_NAME (newtag
))
18982 = DECL_SOURCE_LOCATION (TYPE_NAME (tag
));
18985 /* DECL is a FUNCTION_DECL that is a template specialization. Return
18986 its type -- but without substituting the innermost set of template
18987 arguments. So, innermost set of template parameters will appear in
18991 get_mostly_instantiated_function_type (tree decl
)
18999 tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
19000 targs
= DECL_TI_ARGS (decl
);
19001 tparms
= DECL_TEMPLATE_PARMS (tmpl
);
19002 parm_depth
= TMPL_PARMS_DEPTH (tparms
);
19004 /* There should be as many levels of arguments as there are levels
19006 gcc_assert (parm_depth
== TMPL_ARGS_DEPTH (targs
));
19008 fn_type
= TREE_TYPE (tmpl
);
19010 if (parm_depth
== 1)
19011 /* No substitution is necessary. */
19018 /* Replace the innermost level of the TARGS with NULL_TREEs to
19019 let tsubst know not to substitute for those parameters. */
19020 partial_args
= make_tree_vec (TREE_VEC_LENGTH (targs
));
19021 for (i
= 1; i
< TMPL_ARGS_DEPTH (targs
); ++i
)
19022 SET_TMPL_ARGS_LEVEL (partial_args
, i
,
19023 TMPL_ARGS_LEVEL (targs
, i
));
19024 SET_TMPL_ARGS_LEVEL (partial_args
,
19025 TMPL_ARGS_DEPTH (targs
),
19026 make_tree_vec (DECL_NTPARMS (tmpl
)));
19028 /* Make sure that we can see identifiers, and compute access
19030 push_access_scope (decl
);
19032 ++processing_template_decl
;
19033 /* Now, do the (partial) substitution to figure out the
19034 appropriate function type. */
19035 fn_type
= tsubst (fn_type
, partial_args
, tf_error
, NULL_TREE
);
19036 --processing_template_decl
;
19038 /* Substitute into the template parameters to obtain the real
19039 innermost set of parameters. This step is important if the
19040 innermost set of template parameters contains value
19041 parameters whose types depend on outer template parameters. */
19042 TREE_VEC_LENGTH (partial_args
)--;
19043 tparms
= tsubst_template_parms (tparms
, partial_args
, tf_error
);
19045 pop_access_scope (decl
);
19051 /* Return truthvalue if we're processing a template different from
19052 the last one involved in diagnostics. */
19054 problematic_instantiation_changed (void)
19056 return current_tinst_level
!= last_error_tinst_level
;
19059 /* Remember current template involved in diagnostics. */
19061 record_last_problematic_instantiation (void)
19063 last_error_tinst_level
= current_tinst_level
;
19066 struct tinst_level
*
19067 current_instantiation (void)
19069 return current_tinst_level
;
19072 /* [temp.param] Check that template non-type parm TYPE is of an allowable
19073 type. Return zero for ok, nonzero for disallowed. Issue error and
19074 warning messages under control of COMPLAIN. */
19077 invalid_nontype_parm_type_p (tree type
, tsubst_flags_t complain
)
19079 if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
19081 else if (POINTER_TYPE_P (type
))
19083 else if (TYPE_PTR_TO_MEMBER_P (type
))
19085 else if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
)
19087 else if (TREE_CODE (type
) == TYPENAME_TYPE
)
19089 else if (TREE_CODE (type
) == DECLTYPE_TYPE
)
19091 else if (TREE_CODE (type
) == NULLPTR_TYPE
)
19094 if (complain
& tf_error
)
19096 if (type
== error_mark_node
)
19097 inform (input_location
, "invalid template non-type parameter");
19099 error ("%q#T is not a valid type for a template non-type parameter",
19105 /* Returns TRUE if TYPE is dependent, in the sense of [temp.dep.type].
19106 Assumes that TYPE really is a type, and not the ERROR_MARK_NODE.*/
19109 dependent_type_p_r (tree type
)
19115 A type is dependent if it is:
19117 -- a template parameter. Template template parameters are types
19118 for us (since TYPE_P holds true for them) so we handle
19120 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
19121 || TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
)
19123 /* -- a qualified-id with a nested-name-specifier which contains a
19124 class-name that names a dependent type or whose unqualified-id
19125 names a dependent type. */
19126 if (TREE_CODE (type
) == TYPENAME_TYPE
)
19128 /* -- a cv-qualified type where the cv-unqualified type is
19130 type
= TYPE_MAIN_VARIANT (type
);
19131 /* -- a compound type constructed from any dependent type. */
19132 if (TYPE_PTR_TO_MEMBER_P (type
))
19133 return (dependent_type_p (TYPE_PTRMEM_CLASS_TYPE (type
))
19134 || dependent_type_p (TYPE_PTRMEM_POINTED_TO_TYPE
19136 else if (TREE_CODE (type
) == POINTER_TYPE
19137 || TREE_CODE (type
) == REFERENCE_TYPE
)
19138 return dependent_type_p (TREE_TYPE (type
));
19139 else if (TREE_CODE (type
) == FUNCTION_TYPE
19140 || TREE_CODE (type
) == METHOD_TYPE
)
19144 if (dependent_type_p (TREE_TYPE (type
)))
19146 for (arg_type
= TYPE_ARG_TYPES (type
);
19148 arg_type
= TREE_CHAIN (arg_type
))
19149 if (dependent_type_p (TREE_VALUE (arg_type
)))
19153 /* -- an array type constructed from any dependent type or whose
19154 size is specified by a constant expression that is
19157 We checked for type- and value-dependence of the bounds in
19158 compute_array_index_type, so TYPE_DEPENDENT_P is already set. */
19159 if (TREE_CODE (type
) == ARRAY_TYPE
)
19161 if (TYPE_DOMAIN (type
)
19162 && dependent_type_p (TYPE_DOMAIN (type
)))
19164 return dependent_type_p (TREE_TYPE (type
));
19167 /* -- a template-id in which either the template name is a template
19169 if (TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
19171 /* ... or any of the template arguments is a dependent type or
19172 an expression that is type-dependent or value-dependent. */
19173 else if (CLASS_TYPE_P (type
) && CLASSTYPE_TEMPLATE_INFO (type
)
19174 && (any_dependent_template_arguments_p
19175 (INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type
)))))
19178 /* All TYPEOF_TYPEs, DECLTYPE_TYPEs, and UNDERLYING_TYPEs are
19179 dependent; if the argument of the `typeof' expression is not
19180 type-dependent, then it should already been have resolved. */
19181 if (TREE_CODE (type
) == TYPEOF_TYPE
19182 || TREE_CODE (type
) == DECLTYPE_TYPE
19183 || TREE_CODE (type
) == UNDERLYING_TYPE
)
19186 /* A template argument pack is dependent if any of its packed
19188 if (TREE_CODE (type
) == TYPE_ARGUMENT_PACK
)
19190 tree args
= ARGUMENT_PACK_ARGS (type
);
19191 int i
, len
= TREE_VEC_LENGTH (args
);
19192 for (i
= 0; i
< len
; ++i
)
19193 if (dependent_template_arg_p (TREE_VEC_ELT (args
, i
)))
19197 /* All TYPE_PACK_EXPANSIONs are dependent, because parameter packs must
19198 be template parameters. */
19199 if (TREE_CODE (type
) == TYPE_PACK_EXPANSION
)
19202 /* The standard does not specifically mention types that are local
19203 to template functions or local classes, but they should be
19204 considered dependent too. For example:
19206 template <int I> void f() {
19211 The size of `E' cannot be known until the value of `I' has been
19212 determined. Therefore, `E' must be considered dependent. */
19213 scope
= TYPE_CONTEXT (type
);
19214 if (scope
&& TYPE_P (scope
))
19215 return dependent_type_p (scope
);
19216 /* Don't use type_dependent_expression_p here, as it can lead
19217 to infinite recursion trying to determine whether a lambda
19218 nested in a lambda is dependent (c++/47687). */
19219 else if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
19220 && DECL_LANG_SPECIFIC (scope
)
19221 && DECL_TEMPLATE_INFO (scope
)
19222 && (any_dependent_template_arguments_p
19223 (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (scope
)))))
19226 /* Other types are non-dependent. */
19230 /* Returns TRUE if TYPE is dependent, in the sense of
19231 [temp.dep.type]. Note that a NULL type is considered dependent. */
19234 dependent_type_p (tree type
)
19236 /* If there are no template parameters in scope, then there can't be
19237 any dependent types. */
19238 if (!processing_template_decl
)
19240 /* If we are not processing a template, then nobody should be
19241 providing us with a dependent type. */
19243 gcc_assert (TREE_CODE (type
) != TEMPLATE_TYPE_PARM
|| is_auto (type
));
19247 /* If the type is NULL, we have not computed a type for the entity
19248 in question; in that case, the type is dependent. */
19252 /* Erroneous types can be considered non-dependent. */
19253 if (type
== error_mark_node
)
19256 /* If we have not already computed the appropriate value for TYPE,
19258 if (!TYPE_DEPENDENT_P_VALID (type
))
19260 TYPE_DEPENDENT_P (type
) = dependent_type_p_r (type
);
19261 TYPE_DEPENDENT_P_VALID (type
) = 1;
19264 return TYPE_DEPENDENT_P (type
);
19267 /* Returns TRUE if SCOPE is a dependent scope, in which we can't do any
19268 lookup. In other words, a dependent type that is not the current
19272 dependent_scope_p (tree scope
)
19274 return (scope
&& TYPE_P (scope
) && dependent_type_p (scope
)
19275 && !currently_open_class (scope
));
19278 /* Returns TRUE if the EXPRESSION is value-dependent, in the sense of
19279 [temp.dep.constexpr]. EXPRESSION is already known to be a constant
19282 /* Note that this predicate is not appropriate for general expressions;
19283 only constant expressions (that satisfy potential_constant_expression)
19284 can be tested for value dependence.
19286 We should really also have a predicate for "instantiation-dependent".
19288 fold_non_dependent_expr: fold if constant and not type-dependent and not value-dependent.
19289 (what about instantiation-dependent constant-expressions?)
19290 is_late_template_attribute: defer if instantiation-dependent.
19291 compute_array_index_type: proceed if constant and not t- or v-dependent
19292 if instantiation-dependent, need to remember full expression
19293 uses_template_parms: FIXME - need to audit callers
19294 tsubst_decl [function_decl]: Why is this using value_dependent_expression_p?
19295 dependent_type_p [array_type]: dependent if index type is dependent
19297 static_assert - instantiation-dependent */
19300 value_dependent_expression_p (tree expression
)
19302 if (!processing_template_decl
)
19305 /* A name declared with a dependent type. */
19306 if (DECL_P (expression
) && type_dependent_expression_p (expression
))
19309 switch (TREE_CODE (expression
))
19311 case IDENTIFIER_NODE
:
19312 /* A name that has not been looked up -- must be dependent. */
19315 case TEMPLATE_PARM_INDEX
:
19316 /* A non-type template parm. */
19320 /* A non-type template parm. */
19321 if (DECL_TEMPLATE_PARM_P (expression
))
19323 return value_dependent_expression_p (DECL_INITIAL (expression
));
19326 /* A constant with literal type and is initialized
19327 with an expression that is value-dependent. */
19328 if (DECL_INITIAL (expression
)
19329 && decl_constant_var_p (expression
)
19330 && value_dependent_expression_p (DECL_INITIAL (expression
)))
19334 case DYNAMIC_CAST_EXPR
:
19335 case STATIC_CAST_EXPR
:
19336 case CONST_CAST_EXPR
:
19337 case REINTERPRET_CAST_EXPR
:
19339 /* These expressions are value-dependent if the type to which
19340 the cast occurs is dependent or the expression being casted
19341 is value-dependent. */
19343 tree type
= TREE_TYPE (expression
);
19345 if (dependent_type_p (type
))
19348 /* A functional cast has a list of operands. */
19349 expression
= TREE_OPERAND (expression
, 0);
19352 /* If there are no operands, it must be an expression such
19353 as "int()". This should not happen for aggregate types
19354 because it would form non-constant expressions. */
19355 gcc_assert (cxx_dialect
>= cxx0x
19356 || INTEGRAL_OR_ENUMERATION_TYPE_P (type
));
19361 if (TREE_CODE (expression
) == TREE_LIST
)
19362 return any_value_dependent_elements_p (expression
);
19364 return value_dependent_expression_p (expression
);
19370 /* A `sizeof' expression is value-dependent if the operand is
19371 type-dependent or is a pack expansion. */
19372 expression
= TREE_OPERAND (expression
, 0);
19373 if (PACK_EXPANSION_P (expression
))
19375 else if (TYPE_P (expression
))
19376 return dependent_type_p (expression
);
19377 return type_dependent_expression_p (expression
);
19379 case AT_ENCODE_EXPR
:
19380 /* An 'encode' expression is value-dependent if the operand is
19382 expression
= TREE_OPERAND (expression
, 0);
19383 return dependent_type_p (expression
);
19385 case NOEXCEPT_EXPR
:
19386 expression
= TREE_OPERAND (expression
, 0);
19387 return type_dependent_expression_p (expression
);
19391 tree name
= TREE_OPERAND (expression
, 1);
19392 return value_dependent_expression_p (name
);
19395 case COMPONENT_REF
:
19396 return (value_dependent_expression_p (TREE_OPERAND (expression
, 0))
19397 || value_dependent_expression_p (TREE_OPERAND (expression
, 1)));
19399 case NONTYPE_ARGUMENT_PACK
:
19400 /* A NONTYPE_ARGUMENT_PACK is value-dependent if any packed argument
19401 is value-dependent. */
19403 tree values
= ARGUMENT_PACK_ARGS (expression
);
19404 int i
, len
= TREE_VEC_LENGTH (values
);
19406 for (i
= 0; i
< len
; ++i
)
19407 if (value_dependent_expression_p (TREE_VEC_ELT (values
, i
)))
19415 tree type2
= TRAIT_EXPR_TYPE2 (expression
);
19416 return (dependent_type_p (TRAIT_EXPR_TYPE1 (expression
))
19417 || (type2
? dependent_type_p (type2
) : false));
19421 return ((value_dependent_expression_p (TREE_OPERAND (expression
, 0)))
19422 || (value_dependent_expression_p (TREE_OPERAND (expression
, 2))));
19425 return ((value_dependent_expression_p (TREE_OPERAND (expression
, 0)))
19426 || (value_dependent_expression_p (TREE_OPERAND (expression
, 1))));
19430 tree op
= TREE_OPERAND (expression
, 0);
19431 return (value_dependent_expression_p (op
)
19432 || has_value_dependent_address (op
));
19437 tree fn
= get_callee_fndecl (expression
);
19439 if (!fn
&& value_dependent_expression_p (CALL_EXPR_FN (expression
)))
19441 nargs
= call_expr_nargs (expression
);
19442 for (i
= 0; i
< nargs
; ++i
)
19444 tree op
= CALL_EXPR_ARG (expression
, i
);
19445 /* In a call to a constexpr member function, look through the
19446 implicit ADDR_EXPR on the object argument so that it doesn't
19447 cause the call to be considered value-dependent. We also
19448 look through it in potential_constant_expression. */
19449 if (i
== 0 && fn
&& DECL_DECLARED_CONSTEXPR_P (fn
)
19450 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
19451 && TREE_CODE (op
) == ADDR_EXPR
)
19452 op
= TREE_OPERAND (op
, 0);
19453 if (value_dependent_expression_p (op
))
19459 case TEMPLATE_ID_EXPR
:
19460 /* If a TEMPLATE_ID_EXPR involves a dependent name, it will be
19462 return type_dependent_expression_p (expression
);
19468 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expression
), ix
, val
)
19469 if (value_dependent_expression_p (val
))
19475 /* A constant expression is value-dependent if any subexpression is
19476 value-dependent. */
19477 switch (TREE_CODE_CLASS (TREE_CODE (expression
)))
19479 case tcc_reference
:
19481 case tcc_comparison
:
19483 case tcc_expression
:
19486 int i
, len
= cp_tree_operand_length (expression
);
19488 for (i
= 0; i
< len
; i
++)
19490 tree t
= TREE_OPERAND (expression
, i
);
19492 /* In some cases, some of the operands may be missing.l
19493 (For example, in the case of PREDECREMENT_EXPR, the
19494 amount to increment by may be missing.) That doesn't
19495 make the expression dependent. */
19496 if (t
&& value_dependent_expression_p (t
))
19507 /* The expression is not value-dependent. */
19511 /* Returns TRUE if the EXPRESSION is type-dependent, in the sense of
19512 [temp.dep.expr]. Note that an expression with no type is
19513 considered dependent. Other parts of the compiler arrange for an
19514 expression with type-dependent subexpressions to have no type, so
19515 this function doesn't have to be fully recursive. */
19518 type_dependent_expression_p (tree expression
)
19520 if (!processing_template_decl
)
19523 if (expression
== error_mark_node
)
19526 /* An unresolved name is always dependent. */
19527 if (TREE_CODE (expression
) == IDENTIFIER_NODE
19528 || TREE_CODE (expression
) == USING_DECL
)
19531 /* Some expression forms are never type-dependent. */
19532 if (TREE_CODE (expression
) == PSEUDO_DTOR_EXPR
19533 || TREE_CODE (expression
) == SIZEOF_EXPR
19534 || TREE_CODE (expression
) == ALIGNOF_EXPR
19535 || TREE_CODE (expression
) == AT_ENCODE_EXPR
19536 || TREE_CODE (expression
) == NOEXCEPT_EXPR
19537 || TREE_CODE (expression
) == TRAIT_EXPR
19538 || TREE_CODE (expression
) == TYPEID_EXPR
19539 || TREE_CODE (expression
) == DELETE_EXPR
19540 || TREE_CODE (expression
) == VEC_DELETE_EXPR
19541 || TREE_CODE (expression
) == THROW_EXPR
)
19544 /* The types of these expressions depends only on the type to which
19545 the cast occurs. */
19546 if (TREE_CODE (expression
) == DYNAMIC_CAST_EXPR
19547 || TREE_CODE (expression
) == STATIC_CAST_EXPR
19548 || TREE_CODE (expression
) == CONST_CAST_EXPR
19549 || TREE_CODE (expression
) == REINTERPRET_CAST_EXPR
19550 || TREE_CODE (expression
) == IMPLICIT_CONV_EXPR
19551 || TREE_CODE (expression
) == CAST_EXPR
)
19552 return dependent_type_p (TREE_TYPE (expression
));
19554 /* The types of these expressions depends only on the type created
19555 by the expression. */
19556 if (TREE_CODE (expression
) == NEW_EXPR
19557 || TREE_CODE (expression
) == VEC_NEW_EXPR
)
19559 /* For NEW_EXPR tree nodes created inside a template, either
19560 the object type itself or a TREE_LIST may appear as the
19562 tree type
= TREE_OPERAND (expression
, 1);
19563 if (TREE_CODE (type
) == TREE_LIST
)
19564 /* This is an array type. We need to check array dimensions
19566 return dependent_type_p (TREE_VALUE (TREE_PURPOSE (type
)))
19567 || value_dependent_expression_p
19568 (TREE_OPERAND (TREE_VALUE (type
), 1));
19570 return dependent_type_p (type
);
19573 if (TREE_CODE (expression
) == SCOPE_REF
)
19575 tree scope
= TREE_OPERAND (expression
, 0);
19576 tree name
= TREE_OPERAND (expression
, 1);
19578 /* 14.6.2.2 [temp.dep.expr]: An id-expression is type-dependent if it
19579 contains an identifier associated by name lookup with one or more
19580 declarations declared with a dependent type, or...a
19581 nested-name-specifier or qualified-id that names a member of an
19582 unknown specialization. */
19583 return (type_dependent_expression_p (name
)
19584 || dependent_scope_p (scope
));
19587 if (TREE_CODE (expression
) == FUNCTION_DECL
19588 && DECL_LANG_SPECIFIC (expression
)
19589 && DECL_TEMPLATE_INFO (expression
)
19590 && (any_dependent_template_arguments_p
19591 (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (expression
)))))
19594 if (TREE_CODE (expression
) == TEMPLATE_DECL
19595 && !DECL_TEMPLATE_TEMPLATE_PARM_P (expression
))
19598 if (TREE_CODE (expression
) == STMT_EXPR
)
19599 expression
= stmt_expr_value_expr (expression
);
19601 if (BRACE_ENCLOSED_INITIALIZER_P (expression
))
19606 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expression
), i
, elt
)
19608 if (type_dependent_expression_p (elt
))
19614 /* A static data member of the current instantiation with incomplete
19615 array type is type-dependent, as the definition and specializations
19616 can have different bounds. */
19617 if (TREE_CODE (expression
) == VAR_DECL
19618 && DECL_CLASS_SCOPE_P (expression
)
19619 && dependent_type_p (DECL_CONTEXT (expression
))
19620 && VAR_HAD_UNKNOWN_BOUND (expression
))
19623 if (TREE_TYPE (expression
) == unknown_type_node
)
19625 if (TREE_CODE (expression
) == ADDR_EXPR
)
19626 return type_dependent_expression_p (TREE_OPERAND (expression
, 0));
19627 if (TREE_CODE (expression
) == COMPONENT_REF
19628 || TREE_CODE (expression
) == OFFSET_REF
)
19630 if (type_dependent_expression_p (TREE_OPERAND (expression
, 0)))
19632 expression
= TREE_OPERAND (expression
, 1);
19633 if (TREE_CODE (expression
) == IDENTIFIER_NODE
)
19636 /* SCOPE_REF with non-null TREE_TYPE is always non-dependent. */
19637 if (TREE_CODE (expression
) == SCOPE_REF
)
19640 if (BASELINK_P (expression
))
19641 expression
= BASELINK_FUNCTIONS (expression
);
19643 if (TREE_CODE (expression
) == TEMPLATE_ID_EXPR
)
19645 if (any_dependent_template_arguments_p
19646 (TREE_OPERAND (expression
, 1)))
19648 expression
= TREE_OPERAND (expression
, 0);
19650 gcc_assert (TREE_CODE (expression
) == OVERLOAD
19651 || TREE_CODE (expression
) == FUNCTION_DECL
);
19655 if (type_dependent_expression_p (OVL_CURRENT (expression
)))
19657 expression
= OVL_NEXT (expression
);
19662 gcc_assert (TREE_CODE (expression
) != TYPE_DECL
);
19664 return (dependent_type_p (TREE_TYPE (expression
)));
19667 /* Like type_dependent_expression_p, but it also works while not processing
19668 a template definition, i.e. during substitution or mangling. */
19671 type_dependent_expression_p_push (tree expr
)
19674 ++processing_template_decl
;
19675 b
= type_dependent_expression_p (expr
);
19676 --processing_template_decl
;
19680 /* Returns TRUE if ARGS contains a type-dependent expression. */
19683 any_type_dependent_arguments_p (const VEC(tree
,gc
) *args
)
19688 FOR_EACH_VEC_ELT (tree
, args
, i
, arg
)
19690 if (type_dependent_expression_p (arg
))
19696 /* Returns TRUE if LIST (a TREE_LIST whose TREE_VALUEs are
19697 expressions) contains any type-dependent expressions. */
19700 any_type_dependent_elements_p (const_tree list
)
19702 for (; list
; list
= TREE_CHAIN (list
))
19703 if (value_dependent_expression_p (TREE_VALUE (list
)))
19709 /* Returns TRUE if LIST (a TREE_LIST whose TREE_VALUEs are
19710 expressions) contains any value-dependent expressions. */
19713 any_value_dependent_elements_p (const_tree list
)
19715 for (; list
; list
= TREE_CHAIN (list
))
19716 if (value_dependent_expression_p (TREE_VALUE (list
)))
19722 /* Returns TRUE if the ARG (a template argument) is dependent. */
19725 dependent_template_arg_p (tree arg
)
19727 if (!processing_template_decl
)
19730 /* Assume a template argument that was wrongly written by the user
19731 is dependent. This is consistent with what
19732 any_dependent_template_arguments_p [that calls this function]
19734 if (!arg
|| arg
== error_mark_node
)
19737 if (TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
19738 arg
= ARGUMENT_PACK_SELECT_ARG (arg
);
19740 if (TREE_CODE (arg
) == TEMPLATE_DECL
19741 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
19742 return dependent_template_p (arg
);
19743 else if (ARGUMENT_PACK_P (arg
))
19745 tree args
= ARGUMENT_PACK_ARGS (arg
);
19746 int i
, len
= TREE_VEC_LENGTH (args
);
19747 for (i
= 0; i
< len
; ++i
)
19749 if (dependent_template_arg_p (TREE_VEC_ELT (args
, i
)))
19755 else if (TYPE_P (arg
))
19756 return dependent_type_p (arg
);
19758 return (type_dependent_expression_p (arg
)
19759 || value_dependent_expression_p (arg
));
19762 /* Returns true if ARGS (a collection of template arguments) contains
19763 any types that require structural equality testing. */
19766 any_template_arguments_need_structural_equality_p (tree args
)
19773 if (args
== error_mark_node
)
19776 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
19778 tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
19779 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
19781 tree arg
= TREE_VEC_ELT (level
, j
);
19782 tree packed_args
= NULL_TREE
;
19785 if (ARGUMENT_PACK_P (arg
))
19787 /* Look inside the argument pack. */
19788 packed_args
= ARGUMENT_PACK_ARGS (arg
);
19789 len
= TREE_VEC_LENGTH (packed_args
);
19792 for (k
= 0; k
< len
; ++k
)
19795 arg
= TREE_VEC_ELT (packed_args
, k
);
19797 if (error_operand_p (arg
))
19799 else if (TREE_CODE (arg
) == TEMPLATE_DECL
19800 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
19802 else if (TYPE_P (arg
) && TYPE_STRUCTURAL_EQUALITY_P (arg
))
19804 else if (!TYPE_P (arg
) && TREE_TYPE (arg
)
19805 && TYPE_STRUCTURAL_EQUALITY_P (TREE_TYPE (arg
)))
19814 /* Returns true if ARGS (a collection of template arguments) contains
19815 any dependent arguments. */
19818 any_dependent_template_arguments_p (const_tree args
)
19825 if (args
== error_mark_node
)
19828 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
19830 const_tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
19831 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
19832 if (dependent_template_arg_p (TREE_VEC_ELT (level
, j
)))
19839 /* Returns TRUE if the template TMPL is dependent. */
19842 dependent_template_p (tree tmpl
)
19844 if (TREE_CODE (tmpl
) == OVERLOAD
)
19848 if (dependent_template_p (OVL_CURRENT (tmpl
)))
19850 tmpl
= OVL_NEXT (tmpl
);
19855 /* Template template parameters are dependent. */
19856 if (DECL_TEMPLATE_TEMPLATE_PARM_P (tmpl
)
19857 || TREE_CODE (tmpl
) == TEMPLATE_TEMPLATE_PARM
)
19859 /* So are names that have not been looked up. */
19860 if (TREE_CODE (tmpl
) == SCOPE_REF
19861 || TREE_CODE (tmpl
) == IDENTIFIER_NODE
)
19863 /* So are member templates of dependent classes. */
19864 if (TYPE_P (CP_DECL_CONTEXT (tmpl
)))
19865 return dependent_type_p (DECL_CONTEXT (tmpl
));
19869 /* Returns TRUE if the specialization TMPL<ARGS> is dependent. */
19872 dependent_template_id_p (tree tmpl
, tree args
)
19874 return (dependent_template_p (tmpl
)
19875 || any_dependent_template_arguments_p (args
));
19878 /* Returns TRUE if OMP_FOR with DECLV, INITV, CONDV and INCRV vectors
19882 dependent_omp_for_p (tree declv
, tree initv
, tree condv
, tree incrv
)
19886 if (!processing_template_decl
)
19889 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
19891 tree decl
= TREE_VEC_ELT (declv
, i
);
19892 tree init
= TREE_VEC_ELT (initv
, i
);
19893 tree cond
= TREE_VEC_ELT (condv
, i
);
19894 tree incr
= TREE_VEC_ELT (incrv
, i
);
19896 if (type_dependent_expression_p (decl
))
19899 if (init
&& type_dependent_expression_p (init
))
19902 if (type_dependent_expression_p (cond
))
19905 if (COMPARISON_CLASS_P (cond
)
19906 && (type_dependent_expression_p (TREE_OPERAND (cond
, 0))
19907 || type_dependent_expression_p (TREE_OPERAND (cond
, 1))))
19910 if (TREE_CODE (incr
) == MODOP_EXPR
)
19912 if (type_dependent_expression_p (TREE_OPERAND (incr
, 0))
19913 || type_dependent_expression_p (TREE_OPERAND (incr
, 2)))
19916 else if (type_dependent_expression_p (incr
))
19918 else if (TREE_CODE (incr
) == MODIFY_EXPR
)
19920 if (type_dependent_expression_p (TREE_OPERAND (incr
, 0)))
19922 else if (BINARY_CLASS_P (TREE_OPERAND (incr
, 1)))
19924 tree t
= TREE_OPERAND (incr
, 1);
19925 if (type_dependent_expression_p (TREE_OPERAND (t
, 0))
19926 || type_dependent_expression_p (TREE_OPERAND (t
, 1)))
19935 /* TYPE is a TYPENAME_TYPE. Returns the ordinary TYPE to which the
19936 TYPENAME_TYPE corresponds. Returns the original TYPENAME_TYPE if
19937 no such TYPE can be found. Note that this function peers inside
19938 uninstantiated templates and therefore should be used only in
19939 extremely limited situations. ONLY_CURRENT_P restricts this
19940 peering to the currently open classes hierarchy (which is required
19941 when comparing types). */
19944 resolve_typename_type (tree type
, bool only_current_p
)
19953 gcc_assert (TREE_CODE (type
) == TYPENAME_TYPE
);
19955 scope
= TYPE_CONTEXT (type
);
19956 /* Usually the non-qualified identifier of a TYPENAME_TYPE is
19957 TYPE_IDENTIFIER (type). But when 'type' is a typedef variant of
19958 a TYPENAME_TYPE node, then TYPE_NAME (type) is set to the TYPE_DECL representing
19959 the typedef. In that case TYPE_IDENTIFIER (type) is not the non-qualified
19960 identifier of the TYPENAME_TYPE anymore.
19961 So by getting the TYPE_IDENTIFIER of the _main declaration_ of the
19962 TYPENAME_TYPE instead, we avoid messing up with a possible
19963 typedef variant case. */
19964 name
= TYPE_IDENTIFIER (TYPE_MAIN_VARIANT (type
));
19966 /* If the SCOPE is itself a TYPENAME_TYPE, then we need to resolve
19967 it first before we can figure out what NAME refers to. */
19968 if (TREE_CODE (scope
) == TYPENAME_TYPE
)
19969 scope
= resolve_typename_type (scope
, only_current_p
);
19970 /* If we don't know what SCOPE refers to, then we cannot resolve the
19972 if (TREE_CODE (scope
) == TYPENAME_TYPE
)
19974 /* If the SCOPE is a template type parameter, we have no way of
19975 resolving the name. */
19976 if (TREE_CODE (scope
) == TEMPLATE_TYPE_PARM
)
19978 /* If the SCOPE is not the current instantiation, there's no reason
19979 to look inside it. */
19980 if (only_current_p
&& !currently_open_class (scope
))
19982 /* If this is a typedef, we don't want to look inside (c++/11987). */
19983 if (typedef_variant_p (type
))
19985 /* If SCOPE isn't the template itself, it will not have a valid
19986 TYPE_FIELDS list. */
19987 if (same_type_p (scope
, CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope
)))
19988 /* scope is either the template itself or a compatible instantiation
19989 like X<T>, so look up the name in the original template. */
19990 scope
= CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope
);
19992 /* scope is a partial instantiation, so we can't do the lookup or we
19993 will lose the template arguments. */
19995 /* Enter the SCOPE so that name lookup will be resolved as if we
19996 were in the class definition. In particular, SCOPE will no
19997 longer be considered a dependent type. */
19998 pushed_scope
= push_scope (scope
);
19999 /* Look up the declaration. */
20000 decl
= lookup_member (scope
, name
, /*protect=*/0, /*want_type=*/true,
20001 tf_warning_or_error
);
20003 result
= NULL_TREE
;
20005 /* For a TYPENAME_TYPE like "typename X::template Y<T>", we want to
20006 find a TEMPLATE_DECL. Otherwise, we want to find a TYPE_DECL. */
20009 else if (TREE_CODE (TYPENAME_TYPE_FULLNAME (type
)) == IDENTIFIER_NODE
20010 && TREE_CODE (decl
) == TYPE_DECL
)
20012 result
= TREE_TYPE (decl
);
20013 if (result
== error_mark_node
)
20014 result
= NULL_TREE
;
20016 else if (TREE_CODE (TYPENAME_TYPE_FULLNAME (type
)) == TEMPLATE_ID_EXPR
20017 && DECL_CLASS_TEMPLATE_P (decl
))
20021 /* Obtain the template and the arguments. */
20022 tmpl
= TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type
), 0);
20023 args
= TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type
), 1);
20024 /* Instantiate the template. */
20025 result
= lookup_template_class (tmpl
, args
, NULL_TREE
, NULL_TREE
,
20026 /*entering_scope=*/0,
20027 tf_error
| tf_user
);
20028 if (result
== error_mark_node
)
20029 result
= NULL_TREE
;
20032 /* Leave the SCOPE. */
20034 pop_scope (pushed_scope
);
20036 /* If we failed to resolve it, return the original typename. */
20040 /* If lookup found a typename type, resolve that too. */
20041 if (TREE_CODE (result
) == TYPENAME_TYPE
&& !TYPENAME_IS_RESOLVING_P (result
))
20043 /* Ill-formed programs can cause infinite recursion here, so we
20044 must catch that. */
20045 TYPENAME_IS_RESOLVING_P (type
) = 1;
20046 result
= resolve_typename_type (result
, only_current_p
);
20047 TYPENAME_IS_RESOLVING_P (type
) = 0;
20050 /* Qualify the resulting type. */
20051 quals
= cp_type_quals (type
);
20053 result
= cp_build_qualified_type (result
, cp_type_quals (result
) | quals
);
20058 /* EXPR is an expression which is not type-dependent. Return a proxy
20059 for EXPR that can be used to compute the types of larger
20060 expressions containing EXPR. */
20063 build_non_dependent_expr (tree expr
)
20067 #ifdef ENABLE_CHECKING
20068 /* Try to get a constant value for all non-type-dependent expressions in
20069 order to expose bugs in *_dependent_expression_p and constexpr. */
20070 if (cxx_dialect
>= cxx0x
)
20071 maybe_constant_value (fold_non_dependent_expr_sfinae (expr
, tf_none
));
20074 /* Preserve OVERLOADs; the functions must be available to resolve
20077 if (TREE_CODE (inner_expr
) == STMT_EXPR
)
20078 inner_expr
= stmt_expr_value_expr (inner_expr
);
20079 if (TREE_CODE (inner_expr
) == ADDR_EXPR
)
20080 inner_expr
= TREE_OPERAND (inner_expr
, 0);
20081 if (TREE_CODE (inner_expr
) == COMPONENT_REF
)
20082 inner_expr
= TREE_OPERAND (inner_expr
, 1);
20083 if (is_overloaded_fn (inner_expr
)
20084 || TREE_CODE (inner_expr
) == OFFSET_REF
)
20086 /* There is no need to return a proxy for a variable. */
20087 if (TREE_CODE (expr
) == VAR_DECL
)
20089 /* Preserve string constants; conversions from string constants to
20090 "char *" are allowed, even though normally a "const char *"
20091 cannot be used to initialize a "char *". */
20092 if (TREE_CODE (expr
) == STRING_CST
)
20094 /* Preserve arithmetic constants, as an optimization -- there is no
20095 reason to create a new node. */
20096 if (TREE_CODE (expr
) == INTEGER_CST
|| TREE_CODE (expr
) == REAL_CST
)
20098 /* Preserve THROW_EXPRs -- all throw-expressions have type "void".
20099 There is at least one place where we want to know that a
20100 particular expression is a throw-expression: when checking a ?:
20101 expression, there are special rules if the second or third
20102 argument is a throw-expression. */
20103 if (TREE_CODE (expr
) == THROW_EXPR
)
20106 /* Don't wrap an initializer list, we need to be able to look inside. */
20107 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
20110 if (TREE_CODE (expr
) == COND_EXPR
)
20111 return build3 (COND_EXPR
,
20113 TREE_OPERAND (expr
, 0),
20114 (TREE_OPERAND (expr
, 1)
20115 ? build_non_dependent_expr (TREE_OPERAND (expr
, 1))
20116 : build_non_dependent_expr (TREE_OPERAND (expr
, 0))),
20117 build_non_dependent_expr (TREE_OPERAND (expr
, 2)));
20118 if (TREE_CODE (expr
) == COMPOUND_EXPR
20119 && !COMPOUND_EXPR_OVERLOADED (expr
))
20120 return build2 (COMPOUND_EXPR
,
20122 TREE_OPERAND (expr
, 0),
20123 build_non_dependent_expr (TREE_OPERAND (expr
, 1)));
20125 /* If the type is unknown, it can't really be non-dependent */
20126 gcc_assert (TREE_TYPE (expr
) != unknown_type_node
);
20128 /* Otherwise, build a NON_DEPENDENT_EXPR. */
20129 return build1 (NON_DEPENDENT_EXPR
, TREE_TYPE (expr
), expr
);
20132 /* ARGS is a vector of expressions as arguments to a function call.
20133 Replace the arguments with equivalent non-dependent expressions.
20134 This modifies ARGS in place. */
20137 make_args_non_dependent (VEC(tree
,gc
) *args
)
20142 FOR_EACH_VEC_ELT (tree
, args
, ix
, arg
)
20144 tree newarg
= build_non_dependent_expr (arg
);
20146 VEC_replace (tree
, args
, ix
, newarg
);
20150 /* Returns a type which represents 'auto'. We use a TEMPLATE_TYPE_PARM
20151 with a level one deeper than the actual template parms. */
20156 tree au
= cxx_make_type (TEMPLATE_TYPE_PARM
);
20157 TYPE_NAME (au
) = build_decl (BUILTINS_LOCATION
,
20158 TYPE_DECL
, get_identifier ("auto"), au
);
20159 TYPE_STUB_DECL (au
) = TYPE_NAME (au
);
20160 TEMPLATE_TYPE_PARM_INDEX (au
) = build_template_parm_index
20161 (0, processing_template_decl
+ 1, processing_template_decl
+ 1,
20162 0, TYPE_NAME (au
), NULL_TREE
);
20163 TYPE_CANONICAL (au
) = canonical_type_parameter (au
);
20164 DECL_ARTIFICIAL (TYPE_NAME (au
)) = 1;
20165 SET_DECL_TEMPLATE_PARM_P (TYPE_NAME (au
));
20170 /* Given type ARG, return std::initializer_list<ARG>. */
20175 tree std_init_list
= namespace_binding
20176 (get_identifier ("initializer_list"), std_node
);
20178 if (!std_init_list
|| !DECL_CLASS_TEMPLATE_P (std_init_list
))
20180 error ("deducing from brace-enclosed initializer list requires "
20181 "#include <initializer_list>");
20182 return error_mark_node
;
20184 argvec
= make_tree_vec (1);
20185 TREE_VEC_ELT (argvec
, 0) = arg
;
20186 return lookup_template_class (std_init_list
, argvec
, NULL_TREE
,
20187 NULL_TREE
, 0, tf_warning_or_error
);
20190 /* Replace auto in TYPE with std::initializer_list<auto>. */
20193 listify_autos (tree type
, tree auto_node
)
20195 tree init_auto
= listify (auto_node
);
20196 tree argvec
= make_tree_vec (1);
20197 TREE_VEC_ELT (argvec
, 0) = init_auto
;
20198 if (processing_template_decl
)
20199 argvec
= add_to_template_args (current_template_args (), argvec
);
20200 return tsubst (type
, argvec
, tf_warning_or_error
, NULL_TREE
);
20203 /* walk_tree helper for do_auto_deduction. */
20206 contains_auto_r (tree
*tp
, int *walk_subtrees ATTRIBUTE_UNUSED
,
20209 /* Is this a variable with the type we're looking for? */
20211 && TREE_TYPE (*tp
) == type
)
20217 /* Replace occurrences of 'auto' in TYPE with the appropriate type deduced
20218 from INIT. AUTO_NODE is the TEMPLATE_TYPE_PARM used for 'auto' in TYPE. */
20221 do_auto_deduction (tree type
, tree init
, tree auto_node
)
20223 tree parms
, tparms
, targs
;
20228 if (processing_template_decl
20229 && (TREE_TYPE (init
) == NULL_TREE
20230 || BRACE_ENCLOSED_INITIALIZER_P (init
)))
20231 /* Not enough information to try this yet. */
20234 /* The name of the object being declared shall not appear in the
20235 initializer expression. */
20236 decl
= cp_walk_tree_without_duplicates (&init
, contains_auto_r
, type
);
20239 error ("variable %q#D with %<auto%> type used in its own "
20240 "initializer", decl
);
20241 return error_mark_node
;
20244 /* [dcl.spec.auto]: Obtain P from T by replacing the occurrences of auto
20245 with either a new invented type template parameter U or, if the
20246 initializer is a braced-init-list (8.5.4), with
20247 std::initializer_list<U>. */
20248 if (BRACE_ENCLOSED_INITIALIZER_P (init
))
20249 type
= listify_autos (type
, auto_node
);
20251 init
= resolve_nondeduced_context (init
);
20253 parms
= build_tree_list (NULL_TREE
, type
);
20255 tparms
= make_tree_vec (1);
20256 targs
= make_tree_vec (1);
20257 TREE_VEC_ELT (tparms
, 0)
20258 = build_tree_list (NULL_TREE
, TYPE_NAME (auto_node
));
20259 val
= type_unification_real (tparms
, targs
, parms
, args
, 1, 0,
20260 DEDUCE_CALL
, LOOKUP_NORMAL
,
20261 /*explain_p=*/false);
20264 if (processing_template_decl
)
20265 /* Try again at instantiation time. */
20267 if (type
&& type
!= error_mark_node
)
20268 /* If type is error_mark_node a diagnostic must have been
20269 emitted by now. Also, having a mention to '<type error>'
20270 in the diagnostic is not really useful to the user. */
20271 error ("unable to deduce %qT from %qE", type
, init
);
20272 return error_mark_node
;
20275 /* If the list of declarators contains more than one declarator, the type
20276 of each declared variable is determined as described above. If the
20277 type deduced for the template parameter U is not the same in each
20278 deduction, the program is ill-formed. */
20279 if (TREE_TYPE (auto_node
)
20280 && !same_type_p (TREE_TYPE (auto_node
), TREE_VEC_ELT (targs
, 0)))
20282 error ("inconsistent deduction for %qT: %qT and then %qT",
20283 auto_node
, TREE_TYPE (auto_node
), TREE_VEC_ELT (targs
, 0));
20284 return error_mark_node
;
20286 TREE_TYPE (auto_node
) = TREE_VEC_ELT (targs
, 0);
20288 if (processing_template_decl
)
20289 targs
= add_to_template_args (current_template_args (), targs
);
20290 return tsubst (type
, targs
, tf_warning_or_error
, NULL_TREE
);
20293 /* Substitutes LATE_RETURN_TYPE for 'auto' in TYPE and returns the
20297 splice_late_return_type (tree type
, tree late_return_type
)
20301 if (late_return_type
== NULL_TREE
)
20303 argvec
= make_tree_vec (1);
20304 TREE_VEC_ELT (argvec
, 0) = late_return_type
;
20305 if (processing_template_parmlist
)
20306 /* For a late-specified return type in a template type-parameter, we
20307 need to add a dummy argument level for its parmlist. */
20308 argvec
= add_to_template_args
20309 (make_tree_vec (processing_template_parmlist
), argvec
);
20310 if (current_template_parms
)
20311 argvec
= add_to_template_args (current_template_args (), argvec
);
20312 return tsubst (type
, argvec
, tf_warning_or_error
, NULL_TREE
);
20315 /* Returns true iff TYPE is a TEMPLATE_TYPE_PARM representing 'auto'. */
20318 is_auto (const_tree type
)
20320 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
20321 && TYPE_IDENTIFIER (type
) == get_identifier ("auto"))
20327 /* Returns true iff TYPE contains a use of 'auto'. Since auto can only
20328 appear as a type-specifier for the declaration in question, we don't
20329 have to look through the whole type. */
20332 type_uses_auto (tree type
)
20334 enum tree_code code
;
20335 if (is_auto (type
))
20338 code
= TREE_CODE (type
);
20340 if (code
== POINTER_TYPE
|| code
== REFERENCE_TYPE
20341 || code
== OFFSET_TYPE
|| code
== FUNCTION_TYPE
20342 || code
== METHOD_TYPE
|| code
== ARRAY_TYPE
)
20343 return type_uses_auto (TREE_TYPE (type
));
20345 if (TYPE_PTRMEMFUNC_P (type
))
20346 return type_uses_auto (TREE_TYPE (TREE_TYPE
20347 (TYPE_PTRMEMFUNC_FN_TYPE (type
))));
20352 /* For a given template T, return the vector of typedefs referenced
20353 in T for which access check is needed at T instantiation time.
20354 T is either a FUNCTION_DECL or a RECORD_TYPE.
20355 Those typedefs were added to T by the function
20356 append_type_to_template_for_access_check. */
20358 VEC(qualified_typedef_usage_t
,gc
)*
20359 get_types_needing_access_check (tree t
)
20362 VEC(qualified_typedef_usage_t
,gc
) *result
= NULL
;
20364 if (!t
|| t
== error_mark_node
)
20367 if (!(ti
= get_template_info (t
)))
20370 if (CLASS_TYPE_P (t
)
20371 || TREE_CODE (t
) == FUNCTION_DECL
)
20373 if (!TI_TEMPLATE (ti
))
20376 result
= TI_TYPEDEFS_NEEDING_ACCESS_CHECKING (ti
);
20382 /* Append the typedef TYPE_DECL used in template T to a list of typedefs
20383 tied to T. That list of typedefs will be access checked at
20384 T instantiation time.
20385 T is either a FUNCTION_DECL or a RECORD_TYPE.
20386 TYPE_DECL is a TYPE_DECL node representing a typedef.
20387 SCOPE is the scope through which TYPE_DECL is accessed.
20388 LOCATION is the location of the usage point of TYPE_DECL.
20390 This function is a subroutine of
20391 append_type_to_template_for_access_check. */
20394 append_type_to_template_for_access_check_1 (tree t
,
20397 location_t location
)
20399 qualified_typedef_usage_t typedef_usage
;
20402 if (!t
|| t
== error_mark_node
)
20405 gcc_assert ((TREE_CODE (t
) == FUNCTION_DECL
20406 || CLASS_TYPE_P (t
))
20408 && TREE_CODE (type_decl
) == TYPE_DECL
20411 if (!(ti
= get_template_info (t
)))
20414 gcc_assert (TI_TEMPLATE (ti
));
20416 typedef_usage
.typedef_decl
= type_decl
;
20417 typedef_usage
.context
= scope
;
20418 typedef_usage
.locus
= location
;
20420 VEC_safe_push (qualified_typedef_usage_t
, gc
,
20421 TI_TYPEDEFS_NEEDING_ACCESS_CHECKING (ti
),
20425 /* Append TYPE_DECL to the template TEMPL.
20426 TEMPL is either a class type, a FUNCTION_DECL or a a TEMPLATE_DECL.
20427 At TEMPL instanciation time, TYPE_DECL will be checked to see
20428 if it can be accessed through SCOPE.
20429 LOCATION is the location of the usage point of TYPE_DECL.
20431 e.g. consider the following code snippet:
20438 template<class U> struct S
20440 C::myint mi; // <-- usage point of the typedef C::myint
20445 At S<char> instantiation time, we need to check the access of C::myint
20446 In other words, we need to check the access of the myint typedef through
20447 the C scope. For that purpose, this function will add the myint typedef
20448 and the scope C through which its being accessed to a list of typedefs
20449 tied to the template S. That list will be walked at template instantiation
20450 time and access check performed on each typedefs it contains.
20451 Note that this particular code snippet should yield an error because
20452 myint is private to C. */
20455 append_type_to_template_for_access_check (tree templ
,
20458 location_t location
)
20460 qualified_typedef_usage_t
*iter
;
20463 gcc_assert (type_decl
&& (TREE_CODE (type_decl
) == TYPE_DECL
));
20465 /* Make sure we don't append the type to the template twice. */
20466 FOR_EACH_VEC_ELT (qualified_typedef_usage_t
,
20467 get_types_needing_access_check (templ
),
20469 if (iter
->typedef_decl
== type_decl
&& scope
== iter
->context
)
20472 append_type_to_template_for_access_check_1 (templ
, type_decl
,
20476 /* Set up the hash tables for template instantiations. */
20479 init_template_processing (void)
20481 decl_specializations
= htab_create_ggc (37,
20482 hash_specialization
,
20483 eq_specializations
,
20485 type_specializations
= htab_create_ggc (37,
20486 hash_specialization
,
20487 eq_specializations
,
20491 /* Print stats about the template hash tables for -fstats. */
20494 print_template_statistics (void)
20496 fprintf (stderr
, "decl_specializations: size %ld, %ld elements, "
20497 "%f collisions\n", (long) htab_size (decl_specializations
),
20498 (long) htab_elements (decl_specializations
),
20499 htab_collisions (decl_specializations
));
20500 fprintf (stderr
, "type_specializations: size %ld, %ld elements, "
20501 "%f collisions\n", (long) htab_size (type_specializations
),
20502 (long) htab_elements (type_specializations
),
20503 htab_collisions (type_specializations
));
20506 #include "gt-cp-pt.h"