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 Free Software Foundation, Inc.
4 Written by Ken Raeburn (raeburn@cygnus.com) while at Watchmaker Computing.
5 Rewritten by Jason Merrill (jason@cygnus.com).
7 This file is part of GCC.
9 GCC is free software; you can redistribute it and/or modify
10 it under the terms of the GNU General Public License as published by
11 the Free Software Foundation; either version 3, or (at your option)
14 GCC is distributed in the hope that it will be useful,
15 but WITHOUT ANY WARRANTY; without even the implied warranty of
16 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 GNU General Public License for more details.
19 You should have received a copy of the GNU General Public License
20 along with GCC; see the file COPYING3. If not see
21 <http://www.gnu.org/licenses/>. */
23 /* Known bugs or deficiencies include:
25 all methods must be provided in header files; can't use a source
26 file that contains only the method templates and "just win". */
30 #include "coretypes.h"
34 #include "pointer-set.h"
38 #include "cp-objcp-common.h"
39 #include "tree-inline.h"
46 #include "tree-iterator.h"
49 /* The type of functions taking a tree, and some additional data, and
51 typedef int (*tree_fn_t
) (tree
, void*);
53 /* The PENDING_TEMPLATES is a TREE_LIST of templates whose
54 instantiations have been deferred, either because their definitions
55 were not yet available, or because we were putting off doing the work. */
56 struct pending_template
GTY (()) {
57 struct pending_template
*next
;
58 struct tinst_level
*tinst
;
61 static GTY(()) struct pending_template
*pending_templates
;
62 static GTY(()) struct pending_template
*last_pending_template
;
64 int processing_template_parmlist
;
65 static int template_header_count
;
67 static GTY(()) tree saved_trees
;
68 static VEC(int,heap
) *inline_parm_levels
;
70 static GTY(()) struct tinst_level
*current_tinst_level
;
72 static GTY(()) tree saved_access_scope
;
74 /* Live only within one (recursive) call to tsubst_expr. We use
75 this to pass the statement expression node from the STMT_EXPR
76 to the EXPR_STMT that is its result. */
77 static tree cur_stmt_expr
;
79 /* A map from local variable declarations in the body of the template
80 presently being instantiated to the corresponding instantiated
82 static htab_t local_specializations
;
84 /* Contains canonical template parameter types. The vector is indexed by
85 the TEMPLATE_TYPE_IDX of the template parameter. Each element is a
86 TREE_LIST, whose TREE_VALUEs contain the canonical template
87 parameters of various types and levels. */
88 static GTY(()) VEC(tree
,gc
) *canonical_template_parms
;
90 #define UNIFY_ALLOW_NONE 0
91 #define UNIFY_ALLOW_MORE_CV_QUAL 1
92 #define UNIFY_ALLOW_LESS_CV_QUAL 2
93 #define UNIFY_ALLOW_DERIVED 4
94 #define UNIFY_ALLOW_INTEGER 8
95 #define UNIFY_ALLOW_OUTER_LEVEL 16
96 #define UNIFY_ALLOW_OUTER_MORE_CV_QUAL 32
97 #define UNIFY_ALLOW_OUTER_LESS_CV_QUAL 64
99 static void push_access_scope (tree
);
100 static void pop_access_scope (tree
);
101 static bool resolve_overloaded_unification (tree
, tree
, tree
, tree
,
102 unification_kind_t
, int);
103 static int try_one_overload (tree
, tree
, tree
, tree
, tree
,
104 unification_kind_t
, int, bool);
105 static int unify (tree
, tree
, tree
, tree
, int);
106 static void add_pending_template (tree
);
107 static int push_tinst_level (tree
);
108 static void pop_tinst_level (void);
109 static tree
reopen_tinst_level (struct tinst_level
*);
110 static tree
tsubst_initializer_list (tree
, tree
);
111 static tree
get_class_bindings (tree
, tree
, tree
);
112 static tree
coerce_template_parms (tree
, tree
, tree
, tsubst_flags_t
,
114 static void tsubst_enum (tree
, tree
, tree
);
115 static tree
add_to_template_args (tree
, tree
);
116 static tree
add_outermost_template_args (tree
, tree
);
117 static bool check_instantiated_args (tree
, tree
, tsubst_flags_t
);
118 static int maybe_adjust_types_for_deduction (unification_kind_t
, tree
*, tree
*,
120 static int type_unification_real (tree
, tree
, tree
, tree
,
121 int, unification_kind_t
, int);
122 static void note_template_header (int);
123 static tree
convert_nontype_argument_function (tree
, tree
);
124 static tree
convert_nontype_argument (tree
, tree
);
125 static tree
convert_template_argument (tree
, tree
, tree
,
126 tsubst_flags_t
, int, tree
);
127 static int for_each_template_parm (tree
, tree_fn_t
, void*,
128 struct pointer_set_t
*, bool);
129 static tree
expand_template_argument_pack (tree
);
130 static tree
build_template_parm_index (int, int, int, tree
, tree
);
131 static bool inline_needs_template_parms (tree
);
132 static void push_inline_template_parms_recursive (tree
, int);
133 static tree
retrieve_local_specialization (tree
);
134 static void register_local_specialization (tree
, tree
);
135 static tree
reduce_template_parm_level (tree
, tree
, int, tree
, tsubst_flags_t
);
136 static int mark_template_parm (tree
, void *);
137 static int template_parm_this_level_p (tree
, void *);
138 static tree
tsubst_friend_function (tree
, tree
);
139 static tree
tsubst_friend_class (tree
, tree
);
140 static int can_complete_type_without_circularity (tree
);
141 static tree
get_bindings (tree
, tree
, tree
, bool);
142 static int template_decl_level (tree
);
143 static int check_cv_quals_for_unify (int, tree
, tree
);
144 static void template_parm_level_and_index (tree
, int*, int*);
145 static int unify_pack_expansion (tree
, tree
, tree
, tree
, int, bool, bool);
146 static tree
tsubst_template_arg (tree
, tree
, tsubst_flags_t
, tree
);
147 static tree
tsubst_template_args (tree
, tree
, tsubst_flags_t
, tree
);
148 static tree
tsubst_template_parms (tree
, tree
, tsubst_flags_t
);
149 static void regenerate_decl_from_template (tree
, tree
);
150 static tree
most_specialized_class (tree
, tree
);
151 static tree
tsubst_aggr_type (tree
, tree
, tsubst_flags_t
, tree
, int);
152 static tree
tsubst_arg_types (tree
, tree
, tsubst_flags_t
, tree
);
153 static tree
tsubst_function_type (tree
, tree
, tsubst_flags_t
, tree
);
154 static bool check_specialization_scope (void);
155 static tree
process_partial_specialization (tree
);
156 static void set_current_access_from_decl (tree
);
157 static tree
get_template_base (tree
, tree
, tree
, tree
);
158 static tree
try_class_unification (tree
, tree
, tree
, tree
);
159 static int coerce_template_template_parms (tree
, tree
, tsubst_flags_t
,
161 static bool template_template_parm_bindings_ok_p (tree
, tree
);
162 static int template_args_equal (tree
, tree
);
163 static void tsubst_default_arguments (tree
);
164 static tree
for_each_template_parm_r (tree
*, int *, void *);
165 static tree
copy_default_args_to_explicit_spec_1 (tree
, tree
);
166 static void copy_default_args_to_explicit_spec (tree
);
167 static int invalid_nontype_parm_type_p (tree
, tsubst_flags_t
);
168 static int eq_local_specializations (const void *, const void *);
169 static bool dependent_template_arg_p (tree
);
170 static bool any_template_arguments_need_structural_equality_p (tree
);
171 static bool dependent_type_p_r (tree
);
172 static tree
tsubst (tree
, tree
, tsubst_flags_t
, tree
);
173 static tree
tsubst_expr (tree
, tree
, tsubst_flags_t
, tree
, bool);
174 static tree
tsubst_copy (tree
, tree
, tsubst_flags_t
, tree
);
175 static tree
tsubst_pack_expansion (tree
, tree
, tsubst_flags_t
, tree
);
177 /* Make the current scope suitable for access checking when we are
178 processing T. T can be FUNCTION_DECL for instantiated function
179 template, or VAR_DECL for static member variable (need by
180 instantiate_decl). */
183 push_access_scope (tree t
)
185 gcc_assert (TREE_CODE (t
) == FUNCTION_DECL
186 || TREE_CODE (t
) == VAR_DECL
);
188 if (DECL_FRIEND_CONTEXT (t
))
189 push_nested_class (DECL_FRIEND_CONTEXT (t
));
190 else if (DECL_CLASS_SCOPE_P (t
))
191 push_nested_class (DECL_CONTEXT (t
));
193 push_to_top_level ();
195 if (TREE_CODE (t
) == FUNCTION_DECL
)
197 saved_access_scope
= tree_cons
198 (NULL_TREE
, current_function_decl
, saved_access_scope
);
199 current_function_decl
= t
;
203 /* Restore the scope set up by push_access_scope. T is the node we
207 pop_access_scope (tree t
)
209 if (TREE_CODE (t
) == FUNCTION_DECL
)
211 current_function_decl
= TREE_VALUE (saved_access_scope
);
212 saved_access_scope
= TREE_CHAIN (saved_access_scope
);
215 if (DECL_FRIEND_CONTEXT (t
) || DECL_CLASS_SCOPE_P (t
))
218 pop_from_top_level ();
221 /* Do any processing required when DECL (a member template
222 declaration) is finished. Returns the TEMPLATE_DECL corresponding
223 to DECL, unless it is a specialization, in which case the DECL
224 itself is returned. */
227 finish_member_template_decl (tree decl
)
229 if (decl
== error_mark_node
)
230 return error_mark_node
;
232 gcc_assert (DECL_P (decl
));
234 if (TREE_CODE (decl
) == TYPE_DECL
)
238 type
= TREE_TYPE (decl
);
239 if (type
== error_mark_node
)
240 return error_mark_node
;
241 if (MAYBE_CLASS_TYPE_P (type
)
242 && CLASSTYPE_TEMPLATE_INFO (type
)
243 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
245 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
246 check_member_template (tmpl
);
251 else if (TREE_CODE (decl
) == FIELD_DECL
)
252 error ("data member %qD cannot be a member template", decl
);
253 else if (DECL_TEMPLATE_INFO (decl
))
255 if (!DECL_TEMPLATE_SPECIALIZATION (decl
))
257 check_member_template (DECL_TI_TEMPLATE (decl
));
258 return DECL_TI_TEMPLATE (decl
);
264 error ("invalid member template declaration %qD", decl
);
266 return error_mark_node
;
269 /* Return the template info node corresponding to T, whatever T is. */
272 get_template_info (tree t
)
274 tree tinfo
= NULL_TREE
;
276 if (DECL_P (t
) && DECL_LANG_SPECIFIC (t
))
277 tinfo
= DECL_TEMPLATE_INFO (t
);
279 if (!tinfo
&& TREE_CODE (t
) == TYPE_DECL
)
282 if (TAGGED_TYPE_P (t
))
283 tinfo
= TYPE_TEMPLATE_INFO (t
);
288 /* Returns the template nesting level of the indicated class TYPE.
298 A<T>::B<U> has depth two, while A<T> has depth one.
299 Both A<T>::B<int> and A<int>::B<U> have depth one, if
300 they are instantiations, not specializations.
302 This function is guaranteed to return 0 if passed NULL_TREE so
303 that, for example, `template_class_depth (current_class_type)' is
307 template_class_depth (tree type
)
312 type
&& TREE_CODE (type
) != NAMESPACE_DECL
;
313 type
= (TREE_CODE (type
) == FUNCTION_DECL
)
314 ? CP_DECL_CONTEXT (type
) : TYPE_CONTEXT (type
))
316 tree tinfo
= get_template_info (type
);
318 if (tinfo
&& PRIMARY_TEMPLATE_P (TI_TEMPLATE (tinfo
))
319 && uses_template_parms (INNERMOST_TEMPLATE_ARGS (TI_ARGS (tinfo
))))
326 /* Subroutine of maybe_begin_member_template_processing.
327 Returns true if processing DECL needs us to push template parms. */
330 inline_needs_template_parms (tree decl
)
332 if (! DECL_TEMPLATE_INFO (decl
))
335 return (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (most_general_template (decl
)))
336 > (processing_template_decl
+ DECL_TEMPLATE_SPECIALIZATION (decl
)));
339 /* Subroutine of maybe_begin_member_template_processing.
340 Push the template parms in PARMS, starting from LEVELS steps into the
341 chain, and ending at the beginning, since template parms are listed
345 push_inline_template_parms_recursive (tree parmlist
, int levels
)
347 tree parms
= TREE_VALUE (parmlist
);
351 push_inline_template_parms_recursive (TREE_CHAIN (parmlist
), levels
- 1);
353 ++processing_template_decl
;
354 current_template_parms
355 = tree_cons (size_int (processing_template_decl
),
356 parms
, current_template_parms
);
357 TEMPLATE_PARMS_FOR_INLINE (current_template_parms
) = 1;
359 begin_scope (TREE_VEC_LENGTH (parms
) ? sk_template_parms
: sk_template_spec
,
361 for (i
= 0; i
< TREE_VEC_LENGTH (parms
); ++i
)
363 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
365 if (parm
== error_mark_node
)
368 gcc_assert (DECL_P (parm
));
370 switch (TREE_CODE (parm
))
379 /* Make a CONST_DECL as is done in process_template_parm.
380 It is ugly that we recreate this here; the original
381 version built in process_template_parm is no longer
383 tree decl
= build_decl (CONST_DECL
, DECL_NAME (parm
),
385 DECL_ARTIFICIAL (decl
) = 1;
386 TREE_CONSTANT (decl
) = 1;
387 TREE_READONLY (decl
) = 1;
388 DECL_INITIAL (decl
) = DECL_INITIAL (parm
);
389 SET_DECL_TEMPLATE_PARM_P (decl
);
400 /* Restore the template parameter context for a member template or
401 a friend template defined in a class definition. */
404 maybe_begin_member_template_processing (tree decl
)
409 if (inline_needs_template_parms (decl
))
411 parms
= DECL_TEMPLATE_PARMS (most_general_template (decl
));
412 levels
= TMPL_PARMS_DEPTH (parms
) - processing_template_decl
;
414 if (DECL_TEMPLATE_SPECIALIZATION (decl
))
417 parms
= TREE_CHAIN (parms
);
420 push_inline_template_parms_recursive (parms
, levels
);
423 /* Remember how many levels of template parameters we pushed so that
424 we can pop them later. */
425 VEC_safe_push (int, heap
, inline_parm_levels
, levels
);
428 /* Undo the effects of maybe_begin_member_template_processing. */
431 maybe_end_member_template_processing (void)
436 if (VEC_length (int, inline_parm_levels
) == 0)
439 last
= VEC_pop (int, inline_parm_levels
);
440 for (i
= 0; i
< last
; ++i
)
442 --processing_template_decl
;
443 current_template_parms
= TREE_CHAIN (current_template_parms
);
448 /* Return a new template argument vector which contains all of ARGS,
449 but has as its innermost set of arguments the EXTRA_ARGS. */
452 add_to_template_args (tree args
, tree extra_args
)
459 extra_depth
= TMPL_ARGS_DEPTH (extra_args
);
460 new_args
= make_tree_vec (TMPL_ARGS_DEPTH (args
) + extra_depth
);
462 for (i
= 1; i
<= TMPL_ARGS_DEPTH (args
); ++i
)
463 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (args
, i
));
465 for (j
= 1; j
<= extra_depth
; ++j
, ++i
)
466 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (extra_args
, j
));
471 /* Like add_to_template_args, but only the outermost ARGS are added to
472 the EXTRA_ARGS. In particular, all but TMPL_ARGS_DEPTH
473 (EXTRA_ARGS) levels are added. This function is used to combine
474 the template arguments from a partial instantiation with the
475 template arguments used to attain the full instantiation from the
476 partial instantiation. */
479 add_outermost_template_args (tree args
, tree extra_args
)
483 /* If there are more levels of EXTRA_ARGS than there are ARGS,
484 something very fishy is going on. */
485 gcc_assert (TMPL_ARGS_DEPTH (args
) >= TMPL_ARGS_DEPTH (extra_args
));
487 /* If *all* the new arguments will be the EXTRA_ARGS, just return
489 if (TMPL_ARGS_DEPTH (args
) == TMPL_ARGS_DEPTH (extra_args
))
492 /* For the moment, we make ARGS look like it contains fewer levels. */
493 TREE_VEC_LENGTH (args
) -= TMPL_ARGS_DEPTH (extra_args
);
495 new_args
= add_to_template_args (args
, extra_args
);
497 /* Now, we restore ARGS to its full dimensions. */
498 TREE_VEC_LENGTH (args
) += TMPL_ARGS_DEPTH (extra_args
);
503 /* Return the N levels of innermost template arguments from the ARGS. */
506 get_innermost_template_args (tree args
, int n
)
514 /* If N is 1, just return the innermost set of template arguments. */
516 return TMPL_ARGS_LEVEL (args
, TMPL_ARGS_DEPTH (args
));
518 /* If we're not removing anything, just return the arguments we were
520 extra_levels
= TMPL_ARGS_DEPTH (args
) - n
;
521 gcc_assert (extra_levels
>= 0);
522 if (extra_levels
== 0)
525 /* Make a new set of arguments, not containing the outer arguments. */
526 new_args
= make_tree_vec (n
);
527 for (i
= 1; i
<= n
; ++i
)
528 SET_TMPL_ARGS_LEVEL (new_args
, i
,
529 TMPL_ARGS_LEVEL (args
, i
+ extra_levels
));
534 /* The inverse of get_innermost_template_args: Return all but the innermost
535 EXTRA_LEVELS levels of template arguments from the ARGS. */
538 strip_innermost_template_args (tree args
, int extra_levels
)
541 int n
= TMPL_ARGS_DEPTH (args
) - extra_levels
;
546 /* If N is 1, just return the outermost set of template arguments. */
548 return TMPL_ARGS_LEVEL (args
, 1);
550 /* If we're not removing anything, just return the arguments we were
552 gcc_assert (extra_levels
>= 0);
553 if (extra_levels
== 0)
556 /* Make a new set of arguments, not containing the inner arguments. */
557 new_args
= make_tree_vec (n
);
558 for (i
= 1; i
<= n
; ++i
)
559 SET_TMPL_ARGS_LEVEL (new_args
, i
,
560 TMPL_ARGS_LEVEL (args
, i
));
565 /* We've got a template header coming up; push to a new level for storing
569 begin_template_parm_list (void)
571 /* We use a non-tag-transparent scope here, which causes pushtag to
572 put tags in this scope, rather than in the enclosing class or
573 namespace scope. This is the right thing, since we want
574 TEMPLATE_DECLS, and not TYPE_DECLS for template classes. For a
575 global template class, push_template_decl handles putting the
576 TEMPLATE_DECL into top-level scope. For a nested template class,
579 template <class T> struct S1 {
580 template <class T> struct S2 {};
583 pushtag contains special code to call pushdecl_with_scope on the
584 TEMPLATE_DECL for S2. */
585 begin_scope (sk_template_parms
, NULL
);
586 ++processing_template_decl
;
587 ++processing_template_parmlist
;
588 note_template_header (0);
591 /* This routine is called when a specialization is declared. If it is
592 invalid to declare a specialization here, an error is reported and
593 false is returned, otherwise this routine will return true. */
596 check_specialization_scope (void)
598 tree scope
= current_scope ();
602 An explicit specialization shall be declared in the namespace of
603 which the template is a member, or, for member templates, in the
604 namespace of which the enclosing class or enclosing class
605 template is a member. An explicit specialization of a member
606 function, member class or static data member of a class template
607 shall be declared in the namespace of which the class template
609 if (scope
&& TREE_CODE (scope
) != NAMESPACE_DECL
)
611 error ("explicit specialization in non-namespace scope %qD", scope
);
617 In an explicit specialization declaration for a member of a class
618 template or a member template that appears in namespace scope,
619 the member template and some of its enclosing class templates may
620 remain unspecialized, except that the declaration shall not
621 explicitly specialize a class member template if its enclosing
622 class templates are not explicitly specialized as well. */
623 if (current_template_parms
)
625 error ("enclosing class templates are not explicitly specialized");
632 /* We've just seen template <>. */
635 begin_specialization (void)
637 begin_scope (sk_template_spec
, NULL
);
638 note_template_header (1);
639 return check_specialization_scope ();
642 /* Called at then end of processing a declaration preceded by
646 end_specialization (void)
649 reset_specialization ();
652 /* Any template <>'s that we have seen thus far are not referring to a
653 function specialization. */
656 reset_specialization (void)
658 processing_specialization
= 0;
659 template_header_count
= 0;
662 /* We've just seen a template header. If SPECIALIZATION is nonzero,
663 it was of the form template <>. */
666 note_template_header (int specialization
)
668 processing_specialization
= specialization
;
669 template_header_count
++;
672 /* We're beginning an explicit instantiation. */
675 begin_explicit_instantiation (void)
677 gcc_assert (!processing_explicit_instantiation
);
678 processing_explicit_instantiation
= true;
683 end_explicit_instantiation (void)
685 gcc_assert (processing_explicit_instantiation
);
686 processing_explicit_instantiation
= false;
689 /* An explicit specialization or partial specialization TMPL is being
690 declared. Check that the namespace in which the specialization is
691 occurring is permissible. Returns false iff it is invalid to
692 specialize TMPL in the current namespace. */
695 check_specialization_namespace (tree tmpl
)
697 tree tpl_ns
= decl_namespace_context (tmpl
);
701 An explicit specialization shall be declared in the namespace of
702 which the template is a member, or, for member templates, in the
703 namespace of which the enclosing class or enclosing class
704 template is a member. An explicit specialization of a member
705 function, member class or static data member of a class template
706 shall be declared in the namespace of which the class template is
708 if (is_associated_namespace (current_namespace
, tpl_ns
))
709 /* Same or super-using namespace. */
713 permerror (input_location
, "specialization of %qD in different namespace", tmpl
);
714 permerror (input_location
, " from definition of %q+#D", tmpl
);
719 /* SPEC is an explicit instantiation. Check that it is valid to
720 perform this explicit instantiation in the current namespace. */
723 check_explicit_instantiation_namespace (tree spec
)
727 /* DR 275: An explicit instantiation shall appear in an enclosing
728 namespace of its template. */
729 ns
= decl_namespace_context (spec
);
730 if (!is_ancestor (current_namespace
, ns
))
731 permerror (input_location
, "explicit instantiation of %qD in namespace %qD "
732 "(which does not enclose namespace %qD)",
733 spec
, current_namespace
, ns
);
736 /* The TYPE is being declared. If it is a template type, that means it
737 is a partial specialization. Do appropriate error-checking. */
740 maybe_process_partial_specialization (tree type
)
744 if (type
== error_mark_node
)
745 return error_mark_node
;
747 if (TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
749 error ("name of class shadows template template parameter %qD",
751 return error_mark_node
;
754 context
= TYPE_CONTEXT (type
);
756 if (CLASS_TYPE_P (type
) && CLASSTYPE_USE_TEMPLATE (type
))
758 /* This is for ordinary explicit specialization and partial
759 specialization of a template class such as:
761 template <> class C<int>;
765 template <class T> class C<T*>;
767 Make sure that `C<int>' and `C<T*>' are implicit instantiations. */
769 if (CLASSTYPE_IMPLICIT_INSTANTIATION (type
)
770 && !COMPLETE_TYPE_P (type
))
772 check_specialization_namespace (CLASSTYPE_TI_TEMPLATE (type
));
773 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type
);
774 if (processing_template_decl
)
776 if (push_template_decl (TYPE_MAIN_DECL (type
))
778 return error_mark_node
;
781 else if (CLASSTYPE_TEMPLATE_INSTANTIATION (type
))
782 error ("specialization of %qT after instantiation", type
);
784 else if (CLASS_TYPE_P (type
)
785 && !CLASSTYPE_USE_TEMPLATE (type
)
786 && CLASSTYPE_TEMPLATE_INFO (type
)
787 && context
&& CLASS_TYPE_P (context
)
788 && CLASSTYPE_TEMPLATE_INFO (context
))
790 /* This is for an explicit specialization of member class
791 template according to [temp.expl.spec/18]:
793 template <> template <class U> class C<int>::D;
795 The context `C<int>' must be an implicit instantiation.
796 Otherwise this is just a member class template declared
799 template <> class C<int> { template <class U> class D; };
800 template <> template <class U> class C<int>::D;
802 In the first case, `C<int>::D' is a specialization of `C<T>::D'
803 while in the second case, `C<int>::D' is a primary template
804 and `C<T>::D' may not exist. */
806 if (CLASSTYPE_IMPLICIT_INSTANTIATION (context
)
807 && !COMPLETE_TYPE_P (type
))
811 if (current_namespace
812 != decl_namespace_context (CLASSTYPE_TI_TEMPLATE (type
)))
814 permerror (input_location
, "specializing %q#T in different namespace", type
);
815 permerror (input_location
, " from definition of %q+#D",
816 CLASSTYPE_TI_TEMPLATE (type
));
819 /* Check for invalid specialization after instantiation:
821 template <> template <> class C<int>::D<int>;
822 template <> template <class U> class C<int>::D; */
824 for (t
= DECL_TEMPLATE_INSTANTIATIONS
825 (most_general_template (CLASSTYPE_TI_TEMPLATE (type
)));
826 t
; t
= TREE_CHAIN (t
))
827 if (TREE_VALUE (t
) != type
828 && TYPE_CONTEXT (TREE_VALUE (t
)) == context
)
829 error ("specialization %qT after instantiation %qT",
830 type
, TREE_VALUE (t
));
832 /* Mark TYPE as a specialization. And as a result, we only
833 have one level of template argument for the innermost
835 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type
);
836 CLASSTYPE_TI_ARGS (type
)
837 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type
));
840 else if (processing_specialization
)
842 error ("explicit specialization of non-template %qT", type
);
843 return error_mark_node
;
849 /* Returns nonzero if we can optimize the retrieval of specializations
850 for TMPL, a TEMPLATE_DECL. In particular, for such a template, we
851 do not use DECL_TEMPLATE_SPECIALIZATIONS at all. */
854 optimize_specialization_lookup_p (tree tmpl
)
856 return (DECL_FUNCTION_TEMPLATE_P (tmpl
)
857 && DECL_CLASS_SCOPE_P (tmpl
)
858 /* DECL_CLASS_SCOPE_P holds of T::f even if T is a template
860 && CLASS_TYPE_P (DECL_CONTEXT (tmpl
))
861 /* The optimized lookup depends on the fact that the
862 template arguments for the member function template apply
863 purely to the containing class, which is not true if the
864 containing class is an explicit or partial
866 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (tmpl
))
867 && !DECL_MEMBER_TEMPLATE_P (tmpl
)
868 && !DECL_CONV_FN_P (tmpl
)
869 /* It is possible to have a template that is not a member
870 template and is not a member of a template class:
872 template <typename T>
873 struct S { friend A::f(); };
875 Here, the friend function is a template, but the context does
876 not have template information. The optimized lookup relies
877 on having ARGS be the template arguments for both the class
878 and the function template. */
879 && !DECL_FRIEND_P (DECL_TEMPLATE_RESULT (tmpl
)));
882 /* Retrieve the specialization (in the sense of [temp.spec] - a
883 specialization is either an instantiation or an explicit
884 specialization) of TMPL for the given template ARGS. If there is
885 no such specialization, return NULL_TREE. The ARGS are a vector of
886 arguments, or a vector of vectors of arguments, in the case of
887 templates with more than one level of parameters.
889 If TMPL is a type template and CLASS_SPECIALIZATIONS_P is true,
890 then we search for a partial specialization matching ARGS. This
891 parameter is ignored if TMPL is not a class template. */
894 retrieve_specialization (tree tmpl
, tree args
,
895 bool class_specializations_p
)
897 if (args
== error_mark_node
)
900 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
);
902 /* There should be as many levels of arguments as there are
903 levels of parameters. */
904 gcc_assert (TMPL_ARGS_DEPTH (args
)
905 == TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
)));
907 if (optimize_specialization_lookup_p (tmpl
))
910 tree class_specialization
;
911 VEC(tree
,gc
) *methods
;
915 /* The template arguments actually apply to the containing
916 class. Find the class specialization with those
918 class_template
= CLASSTYPE_TI_TEMPLATE (DECL_CONTEXT (tmpl
));
920 = retrieve_specialization (class_template
, args
,
921 /*class_specializations_p=*/false);
922 if (!class_specialization
)
924 /* Now, find the appropriate entry in the CLASSTYPE_METHOD_VEC
925 for the specialization. */
926 idx
= class_method_index_for_fn (class_specialization
, tmpl
);
929 /* Iterate through the methods with the indicated name, looking
930 for the one that has an instance of TMPL. */
931 methods
= CLASSTYPE_METHOD_VEC (class_specialization
);
932 for (fns
= VEC_index (tree
, methods
, idx
); fns
; fns
= OVL_NEXT (fns
))
934 tree fn
= OVL_CURRENT (fns
);
935 if (DECL_TEMPLATE_INFO (fn
) && DECL_TI_TEMPLATE (fn
) == tmpl
)
945 /* Class templates store their instantiations on the
946 DECL_TEMPLATE_INSTANTIATIONS list; other templates use the
947 DECL_TEMPLATE_SPECIALIZATIONS list. */
948 if (!class_specializations_p
949 && TREE_CODE (DECL_TEMPLATE_RESULT (tmpl
)) == TYPE_DECL
950 && TAGGED_TYPE_P (TREE_TYPE (tmpl
)))
951 sp
= &DECL_TEMPLATE_INSTANTIATIONS (tmpl
);
953 sp
= &DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
955 /* Iterate through the list until we find a matching template. */
956 while (*sp
!= NULL_TREE
)
960 if (comp_template_args (TREE_PURPOSE (spec
), args
))
962 /* Use the move-to-front heuristic to speed up future
966 *sp
= TREE_CHAIN (*sp
);
967 TREE_CHAIN (spec
) = *head
;
970 return TREE_VALUE (spec
);
972 sp
= &TREE_CHAIN (spec
);
979 /* Like retrieve_specialization, but for local declarations. */
982 retrieve_local_specialization (tree tmpl
)
986 if (local_specializations
== NULL
)
989 spec
= (tree
) htab_find_with_hash (local_specializations
, tmpl
,
990 htab_hash_pointer (tmpl
));
991 return spec
? TREE_PURPOSE (spec
) : NULL_TREE
;
994 /* Returns nonzero iff DECL is a specialization of TMPL. */
997 is_specialization_of (tree decl
, tree tmpl
)
1001 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1005 t
= DECL_TEMPLATE_INFO (t
) ? DECL_TI_TEMPLATE (t
) : NULL_TREE
)
1011 gcc_assert (TREE_CODE (decl
) == TYPE_DECL
);
1013 for (t
= TREE_TYPE (decl
);
1015 t
= CLASSTYPE_USE_TEMPLATE (t
)
1016 ? TREE_TYPE (CLASSTYPE_TI_TEMPLATE (t
)) : NULL_TREE
)
1017 if (same_type_ignoring_top_level_qualifiers_p (t
, TREE_TYPE (tmpl
)))
1024 /* Returns nonzero iff DECL is a specialization of friend declaration
1025 FRIEND_DECL according to [temp.friend]. */
1028 is_specialization_of_friend (tree decl
, tree friend_decl
)
1030 bool need_template
= true;
1033 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
1034 || TREE_CODE (decl
) == TYPE_DECL
);
1036 /* For [temp.friend/6] when FRIEND_DECL is an ordinary member function
1037 of a template class, we want to check if DECL is a specialization
1039 if (TREE_CODE (friend_decl
) == FUNCTION_DECL
1040 && DECL_TEMPLATE_INFO (friend_decl
)
1041 && !DECL_USE_TEMPLATE (friend_decl
))
1043 /* We want a TEMPLATE_DECL for `is_specialization_of'. */
1044 friend_decl
= DECL_TI_TEMPLATE (friend_decl
);
1045 need_template
= false;
1047 else if (TREE_CODE (friend_decl
) == TEMPLATE_DECL
1048 && !PRIMARY_TEMPLATE_P (friend_decl
))
1049 need_template
= false;
1051 /* There is nothing to do if this is not a template friend. */
1052 if (TREE_CODE (friend_decl
) != TEMPLATE_DECL
)
1055 if (is_specialization_of (decl
, friend_decl
))
1059 A member of a class template may be declared to be a friend of a
1060 non-template class. In this case, the corresponding member of
1061 every specialization of the class template is a friend of the
1062 class granting friendship.
1064 For example, given a template friend declaration
1066 template <class T> friend void A<T>::f();
1068 the member function below is considered a friend
1070 template <> struct A<int> {
1074 For this type of template friend, TEMPLATE_DEPTH below will be
1075 nonzero. To determine if DECL is a friend of FRIEND, we first
1076 check if the enclosing class is a specialization of another. */
1078 template_depth
= template_class_depth (DECL_CONTEXT (friend_decl
));
1080 && DECL_CLASS_SCOPE_P (decl
)
1081 && is_specialization_of (TYPE_NAME (DECL_CONTEXT (decl
)),
1082 CLASSTYPE_TI_TEMPLATE (DECL_CONTEXT (friend_decl
))))
1084 /* Next, we check the members themselves. In order to handle
1085 a few tricky cases, such as when FRIEND_DECL's are
1087 template <class T> friend void A<T>::g(T t);
1088 template <class T> template <T t> friend void A<T>::h();
1092 void A<int>::g(int);
1093 template <int> void A<int>::h();
1095 we need to figure out ARGS, the template arguments from
1096 the context of DECL. This is required for template substitution
1097 of `T' in the function parameter of `g' and template parameter
1098 of `h' in the above examples. Here ARGS corresponds to `int'. */
1100 tree context
= DECL_CONTEXT (decl
);
1101 tree args
= NULL_TREE
;
1102 int current_depth
= 0;
1104 while (current_depth
< template_depth
)
1106 if (CLASSTYPE_TEMPLATE_INFO (context
))
1108 if (current_depth
== 0)
1109 args
= TYPE_TI_ARGS (context
);
1111 args
= add_to_template_args (TYPE_TI_ARGS (context
), args
);
1114 context
= TYPE_CONTEXT (context
);
1117 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1122 tree friend_args_type
;
1123 tree decl_args_type
;
1125 /* Make sure that both DECL and FRIEND_DECL are templates or
1127 is_template
= DECL_TEMPLATE_INFO (decl
)
1128 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl
));
1129 if (need_template
^ is_template
)
1131 else if (is_template
)
1133 /* If both are templates, check template parameter list. */
1135 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_decl
),
1137 if (!comp_template_parms
1138 (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (decl
)),
1142 decl_type
= TREE_TYPE (DECL_TI_TEMPLATE (decl
));
1145 decl_type
= TREE_TYPE (decl
);
1147 friend_type
= tsubst_function_type (TREE_TYPE (friend_decl
), args
,
1148 tf_none
, NULL_TREE
);
1149 if (friend_type
== error_mark_node
)
1152 /* Check if return types match. */
1153 if (!same_type_p (TREE_TYPE (decl_type
), TREE_TYPE (friend_type
)))
1156 /* Check if function parameter types match, ignoring the
1157 `this' parameter. */
1158 friend_args_type
= TYPE_ARG_TYPES (friend_type
);
1159 decl_args_type
= TYPE_ARG_TYPES (decl_type
);
1160 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (friend_decl
))
1161 friend_args_type
= TREE_CHAIN (friend_args_type
);
1162 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1163 decl_args_type
= TREE_CHAIN (decl_args_type
);
1165 return compparms (decl_args_type
, friend_args_type
);
1169 /* DECL is a TYPE_DECL */
1171 tree decl_type
= TREE_TYPE (decl
);
1173 /* Make sure that both DECL and FRIEND_DECL are templates or
1176 = CLASSTYPE_TEMPLATE_INFO (decl_type
)
1177 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (decl_type
));
1179 if (need_template
^ is_template
)
1181 else if (is_template
)
1184 /* If both are templates, check the name of the two
1185 TEMPLATE_DECL's first because is_friend didn't. */
1186 if (DECL_NAME (CLASSTYPE_TI_TEMPLATE (decl_type
))
1187 != DECL_NAME (friend_decl
))
1190 /* Now check template parameter list. */
1192 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_decl
),
1194 return comp_template_parms
1195 (DECL_TEMPLATE_PARMS (CLASSTYPE_TI_TEMPLATE (decl_type
)),
1199 return (DECL_NAME (decl
)
1200 == DECL_NAME (friend_decl
));
1206 /* Register the specialization SPEC as a specialization of TMPL with
1207 the indicated ARGS. IS_FRIEND indicates whether the specialization
1208 is actually just a friend declaration. Returns SPEC, or an
1209 equivalent prior declaration, if available. */
1212 register_specialization (tree spec
, tree tmpl
, tree args
, bool is_friend
)
1216 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
);
1218 if (TREE_CODE (spec
) == FUNCTION_DECL
1219 && uses_template_parms (DECL_TI_ARGS (spec
)))
1220 /* This is the FUNCTION_DECL for a partial instantiation. Don't
1221 register it; we want the corresponding TEMPLATE_DECL instead.
1222 We use `uses_template_parms (DECL_TI_ARGS (spec))' rather than
1223 the more obvious `uses_template_parms (spec)' to avoid problems
1224 with default function arguments. In particular, given
1225 something like this:
1227 template <class T> void f(T t1, T t = T())
1229 the default argument expression is not substituted for in an
1230 instantiation unless and until it is actually needed. */
1233 fn
= retrieve_specialization (tmpl
, args
,
1234 /*class_specializations_p=*/false);
1235 /* We can sometimes try to re-register a specialization that we've
1236 already got. In particular, regenerate_decl_from_template calls
1237 duplicate_decls which will update the specialization list. But,
1238 we'll still get called again here anyhow. It's more convenient
1239 to simply allow this than to try to prevent it. */
1242 else if (fn
&& DECL_TEMPLATE_SPECIALIZATION (spec
))
1244 if (DECL_TEMPLATE_INSTANTIATION (fn
))
1247 || DECL_EXPLICIT_INSTANTIATION (fn
))
1249 error ("specialization of %qD after instantiation",
1251 return error_mark_node
;
1256 /* This situation should occur only if the first
1257 specialization is an implicit instantiation, the
1258 second is an explicit specialization, and the
1259 implicit instantiation has not yet been used. That
1260 situation can occur if we have implicitly
1261 instantiated a member function and then specialized
1264 We can also wind up here if a friend declaration that
1265 looked like an instantiation turns out to be a
1268 template <class T> void foo(T);
1269 class S { friend void foo<>(int) };
1270 template <> void foo(int);
1272 We transform the existing DECL in place so that any
1273 pointers to it become pointers to the updated
1276 If there was a definition for the template, but not
1277 for the specialization, we want this to look as if
1278 there were no definition, and vice versa. */
1279 DECL_INITIAL (fn
) = NULL_TREE
;
1280 duplicate_decls (spec
, fn
, is_friend
);
1281 /* The call to duplicate_decls will have applied
1284 An explicit specialization of a function template
1285 is inline only if it is explicitly declared to be,
1286 and independently of whether its function template
1289 to the primary function; now copy the inline bits to
1290 the various clones. */
1291 FOR_EACH_CLONE (clone
, fn
)
1292 DECL_DECLARED_INLINE_P (clone
)
1293 = DECL_DECLARED_INLINE_P (fn
);
1294 check_specialization_namespace (fn
);
1299 else if (DECL_TEMPLATE_SPECIALIZATION (fn
))
1301 if (!duplicate_decls (spec
, fn
, is_friend
) && DECL_INITIAL (spec
))
1302 /* Dup decl failed, but this is a new definition. Set the
1303 line number so any errors match this new
1305 DECL_SOURCE_LOCATION (fn
) = DECL_SOURCE_LOCATION (spec
);
1311 /* A specialization must be declared in the same namespace as the
1312 template it is specializing. */
1313 if (DECL_TEMPLATE_SPECIALIZATION (spec
)
1314 && !check_specialization_namespace (tmpl
))
1315 DECL_CONTEXT (spec
) = FROB_CONTEXT (decl_namespace_context (tmpl
));
1317 if (!optimize_specialization_lookup_p (tmpl
))
1318 DECL_TEMPLATE_SPECIALIZATIONS (tmpl
)
1319 = tree_cons (args
, spec
, DECL_TEMPLATE_SPECIALIZATIONS (tmpl
));
1324 /* Unregister the specialization SPEC as a specialization of TMPL.
1325 Replace it with NEW_SPEC, if NEW_SPEC is non-NULL. Returns true
1326 if the SPEC was listed as a specialization of TMPL. */
1329 reregister_specialization (tree spec
, tree tmpl
, tree new_spec
)
1333 for (s
= &DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
1335 s
= &TREE_CHAIN (*s
))
1336 if (TREE_VALUE (*s
) == spec
)
1339 *s
= TREE_CHAIN (*s
);
1341 TREE_VALUE (*s
) = new_spec
;
1348 /* Compare an entry in the local specializations hash table P1 (which
1349 is really a pointer to a TREE_LIST) with P2 (which is really a
1353 eq_local_specializations (const void *p1
, const void *p2
)
1355 return TREE_VALUE ((const_tree
) p1
) == (const_tree
) p2
;
1358 /* Hash P1, an entry in the local specializations table. */
1361 hash_local_specialization (const void* p1
)
1363 return htab_hash_pointer (TREE_VALUE ((const_tree
) p1
));
1366 /* Like register_specialization, but for local declarations. We are
1367 registering SPEC, an instantiation of TMPL. */
1370 register_local_specialization (tree spec
, tree tmpl
)
1374 slot
= htab_find_slot_with_hash (local_specializations
, tmpl
,
1375 htab_hash_pointer (tmpl
), INSERT
);
1376 *slot
= build_tree_list (spec
, tmpl
);
1379 /* TYPE is a class type. Returns true if TYPE is an explicitly
1380 specialized class. */
1383 explicit_class_specialization_p (tree type
)
1385 if (!CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
1387 return !uses_template_parms (CLASSTYPE_TI_ARGS (type
));
1390 /* Print the list of candidate FNS in an error message. */
1393 print_candidates (tree fns
)
1397 const char *str
= "candidates are:";
1399 for (fn
= fns
; fn
!= NULL_TREE
; fn
= TREE_CHAIN (fn
))
1403 for (f
= TREE_VALUE (fn
); f
; f
= OVL_NEXT (f
))
1404 error ("%s %+#D", str
, OVL_CURRENT (f
));
1409 /* Returns the template (one of the functions given by TEMPLATE_ID)
1410 which can be specialized to match the indicated DECL with the
1411 explicit template args given in TEMPLATE_ID. The DECL may be
1412 NULL_TREE if none is available. In that case, the functions in
1413 TEMPLATE_ID are non-members.
1415 If NEED_MEMBER_TEMPLATE is nonzero the function is known to be a
1416 specialization of a member template.
1418 The TEMPLATE_COUNT is the number of references to qualifying
1419 template classes that appeared in the name of the function. See
1420 check_explicit_specialization for a more accurate description.
1422 TSK indicates what kind of template declaration (if any) is being
1423 declared. TSK_TEMPLATE indicates that the declaration given by
1424 DECL, though a FUNCTION_DECL, has template parameters, and is
1425 therefore a template function.
1427 The template args (those explicitly specified and those deduced)
1428 are output in a newly created vector *TARGS_OUT.
1430 If it is impossible to determine the result, an error message is
1431 issued. The error_mark_node is returned to indicate failure. */
1434 determine_specialization (tree template_id
,
1437 int need_member_template
,
1443 tree explicit_targs
;
1444 tree candidates
= NULL_TREE
;
1445 /* A TREE_LIST of templates of which DECL may be a specialization.
1446 The TREE_VALUE of each node is a TEMPLATE_DECL. The
1447 corresponding TREE_PURPOSE is the set of template arguments that,
1448 when used to instantiate the template, would produce a function
1449 with the signature of DECL. */
1450 tree templates
= NULL_TREE
;
1452 struct cp_binding_level
*b
;
1454 *targs_out
= NULL_TREE
;
1456 if (template_id
== error_mark_node
|| decl
== error_mark_node
)
1457 return error_mark_node
;
1459 fns
= TREE_OPERAND (template_id
, 0);
1460 explicit_targs
= TREE_OPERAND (template_id
, 1);
1462 if (fns
== error_mark_node
)
1463 return error_mark_node
;
1465 /* Check for baselinks. */
1466 if (BASELINK_P (fns
))
1467 fns
= BASELINK_FUNCTIONS (fns
);
1469 if (!is_overloaded_fn (fns
))
1471 error ("%qD is not a function template", fns
);
1472 return error_mark_node
;
1475 /* Count the number of template headers specified for this
1478 for (b
= current_binding_level
;
1479 b
->kind
== sk_template_parms
;
1483 for (; fns
; fns
= OVL_NEXT (fns
))
1485 tree fn
= OVL_CURRENT (fns
);
1487 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
1489 tree decl_arg_types
;
1492 /* In case of explicit specialization, we need to check if
1493 the number of template headers appearing in the specialization
1494 is correct. This is usually done in check_explicit_specialization,
1495 but the check done there cannot be exhaustive when specializing
1496 member functions. Consider the following code:
1498 template <> void A<int>::f(int);
1499 template <> template <> void A<int>::f(int);
1501 Assuming that A<int> is not itself an explicit specialization
1502 already, the first line specializes "f" which is a non-template
1503 member function, whilst the second line specializes "f" which
1504 is a template member function. So both lines are syntactically
1505 correct, and check_explicit_specialization does not reject
1508 Here, we can do better, as we are matching the specialization
1509 against the declarations. We count the number of template
1510 headers, and we check if they match TEMPLATE_COUNT + 1
1511 (TEMPLATE_COUNT is the number of qualifying template classes,
1512 plus there must be another header for the member template
1515 Notice that if header_count is zero, this is not a
1516 specialization but rather a template instantiation, so there
1517 is no check we can perform here. */
1518 if (header_count
&& header_count
!= template_count
+ 1)
1521 /* Check that the number of template arguments at the
1522 innermost level for DECL is the same as for FN. */
1523 if (current_binding_level
->kind
== sk_template_parms
1524 && !current_binding_level
->explicit_spec_p
1525 && (TREE_VEC_LENGTH (DECL_INNERMOST_TEMPLATE_PARMS (fn
))
1526 != TREE_VEC_LENGTH (INNERMOST_TEMPLATE_PARMS
1527 (current_template_parms
))))
1530 /* DECL might be a specialization of FN. */
1531 decl_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
1532 fn_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
1534 /* For a non-static member function, we need to make sure
1535 that the const qualification is the same. Since
1536 get_bindings does not try to merge the "this" parameter,
1537 we must do the comparison explicitly. */
1538 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
1539 && !same_type_p (TREE_VALUE (fn_arg_types
),
1540 TREE_VALUE (decl_arg_types
)))
1543 /* Skip the "this" parameter and, for constructors of
1544 classes with virtual bases, the VTT parameter. A
1545 full specialization of a constructor will have a VTT
1546 parameter, but a template never will. */
1548 = skip_artificial_parms_for (decl
, decl_arg_types
);
1550 = skip_artificial_parms_for (fn
, fn_arg_types
);
1552 /* Check that the number of function parameters matches.
1554 template <class T> void f(int i = 0);
1555 template <> void f<int>();
1556 The specialization f<int> is invalid but is not caught
1557 by get_bindings below. */
1558 if (list_length (fn_arg_types
) != list_length (decl_arg_types
))
1561 /* Function templates cannot be specializations; there are
1562 no partial specializations of functions. Therefore, if
1563 the type of DECL does not match FN, there is no
1565 if (tsk
== tsk_template
)
1567 if (compparms (fn_arg_types
, decl_arg_types
))
1568 candidates
= tree_cons (NULL_TREE
, fn
, candidates
);
1572 /* See whether this function might be a specialization of this
1574 targs
= get_bindings (fn
, decl
, explicit_targs
, /*check_ret=*/true);
1577 /* We cannot deduce template arguments that when used to
1578 specialize TMPL will produce DECL. */
1581 /* Save this template, and the arguments deduced. */
1582 templates
= tree_cons (targs
, fn
, templates
);
1584 else if (need_member_template
)
1585 /* FN is an ordinary member function, and we need a
1586 specialization of a member template. */
1588 else if (TREE_CODE (fn
) != FUNCTION_DECL
)
1589 /* We can get IDENTIFIER_NODEs here in certain erroneous
1592 else if (!DECL_FUNCTION_MEMBER_P (fn
))
1593 /* This is just an ordinary non-member function. Nothing can
1594 be a specialization of that. */
1596 else if (DECL_ARTIFICIAL (fn
))
1597 /* Cannot specialize functions that are created implicitly. */
1601 tree decl_arg_types
;
1603 /* This is an ordinary member function. However, since
1604 we're here, we can assume it's enclosing class is a
1605 template class. For example,
1607 template <typename T> struct S { void f(); };
1608 template <> void S<int>::f() {}
1610 Here, S<int>::f is a non-template, but S<int> is a
1611 template class. If FN has the same type as DECL, we
1612 might be in business. */
1614 if (!DECL_TEMPLATE_INFO (fn
))
1615 /* Its enclosing class is an explicit specialization
1616 of a template class. This is not a candidate. */
1619 if (!same_type_p (TREE_TYPE (TREE_TYPE (decl
)),
1620 TREE_TYPE (TREE_TYPE (fn
))))
1621 /* The return types differ. */
1624 /* Adjust the type of DECL in case FN is a static member. */
1625 decl_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
1626 if (DECL_STATIC_FUNCTION_P (fn
)
1627 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1628 decl_arg_types
= TREE_CHAIN (decl_arg_types
);
1630 if (compparms (TYPE_ARG_TYPES (TREE_TYPE (fn
)),
1633 candidates
= tree_cons (NULL_TREE
, fn
, candidates
);
1637 if (templates
&& TREE_CHAIN (templates
))
1643 It is possible for a specialization with a given function
1644 signature to be instantiated from more than one function
1645 template. In such cases, explicit specification of the
1646 template arguments must be used to uniquely identify the
1647 function template specialization being specialized.
1649 Note that here, there's no suggestion that we're supposed to
1650 determine which of the candidate templates is most
1651 specialized. However, we, also have:
1655 Partial ordering of overloaded function template
1656 declarations is used in the following contexts to select
1657 the function template to which a function template
1658 specialization refers:
1660 -- when an explicit specialization refers to a function
1663 So, we do use the partial ordering rules, at least for now.
1664 This extension can only serve to make invalid programs valid,
1665 so it's safe. And, there is strong anecdotal evidence that
1666 the committee intended the partial ordering rules to apply;
1667 the EDG front end has that behavior, and John Spicer claims
1668 that the committee simply forgot to delete the wording in
1669 [temp.expl.spec]. */
1670 tree tmpl
= most_specialized_instantiation (templates
);
1671 if (tmpl
!= error_mark_node
)
1674 TREE_CHAIN (templates
) = NULL_TREE
;
1678 if (templates
== NULL_TREE
&& candidates
== NULL_TREE
)
1680 error ("template-id %qD for %q+D does not match any template "
1681 "declaration", template_id
, decl
);
1682 return error_mark_node
;
1684 else if ((templates
&& TREE_CHAIN (templates
))
1685 || (candidates
&& TREE_CHAIN (candidates
))
1686 || (templates
&& candidates
))
1688 error ("ambiguous template specialization %qD for %q+D",
1690 chainon (candidates
, templates
);
1691 print_candidates (candidates
);
1692 return error_mark_node
;
1695 /* We have one, and exactly one, match. */
1698 tree fn
= TREE_VALUE (candidates
);
1699 /* DECL is a re-declaration of a template function. */
1700 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
1702 /* It was a specialization of an ordinary member function in a
1704 *targs_out
= copy_node (DECL_TI_ARGS (fn
));
1705 return DECL_TI_TEMPLATE (fn
);
1708 /* It was a specialization of a template. */
1709 targs
= DECL_TI_ARGS (DECL_TEMPLATE_RESULT (TREE_VALUE (templates
)));
1710 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (targs
))
1712 *targs_out
= copy_node (targs
);
1713 SET_TMPL_ARGS_LEVEL (*targs_out
,
1714 TMPL_ARGS_DEPTH (*targs_out
),
1715 TREE_PURPOSE (templates
));
1718 *targs_out
= TREE_PURPOSE (templates
);
1719 return TREE_VALUE (templates
);
1722 /* Returns a chain of parameter types, exactly like the SPEC_TYPES,
1723 but with the default argument values filled in from those in the
1727 copy_default_args_to_explicit_spec_1 (tree spec_types
,
1730 tree new_spec_types
;
1735 if (spec_types
== void_list_node
)
1736 return void_list_node
;
1738 /* Substitute into the rest of the list. */
1740 copy_default_args_to_explicit_spec_1 (TREE_CHAIN (spec_types
),
1741 TREE_CHAIN (tmpl_types
));
1743 /* Add the default argument for this parameter. */
1744 return hash_tree_cons (TREE_PURPOSE (tmpl_types
),
1745 TREE_VALUE (spec_types
),
1749 /* DECL is an explicit specialization. Replicate default arguments
1750 from the template it specializes. (That way, code like:
1752 template <class T> void f(T = 3);
1753 template <> void f(double);
1756 works, as required.) An alternative approach would be to look up
1757 the correct default arguments at the call-site, but this approach
1758 is consistent with how implicit instantiations are handled. */
1761 copy_default_args_to_explicit_spec (tree decl
)
1766 tree new_spec_types
;
1770 tree object_type
= NULL_TREE
;
1771 tree in_charge
= NULL_TREE
;
1772 tree vtt
= NULL_TREE
;
1774 /* See if there's anything we need to do. */
1775 tmpl
= DECL_TI_TEMPLATE (decl
);
1776 tmpl_types
= TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (tmpl
)));
1777 for (t
= tmpl_types
; t
; t
= TREE_CHAIN (t
))
1778 if (TREE_PURPOSE (t
))
1783 old_type
= TREE_TYPE (decl
);
1784 spec_types
= TYPE_ARG_TYPES (old_type
);
1786 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1788 /* Remove the this pointer, but remember the object's type for
1790 object_type
= TREE_TYPE (TREE_VALUE (spec_types
));
1791 spec_types
= TREE_CHAIN (spec_types
);
1792 tmpl_types
= TREE_CHAIN (tmpl_types
);
1794 if (DECL_HAS_IN_CHARGE_PARM_P (decl
))
1796 /* DECL may contain more parameters than TMPL due to the extra
1797 in-charge parameter in constructors and destructors. */
1798 in_charge
= spec_types
;
1799 spec_types
= TREE_CHAIN (spec_types
);
1801 if (DECL_HAS_VTT_PARM_P (decl
))
1804 spec_types
= TREE_CHAIN (spec_types
);
1808 /* Compute the merged default arguments. */
1810 copy_default_args_to_explicit_spec_1 (spec_types
, tmpl_types
);
1812 /* Compute the new FUNCTION_TYPE. */
1816 new_spec_types
= hash_tree_cons (TREE_PURPOSE (vtt
),
1821 /* Put the in-charge parameter back. */
1822 new_spec_types
= hash_tree_cons (TREE_PURPOSE (in_charge
),
1823 TREE_VALUE (in_charge
),
1826 new_type
= build_method_type_directly (object_type
,
1827 TREE_TYPE (old_type
),
1831 new_type
= build_function_type (TREE_TYPE (old_type
),
1833 new_type
= cp_build_type_attribute_variant (new_type
,
1834 TYPE_ATTRIBUTES (old_type
));
1835 new_type
= build_exception_variant (new_type
,
1836 TYPE_RAISES_EXCEPTIONS (old_type
));
1837 TREE_TYPE (decl
) = new_type
;
1840 /* Check to see if the function just declared, as indicated in
1841 DECLARATOR, and in DECL, is a specialization of a function
1842 template. We may also discover that the declaration is an explicit
1843 instantiation at this point.
1845 Returns DECL, or an equivalent declaration that should be used
1846 instead if all goes well. Issues an error message if something is
1847 amiss. Returns error_mark_node if the error is not easily
1850 FLAGS is a bitmask consisting of the following flags:
1852 2: The function has a definition.
1853 4: The function is a friend.
1855 The TEMPLATE_COUNT is the number of references to qualifying
1856 template classes that appeared in the name of the function. For
1859 template <class T> struct S { void f(); };
1862 the TEMPLATE_COUNT would be 1. However, explicitly specialized
1863 classes are not counted in the TEMPLATE_COUNT, so that in
1865 template <class T> struct S {};
1866 template <> struct S<int> { void f(); }
1867 template <> void S<int>::f();
1869 the TEMPLATE_COUNT would be 0. (Note that this declaration is
1870 invalid; there should be no template <>.)
1872 If the function is a specialization, it is marked as such via
1873 DECL_TEMPLATE_SPECIALIZATION. Furthermore, its DECL_TEMPLATE_INFO
1874 is set up correctly, and it is added to the list of specializations
1875 for that template. */
1878 check_explicit_specialization (tree declarator
,
1883 int have_def
= flags
& 2;
1884 int is_friend
= flags
& 4;
1885 int specialization
= 0;
1886 int explicit_instantiation
= 0;
1887 int member_specialization
= 0;
1888 tree ctype
= DECL_CLASS_CONTEXT (decl
);
1889 tree dname
= DECL_NAME (decl
);
1894 if (!processing_specialization
)
1897 tsk
= tsk_excessive_parms
;
1900 tsk
= current_tmpl_spec_kind (template_count
);
1905 if (processing_specialization
)
1908 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
1910 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
1913 /* This could be something like:
1915 template <class T> void f(T);
1916 class S { friend void f<>(int); } */
1920 /* This case handles bogus declarations like template <>
1921 template <class T> void f<int>(); */
1923 error ("template-id %qD in declaration of primary template",
1930 case tsk_invalid_member_spec
:
1931 /* The error has already been reported in
1932 check_specialization_scope. */
1933 return error_mark_node
;
1935 case tsk_invalid_expl_inst
:
1936 error ("template parameter list used in explicit instantiation");
1942 error ("definition provided for explicit instantiation");
1944 explicit_instantiation
= 1;
1947 case tsk_excessive_parms
:
1948 case tsk_insufficient_parms
:
1949 if (tsk
== tsk_excessive_parms
)
1950 error ("too many template parameter lists in declaration of %qD",
1952 else if (template_header_count
)
1953 error("too few template parameter lists in declaration of %qD", decl
);
1955 error("explicit specialization of %qD must be introduced by "
1956 "%<template <>%>", decl
);
1960 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
1962 member_specialization
= 1;
1968 if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
1970 /* This case handles bogus declarations like template <>
1971 template <class T> void f<int>(); */
1973 if (uses_template_parms (declarator
))
1974 error ("function template partial specialization %qD "
1975 "is not allowed", declarator
);
1977 error ("template-id %qD in declaration of primary template",
1982 if (ctype
&& CLASSTYPE_TEMPLATE_INSTANTIATION (ctype
))
1983 /* This is a specialization of a member template, without
1984 specialization the containing class. Something like:
1986 template <class T> struct S {
1987 template <class U> void f (U);
1989 template <> template <class U> void S<int>::f(U) {}
1991 That's a specialization -- but of the entire template. */
1999 if (specialization
|| member_specialization
)
2001 tree t
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
2002 for (; t
; t
= TREE_CHAIN (t
))
2003 if (TREE_PURPOSE (t
))
2005 permerror (input_location
,
2006 "default argument specified in explicit specialization");
2011 if (specialization
|| member_specialization
|| explicit_instantiation
)
2013 tree tmpl
= NULL_TREE
;
2014 tree targs
= NULL_TREE
;
2016 /* Make sure that the declarator is a TEMPLATE_ID_EXPR. */
2017 if (TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
2021 gcc_assert (TREE_CODE (declarator
) == IDENTIFIER_NODE
);
2026 /* If there is no class context, the explicit instantiation
2027 must be at namespace scope. */
2028 gcc_assert (DECL_NAMESPACE_SCOPE_P (decl
));
2030 /* Find the namespace binding, using the declaration
2032 fns
= lookup_qualified_name (CP_DECL_CONTEXT (decl
), dname
,
2034 if (fns
== error_mark_node
|| !is_overloaded_fn (fns
))
2036 error ("%qD is not a template function", dname
);
2037 fns
= error_mark_node
;
2041 tree fn
= OVL_CURRENT (fns
);
2042 if (!is_associated_namespace (CP_DECL_CONTEXT (decl
),
2043 CP_DECL_CONTEXT (fn
)))
2044 error ("%qD is not declared in %qD",
2045 decl
, current_namespace
);
2049 declarator
= lookup_template_function (fns
, NULL_TREE
);
2052 if (declarator
== error_mark_node
)
2053 return error_mark_node
;
2055 if (ctype
!= NULL_TREE
&& TYPE_BEING_DEFINED (ctype
))
2057 if (!explicit_instantiation
)
2058 /* A specialization in class scope. This is invalid,
2059 but the error will already have been flagged by
2060 check_specialization_scope. */
2061 return error_mark_node
;
2064 /* It's not valid to write an explicit instantiation in
2067 class C { template void f(); }
2069 This case is caught by the parser. However, on
2072 template class C { void f(); };
2074 (which is invalid) we can get here. The error will be
2081 else if (ctype
!= NULL_TREE
2082 && (TREE_CODE (TREE_OPERAND (declarator
, 0)) ==
2085 /* Find the list of functions in ctype that have the same
2086 name as the declared function. */
2087 tree name
= TREE_OPERAND (declarator
, 0);
2088 tree fns
= NULL_TREE
;
2091 if (constructor_name_p (name
, ctype
))
2093 int is_constructor
= DECL_CONSTRUCTOR_P (decl
);
2095 if (is_constructor
? !TYPE_HAS_USER_CONSTRUCTOR (ctype
)
2096 : !CLASSTYPE_DESTRUCTORS (ctype
))
2098 /* From [temp.expl.spec]:
2100 If such an explicit specialization for the member
2101 of a class template names an implicitly-declared
2102 special member function (clause _special_), the
2103 program is ill-formed.
2105 Similar language is found in [temp.explicit]. */
2106 error ("specialization of implicitly-declared special member function");
2107 return error_mark_node
;
2110 name
= is_constructor
? ctor_identifier
: dtor_identifier
;
2113 if (!DECL_CONV_FN_P (decl
))
2115 idx
= lookup_fnfields_1 (ctype
, name
);
2117 fns
= VEC_index (tree
, CLASSTYPE_METHOD_VEC (ctype
), idx
);
2121 VEC(tree
,gc
) *methods
;
2124 /* For a type-conversion operator, we cannot do a
2125 name-based lookup. We might be looking for `operator
2126 int' which will be a specialization of `operator T'.
2127 So, we find *all* the conversion operators, and then
2128 select from them. */
2131 methods
= CLASSTYPE_METHOD_VEC (ctype
);
2133 for (idx
= CLASSTYPE_FIRST_CONVERSION_SLOT
;
2134 VEC_iterate (tree
, methods
, idx
, ovl
);
2137 if (!DECL_CONV_FN_P (OVL_CURRENT (ovl
)))
2138 /* There are no more conversion functions. */
2141 /* Glue all these conversion functions together
2142 with those we already have. */
2143 for (; ovl
; ovl
= OVL_NEXT (ovl
))
2144 fns
= ovl_cons (OVL_CURRENT (ovl
), fns
);
2148 if (fns
== NULL_TREE
)
2150 error ("no member function %qD declared in %qT", name
, ctype
);
2151 return error_mark_node
;
2154 TREE_OPERAND (declarator
, 0) = fns
;
2157 /* Figure out what exactly is being specialized at this point.
2158 Note that for an explicit instantiation, even one for a
2159 member function, we cannot tell apriori whether the
2160 instantiation is for a member template, or just a member
2161 function of a template class. Even if a member template is
2162 being instantiated, the member template arguments may be
2163 elided if they can be deduced from the rest of the
2165 tmpl
= determine_specialization (declarator
, decl
,
2167 member_specialization
,
2171 if (!tmpl
|| tmpl
== error_mark_node
)
2172 /* We couldn't figure out what this declaration was
2174 return error_mark_node
;
2177 tree gen_tmpl
= most_general_template (tmpl
);
2179 if (explicit_instantiation
)
2181 /* We don't set DECL_EXPLICIT_INSTANTIATION here; that
2182 is done by do_decl_instantiation later. */
2184 int arg_depth
= TMPL_ARGS_DEPTH (targs
);
2185 int parm_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
2187 if (arg_depth
> parm_depth
)
2189 /* If TMPL is not the most general template (for
2190 example, if TMPL is a friend template that is
2191 injected into namespace scope), then there will
2192 be too many levels of TARGS. Remove some of them
2197 new_targs
= make_tree_vec (parm_depth
);
2198 for (i
= arg_depth
- parm_depth
; i
< arg_depth
; ++i
)
2199 TREE_VEC_ELT (new_targs
, i
- (arg_depth
- parm_depth
))
2200 = TREE_VEC_ELT (targs
, i
);
2204 return instantiate_template (tmpl
, targs
, tf_error
);
2207 /* If we thought that the DECL was a member function, but it
2208 turns out to be specializing a static member function,
2209 make DECL a static member function as well. */
2210 if (DECL_STATIC_FUNCTION_P (tmpl
)
2211 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
2212 revert_static_member_fn (decl
);
2214 /* If this is a specialization of a member template of a
2215 template class, we want to return the TEMPLATE_DECL, not
2216 the specialization of it. */
2217 if (tsk
== tsk_template
)
2219 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
2220 DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl
)) = NULL_TREE
;
2223 DECL_SOURCE_LOCATION (tmpl
) = DECL_SOURCE_LOCATION (decl
);
2224 DECL_SOURCE_LOCATION (DECL_TEMPLATE_RESULT (tmpl
))
2225 = DECL_SOURCE_LOCATION (decl
);
2226 /* We want to use the argument list specified in the
2227 definition, not in the original declaration. */
2228 DECL_ARGUMENTS (DECL_TEMPLATE_RESULT (tmpl
))
2229 = DECL_ARGUMENTS (decl
);
2234 /* Set up the DECL_TEMPLATE_INFO for DECL. */
2235 DECL_TEMPLATE_INFO (decl
) = tree_cons (tmpl
, targs
, NULL_TREE
);
2237 /* Inherit default function arguments from the template
2238 DECL is specializing. */
2239 copy_default_args_to_explicit_spec (decl
);
2241 /* This specialization has the same protection as the
2242 template it specializes. */
2243 TREE_PRIVATE (decl
) = TREE_PRIVATE (gen_tmpl
);
2244 TREE_PROTECTED (decl
) = TREE_PROTECTED (gen_tmpl
);
2246 /* 7.1.1-1 [dcl.stc]
2248 A storage-class-specifier shall not be specified in an
2249 explicit specialization...
2251 The parser rejects these, so unless action is taken here,
2252 explicit function specializations will always appear with
2255 The action recommended by the C++ CWG in response to C++
2256 defect report 605 is to make the storage class and linkage
2257 of the explicit specialization match the templated function:
2259 http://www.open-std.org/jtc1/sc22/wg21/docs/cwg_active.html#605
2261 if (tsk
== tsk_expl_spec
&& DECL_FUNCTION_TEMPLATE_P (gen_tmpl
))
2263 tree tmpl_func
= DECL_TEMPLATE_RESULT (gen_tmpl
);
2264 gcc_assert (TREE_CODE (tmpl_func
) == FUNCTION_DECL
);
2266 /* This specialization has the same linkage and visibility as
2267 the function template it specializes. */
2268 TREE_PUBLIC (decl
) = TREE_PUBLIC (tmpl_func
);
2269 if (! TREE_PUBLIC (decl
))
2271 DECL_INTERFACE_KNOWN (decl
) = 1;
2272 DECL_NOT_REALLY_EXTERN (decl
) = 1;
2274 DECL_THIS_STATIC (decl
) = DECL_THIS_STATIC (tmpl_func
);
2275 if (DECL_VISIBILITY_SPECIFIED (tmpl_func
))
2277 DECL_VISIBILITY_SPECIFIED (decl
) = 1;
2278 DECL_VISIBILITY (decl
) = DECL_VISIBILITY (tmpl_func
);
2282 /* If DECL is a friend declaration, declared using an
2283 unqualified name, the namespace associated with DECL may
2284 have been set incorrectly. For example, in:
2286 template <typename T> void f(T);
2288 struct S { friend void f<int>(int); }
2291 we will have set the DECL_CONTEXT for the friend
2292 declaration to N, rather than to the global namespace. */
2293 if (DECL_NAMESPACE_SCOPE_P (decl
))
2294 DECL_CONTEXT (decl
) = DECL_CONTEXT (tmpl
);
2296 if (is_friend
&& !have_def
)
2297 /* This is not really a declaration of a specialization.
2298 It's just the name of an instantiation. But, it's not
2299 a request for an instantiation, either. */
2300 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
2301 else if (DECL_CONSTRUCTOR_P (decl
) || DECL_DESTRUCTOR_P (decl
))
2302 /* This is indeed a specialization. In case of constructors
2303 and destructors, we need in-charge and not-in-charge
2304 versions in V3 ABI. */
2305 clone_function_decl (decl
, /*update_method_vec_p=*/0);
2307 /* Register this specialization so that we can find it
2309 decl
= register_specialization (decl
, gen_tmpl
, targs
, is_friend
);
2316 /* Returns 1 iff PARMS1 and PARMS2 are identical sets of template
2317 parameters. These are represented in the same format used for
2318 DECL_TEMPLATE_PARMS. */
2321 comp_template_parms (const_tree parms1
, const_tree parms2
)
2326 if (parms1
== parms2
)
2329 for (p1
= parms1
, p2
= parms2
;
2330 p1
!= NULL_TREE
&& p2
!= NULL_TREE
;
2331 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
))
2333 tree t1
= TREE_VALUE (p1
);
2334 tree t2
= TREE_VALUE (p2
);
2337 gcc_assert (TREE_CODE (t1
) == TREE_VEC
);
2338 gcc_assert (TREE_CODE (t2
) == TREE_VEC
);
2340 if (TREE_VEC_LENGTH (t1
) != TREE_VEC_LENGTH (t2
))
2343 for (i
= 0; i
< TREE_VEC_LENGTH (t2
); ++i
)
2345 tree parm1
= TREE_VALUE (TREE_VEC_ELT (t1
, i
));
2346 tree parm2
= TREE_VALUE (TREE_VEC_ELT (t2
, i
));
2348 /* If either of the template parameters are invalid, assume
2349 they match for the sake of error recovery. */
2350 if (parm1
== error_mark_node
|| parm2
== error_mark_node
)
2353 if (TREE_CODE (parm1
) != TREE_CODE (parm2
))
2356 if (TREE_CODE (parm1
) == TEMPLATE_TYPE_PARM
2357 && (TEMPLATE_TYPE_PARAMETER_PACK (parm1
)
2358 == TEMPLATE_TYPE_PARAMETER_PACK (parm2
)))
2360 else if (!same_type_p (TREE_TYPE (parm1
), TREE_TYPE (parm2
)))
2365 if ((p1
!= NULL_TREE
) != (p2
!= NULL_TREE
))
2366 /* One set of parameters has more parameters lists than the
2373 /* Determine whether PARM is a parameter pack. */
2375 template_parameter_pack_p (const_tree parm
)
2377 /* Determine if we have a non-type template parameter pack. */
2378 if (TREE_CODE (parm
) == PARM_DECL
)
2379 return (DECL_TEMPLATE_PARM_P (parm
)
2380 && TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)));
2382 /* If this is a list of template parameters, we could get a
2383 TYPE_DECL or a TEMPLATE_DECL. */
2384 if (TREE_CODE (parm
) == TYPE_DECL
|| TREE_CODE (parm
) == TEMPLATE_DECL
)
2385 parm
= TREE_TYPE (parm
);
2387 return ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
2388 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
)
2389 && TEMPLATE_TYPE_PARAMETER_PACK (parm
));
2392 /* Determine whether ARGS describes a variadic template args list,
2393 i.e., one that is terminated by a template argument pack. */
2395 template_args_variadic_p (tree args
)
2400 if (args
== NULL_TREE
)
2403 args
= INNERMOST_TEMPLATE_ARGS (args
);
2404 nargs
= TREE_VEC_LENGTH (args
);
2409 last_parm
= TREE_VEC_ELT (args
, nargs
- 1);
2411 return ARGUMENT_PACK_P (last_parm
);
2414 /* Generate a new name for the parameter pack name NAME (an
2415 IDENTIFIER_NODE) that incorporates its */
2417 make_ith_pack_parameter_name (tree name
, int i
)
2419 /* Munge the name to include the parameter index. */
2423 sprintf(numbuf
, "%i", i
);
2424 newname
= (char*)alloca (IDENTIFIER_LENGTH (name
) + strlen(numbuf
) + 2);
2425 sprintf(newname
, "%s#%i", IDENTIFIER_POINTER (name
), i
);
2426 return get_identifier (newname
);
2429 /* Structure used to track the progress of find_parameter_packs_r. */
2430 struct find_parameter_pack_data
2432 /* TREE_LIST that will contain all of the parameter packs found by
2434 tree
* parameter_packs
;
2436 /* Set of AST nodes that have been visited by the traversal. */
2437 struct pointer_set_t
*visited
;
2440 /* Identifies all of the argument packs that occur in a template
2441 argument and appends them to the TREE_LIST inside DATA, which is a
2442 find_parameter_pack_data structure. This is a subroutine of
2443 make_pack_expansion and uses_parameter_packs. */
2445 find_parameter_packs_r (tree
*tp
, int *walk_subtrees
, void* data
)
2448 struct find_parameter_pack_data
* ppd
=
2449 (struct find_parameter_pack_data
*)data
;
2450 bool parameter_pack_p
= false;
2452 /* Identify whether this is a parameter pack or not. */
2453 switch (TREE_CODE (t
))
2455 case TEMPLATE_PARM_INDEX
:
2456 if (TEMPLATE_PARM_PARAMETER_PACK (t
))
2457 parameter_pack_p
= true;
2460 case TEMPLATE_TYPE_PARM
:
2461 case TEMPLATE_TEMPLATE_PARM
:
2462 if (TEMPLATE_TYPE_PARAMETER_PACK (t
))
2463 parameter_pack_p
= true;
2467 if (FUNCTION_PARAMETER_PACK_P (t
))
2469 /* We don't want to walk into the type of a PARM_DECL,
2470 because we don't want to see the type parameter pack. */
2472 parameter_pack_p
= true;
2477 /* Not a parameter pack. */
2481 if (parameter_pack_p
)
2483 /* Add this parameter pack to the list. */
2484 *ppd
->parameter_packs
= tree_cons (NULL_TREE
, t
, *ppd
->parameter_packs
);
2488 cp_walk_tree (&TYPE_CONTEXT (t
),
2489 &find_parameter_packs_r
, ppd
, ppd
->visited
);
2491 /* This switch statement will return immediately if we don't find a
2493 switch (TREE_CODE (t
))
2495 case TEMPLATE_PARM_INDEX
:
2498 case BOUND_TEMPLATE_TEMPLATE_PARM
:
2499 /* Check the template itself. */
2500 cp_walk_tree (&TREE_TYPE (TYPE_TI_TEMPLATE (t
)),
2501 &find_parameter_packs_r
, ppd
, ppd
->visited
);
2502 /* Check the template arguments. */
2503 cp_walk_tree (&TYPE_TI_ARGS (t
), &find_parameter_packs_r
, ppd
,
2508 case TEMPLATE_TYPE_PARM
:
2509 case TEMPLATE_TEMPLATE_PARM
:
2516 if (TYPE_PTRMEMFUNC_P (t
))
2522 if (TYPE_TEMPLATE_INFO (t
))
2523 cp_walk_tree (&TREE_VALUE (TYPE_TEMPLATE_INFO (t
)),
2524 &find_parameter_packs_r
, ppd
, ppd
->visited
);
2530 cp_walk_tree (&TREE_TYPE (t
),
2531 &find_parameter_packs_r
, ppd
, ppd
->visited
);
2535 cp_walk_tree (&TYPENAME_TYPE_FULLNAME (t
), &find_parameter_packs_r
,
2540 case TYPE_PACK_EXPANSION
:
2541 case EXPR_PACK_EXPANSION
:
2546 cp_walk_tree (&TYPE_MAX_VALUE (t
), &find_parameter_packs_r
,
2551 case IDENTIFIER_NODE
:
2552 cp_walk_tree (&TREE_TYPE (t
), &find_parameter_packs_r
, ppd
,
2564 /* Determines if the expression or type T uses any parameter packs. */
2566 uses_parameter_packs (tree t
)
2568 tree parameter_packs
= NULL_TREE
;
2569 struct find_parameter_pack_data ppd
;
2570 ppd
.parameter_packs
= ¶meter_packs
;
2571 ppd
.visited
= pointer_set_create ();
2572 cp_walk_tree (&t
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
2573 pointer_set_destroy (ppd
.visited
);
2574 return parameter_packs
!= NULL_TREE
;
2577 /* Turn ARG, which may be an expression, type, or a TREE_LIST
2578 representation a base-class initializer into a parameter pack
2579 expansion. If all goes well, the resulting node will be an
2580 EXPR_PACK_EXPANSION, TYPE_PACK_EXPANSION, or TREE_LIST,
2583 make_pack_expansion (tree arg
)
2586 tree parameter_packs
= NULL_TREE
;
2587 bool for_types
= false;
2588 struct find_parameter_pack_data ppd
;
2590 if (!arg
|| arg
== error_mark_node
)
2593 if (TREE_CODE (arg
) == TREE_LIST
)
2595 /* The only time we will see a TREE_LIST here is for a base
2596 class initializer. In this case, the TREE_PURPOSE will be a
2597 _TYPE node (representing the base class expansion we're
2598 initializing) and the TREE_VALUE will be a TREE_LIST
2599 containing the initialization arguments.
2601 The resulting expansion looks somewhat different from most
2602 expansions. Rather than returning just one _EXPANSION, we
2603 return a TREE_LIST whose TREE_PURPOSE is a
2604 TYPE_PACK_EXPANSION containing the bases that will be
2605 initialized. The TREE_VALUE will be identical to the
2606 original TREE_VALUE, which is a list of arguments that will
2607 be passed to each base. We do not introduce any new pack
2608 expansion nodes into the TREE_VALUE (although it is possible
2609 that some already exist), because the TREE_PURPOSE and
2610 TREE_VALUE all need to be expanded together with the same
2611 _EXPANSION node. Note that the TYPE_PACK_EXPANSION in the
2612 resulting TREE_PURPOSE will mention the parameter packs in
2613 both the bases and the arguments to the bases. */
2616 tree parameter_packs
= NULL_TREE
;
2618 /* Determine which parameter packs will be used by the base
2620 ppd
.visited
= pointer_set_create ();
2621 ppd
.parameter_packs
= ¶meter_packs
;
2622 cp_walk_tree (&TREE_PURPOSE (arg
), &find_parameter_packs_r
,
2625 if (parameter_packs
== NULL_TREE
)
2627 error ("base initializer expansion %<%T%> contains no parameter packs", arg
);
2628 pointer_set_destroy (ppd
.visited
);
2629 return error_mark_node
;
2632 if (TREE_VALUE (arg
) != void_type_node
)
2634 /* Collect the sets of parameter packs used in each of the
2635 initialization arguments. */
2636 for (value
= TREE_VALUE (arg
); value
; value
= TREE_CHAIN (value
))
2638 /* Determine which parameter packs will be expanded in this
2640 cp_walk_tree (&TREE_VALUE (value
), &find_parameter_packs_r
,
2645 pointer_set_destroy (ppd
.visited
);
2647 /* Create the pack expansion type for the base type. */
2648 purpose
= make_node (TYPE_PACK_EXPANSION
);
2649 SET_PACK_EXPANSION_PATTERN (purpose
, TREE_PURPOSE (arg
));
2650 PACK_EXPANSION_PARAMETER_PACKS (purpose
) = parameter_packs
;
2652 /* Just use structural equality for these TYPE_PACK_EXPANSIONS;
2653 they will rarely be compared to anything. */
2654 SET_TYPE_STRUCTURAL_EQUALITY (purpose
);
2656 return tree_cons (purpose
, TREE_VALUE (arg
), NULL_TREE
);
2659 if (TYPE_P (arg
) || TREE_CODE (arg
) == TEMPLATE_DECL
)
2662 /* Build the PACK_EXPANSION_* node. */
2663 result
= make_node (for_types
? TYPE_PACK_EXPANSION
: EXPR_PACK_EXPANSION
);
2664 SET_PACK_EXPANSION_PATTERN (result
, arg
);
2665 if (TREE_CODE (result
) == EXPR_PACK_EXPANSION
)
2667 /* Propagate type and const-expression information. */
2668 TREE_TYPE (result
) = TREE_TYPE (arg
);
2669 TREE_CONSTANT (result
) = TREE_CONSTANT (arg
);
2672 /* Just use structural equality for these TYPE_PACK_EXPANSIONS;
2673 they will rarely be compared to anything. */
2674 SET_TYPE_STRUCTURAL_EQUALITY (result
);
2676 /* Determine which parameter packs will be expanded. */
2677 ppd
.parameter_packs
= ¶meter_packs
;
2678 ppd
.visited
= pointer_set_create ();
2679 cp_walk_tree (&arg
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
2680 pointer_set_destroy (ppd
.visited
);
2682 /* Make sure we found some parameter packs. */
2683 if (parameter_packs
== NULL_TREE
)
2686 error ("expansion pattern %<%T%> contains no argument packs", arg
);
2688 error ("expansion pattern %<%E%> contains no argument packs", arg
);
2689 return error_mark_node
;
2691 PACK_EXPANSION_PARAMETER_PACKS (result
) = parameter_packs
;
2696 /* Checks T for any "bare" parameter packs, which have not yet been
2697 expanded, and issues an error if any are found. This operation can
2698 only be done on full expressions or types (e.g., an expression
2699 statement, "if" condition, etc.), because we could have expressions like:
2701 foo(f(g(h(args)))...)
2703 where "args" is a parameter pack. check_for_bare_parameter_packs
2704 should not be called for the subexpressions args, h(args),
2705 g(h(args)), or f(g(h(args))), because we would produce erroneous
2708 Returns TRUE and emits an error if there were bare parameter packs,
2709 returns FALSE otherwise. */
2711 check_for_bare_parameter_packs (tree t
)
2713 tree parameter_packs
= NULL_TREE
;
2714 struct find_parameter_pack_data ppd
;
2716 if (!processing_template_decl
|| !t
|| t
== error_mark_node
)
2719 if (TREE_CODE (t
) == TYPE_DECL
)
2722 ppd
.parameter_packs
= ¶meter_packs
;
2723 ppd
.visited
= pointer_set_create ();
2724 cp_walk_tree (&t
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
2725 pointer_set_destroy (ppd
.visited
);
2727 if (parameter_packs
)
2729 error ("parameter packs not expanded with %<...%>:");
2730 while (parameter_packs
)
2732 tree pack
= TREE_VALUE (parameter_packs
);
2733 tree name
= NULL_TREE
;
2735 if (TREE_CODE (pack
) == TEMPLATE_TYPE_PARM
2736 || TREE_CODE (pack
) == TEMPLATE_TEMPLATE_PARM
)
2737 name
= TYPE_NAME (pack
);
2738 else if (TREE_CODE (pack
) == TEMPLATE_PARM_INDEX
)
2739 name
= DECL_NAME (TEMPLATE_PARM_DECL (pack
));
2741 name
= DECL_NAME (pack
);
2744 inform (input_location
, " %qD", name
);
2746 inform (input_location
, " <anonymous>");
2748 parameter_packs
= TREE_CHAIN (parameter_packs
);
2757 /* Expand any parameter packs that occur in the template arguments in
2760 expand_template_argument_pack (tree args
)
2762 tree result_args
= NULL_TREE
;
2763 int in_arg
, out_arg
= 0, nargs
= args
? TREE_VEC_LENGTH (args
) : 0;
2764 int num_result_args
= -1;
2766 /* First, determine if we need to expand anything, and the number of
2767 slots we'll need. */
2768 for (in_arg
= 0; in_arg
< nargs
; ++in_arg
)
2770 tree arg
= TREE_VEC_ELT (args
, in_arg
);
2771 if (ARGUMENT_PACK_P (arg
))
2773 int num_packed
= TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg
));
2774 if (num_result_args
< 0)
2775 num_result_args
= in_arg
+ num_packed
;
2777 num_result_args
+= num_packed
;
2781 if (num_result_args
>= 0)
2786 /* If no expansion is necessary, we're done. */
2787 if (num_result_args
< 0)
2790 /* Expand arguments. */
2791 result_args
= make_tree_vec (num_result_args
);
2792 for (in_arg
= 0; in_arg
< nargs
; ++in_arg
)
2794 tree arg
= TREE_VEC_ELT (args
, in_arg
);
2795 if (ARGUMENT_PACK_P (arg
))
2797 tree packed
= ARGUMENT_PACK_ARGS (arg
);
2798 int i
, num_packed
= TREE_VEC_LENGTH (packed
);
2799 for (i
= 0; i
< num_packed
; ++i
, ++out_arg
)
2800 TREE_VEC_ELT (result_args
, out_arg
) = TREE_VEC_ELT(packed
, i
);
2804 TREE_VEC_ELT (result_args
, out_arg
) = arg
;
2812 /* Checks if DECL shadows a template parameter.
2814 [temp.local]: A template-parameter shall not be redeclared within its
2815 scope (including nested scopes).
2817 Emits an error and returns TRUE if the DECL shadows a parameter,
2818 returns FALSE otherwise. */
2821 check_template_shadow (tree decl
)
2825 /* If we're not in a template, we can't possibly shadow a template
2827 if (!current_template_parms
)
2830 /* Figure out what we're shadowing. */
2831 if (TREE_CODE (decl
) == OVERLOAD
)
2832 decl
= OVL_CURRENT (decl
);
2833 olddecl
= innermost_non_namespace_value (DECL_NAME (decl
));
2835 /* If there's no previous binding for this name, we're not shadowing
2836 anything, let alone a template parameter. */
2840 /* If we're not shadowing a template parameter, we're done. Note
2841 that OLDDECL might be an OVERLOAD (or perhaps even an
2842 ERROR_MARK), so we can't just blithely assume it to be a _DECL
2844 if (!DECL_P (olddecl
) || !DECL_TEMPLATE_PARM_P (olddecl
))
2847 /* We check for decl != olddecl to avoid bogus errors for using a
2848 name inside a class. We check TPFI to avoid duplicate errors for
2849 inline member templates. */
2851 || TEMPLATE_PARMS_FOR_INLINE (current_template_parms
))
2854 error ("declaration of %q+#D", decl
);
2855 error (" shadows template parm %q+#D", olddecl
);
2859 /* Return a new TEMPLATE_PARM_INDEX with the indicated INDEX, LEVEL,
2860 ORIG_LEVEL, DECL, and TYPE. */
2863 build_template_parm_index (int index
,
2869 tree t
= make_node (TEMPLATE_PARM_INDEX
);
2870 TEMPLATE_PARM_IDX (t
) = index
;
2871 TEMPLATE_PARM_LEVEL (t
) = level
;
2872 TEMPLATE_PARM_ORIG_LEVEL (t
) = orig_level
;
2873 TEMPLATE_PARM_DECL (t
) = decl
;
2874 TREE_TYPE (t
) = type
;
2875 TREE_CONSTANT (t
) = TREE_CONSTANT (decl
);
2876 TREE_READONLY (t
) = TREE_READONLY (decl
);
2881 /* Find the canonical type parameter for the given template type
2882 parameter. Returns the canonical type parameter, which may be TYPE
2883 if no such parameter existed. */
2885 canonical_type_parameter (tree type
)
2888 int idx
= TEMPLATE_TYPE_IDX (type
);
2889 if (!canonical_template_parms
)
2890 canonical_template_parms
= VEC_alloc (tree
, gc
, idx
+1);
2892 while (VEC_length (tree
, canonical_template_parms
) <= (unsigned)idx
)
2893 VEC_safe_push (tree
, gc
, canonical_template_parms
, NULL_TREE
);
2895 list
= VEC_index (tree
, canonical_template_parms
, idx
);
2896 while (list
&& !comptypes (type
, TREE_VALUE (list
), COMPARE_STRUCTURAL
))
2897 list
= TREE_CHAIN (list
);
2900 return TREE_VALUE (list
);
2903 VEC_replace(tree
, canonical_template_parms
, idx
,
2904 tree_cons (NULL_TREE
, type
,
2905 VEC_index (tree
, canonical_template_parms
, idx
)));
2910 /* Return a TEMPLATE_PARM_INDEX, similar to INDEX, but whose
2911 TEMPLATE_PARM_LEVEL has been decreased by LEVELS. If such a
2912 TEMPLATE_PARM_INDEX already exists, it is returned; otherwise, a
2913 new one is created. */
2916 reduce_template_parm_level (tree index
, tree type
, int levels
, tree args
,
2917 tsubst_flags_t complain
)
2919 if (TEMPLATE_PARM_DESCENDANTS (index
) == NULL_TREE
2920 || (TEMPLATE_PARM_LEVEL (TEMPLATE_PARM_DESCENDANTS (index
))
2921 != TEMPLATE_PARM_LEVEL (index
) - levels
))
2923 tree orig_decl
= TEMPLATE_PARM_DECL (index
);
2926 decl
= build_decl (TREE_CODE (orig_decl
), DECL_NAME (orig_decl
), type
);
2927 TREE_CONSTANT (decl
) = TREE_CONSTANT (orig_decl
);
2928 TREE_READONLY (decl
) = TREE_READONLY (orig_decl
);
2929 DECL_ARTIFICIAL (decl
) = 1;
2930 SET_DECL_TEMPLATE_PARM_P (decl
);
2932 t
= build_template_parm_index (TEMPLATE_PARM_IDX (index
),
2933 TEMPLATE_PARM_LEVEL (index
) - levels
,
2934 TEMPLATE_PARM_ORIG_LEVEL (index
),
2936 TEMPLATE_PARM_DESCENDANTS (index
) = t
;
2937 TEMPLATE_PARM_PARAMETER_PACK (t
)
2938 = TEMPLATE_PARM_PARAMETER_PACK (index
);
2940 /* Template template parameters need this. */
2941 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
2942 DECL_TEMPLATE_PARMS (decl
) = tsubst_template_parms
2943 (DECL_TEMPLATE_PARMS (TEMPLATE_PARM_DECL (index
)),
2947 return TEMPLATE_PARM_DESCENDANTS (index
);
2950 /* Process information from new template parameter PARM and append it to the
2951 LIST being built. This new parameter is a non-type parameter iff
2952 IS_NON_TYPE is true. This new parameter is a parameter
2953 pack iff IS_PARAMETER_PACK is true. */
2956 process_template_parm (tree list
, tree parm
, bool is_non_type
,
2957 bool is_parameter_pack
)
2964 gcc_assert (TREE_CODE (parm
) == TREE_LIST
);
2965 defval
= TREE_PURPOSE (parm
);
2969 tree p
= tree_last (list
);
2971 if (p
&& TREE_VALUE (p
) != error_mark_node
)
2974 if (TREE_CODE (p
) == TYPE_DECL
|| TREE_CODE (p
) == TEMPLATE_DECL
)
2975 idx
= TEMPLATE_TYPE_IDX (TREE_TYPE (p
));
2977 idx
= TEMPLATE_PARM_IDX (DECL_INITIAL (p
));
2987 parm
= TREE_VALUE (parm
);
2989 SET_DECL_TEMPLATE_PARM_P (parm
);
2991 if (TREE_TYPE (parm
) == error_mark_node
)
2993 err_parm_list
= build_tree_list (defval
, parm
);
2994 TREE_VALUE (err_parm_list
) = error_mark_node
;
2995 return chainon (list
, err_parm_list
);
3001 The top-level cv-qualifiers on the template-parameter are
3002 ignored when determining its type. */
3003 TREE_TYPE (parm
) = TYPE_MAIN_VARIANT (TREE_TYPE (parm
));
3004 if (invalid_nontype_parm_type_p (TREE_TYPE (parm
), 1))
3006 err_parm_list
= build_tree_list (defval
, parm
);
3007 TREE_VALUE (err_parm_list
) = error_mark_node
;
3008 return chainon (list
, err_parm_list
);
3011 if (uses_parameter_packs (TREE_TYPE (parm
)) && !is_parameter_pack
)
3013 /* This template parameter is not a parameter pack, but it
3014 should be. Complain about "bare" parameter packs. */
3015 check_for_bare_parameter_packs (TREE_TYPE (parm
));
3017 /* Recover by calling this a parameter pack. */
3018 is_parameter_pack
= true;
3022 /* A template parameter is not modifiable. */
3023 TREE_CONSTANT (parm
) = 1;
3024 TREE_READONLY (parm
) = 1;
3025 decl
= build_decl (CONST_DECL
, DECL_NAME (parm
), TREE_TYPE (parm
));
3026 TREE_CONSTANT (decl
) = 1;
3027 TREE_READONLY (decl
) = 1;
3028 DECL_INITIAL (parm
) = DECL_INITIAL (decl
)
3029 = build_template_parm_index (idx
, processing_template_decl
,
3030 processing_template_decl
,
3031 decl
, TREE_TYPE (parm
));
3033 TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
))
3034 = is_parameter_pack
;
3039 parm
= TREE_VALUE (TREE_VALUE (parm
));
3041 if (parm
&& TREE_CODE (parm
) == TEMPLATE_DECL
)
3043 t
= cxx_make_type (TEMPLATE_TEMPLATE_PARM
);
3044 /* This is for distinguishing between real templates and template
3045 template parameters */
3046 TREE_TYPE (parm
) = t
;
3047 TREE_TYPE (DECL_TEMPLATE_RESULT (parm
)) = t
;
3052 t
= cxx_make_type (TEMPLATE_TYPE_PARM
);
3053 /* parm is either IDENTIFIER_NODE or NULL_TREE. */
3054 decl
= build_decl (TYPE_DECL
, parm
, t
);
3057 TYPE_NAME (t
) = decl
;
3058 TYPE_STUB_DECL (t
) = decl
;
3060 TEMPLATE_TYPE_PARM_INDEX (t
)
3061 = build_template_parm_index (idx
, processing_template_decl
,
3062 processing_template_decl
,
3063 decl
, TREE_TYPE (parm
));
3064 TEMPLATE_TYPE_PARAMETER_PACK (t
) = is_parameter_pack
;
3065 TYPE_CANONICAL (t
) = canonical_type_parameter (t
);
3067 DECL_ARTIFICIAL (decl
) = 1;
3068 SET_DECL_TEMPLATE_PARM_P (decl
);
3070 parm
= build_tree_list (defval
, parm
);
3071 return chainon (list
, parm
);
3074 /* The end of a template parameter list has been reached. Process the
3075 tree list into a parameter vector, converting each parameter into a more
3076 useful form. Type parameters are saved as IDENTIFIER_NODEs, and others
3080 end_template_parm_list (tree parms
)
3084 tree saved_parmlist
= make_tree_vec (list_length (parms
));
3086 current_template_parms
3087 = tree_cons (size_int (processing_template_decl
),
3088 saved_parmlist
, current_template_parms
);
3090 for (parm
= parms
, nparms
= 0; parm
; parm
= next
, nparms
++)
3092 next
= TREE_CHAIN (parm
);
3093 TREE_VEC_ELT (saved_parmlist
, nparms
) = parm
;
3094 TREE_CHAIN (parm
) = NULL_TREE
;
3097 --processing_template_parmlist
;
3099 return saved_parmlist
;
3102 /* end_template_decl is called after a template declaration is seen. */
3105 end_template_decl (void)
3107 reset_specialization ();
3109 if (! processing_template_decl
)
3112 /* This matches the pushlevel in begin_template_parm_list. */
3115 --processing_template_decl
;
3116 current_template_parms
= TREE_CHAIN (current_template_parms
);
3119 /* Within the declaration of a template, return all levels of template
3120 parameters that apply. The template parameters are represented as
3121 a TREE_VEC, in the form documented in cp-tree.h for template
3125 current_template_args (void)
3128 tree args
= NULL_TREE
;
3129 int length
= TMPL_PARMS_DEPTH (current_template_parms
);
3132 /* If there is only one level of template parameters, we do not
3133 create a TREE_VEC of TREE_VECs. Instead, we return a single
3134 TREE_VEC containing the arguments. */
3136 args
= make_tree_vec (length
);
3138 for (header
= current_template_parms
; header
; header
= TREE_CHAIN (header
))
3140 tree a
= copy_node (TREE_VALUE (header
));
3143 TREE_TYPE (a
) = NULL_TREE
;
3144 for (i
= TREE_VEC_LENGTH (a
) - 1; i
>= 0; --i
)
3146 tree t
= TREE_VEC_ELT (a
, i
);
3148 /* T will be a list if we are called from within a
3149 begin/end_template_parm_list pair, but a vector directly
3150 if within a begin/end_member_template_processing pair. */
3151 if (TREE_CODE (t
) == TREE_LIST
)
3155 if (!error_operand_p (t
))
3157 if (TREE_CODE (t
) == TYPE_DECL
3158 || TREE_CODE (t
) == TEMPLATE_DECL
)
3162 if (TEMPLATE_TYPE_PARAMETER_PACK (t
))
3164 /* Turn this argument into a TYPE_ARGUMENT_PACK
3165 with a single element, which expands T. */
3166 tree vec
= make_tree_vec (1);
3167 TREE_VEC_ELT (vec
, 0) = make_pack_expansion (t
);
3169 t
= make_node (TYPE_ARGUMENT_PACK
);
3170 SET_ARGUMENT_PACK_ARGS (t
, vec
);
3175 t
= DECL_INITIAL (t
);
3177 if (TEMPLATE_PARM_PARAMETER_PACK (t
))
3179 /* Turn this argument into a NONTYPE_ARGUMENT_PACK
3180 with a single element, which expands T. */
3181 tree vec
= make_tree_vec (1);
3182 tree type
= TREE_TYPE (TEMPLATE_PARM_DECL (t
));
3183 TREE_VEC_ELT (vec
, 0) = make_pack_expansion (t
);
3185 t
= make_node (NONTYPE_ARGUMENT_PACK
);
3186 SET_ARGUMENT_PACK_ARGS (t
, vec
);
3187 TREE_TYPE (t
) = type
;
3190 TREE_VEC_ELT (a
, i
) = t
;
3196 TREE_VEC_ELT (args
, --l
) = a
;
3204 /* Return a TEMPLATE_DECL corresponding to DECL, using the indicated
3205 template PARMS. If MEMBER_TEMPLATE_P is true, the new template is
3206 a member template. Used by push_template_decl below. */
3209 build_template_decl (tree decl
, tree parms
, bool member_template_p
)
3211 tree tmpl
= build_lang_decl (TEMPLATE_DECL
, DECL_NAME (decl
), NULL_TREE
);
3212 DECL_TEMPLATE_PARMS (tmpl
) = parms
;
3213 DECL_CONTEXT (tmpl
) = DECL_CONTEXT (decl
);
3214 DECL_MEMBER_TEMPLATE_P (tmpl
) = member_template_p
;
3215 if (DECL_LANG_SPECIFIC (decl
))
3217 DECL_STATIC_FUNCTION_P (tmpl
) = DECL_STATIC_FUNCTION_P (decl
);
3218 DECL_CONSTRUCTOR_P (tmpl
) = DECL_CONSTRUCTOR_P (decl
);
3219 DECL_DESTRUCTOR_P (tmpl
) = DECL_DESTRUCTOR_P (decl
);
3220 DECL_NONCONVERTING_P (tmpl
) = DECL_NONCONVERTING_P (decl
);
3221 DECL_ASSIGNMENT_OPERATOR_P (tmpl
) = DECL_ASSIGNMENT_OPERATOR_P (decl
);
3222 if (DECL_OVERLOADED_OPERATOR_P (decl
))
3223 SET_OVERLOADED_OPERATOR_CODE (tmpl
,
3224 DECL_OVERLOADED_OPERATOR_P (decl
));
3230 struct template_parm_data
3232 /* The level of the template parameters we are currently
3236 /* The index of the specialization argument we are currently
3240 /* An array whose size is the number of template parameters. The
3241 elements are nonzero if the parameter has been used in any one
3242 of the arguments processed so far. */
3245 /* An array whose size is the number of template arguments. The
3246 elements are nonzero if the argument makes use of template
3247 parameters of this level. */
3248 int* arg_uses_template_parms
;
3251 /* Subroutine of push_template_decl used to see if each template
3252 parameter in a partial specialization is used in the explicit
3253 argument list. If T is of the LEVEL given in DATA (which is
3254 treated as a template_parm_data*), then DATA->PARMS is marked
3258 mark_template_parm (tree t
, void* data
)
3262 struct template_parm_data
* tpd
= (struct template_parm_data
*) data
;
3264 if (TREE_CODE (t
) == TEMPLATE_PARM_INDEX
)
3266 level
= TEMPLATE_PARM_LEVEL (t
);
3267 idx
= TEMPLATE_PARM_IDX (t
);
3271 level
= TEMPLATE_TYPE_LEVEL (t
);
3272 idx
= TEMPLATE_TYPE_IDX (t
);
3275 if (level
== tpd
->level
)
3277 tpd
->parms
[idx
] = 1;
3278 tpd
->arg_uses_template_parms
[tpd
->current_arg
] = 1;
3281 /* Return zero so that for_each_template_parm will continue the
3282 traversal of the tree; we want to mark *every* template parm. */
3286 /* Process the partial specialization DECL. */
3289 process_partial_specialization (tree decl
)
3291 tree type
= TREE_TYPE (decl
);
3292 tree maintmpl
= CLASSTYPE_TI_TEMPLATE (type
);
3293 tree specargs
= CLASSTYPE_TI_ARGS (type
);
3294 tree inner_args
= INNERMOST_TEMPLATE_ARGS (specargs
);
3295 tree inner_parms
= INNERMOST_TEMPLATE_PARMS (current_template_parms
);
3296 tree main_inner_parms
= DECL_INNERMOST_TEMPLATE_PARMS (maintmpl
);
3297 int nargs
= TREE_VEC_LENGTH (inner_args
);
3298 int ntparms
= TREE_VEC_LENGTH (inner_parms
);
3300 int did_error_intro
= 0;
3301 struct template_parm_data tpd
;
3302 struct template_parm_data tpd2
;
3304 /* We check that each of the template parameters given in the
3305 partial specialization is used in the argument list to the
3306 specialization. For example:
3308 template <class T> struct S;
3309 template <class T> struct S<T*>;
3311 The second declaration is OK because `T*' uses the template
3312 parameter T, whereas
3314 template <class T> struct S<int>;
3316 is no good. Even trickier is:
3327 The S2<T> declaration is actually invalid; it is a
3328 full-specialization. Of course,
3331 struct S2<T (*)(U)>;
3333 or some such would have been OK. */
3334 tpd
.level
= TMPL_PARMS_DEPTH (current_template_parms
);
3335 tpd
.parms
= (int *) alloca (sizeof (int) * ntparms
);
3336 memset (tpd
.parms
, 0, sizeof (int) * ntparms
);
3338 tpd
.arg_uses_template_parms
= (int *) alloca (sizeof (int) * nargs
);
3339 memset (tpd
.arg_uses_template_parms
, 0, sizeof (int) * nargs
);
3340 for (i
= 0; i
< nargs
; ++i
)
3342 tpd
.current_arg
= i
;
3343 for_each_template_parm (TREE_VEC_ELT (inner_args
, i
),
3344 &mark_template_parm
,
3347 /*include_nondeduced_p=*/false);
3349 for (i
= 0; i
< ntparms
; ++i
)
3350 if (tpd
.parms
[i
] == 0)
3352 /* One of the template parms was not used in the
3354 if (!did_error_intro
)
3356 error ("template parameters not used in partial specialization:");
3357 did_error_intro
= 1;
3360 error (" %qD", TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
)));
3363 /* [temp.class.spec]
3365 The argument list of the specialization shall not be identical to
3366 the implicit argument list of the primary template. */
3367 if (comp_template_args
3369 INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE
3371 error ("partial specialization %qT does not specialize any template arguments", type
);
3373 /* [temp.class.spec]
3375 A partially specialized non-type argument expression shall not
3376 involve template parameters of the partial specialization except
3377 when the argument expression is a simple identifier.
3379 The type of a template parameter corresponding to a specialized
3380 non-type argument shall not be dependent on a parameter of the
3383 Also, we verify that pack expansions only occur at the
3384 end of the argument list. */
3385 gcc_assert (nargs
== DECL_NTPARMS (maintmpl
));
3387 for (i
= 0; i
< nargs
; ++i
)
3389 tree parm
= TREE_VALUE (TREE_VEC_ELT (main_inner_parms
, i
));
3390 tree arg
= TREE_VEC_ELT (inner_args
, i
);
3391 tree packed_args
= NULL_TREE
;
3394 if (ARGUMENT_PACK_P (arg
))
3396 /* Extract the arguments from the argument pack. We'll be
3397 iterating over these in the following loop. */
3398 packed_args
= ARGUMENT_PACK_ARGS (arg
);
3399 len
= TREE_VEC_LENGTH (packed_args
);
3402 for (j
= 0; j
< len
; j
++)
3405 /* Get the Jth argument in the parameter pack. */
3406 arg
= TREE_VEC_ELT (packed_args
, j
);
3408 if (PACK_EXPANSION_P (arg
))
3410 /* Pack expansions must come at the end of the
3412 if ((packed_args
&& j
< len
- 1)
3413 || (!packed_args
&& i
< nargs
- 1))
3415 if (TREE_CODE (arg
) == EXPR_PACK_EXPANSION
)
3416 error ("parameter pack argument %qE must be at the end of the template argument list", arg
);
3418 error ("parameter pack argument %qT must be at the end of the template argument list", arg
);
3421 TREE_VEC_ELT (packed_args
, j
) = error_mark_node
;
3425 if (TREE_CODE (arg
) == EXPR_PACK_EXPANSION
)
3426 /* We only care about the pattern. */
3427 arg
= PACK_EXPANSION_PATTERN (arg
);
3429 if (/* These first two lines are the `non-type' bit. */
3431 && TREE_CODE (arg
) != TEMPLATE_DECL
3432 /* This next line is the `argument expression is not just a
3433 simple identifier' condition and also the `specialized
3434 non-type argument' bit. */
3435 && TREE_CODE (arg
) != TEMPLATE_PARM_INDEX
)
3437 if ((!packed_args
&& tpd
.arg_uses_template_parms
[i
])
3438 || (packed_args
&& uses_template_parms (arg
)))
3439 error ("template argument %qE involves template parameter(s)",
3443 /* Look at the corresponding template parameter,
3444 marking which template parameters its type depends
3446 tree type
= TREE_TYPE (parm
);
3450 /* We haven't yet initialized TPD2. Do so now. */
3451 tpd2
.arg_uses_template_parms
3452 = (int *) alloca (sizeof (int) * nargs
);
3453 /* The number of parameters here is the number in the
3454 main template, which, as checked in the assertion
3456 tpd2
.parms
= (int *) alloca (sizeof (int) * nargs
);
3458 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (maintmpl
));
3461 /* Mark the template parameters. But this time, we're
3462 looking for the template parameters of the main
3463 template, not in the specialization. */
3464 tpd2
.current_arg
= i
;
3465 tpd2
.arg_uses_template_parms
[i
] = 0;
3466 memset (tpd2
.parms
, 0, sizeof (int) * nargs
);
3467 for_each_template_parm (type
,
3468 &mark_template_parm
,
3471 /*include_nondeduced_p=*/false);
3473 if (tpd2
.arg_uses_template_parms
[i
])
3475 /* The type depended on some template parameters.
3476 If they are fully specialized in the
3477 specialization, that's OK. */
3479 for (j
= 0; j
< nargs
; ++j
)
3480 if (tpd2
.parms
[j
] != 0
3481 && tpd
.arg_uses_template_parms
[j
])
3483 error ("type %qT of template argument %qE depends "
3484 "on template parameter(s)",
3495 if (retrieve_specialization (maintmpl
, specargs
,
3496 /*class_specializations_p=*/true))
3497 /* We've already got this specialization. */
3500 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)
3501 = tree_cons (specargs
, inner_parms
,
3502 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
));
3503 TREE_TYPE (DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)) = type
;
3507 /* Check that a template declaration's use of default arguments and
3508 parameter packs is not invalid. Here, PARMS are the template
3509 parameters. IS_PRIMARY is nonzero if DECL is the thing declared by
3510 a primary template. IS_PARTIAL is nonzero if DECL is a partial
3514 IS_FRIEND_DECL is nonzero if DECL is a friend function template
3515 declaration (but not a definition); 1 indicates a declaration, 2
3516 indicates a redeclaration. When IS_FRIEND_DECL=2, no errors are
3517 emitted for extraneous default arguments.
3519 Returns TRUE if there were no errors found, FALSE otherwise. */
3522 check_default_tmpl_args (tree decl
, tree parms
, int is_primary
,
3523 int is_partial
, int is_friend_decl
)
3526 int last_level_to_check
;
3528 bool no_errors
= true;
3532 A default template-argument shall not be specified in a
3533 function template declaration or a function template definition, nor
3534 in the template-parameter-list of the definition of a member of a
3537 if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == FUNCTION_DECL
)
3538 /* You can't have a function template declaration in a local
3539 scope, nor you can you define a member of a class template in a
3543 if (current_class_type
3544 && !TYPE_BEING_DEFINED (current_class_type
)
3545 && DECL_LANG_SPECIFIC (decl
)
3546 /* If this is either a friend defined in the scope of the class
3547 or a member function. */
3548 && (DECL_FUNCTION_MEMBER_P (decl
)
3549 ? same_type_p (DECL_CONTEXT (decl
), current_class_type
)
3550 : DECL_FRIEND_CONTEXT (decl
)
3551 ? same_type_p (DECL_FRIEND_CONTEXT (decl
), current_class_type
)
3553 /* And, if it was a member function, it really was defined in
3554 the scope of the class. */
3555 && (!DECL_FUNCTION_MEMBER_P (decl
)
3556 || DECL_INITIALIZED_IN_CLASS_P (decl
)))
3557 /* We already checked these parameters when the template was
3558 declared, so there's no need to do it again now. This function
3559 was defined in class scope, but we're processing it's body now
3560 that the class is complete. */
3563 /* Core issue 226 (C++0x only): the following only applies to class
3565 if ((cxx_dialect
== cxx98
) || TREE_CODE (decl
) != FUNCTION_DECL
)
3569 If a template-parameter has a default template-argument, all
3570 subsequent template-parameters shall have a default
3571 template-argument supplied. */
3572 for (parm_level
= parms
; parm_level
; parm_level
= TREE_CHAIN (parm_level
))
3574 tree inner_parms
= TREE_VALUE (parm_level
);
3575 int ntparms
= TREE_VEC_LENGTH (inner_parms
);
3576 int seen_def_arg_p
= 0;
3579 for (i
= 0; i
< ntparms
; ++i
)
3581 tree parm
= TREE_VEC_ELT (inner_parms
, i
);
3583 if (parm
== error_mark_node
)
3586 if (TREE_PURPOSE (parm
))
3588 else if (seen_def_arg_p
)
3590 error ("no default argument for %qD", TREE_VALUE (parm
));
3591 /* For better subsequent error-recovery, we indicate that
3592 there should have been a default argument. */
3593 TREE_PURPOSE (parm
) = error_mark_node
;
3599 && TREE_CODE (decl
) == TYPE_DECL
3601 && template_parameter_pack_p (TREE_VALUE (parm
)))
3603 /* A primary class template can only have one
3604 parameter pack, at the end of the template
3607 if (TREE_CODE (TREE_VALUE (parm
)) == PARM_DECL
)
3608 error ("parameter pack %qE must be at the end of the"
3609 " template parameter list", TREE_VALUE (parm
));
3611 error ("parameter pack %qT must be at the end of the"
3612 " template parameter list",
3613 TREE_TYPE (TREE_VALUE (parm
)));
3615 TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
))
3623 if (((cxx_dialect
== cxx98
) && TREE_CODE (decl
) != TYPE_DECL
)
3627 /* For an ordinary class template, default template arguments are
3628 allowed at the innermost level, e.g.:
3629 template <class T = int>
3631 but, in a partial specialization, they're not allowed even
3632 there, as we have in [temp.class.spec]:
3634 The template parameter list of a specialization shall not
3635 contain default template argument values.
3637 So, for a partial specialization, or for a function template
3638 (in C++98/C++03), we look at all of them. */
3641 /* But, for a primary class template that is not a partial
3642 specialization we look at all template parameters except the
3644 parms
= TREE_CHAIN (parms
);
3646 /* Figure out what error message to issue. */
3647 if (is_friend_decl
== 2)
3648 msg
= "default template arguments may not be used in function template friend re-declaration";
3649 else if (is_friend_decl
)
3650 msg
= "default template arguments may not be used in function template friend declarations";
3651 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& (cxx_dialect
== cxx98
))
3652 msg
= "default template arguments may not be used in function templates";
3653 else if (is_partial
)
3654 msg
= "default template arguments may not be used in partial specializations";
3656 msg
= "default argument for template parameter for class enclosing %qD";
3658 if (current_class_type
&& TYPE_BEING_DEFINED (current_class_type
))
3659 /* If we're inside a class definition, there's no need to
3660 examine the parameters to the class itself. On the one
3661 hand, they will be checked when the class is defined, and,
3662 on the other, default arguments are valid in things like:
3663 template <class T = double>
3664 struct S { template <class U> void f(U); };
3665 Here the default argument for `S' has no bearing on the
3666 declaration of `f'. */
3667 last_level_to_check
= template_class_depth (current_class_type
) + 1;
3669 /* Check everything. */
3670 last_level_to_check
= 0;
3672 for (parm_level
= parms
;
3673 parm_level
&& TMPL_PARMS_DEPTH (parm_level
) >= last_level_to_check
;
3674 parm_level
= TREE_CHAIN (parm_level
))
3676 tree inner_parms
= TREE_VALUE (parm_level
);
3680 ntparms
= TREE_VEC_LENGTH (inner_parms
);
3681 for (i
= 0; i
< ntparms
; ++i
)
3683 if (TREE_VEC_ELT (inner_parms
, i
) == error_mark_node
)
3686 if (TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)))
3691 if (is_friend_decl
== 2)
3698 /* Clear out the default argument so that we are not
3700 TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)) = NULL_TREE
;
3704 /* At this point, if we're still interested in issuing messages,
3705 they must apply to classes surrounding the object declared. */
3707 msg
= "default argument for template parameter for class enclosing %qD";
3713 /* Worker for push_template_decl_real, called via
3714 for_each_template_parm. DATA is really an int, indicating the
3715 level of the parameters we are interested in. If T is a template
3716 parameter of that level, return nonzero. */
3719 template_parm_this_level_p (tree t
, void* data
)
3721 int this_level
= *(int *)data
;
3724 if (TREE_CODE (t
) == TEMPLATE_PARM_INDEX
)
3725 level
= TEMPLATE_PARM_LEVEL (t
);
3727 level
= TEMPLATE_TYPE_LEVEL (t
);
3728 return level
== this_level
;
3731 /* Creates a TEMPLATE_DECL for the indicated DECL using the template
3732 parameters given by current_template_args, or reuses a
3733 previously existing one, if appropriate. Returns the DECL, or an
3734 equivalent one, if it is replaced via a call to duplicate_decls.
3736 If IS_FRIEND is true, DECL is a friend declaration. */
3739 push_template_decl_real (tree decl
, bool is_friend
)
3747 int new_template_p
= 0;
3748 /* True if the template is a member template, in the sense of
3750 bool member_template_p
= false;
3752 if (decl
== error_mark_node
)
3755 /* See if this is a partial specialization. */
3756 is_partial
= (DECL_IMPLICIT_TYPEDEF_P (decl
)
3757 && TREE_CODE (TREE_TYPE (decl
)) != ENUMERAL_TYPE
3758 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)));
3760 if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_FRIEND_P (decl
))
3764 /* For a friend, we want the context of the friend function, not
3765 the type of which it is a friend. */
3766 ctx
= DECL_CONTEXT (decl
);
3767 else if (CP_DECL_CONTEXT (decl
)
3768 && TREE_CODE (CP_DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
3769 /* In the case of a virtual function, we want the class in which
3771 ctx
= CP_DECL_CONTEXT (decl
);
3773 /* Otherwise, if we're currently defining some class, the DECL
3774 is assumed to be a member of the class. */
3775 ctx
= current_scope ();
3777 if (ctx
&& TREE_CODE (ctx
) == NAMESPACE_DECL
)
3780 if (!DECL_CONTEXT (decl
))
3781 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
3783 /* See if this is a primary template. */
3784 if (is_friend
&& ctx
)
3785 /* A friend template that specifies a class context, i.e.
3786 template <typename T> friend void A<T>::f();
3790 primary
= template_parm_scope_p ();
3794 if (DECL_CLASS_SCOPE_P (decl
))
3795 member_template_p
= true;
3796 if (TREE_CODE (decl
) == TYPE_DECL
3797 && ANON_AGGRNAME_P (DECL_NAME (decl
)))
3799 error ("template class without a name");
3800 return error_mark_node
;
3802 else if (TREE_CODE (decl
) == FUNCTION_DECL
)
3804 if (DECL_DESTRUCTOR_P (decl
))
3808 A destructor shall not be a member template. */
3809 error ("destructor %qD declared as member template", decl
);
3810 return error_mark_node
;
3812 if (NEW_DELETE_OPNAME_P (DECL_NAME (decl
))
3813 && (!TYPE_ARG_TYPES (TREE_TYPE (decl
))
3814 || TYPE_ARG_TYPES (TREE_TYPE (decl
)) == void_list_node
3815 || !TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)))
3816 || (TREE_CHAIN (TYPE_ARG_TYPES ((TREE_TYPE (decl
))))
3817 == void_list_node
)))
3819 /* [basic.stc.dynamic.allocation]
3821 An allocation function can be a function
3822 template. ... Template allocation functions shall
3823 have two or more parameters. */
3824 error ("invalid template declaration of %qD", decl
);
3825 return error_mark_node
;
3828 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
3829 && CLASS_TYPE_P (TREE_TYPE (decl
)))
3833 error ("template declaration of %q#D", decl
);
3834 return error_mark_node
;
3838 /* Check to see that the rules regarding the use of default
3839 arguments are not being violated. */
3840 check_default_tmpl_args (decl
, current_template_parms
,
3841 primary
, is_partial
, /*is_friend_decl=*/0);
3843 /* Ensure that there are no parameter packs in the type of this
3844 declaration that have not been expanded. */
3845 if (TREE_CODE (decl
) == FUNCTION_DECL
)
3847 /* Check each of the arguments individually to see if there are
3848 any bare parameter packs. */
3849 tree type
= TREE_TYPE (decl
);
3850 tree arg
= DECL_ARGUMENTS (decl
);
3851 tree argtype
= TYPE_ARG_TYPES (type
);
3853 while (arg
&& argtype
)
3855 if (!FUNCTION_PARAMETER_PACK_P (arg
)
3856 && check_for_bare_parameter_packs (TREE_TYPE (arg
)))
3858 /* This is a PARM_DECL that contains unexpanded parameter
3859 packs. We have already complained about this in the
3860 check_for_bare_parameter_packs call, so just replace
3861 these types with ERROR_MARK_NODE. */
3862 TREE_TYPE (arg
) = error_mark_node
;
3863 TREE_VALUE (argtype
) = error_mark_node
;
3866 arg
= TREE_CHAIN (arg
);
3867 argtype
= TREE_CHAIN (argtype
);
3870 /* Check for bare parameter packs in the return type and the
3871 exception specifiers. */
3872 if (check_for_bare_parameter_packs (TREE_TYPE (type
)))
3873 /* Errors were already issued, set return type to int
3874 as the frontend doesn't expect error_mark_node as
3876 TREE_TYPE (type
) = integer_type_node
;
3877 if (check_for_bare_parameter_packs (TYPE_RAISES_EXCEPTIONS (type
)))
3878 TYPE_RAISES_EXCEPTIONS (type
) = NULL_TREE
;
3880 else if (check_for_bare_parameter_packs (TREE_TYPE (decl
)))
3882 TREE_TYPE (decl
) = error_mark_node
;
3883 return error_mark_node
;
3887 return process_partial_specialization (decl
);
3889 args
= current_template_args ();
3892 || TREE_CODE (ctx
) == FUNCTION_DECL
3893 || (CLASS_TYPE_P (ctx
) && TYPE_BEING_DEFINED (ctx
))
3894 || (is_friend
&& !DECL_TEMPLATE_INFO (decl
)))
3896 if (DECL_LANG_SPECIFIC (decl
)
3897 && DECL_TEMPLATE_INFO (decl
)
3898 && DECL_TI_TEMPLATE (decl
))
3899 tmpl
= DECL_TI_TEMPLATE (decl
);
3900 /* If DECL is a TYPE_DECL for a class-template, then there won't
3901 be DECL_LANG_SPECIFIC. The information equivalent to
3902 DECL_TEMPLATE_INFO is found in TYPE_TEMPLATE_INFO instead. */
3903 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
3904 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl
))
3905 && TYPE_TI_TEMPLATE (TREE_TYPE (decl
)))
3907 /* Since a template declaration already existed for this
3908 class-type, we must be redeclaring it here. Make sure
3909 that the redeclaration is valid. */
3910 redeclare_class_template (TREE_TYPE (decl
),
3911 current_template_parms
);
3912 /* We don't need to create a new TEMPLATE_DECL; just use the
3913 one we already had. */
3914 tmpl
= TYPE_TI_TEMPLATE (TREE_TYPE (decl
));
3918 tmpl
= build_template_decl (decl
, current_template_parms
,
3922 if (DECL_LANG_SPECIFIC (decl
)
3923 && DECL_TEMPLATE_SPECIALIZATION (decl
))
3925 /* A specialization of a member template of a template
3927 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
3928 DECL_TEMPLATE_INFO (tmpl
) = DECL_TEMPLATE_INFO (decl
);
3929 DECL_TEMPLATE_INFO (decl
) = NULL_TREE
;
3935 tree a
, t
, current
, parms
;
3937 tree tinfo
= get_template_info (decl
);
3941 error ("template definition of non-template %q#D", decl
);
3942 return error_mark_node
;
3945 tmpl
= TI_TEMPLATE (tinfo
);
3947 if (DECL_FUNCTION_TEMPLATE_P (tmpl
)
3948 && DECL_TEMPLATE_INFO (decl
) && DECL_TI_ARGS (decl
)
3949 && DECL_TEMPLATE_SPECIALIZATION (decl
)
3950 && DECL_MEMBER_TEMPLATE_P (tmpl
))
3954 /* The declaration is a specialization of a member
3955 template, declared outside the class. Therefore, the
3956 innermost template arguments will be NULL, so we
3957 replace them with the arguments determined by the
3958 earlier call to check_explicit_specialization. */
3959 args
= DECL_TI_ARGS (decl
);
3962 = build_template_decl (decl
, current_template_parms
,
3964 DECL_TEMPLATE_RESULT (new_tmpl
) = decl
;
3965 TREE_TYPE (new_tmpl
) = TREE_TYPE (decl
);
3966 DECL_TI_TEMPLATE (decl
) = new_tmpl
;
3967 SET_DECL_TEMPLATE_SPECIALIZATION (new_tmpl
);
3968 DECL_TEMPLATE_INFO (new_tmpl
)
3969 = tree_cons (tmpl
, args
, NULL_TREE
);
3971 register_specialization (new_tmpl
,
3972 most_general_template (tmpl
),
3978 /* Make sure the template headers we got make sense. */
3980 parms
= DECL_TEMPLATE_PARMS (tmpl
);
3981 i
= TMPL_PARMS_DEPTH (parms
);
3982 if (TMPL_ARGS_DEPTH (args
) != i
)
3984 error ("expected %d levels of template parms for %q#D, got %d",
3985 i
, decl
, TMPL_ARGS_DEPTH (args
));
3988 for (current
= decl
; i
> 0; --i
, parms
= TREE_CHAIN (parms
))
3990 a
= TMPL_ARGS_LEVEL (args
, i
);
3991 t
= INNERMOST_TEMPLATE_PARMS (parms
);
3993 if (TREE_VEC_LENGTH (t
) != TREE_VEC_LENGTH (a
))
3995 if (current
== decl
)
3996 error ("got %d template parameters for %q#D",
3997 TREE_VEC_LENGTH (a
), decl
);
3999 error ("got %d template parameters for %q#T",
4000 TREE_VEC_LENGTH (a
), current
);
4001 error (" but %d required", TREE_VEC_LENGTH (t
));
4002 return error_mark_node
;
4005 if (current
== decl
)
4008 current
= (TYPE_P (current
)
4009 ? TYPE_CONTEXT (current
)
4010 : DECL_CONTEXT (current
));
4013 /* Check that the parms are used in the appropriate qualifying scopes
4014 in the declarator. */
4015 if (!comp_template_args
4017 TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (tmpl
)))))
4020 template arguments to %qD do not match original template %qD",
4021 decl
, DECL_TEMPLATE_RESULT (tmpl
));
4022 if (!uses_template_parms (TI_ARGS (tinfo
)))
4023 inform (input_location
, "use template<> for an explicit specialization");
4024 /* Avoid crash in import_export_decl. */
4025 DECL_INTERFACE_KNOWN (decl
) = 1;
4026 return error_mark_node
;
4030 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
4031 TREE_TYPE (tmpl
) = TREE_TYPE (decl
);
4033 /* Push template declarations for global functions and types. Note
4034 that we do not try to push a global template friend declared in a
4035 template class; such a thing may well depend on the template
4036 parameters of the class. */
4037 if (new_template_p
&& !ctx
4038 && !(is_friend
&& template_class_depth (current_class_type
) > 0))
4040 tmpl
= pushdecl_namespace_level (tmpl
, is_friend
);
4041 if (tmpl
== error_mark_node
)
4042 return error_mark_node
;
4044 /* Hide template friend classes that haven't been declared yet. */
4045 if (is_friend
&& TREE_CODE (decl
) == TYPE_DECL
)
4047 DECL_ANTICIPATED (tmpl
) = 1;
4048 DECL_FRIEND_P (tmpl
) = 1;
4054 tree parms
= DECL_TEMPLATE_PARMS (tmpl
);
4057 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
4058 if (DECL_CONV_FN_P (tmpl
))
4060 int depth
= TMPL_PARMS_DEPTH (parms
);
4062 /* It is a conversion operator. See if the type converted to
4063 depends on innermost template operands. */
4065 if (uses_template_parms_level (TREE_TYPE (TREE_TYPE (tmpl
)),
4067 DECL_TEMPLATE_CONV_FN_P (tmpl
) = 1;
4070 /* Give template template parms a DECL_CONTEXT of the template
4071 for which they are a parameter. */
4072 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
4073 for (i
= TREE_VEC_LENGTH (parms
) - 1; i
>= 0; --i
)
4075 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
4076 if (TREE_CODE (parm
) == TEMPLATE_DECL
)
4077 DECL_CONTEXT (parm
) = tmpl
;
4081 /* The DECL_TI_ARGS of DECL contains full set of arguments referring
4082 back to its most general template. If TMPL is a specialization,
4083 ARGS may only have the innermost set of arguments. Add the missing
4084 argument levels if necessary. */
4085 if (DECL_TEMPLATE_INFO (tmpl
))
4086 args
= add_outermost_template_args (DECL_TI_ARGS (tmpl
), args
);
4088 info
= tree_cons (tmpl
, args
, NULL_TREE
);
4090 if (DECL_IMPLICIT_TYPEDEF_P (decl
))
4091 SET_TYPE_TEMPLATE_INFO (TREE_TYPE (tmpl
), info
);
4092 else if (DECL_LANG_SPECIFIC (decl
))
4093 DECL_TEMPLATE_INFO (decl
) = info
;
4095 return DECL_TEMPLATE_RESULT (tmpl
);
4099 push_template_decl (tree decl
)
4101 return push_template_decl_real (decl
, false);
4104 /* Called when a class template TYPE is redeclared with the indicated
4105 template PARMS, e.g.:
4107 template <class T> struct S;
4108 template <class T> struct S {}; */
4111 redeclare_class_template (tree type
, tree parms
)
4117 if (!TYPE_TEMPLATE_INFO (type
))
4119 error ("%qT is not a template type", type
);
4123 tmpl
= TYPE_TI_TEMPLATE (type
);
4124 if (!PRIMARY_TEMPLATE_P (tmpl
))
4125 /* The type is nested in some template class. Nothing to worry
4126 about here; there are no new template parameters for the nested
4132 error ("template specifiers not specified in declaration of %qD",
4137 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
4138 tmpl_parms
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl
);
4140 if (TREE_VEC_LENGTH (parms
) != TREE_VEC_LENGTH (tmpl_parms
))
4142 error ("redeclared with %d template parameter(s)",
4143 TREE_VEC_LENGTH (parms
));
4144 inform (input_location
, "previous declaration %q+D used %d template parameter(s)",
4145 tmpl
, TREE_VEC_LENGTH (tmpl_parms
));
4149 for (i
= 0; i
< TREE_VEC_LENGTH (tmpl_parms
); ++i
)
4156 if (TREE_VEC_ELT (tmpl_parms
, i
) == error_mark_node
4157 || TREE_VEC_ELT (parms
, i
) == error_mark_node
)
4160 tmpl_parm
= TREE_VALUE (TREE_VEC_ELT (tmpl_parms
, i
));
4161 parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
4162 tmpl_default
= TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
));
4163 parm_default
= TREE_PURPOSE (TREE_VEC_ELT (parms
, i
));
4165 /* TMPL_PARM and PARM can be either TYPE_DECL, PARM_DECL, or
4167 if (tmpl_parm
!= error_mark_node
4168 && (TREE_CODE (tmpl_parm
) != TREE_CODE (parm
)
4169 || (TREE_CODE (tmpl_parm
) != TYPE_DECL
4170 && !same_type_p (TREE_TYPE (tmpl_parm
), TREE_TYPE (parm
)))
4171 || (TREE_CODE (tmpl_parm
) != PARM_DECL
4172 && (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (tmpl_parm
))
4173 != TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
))))
4174 || (TREE_CODE (tmpl_parm
) == PARM_DECL
4175 && (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (tmpl_parm
))
4176 != TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
))))))
4178 error ("template parameter %q+#D", tmpl_parm
);
4179 error ("redeclared here as %q#D", parm
);
4183 if (tmpl_default
!= NULL_TREE
&& parm_default
!= NULL_TREE
)
4185 /* We have in [temp.param]:
4187 A template-parameter may not be given default arguments
4188 by two different declarations in the same scope. */
4189 error ("redefinition of default argument for %q#D", parm
);
4190 inform (input_location
, "%Joriginal definition appeared here", tmpl_parm
);
4194 if (parm_default
!= NULL_TREE
)
4195 /* Update the previous template parameters (which are the ones
4196 that will really count) with the new default value. */
4197 TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
)) = parm_default
;
4198 else if (tmpl_default
!= NULL_TREE
)
4199 /* Update the new parameters, too; they'll be used as the
4200 parameters for any members. */
4201 TREE_PURPOSE (TREE_VEC_ELT (parms
, i
)) = tmpl_default
;
4207 /* Simplify EXPR if it is a non-dependent expression. Returns the
4208 (possibly simplified) expression. */
4211 fold_non_dependent_expr (tree expr
)
4213 if (expr
== NULL_TREE
)
4216 /* If we're in a template, but EXPR isn't value dependent, simplify
4217 it. We're supposed to treat:
4219 template <typename T> void f(T[1 + 1]);
4220 template <typename T> void f(T[2]);
4222 as two declarations of the same function, for example. */
4223 if (processing_template_decl
4224 && !type_dependent_expression_p (expr
)
4225 && !value_dependent_expression_p (expr
))
4227 HOST_WIDE_INT saved_processing_template_decl
;
4229 saved_processing_template_decl
= processing_template_decl
;
4230 processing_template_decl
= 0;
4231 expr
= tsubst_copy_and_build (expr
,
4234 /*in_decl=*/NULL_TREE
,
4235 /*function_p=*/false,
4236 /*integral_constant_expression_p=*/true);
4237 processing_template_decl
= saved_processing_template_decl
;
4242 /* EXPR is an expression which is used in a constant-expression context.
4243 For instance, it could be a VAR_DECL with a constant initializer.
4244 Extract the innermost constant expression.
4246 This is basically a more powerful version of
4247 integral_constant_value, which can be used also in templates where
4248 initializers can maintain a syntactic rather than semantic form
4249 (even if they are non-dependent, for access-checking purposes). */
4252 fold_decl_constant_value (tree expr
)
4254 tree const_expr
= expr
;
4257 expr
= fold_non_dependent_expr (const_expr
);
4258 const_expr
= integral_constant_value (expr
);
4260 while (expr
!= const_expr
);
4265 /* Subroutine of convert_nontype_argument. Converts EXPR to TYPE, which
4266 must be a function or a pointer-to-function type, as specified
4267 in [temp.arg.nontype]: disambiguate EXPR if it is an overload set,
4268 and check that the resulting function has external linkage. */
4271 convert_nontype_argument_function (tree type
, tree expr
)
4276 fn
= instantiate_type (type
, fns
, tf_none
);
4277 if (fn
== error_mark_node
)
4278 return error_mark_node
;
4281 if (TREE_CODE (fn_no_ptr
) == ADDR_EXPR
)
4282 fn_no_ptr
= TREE_OPERAND (fn_no_ptr
, 0);
4283 if (TREE_CODE (fn_no_ptr
) == BASELINK
)
4284 fn_no_ptr
= BASELINK_FUNCTIONS (fn_no_ptr
);
4286 /* [temp.arg.nontype]/1
4288 A template-argument for a non-type, non-template template-parameter
4291 -- the address of an object or function with external linkage. */
4292 if (!DECL_EXTERNAL_LINKAGE_P (fn_no_ptr
))
4294 error ("%qE is not a valid template argument for type %qT "
4295 "because function %qD has not external linkage",
4296 expr
, type
, fn_no_ptr
);
4303 /* Attempt to convert the non-type template parameter EXPR to the
4304 indicated TYPE. If the conversion is successful, return the
4305 converted value. If the conversion is unsuccessful, return
4306 NULL_TREE if we issued an error message, or error_mark_node if we
4307 did not. We issue error messages for out-and-out bad template
4308 parameters, but not simply because the conversion failed, since we
4309 might be just trying to do argument deduction. Both TYPE and EXPR
4310 must be non-dependent.
4312 The conversion follows the special rules described in
4313 [temp.arg.nontype], and it is much more strict than an implicit
4316 This function is called twice for each template argument (see
4317 lookup_template_class for a more accurate description of this
4318 problem). This means that we need to handle expressions which
4319 are not valid in a C++ source, but can be created from the
4320 first call (for instance, casts to perform conversions). These
4321 hacks can go away after we fix the double coercion problem. */
4324 convert_nontype_argument (tree type
, tree expr
)
4328 /* Detect immediately string literals as invalid non-type argument.
4329 This special-case is not needed for correctness (we would easily
4330 catch this later), but only to provide better diagnostic for this
4331 common user mistake. As suggested by DR 100, we do not mention
4332 linkage issues in the diagnostic as this is not the point. */
4333 if (TREE_CODE (expr
) == STRING_CST
)
4335 error ("%qE is not a valid template argument for type %qT "
4336 "because string literals can never be used in this context",
4341 /* If we are in a template, EXPR may be non-dependent, but still
4342 have a syntactic, rather than semantic, form. For example, EXPR
4343 might be a SCOPE_REF, rather than the VAR_DECL to which the
4344 SCOPE_REF refers. Preserving the qualifying scope is necessary
4345 so that access checking can be performed when the template is
4346 instantiated -- but here we need the resolved form so that we can
4347 convert the argument. */
4348 expr
= fold_non_dependent_expr (expr
);
4349 if (error_operand_p (expr
))
4350 return error_mark_node
;
4351 expr_type
= TREE_TYPE (expr
);
4353 /* HACK: Due to double coercion, we can get a
4354 NOP_EXPR<REFERENCE_TYPE>(ADDR_EXPR<POINTER_TYPE> (arg)) here,
4355 which is the tree that we built on the first call (see
4356 below when coercing to reference to object or to reference to
4357 function). We just strip everything and get to the arg.
4358 See g++.old-deja/g++.oliva/template4.C and g++.dg/template/nontype9.C
4360 if (TREE_CODE (expr
) == NOP_EXPR
)
4362 if (TYPE_REF_OBJ_P (type
) || TYPE_REFFN_P (type
))
4364 /* ??? Maybe we could use convert_from_reference here, but we
4365 would need to relax its constraints because the NOP_EXPR
4366 could actually change the type to something more cv-qualified,
4367 and this is not folded by convert_from_reference. */
4368 tree addr
= TREE_OPERAND (expr
, 0);
4369 gcc_assert (TREE_CODE (expr_type
) == REFERENCE_TYPE
);
4370 gcc_assert (TREE_CODE (addr
) == ADDR_EXPR
);
4371 gcc_assert (TREE_CODE (TREE_TYPE (addr
)) == POINTER_TYPE
);
4372 gcc_assert (same_type_ignoring_top_level_qualifiers_p
4373 (TREE_TYPE (expr_type
),
4374 TREE_TYPE (TREE_TYPE (addr
))));
4376 expr
= TREE_OPERAND (addr
, 0);
4377 expr_type
= TREE_TYPE (expr
);
4380 /* We could also generate a NOP_EXPR(ADDR_EXPR()) when the
4381 parameter is a pointer to object, through decay and
4382 qualification conversion. Let's strip everything. */
4383 else if (TYPE_PTROBV_P (type
))
4386 gcc_assert (TREE_CODE (expr
) == ADDR_EXPR
);
4387 gcc_assert (TREE_CODE (TREE_TYPE (expr
)) == POINTER_TYPE
);
4388 /* Skip the ADDR_EXPR only if it is part of the decay for
4389 an array. Otherwise, it is part of the original argument
4390 in the source code. */
4391 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (expr
, 0))) == ARRAY_TYPE
)
4392 expr
= TREE_OPERAND (expr
, 0);
4393 expr_type
= TREE_TYPE (expr
);
4397 /* [temp.arg.nontype]/5, bullet 1
4399 For a non-type template-parameter of integral or enumeration type,
4400 integral promotions (_conv.prom_) and integral conversions
4401 (_conv.integral_) are applied. */
4402 if (INTEGRAL_TYPE_P (type
))
4404 if (!INTEGRAL_TYPE_P (expr_type
))
4405 return error_mark_node
;
4407 expr
= fold_decl_constant_value (expr
);
4408 /* Notice that there are constant expressions like '4 % 0' which
4409 do not fold into integer constants. */
4410 if (TREE_CODE (expr
) != INTEGER_CST
)
4412 error ("%qE is not a valid template argument for type %qT "
4413 "because it is a non-constant expression", expr
, type
);
4417 /* At this point, an implicit conversion does what we want,
4418 because we already know that the expression is of integral
4420 expr
= ocp_convert (type
, expr
, CONV_IMPLICIT
, LOOKUP_PROTECT
);
4421 if (expr
== error_mark_node
)
4422 return error_mark_node
;
4424 /* Conversion was allowed: fold it to a bare integer constant. */
4427 /* [temp.arg.nontype]/5, bullet 2
4429 For a non-type template-parameter of type pointer to object,
4430 qualification conversions (_conv.qual_) and the array-to-pointer
4431 conversion (_conv.array_) are applied. */
4432 else if (TYPE_PTROBV_P (type
))
4434 /* [temp.arg.nontype]/1 (TC1 version, DR 49):
4436 A template-argument for a non-type, non-template template-parameter
4437 shall be one of: [...]
4439 -- the name of a non-type template-parameter;
4440 -- the address of an object or function with external linkage, [...]
4441 expressed as "& id-expression" where the & is optional if the name
4442 refers to a function or array, or if the corresponding
4443 template-parameter is a reference.
4445 Here, we do not care about functions, as they are invalid anyway
4446 for a parameter of type pointer-to-object. */
4448 if (DECL_P (expr
) && DECL_TEMPLATE_PARM_P (expr
))
4449 /* Non-type template parameters are OK. */
4451 else if (TREE_CODE (expr
) != ADDR_EXPR
4452 && TREE_CODE (expr_type
) != ARRAY_TYPE
)
4454 if (TREE_CODE (expr
) == VAR_DECL
)
4456 error ("%qD is not a valid template argument "
4457 "because %qD is a variable, not the address of "
4462 /* Other values, like integer constants, might be valid
4463 non-type arguments of some other type. */
4464 return error_mark_node
;
4470 decl
= ((TREE_CODE (expr
) == ADDR_EXPR
)
4471 ? TREE_OPERAND (expr
, 0) : expr
);
4472 if (TREE_CODE (decl
) != VAR_DECL
)
4474 error ("%qE is not a valid template argument of type %qT "
4475 "because %qE is not a variable",
4479 else if (!DECL_EXTERNAL_LINKAGE_P (decl
))
4481 error ("%qE is not a valid template argument of type %qT "
4482 "because %qD does not have external linkage",
4488 expr
= decay_conversion (expr
);
4489 if (expr
== error_mark_node
)
4490 return error_mark_node
;
4492 expr
= perform_qualification_conversions (type
, expr
);
4493 if (expr
== error_mark_node
)
4494 return error_mark_node
;
4496 /* [temp.arg.nontype]/5, bullet 3
4498 For a non-type template-parameter of type reference to object, no
4499 conversions apply. The type referred to by the reference may be more
4500 cv-qualified than the (otherwise identical) type of the
4501 template-argument. The template-parameter is bound directly to the
4502 template-argument, which must be an lvalue. */
4503 else if (TYPE_REF_OBJ_P (type
))
4505 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type
),
4507 return error_mark_node
;
4509 if (!at_least_as_qualified_p (TREE_TYPE (type
), expr_type
))
4511 error ("%qE is not a valid template argument for type %qT "
4512 "because of conflicts in cv-qualification", expr
, type
);
4516 if (!real_lvalue_p (expr
))
4518 error ("%qE is not a valid template argument for type %qT "
4519 "because it is not an lvalue", expr
, type
);
4523 /* [temp.arg.nontype]/1
4525 A template-argument for a non-type, non-template template-parameter
4526 shall be one of: [...]
4528 -- the address of an object or function with external linkage. */
4529 if (!DECL_EXTERNAL_LINKAGE_P (expr
))
4531 error ("%qE is not a valid template argument for type %qT "
4532 "because object %qD has not external linkage",
4537 expr
= build_nop (type
, build_address (expr
));
4539 /* [temp.arg.nontype]/5, bullet 4
4541 For a non-type template-parameter of type pointer to function, only
4542 the function-to-pointer conversion (_conv.func_) is applied. If the
4543 template-argument represents a set of overloaded functions (or a
4544 pointer to such), the matching function is selected from the set
4546 else if (TYPE_PTRFN_P (type
))
4548 /* If the argument is a template-id, we might not have enough
4549 context information to decay the pointer. */
4550 if (!type_unknown_p (expr_type
))
4552 expr
= decay_conversion (expr
);
4553 if (expr
== error_mark_node
)
4554 return error_mark_node
;
4557 expr
= convert_nontype_argument_function (type
, expr
);
4558 if (!expr
|| expr
== error_mark_node
)
4561 /* [temp.arg.nontype]/5, bullet 5
4563 For a non-type template-parameter of type reference to function, no
4564 conversions apply. If the template-argument represents a set of
4565 overloaded functions, the matching function is selected from the set
4567 else if (TYPE_REFFN_P (type
))
4569 if (TREE_CODE (expr
) == ADDR_EXPR
)
4571 error ("%qE is not a valid template argument for type %qT "
4572 "because it is a pointer", expr
, type
);
4573 inform (input_location
, "try using %qE instead", TREE_OPERAND (expr
, 0));
4577 expr
= convert_nontype_argument_function (TREE_TYPE (type
), expr
);
4578 if (!expr
|| expr
== error_mark_node
)
4581 expr
= build_nop (type
, build_address (expr
));
4583 /* [temp.arg.nontype]/5, bullet 6
4585 For a non-type template-parameter of type pointer to member function,
4586 no conversions apply. If the template-argument represents a set of
4587 overloaded member functions, the matching member function is selected
4588 from the set (_over.over_). */
4589 else if (TYPE_PTRMEMFUNC_P (type
))
4591 expr
= instantiate_type (type
, expr
, tf_none
);
4592 if (expr
== error_mark_node
)
4593 return error_mark_node
;
4595 /* There is no way to disable standard conversions in
4596 resolve_address_of_overloaded_function (called by
4597 instantiate_type). It is possible that the call succeeded by
4598 converting &B::I to &D::I (where B is a base of D), so we need
4599 to reject this conversion here.
4601 Actually, even if there was a way to disable standard conversions,
4602 it would still be better to reject them here so that we can
4603 provide a superior diagnostic. */
4604 if (!same_type_p (TREE_TYPE (expr
), type
))
4606 /* Make sure we are just one standard conversion off. */
4607 gcc_assert (can_convert (type
, TREE_TYPE (expr
)));
4608 error ("%qE is not a valid template argument for type %qT "
4609 "because it is of type %qT", expr
, type
,
4611 inform (input_location
, "standard conversions are not allowed in this context");
4615 /* [temp.arg.nontype]/5, bullet 7
4617 For a non-type template-parameter of type pointer to data member,
4618 qualification conversions (_conv.qual_) are applied. */
4619 else if (TYPE_PTRMEM_P (type
))
4621 expr
= perform_qualification_conversions (type
, expr
);
4622 if (expr
== error_mark_node
)
4625 /* A template non-type parameter must be one of the above. */
4629 /* Sanity check: did we actually convert the argument to the
4631 gcc_assert (same_type_p (type
, TREE_TYPE (expr
)));
4635 /* Subroutine of coerce_template_template_parms, which returns 1 if
4636 PARM_PARM and ARG_PARM match using the rule for the template
4637 parameters of template template parameters. Both PARM and ARG are
4638 template parameters; the rest of the arguments are the same as for
4639 coerce_template_template_parms.
4642 coerce_template_template_parm (tree parm
,
4644 tsubst_flags_t complain
,
4648 if (arg
== NULL_TREE
|| arg
== error_mark_node
4649 || parm
== NULL_TREE
|| parm
== error_mark_node
)
4652 if (TREE_CODE (arg
) != TREE_CODE (parm
))
4655 switch (TREE_CODE (parm
))
4658 /* We encounter instantiations of templates like
4659 template <template <template <class> class> class TT>
4662 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
4663 tree argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
4665 if (!coerce_template_template_parms
4666 (parmparm
, argparm
, complain
, in_decl
, outer_args
))
4672 if (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (arg
))
4673 && !TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
)))
4674 /* Argument is a parameter pack but parameter is not. */
4679 /* The tsubst call is used to handle cases such as
4681 template <int> class C {};
4682 template <class T, template <T> class TT> class D {};
4685 i.e. the parameter list of TT depends on earlier parameters. */
4686 if (!dependent_type_p (TREE_TYPE (arg
))
4688 (tsubst (TREE_TYPE (parm
), outer_args
, complain
, in_decl
),
4692 if (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (arg
))
4693 && !TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))
4694 /* Argument is a parameter pack but parameter is not. */
4707 /* Return 1 if PARM_PARMS and ARG_PARMS matches using rule for
4708 template template parameters. Both PARM_PARMS and ARG_PARMS are
4709 vectors of TREE_LIST nodes containing TYPE_DECL, TEMPLATE_DECL
4712 Consider the example:
4713 template <class T> class A;
4714 template<template <class U> class TT> class B;
4716 For B<A>, PARM_PARMS are the parameters to TT, while ARG_PARMS are
4717 the parameters to A, and OUTER_ARGS contains A. */
4720 coerce_template_template_parms (tree parm_parms
,
4722 tsubst_flags_t complain
,
4726 int nparms
, nargs
, i
;
4730 gcc_assert (TREE_CODE (parm_parms
) == TREE_VEC
);
4731 gcc_assert (TREE_CODE (arg_parms
) == TREE_VEC
);
4733 nparms
= TREE_VEC_LENGTH (parm_parms
);
4734 nargs
= TREE_VEC_LENGTH (arg_parms
);
4736 /* Determine whether we have a parameter pack at the end of the
4737 template template parameter's template parameter list. */
4738 if (TREE_VEC_ELT (parm_parms
, nparms
- 1) != error_mark_node
)
4740 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, nparms
- 1));
4742 switch (TREE_CODE (parm
))
4746 if (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
)))
4751 if (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))
4761 && !(variadic_p
&& nargs
>= nparms
- 1))
4764 /* Check all of the template parameters except the parameter pack at
4765 the end (if any). */
4766 for (i
= 0; i
< nparms
- variadic_p
; ++i
)
4768 if (TREE_VEC_ELT (parm_parms
, i
) == error_mark_node
4769 || TREE_VEC_ELT (arg_parms
, i
) == error_mark_node
)
4772 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
4773 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
4775 if (!coerce_template_template_parm (parm
, arg
, complain
, in_decl
,
4783 /* Check each of the template parameters in the template
4784 argument against the template parameter pack at the end of
4785 the template template parameter. */
4786 if (TREE_VEC_ELT (parm_parms
, i
) == error_mark_node
)
4789 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
4791 for (; i
< nargs
; ++i
)
4793 if (TREE_VEC_ELT (arg_parms
, i
) == error_mark_node
)
4796 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
4798 if (!coerce_template_template_parm (parm
, arg
, complain
, in_decl
,
4807 /* Verifies that the deduced template arguments (in TARGS) for the
4808 template template parameters (in TPARMS) represent valid bindings,
4809 by comparing the template parameter list of each template argument
4810 to the template parameter list of its corresponding template
4811 template parameter, in accordance with DR150. This
4812 routine can only be called after all template arguments have been
4813 deduced. It will return TRUE if all of the template template
4814 parameter bindings are okay, FALSE otherwise. */
4816 template_template_parm_bindings_ok_p (tree tparms
, tree targs
)
4818 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
4821 /* We're dealing with template parms in this process. */
4822 ++processing_template_decl
;
4824 targs
= INNERMOST_TEMPLATE_ARGS (targs
);
4826 for (i
= 0; i
< ntparms
; ++i
)
4828 tree tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
4829 tree targ
= TREE_VEC_ELT (targs
, i
);
4831 if (TREE_CODE (tparm
) == TEMPLATE_DECL
&& targ
)
4833 tree packed_args
= NULL_TREE
;
4836 if (ARGUMENT_PACK_P (targ
))
4838 /* Look inside the argument pack. */
4839 packed_args
= ARGUMENT_PACK_ARGS (targ
);
4840 len
= TREE_VEC_LENGTH (packed_args
);
4843 for (idx
= 0; idx
< len
; ++idx
)
4845 tree targ_parms
= NULL_TREE
;
4848 /* Extract the next argument from the argument
4850 targ
= TREE_VEC_ELT (packed_args
, idx
);
4852 if (PACK_EXPANSION_P (targ
))
4853 /* Look at the pattern of the pack expansion. */
4854 targ
= PACK_EXPANSION_PATTERN (targ
);
4856 /* Extract the template parameters from the template
4858 if (TREE_CODE (targ
) == TEMPLATE_DECL
)
4859 targ_parms
= DECL_INNERMOST_TEMPLATE_PARMS (targ
);
4860 else if (TREE_CODE (targ
) == TEMPLATE_TEMPLATE_PARM
)
4861 targ_parms
= DECL_INNERMOST_TEMPLATE_PARMS (TYPE_NAME (targ
));
4863 /* Verify that we can coerce the template template
4864 parameters from the template argument to the template
4865 parameter. This requires an exact match. */
4867 && !coerce_template_template_parms
4868 (DECL_INNERMOST_TEMPLATE_PARMS (tparm
),
4883 --processing_template_decl
;
4887 /* Convert the indicated template ARG as necessary to match the
4888 indicated template PARM. Returns the converted ARG, or
4889 error_mark_node if the conversion was unsuccessful. Error and
4890 warning messages are issued under control of COMPLAIN. This
4891 conversion is for the Ith parameter in the parameter list. ARGS is
4892 the full set of template arguments deduced so far. */
4895 convert_template_argument (tree parm
,
4898 tsubst_flags_t complain
,
4904 int is_type
, requires_type
, is_tmpl_type
, requires_tmpl_type
;
4906 if (TREE_CODE (arg
) == TREE_LIST
4907 && TREE_CODE (TREE_VALUE (arg
)) == OFFSET_REF
)
4909 /* The template argument was the name of some
4910 member function. That's usually
4911 invalid, but static members are OK. In any
4912 case, grab the underlying fields/functions
4913 and issue an error later if required. */
4914 orig_arg
= TREE_VALUE (arg
);
4915 TREE_TYPE (arg
) = unknown_type_node
;
4920 requires_tmpl_type
= TREE_CODE (parm
) == TEMPLATE_DECL
;
4921 requires_type
= (TREE_CODE (parm
) == TYPE_DECL
4922 || requires_tmpl_type
);
4924 /* When determining whether an argument pack expansion is a template,
4925 look at the pattern. */
4926 if (TREE_CODE (arg
) == TYPE_PACK_EXPANSION
)
4927 arg
= PACK_EXPANSION_PATTERN (arg
);
4930 ((TREE_CODE (arg
) == TEMPLATE_DECL
4931 && TREE_CODE (DECL_TEMPLATE_RESULT (arg
)) == TYPE_DECL
)
4932 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
4933 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
);
4936 && (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
4937 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
))
4938 arg
= TYPE_STUB_DECL (arg
);
4940 is_type
= TYPE_P (arg
) || is_tmpl_type
;
4942 if (requires_type
&& ! is_type
&& TREE_CODE (arg
) == SCOPE_REF
4943 && TREE_CODE (TREE_OPERAND (arg
, 0)) == TEMPLATE_TYPE_PARM
)
4945 permerror (input_location
, "to refer to a type member of a template parameter, "
4946 "use %<typename %E%>", orig_arg
);
4948 orig_arg
= make_typename_type (TREE_OPERAND (arg
, 0),
4949 TREE_OPERAND (arg
, 1),
4951 complain
& tf_error
);
4955 if (is_type
!= requires_type
)
4959 if (complain
& tf_error
)
4961 error ("type/value mismatch at argument %d in template "
4962 "parameter list for %qD",
4965 error (" expected a constant of type %qT, got %qT",
4967 (DECL_P (arg
) ? DECL_NAME (arg
) : orig_arg
));
4968 else if (requires_tmpl_type
)
4969 error (" expected a class template, got %qE", orig_arg
);
4971 error (" expected a type, got %qE", orig_arg
);
4974 return error_mark_node
;
4976 if (is_tmpl_type
^ requires_tmpl_type
)
4978 if (in_decl
&& (complain
& tf_error
))
4980 error ("type/value mismatch at argument %d in template "
4981 "parameter list for %qD",
4984 error (" expected a type, got %qT", DECL_NAME (arg
));
4986 error (" expected a class template, got %qT", orig_arg
);
4988 return error_mark_node
;
4993 if (requires_tmpl_type
)
4995 if (TREE_CODE (TREE_TYPE (arg
)) == UNBOUND_CLASS_TEMPLATE
)
4996 /* The number of argument required is not known yet.
4997 Just accept it for now. */
4998 val
= TREE_TYPE (arg
);
5001 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
5004 argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
5006 if (coerce_template_template_parms (parmparm
, argparm
,
5012 /* TEMPLATE_TEMPLATE_PARM node is preferred over
5014 if (val
!= error_mark_node
)
5016 if (DECL_TEMPLATE_TEMPLATE_PARM_P (val
))
5017 val
= TREE_TYPE (val
);
5018 else if (TREE_CODE (val
) == TYPE_PACK_EXPANSION
5019 && DECL_TEMPLATE_TEMPLATE_PARM_P (arg
))
5021 val
= TREE_TYPE (arg
);
5022 val
= make_pack_expansion (val
);
5028 if (in_decl
&& (complain
& tf_error
))
5030 error ("type/value mismatch at argument %d in "
5031 "template parameter list for %qD",
5033 error (" expected a template of type %qD, got %qD",
5037 val
= error_mark_node
;
5043 /* We only form one instance of each template specialization.
5044 Therefore, if we use a non-canonical variant (i.e., a
5045 typedef), any future messages referring to the type will use
5046 the typedef, which is confusing if those future uses do not
5047 themselves also use the typedef. */
5049 val
= canonical_type_variant (val
);
5053 tree t
= tsubst (TREE_TYPE (parm
), args
, complain
, in_decl
);
5055 if (invalid_nontype_parm_type_p (t
, complain
))
5056 return error_mark_node
;
5058 if (!uses_template_parms (orig_arg
) && !uses_template_parms (t
))
5059 /* We used to call digest_init here. However, digest_init
5060 will report errors, which we don't want when complain
5061 is zero. More importantly, digest_init will try too
5062 hard to convert things: for example, `0' should not be
5063 converted to pointer type at this point according to
5064 the standard. Accepting this is not merely an
5065 extension, since deciding whether or not these
5066 conversions can occur is part of determining which
5067 function template to call, or whether a given explicit
5068 argument specification is valid. */
5069 val
= convert_nontype_argument (t
, orig_arg
);
5073 if (val
== NULL_TREE
)
5074 val
= error_mark_node
;
5075 else if (val
== error_mark_node
&& (complain
& tf_error
))
5076 error ("could not convert template argument %qE to %qT", orig_arg
, t
);
5082 /* Coerces the remaining template arguments in INNER_ARGS (from
5083 ARG_IDX to the end) into the parameter pack at PARM_IDX in PARMS.
5084 Returns the coerced argument pack. PARM_IDX is the position of this
5085 parameter in the template parameter list. ARGS is the original
5086 template argument list. */
5088 coerce_template_parameter_pack (tree parms
,
5096 tsubst_flags_t complain
)
5098 tree parm
= TREE_VEC_ELT (parms
, parm_idx
);
5099 int nargs
= inner_args
? NUM_TMPL_ARGS (inner_args
) : 0;
5102 tree packed_types
= NULL_TREE
;
5104 if (arg_idx
> nargs
)
5107 packed_args
= make_tree_vec (nargs
- arg_idx
);
5109 if (TREE_CODE (TREE_VALUE (parm
)) == PARM_DECL
5110 && uses_parameter_packs (TREE_TYPE (TREE_VALUE (parm
))))
5112 /* When the template parameter is a non-type template
5113 parameter pack whose type uses parameter packs, we need
5114 to look at each of the template arguments
5115 separately. Build a vector of the types for these
5116 non-type template parameters in PACKED_TYPES. */
5118 = make_pack_expansion (TREE_TYPE (TREE_VALUE (parm
)));
5119 packed_types
= tsubst_pack_expansion (expansion
, args
,
5122 if (packed_types
== error_mark_node
)
5123 return error_mark_node
;
5125 /* Check that we have the right number of arguments. */
5127 && !PACK_EXPANSION_P (TREE_VEC_ELT (inner_args
, arg_idx
))
5128 && nargs
- arg_idx
!= TREE_VEC_LENGTH (packed_types
))
5131 = TREE_VEC_LENGTH (parms
) - 1 + TREE_VEC_LENGTH (packed_types
);
5132 error ("wrong number of template arguments (%d, should be %d)",
5133 nargs
, needed_parms
);
5134 return error_mark_node
;
5137 /* If we aren't able to check the actual arguments now
5138 (because they haven't been expanded yet), we can at least
5139 verify that all of the types used for the non-type
5140 template parameter pack are, in fact, valid for non-type
5141 template parameters. */
5143 && PACK_EXPANSION_P (TREE_VEC_ELT (inner_args
, arg_idx
)))
5145 int j
, len
= TREE_VEC_LENGTH (packed_types
);
5146 for (j
= 0; j
< len
; ++j
)
5148 tree t
= TREE_VEC_ELT (packed_types
, j
);
5149 if (invalid_nontype_parm_type_p (t
, complain
))
5150 return error_mark_node
;
5155 /* Convert the remaining arguments, which will be a part of the
5156 parameter pack "parm". */
5157 for (; arg_idx
< nargs
; ++arg_idx
)
5159 tree arg
= TREE_VEC_ELT (inner_args
, arg_idx
);
5160 tree actual_parm
= TREE_VALUE (parm
);
5162 if (packed_types
&& !PACK_EXPANSION_P (arg
))
5164 /* When we have a vector of types (corresponding to the
5165 non-type template parameter pack that uses parameter
5166 packs in its type, as mention above), and the
5167 argument is not an expansion (which expands to a
5168 currently unknown number of arguments), clone the
5169 parm and give it the next type in PACKED_TYPES. */
5170 actual_parm
= copy_node (actual_parm
);
5171 TREE_TYPE (actual_parm
) =
5172 TREE_VEC_ELT (packed_types
, arg_idx
- parm_idx
);
5175 if (arg
!= error_mark_node
)
5176 arg
= convert_template_argument (actual_parm
,
5177 arg
, new_args
, complain
, parm_idx
,
5179 if (arg
== error_mark_node
)
5181 TREE_VEC_ELT (packed_args
, arg_idx
- parm_idx
) = arg
;
5184 if (TREE_CODE (TREE_VALUE (parm
)) == TYPE_DECL
5185 || TREE_CODE (TREE_VALUE (parm
)) == TEMPLATE_DECL
)
5186 argument_pack
= make_node (TYPE_ARGUMENT_PACK
);
5189 argument_pack
= make_node (NONTYPE_ARGUMENT_PACK
);
5190 TREE_TYPE (argument_pack
)
5191 = tsubst (TREE_TYPE (TREE_VALUE (parm
)), new_args
, complain
, in_decl
);
5192 TREE_CONSTANT (argument_pack
) = 1;
5195 SET_ARGUMENT_PACK_ARGS (argument_pack
, packed_args
);
5196 return argument_pack
;
5199 /* Convert all template arguments to their appropriate types, and
5200 return a vector containing the innermost resulting template
5201 arguments. If any error occurs, return error_mark_node. Error and
5202 warning messages are issued under control of COMPLAIN.
5204 If REQUIRE_ALL_ARGS is false, argument deduction will be performed
5205 for arguments not specified in ARGS. Otherwise, if
5206 USE_DEFAULT_ARGS is true, default arguments will be used to fill in
5207 unspecified arguments. If REQUIRE_ALL_ARGS is true, but
5208 USE_DEFAULT_ARGS is false, then all arguments must be specified in
5212 coerce_template_parms (tree parms
,
5215 tsubst_flags_t complain
,
5216 bool require_all_args
,
5217 bool use_default_args
)
5219 int nparms
, nargs
, parm_idx
, arg_idx
, lost
= 0;
5222 tree new_inner_args
;
5223 bool saved_skip_evaluation
;
5225 /* When used as a boolean value, indicates whether this is a
5226 variadic template parameter list. Since it's an int, we can also
5227 subtract it from nparms to get the number of non-variadic
5232 = expand_template_argument_pack (INNERMOST_TEMPLATE_ARGS (args
));
5234 nargs
= inner_args
? NUM_TMPL_ARGS (inner_args
) : 0;
5235 nparms
= TREE_VEC_LENGTH (parms
);
5237 /* Determine if there are any parameter packs. */
5238 for (parm_idx
= 0; parm_idx
< nparms
; ++parm_idx
)
5240 tree tparm
= TREE_VALUE (TREE_VEC_ELT (parms
, parm_idx
));
5241 if (template_parameter_pack_p (tparm
))
5248 if ((nargs
> nparms
- variadic_p
&& !variadic_p
)
5249 || (nargs
< nparms
- variadic_p
5251 && (!use_default_args
5252 || (TREE_VEC_ELT (parms
, nargs
) != error_mark_node
5253 && !TREE_PURPOSE (TREE_VEC_ELT (parms
, nargs
))))))
5255 if (complain
& tf_error
)
5257 const char *or_more
= "";
5260 or_more
= " or more";
5264 error ("wrong number of template arguments (%d, should be %d%s)",
5265 nargs
, nparms
, or_more
);
5268 error ("provided for %q+D", in_decl
);
5271 return error_mark_node
;
5274 /* We need to evaluate the template arguments, even though this
5275 template-id may be nested within a "sizeof". */
5276 saved_skip_evaluation
= skip_evaluation
;
5277 skip_evaluation
= false;
5278 new_inner_args
= make_tree_vec (nparms
);
5279 new_args
= add_outermost_template_args (args
, new_inner_args
);
5280 for (parm_idx
= 0, arg_idx
= 0; parm_idx
< nparms
; parm_idx
++, arg_idx
++)
5285 /* Get the Ith template parameter. */
5286 parm
= TREE_VEC_ELT (parms
, parm_idx
);
5288 if (parm
== error_mark_node
)
5290 TREE_VEC_ELT (new_inner_args
, arg_idx
) = error_mark_node
;
5294 /* Calculate the next argument. */
5295 if (template_parameter_pack_p (TREE_VALUE (parm
)))
5297 /* All remaining arguments will be placed in the
5298 template parameter pack PARM. */
5299 arg
= coerce_template_parameter_pack (parms
, parm_idx
, args
,
5300 inner_args
, arg_idx
,
5304 /* Store this argument. */
5305 if (arg
== error_mark_node
)
5307 TREE_VEC_ELT (new_inner_args
, parm_idx
) = arg
;
5309 /* We are done with all of the arguments. */
5314 else if (arg_idx
< nargs
)
5316 arg
= TREE_VEC_ELT (inner_args
, arg_idx
);
5318 if (arg
&& PACK_EXPANSION_P (arg
))
5320 if (complain
& tf_error
)
5322 /* If ARG is a pack expansion, but PARM is not a
5323 template parameter pack (if it were, we would have
5324 handled it above), we're trying to expand into a
5325 fixed-length argument list. */
5326 if (TREE_CODE (arg
) == EXPR_PACK_EXPANSION
)
5327 error ("cannot expand %<%E%> into a fixed-length "
5328 "argument list", arg
);
5330 error ("cannot expand %<%T%> into a fixed-length "
5331 "argument list", arg
);
5333 return error_mark_node
;
5336 else if (require_all_args
)
5337 /* There must be a default arg in this case. */
5338 arg
= tsubst_template_arg (TREE_PURPOSE (parm
), new_args
,
5343 if (arg
== error_mark_node
)
5345 if (complain
& tf_error
)
5346 error ("template argument %d is invalid", arg_idx
+ 1);
5349 /* This only occurs if there was an error in the template
5350 parameter list itself (which we would already have
5351 reported) that we are trying to recover from, e.g., a class
5352 template with a parameter list such as
5353 template<typename..., typename>. */
5354 return error_mark_node
;
5356 arg
= convert_template_argument (TREE_VALUE (parm
),
5357 arg
, new_args
, complain
,
5360 if (arg
== error_mark_node
)
5362 TREE_VEC_ELT (new_inner_args
, arg_idx
) = arg
;
5364 skip_evaluation
= saved_skip_evaluation
;
5367 return error_mark_node
;
5369 return new_inner_args
;
5372 /* Returns 1 if template args OT and NT are equivalent. */
5375 template_args_equal (tree ot
, tree nt
)
5380 if (TREE_CODE (nt
) == TREE_VEC
)
5381 /* For member templates */
5382 return TREE_CODE (ot
) == TREE_VEC
&& comp_template_args (ot
, nt
);
5383 else if (PACK_EXPANSION_P (ot
))
5384 return PACK_EXPANSION_P (nt
)
5385 && template_args_equal (PACK_EXPANSION_PATTERN (ot
),
5386 PACK_EXPANSION_PATTERN (nt
));
5387 else if (TYPE_P (nt
))
5388 return TYPE_P (ot
) && same_type_p (ot
, nt
);
5389 else if (TREE_CODE (ot
) == TREE_VEC
|| TYPE_P (ot
))
5392 return cp_tree_equal (ot
, nt
);
5395 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets
5396 of template arguments. Returns 0 otherwise. */
5399 comp_template_args (tree oldargs
, tree newargs
)
5403 oldargs
= expand_template_argument_pack (oldargs
);
5404 newargs
= expand_template_argument_pack (newargs
);
5406 if (TREE_VEC_LENGTH (oldargs
) != TREE_VEC_LENGTH (newargs
))
5409 for (i
= 0; i
< TREE_VEC_LENGTH (oldargs
); ++i
)
5411 tree nt
= TREE_VEC_ELT (newargs
, i
);
5412 tree ot
= TREE_VEC_ELT (oldargs
, i
);
5414 if (! template_args_equal (ot
, nt
))
5421 add_pending_template (tree d
)
5423 tree ti
= (TYPE_P (d
)
5424 ? CLASSTYPE_TEMPLATE_INFO (d
)
5425 : DECL_TEMPLATE_INFO (d
));
5426 struct pending_template
*pt
;
5429 if (TI_PENDING_TEMPLATE_FLAG (ti
))
5432 /* We are called both from instantiate_decl, where we've already had a
5433 tinst_level pushed, and instantiate_template, where we haven't.
5435 level
= !current_tinst_level
|| current_tinst_level
->decl
!= d
;
5438 push_tinst_level (d
);
5440 pt
= GGC_NEW (struct pending_template
);
5442 pt
->tinst
= current_tinst_level
;
5443 if (last_pending_template
)
5444 last_pending_template
->next
= pt
;
5446 pending_templates
= pt
;
5448 last_pending_template
= pt
;
5450 TI_PENDING_TEMPLATE_FLAG (ti
) = 1;
5457 /* Return a TEMPLATE_ID_EXPR corresponding to the indicated FNS and
5458 ARGLIST. Valid choices for FNS are given in the cp-tree.def
5459 documentation for TEMPLATE_ID_EXPR. */
5462 lookup_template_function (tree fns
, tree arglist
)
5466 if (fns
== error_mark_node
|| arglist
== error_mark_node
)
5467 return error_mark_node
;
5469 gcc_assert (!arglist
|| TREE_CODE (arglist
) == TREE_VEC
);
5470 gcc_assert (fns
&& (is_overloaded_fn (fns
)
5471 || TREE_CODE (fns
) == IDENTIFIER_NODE
));
5473 if (BASELINK_P (fns
))
5475 BASELINK_FUNCTIONS (fns
) = build2 (TEMPLATE_ID_EXPR
,
5477 BASELINK_FUNCTIONS (fns
),
5482 type
= TREE_TYPE (fns
);
5483 if (TREE_CODE (fns
) == OVERLOAD
|| !type
)
5484 type
= unknown_type_node
;
5486 return build2 (TEMPLATE_ID_EXPR
, type
, fns
, arglist
);
5489 /* Within the scope of a template class S<T>, the name S gets bound
5490 (in build_self_reference) to a TYPE_DECL for the class, not a
5491 TEMPLATE_DECL. If DECL is a TYPE_DECL for current_class_type,
5492 or one of its enclosing classes, and that type is a template,
5493 return the associated TEMPLATE_DECL. Otherwise, the original
5494 DECL is returned. */
5497 maybe_get_template_decl_from_type_decl (tree decl
)
5499 return (decl
!= NULL_TREE
5500 && TREE_CODE (decl
) == TYPE_DECL
5501 && DECL_ARTIFICIAL (decl
)
5502 && CLASS_TYPE_P (TREE_TYPE (decl
))
5503 && CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (decl
)))
5504 ? CLASSTYPE_TI_TEMPLATE (TREE_TYPE (decl
)) : decl
;
5507 /* Given an IDENTIFIER_NODE (type TEMPLATE_DECL) and a chain of
5508 parameters, find the desired type.
5510 D1 is the PTYPENAME terminal, and ARGLIST is the list of arguments.
5512 IN_DECL, if non-NULL, is the template declaration we are trying to
5515 If ENTERING_SCOPE is nonzero, we are about to enter the scope of
5516 the class we are looking up.
5518 Issue error and warning messages under control of COMPLAIN.
5520 If the template class is really a local class in a template
5521 function, then the FUNCTION_CONTEXT is the function in which it is
5524 ??? Note that this function is currently called *twice* for each
5525 template-id: the first time from the parser, while creating the
5526 incomplete type (finish_template_type), and the second type during the
5527 real instantiation (instantiate_template_class). This is surely something
5528 that we want to avoid. It also causes some problems with argument
5529 coercion (see convert_nontype_argument for more information on this). */
5532 lookup_template_class (tree d1
,
5537 tsubst_flags_t complain
)
5539 tree templ
= NULL_TREE
, parmlist
;
5542 timevar_push (TV_NAME_LOOKUP
);
5544 if (TREE_CODE (d1
) == IDENTIFIER_NODE
)
5546 tree value
= innermost_non_namespace_value (d1
);
5547 if (value
&& DECL_TEMPLATE_TEMPLATE_PARM_P (value
))
5552 push_decl_namespace (context
);
5553 templ
= lookup_name (d1
);
5554 templ
= maybe_get_template_decl_from_type_decl (templ
);
5556 pop_decl_namespace ();
5559 context
= DECL_CONTEXT (templ
);
5561 else if (TREE_CODE (d1
) == TYPE_DECL
&& MAYBE_CLASS_TYPE_P (TREE_TYPE (d1
)))
5563 tree type
= TREE_TYPE (d1
);
5565 /* If we are declaring a constructor, say A<T>::A<T>, we will get
5566 an implicit typename for the second A. Deal with it. */
5567 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
5568 type
= TREE_TYPE (type
);
5570 if (CLASSTYPE_TEMPLATE_INFO (type
))
5572 templ
= CLASSTYPE_TI_TEMPLATE (type
);
5573 d1
= DECL_NAME (templ
);
5576 else if (TREE_CODE (d1
) == ENUMERAL_TYPE
5577 || (TYPE_P (d1
) && MAYBE_CLASS_TYPE_P (d1
)))
5579 templ
= TYPE_TI_TEMPLATE (d1
);
5580 d1
= DECL_NAME (templ
);
5582 else if (TREE_CODE (d1
) == TEMPLATE_DECL
5583 && TREE_CODE (DECL_TEMPLATE_RESULT (d1
)) == TYPE_DECL
)
5586 d1
= DECL_NAME (templ
);
5587 context
= DECL_CONTEXT (templ
);
5590 /* Issue an error message if we didn't find a template. */
5593 if (complain
& tf_error
)
5594 error ("%qT is not a template", d1
);
5595 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP
, error_mark_node
);
5598 if (TREE_CODE (templ
) != TEMPLATE_DECL
5599 /* Make sure it's a user visible template, if it was named by
5601 || ((complain
& tf_user
) && !DECL_TEMPLATE_PARM_P (templ
)
5602 && !PRIMARY_TEMPLATE_P (templ
)))
5604 if (complain
& tf_error
)
5606 error ("non-template type %qT used as a template", d1
);
5608 error ("for template declaration %q+D", in_decl
);
5610 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP
, error_mark_node
);
5613 complain
&= ~tf_user
;
5615 if (DECL_TEMPLATE_TEMPLATE_PARM_P (templ
))
5617 /* Create a new TEMPLATE_DECL and TEMPLATE_TEMPLATE_PARM node to store
5618 template arguments */
5624 parmlist
= DECL_INNERMOST_TEMPLATE_PARMS (templ
);
5626 /* Consider an example where a template template parameter declared as
5628 template <class T, class U = std::allocator<T> > class TT
5630 The template parameter level of T and U are one level larger than
5631 of TT. To proper process the default argument of U, say when an
5632 instantiation `TT<int>' is seen, we need to build the full
5633 arguments containing {int} as the innermost level. Outer levels,
5634 available when not appearing as default template argument, can be
5635 obtained from the arguments of the enclosing template.
5637 Suppose that TT is later substituted with std::vector. The above
5638 instantiation is `TT<int, std::allocator<T> >' with TT at
5639 level 1, and T at level 2, while the template arguments at level 1
5640 becomes {std::vector} and the inner level 2 is {int}. */
5642 outer
= DECL_CONTEXT (templ
);
5644 outer
= TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (outer
)));
5645 else if (current_template_parms
)
5646 /* This is an argument of the current template, so we haven't set
5647 DECL_CONTEXT yet. */
5648 outer
= current_template_args ();
5651 arglist
= add_to_template_args (outer
, arglist
);
5653 arglist2
= coerce_template_parms (parmlist
, arglist
, templ
,
5655 /*require_all_args=*/true,
5656 /*use_default_args=*/true);
5657 if (arglist2
== error_mark_node
5658 || (!uses_template_parms (arglist2
)
5659 && check_instantiated_args (templ
, arglist2
, complain
)))
5660 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP
, error_mark_node
);
5662 parm
= bind_template_template_parm (TREE_TYPE (templ
), arglist2
);
5663 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP
, parm
);
5667 tree template_type
= TREE_TYPE (templ
);
5670 tree found
= NULL_TREE
;
5673 int is_partial_instantiation
;
5675 gen_tmpl
= most_general_template (templ
);
5676 parmlist
= DECL_TEMPLATE_PARMS (gen_tmpl
);
5677 parm_depth
= TMPL_PARMS_DEPTH (parmlist
);
5678 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
5680 if (arg_depth
== 1 && parm_depth
> 1)
5682 /* We've been given an incomplete set of template arguments.
5685 template <class T> struct S1 {
5686 template <class U> struct S2 {};
5687 template <class U> struct S2<U*> {};
5690 we will be called with an ARGLIST of `U*', but the
5691 TEMPLATE will be `template <class T> template
5692 <class U> struct S1<T>::S2'. We must fill in the missing
5695 = add_outermost_template_args (TYPE_TI_ARGS (TREE_TYPE (templ
)),
5697 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
5700 /* Now we should have enough arguments. */
5701 gcc_assert (parm_depth
== arg_depth
);
5703 /* From here on, we're only interested in the most general
5707 /* Calculate the BOUND_ARGS. These will be the args that are
5708 actually tsubst'd into the definition to create the
5712 /* We have multiple levels of arguments to coerce, at once. */
5714 int saved_depth
= TMPL_ARGS_DEPTH (arglist
);
5716 tree bound_args
= make_tree_vec (parm_depth
);
5718 for (i
= saved_depth
,
5719 t
= DECL_TEMPLATE_PARMS (templ
);
5720 i
> 0 && t
!= NULL_TREE
;
5721 --i
, t
= TREE_CHAIN (t
))
5723 tree a
= coerce_template_parms (TREE_VALUE (t
),
5726 /*require_all_args=*/true,
5727 /*use_default_args=*/true);
5729 /* Don't process further if one of the levels fails. */
5730 if (a
== error_mark_node
)
5732 /* Restore the ARGLIST to its full size. */
5733 TREE_VEC_LENGTH (arglist
) = saved_depth
;
5734 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP
, error_mark_node
);
5737 SET_TMPL_ARGS_LEVEL (bound_args
, i
, a
);
5739 /* We temporarily reduce the length of the ARGLIST so
5740 that coerce_template_parms will see only the arguments
5741 corresponding to the template parameters it is
5743 TREE_VEC_LENGTH (arglist
)--;
5746 /* Restore the ARGLIST to its full size. */
5747 TREE_VEC_LENGTH (arglist
) = saved_depth
;
5749 arglist
= bound_args
;
5753 = coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parmlist
),
5754 INNERMOST_TEMPLATE_ARGS (arglist
),
5757 /*require_all_args=*/true,
5758 /*use_default_args=*/true);
5760 if (arglist
== error_mark_node
)
5761 /* We were unable to bind the arguments. */
5762 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP
, error_mark_node
);
5764 /* In the scope of a template class, explicit references to the
5765 template class refer to the type of the template, not any
5766 instantiation of it. For example, in:
5768 template <class T> class C { void f(C<T>); }
5770 the `C<T>' is just the same as `C'. Outside of the
5771 class, however, such a reference is an instantiation. */
5772 if (comp_template_args (TYPE_TI_ARGS (template_type
),
5775 found
= template_type
;
5777 if (!entering_scope
&& PRIMARY_TEMPLATE_P (templ
))
5781 for (ctx
= current_class_type
;
5782 ctx
&& TREE_CODE (ctx
) != NAMESPACE_DECL
;
5784 ? TYPE_CONTEXT (ctx
)
5785 : DECL_CONTEXT (ctx
)))
5786 if (TYPE_P (ctx
) && same_type_p (ctx
, template_type
))
5789 /* We're not in the scope of the class, so the
5790 TEMPLATE_TYPE is not the type we want after all. */
5796 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP
, found
);
5798 /* If we already have this specialization, return it. */
5799 found
= retrieve_specialization (templ
, arglist
,
5800 /*class_specializations_p=*/false);
5802 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP
, found
);
5804 /* This type is a "partial instantiation" if any of the template
5805 arguments still involve template parameters. Note that we set
5806 IS_PARTIAL_INSTANTIATION for partial specializations as
5808 is_partial_instantiation
= uses_template_parms (arglist
);
5810 /* If the deduced arguments are invalid, then the binding
5812 if (!is_partial_instantiation
5813 && check_instantiated_args (templ
,
5814 INNERMOST_TEMPLATE_ARGS (arglist
),
5816 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP
, error_mark_node
);
5818 if (!is_partial_instantiation
5819 && !PRIMARY_TEMPLATE_P (templ
)
5820 && TREE_CODE (CP_DECL_CONTEXT (templ
)) == NAMESPACE_DECL
)
5822 found
= xref_tag_from_type (TREE_TYPE (templ
),
5824 /*tag_scope=*/ts_global
);
5825 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP
, found
);
5828 context
= tsubst (DECL_CONTEXT (templ
), arglist
,
5831 context
= global_namespace
;
5833 /* Create the type. */
5834 if (TREE_CODE (template_type
) == ENUMERAL_TYPE
)
5836 if (!is_partial_instantiation
)
5838 set_current_access_from_decl (TYPE_NAME (template_type
));
5839 t
= start_enum (TYPE_IDENTIFIER (template_type
),
5840 tsubst (ENUM_UNDERLYING_TYPE (template_type
),
5841 arglist
, complain
, in_decl
),
5842 SCOPED_ENUM_P (template_type
));
5846 /* We don't want to call start_enum for this type, since
5847 the values for the enumeration constants may involve
5848 template parameters. And, no one should be interested
5849 in the enumeration constants for such a type. */
5850 t
= make_node (ENUMERAL_TYPE
);
5851 SET_SCOPED_ENUM_P (t
, SCOPED_ENUM_P (template_type
));
5856 t
= make_class_type (TREE_CODE (template_type
));
5857 CLASSTYPE_DECLARED_CLASS (t
)
5858 = CLASSTYPE_DECLARED_CLASS (template_type
);
5859 SET_CLASSTYPE_IMPLICIT_INSTANTIATION (t
);
5860 TYPE_FOR_JAVA (t
) = TYPE_FOR_JAVA (template_type
);
5862 /* A local class. Make sure the decl gets registered properly. */
5863 if (context
== current_function_decl
)
5864 pushtag (DECL_NAME (templ
), t
, /*tag_scope=*/ts_current
);
5866 if (comp_template_args (CLASSTYPE_TI_ARGS (template_type
), arglist
))
5867 /* This instantiation is another name for the primary
5868 template type. Set the TYPE_CANONICAL field
5870 TYPE_CANONICAL (t
) = template_type
;
5871 else if (any_template_arguments_need_structural_equality_p (arglist
))
5872 /* Some of the template arguments require structural
5873 equality testing, so this template class requires
5874 structural equality testing. */
5875 SET_TYPE_STRUCTURAL_EQUALITY (t
);
5878 /* If we called start_enum or pushtag above, this information
5879 will already be set up. */
5882 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
5884 type_decl
= create_implicit_typedef (DECL_NAME (templ
), t
);
5885 DECL_CONTEXT (type_decl
) = TYPE_CONTEXT (t
);
5886 TYPE_STUB_DECL (t
) = type_decl
;
5887 DECL_SOURCE_LOCATION (type_decl
)
5888 = DECL_SOURCE_LOCATION (TYPE_STUB_DECL (template_type
));
5891 type_decl
= TYPE_NAME (t
);
5893 TREE_PRIVATE (type_decl
)
5894 = TREE_PRIVATE (TYPE_STUB_DECL (template_type
));
5895 TREE_PROTECTED (type_decl
)
5896 = TREE_PROTECTED (TYPE_STUB_DECL (template_type
));
5897 if (CLASSTYPE_VISIBILITY_SPECIFIED (template_type
))
5899 DECL_VISIBILITY_SPECIFIED (type_decl
) = 1;
5900 DECL_VISIBILITY (type_decl
) = CLASSTYPE_VISIBILITY (template_type
);
5903 /* Set up the template information. We have to figure out which
5904 template is the immediate parent if this is a full
5906 if (parm_depth
== 1 || is_partial_instantiation
5907 || !PRIMARY_TEMPLATE_P (templ
))
5908 /* This case is easy; there are no member templates involved. */
5912 /* This is a full instantiation of a member template. Look
5913 for a partial instantiation of which this is an instance. */
5915 for (found
= DECL_TEMPLATE_INSTANTIATIONS (templ
);
5916 found
; found
= TREE_CHAIN (found
))
5919 tree tmpl
= CLASSTYPE_TI_TEMPLATE (TREE_VALUE (found
));
5921 /* We only want partial instantiations, here, not
5922 specializations or full instantiations. */
5923 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_VALUE (found
))
5924 || !uses_template_parms (TREE_VALUE (found
)))
5927 /* Temporarily reduce by one the number of levels in the
5928 ARGLIST and in FOUND so as to avoid comparing the
5929 last set of arguments. */
5930 TREE_VEC_LENGTH (arglist
)--;
5931 TREE_VEC_LENGTH (TREE_PURPOSE (found
)) --;
5933 /* See if the arguments match. If they do, then TMPL is
5934 the partial instantiation we want. */
5935 success
= comp_template_args (TREE_PURPOSE (found
), arglist
);
5937 /* Restore the argument vectors to their full size. */
5938 TREE_VEC_LENGTH (arglist
)++;
5939 TREE_VEC_LENGTH (TREE_PURPOSE (found
))++;
5950 /* There was no partial instantiation. This happens
5951 where C<T> is a member template of A<T> and it's used
5954 template <typename T> struct B { A<T>::C<int> m; };
5957 Create the partial instantiation.
5959 TREE_VEC_LENGTH (arglist
)--;
5960 found
= tsubst (templ
, arglist
, complain
, NULL_TREE
);
5961 TREE_VEC_LENGTH (arglist
)++;
5965 SET_TYPE_TEMPLATE_INFO (t
, tree_cons (found
, arglist
, NULL_TREE
));
5966 DECL_TEMPLATE_INSTANTIATIONS (templ
)
5967 = tree_cons (arglist
, t
,
5968 DECL_TEMPLATE_INSTANTIATIONS (templ
));
5970 if (TREE_CODE (t
) == ENUMERAL_TYPE
5971 && !is_partial_instantiation
)
5972 /* Now that the type has been registered on the instantiations
5973 list, we set up the enumerators. Because the enumeration
5974 constants may involve the enumeration type itself, we make
5975 sure to register the type first, and then create the
5976 constants. That way, doing tsubst_expr for the enumeration
5977 constants won't result in recursive calls here; we'll find
5978 the instantiation and exit above. */
5979 tsubst_enum (template_type
, t
, arglist
);
5981 if (is_partial_instantiation
)
5982 /* If the type makes use of template parameters, the
5983 code that generates debugging information will crash. */
5984 DECL_IGNORED_P (TYPE_STUB_DECL (t
)) = 1;
5986 /* Possibly limit visibility based on template args. */
5987 TREE_PUBLIC (type_decl
) = 1;
5988 determine_visibility (type_decl
);
5990 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP
, t
);
5992 timevar_pop (TV_NAME_LOOKUP
);
5999 /* True when we should also visit template parameters that occur in
6000 non-deduced contexts. */
6001 bool include_nondeduced_p
;
6002 struct pointer_set_t
*visited
;
6005 /* Called from for_each_template_parm via walk_tree. */
6008 for_each_template_parm_r (tree
*tp
, int *walk_subtrees
, void *d
)
6011 struct pair_fn_data
*pfd
= (struct pair_fn_data
*) d
;
6012 tree_fn_t fn
= pfd
->fn
;
6013 void *data
= pfd
->data
;
6016 && (pfd
->include_nondeduced_p
|| TREE_CODE (t
) != TYPENAME_TYPE
)
6017 && for_each_template_parm (TYPE_CONTEXT (t
), fn
, data
, pfd
->visited
,
6018 pfd
->include_nondeduced_p
))
6019 return error_mark_node
;
6021 switch (TREE_CODE (t
))
6024 if (TYPE_PTRMEMFUNC_P (t
))
6030 if (!TYPE_TEMPLATE_INFO (t
))
6032 else if (for_each_template_parm (TREE_VALUE (TYPE_TEMPLATE_INFO (t
)),
6033 fn
, data
, pfd
->visited
,
6034 pfd
->include_nondeduced_p
))
6035 return error_mark_node
;
6039 if (for_each_template_parm (TYPE_MIN_VALUE (t
),
6040 fn
, data
, pfd
->visited
,
6041 pfd
->include_nondeduced_p
)
6042 || for_each_template_parm (TYPE_MAX_VALUE (t
),
6043 fn
, data
, pfd
->visited
,
6044 pfd
->include_nondeduced_p
))
6045 return error_mark_node
;
6049 /* Since we're not going to walk subtrees, we have to do this
6051 if (for_each_template_parm (TYPE_METHOD_BASETYPE (t
), fn
, data
,
6052 pfd
->visited
, pfd
->include_nondeduced_p
))
6053 return error_mark_node
;
6057 /* Check the return type. */
6058 if (for_each_template_parm (TREE_TYPE (t
), fn
, data
, pfd
->visited
,
6059 pfd
->include_nondeduced_p
))
6060 return error_mark_node
;
6062 /* Check the parameter types. Since default arguments are not
6063 instantiated until they are needed, the TYPE_ARG_TYPES may
6064 contain expressions that involve template parameters. But,
6065 no-one should be looking at them yet. And, once they're
6066 instantiated, they don't contain template parameters, so
6067 there's no point in looking at them then, either. */
6071 for (parm
= TYPE_ARG_TYPES (t
); parm
; parm
= TREE_CHAIN (parm
))
6072 if (for_each_template_parm (TREE_VALUE (parm
), fn
, data
,
6073 pfd
->visited
, pfd
->include_nondeduced_p
))
6074 return error_mark_node
;
6076 /* Since we've already handled the TYPE_ARG_TYPES, we don't
6077 want walk_tree walking into them itself. */
6083 if (pfd
->include_nondeduced_p
6084 && for_each_template_parm (TYPE_FIELDS (t
), fn
, data
,
6086 pfd
->include_nondeduced_p
))
6087 return error_mark_node
;
6092 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
)
6093 && for_each_template_parm (DECL_TI_ARGS (t
), fn
, data
,
6094 pfd
->visited
, pfd
->include_nondeduced_p
))
6095 return error_mark_node
;
6100 if (TREE_CODE (t
) == CONST_DECL
&& DECL_TEMPLATE_PARM_P (t
)
6101 && for_each_template_parm (DECL_INITIAL (t
), fn
, data
,
6102 pfd
->visited
, pfd
->include_nondeduced_p
))
6103 return error_mark_node
;
6104 if (DECL_CONTEXT (t
)
6105 && pfd
->include_nondeduced_p
6106 && for_each_template_parm (DECL_CONTEXT (t
), fn
, data
,
6107 pfd
->visited
, pfd
->include_nondeduced_p
))
6108 return error_mark_node
;
6111 case BOUND_TEMPLATE_TEMPLATE_PARM
:
6112 /* Record template parameters such as `T' inside `TT<T>'. */
6113 if (for_each_template_parm (TYPE_TI_ARGS (t
), fn
, data
, pfd
->visited
,
6114 pfd
->include_nondeduced_p
))
6115 return error_mark_node
;
6118 case TEMPLATE_TEMPLATE_PARM
:
6119 case TEMPLATE_TYPE_PARM
:
6120 case TEMPLATE_PARM_INDEX
:
6121 if (fn
&& (*fn
)(t
, data
))
6122 return error_mark_node
;
6124 return error_mark_node
;
6128 /* A template template parameter is encountered. */
6129 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
)
6130 && for_each_template_parm (TREE_TYPE (t
), fn
, data
, pfd
->visited
,
6131 pfd
->include_nondeduced_p
))
6132 return error_mark_node
;
6134 /* Already substituted template template parameter */
6140 || for_each_template_parm (TYPENAME_TYPE_FULLNAME (t
), fn
,
6142 pfd
->include_nondeduced_p
))
6143 return error_mark_node
;
6147 if (TREE_TYPE (t
) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t
))
6148 && pfd
->include_nondeduced_p
6149 && for_each_template_parm (TYPE_PTRMEMFUNC_FN_TYPE
6150 (TREE_TYPE (t
)), fn
, data
,
6151 pfd
->visited
, pfd
->include_nondeduced_p
))
6152 return error_mark_node
;
6157 /* If there's no type, then this thing must be some expression
6158 involving template parameters. */
6159 if (!fn
&& !TREE_TYPE (t
))
6160 return error_mark_node
;
6165 case REINTERPRET_CAST_EXPR
:
6166 case CONST_CAST_EXPR
:
6167 case STATIC_CAST_EXPR
:
6168 case DYNAMIC_CAST_EXPR
:
6172 case PSEUDO_DTOR_EXPR
:
6174 return error_mark_node
;
6181 /* We didn't find any template parameters we liked. */
6185 /* For each TEMPLATE_TYPE_PARM, TEMPLATE_TEMPLATE_PARM,
6186 BOUND_TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX in T,
6187 call FN with the parameter and the DATA.
6188 If FN returns nonzero, the iteration is terminated, and
6189 for_each_template_parm returns 1. Otherwise, the iteration
6190 continues. If FN never returns a nonzero value, the value
6191 returned by for_each_template_parm is 0. If FN is NULL, it is
6192 considered to be the function which always returns 1.
6194 If INCLUDE_NONDEDUCED_P, then this routine will also visit template
6195 parameters that occur in non-deduced contexts. When false, only
6196 visits those template parameters that can be deduced. */
6199 for_each_template_parm (tree t
, tree_fn_t fn
, void* data
,
6200 struct pointer_set_t
*visited
,
6201 bool include_nondeduced_p
)
6203 struct pair_fn_data pfd
;
6209 pfd
.include_nondeduced_p
= include_nondeduced_p
;
6211 /* Walk the tree. (Conceptually, we would like to walk without
6212 duplicates, but for_each_template_parm_r recursively calls
6213 for_each_template_parm, so we would need to reorganize a fair
6214 bit to use walk_tree_without_duplicates, so we keep our own
6217 pfd
.visited
= visited
;
6219 pfd
.visited
= pointer_set_create ();
6220 result
= cp_walk_tree (&t
,
6221 for_each_template_parm_r
,
6223 pfd
.visited
) != NULL_TREE
;
6228 pointer_set_destroy (pfd
.visited
);
6235 /* Returns true if T depends on any template parameter. */
6238 uses_template_parms (tree t
)
6241 int saved_processing_template_decl
;
6243 saved_processing_template_decl
= processing_template_decl
;
6244 if (!saved_processing_template_decl
)
6245 processing_template_decl
= 1;
6247 dependent_p
= dependent_type_p (t
);
6248 else if (TREE_CODE (t
) == TREE_VEC
)
6249 dependent_p
= any_dependent_template_arguments_p (t
);
6250 else if (TREE_CODE (t
) == TREE_LIST
)
6251 dependent_p
= (uses_template_parms (TREE_VALUE (t
))
6252 || uses_template_parms (TREE_CHAIN (t
)));
6253 else if (TREE_CODE (t
) == TYPE_DECL
)
6254 dependent_p
= dependent_type_p (TREE_TYPE (t
));
6257 || TREE_CODE (t
) == TEMPLATE_PARM_INDEX
6258 || TREE_CODE (t
) == OVERLOAD
6259 || TREE_CODE (t
) == BASELINK
6260 || TREE_CODE (t
) == IDENTIFIER_NODE
6261 || TREE_CODE (t
) == TRAIT_EXPR
6262 || CONSTANT_CLASS_P (t
))
6263 dependent_p
= (type_dependent_expression_p (t
)
6264 || value_dependent_expression_p (t
));
6267 gcc_assert (t
== error_mark_node
);
6268 dependent_p
= false;
6271 processing_template_decl
= saved_processing_template_decl
;
6276 /* Returns true if T depends on any template parameter with level LEVEL. */
6279 uses_template_parms_level (tree t
, int level
)
6281 return for_each_template_parm (t
, template_parm_this_level_p
, &level
, NULL
,
6282 /*include_nondeduced_p=*/true);
6285 static int tinst_depth
;
6286 extern int max_tinst_depth
;
6287 #ifdef GATHER_STATISTICS
6290 static int tinst_level_tick
;
6291 static int last_template_error_tick
;
6293 /* We're starting to instantiate D; record the template instantiation context
6294 for diagnostics and to restore it later. */
6297 push_tinst_level (tree d
)
6299 struct tinst_level
*new_level
;
6301 if (tinst_depth
>= max_tinst_depth
)
6303 /* If the instantiation in question still has unbound template parms,
6304 we don't really care if we can't instantiate it, so just return.
6305 This happens with base instantiation for implicit `typename'. */
6306 if (uses_template_parms (d
))
6309 last_template_error_tick
= tinst_level_tick
;
6310 error ("template instantiation depth exceeds maximum of %d (use "
6311 "-ftemplate-depth-NN to increase the maximum) instantiating %qD",
6312 max_tinst_depth
, d
);
6314 print_instantiation_context ();
6319 new_level
= GGC_NEW (struct tinst_level
);
6320 new_level
->decl
= d
;
6321 new_level
->locus
= input_location
;
6322 new_level
->in_system_header_p
= in_system_header
;
6323 new_level
->next
= current_tinst_level
;
6324 current_tinst_level
= new_level
;
6327 #ifdef GATHER_STATISTICS
6328 if (tinst_depth
> depth_reached
)
6329 depth_reached
= tinst_depth
;
6336 /* We're done instantiating this template; return to the instantiation
6340 pop_tinst_level (void)
6342 /* Restore the filename and line number stashed away when we started
6343 this instantiation. */
6344 input_location
= current_tinst_level
->locus
;
6345 current_tinst_level
= current_tinst_level
->next
;
6350 /* We're instantiating a deferred template; restore the template
6351 instantiation context in which the instantiation was requested, which
6352 is one step out from LEVEL. Return the corresponding DECL or TYPE. */
6355 reopen_tinst_level (struct tinst_level
*level
)
6357 struct tinst_level
*t
;
6360 for (t
= level
; t
; t
= t
->next
)
6363 current_tinst_level
= level
;
6368 /* Returns the TINST_LEVEL which gives the original instantiation
6371 struct tinst_level
*
6372 outermost_tinst_level (void)
6374 struct tinst_level
*level
= current_tinst_level
;
6377 level
= level
->next
;
6381 /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the
6382 vector of template arguments, as for tsubst.
6384 Returns an appropriate tsubst'd friend declaration. */
6387 tsubst_friend_function (tree decl
, tree args
)
6391 if (TREE_CODE (decl
) == FUNCTION_DECL
6392 && DECL_TEMPLATE_INSTANTIATION (decl
)
6393 && TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
6394 /* This was a friend declared with an explicit template
6395 argument list, e.g.:
6399 to indicate that f was a template instantiation, not a new
6400 function declaration. Now, we have to figure out what
6401 instantiation of what template. */
6403 tree template_id
, arglist
, fns
;
6406 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (current_class_type
));
6408 /* Friend functions are looked up in the containing namespace scope.
6409 We must enter that scope, to avoid finding member functions of the
6410 current class with same name. */
6411 push_nested_namespace (ns
);
6412 fns
= tsubst_expr (DECL_TI_TEMPLATE (decl
), args
,
6413 tf_warning_or_error
, NULL_TREE
,
6414 /*integral_constant_expression_p=*/false);
6415 pop_nested_namespace (ns
);
6416 arglist
= tsubst (DECL_TI_ARGS (decl
), args
,
6417 tf_warning_or_error
, NULL_TREE
);
6418 template_id
= lookup_template_function (fns
, arglist
);
6420 new_friend
= tsubst (decl
, args
, tf_warning_or_error
, NULL_TREE
);
6421 tmpl
= determine_specialization (template_id
, new_friend
,
6423 /*need_member_template=*/0,
6424 TREE_VEC_LENGTH (args
),
6426 return instantiate_template (tmpl
, new_args
, tf_error
);
6429 new_friend
= tsubst (decl
, args
, tf_warning_or_error
, NULL_TREE
);
6431 /* The NEW_FRIEND will look like an instantiation, to the
6432 compiler, but is not an instantiation from the point of view of
6433 the language. For example, we might have had:
6435 template <class T> struct S {
6436 template <class U> friend void f(T, U);
6439 Then, in S<int>, template <class U> void f(int, U) is not an
6440 instantiation of anything. */
6441 if (new_friend
== error_mark_node
)
6442 return error_mark_node
;
6444 DECL_USE_TEMPLATE (new_friend
) = 0;
6445 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
6447 DECL_USE_TEMPLATE (DECL_TEMPLATE_RESULT (new_friend
)) = 0;
6448 DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (new_friend
))
6449 = DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (decl
));
6452 /* The mangled name for the NEW_FRIEND is incorrect. The function
6453 is not a template instantiation and should not be mangled like
6454 one. Therefore, we forget the mangling here; we'll recompute it
6455 later if we need it. */
6456 if (TREE_CODE (new_friend
) != TEMPLATE_DECL
)
6458 SET_DECL_RTL (new_friend
, NULL_RTX
);
6459 SET_DECL_ASSEMBLER_NAME (new_friend
, NULL_TREE
);
6462 if (DECL_NAMESPACE_SCOPE_P (new_friend
))
6465 tree new_friend_template_info
;
6466 tree new_friend_result_template_info
;
6468 int new_friend_is_defn
;
6470 /* We must save some information from NEW_FRIEND before calling
6471 duplicate decls since that function will free NEW_FRIEND if
6473 new_friend_template_info
= DECL_TEMPLATE_INFO (new_friend
);
6474 new_friend_is_defn
=
6475 (DECL_INITIAL (DECL_TEMPLATE_RESULT
6476 (template_for_substitution (new_friend
)))
6478 if (TREE_CODE (new_friend
) == TEMPLATE_DECL
)
6480 /* This declaration is a `primary' template. */
6481 DECL_PRIMARY_TEMPLATE (new_friend
) = new_friend
;
6483 new_friend_result_template_info
6484 = DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (new_friend
));
6487 new_friend_result_template_info
= NULL_TREE
;
6489 /* Make the init_value nonzero so pushdecl knows this is a defn. */
6490 if (new_friend_is_defn
)
6491 DECL_INITIAL (new_friend
) = error_mark_node
;
6493 /* Inside pushdecl_namespace_level, we will push into the
6494 current namespace. However, the friend function should go
6495 into the namespace of the template. */
6496 ns
= decl_namespace_context (new_friend
);
6497 push_nested_namespace (ns
);
6498 old_decl
= pushdecl_namespace_level (new_friend
, /*is_friend=*/true);
6499 pop_nested_namespace (ns
);
6501 if (old_decl
== error_mark_node
)
6502 return error_mark_node
;
6504 if (old_decl
!= new_friend
)
6506 /* This new friend declaration matched an existing
6507 declaration. For example, given:
6509 template <class T> void f(T);
6510 template <class U> class C {
6511 template <class T> friend void f(T) {}
6514 the friend declaration actually provides the definition
6515 of `f', once C has been instantiated for some type. So,
6516 old_decl will be the out-of-class template declaration,
6517 while new_friend is the in-class definition.
6519 But, if `f' was called before this point, the
6520 instantiation of `f' will have DECL_TI_ARGS corresponding
6521 to `T' but not to `U', references to which might appear
6522 in the definition of `f'. Previously, the most general
6523 template for an instantiation of `f' was the out-of-class
6524 version; now it is the in-class version. Therefore, we
6525 run through all specialization of `f', adding to their
6526 DECL_TI_ARGS appropriately. In particular, they need a
6527 new set of outer arguments, corresponding to the
6528 arguments for this class instantiation.
6530 The same situation can arise with something like this:
6533 template <class T> class C {
6537 when `C<int>' is instantiated. Now, `f(int)' is defined
6540 if (!new_friend_is_defn
)
6541 /* On the other hand, if the in-class declaration does
6542 *not* provide a definition, then we don't want to alter
6543 existing definitions. We can just leave everything
6548 /* Overwrite whatever template info was there before, if
6549 any, with the new template information pertaining to
6551 DECL_TEMPLATE_INFO (old_decl
) = new_friend_template_info
;
6553 if (TREE_CODE (old_decl
) != TEMPLATE_DECL
)
6554 reregister_specialization (new_friend
,
6555 most_general_template (old_decl
),
6560 tree new_friend_args
;
6562 DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (old_decl
))
6563 = new_friend_result_template_info
;
6565 new_friend_args
= TI_ARGS (new_friend_template_info
);
6566 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (old_decl
);
6570 tree spec
= TREE_VALUE (t
);
6573 = add_outermost_template_args (new_friend_args
,
6574 DECL_TI_ARGS (spec
));
6577 /* Now, since specializations are always supposed to
6578 hang off of the most general template, we must move
6580 t
= most_general_template (old_decl
);
6583 DECL_TEMPLATE_SPECIALIZATIONS (t
)
6584 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (t
),
6585 DECL_TEMPLATE_SPECIALIZATIONS (old_decl
));
6586 DECL_TEMPLATE_SPECIALIZATIONS (old_decl
) = NULL_TREE
;
6591 /* The information from NEW_FRIEND has been merged into OLD_DECL
6592 by duplicate_decls. */
6593 new_friend
= old_decl
;
6598 tree context
= DECL_CONTEXT (new_friend
);
6602 template <class T> class C {
6603 template <class U> friend void C1<U>::f (); // case 1
6604 friend void C2<T>::f (); // case 2
6606 we only need to make sure CONTEXT is a complete type for
6607 case 2. To distinguish between the two cases, we note that
6608 CONTEXT of case 1 remains dependent type after tsubst while
6609 this isn't true for case 2. */
6610 ++processing_template_decl
;
6611 dependent_p
= dependent_type_p (context
);
6612 --processing_template_decl
;
6615 && !complete_type_or_else (context
, NULL_TREE
))
6616 return error_mark_node
;
6618 if (COMPLETE_TYPE_P (context
))
6620 /* Check to see that the declaration is really present, and,
6621 possibly obtain an improved declaration. */
6622 tree fn
= check_classfn (context
,
6623 new_friend
, NULL_TREE
);
6633 /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of
6634 template arguments, as for tsubst.
6636 Returns an appropriate tsubst'd friend type or error_mark_node on
6640 tsubst_friend_class (tree friend_tmpl
, tree args
)
6646 context
= DECL_CONTEXT (friend_tmpl
);
6650 if (TREE_CODE (context
) == NAMESPACE_DECL
)
6651 push_nested_namespace (context
);
6653 push_nested_class (tsubst (context
, args
, tf_none
, NULL_TREE
));
6656 /* Look for a class template declaration. We look for hidden names
6657 because two friend declarations of the same template are the
6658 same. For example, in:
6661 template <typename> friend class F;
6663 template <typename> struct B {
6664 template <typename> friend class F;
6667 both F templates are the same. */
6668 tmpl
= lookup_name_real (DECL_NAME (friend_tmpl
), 0, 0,
6669 /*block_p=*/true, 0,
6670 LOOKUP_COMPLAIN
| LOOKUP_HIDDEN
);
6672 /* But, if we don't find one, it might be because we're in a
6673 situation like this:
6681 Here, in the scope of (say) S<int>, `S' is bound to a TYPE_DECL
6682 for `S<int>', not the TEMPLATE_DECL. */
6683 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
6685 tmpl
= lookup_name_prefer_type (DECL_NAME (friend_tmpl
), 1);
6686 tmpl
= maybe_get_template_decl_from_type_decl (tmpl
);
6689 if (tmpl
&& DECL_CLASS_TEMPLATE_P (tmpl
))
6691 /* The friend template has already been declared. Just
6692 check to see that the declarations match, and install any new
6693 default parameters. We must tsubst the default parameters,
6694 of course. We only need the innermost template parameters
6695 because that is all that redeclare_class_template will look
6697 if (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (friend_tmpl
))
6698 > TMPL_ARGS_DEPTH (args
))
6701 location_t saved_input_location
;
6702 parms
= tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_tmpl
),
6703 args
, tf_warning_or_error
);
6705 saved_input_location
= input_location
;
6706 input_location
= DECL_SOURCE_LOCATION (friend_tmpl
);
6707 redeclare_class_template (TREE_TYPE (tmpl
), parms
);
6708 input_location
= saved_input_location
;
6712 friend_type
= TREE_TYPE (tmpl
);
6716 /* The friend template has not already been declared. In this
6717 case, the instantiation of the template class will cause the
6718 injection of this template into the global scope. */
6719 tmpl
= tsubst (friend_tmpl
, args
, tf_warning_or_error
, NULL_TREE
);
6720 if (tmpl
== error_mark_node
)
6721 return error_mark_node
;
6723 /* The new TMPL is not an instantiation of anything, so we
6724 forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE for
6725 the new type because that is supposed to be the corresponding
6726 template decl, i.e., TMPL. */
6727 DECL_USE_TEMPLATE (tmpl
) = 0;
6728 DECL_TEMPLATE_INFO (tmpl
) = NULL_TREE
;
6729 CLASSTYPE_USE_TEMPLATE (TREE_TYPE (tmpl
)) = 0;
6730 CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl
))
6731 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl
)));
6733 /* Inject this template into the global scope. */
6734 friend_type
= TREE_TYPE (pushdecl_top_level_maybe_friend (tmpl
, true));
6739 if (TREE_CODE (context
) == NAMESPACE_DECL
)
6740 pop_nested_namespace (context
);
6742 pop_nested_class ();
6748 /* Returns zero if TYPE cannot be completed later due to circularity.
6749 Otherwise returns one. */
6752 can_complete_type_without_circularity (tree type
)
6754 if (type
== NULL_TREE
|| type
== error_mark_node
)
6756 else if (COMPLETE_TYPE_P (type
))
6758 else if (TREE_CODE (type
) == ARRAY_TYPE
&& TYPE_DOMAIN (type
))
6759 return can_complete_type_without_circularity (TREE_TYPE (type
));
6760 else if (CLASS_TYPE_P (type
)
6761 && TYPE_BEING_DEFINED (TYPE_MAIN_VARIANT (type
)))
6767 /* Apply any attributes which had to be deferred until instantiation
6768 time. DECL_P, ATTRIBUTES and ATTR_FLAGS are as cplus_decl_attributes;
6769 ARGS, COMPLAIN, IN_DECL are as tsubst. */
6772 apply_late_template_attributes (tree
*decl_p
, tree attributes
, int attr_flags
,
6773 tree args
, tsubst_flags_t complain
, tree in_decl
)
6775 tree last_dep
= NULL_TREE
;
6779 for (t
= attributes
; t
; t
= TREE_CHAIN (t
))
6780 if (ATTR_IS_DEPENDENT (t
))
6783 attributes
= copy_list (attributes
);
6787 if (DECL_P (*decl_p
))
6789 if (TREE_TYPE (*decl_p
) == error_mark_node
)
6791 p
= &DECL_ATTRIBUTES (*decl_p
);
6794 p
= &TYPE_ATTRIBUTES (*decl_p
);
6798 tree late_attrs
= NULL_TREE
;
6799 tree
*q
= &late_attrs
;
6801 for (*p
= attributes
; *p
; )
6804 if (ATTR_IS_DEPENDENT (t
))
6806 *p
= TREE_CHAIN (t
);
6807 TREE_CHAIN (t
) = NULL_TREE
;
6808 /* If the first attribute argument is an identifier, don't
6809 pass it through tsubst. Attributes like mode, format,
6810 cleanup and several target specific attributes expect it
6813 && TREE_CODE (TREE_VALUE (t
)) == TREE_LIST
6814 && TREE_VALUE (TREE_VALUE (t
))
6815 && (TREE_CODE (TREE_VALUE (TREE_VALUE (t
)))
6816 == IDENTIFIER_NODE
))
6819 = tsubst_expr (TREE_CHAIN (TREE_VALUE (t
)), args
, complain
,
6821 /*integral_constant_expression_p=*/false);
6822 if (chain
!= TREE_CHAIN (TREE_VALUE (t
)))
6824 = tree_cons (NULL_TREE
, TREE_VALUE (TREE_VALUE (t
)),
6829 = tsubst_expr (TREE_VALUE (t
), args
, complain
, in_decl
,
6830 /*integral_constant_expression_p=*/false);
6832 q
= &TREE_CHAIN (t
);
6835 p
= &TREE_CHAIN (t
);
6838 cplus_decl_attributes (decl_p
, late_attrs
, attr_flags
);
6843 instantiate_class_template (tree type
)
6845 tree templ
, args
, pattern
, t
, member
;
6850 if (type
== error_mark_node
)
6851 return error_mark_node
;
6853 if (TYPE_BEING_DEFINED (type
)
6854 || COMPLETE_TYPE_P (type
)
6855 || dependent_type_p (type
))
6858 /* Figure out which template is being instantiated. */
6859 templ
= most_general_template (CLASSTYPE_TI_TEMPLATE (type
));
6860 gcc_assert (TREE_CODE (templ
) == TEMPLATE_DECL
);
6862 /* Determine what specialization of the original template to
6864 t
= most_specialized_class (type
, templ
);
6865 if (t
== error_mark_node
)
6867 TYPE_BEING_DEFINED (type
) = 1;
6868 return error_mark_node
;
6872 /* This TYPE is actually an instantiation of a partial
6873 specialization. We replace the innermost set of ARGS with
6874 the arguments appropriate for substitution. For example,
6877 template <class T> struct S {};
6878 template <class T> struct S<T*> {};
6880 and supposing that we are instantiating S<int*>, ARGS will
6881 presently be {int*} -- but we need {int}. */
6882 pattern
= TREE_TYPE (t
);
6883 args
= TREE_PURPOSE (t
);
6887 pattern
= TREE_TYPE (templ
);
6888 args
= CLASSTYPE_TI_ARGS (type
);
6891 /* If the template we're instantiating is incomplete, then clearly
6892 there's nothing we can do. */
6893 if (!COMPLETE_TYPE_P (pattern
))
6896 /* If we've recursively instantiated too many templates, stop. */
6897 if (! push_tinst_level (type
))
6900 /* Now we're really doing the instantiation. Mark the type as in
6901 the process of being defined. */
6902 TYPE_BEING_DEFINED (type
) = 1;
6904 /* We may be in the middle of deferred access check. Disable
6906 push_deferring_access_checks (dk_no_deferred
);
6908 push_to_top_level ();
6910 SET_CLASSTYPE_INTERFACE_UNKNOWN (type
);
6912 /* Set the input location to the template definition. This is needed
6913 if tsubsting causes an error. */
6914 typedecl
= TYPE_MAIN_DECL (type
);
6915 input_location
= DECL_SOURCE_LOCATION (typedecl
);
6917 TYPE_HAS_USER_CONSTRUCTOR (type
) = TYPE_HAS_USER_CONSTRUCTOR (pattern
);
6918 TYPE_HAS_NEW_OPERATOR (type
) = TYPE_HAS_NEW_OPERATOR (pattern
);
6919 TYPE_HAS_ARRAY_NEW_OPERATOR (type
) = TYPE_HAS_ARRAY_NEW_OPERATOR (pattern
);
6920 TYPE_GETS_DELETE (type
) = TYPE_GETS_DELETE (pattern
);
6921 TYPE_HAS_ASSIGN_REF (type
) = TYPE_HAS_ASSIGN_REF (pattern
);
6922 TYPE_HAS_CONST_ASSIGN_REF (type
) = TYPE_HAS_CONST_ASSIGN_REF (pattern
);
6923 TYPE_HAS_INIT_REF (type
) = TYPE_HAS_INIT_REF (pattern
);
6924 TYPE_HAS_CONST_INIT_REF (type
) = TYPE_HAS_CONST_INIT_REF (pattern
);
6925 TYPE_HAS_DEFAULT_CONSTRUCTOR (type
) = TYPE_HAS_DEFAULT_CONSTRUCTOR (pattern
);
6926 TYPE_HAS_CONVERSION (type
) = TYPE_HAS_CONVERSION (pattern
);
6927 TYPE_PACKED (type
) = TYPE_PACKED (pattern
);
6928 TYPE_ALIGN (type
) = TYPE_ALIGN (pattern
);
6929 TYPE_USER_ALIGN (type
) = TYPE_USER_ALIGN (pattern
);
6930 TYPE_FOR_JAVA (type
) = TYPE_FOR_JAVA (pattern
); /* For libjava's JArray<T> */
6931 if (ANON_AGGR_TYPE_P (pattern
))
6932 SET_ANON_AGGR_TYPE_P (type
);
6933 if (CLASSTYPE_VISIBILITY_SPECIFIED (pattern
))
6935 CLASSTYPE_VISIBILITY_SPECIFIED (type
) = 1;
6936 CLASSTYPE_VISIBILITY (type
) = CLASSTYPE_VISIBILITY (pattern
);
6939 pbinfo
= TYPE_BINFO (pattern
);
6941 /* We should never instantiate a nested class before its enclosing
6942 class; we need to look up the nested class by name before we can
6943 instantiate it, and that lookup should instantiate the enclosing
6945 gcc_assert (!DECL_CLASS_SCOPE_P (TYPE_MAIN_DECL (pattern
))
6946 || COMPLETE_TYPE_P (TYPE_CONTEXT (type
))
6947 || TYPE_BEING_DEFINED (TYPE_CONTEXT (type
)));
6949 base_list
= NULL_TREE
;
6950 if (BINFO_N_BASE_BINFOS (pbinfo
))
6953 tree context
= TYPE_CONTEXT (type
);
6957 /* We must enter the scope containing the type, as that is where
6958 the accessibility of types named in dependent bases are
6960 pushed_scope
= push_scope (context
? context
: global_namespace
);
6962 /* Substitute into each of the bases to determine the actual
6964 for (i
= 0; BINFO_BASE_ITERATE (pbinfo
, i
, pbase_binfo
); i
++)
6967 tree access
= BINFO_BASE_ACCESS (pbinfo
, i
);
6968 tree expanded_bases
= NULL_TREE
;
6971 if (PACK_EXPANSION_P (BINFO_TYPE (pbase_binfo
)))
6974 tsubst_pack_expansion (BINFO_TYPE (pbase_binfo
),
6975 args
, tf_error
, NULL_TREE
);
6976 if (expanded_bases
== error_mark_node
)
6979 len
= TREE_VEC_LENGTH (expanded_bases
);
6982 for (idx
= 0; idx
< len
; idx
++)
6985 /* Extract the already-expanded base class. */
6986 base
= TREE_VEC_ELT (expanded_bases
, idx
);
6988 /* Substitute to figure out the base class. */
6989 base
= tsubst (BINFO_TYPE (pbase_binfo
), args
, tf_error
,
6992 if (base
== error_mark_node
)
6995 base_list
= tree_cons (access
, base
, base_list
);
6996 if (BINFO_VIRTUAL_P (pbase_binfo
))
6997 TREE_TYPE (base_list
) = integer_type_node
;
7001 /* The list is now in reverse order; correct that. */
7002 base_list
= nreverse (base_list
);
7005 pop_scope (pushed_scope
);
7007 /* Now call xref_basetypes to set up all the base-class
7009 xref_basetypes (type
, base_list
);
7011 apply_late_template_attributes (&type
, TYPE_ATTRIBUTES (pattern
),
7012 (int) ATTR_FLAG_TYPE_IN_PLACE
,
7013 args
, tf_error
, NULL_TREE
);
7015 /* Now that our base classes are set up, enter the scope of the
7016 class, so that name lookups into base classes, etc. will work
7017 correctly. This is precisely analogous to what we do in
7018 begin_class_definition when defining an ordinary non-template
7019 class, except we also need to push the enclosing classes. */
7020 push_nested_class (type
);
7022 /* Now members are processed in the order of declaration. */
7023 for (member
= CLASSTYPE_DECL_LIST (pattern
);
7024 member
; member
= TREE_CHAIN (member
))
7026 tree t
= TREE_VALUE (member
);
7028 if (TREE_PURPOSE (member
))
7032 /* Build new CLASSTYPE_NESTED_UTDS. */
7035 bool class_template_p
;
7037 class_template_p
= (TREE_CODE (t
) != ENUMERAL_TYPE
7038 && TYPE_LANG_SPECIFIC (t
)
7039 && CLASSTYPE_IS_TEMPLATE (t
));
7040 /* If the member is a class template, then -- even after
7041 substitution -- there may be dependent types in the
7042 template argument list for the class. We increment
7043 PROCESSING_TEMPLATE_DECL so that dependent_type_p, as
7044 that function will assume that no types are dependent
7045 when outside of a template. */
7046 if (class_template_p
)
7047 ++processing_template_decl
;
7048 newtag
= tsubst (t
, args
, tf_error
, NULL_TREE
);
7049 if (class_template_p
)
7050 --processing_template_decl
;
7051 if (newtag
== error_mark_node
)
7054 if (TREE_CODE (newtag
) != ENUMERAL_TYPE
)
7056 tree name
= TYPE_IDENTIFIER (t
);
7058 if (class_template_p
)
7059 /* Unfortunately, lookup_template_class sets
7060 CLASSTYPE_IMPLICIT_INSTANTIATION for a partial
7061 instantiation (i.e., for the type of a member
7062 template class nested within a template class.)
7063 This behavior is required for
7064 maybe_process_partial_specialization to work
7065 correctly, but is not accurate in this case;
7066 the TAG is not an instantiation of anything.
7067 (The corresponding TEMPLATE_DECL is an
7068 instantiation, but the TYPE is not.) */
7069 CLASSTYPE_USE_TEMPLATE (newtag
) = 0;
7071 /* Now, we call pushtag to put this NEWTAG into the scope of
7072 TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid
7073 pushtag calling push_template_decl. We don't have to do
7074 this for enums because it will already have been done in
7077 SET_IDENTIFIER_TYPE_VALUE (name
, newtag
);
7078 pushtag (name
, newtag
, /*tag_scope=*/ts_current
);
7081 else if (TREE_CODE (t
) == FUNCTION_DECL
7082 || DECL_FUNCTION_TEMPLATE_P (t
))
7084 /* Build new TYPE_METHODS. */
7087 if (TREE_CODE (t
) == TEMPLATE_DECL
)
7088 ++processing_template_decl
;
7089 r
= tsubst (t
, args
, tf_error
, NULL_TREE
);
7090 if (TREE_CODE (t
) == TEMPLATE_DECL
)
7091 --processing_template_decl
;
7092 set_current_access_from_decl (r
);
7093 finish_member_declaration (r
);
7097 /* Build new TYPE_FIELDS. */
7098 if (TREE_CODE (t
) == STATIC_ASSERT
)
7101 tsubst_expr (STATIC_ASSERT_CONDITION (t
), args
,
7102 tf_warning_or_error
, NULL_TREE
,
7103 /*integral_constant_expression_p=*/true);
7104 finish_static_assert (condition
,
7105 STATIC_ASSERT_MESSAGE (t
),
7106 STATIC_ASSERT_SOURCE_LOCATION (t
),
7109 else if (TREE_CODE (t
) != CONST_DECL
)
7113 /* The file and line for this declaration, to
7114 assist in error message reporting. Since we
7115 called push_tinst_level above, we don't need to
7117 input_location
= DECL_SOURCE_LOCATION (t
);
7119 if (TREE_CODE (t
) == TEMPLATE_DECL
)
7120 ++processing_template_decl
;
7121 r
= tsubst (t
, args
, tf_warning_or_error
, NULL_TREE
);
7122 if (TREE_CODE (t
) == TEMPLATE_DECL
)
7123 --processing_template_decl
;
7124 if (TREE_CODE (r
) == VAR_DECL
)
7128 [t]he initialization (and any associated
7129 side-effects) of a static data member does
7130 not occur unless the static data member is
7131 itself used in a way that requires the
7132 definition of the static data member to
7135 Therefore, we do not substitute into the
7136 initialized for the static data member here. */
7137 finish_static_data_member_decl
7140 /*init_const_expr_p=*/false,
7141 /*asmspec_tree=*/NULL_TREE
,
7143 if (DECL_INITIALIZED_IN_CLASS_P (r
))
7144 check_static_variable_definition (r
, TREE_TYPE (r
));
7146 else if (TREE_CODE (r
) == FIELD_DECL
)
7148 /* Determine whether R has a valid type and can be
7149 completed later. If R is invalid, then it is
7150 replaced by error_mark_node so that it will not be
7151 added to TYPE_FIELDS. */
7152 tree rtype
= TREE_TYPE (r
);
7153 if (can_complete_type_without_circularity (rtype
))
7154 complete_type (rtype
);
7156 if (!COMPLETE_TYPE_P (rtype
))
7158 cxx_incomplete_type_error (r
, rtype
);
7159 r
= error_mark_node
;
7163 /* If it is a TYPE_DECL for a class-scoped ENUMERAL_TYPE,
7164 such a thing will already have been added to the field
7165 list by tsubst_enum in finish_member_declaration in the
7166 CLASSTYPE_NESTED_UTDS case above. */
7167 if (!(TREE_CODE (r
) == TYPE_DECL
7168 && TREE_CODE (TREE_TYPE (r
)) == ENUMERAL_TYPE
7169 && DECL_ARTIFICIAL (r
)))
7171 set_current_access_from_decl (r
);
7172 finish_member_declaration (r
);
7179 if (TYPE_P (t
) || DECL_CLASS_TEMPLATE_P (t
))
7181 /* Build new CLASSTYPE_FRIEND_CLASSES. */
7183 tree friend_type
= t
;
7184 bool adjust_processing_template_decl
= false;
7186 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
7188 /* template <class T> friend class C; */
7189 friend_type
= tsubst_friend_class (friend_type
, args
);
7190 adjust_processing_template_decl
= true;
7192 else if (TREE_CODE (friend_type
) == UNBOUND_CLASS_TEMPLATE
)
7194 /* template <class T> friend class C::D; */
7195 friend_type
= tsubst (friend_type
, args
,
7196 tf_warning_or_error
, NULL_TREE
);
7197 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
7198 friend_type
= TREE_TYPE (friend_type
);
7199 adjust_processing_template_decl
= true;
7201 else if (TREE_CODE (friend_type
) == TYPENAME_TYPE
)
7203 /* This could be either
7207 when dependent_type_p is false or
7209 template <class U> friend class T::C;
7212 friend_type
= tsubst (friend_type
, args
,
7213 tf_warning_or_error
, NULL_TREE
);
7214 /* Bump processing_template_decl for correct
7215 dependent_type_p calculation. */
7216 ++processing_template_decl
;
7217 if (dependent_type_p (friend_type
))
7218 adjust_processing_template_decl
= true;
7219 --processing_template_decl
;
7221 else if (!CLASSTYPE_USE_TEMPLATE (friend_type
)
7222 && hidden_name_p (TYPE_NAME (friend_type
)))
7226 where C hasn't been declared yet. Let's lookup name
7227 from namespace scope directly, bypassing any name that
7228 come from dependent base class. */
7229 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (friend_type
));
7231 /* The call to xref_tag_from_type does injection for friend
7233 push_nested_namespace (ns
);
7235 xref_tag_from_type (friend_type
, NULL_TREE
,
7236 /*tag_scope=*/ts_current
);
7237 pop_nested_namespace (ns
);
7239 else if (uses_template_parms (friend_type
))
7240 /* friend class C<T>; */
7241 friend_type
= tsubst (friend_type
, args
,
7242 tf_warning_or_error
, NULL_TREE
);
7247 where C is already declared or
7249 friend class C<int>;
7251 We don't have to do anything in these cases. */
7253 if (adjust_processing_template_decl
)
7254 /* Trick make_friend_class into realizing that the friend
7255 we're adding is a template, not an ordinary class. It's
7256 important that we use make_friend_class since it will
7257 perform some error-checking and output cross-reference
7259 ++processing_template_decl
;
7261 if (friend_type
!= error_mark_node
)
7262 make_friend_class (type
, friend_type
, /*complain=*/false);
7264 if (adjust_processing_template_decl
)
7265 --processing_template_decl
;
7269 /* Build new DECL_FRIENDLIST. */
7272 /* The file and line for this declaration, to
7273 assist in error message reporting. Since we
7274 called push_tinst_level above, we don't need to
7276 input_location
= DECL_SOURCE_LOCATION (t
);
7278 if (TREE_CODE (t
) == TEMPLATE_DECL
)
7280 ++processing_template_decl
;
7281 push_deferring_access_checks (dk_no_check
);
7284 r
= tsubst_friend_function (t
, args
);
7285 add_friend (type
, r
, /*complain=*/false);
7286 if (TREE_CODE (t
) == TEMPLATE_DECL
)
7288 pop_deferring_access_checks ();
7289 --processing_template_decl
;
7295 /* Set the file and line number information to whatever is given for
7296 the class itself. This puts error messages involving generated
7297 implicit functions at a predictable point, and the same point
7298 that would be used for non-template classes. */
7299 input_location
= DECL_SOURCE_LOCATION (typedecl
);
7301 unreverse_member_declarations (type
);
7302 finish_struct_1 (type
);
7303 TYPE_BEING_DEFINED (type
) = 0;
7305 /* Now that the class is complete, instantiate default arguments for
7306 any member functions. We don't do this earlier because the
7307 default arguments may reference members of the class. */
7308 if (!PRIMARY_TEMPLATE_P (templ
))
7309 for (t
= TYPE_METHODS (type
); t
; t
= TREE_CHAIN (t
))
7310 if (TREE_CODE (t
) == FUNCTION_DECL
7311 /* Implicitly generated member functions will not have template
7312 information; they are not instantiations, but instead are
7313 created "fresh" for each instantiation. */
7314 && DECL_TEMPLATE_INFO (t
))
7315 tsubst_default_arguments (t
);
7317 pop_nested_class ();
7318 pop_from_top_level ();
7319 pop_deferring_access_checks ();
7322 /* The vtable for a template class can be emitted in any translation
7323 unit in which the class is instantiated. When there is no key
7324 method, however, finish_struct_1 will already have added TYPE to
7325 the keyed_classes list. */
7326 if (TYPE_CONTAINS_VPTR_P (type
) && CLASSTYPE_KEY_METHOD (type
))
7327 keyed_classes
= tree_cons (NULL_TREE
, type
, keyed_classes
);
7333 tsubst_template_arg (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
7339 else if (TYPE_P (t
))
7340 r
= tsubst (t
, args
, complain
, in_decl
);
7343 r
= tsubst_expr (t
, args
, complain
, in_decl
,
7344 /*integral_constant_expression_p=*/true);
7345 r
= fold_non_dependent_expr (r
);
7350 /* Substitute ARGS into T, which is an pack expansion
7351 (i.e. TYPE_PACK_EXPANSION or EXPR_PACK_EXPANSION). Returns a
7352 TREE_VEC with the substituted arguments, a PACK_EXPANSION_* node
7353 (if only a partial substitution could be performed) or
7354 ERROR_MARK_NODE if there was an error. */
7356 tsubst_pack_expansion (tree t
, tree args
, tsubst_flags_t complain
,
7360 tree pack
, packs
= NULL_TREE
, unsubstituted_packs
= NULL_TREE
;
7361 tree first_arg_pack
; int i
, len
= -1;
7365 gcc_assert (PACK_EXPANSION_P (t
));
7366 pattern
= PACK_EXPANSION_PATTERN (t
);
7368 /* Determine the argument packs that will instantiate the parameter
7369 packs used in the expansion expression. While we're at it,
7370 compute the number of arguments to be expanded and make sure it
7372 for (pack
= PACK_EXPANSION_PARAMETER_PACKS (t
); pack
;
7373 pack
= TREE_CHAIN (pack
))
7375 tree parm_pack
= TREE_VALUE (pack
);
7376 tree arg_pack
= NULL_TREE
;
7377 tree orig_arg
= NULL_TREE
;
7379 if (TREE_CODE (parm_pack
) == PARM_DECL
)
7380 arg_pack
= retrieve_local_specialization (parm_pack
);
7383 int level
, idx
, levels
;
7384 template_parm_level_and_index (parm_pack
, &level
, &idx
);
7386 levels
= TMPL_ARGS_DEPTH (args
);
7387 if (level
<= levels
)
7388 arg_pack
= TMPL_ARG (args
, level
, idx
);
7391 orig_arg
= arg_pack
;
7392 if (arg_pack
&& TREE_CODE (arg_pack
) == ARGUMENT_PACK_SELECT
)
7393 arg_pack
= ARGUMENT_PACK_SELECT_FROM_PACK (arg_pack
);
7395 if (arg_pack
&& !ARGUMENT_PACK_P (arg_pack
))
7396 /* This can only happen if we forget to expand an argument
7397 pack somewhere else. Just return an error, silently. */
7399 result
= make_tree_vec (1);
7400 TREE_VEC_ELT (result
, 0) = error_mark_node
;
7405 && TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg_pack
)) == 1
7406 && PACK_EXPANSION_P (TREE_VEC_ELT (ARGUMENT_PACK_ARGS (arg_pack
), 0)))
7408 tree expansion
= TREE_VEC_ELT (ARGUMENT_PACK_ARGS (arg_pack
), 0);
7409 tree pattern
= PACK_EXPANSION_PATTERN (expansion
);
7410 if ((TYPE_P (pattern
) && same_type_p (pattern
, parm_pack
))
7411 || (!TYPE_P (pattern
) && cp_tree_equal (parm_pack
, pattern
)))
7412 /* The argument pack that the parameter maps to is just an
7413 expansion of the parameter itself, such as one would
7414 find in the implicit typedef of a class inside the
7415 class itself. Consider this parameter "unsubstituted",
7416 so that we will maintain the outer pack expansion. */
7417 arg_pack
= NULL_TREE
;
7423 TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg_pack
));
7425 /* It's all-or-nothing with incomplete argument packs. */
7426 if (incomplete
&& !ARGUMENT_PACK_INCOMPLETE_P (arg_pack
))
7427 return error_mark_node
;
7429 if (ARGUMENT_PACK_INCOMPLETE_P (arg_pack
))
7435 first_arg_pack
= arg_pack
;
7437 else if (len
!= my_len
)
7439 if (TREE_CODE (t
) == TYPE_PACK_EXPANSION
)
7440 error ("mismatched argument pack lengths while expanding "
7444 error ("mismatched argument pack lengths while expanding "
7447 return error_mark_node
;
7450 /* Keep track of the parameter packs and their corresponding
7452 packs
= tree_cons (parm_pack
, arg_pack
, packs
);
7453 TREE_TYPE (packs
) = orig_arg
;
7456 /* We can't substitute for this parameter pack. */
7457 unsubstituted_packs
= tree_cons (TREE_PURPOSE (pack
),
7459 unsubstituted_packs
);
7462 /* We cannot expand this expansion expression, because we don't have
7463 all of the argument packs we need. Substitute into the pattern
7464 and return a PACK_EXPANSION_*. The caller will need to deal with
7466 if (unsubstituted_packs
)
7467 return make_pack_expansion (tsubst (pattern
, args
, complain
,
7470 /* We could not find any argument packs that work. */
7472 return error_mark_node
;
7474 /* For each argument in each argument pack, substitute into the
7476 result
= make_tree_vec (len
+ incomplete
);
7477 for (i
= 0; i
< len
+ incomplete
; ++i
)
7479 /* For parameter pack, change the substitution of the parameter
7480 pack to the ith argument in its argument pack, then expand
7482 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
7484 tree parm
= TREE_PURPOSE (pack
);
7486 if (TREE_CODE (parm
) == PARM_DECL
)
7488 /* Select the Ith argument from the pack. */
7489 tree arg
= make_node (ARGUMENT_PACK_SELECT
);
7490 ARGUMENT_PACK_SELECT_FROM_PACK (arg
) = TREE_VALUE (pack
);
7491 ARGUMENT_PACK_SELECT_INDEX (arg
) = i
;
7493 register_local_specialization (arg
, parm
);
7499 template_parm_level_and_index (parm
, &level
, &idx
);
7503 /* Select the Ith argument from the pack. */
7504 value
= make_node (ARGUMENT_PACK_SELECT
);
7505 ARGUMENT_PACK_SELECT_FROM_PACK (value
) = TREE_VALUE (pack
);
7506 ARGUMENT_PACK_SELECT_INDEX (value
) = i
;
7509 /* Update the corresponding argument. */
7510 TMPL_ARG (args
, level
, idx
) = value
;
7514 /* Substitute into the PATTERN with the altered arguments. */
7515 if (TREE_CODE (t
) == EXPR_PACK_EXPANSION
)
7516 TREE_VEC_ELT (result
, i
) =
7517 tsubst_expr (pattern
, args
, complain
, in_decl
,
7518 /*integral_constant_expression_p=*/false);
7520 TREE_VEC_ELT (result
, i
) = tsubst (pattern
, args
, complain
, in_decl
);
7523 /* When we have incomplete argument packs, the last "expanded"
7524 result is itself a pack expansion, which allows us
7525 to deduce more arguments. */
7526 TREE_VEC_ELT (result
, i
) =
7527 make_pack_expansion (TREE_VEC_ELT (result
, i
));
7529 if (TREE_VEC_ELT (result
, i
) == error_mark_node
)
7531 result
= error_mark_node
;
7536 /* Update ARGS to restore the substitution from parameter packs to
7537 their argument packs. */
7538 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
7540 tree parm
= TREE_PURPOSE (pack
);
7542 if (TREE_CODE (parm
) == PARM_DECL
)
7543 register_local_specialization (TREE_TYPE (pack
), parm
);
7547 template_parm_level_and_index (parm
, &level
, &idx
);
7549 /* Update the corresponding argument. */
7550 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
7551 TREE_VEC_ELT (TREE_VEC_ELT (args
, level
-1 ), idx
) =
7554 TREE_VEC_ELT (args
, idx
) = TREE_TYPE (pack
);
7561 /* Substitute ARGS into the vector or list of template arguments T. */
7564 tsubst_template_args (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
7567 int len
= TREE_VEC_LENGTH (t
);
7568 int need_new
= 0, i
, expanded_len_adjust
= 0, out
;
7569 tree
*elts
= (tree
*) alloca (len
* sizeof (tree
));
7571 for (i
= 0; i
< len
; i
++)
7573 tree orig_arg
= TREE_VEC_ELT (t
, i
);
7576 if (TREE_CODE (orig_arg
) == TREE_VEC
)
7577 new_arg
= tsubst_template_args (orig_arg
, args
, complain
, in_decl
);
7578 else if (PACK_EXPANSION_P (orig_arg
))
7580 /* Substitute into an expansion expression. */
7581 new_arg
= tsubst_pack_expansion (orig_arg
, args
, complain
, in_decl
);
7583 if (TREE_CODE (new_arg
) == TREE_VEC
)
7584 /* Add to the expanded length adjustment the number of
7585 expanded arguments. We subtract one from this
7586 measurement, because the argument pack expression
7587 itself is already counted as 1 in
7588 LEN. EXPANDED_LEN_ADJUST can actually be negative, if
7589 the argument pack is empty. */
7590 expanded_len_adjust
+= TREE_VEC_LENGTH (new_arg
) - 1;
7592 else if (ARGUMENT_PACK_P (orig_arg
))
7594 /* Substitute into each of the arguments. */
7595 new_arg
= make_node (TREE_CODE (orig_arg
));
7597 SET_ARGUMENT_PACK_ARGS (
7599 tsubst_template_args (ARGUMENT_PACK_ARGS (orig_arg
),
7600 args
, complain
, in_decl
));
7602 if (ARGUMENT_PACK_ARGS (new_arg
) == error_mark_node
)
7603 new_arg
= error_mark_node
;
7605 if (TREE_CODE (new_arg
) == NONTYPE_ARGUMENT_PACK
) {
7606 TREE_TYPE (new_arg
) = tsubst (TREE_TYPE (orig_arg
), args
,
7608 TREE_CONSTANT (new_arg
) = TREE_CONSTANT (orig_arg
);
7610 if (TREE_TYPE (new_arg
) == error_mark_node
)
7611 new_arg
= error_mark_node
;
7615 new_arg
= tsubst_template_arg (orig_arg
, args
, complain
, in_decl
);
7617 if (new_arg
== error_mark_node
)
7618 return error_mark_node
;
7621 if (new_arg
!= orig_arg
)
7628 /* Make space for the expanded arguments coming from template
7630 t
= make_tree_vec (len
+ expanded_len_adjust
);
7631 for (i
= 0, out
= 0; i
< len
; i
++)
7633 if ((PACK_EXPANSION_P (TREE_VEC_ELT (orig_t
, i
))
7634 || ARGUMENT_PACK_P (TREE_VEC_ELT (orig_t
, i
)))
7635 && TREE_CODE (elts
[i
]) == TREE_VEC
)
7639 /* Now expand the template argument pack "in place". */
7640 for (idx
= 0; idx
< TREE_VEC_LENGTH (elts
[i
]); idx
++, out
++)
7641 TREE_VEC_ELT (t
, out
) = TREE_VEC_ELT (elts
[i
], idx
);
7645 TREE_VEC_ELT (t
, out
) = elts
[i
];
7653 /* Return the result of substituting ARGS into the template parameters
7654 given by PARMS. If there are m levels of ARGS and m + n levels of
7655 PARMS, then the result will contain n levels of PARMS. For
7656 example, if PARMS is `template <class T> template <class U>
7657 template <T*, U, class V>' and ARGS is {{int}, {double}} then the
7658 result will be `template <int*, double, class V>'. */
7661 tsubst_template_parms (tree parms
, tree args
, tsubst_flags_t complain
)
7666 /* When substituting into a template, we must set
7667 PROCESSING_TEMPLATE_DECL as the template parameters may be
7668 dependent if they are based on one-another, and the dependency
7669 predicates are short-circuit outside of templates. */
7670 ++processing_template_decl
;
7672 for (new_parms
= &r
;
7673 TMPL_PARMS_DEPTH (parms
) > TMPL_ARGS_DEPTH (args
);
7674 new_parms
= &(TREE_CHAIN (*new_parms
)),
7675 parms
= TREE_CHAIN (parms
))
7678 make_tree_vec (TREE_VEC_LENGTH (TREE_VALUE (parms
)));
7681 for (i
= 0; i
< TREE_VEC_LENGTH (new_vec
); ++i
)
7687 if (parms
== error_mark_node
)
7690 tuple
= TREE_VEC_ELT (TREE_VALUE (parms
), i
);
7692 if (tuple
== error_mark_node
)
7695 default_value
= TREE_PURPOSE (tuple
);
7696 parm_decl
= TREE_VALUE (tuple
);
7698 parm_decl
= tsubst (parm_decl
, args
, complain
, NULL_TREE
);
7699 if (TREE_CODE (parm_decl
) == PARM_DECL
7700 && invalid_nontype_parm_type_p (TREE_TYPE (parm_decl
), complain
))
7701 parm_decl
= error_mark_node
;
7702 default_value
= tsubst_template_arg (default_value
, args
,
7703 complain
, NULL_TREE
);
7705 tuple
= build_tree_list (default_value
, parm_decl
);
7706 TREE_VEC_ELT (new_vec
, i
) = tuple
;
7710 tree_cons (size_int (TMPL_PARMS_DEPTH (parms
)
7711 - TMPL_ARGS_DEPTH (args
)),
7712 new_vec
, NULL_TREE
);
7715 --processing_template_decl
;
7720 /* Substitute the ARGS into the indicated aggregate (or enumeration)
7721 type T. If T is not an aggregate or enumeration type, it is
7722 handled as if by tsubst. IN_DECL is as for tsubst. If
7723 ENTERING_SCOPE is nonzero, T is the context for a template which
7724 we are presently tsubst'ing. Return the substituted value. */
7727 tsubst_aggr_type (tree t
,
7729 tsubst_flags_t complain
,
7736 switch (TREE_CODE (t
))
7739 if (TYPE_PTRMEMFUNC_P (t
))
7740 return tsubst (TYPE_PTRMEMFUNC_FN_TYPE (t
), args
, complain
, in_decl
);
7742 /* Else fall through. */
7745 if (TYPE_TEMPLATE_INFO (t
) && uses_template_parms (t
))
7750 bool saved_skip_evaluation
;
7752 /* In "sizeof(X<I>)" we need to evaluate "I". */
7753 saved_skip_evaluation
= skip_evaluation
;
7754 skip_evaluation
= false;
7756 /* First, determine the context for the type we are looking
7758 context
= TYPE_CONTEXT (t
);
7761 context
= tsubst_aggr_type (context
, args
, complain
,
7762 in_decl
, /*entering_scope=*/1);
7763 /* If context is a nested class inside a class template,
7764 it may still need to be instantiated (c++/33959). */
7765 if (TYPE_P (context
))
7766 context
= complete_type (context
);
7769 /* Then, figure out what arguments are appropriate for the
7770 type we are trying to find. For example, given:
7772 template <class T> struct S;
7773 template <class T, class U> void f(T, U) { S<U> su; }
7775 and supposing that we are instantiating f<int, double>,
7776 then our ARGS will be {int, double}, but, when looking up
7777 S we only want {double}. */
7778 argvec
= tsubst_template_args (TYPE_TI_ARGS (t
), args
,
7780 if (argvec
== error_mark_node
)
7781 r
= error_mark_node
;
7784 r
= lookup_template_class (t
, argvec
, in_decl
, context
,
7785 entering_scope
, complain
);
7786 r
= cp_build_qualified_type_real (r
, TYPE_QUALS (t
), complain
);
7789 skip_evaluation
= saved_skip_evaluation
;
7794 /* This is not a template type, so there's nothing to do. */
7798 return tsubst (t
, args
, complain
, in_decl
);
7802 /* Substitute into the default argument ARG (a default argument for
7803 FN), which has the indicated TYPE. */
7806 tsubst_default_argument (tree fn
, tree type
, tree arg
)
7808 tree saved_class_ptr
= NULL_TREE
;
7809 tree saved_class_ref
= NULL_TREE
;
7811 /* This default argument came from a template. Instantiate the
7812 default argument here, not in tsubst. In the case of
7821 we must be careful to do name lookup in the scope of S<T>,
7822 rather than in the current class. */
7823 push_access_scope (fn
);
7824 /* The "this" pointer is not valid in a default argument. */
7827 saved_class_ptr
= current_class_ptr
;
7828 cp_function_chain
->x_current_class_ptr
= NULL_TREE
;
7829 saved_class_ref
= current_class_ref
;
7830 cp_function_chain
->x_current_class_ref
= NULL_TREE
;
7833 push_deferring_access_checks(dk_no_deferred
);
7834 /* The default argument expression may cause implicitly defined
7835 member functions to be synthesized, which will result in garbage
7836 collection. We must treat this situation as if we were within
7837 the body of function so as to avoid collecting live data on the
7840 arg
= tsubst_expr (arg
, DECL_TI_ARGS (fn
),
7841 tf_warning_or_error
, NULL_TREE
,
7842 /*integral_constant_expression_p=*/false);
7844 pop_deferring_access_checks();
7846 /* Restore the "this" pointer. */
7849 cp_function_chain
->x_current_class_ptr
= saved_class_ptr
;
7850 cp_function_chain
->x_current_class_ref
= saved_class_ref
;
7853 pop_access_scope (fn
);
7855 /* Make sure the default argument is reasonable. */
7856 arg
= check_default_argument (type
, arg
);
7861 /* Substitute into all the default arguments for FN. */
7864 tsubst_default_arguments (tree fn
)
7869 tmpl_args
= DECL_TI_ARGS (fn
);
7871 /* If this function is not yet instantiated, we certainly don't need
7872 its default arguments. */
7873 if (uses_template_parms (tmpl_args
))
7876 for (arg
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
7878 arg
= TREE_CHAIN (arg
))
7879 if (TREE_PURPOSE (arg
))
7880 TREE_PURPOSE (arg
) = tsubst_default_argument (fn
,
7882 TREE_PURPOSE (arg
));
7885 /* Substitute the ARGS into the T, which is a _DECL. Return the
7886 result of the substitution. Issue error and warning messages under
7887 control of COMPLAIN. */
7890 tsubst_decl (tree t
, tree args
, tsubst_flags_t complain
)
7892 location_t saved_loc
;
7896 /* Set the filename and linenumber to improve error-reporting. */
7897 saved_loc
= input_location
;
7898 input_location
= DECL_SOURCE_LOCATION (t
);
7900 switch (TREE_CODE (t
))
7904 /* We can get here when processing a member function template,
7905 member class template, and template template parameter of
7906 a template class. */
7907 tree decl
= DECL_TEMPLATE_RESULT (t
);
7912 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
7914 /* Template template parameter is treated here. */
7915 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
7916 if (new_type
== error_mark_node
)
7917 return error_mark_node
;
7920 TREE_CHAIN (r
) = NULL_TREE
;
7921 TREE_TYPE (r
) = new_type
;
7922 DECL_TEMPLATE_RESULT (r
)
7923 = build_decl (TYPE_DECL
, DECL_NAME (decl
), new_type
);
7924 DECL_TEMPLATE_PARMS (r
)
7925 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
,
7927 TYPE_NAME (new_type
) = r
;
7931 /* We might already have an instance of this template.
7932 The ARGS are for the surrounding class type, so the
7933 full args contain the tsubst'd args for the context,
7934 plus the innermost args from the template decl. */
7935 tmpl_args
= DECL_CLASS_TEMPLATE_P (t
)
7936 ? CLASSTYPE_TI_ARGS (TREE_TYPE (t
))
7937 : DECL_TI_ARGS (DECL_TEMPLATE_RESULT (t
));
7938 /* Because this is a template, the arguments will still be
7939 dependent, even after substitution. If
7940 PROCESSING_TEMPLATE_DECL is not set, the dependency
7941 predicates will short-circuit. */
7942 ++processing_template_decl
;
7943 full_args
= tsubst_template_args (tmpl_args
, args
,
7945 --processing_template_decl
;
7946 if (full_args
== error_mark_node
)
7947 return error_mark_node
;
7949 /* tsubst_template_args doesn't copy the vector if
7950 nothing changed. But, *something* should have
7952 gcc_assert (full_args
!= tmpl_args
);
7954 spec
= retrieve_specialization (t
, full_args
,
7955 /*class_specializations_p=*/true);
7956 if (spec
!= NULL_TREE
)
7962 /* Make a new template decl. It will be similar to the
7963 original, but will record the current template arguments.
7964 We also create a new function declaration, which is just
7965 like the old one, but points to this new template, rather
7966 than the old one. */
7968 gcc_assert (DECL_LANG_SPECIFIC (r
) != 0);
7969 TREE_CHAIN (r
) = NULL_TREE
;
7971 DECL_TEMPLATE_INFO (r
) = build_tree_list (t
, args
);
7973 if (TREE_CODE (decl
) == TYPE_DECL
)
7976 ++processing_template_decl
;
7977 new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
7978 --processing_template_decl
;
7979 if (new_type
== error_mark_node
)
7980 return error_mark_node
;
7982 TREE_TYPE (r
) = new_type
;
7983 CLASSTYPE_TI_TEMPLATE (new_type
) = r
;
7984 DECL_TEMPLATE_RESULT (r
) = TYPE_MAIN_DECL (new_type
);
7985 DECL_TI_ARGS (r
) = CLASSTYPE_TI_ARGS (new_type
);
7986 DECL_CONTEXT (r
) = TYPE_CONTEXT (new_type
);
7991 ++processing_template_decl
;
7992 new_decl
= tsubst (decl
, args
, complain
, in_decl
);
7993 --processing_template_decl
;
7994 if (new_decl
== error_mark_node
)
7995 return error_mark_node
;
7997 DECL_TEMPLATE_RESULT (r
) = new_decl
;
7998 DECL_TI_TEMPLATE (new_decl
) = r
;
7999 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
8000 DECL_TI_ARGS (r
) = DECL_TI_ARGS (new_decl
);
8001 DECL_CONTEXT (r
) = DECL_CONTEXT (new_decl
);
8004 SET_DECL_IMPLICIT_INSTANTIATION (r
);
8005 DECL_TEMPLATE_INSTANTIATIONS (r
) = NULL_TREE
;
8006 DECL_TEMPLATE_SPECIALIZATIONS (r
) = NULL_TREE
;
8008 /* The template parameters for this new template are all the
8009 template parameters for the old template, except the
8010 outermost level of parameters. */
8011 DECL_TEMPLATE_PARMS (r
)
8012 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
,
8015 if (PRIMARY_TEMPLATE_P (t
))
8016 DECL_PRIMARY_TEMPLATE (r
) = r
;
8018 if (TREE_CODE (decl
) != TYPE_DECL
)
8019 /* Record this non-type partial instantiation. */
8020 register_specialization (r
, t
,
8021 DECL_TI_ARGS (DECL_TEMPLATE_RESULT (r
)),
8029 tree argvec
= NULL_TREE
;
8037 /* Nobody should be tsubst'ing into non-template functions. */
8038 gcc_assert (DECL_TEMPLATE_INFO (t
) != NULL_TREE
);
8040 if (TREE_CODE (DECL_TI_TEMPLATE (t
)) == TEMPLATE_DECL
)
8045 /* If T is not dependent, just return it. We have to
8046 increment PROCESSING_TEMPLATE_DECL because
8047 value_dependent_expression_p assumes that nothing is
8048 dependent when PROCESSING_TEMPLATE_DECL is zero. */
8049 ++processing_template_decl
;
8050 dependent_p
= value_dependent_expression_p (t
);
8051 --processing_template_decl
;
8055 /* Calculate the most general template of which R is a
8056 specialization, and the complete set of arguments used to
8058 gen_tmpl
= most_general_template (DECL_TI_TEMPLATE (t
));
8059 argvec
= tsubst_template_args (DECL_TI_ARGS
8060 (DECL_TEMPLATE_RESULT (gen_tmpl
)),
8061 args
, complain
, in_decl
);
8063 /* Check to see if we already have this specialization. */
8064 spec
= retrieve_specialization (gen_tmpl
, argvec
,
8065 /*class_specializations_p=*/false);
8073 /* We can see more levels of arguments than parameters if
8074 there was a specialization of a member template, like
8077 template <class T> struct S { template <class U> void f(); }
8078 template <> template <class U> void S<int>::f(U);
8080 Here, we'll be substituting into the specialization,
8081 because that's where we can find the code we actually
8082 want to generate, but we'll have enough arguments for
8083 the most general template.
8085 We also deal with the peculiar case:
8087 template <class T> struct S {
8088 template <class U> friend void f();
8090 template <class U> void f() {}
8092 template void f<double>();
8094 Here, the ARGS for the instantiation of will be {int,
8095 double}. But, we only need as many ARGS as there are
8096 levels of template parameters in CODE_PATTERN. We are
8097 careful not to get fooled into reducing the ARGS in
8100 template <class T> struct S { template <class U> void f(U); }
8101 template <class T> template <> void S<T>::f(int) {}
8103 which we can spot because the pattern will be a
8104 specialization in this case. */
8105 args_depth
= TMPL_ARGS_DEPTH (args
);
8107 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (t
)));
8108 if (args_depth
> parms_depth
8109 && !DECL_TEMPLATE_SPECIALIZATION (t
))
8110 args
= get_innermost_template_args (args
, parms_depth
);
8114 /* This special case arises when we have something like this:
8116 template <class T> struct S {
8117 friend void f<int>(int, double);
8120 Here, the DECL_TI_TEMPLATE for the friend declaration
8121 will be an IDENTIFIER_NODE. We are being called from
8122 tsubst_friend_function, and we want only to create a
8123 new decl (R) with appropriate types so that we can call
8124 determine_specialization. */
8125 gen_tmpl
= NULL_TREE
;
8128 if (DECL_CLASS_SCOPE_P (t
))
8130 if (DECL_NAME (t
) == constructor_name (DECL_CONTEXT (t
)))
8134 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
,
8135 complain
, t
, /*entering_scope=*/1);
8140 ctx
= DECL_CONTEXT (t
);
8142 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
8143 if (type
== error_mark_node
)
8144 return error_mark_node
;
8146 /* We do NOT check for matching decls pushed separately at this
8147 point, as they may not represent instantiations of this
8148 template, and in any case are considered separate under the
8151 DECL_USE_TEMPLATE (r
) = 0;
8152 TREE_TYPE (r
) = type
;
8153 /* Clear out the mangled name and RTL for the instantiation. */
8154 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
8155 SET_DECL_RTL (r
, NULL_RTX
);
8156 /* Leave DECL_INITIAL set on deleted instantiations. */
8157 if (!DECL_DELETED_FN (r
))
8158 DECL_INITIAL (r
) = NULL_TREE
;
8159 DECL_CONTEXT (r
) = ctx
;
8161 if (member
&& DECL_CONV_FN_P (r
))
8162 /* Type-conversion operator. Reconstruct the name, in
8163 case it's the name of one of the template's parameters. */
8164 DECL_NAME (r
) = mangle_conv_op_name_for_type (TREE_TYPE (type
));
8166 DECL_ARGUMENTS (r
) = tsubst (DECL_ARGUMENTS (t
), args
,
8168 DECL_RESULT (r
) = NULL_TREE
;
8170 TREE_STATIC (r
) = 0;
8171 TREE_PUBLIC (r
) = TREE_PUBLIC (t
);
8172 DECL_EXTERNAL (r
) = 1;
8173 /* If this is an instantiation of a function with internal
8174 linkage, we already know what object file linkage will be
8175 assigned to the instantiation. */
8176 DECL_INTERFACE_KNOWN (r
) = !TREE_PUBLIC (r
);
8177 DECL_DEFER_OUTPUT (r
) = 0;
8178 TREE_CHAIN (r
) = NULL_TREE
;
8179 DECL_PENDING_INLINE_INFO (r
) = 0;
8180 DECL_PENDING_INLINE_P (r
) = 0;
8181 DECL_SAVED_TREE (r
) = NULL_TREE
;
8183 if (DECL_CLONED_FUNCTION (r
))
8185 DECL_CLONED_FUNCTION (r
) = tsubst (DECL_CLONED_FUNCTION (t
),
8187 TREE_CHAIN (r
) = TREE_CHAIN (DECL_CLONED_FUNCTION (r
));
8188 TREE_CHAIN (DECL_CLONED_FUNCTION (r
)) = r
;
8191 /* Set up the DECL_TEMPLATE_INFO for R. There's no need to do
8192 this in the special friend case mentioned above where
8193 GEN_TMPL is NULL. */
8196 DECL_TEMPLATE_INFO (r
)
8197 = tree_cons (gen_tmpl
, argvec
, NULL_TREE
);
8198 SET_DECL_IMPLICIT_INSTANTIATION (r
);
8199 register_specialization (r
, gen_tmpl
, argvec
, false);
8201 /* We're not supposed to instantiate default arguments
8202 until they are called, for a template. But, for a
8205 template <class T> void f ()
8206 { extern void g(int i = T()); }
8208 we should do the substitution when the template is
8209 instantiated. We handle the member function case in
8210 instantiate_class_template since the default arguments
8211 might refer to other members of the class. */
8213 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
8214 && !uses_template_parms (argvec
))
8215 tsubst_default_arguments (r
);
8218 DECL_TEMPLATE_INFO (r
) = NULL_TREE
;
8220 /* Copy the list of befriending classes. */
8221 for (friends
= &DECL_BEFRIENDING_CLASSES (r
);
8223 friends
= &TREE_CHAIN (*friends
))
8225 *friends
= copy_node (*friends
);
8226 TREE_VALUE (*friends
) = tsubst (TREE_VALUE (*friends
),
8231 if (DECL_CONSTRUCTOR_P (r
) || DECL_DESTRUCTOR_P (r
))
8233 maybe_retrofit_in_chrg (r
);
8234 if (DECL_CONSTRUCTOR_P (r
))
8235 grok_ctor_properties (ctx
, r
);
8236 /* If this is an instantiation of a member template, clone it.
8237 If it isn't, that'll be handled by
8238 clone_constructors_and_destructors. */
8239 if (PRIMARY_TEMPLATE_P (gen_tmpl
))
8240 clone_function_decl (r
, /*update_method_vec_p=*/0);
8242 else if (IDENTIFIER_OPNAME_P (DECL_NAME (r
))
8243 && !grok_op_properties (r
, (complain
& tf_error
) != 0))
8244 return error_mark_node
;
8246 if (DECL_FRIEND_P (t
) && DECL_FRIEND_CONTEXT (t
))
8247 SET_DECL_FRIEND_CONTEXT (r
,
8248 tsubst (DECL_FRIEND_CONTEXT (t
),
8249 args
, complain
, in_decl
));
8251 /* Possibly limit visibility based on template args. */
8252 DECL_VISIBILITY (r
) = VISIBILITY_DEFAULT
;
8253 if (DECL_VISIBILITY_SPECIFIED (t
))
8255 DECL_VISIBILITY_SPECIFIED (r
) = 0;
8257 = remove_attribute ("visibility", DECL_ATTRIBUTES (r
));
8259 determine_visibility (r
);
8261 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
8262 args
, complain
, in_decl
);
8268 tree type
= NULL_TREE
;
8270 tree expanded_types
= NULL_TREE
;
8271 tree prev_r
= NULL_TREE
;
8272 tree first_r
= NULL_TREE
;
8274 if (FUNCTION_PARAMETER_PACK_P (t
))
8276 /* If there is a local specialization that isn't a
8277 parameter pack, it means that we're doing a "simple"
8278 substitution from inside tsubst_pack_expansion. Just
8279 return the local specialization (which will be a single
8281 tree spec
= retrieve_local_specialization (t
);
8283 && TREE_CODE (spec
) == PARM_DECL
8284 && TREE_CODE (TREE_TYPE (spec
)) != TYPE_PACK_EXPANSION
)
8287 /* Expand the TYPE_PACK_EXPANSION that provides the types for
8288 the parameters in this function parameter pack. */
8289 expanded_types
= tsubst_pack_expansion (TREE_TYPE (t
), args
,
8291 if (TREE_CODE (expanded_types
) == TREE_VEC
)
8293 len
= TREE_VEC_LENGTH (expanded_types
);
8295 /* Zero-length parameter packs are boring. Just substitute
8298 return tsubst (TREE_CHAIN (t
), args
, complain
,
8303 /* All we did was update the type. Make a note of that. */
8304 type
= expanded_types
;
8305 expanded_types
= NULL_TREE
;
8309 /* Loop through all of the parameter's we'll build. When T is
8310 a function parameter pack, LEN is the number of expanded
8311 types in EXPANDED_TYPES; otherwise, LEN is 1. */
8313 for (i
= 0; i
< len
; ++i
)
8317 if (DECL_TEMPLATE_PARM_P (t
))
8318 SET_DECL_TEMPLATE_PARM_P (r
);
8321 /* We're on the Ith parameter of the function parameter
8324 /* Get the Ith type. */
8325 type
= TREE_VEC_ELT (expanded_types
, i
);
8328 /* Rename the parameter to include the index. */
8330 make_ith_pack_parameter_name (DECL_NAME (r
), i
);
8333 /* We're dealing with a normal parameter. */
8334 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
8336 type
= type_decays_to (type
);
8337 TREE_TYPE (r
) = type
;
8338 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
8340 if (DECL_INITIAL (r
))
8342 if (TREE_CODE (DECL_INITIAL (r
)) != TEMPLATE_PARM_INDEX
)
8343 DECL_INITIAL (r
) = TREE_TYPE (r
);
8345 DECL_INITIAL (r
) = tsubst (DECL_INITIAL (r
), args
,
8349 DECL_CONTEXT (r
) = NULL_TREE
;
8351 if (!DECL_TEMPLATE_PARM_P (r
))
8352 DECL_ARG_TYPE (r
) = type_passed_as (type
);
8354 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
8355 args
, complain
, in_decl
);
8357 /* Keep track of the first new parameter we
8358 generate. That's what will be returned to the
8363 /* Build a proper chain of parameters when substituting
8364 into a function parameter pack. */
8366 TREE_CHAIN (prev_r
) = r
;
8370 TREE_CHAIN (r
) = tsubst (TREE_CHAIN (t
), args
,
8371 complain
, TREE_CHAIN (t
));
8373 /* FIRST_R contains the start of the chain we've built. */
8383 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
8384 if (type
== error_mark_node
)
8385 return error_mark_node
;
8386 TREE_TYPE (r
) = type
;
8387 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
8389 /* DECL_INITIAL gives the number of bits in a bit-field. */
8391 = tsubst_expr (DECL_INITIAL (t
), args
,
8393 /*integral_constant_expression_p=*/true);
8394 /* We don't have to set DECL_CONTEXT here; it is set by
8395 finish_member_declaration. */
8396 TREE_CHAIN (r
) = NULL_TREE
;
8397 if (VOID_TYPE_P (type
))
8398 error ("instantiation of %q+D as type %qT", r
, type
);
8400 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
8401 args
, complain
, in_decl
);
8406 /* We reach here only for member using decls. */
8407 if (DECL_DEPENDENT_P (t
))
8409 r
= do_class_using_decl
8410 (tsubst_copy (USING_DECL_SCOPE (t
), args
, complain
, in_decl
),
8411 tsubst_copy (DECL_NAME (t
), args
, complain
, in_decl
));
8413 r
= error_mark_node
;
8418 TREE_CHAIN (r
) = NULL_TREE
;
8425 tree argvec
= NULL_TREE
;
8426 tree gen_tmpl
= NULL_TREE
;
8428 tree tmpl
= NULL_TREE
;
8430 tree type
= NULL_TREE
;
8433 if (TREE_CODE (t
) == TYPE_DECL
8434 && t
== TYPE_MAIN_DECL (TREE_TYPE (t
)))
8436 /* If this is the canonical decl, we don't have to
8437 mess with instantiations, and often we can't (for
8438 typename, template type parms and such). Note that
8439 TYPE_NAME is not correct for the above test if
8440 we've copied the type for a typedef. */
8441 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
8442 if (type
== error_mark_node
)
8443 return error_mark_node
;
8444 r
= TYPE_NAME (type
);
8448 /* Check to see if we already have the specialization we
8451 if (DECL_CLASS_SCOPE_P (t
) || DECL_NAMESPACE_SCOPE_P (t
))
8453 /* T is a static data member or namespace-scope entity.
8454 We have to substitute into namespace-scope variables
8455 (even though such entities are never templates) because
8458 template <class T> void f() { extern T t; }
8460 where the entity referenced is not known until
8461 instantiation time. */
8463 ctx
= DECL_CONTEXT (t
);
8464 if (DECL_CLASS_SCOPE_P (t
))
8466 ctx
= tsubst_aggr_type (ctx
, args
,
8468 in_decl
, /*entering_scope=*/1);
8469 /* If CTX is unchanged, then T is in fact the
8470 specialization we want. That situation occurs when
8471 referencing a static data member within in its own
8472 class. We can use pointer equality, rather than
8473 same_type_p, because DECL_CONTEXT is always
8475 if (ctx
== DECL_CONTEXT (t
))
8481 tmpl
= DECL_TI_TEMPLATE (t
);
8482 gen_tmpl
= most_general_template (tmpl
);
8483 argvec
= tsubst (DECL_TI_ARGS (t
), args
, complain
, in_decl
);
8484 spec
= (retrieve_specialization
8486 /*class_specializations_p=*/false));
8491 /* A local variable. */
8493 /* Subsequent calls to pushdecl will fill this in. */
8495 spec
= retrieve_local_specialization (t
);
8497 /* If we already have the specialization we need, there is
8498 nothing more to do. */
8505 /* Create a new node for the specialization we need. */
8507 if (type
== NULL_TREE
)
8508 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
8509 if (TREE_CODE (r
) == VAR_DECL
)
8511 /* Even if the original location is out of scope, the
8512 newly substituted one is not. */
8513 DECL_DEAD_FOR_LOCAL (r
) = 0;
8514 DECL_INITIALIZED_P (r
) = 0;
8515 DECL_TEMPLATE_INSTANTIATED (r
) = 0;
8516 if (type
== error_mark_node
)
8517 return error_mark_node
;
8518 if (TREE_CODE (type
) == FUNCTION_TYPE
)
8520 /* It may seem that this case cannot occur, since:
8525 declares a function, not a variable. However:
8528 template <typename T> void g() { T t; }
8529 template void g<f>();
8531 is an attempt to declare a variable with function
8533 error ("variable %qD has function type",
8534 /* R is not yet sufficiently initialized, so we
8535 just use its name. */
8537 return error_mark_node
;
8539 type
= complete_type (type
);
8540 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r
)
8541 = DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (t
);
8542 type
= check_var_type (DECL_NAME (r
), type
);
8544 if (DECL_HAS_VALUE_EXPR_P (t
))
8546 tree ve
= DECL_VALUE_EXPR (t
);
8547 ve
= tsubst_expr (ve
, args
, complain
, in_decl
,
8548 /*constant_expression_p=*/false);
8549 SET_DECL_VALUE_EXPR (r
, ve
);
8552 else if (DECL_SELF_REFERENCE_P (t
))
8553 SET_DECL_SELF_REFERENCE_P (r
);
8554 TREE_TYPE (r
) = type
;
8555 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
8556 DECL_CONTEXT (r
) = ctx
;
8557 /* Clear out the mangled name and RTL for the instantiation. */
8558 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
8559 if (CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_DECL_WRTL
))
8560 SET_DECL_RTL (r
, NULL_RTX
);
8561 /* The initializer must not be expanded until it is required;
8563 DECL_INITIAL (r
) = NULL_TREE
;
8564 if (CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_DECL_WRTL
))
8565 SET_DECL_RTL (r
, NULL_RTX
);
8566 DECL_SIZE (r
) = DECL_SIZE_UNIT (r
) = 0;
8567 if (TREE_CODE (r
) == VAR_DECL
)
8569 /* Possibly limit visibility based on template args. */
8570 DECL_VISIBILITY (r
) = VISIBILITY_DEFAULT
;
8571 if (DECL_VISIBILITY_SPECIFIED (t
))
8573 DECL_VISIBILITY_SPECIFIED (r
) = 0;
8575 = remove_attribute ("visibility", DECL_ATTRIBUTES (r
));
8577 determine_visibility (r
);
8579 /* Preserve a typedef that names a type. */
8580 else if (TREE_CODE (r
) == TYPE_DECL
8581 && DECL_ORIGINAL_TYPE (t
)
8582 && type
!= error_mark_node
)
8584 DECL_ORIGINAL_TYPE (r
) = tsubst (DECL_ORIGINAL_TYPE (t
),
8585 args
, complain
, in_decl
);
8586 TREE_TYPE (r
) = type
= build_variant_type_copy (type
);
8587 TYPE_NAME (type
) = r
;
8592 /* A static data member declaration is always marked
8593 external when it is declared in-class, even if an
8594 initializer is present. We mimic the non-template
8596 DECL_EXTERNAL (r
) = 1;
8598 register_specialization (r
, gen_tmpl
, argvec
, false);
8599 DECL_TEMPLATE_INFO (r
) = tree_cons (tmpl
, argvec
, NULL_TREE
);
8600 SET_DECL_IMPLICIT_INSTANTIATION (r
);
8603 register_local_specialization (r
, t
);
8605 TREE_CHAIN (r
) = NULL_TREE
;
8607 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
),
8608 (int) ATTR_FLAG_TYPE_IN_PLACE
,
8609 args
, complain
, in_decl
);
8618 /* Restore the file and line information. */
8619 input_location
= saved_loc
;
8624 /* Substitute into the ARG_TYPES of a function type. */
8627 tsubst_arg_types (tree arg_types
,
8629 tsubst_flags_t complain
,
8632 tree remaining_arg_types
;
8633 tree type
= NULL_TREE
;
8635 tree expanded_args
= NULL_TREE
;
8638 if (!arg_types
|| arg_types
== void_list_node
)
8641 remaining_arg_types
= tsubst_arg_types (TREE_CHAIN (arg_types
),
8642 args
, complain
, in_decl
);
8643 if (remaining_arg_types
== error_mark_node
)
8644 return error_mark_node
;
8646 if (PACK_EXPANSION_P (TREE_VALUE (arg_types
)))
8648 /* For a pack expansion, perform substitution on the
8649 entire expression. Later on, we'll handle the arguments
8651 expanded_args
= tsubst_pack_expansion (TREE_VALUE (arg_types
),
8652 args
, complain
, in_decl
);
8654 if (TREE_CODE (expanded_args
) == TREE_VEC
)
8655 /* So that we'll spin through the parameters, one by one. */
8656 i
= TREE_VEC_LENGTH (expanded_args
);
8659 /* We only partially substituted into the parameter
8660 pack. Our type is TYPE_PACK_EXPANSION. */
8661 type
= expanded_args
;
8662 expanded_args
= NULL_TREE
;
8670 type
= TREE_VEC_ELT (expanded_args
, i
);
8672 type
= tsubst (TREE_VALUE (arg_types
), args
, complain
, in_decl
);
8674 if (type
== error_mark_node
)
8675 return error_mark_node
;
8676 if (VOID_TYPE_P (type
))
8678 if (complain
& tf_error
)
8680 error ("invalid parameter type %qT", type
);
8682 error ("in declaration %q+D", in_decl
);
8684 return error_mark_node
;
8687 /* Do array-to-pointer, function-to-pointer conversion, and ignore
8688 top-level qualifiers as required. */
8689 type
= TYPE_MAIN_VARIANT (type_decays_to (type
));
8691 /* We do not substitute into default arguments here. The standard
8692 mandates that they be instantiated only when needed, which is
8693 done in build_over_call. */
8694 default_arg
= TREE_PURPOSE (arg_types
);
8696 if (default_arg
&& TREE_CODE (default_arg
) == DEFAULT_ARG
)
8698 /* We've instantiated a template before its default arguments
8699 have been parsed. This can happen for a nested template
8700 class, and is not an error unless we require the default
8701 argument in a call of this function. */
8702 remaining_arg_types
=
8703 tree_cons (default_arg
, type
, remaining_arg_types
);
8704 VEC_safe_push (tree
, gc
, DEFARG_INSTANTIATIONS (default_arg
),
8705 remaining_arg_types
);
8708 remaining_arg_types
=
8709 hash_tree_cons (default_arg
, type
, remaining_arg_types
);
8712 return remaining_arg_types
;
8715 /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does
8716 *not* handle the exception-specification for FNTYPE, because the
8717 initial substitution of explicitly provided template parameters
8718 during argument deduction forbids substitution into the
8719 exception-specification:
8723 All references in the function type of the function template to the
8724 corresponding template parameters are replaced by the specified tem-
8725 plate argument values. If a substitution in a template parameter or
8726 in the function type of the function template results in an invalid
8727 type, type deduction fails. [Note: The equivalent substitution in
8728 exception specifications is done only when the function is instanti-
8729 ated, at which point a program is ill-formed if the substitution
8730 results in an invalid type.] */
8733 tsubst_function_type (tree t
,
8735 tsubst_flags_t complain
,
8742 /* The TYPE_CONTEXT is not used for function/method types. */
8743 gcc_assert (TYPE_CONTEXT (t
) == NULL_TREE
);
8745 /* Substitute the return type. */
8746 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
8747 if (return_type
== error_mark_node
)
8748 return error_mark_node
;
8749 /* The standard does not presently indicate that creation of a
8750 function type with an invalid return type is a deduction failure.
8751 However, that is clearly analogous to creating an array of "void"
8752 or a reference to a reference. This is core issue #486. */
8753 if (TREE_CODE (return_type
) == ARRAY_TYPE
8754 || TREE_CODE (return_type
) == FUNCTION_TYPE
)
8756 if (complain
& tf_error
)
8758 if (TREE_CODE (return_type
) == ARRAY_TYPE
)
8759 error ("function returning an array");
8761 error ("function returning a function");
8763 return error_mark_node
;
8766 /* Substitute the argument types. */
8767 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
,
8769 if (arg_types
== error_mark_node
)
8770 return error_mark_node
;
8772 /* Construct a new type node and return it. */
8773 if (TREE_CODE (t
) == FUNCTION_TYPE
)
8774 fntype
= build_function_type (return_type
, arg_types
);
8777 tree r
= TREE_TYPE (TREE_VALUE (arg_types
));
8778 if (! MAYBE_CLASS_TYPE_P (r
))
8782 Type deduction may fail for any of the following
8785 -- Attempting to create "pointer to member of T" when T
8786 is not a class type. */
8787 if (complain
& tf_error
)
8788 error ("creating pointer to member function of non-class type %qT",
8790 return error_mark_node
;
8793 fntype
= build_method_type_directly (r
, return_type
,
8794 TREE_CHAIN (arg_types
));
8796 fntype
= cp_build_qualified_type_real (fntype
, TYPE_QUALS (t
), complain
);
8797 fntype
= cp_build_type_attribute_variant (fntype
, TYPE_ATTRIBUTES (t
));
8802 /* FNTYPE is a FUNCTION_TYPE or METHOD_TYPE. Substitute the template
8803 ARGS into that specification, and return the substituted
8804 specification. If there is no specification, return NULL_TREE. */
8807 tsubst_exception_specification (tree fntype
,
8809 tsubst_flags_t complain
,
8815 specs
= TYPE_RAISES_EXCEPTIONS (fntype
);
8816 new_specs
= NULL_TREE
;
8819 if (! TREE_VALUE (specs
))
8826 tree expanded_specs
= NULL_TREE
;
8828 if (PACK_EXPANSION_P (TREE_VALUE (specs
)))
8830 /* Expand the pack expansion type. */
8831 expanded_specs
= tsubst_pack_expansion (TREE_VALUE (specs
),
8835 if (expanded_specs
== error_mark_node
)
8836 return error_mark_node
;
8837 else if (TREE_CODE (expanded_specs
) == TREE_VEC
)
8838 len
= TREE_VEC_LENGTH (expanded_specs
);
8841 /* We're substituting into a member template, so
8842 we got a TYPE_PACK_EXPANSION back. Add that
8843 expansion and move on. */
8844 gcc_assert (TREE_CODE (expanded_specs
)
8845 == TYPE_PACK_EXPANSION
);
8846 new_specs
= add_exception_specifier (new_specs
,
8849 specs
= TREE_CHAIN (specs
);
8854 for (i
= 0; i
< len
; ++i
)
8857 spec
= TREE_VEC_ELT (expanded_specs
, i
);
8859 spec
= tsubst (TREE_VALUE (specs
), args
, complain
, in_decl
);
8860 if (spec
== error_mark_node
)
8862 new_specs
= add_exception_specifier (new_specs
, spec
,
8866 specs
= TREE_CHAIN (specs
);
8872 /* Take the tree structure T and replace template parameters used
8873 therein with the argument vector ARGS. IN_DECL is an associated
8874 decl for diagnostics. If an error occurs, returns ERROR_MARK_NODE.
8875 Issue error and warning messages under control of COMPLAIN. Note
8876 that we must be relatively non-tolerant of extensions here, in
8877 order to preserve conformance; if we allow substitutions that
8878 should not be allowed, we may allow argument deductions that should
8879 not succeed, and therefore report ambiguous overload situations
8880 where there are none. In theory, we could allow the substitution,
8881 but indicate that it should have failed, and allow our caller to
8882 make sure that the right thing happens, but we don't try to do this
8885 This function is used for dealing with types, decls and the like;
8886 for expressions, use tsubst_expr or tsubst_copy. */
8889 tsubst (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
8893 if (t
== NULL_TREE
|| t
== error_mark_node
8894 || t
== integer_type_node
8895 || t
== void_type_node
8896 || t
== char_type_node
8897 || t
== unknown_type_node
8898 || TREE_CODE (t
) == NAMESPACE_DECL
)
8902 return tsubst_decl (t
, args
, complain
);
8904 if (TREE_CODE (t
) == IDENTIFIER_NODE
)
8905 type
= IDENTIFIER_TYPE_VALUE (t
);
8907 type
= TREE_TYPE (t
);
8909 gcc_assert (type
!= unknown_type_node
);
8911 /* Reuse typedefs. We need to do this to handle dependent attributes,
8912 such as attribute aligned. */
8915 && TYPE_NAME (t
) != TYPE_MAIN_DECL (t
))
8917 tree decl
= TYPE_NAME (t
);
8919 if (DECL_CLASS_SCOPE_P (decl
)
8920 && CLASSTYPE_TEMPLATE_INFO (DECL_CONTEXT (decl
))
8921 && uses_template_parms (DECL_CONTEXT (decl
)))
8923 tree tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
8924 tree gen_args
= tsubst (DECL_TI_ARGS (decl
), args
, complain
, in_decl
);
8925 r
= retrieve_specialization (tmpl
, gen_args
, false);
8927 else if (DECL_FUNCTION_SCOPE_P (decl
)
8928 && DECL_TEMPLATE_INFO (DECL_CONTEXT (decl
))
8929 && uses_template_parms (DECL_TI_ARGS (DECL_CONTEXT (decl
))))
8930 r
= retrieve_local_specialization (decl
);
8932 /* The typedef is from a non-template context. */
8938 r
= cp_build_qualified_type_real
8939 (r
, cp_type_quals (t
) | cp_type_quals (r
),
8940 complain
| tf_ignore_bad_quals
);
8943 /* Else we must be instantiating the typedef, so fall through. */
8947 && TREE_CODE (t
) != TYPENAME_TYPE
8948 && TREE_CODE (t
) != IDENTIFIER_NODE
8949 && TREE_CODE (t
) != FUNCTION_TYPE
8950 && TREE_CODE (t
) != METHOD_TYPE
)
8951 type
= tsubst (type
, args
, complain
, in_decl
);
8952 if (type
== error_mark_node
)
8953 return error_mark_node
;
8955 switch (TREE_CODE (t
))
8960 return tsubst_aggr_type (t
, args
, complain
, in_decl
,
8961 /*entering_scope=*/0);
8964 case IDENTIFIER_NODE
:
8976 if (t
== integer_type_node
)
8979 if (TREE_CODE (TYPE_MIN_VALUE (t
)) == INTEGER_CST
8980 && TREE_CODE (TYPE_MAX_VALUE (t
)) == INTEGER_CST
)
8984 tree max
, omax
= TREE_OPERAND (TYPE_MAX_VALUE (t
), 0);
8986 max
= tsubst_expr (omax
, args
, complain
, in_decl
,
8987 /*integral_constant_expression_p=*/false);
8988 max
= fold_decl_constant_value (max
);
8990 if (TREE_CODE (max
) != INTEGER_CST
8991 && !at_function_scope_p ()
8992 && !value_dependent_expression_p (max
))
8994 if (complain
& tf_error
)
8995 error ("array bound is not an integer constant");
8996 return error_mark_node
;
9001 Type deduction may fail for any of the following
9004 Attempting to create an array with a size that is
9005 zero or negative. */
9006 if (integer_zerop (max
) && !(complain
& tf_error
))
9007 /* We must fail if performing argument deduction (as
9008 indicated by the state of complain), so that
9009 another substitution can be found. */
9010 return error_mark_node
;
9011 else if (TREE_CODE (max
) == INTEGER_CST
9012 && INT_CST_LT (max
, integer_zero_node
))
9014 if (complain
& tf_error
)
9015 error ("creating array with negative size (%qE)", max
);
9017 return error_mark_node
;
9020 return compute_array_index_type (NULL_TREE
, max
);
9023 case TEMPLATE_TYPE_PARM
:
9024 case TEMPLATE_TEMPLATE_PARM
:
9025 case BOUND_TEMPLATE_TEMPLATE_PARM
:
9026 case TEMPLATE_PARM_INDEX
:
9031 tree arg
= NULL_TREE
;
9035 gcc_assert (TREE_VEC_LENGTH (args
) > 0);
9036 template_parm_level_and_index (t
, &level
, &idx
);
9038 levels
= TMPL_ARGS_DEPTH (args
);
9039 if (level
<= levels
)
9041 arg
= TMPL_ARG (args
, level
, idx
);
9043 if (arg
&& TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
9044 /* See through ARGUMENT_PACK_SELECT arguments. */
9045 arg
= ARGUMENT_PACK_SELECT_ARG (arg
);
9048 if (arg
== error_mark_node
)
9049 return error_mark_node
;
9050 else if (arg
!= NULL_TREE
)
9052 if (ARGUMENT_PACK_P (arg
))
9053 /* If ARG is an argument pack, we don't actually want to
9054 perform a substitution here, because substitutions
9055 for argument packs are only done
9056 element-by-element. We can get to this point when
9057 substituting the type of a non-type template
9058 parameter pack, when that type actually contains
9059 template parameter packs from an outer template, e.g.,
9061 template<typename... Types> struct A {
9062 template<Types... Values> struct B { };
9066 if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
9069 gcc_assert (TYPE_P (arg
));
9071 /* cv-quals from the template are discarded when
9072 substituting in a function or reference type. */
9073 if (TREE_CODE (arg
) == FUNCTION_TYPE
9074 || TREE_CODE (arg
) == METHOD_TYPE
9075 || TREE_CODE (arg
) == REFERENCE_TYPE
)
9076 quals
= cp_type_quals (arg
);
9078 quals
= cp_type_quals (arg
) | cp_type_quals (t
);
9080 return cp_build_qualified_type_real
9081 (arg
, quals
, complain
| tf_ignore_bad_quals
);
9083 else if (TREE_CODE (t
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
9085 /* We are processing a type constructed from a
9086 template template parameter. */
9087 tree argvec
= tsubst (TYPE_TI_ARGS (t
),
9088 args
, complain
, in_decl
);
9089 if (argvec
== error_mark_node
)
9090 return error_mark_node
;
9092 /* We can get a TEMPLATE_TEMPLATE_PARM here when we
9093 are resolving nested-types in the signature of a
9094 member function templates. Otherwise ARG is a
9095 TEMPLATE_DECL and is the real template to be
9097 if (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
9098 arg
= TYPE_NAME (arg
);
9100 r
= lookup_template_class (arg
,
9103 /*entering_scope=*/0,
9105 return cp_build_qualified_type_real
9106 (r
, TYPE_QUALS (t
), complain
);
9109 /* TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX. */
9114 /* This can happen during the attempted tsubst'ing in
9115 unify. This means that we don't yet have any information
9116 about the template parameter in question. */
9119 /* If we get here, we must have been looking at a parm for a
9120 more deeply nested template. Make a new version of this
9121 template parameter, but with a lower level. */
9122 switch (TREE_CODE (t
))
9124 case TEMPLATE_TYPE_PARM
:
9125 case TEMPLATE_TEMPLATE_PARM
:
9126 case BOUND_TEMPLATE_TEMPLATE_PARM
:
9127 if (cp_type_quals (t
))
9129 r
= tsubst (TYPE_MAIN_VARIANT (t
), args
, complain
, in_decl
);
9130 r
= cp_build_qualified_type_real
9131 (r
, cp_type_quals (t
),
9132 complain
| (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
9133 ? tf_ignore_bad_quals
: 0));
9138 TEMPLATE_TYPE_PARM_INDEX (r
)
9139 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (t
),
9140 r
, levels
, args
, complain
);
9141 TYPE_STUB_DECL (r
) = TYPE_NAME (r
) = TEMPLATE_TYPE_DECL (r
);
9142 TYPE_MAIN_VARIANT (r
) = r
;
9143 TYPE_POINTER_TO (r
) = NULL_TREE
;
9144 TYPE_REFERENCE_TO (r
) = NULL_TREE
;
9146 if (TREE_CODE (r
) == TEMPLATE_TEMPLATE_PARM
)
9147 /* We have reduced the level of the template
9148 template parameter, but not the levels of its
9149 template parameters, so canonical_type_parameter
9150 will not be able to find the canonical template
9151 template parameter for this level. Thus, we
9152 require structural equality checking to compare
9153 TEMPLATE_TEMPLATE_PARMs. */
9154 SET_TYPE_STRUCTURAL_EQUALITY (r
);
9155 else if (TYPE_STRUCTURAL_EQUALITY_P (t
))
9156 SET_TYPE_STRUCTURAL_EQUALITY (r
);
9158 TYPE_CANONICAL (r
) = canonical_type_parameter (r
);
9160 if (TREE_CODE (t
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
9162 tree argvec
= tsubst (TYPE_TI_ARGS (t
), args
,
9164 if (argvec
== error_mark_node
)
9165 return error_mark_node
;
9167 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (r
)
9168 = tree_cons (TYPE_TI_TEMPLATE (t
), argvec
, NULL_TREE
);
9173 case TEMPLATE_PARM_INDEX
:
9174 r
= reduce_template_parm_level (t
, type
, levels
, args
, complain
);
9186 tree purpose
, value
, chain
;
9188 if (t
== void_list_node
)
9191 purpose
= TREE_PURPOSE (t
);
9194 purpose
= tsubst (purpose
, args
, complain
, in_decl
);
9195 if (purpose
== error_mark_node
)
9196 return error_mark_node
;
9198 value
= TREE_VALUE (t
);
9201 value
= tsubst (value
, args
, complain
, in_decl
);
9202 if (value
== error_mark_node
)
9203 return error_mark_node
;
9205 chain
= TREE_CHAIN (t
);
9206 if (chain
&& chain
!= void_type_node
)
9208 chain
= tsubst (chain
, args
, complain
, in_decl
);
9209 if (chain
== error_mark_node
)
9210 return error_mark_node
;
9212 if (purpose
== TREE_PURPOSE (t
)
9213 && value
== TREE_VALUE (t
)
9214 && chain
== TREE_CHAIN (t
))
9216 return hash_tree_cons (purpose
, value
, chain
);
9220 /* We should never be tsubsting a binfo. */
9224 /* A vector of template arguments. */
9226 return tsubst_template_args (t
, args
, complain
, in_decl
);
9229 case REFERENCE_TYPE
:
9231 enum tree_code code
;
9233 if (type
== TREE_TYPE (t
) && TREE_CODE (type
) != METHOD_TYPE
)
9236 code
= TREE_CODE (t
);
9241 Type deduction may fail for any of the following
9244 -- Attempting to create a pointer to reference type.
9245 -- Attempting to create a reference to a reference type or
9246 a reference to void.
9248 Core issue 106 says that creating a reference to a reference
9249 during instantiation is no longer a cause for failure. We
9250 only enforce this check in strict C++98 mode. */
9251 if ((TREE_CODE (type
) == REFERENCE_TYPE
9252 && (((cxx_dialect
== cxx98
) && flag_iso
) || code
!= REFERENCE_TYPE
))
9253 || (code
== REFERENCE_TYPE
&& TREE_CODE (type
) == VOID_TYPE
))
9255 static location_t last_loc
;
9257 /* We keep track of the last time we issued this error
9258 message to avoid spewing a ton of messages during a
9259 single bad template instantiation. */
9260 if (complain
& tf_error
9261 && last_loc
!= input_location
)
9263 if (TREE_CODE (type
) == VOID_TYPE
)
9264 error ("forming reference to void");
9266 error ("forming %s to reference type %qT",
9267 (code
== POINTER_TYPE
) ? "pointer" : "reference",
9269 last_loc
= input_location
;
9272 return error_mark_node
;
9274 else if (code
== POINTER_TYPE
)
9276 r
= build_pointer_type (type
);
9277 if (TREE_CODE (type
) == METHOD_TYPE
)
9278 r
= build_ptrmemfunc_type (r
);
9280 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
9281 /* In C++0x, during template argument substitution, when there is an
9282 attempt to create a reference to a reference type, reference
9283 collapsing is applied as described in [14.3.1/4 temp.arg.type]:
9285 "If a template-argument for a template-parameter T names a type
9286 that is a reference to a type A, an attempt to create the type
9287 'lvalue reference to cv T' creates the type 'lvalue reference to
9288 A,' while an attempt to create the type type rvalue reference to
9289 cv T' creates the type T"
9291 r
= cp_build_reference_type
9293 TYPE_REF_IS_RVALUE (t
) && TYPE_REF_IS_RVALUE (type
));
9295 r
= cp_build_reference_type (type
, TYPE_REF_IS_RVALUE (t
));
9296 r
= cp_build_qualified_type_real (r
, TYPE_QUALS (t
), complain
);
9298 if (r
!= error_mark_node
)
9299 /* Will this ever be needed for TYPE_..._TO values? */
9306 r
= tsubst (TYPE_OFFSET_BASETYPE (t
), args
, complain
, in_decl
);
9307 if (r
== error_mark_node
|| !MAYBE_CLASS_TYPE_P (r
))
9311 Type deduction may fail for any of the following
9314 -- Attempting to create "pointer to member of T" when T
9315 is not a class type. */
9316 if (complain
& tf_error
)
9317 error ("creating pointer to member of non-class type %qT", r
);
9318 return error_mark_node
;
9320 if (TREE_CODE (type
) == REFERENCE_TYPE
)
9322 if (complain
& tf_error
)
9323 error ("creating pointer to member reference type %qT", type
);
9324 return error_mark_node
;
9326 if (TREE_CODE (type
) == VOID_TYPE
)
9328 if (complain
& tf_error
)
9329 error ("creating pointer to member of type void");
9330 return error_mark_node
;
9332 gcc_assert (TREE_CODE (type
) != METHOD_TYPE
);
9333 if (TREE_CODE (type
) == FUNCTION_TYPE
)
9335 /* The type of the implicit object parameter gets its
9336 cv-qualifiers from the FUNCTION_TYPE. */
9338 tree this_type
= cp_build_qualified_type (TYPE_MAIN_VARIANT (r
),
9339 cp_type_quals (type
));
9341 method_type
= build_method_type_directly (this_type
,
9343 TYPE_ARG_TYPES (type
));
9344 memptr
= build_ptrmemfunc_type (build_pointer_type (method_type
));
9345 return cp_build_qualified_type_real (memptr
, cp_type_quals (t
),
9349 return cp_build_qualified_type_real (build_ptrmem_type (r
, type
),
9358 fntype
= tsubst_function_type (t
, args
, complain
, in_decl
);
9359 if (fntype
== error_mark_node
)
9360 return error_mark_node
;
9362 /* Substitute the exception specification. */
9363 specs
= tsubst_exception_specification (t
, args
, complain
,
9365 if (specs
== error_mark_node
)
9366 return error_mark_node
;
9368 fntype
= build_exception_variant (fntype
, specs
);
9373 tree domain
= tsubst (TYPE_DOMAIN (t
), args
, complain
, in_decl
);
9374 if (domain
== error_mark_node
)
9375 return error_mark_node
;
9377 /* As an optimization, we avoid regenerating the array type if
9378 it will obviously be the same as T. */
9379 if (type
== TREE_TYPE (t
) && domain
== TYPE_DOMAIN (t
))
9382 /* These checks should match the ones in grokdeclarator.
9386 The deduction may fail for any of the following reasons:
9388 -- Attempting to create an array with an element type that
9389 is void, a function type, or a reference type, or [DR337]
9390 an abstract class type. */
9391 if (TREE_CODE (type
) == VOID_TYPE
9392 || TREE_CODE (type
) == FUNCTION_TYPE
9393 || TREE_CODE (type
) == REFERENCE_TYPE
)
9395 if (complain
& tf_error
)
9396 error ("creating array of %qT", type
);
9397 return error_mark_node
;
9399 if (CLASS_TYPE_P (type
) && CLASSTYPE_PURE_VIRTUALS (type
))
9401 if (complain
& tf_error
)
9402 error ("creating array of %qT, which is an abstract class type",
9404 return error_mark_node
;
9407 r
= build_cplus_array_type (type
, domain
);
9409 if (TYPE_USER_ALIGN (t
))
9411 TYPE_ALIGN (r
) = TYPE_ALIGN (t
);
9412 TYPE_USER_ALIGN (r
) = 1;
9421 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
9422 tree e2
= tsubst (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
9424 if (e1
== error_mark_node
|| e2
== error_mark_node
)
9425 return error_mark_node
;
9427 return fold_build2 (TREE_CODE (t
), TREE_TYPE (t
), e1
, e2
);
9433 tree e
= tsubst (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
9434 if (e
== error_mark_node
)
9435 return error_mark_node
;
9437 return fold_build1 (TREE_CODE (t
), TREE_TYPE (t
), e
);
9442 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
9443 in_decl
, /*entering_scope=*/1);
9444 tree f
= tsubst_copy (TYPENAME_TYPE_FULLNAME (t
), args
,
9447 if (ctx
== error_mark_node
|| f
== error_mark_node
)
9448 return error_mark_node
;
9450 if (!MAYBE_CLASS_TYPE_P (ctx
))
9452 if (complain
& tf_error
)
9453 error ("%qT is not a class, struct, or union type", ctx
);
9454 return error_mark_node
;
9456 else if (!uses_template_parms (ctx
) && !TYPE_BEING_DEFINED (ctx
))
9458 /* Normally, make_typename_type does not require that the CTX
9459 have complete type in order to allow things like:
9461 template <class T> struct S { typename S<T>::X Y; };
9463 But, such constructs have already been resolved by this
9464 point, so here CTX really should have complete type, unless
9465 it's a partial instantiation. */
9466 ctx
= complete_type (ctx
);
9467 if (!COMPLETE_TYPE_P (ctx
))
9469 if (complain
& tf_error
)
9470 cxx_incomplete_type_error (NULL_TREE
, ctx
);
9471 return error_mark_node
;
9475 f
= make_typename_type (ctx
, f
, typename_type
,
9476 (complain
& tf_error
) | tf_keep_type_decl
);
9477 if (f
== error_mark_node
)
9479 if (TREE_CODE (f
) == TYPE_DECL
)
9481 complain
|= tf_ignore_bad_quals
;
9485 if (TREE_CODE (f
) != TYPENAME_TYPE
)
9487 if (TYPENAME_IS_ENUM_P (t
) && TREE_CODE (f
) != ENUMERAL_TYPE
)
9488 error ("%qT resolves to %qT, which is not an enumeration type",
9490 else if (TYPENAME_IS_CLASS_P (t
) && !CLASS_TYPE_P (f
))
9491 error ("%qT resolves to %qT, which is is not a class type",
9495 return cp_build_qualified_type_real
9496 (f
, cp_type_quals (f
) | cp_type_quals (t
), complain
);
9499 case UNBOUND_CLASS_TEMPLATE
:
9501 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
9502 in_decl
, /*entering_scope=*/1);
9503 tree name
= TYPE_IDENTIFIER (t
);
9504 tree parm_list
= DECL_TEMPLATE_PARMS (TYPE_NAME (t
));
9506 if (ctx
== error_mark_node
|| name
== error_mark_node
)
9507 return error_mark_node
;
9510 parm_list
= tsubst_template_parms (parm_list
, args
, complain
);
9511 return make_unbound_class_template (ctx
, name
, parm_list
, complain
);
9521 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
9522 tree e2
= tsubst_expr (TREE_OPERAND (t
, 1), args
, complain
, in_decl
,
9523 /*integral_constant_expression_p=*/false);
9524 if (e1
== error_mark_node
|| e2
== error_mark_node
)
9525 return error_mark_node
;
9527 return build_nt (ARRAY_REF
, e1
, e2
, NULL_TREE
, NULL_TREE
);
9532 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
9533 tree e2
= tsubst (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
9534 if (e1
== error_mark_node
|| e2
== error_mark_node
)
9535 return error_mark_node
;
9537 return build_qualified_name (/*type=*/NULL_TREE
,
9538 e1
, e2
, QUALIFIED_NAME_IS_TEMPLATE (t
));
9545 type
= finish_typeof (tsubst_expr
9546 (TYPEOF_TYPE_EXPR (t
), args
,
9548 /*integral_constant_expression_p=*/false));
9549 return cp_build_qualified_type_real (type
,
9551 | cp_type_quals (type
),
9560 finish_decltype_type (tsubst_expr
9561 (DECLTYPE_TYPE_EXPR (t
), args
,
9563 /*integral_constant_expression_p=*/false),
9564 DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t
));
9565 return cp_build_qualified_type_real (type
,
9567 | cp_type_quals (type
),
9571 case TYPE_ARGUMENT_PACK
:
9572 case NONTYPE_ARGUMENT_PACK
:
9574 tree r
= make_node (TREE_CODE (t
));
9576 tsubst_template_args (ARGUMENT_PACK_ARGS (t
),
9580 SET_ARGUMENT_PACK_ARGS (r
, packed_out
);
9582 /* For template nontype argument packs, also substitute into
9584 if (TREE_CODE (t
) == NONTYPE_ARGUMENT_PACK
)
9585 TREE_TYPE (r
) = tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
9592 sorry ("use of %qs in template",
9593 tree_code_name
[(int) TREE_CODE (t
)]);
9594 return error_mark_node
;
9598 /* Like tsubst_expr for a BASELINK. OBJECT_TYPE, if non-NULL, is the
9599 type of the expression on the left-hand side of the "." or "->"
9603 tsubst_baselink (tree baselink
, tree object_type
,
9604 tree args
, tsubst_flags_t complain
, tree in_decl
)
9607 tree qualifying_scope
;
9610 tree template_args
= 0;
9611 bool template_id_p
= false;
9613 /* A baselink indicates a function from a base class. Both the
9614 BASELINK_ACCESS_BINFO and the base class referenced may
9615 indicate bases of the template class, rather than the
9616 instantiated class. In addition, lookups that were not
9617 ambiguous before may be ambiguous now. Therefore, we perform
9618 the lookup again. */
9619 qualifying_scope
= BINFO_TYPE (BASELINK_ACCESS_BINFO (baselink
));
9620 qualifying_scope
= tsubst (qualifying_scope
, args
,
9622 fns
= BASELINK_FUNCTIONS (baselink
);
9623 optype
= BASELINK_OPTYPE (baselink
);
9624 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
9626 template_id_p
= true;
9627 template_args
= TREE_OPERAND (fns
, 1);
9628 fns
= TREE_OPERAND (fns
, 0);
9630 template_args
= tsubst_template_args (template_args
, args
,
9633 name
= DECL_NAME (get_first_fn (fns
));
9634 baselink
= lookup_fnfields (qualifying_scope
, name
, /*protect=*/1);
9636 /* If lookup found a single function, mark it as used at this
9637 point. (If it lookup found multiple functions the one selected
9638 later by overload resolution will be marked as used at that
9640 if (BASELINK_P (baselink
))
9641 fns
= BASELINK_FUNCTIONS (baselink
);
9642 if (!template_id_p
&& !really_overloaded_fn (fns
))
9643 mark_used (OVL_CURRENT (fns
));
9645 /* Add back the template arguments, if present. */
9646 if (BASELINK_P (baselink
) && template_id_p
)
9647 BASELINK_FUNCTIONS (baselink
)
9648 = build_nt (TEMPLATE_ID_EXPR
,
9649 BASELINK_FUNCTIONS (baselink
),
9651 /* Update the conversion operator type. */
9652 BASELINK_OPTYPE (baselink
)
9653 = tsubst (optype
, args
, complain
, in_decl
);
9656 object_type
= current_class_type
;
9657 return adjust_result_of_qualified_name_lookup (baselink
,
9662 /* Like tsubst_expr for a SCOPE_REF, given by QUALIFIED_ID. DONE is
9663 true if the qualified-id will be a postfix-expression in-and-of
9664 itself; false if more of the postfix-expression follows the
9665 QUALIFIED_ID. ADDRESS_P is true if the qualified-id is the operand
9669 tsubst_qualified_id (tree qualified_id
, tree args
,
9670 tsubst_flags_t complain
, tree in_decl
,
9671 bool done
, bool address_p
)
9679 gcc_assert (TREE_CODE (qualified_id
) == SCOPE_REF
);
9681 /* Figure out what name to look up. */
9682 name
= TREE_OPERAND (qualified_id
, 1);
9683 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
9686 template_args
= TREE_OPERAND (name
, 1);
9688 template_args
= tsubst_template_args (template_args
, args
,
9690 name
= TREE_OPERAND (name
, 0);
9694 is_template
= false;
9695 template_args
= NULL_TREE
;
9698 /* Substitute into the qualifying scope. When there are no ARGS, we
9699 are just trying to simplify a non-dependent expression. In that
9700 case the qualifying scope may be dependent, and, in any case,
9701 substituting will not help. */
9702 scope
= TREE_OPERAND (qualified_id
, 0);
9705 scope
= tsubst (scope
, args
, complain
, in_decl
);
9706 expr
= tsubst_copy (name
, args
, complain
, in_decl
);
9711 if (dependent_type_p (scope
))
9712 return build_qualified_name (/*type=*/NULL_TREE
,
9714 QUALIFIED_NAME_IS_TEMPLATE (qualified_id
));
9716 if (!BASELINK_P (name
) && !DECL_P (expr
))
9718 if (TREE_CODE (expr
) == BIT_NOT_EXPR
)
9719 /* If this were actually a destructor call, it would have been
9720 parsed as such by the parser. */
9721 expr
= error_mark_node
;
9723 expr
= lookup_qualified_name (scope
, expr
, /*is_type_p=*/0, false);
9724 if (TREE_CODE (TREE_CODE (expr
) == TEMPLATE_DECL
9725 ? DECL_TEMPLATE_RESULT (expr
) : expr
) == TYPE_DECL
)
9727 if (complain
& tf_error
)
9729 error ("dependent-name %qE is parsed as a non-type, but "
9730 "instantiation yields a type", qualified_id
);
9731 inform (input_location
, "say %<typename %E%> if a type is meant", qualified_id
);
9733 return error_mark_node
;
9739 check_accessibility_of_qualified_id (expr
, /*object_type=*/NULL_TREE
,
9741 /* Remember that there was a reference to this entity. */
9745 if (expr
== error_mark_node
|| TREE_CODE (expr
) == TREE_LIST
)
9747 if (complain
& tf_error
)
9748 qualified_name_lookup_error (scope
,
9749 TREE_OPERAND (qualified_id
, 1),
9750 expr
, input_location
);
9751 return error_mark_node
;
9755 expr
= lookup_template_function (expr
, template_args
);
9757 if (expr
== error_mark_node
&& complain
& tf_error
)
9758 qualified_name_lookup_error (scope
, TREE_OPERAND (qualified_id
, 1),
9759 expr
, input_location
);
9760 else if (TYPE_P (scope
))
9762 expr
= (adjust_result_of_qualified_name_lookup
9763 (expr
, scope
, current_class_type
));
9764 expr
= (finish_qualified_id_expr
9765 (scope
, expr
, done
, address_p
,
9766 QUALIFIED_NAME_IS_TEMPLATE (qualified_id
),
9767 /*template_arg_p=*/false));
9770 /* Expressions do not generally have reference type. */
9771 if (TREE_CODE (expr
) != SCOPE_REF
9772 /* However, if we're about to form a pointer-to-member, we just
9773 want the referenced member referenced. */
9774 && TREE_CODE (expr
) != OFFSET_REF
)
9775 expr
= convert_from_reference (expr
);
9780 /* Like tsubst, but deals with expressions. This function just replaces
9781 template parms; to finish processing the resultant expression, use
9785 tsubst_copy (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
9787 enum tree_code code
;
9790 if (t
== NULL_TREE
|| t
== error_mark_node
)
9793 code
= TREE_CODE (t
);
9798 r
= retrieve_local_specialization (t
);
9799 gcc_assert (r
!= NULL
);
9800 if (TREE_CODE (r
) == ARGUMENT_PACK_SELECT
)
9801 r
= ARGUMENT_PACK_SELECT_ARG (r
);
9810 if (DECL_TEMPLATE_PARM_P (t
))
9811 return tsubst_copy (DECL_INITIAL (t
), args
, complain
, in_decl
);
9812 /* There is no need to substitute into namespace-scope
9814 if (DECL_NAMESPACE_SCOPE_P (t
))
9816 /* If ARGS is NULL, then T is known to be non-dependent. */
9817 if (args
== NULL_TREE
)
9818 return integral_constant_value (t
);
9820 /* Unfortunately, we cannot just call lookup_name here.
9823 template <int I> int f() {
9825 struct S { void g() { E e = a; } };
9828 When we instantiate f<7>::S::g(), say, lookup_name is not
9829 clever enough to find f<7>::a. */
9831 = tsubst_aggr_type (TREE_TYPE (t
), args
, complain
, in_decl
,
9832 /*entering_scope=*/0);
9834 for (v
= TYPE_VALUES (enum_type
);
9837 if (TREE_PURPOSE (v
) == DECL_NAME (t
))
9838 return TREE_VALUE (v
);
9840 /* We didn't find the name. That should never happen; if
9841 name-lookup found it during preliminary parsing, we
9842 should find it again here during instantiation. */
9848 if (DECL_CONTEXT (t
))
9852 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
9853 /*entering_scope=*/1);
9854 if (ctx
!= DECL_CONTEXT (t
))
9856 tree r
= lookup_field (ctx
, DECL_NAME (t
), 0, false);
9859 if (complain
& tf_error
)
9860 error ("using invalid field %qD", t
);
9861 return error_mark_node
;
9871 if ((DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
))
9872 || local_variable_p (t
))
9873 t
= tsubst (t
, args
, complain
, in_decl
);
9878 return tsubst_baselink (t
, current_class_type
, args
, complain
, in_decl
);
9881 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
9882 return tsubst (TREE_TYPE (DECL_TEMPLATE_RESULT (t
)),
9883 args
, complain
, in_decl
);
9884 else if (DECL_FUNCTION_TEMPLATE_P (t
) && DECL_MEMBER_TEMPLATE_P (t
))
9885 return tsubst (t
, args
, complain
, in_decl
);
9886 else if (DECL_CLASS_SCOPE_P (t
)
9887 && uses_template_parms (DECL_CONTEXT (t
)))
9889 /* Template template argument like the following example need
9892 template <template <class> class TT> struct C {};
9893 template <class T> struct D {
9894 template <class U> struct E {};
9899 We are processing the template argument `E' in #1 for
9900 the template instantiation #2. Originally, `E' is a
9901 TEMPLATE_DECL with `D<T>' as its DECL_CONTEXT. Now we
9902 have to substitute this with one having context `D<int>'. */
9904 tree context
= tsubst (DECL_CONTEXT (t
), args
, complain
, in_decl
);
9905 return lookup_field (context
, DECL_NAME(t
), 0, false);
9908 /* Ordinary template template argument. */
9912 case REINTERPRET_CAST_EXPR
:
9913 case CONST_CAST_EXPR
:
9914 case STATIC_CAST_EXPR
:
9915 case DYNAMIC_CAST_EXPR
:
9918 (code
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
9919 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
));
9922 if (PACK_EXPANSION_P (TREE_OPERAND (t
, 0)))
9924 /* We only want to compute the number of arguments. */
9925 tree expanded
= tsubst_pack_expansion (TREE_OPERAND (t
, 0), args
,
9929 if (TREE_CODE (expanded
) == TREE_VEC
)
9930 len
= TREE_VEC_LENGTH (expanded
);
9932 if (expanded
== error_mark_node
)
9933 return error_mark_node
;
9934 else if (PACK_EXPANSION_P (expanded
)
9935 || (TREE_CODE (expanded
) == TREE_VEC
9937 && PACK_EXPANSION_P (TREE_VEC_ELT (expanded
, len
-1))))
9939 if (TREE_CODE (expanded
) == TREE_VEC
)
9940 expanded
= TREE_VEC_ELT (expanded
, len
- 1);
9942 if (TYPE_P (expanded
))
9943 return cxx_sizeof_or_alignof_type (expanded
, SIZEOF_EXPR
,
9944 complain
& tf_error
);
9946 return cxx_sizeof_or_alignof_expr (expanded
, SIZEOF_EXPR
,
9947 complain
& tf_error
);
9950 return build_int_cst (size_type_node
, len
);
9956 case TRUTH_NOT_EXPR
:
9959 case UNARY_PLUS_EXPR
: /* Unary + */
9967 (code
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
9968 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
));
9975 object
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
9976 name
= TREE_OPERAND (t
, 1);
9977 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
9979 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
9981 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
9983 else if (TREE_CODE (name
) == SCOPE_REF
9984 && TREE_CODE (TREE_OPERAND (name
, 1)) == BIT_NOT_EXPR
)
9986 tree base
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
9988 name
= TREE_OPERAND (name
, 1);
9989 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
9991 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
9992 name
= build_qualified_name (/*type=*/NULL_TREE
,
9994 /*template_p=*/false);
9996 else if (TREE_CODE (name
) == BASELINK
)
9997 name
= tsubst_baselink (name
,
9998 non_reference (TREE_TYPE (object
)),
10002 name
= tsubst_copy (name
, args
, complain
, in_decl
);
10003 return build_nt (COMPONENT_REF
, object
, name
, NULL_TREE
);
10009 case TRUNC_DIV_EXPR
:
10010 case CEIL_DIV_EXPR
:
10011 case FLOOR_DIV_EXPR
:
10012 case ROUND_DIV_EXPR
:
10013 case EXACT_DIV_EXPR
:
10017 case TRUNC_MOD_EXPR
:
10018 case FLOOR_MOD_EXPR
:
10019 case TRUTH_ANDIF_EXPR
:
10020 case TRUTH_ORIF_EXPR
:
10021 case TRUTH_AND_EXPR
:
10022 case TRUTH_OR_EXPR
:
10035 case COMPOUND_EXPR
:
10038 case PREDECREMENT_EXPR
:
10039 case PREINCREMENT_EXPR
:
10040 case POSTDECREMENT_EXPR
:
10041 case POSTINCREMENT_EXPR
:
10043 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
10044 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
));
10047 return build_qualified_name (/*type=*/NULL_TREE
,
10048 tsubst_copy (TREE_OPERAND (t
, 0),
10049 args
, complain
, in_decl
),
10050 tsubst_copy (TREE_OPERAND (t
, 1),
10051 args
, complain
, in_decl
),
10052 QUALIFIED_NAME_IS_TEMPLATE (t
));
10057 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
10058 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
),
10059 NULL_TREE
, NULL_TREE
);
10063 int n
= VL_EXP_OPERAND_LENGTH (t
);
10064 tree result
= build_vl_exp (CALL_EXPR
, n
);
10066 for (i
= 0; i
< n
; i
++)
10067 TREE_OPERAND (t
, i
) = tsubst_copy (TREE_OPERAND (t
, i
), args
,
10068 complain
, in_decl
);
10074 case PSEUDO_DTOR_EXPR
:
10077 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
10078 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
),
10079 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
));
10080 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
10087 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
10088 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
),
10089 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
));
10090 NEW_EXPR_USE_GLOBAL (r
) = NEW_EXPR_USE_GLOBAL (t
);
10097 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
10098 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
));
10099 DELETE_EXPR_USE_GLOBAL (r
) = DELETE_EXPR_USE_GLOBAL (t
);
10100 DELETE_EXPR_USE_VEC (r
) = DELETE_EXPR_USE_VEC (t
);
10104 case TEMPLATE_ID_EXPR
:
10106 /* Substituted template arguments */
10107 tree fn
= TREE_OPERAND (t
, 0);
10108 tree targs
= TREE_OPERAND (t
, 1);
10110 fn
= tsubst_copy (fn
, args
, complain
, in_decl
);
10112 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
10114 return lookup_template_function (fn
, targs
);
10119 tree purpose
, value
, chain
;
10121 if (t
== void_list_node
)
10124 purpose
= TREE_PURPOSE (t
);
10126 purpose
= tsubst_copy (purpose
, args
, complain
, in_decl
);
10127 value
= TREE_VALUE (t
);
10129 value
= tsubst_copy (value
, args
, complain
, in_decl
);
10130 chain
= TREE_CHAIN (t
);
10131 if (chain
&& chain
!= void_type_node
)
10132 chain
= tsubst_copy (chain
, args
, complain
, in_decl
);
10133 if (purpose
== TREE_PURPOSE (t
)
10134 && value
== TREE_VALUE (t
)
10135 && chain
== TREE_CHAIN (t
))
10137 return tree_cons (purpose
, value
, chain
);
10142 case ENUMERAL_TYPE
:
10144 case TEMPLATE_TYPE_PARM
:
10145 case TEMPLATE_TEMPLATE_PARM
:
10146 case BOUND_TEMPLATE_TEMPLATE_PARM
:
10147 case TEMPLATE_PARM_INDEX
:
10149 case REFERENCE_TYPE
:
10151 case FUNCTION_TYPE
:
10154 case TYPENAME_TYPE
:
10155 case UNBOUND_CLASS_TEMPLATE
:
10157 case DECLTYPE_TYPE
:
10159 return tsubst (t
, args
, complain
, in_decl
);
10161 case IDENTIFIER_NODE
:
10162 if (IDENTIFIER_TYPENAME_P (t
))
10164 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
10165 return mangle_conv_op_name_for_type (new_type
);
10171 /* This is handled by tsubst_copy_and_build. */
10172 gcc_unreachable ();
10175 return build_x_va_arg (tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
,
10177 tsubst (TREE_TYPE (t
), args
, complain
, in_decl
));
10179 case CLEANUP_POINT_EXPR
:
10180 /* We shouldn't have built any of these during initial template
10181 generation. Instead, they should be built during instantiation
10182 in response to the saved STMT_IS_FULL_EXPR_P setting. */
10183 gcc_unreachable ();
10186 mark_used (TREE_OPERAND (t
, 1));
10189 case EXPR_PACK_EXPANSION
:
10190 error ("invalid use of pack expansion expression");
10191 return error_mark_node
;
10193 case NONTYPE_ARGUMENT_PACK
:
10194 error ("use %<...%> to expand argument pack");
10195 return error_mark_node
;
10202 /* Like tsubst_copy, but specifically for OpenMP clauses. */
10205 tsubst_omp_clauses (tree clauses
, tree args
, tsubst_flags_t complain
,
10208 tree new_clauses
= NULL
, nc
, oc
;
10210 for (oc
= clauses
; oc
; oc
= OMP_CLAUSE_CHAIN (oc
))
10212 nc
= copy_node (oc
);
10213 OMP_CLAUSE_CHAIN (nc
) = new_clauses
;
10216 switch (OMP_CLAUSE_CODE (nc
))
10218 case OMP_CLAUSE_LASTPRIVATE
:
10219 if (OMP_CLAUSE_LASTPRIVATE_STMT (oc
))
10221 OMP_CLAUSE_LASTPRIVATE_STMT (nc
) = push_stmt_list ();
10222 tsubst_expr (OMP_CLAUSE_LASTPRIVATE_STMT (oc
), args
, complain
,
10223 in_decl
, /*integral_constant_expression_p=*/false);
10224 OMP_CLAUSE_LASTPRIVATE_STMT (nc
)
10225 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (nc
));
10228 case OMP_CLAUSE_PRIVATE
:
10229 case OMP_CLAUSE_SHARED
:
10230 case OMP_CLAUSE_FIRSTPRIVATE
:
10231 case OMP_CLAUSE_REDUCTION
:
10232 case OMP_CLAUSE_COPYIN
:
10233 case OMP_CLAUSE_COPYPRIVATE
:
10234 case OMP_CLAUSE_IF
:
10235 case OMP_CLAUSE_NUM_THREADS
:
10236 case OMP_CLAUSE_SCHEDULE
:
10237 case OMP_CLAUSE_COLLAPSE
:
10238 OMP_CLAUSE_OPERAND (nc
, 0)
10239 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 0), args
, complain
,
10240 in_decl
, /*integral_constant_expression_p=*/false);
10242 case OMP_CLAUSE_NOWAIT
:
10243 case OMP_CLAUSE_ORDERED
:
10244 case OMP_CLAUSE_DEFAULT
:
10245 case OMP_CLAUSE_UNTIED
:
10248 gcc_unreachable ();
10252 return finish_omp_clauses (nreverse (new_clauses
));
10255 /* Like tsubst_copy_and_build, but unshare TREE_LIST nodes. */
10258 tsubst_copy_asm_operands (tree t
, tree args
, tsubst_flags_t complain
,
10261 #define RECUR(t) tsubst_copy_asm_operands (t, args, complain, in_decl)
10263 tree purpose
, value
, chain
;
10268 if (TREE_CODE (t
) != TREE_LIST
)
10269 return tsubst_copy_and_build (t
, args
, complain
, in_decl
,
10270 /*function_p=*/false,
10271 /*integral_constant_expression_p=*/false);
10273 if (t
== void_list_node
)
10276 purpose
= TREE_PURPOSE (t
);
10278 purpose
= RECUR (purpose
);
10279 value
= TREE_VALUE (t
);
10281 value
= RECUR (value
);
10282 chain
= TREE_CHAIN (t
);
10283 if (chain
&& chain
!= void_type_node
)
10284 chain
= RECUR (chain
);
10285 return tree_cons (purpose
, value
, chain
);
10289 /* Substitute one OMP_FOR iterator. */
10292 tsubst_omp_for_iterator (tree t
, int i
, tree declv
, tree initv
,
10293 tree condv
, tree incrv
, tree
*clauses
,
10294 tree args
, tsubst_flags_t complain
, tree in_decl
,
10295 bool integral_constant_expression_p
)
10297 #define RECUR(NODE) \
10298 tsubst_expr ((NODE), args, complain, in_decl, \
10299 integral_constant_expression_p)
10300 tree decl
, init
, cond
, incr
;
10302 init
= TREE_VEC_ELT (OMP_FOR_INIT (t
), i
);
10303 gcc_assert (TREE_CODE (init
) == MODIFY_EXPR
);
10304 decl
= RECUR (TREE_OPERAND (init
, 0));
10305 init
= TREE_OPERAND (init
, 1);
10306 gcc_assert (!type_dependent_expression_p (decl
));
10308 if (!CLASS_TYPE_P (TREE_TYPE (decl
)))
10310 cond
= RECUR (TREE_VEC_ELT (OMP_FOR_COND (t
), i
));
10311 incr
= TREE_VEC_ELT (OMP_FOR_INCR (t
), i
);
10312 if (TREE_CODE (incr
) == MODIFY_EXPR
)
10313 incr
= build_x_modify_expr (RECUR (TREE_OPERAND (incr
, 0)), NOP_EXPR
,
10314 RECUR (TREE_OPERAND (incr
, 1)),
10317 incr
= RECUR (incr
);
10318 TREE_VEC_ELT (declv
, i
) = decl
;
10319 TREE_VEC_ELT (initv
, i
) = init
;
10320 TREE_VEC_ELT (condv
, i
) = cond
;
10321 TREE_VEC_ELT (incrv
, i
) = incr
;
10325 if (init
&& TREE_CODE (init
) != DECL_EXPR
)
10328 for (c
= *clauses
; c
; c
= OMP_CLAUSE_CHAIN (c
))
10330 if ((OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_PRIVATE
10331 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_LASTPRIVATE
)
10332 && OMP_CLAUSE_DECL (c
) == decl
)
10334 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_FIRSTPRIVATE
10335 && OMP_CLAUSE_DECL (c
) == decl
)
10336 error ("iteration variable %qD should not be firstprivate", decl
);
10337 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
10338 && OMP_CLAUSE_DECL (c
) == decl
)
10339 error ("iteration variable %qD should not be reduction", decl
);
10343 c
= build_omp_clause (OMP_CLAUSE_PRIVATE
);
10344 OMP_CLAUSE_DECL (c
) = decl
;
10345 c
= finish_omp_clauses (c
);
10348 OMP_CLAUSE_CHAIN (c
) = *clauses
;
10353 cond
= TREE_VEC_ELT (OMP_FOR_COND (t
), i
);
10354 if (COMPARISON_CLASS_P (cond
))
10355 cond
= build2 (TREE_CODE (cond
), boolean_type_node
,
10356 RECUR (TREE_OPERAND (cond
, 0)),
10357 RECUR (TREE_OPERAND (cond
, 1)));
10359 cond
= RECUR (cond
);
10360 incr
= TREE_VEC_ELT (OMP_FOR_INCR (t
), i
);
10361 switch (TREE_CODE (incr
))
10363 case PREINCREMENT_EXPR
:
10364 case PREDECREMENT_EXPR
:
10365 case POSTINCREMENT_EXPR
:
10366 case POSTDECREMENT_EXPR
:
10367 incr
= build2 (TREE_CODE (incr
), TREE_TYPE (decl
),
10368 RECUR (TREE_OPERAND (incr
, 0)), NULL_TREE
);
10371 if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
10372 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
10374 tree rhs
= TREE_OPERAND (incr
, 1);
10375 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
),
10376 RECUR (TREE_OPERAND (incr
, 0)),
10377 build2 (TREE_CODE (rhs
), TREE_TYPE (decl
),
10378 RECUR (TREE_OPERAND (rhs
, 0)),
10379 RECUR (TREE_OPERAND (rhs
, 1))));
10382 incr
= RECUR (incr
);
10385 if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
10386 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
10388 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
10389 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
10390 build2 (TREE_CODE (TREE_OPERAND (incr
, 1)),
10391 TREE_TYPE (decl
), lhs
,
10392 RECUR (TREE_OPERAND (incr
, 2))));
10394 else if (TREE_CODE (TREE_OPERAND (incr
, 1)) == NOP_EXPR
10395 && (TREE_CODE (TREE_OPERAND (incr
, 2)) == PLUS_EXPR
10396 || (TREE_CODE (TREE_OPERAND (incr
, 2)) == MINUS_EXPR
)))
10398 tree rhs
= TREE_OPERAND (incr
, 2);
10399 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
),
10400 RECUR (TREE_OPERAND (incr
, 0)),
10401 build2 (TREE_CODE (rhs
), TREE_TYPE (decl
),
10402 RECUR (TREE_OPERAND (rhs
, 0)),
10403 RECUR (TREE_OPERAND (rhs
, 1))));
10406 incr
= RECUR (incr
);
10409 incr
= RECUR (incr
);
10413 TREE_VEC_ELT (declv
, i
) = decl
;
10414 TREE_VEC_ELT (initv
, i
) = init
;
10415 TREE_VEC_ELT (condv
, i
) = cond
;
10416 TREE_VEC_ELT (incrv
, i
) = incr
;
10420 /* Like tsubst_copy for expressions, etc. but also does semantic
10424 tsubst_expr (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
,
10425 bool integral_constant_expression_p
)
10427 #define RECUR(NODE) \
10428 tsubst_expr ((NODE), args, complain, in_decl, \
10429 integral_constant_expression_p)
10433 if (t
== NULL_TREE
|| t
== error_mark_node
)
10436 if (EXPR_HAS_LOCATION (t
))
10437 input_location
= EXPR_LOCATION (t
);
10438 if (STATEMENT_CODE_P (TREE_CODE (t
)))
10439 current_stmt_tree ()->stmts_are_full_exprs_p
= STMT_IS_FULL_EXPR_P (t
);
10441 switch (TREE_CODE (t
))
10443 case STATEMENT_LIST
:
10445 tree_stmt_iterator i
;
10446 for (i
= tsi_start (t
); !tsi_end_p (i
); tsi_next (&i
))
10447 RECUR (tsi_stmt (i
));
10451 case CTOR_INITIALIZER
:
10452 finish_mem_initializers (tsubst_initializer_list
10453 (TREE_OPERAND (t
, 0), args
));
10457 finish_return_stmt (RECUR (TREE_OPERAND (t
, 0)));
10461 tmp
= RECUR (EXPR_STMT_EXPR (t
));
10462 if (EXPR_STMT_STMT_EXPR_RESULT (t
))
10463 finish_stmt_expr_expr (tmp
, cur_stmt_expr
);
10465 finish_expr_stmt (tmp
);
10469 do_using_directive (RECUR (USING_STMT_NAMESPACE (t
)));
10477 decl
= DECL_EXPR_DECL (t
);
10478 if (TREE_CODE (decl
) == LABEL_DECL
)
10479 finish_label_decl (DECL_NAME (decl
));
10480 else if (TREE_CODE (decl
) == USING_DECL
)
10482 tree scope
= USING_DECL_SCOPE (decl
);
10483 tree name
= DECL_NAME (decl
);
10486 scope
= RECUR (scope
);
10487 decl
= lookup_qualified_name (scope
, name
,
10488 /*is_type_p=*/false,
10489 /*complain=*/false);
10490 if (decl
== error_mark_node
|| TREE_CODE (decl
) == TREE_LIST
)
10491 qualified_name_lookup_error (scope
, name
, decl
, input_location
);
10493 do_local_using_decl (decl
, scope
, name
);
10497 init
= DECL_INITIAL (decl
);
10498 decl
= tsubst (decl
, args
, complain
, in_decl
);
10499 if (decl
!= error_mark_node
)
10501 /* By marking the declaration as instantiated, we avoid
10502 trying to instantiate it. Since instantiate_decl can't
10503 handle local variables, and since we've already done
10504 all that needs to be done, that's the right thing to
10506 if (TREE_CODE (decl
) == VAR_DECL
)
10507 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
10508 if (TREE_CODE (decl
) == VAR_DECL
10509 && ANON_AGGR_TYPE_P (TREE_TYPE (decl
)))
10510 /* Anonymous aggregates are a special case. */
10511 finish_anon_union (decl
);
10514 maybe_push_decl (decl
);
10515 if (TREE_CODE (decl
) == VAR_DECL
10516 && DECL_PRETTY_FUNCTION_P (decl
))
10518 /* For __PRETTY_FUNCTION__ we have to adjust the
10520 const char *const name
10521 = cxx_printable_name (current_function_decl
, 2);
10522 init
= cp_fname_init (name
, &TREE_TYPE (decl
));
10526 tree t
= RECUR (init
);
10529 /* If we had an initializer but it
10530 instantiated to nothing,
10531 value-initialize the object. This will
10532 only occur when the initializer was a
10533 pack expansion where the parameter packs
10534 used in that expansion were of length
10536 init
= build_default_init (TREE_TYPE (decl
),
10542 finish_decl (decl
, init
, NULL_TREE
);
10547 /* A DECL_EXPR can also be used as an expression, in the condition
10548 clause of an if/for/while construct. */
10553 stmt
= begin_for_stmt ();
10554 RECUR (FOR_INIT_STMT (t
));
10555 finish_for_init_stmt (stmt
);
10556 tmp
= RECUR (FOR_COND (t
));
10557 finish_for_cond (tmp
, stmt
);
10558 tmp
= RECUR (FOR_EXPR (t
));
10559 finish_for_expr (tmp
, stmt
);
10560 RECUR (FOR_BODY (t
));
10561 finish_for_stmt (stmt
);
10565 stmt
= begin_while_stmt ();
10566 tmp
= RECUR (WHILE_COND (t
));
10567 finish_while_stmt_cond (tmp
, stmt
);
10568 RECUR (WHILE_BODY (t
));
10569 finish_while_stmt (stmt
);
10573 stmt
= begin_do_stmt ();
10574 RECUR (DO_BODY (t
));
10575 finish_do_body (stmt
);
10576 tmp
= RECUR (DO_COND (t
));
10577 finish_do_stmt (tmp
, stmt
);
10581 stmt
= begin_if_stmt ();
10582 tmp
= RECUR (IF_COND (t
));
10583 finish_if_stmt_cond (tmp
, stmt
);
10584 RECUR (THEN_CLAUSE (t
));
10585 finish_then_clause (stmt
);
10587 if (ELSE_CLAUSE (t
))
10589 begin_else_clause (stmt
);
10590 RECUR (ELSE_CLAUSE (t
));
10591 finish_else_clause (stmt
);
10594 finish_if_stmt (stmt
);
10598 if (BIND_EXPR_BODY_BLOCK (t
))
10599 stmt
= begin_function_body ();
10601 stmt
= begin_compound_stmt (BIND_EXPR_TRY_BLOCK (t
)
10602 ? BCS_TRY_BLOCK
: 0);
10604 RECUR (BIND_EXPR_BODY (t
));
10606 if (BIND_EXPR_BODY_BLOCK (t
))
10607 finish_function_body (stmt
);
10609 finish_compound_stmt (stmt
);
10613 finish_break_stmt ();
10616 case CONTINUE_STMT
:
10617 finish_continue_stmt ();
10621 stmt
= begin_switch_stmt ();
10622 tmp
= RECUR (SWITCH_STMT_COND (t
));
10623 finish_switch_cond (tmp
, stmt
);
10624 RECUR (SWITCH_STMT_BODY (t
));
10625 finish_switch_stmt (stmt
);
10628 case CASE_LABEL_EXPR
:
10629 finish_case_label (RECUR (CASE_LOW (t
)),
10630 RECUR (CASE_HIGH (t
)));
10634 finish_label_stmt (DECL_NAME (LABEL_EXPR_LABEL (t
)));
10638 tmp
= GOTO_DESTINATION (t
);
10639 if (TREE_CODE (tmp
) != LABEL_DECL
)
10640 /* Computed goto's must be tsubst'd into. On the other hand,
10641 non-computed gotos must not be; the identifier in question
10642 will have no binding. */
10645 tmp
= DECL_NAME (tmp
);
10646 finish_goto_stmt (tmp
);
10650 tmp
= finish_asm_stmt
10651 (ASM_VOLATILE_P (t
),
10652 RECUR (ASM_STRING (t
)),
10653 tsubst_copy_asm_operands (ASM_OUTPUTS (t
), args
, complain
, in_decl
),
10654 tsubst_copy_asm_operands (ASM_INPUTS (t
), args
, complain
, in_decl
),
10655 tsubst_copy_asm_operands (ASM_CLOBBERS (t
), args
, complain
, in_decl
));
10657 tree asm_expr
= tmp
;
10658 if (TREE_CODE (asm_expr
) == CLEANUP_POINT_EXPR
)
10659 asm_expr
= TREE_OPERAND (asm_expr
, 0);
10660 ASM_INPUT_P (asm_expr
) = ASM_INPUT_P (t
);
10667 stmt
= begin_try_block ();
10668 RECUR (TRY_STMTS (t
));
10669 finish_cleanup_try_block (stmt
);
10670 finish_cleanup (RECUR (TRY_HANDLERS (t
)), stmt
);
10674 tree compound_stmt
= NULL_TREE
;
10676 if (FN_TRY_BLOCK_P (t
))
10677 stmt
= begin_function_try_block (&compound_stmt
);
10679 stmt
= begin_try_block ();
10681 RECUR (TRY_STMTS (t
));
10683 if (FN_TRY_BLOCK_P (t
))
10684 finish_function_try_block (stmt
);
10686 finish_try_block (stmt
);
10688 RECUR (TRY_HANDLERS (t
));
10689 if (FN_TRY_BLOCK_P (t
))
10690 finish_function_handler_sequence (stmt
, compound_stmt
);
10692 finish_handler_sequence (stmt
);
10698 tree decl
= HANDLER_PARMS (t
);
10702 decl
= tsubst (decl
, args
, complain
, in_decl
);
10703 /* Prevent instantiate_decl from trying to instantiate
10704 this variable. We've already done all that needs to be
10706 if (decl
!= error_mark_node
)
10707 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
10709 stmt
= begin_handler ();
10710 finish_handler_parms (decl
, stmt
);
10711 RECUR (HANDLER_BODY (t
));
10712 finish_handler (stmt
);
10717 tsubst (TREE_TYPE (t
), args
, complain
, NULL_TREE
);
10720 case STATIC_ASSERT
:
10723 tsubst_expr (STATIC_ASSERT_CONDITION (t
),
10726 /*integral_constant_expression_p=*/true);
10727 finish_static_assert (condition
,
10728 STATIC_ASSERT_MESSAGE (t
),
10729 STATIC_ASSERT_SOURCE_LOCATION (t
),
10730 /*member_p=*/false);
10735 tmp
= tsubst_omp_clauses (OMP_PARALLEL_CLAUSES (t
),
10736 args
, complain
, in_decl
);
10737 stmt
= begin_omp_parallel ();
10738 RECUR (OMP_PARALLEL_BODY (t
));
10739 OMP_PARALLEL_COMBINED (finish_omp_parallel (tmp
, stmt
))
10740 = OMP_PARALLEL_COMBINED (t
);
10744 tmp
= tsubst_omp_clauses (OMP_TASK_CLAUSES (t
),
10745 args
, complain
, in_decl
);
10746 stmt
= begin_omp_task ();
10747 RECUR (OMP_TASK_BODY (t
));
10748 finish_omp_task (tmp
, stmt
);
10753 tree clauses
, body
, pre_body
;
10754 tree declv
, initv
, condv
, incrv
;
10757 clauses
= tsubst_omp_clauses (OMP_FOR_CLAUSES (t
),
10758 args
, complain
, in_decl
);
10759 declv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
10760 initv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
10761 condv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
10762 incrv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
10764 for (i
= 0; i
< TREE_VEC_LENGTH (OMP_FOR_INIT (t
)); i
++)
10765 tsubst_omp_for_iterator (t
, i
, declv
, initv
, condv
, incrv
,
10766 &clauses
, args
, complain
, in_decl
,
10767 integral_constant_expression_p
);
10769 stmt
= begin_omp_structured_block ();
10771 for (i
= 0; i
< TREE_VEC_LENGTH (initv
); i
++)
10772 if (TREE_VEC_ELT (initv
, i
) == NULL
10773 || TREE_CODE (TREE_VEC_ELT (initv
, i
)) != DECL_EXPR
)
10774 TREE_VEC_ELT (initv
, i
) = RECUR (TREE_VEC_ELT (initv
, i
));
10775 else if (CLASS_TYPE_P (TREE_TYPE (TREE_VEC_ELT (initv
, i
))))
10777 tree init
= RECUR (TREE_VEC_ELT (initv
, i
));
10778 gcc_assert (init
== TREE_VEC_ELT (declv
, i
));
10779 TREE_VEC_ELT (initv
, i
) = NULL_TREE
;
10783 tree decl_expr
= TREE_VEC_ELT (initv
, i
);
10784 tree init
= DECL_INITIAL (DECL_EXPR_DECL (decl_expr
));
10785 gcc_assert (init
!= NULL
);
10786 TREE_VEC_ELT (initv
, i
) = RECUR (init
);
10787 DECL_INITIAL (DECL_EXPR_DECL (decl_expr
)) = NULL
;
10789 DECL_INITIAL (DECL_EXPR_DECL (decl_expr
)) = init
;
10792 pre_body
= push_stmt_list ();
10793 RECUR (OMP_FOR_PRE_BODY (t
));
10794 pre_body
= pop_stmt_list (pre_body
);
10796 body
= push_stmt_list ();
10797 RECUR (OMP_FOR_BODY (t
));
10798 body
= pop_stmt_list (body
);
10800 t
= finish_omp_for (EXPR_LOCATION (t
), declv
, initv
, condv
, incrv
,
10801 body
, pre_body
, clauses
);
10803 add_stmt (finish_omp_structured_block (stmt
));
10809 tmp
= tsubst_omp_clauses (OMP_CLAUSES (t
), args
, complain
, in_decl
);
10810 stmt
= push_stmt_list ();
10811 RECUR (OMP_BODY (t
));
10812 stmt
= pop_stmt_list (stmt
);
10815 OMP_BODY (t
) = stmt
;
10816 OMP_CLAUSES (t
) = tmp
;
10824 stmt
= push_stmt_list ();
10825 RECUR (OMP_BODY (t
));
10826 stmt
= pop_stmt_list (stmt
);
10829 OMP_BODY (t
) = stmt
;
10834 gcc_assert (OMP_ATOMIC_DEPENDENT_P (t
));
10836 tree op1
= TREE_OPERAND (t
, 1);
10837 tree lhs
= RECUR (TREE_OPERAND (op1
, 0));
10838 tree rhs
= RECUR (TREE_OPERAND (op1
, 1));
10839 finish_omp_atomic (TREE_CODE (op1
), lhs
, rhs
);
10843 case EXPR_PACK_EXPANSION
:
10844 error ("invalid use of pack expansion expression");
10845 return error_mark_node
;
10847 case NONTYPE_ARGUMENT_PACK
:
10848 error ("use %<...%> to expand argument pack");
10849 return error_mark_node
;
10852 gcc_assert (!STATEMENT_CODE_P (TREE_CODE (t
)));
10854 return tsubst_copy_and_build (t
, args
, complain
, in_decl
,
10855 /*function_p=*/false,
10856 integral_constant_expression_p
);
10863 /* T is a postfix-expression that is not being used in a function
10864 call. Return the substituted version of T. */
10867 tsubst_non_call_postfix_expression (tree t
, tree args
,
10868 tsubst_flags_t complain
,
10871 if (TREE_CODE (t
) == SCOPE_REF
)
10872 t
= tsubst_qualified_id (t
, args
, complain
, in_decl
,
10873 /*done=*/false, /*address_p=*/false);
10875 t
= tsubst_copy_and_build (t
, args
, complain
, in_decl
,
10876 /*function_p=*/false,
10877 /*integral_constant_expression_p=*/false);
10882 /* Like tsubst but deals with expressions and performs semantic
10883 analysis. FUNCTION_P is true if T is the "F" in "F (ARGS)". */
10886 tsubst_copy_and_build (tree t
,
10888 tsubst_flags_t complain
,
10891 bool integral_constant_expression_p
)
10893 #define RECUR(NODE) \
10894 tsubst_copy_and_build (NODE, args, complain, in_decl, \
10895 /*function_p=*/false, \
10896 integral_constant_expression_p)
10900 if (t
== NULL_TREE
|| t
== error_mark_node
)
10903 switch (TREE_CODE (t
))
10907 /* Fall through. */
10908 case IDENTIFIER_NODE
:
10912 bool non_integral_constant_expression_p
;
10913 const char *error_msg
;
10915 if (IDENTIFIER_TYPENAME_P (t
))
10917 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
10918 t
= mangle_conv_op_name_for_type (new_type
);
10921 /* Look up the name. */
10922 decl
= lookup_name (t
);
10924 /* By convention, expressions use ERROR_MARK_NODE to indicate
10925 failure, not NULL_TREE. */
10926 if (decl
== NULL_TREE
)
10927 decl
= error_mark_node
;
10929 decl
= finish_id_expression (t
, decl
, NULL_TREE
,
10931 integral_constant_expression_p
,
10932 /*allow_non_integral_constant_expression_p=*/false,
10933 &non_integral_constant_expression_p
,
10934 /*template_p=*/false,
10936 /*address_p=*/false,
10937 /*template_arg_p=*/false,
10942 if (!function_p
&& TREE_CODE (decl
) == IDENTIFIER_NODE
)
10943 decl
= unqualified_name_lookup_error (decl
);
10947 case TEMPLATE_ID_EXPR
:
10950 tree templ
= RECUR (TREE_OPERAND (t
, 0));
10951 tree targs
= TREE_OPERAND (t
, 1);
10954 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
10956 if (TREE_CODE (templ
) == COMPONENT_REF
)
10958 object
= TREE_OPERAND (templ
, 0);
10959 templ
= TREE_OPERAND (templ
, 1);
10962 object
= NULL_TREE
;
10963 templ
= lookup_template_function (templ
, targs
);
10966 return build3 (COMPONENT_REF
, TREE_TYPE (templ
),
10967 object
, templ
, NULL_TREE
);
10969 return baselink_for_fns (templ
);
10974 tree r
= RECUR (TREE_OPERAND (t
, 0));
10976 if (REFERENCE_REF_P (t
))
10978 /* A type conversion to reference type will be enclosed in
10979 such an indirect ref, but the substitution of the cast
10980 will have also added such an indirect ref. */
10981 if (TREE_CODE (TREE_TYPE (r
)) == REFERENCE_TYPE
)
10982 r
= convert_from_reference (r
);
10985 r
= build_x_indirect_ref (r
, "unary *", complain
);
10991 (tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
10992 RECUR (TREE_OPERAND (t
, 0)));
10995 case REINTERPRET_CAST_EXPR
:
10996 case CONST_CAST_EXPR
:
10997 case DYNAMIC_CAST_EXPR
:
10998 case STATIC_CAST_EXPR
:
11003 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11004 if (integral_constant_expression_p
11005 && !cast_valid_in_integral_constant_expression_p (type
))
11007 if (complain
& tf_error
)
11008 error ("a cast to a type other than an integral or "
11009 "enumeration type cannot appear in a constant-expression");
11010 return error_mark_node
;
11013 op
= RECUR (TREE_OPERAND (t
, 0));
11015 switch (TREE_CODE (t
))
11018 return build_functional_cast (type
, op
, complain
);
11019 case REINTERPRET_CAST_EXPR
:
11020 return build_reinterpret_cast (type
, op
, complain
);
11021 case CONST_CAST_EXPR
:
11022 return build_const_cast (type
, op
, complain
);
11023 case DYNAMIC_CAST_EXPR
:
11024 return build_dynamic_cast (type
, op
, complain
);
11025 case STATIC_CAST_EXPR
:
11026 return build_static_cast (type
, op
, complain
);
11028 gcc_unreachable ();
11032 case POSTDECREMENT_EXPR
:
11033 case POSTINCREMENT_EXPR
:
11034 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
11035 args
, complain
, in_decl
);
11036 return build_x_unary_op (TREE_CODE (t
), op1
, complain
);
11038 case PREDECREMENT_EXPR
:
11039 case PREINCREMENT_EXPR
:
11043 case TRUTH_NOT_EXPR
:
11044 case UNARY_PLUS_EXPR
: /* Unary + */
11045 case REALPART_EXPR
:
11046 case IMAGPART_EXPR
:
11047 return build_x_unary_op (TREE_CODE (t
), RECUR (TREE_OPERAND (t
, 0)),
11051 op1
= TREE_OPERAND (t
, 0);
11052 if (TREE_CODE (op1
) == SCOPE_REF
)
11053 op1
= tsubst_qualified_id (op1
, args
, complain
, in_decl
,
11054 /*done=*/true, /*address_p=*/true);
11056 op1
= tsubst_non_call_postfix_expression (op1
, args
, complain
,
11058 if (TREE_CODE (op1
) == LABEL_DECL
)
11059 return finish_label_address_expr (DECL_NAME (op1
),
11060 EXPR_LOCATION (op1
));
11061 return build_x_unary_op (ADDR_EXPR
, op1
, complain
);
11066 case TRUNC_DIV_EXPR
:
11067 case CEIL_DIV_EXPR
:
11068 case FLOOR_DIV_EXPR
:
11069 case ROUND_DIV_EXPR
:
11070 case EXACT_DIV_EXPR
:
11074 case TRUNC_MOD_EXPR
:
11075 case FLOOR_MOD_EXPR
:
11076 case TRUTH_ANDIF_EXPR
:
11077 case TRUTH_ORIF_EXPR
:
11078 case TRUTH_AND_EXPR
:
11079 case TRUTH_OR_EXPR
:
11094 return build_x_binary_op
11096 RECUR (TREE_OPERAND (t
, 0)),
11097 (TREE_NO_WARNING (TREE_OPERAND (t
, 0))
11099 : TREE_CODE (TREE_OPERAND (t
, 0))),
11100 RECUR (TREE_OPERAND (t
, 1)),
11101 (TREE_NO_WARNING (TREE_OPERAND (t
, 1))
11103 : TREE_CODE (TREE_OPERAND (t
, 1))),
11104 /*overloaded_p=*/NULL
,
11108 return tsubst_qualified_id (t
, args
, complain
, in_decl
, /*done=*/true,
11109 /*address_p=*/false);
11111 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
11112 args
, complain
, in_decl
);
11113 return build_x_binary_op (ARRAY_REF
, op1
,
11114 (TREE_NO_WARNING (TREE_OPERAND (t
, 0))
11116 : TREE_CODE (TREE_OPERAND (t
, 0))),
11117 RECUR (TREE_OPERAND (t
, 1)),
11118 (TREE_NO_WARNING (TREE_OPERAND (t
, 1))
11120 : TREE_CODE (TREE_OPERAND (t
, 1))),
11121 /*overloaded_p=*/NULL
,
11125 if (PACK_EXPANSION_P (TREE_OPERAND (t
, 0)))
11126 return tsubst_copy (t
, args
, complain
, in_decl
);
11130 op1
= TREE_OPERAND (t
, 0);
11133 /* When there are no ARGS, we are trying to evaluate a
11134 non-dependent expression from the parser. Trying to do
11135 the substitutions may not work. */
11137 op1
= TREE_TYPE (op1
);
11142 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
11143 /*function_p=*/false,
11144 /*integral_constant_expression_p=*/false);
11148 return cxx_sizeof_or_alignof_type (op1
, TREE_CODE (t
),
11149 complain
& tf_error
);
11151 return cxx_sizeof_or_alignof_expr (op1
, TREE_CODE (t
),
11152 complain
& tf_error
);
11156 tree r
= build_x_modify_expr
11157 (RECUR (TREE_OPERAND (t
, 0)),
11158 TREE_CODE (TREE_OPERAND (t
, 1)),
11159 RECUR (TREE_OPERAND (t
, 2)),
11161 /* TREE_NO_WARNING must be set if either the expression was
11162 parenthesized or it uses an operator such as >>= rather
11163 than plain assignment. In the former case, it was already
11164 set and must be copied. In the latter case,
11165 build_x_modify_expr sets it and it must not be reset
11167 if (TREE_NO_WARNING (t
))
11168 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
11173 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
11174 args
, complain
, in_decl
);
11175 /* Remember that there was a reference to this entity. */
11178 return build_x_arrow (op1
);
11182 tree init
= RECUR (TREE_OPERAND (t
, 3));
11184 if (TREE_OPERAND (t
, 3) && !init
)
11185 /* If there was an initializer in the original tree, but
11186 it instantiated to an empty list, then we should pass on
11187 VOID_ZERO_NODE to tell build_new that it was an empty
11188 initializer () rather than no initializer. This can only
11189 happen when the initializer is a pack expansion whose
11190 parameter packs are of length zero. */
11191 init
= void_zero_node
;
11194 (RECUR (TREE_OPERAND (t
, 0)),
11195 RECUR (TREE_OPERAND (t
, 1)),
11196 RECUR (TREE_OPERAND (t
, 2)),
11198 NEW_EXPR_USE_GLOBAL (t
),
11203 return delete_sanity
11204 (RECUR (TREE_OPERAND (t
, 0)),
11205 RECUR (TREE_OPERAND (t
, 1)),
11206 DELETE_EXPR_USE_VEC (t
),
11207 DELETE_EXPR_USE_GLOBAL (t
));
11209 case COMPOUND_EXPR
:
11210 return build_x_compound_expr (RECUR (TREE_OPERAND (t
, 0)),
11211 RECUR (TREE_OPERAND (t
, 1)),
11221 function
= CALL_EXPR_FN (t
);
11222 /* When we parsed the expression, we determined whether or
11223 not Koenig lookup should be performed. */
11224 koenig_p
= KOENIG_LOOKUP_P (t
);
11225 if (TREE_CODE (function
) == SCOPE_REF
)
11227 qualified_p
= true;
11228 function
= tsubst_qualified_id (function
, args
, complain
, in_decl
,
11230 /*address_p=*/false);
11234 if (TREE_CODE (function
) == COMPONENT_REF
)
11236 tree op
= TREE_OPERAND (function
, 1);
11238 qualified_p
= (TREE_CODE (op
) == SCOPE_REF
11239 || (BASELINK_P (op
)
11240 && BASELINK_QUALIFIED_P (op
)));
11243 qualified_p
= false;
11245 function
= tsubst_copy_and_build (function
, args
, complain
,
11248 integral_constant_expression_p
);
11250 if (BASELINK_P (function
))
11251 qualified_p
= true;
11254 /* FIXME: Rewrite this so as not to construct an arglist. */
11255 call_args
= RECUR (CALL_EXPR_ARGS (t
));
11257 /* We do not perform argument-dependent lookup if normal
11258 lookup finds a non-function, in accordance with the
11259 expected resolution of DR 218. */
11261 && ((is_overloaded_fn (function
)
11262 /* If lookup found a member function, the Koenig lookup is
11263 not appropriate, even if an unqualified-name was used
11264 to denote the function. */
11265 && !DECL_FUNCTION_MEMBER_P (get_first_fn (function
)))
11266 || TREE_CODE (function
) == IDENTIFIER_NODE
))
11267 function
= perform_koenig_lookup (function
, call_args
);
11269 if (TREE_CODE (function
) == IDENTIFIER_NODE
)
11271 unqualified_name_lookup_error (function
);
11272 return error_mark_node
;
11275 /* Remember that there was a reference to this entity. */
11276 if (DECL_P (function
))
11277 mark_used (function
);
11279 if (TREE_CODE (function
) == OFFSET_REF
)
11280 return build_offset_ref_call_from_tree (function
, call_args
);
11281 if (TREE_CODE (function
) == COMPONENT_REF
)
11283 if (!BASELINK_P (TREE_OPERAND (function
, 1)))
11284 return finish_call_expr (function
, call_args
,
11285 /*disallow_virtual=*/false,
11286 /*koenig_p=*/false,
11289 return (build_new_method_call
11290 (TREE_OPERAND (function
, 0),
11291 TREE_OPERAND (function
, 1),
11292 call_args
, NULL_TREE
,
11293 qualified_p
? LOOKUP_NONVIRTUAL
: LOOKUP_NORMAL
,
11297 return finish_call_expr (function
, call_args
,
11298 /*disallow_virtual=*/qualified_p
,
11304 return build_x_conditional_expr
11305 (RECUR (TREE_OPERAND (t
, 0)),
11306 RECUR (TREE_OPERAND (t
, 1)),
11307 RECUR (TREE_OPERAND (t
, 2)),
11310 case PSEUDO_DTOR_EXPR
:
11311 return finish_pseudo_destructor_expr
11312 (RECUR (TREE_OPERAND (t
, 0)),
11313 RECUR (TREE_OPERAND (t
, 1)),
11314 RECUR (TREE_OPERAND (t
, 2)));
11318 tree purpose
, value
, chain
;
11320 if (t
== void_list_node
)
11323 if ((TREE_PURPOSE (t
) && PACK_EXPANSION_P (TREE_PURPOSE (t
)))
11324 || (TREE_VALUE (t
) && PACK_EXPANSION_P (TREE_VALUE (t
))))
11326 /* We have pack expansions, so expand those and
11327 create a new list out of it. */
11328 tree purposevec
= NULL_TREE
;
11329 tree valuevec
= NULL_TREE
;
11333 /* Expand the argument expressions. */
11334 if (TREE_PURPOSE (t
))
11335 purposevec
= tsubst_pack_expansion (TREE_PURPOSE (t
), args
,
11336 complain
, in_decl
);
11337 if (TREE_VALUE (t
))
11338 valuevec
= tsubst_pack_expansion (TREE_VALUE (t
), args
,
11339 complain
, in_decl
);
11341 /* Build the rest of the list. */
11342 chain
= TREE_CHAIN (t
);
11343 if (chain
&& chain
!= void_type_node
)
11344 chain
= RECUR (chain
);
11346 /* Determine the number of arguments. */
11347 if (purposevec
&& TREE_CODE (purposevec
) == TREE_VEC
)
11349 len
= TREE_VEC_LENGTH (purposevec
);
11350 gcc_assert (!valuevec
|| len
== TREE_VEC_LENGTH (valuevec
));
11352 else if (TREE_CODE (valuevec
) == TREE_VEC
)
11353 len
= TREE_VEC_LENGTH (valuevec
);
11356 /* Since we only performed a partial substitution into
11357 the argument pack, we only return a single list
11359 if (purposevec
== TREE_PURPOSE (t
)
11360 && valuevec
== TREE_VALUE (t
)
11361 && chain
== TREE_CHAIN (t
))
11364 return tree_cons (purposevec
, valuevec
, chain
);
11367 /* Convert the argument vectors into a TREE_LIST */
11371 /* Grab the Ith values. */
11373 purpose
= purposevec
? TREE_VEC_ELT (purposevec
, i
)
11376 = valuevec
? convert_from_reference (TREE_VEC_ELT (valuevec
, i
))
11379 /* Build the list (backwards). */
11380 chain
= tree_cons (purpose
, value
, chain
);
11386 purpose
= TREE_PURPOSE (t
);
11388 purpose
= RECUR (purpose
);
11389 value
= TREE_VALUE (t
);
11391 value
= RECUR (value
);
11392 chain
= TREE_CHAIN (t
);
11393 if (chain
&& chain
!= void_type_node
)
11394 chain
= RECUR (chain
);
11395 if (purpose
== TREE_PURPOSE (t
)
11396 && value
== TREE_VALUE (t
)
11397 && chain
== TREE_CHAIN (t
))
11399 return tree_cons (purpose
, value
, chain
);
11402 case COMPONENT_REF
:
11408 object
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
11409 args
, complain
, in_decl
);
11410 /* Remember that there was a reference to this entity. */
11411 if (DECL_P (object
))
11412 mark_used (object
);
11413 object_type
= TREE_TYPE (object
);
11415 member
= TREE_OPERAND (t
, 1);
11416 if (BASELINK_P (member
))
11417 member
= tsubst_baselink (member
,
11418 non_reference (TREE_TYPE (object
)),
11419 args
, complain
, in_decl
);
11421 member
= tsubst_copy (member
, args
, complain
, in_decl
);
11422 if (member
== error_mark_node
)
11423 return error_mark_node
;
11425 if (object_type
&& !CLASS_TYPE_P (object_type
))
11427 if (SCALAR_TYPE_P (object_type
))
11429 tree s
= NULL_TREE
;
11430 tree dtor
= member
;
11432 if (TREE_CODE (dtor
) == SCOPE_REF
)
11434 s
= TREE_OPERAND (dtor
, 0);
11435 dtor
= TREE_OPERAND (dtor
, 1);
11437 if (TREE_CODE (dtor
) == BIT_NOT_EXPR
)
11439 dtor
= TREE_OPERAND (dtor
, 0);
11441 return finish_pseudo_destructor_expr (object
, s
, dtor
);
11445 else if (TREE_CODE (member
) == SCOPE_REF
11446 && TREE_CODE (TREE_OPERAND (member
, 1)) == TEMPLATE_ID_EXPR
)
11451 /* Lookup the template functions now that we know what the
11453 tmpl
= TREE_OPERAND (TREE_OPERAND (member
, 1), 0);
11454 args
= TREE_OPERAND (TREE_OPERAND (member
, 1), 1);
11455 member
= lookup_qualified_name (TREE_OPERAND (member
, 0), tmpl
,
11456 /*is_type_p=*/false,
11457 /*complain=*/false);
11458 if (BASELINK_P (member
))
11460 BASELINK_FUNCTIONS (member
)
11461 = build_nt (TEMPLATE_ID_EXPR
, BASELINK_FUNCTIONS (member
),
11463 member
= (adjust_result_of_qualified_name_lookup
11464 (member
, BINFO_TYPE (BASELINK_BINFO (member
)),
11469 qualified_name_lookup_error (object_type
, tmpl
, member
,
11471 return error_mark_node
;
11474 else if (TREE_CODE (member
) == SCOPE_REF
11475 && !CLASS_TYPE_P (TREE_OPERAND (member
, 0))
11476 && TREE_CODE (TREE_OPERAND (member
, 0)) != NAMESPACE_DECL
)
11478 if (complain
& tf_error
)
11480 if (TYPE_P (TREE_OPERAND (member
, 0)))
11481 error ("%qT is not a class or namespace",
11482 TREE_OPERAND (member
, 0));
11484 error ("%qD is not a class or namespace",
11485 TREE_OPERAND (member
, 0));
11487 return error_mark_node
;
11489 else if (TREE_CODE (member
) == FIELD_DECL
)
11490 return finish_non_static_data_member (member
, object
, NULL_TREE
);
11492 return finish_class_member_access_expr (object
, member
,
11493 /*template_p=*/false,
11499 (RECUR (TREE_OPERAND (t
, 0)));
11503 VEC(constructor_elt
,gc
) *n
;
11504 constructor_elt
*ce
;
11505 unsigned HOST_WIDE_INT idx
;
11506 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11507 bool process_index_p
;
11509 bool need_copy_p
= false;
11512 if (type
== error_mark_node
)
11513 return error_mark_node
;
11515 /* digest_init will do the wrong thing if we let it. */
11516 if (type
&& TYPE_PTRMEMFUNC_P (type
))
11519 /* We do not want to process the index of aggregate
11520 initializers as they are identifier nodes which will be
11521 looked up by digest_init. */
11522 process_index_p
= !(type
&& MAYBE_CLASS_TYPE_P (type
));
11524 n
= VEC_copy (constructor_elt
, gc
, CONSTRUCTOR_ELTS (t
));
11525 newlen
= VEC_length (constructor_elt
, n
);
11526 for (idx
= 0; VEC_iterate (constructor_elt
, n
, idx
, ce
); idx
++)
11528 if (ce
->index
&& process_index_p
)
11529 ce
->index
= RECUR (ce
->index
);
11531 if (PACK_EXPANSION_P (ce
->value
))
11533 /* Substitute into the pack expansion. */
11534 ce
->value
= tsubst_pack_expansion (ce
->value
, args
, complain
,
11537 if (ce
->value
== error_mark_node
)
11539 else if (TREE_VEC_LENGTH (ce
->value
) == 1)
11540 /* Just move the argument into place. */
11541 ce
->value
= TREE_VEC_ELT (ce
->value
, 0);
11544 /* Update the length of the final CONSTRUCTOR
11545 arguments vector, and note that we will need to
11547 newlen
= newlen
+ TREE_VEC_LENGTH (ce
->value
) - 1;
11548 need_copy_p
= true;
11552 ce
->value
= RECUR (ce
->value
);
11557 VEC(constructor_elt
,gc
) *old_n
= n
;
11559 n
= VEC_alloc (constructor_elt
, gc
, newlen
);
11560 for (idx
= 0; VEC_iterate (constructor_elt
, old_n
, idx
, ce
);
11563 if (TREE_CODE (ce
->value
) == TREE_VEC
)
11565 int i
, len
= TREE_VEC_LENGTH (ce
->value
);
11566 for (i
= 0; i
< len
; ++i
)
11567 CONSTRUCTOR_APPEND_ELT (n
, 0,
11568 TREE_VEC_ELT (ce
->value
, i
));
11571 CONSTRUCTOR_APPEND_ELT (n
, 0, ce
->value
);
11575 r
= build_constructor (init_list_type_node
, n
);
11577 if (TREE_HAS_CONSTRUCTOR (t
))
11578 return finish_compound_literal (type
, r
);
11585 tree operand_0
= RECUR (TREE_OPERAND (t
, 0));
11586 if (TYPE_P (operand_0
))
11587 return get_typeid (operand_0
);
11588 return build_typeid (operand_0
);
11598 tree r
= tsubst_copy (t
, args
, complain
, in_decl
);
11600 if (TREE_CODE (TREE_TYPE (t
)) != REFERENCE_TYPE
)
11601 /* If the original type was a reference, we'll be wrapped in
11602 the appropriate INDIRECT_REF. */
11603 r
= convert_from_reference (r
);
11608 return build_x_va_arg (RECUR (TREE_OPERAND (t
, 0)),
11609 tsubst_copy (TREE_TYPE (t
), args
, complain
,
11612 case OFFSETOF_EXPR
:
11613 return finish_offsetof (RECUR (TREE_OPERAND (t
, 0)));
11617 tree type1
= tsubst_copy (TRAIT_EXPR_TYPE1 (t
), args
,
11618 complain
, in_decl
);
11620 tree type2
= TRAIT_EXPR_TYPE2 (t
);
11622 type2
= tsubst_copy (type2
, args
, complain
, in_decl
);
11624 return finish_trait_expr (TRAIT_EXPR_KIND (t
), type1
, type2
);
11629 tree old_stmt_expr
= cur_stmt_expr
;
11630 tree stmt_expr
= begin_stmt_expr ();
11632 cur_stmt_expr
= stmt_expr
;
11633 tsubst_expr (STMT_EXPR_STMT (t
), args
, complain
, in_decl
,
11634 integral_constant_expression_p
);
11635 stmt_expr
= finish_stmt_expr (stmt_expr
, false);
11636 cur_stmt_expr
= old_stmt_expr
;
11642 t
= tsubst_copy (t
, args
, complain
, in_decl
);
11643 /* As in finish_id_expression, we resolve enumeration constants
11644 to their underlying values. */
11645 if (TREE_CODE (t
) == CONST_DECL
)
11647 used_types_insert (TREE_TYPE (t
));
11648 return DECL_INITIAL (t
);
11653 /* Handle Objective-C++ constructs, if appropriate. */
11656 = objcp_tsubst_copy_and_build (t
, args
, complain
,
11657 in_decl
, /*function_p=*/false);
11661 return tsubst_copy (t
, args
, complain
, in_decl
);
11667 /* Verify that the instantiated ARGS are valid. For type arguments,
11668 make sure that the type's linkage is ok. For non-type arguments,
11669 make sure they are constants if they are integral or enumerations.
11670 Emit an error under control of COMPLAIN, and return TRUE on error. */
11673 check_instantiated_args (tree tmpl
, tree args
, tsubst_flags_t complain
)
11675 int ix
, len
= DECL_NTPARMS (tmpl
);
11676 bool result
= false;
11678 for (ix
= 0; ix
!= len
; ix
++)
11680 tree t
= TREE_VEC_ELT (args
, ix
);
11684 /* [basic.link]: A name with no linkage (notably, the name
11685 of a class or enumeration declared in a local scope)
11686 shall not be used to declare an entity with linkage.
11687 This implies that names with no linkage cannot be used as
11688 template arguments. */
11689 tree nt
= no_linkage_check (t
, /*relaxed_p=*/false);
11693 /* DR 488 makes use of a type with no linkage cause
11694 type deduction to fail. */
11695 if (complain
& tf_error
)
11697 if (TYPE_ANONYMOUS_P (nt
))
11698 error ("%qT is/uses anonymous type", t
);
11700 error ("template argument for %qD uses local type %qT",
11705 /* In order to avoid all sorts of complications, we do not
11706 allow variably-modified types as template arguments. */
11707 else if (variably_modified_type_p (t
, NULL_TREE
))
11709 if (complain
& tf_error
)
11710 error ("%qT is a variably modified type", t
);
11714 /* A non-type argument of integral or enumerated type must be a
11716 else if (TREE_TYPE (t
)
11717 && INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (t
))
11718 && !TREE_CONSTANT (t
))
11720 if (complain
& tf_error
)
11721 error ("integral expression %qE is not constant", t
);
11725 if (result
&& (complain
& tf_error
))
11726 error (" trying to instantiate %qD", tmpl
);
11730 /* Instantiate the indicated variable or function template TMPL with
11731 the template arguments in TARG_PTR. */
11734 instantiate_template (tree tmpl
, tree targ_ptr
, tsubst_flags_t complain
)
11739 HOST_WIDE_INT saved_processing_template_decl
;
11741 if (tmpl
== error_mark_node
)
11742 return error_mark_node
;
11744 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
);
11746 /* If this function is a clone, handle it specially. */
11747 if (DECL_CLONED_FUNCTION_P (tmpl
))
11752 spec
= instantiate_template (DECL_CLONED_FUNCTION (tmpl
), targ_ptr
,
11754 if (spec
== error_mark_node
)
11755 return error_mark_node
;
11757 /* Look for the clone. */
11758 FOR_EACH_CLONE (clone
, spec
)
11759 if (DECL_NAME (clone
) == DECL_NAME (tmpl
))
11761 /* We should always have found the clone by now. */
11762 gcc_unreachable ();
11766 /* Check to see if we already have this specialization. */
11767 spec
= retrieve_specialization (tmpl
, targ_ptr
,
11768 /*class_specializations_p=*/false);
11769 if (spec
!= NULL_TREE
)
11772 gen_tmpl
= most_general_template (tmpl
);
11773 if (tmpl
!= gen_tmpl
)
11775 /* The TMPL is a partial instantiation. To get a full set of
11776 arguments we must add the arguments used to perform the
11777 partial instantiation. */
11778 targ_ptr
= add_outermost_template_args (DECL_TI_ARGS (tmpl
),
11781 /* Check to see if we already have this specialization. */
11782 spec
= retrieve_specialization (gen_tmpl
, targ_ptr
,
11783 /*class_specializations_p=*/false);
11784 if (spec
!= NULL_TREE
)
11788 if (check_instantiated_args (gen_tmpl
, INNERMOST_TEMPLATE_ARGS (targ_ptr
),
11790 return error_mark_node
;
11792 /* We are building a FUNCTION_DECL, during which the access of its
11793 parameters and return types have to be checked. However this
11794 FUNCTION_DECL which is the desired context for access checking
11795 is not built yet. We solve this chicken-and-egg problem by
11796 deferring all checks until we have the FUNCTION_DECL. */
11797 push_deferring_access_checks (dk_deferred
);
11799 /* Although PROCESSING_TEMPLATE_DECL may be true at this point
11800 (because, for example, we have encountered a non-dependent
11801 function call in the body of a template function and must now
11802 determine which of several overloaded functions will be called),
11803 within the instantiation itself we are not processing a
11805 saved_processing_template_decl
= processing_template_decl
;
11806 processing_template_decl
= 0;
11807 /* Substitute template parameters to obtain the specialization. */
11808 fndecl
= tsubst (DECL_TEMPLATE_RESULT (gen_tmpl
),
11809 targ_ptr
, complain
, gen_tmpl
);
11810 processing_template_decl
= saved_processing_template_decl
;
11811 if (fndecl
== error_mark_node
)
11812 return error_mark_node
;
11814 /* Now we know the specialization, compute access previously
11816 push_access_scope (fndecl
);
11817 perform_deferred_access_checks ();
11818 pop_access_scope (fndecl
);
11819 pop_deferring_access_checks ();
11821 /* The DECL_TI_TEMPLATE should always be the immediate parent
11822 template, not the most general template. */
11823 DECL_TI_TEMPLATE (fndecl
) = tmpl
;
11825 /* If we've just instantiated the main entry point for a function,
11826 instantiate all the alternate entry points as well. We do this
11827 by cloning the instantiation of the main entry point, not by
11828 instantiating the template clones. */
11829 if (TREE_CHAIN (gen_tmpl
) && DECL_CLONED_FUNCTION_P (TREE_CHAIN (gen_tmpl
)))
11830 clone_function_decl (fndecl
, /*update_method_vec_p=*/0);
11835 /* The FN is a TEMPLATE_DECL for a function. The ARGS are the
11836 arguments that are being used when calling it. TARGS is a vector
11837 into which the deduced template arguments are placed.
11839 Return zero for success, 2 for an incomplete match that doesn't resolve
11840 all the types, and 1 for complete failure. An error message will be
11841 printed only for an incomplete match.
11843 If FN is a conversion operator, or we are trying to produce a specific
11844 specialization, RETURN_TYPE is the return type desired.
11846 The EXPLICIT_TARGS are explicit template arguments provided via a
11849 The parameter STRICT is one of:
11852 We are deducing arguments for a function call, as in
11853 [temp.deduct.call].
11856 We are deducing arguments for a conversion function, as in
11857 [temp.deduct.conv].
11860 We are deducing arguments when doing an explicit instantiation
11861 as in [temp.explicit], when determining an explicit specialization
11862 as in [temp.expl.spec], or when taking the address of a function
11863 template, as in [temp.deduct.funcaddr]. */
11866 fn_type_unification (tree fn
,
11867 tree explicit_targs
,
11871 unification_kind_t strict
,
11877 bool incomplete_argument_packs_p
= false;
11879 gcc_assert (TREE_CODE (fn
) == TEMPLATE_DECL
);
11881 fntype
= TREE_TYPE (fn
);
11882 if (explicit_targs
)
11886 The specified template arguments must match the template
11887 parameters in kind (i.e., type, nontype, template), and there
11888 must not be more arguments than there are parameters;
11889 otherwise type deduction fails.
11891 Nontype arguments must match the types of the corresponding
11892 nontype template parameters, or must be convertible to the
11893 types of the corresponding nontype parameters as specified in
11894 _temp.arg.nontype_, otherwise type deduction fails.
11896 All references in the function type of the function template
11897 to the corresponding template parameters are replaced by the
11898 specified template argument values. If a substitution in a
11899 template parameter or in the function type of the function
11900 template results in an invalid type, type deduction fails. */
11901 tree tparms
= DECL_INNERMOST_TEMPLATE_PARMS (fn
);
11902 int i
, len
= TREE_VEC_LENGTH (tparms
);
11903 tree converted_args
;
11904 bool incomplete
= false;
11906 if (explicit_targs
== error_mark_node
)
11910 = (coerce_template_parms (tparms
, explicit_targs
, NULL_TREE
, tf_none
,
11911 /*require_all_args=*/false,
11912 /*use_default_args=*/false));
11913 if (converted_args
== error_mark_node
)
11916 /* Substitute the explicit args into the function type. This is
11917 necessary so that, for instance, explicitly declared function
11918 arguments can match null pointed constants. If we were given
11919 an incomplete set of explicit args, we must not do semantic
11920 processing during substitution as we could create partial
11922 for (i
= 0; i
< len
; i
++)
11924 tree parm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
11925 bool parameter_pack
= false;
11927 /* Dig out the actual parm. */
11928 if (TREE_CODE (parm
) == TYPE_DECL
11929 || TREE_CODE (parm
) == TEMPLATE_DECL
)
11931 parm
= TREE_TYPE (parm
);
11932 parameter_pack
= TEMPLATE_TYPE_PARAMETER_PACK (parm
);
11934 else if (TREE_CODE (parm
) == PARM_DECL
)
11936 parm
= DECL_INITIAL (parm
);
11937 parameter_pack
= TEMPLATE_PARM_PARAMETER_PACK (parm
);
11940 if (parameter_pack
)
11944 template_parm_level_and_index (parm
, &level
, &idx
);
11946 /* Mark the argument pack as "incomplete". We could
11947 still deduce more arguments during unification. */
11948 targ
= TMPL_ARG (converted_args
, level
, idx
);
11951 ARGUMENT_PACK_INCOMPLETE_P(targ
) = 1;
11952 ARGUMENT_PACK_EXPLICIT_ARGS (targ
)
11953 = ARGUMENT_PACK_ARGS (targ
);
11956 /* We have some incomplete argument packs. */
11957 incomplete_argument_packs_p
= true;
11961 if (incomplete_argument_packs_p
)
11962 /* Any substitution is guaranteed to be incomplete if there
11963 are incomplete argument packs, because we can still deduce
11967 incomplete
= NUM_TMPL_ARGS (explicit_targs
) != NUM_TMPL_ARGS (targs
);
11969 processing_template_decl
+= incomplete
;
11970 fntype
= tsubst (fntype
, converted_args
, tf_none
, NULL_TREE
);
11971 processing_template_decl
-= incomplete
;
11973 if (fntype
== error_mark_node
)
11976 /* Place the explicitly specified arguments in TARGS. */
11977 for (i
= NUM_TMPL_ARGS (converted_args
); i
--;)
11978 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (converted_args
, i
);
11981 /* Never do unification on the 'this' parameter. */
11982 parms
= skip_artificial_parms_for (fn
, TYPE_ARG_TYPES (fntype
));
11986 parms
= tree_cons (NULL_TREE
, TREE_TYPE (fntype
), parms
);
11987 args
= tree_cons (NULL_TREE
, return_type
, args
);
11990 /* We allow incomplete unification without an error message here
11991 because the standard doesn't seem to explicitly prohibit it. Our
11992 callers must be ready to deal with unification failures in any
11994 result
= type_unification_real (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
11995 targs
, parms
, args
, /*subr=*/0,
11998 if (result
== 0 && incomplete_argument_packs_p
)
12000 int i
, len
= NUM_TMPL_ARGS (targs
);
12002 /* Clear the "incomplete" flags on all argument packs. */
12003 for (i
= 0; i
< len
; i
++)
12005 tree arg
= TREE_VEC_ELT (targs
, i
);
12006 if (ARGUMENT_PACK_P (arg
))
12008 ARGUMENT_PACK_INCOMPLETE_P (arg
) = 0;
12009 ARGUMENT_PACK_EXPLICIT_ARGS (arg
) = NULL_TREE
;
12014 /* Now that we have bindings for all of the template arguments,
12015 ensure that the arguments deduced for the template template
12016 parameters have compatible template parameter lists. We cannot
12017 check this property before we have deduced all template
12018 arguments, because the template parameter types of a template
12019 template parameter might depend on prior template parameters
12020 deduced after the template template parameter. The following
12021 ill-formed example illustrates this issue:
12023 template<typename T, template<T> class C> void f(C<5>, T);
12025 template<int N> struct X {};
12028 f(X<5>(), 5l); // error: template argument deduction fails
12031 The template parameter list of 'C' depends on the template type
12032 parameter 'T', but 'C' is deduced to 'X' before 'T' is deduced to
12033 'long'. Thus, we can't check that 'C' cannot bind to 'X' at the
12034 time that we deduce 'C'. */
12036 && !template_template_parm_bindings_ok_p
12037 (DECL_INNERMOST_TEMPLATE_PARMS (fn
), targs
))
12041 /* All is well so far. Now, check:
12045 When all template arguments have been deduced, all uses of
12046 template parameters in nondeduced contexts are replaced with
12047 the corresponding deduced argument values. If the
12048 substitution results in an invalid type, as described above,
12049 type deduction fails. */
12050 if (tsubst (TREE_TYPE (fn
), targs
, tf_none
, NULL_TREE
)
12051 == error_mark_node
)
12057 /* Adjust types before performing type deduction, as described in
12058 [temp.deduct.call] and [temp.deduct.conv]. The rules in these two
12059 sections are symmetric. PARM is the type of a function parameter
12060 or the return type of the conversion function. ARG is the type of
12061 the argument passed to the call, or the type of the value
12062 initialized with the result of the conversion function.
12063 ARG_EXPR is the original argument expression, which may be null. */
12066 maybe_adjust_types_for_deduction (unification_kind_t strict
,
12080 /* Swap PARM and ARG throughout the remainder of this
12081 function; the handling is precisely symmetric since PARM
12082 will initialize ARG rather than vice versa. */
12090 /* There is nothing to do in this case. */
12094 gcc_unreachable ();
12097 if (TREE_CODE (*parm
) != REFERENCE_TYPE
)
12099 /* [temp.deduct.call]
12101 If P is not a reference type:
12103 --If A is an array type, the pointer type produced by the
12104 array-to-pointer standard conversion (_conv.array_) is
12105 used in place of A for type deduction; otherwise,
12107 --If A is a function type, the pointer type produced by
12108 the function-to-pointer standard conversion
12109 (_conv.func_) is used in place of A for type deduction;
12112 --If A is a cv-qualified type, the top level
12113 cv-qualifiers of A's type are ignored for type
12115 if (TREE_CODE (*arg
) == ARRAY_TYPE
)
12116 *arg
= build_pointer_type (TREE_TYPE (*arg
));
12117 else if (TREE_CODE (*arg
) == FUNCTION_TYPE
)
12118 *arg
= build_pointer_type (*arg
);
12120 *arg
= TYPE_MAIN_VARIANT (*arg
);
12123 /* From C++0x [14.8.2.1/3 temp.deduct.call] (after DR606), "If P is
12124 of the form T&&, where T is a template parameter, and the argument
12125 is an lvalue, T is deduced as A& */
12126 if (TREE_CODE (*parm
) == REFERENCE_TYPE
12127 && TYPE_REF_IS_RVALUE (*parm
)
12128 && TREE_CODE (TREE_TYPE (*parm
)) == TEMPLATE_TYPE_PARM
12129 && cp_type_quals (TREE_TYPE (*parm
)) == TYPE_UNQUALIFIED
12130 && arg_expr
&& real_lvalue_p (arg_expr
))
12131 *arg
= build_reference_type (*arg
);
12133 /* [temp.deduct.call]
12135 If P is a cv-qualified type, the top level cv-qualifiers
12136 of P's type are ignored for type deduction. If P is a
12137 reference type, the type referred to by P is used for
12139 *parm
= TYPE_MAIN_VARIANT (*parm
);
12140 if (TREE_CODE (*parm
) == REFERENCE_TYPE
)
12142 *parm
= TREE_TYPE (*parm
);
12143 result
|= UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
12146 /* DR 322. For conversion deduction, remove a reference type on parm
12147 too (which has been swapped into ARG). */
12148 if (strict
== DEDUCE_CONV
&& TREE_CODE (*arg
) == REFERENCE_TYPE
)
12149 *arg
= TREE_TYPE (*arg
);
12154 /* Most parms like fn_type_unification.
12156 If SUBR is 1, we're being called recursively (to unify the
12157 arguments of a function or method parameter of a function
12161 type_unification_real (tree tparms
,
12166 unification_kind_t strict
,
12169 tree parm
, arg
, arg_expr
;
12171 int ntparms
= TREE_VEC_LENGTH (tparms
);
12173 int saw_undeduced
= 0;
12176 gcc_assert (TREE_CODE (tparms
) == TREE_VEC
);
12177 gcc_assert (xparms
== NULL_TREE
|| TREE_CODE (xparms
) == TREE_LIST
);
12178 gcc_assert (!xargs
|| TREE_CODE (xargs
) == TREE_LIST
);
12179 gcc_assert (ntparms
> 0);
12184 sub_strict
= (UNIFY_ALLOW_OUTER_LEVEL
| UNIFY_ALLOW_MORE_CV_QUAL
12185 | UNIFY_ALLOW_DERIVED
);
12189 sub_strict
= UNIFY_ALLOW_LESS_CV_QUAL
;
12193 sub_strict
= UNIFY_ALLOW_NONE
;
12197 gcc_unreachable ();
12204 while (parms
&& parms
!= void_list_node
12205 && args
&& args
!= void_list_node
)
12207 if (TREE_CODE (TREE_VALUE (parms
)) == TYPE_PACK_EXPANSION
)
12210 parm
= TREE_VALUE (parms
);
12211 parms
= TREE_CHAIN (parms
);
12212 arg
= TREE_VALUE (args
);
12213 args
= TREE_CHAIN (args
);
12216 if (arg
== error_mark_node
)
12218 if (arg
== unknown_type_node
)
12219 /* We can't deduce anything from this, but we might get all the
12220 template args from other function args. */
12223 /* Conversions will be performed on a function argument that
12224 corresponds with a function parameter that contains only
12225 non-deducible template parameters and explicitly specified
12226 template parameters. */
12227 if (!uses_template_parms (parm
))
12232 type
= TREE_TYPE (arg
);
12236 if (same_type_p (parm
, type
))
12238 if (strict
!= DEDUCE_EXACT
12239 && can_convert_arg (parm
, type
, TYPE_P (arg
) ? NULL_TREE
: arg
,
12248 gcc_assert (TREE_TYPE (arg
) != NULL_TREE
);
12249 if (type_unknown_p (arg
))
12251 /* [temp.deduct.type]
12253 A template-argument can be deduced from a pointer to
12254 function or pointer to member function argument if
12255 the set of overloaded functions does not contain
12256 function templates and at most one of a set of
12257 overloaded functions provides a unique match. */
12258 if (resolve_overloaded_unification
12259 (tparms
, targs
, parm
, arg
, strict
, sub_strict
))
12265 arg
= unlowered_expr_type (arg
);
12266 if (arg
== error_mark_node
)
12271 int arg_strict
= sub_strict
;
12274 arg_strict
|= maybe_adjust_types_for_deduction (strict
, &parm
, &arg
,
12277 if (arg
== init_list_type_node
&& arg_expr
)
12279 if (unify (tparms
, targs
, parm
, arg
, arg_strict
))
12286 && parms
!= void_list_node
12287 && TREE_CODE (TREE_VALUE (parms
)) == TYPE_PACK_EXPANSION
)
12289 /* Unify the remaining arguments with the pack expansion type. */
12291 tree parmvec
= make_tree_vec (1);
12295 /* Count the number of arguments that remain. */
12296 for (t
= args
; t
&& t
!= void_list_node
; t
= TREE_CHAIN (t
))
12299 /* Allocate a TREE_VEC and copy in all of the arguments */
12300 argvec
= make_tree_vec (len
);
12301 for (i
= 0; args
&& args
!= void_list_node
; args
= TREE_CHAIN (args
))
12303 TREE_VEC_ELT (argvec
, i
) = TREE_VALUE (args
);
12307 /* Copy the parameter into parmvec. */
12308 TREE_VEC_ELT (parmvec
, 0) = TREE_VALUE (parms
);
12309 if (unify_pack_expansion (tparms
, targs
, parmvec
, argvec
, strict
,
12310 /*call_args_p=*/true, /*subr=*/subr
))
12313 /* Advance to the end of the list of parameters. */
12314 parms
= TREE_CHAIN (parms
);
12317 /* Fail if we've reached the end of the parm list, and more args
12318 are present, and the parm list isn't variadic. */
12319 if (args
&& args
!= void_list_node
&& parms
== void_list_node
)
12321 /* Fail if parms are left and they don't have default values. */
12322 if (parms
&& parms
!= void_list_node
12323 && TREE_PURPOSE (parms
) == NULL_TREE
)
12327 for (i
= 0; i
< ntparms
; i
++)
12328 if (!TREE_VEC_ELT (targs
, i
))
12332 if (TREE_VEC_ELT (tparms
, i
) == error_mark_node
)
12335 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
12337 /* If this is an undeduced nontype parameter that depends on
12338 a type parameter, try another pass; its type may have been
12339 deduced from a later argument than the one from which
12340 this parameter can be deduced. */
12341 if (TREE_CODE (tparm
) == PARM_DECL
12342 && uses_template_parms (TREE_TYPE (tparm
))
12343 && !saw_undeduced
++)
12346 /* Core issue #226 (C++0x) [temp.deduct]:
12348 If a template argument has not been deduced, its
12349 default template argument, if any, is used.
12351 When we are in C++98 mode, TREE_PURPOSE will either
12352 be NULL_TREE or ERROR_MARK_NODE, so we do not need
12353 to explicitly check cxx_dialect here. */
12354 if (TREE_PURPOSE (TREE_VEC_ELT (tparms
, i
)))
12356 tree arg
= tsubst (TREE_PURPOSE (TREE_VEC_ELT (tparms
, i
)),
12357 targs
, tf_none
, NULL_TREE
);
12358 if (arg
== error_mark_node
)
12362 TREE_VEC_ELT (targs
, i
) = arg
;
12367 /* If the type parameter is a parameter pack, then it will
12368 be deduced to an empty parameter pack. */
12369 if (template_parameter_pack_p (tparm
))
12373 if (TREE_CODE (tparm
) == TEMPLATE_PARM_INDEX
)
12375 arg
= make_node (NONTYPE_ARGUMENT_PACK
);
12376 TREE_TYPE (arg
) = TREE_TYPE (TEMPLATE_PARM_DECL (tparm
));
12377 TREE_CONSTANT (arg
) = 1;
12380 arg
= make_node (TYPE_ARGUMENT_PACK
);
12382 SET_ARGUMENT_PACK_ARGS (arg
, make_tree_vec (0));
12384 TREE_VEC_ELT (targs
, i
) = arg
;
12394 /* Subroutine of type_unification_real. Args are like the variables
12395 at the call site. ARG is an overloaded function (or template-id);
12396 we try deducing template args from each of the overloads, and if
12397 only one succeeds, we go with that. Modifies TARGS and returns
12398 true on success. */
12401 resolve_overloaded_unification (tree tparms
,
12405 unification_kind_t strict
,
12408 tree tempargs
= copy_node (targs
);
12412 if (TREE_CODE (arg
) == ADDR_EXPR
)
12414 arg
= TREE_OPERAND (arg
, 0);
12420 if (TREE_CODE (arg
) == COMPONENT_REF
)
12421 /* Handle `&x' where `x' is some static or non-static member
12423 arg
= TREE_OPERAND (arg
, 1);
12425 if (TREE_CODE (arg
) == OFFSET_REF
)
12426 arg
= TREE_OPERAND (arg
, 1);
12428 /* Strip baselink information. */
12429 if (BASELINK_P (arg
))
12430 arg
= BASELINK_FUNCTIONS (arg
);
12432 if (TREE_CODE (arg
) == TEMPLATE_ID_EXPR
)
12434 /* If we got some explicit template args, we need to plug them into
12435 the affected templates before we try to unify, in case the
12436 explicit args will completely resolve the templates in question. */
12438 tree expl_subargs
= TREE_OPERAND (arg
, 1);
12439 arg
= TREE_OPERAND (arg
, 0);
12441 for (; arg
; arg
= OVL_NEXT (arg
))
12443 tree fn
= OVL_CURRENT (arg
);
12444 tree subargs
, elem
;
12446 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
12449 ++processing_template_decl
;
12450 subargs
= get_bindings (fn
, DECL_TEMPLATE_RESULT (fn
),
12451 expl_subargs
, /*check_ret=*/false);
12454 elem
= tsubst (TREE_TYPE (fn
), subargs
, tf_none
, NULL_TREE
);
12455 good
+= try_one_overload (tparms
, targs
, tempargs
, parm
,
12456 elem
, strict
, sub_strict
, addr_p
);
12458 --processing_template_decl
;
12461 else if (TREE_CODE (arg
) != OVERLOAD
12462 && TREE_CODE (arg
) != FUNCTION_DECL
)
12463 /* If ARG is, for example, "(0, &f)" then its type will be unknown
12464 -- but the deduction does not succeed because the expression is
12465 not just the function on its own. */
12468 for (; arg
; arg
= OVL_NEXT (arg
))
12469 good
+= try_one_overload (tparms
, targs
, tempargs
, parm
,
12470 TREE_TYPE (OVL_CURRENT (arg
)),
12471 strict
, sub_strict
, addr_p
);
12473 /* [temp.deduct.type] A template-argument can be deduced from a pointer
12474 to function or pointer to member function argument if the set of
12475 overloaded functions does not contain function templates and at most
12476 one of a set of overloaded functions provides a unique match.
12478 So if we found multiple possibilities, we return success but don't
12479 deduce anything. */
12483 int i
= TREE_VEC_LENGTH (targs
);
12485 if (TREE_VEC_ELT (tempargs
, i
))
12486 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (tempargs
, i
);
12494 /* Subroutine of resolve_overloaded_unification; does deduction for a single
12495 overload. Fills TARGS with any deduced arguments, or error_mark_node if
12496 different overloads deduce different arguments for a given parm.
12497 ADDR_P is true if the expression for which deduction is being
12498 performed was of the form "& fn" rather than simply "fn".
12500 Returns 1 on success. */
12503 try_one_overload (tree tparms
,
12508 unification_kind_t strict
,
12516 /* [temp.deduct.type] A template-argument can be deduced from a pointer
12517 to function or pointer to member function argument if the set of
12518 overloaded functions does not contain function templates and at most
12519 one of a set of overloaded functions provides a unique match.
12521 So if this is a template, just return success. */
12523 if (uses_template_parms (arg
))
12526 if (TREE_CODE (arg
) == METHOD_TYPE
)
12527 arg
= build_ptrmemfunc_type (build_pointer_type (arg
));
12529 arg
= build_pointer_type (arg
);
12531 sub_strict
|= maybe_adjust_types_for_deduction (strict
, &parm
, &arg
, NULL
);
12533 /* We don't copy orig_targs for this because if we have already deduced
12534 some template args from previous args, unify would complain when we
12535 try to deduce a template parameter for the same argument, even though
12536 there isn't really a conflict. */
12537 nargs
= TREE_VEC_LENGTH (targs
);
12538 tempargs
= make_tree_vec (nargs
);
12540 if (unify (tparms
, tempargs
, parm
, arg
, sub_strict
) != 0)
12543 /* First make sure we didn't deduce anything that conflicts with
12544 explicitly specified args. */
12545 for (i
= nargs
; i
--; )
12547 tree elt
= TREE_VEC_ELT (tempargs
, i
);
12548 tree oldelt
= TREE_VEC_ELT (orig_targs
, i
);
12552 else if (uses_template_parms (elt
))
12553 /* Since we're unifying against ourselves, we will fill in
12554 template args used in the function parm list with our own
12555 template parms. Discard them. */
12556 TREE_VEC_ELT (tempargs
, i
) = NULL_TREE
;
12557 else if (oldelt
&& !template_args_equal (oldelt
, elt
))
12561 for (i
= nargs
; i
--; )
12563 tree elt
= TREE_VEC_ELT (tempargs
, i
);
12566 TREE_VEC_ELT (targs
, i
) = elt
;
12572 /* PARM is a template class (perhaps with unbound template
12573 parameters). ARG is a fully instantiated type. If ARG can be
12574 bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and
12575 TARGS are as for unify. */
12578 try_class_unification (tree tparms
, tree targs
, tree parm
, tree arg
)
12580 tree copy_of_targs
;
12582 if (!CLASSTYPE_TEMPLATE_INFO (arg
)
12583 || (most_general_template (CLASSTYPE_TI_TEMPLATE (arg
))
12584 != most_general_template (CLASSTYPE_TI_TEMPLATE (parm
))))
12587 /* We need to make a new template argument vector for the call to
12588 unify. If we used TARGS, we'd clutter it up with the result of
12589 the attempted unification, even if this class didn't work out.
12590 We also don't want to commit ourselves to all the unifications
12591 we've already done, since unification is supposed to be done on
12592 an argument-by-argument basis. In other words, consider the
12593 following pathological case:
12595 template <int I, int J, int K>
12598 template <int I, int J>
12599 struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {};
12601 template <int I, int J, int K>
12602 void f(S<I, J, K>, S<I, I, I>);
12611 Now, by the time we consider the unification involving `s2', we
12612 already know that we must have `f<0, 0, 0>'. But, even though
12613 `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is invalid
12614 because there are two ways to unify base classes of S<0, 1, 2>
12615 with S<I, I, I>. If we kept the already deduced knowledge, we
12616 would reject the possibility I=1. */
12617 copy_of_targs
= make_tree_vec (TREE_VEC_LENGTH (targs
));
12619 /* If unification failed, we're done. */
12620 if (unify (tparms
, copy_of_targs
, CLASSTYPE_TI_ARGS (parm
),
12621 CLASSTYPE_TI_ARGS (arg
), UNIFY_ALLOW_NONE
))
12627 /* Given a template type PARM and a class type ARG, find the unique
12628 base type in ARG that is an instance of PARM. We do not examine
12629 ARG itself; only its base-classes. If there is not exactly one
12630 appropriate base class, return NULL_TREE. PARM may be the type of
12631 a partial specialization, as well as a plain template type. Used
12635 get_template_base (tree tparms
, tree targs
, tree parm
, tree arg
)
12637 tree rval
= NULL_TREE
;
12640 gcc_assert (RECORD_OR_UNION_CODE_P (TREE_CODE (arg
)));
12642 binfo
= TYPE_BINFO (complete_type (arg
));
12644 /* The type could not be completed. */
12647 /* Walk in inheritance graph order. The search order is not
12648 important, and this avoids multiple walks of virtual bases. */
12649 for (binfo
= TREE_CHAIN (binfo
); binfo
; binfo
= TREE_CHAIN (binfo
))
12651 tree r
= try_class_unification (tparms
, targs
, parm
, BINFO_TYPE (binfo
));
12655 /* If there is more than one satisfactory baseclass, then:
12659 If they yield more than one possible deduced A, the type
12663 if (rval
&& !same_type_p (r
, rval
))
12673 /* Returns the level of DECL, which declares a template parameter. */
12676 template_decl_level (tree decl
)
12678 switch (TREE_CODE (decl
))
12681 case TEMPLATE_DECL
:
12682 return TEMPLATE_TYPE_LEVEL (TREE_TYPE (decl
));
12685 return TEMPLATE_PARM_LEVEL (DECL_INITIAL (decl
));
12688 gcc_unreachable ();
12693 /* Decide whether ARG can be unified with PARM, considering only the
12694 cv-qualifiers of each type, given STRICT as documented for unify.
12695 Returns nonzero iff the unification is OK on that basis. */
12698 check_cv_quals_for_unify (int strict
, tree arg
, tree parm
)
12700 int arg_quals
= cp_type_quals (arg
);
12701 int parm_quals
= cp_type_quals (parm
);
12703 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
12704 && !(strict
& UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
12706 /* Although a CVR qualifier is ignored when being applied to a
12707 substituted template parameter ([8.3.2]/1 for example), that
12708 does not apply during deduction [14.8.2.4]/1, (even though
12709 that is not explicitly mentioned, [14.8.2.4]/9 indicates
12710 this). Except when we're allowing additional CV qualifiers
12711 at the outer level [14.8.2.1]/3,1st bullet. */
12712 if ((TREE_CODE (arg
) == REFERENCE_TYPE
12713 || TREE_CODE (arg
) == FUNCTION_TYPE
12714 || TREE_CODE (arg
) == METHOD_TYPE
)
12715 && (parm_quals
& (TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
)))
12718 if ((!POINTER_TYPE_P (arg
) && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
)
12719 && (parm_quals
& TYPE_QUAL_RESTRICT
))
12723 if (!(strict
& (UNIFY_ALLOW_MORE_CV_QUAL
| UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
12724 && (arg_quals
& parm_quals
) != parm_quals
)
12727 if (!(strict
& (UNIFY_ALLOW_LESS_CV_QUAL
| UNIFY_ALLOW_OUTER_LESS_CV_QUAL
))
12728 && (parm_quals
& arg_quals
) != arg_quals
)
12734 /* Determines the LEVEL and INDEX for the template parameter PARM. */
12736 template_parm_level_and_index (tree parm
, int* level
, int* index
)
12738 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
12739 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
12740 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
12742 *index
= TEMPLATE_TYPE_IDX (parm
);
12743 *level
= TEMPLATE_TYPE_LEVEL (parm
);
12747 *index
= TEMPLATE_PARM_IDX (parm
);
12748 *level
= TEMPLATE_PARM_LEVEL (parm
);
12752 /* Unifies the remaining arguments in PACKED_ARGS with the pack
12753 expansion at the end of PACKED_PARMS. Returns 0 if the type
12754 deduction succeeds, 1 otherwise. STRICT is the same as in
12755 unify. CALL_ARGS_P is true iff PACKED_ARGS is actually a function
12756 call argument list. We'll need to adjust the arguments to make them
12757 types. SUBR tells us if this is from a recursive call to
12758 type_unification_real. */
12760 unify_pack_expansion (tree tparms
, tree targs
, tree packed_parms
,
12761 tree packed_args
, int strict
, bool call_args_p
,
12765 = TREE_VEC_ELT (packed_parms
, TREE_VEC_LENGTH (packed_parms
) - 1);
12766 tree pattern
= PACK_EXPANSION_PATTERN (parm
);
12767 tree pack
, packs
= NULL_TREE
;
12768 int i
, start
= TREE_VEC_LENGTH (packed_parms
) - 1;
12769 int len
= TREE_VEC_LENGTH (packed_args
);
12771 /* Determine the parameter packs we will be deducing from the
12772 pattern, and record their current deductions. */
12773 for (pack
= PACK_EXPANSION_PARAMETER_PACKS (parm
);
12774 pack
; pack
= TREE_CHAIN (pack
))
12776 tree parm_pack
= TREE_VALUE (pack
);
12779 /* Determine the index and level of this parameter pack. */
12780 template_parm_level_and_index (parm_pack
, &level
, &idx
);
12782 /* Keep track of the parameter packs and their corresponding
12784 packs
= tree_cons (parm_pack
, TMPL_ARG (targs
, level
, idx
), packs
);
12785 TREE_TYPE (packs
) = make_tree_vec (len
- start
);
12788 /* Loop through all of the arguments that have not yet been
12789 unified and unify each with the pattern. */
12790 for (i
= start
; i
< len
; i
++)
12792 tree parm
= pattern
;
12794 /* For each parameter pack, clear out the deduced value so that
12795 we can deduce it again. */
12796 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
12799 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
12801 TMPL_ARG (targs
, level
, idx
) = NULL_TREE
;
12804 /* Unify the pattern with the current argument. */
12806 tree arg
= TREE_VEC_ELT (packed_args
, i
);
12807 tree arg_expr
= NULL_TREE
;
12808 int arg_strict
= strict
;
12809 bool skip_arg_p
= false;
12815 /* This mirrors what we do in type_unification_real. */
12819 sub_strict
= (UNIFY_ALLOW_OUTER_LEVEL
12820 | UNIFY_ALLOW_MORE_CV_QUAL
12821 | UNIFY_ALLOW_DERIVED
);
12825 sub_strict
= UNIFY_ALLOW_LESS_CV_QUAL
;
12829 sub_strict
= UNIFY_ALLOW_NONE
;
12833 gcc_unreachable ();
12838 gcc_assert (TREE_TYPE (arg
) != NULL_TREE
);
12839 if (type_unknown_p (arg
))
12841 /* [temp.deduct.type] A template-argument can be
12842 deduced from a pointer to function or pointer
12843 to member function argument if the set of
12844 overloaded functions does not contain function
12845 templates and at most one of a set of
12846 overloaded functions provides a unique
12849 if (resolve_overloaded_unification
12850 (tparms
, targs
, parm
, arg
, strict
, sub_strict
)
12859 arg
= unlowered_expr_type (arg
);
12860 if (arg
== error_mark_node
)
12865 arg_strict
= sub_strict
;
12869 maybe_adjust_types_for_deduction (strict
, &parm
, &arg
,
12875 if (unify (tparms
, targs
, parm
, arg
, arg_strict
))
12880 /* For each parameter pack, collect the deduced value. */
12881 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
12884 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
12886 TREE_VEC_ELT (TREE_TYPE (pack
), i
- start
) =
12887 TMPL_ARG (targs
, level
, idx
);
12891 /* Verify that the results of unification with the parameter packs
12892 produce results consistent with what we've seen before, and make
12893 the deduced argument packs available. */
12894 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
12896 tree old_pack
= TREE_VALUE (pack
);
12897 tree new_args
= TREE_TYPE (pack
);
12898 int i
, len
= TREE_VEC_LENGTH (new_args
);
12899 bool nondeduced_p
= false;
12901 /* If NEW_ARGS contains any NULL_TREE entries, we didn't
12902 actually deduce anything. */
12903 for (i
= 0; i
< len
&& !nondeduced_p
; ++i
)
12904 if (TREE_VEC_ELT (new_args
, i
) == NULL_TREE
)
12905 nondeduced_p
= true;
12909 if (old_pack
&& ARGUMENT_PACK_INCOMPLETE_P (old_pack
))
12911 /* Prepend the explicit arguments onto NEW_ARGS. */
12912 tree explicit_args
= ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
);
12913 tree old_args
= new_args
;
12914 int i
, explicit_len
= TREE_VEC_LENGTH (explicit_args
);
12915 int len
= explicit_len
+ TREE_VEC_LENGTH (old_args
);
12917 /* Copy the explicit arguments. */
12918 new_args
= make_tree_vec (len
);
12919 for (i
= 0; i
< explicit_len
; i
++)
12920 TREE_VEC_ELT (new_args
, i
) = TREE_VEC_ELT (explicit_args
, i
);
12922 /* Copy the deduced arguments. */
12923 for (; i
< len
; i
++)
12924 TREE_VEC_ELT (new_args
, i
) =
12925 TREE_VEC_ELT (old_args
, i
- explicit_len
);
12933 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
12935 /* Build the deduced *_ARGUMENT_PACK. */
12936 if (TREE_CODE (TREE_PURPOSE (pack
)) == TEMPLATE_PARM_INDEX
)
12938 result
= make_node (NONTYPE_ARGUMENT_PACK
);
12939 TREE_TYPE (result
) =
12940 TREE_TYPE (TEMPLATE_PARM_DECL (TREE_PURPOSE (pack
)));
12941 TREE_CONSTANT (result
) = 1;
12944 result
= make_node (TYPE_ARGUMENT_PACK
);
12946 SET_ARGUMENT_PACK_ARGS (result
, new_args
);
12948 /* Note the deduced argument packs for this parameter
12950 TMPL_ARG (targs
, level
, idx
) = result
;
12952 else if (ARGUMENT_PACK_INCOMPLETE_P (old_pack
)
12953 && (ARGUMENT_PACK_ARGS (old_pack
)
12954 == ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
)))
12956 /* We only had the explicitly-provided arguments before, but
12957 now we have a complete set of arguments. */
12959 tree explicit_args
= ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
);
12960 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
12962 /* Keep the original deduced argument pack. */
12963 TMPL_ARG (targs
, level
, idx
) = old_pack
;
12965 SET_ARGUMENT_PACK_ARGS (old_pack
, new_args
);
12966 ARGUMENT_PACK_INCOMPLETE_P (old_pack
) = 1;
12967 ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
) = explicit_args
;
12969 else if (!comp_template_args (ARGUMENT_PACK_ARGS (old_pack
),
12971 /* Inconsistent unification of this parameter pack. */
12977 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
12979 /* Keep the original deduced argument pack. */
12980 TMPL_ARG (targs
, level
, idx
) = old_pack
;
12987 /* Deduce the value of template parameters. TPARMS is the (innermost)
12988 set of template parameters to a template. TARGS is the bindings
12989 for those template parameters, as determined thus far; TARGS may
12990 include template arguments for outer levels of template parameters
12991 as well. PARM is a parameter to a template function, or a
12992 subcomponent of that parameter; ARG is the corresponding argument.
12993 This function attempts to match PARM with ARG in a manner
12994 consistent with the existing assignments in TARGS. If more values
12995 are deduced, then TARGS is updated.
12997 Returns 0 if the type deduction succeeds, 1 otherwise. The
12998 parameter STRICT is a bitwise or of the following flags:
13001 Require an exact match between PARM and ARG.
13002 UNIFY_ALLOW_MORE_CV_QUAL:
13003 Allow the deduced ARG to be more cv-qualified (by qualification
13004 conversion) than ARG.
13005 UNIFY_ALLOW_LESS_CV_QUAL:
13006 Allow the deduced ARG to be less cv-qualified than ARG.
13007 UNIFY_ALLOW_DERIVED:
13008 Allow the deduced ARG to be a template base class of ARG,
13009 or a pointer to a template base class of the type pointed to by
13011 UNIFY_ALLOW_INTEGER:
13012 Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX
13013 case for more information.
13014 UNIFY_ALLOW_OUTER_LEVEL:
13015 This is the outermost level of a deduction. Used to determine validity
13016 of qualification conversions. A valid qualification conversion must
13017 have const qualified pointers leading up to the inner type which
13018 requires additional CV quals, except at the outer level, where const
13019 is not required [conv.qual]. It would be normal to set this flag in
13020 addition to setting UNIFY_ALLOW_MORE_CV_QUAL.
13021 UNIFY_ALLOW_OUTER_MORE_CV_QUAL:
13022 This is the outermost level of a deduction, and PARM can be more CV
13023 qualified at this point.
13024 UNIFY_ALLOW_OUTER_LESS_CV_QUAL:
13025 This is the outermost level of a deduction, and PARM can be less CV
13026 qualified at this point. */
13029 unify (tree tparms
, tree targs
, tree parm
, tree arg
, int strict
)
13034 int strict_in
= strict
;
13036 /* I don't think this will do the right thing with respect to types.
13037 But the only case I've seen it in so far has been array bounds, where
13038 signedness is the only information lost, and I think that will be
13040 while (TREE_CODE (parm
) == NOP_EXPR
)
13041 parm
= TREE_OPERAND (parm
, 0);
13043 if (arg
== error_mark_node
)
13045 if (arg
== unknown_type_node
13046 || arg
== init_list_type_node
)
13047 /* We can't deduce anything from this, but we might get all the
13048 template args from other function args. */
13051 /* If PARM uses template parameters, then we can't bail out here,
13052 even if ARG == PARM, since we won't record unifications for the
13053 template parameters. We might need them if we're trying to
13054 figure out which of two things is more specialized. */
13055 if (arg
== parm
&& !uses_template_parms (parm
))
13058 /* Handle init lists early, so the rest of the function can assume
13059 we're dealing with a type. */
13060 if (BRACE_ENCLOSED_INITIALIZER_P (arg
))
13065 if (!is_std_init_list (parm
))
13066 /* We can only deduce from an initializer list argument if the
13067 parameter is std::initializer_list; otherwise this is a
13068 non-deduced context. */
13071 elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (parm
), 0);
13073 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (arg
), i
, elt
)
13075 if (!BRACE_ENCLOSED_INITIALIZER_P (elt
))
13076 elt
= TREE_TYPE (elt
);
13077 if (unify (tparms
, targs
, elttype
, elt
, UNIFY_ALLOW_NONE
))
13083 /* Immediately reject some pairs that won't unify because of
13084 cv-qualification mismatches. */
13085 if (TREE_CODE (arg
) == TREE_CODE (parm
)
13087 /* It is the elements of the array which hold the cv quals of an array
13088 type, and the elements might be template type parms. We'll check
13089 when we recurse. */
13090 && TREE_CODE (arg
) != ARRAY_TYPE
13091 /* We check the cv-qualifiers when unifying with template type
13092 parameters below. We want to allow ARG `const T' to unify with
13093 PARM `T' for example, when computing which of two templates
13094 is more specialized, for example. */
13095 && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
13096 && !check_cv_quals_for_unify (strict_in
, arg
, parm
))
13099 if (!(strict
& UNIFY_ALLOW_OUTER_LEVEL
)
13100 && TYPE_P (parm
) && !CP_TYPE_CONST_P (parm
))
13101 strict
&= ~UNIFY_ALLOW_MORE_CV_QUAL
;
13102 strict
&= ~UNIFY_ALLOW_OUTER_LEVEL
;
13103 strict
&= ~UNIFY_ALLOW_DERIVED
;
13104 strict
&= ~UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
13105 strict
&= ~UNIFY_ALLOW_OUTER_LESS_CV_QUAL
;
13107 switch (TREE_CODE (parm
))
13109 case TYPENAME_TYPE
:
13111 case UNBOUND_CLASS_TEMPLATE
:
13112 /* In a type which contains a nested-name-specifier, template
13113 argument values cannot be deduced for template parameters used
13114 within the nested-name-specifier. */
13117 case TEMPLATE_TYPE_PARM
:
13118 case TEMPLATE_TEMPLATE_PARM
:
13119 case BOUND_TEMPLATE_TEMPLATE_PARM
:
13120 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
13121 if (tparm
== error_mark_node
)
13124 if (TEMPLATE_TYPE_LEVEL (parm
)
13125 != template_decl_level (tparm
))
13126 /* The PARM is not one we're trying to unify. Just check
13127 to see if it matches ARG. */
13128 return (TREE_CODE (arg
) == TREE_CODE (parm
)
13129 && same_type_p (parm
, arg
)) ? 0 : 1;
13130 idx
= TEMPLATE_TYPE_IDX (parm
);
13131 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
13132 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, idx
));
13134 /* Check for mixed types and values. */
13135 if ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
13136 && TREE_CODE (tparm
) != TYPE_DECL
)
13137 || (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
13138 && TREE_CODE (tparm
) != TEMPLATE_DECL
))
13141 if (TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
13143 /* ARG must be constructed from a template class or a template
13144 template parameter. */
13145 if (TREE_CODE (arg
) != BOUND_TEMPLATE_TEMPLATE_PARM
13146 && !CLASSTYPE_SPECIALIZATION_OF_PRIMARY_TEMPLATE_P (arg
))
13150 tree parmvec
= TYPE_TI_ARGS (parm
);
13151 tree argvec
= INNERMOST_TEMPLATE_ARGS (TYPE_TI_ARGS (arg
));
13153 = DECL_INNERMOST_TEMPLATE_PARMS
13154 (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (parm
));
13156 int parm_variadic_p
= 0;
13158 /* The resolution to DR150 makes clear that default
13159 arguments for an N-argument may not be used to bind T
13160 to a template template parameter with fewer than N
13161 parameters. It is not safe to permit the binding of
13162 default arguments as an extension, as that may change
13163 the meaning of a conforming program. Consider:
13165 struct Dense { static const unsigned int dim = 1; };
13167 template <template <typename> class View,
13169 void operator+(float, View<Block> const&);
13171 template <typename Block,
13172 unsigned int Dim = Block::dim>
13173 struct Lvalue_proxy { operator float() const; };
13177 Lvalue_proxy<Dense> p;
13182 Here, if Lvalue_proxy is permitted to bind to View, then
13183 the global operator+ will be used; if they are not, the
13184 Lvalue_proxy will be converted to float. */
13185 if (coerce_template_parms (parm_parms
,
13187 TYPE_TI_TEMPLATE (parm
),
13189 /*require_all_args=*/true,
13190 /*use_default_args=*/false)
13191 == error_mark_node
)
13194 /* Deduce arguments T, i from TT<T> or TT<i>.
13195 We check each element of PARMVEC and ARGVEC individually
13196 rather than the whole TREE_VEC since they can have
13197 different number of elements. */
13199 parmvec
= expand_template_argument_pack (parmvec
);
13200 argvec
= expand_template_argument_pack (argvec
);
13202 len
= TREE_VEC_LENGTH (parmvec
);
13204 /* Check if the parameters end in a pack, making them
13207 && PACK_EXPANSION_P (TREE_VEC_ELT (parmvec
, len
- 1)))
13208 parm_variadic_p
= 1;
13210 if (TREE_VEC_LENGTH (argvec
) < len
- parm_variadic_p
)
13213 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
13215 if (unify (tparms
, targs
,
13216 TREE_VEC_ELT (parmvec
, i
),
13217 TREE_VEC_ELT (argvec
, i
),
13222 if (parm_variadic_p
13223 && unify_pack_expansion (tparms
, targs
,
13226 /*call_args_p=*/false,
13230 arg
= TYPE_TI_TEMPLATE (arg
);
13232 /* Fall through to deduce template name. */
13235 if (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
13236 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
13238 /* Deduce template name TT from TT, TT<>, TT<T> and TT<i>. */
13240 /* Simple cases: Value already set, does match or doesn't. */
13241 if (targ
!= NULL_TREE
&& template_args_equal (targ
, arg
))
13248 /* If PARM is `const T' and ARG is only `int', we don't have
13249 a match unless we are allowing additional qualification.
13250 If ARG is `const int' and PARM is just `T' that's OK;
13251 that binds `const int' to `T'. */
13252 if (!check_cv_quals_for_unify (strict_in
| UNIFY_ALLOW_LESS_CV_QUAL
,
13256 /* Consider the case where ARG is `const volatile int' and
13257 PARM is `const T'. Then, T should be `volatile int'. */
13258 arg
= cp_build_qualified_type_real
13259 (arg
, cp_type_quals (arg
) & ~cp_type_quals (parm
), tf_none
);
13260 if (arg
== error_mark_node
)
13263 /* Simple cases: Value already set, does match or doesn't. */
13264 if (targ
!= NULL_TREE
&& same_type_p (targ
, arg
))
13269 /* Make sure that ARG is not a variable-sized array. (Note
13270 that were talking about variable-sized arrays (like
13271 `int[n]'), rather than arrays of unknown size (like
13272 `int[]').) We'll get very confused by such a type since
13273 the bound of the array will not be computable in an
13274 instantiation. Besides, such types are not allowed in
13275 ISO C++, so we can do as we please here. */
13276 if (variably_modified_type_p (arg
, NULL_TREE
))
13280 /* If ARG is a parameter pack or an expansion, we cannot unify
13281 against it unless PARM is also a parameter pack. */
13282 if ((template_parameter_pack_p (arg
) || PACK_EXPANSION_P (arg
))
13283 && !template_parameter_pack_p (parm
))
13286 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = arg
;
13289 case TEMPLATE_PARM_INDEX
:
13290 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
13291 if (tparm
== error_mark_node
)
13294 if (TEMPLATE_PARM_LEVEL (parm
)
13295 != template_decl_level (tparm
))
13296 /* The PARM is not one we're trying to unify. Just check
13297 to see if it matches ARG. */
13298 return !(TREE_CODE (arg
) == TREE_CODE (parm
)
13299 && cp_tree_equal (parm
, arg
));
13301 idx
= TEMPLATE_PARM_IDX (parm
);
13302 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
13305 return !cp_tree_equal (targ
, arg
);
13307 /* [temp.deduct.type] If, in the declaration of a function template
13308 with a non-type template-parameter, the non-type
13309 template-parameter is used in an expression in the function
13310 parameter-list and, if the corresponding template-argument is
13311 deduced, the template-argument type shall match the type of the
13312 template-parameter exactly, except that a template-argument
13313 deduced from an array bound may be of any integral type.
13314 The non-type parameter might use already deduced type parameters. */
13315 tparm
= tsubst (TREE_TYPE (parm
), targs
, 0, NULL_TREE
);
13316 if (!TREE_TYPE (arg
))
13317 /* Template-parameter dependent expression. Just accept it for now.
13318 It will later be processed in convert_template_argument. */
13320 else if (same_type_p (TREE_TYPE (arg
), tparm
))
13322 else if ((strict
& UNIFY_ALLOW_INTEGER
)
13323 && (TREE_CODE (tparm
) == INTEGER_TYPE
13324 || TREE_CODE (tparm
) == BOOLEAN_TYPE
))
13325 /* Convert the ARG to the type of PARM; the deduced non-type
13326 template argument must exactly match the types of the
13327 corresponding parameter. */
13328 arg
= fold (build_nop (TREE_TYPE (parm
), arg
));
13329 else if (uses_template_parms (tparm
))
13330 /* We haven't deduced the type of this parameter yet. Try again
13336 /* If ARG is a parameter pack or an expansion, we cannot unify
13337 against it unless PARM is also a parameter pack. */
13338 if ((template_parameter_pack_p (arg
) || PACK_EXPANSION_P (arg
))
13339 && !TEMPLATE_PARM_PARAMETER_PACK (parm
))
13342 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = arg
;
13347 /* A pointer-to-member constant can be unified only with
13348 another constant. */
13349 if (TREE_CODE (arg
) != PTRMEM_CST
)
13352 /* Just unify the class member. It would be useless (and possibly
13353 wrong, depending on the strict flags) to unify also
13354 PTRMEM_CST_CLASS, because we want to be sure that both parm and
13355 arg refer to the same variable, even if through different
13356 classes. For instance:
13358 struct A { int x; };
13361 Unification of &A::x and &B::x must succeed. */
13362 return unify (tparms
, targs
, PTRMEM_CST_MEMBER (parm
),
13363 PTRMEM_CST_MEMBER (arg
), strict
);
13368 if (TREE_CODE (arg
) != POINTER_TYPE
)
13371 /* [temp.deduct.call]
13373 A can be another pointer or pointer to member type that can
13374 be converted to the deduced A via a qualification
13375 conversion (_conv.qual_).
13377 We pass down STRICT here rather than UNIFY_ALLOW_NONE.
13378 This will allow for additional cv-qualification of the
13379 pointed-to types if appropriate. */
13381 if (TREE_CODE (TREE_TYPE (arg
)) == RECORD_TYPE
)
13382 /* The derived-to-base conversion only persists through one
13383 level of pointers. */
13384 strict
|= (strict_in
& UNIFY_ALLOW_DERIVED
);
13386 return unify (tparms
, targs
, TREE_TYPE (parm
),
13387 TREE_TYPE (arg
), strict
);
13390 case REFERENCE_TYPE
:
13391 if (TREE_CODE (arg
) != REFERENCE_TYPE
)
13393 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
13394 strict
& UNIFY_ALLOW_MORE_CV_QUAL
);
13397 if (TREE_CODE (arg
) != ARRAY_TYPE
)
13399 if ((TYPE_DOMAIN (parm
) == NULL_TREE
)
13400 != (TYPE_DOMAIN (arg
) == NULL_TREE
))
13402 if (TYPE_DOMAIN (parm
) != NULL_TREE
)
13409 /* Our representation of array types uses "N - 1" as the
13410 TYPE_MAX_VALUE for an array with "N" elements, if "N" is
13411 not an integer constant. We cannot unify arbitrarily
13412 complex expressions, so we eliminate the MINUS_EXPRs
13414 parm_max
= TYPE_MAX_VALUE (TYPE_DOMAIN (parm
));
13415 parm_cst
= TREE_CODE (parm_max
) == INTEGER_CST
;
13418 gcc_assert (TREE_CODE (parm_max
) == MINUS_EXPR
);
13419 parm_max
= TREE_OPERAND (parm_max
, 0);
13421 arg_max
= TYPE_MAX_VALUE (TYPE_DOMAIN (arg
));
13422 arg_cst
= TREE_CODE (arg_max
) == INTEGER_CST
;
13425 /* The ARG_MAX may not be a simple MINUS_EXPR, if we are
13426 trying to unify the type of a variable with the type
13427 of a template parameter. For example:
13429 template <unsigned int N>
13430 void f (char (&) [N]);
13437 Here, the type of the ARG will be "int [g(i)]", and
13438 may be a SAVE_EXPR, etc. */
13439 if (TREE_CODE (arg_max
) != MINUS_EXPR
)
13441 arg_max
= TREE_OPERAND (arg_max
, 0);
13444 /* If only one of the bounds used a MINUS_EXPR, compensate
13445 by adding one to the other bound. */
13446 if (parm_cst
&& !arg_cst
)
13447 parm_max
= fold_build2 (PLUS_EXPR
,
13451 else if (arg_cst
&& !parm_cst
)
13452 arg_max
= fold_build2 (PLUS_EXPR
,
13457 if (unify (tparms
, targs
, parm_max
, arg_max
, UNIFY_ALLOW_INTEGER
))
13460 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
13461 strict
& UNIFY_ALLOW_MORE_CV_QUAL
);
13468 case ENUMERAL_TYPE
:
13470 if (TREE_CODE (arg
) != TREE_CODE (parm
))
13473 /* We have already checked cv-qualification at the top of the
13475 if (!same_type_ignoring_top_level_qualifiers_p (arg
, parm
))
13478 /* As far as unification is concerned, this wins. Later checks
13479 will invalidate it if necessary. */
13482 /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */
13483 /* Type INTEGER_CST can come from ordinary constant template args. */
13485 while (TREE_CODE (arg
) == NOP_EXPR
)
13486 arg
= TREE_OPERAND (arg
, 0);
13488 if (TREE_CODE (arg
) != INTEGER_CST
)
13490 return !tree_int_cst_equal (parm
, arg
);
13495 if (TREE_CODE (arg
) != TREE_VEC
)
13497 if (TREE_VEC_LENGTH (parm
) != TREE_VEC_LENGTH (arg
))
13499 for (i
= 0; i
< TREE_VEC_LENGTH (parm
); ++i
)
13500 if (unify (tparms
, targs
,
13501 TREE_VEC_ELT (parm
, i
), TREE_VEC_ELT (arg
, i
),
13509 if (TREE_CODE (arg
) != TREE_CODE (parm
))
13512 if (TYPE_PTRMEMFUNC_P (parm
))
13514 if (!TYPE_PTRMEMFUNC_P (arg
))
13517 return unify (tparms
, targs
,
13518 TYPE_PTRMEMFUNC_FN_TYPE (parm
),
13519 TYPE_PTRMEMFUNC_FN_TYPE (arg
),
13523 if (CLASSTYPE_TEMPLATE_INFO (parm
))
13525 tree t
= NULL_TREE
;
13527 if (strict_in
& UNIFY_ALLOW_DERIVED
)
13529 /* First, we try to unify the PARM and ARG directly. */
13530 t
= try_class_unification (tparms
, targs
,
13535 /* Fallback to the special case allowed in
13536 [temp.deduct.call]:
13538 If P is a class, and P has the form
13539 template-id, then A can be a derived class of
13540 the deduced A. Likewise, if P is a pointer to
13541 a class of the form template-id, A can be a
13542 pointer to a derived class pointed to by the
13544 t
= get_template_base (tparms
, targs
, parm
, arg
);
13550 else if (CLASSTYPE_TEMPLATE_INFO (arg
)
13551 && (CLASSTYPE_TI_TEMPLATE (parm
)
13552 == CLASSTYPE_TI_TEMPLATE (arg
)))
13553 /* Perhaps PARM is something like S<U> and ARG is S<int>.
13554 Then, we should unify `int' and `U'. */
13557 /* There's no chance of unification succeeding. */
13560 return unify (tparms
, targs
, CLASSTYPE_TI_ARGS (parm
),
13561 CLASSTYPE_TI_ARGS (t
), UNIFY_ALLOW_NONE
);
13563 else if (!same_type_ignoring_top_level_qualifiers_p (parm
, arg
))
13568 case FUNCTION_TYPE
:
13569 if (TREE_CODE (arg
) != TREE_CODE (parm
))
13572 /* CV qualifications for methods can never be deduced, they must
13573 match exactly. We need to check them explicitly here,
13574 because type_unification_real treats them as any other
13575 cv-qualified parameter. */
13576 if (TREE_CODE (parm
) == METHOD_TYPE
13577 && (!check_cv_quals_for_unify
13579 TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (arg
))),
13580 TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (parm
))))))
13583 if (unify (tparms
, targs
, TREE_TYPE (parm
),
13584 TREE_TYPE (arg
), UNIFY_ALLOW_NONE
))
13586 return type_unification_real (tparms
, targs
, TYPE_ARG_TYPES (parm
),
13587 TYPE_ARG_TYPES (arg
), 1, DEDUCE_EXACT
,
13591 /* Unify a pointer to member with a pointer to member function, which
13592 deduces the type of the member as a function type. */
13593 if (TYPE_PTRMEMFUNC_P (arg
))
13597 cp_cv_quals cv_quals
;
13599 /* Check top-level cv qualifiers */
13600 if (!check_cv_quals_for_unify (UNIFY_ALLOW_NONE
, arg
, parm
))
13603 if (unify (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
13604 TYPE_PTRMEMFUNC_OBJECT_TYPE (arg
), UNIFY_ALLOW_NONE
))
13607 /* Determine the type of the function we are unifying against. */
13608 method_type
= TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (arg
));
13610 build_function_type (TREE_TYPE (method_type
),
13611 TREE_CHAIN (TYPE_ARG_TYPES (method_type
)));
13613 /* Extract the cv-qualifiers of the member function from the
13614 implicit object parameter and place them on the function
13615 type to be restored later. */
13617 cp_type_quals(TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (method_type
))));
13618 fntype
= build_qualified_type (fntype
, cv_quals
);
13619 return unify (tparms
, targs
, TREE_TYPE (parm
), fntype
, strict
);
13622 if (TREE_CODE (arg
) != OFFSET_TYPE
)
13624 if (unify (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
13625 TYPE_OFFSET_BASETYPE (arg
), UNIFY_ALLOW_NONE
))
13627 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
13631 if (DECL_TEMPLATE_PARM_P (parm
))
13632 return unify (tparms
, targs
, DECL_INITIAL (parm
), arg
, strict
);
13633 if (arg
!= integral_constant_value (parm
))
13638 case TEMPLATE_DECL
:
13639 /* Matched cases are handled by the ARG == PARM test above. */
13642 case TYPE_ARGUMENT_PACK
:
13643 case NONTYPE_ARGUMENT_PACK
:
13645 tree packed_parms
= ARGUMENT_PACK_ARGS (parm
);
13646 tree packed_args
= ARGUMENT_PACK_ARGS (arg
);
13647 int i
, len
= TREE_VEC_LENGTH (packed_parms
);
13648 int argslen
= TREE_VEC_LENGTH (packed_args
);
13649 int parm_variadic_p
= 0;
13651 for (i
= 0; i
< len
; ++i
)
13653 if (PACK_EXPANSION_P (TREE_VEC_ELT (packed_parms
, i
)))
13656 /* We can unify against something with a trailing
13658 parm_variadic_p
= 1;
13660 /* Since there is something following the pack
13661 expansion, we cannot unify this template argument
13668 /* If we don't have enough arguments to satisfy the parameters
13669 (not counting the pack expression at the end), or we have
13670 too many arguments for a parameter list that doesn't end in
13671 a pack expression, we can't unify. */
13672 if (argslen
< (len
- parm_variadic_p
)
13673 || (argslen
> len
&& !parm_variadic_p
))
13676 /* Unify all of the parameters that precede the (optional)
13677 pack expression. */
13678 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
13680 if (unify (tparms
, targs
, TREE_VEC_ELT (packed_parms
, i
),
13681 TREE_VEC_ELT (packed_args
, i
), strict
))
13685 if (parm_variadic_p
)
13686 return unify_pack_expansion (tparms
, targs
,
13687 packed_parms
, packed_args
,
13688 strict
, /*call_args_p=*/false,
13696 case DECLTYPE_TYPE
:
13697 /* Cannot deduce anything from TYPEOF_TYPE or DECLTYPE_TYPE
13702 /* Unification fails if we hit an error node. */
13706 gcc_assert (EXPR_P (parm
));
13708 /* We must be looking at an expression. This can happen with
13712 void foo(S<I>, S<I + 2>);
13714 This is a "nondeduced context":
13718 The nondeduced contexts are:
13720 --A type that is a template-id in which one or more of
13721 the template-arguments is an expression that references
13722 a template-parameter.
13724 In these cases, we assume deduction succeeded, but don't
13725 actually infer any unifications. */
13727 if (!uses_template_parms (parm
)
13728 && !template_args_equal (parm
, arg
))
13735 /* Note that DECL can be defined in this translation unit, if
13739 mark_definable (tree decl
)
13742 DECL_NOT_REALLY_EXTERN (decl
) = 1;
13743 FOR_EACH_CLONE (clone
, decl
)
13744 DECL_NOT_REALLY_EXTERN (clone
) = 1;
13747 /* Called if RESULT is explicitly instantiated, or is a member of an
13748 explicitly instantiated class. */
13751 mark_decl_instantiated (tree result
, int extern_p
)
13753 SET_DECL_EXPLICIT_INSTANTIATION (result
);
13755 /* If this entity has already been written out, it's too late to
13756 make any modifications. */
13757 if (TREE_ASM_WRITTEN (result
))
13760 if (TREE_CODE (result
) != FUNCTION_DECL
)
13761 /* The TREE_PUBLIC flag for function declarations will have been
13762 set correctly by tsubst. */
13763 TREE_PUBLIC (result
) = 1;
13765 /* This might have been set by an earlier implicit instantiation. */
13766 DECL_COMDAT (result
) = 0;
13769 DECL_NOT_REALLY_EXTERN (result
) = 0;
13772 mark_definable (result
);
13773 /* Always make artificials weak. */
13774 if (DECL_ARTIFICIAL (result
) && flag_weak
)
13775 comdat_linkage (result
);
13776 /* For WIN32 we also want to put explicit instantiations in
13777 linkonce sections. */
13778 else if (TREE_PUBLIC (result
))
13779 maybe_make_one_only (result
);
13782 /* If EXTERN_P, then this function will not be emitted -- unless
13783 followed by an explicit instantiation, at which point its linkage
13784 will be adjusted. If !EXTERN_P, then this function will be
13785 emitted here. In neither circumstance do we want
13786 import_export_decl to adjust the linkage. */
13787 DECL_INTERFACE_KNOWN (result
) = 1;
13790 /* Given two function templates PAT1 and PAT2, return:
13792 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order].
13793 -1 if PAT2 is more specialized than PAT1.
13794 0 if neither is more specialized.
13796 LEN indicates the number of parameters we should consider
13797 (defaulted parameters should not be considered).
13799 The 1998 std underspecified function template partial ordering, and
13800 DR214 addresses the issue. We take pairs of arguments, one from
13801 each of the templates, and deduce them against each other. One of
13802 the templates will be more specialized if all the *other*
13803 template's arguments deduce against its arguments and at least one
13804 of its arguments *does* *not* deduce against the other template's
13805 corresponding argument. Deduction is done as for class templates.
13806 The arguments used in deduction have reference and top level cv
13807 qualifiers removed. Iff both arguments were originally reference
13808 types *and* deduction succeeds in both directions, the template
13809 with the more cv-qualified argument wins for that pairing (if
13810 neither is more cv-qualified, they both are equal). Unlike regular
13811 deduction, after all the arguments have been deduced in this way,
13812 we do *not* verify the deduced template argument values can be
13813 substituted into non-deduced contexts, nor do we have to verify
13814 that all template arguments have been deduced. */
13817 more_specialized_fn (tree pat1
, tree pat2
, int len
)
13819 tree decl1
= DECL_TEMPLATE_RESULT (pat1
);
13820 tree decl2
= DECL_TEMPLATE_RESULT (pat2
);
13821 tree targs1
= make_tree_vec (DECL_NTPARMS (pat1
));
13822 tree targs2
= make_tree_vec (DECL_NTPARMS (pat2
));
13823 tree tparms1
= DECL_INNERMOST_TEMPLATE_PARMS (pat1
);
13824 tree tparms2
= DECL_INNERMOST_TEMPLATE_PARMS (pat2
);
13825 tree args1
= TYPE_ARG_TYPES (TREE_TYPE (decl1
));
13826 tree args2
= TYPE_ARG_TYPES (TREE_TYPE (decl2
));
13830 /* Remove the this parameter from non-static member functions. If
13831 one is a non-static member function and the other is not a static
13832 member function, remove the first parameter from that function
13833 also. This situation occurs for operator functions where we
13834 locate both a member function (with this pointer) and non-member
13835 operator (with explicit first operand). */
13836 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl1
))
13838 len
--; /* LEN is the number of significant arguments for DECL1 */
13839 args1
= TREE_CHAIN (args1
);
13840 if (!DECL_STATIC_FUNCTION_P (decl2
))
13841 args2
= TREE_CHAIN (args2
);
13843 else if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl2
))
13845 args2
= TREE_CHAIN (args2
);
13846 if (!DECL_STATIC_FUNCTION_P (decl1
))
13849 args1
= TREE_CHAIN (args1
);
13853 /* If only one is a conversion operator, they are unordered. */
13854 if (DECL_CONV_FN_P (decl1
) != DECL_CONV_FN_P (decl2
))
13857 /* Consider the return type for a conversion function */
13858 if (DECL_CONV_FN_P (decl1
))
13860 args1
= tree_cons (NULL_TREE
, TREE_TYPE (TREE_TYPE (decl1
)), args1
);
13861 args2
= tree_cons (NULL_TREE
, TREE_TYPE (TREE_TYPE (decl2
)), args2
);
13865 processing_template_decl
++;
13868 /* Stop when an ellipsis is seen. */
13869 && args1
!= NULL_TREE
&& args2
!= NULL_TREE
)
13871 tree arg1
= TREE_VALUE (args1
);
13872 tree arg2
= TREE_VALUE (args2
);
13873 int deduce1
, deduce2
;
13877 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
13878 && TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
13880 /* When both arguments are pack expansions, we need only
13881 unify the patterns themselves. */
13882 arg1
= PACK_EXPANSION_PATTERN (arg1
);
13883 arg2
= PACK_EXPANSION_PATTERN (arg2
);
13885 /* This is the last comparison we need to do. */
13889 if (TREE_CODE (arg1
) == REFERENCE_TYPE
)
13891 arg1
= TREE_TYPE (arg1
);
13892 quals1
= cp_type_quals (arg1
);
13895 if (TREE_CODE (arg2
) == REFERENCE_TYPE
)
13897 arg2
= TREE_TYPE (arg2
);
13898 quals2
= cp_type_quals (arg2
);
13901 if ((quals1
< 0) != (quals2
< 0))
13903 /* Only of the args is a reference, see if we should apply
13904 array/function pointer decay to it. This is not part of
13905 DR214, but is, IMHO, consistent with the deduction rules
13906 for the function call itself, and with our earlier
13907 implementation of the underspecified partial ordering
13908 rules. (nathan). */
13911 switch (TREE_CODE (arg1
))
13914 arg1
= TREE_TYPE (arg1
);
13916 case FUNCTION_TYPE
:
13917 arg1
= build_pointer_type (arg1
);
13926 switch (TREE_CODE (arg2
))
13929 arg2
= TREE_TYPE (arg2
);
13931 case FUNCTION_TYPE
:
13932 arg2
= build_pointer_type (arg2
);
13941 arg1
= TYPE_MAIN_VARIANT (arg1
);
13942 arg2
= TYPE_MAIN_VARIANT (arg2
);
13944 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
)
13946 int i
, len2
= list_length (args2
);
13947 tree parmvec
= make_tree_vec (1);
13948 tree argvec
= make_tree_vec (len2
);
13951 /* Setup the parameter vector, which contains only ARG1. */
13952 TREE_VEC_ELT (parmvec
, 0) = arg1
;
13954 /* Setup the argument vector, which contains the remaining
13956 for (i
= 0; i
< len2
; i
++, ta
= TREE_CHAIN (ta
))
13957 TREE_VEC_ELT (argvec
, i
) = TREE_VALUE (ta
);
13959 deduce1
= !unify_pack_expansion (tparms1
, targs1
, parmvec
,
13960 argvec
, UNIFY_ALLOW_NONE
,
13961 /*call_args_p=*/false,
13964 /* We cannot deduce in the other direction, because ARG1 is
13965 a pack expansion but ARG2 is not. */
13968 else if (TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
13970 int i
, len1
= list_length (args1
);
13971 tree parmvec
= make_tree_vec (1);
13972 tree argvec
= make_tree_vec (len1
);
13975 /* Setup the parameter vector, which contains only ARG1. */
13976 TREE_VEC_ELT (parmvec
, 0) = arg2
;
13978 /* Setup the argument vector, which contains the remaining
13980 for (i
= 0; i
< len1
; i
++, ta
= TREE_CHAIN (ta
))
13981 TREE_VEC_ELT (argvec
, i
) = TREE_VALUE (ta
);
13983 deduce2
= !unify_pack_expansion (tparms2
, targs2
, parmvec
,
13984 argvec
, UNIFY_ALLOW_NONE
,
13985 /*call_args_p=*/false,
13988 /* We cannot deduce in the other direction, because ARG2 is
13989 a pack expansion but ARG1 is not.*/
13995 /* The normal case, where neither argument is a pack
13997 deduce1
= !unify (tparms1
, targs1
, arg1
, arg2
, UNIFY_ALLOW_NONE
);
13998 deduce2
= !unify (tparms2
, targs2
, arg2
, arg1
, UNIFY_ALLOW_NONE
);
14005 if (better1
< 0 && better2
< 0)
14006 /* We've failed to deduce something in either direction.
14007 These must be unordered. */
14010 if (deduce1
&& deduce2
&& quals1
>= 0 && quals2
>= 0)
14012 /* Deduces in both directions, see if quals can
14013 disambiguate. Pretend the worse one failed to deduce. */
14014 if ((quals1
& quals2
) == quals2
)
14016 if ((quals1
& quals2
) == quals1
)
14019 if (deduce1
&& !deduce2
&& !better2
)
14021 if (deduce2
&& !deduce1
&& !better1
)
14024 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
14025 || TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
14026 /* We have already processed all of the arguments in our
14027 handing of the pack expansion type. */
14030 args1
= TREE_CHAIN (args1
);
14031 args2
= TREE_CHAIN (args2
);
14034 processing_template_decl
--;
14036 /* All things being equal, if the next argument is a pack expansion
14037 for one function but not for the other, prefer the
14038 non-variadic function. */
14039 if ((better1
> 0) - (better2
> 0) == 0
14040 && args1
&& TREE_VALUE (args1
)
14041 && args2
&& TREE_VALUE (args2
))
14043 if (TREE_CODE (TREE_VALUE (args1
)) == TYPE_PACK_EXPANSION
)
14044 return TREE_CODE (TREE_VALUE (args2
)) == TYPE_PACK_EXPANSION
? 0 : -1;
14045 else if (TREE_CODE (TREE_VALUE (args2
)) == TYPE_PACK_EXPANSION
)
14049 return (better1
> 0) - (better2
> 0);
14052 /* Determine which of two partial specializations is more specialized.
14054 PAT1 is a TREE_LIST whose TREE_TYPE is the _TYPE node corresponding
14055 to the first partial specialization. The TREE_VALUE is the
14056 innermost set of template parameters for the partial
14057 specialization. PAT2 is similar, but for the second template.
14059 Return 1 if the first partial specialization is more specialized;
14060 -1 if the second is more specialized; 0 if neither is more
14063 See [temp.class.order] for information about determining which of
14064 two templates is more specialized. */
14067 more_specialized_class (tree pat1
, tree pat2
)
14072 bool any_deductions
= false;
14074 tmpl1
= TREE_TYPE (pat1
);
14075 tmpl2
= TREE_TYPE (pat2
);
14077 /* Just like what happens for functions, if we are ordering between
14078 different class template specializations, we may encounter dependent
14079 types in the arguments, and we need our dependency check functions
14080 to behave correctly. */
14081 ++processing_template_decl
;
14082 targs
= get_class_bindings (TREE_VALUE (pat1
),
14083 CLASSTYPE_TI_ARGS (tmpl1
),
14084 CLASSTYPE_TI_ARGS (tmpl2
));
14088 any_deductions
= true;
14091 targs
= get_class_bindings (TREE_VALUE (pat2
),
14092 CLASSTYPE_TI_ARGS (tmpl2
),
14093 CLASSTYPE_TI_ARGS (tmpl1
));
14097 any_deductions
= true;
14099 --processing_template_decl
;
14101 /* In the case of a tie where at least one of the class templates
14102 has a parameter pack at the end, the template with the most
14103 non-packed parameters wins. */
14106 && (template_args_variadic_p (TREE_PURPOSE (pat1
))
14107 || template_args_variadic_p (TREE_PURPOSE (pat2
))))
14109 tree args1
= INNERMOST_TEMPLATE_ARGS (TREE_PURPOSE (pat1
));
14110 tree args2
= INNERMOST_TEMPLATE_ARGS (TREE_PURPOSE (pat2
));
14111 int len1
= TREE_VEC_LENGTH (args1
);
14112 int len2
= TREE_VEC_LENGTH (args2
);
14114 /* We don't count the pack expansion at the end. */
14115 if (template_args_variadic_p (TREE_PURPOSE (pat1
)))
14117 if (template_args_variadic_p (TREE_PURPOSE (pat2
)))
14122 else if (len1
< len2
)
14129 /* Return the template arguments that will produce the function signature
14130 DECL from the function template FN, with the explicit template
14131 arguments EXPLICIT_ARGS. If CHECK_RETTYPE is true, the return type must
14132 also match. Return NULL_TREE if no satisfactory arguments could be
14136 get_bindings (tree fn
, tree decl
, tree explicit_args
, bool check_rettype
)
14138 int ntparms
= DECL_NTPARMS (fn
);
14139 tree targs
= make_tree_vec (ntparms
);
14141 tree decl_arg_types
;
14143 /* Substitute the explicit template arguments into the type of DECL.
14144 The call to fn_type_unification will handle substitution into the
14146 decl_type
= TREE_TYPE (decl
);
14147 if (explicit_args
&& uses_template_parms (decl_type
))
14150 tree converted_args
;
14152 if (DECL_TEMPLATE_INFO (decl
))
14153 tmpl
= DECL_TI_TEMPLATE (decl
);
14155 /* We can get here for some invalid specializations. */
14159 = coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
14160 explicit_args
, NULL_TREE
,
14162 /*require_all_args=*/false,
14163 /*use_default_args=*/false);
14164 if (converted_args
== error_mark_node
)
14167 decl_type
= tsubst (decl_type
, converted_args
, tf_none
, NULL_TREE
);
14168 if (decl_type
== error_mark_node
)
14172 /* Never do unification on the 'this' parameter. */
14173 decl_arg_types
= skip_artificial_parms_for (decl
,
14174 TYPE_ARG_TYPES (decl_type
));
14176 if (fn_type_unification (fn
, explicit_args
, targs
,
14178 (check_rettype
|| DECL_CONV_FN_P (fn
)
14179 ? TREE_TYPE (decl_type
) : NULL_TREE
),
14180 DEDUCE_EXACT
, LOOKUP_NORMAL
))
14186 /* Return the innermost template arguments that, when applied to a
14187 template specialization whose innermost template parameters are
14188 TPARMS, and whose specialization arguments are PARMS, yield the
14191 For example, suppose we have:
14193 template <class T, class U> struct S {};
14194 template <class T> struct S<T*, int> {};
14196 Then, suppose we want to get `S<double*, int>'. The TPARMS will be
14197 {T}, the SPEC_ARGS will be {T*, int} and the ARGS will be {double*,
14198 int}. The resulting vector will be {double}, indicating that `T'
14199 is bound to `double'. */
14202 get_class_bindings (tree tparms
, tree spec_args
, tree args
)
14204 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
14206 tree innermost_deduced_args
;
14208 innermost_deduced_args
= make_tree_vec (ntparms
);
14209 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
14211 deduced_args
= copy_node (args
);
14212 SET_TMPL_ARGS_LEVEL (deduced_args
,
14213 TMPL_ARGS_DEPTH (deduced_args
),
14214 innermost_deduced_args
);
14217 deduced_args
= innermost_deduced_args
;
14219 if (unify (tparms
, deduced_args
,
14220 INNERMOST_TEMPLATE_ARGS (spec_args
),
14221 INNERMOST_TEMPLATE_ARGS (args
),
14225 for (i
= 0; i
< ntparms
; ++i
)
14226 if (! TREE_VEC_ELT (innermost_deduced_args
, i
))
14229 /* Verify that nondeduced template arguments agree with the type
14230 obtained from argument deduction.
14234 struct A { typedef int X; };
14235 template <class T, class U> struct C {};
14236 template <class T> struct C<T, typename T::X> {};
14238 Then with the instantiation `C<A, int>', we can deduce that
14239 `T' is `A' but unify () does not check whether `typename T::X'
14241 spec_args
= tsubst (spec_args
, deduced_args
, tf_none
, NULL_TREE
);
14242 if (spec_args
== error_mark_node
14243 /* We only need to check the innermost arguments; the other
14244 arguments will always agree. */
14245 || !comp_template_args (INNERMOST_TEMPLATE_ARGS (spec_args
),
14246 INNERMOST_TEMPLATE_ARGS (args
)))
14249 /* Now that we have bindings for all of the template arguments,
14250 ensure that the arguments deduced for the template template
14251 parameters have compatible template parameter lists. See the use
14252 of template_template_parm_bindings_ok_p in fn_type_unification
14253 for more information. */
14254 if (!template_template_parm_bindings_ok_p (tparms
, deduced_args
))
14257 return deduced_args
;
14260 /* TEMPLATES is a TREE_LIST. Each TREE_VALUE is a TEMPLATE_DECL.
14261 Return the TREE_LIST node with the most specialized template, if
14262 any. If there is no most specialized template, the error_mark_node
14265 Note that this function does not look at, or modify, the
14266 TREE_PURPOSE or TREE_TYPE of any of the nodes. Since the node
14267 returned is one of the elements of INSTANTIATIONS, callers may
14268 store information in the TREE_PURPOSE or TREE_TYPE of the nodes,
14269 and retrieve it from the value returned. */
14272 most_specialized_instantiation (tree templates
)
14276 ++processing_template_decl
;
14279 for (fn
= TREE_CHAIN (templates
); fn
; fn
= TREE_CHAIN (fn
))
14283 if (get_bindings (TREE_VALUE (champ
),
14284 DECL_TEMPLATE_RESULT (TREE_VALUE (fn
)),
14285 NULL_TREE
, /*check_ret=*/false))
14288 if (get_bindings (TREE_VALUE (fn
),
14289 DECL_TEMPLATE_RESULT (TREE_VALUE (champ
)),
14290 NULL_TREE
, /*check_ret=*/false))
14297 /* Equally specialized, move to next function. If there
14298 is no next function, nothing's most specialized. */
14299 fn
= TREE_CHAIN (fn
);
14307 /* Now verify that champ is better than everything earlier in the
14308 instantiation list. */
14309 for (fn
= templates
; fn
!= champ
; fn
= TREE_CHAIN (fn
))
14310 if (get_bindings (TREE_VALUE (champ
),
14311 DECL_TEMPLATE_RESULT (TREE_VALUE (fn
)),
14312 NULL_TREE
, /*check_ret=*/false)
14313 || !get_bindings (TREE_VALUE (fn
),
14314 DECL_TEMPLATE_RESULT (TREE_VALUE (champ
)),
14315 NULL_TREE
, /*check_ret=*/false))
14321 processing_template_decl
--;
14324 return error_mark_node
;
14329 /* If DECL is a specialization of some template, return the most
14330 general such template. Otherwise, returns NULL_TREE.
14332 For example, given:
14334 template <class T> struct S { template <class U> void f(U); };
14336 if TMPL is `template <class U> void S<int>::f(U)' this will return
14337 the full template. This function will not trace past partial
14338 specializations, however. For example, given in addition:
14340 template <class T> struct S<T*> { template <class U> void f(U); };
14342 if TMPL is `template <class U> void S<int*>::f(U)' this will return
14343 `template <class T> template <class U> S<T*>::f(U)'. */
14346 most_general_template (tree decl
)
14348 /* If DECL is a FUNCTION_DECL, find the TEMPLATE_DECL of which it is
14349 an immediate specialization. */
14350 if (TREE_CODE (decl
) == FUNCTION_DECL
)
14352 if (DECL_TEMPLATE_INFO (decl
)) {
14353 decl
= DECL_TI_TEMPLATE (decl
);
14355 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE for a
14356 template friend. */
14357 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
14363 /* Look for more and more general templates. */
14364 while (DECL_TEMPLATE_INFO (decl
))
14366 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE in some cases.
14367 (See cp-tree.h for details.) */
14368 if (TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
14371 if (CLASS_TYPE_P (TREE_TYPE (decl
))
14372 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)))
14375 /* Stop if we run into an explicitly specialized class template. */
14376 if (!DECL_NAMESPACE_SCOPE_P (decl
)
14377 && DECL_CONTEXT (decl
)
14378 && CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (decl
)))
14381 decl
= DECL_TI_TEMPLATE (decl
);
14387 /* Return the most specialized of the class template partial
14388 specializations of TMPL which can produce TYPE, a specialization of
14389 TMPL. The value returned is actually a TREE_LIST; the TREE_TYPE is
14390 a _TYPE node corresponding to the partial specialization, while the
14391 TREE_PURPOSE is the set of template arguments that must be
14392 substituted into the TREE_TYPE in order to generate TYPE.
14394 If the choice of partial specialization is ambiguous, a diagnostic
14395 is issued, and the error_mark_node is returned. If there are no
14396 partial specializations of TMPL matching TYPE, then NULL_TREE is
14400 most_specialized_class (tree type
, tree tmpl
)
14402 tree list
= NULL_TREE
;
14408 tree outer_args
= NULL_TREE
;
14410 tmpl
= most_general_template (tmpl
);
14411 args
= CLASSTYPE_TI_ARGS (type
);
14413 /* For determining which partial specialization to use, only the
14414 innermost args are interesting. */
14415 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
14417 outer_args
= strip_innermost_template_args (args
, 1);
14418 args
= INNERMOST_TEMPLATE_ARGS (args
);
14421 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
); t
; t
= TREE_CHAIN (t
))
14423 tree partial_spec_args
;
14425 tree parms
= TREE_VALUE (t
);
14427 partial_spec_args
= CLASSTYPE_TI_ARGS (TREE_TYPE (t
));
14432 ++processing_template_decl
;
14434 /* Discard the outer levels of args, and then substitute in the
14435 template args from the enclosing class. */
14436 partial_spec_args
= INNERMOST_TEMPLATE_ARGS (partial_spec_args
);
14437 partial_spec_args
= tsubst_template_args
14438 (partial_spec_args
, outer_args
, tf_none
, NULL_TREE
);
14440 /* PARMS already refers to just the innermost parms, but the
14441 template parms in partial_spec_args had their levels lowered
14442 by tsubst, so we need to do the same for the parm list. We
14443 can't just tsubst the TREE_VEC itself, as tsubst wants to
14444 treat a TREE_VEC as an argument vector. */
14445 parms
= copy_node (parms
);
14446 for (i
= TREE_VEC_LENGTH (parms
) - 1; i
>= 0; --i
)
14447 TREE_VEC_ELT (parms
, i
) =
14448 tsubst (TREE_VEC_ELT (parms
, i
), outer_args
, tf_none
, NULL_TREE
);
14450 --processing_template_decl
;
14452 spec_args
= get_class_bindings (parms
,
14458 spec_args
= add_to_template_args (outer_args
, spec_args
);
14459 list
= tree_cons (spec_args
, TREE_VALUE (t
), list
);
14460 TREE_TYPE (list
) = TREE_TYPE (t
);
14467 ambiguous_p
= false;
14470 t
= TREE_CHAIN (t
);
14471 for (; t
; t
= TREE_CHAIN (t
))
14473 fate
= more_specialized_class (champ
, t
);
14480 t
= TREE_CHAIN (t
);
14483 ambiguous_p
= true;
14492 for (t
= list
; t
&& t
!= champ
; t
= TREE_CHAIN (t
))
14494 fate
= more_specialized_class (champ
, t
);
14497 ambiguous_p
= true;
14504 const char *str
= "candidates are:";
14505 error ("ambiguous class template instantiation for %q#T", type
);
14506 for (t
= list
; t
; t
= TREE_CHAIN (t
))
14508 error ("%s %+#T", str
, TREE_TYPE (t
));
14511 return error_mark_node
;
14517 /* Explicitly instantiate DECL. */
14520 do_decl_instantiation (tree decl
, tree storage
)
14522 tree result
= NULL_TREE
;
14525 if (!decl
|| decl
== error_mark_node
)
14526 /* An error occurred, for which grokdeclarator has already issued
14527 an appropriate message. */
14529 else if (! DECL_LANG_SPECIFIC (decl
))
14531 error ("explicit instantiation of non-template %q#D", decl
);
14534 else if (TREE_CODE (decl
) == VAR_DECL
)
14536 /* There is an asymmetry here in the way VAR_DECLs and
14537 FUNCTION_DECLs are handled by grokdeclarator. In the case of
14538 the latter, the DECL we get back will be marked as a
14539 template instantiation, and the appropriate
14540 DECL_TEMPLATE_INFO will be set up. This does not happen for
14541 VAR_DECLs so we do the lookup here. Probably, grokdeclarator
14542 should handle VAR_DECLs as it currently handles
14544 if (!DECL_CLASS_SCOPE_P (decl
))
14546 error ("%qD is not a static data member of a class template", decl
);
14549 result
= lookup_field (DECL_CONTEXT (decl
), DECL_NAME (decl
), 0, false);
14550 if (!result
|| TREE_CODE (result
) != VAR_DECL
)
14552 error ("no matching template for %qD found", decl
);
14555 if (!same_type_p (TREE_TYPE (result
), TREE_TYPE (decl
)))
14557 error ("type %qT for explicit instantiation %qD does not match "
14558 "declared type %qT", TREE_TYPE (result
), decl
,
14563 else if (TREE_CODE (decl
) != FUNCTION_DECL
)
14565 error ("explicit instantiation of %q#D", decl
);
14571 /* Check for various error cases. Note that if the explicit
14572 instantiation is valid the RESULT will currently be marked as an
14573 *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set
14574 until we get here. */
14576 if (DECL_TEMPLATE_SPECIALIZATION (result
))
14578 /* DR 259 [temp.spec].
14580 Both an explicit instantiation and a declaration of an explicit
14581 specialization shall not appear in a program unless the explicit
14582 instantiation follows a declaration of the explicit specialization.
14584 For a given set of template parameters, if an explicit
14585 instantiation of a template appears after a declaration of an
14586 explicit specialization for that template, the explicit
14587 instantiation has no effect. */
14590 else if (DECL_EXPLICIT_INSTANTIATION (result
))
14594 No program shall explicitly instantiate any template more
14597 We check DECL_NOT_REALLY_EXTERN so as not to complain when
14598 the first instantiation was `extern' and the second is not,
14599 and EXTERN_P for the opposite case. */
14600 if (DECL_NOT_REALLY_EXTERN (result
) && !extern_p
)
14601 permerror (input_location
, "duplicate explicit instantiation of %q#D", result
);
14602 /* If an "extern" explicit instantiation follows an ordinary
14603 explicit instantiation, the template is instantiated. */
14607 else if (!DECL_IMPLICIT_INSTANTIATION (result
))
14609 error ("no matching template for %qD found", result
);
14612 else if (!DECL_TEMPLATE_INFO (result
))
14614 permerror (input_location
, "explicit instantiation of non-template %q#D", result
);
14618 if (storage
== NULL_TREE
)
14620 else if (storage
== ridpointers
[(int) RID_EXTERN
])
14622 if (!in_system_header
&& (cxx_dialect
== cxx98
))
14623 pedwarn (input_location
, OPT_pedantic
,
14624 "ISO C++ 1998 forbids the use of %<extern%> on explicit "
14629 error ("storage class %qD applied to template instantiation", storage
);
14631 check_explicit_instantiation_namespace (result
);
14632 mark_decl_instantiated (result
, extern_p
);
14634 instantiate_decl (result
, /*defer_ok=*/1,
14635 /*expl_inst_class_mem_p=*/false);
14639 mark_class_instantiated (tree t
, int extern_p
)
14641 SET_CLASSTYPE_EXPLICIT_INSTANTIATION (t
);
14642 SET_CLASSTYPE_INTERFACE_KNOWN (t
);
14643 CLASSTYPE_INTERFACE_ONLY (t
) = extern_p
;
14644 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (t
)) = extern_p
;
14647 CLASSTYPE_DEBUG_REQUESTED (t
) = 1;
14648 rest_of_type_compilation (t
, 1);
14652 /* Called from do_type_instantiation through binding_table_foreach to
14653 do recursive instantiation for the type bound in ENTRY. */
14655 bt_instantiate_type_proc (binding_entry entry
, void *data
)
14657 tree storage
= *(tree
*) data
;
14659 if (MAYBE_CLASS_TYPE_P (entry
->type
)
14660 && !uses_template_parms (CLASSTYPE_TI_ARGS (entry
->type
)))
14661 do_type_instantiation (TYPE_MAIN_DECL (entry
->type
), storage
, 0);
14664 /* Called from do_type_instantiation to instantiate a member
14665 (a member function or a static member variable) of an
14666 explicitly instantiated class template. */
14668 instantiate_class_member (tree decl
, int extern_p
)
14670 mark_decl_instantiated (decl
, extern_p
);
14672 instantiate_decl (decl
, /*defer_ok=*/1,
14673 /*expl_inst_class_mem_p=*/true);
14676 /* Perform an explicit instantiation of template class T. STORAGE, if
14677 non-null, is the RID for extern, inline or static. COMPLAIN is
14678 nonzero if this is called from the parser, zero if called recursively,
14679 since the standard is unclear (as detailed below). */
14682 do_type_instantiation (tree t
, tree storage
, tsubst_flags_t complain
)
14687 int previous_instantiation_extern_p
= 0;
14689 if (TREE_CODE (t
) == TYPE_DECL
)
14692 if (! CLASS_TYPE_P (t
) || ! CLASSTYPE_TEMPLATE_INFO (t
))
14694 error ("explicit instantiation of non-template type %qT", t
);
14700 if (!COMPLETE_TYPE_P (t
))
14702 if (complain
& tf_error
)
14703 error ("explicit instantiation of %q#T before definition of template",
14708 if (storage
!= NULL_TREE
)
14710 if (!in_system_header
)
14712 if (storage
== ridpointers
[(int) RID_EXTERN
])
14714 if (cxx_dialect
== cxx98
)
14715 pedwarn (input_location
, OPT_pedantic
,
14716 "ISO C++ 1998 forbids the use of %<extern%> on "
14717 "explicit instantiations");
14720 pedwarn (input_location
, OPT_pedantic
,
14721 "ISO C++ forbids the use of %qE"
14722 " on explicit instantiations", storage
);
14725 if (storage
== ridpointers
[(int) RID_INLINE
])
14727 else if (storage
== ridpointers
[(int) RID_EXTERN
])
14729 else if (storage
== ridpointers
[(int) RID_STATIC
])
14733 error ("storage class %qD applied to template instantiation",
14739 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
14741 /* DR 259 [temp.spec].
14743 Both an explicit instantiation and a declaration of an explicit
14744 specialization shall not appear in a program unless the explicit
14745 instantiation follows a declaration of the explicit specialization.
14747 For a given set of template parameters, if an explicit
14748 instantiation of a template appears after a declaration of an
14749 explicit specialization for that template, the explicit
14750 instantiation has no effect. */
14753 else if (CLASSTYPE_EXPLICIT_INSTANTIATION (t
))
14757 No program shall explicitly instantiate any template more
14760 If PREVIOUS_INSTANTIATION_EXTERN_P, then the first explicit
14761 instantiation was `extern'. If EXTERN_P then the second is.
14762 These cases are OK. */
14763 previous_instantiation_extern_p
= CLASSTYPE_INTERFACE_ONLY (t
);
14765 if (!previous_instantiation_extern_p
&& !extern_p
14766 && (complain
& tf_error
))
14767 permerror (input_location
, "duplicate explicit instantiation of %q#T", t
);
14769 /* If we've already instantiated the template, just return now. */
14770 if (!CLASSTYPE_INTERFACE_ONLY (t
))
14774 check_explicit_instantiation_namespace (TYPE_NAME (t
));
14775 mark_class_instantiated (t
, extern_p
);
14783 /* In contrast to implicit instantiation, where only the
14784 declarations, and not the definitions, of members are
14785 instantiated, we have here:
14789 The explicit instantiation of a class template specialization
14790 implies the instantiation of all of its members not
14791 previously explicitly specialized in the translation unit
14792 containing the explicit instantiation.
14794 Of course, we can't instantiate member template classes, since
14795 we don't have any arguments for them. Note that the standard
14796 is unclear on whether the instantiation of the members are
14797 *explicit* instantiations or not. However, the most natural
14798 interpretation is that it should be an explicit instantiation. */
14801 for (tmp
= TYPE_METHODS (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
14802 if (TREE_CODE (tmp
) == FUNCTION_DECL
14803 && DECL_TEMPLATE_INSTANTIATION (tmp
))
14804 instantiate_class_member (tmp
, extern_p
);
14806 for (tmp
= TYPE_FIELDS (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
14807 if (TREE_CODE (tmp
) == VAR_DECL
&& DECL_TEMPLATE_INSTANTIATION (tmp
))
14808 instantiate_class_member (tmp
, extern_p
);
14810 if (CLASSTYPE_NESTED_UTDS (t
))
14811 binding_table_foreach (CLASSTYPE_NESTED_UTDS (t
),
14812 bt_instantiate_type_proc
, &storage
);
14816 /* Given a function DECL, which is a specialization of TMPL, modify
14817 DECL to be a re-instantiation of TMPL with the same template
14818 arguments. TMPL should be the template into which tsubst'ing
14819 should occur for DECL, not the most general template.
14821 One reason for doing this is a scenario like this:
14824 void f(const T&, int i);
14826 void g() { f(3, 7); }
14829 void f(const T& t, const int i) { }
14831 Note that when the template is first instantiated, with
14832 instantiate_template, the resulting DECL will have no name for the
14833 first parameter, and the wrong type for the second. So, when we go
14834 to instantiate the DECL, we regenerate it. */
14837 regenerate_decl_from_template (tree decl
, tree tmpl
)
14839 /* The arguments used to instantiate DECL, from the most general
14844 args
= DECL_TI_ARGS (decl
);
14845 code_pattern
= DECL_TEMPLATE_RESULT (tmpl
);
14847 /* Make sure that we can see identifiers, and compute access
14849 push_access_scope (decl
);
14851 if (TREE_CODE (decl
) == FUNCTION_DECL
)
14859 args_depth
= TMPL_ARGS_DEPTH (args
);
14860 parms_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
14861 if (args_depth
> parms_depth
)
14862 args
= get_innermost_template_args (args
, parms_depth
);
14864 specs
= tsubst_exception_specification (TREE_TYPE (code_pattern
),
14865 args
, tf_error
, NULL_TREE
);
14867 TREE_TYPE (decl
) = build_exception_variant (TREE_TYPE (decl
),
14870 /* Merge parameter declarations. */
14871 decl_parm
= skip_artificial_parms_for (decl
,
14872 DECL_ARGUMENTS (decl
));
14874 = skip_artificial_parms_for (code_pattern
,
14875 DECL_ARGUMENTS (code_pattern
));
14876 while (decl_parm
&& !FUNCTION_PARAMETER_PACK_P (pattern_parm
))
14881 if (DECL_NAME (decl_parm
) != DECL_NAME (pattern_parm
))
14882 DECL_NAME (decl_parm
) = DECL_NAME (pattern_parm
);
14883 parm_type
= tsubst (TREE_TYPE (pattern_parm
), args
, tf_error
,
14885 parm_type
= type_decays_to (parm_type
);
14886 if (!same_type_p (TREE_TYPE (decl_parm
), parm_type
))
14887 TREE_TYPE (decl_parm
) = parm_type
;
14888 attributes
= DECL_ATTRIBUTES (pattern_parm
);
14889 if (DECL_ATTRIBUTES (decl_parm
) != attributes
)
14891 DECL_ATTRIBUTES (decl_parm
) = attributes
;
14892 cplus_decl_attributes (&decl_parm
, attributes
, /*flags=*/0);
14894 decl_parm
= TREE_CHAIN (decl_parm
);
14895 pattern_parm
= TREE_CHAIN (pattern_parm
);
14897 /* Merge any parameters that match with the function parameter
14899 if (pattern_parm
&& FUNCTION_PARAMETER_PACK_P (pattern_parm
))
14902 tree expanded_types
;
14903 /* Expand the TYPE_PACK_EXPANSION that provides the types for
14904 the parameters in this function parameter pack. */
14905 expanded_types
= tsubst_pack_expansion (TREE_TYPE (pattern_parm
),
14906 args
, tf_error
, NULL_TREE
);
14907 len
= TREE_VEC_LENGTH (expanded_types
);
14908 for (i
= 0; i
< len
; i
++)
14913 if (DECL_NAME (decl_parm
) != DECL_NAME (pattern_parm
))
14914 /* Rename the parameter to include the index. */
14915 DECL_NAME (decl_parm
) =
14916 make_ith_pack_parameter_name (DECL_NAME (pattern_parm
), i
);
14917 parm_type
= TREE_VEC_ELT (expanded_types
, i
);
14918 parm_type
= type_decays_to (parm_type
);
14919 if (!same_type_p (TREE_TYPE (decl_parm
), parm_type
))
14920 TREE_TYPE (decl_parm
) = parm_type
;
14921 attributes
= DECL_ATTRIBUTES (pattern_parm
);
14922 if (DECL_ATTRIBUTES (decl_parm
) != attributes
)
14924 DECL_ATTRIBUTES (decl_parm
) = attributes
;
14925 cplus_decl_attributes (&decl_parm
, attributes
, /*flags=*/0);
14927 decl_parm
= TREE_CHAIN (decl_parm
);
14930 /* Merge additional specifiers from the CODE_PATTERN. */
14931 if (DECL_DECLARED_INLINE_P (code_pattern
)
14932 && !DECL_DECLARED_INLINE_P (decl
))
14933 DECL_DECLARED_INLINE_P (decl
) = 1;
14935 else if (TREE_CODE (decl
) == VAR_DECL
)
14936 DECL_INITIAL (decl
) =
14937 tsubst_expr (DECL_INITIAL (code_pattern
), args
,
14938 tf_error
, DECL_TI_TEMPLATE (decl
),
14939 /*integral_constant_expression_p=*/false);
14941 gcc_unreachable ();
14943 pop_access_scope (decl
);
14946 /* Return the TEMPLATE_DECL into which DECL_TI_ARGS(DECL) should be
14947 substituted to get DECL. */
14950 template_for_substitution (tree decl
)
14952 tree tmpl
= DECL_TI_TEMPLATE (decl
);
14954 /* Set TMPL to the template whose DECL_TEMPLATE_RESULT is the pattern
14955 for the instantiation. This is not always the most general
14956 template. Consider, for example:
14959 struct S { template <class U> void f();
14960 template <> void f<int>(); };
14962 and an instantiation of S<double>::f<int>. We want TD to be the
14963 specialization S<T>::f<int>, not the more general S<T>::f<U>. */
14964 while (/* An instantiation cannot have a definition, so we need a
14965 more general template. */
14966 DECL_TEMPLATE_INSTANTIATION (tmpl
)
14967 /* We must also deal with friend templates. Given:
14969 template <class T> struct S {
14970 template <class U> friend void f() {};
14973 S<int>::f<U> say, is not an instantiation of S<T>::f<U>,
14974 so far as the language is concerned, but that's still
14975 where we get the pattern for the instantiation from. On
14976 other hand, if the definition comes outside the class, say:
14978 template <class T> struct S {
14979 template <class U> friend void f();
14981 template <class U> friend void f() {}
14983 we don't need to look any further. That's what the check for
14984 DECL_INITIAL is for. */
14985 || (TREE_CODE (decl
) == FUNCTION_DECL
14986 && DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (tmpl
)
14987 && !DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl
))))
14989 /* The present template, TD, should not be a definition. If it
14990 were a definition, we should be using it! Note that we
14991 cannot restructure the loop to just keep going until we find
14992 a template with a definition, since that might go too far if
14993 a specialization was declared, but not defined. */
14994 gcc_assert (TREE_CODE (decl
) != VAR_DECL
14995 || DECL_IN_AGGR_P (DECL_TEMPLATE_RESULT (tmpl
)));
14997 /* Fetch the more general template. */
14998 tmpl
= DECL_TI_TEMPLATE (tmpl
);
15004 /* Produce the definition of D, a _DECL generated from a template. If
15005 DEFER_OK is nonzero, then we don't have to actually do the
15006 instantiation now; we just have to do it sometime. Normally it is
15007 an error if this is an explicit instantiation but D is undefined.
15008 EXPL_INST_CLASS_MEM_P is true iff D is a member of an
15009 explicitly instantiated class template. */
15012 instantiate_decl (tree d
, int defer_ok
,
15013 bool expl_inst_class_mem_p
)
15015 tree tmpl
= DECL_TI_TEMPLATE (d
);
15022 bool pattern_defined
;
15024 location_t saved_loc
= input_location
;
15027 /* This function should only be used to instantiate templates for
15028 functions and static member variables. */
15029 gcc_assert (TREE_CODE (d
) == FUNCTION_DECL
15030 || TREE_CODE (d
) == VAR_DECL
);
15032 /* Variables are never deferred; if instantiation is required, they
15033 are instantiated right away. That allows for better code in the
15034 case that an expression refers to the value of the variable --
15035 if the variable has a constant value the referring expression can
15036 take advantage of that fact. */
15037 if (TREE_CODE (d
) == VAR_DECL
)
15040 /* Don't instantiate cloned functions. Instead, instantiate the
15041 functions they cloned. */
15042 if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_CLONED_FUNCTION_P (d
))
15043 d
= DECL_CLONED_FUNCTION (d
);
15045 if (DECL_TEMPLATE_INSTANTIATED (d
))
15046 /* D has already been instantiated. It might seem reasonable to
15047 check whether or not D is an explicit instantiation, and, if so,
15048 stop here. But when an explicit instantiation is deferred
15049 until the end of the compilation, DECL_EXPLICIT_INSTANTIATION
15050 is set, even though we still need to do the instantiation. */
15053 /* If we already have a specialization of this declaration, then
15054 there's no reason to instantiate it. Note that
15055 retrieve_specialization gives us both instantiations and
15056 specializations, so we must explicitly check
15057 DECL_TEMPLATE_SPECIALIZATION. */
15058 gen_tmpl
= most_general_template (tmpl
);
15059 gen_args
= DECL_TI_ARGS (d
);
15060 spec
= retrieve_specialization (gen_tmpl
, gen_args
,
15061 /*class_specializations_p=*/false);
15062 if (spec
!= NULL_TREE
&& DECL_TEMPLATE_SPECIALIZATION (spec
))
15065 /* This needs to happen before any tsubsting. */
15066 if (! push_tinst_level (d
))
15069 timevar_push (TV_PARSE
);
15071 /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern
15072 for the instantiation. */
15073 td
= template_for_substitution (d
);
15074 code_pattern
= DECL_TEMPLATE_RESULT (td
);
15076 /* We should never be trying to instantiate a member of a class
15077 template or partial specialization. */
15078 gcc_assert (d
!= code_pattern
);
15080 if ((DECL_NAMESPACE_SCOPE_P (d
) && !DECL_INITIALIZED_IN_CLASS_P (d
))
15081 || DECL_TEMPLATE_SPECIALIZATION (td
))
15082 /* In the case of a friend template whose definition is provided
15083 outside the class, we may have too many arguments. Drop the
15084 ones we don't need. The same is true for specializations. */
15085 args
= get_innermost_template_args
15086 (gen_args
, TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (td
)));
15090 if (TREE_CODE (d
) == FUNCTION_DECL
)
15091 pattern_defined
= (DECL_SAVED_TREE (code_pattern
) != NULL_TREE
);
15093 pattern_defined
= ! DECL_IN_AGGR_P (code_pattern
);
15095 /* We may be in the middle of deferred access check. Disable it now. */
15096 push_deferring_access_checks (dk_no_deferred
);
15098 /* Unless an explicit instantiation directive has already determined
15099 the linkage of D, remember that a definition is available for
15101 if (pattern_defined
15102 && !DECL_INTERFACE_KNOWN (d
)
15103 && !DECL_NOT_REALLY_EXTERN (d
))
15104 mark_definable (d
);
15106 input_location
= DECL_SOURCE_LOCATION (d
);
15108 /* If D is a member of an explicitly instantiated class template,
15109 and no definition is available, treat it like an implicit
15111 if (!pattern_defined
&& expl_inst_class_mem_p
15112 && DECL_EXPLICIT_INSTANTIATION (d
))
15114 DECL_NOT_REALLY_EXTERN (d
) = 0;
15115 DECL_INTERFACE_KNOWN (d
) = 0;
15116 SET_DECL_IMPLICIT_INSTANTIATION (d
);
15121 /* Recheck the substitutions to obtain any warning messages
15122 about ignoring cv qualifiers. */
15123 tree gen
= DECL_TEMPLATE_RESULT (gen_tmpl
);
15124 tree type
= TREE_TYPE (gen
);
15126 /* Make sure that we can see identifiers, and compute access
15127 correctly. D is already the target FUNCTION_DECL with the
15129 push_access_scope (d
);
15131 if (TREE_CODE (gen
) == FUNCTION_DECL
)
15133 tsubst (DECL_ARGUMENTS (gen
), gen_args
, tf_warning_or_error
, d
);
15134 tsubst_exception_specification (type
, gen_args
, tf_warning_or_error
,
15136 /* Don't simply tsubst the function type, as that will give
15137 duplicate warnings about poor parameter qualifications.
15138 The function arguments are the same as the decl_arguments
15139 without the top level cv qualifiers. */
15140 type
= TREE_TYPE (type
);
15142 tsubst (type
, gen_args
, tf_warning_or_error
, d
);
15144 pop_access_scope (d
);
15147 /* Check to see whether we know that this template will be
15148 instantiated in some other file, as with "extern template"
15150 external_p
= (DECL_INTERFACE_KNOWN (d
) && DECL_REALLY_EXTERN (d
));
15151 /* In general, we do not instantiate such templates... */
15153 /* ... but we instantiate inline functions so that we can inline
15155 && ! (TREE_CODE (d
) == FUNCTION_DECL
15156 && possibly_inlined_p (d
))
15157 /* ... we instantiate static data members whose values are
15158 needed in integral constant expressions. */
15159 && ! (TREE_CODE (d
) == VAR_DECL
15160 && DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (d
)))
15162 /* Defer all other templates, unless we have been explicitly
15163 forbidden from doing so. */
15164 if (/* If there is no definition, we cannot instantiate the
15167 /* If it's OK to postpone instantiation, do so. */
15169 /* If this is a static data member that will be defined
15170 elsewhere, we don't want to instantiate the entire data
15171 member, but we do want to instantiate the initializer so that
15172 we can substitute that elsewhere. */
15173 || (external_p
&& TREE_CODE (d
) == VAR_DECL
))
15175 /* The definition of the static data member is now required so
15176 we must substitute the initializer. */
15177 if (TREE_CODE (d
) == VAR_DECL
15178 && !DECL_INITIAL (d
)
15179 && DECL_INITIAL (code_pattern
))
15184 ns
= decl_namespace_context (d
);
15185 push_nested_namespace (ns
);
15186 push_nested_class (DECL_CONTEXT (d
));
15187 init
= tsubst_expr (DECL_INITIAL (code_pattern
),
15189 tf_warning_or_error
, NULL_TREE
,
15190 /*integral_constant_expression_p=*/false);
15191 cp_finish_decl (d
, init
, /*init_const_expr_p=*/false,
15192 /*asmspec_tree=*/NULL_TREE
,
15193 LOOKUP_ONLYCONVERTING
);
15194 pop_nested_class ();
15195 pop_nested_namespace (ns
);
15198 /* We restore the source position here because it's used by
15199 add_pending_template. */
15200 input_location
= saved_loc
;
15202 if (at_eof
&& !pattern_defined
15203 && DECL_EXPLICIT_INSTANTIATION (d
))
15206 The definition of a non-exported function template, a
15207 non-exported member function template, or a non-exported
15208 member function or static data member of a class template
15209 shall be present in every translation unit in which it is
15210 explicitly instantiated. */
15211 permerror (input_location
, "explicit instantiation of %qD "
15212 "but no definition available", d
);
15214 /* ??? Historically, we have instantiated inline functions, even
15215 when marked as "extern template". */
15216 if (!(external_p
&& TREE_CODE (d
) == VAR_DECL
))
15217 add_pending_template (d
);
15220 /* Tell the repository that D is available in this translation unit
15221 -- and see if it is supposed to be instantiated here. */
15222 if (TREE_PUBLIC (d
) && !DECL_REALLY_EXTERN (d
) && !repo_emit_p (d
))
15224 /* In a PCH file, despite the fact that the repository hasn't
15225 requested instantiation in the PCH it is still possible that
15226 an instantiation will be required in a file that includes the
15229 add_pending_template (d
);
15230 /* Instantiate inline functions so that the inliner can do its
15231 job, even though we'll not be emitting a copy of this
15233 if (!(TREE_CODE (d
) == FUNCTION_DECL
&& possibly_inlined_p (d
)))
15237 need_push
= !cfun
|| !global_bindings_p ();
15239 push_to_top_level ();
15241 /* Mark D as instantiated so that recursive calls to
15242 instantiate_decl do not try to instantiate it again. */
15243 DECL_TEMPLATE_INSTANTIATED (d
) = 1;
15245 /* Regenerate the declaration in case the template has been modified
15246 by a subsequent redeclaration. */
15247 regenerate_decl_from_template (d
, td
);
15249 /* We already set the file and line above. Reset them now in case
15250 they changed as a result of calling regenerate_decl_from_template. */
15251 input_location
= DECL_SOURCE_LOCATION (d
);
15253 if (TREE_CODE (d
) == VAR_DECL
)
15257 /* Clear out DECL_RTL; whatever was there before may not be right
15258 since we've reset the type of the declaration. */
15259 SET_DECL_RTL (d
, NULL_RTX
);
15260 DECL_IN_AGGR_P (d
) = 0;
15262 /* The initializer is placed in DECL_INITIAL by
15263 regenerate_decl_from_template. Pull it out so that
15264 finish_decl can process it. */
15265 init
= DECL_INITIAL (d
);
15266 DECL_INITIAL (d
) = NULL_TREE
;
15267 DECL_INITIALIZED_P (d
) = 0;
15269 /* Clear DECL_EXTERNAL so that cp_finish_decl will process the
15270 initializer. That function will defer actual emission until
15271 we have a chance to determine linkage. */
15272 DECL_EXTERNAL (d
) = 0;
15274 /* Enter the scope of D so that access-checking works correctly. */
15275 push_nested_class (DECL_CONTEXT (d
));
15276 finish_decl (d
, init
, NULL_TREE
);
15277 pop_nested_class ();
15279 else if (TREE_CODE (d
) == FUNCTION_DECL
)
15281 htab_t saved_local_specializations
;
15286 /* Save away the current list, in case we are instantiating one
15287 template from within the body of another. */
15288 saved_local_specializations
= local_specializations
;
15290 /* Set up the list of local specializations. */
15291 local_specializations
= htab_create (37,
15292 hash_local_specialization
,
15293 eq_local_specializations
,
15296 /* Set up context. */
15297 start_preparsed_function (d
, NULL_TREE
, SF_PRE_PARSED
);
15299 /* Create substitution entries for the parameters. */
15300 subst_decl
= DECL_TEMPLATE_RESULT (template_for_substitution (d
));
15301 tmpl_parm
= DECL_ARGUMENTS (subst_decl
);
15302 spec_parm
= DECL_ARGUMENTS (d
);
15303 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (d
))
15305 register_local_specialization (spec_parm
, tmpl_parm
);
15306 spec_parm
= skip_artificial_parms_for (d
, spec_parm
);
15307 tmpl_parm
= skip_artificial_parms_for (subst_decl
, tmpl_parm
);
15309 while (tmpl_parm
&& !FUNCTION_PARAMETER_PACK_P (tmpl_parm
))
15311 register_local_specialization (spec_parm
, tmpl_parm
);
15312 tmpl_parm
= TREE_CHAIN (tmpl_parm
);
15313 spec_parm
= TREE_CHAIN (spec_parm
);
15315 if (tmpl_parm
&& FUNCTION_PARAMETER_PACK_P (tmpl_parm
))
15317 /* Collect all of the extra "packed" parameters into an
15321 tree argpack
= make_node (NONTYPE_ARGUMENT_PACK
);
15322 tree argtypepack
= make_node (TYPE_ARGUMENT_PACK
);
15326 /* Count how many parameters remain. */
15327 for (t
= spec_parm
; t
; t
= TREE_CHAIN (t
))
15330 /* Fill in PARMVEC and PARMTYPEVEC with all of the parameters. */
15331 parmvec
= make_tree_vec (len
);
15332 parmtypevec
= make_tree_vec (len
);
15333 for(i
= 0; i
< len
; i
++, spec_parm
= TREE_CHAIN (spec_parm
))
15335 TREE_VEC_ELT (parmvec
, i
) = spec_parm
;
15336 TREE_VEC_ELT (parmtypevec
, i
) = TREE_TYPE (spec_parm
);
15339 /* Build the argument packs. */
15340 SET_ARGUMENT_PACK_ARGS (argpack
, parmvec
);
15341 SET_ARGUMENT_PACK_ARGS (argtypepack
, parmtypevec
);
15342 TREE_TYPE (argpack
) = argtypepack
;
15344 /* Register the (value) argument pack as a specialization of
15345 TMPL_PARM, then move on. */
15346 register_local_specialization (argpack
, tmpl_parm
);
15347 tmpl_parm
= TREE_CHAIN (tmpl_parm
);
15349 gcc_assert (!spec_parm
);
15351 /* Substitute into the body of the function. */
15352 tsubst_expr (DECL_SAVED_TREE (code_pattern
), args
,
15353 tf_warning_or_error
, tmpl
,
15354 /*integral_constant_expression_p=*/false);
15356 /* Set the current input_location to the end of the function
15357 so that finish_function knows where we are. */
15358 input_location
= DECL_STRUCT_FUNCTION (code_pattern
)->function_end_locus
;
15360 /* We don't need the local specializations any more. */
15361 htab_delete (local_specializations
);
15362 local_specializations
= saved_local_specializations
;
15364 /* Finish the function. */
15365 d
= finish_function (0);
15366 expand_or_defer_fn (d
);
15369 /* We're not deferring instantiation any more. */
15370 TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (d
)) = 0;
15373 pop_from_top_level ();
15376 input_location
= saved_loc
;
15377 pop_deferring_access_checks ();
15378 pop_tinst_level ();
15380 timevar_pop (TV_PARSE
);
15385 /* Run through the list of templates that we wish we could
15386 instantiate, and instantiate any we can. RETRIES is the
15387 number of times we retry pending template instantiation. */
15390 instantiate_pending_templates (int retries
)
15393 location_t saved_loc
= input_location
;
15395 /* Instantiating templates may trigger vtable generation. This in turn
15396 may require further template instantiations. We place a limit here
15397 to avoid infinite loop. */
15398 if (pending_templates
&& retries
>= max_tinst_depth
)
15400 tree decl
= pending_templates
->tinst
->decl
;
15402 error ("template instantiation depth exceeds maximum of %d"
15403 " instantiating %q+D, possibly from virtual table generation"
15404 " (use -ftemplate-depth-NN to increase the maximum)",
15405 max_tinst_depth
, decl
);
15406 if (TREE_CODE (decl
) == FUNCTION_DECL
)
15407 /* Pretend that we defined it. */
15408 DECL_INITIAL (decl
) = error_mark_node
;
15414 struct pending_template
**t
= &pending_templates
;
15415 struct pending_template
*last
= NULL
;
15419 tree instantiation
= reopen_tinst_level ((*t
)->tinst
);
15420 bool complete
= false;
15422 if (TYPE_P (instantiation
))
15426 if (!COMPLETE_TYPE_P (instantiation
))
15428 instantiate_class_template (instantiation
);
15429 if (CLASSTYPE_TEMPLATE_INSTANTIATION (instantiation
))
15430 for (fn
= TYPE_METHODS (instantiation
);
15432 fn
= TREE_CHAIN (fn
))
15433 if (! DECL_ARTIFICIAL (fn
))
15434 instantiate_decl (fn
,
15436 /*expl_inst_class_mem_p=*/false);
15437 if (COMPLETE_TYPE_P (instantiation
))
15441 complete
= COMPLETE_TYPE_P (instantiation
);
15445 if (!DECL_TEMPLATE_SPECIALIZATION (instantiation
)
15446 && !DECL_TEMPLATE_INSTANTIATED (instantiation
))
15449 = instantiate_decl (instantiation
,
15451 /*expl_inst_class_mem_p=*/false);
15452 if (DECL_TEMPLATE_INSTANTIATED (instantiation
))
15456 complete
= (DECL_TEMPLATE_SPECIALIZATION (instantiation
)
15457 || DECL_TEMPLATE_INSTANTIATED (instantiation
));
15461 /* If INSTANTIATION has been instantiated, then we don't
15462 need to consider it again in the future. */
15470 current_tinst_level
= NULL
;
15472 last_pending_template
= last
;
15474 while (reconsider
);
15476 input_location
= saved_loc
;
15479 /* Substitute ARGVEC into T, which is a list of initializers for
15480 either base class or a non-static data member. The TREE_PURPOSEs
15481 are DECLs, and the TREE_VALUEs are the initializer values. Used by
15482 instantiate_decl. */
15485 tsubst_initializer_list (tree t
, tree argvec
)
15487 tree inits
= NULL_TREE
;
15489 for (; t
; t
= TREE_CHAIN (t
))
15493 tree expanded_bases
= NULL_TREE
;
15494 tree expanded_arguments
= NULL_TREE
;
15497 if (TREE_CODE (TREE_PURPOSE (t
)) == TYPE_PACK_EXPANSION
)
15502 /* Expand the base class expansion type into separate base
15504 expanded_bases
= tsubst_pack_expansion (TREE_PURPOSE (t
), argvec
,
15505 tf_warning_or_error
,
15507 if (expanded_bases
== error_mark_node
)
15510 /* We'll be building separate TREE_LISTs of arguments for
15512 len
= TREE_VEC_LENGTH (expanded_bases
);
15513 expanded_arguments
= make_tree_vec (len
);
15514 for (i
= 0; i
< len
; i
++)
15515 TREE_VEC_ELT (expanded_arguments
, i
) = NULL_TREE
;
15517 /* Build a dummy EXPR_PACK_EXPANSION that will be used to
15518 expand each argument in the TREE_VALUE of t. */
15519 expr
= make_node (EXPR_PACK_EXPANSION
);
15520 PACK_EXPANSION_PARAMETER_PACKS (expr
) =
15521 PACK_EXPANSION_PARAMETER_PACKS (TREE_PURPOSE (t
));
15523 if (TREE_VALUE (t
) == void_type_node
)
15524 /* VOID_TYPE_NODE is used to indicate
15525 value-initialization. */
15527 for (i
= 0; i
< len
; i
++)
15528 TREE_VEC_ELT (expanded_arguments
, i
) = void_type_node
;
15532 /* Substitute parameter packs into each argument in the
15534 in_base_initializer
= 1;
15535 for (arg
= TREE_VALUE (t
); arg
; arg
= TREE_CHAIN (arg
))
15537 tree expanded_exprs
;
15539 /* Expand the argument. */
15540 SET_PACK_EXPANSION_PATTERN (expr
, TREE_VALUE (arg
));
15542 = tsubst_pack_expansion (expr
, argvec
,
15543 tf_warning_or_error
,
15545 if (expanded_exprs
== error_mark_node
)
15548 /* Prepend each of the expanded expressions to the
15549 corresponding TREE_LIST in EXPANDED_ARGUMENTS. */
15550 for (i
= 0; i
< len
; i
++)
15552 TREE_VEC_ELT (expanded_arguments
, i
) =
15553 tree_cons (NULL_TREE
,
15554 TREE_VEC_ELT (expanded_exprs
, i
),
15555 TREE_VEC_ELT (expanded_arguments
, i
));
15558 in_base_initializer
= 0;
15560 /* Reverse all of the TREE_LISTs in EXPANDED_ARGUMENTS,
15561 since we built them backwards. */
15562 for (i
= 0; i
< len
; i
++)
15564 TREE_VEC_ELT (expanded_arguments
, i
) =
15565 nreverse (TREE_VEC_ELT (expanded_arguments
, i
));
15570 for (i
= 0; i
< len
; ++i
)
15572 if (expanded_bases
)
15574 decl
= TREE_VEC_ELT (expanded_bases
, i
);
15575 decl
= expand_member_init (decl
);
15576 init
= TREE_VEC_ELT (expanded_arguments
, i
);
15580 decl
= tsubst_copy (TREE_PURPOSE (t
), argvec
,
15581 tf_warning_or_error
, NULL_TREE
);
15583 decl
= expand_member_init (decl
);
15584 if (decl
&& !DECL_P (decl
))
15585 in_base_initializer
= 1;
15587 init
= tsubst_expr (TREE_VALUE (t
), argvec
,
15588 tf_warning_or_error
, NULL_TREE
,
15589 /*integral_constant_expression_p=*/false);
15590 in_base_initializer
= 0;
15595 init
= build_tree_list (decl
, init
);
15596 TREE_CHAIN (init
) = inits
;
15604 /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */
15607 set_current_access_from_decl (tree decl
)
15609 if (TREE_PRIVATE (decl
))
15610 current_access_specifier
= access_private_node
;
15611 else if (TREE_PROTECTED (decl
))
15612 current_access_specifier
= access_protected_node
;
15614 current_access_specifier
= access_public_node
;
15617 /* Instantiate an enumerated type. TAG is the template type, NEWTAG
15618 is the instantiation (which should have been created with
15619 start_enum) and ARGS are the template arguments to use. */
15622 tsubst_enum (tree tag
, tree newtag
, tree args
)
15626 for (e
= TYPE_VALUES (tag
); e
; e
= TREE_CHAIN (e
))
15631 decl
= TREE_VALUE (e
);
15632 /* Note that in a template enum, the TREE_VALUE is the
15633 CONST_DECL, not the corresponding INTEGER_CST. */
15634 value
= tsubst_expr (DECL_INITIAL (decl
),
15635 args
, tf_warning_or_error
, NULL_TREE
,
15636 /*integral_constant_expression_p=*/true);
15638 /* Give this enumeration constant the correct access. */
15639 set_current_access_from_decl (decl
);
15641 /* Actually build the enumerator itself. */
15642 build_enumerator (DECL_NAME (decl
), value
, newtag
);
15645 finish_enum (newtag
);
15646 DECL_SOURCE_LOCATION (TYPE_NAME (newtag
))
15647 = DECL_SOURCE_LOCATION (TYPE_NAME (tag
));
15650 /* DECL is a FUNCTION_DECL that is a template specialization. Return
15651 its type -- but without substituting the innermost set of template
15652 arguments. So, innermost set of template parameters will appear in
15656 get_mostly_instantiated_function_type (tree decl
)
15664 tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
15665 targs
= DECL_TI_ARGS (decl
);
15666 tparms
= DECL_TEMPLATE_PARMS (tmpl
);
15667 parm_depth
= TMPL_PARMS_DEPTH (tparms
);
15669 /* There should be as many levels of arguments as there are levels
15671 gcc_assert (parm_depth
== TMPL_ARGS_DEPTH (targs
));
15673 fn_type
= TREE_TYPE (tmpl
);
15675 if (parm_depth
== 1)
15676 /* No substitution is necessary. */
15680 int i
, save_access_control
;
15683 /* Replace the innermost level of the TARGS with NULL_TREEs to
15684 let tsubst know not to substitute for those parameters. */
15685 partial_args
= make_tree_vec (TREE_VEC_LENGTH (targs
));
15686 for (i
= 1; i
< TMPL_ARGS_DEPTH (targs
); ++i
)
15687 SET_TMPL_ARGS_LEVEL (partial_args
, i
,
15688 TMPL_ARGS_LEVEL (targs
, i
));
15689 SET_TMPL_ARGS_LEVEL (partial_args
,
15690 TMPL_ARGS_DEPTH (targs
),
15691 make_tree_vec (DECL_NTPARMS (tmpl
)));
15693 /* Disable access control as this function is used only during
15695 save_access_control
= flag_access_control
;
15696 flag_access_control
= 0;
15698 ++processing_template_decl
;
15699 /* Now, do the (partial) substitution to figure out the
15700 appropriate function type. */
15701 fn_type
= tsubst (fn_type
, partial_args
, tf_error
, NULL_TREE
);
15702 --processing_template_decl
;
15704 /* Substitute into the template parameters to obtain the real
15705 innermost set of parameters. This step is important if the
15706 innermost set of template parameters contains value
15707 parameters whose types depend on outer template parameters. */
15708 TREE_VEC_LENGTH (partial_args
)--;
15709 tparms
= tsubst_template_parms (tparms
, partial_args
, tf_error
);
15711 flag_access_control
= save_access_control
;
15717 /* Return truthvalue if we're processing a template different from
15718 the last one involved in diagnostics. */
15720 problematic_instantiation_changed (void)
15722 return last_template_error_tick
!= tinst_level_tick
;
15725 /* Remember current template involved in diagnostics. */
15727 record_last_problematic_instantiation (void)
15729 last_template_error_tick
= tinst_level_tick
;
15732 struct tinst_level
*
15733 current_instantiation (void)
15735 return current_tinst_level
;
15738 /* [temp.param] Check that template non-type parm TYPE is of an allowable
15739 type. Return zero for ok, nonzero for disallowed. Issue error and
15740 warning messages under control of COMPLAIN. */
15743 invalid_nontype_parm_type_p (tree type
, tsubst_flags_t complain
)
15745 if (INTEGRAL_TYPE_P (type
))
15747 else if (POINTER_TYPE_P (type
))
15749 else if (TYPE_PTR_TO_MEMBER_P (type
))
15751 else if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
)
15753 else if (TREE_CODE (type
) == TYPENAME_TYPE
)
15756 if (complain
& tf_error
)
15757 error ("%q#T is not a valid type for a template constant parameter", type
);
15761 /* Returns TRUE if TYPE is dependent, in the sense of [temp.dep.type].
15762 Assumes that TYPE really is a type, and not the ERROR_MARK_NODE.*/
15765 dependent_type_p_r (tree type
)
15771 A type is dependent if it is:
15773 -- a template parameter. Template template parameters are types
15774 for us (since TYPE_P holds true for them) so we handle
15776 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
15777 || TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
)
15779 /* -- a qualified-id with a nested-name-specifier which contains a
15780 class-name that names a dependent type or whose unqualified-id
15781 names a dependent type. */
15782 if (TREE_CODE (type
) == TYPENAME_TYPE
)
15784 /* -- a cv-qualified type where the cv-unqualified type is
15786 type
= TYPE_MAIN_VARIANT (type
);
15787 /* -- a compound type constructed from any dependent type. */
15788 if (TYPE_PTR_TO_MEMBER_P (type
))
15789 return (dependent_type_p (TYPE_PTRMEM_CLASS_TYPE (type
))
15790 || dependent_type_p (TYPE_PTRMEM_POINTED_TO_TYPE
15792 else if (TREE_CODE (type
) == POINTER_TYPE
15793 || TREE_CODE (type
) == REFERENCE_TYPE
)
15794 return dependent_type_p (TREE_TYPE (type
));
15795 else if (TREE_CODE (type
) == FUNCTION_TYPE
15796 || TREE_CODE (type
) == METHOD_TYPE
)
15800 if (dependent_type_p (TREE_TYPE (type
)))
15802 for (arg_type
= TYPE_ARG_TYPES (type
);
15804 arg_type
= TREE_CHAIN (arg_type
))
15805 if (dependent_type_p (TREE_VALUE (arg_type
)))
15809 /* -- an array type constructed from any dependent type or whose
15810 size is specified by a constant expression that is
15811 value-dependent. */
15812 if (TREE_CODE (type
) == ARRAY_TYPE
)
15814 if (TYPE_DOMAIN (type
)
15815 && dependent_type_p (TYPE_DOMAIN (type
)))
15817 return dependent_type_p (TREE_TYPE (type
));
15819 else if (TREE_CODE (type
) == INTEGER_TYPE
15820 && !TREE_CONSTANT (TYPE_MAX_VALUE (type
)))
15822 /* If this is the TYPE_DOMAIN of an array type, consider it
15824 return (value_dependent_expression_p (TYPE_MAX_VALUE (type
))
15825 || type_dependent_expression_p (TYPE_MAX_VALUE (type
)));
15828 /* -- a template-id in which either the template name is a template
15830 if (TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
15832 /* ... or any of the template arguments is a dependent type or
15833 an expression that is type-dependent or value-dependent. */
15834 else if (CLASS_TYPE_P (type
) && CLASSTYPE_TEMPLATE_INFO (type
)
15835 && (any_dependent_template_arguments_p
15836 (INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type
)))))
15839 /* All TYPEOF_TYPEs and DECLTYPE_TYPEs are dependent; if the
15840 argument of the `typeof' expression is not type-dependent, then
15841 it should already been have resolved. */
15842 if (TREE_CODE (type
) == TYPEOF_TYPE
15843 || TREE_CODE (type
) == DECLTYPE_TYPE
)
15846 /* A template argument pack is dependent if any of its packed
15848 if (TREE_CODE (type
) == TYPE_ARGUMENT_PACK
)
15850 tree args
= ARGUMENT_PACK_ARGS (type
);
15851 int i
, len
= TREE_VEC_LENGTH (args
);
15852 for (i
= 0; i
< len
; ++i
)
15853 if (dependent_template_arg_p (TREE_VEC_ELT (args
, i
)))
15857 /* All TYPE_PACK_EXPANSIONs are dependent, because parameter packs must
15858 be template parameters. */
15859 if (TREE_CODE (type
) == TYPE_PACK_EXPANSION
)
15862 /* The standard does not specifically mention types that are local
15863 to template functions or local classes, but they should be
15864 considered dependent too. For example:
15866 template <int I> void f() {
15871 The size of `E' cannot be known until the value of `I' has been
15872 determined. Therefore, `E' must be considered dependent. */
15873 scope
= TYPE_CONTEXT (type
);
15874 if (scope
&& TYPE_P (scope
))
15875 return dependent_type_p (scope
);
15876 else if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
)
15877 return type_dependent_expression_p (scope
);
15879 /* Other types are non-dependent. */
15883 /* Returns TRUE if TYPE is dependent, in the sense of
15884 [temp.dep.type]. */
15887 dependent_type_p (tree type
)
15889 /* If there are no template parameters in scope, then there can't be
15890 any dependent types. */
15891 if (!processing_template_decl
)
15893 /* If we are not processing a template, then nobody should be
15894 providing us with a dependent type. */
15896 gcc_assert (TREE_CODE (type
) != TEMPLATE_TYPE_PARM
|| is_auto (type
));
15900 /* If the type is NULL, we have not computed a type for the entity
15901 in question; in that case, the type is dependent. */
15905 /* Erroneous types can be considered non-dependent. */
15906 if (type
== error_mark_node
)
15909 /* If we have not already computed the appropriate value for TYPE,
15911 if (!TYPE_DEPENDENT_P_VALID (type
))
15913 TYPE_DEPENDENT_P (type
) = dependent_type_p_r (type
);
15914 TYPE_DEPENDENT_P_VALID (type
) = 1;
15917 return TYPE_DEPENDENT_P (type
);
15920 /* Returns TRUE if EXPRESSION is dependent, according to CRITERION. */
15923 dependent_scope_ref_p (tree expression
, bool criterion (tree
))
15928 gcc_assert (TREE_CODE (expression
) == SCOPE_REF
);
15930 if (!TYPE_P (TREE_OPERAND (expression
, 0)))
15933 scope
= TREE_OPERAND (expression
, 0);
15934 name
= TREE_OPERAND (expression
, 1);
15938 An id-expression is type-dependent if it contains a
15939 nested-name-specifier that contains a class-name that names a
15941 /* The suggested resolution to Core Issue 2 implies that if the
15942 qualifying type is the current class, then we must peek
15945 && currently_open_class (scope
)
15946 && !criterion (name
))
15948 if (dependent_type_p (scope
))
15954 /* Returns TRUE if the EXPRESSION is value-dependent, in the sense of
15955 [temp.dep.constexpr]. EXPRESSION is already known to be a constant
15959 value_dependent_expression_p (tree expression
)
15961 if (!processing_template_decl
)
15964 /* A name declared with a dependent type. */
15965 if (DECL_P (expression
) && type_dependent_expression_p (expression
))
15968 switch (TREE_CODE (expression
))
15970 case IDENTIFIER_NODE
:
15971 /* A name that has not been looked up -- must be dependent. */
15974 case TEMPLATE_PARM_INDEX
:
15975 /* A non-type template parm. */
15979 /* A non-type template parm. */
15980 if (DECL_TEMPLATE_PARM_P (expression
))
15982 return value_dependent_expression_p (DECL_INITIAL (expression
));
15985 /* A constant with integral or enumeration type and is initialized
15986 with an expression that is value-dependent. */
15987 if (DECL_INITIAL (expression
)
15988 && INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (expression
))
15989 && value_dependent_expression_p (DECL_INITIAL (expression
)))
15993 case DYNAMIC_CAST_EXPR
:
15994 case STATIC_CAST_EXPR
:
15995 case CONST_CAST_EXPR
:
15996 case REINTERPRET_CAST_EXPR
:
15998 /* These expressions are value-dependent if the type to which
15999 the cast occurs is dependent or the expression being casted
16000 is value-dependent. */
16002 tree type
= TREE_TYPE (expression
);
16004 if (dependent_type_p (type
))
16007 /* A functional cast has a list of operands. */
16008 expression
= TREE_OPERAND (expression
, 0);
16011 /* If there are no operands, it must be an expression such
16012 as "int()". This should not happen for aggregate types
16013 because it would form non-constant expressions. */
16014 gcc_assert (INTEGRAL_OR_ENUMERATION_TYPE_P (type
));
16019 if (TREE_CODE (expression
) == TREE_LIST
)
16020 return any_value_dependent_elements_p (expression
);
16022 return value_dependent_expression_p (expression
);
16027 /* A `sizeof' expression is value-dependent if the operand is
16028 type-dependent or is a pack expansion. */
16029 expression
= TREE_OPERAND (expression
, 0);
16030 if (PACK_EXPANSION_P (expression
))
16032 else if (TYPE_P (expression
))
16033 return dependent_type_p (expression
);
16034 return type_dependent_expression_p (expression
);
16037 return dependent_scope_ref_p (expression
, value_dependent_expression_p
);
16039 case COMPONENT_REF
:
16040 return (value_dependent_expression_p (TREE_OPERAND (expression
, 0))
16041 || value_dependent_expression_p (TREE_OPERAND (expression
, 1)));
16044 /* A CALL_EXPR may appear in a constant expression if it is a
16045 call to a builtin function, e.g., __builtin_constant_p. All
16046 such calls are value-dependent. */
16049 case NONTYPE_ARGUMENT_PACK
:
16050 /* A NONTYPE_ARGUMENT_PACK is value-dependent if any packed argument
16051 is value-dependent. */
16053 tree values
= ARGUMENT_PACK_ARGS (expression
);
16054 int i
, len
= TREE_VEC_LENGTH (values
);
16056 for (i
= 0; i
< len
; ++i
)
16057 if (value_dependent_expression_p (TREE_VEC_ELT (values
, i
)))
16065 tree type2
= TRAIT_EXPR_TYPE2 (expression
);
16066 return (dependent_type_p (TRAIT_EXPR_TYPE1 (expression
))
16067 || (type2
? dependent_type_p (type2
) : false));
16071 return ((value_dependent_expression_p (TREE_OPERAND (expression
, 0)))
16072 || (value_dependent_expression_p (TREE_OPERAND (expression
, 2))));
16075 /* A constant expression is value-dependent if any subexpression is
16076 value-dependent. */
16077 switch (TREE_CODE_CLASS (TREE_CODE (expression
)))
16079 case tcc_reference
:
16081 return (value_dependent_expression_p
16082 (TREE_OPERAND (expression
, 0)));
16084 case tcc_comparison
:
16086 return ((value_dependent_expression_p
16087 (TREE_OPERAND (expression
, 0)))
16088 || (value_dependent_expression_p
16089 (TREE_OPERAND (expression
, 1))));
16091 case tcc_expression
:
16095 for (i
= 0; i
< TREE_OPERAND_LENGTH (expression
); ++i
)
16096 /* In some cases, some of the operands may be missing.
16097 (For example, in the case of PREDECREMENT_EXPR, the
16098 amount to increment by may be missing.) That doesn't
16099 make the expression dependent. */
16100 if (TREE_OPERAND (expression
, i
)
16101 && (value_dependent_expression_p
16102 (TREE_OPERAND (expression
, i
))))
16112 /* The expression is not value-dependent. */
16116 /* Returns TRUE if the EXPRESSION is type-dependent, in the sense of
16117 [temp.dep.expr]. */
16120 type_dependent_expression_p (tree expression
)
16122 if (!processing_template_decl
)
16125 if (expression
== error_mark_node
)
16128 /* An unresolved name is always dependent. */
16129 if (TREE_CODE (expression
) == IDENTIFIER_NODE
16130 || TREE_CODE (expression
) == USING_DECL
)
16133 /* Some expression forms are never type-dependent. */
16134 if (TREE_CODE (expression
) == PSEUDO_DTOR_EXPR
16135 || TREE_CODE (expression
) == SIZEOF_EXPR
16136 || TREE_CODE (expression
) == ALIGNOF_EXPR
16137 || TREE_CODE (expression
) == TRAIT_EXPR
16138 || TREE_CODE (expression
) == TYPEID_EXPR
16139 || TREE_CODE (expression
) == DELETE_EXPR
16140 || TREE_CODE (expression
) == VEC_DELETE_EXPR
16141 || TREE_CODE (expression
) == THROW_EXPR
)
16144 /* The types of these expressions depends only on the type to which
16145 the cast occurs. */
16146 if (TREE_CODE (expression
) == DYNAMIC_CAST_EXPR
16147 || TREE_CODE (expression
) == STATIC_CAST_EXPR
16148 || TREE_CODE (expression
) == CONST_CAST_EXPR
16149 || TREE_CODE (expression
) == REINTERPRET_CAST_EXPR
16150 || TREE_CODE (expression
) == CAST_EXPR
)
16151 return dependent_type_p (TREE_TYPE (expression
));
16153 /* The types of these expressions depends only on the type created
16154 by the expression. */
16155 if (TREE_CODE (expression
) == NEW_EXPR
16156 || TREE_CODE (expression
) == VEC_NEW_EXPR
)
16158 /* For NEW_EXPR tree nodes created inside a template, either
16159 the object type itself or a TREE_LIST may appear as the
16161 tree type
= TREE_OPERAND (expression
, 1);
16162 if (TREE_CODE (type
) == TREE_LIST
)
16163 /* This is an array type. We need to check array dimensions
16165 return dependent_type_p (TREE_VALUE (TREE_PURPOSE (type
)))
16166 || value_dependent_expression_p
16167 (TREE_OPERAND (TREE_VALUE (type
), 1));
16169 return dependent_type_p (type
);
16172 if (TREE_CODE (expression
) == SCOPE_REF
16173 && dependent_scope_ref_p (expression
,
16174 type_dependent_expression_p
))
16177 if (TREE_CODE (expression
) == FUNCTION_DECL
16178 && DECL_LANG_SPECIFIC (expression
)
16179 && DECL_TEMPLATE_INFO (expression
)
16180 && (any_dependent_template_arguments_p
16181 (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (expression
)))))
16184 if (TREE_CODE (expression
) == TEMPLATE_DECL
16185 && !DECL_TEMPLATE_TEMPLATE_PARM_P (expression
))
16188 if (TREE_CODE (expression
) == STMT_EXPR
)
16189 expression
= stmt_expr_value_expr (expression
);
16191 if (BRACE_ENCLOSED_INITIALIZER_P (expression
))
16196 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expression
), i
, elt
)
16198 if (type_dependent_expression_p (elt
))
16204 if (TREE_TYPE (expression
) == unknown_type_node
)
16206 if (TREE_CODE (expression
) == ADDR_EXPR
)
16207 return type_dependent_expression_p (TREE_OPERAND (expression
, 0));
16208 if (TREE_CODE (expression
) == COMPONENT_REF
16209 || TREE_CODE (expression
) == OFFSET_REF
)
16211 if (type_dependent_expression_p (TREE_OPERAND (expression
, 0)))
16213 expression
= TREE_OPERAND (expression
, 1);
16214 if (TREE_CODE (expression
) == IDENTIFIER_NODE
)
16217 /* SCOPE_REF with non-null TREE_TYPE is always non-dependent. */
16218 if (TREE_CODE (expression
) == SCOPE_REF
)
16221 if (TREE_CODE (expression
) == BASELINK
)
16222 expression
= BASELINK_FUNCTIONS (expression
);
16224 if (TREE_CODE (expression
) == TEMPLATE_ID_EXPR
)
16226 if (any_dependent_template_arguments_p
16227 (TREE_OPERAND (expression
, 1)))
16229 expression
= TREE_OPERAND (expression
, 0);
16231 gcc_assert (TREE_CODE (expression
) == OVERLOAD
16232 || TREE_CODE (expression
) == FUNCTION_DECL
);
16236 if (type_dependent_expression_p (OVL_CURRENT (expression
)))
16238 expression
= OVL_NEXT (expression
);
16243 gcc_assert (TREE_CODE (expression
) != TYPE_DECL
);
16245 return (dependent_type_p (TREE_TYPE (expression
)));
16248 /* Returns TRUE if ARGS (a TREE_LIST of arguments to a function call)
16249 contains a type-dependent expression. */
16252 any_type_dependent_arguments_p (const_tree args
)
16256 tree arg
= TREE_VALUE (args
);
16258 if (type_dependent_expression_p (arg
))
16260 args
= TREE_CHAIN (args
);
16265 /* Returns TRUE if LIST (a TREE_LIST whose TREE_VALUEs are
16266 expressions) contains any value-dependent expressions. */
16269 any_value_dependent_elements_p (const_tree list
)
16271 for (; list
; list
= TREE_CHAIN (list
))
16272 if (value_dependent_expression_p (TREE_VALUE (list
)))
16278 /* Returns TRUE if the ARG (a template argument) is dependent. */
16281 dependent_template_arg_p (tree arg
)
16283 if (!processing_template_decl
)
16286 if (TREE_CODE (arg
) == TEMPLATE_DECL
16287 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
16288 return dependent_template_p (arg
);
16289 else if (ARGUMENT_PACK_P (arg
))
16291 tree args
= ARGUMENT_PACK_ARGS (arg
);
16292 int i
, len
= TREE_VEC_LENGTH (args
);
16293 for (i
= 0; i
< len
; ++i
)
16295 if (dependent_template_arg_p (TREE_VEC_ELT (args
, i
)))
16301 else if (TYPE_P (arg
))
16302 return dependent_type_p (arg
);
16304 return (type_dependent_expression_p (arg
)
16305 || value_dependent_expression_p (arg
));
16308 /* Returns true if ARGS (a collection of template arguments) contains
16309 any types that require structural equality testing. */
16312 any_template_arguments_need_structural_equality_p (tree args
)
16319 if (args
== error_mark_node
)
16322 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
16324 tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
16325 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
16327 tree arg
= TREE_VEC_ELT (level
, j
);
16328 tree packed_args
= NULL_TREE
;
16331 if (ARGUMENT_PACK_P (arg
))
16333 /* Look inside the argument pack. */
16334 packed_args
= ARGUMENT_PACK_ARGS (arg
);
16335 len
= TREE_VEC_LENGTH (packed_args
);
16338 for (k
= 0; k
< len
; ++k
)
16341 arg
= TREE_VEC_ELT (packed_args
, k
);
16343 if (error_operand_p (arg
))
16345 else if (TREE_CODE (arg
) == TEMPLATE_DECL
16346 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
16348 else if (TYPE_P (arg
) && TYPE_STRUCTURAL_EQUALITY_P (arg
))
16350 else if (!TYPE_P (arg
) && TREE_TYPE (arg
)
16351 && TYPE_STRUCTURAL_EQUALITY_P (TREE_TYPE (arg
)))
16360 /* Returns true if ARGS (a collection of template arguments) contains
16361 any dependent arguments. */
16364 any_dependent_template_arguments_p (const_tree args
)
16371 if (args
== error_mark_node
)
16374 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
16376 const_tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
16377 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
16378 if (dependent_template_arg_p (TREE_VEC_ELT (level
, j
)))
16385 /* Returns TRUE if the template TMPL is dependent. */
16388 dependent_template_p (tree tmpl
)
16390 if (TREE_CODE (tmpl
) == OVERLOAD
)
16394 if (dependent_template_p (OVL_FUNCTION (tmpl
)))
16396 tmpl
= OVL_CHAIN (tmpl
);
16401 /* Template template parameters are dependent. */
16402 if (DECL_TEMPLATE_TEMPLATE_PARM_P (tmpl
)
16403 || TREE_CODE (tmpl
) == TEMPLATE_TEMPLATE_PARM
)
16405 /* So are names that have not been looked up. */
16406 if (TREE_CODE (tmpl
) == SCOPE_REF
16407 || TREE_CODE (tmpl
) == IDENTIFIER_NODE
)
16409 /* So are member templates of dependent classes. */
16410 if (TYPE_P (CP_DECL_CONTEXT (tmpl
)))
16411 return dependent_type_p (DECL_CONTEXT (tmpl
));
16415 /* Returns TRUE if the specialization TMPL<ARGS> is dependent. */
16418 dependent_template_id_p (tree tmpl
, tree args
)
16420 return (dependent_template_p (tmpl
)
16421 || any_dependent_template_arguments_p (args
));
16424 /* Returns TRUE if OMP_FOR with DECLV, INITV, CONDV and INCRV vectors
16428 dependent_omp_for_p (tree declv
, tree initv
, tree condv
, tree incrv
)
16432 if (!processing_template_decl
)
16435 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
16437 tree decl
= TREE_VEC_ELT (declv
, i
);
16438 tree init
= TREE_VEC_ELT (initv
, i
);
16439 tree cond
= TREE_VEC_ELT (condv
, i
);
16440 tree incr
= TREE_VEC_ELT (incrv
, i
);
16442 if (type_dependent_expression_p (decl
))
16445 if (init
&& type_dependent_expression_p (init
))
16448 if (type_dependent_expression_p (cond
))
16451 if (COMPARISON_CLASS_P (cond
)
16452 && (type_dependent_expression_p (TREE_OPERAND (cond
, 0))
16453 || type_dependent_expression_p (TREE_OPERAND (cond
, 1))))
16456 if (TREE_CODE (incr
) == MODOP_EXPR
)
16458 if (type_dependent_expression_p (TREE_OPERAND (incr
, 0))
16459 || type_dependent_expression_p (TREE_OPERAND (incr
, 2)))
16462 else if (type_dependent_expression_p (incr
))
16464 else if (TREE_CODE (incr
) == MODIFY_EXPR
)
16466 if (type_dependent_expression_p (TREE_OPERAND (incr
, 0)))
16468 else if (BINARY_CLASS_P (TREE_OPERAND (incr
, 1)))
16470 tree t
= TREE_OPERAND (incr
, 1);
16471 if (type_dependent_expression_p (TREE_OPERAND (t
, 0))
16472 || type_dependent_expression_p (TREE_OPERAND (t
, 1)))
16481 /* TYPE is a TYPENAME_TYPE. Returns the ordinary TYPE to which the
16482 TYPENAME_TYPE corresponds. Returns the original TYPENAME_TYPE if
16483 no such TYPE can be found. Note that this function peers inside
16484 uninstantiated templates and therefore should be used only in
16485 extremely limited situations. ONLY_CURRENT_P restricts this
16486 peering to the currently open classes hierarchy (which is required
16487 when comparing types). */
16490 resolve_typename_type (tree type
, bool only_current_p
)
16499 gcc_assert (TREE_CODE (type
) == TYPENAME_TYPE
);
16501 scope
= TYPE_CONTEXT (type
);
16502 name
= TYPE_IDENTIFIER (type
);
16504 /* If the SCOPE is itself a TYPENAME_TYPE, then we need to resolve
16505 it first before we can figure out what NAME refers to. */
16506 if (TREE_CODE (scope
) == TYPENAME_TYPE
)
16507 scope
= resolve_typename_type (scope
, only_current_p
);
16508 /* If we don't know what SCOPE refers to, then we cannot resolve the
16510 if (TREE_CODE (scope
) == TYPENAME_TYPE
)
16512 /* If the SCOPE is a template type parameter, we have no way of
16513 resolving the name. */
16514 if (TREE_CODE (scope
) == TEMPLATE_TYPE_PARM
)
16516 /* If the SCOPE is not the current instantiation, there's no reason
16517 to look inside it. */
16518 if (only_current_p
&& !currently_open_class (scope
))
16520 /* If SCOPE isn't the template itself, it will not have a valid
16521 TYPE_FIELDS list. */
16522 if (same_type_p (scope
, CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope
)))
16523 /* scope is either the template itself or a compatible instantiation
16524 like X<T>, so look up the name in the original template. */
16525 scope
= CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope
);
16527 /* scope is a partial instantiation, so we can't do the lookup or we
16528 will lose the template arguments. */
16530 /* Enter the SCOPE so that name lookup will be resolved as if we
16531 were in the class definition. In particular, SCOPE will no
16532 longer be considered a dependent type. */
16533 pushed_scope
= push_scope (scope
);
16534 /* Look up the declaration. */
16535 decl
= lookup_member (scope
, name
, /*protect=*/0, /*want_type=*/true);
16537 result
= NULL_TREE
;
16539 /* For a TYPENAME_TYPE like "typename X::template Y<T>", we want to
16540 find a TEMPLATE_DECL. Otherwise, we want to find a TYPE_DECL. */
16543 else if (TREE_CODE (TYPENAME_TYPE_FULLNAME (type
)) == IDENTIFIER_NODE
16544 && TREE_CODE (decl
) == TYPE_DECL
)
16546 result
= TREE_TYPE (decl
);
16547 if (result
== error_mark_node
)
16548 result
= NULL_TREE
;
16550 else if (TREE_CODE (TYPENAME_TYPE_FULLNAME (type
)) == TEMPLATE_ID_EXPR
16551 && DECL_CLASS_TEMPLATE_P (decl
))
16555 /* Obtain the template and the arguments. */
16556 tmpl
= TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type
), 0);
16557 args
= TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type
), 1);
16558 /* Instantiate the template. */
16559 result
= lookup_template_class (tmpl
, args
, NULL_TREE
, NULL_TREE
,
16560 /*entering_scope=*/0,
16561 tf_error
| tf_user
);
16562 if (result
== error_mark_node
)
16563 result
= NULL_TREE
;
16566 /* Leave the SCOPE. */
16568 pop_scope (pushed_scope
);
16570 /* If we failed to resolve it, return the original typename. */
16574 /* If lookup found a typename type, resolve that too. */
16575 if (TREE_CODE (result
) == TYPENAME_TYPE
&& !TYPENAME_IS_RESOLVING_P (result
))
16577 /* Ill-formed programs can cause infinite recursion here, so we
16578 must catch that. */
16579 TYPENAME_IS_RESOLVING_P (type
) = 1;
16580 result
= resolve_typename_type (result
, only_current_p
);
16581 TYPENAME_IS_RESOLVING_P (type
) = 0;
16584 /* Qualify the resulting type. */
16585 quals
= cp_type_quals (type
);
16587 result
= cp_build_qualified_type (result
, cp_type_quals (result
) | quals
);
16592 /* EXPR is an expression which is not type-dependent. Return a proxy
16593 for EXPR that can be used to compute the types of larger
16594 expressions containing EXPR. */
16597 build_non_dependent_expr (tree expr
)
16601 /* Preserve null pointer constants so that the type of things like
16602 "p == 0" where "p" is a pointer can be determined. */
16603 if (null_ptr_cst_p (expr
))
16605 /* Preserve OVERLOADs; the functions must be available to resolve
16608 if (TREE_CODE (inner_expr
) == STMT_EXPR
)
16609 inner_expr
= stmt_expr_value_expr (inner_expr
);
16610 if (TREE_CODE (inner_expr
) == ADDR_EXPR
)
16611 inner_expr
= TREE_OPERAND (inner_expr
, 0);
16612 if (TREE_CODE (inner_expr
) == COMPONENT_REF
)
16613 inner_expr
= TREE_OPERAND (inner_expr
, 1);
16614 if (is_overloaded_fn (inner_expr
)
16615 || TREE_CODE (inner_expr
) == OFFSET_REF
)
16617 /* There is no need to return a proxy for a variable. */
16618 if (TREE_CODE (expr
) == VAR_DECL
)
16620 /* Preserve string constants; conversions from string constants to
16621 "char *" are allowed, even though normally a "const char *"
16622 cannot be used to initialize a "char *". */
16623 if (TREE_CODE (expr
) == STRING_CST
)
16625 /* Preserve arithmetic constants, as an optimization -- there is no
16626 reason to create a new node. */
16627 if (TREE_CODE (expr
) == INTEGER_CST
|| TREE_CODE (expr
) == REAL_CST
)
16629 /* Preserve THROW_EXPRs -- all throw-expressions have type "void".
16630 There is at least one place where we want to know that a
16631 particular expression is a throw-expression: when checking a ?:
16632 expression, there are special rules if the second or third
16633 argument is a throw-expression. */
16634 if (TREE_CODE (expr
) == THROW_EXPR
)
16637 if (TREE_CODE (expr
) == COND_EXPR
)
16638 return build3 (COND_EXPR
,
16640 TREE_OPERAND (expr
, 0),
16641 (TREE_OPERAND (expr
, 1)
16642 ? build_non_dependent_expr (TREE_OPERAND (expr
, 1))
16643 : build_non_dependent_expr (TREE_OPERAND (expr
, 0))),
16644 build_non_dependent_expr (TREE_OPERAND (expr
, 2)));
16645 if (TREE_CODE (expr
) == COMPOUND_EXPR
16646 && !COMPOUND_EXPR_OVERLOADED (expr
))
16647 return build2 (COMPOUND_EXPR
,
16649 TREE_OPERAND (expr
, 0),
16650 build_non_dependent_expr (TREE_OPERAND (expr
, 1)));
16652 /* If the type is unknown, it can't really be non-dependent */
16653 gcc_assert (TREE_TYPE (expr
) != unknown_type_node
);
16655 /* Otherwise, build a NON_DEPENDENT_EXPR.
16657 REFERENCE_TYPEs are not stripped for expressions in templates
16658 because doing so would play havoc with mangling. Consider, for
16661 template <typename T> void f<T& g>() { g(); }
16663 In the body of "f", the expression for "g" will have
16664 REFERENCE_TYPE, even though the standard says that it should
16665 not. The reason is that we must preserve the syntactic form of
16666 the expression so that mangling (say) "f<g>" inside the body of
16667 "f" works out correctly. Therefore, the REFERENCE_TYPE is
16669 return build1 (NON_DEPENDENT_EXPR
, non_reference (TREE_TYPE (expr
)), expr
);
16672 /* ARGS is a TREE_LIST of expressions as arguments to a function call.
16673 Return a new TREE_LIST with the various arguments replaced with
16674 equivalent non-dependent expressions. */
16677 build_non_dependent_args (tree args
)
16682 new_args
= NULL_TREE
;
16683 for (a
= args
; a
; a
= TREE_CHAIN (a
))
16684 new_args
= tree_cons (NULL_TREE
,
16685 build_non_dependent_expr (TREE_VALUE (a
)),
16687 return nreverse (new_args
);
16690 /* Returns a type which represents 'auto'. We use a TEMPLATE_TYPE_PARM
16691 with a level one deeper than the actual template parms. */
16698 /* ??? Is it worth caching this for multiple autos at the same level? */
16699 au
= cxx_make_type (TEMPLATE_TYPE_PARM
);
16700 TYPE_NAME (au
) = build_decl (TYPE_DECL
, get_identifier ("auto"), au
);
16701 TYPE_STUB_DECL (au
) = TYPE_NAME (au
);
16702 TEMPLATE_TYPE_PARM_INDEX (au
) = build_template_parm_index
16703 (0, processing_template_decl
+ 1, processing_template_decl
+ 1,
16704 TYPE_NAME (au
), NULL_TREE
);
16705 TYPE_CANONICAL (au
) = canonical_type_parameter (au
);
16706 DECL_ARTIFICIAL (TYPE_NAME (au
)) = 1;
16707 SET_DECL_TEMPLATE_PARM_P (TYPE_NAME (au
));
16712 /* Replace auto in TYPE with std::initializer_list<auto>. */
16715 listify_autos (tree type
, tree auto_node
)
16717 tree std_init_list
= namespace_binding
16718 (get_identifier ("initializer_list"), std_node
);
16721 if (!std_init_list
|| !DECL_CLASS_TEMPLATE_P (std_init_list
))
16723 error ("deducing auto from brace-enclosed initializer list requires "
16724 "#include <initializer_list>");
16725 return error_mark_node
;
16727 argvec
= make_tree_vec (1);
16728 TREE_VEC_ELT (argvec
, 0) = auto_node
;
16729 init_auto
= lookup_template_class (std_init_list
, argvec
, NULL_TREE
,
16730 NULL_TREE
, 0, tf_warning_or_error
);
16732 TREE_VEC_ELT (argvec
, 0) = init_auto
;
16733 if (processing_template_decl
)
16734 argvec
= add_to_template_args (current_template_args (), argvec
);
16735 return tsubst (type
, argvec
, tf_warning_or_error
, NULL_TREE
);
16738 /* Replace occurrences of 'auto' in TYPE with the appropriate type deduced
16739 from INIT. AUTO_NODE is the TEMPLATE_TYPE_PARM used for 'auto' in TYPE. */
16742 do_auto_deduction (tree type
, tree init
, tree auto_node
)
16744 tree parms
, args
, tparms
, targs
;
16747 /* [dcl.spec.auto]: Obtain P from T by replacing the occurrences of auto
16748 with either a new invented type template parameter U or, if the
16749 initializer is a braced-init-list (8.5.4), with
16750 std::initializer_list<U>. */
16751 if (BRACE_ENCLOSED_INITIALIZER_P (init
))
16752 type
= listify_autos (type
, auto_node
);
16754 parms
= build_tree_list (NULL_TREE
, type
);
16755 args
= build_tree_list (NULL_TREE
, init
);
16756 tparms
= make_tree_vec (1);
16757 targs
= make_tree_vec (1);
16758 TREE_VEC_ELT (tparms
, 0)
16759 = build_tree_list (NULL_TREE
, TYPE_NAME (auto_node
));
16760 val
= type_unification_real (tparms
, targs
, parms
, args
, 0,
16761 DEDUCE_CALL
, LOOKUP_NORMAL
);
16764 error ("unable to deduce %qT from %qE", type
, init
);
16765 return error_mark_node
;
16768 if (processing_template_decl
)
16769 targs
= add_to_template_args (current_template_args (), targs
);
16770 return tsubst (type
, targs
, tf_warning_or_error
, NULL_TREE
);
16773 /* Substitutes LATE_RETURN_TYPE for 'auto' in TYPE and returns the
16777 splice_late_return_type (tree type
, tree late_return_type
)
16781 if (late_return_type
== NULL_TREE
)
16783 argvec
= make_tree_vec (1);
16784 TREE_VEC_ELT (argvec
, 0) = late_return_type
;
16785 if (processing_template_decl
)
16786 argvec
= add_to_template_args (current_template_args (), argvec
);
16787 return tsubst (type
, argvec
, tf_warning_or_error
, NULL_TREE
);
16790 /* Returns true iff TYPE is a TEMPLATE_TYPE_PARM representing 'auto'. */
16793 is_auto (const_tree type
)
16795 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
16796 && TYPE_IDENTIFIER (type
) == get_identifier ("auto"))
16802 /* Returns true iff TYPE contains a use of 'auto'. Since auto can only
16803 appear as a type-specifier for the declaration in question, we don't
16804 have to look through the whole type. */
16807 type_uses_auto (tree type
)
16809 enum tree_code code
;
16810 if (is_auto (type
))
16813 code
= TREE_CODE (type
);
16815 if (code
== POINTER_TYPE
|| code
== REFERENCE_TYPE
16816 || code
== OFFSET_TYPE
|| code
== FUNCTION_TYPE
16817 || code
== METHOD_TYPE
|| code
== ARRAY_TYPE
)
16818 return type_uses_auto (TREE_TYPE (type
));
16820 if (TYPE_PTRMEMFUNC_P (type
))
16821 return type_uses_auto (TREE_TYPE (TREE_TYPE
16822 (TYPE_PTRMEMFUNC_FN_TYPE (type
))));
16827 #include "gt-cp-pt.h"