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
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"
39 #include "cp-objcp-common.h"
40 #include "tree-inline.h"
47 #include "tree-iterator.h"
50 /* The type of functions taking a tree, and some additional data, and
52 typedef int (*tree_fn_t
) (tree
, void*);
54 /* The PENDING_TEMPLATES is a TREE_LIST of templates whose
55 instantiations have been deferred, either because their definitions
56 were not yet available, or because we were putting off doing the work. */
57 struct pending_template
GTY (()) {
58 struct pending_template
*next
;
59 struct tinst_level
*tinst
;
62 static GTY(()) struct pending_template
*pending_templates
;
63 static GTY(()) struct pending_template
*last_pending_template
;
65 int processing_template_parmlist
;
66 static int template_header_count
;
68 static GTY(()) tree saved_trees
;
69 static VEC(int,heap
) *inline_parm_levels
;
71 static GTY(()) struct tinst_level
*current_tinst_level
;
73 static GTY(()) tree saved_access_scope
;
75 /* Live only within one (recursive) call to tsubst_expr. We use
76 this to pass the statement expression node from the STMT_EXPR
77 to the EXPR_STMT that is its result. */
78 static tree cur_stmt_expr
;
80 /* A map from local variable declarations in the body of the template
81 presently being instantiated to the corresponding instantiated
83 static htab_t local_specializations
;
85 /* Contains canonical template parameter types. The vector is indexed by
86 the TEMPLATE_TYPE_IDX of the template parameter. Each element is a
87 TREE_LIST, whose TREE_VALUEs contain the canonical template
88 parameters of various types and levels. */
89 static GTY(()) VEC(tree
,gc
) *canonical_template_parms
;
91 #define UNIFY_ALLOW_NONE 0
92 #define UNIFY_ALLOW_MORE_CV_QUAL 1
93 #define UNIFY_ALLOW_LESS_CV_QUAL 2
94 #define UNIFY_ALLOW_DERIVED 4
95 #define UNIFY_ALLOW_INTEGER 8
96 #define UNIFY_ALLOW_OUTER_LEVEL 16
97 #define UNIFY_ALLOW_OUTER_MORE_CV_QUAL 32
98 #define UNIFY_ALLOW_OUTER_LESS_CV_QUAL 64
100 static void push_access_scope (tree
);
101 static void pop_access_scope (tree
);
102 static bool resolve_overloaded_unification (tree
, tree
, tree
, tree
,
103 unification_kind_t
, int);
104 static int try_one_overload (tree
, tree
, tree
, tree
, tree
,
105 unification_kind_t
, int, bool);
106 static int unify (tree
, tree
, tree
, tree
, int);
107 static void add_pending_template (tree
);
108 static int push_tinst_level (tree
);
109 static void pop_tinst_level (void);
110 static tree
reopen_tinst_level (struct tinst_level
*);
111 static tree
tsubst_initializer_list (tree
, tree
);
112 static tree
get_class_bindings (tree
, tree
, tree
);
113 static tree
coerce_template_parms (tree
, tree
, tree
, tsubst_flags_t
,
115 static void tsubst_enum (tree
, tree
, tree
);
116 static tree
add_to_template_args (tree
, tree
);
117 static tree
add_outermost_template_args (tree
, tree
);
118 static bool check_instantiated_args (tree
, tree
, tsubst_flags_t
);
119 static int maybe_adjust_types_for_deduction (unification_kind_t
, tree
*, tree
*,
121 static int type_unification_real (tree
, tree
, tree
, tree
,
122 int, unification_kind_t
, int);
123 static void note_template_header (int);
124 static tree
convert_nontype_argument_function (tree
, tree
);
125 static tree
convert_nontype_argument (tree
, tree
);
126 static tree
convert_template_argument (tree
, tree
, tree
,
127 tsubst_flags_t
, int, tree
);
128 static int for_each_template_parm (tree
, tree_fn_t
, void*,
129 struct pointer_set_t
*, bool);
130 static tree
expand_template_argument_pack (tree
);
131 static tree
build_template_parm_index (int, int, int, tree
, tree
);
132 static bool inline_needs_template_parms (tree
);
133 static void push_inline_template_parms_recursive (tree
, int);
134 static tree
retrieve_local_specialization (tree
);
135 static void register_local_specialization (tree
, tree
);
136 static tree
reduce_template_parm_level (tree
, tree
, int, tree
, tsubst_flags_t
);
137 static int mark_template_parm (tree
, void *);
138 static int template_parm_this_level_p (tree
, void *);
139 static tree
tsubst_friend_function (tree
, tree
);
140 static tree
tsubst_friend_class (tree
, tree
);
141 static int can_complete_type_without_circularity (tree
);
142 static tree
get_bindings (tree
, tree
, tree
, bool);
143 static int template_decl_level (tree
);
144 static int check_cv_quals_for_unify (int, tree
, tree
);
145 static void template_parm_level_and_index (tree
, int*, int*);
146 static int unify_pack_expansion (tree
, tree
, tree
, tree
, int, bool, bool);
147 static tree
tsubst_template_arg (tree
, tree
, tsubst_flags_t
, tree
);
148 static tree
tsubst_template_args (tree
, tree
, tsubst_flags_t
, tree
);
149 static tree
tsubst_template_parms (tree
, tree
, tsubst_flags_t
);
150 static void regenerate_decl_from_template (tree
, tree
);
151 static tree
most_specialized_class (tree
, tree
);
152 static tree
tsubst_aggr_type (tree
, tree
, tsubst_flags_t
, tree
, int);
153 static tree
tsubst_arg_types (tree
, tree
, tsubst_flags_t
, tree
);
154 static tree
tsubst_function_type (tree
, tree
, tsubst_flags_t
, tree
);
155 static bool check_specialization_scope (void);
156 static tree
process_partial_specialization (tree
);
157 static void set_current_access_from_decl (tree
);
158 static tree
get_template_base (tree
, tree
, tree
, tree
);
159 static tree
try_class_unification (tree
, tree
, tree
, tree
);
160 static int coerce_template_template_parms (tree
, tree
, tsubst_flags_t
,
162 static bool template_template_parm_bindings_ok_p (tree
, tree
);
163 static int template_args_equal (tree
, tree
);
164 static void tsubst_default_arguments (tree
);
165 static tree
for_each_template_parm_r (tree
*, int *, void *);
166 static tree
copy_default_args_to_explicit_spec_1 (tree
, tree
);
167 static void copy_default_args_to_explicit_spec (tree
);
168 static int invalid_nontype_parm_type_p (tree
, tsubst_flags_t
);
169 static int eq_local_specializations (const void *, const void *);
170 static bool dependent_template_arg_p (tree
);
171 static bool any_template_arguments_need_structural_equality_p (tree
);
172 static bool dependent_type_p_r (tree
);
173 static tree
tsubst (tree
, tree
, tsubst_flags_t
, tree
);
174 static tree
tsubst_expr (tree
, tree
, tsubst_flags_t
, tree
, bool);
175 static tree
tsubst_copy (tree
, tree
, tsubst_flags_t
, tree
);
176 static tree
tsubst_pack_expansion (tree
, tree
, tsubst_flags_t
, tree
);
178 /* Make the current scope suitable for access checking when we are
179 processing T. T can be FUNCTION_DECL for instantiated function
180 template, or VAR_DECL for static member variable (need by
181 instantiate_decl). */
184 push_access_scope (tree t
)
186 gcc_assert (TREE_CODE (t
) == FUNCTION_DECL
187 || TREE_CODE (t
) == VAR_DECL
);
189 if (DECL_FRIEND_CONTEXT (t
))
190 push_nested_class (DECL_FRIEND_CONTEXT (t
));
191 else if (DECL_CLASS_SCOPE_P (t
))
192 push_nested_class (DECL_CONTEXT (t
));
194 push_to_top_level ();
196 if (TREE_CODE (t
) == FUNCTION_DECL
)
198 saved_access_scope
= tree_cons
199 (NULL_TREE
, current_function_decl
, saved_access_scope
);
200 current_function_decl
= t
;
204 /* Restore the scope set up by push_access_scope. T is the node we
208 pop_access_scope (tree t
)
210 if (TREE_CODE (t
) == FUNCTION_DECL
)
212 current_function_decl
= TREE_VALUE (saved_access_scope
);
213 saved_access_scope
= TREE_CHAIN (saved_access_scope
);
216 if (DECL_FRIEND_CONTEXT (t
) || DECL_CLASS_SCOPE_P (t
))
219 pop_from_top_level ();
222 /* Do any processing required when DECL (a member template
223 declaration) is finished. Returns the TEMPLATE_DECL corresponding
224 to DECL, unless it is a specialization, in which case the DECL
225 itself is returned. */
228 finish_member_template_decl (tree decl
)
230 if (decl
== error_mark_node
)
231 return error_mark_node
;
233 gcc_assert (DECL_P (decl
));
235 if (TREE_CODE (decl
) == TYPE_DECL
)
239 type
= TREE_TYPE (decl
);
240 if (type
== error_mark_node
)
241 return error_mark_node
;
242 if (MAYBE_CLASS_TYPE_P (type
)
243 && CLASSTYPE_TEMPLATE_INFO (type
)
244 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
246 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
247 check_member_template (tmpl
);
252 else if (TREE_CODE (decl
) == FIELD_DECL
)
253 error ("data member %qD cannot be a member template", decl
);
254 else if (DECL_TEMPLATE_INFO (decl
))
256 if (!DECL_TEMPLATE_SPECIALIZATION (decl
))
258 check_member_template (DECL_TI_TEMPLATE (decl
));
259 return DECL_TI_TEMPLATE (decl
);
265 error ("invalid member template declaration %qD", decl
);
267 return error_mark_node
;
270 /* Return the template info node corresponding to T, whatever T is. */
273 get_template_info (tree t
)
275 tree tinfo
= NULL_TREE
;
277 if (DECL_P (t
) && DECL_LANG_SPECIFIC (t
))
278 tinfo
= DECL_TEMPLATE_INFO (t
);
280 if (!tinfo
&& TREE_CODE (t
) == TYPE_DECL
)
283 if (TAGGED_TYPE_P (t
))
284 tinfo
= TYPE_TEMPLATE_INFO (t
);
289 /* Returns the template nesting level of the indicated class TYPE.
299 A<T>::B<U> has depth two, while A<T> has depth one.
300 Both A<T>::B<int> and A<int>::B<U> have depth one, if
301 they are instantiations, not specializations.
303 This function is guaranteed to return 0 if passed NULL_TREE so
304 that, for example, `template_class_depth (current_class_type)' is
308 template_class_depth (tree type
)
313 type
&& TREE_CODE (type
) != NAMESPACE_DECL
;
314 type
= (TREE_CODE (type
) == FUNCTION_DECL
)
315 ? CP_DECL_CONTEXT (type
) : TYPE_CONTEXT (type
))
317 tree tinfo
= get_template_info (type
);
319 if (tinfo
&& PRIMARY_TEMPLATE_P (TI_TEMPLATE (tinfo
))
320 && uses_template_parms (INNERMOST_TEMPLATE_ARGS (TI_ARGS (tinfo
))))
327 /* Subroutine of maybe_begin_member_template_processing.
328 Returns true if processing DECL needs us to push template parms. */
331 inline_needs_template_parms (tree decl
)
333 if (! DECL_TEMPLATE_INFO (decl
))
336 return (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (most_general_template (decl
)))
337 > (processing_template_decl
+ DECL_TEMPLATE_SPECIALIZATION (decl
)));
340 /* Subroutine of maybe_begin_member_template_processing.
341 Push the template parms in PARMS, starting from LEVELS steps into the
342 chain, and ending at the beginning, since template parms are listed
346 push_inline_template_parms_recursive (tree parmlist
, int levels
)
348 tree parms
= TREE_VALUE (parmlist
);
352 push_inline_template_parms_recursive (TREE_CHAIN (parmlist
), levels
- 1);
354 ++processing_template_decl
;
355 current_template_parms
356 = tree_cons (size_int (processing_template_decl
),
357 parms
, current_template_parms
);
358 TEMPLATE_PARMS_FOR_INLINE (current_template_parms
) = 1;
360 begin_scope (TREE_VEC_LENGTH (parms
) ? sk_template_parms
: sk_template_spec
,
362 for (i
= 0; i
< TREE_VEC_LENGTH (parms
); ++i
)
364 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
366 if (parm
== error_mark_node
)
369 gcc_assert (DECL_P (parm
));
371 switch (TREE_CODE (parm
))
380 /* Make a CONST_DECL as is done in process_template_parm.
381 It is ugly that we recreate this here; the original
382 version built in process_template_parm is no longer
384 tree decl
= build_decl (CONST_DECL
, DECL_NAME (parm
),
386 DECL_ARTIFICIAL (decl
) = 1;
387 TREE_CONSTANT (decl
) = 1;
388 TREE_READONLY (decl
) = 1;
389 DECL_INITIAL (decl
) = DECL_INITIAL (parm
);
390 SET_DECL_TEMPLATE_PARM_P (decl
);
401 /* Restore the template parameter context for a member template or
402 a friend template defined in a class definition. */
405 maybe_begin_member_template_processing (tree decl
)
410 if (inline_needs_template_parms (decl
))
412 parms
= DECL_TEMPLATE_PARMS (most_general_template (decl
));
413 levels
= TMPL_PARMS_DEPTH (parms
) - processing_template_decl
;
415 if (DECL_TEMPLATE_SPECIALIZATION (decl
))
418 parms
= TREE_CHAIN (parms
);
421 push_inline_template_parms_recursive (parms
, levels
);
424 /* Remember how many levels of template parameters we pushed so that
425 we can pop them later. */
426 VEC_safe_push (int, heap
, inline_parm_levels
, levels
);
429 /* Undo the effects of maybe_begin_member_template_processing. */
432 maybe_end_member_template_processing (void)
437 if (VEC_length (int, inline_parm_levels
) == 0)
440 last
= VEC_pop (int, inline_parm_levels
);
441 for (i
= 0; i
< last
; ++i
)
443 --processing_template_decl
;
444 current_template_parms
= TREE_CHAIN (current_template_parms
);
449 /* Return a new template argument vector which contains all of ARGS,
450 but has as its innermost set of arguments the EXTRA_ARGS. */
453 add_to_template_args (tree args
, tree extra_args
)
460 extra_depth
= TMPL_ARGS_DEPTH (extra_args
);
461 new_args
= make_tree_vec (TMPL_ARGS_DEPTH (args
) + extra_depth
);
463 for (i
= 1; i
<= TMPL_ARGS_DEPTH (args
); ++i
)
464 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (args
, i
));
466 for (j
= 1; j
<= extra_depth
; ++j
, ++i
)
467 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (extra_args
, j
));
472 /* Like add_to_template_args, but only the outermost ARGS are added to
473 the EXTRA_ARGS. In particular, all but TMPL_ARGS_DEPTH
474 (EXTRA_ARGS) levels are added. This function is used to combine
475 the template arguments from a partial instantiation with the
476 template arguments used to attain the full instantiation from the
477 partial instantiation. */
480 add_outermost_template_args (tree args
, tree extra_args
)
484 /* If there are more levels of EXTRA_ARGS than there are ARGS,
485 something very fishy is going on. */
486 gcc_assert (TMPL_ARGS_DEPTH (args
) >= TMPL_ARGS_DEPTH (extra_args
));
488 /* If *all* the new arguments will be the EXTRA_ARGS, just return
490 if (TMPL_ARGS_DEPTH (args
) == TMPL_ARGS_DEPTH (extra_args
))
493 /* For the moment, we make ARGS look like it contains fewer levels. */
494 TREE_VEC_LENGTH (args
) -= TMPL_ARGS_DEPTH (extra_args
);
496 new_args
= add_to_template_args (args
, extra_args
);
498 /* Now, we restore ARGS to its full dimensions. */
499 TREE_VEC_LENGTH (args
) += TMPL_ARGS_DEPTH (extra_args
);
504 /* Return the N levels of innermost template arguments from the ARGS. */
507 get_innermost_template_args (tree args
, int n
)
515 /* If N is 1, just return the innermost set of template arguments. */
517 return TMPL_ARGS_LEVEL (args
, TMPL_ARGS_DEPTH (args
));
519 /* If we're not removing anything, just return the arguments we were
521 extra_levels
= TMPL_ARGS_DEPTH (args
) - n
;
522 gcc_assert (extra_levels
>= 0);
523 if (extra_levels
== 0)
526 /* Make a new set of arguments, not containing the outer arguments. */
527 new_args
= make_tree_vec (n
);
528 for (i
= 1; i
<= n
; ++i
)
529 SET_TMPL_ARGS_LEVEL (new_args
, i
,
530 TMPL_ARGS_LEVEL (args
, i
+ extra_levels
));
535 /* The inverse of get_innermost_template_args: Return all but the innermost
536 EXTRA_LEVELS levels of template arguments from the ARGS. */
539 strip_innermost_template_args (tree args
, int extra_levels
)
542 int n
= TMPL_ARGS_DEPTH (args
) - extra_levels
;
547 /* If N is 1, just return the outermost set of template arguments. */
549 return TMPL_ARGS_LEVEL (args
, 1);
551 /* If we're not removing anything, just return the arguments we were
553 gcc_assert (extra_levels
>= 0);
554 if (extra_levels
== 0)
557 /* Make a new set of arguments, not containing the inner arguments. */
558 new_args
= make_tree_vec (n
);
559 for (i
= 1; i
<= n
; ++i
)
560 SET_TMPL_ARGS_LEVEL (new_args
, i
,
561 TMPL_ARGS_LEVEL (args
, i
));
566 /* We've got a template header coming up; push to a new level for storing
570 begin_template_parm_list (void)
572 /* We use a non-tag-transparent scope here, which causes pushtag to
573 put tags in this scope, rather than in the enclosing class or
574 namespace scope. This is the right thing, since we want
575 TEMPLATE_DECLS, and not TYPE_DECLS for template classes. For a
576 global template class, push_template_decl handles putting the
577 TEMPLATE_DECL into top-level scope. For a nested template class,
580 template <class T> struct S1 {
581 template <class T> struct S2 {};
584 pushtag contains special code to call pushdecl_with_scope on the
585 TEMPLATE_DECL for S2. */
586 begin_scope (sk_template_parms
, NULL
);
587 ++processing_template_decl
;
588 ++processing_template_parmlist
;
589 note_template_header (0);
592 /* This routine is called when a specialization is declared. If it is
593 invalid to declare a specialization here, an error is reported and
594 false is returned, otherwise this routine will return true. */
597 check_specialization_scope (void)
599 tree scope
= current_scope ();
603 An explicit specialization shall be declared in the namespace of
604 which the template is a member, or, for member templates, in the
605 namespace of which the enclosing class or enclosing class
606 template is a member. An explicit specialization of a member
607 function, member class or static data member of a class template
608 shall be declared in the namespace of which the class template
610 if (scope
&& TREE_CODE (scope
) != NAMESPACE_DECL
)
612 error ("explicit specialization in non-namespace scope %qD", scope
);
618 In an explicit specialization declaration for a member of a class
619 template or a member template that appears in namespace scope,
620 the member template and some of its enclosing class templates may
621 remain unspecialized, except that the declaration shall not
622 explicitly specialize a class member template if its enclosing
623 class templates are not explicitly specialized as well. */
624 if (current_template_parms
)
626 error ("enclosing class templates are not explicitly specialized");
633 /* We've just seen template <>. */
636 begin_specialization (void)
638 begin_scope (sk_template_spec
, NULL
);
639 note_template_header (1);
640 return check_specialization_scope ();
643 /* Called at then end of processing a declaration preceded by
647 end_specialization (void)
650 reset_specialization ();
653 /* Any template <>'s that we have seen thus far are not referring to a
654 function specialization. */
657 reset_specialization (void)
659 processing_specialization
= 0;
660 template_header_count
= 0;
663 /* We've just seen a template header. If SPECIALIZATION is nonzero,
664 it was of the form template <>. */
667 note_template_header (int specialization
)
669 processing_specialization
= specialization
;
670 template_header_count
++;
673 /* We're beginning an explicit instantiation. */
676 begin_explicit_instantiation (void)
678 gcc_assert (!processing_explicit_instantiation
);
679 processing_explicit_instantiation
= true;
684 end_explicit_instantiation (void)
686 gcc_assert (processing_explicit_instantiation
);
687 processing_explicit_instantiation
= false;
690 /* An explicit specialization or partial specialization TMPL is being
691 declared. Check that the namespace in which the specialization is
692 occurring is permissible. Returns false iff it is invalid to
693 specialize TMPL in the current namespace. */
696 check_specialization_namespace (tree tmpl
)
698 tree tpl_ns
= decl_namespace_context (tmpl
);
702 An explicit specialization shall be declared in the namespace of
703 which the template is a member, or, for member templates, in the
704 namespace of which the enclosing class or enclosing class
705 template is a member. An explicit specialization of a member
706 function, member class or static data member of a class template
707 shall be declared in the namespace of which the class template is
709 if (is_associated_namespace (current_namespace
, tpl_ns
))
710 /* Same or super-using namespace. */
714 permerror (input_location
, "specialization of %qD in different namespace", tmpl
);
715 permerror (input_location
, " from definition of %q+#D", tmpl
);
720 /* SPEC is an explicit instantiation. Check that it is valid to
721 perform this explicit instantiation in the current namespace. */
724 check_explicit_instantiation_namespace (tree spec
)
728 /* DR 275: An explicit instantiation shall appear in an enclosing
729 namespace of its template. */
730 ns
= decl_namespace_context (spec
);
731 if (!is_ancestor (current_namespace
, ns
))
732 permerror (input_location
, "explicit instantiation of %qD in namespace %qD "
733 "(which does not enclose namespace %qD)",
734 spec
, current_namespace
, ns
);
737 /* The TYPE is being declared. If it is a template type, that means it
738 is a partial specialization. Do appropriate error-checking. */
741 maybe_process_partial_specialization (tree type
)
745 if (type
== error_mark_node
)
746 return error_mark_node
;
748 if (TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
750 error ("name of class shadows template template parameter %qD",
752 return error_mark_node
;
755 context
= TYPE_CONTEXT (type
);
757 if (CLASS_TYPE_P (type
) && CLASSTYPE_USE_TEMPLATE (type
))
759 /* This is for ordinary explicit specialization and partial
760 specialization of a template class such as:
762 template <> class C<int>;
766 template <class T> class C<T*>;
768 Make sure that `C<int>' and `C<T*>' are implicit instantiations. */
770 if (CLASSTYPE_IMPLICIT_INSTANTIATION (type
)
771 && !COMPLETE_TYPE_P (type
))
773 check_specialization_namespace (CLASSTYPE_TI_TEMPLATE (type
));
774 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type
);
775 if (processing_template_decl
)
777 if (push_template_decl (TYPE_MAIN_DECL (type
))
779 return error_mark_node
;
782 else if (CLASSTYPE_TEMPLATE_INSTANTIATION (type
))
783 error ("specialization of %qT after instantiation", type
);
785 else if (CLASS_TYPE_P (type
)
786 && !CLASSTYPE_USE_TEMPLATE (type
)
787 && CLASSTYPE_TEMPLATE_INFO (type
)
788 && context
&& CLASS_TYPE_P (context
)
789 && CLASSTYPE_TEMPLATE_INFO (context
))
791 /* This is for an explicit specialization of member class
792 template according to [temp.expl.spec/18]:
794 template <> template <class U> class C<int>::D;
796 The context `C<int>' must be an implicit instantiation.
797 Otherwise this is just a member class template declared
800 template <> class C<int> { template <class U> class D; };
801 template <> template <class U> class C<int>::D;
803 In the first case, `C<int>::D' is a specialization of `C<T>::D'
804 while in the second case, `C<int>::D' is a primary template
805 and `C<T>::D' may not exist. */
807 if (CLASSTYPE_IMPLICIT_INSTANTIATION (context
)
808 && !COMPLETE_TYPE_P (type
))
812 if (current_namespace
813 != decl_namespace_context (CLASSTYPE_TI_TEMPLATE (type
)))
815 permerror (input_location
, "specializing %q#T in different namespace", type
);
816 permerror (input_location
, " from definition of %q+#D",
817 CLASSTYPE_TI_TEMPLATE (type
));
820 /* Check for invalid specialization after instantiation:
822 template <> template <> class C<int>::D<int>;
823 template <> template <class U> class C<int>::D; */
825 for (t
= DECL_TEMPLATE_INSTANTIATIONS
826 (most_general_template (CLASSTYPE_TI_TEMPLATE (type
)));
827 t
; t
= TREE_CHAIN (t
))
828 if (TREE_VALUE (t
) != type
829 && TYPE_CONTEXT (TREE_VALUE (t
)) == context
)
830 error ("specialization %qT after instantiation %qT",
831 type
, TREE_VALUE (t
));
833 /* Mark TYPE as a specialization. And as a result, we only
834 have one level of template argument for the innermost
836 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type
);
837 CLASSTYPE_TI_ARGS (type
)
838 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type
));
841 else if (processing_specialization
)
843 error ("explicit specialization of non-template %qT", type
);
844 return error_mark_node
;
850 /* Returns nonzero if we can optimize the retrieval of specializations
851 for TMPL, a TEMPLATE_DECL. In particular, for such a template, we
852 do not use DECL_TEMPLATE_SPECIALIZATIONS at all. */
855 optimize_specialization_lookup_p (tree tmpl
)
857 return (DECL_FUNCTION_TEMPLATE_P (tmpl
)
858 && DECL_CLASS_SCOPE_P (tmpl
)
859 /* DECL_CLASS_SCOPE_P holds of T::f even if T is a template
861 && CLASS_TYPE_P (DECL_CONTEXT (tmpl
))
862 /* The optimized lookup depends on the fact that the
863 template arguments for the member function template apply
864 purely to the containing class, which is not true if the
865 containing class is an explicit or partial
867 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (tmpl
))
868 && !DECL_MEMBER_TEMPLATE_P (tmpl
)
869 && !DECL_CONV_FN_P (tmpl
)
870 /* It is possible to have a template that is not a member
871 template and is not a member of a template class:
873 template <typename T>
874 struct S { friend A::f(); };
876 Here, the friend function is a template, but the context does
877 not have template information. The optimized lookup relies
878 on having ARGS be the template arguments for both the class
879 and the function template. */
880 && !DECL_FRIEND_P (DECL_TEMPLATE_RESULT (tmpl
)));
883 /* Retrieve the specialization (in the sense of [temp.spec] - a
884 specialization is either an instantiation or an explicit
885 specialization) of TMPL for the given template ARGS. If there is
886 no such specialization, return NULL_TREE. The ARGS are a vector of
887 arguments, or a vector of vectors of arguments, in the case of
888 templates with more than one level of parameters.
890 If TMPL is a type template and CLASS_SPECIALIZATIONS_P is true,
891 then we search for a partial specialization matching ARGS. This
892 parameter is ignored if TMPL is not a class template. */
895 retrieve_specialization (tree tmpl
, tree args
,
896 bool class_specializations_p
)
898 if (args
== error_mark_node
)
901 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
);
903 /* There should be as many levels of arguments as there are
904 levels of parameters. */
905 gcc_assert (TMPL_ARGS_DEPTH (args
)
906 == TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
)));
908 if (optimize_specialization_lookup_p (tmpl
))
911 tree class_specialization
;
912 VEC(tree
,gc
) *methods
;
916 /* The template arguments actually apply to the containing
917 class. Find the class specialization with those
919 class_template
= CLASSTYPE_TI_TEMPLATE (DECL_CONTEXT (tmpl
));
921 = retrieve_specialization (class_template
, args
,
922 /*class_specializations_p=*/false);
923 if (!class_specialization
)
925 /* Now, find the appropriate entry in the CLASSTYPE_METHOD_VEC
926 for the specialization. */
927 idx
= class_method_index_for_fn (class_specialization
, tmpl
);
930 /* Iterate through the methods with the indicated name, looking
931 for the one that has an instance of TMPL. */
932 methods
= CLASSTYPE_METHOD_VEC (class_specialization
);
933 for (fns
= VEC_index (tree
, methods
, idx
); fns
; fns
= OVL_NEXT (fns
))
935 tree fn
= OVL_CURRENT (fns
);
936 if (DECL_TEMPLATE_INFO (fn
) && DECL_TI_TEMPLATE (fn
) == tmpl
)
946 /* Class templates store their instantiations on the
947 DECL_TEMPLATE_INSTANTIATIONS list; other templates use the
948 DECL_TEMPLATE_SPECIALIZATIONS list. */
949 if (!class_specializations_p
950 && TREE_CODE (DECL_TEMPLATE_RESULT (tmpl
)) == TYPE_DECL
951 && TAGGED_TYPE_P (TREE_TYPE (tmpl
)))
952 sp
= &DECL_TEMPLATE_INSTANTIATIONS (tmpl
);
954 sp
= &DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
956 /* Iterate through the list until we find a matching template. */
957 while (*sp
!= NULL_TREE
)
961 if (comp_template_args (TREE_PURPOSE (spec
), args
))
963 /* Use the move-to-front heuristic to speed up future
967 *sp
= TREE_CHAIN (*sp
);
968 TREE_CHAIN (spec
) = *head
;
971 return TREE_VALUE (spec
);
973 sp
= &TREE_CHAIN (spec
);
980 /* Like retrieve_specialization, but for local declarations. */
983 retrieve_local_specialization (tree tmpl
)
987 if (local_specializations
== NULL
)
990 spec
= (tree
) htab_find_with_hash (local_specializations
, tmpl
,
991 htab_hash_pointer (tmpl
));
992 return spec
? TREE_PURPOSE (spec
) : NULL_TREE
;
995 /* Returns nonzero iff DECL is a specialization of TMPL. */
998 is_specialization_of (tree decl
, tree tmpl
)
1002 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1006 t
= DECL_TEMPLATE_INFO (t
) ? DECL_TI_TEMPLATE (t
) : NULL_TREE
)
1012 gcc_assert (TREE_CODE (decl
) == TYPE_DECL
);
1014 for (t
= TREE_TYPE (decl
);
1016 t
= CLASSTYPE_USE_TEMPLATE (t
)
1017 ? TREE_TYPE (CLASSTYPE_TI_TEMPLATE (t
)) : NULL_TREE
)
1018 if (same_type_ignoring_top_level_qualifiers_p (t
, TREE_TYPE (tmpl
)))
1025 /* Returns nonzero iff DECL is a specialization of friend declaration
1026 FRIEND_DECL according to [temp.friend]. */
1029 is_specialization_of_friend (tree decl
, tree friend_decl
)
1031 bool need_template
= true;
1034 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
1035 || TREE_CODE (decl
) == TYPE_DECL
);
1037 /* For [temp.friend/6] when FRIEND_DECL is an ordinary member function
1038 of a template class, we want to check if DECL is a specialization
1040 if (TREE_CODE (friend_decl
) == FUNCTION_DECL
1041 && DECL_TEMPLATE_INFO (friend_decl
)
1042 && !DECL_USE_TEMPLATE (friend_decl
))
1044 /* We want a TEMPLATE_DECL for `is_specialization_of'. */
1045 friend_decl
= DECL_TI_TEMPLATE (friend_decl
);
1046 need_template
= false;
1048 else if (TREE_CODE (friend_decl
) == TEMPLATE_DECL
1049 && !PRIMARY_TEMPLATE_P (friend_decl
))
1050 need_template
= false;
1052 /* There is nothing to do if this is not a template friend. */
1053 if (TREE_CODE (friend_decl
) != TEMPLATE_DECL
)
1056 if (is_specialization_of (decl
, friend_decl
))
1060 A member of a class template may be declared to be a friend of a
1061 non-template class. In this case, the corresponding member of
1062 every specialization of the class template is a friend of the
1063 class granting friendship.
1065 For example, given a template friend declaration
1067 template <class T> friend void A<T>::f();
1069 the member function below is considered a friend
1071 template <> struct A<int> {
1075 For this type of template friend, TEMPLATE_DEPTH below will be
1076 nonzero. To determine if DECL is a friend of FRIEND, we first
1077 check if the enclosing class is a specialization of another. */
1079 template_depth
= template_class_depth (DECL_CONTEXT (friend_decl
));
1081 && DECL_CLASS_SCOPE_P (decl
)
1082 && is_specialization_of (TYPE_NAME (DECL_CONTEXT (decl
)),
1083 CLASSTYPE_TI_TEMPLATE (DECL_CONTEXT (friend_decl
))))
1085 /* Next, we check the members themselves. In order to handle
1086 a few tricky cases, such as when FRIEND_DECL's are
1088 template <class T> friend void A<T>::g(T t);
1089 template <class T> template <T t> friend void A<T>::h();
1093 void A<int>::g(int);
1094 template <int> void A<int>::h();
1096 we need to figure out ARGS, the template arguments from
1097 the context of DECL. This is required for template substitution
1098 of `T' in the function parameter of `g' and template parameter
1099 of `h' in the above examples. Here ARGS corresponds to `int'. */
1101 tree context
= DECL_CONTEXT (decl
);
1102 tree args
= NULL_TREE
;
1103 int current_depth
= 0;
1105 while (current_depth
< template_depth
)
1107 if (CLASSTYPE_TEMPLATE_INFO (context
))
1109 if (current_depth
== 0)
1110 args
= TYPE_TI_ARGS (context
);
1112 args
= add_to_template_args (TYPE_TI_ARGS (context
), args
);
1115 context
= TYPE_CONTEXT (context
);
1118 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1123 tree friend_args_type
;
1124 tree decl_args_type
;
1126 /* Make sure that both DECL and FRIEND_DECL are templates or
1128 is_template
= DECL_TEMPLATE_INFO (decl
)
1129 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl
));
1130 if (need_template
^ is_template
)
1132 else if (is_template
)
1134 /* If both are templates, check template parameter list. */
1136 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_decl
),
1138 if (!comp_template_parms
1139 (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (decl
)),
1143 decl_type
= TREE_TYPE (DECL_TI_TEMPLATE (decl
));
1146 decl_type
= TREE_TYPE (decl
);
1148 friend_type
= tsubst_function_type (TREE_TYPE (friend_decl
), args
,
1149 tf_none
, NULL_TREE
);
1150 if (friend_type
== error_mark_node
)
1153 /* Check if return types match. */
1154 if (!same_type_p (TREE_TYPE (decl_type
), TREE_TYPE (friend_type
)))
1157 /* Check if function parameter types match, ignoring the
1158 `this' parameter. */
1159 friend_args_type
= TYPE_ARG_TYPES (friend_type
);
1160 decl_args_type
= TYPE_ARG_TYPES (decl_type
);
1161 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (friend_decl
))
1162 friend_args_type
= TREE_CHAIN (friend_args_type
);
1163 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1164 decl_args_type
= TREE_CHAIN (decl_args_type
);
1166 return compparms (decl_args_type
, friend_args_type
);
1170 /* DECL is a TYPE_DECL */
1172 tree decl_type
= TREE_TYPE (decl
);
1174 /* Make sure that both DECL and FRIEND_DECL are templates or
1177 = CLASSTYPE_TEMPLATE_INFO (decl_type
)
1178 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (decl_type
));
1180 if (need_template
^ is_template
)
1182 else if (is_template
)
1185 /* If both are templates, check the name of the two
1186 TEMPLATE_DECL's first because is_friend didn't. */
1187 if (DECL_NAME (CLASSTYPE_TI_TEMPLATE (decl_type
))
1188 != DECL_NAME (friend_decl
))
1191 /* Now check template parameter list. */
1193 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_decl
),
1195 return comp_template_parms
1196 (DECL_TEMPLATE_PARMS (CLASSTYPE_TI_TEMPLATE (decl_type
)),
1200 return (DECL_NAME (decl
)
1201 == DECL_NAME (friend_decl
));
1207 /* Register the specialization SPEC as a specialization of TMPL with
1208 the indicated ARGS. IS_FRIEND indicates whether the specialization
1209 is actually just a friend declaration. Returns SPEC, or an
1210 equivalent prior declaration, if available. */
1213 register_specialization (tree spec
, tree tmpl
, tree args
, bool is_friend
)
1217 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
);
1219 if (TREE_CODE (spec
) == FUNCTION_DECL
1220 && uses_template_parms (DECL_TI_ARGS (spec
)))
1221 /* This is the FUNCTION_DECL for a partial instantiation. Don't
1222 register it; we want the corresponding TEMPLATE_DECL instead.
1223 We use `uses_template_parms (DECL_TI_ARGS (spec))' rather than
1224 the more obvious `uses_template_parms (spec)' to avoid problems
1225 with default function arguments. In particular, given
1226 something like this:
1228 template <class T> void f(T t1, T t = T())
1230 the default argument expression is not substituted for in an
1231 instantiation unless and until it is actually needed. */
1234 fn
= retrieve_specialization (tmpl
, args
,
1235 /*class_specializations_p=*/false);
1236 /* We can sometimes try to re-register a specialization that we've
1237 already got. In particular, regenerate_decl_from_template calls
1238 duplicate_decls which will update the specialization list. But,
1239 we'll still get called again here anyhow. It's more convenient
1240 to simply allow this than to try to prevent it. */
1243 else if (fn
&& DECL_TEMPLATE_SPECIALIZATION (spec
))
1245 if (DECL_TEMPLATE_INSTANTIATION (fn
))
1248 || DECL_EXPLICIT_INSTANTIATION (fn
))
1250 error ("specialization of %qD after instantiation",
1252 return error_mark_node
;
1257 /* This situation should occur only if the first
1258 specialization is an implicit instantiation, the
1259 second is an explicit specialization, and the
1260 implicit instantiation has not yet been used. That
1261 situation can occur if we have implicitly
1262 instantiated a member function and then specialized
1265 We can also wind up here if a friend declaration that
1266 looked like an instantiation turns out to be a
1269 template <class T> void foo(T);
1270 class S { friend void foo<>(int) };
1271 template <> void foo(int);
1273 We transform the existing DECL in place so that any
1274 pointers to it become pointers to the updated
1277 If there was a definition for the template, but not
1278 for the specialization, we want this to look as if
1279 there were no definition, and vice versa. */
1280 DECL_INITIAL (fn
) = NULL_TREE
;
1281 duplicate_decls (spec
, fn
, is_friend
);
1282 /* The call to duplicate_decls will have applied
1285 An explicit specialization of a function template
1286 is inline only if it is explicitly declared to be,
1287 and independently of whether its function template
1290 to the primary function; now copy the inline bits to
1291 the various clones. */
1292 FOR_EACH_CLONE (clone
, fn
)
1293 DECL_DECLARED_INLINE_P (clone
)
1294 = DECL_DECLARED_INLINE_P (fn
);
1295 check_specialization_namespace (fn
);
1300 else if (DECL_TEMPLATE_SPECIALIZATION (fn
))
1302 if (!duplicate_decls (spec
, fn
, is_friend
) && DECL_INITIAL (spec
))
1303 /* Dup decl failed, but this is a new definition. Set the
1304 line number so any errors match this new
1306 DECL_SOURCE_LOCATION (fn
) = DECL_SOURCE_LOCATION (spec
);
1312 /* A specialization must be declared in the same namespace as the
1313 template it is specializing. */
1314 if (DECL_TEMPLATE_SPECIALIZATION (spec
)
1315 && !check_specialization_namespace (tmpl
))
1316 DECL_CONTEXT (spec
) = FROB_CONTEXT (decl_namespace_context (tmpl
));
1318 if (!optimize_specialization_lookup_p (tmpl
))
1319 DECL_TEMPLATE_SPECIALIZATIONS (tmpl
)
1320 = tree_cons (args
, spec
, DECL_TEMPLATE_SPECIALIZATIONS (tmpl
));
1325 /* Unregister the specialization SPEC as a specialization of TMPL.
1326 Replace it with NEW_SPEC, if NEW_SPEC is non-NULL. Returns true
1327 if the SPEC was listed as a specialization of TMPL. */
1330 reregister_specialization (tree spec
, tree tmpl
, tree new_spec
)
1334 for (s
= &DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
1336 s
= &TREE_CHAIN (*s
))
1337 if (TREE_VALUE (*s
) == spec
)
1340 *s
= TREE_CHAIN (*s
);
1342 TREE_VALUE (*s
) = new_spec
;
1349 /* Compare an entry in the local specializations hash table P1 (which
1350 is really a pointer to a TREE_LIST) with P2 (which is really a
1354 eq_local_specializations (const void *p1
, const void *p2
)
1356 return TREE_VALUE ((const_tree
) p1
) == (const_tree
) p2
;
1359 /* Hash P1, an entry in the local specializations table. */
1362 hash_local_specialization (const void* p1
)
1364 return htab_hash_pointer (TREE_VALUE ((const_tree
) p1
));
1367 /* Like register_specialization, but for local declarations. We are
1368 registering SPEC, an instantiation of TMPL. */
1371 register_local_specialization (tree spec
, tree tmpl
)
1375 slot
= htab_find_slot_with_hash (local_specializations
, tmpl
,
1376 htab_hash_pointer (tmpl
), INSERT
);
1377 *slot
= build_tree_list (spec
, tmpl
);
1380 /* TYPE is a class type. Returns true if TYPE is an explicitly
1381 specialized class. */
1384 explicit_class_specialization_p (tree type
)
1386 if (!CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
1388 return !uses_template_parms (CLASSTYPE_TI_ARGS (type
));
1391 /* Print the list of candidate FNS in an error message. */
1394 print_candidates (tree fns
)
1398 const char *str
= "candidates are:";
1400 for (fn
= fns
; fn
!= NULL_TREE
; fn
= TREE_CHAIN (fn
))
1404 for (f
= TREE_VALUE (fn
); f
; f
= OVL_NEXT (f
))
1405 error ("%s %+#D", str
, OVL_CURRENT (f
));
1410 /* Returns the template (one of the functions given by TEMPLATE_ID)
1411 which can be specialized to match the indicated DECL with the
1412 explicit template args given in TEMPLATE_ID. The DECL may be
1413 NULL_TREE if none is available. In that case, the functions in
1414 TEMPLATE_ID are non-members.
1416 If NEED_MEMBER_TEMPLATE is nonzero the function is known to be a
1417 specialization of a member template.
1419 The TEMPLATE_COUNT is the number of references to qualifying
1420 template classes that appeared in the name of the function. See
1421 check_explicit_specialization for a more accurate description.
1423 TSK indicates what kind of template declaration (if any) is being
1424 declared. TSK_TEMPLATE indicates that the declaration given by
1425 DECL, though a FUNCTION_DECL, has template parameters, and is
1426 therefore a template function.
1428 The template args (those explicitly specified and those deduced)
1429 are output in a newly created vector *TARGS_OUT.
1431 If it is impossible to determine the result, an error message is
1432 issued. The error_mark_node is returned to indicate failure. */
1435 determine_specialization (tree template_id
,
1438 int need_member_template
,
1444 tree explicit_targs
;
1445 tree candidates
= NULL_TREE
;
1446 /* A TREE_LIST of templates of which DECL may be a specialization.
1447 The TREE_VALUE of each node is a TEMPLATE_DECL. The
1448 corresponding TREE_PURPOSE is the set of template arguments that,
1449 when used to instantiate the template, would produce a function
1450 with the signature of DECL. */
1451 tree templates
= NULL_TREE
;
1453 struct cp_binding_level
*b
;
1455 *targs_out
= NULL_TREE
;
1457 if (template_id
== error_mark_node
|| decl
== error_mark_node
)
1458 return error_mark_node
;
1460 fns
= TREE_OPERAND (template_id
, 0);
1461 explicit_targs
= TREE_OPERAND (template_id
, 1);
1463 if (fns
== error_mark_node
)
1464 return error_mark_node
;
1466 /* Check for baselinks. */
1467 if (BASELINK_P (fns
))
1468 fns
= BASELINK_FUNCTIONS (fns
);
1470 if (!is_overloaded_fn (fns
))
1472 error ("%qD is not a function template", fns
);
1473 return error_mark_node
;
1476 /* Count the number of template headers specified for this
1479 for (b
= current_binding_level
;
1480 b
->kind
== sk_template_parms
;
1484 for (; fns
; fns
= OVL_NEXT (fns
))
1486 tree fn
= OVL_CURRENT (fns
);
1488 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
1490 tree decl_arg_types
;
1493 /* In case of explicit specialization, we need to check if
1494 the number of template headers appearing in the specialization
1495 is correct. This is usually done in check_explicit_specialization,
1496 but the check done there cannot be exhaustive when specializing
1497 member functions. Consider the following code:
1499 template <> void A<int>::f(int);
1500 template <> template <> void A<int>::f(int);
1502 Assuming that A<int> is not itself an explicit specialization
1503 already, the first line specializes "f" which is a non-template
1504 member function, whilst the second line specializes "f" which
1505 is a template member function. So both lines are syntactically
1506 correct, and check_explicit_specialization does not reject
1509 Here, we can do better, as we are matching the specialization
1510 against the declarations. We count the number of template
1511 headers, and we check if they match TEMPLATE_COUNT + 1
1512 (TEMPLATE_COUNT is the number of qualifying template classes,
1513 plus there must be another header for the member template
1516 Notice that if header_count is zero, this is not a
1517 specialization but rather a template instantiation, so there
1518 is no check we can perform here. */
1519 if (header_count
&& header_count
!= template_count
+ 1)
1522 /* Check that the number of template arguments at the
1523 innermost level for DECL is the same as for FN. */
1524 if (current_binding_level
->kind
== sk_template_parms
1525 && !current_binding_level
->explicit_spec_p
1526 && (TREE_VEC_LENGTH (DECL_INNERMOST_TEMPLATE_PARMS (fn
))
1527 != TREE_VEC_LENGTH (INNERMOST_TEMPLATE_PARMS
1528 (current_template_parms
))))
1531 /* DECL might be a specialization of FN. */
1532 decl_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
1533 fn_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
1535 /* For a non-static member function, we need to make sure
1536 that the const qualification is the same. Since
1537 get_bindings does not try to merge the "this" parameter,
1538 we must do the comparison explicitly. */
1539 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
1540 && !same_type_p (TREE_VALUE (fn_arg_types
),
1541 TREE_VALUE (decl_arg_types
)))
1544 /* Skip the "this" parameter and, for constructors of
1545 classes with virtual bases, the VTT parameter. A
1546 full specialization of a constructor will have a VTT
1547 parameter, but a template never will. */
1549 = skip_artificial_parms_for (decl
, decl_arg_types
);
1551 = skip_artificial_parms_for (fn
, fn_arg_types
);
1553 /* Check that the number of function parameters matches.
1555 template <class T> void f(int i = 0);
1556 template <> void f<int>();
1557 The specialization f<int> is invalid but is not caught
1558 by get_bindings below. */
1559 if (list_length (fn_arg_types
) != list_length (decl_arg_types
))
1562 /* Function templates cannot be specializations; there are
1563 no partial specializations of functions. Therefore, if
1564 the type of DECL does not match FN, there is no
1566 if (tsk
== tsk_template
)
1568 if (compparms (fn_arg_types
, decl_arg_types
))
1569 candidates
= tree_cons (NULL_TREE
, fn
, candidates
);
1573 /* See whether this function might be a specialization of this
1575 targs
= get_bindings (fn
, decl
, explicit_targs
, /*check_ret=*/true);
1578 /* We cannot deduce template arguments that when used to
1579 specialize TMPL will produce DECL. */
1582 /* Save this template, and the arguments deduced. */
1583 templates
= tree_cons (targs
, fn
, templates
);
1585 else if (need_member_template
)
1586 /* FN is an ordinary member function, and we need a
1587 specialization of a member template. */
1589 else if (TREE_CODE (fn
) != FUNCTION_DECL
)
1590 /* We can get IDENTIFIER_NODEs here in certain erroneous
1593 else if (!DECL_FUNCTION_MEMBER_P (fn
))
1594 /* This is just an ordinary non-member function. Nothing can
1595 be a specialization of that. */
1597 else if (DECL_ARTIFICIAL (fn
))
1598 /* Cannot specialize functions that are created implicitly. */
1602 tree decl_arg_types
;
1604 /* This is an ordinary member function. However, since
1605 we're here, we can assume it's enclosing class is a
1606 template class. For example,
1608 template <typename T> struct S { void f(); };
1609 template <> void S<int>::f() {}
1611 Here, S<int>::f is a non-template, but S<int> is a
1612 template class. If FN has the same type as DECL, we
1613 might be in business. */
1615 if (!DECL_TEMPLATE_INFO (fn
))
1616 /* Its enclosing class is an explicit specialization
1617 of a template class. This is not a candidate. */
1620 if (!same_type_p (TREE_TYPE (TREE_TYPE (decl
)),
1621 TREE_TYPE (TREE_TYPE (fn
))))
1622 /* The return types differ. */
1625 /* Adjust the type of DECL in case FN is a static member. */
1626 decl_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
1627 if (DECL_STATIC_FUNCTION_P (fn
)
1628 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1629 decl_arg_types
= TREE_CHAIN (decl_arg_types
);
1631 if (compparms (TYPE_ARG_TYPES (TREE_TYPE (fn
)),
1634 candidates
= tree_cons (NULL_TREE
, fn
, candidates
);
1638 if (templates
&& TREE_CHAIN (templates
))
1644 It is possible for a specialization with a given function
1645 signature to be instantiated from more than one function
1646 template. In such cases, explicit specification of the
1647 template arguments must be used to uniquely identify the
1648 function template specialization being specialized.
1650 Note that here, there's no suggestion that we're supposed to
1651 determine which of the candidate templates is most
1652 specialized. However, we, also have:
1656 Partial ordering of overloaded function template
1657 declarations is used in the following contexts to select
1658 the function template to which a function template
1659 specialization refers:
1661 -- when an explicit specialization refers to a function
1664 So, we do use the partial ordering rules, at least for now.
1665 This extension can only serve to make invalid programs valid,
1666 so it's safe. And, there is strong anecdotal evidence that
1667 the committee intended the partial ordering rules to apply;
1668 the EDG front end has that behavior, and John Spicer claims
1669 that the committee simply forgot to delete the wording in
1670 [temp.expl.spec]. */
1671 tree tmpl
= most_specialized_instantiation (templates
);
1672 if (tmpl
!= error_mark_node
)
1675 TREE_CHAIN (templates
) = NULL_TREE
;
1679 if (templates
== NULL_TREE
&& candidates
== NULL_TREE
)
1681 error ("template-id %qD for %q+D does not match any template "
1682 "declaration", template_id
, decl
);
1683 return error_mark_node
;
1685 else if ((templates
&& TREE_CHAIN (templates
))
1686 || (candidates
&& TREE_CHAIN (candidates
))
1687 || (templates
&& candidates
))
1689 error ("ambiguous template specialization %qD for %q+D",
1691 chainon (candidates
, templates
);
1692 print_candidates (candidates
);
1693 return error_mark_node
;
1696 /* We have one, and exactly one, match. */
1699 tree fn
= TREE_VALUE (candidates
);
1700 /* DECL is a re-declaration of a template function. */
1701 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
1703 /* It was a specialization of an ordinary member function in a
1705 *targs_out
= copy_node (DECL_TI_ARGS (fn
));
1706 return DECL_TI_TEMPLATE (fn
);
1709 /* It was a specialization of a template. */
1710 targs
= DECL_TI_ARGS (DECL_TEMPLATE_RESULT (TREE_VALUE (templates
)));
1711 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (targs
))
1713 *targs_out
= copy_node (targs
);
1714 SET_TMPL_ARGS_LEVEL (*targs_out
,
1715 TMPL_ARGS_DEPTH (*targs_out
),
1716 TREE_PURPOSE (templates
));
1719 *targs_out
= TREE_PURPOSE (templates
);
1720 return TREE_VALUE (templates
);
1723 /* Returns a chain of parameter types, exactly like the SPEC_TYPES,
1724 but with the default argument values filled in from those in the
1728 copy_default_args_to_explicit_spec_1 (tree spec_types
,
1731 tree new_spec_types
;
1736 if (spec_types
== void_list_node
)
1737 return void_list_node
;
1739 /* Substitute into the rest of the list. */
1741 copy_default_args_to_explicit_spec_1 (TREE_CHAIN (spec_types
),
1742 TREE_CHAIN (tmpl_types
));
1744 /* Add the default argument for this parameter. */
1745 return hash_tree_cons (TREE_PURPOSE (tmpl_types
),
1746 TREE_VALUE (spec_types
),
1750 /* DECL is an explicit specialization. Replicate default arguments
1751 from the template it specializes. (That way, code like:
1753 template <class T> void f(T = 3);
1754 template <> void f(double);
1757 works, as required.) An alternative approach would be to look up
1758 the correct default arguments at the call-site, but this approach
1759 is consistent with how implicit instantiations are handled. */
1762 copy_default_args_to_explicit_spec (tree decl
)
1767 tree new_spec_types
;
1771 tree object_type
= NULL_TREE
;
1772 tree in_charge
= NULL_TREE
;
1773 tree vtt
= NULL_TREE
;
1775 /* See if there's anything we need to do. */
1776 tmpl
= DECL_TI_TEMPLATE (decl
);
1777 tmpl_types
= TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (tmpl
)));
1778 for (t
= tmpl_types
; t
; t
= TREE_CHAIN (t
))
1779 if (TREE_PURPOSE (t
))
1784 old_type
= TREE_TYPE (decl
);
1785 spec_types
= TYPE_ARG_TYPES (old_type
);
1787 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1789 /* Remove the this pointer, but remember the object's type for
1791 object_type
= TREE_TYPE (TREE_VALUE (spec_types
));
1792 spec_types
= TREE_CHAIN (spec_types
);
1793 tmpl_types
= TREE_CHAIN (tmpl_types
);
1795 if (DECL_HAS_IN_CHARGE_PARM_P (decl
))
1797 /* DECL may contain more parameters than TMPL due to the extra
1798 in-charge parameter in constructors and destructors. */
1799 in_charge
= spec_types
;
1800 spec_types
= TREE_CHAIN (spec_types
);
1802 if (DECL_HAS_VTT_PARM_P (decl
))
1805 spec_types
= TREE_CHAIN (spec_types
);
1809 /* Compute the merged default arguments. */
1811 copy_default_args_to_explicit_spec_1 (spec_types
, tmpl_types
);
1813 /* Compute the new FUNCTION_TYPE. */
1817 new_spec_types
= hash_tree_cons (TREE_PURPOSE (vtt
),
1822 /* Put the in-charge parameter back. */
1823 new_spec_types
= hash_tree_cons (TREE_PURPOSE (in_charge
),
1824 TREE_VALUE (in_charge
),
1827 new_type
= build_method_type_directly (object_type
,
1828 TREE_TYPE (old_type
),
1832 new_type
= build_function_type (TREE_TYPE (old_type
),
1834 new_type
= cp_build_type_attribute_variant (new_type
,
1835 TYPE_ATTRIBUTES (old_type
));
1836 new_type
= build_exception_variant (new_type
,
1837 TYPE_RAISES_EXCEPTIONS (old_type
));
1838 TREE_TYPE (decl
) = new_type
;
1841 /* Check to see if the function just declared, as indicated in
1842 DECLARATOR, and in DECL, is a specialization of a function
1843 template. We may also discover that the declaration is an explicit
1844 instantiation at this point.
1846 Returns DECL, or an equivalent declaration that should be used
1847 instead if all goes well. Issues an error message if something is
1848 amiss. Returns error_mark_node if the error is not easily
1851 FLAGS is a bitmask consisting of the following flags:
1853 2: The function has a definition.
1854 4: The function is a friend.
1856 The TEMPLATE_COUNT is the number of references to qualifying
1857 template classes that appeared in the name of the function. For
1860 template <class T> struct S { void f(); };
1863 the TEMPLATE_COUNT would be 1. However, explicitly specialized
1864 classes are not counted in the TEMPLATE_COUNT, so that in
1866 template <class T> struct S {};
1867 template <> struct S<int> { void f(); }
1868 template <> void S<int>::f();
1870 the TEMPLATE_COUNT would be 0. (Note that this declaration is
1871 invalid; there should be no template <>.)
1873 If the function is a specialization, it is marked as such via
1874 DECL_TEMPLATE_SPECIALIZATION. Furthermore, its DECL_TEMPLATE_INFO
1875 is set up correctly, and it is added to the list of specializations
1876 for that template. */
1879 check_explicit_specialization (tree declarator
,
1884 int have_def
= flags
& 2;
1885 int is_friend
= flags
& 4;
1886 int specialization
= 0;
1887 int explicit_instantiation
= 0;
1888 int member_specialization
= 0;
1889 tree ctype
= DECL_CLASS_CONTEXT (decl
);
1890 tree dname
= DECL_NAME (decl
);
1895 if (!processing_specialization
)
1898 tsk
= tsk_excessive_parms
;
1901 tsk
= current_tmpl_spec_kind (template_count
);
1906 if (processing_specialization
)
1909 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
1911 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
1914 /* This could be something like:
1916 template <class T> void f(T);
1917 class S { friend void f<>(int); } */
1921 /* This case handles bogus declarations like template <>
1922 template <class T> void f<int>(); */
1924 error ("template-id %qD in declaration of primary template",
1931 case tsk_invalid_member_spec
:
1932 /* The error has already been reported in
1933 check_specialization_scope. */
1934 return error_mark_node
;
1936 case tsk_invalid_expl_inst
:
1937 error ("template parameter list used in explicit instantiation");
1943 error ("definition provided for explicit instantiation");
1945 explicit_instantiation
= 1;
1948 case tsk_excessive_parms
:
1949 case tsk_insufficient_parms
:
1950 if (tsk
== tsk_excessive_parms
)
1951 error ("too many template parameter lists in declaration of %qD",
1953 else if (template_header_count
)
1954 error("too few template parameter lists in declaration of %qD", decl
);
1956 error("explicit specialization of %qD must be introduced by "
1957 "%<template <>%>", decl
);
1961 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
1963 member_specialization
= 1;
1969 if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
1971 /* This case handles bogus declarations like template <>
1972 template <class T> void f<int>(); */
1974 if (uses_template_parms (declarator
))
1975 error ("function template partial specialization %qD "
1976 "is not allowed", declarator
);
1978 error ("template-id %qD in declaration of primary template",
1983 if (ctype
&& CLASSTYPE_TEMPLATE_INSTANTIATION (ctype
))
1984 /* This is a specialization of a member template, without
1985 specialization the containing class. Something like:
1987 template <class T> struct S {
1988 template <class U> void f (U);
1990 template <> template <class U> void S<int>::f(U) {}
1992 That's a specialization -- but of the entire template. */
2000 if (specialization
|| member_specialization
)
2002 tree t
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
2003 for (; t
; t
= TREE_CHAIN (t
))
2004 if (TREE_PURPOSE (t
))
2006 permerror (input_location
,
2007 "default argument specified in explicit specialization");
2012 if (specialization
|| member_specialization
|| explicit_instantiation
)
2014 tree tmpl
= NULL_TREE
;
2015 tree targs
= NULL_TREE
;
2017 /* Make sure that the declarator is a TEMPLATE_ID_EXPR. */
2018 if (TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
2022 gcc_assert (TREE_CODE (declarator
) == IDENTIFIER_NODE
);
2027 /* If there is no class context, the explicit instantiation
2028 must be at namespace scope. */
2029 gcc_assert (DECL_NAMESPACE_SCOPE_P (decl
));
2031 /* Find the namespace binding, using the declaration
2033 fns
= lookup_qualified_name (CP_DECL_CONTEXT (decl
), dname
,
2035 if (fns
== error_mark_node
|| !is_overloaded_fn (fns
))
2037 error ("%qD is not a template function", dname
);
2038 fns
= error_mark_node
;
2042 tree fn
= OVL_CURRENT (fns
);
2043 if (!is_associated_namespace (CP_DECL_CONTEXT (decl
),
2044 CP_DECL_CONTEXT (fn
)))
2045 error ("%qD is not declared in %qD",
2046 decl
, current_namespace
);
2050 declarator
= lookup_template_function (fns
, NULL_TREE
);
2053 if (declarator
== error_mark_node
)
2054 return error_mark_node
;
2056 if (ctype
!= NULL_TREE
&& TYPE_BEING_DEFINED (ctype
))
2058 if (!explicit_instantiation
)
2059 /* A specialization in class scope. This is invalid,
2060 but the error will already have been flagged by
2061 check_specialization_scope. */
2062 return error_mark_node
;
2065 /* It's not valid to write an explicit instantiation in
2068 class C { template void f(); }
2070 This case is caught by the parser. However, on
2073 template class C { void f(); };
2075 (which is invalid) we can get here. The error will be
2082 else if (ctype
!= NULL_TREE
2083 && (TREE_CODE (TREE_OPERAND (declarator
, 0)) ==
2086 /* Find the list of functions in ctype that have the same
2087 name as the declared function. */
2088 tree name
= TREE_OPERAND (declarator
, 0);
2089 tree fns
= NULL_TREE
;
2092 if (constructor_name_p (name
, ctype
))
2094 int is_constructor
= DECL_CONSTRUCTOR_P (decl
);
2096 if (is_constructor
? !TYPE_HAS_USER_CONSTRUCTOR (ctype
)
2097 : !CLASSTYPE_DESTRUCTORS (ctype
))
2099 /* From [temp.expl.spec]:
2101 If such an explicit specialization for the member
2102 of a class template names an implicitly-declared
2103 special member function (clause _special_), the
2104 program is ill-formed.
2106 Similar language is found in [temp.explicit]. */
2107 error ("specialization of implicitly-declared special member function");
2108 return error_mark_node
;
2111 name
= is_constructor
? ctor_identifier
: dtor_identifier
;
2114 if (!DECL_CONV_FN_P (decl
))
2116 idx
= lookup_fnfields_1 (ctype
, name
);
2118 fns
= VEC_index (tree
, CLASSTYPE_METHOD_VEC (ctype
), idx
);
2122 VEC(tree
,gc
) *methods
;
2125 /* For a type-conversion operator, we cannot do a
2126 name-based lookup. We might be looking for `operator
2127 int' which will be a specialization of `operator T'.
2128 So, we find *all* the conversion operators, and then
2129 select from them. */
2132 methods
= CLASSTYPE_METHOD_VEC (ctype
);
2134 for (idx
= CLASSTYPE_FIRST_CONVERSION_SLOT
;
2135 VEC_iterate (tree
, methods
, idx
, ovl
);
2138 if (!DECL_CONV_FN_P (OVL_CURRENT (ovl
)))
2139 /* There are no more conversion functions. */
2142 /* Glue all these conversion functions together
2143 with those we already have. */
2144 for (; ovl
; ovl
= OVL_NEXT (ovl
))
2145 fns
= ovl_cons (OVL_CURRENT (ovl
), fns
);
2149 if (fns
== NULL_TREE
)
2151 error ("no member function %qD declared in %qT", name
, ctype
);
2152 return error_mark_node
;
2155 TREE_OPERAND (declarator
, 0) = fns
;
2158 /* Figure out what exactly is being specialized at this point.
2159 Note that for an explicit instantiation, even one for a
2160 member function, we cannot tell apriori whether the
2161 instantiation is for a member template, or just a member
2162 function of a template class. Even if a member template is
2163 being instantiated, the member template arguments may be
2164 elided if they can be deduced from the rest of the
2166 tmpl
= determine_specialization (declarator
, decl
,
2168 member_specialization
,
2172 if (!tmpl
|| tmpl
== error_mark_node
)
2173 /* We couldn't figure out what this declaration was
2175 return error_mark_node
;
2178 tree gen_tmpl
= most_general_template (tmpl
);
2180 if (explicit_instantiation
)
2182 /* We don't set DECL_EXPLICIT_INSTANTIATION here; that
2183 is done by do_decl_instantiation later. */
2185 int arg_depth
= TMPL_ARGS_DEPTH (targs
);
2186 int parm_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
2188 if (arg_depth
> parm_depth
)
2190 /* If TMPL is not the most general template (for
2191 example, if TMPL is a friend template that is
2192 injected into namespace scope), then there will
2193 be too many levels of TARGS. Remove some of them
2198 new_targs
= make_tree_vec (parm_depth
);
2199 for (i
= arg_depth
- parm_depth
; i
< arg_depth
; ++i
)
2200 TREE_VEC_ELT (new_targs
, i
- (arg_depth
- parm_depth
))
2201 = TREE_VEC_ELT (targs
, i
);
2205 return instantiate_template (tmpl
, targs
, tf_error
);
2208 /* If we thought that the DECL was a member function, but it
2209 turns out to be specializing a static member function,
2210 make DECL a static member function as well. */
2211 if (DECL_STATIC_FUNCTION_P (tmpl
)
2212 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
2213 revert_static_member_fn (decl
);
2215 /* If this is a specialization of a member template of a
2216 template class, we want to return the TEMPLATE_DECL, not
2217 the specialization of it. */
2218 if (tsk
== tsk_template
)
2220 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
2221 DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl
)) = NULL_TREE
;
2224 DECL_SOURCE_LOCATION (tmpl
) = DECL_SOURCE_LOCATION (decl
);
2225 DECL_SOURCE_LOCATION (DECL_TEMPLATE_RESULT (tmpl
))
2226 = DECL_SOURCE_LOCATION (decl
);
2227 /* We want to use the argument list specified in the
2228 definition, not in the original declaration. */
2229 DECL_ARGUMENTS (DECL_TEMPLATE_RESULT (tmpl
))
2230 = DECL_ARGUMENTS (decl
);
2235 /* Set up the DECL_TEMPLATE_INFO for DECL. */
2236 DECL_TEMPLATE_INFO (decl
) = tree_cons (tmpl
, targs
, NULL_TREE
);
2238 /* Inherit default function arguments from the template
2239 DECL is specializing. */
2240 copy_default_args_to_explicit_spec (decl
);
2242 /* This specialization has the same protection as the
2243 template it specializes. */
2244 TREE_PRIVATE (decl
) = TREE_PRIVATE (gen_tmpl
);
2245 TREE_PROTECTED (decl
) = TREE_PROTECTED (gen_tmpl
);
2247 /* 7.1.1-1 [dcl.stc]
2249 A storage-class-specifier shall not be specified in an
2250 explicit specialization...
2252 The parser rejects these, so unless action is taken here,
2253 explicit function specializations will always appear with
2256 The action recommended by the C++ CWG in response to C++
2257 defect report 605 is to make the storage class and linkage
2258 of the explicit specialization match the templated function:
2260 http://www.open-std.org/jtc1/sc22/wg21/docs/cwg_active.html#605
2262 if (tsk
== tsk_expl_spec
&& DECL_FUNCTION_TEMPLATE_P (gen_tmpl
))
2264 tree tmpl_func
= DECL_TEMPLATE_RESULT (gen_tmpl
);
2265 gcc_assert (TREE_CODE (tmpl_func
) == FUNCTION_DECL
);
2267 /* This specialization has the same linkage and visibility as
2268 the function template it specializes. */
2269 TREE_PUBLIC (decl
) = TREE_PUBLIC (tmpl_func
);
2270 if (! TREE_PUBLIC (decl
))
2272 DECL_INTERFACE_KNOWN (decl
) = 1;
2273 DECL_NOT_REALLY_EXTERN (decl
) = 1;
2275 DECL_THIS_STATIC (decl
) = DECL_THIS_STATIC (tmpl_func
);
2276 if (DECL_VISIBILITY_SPECIFIED (tmpl_func
))
2278 DECL_VISIBILITY_SPECIFIED (decl
) = 1;
2279 DECL_VISIBILITY (decl
) = DECL_VISIBILITY (tmpl_func
);
2283 /* If DECL is a friend declaration, declared using an
2284 unqualified name, the namespace associated with DECL may
2285 have been set incorrectly. For example, in:
2287 template <typename T> void f(T);
2289 struct S { friend void f<int>(int); }
2292 we will have set the DECL_CONTEXT for the friend
2293 declaration to N, rather than to the global namespace. */
2294 if (DECL_NAMESPACE_SCOPE_P (decl
))
2295 DECL_CONTEXT (decl
) = DECL_CONTEXT (tmpl
);
2297 if (is_friend
&& !have_def
)
2298 /* This is not really a declaration of a specialization.
2299 It's just the name of an instantiation. But, it's not
2300 a request for an instantiation, either. */
2301 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
2302 else if (DECL_CONSTRUCTOR_P (decl
) || DECL_DESTRUCTOR_P (decl
))
2303 /* This is indeed a specialization. In case of constructors
2304 and destructors, we need in-charge and not-in-charge
2305 versions in V3 ABI. */
2306 clone_function_decl (decl
, /*update_method_vec_p=*/0);
2308 /* Register this specialization so that we can find it
2310 decl
= register_specialization (decl
, gen_tmpl
, targs
, is_friend
);
2317 /* Returns 1 iff PARMS1 and PARMS2 are identical sets of template
2318 parameters. These are represented in the same format used for
2319 DECL_TEMPLATE_PARMS. */
2322 comp_template_parms (const_tree parms1
, const_tree parms2
)
2327 if (parms1
== parms2
)
2330 for (p1
= parms1
, p2
= parms2
;
2331 p1
!= NULL_TREE
&& p2
!= NULL_TREE
;
2332 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
))
2334 tree t1
= TREE_VALUE (p1
);
2335 tree t2
= TREE_VALUE (p2
);
2338 gcc_assert (TREE_CODE (t1
) == TREE_VEC
);
2339 gcc_assert (TREE_CODE (t2
) == TREE_VEC
);
2341 if (TREE_VEC_LENGTH (t1
) != TREE_VEC_LENGTH (t2
))
2344 for (i
= 0; i
< TREE_VEC_LENGTH (t2
); ++i
)
2346 tree parm1
= TREE_VALUE (TREE_VEC_ELT (t1
, i
));
2347 tree parm2
= TREE_VALUE (TREE_VEC_ELT (t2
, i
));
2349 /* If either of the template parameters are invalid, assume
2350 they match for the sake of error recovery. */
2351 if (parm1
== error_mark_node
|| parm2
== error_mark_node
)
2354 if (TREE_CODE (parm1
) != TREE_CODE (parm2
))
2357 if (TREE_CODE (parm1
) == TEMPLATE_TYPE_PARM
2358 && (TEMPLATE_TYPE_PARAMETER_PACK (parm1
)
2359 == TEMPLATE_TYPE_PARAMETER_PACK (parm2
)))
2361 else if (!same_type_p (TREE_TYPE (parm1
), TREE_TYPE (parm2
)))
2366 if ((p1
!= NULL_TREE
) != (p2
!= NULL_TREE
))
2367 /* One set of parameters has more parameters lists than the
2374 /* Determine whether PARM is a parameter pack. */
2376 template_parameter_pack_p (const_tree parm
)
2378 /* Determine if we have a non-type template parameter pack. */
2379 if (TREE_CODE (parm
) == PARM_DECL
)
2380 return (DECL_TEMPLATE_PARM_P (parm
)
2381 && TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)));
2383 /* If this is a list of template parameters, we could get a
2384 TYPE_DECL or a TEMPLATE_DECL. */
2385 if (TREE_CODE (parm
) == TYPE_DECL
|| TREE_CODE (parm
) == TEMPLATE_DECL
)
2386 parm
= TREE_TYPE (parm
);
2388 return ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
2389 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
)
2390 && TEMPLATE_TYPE_PARAMETER_PACK (parm
));
2393 /* Determine whether ARGS describes a variadic template args list,
2394 i.e., one that is terminated by a template argument pack. */
2396 template_args_variadic_p (tree args
)
2401 if (args
== NULL_TREE
)
2404 args
= INNERMOST_TEMPLATE_ARGS (args
);
2405 nargs
= TREE_VEC_LENGTH (args
);
2410 last_parm
= TREE_VEC_ELT (args
, nargs
- 1);
2412 return ARGUMENT_PACK_P (last_parm
);
2415 /* Generate a new name for the parameter pack name NAME (an
2416 IDENTIFIER_NODE) that incorporates its */
2418 make_ith_pack_parameter_name (tree name
, int i
)
2420 /* Munge the name to include the parameter index. */
2424 sprintf(numbuf
, "%i", i
);
2425 newname
= (char*)alloca (IDENTIFIER_LENGTH (name
) + strlen(numbuf
) + 2);
2426 sprintf(newname
, "%s#%i", IDENTIFIER_POINTER (name
), i
);
2427 return get_identifier (newname
);
2430 /* Structure used to track the progress of find_parameter_packs_r. */
2431 struct find_parameter_pack_data
2433 /* TREE_LIST that will contain all of the parameter packs found by
2435 tree
* parameter_packs
;
2437 /* Set of AST nodes that have been visited by the traversal. */
2438 struct pointer_set_t
*visited
;
2441 /* Identifies all of the argument packs that occur in a template
2442 argument and appends them to the TREE_LIST inside DATA, which is a
2443 find_parameter_pack_data structure. This is a subroutine of
2444 make_pack_expansion and uses_parameter_packs. */
2446 find_parameter_packs_r (tree
*tp
, int *walk_subtrees
, void* data
)
2449 struct find_parameter_pack_data
* ppd
=
2450 (struct find_parameter_pack_data
*)data
;
2451 bool parameter_pack_p
= false;
2453 /* Identify whether this is a parameter pack or not. */
2454 switch (TREE_CODE (t
))
2456 case TEMPLATE_PARM_INDEX
:
2457 if (TEMPLATE_PARM_PARAMETER_PACK (t
))
2458 parameter_pack_p
= true;
2461 case TEMPLATE_TYPE_PARM
:
2462 case TEMPLATE_TEMPLATE_PARM
:
2463 if (TEMPLATE_TYPE_PARAMETER_PACK (t
))
2464 parameter_pack_p
= true;
2468 if (FUNCTION_PARAMETER_PACK_P (t
))
2470 /* We don't want to walk into the type of a PARM_DECL,
2471 because we don't want to see the type parameter pack. */
2473 parameter_pack_p
= true;
2478 /* Not a parameter pack. */
2482 if (parameter_pack_p
)
2484 /* Add this parameter pack to the list. */
2485 *ppd
->parameter_packs
= tree_cons (NULL_TREE
, t
, *ppd
->parameter_packs
);
2489 cp_walk_tree (&TYPE_CONTEXT (t
),
2490 &find_parameter_packs_r
, ppd
, ppd
->visited
);
2492 /* This switch statement will return immediately if we don't find a
2494 switch (TREE_CODE (t
))
2496 case TEMPLATE_PARM_INDEX
:
2499 case BOUND_TEMPLATE_TEMPLATE_PARM
:
2500 /* Check the template itself. */
2501 cp_walk_tree (&TREE_TYPE (TYPE_TI_TEMPLATE (t
)),
2502 &find_parameter_packs_r
, ppd
, ppd
->visited
);
2503 /* Check the template arguments. */
2504 cp_walk_tree (&TYPE_TI_ARGS (t
), &find_parameter_packs_r
, ppd
,
2509 case TEMPLATE_TYPE_PARM
:
2510 case TEMPLATE_TEMPLATE_PARM
:
2517 if (TYPE_PTRMEMFUNC_P (t
))
2523 if (TYPE_TEMPLATE_INFO (t
))
2524 cp_walk_tree (&TREE_VALUE (TYPE_TEMPLATE_INFO (t
)),
2525 &find_parameter_packs_r
, ppd
, ppd
->visited
);
2531 cp_walk_tree (&TREE_TYPE (t
),
2532 &find_parameter_packs_r
, ppd
, ppd
->visited
);
2536 cp_walk_tree (&TYPENAME_TYPE_FULLNAME (t
), &find_parameter_packs_r
,
2541 case TYPE_PACK_EXPANSION
:
2542 case EXPR_PACK_EXPANSION
:
2547 cp_walk_tree (&TYPE_MAX_VALUE (t
), &find_parameter_packs_r
,
2552 case IDENTIFIER_NODE
:
2553 cp_walk_tree (&TREE_TYPE (t
), &find_parameter_packs_r
, ppd
,
2565 /* Determines if the expression or type T uses any parameter packs. */
2567 uses_parameter_packs (tree t
)
2569 tree parameter_packs
= NULL_TREE
;
2570 struct find_parameter_pack_data ppd
;
2571 ppd
.parameter_packs
= ¶meter_packs
;
2572 ppd
.visited
= pointer_set_create ();
2573 cp_walk_tree (&t
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
2574 pointer_set_destroy (ppd
.visited
);
2575 return parameter_packs
!= NULL_TREE
;
2578 /* Turn ARG, which may be an expression, type, or a TREE_LIST
2579 representation a base-class initializer into a parameter pack
2580 expansion. If all goes well, the resulting node will be an
2581 EXPR_PACK_EXPANSION, TYPE_PACK_EXPANSION, or TREE_LIST,
2584 make_pack_expansion (tree arg
)
2587 tree parameter_packs
= NULL_TREE
;
2588 bool for_types
= false;
2589 struct find_parameter_pack_data ppd
;
2591 if (!arg
|| arg
== error_mark_node
)
2594 if (TREE_CODE (arg
) == TREE_LIST
)
2596 /* The only time we will see a TREE_LIST here is for a base
2597 class initializer. In this case, the TREE_PURPOSE will be a
2598 _TYPE node (representing the base class expansion we're
2599 initializing) and the TREE_VALUE will be a TREE_LIST
2600 containing the initialization arguments.
2602 The resulting expansion looks somewhat different from most
2603 expansions. Rather than returning just one _EXPANSION, we
2604 return a TREE_LIST whose TREE_PURPOSE is a
2605 TYPE_PACK_EXPANSION containing the bases that will be
2606 initialized. The TREE_VALUE will be identical to the
2607 original TREE_VALUE, which is a list of arguments that will
2608 be passed to each base. We do not introduce any new pack
2609 expansion nodes into the TREE_VALUE (although it is possible
2610 that some already exist), because the TREE_PURPOSE and
2611 TREE_VALUE all need to be expanded together with the same
2612 _EXPANSION node. Note that the TYPE_PACK_EXPANSION in the
2613 resulting TREE_PURPOSE will mention the parameter packs in
2614 both the bases and the arguments to the bases. */
2617 tree parameter_packs
= NULL_TREE
;
2619 /* Determine which parameter packs will be used by the base
2621 ppd
.visited
= pointer_set_create ();
2622 ppd
.parameter_packs
= ¶meter_packs
;
2623 cp_walk_tree (&TREE_PURPOSE (arg
), &find_parameter_packs_r
,
2626 if (parameter_packs
== NULL_TREE
)
2628 error ("base initializer expansion %<%T%> contains no parameter packs", arg
);
2629 pointer_set_destroy (ppd
.visited
);
2630 return error_mark_node
;
2633 if (TREE_VALUE (arg
) != void_type_node
)
2635 /* Collect the sets of parameter packs used in each of the
2636 initialization arguments. */
2637 for (value
= TREE_VALUE (arg
); value
; value
= TREE_CHAIN (value
))
2639 /* Determine which parameter packs will be expanded in this
2641 cp_walk_tree (&TREE_VALUE (value
), &find_parameter_packs_r
,
2646 pointer_set_destroy (ppd
.visited
);
2648 /* Create the pack expansion type for the base type. */
2649 purpose
= make_node (TYPE_PACK_EXPANSION
);
2650 SET_PACK_EXPANSION_PATTERN (purpose
, TREE_PURPOSE (arg
));
2651 PACK_EXPANSION_PARAMETER_PACKS (purpose
) = parameter_packs
;
2653 /* Just use structural equality for these TYPE_PACK_EXPANSIONS;
2654 they will rarely be compared to anything. */
2655 SET_TYPE_STRUCTURAL_EQUALITY (purpose
);
2657 return tree_cons (purpose
, TREE_VALUE (arg
), NULL_TREE
);
2660 if (TYPE_P (arg
) || TREE_CODE (arg
) == TEMPLATE_DECL
)
2663 /* Build the PACK_EXPANSION_* node. */
2664 result
= make_node (for_types
? TYPE_PACK_EXPANSION
: EXPR_PACK_EXPANSION
);
2665 SET_PACK_EXPANSION_PATTERN (result
, arg
);
2666 if (TREE_CODE (result
) == EXPR_PACK_EXPANSION
)
2668 /* Propagate type and const-expression information. */
2669 TREE_TYPE (result
) = TREE_TYPE (arg
);
2670 TREE_CONSTANT (result
) = TREE_CONSTANT (arg
);
2673 /* Just use structural equality for these TYPE_PACK_EXPANSIONS;
2674 they will rarely be compared to anything. */
2675 SET_TYPE_STRUCTURAL_EQUALITY (result
);
2677 /* Determine which parameter packs will be expanded. */
2678 ppd
.parameter_packs
= ¶meter_packs
;
2679 ppd
.visited
= pointer_set_create ();
2680 cp_walk_tree (&arg
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
2681 pointer_set_destroy (ppd
.visited
);
2683 /* Make sure we found some parameter packs. */
2684 if (parameter_packs
== NULL_TREE
)
2687 error ("expansion pattern %<%T%> contains no argument packs", arg
);
2689 error ("expansion pattern %<%E%> contains no argument packs", arg
);
2690 return error_mark_node
;
2692 PACK_EXPANSION_PARAMETER_PACKS (result
) = parameter_packs
;
2697 /* Checks T for any "bare" parameter packs, which have not yet been
2698 expanded, and issues an error if any are found. This operation can
2699 only be done on full expressions or types (e.g., an expression
2700 statement, "if" condition, etc.), because we could have expressions like:
2702 foo(f(g(h(args)))...)
2704 where "args" is a parameter pack. check_for_bare_parameter_packs
2705 should not be called for the subexpressions args, h(args),
2706 g(h(args)), or f(g(h(args))), because we would produce erroneous
2709 Returns TRUE and emits an error if there were bare parameter packs,
2710 returns FALSE otherwise. */
2712 check_for_bare_parameter_packs (tree t
)
2714 tree parameter_packs
= NULL_TREE
;
2715 struct find_parameter_pack_data ppd
;
2717 if (!processing_template_decl
|| !t
|| t
== error_mark_node
)
2720 if (TREE_CODE (t
) == TYPE_DECL
)
2723 ppd
.parameter_packs
= ¶meter_packs
;
2724 ppd
.visited
= pointer_set_create ();
2725 cp_walk_tree (&t
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
2726 pointer_set_destroy (ppd
.visited
);
2728 if (parameter_packs
)
2730 error ("parameter packs not expanded with %<...%>:");
2731 while (parameter_packs
)
2733 tree pack
= TREE_VALUE (parameter_packs
);
2734 tree name
= NULL_TREE
;
2736 if (TREE_CODE (pack
) == TEMPLATE_TYPE_PARM
2737 || TREE_CODE (pack
) == TEMPLATE_TEMPLATE_PARM
)
2738 name
= TYPE_NAME (pack
);
2739 else if (TREE_CODE (pack
) == TEMPLATE_PARM_INDEX
)
2740 name
= DECL_NAME (TEMPLATE_PARM_DECL (pack
));
2742 name
= DECL_NAME (pack
);
2745 inform (input_location
, " %qD", name
);
2747 inform (input_location
, " <anonymous>");
2749 parameter_packs
= TREE_CHAIN (parameter_packs
);
2758 /* Expand any parameter packs that occur in the template arguments in
2761 expand_template_argument_pack (tree args
)
2763 tree result_args
= NULL_TREE
;
2764 int in_arg
, out_arg
= 0, nargs
= args
? TREE_VEC_LENGTH (args
) : 0;
2765 int num_result_args
= -1;
2767 /* First, determine if we need to expand anything, and the number of
2768 slots we'll need. */
2769 for (in_arg
= 0; in_arg
< nargs
; ++in_arg
)
2771 tree arg
= TREE_VEC_ELT (args
, in_arg
);
2772 if (ARGUMENT_PACK_P (arg
))
2774 int num_packed
= TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg
));
2775 if (num_result_args
< 0)
2776 num_result_args
= in_arg
+ num_packed
;
2778 num_result_args
+= num_packed
;
2782 if (num_result_args
>= 0)
2787 /* If no expansion is necessary, we're done. */
2788 if (num_result_args
< 0)
2791 /* Expand arguments. */
2792 result_args
= make_tree_vec (num_result_args
);
2793 for (in_arg
= 0; in_arg
< nargs
; ++in_arg
)
2795 tree arg
= TREE_VEC_ELT (args
, in_arg
);
2796 if (ARGUMENT_PACK_P (arg
))
2798 tree packed
= ARGUMENT_PACK_ARGS (arg
);
2799 int i
, num_packed
= TREE_VEC_LENGTH (packed
);
2800 for (i
= 0; i
< num_packed
; ++i
, ++out_arg
)
2801 TREE_VEC_ELT (result_args
, out_arg
) = TREE_VEC_ELT(packed
, i
);
2805 TREE_VEC_ELT (result_args
, out_arg
) = arg
;
2813 /* Checks if DECL shadows a template parameter.
2815 [temp.local]: A template-parameter shall not be redeclared within its
2816 scope (including nested scopes).
2818 Emits an error and returns TRUE if the DECL shadows a parameter,
2819 returns FALSE otherwise. */
2822 check_template_shadow (tree decl
)
2826 /* If we're not in a template, we can't possibly shadow a template
2828 if (!current_template_parms
)
2831 /* Figure out what we're shadowing. */
2832 if (TREE_CODE (decl
) == OVERLOAD
)
2833 decl
= OVL_CURRENT (decl
);
2834 olddecl
= innermost_non_namespace_value (DECL_NAME (decl
));
2836 /* If there's no previous binding for this name, we're not shadowing
2837 anything, let alone a template parameter. */
2841 /* If we're not shadowing a template parameter, we're done. Note
2842 that OLDDECL might be an OVERLOAD (or perhaps even an
2843 ERROR_MARK), so we can't just blithely assume it to be a _DECL
2845 if (!DECL_P (olddecl
) || !DECL_TEMPLATE_PARM_P (olddecl
))
2848 /* We check for decl != olddecl to avoid bogus errors for using a
2849 name inside a class. We check TPFI to avoid duplicate errors for
2850 inline member templates. */
2852 || TEMPLATE_PARMS_FOR_INLINE (current_template_parms
))
2855 error ("declaration of %q+#D", decl
);
2856 error (" shadows template parm %q+#D", olddecl
);
2860 /* Return a new TEMPLATE_PARM_INDEX with the indicated INDEX, LEVEL,
2861 ORIG_LEVEL, DECL, and TYPE. */
2864 build_template_parm_index (int index
,
2870 tree t
= make_node (TEMPLATE_PARM_INDEX
);
2871 TEMPLATE_PARM_IDX (t
) = index
;
2872 TEMPLATE_PARM_LEVEL (t
) = level
;
2873 TEMPLATE_PARM_ORIG_LEVEL (t
) = orig_level
;
2874 TEMPLATE_PARM_DECL (t
) = decl
;
2875 TREE_TYPE (t
) = type
;
2876 TREE_CONSTANT (t
) = TREE_CONSTANT (decl
);
2877 TREE_READONLY (t
) = TREE_READONLY (decl
);
2882 /* Find the canonical type parameter for the given template type
2883 parameter. Returns the canonical type parameter, which may be TYPE
2884 if no such parameter existed. */
2886 canonical_type_parameter (tree type
)
2889 int idx
= TEMPLATE_TYPE_IDX (type
);
2890 if (!canonical_template_parms
)
2891 canonical_template_parms
= VEC_alloc (tree
, gc
, idx
+1);
2893 while (VEC_length (tree
, canonical_template_parms
) <= (unsigned)idx
)
2894 VEC_safe_push (tree
, gc
, canonical_template_parms
, NULL_TREE
);
2896 list
= VEC_index (tree
, canonical_template_parms
, idx
);
2897 while (list
&& !comptypes (type
, TREE_VALUE (list
), COMPARE_STRUCTURAL
))
2898 list
= TREE_CHAIN (list
);
2901 return TREE_VALUE (list
);
2904 VEC_replace(tree
, canonical_template_parms
, idx
,
2905 tree_cons (NULL_TREE
, type
,
2906 VEC_index (tree
, canonical_template_parms
, idx
)));
2911 /* Return a TEMPLATE_PARM_INDEX, similar to INDEX, but whose
2912 TEMPLATE_PARM_LEVEL has been decreased by LEVELS. If such a
2913 TEMPLATE_PARM_INDEX already exists, it is returned; otherwise, a
2914 new one is created. */
2917 reduce_template_parm_level (tree index
, tree type
, int levels
, tree args
,
2918 tsubst_flags_t complain
)
2920 if (TEMPLATE_PARM_DESCENDANTS (index
) == NULL_TREE
2921 || (TEMPLATE_PARM_LEVEL (TEMPLATE_PARM_DESCENDANTS (index
))
2922 != TEMPLATE_PARM_LEVEL (index
) - levels
))
2924 tree orig_decl
= TEMPLATE_PARM_DECL (index
);
2927 decl
= build_decl (TREE_CODE (orig_decl
), DECL_NAME (orig_decl
), type
);
2928 TREE_CONSTANT (decl
) = TREE_CONSTANT (orig_decl
);
2929 TREE_READONLY (decl
) = TREE_READONLY (orig_decl
);
2930 DECL_ARTIFICIAL (decl
) = 1;
2931 SET_DECL_TEMPLATE_PARM_P (decl
);
2933 t
= build_template_parm_index (TEMPLATE_PARM_IDX (index
),
2934 TEMPLATE_PARM_LEVEL (index
) - levels
,
2935 TEMPLATE_PARM_ORIG_LEVEL (index
),
2937 TEMPLATE_PARM_DESCENDANTS (index
) = t
;
2938 TEMPLATE_PARM_PARAMETER_PACK (t
)
2939 = TEMPLATE_PARM_PARAMETER_PACK (index
);
2941 /* Template template parameters need this. */
2942 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
2943 DECL_TEMPLATE_PARMS (decl
) = tsubst_template_parms
2944 (DECL_TEMPLATE_PARMS (TEMPLATE_PARM_DECL (index
)),
2948 return TEMPLATE_PARM_DESCENDANTS (index
);
2951 /* Process information from new template parameter PARM and append it to the
2952 LIST being built. This new parameter is a non-type parameter iff
2953 IS_NON_TYPE is true. This new parameter is a parameter
2954 pack iff IS_PARAMETER_PACK is true. */
2957 process_template_parm (tree list
, tree parm
, bool is_non_type
,
2958 bool is_parameter_pack
)
2965 gcc_assert (TREE_CODE (parm
) == TREE_LIST
);
2966 defval
= TREE_PURPOSE (parm
);
2970 tree p
= tree_last (list
);
2972 if (p
&& TREE_VALUE (p
) != error_mark_node
)
2975 if (TREE_CODE (p
) == TYPE_DECL
|| TREE_CODE (p
) == TEMPLATE_DECL
)
2976 idx
= TEMPLATE_TYPE_IDX (TREE_TYPE (p
));
2978 idx
= TEMPLATE_PARM_IDX (DECL_INITIAL (p
));
2988 parm
= TREE_VALUE (parm
);
2990 SET_DECL_TEMPLATE_PARM_P (parm
);
2992 if (TREE_TYPE (parm
) == error_mark_node
)
2994 err_parm_list
= build_tree_list (defval
, parm
);
2995 TREE_VALUE (err_parm_list
) = error_mark_node
;
2996 return chainon (list
, err_parm_list
);
3002 The top-level cv-qualifiers on the template-parameter are
3003 ignored when determining its type. */
3004 TREE_TYPE (parm
) = TYPE_MAIN_VARIANT (TREE_TYPE (parm
));
3005 if (invalid_nontype_parm_type_p (TREE_TYPE (parm
), 1))
3007 err_parm_list
= build_tree_list (defval
, parm
);
3008 TREE_VALUE (err_parm_list
) = error_mark_node
;
3009 return chainon (list
, err_parm_list
);
3012 if (uses_parameter_packs (TREE_TYPE (parm
)) && !is_parameter_pack
)
3014 /* This template parameter is not a parameter pack, but it
3015 should be. Complain about "bare" parameter packs. */
3016 check_for_bare_parameter_packs (TREE_TYPE (parm
));
3018 /* Recover by calling this a parameter pack. */
3019 is_parameter_pack
= true;
3023 /* A template parameter is not modifiable. */
3024 TREE_CONSTANT (parm
) = 1;
3025 TREE_READONLY (parm
) = 1;
3026 decl
= build_decl (CONST_DECL
, DECL_NAME (parm
), TREE_TYPE (parm
));
3027 TREE_CONSTANT (decl
) = 1;
3028 TREE_READONLY (decl
) = 1;
3029 DECL_INITIAL (parm
) = DECL_INITIAL (decl
)
3030 = build_template_parm_index (idx
, processing_template_decl
,
3031 processing_template_decl
,
3032 decl
, TREE_TYPE (parm
));
3034 TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
))
3035 = is_parameter_pack
;
3040 parm
= TREE_VALUE (TREE_VALUE (parm
));
3042 if (parm
&& TREE_CODE (parm
) == TEMPLATE_DECL
)
3044 t
= cxx_make_type (TEMPLATE_TEMPLATE_PARM
);
3045 /* This is for distinguishing between real templates and template
3046 template parameters */
3047 TREE_TYPE (parm
) = t
;
3048 TREE_TYPE (DECL_TEMPLATE_RESULT (parm
)) = t
;
3053 t
= cxx_make_type (TEMPLATE_TYPE_PARM
);
3054 /* parm is either IDENTIFIER_NODE or NULL_TREE. */
3055 decl
= build_decl (TYPE_DECL
, parm
, t
);
3058 TYPE_NAME (t
) = decl
;
3059 TYPE_STUB_DECL (t
) = decl
;
3061 TEMPLATE_TYPE_PARM_INDEX (t
)
3062 = build_template_parm_index (idx
, processing_template_decl
,
3063 processing_template_decl
,
3064 decl
, TREE_TYPE (parm
));
3065 TEMPLATE_TYPE_PARAMETER_PACK (t
) = is_parameter_pack
;
3066 TYPE_CANONICAL (t
) = canonical_type_parameter (t
);
3068 DECL_ARTIFICIAL (decl
) = 1;
3069 SET_DECL_TEMPLATE_PARM_P (decl
);
3071 parm
= build_tree_list (defval
, parm
);
3072 return chainon (list
, parm
);
3075 /* The end of a template parameter list has been reached. Process the
3076 tree list into a parameter vector, converting each parameter into a more
3077 useful form. Type parameters are saved as IDENTIFIER_NODEs, and others
3081 end_template_parm_list (tree parms
)
3085 tree saved_parmlist
= make_tree_vec (list_length (parms
));
3087 current_template_parms
3088 = tree_cons (size_int (processing_template_decl
),
3089 saved_parmlist
, current_template_parms
);
3091 for (parm
= parms
, nparms
= 0; parm
; parm
= next
, nparms
++)
3093 next
= TREE_CHAIN (parm
);
3094 TREE_VEC_ELT (saved_parmlist
, nparms
) = parm
;
3095 TREE_CHAIN (parm
) = NULL_TREE
;
3098 --processing_template_parmlist
;
3100 return saved_parmlist
;
3103 /* end_template_decl is called after a template declaration is seen. */
3106 end_template_decl (void)
3108 reset_specialization ();
3110 if (! processing_template_decl
)
3113 /* This matches the pushlevel in begin_template_parm_list. */
3116 --processing_template_decl
;
3117 current_template_parms
= TREE_CHAIN (current_template_parms
);
3120 /* Within the declaration of a template, return all levels of template
3121 parameters that apply. The template parameters are represented as
3122 a TREE_VEC, in the form documented in cp-tree.h for template
3126 current_template_args (void)
3129 tree args
= NULL_TREE
;
3130 int length
= TMPL_PARMS_DEPTH (current_template_parms
);
3133 /* If there is only one level of template parameters, we do not
3134 create a TREE_VEC of TREE_VECs. Instead, we return a single
3135 TREE_VEC containing the arguments. */
3137 args
= make_tree_vec (length
);
3139 for (header
= current_template_parms
; header
; header
= TREE_CHAIN (header
))
3141 tree a
= copy_node (TREE_VALUE (header
));
3144 TREE_TYPE (a
) = NULL_TREE
;
3145 for (i
= TREE_VEC_LENGTH (a
) - 1; i
>= 0; --i
)
3147 tree t
= TREE_VEC_ELT (a
, i
);
3149 /* T will be a list if we are called from within a
3150 begin/end_template_parm_list pair, but a vector directly
3151 if within a begin/end_member_template_processing pair. */
3152 if (TREE_CODE (t
) == TREE_LIST
)
3156 if (!error_operand_p (t
))
3158 if (TREE_CODE (t
) == TYPE_DECL
3159 || TREE_CODE (t
) == TEMPLATE_DECL
)
3163 if (TEMPLATE_TYPE_PARAMETER_PACK (t
))
3165 /* Turn this argument into a TYPE_ARGUMENT_PACK
3166 with a single element, which expands T. */
3167 tree vec
= make_tree_vec (1);
3168 TREE_VEC_ELT (vec
, 0) = make_pack_expansion (t
);
3170 t
= make_node (TYPE_ARGUMENT_PACK
);
3171 SET_ARGUMENT_PACK_ARGS (t
, vec
);
3176 t
= DECL_INITIAL (t
);
3178 if (TEMPLATE_PARM_PARAMETER_PACK (t
))
3180 /* Turn this argument into a NONTYPE_ARGUMENT_PACK
3181 with a single element, which expands T. */
3182 tree vec
= make_tree_vec (1);
3183 tree type
= TREE_TYPE (TEMPLATE_PARM_DECL (t
));
3184 TREE_VEC_ELT (vec
, 0) = make_pack_expansion (t
);
3186 t
= make_node (NONTYPE_ARGUMENT_PACK
);
3187 SET_ARGUMENT_PACK_ARGS (t
, vec
);
3188 TREE_TYPE (t
) = type
;
3191 TREE_VEC_ELT (a
, i
) = t
;
3197 TREE_VEC_ELT (args
, --l
) = a
;
3205 /* Return a TEMPLATE_DECL corresponding to DECL, using the indicated
3206 template PARMS. If MEMBER_TEMPLATE_P is true, the new template is
3207 a member template. Used by push_template_decl below. */
3210 build_template_decl (tree decl
, tree parms
, bool member_template_p
)
3212 tree tmpl
= build_lang_decl (TEMPLATE_DECL
, DECL_NAME (decl
), NULL_TREE
);
3213 DECL_TEMPLATE_PARMS (tmpl
) = parms
;
3214 DECL_CONTEXT (tmpl
) = DECL_CONTEXT (decl
);
3215 DECL_MEMBER_TEMPLATE_P (tmpl
) = member_template_p
;
3216 if (DECL_LANG_SPECIFIC (decl
))
3218 DECL_STATIC_FUNCTION_P (tmpl
) = DECL_STATIC_FUNCTION_P (decl
);
3219 DECL_CONSTRUCTOR_P (tmpl
) = DECL_CONSTRUCTOR_P (decl
);
3220 DECL_DESTRUCTOR_P (tmpl
) = DECL_DESTRUCTOR_P (decl
);
3221 DECL_NONCONVERTING_P (tmpl
) = DECL_NONCONVERTING_P (decl
);
3222 DECL_ASSIGNMENT_OPERATOR_P (tmpl
) = DECL_ASSIGNMENT_OPERATOR_P (decl
);
3223 if (DECL_OVERLOADED_OPERATOR_P (decl
))
3224 SET_OVERLOADED_OPERATOR_CODE (tmpl
,
3225 DECL_OVERLOADED_OPERATOR_P (decl
));
3231 struct template_parm_data
3233 /* The level of the template parameters we are currently
3237 /* The index of the specialization argument we are currently
3241 /* An array whose size is the number of template parameters. The
3242 elements are nonzero if the parameter has been used in any one
3243 of the arguments processed so far. */
3246 /* An array whose size is the number of template arguments. The
3247 elements are nonzero if the argument makes use of template
3248 parameters of this level. */
3249 int* arg_uses_template_parms
;
3252 /* Subroutine of push_template_decl used to see if each template
3253 parameter in a partial specialization is used in the explicit
3254 argument list. If T is of the LEVEL given in DATA (which is
3255 treated as a template_parm_data*), then DATA->PARMS is marked
3259 mark_template_parm (tree t
, void* data
)
3263 struct template_parm_data
* tpd
= (struct template_parm_data
*) data
;
3265 if (TREE_CODE (t
) == TEMPLATE_PARM_INDEX
)
3267 level
= TEMPLATE_PARM_LEVEL (t
);
3268 idx
= TEMPLATE_PARM_IDX (t
);
3272 level
= TEMPLATE_TYPE_LEVEL (t
);
3273 idx
= TEMPLATE_TYPE_IDX (t
);
3276 if (level
== tpd
->level
)
3278 tpd
->parms
[idx
] = 1;
3279 tpd
->arg_uses_template_parms
[tpd
->current_arg
] = 1;
3282 /* Return zero so that for_each_template_parm will continue the
3283 traversal of the tree; we want to mark *every* template parm. */
3287 /* Process the partial specialization DECL. */
3290 process_partial_specialization (tree decl
)
3292 tree type
= TREE_TYPE (decl
);
3293 tree maintmpl
= CLASSTYPE_TI_TEMPLATE (type
);
3294 tree specargs
= CLASSTYPE_TI_ARGS (type
);
3295 tree inner_args
= INNERMOST_TEMPLATE_ARGS (specargs
);
3296 tree main_inner_parms
= DECL_INNERMOST_TEMPLATE_PARMS (maintmpl
);
3298 int nargs
= TREE_VEC_LENGTH (inner_args
);
3301 int did_error_intro
= 0;
3302 struct template_parm_data tpd
;
3303 struct template_parm_data tpd2
;
3305 gcc_assert (current_template_parms
);
3307 inner_parms
= INNERMOST_TEMPLATE_PARMS (current_template_parms
);
3308 ntparms
= TREE_VEC_LENGTH (inner_parms
);
3310 /* We check that each of the template parameters given in the
3311 partial specialization is used in the argument list to the
3312 specialization. For example:
3314 template <class T> struct S;
3315 template <class T> struct S<T*>;
3317 The second declaration is OK because `T*' uses the template
3318 parameter T, whereas
3320 template <class T> struct S<int>;
3322 is no good. Even trickier is:
3333 The S2<T> declaration is actually invalid; it is a
3334 full-specialization. Of course,
3337 struct S2<T (*)(U)>;
3339 or some such would have been OK. */
3340 tpd
.level
= TMPL_PARMS_DEPTH (current_template_parms
);
3341 tpd
.parms
= (int *) alloca (sizeof (int) * ntparms
);
3342 memset (tpd
.parms
, 0, sizeof (int) * ntparms
);
3344 tpd
.arg_uses_template_parms
= (int *) alloca (sizeof (int) * nargs
);
3345 memset (tpd
.arg_uses_template_parms
, 0, sizeof (int) * nargs
);
3346 for (i
= 0; i
< nargs
; ++i
)
3348 tpd
.current_arg
= i
;
3349 for_each_template_parm (TREE_VEC_ELT (inner_args
, i
),
3350 &mark_template_parm
,
3353 /*include_nondeduced_p=*/false);
3355 for (i
= 0; i
< ntparms
; ++i
)
3356 if (tpd
.parms
[i
] == 0)
3358 /* One of the template parms was not used in the
3360 if (!did_error_intro
)
3362 error ("template parameters not used in partial specialization:");
3363 did_error_intro
= 1;
3366 error (" %qD", TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
)));
3369 /* [temp.class.spec]
3371 The argument list of the specialization shall not be identical to
3372 the implicit argument list of the primary template. */
3373 if (comp_template_args
3375 INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE
3377 error ("partial specialization %qT does not specialize any template arguments", type
);
3379 /* [temp.class.spec]
3381 A partially specialized non-type argument expression shall not
3382 involve template parameters of the partial specialization except
3383 when the argument expression is a simple identifier.
3385 The type of a template parameter corresponding to a specialized
3386 non-type argument shall not be dependent on a parameter of the
3389 Also, we verify that pack expansions only occur at the
3390 end of the argument list. */
3391 gcc_assert (nargs
== DECL_NTPARMS (maintmpl
));
3393 for (i
= 0; i
< nargs
; ++i
)
3395 tree parm
= TREE_VALUE (TREE_VEC_ELT (main_inner_parms
, i
));
3396 tree arg
= TREE_VEC_ELT (inner_args
, i
);
3397 tree packed_args
= NULL_TREE
;
3400 if (ARGUMENT_PACK_P (arg
))
3402 /* Extract the arguments from the argument pack. We'll be
3403 iterating over these in the following loop. */
3404 packed_args
= ARGUMENT_PACK_ARGS (arg
);
3405 len
= TREE_VEC_LENGTH (packed_args
);
3408 for (j
= 0; j
< len
; j
++)
3411 /* Get the Jth argument in the parameter pack. */
3412 arg
= TREE_VEC_ELT (packed_args
, j
);
3414 if (PACK_EXPANSION_P (arg
))
3416 /* Pack expansions must come at the end of the
3418 if ((packed_args
&& j
< len
- 1)
3419 || (!packed_args
&& i
< nargs
- 1))
3421 if (TREE_CODE (arg
) == EXPR_PACK_EXPANSION
)
3422 error ("parameter pack argument %qE must be at the end of the template argument list", arg
);
3424 error ("parameter pack argument %qT must be at the end of the template argument list", arg
);
3427 TREE_VEC_ELT (packed_args
, j
) = error_mark_node
;
3431 if (TREE_CODE (arg
) == EXPR_PACK_EXPANSION
)
3432 /* We only care about the pattern. */
3433 arg
= PACK_EXPANSION_PATTERN (arg
);
3435 if (/* These first two lines are the `non-type' bit. */
3437 && TREE_CODE (arg
) != TEMPLATE_DECL
3438 /* This next line is the `argument expression is not just a
3439 simple identifier' condition and also the `specialized
3440 non-type argument' bit. */
3441 && TREE_CODE (arg
) != TEMPLATE_PARM_INDEX
)
3443 if ((!packed_args
&& tpd
.arg_uses_template_parms
[i
])
3444 || (packed_args
&& uses_template_parms (arg
)))
3445 error ("template argument %qE involves template parameter(s)",
3449 /* Look at the corresponding template parameter,
3450 marking which template parameters its type depends
3452 tree type
= TREE_TYPE (parm
);
3456 /* We haven't yet initialized TPD2. Do so now. */
3457 tpd2
.arg_uses_template_parms
3458 = (int *) alloca (sizeof (int) * nargs
);
3459 /* The number of parameters here is the number in the
3460 main template, which, as checked in the assertion
3462 tpd2
.parms
= (int *) alloca (sizeof (int) * nargs
);
3464 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (maintmpl
));
3467 /* Mark the template parameters. But this time, we're
3468 looking for the template parameters of the main
3469 template, not in the specialization. */
3470 tpd2
.current_arg
= i
;
3471 tpd2
.arg_uses_template_parms
[i
] = 0;
3472 memset (tpd2
.parms
, 0, sizeof (int) * nargs
);
3473 for_each_template_parm (type
,
3474 &mark_template_parm
,
3477 /*include_nondeduced_p=*/false);
3479 if (tpd2
.arg_uses_template_parms
[i
])
3481 /* The type depended on some template parameters.
3482 If they are fully specialized in the
3483 specialization, that's OK. */
3485 for (j
= 0; j
< nargs
; ++j
)
3486 if (tpd2
.parms
[j
] != 0
3487 && tpd
.arg_uses_template_parms
[j
])
3489 error ("type %qT of template argument %qE depends "
3490 "on template parameter(s)",
3501 if (retrieve_specialization (maintmpl
, specargs
,
3502 /*class_specializations_p=*/true))
3503 /* We've already got this specialization. */
3506 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)
3507 = tree_cons (specargs
, inner_parms
,
3508 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
));
3509 TREE_TYPE (DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)) = type
;
3513 /* Check that a template declaration's use of default arguments and
3514 parameter packs is not invalid. Here, PARMS are the template
3515 parameters. IS_PRIMARY is nonzero if DECL is the thing declared by
3516 a primary template. IS_PARTIAL is nonzero if DECL is a partial
3520 IS_FRIEND_DECL is nonzero if DECL is a friend function template
3521 declaration (but not a definition); 1 indicates a declaration, 2
3522 indicates a redeclaration. When IS_FRIEND_DECL=2, no errors are
3523 emitted for extraneous default arguments.
3525 Returns TRUE if there were no errors found, FALSE otherwise. */
3528 check_default_tmpl_args (tree decl
, tree parms
, int is_primary
,
3529 int is_partial
, int is_friend_decl
)
3532 int last_level_to_check
;
3534 bool no_errors
= true;
3538 A default template-argument shall not be specified in a
3539 function template declaration or a function template definition, nor
3540 in the template-parameter-list of the definition of a member of a
3543 if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == FUNCTION_DECL
)
3544 /* You can't have a function template declaration in a local
3545 scope, nor you can you define a member of a class template in a
3549 if (current_class_type
3550 && !TYPE_BEING_DEFINED (current_class_type
)
3551 && DECL_LANG_SPECIFIC (decl
)
3552 /* If this is either a friend defined in the scope of the class
3553 or a member function. */
3554 && (DECL_FUNCTION_MEMBER_P (decl
)
3555 ? same_type_p (DECL_CONTEXT (decl
), current_class_type
)
3556 : DECL_FRIEND_CONTEXT (decl
)
3557 ? same_type_p (DECL_FRIEND_CONTEXT (decl
), current_class_type
)
3559 /* And, if it was a member function, it really was defined in
3560 the scope of the class. */
3561 && (!DECL_FUNCTION_MEMBER_P (decl
)
3562 || DECL_INITIALIZED_IN_CLASS_P (decl
)))
3563 /* We already checked these parameters when the template was
3564 declared, so there's no need to do it again now. This function
3565 was defined in class scope, but we're processing it's body now
3566 that the class is complete. */
3569 /* Core issue 226 (C++0x only): the following only applies to class
3571 if ((cxx_dialect
== cxx98
) || TREE_CODE (decl
) != FUNCTION_DECL
)
3575 If a template-parameter has a default template-argument, all
3576 subsequent template-parameters shall have a default
3577 template-argument supplied. */
3578 for (parm_level
= parms
; parm_level
; parm_level
= TREE_CHAIN (parm_level
))
3580 tree inner_parms
= TREE_VALUE (parm_level
);
3581 int ntparms
= TREE_VEC_LENGTH (inner_parms
);
3582 int seen_def_arg_p
= 0;
3585 for (i
= 0; i
< ntparms
; ++i
)
3587 tree parm
= TREE_VEC_ELT (inner_parms
, i
);
3589 if (parm
== error_mark_node
)
3592 if (TREE_PURPOSE (parm
))
3594 else if (seen_def_arg_p
3595 && !template_parameter_pack_p (TREE_VALUE (parm
)))
3597 error ("no default argument for %qD", TREE_VALUE (parm
));
3598 /* For better subsequent error-recovery, we indicate that
3599 there should have been a default argument. */
3600 TREE_PURPOSE (parm
) = error_mark_node
;
3606 /* Don't complain about an enclosing partial
3608 && parm_level
== parms
3609 && TREE_CODE (decl
) == TYPE_DECL
3611 && template_parameter_pack_p (TREE_VALUE (parm
)))
3613 /* A primary class template can only have one
3614 parameter pack, at the end of the template
3617 if (TREE_CODE (TREE_VALUE (parm
)) == PARM_DECL
)
3618 error ("parameter pack %qE must be at the end of the"
3619 " template parameter list", TREE_VALUE (parm
));
3621 error ("parameter pack %qT must be at the end of the"
3622 " template parameter list",
3623 TREE_TYPE (TREE_VALUE (parm
)));
3625 TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
))
3633 if (((cxx_dialect
== cxx98
) && TREE_CODE (decl
) != TYPE_DECL
)
3637 /* For an ordinary class template, default template arguments are
3638 allowed at the innermost level, e.g.:
3639 template <class T = int>
3641 but, in a partial specialization, they're not allowed even
3642 there, as we have in [temp.class.spec]:
3644 The template parameter list of a specialization shall not
3645 contain default template argument values.
3647 So, for a partial specialization, or for a function template
3648 (in C++98/C++03), we look at all of them. */
3651 /* But, for a primary class template that is not a partial
3652 specialization we look at all template parameters except the
3654 parms
= TREE_CHAIN (parms
);
3656 /* Figure out what error message to issue. */
3657 if (is_friend_decl
== 2)
3658 msg
= "default template arguments may not be used in function template friend re-declaration";
3659 else if (is_friend_decl
)
3660 msg
= "default template arguments may not be used in function template friend declarations";
3661 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& (cxx_dialect
== cxx98
))
3662 msg
= "default template arguments may not be used in function templates";
3663 else if (is_partial
)
3664 msg
= "default template arguments may not be used in partial specializations";
3666 msg
= "default argument for template parameter for class enclosing %qD";
3668 if (current_class_type
&& TYPE_BEING_DEFINED (current_class_type
))
3669 /* If we're inside a class definition, there's no need to
3670 examine the parameters to the class itself. On the one
3671 hand, they will be checked when the class is defined, and,
3672 on the other, default arguments are valid in things like:
3673 template <class T = double>
3674 struct S { template <class U> void f(U); };
3675 Here the default argument for `S' has no bearing on the
3676 declaration of `f'. */
3677 last_level_to_check
= template_class_depth (current_class_type
) + 1;
3679 /* Check everything. */
3680 last_level_to_check
= 0;
3682 for (parm_level
= parms
;
3683 parm_level
&& TMPL_PARMS_DEPTH (parm_level
) >= last_level_to_check
;
3684 parm_level
= TREE_CHAIN (parm_level
))
3686 tree inner_parms
= TREE_VALUE (parm_level
);
3690 ntparms
= TREE_VEC_LENGTH (inner_parms
);
3691 for (i
= 0; i
< ntparms
; ++i
)
3693 if (TREE_VEC_ELT (inner_parms
, i
) == error_mark_node
)
3696 if (TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)))
3701 if (is_friend_decl
== 2)
3708 /* Clear out the default argument so that we are not
3710 TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)) = NULL_TREE
;
3714 /* At this point, if we're still interested in issuing messages,
3715 they must apply to classes surrounding the object declared. */
3717 msg
= "default argument for template parameter for class enclosing %qD";
3723 /* Worker for push_template_decl_real, called via
3724 for_each_template_parm. DATA is really an int, indicating the
3725 level of the parameters we are interested in. If T is a template
3726 parameter of that level, return nonzero. */
3729 template_parm_this_level_p (tree t
, void* data
)
3731 int this_level
= *(int *)data
;
3734 if (TREE_CODE (t
) == TEMPLATE_PARM_INDEX
)
3735 level
= TEMPLATE_PARM_LEVEL (t
);
3737 level
= TEMPLATE_TYPE_LEVEL (t
);
3738 return level
== this_level
;
3741 /* Creates a TEMPLATE_DECL for the indicated DECL using the template
3742 parameters given by current_template_args, or reuses a
3743 previously existing one, if appropriate. Returns the DECL, or an
3744 equivalent one, if it is replaced via a call to duplicate_decls.
3746 If IS_FRIEND is true, DECL is a friend declaration. */
3749 push_template_decl_real (tree decl
, bool is_friend
)
3757 int new_template_p
= 0;
3758 /* True if the template is a member template, in the sense of
3760 bool member_template_p
= false;
3762 if (decl
== error_mark_node
|| !current_template_parms
)
3763 return error_mark_node
;
3765 /* See if this is a partial specialization. */
3766 is_partial
= (DECL_IMPLICIT_TYPEDEF_P (decl
)
3767 && TREE_CODE (TREE_TYPE (decl
)) != ENUMERAL_TYPE
3768 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)));
3770 if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_FRIEND_P (decl
))
3774 /* For a friend, we want the context of the friend function, not
3775 the type of which it is a friend. */
3776 ctx
= DECL_CONTEXT (decl
);
3777 else if (CP_DECL_CONTEXT (decl
)
3778 && TREE_CODE (CP_DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
3779 /* In the case of a virtual function, we want the class in which
3781 ctx
= CP_DECL_CONTEXT (decl
);
3783 /* Otherwise, if we're currently defining some class, the DECL
3784 is assumed to be a member of the class. */
3785 ctx
= current_scope ();
3787 if (ctx
&& TREE_CODE (ctx
) == NAMESPACE_DECL
)
3790 if (!DECL_CONTEXT (decl
))
3791 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
3793 /* See if this is a primary template. */
3794 if (is_friend
&& ctx
)
3795 /* A friend template that specifies a class context, i.e.
3796 template <typename T> friend void A<T>::f();
3800 primary
= template_parm_scope_p ();
3804 if (DECL_CLASS_SCOPE_P (decl
))
3805 member_template_p
= true;
3806 if (TREE_CODE (decl
) == TYPE_DECL
3807 && ANON_AGGRNAME_P (DECL_NAME (decl
)))
3809 error ("template class without a name");
3810 return error_mark_node
;
3812 else if (TREE_CODE (decl
) == FUNCTION_DECL
)
3814 if (DECL_DESTRUCTOR_P (decl
))
3818 A destructor shall not be a member template. */
3819 error ("destructor %qD declared as member template", decl
);
3820 return error_mark_node
;
3822 if (NEW_DELETE_OPNAME_P (DECL_NAME (decl
))
3823 && (!TYPE_ARG_TYPES (TREE_TYPE (decl
))
3824 || TYPE_ARG_TYPES (TREE_TYPE (decl
)) == void_list_node
3825 || !TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)))
3826 || (TREE_CHAIN (TYPE_ARG_TYPES ((TREE_TYPE (decl
))))
3827 == void_list_node
)))
3829 /* [basic.stc.dynamic.allocation]
3831 An allocation function can be a function
3832 template. ... Template allocation functions shall
3833 have two or more parameters. */
3834 error ("invalid template declaration of %qD", decl
);
3835 return error_mark_node
;
3838 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
3839 && CLASS_TYPE_P (TREE_TYPE (decl
)))
3843 error ("template declaration of %q#D", decl
);
3844 return error_mark_node
;
3848 /* Check to see that the rules regarding the use of default
3849 arguments are not being violated. */
3850 check_default_tmpl_args (decl
, current_template_parms
,
3851 primary
, is_partial
, /*is_friend_decl=*/0);
3853 /* Ensure that there are no parameter packs in the type of this
3854 declaration that have not been expanded. */
3855 if (TREE_CODE (decl
) == FUNCTION_DECL
)
3857 /* Check each of the arguments individually to see if there are
3858 any bare parameter packs. */
3859 tree type
= TREE_TYPE (decl
);
3860 tree arg
= DECL_ARGUMENTS (decl
);
3861 tree argtype
= TYPE_ARG_TYPES (type
);
3863 while (arg
&& argtype
)
3865 if (!FUNCTION_PARAMETER_PACK_P (arg
)
3866 && check_for_bare_parameter_packs (TREE_TYPE (arg
)))
3868 /* This is a PARM_DECL that contains unexpanded parameter
3869 packs. We have already complained about this in the
3870 check_for_bare_parameter_packs call, so just replace
3871 these types with ERROR_MARK_NODE. */
3872 TREE_TYPE (arg
) = error_mark_node
;
3873 TREE_VALUE (argtype
) = error_mark_node
;
3876 arg
= TREE_CHAIN (arg
);
3877 argtype
= TREE_CHAIN (argtype
);
3880 /* Check for bare parameter packs in the return type and the
3881 exception specifiers. */
3882 if (check_for_bare_parameter_packs (TREE_TYPE (type
)))
3883 /* Errors were already issued, set return type to int
3884 as the frontend doesn't expect error_mark_node as
3886 TREE_TYPE (type
) = integer_type_node
;
3887 if (check_for_bare_parameter_packs (TYPE_RAISES_EXCEPTIONS (type
)))
3888 TYPE_RAISES_EXCEPTIONS (type
) = NULL_TREE
;
3890 else if (check_for_bare_parameter_packs (TREE_TYPE (decl
)))
3892 TREE_TYPE (decl
) = error_mark_node
;
3893 return error_mark_node
;
3897 return process_partial_specialization (decl
);
3899 args
= current_template_args ();
3902 || TREE_CODE (ctx
) == FUNCTION_DECL
3903 || (CLASS_TYPE_P (ctx
) && TYPE_BEING_DEFINED (ctx
))
3904 || (is_friend
&& !DECL_TEMPLATE_INFO (decl
)))
3906 if (DECL_LANG_SPECIFIC (decl
)
3907 && DECL_TEMPLATE_INFO (decl
)
3908 && DECL_TI_TEMPLATE (decl
))
3909 tmpl
= DECL_TI_TEMPLATE (decl
);
3910 /* If DECL is a TYPE_DECL for a class-template, then there won't
3911 be DECL_LANG_SPECIFIC. The information equivalent to
3912 DECL_TEMPLATE_INFO is found in TYPE_TEMPLATE_INFO instead. */
3913 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
3914 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl
))
3915 && TYPE_TI_TEMPLATE (TREE_TYPE (decl
)))
3917 /* Since a template declaration already existed for this
3918 class-type, we must be redeclaring it here. Make sure
3919 that the redeclaration is valid. */
3920 redeclare_class_template (TREE_TYPE (decl
),
3921 current_template_parms
);
3922 /* We don't need to create a new TEMPLATE_DECL; just use the
3923 one we already had. */
3924 tmpl
= TYPE_TI_TEMPLATE (TREE_TYPE (decl
));
3928 tmpl
= build_template_decl (decl
, current_template_parms
,
3932 if (DECL_LANG_SPECIFIC (decl
)
3933 && DECL_TEMPLATE_SPECIALIZATION (decl
))
3935 /* A specialization of a member template of a template
3937 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
3938 DECL_TEMPLATE_INFO (tmpl
) = DECL_TEMPLATE_INFO (decl
);
3939 DECL_TEMPLATE_INFO (decl
) = NULL_TREE
;
3945 tree a
, t
, current
, parms
;
3947 tree tinfo
= get_template_info (decl
);
3951 error ("template definition of non-template %q#D", decl
);
3952 return error_mark_node
;
3955 tmpl
= TI_TEMPLATE (tinfo
);
3957 if (DECL_FUNCTION_TEMPLATE_P (tmpl
)
3958 && DECL_TEMPLATE_INFO (decl
) && DECL_TI_ARGS (decl
)
3959 && DECL_TEMPLATE_SPECIALIZATION (decl
)
3960 && DECL_MEMBER_TEMPLATE_P (tmpl
))
3964 /* The declaration is a specialization of a member
3965 template, declared outside the class. Therefore, the
3966 innermost template arguments will be NULL, so we
3967 replace them with the arguments determined by the
3968 earlier call to check_explicit_specialization. */
3969 args
= DECL_TI_ARGS (decl
);
3972 = build_template_decl (decl
, current_template_parms
,
3974 DECL_TEMPLATE_RESULT (new_tmpl
) = decl
;
3975 TREE_TYPE (new_tmpl
) = TREE_TYPE (decl
);
3976 DECL_TI_TEMPLATE (decl
) = new_tmpl
;
3977 SET_DECL_TEMPLATE_SPECIALIZATION (new_tmpl
);
3978 DECL_TEMPLATE_INFO (new_tmpl
)
3979 = tree_cons (tmpl
, args
, NULL_TREE
);
3981 register_specialization (new_tmpl
,
3982 most_general_template (tmpl
),
3988 /* Make sure the template headers we got make sense. */
3990 parms
= DECL_TEMPLATE_PARMS (tmpl
);
3991 i
= TMPL_PARMS_DEPTH (parms
);
3992 if (TMPL_ARGS_DEPTH (args
) != i
)
3994 error ("expected %d levels of template parms for %q#D, got %d",
3995 i
, decl
, TMPL_ARGS_DEPTH (args
));
3998 for (current
= decl
; i
> 0; --i
, parms
= TREE_CHAIN (parms
))
4000 a
= TMPL_ARGS_LEVEL (args
, i
);
4001 t
= INNERMOST_TEMPLATE_PARMS (parms
);
4003 if (TREE_VEC_LENGTH (t
) != TREE_VEC_LENGTH (a
))
4005 if (current
== decl
)
4006 error ("got %d template parameters for %q#D",
4007 TREE_VEC_LENGTH (a
), decl
);
4009 error ("got %d template parameters for %q#T",
4010 TREE_VEC_LENGTH (a
), current
);
4011 error (" but %d required", TREE_VEC_LENGTH (t
));
4012 return error_mark_node
;
4015 if (current
== decl
)
4018 current
= (TYPE_P (current
)
4019 ? TYPE_CONTEXT (current
)
4020 : DECL_CONTEXT (current
));
4023 /* Check that the parms are used in the appropriate qualifying scopes
4024 in the declarator. */
4025 if (!comp_template_args
4027 TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (tmpl
)))))
4030 template arguments to %qD do not match original template %qD",
4031 decl
, DECL_TEMPLATE_RESULT (tmpl
));
4032 if (!uses_template_parms (TI_ARGS (tinfo
)))
4033 inform (input_location
, "use template<> for an explicit specialization");
4034 /* Avoid crash in import_export_decl. */
4035 DECL_INTERFACE_KNOWN (decl
) = 1;
4036 return error_mark_node
;
4040 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
4041 TREE_TYPE (tmpl
) = TREE_TYPE (decl
);
4043 /* Push template declarations for global functions and types. Note
4044 that we do not try to push a global template friend declared in a
4045 template class; such a thing may well depend on the template
4046 parameters of the class. */
4047 if (new_template_p
&& !ctx
4048 && !(is_friend
&& template_class_depth (current_class_type
) > 0))
4050 tmpl
= pushdecl_namespace_level (tmpl
, is_friend
);
4051 if (tmpl
== error_mark_node
)
4052 return error_mark_node
;
4054 /* Hide template friend classes that haven't been declared yet. */
4055 if (is_friend
&& TREE_CODE (decl
) == TYPE_DECL
)
4057 DECL_ANTICIPATED (tmpl
) = 1;
4058 DECL_FRIEND_P (tmpl
) = 1;
4064 tree parms
= DECL_TEMPLATE_PARMS (tmpl
);
4067 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
4068 if (DECL_CONV_FN_P (tmpl
))
4070 int depth
= TMPL_PARMS_DEPTH (parms
);
4072 /* It is a conversion operator. See if the type converted to
4073 depends on innermost template operands. */
4075 if (uses_template_parms_level (TREE_TYPE (TREE_TYPE (tmpl
)),
4077 DECL_TEMPLATE_CONV_FN_P (tmpl
) = 1;
4080 /* Give template template parms a DECL_CONTEXT of the template
4081 for which they are a parameter. */
4082 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
4083 for (i
= TREE_VEC_LENGTH (parms
) - 1; i
>= 0; --i
)
4085 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
4086 if (TREE_CODE (parm
) == TEMPLATE_DECL
)
4087 DECL_CONTEXT (parm
) = tmpl
;
4091 /* The DECL_TI_ARGS of DECL contains full set of arguments referring
4092 back to its most general template. If TMPL is a specialization,
4093 ARGS may only have the innermost set of arguments. Add the missing
4094 argument levels if necessary. */
4095 if (DECL_TEMPLATE_INFO (tmpl
))
4096 args
= add_outermost_template_args (DECL_TI_ARGS (tmpl
), args
);
4098 info
= tree_cons (tmpl
, args
, NULL_TREE
);
4100 if (DECL_IMPLICIT_TYPEDEF_P (decl
))
4101 SET_TYPE_TEMPLATE_INFO (TREE_TYPE (tmpl
), info
);
4102 else if (DECL_LANG_SPECIFIC (decl
))
4103 DECL_TEMPLATE_INFO (decl
) = info
;
4105 return DECL_TEMPLATE_RESULT (tmpl
);
4109 push_template_decl (tree decl
)
4111 return push_template_decl_real (decl
, false);
4114 /* Called when a class template TYPE is redeclared with the indicated
4115 template PARMS, e.g.:
4117 template <class T> struct S;
4118 template <class T> struct S {}; */
4121 redeclare_class_template (tree type
, tree parms
)
4127 if (!TYPE_TEMPLATE_INFO (type
))
4129 error ("%qT is not a template type", type
);
4133 tmpl
= TYPE_TI_TEMPLATE (type
);
4134 if (!PRIMARY_TEMPLATE_P (tmpl
))
4135 /* The type is nested in some template class. Nothing to worry
4136 about here; there are no new template parameters for the nested
4142 error ("template specifiers not specified in declaration of %qD",
4147 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
4148 tmpl_parms
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl
);
4150 if (TREE_VEC_LENGTH (parms
) != TREE_VEC_LENGTH (tmpl_parms
))
4152 error ("redeclared with %d template parameter(s)",
4153 TREE_VEC_LENGTH (parms
));
4154 inform (input_location
, "previous declaration %q+D used %d template parameter(s)",
4155 tmpl
, TREE_VEC_LENGTH (tmpl_parms
));
4159 for (i
= 0; i
< TREE_VEC_LENGTH (tmpl_parms
); ++i
)
4166 if (TREE_VEC_ELT (tmpl_parms
, i
) == error_mark_node
4167 || TREE_VEC_ELT (parms
, i
) == error_mark_node
)
4170 tmpl_parm
= TREE_VALUE (TREE_VEC_ELT (tmpl_parms
, i
));
4171 parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
4172 tmpl_default
= TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
));
4173 parm_default
= TREE_PURPOSE (TREE_VEC_ELT (parms
, i
));
4175 /* TMPL_PARM and PARM can be either TYPE_DECL, PARM_DECL, or
4177 if (tmpl_parm
!= error_mark_node
4178 && (TREE_CODE (tmpl_parm
) != TREE_CODE (parm
)
4179 || (TREE_CODE (tmpl_parm
) != TYPE_DECL
4180 && !same_type_p (TREE_TYPE (tmpl_parm
), TREE_TYPE (parm
)))
4181 || (TREE_CODE (tmpl_parm
) != PARM_DECL
4182 && (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (tmpl_parm
))
4183 != TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
))))
4184 || (TREE_CODE (tmpl_parm
) == PARM_DECL
4185 && (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (tmpl_parm
))
4186 != TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
))))))
4188 error ("template parameter %q+#D", tmpl_parm
);
4189 error ("redeclared here as %q#D", parm
);
4193 if (tmpl_default
!= NULL_TREE
&& parm_default
!= NULL_TREE
)
4195 /* We have in [temp.param]:
4197 A template-parameter may not be given default arguments
4198 by two different declarations in the same scope. */
4199 error ("redefinition of default argument for %q#D", parm
);
4200 inform (input_location
, "%Joriginal definition appeared here", tmpl_parm
);
4204 if (parm_default
!= NULL_TREE
)
4205 /* Update the previous template parameters (which are the ones
4206 that will really count) with the new default value. */
4207 TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
)) = parm_default
;
4208 else if (tmpl_default
!= NULL_TREE
)
4209 /* Update the new parameters, too; they'll be used as the
4210 parameters for any members. */
4211 TREE_PURPOSE (TREE_VEC_ELT (parms
, i
)) = tmpl_default
;
4217 /* Simplify EXPR if it is a non-dependent expression. Returns the
4218 (possibly simplified) expression. */
4221 fold_non_dependent_expr (tree expr
)
4223 if (expr
== NULL_TREE
)
4226 /* If we're in a template, but EXPR isn't value dependent, simplify
4227 it. We're supposed to treat:
4229 template <typename T> void f(T[1 + 1]);
4230 template <typename T> void f(T[2]);
4232 as two declarations of the same function, for example. */
4233 if (processing_template_decl
4234 && !type_dependent_expression_p (expr
)
4235 && !value_dependent_expression_p (expr
))
4237 HOST_WIDE_INT saved_processing_template_decl
;
4239 saved_processing_template_decl
= processing_template_decl
;
4240 processing_template_decl
= 0;
4241 expr
= tsubst_copy_and_build (expr
,
4244 /*in_decl=*/NULL_TREE
,
4245 /*function_p=*/false,
4246 /*integral_constant_expression_p=*/true);
4247 processing_template_decl
= saved_processing_template_decl
;
4252 /* EXPR is an expression which is used in a constant-expression context.
4253 For instance, it could be a VAR_DECL with a constant initializer.
4254 Extract the innermost constant expression.
4256 This is basically a more powerful version of
4257 integral_constant_value, which can be used also in templates where
4258 initializers can maintain a syntactic rather than semantic form
4259 (even if they are non-dependent, for access-checking purposes). */
4262 fold_decl_constant_value (tree expr
)
4264 tree const_expr
= expr
;
4267 expr
= fold_non_dependent_expr (const_expr
);
4268 const_expr
= integral_constant_value (expr
);
4270 while (expr
!= const_expr
);
4275 /* Subroutine of convert_nontype_argument. Converts EXPR to TYPE, which
4276 must be a function or a pointer-to-function type, as specified
4277 in [temp.arg.nontype]: disambiguate EXPR if it is an overload set,
4278 and check that the resulting function has external linkage. */
4281 convert_nontype_argument_function (tree type
, tree expr
)
4286 fn
= instantiate_type (type
, fns
, tf_none
);
4287 if (fn
== error_mark_node
)
4288 return error_mark_node
;
4291 if (TREE_CODE (fn_no_ptr
) == ADDR_EXPR
)
4292 fn_no_ptr
= TREE_OPERAND (fn_no_ptr
, 0);
4293 if (TREE_CODE (fn_no_ptr
) == BASELINK
)
4294 fn_no_ptr
= BASELINK_FUNCTIONS (fn_no_ptr
);
4296 /* [temp.arg.nontype]/1
4298 A template-argument for a non-type, non-template template-parameter
4301 -- the address of an object or function with external linkage. */
4302 if (!DECL_EXTERNAL_LINKAGE_P (fn_no_ptr
))
4304 error ("%qE is not a valid template argument for type %qT "
4305 "because function %qD has not external linkage",
4306 expr
, type
, fn_no_ptr
);
4313 /* Attempt to convert the non-type template parameter EXPR to the
4314 indicated TYPE. If the conversion is successful, return the
4315 converted value. If the conversion is unsuccessful, return
4316 NULL_TREE if we issued an error message, or error_mark_node if we
4317 did not. We issue error messages for out-and-out bad template
4318 parameters, but not simply because the conversion failed, since we
4319 might be just trying to do argument deduction. Both TYPE and EXPR
4320 must be non-dependent.
4322 The conversion follows the special rules described in
4323 [temp.arg.nontype], and it is much more strict than an implicit
4326 This function is called twice for each template argument (see
4327 lookup_template_class for a more accurate description of this
4328 problem). This means that we need to handle expressions which
4329 are not valid in a C++ source, but can be created from the
4330 first call (for instance, casts to perform conversions). These
4331 hacks can go away after we fix the double coercion problem. */
4334 convert_nontype_argument (tree type
, tree expr
)
4338 /* Detect immediately string literals as invalid non-type argument.
4339 This special-case is not needed for correctness (we would easily
4340 catch this later), but only to provide better diagnostic for this
4341 common user mistake. As suggested by DR 100, we do not mention
4342 linkage issues in the diagnostic as this is not the point. */
4343 if (TREE_CODE (expr
) == STRING_CST
)
4345 error ("%qE is not a valid template argument for type %qT "
4346 "because string literals can never be used in this context",
4351 /* If we are in a template, EXPR may be non-dependent, but still
4352 have a syntactic, rather than semantic, form. For example, EXPR
4353 might be a SCOPE_REF, rather than the VAR_DECL to which the
4354 SCOPE_REF refers. Preserving the qualifying scope is necessary
4355 so that access checking can be performed when the template is
4356 instantiated -- but here we need the resolved form so that we can
4357 convert the argument. */
4358 expr
= fold_non_dependent_expr (expr
);
4359 if (error_operand_p (expr
))
4360 return error_mark_node
;
4361 expr_type
= TREE_TYPE (expr
);
4363 /* HACK: Due to double coercion, we can get a
4364 NOP_EXPR<REFERENCE_TYPE>(ADDR_EXPR<POINTER_TYPE> (arg)) here,
4365 which is the tree that we built on the first call (see
4366 below when coercing to reference to object or to reference to
4367 function). We just strip everything and get to the arg.
4368 See g++.old-deja/g++.oliva/template4.C and g++.dg/template/nontype9.C
4370 if (TREE_CODE (expr
) == NOP_EXPR
)
4372 if (TYPE_REF_OBJ_P (type
) || TYPE_REFFN_P (type
))
4374 /* ??? Maybe we could use convert_from_reference here, but we
4375 would need to relax its constraints because the NOP_EXPR
4376 could actually change the type to something more cv-qualified,
4377 and this is not folded by convert_from_reference. */
4378 tree addr
= TREE_OPERAND (expr
, 0);
4379 gcc_assert (TREE_CODE (expr_type
) == REFERENCE_TYPE
);
4380 gcc_assert (TREE_CODE (addr
) == ADDR_EXPR
);
4381 gcc_assert (TREE_CODE (TREE_TYPE (addr
)) == POINTER_TYPE
);
4382 gcc_assert (same_type_ignoring_top_level_qualifiers_p
4383 (TREE_TYPE (expr_type
),
4384 TREE_TYPE (TREE_TYPE (addr
))));
4386 expr
= TREE_OPERAND (addr
, 0);
4387 expr_type
= TREE_TYPE (expr
);
4390 /* We could also generate a NOP_EXPR(ADDR_EXPR()) when the
4391 parameter is a pointer to object, through decay and
4392 qualification conversion. Let's strip everything. */
4393 else if (TYPE_PTROBV_P (type
))
4396 gcc_assert (TREE_CODE (expr
) == ADDR_EXPR
);
4397 gcc_assert (TREE_CODE (TREE_TYPE (expr
)) == POINTER_TYPE
);
4398 /* Skip the ADDR_EXPR only if it is part of the decay for
4399 an array. Otherwise, it is part of the original argument
4400 in the source code. */
4401 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (expr
, 0))) == ARRAY_TYPE
)
4402 expr
= TREE_OPERAND (expr
, 0);
4403 expr_type
= TREE_TYPE (expr
);
4407 /* [temp.arg.nontype]/5, bullet 1
4409 For a non-type template-parameter of integral or enumeration type,
4410 integral promotions (_conv.prom_) and integral conversions
4411 (_conv.integral_) are applied. */
4412 if (INTEGRAL_TYPE_P (type
))
4414 if (!INTEGRAL_TYPE_P (expr_type
))
4415 return error_mark_node
;
4417 expr
= fold_decl_constant_value (expr
);
4418 /* Notice that there are constant expressions like '4 % 0' which
4419 do not fold into integer constants. */
4420 if (TREE_CODE (expr
) != INTEGER_CST
)
4422 error ("%qE is not a valid template argument for type %qT "
4423 "because it is a non-constant expression", expr
, type
);
4427 /* At this point, an implicit conversion does what we want,
4428 because we already know that the expression is of integral
4430 expr
= ocp_convert (type
, expr
, CONV_IMPLICIT
, LOOKUP_PROTECT
);
4431 if (expr
== error_mark_node
)
4432 return error_mark_node
;
4434 /* Conversion was allowed: fold it to a bare integer constant. */
4437 /* [temp.arg.nontype]/5, bullet 2
4439 For a non-type template-parameter of type pointer to object,
4440 qualification conversions (_conv.qual_) and the array-to-pointer
4441 conversion (_conv.array_) are applied. */
4442 else if (TYPE_PTROBV_P (type
))
4444 /* [temp.arg.nontype]/1 (TC1 version, DR 49):
4446 A template-argument for a non-type, non-template template-parameter
4447 shall be one of: [...]
4449 -- the name of a non-type template-parameter;
4450 -- the address of an object or function with external linkage, [...]
4451 expressed as "& id-expression" where the & is optional if the name
4452 refers to a function or array, or if the corresponding
4453 template-parameter is a reference.
4455 Here, we do not care about functions, as they are invalid anyway
4456 for a parameter of type pointer-to-object. */
4458 if (DECL_P (expr
) && DECL_TEMPLATE_PARM_P (expr
))
4459 /* Non-type template parameters are OK. */
4461 else if (TREE_CODE (expr
) != ADDR_EXPR
4462 && TREE_CODE (expr_type
) != ARRAY_TYPE
)
4464 if (TREE_CODE (expr
) == VAR_DECL
)
4466 error ("%qD is not a valid template argument "
4467 "because %qD is a variable, not the address of "
4472 /* Other values, like integer constants, might be valid
4473 non-type arguments of some other type. */
4474 return error_mark_node
;
4480 decl
= ((TREE_CODE (expr
) == ADDR_EXPR
)
4481 ? TREE_OPERAND (expr
, 0) : expr
);
4482 if (TREE_CODE (decl
) != VAR_DECL
)
4484 error ("%qE is not a valid template argument of type %qT "
4485 "because %qE is not a variable",
4489 else if (!DECL_EXTERNAL_LINKAGE_P (decl
))
4491 error ("%qE is not a valid template argument of type %qT "
4492 "because %qD does not have external linkage",
4498 expr
= decay_conversion (expr
);
4499 if (expr
== error_mark_node
)
4500 return error_mark_node
;
4502 expr
= perform_qualification_conversions (type
, expr
);
4503 if (expr
== error_mark_node
)
4504 return error_mark_node
;
4506 /* [temp.arg.nontype]/5, bullet 3
4508 For a non-type template-parameter of type reference to object, no
4509 conversions apply. The type referred to by the reference may be more
4510 cv-qualified than the (otherwise identical) type of the
4511 template-argument. The template-parameter is bound directly to the
4512 template-argument, which must be an lvalue. */
4513 else if (TYPE_REF_OBJ_P (type
))
4515 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type
),
4517 return error_mark_node
;
4519 if (!at_least_as_qualified_p (TREE_TYPE (type
), expr_type
))
4521 error ("%qE is not a valid template argument for type %qT "
4522 "because of conflicts in cv-qualification", expr
, type
);
4526 if (!real_lvalue_p (expr
))
4528 error ("%qE is not a valid template argument for type %qT "
4529 "because it is not an lvalue", expr
, type
);
4533 /* [temp.arg.nontype]/1
4535 A template-argument for a non-type, non-template template-parameter
4536 shall be one of: [...]
4538 -- the address of an object or function with external linkage. */
4539 if (!DECL_EXTERNAL_LINKAGE_P (expr
))
4541 error ("%qE is not a valid template argument for type %qT "
4542 "because object %qD has not external linkage",
4547 expr
= build_nop (type
, build_address (expr
));
4549 /* [temp.arg.nontype]/5, bullet 4
4551 For a non-type template-parameter of type pointer to function, only
4552 the function-to-pointer conversion (_conv.func_) is applied. If the
4553 template-argument represents a set of overloaded functions (or a
4554 pointer to such), the matching function is selected from the set
4556 else if (TYPE_PTRFN_P (type
))
4558 /* If the argument is a template-id, we might not have enough
4559 context information to decay the pointer. */
4560 if (!type_unknown_p (expr_type
))
4562 expr
= decay_conversion (expr
);
4563 if (expr
== error_mark_node
)
4564 return error_mark_node
;
4567 expr
= convert_nontype_argument_function (type
, expr
);
4568 if (!expr
|| expr
== error_mark_node
)
4571 if (TREE_CODE (expr
) != ADDR_EXPR
)
4573 error ("%qE is not a valid template argument for type %qT", expr
, type
);
4574 error ("it must be the address of a function with external linkage");
4578 /* [temp.arg.nontype]/5, bullet 5
4580 For a non-type template-parameter of type reference to function, no
4581 conversions apply. If the template-argument represents a set of
4582 overloaded functions, the matching function is selected from the set
4584 else if (TYPE_REFFN_P (type
))
4586 if (TREE_CODE (expr
) == ADDR_EXPR
)
4588 error ("%qE is not a valid template argument for type %qT "
4589 "because it is a pointer", expr
, type
);
4590 inform (input_location
, "try using %qE instead", TREE_OPERAND (expr
, 0));
4594 expr
= convert_nontype_argument_function (TREE_TYPE (type
), expr
);
4595 if (!expr
|| expr
== error_mark_node
)
4598 expr
= build_nop (type
, build_address (expr
));
4600 /* [temp.arg.nontype]/5, bullet 6
4602 For a non-type template-parameter of type pointer to member function,
4603 no conversions apply. If the template-argument represents a set of
4604 overloaded member functions, the matching member function is selected
4605 from the set (_over.over_). */
4606 else if (TYPE_PTRMEMFUNC_P (type
))
4608 expr
= instantiate_type (type
, expr
, tf_none
);
4609 if (expr
== error_mark_node
)
4610 return error_mark_node
;
4612 /* There is no way to disable standard conversions in
4613 resolve_address_of_overloaded_function (called by
4614 instantiate_type). It is possible that the call succeeded by
4615 converting &B::I to &D::I (where B is a base of D), so we need
4616 to reject this conversion here.
4618 Actually, even if there was a way to disable standard conversions,
4619 it would still be better to reject them here so that we can
4620 provide a superior diagnostic. */
4621 if (!same_type_p (TREE_TYPE (expr
), type
))
4623 /* Make sure we are just one standard conversion off. */
4624 gcc_assert (can_convert (type
, TREE_TYPE (expr
)));
4625 error ("%qE is not a valid template argument for type %qT "
4626 "because it is of type %qT", expr
, type
,
4628 inform (input_location
, "standard conversions are not allowed in this context");
4632 /* [temp.arg.nontype]/5, bullet 7
4634 For a non-type template-parameter of type pointer to data member,
4635 qualification conversions (_conv.qual_) are applied. */
4636 else if (TYPE_PTRMEM_P (type
))
4638 expr
= perform_qualification_conversions (type
, expr
);
4639 if (expr
== error_mark_node
)
4642 /* A template non-type parameter must be one of the above. */
4646 /* Sanity check: did we actually convert the argument to the
4648 gcc_assert (same_type_p (type
, TREE_TYPE (expr
)));
4652 /* Subroutine of coerce_template_template_parms, which returns 1 if
4653 PARM_PARM and ARG_PARM match using the rule for the template
4654 parameters of template template parameters. Both PARM and ARG are
4655 template parameters; the rest of the arguments are the same as for
4656 coerce_template_template_parms.
4659 coerce_template_template_parm (tree parm
,
4661 tsubst_flags_t complain
,
4665 if (arg
== NULL_TREE
|| arg
== error_mark_node
4666 || parm
== NULL_TREE
|| parm
== error_mark_node
)
4669 if (TREE_CODE (arg
) != TREE_CODE (parm
))
4672 switch (TREE_CODE (parm
))
4675 /* We encounter instantiations of templates like
4676 template <template <template <class> class> class TT>
4679 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
4680 tree argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
4682 if (!coerce_template_template_parms
4683 (parmparm
, argparm
, complain
, in_decl
, outer_args
))
4689 if (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (arg
))
4690 && !TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
)))
4691 /* Argument is a parameter pack but parameter is not. */
4696 /* The tsubst call is used to handle cases such as
4698 template <int> class C {};
4699 template <class T, template <T> class TT> class D {};
4702 i.e. the parameter list of TT depends on earlier parameters. */
4703 if (!uses_template_parms (TREE_TYPE (arg
))
4705 (tsubst (TREE_TYPE (parm
), outer_args
, complain
, in_decl
),
4709 if (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (arg
))
4710 && !TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))
4711 /* Argument is a parameter pack but parameter is not. */
4724 /* Return 1 if PARM_PARMS and ARG_PARMS matches using rule for
4725 template template parameters. Both PARM_PARMS and ARG_PARMS are
4726 vectors of TREE_LIST nodes containing TYPE_DECL, TEMPLATE_DECL
4729 Consider the example:
4730 template <class T> class A;
4731 template<template <class U> class TT> class B;
4733 For B<A>, PARM_PARMS are the parameters to TT, while ARG_PARMS are
4734 the parameters to A, and OUTER_ARGS contains A. */
4737 coerce_template_template_parms (tree parm_parms
,
4739 tsubst_flags_t complain
,
4743 int nparms
, nargs
, i
;
4747 gcc_assert (TREE_CODE (parm_parms
) == TREE_VEC
);
4748 gcc_assert (TREE_CODE (arg_parms
) == TREE_VEC
);
4750 nparms
= TREE_VEC_LENGTH (parm_parms
);
4751 nargs
= TREE_VEC_LENGTH (arg_parms
);
4753 /* Determine whether we have a parameter pack at the end of the
4754 template template parameter's template parameter list. */
4755 if (TREE_VEC_ELT (parm_parms
, nparms
- 1) != error_mark_node
)
4757 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, nparms
- 1));
4759 switch (TREE_CODE (parm
))
4763 if (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
)))
4768 if (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))
4778 && !(variadic_p
&& nargs
>= nparms
- 1))
4781 /* Check all of the template parameters except the parameter pack at
4782 the end (if any). */
4783 for (i
= 0; i
< nparms
- variadic_p
; ++i
)
4785 if (TREE_VEC_ELT (parm_parms
, i
) == error_mark_node
4786 || TREE_VEC_ELT (arg_parms
, i
) == error_mark_node
)
4789 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
4790 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
4792 if (!coerce_template_template_parm (parm
, arg
, complain
, in_decl
,
4800 /* Check each of the template parameters in the template
4801 argument against the template parameter pack at the end of
4802 the template template parameter. */
4803 if (TREE_VEC_ELT (parm_parms
, i
) == error_mark_node
)
4806 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
4808 for (; i
< nargs
; ++i
)
4810 if (TREE_VEC_ELT (arg_parms
, i
) == error_mark_node
)
4813 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
4815 if (!coerce_template_template_parm (parm
, arg
, complain
, in_decl
,
4824 /* Verifies that the deduced template arguments (in TARGS) for the
4825 template template parameters (in TPARMS) represent valid bindings,
4826 by comparing the template parameter list of each template argument
4827 to the template parameter list of its corresponding template
4828 template parameter, in accordance with DR150. This
4829 routine can only be called after all template arguments have been
4830 deduced. It will return TRUE if all of the template template
4831 parameter bindings are okay, FALSE otherwise. */
4833 template_template_parm_bindings_ok_p (tree tparms
, tree targs
)
4835 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
4838 /* We're dealing with template parms in this process. */
4839 ++processing_template_decl
;
4841 targs
= INNERMOST_TEMPLATE_ARGS (targs
);
4843 for (i
= 0; i
< ntparms
; ++i
)
4845 tree tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
4846 tree targ
= TREE_VEC_ELT (targs
, i
);
4848 if (TREE_CODE (tparm
) == TEMPLATE_DECL
&& targ
)
4850 tree packed_args
= NULL_TREE
;
4853 if (ARGUMENT_PACK_P (targ
))
4855 /* Look inside the argument pack. */
4856 packed_args
= ARGUMENT_PACK_ARGS (targ
);
4857 len
= TREE_VEC_LENGTH (packed_args
);
4860 for (idx
= 0; idx
< len
; ++idx
)
4862 tree targ_parms
= NULL_TREE
;
4865 /* Extract the next argument from the argument
4867 targ
= TREE_VEC_ELT (packed_args
, idx
);
4869 if (PACK_EXPANSION_P (targ
))
4870 /* Look at the pattern of the pack expansion. */
4871 targ
= PACK_EXPANSION_PATTERN (targ
);
4873 /* Extract the template parameters from the template
4875 if (TREE_CODE (targ
) == TEMPLATE_DECL
)
4876 targ_parms
= DECL_INNERMOST_TEMPLATE_PARMS (targ
);
4877 else if (TREE_CODE (targ
) == TEMPLATE_TEMPLATE_PARM
)
4878 targ_parms
= DECL_INNERMOST_TEMPLATE_PARMS (TYPE_NAME (targ
));
4880 /* Verify that we can coerce the template template
4881 parameters from the template argument to the template
4882 parameter. This requires an exact match. */
4884 && !coerce_template_template_parms
4885 (DECL_INNERMOST_TEMPLATE_PARMS (tparm
),
4900 --processing_template_decl
;
4904 /* Convert the indicated template ARG as necessary to match the
4905 indicated template PARM. Returns the converted ARG, or
4906 error_mark_node if the conversion was unsuccessful. Error and
4907 warning messages are issued under control of COMPLAIN. This
4908 conversion is for the Ith parameter in the parameter list. ARGS is
4909 the full set of template arguments deduced so far. */
4912 convert_template_argument (tree parm
,
4915 tsubst_flags_t complain
,
4921 int is_type
, requires_type
, is_tmpl_type
, requires_tmpl_type
;
4923 if (TREE_CODE (arg
) == TREE_LIST
4924 && TREE_CODE (TREE_VALUE (arg
)) == OFFSET_REF
)
4926 /* The template argument was the name of some
4927 member function. That's usually
4928 invalid, but static members are OK. In any
4929 case, grab the underlying fields/functions
4930 and issue an error later if required. */
4931 orig_arg
= TREE_VALUE (arg
);
4932 TREE_TYPE (arg
) = unknown_type_node
;
4937 requires_tmpl_type
= TREE_CODE (parm
) == TEMPLATE_DECL
;
4938 requires_type
= (TREE_CODE (parm
) == TYPE_DECL
4939 || requires_tmpl_type
);
4941 /* When determining whether an argument pack expansion is a template,
4942 look at the pattern. */
4943 if (TREE_CODE (arg
) == TYPE_PACK_EXPANSION
)
4944 arg
= PACK_EXPANSION_PATTERN (arg
);
4947 ((TREE_CODE (arg
) == TEMPLATE_DECL
4948 && TREE_CODE (DECL_TEMPLATE_RESULT (arg
)) == TYPE_DECL
)
4949 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
4950 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
);
4953 && (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
4954 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
))
4955 arg
= TYPE_STUB_DECL (arg
);
4957 is_type
= TYPE_P (arg
) || is_tmpl_type
;
4959 if (requires_type
&& ! is_type
&& TREE_CODE (arg
) == SCOPE_REF
4960 && TREE_CODE (TREE_OPERAND (arg
, 0)) == TEMPLATE_TYPE_PARM
)
4962 permerror (input_location
, "to refer to a type member of a template parameter, "
4963 "use %<typename %E%>", orig_arg
);
4965 orig_arg
= make_typename_type (TREE_OPERAND (arg
, 0),
4966 TREE_OPERAND (arg
, 1),
4968 complain
& tf_error
);
4972 if (is_type
!= requires_type
)
4976 if (complain
& tf_error
)
4978 error ("type/value mismatch at argument %d in template "
4979 "parameter list for %qD",
4982 error (" expected a constant of type %qT, got %qT",
4984 (DECL_P (arg
) ? DECL_NAME (arg
) : orig_arg
));
4985 else if (requires_tmpl_type
)
4986 error (" expected a class template, got %qE", orig_arg
);
4988 error (" expected a type, got %qE", orig_arg
);
4991 return error_mark_node
;
4993 if (is_tmpl_type
^ requires_tmpl_type
)
4995 if (in_decl
&& (complain
& tf_error
))
4997 error ("type/value mismatch at argument %d in template "
4998 "parameter list for %qD",
5001 error (" expected a type, got %qT", DECL_NAME (arg
));
5003 error (" expected a class template, got %qT", orig_arg
);
5005 return error_mark_node
;
5010 if (requires_tmpl_type
)
5012 if (TREE_CODE (TREE_TYPE (arg
)) == UNBOUND_CLASS_TEMPLATE
)
5013 /* The number of argument required is not known yet.
5014 Just accept it for now. */
5015 val
= TREE_TYPE (arg
);
5018 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
5021 argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
5023 if (coerce_template_template_parms (parmparm
, argparm
,
5029 /* TEMPLATE_TEMPLATE_PARM node is preferred over
5031 if (val
!= error_mark_node
)
5033 if (DECL_TEMPLATE_TEMPLATE_PARM_P (val
))
5034 val
= TREE_TYPE (val
);
5035 else if (TREE_CODE (val
) == TYPE_PACK_EXPANSION
5036 && DECL_TEMPLATE_TEMPLATE_PARM_P (arg
))
5038 val
= TREE_TYPE (arg
);
5039 val
= make_pack_expansion (val
);
5045 if (in_decl
&& (complain
& tf_error
))
5047 error ("type/value mismatch at argument %d in "
5048 "template parameter list for %qD",
5050 error (" expected a template of type %qD, got %qD",
5054 val
= error_mark_node
;
5060 /* We only form one instance of each template specialization.
5061 Therefore, if we use a non-canonical variant (i.e., a
5062 typedef), any future messages referring to the type will use
5063 the typedef, which is confusing if those future uses do not
5064 themselves also use the typedef. */
5066 val
= canonical_type_variant (val
);
5070 tree t
= tsubst (TREE_TYPE (parm
), args
, complain
, in_decl
);
5072 if (invalid_nontype_parm_type_p (t
, complain
))
5073 return error_mark_node
;
5075 if (template_parameter_pack_p (parm
) && ARGUMENT_PACK_P (orig_arg
))
5077 if (same_type_p (t
, TREE_TYPE (orig_arg
)))
5081 /* Not sure if this is reachable, but it doesn't hurt
5083 error ("type mismatch in nontype parameter pack");
5084 val
= error_mark_node
;
5087 else if (!uses_template_parms (orig_arg
) && !uses_template_parms (t
))
5088 /* We used to call digest_init here. However, digest_init
5089 will report errors, which we don't want when complain
5090 is zero. More importantly, digest_init will try too
5091 hard to convert things: for example, `0' should not be
5092 converted to pointer type at this point according to
5093 the standard. Accepting this is not merely an
5094 extension, since deciding whether or not these
5095 conversions can occur is part of determining which
5096 function template to call, or whether a given explicit
5097 argument specification is valid. */
5098 val
= convert_nontype_argument (t
, orig_arg
);
5102 if (val
== NULL_TREE
)
5103 val
= error_mark_node
;
5104 else if (val
== error_mark_node
&& (complain
& tf_error
))
5105 error ("could not convert template argument %qE to %qT", orig_arg
, t
);
5111 /* Coerces the remaining template arguments in INNER_ARGS (from
5112 ARG_IDX to the end) into the parameter pack at PARM_IDX in PARMS.
5113 Returns the coerced argument pack. PARM_IDX is the position of this
5114 parameter in the template parameter list. ARGS is the original
5115 template argument list. */
5117 coerce_template_parameter_pack (tree parms
,
5125 tsubst_flags_t complain
)
5127 tree parm
= TREE_VEC_ELT (parms
, parm_idx
);
5128 int nargs
= inner_args
? NUM_TMPL_ARGS (inner_args
) : 0;
5131 tree packed_types
= NULL_TREE
;
5133 if (arg_idx
> nargs
)
5136 packed_args
= make_tree_vec (nargs
- arg_idx
);
5138 if (TREE_CODE (TREE_VALUE (parm
)) == PARM_DECL
5139 && uses_parameter_packs (TREE_TYPE (TREE_VALUE (parm
))))
5141 /* When the template parameter is a non-type template
5142 parameter pack whose type uses parameter packs, we need
5143 to look at each of the template arguments
5144 separately. Build a vector of the types for these
5145 non-type template parameters in PACKED_TYPES. */
5147 = make_pack_expansion (TREE_TYPE (TREE_VALUE (parm
)));
5148 packed_types
= tsubst_pack_expansion (expansion
, args
,
5151 if (packed_types
== error_mark_node
)
5152 return error_mark_node
;
5154 /* Check that we have the right number of arguments. */
5156 && !PACK_EXPANSION_P (TREE_VEC_ELT (inner_args
, arg_idx
))
5157 && nargs
- arg_idx
!= TREE_VEC_LENGTH (packed_types
))
5160 = TREE_VEC_LENGTH (parms
) - 1 + TREE_VEC_LENGTH (packed_types
);
5161 error ("wrong number of template arguments (%d, should be %d)",
5162 nargs
, needed_parms
);
5163 return error_mark_node
;
5166 /* If we aren't able to check the actual arguments now
5167 (because they haven't been expanded yet), we can at least
5168 verify that all of the types used for the non-type
5169 template parameter pack are, in fact, valid for non-type
5170 template parameters. */
5172 && PACK_EXPANSION_P (TREE_VEC_ELT (inner_args
, arg_idx
)))
5174 int j
, len
= TREE_VEC_LENGTH (packed_types
);
5175 for (j
= 0; j
< len
; ++j
)
5177 tree t
= TREE_VEC_ELT (packed_types
, j
);
5178 if (invalid_nontype_parm_type_p (t
, complain
))
5179 return error_mark_node
;
5184 /* Convert the remaining arguments, which will be a part of the
5185 parameter pack "parm". */
5186 for (; arg_idx
< nargs
; ++arg_idx
)
5188 tree arg
= TREE_VEC_ELT (inner_args
, arg_idx
);
5189 tree actual_parm
= TREE_VALUE (parm
);
5191 if (packed_types
&& !PACK_EXPANSION_P (arg
))
5193 /* When we have a vector of types (corresponding to the
5194 non-type template parameter pack that uses parameter
5195 packs in its type, as mention above), and the
5196 argument is not an expansion (which expands to a
5197 currently unknown number of arguments), clone the
5198 parm and give it the next type in PACKED_TYPES. */
5199 actual_parm
= copy_node (actual_parm
);
5200 TREE_TYPE (actual_parm
) =
5201 TREE_VEC_ELT (packed_types
, arg_idx
- parm_idx
);
5204 if (arg
!= error_mark_node
)
5205 arg
= convert_template_argument (actual_parm
,
5206 arg
, new_args
, complain
, parm_idx
,
5208 if (arg
== error_mark_node
)
5210 TREE_VEC_ELT (packed_args
, arg_idx
- parm_idx
) = arg
;
5213 if (TREE_CODE (TREE_VALUE (parm
)) == TYPE_DECL
5214 || TREE_CODE (TREE_VALUE (parm
)) == TEMPLATE_DECL
)
5215 argument_pack
= make_node (TYPE_ARGUMENT_PACK
);
5218 argument_pack
= make_node (NONTYPE_ARGUMENT_PACK
);
5219 TREE_TYPE (argument_pack
)
5220 = tsubst (TREE_TYPE (TREE_VALUE (parm
)), new_args
, complain
, in_decl
);
5221 TREE_CONSTANT (argument_pack
) = 1;
5224 SET_ARGUMENT_PACK_ARGS (argument_pack
, packed_args
);
5225 return argument_pack
;
5228 /* Convert all template arguments to their appropriate types, and
5229 return a vector containing the innermost resulting template
5230 arguments. If any error occurs, return error_mark_node. Error and
5231 warning messages are issued under control of COMPLAIN.
5233 If REQUIRE_ALL_ARGS is false, argument deduction will be performed
5234 for arguments not specified in ARGS. Otherwise, if
5235 USE_DEFAULT_ARGS is true, default arguments will be used to fill in
5236 unspecified arguments. If REQUIRE_ALL_ARGS is true, but
5237 USE_DEFAULT_ARGS is false, then all arguments must be specified in
5241 coerce_template_parms (tree parms
,
5244 tsubst_flags_t complain
,
5245 bool require_all_args
,
5246 bool use_default_args
)
5248 int nparms
, nargs
, parm_idx
, arg_idx
, lost
= 0;
5251 tree new_inner_args
;
5252 bool saved_skip_evaluation
;
5254 /* When used as a boolean value, indicates whether this is a
5255 variadic template parameter list. Since it's an int, we can also
5256 subtract it from nparms to get the number of non-variadic
5260 nparms
= TREE_VEC_LENGTH (parms
);
5262 /* Determine if there are any parameter packs. */
5263 for (parm_idx
= 0; parm_idx
< nparms
; ++parm_idx
)
5265 tree tparm
= TREE_VALUE (TREE_VEC_ELT (parms
, parm_idx
));
5266 if (template_parameter_pack_p (tparm
))
5270 inner_args
= INNERMOST_TEMPLATE_ARGS (args
);
5271 /* If there are 0 or 1 parameter packs, we need to expand any argument
5272 packs so that we can deduce a parameter pack from some non-packed args
5273 followed by an argument pack, as in variadic85.C. If there are more
5274 than that, we need to leave argument packs intact so the arguments are
5275 assigned to the right parameter packs. This should only happen when
5276 dealing with a nested class inside a partial specialization of a class
5277 template, as in variadic92.C. */
5278 if (variadic_p
<= 1)
5279 inner_args
= expand_template_argument_pack (inner_args
);
5281 nargs
= inner_args
? NUM_TMPL_ARGS (inner_args
) : 0;
5282 if ((nargs
> nparms
&& !variadic_p
)
5283 || (nargs
< nparms
- variadic_p
5285 && (!use_default_args
5286 || (TREE_VEC_ELT (parms
, nargs
) != error_mark_node
5287 && !TREE_PURPOSE (TREE_VEC_ELT (parms
, nargs
))))))
5289 if (complain
& tf_error
)
5291 const char *or_more
= "";
5294 or_more
= " or more";
5298 error ("wrong number of template arguments (%d, should be %d%s)",
5299 nargs
, nparms
, or_more
);
5302 error ("provided for %q+D", in_decl
);
5305 return error_mark_node
;
5308 /* We need to evaluate the template arguments, even though this
5309 template-id may be nested within a "sizeof". */
5310 saved_skip_evaluation
= skip_evaluation
;
5311 skip_evaluation
= false;
5312 new_inner_args
= make_tree_vec (nparms
);
5313 new_args
= add_outermost_template_args (args
, new_inner_args
);
5314 for (parm_idx
= 0, arg_idx
= 0; parm_idx
< nparms
; parm_idx
++, arg_idx
++)
5319 /* Get the Ith template parameter. */
5320 parm
= TREE_VEC_ELT (parms
, parm_idx
);
5322 if (parm
== error_mark_node
)
5324 TREE_VEC_ELT (new_inner_args
, arg_idx
) = error_mark_node
;
5328 /* Calculate the next argument. */
5329 if (arg_idx
< nargs
)
5330 arg
= TREE_VEC_ELT (inner_args
, arg_idx
);
5334 if (template_parameter_pack_p (TREE_VALUE (parm
))
5335 && !(arg
&& ARGUMENT_PACK_P (arg
)))
5337 /* All remaining arguments will be placed in the
5338 template parameter pack PARM. */
5339 arg
= coerce_template_parameter_pack (parms
, parm_idx
, args
,
5340 inner_args
, arg_idx
,
5344 /* Store this argument. */
5345 if (arg
== error_mark_node
)
5347 TREE_VEC_ELT (new_inner_args
, parm_idx
) = arg
;
5349 /* We are done with all of the arguments. */
5356 if (PACK_EXPANSION_P (arg
))
5358 if (complain
& tf_error
)
5360 /* FIXME this restriction was removed by N2555; see
5362 /* If ARG is a pack expansion, but PARM is not a
5363 template parameter pack (if it were, we would have
5364 handled it above), we're trying to expand into a
5365 fixed-length argument list. */
5366 if (TREE_CODE (arg
) == EXPR_PACK_EXPANSION
)
5367 sorry ("cannot expand %<%E%> into a fixed-length "
5368 "argument list", arg
);
5370 sorry ("cannot expand %<%T%> into a fixed-length "
5371 "argument list", arg
);
5373 return error_mark_node
;
5376 else if (require_all_args
)
5377 /* There must be a default arg in this case. */
5378 arg
= tsubst_template_arg (TREE_PURPOSE (parm
), new_args
,
5383 if (arg
== error_mark_node
)
5385 if (complain
& tf_error
)
5386 error ("template argument %d is invalid", arg_idx
+ 1);
5389 /* This only occurs if there was an error in the template
5390 parameter list itself (which we would already have
5391 reported) that we are trying to recover from, e.g., a class
5392 template with a parameter list such as
5393 template<typename..., typename>. */
5394 return error_mark_node
;
5396 arg
= convert_template_argument (TREE_VALUE (parm
),
5397 arg
, new_args
, complain
,
5400 if (arg
== error_mark_node
)
5402 TREE_VEC_ELT (new_inner_args
, arg_idx
) = arg
;
5404 skip_evaluation
= saved_skip_evaluation
;
5407 return error_mark_node
;
5409 return new_inner_args
;
5412 /* Returns 1 if template args OT and NT are equivalent. */
5415 template_args_equal (tree ot
, tree nt
)
5420 if (TREE_CODE (nt
) == TREE_VEC
)
5421 /* For member templates */
5422 return TREE_CODE (ot
) == TREE_VEC
&& comp_template_args (ot
, nt
);
5423 else if (PACK_EXPANSION_P (ot
))
5424 return PACK_EXPANSION_P (nt
)
5425 && template_args_equal (PACK_EXPANSION_PATTERN (ot
),
5426 PACK_EXPANSION_PATTERN (nt
));
5427 else if (ARGUMENT_PACK_P (ot
))
5432 if (!ARGUMENT_PACK_P (nt
))
5435 opack
= ARGUMENT_PACK_ARGS (ot
);
5436 npack
= ARGUMENT_PACK_ARGS (nt
);
5437 len
= TREE_VEC_LENGTH (opack
);
5438 if (TREE_VEC_LENGTH (npack
) != len
)
5440 for (i
= 0; i
< len
; ++i
)
5441 if (!template_args_equal (TREE_VEC_ELT (opack
, i
),
5442 TREE_VEC_ELT (npack
, i
)))
5446 else if (TYPE_P (nt
))
5447 return TYPE_P (ot
) && same_type_p (ot
, nt
);
5448 else if (TREE_CODE (ot
) == TREE_VEC
|| TYPE_P (ot
))
5451 return cp_tree_equal (ot
, nt
);
5454 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets
5455 of template arguments. Returns 0 otherwise. */
5458 comp_template_args (tree oldargs
, tree newargs
)
5462 if (TREE_VEC_LENGTH (oldargs
) != TREE_VEC_LENGTH (newargs
))
5465 for (i
= 0; i
< TREE_VEC_LENGTH (oldargs
); ++i
)
5467 tree nt
= TREE_VEC_ELT (newargs
, i
);
5468 tree ot
= TREE_VEC_ELT (oldargs
, i
);
5470 if (! template_args_equal (ot
, nt
))
5477 add_pending_template (tree d
)
5479 tree ti
= (TYPE_P (d
)
5480 ? CLASSTYPE_TEMPLATE_INFO (d
)
5481 : DECL_TEMPLATE_INFO (d
));
5482 struct pending_template
*pt
;
5485 if (TI_PENDING_TEMPLATE_FLAG (ti
))
5488 /* We are called both from instantiate_decl, where we've already had a
5489 tinst_level pushed, and instantiate_template, where we haven't.
5491 level
= !current_tinst_level
|| current_tinst_level
->decl
!= d
;
5494 push_tinst_level (d
);
5496 pt
= GGC_NEW (struct pending_template
);
5498 pt
->tinst
= current_tinst_level
;
5499 if (last_pending_template
)
5500 last_pending_template
->next
= pt
;
5502 pending_templates
= pt
;
5504 last_pending_template
= pt
;
5506 TI_PENDING_TEMPLATE_FLAG (ti
) = 1;
5513 /* Return a TEMPLATE_ID_EXPR corresponding to the indicated FNS and
5514 ARGLIST. Valid choices for FNS are given in the cp-tree.def
5515 documentation for TEMPLATE_ID_EXPR. */
5518 lookup_template_function (tree fns
, tree arglist
)
5522 if (fns
== error_mark_node
|| arglist
== error_mark_node
)
5523 return error_mark_node
;
5525 gcc_assert (!arglist
|| TREE_CODE (arglist
) == TREE_VEC
);
5526 gcc_assert (fns
&& (is_overloaded_fn (fns
)
5527 || TREE_CODE (fns
) == IDENTIFIER_NODE
));
5529 if (BASELINK_P (fns
))
5531 BASELINK_FUNCTIONS (fns
) = build2 (TEMPLATE_ID_EXPR
,
5533 BASELINK_FUNCTIONS (fns
),
5538 type
= TREE_TYPE (fns
);
5539 if (TREE_CODE (fns
) == OVERLOAD
|| !type
)
5540 type
= unknown_type_node
;
5542 return build2 (TEMPLATE_ID_EXPR
, type
, fns
, arglist
);
5545 /* Within the scope of a template class S<T>, the name S gets bound
5546 (in build_self_reference) to a TYPE_DECL for the class, not a
5547 TEMPLATE_DECL. If DECL is a TYPE_DECL for current_class_type,
5548 or one of its enclosing classes, and that type is a template,
5549 return the associated TEMPLATE_DECL. Otherwise, the original
5550 DECL is returned. */
5553 maybe_get_template_decl_from_type_decl (tree decl
)
5555 return (decl
!= NULL_TREE
5556 && TREE_CODE (decl
) == TYPE_DECL
5557 && DECL_ARTIFICIAL (decl
)
5558 && CLASS_TYPE_P (TREE_TYPE (decl
))
5559 && CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (decl
)))
5560 ? CLASSTYPE_TI_TEMPLATE (TREE_TYPE (decl
)) : decl
;
5563 /* Given an IDENTIFIER_NODE (type TEMPLATE_DECL) and a chain of
5564 parameters, find the desired type.
5566 D1 is the PTYPENAME terminal, and ARGLIST is the list of arguments.
5568 IN_DECL, if non-NULL, is the template declaration we are trying to
5571 If ENTERING_SCOPE is nonzero, we are about to enter the scope of
5572 the class we are looking up.
5574 Issue error and warning messages under control of COMPLAIN.
5576 If the template class is really a local class in a template
5577 function, then the FUNCTION_CONTEXT is the function in which it is
5580 ??? Note that this function is currently called *twice* for each
5581 template-id: the first time from the parser, while creating the
5582 incomplete type (finish_template_type), and the second type during the
5583 real instantiation (instantiate_template_class). This is surely something
5584 that we want to avoid. It also causes some problems with argument
5585 coercion (see convert_nontype_argument for more information on this). */
5588 lookup_template_class (tree d1
,
5593 tsubst_flags_t complain
)
5595 tree templ
= NULL_TREE
, parmlist
;
5598 timevar_push (TV_NAME_LOOKUP
);
5600 if (TREE_CODE (d1
) == IDENTIFIER_NODE
)
5602 tree value
= innermost_non_namespace_value (d1
);
5603 if (value
&& DECL_TEMPLATE_TEMPLATE_PARM_P (value
))
5608 push_decl_namespace (context
);
5609 templ
= lookup_name (d1
);
5610 templ
= maybe_get_template_decl_from_type_decl (templ
);
5612 pop_decl_namespace ();
5615 context
= DECL_CONTEXT (templ
);
5617 else if (TREE_CODE (d1
) == TYPE_DECL
&& MAYBE_CLASS_TYPE_P (TREE_TYPE (d1
)))
5619 tree type
= TREE_TYPE (d1
);
5621 /* If we are declaring a constructor, say A<T>::A<T>, we will get
5622 an implicit typename for the second A. Deal with it. */
5623 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
5624 type
= TREE_TYPE (type
);
5626 if (CLASSTYPE_TEMPLATE_INFO (type
))
5628 templ
= CLASSTYPE_TI_TEMPLATE (type
);
5629 d1
= DECL_NAME (templ
);
5632 else if (TREE_CODE (d1
) == ENUMERAL_TYPE
5633 || (TYPE_P (d1
) && MAYBE_CLASS_TYPE_P (d1
)))
5635 templ
= TYPE_TI_TEMPLATE (d1
);
5636 d1
= DECL_NAME (templ
);
5638 else if (TREE_CODE (d1
) == TEMPLATE_DECL
5639 && DECL_TEMPLATE_RESULT (d1
)
5640 && TREE_CODE (DECL_TEMPLATE_RESULT (d1
)) == TYPE_DECL
)
5643 d1
= DECL_NAME (templ
);
5644 context
= DECL_CONTEXT (templ
);
5647 /* Issue an error message if we didn't find a template. */
5650 if (complain
& tf_error
)
5651 error ("%qT is not a template", d1
);
5652 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP
, error_mark_node
);
5655 if (TREE_CODE (templ
) != TEMPLATE_DECL
5656 /* Make sure it's a user visible template, if it was named by
5658 || ((complain
& tf_user
) && !DECL_TEMPLATE_PARM_P (templ
)
5659 && !PRIMARY_TEMPLATE_P (templ
)))
5661 if (complain
& tf_error
)
5663 error ("non-template type %qT used as a template", d1
);
5665 error ("for template declaration %q+D", in_decl
);
5667 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP
, error_mark_node
);
5670 complain
&= ~tf_user
;
5672 if (DECL_TEMPLATE_TEMPLATE_PARM_P (templ
))
5674 /* Create a new TEMPLATE_DECL and TEMPLATE_TEMPLATE_PARM node to store
5675 template arguments */
5681 parmlist
= DECL_INNERMOST_TEMPLATE_PARMS (templ
);
5683 /* Consider an example where a template template parameter declared as
5685 template <class T, class U = std::allocator<T> > class TT
5687 The template parameter level of T and U are one level larger than
5688 of TT. To proper process the default argument of U, say when an
5689 instantiation `TT<int>' is seen, we need to build the full
5690 arguments containing {int} as the innermost level. Outer levels,
5691 available when not appearing as default template argument, can be
5692 obtained from the arguments of the enclosing template.
5694 Suppose that TT is later substituted with std::vector. The above
5695 instantiation is `TT<int, std::allocator<T> >' with TT at
5696 level 1, and T at level 2, while the template arguments at level 1
5697 becomes {std::vector} and the inner level 2 is {int}. */
5699 outer
= DECL_CONTEXT (templ
);
5701 outer
= TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (outer
)));
5702 else if (current_template_parms
)
5703 /* This is an argument of the current template, so we haven't set
5704 DECL_CONTEXT yet. */
5705 outer
= current_template_args ();
5708 arglist
= add_to_template_args (outer
, arglist
);
5710 arglist2
= coerce_template_parms (parmlist
, arglist
, templ
,
5712 /*require_all_args=*/true,
5713 /*use_default_args=*/true);
5714 if (arglist2
== error_mark_node
5715 || (!uses_template_parms (arglist2
)
5716 && check_instantiated_args (templ
, arglist2
, complain
)))
5717 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP
, error_mark_node
);
5719 parm
= bind_template_template_parm (TREE_TYPE (templ
), arglist2
);
5720 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP
, parm
);
5724 tree template_type
= TREE_TYPE (templ
);
5727 tree found
= NULL_TREE
;
5730 int is_partial_instantiation
;
5732 gen_tmpl
= most_general_template (templ
);
5733 parmlist
= DECL_TEMPLATE_PARMS (gen_tmpl
);
5734 parm_depth
= TMPL_PARMS_DEPTH (parmlist
);
5735 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
5737 if (arg_depth
== 1 && parm_depth
> 1)
5739 /* We've been given an incomplete set of template arguments.
5742 template <class T> struct S1 {
5743 template <class U> struct S2 {};
5744 template <class U> struct S2<U*> {};
5747 we will be called with an ARGLIST of `U*', but the
5748 TEMPLATE will be `template <class T> template
5749 <class U> struct S1<T>::S2'. We must fill in the missing
5752 = add_outermost_template_args (TYPE_TI_ARGS (TREE_TYPE (templ
)),
5754 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
5757 /* Now we should have enough arguments. */
5758 gcc_assert (parm_depth
== arg_depth
);
5760 /* From here on, we're only interested in the most general
5764 /* Calculate the BOUND_ARGS. These will be the args that are
5765 actually tsubst'd into the definition to create the
5769 /* We have multiple levels of arguments to coerce, at once. */
5771 int saved_depth
= TMPL_ARGS_DEPTH (arglist
);
5773 tree bound_args
= make_tree_vec (parm_depth
);
5775 for (i
= saved_depth
,
5776 t
= DECL_TEMPLATE_PARMS (templ
);
5777 i
> 0 && t
!= NULL_TREE
;
5778 --i
, t
= TREE_CHAIN (t
))
5780 tree a
= coerce_template_parms (TREE_VALUE (t
),
5783 /*require_all_args=*/true,
5784 /*use_default_args=*/true);
5786 /* Don't process further if one of the levels fails. */
5787 if (a
== error_mark_node
)
5789 /* Restore the ARGLIST to its full size. */
5790 TREE_VEC_LENGTH (arglist
) = saved_depth
;
5791 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP
, error_mark_node
);
5794 SET_TMPL_ARGS_LEVEL (bound_args
, i
, a
);
5796 /* We temporarily reduce the length of the ARGLIST so
5797 that coerce_template_parms will see only the arguments
5798 corresponding to the template parameters it is
5800 TREE_VEC_LENGTH (arglist
)--;
5803 /* Restore the ARGLIST to its full size. */
5804 TREE_VEC_LENGTH (arglist
) = saved_depth
;
5806 arglist
= bound_args
;
5810 = coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parmlist
),
5811 INNERMOST_TEMPLATE_ARGS (arglist
),
5814 /*require_all_args=*/true,
5815 /*use_default_args=*/true);
5817 if (arglist
== error_mark_node
)
5818 /* We were unable to bind the arguments. */
5819 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP
, error_mark_node
);
5821 /* In the scope of a template class, explicit references to the
5822 template class refer to the type of the template, not any
5823 instantiation of it. For example, in:
5825 template <class T> class C { void f(C<T>); }
5827 the `C<T>' is just the same as `C'. Outside of the
5828 class, however, such a reference is an instantiation. */
5829 if (comp_template_args (TYPE_TI_ARGS (template_type
),
5832 found
= template_type
;
5834 if (!entering_scope
&& PRIMARY_TEMPLATE_P (templ
))
5838 for (ctx
= current_class_type
;
5839 ctx
&& TREE_CODE (ctx
) != NAMESPACE_DECL
;
5841 ? TYPE_CONTEXT (ctx
)
5842 : DECL_CONTEXT (ctx
)))
5843 if (TYPE_P (ctx
) && same_type_p (ctx
, template_type
))
5846 /* We're not in the scope of the class, so the
5847 TEMPLATE_TYPE is not the type we want after all. */
5853 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP
, found
);
5855 /* If we already have this specialization, return it. */
5856 found
= retrieve_specialization (templ
, arglist
,
5857 /*class_specializations_p=*/false);
5859 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP
, found
);
5861 /* This type is a "partial instantiation" if any of the template
5862 arguments still involve template parameters. Note that we set
5863 IS_PARTIAL_INSTANTIATION for partial specializations as
5865 is_partial_instantiation
= uses_template_parms (arglist
);
5867 /* If the deduced arguments are invalid, then the binding
5869 if (!is_partial_instantiation
5870 && check_instantiated_args (templ
,
5871 INNERMOST_TEMPLATE_ARGS (arglist
),
5873 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP
, error_mark_node
);
5875 if (!is_partial_instantiation
5876 && !PRIMARY_TEMPLATE_P (templ
)
5877 && TREE_CODE (CP_DECL_CONTEXT (templ
)) == NAMESPACE_DECL
)
5879 found
= xref_tag_from_type (TREE_TYPE (templ
),
5881 /*tag_scope=*/ts_global
);
5882 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP
, found
);
5885 context
= tsubst (DECL_CONTEXT (templ
), arglist
,
5888 context
= global_namespace
;
5890 /* Create the type. */
5891 if (TREE_CODE (template_type
) == ENUMERAL_TYPE
)
5893 if (!is_partial_instantiation
)
5895 set_current_access_from_decl (TYPE_NAME (template_type
));
5896 t
= start_enum (TYPE_IDENTIFIER (template_type
),
5897 tsubst (ENUM_UNDERLYING_TYPE (template_type
),
5898 arglist
, complain
, in_decl
),
5899 SCOPED_ENUM_P (template_type
));
5903 /* We don't want to call start_enum for this type, since
5904 the values for the enumeration constants may involve
5905 template parameters. And, no one should be interested
5906 in the enumeration constants for such a type. */
5907 t
= make_node (ENUMERAL_TYPE
);
5908 SET_SCOPED_ENUM_P (t
, SCOPED_ENUM_P (template_type
));
5913 t
= make_class_type (TREE_CODE (template_type
));
5914 CLASSTYPE_DECLARED_CLASS (t
)
5915 = CLASSTYPE_DECLARED_CLASS (template_type
);
5916 SET_CLASSTYPE_IMPLICIT_INSTANTIATION (t
);
5917 TYPE_FOR_JAVA (t
) = TYPE_FOR_JAVA (template_type
);
5919 /* A local class. Make sure the decl gets registered properly. */
5920 if (context
== current_function_decl
)
5921 pushtag (DECL_NAME (templ
), t
, /*tag_scope=*/ts_current
);
5923 if (comp_template_args (CLASSTYPE_TI_ARGS (template_type
), arglist
))
5924 /* This instantiation is another name for the primary
5925 template type. Set the TYPE_CANONICAL field
5927 TYPE_CANONICAL (t
) = template_type
;
5928 else if (any_template_arguments_need_structural_equality_p (arglist
))
5929 /* Some of the template arguments require structural
5930 equality testing, so this template class requires
5931 structural equality testing. */
5932 SET_TYPE_STRUCTURAL_EQUALITY (t
);
5935 /* If we called start_enum or pushtag above, this information
5936 will already be set up. */
5939 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
5941 type_decl
= create_implicit_typedef (DECL_NAME (templ
), t
);
5942 DECL_CONTEXT (type_decl
) = TYPE_CONTEXT (t
);
5943 TYPE_STUB_DECL (t
) = type_decl
;
5944 DECL_SOURCE_LOCATION (type_decl
)
5945 = DECL_SOURCE_LOCATION (TYPE_STUB_DECL (template_type
));
5948 type_decl
= TYPE_NAME (t
);
5950 TREE_PRIVATE (type_decl
)
5951 = TREE_PRIVATE (TYPE_STUB_DECL (template_type
));
5952 TREE_PROTECTED (type_decl
)
5953 = TREE_PROTECTED (TYPE_STUB_DECL (template_type
));
5954 if (CLASSTYPE_VISIBILITY_SPECIFIED (template_type
))
5956 DECL_VISIBILITY_SPECIFIED (type_decl
) = 1;
5957 DECL_VISIBILITY (type_decl
) = CLASSTYPE_VISIBILITY (template_type
);
5960 /* Set up the template information. We have to figure out which
5961 template is the immediate parent if this is a full
5963 if (parm_depth
== 1 || is_partial_instantiation
5964 || !PRIMARY_TEMPLATE_P (templ
))
5965 /* This case is easy; there are no member templates involved. */
5969 /* This is a full instantiation of a member template. Look
5970 for a partial instantiation of which this is an instance. */
5972 for (found
= DECL_TEMPLATE_INSTANTIATIONS (templ
);
5973 found
; found
= TREE_CHAIN (found
))
5976 tree tmpl
= CLASSTYPE_TI_TEMPLATE (TREE_VALUE (found
));
5978 /* We only want partial instantiations, here, not
5979 specializations or full instantiations. */
5980 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_VALUE (found
))
5981 || !uses_template_parms (TREE_VALUE (found
)))
5984 /* Temporarily reduce by one the number of levels in the
5985 ARGLIST and in FOUND so as to avoid comparing the
5986 last set of arguments. */
5987 TREE_VEC_LENGTH (arglist
)--;
5988 TREE_VEC_LENGTH (TREE_PURPOSE (found
)) --;
5990 /* See if the arguments match. If they do, then TMPL is
5991 the partial instantiation we want. */
5992 success
= comp_template_args (TREE_PURPOSE (found
), arglist
);
5994 /* Restore the argument vectors to their full size. */
5995 TREE_VEC_LENGTH (arglist
)++;
5996 TREE_VEC_LENGTH (TREE_PURPOSE (found
))++;
6007 /* There was no partial instantiation. This happens
6008 where C<T> is a member template of A<T> and it's used
6011 template <typename T> struct B { A<T>::C<int> m; };
6014 Create the partial instantiation.
6016 TREE_VEC_LENGTH (arglist
)--;
6017 found
= tsubst (templ
, arglist
, complain
, NULL_TREE
);
6018 TREE_VEC_LENGTH (arglist
)++;
6022 SET_TYPE_TEMPLATE_INFO (t
, tree_cons (found
, arglist
, NULL_TREE
));
6023 DECL_TEMPLATE_INSTANTIATIONS (templ
)
6024 = tree_cons (arglist
, t
,
6025 DECL_TEMPLATE_INSTANTIATIONS (templ
));
6027 if (TREE_CODE (t
) == ENUMERAL_TYPE
6028 && !is_partial_instantiation
)
6029 /* Now that the type has been registered on the instantiations
6030 list, we set up the enumerators. Because the enumeration
6031 constants may involve the enumeration type itself, we make
6032 sure to register the type first, and then create the
6033 constants. That way, doing tsubst_expr for the enumeration
6034 constants won't result in recursive calls here; we'll find
6035 the instantiation and exit above. */
6036 tsubst_enum (template_type
, t
, arglist
);
6038 if (is_partial_instantiation
)
6039 /* If the type makes use of template parameters, the
6040 code that generates debugging information will crash. */
6041 DECL_IGNORED_P (TYPE_STUB_DECL (t
)) = 1;
6043 /* Possibly limit visibility based on template args. */
6044 TREE_PUBLIC (type_decl
) = 1;
6045 determine_visibility (type_decl
);
6047 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP
, t
);
6049 timevar_pop (TV_NAME_LOOKUP
);
6056 /* True when we should also visit template parameters that occur in
6057 non-deduced contexts. */
6058 bool include_nondeduced_p
;
6059 struct pointer_set_t
*visited
;
6062 /* Called from for_each_template_parm via walk_tree. */
6065 for_each_template_parm_r (tree
*tp
, int *walk_subtrees
, void *d
)
6068 struct pair_fn_data
*pfd
= (struct pair_fn_data
*) d
;
6069 tree_fn_t fn
= pfd
->fn
;
6070 void *data
= pfd
->data
;
6073 && (pfd
->include_nondeduced_p
|| TREE_CODE (t
) != TYPENAME_TYPE
)
6074 && for_each_template_parm (TYPE_CONTEXT (t
), fn
, data
, pfd
->visited
,
6075 pfd
->include_nondeduced_p
))
6076 return error_mark_node
;
6078 switch (TREE_CODE (t
))
6081 if (TYPE_PTRMEMFUNC_P (t
))
6087 if (!TYPE_TEMPLATE_INFO (t
))
6089 else if (for_each_template_parm (TREE_VALUE (TYPE_TEMPLATE_INFO (t
)),
6090 fn
, data
, pfd
->visited
,
6091 pfd
->include_nondeduced_p
))
6092 return error_mark_node
;
6096 if (for_each_template_parm (TYPE_MIN_VALUE (t
),
6097 fn
, data
, pfd
->visited
,
6098 pfd
->include_nondeduced_p
)
6099 || for_each_template_parm (TYPE_MAX_VALUE (t
),
6100 fn
, data
, pfd
->visited
,
6101 pfd
->include_nondeduced_p
))
6102 return error_mark_node
;
6106 /* Since we're not going to walk subtrees, we have to do this
6108 if (for_each_template_parm (TYPE_METHOD_BASETYPE (t
), fn
, data
,
6109 pfd
->visited
, pfd
->include_nondeduced_p
))
6110 return error_mark_node
;
6114 /* Check the return type. */
6115 if (for_each_template_parm (TREE_TYPE (t
), fn
, data
, pfd
->visited
,
6116 pfd
->include_nondeduced_p
))
6117 return error_mark_node
;
6119 /* Check the parameter types. Since default arguments are not
6120 instantiated until they are needed, the TYPE_ARG_TYPES may
6121 contain expressions that involve template parameters. But,
6122 no-one should be looking at them yet. And, once they're
6123 instantiated, they don't contain template parameters, so
6124 there's no point in looking at them then, either. */
6128 for (parm
= TYPE_ARG_TYPES (t
); parm
; parm
= TREE_CHAIN (parm
))
6129 if (for_each_template_parm (TREE_VALUE (parm
), fn
, data
,
6130 pfd
->visited
, pfd
->include_nondeduced_p
))
6131 return error_mark_node
;
6133 /* Since we've already handled the TYPE_ARG_TYPES, we don't
6134 want walk_tree walking into them itself. */
6140 if (pfd
->include_nondeduced_p
6141 && for_each_template_parm (TYPE_FIELDS (t
), fn
, data
,
6143 pfd
->include_nondeduced_p
))
6144 return error_mark_node
;
6149 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
)
6150 && for_each_template_parm (DECL_TI_ARGS (t
), fn
, data
,
6151 pfd
->visited
, pfd
->include_nondeduced_p
))
6152 return error_mark_node
;
6157 if (TREE_CODE (t
) == CONST_DECL
&& DECL_TEMPLATE_PARM_P (t
)
6158 && for_each_template_parm (DECL_INITIAL (t
), fn
, data
,
6159 pfd
->visited
, pfd
->include_nondeduced_p
))
6160 return error_mark_node
;
6161 if (DECL_CONTEXT (t
)
6162 && pfd
->include_nondeduced_p
6163 && for_each_template_parm (DECL_CONTEXT (t
), fn
, data
,
6164 pfd
->visited
, pfd
->include_nondeduced_p
))
6165 return error_mark_node
;
6168 case BOUND_TEMPLATE_TEMPLATE_PARM
:
6169 /* Record template parameters such as `T' inside `TT<T>'. */
6170 if (for_each_template_parm (TYPE_TI_ARGS (t
), fn
, data
, pfd
->visited
,
6171 pfd
->include_nondeduced_p
))
6172 return error_mark_node
;
6175 case TEMPLATE_TEMPLATE_PARM
:
6176 case TEMPLATE_TYPE_PARM
:
6177 case TEMPLATE_PARM_INDEX
:
6178 if (fn
&& (*fn
)(t
, data
))
6179 return error_mark_node
;
6181 return error_mark_node
;
6185 /* A template template parameter is encountered. */
6186 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
)
6187 && for_each_template_parm (TREE_TYPE (t
), fn
, data
, pfd
->visited
,
6188 pfd
->include_nondeduced_p
))
6189 return error_mark_node
;
6191 /* Already substituted template template parameter */
6197 || for_each_template_parm (TYPENAME_TYPE_FULLNAME (t
), fn
,
6199 pfd
->include_nondeduced_p
))
6200 return error_mark_node
;
6204 if (TREE_TYPE (t
) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t
))
6205 && pfd
->include_nondeduced_p
6206 && for_each_template_parm (TYPE_PTRMEMFUNC_FN_TYPE
6207 (TREE_TYPE (t
)), fn
, data
,
6208 pfd
->visited
, pfd
->include_nondeduced_p
))
6209 return error_mark_node
;
6214 /* If there's no type, then this thing must be some expression
6215 involving template parameters. */
6216 if (!fn
&& !TREE_TYPE (t
))
6217 return error_mark_node
;
6222 case REINTERPRET_CAST_EXPR
:
6223 case CONST_CAST_EXPR
:
6224 case STATIC_CAST_EXPR
:
6225 case DYNAMIC_CAST_EXPR
:
6229 case PSEUDO_DTOR_EXPR
:
6231 return error_mark_node
;
6238 /* We didn't find any template parameters we liked. */
6242 /* For each TEMPLATE_TYPE_PARM, TEMPLATE_TEMPLATE_PARM,
6243 BOUND_TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX in T,
6244 call FN with the parameter and the DATA.
6245 If FN returns nonzero, the iteration is terminated, and
6246 for_each_template_parm returns 1. Otherwise, the iteration
6247 continues. If FN never returns a nonzero value, the value
6248 returned by for_each_template_parm is 0. If FN is NULL, it is
6249 considered to be the function which always returns 1.
6251 If INCLUDE_NONDEDUCED_P, then this routine will also visit template
6252 parameters that occur in non-deduced contexts. When false, only
6253 visits those template parameters that can be deduced. */
6256 for_each_template_parm (tree t
, tree_fn_t fn
, void* data
,
6257 struct pointer_set_t
*visited
,
6258 bool include_nondeduced_p
)
6260 struct pair_fn_data pfd
;
6266 pfd
.include_nondeduced_p
= include_nondeduced_p
;
6268 /* Walk the tree. (Conceptually, we would like to walk without
6269 duplicates, but for_each_template_parm_r recursively calls
6270 for_each_template_parm, so we would need to reorganize a fair
6271 bit to use walk_tree_without_duplicates, so we keep our own
6274 pfd
.visited
= visited
;
6276 pfd
.visited
= pointer_set_create ();
6277 result
= cp_walk_tree (&t
,
6278 for_each_template_parm_r
,
6280 pfd
.visited
) != NULL_TREE
;
6285 pointer_set_destroy (pfd
.visited
);
6292 /* Returns true if T depends on any template parameter. */
6295 uses_template_parms (tree t
)
6298 int saved_processing_template_decl
;
6300 saved_processing_template_decl
= processing_template_decl
;
6301 if (!saved_processing_template_decl
)
6302 processing_template_decl
= 1;
6304 dependent_p
= dependent_type_p (t
);
6305 else if (TREE_CODE (t
) == TREE_VEC
)
6306 dependent_p
= any_dependent_template_arguments_p (t
);
6307 else if (TREE_CODE (t
) == TREE_LIST
)
6308 dependent_p
= (uses_template_parms (TREE_VALUE (t
))
6309 || uses_template_parms (TREE_CHAIN (t
)));
6310 else if (TREE_CODE (t
) == TYPE_DECL
)
6311 dependent_p
= dependent_type_p (TREE_TYPE (t
));
6314 || TREE_CODE (t
) == TEMPLATE_PARM_INDEX
6315 || TREE_CODE (t
) == OVERLOAD
6316 || TREE_CODE (t
) == BASELINK
6317 || TREE_CODE (t
) == IDENTIFIER_NODE
6318 || TREE_CODE (t
) == TRAIT_EXPR
6319 || CONSTANT_CLASS_P (t
))
6320 dependent_p
= (type_dependent_expression_p (t
)
6321 || value_dependent_expression_p (t
));
6324 gcc_assert (t
== error_mark_node
);
6325 dependent_p
= false;
6328 processing_template_decl
= saved_processing_template_decl
;
6333 /* Returns true if T depends on any template parameter with level LEVEL. */
6336 uses_template_parms_level (tree t
, int level
)
6338 return for_each_template_parm (t
, template_parm_this_level_p
, &level
, NULL
,
6339 /*include_nondeduced_p=*/true);
6342 static int tinst_depth
;
6343 extern int max_tinst_depth
;
6344 #ifdef GATHER_STATISTICS
6347 static int tinst_level_tick
;
6348 static int last_template_error_tick
;
6350 /* We're starting to instantiate D; record the template instantiation context
6351 for diagnostics and to restore it later. */
6354 push_tinst_level (tree d
)
6356 struct tinst_level
*new_level
;
6358 if (tinst_depth
>= max_tinst_depth
)
6360 /* If the instantiation in question still has unbound template parms,
6361 we don't really care if we can't instantiate it, so just return.
6362 This happens with base instantiation for implicit `typename'. */
6363 if (uses_template_parms (d
))
6366 last_template_error_tick
= tinst_level_tick
;
6367 error ("template instantiation depth exceeds maximum of %d (use "
6368 "-ftemplate-depth-NN to increase the maximum) instantiating %qD",
6369 max_tinst_depth
, d
);
6371 print_instantiation_context ();
6376 new_level
= GGC_NEW (struct tinst_level
);
6377 new_level
->decl
= d
;
6378 new_level
->locus
= input_location
;
6379 new_level
->in_system_header_p
= in_system_header
;
6380 new_level
->next
= current_tinst_level
;
6381 current_tinst_level
= new_level
;
6384 #ifdef GATHER_STATISTICS
6385 if (tinst_depth
> depth_reached
)
6386 depth_reached
= tinst_depth
;
6393 /* We're done instantiating this template; return to the instantiation
6397 pop_tinst_level (void)
6399 /* Restore the filename and line number stashed away when we started
6400 this instantiation. */
6401 input_location
= current_tinst_level
->locus
;
6402 current_tinst_level
= current_tinst_level
->next
;
6407 /* We're instantiating a deferred template; restore the template
6408 instantiation context in which the instantiation was requested, which
6409 is one step out from LEVEL. Return the corresponding DECL or TYPE. */
6412 reopen_tinst_level (struct tinst_level
*level
)
6414 struct tinst_level
*t
;
6417 for (t
= level
; t
; t
= t
->next
)
6420 current_tinst_level
= level
;
6425 /* Returns the TINST_LEVEL which gives the original instantiation
6428 struct tinst_level
*
6429 outermost_tinst_level (void)
6431 struct tinst_level
*level
= current_tinst_level
;
6434 level
= level
->next
;
6438 /* Returns TRUE if PARM is a parameter of the template TEMPL. */
6441 parameter_of_template_p (tree parm
, tree templ
)
6446 if (!parm
|| !templ
)
6449 gcc_assert (DECL_TEMPLATE_PARM_P (parm
));
6450 gcc_assert (TREE_CODE (templ
) == TEMPLATE_DECL
);
6452 parms
= DECL_TEMPLATE_PARMS (templ
);
6453 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
6455 for (i
= 0; i
< TREE_VEC_LENGTH (parms
); ++i
)
6456 if (parm
== TREE_VALUE (TREE_VEC_ELT (parms
, i
)))
6462 /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the
6463 vector of template arguments, as for tsubst.
6465 Returns an appropriate tsubst'd friend declaration. */
6468 tsubst_friend_function (tree decl
, tree args
)
6472 if (TREE_CODE (decl
) == FUNCTION_DECL
6473 && DECL_TEMPLATE_INSTANTIATION (decl
)
6474 && TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
6475 /* This was a friend declared with an explicit template
6476 argument list, e.g.:
6480 to indicate that f was a template instantiation, not a new
6481 function declaration. Now, we have to figure out what
6482 instantiation of what template. */
6484 tree template_id
, arglist
, fns
;
6487 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (current_class_type
));
6489 /* Friend functions are looked up in the containing namespace scope.
6490 We must enter that scope, to avoid finding member functions of the
6491 current class with same name. */
6492 push_nested_namespace (ns
);
6493 fns
= tsubst_expr (DECL_TI_TEMPLATE (decl
), args
,
6494 tf_warning_or_error
, NULL_TREE
,
6495 /*integral_constant_expression_p=*/false);
6496 pop_nested_namespace (ns
);
6497 arglist
= tsubst (DECL_TI_ARGS (decl
), args
,
6498 tf_warning_or_error
, NULL_TREE
);
6499 template_id
= lookup_template_function (fns
, arglist
);
6501 new_friend
= tsubst (decl
, args
, tf_warning_or_error
, NULL_TREE
);
6502 tmpl
= determine_specialization (template_id
, new_friend
,
6504 /*need_member_template=*/0,
6505 TREE_VEC_LENGTH (args
),
6507 return instantiate_template (tmpl
, new_args
, tf_error
);
6510 new_friend
= tsubst (decl
, args
, tf_warning_or_error
, NULL_TREE
);
6512 /* The NEW_FRIEND will look like an instantiation, to the
6513 compiler, but is not an instantiation from the point of view of
6514 the language. For example, we might have had:
6516 template <class T> struct S {
6517 template <class U> friend void f(T, U);
6520 Then, in S<int>, template <class U> void f(int, U) is not an
6521 instantiation of anything. */
6522 if (new_friend
== error_mark_node
)
6523 return error_mark_node
;
6525 DECL_USE_TEMPLATE (new_friend
) = 0;
6526 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
6528 DECL_USE_TEMPLATE (DECL_TEMPLATE_RESULT (new_friend
)) = 0;
6529 DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (new_friend
))
6530 = DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (decl
));
6533 /* The mangled name for the NEW_FRIEND is incorrect. The function
6534 is not a template instantiation and should not be mangled like
6535 one. Therefore, we forget the mangling here; we'll recompute it
6536 later if we need it. */
6537 if (TREE_CODE (new_friend
) != TEMPLATE_DECL
)
6539 SET_DECL_RTL (new_friend
, NULL_RTX
);
6540 SET_DECL_ASSEMBLER_NAME (new_friend
, NULL_TREE
);
6543 if (DECL_NAMESPACE_SCOPE_P (new_friend
))
6546 tree new_friend_template_info
;
6547 tree new_friend_result_template_info
;
6549 int new_friend_is_defn
;
6551 /* We must save some information from NEW_FRIEND before calling
6552 duplicate decls since that function will free NEW_FRIEND if
6554 new_friend_template_info
= DECL_TEMPLATE_INFO (new_friend
);
6555 new_friend_is_defn
=
6556 (DECL_INITIAL (DECL_TEMPLATE_RESULT
6557 (template_for_substitution (new_friend
)))
6559 if (TREE_CODE (new_friend
) == TEMPLATE_DECL
)
6561 /* This declaration is a `primary' template. */
6562 DECL_PRIMARY_TEMPLATE (new_friend
) = new_friend
;
6564 new_friend_result_template_info
6565 = DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (new_friend
));
6568 new_friend_result_template_info
= NULL_TREE
;
6570 /* Make the init_value nonzero so pushdecl knows this is a defn. */
6571 if (new_friend_is_defn
)
6572 DECL_INITIAL (new_friend
) = error_mark_node
;
6574 /* Inside pushdecl_namespace_level, we will push into the
6575 current namespace. However, the friend function should go
6576 into the namespace of the template. */
6577 ns
= decl_namespace_context (new_friend
);
6578 push_nested_namespace (ns
);
6579 old_decl
= pushdecl_namespace_level (new_friend
, /*is_friend=*/true);
6580 pop_nested_namespace (ns
);
6582 if (old_decl
== error_mark_node
)
6583 return error_mark_node
;
6585 if (old_decl
!= new_friend
)
6587 /* This new friend declaration matched an existing
6588 declaration. For example, given:
6590 template <class T> void f(T);
6591 template <class U> class C {
6592 template <class T> friend void f(T) {}
6595 the friend declaration actually provides the definition
6596 of `f', once C has been instantiated for some type. So,
6597 old_decl will be the out-of-class template declaration,
6598 while new_friend is the in-class definition.
6600 But, if `f' was called before this point, the
6601 instantiation of `f' will have DECL_TI_ARGS corresponding
6602 to `T' but not to `U', references to which might appear
6603 in the definition of `f'. Previously, the most general
6604 template for an instantiation of `f' was the out-of-class
6605 version; now it is the in-class version. Therefore, we
6606 run through all specialization of `f', adding to their
6607 DECL_TI_ARGS appropriately. In particular, they need a
6608 new set of outer arguments, corresponding to the
6609 arguments for this class instantiation.
6611 The same situation can arise with something like this:
6614 template <class T> class C {
6618 when `C<int>' is instantiated. Now, `f(int)' is defined
6621 if (!new_friend_is_defn
)
6622 /* On the other hand, if the in-class declaration does
6623 *not* provide a definition, then we don't want to alter
6624 existing definitions. We can just leave everything
6629 /* Overwrite whatever template info was there before, if
6630 any, with the new template information pertaining to
6632 DECL_TEMPLATE_INFO (old_decl
) = new_friend_template_info
;
6634 if (TREE_CODE (old_decl
) != TEMPLATE_DECL
)
6635 reregister_specialization (new_friend
,
6636 most_general_template (old_decl
),
6641 tree new_friend_args
;
6643 DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (old_decl
))
6644 = new_friend_result_template_info
;
6646 new_friend_args
= TI_ARGS (new_friend_template_info
);
6647 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (old_decl
);
6651 tree spec
= TREE_VALUE (t
);
6654 = add_outermost_template_args (new_friend_args
,
6655 DECL_TI_ARGS (spec
));
6658 /* Now, since specializations are always supposed to
6659 hang off of the most general template, we must move
6661 t
= most_general_template (old_decl
);
6664 DECL_TEMPLATE_SPECIALIZATIONS (t
)
6665 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (t
),
6666 DECL_TEMPLATE_SPECIALIZATIONS (old_decl
));
6667 DECL_TEMPLATE_SPECIALIZATIONS (old_decl
) = NULL_TREE
;
6672 /* The information from NEW_FRIEND has been merged into OLD_DECL
6673 by duplicate_decls. */
6674 new_friend
= old_decl
;
6679 tree context
= DECL_CONTEXT (new_friend
);
6683 template <class T> class C {
6684 template <class U> friend void C1<U>::f (); // case 1
6685 friend void C2<T>::f (); // case 2
6687 we only need to make sure CONTEXT is a complete type for
6688 case 2. To distinguish between the two cases, we note that
6689 CONTEXT of case 1 remains dependent type after tsubst while
6690 this isn't true for case 2. */
6691 ++processing_template_decl
;
6692 dependent_p
= dependent_type_p (context
);
6693 --processing_template_decl
;
6696 && !complete_type_or_else (context
, NULL_TREE
))
6697 return error_mark_node
;
6699 if (COMPLETE_TYPE_P (context
))
6701 /* Check to see that the declaration is really present, and,
6702 possibly obtain an improved declaration. */
6703 tree fn
= check_classfn (context
,
6704 new_friend
, NULL_TREE
);
6714 /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of
6715 template arguments, as for tsubst.
6717 Returns an appropriate tsubst'd friend type or error_mark_node on
6721 tsubst_friend_class (tree friend_tmpl
, tree args
)
6727 context
= DECL_CONTEXT (friend_tmpl
);
6731 if (TREE_CODE (context
) == NAMESPACE_DECL
)
6732 push_nested_namespace (context
);
6734 push_nested_class (tsubst (context
, args
, tf_none
, NULL_TREE
));
6737 /* Look for a class template declaration. We look for hidden names
6738 because two friend declarations of the same template are the
6739 same. For example, in:
6742 template <typename> friend class F;
6744 template <typename> struct B {
6745 template <typename> friend class F;
6748 both F templates are the same. */
6749 tmpl
= lookup_name_real (DECL_NAME (friend_tmpl
), 0, 0,
6750 /*block_p=*/true, 0,
6751 LOOKUP_COMPLAIN
| LOOKUP_HIDDEN
);
6753 /* But, if we don't find one, it might be because we're in a
6754 situation like this:
6762 Here, in the scope of (say) S<int>, `S' is bound to a TYPE_DECL
6763 for `S<int>', not the TEMPLATE_DECL. */
6764 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
6766 tmpl
= lookup_name_prefer_type (DECL_NAME (friend_tmpl
), 1);
6767 tmpl
= maybe_get_template_decl_from_type_decl (tmpl
);
6770 if (tmpl
&& DECL_CLASS_TEMPLATE_P (tmpl
))
6772 /* The friend template has already been declared. Just
6773 check to see that the declarations match, and install any new
6774 default parameters. We must tsubst the default parameters,
6775 of course. We only need the innermost template parameters
6776 because that is all that redeclare_class_template will look
6778 if (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (friend_tmpl
))
6779 > TMPL_ARGS_DEPTH (args
))
6782 location_t saved_input_location
;
6783 parms
= tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_tmpl
),
6784 args
, tf_warning_or_error
);
6786 saved_input_location
= input_location
;
6787 input_location
= DECL_SOURCE_LOCATION (friend_tmpl
);
6788 redeclare_class_template (TREE_TYPE (tmpl
), parms
);
6789 input_location
= saved_input_location
;
6793 friend_type
= TREE_TYPE (tmpl
);
6797 /* The friend template has not already been declared. In this
6798 case, the instantiation of the template class will cause the
6799 injection of this template into the global scope. */
6800 tmpl
= tsubst (friend_tmpl
, args
, tf_warning_or_error
, NULL_TREE
);
6801 if (tmpl
== error_mark_node
)
6802 return error_mark_node
;
6804 /* The new TMPL is not an instantiation of anything, so we
6805 forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE for
6806 the new type because that is supposed to be the corresponding
6807 template decl, i.e., TMPL. */
6808 DECL_USE_TEMPLATE (tmpl
) = 0;
6809 DECL_TEMPLATE_INFO (tmpl
) = NULL_TREE
;
6810 CLASSTYPE_USE_TEMPLATE (TREE_TYPE (tmpl
)) = 0;
6811 CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl
))
6812 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl
)));
6814 /* Inject this template into the global scope. */
6815 friend_type
= TREE_TYPE (pushdecl_top_level_maybe_friend (tmpl
, true));
6820 if (TREE_CODE (context
) == NAMESPACE_DECL
)
6821 pop_nested_namespace (context
);
6823 pop_nested_class ();
6829 /* Returns zero if TYPE cannot be completed later due to circularity.
6830 Otherwise returns one. */
6833 can_complete_type_without_circularity (tree type
)
6835 if (type
== NULL_TREE
|| type
== error_mark_node
)
6837 else if (COMPLETE_TYPE_P (type
))
6839 else if (TREE_CODE (type
) == ARRAY_TYPE
&& TYPE_DOMAIN (type
))
6840 return can_complete_type_without_circularity (TREE_TYPE (type
));
6841 else if (CLASS_TYPE_P (type
)
6842 && TYPE_BEING_DEFINED (TYPE_MAIN_VARIANT (type
)))
6848 /* Apply any attributes which had to be deferred until instantiation
6849 time. DECL_P, ATTRIBUTES and ATTR_FLAGS are as cplus_decl_attributes;
6850 ARGS, COMPLAIN, IN_DECL are as tsubst. */
6853 apply_late_template_attributes (tree
*decl_p
, tree attributes
, int attr_flags
,
6854 tree args
, tsubst_flags_t complain
, tree in_decl
)
6856 tree last_dep
= NULL_TREE
;
6860 for (t
= attributes
; t
; t
= TREE_CHAIN (t
))
6861 if (ATTR_IS_DEPENDENT (t
))
6864 attributes
= copy_list (attributes
);
6868 if (DECL_P (*decl_p
))
6870 if (TREE_TYPE (*decl_p
) == error_mark_node
)
6872 p
= &DECL_ATTRIBUTES (*decl_p
);
6875 p
= &TYPE_ATTRIBUTES (*decl_p
);
6879 tree late_attrs
= NULL_TREE
;
6880 tree
*q
= &late_attrs
;
6882 for (*p
= attributes
; *p
; )
6885 if (ATTR_IS_DEPENDENT (t
))
6887 *p
= TREE_CHAIN (t
);
6888 TREE_CHAIN (t
) = NULL_TREE
;
6889 /* If the first attribute argument is an identifier, don't
6890 pass it through tsubst. Attributes like mode, format,
6891 cleanup and several target specific attributes expect it
6894 && TREE_CODE (TREE_VALUE (t
)) == TREE_LIST
6895 && TREE_VALUE (TREE_VALUE (t
))
6896 && (TREE_CODE (TREE_VALUE (TREE_VALUE (t
)))
6897 == IDENTIFIER_NODE
))
6900 = tsubst_expr (TREE_CHAIN (TREE_VALUE (t
)), args
, complain
,
6902 /*integral_constant_expression_p=*/false);
6903 if (chain
!= TREE_CHAIN (TREE_VALUE (t
)))
6905 = tree_cons (NULL_TREE
, TREE_VALUE (TREE_VALUE (t
)),
6910 = tsubst_expr (TREE_VALUE (t
), args
, complain
, in_decl
,
6911 /*integral_constant_expression_p=*/false);
6913 q
= &TREE_CHAIN (t
);
6916 p
= &TREE_CHAIN (t
);
6919 cplus_decl_attributes (decl_p
, late_attrs
, attr_flags
);
6924 instantiate_class_template (tree type
)
6926 tree templ
, args
, pattern
, t
, member
;
6931 if (type
== error_mark_node
)
6932 return error_mark_node
;
6934 if (TYPE_BEING_DEFINED (type
)
6935 || COMPLETE_TYPE_P (type
)
6936 || dependent_type_p (type
))
6939 /* Figure out which template is being instantiated. */
6940 templ
= most_general_template (CLASSTYPE_TI_TEMPLATE (type
));
6941 gcc_assert (TREE_CODE (templ
) == TEMPLATE_DECL
);
6943 /* Determine what specialization of the original template to
6945 t
= most_specialized_class (type
, templ
);
6946 if (t
== error_mark_node
)
6948 TYPE_BEING_DEFINED (type
) = 1;
6949 return error_mark_node
;
6953 /* This TYPE is actually an instantiation of a partial
6954 specialization. We replace the innermost set of ARGS with
6955 the arguments appropriate for substitution. For example,
6958 template <class T> struct S {};
6959 template <class T> struct S<T*> {};
6961 and supposing that we are instantiating S<int*>, ARGS will
6962 presently be {int*} -- but we need {int}. */
6963 pattern
= TREE_TYPE (t
);
6964 args
= TREE_PURPOSE (t
);
6968 pattern
= TREE_TYPE (templ
);
6969 args
= CLASSTYPE_TI_ARGS (type
);
6972 /* If the template we're instantiating is incomplete, then clearly
6973 there's nothing we can do. */
6974 if (!COMPLETE_TYPE_P (pattern
))
6977 /* If we've recursively instantiated too many templates, stop. */
6978 if (! push_tinst_level (type
))
6981 /* Now we're really doing the instantiation. Mark the type as in
6982 the process of being defined. */
6983 TYPE_BEING_DEFINED (type
) = 1;
6985 /* We may be in the middle of deferred access check. Disable
6987 push_deferring_access_checks (dk_no_deferred
);
6989 push_to_top_level ();
6991 SET_CLASSTYPE_INTERFACE_UNKNOWN (type
);
6993 /* Set the input location to the template definition. This is needed
6994 if tsubsting causes an error. */
6995 typedecl
= TYPE_MAIN_DECL (type
);
6996 input_location
= DECL_SOURCE_LOCATION (typedecl
);
6998 TYPE_HAS_USER_CONSTRUCTOR (type
) = TYPE_HAS_USER_CONSTRUCTOR (pattern
);
6999 TYPE_HAS_NEW_OPERATOR (type
) = TYPE_HAS_NEW_OPERATOR (pattern
);
7000 TYPE_HAS_ARRAY_NEW_OPERATOR (type
) = TYPE_HAS_ARRAY_NEW_OPERATOR (pattern
);
7001 TYPE_GETS_DELETE (type
) = TYPE_GETS_DELETE (pattern
);
7002 TYPE_HAS_ASSIGN_REF (type
) = TYPE_HAS_ASSIGN_REF (pattern
);
7003 TYPE_HAS_CONST_ASSIGN_REF (type
) = TYPE_HAS_CONST_ASSIGN_REF (pattern
);
7004 TYPE_HAS_INIT_REF (type
) = TYPE_HAS_INIT_REF (pattern
);
7005 TYPE_HAS_CONST_INIT_REF (type
) = TYPE_HAS_CONST_INIT_REF (pattern
);
7006 TYPE_HAS_DEFAULT_CONSTRUCTOR (type
) = TYPE_HAS_DEFAULT_CONSTRUCTOR (pattern
);
7007 TYPE_HAS_CONVERSION (type
) = TYPE_HAS_CONVERSION (pattern
);
7008 TYPE_PACKED (type
) = TYPE_PACKED (pattern
);
7009 TYPE_ALIGN (type
) = TYPE_ALIGN (pattern
);
7010 TYPE_USER_ALIGN (type
) = TYPE_USER_ALIGN (pattern
);
7011 TYPE_FOR_JAVA (type
) = TYPE_FOR_JAVA (pattern
); /* For libjava's JArray<T> */
7012 if (ANON_AGGR_TYPE_P (pattern
))
7013 SET_ANON_AGGR_TYPE_P (type
);
7014 if (CLASSTYPE_VISIBILITY_SPECIFIED (pattern
))
7016 CLASSTYPE_VISIBILITY_SPECIFIED (type
) = 1;
7017 CLASSTYPE_VISIBILITY (type
) = CLASSTYPE_VISIBILITY (pattern
);
7020 pbinfo
= TYPE_BINFO (pattern
);
7022 /* We should never instantiate a nested class before its enclosing
7023 class; we need to look up the nested class by name before we can
7024 instantiate it, and that lookup should instantiate the enclosing
7026 gcc_assert (!DECL_CLASS_SCOPE_P (TYPE_MAIN_DECL (pattern
))
7027 || COMPLETE_TYPE_P (TYPE_CONTEXT (type
))
7028 || TYPE_BEING_DEFINED (TYPE_CONTEXT (type
)));
7030 base_list
= NULL_TREE
;
7031 if (BINFO_N_BASE_BINFOS (pbinfo
))
7034 tree context
= TYPE_CONTEXT (type
);
7038 /* We must enter the scope containing the type, as that is where
7039 the accessibility of types named in dependent bases are
7041 pushed_scope
= push_scope (context
? context
: global_namespace
);
7043 /* Substitute into each of the bases to determine the actual
7045 for (i
= 0; BINFO_BASE_ITERATE (pbinfo
, i
, pbase_binfo
); i
++)
7048 tree access
= BINFO_BASE_ACCESS (pbinfo
, i
);
7049 tree expanded_bases
= NULL_TREE
;
7052 if (PACK_EXPANSION_P (BINFO_TYPE (pbase_binfo
)))
7055 tsubst_pack_expansion (BINFO_TYPE (pbase_binfo
),
7056 args
, tf_error
, NULL_TREE
);
7057 if (expanded_bases
== error_mark_node
)
7060 len
= TREE_VEC_LENGTH (expanded_bases
);
7063 for (idx
= 0; idx
< len
; idx
++)
7066 /* Extract the already-expanded base class. */
7067 base
= TREE_VEC_ELT (expanded_bases
, idx
);
7069 /* Substitute to figure out the base class. */
7070 base
= tsubst (BINFO_TYPE (pbase_binfo
), args
, tf_error
,
7073 if (base
== error_mark_node
)
7076 base_list
= tree_cons (access
, base
, base_list
);
7077 if (BINFO_VIRTUAL_P (pbase_binfo
))
7078 TREE_TYPE (base_list
) = integer_type_node
;
7082 /* The list is now in reverse order; correct that. */
7083 base_list
= nreverse (base_list
);
7086 pop_scope (pushed_scope
);
7088 /* Now call xref_basetypes to set up all the base-class
7090 xref_basetypes (type
, base_list
);
7092 apply_late_template_attributes (&type
, TYPE_ATTRIBUTES (pattern
),
7093 (int) ATTR_FLAG_TYPE_IN_PLACE
,
7094 args
, tf_error
, NULL_TREE
);
7096 /* Now that our base classes are set up, enter the scope of the
7097 class, so that name lookups into base classes, etc. will work
7098 correctly. This is precisely analogous to what we do in
7099 begin_class_definition when defining an ordinary non-template
7100 class, except we also need to push the enclosing classes. */
7101 push_nested_class (type
);
7103 /* Now members are processed in the order of declaration. */
7104 for (member
= CLASSTYPE_DECL_LIST (pattern
);
7105 member
; member
= TREE_CHAIN (member
))
7107 tree t
= TREE_VALUE (member
);
7109 if (TREE_PURPOSE (member
))
7113 /* Build new CLASSTYPE_NESTED_UTDS. */
7116 bool class_template_p
;
7118 class_template_p
= (TREE_CODE (t
) != ENUMERAL_TYPE
7119 && TYPE_LANG_SPECIFIC (t
)
7120 && CLASSTYPE_IS_TEMPLATE (t
));
7121 /* If the member is a class template, then -- even after
7122 substitution -- there may be dependent types in the
7123 template argument list for the class. We increment
7124 PROCESSING_TEMPLATE_DECL so that dependent_type_p, as
7125 that function will assume that no types are dependent
7126 when outside of a template. */
7127 if (class_template_p
)
7128 ++processing_template_decl
;
7129 newtag
= tsubst (t
, args
, tf_error
, NULL_TREE
);
7130 if (class_template_p
)
7131 --processing_template_decl
;
7132 if (newtag
== error_mark_node
)
7135 if (TREE_CODE (newtag
) != ENUMERAL_TYPE
)
7137 tree name
= TYPE_IDENTIFIER (t
);
7139 if (class_template_p
)
7140 /* Unfortunately, lookup_template_class sets
7141 CLASSTYPE_IMPLICIT_INSTANTIATION for a partial
7142 instantiation (i.e., for the type of a member
7143 template class nested within a template class.)
7144 This behavior is required for
7145 maybe_process_partial_specialization to work
7146 correctly, but is not accurate in this case;
7147 the TAG is not an instantiation of anything.
7148 (The corresponding TEMPLATE_DECL is an
7149 instantiation, but the TYPE is not.) */
7150 CLASSTYPE_USE_TEMPLATE (newtag
) = 0;
7152 /* Now, we call pushtag to put this NEWTAG into the scope of
7153 TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid
7154 pushtag calling push_template_decl. We don't have to do
7155 this for enums because it will already have been done in
7158 SET_IDENTIFIER_TYPE_VALUE (name
, newtag
);
7159 pushtag (name
, newtag
, /*tag_scope=*/ts_current
);
7162 else if (TREE_CODE (t
) == FUNCTION_DECL
7163 || DECL_FUNCTION_TEMPLATE_P (t
))
7165 /* Build new TYPE_METHODS. */
7168 if (TREE_CODE (t
) == TEMPLATE_DECL
)
7169 ++processing_template_decl
;
7170 r
= tsubst (t
, args
, tf_error
, NULL_TREE
);
7171 if (TREE_CODE (t
) == TEMPLATE_DECL
)
7172 --processing_template_decl
;
7173 set_current_access_from_decl (r
);
7174 finish_member_declaration (r
);
7178 /* Build new TYPE_FIELDS. */
7179 if (TREE_CODE (t
) == STATIC_ASSERT
)
7182 tsubst_expr (STATIC_ASSERT_CONDITION (t
), args
,
7183 tf_warning_or_error
, NULL_TREE
,
7184 /*integral_constant_expression_p=*/true);
7185 finish_static_assert (condition
,
7186 STATIC_ASSERT_MESSAGE (t
),
7187 STATIC_ASSERT_SOURCE_LOCATION (t
),
7190 else if (TREE_CODE (t
) != CONST_DECL
)
7194 /* The file and line for this declaration, to
7195 assist in error message reporting. Since we
7196 called push_tinst_level above, we don't need to
7198 input_location
= DECL_SOURCE_LOCATION (t
);
7200 if (TREE_CODE (t
) == TEMPLATE_DECL
)
7201 ++processing_template_decl
;
7202 r
= tsubst (t
, args
, tf_warning_or_error
, NULL_TREE
);
7203 if (TREE_CODE (t
) == TEMPLATE_DECL
)
7204 --processing_template_decl
;
7205 if (TREE_CODE (r
) == VAR_DECL
)
7209 [t]he initialization (and any associated
7210 side-effects) of a static data member does
7211 not occur unless the static data member is
7212 itself used in a way that requires the
7213 definition of the static data member to
7216 Therefore, we do not substitute into the
7217 initialized for the static data member here. */
7218 finish_static_data_member_decl
7221 /*init_const_expr_p=*/false,
7222 /*asmspec_tree=*/NULL_TREE
,
7224 if (DECL_INITIALIZED_IN_CLASS_P (r
))
7225 check_static_variable_definition (r
, TREE_TYPE (r
));
7227 else if (TREE_CODE (r
) == FIELD_DECL
)
7229 /* Determine whether R has a valid type and can be
7230 completed later. If R is invalid, then it is
7231 replaced by error_mark_node so that it will not be
7232 added to TYPE_FIELDS. */
7233 tree rtype
= TREE_TYPE (r
);
7234 if (can_complete_type_without_circularity (rtype
))
7235 complete_type (rtype
);
7237 if (!COMPLETE_TYPE_P (rtype
))
7239 cxx_incomplete_type_error (r
, rtype
);
7240 r
= error_mark_node
;
7244 /* If it is a TYPE_DECL for a class-scoped ENUMERAL_TYPE,
7245 such a thing will already have been added to the field
7246 list by tsubst_enum in finish_member_declaration in the
7247 CLASSTYPE_NESTED_UTDS case above. */
7248 if (!(TREE_CODE (r
) == TYPE_DECL
7249 && TREE_CODE (TREE_TYPE (r
)) == ENUMERAL_TYPE
7250 && DECL_ARTIFICIAL (r
)))
7252 set_current_access_from_decl (r
);
7253 finish_member_declaration (r
);
7260 if (TYPE_P (t
) || DECL_CLASS_TEMPLATE_P (t
))
7262 /* Build new CLASSTYPE_FRIEND_CLASSES. */
7264 tree friend_type
= t
;
7265 bool adjust_processing_template_decl
= false;
7267 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
7269 /* template <class T> friend class C; */
7270 friend_type
= tsubst_friend_class (friend_type
, args
);
7271 adjust_processing_template_decl
= true;
7273 else if (TREE_CODE (friend_type
) == UNBOUND_CLASS_TEMPLATE
)
7275 /* template <class T> friend class C::D; */
7276 friend_type
= tsubst (friend_type
, args
,
7277 tf_warning_or_error
, NULL_TREE
);
7278 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
7279 friend_type
= TREE_TYPE (friend_type
);
7280 adjust_processing_template_decl
= true;
7282 else if (TREE_CODE (friend_type
) == TYPENAME_TYPE
)
7284 /* This could be either
7288 when dependent_type_p is false or
7290 template <class U> friend class T::C;
7293 friend_type
= tsubst (friend_type
, args
,
7294 tf_warning_or_error
, NULL_TREE
);
7295 /* Bump processing_template_decl for correct
7296 dependent_type_p calculation. */
7297 ++processing_template_decl
;
7298 if (dependent_type_p (friend_type
))
7299 adjust_processing_template_decl
= true;
7300 --processing_template_decl
;
7302 else if (!CLASSTYPE_USE_TEMPLATE (friend_type
)
7303 && hidden_name_p (TYPE_NAME (friend_type
)))
7307 where C hasn't been declared yet. Let's lookup name
7308 from namespace scope directly, bypassing any name that
7309 come from dependent base class. */
7310 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (friend_type
));
7312 /* The call to xref_tag_from_type does injection for friend
7314 push_nested_namespace (ns
);
7316 xref_tag_from_type (friend_type
, NULL_TREE
,
7317 /*tag_scope=*/ts_current
);
7318 pop_nested_namespace (ns
);
7320 else if (uses_template_parms (friend_type
))
7321 /* friend class C<T>; */
7322 friend_type
= tsubst (friend_type
, args
,
7323 tf_warning_or_error
, NULL_TREE
);
7328 where C is already declared or
7330 friend class C<int>;
7332 We don't have to do anything in these cases. */
7334 if (adjust_processing_template_decl
)
7335 /* Trick make_friend_class into realizing that the friend
7336 we're adding is a template, not an ordinary class. It's
7337 important that we use make_friend_class since it will
7338 perform some error-checking and output cross-reference
7340 ++processing_template_decl
;
7342 if (friend_type
!= error_mark_node
)
7343 make_friend_class (type
, friend_type
, /*complain=*/false);
7345 if (adjust_processing_template_decl
)
7346 --processing_template_decl
;
7350 /* Build new DECL_FRIENDLIST. */
7353 /* The file and line for this declaration, to
7354 assist in error message reporting. Since we
7355 called push_tinst_level above, we don't need to
7357 input_location
= DECL_SOURCE_LOCATION (t
);
7359 if (TREE_CODE (t
) == TEMPLATE_DECL
)
7361 ++processing_template_decl
;
7362 push_deferring_access_checks (dk_no_check
);
7365 r
= tsubst_friend_function (t
, args
);
7366 add_friend (type
, r
, /*complain=*/false);
7367 if (TREE_CODE (t
) == TEMPLATE_DECL
)
7369 pop_deferring_access_checks ();
7370 --processing_template_decl
;
7376 /* Set the file and line number information to whatever is given for
7377 the class itself. This puts error messages involving generated
7378 implicit functions at a predictable point, and the same point
7379 that would be used for non-template classes. */
7380 input_location
= DECL_SOURCE_LOCATION (typedecl
);
7382 unreverse_member_declarations (type
);
7383 finish_struct_1 (type
);
7384 TYPE_BEING_DEFINED (type
) = 0;
7386 /* Now that the class is complete, instantiate default arguments for
7387 any member functions. We don't do this earlier because the
7388 default arguments may reference members of the class. */
7389 if (!PRIMARY_TEMPLATE_P (templ
))
7390 for (t
= TYPE_METHODS (type
); t
; t
= TREE_CHAIN (t
))
7391 if (TREE_CODE (t
) == FUNCTION_DECL
7392 /* Implicitly generated member functions will not have template
7393 information; they are not instantiations, but instead are
7394 created "fresh" for each instantiation. */
7395 && DECL_TEMPLATE_INFO (t
))
7396 tsubst_default_arguments (t
);
7398 pop_nested_class ();
7399 pop_from_top_level ();
7400 pop_deferring_access_checks ();
7403 /* The vtable for a template class can be emitted in any translation
7404 unit in which the class is instantiated. When there is no key
7405 method, however, finish_struct_1 will already have added TYPE to
7406 the keyed_classes list. */
7407 if (TYPE_CONTAINS_VPTR_P (type
) && CLASSTYPE_KEY_METHOD (type
))
7408 keyed_classes
= tree_cons (NULL_TREE
, type
, keyed_classes
);
7414 tsubst_template_arg (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
7420 else if (TYPE_P (t
))
7421 r
= tsubst (t
, args
, complain
, in_decl
);
7424 r
= tsubst_expr (t
, args
, complain
, in_decl
,
7425 /*integral_constant_expression_p=*/true);
7426 r
= fold_non_dependent_expr (r
);
7431 /* Substitute ARGS into T, which is an pack expansion
7432 (i.e. TYPE_PACK_EXPANSION or EXPR_PACK_EXPANSION). Returns a
7433 TREE_VEC with the substituted arguments, a PACK_EXPANSION_* node
7434 (if only a partial substitution could be performed) or
7435 ERROR_MARK_NODE if there was an error. */
7437 tsubst_pack_expansion (tree t
, tree args
, tsubst_flags_t complain
,
7441 tree pack
, packs
= NULL_TREE
, unsubstituted_packs
= NULL_TREE
;
7442 tree first_arg_pack
; int i
, len
= -1;
7446 gcc_assert (PACK_EXPANSION_P (t
));
7447 pattern
= PACK_EXPANSION_PATTERN (t
);
7449 /* Determine the argument packs that will instantiate the parameter
7450 packs used in the expansion expression. While we're at it,
7451 compute the number of arguments to be expanded and make sure it
7453 for (pack
= PACK_EXPANSION_PARAMETER_PACKS (t
); pack
;
7454 pack
= TREE_CHAIN (pack
))
7456 tree parm_pack
= TREE_VALUE (pack
);
7457 tree arg_pack
= NULL_TREE
;
7458 tree orig_arg
= NULL_TREE
;
7460 if (TREE_CODE (parm_pack
) == PARM_DECL
)
7461 arg_pack
= retrieve_local_specialization (parm_pack
);
7464 int level
, idx
, levels
;
7465 template_parm_level_and_index (parm_pack
, &level
, &idx
);
7467 levels
= TMPL_ARGS_DEPTH (args
);
7468 if (level
<= levels
)
7469 arg_pack
= TMPL_ARG (args
, level
, idx
);
7472 orig_arg
= arg_pack
;
7473 if (arg_pack
&& TREE_CODE (arg_pack
) == ARGUMENT_PACK_SELECT
)
7474 arg_pack
= ARGUMENT_PACK_SELECT_FROM_PACK (arg_pack
);
7476 if (arg_pack
&& !ARGUMENT_PACK_P (arg_pack
))
7477 /* This can only happen if we forget to expand an argument
7478 pack somewhere else. Just return an error, silently. */
7480 result
= make_tree_vec (1);
7481 TREE_VEC_ELT (result
, 0) = error_mark_node
;
7486 && TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg_pack
)) == 1
7487 && PACK_EXPANSION_P (TREE_VEC_ELT (ARGUMENT_PACK_ARGS (arg_pack
), 0)))
7489 tree expansion
= TREE_VEC_ELT (ARGUMENT_PACK_ARGS (arg_pack
), 0);
7490 tree pattern
= PACK_EXPANSION_PATTERN (expansion
);
7491 if ((TYPE_P (pattern
) && same_type_p (pattern
, parm_pack
))
7492 || (!TYPE_P (pattern
) && cp_tree_equal (parm_pack
, pattern
)))
7493 /* The argument pack that the parameter maps to is just an
7494 expansion of the parameter itself, such as one would
7495 find in the implicit typedef of a class inside the
7496 class itself. Consider this parameter "unsubstituted",
7497 so that we will maintain the outer pack expansion. */
7498 arg_pack
= NULL_TREE
;
7504 TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg_pack
));
7506 /* It's all-or-nothing with incomplete argument packs. */
7507 if (incomplete
&& !ARGUMENT_PACK_INCOMPLETE_P (arg_pack
))
7508 return error_mark_node
;
7510 if (ARGUMENT_PACK_INCOMPLETE_P (arg_pack
))
7516 first_arg_pack
= arg_pack
;
7518 else if (len
!= my_len
)
7520 if (TREE_CODE (t
) == TYPE_PACK_EXPANSION
)
7521 error ("mismatched argument pack lengths while expanding "
7525 error ("mismatched argument pack lengths while expanding "
7528 return error_mark_node
;
7531 /* Keep track of the parameter packs and their corresponding
7533 packs
= tree_cons (parm_pack
, arg_pack
, packs
);
7534 TREE_TYPE (packs
) = orig_arg
;
7537 /* We can't substitute for this parameter pack. */
7538 unsubstituted_packs
= tree_cons (TREE_PURPOSE (pack
),
7540 unsubstituted_packs
);
7543 /* We cannot expand this expansion expression, because we don't have
7544 all of the argument packs we need. Substitute into the pattern
7545 and return a PACK_EXPANSION_*. The caller will need to deal with
7547 if (unsubstituted_packs
)
7548 return make_pack_expansion (tsubst (pattern
, args
, complain
,
7551 /* We could not find any argument packs that work. */
7553 return error_mark_node
;
7555 /* For each argument in each argument pack, substitute into the
7557 result
= make_tree_vec (len
+ incomplete
);
7558 for (i
= 0; i
< len
+ incomplete
; ++i
)
7560 /* For parameter pack, change the substitution of the parameter
7561 pack to the ith argument in its argument pack, then expand
7563 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
7565 tree parm
= TREE_PURPOSE (pack
);
7567 if (TREE_CODE (parm
) == PARM_DECL
)
7569 /* Select the Ith argument from the pack. */
7570 tree arg
= make_node (ARGUMENT_PACK_SELECT
);
7571 ARGUMENT_PACK_SELECT_FROM_PACK (arg
) = TREE_VALUE (pack
);
7572 ARGUMENT_PACK_SELECT_INDEX (arg
) = i
;
7574 register_local_specialization (arg
, parm
);
7580 template_parm_level_and_index (parm
, &level
, &idx
);
7584 /* Select the Ith argument from the pack. */
7585 value
= make_node (ARGUMENT_PACK_SELECT
);
7586 ARGUMENT_PACK_SELECT_FROM_PACK (value
) = TREE_VALUE (pack
);
7587 ARGUMENT_PACK_SELECT_INDEX (value
) = i
;
7590 /* Update the corresponding argument. */
7591 TMPL_ARG (args
, level
, idx
) = value
;
7595 /* Substitute into the PATTERN with the altered arguments. */
7596 if (TREE_CODE (t
) == EXPR_PACK_EXPANSION
)
7597 TREE_VEC_ELT (result
, i
) =
7598 tsubst_expr (pattern
, args
, complain
, in_decl
,
7599 /*integral_constant_expression_p=*/false);
7601 TREE_VEC_ELT (result
, i
) = tsubst (pattern
, args
, complain
, in_decl
);
7604 /* When we have incomplete argument packs, the last "expanded"
7605 result is itself a pack expansion, which allows us
7606 to deduce more arguments. */
7607 TREE_VEC_ELT (result
, i
) =
7608 make_pack_expansion (TREE_VEC_ELT (result
, i
));
7610 if (TREE_VEC_ELT (result
, i
) == error_mark_node
)
7612 result
= error_mark_node
;
7617 /* Update ARGS to restore the substitution from parameter packs to
7618 their argument packs. */
7619 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
7621 tree parm
= TREE_PURPOSE (pack
);
7623 if (TREE_CODE (parm
) == PARM_DECL
)
7624 register_local_specialization (TREE_TYPE (pack
), parm
);
7628 template_parm_level_and_index (parm
, &level
, &idx
);
7630 /* Update the corresponding argument. */
7631 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
7632 TREE_VEC_ELT (TREE_VEC_ELT (args
, level
-1 ), idx
) =
7635 TREE_VEC_ELT (args
, idx
) = TREE_TYPE (pack
);
7642 /* Substitute ARGS into the vector or list of template arguments T. */
7645 tsubst_template_args (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
7648 int len
= TREE_VEC_LENGTH (t
);
7649 int need_new
= 0, i
, expanded_len_adjust
= 0, out
;
7650 tree
*elts
= (tree
*) alloca (len
* sizeof (tree
));
7652 for (i
= 0; i
< len
; i
++)
7654 tree orig_arg
= TREE_VEC_ELT (t
, i
);
7657 if (TREE_CODE (orig_arg
) == TREE_VEC
)
7658 new_arg
= tsubst_template_args (orig_arg
, args
, complain
, in_decl
);
7659 else if (PACK_EXPANSION_P (orig_arg
))
7661 /* Substitute into an expansion expression. */
7662 new_arg
= tsubst_pack_expansion (orig_arg
, args
, complain
, in_decl
);
7664 if (TREE_CODE (new_arg
) == TREE_VEC
)
7665 /* Add to the expanded length adjustment the number of
7666 expanded arguments. We subtract one from this
7667 measurement, because the argument pack expression
7668 itself is already counted as 1 in
7669 LEN. EXPANDED_LEN_ADJUST can actually be negative, if
7670 the argument pack is empty. */
7671 expanded_len_adjust
+= TREE_VEC_LENGTH (new_arg
) - 1;
7673 else if (ARGUMENT_PACK_P (orig_arg
))
7675 /* Substitute into each of the arguments. */
7676 new_arg
= make_node (TREE_CODE (orig_arg
));
7678 SET_ARGUMENT_PACK_ARGS (
7680 tsubst_template_args (ARGUMENT_PACK_ARGS (orig_arg
),
7681 args
, complain
, in_decl
));
7683 if (ARGUMENT_PACK_ARGS (new_arg
) == error_mark_node
)
7684 new_arg
= error_mark_node
;
7686 if (TREE_CODE (new_arg
) == NONTYPE_ARGUMENT_PACK
) {
7687 TREE_TYPE (new_arg
) = tsubst (TREE_TYPE (orig_arg
), args
,
7689 TREE_CONSTANT (new_arg
) = TREE_CONSTANT (orig_arg
);
7691 if (TREE_TYPE (new_arg
) == error_mark_node
)
7692 new_arg
= error_mark_node
;
7696 new_arg
= tsubst_template_arg (orig_arg
, args
, complain
, in_decl
);
7698 if (new_arg
== error_mark_node
)
7699 return error_mark_node
;
7702 if (new_arg
!= orig_arg
)
7709 /* Make space for the expanded arguments coming from template
7711 t
= make_tree_vec (len
+ expanded_len_adjust
);
7712 for (i
= 0, out
= 0; i
< len
; i
++)
7714 if ((PACK_EXPANSION_P (TREE_VEC_ELT (orig_t
, i
))
7715 || ARGUMENT_PACK_P (TREE_VEC_ELT (orig_t
, i
)))
7716 && TREE_CODE (elts
[i
]) == TREE_VEC
)
7720 /* Now expand the template argument pack "in place". */
7721 for (idx
= 0; idx
< TREE_VEC_LENGTH (elts
[i
]); idx
++, out
++)
7722 TREE_VEC_ELT (t
, out
) = TREE_VEC_ELT (elts
[i
], idx
);
7726 TREE_VEC_ELT (t
, out
) = elts
[i
];
7734 /* Return the result of substituting ARGS into the template parameters
7735 given by PARMS. If there are m levels of ARGS and m + n levels of
7736 PARMS, then the result will contain n levels of PARMS. For
7737 example, if PARMS is `template <class T> template <class U>
7738 template <T*, U, class V>' and ARGS is {{int}, {double}} then the
7739 result will be `template <int*, double, class V>'. */
7742 tsubst_template_parms (tree parms
, tree args
, tsubst_flags_t complain
)
7747 /* When substituting into a template, we must set
7748 PROCESSING_TEMPLATE_DECL as the template parameters may be
7749 dependent if they are based on one-another, and the dependency
7750 predicates are short-circuit outside of templates. */
7751 ++processing_template_decl
;
7753 for (new_parms
= &r
;
7754 TMPL_PARMS_DEPTH (parms
) > TMPL_ARGS_DEPTH (args
);
7755 new_parms
= &(TREE_CHAIN (*new_parms
)),
7756 parms
= TREE_CHAIN (parms
))
7759 make_tree_vec (TREE_VEC_LENGTH (TREE_VALUE (parms
)));
7762 for (i
= 0; i
< TREE_VEC_LENGTH (new_vec
); ++i
)
7768 if (parms
== error_mark_node
)
7771 tuple
= TREE_VEC_ELT (TREE_VALUE (parms
), i
);
7773 if (tuple
== error_mark_node
)
7776 default_value
= TREE_PURPOSE (tuple
);
7777 parm_decl
= TREE_VALUE (tuple
);
7779 parm_decl
= tsubst (parm_decl
, args
, complain
, NULL_TREE
);
7780 if (TREE_CODE (parm_decl
) == PARM_DECL
7781 && invalid_nontype_parm_type_p (TREE_TYPE (parm_decl
), complain
))
7782 parm_decl
= error_mark_node
;
7783 default_value
= tsubst_template_arg (default_value
, args
,
7784 complain
, NULL_TREE
);
7786 tuple
= build_tree_list (default_value
, parm_decl
);
7787 TREE_VEC_ELT (new_vec
, i
) = tuple
;
7791 tree_cons (size_int (TMPL_PARMS_DEPTH (parms
)
7792 - TMPL_ARGS_DEPTH (args
)),
7793 new_vec
, NULL_TREE
);
7796 --processing_template_decl
;
7801 /* Substitute the ARGS into the indicated aggregate (or enumeration)
7802 type T. If T is not an aggregate or enumeration type, it is
7803 handled as if by tsubst. IN_DECL is as for tsubst. If
7804 ENTERING_SCOPE is nonzero, T is the context for a template which
7805 we are presently tsubst'ing. Return the substituted value. */
7808 tsubst_aggr_type (tree t
,
7810 tsubst_flags_t complain
,
7817 switch (TREE_CODE (t
))
7820 if (TYPE_PTRMEMFUNC_P (t
))
7821 return tsubst (TYPE_PTRMEMFUNC_FN_TYPE (t
), args
, complain
, in_decl
);
7823 /* Else fall through. */
7826 if (TYPE_TEMPLATE_INFO (t
) && uses_template_parms (t
))
7831 bool saved_skip_evaluation
;
7833 /* In "sizeof(X<I>)" we need to evaluate "I". */
7834 saved_skip_evaluation
= skip_evaluation
;
7835 skip_evaluation
= false;
7837 /* First, determine the context for the type we are looking
7839 context
= TYPE_CONTEXT (t
);
7842 context
= tsubst_aggr_type (context
, args
, complain
,
7843 in_decl
, /*entering_scope=*/1);
7844 /* If context is a nested class inside a class template,
7845 it may still need to be instantiated (c++/33959). */
7846 if (TYPE_P (context
))
7847 context
= complete_type (context
);
7850 /* Then, figure out what arguments are appropriate for the
7851 type we are trying to find. For example, given:
7853 template <class T> struct S;
7854 template <class T, class U> void f(T, U) { S<U> su; }
7856 and supposing that we are instantiating f<int, double>,
7857 then our ARGS will be {int, double}, but, when looking up
7858 S we only want {double}. */
7859 argvec
= tsubst_template_args (TYPE_TI_ARGS (t
), args
,
7861 if (argvec
== error_mark_node
)
7862 r
= error_mark_node
;
7865 r
= lookup_template_class (t
, argvec
, in_decl
, context
,
7866 entering_scope
, complain
);
7867 r
= cp_build_qualified_type_real (r
, TYPE_QUALS (t
), complain
);
7870 skip_evaluation
= saved_skip_evaluation
;
7875 /* This is not a template type, so there's nothing to do. */
7879 return tsubst (t
, args
, complain
, in_decl
);
7883 /* Substitute into the default argument ARG (a default argument for
7884 FN), which has the indicated TYPE. */
7887 tsubst_default_argument (tree fn
, tree type
, tree arg
)
7889 tree saved_class_ptr
= NULL_TREE
;
7890 tree saved_class_ref
= NULL_TREE
;
7892 /* This default argument came from a template. Instantiate the
7893 default argument here, not in tsubst. In the case of
7902 we must be careful to do name lookup in the scope of S<T>,
7903 rather than in the current class. */
7904 push_access_scope (fn
);
7905 /* The "this" pointer is not valid in a default argument. */
7908 saved_class_ptr
= current_class_ptr
;
7909 cp_function_chain
->x_current_class_ptr
= NULL_TREE
;
7910 saved_class_ref
= current_class_ref
;
7911 cp_function_chain
->x_current_class_ref
= NULL_TREE
;
7914 push_deferring_access_checks(dk_no_deferred
);
7915 /* The default argument expression may cause implicitly defined
7916 member functions to be synthesized, which will result in garbage
7917 collection. We must treat this situation as if we were within
7918 the body of function so as to avoid collecting live data on the
7921 arg
= tsubst_expr (arg
, DECL_TI_ARGS (fn
),
7922 tf_warning_or_error
, NULL_TREE
,
7923 /*integral_constant_expression_p=*/false);
7925 pop_deferring_access_checks();
7927 /* Restore the "this" pointer. */
7930 cp_function_chain
->x_current_class_ptr
= saved_class_ptr
;
7931 cp_function_chain
->x_current_class_ref
= saved_class_ref
;
7934 pop_access_scope (fn
);
7936 /* Make sure the default argument is reasonable. */
7937 arg
= check_default_argument (type
, arg
);
7942 /* Substitute into all the default arguments for FN. */
7945 tsubst_default_arguments (tree fn
)
7950 tmpl_args
= DECL_TI_ARGS (fn
);
7952 /* If this function is not yet instantiated, we certainly don't need
7953 its default arguments. */
7954 if (uses_template_parms (tmpl_args
))
7957 for (arg
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
7959 arg
= TREE_CHAIN (arg
))
7960 if (TREE_PURPOSE (arg
))
7961 TREE_PURPOSE (arg
) = tsubst_default_argument (fn
,
7963 TREE_PURPOSE (arg
));
7966 /* Substitute the ARGS into the T, which is a _DECL. Return the
7967 result of the substitution. Issue error and warning messages under
7968 control of COMPLAIN. */
7971 tsubst_decl (tree t
, tree args
, tsubst_flags_t complain
)
7973 location_t saved_loc
;
7977 /* Set the filename and linenumber to improve error-reporting. */
7978 saved_loc
= input_location
;
7979 input_location
= DECL_SOURCE_LOCATION (t
);
7981 switch (TREE_CODE (t
))
7985 /* We can get here when processing a member function template,
7986 member class template, and template template parameter of
7987 a template class. */
7988 tree decl
= DECL_TEMPLATE_RESULT (t
);
7993 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
7995 /* Template template parameter is treated here. */
7996 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
7997 if (new_type
== error_mark_node
)
7998 return error_mark_node
;
8001 TREE_CHAIN (r
) = NULL_TREE
;
8002 TREE_TYPE (r
) = new_type
;
8003 DECL_TEMPLATE_RESULT (r
)
8004 = build_decl (TYPE_DECL
, DECL_NAME (decl
), new_type
);
8005 DECL_TEMPLATE_PARMS (r
)
8006 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
,
8008 TYPE_NAME (new_type
) = r
;
8012 /* We might already have an instance of this template.
8013 The ARGS are for the surrounding class type, so the
8014 full args contain the tsubst'd args for the context,
8015 plus the innermost args from the template decl. */
8016 tmpl_args
= DECL_CLASS_TEMPLATE_P (t
)
8017 ? CLASSTYPE_TI_ARGS (TREE_TYPE (t
))
8018 : DECL_TI_ARGS (DECL_TEMPLATE_RESULT (t
));
8019 /* Because this is a template, the arguments will still be
8020 dependent, even after substitution. If
8021 PROCESSING_TEMPLATE_DECL is not set, the dependency
8022 predicates will short-circuit. */
8023 ++processing_template_decl
;
8024 full_args
= tsubst_template_args (tmpl_args
, args
,
8026 --processing_template_decl
;
8027 if (full_args
== error_mark_node
)
8028 return error_mark_node
;
8030 /* tsubst_template_args doesn't copy the vector if
8031 nothing changed. But, *something* should have
8033 gcc_assert (full_args
!= tmpl_args
);
8035 spec
= retrieve_specialization (t
, full_args
,
8036 /*class_specializations_p=*/true);
8037 if (spec
!= NULL_TREE
)
8043 /* Make a new template decl. It will be similar to the
8044 original, but will record the current template arguments.
8045 We also create a new function declaration, which is just
8046 like the old one, but points to this new template, rather
8047 than the old one. */
8049 gcc_assert (DECL_LANG_SPECIFIC (r
) != 0);
8050 TREE_CHAIN (r
) = NULL_TREE
;
8052 DECL_TEMPLATE_INFO (r
) = build_tree_list (t
, args
);
8054 if (TREE_CODE (decl
) == TYPE_DECL
)
8057 ++processing_template_decl
;
8058 new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
8059 --processing_template_decl
;
8060 if (new_type
== error_mark_node
)
8061 return error_mark_node
;
8063 TREE_TYPE (r
) = new_type
;
8064 CLASSTYPE_TI_TEMPLATE (new_type
) = r
;
8065 DECL_TEMPLATE_RESULT (r
) = TYPE_MAIN_DECL (new_type
);
8066 DECL_TI_ARGS (r
) = CLASSTYPE_TI_ARGS (new_type
);
8067 DECL_CONTEXT (r
) = TYPE_CONTEXT (new_type
);
8072 ++processing_template_decl
;
8073 new_decl
= tsubst (decl
, args
, complain
, in_decl
);
8074 --processing_template_decl
;
8075 if (new_decl
== error_mark_node
)
8076 return error_mark_node
;
8078 DECL_TEMPLATE_RESULT (r
) = new_decl
;
8079 DECL_TI_TEMPLATE (new_decl
) = r
;
8080 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
8081 DECL_TI_ARGS (r
) = DECL_TI_ARGS (new_decl
);
8082 DECL_CONTEXT (r
) = DECL_CONTEXT (new_decl
);
8085 SET_DECL_IMPLICIT_INSTANTIATION (r
);
8086 DECL_TEMPLATE_INSTANTIATIONS (r
) = NULL_TREE
;
8087 DECL_TEMPLATE_SPECIALIZATIONS (r
) = NULL_TREE
;
8089 /* The template parameters for this new template are all the
8090 template parameters for the old template, except the
8091 outermost level of parameters. */
8092 DECL_TEMPLATE_PARMS (r
)
8093 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
,
8096 if (PRIMARY_TEMPLATE_P (t
))
8097 DECL_PRIMARY_TEMPLATE (r
) = r
;
8099 if (TREE_CODE (decl
) != TYPE_DECL
)
8100 /* Record this non-type partial instantiation. */
8101 register_specialization (r
, t
,
8102 DECL_TI_ARGS (DECL_TEMPLATE_RESULT (r
)),
8110 tree argvec
= NULL_TREE
;
8118 /* Nobody should be tsubst'ing into non-template functions. */
8119 gcc_assert (DECL_TEMPLATE_INFO (t
) != NULL_TREE
);
8121 if (TREE_CODE (DECL_TI_TEMPLATE (t
)) == TEMPLATE_DECL
)
8126 /* If T is not dependent, just return it. We have to
8127 increment PROCESSING_TEMPLATE_DECL because
8128 value_dependent_expression_p assumes that nothing is
8129 dependent when PROCESSING_TEMPLATE_DECL is zero. */
8130 ++processing_template_decl
;
8131 dependent_p
= value_dependent_expression_p (t
);
8132 --processing_template_decl
;
8136 /* Calculate the most general template of which R is a
8137 specialization, and the complete set of arguments used to
8139 gen_tmpl
= most_general_template (DECL_TI_TEMPLATE (t
));
8140 argvec
= tsubst_template_args (DECL_TI_ARGS
8141 (DECL_TEMPLATE_RESULT (gen_tmpl
)),
8142 args
, complain
, in_decl
);
8144 /* Check to see if we already have this specialization. */
8145 spec
= retrieve_specialization (gen_tmpl
, argvec
,
8146 /*class_specializations_p=*/false);
8154 /* We can see more levels of arguments than parameters if
8155 there was a specialization of a member template, like
8158 template <class T> struct S { template <class U> void f(); }
8159 template <> template <class U> void S<int>::f(U);
8161 Here, we'll be substituting into the specialization,
8162 because that's where we can find the code we actually
8163 want to generate, but we'll have enough arguments for
8164 the most general template.
8166 We also deal with the peculiar case:
8168 template <class T> struct S {
8169 template <class U> friend void f();
8171 template <class U> void f() {}
8173 template void f<double>();
8175 Here, the ARGS for the instantiation of will be {int,
8176 double}. But, we only need as many ARGS as there are
8177 levels of template parameters in CODE_PATTERN. We are
8178 careful not to get fooled into reducing the ARGS in
8181 template <class T> struct S { template <class U> void f(U); }
8182 template <class T> template <> void S<T>::f(int) {}
8184 which we can spot because the pattern will be a
8185 specialization in this case. */
8186 args_depth
= TMPL_ARGS_DEPTH (args
);
8188 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (t
)));
8189 if (args_depth
> parms_depth
8190 && !DECL_TEMPLATE_SPECIALIZATION (t
))
8191 args
= get_innermost_template_args (args
, parms_depth
);
8195 /* This special case arises when we have something like this:
8197 template <class T> struct S {
8198 friend void f<int>(int, double);
8201 Here, the DECL_TI_TEMPLATE for the friend declaration
8202 will be an IDENTIFIER_NODE. We are being called from
8203 tsubst_friend_function, and we want only to create a
8204 new decl (R) with appropriate types so that we can call
8205 determine_specialization. */
8206 gen_tmpl
= NULL_TREE
;
8209 if (DECL_CLASS_SCOPE_P (t
))
8211 if (DECL_NAME (t
) == constructor_name (DECL_CONTEXT (t
)))
8215 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
,
8216 complain
, t
, /*entering_scope=*/1);
8221 ctx
= DECL_CONTEXT (t
);
8223 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
8224 if (type
== error_mark_node
)
8225 return error_mark_node
;
8227 /* We do NOT check for matching decls pushed separately at this
8228 point, as they may not represent instantiations of this
8229 template, and in any case are considered separate under the
8232 DECL_USE_TEMPLATE (r
) = 0;
8233 TREE_TYPE (r
) = type
;
8234 /* Clear out the mangled name and RTL for the instantiation. */
8235 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
8236 SET_DECL_RTL (r
, NULL_RTX
);
8237 /* Leave DECL_INITIAL set on deleted instantiations. */
8238 if (!DECL_DELETED_FN (r
))
8239 DECL_INITIAL (r
) = NULL_TREE
;
8240 DECL_CONTEXT (r
) = ctx
;
8242 if (member
&& DECL_CONV_FN_P (r
))
8243 /* Type-conversion operator. Reconstruct the name, in
8244 case it's the name of one of the template's parameters. */
8245 DECL_NAME (r
) = mangle_conv_op_name_for_type (TREE_TYPE (type
));
8247 DECL_ARGUMENTS (r
) = tsubst (DECL_ARGUMENTS (t
), args
,
8249 DECL_RESULT (r
) = NULL_TREE
;
8251 TREE_STATIC (r
) = 0;
8252 TREE_PUBLIC (r
) = TREE_PUBLIC (t
);
8253 DECL_EXTERNAL (r
) = 1;
8254 /* If this is an instantiation of a function with internal
8255 linkage, we already know what object file linkage will be
8256 assigned to the instantiation. */
8257 DECL_INTERFACE_KNOWN (r
) = !TREE_PUBLIC (r
);
8258 DECL_DEFER_OUTPUT (r
) = 0;
8259 TREE_CHAIN (r
) = NULL_TREE
;
8260 DECL_PENDING_INLINE_INFO (r
) = 0;
8261 DECL_PENDING_INLINE_P (r
) = 0;
8262 DECL_SAVED_TREE (r
) = NULL_TREE
;
8263 DECL_STRUCT_FUNCTION (r
) = NULL
;
8265 if (DECL_CLONED_FUNCTION (r
))
8267 DECL_CLONED_FUNCTION (r
) = tsubst (DECL_CLONED_FUNCTION (t
),
8269 TREE_CHAIN (r
) = TREE_CHAIN (DECL_CLONED_FUNCTION (r
));
8270 TREE_CHAIN (DECL_CLONED_FUNCTION (r
)) = r
;
8273 /* Set up the DECL_TEMPLATE_INFO for R. There's no need to do
8274 this in the special friend case mentioned above where
8275 GEN_TMPL is NULL. */
8278 DECL_TEMPLATE_INFO (r
)
8279 = tree_cons (gen_tmpl
, argvec
, NULL_TREE
);
8280 SET_DECL_IMPLICIT_INSTANTIATION (r
);
8281 register_specialization (r
, gen_tmpl
, argvec
, false);
8283 /* We're not supposed to instantiate default arguments
8284 until they are called, for a template. But, for a
8287 template <class T> void f ()
8288 { extern void g(int i = T()); }
8290 we should do the substitution when the template is
8291 instantiated. We handle the member function case in
8292 instantiate_class_template since the default arguments
8293 might refer to other members of the class. */
8295 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
8296 && !uses_template_parms (argvec
))
8297 tsubst_default_arguments (r
);
8300 DECL_TEMPLATE_INFO (r
) = NULL_TREE
;
8302 /* Copy the list of befriending classes. */
8303 for (friends
= &DECL_BEFRIENDING_CLASSES (r
);
8305 friends
= &TREE_CHAIN (*friends
))
8307 *friends
= copy_node (*friends
);
8308 TREE_VALUE (*friends
) = tsubst (TREE_VALUE (*friends
),
8313 if (DECL_CONSTRUCTOR_P (r
) || DECL_DESTRUCTOR_P (r
))
8315 maybe_retrofit_in_chrg (r
);
8316 if (DECL_CONSTRUCTOR_P (r
))
8317 grok_ctor_properties (ctx
, r
);
8318 /* If this is an instantiation of a member template, clone it.
8319 If it isn't, that'll be handled by
8320 clone_constructors_and_destructors. */
8321 if (PRIMARY_TEMPLATE_P (gen_tmpl
))
8322 clone_function_decl (r
, /*update_method_vec_p=*/0);
8324 else if (IDENTIFIER_OPNAME_P (DECL_NAME (r
))
8325 && !grok_op_properties (r
, (complain
& tf_error
) != 0))
8326 return error_mark_node
;
8328 if (DECL_FRIEND_P (t
) && DECL_FRIEND_CONTEXT (t
))
8329 SET_DECL_FRIEND_CONTEXT (r
,
8330 tsubst (DECL_FRIEND_CONTEXT (t
),
8331 args
, complain
, in_decl
));
8333 /* Possibly limit visibility based on template args. */
8334 DECL_VISIBILITY (r
) = VISIBILITY_DEFAULT
;
8335 if (DECL_VISIBILITY_SPECIFIED (t
))
8337 DECL_VISIBILITY_SPECIFIED (r
) = 0;
8339 = remove_attribute ("visibility", DECL_ATTRIBUTES (r
));
8341 determine_visibility (r
);
8343 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
8344 args
, complain
, in_decl
);
8350 tree type
= NULL_TREE
;
8352 tree expanded_types
= NULL_TREE
;
8353 tree prev_r
= NULL_TREE
;
8354 tree first_r
= NULL_TREE
;
8356 if (FUNCTION_PARAMETER_PACK_P (t
))
8358 /* If there is a local specialization that isn't a
8359 parameter pack, it means that we're doing a "simple"
8360 substitution from inside tsubst_pack_expansion. Just
8361 return the local specialization (which will be a single
8363 tree spec
= retrieve_local_specialization (t
);
8365 && TREE_CODE (spec
) == PARM_DECL
8366 && TREE_CODE (TREE_TYPE (spec
)) != TYPE_PACK_EXPANSION
)
8369 /* Expand the TYPE_PACK_EXPANSION that provides the types for
8370 the parameters in this function parameter pack. */
8371 expanded_types
= tsubst_pack_expansion (TREE_TYPE (t
), args
,
8373 if (TREE_CODE (expanded_types
) == TREE_VEC
)
8375 len
= TREE_VEC_LENGTH (expanded_types
);
8377 /* Zero-length parameter packs are boring. Just substitute
8380 return tsubst (TREE_CHAIN (t
), args
, complain
,
8385 /* All we did was update the type. Make a note of that. */
8386 type
= expanded_types
;
8387 expanded_types
= NULL_TREE
;
8391 /* Loop through all of the parameter's we'll build. When T is
8392 a function parameter pack, LEN is the number of expanded
8393 types in EXPANDED_TYPES; otherwise, LEN is 1. */
8395 for (i
= 0; i
< len
; ++i
)
8399 if (DECL_TEMPLATE_PARM_P (t
))
8400 SET_DECL_TEMPLATE_PARM_P (r
);
8403 /* We're on the Ith parameter of the function parameter
8406 /* Get the Ith type. */
8407 type
= TREE_VEC_ELT (expanded_types
, i
);
8410 /* Rename the parameter to include the index. */
8412 make_ith_pack_parameter_name (DECL_NAME (r
), i
);
8415 /* We're dealing with a normal parameter. */
8416 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
8418 type
= type_decays_to (type
);
8419 TREE_TYPE (r
) = type
;
8420 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
8422 if (DECL_INITIAL (r
))
8424 if (TREE_CODE (DECL_INITIAL (r
)) != TEMPLATE_PARM_INDEX
)
8425 DECL_INITIAL (r
) = TREE_TYPE (r
);
8427 DECL_INITIAL (r
) = tsubst (DECL_INITIAL (r
), args
,
8431 DECL_CONTEXT (r
) = NULL_TREE
;
8433 if (!DECL_TEMPLATE_PARM_P (r
))
8434 DECL_ARG_TYPE (r
) = type_passed_as (type
);
8436 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
8437 args
, complain
, in_decl
);
8439 /* Keep track of the first new parameter we
8440 generate. That's what will be returned to the
8445 /* Build a proper chain of parameters when substituting
8446 into a function parameter pack. */
8448 TREE_CHAIN (prev_r
) = r
;
8452 TREE_CHAIN (r
) = tsubst (TREE_CHAIN (t
), args
,
8453 complain
, TREE_CHAIN (t
));
8455 /* FIRST_R contains the start of the chain we've built. */
8465 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
8466 if (type
== error_mark_node
)
8467 return error_mark_node
;
8468 TREE_TYPE (r
) = type
;
8469 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
8471 /* DECL_INITIAL gives the number of bits in a bit-field. */
8473 = tsubst_expr (DECL_INITIAL (t
), args
,
8475 /*integral_constant_expression_p=*/true);
8476 /* We don't have to set DECL_CONTEXT here; it is set by
8477 finish_member_declaration. */
8478 TREE_CHAIN (r
) = NULL_TREE
;
8479 if (VOID_TYPE_P (type
))
8480 error ("instantiation of %q+D as type %qT", r
, type
);
8482 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
8483 args
, complain
, in_decl
);
8488 /* We reach here only for member using decls. */
8489 if (DECL_DEPENDENT_P (t
))
8491 r
= do_class_using_decl
8492 (tsubst_copy (USING_DECL_SCOPE (t
), args
, complain
, in_decl
),
8493 tsubst_copy (DECL_NAME (t
), args
, complain
, in_decl
));
8495 r
= error_mark_node
;
8498 TREE_PROTECTED (r
) = TREE_PROTECTED (t
);
8499 TREE_PRIVATE (r
) = TREE_PRIVATE (t
);
8505 TREE_CHAIN (r
) = NULL_TREE
;
8512 tree argvec
= NULL_TREE
;
8513 tree gen_tmpl
= NULL_TREE
;
8515 tree tmpl
= NULL_TREE
;
8517 tree type
= NULL_TREE
;
8520 if (TREE_CODE (t
) == TYPE_DECL
8521 && t
== TYPE_MAIN_DECL (TREE_TYPE (t
)))
8523 /* If this is the canonical decl, we don't have to
8524 mess with instantiations, and often we can't (for
8525 typename, template type parms and such). Note that
8526 TYPE_NAME is not correct for the above test if
8527 we've copied the type for a typedef. */
8528 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
8529 if (type
== error_mark_node
)
8530 return error_mark_node
;
8531 r
= TYPE_NAME (type
);
8535 /* Check to see if we already have the specialization we
8538 if (DECL_CLASS_SCOPE_P (t
) || DECL_NAMESPACE_SCOPE_P (t
))
8540 /* T is a static data member or namespace-scope entity.
8541 We have to substitute into namespace-scope variables
8542 (even though such entities are never templates) because
8545 template <class T> void f() { extern T t; }
8547 where the entity referenced is not known until
8548 instantiation time. */
8550 ctx
= DECL_CONTEXT (t
);
8551 if (DECL_CLASS_SCOPE_P (t
))
8553 ctx
= tsubst_aggr_type (ctx
, args
,
8555 in_decl
, /*entering_scope=*/1);
8556 /* If CTX is unchanged, then T is in fact the
8557 specialization we want. That situation occurs when
8558 referencing a static data member within in its own
8559 class. We can use pointer equality, rather than
8560 same_type_p, because DECL_CONTEXT is always
8562 if (ctx
== DECL_CONTEXT (t
))
8568 tmpl
= DECL_TI_TEMPLATE (t
);
8569 gen_tmpl
= most_general_template (tmpl
);
8570 argvec
= tsubst (DECL_TI_ARGS (t
), args
, complain
, in_decl
);
8571 spec
= (retrieve_specialization
8573 /*class_specializations_p=*/false));
8578 /* A local variable. */
8580 /* Subsequent calls to pushdecl will fill this in. */
8582 spec
= retrieve_local_specialization (t
);
8584 /* If we already have the specialization we need, there is
8585 nothing more to do. */
8592 /* Create a new node for the specialization we need. */
8594 if (type
== NULL_TREE
)
8595 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
8596 if (TREE_CODE (r
) == VAR_DECL
)
8598 /* Even if the original location is out of scope, the
8599 newly substituted one is not. */
8600 DECL_DEAD_FOR_LOCAL (r
) = 0;
8601 DECL_INITIALIZED_P (r
) = 0;
8602 DECL_TEMPLATE_INSTANTIATED (r
) = 0;
8603 if (type
== error_mark_node
)
8604 return error_mark_node
;
8605 if (TREE_CODE (type
) == FUNCTION_TYPE
)
8607 /* It may seem that this case cannot occur, since:
8612 declares a function, not a variable. However:
8615 template <typename T> void g() { T t; }
8616 template void g<f>();
8618 is an attempt to declare a variable with function
8620 error ("variable %qD has function type",
8621 /* R is not yet sufficiently initialized, so we
8622 just use its name. */
8624 return error_mark_node
;
8626 type
= complete_type (type
);
8627 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r
)
8628 = DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (t
);
8629 type
= check_var_type (DECL_NAME (r
), type
);
8631 if (DECL_HAS_VALUE_EXPR_P (t
))
8633 tree ve
= DECL_VALUE_EXPR (t
);
8634 ve
= tsubst_expr (ve
, args
, complain
, in_decl
,
8635 /*constant_expression_p=*/false);
8636 SET_DECL_VALUE_EXPR (r
, ve
);
8639 else if (DECL_SELF_REFERENCE_P (t
))
8640 SET_DECL_SELF_REFERENCE_P (r
);
8641 TREE_TYPE (r
) = type
;
8642 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
8643 DECL_CONTEXT (r
) = ctx
;
8644 /* Clear out the mangled name and RTL for the instantiation. */
8645 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
8646 if (CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_DECL_WRTL
))
8647 SET_DECL_RTL (r
, NULL_RTX
);
8648 /* The initializer must not be expanded until it is required;
8650 DECL_INITIAL (r
) = NULL_TREE
;
8651 if (CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_DECL_WRTL
))
8652 SET_DECL_RTL (r
, NULL_RTX
);
8653 DECL_SIZE (r
) = DECL_SIZE_UNIT (r
) = 0;
8654 if (TREE_CODE (r
) == VAR_DECL
)
8656 /* Possibly limit visibility based on template args. */
8657 DECL_VISIBILITY (r
) = VISIBILITY_DEFAULT
;
8658 if (DECL_VISIBILITY_SPECIFIED (t
))
8660 DECL_VISIBILITY_SPECIFIED (r
) = 0;
8662 = remove_attribute ("visibility", DECL_ATTRIBUTES (r
));
8664 determine_visibility (r
);
8666 /* Preserve a typedef that names a type. */
8667 else if (TREE_CODE (r
) == TYPE_DECL
8668 && DECL_ORIGINAL_TYPE (t
)
8669 && type
!= error_mark_node
)
8671 DECL_ORIGINAL_TYPE (r
) = tsubst (DECL_ORIGINAL_TYPE (t
),
8672 args
, complain
, in_decl
);
8673 TREE_TYPE (r
) = type
= build_variant_type_copy (type
);
8674 TYPE_NAME (type
) = r
;
8679 /* A static data member declaration is always marked
8680 external when it is declared in-class, even if an
8681 initializer is present. We mimic the non-template
8683 DECL_EXTERNAL (r
) = 1;
8685 register_specialization (r
, gen_tmpl
, argvec
, false);
8686 DECL_TEMPLATE_INFO (r
) = tree_cons (tmpl
, argvec
, NULL_TREE
);
8687 SET_DECL_IMPLICIT_INSTANTIATION (r
);
8690 register_local_specialization (r
, t
);
8692 TREE_CHAIN (r
) = NULL_TREE
;
8694 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
),
8695 (int) ATTR_FLAG_TYPE_IN_PLACE
,
8696 args
, complain
, in_decl
);
8705 /* Restore the file and line information. */
8706 input_location
= saved_loc
;
8711 /* Substitute into the ARG_TYPES of a function type. */
8714 tsubst_arg_types (tree arg_types
,
8716 tsubst_flags_t complain
,
8719 tree remaining_arg_types
;
8720 tree type
= NULL_TREE
;
8722 tree expanded_args
= NULL_TREE
;
8725 if (!arg_types
|| arg_types
== void_list_node
)
8728 remaining_arg_types
= tsubst_arg_types (TREE_CHAIN (arg_types
),
8729 args
, complain
, in_decl
);
8730 if (remaining_arg_types
== error_mark_node
)
8731 return error_mark_node
;
8733 if (PACK_EXPANSION_P (TREE_VALUE (arg_types
)))
8735 /* For a pack expansion, perform substitution on the
8736 entire expression. Later on, we'll handle the arguments
8738 expanded_args
= tsubst_pack_expansion (TREE_VALUE (arg_types
),
8739 args
, complain
, in_decl
);
8741 if (TREE_CODE (expanded_args
) == TREE_VEC
)
8742 /* So that we'll spin through the parameters, one by one. */
8743 i
= TREE_VEC_LENGTH (expanded_args
);
8746 /* We only partially substituted into the parameter
8747 pack. Our type is TYPE_PACK_EXPANSION. */
8748 type
= expanded_args
;
8749 expanded_args
= NULL_TREE
;
8757 type
= TREE_VEC_ELT (expanded_args
, i
);
8759 type
= tsubst (TREE_VALUE (arg_types
), args
, complain
, in_decl
);
8761 if (type
== error_mark_node
)
8762 return error_mark_node
;
8763 if (VOID_TYPE_P (type
))
8765 if (complain
& tf_error
)
8767 error ("invalid parameter type %qT", type
);
8769 error ("in declaration %q+D", in_decl
);
8771 return error_mark_node
;
8774 /* Do array-to-pointer, function-to-pointer conversion, and ignore
8775 top-level qualifiers as required. */
8776 type
= TYPE_MAIN_VARIANT (type_decays_to (type
));
8778 /* We do not substitute into default arguments here. The standard
8779 mandates that they be instantiated only when needed, which is
8780 done in build_over_call. */
8781 default_arg
= TREE_PURPOSE (arg_types
);
8783 if (default_arg
&& TREE_CODE (default_arg
) == DEFAULT_ARG
)
8785 /* We've instantiated a template before its default arguments
8786 have been parsed. This can happen for a nested template
8787 class, and is not an error unless we require the default
8788 argument in a call of this function. */
8789 remaining_arg_types
=
8790 tree_cons (default_arg
, type
, remaining_arg_types
);
8791 VEC_safe_push (tree
, gc
, DEFARG_INSTANTIATIONS (default_arg
),
8792 remaining_arg_types
);
8795 remaining_arg_types
=
8796 hash_tree_cons (default_arg
, type
, remaining_arg_types
);
8799 return remaining_arg_types
;
8802 /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does
8803 *not* handle the exception-specification for FNTYPE, because the
8804 initial substitution of explicitly provided template parameters
8805 during argument deduction forbids substitution into the
8806 exception-specification:
8810 All references in the function type of the function template to the
8811 corresponding template parameters are replaced by the specified tem-
8812 plate argument values. If a substitution in a template parameter or
8813 in the function type of the function template results in an invalid
8814 type, type deduction fails. [Note: The equivalent substitution in
8815 exception specifications is done only when the function is instanti-
8816 ated, at which point a program is ill-formed if the substitution
8817 results in an invalid type.] */
8820 tsubst_function_type (tree t
,
8822 tsubst_flags_t complain
,
8829 /* The TYPE_CONTEXT is not used for function/method types. */
8830 gcc_assert (TYPE_CONTEXT (t
) == NULL_TREE
);
8832 /* Substitute the return type. */
8833 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
8834 if (return_type
== error_mark_node
)
8835 return error_mark_node
;
8836 /* The standard does not presently indicate that creation of a
8837 function type with an invalid return type is a deduction failure.
8838 However, that is clearly analogous to creating an array of "void"
8839 or a reference to a reference. This is core issue #486. */
8840 if (TREE_CODE (return_type
) == ARRAY_TYPE
8841 || TREE_CODE (return_type
) == FUNCTION_TYPE
)
8843 if (complain
& tf_error
)
8845 if (TREE_CODE (return_type
) == ARRAY_TYPE
)
8846 error ("function returning an array");
8848 error ("function returning a function");
8850 return error_mark_node
;
8853 /* Substitute the argument types. */
8854 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
,
8856 if (arg_types
== error_mark_node
)
8857 return error_mark_node
;
8859 /* Construct a new type node and return it. */
8860 if (TREE_CODE (t
) == FUNCTION_TYPE
)
8861 fntype
= build_function_type (return_type
, arg_types
);
8864 tree r
= TREE_TYPE (TREE_VALUE (arg_types
));
8865 if (! MAYBE_CLASS_TYPE_P (r
))
8869 Type deduction may fail for any of the following
8872 -- Attempting to create "pointer to member of T" when T
8873 is not a class type. */
8874 if (complain
& tf_error
)
8875 error ("creating pointer to member function of non-class type %qT",
8877 return error_mark_node
;
8880 fntype
= build_method_type_directly (r
, return_type
,
8881 TREE_CHAIN (arg_types
));
8883 fntype
= cp_build_qualified_type_real (fntype
, TYPE_QUALS (t
), complain
);
8884 fntype
= cp_build_type_attribute_variant (fntype
, TYPE_ATTRIBUTES (t
));
8889 /* FNTYPE is a FUNCTION_TYPE or METHOD_TYPE. Substitute the template
8890 ARGS into that specification, and return the substituted
8891 specification. If there is no specification, return NULL_TREE. */
8894 tsubst_exception_specification (tree fntype
,
8896 tsubst_flags_t complain
,
8902 specs
= TYPE_RAISES_EXCEPTIONS (fntype
);
8903 new_specs
= NULL_TREE
;
8906 if (! TREE_VALUE (specs
))
8913 tree expanded_specs
= NULL_TREE
;
8915 if (PACK_EXPANSION_P (TREE_VALUE (specs
)))
8917 /* Expand the pack expansion type. */
8918 expanded_specs
= tsubst_pack_expansion (TREE_VALUE (specs
),
8922 if (expanded_specs
== error_mark_node
)
8923 return error_mark_node
;
8924 else if (TREE_CODE (expanded_specs
) == TREE_VEC
)
8925 len
= TREE_VEC_LENGTH (expanded_specs
);
8928 /* We're substituting into a member template, so
8929 we got a TYPE_PACK_EXPANSION back. Add that
8930 expansion and move on. */
8931 gcc_assert (TREE_CODE (expanded_specs
)
8932 == TYPE_PACK_EXPANSION
);
8933 new_specs
= add_exception_specifier (new_specs
,
8936 specs
= TREE_CHAIN (specs
);
8941 for (i
= 0; i
< len
; ++i
)
8944 spec
= TREE_VEC_ELT (expanded_specs
, i
);
8946 spec
= tsubst (TREE_VALUE (specs
), args
, complain
, in_decl
);
8947 if (spec
== error_mark_node
)
8949 new_specs
= add_exception_specifier (new_specs
, spec
,
8953 specs
= TREE_CHAIN (specs
);
8959 /* Take the tree structure T and replace template parameters used
8960 therein with the argument vector ARGS. IN_DECL is an associated
8961 decl for diagnostics. If an error occurs, returns ERROR_MARK_NODE.
8962 Issue error and warning messages under control of COMPLAIN. Note
8963 that we must be relatively non-tolerant of extensions here, in
8964 order to preserve conformance; if we allow substitutions that
8965 should not be allowed, we may allow argument deductions that should
8966 not succeed, and therefore report ambiguous overload situations
8967 where there are none. In theory, we could allow the substitution,
8968 but indicate that it should have failed, and allow our caller to
8969 make sure that the right thing happens, but we don't try to do this
8972 This function is used for dealing with types, decls and the like;
8973 for expressions, use tsubst_expr or tsubst_copy. */
8976 tsubst (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
8980 if (t
== NULL_TREE
|| t
== error_mark_node
8981 || t
== integer_type_node
8982 || t
== void_type_node
8983 || t
== char_type_node
8984 || t
== unknown_type_node
8985 || TREE_CODE (t
) == NAMESPACE_DECL
)
8989 return tsubst_decl (t
, args
, complain
);
8991 if (args
== NULL_TREE
)
8994 if (TREE_CODE (t
) == IDENTIFIER_NODE
)
8995 type
= IDENTIFIER_TYPE_VALUE (t
);
8997 type
= TREE_TYPE (t
);
8999 gcc_assert (type
!= unknown_type_node
);
9001 /* Reuse typedefs. We need to do this to handle dependent attributes,
9002 such as attribute aligned. */
9005 && TYPE_NAME (t
) != TYPE_MAIN_DECL (t
))
9007 tree decl
= TYPE_NAME (t
);
9009 if (DECL_CLASS_SCOPE_P (decl
)
9010 && CLASSTYPE_TEMPLATE_INFO (DECL_CONTEXT (decl
))
9011 && uses_template_parms (DECL_CONTEXT (decl
)))
9013 tree tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
9014 tree gen_args
= tsubst (DECL_TI_ARGS (decl
), args
, complain
, in_decl
);
9015 r
= retrieve_specialization (tmpl
, gen_args
, false);
9017 else if (DECL_FUNCTION_SCOPE_P (decl
)
9018 && DECL_TEMPLATE_INFO (DECL_CONTEXT (decl
))
9019 && uses_template_parms (DECL_TI_ARGS (DECL_CONTEXT (decl
))))
9020 r
= retrieve_local_specialization (decl
);
9022 /* The typedef is from a non-template context. */
9028 r
= cp_build_qualified_type_real
9029 (r
, cp_type_quals (t
) | cp_type_quals (r
),
9030 complain
| tf_ignore_bad_quals
);
9033 /* Else we must be instantiating the typedef, so fall through. */
9037 && TREE_CODE (t
) != TYPENAME_TYPE
9038 && TREE_CODE (t
) != IDENTIFIER_NODE
9039 && TREE_CODE (t
) != FUNCTION_TYPE
9040 && TREE_CODE (t
) != METHOD_TYPE
)
9041 type
= tsubst (type
, args
, complain
, in_decl
);
9042 if (type
== error_mark_node
)
9043 return error_mark_node
;
9045 switch (TREE_CODE (t
))
9050 return tsubst_aggr_type (t
, args
, complain
, in_decl
,
9051 /*entering_scope=*/0);
9054 case IDENTIFIER_NODE
:
9066 if (t
== integer_type_node
)
9069 if (TREE_CODE (TYPE_MIN_VALUE (t
)) == INTEGER_CST
9070 && TREE_CODE (TYPE_MAX_VALUE (t
)) == INTEGER_CST
)
9074 tree max
, omax
= TREE_OPERAND (TYPE_MAX_VALUE (t
), 0);
9076 max
= tsubst_expr (omax
, args
, complain
, in_decl
,
9077 /*integral_constant_expression_p=*/false);
9078 max
= fold_decl_constant_value (max
);
9080 if (TREE_CODE (max
) != INTEGER_CST
9081 && !at_function_scope_p ()
9082 && !value_dependent_expression_p (max
))
9084 if (complain
& tf_error
)
9085 error ("array bound is not an integer constant");
9086 return error_mark_node
;
9091 Type deduction may fail for any of the following
9094 Attempting to create an array with a size that is
9095 zero or negative. */
9096 if (integer_zerop (max
) && !(complain
& tf_error
))
9097 /* We must fail if performing argument deduction (as
9098 indicated by the state of complain), so that
9099 another substitution can be found. */
9100 return error_mark_node
;
9101 else if (TREE_CODE (max
) == INTEGER_CST
9102 && INT_CST_LT (max
, integer_zero_node
))
9104 if (complain
& tf_error
)
9105 error ("creating array with negative size (%qE)", max
);
9107 return error_mark_node
;
9110 return compute_array_index_type (NULL_TREE
, max
);
9113 case TEMPLATE_TYPE_PARM
:
9114 case TEMPLATE_TEMPLATE_PARM
:
9115 case BOUND_TEMPLATE_TEMPLATE_PARM
:
9116 case TEMPLATE_PARM_INDEX
:
9121 tree arg
= NULL_TREE
;
9125 gcc_assert (TREE_VEC_LENGTH (args
) > 0);
9126 template_parm_level_and_index (t
, &level
, &idx
);
9128 levels
= TMPL_ARGS_DEPTH (args
);
9129 if (level
<= levels
)
9131 arg
= TMPL_ARG (args
, level
, idx
);
9133 if (arg
&& TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
9134 /* See through ARGUMENT_PACK_SELECT arguments. */
9135 arg
= ARGUMENT_PACK_SELECT_ARG (arg
);
9138 if (arg
== error_mark_node
)
9139 return error_mark_node
;
9140 else if (arg
!= NULL_TREE
)
9142 if (ARGUMENT_PACK_P (arg
))
9143 /* If ARG is an argument pack, we don't actually want to
9144 perform a substitution here, because substitutions
9145 for argument packs are only done
9146 element-by-element. We can get to this point when
9147 substituting the type of a non-type template
9148 parameter pack, when that type actually contains
9149 template parameter packs from an outer template, e.g.,
9151 template<typename... Types> struct A {
9152 template<Types... Values> struct B { };
9156 if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
9159 gcc_assert (TYPE_P (arg
));
9161 /* cv-quals from the template are discarded when
9162 substituting in a function or reference type. */
9163 if (TREE_CODE (arg
) == FUNCTION_TYPE
9164 || TREE_CODE (arg
) == METHOD_TYPE
9165 || TREE_CODE (arg
) == REFERENCE_TYPE
)
9166 quals
= cp_type_quals (arg
);
9168 quals
= cp_type_quals (arg
) | cp_type_quals (t
);
9170 return cp_build_qualified_type_real
9171 (arg
, quals
, complain
| tf_ignore_bad_quals
);
9173 else if (TREE_CODE (t
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
9175 /* We are processing a type constructed from a
9176 template template parameter. */
9177 tree argvec
= tsubst (TYPE_TI_ARGS (t
),
9178 args
, complain
, in_decl
);
9179 if (argvec
== error_mark_node
)
9180 return error_mark_node
;
9182 /* We can get a TEMPLATE_TEMPLATE_PARM here when we
9183 are resolving nested-types in the signature of a
9184 member function templates. Otherwise ARG is a
9185 TEMPLATE_DECL and is the real template to be
9187 if (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
9188 arg
= TYPE_NAME (arg
);
9190 r
= lookup_template_class (arg
,
9193 /*entering_scope=*/0,
9195 return cp_build_qualified_type_real
9196 (r
, TYPE_QUALS (t
), complain
);
9199 /* TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX. */
9204 /* This can happen during the attempted tsubst'ing in
9205 unify. This means that we don't yet have any information
9206 about the template parameter in question. */
9209 /* If we get here, we must have been looking at a parm for a
9210 more deeply nested template. Make a new version of this
9211 template parameter, but with a lower level. */
9212 switch (TREE_CODE (t
))
9214 case TEMPLATE_TYPE_PARM
:
9215 case TEMPLATE_TEMPLATE_PARM
:
9216 case BOUND_TEMPLATE_TEMPLATE_PARM
:
9217 if (cp_type_quals (t
))
9219 r
= tsubst (TYPE_MAIN_VARIANT (t
), args
, complain
, in_decl
);
9220 r
= cp_build_qualified_type_real
9221 (r
, cp_type_quals (t
),
9222 complain
| (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
9223 ? tf_ignore_bad_quals
: 0));
9228 TEMPLATE_TYPE_PARM_INDEX (r
)
9229 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (t
),
9230 r
, levels
, args
, complain
);
9231 TYPE_STUB_DECL (r
) = TYPE_NAME (r
) = TEMPLATE_TYPE_DECL (r
);
9232 TYPE_MAIN_VARIANT (r
) = r
;
9233 TYPE_POINTER_TO (r
) = NULL_TREE
;
9234 TYPE_REFERENCE_TO (r
) = NULL_TREE
;
9236 if (TREE_CODE (r
) == TEMPLATE_TEMPLATE_PARM
)
9237 /* We have reduced the level of the template
9238 template parameter, but not the levels of its
9239 template parameters, so canonical_type_parameter
9240 will not be able to find the canonical template
9241 template parameter for this level. Thus, we
9242 require structural equality checking to compare
9243 TEMPLATE_TEMPLATE_PARMs. */
9244 SET_TYPE_STRUCTURAL_EQUALITY (r
);
9245 else if (TYPE_STRUCTURAL_EQUALITY_P (t
))
9246 SET_TYPE_STRUCTURAL_EQUALITY (r
);
9248 TYPE_CANONICAL (r
) = canonical_type_parameter (r
);
9250 if (TREE_CODE (t
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
9252 tree argvec
= tsubst (TYPE_TI_ARGS (t
), args
,
9254 if (argvec
== error_mark_node
)
9255 return error_mark_node
;
9257 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (r
)
9258 = tree_cons (TYPE_TI_TEMPLATE (t
), argvec
, NULL_TREE
);
9263 case TEMPLATE_PARM_INDEX
:
9264 r
= reduce_template_parm_level (t
, type
, levels
, args
, complain
);
9276 tree purpose
, value
, chain
;
9278 if (t
== void_list_node
)
9281 purpose
= TREE_PURPOSE (t
);
9284 purpose
= tsubst (purpose
, args
, complain
, in_decl
);
9285 if (purpose
== error_mark_node
)
9286 return error_mark_node
;
9288 value
= TREE_VALUE (t
);
9291 value
= tsubst (value
, args
, complain
, in_decl
);
9292 if (value
== error_mark_node
)
9293 return error_mark_node
;
9295 chain
= TREE_CHAIN (t
);
9296 if (chain
&& chain
!= void_type_node
)
9298 chain
= tsubst (chain
, args
, complain
, in_decl
);
9299 if (chain
== error_mark_node
)
9300 return error_mark_node
;
9302 if (purpose
== TREE_PURPOSE (t
)
9303 && value
== TREE_VALUE (t
)
9304 && chain
== TREE_CHAIN (t
))
9306 return hash_tree_cons (purpose
, value
, chain
);
9310 /* We should never be tsubsting a binfo. */
9314 /* A vector of template arguments. */
9316 return tsubst_template_args (t
, args
, complain
, in_decl
);
9319 case REFERENCE_TYPE
:
9321 enum tree_code code
;
9323 if (type
== TREE_TYPE (t
) && TREE_CODE (type
) != METHOD_TYPE
)
9326 code
= TREE_CODE (t
);
9331 Type deduction may fail for any of the following
9334 -- Attempting to create a pointer to reference type.
9335 -- Attempting to create a reference to a reference type or
9336 a reference to void.
9338 Core issue 106 says that creating a reference to a reference
9339 during instantiation is no longer a cause for failure. We
9340 only enforce this check in strict C++98 mode. */
9341 if ((TREE_CODE (type
) == REFERENCE_TYPE
9342 && (((cxx_dialect
== cxx98
) && flag_iso
) || code
!= REFERENCE_TYPE
))
9343 || (code
== REFERENCE_TYPE
&& TREE_CODE (type
) == VOID_TYPE
))
9345 static location_t last_loc
;
9347 /* We keep track of the last time we issued this error
9348 message to avoid spewing a ton of messages during a
9349 single bad template instantiation. */
9350 if (complain
& tf_error
9351 && last_loc
!= input_location
)
9353 if (TREE_CODE (type
) == VOID_TYPE
)
9354 error ("forming reference to void");
9356 error ("forming %s to reference type %qT",
9357 (code
== POINTER_TYPE
) ? "pointer" : "reference",
9359 last_loc
= input_location
;
9362 return error_mark_node
;
9364 else if (code
== POINTER_TYPE
)
9366 r
= build_pointer_type (type
);
9367 if (TREE_CODE (type
) == METHOD_TYPE
)
9368 r
= build_ptrmemfunc_type (r
);
9370 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
9371 /* In C++0x, during template argument substitution, when there is an
9372 attempt to create a reference to a reference type, reference
9373 collapsing is applied as described in [14.3.1/4 temp.arg.type]:
9375 "If a template-argument for a template-parameter T names a type
9376 that is a reference to a type A, an attempt to create the type
9377 'lvalue reference to cv T' creates the type 'lvalue reference to
9378 A,' while an attempt to create the type type rvalue reference to
9379 cv T' creates the type T"
9381 r
= cp_build_reference_type
9383 TYPE_REF_IS_RVALUE (t
) && TYPE_REF_IS_RVALUE (type
));
9385 r
= cp_build_reference_type (type
, TYPE_REF_IS_RVALUE (t
));
9386 r
= cp_build_qualified_type_real (r
, TYPE_QUALS (t
), complain
);
9388 if (r
!= error_mark_node
)
9389 /* Will this ever be needed for TYPE_..._TO values? */
9396 r
= tsubst (TYPE_OFFSET_BASETYPE (t
), args
, complain
, in_decl
);
9397 if (r
== error_mark_node
|| !MAYBE_CLASS_TYPE_P (r
))
9401 Type deduction may fail for any of the following
9404 -- Attempting to create "pointer to member of T" when T
9405 is not a class type. */
9406 if (complain
& tf_error
)
9407 error ("creating pointer to member of non-class type %qT", r
);
9408 return error_mark_node
;
9410 if (TREE_CODE (type
) == REFERENCE_TYPE
)
9412 if (complain
& tf_error
)
9413 error ("creating pointer to member reference type %qT", type
);
9414 return error_mark_node
;
9416 if (TREE_CODE (type
) == VOID_TYPE
)
9418 if (complain
& tf_error
)
9419 error ("creating pointer to member of type void");
9420 return error_mark_node
;
9422 gcc_assert (TREE_CODE (type
) != METHOD_TYPE
);
9423 if (TREE_CODE (type
) == FUNCTION_TYPE
)
9425 /* The type of the implicit object parameter gets its
9426 cv-qualifiers from the FUNCTION_TYPE. */
9428 tree this_type
= cp_build_qualified_type (TYPE_MAIN_VARIANT (r
),
9429 cp_type_quals (type
));
9431 method_type
= build_method_type_directly (this_type
,
9433 TYPE_ARG_TYPES (type
));
9434 memptr
= build_ptrmemfunc_type (build_pointer_type (method_type
));
9435 return cp_build_qualified_type_real (memptr
, cp_type_quals (t
),
9439 return cp_build_qualified_type_real (build_ptrmem_type (r
, type
),
9448 fntype
= tsubst_function_type (t
, args
, complain
, in_decl
);
9449 if (fntype
== error_mark_node
)
9450 return error_mark_node
;
9452 /* Substitute the exception specification. */
9453 specs
= tsubst_exception_specification (t
, args
, complain
,
9455 if (specs
== error_mark_node
)
9456 return error_mark_node
;
9458 fntype
= build_exception_variant (fntype
, specs
);
9463 tree domain
= tsubst (TYPE_DOMAIN (t
), args
, complain
, in_decl
);
9464 if (domain
== error_mark_node
)
9465 return error_mark_node
;
9467 /* As an optimization, we avoid regenerating the array type if
9468 it will obviously be the same as T. */
9469 if (type
== TREE_TYPE (t
) && domain
== TYPE_DOMAIN (t
))
9472 /* These checks should match the ones in grokdeclarator.
9476 The deduction may fail for any of the following reasons:
9478 -- Attempting to create an array with an element type that
9479 is void, a function type, or a reference type, or [DR337]
9480 an abstract class type. */
9481 if (TREE_CODE (type
) == VOID_TYPE
9482 || TREE_CODE (type
) == FUNCTION_TYPE
9483 || TREE_CODE (type
) == REFERENCE_TYPE
)
9485 if (complain
& tf_error
)
9486 error ("creating array of %qT", type
);
9487 return error_mark_node
;
9489 if (CLASS_TYPE_P (type
) && CLASSTYPE_PURE_VIRTUALS (type
))
9491 if (complain
& tf_error
)
9492 error ("creating array of %qT, which is an abstract class type",
9494 return error_mark_node
;
9497 r
= build_cplus_array_type (type
, domain
);
9499 if (TYPE_USER_ALIGN (t
))
9501 TYPE_ALIGN (r
) = TYPE_ALIGN (t
);
9502 TYPE_USER_ALIGN (r
) = 1;
9511 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
9512 tree e2
= tsubst (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
9514 if (e1
== error_mark_node
|| e2
== error_mark_node
)
9515 return error_mark_node
;
9517 return fold_build2 (TREE_CODE (t
), TREE_TYPE (t
), e1
, e2
);
9523 tree e
= tsubst (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
9524 if (e
== error_mark_node
)
9525 return error_mark_node
;
9527 return fold_build1 (TREE_CODE (t
), TREE_TYPE (t
), e
);
9532 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
9533 in_decl
, /*entering_scope=*/1);
9534 tree f
= tsubst_copy (TYPENAME_TYPE_FULLNAME (t
), args
,
9537 if (ctx
== error_mark_node
|| f
== error_mark_node
)
9538 return error_mark_node
;
9540 if (!MAYBE_CLASS_TYPE_P (ctx
))
9542 if (complain
& tf_error
)
9543 error ("%qT is not a class, struct, or union type", ctx
);
9544 return error_mark_node
;
9546 else if (!uses_template_parms (ctx
) && !TYPE_BEING_DEFINED (ctx
))
9548 /* Normally, make_typename_type does not require that the CTX
9549 have complete type in order to allow things like:
9551 template <class T> struct S { typename S<T>::X Y; };
9553 But, such constructs have already been resolved by this
9554 point, so here CTX really should have complete type, unless
9555 it's a partial instantiation. */
9556 ctx
= complete_type (ctx
);
9557 if (!COMPLETE_TYPE_P (ctx
))
9559 if (complain
& tf_error
)
9560 cxx_incomplete_type_error (NULL_TREE
, ctx
);
9561 return error_mark_node
;
9565 f
= make_typename_type (ctx
, f
, typename_type
,
9566 (complain
& tf_error
) | tf_keep_type_decl
);
9567 if (f
== error_mark_node
)
9569 if (TREE_CODE (f
) == TYPE_DECL
)
9571 complain
|= tf_ignore_bad_quals
;
9575 if (TREE_CODE (f
) != TYPENAME_TYPE
)
9577 if (TYPENAME_IS_ENUM_P (t
) && TREE_CODE (f
) != ENUMERAL_TYPE
)
9578 error ("%qT resolves to %qT, which is not an enumeration type",
9580 else if (TYPENAME_IS_CLASS_P (t
) && !CLASS_TYPE_P (f
))
9581 error ("%qT resolves to %qT, which is is not a class type",
9585 return cp_build_qualified_type_real
9586 (f
, cp_type_quals (f
) | cp_type_quals (t
), complain
);
9589 case UNBOUND_CLASS_TEMPLATE
:
9591 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
9592 in_decl
, /*entering_scope=*/1);
9593 tree name
= TYPE_IDENTIFIER (t
);
9594 tree parm_list
= DECL_TEMPLATE_PARMS (TYPE_NAME (t
));
9596 if (ctx
== error_mark_node
|| name
== error_mark_node
)
9597 return error_mark_node
;
9600 parm_list
= tsubst_template_parms (parm_list
, args
, complain
);
9601 return make_unbound_class_template (ctx
, name
, parm_list
, complain
);
9611 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
9612 tree e2
= tsubst_expr (TREE_OPERAND (t
, 1), args
, complain
, in_decl
,
9613 /*integral_constant_expression_p=*/false);
9614 if (e1
== error_mark_node
|| e2
== error_mark_node
)
9615 return error_mark_node
;
9617 return build_nt (ARRAY_REF
, e1
, e2
, NULL_TREE
, NULL_TREE
);
9622 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
9623 tree e2
= tsubst (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
9624 if (e1
== error_mark_node
|| e2
== error_mark_node
)
9625 return error_mark_node
;
9627 return build_qualified_name (/*type=*/NULL_TREE
,
9628 e1
, e2
, QUALIFIED_NAME_IS_TEMPLATE (t
));
9635 type
= finish_typeof (tsubst_expr
9636 (TYPEOF_TYPE_EXPR (t
), args
,
9638 /*integral_constant_expression_p=*/false));
9639 return cp_build_qualified_type_real (type
,
9641 | cp_type_quals (type
),
9651 type
= tsubst_expr (DECLTYPE_TYPE_EXPR (t
), args
,
9653 /*integral_constant_expression_p=*/false);
9658 finish_decltype_type (type
,
9659 DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t
));
9660 return cp_build_qualified_type_real (type
,
9662 | cp_type_quals (type
),
9666 case TYPE_ARGUMENT_PACK
:
9667 case NONTYPE_ARGUMENT_PACK
:
9669 tree r
= make_node (TREE_CODE (t
));
9671 tsubst_template_args (ARGUMENT_PACK_ARGS (t
),
9675 SET_ARGUMENT_PACK_ARGS (r
, packed_out
);
9677 /* For template nontype argument packs, also substitute into
9679 if (TREE_CODE (t
) == NONTYPE_ARGUMENT_PACK
)
9680 TREE_TYPE (r
) = tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
9687 sorry ("use of %qs in template",
9688 tree_code_name
[(int) TREE_CODE (t
)]);
9689 return error_mark_node
;
9693 /* Like tsubst_expr for a BASELINK. OBJECT_TYPE, if non-NULL, is the
9694 type of the expression on the left-hand side of the "." or "->"
9698 tsubst_baselink (tree baselink
, tree object_type
,
9699 tree args
, tsubst_flags_t complain
, tree in_decl
)
9702 tree qualifying_scope
;
9705 tree template_args
= 0;
9706 bool template_id_p
= false;
9708 /* A baselink indicates a function from a base class. Both the
9709 BASELINK_ACCESS_BINFO and the base class referenced may
9710 indicate bases of the template class, rather than the
9711 instantiated class. In addition, lookups that were not
9712 ambiguous before may be ambiguous now. Therefore, we perform
9713 the lookup again. */
9714 qualifying_scope
= BINFO_TYPE (BASELINK_ACCESS_BINFO (baselink
));
9715 qualifying_scope
= tsubst (qualifying_scope
, args
,
9717 fns
= BASELINK_FUNCTIONS (baselink
);
9718 optype
= BASELINK_OPTYPE (baselink
);
9719 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
9721 template_id_p
= true;
9722 template_args
= TREE_OPERAND (fns
, 1);
9723 fns
= TREE_OPERAND (fns
, 0);
9725 template_args
= tsubst_template_args (template_args
, args
,
9728 name
= DECL_NAME (get_first_fn (fns
));
9729 baselink
= lookup_fnfields (qualifying_scope
, name
, /*protect=*/1);
9731 /* If lookup found a single function, mark it as used at this
9732 point. (If it lookup found multiple functions the one selected
9733 later by overload resolution will be marked as used at that
9735 if (BASELINK_P (baselink
))
9736 fns
= BASELINK_FUNCTIONS (baselink
);
9737 if (!template_id_p
&& !really_overloaded_fn (fns
))
9738 mark_used (OVL_CURRENT (fns
));
9740 /* Add back the template arguments, if present. */
9741 if (BASELINK_P (baselink
) && template_id_p
)
9742 BASELINK_FUNCTIONS (baselink
)
9743 = build_nt (TEMPLATE_ID_EXPR
,
9744 BASELINK_FUNCTIONS (baselink
),
9746 /* Update the conversion operator type. */
9747 BASELINK_OPTYPE (baselink
)
9748 = tsubst (optype
, args
, complain
, in_decl
);
9751 object_type
= current_class_type
;
9752 return adjust_result_of_qualified_name_lookup (baselink
,
9757 /* Like tsubst_expr for a SCOPE_REF, given by QUALIFIED_ID. DONE is
9758 true if the qualified-id will be a postfix-expression in-and-of
9759 itself; false if more of the postfix-expression follows the
9760 QUALIFIED_ID. ADDRESS_P is true if the qualified-id is the operand
9764 tsubst_qualified_id (tree qualified_id
, tree args
,
9765 tsubst_flags_t complain
, tree in_decl
,
9766 bool done
, bool address_p
)
9774 gcc_assert (TREE_CODE (qualified_id
) == SCOPE_REF
);
9776 /* Figure out what name to look up. */
9777 name
= TREE_OPERAND (qualified_id
, 1);
9778 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
9781 template_args
= TREE_OPERAND (name
, 1);
9783 template_args
= tsubst_template_args (template_args
, args
,
9785 name
= TREE_OPERAND (name
, 0);
9789 is_template
= false;
9790 template_args
= NULL_TREE
;
9793 /* Substitute into the qualifying scope. When there are no ARGS, we
9794 are just trying to simplify a non-dependent expression. In that
9795 case the qualifying scope may be dependent, and, in any case,
9796 substituting will not help. */
9797 scope
= TREE_OPERAND (qualified_id
, 0);
9800 scope
= tsubst (scope
, args
, complain
, in_decl
);
9801 expr
= tsubst_copy (name
, args
, complain
, in_decl
);
9806 if (dependent_type_p (scope
))
9807 return build_qualified_name (/*type=*/NULL_TREE
,
9809 QUALIFIED_NAME_IS_TEMPLATE (qualified_id
));
9811 if (!BASELINK_P (name
) && !DECL_P (expr
))
9813 if (TREE_CODE (expr
) == BIT_NOT_EXPR
)
9814 /* If this were actually a destructor call, it would have been
9815 parsed as such by the parser. */
9816 expr
= error_mark_node
;
9818 expr
= lookup_qualified_name (scope
, expr
, /*is_type_p=*/0, false);
9819 if (TREE_CODE (TREE_CODE (expr
) == TEMPLATE_DECL
9820 ? DECL_TEMPLATE_RESULT (expr
) : expr
) == TYPE_DECL
)
9822 if (complain
& tf_error
)
9824 error ("dependent-name %qE is parsed as a non-type, but "
9825 "instantiation yields a type", qualified_id
);
9826 inform (input_location
, "say %<typename %E%> if a type is meant", qualified_id
);
9828 return error_mark_node
;
9834 check_accessibility_of_qualified_id (expr
, /*object_type=*/NULL_TREE
,
9836 /* Remember that there was a reference to this entity. */
9840 if (expr
== error_mark_node
|| TREE_CODE (expr
) == TREE_LIST
)
9842 if (complain
& tf_error
)
9843 qualified_name_lookup_error (scope
,
9844 TREE_OPERAND (qualified_id
, 1),
9845 expr
, input_location
);
9846 return error_mark_node
;
9850 expr
= lookup_template_function (expr
, template_args
);
9852 if (expr
== error_mark_node
&& complain
& tf_error
)
9853 qualified_name_lookup_error (scope
, TREE_OPERAND (qualified_id
, 1),
9854 expr
, input_location
);
9855 else if (TYPE_P (scope
))
9857 expr
= (adjust_result_of_qualified_name_lookup
9858 (expr
, scope
, current_class_type
));
9859 expr
= (finish_qualified_id_expr
9860 (scope
, expr
, done
, address_p
,
9861 QUALIFIED_NAME_IS_TEMPLATE (qualified_id
),
9862 /*template_arg_p=*/false));
9865 /* Expressions do not generally have reference type. */
9866 if (TREE_CODE (expr
) != SCOPE_REF
9867 /* However, if we're about to form a pointer-to-member, we just
9868 want the referenced member referenced. */
9869 && TREE_CODE (expr
) != OFFSET_REF
)
9870 expr
= convert_from_reference (expr
);
9875 /* Like tsubst, but deals with expressions. This function just replaces
9876 template parms; to finish processing the resultant expression, use
9880 tsubst_copy (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
9882 enum tree_code code
;
9885 if (t
== NULL_TREE
|| t
== error_mark_node
)
9888 code
= TREE_CODE (t
);
9893 r
= retrieve_local_specialization (t
);
9897 /* This can happen for a parameter name used later in a function
9898 declaration (such as in a late-specified return type).
9899 Replace it with an arbitrary expression with the same type
9900 (*(T*)0). This should only occur in an unevaluated context
9902 gcc_assert (skip_evaluation
);
9903 r
= non_reference (TREE_TYPE (t
));
9904 r
= tsubst (r
, args
, complain
, in_decl
);
9905 r
= build_pointer_type (r
);
9906 r
= build_c_cast (r
, null_node
);
9907 return cp_build_indirect_ref (r
, NULL
, tf_warning_or_error
);
9910 if (TREE_CODE (r
) == ARGUMENT_PACK_SELECT
)
9911 r
= ARGUMENT_PACK_SELECT_ARG (r
);
9920 if (DECL_TEMPLATE_PARM_P (t
))
9921 return tsubst_copy (DECL_INITIAL (t
), args
, complain
, in_decl
);
9922 /* There is no need to substitute into namespace-scope
9924 if (DECL_NAMESPACE_SCOPE_P (t
))
9926 /* If ARGS is NULL, then T is known to be non-dependent. */
9927 if (args
== NULL_TREE
)
9928 return integral_constant_value (t
);
9930 /* Unfortunately, we cannot just call lookup_name here.
9933 template <int I> int f() {
9935 struct S { void g() { E e = a; } };
9938 When we instantiate f<7>::S::g(), say, lookup_name is not
9939 clever enough to find f<7>::a. */
9941 = tsubst_aggr_type (TREE_TYPE (t
), args
, complain
, in_decl
,
9942 /*entering_scope=*/0);
9944 for (v
= TYPE_VALUES (enum_type
);
9947 if (TREE_PURPOSE (v
) == DECL_NAME (t
))
9948 return TREE_VALUE (v
);
9950 /* We didn't find the name. That should never happen; if
9951 name-lookup found it during preliminary parsing, we
9952 should find it again here during instantiation. */
9958 if (DECL_CONTEXT (t
))
9962 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
9963 /*entering_scope=*/1);
9964 if (ctx
!= DECL_CONTEXT (t
))
9966 tree r
= lookup_field (ctx
, DECL_NAME (t
), 0, false);
9969 if (complain
& tf_error
)
9970 error ("using invalid field %qD", t
);
9971 return error_mark_node
;
9981 if ((DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
))
9982 || local_variable_p (t
))
9983 t
= tsubst (t
, args
, complain
, in_decl
);
9988 return tsubst_baselink (t
, current_class_type
, args
, complain
, in_decl
);
9991 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
9992 return tsubst (TREE_TYPE (DECL_TEMPLATE_RESULT (t
)),
9993 args
, complain
, in_decl
);
9994 else if (DECL_FUNCTION_TEMPLATE_P (t
) && DECL_MEMBER_TEMPLATE_P (t
))
9995 return tsubst (t
, args
, complain
, in_decl
);
9996 else if (DECL_CLASS_SCOPE_P (t
)
9997 && uses_template_parms (DECL_CONTEXT (t
)))
9999 /* Template template argument like the following example need
10002 template <template <class> class TT> struct C {};
10003 template <class T> struct D {
10004 template <class U> struct E {};
10009 We are processing the template argument `E' in #1 for
10010 the template instantiation #2. Originally, `E' is a
10011 TEMPLATE_DECL with `D<T>' as its DECL_CONTEXT. Now we
10012 have to substitute this with one having context `D<int>'. */
10014 tree context
= tsubst (DECL_CONTEXT (t
), args
, complain
, in_decl
);
10015 return lookup_field (context
, DECL_NAME(t
), 0, false);
10018 /* Ordinary template template argument. */
10022 case REINTERPRET_CAST_EXPR
:
10023 case CONST_CAST_EXPR
:
10024 case STATIC_CAST_EXPR
:
10025 case DYNAMIC_CAST_EXPR
:
10028 (code
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
10029 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
));
10032 if (PACK_EXPANSION_P (TREE_OPERAND (t
, 0)))
10034 /* We only want to compute the number of arguments. */
10035 tree expanded
= tsubst_pack_expansion (TREE_OPERAND (t
, 0), args
,
10036 complain
, in_decl
);
10039 if (TREE_CODE (expanded
) == TREE_VEC
)
10040 len
= TREE_VEC_LENGTH (expanded
);
10042 if (expanded
== error_mark_node
)
10043 return error_mark_node
;
10044 else if (PACK_EXPANSION_P (expanded
)
10045 || (TREE_CODE (expanded
) == TREE_VEC
10047 && PACK_EXPANSION_P (TREE_VEC_ELT (expanded
, len
-1))))
10049 if (TREE_CODE (expanded
) == TREE_VEC
)
10050 expanded
= TREE_VEC_ELT (expanded
, len
- 1);
10052 if (TYPE_P (expanded
))
10053 return cxx_sizeof_or_alignof_type (expanded
, SIZEOF_EXPR
,
10054 complain
& tf_error
);
10056 return cxx_sizeof_or_alignof_expr (expanded
, SIZEOF_EXPR
,
10057 complain
& tf_error
);
10060 return build_int_cst (size_type_node
, len
);
10066 case TRUTH_NOT_EXPR
:
10069 case UNARY_PLUS_EXPR
: /* Unary + */
10074 case REALPART_EXPR
:
10075 case IMAGPART_EXPR
:
10077 (code
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
10078 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
));
10080 case COMPONENT_REF
:
10085 object
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
10086 name
= TREE_OPERAND (t
, 1);
10087 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
10089 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
10090 complain
, in_decl
);
10091 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
10093 else if (TREE_CODE (name
) == SCOPE_REF
10094 && TREE_CODE (TREE_OPERAND (name
, 1)) == BIT_NOT_EXPR
)
10096 tree base
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
10097 complain
, in_decl
);
10098 name
= TREE_OPERAND (name
, 1);
10099 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
10100 complain
, in_decl
);
10101 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
10102 name
= build_qualified_name (/*type=*/NULL_TREE
,
10104 /*template_p=*/false);
10106 else if (TREE_CODE (name
) == BASELINK
)
10107 name
= tsubst_baselink (name
,
10108 non_reference (TREE_TYPE (object
)),
10112 name
= tsubst_copy (name
, args
, complain
, in_decl
);
10113 return build_nt (COMPONENT_REF
, object
, name
, NULL_TREE
);
10119 case TRUNC_DIV_EXPR
:
10120 case CEIL_DIV_EXPR
:
10121 case FLOOR_DIV_EXPR
:
10122 case ROUND_DIV_EXPR
:
10123 case EXACT_DIV_EXPR
:
10127 case TRUNC_MOD_EXPR
:
10128 case FLOOR_MOD_EXPR
:
10129 case TRUTH_ANDIF_EXPR
:
10130 case TRUTH_ORIF_EXPR
:
10131 case TRUTH_AND_EXPR
:
10132 case TRUTH_OR_EXPR
:
10145 case COMPOUND_EXPR
:
10148 case PREDECREMENT_EXPR
:
10149 case PREINCREMENT_EXPR
:
10150 case POSTDECREMENT_EXPR
:
10151 case POSTINCREMENT_EXPR
:
10153 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
10154 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
));
10157 return build_qualified_name (/*type=*/NULL_TREE
,
10158 tsubst_copy (TREE_OPERAND (t
, 0),
10159 args
, complain
, in_decl
),
10160 tsubst_copy (TREE_OPERAND (t
, 1),
10161 args
, complain
, in_decl
),
10162 QUALIFIED_NAME_IS_TEMPLATE (t
));
10167 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
10168 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
),
10169 NULL_TREE
, NULL_TREE
);
10173 int n
= VL_EXP_OPERAND_LENGTH (t
);
10174 tree result
= build_vl_exp (CALL_EXPR
, n
);
10176 for (i
= 0; i
< n
; i
++)
10177 TREE_OPERAND (t
, i
) = tsubst_copy (TREE_OPERAND (t
, i
), args
,
10178 complain
, in_decl
);
10184 case PSEUDO_DTOR_EXPR
:
10187 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
10188 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
),
10189 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
));
10190 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
10197 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
10198 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
),
10199 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
));
10200 NEW_EXPR_USE_GLOBAL (r
) = NEW_EXPR_USE_GLOBAL (t
);
10207 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
10208 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
));
10209 DELETE_EXPR_USE_GLOBAL (r
) = DELETE_EXPR_USE_GLOBAL (t
);
10210 DELETE_EXPR_USE_VEC (r
) = DELETE_EXPR_USE_VEC (t
);
10214 case TEMPLATE_ID_EXPR
:
10216 /* Substituted template arguments */
10217 tree fn
= TREE_OPERAND (t
, 0);
10218 tree targs
= TREE_OPERAND (t
, 1);
10220 fn
= tsubst_copy (fn
, args
, complain
, in_decl
);
10222 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
10224 return lookup_template_function (fn
, targs
);
10229 tree purpose
, value
, chain
;
10231 if (t
== void_list_node
)
10234 purpose
= TREE_PURPOSE (t
);
10236 purpose
= tsubst_copy (purpose
, args
, complain
, in_decl
);
10237 value
= TREE_VALUE (t
);
10239 value
= tsubst_copy (value
, args
, complain
, in_decl
);
10240 chain
= TREE_CHAIN (t
);
10241 if (chain
&& chain
!= void_type_node
)
10242 chain
= tsubst_copy (chain
, args
, complain
, in_decl
);
10243 if (purpose
== TREE_PURPOSE (t
)
10244 && value
== TREE_VALUE (t
)
10245 && chain
== TREE_CHAIN (t
))
10247 return tree_cons (purpose
, value
, chain
);
10252 case ENUMERAL_TYPE
:
10254 case TEMPLATE_TYPE_PARM
:
10255 case TEMPLATE_TEMPLATE_PARM
:
10256 case BOUND_TEMPLATE_TEMPLATE_PARM
:
10257 case TEMPLATE_PARM_INDEX
:
10259 case REFERENCE_TYPE
:
10261 case FUNCTION_TYPE
:
10264 case TYPENAME_TYPE
:
10265 case UNBOUND_CLASS_TEMPLATE
:
10267 case DECLTYPE_TYPE
:
10269 return tsubst (t
, args
, complain
, in_decl
);
10271 case IDENTIFIER_NODE
:
10272 if (IDENTIFIER_TYPENAME_P (t
))
10274 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
10275 return mangle_conv_op_name_for_type (new_type
);
10281 /* This is handled by tsubst_copy_and_build. */
10282 gcc_unreachable ();
10285 return build_x_va_arg (tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
,
10287 tsubst (TREE_TYPE (t
), args
, complain
, in_decl
));
10289 case CLEANUP_POINT_EXPR
:
10290 /* We shouldn't have built any of these during initial template
10291 generation. Instead, they should be built during instantiation
10292 in response to the saved STMT_IS_FULL_EXPR_P setting. */
10293 gcc_unreachable ();
10296 mark_used (TREE_OPERAND (t
, 1));
10299 case EXPR_PACK_EXPANSION
:
10300 error ("invalid use of pack expansion expression");
10301 return error_mark_node
;
10303 case NONTYPE_ARGUMENT_PACK
:
10304 error ("use %<...%> to expand argument pack");
10305 return error_mark_node
;
10312 /* Like tsubst_copy, but specifically for OpenMP clauses. */
10315 tsubst_omp_clauses (tree clauses
, tree args
, tsubst_flags_t complain
,
10318 tree new_clauses
= NULL
, nc
, oc
;
10320 for (oc
= clauses
; oc
; oc
= OMP_CLAUSE_CHAIN (oc
))
10322 nc
= copy_node (oc
);
10323 OMP_CLAUSE_CHAIN (nc
) = new_clauses
;
10326 switch (OMP_CLAUSE_CODE (nc
))
10328 case OMP_CLAUSE_LASTPRIVATE
:
10329 if (OMP_CLAUSE_LASTPRIVATE_STMT (oc
))
10331 OMP_CLAUSE_LASTPRIVATE_STMT (nc
) = push_stmt_list ();
10332 tsubst_expr (OMP_CLAUSE_LASTPRIVATE_STMT (oc
), args
, complain
,
10333 in_decl
, /*integral_constant_expression_p=*/false);
10334 OMP_CLAUSE_LASTPRIVATE_STMT (nc
)
10335 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (nc
));
10338 case OMP_CLAUSE_PRIVATE
:
10339 case OMP_CLAUSE_SHARED
:
10340 case OMP_CLAUSE_FIRSTPRIVATE
:
10341 case OMP_CLAUSE_REDUCTION
:
10342 case OMP_CLAUSE_COPYIN
:
10343 case OMP_CLAUSE_COPYPRIVATE
:
10344 case OMP_CLAUSE_IF
:
10345 case OMP_CLAUSE_NUM_THREADS
:
10346 case OMP_CLAUSE_SCHEDULE
:
10347 case OMP_CLAUSE_COLLAPSE
:
10348 OMP_CLAUSE_OPERAND (nc
, 0)
10349 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 0), args
, complain
,
10350 in_decl
, /*integral_constant_expression_p=*/false);
10352 case OMP_CLAUSE_NOWAIT
:
10353 case OMP_CLAUSE_ORDERED
:
10354 case OMP_CLAUSE_DEFAULT
:
10355 case OMP_CLAUSE_UNTIED
:
10358 gcc_unreachable ();
10362 return finish_omp_clauses (nreverse (new_clauses
));
10365 /* Like tsubst_copy_and_build, but unshare TREE_LIST nodes. */
10368 tsubst_copy_asm_operands (tree t
, tree args
, tsubst_flags_t complain
,
10371 #define RECUR(t) tsubst_copy_asm_operands (t, args, complain, in_decl)
10373 tree purpose
, value
, chain
;
10378 if (TREE_CODE (t
) != TREE_LIST
)
10379 return tsubst_copy_and_build (t
, args
, complain
, in_decl
,
10380 /*function_p=*/false,
10381 /*integral_constant_expression_p=*/false);
10383 if (t
== void_list_node
)
10386 purpose
= TREE_PURPOSE (t
);
10388 purpose
= RECUR (purpose
);
10389 value
= TREE_VALUE (t
);
10391 value
= RECUR (value
);
10392 chain
= TREE_CHAIN (t
);
10393 if (chain
&& chain
!= void_type_node
)
10394 chain
= RECUR (chain
);
10395 return tree_cons (purpose
, value
, chain
);
10399 /* Substitute one OMP_FOR iterator. */
10402 tsubst_omp_for_iterator (tree t
, int i
, tree declv
, tree initv
,
10403 tree condv
, tree incrv
, tree
*clauses
,
10404 tree args
, tsubst_flags_t complain
, tree in_decl
,
10405 bool integral_constant_expression_p
)
10407 #define RECUR(NODE) \
10408 tsubst_expr ((NODE), args, complain, in_decl, \
10409 integral_constant_expression_p)
10410 tree decl
, init
, cond
, incr
, auto_node
;
10412 init
= TREE_VEC_ELT (OMP_FOR_INIT (t
), i
);
10413 gcc_assert (TREE_CODE (init
) == MODIFY_EXPR
);
10414 decl
= RECUR (TREE_OPERAND (init
, 0));
10415 init
= TREE_OPERAND (init
, 1);
10416 auto_node
= type_uses_auto (TREE_TYPE (decl
));
10417 if (auto_node
&& init
)
10419 tree init_expr
= init
;
10420 if (TREE_CODE (init_expr
) == DECL_EXPR
)
10421 init_expr
= DECL_INITIAL (DECL_EXPR_DECL (init_expr
));
10422 init_expr
= RECUR (init_expr
);
10424 = do_auto_deduction (TREE_TYPE (decl
), init_expr
, auto_node
);
10426 gcc_assert (!type_dependent_expression_p (decl
));
10428 if (!CLASS_TYPE_P (TREE_TYPE (decl
)))
10430 cond
= RECUR (TREE_VEC_ELT (OMP_FOR_COND (t
), i
));
10431 incr
= TREE_VEC_ELT (OMP_FOR_INCR (t
), i
);
10432 if (TREE_CODE (incr
) == MODIFY_EXPR
)
10433 incr
= build_x_modify_expr (RECUR (TREE_OPERAND (incr
, 0)), NOP_EXPR
,
10434 RECUR (TREE_OPERAND (incr
, 1)),
10437 incr
= RECUR (incr
);
10438 TREE_VEC_ELT (declv
, i
) = decl
;
10439 TREE_VEC_ELT (initv
, i
) = init
;
10440 TREE_VEC_ELT (condv
, i
) = cond
;
10441 TREE_VEC_ELT (incrv
, i
) = incr
;
10445 if (init
&& TREE_CODE (init
) != DECL_EXPR
)
10448 for (c
= *clauses
; c
; c
= OMP_CLAUSE_CHAIN (c
))
10450 if ((OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_PRIVATE
10451 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_LASTPRIVATE
)
10452 && OMP_CLAUSE_DECL (c
) == decl
)
10454 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_FIRSTPRIVATE
10455 && OMP_CLAUSE_DECL (c
) == decl
)
10456 error ("iteration variable %qD should not be firstprivate", decl
);
10457 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
10458 && OMP_CLAUSE_DECL (c
) == decl
)
10459 error ("iteration variable %qD should not be reduction", decl
);
10463 c
= build_omp_clause (OMP_CLAUSE_PRIVATE
);
10464 OMP_CLAUSE_DECL (c
) = decl
;
10465 c
= finish_omp_clauses (c
);
10468 OMP_CLAUSE_CHAIN (c
) = *clauses
;
10473 cond
= TREE_VEC_ELT (OMP_FOR_COND (t
), i
);
10474 if (COMPARISON_CLASS_P (cond
))
10475 cond
= build2 (TREE_CODE (cond
), boolean_type_node
,
10476 RECUR (TREE_OPERAND (cond
, 0)),
10477 RECUR (TREE_OPERAND (cond
, 1)));
10479 cond
= RECUR (cond
);
10480 incr
= TREE_VEC_ELT (OMP_FOR_INCR (t
), i
);
10481 switch (TREE_CODE (incr
))
10483 case PREINCREMENT_EXPR
:
10484 case PREDECREMENT_EXPR
:
10485 case POSTINCREMENT_EXPR
:
10486 case POSTDECREMENT_EXPR
:
10487 incr
= build2 (TREE_CODE (incr
), TREE_TYPE (decl
),
10488 RECUR (TREE_OPERAND (incr
, 0)), NULL_TREE
);
10491 if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
10492 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
10494 tree rhs
= TREE_OPERAND (incr
, 1);
10495 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
),
10496 RECUR (TREE_OPERAND (incr
, 0)),
10497 build2 (TREE_CODE (rhs
), TREE_TYPE (decl
),
10498 RECUR (TREE_OPERAND (rhs
, 0)),
10499 RECUR (TREE_OPERAND (rhs
, 1))));
10502 incr
= RECUR (incr
);
10505 if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
10506 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
10508 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
10509 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
10510 build2 (TREE_CODE (TREE_OPERAND (incr
, 1)),
10511 TREE_TYPE (decl
), lhs
,
10512 RECUR (TREE_OPERAND (incr
, 2))));
10514 else if (TREE_CODE (TREE_OPERAND (incr
, 1)) == NOP_EXPR
10515 && (TREE_CODE (TREE_OPERAND (incr
, 2)) == PLUS_EXPR
10516 || (TREE_CODE (TREE_OPERAND (incr
, 2)) == MINUS_EXPR
)))
10518 tree rhs
= TREE_OPERAND (incr
, 2);
10519 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
),
10520 RECUR (TREE_OPERAND (incr
, 0)),
10521 build2 (TREE_CODE (rhs
), TREE_TYPE (decl
),
10522 RECUR (TREE_OPERAND (rhs
, 0)),
10523 RECUR (TREE_OPERAND (rhs
, 1))));
10526 incr
= RECUR (incr
);
10529 incr
= RECUR (incr
);
10533 TREE_VEC_ELT (declv
, i
) = decl
;
10534 TREE_VEC_ELT (initv
, i
) = init
;
10535 TREE_VEC_ELT (condv
, i
) = cond
;
10536 TREE_VEC_ELT (incrv
, i
) = incr
;
10540 /* Like tsubst_copy for expressions, etc. but also does semantic
10544 tsubst_expr (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
,
10545 bool integral_constant_expression_p
)
10547 #define RECUR(NODE) \
10548 tsubst_expr ((NODE), args, complain, in_decl, \
10549 integral_constant_expression_p)
10553 if (t
== NULL_TREE
|| t
== error_mark_node
)
10556 if (EXPR_HAS_LOCATION (t
))
10557 input_location
= EXPR_LOCATION (t
);
10558 if (STATEMENT_CODE_P (TREE_CODE (t
)))
10559 current_stmt_tree ()->stmts_are_full_exprs_p
= STMT_IS_FULL_EXPR_P (t
);
10561 switch (TREE_CODE (t
))
10563 case STATEMENT_LIST
:
10565 tree_stmt_iterator i
;
10566 for (i
= tsi_start (t
); !tsi_end_p (i
); tsi_next (&i
))
10567 RECUR (tsi_stmt (i
));
10571 case CTOR_INITIALIZER
:
10572 finish_mem_initializers (tsubst_initializer_list
10573 (TREE_OPERAND (t
, 0), args
));
10577 finish_return_stmt (RECUR (TREE_OPERAND (t
, 0)));
10581 tmp
= RECUR (EXPR_STMT_EXPR (t
));
10582 if (EXPR_STMT_STMT_EXPR_RESULT (t
))
10583 finish_stmt_expr_expr (tmp
, cur_stmt_expr
);
10585 finish_expr_stmt (tmp
);
10589 do_using_directive (RECUR (USING_STMT_NAMESPACE (t
)));
10597 decl
= DECL_EXPR_DECL (t
);
10598 if (TREE_CODE (decl
) == LABEL_DECL
)
10599 finish_label_decl (DECL_NAME (decl
));
10600 else if (TREE_CODE (decl
) == USING_DECL
)
10602 tree scope
= USING_DECL_SCOPE (decl
);
10603 tree name
= DECL_NAME (decl
);
10606 scope
= RECUR (scope
);
10607 decl
= lookup_qualified_name (scope
, name
,
10608 /*is_type_p=*/false,
10609 /*complain=*/false);
10610 if (decl
== error_mark_node
|| TREE_CODE (decl
) == TREE_LIST
)
10611 qualified_name_lookup_error (scope
, name
, decl
, input_location
);
10613 do_local_using_decl (decl
, scope
, name
);
10617 init
= DECL_INITIAL (decl
);
10618 decl
= tsubst (decl
, args
, complain
, in_decl
);
10619 if (decl
!= error_mark_node
)
10621 /* By marking the declaration as instantiated, we avoid
10622 trying to instantiate it. Since instantiate_decl can't
10623 handle local variables, and since we've already done
10624 all that needs to be done, that's the right thing to
10626 if (TREE_CODE (decl
) == VAR_DECL
)
10627 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
10628 if (TREE_CODE (decl
) == VAR_DECL
10629 && ANON_AGGR_TYPE_P (TREE_TYPE (decl
)))
10630 /* Anonymous aggregates are a special case. */
10631 finish_anon_union (decl
);
10634 maybe_push_decl (decl
);
10635 if (TREE_CODE (decl
) == VAR_DECL
10636 && DECL_PRETTY_FUNCTION_P (decl
))
10638 /* For __PRETTY_FUNCTION__ we have to adjust the
10640 const char *const name
10641 = cxx_printable_name (current_function_decl
, 2);
10642 init
= cp_fname_init (name
, &TREE_TYPE (decl
));
10646 tree t
= RECUR (init
);
10649 /* If we had an initializer but it
10650 instantiated to nothing,
10651 value-initialize the object. This will
10652 only occur when the initializer was a
10653 pack expansion where the parameter packs
10654 used in that expansion were of length
10656 init
= build_value_init (TREE_TYPE (decl
));
10661 finish_decl (decl
, init
, NULL_TREE
);
10666 /* A DECL_EXPR can also be used as an expression, in the condition
10667 clause of an if/for/while construct. */
10672 stmt
= begin_for_stmt ();
10673 RECUR (FOR_INIT_STMT (t
));
10674 finish_for_init_stmt (stmt
);
10675 tmp
= RECUR (FOR_COND (t
));
10676 finish_for_cond (tmp
, stmt
);
10677 tmp
= RECUR (FOR_EXPR (t
));
10678 finish_for_expr (tmp
, stmt
);
10679 RECUR (FOR_BODY (t
));
10680 finish_for_stmt (stmt
);
10684 stmt
= begin_while_stmt ();
10685 tmp
= RECUR (WHILE_COND (t
));
10686 finish_while_stmt_cond (tmp
, stmt
);
10687 RECUR (WHILE_BODY (t
));
10688 finish_while_stmt (stmt
);
10692 stmt
= begin_do_stmt ();
10693 RECUR (DO_BODY (t
));
10694 finish_do_body (stmt
);
10695 tmp
= RECUR (DO_COND (t
));
10696 finish_do_stmt (tmp
, stmt
);
10700 stmt
= begin_if_stmt ();
10701 tmp
= RECUR (IF_COND (t
));
10702 finish_if_stmt_cond (tmp
, stmt
);
10703 RECUR (THEN_CLAUSE (t
));
10704 finish_then_clause (stmt
);
10706 if (ELSE_CLAUSE (t
))
10708 begin_else_clause (stmt
);
10709 RECUR (ELSE_CLAUSE (t
));
10710 finish_else_clause (stmt
);
10713 finish_if_stmt (stmt
);
10717 if (BIND_EXPR_BODY_BLOCK (t
))
10718 stmt
= begin_function_body ();
10720 stmt
= begin_compound_stmt (BIND_EXPR_TRY_BLOCK (t
)
10721 ? BCS_TRY_BLOCK
: 0);
10723 RECUR (BIND_EXPR_BODY (t
));
10725 if (BIND_EXPR_BODY_BLOCK (t
))
10726 finish_function_body (stmt
);
10728 finish_compound_stmt (stmt
);
10732 finish_break_stmt ();
10735 case CONTINUE_STMT
:
10736 finish_continue_stmt ();
10740 stmt
= begin_switch_stmt ();
10741 tmp
= RECUR (SWITCH_STMT_COND (t
));
10742 finish_switch_cond (tmp
, stmt
);
10743 RECUR (SWITCH_STMT_BODY (t
));
10744 finish_switch_stmt (stmt
);
10747 case CASE_LABEL_EXPR
:
10748 finish_case_label (RECUR (CASE_LOW (t
)),
10749 RECUR (CASE_HIGH (t
)));
10753 finish_label_stmt (DECL_NAME (LABEL_EXPR_LABEL (t
)));
10757 tmp
= GOTO_DESTINATION (t
);
10758 if (TREE_CODE (tmp
) != LABEL_DECL
)
10759 /* Computed goto's must be tsubst'd into. On the other hand,
10760 non-computed gotos must not be; the identifier in question
10761 will have no binding. */
10764 tmp
= DECL_NAME (tmp
);
10765 finish_goto_stmt (tmp
);
10769 tmp
= finish_asm_stmt
10770 (ASM_VOLATILE_P (t
),
10771 RECUR (ASM_STRING (t
)),
10772 tsubst_copy_asm_operands (ASM_OUTPUTS (t
), args
, complain
, in_decl
),
10773 tsubst_copy_asm_operands (ASM_INPUTS (t
), args
, complain
, in_decl
),
10774 tsubst_copy_asm_operands (ASM_CLOBBERS (t
), args
, complain
, in_decl
));
10776 tree asm_expr
= tmp
;
10777 if (TREE_CODE (asm_expr
) == CLEANUP_POINT_EXPR
)
10778 asm_expr
= TREE_OPERAND (asm_expr
, 0);
10779 ASM_INPUT_P (asm_expr
) = ASM_INPUT_P (t
);
10786 stmt
= begin_try_block ();
10787 RECUR (TRY_STMTS (t
));
10788 finish_cleanup_try_block (stmt
);
10789 finish_cleanup (RECUR (TRY_HANDLERS (t
)), stmt
);
10793 tree compound_stmt
= NULL_TREE
;
10795 if (FN_TRY_BLOCK_P (t
))
10796 stmt
= begin_function_try_block (&compound_stmt
);
10798 stmt
= begin_try_block ();
10800 RECUR (TRY_STMTS (t
));
10802 if (FN_TRY_BLOCK_P (t
))
10803 finish_function_try_block (stmt
);
10805 finish_try_block (stmt
);
10807 RECUR (TRY_HANDLERS (t
));
10808 if (FN_TRY_BLOCK_P (t
))
10809 finish_function_handler_sequence (stmt
, compound_stmt
);
10811 finish_handler_sequence (stmt
);
10817 tree decl
= HANDLER_PARMS (t
);
10821 decl
= tsubst (decl
, args
, complain
, in_decl
);
10822 /* Prevent instantiate_decl from trying to instantiate
10823 this variable. We've already done all that needs to be
10825 if (decl
!= error_mark_node
)
10826 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
10828 stmt
= begin_handler ();
10829 finish_handler_parms (decl
, stmt
);
10830 RECUR (HANDLER_BODY (t
));
10831 finish_handler (stmt
);
10836 tsubst (TREE_TYPE (t
), args
, complain
, NULL_TREE
);
10839 case STATIC_ASSERT
:
10842 tsubst_expr (STATIC_ASSERT_CONDITION (t
),
10845 /*integral_constant_expression_p=*/true);
10846 finish_static_assert (condition
,
10847 STATIC_ASSERT_MESSAGE (t
),
10848 STATIC_ASSERT_SOURCE_LOCATION (t
),
10849 /*member_p=*/false);
10854 tmp
= tsubst_omp_clauses (OMP_PARALLEL_CLAUSES (t
),
10855 args
, complain
, in_decl
);
10856 stmt
= begin_omp_parallel ();
10857 RECUR (OMP_PARALLEL_BODY (t
));
10858 OMP_PARALLEL_COMBINED (finish_omp_parallel (tmp
, stmt
))
10859 = OMP_PARALLEL_COMBINED (t
);
10863 tmp
= tsubst_omp_clauses (OMP_TASK_CLAUSES (t
),
10864 args
, complain
, in_decl
);
10865 stmt
= begin_omp_task ();
10866 RECUR (OMP_TASK_BODY (t
));
10867 finish_omp_task (tmp
, stmt
);
10872 tree clauses
, body
, pre_body
;
10873 tree declv
, initv
, condv
, incrv
;
10876 clauses
= tsubst_omp_clauses (OMP_FOR_CLAUSES (t
),
10877 args
, complain
, in_decl
);
10878 declv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
10879 initv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
10880 condv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
10881 incrv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
10883 for (i
= 0; i
< TREE_VEC_LENGTH (OMP_FOR_INIT (t
)); i
++)
10884 tsubst_omp_for_iterator (t
, i
, declv
, initv
, condv
, incrv
,
10885 &clauses
, args
, complain
, in_decl
,
10886 integral_constant_expression_p
);
10888 stmt
= begin_omp_structured_block ();
10890 for (i
= 0; i
< TREE_VEC_LENGTH (initv
); i
++)
10891 if (TREE_VEC_ELT (initv
, i
) == NULL
10892 || TREE_CODE (TREE_VEC_ELT (initv
, i
)) != DECL_EXPR
)
10893 TREE_VEC_ELT (initv
, i
) = RECUR (TREE_VEC_ELT (initv
, i
));
10894 else if (CLASS_TYPE_P (TREE_TYPE (TREE_VEC_ELT (initv
, i
))))
10896 tree init
= RECUR (TREE_VEC_ELT (initv
, i
));
10897 gcc_assert (init
== TREE_VEC_ELT (declv
, i
));
10898 TREE_VEC_ELT (initv
, i
) = NULL_TREE
;
10902 tree decl_expr
= TREE_VEC_ELT (initv
, i
);
10903 tree init
= DECL_INITIAL (DECL_EXPR_DECL (decl_expr
));
10904 gcc_assert (init
!= NULL
);
10905 TREE_VEC_ELT (initv
, i
) = RECUR (init
);
10906 DECL_INITIAL (DECL_EXPR_DECL (decl_expr
)) = NULL
;
10908 DECL_INITIAL (DECL_EXPR_DECL (decl_expr
)) = init
;
10911 pre_body
= push_stmt_list ();
10912 RECUR (OMP_FOR_PRE_BODY (t
));
10913 pre_body
= pop_stmt_list (pre_body
);
10915 body
= push_stmt_list ();
10916 RECUR (OMP_FOR_BODY (t
));
10917 body
= pop_stmt_list (body
);
10919 t
= finish_omp_for (EXPR_LOCATION (t
), declv
, initv
, condv
, incrv
,
10920 body
, pre_body
, clauses
);
10922 add_stmt (finish_omp_structured_block (stmt
));
10928 tmp
= tsubst_omp_clauses (OMP_CLAUSES (t
), args
, complain
, in_decl
);
10929 stmt
= push_stmt_list ();
10930 RECUR (OMP_BODY (t
));
10931 stmt
= pop_stmt_list (stmt
);
10934 OMP_BODY (t
) = stmt
;
10935 OMP_CLAUSES (t
) = tmp
;
10943 stmt
= push_stmt_list ();
10944 RECUR (OMP_BODY (t
));
10945 stmt
= pop_stmt_list (stmt
);
10948 OMP_BODY (t
) = stmt
;
10953 gcc_assert (OMP_ATOMIC_DEPENDENT_P (t
));
10955 tree op1
= TREE_OPERAND (t
, 1);
10956 tree lhs
= RECUR (TREE_OPERAND (op1
, 0));
10957 tree rhs
= RECUR (TREE_OPERAND (op1
, 1));
10958 finish_omp_atomic (TREE_CODE (op1
), lhs
, rhs
);
10962 case EXPR_PACK_EXPANSION
:
10963 error ("invalid use of pack expansion expression");
10964 return error_mark_node
;
10966 case NONTYPE_ARGUMENT_PACK
:
10967 error ("use %<...%> to expand argument pack");
10968 return error_mark_node
;
10971 gcc_assert (!STATEMENT_CODE_P (TREE_CODE (t
)));
10973 return tsubst_copy_and_build (t
, args
, complain
, in_decl
,
10974 /*function_p=*/false,
10975 integral_constant_expression_p
);
10982 /* T is a postfix-expression that is not being used in a function
10983 call. Return the substituted version of T. */
10986 tsubst_non_call_postfix_expression (tree t
, tree args
,
10987 tsubst_flags_t complain
,
10990 if (TREE_CODE (t
) == SCOPE_REF
)
10991 t
= tsubst_qualified_id (t
, args
, complain
, in_decl
,
10992 /*done=*/false, /*address_p=*/false);
10994 t
= tsubst_copy_and_build (t
, args
, complain
, in_decl
,
10995 /*function_p=*/false,
10996 /*integral_constant_expression_p=*/false);
11001 /* Like tsubst but deals with expressions and performs semantic
11002 analysis. FUNCTION_P is true if T is the "F" in "F (ARGS)". */
11005 tsubst_copy_and_build (tree t
,
11007 tsubst_flags_t complain
,
11010 bool integral_constant_expression_p
)
11012 #define RECUR(NODE) \
11013 tsubst_copy_and_build (NODE, args, complain, in_decl, \
11014 /*function_p=*/false, \
11015 integral_constant_expression_p)
11019 if (t
== NULL_TREE
|| t
== error_mark_node
)
11022 switch (TREE_CODE (t
))
11026 /* Fall through. */
11027 case IDENTIFIER_NODE
:
11031 bool non_integral_constant_expression_p
;
11032 const char *error_msg
;
11034 if (IDENTIFIER_TYPENAME_P (t
))
11036 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11037 t
= mangle_conv_op_name_for_type (new_type
);
11040 /* Look up the name. */
11041 decl
= lookup_name (t
);
11043 /* By convention, expressions use ERROR_MARK_NODE to indicate
11044 failure, not NULL_TREE. */
11045 if (decl
== NULL_TREE
)
11046 decl
= error_mark_node
;
11048 decl
= finish_id_expression (t
, decl
, NULL_TREE
,
11050 integral_constant_expression_p
,
11051 /*allow_non_integral_constant_expression_p=*/false,
11052 &non_integral_constant_expression_p
,
11053 /*template_p=*/false,
11055 /*address_p=*/false,
11056 /*template_arg_p=*/false,
11061 if (!function_p
&& TREE_CODE (decl
) == IDENTIFIER_NODE
)
11062 decl
= unqualified_name_lookup_error (decl
);
11066 case TEMPLATE_ID_EXPR
:
11069 tree templ
= RECUR (TREE_OPERAND (t
, 0));
11070 tree targs
= TREE_OPERAND (t
, 1);
11073 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
11075 if (TREE_CODE (templ
) == COMPONENT_REF
)
11077 object
= TREE_OPERAND (templ
, 0);
11078 templ
= TREE_OPERAND (templ
, 1);
11081 object
= NULL_TREE
;
11082 templ
= lookup_template_function (templ
, targs
);
11085 return build3 (COMPONENT_REF
, TREE_TYPE (templ
),
11086 object
, templ
, NULL_TREE
);
11088 return baselink_for_fns (templ
);
11093 tree r
= RECUR (TREE_OPERAND (t
, 0));
11095 if (REFERENCE_REF_P (t
))
11097 /* A type conversion to reference type will be enclosed in
11098 such an indirect ref, but the substitution of the cast
11099 will have also added such an indirect ref. */
11100 if (TREE_CODE (TREE_TYPE (r
)) == REFERENCE_TYPE
)
11101 r
= convert_from_reference (r
);
11104 r
= build_x_indirect_ref (r
, "unary *", complain
);
11110 (tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
11111 RECUR (TREE_OPERAND (t
, 0)));
11114 case REINTERPRET_CAST_EXPR
:
11115 case CONST_CAST_EXPR
:
11116 case DYNAMIC_CAST_EXPR
:
11117 case STATIC_CAST_EXPR
:
11122 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11123 if (integral_constant_expression_p
11124 && !cast_valid_in_integral_constant_expression_p (type
))
11126 if (complain
& tf_error
)
11127 error ("a cast to a type other than an integral or "
11128 "enumeration type cannot appear in a constant-expression");
11129 return error_mark_node
;
11132 op
= RECUR (TREE_OPERAND (t
, 0));
11134 switch (TREE_CODE (t
))
11137 return build_functional_cast (type
, op
, complain
);
11138 case REINTERPRET_CAST_EXPR
:
11139 return build_reinterpret_cast (type
, op
, complain
);
11140 case CONST_CAST_EXPR
:
11141 return build_const_cast (type
, op
, complain
);
11142 case DYNAMIC_CAST_EXPR
:
11143 return build_dynamic_cast (type
, op
, complain
);
11144 case STATIC_CAST_EXPR
:
11145 return build_static_cast (type
, op
, complain
);
11147 gcc_unreachable ();
11151 case POSTDECREMENT_EXPR
:
11152 case POSTINCREMENT_EXPR
:
11153 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
11154 args
, complain
, in_decl
);
11155 return build_x_unary_op (TREE_CODE (t
), op1
, complain
);
11157 case PREDECREMENT_EXPR
:
11158 case PREINCREMENT_EXPR
:
11162 case TRUTH_NOT_EXPR
:
11163 case UNARY_PLUS_EXPR
: /* Unary + */
11164 case REALPART_EXPR
:
11165 case IMAGPART_EXPR
:
11166 return build_x_unary_op (TREE_CODE (t
), RECUR (TREE_OPERAND (t
, 0)),
11170 op1
= TREE_OPERAND (t
, 0);
11171 if (TREE_CODE (op1
) == SCOPE_REF
)
11172 op1
= tsubst_qualified_id (op1
, args
, complain
, in_decl
,
11173 /*done=*/true, /*address_p=*/true);
11175 op1
= tsubst_non_call_postfix_expression (op1
, args
, complain
,
11177 if (TREE_CODE (op1
) == LABEL_DECL
)
11178 return finish_label_address_expr (DECL_NAME (op1
),
11179 EXPR_LOCATION (op1
));
11180 return build_x_unary_op (ADDR_EXPR
, op1
, complain
);
11185 case TRUNC_DIV_EXPR
:
11186 case CEIL_DIV_EXPR
:
11187 case FLOOR_DIV_EXPR
:
11188 case ROUND_DIV_EXPR
:
11189 case EXACT_DIV_EXPR
:
11193 case TRUNC_MOD_EXPR
:
11194 case FLOOR_MOD_EXPR
:
11195 case TRUTH_ANDIF_EXPR
:
11196 case TRUTH_ORIF_EXPR
:
11197 case TRUTH_AND_EXPR
:
11198 case TRUTH_OR_EXPR
:
11213 return build_x_binary_op
11215 RECUR (TREE_OPERAND (t
, 0)),
11216 (TREE_NO_WARNING (TREE_OPERAND (t
, 0))
11218 : TREE_CODE (TREE_OPERAND (t
, 0))),
11219 RECUR (TREE_OPERAND (t
, 1)),
11220 (TREE_NO_WARNING (TREE_OPERAND (t
, 1))
11222 : TREE_CODE (TREE_OPERAND (t
, 1))),
11223 /*overloaded_p=*/NULL
,
11227 return tsubst_qualified_id (t
, args
, complain
, in_decl
, /*done=*/true,
11228 /*address_p=*/false);
11230 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
11231 args
, complain
, in_decl
);
11232 return build_x_array_ref (op1
, RECUR (TREE_OPERAND (t
, 1)), complain
);
11235 if (PACK_EXPANSION_P (TREE_OPERAND (t
, 0)))
11236 return tsubst_copy (t
, args
, complain
, in_decl
);
11240 op1
= TREE_OPERAND (t
, 0);
11243 /* When there are no ARGS, we are trying to evaluate a
11244 non-dependent expression from the parser. Trying to do
11245 the substitutions may not work. */
11247 op1
= TREE_TYPE (op1
);
11252 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
11253 /*function_p=*/false,
11254 /*integral_constant_expression_p=*/false);
11258 return cxx_sizeof_or_alignof_type (op1
, TREE_CODE (t
),
11259 complain
& tf_error
);
11261 return cxx_sizeof_or_alignof_expr (op1
, TREE_CODE (t
),
11262 complain
& tf_error
);
11266 tree r
= build_x_modify_expr
11267 (RECUR (TREE_OPERAND (t
, 0)),
11268 TREE_CODE (TREE_OPERAND (t
, 1)),
11269 RECUR (TREE_OPERAND (t
, 2)),
11271 /* TREE_NO_WARNING must be set if either the expression was
11272 parenthesized or it uses an operator such as >>= rather
11273 than plain assignment. In the former case, it was already
11274 set and must be copied. In the latter case,
11275 build_x_modify_expr sets it and it must not be reset
11277 if (TREE_NO_WARNING (t
))
11278 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
11283 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
11284 args
, complain
, in_decl
);
11285 /* Remember that there was a reference to this entity. */
11288 return build_x_arrow (op1
);
11292 tree init
= RECUR (TREE_OPERAND (t
, 3));
11294 if (TREE_OPERAND (t
, 3) && !init
)
11295 /* If there was an initializer in the original tree, but
11296 it instantiated to an empty list, then we should pass on
11297 VOID_ZERO_NODE to tell build_new that it was an empty
11298 initializer () rather than no initializer. This can only
11299 happen when the initializer is a pack expansion whose
11300 parameter packs are of length zero. */
11301 init
= void_zero_node
;
11304 (RECUR (TREE_OPERAND (t
, 0)),
11305 RECUR (TREE_OPERAND (t
, 1)),
11306 RECUR (TREE_OPERAND (t
, 2)),
11308 NEW_EXPR_USE_GLOBAL (t
),
11313 return delete_sanity
11314 (RECUR (TREE_OPERAND (t
, 0)),
11315 RECUR (TREE_OPERAND (t
, 1)),
11316 DELETE_EXPR_USE_VEC (t
),
11317 DELETE_EXPR_USE_GLOBAL (t
));
11319 case COMPOUND_EXPR
:
11320 return build_x_compound_expr (RECUR (TREE_OPERAND (t
, 0)),
11321 RECUR (TREE_OPERAND (t
, 1)),
11331 function
= CALL_EXPR_FN (t
);
11332 /* When we parsed the expression, we determined whether or
11333 not Koenig lookup should be performed. */
11334 koenig_p
= KOENIG_LOOKUP_P (t
);
11335 if (TREE_CODE (function
) == SCOPE_REF
)
11337 qualified_p
= true;
11338 function
= tsubst_qualified_id (function
, args
, complain
, in_decl
,
11340 /*address_p=*/false);
11344 if (TREE_CODE (function
) == COMPONENT_REF
)
11346 tree op
= TREE_OPERAND (function
, 1);
11348 qualified_p
= (TREE_CODE (op
) == SCOPE_REF
11349 || (BASELINK_P (op
)
11350 && BASELINK_QUALIFIED_P (op
)));
11353 qualified_p
= false;
11355 function
= tsubst_copy_and_build (function
, args
, complain
,
11358 integral_constant_expression_p
);
11360 if (BASELINK_P (function
))
11361 qualified_p
= true;
11364 /* FIXME: Rewrite this so as not to construct an arglist. */
11365 call_args
= RECUR (CALL_EXPR_ARGS (t
));
11367 /* We do not perform argument-dependent lookup if normal
11368 lookup finds a non-function, in accordance with the
11369 expected resolution of DR 218. */
11371 && ((is_overloaded_fn (function
)
11372 /* If lookup found a member function, the Koenig lookup is
11373 not appropriate, even if an unqualified-name was used
11374 to denote the function. */
11375 && !DECL_FUNCTION_MEMBER_P (get_first_fn (function
)))
11376 || TREE_CODE (function
) == IDENTIFIER_NODE
))
11377 function
= perform_koenig_lookup (function
, call_args
);
11379 if (TREE_CODE (function
) == IDENTIFIER_NODE
)
11381 unqualified_name_lookup_error (function
);
11382 return error_mark_node
;
11385 /* Remember that there was a reference to this entity. */
11386 if (DECL_P (function
))
11387 mark_used (function
);
11389 if (TREE_CODE (function
) == OFFSET_REF
)
11390 return build_offset_ref_call_from_tree (function
, call_args
);
11391 if (TREE_CODE (function
) == COMPONENT_REF
)
11393 if (!BASELINK_P (TREE_OPERAND (function
, 1)))
11394 return finish_call_expr (function
, call_args
,
11395 /*disallow_virtual=*/false,
11396 /*koenig_p=*/false,
11399 return (build_new_method_call
11400 (TREE_OPERAND (function
, 0),
11401 TREE_OPERAND (function
, 1),
11402 call_args
, NULL_TREE
,
11403 qualified_p
? LOOKUP_NONVIRTUAL
: LOOKUP_NORMAL
,
11407 /* Pass -1 for koenig_p so that build_new_function_call will
11408 allow hidden friends found by arg-dependent lookup at template
11410 return finish_call_expr (function
, call_args
,
11411 /*disallow_virtual=*/qualified_p
,
11417 return build_x_conditional_expr
11418 (RECUR (TREE_OPERAND (t
, 0)),
11419 RECUR (TREE_OPERAND (t
, 1)),
11420 RECUR (TREE_OPERAND (t
, 2)),
11423 case PSEUDO_DTOR_EXPR
:
11424 return finish_pseudo_destructor_expr
11425 (RECUR (TREE_OPERAND (t
, 0)),
11426 RECUR (TREE_OPERAND (t
, 1)),
11427 RECUR (TREE_OPERAND (t
, 2)));
11431 tree purpose
, value
, chain
;
11433 if (t
== void_list_node
)
11436 if ((TREE_PURPOSE (t
) && PACK_EXPANSION_P (TREE_PURPOSE (t
)))
11437 || (TREE_VALUE (t
) && PACK_EXPANSION_P (TREE_VALUE (t
))))
11439 /* We have pack expansions, so expand those and
11440 create a new list out of it. */
11441 tree purposevec
= NULL_TREE
;
11442 tree valuevec
= NULL_TREE
;
11446 /* Expand the argument expressions. */
11447 if (TREE_PURPOSE (t
))
11448 purposevec
= tsubst_pack_expansion (TREE_PURPOSE (t
), args
,
11449 complain
, in_decl
);
11450 if (TREE_VALUE (t
))
11451 valuevec
= tsubst_pack_expansion (TREE_VALUE (t
), args
,
11452 complain
, in_decl
);
11454 /* Build the rest of the list. */
11455 chain
= TREE_CHAIN (t
);
11456 if (chain
&& chain
!= void_type_node
)
11457 chain
= RECUR (chain
);
11459 /* Determine the number of arguments. */
11460 if (purposevec
&& TREE_CODE (purposevec
) == TREE_VEC
)
11462 len
= TREE_VEC_LENGTH (purposevec
);
11463 gcc_assert (!valuevec
|| len
== TREE_VEC_LENGTH (valuevec
));
11465 else if (TREE_CODE (valuevec
) == TREE_VEC
)
11466 len
= TREE_VEC_LENGTH (valuevec
);
11469 /* Since we only performed a partial substitution into
11470 the argument pack, we only return a single list
11472 if (purposevec
== TREE_PURPOSE (t
)
11473 && valuevec
== TREE_VALUE (t
)
11474 && chain
== TREE_CHAIN (t
))
11477 return tree_cons (purposevec
, valuevec
, chain
);
11480 /* Convert the argument vectors into a TREE_LIST */
11484 /* Grab the Ith values. */
11486 purpose
= purposevec
? TREE_VEC_ELT (purposevec
, i
)
11489 = valuevec
? convert_from_reference (TREE_VEC_ELT (valuevec
, i
))
11492 /* Build the list (backwards). */
11493 chain
= tree_cons (purpose
, value
, chain
);
11499 purpose
= TREE_PURPOSE (t
);
11501 purpose
= RECUR (purpose
);
11502 value
= TREE_VALUE (t
);
11504 value
= RECUR (value
);
11505 chain
= TREE_CHAIN (t
);
11506 if (chain
&& chain
!= void_type_node
)
11507 chain
= RECUR (chain
);
11508 if (purpose
== TREE_PURPOSE (t
)
11509 && value
== TREE_VALUE (t
)
11510 && chain
== TREE_CHAIN (t
))
11512 return tree_cons (purpose
, value
, chain
);
11515 case COMPONENT_REF
:
11521 object
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
11522 args
, complain
, in_decl
);
11523 /* Remember that there was a reference to this entity. */
11524 if (DECL_P (object
))
11525 mark_used (object
);
11526 object_type
= TREE_TYPE (object
);
11528 member
= TREE_OPERAND (t
, 1);
11529 if (BASELINK_P (member
))
11530 member
= tsubst_baselink (member
,
11531 non_reference (TREE_TYPE (object
)),
11532 args
, complain
, in_decl
);
11534 member
= tsubst_copy (member
, args
, complain
, in_decl
);
11535 if (member
== error_mark_node
)
11536 return error_mark_node
;
11538 if (object_type
&& !CLASS_TYPE_P (object_type
))
11540 if (SCALAR_TYPE_P (object_type
))
11542 tree s
= NULL_TREE
;
11543 tree dtor
= member
;
11545 if (TREE_CODE (dtor
) == SCOPE_REF
)
11547 s
= TREE_OPERAND (dtor
, 0);
11548 dtor
= TREE_OPERAND (dtor
, 1);
11550 if (TREE_CODE (dtor
) == BIT_NOT_EXPR
)
11552 dtor
= TREE_OPERAND (dtor
, 0);
11554 return finish_pseudo_destructor_expr (object
, s
, dtor
);
11558 else if (TREE_CODE (member
) == SCOPE_REF
11559 && TREE_CODE (TREE_OPERAND (member
, 1)) == TEMPLATE_ID_EXPR
)
11564 /* Lookup the template functions now that we know what the
11566 tmpl
= TREE_OPERAND (TREE_OPERAND (member
, 1), 0);
11567 args
= TREE_OPERAND (TREE_OPERAND (member
, 1), 1);
11568 member
= lookup_qualified_name (TREE_OPERAND (member
, 0), tmpl
,
11569 /*is_type_p=*/false,
11570 /*complain=*/false);
11571 if (BASELINK_P (member
))
11573 BASELINK_FUNCTIONS (member
)
11574 = build_nt (TEMPLATE_ID_EXPR
, BASELINK_FUNCTIONS (member
),
11576 member
= (adjust_result_of_qualified_name_lookup
11577 (member
, BINFO_TYPE (BASELINK_BINFO (member
)),
11582 qualified_name_lookup_error (object_type
, tmpl
, member
,
11584 return error_mark_node
;
11587 else if (TREE_CODE (member
) == SCOPE_REF
11588 && !CLASS_TYPE_P (TREE_OPERAND (member
, 0))
11589 && TREE_CODE (TREE_OPERAND (member
, 0)) != NAMESPACE_DECL
)
11591 if (complain
& tf_error
)
11593 if (TYPE_P (TREE_OPERAND (member
, 0)))
11594 error ("%qT is not a class or namespace",
11595 TREE_OPERAND (member
, 0));
11597 error ("%qD is not a class or namespace",
11598 TREE_OPERAND (member
, 0));
11600 return error_mark_node
;
11602 else if (TREE_CODE (member
) == FIELD_DECL
)
11603 return finish_non_static_data_member (member
, object
, NULL_TREE
);
11605 return finish_class_member_access_expr (object
, member
,
11606 /*template_p=*/false,
11612 (RECUR (TREE_OPERAND (t
, 0)));
11616 VEC(constructor_elt
,gc
) *n
;
11617 constructor_elt
*ce
;
11618 unsigned HOST_WIDE_INT idx
;
11619 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11620 bool process_index_p
;
11622 bool need_copy_p
= false;
11625 if (type
== error_mark_node
)
11626 return error_mark_node
;
11628 /* digest_init will do the wrong thing if we let it. */
11629 if (type
&& TYPE_PTRMEMFUNC_P (type
))
11632 /* We do not want to process the index of aggregate
11633 initializers as they are identifier nodes which will be
11634 looked up by digest_init. */
11635 process_index_p
= !(type
&& MAYBE_CLASS_TYPE_P (type
));
11637 n
= VEC_copy (constructor_elt
, gc
, CONSTRUCTOR_ELTS (t
));
11638 newlen
= VEC_length (constructor_elt
, n
);
11639 for (idx
= 0; VEC_iterate (constructor_elt
, n
, idx
, ce
); idx
++)
11641 if (ce
->index
&& process_index_p
)
11642 ce
->index
= RECUR (ce
->index
);
11644 if (PACK_EXPANSION_P (ce
->value
))
11646 /* Substitute into the pack expansion. */
11647 ce
->value
= tsubst_pack_expansion (ce
->value
, args
, complain
,
11650 if (ce
->value
== error_mark_node
)
11652 else if (TREE_VEC_LENGTH (ce
->value
) == 1)
11653 /* Just move the argument into place. */
11654 ce
->value
= TREE_VEC_ELT (ce
->value
, 0);
11657 /* Update the length of the final CONSTRUCTOR
11658 arguments vector, and note that we will need to
11660 newlen
= newlen
+ TREE_VEC_LENGTH (ce
->value
) - 1;
11661 need_copy_p
= true;
11665 ce
->value
= RECUR (ce
->value
);
11670 VEC(constructor_elt
,gc
) *old_n
= n
;
11672 n
= VEC_alloc (constructor_elt
, gc
, newlen
);
11673 for (idx
= 0; VEC_iterate (constructor_elt
, old_n
, idx
, ce
);
11676 if (TREE_CODE (ce
->value
) == TREE_VEC
)
11678 int i
, len
= TREE_VEC_LENGTH (ce
->value
);
11679 for (i
= 0; i
< len
; ++i
)
11680 CONSTRUCTOR_APPEND_ELT (n
, 0,
11681 TREE_VEC_ELT (ce
->value
, i
));
11684 CONSTRUCTOR_APPEND_ELT (n
, 0, ce
->value
);
11688 r
= build_constructor (init_list_type_node
, n
);
11689 CONSTRUCTOR_IS_DIRECT_INIT (r
) = CONSTRUCTOR_IS_DIRECT_INIT (t
);
11691 if (TREE_HAS_CONSTRUCTOR (t
))
11692 return finish_compound_literal (type
, r
);
11699 tree operand_0
= RECUR (TREE_OPERAND (t
, 0));
11700 if (TYPE_P (operand_0
))
11701 return get_typeid (operand_0
);
11702 return build_typeid (operand_0
);
11712 tree r
= tsubst_copy (t
, args
, complain
, in_decl
);
11714 if (TREE_CODE (TREE_TYPE (t
)) != REFERENCE_TYPE
)
11715 /* If the original type was a reference, we'll be wrapped in
11716 the appropriate INDIRECT_REF. */
11717 r
= convert_from_reference (r
);
11722 return build_x_va_arg (RECUR (TREE_OPERAND (t
, 0)),
11723 tsubst_copy (TREE_TYPE (t
), args
, complain
,
11726 case OFFSETOF_EXPR
:
11727 return finish_offsetof (RECUR (TREE_OPERAND (t
, 0)));
11731 tree type1
= tsubst_copy (TRAIT_EXPR_TYPE1 (t
), args
,
11732 complain
, in_decl
);
11734 tree type2
= TRAIT_EXPR_TYPE2 (t
);
11736 type2
= tsubst_copy (type2
, args
, complain
, in_decl
);
11738 return finish_trait_expr (TRAIT_EXPR_KIND (t
), type1
, type2
);
11743 tree old_stmt_expr
= cur_stmt_expr
;
11744 tree stmt_expr
= begin_stmt_expr ();
11746 cur_stmt_expr
= stmt_expr
;
11747 tsubst_expr (STMT_EXPR_STMT (t
), args
, complain
, in_decl
,
11748 integral_constant_expression_p
);
11749 stmt_expr
= finish_stmt_expr (stmt_expr
, false);
11750 cur_stmt_expr
= old_stmt_expr
;
11756 t
= tsubst_copy (t
, args
, complain
, in_decl
);
11757 /* As in finish_id_expression, we resolve enumeration constants
11758 to their underlying values. */
11759 if (TREE_CODE (t
) == CONST_DECL
)
11761 used_types_insert (TREE_TYPE (t
));
11762 return DECL_INITIAL (t
);
11767 /* Handle Objective-C++ constructs, if appropriate. */
11770 = objcp_tsubst_copy_and_build (t
, args
, complain
,
11771 in_decl
, /*function_p=*/false);
11775 return tsubst_copy (t
, args
, complain
, in_decl
);
11781 /* Verify that the instantiated ARGS are valid. For type arguments,
11782 make sure that the type's linkage is ok. For non-type arguments,
11783 make sure they are constants if they are integral or enumerations.
11784 Emit an error under control of COMPLAIN, and return TRUE on error. */
11787 check_instantiated_arg (tree tmpl
, tree t
, tsubst_flags_t complain
)
11789 if (ARGUMENT_PACK_P (t
))
11791 tree vec
= ARGUMENT_PACK_ARGS (t
);
11792 int len
= TREE_VEC_LENGTH (vec
);
11793 bool result
= false;
11796 for (i
= 0; i
< len
; ++i
)
11797 if (check_instantiated_arg (tmpl
, TREE_VEC_ELT (vec
, i
), complain
))
11801 else if (TYPE_P (t
))
11803 /* [basic.link]: A name with no linkage (notably, the name
11804 of a class or enumeration declared in a local scope)
11805 shall not be used to declare an entity with linkage.
11806 This implies that names with no linkage cannot be used as
11807 template arguments. */
11808 tree nt
= no_linkage_check (t
, /*relaxed_p=*/false);
11812 /* DR 488 makes use of a type with no linkage cause
11813 type deduction to fail. */
11814 if (complain
& tf_error
)
11816 if (TYPE_ANONYMOUS_P (nt
))
11817 error ("%qT is/uses anonymous type", t
);
11819 error ("template argument for %qD uses local type %qT",
11824 /* In order to avoid all sorts of complications, we do not
11825 allow variably-modified types as template arguments. */
11826 else if (variably_modified_type_p (t
, NULL_TREE
))
11828 if (complain
& tf_error
)
11829 error ("%qT is a variably modified type", t
);
11833 /* A non-type argument of integral or enumerated type must be a
11835 else if (TREE_TYPE (t
)
11836 && INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (t
))
11837 && !TREE_CONSTANT (t
))
11839 if (complain
& tf_error
)
11840 error ("integral expression %qE is not constant", t
);
11847 check_instantiated_args (tree tmpl
, tree args
, tsubst_flags_t complain
)
11849 int ix
, len
= DECL_NTPARMS (tmpl
);
11850 bool result
= false;
11852 for (ix
= 0; ix
!= len
; ix
++)
11854 if (check_instantiated_arg (tmpl
, TREE_VEC_ELT (args
, ix
), complain
))
11857 if (result
&& (complain
& tf_error
))
11858 error (" trying to instantiate %qD", tmpl
);
11862 /* Instantiate the indicated variable or function template TMPL with
11863 the template arguments in TARG_PTR. */
11866 instantiate_template (tree tmpl
, tree targ_ptr
, tsubst_flags_t complain
)
11871 HOST_WIDE_INT saved_processing_template_decl
;
11873 if (tmpl
== error_mark_node
)
11874 return error_mark_node
;
11876 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
);
11878 /* If this function is a clone, handle it specially. */
11879 if (DECL_CLONED_FUNCTION_P (tmpl
))
11884 spec
= instantiate_template (DECL_CLONED_FUNCTION (tmpl
), targ_ptr
,
11886 if (spec
== error_mark_node
)
11887 return error_mark_node
;
11889 /* Look for the clone. */
11890 FOR_EACH_CLONE (clone
, spec
)
11891 if (DECL_NAME (clone
) == DECL_NAME (tmpl
))
11893 /* We should always have found the clone by now. */
11894 gcc_unreachable ();
11898 /* Check to see if we already have this specialization. */
11899 spec
= retrieve_specialization (tmpl
, targ_ptr
,
11900 /*class_specializations_p=*/false);
11901 if (spec
!= NULL_TREE
)
11904 gen_tmpl
= most_general_template (tmpl
);
11905 if (tmpl
!= gen_tmpl
)
11907 /* The TMPL is a partial instantiation. To get a full set of
11908 arguments we must add the arguments used to perform the
11909 partial instantiation. */
11910 targ_ptr
= add_outermost_template_args (DECL_TI_ARGS (tmpl
),
11913 /* Check to see if we already have this specialization. */
11914 spec
= retrieve_specialization (gen_tmpl
, targ_ptr
,
11915 /*class_specializations_p=*/false);
11916 if (spec
!= NULL_TREE
)
11920 if (check_instantiated_args (gen_tmpl
, INNERMOST_TEMPLATE_ARGS (targ_ptr
),
11922 return error_mark_node
;
11924 /* We are building a FUNCTION_DECL, during which the access of its
11925 parameters and return types have to be checked. However this
11926 FUNCTION_DECL which is the desired context for access checking
11927 is not built yet. We solve this chicken-and-egg problem by
11928 deferring all checks until we have the FUNCTION_DECL. */
11929 push_deferring_access_checks (dk_deferred
);
11931 /* Although PROCESSING_TEMPLATE_DECL may be true at this point
11932 (because, for example, we have encountered a non-dependent
11933 function call in the body of a template function and must now
11934 determine which of several overloaded functions will be called),
11935 within the instantiation itself we are not processing a
11937 saved_processing_template_decl
= processing_template_decl
;
11938 processing_template_decl
= 0;
11939 /* Substitute template parameters to obtain the specialization. */
11940 fndecl
= tsubst (DECL_TEMPLATE_RESULT (gen_tmpl
),
11941 targ_ptr
, complain
, gen_tmpl
);
11942 processing_template_decl
= saved_processing_template_decl
;
11943 if (fndecl
== error_mark_node
)
11944 return error_mark_node
;
11946 /* Now we know the specialization, compute access previously
11948 push_access_scope (fndecl
);
11949 perform_deferred_access_checks ();
11950 pop_access_scope (fndecl
);
11951 pop_deferring_access_checks ();
11953 /* The DECL_TI_TEMPLATE should always be the immediate parent
11954 template, not the most general template. */
11955 DECL_TI_TEMPLATE (fndecl
) = tmpl
;
11957 /* If we've just instantiated the main entry point for a function,
11958 instantiate all the alternate entry points as well. We do this
11959 by cloning the instantiation of the main entry point, not by
11960 instantiating the template clones. */
11961 if (TREE_CHAIN (gen_tmpl
) && DECL_CLONED_FUNCTION_P (TREE_CHAIN (gen_tmpl
)))
11962 clone_function_decl (fndecl
, /*update_method_vec_p=*/0);
11967 /* The FN is a TEMPLATE_DECL for a function. The ARGS are the
11968 arguments that are being used when calling it. TARGS is a vector
11969 into which the deduced template arguments are placed.
11971 Return zero for success, 2 for an incomplete match that doesn't resolve
11972 all the types, and 1 for complete failure. An error message will be
11973 printed only for an incomplete match.
11975 If FN is a conversion operator, or we are trying to produce a specific
11976 specialization, RETURN_TYPE is the return type desired.
11978 The EXPLICIT_TARGS are explicit template arguments provided via a
11981 The parameter STRICT is one of:
11984 We are deducing arguments for a function call, as in
11985 [temp.deduct.call].
11988 We are deducing arguments for a conversion function, as in
11989 [temp.deduct.conv].
11992 We are deducing arguments when doing an explicit instantiation
11993 as in [temp.explicit], when determining an explicit specialization
11994 as in [temp.expl.spec], or when taking the address of a function
11995 template, as in [temp.deduct.funcaddr]. */
11998 fn_type_unification (tree fn
,
11999 tree explicit_targs
,
12003 unification_kind_t strict
,
12009 bool incomplete_argument_packs_p
= false;
12011 gcc_assert (TREE_CODE (fn
) == TEMPLATE_DECL
);
12013 fntype
= TREE_TYPE (fn
);
12014 if (explicit_targs
)
12018 The specified template arguments must match the template
12019 parameters in kind (i.e., type, nontype, template), and there
12020 must not be more arguments than there are parameters;
12021 otherwise type deduction fails.
12023 Nontype arguments must match the types of the corresponding
12024 nontype template parameters, or must be convertible to the
12025 types of the corresponding nontype parameters as specified in
12026 _temp.arg.nontype_, otherwise type deduction fails.
12028 All references in the function type of the function template
12029 to the corresponding template parameters are replaced by the
12030 specified template argument values. If a substitution in a
12031 template parameter or in the function type of the function
12032 template results in an invalid type, type deduction fails. */
12033 tree tparms
= DECL_INNERMOST_TEMPLATE_PARMS (fn
);
12034 int i
, len
= TREE_VEC_LENGTH (tparms
);
12035 tree converted_args
;
12036 bool incomplete
= false;
12038 if (explicit_targs
== error_mark_node
)
12042 = (coerce_template_parms (tparms
, explicit_targs
, NULL_TREE
, tf_none
,
12043 /*require_all_args=*/false,
12044 /*use_default_args=*/false));
12045 if (converted_args
== error_mark_node
)
12048 /* Substitute the explicit args into the function type. This is
12049 necessary so that, for instance, explicitly declared function
12050 arguments can match null pointed constants. If we were given
12051 an incomplete set of explicit args, we must not do semantic
12052 processing during substitution as we could create partial
12054 for (i
= 0; i
< len
; i
++)
12056 tree parm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
12057 bool parameter_pack
= false;
12059 /* Dig out the actual parm. */
12060 if (TREE_CODE (parm
) == TYPE_DECL
12061 || TREE_CODE (parm
) == TEMPLATE_DECL
)
12063 parm
= TREE_TYPE (parm
);
12064 parameter_pack
= TEMPLATE_TYPE_PARAMETER_PACK (parm
);
12066 else if (TREE_CODE (parm
) == PARM_DECL
)
12068 parm
= DECL_INITIAL (parm
);
12069 parameter_pack
= TEMPLATE_PARM_PARAMETER_PACK (parm
);
12072 if (parameter_pack
)
12076 template_parm_level_and_index (parm
, &level
, &idx
);
12078 /* Mark the argument pack as "incomplete". We could
12079 still deduce more arguments during unification. */
12080 targ
= TMPL_ARG (converted_args
, level
, idx
);
12083 ARGUMENT_PACK_INCOMPLETE_P(targ
) = 1;
12084 ARGUMENT_PACK_EXPLICIT_ARGS (targ
)
12085 = ARGUMENT_PACK_ARGS (targ
);
12088 /* We have some incomplete argument packs. */
12089 incomplete_argument_packs_p
= true;
12093 if (incomplete_argument_packs_p
)
12094 /* Any substitution is guaranteed to be incomplete if there
12095 are incomplete argument packs, because we can still deduce
12099 incomplete
= NUM_TMPL_ARGS (explicit_targs
) != NUM_TMPL_ARGS (targs
);
12101 processing_template_decl
+= incomplete
;
12102 fntype
= tsubst (fntype
, converted_args
, tf_none
, NULL_TREE
);
12103 processing_template_decl
-= incomplete
;
12105 if (fntype
== error_mark_node
)
12108 /* Place the explicitly specified arguments in TARGS. */
12109 for (i
= NUM_TMPL_ARGS (converted_args
); i
--;)
12110 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (converted_args
, i
);
12113 /* Never do unification on the 'this' parameter. */
12114 parms
= skip_artificial_parms_for (fn
, TYPE_ARG_TYPES (fntype
));
12118 parms
= tree_cons (NULL_TREE
, TREE_TYPE (fntype
), parms
);
12119 args
= tree_cons (NULL_TREE
, return_type
, args
);
12122 /* We allow incomplete unification without an error message here
12123 because the standard doesn't seem to explicitly prohibit it. Our
12124 callers must be ready to deal with unification failures in any
12126 result
= type_unification_real (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
12127 targs
, parms
, args
, /*subr=*/0,
12130 if (result
== 0 && incomplete_argument_packs_p
)
12132 int i
, len
= NUM_TMPL_ARGS (targs
);
12134 /* Clear the "incomplete" flags on all argument packs. */
12135 for (i
= 0; i
< len
; i
++)
12137 tree arg
= TREE_VEC_ELT (targs
, i
);
12138 if (ARGUMENT_PACK_P (arg
))
12140 ARGUMENT_PACK_INCOMPLETE_P (arg
) = 0;
12141 ARGUMENT_PACK_EXPLICIT_ARGS (arg
) = NULL_TREE
;
12146 /* Now that we have bindings for all of the template arguments,
12147 ensure that the arguments deduced for the template template
12148 parameters have compatible template parameter lists. We cannot
12149 check this property before we have deduced all template
12150 arguments, because the template parameter types of a template
12151 template parameter might depend on prior template parameters
12152 deduced after the template template parameter. The following
12153 ill-formed example illustrates this issue:
12155 template<typename T, template<T> class C> void f(C<5>, T);
12157 template<int N> struct X {};
12160 f(X<5>(), 5l); // error: template argument deduction fails
12163 The template parameter list of 'C' depends on the template type
12164 parameter 'T', but 'C' is deduced to 'X' before 'T' is deduced to
12165 'long'. Thus, we can't check that 'C' cannot bind to 'X' at the
12166 time that we deduce 'C'. */
12168 && !template_template_parm_bindings_ok_p
12169 (DECL_INNERMOST_TEMPLATE_PARMS (fn
), targs
))
12173 /* All is well so far. Now, check:
12177 When all template arguments have been deduced, all uses of
12178 template parameters in nondeduced contexts are replaced with
12179 the corresponding deduced argument values. If the
12180 substitution results in an invalid type, as described above,
12181 type deduction fails. */
12182 if (tsubst (TREE_TYPE (fn
), targs
, tf_none
, NULL_TREE
)
12183 == error_mark_node
)
12189 /* Adjust types before performing type deduction, as described in
12190 [temp.deduct.call] and [temp.deduct.conv]. The rules in these two
12191 sections are symmetric. PARM is the type of a function parameter
12192 or the return type of the conversion function. ARG is the type of
12193 the argument passed to the call, or the type of the value
12194 initialized with the result of the conversion function.
12195 ARG_EXPR is the original argument expression, which may be null. */
12198 maybe_adjust_types_for_deduction (unification_kind_t strict
,
12212 /* Swap PARM and ARG throughout the remainder of this
12213 function; the handling is precisely symmetric since PARM
12214 will initialize ARG rather than vice versa. */
12222 /* There is nothing to do in this case. */
12226 gcc_unreachable ();
12229 if (TREE_CODE (*parm
) != REFERENCE_TYPE
)
12231 /* [temp.deduct.call]
12233 If P is not a reference type:
12235 --If A is an array type, the pointer type produced by the
12236 array-to-pointer standard conversion (_conv.array_) is
12237 used in place of A for type deduction; otherwise,
12239 --If A is a function type, the pointer type produced by
12240 the function-to-pointer standard conversion
12241 (_conv.func_) is used in place of A for type deduction;
12244 --If A is a cv-qualified type, the top level
12245 cv-qualifiers of A's type are ignored for type
12247 if (TREE_CODE (*arg
) == ARRAY_TYPE
)
12248 *arg
= build_pointer_type (TREE_TYPE (*arg
));
12249 else if (TREE_CODE (*arg
) == FUNCTION_TYPE
)
12250 *arg
= build_pointer_type (*arg
);
12252 *arg
= TYPE_MAIN_VARIANT (*arg
);
12255 /* From C++0x [14.8.2.1/3 temp.deduct.call] (after DR606), "If P is
12256 of the form T&&, where T is a template parameter, and the argument
12257 is an lvalue, T is deduced as A& */
12258 if (TREE_CODE (*parm
) == REFERENCE_TYPE
12259 && TYPE_REF_IS_RVALUE (*parm
)
12260 && TREE_CODE (TREE_TYPE (*parm
)) == TEMPLATE_TYPE_PARM
12261 && cp_type_quals (TREE_TYPE (*parm
)) == TYPE_UNQUALIFIED
12262 && arg_expr
&& real_lvalue_p (arg_expr
))
12263 *arg
= build_reference_type (*arg
);
12265 /* [temp.deduct.call]
12267 If P is a cv-qualified type, the top level cv-qualifiers
12268 of P's type are ignored for type deduction. If P is a
12269 reference type, the type referred to by P is used for
12271 *parm
= TYPE_MAIN_VARIANT (*parm
);
12272 if (TREE_CODE (*parm
) == REFERENCE_TYPE
)
12274 *parm
= TREE_TYPE (*parm
);
12275 result
|= UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
12278 /* DR 322. For conversion deduction, remove a reference type on parm
12279 too (which has been swapped into ARG). */
12280 if (strict
== DEDUCE_CONV
&& TREE_CODE (*arg
) == REFERENCE_TYPE
)
12281 *arg
= TREE_TYPE (*arg
);
12286 /* Most parms like fn_type_unification.
12288 If SUBR is 1, we're being called recursively (to unify the
12289 arguments of a function or method parameter of a function
12293 type_unification_real (tree tparms
,
12298 unification_kind_t strict
,
12301 tree parm
, arg
, arg_expr
;
12303 int ntparms
= TREE_VEC_LENGTH (tparms
);
12305 int saw_undeduced
= 0;
12308 gcc_assert (TREE_CODE (tparms
) == TREE_VEC
);
12309 gcc_assert (xparms
== NULL_TREE
|| TREE_CODE (xparms
) == TREE_LIST
);
12310 gcc_assert (!xargs
|| TREE_CODE (xargs
) == TREE_LIST
);
12311 gcc_assert (ntparms
> 0);
12316 sub_strict
= (UNIFY_ALLOW_OUTER_LEVEL
| UNIFY_ALLOW_MORE_CV_QUAL
12317 | UNIFY_ALLOW_DERIVED
);
12321 sub_strict
= UNIFY_ALLOW_LESS_CV_QUAL
;
12325 sub_strict
= UNIFY_ALLOW_NONE
;
12329 gcc_unreachable ();
12336 while (parms
&& parms
!= void_list_node
12337 && args
&& args
!= void_list_node
)
12339 if (TREE_CODE (TREE_VALUE (parms
)) == TYPE_PACK_EXPANSION
)
12342 parm
= TREE_VALUE (parms
);
12343 parms
= TREE_CHAIN (parms
);
12344 arg
= TREE_VALUE (args
);
12345 args
= TREE_CHAIN (args
);
12348 if (arg
== error_mark_node
)
12350 if (arg
== unknown_type_node
)
12351 /* We can't deduce anything from this, but we might get all the
12352 template args from other function args. */
12355 /* Conversions will be performed on a function argument that
12356 corresponds with a function parameter that contains only
12357 non-deducible template parameters and explicitly specified
12358 template parameters. */
12359 if (!uses_template_parms (parm
))
12364 type
= TREE_TYPE (arg
);
12368 if (same_type_p (parm
, type
))
12370 if (strict
!= DEDUCE_EXACT
12371 && can_convert_arg (parm
, type
, TYPE_P (arg
) ? NULL_TREE
: arg
,
12380 gcc_assert (TREE_TYPE (arg
) != NULL_TREE
);
12381 if (type_unknown_p (arg
))
12383 /* [temp.deduct.type]
12385 A template-argument can be deduced from a pointer to
12386 function or pointer to member function argument if
12387 the set of overloaded functions does not contain
12388 function templates and at most one of a set of
12389 overloaded functions provides a unique match. */
12390 if (resolve_overloaded_unification
12391 (tparms
, targs
, parm
, arg
, strict
, sub_strict
))
12397 arg
= unlowered_expr_type (arg
);
12398 if (arg
== error_mark_node
)
12403 int arg_strict
= sub_strict
;
12406 arg_strict
|= maybe_adjust_types_for_deduction (strict
, &parm
, &arg
,
12409 if (arg
== init_list_type_node
&& arg_expr
)
12411 if (unify (tparms
, targs
, parm
, arg
, arg_strict
))
12418 && parms
!= void_list_node
12419 && TREE_CODE (TREE_VALUE (parms
)) == TYPE_PACK_EXPANSION
)
12421 /* Unify the remaining arguments with the pack expansion type. */
12423 tree parmvec
= make_tree_vec (1);
12427 /* Count the number of arguments that remain. */
12428 for (t
= args
; t
&& t
!= void_list_node
; t
= TREE_CHAIN (t
))
12431 /* Allocate a TREE_VEC and copy in all of the arguments */
12432 argvec
= make_tree_vec (len
);
12433 for (i
= 0; args
&& args
!= void_list_node
; args
= TREE_CHAIN (args
))
12435 TREE_VEC_ELT (argvec
, i
) = TREE_VALUE (args
);
12439 /* Copy the parameter into parmvec. */
12440 TREE_VEC_ELT (parmvec
, 0) = TREE_VALUE (parms
);
12441 if (unify_pack_expansion (tparms
, targs
, parmvec
, argvec
, strict
,
12442 /*call_args_p=*/true, /*subr=*/subr
))
12445 /* Advance to the end of the list of parameters. */
12446 parms
= TREE_CHAIN (parms
);
12449 /* Fail if we've reached the end of the parm list, and more args
12450 are present, and the parm list isn't variadic. */
12451 if (args
&& args
!= void_list_node
&& parms
== void_list_node
)
12453 /* Fail if parms are left and they don't have default values. */
12454 if (parms
&& parms
!= void_list_node
12455 && TREE_PURPOSE (parms
) == NULL_TREE
)
12459 for (i
= 0; i
< ntparms
; i
++)
12460 if (!TREE_VEC_ELT (targs
, i
))
12464 if (TREE_VEC_ELT (tparms
, i
) == error_mark_node
)
12467 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
12469 /* If this is an undeduced nontype parameter that depends on
12470 a type parameter, try another pass; its type may have been
12471 deduced from a later argument than the one from which
12472 this parameter can be deduced. */
12473 if (TREE_CODE (tparm
) == PARM_DECL
12474 && uses_template_parms (TREE_TYPE (tparm
))
12475 && !saw_undeduced
++)
12478 /* Core issue #226 (C++0x) [temp.deduct]:
12480 If a template argument has not been deduced, its
12481 default template argument, if any, is used.
12483 When we are in C++98 mode, TREE_PURPOSE will either
12484 be NULL_TREE or ERROR_MARK_NODE, so we do not need
12485 to explicitly check cxx_dialect here. */
12486 if (TREE_PURPOSE (TREE_VEC_ELT (tparms
, i
)))
12488 tree arg
= tsubst (TREE_PURPOSE (TREE_VEC_ELT (tparms
, i
)),
12489 targs
, tf_none
, NULL_TREE
);
12490 if (arg
== error_mark_node
)
12494 TREE_VEC_ELT (targs
, i
) = arg
;
12499 /* If the type parameter is a parameter pack, then it will
12500 be deduced to an empty parameter pack. */
12501 if (template_parameter_pack_p (tparm
))
12505 if (TREE_CODE (tparm
) == TEMPLATE_PARM_INDEX
)
12507 arg
= make_node (NONTYPE_ARGUMENT_PACK
);
12508 TREE_TYPE (arg
) = TREE_TYPE (TEMPLATE_PARM_DECL (tparm
));
12509 TREE_CONSTANT (arg
) = 1;
12512 arg
= make_node (TYPE_ARGUMENT_PACK
);
12514 SET_ARGUMENT_PACK_ARGS (arg
, make_tree_vec (0));
12516 TREE_VEC_ELT (targs
, i
) = arg
;
12526 /* Subroutine of type_unification_real. Args are like the variables
12527 at the call site. ARG is an overloaded function (or template-id);
12528 we try deducing template args from each of the overloads, and if
12529 only one succeeds, we go with that. Modifies TARGS and returns
12530 true on success. */
12533 resolve_overloaded_unification (tree tparms
,
12537 unification_kind_t strict
,
12540 tree tempargs
= copy_node (targs
);
12544 if (TREE_CODE (arg
) == ADDR_EXPR
)
12546 arg
= TREE_OPERAND (arg
, 0);
12552 if (TREE_CODE (arg
) == COMPONENT_REF
)
12553 /* Handle `&x' where `x' is some static or non-static member
12555 arg
= TREE_OPERAND (arg
, 1);
12557 if (TREE_CODE (arg
) == OFFSET_REF
)
12558 arg
= TREE_OPERAND (arg
, 1);
12560 /* Strip baselink information. */
12561 if (BASELINK_P (arg
))
12562 arg
= BASELINK_FUNCTIONS (arg
);
12564 if (TREE_CODE (arg
) == TEMPLATE_ID_EXPR
)
12566 /* If we got some explicit template args, we need to plug them into
12567 the affected templates before we try to unify, in case the
12568 explicit args will completely resolve the templates in question. */
12570 tree expl_subargs
= TREE_OPERAND (arg
, 1);
12571 arg
= TREE_OPERAND (arg
, 0);
12573 for (; arg
; arg
= OVL_NEXT (arg
))
12575 tree fn
= OVL_CURRENT (arg
);
12576 tree subargs
, elem
;
12578 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
12581 ++processing_template_decl
;
12582 subargs
= get_bindings (fn
, DECL_TEMPLATE_RESULT (fn
),
12583 expl_subargs
, /*check_ret=*/false);
12586 elem
= tsubst (TREE_TYPE (fn
), subargs
, tf_none
, NULL_TREE
);
12587 good
+= try_one_overload (tparms
, targs
, tempargs
, parm
,
12588 elem
, strict
, sub_strict
, addr_p
);
12590 --processing_template_decl
;
12593 else if (TREE_CODE (arg
) != OVERLOAD
12594 && TREE_CODE (arg
) != FUNCTION_DECL
)
12595 /* If ARG is, for example, "(0, &f)" then its type will be unknown
12596 -- but the deduction does not succeed because the expression is
12597 not just the function on its own. */
12600 for (; arg
; arg
= OVL_NEXT (arg
))
12601 good
+= try_one_overload (tparms
, targs
, tempargs
, parm
,
12602 TREE_TYPE (OVL_CURRENT (arg
)),
12603 strict
, sub_strict
, addr_p
);
12605 /* [temp.deduct.type] A template-argument can be deduced from a pointer
12606 to function or pointer to member function argument if the set of
12607 overloaded functions does not contain function templates and at most
12608 one of a set of overloaded functions provides a unique match.
12610 So if we found multiple possibilities, we return success but don't
12611 deduce anything. */
12615 int i
= TREE_VEC_LENGTH (targs
);
12617 if (TREE_VEC_ELT (tempargs
, i
))
12618 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (tempargs
, i
);
12626 /* Subroutine of resolve_overloaded_unification; does deduction for a single
12627 overload. Fills TARGS with any deduced arguments, or error_mark_node if
12628 different overloads deduce different arguments for a given parm.
12629 ADDR_P is true if the expression for which deduction is being
12630 performed was of the form "& fn" rather than simply "fn".
12632 Returns 1 on success. */
12635 try_one_overload (tree tparms
,
12640 unification_kind_t strict
,
12648 /* [temp.deduct.type] A template-argument can be deduced from a pointer
12649 to function or pointer to member function argument if the set of
12650 overloaded functions does not contain function templates and at most
12651 one of a set of overloaded functions provides a unique match.
12653 So if this is a template, just return success. */
12655 if (uses_template_parms (arg
))
12658 if (TREE_CODE (arg
) == METHOD_TYPE
)
12659 arg
= build_ptrmemfunc_type (build_pointer_type (arg
));
12661 arg
= build_pointer_type (arg
);
12663 sub_strict
|= maybe_adjust_types_for_deduction (strict
, &parm
, &arg
, NULL
);
12665 /* We don't copy orig_targs for this because if we have already deduced
12666 some template args from previous args, unify would complain when we
12667 try to deduce a template parameter for the same argument, even though
12668 there isn't really a conflict. */
12669 nargs
= TREE_VEC_LENGTH (targs
);
12670 tempargs
= make_tree_vec (nargs
);
12672 if (unify (tparms
, tempargs
, parm
, arg
, sub_strict
) != 0)
12675 /* First make sure we didn't deduce anything that conflicts with
12676 explicitly specified args. */
12677 for (i
= nargs
; i
--; )
12679 tree elt
= TREE_VEC_ELT (tempargs
, i
);
12680 tree oldelt
= TREE_VEC_ELT (orig_targs
, i
);
12684 else if (uses_template_parms (elt
))
12685 /* Since we're unifying against ourselves, we will fill in
12686 template args used in the function parm list with our own
12687 template parms. Discard them. */
12688 TREE_VEC_ELT (tempargs
, i
) = NULL_TREE
;
12689 else if (oldelt
&& !template_args_equal (oldelt
, elt
))
12693 for (i
= nargs
; i
--; )
12695 tree elt
= TREE_VEC_ELT (tempargs
, i
);
12698 TREE_VEC_ELT (targs
, i
) = elt
;
12704 /* PARM is a template class (perhaps with unbound template
12705 parameters). ARG is a fully instantiated type. If ARG can be
12706 bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and
12707 TARGS are as for unify. */
12710 try_class_unification (tree tparms
, tree targs
, tree parm
, tree arg
)
12712 tree copy_of_targs
;
12714 if (!CLASSTYPE_TEMPLATE_INFO (arg
)
12715 || (most_general_template (CLASSTYPE_TI_TEMPLATE (arg
))
12716 != most_general_template (CLASSTYPE_TI_TEMPLATE (parm
))))
12719 /* We need to make a new template argument vector for the call to
12720 unify. If we used TARGS, we'd clutter it up with the result of
12721 the attempted unification, even if this class didn't work out.
12722 We also don't want to commit ourselves to all the unifications
12723 we've already done, since unification is supposed to be done on
12724 an argument-by-argument basis. In other words, consider the
12725 following pathological case:
12727 template <int I, int J, int K>
12730 template <int I, int J>
12731 struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {};
12733 template <int I, int J, int K>
12734 void f(S<I, J, K>, S<I, I, I>);
12743 Now, by the time we consider the unification involving `s2', we
12744 already know that we must have `f<0, 0, 0>'. But, even though
12745 `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is invalid
12746 because there are two ways to unify base classes of S<0, 1, 2>
12747 with S<I, I, I>. If we kept the already deduced knowledge, we
12748 would reject the possibility I=1. */
12749 copy_of_targs
= make_tree_vec (TREE_VEC_LENGTH (targs
));
12751 /* If unification failed, we're done. */
12752 if (unify (tparms
, copy_of_targs
, CLASSTYPE_TI_ARGS (parm
),
12753 CLASSTYPE_TI_ARGS (arg
), UNIFY_ALLOW_NONE
))
12759 /* Given a template type PARM and a class type ARG, find the unique
12760 base type in ARG that is an instance of PARM. We do not examine
12761 ARG itself; only its base-classes. If there is not exactly one
12762 appropriate base class, return NULL_TREE. PARM may be the type of
12763 a partial specialization, as well as a plain template type. Used
12767 get_template_base (tree tparms
, tree targs
, tree parm
, tree arg
)
12769 tree rval
= NULL_TREE
;
12772 gcc_assert (RECORD_OR_UNION_CODE_P (TREE_CODE (arg
)));
12774 binfo
= TYPE_BINFO (complete_type (arg
));
12776 /* The type could not be completed. */
12779 /* Walk in inheritance graph order. The search order is not
12780 important, and this avoids multiple walks of virtual bases. */
12781 for (binfo
= TREE_CHAIN (binfo
); binfo
; binfo
= TREE_CHAIN (binfo
))
12783 tree r
= try_class_unification (tparms
, targs
, parm
, BINFO_TYPE (binfo
));
12787 /* If there is more than one satisfactory baseclass, then:
12791 If they yield more than one possible deduced A, the type
12795 if (rval
&& !same_type_p (r
, rval
))
12805 /* Returns the level of DECL, which declares a template parameter. */
12808 template_decl_level (tree decl
)
12810 switch (TREE_CODE (decl
))
12813 case TEMPLATE_DECL
:
12814 return TEMPLATE_TYPE_LEVEL (TREE_TYPE (decl
));
12817 return TEMPLATE_PARM_LEVEL (DECL_INITIAL (decl
));
12820 gcc_unreachable ();
12825 /* Decide whether ARG can be unified with PARM, considering only the
12826 cv-qualifiers of each type, given STRICT as documented for unify.
12827 Returns nonzero iff the unification is OK on that basis. */
12830 check_cv_quals_for_unify (int strict
, tree arg
, tree parm
)
12832 int arg_quals
= cp_type_quals (arg
);
12833 int parm_quals
= cp_type_quals (parm
);
12835 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
12836 && !(strict
& UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
12838 /* Although a CVR qualifier is ignored when being applied to a
12839 substituted template parameter ([8.3.2]/1 for example), that
12840 does not apply during deduction [14.8.2.4]/1, (even though
12841 that is not explicitly mentioned, [14.8.2.4]/9 indicates
12842 this). Except when we're allowing additional CV qualifiers
12843 at the outer level [14.8.2.1]/3,1st bullet. */
12844 if ((TREE_CODE (arg
) == REFERENCE_TYPE
12845 || TREE_CODE (arg
) == FUNCTION_TYPE
12846 || TREE_CODE (arg
) == METHOD_TYPE
)
12847 && (parm_quals
& (TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
)))
12850 if ((!POINTER_TYPE_P (arg
) && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
)
12851 && (parm_quals
& TYPE_QUAL_RESTRICT
))
12855 if (!(strict
& (UNIFY_ALLOW_MORE_CV_QUAL
| UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
12856 && (arg_quals
& parm_quals
) != parm_quals
)
12859 if (!(strict
& (UNIFY_ALLOW_LESS_CV_QUAL
| UNIFY_ALLOW_OUTER_LESS_CV_QUAL
))
12860 && (parm_quals
& arg_quals
) != arg_quals
)
12866 /* Determines the LEVEL and INDEX for the template parameter PARM. */
12868 template_parm_level_and_index (tree parm
, int* level
, int* index
)
12870 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
12871 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
12872 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
12874 *index
= TEMPLATE_TYPE_IDX (parm
);
12875 *level
= TEMPLATE_TYPE_LEVEL (parm
);
12879 *index
= TEMPLATE_PARM_IDX (parm
);
12880 *level
= TEMPLATE_PARM_LEVEL (parm
);
12884 /* Unifies the remaining arguments in PACKED_ARGS with the pack
12885 expansion at the end of PACKED_PARMS. Returns 0 if the type
12886 deduction succeeds, 1 otherwise. STRICT is the same as in
12887 unify. CALL_ARGS_P is true iff PACKED_ARGS is actually a function
12888 call argument list. We'll need to adjust the arguments to make them
12889 types. SUBR tells us if this is from a recursive call to
12890 type_unification_real. */
12892 unify_pack_expansion (tree tparms
, tree targs
, tree packed_parms
,
12893 tree packed_args
, int strict
, bool call_args_p
,
12897 = TREE_VEC_ELT (packed_parms
, TREE_VEC_LENGTH (packed_parms
) - 1);
12898 tree pattern
= PACK_EXPANSION_PATTERN (parm
);
12899 tree pack
, packs
= NULL_TREE
;
12900 int i
, start
= TREE_VEC_LENGTH (packed_parms
) - 1;
12901 int len
= TREE_VEC_LENGTH (packed_args
);
12903 /* Determine the parameter packs we will be deducing from the
12904 pattern, and record their current deductions. */
12905 for (pack
= PACK_EXPANSION_PARAMETER_PACKS (parm
);
12906 pack
; pack
= TREE_CHAIN (pack
))
12908 tree parm_pack
= TREE_VALUE (pack
);
12911 /* Determine the index and level of this parameter pack. */
12912 template_parm_level_and_index (parm_pack
, &level
, &idx
);
12914 /* Keep track of the parameter packs and their corresponding
12916 packs
= tree_cons (parm_pack
, TMPL_ARG (targs
, level
, idx
), packs
);
12917 TREE_TYPE (packs
) = make_tree_vec (len
- start
);
12920 /* Loop through all of the arguments that have not yet been
12921 unified and unify each with the pattern. */
12922 for (i
= start
; i
< len
; i
++)
12924 tree parm
= pattern
;
12926 /* For each parameter pack, clear out the deduced value so that
12927 we can deduce it again. */
12928 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
12931 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
12933 TMPL_ARG (targs
, level
, idx
) = NULL_TREE
;
12936 /* Unify the pattern with the current argument. */
12938 tree arg
= TREE_VEC_ELT (packed_args
, i
);
12939 tree arg_expr
= NULL_TREE
;
12940 int arg_strict
= strict
;
12941 bool skip_arg_p
= false;
12947 /* This mirrors what we do in type_unification_real. */
12951 sub_strict
= (UNIFY_ALLOW_OUTER_LEVEL
12952 | UNIFY_ALLOW_MORE_CV_QUAL
12953 | UNIFY_ALLOW_DERIVED
);
12957 sub_strict
= UNIFY_ALLOW_LESS_CV_QUAL
;
12961 sub_strict
= UNIFY_ALLOW_NONE
;
12965 gcc_unreachable ();
12970 gcc_assert (TREE_TYPE (arg
) != NULL_TREE
);
12971 if (type_unknown_p (arg
))
12973 /* [temp.deduct.type] A template-argument can be
12974 deduced from a pointer to function or pointer
12975 to member function argument if the set of
12976 overloaded functions does not contain function
12977 templates and at most one of a set of
12978 overloaded functions provides a unique
12981 if (resolve_overloaded_unification
12982 (tparms
, targs
, parm
, arg
, strict
, sub_strict
)
12991 arg
= unlowered_expr_type (arg
);
12992 if (arg
== error_mark_node
)
12997 arg_strict
= sub_strict
;
13001 maybe_adjust_types_for_deduction (strict
, &parm
, &arg
,
13007 if (unify (tparms
, targs
, parm
, arg
, arg_strict
))
13012 /* For each parameter pack, collect the deduced value. */
13013 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
13016 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
13018 TREE_VEC_ELT (TREE_TYPE (pack
), i
- start
) =
13019 TMPL_ARG (targs
, level
, idx
);
13023 /* Verify that the results of unification with the parameter packs
13024 produce results consistent with what we've seen before, and make
13025 the deduced argument packs available. */
13026 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
13028 tree old_pack
= TREE_VALUE (pack
);
13029 tree new_args
= TREE_TYPE (pack
);
13030 int i
, len
= TREE_VEC_LENGTH (new_args
);
13031 bool nondeduced_p
= false;
13033 /* If NEW_ARGS contains any NULL_TREE entries, we didn't
13034 actually deduce anything. */
13035 for (i
= 0; i
< len
&& !nondeduced_p
; ++i
)
13036 if (TREE_VEC_ELT (new_args
, i
) == NULL_TREE
)
13037 nondeduced_p
= true;
13041 if (old_pack
&& ARGUMENT_PACK_INCOMPLETE_P (old_pack
))
13043 /* Prepend the explicit arguments onto NEW_ARGS. */
13044 tree explicit_args
= ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
);
13045 tree old_args
= new_args
;
13046 int i
, explicit_len
= TREE_VEC_LENGTH (explicit_args
);
13047 int len
= explicit_len
+ TREE_VEC_LENGTH (old_args
);
13049 /* Copy the explicit arguments. */
13050 new_args
= make_tree_vec (len
);
13051 for (i
= 0; i
< explicit_len
; i
++)
13052 TREE_VEC_ELT (new_args
, i
) = TREE_VEC_ELT (explicit_args
, i
);
13054 /* Copy the deduced arguments. */
13055 for (; i
< len
; i
++)
13056 TREE_VEC_ELT (new_args
, i
) =
13057 TREE_VEC_ELT (old_args
, i
- explicit_len
);
13065 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
13067 /* Build the deduced *_ARGUMENT_PACK. */
13068 if (TREE_CODE (TREE_PURPOSE (pack
)) == TEMPLATE_PARM_INDEX
)
13070 result
= make_node (NONTYPE_ARGUMENT_PACK
);
13071 TREE_TYPE (result
) =
13072 TREE_TYPE (TEMPLATE_PARM_DECL (TREE_PURPOSE (pack
)));
13073 TREE_CONSTANT (result
) = 1;
13076 result
= make_node (TYPE_ARGUMENT_PACK
);
13078 SET_ARGUMENT_PACK_ARGS (result
, new_args
);
13080 /* Note the deduced argument packs for this parameter
13082 TMPL_ARG (targs
, level
, idx
) = result
;
13084 else if (ARGUMENT_PACK_INCOMPLETE_P (old_pack
)
13085 && (ARGUMENT_PACK_ARGS (old_pack
)
13086 == ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
)))
13088 /* We only had the explicitly-provided arguments before, but
13089 now we have a complete set of arguments. */
13091 tree explicit_args
= ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
);
13092 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
13094 /* Keep the original deduced argument pack. */
13095 TMPL_ARG (targs
, level
, idx
) = old_pack
;
13097 SET_ARGUMENT_PACK_ARGS (old_pack
, new_args
);
13098 ARGUMENT_PACK_INCOMPLETE_P (old_pack
) = 1;
13099 ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
) = explicit_args
;
13101 else if (!comp_template_args (ARGUMENT_PACK_ARGS (old_pack
),
13103 /* Inconsistent unification of this parameter pack. */
13109 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
13111 /* Keep the original deduced argument pack. */
13112 TMPL_ARG (targs
, level
, idx
) = old_pack
;
13119 /* Deduce the value of template parameters. TPARMS is the (innermost)
13120 set of template parameters to a template. TARGS is the bindings
13121 for those template parameters, as determined thus far; TARGS may
13122 include template arguments for outer levels of template parameters
13123 as well. PARM is a parameter to a template function, or a
13124 subcomponent of that parameter; ARG is the corresponding argument.
13125 This function attempts to match PARM with ARG in a manner
13126 consistent with the existing assignments in TARGS. If more values
13127 are deduced, then TARGS is updated.
13129 Returns 0 if the type deduction succeeds, 1 otherwise. The
13130 parameter STRICT is a bitwise or of the following flags:
13133 Require an exact match between PARM and ARG.
13134 UNIFY_ALLOW_MORE_CV_QUAL:
13135 Allow the deduced ARG to be more cv-qualified (by qualification
13136 conversion) than ARG.
13137 UNIFY_ALLOW_LESS_CV_QUAL:
13138 Allow the deduced ARG to be less cv-qualified than ARG.
13139 UNIFY_ALLOW_DERIVED:
13140 Allow the deduced ARG to be a template base class of ARG,
13141 or a pointer to a template base class of the type pointed to by
13143 UNIFY_ALLOW_INTEGER:
13144 Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX
13145 case for more information.
13146 UNIFY_ALLOW_OUTER_LEVEL:
13147 This is the outermost level of a deduction. Used to determine validity
13148 of qualification conversions. A valid qualification conversion must
13149 have const qualified pointers leading up to the inner type which
13150 requires additional CV quals, except at the outer level, where const
13151 is not required [conv.qual]. It would be normal to set this flag in
13152 addition to setting UNIFY_ALLOW_MORE_CV_QUAL.
13153 UNIFY_ALLOW_OUTER_MORE_CV_QUAL:
13154 This is the outermost level of a deduction, and PARM can be more CV
13155 qualified at this point.
13156 UNIFY_ALLOW_OUTER_LESS_CV_QUAL:
13157 This is the outermost level of a deduction, and PARM can be less CV
13158 qualified at this point. */
13161 unify (tree tparms
, tree targs
, tree parm
, tree arg
, int strict
)
13166 int strict_in
= strict
;
13168 /* I don't think this will do the right thing with respect to types.
13169 But the only case I've seen it in so far has been array bounds, where
13170 signedness is the only information lost, and I think that will be
13172 while (TREE_CODE (parm
) == NOP_EXPR
)
13173 parm
= TREE_OPERAND (parm
, 0);
13175 if (arg
== error_mark_node
)
13177 if (arg
== unknown_type_node
13178 || arg
== init_list_type_node
)
13179 /* We can't deduce anything from this, but we might get all the
13180 template args from other function args. */
13183 /* If PARM uses template parameters, then we can't bail out here,
13184 even if ARG == PARM, since we won't record unifications for the
13185 template parameters. We might need them if we're trying to
13186 figure out which of two things is more specialized. */
13187 if (arg
== parm
&& !uses_template_parms (parm
))
13190 /* Handle init lists early, so the rest of the function can assume
13191 we're dealing with a type. */
13192 if (BRACE_ENCLOSED_INITIALIZER_P (arg
))
13197 if (!is_std_init_list (parm
))
13198 /* We can only deduce from an initializer list argument if the
13199 parameter is std::initializer_list; otherwise this is a
13200 non-deduced context. */
13203 elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (parm
), 0);
13205 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (arg
), i
, elt
)
13207 int elt_strict
= strict
;
13208 if (!BRACE_ENCLOSED_INITIALIZER_P (elt
))
13210 tree type
= TREE_TYPE (elt
);
13211 /* It should only be possible to get here for a call. */
13212 gcc_assert (elt_strict
& UNIFY_ALLOW_OUTER_LEVEL
);
13213 elt_strict
|= maybe_adjust_types_for_deduction
13214 (DEDUCE_CALL
, &elttype
, &type
, elt
);
13218 if (unify (tparms
, targs
, elttype
, elt
, elt_strict
))
13224 /* Immediately reject some pairs that won't unify because of
13225 cv-qualification mismatches. */
13226 if (TREE_CODE (arg
) == TREE_CODE (parm
)
13228 /* It is the elements of the array which hold the cv quals of an array
13229 type, and the elements might be template type parms. We'll check
13230 when we recurse. */
13231 && TREE_CODE (arg
) != ARRAY_TYPE
13232 /* We check the cv-qualifiers when unifying with template type
13233 parameters below. We want to allow ARG `const T' to unify with
13234 PARM `T' for example, when computing which of two templates
13235 is more specialized, for example. */
13236 && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
13237 && !check_cv_quals_for_unify (strict_in
, arg
, parm
))
13240 if (!(strict
& UNIFY_ALLOW_OUTER_LEVEL
)
13241 && TYPE_P (parm
) && !CP_TYPE_CONST_P (parm
))
13242 strict
&= ~UNIFY_ALLOW_MORE_CV_QUAL
;
13243 strict
&= ~UNIFY_ALLOW_OUTER_LEVEL
;
13244 strict
&= ~UNIFY_ALLOW_DERIVED
;
13245 strict
&= ~UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
13246 strict
&= ~UNIFY_ALLOW_OUTER_LESS_CV_QUAL
;
13248 switch (TREE_CODE (parm
))
13250 case TYPENAME_TYPE
:
13252 case UNBOUND_CLASS_TEMPLATE
:
13253 /* In a type which contains a nested-name-specifier, template
13254 argument values cannot be deduced for template parameters used
13255 within the nested-name-specifier. */
13258 case TEMPLATE_TYPE_PARM
:
13259 case TEMPLATE_TEMPLATE_PARM
:
13260 case BOUND_TEMPLATE_TEMPLATE_PARM
:
13261 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
13262 if (tparm
== error_mark_node
)
13265 if (TEMPLATE_TYPE_LEVEL (parm
)
13266 != template_decl_level (tparm
))
13267 /* The PARM is not one we're trying to unify. Just check
13268 to see if it matches ARG. */
13269 return (TREE_CODE (arg
) == TREE_CODE (parm
)
13270 && same_type_p (parm
, arg
)) ? 0 : 1;
13271 idx
= TEMPLATE_TYPE_IDX (parm
);
13272 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
13273 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, idx
));
13275 /* Check for mixed types and values. */
13276 if ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
13277 && TREE_CODE (tparm
) != TYPE_DECL
)
13278 || (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
13279 && TREE_CODE (tparm
) != TEMPLATE_DECL
))
13282 if (TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
13284 /* ARG must be constructed from a template class or a template
13285 template parameter. */
13286 if (TREE_CODE (arg
) != BOUND_TEMPLATE_TEMPLATE_PARM
13287 && !CLASSTYPE_SPECIALIZATION_OF_PRIMARY_TEMPLATE_P (arg
))
13291 tree parmvec
= TYPE_TI_ARGS (parm
);
13292 tree argvec
= INNERMOST_TEMPLATE_ARGS (TYPE_TI_ARGS (arg
));
13294 = DECL_INNERMOST_TEMPLATE_PARMS
13295 (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (parm
));
13297 int parm_variadic_p
= 0;
13299 /* The resolution to DR150 makes clear that default
13300 arguments for an N-argument may not be used to bind T
13301 to a template template parameter with fewer than N
13302 parameters. It is not safe to permit the binding of
13303 default arguments as an extension, as that may change
13304 the meaning of a conforming program. Consider:
13306 struct Dense { static const unsigned int dim = 1; };
13308 template <template <typename> class View,
13310 void operator+(float, View<Block> const&);
13312 template <typename Block,
13313 unsigned int Dim = Block::dim>
13314 struct Lvalue_proxy { operator float() const; };
13318 Lvalue_proxy<Dense> p;
13323 Here, if Lvalue_proxy is permitted to bind to View, then
13324 the global operator+ will be used; if they are not, the
13325 Lvalue_proxy will be converted to float. */
13326 if (coerce_template_parms (parm_parms
,
13328 TYPE_TI_TEMPLATE (parm
),
13330 /*require_all_args=*/true,
13331 /*use_default_args=*/false)
13332 == error_mark_node
)
13335 /* Deduce arguments T, i from TT<T> or TT<i>.
13336 We check each element of PARMVEC and ARGVEC individually
13337 rather than the whole TREE_VEC since they can have
13338 different number of elements. */
13340 parmvec
= expand_template_argument_pack (parmvec
);
13341 argvec
= expand_template_argument_pack (argvec
);
13343 len
= TREE_VEC_LENGTH (parmvec
);
13345 /* Check if the parameters end in a pack, making them
13348 && PACK_EXPANSION_P (TREE_VEC_ELT (parmvec
, len
- 1)))
13349 parm_variadic_p
= 1;
13351 if (TREE_VEC_LENGTH (argvec
) < len
- parm_variadic_p
)
13354 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
13356 if (unify (tparms
, targs
,
13357 TREE_VEC_ELT (parmvec
, i
),
13358 TREE_VEC_ELT (argvec
, i
),
13363 if (parm_variadic_p
13364 && unify_pack_expansion (tparms
, targs
,
13367 /*call_args_p=*/false,
13371 arg
= TYPE_TI_TEMPLATE (arg
);
13373 /* Fall through to deduce template name. */
13376 if (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
13377 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
13379 /* Deduce template name TT from TT, TT<>, TT<T> and TT<i>. */
13381 /* Simple cases: Value already set, does match or doesn't. */
13382 if (targ
!= NULL_TREE
&& template_args_equal (targ
, arg
))
13389 /* If PARM is `const T' and ARG is only `int', we don't have
13390 a match unless we are allowing additional qualification.
13391 If ARG is `const int' and PARM is just `T' that's OK;
13392 that binds `const int' to `T'. */
13393 if (!check_cv_quals_for_unify (strict_in
| UNIFY_ALLOW_LESS_CV_QUAL
,
13397 /* Consider the case where ARG is `const volatile int' and
13398 PARM is `const T'. Then, T should be `volatile int'. */
13399 arg
= cp_build_qualified_type_real
13400 (arg
, cp_type_quals (arg
) & ~cp_type_quals (parm
), tf_none
);
13401 if (arg
== error_mark_node
)
13404 /* Simple cases: Value already set, does match or doesn't. */
13405 if (targ
!= NULL_TREE
&& same_type_p (targ
, arg
))
13410 /* Make sure that ARG is not a variable-sized array. (Note
13411 that were talking about variable-sized arrays (like
13412 `int[n]'), rather than arrays of unknown size (like
13413 `int[]').) We'll get very confused by such a type since
13414 the bound of the array will not be computable in an
13415 instantiation. Besides, such types are not allowed in
13416 ISO C++, so we can do as we please here. */
13417 if (variably_modified_type_p (arg
, NULL_TREE
))
13421 /* If ARG is a parameter pack or an expansion, we cannot unify
13422 against it unless PARM is also a parameter pack. */
13423 if ((template_parameter_pack_p (arg
) || PACK_EXPANSION_P (arg
))
13424 && !template_parameter_pack_p (parm
))
13427 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = arg
;
13430 case TEMPLATE_PARM_INDEX
:
13431 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
13432 if (tparm
== error_mark_node
)
13435 if (TEMPLATE_PARM_LEVEL (parm
)
13436 != template_decl_level (tparm
))
13437 /* The PARM is not one we're trying to unify. Just check
13438 to see if it matches ARG. */
13439 return !(TREE_CODE (arg
) == TREE_CODE (parm
)
13440 && cp_tree_equal (parm
, arg
));
13442 idx
= TEMPLATE_PARM_IDX (parm
);
13443 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
13446 return !cp_tree_equal (targ
, arg
);
13448 /* [temp.deduct.type] If, in the declaration of a function template
13449 with a non-type template-parameter, the non-type
13450 template-parameter is used in an expression in the function
13451 parameter-list and, if the corresponding template-argument is
13452 deduced, the template-argument type shall match the type of the
13453 template-parameter exactly, except that a template-argument
13454 deduced from an array bound may be of any integral type.
13455 The non-type parameter might use already deduced type parameters. */
13456 tparm
= tsubst (TREE_TYPE (parm
), targs
, 0, NULL_TREE
);
13457 if (!TREE_TYPE (arg
))
13458 /* Template-parameter dependent expression. Just accept it for now.
13459 It will later be processed in convert_template_argument. */
13461 else if (same_type_p (TREE_TYPE (arg
), tparm
))
13463 else if ((strict
& UNIFY_ALLOW_INTEGER
)
13464 && (TREE_CODE (tparm
) == INTEGER_TYPE
13465 || TREE_CODE (tparm
) == BOOLEAN_TYPE
))
13466 /* Convert the ARG to the type of PARM; the deduced non-type
13467 template argument must exactly match the types of the
13468 corresponding parameter. */
13469 arg
= fold (build_nop (tparm
, arg
));
13470 else if (uses_template_parms (tparm
))
13471 /* We haven't deduced the type of this parameter yet. Try again
13477 /* If ARG is a parameter pack or an expansion, we cannot unify
13478 against it unless PARM is also a parameter pack. */
13479 if ((template_parameter_pack_p (arg
) || PACK_EXPANSION_P (arg
))
13480 && !TEMPLATE_PARM_PARAMETER_PACK (parm
))
13483 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = arg
;
13488 /* A pointer-to-member constant can be unified only with
13489 another constant. */
13490 if (TREE_CODE (arg
) != PTRMEM_CST
)
13493 /* Just unify the class member. It would be useless (and possibly
13494 wrong, depending on the strict flags) to unify also
13495 PTRMEM_CST_CLASS, because we want to be sure that both parm and
13496 arg refer to the same variable, even if through different
13497 classes. For instance:
13499 struct A { int x; };
13502 Unification of &A::x and &B::x must succeed. */
13503 return unify (tparms
, targs
, PTRMEM_CST_MEMBER (parm
),
13504 PTRMEM_CST_MEMBER (arg
), strict
);
13509 if (TREE_CODE (arg
) != POINTER_TYPE
)
13512 /* [temp.deduct.call]
13514 A can be another pointer or pointer to member type that can
13515 be converted to the deduced A via a qualification
13516 conversion (_conv.qual_).
13518 We pass down STRICT here rather than UNIFY_ALLOW_NONE.
13519 This will allow for additional cv-qualification of the
13520 pointed-to types if appropriate. */
13522 if (TREE_CODE (TREE_TYPE (arg
)) == RECORD_TYPE
)
13523 /* The derived-to-base conversion only persists through one
13524 level of pointers. */
13525 strict
|= (strict_in
& UNIFY_ALLOW_DERIVED
);
13527 return unify (tparms
, targs
, TREE_TYPE (parm
),
13528 TREE_TYPE (arg
), strict
);
13531 case REFERENCE_TYPE
:
13532 if (TREE_CODE (arg
) != REFERENCE_TYPE
)
13534 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
13535 strict
& UNIFY_ALLOW_MORE_CV_QUAL
);
13538 if (TREE_CODE (arg
) != ARRAY_TYPE
)
13540 if ((TYPE_DOMAIN (parm
) == NULL_TREE
)
13541 != (TYPE_DOMAIN (arg
) == NULL_TREE
))
13543 if (TYPE_DOMAIN (parm
) != NULL_TREE
)
13550 /* Our representation of array types uses "N - 1" as the
13551 TYPE_MAX_VALUE for an array with "N" elements, if "N" is
13552 not an integer constant. We cannot unify arbitrarily
13553 complex expressions, so we eliminate the MINUS_EXPRs
13555 parm_max
= TYPE_MAX_VALUE (TYPE_DOMAIN (parm
));
13556 parm_cst
= TREE_CODE (parm_max
) == INTEGER_CST
;
13559 gcc_assert (TREE_CODE (parm_max
) == MINUS_EXPR
);
13560 parm_max
= TREE_OPERAND (parm_max
, 0);
13562 arg_max
= TYPE_MAX_VALUE (TYPE_DOMAIN (arg
));
13563 arg_cst
= TREE_CODE (arg_max
) == INTEGER_CST
;
13566 /* The ARG_MAX may not be a simple MINUS_EXPR, if we are
13567 trying to unify the type of a variable with the type
13568 of a template parameter. For example:
13570 template <unsigned int N>
13571 void f (char (&) [N]);
13578 Here, the type of the ARG will be "int [g(i)]", and
13579 may be a SAVE_EXPR, etc. */
13580 if (TREE_CODE (arg_max
) != MINUS_EXPR
)
13582 arg_max
= TREE_OPERAND (arg_max
, 0);
13585 /* If only one of the bounds used a MINUS_EXPR, compensate
13586 by adding one to the other bound. */
13587 if (parm_cst
&& !arg_cst
)
13588 parm_max
= fold_build2 (PLUS_EXPR
,
13592 else if (arg_cst
&& !parm_cst
)
13593 arg_max
= fold_build2 (PLUS_EXPR
,
13598 if (unify (tparms
, targs
, parm_max
, arg_max
, UNIFY_ALLOW_INTEGER
))
13601 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
13602 strict
& UNIFY_ALLOW_MORE_CV_QUAL
);
13609 case ENUMERAL_TYPE
:
13611 if (TREE_CODE (arg
) != TREE_CODE (parm
))
13614 /* We have already checked cv-qualification at the top of the
13616 if (!same_type_ignoring_top_level_qualifiers_p (arg
, parm
))
13619 /* As far as unification is concerned, this wins. Later checks
13620 will invalidate it if necessary. */
13623 /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */
13624 /* Type INTEGER_CST can come from ordinary constant template args. */
13626 while (TREE_CODE (arg
) == NOP_EXPR
)
13627 arg
= TREE_OPERAND (arg
, 0);
13629 if (TREE_CODE (arg
) != INTEGER_CST
)
13631 return !tree_int_cst_equal (parm
, arg
);
13636 if (TREE_CODE (arg
) != TREE_VEC
)
13638 if (TREE_VEC_LENGTH (parm
) != TREE_VEC_LENGTH (arg
))
13640 for (i
= 0; i
< TREE_VEC_LENGTH (parm
); ++i
)
13641 if (unify (tparms
, targs
,
13642 TREE_VEC_ELT (parm
, i
), TREE_VEC_ELT (arg
, i
),
13650 if (TREE_CODE (arg
) != TREE_CODE (parm
))
13653 if (TYPE_PTRMEMFUNC_P (parm
))
13655 if (!TYPE_PTRMEMFUNC_P (arg
))
13658 return unify (tparms
, targs
,
13659 TYPE_PTRMEMFUNC_FN_TYPE (parm
),
13660 TYPE_PTRMEMFUNC_FN_TYPE (arg
),
13664 if (CLASSTYPE_TEMPLATE_INFO (parm
))
13666 tree t
= NULL_TREE
;
13668 if (strict_in
& UNIFY_ALLOW_DERIVED
)
13670 /* First, we try to unify the PARM and ARG directly. */
13671 t
= try_class_unification (tparms
, targs
,
13676 /* Fallback to the special case allowed in
13677 [temp.deduct.call]:
13679 If P is a class, and P has the form
13680 template-id, then A can be a derived class of
13681 the deduced A. Likewise, if P is a pointer to
13682 a class of the form template-id, A can be a
13683 pointer to a derived class pointed to by the
13685 t
= get_template_base (tparms
, targs
, parm
, arg
);
13691 else if (CLASSTYPE_TEMPLATE_INFO (arg
)
13692 && (CLASSTYPE_TI_TEMPLATE (parm
)
13693 == CLASSTYPE_TI_TEMPLATE (arg
)))
13694 /* Perhaps PARM is something like S<U> and ARG is S<int>.
13695 Then, we should unify `int' and `U'. */
13698 /* There's no chance of unification succeeding. */
13701 return unify (tparms
, targs
, CLASSTYPE_TI_ARGS (parm
),
13702 CLASSTYPE_TI_ARGS (t
), UNIFY_ALLOW_NONE
);
13704 else if (!same_type_ignoring_top_level_qualifiers_p (parm
, arg
))
13709 case FUNCTION_TYPE
:
13710 if (TREE_CODE (arg
) != TREE_CODE (parm
))
13713 /* CV qualifications for methods can never be deduced, they must
13714 match exactly. We need to check them explicitly here,
13715 because type_unification_real treats them as any other
13716 cv-qualified parameter. */
13717 if (TREE_CODE (parm
) == METHOD_TYPE
13718 && (!check_cv_quals_for_unify
13720 TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (arg
))),
13721 TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (parm
))))))
13724 if (unify (tparms
, targs
, TREE_TYPE (parm
),
13725 TREE_TYPE (arg
), UNIFY_ALLOW_NONE
))
13727 return type_unification_real (tparms
, targs
, TYPE_ARG_TYPES (parm
),
13728 TYPE_ARG_TYPES (arg
), 1, DEDUCE_EXACT
,
13732 /* Unify a pointer to member with a pointer to member function, which
13733 deduces the type of the member as a function type. */
13734 if (TYPE_PTRMEMFUNC_P (arg
))
13738 cp_cv_quals cv_quals
;
13740 /* Check top-level cv qualifiers */
13741 if (!check_cv_quals_for_unify (UNIFY_ALLOW_NONE
, arg
, parm
))
13744 if (unify (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
13745 TYPE_PTRMEMFUNC_OBJECT_TYPE (arg
), UNIFY_ALLOW_NONE
))
13748 /* Determine the type of the function we are unifying against. */
13749 method_type
= TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (arg
));
13751 build_function_type (TREE_TYPE (method_type
),
13752 TREE_CHAIN (TYPE_ARG_TYPES (method_type
)));
13754 /* Extract the cv-qualifiers of the member function from the
13755 implicit object parameter and place them on the function
13756 type to be restored later. */
13758 cp_type_quals(TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (method_type
))));
13759 fntype
= build_qualified_type (fntype
, cv_quals
);
13760 return unify (tparms
, targs
, TREE_TYPE (parm
), fntype
, strict
);
13763 if (TREE_CODE (arg
) != OFFSET_TYPE
)
13765 if (unify (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
13766 TYPE_OFFSET_BASETYPE (arg
), UNIFY_ALLOW_NONE
))
13768 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
13772 if (DECL_TEMPLATE_PARM_P (parm
))
13773 return unify (tparms
, targs
, DECL_INITIAL (parm
), arg
, strict
);
13774 if (arg
!= integral_constant_value (parm
))
13779 case TEMPLATE_DECL
:
13780 /* Matched cases are handled by the ARG == PARM test above. */
13783 case TYPE_ARGUMENT_PACK
:
13784 case NONTYPE_ARGUMENT_PACK
:
13786 tree packed_parms
= ARGUMENT_PACK_ARGS (parm
);
13787 tree packed_args
= ARGUMENT_PACK_ARGS (arg
);
13788 int i
, len
= TREE_VEC_LENGTH (packed_parms
);
13789 int argslen
= TREE_VEC_LENGTH (packed_args
);
13790 int parm_variadic_p
= 0;
13792 for (i
= 0; i
< len
; ++i
)
13794 if (PACK_EXPANSION_P (TREE_VEC_ELT (packed_parms
, i
)))
13797 /* We can unify against something with a trailing
13799 parm_variadic_p
= 1;
13801 /* Since there is something following the pack
13802 expansion, we cannot unify this template argument
13809 /* If we don't have enough arguments to satisfy the parameters
13810 (not counting the pack expression at the end), or we have
13811 too many arguments for a parameter list that doesn't end in
13812 a pack expression, we can't unify. */
13813 if (argslen
< (len
- parm_variadic_p
)
13814 || (argslen
> len
&& !parm_variadic_p
))
13817 /* Unify all of the parameters that precede the (optional)
13818 pack expression. */
13819 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
13821 if (unify (tparms
, targs
, TREE_VEC_ELT (packed_parms
, i
),
13822 TREE_VEC_ELT (packed_args
, i
), strict
))
13826 if (parm_variadic_p
)
13827 return unify_pack_expansion (tparms
, targs
,
13828 packed_parms
, packed_args
,
13829 strict
, /*call_args_p=*/false,
13837 case DECLTYPE_TYPE
:
13838 /* Cannot deduce anything from TYPEOF_TYPE or DECLTYPE_TYPE
13843 /* Unification fails if we hit an error node. */
13847 gcc_assert (EXPR_P (parm
));
13849 /* We must be looking at an expression. This can happen with
13853 void foo(S<I>, S<I + 2>);
13855 This is a "nondeduced context":
13859 The nondeduced contexts are:
13861 --A type that is a template-id in which one or more of
13862 the template-arguments is an expression that references
13863 a template-parameter.
13865 In these cases, we assume deduction succeeded, but don't
13866 actually infer any unifications. */
13868 if (!uses_template_parms (parm
)
13869 && !template_args_equal (parm
, arg
))
13876 /* Note that DECL can be defined in this translation unit, if
13880 mark_definable (tree decl
)
13883 DECL_NOT_REALLY_EXTERN (decl
) = 1;
13884 FOR_EACH_CLONE (clone
, decl
)
13885 DECL_NOT_REALLY_EXTERN (clone
) = 1;
13888 /* Called if RESULT is explicitly instantiated, or is a member of an
13889 explicitly instantiated class. */
13892 mark_decl_instantiated (tree result
, int extern_p
)
13894 SET_DECL_EXPLICIT_INSTANTIATION (result
);
13896 /* If this entity has already been written out, it's too late to
13897 make any modifications. */
13898 if (TREE_ASM_WRITTEN (result
))
13901 if (TREE_CODE (result
) != FUNCTION_DECL
)
13902 /* The TREE_PUBLIC flag for function declarations will have been
13903 set correctly by tsubst. */
13904 TREE_PUBLIC (result
) = 1;
13906 /* This might have been set by an earlier implicit instantiation. */
13907 DECL_COMDAT (result
) = 0;
13910 DECL_NOT_REALLY_EXTERN (result
) = 0;
13913 mark_definable (result
);
13914 /* Always make artificials weak. */
13915 if (DECL_ARTIFICIAL (result
) && flag_weak
)
13916 comdat_linkage (result
);
13917 /* For WIN32 we also want to put explicit instantiations in
13918 linkonce sections. */
13919 else if (TREE_PUBLIC (result
))
13920 maybe_make_one_only (result
);
13923 /* If EXTERN_P, then this function will not be emitted -- unless
13924 followed by an explicit instantiation, at which point its linkage
13925 will be adjusted. If !EXTERN_P, then this function will be
13926 emitted here. In neither circumstance do we want
13927 import_export_decl to adjust the linkage. */
13928 DECL_INTERFACE_KNOWN (result
) = 1;
13931 /* Given two function templates PAT1 and PAT2, return:
13933 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order].
13934 -1 if PAT2 is more specialized than PAT1.
13935 0 if neither is more specialized.
13937 LEN indicates the number of parameters we should consider
13938 (defaulted parameters should not be considered).
13940 The 1998 std underspecified function template partial ordering, and
13941 DR214 addresses the issue. We take pairs of arguments, one from
13942 each of the templates, and deduce them against each other. One of
13943 the templates will be more specialized if all the *other*
13944 template's arguments deduce against its arguments and at least one
13945 of its arguments *does* *not* deduce against the other template's
13946 corresponding argument. Deduction is done as for class templates.
13947 The arguments used in deduction have reference and top level cv
13948 qualifiers removed. Iff both arguments were originally reference
13949 types *and* deduction succeeds in both directions, the template
13950 with the more cv-qualified argument wins for that pairing (if
13951 neither is more cv-qualified, they both are equal). Unlike regular
13952 deduction, after all the arguments have been deduced in this way,
13953 we do *not* verify the deduced template argument values can be
13954 substituted into non-deduced contexts, nor do we have to verify
13955 that all template arguments have been deduced. */
13958 more_specialized_fn (tree pat1
, tree pat2
, int len
)
13960 tree decl1
= DECL_TEMPLATE_RESULT (pat1
);
13961 tree decl2
= DECL_TEMPLATE_RESULT (pat2
);
13962 tree targs1
= make_tree_vec (DECL_NTPARMS (pat1
));
13963 tree targs2
= make_tree_vec (DECL_NTPARMS (pat2
));
13964 tree tparms1
= DECL_INNERMOST_TEMPLATE_PARMS (pat1
);
13965 tree tparms2
= DECL_INNERMOST_TEMPLATE_PARMS (pat2
);
13966 tree args1
= TYPE_ARG_TYPES (TREE_TYPE (decl1
));
13967 tree args2
= TYPE_ARG_TYPES (TREE_TYPE (decl2
));
13971 /* Remove the this parameter from non-static member functions. If
13972 one is a non-static member function and the other is not a static
13973 member function, remove the first parameter from that function
13974 also. This situation occurs for operator functions where we
13975 locate both a member function (with this pointer) and non-member
13976 operator (with explicit first operand). */
13977 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl1
))
13979 len
--; /* LEN is the number of significant arguments for DECL1 */
13980 args1
= TREE_CHAIN (args1
);
13981 if (!DECL_STATIC_FUNCTION_P (decl2
))
13982 args2
= TREE_CHAIN (args2
);
13984 else if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl2
))
13986 args2
= TREE_CHAIN (args2
);
13987 if (!DECL_STATIC_FUNCTION_P (decl1
))
13990 args1
= TREE_CHAIN (args1
);
13994 /* If only one is a conversion operator, they are unordered. */
13995 if (DECL_CONV_FN_P (decl1
) != DECL_CONV_FN_P (decl2
))
13998 /* Consider the return type for a conversion function */
13999 if (DECL_CONV_FN_P (decl1
))
14001 args1
= tree_cons (NULL_TREE
, TREE_TYPE (TREE_TYPE (decl1
)), args1
);
14002 args2
= tree_cons (NULL_TREE
, TREE_TYPE (TREE_TYPE (decl2
)), args2
);
14006 processing_template_decl
++;
14009 /* Stop when an ellipsis is seen. */
14010 && args1
!= NULL_TREE
&& args2
!= NULL_TREE
)
14012 tree arg1
= TREE_VALUE (args1
);
14013 tree arg2
= TREE_VALUE (args2
);
14014 int deduce1
, deduce2
;
14018 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
14019 && TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
14021 /* When both arguments are pack expansions, we need only
14022 unify the patterns themselves. */
14023 arg1
= PACK_EXPANSION_PATTERN (arg1
);
14024 arg2
= PACK_EXPANSION_PATTERN (arg2
);
14026 /* This is the last comparison we need to do. */
14030 if (TREE_CODE (arg1
) == REFERENCE_TYPE
)
14032 arg1
= TREE_TYPE (arg1
);
14033 quals1
= cp_type_quals (arg1
);
14036 if (TREE_CODE (arg2
) == REFERENCE_TYPE
)
14038 arg2
= TREE_TYPE (arg2
);
14039 quals2
= cp_type_quals (arg2
);
14042 if ((quals1
< 0) != (quals2
< 0))
14044 /* Only of the args is a reference, see if we should apply
14045 array/function pointer decay to it. This is not part of
14046 DR214, but is, IMHO, consistent with the deduction rules
14047 for the function call itself, and with our earlier
14048 implementation of the underspecified partial ordering
14049 rules. (nathan). */
14052 switch (TREE_CODE (arg1
))
14055 arg1
= TREE_TYPE (arg1
);
14057 case FUNCTION_TYPE
:
14058 arg1
= build_pointer_type (arg1
);
14067 switch (TREE_CODE (arg2
))
14070 arg2
= TREE_TYPE (arg2
);
14072 case FUNCTION_TYPE
:
14073 arg2
= build_pointer_type (arg2
);
14082 arg1
= TYPE_MAIN_VARIANT (arg1
);
14083 arg2
= TYPE_MAIN_VARIANT (arg2
);
14085 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
)
14087 int i
, len2
= list_length (args2
);
14088 tree parmvec
= make_tree_vec (1);
14089 tree argvec
= make_tree_vec (len2
);
14092 /* Setup the parameter vector, which contains only ARG1. */
14093 TREE_VEC_ELT (parmvec
, 0) = arg1
;
14095 /* Setup the argument vector, which contains the remaining
14097 for (i
= 0; i
< len2
; i
++, ta
= TREE_CHAIN (ta
))
14098 TREE_VEC_ELT (argvec
, i
) = TREE_VALUE (ta
);
14100 deduce1
= !unify_pack_expansion (tparms1
, targs1
, parmvec
,
14101 argvec
, UNIFY_ALLOW_NONE
,
14102 /*call_args_p=*/false,
14105 /* We cannot deduce in the other direction, because ARG1 is
14106 a pack expansion but ARG2 is not. */
14109 else if (TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
14111 int i
, len1
= list_length (args1
);
14112 tree parmvec
= make_tree_vec (1);
14113 tree argvec
= make_tree_vec (len1
);
14116 /* Setup the parameter vector, which contains only ARG1. */
14117 TREE_VEC_ELT (parmvec
, 0) = arg2
;
14119 /* Setup the argument vector, which contains the remaining
14121 for (i
= 0; i
< len1
; i
++, ta
= TREE_CHAIN (ta
))
14122 TREE_VEC_ELT (argvec
, i
) = TREE_VALUE (ta
);
14124 deduce2
= !unify_pack_expansion (tparms2
, targs2
, parmvec
,
14125 argvec
, UNIFY_ALLOW_NONE
,
14126 /*call_args_p=*/false,
14129 /* We cannot deduce in the other direction, because ARG2 is
14130 a pack expansion but ARG1 is not.*/
14136 /* The normal case, where neither argument is a pack
14138 deduce1
= !unify (tparms1
, targs1
, arg1
, arg2
, UNIFY_ALLOW_NONE
);
14139 deduce2
= !unify (tparms2
, targs2
, arg2
, arg1
, UNIFY_ALLOW_NONE
);
14146 if (better1
< 0 && better2
< 0)
14147 /* We've failed to deduce something in either direction.
14148 These must be unordered. */
14151 if (deduce1
&& deduce2
&& quals1
>= 0 && quals2
>= 0)
14153 /* Deduces in both directions, see if quals can
14154 disambiguate. Pretend the worse one failed to deduce. */
14155 if ((quals1
& quals2
) == quals2
)
14157 if ((quals1
& quals2
) == quals1
)
14160 if (deduce1
&& !deduce2
&& !better2
)
14162 if (deduce2
&& !deduce1
&& !better1
)
14165 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
14166 || TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
14167 /* We have already processed all of the arguments in our
14168 handing of the pack expansion type. */
14171 args1
= TREE_CHAIN (args1
);
14172 args2
= TREE_CHAIN (args2
);
14175 processing_template_decl
--;
14177 /* All things being equal, if the next argument is a pack expansion
14178 for one function but not for the other, prefer the
14179 non-variadic function. */
14180 if ((better1
> 0) - (better2
> 0) == 0
14181 && args1
&& TREE_VALUE (args1
)
14182 && args2
&& TREE_VALUE (args2
))
14184 if (TREE_CODE (TREE_VALUE (args1
)) == TYPE_PACK_EXPANSION
)
14185 return TREE_CODE (TREE_VALUE (args2
)) == TYPE_PACK_EXPANSION
? 0 : -1;
14186 else if (TREE_CODE (TREE_VALUE (args2
)) == TYPE_PACK_EXPANSION
)
14190 return (better1
> 0) - (better2
> 0);
14193 /* Determine which of two partial specializations is more specialized.
14195 PAT1 is a TREE_LIST whose TREE_TYPE is the _TYPE node corresponding
14196 to the first partial specialization. The TREE_VALUE is the
14197 innermost set of template parameters for the partial
14198 specialization. PAT2 is similar, but for the second template.
14200 Return 1 if the first partial specialization is more specialized;
14201 -1 if the second is more specialized; 0 if neither is more
14204 See [temp.class.order] for information about determining which of
14205 two templates is more specialized. */
14208 more_specialized_class (tree pat1
, tree pat2
)
14213 bool any_deductions
= false;
14215 tmpl1
= TREE_TYPE (pat1
);
14216 tmpl2
= TREE_TYPE (pat2
);
14218 /* Just like what happens for functions, if we are ordering between
14219 different class template specializations, we may encounter dependent
14220 types in the arguments, and we need our dependency check functions
14221 to behave correctly. */
14222 ++processing_template_decl
;
14223 targs
= get_class_bindings (TREE_VALUE (pat1
),
14224 CLASSTYPE_TI_ARGS (tmpl1
),
14225 CLASSTYPE_TI_ARGS (tmpl2
));
14229 any_deductions
= true;
14232 targs
= get_class_bindings (TREE_VALUE (pat2
),
14233 CLASSTYPE_TI_ARGS (tmpl2
),
14234 CLASSTYPE_TI_ARGS (tmpl1
));
14238 any_deductions
= true;
14240 --processing_template_decl
;
14242 /* In the case of a tie where at least one of the class templates
14243 has a parameter pack at the end, the template with the most
14244 non-packed parameters wins. */
14247 && (template_args_variadic_p (TREE_PURPOSE (pat1
))
14248 || template_args_variadic_p (TREE_PURPOSE (pat2
))))
14250 tree args1
= INNERMOST_TEMPLATE_ARGS (TREE_PURPOSE (pat1
));
14251 tree args2
= INNERMOST_TEMPLATE_ARGS (TREE_PURPOSE (pat2
));
14252 int len1
= TREE_VEC_LENGTH (args1
);
14253 int len2
= TREE_VEC_LENGTH (args2
);
14255 /* We don't count the pack expansion at the end. */
14256 if (template_args_variadic_p (TREE_PURPOSE (pat1
)))
14258 if (template_args_variadic_p (TREE_PURPOSE (pat2
)))
14263 else if (len1
< len2
)
14270 /* Return the template arguments that will produce the function signature
14271 DECL from the function template FN, with the explicit template
14272 arguments EXPLICIT_ARGS. If CHECK_RETTYPE is true, the return type must
14273 also match. Return NULL_TREE if no satisfactory arguments could be
14277 get_bindings (tree fn
, tree decl
, tree explicit_args
, bool check_rettype
)
14279 int ntparms
= DECL_NTPARMS (fn
);
14280 tree targs
= make_tree_vec (ntparms
);
14282 tree decl_arg_types
;
14284 /* Substitute the explicit template arguments into the type of DECL.
14285 The call to fn_type_unification will handle substitution into the
14287 decl_type
= TREE_TYPE (decl
);
14288 if (explicit_args
&& uses_template_parms (decl_type
))
14291 tree converted_args
;
14293 if (DECL_TEMPLATE_INFO (decl
))
14294 tmpl
= DECL_TI_TEMPLATE (decl
);
14296 /* We can get here for some invalid specializations. */
14300 = coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
14301 explicit_args
, NULL_TREE
,
14303 /*require_all_args=*/false,
14304 /*use_default_args=*/false);
14305 if (converted_args
== error_mark_node
)
14308 decl_type
= tsubst (decl_type
, converted_args
, tf_none
, NULL_TREE
);
14309 if (decl_type
== error_mark_node
)
14313 /* Never do unification on the 'this' parameter. */
14314 decl_arg_types
= skip_artificial_parms_for (decl
,
14315 TYPE_ARG_TYPES (decl_type
));
14317 if (fn_type_unification (fn
, explicit_args
, targs
,
14319 (check_rettype
|| DECL_CONV_FN_P (fn
)
14320 ? TREE_TYPE (decl_type
) : NULL_TREE
),
14321 DEDUCE_EXACT
, LOOKUP_NORMAL
))
14327 /* Return the innermost template arguments that, when applied to a
14328 template specialization whose innermost template parameters are
14329 TPARMS, and whose specialization arguments are PARMS, yield the
14332 For example, suppose we have:
14334 template <class T, class U> struct S {};
14335 template <class T> struct S<T*, int> {};
14337 Then, suppose we want to get `S<double*, int>'. The TPARMS will be
14338 {T}, the SPEC_ARGS will be {T*, int} and the ARGS will be {double*,
14339 int}. The resulting vector will be {double}, indicating that `T'
14340 is bound to `double'. */
14343 get_class_bindings (tree tparms
, tree spec_args
, tree args
)
14345 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
14347 tree innermost_deduced_args
;
14349 innermost_deduced_args
= make_tree_vec (ntparms
);
14350 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
14352 deduced_args
= copy_node (args
);
14353 SET_TMPL_ARGS_LEVEL (deduced_args
,
14354 TMPL_ARGS_DEPTH (deduced_args
),
14355 innermost_deduced_args
);
14358 deduced_args
= innermost_deduced_args
;
14360 if (unify (tparms
, deduced_args
,
14361 INNERMOST_TEMPLATE_ARGS (spec_args
),
14362 INNERMOST_TEMPLATE_ARGS (args
),
14366 for (i
= 0; i
< ntparms
; ++i
)
14367 if (! TREE_VEC_ELT (innermost_deduced_args
, i
))
14370 /* Verify that nondeduced template arguments agree with the type
14371 obtained from argument deduction.
14375 struct A { typedef int X; };
14376 template <class T, class U> struct C {};
14377 template <class T> struct C<T, typename T::X> {};
14379 Then with the instantiation `C<A, int>', we can deduce that
14380 `T' is `A' but unify () does not check whether `typename T::X'
14382 spec_args
= tsubst (spec_args
, deduced_args
, tf_none
, NULL_TREE
);
14383 if (spec_args
== error_mark_node
14384 /* We only need to check the innermost arguments; the other
14385 arguments will always agree. */
14386 || !comp_template_args (INNERMOST_TEMPLATE_ARGS (spec_args
),
14387 INNERMOST_TEMPLATE_ARGS (args
)))
14390 /* Now that we have bindings for all of the template arguments,
14391 ensure that the arguments deduced for the template template
14392 parameters have compatible template parameter lists. See the use
14393 of template_template_parm_bindings_ok_p in fn_type_unification
14394 for more information. */
14395 if (!template_template_parm_bindings_ok_p (tparms
, deduced_args
))
14398 return deduced_args
;
14401 /* TEMPLATES is a TREE_LIST. Each TREE_VALUE is a TEMPLATE_DECL.
14402 Return the TREE_LIST node with the most specialized template, if
14403 any. If there is no most specialized template, the error_mark_node
14406 Note that this function does not look at, or modify, the
14407 TREE_PURPOSE or TREE_TYPE of any of the nodes. Since the node
14408 returned is one of the elements of INSTANTIATIONS, callers may
14409 store information in the TREE_PURPOSE or TREE_TYPE of the nodes,
14410 and retrieve it from the value returned. */
14413 most_specialized_instantiation (tree templates
)
14417 ++processing_template_decl
;
14420 for (fn
= TREE_CHAIN (templates
); fn
; fn
= TREE_CHAIN (fn
))
14424 if (get_bindings (TREE_VALUE (champ
),
14425 DECL_TEMPLATE_RESULT (TREE_VALUE (fn
)),
14426 NULL_TREE
, /*check_ret=*/false))
14429 if (get_bindings (TREE_VALUE (fn
),
14430 DECL_TEMPLATE_RESULT (TREE_VALUE (champ
)),
14431 NULL_TREE
, /*check_ret=*/false))
14438 /* Equally specialized, move to next function. If there
14439 is no next function, nothing's most specialized. */
14440 fn
= TREE_CHAIN (fn
);
14448 /* Now verify that champ is better than everything earlier in the
14449 instantiation list. */
14450 for (fn
= templates
; fn
!= champ
; fn
= TREE_CHAIN (fn
))
14451 if (get_bindings (TREE_VALUE (champ
),
14452 DECL_TEMPLATE_RESULT (TREE_VALUE (fn
)),
14453 NULL_TREE
, /*check_ret=*/false)
14454 || !get_bindings (TREE_VALUE (fn
),
14455 DECL_TEMPLATE_RESULT (TREE_VALUE (champ
)),
14456 NULL_TREE
, /*check_ret=*/false))
14462 processing_template_decl
--;
14465 return error_mark_node
;
14470 /* If DECL is a specialization of some template, return the most
14471 general such template. Otherwise, returns NULL_TREE.
14473 For example, given:
14475 template <class T> struct S { template <class U> void f(U); };
14477 if TMPL is `template <class U> void S<int>::f(U)' this will return
14478 the full template. This function will not trace past partial
14479 specializations, however. For example, given in addition:
14481 template <class T> struct S<T*> { template <class U> void f(U); };
14483 if TMPL is `template <class U> void S<int*>::f(U)' this will return
14484 `template <class T> template <class U> S<T*>::f(U)'. */
14487 most_general_template (tree decl
)
14489 /* If DECL is a FUNCTION_DECL, find the TEMPLATE_DECL of which it is
14490 an immediate specialization. */
14491 if (TREE_CODE (decl
) == FUNCTION_DECL
)
14493 if (DECL_TEMPLATE_INFO (decl
)) {
14494 decl
= DECL_TI_TEMPLATE (decl
);
14496 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE for a
14497 template friend. */
14498 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
14504 /* Look for more and more general templates. */
14505 while (DECL_TEMPLATE_INFO (decl
))
14507 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE in some cases.
14508 (See cp-tree.h for details.) */
14509 if (TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
14512 if (CLASS_TYPE_P (TREE_TYPE (decl
))
14513 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)))
14516 /* Stop if we run into an explicitly specialized class template. */
14517 if (!DECL_NAMESPACE_SCOPE_P (decl
)
14518 && DECL_CONTEXT (decl
)
14519 && CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (decl
)))
14522 decl
= DECL_TI_TEMPLATE (decl
);
14528 /* Return the most specialized of the class template partial
14529 specializations of TMPL which can produce TYPE, a specialization of
14530 TMPL. The value returned is actually a TREE_LIST; the TREE_TYPE is
14531 a _TYPE node corresponding to the partial specialization, while the
14532 TREE_PURPOSE is the set of template arguments that must be
14533 substituted into the TREE_TYPE in order to generate TYPE.
14535 If the choice of partial specialization is ambiguous, a diagnostic
14536 is issued, and the error_mark_node is returned. If there are no
14537 partial specializations of TMPL matching TYPE, then NULL_TREE is
14541 most_specialized_class (tree type
, tree tmpl
)
14543 tree list
= NULL_TREE
;
14549 tree outer_args
= NULL_TREE
;
14551 tmpl
= most_general_template (tmpl
);
14552 args
= CLASSTYPE_TI_ARGS (type
);
14554 /* For determining which partial specialization to use, only the
14555 innermost args are interesting. */
14556 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
14558 outer_args
= strip_innermost_template_args (args
, 1);
14559 args
= INNERMOST_TEMPLATE_ARGS (args
);
14562 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
); t
; t
= TREE_CHAIN (t
))
14564 tree partial_spec_args
;
14566 tree parms
= TREE_VALUE (t
);
14568 partial_spec_args
= CLASSTYPE_TI_ARGS (TREE_TYPE (t
));
14573 ++processing_template_decl
;
14575 /* Discard the outer levels of args, and then substitute in the
14576 template args from the enclosing class. */
14577 partial_spec_args
= INNERMOST_TEMPLATE_ARGS (partial_spec_args
);
14578 partial_spec_args
= tsubst_template_args
14579 (partial_spec_args
, outer_args
, tf_none
, NULL_TREE
);
14581 /* PARMS already refers to just the innermost parms, but the
14582 template parms in partial_spec_args had their levels lowered
14583 by tsubst, so we need to do the same for the parm list. We
14584 can't just tsubst the TREE_VEC itself, as tsubst wants to
14585 treat a TREE_VEC as an argument vector. */
14586 parms
= copy_node (parms
);
14587 for (i
= TREE_VEC_LENGTH (parms
) - 1; i
>= 0; --i
)
14588 TREE_VEC_ELT (parms
, i
) =
14589 tsubst (TREE_VEC_ELT (parms
, i
), outer_args
, tf_none
, NULL_TREE
);
14591 --processing_template_decl
;
14593 spec_args
= get_class_bindings (parms
,
14599 spec_args
= add_to_template_args (outer_args
, spec_args
);
14600 list
= tree_cons (spec_args
, TREE_VALUE (t
), list
);
14601 TREE_TYPE (list
) = TREE_TYPE (t
);
14608 ambiguous_p
= false;
14611 t
= TREE_CHAIN (t
);
14612 for (; t
; t
= TREE_CHAIN (t
))
14614 fate
= more_specialized_class (champ
, t
);
14621 t
= TREE_CHAIN (t
);
14624 ambiguous_p
= true;
14633 for (t
= list
; t
&& t
!= champ
; t
= TREE_CHAIN (t
))
14635 fate
= more_specialized_class (champ
, t
);
14638 ambiguous_p
= true;
14645 const char *str
= "candidates are:";
14646 error ("ambiguous class template instantiation for %q#T", type
);
14647 for (t
= list
; t
; t
= TREE_CHAIN (t
))
14649 error ("%s %+#T", str
, TREE_TYPE (t
));
14652 return error_mark_node
;
14658 /* Explicitly instantiate DECL. */
14661 do_decl_instantiation (tree decl
, tree storage
)
14663 tree result
= NULL_TREE
;
14666 if (!decl
|| decl
== error_mark_node
)
14667 /* An error occurred, for which grokdeclarator has already issued
14668 an appropriate message. */
14670 else if (! DECL_LANG_SPECIFIC (decl
))
14672 error ("explicit instantiation of non-template %q#D", decl
);
14675 else if (TREE_CODE (decl
) == VAR_DECL
)
14677 /* There is an asymmetry here in the way VAR_DECLs and
14678 FUNCTION_DECLs are handled by grokdeclarator. In the case of
14679 the latter, the DECL we get back will be marked as a
14680 template instantiation, and the appropriate
14681 DECL_TEMPLATE_INFO will be set up. This does not happen for
14682 VAR_DECLs so we do the lookup here. Probably, grokdeclarator
14683 should handle VAR_DECLs as it currently handles
14685 if (!DECL_CLASS_SCOPE_P (decl
))
14687 error ("%qD is not a static data member of a class template", decl
);
14690 result
= lookup_field (DECL_CONTEXT (decl
), DECL_NAME (decl
), 0, false);
14691 if (!result
|| TREE_CODE (result
) != VAR_DECL
)
14693 error ("no matching template for %qD found", decl
);
14696 if (!same_type_p (TREE_TYPE (result
), TREE_TYPE (decl
)))
14698 error ("type %qT for explicit instantiation %qD does not match "
14699 "declared type %qT", TREE_TYPE (result
), decl
,
14704 else if (TREE_CODE (decl
) != FUNCTION_DECL
)
14706 error ("explicit instantiation of %q#D", decl
);
14712 /* Check for various error cases. Note that if the explicit
14713 instantiation is valid the RESULT will currently be marked as an
14714 *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set
14715 until we get here. */
14717 if (DECL_TEMPLATE_SPECIALIZATION (result
))
14719 /* DR 259 [temp.spec].
14721 Both an explicit instantiation and a declaration of an explicit
14722 specialization shall not appear in a program unless the explicit
14723 instantiation follows a declaration of the explicit specialization.
14725 For a given set of template parameters, if an explicit
14726 instantiation of a template appears after a declaration of an
14727 explicit specialization for that template, the explicit
14728 instantiation has no effect. */
14731 else if (DECL_EXPLICIT_INSTANTIATION (result
))
14735 No program shall explicitly instantiate any template more
14738 We check DECL_NOT_REALLY_EXTERN so as not to complain when
14739 the first instantiation was `extern' and the second is not,
14740 and EXTERN_P for the opposite case. */
14741 if (DECL_NOT_REALLY_EXTERN (result
) && !extern_p
)
14742 permerror (input_location
, "duplicate explicit instantiation of %q#D", result
);
14743 /* If an "extern" explicit instantiation follows an ordinary
14744 explicit instantiation, the template is instantiated. */
14748 else if (!DECL_IMPLICIT_INSTANTIATION (result
))
14750 error ("no matching template for %qD found", result
);
14753 else if (!DECL_TEMPLATE_INFO (result
))
14755 permerror (input_location
, "explicit instantiation of non-template %q#D", result
);
14759 if (storage
== NULL_TREE
)
14761 else if (storage
== ridpointers
[(int) RID_EXTERN
])
14763 if (!in_system_header
&& (cxx_dialect
== cxx98
))
14764 pedwarn (input_location
, OPT_pedantic
,
14765 "ISO C++ 1998 forbids the use of %<extern%> on explicit "
14770 error ("storage class %qD applied to template instantiation", storage
);
14772 check_explicit_instantiation_namespace (result
);
14773 mark_decl_instantiated (result
, extern_p
);
14775 instantiate_decl (result
, /*defer_ok=*/1,
14776 /*expl_inst_class_mem_p=*/false);
14780 mark_class_instantiated (tree t
, int extern_p
)
14782 SET_CLASSTYPE_EXPLICIT_INSTANTIATION (t
);
14783 SET_CLASSTYPE_INTERFACE_KNOWN (t
);
14784 CLASSTYPE_INTERFACE_ONLY (t
) = extern_p
;
14785 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (t
)) = extern_p
;
14788 CLASSTYPE_DEBUG_REQUESTED (t
) = 1;
14789 rest_of_type_compilation (t
, 1);
14793 /* Called from do_type_instantiation through binding_table_foreach to
14794 do recursive instantiation for the type bound in ENTRY. */
14796 bt_instantiate_type_proc (binding_entry entry
, void *data
)
14798 tree storage
= *(tree
*) data
;
14800 if (MAYBE_CLASS_TYPE_P (entry
->type
)
14801 && !uses_template_parms (CLASSTYPE_TI_ARGS (entry
->type
)))
14802 do_type_instantiation (TYPE_MAIN_DECL (entry
->type
), storage
, 0);
14805 /* Called from do_type_instantiation to instantiate a member
14806 (a member function or a static member variable) of an
14807 explicitly instantiated class template. */
14809 instantiate_class_member (tree decl
, int extern_p
)
14811 mark_decl_instantiated (decl
, extern_p
);
14813 instantiate_decl (decl
, /*defer_ok=*/1,
14814 /*expl_inst_class_mem_p=*/true);
14817 /* Perform an explicit instantiation of template class T. STORAGE, if
14818 non-null, is the RID for extern, inline or static. COMPLAIN is
14819 nonzero if this is called from the parser, zero if called recursively,
14820 since the standard is unclear (as detailed below). */
14823 do_type_instantiation (tree t
, tree storage
, tsubst_flags_t complain
)
14828 int previous_instantiation_extern_p
= 0;
14830 if (TREE_CODE (t
) == TYPE_DECL
)
14833 if (! CLASS_TYPE_P (t
) || ! CLASSTYPE_TEMPLATE_INFO (t
))
14835 error ("explicit instantiation of non-template type %qT", t
);
14841 if (!COMPLETE_TYPE_P (t
))
14843 if (complain
& tf_error
)
14844 error ("explicit instantiation of %q#T before definition of template",
14849 if (storage
!= NULL_TREE
)
14851 if (!in_system_header
)
14853 if (storage
== ridpointers
[(int) RID_EXTERN
])
14855 if (cxx_dialect
== cxx98
)
14856 pedwarn (input_location
, OPT_pedantic
,
14857 "ISO C++ 1998 forbids the use of %<extern%> on "
14858 "explicit instantiations");
14861 pedwarn (input_location
, OPT_pedantic
,
14862 "ISO C++ forbids the use of %qE"
14863 " on explicit instantiations", storage
);
14866 if (storage
== ridpointers
[(int) RID_INLINE
])
14868 else if (storage
== ridpointers
[(int) RID_EXTERN
])
14870 else if (storage
== ridpointers
[(int) RID_STATIC
])
14874 error ("storage class %qD applied to template instantiation",
14880 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
14882 /* DR 259 [temp.spec].
14884 Both an explicit instantiation and a declaration of an explicit
14885 specialization shall not appear in a program unless the explicit
14886 instantiation follows a declaration of the explicit specialization.
14888 For a given set of template parameters, if an explicit
14889 instantiation of a template appears after a declaration of an
14890 explicit specialization for that template, the explicit
14891 instantiation has no effect. */
14894 else if (CLASSTYPE_EXPLICIT_INSTANTIATION (t
))
14898 No program shall explicitly instantiate any template more
14901 If PREVIOUS_INSTANTIATION_EXTERN_P, then the first explicit
14902 instantiation was `extern'. If EXTERN_P then the second is.
14903 These cases are OK. */
14904 previous_instantiation_extern_p
= CLASSTYPE_INTERFACE_ONLY (t
);
14906 if (!previous_instantiation_extern_p
&& !extern_p
14907 && (complain
& tf_error
))
14908 permerror (input_location
, "duplicate explicit instantiation of %q#T", t
);
14910 /* If we've already instantiated the template, just return now. */
14911 if (!CLASSTYPE_INTERFACE_ONLY (t
))
14915 check_explicit_instantiation_namespace (TYPE_NAME (t
));
14916 mark_class_instantiated (t
, extern_p
);
14924 /* In contrast to implicit instantiation, where only the
14925 declarations, and not the definitions, of members are
14926 instantiated, we have here:
14930 The explicit instantiation of a class template specialization
14931 implies the instantiation of all of its members not
14932 previously explicitly specialized in the translation unit
14933 containing the explicit instantiation.
14935 Of course, we can't instantiate member template classes, since
14936 we don't have any arguments for them. Note that the standard
14937 is unclear on whether the instantiation of the members are
14938 *explicit* instantiations or not. However, the most natural
14939 interpretation is that it should be an explicit instantiation. */
14942 for (tmp
= TYPE_METHODS (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
14943 if (TREE_CODE (tmp
) == FUNCTION_DECL
14944 && DECL_TEMPLATE_INSTANTIATION (tmp
))
14945 instantiate_class_member (tmp
, extern_p
);
14947 for (tmp
= TYPE_FIELDS (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
14948 if (TREE_CODE (tmp
) == VAR_DECL
&& DECL_TEMPLATE_INSTANTIATION (tmp
))
14949 instantiate_class_member (tmp
, extern_p
);
14951 if (CLASSTYPE_NESTED_UTDS (t
))
14952 binding_table_foreach (CLASSTYPE_NESTED_UTDS (t
),
14953 bt_instantiate_type_proc
, &storage
);
14957 /* Given a function DECL, which is a specialization of TMPL, modify
14958 DECL to be a re-instantiation of TMPL with the same template
14959 arguments. TMPL should be the template into which tsubst'ing
14960 should occur for DECL, not the most general template.
14962 One reason for doing this is a scenario like this:
14965 void f(const T&, int i);
14967 void g() { f(3, 7); }
14970 void f(const T& t, const int i) { }
14972 Note that when the template is first instantiated, with
14973 instantiate_template, the resulting DECL will have no name for the
14974 first parameter, and the wrong type for the second. So, when we go
14975 to instantiate the DECL, we regenerate it. */
14978 regenerate_decl_from_template (tree decl
, tree tmpl
)
14980 /* The arguments used to instantiate DECL, from the most general
14985 args
= DECL_TI_ARGS (decl
);
14986 code_pattern
= DECL_TEMPLATE_RESULT (tmpl
);
14988 /* Make sure that we can see identifiers, and compute access
14990 push_access_scope (decl
);
14992 if (TREE_CODE (decl
) == FUNCTION_DECL
)
15000 args_depth
= TMPL_ARGS_DEPTH (args
);
15001 parms_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
15002 if (args_depth
> parms_depth
)
15003 args
= get_innermost_template_args (args
, parms_depth
);
15005 specs
= tsubst_exception_specification (TREE_TYPE (code_pattern
),
15006 args
, tf_error
, NULL_TREE
);
15008 TREE_TYPE (decl
) = build_exception_variant (TREE_TYPE (decl
),
15011 /* Merge parameter declarations. */
15012 decl_parm
= skip_artificial_parms_for (decl
,
15013 DECL_ARGUMENTS (decl
));
15015 = skip_artificial_parms_for (code_pattern
,
15016 DECL_ARGUMENTS (code_pattern
));
15017 while (decl_parm
&& !FUNCTION_PARAMETER_PACK_P (pattern_parm
))
15022 if (DECL_NAME (decl_parm
) != DECL_NAME (pattern_parm
))
15023 DECL_NAME (decl_parm
) = DECL_NAME (pattern_parm
);
15024 parm_type
= tsubst (TREE_TYPE (pattern_parm
), args
, tf_error
,
15026 parm_type
= type_decays_to (parm_type
);
15027 if (!same_type_p (TREE_TYPE (decl_parm
), parm_type
))
15028 TREE_TYPE (decl_parm
) = parm_type
;
15029 attributes
= DECL_ATTRIBUTES (pattern_parm
);
15030 if (DECL_ATTRIBUTES (decl_parm
) != attributes
)
15032 DECL_ATTRIBUTES (decl_parm
) = attributes
;
15033 cplus_decl_attributes (&decl_parm
, attributes
, /*flags=*/0);
15035 decl_parm
= TREE_CHAIN (decl_parm
);
15036 pattern_parm
= TREE_CHAIN (pattern_parm
);
15038 /* Merge any parameters that match with the function parameter
15040 if (pattern_parm
&& FUNCTION_PARAMETER_PACK_P (pattern_parm
))
15043 tree expanded_types
;
15044 /* Expand the TYPE_PACK_EXPANSION that provides the types for
15045 the parameters in this function parameter pack. */
15046 expanded_types
= tsubst_pack_expansion (TREE_TYPE (pattern_parm
),
15047 args
, tf_error
, NULL_TREE
);
15048 len
= TREE_VEC_LENGTH (expanded_types
);
15049 for (i
= 0; i
< len
; i
++)
15054 if (DECL_NAME (decl_parm
) != DECL_NAME (pattern_parm
))
15055 /* Rename the parameter to include the index. */
15056 DECL_NAME (decl_parm
) =
15057 make_ith_pack_parameter_name (DECL_NAME (pattern_parm
), i
);
15058 parm_type
= TREE_VEC_ELT (expanded_types
, i
);
15059 parm_type
= type_decays_to (parm_type
);
15060 if (!same_type_p (TREE_TYPE (decl_parm
), parm_type
))
15061 TREE_TYPE (decl_parm
) = parm_type
;
15062 attributes
= DECL_ATTRIBUTES (pattern_parm
);
15063 if (DECL_ATTRIBUTES (decl_parm
) != attributes
)
15065 DECL_ATTRIBUTES (decl_parm
) = attributes
;
15066 cplus_decl_attributes (&decl_parm
, attributes
, /*flags=*/0);
15068 decl_parm
= TREE_CHAIN (decl_parm
);
15071 /* Merge additional specifiers from the CODE_PATTERN. */
15072 if (DECL_DECLARED_INLINE_P (code_pattern
)
15073 && !DECL_DECLARED_INLINE_P (decl
))
15074 DECL_DECLARED_INLINE_P (decl
) = 1;
15076 else if (TREE_CODE (decl
) == VAR_DECL
)
15077 DECL_INITIAL (decl
) =
15078 tsubst_expr (DECL_INITIAL (code_pattern
), args
,
15079 tf_error
, DECL_TI_TEMPLATE (decl
),
15080 /*integral_constant_expression_p=*/false);
15082 gcc_unreachable ();
15084 pop_access_scope (decl
);
15087 /* Return the TEMPLATE_DECL into which DECL_TI_ARGS(DECL) should be
15088 substituted to get DECL. */
15091 template_for_substitution (tree decl
)
15093 tree tmpl
= DECL_TI_TEMPLATE (decl
);
15095 /* Set TMPL to the template whose DECL_TEMPLATE_RESULT is the pattern
15096 for the instantiation. This is not always the most general
15097 template. Consider, for example:
15100 struct S { template <class U> void f();
15101 template <> void f<int>(); };
15103 and an instantiation of S<double>::f<int>. We want TD to be the
15104 specialization S<T>::f<int>, not the more general S<T>::f<U>. */
15105 while (/* An instantiation cannot have a definition, so we need a
15106 more general template. */
15107 DECL_TEMPLATE_INSTANTIATION (tmpl
)
15108 /* We must also deal with friend templates. Given:
15110 template <class T> struct S {
15111 template <class U> friend void f() {};
15114 S<int>::f<U> say, is not an instantiation of S<T>::f<U>,
15115 so far as the language is concerned, but that's still
15116 where we get the pattern for the instantiation from. On
15117 other hand, if the definition comes outside the class, say:
15119 template <class T> struct S {
15120 template <class U> friend void f();
15122 template <class U> friend void f() {}
15124 we don't need to look any further. That's what the check for
15125 DECL_INITIAL is for. */
15126 || (TREE_CODE (decl
) == FUNCTION_DECL
15127 && DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (tmpl
)
15128 && !DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl
))))
15130 /* The present template, TD, should not be a definition. If it
15131 were a definition, we should be using it! Note that we
15132 cannot restructure the loop to just keep going until we find
15133 a template with a definition, since that might go too far if
15134 a specialization was declared, but not defined. */
15135 gcc_assert (TREE_CODE (decl
) != VAR_DECL
15136 || DECL_IN_AGGR_P (DECL_TEMPLATE_RESULT (tmpl
)));
15138 /* Fetch the more general template. */
15139 tmpl
= DECL_TI_TEMPLATE (tmpl
);
15145 /* Produce the definition of D, a _DECL generated from a template. If
15146 DEFER_OK is nonzero, then we don't have to actually do the
15147 instantiation now; we just have to do it sometime. Normally it is
15148 an error if this is an explicit instantiation but D is undefined.
15149 EXPL_INST_CLASS_MEM_P is true iff D is a member of an
15150 explicitly instantiated class template. */
15153 instantiate_decl (tree d
, int defer_ok
,
15154 bool expl_inst_class_mem_p
)
15156 tree tmpl
= DECL_TI_TEMPLATE (d
);
15163 bool pattern_defined
;
15165 location_t saved_loc
= input_location
;
15168 /* This function should only be used to instantiate templates for
15169 functions and static member variables. */
15170 gcc_assert (TREE_CODE (d
) == FUNCTION_DECL
15171 || TREE_CODE (d
) == VAR_DECL
);
15173 /* Variables are never deferred; if instantiation is required, they
15174 are instantiated right away. That allows for better code in the
15175 case that an expression refers to the value of the variable --
15176 if the variable has a constant value the referring expression can
15177 take advantage of that fact. */
15178 if (TREE_CODE (d
) == VAR_DECL
)
15181 /* Don't instantiate cloned functions. Instead, instantiate the
15182 functions they cloned. */
15183 if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_CLONED_FUNCTION_P (d
))
15184 d
= DECL_CLONED_FUNCTION (d
);
15186 if (DECL_TEMPLATE_INSTANTIATED (d
))
15187 /* D has already been instantiated. It might seem reasonable to
15188 check whether or not D is an explicit instantiation, and, if so,
15189 stop here. But when an explicit instantiation is deferred
15190 until the end of the compilation, DECL_EXPLICIT_INSTANTIATION
15191 is set, even though we still need to do the instantiation. */
15194 /* If we already have a specialization of this declaration, then
15195 there's no reason to instantiate it. Note that
15196 retrieve_specialization gives us both instantiations and
15197 specializations, so we must explicitly check
15198 DECL_TEMPLATE_SPECIALIZATION. */
15199 gen_tmpl
= most_general_template (tmpl
);
15200 gen_args
= DECL_TI_ARGS (d
);
15201 spec
= retrieve_specialization (gen_tmpl
, gen_args
,
15202 /*class_specializations_p=*/false);
15203 if (spec
!= NULL_TREE
&& DECL_TEMPLATE_SPECIALIZATION (spec
))
15206 /* This needs to happen before any tsubsting. */
15207 if (! push_tinst_level (d
))
15210 timevar_push (TV_PARSE
);
15212 /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern
15213 for the instantiation. */
15214 td
= template_for_substitution (d
);
15215 code_pattern
= DECL_TEMPLATE_RESULT (td
);
15217 /* We should never be trying to instantiate a member of a class
15218 template or partial specialization. */
15219 gcc_assert (d
!= code_pattern
);
15221 if ((DECL_NAMESPACE_SCOPE_P (d
) && !DECL_INITIALIZED_IN_CLASS_P (d
))
15222 || DECL_TEMPLATE_SPECIALIZATION (td
))
15223 /* In the case of a friend template whose definition is provided
15224 outside the class, we may have too many arguments. Drop the
15225 ones we don't need. The same is true for specializations. */
15226 args
= get_innermost_template_args
15227 (gen_args
, TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (td
)));
15231 if (TREE_CODE (d
) == FUNCTION_DECL
)
15232 pattern_defined
= (DECL_SAVED_TREE (code_pattern
) != NULL_TREE
);
15234 pattern_defined
= ! DECL_IN_AGGR_P (code_pattern
);
15236 /* We may be in the middle of deferred access check. Disable it now. */
15237 push_deferring_access_checks (dk_no_deferred
);
15239 /* Unless an explicit instantiation directive has already determined
15240 the linkage of D, remember that a definition is available for
15242 if (pattern_defined
15243 && !DECL_INTERFACE_KNOWN (d
)
15244 && !DECL_NOT_REALLY_EXTERN (d
))
15245 mark_definable (d
);
15247 input_location
= DECL_SOURCE_LOCATION (d
);
15249 /* If D is a member of an explicitly instantiated class template,
15250 and no definition is available, treat it like an implicit
15252 if (!pattern_defined
&& expl_inst_class_mem_p
15253 && DECL_EXPLICIT_INSTANTIATION (d
))
15255 DECL_NOT_REALLY_EXTERN (d
) = 0;
15256 DECL_INTERFACE_KNOWN (d
) = 0;
15257 SET_DECL_IMPLICIT_INSTANTIATION (d
);
15262 /* Recheck the substitutions to obtain any warning messages
15263 about ignoring cv qualifiers. */
15264 tree gen
= DECL_TEMPLATE_RESULT (gen_tmpl
);
15265 tree type
= TREE_TYPE (gen
);
15267 /* Make sure that we can see identifiers, and compute access
15268 correctly. D is already the target FUNCTION_DECL with the
15270 push_access_scope (d
);
15272 if (TREE_CODE (gen
) == FUNCTION_DECL
)
15274 tsubst (DECL_ARGUMENTS (gen
), gen_args
, tf_warning_or_error
, d
);
15275 tsubst_exception_specification (type
, gen_args
, tf_warning_or_error
,
15277 /* Don't simply tsubst the function type, as that will give
15278 duplicate warnings about poor parameter qualifications.
15279 The function arguments are the same as the decl_arguments
15280 without the top level cv qualifiers. */
15281 type
= TREE_TYPE (type
);
15283 tsubst (type
, gen_args
, tf_warning_or_error
, d
);
15285 pop_access_scope (d
);
15288 /* Check to see whether we know that this template will be
15289 instantiated in some other file, as with "extern template"
15291 external_p
= (DECL_INTERFACE_KNOWN (d
) && DECL_REALLY_EXTERN (d
));
15292 /* In general, we do not instantiate such templates... */
15294 /* ... but we instantiate inline functions so that we can inline
15296 && ! (TREE_CODE (d
) == FUNCTION_DECL
15297 && possibly_inlined_p (d
))
15298 /* ... we instantiate static data members whose values are
15299 needed in integral constant expressions. */
15300 && ! (TREE_CODE (d
) == VAR_DECL
15301 && DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (d
)))
15303 /* Defer all other templates, unless we have been explicitly
15304 forbidden from doing so. */
15305 if (/* If there is no definition, we cannot instantiate the
15308 /* If it's OK to postpone instantiation, do so. */
15310 /* If this is a static data member that will be defined
15311 elsewhere, we don't want to instantiate the entire data
15312 member, but we do want to instantiate the initializer so that
15313 we can substitute that elsewhere. */
15314 || (external_p
&& TREE_CODE (d
) == VAR_DECL
))
15316 /* The definition of the static data member is now required so
15317 we must substitute the initializer. */
15318 if (TREE_CODE (d
) == VAR_DECL
15319 && !DECL_INITIAL (d
)
15320 && DECL_INITIAL (code_pattern
))
15325 ns
= decl_namespace_context (d
);
15326 push_nested_namespace (ns
);
15327 push_nested_class (DECL_CONTEXT (d
));
15328 init
= tsubst_expr (DECL_INITIAL (code_pattern
),
15330 tf_warning_or_error
, NULL_TREE
,
15331 /*integral_constant_expression_p=*/false);
15332 cp_finish_decl (d
, init
, /*init_const_expr_p=*/false,
15333 /*asmspec_tree=*/NULL_TREE
,
15334 LOOKUP_ONLYCONVERTING
);
15335 pop_nested_class ();
15336 pop_nested_namespace (ns
);
15339 /* We restore the source position here because it's used by
15340 add_pending_template. */
15341 input_location
= saved_loc
;
15343 if (at_eof
&& !pattern_defined
15344 && DECL_EXPLICIT_INSTANTIATION (d
)
15345 && DECL_NOT_REALLY_EXTERN (d
))
15348 The definition of a non-exported function template, a
15349 non-exported member function template, or a non-exported
15350 member function or static data member of a class template
15351 shall be present in every translation unit in which it is
15352 explicitly instantiated. */
15353 permerror (input_location
, "explicit instantiation of %qD "
15354 "but no definition available", d
);
15356 /* ??? Historically, we have instantiated inline functions, even
15357 when marked as "extern template". */
15358 if (!(external_p
&& TREE_CODE (d
) == VAR_DECL
))
15359 add_pending_template (d
);
15362 /* Tell the repository that D is available in this translation unit
15363 -- and see if it is supposed to be instantiated here. */
15364 if (TREE_PUBLIC (d
) && !DECL_REALLY_EXTERN (d
) && !repo_emit_p (d
))
15366 /* In a PCH file, despite the fact that the repository hasn't
15367 requested instantiation in the PCH it is still possible that
15368 an instantiation will be required in a file that includes the
15371 add_pending_template (d
);
15372 /* Instantiate inline functions so that the inliner can do its
15373 job, even though we'll not be emitting a copy of this
15375 if (!(TREE_CODE (d
) == FUNCTION_DECL
&& possibly_inlined_p (d
)))
15379 need_push
= !cfun
|| !global_bindings_p ();
15381 push_to_top_level ();
15383 /* Mark D as instantiated so that recursive calls to
15384 instantiate_decl do not try to instantiate it again. */
15385 DECL_TEMPLATE_INSTANTIATED (d
) = 1;
15387 /* Regenerate the declaration in case the template has been modified
15388 by a subsequent redeclaration. */
15389 regenerate_decl_from_template (d
, td
);
15391 /* We already set the file and line above. Reset them now in case
15392 they changed as a result of calling regenerate_decl_from_template. */
15393 input_location
= DECL_SOURCE_LOCATION (d
);
15395 if (TREE_CODE (d
) == VAR_DECL
)
15399 /* Clear out DECL_RTL; whatever was there before may not be right
15400 since we've reset the type of the declaration. */
15401 SET_DECL_RTL (d
, NULL_RTX
);
15402 DECL_IN_AGGR_P (d
) = 0;
15404 /* The initializer is placed in DECL_INITIAL by
15405 regenerate_decl_from_template. Pull it out so that
15406 finish_decl can process it. */
15407 init
= DECL_INITIAL (d
);
15408 DECL_INITIAL (d
) = NULL_TREE
;
15409 DECL_INITIALIZED_P (d
) = 0;
15411 /* Clear DECL_EXTERNAL so that cp_finish_decl will process the
15412 initializer. That function will defer actual emission until
15413 we have a chance to determine linkage. */
15414 DECL_EXTERNAL (d
) = 0;
15416 /* Enter the scope of D so that access-checking works correctly. */
15417 push_nested_class (DECL_CONTEXT (d
));
15418 finish_decl (d
, init
, NULL_TREE
);
15419 pop_nested_class ();
15421 else if (TREE_CODE (d
) == FUNCTION_DECL
)
15423 htab_t saved_local_specializations
;
15428 /* Save away the current list, in case we are instantiating one
15429 template from within the body of another. */
15430 saved_local_specializations
= local_specializations
;
15432 /* Set up the list of local specializations. */
15433 local_specializations
= htab_create (37,
15434 hash_local_specialization
,
15435 eq_local_specializations
,
15438 /* Set up context. */
15439 start_preparsed_function (d
, NULL_TREE
, SF_PRE_PARSED
);
15441 /* Create substitution entries for the parameters. */
15442 subst_decl
= DECL_TEMPLATE_RESULT (template_for_substitution (d
));
15443 tmpl_parm
= DECL_ARGUMENTS (subst_decl
);
15444 spec_parm
= DECL_ARGUMENTS (d
);
15445 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (d
))
15447 register_local_specialization (spec_parm
, tmpl_parm
);
15448 spec_parm
= skip_artificial_parms_for (d
, spec_parm
);
15449 tmpl_parm
= skip_artificial_parms_for (subst_decl
, tmpl_parm
);
15451 while (tmpl_parm
&& !FUNCTION_PARAMETER_PACK_P (tmpl_parm
))
15453 register_local_specialization (spec_parm
, tmpl_parm
);
15454 tmpl_parm
= TREE_CHAIN (tmpl_parm
);
15455 spec_parm
= TREE_CHAIN (spec_parm
);
15457 if (tmpl_parm
&& FUNCTION_PARAMETER_PACK_P (tmpl_parm
))
15459 /* Collect all of the extra "packed" parameters into an
15463 tree argpack
= make_node (NONTYPE_ARGUMENT_PACK
);
15464 tree argtypepack
= make_node (TYPE_ARGUMENT_PACK
);
15468 /* Count how many parameters remain. */
15469 for (t
= spec_parm
; t
; t
= TREE_CHAIN (t
))
15472 /* Fill in PARMVEC and PARMTYPEVEC with all of the parameters. */
15473 parmvec
= make_tree_vec (len
);
15474 parmtypevec
= make_tree_vec (len
);
15475 for(i
= 0; i
< len
; i
++, spec_parm
= TREE_CHAIN (spec_parm
))
15477 TREE_VEC_ELT (parmvec
, i
) = spec_parm
;
15478 TREE_VEC_ELT (parmtypevec
, i
) = TREE_TYPE (spec_parm
);
15481 /* Build the argument packs. */
15482 SET_ARGUMENT_PACK_ARGS (argpack
, parmvec
);
15483 SET_ARGUMENT_PACK_ARGS (argtypepack
, parmtypevec
);
15484 TREE_TYPE (argpack
) = argtypepack
;
15486 /* Register the (value) argument pack as a specialization of
15487 TMPL_PARM, then move on. */
15488 register_local_specialization (argpack
, tmpl_parm
);
15489 tmpl_parm
= TREE_CHAIN (tmpl_parm
);
15491 gcc_assert (!spec_parm
);
15493 /* Substitute into the body of the function. */
15494 tsubst_expr (DECL_SAVED_TREE (code_pattern
), args
,
15495 tf_warning_or_error
, tmpl
,
15496 /*integral_constant_expression_p=*/false);
15498 /* Set the current input_location to the end of the function
15499 so that finish_function knows where we are. */
15500 input_location
= DECL_STRUCT_FUNCTION (code_pattern
)->function_end_locus
;
15502 /* We don't need the local specializations any more. */
15503 htab_delete (local_specializations
);
15504 local_specializations
= saved_local_specializations
;
15506 /* Finish the function. */
15507 d
= finish_function (0);
15508 expand_or_defer_fn (d
);
15511 /* We're not deferring instantiation any more. */
15512 TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (d
)) = 0;
15515 pop_from_top_level ();
15518 input_location
= saved_loc
;
15519 pop_deferring_access_checks ();
15520 pop_tinst_level ();
15522 timevar_pop (TV_PARSE
);
15527 /* Run through the list of templates that we wish we could
15528 instantiate, and instantiate any we can. RETRIES is the
15529 number of times we retry pending template instantiation. */
15532 instantiate_pending_templates (int retries
)
15535 location_t saved_loc
= input_location
;
15537 /* Instantiating templates may trigger vtable generation. This in turn
15538 may require further template instantiations. We place a limit here
15539 to avoid infinite loop. */
15540 if (pending_templates
&& retries
>= max_tinst_depth
)
15542 tree decl
= pending_templates
->tinst
->decl
;
15544 error ("template instantiation depth exceeds maximum of %d"
15545 " instantiating %q+D, possibly from virtual table generation"
15546 " (use -ftemplate-depth-NN to increase the maximum)",
15547 max_tinst_depth
, decl
);
15548 if (TREE_CODE (decl
) == FUNCTION_DECL
)
15549 /* Pretend that we defined it. */
15550 DECL_INITIAL (decl
) = error_mark_node
;
15556 struct pending_template
**t
= &pending_templates
;
15557 struct pending_template
*last
= NULL
;
15561 tree instantiation
= reopen_tinst_level ((*t
)->tinst
);
15562 bool complete
= false;
15564 if (TYPE_P (instantiation
))
15568 if (!COMPLETE_TYPE_P (instantiation
))
15570 instantiate_class_template (instantiation
);
15571 if (CLASSTYPE_TEMPLATE_INSTANTIATION (instantiation
))
15572 for (fn
= TYPE_METHODS (instantiation
);
15574 fn
= TREE_CHAIN (fn
))
15575 if (! DECL_ARTIFICIAL (fn
))
15576 instantiate_decl (fn
,
15578 /*expl_inst_class_mem_p=*/false);
15579 if (COMPLETE_TYPE_P (instantiation
))
15583 complete
= COMPLETE_TYPE_P (instantiation
);
15587 if (!DECL_TEMPLATE_SPECIALIZATION (instantiation
)
15588 && !DECL_TEMPLATE_INSTANTIATED (instantiation
))
15591 = instantiate_decl (instantiation
,
15593 /*expl_inst_class_mem_p=*/false);
15594 if (DECL_TEMPLATE_INSTANTIATED (instantiation
))
15598 complete
= (DECL_TEMPLATE_SPECIALIZATION (instantiation
)
15599 || DECL_TEMPLATE_INSTANTIATED (instantiation
));
15603 /* If INSTANTIATION has been instantiated, then we don't
15604 need to consider it again in the future. */
15612 current_tinst_level
= NULL
;
15614 last_pending_template
= last
;
15616 while (reconsider
);
15618 input_location
= saved_loc
;
15621 /* Substitute ARGVEC into T, which is a list of initializers for
15622 either base class or a non-static data member. The TREE_PURPOSEs
15623 are DECLs, and the TREE_VALUEs are the initializer values. Used by
15624 instantiate_decl. */
15627 tsubst_initializer_list (tree t
, tree argvec
)
15629 tree inits
= NULL_TREE
;
15631 for (; t
; t
= TREE_CHAIN (t
))
15635 tree expanded_bases
= NULL_TREE
;
15636 tree expanded_arguments
= NULL_TREE
;
15639 if (TREE_CODE (TREE_PURPOSE (t
)) == TYPE_PACK_EXPANSION
)
15644 /* Expand the base class expansion type into separate base
15646 expanded_bases
= tsubst_pack_expansion (TREE_PURPOSE (t
), argvec
,
15647 tf_warning_or_error
,
15649 if (expanded_bases
== error_mark_node
)
15652 /* We'll be building separate TREE_LISTs of arguments for
15654 len
= TREE_VEC_LENGTH (expanded_bases
);
15655 expanded_arguments
= make_tree_vec (len
);
15656 for (i
= 0; i
< len
; i
++)
15657 TREE_VEC_ELT (expanded_arguments
, i
) = NULL_TREE
;
15659 /* Build a dummy EXPR_PACK_EXPANSION that will be used to
15660 expand each argument in the TREE_VALUE of t. */
15661 expr
= make_node (EXPR_PACK_EXPANSION
);
15662 PACK_EXPANSION_PARAMETER_PACKS (expr
) =
15663 PACK_EXPANSION_PARAMETER_PACKS (TREE_PURPOSE (t
));
15665 if (TREE_VALUE (t
) == void_type_node
)
15666 /* VOID_TYPE_NODE is used to indicate
15667 value-initialization. */
15669 for (i
= 0; i
< len
; i
++)
15670 TREE_VEC_ELT (expanded_arguments
, i
) = void_type_node
;
15674 /* Substitute parameter packs into each argument in the
15676 in_base_initializer
= 1;
15677 for (arg
= TREE_VALUE (t
); arg
; arg
= TREE_CHAIN (arg
))
15679 tree expanded_exprs
;
15681 /* Expand the argument. */
15682 SET_PACK_EXPANSION_PATTERN (expr
, TREE_VALUE (arg
));
15684 = tsubst_pack_expansion (expr
, argvec
,
15685 tf_warning_or_error
,
15687 if (expanded_exprs
== error_mark_node
)
15690 /* Prepend each of the expanded expressions to the
15691 corresponding TREE_LIST in EXPANDED_ARGUMENTS. */
15692 for (i
= 0; i
< len
; i
++)
15694 TREE_VEC_ELT (expanded_arguments
, i
) =
15695 tree_cons (NULL_TREE
,
15696 TREE_VEC_ELT (expanded_exprs
, i
),
15697 TREE_VEC_ELT (expanded_arguments
, i
));
15700 in_base_initializer
= 0;
15702 /* Reverse all of the TREE_LISTs in EXPANDED_ARGUMENTS,
15703 since we built them backwards. */
15704 for (i
= 0; i
< len
; i
++)
15706 TREE_VEC_ELT (expanded_arguments
, i
) =
15707 nreverse (TREE_VEC_ELT (expanded_arguments
, i
));
15712 for (i
= 0; i
< len
; ++i
)
15714 if (expanded_bases
)
15716 decl
= TREE_VEC_ELT (expanded_bases
, i
);
15717 decl
= expand_member_init (decl
);
15718 init
= TREE_VEC_ELT (expanded_arguments
, i
);
15722 decl
= tsubst_copy (TREE_PURPOSE (t
), argvec
,
15723 tf_warning_or_error
, NULL_TREE
);
15725 decl
= expand_member_init (decl
);
15726 if (decl
&& !DECL_P (decl
))
15727 in_base_initializer
= 1;
15729 init
= tsubst_expr (TREE_VALUE (t
), argvec
,
15730 tf_warning_or_error
, NULL_TREE
,
15731 /*integral_constant_expression_p=*/false);
15732 in_base_initializer
= 0;
15737 init
= build_tree_list (decl
, init
);
15738 TREE_CHAIN (init
) = inits
;
15746 /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */
15749 set_current_access_from_decl (tree decl
)
15751 if (TREE_PRIVATE (decl
))
15752 current_access_specifier
= access_private_node
;
15753 else if (TREE_PROTECTED (decl
))
15754 current_access_specifier
= access_protected_node
;
15756 current_access_specifier
= access_public_node
;
15759 /* Instantiate an enumerated type. TAG is the template type, NEWTAG
15760 is the instantiation (which should have been created with
15761 start_enum) and ARGS are the template arguments to use. */
15764 tsubst_enum (tree tag
, tree newtag
, tree args
)
15768 for (e
= TYPE_VALUES (tag
); e
; e
= TREE_CHAIN (e
))
15773 decl
= TREE_VALUE (e
);
15774 /* Note that in a template enum, the TREE_VALUE is the
15775 CONST_DECL, not the corresponding INTEGER_CST. */
15776 value
= tsubst_expr (DECL_INITIAL (decl
),
15777 args
, tf_warning_or_error
, NULL_TREE
,
15778 /*integral_constant_expression_p=*/true);
15780 /* Give this enumeration constant the correct access. */
15781 set_current_access_from_decl (decl
);
15783 /* Actually build the enumerator itself. */
15784 build_enumerator (DECL_NAME (decl
), value
, newtag
);
15787 finish_enum (newtag
);
15788 DECL_SOURCE_LOCATION (TYPE_NAME (newtag
))
15789 = DECL_SOURCE_LOCATION (TYPE_NAME (tag
));
15792 /* DECL is a FUNCTION_DECL that is a template specialization. Return
15793 its type -- but without substituting the innermost set of template
15794 arguments. So, innermost set of template parameters will appear in
15798 get_mostly_instantiated_function_type (tree decl
)
15806 tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
15807 targs
= DECL_TI_ARGS (decl
);
15808 tparms
= DECL_TEMPLATE_PARMS (tmpl
);
15809 parm_depth
= TMPL_PARMS_DEPTH (tparms
);
15811 /* There should be as many levels of arguments as there are levels
15813 gcc_assert (parm_depth
== TMPL_ARGS_DEPTH (targs
));
15815 fn_type
= TREE_TYPE (tmpl
);
15817 if (parm_depth
== 1)
15818 /* No substitution is necessary. */
15822 int i
, save_access_control
;
15825 /* Replace the innermost level of the TARGS with NULL_TREEs to
15826 let tsubst know not to substitute for those parameters. */
15827 partial_args
= make_tree_vec (TREE_VEC_LENGTH (targs
));
15828 for (i
= 1; i
< TMPL_ARGS_DEPTH (targs
); ++i
)
15829 SET_TMPL_ARGS_LEVEL (partial_args
, i
,
15830 TMPL_ARGS_LEVEL (targs
, i
));
15831 SET_TMPL_ARGS_LEVEL (partial_args
,
15832 TMPL_ARGS_DEPTH (targs
),
15833 make_tree_vec (DECL_NTPARMS (tmpl
)));
15835 /* Disable access control as this function is used only during
15837 save_access_control
= flag_access_control
;
15838 flag_access_control
= 0;
15840 ++processing_template_decl
;
15841 /* Now, do the (partial) substitution to figure out the
15842 appropriate function type. */
15843 fn_type
= tsubst (fn_type
, partial_args
, tf_error
, NULL_TREE
);
15844 --processing_template_decl
;
15846 /* Substitute into the template parameters to obtain the real
15847 innermost set of parameters. This step is important if the
15848 innermost set of template parameters contains value
15849 parameters whose types depend on outer template parameters. */
15850 TREE_VEC_LENGTH (partial_args
)--;
15851 tparms
= tsubst_template_parms (tparms
, partial_args
, tf_error
);
15853 flag_access_control
= save_access_control
;
15859 /* Return truthvalue if we're processing a template different from
15860 the last one involved in diagnostics. */
15862 problematic_instantiation_changed (void)
15864 return last_template_error_tick
!= tinst_level_tick
;
15867 /* Remember current template involved in diagnostics. */
15869 record_last_problematic_instantiation (void)
15871 last_template_error_tick
= tinst_level_tick
;
15874 struct tinst_level
*
15875 current_instantiation (void)
15877 return current_tinst_level
;
15880 /* [temp.param] Check that template non-type parm TYPE is of an allowable
15881 type. Return zero for ok, nonzero for disallowed. Issue error and
15882 warning messages under control of COMPLAIN. */
15885 invalid_nontype_parm_type_p (tree type
, tsubst_flags_t complain
)
15887 if (INTEGRAL_TYPE_P (type
))
15889 else if (POINTER_TYPE_P (type
))
15891 else if (TYPE_PTR_TO_MEMBER_P (type
))
15893 else if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
)
15895 else if (TREE_CODE (type
) == TYPENAME_TYPE
)
15898 if (complain
& tf_error
)
15899 error ("%q#T is not a valid type for a template constant parameter", type
);
15903 /* Returns TRUE if TYPE is dependent, in the sense of [temp.dep.type].
15904 Assumes that TYPE really is a type, and not the ERROR_MARK_NODE.*/
15907 dependent_type_p_r (tree type
)
15913 A type is dependent if it is:
15915 -- a template parameter. Template template parameters are types
15916 for us (since TYPE_P holds true for them) so we handle
15918 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
15919 || TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
)
15921 /* -- a qualified-id with a nested-name-specifier which contains a
15922 class-name that names a dependent type or whose unqualified-id
15923 names a dependent type. */
15924 if (TREE_CODE (type
) == TYPENAME_TYPE
)
15926 /* -- a cv-qualified type where the cv-unqualified type is
15928 type
= TYPE_MAIN_VARIANT (type
);
15929 /* -- a compound type constructed from any dependent type. */
15930 if (TYPE_PTR_TO_MEMBER_P (type
))
15931 return (dependent_type_p (TYPE_PTRMEM_CLASS_TYPE (type
))
15932 || dependent_type_p (TYPE_PTRMEM_POINTED_TO_TYPE
15934 else if (TREE_CODE (type
) == POINTER_TYPE
15935 || TREE_CODE (type
) == REFERENCE_TYPE
)
15936 return dependent_type_p (TREE_TYPE (type
));
15937 else if (TREE_CODE (type
) == FUNCTION_TYPE
15938 || TREE_CODE (type
) == METHOD_TYPE
)
15942 if (dependent_type_p (TREE_TYPE (type
)))
15944 for (arg_type
= TYPE_ARG_TYPES (type
);
15946 arg_type
= TREE_CHAIN (arg_type
))
15947 if (dependent_type_p (TREE_VALUE (arg_type
)))
15951 /* -- an array type constructed from any dependent type or whose
15952 size is specified by a constant expression that is
15953 value-dependent. */
15954 if (TREE_CODE (type
) == ARRAY_TYPE
)
15956 if (TYPE_DOMAIN (type
)
15957 && dependent_type_p (TYPE_DOMAIN (type
)))
15959 return dependent_type_p (TREE_TYPE (type
));
15961 else if (TREE_CODE (type
) == INTEGER_TYPE
15962 && !TREE_CONSTANT (TYPE_MAX_VALUE (type
)))
15964 /* If this is the TYPE_DOMAIN of an array type, consider it
15966 return (value_dependent_expression_p (TYPE_MAX_VALUE (type
))
15967 || type_dependent_expression_p (TYPE_MAX_VALUE (type
)));
15970 /* -- a template-id in which either the template name is a template
15972 if (TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
15974 /* ... or any of the template arguments is a dependent type or
15975 an expression that is type-dependent or value-dependent. */
15976 else if (CLASS_TYPE_P (type
) && CLASSTYPE_TEMPLATE_INFO (type
)
15977 && (any_dependent_template_arguments_p
15978 (INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type
)))))
15981 /* All TYPEOF_TYPEs and DECLTYPE_TYPEs are dependent; if the
15982 argument of the `typeof' expression is not type-dependent, then
15983 it should already been have resolved. */
15984 if (TREE_CODE (type
) == TYPEOF_TYPE
15985 || TREE_CODE (type
) == DECLTYPE_TYPE
)
15988 /* A template argument pack is dependent if any of its packed
15990 if (TREE_CODE (type
) == TYPE_ARGUMENT_PACK
)
15992 tree args
= ARGUMENT_PACK_ARGS (type
);
15993 int i
, len
= TREE_VEC_LENGTH (args
);
15994 for (i
= 0; i
< len
; ++i
)
15995 if (dependent_template_arg_p (TREE_VEC_ELT (args
, i
)))
15999 /* All TYPE_PACK_EXPANSIONs are dependent, because parameter packs must
16000 be template parameters. */
16001 if (TREE_CODE (type
) == TYPE_PACK_EXPANSION
)
16004 /* The standard does not specifically mention types that are local
16005 to template functions or local classes, but they should be
16006 considered dependent too. For example:
16008 template <int I> void f() {
16013 The size of `E' cannot be known until the value of `I' has been
16014 determined. Therefore, `E' must be considered dependent. */
16015 scope
= TYPE_CONTEXT (type
);
16016 if (scope
&& TYPE_P (scope
))
16017 return dependent_type_p (scope
);
16018 else if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
)
16019 return type_dependent_expression_p (scope
);
16021 /* Other types are non-dependent. */
16025 /* Returns TRUE if TYPE is dependent, in the sense of
16026 [temp.dep.type]. */
16029 dependent_type_p (tree type
)
16031 /* If there are no template parameters in scope, then there can't be
16032 any dependent types. */
16033 if (!processing_template_decl
)
16035 /* If we are not processing a template, then nobody should be
16036 providing us with a dependent type. */
16038 gcc_assert (TREE_CODE (type
) != TEMPLATE_TYPE_PARM
|| is_auto (type
));
16042 /* If the type is NULL, we have not computed a type for the entity
16043 in question; in that case, the type is dependent. */
16047 /* Erroneous types can be considered non-dependent. */
16048 if (type
== error_mark_node
)
16051 /* If we have not already computed the appropriate value for TYPE,
16053 if (!TYPE_DEPENDENT_P_VALID (type
))
16055 TYPE_DEPENDENT_P (type
) = dependent_type_p_r (type
);
16056 TYPE_DEPENDENT_P_VALID (type
) = 1;
16059 return TYPE_DEPENDENT_P (type
);
16062 /* Returns TRUE if EXPRESSION is dependent, according to CRITERION. */
16065 dependent_scope_ref_p (tree expression
, bool criterion (tree
))
16070 gcc_assert (TREE_CODE (expression
) == SCOPE_REF
);
16072 if (!TYPE_P (TREE_OPERAND (expression
, 0)))
16075 scope
= TREE_OPERAND (expression
, 0);
16076 name
= TREE_OPERAND (expression
, 1);
16080 An id-expression is type-dependent if it contains a
16081 nested-name-specifier that contains a class-name that names a
16083 /* The suggested resolution to Core Issue 2 implies that if the
16084 qualifying type is the current class, then we must peek
16087 && currently_open_class (scope
)
16088 && !criterion (name
))
16090 if (dependent_type_p (scope
))
16096 /* Returns TRUE if the EXPRESSION is value-dependent, in the sense of
16097 [temp.dep.constexpr]. EXPRESSION is already known to be a constant
16101 value_dependent_expression_p (tree expression
)
16103 if (!processing_template_decl
)
16106 /* A name declared with a dependent type. */
16107 if (DECL_P (expression
) && type_dependent_expression_p (expression
))
16110 switch (TREE_CODE (expression
))
16112 case IDENTIFIER_NODE
:
16113 /* A name that has not been looked up -- must be dependent. */
16116 case TEMPLATE_PARM_INDEX
:
16117 /* A non-type template parm. */
16121 /* A non-type template parm. */
16122 if (DECL_TEMPLATE_PARM_P (expression
))
16124 return value_dependent_expression_p (DECL_INITIAL (expression
));
16127 /* A constant with integral or enumeration type and is initialized
16128 with an expression that is value-dependent. */
16129 if (DECL_INITIAL (expression
)
16130 && INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (expression
))
16131 && value_dependent_expression_p (DECL_INITIAL (expression
)))
16135 case DYNAMIC_CAST_EXPR
:
16136 case STATIC_CAST_EXPR
:
16137 case CONST_CAST_EXPR
:
16138 case REINTERPRET_CAST_EXPR
:
16140 /* These expressions are value-dependent if the type to which
16141 the cast occurs is dependent or the expression being casted
16142 is value-dependent. */
16144 tree type
= TREE_TYPE (expression
);
16146 if (dependent_type_p (type
))
16149 /* A functional cast has a list of operands. */
16150 expression
= TREE_OPERAND (expression
, 0);
16153 /* If there are no operands, it must be an expression such
16154 as "int()". This should not happen for aggregate types
16155 because it would form non-constant expressions. */
16156 gcc_assert (INTEGRAL_OR_ENUMERATION_TYPE_P (type
));
16161 if (TREE_CODE (expression
) == TREE_LIST
)
16162 return any_value_dependent_elements_p (expression
);
16164 return value_dependent_expression_p (expression
);
16169 /* A `sizeof' expression is value-dependent if the operand is
16170 type-dependent or is a pack expansion. */
16171 expression
= TREE_OPERAND (expression
, 0);
16172 if (PACK_EXPANSION_P (expression
))
16174 else if (TYPE_P (expression
))
16175 return dependent_type_p (expression
);
16176 return type_dependent_expression_p (expression
);
16179 return dependent_scope_ref_p (expression
, value_dependent_expression_p
);
16181 case COMPONENT_REF
:
16182 return (value_dependent_expression_p (TREE_OPERAND (expression
, 0))
16183 || value_dependent_expression_p (TREE_OPERAND (expression
, 1)));
16186 /* A CALL_EXPR may appear in a constant expression if it is a
16187 call to a builtin function, e.g., __builtin_constant_p. All
16188 such calls are value-dependent. */
16191 case NONTYPE_ARGUMENT_PACK
:
16192 /* A NONTYPE_ARGUMENT_PACK is value-dependent if any packed argument
16193 is value-dependent. */
16195 tree values
= ARGUMENT_PACK_ARGS (expression
);
16196 int i
, len
= TREE_VEC_LENGTH (values
);
16198 for (i
= 0; i
< len
; ++i
)
16199 if (value_dependent_expression_p (TREE_VEC_ELT (values
, i
)))
16207 tree type2
= TRAIT_EXPR_TYPE2 (expression
);
16208 return (dependent_type_p (TRAIT_EXPR_TYPE1 (expression
))
16209 || (type2
? dependent_type_p (type2
) : false));
16213 return ((value_dependent_expression_p (TREE_OPERAND (expression
, 0)))
16214 || (value_dependent_expression_p (TREE_OPERAND (expression
, 2))));
16217 /* A constant expression is value-dependent if any subexpression is
16218 value-dependent. */
16219 switch (TREE_CODE_CLASS (TREE_CODE (expression
)))
16221 case tcc_reference
:
16223 return (value_dependent_expression_p
16224 (TREE_OPERAND (expression
, 0)));
16226 case tcc_comparison
:
16228 return ((value_dependent_expression_p
16229 (TREE_OPERAND (expression
, 0)))
16230 || (value_dependent_expression_p
16231 (TREE_OPERAND (expression
, 1))));
16233 case tcc_expression
:
16237 for (i
= 0; i
< TREE_OPERAND_LENGTH (expression
); ++i
)
16238 /* In some cases, some of the operands may be missing.
16239 (For example, in the case of PREDECREMENT_EXPR, the
16240 amount to increment by may be missing.) That doesn't
16241 make the expression dependent. */
16242 if (TREE_OPERAND (expression
, i
)
16243 && (value_dependent_expression_p
16244 (TREE_OPERAND (expression
, i
))))
16254 /* The expression is not value-dependent. */
16258 /* Returns TRUE if the EXPRESSION is type-dependent, in the sense of
16259 [temp.dep.expr]. */
16262 type_dependent_expression_p (tree expression
)
16264 if (!processing_template_decl
)
16267 if (expression
== error_mark_node
)
16270 /* An unresolved name is always dependent. */
16271 if (TREE_CODE (expression
) == IDENTIFIER_NODE
16272 || TREE_CODE (expression
) == USING_DECL
)
16275 /* Some expression forms are never type-dependent. */
16276 if (TREE_CODE (expression
) == PSEUDO_DTOR_EXPR
16277 || TREE_CODE (expression
) == SIZEOF_EXPR
16278 || TREE_CODE (expression
) == ALIGNOF_EXPR
16279 || TREE_CODE (expression
) == TRAIT_EXPR
16280 || TREE_CODE (expression
) == TYPEID_EXPR
16281 || TREE_CODE (expression
) == DELETE_EXPR
16282 || TREE_CODE (expression
) == VEC_DELETE_EXPR
16283 || TREE_CODE (expression
) == THROW_EXPR
)
16286 /* The types of these expressions depends only on the type to which
16287 the cast occurs. */
16288 if (TREE_CODE (expression
) == DYNAMIC_CAST_EXPR
16289 || TREE_CODE (expression
) == STATIC_CAST_EXPR
16290 || TREE_CODE (expression
) == CONST_CAST_EXPR
16291 || TREE_CODE (expression
) == REINTERPRET_CAST_EXPR
16292 || TREE_CODE (expression
) == CAST_EXPR
)
16293 return dependent_type_p (TREE_TYPE (expression
));
16295 /* The types of these expressions depends only on the type created
16296 by the expression. */
16297 if (TREE_CODE (expression
) == NEW_EXPR
16298 || TREE_CODE (expression
) == VEC_NEW_EXPR
)
16300 /* For NEW_EXPR tree nodes created inside a template, either
16301 the object type itself or a TREE_LIST may appear as the
16303 tree type
= TREE_OPERAND (expression
, 1);
16304 if (TREE_CODE (type
) == TREE_LIST
)
16305 /* This is an array type. We need to check array dimensions
16307 return dependent_type_p (TREE_VALUE (TREE_PURPOSE (type
)))
16308 || value_dependent_expression_p
16309 (TREE_OPERAND (TREE_VALUE (type
), 1));
16311 return dependent_type_p (type
);
16314 if (TREE_CODE (expression
) == SCOPE_REF
16315 && dependent_scope_ref_p (expression
,
16316 type_dependent_expression_p
))
16319 if (TREE_CODE (expression
) == FUNCTION_DECL
16320 && DECL_LANG_SPECIFIC (expression
)
16321 && DECL_TEMPLATE_INFO (expression
)
16322 && (any_dependent_template_arguments_p
16323 (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (expression
)))))
16326 if (TREE_CODE (expression
) == TEMPLATE_DECL
16327 && !DECL_TEMPLATE_TEMPLATE_PARM_P (expression
))
16330 if (TREE_CODE (expression
) == STMT_EXPR
)
16331 expression
= stmt_expr_value_expr (expression
);
16333 if (BRACE_ENCLOSED_INITIALIZER_P (expression
))
16338 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expression
), i
, elt
)
16340 if (type_dependent_expression_p (elt
))
16346 if (TREE_TYPE (expression
) == unknown_type_node
)
16348 if (TREE_CODE (expression
) == ADDR_EXPR
)
16349 return type_dependent_expression_p (TREE_OPERAND (expression
, 0));
16350 if (TREE_CODE (expression
) == COMPONENT_REF
16351 || TREE_CODE (expression
) == OFFSET_REF
)
16353 if (type_dependent_expression_p (TREE_OPERAND (expression
, 0)))
16355 expression
= TREE_OPERAND (expression
, 1);
16356 if (TREE_CODE (expression
) == IDENTIFIER_NODE
)
16359 /* SCOPE_REF with non-null TREE_TYPE is always non-dependent. */
16360 if (TREE_CODE (expression
) == SCOPE_REF
)
16363 if (TREE_CODE (expression
) == BASELINK
)
16364 expression
= BASELINK_FUNCTIONS (expression
);
16366 if (TREE_CODE (expression
) == TEMPLATE_ID_EXPR
)
16368 if (any_dependent_template_arguments_p
16369 (TREE_OPERAND (expression
, 1)))
16371 expression
= TREE_OPERAND (expression
, 0);
16373 gcc_assert (TREE_CODE (expression
) == OVERLOAD
16374 || TREE_CODE (expression
) == FUNCTION_DECL
);
16378 if (type_dependent_expression_p (OVL_CURRENT (expression
)))
16380 expression
= OVL_NEXT (expression
);
16385 gcc_assert (TREE_CODE (expression
) != TYPE_DECL
);
16387 return (dependent_type_p (TREE_TYPE (expression
)));
16390 /* Returns TRUE if ARGS (a TREE_LIST of arguments to a function call)
16391 contains a type-dependent expression. */
16394 any_type_dependent_arguments_p (const_tree args
)
16398 tree arg
= TREE_VALUE (args
);
16400 if (type_dependent_expression_p (arg
))
16402 args
= TREE_CHAIN (args
);
16407 /* Returns TRUE if LIST (a TREE_LIST whose TREE_VALUEs are
16408 expressions) contains any value-dependent expressions. */
16411 any_value_dependent_elements_p (const_tree list
)
16413 for (; list
; list
= TREE_CHAIN (list
))
16414 if (value_dependent_expression_p (TREE_VALUE (list
)))
16420 /* Returns TRUE if the ARG (a template argument) is dependent. */
16423 dependent_template_arg_p (tree arg
)
16425 if (!processing_template_decl
)
16428 if (TREE_CODE (arg
) == TEMPLATE_DECL
16429 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
16430 return dependent_template_p (arg
);
16431 else if (ARGUMENT_PACK_P (arg
))
16433 tree args
= ARGUMENT_PACK_ARGS (arg
);
16434 int i
, len
= TREE_VEC_LENGTH (args
);
16435 for (i
= 0; i
< len
; ++i
)
16437 if (dependent_template_arg_p (TREE_VEC_ELT (args
, i
)))
16443 else if (TYPE_P (arg
))
16444 return dependent_type_p (arg
);
16446 return (type_dependent_expression_p (arg
)
16447 || value_dependent_expression_p (arg
));
16450 /* Returns true if ARGS (a collection of template arguments) contains
16451 any types that require structural equality testing. */
16454 any_template_arguments_need_structural_equality_p (tree args
)
16461 if (args
== error_mark_node
)
16464 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
16466 tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
16467 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
16469 tree arg
= TREE_VEC_ELT (level
, j
);
16470 tree packed_args
= NULL_TREE
;
16473 if (ARGUMENT_PACK_P (arg
))
16475 /* Look inside the argument pack. */
16476 packed_args
= ARGUMENT_PACK_ARGS (arg
);
16477 len
= TREE_VEC_LENGTH (packed_args
);
16480 for (k
= 0; k
< len
; ++k
)
16483 arg
= TREE_VEC_ELT (packed_args
, k
);
16485 if (error_operand_p (arg
))
16487 else if (TREE_CODE (arg
) == TEMPLATE_DECL
16488 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
16490 else if (TYPE_P (arg
) && TYPE_STRUCTURAL_EQUALITY_P (arg
))
16492 else if (!TYPE_P (arg
) && TREE_TYPE (arg
)
16493 && TYPE_STRUCTURAL_EQUALITY_P (TREE_TYPE (arg
)))
16502 /* Returns true if ARGS (a collection of template arguments) contains
16503 any dependent arguments. */
16506 any_dependent_template_arguments_p (const_tree args
)
16513 if (args
== error_mark_node
)
16516 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
16518 const_tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
16519 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
16520 if (dependent_template_arg_p (TREE_VEC_ELT (level
, j
)))
16527 /* Returns TRUE if the template TMPL is dependent. */
16530 dependent_template_p (tree tmpl
)
16532 if (TREE_CODE (tmpl
) == OVERLOAD
)
16536 if (dependent_template_p (OVL_FUNCTION (tmpl
)))
16538 tmpl
= OVL_CHAIN (tmpl
);
16543 /* Template template parameters are dependent. */
16544 if (DECL_TEMPLATE_TEMPLATE_PARM_P (tmpl
)
16545 || TREE_CODE (tmpl
) == TEMPLATE_TEMPLATE_PARM
)
16547 /* So are names that have not been looked up. */
16548 if (TREE_CODE (tmpl
) == SCOPE_REF
16549 || TREE_CODE (tmpl
) == IDENTIFIER_NODE
)
16551 /* So are member templates of dependent classes. */
16552 if (TYPE_P (CP_DECL_CONTEXT (tmpl
)))
16553 return dependent_type_p (DECL_CONTEXT (tmpl
));
16557 /* Returns TRUE if the specialization TMPL<ARGS> is dependent. */
16560 dependent_template_id_p (tree tmpl
, tree args
)
16562 return (dependent_template_p (tmpl
)
16563 || any_dependent_template_arguments_p (args
));
16566 /* Returns TRUE if OMP_FOR with DECLV, INITV, CONDV and INCRV vectors
16570 dependent_omp_for_p (tree declv
, tree initv
, tree condv
, tree incrv
)
16574 if (!processing_template_decl
)
16577 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
16579 tree decl
= TREE_VEC_ELT (declv
, i
);
16580 tree init
= TREE_VEC_ELT (initv
, i
);
16581 tree cond
= TREE_VEC_ELT (condv
, i
);
16582 tree incr
= TREE_VEC_ELT (incrv
, i
);
16584 if (type_dependent_expression_p (decl
))
16587 if (init
&& type_dependent_expression_p (init
))
16590 if (type_dependent_expression_p (cond
))
16593 if (COMPARISON_CLASS_P (cond
)
16594 && (type_dependent_expression_p (TREE_OPERAND (cond
, 0))
16595 || type_dependent_expression_p (TREE_OPERAND (cond
, 1))))
16598 if (TREE_CODE (incr
) == MODOP_EXPR
)
16600 if (type_dependent_expression_p (TREE_OPERAND (incr
, 0))
16601 || type_dependent_expression_p (TREE_OPERAND (incr
, 2)))
16604 else if (type_dependent_expression_p (incr
))
16606 else if (TREE_CODE (incr
) == MODIFY_EXPR
)
16608 if (type_dependent_expression_p (TREE_OPERAND (incr
, 0)))
16610 else if (BINARY_CLASS_P (TREE_OPERAND (incr
, 1)))
16612 tree t
= TREE_OPERAND (incr
, 1);
16613 if (type_dependent_expression_p (TREE_OPERAND (t
, 0))
16614 || type_dependent_expression_p (TREE_OPERAND (t
, 1)))
16623 /* TYPE is a TYPENAME_TYPE. Returns the ordinary TYPE to which the
16624 TYPENAME_TYPE corresponds. Returns the original TYPENAME_TYPE if
16625 no such TYPE can be found. Note that this function peers inside
16626 uninstantiated templates and therefore should be used only in
16627 extremely limited situations. ONLY_CURRENT_P restricts this
16628 peering to the currently open classes hierarchy (which is required
16629 when comparing types). */
16632 resolve_typename_type (tree type
, bool only_current_p
)
16641 gcc_assert (TREE_CODE (type
) == TYPENAME_TYPE
);
16643 scope
= TYPE_CONTEXT (type
);
16644 name
= TYPE_IDENTIFIER (type
);
16646 /* If the SCOPE is itself a TYPENAME_TYPE, then we need to resolve
16647 it first before we can figure out what NAME refers to. */
16648 if (TREE_CODE (scope
) == TYPENAME_TYPE
)
16649 scope
= resolve_typename_type (scope
, only_current_p
);
16650 /* If we don't know what SCOPE refers to, then we cannot resolve the
16652 if (TREE_CODE (scope
) == TYPENAME_TYPE
)
16654 /* If the SCOPE is a template type parameter, we have no way of
16655 resolving the name. */
16656 if (TREE_CODE (scope
) == TEMPLATE_TYPE_PARM
)
16658 /* If the SCOPE is not the current instantiation, there's no reason
16659 to look inside it. */
16660 if (only_current_p
&& !currently_open_class (scope
))
16662 /* If SCOPE isn't the template itself, it will not have a valid
16663 TYPE_FIELDS list. */
16664 if (same_type_p (scope
, CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope
)))
16665 /* scope is either the template itself or a compatible instantiation
16666 like X<T>, so look up the name in the original template. */
16667 scope
= CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope
);
16669 /* scope is a partial instantiation, so we can't do the lookup or we
16670 will lose the template arguments. */
16672 /* Enter the SCOPE so that name lookup will be resolved as if we
16673 were in the class definition. In particular, SCOPE will no
16674 longer be considered a dependent type. */
16675 pushed_scope
= push_scope (scope
);
16676 /* Look up the declaration. */
16677 decl
= lookup_member (scope
, name
, /*protect=*/0, /*want_type=*/true);
16679 result
= NULL_TREE
;
16681 /* For a TYPENAME_TYPE like "typename X::template Y<T>", we want to
16682 find a TEMPLATE_DECL. Otherwise, we want to find a TYPE_DECL. */
16685 else if (TREE_CODE (TYPENAME_TYPE_FULLNAME (type
)) == IDENTIFIER_NODE
16686 && TREE_CODE (decl
) == TYPE_DECL
)
16688 result
= TREE_TYPE (decl
);
16689 if (result
== error_mark_node
)
16690 result
= NULL_TREE
;
16692 else if (TREE_CODE (TYPENAME_TYPE_FULLNAME (type
)) == TEMPLATE_ID_EXPR
16693 && DECL_CLASS_TEMPLATE_P (decl
))
16697 /* Obtain the template and the arguments. */
16698 tmpl
= TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type
), 0);
16699 args
= TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type
), 1);
16700 /* Instantiate the template. */
16701 result
= lookup_template_class (tmpl
, args
, NULL_TREE
, NULL_TREE
,
16702 /*entering_scope=*/0,
16703 tf_error
| tf_user
);
16704 if (result
== error_mark_node
)
16705 result
= NULL_TREE
;
16708 /* Leave the SCOPE. */
16710 pop_scope (pushed_scope
);
16712 /* If we failed to resolve it, return the original typename. */
16716 /* If lookup found a typename type, resolve that too. */
16717 if (TREE_CODE (result
) == TYPENAME_TYPE
&& !TYPENAME_IS_RESOLVING_P (result
))
16719 /* Ill-formed programs can cause infinite recursion here, so we
16720 must catch that. */
16721 TYPENAME_IS_RESOLVING_P (type
) = 1;
16722 result
= resolve_typename_type (result
, only_current_p
);
16723 TYPENAME_IS_RESOLVING_P (type
) = 0;
16726 /* Qualify the resulting type. */
16727 quals
= cp_type_quals (type
);
16729 result
= cp_build_qualified_type (result
, cp_type_quals (result
) | quals
);
16734 /* EXPR is an expression which is not type-dependent. Return a proxy
16735 for EXPR that can be used to compute the types of larger
16736 expressions containing EXPR. */
16739 build_non_dependent_expr (tree expr
)
16743 /* Preserve null pointer constants so that the type of things like
16744 "p == 0" where "p" is a pointer can be determined. */
16745 if (null_ptr_cst_p (expr
))
16747 /* Preserve OVERLOADs; the functions must be available to resolve
16750 if (TREE_CODE (inner_expr
) == STMT_EXPR
)
16751 inner_expr
= stmt_expr_value_expr (inner_expr
);
16752 if (TREE_CODE (inner_expr
) == ADDR_EXPR
)
16753 inner_expr
= TREE_OPERAND (inner_expr
, 0);
16754 if (TREE_CODE (inner_expr
) == COMPONENT_REF
)
16755 inner_expr
= TREE_OPERAND (inner_expr
, 1);
16756 if (is_overloaded_fn (inner_expr
)
16757 || TREE_CODE (inner_expr
) == OFFSET_REF
)
16759 /* There is no need to return a proxy for a variable. */
16760 if (TREE_CODE (expr
) == VAR_DECL
)
16762 /* Preserve string constants; conversions from string constants to
16763 "char *" are allowed, even though normally a "const char *"
16764 cannot be used to initialize a "char *". */
16765 if (TREE_CODE (expr
) == STRING_CST
)
16767 /* Preserve arithmetic constants, as an optimization -- there is no
16768 reason to create a new node. */
16769 if (TREE_CODE (expr
) == INTEGER_CST
|| TREE_CODE (expr
) == REAL_CST
)
16771 /* Preserve THROW_EXPRs -- all throw-expressions have type "void".
16772 There is at least one place where we want to know that a
16773 particular expression is a throw-expression: when checking a ?:
16774 expression, there are special rules if the second or third
16775 argument is a throw-expression. */
16776 if (TREE_CODE (expr
) == THROW_EXPR
)
16779 if (TREE_CODE (expr
) == COND_EXPR
)
16780 return build3 (COND_EXPR
,
16782 TREE_OPERAND (expr
, 0),
16783 (TREE_OPERAND (expr
, 1)
16784 ? build_non_dependent_expr (TREE_OPERAND (expr
, 1))
16785 : build_non_dependent_expr (TREE_OPERAND (expr
, 0))),
16786 build_non_dependent_expr (TREE_OPERAND (expr
, 2)));
16787 if (TREE_CODE (expr
) == COMPOUND_EXPR
16788 && !COMPOUND_EXPR_OVERLOADED (expr
))
16789 return build2 (COMPOUND_EXPR
,
16791 TREE_OPERAND (expr
, 0),
16792 build_non_dependent_expr (TREE_OPERAND (expr
, 1)));
16794 /* If the type is unknown, it can't really be non-dependent */
16795 gcc_assert (TREE_TYPE (expr
) != unknown_type_node
);
16797 /* Otherwise, build a NON_DEPENDENT_EXPR.
16799 REFERENCE_TYPEs are not stripped for expressions in templates
16800 because doing so would play havoc with mangling. Consider, for
16803 template <typename T> void f<T& g>() { g(); }
16805 In the body of "f", the expression for "g" will have
16806 REFERENCE_TYPE, even though the standard says that it should
16807 not. The reason is that we must preserve the syntactic form of
16808 the expression so that mangling (say) "f<g>" inside the body of
16809 "f" works out correctly. Therefore, the REFERENCE_TYPE is
16811 return build1 (NON_DEPENDENT_EXPR
, non_reference (TREE_TYPE (expr
)), expr
);
16814 /* ARGS is a TREE_LIST of expressions as arguments to a function call.
16815 Return a new TREE_LIST with the various arguments replaced with
16816 equivalent non-dependent expressions. */
16819 build_non_dependent_args (tree args
)
16824 new_args
= NULL_TREE
;
16825 for (a
= args
; a
; a
= TREE_CHAIN (a
))
16826 new_args
= tree_cons (NULL_TREE
,
16827 build_non_dependent_expr (TREE_VALUE (a
)),
16829 return nreverse (new_args
);
16832 /* Returns a type which represents 'auto'. We use a TEMPLATE_TYPE_PARM
16833 with a level one deeper than the actual template parms. */
16840 /* ??? Is it worth caching this for multiple autos at the same level? */
16841 au
= cxx_make_type (TEMPLATE_TYPE_PARM
);
16842 TYPE_NAME (au
) = build_decl (TYPE_DECL
, get_identifier ("auto"), au
);
16843 TYPE_STUB_DECL (au
) = TYPE_NAME (au
);
16844 TEMPLATE_TYPE_PARM_INDEX (au
) = build_template_parm_index
16845 (0, processing_template_decl
+ 1, processing_template_decl
+ 1,
16846 TYPE_NAME (au
), NULL_TREE
);
16847 TYPE_CANONICAL (au
) = canonical_type_parameter (au
);
16848 DECL_ARTIFICIAL (TYPE_NAME (au
)) = 1;
16849 SET_DECL_TEMPLATE_PARM_P (TYPE_NAME (au
));
16854 /* Replace auto in TYPE with std::initializer_list<auto>. */
16857 listify_autos (tree type
, tree auto_node
)
16859 tree std_init_list
= namespace_binding
16860 (get_identifier ("initializer_list"), std_node
);
16863 if (!std_init_list
|| !DECL_CLASS_TEMPLATE_P (std_init_list
))
16865 error ("deducing auto from brace-enclosed initializer list requires "
16866 "#include <initializer_list>");
16867 return error_mark_node
;
16869 argvec
= make_tree_vec (1);
16870 TREE_VEC_ELT (argvec
, 0) = auto_node
;
16871 init_auto
= lookup_template_class (std_init_list
, argvec
, NULL_TREE
,
16872 NULL_TREE
, 0, tf_warning_or_error
);
16874 TREE_VEC_ELT (argvec
, 0) = init_auto
;
16875 if (processing_template_decl
)
16876 argvec
= add_to_template_args (current_template_args (), argvec
);
16877 return tsubst (type
, argvec
, tf_warning_or_error
, NULL_TREE
);
16880 /* Replace occurrences of 'auto' in TYPE with the appropriate type deduced
16881 from INIT. AUTO_NODE is the TEMPLATE_TYPE_PARM used for 'auto' in TYPE. */
16884 do_auto_deduction (tree type
, tree init
, tree auto_node
)
16886 tree parms
, args
, tparms
, targs
;
16889 /* [dcl.spec.auto]: Obtain P from T by replacing the occurrences of auto
16890 with either a new invented type template parameter U or, if the
16891 initializer is a braced-init-list (8.5.4), with
16892 std::initializer_list<U>. */
16893 if (BRACE_ENCLOSED_INITIALIZER_P (init
))
16894 type
= listify_autos (type
, auto_node
);
16896 parms
= build_tree_list (NULL_TREE
, type
);
16897 args
= build_tree_list (NULL_TREE
, init
);
16898 tparms
= make_tree_vec (1);
16899 targs
= make_tree_vec (1);
16900 TREE_VEC_ELT (tparms
, 0)
16901 = build_tree_list (NULL_TREE
, TYPE_NAME (auto_node
));
16902 val
= type_unification_real (tparms
, targs
, parms
, args
, 0,
16903 DEDUCE_CALL
, LOOKUP_NORMAL
);
16906 error ("unable to deduce %qT from %qE", type
, init
);
16907 return error_mark_node
;
16910 if (processing_template_decl
)
16911 targs
= add_to_template_args (current_template_args (), targs
);
16912 return tsubst (type
, targs
, tf_warning_or_error
, NULL_TREE
);
16915 /* Substitutes LATE_RETURN_TYPE for 'auto' in TYPE and returns the
16919 splice_late_return_type (tree type
, tree late_return_type
)
16923 if (late_return_type
== NULL_TREE
)
16925 argvec
= make_tree_vec (1);
16926 TREE_VEC_ELT (argvec
, 0) = late_return_type
;
16927 if (processing_template_decl
)
16928 argvec
= add_to_template_args (current_template_args (), argvec
);
16929 return tsubst (type
, argvec
, tf_warning_or_error
, NULL_TREE
);
16932 /* Returns true iff TYPE is a TEMPLATE_TYPE_PARM representing 'auto'. */
16935 is_auto (const_tree type
)
16937 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
16938 && TYPE_IDENTIFIER (type
) == get_identifier ("auto"))
16944 /* Returns true iff TYPE contains a use of 'auto'. Since auto can only
16945 appear as a type-specifier for the declaration in question, we don't
16946 have to look through the whole type. */
16949 type_uses_auto (tree type
)
16951 enum tree_code code
;
16952 if (is_auto (type
))
16955 code
= TREE_CODE (type
);
16957 if (code
== POINTER_TYPE
|| code
== REFERENCE_TYPE
16958 || code
== OFFSET_TYPE
|| code
== FUNCTION_TYPE
16959 || code
== METHOD_TYPE
|| code
== ARRAY_TYPE
)
16960 return type_uses_auto (TREE_TYPE (type
));
16962 if (TYPE_PTRMEMFUNC_P (type
))
16963 return type_uses_auto (TREE_TYPE (TREE_TYPE
16964 (TYPE_PTRMEMFUNC_FN_TYPE (type
))));
16969 #include "gt-cp-pt.h"