1 /* Handle parameterized types (templates) for GNU C++.
2 Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
3 2001, 2002, 2003, 2004, 2005, 2007, 2008, 2009
4 Free Software Foundation, Inc.
5 Written by Ken Raeburn (raeburn@cygnus.com) while at Watchmaker Computing.
6 Rewritten by Jason Merrill (jason@cygnus.com).
8 This file is part of GCC.
10 GCC is free software; you can redistribute it and/or modify
11 it under the terms of the GNU General Public License as published by
12 the Free Software Foundation; either version 3, or (at your option)
15 GCC is distributed in the hope that it will be useful,
16 but WITHOUT ANY WARRANTY; without even the implied warranty of
17 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
18 GNU General Public License for more details.
20 You should have received a copy of the GNU General Public License
21 along with GCC; see the file COPYING3. If not see
22 <http://www.gnu.org/licenses/>. */
24 /* Known bugs or deficiencies include:
26 all methods must be provided in header files; can't use a source
27 file that contains only the method templates and "just win". */
31 #include "coretypes.h"
35 #include "pointer-set.h"
39 #include "cp-objcp-common.h"
40 #include "tree-inline.h"
47 #include "tree-iterator.h"
50 /* The type of functions taking a tree, and some additional data, and
52 typedef int (*tree_fn_t
) (tree
, void*);
54 /* The PENDING_TEMPLATES is a TREE_LIST of templates whose
55 instantiations have been deferred, either because their definitions
56 were not yet available, or because we were putting off doing the work. */
57 struct GTY (()) pending_template
{
58 struct pending_template
*next
;
59 struct tinst_level
*tinst
;
62 static GTY(()) struct pending_template
*pending_templates
;
63 static GTY(()) struct pending_template
*last_pending_template
;
65 int processing_template_parmlist
;
66 static int template_header_count
;
68 static GTY(()) tree saved_trees
;
69 static VEC(int,heap
) *inline_parm_levels
;
71 static GTY(()) struct tinst_level
*current_tinst_level
;
73 static GTY(()) tree saved_access_scope
;
75 /* Live only within one (recursive) call to tsubst_expr. We use
76 this to pass the statement expression node from the STMT_EXPR
77 to the EXPR_STMT that is its result. */
78 static tree cur_stmt_expr
;
80 /* A map from local variable declarations in the body of the template
81 presently being instantiated to the corresponding instantiated
83 static htab_t local_specializations
;
85 /* Contains canonical template parameter types. The vector is indexed by
86 the TEMPLATE_TYPE_IDX of the template parameter. Each element is a
87 TREE_LIST, whose TREE_VALUEs contain the canonical template
88 parameters of various types and levels. */
89 static GTY(()) VEC(tree
,gc
) *canonical_template_parms
;
91 #define UNIFY_ALLOW_NONE 0
92 #define UNIFY_ALLOW_MORE_CV_QUAL 1
93 #define UNIFY_ALLOW_LESS_CV_QUAL 2
94 #define UNIFY_ALLOW_DERIVED 4
95 #define UNIFY_ALLOW_INTEGER 8
96 #define UNIFY_ALLOW_OUTER_LEVEL 16
97 #define UNIFY_ALLOW_OUTER_MORE_CV_QUAL 32
98 #define UNIFY_ALLOW_OUTER_LESS_CV_QUAL 64
100 static void push_access_scope (tree
);
101 static void pop_access_scope (tree
);
102 static bool resolve_overloaded_unification (tree
, tree
, tree
, tree
,
103 unification_kind_t
, int);
104 static int try_one_overload (tree
, tree
, tree
, tree
, tree
,
105 unification_kind_t
, int, bool);
106 static int unify (tree
, tree
, tree
, tree
, int);
107 static void add_pending_template (tree
);
108 static int push_tinst_level (tree
);
109 static void pop_tinst_level (void);
110 static tree
reopen_tinst_level (struct tinst_level
*);
111 static tree
tsubst_initializer_list (tree
, tree
);
112 static tree
get_class_bindings (tree
, tree
, tree
);
113 static tree
coerce_template_parms (tree
, tree
, tree
, tsubst_flags_t
,
115 static void tsubst_enum (tree
, tree
, tree
);
116 static tree
add_to_template_args (tree
, tree
);
117 static tree
add_outermost_template_args (tree
, tree
);
118 static bool check_instantiated_args (tree
, tree
, tsubst_flags_t
);
119 static int maybe_adjust_types_for_deduction (unification_kind_t
, tree
*, tree
*,
121 static int type_unification_real (tree
, tree
, tree
, const tree
*,
122 unsigned int, int, unification_kind_t
, int);
123 static void note_template_header (int);
124 static tree
convert_nontype_argument_function (tree
, tree
);
125 static tree
convert_nontype_argument (tree
, tree
);
126 static tree
convert_template_argument (tree
, tree
, tree
,
127 tsubst_flags_t
, int, tree
);
128 static int for_each_template_parm (tree
, tree_fn_t
, void*,
129 struct pointer_set_t
*, bool);
130 static tree
expand_template_argument_pack (tree
);
131 static tree
build_template_parm_index (int, int, int, tree
, tree
);
132 static bool inline_needs_template_parms (tree
);
133 static void push_inline_template_parms_recursive (tree
, int);
134 static tree
retrieve_local_specialization (tree
);
135 static void register_local_specialization (tree
, tree
);
136 static tree
reduce_template_parm_level (tree
, tree
, int, tree
, tsubst_flags_t
);
137 static int mark_template_parm (tree
, void *);
138 static int template_parm_this_level_p (tree
, void *);
139 static tree
tsubst_friend_function (tree
, tree
);
140 static tree
tsubst_friend_class (tree
, tree
);
141 static int can_complete_type_without_circularity (tree
);
142 static tree
get_bindings (tree
, tree
, tree
, bool);
143 static int template_decl_level (tree
);
144 static int check_cv_quals_for_unify (int, tree
, tree
);
145 static void template_parm_level_and_index (tree
, int*, int*);
146 static int unify_pack_expansion (tree
, tree
, tree
, tree
, int, bool, bool);
147 static tree
tsubst_template_arg (tree
, tree
, tsubst_flags_t
, tree
);
148 static tree
tsubst_template_args (tree
, tree
, tsubst_flags_t
, tree
);
149 static tree
tsubst_template_parms (tree
, tree
, tsubst_flags_t
);
150 static void regenerate_decl_from_template (tree
, tree
);
151 static tree
most_specialized_class (tree
, tree
);
152 static tree
tsubst_aggr_type (tree
, tree
, tsubst_flags_t
, tree
, int);
153 static tree
tsubst_arg_types (tree
, tree
, tsubst_flags_t
, tree
);
154 static tree
tsubst_function_type (tree
, tree
, tsubst_flags_t
, tree
);
155 static bool check_specialization_scope (void);
156 static tree
process_partial_specialization (tree
);
157 static void set_current_access_from_decl (tree
);
158 static tree
get_template_base (tree
, tree
, tree
, tree
);
159 static tree
try_class_unification (tree
, tree
, tree
, tree
);
160 static int coerce_template_template_parms (tree
, tree
, tsubst_flags_t
,
162 static bool template_template_parm_bindings_ok_p (tree
, tree
);
163 static int template_args_equal (tree
, tree
);
164 static void tsubst_default_arguments (tree
);
165 static tree
for_each_template_parm_r (tree
*, int *, void *);
166 static tree
copy_default_args_to_explicit_spec_1 (tree
, tree
);
167 static void copy_default_args_to_explicit_spec (tree
);
168 static int invalid_nontype_parm_type_p (tree
, tsubst_flags_t
);
169 static int eq_local_specializations (const void *, const void *);
170 static bool dependent_template_arg_p (tree
);
171 static bool any_template_arguments_need_structural_equality_p (tree
);
172 static bool dependent_type_p_r (tree
);
173 static tree
tsubst_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
);
176 static tree
tsubst_decl (tree
, tree
, tsubst_flags_t
);
177 static void perform_typedefs_access_check (tree tmpl
, tree targs
);
178 static void append_type_to_template_for_access_check_1 (tree
, tree
, tree
);
180 /* Make the current scope suitable for access checking when we are
181 processing T. T can be FUNCTION_DECL for instantiated function
182 template, or VAR_DECL for static member variable (need by
183 instantiate_decl). */
186 push_access_scope (tree t
)
188 gcc_assert (TREE_CODE (t
) == FUNCTION_DECL
189 || TREE_CODE (t
) == VAR_DECL
);
191 if (DECL_FRIEND_CONTEXT (t
))
192 push_nested_class (DECL_FRIEND_CONTEXT (t
));
193 else if (DECL_CLASS_SCOPE_P (t
))
194 push_nested_class (DECL_CONTEXT (t
));
196 push_to_top_level ();
198 if (TREE_CODE (t
) == FUNCTION_DECL
)
200 saved_access_scope
= tree_cons
201 (NULL_TREE
, current_function_decl
, saved_access_scope
);
202 current_function_decl
= t
;
206 /* Restore the scope set up by push_access_scope. T is the node we
210 pop_access_scope (tree t
)
212 if (TREE_CODE (t
) == FUNCTION_DECL
)
214 current_function_decl
= TREE_VALUE (saved_access_scope
);
215 saved_access_scope
= TREE_CHAIN (saved_access_scope
);
218 if (DECL_FRIEND_CONTEXT (t
) || DECL_CLASS_SCOPE_P (t
))
221 pop_from_top_level ();
224 /* Do any processing required when DECL (a member template
225 declaration) is finished. Returns the TEMPLATE_DECL corresponding
226 to DECL, unless it is a specialization, in which case the DECL
227 itself is returned. */
230 finish_member_template_decl (tree decl
)
232 if (decl
== error_mark_node
)
233 return error_mark_node
;
235 gcc_assert (DECL_P (decl
));
237 if (TREE_CODE (decl
) == TYPE_DECL
)
241 type
= TREE_TYPE (decl
);
242 if (type
== error_mark_node
)
243 return error_mark_node
;
244 if (MAYBE_CLASS_TYPE_P (type
)
245 && CLASSTYPE_TEMPLATE_INFO (type
)
246 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
248 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
249 check_member_template (tmpl
);
254 else if (TREE_CODE (decl
) == FIELD_DECL
)
255 error ("data member %qD cannot be a member template", decl
);
256 else if (DECL_TEMPLATE_INFO (decl
))
258 if (!DECL_TEMPLATE_SPECIALIZATION (decl
))
260 check_member_template (DECL_TI_TEMPLATE (decl
));
261 return DECL_TI_TEMPLATE (decl
);
267 error ("invalid member template declaration %qD", decl
);
269 return error_mark_node
;
272 /* Return the template info node corresponding to T, whatever T is. */
275 get_template_info (tree t
)
277 tree tinfo
= NULL_TREE
;
279 if (DECL_P (t
) && DECL_LANG_SPECIFIC (t
))
280 tinfo
= DECL_TEMPLATE_INFO (t
);
282 if (!tinfo
&& TREE_CODE (t
) == TYPE_DECL
)
285 if (TAGGED_TYPE_P (t
))
286 tinfo
= TYPE_TEMPLATE_INFO (t
);
291 /* Returns the template nesting level of the indicated class TYPE.
301 A<T>::B<U> has depth two, while A<T> has depth one.
302 Both A<T>::B<int> and A<int>::B<U> have depth one, if
303 they are instantiations, not specializations.
305 This function is guaranteed to return 0 if passed NULL_TREE so
306 that, for example, `template_class_depth (current_class_type)' is
310 template_class_depth (tree type
)
315 type
&& TREE_CODE (type
) != NAMESPACE_DECL
;
316 type
= (TREE_CODE (type
) == FUNCTION_DECL
)
317 ? CP_DECL_CONTEXT (type
) : TYPE_CONTEXT (type
))
319 tree tinfo
= get_template_info (type
);
321 if (tinfo
&& PRIMARY_TEMPLATE_P (TI_TEMPLATE (tinfo
))
322 && uses_template_parms (INNERMOST_TEMPLATE_ARGS (TI_ARGS (tinfo
))))
329 /* Subroutine of maybe_begin_member_template_processing.
330 Returns true if processing DECL needs us to push template parms. */
333 inline_needs_template_parms (tree decl
)
335 if (! DECL_TEMPLATE_INFO (decl
))
338 return (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (most_general_template (decl
)))
339 > (processing_template_decl
+ DECL_TEMPLATE_SPECIALIZATION (decl
)));
342 /* Subroutine of maybe_begin_member_template_processing.
343 Push the template parms in PARMS, starting from LEVELS steps into the
344 chain, and ending at the beginning, since template parms are listed
348 push_inline_template_parms_recursive (tree parmlist
, int levels
)
350 tree parms
= TREE_VALUE (parmlist
);
354 push_inline_template_parms_recursive (TREE_CHAIN (parmlist
), levels
- 1);
356 ++processing_template_decl
;
357 current_template_parms
358 = tree_cons (size_int (processing_template_decl
),
359 parms
, current_template_parms
);
360 TEMPLATE_PARMS_FOR_INLINE (current_template_parms
) = 1;
362 begin_scope (TREE_VEC_LENGTH (parms
) ? sk_template_parms
: sk_template_spec
,
364 for (i
= 0; i
< TREE_VEC_LENGTH (parms
); ++i
)
366 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
368 if (parm
== error_mark_node
)
371 gcc_assert (DECL_P (parm
));
373 switch (TREE_CODE (parm
))
382 /* Make a CONST_DECL as is done in process_template_parm.
383 It is ugly that we recreate this here; the original
384 version built in process_template_parm is no longer
386 tree decl
= build_decl (DECL_SOURCE_LOCATION (parm
),
387 CONST_DECL
, DECL_NAME (parm
),
389 DECL_ARTIFICIAL (decl
) = 1;
390 TREE_CONSTANT (decl
) = 1;
391 TREE_READONLY (decl
) = 1;
392 DECL_INITIAL (decl
) = DECL_INITIAL (parm
);
393 SET_DECL_TEMPLATE_PARM_P (decl
);
404 /* Restore the template parameter context for a member template or
405 a friend template defined in a class definition. */
408 maybe_begin_member_template_processing (tree decl
)
413 if (inline_needs_template_parms (decl
))
415 parms
= DECL_TEMPLATE_PARMS (most_general_template (decl
));
416 levels
= TMPL_PARMS_DEPTH (parms
) - processing_template_decl
;
418 if (DECL_TEMPLATE_SPECIALIZATION (decl
))
421 parms
= TREE_CHAIN (parms
);
424 push_inline_template_parms_recursive (parms
, levels
);
427 /* Remember how many levels of template parameters we pushed so that
428 we can pop them later. */
429 VEC_safe_push (int, heap
, inline_parm_levels
, levels
);
432 /* Undo the effects of maybe_begin_member_template_processing. */
435 maybe_end_member_template_processing (void)
440 if (VEC_length (int, inline_parm_levels
) == 0)
443 last
= VEC_pop (int, inline_parm_levels
);
444 for (i
= 0; i
< last
; ++i
)
446 --processing_template_decl
;
447 current_template_parms
= TREE_CHAIN (current_template_parms
);
452 /* Return a new template argument vector which contains all of ARGS,
453 but has as its innermost set of arguments the EXTRA_ARGS. */
456 add_to_template_args (tree args
, tree extra_args
)
463 extra_depth
= TMPL_ARGS_DEPTH (extra_args
);
464 new_args
= make_tree_vec (TMPL_ARGS_DEPTH (args
) + extra_depth
);
466 for (i
= 1; i
<= TMPL_ARGS_DEPTH (args
); ++i
)
467 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (args
, i
));
469 for (j
= 1; j
<= extra_depth
; ++j
, ++i
)
470 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (extra_args
, j
));
475 /* Like add_to_template_args, but only the outermost ARGS are added to
476 the EXTRA_ARGS. In particular, all but TMPL_ARGS_DEPTH
477 (EXTRA_ARGS) levels are added. This function is used to combine
478 the template arguments from a partial instantiation with the
479 template arguments used to attain the full instantiation from the
480 partial instantiation. */
483 add_outermost_template_args (tree args
, tree extra_args
)
487 /* If there are more levels of EXTRA_ARGS than there are ARGS,
488 something very fishy is going on. */
489 gcc_assert (TMPL_ARGS_DEPTH (args
) >= TMPL_ARGS_DEPTH (extra_args
));
491 /* If *all* the new arguments will be the EXTRA_ARGS, just return
493 if (TMPL_ARGS_DEPTH (args
) == TMPL_ARGS_DEPTH (extra_args
))
496 /* For the moment, we make ARGS look like it contains fewer levels. */
497 TREE_VEC_LENGTH (args
) -= TMPL_ARGS_DEPTH (extra_args
);
499 new_args
= add_to_template_args (args
, extra_args
);
501 /* Now, we restore ARGS to its full dimensions. */
502 TREE_VEC_LENGTH (args
) += TMPL_ARGS_DEPTH (extra_args
);
507 /* Return the N levels of innermost template arguments from the ARGS. */
510 get_innermost_template_args (tree args
, int n
)
518 /* If N is 1, just return the innermost set of template arguments. */
520 return TMPL_ARGS_LEVEL (args
, TMPL_ARGS_DEPTH (args
));
522 /* If we're not removing anything, just return the arguments we were
524 extra_levels
= TMPL_ARGS_DEPTH (args
) - n
;
525 gcc_assert (extra_levels
>= 0);
526 if (extra_levels
== 0)
529 /* Make a new set of arguments, not containing the outer arguments. */
530 new_args
= make_tree_vec (n
);
531 for (i
= 1; i
<= n
; ++i
)
532 SET_TMPL_ARGS_LEVEL (new_args
, i
,
533 TMPL_ARGS_LEVEL (args
, i
+ extra_levels
));
538 /* The inverse of get_innermost_template_args: Return all but the innermost
539 EXTRA_LEVELS levels of template arguments from the ARGS. */
542 strip_innermost_template_args (tree args
, int extra_levels
)
545 int n
= TMPL_ARGS_DEPTH (args
) - extra_levels
;
550 /* If N is 1, just return the outermost set of template arguments. */
552 return TMPL_ARGS_LEVEL (args
, 1);
554 /* If we're not removing anything, just return the arguments we were
556 gcc_assert (extra_levels
>= 0);
557 if (extra_levels
== 0)
560 /* Make a new set of arguments, not containing the inner arguments. */
561 new_args
= make_tree_vec (n
);
562 for (i
= 1; i
<= n
; ++i
)
563 SET_TMPL_ARGS_LEVEL (new_args
, i
,
564 TMPL_ARGS_LEVEL (args
, i
));
569 /* We've got a template header coming up; push to a new level for storing
573 begin_template_parm_list (void)
575 /* We use a non-tag-transparent scope here, which causes pushtag to
576 put tags in this scope, rather than in the enclosing class or
577 namespace scope. This is the right thing, since we want
578 TEMPLATE_DECLS, and not TYPE_DECLS for template classes. For a
579 global template class, push_template_decl handles putting the
580 TEMPLATE_DECL into top-level scope. For a nested template class,
583 template <class T> struct S1 {
584 template <class T> struct S2 {};
587 pushtag contains special code to call pushdecl_with_scope on the
588 TEMPLATE_DECL for S2. */
589 begin_scope (sk_template_parms
, NULL
);
590 ++processing_template_decl
;
591 ++processing_template_parmlist
;
592 note_template_header (0);
595 /* This routine is called when a specialization is declared. If it is
596 invalid to declare a specialization here, an error is reported and
597 false is returned, otherwise this routine will return true. */
600 check_specialization_scope (void)
602 tree scope
= current_scope ();
606 An explicit specialization shall be declared in the namespace of
607 which the template is a member, or, for member templates, in the
608 namespace of which the enclosing class or enclosing class
609 template is a member. An explicit specialization of a member
610 function, member class or static data member of a class template
611 shall be declared in the namespace of which the class template
613 if (scope
&& TREE_CODE (scope
) != NAMESPACE_DECL
)
615 error ("explicit specialization in non-namespace scope %qD", scope
);
621 In an explicit specialization declaration for a member of a class
622 template or a member template that appears in namespace scope,
623 the member template and some of its enclosing class templates may
624 remain unspecialized, except that the declaration shall not
625 explicitly specialize a class member template if its enclosing
626 class templates are not explicitly specialized as well. */
627 if (current_template_parms
)
629 error ("enclosing class templates are not explicitly specialized");
636 /* We've just seen template <>. */
639 begin_specialization (void)
641 begin_scope (sk_template_spec
, NULL
);
642 note_template_header (1);
643 return check_specialization_scope ();
646 /* Called at then end of processing a declaration preceded by
650 end_specialization (void)
653 reset_specialization ();
656 /* Any template <>'s that we have seen thus far are not referring to a
657 function specialization. */
660 reset_specialization (void)
662 processing_specialization
= 0;
663 template_header_count
= 0;
666 /* We've just seen a template header. If SPECIALIZATION is nonzero,
667 it was of the form template <>. */
670 note_template_header (int specialization
)
672 processing_specialization
= specialization
;
673 template_header_count
++;
676 /* We're beginning an explicit instantiation. */
679 begin_explicit_instantiation (void)
681 gcc_assert (!processing_explicit_instantiation
);
682 processing_explicit_instantiation
= true;
687 end_explicit_instantiation (void)
689 gcc_assert (processing_explicit_instantiation
);
690 processing_explicit_instantiation
= false;
693 /* An explicit specialization or partial specialization TMPL is being
694 declared. Check that the namespace in which the specialization is
695 occurring is permissible. Returns false iff it is invalid to
696 specialize TMPL in the current namespace. */
699 check_specialization_namespace (tree tmpl
)
701 tree tpl_ns
= decl_namespace_context (tmpl
);
705 An explicit specialization shall be declared in the namespace of
706 which the template is a member, or, for member templates, in the
707 namespace of which the enclosing class or enclosing class
708 template is a member. An explicit specialization of a member
709 function, member class or static data member of a class template
710 shall be declared in the namespace of which the class template is
712 if (is_associated_namespace (current_namespace
, tpl_ns
))
713 /* Same or super-using namespace. */
717 permerror (input_location
, "specialization of %qD in different namespace", tmpl
);
718 permerror (input_location
, " from definition of %q+#D", tmpl
);
723 /* SPEC is an explicit instantiation. Check that it is valid to
724 perform this explicit instantiation in the current namespace. */
727 check_explicit_instantiation_namespace (tree spec
)
731 /* DR 275: An explicit instantiation shall appear in an enclosing
732 namespace of its template. */
733 ns
= decl_namespace_context (spec
);
734 if (!is_ancestor (current_namespace
, ns
))
735 permerror (input_location
, "explicit instantiation of %qD in namespace %qD "
736 "(which does not enclose namespace %qD)",
737 spec
, current_namespace
, ns
);
740 /* The TYPE is being declared. If it is a template type, that means it
741 is a partial specialization. Do appropriate error-checking. */
744 maybe_process_partial_specialization (tree type
)
748 if (type
== error_mark_node
)
749 return error_mark_node
;
751 if (TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
753 error ("name of class shadows template template parameter %qD",
755 return error_mark_node
;
758 context
= TYPE_CONTEXT (type
);
760 if (CLASS_TYPE_P (type
) && CLASSTYPE_USE_TEMPLATE (type
))
762 /* This is for ordinary explicit specialization and partial
763 specialization of a template class such as:
765 template <> class C<int>;
769 template <class T> class C<T*>;
771 Make sure that `C<int>' and `C<T*>' are implicit instantiations. */
773 if (CLASSTYPE_IMPLICIT_INSTANTIATION (type
)
774 && !COMPLETE_TYPE_P (type
))
776 check_specialization_namespace (CLASSTYPE_TI_TEMPLATE (type
));
777 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type
);
778 if (processing_template_decl
)
780 if (push_template_decl (TYPE_MAIN_DECL (type
))
782 return error_mark_node
;
785 else if (CLASSTYPE_TEMPLATE_INSTANTIATION (type
))
786 error ("specialization of %qT after instantiation", type
);
788 else if (CLASS_TYPE_P (type
)
789 && !CLASSTYPE_USE_TEMPLATE (type
)
790 && CLASSTYPE_TEMPLATE_INFO (type
)
791 && context
&& CLASS_TYPE_P (context
)
792 && CLASSTYPE_TEMPLATE_INFO (context
))
794 /* This is for an explicit specialization of member class
795 template according to [temp.expl.spec/18]:
797 template <> template <class U> class C<int>::D;
799 The context `C<int>' must be an implicit instantiation.
800 Otherwise this is just a member class template declared
803 template <> class C<int> { template <class U> class D; };
804 template <> template <class U> class C<int>::D;
806 In the first case, `C<int>::D' is a specialization of `C<T>::D'
807 while in the second case, `C<int>::D' is a primary template
808 and `C<T>::D' may not exist. */
810 if (CLASSTYPE_IMPLICIT_INSTANTIATION (context
)
811 && !COMPLETE_TYPE_P (type
))
815 if (current_namespace
816 != decl_namespace_context (CLASSTYPE_TI_TEMPLATE (type
)))
818 permerror (input_location
, "specializing %q#T in different namespace", type
);
819 permerror (input_location
, " from definition of %q+#D",
820 CLASSTYPE_TI_TEMPLATE (type
));
823 /* Check for invalid specialization after instantiation:
825 template <> template <> class C<int>::D<int>;
826 template <> template <class U> class C<int>::D; */
828 for (t
= DECL_TEMPLATE_INSTANTIATIONS
829 (most_general_template (CLASSTYPE_TI_TEMPLATE (type
)));
830 t
; t
= TREE_CHAIN (t
))
831 if (TREE_VALUE (t
) != type
832 && TYPE_CONTEXT (TREE_VALUE (t
)) == context
)
833 error ("specialization %qT after instantiation %qT",
834 type
, TREE_VALUE (t
));
836 /* Mark TYPE as a specialization. And as a result, we only
837 have one level of template argument for the innermost
839 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type
);
840 CLASSTYPE_TI_ARGS (type
)
841 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type
));
844 else if (processing_specialization
)
846 error ("explicit specialization of non-template %qT", type
);
847 return error_mark_node
;
853 /* Returns nonzero if we can optimize the retrieval of specializations
854 for TMPL, a TEMPLATE_DECL. In particular, for such a template, we
855 do not use DECL_TEMPLATE_SPECIALIZATIONS at all. */
858 optimize_specialization_lookup_p (tree tmpl
)
860 return (DECL_FUNCTION_TEMPLATE_P (tmpl
)
861 && DECL_CLASS_SCOPE_P (tmpl
)
862 /* DECL_CLASS_SCOPE_P holds of T::f even if T is a template
864 && CLASS_TYPE_P (DECL_CONTEXT (tmpl
))
865 /* The optimized lookup depends on the fact that the
866 template arguments for the member function template apply
867 purely to the containing class, which is not true if the
868 containing class is an explicit or partial
870 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (tmpl
))
871 && !DECL_MEMBER_TEMPLATE_P (tmpl
)
872 && !DECL_CONV_FN_P (tmpl
)
873 /* It is possible to have a template that is not a member
874 template and is not a member of a template class:
876 template <typename T>
877 struct S { friend A::f(); };
879 Here, the friend function is a template, but the context does
880 not have template information. The optimized lookup relies
881 on having ARGS be the template arguments for both the class
882 and the function template. */
883 && !DECL_FRIEND_P (DECL_TEMPLATE_RESULT (tmpl
)));
886 /* Retrieve the specialization (in the sense of [temp.spec] - a
887 specialization is either an instantiation or an explicit
888 specialization) of TMPL for the given template ARGS. If there is
889 no such specialization, return NULL_TREE. The ARGS are a vector of
890 arguments, or a vector of vectors of arguments, in the case of
891 templates with more than one level of parameters.
893 If TMPL is a type template and CLASS_SPECIALIZATIONS_P is true,
894 then we search for a partial specialization matching ARGS. This
895 parameter is ignored if TMPL is not a class template. */
898 retrieve_specialization (tree tmpl
, tree args
,
899 bool class_specializations_p
)
901 if (args
== error_mark_node
)
904 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
);
906 /* There should be as many levels of arguments as there are
907 levels of parameters. */
908 gcc_assert (TMPL_ARGS_DEPTH (args
)
909 == TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
)));
911 if (optimize_specialization_lookup_p (tmpl
))
914 tree class_specialization
;
915 VEC(tree
,gc
) *methods
;
919 /* The template arguments actually apply to the containing
920 class. Find the class specialization with those
922 class_template
= CLASSTYPE_TI_TEMPLATE (DECL_CONTEXT (tmpl
));
924 = retrieve_specialization (class_template
, args
,
925 /*class_specializations_p=*/false);
926 if (!class_specialization
)
928 /* Now, find the appropriate entry in the CLASSTYPE_METHOD_VEC
929 for the specialization. */
930 idx
= class_method_index_for_fn (class_specialization
, tmpl
);
933 /* Iterate through the methods with the indicated name, looking
934 for the one that has an instance of TMPL. */
935 methods
= CLASSTYPE_METHOD_VEC (class_specialization
);
936 for (fns
= VEC_index (tree
, methods
, idx
); fns
; fns
= OVL_NEXT (fns
))
938 tree fn
= OVL_CURRENT (fns
);
939 if (DECL_TEMPLATE_INFO (fn
) && DECL_TI_TEMPLATE (fn
) == tmpl
)
949 /* Class templates store their instantiations on the
950 DECL_TEMPLATE_INSTANTIATIONS list; other templates use the
951 DECL_TEMPLATE_SPECIALIZATIONS list. */
952 if (!class_specializations_p
953 && TREE_CODE (DECL_TEMPLATE_RESULT (tmpl
)) == TYPE_DECL
954 && !is_typedef_decl (DECL_TEMPLATE_RESULT (tmpl
))
955 && TAGGED_TYPE_P (TREE_TYPE (tmpl
)))
956 sp
= &DECL_TEMPLATE_INSTANTIATIONS (tmpl
);
958 sp
= &DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
960 /* Iterate through the list until we find a matching template. */
961 while (*sp
!= NULL_TREE
)
965 if (comp_template_args (TREE_PURPOSE (spec
), args
))
967 /* Use the move-to-front heuristic to speed up future
971 *sp
= TREE_CHAIN (*sp
);
972 TREE_CHAIN (spec
) = *head
;
975 return TREE_VALUE (spec
);
977 sp
= &TREE_CHAIN (spec
);
984 /* Like retrieve_specialization, but for local declarations. */
987 retrieve_local_specialization (tree tmpl
)
991 if (local_specializations
== NULL
)
994 spec
= (tree
) htab_find_with_hash (local_specializations
, tmpl
,
995 htab_hash_pointer (tmpl
));
996 return spec
? TREE_PURPOSE (spec
) : NULL_TREE
;
999 /* Returns nonzero iff DECL is a specialization of TMPL. */
1002 is_specialization_of (tree decl
, tree tmpl
)
1006 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1010 t
= DECL_TEMPLATE_INFO (t
) ? DECL_TI_TEMPLATE (t
) : NULL_TREE
)
1016 gcc_assert (TREE_CODE (decl
) == TYPE_DECL
);
1018 for (t
= TREE_TYPE (decl
);
1020 t
= CLASSTYPE_USE_TEMPLATE (t
)
1021 ? TREE_TYPE (CLASSTYPE_TI_TEMPLATE (t
)) : NULL_TREE
)
1022 if (same_type_ignoring_top_level_qualifiers_p (t
, TREE_TYPE (tmpl
)))
1029 /* Returns nonzero iff DECL is a specialization of friend declaration
1030 FRIEND_DECL according to [temp.friend]. */
1033 is_specialization_of_friend (tree decl
, tree friend_decl
)
1035 bool need_template
= true;
1038 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
1039 || TREE_CODE (decl
) == TYPE_DECL
);
1041 /* For [temp.friend/6] when FRIEND_DECL is an ordinary member function
1042 of a template class, we want to check if DECL is a specialization
1044 if (TREE_CODE (friend_decl
) == FUNCTION_DECL
1045 && DECL_TEMPLATE_INFO (friend_decl
)
1046 && !DECL_USE_TEMPLATE (friend_decl
))
1048 /* We want a TEMPLATE_DECL for `is_specialization_of'. */
1049 friend_decl
= DECL_TI_TEMPLATE (friend_decl
);
1050 need_template
= false;
1052 else if (TREE_CODE (friend_decl
) == TEMPLATE_DECL
1053 && !PRIMARY_TEMPLATE_P (friend_decl
))
1054 need_template
= false;
1056 /* There is nothing to do if this is not a template friend. */
1057 if (TREE_CODE (friend_decl
) != TEMPLATE_DECL
)
1060 if (is_specialization_of (decl
, friend_decl
))
1064 A member of a class template may be declared to be a friend of a
1065 non-template class. In this case, the corresponding member of
1066 every specialization of the class template is a friend of the
1067 class granting friendship.
1069 For example, given a template friend declaration
1071 template <class T> friend void A<T>::f();
1073 the member function below is considered a friend
1075 template <> struct A<int> {
1079 For this type of template friend, TEMPLATE_DEPTH below will be
1080 nonzero. To determine if DECL is a friend of FRIEND, we first
1081 check if the enclosing class is a specialization of another. */
1083 template_depth
= template_class_depth (DECL_CONTEXT (friend_decl
));
1085 && DECL_CLASS_SCOPE_P (decl
)
1086 && is_specialization_of (TYPE_NAME (DECL_CONTEXT (decl
)),
1087 CLASSTYPE_TI_TEMPLATE (DECL_CONTEXT (friend_decl
))))
1089 /* Next, we check the members themselves. In order to handle
1090 a few tricky cases, such as when FRIEND_DECL's are
1092 template <class T> friend void A<T>::g(T t);
1093 template <class T> template <T t> friend void A<T>::h();
1097 void A<int>::g(int);
1098 template <int> void A<int>::h();
1100 we need to figure out ARGS, the template arguments from
1101 the context of DECL. This is required for template substitution
1102 of `T' in the function parameter of `g' and template parameter
1103 of `h' in the above examples. Here ARGS corresponds to `int'. */
1105 tree context
= DECL_CONTEXT (decl
);
1106 tree args
= NULL_TREE
;
1107 int current_depth
= 0;
1109 while (current_depth
< template_depth
)
1111 if (CLASSTYPE_TEMPLATE_INFO (context
))
1113 if (current_depth
== 0)
1114 args
= TYPE_TI_ARGS (context
);
1116 args
= add_to_template_args (TYPE_TI_ARGS (context
), args
);
1119 context
= TYPE_CONTEXT (context
);
1122 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1127 tree friend_args_type
;
1128 tree decl_args_type
;
1130 /* Make sure that both DECL and FRIEND_DECL are templates or
1132 is_template
= DECL_TEMPLATE_INFO (decl
)
1133 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl
));
1134 if (need_template
^ is_template
)
1136 else if (is_template
)
1138 /* If both are templates, check template parameter list. */
1140 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_decl
),
1142 if (!comp_template_parms
1143 (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (decl
)),
1147 decl_type
= TREE_TYPE (DECL_TI_TEMPLATE (decl
));
1150 decl_type
= TREE_TYPE (decl
);
1152 friend_type
= tsubst_function_type (TREE_TYPE (friend_decl
), args
,
1153 tf_none
, NULL_TREE
);
1154 if (friend_type
== error_mark_node
)
1157 /* Check if return types match. */
1158 if (!same_type_p (TREE_TYPE (decl_type
), TREE_TYPE (friend_type
)))
1161 /* Check if function parameter types match, ignoring the
1162 `this' parameter. */
1163 friend_args_type
= TYPE_ARG_TYPES (friend_type
);
1164 decl_args_type
= TYPE_ARG_TYPES (decl_type
);
1165 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (friend_decl
))
1166 friend_args_type
= TREE_CHAIN (friend_args_type
);
1167 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1168 decl_args_type
= TREE_CHAIN (decl_args_type
);
1170 return compparms (decl_args_type
, friend_args_type
);
1174 /* DECL is a TYPE_DECL */
1176 tree decl_type
= TREE_TYPE (decl
);
1178 /* Make sure that both DECL and FRIEND_DECL are templates or
1181 = CLASSTYPE_TEMPLATE_INFO (decl_type
)
1182 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (decl_type
));
1184 if (need_template
^ is_template
)
1186 else if (is_template
)
1189 /* If both are templates, check the name of the two
1190 TEMPLATE_DECL's first because is_friend didn't. */
1191 if (DECL_NAME (CLASSTYPE_TI_TEMPLATE (decl_type
))
1192 != DECL_NAME (friend_decl
))
1195 /* Now check template parameter list. */
1197 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_decl
),
1199 return comp_template_parms
1200 (DECL_TEMPLATE_PARMS (CLASSTYPE_TI_TEMPLATE (decl_type
)),
1204 return (DECL_NAME (decl
)
1205 == DECL_NAME (friend_decl
));
1211 /* Register the specialization SPEC as a specialization of TMPL with
1212 the indicated ARGS. IS_FRIEND indicates whether the specialization
1213 is actually just a friend declaration. Returns SPEC, or an
1214 equivalent prior declaration, if available. */
1217 register_specialization (tree spec
, tree tmpl
, tree args
, bool is_friend
)
1221 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
);
1223 if (TREE_CODE (spec
) == FUNCTION_DECL
1224 && uses_template_parms (DECL_TI_ARGS (spec
)))
1225 /* This is the FUNCTION_DECL for a partial instantiation. Don't
1226 register it; we want the corresponding TEMPLATE_DECL instead.
1227 We use `uses_template_parms (DECL_TI_ARGS (spec))' rather than
1228 the more obvious `uses_template_parms (spec)' to avoid problems
1229 with default function arguments. In particular, given
1230 something like this:
1232 template <class T> void f(T t1, T t = T())
1234 the default argument expression is not substituted for in an
1235 instantiation unless and until it is actually needed. */
1238 fn
= retrieve_specialization (tmpl
, args
,
1239 /*class_specializations_p=*/false);
1240 /* We can sometimes try to re-register a specialization that we've
1241 already got. In particular, regenerate_decl_from_template calls
1242 duplicate_decls which will update the specialization list. But,
1243 we'll still get called again here anyhow. It's more convenient
1244 to simply allow this than to try to prevent it. */
1247 else if (fn
&& DECL_TEMPLATE_SPECIALIZATION (spec
))
1249 if (DECL_TEMPLATE_INSTANTIATION (fn
))
1252 || DECL_EXPLICIT_INSTANTIATION (fn
))
1254 error ("specialization of %qD after instantiation",
1256 return error_mark_node
;
1261 /* This situation should occur only if the first
1262 specialization is an implicit instantiation, the
1263 second is an explicit specialization, and the
1264 implicit instantiation has not yet been used. That
1265 situation can occur if we have implicitly
1266 instantiated a member function and then specialized
1269 We can also wind up here if a friend declaration that
1270 looked like an instantiation turns out to be a
1273 template <class T> void foo(T);
1274 class S { friend void foo<>(int) };
1275 template <> void foo(int);
1277 We transform the existing DECL in place so that any
1278 pointers to it become pointers to the updated
1281 If there was a definition for the template, but not
1282 for the specialization, we want this to look as if
1283 there were no definition, and vice versa. */
1284 DECL_INITIAL (fn
) = NULL_TREE
;
1285 duplicate_decls (spec
, fn
, is_friend
);
1286 /* The call to duplicate_decls will have applied
1289 An explicit specialization of a function template
1290 is inline only if it is explicitly declared to be,
1291 and independently of whether its function template
1294 to the primary function; now copy the inline bits to
1295 the various clones. */
1296 FOR_EACH_CLONE (clone
, fn
)
1297 DECL_DECLARED_INLINE_P (clone
)
1298 = DECL_DECLARED_INLINE_P (fn
);
1299 check_specialization_namespace (fn
);
1304 else if (DECL_TEMPLATE_SPECIALIZATION (fn
))
1306 if (!duplicate_decls (spec
, fn
, is_friend
) && DECL_INITIAL (spec
))
1307 /* Dup decl failed, but this is a new definition. Set the
1308 line number so any errors match this new
1310 DECL_SOURCE_LOCATION (fn
) = DECL_SOURCE_LOCATION (spec
);
1316 /* A specialization must be declared in the same namespace as the
1317 template it is specializing. */
1318 if (DECL_TEMPLATE_SPECIALIZATION (spec
)
1319 && !check_specialization_namespace (tmpl
))
1320 DECL_CONTEXT (spec
) = DECL_CONTEXT (tmpl
);
1322 if (!optimize_specialization_lookup_p (tmpl
))
1323 DECL_TEMPLATE_SPECIALIZATIONS (tmpl
)
1324 = tree_cons (args
, spec
, DECL_TEMPLATE_SPECIALIZATIONS (tmpl
));
1329 /* Unregister the specialization SPEC as a specialization of TMPL.
1330 Replace it with NEW_SPEC, if NEW_SPEC is non-NULL. Returns true
1331 if the SPEC was listed as a specialization of TMPL. */
1334 reregister_specialization (tree spec
, tree tmpl
, tree new_spec
)
1338 for (s
= &DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
1340 s
= &TREE_CHAIN (*s
))
1341 if (TREE_VALUE (*s
) == spec
)
1344 *s
= TREE_CHAIN (*s
);
1346 TREE_VALUE (*s
) = new_spec
;
1353 /* Compare an entry in the local specializations hash table P1 (which
1354 is really a pointer to a TREE_LIST) with P2 (which is really a
1358 eq_local_specializations (const void *p1
, const void *p2
)
1360 return TREE_VALUE ((const_tree
) p1
) == (const_tree
) p2
;
1363 /* Hash P1, an entry in the local specializations table. */
1366 hash_local_specialization (const void* p1
)
1368 return htab_hash_pointer (TREE_VALUE ((const_tree
) p1
));
1371 /* Like register_specialization, but for local declarations. We are
1372 registering SPEC, an instantiation of TMPL. */
1375 register_local_specialization (tree spec
, tree tmpl
)
1379 slot
= htab_find_slot_with_hash (local_specializations
, tmpl
,
1380 htab_hash_pointer (tmpl
), INSERT
);
1381 *slot
= build_tree_list (spec
, tmpl
);
1384 /* TYPE is a class type. Returns true if TYPE is an explicitly
1385 specialized class. */
1388 explicit_class_specialization_p (tree type
)
1390 if (!CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
1392 return !uses_template_parms (CLASSTYPE_TI_ARGS (type
));
1395 /* Print the list of candidate FNS in an error message. */
1398 print_candidates (tree fns
)
1402 const char *str
= "candidates are:";
1404 for (fn
= fns
; fn
!= NULL_TREE
; fn
= TREE_CHAIN (fn
))
1408 for (f
= TREE_VALUE (fn
); f
; f
= OVL_NEXT (f
))
1409 error ("%s %+#D", str
, OVL_CURRENT (f
));
1414 /* Returns the template (one of the functions given by TEMPLATE_ID)
1415 which can be specialized to match the indicated DECL with the
1416 explicit template args given in TEMPLATE_ID. The DECL may be
1417 NULL_TREE if none is available. In that case, the functions in
1418 TEMPLATE_ID are non-members.
1420 If NEED_MEMBER_TEMPLATE is nonzero the function is known to be a
1421 specialization of a member template.
1423 The TEMPLATE_COUNT is the number of references to qualifying
1424 template classes that appeared in the name of the function. See
1425 check_explicit_specialization for a more accurate description.
1427 TSK indicates what kind of template declaration (if any) is being
1428 declared. TSK_TEMPLATE indicates that the declaration given by
1429 DECL, though a FUNCTION_DECL, has template parameters, and is
1430 therefore a template function.
1432 The template args (those explicitly specified and those deduced)
1433 are output in a newly created vector *TARGS_OUT.
1435 If it is impossible to determine the result, an error message is
1436 issued. The error_mark_node is returned to indicate failure. */
1439 determine_specialization (tree template_id
,
1442 int need_member_template
,
1448 tree explicit_targs
;
1449 tree candidates
= NULL_TREE
;
1450 /* A TREE_LIST of templates of which DECL may be a specialization.
1451 The TREE_VALUE of each node is a TEMPLATE_DECL. The
1452 corresponding TREE_PURPOSE is the set of template arguments that,
1453 when used to instantiate the template, would produce a function
1454 with the signature of DECL. */
1455 tree templates
= NULL_TREE
;
1457 struct cp_binding_level
*b
;
1459 *targs_out
= NULL_TREE
;
1461 if (template_id
== error_mark_node
|| decl
== error_mark_node
)
1462 return error_mark_node
;
1464 fns
= TREE_OPERAND (template_id
, 0);
1465 explicit_targs
= TREE_OPERAND (template_id
, 1);
1467 if (fns
== error_mark_node
)
1468 return error_mark_node
;
1470 /* Check for baselinks. */
1471 if (BASELINK_P (fns
))
1472 fns
= BASELINK_FUNCTIONS (fns
);
1474 if (!is_overloaded_fn (fns
))
1476 error ("%qD is not a function template", fns
);
1477 return error_mark_node
;
1480 /* Count the number of template headers specified for this
1483 for (b
= current_binding_level
;
1484 b
->kind
== sk_template_parms
;
1488 for (; fns
; fns
= OVL_NEXT (fns
))
1490 tree fn
= OVL_CURRENT (fns
);
1492 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
1494 tree decl_arg_types
;
1497 /* In case of explicit specialization, we need to check if
1498 the number of template headers appearing in the specialization
1499 is correct. This is usually done in check_explicit_specialization,
1500 but the check done there cannot be exhaustive when specializing
1501 member functions. Consider the following code:
1503 template <> void A<int>::f(int);
1504 template <> template <> void A<int>::f(int);
1506 Assuming that A<int> is not itself an explicit specialization
1507 already, the first line specializes "f" which is a non-template
1508 member function, whilst the second line specializes "f" which
1509 is a template member function. So both lines are syntactically
1510 correct, and check_explicit_specialization does not reject
1513 Here, we can do better, as we are matching the specialization
1514 against the declarations. We count the number of template
1515 headers, and we check if they match TEMPLATE_COUNT + 1
1516 (TEMPLATE_COUNT is the number of qualifying template classes,
1517 plus there must be another header for the member template
1520 Notice that if header_count is zero, this is not a
1521 specialization but rather a template instantiation, so there
1522 is no check we can perform here. */
1523 if (header_count
&& header_count
!= template_count
+ 1)
1526 /* Check that the number of template arguments at the
1527 innermost level for DECL is the same as for FN. */
1528 if (current_binding_level
->kind
== sk_template_parms
1529 && !current_binding_level
->explicit_spec_p
1530 && (TREE_VEC_LENGTH (DECL_INNERMOST_TEMPLATE_PARMS (fn
))
1531 != TREE_VEC_LENGTH (INNERMOST_TEMPLATE_PARMS
1532 (current_template_parms
))))
1535 /* DECL might be a specialization of FN. */
1536 decl_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
1537 fn_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
1539 /* For a non-static member function, we need to make sure
1540 that the const qualification is the same. Since
1541 get_bindings does not try to merge the "this" parameter,
1542 we must do the comparison explicitly. */
1543 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
1544 && !same_type_p (TREE_VALUE (fn_arg_types
),
1545 TREE_VALUE (decl_arg_types
)))
1548 /* Skip the "this" parameter and, for constructors of
1549 classes with virtual bases, the VTT parameter. A
1550 full specialization of a constructor will have a VTT
1551 parameter, but a template never will. */
1553 = skip_artificial_parms_for (decl
, decl_arg_types
);
1555 = skip_artificial_parms_for (fn
, fn_arg_types
);
1557 /* Check that the number of function parameters matches.
1559 template <class T> void f(int i = 0);
1560 template <> void f<int>();
1561 The specialization f<int> is invalid but is not caught
1562 by get_bindings below. */
1563 if (list_length (fn_arg_types
) != list_length (decl_arg_types
))
1566 /* Function templates cannot be specializations; there are
1567 no partial specializations of functions. Therefore, if
1568 the type of DECL does not match FN, there is no
1570 if (tsk
== tsk_template
)
1572 if (compparms (fn_arg_types
, decl_arg_types
))
1573 candidates
= tree_cons (NULL_TREE
, fn
, candidates
);
1577 /* See whether this function might be a specialization of this
1579 targs
= get_bindings (fn
, decl
, explicit_targs
, /*check_ret=*/true);
1582 /* We cannot deduce template arguments that when used to
1583 specialize TMPL will produce DECL. */
1586 /* Save this template, and the arguments deduced. */
1587 templates
= tree_cons (targs
, fn
, templates
);
1589 else if (need_member_template
)
1590 /* FN is an ordinary member function, and we need a
1591 specialization of a member template. */
1593 else if (TREE_CODE (fn
) != FUNCTION_DECL
)
1594 /* We can get IDENTIFIER_NODEs here in certain erroneous
1597 else if (!DECL_FUNCTION_MEMBER_P (fn
))
1598 /* This is just an ordinary non-member function. Nothing can
1599 be a specialization of that. */
1601 else if (DECL_ARTIFICIAL (fn
))
1602 /* Cannot specialize functions that are created implicitly. */
1606 tree decl_arg_types
;
1608 /* This is an ordinary member function. However, since
1609 we're here, we can assume it's enclosing class is a
1610 template class. For example,
1612 template <typename T> struct S { void f(); };
1613 template <> void S<int>::f() {}
1615 Here, S<int>::f is a non-template, but S<int> is a
1616 template class. If FN has the same type as DECL, we
1617 might be in business. */
1619 if (!DECL_TEMPLATE_INFO (fn
))
1620 /* Its enclosing class is an explicit specialization
1621 of a template class. This is not a candidate. */
1624 if (!same_type_p (TREE_TYPE (TREE_TYPE (decl
)),
1625 TREE_TYPE (TREE_TYPE (fn
))))
1626 /* The return types differ. */
1629 /* Adjust the type of DECL in case FN is a static member. */
1630 decl_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
1631 if (DECL_STATIC_FUNCTION_P (fn
)
1632 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1633 decl_arg_types
= TREE_CHAIN (decl_arg_types
);
1635 if (compparms (TYPE_ARG_TYPES (TREE_TYPE (fn
)),
1638 candidates
= tree_cons (NULL_TREE
, fn
, candidates
);
1642 if (templates
&& TREE_CHAIN (templates
))
1648 It is possible for a specialization with a given function
1649 signature to be instantiated from more than one function
1650 template. In such cases, explicit specification of the
1651 template arguments must be used to uniquely identify the
1652 function template specialization being specialized.
1654 Note that here, there's no suggestion that we're supposed to
1655 determine which of the candidate templates is most
1656 specialized. However, we, also have:
1660 Partial ordering of overloaded function template
1661 declarations is used in the following contexts to select
1662 the function template to which a function template
1663 specialization refers:
1665 -- when an explicit specialization refers to a function
1668 So, we do use the partial ordering rules, at least for now.
1669 This extension can only serve to make invalid programs valid,
1670 so it's safe. And, there is strong anecdotal evidence that
1671 the committee intended the partial ordering rules to apply;
1672 the EDG front end has that behavior, and John Spicer claims
1673 that the committee simply forgot to delete the wording in
1674 [temp.expl.spec]. */
1675 tree tmpl
= most_specialized_instantiation (templates
);
1676 if (tmpl
!= error_mark_node
)
1679 TREE_CHAIN (templates
) = NULL_TREE
;
1683 if (templates
== NULL_TREE
&& candidates
== NULL_TREE
)
1685 error ("template-id %qD for %q+D does not match any template "
1686 "declaration", template_id
, decl
);
1687 return error_mark_node
;
1689 else if ((templates
&& TREE_CHAIN (templates
))
1690 || (candidates
&& TREE_CHAIN (candidates
))
1691 || (templates
&& candidates
))
1693 error ("ambiguous template specialization %qD for %q+D",
1695 chainon (candidates
, templates
);
1696 print_candidates (candidates
);
1697 return error_mark_node
;
1700 /* We have one, and exactly one, match. */
1703 tree fn
= TREE_VALUE (candidates
);
1704 /* DECL is a re-declaration of a template function. */
1705 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
1707 /* It was a specialization of an ordinary member function in a
1709 *targs_out
= copy_node (DECL_TI_ARGS (fn
));
1710 return DECL_TI_TEMPLATE (fn
);
1713 /* It was a specialization of a template. */
1714 targs
= DECL_TI_ARGS (DECL_TEMPLATE_RESULT (TREE_VALUE (templates
)));
1715 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (targs
))
1717 *targs_out
= copy_node (targs
);
1718 SET_TMPL_ARGS_LEVEL (*targs_out
,
1719 TMPL_ARGS_DEPTH (*targs_out
),
1720 TREE_PURPOSE (templates
));
1723 *targs_out
= TREE_PURPOSE (templates
);
1724 return TREE_VALUE (templates
);
1727 /* Returns a chain of parameter types, exactly like the SPEC_TYPES,
1728 but with the default argument values filled in from those in the
1732 copy_default_args_to_explicit_spec_1 (tree spec_types
,
1735 tree new_spec_types
;
1740 if (spec_types
== void_list_node
)
1741 return void_list_node
;
1743 /* Substitute into the rest of the list. */
1745 copy_default_args_to_explicit_spec_1 (TREE_CHAIN (spec_types
),
1746 TREE_CHAIN (tmpl_types
));
1748 /* Add the default argument for this parameter. */
1749 return hash_tree_cons (TREE_PURPOSE (tmpl_types
),
1750 TREE_VALUE (spec_types
),
1754 /* DECL is an explicit specialization. Replicate default arguments
1755 from the template it specializes. (That way, code like:
1757 template <class T> void f(T = 3);
1758 template <> void f(double);
1761 works, as required.) An alternative approach would be to look up
1762 the correct default arguments at the call-site, but this approach
1763 is consistent with how implicit instantiations are handled. */
1766 copy_default_args_to_explicit_spec (tree decl
)
1771 tree new_spec_types
;
1775 tree object_type
= NULL_TREE
;
1776 tree in_charge
= NULL_TREE
;
1777 tree vtt
= NULL_TREE
;
1779 /* See if there's anything we need to do. */
1780 tmpl
= DECL_TI_TEMPLATE (decl
);
1781 tmpl_types
= TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (tmpl
)));
1782 for (t
= tmpl_types
; t
; t
= TREE_CHAIN (t
))
1783 if (TREE_PURPOSE (t
))
1788 old_type
= TREE_TYPE (decl
);
1789 spec_types
= TYPE_ARG_TYPES (old_type
);
1791 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1793 /* Remove the this pointer, but remember the object's type for
1795 object_type
= TREE_TYPE (TREE_VALUE (spec_types
));
1796 spec_types
= TREE_CHAIN (spec_types
);
1797 tmpl_types
= TREE_CHAIN (tmpl_types
);
1799 if (DECL_HAS_IN_CHARGE_PARM_P (decl
))
1801 /* DECL may contain more parameters than TMPL due to the extra
1802 in-charge parameter in constructors and destructors. */
1803 in_charge
= spec_types
;
1804 spec_types
= TREE_CHAIN (spec_types
);
1806 if (DECL_HAS_VTT_PARM_P (decl
))
1809 spec_types
= TREE_CHAIN (spec_types
);
1813 /* Compute the merged default arguments. */
1815 copy_default_args_to_explicit_spec_1 (spec_types
, tmpl_types
);
1817 /* Compute the new FUNCTION_TYPE. */
1821 new_spec_types
= hash_tree_cons (TREE_PURPOSE (vtt
),
1826 /* Put the in-charge parameter back. */
1827 new_spec_types
= hash_tree_cons (TREE_PURPOSE (in_charge
),
1828 TREE_VALUE (in_charge
),
1831 new_type
= build_method_type_directly (object_type
,
1832 TREE_TYPE (old_type
),
1836 new_type
= build_function_type (TREE_TYPE (old_type
),
1838 new_type
= cp_build_type_attribute_variant (new_type
,
1839 TYPE_ATTRIBUTES (old_type
));
1840 new_type
= build_exception_variant (new_type
,
1841 TYPE_RAISES_EXCEPTIONS (old_type
));
1842 TREE_TYPE (decl
) = new_type
;
1845 /* Check to see if the function just declared, as indicated in
1846 DECLARATOR, and in DECL, is a specialization of a function
1847 template. We may also discover that the declaration is an explicit
1848 instantiation at this point.
1850 Returns DECL, or an equivalent declaration that should be used
1851 instead if all goes well. Issues an error message if something is
1852 amiss. Returns error_mark_node if the error is not easily
1855 FLAGS is a bitmask consisting of the following flags:
1857 2: The function has a definition.
1858 4: The function is a friend.
1860 The TEMPLATE_COUNT is the number of references to qualifying
1861 template classes that appeared in the name of the function. For
1864 template <class T> struct S { void f(); };
1867 the TEMPLATE_COUNT would be 1. However, explicitly specialized
1868 classes are not counted in the TEMPLATE_COUNT, so that in
1870 template <class T> struct S {};
1871 template <> struct S<int> { void f(); }
1872 template <> void S<int>::f();
1874 the TEMPLATE_COUNT would be 0. (Note that this declaration is
1875 invalid; there should be no template <>.)
1877 If the function is a specialization, it is marked as such via
1878 DECL_TEMPLATE_SPECIALIZATION. Furthermore, its DECL_TEMPLATE_INFO
1879 is set up correctly, and it is added to the list of specializations
1880 for that template. */
1883 check_explicit_specialization (tree declarator
,
1888 int have_def
= flags
& 2;
1889 int is_friend
= flags
& 4;
1890 int specialization
= 0;
1891 int explicit_instantiation
= 0;
1892 int member_specialization
= 0;
1893 tree ctype
= DECL_CLASS_CONTEXT (decl
);
1894 tree dname
= DECL_NAME (decl
);
1899 if (!processing_specialization
)
1902 tsk
= tsk_excessive_parms
;
1905 tsk
= current_tmpl_spec_kind (template_count
);
1910 if (processing_specialization
)
1913 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
1915 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
1918 /* This could be something like:
1920 template <class T> void f(T);
1921 class S { friend void f<>(int); } */
1925 /* This case handles bogus declarations like template <>
1926 template <class T> void f<int>(); */
1928 error ("template-id %qD in declaration of primary template",
1935 case tsk_invalid_member_spec
:
1936 /* The error has already been reported in
1937 check_specialization_scope. */
1938 return error_mark_node
;
1940 case tsk_invalid_expl_inst
:
1941 error ("template parameter list used in explicit instantiation");
1947 error ("definition provided for explicit instantiation");
1949 explicit_instantiation
= 1;
1952 case tsk_excessive_parms
:
1953 case tsk_insufficient_parms
:
1954 if (tsk
== tsk_excessive_parms
)
1955 error ("too many template parameter lists in declaration of %qD",
1957 else if (template_header_count
)
1958 error("too few template parameter lists in declaration of %qD", decl
);
1960 error("explicit specialization of %qD must be introduced by "
1961 "%<template <>%>", decl
);
1965 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
1967 member_specialization
= 1;
1973 if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
1975 /* This case handles bogus declarations like template <>
1976 template <class T> void f<int>(); */
1978 if (uses_template_parms (declarator
))
1979 error ("function template partial specialization %qD "
1980 "is not allowed", declarator
);
1982 error ("template-id %qD in declaration of primary template",
1987 if (ctype
&& CLASSTYPE_TEMPLATE_INSTANTIATION (ctype
))
1988 /* This is a specialization of a member template, without
1989 specialization the containing class. Something like:
1991 template <class T> struct S {
1992 template <class U> void f (U);
1994 template <> template <class U> void S<int>::f(U) {}
1996 That's a specialization -- but of the entire template. */
2004 if (specialization
|| member_specialization
)
2006 tree t
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
2007 for (; t
; t
= TREE_CHAIN (t
))
2008 if (TREE_PURPOSE (t
))
2010 permerror (input_location
,
2011 "default argument specified in explicit specialization");
2016 if (specialization
|| member_specialization
|| explicit_instantiation
)
2018 tree tmpl
= NULL_TREE
;
2019 tree targs
= NULL_TREE
;
2021 /* Make sure that the declarator is a TEMPLATE_ID_EXPR. */
2022 if (TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
2026 gcc_assert (TREE_CODE (declarator
) == IDENTIFIER_NODE
);
2031 /* If there is no class context, the explicit instantiation
2032 must be at namespace scope. */
2033 gcc_assert (DECL_NAMESPACE_SCOPE_P (decl
));
2035 /* Find the namespace binding, using the declaration
2037 fns
= lookup_qualified_name (CP_DECL_CONTEXT (decl
), dname
,
2039 if (fns
== error_mark_node
|| !is_overloaded_fn (fns
))
2041 error ("%qD is not a template function", dname
);
2042 fns
= error_mark_node
;
2046 tree fn
= OVL_CURRENT (fns
);
2047 if (!is_associated_namespace (CP_DECL_CONTEXT (decl
),
2048 CP_DECL_CONTEXT (fn
)))
2049 error ("%qD is not declared in %qD",
2050 decl
, current_namespace
);
2054 declarator
= lookup_template_function (fns
, NULL_TREE
);
2057 if (declarator
== error_mark_node
)
2058 return error_mark_node
;
2060 if (ctype
!= NULL_TREE
&& TYPE_BEING_DEFINED (ctype
))
2062 if (!explicit_instantiation
)
2063 /* A specialization in class scope. This is invalid,
2064 but the error will already have been flagged by
2065 check_specialization_scope. */
2066 return error_mark_node
;
2069 /* It's not valid to write an explicit instantiation in
2072 class C { template void f(); }
2074 This case is caught by the parser. However, on
2077 template class C { void f(); };
2079 (which is invalid) we can get here. The error will be
2086 else if (ctype
!= NULL_TREE
2087 && (TREE_CODE (TREE_OPERAND (declarator
, 0)) ==
2090 /* Find the list of functions in ctype that have the same
2091 name as the declared function. */
2092 tree name
= TREE_OPERAND (declarator
, 0);
2093 tree fns
= NULL_TREE
;
2096 if (constructor_name_p (name
, ctype
))
2098 int is_constructor
= DECL_CONSTRUCTOR_P (decl
);
2100 if (is_constructor
? !TYPE_HAS_USER_CONSTRUCTOR (ctype
)
2101 : !CLASSTYPE_DESTRUCTORS (ctype
))
2103 /* From [temp.expl.spec]:
2105 If such an explicit specialization for the member
2106 of a class template names an implicitly-declared
2107 special member function (clause _special_), the
2108 program is ill-formed.
2110 Similar language is found in [temp.explicit]. */
2111 error ("specialization of implicitly-declared special member function");
2112 return error_mark_node
;
2115 name
= is_constructor
? ctor_identifier
: dtor_identifier
;
2118 if (!DECL_CONV_FN_P (decl
))
2120 idx
= lookup_fnfields_1 (ctype
, name
);
2122 fns
= VEC_index (tree
, CLASSTYPE_METHOD_VEC (ctype
), idx
);
2126 VEC(tree
,gc
) *methods
;
2129 /* For a type-conversion operator, we cannot do a
2130 name-based lookup. We might be looking for `operator
2131 int' which will be a specialization of `operator T'.
2132 So, we find *all* the conversion operators, and then
2133 select from them. */
2136 methods
= CLASSTYPE_METHOD_VEC (ctype
);
2138 for (idx
= CLASSTYPE_FIRST_CONVERSION_SLOT
;
2139 VEC_iterate (tree
, methods
, idx
, ovl
);
2142 if (!DECL_CONV_FN_P (OVL_CURRENT (ovl
)))
2143 /* There are no more conversion functions. */
2146 /* Glue all these conversion functions together
2147 with those we already have. */
2148 for (; ovl
; ovl
= OVL_NEXT (ovl
))
2149 fns
= ovl_cons (OVL_CURRENT (ovl
), fns
);
2153 if (fns
== NULL_TREE
)
2155 error ("no member function %qD declared in %qT", name
, ctype
);
2156 return error_mark_node
;
2159 TREE_OPERAND (declarator
, 0) = fns
;
2162 /* Figure out what exactly is being specialized at this point.
2163 Note that for an explicit instantiation, even one for a
2164 member function, we cannot tell apriori whether the
2165 instantiation is for a member template, or just a member
2166 function of a template class. Even if a member template is
2167 being instantiated, the member template arguments may be
2168 elided if they can be deduced from the rest of the
2170 tmpl
= determine_specialization (declarator
, decl
,
2172 member_specialization
,
2176 if (!tmpl
|| tmpl
== error_mark_node
)
2177 /* We couldn't figure out what this declaration was
2179 return error_mark_node
;
2182 tree gen_tmpl
= most_general_template (tmpl
);
2184 if (explicit_instantiation
)
2186 /* We don't set DECL_EXPLICIT_INSTANTIATION here; that
2187 is done by do_decl_instantiation later. */
2189 int arg_depth
= TMPL_ARGS_DEPTH (targs
);
2190 int parm_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
2192 if (arg_depth
> parm_depth
)
2194 /* If TMPL is not the most general template (for
2195 example, if TMPL is a friend template that is
2196 injected into namespace scope), then there will
2197 be too many levels of TARGS. Remove some of them
2202 new_targs
= make_tree_vec (parm_depth
);
2203 for (i
= arg_depth
- parm_depth
; i
< arg_depth
; ++i
)
2204 TREE_VEC_ELT (new_targs
, i
- (arg_depth
- parm_depth
))
2205 = TREE_VEC_ELT (targs
, i
);
2209 return instantiate_template (tmpl
, targs
, tf_error
);
2212 /* If we thought that the DECL was a member function, but it
2213 turns out to be specializing a static member function,
2214 make DECL a static member function as well. */
2215 if (DECL_STATIC_FUNCTION_P (tmpl
)
2216 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
2217 revert_static_member_fn (decl
);
2219 /* If this is a specialization of a member template of a
2220 template class, we want to return the TEMPLATE_DECL, not
2221 the specialization of it. */
2222 if (tsk
== tsk_template
)
2224 tree result
= DECL_TEMPLATE_RESULT (tmpl
);
2225 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
2226 DECL_INITIAL (result
) = NULL_TREE
;
2230 DECL_SOURCE_LOCATION (tmpl
) = DECL_SOURCE_LOCATION (decl
);
2231 DECL_SOURCE_LOCATION (result
)
2232 = DECL_SOURCE_LOCATION (decl
);
2233 /* We want to use the argument list specified in the
2234 definition, not in the original declaration. */
2235 DECL_ARGUMENTS (result
) = DECL_ARGUMENTS (decl
);
2236 for (parm
= DECL_ARGUMENTS (result
); parm
;
2237 parm
= TREE_CHAIN (parm
))
2238 DECL_CONTEXT (parm
) = result
;
2243 /* Set up the DECL_TEMPLATE_INFO for DECL. */
2244 DECL_TEMPLATE_INFO (decl
) = tree_cons (tmpl
, targs
, NULL_TREE
);
2246 /* Inherit default function arguments from the template
2247 DECL is specializing. */
2248 copy_default_args_to_explicit_spec (decl
);
2250 /* This specialization has the same protection as the
2251 template it specializes. */
2252 TREE_PRIVATE (decl
) = TREE_PRIVATE (gen_tmpl
);
2253 TREE_PROTECTED (decl
) = TREE_PROTECTED (gen_tmpl
);
2255 /* 7.1.1-1 [dcl.stc]
2257 A storage-class-specifier shall not be specified in an
2258 explicit specialization...
2260 The parser rejects these, so unless action is taken here,
2261 explicit function specializations will always appear with
2264 The action recommended by the C++ CWG in response to C++
2265 defect report 605 is to make the storage class and linkage
2266 of the explicit specialization match the templated function:
2268 http://www.open-std.org/jtc1/sc22/wg21/docs/cwg_active.html#605
2270 if (tsk
== tsk_expl_spec
&& DECL_FUNCTION_TEMPLATE_P (gen_tmpl
))
2272 tree tmpl_func
= DECL_TEMPLATE_RESULT (gen_tmpl
);
2273 gcc_assert (TREE_CODE (tmpl_func
) == FUNCTION_DECL
);
2275 /* This specialization has the same linkage and visibility as
2276 the function template it specializes. */
2277 TREE_PUBLIC (decl
) = TREE_PUBLIC (tmpl_func
);
2278 if (! TREE_PUBLIC (decl
))
2280 DECL_INTERFACE_KNOWN (decl
) = 1;
2281 DECL_NOT_REALLY_EXTERN (decl
) = 1;
2283 DECL_THIS_STATIC (decl
) = DECL_THIS_STATIC (tmpl_func
);
2284 if (DECL_VISIBILITY_SPECIFIED (tmpl_func
))
2286 DECL_VISIBILITY_SPECIFIED (decl
) = 1;
2287 DECL_VISIBILITY (decl
) = DECL_VISIBILITY (tmpl_func
);
2291 /* If DECL is a friend declaration, declared using an
2292 unqualified name, the namespace associated with DECL may
2293 have been set incorrectly. For example, in:
2295 template <typename T> void f(T);
2297 struct S { friend void f<int>(int); }
2300 we will have set the DECL_CONTEXT for the friend
2301 declaration to N, rather than to the global namespace. */
2302 if (DECL_NAMESPACE_SCOPE_P (decl
))
2303 DECL_CONTEXT (decl
) = DECL_CONTEXT (tmpl
);
2305 if (is_friend
&& !have_def
)
2306 /* This is not really a declaration of a specialization.
2307 It's just the name of an instantiation. But, it's not
2308 a request for an instantiation, either. */
2309 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
2310 else if (DECL_CONSTRUCTOR_P (decl
) || DECL_DESTRUCTOR_P (decl
))
2311 /* This is indeed a specialization. In case of constructors
2312 and destructors, we need in-charge and not-in-charge
2313 versions in V3 ABI. */
2314 clone_function_decl (decl
, /*update_method_vec_p=*/0);
2316 /* Register this specialization so that we can find it
2318 decl
= register_specialization (decl
, gen_tmpl
, targs
, is_friend
);
2325 /* Returns 1 iff PARMS1 and PARMS2 are identical sets of template
2326 parameters. These are represented in the same format used for
2327 DECL_TEMPLATE_PARMS. */
2330 comp_template_parms (const_tree parms1
, const_tree parms2
)
2335 if (parms1
== parms2
)
2338 for (p1
= parms1
, p2
= parms2
;
2339 p1
!= NULL_TREE
&& p2
!= NULL_TREE
;
2340 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
))
2342 tree t1
= TREE_VALUE (p1
);
2343 tree t2
= TREE_VALUE (p2
);
2346 gcc_assert (TREE_CODE (t1
) == TREE_VEC
);
2347 gcc_assert (TREE_CODE (t2
) == TREE_VEC
);
2349 if (TREE_VEC_LENGTH (t1
) != TREE_VEC_LENGTH (t2
))
2352 for (i
= 0; i
< TREE_VEC_LENGTH (t2
); ++i
)
2354 tree parm1
= TREE_VALUE (TREE_VEC_ELT (t1
, i
));
2355 tree parm2
= TREE_VALUE (TREE_VEC_ELT (t2
, i
));
2357 /* If either of the template parameters are invalid, assume
2358 they match for the sake of error recovery. */
2359 if (parm1
== error_mark_node
|| parm2
== error_mark_node
)
2362 if (TREE_CODE (parm1
) != TREE_CODE (parm2
))
2365 if (TREE_CODE (parm1
) == TEMPLATE_TYPE_PARM
2366 && (TEMPLATE_TYPE_PARAMETER_PACK (parm1
)
2367 == TEMPLATE_TYPE_PARAMETER_PACK (parm2
)))
2369 else if (!same_type_p (TREE_TYPE (parm1
), TREE_TYPE (parm2
)))
2374 if ((p1
!= NULL_TREE
) != (p2
!= NULL_TREE
))
2375 /* One set of parameters has more parameters lists than the
2382 /* Determine whether PARM is a parameter pack. */
2384 template_parameter_pack_p (const_tree parm
)
2386 /* Determine if we have a non-type template parameter pack. */
2387 if (TREE_CODE (parm
) == PARM_DECL
)
2388 return (DECL_TEMPLATE_PARM_P (parm
)
2389 && TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)));
2391 /* If this is a list of template parameters, we could get a
2392 TYPE_DECL or a TEMPLATE_DECL. */
2393 if (TREE_CODE (parm
) == TYPE_DECL
|| TREE_CODE (parm
) == TEMPLATE_DECL
)
2394 parm
= TREE_TYPE (parm
);
2396 return ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
2397 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
)
2398 && TEMPLATE_TYPE_PARAMETER_PACK (parm
));
2401 /* Determine whether ARGS describes a variadic template args list,
2402 i.e., one that is terminated by a template argument pack. */
2404 template_args_variadic_p (tree args
)
2409 if (args
== NULL_TREE
)
2412 args
= INNERMOST_TEMPLATE_ARGS (args
);
2413 nargs
= TREE_VEC_LENGTH (args
);
2418 last_parm
= TREE_VEC_ELT (args
, nargs
- 1);
2420 return ARGUMENT_PACK_P (last_parm
);
2423 /* Generate a new name for the parameter pack name NAME (an
2424 IDENTIFIER_NODE) that incorporates its */
2426 make_ith_pack_parameter_name (tree name
, int i
)
2428 /* Munge the name to include the parameter index. */
2432 sprintf(numbuf
, "%i", i
);
2433 newname
= (char*)alloca (IDENTIFIER_LENGTH (name
) + strlen(numbuf
) + 2);
2434 sprintf(newname
, "%s#%i", IDENTIFIER_POINTER (name
), i
);
2435 return get_identifier (newname
);
2438 /* Structure used to track the progress of find_parameter_packs_r. */
2439 struct find_parameter_pack_data
2441 /* TREE_LIST that will contain all of the parameter packs found by
2443 tree
* parameter_packs
;
2445 /* Set of AST nodes that have been visited by the traversal. */
2446 struct pointer_set_t
*visited
;
2449 /* Identifies all of the argument packs that occur in a template
2450 argument and appends them to the TREE_LIST inside DATA, which is a
2451 find_parameter_pack_data structure. This is a subroutine of
2452 make_pack_expansion and uses_parameter_packs. */
2454 find_parameter_packs_r (tree
*tp
, int *walk_subtrees
, void* data
)
2457 struct find_parameter_pack_data
* ppd
=
2458 (struct find_parameter_pack_data
*)data
;
2459 bool parameter_pack_p
= false;
2461 /* Identify whether this is a parameter pack or not. */
2462 switch (TREE_CODE (t
))
2464 case TEMPLATE_PARM_INDEX
:
2465 if (TEMPLATE_PARM_PARAMETER_PACK (t
))
2466 parameter_pack_p
= true;
2469 case TEMPLATE_TYPE_PARM
:
2470 case TEMPLATE_TEMPLATE_PARM
:
2471 if (TEMPLATE_TYPE_PARAMETER_PACK (t
))
2472 parameter_pack_p
= true;
2476 if (FUNCTION_PARAMETER_PACK_P (t
))
2478 /* We don't want to walk into the type of a PARM_DECL,
2479 because we don't want to see the type parameter pack. */
2481 parameter_pack_p
= true;
2486 /* Not a parameter pack. */
2490 if (parameter_pack_p
)
2492 /* Add this parameter pack to the list. */
2493 *ppd
->parameter_packs
= tree_cons (NULL_TREE
, t
, *ppd
->parameter_packs
);
2497 cp_walk_tree (&TYPE_CONTEXT (t
),
2498 &find_parameter_packs_r
, ppd
, ppd
->visited
);
2500 /* This switch statement will return immediately if we don't find a
2502 switch (TREE_CODE (t
))
2504 case TEMPLATE_PARM_INDEX
:
2507 case BOUND_TEMPLATE_TEMPLATE_PARM
:
2508 /* Check the template itself. */
2509 cp_walk_tree (&TREE_TYPE (TYPE_TI_TEMPLATE (t
)),
2510 &find_parameter_packs_r
, ppd
, ppd
->visited
);
2511 /* Check the template arguments. */
2512 cp_walk_tree (&TYPE_TI_ARGS (t
), &find_parameter_packs_r
, ppd
,
2517 case TEMPLATE_TYPE_PARM
:
2518 case TEMPLATE_TEMPLATE_PARM
:
2525 if (TYPE_PTRMEMFUNC_P (t
))
2531 if (TYPE_TEMPLATE_INFO (t
))
2532 cp_walk_tree (&TREE_VALUE (TYPE_TEMPLATE_INFO (t
)),
2533 &find_parameter_packs_r
, ppd
, ppd
->visited
);
2539 cp_walk_tree (&TREE_TYPE (t
),
2540 &find_parameter_packs_r
, ppd
, ppd
->visited
);
2544 cp_walk_tree (&TYPENAME_TYPE_FULLNAME (t
), &find_parameter_packs_r
,
2549 case TYPE_PACK_EXPANSION
:
2550 case EXPR_PACK_EXPANSION
:
2555 cp_walk_tree (&TYPE_MAX_VALUE (t
), &find_parameter_packs_r
,
2560 case IDENTIFIER_NODE
:
2561 cp_walk_tree (&TREE_TYPE (t
), &find_parameter_packs_r
, ppd
,
2573 /* Determines if the expression or type T uses any parameter packs. */
2575 uses_parameter_packs (tree t
)
2577 tree parameter_packs
= NULL_TREE
;
2578 struct find_parameter_pack_data ppd
;
2579 ppd
.parameter_packs
= ¶meter_packs
;
2580 ppd
.visited
= pointer_set_create ();
2581 cp_walk_tree (&t
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
2582 pointer_set_destroy (ppd
.visited
);
2583 return parameter_packs
!= NULL_TREE
;
2586 /* Turn ARG, which may be an expression, type, or a TREE_LIST
2587 representation a base-class initializer into a parameter pack
2588 expansion. If all goes well, the resulting node will be an
2589 EXPR_PACK_EXPANSION, TYPE_PACK_EXPANSION, or TREE_LIST,
2592 make_pack_expansion (tree arg
)
2595 tree parameter_packs
= NULL_TREE
;
2596 bool for_types
= false;
2597 struct find_parameter_pack_data ppd
;
2599 if (!arg
|| arg
== error_mark_node
)
2602 if (TREE_CODE (arg
) == TREE_LIST
)
2604 /* The only time we will see a TREE_LIST here is for a base
2605 class initializer. In this case, the TREE_PURPOSE will be a
2606 _TYPE node (representing the base class expansion we're
2607 initializing) and the TREE_VALUE will be a TREE_LIST
2608 containing the initialization arguments.
2610 The resulting expansion looks somewhat different from most
2611 expansions. Rather than returning just one _EXPANSION, we
2612 return a TREE_LIST whose TREE_PURPOSE is a
2613 TYPE_PACK_EXPANSION containing the bases that will be
2614 initialized. The TREE_VALUE will be identical to the
2615 original TREE_VALUE, which is a list of arguments that will
2616 be passed to each base. We do not introduce any new pack
2617 expansion nodes into the TREE_VALUE (although it is possible
2618 that some already exist), because the TREE_PURPOSE and
2619 TREE_VALUE all need to be expanded together with the same
2620 _EXPANSION node. Note that the TYPE_PACK_EXPANSION in the
2621 resulting TREE_PURPOSE will mention the parameter packs in
2622 both the bases and the arguments to the bases. */
2625 tree parameter_packs
= NULL_TREE
;
2627 /* Determine which parameter packs will be used by the base
2629 ppd
.visited
= pointer_set_create ();
2630 ppd
.parameter_packs
= ¶meter_packs
;
2631 cp_walk_tree (&TREE_PURPOSE (arg
), &find_parameter_packs_r
,
2634 if (parameter_packs
== NULL_TREE
)
2636 error ("base initializer expansion %<%T%> contains no parameter packs", arg
);
2637 pointer_set_destroy (ppd
.visited
);
2638 return error_mark_node
;
2641 if (TREE_VALUE (arg
) != void_type_node
)
2643 /* Collect the sets of parameter packs used in each of the
2644 initialization arguments. */
2645 for (value
= TREE_VALUE (arg
); value
; value
= TREE_CHAIN (value
))
2647 /* Determine which parameter packs will be expanded in this
2649 cp_walk_tree (&TREE_VALUE (value
), &find_parameter_packs_r
,
2654 pointer_set_destroy (ppd
.visited
);
2656 /* Create the pack expansion type for the base type. */
2657 purpose
= make_node (TYPE_PACK_EXPANSION
);
2658 SET_PACK_EXPANSION_PATTERN (purpose
, TREE_PURPOSE (arg
));
2659 PACK_EXPANSION_PARAMETER_PACKS (purpose
) = parameter_packs
;
2661 /* Just use structural equality for these TYPE_PACK_EXPANSIONS;
2662 they will rarely be compared to anything. */
2663 SET_TYPE_STRUCTURAL_EQUALITY (purpose
);
2665 return tree_cons (purpose
, TREE_VALUE (arg
), NULL_TREE
);
2668 if (TYPE_P (arg
) || TREE_CODE (arg
) == TEMPLATE_DECL
)
2671 /* Build the PACK_EXPANSION_* node. */
2672 result
= make_node (for_types
? TYPE_PACK_EXPANSION
: EXPR_PACK_EXPANSION
);
2673 SET_PACK_EXPANSION_PATTERN (result
, arg
);
2674 if (TREE_CODE (result
) == EXPR_PACK_EXPANSION
)
2676 /* Propagate type and const-expression information. */
2677 TREE_TYPE (result
) = TREE_TYPE (arg
);
2678 TREE_CONSTANT (result
) = TREE_CONSTANT (arg
);
2681 /* Just use structural equality for these TYPE_PACK_EXPANSIONS;
2682 they will rarely be compared to anything. */
2683 SET_TYPE_STRUCTURAL_EQUALITY (result
);
2685 /* Determine which parameter packs will be expanded. */
2686 ppd
.parameter_packs
= ¶meter_packs
;
2687 ppd
.visited
= pointer_set_create ();
2688 cp_walk_tree (&arg
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
2689 pointer_set_destroy (ppd
.visited
);
2691 /* Make sure we found some parameter packs. */
2692 if (parameter_packs
== NULL_TREE
)
2695 error ("expansion pattern %<%T%> contains no argument packs", arg
);
2697 error ("expansion pattern %<%E%> contains no argument packs", arg
);
2698 return error_mark_node
;
2700 PACK_EXPANSION_PARAMETER_PACKS (result
) = parameter_packs
;
2705 /* Checks T for any "bare" parameter packs, which have not yet been
2706 expanded, and issues an error if any are found. This operation can
2707 only be done on full expressions or types (e.g., an expression
2708 statement, "if" condition, etc.), because we could have expressions like:
2710 foo(f(g(h(args)))...)
2712 where "args" is a parameter pack. check_for_bare_parameter_packs
2713 should not be called for the subexpressions args, h(args),
2714 g(h(args)), or f(g(h(args))), because we would produce erroneous
2717 Returns TRUE and emits an error if there were bare parameter packs,
2718 returns FALSE otherwise. */
2720 check_for_bare_parameter_packs (tree t
)
2722 tree parameter_packs
= NULL_TREE
;
2723 struct find_parameter_pack_data ppd
;
2725 if (!processing_template_decl
|| !t
|| t
== error_mark_node
)
2728 if (TREE_CODE (t
) == TYPE_DECL
)
2731 ppd
.parameter_packs
= ¶meter_packs
;
2732 ppd
.visited
= pointer_set_create ();
2733 cp_walk_tree (&t
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
2734 pointer_set_destroy (ppd
.visited
);
2736 if (parameter_packs
)
2738 error ("parameter packs not expanded with %<...%>:");
2739 while (parameter_packs
)
2741 tree pack
= TREE_VALUE (parameter_packs
);
2742 tree name
= NULL_TREE
;
2744 if (TREE_CODE (pack
) == TEMPLATE_TYPE_PARM
2745 || TREE_CODE (pack
) == TEMPLATE_TEMPLATE_PARM
)
2746 name
= TYPE_NAME (pack
);
2747 else if (TREE_CODE (pack
) == TEMPLATE_PARM_INDEX
)
2748 name
= DECL_NAME (TEMPLATE_PARM_DECL (pack
));
2750 name
= DECL_NAME (pack
);
2753 inform (input_location
, " %qD", name
);
2755 inform (input_location
, " <anonymous>");
2757 parameter_packs
= TREE_CHAIN (parameter_packs
);
2766 /* Expand any parameter packs that occur in the template arguments in
2769 expand_template_argument_pack (tree args
)
2771 tree result_args
= NULL_TREE
;
2772 int in_arg
, out_arg
= 0, nargs
= args
? TREE_VEC_LENGTH (args
) : 0;
2773 int num_result_args
= -1;
2775 /* First, determine if we need to expand anything, and the number of
2776 slots we'll need. */
2777 for (in_arg
= 0; in_arg
< nargs
; ++in_arg
)
2779 tree arg
= TREE_VEC_ELT (args
, in_arg
);
2780 if (ARGUMENT_PACK_P (arg
))
2782 int num_packed
= TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg
));
2783 if (num_result_args
< 0)
2784 num_result_args
= in_arg
+ num_packed
;
2786 num_result_args
+= num_packed
;
2790 if (num_result_args
>= 0)
2795 /* If no expansion is necessary, we're done. */
2796 if (num_result_args
< 0)
2799 /* Expand arguments. */
2800 result_args
= make_tree_vec (num_result_args
);
2801 for (in_arg
= 0; in_arg
< nargs
; ++in_arg
)
2803 tree arg
= TREE_VEC_ELT (args
, in_arg
);
2804 if (ARGUMENT_PACK_P (arg
))
2806 tree packed
= ARGUMENT_PACK_ARGS (arg
);
2807 int i
, num_packed
= TREE_VEC_LENGTH (packed
);
2808 for (i
= 0; i
< num_packed
; ++i
, ++out_arg
)
2809 TREE_VEC_ELT (result_args
, out_arg
) = TREE_VEC_ELT(packed
, i
);
2813 TREE_VEC_ELT (result_args
, out_arg
) = arg
;
2821 /* Checks if DECL shadows a template parameter.
2823 [temp.local]: A template-parameter shall not be redeclared within its
2824 scope (including nested scopes).
2826 Emits an error and returns TRUE if the DECL shadows a parameter,
2827 returns FALSE otherwise. */
2830 check_template_shadow (tree decl
)
2834 /* If we're not in a template, we can't possibly shadow a template
2836 if (!current_template_parms
)
2839 /* Figure out what we're shadowing. */
2840 if (TREE_CODE (decl
) == OVERLOAD
)
2841 decl
= OVL_CURRENT (decl
);
2842 olddecl
= innermost_non_namespace_value (DECL_NAME (decl
));
2844 /* If there's no previous binding for this name, we're not shadowing
2845 anything, let alone a template parameter. */
2849 /* If we're not shadowing a template parameter, we're done. Note
2850 that OLDDECL might be an OVERLOAD (or perhaps even an
2851 ERROR_MARK), so we can't just blithely assume it to be a _DECL
2853 if (!DECL_P (olddecl
) || !DECL_TEMPLATE_PARM_P (olddecl
))
2856 /* We check for decl != olddecl to avoid bogus errors for using a
2857 name inside a class. We check TPFI to avoid duplicate errors for
2858 inline member templates. */
2860 || TEMPLATE_PARMS_FOR_INLINE (current_template_parms
))
2863 error ("declaration of %q+#D", decl
);
2864 error (" shadows template parm %q+#D", olddecl
);
2868 /* Return a new TEMPLATE_PARM_INDEX with the indicated INDEX, LEVEL,
2869 ORIG_LEVEL, DECL, and TYPE. */
2872 build_template_parm_index (int index
,
2878 tree t
= make_node (TEMPLATE_PARM_INDEX
);
2879 TEMPLATE_PARM_IDX (t
) = index
;
2880 TEMPLATE_PARM_LEVEL (t
) = level
;
2881 TEMPLATE_PARM_ORIG_LEVEL (t
) = orig_level
;
2882 TEMPLATE_PARM_DECL (t
) = decl
;
2883 TREE_TYPE (t
) = type
;
2884 TREE_CONSTANT (t
) = TREE_CONSTANT (decl
);
2885 TREE_READONLY (t
) = TREE_READONLY (decl
);
2890 /* Find the canonical type parameter for the given template type
2891 parameter. Returns the canonical type parameter, which may be TYPE
2892 if no such parameter existed. */
2894 canonical_type_parameter (tree type
)
2897 int idx
= TEMPLATE_TYPE_IDX (type
);
2898 if (!canonical_template_parms
)
2899 canonical_template_parms
= VEC_alloc (tree
, gc
, idx
+1);
2901 while (VEC_length (tree
, canonical_template_parms
) <= (unsigned)idx
)
2902 VEC_safe_push (tree
, gc
, canonical_template_parms
, NULL_TREE
);
2904 list
= VEC_index (tree
, canonical_template_parms
, idx
);
2905 while (list
&& !comptypes (type
, TREE_VALUE (list
), COMPARE_STRUCTURAL
))
2906 list
= TREE_CHAIN (list
);
2909 return TREE_VALUE (list
);
2912 VEC_replace(tree
, canonical_template_parms
, idx
,
2913 tree_cons (NULL_TREE
, type
,
2914 VEC_index (tree
, canonical_template_parms
, idx
)));
2919 /* Return a TEMPLATE_PARM_INDEX, similar to INDEX, but whose
2920 TEMPLATE_PARM_LEVEL has been decreased by LEVELS. If such a
2921 TEMPLATE_PARM_INDEX already exists, it is returned; otherwise, a
2922 new one is created. */
2925 reduce_template_parm_level (tree index
, tree type
, int levels
, tree args
,
2926 tsubst_flags_t complain
)
2928 if (TEMPLATE_PARM_DESCENDANTS (index
) == NULL_TREE
2929 || (TEMPLATE_PARM_LEVEL (TEMPLATE_PARM_DESCENDANTS (index
))
2930 != TEMPLATE_PARM_LEVEL (index
) - levels
))
2932 tree orig_decl
= TEMPLATE_PARM_DECL (index
);
2935 decl
= build_decl (DECL_SOURCE_LOCATION (orig_decl
),
2936 TREE_CODE (orig_decl
), DECL_NAME (orig_decl
), type
);
2937 TREE_CONSTANT (decl
) = TREE_CONSTANT (orig_decl
);
2938 TREE_READONLY (decl
) = TREE_READONLY (orig_decl
);
2939 DECL_ARTIFICIAL (decl
) = 1;
2940 SET_DECL_TEMPLATE_PARM_P (decl
);
2942 t
= build_template_parm_index (TEMPLATE_PARM_IDX (index
),
2943 TEMPLATE_PARM_LEVEL (index
) - levels
,
2944 TEMPLATE_PARM_ORIG_LEVEL (index
),
2946 TEMPLATE_PARM_DESCENDANTS (index
) = t
;
2947 TEMPLATE_PARM_PARAMETER_PACK (t
)
2948 = TEMPLATE_PARM_PARAMETER_PACK (index
);
2950 /* Template template parameters need this. */
2951 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
2952 DECL_TEMPLATE_PARMS (decl
) = tsubst_template_parms
2953 (DECL_TEMPLATE_PARMS (TEMPLATE_PARM_DECL (index
)),
2957 return TEMPLATE_PARM_DESCENDANTS (index
);
2960 /* Process information from new template parameter PARM and append it to the
2961 LIST being built. This new parameter is a non-type parameter iff
2962 IS_NON_TYPE is true. This new parameter is a parameter
2963 pack iff IS_PARAMETER_PACK is true. The location of PARM is in
2967 process_template_parm (tree list
, location_t parm_loc
, tree parm
, bool is_non_type
,
2968 bool is_parameter_pack
)
2975 gcc_assert (TREE_CODE (parm
) == TREE_LIST
);
2976 defval
= TREE_PURPOSE (parm
);
2980 tree p
= tree_last (list
);
2982 if (p
&& TREE_VALUE (p
) != error_mark_node
)
2985 if (TREE_CODE (p
) == TYPE_DECL
|| TREE_CODE (p
) == TEMPLATE_DECL
)
2986 idx
= TEMPLATE_TYPE_IDX (TREE_TYPE (p
));
2988 idx
= TEMPLATE_PARM_IDX (DECL_INITIAL (p
));
2998 parm
= TREE_VALUE (parm
);
3000 SET_DECL_TEMPLATE_PARM_P (parm
);
3002 if (TREE_TYPE (parm
) == error_mark_node
)
3004 err_parm_list
= build_tree_list (defval
, parm
);
3005 TREE_VALUE (err_parm_list
) = error_mark_node
;
3006 return chainon (list
, err_parm_list
);
3012 The top-level cv-qualifiers on the template-parameter are
3013 ignored when determining its type. */
3014 TREE_TYPE (parm
) = TYPE_MAIN_VARIANT (TREE_TYPE (parm
));
3015 if (invalid_nontype_parm_type_p (TREE_TYPE (parm
), 1))
3017 err_parm_list
= build_tree_list (defval
, parm
);
3018 TREE_VALUE (err_parm_list
) = error_mark_node
;
3019 return chainon (list
, err_parm_list
);
3022 if (uses_parameter_packs (TREE_TYPE (parm
)) && !is_parameter_pack
)
3024 /* This template parameter is not a parameter pack, but it
3025 should be. Complain about "bare" parameter packs. */
3026 check_for_bare_parameter_packs (TREE_TYPE (parm
));
3028 /* Recover by calling this a parameter pack. */
3029 is_parameter_pack
= true;
3033 /* A template parameter is not modifiable. */
3034 TREE_CONSTANT (parm
) = 1;
3035 TREE_READONLY (parm
) = 1;
3036 decl
= build_decl (parm_loc
,
3037 CONST_DECL
, DECL_NAME (parm
), TREE_TYPE (parm
));
3038 TREE_CONSTANT (decl
) = 1;
3039 TREE_READONLY (decl
) = 1;
3040 DECL_INITIAL (parm
) = DECL_INITIAL (decl
)
3041 = build_template_parm_index (idx
, processing_template_decl
,
3042 processing_template_decl
,
3043 decl
, TREE_TYPE (parm
));
3045 TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
))
3046 = is_parameter_pack
;
3051 parm
= TREE_VALUE (TREE_VALUE (parm
));
3053 if (parm
&& TREE_CODE (parm
) == TEMPLATE_DECL
)
3055 t
= cxx_make_type (TEMPLATE_TEMPLATE_PARM
);
3056 /* This is for distinguishing between real templates and template
3057 template parameters */
3058 TREE_TYPE (parm
) = t
;
3059 TREE_TYPE (DECL_TEMPLATE_RESULT (parm
)) = t
;
3064 t
= cxx_make_type (TEMPLATE_TYPE_PARM
);
3065 /* parm is either IDENTIFIER_NODE or NULL_TREE. */
3066 decl
= build_decl (parm_loc
,
3067 TYPE_DECL
, parm
, t
);
3070 TYPE_NAME (t
) = decl
;
3071 TYPE_STUB_DECL (t
) = decl
;
3073 TEMPLATE_TYPE_PARM_INDEX (t
)
3074 = build_template_parm_index (idx
, processing_template_decl
,
3075 processing_template_decl
,
3076 decl
, TREE_TYPE (parm
));
3077 TEMPLATE_TYPE_PARAMETER_PACK (t
) = is_parameter_pack
;
3078 TYPE_CANONICAL (t
) = canonical_type_parameter (t
);
3080 DECL_ARTIFICIAL (decl
) = 1;
3081 SET_DECL_TEMPLATE_PARM_P (decl
);
3083 parm
= build_tree_list (defval
, parm
);
3084 return chainon (list
, parm
);
3087 /* The end of a template parameter list has been reached. Process the
3088 tree list into a parameter vector, converting each parameter into a more
3089 useful form. Type parameters are saved as IDENTIFIER_NODEs, and others
3093 end_template_parm_list (tree parms
)
3097 tree saved_parmlist
= make_tree_vec (list_length (parms
));
3099 current_template_parms
3100 = tree_cons (size_int (processing_template_decl
),
3101 saved_parmlist
, current_template_parms
);
3103 for (parm
= parms
, nparms
= 0; parm
; parm
= next
, nparms
++)
3105 next
= TREE_CHAIN (parm
);
3106 TREE_VEC_ELT (saved_parmlist
, nparms
) = parm
;
3107 TREE_CHAIN (parm
) = NULL_TREE
;
3110 --processing_template_parmlist
;
3112 return saved_parmlist
;
3115 /* end_template_decl is called after a template declaration is seen. */
3118 end_template_decl (void)
3120 reset_specialization ();
3122 if (! processing_template_decl
)
3125 /* This matches the pushlevel in begin_template_parm_list. */
3128 --processing_template_decl
;
3129 current_template_parms
= TREE_CHAIN (current_template_parms
);
3132 /* Within the declaration of a template, return all levels of template
3133 parameters that apply. The template parameters are represented as
3134 a TREE_VEC, in the form documented in cp-tree.h for template
3138 current_template_args (void)
3141 tree args
= NULL_TREE
;
3142 int length
= TMPL_PARMS_DEPTH (current_template_parms
);
3145 /* If there is only one level of template parameters, we do not
3146 create a TREE_VEC of TREE_VECs. Instead, we return a single
3147 TREE_VEC containing the arguments. */
3149 args
= make_tree_vec (length
);
3151 for (header
= current_template_parms
; header
; header
= TREE_CHAIN (header
))
3153 tree a
= copy_node (TREE_VALUE (header
));
3156 TREE_TYPE (a
) = NULL_TREE
;
3157 for (i
= TREE_VEC_LENGTH (a
) - 1; i
>= 0; --i
)
3159 tree t
= TREE_VEC_ELT (a
, i
);
3161 /* T will be a list if we are called from within a
3162 begin/end_template_parm_list pair, but a vector directly
3163 if within a begin/end_member_template_processing pair. */
3164 if (TREE_CODE (t
) == TREE_LIST
)
3168 if (!error_operand_p (t
))
3170 if (TREE_CODE (t
) == TYPE_DECL
3171 || TREE_CODE (t
) == TEMPLATE_DECL
)
3175 if (TEMPLATE_TYPE_PARAMETER_PACK (t
))
3177 /* Turn this argument into a TYPE_ARGUMENT_PACK
3178 with a single element, which expands T. */
3179 tree vec
= make_tree_vec (1);
3180 TREE_VEC_ELT (vec
, 0) = make_pack_expansion (t
);
3182 t
= make_node (TYPE_ARGUMENT_PACK
);
3183 SET_ARGUMENT_PACK_ARGS (t
, vec
);
3188 t
= DECL_INITIAL (t
);
3190 if (TEMPLATE_PARM_PARAMETER_PACK (t
))
3192 /* Turn this argument into a NONTYPE_ARGUMENT_PACK
3193 with a single element, which expands T. */
3194 tree vec
= make_tree_vec (1);
3195 tree type
= TREE_TYPE (TEMPLATE_PARM_DECL (t
));
3196 TREE_VEC_ELT (vec
, 0) = make_pack_expansion (t
);
3198 t
= make_node (NONTYPE_ARGUMENT_PACK
);
3199 SET_ARGUMENT_PACK_ARGS (t
, vec
);
3200 TREE_TYPE (t
) = type
;
3203 TREE_VEC_ELT (a
, i
) = t
;
3209 TREE_VEC_ELT (args
, --l
) = a
;
3217 /* Return a TEMPLATE_DECL corresponding to DECL, using the indicated
3218 template PARMS. If MEMBER_TEMPLATE_P is true, the new template is
3219 a member template. Used by push_template_decl below. */
3222 build_template_decl (tree decl
, tree parms
, bool member_template_p
)
3224 tree tmpl
= build_lang_decl (TEMPLATE_DECL
, DECL_NAME (decl
), NULL_TREE
);
3225 DECL_TEMPLATE_PARMS (tmpl
) = parms
;
3226 DECL_CONTEXT (tmpl
) = DECL_CONTEXT (decl
);
3227 DECL_MEMBER_TEMPLATE_P (tmpl
) = member_template_p
;
3228 if (DECL_LANG_SPECIFIC (decl
))
3230 DECL_STATIC_FUNCTION_P (tmpl
) = DECL_STATIC_FUNCTION_P (decl
);
3231 DECL_CONSTRUCTOR_P (tmpl
) = DECL_CONSTRUCTOR_P (decl
);
3232 DECL_DESTRUCTOR_P (tmpl
) = DECL_DESTRUCTOR_P (decl
);
3233 DECL_NONCONVERTING_P (tmpl
) = DECL_NONCONVERTING_P (decl
);
3234 DECL_ASSIGNMENT_OPERATOR_P (tmpl
) = DECL_ASSIGNMENT_OPERATOR_P (decl
);
3235 if (DECL_OVERLOADED_OPERATOR_P (decl
))
3236 SET_OVERLOADED_OPERATOR_CODE (tmpl
,
3237 DECL_OVERLOADED_OPERATOR_P (decl
));
3243 struct template_parm_data
3245 /* The level of the template parameters we are currently
3249 /* The index of the specialization argument we are currently
3253 /* An array whose size is the number of template parameters. The
3254 elements are nonzero if the parameter has been used in any one
3255 of the arguments processed so far. */
3258 /* An array whose size is the number of template arguments. The
3259 elements are nonzero if the argument makes use of template
3260 parameters of this level. */
3261 int* arg_uses_template_parms
;
3264 /* Subroutine of push_template_decl used to see if each template
3265 parameter in a partial specialization is used in the explicit
3266 argument list. If T is of the LEVEL given in DATA (which is
3267 treated as a template_parm_data*), then DATA->PARMS is marked
3271 mark_template_parm (tree t
, void* data
)
3275 struct template_parm_data
* tpd
= (struct template_parm_data
*) data
;
3277 if (TREE_CODE (t
) == TEMPLATE_PARM_INDEX
)
3279 level
= TEMPLATE_PARM_LEVEL (t
);
3280 idx
= TEMPLATE_PARM_IDX (t
);
3284 level
= TEMPLATE_TYPE_LEVEL (t
);
3285 idx
= TEMPLATE_TYPE_IDX (t
);
3288 if (level
== tpd
->level
)
3290 tpd
->parms
[idx
] = 1;
3291 tpd
->arg_uses_template_parms
[tpd
->current_arg
] = 1;
3294 /* Return zero so that for_each_template_parm will continue the
3295 traversal of the tree; we want to mark *every* template parm. */
3299 /* Process the partial specialization DECL. */
3302 process_partial_specialization (tree decl
)
3304 tree type
= TREE_TYPE (decl
);
3305 tree maintmpl
= CLASSTYPE_TI_TEMPLATE (type
);
3306 tree specargs
= CLASSTYPE_TI_ARGS (type
);
3307 tree inner_args
= INNERMOST_TEMPLATE_ARGS (specargs
);
3308 tree main_inner_parms
= DECL_INNERMOST_TEMPLATE_PARMS (maintmpl
);
3310 int nargs
= TREE_VEC_LENGTH (inner_args
);
3313 int did_error_intro
= 0;
3314 struct template_parm_data tpd
;
3315 struct template_parm_data tpd2
;
3317 gcc_assert (current_template_parms
);
3319 inner_parms
= INNERMOST_TEMPLATE_PARMS (current_template_parms
);
3320 ntparms
= TREE_VEC_LENGTH (inner_parms
);
3322 /* We check that each of the template parameters given in the
3323 partial specialization is used in the argument list to the
3324 specialization. For example:
3326 template <class T> struct S;
3327 template <class T> struct S<T*>;
3329 The second declaration is OK because `T*' uses the template
3330 parameter T, whereas
3332 template <class T> struct S<int>;
3334 is no good. Even trickier is:
3345 The S2<T> declaration is actually invalid; it is a
3346 full-specialization. Of course,
3349 struct S2<T (*)(U)>;
3351 or some such would have been OK. */
3352 tpd
.level
= TMPL_PARMS_DEPTH (current_template_parms
);
3353 tpd
.parms
= (int *) alloca (sizeof (int) * ntparms
);
3354 memset (tpd
.parms
, 0, sizeof (int) * ntparms
);
3356 tpd
.arg_uses_template_parms
= (int *) alloca (sizeof (int) * nargs
);
3357 memset (tpd
.arg_uses_template_parms
, 0, sizeof (int) * nargs
);
3358 for (i
= 0; i
< nargs
; ++i
)
3360 tpd
.current_arg
= i
;
3361 for_each_template_parm (TREE_VEC_ELT (inner_args
, i
),
3362 &mark_template_parm
,
3365 /*include_nondeduced_p=*/false);
3367 for (i
= 0; i
< ntparms
; ++i
)
3368 if (tpd
.parms
[i
] == 0)
3370 /* One of the template parms was not used in the
3372 if (!did_error_intro
)
3374 error ("template parameters not used in partial specialization:");
3375 did_error_intro
= 1;
3378 error (" %qD", TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
)));
3381 /* [temp.class.spec]
3383 The argument list of the specialization shall not be identical to
3384 the implicit argument list of the primary template. */
3385 if (comp_template_args
3387 INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE
3389 error ("partial specialization %qT does not specialize any template arguments", type
);
3391 /* [temp.class.spec]
3393 A partially specialized non-type argument expression shall not
3394 involve template parameters of the partial specialization except
3395 when the argument expression is a simple identifier.
3397 The type of a template parameter corresponding to a specialized
3398 non-type argument shall not be dependent on a parameter of the
3401 Also, we verify that pack expansions only occur at the
3402 end of the argument list. */
3403 gcc_assert (nargs
== DECL_NTPARMS (maintmpl
));
3405 for (i
= 0; i
< nargs
; ++i
)
3407 tree parm
= TREE_VALUE (TREE_VEC_ELT (main_inner_parms
, i
));
3408 tree arg
= TREE_VEC_ELT (inner_args
, i
);
3409 tree packed_args
= NULL_TREE
;
3412 if (ARGUMENT_PACK_P (arg
))
3414 /* Extract the arguments from the argument pack. We'll be
3415 iterating over these in the following loop. */
3416 packed_args
= ARGUMENT_PACK_ARGS (arg
);
3417 len
= TREE_VEC_LENGTH (packed_args
);
3420 for (j
= 0; j
< len
; j
++)
3423 /* Get the Jth argument in the parameter pack. */
3424 arg
= TREE_VEC_ELT (packed_args
, j
);
3426 if (PACK_EXPANSION_P (arg
))
3428 /* Pack expansions must come at the end of the
3430 if ((packed_args
&& j
< len
- 1)
3431 || (!packed_args
&& i
< nargs
- 1))
3433 if (TREE_CODE (arg
) == EXPR_PACK_EXPANSION
)
3434 error ("parameter pack argument %qE must be at the end of the template argument list", arg
);
3436 error ("parameter pack argument %qT must be at the end of the template argument list", arg
);
3439 TREE_VEC_ELT (packed_args
, j
) = error_mark_node
;
3443 if (TREE_CODE (arg
) == EXPR_PACK_EXPANSION
)
3444 /* We only care about the pattern. */
3445 arg
= PACK_EXPANSION_PATTERN (arg
);
3447 if (/* These first two lines are the `non-type' bit. */
3449 && TREE_CODE (arg
) != TEMPLATE_DECL
3450 /* This next line is the `argument expression is not just a
3451 simple identifier' condition and also the `specialized
3452 non-type argument' bit. */
3453 && TREE_CODE (arg
) != TEMPLATE_PARM_INDEX
)
3455 if ((!packed_args
&& tpd
.arg_uses_template_parms
[i
])
3456 || (packed_args
&& uses_template_parms (arg
)))
3457 error ("template argument %qE involves template parameter(s)",
3461 /* Look at the corresponding template parameter,
3462 marking which template parameters its type depends
3464 tree type
= TREE_TYPE (parm
);
3468 /* We haven't yet initialized TPD2. Do so now. */
3469 tpd2
.arg_uses_template_parms
3470 = (int *) alloca (sizeof (int) * nargs
);
3471 /* The number of parameters here is the number in the
3472 main template, which, as checked in the assertion
3474 tpd2
.parms
= (int *) alloca (sizeof (int) * nargs
);
3476 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (maintmpl
));
3479 /* Mark the template parameters. But this time, we're
3480 looking for the template parameters of the main
3481 template, not in the specialization. */
3482 tpd2
.current_arg
= i
;
3483 tpd2
.arg_uses_template_parms
[i
] = 0;
3484 memset (tpd2
.parms
, 0, sizeof (int) * nargs
);
3485 for_each_template_parm (type
,
3486 &mark_template_parm
,
3489 /*include_nondeduced_p=*/false);
3491 if (tpd2
.arg_uses_template_parms
[i
])
3493 /* The type depended on some template parameters.
3494 If they are fully specialized in the
3495 specialization, that's OK. */
3497 for (j
= 0; j
< nargs
; ++j
)
3498 if (tpd2
.parms
[j
] != 0
3499 && tpd
.arg_uses_template_parms
[j
])
3501 error ("type %qT of template argument %qE depends "
3502 "on template parameter(s)",
3513 if (retrieve_specialization (maintmpl
, specargs
,
3514 /*class_specializations_p=*/true))
3515 /* We've already got this specialization. */
3518 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)
3519 = tree_cons (specargs
, inner_parms
,
3520 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
));
3521 TREE_TYPE (DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)) = type
;
3525 /* Check that a template declaration's use of default arguments and
3526 parameter packs is not invalid. Here, PARMS are the template
3527 parameters. IS_PRIMARY is nonzero if DECL is the thing declared by
3528 a primary template. IS_PARTIAL is nonzero if DECL is a partial
3532 IS_FRIEND_DECL is nonzero if DECL is a friend function template
3533 declaration (but not a definition); 1 indicates a declaration, 2
3534 indicates a redeclaration. When IS_FRIEND_DECL=2, no errors are
3535 emitted for extraneous default arguments.
3537 Returns TRUE if there were no errors found, FALSE otherwise. */
3540 check_default_tmpl_args (tree decl
, tree parms
, int is_primary
,
3541 int is_partial
, int is_friend_decl
)
3544 int last_level_to_check
;
3546 bool no_errors
= true;
3550 A default template-argument shall not be specified in a
3551 function template declaration or a function template definition, nor
3552 in the template-parameter-list of the definition of a member of a
3555 if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == FUNCTION_DECL
)
3556 /* You can't have a function template declaration in a local
3557 scope, nor you can you define a member of a class template in a
3561 if (current_class_type
3562 && !TYPE_BEING_DEFINED (current_class_type
)
3563 && DECL_LANG_SPECIFIC (decl
)
3564 /* If this is either a friend defined in the scope of the class
3565 or a member function. */
3566 && (DECL_FUNCTION_MEMBER_P (decl
)
3567 ? same_type_p (DECL_CONTEXT (decl
), current_class_type
)
3568 : DECL_FRIEND_CONTEXT (decl
)
3569 ? same_type_p (DECL_FRIEND_CONTEXT (decl
), current_class_type
)
3571 /* And, if it was a member function, it really was defined in
3572 the scope of the class. */
3573 && (!DECL_FUNCTION_MEMBER_P (decl
)
3574 || DECL_INITIALIZED_IN_CLASS_P (decl
)))
3575 /* We already checked these parameters when the template was
3576 declared, so there's no need to do it again now. This function
3577 was defined in class scope, but we're processing it's body now
3578 that the class is complete. */
3581 /* Core issue 226 (C++0x only): the following only applies to class
3583 if ((cxx_dialect
== cxx98
) || TREE_CODE (decl
) != FUNCTION_DECL
)
3587 If a template-parameter has a default template-argument, all
3588 subsequent template-parameters shall have a default
3589 template-argument supplied. */
3590 for (parm_level
= parms
; parm_level
; parm_level
= TREE_CHAIN (parm_level
))
3592 tree inner_parms
= TREE_VALUE (parm_level
);
3593 int ntparms
= TREE_VEC_LENGTH (inner_parms
);
3594 int seen_def_arg_p
= 0;
3597 for (i
= 0; i
< ntparms
; ++i
)
3599 tree parm
= TREE_VEC_ELT (inner_parms
, i
);
3601 if (parm
== error_mark_node
)
3604 if (TREE_PURPOSE (parm
))
3606 else if (seen_def_arg_p
3607 && !template_parameter_pack_p (TREE_VALUE (parm
)))
3609 error ("no default argument for %qD", TREE_VALUE (parm
));
3610 /* For better subsequent error-recovery, we indicate that
3611 there should have been a default argument. */
3612 TREE_PURPOSE (parm
) = error_mark_node
;
3618 /* Don't complain about an enclosing partial
3620 && parm_level
== parms
3621 && TREE_CODE (decl
) == TYPE_DECL
3623 && template_parameter_pack_p (TREE_VALUE (parm
)))
3625 /* A primary class template can only have one
3626 parameter pack, at the end of the template
3629 if (TREE_CODE (TREE_VALUE (parm
)) == PARM_DECL
)
3630 error ("parameter pack %qE must be at the end of the"
3631 " template parameter list", TREE_VALUE (parm
));
3633 error ("parameter pack %qT must be at the end of the"
3634 " template parameter list",
3635 TREE_TYPE (TREE_VALUE (parm
)));
3637 TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
))
3645 if (((cxx_dialect
== cxx98
) && TREE_CODE (decl
) != TYPE_DECL
)
3649 /* For an ordinary class template, default template arguments are
3650 allowed at the innermost level, e.g.:
3651 template <class T = int>
3653 but, in a partial specialization, they're not allowed even
3654 there, as we have in [temp.class.spec]:
3656 The template parameter list of a specialization shall not
3657 contain default template argument values.
3659 So, for a partial specialization, or for a function template
3660 (in C++98/C++03), we look at all of them. */
3663 /* But, for a primary class template that is not a partial
3664 specialization we look at all template parameters except the
3666 parms
= TREE_CHAIN (parms
);
3668 /* Figure out what error message to issue. */
3669 if (is_friend_decl
== 2)
3670 msg
= "default template arguments may not be used in function template friend re-declaration";
3671 else if (is_friend_decl
)
3672 msg
= "default template arguments may not be used in function template friend declarations";
3673 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& (cxx_dialect
== cxx98
))
3674 msg
= "default template arguments may not be used in function templates";
3675 else if (is_partial
)
3676 msg
= "default template arguments may not be used in partial specializations";
3678 msg
= "default argument for template parameter for class enclosing %qD";
3680 if (current_class_type
&& TYPE_BEING_DEFINED (current_class_type
))
3681 /* If we're inside a class definition, there's no need to
3682 examine the parameters to the class itself. On the one
3683 hand, they will be checked when the class is defined, and,
3684 on the other, default arguments are valid in things like:
3685 template <class T = double>
3686 struct S { template <class U> void f(U); };
3687 Here the default argument for `S' has no bearing on the
3688 declaration of `f'. */
3689 last_level_to_check
= template_class_depth (current_class_type
) + 1;
3691 /* Check everything. */
3692 last_level_to_check
= 0;
3694 for (parm_level
= parms
;
3695 parm_level
&& TMPL_PARMS_DEPTH (parm_level
) >= last_level_to_check
;
3696 parm_level
= TREE_CHAIN (parm_level
))
3698 tree inner_parms
= TREE_VALUE (parm_level
);
3702 ntparms
= TREE_VEC_LENGTH (inner_parms
);
3703 for (i
= 0; i
< ntparms
; ++i
)
3705 if (TREE_VEC_ELT (inner_parms
, i
) == error_mark_node
)
3708 if (TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)))
3713 if (is_friend_decl
== 2)
3720 /* Clear out the default argument so that we are not
3722 TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)) = NULL_TREE
;
3726 /* At this point, if we're still interested in issuing messages,
3727 they must apply to classes surrounding the object declared. */
3729 msg
= "default argument for template parameter for class enclosing %qD";
3735 /* Worker for push_template_decl_real, called via
3736 for_each_template_parm. DATA is really an int, indicating the
3737 level of the parameters we are interested in. If T is a template
3738 parameter of that level, return nonzero. */
3741 template_parm_this_level_p (tree t
, void* data
)
3743 int this_level
= *(int *)data
;
3746 if (TREE_CODE (t
) == TEMPLATE_PARM_INDEX
)
3747 level
= TEMPLATE_PARM_LEVEL (t
);
3749 level
= TEMPLATE_TYPE_LEVEL (t
);
3750 return level
== this_level
;
3753 /* Creates a TEMPLATE_DECL for the indicated DECL using the template
3754 parameters given by current_template_args, or reuses a
3755 previously existing one, if appropriate. Returns the DECL, or an
3756 equivalent one, if it is replaced via a call to duplicate_decls.
3758 If IS_FRIEND is true, DECL is a friend declaration. */
3761 push_template_decl_real (tree decl
, bool is_friend
)
3769 int new_template_p
= 0;
3770 /* True if the template is a member template, in the sense of
3772 bool member_template_p
= false;
3774 if (decl
== error_mark_node
|| !current_template_parms
)
3775 return error_mark_node
;
3777 /* See if this is a partial specialization. */
3778 is_partial
= (DECL_IMPLICIT_TYPEDEF_P (decl
)
3779 && TREE_CODE (TREE_TYPE (decl
)) != ENUMERAL_TYPE
3780 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)));
3782 if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_FRIEND_P (decl
))
3786 /* For a friend, we want the context of the friend function, not
3787 the type of which it is a friend. */
3788 ctx
= DECL_CONTEXT (decl
);
3789 else if (CP_DECL_CONTEXT (decl
)
3790 && TREE_CODE (CP_DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
3791 /* In the case of a virtual function, we want the class in which
3793 ctx
= CP_DECL_CONTEXT (decl
);
3795 /* Otherwise, if we're currently defining some class, the DECL
3796 is assumed to be a member of the class. */
3797 ctx
= current_scope ();
3799 if (ctx
&& TREE_CODE (ctx
) == NAMESPACE_DECL
)
3802 if (!DECL_CONTEXT (decl
))
3803 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
3805 /* See if this is a primary template. */
3806 if (is_friend
&& ctx
)
3807 /* A friend template that specifies a class context, i.e.
3808 template <typename T> friend void A<T>::f();
3812 primary
= template_parm_scope_p ();
3816 if (DECL_CLASS_SCOPE_P (decl
))
3817 member_template_p
= true;
3818 if (TREE_CODE (decl
) == TYPE_DECL
3819 && ANON_AGGRNAME_P (DECL_NAME (decl
)))
3821 error ("template class without a name");
3822 return error_mark_node
;
3824 else if (TREE_CODE (decl
) == FUNCTION_DECL
)
3826 if (DECL_DESTRUCTOR_P (decl
))
3830 A destructor shall not be a member template. */
3831 error ("destructor %qD declared as member template", decl
);
3832 return error_mark_node
;
3834 if (NEW_DELETE_OPNAME_P (DECL_NAME (decl
))
3835 && (!TYPE_ARG_TYPES (TREE_TYPE (decl
))
3836 || TYPE_ARG_TYPES (TREE_TYPE (decl
)) == void_list_node
3837 || !TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)))
3838 || (TREE_CHAIN (TYPE_ARG_TYPES ((TREE_TYPE (decl
))))
3839 == void_list_node
)))
3841 /* [basic.stc.dynamic.allocation]
3843 An allocation function can be a function
3844 template. ... Template allocation functions shall
3845 have two or more parameters. */
3846 error ("invalid template declaration of %qD", decl
);
3847 return error_mark_node
;
3850 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
3851 && CLASS_TYPE_P (TREE_TYPE (decl
)))
3855 error ("template declaration of %q#D", decl
);
3856 return error_mark_node
;
3860 /* Check to see that the rules regarding the use of default
3861 arguments are not being violated. */
3862 check_default_tmpl_args (decl
, current_template_parms
,
3863 primary
, is_partial
, /*is_friend_decl=*/0);
3865 /* Ensure that there are no parameter packs in the type of this
3866 declaration that have not been expanded. */
3867 if (TREE_CODE (decl
) == FUNCTION_DECL
)
3869 /* Check each of the arguments individually to see if there are
3870 any bare parameter packs. */
3871 tree type
= TREE_TYPE (decl
);
3872 tree arg
= DECL_ARGUMENTS (decl
);
3873 tree argtype
= TYPE_ARG_TYPES (type
);
3875 while (arg
&& argtype
)
3877 if (!FUNCTION_PARAMETER_PACK_P (arg
)
3878 && check_for_bare_parameter_packs (TREE_TYPE (arg
)))
3880 /* This is a PARM_DECL that contains unexpanded parameter
3881 packs. We have already complained about this in the
3882 check_for_bare_parameter_packs call, so just replace
3883 these types with ERROR_MARK_NODE. */
3884 TREE_TYPE (arg
) = error_mark_node
;
3885 TREE_VALUE (argtype
) = error_mark_node
;
3888 arg
= TREE_CHAIN (arg
);
3889 argtype
= TREE_CHAIN (argtype
);
3892 /* Check for bare parameter packs in the return type and the
3893 exception specifiers. */
3894 if (check_for_bare_parameter_packs (TREE_TYPE (type
)))
3895 /* Errors were already issued, set return type to int
3896 as the frontend doesn't expect error_mark_node as
3898 TREE_TYPE (type
) = integer_type_node
;
3899 if (check_for_bare_parameter_packs (TYPE_RAISES_EXCEPTIONS (type
)))
3900 TYPE_RAISES_EXCEPTIONS (type
) = NULL_TREE
;
3902 else if (check_for_bare_parameter_packs (TREE_TYPE (decl
)))
3904 TREE_TYPE (decl
) = error_mark_node
;
3905 return error_mark_node
;
3909 return process_partial_specialization (decl
);
3911 args
= current_template_args ();
3914 || TREE_CODE (ctx
) == FUNCTION_DECL
3915 || (CLASS_TYPE_P (ctx
) && TYPE_BEING_DEFINED (ctx
))
3916 || (is_friend
&& !DECL_TEMPLATE_INFO (decl
)))
3918 if (DECL_LANG_SPECIFIC (decl
)
3919 && DECL_TEMPLATE_INFO (decl
)
3920 && DECL_TI_TEMPLATE (decl
))
3921 tmpl
= DECL_TI_TEMPLATE (decl
);
3922 /* If DECL is a TYPE_DECL for a class-template, then there won't
3923 be DECL_LANG_SPECIFIC. The information equivalent to
3924 DECL_TEMPLATE_INFO is found in TYPE_TEMPLATE_INFO instead. */
3925 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
3926 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl
))
3927 && TYPE_TI_TEMPLATE (TREE_TYPE (decl
)))
3929 /* Since a template declaration already existed for this
3930 class-type, we must be redeclaring it here. Make sure
3931 that the redeclaration is valid. */
3932 redeclare_class_template (TREE_TYPE (decl
),
3933 current_template_parms
);
3934 /* We don't need to create a new TEMPLATE_DECL; just use the
3935 one we already had. */
3936 tmpl
= TYPE_TI_TEMPLATE (TREE_TYPE (decl
));
3940 tmpl
= build_template_decl (decl
, current_template_parms
,
3944 if (DECL_LANG_SPECIFIC (decl
)
3945 && DECL_TEMPLATE_SPECIALIZATION (decl
))
3947 /* A specialization of a member template of a template
3949 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
3950 DECL_TEMPLATE_INFO (tmpl
) = DECL_TEMPLATE_INFO (decl
);
3951 DECL_TEMPLATE_INFO (decl
) = NULL_TREE
;
3957 tree a
, t
, current
, parms
;
3959 tree tinfo
= get_template_info (decl
);
3963 error ("template definition of non-template %q#D", decl
);
3964 return error_mark_node
;
3967 tmpl
= TI_TEMPLATE (tinfo
);
3969 if (DECL_FUNCTION_TEMPLATE_P (tmpl
)
3970 && DECL_TEMPLATE_INFO (decl
) && DECL_TI_ARGS (decl
)
3971 && DECL_TEMPLATE_SPECIALIZATION (decl
)
3972 && DECL_MEMBER_TEMPLATE_P (tmpl
))
3976 /* The declaration is a specialization of a member
3977 template, declared outside the class. Therefore, the
3978 innermost template arguments will be NULL, so we
3979 replace them with the arguments determined by the
3980 earlier call to check_explicit_specialization. */
3981 args
= DECL_TI_ARGS (decl
);
3984 = build_template_decl (decl
, current_template_parms
,
3986 DECL_TEMPLATE_RESULT (new_tmpl
) = decl
;
3987 TREE_TYPE (new_tmpl
) = TREE_TYPE (decl
);
3988 DECL_TI_TEMPLATE (decl
) = new_tmpl
;
3989 SET_DECL_TEMPLATE_SPECIALIZATION (new_tmpl
);
3990 DECL_TEMPLATE_INFO (new_tmpl
)
3991 = tree_cons (tmpl
, args
, NULL_TREE
);
3993 register_specialization (new_tmpl
,
3994 most_general_template (tmpl
),
4000 /* Make sure the template headers we got make sense. */
4002 parms
= DECL_TEMPLATE_PARMS (tmpl
);
4003 i
= TMPL_PARMS_DEPTH (parms
);
4004 if (TMPL_ARGS_DEPTH (args
) != i
)
4006 error ("expected %d levels of template parms for %q#D, got %d",
4007 i
, decl
, TMPL_ARGS_DEPTH (args
));
4010 for (current
= decl
; i
> 0; --i
, parms
= TREE_CHAIN (parms
))
4012 a
= TMPL_ARGS_LEVEL (args
, i
);
4013 t
= INNERMOST_TEMPLATE_PARMS (parms
);
4015 if (TREE_VEC_LENGTH (t
) != TREE_VEC_LENGTH (a
))
4017 if (current
== decl
)
4018 error ("got %d template parameters for %q#D",
4019 TREE_VEC_LENGTH (a
), decl
);
4021 error ("got %d template parameters for %q#T",
4022 TREE_VEC_LENGTH (a
), current
);
4023 error (" but %d required", TREE_VEC_LENGTH (t
));
4024 return error_mark_node
;
4027 if (current
== decl
)
4030 current
= (TYPE_P (current
)
4031 ? TYPE_CONTEXT (current
)
4032 : DECL_CONTEXT (current
));
4035 /* Check that the parms are used in the appropriate qualifying scopes
4036 in the declarator. */
4037 if (!comp_template_args
4039 TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (tmpl
)))))
4042 template arguments to %qD do not match original template %qD",
4043 decl
, DECL_TEMPLATE_RESULT (tmpl
));
4044 if (!uses_template_parms (TI_ARGS (tinfo
)))
4045 inform (input_location
, "use template<> for an explicit specialization");
4046 /* Avoid crash in import_export_decl. */
4047 DECL_INTERFACE_KNOWN (decl
) = 1;
4048 return error_mark_node
;
4052 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
4053 TREE_TYPE (tmpl
) = TREE_TYPE (decl
);
4055 /* Push template declarations for global functions and types. Note
4056 that we do not try to push a global template friend declared in a
4057 template class; such a thing may well depend on the template
4058 parameters of the class. */
4059 if (new_template_p
&& !ctx
4060 && !(is_friend
&& template_class_depth (current_class_type
) > 0))
4062 tmpl
= pushdecl_namespace_level (tmpl
, is_friend
);
4063 if (tmpl
== error_mark_node
)
4064 return error_mark_node
;
4066 /* Hide template friend classes that haven't been declared yet. */
4067 if (is_friend
&& TREE_CODE (decl
) == TYPE_DECL
)
4069 DECL_ANTICIPATED (tmpl
) = 1;
4070 DECL_FRIEND_P (tmpl
) = 1;
4076 tree parms
= DECL_TEMPLATE_PARMS (tmpl
);
4079 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
4080 if (DECL_CONV_FN_P (tmpl
))
4082 int depth
= TMPL_PARMS_DEPTH (parms
);
4084 /* It is a conversion operator. See if the type converted to
4085 depends on innermost template operands. */
4087 if (uses_template_parms_level (TREE_TYPE (TREE_TYPE (tmpl
)),
4089 DECL_TEMPLATE_CONV_FN_P (tmpl
) = 1;
4092 /* Give template template parms a DECL_CONTEXT of the template
4093 for which they are a parameter. */
4094 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
4095 for (i
= TREE_VEC_LENGTH (parms
) - 1; i
>= 0; --i
)
4097 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
4098 if (TREE_CODE (parm
) == TEMPLATE_DECL
)
4099 DECL_CONTEXT (parm
) = tmpl
;
4103 /* The DECL_TI_ARGS of DECL contains full set of arguments referring
4104 back to its most general template. If TMPL is a specialization,
4105 ARGS may only have the innermost set of arguments. Add the missing
4106 argument levels if necessary. */
4107 if (DECL_TEMPLATE_INFO (tmpl
))
4108 args
= add_outermost_template_args (DECL_TI_ARGS (tmpl
), args
);
4110 info
= tree_cons (tmpl
, args
, NULL_TREE
);
4112 if (DECL_IMPLICIT_TYPEDEF_P (decl
))
4113 SET_TYPE_TEMPLATE_INFO (TREE_TYPE (tmpl
), info
);
4114 else if (DECL_LANG_SPECIFIC (decl
))
4115 DECL_TEMPLATE_INFO (decl
) = info
;
4117 return DECL_TEMPLATE_RESULT (tmpl
);
4121 push_template_decl (tree decl
)
4123 return push_template_decl_real (decl
, false);
4126 /* Called when a class template TYPE is redeclared with the indicated
4127 template PARMS, e.g.:
4129 template <class T> struct S;
4130 template <class T> struct S {}; */
4133 redeclare_class_template (tree type
, tree parms
)
4139 if (!TYPE_TEMPLATE_INFO (type
))
4141 error ("%qT is not a template type", type
);
4145 tmpl
= TYPE_TI_TEMPLATE (type
);
4146 if (!PRIMARY_TEMPLATE_P (tmpl
))
4147 /* The type is nested in some template class. Nothing to worry
4148 about here; there are no new template parameters for the nested
4154 error ("template specifiers not specified in declaration of %qD",
4159 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
4160 tmpl_parms
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl
);
4162 if (TREE_VEC_LENGTH (parms
) != TREE_VEC_LENGTH (tmpl_parms
))
4164 error ("redeclared with %d template parameter(s)",
4165 TREE_VEC_LENGTH (parms
));
4166 inform (input_location
, "previous declaration %q+D used %d template parameter(s)",
4167 tmpl
, TREE_VEC_LENGTH (tmpl_parms
));
4171 for (i
= 0; i
< TREE_VEC_LENGTH (tmpl_parms
); ++i
)
4178 if (TREE_VEC_ELT (tmpl_parms
, i
) == error_mark_node
4179 || TREE_VEC_ELT (parms
, i
) == error_mark_node
)
4182 tmpl_parm
= TREE_VALUE (TREE_VEC_ELT (tmpl_parms
, i
));
4183 parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
4184 tmpl_default
= TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
));
4185 parm_default
= TREE_PURPOSE (TREE_VEC_ELT (parms
, i
));
4187 /* TMPL_PARM and PARM can be either TYPE_DECL, PARM_DECL, or
4189 if (tmpl_parm
!= error_mark_node
4190 && (TREE_CODE (tmpl_parm
) != TREE_CODE (parm
)
4191 || (TREE_CODE (tmpl_parm
) != TYPE_DECL
4192 && !same_type_p (TREE_TYPE (tmpl_parm
), TREE_TYPE (parm
)))
4193 || (TREE_CODE (tmpl_parm
) != PARM_DECL
4194 && (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (tmpl_parm
))
4195 != TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
))))
4196 || (TREE_CODE (tmpl_parm
) == PARM_DECL
4197 && (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (tmpl_parm
))
4198 != TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
))))))
4200 error ("template parameter %q+#D", tmpl_parm
);
4201 error ("redeclared here as %q#D", parm
);
4205 if (tmpl_default
!= NULL_TREE
&& parm_default
!= NULL_TREE
)
4207 /* We have in [temp.param]:
4209 A template-parameter may not be given default arguments
4210 by two different declarations in the same scope. */
4211 error ("redefinition of default argument for %q#D", parm
);
4212 inform (input_location
, "%Joriginal definition appeared here", tmpl_parm
);
4216 if (parm_default
!= NULL_TREE
)
4217 /* Update the previous template parameters (which are the ones
4218 that will really count) with the new default value. */
4219 TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
)) = parm_default
;
4220 else if (tmpl_default
!= NULL_TREE
)
4221 /* Update the new parameters, too; they'll be used as the
4222 parameters for any members. */
4223 TREE_PURPOSE (TREE_VEC_ELT (parms
, i
)) = tmpl_default
;
4229 /* Simplify EXPR if it is a non-dependent expression. Returns the
4230 (possibly simplified) expression. */
4233 fold_non_dependent_expr (tree expr
)
4235 if (expr
== NULL_TREE
)
4238 /* If we're in a template, but EXPR isn't value dependent, simplify
4239 it. We're supposed to treat:
4241 template <typename T> void f(T[1 + 1]);
4242 template <typename T> void f(T[2]);
4244 as two declarations of the same function, for example. */
4245 if (processing_template_decl
4246 && !type_dependent_expression_p (expr
)
4247 && !value_dependent_expression_p (expr
))
4249 HOST_WIDE_INT saved_processing_template_decl
;
4251 saved_processing_template_decl
= processing_template_decl
;
4252 processing_template_decl
= 0;
4253 expr
= tsubst_copy_and_build (expr
,
4256 /*in_decl=*/NULL_TREE
,
4257 /*function_p=*/false,
4258 /*integral_constant_expression_p=*/true);
4259 processing_template_decl
= saved_processing_template_decl
;
4264 /* EXPR is an expression which is used in a constant-expression context.
4265 For instance, it could be a VAR_DECL with a constant initializer.
4266 Extract the innermost constant expression.
4268 This is basically a more powerful version of
4269 integral_constant_value, which can be used also in templates where
4270 initializers can maintain a syntactic rather than semantic form
4271 (even if they are non-dependent, for access-checking purposes). */
4274 fold_decl_constant_value (tree expr
)
4276 tree const_expr
= expr
;
4279 expr
= fold_non_dependent_expr (const_expr
);
4280 const_expr
= integral_constant_value (expr
);
4282 while (expr
!= const_expr
);
4287 /* Subroutine of convert_nontype_argument. Converts EXPR to TYPE, which
4288 must be a function or a pointer-to-function type, as specified
4289 in [temp.arg.nontype]: disambiguate EXPR if it is an overload set,
4290 and check that the resulting function has external linkage. */
4293 convert_nontype_argument_function (tree type
, tree expr
)
4298 fn
= instantiate_type (type
, fns
, tf_none
);
4299 if (fn
== error_mark_node
)
4300 return error_mark_node
;
4303 if (TREE_CODE (fn_no_ptr
) == ADDR_EXPR
)
4304 fn_no_ptr
= TREE_OPERAND (fn_no_ptr
, 0);
4305 if (TREE_CODE (fn_no_ptr
) == BASELINK
)
4306 fn_no_ptr
= BASELINK_FUNCTIONS (fn_no_ptr
);
4308 /* [temp.arg.nontype]/1
4310 A template-argument for a non-type, non-template template-parameter
4313 -- the address of an object or function with external linkage. */
4314 if (!DECL_EXTERNAL_LINKAGE_P (fn_no_ptr
))
4316 error ("%qE is not a valid template argument for type %qT "
4317 "because function %qD has not external linkage",
4318 expr
, type
, fn_no_ptr
);
4325 /* Attempt to convert the non-type template parameter EXPR to the
4326 indicated TYPE. If the conversion is successful, return the
4327 converted value. If the conversion is unsuccessful, return
4328 NULL_TREE if we issued an error message, or error_mark_node if we
4329 did not. We issue error messages for out-and-out bad template
4330 parameters, but not simply because the conversion failed, since we
4331 might be just trying to do argument deduction. Both TYPE and EXPR
4332 must be non-dependent.
4334 The conversion follows the special rules described in
4335 [temp.arg.nontype], and it is much more strict than an implicit
4338 This function is called twice for each template argument (see
4339 lookup_template_class for a more accurate description of this
4340 problem). This means that we need to handle expressions which
4341 are not valid in a C++ source, but can be created from the
4342 first call (for instance, casts to perform conversions). These
4343 hacks can go away after we fix the double coercion problem. */
4346 convert_nontype_argument (tree type
, tree expr
)
4350 /* Detect immediately string literals as invalid non-type argument.
4351 This special-case is not needed for correctness (we would easily
4352 catch this later), but only to provide better diagnostic for this
4353 common user mistake. As suggested by DR 100, we do not mention
4354 linkage issues in the diagnostic as this is not the point. */
4355 if (TREE_CODE (expr
) == STRING_CST
)
4357 error ("%qE is not a valid template argument for type %qT "
4358 "because string literals can never be used in this context",
4363 /* If we are in a template, EXPR may be non-dependent, but still
4364 have a syntactic, rather than semantic, form. For example, EXPR
4365 might be a SCOPE_REF, rather than the VAR_DECL to which the
4366 SCOPE_REF refers. Preserving the qualifying scope is necessary
4367 so that access checking can be performed when the template is
4368 instantiated -- but here we need the resolved form so that we can
4369 convert the argument. */
4370 expr
= fold_non_dependent_expr (expr
);
4371 if (error_operand_p (expr
))
4372 return error_mark_node
;
4373 expr_type
= TREE_TYPE (expr
);
4375 /* HACK: Due to double coercion, we can get a
4376 NOP_EXPR<REFERENCE_TYPE>(ADDR_EXPR<POINTER_TYPE> (arg)) here,
4377 which is the tree that we built on the first call (see
4378 below when coercing to reference to object or to reference to
4379 function). We just strip everything and get to the arg.
4380 See g++.old-deja/g++.oliva/template4.C and g++.dg/template/nontype9.C
4382 if (TREE_CODE (expr
) == NOP_EXPR
)
4384 if (TYPE_REF_OBJ_P (type
) || TYPE_REFFN_P (type
))
4386 /* ??? Maybe we could use convert_from_reference here, but we
4387 would need to relax its constraints because the NOP_EXPR
4388 could actually change the type to something more cv-qualified,
4389 and this is not folded by convert_from_reference. */
4390 tree addr
= TREE_OPERAND (expr
, 0);
4391 gcc_assert (TREE_CODE (expr_type
) == REFERENCE_TYPE
);
4392 gcc_assert (TREE_CODE (addr
) == ADDR_EXPR
);
4393 gcc_assert (TREE_CODE (TREE_TYPE (addr
)) == POINTER_TYPE
);
4394 gcc_assert (same_type_ignoring_top_level_qualifiers_p
4395 (TREE_TYPE (expr_type
),
4396 TREE_TYPE (TREE_TYPE (addr
))));
4398 expr
= TREE_OPERAND (addr
, 0);
4399 expr_type
= TREE_TYPE (expr
);
4402 /* We could also generate a NOP_EXPR(ADDR_EXPR()) when the
4403 parameter is a pointer to object, through decay and
4404 qualification conversion. Let's strip everything. */
4405 else if (TYPE_PTROBV_P (type
))
4408 gcc_assert (TREE_CODE (expr
) == ADDR_EXPR
);
4409 gcc_assert (TREE_CODE (TREE_TYPE (expr
)) == POINTER_TYPE
);
4410 /* Skip the ADDR_EXPR only if it is part of the decay for
4411 an array. Otherwise, it is part of the original argument
4412 in the source code. */
4413 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (expr
, 0))) == ARRAY_TYPE
)
4414 expr
= TREE_OPERAND (expr
, 0);
4415 expr_type
= TREE_TYPE (expr
);
4419 /* [temp.arg.nontype]/5, bullet 1
4421 For a non-type template-parameter of integral or enumeration type,
4422 integral promotions (_conv.prom_) and integral conversions
4423 (_conv.integral_) are applied. */
4424 if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
4426 if (!INTEGRAL_OR_ENUMERATION_TYPE_P (expr_type
))
4427 return error_mark_node
;
4429 expr
= fold_decl_constant_value (expr
);
4430 /* Notice that there are constant expressions like '4 % 0' which
4431 do not fold into integer constants. */
4432 if (TREE_CODE (expr
) != INTEGER_CST
)
4434 error ("%qE is not a valid template argument for type %qT "
4435 "because it is a non-constant expression", expr
, type
);
4439 /* At this point, an implicit conversion does what we want,
4440 because we already know that the expression is of integral
4442 expr
= ocp_convert (type
, expr
, CONV_IMPLICIT
, LOOKUP_PROTECT
);
4443 if (expr
== error_mark_node
)
4444 return error_mark_node
;
4446 /* Conversion was allowed: fold it to a bare integer constant. */
4449 /* [temp.arg.nontype]/5, bullet 2
4451 For a non-type template-parameter of type pointer to object,
4452 qualification conversions (_conv.qual_) and the array-to-pointer
4453 conversion (_conv.array_) are applied. */
4454 else if (TYPE_PTROBV_P (type
))
4456 /* [temp.arg.nontype]/1 (TC1 version, DR 49):
4458 A template-argument for a non-type, non-template template-parameter
4459 shall be one of: [...]
4461 -- the name of a non-type template-parameter;
4462 -- the address of an object or function with external linkage, [...]
4463 expressed as "& id-expression" where the & is optional if the name
4464 refers to a function or array, or if the corresponding
4465 template-parameter is a reference.
4467 Here, we do not care about functions, as they are invalid anyway
4468 for a parameter of type pointer-to-object. */
4470 if (DECL_P (expr
) && DECL_TEMPLATE_PARM_P (expr
))
4471 /* Non-type template parameters are OK. */
4473 else if (TREE_CODE (expr
) != ADDR_EXPR
4474 && TREE_CODE (expr_type
) != ARRAY_TYPE
)
4476 if (TREE_CODE (expr
) == VAR_DECL
)
4478 error ("%qD is not a valid template argument "
4479 "because %qD is a variable, not the address of "
4484 /* Other values, like integer constants, might be valid
4485 non-type arguments of some other type. */
4486 return error_mark_node
;
4492 decl
= ((TREE_CODE (expr
) == ADDR_EXPR
)
4493 ? TREE_OPERAND (expr
, 0) : expr
);
4494 if (TREE_CODE (decl
) != VAR_DECL
)
4496 error ("%qE is not a valid template argument of type %qT "
4497 "because %qE is not a variable",
4501 else if (!DECL_EXTERNAL_LINKAGE_P (decl
))
4503 error ("%qE is not a valid template argument of type %qT "
4504 "because %qD does not have external linkage",
4510 expr
= decay_conversion (expr
);
4511 if (expr
== error_mark_node
)
4512 return error_mark_node
;
4514 expr
= perform_qualification_conversions (type
, expr
);
4515 if (expr
== error_mark_node
)
4516 return error_mark_node
;
4518 /* [temp.arg.nontype]/5, bullet 3
4520 For a non-type template-parameter of type reference to object, no
4521 conversions apply. The type referred to by the reference may be more
4522 cv-qualified than the (otherwise identical) type of the
4523 template-argument. The template-parameter is bound directly to the
4524 template-argument, which must be an lvalue. */
4525 else if (TYPE_REF_OBJ_P (type
))
4527 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type
),
4529 return error_mark_node
;
4531 if (!at_least_as_qualified_p (TREE_TYPE (type
), expr_type
))
4533 error ("%qE is not a valid template argument for type %qT "
4534 "because of conflicts in cv-qualification", expr
, type
);
4538 if (!real_lvalue_p (expr
))
4540 error ("%qE is not a valid template argument for type %qT "
4541 "because it is not an lvalue", expr
, type
);
4545 /* [temp.arg.nontype]/1
4547 A template-argument for a non-type, non-template template-parameter
4548 shall be one of: [...]
4550 -- the address of an object or function with external linkage. */
4551 if (!DECL_EXTERNAL_LINKAGE_P (expr
))
4553 error ("%qE is not a valid template argument for type %qT "
4554 "because object %qD has not external linkage",
4559 expr
= build_nop (type
, build_address (expr
));
4561 /* [temp.arg.nontype]/5, bullet 4
4563 For a non-type template-parameter of type pointer to function, only
4564 the function-to-pointer conversion (_conv.func_) is applied. If the
4565 template-argument represents a set of overloaded functions (or a
4566 pointer to such), the matching function is selected from the set
4568 else if (TYPE_PTRFN_P (type
))
4570 /* If the argument is a template-id, we might not have enough
4571 context information to decay the pointer. */
4572 if (!type_unknown_p (expr_type
))
4574 expr
= decay_conversion (expr
);
4575 if (expr
== error_mark_node
)
4576 return error_mark_node
;
4579 expr
= convert_nontype_argument_function (type
, expr
);
4580 if (!expr
|| expr
== error_mark_node
)
4583 if (TREE_CODE (expr
) != ADDR_EXPR
)
4585 error ("%qE is not a valid template argument for type %qT", expr
, type
);
4586 error ("it must be the address of a function with external linkage");
4590 /* [temp.arg.nontype]/5, bullet 5
4592 For a non-type template-parameter of type reference to function, no
4593 conversions apply. If the template-argument represents a set of
4594 overloaded functions, the matching function is selected from the set
4596 else if (TYPE_REFFN_P (type
))
4598 if (TREE_CODE (expr
) == ADDR_EXPR
)
4600 error ("%qE is not a valid template argument for type %qT "
4601 "because it is a pointer", expr
, type
);
4602 inform (input_location
, "try using %qE instead", TREE_OPERAND (expr
, 0));
4606 expr
= convert_nontype_argument_function (TREE_TYPE (type
), expr
);
4607 if (!expr
|| expr
== error_mark_node
)
4610 expr
= build_nop (type
, build_address (expr
));
4612 /* [temp.arg.nontype]/5, bullet 6
4614 For a non-type template-parameter of type pointer to member function,
4615 no conversions apply. If the template-argument represents a set of
4616 overloaded member functions, the matching member function is selected
4617 from the set (_over.over_). */
4618 else if (TYPE_PTRMEMFUNC_P (type
))
4620 expr
= instantiate_type (type
, expr
, tf_none
);
4621 if (expr
== error_mark_node
)
4622 return error_mark_node
;
4624 /* There is no way to disable standard conversions in
4625 resolve_address_of_overloaded_function (called by
4626 instantiate_type). It is possible that the call succeeded by
4627 converting &B::I to &D::I (where B is a base of D), so we need
4628 to reject this conversion here.
4630 Actually, even if there was a way to disable standard conversions,
4631 it would still be better to reject them here so that we can
4632 provide a superior diagnostic. */
4633 if (!same_type_p (TREE_TYPE (expr
), type
))
4635 /* Make sure we are just one standard conversion off. */
4636 gcc_assert (can_convert (type
, TREE_TYPE (expr
)));
4637 error ("%qE is not a valid template argument for type %qT "
4638 "because it is of type %qT", expr
, type
,
4640 inform (input_location
, "standard conversions are not allowed in this context");
4644 /* [temp.arg.nontype]/5, bullet 7
4646 For a non-type template-parameter of type pointer to data member,
4647 qualification conversions (_conv.qual_) are applied. */
4648 else if (TYPE_PTRMEM_P (type
))
4650 expr
= perform_qualification_conversions (type
, expr
);
4651 if (expr
== error_mark_node
)
4654 /* A template non-type parameter must be one of the above. */
4658 /* Sanity check: did we actually convert the argument to the
4660 gcc_assert (same_type_p (type
, TREE_TYPE (expr
)));
4664 /* Subroutine of coerce_template_template_parms, which returns 1 if
4665 PARM_PARM and ARG_PARM match using the rule for the template
4666 parameters of template template parameters. Both PARM and ARG are
4667 template parameters; the rest of the arguments are the same as for
4668 coerce_template_template_parms.
4671 coerce_template_template_parm (tree parm
,
4673 tsubst_flags_t complain
,
4677 if (arg
== NULL_TREE
|| arg
== error_mark_node
4678 || parm
== NULL_TREE
|| parm
== error_mark_node
)
4681 if (TREE_CODE (arg
) != TREE_CODE (parm
))
4684 switch (TREE_CODE (parm
))
4687 /* We encounter instantiations of templates like
4688 template <template <template <class> class> class TT>
4691 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
4692 tree argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
4694 if (!coerce_template_template_parms
4695 (parmparm
, argparm
, complain
, in_decl
, outer_args
))
4701 if (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (arg
))
4702 && !TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
)))
4703 /* Argument is a parameter pack but parameter is not. */
4708 /* The tsubst call is used to handle cases such as
4710 template <int> class C {};
4711 template <class T, template <T> class TT> class D {};
4714 i.e. the parameter list of TT depends on earlier parameters. */
4715 if (!uses_template_parms (TREE_TYPE (arg
))
4717 (tsubst (TREE_TYPE (parm
), outer_args
, complain
, in_decl
),
4721 if (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (arg
))
4722 && !TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))
4723 /* Argument is a parameter pack but parameter is not. */
4736 /* Return 1 if PARM_PARMS and ARG_PARMS matches using rule for
4737 template template parameters. Both PARM_PARMS and ARG_PARMS are
4738 vectors of TREE_LIST nodes containing TYPE_DECL, TEMPLATE_DECL
4741 Consider the example:
4742 template <class T> class A;
4743 template<template <class U> class TT> class B;
4745 For B<A>, PARM_PARMS are the parameters to TT, while ARG_PARMS are
4746 the parameters to A, and OUTER_ARGS contains A. */
4749 coerce_template_template_parms (tree parm_parms
,
4751 tsubst_flags_t complain
,
4755 int nparms
, nargs
, i
;
4759 gcc_assert (TREE_CODE (parm_parms
) == TREE_VEC
);
4760 gcc_assert (TREE_CODE (arg_parms
) == TREE_VEC
);
4762 nparms
= TREE_VEC_LENGTH (parm_parms
);
4763 nargs
= TREE_VEC_LENGTH (arg_parms
);
4765 /* Determine whether we have a parameter pack at the end of the
4766 template template parameter's template parameter list. */
4767 if (TREE_VEC_ELT (parm_parms
, nparms
- 1) != error_mark_node
)
4769 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, nparms
- 1));
4771 if (parm
== error_mark_node
)
4774 switch (TREE_CODE (parm
))
4778 if (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
)))
4783 if (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))
4793 && !(variadic_p
&& nargs
>= nparms
- 1))
4796 /* Check all of the template parameters except the parameter pack at
4797 the end (if any). */
4798 for (i
= 0; i
< nparms
- variadic_p
; ++i
)
4800 if (TREE_VEC_ELT (parm_parms
, i
) == error_mark_node
4801 || TREE_VEC_ELT (arg_parms
, i
) == error_mark_node
)
4804 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
4805 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
4807 if (!coerce_template_template_parm (parm
, arg
, complain
, in_decl
,
4815 /* Check each of the template parameters in the template
4816 argument against the template parameter pack at the end of
4817 the template template parameter. */
4818 if (TREE_VEC_ELT (parm_parms
, i
) == error_mark_node
)
4821 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
4823 for (; i
< nargs
; ++i
)
4825 if (TREE_VEC_ELT (arg_parms
, i
) == error_mark_node
)
4828 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
4830 if (!coerce_template_template_parm (parm
, arg
, complain
, in_decl
,
4839 /* Verifies that the deduced template arguments (in TARGS) for the
4840 template template parameters (in TPARMS) represent valid bindings,
4841 by comparing the template parameter list of each template argument
4842 to the template parameter list of its corresponding template
4843 template parameter, in accordance with DR150. This
4844 routine can only be called after all template arguments have been
4845 deduced. It will return TRUE if all of the template template
4846 parameter bindings are okay, FALSE otherwise. */
4848 template_template_parm_bindings_ok_p (tree tparms
, tree targs
)
4850 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
4853 /* We're dealing with template parms in this process. */
4854 ++processing_template_decl
;
4856 targs
= INNERMOST_TEMPLATE_ARGS (targs
);
4858 for (i
= 0; i
< ntparms
; ++i
)
4860 tree tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
4861 tree targ
= TREE_VEC_ELT (targs
, i
);
4863 if (TREE_CODE (tparm
) == TEMPLATE_DECL
&& targ
)
4865 tree packed_args
= NULL_TREE
;
4868 if (ARGUMENT_PACK_P (targ
))
4870 /* Look inside the argument pack. */
4871 packed_args
= ARGUMENT_PACK_ARGS (targ
);
4872 len
= TREE_VEC_LENGTH (packed_args
);
4875 for (idx
= 0; idx
< len
; ++idx
)
4877 tree targ_parms
= NULL_TREE
;
4880 /* Extract the next argument from the argument
4882 targ
= TREE_VEC_ELT (packed_args
, idx
);
4884 if (PACK_EXPANSION_P (targ
))
4885 /* Look at the pattern of the pack expansion. */
4886 targ
= PACK_EXPANSION_PATTERN (targ
);
4888 /* Extract the template parameters from the template
4890 if (TREE_CODE (targ
) == TEMPLATE_DECL
)
4891 targ_parms
= DECL_INNERMOST_TEMPLATE_PARMS (targ
);
4892 else if (TREE_CODE (targ
) == TEMPLATE_TEMPLATE_PARM
)
4893 targ_parms
= DECL_INNERMOST_TEMPLATE_PARMS (TYPE_NAME (targ
));
4895 /* Verify that we can coerce the template template
4896 parameters from the template argument to the template
4897 parameter. This requires an exact match. */
4899 && !coerce_template_template_parms
4900 (DECL_INNERMOST_TEMPLATE_PARMS (tparm
),
4915 --processing_template_decl
;
4919 /* Convert the indicated template ARG as necessary to match the
4920 indicated template PARM. Returns the converted ARG, or
4921 error_mark_node if the conversion was unsuccessful. Error and
4922 warning messages are issued under control of COMPLAIN. This
4923 conversion is for the Ith parameter in the parameter list. ARGS is
4924 the full set of template arguments deduced so far. */
4927 convert_template_argument (tree parm
,
4930 tsubst_flags_t complain
,
4936 int is_type
, requires_type
, is_tmpl_type
, requires_tmpl_type
;
4938 if (TREE_CODE (arg
) == TREE_LIST
4939 && TREE_CODE (TREE_VALUE (arg
)) == OFFSET_REF
)
4941 /* The template argument was the name of some
4942 member function. That's usually
4943 invalid, but static members are OK. In any
4944 case, grab the underlying fields/functions
4945 and issue an error later if required. */
4946 orig_arg
= TREE_VALUE (arg
);
4947 TREE_TYPE (arg
) = unknown_type_node
;
4952 requires_tmpl_type
= TREE_CODE (parm
) == TEMPLATE_DECL
;
4953 requires_type
= (TREE_CODE (parm
) == TYPE_DECL
4954 || requires_tmpl_type
);
4956 /* When determining whether an argument pack expansion is a template,
4957 look at the pattern. */
4958 if (TREE_CODE (arg
) == TYPE_PACK_EXPANSION
)
4959 arg
= PACK_EXPANSION_PATTERN (arg
);
4962 ((TREE_CODE (arg
) == TEMPLATE_DECL
4963 && TREE_CODE (DECL_TEMPLATE_RESULT (arg
)) == TYPE_DECL
)
4964 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
4965 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
);
4968 && (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
4969 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
))
4970 arg
= TYPE_STUB_DECL (arg
);
4972 is_type
= TYPE_P (arg
) || is_tmpl_type
;
4974 if (requires_type
&& ! is_type
&& TREE_CODE (arg
) == SCOPE_REF
4975 && TREE_CODE (TREE_OPERAND (arg
, 0)) == TEMPLATE_TYPE_PARM
)
4977 permerror (input_location
, "to refer to a type member of a template parameter, "
4978 "use %<typename %E%>", orig_arg
);
4980 orig_arg
= make_typename_type (TREE_OPERAND (arg
, 0),
4981 TREE_OPERAND (arg
, 1),
4983 complain
& tf_error
);
4987 if (is_type
!= requires_type
)
4991 if (complain
& tf_error
)
4993 error ("type/value mismatch at argument %d in template "
4994 "parameter list for %qD",
4997 error (" expected a constant of type %qT, got %qT",
4999 (DECL_P (arg
) ? DECL_NAME (arg
) : orig_arg
));
5000 else if (requires_tmpl_type
)
5001 error (" expected a class template, got %qE", orig_arg
);
5003 error (" expected a type, got %qE", orig_arg
);
5006 return error_mark_node
;
5008 if (is_tmpl_type
^ requires_tmpl_type
)
5010 if (in_decl
&& (complain
& tf_error
))
5012 error ("type/value mismatch at argument %d in template "
5013 "parameter list for %qD",
5016 error (" expected a type, got %qT", DECL_NAME (arg
));
5018 error (" expected a class template, got %qT", orig_arg
);
5020 return error_mark_node
;
5025 if (requires_tmpl_type
)
5027 if (TREE_CODE (TREE_TYPE (arg
)) == UNBOUND_CLASS_TEMPLATE
)
5028 /* The number of argument required is not known yet.
5029 Just accept it for now. */
5030 val
= TREE_TYPE (arg
);
5033 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
5036 argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
5038 if (coerce_template_template_parms (parmparm
, argparm
,
5044 /* TEMPLATE_TEMPLATE_PARM node is preferred over
5046 if (val
!= error_mark_node
)
5048 if (DECL_TEMPLATE_TEMPLATE_PARM_P (val
))
5049 val
= TREE_TYPE (val
);
5050 else if (TREE_CODE (val
) == TYPE_PACK_EXPANSION
5051 && DECL_TEMPLATE_TEMPLATE_PARM_P (arg
))
5053 val
= TREE_TYPE (arg
);
5054 val
= make_pack_expansion (val
);
5060 if (in_decl
&& (complain
& tf_error
))
5062 error ("type/value mismatch at argument %d in "
5063 "template parameter list for %qD",
5065 error (" expected a template of type %qD, got %qD",
5069 val
= error_mark_node
;
5075 /* We only form one instance of each template specialization.
5076 Therefore, if we use a non-canonical variant (i.e., a
5077 typedef), any future messages referring to the type will use
5078 the typedef, which is confusing if those future uses do not
5079 themselves also use the typedef. */
5081 val
= strip_typedefs (val
);
5085 tree t
= tsubst (TREE_TYPE (parm
), args
, complain
, in_decl
);
5087 if (invalid_nontype_parm_type_p (t
, complain
))
5088 return error_mark_node
;
5090 if (template_parameter_pack_p (parm
) && ARGUMENT_PACK_P (orig_arg
))
5092 if (same_type_p (t
, TREE_TYPE (orig_arg
)))
5096 /* Not sure if this is reachable, but it doesn't hurt
5098 error ("type mismatch in nontype parameter pack");
5099 val
= error_mark_node
;
5102 else if (!uses_template_parms (orig_arg
) && !uses_template_parms (t
))
5103 /* We used to call digest_init here. However, digest_init
5104 will report errors, which we don't want when complain
5105 is zero. More importantly, digest_init will try too
5106 hard to convert things: for example, `0' should not be
5107 converted to pointer type at this point according to
5108 the standard. Accepting this is not merely an
5109 extension, since deciding whether or not these
5110 conversions can occur is part of determining which
5111 function template to call, or whether a given explicit
5112 argument specification is valid. */
5113 val
= convert_nontype_argument (t
, orig_arg
);
5117 if (val
== NULL_TREE
)
5118 val
= error_mark_node
;
5119 else if (val
== error_mark_node
&& (complain
& tf_error
))
5120 error ("could not convert template argument %qE to %qT", orig_arg
, t
);
5126 /* Coerces the remaining template arguments in INNER_ARGS (from
5127 ARG_IDX to the end) into the parameter pack at PARM_IDX in PARMS.
5128 Returns the coerced argument pack. PARM_IDX is the position of this
5129 parameter in the template parameter list. ARGS is the original
5130 template argument list. */
5132 coerce_template_parameter_pack (tree parms
,
5140 tsubst_flags_t complain
)
5142 tree parm
= TREE_VEC_ELT (parms
, parm_idx
);
5143 int nargs
= inner_args
? NUM_TMPL_ARGS (inner_args
) : 0;
5146 tree packed_types
= NULL_TREE
;
5148 if (arg_idx
> nargs
)
5151 packed_args
= make_tree_vec (nargs
- arg_idx
);
5153 if (TREE_CODE (TREE_VALUE (parm
)) == PARM_DECL
5154 && uses_parameter_packs (TREE_TYPE (TREE_VALUE (parm
))))
5156 /* When the template parameter is a non-type template
5157 parameter pack whose type uses parameter packs, we need
5158 to look at each of the template arguments
5159 separately. Build a vector of the types for these
5160 non-type template parameters in PACKED_TYPES. */
5162 = make_pack_expansion (TREE_TYPE (TREE_VALUE (parm
)));
5163 packed_types
= tsubst_pack_expansion (expansion
, args
,
5166 if (packed_types
== error_mark_node
)
5167 return error_mark_node
;
5169 /* Check that we have the right number of arguments. */
5171 && !PACK_EXPANSION_P (TREE_VEC_ELT (inner_args
, arg_idx
))
5172 && nargs
- arg_idx
!= TREE_VEC_LENGTH (packed_types
))
5175 = TREE_VEC_LENGTH (parms
) - 1 + TREE_VEC_LENGTH (packed_types
);
5176 error ("wrong number of template arguments (%d, should be %d)",
5177 nargs
, needed_parms
);
5178 return error_mark_node
;
5181 /* If we aren't able to check the actual arguments now
5182 (because they haven't been expanded yet), we can at least
5183 verify that all of the types used for the non-type
5184 template parameter pack are, in fact, valid for non-type
5185 template parameters. */
5187 && PACK_EXPANSION_P (TREE_VEC_ELT (inner_args
, arg_idx
)))
5189 int j
, len
= TREE_VEC_LENGTH (packed_types
);
5190 for (j
= 0; j
< len
; ++j
)
5192 tree t
= TREE_VEC_ELT (packed_types
, j
);
5193 if (invalid_nontype_parm_type_p (t
, complain
))
5194 return error_mark_node
;
5199 /* Convert the remaining arguments, which will be a part of the
5200 parameter pack "parm". */
5201 for (; arg_idx
< nargs
; ++arg_idx
)
5203 tree arg
= TREE_VEC_ELT (inner_args
, arg_idx
);
5204 tree actual_parm
= TREE_VALUE (parm
);
5206 if (packed_types
&& !PACK_EXPANSION_P (arg
))
5208 /* When we have a vector of types (corresponding to the
5209 non-type template parameter pack that uses parameter
5210 packs in its type, as mention above), and the
5211 argument is not an expansion (which expands to a
5212 currently unknown number of arguments), clone the
5213 parm and give it the next type in PACKED_TYPES. */
5214 actual_parm
= copy_node (actual_parm
);
5215 TREE_TYPE (actual_parm
) =
5216 TREE_VEC_ELT (packed_types
, arg_idx
- parm_idx
);
5219 if (arg
!= error_mark_node
)
5220 arg
= convert_template_argument (actual_parm
,
5221 arg
, new_args
, complain
, parm_idx
,
5223 if (arg
== error_mark_node
)
5225 TREE_VEC_ELT (packed_args
, arg_idx
- parm_idx
) = arg
;
5228 if (TREE_CODE (TREE_VALUE (parm
)) == TYPE_DECL
5229 || TREE_CODE (TREE_VALUE (parm
)) == TEMPLATE_DECL
)
5230 argument_pack
= make_node (TYPE_ARGUMENT_PACK
);
5233 argument_pack
= make_node (NONTYPE_ARGUMENT_PACK
);
5234 TREE_TYPE (argument_pack
)
5235 = tsubst (TREE_TYPE (TREE_VALUE (parm
)), new_args
, complain
, in_decl
);
5236 TREE_CONSTANT (argument_pack
) = 1;
5239 SET_ARGUMENT_PACK_ARGS (argument_pack
, packed_args
);
5240 return argument_pack
;
5243 /* Convert all template arguments to their appropriate types, and
5244 return a vector containing the innermost resulting template
5245 arguments. If any error occurs, return error_mark_node. Error and
5246 warning messages are issued under control of COMPLAIN.
5248 If REQUIRE_ALL_ARGS is false, argument deduction will be performed
5249 for arguments not specified in ARGS. Otherwise, if
5250 USE_DEFAULT_ARGS is true, default arguments will be used to fill in
5251 unspecified arguments. If REQUIRE_ALL_ARGS is true, but
5252 USE_DEFAULT_ARGS is false, then all arguments must be specified in
5256 coerce_template_parms (tree parms
,
5259 tsubst_flags_t complain
,
5260 bool require_all_args
,
5261 bool use_default_args
)
5263 int nparms
, nargs
, parm_idx
, arg_idx
, lost
= 0;
5266 tree new_inner_args
;
5267 bool saved_skip_evaluation
;
5269 /* When used as a boolean value, indicates whether this is a
5270 variadic template parameter list. Since it's an int, we can also
5271 subtract it from nparms to get the number of non-variadic
5275 nparms
= TREE_VEC_LENGTH (parms
);
5277 /* Determine if there are any parameter packs. */
5278 for (parm_idx
= 0; parm_idx
< nparms
; ++parm_idx
)
5280 tree tparm
= TREE_VALUE (TREE_VEC_ELT (parms
, parm_idx
));
5281 if (template_parameter_pack_p (tparm
))
5285 inner_args
= INNERMOST_TEMPLATE_ARGS (args
);
5286 /* If there are 0 or 1 parameter packs, we need to expand any argument
5287 packs so that we can deduce a parameter pack from some non-packed args
5288 followed by an argument pack, as in variadic85.C. If there are more
5289 than that, we need to leave argument packs intact so the arguments are
5290 assigned to the right parameter packs. This should only happen when
5291 dealing with a nested class inside a partial specialization of a class
5292 template, as in variadic92.C. */
5293 if (variadic_p
<= 1)
5294 inner_args
= expand_template_argument_pack (inner_args
);
5296 nargs
= inner_args
? NUM_TMPL_ARGS (inner_args
) : 0;
5297 if ((nargs
> nparms
&& !variadic_p
)
5298 || (nargs
< nparms
- variadic_p
5300 && (!use_default_args
5301 || (TREE_VEC_ELT (parms
, nargs
) != error_mark_node
5302 && !TREE_PURPOSE (TREE_VEC_ELT (parms
, nargs
))))))
5304 if (complain
& tf_error
)
5306 const char *or_more
= "";
5309 or_more
= " or more";
5313 error ("wrong number of template arguments (%d, should be %d%s)",
5314 nargs
, nparms
, or_more
);
5317 error ("provided for %q+D", in_decl
);
5320 return error_mark_node
;
5323 /* We need to evaluate the template arguments, even though this
5324 template-id may be nested within a "sizeof". */
5325 saved_skip_evaluation
= skip_evaluation
;
5326 skip_evaluation
= false;
5327 new_inner_args
= make_tree_vec (nparms
);
5328 new_args
= add_outermost_template_args (args
, new_inner_args
);
5329 for (parm_idx
= 0, arg_idx
= 0; parm_idx
< nparms
; parm_idx
++, arg_idx
++)
5334 /* Get the Ith template parameter. */
5335 parm
= TREE_VEC_ELT (parms
, parm_idx
);
5337 if (parm
== error_mark_node
)
5339 TREE_VEC_ELT (new_inner_args
, arg_idx
) = error_mark_node
;
5343 /* Calculate the next argument. */
5344 if (arg_idx
< nargs
)
5345 arg
= TREE_VEC_ELT (inner_args
, arg_idx
);
5349 if (template_parameter_pack_p (TREE_VALUE (parm
))
5350 && !(arg
&& ARGUMENT_PACK_P (arg
)))
5352 /* All remaining arguments will be placed in the
5353 template parameter pack PARM. */
5354 arg
= coerce_template_parameter_pack (parms
, parm_idx
, args
,
5355 inner_args
, arg_idx
,
5359 /* Store this argument. */
5360 if (arg
== error_mark_node
)
5362 TREE_VEC_ELT (new_inner_args
, parm_idx
) = arg
;
5364 /* We are done with all of the arguments. */
5371 if (PACK_EXPANSION_P (arg
))
5373 if (complain
& tf_error
)
5375 /* FIXME this restriction was removed by N2555; see
5377 /* If ARG is a pack expansion, but PARM is not a
5378 template parameter pack (if it were, we would have
5379 handled it above), we're trying to expand into a
5380 fixed-length argument list. */
5381 if (TREE_CODE (arg
) == EXPR_PACK_EXPANSION
)
5382 sorry ("cannot expand %<%E%> into a fixed-length "
5383 "argument list", arg
);
5385 sorry ("cannot expand %<%T%> into a fixed-length "
5386 "argument list", arg
);
5388 return error_mark_node
;
5391 else if (require_all_args
)
5392 /* There must be a default arg in this case. */
5393 arg
= tsubst_template_arg (TREE_PURPOSE (parm
), new_args
,
5398 if (arg
== error_mark_node
)
5400 if (complain
& tf_error
)
5401 error ("template argument %d is invalid", arg_idx
+ 1);
5404 /* This only occurs if there was an error in the template
5405 parameter list itself (which we would already have
5406 reported) that we are trying to recover from, e.g., a class
5407 template with a parameter list such as
5408 template<typename..., typename>. */
5409 return error_mark_node
;
5411 arg
= convert_template_argument (TREE_VALUE (parm
),
5412 arg
, new_args
, complain
,
5415 if (arg
== error_mark_node
)
5417 TREE_VEC_ELT (new_inner_args
, arg_idx
) = arg
;
5419 skip_evaluation
= saved_skip_evaluation
;
5422 return error_mark_node
;
5424 return new_inner_args
;
5427 /* Returns 1 if template args OT and NT are equivalent. */
5430 template_args_equal (tree ot
, tree nt
)
5435 if (TREE_CODE (nt
) == TREE_VEC
)
5436 /* For member templates */
5437 return TREE_CODE (ot
) == TREE_VEC
&& comp_template_args (ot
, nt
);
5438 else if (PACK_EXPANSION_P (ot
))
5439 return PACK_EXPANSION_P (nt
)
5440 && template_args_equal (PACK_EXPANSION_PATTERN (ot
),
5441 PACK_EXPANSION_PATTERN (nt
));
5442 else if (ARGUMENT_PACK_P (ot
))
5447 if (!ARGUMENT_PACK_P (nt
))
5450 opack
= ARGUMENT_PACK_ARGS (ot
);
5451 npack
= ARGUMENT_PACK_ARGS (nt
);
5452 len
= TREE_VEC_LENGTH (opack
);
5453 if (TREE_VEC_LENGTH (npack
) != len
)
5455 for (i
= 0; i
< len
; ++i
)
5456 if (!template_args_equal (TREE_VEC_ELT (opack
, i
),
5457 TREE_VEC_ELT (npack
, i
)))
5461 else if (TYPE_P (nt
))
5462 return TYPE_P (ot
) && same_type_p (ot
, nt
);
5463 else if (TREE_CODE (ot
) == TREE_VEC
|| TYPE_P (ot
))
5466 return cp_tree_equal (ot
, nt
);
5469 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets
5470 of template arguments. Returns 0 otherwise. */
5473 comp_template_args (tree oldargs
, tree newargs
)
5477 if (TREE_VEC_LENGTH (oldargs
) != TREE_VEC_LENGTH (newargs
))
5480 for (i
= 0; i
< TREE_VEC_LENGTH (oldargs
); ++i
)
5482 tree nt
= TREE_VEC_ELT (newargs
, i
);
5483 tree ot
= TREE_VEC_ELT (oldargs
, i
);
5485 if (! template_args_equal (ot
, nt
))
5492 add_pending_template (tree d
)
5494 tree ti
= (TYPE_P (d
)
5495 ? CLASSTYPE_TEMPLATE_INFO (d
)
5496 : DECL_TEMPLATE_INFO (d
));
5497 struct pending_template
*pt
;
5500 if (TI_PENDING_TEMPLATE_FLAG (ti
))
5503 /* We are called both from instantiate_decl, where we've already had a
5504 tinst_level pushed, and instantiate_template, where we haven't.
5506 level
= !current_tinst_level
|| current_tinst_level
->decl
!= d
;
5509 push_tinst_level (d
);
5511 pt
= GGC_NEW (struct pending_template
);
5513 pt
->tinst
= current_tinst_level
;
5514 if (last_pending_template
)
5515 last_pending_template
->next
= pt
;
5517 pending_templates
= pt
;
5519 last_pending_template
= pt
;
5521 TI_PENDING_TEMPLATE_FLAG (ti
) = 1;
5528 /* Return a TEMPLATE_ID_EXPR corresponding to the indicated FNS and
5529 ARGLIST. Valid choices for FNS are given in the cp-tree.def
5530 documentation for TEMPLATE_ID_EXPR. */
5533 lookup_template_function (tree fns
, tree arglist
)
5537 if (fns
== error_mark_node
|| arglist
== error_mark_node
)
5538 return error_mark_node
;
5540 gcc_assert (!arglist
|| TREE_CODE (arglist
) == TREE_VEC
);
5541 gcc_assert (fns
&& (is_overloaded_fn (fns
)
5542 || TREE_CODE (fns
) == IDENTIFIER_NODE
));
5544 if (BASELINK_P (fns
))
5546 BASELINK_FUNCTIONS (fns
) = build2 (TEMPLATE_ID_EXPR
,
5548 BASELINK_FUNCTIONS (fns
),
5553 type
= TREE_TYPE (fns
);
5554 if (TREE_CODE (fns
) == OVERLOAD
|| !type
)
5555 type
= unknown_type_node
;
5557 return build2 (TEMPLATE_ID_EXPR
, type
, fns
, arglist
);
5560 /* Within the scope of a template class S<T>, the name S gets bound
5561 (in build_self_reference) to a TYPE_DECL for the class, not a
5562 TEMPLATE_DECL. If DECL is a TYPE_DECL for current_class_type,
5563 or one of its enclosing classes, and that type is a template,
5564 return the associated TEMPLATE_DECL. Otherwise, the original
5565 DECL is returned. */
5568 maybe_get_template_decl_from_type_decl (tree decl
)
5570 return (decl
!= NULL_TREE
5571 && TREE_CODE (decl
) == TYPE_DECL
5572 && DECL_ARTIFICIAL (decl
)
5573 && CLASS_TYPE_P (TREE_TYPE (decl
))
5574 && CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (decl
)))
5575 ? CLASSTYPE_TI_TEMPLATE (TREE_TYPE (decl
)) : decl
;
5578 /* Given an IDENTIFIER_NODE (type TEMPLATE_DECL) and a chain of
5579 parameters, find the desired type.
5581 D1 is the PTYPENAME terminal, and ARGLIST is the list of arguments.
5583 IN_DECL, if non-NULL, is the template declaration we are trying to
5586 If ENTERING_SCOPE is nonzero, we are about to enter the scope of
5587 the class we are looking up.
5589 Issue error and warning messages under control of COMPLAIN.
5591 If the template class is really a local class in a template
5592 function, then the FUNCTION_CONTEXT is the function in which it is
5595 ??? Note that this function is currently called *twice* for each
5596 template-id: the first time from the parser, while creating the
5597 incomplete type (finish_template_type), and the second type during the
5598 real instantiation (instantiate_template_class). This is surely something
5599 that we want to avoid. It also causes some problems with argument
5600 coercion (see convert_nontype_argument for more information on this). */
5603 lookup_template_class (tree d1
,
5608 tsubst_flags_t complain
)
5610 tree templ
= NULL_TREE
, parmlist
;
5613 timevar_push (TV_NAME_LOOKUP
);
5615 if (TREE_CODE (d1
) == IDENTIFIER_NODE
)
5617 tree value
= innermost_non_namespace_value (d1
);
5618 if (value
&& DECL_TEMPLATE_TEMPLATE_PARM_P (value
))
5623 push_decl_namespace (context
);
5624 templ
= lookup_name (d1
);
5625 templ
= maybe_get_template_decl_from_type_decl (templ
);
5627 pop_decl_namespace ();
5630 context
= DECL_CONTEXT (templ
);
5632 else if (TREE_CODE (d1
) == TYPE_DECL
&& MAYBE_CLASS_TYPE_P (TREE_TYPE (d1
)))
5634 tree type
= TREE_TYPE (d1
);
5636 /* If we are declaring a constructor, say A<T>::A<T>, we will get
5637 an implicit typename for the second A. Deal with it. */
5638 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
5639 type
= TREE_TYPE (type
);
5641 if (CLASSTYPE_TEMPLATE_INFO (type
))
5643 templ
= CLASSTYPE_TI_TEMPLATE (type
);
5644 d1
= DECL_NAME (templ
);
5647 else if (TREE_CODE (d1
) == ENUMERAL_TYPE
5648 || (TYPE_P (d1
) && MAYBE_CLASS_TYPE_P (d1
)))
5650 templ
= TYPE_TI_TEMPLATE (d1
);
5651 d1
= DECL_NAME (templ
);
5653 else if (TREE_CODE (d1
) == TEMPLATE_DECL
5654 && DECL_TEMPLATE_RESULT (d1
)
5655 && TREE_CODE (DECL_TEMPLATE_RESULT (d1
)) == TYPE_DECL
)
5658 d1
= DECL_NAME (templ
);
5659 context
= DECL_CONTEXT (templ
);
5662 /* Issue an error message if we didn't find a template. */
5665 if (complain
& tf_error
)
5666 error ("%qT is not a template", d1
);
5667 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP
, error_mark_node
);
5670 if (TREE_CODE (templ
) != TEMPLATE_DECL
5671 /* Make sure it's a user visible template, if it was named by
5673 || ((complain
& tf_user
) && !DECL_TEMPLATE_PARM_P (templ
)
5674 && !PRIMARY_TEMPLATE_P (templ
)))
5676 if (complain
& tf_error
)
5678 error ("non-template type %qT used as a template", d1
);
5680 error ("for template declaration %q+D", in_decl
);
5682 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP
, error_mark_node
);
5685 complain
&= ~tf_user
;
5687 if (DECL_TEMPLATE_TEMPLATE_PARM_P (templ
))
5689 /* Create a new TEMPLATE_DECL and TEMPLATE_TEMPLATE_PARM node to store
5690 template arguments */
5696 parmlist
= DECL_INNERMOST_TEMPLATE_PARMS (templ
);
5698 /* Consider an example where a template template parameter declared as
5700 template <class T, class U = std::allocator<T> > class TT
5702 The template parameter level of T and U are one level larger than
5703 of TT. To proper process the default argument of U, say when an
5704 instantiation `TT<int>' is seen, we need to build the full
5705 arguments containing {int} as the innermost level. Outer levels,
5706 available when not appearing as default template argument, can be
5707 obtained from the arguments of the enclosing template.
5709 Suppose that TT is later substituted with std::vector. The above
5710 instantiation is `TT<int, std::allocator<T> >' with TT at
5711 level 1, and T at level 2, while the template arguments at level 1
5712 becomes {std::vector} and the inner level 2 is {int}. */
5714 outer
= DECL_CONTEXT (templ
);
5716 outer
= TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (outer
)));
5717 else if (current_template_parms
)
5718 /* This is an argument of the current template, so we haven't set
5719 DECL_CONTEXT yet. */
5720 outer
= current_template_args ();
5723 arglist
= add_to_template_args (outer
, arglist
);
5725 arglist2
= coerce_template_parms (parmlist
, arglist
, templ
,
5727 /*require_all_args=*/true,
5728 /*use_default_args=*/true);
5729 if (arglist2
== error_mark_node
5730 || (!uses_template_parms (arglist2
)
5731 && check_instantiated_args (templ
, arglist2
, complain
)))
5732 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP
, error_mark_node
);
5734 parm
= bind_template_template_parm (TREE_TYPE (templ
), arglist2
);
5735 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP
, parm
);
5739 tree template_type
= TREE_TYPE (templ
);
5742 tree found
= NULL_TREE
;
5745 int is_partial_instantiation
;
5747 gen_tmpl
= most_general_template (templ
);
5748 parmlist
= DECL_TEMPLATE_PARMS (gen_tmpl
);
5749 parm_depth
= TMPL_PARMS_DEPTH (parmlist
);
5750 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
5752 if (arg_depth
== 1 && parm_depth
> 1)
5754 /* We've been given an incomplete set of template arguments.
5757 template <class T> struct S1 {
5758 template <class U> struct S2 {};
5759 template <class U> struct S2<U*> {};
5762 we will be called with an ARGLIST of `U*', but the
5763 TEMPLATE will be `template <class T> template
5764 <class U> struct S1<T>::S2'. We must fill in the missing
5767 = add_outermost_template_args (TYPE_TI_ARGS (TREE_TYPE (templ
)),
5769 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
5772 /* Now we should have enough arguments. */
5773 gcc_assert (parm_depth
== arg_depth
);
5775 /* From here on, we're only interested in the most general
5779 /* Calculate the BOUND_ARGS. These will be the args that are
5780 actually tsubst'd into the definition to create the
5784 /* We have multiple levels of arguments to coerce, at once. */
5786 int saved_depth
= TMPL_ARGS_DEPTH (arglist
);
5788 tree bound_args
= make_tree_vec (parm_depth
);
5790 for (i
= saved_depth
,
5791 t
= DECL_TEMPLATE_PARMS (templ
);
5792 i
> 0 && t
!= NULL_TREE
;
5793 --i
, t
= TREE_CHAIN (t
))
5795 tree a
= coerce_template_parms (TREE_VALUE (t
),
5798 /*require_all_args=*/true,
5799 /*use_default_args=*/true);
5801 /* Don't process further if one of the levels fails. */
5802 if (a
== error_mark_node
)
5804 /* Restore the ARGLIST to its full size. */
5805 TREE_VEC_LENGTH (arglist
) = saved_depth
;
5806 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP
, error_mark_node
);
5809 SET_TMPL_ARGS_LEVEL (bound_args
, i
, a
);
5811 /* We temporarily reduce the length of the ARGLIST so
5812 that coerce_template_parms will see only the arguments
5813 corresponding to the template parameters it is
5815 TREE_VEC_LENGTH (arglist
)--;
5818 /* Restore the ARGLIST to its full size. */
5819 TREE_VEC_LENGTH (arglist
) = saved_depth
;
5821 arglist
= bound_args
;
5825 = coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parmlist
),
5826 INNERMOST_TEMPLATE_ARGS (arglist
),
5829 /*require_all_args=*/true,
5830 /*use_default_args=*/true);
5832 if (arglist
== error_mark_node
)
5833 /* We were unable to bind the arguments. */
5834 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP
, error_mark_node
);
5836 /* In the scope of a template class, explicit references to the
5837 template class refer to the type of the template, not any
5838 instantiation of it. For example, in:
5840 template <class T> class C { void f(C<T>); }
5842 the `C<T>' is just the same as `C'. Outside of the
5843 class, however, such a reference is an instantiation. */
5844 if (comp_template_args (TYPE_TI_ARGS (template_type
),
5847 found
= template_type
;
5849 if (!entering_scope
&& PRIMARY_TEMPLATE_P (templ
))
5853 for (ctx
= current_class_type
;
5854 ctx
&& TREE_CODE (ctx
) != NAMESPACE_DECL
;
5856 ? TYPE_CONTEXT (ctx
)
5857 : DECL_CONTEXT (ctx
)))
5858 if (TYPE_P (ctx
) && same_type_p (ctx
, template_type
))
5861 /* We're not in the scope of the class, so the
5862 TEMPLATE_TYPE is not the type we want after all. */
5868 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP
, found
);
5870 /* If we already have this specialization, return it. */
5871 found
= retrieve_specialization (templ
, arglist
,
5872 /*class_specializations_p=*/false);
5874 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP
, found
);
5876 /* This type is a "partial instantiation" if any of the template
5877 arguments still involve template parameters. Note that we set
5878 IS_PARTIAL_INSTANTIATION for partial specializations as
5880 is_partial_instantiation
= uses_template_parms (arglist
);
5882 /* If the deduced arguments are invalid, then the binding
5884 if (!is_partial_instantiation
5885 && check_instantiated_args (templ
,
5886 INNERMOST_TEMPLATE_ARGS (arglist
),
5888 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP
, error_mark_node
);
5890 if (!is_partial_instantiation
5891 && !PRIMARY_TEMPLATE_P (templ
)
5892 && TREE_CODE (CP_DECL_CONTEXT (templ
)) == NAMESPACE_DECL
)
5894 found
= xref_tag_from_type (TREE_TYPE (templ
),
5896 /*tag_scope=*/ts_global
);
5897 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP
, found
);
5900 context
= tsubst (DECL_CONTEXT (templ
), arglist
,
5903 context
= global_namespace
;
5905 /* Create the type. */
5906 if (TREE_CODE (template_type
) == ENUMERAL_TYPE
)
5908 if (!is_partial_instantiation
)
5910 set_current_access_from_decl (TYPE_NAME (template_type
));
5911 t
= start_enum (TYPE_IDENTIFIER (template_type
),
5912 tsubst (ENUM_UNDERLYING_TYPE (template_type
),
5913 arglist
, complain
, in_decl
),
5914 SCOPED_ENUM_P (template_type
));
5918 /* We don't want to call start_enum for this type, since
5919 the values for the enumeration constants may involve
5920 template parameters. And, no one should be interested
5921 in the enumeration constants for such a type. */
5922 t
= make_node (ENUMERAL_TYPE
);
5923 SET_SCOPED_ENUM_P (t
, SCOPED_ENUM_P (template_type
));
5928 t
= make_class_type (TREE_CODE (template_type
));
5929 CLASSTYPE_DECLARED_CLASS (t
)
5930 = CLASSTYPE_DECLARED_CLASS (template_type
);
5931 SET_CLASSTYPE_IMPLICIT_INSTANTIATION (t
);
5932 TYPE_FOR_JAVA (t
) = TYPE_FOR_JAVA (template_type
);
5934 /* A local class. Make sure the decl gets registered properly. */
5935 if (context
== current_function_decl
)
5936 pushtag (DECL_NAME (templ
), t
, /*tag_scope=*/ts_current
);
5938 if (comp_template_args (CLASSTYPE_TI_ARGS (template_type
), arglist
))
5939 /* This instantiation is another name for the primary
5940 template type. Set the TYPE_CANONICAL field
5942 TYPE_CANONICAL (t
) = template_type
;
5943 else if (any_template_arguments_need_structural_equality_p (arglist
))
5944 /* Some of the template arguments require structural
5945 equality testing, so this template class requires
5946 structural equality testing. */
5947 SET_TYPE_STRUCTURAL_EQUALITY (t
);
5950 /* If we called start_enum or pushtag above, this information
5951 will already be set up. */
5954 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
5956 type_decl
= create_implicit_typedef (DECL_NAME (templ
), t
);
5957 DECL_CONTEXT (type_decl
) = TYPE_CONTEXT (t
);
5958 TYPE_STUB_DECL (t
) = type_decl
;
5959 DECL_SOURCE_LOCATION (type_decl
)
5960 = DECL_SOURCE_LOCATION (TYPE_STUB_DECL (template_type
));
5963 type_decl
= TYPE_NAME (t
);
5965 TREE_PRIVATE (type_decl
)
5966 = TREE_PRIVATE (TYPE_STUB_DECL (template_type
));
5967 TREE_PROTECTED (type_decl
)
5968 = TREE_PROTECTED (TYPE_STUB_DECL (template_type
));
5969 if (CLASSTYPE_VISIBILITY_SPECIFIED (template_type
))
5971 DECL_VISIBILITY_SPECIFIED (type_decl
) = 1;
5972 DECL_VISIBILITY (type_decl
) = CLASSTYPE_VISIBILITY (template_type
);
5975 /* Set up the template information. We have to figure out which
5976 template is the immediate parent if this is a full
5978 if (parm_depth
== 1 || is_partial_instantiation
5979 || !PRIMARY_TEMPLATE_P (templ
))
5980 /* This case is easy; there are no member templates involved. */
5984 /* This is a full instantiation of a member template. Look
5985 for a partial instantiation of which this is an instance. */
5987 for (found
= DECL_TEMPLATE_INSTANTIATIONS (templ
);
5988 found
; found
= TREE_CHAIN (found
))
5991 tree tmpl
= CLASSTYPE_TI_TEMPLATE (TREE_VALUE (found
));
5993 /* We only want partial instantiations, here, not
5994 specializations or full instantiations. */
5995 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_VALUE (found
))
5996 || !uses_template_parms (TREE_VALUE (found
)))
5999 /* Temporarily reduce by one the number of levels in the
6000 ARGLIST and in FOUND so as to avoid comparing the
6001 last set of arguments. */
6002 TREE_VEC_LENGTH (arglist
)--;
6003 TREE_VEC_LENGTH (TREE_PURPOSE (found
)) --;
6005 /* See if the arguments match. If they do, then TMPL is
6006 the partial instantiation we want. */
6007 success
= comp_template_args (TREE_PURPOSE (found
), arglist
);
6009 /* Restore the argument vectors to their full size. */
6010 TREE_VEC_LENGTH (arglist
)++;
6011 TREE_VEC_LENGTH (TREE_PURPOSE (found
))++;
6022 /* There was no partial instantiation. This happens
6023 where C<T> is a member template of A<T> and it's used
6026 template <typename T> struct B { A<T>::C<int> m; };
6029 Create the partial instantiation.
6031 TREE_VEC_LENGTH (arglist
)--;
6032 found
= tsubst (templ
, arglist
, complain
, NULL_TREE
);
6033 TREE_VEC_LENGTH (arglist
)++;
6037 SET_TYPE_TEMPLATE_INFO (t
, tree_cons (found
, arglist
, NULL_TREE
));
6038 DECL_TEMPLATE_INSTANTIATIONS (templ
)
6039 = tree_cons (arglist
, t
,
6040 DECL_TEMPLATE_INSTANTIATIONS (templ
));
6042 if (TREE_CODE (t
) == ENUMERAL_TYPE
6043 && !is_partial_instantiation
)
6044 /* Now that the type has been registered on the instantiations
6045 list, we set up the enumerators. Because the enumeration
6046 constants may involve the enumeration type itself, we make
6047 sure to register the type first, and then create the
6048 constants. That way, doing tsubst_expr for the enumeration
6049 constants won't result in recursive calls here; we'll find
6050 the instantiation and exit above. */
6051 tsubst_enum (template_type
, t
, arglist
);
6053 if (is_partial_instantiation
)
6054 /* If the type makes use of template parameters, the
6055 code that generates debugging information will crash. */
6056 DECL_IGNORED_P (TYPE_STUB_DECL (t
)) = 1;
6058 /* Possibly limit visibility based on template args. */
6059 TREE_PUBLIC (type_decl
) = 1;
6060 determine_visibility (type_decl
);
6062 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP
, t
);
6064 timevar_pop (TV_NAME_LOOKUP
);
6071 /* True when we should also visit template parameters that occur in
6072 non-deduced contexts. */
6073 bool include_nondeduced_p
;
6074 struct pointer_set_t
*visited
;
6077 /* Called from for_each_template_parm via walk_tree. */
6080 for_each_template_parm_r (tree
*tp
, int *walk_subtrees
, void *d
)
6083 struct pair_fn_data
*pfd
= (struct pair_fn_data
*) d
;
6084 tree_fn_t fn
= pfd
->fn
;
6085 void *data
= pfd
->data
;
6088 && (pfd
->include_nondeduced_p
|| TREE_CODE (t
) != TYPENAME_TYPE
)
6089 && for_each_template_parm (TYPE_CONTEXT (t
), fn
, data
, pfd
->visited
,
6090 pfd
->include_nondeduced_p
))
6091 return error_mark_node
;
6093 switch (TREE_CODE (t
))
6096 if (TYPE_PTRMEMFUNC_P (t
))
6102 if (!TYPE_TEMPLATE_INFO (t
))
6104 else if (for_each_template_parm (TREE_VALUE (TYPE_TEMPLATE_INFO (t
)),
6105 fn
, data
, pfd
->visited
,
6106 pfd
->include_nondeduced_p
))
6107 return error_mark_node
;
6111 if (for_each_template_parm (TYPE_MIN_VALUE (t
),
6112 fn
, data
, pfd
->visited
,
6113 pfd
->include_nondeduced_p
)
6114 || for_each_template_parm (TYPE_MAX_VALUE (t
),
6115 fn
, data
, pfd
->visited
,
6116 pfd
->include_nondeduced_p
))
6117 return error_mark_node
;
6121 /* Since we're not going to walk subtrees, we have to do this
6123 if (for_each_template_parm (TYPE_METHOD_BASETYPE (t
), fn
, data
,
6124 pfd
->visited
, pfd
->include_nondeduced_p
))
6125 return error_mark_node
;
6129 /* Check the return type. */
6130 if (for_each_template_parm (TREE_TYPE (t
), fn
, data
, pfd
->visited
,
6131 pfd
->include_nondeduced_p
))
6132 return error_mark_node
;
6134 /* Check the parameter types. Since default arguments are not
6135 instantiated until they are needed, the TYPE_ARG_TYPES may
6136 contain expressions that involve template parameters. But,
6137 no-one should be looking at them yet. And, once they're
6138 instantiated, they don't contain template parameters, so
6139 there's no point in looking at them then, either. */
6143 for (parm
= TYPE_ARG_TYPES (t
); parm
; parm
= TREE_CHAIN (parm
))
6144 if (for_each_template_parm (TREE_VALUE (parm
), fn
, data
,
6145 pfd
->visited
, pfd
->include_nondeduced_p
))
6146 return error_mark_node
;
6148 /* Since we've already handled the TYPE_ARG_TYPES, we don't
6149 want walk_tree walking into them itself. */
6155 if (pfd
->include_nondeduced_p
6156 && for_each_template_parm (TYPE_FIELDS (t
), fn
, data
,
6158 pfd
->include_nondeduced_p
))
6159 return error_mark_node
;
6164 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
)
6165 && for_each_template_parm (DECL_TI_ARGS (t
), fn
, data
,
6166 pfd
->visited
, pfd
->include_nondeduced_p
))
6167 return error_mark_node
;
6172 if (TREE_CODE (t
) == CONST_DECL
&& DECL_TEMPLATE_PARM_P (t
)
6173 && for_each_template_parm (DECL_INITIAL (t
), fn
, data
,
6174 pfd
->visited
, pfd
->include_nondeduced_p
))
6175 return error_mark_node
;
6176 if (DECL_CONTEXT (t
)
6177 && pfd
->include_nondeduced_p
6178 && for_each_template_parm (DECL_CONTEXT (t
), fn
, data
,
6179 pfd
->visited
, pfd
->include_nondeduced_p
))
6180 return error_mark_node
;
6183 case BOUND_TEMPLATE_TEMPLATE_PARM
:
6184 /* Record template parameters such as `T' inside `TT<T>'. */
6185 if (for_each_template_parm (TYPE_TI_ARGS (t
), fn
, data
, pfd
->visited
,
6186 pfd
->include_nondeduced_p
))
6187 return error_mark_node
;
6190 case TEMPLATE_TEMPLATE_PARM
:
6191 case TEMPLATE_TYPE_PARM
:
6192 case TEMPLATE_PARM_INDEX
:
6193 if (fn
&& (*fn
)(t
, data
))
6194 return error_mark_node
;
6196 return error_mark_node
;
6200 /* A template template parameter is encountered. */
6201 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
)
6202 && for_each_template_parm (TREE_TYPE (t
), fn
, data
, pfd
->visited
,
6203 pfd
->include_nondeduced_p
))
6204 return error_mark_node
;
6206 /* Already substituted template template parameter */
6212 || for_each_template_parm (TYPENAME_TYPE_FULLNAME (t
), fn
,
6214 pfd
->include_nondeduced_p
))
6215 return error_mark_node
;
6219 if (TREE_TYPE (t
) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t
))
6220 && pfd
->include_nondeduced_p
6221 && for_each_template_parm (TYPE_PTRMEMFUNC_FN_TYPE
6222 (TREE_TYPE (t
)), fn
, data
,
6223 pfd
->visited
, pfd
->include_nondeduced_p
))
6224 return error_mark_node
;
6229 /* If there's no type, then this thing must be some expression
6230 involving template parameters. */
6231 if (!fn
&& !TREE_TYPE (t
))
6232 return error_mark_node
;
6237 case REINTERPRET_CAST_EXPR
:
6238 case CONST_CAST_EXPR
:
6239 case STATIC_CAST_EXPR
:
6240 case DYNAMIC_CAST_EXPR
:
6244 case PSEUDO_DTOR_EXPR
:
6246 return error_mark_node
;
6253 /* We didn't find any template parameters we liked. */
6257 /* For each TEMPLATE_TYPE_PARM, TEMPLATE_TEMPLATE_PARM,
6258 BOUND_TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX in T,
6259 call FN with the parameter and the DATA.
6260 If FN returns nonzero, the iteration is terminated, and
6261 for_each_template_parm returns 1. Otherwise, the iteration
6262 continues. If FN never returns a nonzero value, the value
6263 returned by for_each_template_parm is 0. If FN is NULL, it is
6264 considered to be the function which always returns 1.
6266 If INCLUDE_NONDEDUCED_P, then this routine will also visit template
6267 parameters that occur in non-deduced contexts. When false, only
6268 visits those template parameters that can be deduced. */
6271 for_each_template_parm (tree t
, tree_fn_t fn
, void* data
,
6272 struct pointer_set_t
*visited
,
6273 bool include_nondeduced_p
)
6275 struct pair_fn_data pfd
;
6281 pfd
.include_nondeduced_p
= include_nondeduced_p
;
6283 /* Walk the tree. (Conceptually, we would like to walk without
6284 duplicates, but for_each_template_parm_r recursively calls
6285 for_each_template_parm, so we would need to reorganize a fair
6286 bit to use walk_tree_without_duplicates, so we keep our own
6289 pfd
.visited
= visited
;
6291 pfd
.visited
= pointer_set_create ();
6292 result
= cp_walk_tree (&t
,
6293 for_each_template_parm_r
,
6295 pfd
.visited
) != NULL_TREE
;
6300 pointer_set_destroy (pfd
.visited
);
6307 /* Returns true if T depends on any template parameter. */
6310 uses_template_parms (tree t
)
6313 int saved_processing_template_decl
;
6315 saved_processing_template_decl
= processing_template_decl
;
6316 if (!saved_processing_template_decl
)
6317 processing_template_decl
= 1;
6319 dependent_p
= dependent_type_p (t
);
6320 else if (TREE_CODE (t
) == TREE_VEC
)
6321 dependent_p
= any_dependent_template_arguments_p (t
);
6322 else if (TREE_CODE (t
) == TREE_LIST
)
6323 dependent_p
= (uses_template_parms (TREE_VALUE (t
))
6324 || uses_template_parms (TREE_CHAIN (t
)));
6325 else if (TREE_CODE (t
) == TYPE_DECL
)
6326 dependent_p
= dependent_type_p (TREE_TYPE (t
));
6329 || TREE_CODE (t
) == TEMPLATE_PARM_INDEX
6330 || TREE_CODE (t
) == OVERLOAD
6331 || TREE_CODE (t
) == BASELINK
6332 || TREE_CODE (t
) == IDENTIFIER_NODE
6333 || TREE_CODE (t
) == TRAIT_EXPR
6334 || TREE_CODE (t
) == CONSTRUCTOR
6335 || CONSTANT_CLASS_P (t
))
6336 dependent_p
= (type_dependent_expression_p (t
)
6337 || value_dependent_expression_p (t
));
6340 gcc_assert (t
== error_mark_node
);
6341 dependent_p
= false;
6344 processing_template_decl
= saved_processing_template_decl
;
6349 /* Returns true if T depends on any template parameter with level LEVEL. */
6352 uses_template_parms_level (tree t
, int level
)
6354 return for_each_template_parm (t
, template_parm_this_level_p
, &level
, NULL
,
6355 /*include_nondeduced_p=*/true);
6358 static int tinst_depth
;
6359 extern int max_tinst_depth
;
6360 #ifdef GATHER_STATISTICS
6363 static int tinst_level_tick
;
6364 static int last_template_error_tick
;
6366 /* We're starting to instantiate D; record the template instantiation context
6367 for diagnostics and to restore it later. */
6370 push_tinst_level (tree d
)
6372 struct tinst_level
*new_level
;
6374 if (tinst_depth
>= max_tinst_depth
)
6376 /* If the instantiation in question still has unbound template parms,
6377 we don't really care if we can't instantiate it, so just return.
6378 This happens with base instantiation for implicit `typename'. */
6379 if (uses_template_parms (d
))
6382 last_template_error_tick
= tinst_level_tick
;
6383 error ("template instantiation depth exceeds maximum of %d (use "
6384 "-ftemplate-depth-NN to increase the maximum) instantiating %qD",
6385 max_tinst_depth
, d
);
6387 print_instantiation_context ();
6392 new_level
= GGC_NEW (struct tinst_level
);
6393 new_level
->decl
= d
;
6394 new_level
->locus
= input_location
;
6395 new_level
->in_system_header_p
= in_system_header
;
6396 new_level
->next
= current_tinst_level
;
6397 current_tinst_level
= new_level
;
6400 #ifdef GATHER_STATISTICS
6401 if (tinst_depth
> depth_reached
)
6402 depth_reached
= tinst_depth
;
6409 /* We're done instantiating this template; return to the instantiation
6413 pop_tinst_level (void)
6415 /* Restore the filename and line number stashed away when we started
6416 this instantiation. */
6417 input_location
= current_tinst_level
->locus
;
6418 current_tinst_level
= current_tinst_level
->next
;
6423 /* We're instantiating a deferred template; restore the template
6424 instantiation context in which the instantiation was requested, which
6425 is one step out from LEVEL. Return the corresponding DECL or TYPE. */
6428 reopen_tinst_level (struct tinst_level
*level
)
6430 struct tinst_level
*t
;
6433 for (t
= level
; t
; t
= t
->next
)
6436 current_tinst_level
= level
;
6441 /* Returns the TINST_LEVEL which gives the original instantiation
6444 struct tinst_level
*
6445 outermost_tinst_level (void)
6447 struct tinst_level
*level
= current_tinst_level
;
6450 level
= level
->next
;
6454 /* Returns TRUE if PARM is a parameter of the template TEMPL. */
6457 parameter_of_template_p (tree parm
, tree templ
)
6462 if (!parm
|| !templ
)
6465 gcc_assert (DECL_TEMPLATE_PARM_P (parm
));
6466 gcc_assert (TREE_CODE (templ
) == TEMPLATE_DECL
);
6468 parms
= DECL_TEMPLATE_PARMS (templ
);
6469 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
6471 for (i
= 0; i
< TREE_VEC_LENGTH (parms
); ++i
)
6472 if (parm
== TREE_VALUE (TREE_VEC_ELT (parms
, i
)))
6478 /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the
6479 vector of template arguments, as for tsubst.
6481 Returns an appropriate tsubst'd friend declaration. */
6484 tsubst_friend_function (tree decl
, tree args
)
6488 if (TREE_CODE (decl
) == FUNCTION_DECL
6489 && DECL_TEMPLATE_INSTANTIATION (decl
)
6490 && TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
6491 /* This was a friend declared with an explicit template
6492 argument list, e.g.:
6496 to indicate that f was a template instantiation, not a new
6497 function declaration. Now, we have to figure out what
6498 instantiation of what template. */
6500 tree template_id
, arglist
, fns
;
6503 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (current_class_type
));
6505 /* Friend functions are looked up in the containing namespace scope.
6506 We must enter that scope, to avoid finding member functions of the
6507 current class with same name. */
6508 push_nested_namespace (ns
);
6509 fns
= tsubst_expr (DECL_TI_TEMPLATE (decl
), args
,
6510 tf_warning_or_error
, NULL_TREE
,
6511 /*integral_constant_expression_p=*/false);
6512 pop_nested_namespace (ns
);
6513 arglist
= tsubst (DECL_TI_ARGS (decl
), args
,
6514 tf_warning_or_error
, NULL_TREE
);
6515 template_id
= lookup_template_function (fns
, arglist
);
6517 new_friend
= tsubst (decl
, args
, tf_warning_or_error
, NULL_TREE
);
6518 tmpl
= determine_specialization (template_id
, new_friend
,
6520 /*need_member_template=*/0,
6521 TREE_VEC_LENGTH (args
),
6523 return instantiate_template (tmpl
, new_args
, tf_error
);
6526 new_friend
= tsubst (decl
, args
, tf_warning_or_error
, NULL_TREE
);
6528 /* The NEW_FRIEND will look like an instantiation, to the
6529 compiler, but is not an instantiation from the point of view of
6530 the language. For example, we might have had:
6532 template <class T> struct S {
6533 template <class U> friend void f(T, U);
6536 Then, in S<int>, template <class U> void f(int, U) is not an
6537 instantiation of anything. */
6538 if (new_friend
== error_mark_node
)
6539 return error_mark_node
;
6541 DECL_USE_TEMPLATE (new_friend
) = 0;
6542 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
6544 DECL_USE_TEMPLATE (DECL_TEMPLATE_RESULT (new_friend
)) = 0;
6545 DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (new_friend
))
6546 = DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (decl
));
6549 /* The mangled name for the NEW_FRIEND is incorrect. The function
6550 is not a template instantiation and should not be mangled like
6551 one. Therefore, we forget the mangling here; we'll recompute it
6552 later if we need it. */
6553 if (TREE_CODE (new_friend
) != TEMPLATE_DECL
)
6555 SET_DECL_RTL (new_friend
, NULL_RTX
);
6556 SET_DECL_ASSEMBLER_NAME (new_friend
, NULL_TREE
);
6559 if (DECL_NAMESPACE_SCOPE_P (new_friend
))
6562 tree new_friend_template_info
;
6563 tree new_friend_result_template_info
;
6565 int new_friend_is_defn
;
6567 /* We must save some information from NEW_FRIEND before calling
6568 duplicate decls since that function will free NEW_FRIEND if
6570 new_friend_template_info
= DECL_TEMPLATE_INFO (new_friend
);
6571 new_friend_is_defn
=
6572 (DECL_INITIAL (DECL_TEMPLATE_RESULT
6573 (template_for_substitution (new_friend
)))
6575 if (TREE_CODE (new_friend
) == TEMPLATE_DECL
)
6577 /* This declaration is a `primary' template. */
6578 DECL_PRIMARY_TEMPLATE (new_friend
) = new_friend
;
6580 new_friend_result_template_info
6581 = DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (new_friend
));
6584 new_friend_result_template_info
= NULL_TREE
;
6586 /* Make the init_value nonzero so pushdecl knows this is a defn. */
6587 if (new_friend_is_defn
)
6588 DECL_INITIAL (new_friend
) = error_mark_node
;
6590 /* Inside pushdecl_namespace_level, we will push into the
6591 current namespace. However, the friend function should go
6592 into the namespace of the template. */
6593 ns
= decl_namespace_context (new_friend
);
6594 push_nested_namespace (ns
);
6595 old_decl
= pushdecl_namespace_level (new_friend
, /*is_friend=*/true);
6596 pop_nested_namespace (ns
);
6598 if (old_decl
== error_mark_node
)
6599 return error_mark_node
;
6601 if (old_decl
!= new_friend
)
6603 /* This new friend declaration matched an existing
6604 declaration. For example, given:
6606 template <class T> void f(T);
6607 template <class U> class C {
6608 template <class T> friend void f(T) {}
6611 the friend declaration actually provides the definition
6612 of `f', once C has been instantiated for some type. So,
6613 old_decl will be the out-of-class template declaration,
6614 while new_friend is the in-class definition.
6616 But, if `f' was called before this point, the
6617 instantiation of `f' will have DECL_TI_ARGS corresponding
6618 to `T' but not to `U', references to which might appear
6619 in the definition of `f'. Previously, the most general
6620 template for an instantiation of `f' was the out-of-class
6621 version; now it is the in-class version. Therefore, we
6622 run through all specialization of `f', adding to their
6623 DECL_TI_ARGS appropriately. In particular, they need a
6624 new set of outer arguments, corresponding to the
6625 arguments for this class instantiation.
6627 The same situation can arise with something like this:
6630 template <class T> class C {
6634 when `C<int>' is instantiated. Now, `f(int)' is defined
6637 if (!new_friend_is_defn
)
6638 /* On the other hand, if the in-class declaration does
6639 *not* provide a definition, then we don't want to alter
6640 existing definitions. We can just leave everything
6645 /* Overwrite whatever template info was there before, if
6646 any, with the new template information pertaining to
6648 DECL_TEMPLATE_INFO (old_decl
) = new_friend_template_info
;
6650 if (TREE_CODE (old_decl
) != TEMPLATE_DECL
)
6651 reregister_specialization (new_friend
,
6652 most_general_template (old_decl
),
6657 tree new_friend_args
;
6659 DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (old_decl
))
6660 = new_friend_result_template_info
;
6662 new_friend_args
= TI_ARGS (new_friend_template_info
);
6663 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (old_decl
);
6667 tree spec
= TREE_VALUE (t
);
6670 = add_outermost_template_args (new_friend_args
,
6671 DECL_TI_ARGS (spec
));
6674 /* Now, since specializations are always supposed to
6675 hang off of the most general template, we must move
6677 t
= most_general_template (old_decl
);
6680 DECL_TEMPLATE_SPECIALIZATIONS (t
)
6681 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (t
),
6682 DECL_TEMPLATE_SPECIALIZATIONS (old_decl
));
6683 DECL_TEMPLATE_SPECIALIZATIONS (old_decl
) = NULL_TREE
;
6688 /* The information from NEW_FRIEND has been merged into OLD_DECL
6689 by duplicate_decls. */
6690 new_friend
= old_decl
;
6695 tree context
= DECL_CONTEXT (new_friend
);
6699 template <class T> class C {
6700 template <class U> friend void C1<U>::f (); // case 1
6701 friend void C2<T>::f (); // case 2
6703 we only need to make sure CONTEXT is a complete type for
6704 case 2. To distinguish between the two cases, we note that
6705 CONTEXT of case 1 remains dependent type after tsubst while
6706 this isn't true for case 2. */
6707 ++processing_template_decl
;
6708 dependent_p
= dependent_type_p (context
);
6709 --processing_template_decl
;
6712 && !complete_type_or_else (context
, NULL_TREE
))
6713 return error_mark_node
;
6715 if (COMPLETE_TYPE_P (context
))
6717 /* Check to see that the declaration is really present, and,
6718 possibly obtain an improved declaration. */
6719 tree fn
= check_classfn (context
,
6720 new_friend
, NULL_TREE
);
6730 /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of
6731 template arguments, as for tsubst.
6733 Returns an appropriate tsubst'd friend type or error_mark_node on
6737 tsubst_friend_class (tree friend_tmpl
, tree args
)
6743 context
= DECL_CONTEXT (friend_tmpl
);
6747 if (TREE_CODE (context
) == NAMESPACE_DECL
)
6748 push_nested_namespace (context
);
6750 push_nested_class (tsubst (context
, args
, tf_none
, NULL_TREE
));
6753 /* Look for a class template declaration. We look for hidden names
6754 because two friend declarations of the same template are the
6755 same. For example, in:
6758 template <typename> friend class F;
6760 template <typename> struct B {
6761 template <typename> friend class F;
6764 both F templates are the same. */
6765 tmpl
= lookup_name_real (DECL_NAME (friend_tmpl
), 0, 0,
6766 /*block_p=*/true, 0,
6767 LOOKUP_COMPLAIN
| LOOKUP_HIDDEN
);
6769 /* But, if we don't find one, it might be because we're in a
6770 situation like this:
6778 Here, in the scope of (say) S<int>, `S' is bound to a TYPE_DECL
6779 for `S<int>', not the TEMPLATE_DECL. */
6780 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
6782 tmpl
= lookup_name_prefer_type (DECL_NAME (friend_tmpl
), 1);
6783 tmpl
= maybe_get_template_decl_from_type_decl (tmpl
);
6786 if (tmpl
&& DECL_CLASS_TEMPLATE_P (tmpl
))
6788 /* The friend template has already been declared. Just
6789 check to see that the declarations match, and install any new
6790 default parameters. We must tsubst the default parameters,
6791 of course. We only need the innermost template parameters
6792 because that is all that redeclare_class_template will look
6794 if (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (friend_tmpl
))
6795 > TMPL_ARGS_DEPTH (args
))
6798 location_t saved_input_location
;
6799 parms
= tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_tmpl
),
6800 args
, tf_warning_or_error
);
6802 saved_input_location
= input_location
;
6803 input_location
= DECL_SOURCE_LOCATION (friend_tmpl
);
6804 redeclare_class_template (TREE_TYPE (tmpl
), parms
);
6805 input_location
= saved_input_location
;
6809 friend_type
= TREE_TYPE (tmpl
);
6813 /* The friend template has not already been declared. In this
6814 case, the instantiation of the template class will cause the
6815 injection of this template into the global scope. */
6816 tmpl
= tsubst (friend_tmpl
, args
, tf_warning_or_error
, NULL_TREE
);
6817 if (tmpl
== error_mark_node
)
6818 return error_mark_node
;
6820 /* The new TMPL is not an instantiation of anything, so we
6821 forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE for
6822 the new type because that is supposed to be the corresponding
6823 template decl, i.e., TMPL. */
6824 DECL_USE_TEMPLATE (tmpl
) = 0;
6825 DECL_TEMPLATE_INFO (tmpl
) = NULL_TREE
;
6826 CLASSTYPE_USE_TEMPLATE (TREE_TYPE (tmpl
)) = 0;
6827 CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl
))
6828 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl
)));
6830 /* Inject this template into the global scope. */
6831 friend_type
= TREE_TYPE (pushdecl_top_level_maybe_friend (tmpl
, true));
6836 if (TREE_CODE (context
) == NAMESPACE_DECL
)
6837 pop_nested_namespace (context
);
6839 pop_nested_class ();
6845 /* Returns zero if TYPE cannot be completed later due to circularity.
6846 Otherwise returns one. */
6849 can_complete_type_without_circularity (tree type
)
6851 if (type
== NULL_TREE
|| type
== error_mark_node
)
6853 else if (COMPLETE_TYPE_P (type
))
6855 else if (TREE_CODE (type
) == ARRAY_TYPE
&& TYPE_DOMAIN (type
))
6856 return can_complete_type_without_circularity (TREE_TYPE (type
));
6857 else if (CLASS_TYPE_P (type
)
6858 && TYPE_BEING_DEFINED (TYPE_MAIN_VARIANT (type
)))
6864 /* Apply any attributes which had to be deferred until instantiation
6865 time. DECL_P, ATTRIBUTES and ATTR_FLAGS are as cplus_decl_attributes;
6866 ARGS, COMPLAIN, IN_DECL are as tsubst. */
6869 apply_late_template_attributes (tree
*decl_p
, tree attributes
, int attr_flags
,
6870 tree args
, tsubst_flags_t complain
, tree in_decl
)
6872 tree last_dep
= NULL_TREE
;
6876 for (t
= attributes
; t
; t
= TREE_CHAIN (t
))
6877 if (ATTR_IS_DEPENDENT (t
))
6880 attributes
= copy_list (attributes
);
6884 if (DECL_P (*decl_p
))
6886 if (TREE_TYPE (*decl_p
) == error_mark_node
)
6888 p
= &DECL_ATTRIBUTES (*decl_p
);
6891 p
= &TYPE_ATTRIBUTES (*decl_p
);
6895 tree late_attrs
= NULL_TREE
;
6896 tree
*q
= &late_attrs
;
6898 for (*p
= attributes
; *p
; )
6901 if (ATTR_IS_DEPENDENT (t
))
6903 *p
= TREE_CHAIN (t
);
6904 TREE_CHAIN (t
) = NULL_TREE
;
6905 /* If the first attribute argument is an identifier, don't
6906 pass it through tsubst. Attributes like mode, format,
6907 cleanup and several target specific attributes expect it
6910 && TREE_CODE (TREE_VALUE (t
)) == TREE_LIST
6911 && TREE_VALUE (TREE_VALUE (t
))
6912 && (TREE_CODE (TREE_VALUE (TREE_VALUE (t
)))
6913 == IDENTIFIER_NODE
))
6916 = tsubst_expr (TREE_CHAIN (TREE_VALUE (t
)), args
, complain
,
6918 /*integral_constant_expression_p=*/false);
6919 if (chain
!= TREE_CHAIN (TREE_VALUE (t
)))
6921 = tree_cons (NULL_TREE
, TREE_VALUE (TREE_VALUE (t
)),
6926 = tsubst_expr (TREE_VALUE (t
), args
, complain
, in_decl
,
6927 /*integral_constant_expression_p=*/false);
6929 q
= &TREE_CHAIN (t
);
6932 p
= &TREE_CHAIN (t
);
6935 cplus_decl_attributes (decl_p
, late_attrs
, attr_flags
);
6939 /* Perform (or defer) access check for typedefs that were referenced
6940 from within the template TMPL code.
6941 This is a subroutine of instantiate_template and instantiate_class_template.
6942 TMPL is the template to consider and TARGS is the list of arguments of
6946 perform_typedefs_access_check (tree tmpl
, tree targs
)
6951 || (TREE_CODE (tmpl
) != RECORD_TYPE
6952 && TREE_CODE (tmpl
) != FUNCTION_DECL
))
6955 for (t
= get_types_needing_access_check (tmpl
); t
; t
= TREE_CHAIN (t
))
6957 tree type_decl
= TREE_PURPOSE (t
);
6958 tree type_scope
= TREE_VALUE (t
);
6960 if (!type_decl
|| !type_scope
|| !CLASS_TYPE_P (type_scope
))
6963 if (uses_template_parms (type_decl
))
6964 type_decl
= tsubst (type_decl
, targs
, tf_error
, NULL_TREE
);
6965 if (uses_template_parms (type_scope
))
6966 type_scope
= tsubst (type_scope
, targs
, tf_error
, NULL_TREE
);
6968 perform_or_defer_access_check (TYPE_BINFO (type_scope
),
6969 type_decl
, type_decl
);
6974 instantiate_class_template (tree type
)
6976 tree templ
, args
, pattern
, t
, member
;
6981 if (type
== error_mark_node
)
6982 return error_mark_node
;
6984 if (TYPE_BEING_DEFINED (type
)
6985 || COMPLETE_TYPE_P (type
)
6986 || dependent_type_p (type
))
6989 /* Figure out which template is being instantiated. */
6990 templ
= most_general_template (CLASSTYPE_TI_TEMPLATE (type
));
6991 gcc_assert (TREE_CODE (templ
) == TEMPLATE_DECL
);
6993 /* Determine what specialization of the original template to
6995 t
= most_specialized_class (type
, templ
);
6996 if (t
== error_mark_node
)
6998 TYPE_BEING_DEFINED (type
) = 1;
6999 return error_mark_node
;
7003 /* This TYPE is actually an instantiation of a partial
7004 specialization. We replace the innermost set of ARGS with
7005 the arguments appropriate for substitution. For example,
7008 template <class T> struct S {};
7009 template <class T> struct S<T*> {};
7011 and supposing that we are instantiating S<int*>, ARGS will
7012 presently be {int*} -- but we need {int}. */
7013 pattern
= TREE_TYPE (t
);
7014 args
= TREE_PURPOSE (t
);
7018 pattern
= TREE_TYPE (templ
);
7019 args
= CLASSTYPE_TI_ARGS (type
);
7022 /* If the template we're instantiating is incomplete, then clearly
7023 there's nothing we can do. */
7024 if (!COMPLETE_TYPE_P (pattern
))
7027 /* If we've recursively instantiated too many templates, stop. */
7028 if (! push_tinst_level (type
))
7031 /* Now we're really doing the instantiation. Mark the type as in
7032 the process of being defined. */
7033 TYPE_BEING_DEFINED (type
) = 1;
7035 /* We may be in the middle of deferred access check. Disable
7037 push_deferring_access_checks (dk_no_deferred
);
7039 push_to_top_level ();
7041 SET_CLASSTYPE_INTERFACE_UNKNOWN (type
);
7043 /* Set the input location to the most specialized template definition.
7044 This is needed if tsubsting causes an error. */
7045 typedecl
= TYPE_MAIN_DECL (pattern
);
7046 input_location
= DECL_SOURCE_LOCATION (typedecl
);
7048 TYPE_HAS_USER_CONSTRUCTOR (type
) = TYPE_HAS_USER_CONSTRUCTOR (pattern
);
7049 TYPE_HAS_NEW_OPERATOR (type
) = TYPE_HAS_NEW_OPERATOR (pattern
);
7050 TYPE_HAS_ARRAY_NEW_OPERATOR (type
) = TYPE_HAS_ARRAY_NEW_OPERATOR (pattern
);
7051 TYPE_GETS_DELETE (type
) = TYPE_GETS_DELETE (pattern
);
7052 TYPE_HAS_ASSIGN_REF (type
) = TYPE_HAS_ASSIGN_REF (pattern
);
7053 TYPE_HAS_CONST_ASSIGN_REF (type
) = TYPE_HAS_CONST_ASSIGN_REF (pattern
);
7054 TYPE_HAS_INIT_REF (type
) = TYPE_HAS_INIT_REF (pattern
);
7055 TYPE_HAS_CONST_INIT_REF (type
) = TYPE_HAS_CONST_INIT_REF (pattern
);
7056 TYPE_HAS_DEFAULT_CONSTRUCTOR (type
) = TYPE_HAS_DEFAULT_CONSTRUCTOR (pattern
);
7057 TYPE_HAS_CONVERSION (type
) = TYPE_HAS_CONVERSION (pattern
);
7058 TYPE_PACKED (type
) = TYPE_PACKED (pattern
);
7059 TYPE_ALIGN (type
) = TYPE_ALIGN (pattern
);
7060 TYPE_USER_ALIGN (type
) = TYPE_USER_ALIGN (pattern
);
7061 TYPE_FOR_JAVA (type
) = TYPE_FOR_JAVA (pattern
); /* For libjava's JArray<T> */
7062 if (ANON_AGGR_TYPE_P (pattern
))
7063 SET_ANON_AGGR_TYPE_P (type
);
7064 if (CLASSTYPE_VISIBILITY_SPECIFIED (pattern
))
7066 CLASSTYPE_VISIBILITY_SPECIFIED (type
) = 1;
7067 CLASSTYPE_VISIBILITY (type
) = CLASSTYPE_VISIBILITY (pattern
);
7070 pbinfo
= TYPE_BINFO (pattern
);
7072 /* We should never instantiate a nested class before its enclosing
7073 class; we need to look up the nested class by name before we can
7074 instantiate it, and that lookup should instantiate the enclosing
7076 gcc_assert (!DECL_CLASS_SCOPE_P (TYPE_MAIN_DECL (pattern
))
7077 || COMPLETE_TYPE_P (TYPE_CONTEXT (type
))
7078 || TYPE_BEING_DEFINED (TYPE_CONTEXT (type
)));
7080 base_list
= NULL_TREE
;
7081 if (BINFO_N_BASE_BINFOS (pbinfo
))
7084 tree context
= TYPE_CONTEXT (type
);
7088 /* We must enter the scope containing the type, as that is where
7089 the accessibility of types named in dependent bases are
7091 pushed_scope
= push_scope (context
? context
: global_namespace
);
7093 /* Substitute into each of the bases to determine the actual
7095 for (i
= 0; BINFO_BASE_ITERATE (pbinfo
, i
, pbase_binfo
); i
++)
7098 tree access
= BINFO_BASE_ACCESS (pbinfo
, i
);
7099 tree expanded_bases
= NULL_TREE
;
7102 if (PACK_EXPANSION_P (BINFO_TYPE (pbase_binfo
)))
7105 tsubst_pack_expansion (BINFO_TYPE (pbase_binfo
),
7106 args
, tf_error
, NULL_TREE
);
7107 if (expanded_bases
== error_mark_node
)
7110 len
= TREE_VEC_LENGTH (expanded_bases
);
7113 for (idx
= 0; idx
< len
; idx
++)
7116 /* Extract the already-expanded base class. */
7117 base
= TREE_VEC_ELT (expanded_bases
, idx
);
7119 /* Substitute to figure out the base class. */
7120 base
= tsubst (BINFO_TYPE (pbase_binfo
), args
, tf_error
,
7123 if (base
== error_mark_node
)
7126 base_list
= tree_cons (access
, base
, base_list
);
7127 if (BINFO_VIRTUAL_P (pbase_binfo
))
7128 TREE_TYPE (base_list
) = integer_type_node
;
7132 /* The list is now in reverse order; correct that. */
7133 base_list
= nreverse (base_list
);
7136 pop_scope (pushed_scope
);
7138 /* Now call xref_basetypes to set up all the base-class
7140 xref_basetypes (type
, base_list
);
7142 apply_late_template_attributes (&type
, TYPE_ATTRIBUTES (pattern
),
7143 (int) ATTR_FLAG_TYPE_IN_PLACE
,
7144 args
, tf_error
, NULL_TREE
);
7146 /* Now that our base classes are set up, enter the scope of the
7147 class, so that name lookups into base classes, etc. will work
7148 correctly. This is precisely analogous to what we do in
7149 begin_class_definition when defining an ordinary non-template
7150 class, except we also need to push the enclosing classes. */
7151 push_nested_class (type
);
7153 /* Now members are processed in the order of declaration. */
7154 for (member
= CLASSTYPE_DECL_LIST (pattern
);
7155 member
; member
= TREE_CHAIN (member
))
7157 tree t
= TREE_VALUE (member
);
7159 if (TREE_PURPOSE (member
))
7163 /* Build new CLASSTYPE_NESTED_UTDS. */
7166 bool class_template_p
;
7168 class_template_p
= (TREE_CODE (t
) != ENUMERAL_TYPE
7169 && TYPE_LANG_SPECIFIC (t
)
7170 && CLASSTYPE_IS_TEMPLATE (t
));
7171 /* If the member is a class template, then -- even after
7172 substitution -- there may be dependent types in the
7173 template argument list for the class. We increment
7174 PROCESSING_TEMPLATE_DECL so that dependent_type_p, as
7175 that function will assume that no types are dependent
7176 when outside of a template. */
7177 if (class_template_p
)
7178 ++processing_template_decl
;
7179 newtag
= tsubst (t
, args
, tf_error
, NULL_TREE
);
7180 if (class_template_p
)
7181 --processing_template_decl
;
7182 if (newtag
== error_mark_node
)
7185 if (TREE_CODE (newtag
) != ENUMERAL_TYPE
)
7187 tree name
= TYPE_IDENTIFIER (t
);
7189 if (class_template_p
)
7190 /* Unfortunately, lookup_template_class sets
7191 CLASSTYPE_IMPLICIT_INSTANTIATION for a partial
7192 instantiation (i.e., for the type of a member
7193 template class nested within a template class.)
7194 This behavior is required for
7195 maybe_process_partial_specialization to work
7196 correctly, but is not accurate in this case;
7197 the TAG is not an instantiation of anything.
7198 (The corresponding TEMPLATE_DECL is an
7199 instantiation, but the TYPE is not.) */
7200 CLASSTYPE_USE_TEMPLATE (newtag
) = 0;
7202 /* Now, we call pushtag to put this NEWTAG into the scope of
7203 TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid
7204 pushtag calling push_template_decl. We don't have to do
7205 this for enums because it will already have been done in
7208 SET_IDENTIFIER_TYPE_VALUE (name
, newtag
);
7209 pushtag (name
, newtag
, /*tag_scope=*/ts_current
);
7212 else if (TREE_CODE (t
) == FUNCTION_DECL
7213 || DECL_FUNCTION_TEMPLATE_P (t
))
7215 /* Build new TYPE_METHODS. */
7218 if (TREE_CODE (t
) == TEMPLATE_DECL
)
7219 ++processing_template_decl
;
7220 r
= tsubst (t
, args
, tf_error
, NULL_TREE
);
7221 if (TREE_CODE (t
) == TEMPLATE_DECL
)
7222 --processing_template_decl
;
7223 set_current_access_from_decl (r
);
7224 finish_member_declaration (r
);
7228 /* Build new TYPE_FIELDS. */
7229 if (TREE_CODE (t
) == STATIC_ASSERT
)
7232 tsubst_expr (STATIC_ASSERT_CONDITION (t
), args
,
7233 tf_warning_or_error
, NULL_TREE
,
7234 /*integral_constant_expression_p=*/true);
7235 finish_static_assert (condition
,
7236 STATIC_ASSERT_MESSAGE (t
),
7237 STATIC_ASSERT_SOURCE_LOCATION (t
),
7240 else if (TREE_CODE (t
) != CONST_DECL
)
7244 /* The file and line for this declaration, to
7245 assist in error message reporting. Since we
7246 called push_tinst_level above, we don't need to
7248 input_location
= DECL_SOURCE_LOCATION (t
);
7250 if (TREE_CODE (t
) == TEMPLATE_DECL
)
7251 ++processing_template_decl
;
7252 r
= tsubst (t
, args
, tf_warning_or_error
, NULL_TREE
);
7253 if (TREE_CODE (t
) == TEMPLATE_DECL
)
7254 --processing_template_decl
;
7255 if (TREE_CODE (r
) == VAR_DECL
)
7259 [t]he initialization (and any associated
7260 side-effects) of a static data member does
7261 not occur unless the static data member is
7262 itself used in a way that requires the
7263 definition of the static data member to
7266 Therefore, we do not substitute into the
7267 initialized for the static data member here. */
7268 finish_static_data_member_decl
7271 /*init_const_expr_p=*/false,
7272 /*asmspec_tree=*/NULL_TREE
,
7274 if (DECL_INITIALIZED_IN_CLASS_P (r
))
7275 check_static_variable_definition (r
, TREE_TYPE (r
));
7277 else if (TREE_CODE (r
) == FIELD_DECL
)
7279 /* Determine whether R has a valid type and can be
7280 completed later. If R is invalid, then it is
7281 replaced by error_mark_node so that it will not be
7282 added to TYPE_FIELDS. */
7283 tree rtype
= TREE_TYPE (r
);
7284 if (can_complete_type_without_circularity (rtype
))
7285 complete_type (rtype
);
7287 if (!COMPLETE_TYPE_P (rtype
))
7289 cxx_incomplete_type_error (r
, rtype
);
7290 r
= error_mark_node
;
7294 /* If it is a TYPE_DECL for a class-scoped ENUMERAL_TYPE,
7295 such a thing will already have been added to the field
7296 list by tsubst_enum in finish_member_declaration in the
7297 CLASSTYPE_NESTED_UTDS case above. */
7298 if (!(TREE_CODE (r
) == TYPE_DECL
7299 && TREE_CODE (TREE_TYPE (r
)) == ENUMERAL_TYPE
7300 && DECL_ARTIFICIAL (r
)))
7302 set_current_access_from_decl (r
);
7303 finish_member_declaration (r
);
7310 if (TYPE_P (t
) || DECL_CLASS_TEMPLATE_P (t
))
7312 /* Build new CLASSTYPE_FRIEND_CLASSES. */
7314 tree friend_type
= t
;
7315 bool adjust_processing_template_decl
= false;
7317 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
7319 /* template <class T> friend class C; */
7320 friend_type
= tsubst_friend_class (friend_type
, args
);
7321 adjust_processing_template_decl
= true;
7323 else if (TREE_CODE (friend_type
) == UNBOUND_CLASS_TEMPLATE
)
7325 /* template <class T> friend class C::D; */
7326 friend_type
= tsubst (friend_type
, args
,
7327 tf_warning_or_error
, NULL_TREE
);
7328 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
7329 friend_type
= TREE_TYPE (friend_type
);
7330 adjust_processing_template_decl
= true;
7332 else if (TREE_CODE (friend_type
) == TYPENAME_TYPE
)
7334 /* This could be either
7338 when dependent_type_p is false or
7340 template <class U> friend class T::C;
7343 friend_type
= tsubst (friend_type
, args
,
7344 tf_warning_or_error
, NULL_TREE
);
7345 /* Bump processing_template_decl for correct
7346 dependent_type_p calculation. */
7347 ++processing_template_decl
;
7348 if (dependent_type_p (friend_type
))
7349 adjust_processing_template_decl
= true;
7350 --processing_template_decl
;
7352 else if (!CLASSTYPE_USE_TEMPLATE (friend_type
)
7353 && hidden_name_p (TYPE_NAME (friend_type
)))
7357 where C hasn't been declared yet. Let's lookup name
7358 from namespace scope directly, bypassing any name that
7359 come from dependent base class. */
7360 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (friend_type
));
7362 /* The call to xref_tag_from_type does injection for friend
7364 push_nested_namespace (ns
);
7366 xref_tag_from_type (friend_type
, NULL_TREE
,
7367 /*tag_scope=*/ts_current
);
7368 pop_nested_namespace (ns
);
7370 else if (uses_template_parms (friend_type
))
7371 /* friend class C<T>; */
7372 friend_type
= tsubst (friend_type
, args
,
7373 tf_warning_or_error
, NULL_TREE
);
7378 where C is already declared or
7380 friend class C<int>;
7382 We don't have to do anything in these cases. */
7384 if (adjust_processing_template_decl
)
7385 /* Trick make_friend_class into realizing that the friend
7386 we're adding is a template, not an ordinary class. It's
7387 important that we use make_friend_class since it will
7388 perform some error-checking and output cross-reference
7390 ++processing_template_decl
;
7392 if (friend_type
!= error_mark_node
)
7393 make_friend_class (type
, friend_type
, /*complain=*/false);
7395 if (adjust_processing_template_decl
)
7396 --processing_template_decl
;
7400 /* Build new DECL_FRIENDLIST. */
7403 /* The file and line for this declaration, to
7404 assist in error message reporting. Since we
7405 called push_tinst_level above, we don't need to
7407 input_location
= DECL_SOURCE_LOCATION (t
);
7409 if (TREE_CODE (t
) == TEMPLATE_DECL
)
7411 ++processing_template_decl
;
7412 push_deferring_access_checks (dk_no_check
);
7415 r
= tsubst_friend_function (t
, args
);
7416 add_friend (type
, r
, /*complain=*/false);
7417 if (TREE_CODE (t
) == TEMPLATE_DECL
)
7419 pop_deferring_access_checks ();
7420 --processing_template_decl
;
7426 /* Set the file and line number information to whatever is given for
7427 the class itself. This puts error messages involving generated
7428 implicit functions at a predictable point, and the same point
7429 that would be used for non-template classes. */
7430 input_location
= DECL_SOURCE_LOCATION (typedecl
);
7432 unreverse_member_declarations (type
);
7433 finish_struct_1 (type
);
7434 TYPE_BEING_DEFINED (type
) = 0;
7436 /* Now that the class is complete, instantiate default arguments for
7437 any member functions. We don't do this earlier because the
7438 default arguments may reference members of the class. */
7439 if (!PRIMARY_TEMPLATE_P (templ
))
7440 for (t
= TYPE_METHODS (type
); t
; t
= TREE_CHAIN (t
))
7441 if (TREE_CODE (t
) == FUNCTION_DECL
7442 /* Implicitly generated member functions will not have template
7443 information; they are not instantiations, but instead are
7444 created "fresh" for each instantiation. */
7445 && DECL_TEMPLATE_INFO (t
))
7446 tsubst_default_arguments (t
);
7448 /* Some typedefs referenced from within the template code need to be access
7449 checked at template instantiation time, i.e now. These types were
7450 added to the template at parsing time. Let's get those and perform
7451 the access checks then. */
7452 perform_typedefs_access_check (pattern
, args
);
7453 perform_deferred_access_checks ();
7454 pop_nested_class ();
7455 pop_from_top_level ();
7456 pop_deferring_access_checks ();
7459 /* The vtable for a template class can be emitted in any translation
7460 unit in which the class is instantiated. When there is no key
7461 method, however, finish_struct_1 will already have added TYPE to
7462 the keyed_classes list. */
7463 if (TYPE_CONTAINS_VPTR_P (type
) && CLASSTYPE_KEY_METHOD (type
))
7464 keyed_classes
= tree_cons (NULL_TREE
, type
, keyed_classes
);
7470 tsubst_template_arg (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
7476 else if (TYPE_P (t
))
7477 r
= tsubst (t
, args
, complain
, in_decl
);
7480 r
= tsubst_expr (t
, args
, complain
, in_decl
,
7481 /*integral_constant_expression_p=*/true);
7482 r
= fold_non_dependent_expr (r
);
7487 /* Give a chain SPEC_PARM of PARM_DECLs, pack them into a
7488 NONTYPE_ARGUMENT_PACK. */
7491 make_fnparm_pack (tree spec_parm
)
7493 /* Collect all of the extra "packed" parameters into an
7497 tree argpack
= make_node (NONTYPE_ARGUMENT_PACK
);
7498 tree argtypepack
= make_node (TYPE_ARGUMENT_PACK
);
7499 int i
, len
= list_length (spec_parm
);
7501 /* Fill in PARMVEC and PARMTYPEVEC with all of the parameters. */
7502 parmvec
= make_tree_vec (len
);
7503 parmtypevec
= make_tree_vec (len
);
7504 for (i
= 0; i
< len
; i
++, spec_parm
= TREE_CHAIN (spec_parm
))
7506 TREE_VEC_ELT (parmvec
, i
) = spec_parm
;
7507 TREE_VEC_ELT (parmtypevec
, i
) = TREE_TYPE (spec_parm
);
7510 /* Build the argument packs. */
7511 SET_ARGUMENT_PACK_ARGS (argpack
, parmvec
);
7512 SET_ARGUMENT_PACK_ARGS (argtypepack
, parmtypevec
);
7513 TREE_TYPE (argpack
) = argtypepack
;
7518 /* Substitute ARGS into T, which is an pack expansion
7519 (i.e. TYPE_PACK_EXPANSION or EXPR_PACK_EXPANSION). Returns a
7520 TREE_VEC with the substituted arguments, a PACK_EXPANSION_* node
7521 (if only a partial substitution could be performed) or
7522 ERROR_MARK_NODE if there was an error. */
7524 tsubst_pack_expansion (tree t
, tree args
, tsubst_flags_t complain
,
7528 tree pack
, packs
= NULL_TREE
, unsubstituted_packs
= NULL_TREE
;
7529 tree first_arg_pack
; int i
, len
= -1;
7532 bool very_local_specializations
= false;
7534 gcc_assert (PACK_EXPANSION_P (t
));
7535 pattern
= PACK_EXPANSION_PATTERN (t
);
7537 /* Determine the argument packs that will instantiate the parameter
7538 packs used in the expansion expression. While we're at it,
7539 compute the number of arguments to be expanded and make sure it
7541 for (pack
= PACK_EXPANSION_PARAMETER_PACKS (t
); pack
;
7542 pack
= TREE_CHAIN (pack
))
7544 tree parm_pack
= TREE_VALUE (pack
);
7545 tree arg_pack
= NULL_TREE
;
7546 tree orig_arg
= NULL_TREE
;
7548 if (TREE_CODE (parm_pack
) == PARM_DECL
)
7550 arg_pack
= retrieve_local_specialization (parm_pack
);
7551 if (arg_pack
== NULL_TREE
)
7553 /* This can happen for a parameter name used later in a function
7554 declaration (such as in a late-specified return type). Just
7555 make a dummy decl, since it's only used for its type. */
7556 gcc_assert (skip_evaluation
);
7557 arg_pack
= tsubst_decl (parm_pack
, args
, complain
);
7558 arg_pack
= make_fnparm_pack (arg_pack
);
7563 int level
, idx
, levels
;
7564 template_parm_level_and_index (parm_pack
, &level
, &idx
);
7566 levels
= TMPL_ARGS_DEPTH (args
);
7567 if (level
<= levels
)
7568 arg_pack
= TMPL_ARG (args
, level
, idx
);
7571 orig_arg
= arg_pack
;
7572 if (arg_pack
&& TREE_CODE (arg_pack
) == ARGUMENT_PACK_SELECT
)
7573 arg_pack
= ARGUMENT_PACK_SELECT_FROM_PACK (arg_pack
);
7575 if (arg_pack
&& !ARGUMENT_PACK_P (arg_pack
))
7576 /* This can only happen if we forget to expand an argument
7577 pack somewhere else. Just return an error, silently. */
7579 result
= make_tree_vec (1);
7580 TREE_VEC_ELT (result
, 0) = error_mark_node
;
7585 && TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg_pack
)) == 1
7586 && PACK_EXPANSION_P (TREE_VEC_ELT (ARGUMENT_PACK_ARGS (arg_pack
), 0)))
7588 tree expansion
= TREE_VEC_ELT (ARGUMENT_PACK_ARGS (arg_pack
), 0);
7589 tree pattern
= PACK_EXPANSION_PATTERN (expansion
);
7590 if ((TYPE_P (pattern
) && same_type_p (pattern
, parm_pack
))
7591 || (!TYPE_P (pattern
) && cp_tree_equal (parm_pack
, pattern
)))
7592 /* The argument pack that the parameter maps to is just an
7593 expansion of the parameter itself, such as one would
7594 find in the implicit typedef of a class inside the
7595 class itself. Consider this parameter "unsubstituted",
7596 so that we will maintain the outer pack expansion. */
7597 arg_pack
= NULL_TREE
;
7603 TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg_pack
));
7605 /* It's all-or-nothing with incomplete argument packs. */
7606 if (incomplete
&& !ARGUMENT_PACK_INCOMPLETE_P (arg_pack
))
7607 return error_mark_node
;
7609 if (ARGUMENT_PACK_INCOMPLETE_P (arg_pack
))
7615 first_arg_pack
= arg_pack
;
7617 else if (len
!= my_len
)
7619 if (TREE_CODE (t
) == TYPE_PACK_EXPANSION
)
7620 error ("mismatched argument pack lengths while expanding "
7624 error ("mismatched argument pack lengths while expanding "
7627 return error_mark_node
;
7630 /* Keep track of the parameter packs and their corresponding
7632 packs
= tree_cons (parm_pack
, arg_pack
, packs
);
7633 TREE_TYPE (packs
) = orig_arg
;
7636 /* We can't substitute for this parameter pack. */
7637 unsubstituted_packs
= tree_cons (TREE_PURPOSE (pack
),
7639 unsubstituted_packs
);
7642 /* We cannot expand this expansion expression, because we don't have
7643 all of the argument packs we need. Substitute into the pattern
7644 and return a PACK_EXPANSION_*. The caller will need to deal with
7646 if (unsubstituted_packs
)
7647 return make_pack_expansion (tsubst (pattern
, args
, complain
,
7650 /* We could not find any argument packs that work. */
7652 return error_mark_node
;
7654 if (!local_specializations
)
7656 /* We're in a late-specified return type, so we don't have a local
7657 specializations table. Create one for doing this expansion. */
7658 very_local_specializations
= true;
7659 local_specializations
= htab_create (37,
7660 hash_local_specialization
,
7661 eq_local_specializations
,
7665 /* For each argument in each argument pack, substitute into the
7667 result
= make_tree_vec (len
+ incomplete
);
7668 for (i
= 0; i
< len
+ incomplete
; ++i
)
7670 /* For parameter pack, change the substitution of the parameter
7671 pack to the ith argument in its argument pack, then expand
7673 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
7675 tree parm
= TREE_PURPOSE (pack
);
7677 if (TREE_CODE (parm
) == PARM_DECL
)
7679 /* Select the Ith argument from the pack. */
7680 tree arg
= make_node (ARGUMENT_PACK_SELECT
);
7681 ARGUMENT_PACK_SELECT_FROM_PACK (arg
) = TREE_VALUE (pack
);
7682 ARGUMENT_PACK_SELECT_INDEX (arg
) = i
;
7684 register_local_specialization (arg
, parm
);
7690 template_parm_level_and_index (parm
, &level
, &idx
);
7694 /* Select the Ith argument from the pack. */
7695 value
= make_node (ARGUMENT_PACK_SELECT
);
7696 ARGUMENT_PACK_SELECT_FROM_PACK (value
) = TREE_VALUE (pack
);
7697 ARGUMENT_PACK_SELECT_INDEX (value
) = i
;
7700 /* Update the corresponding argument. */
7701 TMPL_ARG (args
, level
, idx
) = value
;
7705 /* Substitute into the PATTERN with the altered arguments. */
7706 if (TREE_CODE (t
) == EXPR_PACK_EXPANSION
)
7707 TREE_VEC_ELT (result
, i
) =
7708 tsubst_expr (pattern
, args
, complain
, in_decl
,
7709 /*integral_constant_expression_p=*/false);
7711 TREE_VEC_ELT (result
, i
) = tsubst (pattern
, args
, complain
, in_decl
);
7714 /* When we have incomplete argument packs, the last "expanded"
7715 result is itself a pack expansion, which allows us
7716 to deduce more arguments. */
7717 TREE_VEC_ELT (result
, i
) =
7718 make_pack_expansion (TREE_VEC_ELT (result
, i
));
7720 if (TREE_VEC_ELT (result
, i
) == error_mark_node
)
7722 result
= error_mark_node
;
7727 /* Update ARGS to restore the substitution from parameter packs to
7728 their argument packs. */
7729 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
7731 tree parm
= TREE_PURPOSE (pack
);
7733 if (TREE_CODE (parm
) == PARM_DECL
)
7734 register_local_specialization (TREE_TYPE (pack
), parm
);
7738 template_parm_level_and_index (parm
, &level
, &idx
);
7740 /* Update the corresponding argument. */
7741 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
7742 TREE_VEC_ELT (TREE_VEC_ELT (args
, level
-1 ), idx
) =
7745 TREE_VEC_ELT (args
, idx
) = TREE_TYPE (pack
);
7749 if (very_local_specializations
)
7751 htab_delete (local_specializations
);
7752 local_specializations
= NULL
;
7758 /* Substitute ARGS into the vector or list of template arguments T. */
7761 tsubst_template_args (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
7764 int len
= TREE_VEC_LENGTH (t
);
7765 int need_new
= 0, i
, expanded_len_adjust
= 0, out
;
7766 tree
*elts
= (tree
*) alloca (len
* sizeof (tree
));
7768 for (i
= 0; i
< len
; i
++)
7770 tree orig_arg
= TREE_VEC_ELT (t
, i
);
7773 if (TREE_CODE (orig_arg
) == TREE_VEC
)
7774 new_arg
= tsubst_template_args (orig_arg
, args
, complain
, in_decl
);
7775 else if (PACK_EXPANSION_P (orig_arg
))
7777 /* Substitute into an expansion expression. */
7778 new_arg
= tsubst_pack_expansion (orig_arg
, args
, complain
, in_decl
);
7780 if (TREE_CODE (new_arg
) == TREE_VEC
)
7781 /* Add to the expanded length adjustment the number of
7782 expanded arguments. We subtract one from this
7783 measurement, because the argument pack expression
7784 itself is already counted as 1 in
7785 LEN. EXPANDED_LEN_ADJUST can actually be negative, if
7786 the argument pack is empty. */
7787 expanded_len_adjust
+= TREE_VEC_LENGTH (new_arg
) - 1;
7789 else if (ARGUMENT_PACK_P (orig_arg
))
7791 /* Substitute into each of the arguments. */
7792 new_arg
= make_node (TREE_CODE (orig_arg
));
7794 SET_ARGUMENT_PACK_ARGS (
7796 tsubst_template_args (ARGUMENT_PACK_ARGS (orig_arg
),
7797 args
, complain
, in_decl
));
7799 if (ARGUMENT_PACK_ARGS (new_arg
) == error_mark_node
)
7800 new_arg
= error_mark_node
;
7802 if (TREE_CODE (new_arg
) == NONTYPE_ARGUMENT_PACK
) {
7803 TREE_TYPE (new_arg
) = tsubst (TREE_TYPE (orig_arg
), args
,
7805 TREE_CONSTANT (new_arg
) = TREE_CONSTANT (orig_arg
);
7807 if (TREE_TYPE (new_arg
) == error_mark_node
)
7808 new_arg
= error_mark_node
;
7812 new_arg
= tsubst_template_arg (orig_arg
, args
, complain
, in_decl
);
7814 if (new_arg
== error_mark_node
)
7815 return error_mark_node
;
7818 if (new_arg
!= orig_arg
)
7825 /* Make space for the expanded arguments coming from template
7827 t
= make_tree_vec (len
+ expanded_len_adjust
);
7828 for (i
= 0, out
= 0; i
< len
; i
++)
7830 if ((PACK_EXPANSION_P (TREE_VEC_ELT (orig_t
, i
))
7831 || ARGUMENT_PACK_P (TREE_VEC_ELT (orig_t
, i
)))
7832 && TREE_CODE (elts
[i
]) == TREE_VEC
)
7836 /* Now expand the template argument pack "in place". */
7837 for (idx
= 0; idx
< TREE_VEC_LENGTH (elts
[i
]); idx
++, out
++)
7838 TREE_VEC_ELT (t
, out
) = TREE_VEC_ELT (elts
[i
], idx
);
7842 TREE_VEC_ELT (t
, out
) = elts
[i
];
7850 /* Return the result of substituting ARGS into the template parameters
7851 given by PARMS. If there are m levels of ARGS and m + n levels of
7852 PARMS, then the result will contain n levels of PARMS. For
7853 example, if PARMS is `template <class T> template <class U>
7854 template <T*, U, class V>' and ARGS is {{int}, {double}} then the
7855 result will be `template <int*, double, class V>'. */
7858 tsubst_template_parms (tree parms
, tree args
, tsubst_flags_t complain
)
7863 /* When substituting into a template, we must set
7864 PROCESSING_TEMPLATE_DECL as the template parameters may be
7865 dependent if they are based on one-another, and the dependency
7866 predicates are short-circuit outside of templates. */
7867 ++processing_template_decl
;
7869 for (new_parms
= &r
;
7870 TMPL_PARMS_DEPTH (parms
) > TMPL_ARGS_DEPTH (args
);
7871 new_parms
= &(TREE_CHAIN (*new_parms
)),
7872 parms
= TREE_CHAIN (parms
))
7875 make_tree_vec (TREE_VEC_LENGTH (TREE_VALUE (parms
)));
7878 for (i
= 0; i
< TREE_VEC_LENGTH (new_vec
); ++i
)
7884 if (parms
== error_mark_node
)
7887 tuple
= TREE_VEC_ELT (TREE_VALUE (parms
), i
);
7889 if (tuple
== error_mark_node
)
7892 default_value
= TREE_PURPOSE (tuple
);
7893 parm_decl
= TREE_VALUE (tuple
);
7895 parm_decl
= tsubst (parm_decl
, args
, complain
, NULL_TREE
);
7896 if (TREE_CODE (parm_decl
) == PARM_DECL
7897 && invalid_nontype_parm_type_p (TREE_TYPE (parm_decl
), complain
))
7898 parm_decl
= error_mark_node
;
7899 default_value
= tsubst_template_arg (default_value
, args
,
7900 complain
, NULL_TREE
);
7902 tuple
= build_tree_list (default_value
, parm_decl
);
7903 TREE_VEC_ELT (new_vec
, i
) = tuple
;
7907 tree_cons (size_int (TMPL_PARMS_DEPTH (parms
)
7908 - TMPL_ARGS_DEPTH (args
)),
7909 new_vec
, NULL_TREE
);
7912 --processing_template_decl
;
7917 /* Substitute the ARGS into the indicated aggregate (or enumeration)
7918 type T. If T is not an aggregate or enumeration type, it is
7919 handled as if by tsubst. IN_DECL is as for tsubst. If
7920 ENTERING_SCOPE is nonzero, T is the context for a template which
7921 we are presently tsubst'ing. Return the substituted value. */
7924 tsubst_aggr_type (tree t
,
7926 tsubst_flags_t complain
,
7933 switch (TREE_CODE (t
))
7936 if (TYPE_PTRMEMFUNC_P (t
))
7937 return tsubst (TYPE_PTRMEMFUNC_FN_TYPE (t
), args
, complain
, in_decl
);
7939 /* Else fall through. */
7942 if (TYPE_TEMPLATE_INFO (t
) && uses_template_parms (t
))
7947 bool saved_skip_evaluation
;
7949 /* In "sizeof(X<I>)" we need to evaluate "I". */
7950 saved_skip_evaluation
= skip_evaluation
;
7951 skip_evaluation
= false;
7953 /* First, determine the context for the type we are looking
7955 context
= TYPE_CONTEXT (t
);
7958 context
= tsubst_aggr_type (context
, args
, complain
,
7959 in_decl
, /*entering_scope=*/1);
7960 /* If context is a nested class inside a class template,
7961 it may still need to be instantiated (c++/33959). */
7962 if (TYPE_P (context
))
7963 context
= complete_type (context
);
7966 /* Then, figure out what arguments are appropriate for the
7967 type we are trying to find. For example, given:
7969 template <class T> struct S;
7970 template <class T, class U> void f(T, U) { S<U> su; }
7972 and supposing that we are instantiating f<int, double>,
7973 then our ARGS will be {int, double}, but, when looking up
7974 S we only want {double}. */
7975 argvec
= tsubst_template_args (TYPE_TI_ARGS (t
), args
,
7977 if (argvec
== error_mark_node
)
7978 r
= error_mark_node
;
7981 r
= lookup_template_class (t
, argvec
, in_decl
, context
,
7982 entering_scope
, complain
);
7983 r
= cp_build_qualified_type_real (r
, TYPE_QUALS (t
), complain
);
7986 skip_evaluation
= saved_skip_evaluation
;
7991 /* This is not a template type, so there's nothing to do. */
7995 return tsubst (t
, args
, complain
, in_decl
);
7999 /* Substitute into the default argument ARG (a default argument for
8000 FN), which has the indicated TYPE. */
8003 tsubst_default_argument (tree fn
, tree type
, tree arg
)
8005 tree saved_class_ptr
= NULL_TREE
;
8006 tree saved_class_ref
= NULL_TREE
;
8008 /* This default argument came from a template. Instantiate the
8009 default argument here, not in tsubst. In the case of
8018 we must be careful to do name lookup in the scope of S<T>,
8019 rather than in the current class. */
8020 push_access_scope (fn
);
8021 /* The "this" pointer is not valid in a default argument. */
8024 saved_class_ptr
= current_class_ptr
;
8025 cp_function_chain
->x_current_class_ptr
= NULL_TREE
;
8026 saved_class_ref
= current_class_ref
;
8027 cp_function_chain
->x_current_class_ref
= NULL_TREE
;
8030 push_deferring_access_checks(dk_no_deferred
);
8031 /* The default argument expression may cause implicitly defined
8032 member functions to be synthesized, which will result in garbage
8033 collection. We must treat this situation as if we were within
8034 the body of function so as to avoid collecting live data on the
8037 arg
= tsubst_expr (arg
, DECL_TI_ARGS (fn
),
8038 tf_warning_or_error
, NULL_TREE
,
8039 /*integral_constant_expression_p=*/false);
8041 pop_deferring_access_checks();
8043 /* Restore the "this" pointer. */
8046 cp_function_chain
->x_current_class_ptr
= saved_class_ptr
;
8047 cp_function_chain
->x_current_class_ref
= saved_class_ref
;
8050 pop_access_scope (fn
);
8052 /* Make sure the default argument is reasonable. */
8053 arg
= check_default_argument (type
, arg
);
8058 /* Substitute into all the default arguments for FN. */
8061 tsubst_default_arguments (tree fn
)
8066 tmpl_args
= DECL_TI_ARGS (fn
);
8068 /* If this function is not yet instantiated, we certainly don't need
8069 its default arguments. */
8070 if (uses_template_parms (tmpl_args
))
8073 for (arg
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
8075 arg
= TREE_CHAIN (arg
))
8076 if (TREE_PURPOSE (arg
))
8077 TREE_PURPOSE (arg
) = tsubst_default_argument (fn
,
8079 TREE_PURPOSE (arg
));
8082 /* Substitute the ARGS into the T, which is a _DECL. Return the
8083 result of the substitution. Issue error and warning messages under
8084 control of COMPLAIN. */
8087 tsubst_decl (tree t
, tree args
, tsubst_flags_t complain
)
8089 location_t saved_loc
;
8093 /* Set the filename and linenumber to improve error-reporting. */
8094 saved_loc
= input_location
;
8095 input_location
= DECL_SOURCE_LOCATION (t
);
8097 switch (TREE_CODE (t
))
8101 /* We can get here when processing a member function template,
8102 member class template, and template template parameter of
8103 a template class. */
8104 tree decl
= DECL_TEMPLATE_RESULT (t
);
8109 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
8111 /* Template template parameter is treated here. */
8112 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
8113 if (new_type
== error_mark_node
)
8114 return error_mark_node
;
8117 TREE_CHAIN (r
) = NULL_TREE
;
8118 TREE_TYPE (r
) = new_type
;
8119 DECL_TEMPLATE_RESULT (r
)
8120 = build_decl (DECL_SOURCE_LOCATION (decl
),
8121 TYPE_DECL
, DECL_NAME (decl
), new_type
);
8122 DECL_TEMPLATE_PARMS (r
)
8123 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
,
8125 TYPE_NAME (new_type
) = r
;
8129 /* We might already have an instance of this template.
8130 The ARGS are for the surrounding class type, so the
8131 full args contain the tsubst'd args for the context,
8132 plus the innermost args from the template decl. */
8133 tmpl_args
= DECL_CLASS_TEMPLATE_P (t
)
8134 ? CLASSTYPE_TI_ARGS (TREE_TYPE (t
))
8135 : DECL_TI_ARGS (DECL_TEMPLATE_RESULT (t
));
8136 /* Because this is a template, the arguments will still be
8137 dependent, even after substitution. If
8138 PROCESSING_TEMPLATE_DECL is not set, the dependency
8139 predicates will short-circuit. */
8140 ++processing_template_decl
;
8141 full_args
= tsubst_template_args (tmpl_args
, args
,
8143 --processing_template_decl
;
8144 if (full_args
== error_mark_node
)
8145 return error_mark_node
;
8147 /* tsubst_template_args doesn't copy the vector if
8148 nothing changed. But, *something* should have
8150 gcc_assert (full_args
!= tmpl_args
);
8152 spec
= retrieve_specialization (t
, full_args
,
8153 /*class_specializations_p=*/true);
8154 if (spec
!= NULL_TREE
)
8160 /* Make a new template decl. It will be similar to the
8161 original, but will record the current template arguments.
8162 We also create a new function declaration, which is just
8163 like the old one, but points to this new template, rather
8164 than the old one. */
8166 gcc_assert (DECL_LANG_SPECIFIC (r
) != 0);
8167 TREE_CHAIN (r
) = NULL_TREE
;
8169 DECL_TEMPLATE_INFO (r
) = build_tree_list (t
, args
);
8171 if (TREE_CODE (decl
) == TYPE_DECL
)
8174 ++processing_template_decl
;
8175 new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
8176 --processing_template_decl
;
8177 if (new_type
== error_mark_node
)
8178 return error_mark_node
;
8180 TREE_TYPE (r
) = new_type
;
8181 CLASSTYPE_TI_TEMPLATE (new_type
) = r
;
8182 DECL_TEMPLATE_RESULT (r
) = TYPE_MAIN_DECL (new_type
);
8183 DECL_TI_ARGS (r
) = CLASSTYPE_TI_ARGS (new_type
);
8184 DECL_CONTEXT (r
) = TYPE_CONTEXT (new_type
);
8189 ++processing_template_decl
;
8190 new_decl
= tsubst (decl
, args
, complain
, in_decl
);
8191 --processing_template_decl
;
8192 if (new_decl
== error_mark_node
)
8193 return error_mark_node
;
8195 DECL_TEMPLATE_RESULT (r
) = new_decl
;
8196 DECL_TI_TEMPLATE (new_decl
) = r
;
8197 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
8198 DECL_TI_ARGS (r
) = DECL_TI_ARGS (new_decl
);
8199 DECL_CONTEXT (r
) = DECL_CONTEXT (new_decl
);
8202 SET_DECL_IMPLICIT_INSTANTIATION (r
);
8203 DECL_TEMPLATE_INSTANTIATIONS (r
) = NULL_TREE
;
8204 DECL_TEMPLATE_SPECIALIZATIONS (r
) = NULL_TREE
;
8206 /* The template parameters for this new template are all the
8207 template parameters for the old template, except the
8208 outermost level of parameters. */
8209 DECL_TEMPLATE_PARMS (r
)
8210 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
,
8213 if (PRIMARY_TEMPLATE_P (t
))
8214 DECL_PRIMARY_TEMPLATE (r
) = r
;
8216 if (TREE_CODE (decl
) != TYPE_DECL
)
8217 /* Record this non-type partial instantiation. */
8218 register_specialization (r
, t
,
8219 DECL_TI_ARGS (DECL_TEMPLATE_RESULT (r
)),
8227 tree argvec
= NULL_TREE
;
8235 /* Nobody should be tsubst'ing into non-template functions. */
8236 gcc_assert (DECL_TEMPLATE_INFO (t
) != NULL_TREE
);
8238 if (TREE_CODE (DECL_TI_TEMPLATE (t
)) == TEMPLATE_DECL
)
8243 /* If T is not dependent, just return it. We have to
8244 increment PROCESSING_TEMPLATE_DECL because
8245 value_dependent_expression_p assumes that nothing is
8246 dependent when PROCESSING_TEMPLATE_DECL is zero. */
8247 ++processing_template_decl
;
8248 dependent_p
= value_dependent_expression_p (t
);
8249 --processing_template_decl
;
8253 /* Calculate the most general template of which R is a
8254 specialization, and the complete set of arguments used to
8256 gen_tmpl
= most_general_template (DECL_TI_TEMPLATE (t
));
8257 argvec
= tsubst_template_args (DECL_TI_ARGS
8258 (DECL_TEMPLATE_RESULT (gen_tmpl
)),
8259 args
, complain
, in_decl
);
8261 /* Check to see if we already have this specialization. */
8262 spec
= retrieve_specialization (gen_tmpl
, argvec
,
8263 /*class_specializations_p=*/false);
8271 /* We can see more levels of arguments than parameters if
8272 there was a specialization of a member template, like
8275 template <class T> struct S { template <class U> void f(); }
8276 template <> template <class U> void S<int>::f(U);
8278 Here, we'll be substituting into the specialization,
8279 because that's where we can find the code we actually
8280 want to generate, but we'll have enough arguments for
8281 the most general template.
8283 We also deal with the peculiar case:
8285 template <class T> struct S {
8286 template <class U> friend void f();
8288 template <class U> void f() {}
8290 template void f<double>();
8292 Here, the ARGS for the instantiation of will be {int,
8293 double}. But, we only need as many ARGS as there are
8294 levels of template parameters in CODE_PATTERN. We are
8295 careful not to get fooled into reducing the ARGS in
8298 template <class T> struct S { template <class U> void f(U); }
8299 template <class T> template <> void S<T>::f(int) {}
8301 which we can spot because the pattern will be a
8302 specialization in this case. */
8303 args_depth
= TMPL_ARGS_DEPTH (args
);
8305 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (t
)));
8306 if (args_depth
> parms_depth
8307 && !DECL_TEMPLATE_SPECIALIZATION (t
))
8308 args
= get_innermost_template_args (args
, parms_depth
);
8312 /* This special case arises when we have something like this:
8314 template <class T> struct S {
8315 friend void f<int>(int, double);
8318 Here, the DECL_TI_TEMPLATE for the friend declaration
8319 will be an IDENTIFIER_NODE. We are being called from
8320 tsubst_friend_function, and we want only to create a
8321 new decl (R) with appropriate types so that we can call
8322 determine_specialization. */
8323 gen_tmpl
= NULL_TREE
;
8326 if (DECL_CLASS_SCOPE_P (t
))
8328 if (DECL_NAME (t
) == constructor_name (DECL_CONTEXT (t
)))
8332 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
,
8333 complain
, t
, /*entering_scope=*/1);
8338 ctx
= DECL_CONTEXT (t
);
8340 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
8341 if (type
== error_mark_node
)
8342 return error_mark_node
;
8344 /* We do NOT check for matching decls pushed separately at this
8345 point, as they may not represent instantiations of this
8346 template, and in any case are considered separate under the
8349 DECL_USE_TEMPLATE (r
) = 0;
8350 TREE_TYPE (r
) = type
;
8351 /* Clear out the mangled name and RTL for the instantiation. */
8352 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
8353 SET_DECL_RTL (r
, NULL_RTX
);
8354 /* Leave DECL_INITIAL set on deleted instantiations. */
8355 if (!DECL_DELETED_FN (r
))
8356 DECL_INITIAL (r
) = NULL_TREE
;
8357 DECL_CONTEXT (r
) = ctx
;
8359 if (member
&& DECL_CONV_FN_P (r
))
8360 /* Type-conversion operator. Reconstruct the name, in
8361 case it's the name of one of the template's parameters. */
8362 DECL_NAME (r
) = mangle_conv_op_name_for_type (TREE_TYPE (type
));
8364 DECL_ARGUMENTS (r
) = tsubst (DECL_ARGUMENTS (t
), args
,
8366 DECL_RESULT (r
) = NULL_TREE
;
8368 TREE_STATIC (r
) = 0;
8369 TREE_PUBLIC (r
) = TREE_PUBLIC (t
);
8370 DECL_EXTERNAL (r
) = 1;
8371 /* If this is an instantiation of a function with internal
8372 linkage, we already know what object file linkage will be
8373 assigned to the instantiation. */
8374 DECL_INTERFACE_KNOWN (r
) = !TREE_PUBLIC (r
);
8375 DECL_DEFER_OUTPUT (r
) = 0;
8376 TREE_CHAIN (r
) = NULL_TREE
;
8377 DECL_PENDING_INLINE_INFO (r
) = 0;
8378 DECL_PENDING_INLINE_P (r
) = 0;
8379 DECL_SAVED_TREE (r
) = NULL_TREE
;
8380 DECL_STRUCT_FUNCTION (r
) = NULL
;
8382 if (DECL_CLONED_FUNCTION (r
))
8384 DECL_CLONED_FUNCTION (r
) = tsubst (DECL_CLONED_FUNCTION (t
),
8386 TREE_CHAIN (r
) = TREE_CHAIN (DECL_CLONED_FUNCTION (r
));
8387 TREE_CHAIN (DECL_CLONED_FUNCTION (r
)) = r
;
8390 /* Set up the DECL_TEMPLATE_INFO for R. There's no need to do
8391 this in the special friend case mentioned above where
8392 GEN_TMPL is NULL. */
8395 DECL_TEMPLATE_INFO (r
)
8396 = tree_cons (gen_tmpl
, argvec
, NULL_TREE
);
8397 SET_DECL_IMPLICIT_INSTANTIATION (r
);
8398 register_specialization (r
, gen_tmpl
, argvec
, false);
8400 /* We're not supposed to instantiate default arguments
8401 until they are called, for a template. But, for a
8404 template <class T> void f ()
8405 { extern void g(int i = T()); }
8407 we should do the substitution when the template is
8408 instantiated. We handle the member function case in
8409 instantiate_class_template since the default arguments
8410 might refer to other members of the class. */
8412 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
8413 && !uses_template_parms (argvec
))
8414 tsubst_default_arguments (r
);
8417 DECL_TEMPLATE_INFO (r
) = NULL_TREE
;
8419 /* Copy the list of befriending classes. */
8420 for (friends
= &DECL_BEFRIENDING_CLASSES (r
);
8422 friends
= &TREE_CHAIN (*friends
))
8424 *friends
= copy_node (*friends
);
8425 TREE_VALUE (*friends
) = tsubst (TREE_VALUE (*friends
),
8430 if (DECL_CONSTRUCTOR_P (r
) || DECL_DESTRUCTOR_P (r
))
8432 maybe_retrofit_in_chrg (r
);
8433 if (DECL_CONSTRUCTOR_P (r
))
8434 grok_ctor_properties (ctx
, r
);
8435 /* If this is an instantiation of a member template, clone it.
8436 If it isn't, that'll be handled by
8437 clone_constructors_and_destructors. */
8438 if (PRIMARY_TEMPLATE_P (gen_tmpl
))
8439 clone_function_decl (r
, /*update_method_vec_p=*/0);
8441 else if (IDENTIFIER_OPNAME_P (DECL_NAME (r
))
8442 && !grok_op_properties (r
, (complain
& tf_error
) != 0))
8443 return error_mark_node
;
8445 if (DECL_FRIEND_P (t
) && DECL_FRIEND_CONTEXT (t
))
8446 SET_DECL_FRIEND_CONTEXT (r
,
8447 tsubst (DECL_FRIEND_CONTEXT (t
),
8448 args
, complain
, in_decl
));
8450 /* Possibly limit visibility based on template args. */
8451 DECL_VISIBILITY (r
) = VISIBILITY_DEFAULT
;
8452 if (DECL_VISIBILITY_SPECIFIED (t
))
8454 DECL_VISIBILITY_SPECIFIED (r
) = 0;
8456 = remove_attribute ("visibility", DECL_ATTRIBUTES (r
));
8458 determine_visibility (r
);
8460 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
8461 args
, complain
, in_decl
);
8467 tree type
= NULL_TREE
;
8469 tree expanded_types
= NULL_TREE
;
8470 tree prev_r
= NULL_TREE
;
8471 tree first_r
= NULL_TREE
;
8473 if (FUNCTION_PARAMETER_PACK_P (t
))
8475 /* If there is a local specialization that isn't a
8476 parameter pack, it means that we're doing a "simple"
8477 substitution from inside tsubst_pack_expansion. Just
8478 return the local specialization (which will be a single
8480 tree spec
= retrieve_local_specialization (t
);
8482 && TREE_CODE (spec
) == PARM_DECL
8483 && TREE_CODE (TREE_TYPE (spec
)) != TYPE_PACK_EXPANSION
)
8486 /* Expand the TYPE_PACK_EXPANSION that provides the types for
8487 the parameters in this function parameter pack. */
8488 expanded_types
= tsubst_pack_expansion (TREE_TYPE (t
), args
,
8490 if (TREE_CODE (expanded_types
) == TREE_VEC
)
8492 len
= TREE_VEC_LENGTH (expanded_types
);
8494 /* Zero-length parameter packs are boring. Just substitute
8497 return tsubst (TREE_CHAIN (t
), args
, complain
,
8502 /* All we did was update the type. Make a note of that. */
8503 type
= expanded_types
;
8504 expanded_types
= NULL_TREE
;
8508 /* Loop through all of the parameter's we'll build. When T is
8509 a function parameter pack, LEN is the number of expanded
8510 types in EXPANDED_TYPES; otherwise, LEN is 1. */
8512 for (i
= 0; i
< len
; ++i
)
8516 if (DECL_TEMPLATE_PARM_P (t
))
8517 SET_DECL_TEMPLATE_PARM_P (r
);
8520 /* We're on the Ith parameter of the function parameter
8523 /* Get the Ith type. */
8524 type
= TREE_VEC_ELT (expanded_types
, i
);
8527 /* Rename the parameter to include the index. */
8529 make_ith_pack_parameter_name (DECL_NAME (r
), i
);
8532 /* We're dealing with a normal parameter. */
8533 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
8535 type
= type_decays_to (type
);
8536 TREE_TYPE (r
) = type
;
8537 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
8539 if (DECL_INITIAL (r
))
8541 if (TREE_CODE (DECL_INITIAL (r
)) != TEMPLATE_PARM_INDEX
)
8542 DECL_INITIAL (r
) = TREE_TYPE (r
);
8544 DECL_INITIAL (r
) = tsubst (DECL_INITIAL (r
), args
,
8548 DECL_CONTEXT (r
) = NULL_TREE
;
8550 if (!DECL_TEMPLATE_PARM_P (r
))
8551 DECL_ARG_TYPE (r
) = type_passed_as (type
);
8553 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
8554 args
, complain
, in_decl
);
8556 /* Keep track of the first new parameter we
8557 generate. That's what will be returned to the
8562 /* Build a proper chain of parameters when substituting
8563 into a function parameter pack. */
8565 TREE_CHAIN (prev_r
) = r
;
8569 TREE_CHAIN (r
) = tsubst (TREE_CHAIN (t
), args
,
8570 complain
, TREE_CHAIN (t
));
8572 /* FIRST_R contains the start of the chain we've built. */
8582 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
8583 if (type
== error_mark_node
)
8584 return error_mark_node
;
8585 TREE_TYPE (r
) = type
;
8586 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
8588 /* DECL_INITIAL gives the number of bits in a bit-field. */
8590 = tsubst_expr (DECL_INITIAL (t
), args
,
8592 /*integral_constant_expression_p=*/true);
8593 /* We don't have to set DECL_CONTEXT here; it is set by
8594 finish_member_declaration. */
8595 TREE_CHAIN (r
) = NULL_TREE
;
8596 if (VOID_TYPE_P (type
))
8597 error ("instantiation of %q+D as type %qT", r
, type
);
8599 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
8600 args
, complain
, in_decl
);
8605 /* We reach here only for member using decls. */
8606 if (DECL_DEPENDENT_P (t
))
8608 r
= do_class_using_decl
8609 (tsubst_copy (USING_DECL_SCOPE (t
), args
, complain
, in_decl
),
8610 tsubst_copy (DECL_NAME (t
), args
, complain
, in_decl
));
8612 r
= error_mark_node
;
8615 TREE_PROTECTED (r
) = TREE_PROTECTED (t
);
8616 TREE_PRIVATE (r
) = TREE_PRIVATE (t
);
8622 TREE_CHAIN (r
) = NULL_TREE
;
8629 tree argvec
= NULL_TREE
;
8630 tree gen_tmpl
= NULL_TREE
;
8632 tree tmpl
= NULL_TREE
;
8634 tree type
= NULL_TREE
;
8637 if (TREE_CODE (t
) == TYPE_DECL
8638 && t
== TYPE_MAIN_DECL (TREE_TYPE (t
)))
8640 /* If this is the canonical decl, we don't have to
8641 mess with instantiations, and often we can't (for
8642 typename, template type parms and such). Note that
8643 TYPE_NAME is not correct for the above test if
8644 we've copied the type for a typedef. */
8645 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
8646 if (type
== error_mark_node
)
8647 return error_mark_node
;
8648 r
= TYPE_NAME (type
);
8652 /* Check to see if we already have the specialization we
8655 if (DECL_CLASS_SCOPE_P (t
) || DECL_NAMESPACE_SCOPE_P (t
))
8657 /* T is a static data member or namespace-scope entity.
8658 We have to substitute into namespace-scope variables
8659 (even though such entities are never templates) because
8662 template <class T> void f() { extern T t; }
8664 where the entity referenced is not known until
8665 instantiation time. */
8667 ctx
= DECL_CONTEXT (t
);
8668 if (DECL_CLASS_SCOPE_P (t
))
8670 ctx
= tsubst_aggr_type (ctx
, args
,
8672 in_decl
, /*entering_scope=*/1);
8673 /* If CTX is unchanged, then T is in fact the
8674 specialization we want. That situation occurs when
8675 referencing a static data member within in its own
8676 class. We can use pointer equality, rather than
8677 same_type_p, because DECL_CONTEXT is always
8679 if (ctx
== DECL_CONTEXT (t
))
8685 tmpl
= DECL_TI_TEMPLATE (t
);
8686 gen_tmpl
= most_general_template (tmpl
);
8687 argvec
= tsubst (DECL_TI_ARGS (t
), args
, complain
, in_decl
);
8688 spec
= (retrieve_specialization
8690 /*class_specializations_p=*/false));
8695 /* A local variable. */
8697 /* Subsequent calls to pushdecl will fill this in. */
8699 spec
= retrieve_local_specialization (t
);
8701 /* If we already have the specialization we need, there is
8702 nothing more to do. */
8709 /* Create a new node for the specialization we need. */
8711 if (type
== NULL_TREE
)
8712 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
8713 if (TREE_CODE (r
) == VAR_DECL
)
8715 /* Even if the original location is out of scope, the
8716 newly substituted one is not. */
8717 DECL_DEAD_FOR_LOCAL (r
) = 0;
8718 DECL_INITIALIZED_P (r
) = 0;
8719 DECL_TEMPLATE_INSTANTIATED (r
) = 0;
8720 if (type
== error_mark_node
)
8721 return error_mark_node
;
8722 if (TREE_CODE (type
) == FUNCTION_TYPE
)
8724 /* It may seem that this case cannot occur, since:
8729 declares a function, not a variable. However:
8732 template <typename T> void g() { T t; }
8733 template void g<f>();
8735 is an attempt to declare a variable with function
8737 error ("variable %qD has function type",
8738 /* R is not yet sufficiently initialized, so we
8739 just use its name. */
8741 return error_mark_node
;
8743 type
= complete_type (type
);
8744 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r
)
8745 = DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (t
);
8746 type
= check_var_type (DECL_NAME (r
), type
);
8748 if (DECL_HAS_VALUE_EXPR_P (t
))
8750 tree ve
= DECL_VALUE_EXPR (t
);
8751 ve
= tsubst_expr (ve
, args
, complain
, in_decl
,
8752 /*constant_expression_p=*/false);
8753 SET_DECL_VALUE_EXPR (r
, ve
);
8756 else if (DECL_SELF_REFERENCE_P (t
))
8757 SET_DECL_SELF_REFERENCE_P (r
);
8758 TREE_TYPE (r
) = type
;
8759 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
8760 DECL_CONTEXT (r
) = ctx
;
8761 /* Clear out the mangled name and RTL for the instantiation. */
8762 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
8763 if (CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_DECL_WRTL
))
8764 SET_DECL_RTL (r
, NULL_RTX
);
8765 /* The initializer must not be expanded until it is required;
8767 DECL_INITIAL (r
) = NULL_TREE
;
8768 if (CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_DECL_WRTL
))
8769 SET_DECL_RTL (r
, NULL_RTX
);
8770 DECL_SIZE (r
) = DECL_SIZE_UNIT (r
) = 0;
8771 if (TREE_CODE (r
) == VAR_DECL
)
8773 /* Possibly limit visibility based on template args. */
8774 DECL_VISIBILITY (r
) = VISIBILITY_DEFAULT
;
8775 if (DECL_VISIBILITY_SPECIFIED (t
))
8777 DECL_VISIBILITY_SPECIFIED (r
) = 0;
8779 = remove_attribute ("visibility", DECL_ATTRIBUTES (r
));
8781 determine_visibility (r
);
8783 /* Preserve a typedef that names a type. */
8784 else if (TREE_CODE (r
) == TYPE_DECL
8785 && DECL_ORIGINAL_TYPE (t
)
8786 && type
!= error_mark_node
)
8788 DECL_ORIGINAL_TYPE (r
) = tsubst (DECL_ORIGINAL_TYPE (t
),
8789 args
, complain
, in_decl
);
8790 TREE_TYPE (r
) = type
= build_variant_type_copy (type
);
8791 TYPE_NAME (type
) = r
;
8796 /* A static data member declaration is always marked
8797 external when it is declared in-class, even if an
8798 initializer is present. We mimic the non-template
8800 DECL_EXTERNAL (r
) = 1;
8802 register_specialization (r
, gen_tmpl
, argvec
, false);
8803 DECL_TEMPLATE_INFO (r
) = tree_cons (tmpl
, argvec
, NULL_TREE
);
8804 SET_DECL_IMPLICIT_INSTANTIATION (r
);
8807 register_local_specialization (r
, t
);
8809 TREE_CHAIN (r
) = NULL_TREE
;
8811 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
),
8812 (int) ATTR_FLAG_TYPE_IN_PLACE
,
8813 args
, complain
, in_decl
);
8822 /* Restore the file and line information. */
8823 input_location
= saved_loc
;
8828 /* Substitute into the ARG_TYPES of a function type. */
8831 tsubst_arg_types (tree arg_types
,
8833 tsubst_flags_t complain
,
8836 tree remaining_arg_types
;
8837 tree type
= NULL_TREE
;
8839 tree expanded_args
= NULL_TREE
;
8842 if (!arg_types
|| arg_types
== void_list_node
)
8845 remaining_arg_types
= tsubst_arg_types (TREE_CHAIN (arg_types
),
8846 args
, complain
, in_decl
);
8847 if (remaining_arg_types
== error_mark_node
)
8848 return error_mark_node
;
8850 if (PACK_EXPANSION_P (TREE_VALUE (arg_types
)))
8852 /* For a pack expansion, perform substitution on the
8853 entire expression. Later on, we'll handle the arguments
8855 expanded_args
= tsubst_pack_expansion (TREE_VALUE (arg_types
),
8856 args
, complain
, in_decl
);
8858 if (TREE_CODE (expanded_args
) == TREE_VEC
)
8859 /* So that we'll spin through the parameters, one by one. */
8860 i
= TREE_VEC_LENGTH (expanded_args
);
8863 /* We only partially substituted into the parameter
8864 pack. Our type is TYPE_PACK_EXPANSION. */
8865 type
= expanded_args
;
8866 expanded_args
= NULL_TREE
;
8874 type
= TREE_VEC_ELT (expanded_args
, i
);
8876 type
= tsubst (TREE_VALUE (arg_types
), args
, complain
, in_decl
);
8878 if (type
== error_mark_node
)
8879 return error_mark_node
;
8880 if (VOID_TYPE_P (type
))
8882 if (complain
& tf_error
)
8884 error ("invalid parameter type %qT", type
);
8886 error ("in declaration %q+D", in_decl
);
8888 return error_mark_node
;
8891 /* Do array-to-pointer, function-to-pointer conversion, and ignore
8892 top-level qualifiers as required. */
8893 type
= TYPE_MAIN_VARIANT (type_decays_to (type
));
8895 /* We do not substitute into default arguments here. The standard
8896 mandates that they be instantiated only when needed, which is
8897 done in build_over_call. */
8898 default_arg
= TREE_PURPOSE (arg_types
);
8900 if (default_arg
&& TREE_CODE (default_arg
) == DEFAULT_ARG
)
8902 /* We've instantiated a template before its default arguments
8903 have been parsed. This can happen for a nested template
8904 class, and is not an error unless we require the default
8905 argument in a call of this function. */
8906 remaining_arg_types
=
8907 tree_cons (default_arg
, type
, remaining_arg_types
);
8908 VEC_safe_push (tree
, gc
, DEFARG_INSTANTIATIONS (default_arg
),
8909 remaining_arg_types
);
8912 remaining_arg_types
=
8913 hash_tree_cons (default_arg
, type
, remaining_arg_types
);
8916 return remaining_arg_types
;
8919 /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does
8920 *not* handle the exception-specification for FNTYPE, because the
8921 initial substitution of explicitly provided template parameters
8922 during argument deduction forbids substitution into the
8923 exception-specification:
8927 All references in the function type of the function template to the
8928 corresponding template parameters are replaced by the specified tem-
8929 plate argument values. If a substitution in a template parameter or
8930 in the function type of the function template results in an invalid
8931 type, type deduction fails. [Note: The equivalent substitution in
8932 exception specifications is done only when the function is instanti-
8933 ated, at which point a program is ill-formed if the substitution
8934 results in an invalid type.] */
8937 tsubst_function_type (tree t
,
8939 tsubst_flags_t complain
,
8946 /* The TYPE_CONTEXT is not used for function/method types. */
8947 gcc_assert (TYPE_CONTEXT (t
) == NULL_TREE
);
8949 /* Substitute the return type. */
8950 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
8951 if (return_type
== error_mark_node
)
8952 return error_mark_node
;
8953 /* The standard does not presently indicate that creation of a
8954 function type with an invalid return type is a deduction failure.
8955 However, that is clearly analogous to creating an array of "void"
8956 or a reference to a reference. This is core issue #486. */
8957 if (TREE_CODE (return_type
) == ARRAY_TYPE
8958 || TREE_CODE (return_type
) == FUNCTION_TYPE
)
8960 if (complain
& tf_error
)
8962 if (TREE_CODE (return_type
) == ARRAY_TYPE
)
8963 error ("function returning an array");
8965 error ("function returning a function");
8967 return error_mark_node
;
8970 /* Substitute the argument types. */
8971 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
,
8973 if (arg_types
== error_mark_node
)
8974 return error_mark_node
;
8976 /* Construct a new type node and return it. */
8977 if (TREE_CODE (t
) == FUNCTION_TYPE
)
8978 fntype
= build_function_type (return_type
, arg_types
);
8981 tree r
= TREE_TYPE (TREE_VALUE (arg_types
));
8982 if (! MAYBE_CLASS_TYPE_P (r
))
8986 Type deduction may fail for any of the following
8989 -- Attempting to create "pointer to member of T" when T
8990 is not a class type. */
8991 if (complain
& tf_error
)
8992 error ("creating pointer to member function of non-class type %qT",
8994 return error_mark_node
;
8997 fntype
= build_method_type_directly (r
, return_type
,
8998 TREE_CHAIN (arg_types
));
9000 fntype
= cp_build_qualified_type_real (fntype
, TYPE_QUALS (t
), complain
);
9001 fntype
= cp_build_type_attribute_variant (fntype
, TYPE_ATTRIBUTES (t
));
9006 /* FNTYPE is a FUNCTION_TYPE or METHOD_TYPE. Substitute the template
9007 ARGS into that specification, and return the substituted
9008 specification. If there is no specification, return NULL_TREE. */
9011 tsubst_exception_specification (tree fntype
,
9013 tsubst_flags_t complain
,
9019 specs
= TYPE_RAISES_EXCEPTIONS (fntype
);
9020 new_specs
= NULL_TREE
;
9023 if (! TREE_VALUE (specs
))
9030 tree expanded_specs
= NULL_TREE
;
9032 if (PACK_EXPANSION_P (TREE_VALUE (specs
)))
9034 /* Expand the pack expansion type. */
9035 expanded_specs
= tsubst_pack_expansion (TREE_VALUE (specs
),
9039 if (expanded_specs
== error_mark_node
)
9040 return error_mark_node
;
9041 else if (TREE_CODE (expanded_specs
) == TREE_VEC
)
9042 len
= TREE_VEC_LENGTH (expanded_specs
);
9045 /* We're substituting into a member template, so
9046 we got a TYPE_PACK_EXPANSION back. Add that
9047 expansion and move on. */
9048 gcc_assert (TREE_CODE (expanded_specs
)
9049 == TYPE_PACK_EXPANSION
);
9050 new_specs
= add_exception_specifier (new_specs
,
9053 specs
= TREE_CHAIN (specs
);
9058 for (i
= 0; i
< len
; ++i
)
9061 spec
= TREE_VEC_ELT (expanded_specs
, i
);
9063 spec
= tsubst (TREE_VALUE (specs
), args
, complain
, in_decl
);
9064 if (spec
== error_mark_node
)
9066 new_specs
= add_exception_specifier (new_specs
, spec
,
9070 specs
= TREE_CHAIN (specs
);
9076 /* Take the tree structure T and replace template parameters used
9077 therein with the argument vector ARGS. IN_DECL is an associated
9078 decl for diagnostics. If an error occurs, returns ERROR_MARK_NODE.
9079 Issue error and warning messages under control of COMPLAIN. Note
9080 that we must be relatively non-tolerant of extensions here, in
9081 order to preserve conformance; if we allow substitutions that
9082 should not be allowed, we may allow argument deductions that should
9083 not succeed, and therefore report ambiguous overload situations
9084 where there are none. In theory, we could allow the substitution,
9085 but indicate that it should have failed, and allow our caller to
9086 make sure that the right thing happens, but we don't try to do this
9089 This function is used for dealing with types, decls and the like;
9090 for expressions, use tsubst_expr or tsubst_copy. */
9093 tsubst (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
9097 if (t
== NULL_TREE
|| t
== error_mark_node
9098 || t
== integer_type_node
9099 || t
== void_type_node
9100 || t
== char_type_node
9101 || t
== unknown_type_node
9102 || TREE_CODE (t
) == NAMESPACE_DECL
)
9106 return tsubst_decl (t
, args
, complain
);
9108 if (args
== NULL_TREE
)
9111 if (TREE_CODE (t
) == IDENTIFIER_NODE
)
9112 type
= IDENTIFIER_TYPE_VALUE (t
);
9114 type
= TREE_TYPE (t
);
9116 gcc_assert (type
!= unknown_type_node
);
9118 /* Reuse typedefs. We need to do this to handle dependent attributes,
9119 such as attribute aligned. */
9122 && TYPE_NAME (t
) != TYPE_MAIN_DECL (t
))
9124 tree decl
= TYPE_NAME (t
);
9126 if (DECL_CLASS_SCOPE_P (decl
)
9127 && CLASSTYPE_TEMPLATE_INFO (DECL_CONTEXT (decl
))
9128 && uses_template_parms (DECL_CONTEXT (decl
)))
9130 tree tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
9131 tree gen_args
= tsubst (DECL_TI_ARGS (decl
), args
, complain
, in_decl
);
9132 r
= retrieve_specialization (tmpl
, gen_args
, false);
9134 else if (DECL_FUNCTION_SCOPE_P (decl
)
9135 && DECL_TEMPLATE_INFO (DECL_CONTEXT (decl
))
9136 && uses_template_parms (DECL_TI_ARGS (DECL_CONTEXT (decl
))))
9137 r
= retrieve_local_specialization (decl
);
9139 /* The typedef is from a non-template context. */
9145 r
= cp_build_qualified_type_real
9146 (r
, cp_type_quals (t
) | cp_type_quals (r
),
9147 complain
| tf_ignore_bad_quals
);
9150 /* Else we must be instantiating the typedef, so fall through. */
9154 && TREE_CODE (t
) != TYPENAME_TYPE
9155 && TREE_CODE (t
) != IDENTIFIER_NODE
9156 && TREE_CODE (t
) != FUNCTION_TYPE
9157 && TREE_CODE (t
) != METHOD_TYPE
)
9158 type
= tsubst (type
, args
, complain
, in_decl
);
9159 if (type
== error_mark_node
)
9160 return error_mark_node
;
9162 switch (TREE_CODE (t
))
9167 return tsubst_aggr_type (t
, args
, complain
, in_decl
,
9168 /*entering_scope=*/0);
9171 case IDENTIFIER_NODE
:
9183 if (t
== integer_type_node
)
9186 if (TREE_CODE (TYPE_MIN_VALUE (t
)) == INTEGER_CST
9187 && TREE_CODE (TYPE_MAX_VALUE (t
)) == INTEGER_CST
)
9191 tree max
, omax
= TREE_OPERAND (TYPE_MAX_VALUE (t
), 0);
9193 max
= tsubst_expr (omax
, args
, complain
, in_decl
,
9194 /*integral_constant_expression_p=*/false);
9196 /* Fix up type of the magic NOP_EXPR with TREE_SIDE_EFFECTS if
9198 if (TREE_CODE (max
) == NOP_EXPR
9199 && TREE_SIDE_EFFECTS (omax
)
9200 && !TREE_TYPE (max
))
9201 TREE_TYPE (max
) = TREE_TYPE (TREE_OPERAND (max
, 0));
9203 max
= fold_decl_constant_value (max
);
9205 /* If we're in a partial instantiation, preserve the magic NOP_EXPR
9206 with TREE_SIDE_EFFECTS that indicates this is not an integral
9207 constant expression. */
9208 if (processing_template_decl
9209 && TREE_SIDE_EFFECTS (omax
) && TREE_CODE (omax
) == NOP_EXPR
)
9211 gcc_assert (TREE_CODE (max
) == NOP_EXPR
);
9212 TREE_SIDE_EFFECTS (max
) = 1;
9215 if (TREE_CODE (max
) != INTEGER_CST
9216 && !at_function_scope_p ()
9217 && !TREE_SIDE_EFFECTS (max
)
9218 && !value_dependent_expression_p (max
))
9220 if (complain
& tf_error
)
9221 error ("array bound is not an integer constant");
9222 return error_mark_node
;
9227 Type deduction may fail for any of the following
9230 Attempting to create an array with a size that is
9231 zero or negative. */
9232 if (integer_zerop (max
) && !(complain
& tf_error
))
9233 /* We must fail if performing argument deduction (as
9234 indicated by the state of complain), so that
9235 another substitution can be found. */
9236 return error_mark_node
;
9237 else if (TREE_CODE (max
) == INTEGER_CST
9238 && INT_CST_LT (max
, integer_zero_node
))
9240 if (complain
& tf_error
)
9241 error ("creating array with negative size (%qE)", max
);
9243 return error_mark_node
;
9246 return compute_array_index_type (NULL_TREE
, max
);
9249 case TEMPLATE_TYPE_PARM
:
9250 case TEMPLATE_TEMPLATE_PARM
:
9251 case BOUND_TEMPLATE_TEMPLATE_PARM
:
9252 case TEMPLATE_PARM_INDEX
:
9257 tree arg
= NULL_TREE
;
9261 gcc_assert (TREE_VEC_LENGTH (args
) > 0);
9262 template_parm_level_and_index (t
, &level
, &idx
);
9264 levels
= TMPL_ARGS_DEPTH (args
);
9265 if (level
<= levels
)
9267 arg
= TMPL_ARG (args
, level
, idx
);
9269 if (arg
&& TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
9270 /* See through ARGUMENT_PACK_SELECT arguments. */
9271 arg
= ARGUMENT_PACK_SELECT_ARG (arg
);
9274 if (arg
== error_mark_node
)
9275 return error_mark_node
;
9276 else if (arg
!= NULL_TREE
)
9278 if (ARGUMENT_PACK_P (arg
))
9279 /* If ARG is an argument pack, we don't actually want to
9280 perform a substitution here, because substitutions
9281 for argument packs are only done
9282 element-by-element. We can get to this point when
9283 substituting the type of a non-type template
9284 parameter pack, when that type actually contains
9285 template parameter packs from an outer template, e.g.,
9287 template<typename... Types> struct A {
9288 template<Types... Values> struct B { };
9292 if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
9295 gcc_assert (TYPE_P (arg
));
9297 /* cv-quals from the template are discarded when
9298 substituting in a function or reference type. */
9299 if (TREE_CODE (arg
) == FUNCTION_TYPE
9300 || TREE_CODE (arg
) == METHOD_TYPE
9301 || TREE_CODE (arg
) == REFERENCE_TYPE
)
9302 quals
= cp_type_quals (arg
);
9304 quals
= cp_type_quals (arg
) | cp_type_quals (t
);
9306 return cp_build_qualified_type_real
9307 (arg
, quals
, complain
| tf_ignore_bad_quals
);
9309 else if (TREE_CODE (t
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
9311 /* We are processing a type constructed from a
9312 template template parameter. */
9313 tree argvec
= tsubst (TYPE_TI_ARGS (t
),
9314 args
, complain
, in_decl
);
9315 if (argvec
== error_mark_node
)
9316 return error_mark_node
;
9318 /* We can get a TEMPLATE_TEMPLATE_PARM here when we
9319 are resolving nested-types in the signature of a
9320 member function templates. Otherwise ARG is a
9321 TEMPLATE_DECL and is the real template to be
9323 if (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
9324 arg
= TYPE_NAME (arg
);
9326 r
= lookup_template_class (arg
,
9329 /*entering_scope=*/0,
9331 return cp_build_qualified_type_real
9332 (r
, TYPE_QUALS (t
), complain
);
9335 /* TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX. */
9340 /* This can happen during the attempted tsubst'ing in
9341 unify. This means that we don't yet have any information
9342 about the template parameter in question. */
9345 /* If we get here, we must have been looking at a parm for a
9346 more deeply nested template. Make a new version of this
9347 template parameter, but with a lower level. */
9348 switch (TREE_CODE (t
))
9350 case TEMPLATE_TYPE_PARM
:
9351 case TEMPLATE_TEMPLATE_PARM
:
9352 case BOUND_TEMPLATE_TEMPLATE_PARM
:
9353 if (cp_type_quals (t
))
9355 r
= tsubst (TYPE_MAIN_VARIANT (t
), args
, complain
, in_decl
);
9356 r
= cp_build_qualified_type_real
9357 (r
, cp_type_quals (t
),
9358 complain
| (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
9359 ? tf_ignore_bad_quals
: 0));
9364 TEMPLATE_TYPE_PARM_INDEX (r
)
9365 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (t
),
9366 r
, levels
, args
, complain
);
9367 TYPE_STUB_DECL (r
) = TYPE_NAME (r
) = TEMPLATE_TYPE_DECL (r
);
9368 TYPE_MAIN_VARIANT (r
) = r
;
9369 TYPE_POINTER_TO (r
) = NULL_TREE
;
9370 TYPE_REFERENCE_TO (r
) = NULL_TREE
;
9372 if (TREE_CODE (r
) == TEMPLATE_TEMPLATE_PARM
)
9373 /* We have reduced the level of the template
9374 template parameter, but not the levels of its
9375 template parameters, so canonical_type_parameter
9376 will not be able to find the canonical template
9377 template parameter for this level. Thus, we
9378 require structural equality checking to compare
9379 TEMPLATE_TEMPLATE_PARMs. */
9380 SET_TYPE_STRUCTURAL_EQUALITY (r
);
9381 else if (TYPE_STRUCTURAL_EQUALITY_P (t
))
9382 SET_TYPE_STRUCTURAL_EQUALITY (r
);
9384 TYPE_CANONICAL (r
) = canonical_type_parameter (r
);
9386 if (TREE_CODE (t
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
9388 tree argvec
= tsubst (TYPE_TI_ARGS (t
), args
,
9390 if (argvec
== error_mark_node
)
9391 return error_mark_node
;
9393 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (r
)
9394 = tree_cons (TYPE_TI_TEMPLATE (t
), argvec
, NULL_TREE
);
9399 case TEMPLATE_PARM_INDEX
:
9400 r
= reduce_template_parm_level (t
, type
, levels
, args
, complain
);
9412 tree purpose
, value
, chain
;
9414 if (t
== void_list_node
)
9417 purpose
= TREE_PURPOSE (t
);
9420 purpose
= tsubst (purpose
, args
, complain
, in_decl
);
9421 if (purpose
== error_mark_node
)
9422 return error_mark_node
;
9424 value
= TREE_VALUE (t
);
9427 value
= tsubst (value
, args
, complain
, in_decl
);
9428 if (value
== error_mark_node
)
9429 return error_mark_node
;
9431 chain
= TREE_CHAIN (t
);
9432 if (chain
&& chain
!= void_type_node
)
9434 chain
= tsubst (chain
, args
, complain
, in_decl
);
9435 if (chain
== error_mark_node
)
9436 return error_mark_node
;
9438 if (purpose
== TREE_PURPOSE (t
)
9439 && value
== TREE_VALUE (t
)
9440 && chain
== TREE_CHAIN (t
))
9442 return hash_tree_cons (purpose
, value
, chain
);
9446 /* We should never be tsubsting a binfo. */
9450 /* A vector of template arguments. */
9452 return tsubst_template_args (t
, args
, complain
, in_decl
);
9455 case REFERENCE_TYPE
:
9457 enum tree_code code
;
9459 if (type
== TREE_TYPE (t
) && TREE_CODE (type
) != METHOD_TYPE
)
9462 code
= TREE_CODE (t
);
9467 Type deduction may fail for any of the following
9470 -- Attempting to create a pointer to reference type.
9471 -- Attempting to create a reference to a reference type or
9472 a reference to void.
9474 Core issue 106 says that creating a reference to a reference
9475 during instantiation is no longer a cause for failure. We
9476 only enforce this check in strict C++98 mode. */
9477 if ((TREE_CODE (type
) == REFERENCE_TYPE
9478 && (((cxx_dialect
== cxx98
) && flag_iso
) || code
!= REFERENCE_TYPE
))
9479 || (code
== REFERENCE_TYPE
&& TREE_CODE (type
) == VOID_TYPE
))
9481 static location_t last_loc
;
9483 /* We keep track of the last time we issued this error
9484 message to avoid spewing a ton of messages during a
9485 single bad template instantiation. */
9486 if (complain
& tf_error
9487 && last_loc
!= input_location
)
9489 if (TREE_CODE (type
) == VOID_TYPE
)
9490 error ("forming reference to void");
9492 error ("forming %s to reference type %qT",
9493 (code
== POINTER_TYPE
) ? "pointer" : "reference",
9495 last_loc
= input_location
;
9498 return error_mark_node
;
9500 else if (code
== POINTER_TYPE
)
9502 r
= build_pointer_type (type
);
9503 if (TREE_CODE (type
) == METHOD_TYPE
)
9504 r
= build_ptrmemfunc_type (r
);
9506 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
9507 /* In C++0x, during template argument substitution, when there is an
9508 attempt to create a reference to a reference type, reference
9509 collapsing is applied as described in [14.3.1/4 temp.arg.type]:
9511 "If a template-argument for a template-parameter T names a type
9512 that is a reference to a type A, an attempt to create the type
9513 'lvalue reference to cv T' creates the type 'lvalue reference to
9514 A,' while an attempt to create the type type rvalue reference to
9515 cv T' creates the type T"
9517 r
= cp_build_reference_type
9519 TYPE_REF_IS_RVALUE (t
) && TYPE_REF_IS_RVALUE (type
));
9521 r
= cp_build_reference_type (type
, TYPE_REF_IS_RVALUE (t
));
9522 r
= cp_build_qualified_type_real (r
, TYPE_QUALS (t
), complain
);
9524 if (r
!= error_mark_node
)
9525 /* Will this ever be needed for TYPE_..._TO values? */
9532 r
= tsubst (TYPE_OFFSET_BASETYPE (t
), args
, complain
, in_decl
);
9533 if (r
== error_mark_node
|| !MAYBE_CLASS_TYPE_P (r
))
9537 Type deduction may fail for any of the following
9540 -- Attempting to create "pointer to member of T" when T
9541 is not a class type. */
9542 if (complain
& tf_error
)
9543 error ("creating pointer to member of non-class type %qT", r
);
9544 return error_mark_node
;
9546 if (TREE_CODE (type
) == REFERENCE_TYPE
)
9548 if (complain
& tf_error
)
9549 error ("creating pointer to member reference type %qT", type
);
9550 return error_mark_node
;
9552 if (TREE_CODE (type
) == VOID_TYPE
)
9554 if (complain
& tf_error
)
9555 error ("creating pointer to member of type void");
9556 return error_mark_node
;
9558 gcc_assert (TREE_CODE (type
) != METHOD_TYPE
);
9559 if (TREE_CODE (type
) == FUNCTION_TYPE
)
9561 /* The type of the implicit object parameter gets its
9562 cv-qualifiers from the FUNCTION_TYPE. */
9564 tree this_type
= cp_build_qualified_type (TYPE_MAIN_VARIANT (r
),
9565 cp_type_quals (type
));
9567 method_type
= build_method_type_directly (this_type
,
9569 TYPE_ARG_TYPES (type
));
9570 memptr
= build_ptrmemfunc_type (build_pointer_type (method_type
));
9571 return cp_build_qualified_type_real (memptr
, cp_type_quals (t
),
9575 return cp_build_qualified_type_real (build_ptrmem_type (r
, type
),
9584 fntype
= tsubst_function_type (t
, args
, complain
, in_decl
);
9585 if (fntype
== error_mark_node
)
9586 return error_mark_node
;
9588 /* Substitute the exception specification. */
9589 specs
= tsubst_exception_specification (t
, args
, complain
,
9591 if (specs
== error_mark_node
)
9592 return error_mark_node
;
9594 fntype
= build_exception_variant (fntype
, specs
);
9599 tree domain
= tsubst (TYPE_DOMAIN (t
), args
, complain
, in_decl
);
9600 if (domain
== error_mark_node
)
9601 return error_mark_node
;
9603 /* As an optimization, we avoid regenerating the array type if
9604 it will obviously be the same as T. */
9605 if (type
== TREE_TYPE (t
) && domain
== TYPE_DOMAIN (t
))
9608 /* These checks should match the ones in grokdeclarator.
9612 The deduction may fail for any of the following reasons:
9614 -- Attempting to create an array with an element type that
9615 is void, a function type, or a reference type, or [DR337]
9616 an abstract class type. */
9617 if (TREE_CODE (type
) == VOID_TYPE
9618 || TREE_CODE (type
) == FUNCTION_TYPE
9619 || TREE_CODE (type
) == REFERENCE_TYPE
)
9621 if (complain
& tf_error
)
9622 error ("creating array of %qT", type
);
9623 return error_mark_node
;
9625 if (CLASS_TYPE_P (type
) && CLASSTYPE_PURE_VIRTUALS (type
))
9627 if (complain
& tf_error
)
9628 error ("creating array of %qT, which is an abstract class type",
9630 return error_mark_node
;
9633 r
= build_cplus_array_type (type
, domain
);
9635 if (TYPE_USER_ALIGN (t
))
9637 TYPE_ALIGN (r
) = TYPE_ALIGN (t
);
9638 TYPE_USER_ALIGN (r
) = 1;
9647 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
9648 tree e2
= tsubst (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
9650 if (e1
== error_mark_node
|| e2
== error_mark_node
)
9651 return error_mark_node
;
9653 return fold_build2 (TREE_CODE (t
), TREE_TYPE (t
), e1
, e2
);
9659 tree e
= tsubst (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
9660 if (e
== error_mark_node
)
9661 return error_mark_node
;
9663 return fold_build1 (TREE_CODE (t
), TREE_TYPE (t
), e
);
9668 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
9669 in_decl
, /*entering_scope=*/1);
9670 tree f
= tsubst_copy (TYPENAME_TYPE_FULLNAME (t
), args
,
9673 if (ctx
== error_mark_node
|| f
== error_mark_node
)
9674 return error_mark_node
;
9676 if (!MAYBE_CLASS_TYPE_P (ctx
))
9678 if (complain
& tf_error
)
9679 error ("%qT is not a class, struct, or union type", ctx
);
9680 return error_mark_node
;
9682 else if (!uses_template_parms (ctx
) && !TYPE_BEING_DEFINED (ctx
))
9684 /* Normally, make_typename_type does not require that the CTX
9685 have complete type in order to allow things like:
9687 template <class T> struct S { typename S<T>::X Y; };
9689 But, such constructs have already been resolved by this
9690 point, so here CTX really should have complete type, unless
9691 it's a partial instantiation. */
9692 ctx
= complete_type (ctx
);
9693 if (!COMPLETE_TYPE_P (ctx
))
9695 if (complain
& tf_error
)
9696 cxx_incomplete_type_error (NULL_TREE
, ctx
);
9697 return error_mark_node
;
9701 f
= make_typename_type (ctx
, f
, typename_type
,
9702 (complain
& tf_error
) | tf_keep_type_decl
);
9703 if (f
== error_mark_node
)
9705 if (TREE_CODE (f
) == TYPE_DECL
)
9707 complain
|= tf_ignore_bad_quals
;
9711 if (TREE_CODE (f
) != TYPENAME_TYPE
)
9713 if (TYPENAME_IS_ENUM_P (t
) && TREE_CODE (f
) != ENUMERAL_TYPE
)
9714 error ("%qT resolves to %qT, which is not an enumeration type",
9716 else if (TYPENAME_IS_CLASS_P (t
) && !CLASS_TYPE_P (f
))
9717 error ("%qT resolves to %qT, which is is not a class type",
9721 return cp_build_qualified_type_real
9722 (f
, cp_type_quals (f
) | cp_type_quals (t
), complain
);
9725 case UNBOUND_CLASS_TEMPLATE
:
9727 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
9728 in_decl
, /*entering_scope=*/1);
9729 tree name
= TYPE_IDENTIFIER (t
);
9730 tree parm_list
= DECL_TEMPLATE_PARMS (TYPE_NAME (t
));
9732 if (ctx
== error_mark_node
|| name
== error_mark_node
)
9733 return error_mark_node
;
9736 parm_list
= tsubst_template_parms (parm_list
, args
, complain
);
9737 return make_unbound_class_template (ctx
, name
, parm_list
, complain
);
9747 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
9748 tree e2
= tsubst_expr (TREE_OPERAND (t
, 1), args
, complain
, in_decl
,
9749 /*integral_constant_expression_p=*/false);
9750 if (e1
== error_mark_node
|| e2
== error_mark_node
)
9751 return error_mark_node
;
9753 return build_nt (ARRAY_REF
, e1
, e2
, NULL_TREE
, NULL_TREE
);
9758 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
9759 tree e2
= tsubst (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
9760 if (e1
== error_mark_node
|| e2
== error_mark_node
)
9761 return error_mark_node
;
9763 return build_qualified_name (/*type=*/NULL_TREE
,
9764 e1
, e2
, QUALIFIED_NAME_IS_TEMPLATE (t
));
9771 type
= finish_typeof (tsubst_expr
9772 (TYPEOF_TYPE_EXPR (t
), args
,
9774 /*integral_constant_expression_p=*/false));
9775 return cp_build_qualified_type_real (type
,
9777 | cp_type_quals (type
),
9787 type
= tsubst_expr (DECLTYPE_TYPE_EXPR (t
), args
,
9789 /*integral_constant_expression_p=*/false);
9794 finish_decltype_type (type
,
9795 DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t
));
9796 return cp_build_qualified_type_real (type
,
9798 | cp_type_quals (type
),
9802 case TYPE_ARGUMENT_PACK
:
9803 case NONTYPE_ARGUMENT_PACK
:
9805 tree r
= make_node (TREE_CODE (t
));
9807 tsubst_template_args (ARGUMENT_PACK_ARGS (t
),
9811 SET_ARGUMENT_PACK_ARGS (r
, packed_out
);
9813 /* For template nontype argument packs, also substitute into
9815 if (TREE_CODE (t
) == NONTYPE_ARGUMENT_PACK
)
9816 TREE_TYPE (r
) = tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
9823 sorry ("use of %qs in template",
9824 tree_code_name
[(int) TREE_CODE (t
)]);
9825 return error_mark_node
;
9829 /* Like tsubst_expr for a BASELINK. OBJECT_TYPE, if non-NULL, is the
9830 type of the expression on the left-hand side of the "." or "->"
9834 tsubst_baselink (tree baselink
, tree object_type
,
9835 tree args
, tsubst_flags_t complain
, tree in_decl
)
9838 tree qualifying_scope
;
9841 tree template_args
= 0;
9842 bool template_id_p
= false;
9844 /* A baselink indicates a function from a base class. Both the
9845 BASELINK_ACCESS_BINFO and the base class referenced may
9846 indicate bases of the template class, rather than the
9847 instantiated class. In addition, lookups that were not
9848 ambiguous before may be ambiguous now. Therefore, we perform
9849 the lookup again. */
9850 qualifying_scope
= BINFO_TYPE (BASELINK_ACCESS_BINFO (baselink
));
9851 qualifying_scope
= tsubst (qualifying_scope
, args
,
9853 fns
= BASELINK_FUNCTIONS (baselink
);
9854 optype
= BASELINK_OPTYPE (baselink
);
9855 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
9857 template_id_p
= true;
9858 template_args
= TREE_OPERAND (fns
, 1);
9859 fns
= TREE_OPERAND (fns
, 0);
9861 template_args
= tsubst_template_args (template_args
, args
,
9864 name
= DECL_NAME (get_first_fn (fns
));
9865 baselink
= lookup_fnfields (qualifying_scope
, name
, /*protect=*/1);
9867 /* If lookup found a single function, mark it as used at this
9868 point. (If it lookup found multiple functions the one selected
9869 later by overload resolution will be marked as used at that
9871 if (BASELINK_P (baselink
))
9872 fns
= BASELINK_FUNCTIONS (baselink
);
9873 if (!template_id_p
&& !really_overloaded_fn (fns
))
9874 mark_used (OVL_CURRENT (fns
));
9876 /* Add back the template arguments, if present. */
9877 if (BASELINK_P (baselink
) && template_id_p
)
9878 BASELINK_FUNCTIONS (baselink
)
9879 = build_nt (TEMPLATE_ID_EXPR
,
9880 BASELINK_FUNCTIONS (baselink
),
9882 /* Update the conversion operator type. */
9883 BASELINK_OPTYPE (baselink
)
9884 = tsubst (optype
, args
, complain
, in_decl
);
9887 object_type
= current_class_type
;
9888 return adjust_result_of_qualified_name_lookup (baselink
,
9893 /* Like tsubst_expr for a SCOPE_REF, given by QUALIFIED_ID. DONE is
9894 true if the qualified-id will be a postfix-expression in-and-of
9895 itself; false if more of the postfix-expression follows the
9896 QUALIFIED_ID. ADDRESS_P is true if the qualified-id is the operand
9900 tsubst_qualified_id (tree qualified_id
, tree args
,
9901 tsubst_flags_t complain
, tree in_decl
,
9902 bool done
, bool address_p
)
9910 gcc_assert (TREE_CODE (qualified_id
) == SCOPE_REF
);
9912 /* Figure out what name to look up. */
9913 name
= TREE_OPERAND (qualified_id
, 1);
9914 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
9917 template_args
= TREE_OPERAND (name
, 1);
9919 template_args
= tsubst_template_args (template_args
, args
,
9921 name
= TREE_OPERAND (name
, 0);
9925 is_template
= false;
9926 template_args
= NULL_TREE
;
9929 /* Substitute into the qualifying scope. When there are no ARGS, we
9930 are just trying to simplify a non-dependent expression. In that
9931 case the qualifying scope may be dependent, and, in any case,
9932 substituting will not help. */
9933 scope
= TREE_OPERAND (qualified_id
, 0);
9936 scope
= tsubst (scope
, args
, complain
, in_decl
);
9937 expr
= tsubst_copy (name
, args
, complain
, in_decl
);
9942 if (dependent_type_p (scope
))
9944 tree type
= NULL_TREE
;
9945 if (DECL_P (expr
) && !dependent_scope_p (scope
))
9946 type
= TREE_TYPE (expr
);
9947 return build_qualified_name (type
, scope
, expr
,
9948 QUALIFIED_NAME_IS_TEMPLATE (qualified_id
));
9951 if (!BASELINK_P (name
) && !DECL_P (expr
))
9953 if (TREE_CODE (expr
) == BIT_NOT_EXPR
)
9955 /* A BIT_NOT_EXPR is used to represent a destructor. */
9956 if (!check_dtor_name (scope
, TREE_OPERAND (expr
, 0)))
9958 error ("qualifying type %qT does not match destructor name ~%qT",
9959 scope
, TREE_OPERAND (expr
, 0));
9960 expr
= error_mark_node
;
9963 expr
= lookup_qualified_name (scope
, complete_dtor_identifier
,
9964 /*is_type_p=*/0, false);
9967 expr
= lookup_qualified_name (scope
, expr
, /*is_type_p=*/0, false);
9968 if (TREE_CODE (TREE_CODE (expr
) == TEMPLATE_DECL
9969 ? DECL_TEMPLATE_RESULT (expr
) : expr
) == TYPE_DECL
)
9971 if (complain
& tf_error
)
9973 error ("dependent-name %qE is parsed as a non-type, but "
9974 "instantiation yields a type", qualified_id
);
9975 inform (input_location
, "say %<typename %E%> if a type is meant", qualified_id
);
9977 return error_mark_node
;
9983 check_accessibility_of_qualified_id (expr
, /*object_type=*/NULL_TREE
,
9985 /* Remember that there was a reference to this entity. */
9989 if (expr
== error_mark_node
|| TREE_CODE (expr
) == TREE_LIST
)
9991 if (complain
& tf_error
)
9992 qualified_name_lookup_error (scope
,
9993 TREE_OPERAND (qualified_id
, 1),
9994 expr
, input_location
);
9995 return error_mark_node
;
9999 expr
= lookup_template_function (expr
, template_args
);
10001 if (expr
== error_mark_node
&& complain
& tf_error
)
10002 qualified_name_lookup_error (scope
, TREE_OPERAND (qualified_id
, 1),
10003 expr
, input_location
);
10004 else if (TYPE_P (scope
))
10006 expr
= (adjust_result_of_qualified_name_lookup
10007 (expr
, scope
, current_class_type
));
10008 expr
= (finish_qualified_id_expr
10009 (scope
, expr
, done
, address_p
,
10010 QUALIFIED_NAME_IS_TEMPLATE (qualified_id
),
10011 /*template_arg_p=*/false));
10014 /* Expressions do not generally have reference type. */
10015 if (TREE_CODE (expr
) != SCOPE_REF
10016 /* However, if we're about to form a pointer-to-member, we just
10017 want the referenced member referenced. */
10018 && TREE_CODE (expr
) != OFFSET_REF
)
10019 expr
= convert_from_reference (expr
);
10024 /* Like tsubst, but deals with expressions. This function just replaces
10025 template parms; to finish processing the resultant expression, use
10029 tsubst_copy (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
10031 enum tree_code code
;
10034 if (t
== NULL_TREE
|| t
== error_mark_node
|| args
== NULL_TREE
)
10037 code
= TREE_CODE (t
);
10042 r
= retrieve_local_specialization (t
);
10047 /* This can happen for a parameter name used later in a function
10048 declaration (such as in a late-specified return type). Just
10049 make a dummy decl, since it's only used for its type. */
10050 gcc_assert (skip_evaluation
);
10051 /* We copy T because want to tsubst the PARM_DECL only,
10052 not the following PARM_DECLs that are chained to T. */
10054 r
= tsubst_decl (c
, args
, complain
);
10055 /* Give it the template pattern as its context; its true context
10056 hasn't been instantiated yet and this is good enough for
10058 DECL_CONTEXT (r
) = DECL_CONTEXT (t
);
10061 if (TREE_CODE (r
) == ARGUMENT_PACK_SELECT
)
10062 r
= ARGUMENT_PACK_SELECT_ARG (r
);
10071 if (DECL_TEMPLATE_PARM_P (t
))
10072 return tsubst_copy (DECL_INITIAL (t
), args
, complain
, in_decl
);
10073 /* There is no need to substitute into namespace-scope
10075 if (DECL_NAMESPACE_SCOPE_P (t
))
10077 /* If ARGS is NULL, then T is known to be non-dependent. */
10078 if (args
== NULL_TREE
)
10079 return integral_constant_value (t
);
10081 /* Unfortunately, we cannot just call lookup_name here.
10084 template <int I> int f() {
10086 struct S { void g() { E e = a; } };
10089 When we instantiate f<7>::S::g(), say, lookup_name is not
10090 clever enough to find f<7>::a. */
10092 = tsubst_aggr_type (TREE_TYPE (t
), args
, complain
, in_decl
,
10093 /*entering_scope=*/0);
10095 for (v
= TYPE_VALUES (enum_type
);
10097 v
= TREE_CHAIN (v
))
10098 if (TREE_PURPOSE (v
) == DECL_NAME (t
))
10099 return TREE_VALUE (v
);
10101 /* We didn't find the name. That should never happen; if
10102 name-lookup found it during preliminary parsing, we
10103 should find it again here during instantiation. */
10104 gcc_unreachable ();
10109 if (DECL_CONTEXT (t
))
10113 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
10114 /*entering_scope=*/1);
10115 if (ctx
!= DECL_CONTEXT (t
))
10117 tree r
= lookup_field (ctx
, DECL_NAME (t
), 0, false);
10120 if (complain
& tf_error
)
10121 error ("using invalid field %qD", t
);
10122 return error_mark_node
;
10131 case FUNCTION_DECL
:
10132 if ((DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
))
10133 || local_variable_p (t
))
10134 t
= tsubst (t
, args
, complain
, in_decl
);
10139 return tsubst_baselink (t
, current_class_type
, args
, complain
, in_decl
);
10141 case TEMPLATE_DECL
:
10142 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
10143 return tsubst (TREE_TYPE (DECL_TEMPLATE_RESULT (t
)),
10144 args
, complain
, in_decl
);
10145 else if (DECL_FUNCTION_TEMPLATE_P (t
) && DECL_MEMBER_TEMPLATE_P (t
))
10146 return tsubst (t
, args
, complain
, in_decl
);
10147 else if (DECL_CLASS_SCOPE_P (t
)
10148 && uses_template_parms (DECL_CONTEXT (t
)))
10150 /* Template template argument like the following example need
10153 template <template <class> class TT> struct C {};
10154 template <class T> struct D {
10155 template <class U> struct E {};
10160 We are processing the template argument `E' in #1 for
10161 the template instantiation #2. Originally, `E' is a
10162 TEMPLATE_DECL with `D<T>' as its DECL_CONTEXT. Now we
10163 have to substitute this with one having context `D<int>'. */
10165 tree context
= tsubst (DECL_CONTEXT (t
), args
, complain
, in_decl
);
10166 return lookup_field (context
, DECL_NAME(t
), 0, false);
10169 /* Ordinary template template argument. */
10173 case REINTERPRET_CAST_EXPR
:
10174 case CONST_CAST_EXPR
:
10175 case STATIC_CAST_EXPR
:
10176 case DYNAMIC_CAST_EXPR
:
10179 (code
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
10180 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
));
10183 if (PACK_EXPANSION_P (TREE_OPERAND (t
, 0)))
10185 /* We only want to compute the number of arguments. */
10186 tree expanded
= tsubst_pack_expansion (TREE_OPERAND (t
, 0), args
,
10187 complain
, in_decl
);
10190 if (TREE_CODE (expanded
) == TREE_VEC
)
10191 len
= TREE_VEC_LENGTH (expanded
);
10193 if (expanded
== error_mark_node
)
10194 return error_mark_node
;
10195 else if (PACK_EXPANSION_P (expanded
)
10196 || (TREE_CODE (expanded
) == TREE_VEC
10198 && PACK_EXPANSION_P (TREE_VEC_ELT (expanded
, len
-1))))
10200 if (TREE_CODE (expanded
) == TREE_VEC
)
10201 expanded
= TREE_VEC_ELT (expanded
, len
- 1);
10203 if (TYPE_P (expanded
))
10204 return cxx_sizeof_or_alignof_type (expanded
, SIZEOF_EXPR
,
10205 complain
& tf_error
);
10207 return cxx_sizeof_or_alignof_expr (expanded
, SIZEOF_EXPR
,
10208 complain
& tf_error
);
10211 return build_int_cst (size_type_node
, len
);
10217 case TRUTH_NOT_EXPR
:
10220 case UNARY_PLUS_EXPR
: /* Unary + */
10225 case REALPART_EXPR
:
10226 case IMAGPART_EXPR
:
10228 (code
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
10229 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
));
10231 case COMPONENT_REF
:
10236 object
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
10237 name
= TREE_OPERAND (t
, 1);
10238 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
10240 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
10241 complain
, in_decl
);
10242 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
10244 else if (TREE_CODE (name
) == SCOPE_REF
10245 && TREE_CODE (TREE_OPERAND (name
, 1)) == BIT_NOT_EXPR
)
10247 tree base
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
10248 complain
, in_decl
);
10249 name
= TREE_OPERAND (name
, 1);
10250 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
10251 complain
, in_decl
);
10252 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
10253 name
= build_qualified_name (/*type=*/NULL_TREE
,
10255 /*template_p=*/false);
10257 else if (TREE_CODE (name
) == BASELINK
)
10258 name
= tsubst_baselink (name
,
10259 non_reference (TREE_TYPE (object
)),
10263 name
= tsubst_copy (name
, args
, complain
, in_decl
);
10264 return build_nt (COMPONENT_REF
, object
, name
, NULL_TREE
);
10270 case TRUNC_DIV_EXPR
:
10271 case CEIL_DIV_EXPR
:
10272 case FLOOR_DIV_EXPR
:
10273 case ROUND_DIV_EXPR
:
10274 case EXACT_DIV_EXPR
:
10278 case TRUNC_MOD_EXPR
:
10279 case FLOOR_MOD_EXPR
:
10280 case TRUTH_ANDIF_EXPR
:
10281 case TRUTH_ORIF_EXPR
:
10282 case TRUTH_AND_EXPR
:
10283 case TRUTH_OR_EXPR
:
10296 case COMPOUND_EXPR
:
10299 case PREDECREMENT_EXPR
:
10300 case PREINCREMENT_EXPR
:
10301 case POSTDECREMENT_EXPR
:
10302 case POSTINCREMENT_EXPR
:
10304 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
10305 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
));
10308 return build_qualified_name (/*type=*/NULL_TREE
,
10309 tsubst_copy (TREE_OPERAND (t
, 0),
10310 args
, complain
, in_decl
),
10311 tsubst_copy (TREE_OPERAND (t
, 1),
10312 args
, complain
, in_decl
),
10313 QUALIFIED_NAME_IS_TEMPLATE (t
));
10318 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
10319 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
),
10320 NULL_TREE
, NULL_TREE
);
10324 int n
= VL_EXP_OPERAND_LENGTH (t
);
10325 tree result
= build_vl_exp (CALL_EXPR
, n
);
10327 for (i
= 0; i
< n
; i
++)
10328 TREE_OPERAND (t
, i
) = tsubst_copy (TREE_OPERAND (t
, i
), args
,
10329 complain
, in_decl
);
10335 case PSEUDO_DTOR_EXPR
:
10338 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
10339 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
),
10340 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
));
10341 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
10348 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
10349 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
),
10350 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
));
10351 NEW_EXPR_USE_GLOBAL (r
) = NEW_EXPR_USE_GLOBAL (t
);
10358 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
10359 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
));
10360 DELETE_EXPR_USE_GLOBAL (r
) = DELETE_EXPR_USE_GLOBAL (t
);
10361 DELETE_EXPR_USE_VEC (r
) = DELETE_EXPR_USE_VEC (t
);
10365 case TEMPLATE_ID_EXPR
:
10367 /* Substituted template arguments */
10368 tree fn
= TREE_OPERAND (t
, 0);
10369 tree targs
= TREE_OPERAND (t
, 1);
10371 fn
= tsubst_copy (fn
, args
, complain
, in_decl
);
10373 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
10375 return lookup_template_function (fn
, targs
);
10380 tree purpose
, value
, chain
;
10382 if (t
== void_list_node
)
10385 purpose
= TREE_PURPOSE (t
);
10387 purpose
= tsubst_copy (purpose
, args
, complain
, in_decl
);
10388 value
= TREE_VALUE (t
);
10390 value
= tsubst_copy (value
, args
, complain
, in_decl
);
10391 chain
= TREE_CHAIN (t
);
10392 if (chain
&& chain
!= void_type_node
)
10393 chain
= tsubst_copy (chain
, args
, complain
, in_decl
);
10394 if (purpose
== TREE_PURPOSE (t
)
10395 && value
== TREE_VALUE (t
)
10396 && chain
== TREE_CHAIN (t
))
10398 return tree_cons (purpose
, value
, chain
);
10403 case ENUMERAL_TYPE
:
10405 case TEMPLATE_TYPE_PARM
:
10406 case TEMPLATE_TEMPLATE_PARM
:
10407 case BOUND_TEMPLATE_TEMPLATE_PARM
:
10408 case TEMPLATE_PARM_INDEX
:
10410 case REFERENCE_TYPE
:
10412 case FUNCTION_TYPE
:
10415 case TYPENAME_TYPE
:
10416 case UNBOUND_CLASS_TEMPLATE
:
10418 case DECLTYPE_TYPE
:
10420 return tsubst (t
, args
, complain
, in_decl
);
10422 case IDENTIFIER_NODE
:
10423 if (IDENTIFIER_TYPENAME_P (t
))
10425 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
10426 return mangle_conv_op_name_for_type (new_type
);
10432 /* This is handled by tsubst_copy_and_build. */
10433 gcc_unreachable ();
10436 return build_x_va_arg (tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
,
10438 tsubst (TREE_TYPE (t
), args
, complain
, in_decl
));
10440 case CLEANUP_POINT_EXPR
:
10441 /* We shouldn't have built any of these during initial template
10442 generation. Instead, they should be built during instantiation
10443 in response to the saved STMT_IS_FULL_EXPR_P setting. */
10444 gcc_unreachable ();
10447 mark_used (TREE_OPERAND (t
, 1));
10450 case EXPR_PACK_EXPANSION
:
10451 error ("invalid use of pack expansion expression");
10452 return error_mark_node
;
10454 case NONTYPE_ARGUMENT_PACK
:
10455 error ("use %<...%> to expand argument pack");
10456 return error_mark_node
;
10463 /* Like tsubst_copy, but specifically for OpenMP clauses. */
10466 tsubst_omp_clauses (tree clauses
, tree args
, tsubst_flags_t complain
,
10469 tree new_clauses
= NULL
, nc
, oc
;
10471 for (oc
= clauses
; oc
; oc
= OMP_CLAUSE_CHAIN (oc
))
10473 nc
= copy_node (oc
);
10474 OMP_CLAUSE_CHAIN (nc
) = new_clauses
;
10477 switch (OMP_CLAUSE_CODE (nc
))
10479 case OMP_CLAUSE_LASTPRIVATE
:
10480 if (OMP_CLAUSE_LASTPRIVATE_STMT (oc
))
10482 OMP_CLAUSE_LASTPRIVATE_STMT (nc
) = push_stmt_list ();
10483 tsubst_expr (OMP_CLAUSE_LASTPRIVATE_STMT (oc
), args
, complain
,
10484 in_decl
, /*integral_constant_expression_p=*/false);
10485 OMP_CLAUSE_LASTPRIVATE_STMT (nc
)
10486 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (nc
));
10489 case OMP_CLAUSE_PRIVATE
:
10490 case OMP_CLAUSE_SHARED
:
10491 case OMP_CLAUSE_FIRSTPRIVATE
:
10492 case OMP_CLAUSE_REDUCTION
:
10493 case OMP_CLAUSE_COPYIN
:
10494 case OMP_CLAUSE_COPYPRIVATE
:
10495 case OMP_CLAUSE_IF
:
10496 case OMP_CLAUSE_NUM_THREADS
:
10497 case OMP_CLAUSE_SCHEDULE
:
10498 case OMP_CLAUSE_COLLAPSE
:
10499 OMP_CLAUSE_OPERAND (nc
, 0)
10500 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 0), args
, complain
,
10501 in_decl
, /*integral_constant_expression_p=*/false);
10503 case OMP_CLAUSE_NOWAIT
:
10504 case OMP_CLAUSE_ORDERED
:
10505 case OMP_CLAUSE_DEFAULT
:
10506 case OMP_CLAUSE_UNTIED
:
10509 gcc_unreachable ();
10513 return finish_omp_clauses (nreverse (new_clauses
));
10516 /* Like tsubst_copy_and_build, but unshare TREE_LIST nodes. */
10519 tsubst_copy_asm_operands (tree t
, tree args
, tsubst_flags_t complain
,
10522 #define RECUR(t) tsubst_copy_asm_operands (t, args, complain, in_decl)
10524 tree purpose
, value
, chain
;
10529 if (TREE_CODE (t
) != TREE_LIST
)
10530 return tsubst_copy_and_build (t
, args
, complain
, in_decl
,
10531 /*function_p=*/false,
10532 /*integral_constant_expression_p=*/false);
10534 if (t
== void_list_node
)
10537 purpose
= TREE_PURPOSE (t
);
10539 purpose
= RECUR (purpose
);
10540 value
= TREE_VALUE (t
);
10542 value
= RECUR (value
);
10543 chain
= TREE_CHAIN (t
);
10544 if (chain
&& chain
!= void_type_node
)
10545 chain
= RECUR (chain
);
10546 return tree_cons (purpose
, value
, chain
);
10550 /* Substitute one OMP_FOR iterator. */
10553 tsubst_omp_for_iterator (tree t
, int i
, tree declv
, tree initv
,
10554 tree condv
, tree incrv
, tree
*clauses
,
10555 tree args
, tsubst_flags_t complain
, tree in_decl
,
10556 bool integral_constant_expression_p
)
10558 #define RECUR(NODE) \
10559 tsubst_expr ((NODE), args, complain, in_decl, \
10560 integral_constant_expression_p)
10561 tree decl
, init
, cond
, incr
, auto_node
;
10563 init
= TREE_VEC_ELT (OMP_FOR_INIT (t
), i
);
10564 gcc_assert (TREE_CODE (init
) == MODIFY_EXPR
);
10565 decl
= RECUR (TREE_OPERAND (init
, 0));
10566 init
= TREE_OPERAND (init
, 1);
10567 auto_node
= type_uses_auto (TREE_TYPE (decl
));
10568 if (auto_node
&& init
)
10570 tree init_expr
= init
;
10571 if (TREE_CODE (init_expr
) == DECL_EXPR
)
10572 init_expr
= DECL_INITIAL (DECL_EXPR_DECL (init_expr
));
10573 init_expr
= RECUR (init_expr
);
10575 = do_auto_deduction (TREE_TYPE (decl
), init_expr
, auto_node
);
10577 gcc_assert (!type_dependent_expression_p (decl
));
10579 if (!CLASS_TYPE_P (TREE_TYPE (decl
)))
10581 cond
= RECUR (TREE_VEC_ELT (OMP_FOR_COND (t
), i
));
10582 incr
= TREE_VEC_ELT (OMP_FOR_INCR (t
), i
);
10583 if (TREE_CODE (incr
) == MODIFY_EXPR
)
10584 incr
= build_x_modify_expr (RECUR (TREE_OPERAND (incr
, 0)), NOP_EXPR
,
10585 RECUR (TREE_OPERAND (incr
, 1)),
10588 incr
= RECUR (incr
);
10589 TREE_VEC_ELT (declv
, i
) = decl
;
10590 TREE_VEC_ELT (initv
, i
) = init
;
10591 TREE_VEC_ELT (condv
, i
) = cond
;
10592 TREE_VEC_ELT (incrv
, i
) = incr
;
10596 if (init
&& TREE_CODE (init
) != DECL_EXPR
)
10599 for (c
= *clauses
; c
; c
= OMP_CLAUSE_CHAIN (c
))
10601 if ((OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_PRIVATE
10602 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_LASTPRIVATE
)
10603 && OMP_CLAUSE_DECL (c
) == decl
)
10605 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_FIRSTPRIVATE
10606 && OMP_CLAUSE_DECL (c
) == decl
)
10607 error ("iteration variable %qD should not be firstprivate", decl
);
10608 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
10609 && OMP_CLAUSE_DECL (c
) == decl
)
10610 error ("iteration variable %qD should not be reduction", decl
);
10614 c
= build_omp_clause (input_location
, OMP_CLAUSE_PRIVATE
);
10615 OMP_CLAUSE_DECL (c
) = decl
;
10616 c
= finish_omp_clauses (c
);
10619 OMP_CLAUSE_CHAIN (c
) = *clauses
;
10624 cond
= TREE_VEC_ELT (OMP_FOR_COND (t
), i
);
10625 if (COMPARISON_CLASS_P (cond
))
10626 cond
= build2 (TREE_CODE (cond
), boolean_type_node
,
10627 RECUR (TREE_OPERAND (cond
, 0)),
10628 RECUR (TREE_OPERAND (cond
, 1)));
10630 cond
= RECUR (cond
);
10631 incr
= TREE_VEC_ELT (OMP_FOR_INCR (t
), i
);
10632 switch (TREE_CODE (incr
))
10634 case PREINCREMENT_EXPR
:
10635 case PREDECREMENT_EXPR
:
10636 case POSTINCREMENT_EXPR
:
10637 case POSTDECREMENT_EXPR
:
10638 incr
= build2 (TREE_CODE (incr
), TREE_TYPE (decl
),
10639 RECUR (TREE_OPERAND (incr
, 0)), NULL_TREE
);
10642 if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
10643 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
10645 tree rhs
= TREE_OPERAND (incr
, 1);
10646 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
),
10647 RECUR (TREE_OPERAND (incr
, 0)),
10648 build2 (TREE_CODE (rhs
), TREE_TYPE (decl
),
10649 RECUR (TREE_OPERAND (rhs
, 0)),
10650 RECUR (TREE_OPERAND (rhs
, 1))));
10653 incr
= RECUR (incr
);
10656 if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
10657 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
10659 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
10660 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
10661 build2 (TREE_CODE (TREE_OPERAND (incr
, 1)),
10662 TREE_TYPE (decl
), lhs
,
10663 RECUR (TREE_OPERAND (incr
, 2))));
10665 else if (TREE_CODE (TREE_OPERAND (incr
, 1)) == NOP_EXPR
10666 && (TREE_CODE (TREE_OPERAND (incr
, 2)) == PLUS_EXPR
10667 || (TREE_CODE (TREE_OPERAND (incr
, 2)) == MINUS_EXPR
)))
10669 tree rhs
= TREE_OPERAND (incr
, 2);
10670 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
),
10671 RECUR (TREE_OPERAND (incr
, 0)),
10672 build2 (TREE_CODE (rhs
), TREE_TYPE (decl
),
10673 RECUR (TREE_OPERAND (rhs
, 0)),
10674 RECUR (TREE_OPERAND (rhs
, 1))));
10677 incr
= RECUR (incr
);
10680 incr
= RECUR (incr
);
10684 TREE_VEC_ELT (declv
, i
) = decl
;
10685 TREE_VEC_ELT (initv
, i
) = init
;
10686 TREE_VEC_ELT (condv
, i
) = cond
;
10687 TREE_VEC_ELT (incrv
, i
) = incr
;
10691 /* Like tsubst_copy for expressions, etc. but also does semantic
10695 tsubst_expr (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
,
10696 bool integral_constant_expression_p
)
10698 #define RECUR(NODE) \
10699 tsubst_expr ((NODE), args, complain, in_decl, \
10700 integral_constant_expression_p)
10704 if (t
== NULL_TREE
|| t
== error_mark_node
)
10707 if (EXPR_HAS_LOCATION (t
))
10708 input_location
= EXPR_LOCATION (t
);
10709 if (STATEMENT_CODE_P (TREE_CODE (t
)))
10710 current_stmt_tree ()->stmts_are_full_exprs_p
= STMT_IS_FULL_EXPR_P (t
);
10712 switch (TREE_CODE (t
))
10714 case STATEMENT_LIST
:
10716 tree_stmt_iterator i
;
10717 for (i
= tsi_start (t
); !tsi_end_p (i
); tsi_next (&i
))
10718 RECUR (tsi_stmt (i
));
10722 case CTOR_INITIALIZER
:
10723 finish_mem_initializers (tsubst_initializer_list
10724 (TREE_OPERAND (t
, 0), args
));
10728 finish_return_stmt (RECUR (TREE_OPERAND (t
, 0)));
10732 tmp
= RECUR (EXPR_STMT_EXPR (t
));
10733 if (EXPR_STMT_STMT_EXPR_RESULT (t
))
10734 finish_stmt_expr_expr (tmp
, cur_stmt_expr
);
10736 finish_expr_stmt (tmp
);
10740 do_using_directive (RECUR (USING_STMT_NAMESPACE (t
)));
10748 decl
= DECL_EXPR_DECL (t
);
10749 if (TREE_CODE (decl
) == LABEL_DECL
)
10750 finish_label_decl (DECL_NAME (decl
));
10751 else if (TREE_CODE (decl
) == USING_DECL
)
10753 tree scope
= USING_DECL_SCOPE (decl
);
10754 tree name
= DECL_NAME (decl
);
10757 scope
= RECUR (scope
);
10758 decl
= lookup_qualified_name (scope
, name
,
10759 /*is_type_p=*/false,
10760 /*complain=*/false);
10761 if (decl
== error_mark_node
|| TREE_CODE (decl
) == TREE_LIST
)
10762 qualified_name_lookup_error (scope
, name
, decl
, input_location
);
10764 do_local_using_decl (decl
, scope
, name
);
10768 init
= DECL_INITIAL (decl
);
10769 decl
= tsubst (decl
, args
, complain
, in_decl
);
10770 if (decl
!= error_mark_node
)
10772 /* By marking the declaration as instantiated, we avoid
10773 trying to instantiate it. Since instantiate_decl can't
10774 handle local variables, and since we've already done
10775 all that needs to be done, that's the right thing to
10777 if (TREE_CODE (decl
) == VAR_DECL
)
10778 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
10779 if (TREE_CODE (decl
) == VAR_DECL
10780 && ANON_AGGR_TYPE_P (TREE_TYPE (decl
)))
10781 /* Anonymous aggregates are a special case. */
10782 finish_anon_union (decl
);
10785 maybe_push_decl (decl
);
10786 if (TREE_CODE (decl
) == VAR_DECL
10787 && DECL_PRETTY_FUNCTION_P (decl
))
10789 /* For __PRETTY_FUNCTION__ we have to adjust the
10791 const char *const name
10792 = cxx_printable_name (current_function_decl
, 2);
10793 init
= cp_fname_init (name
, &TREE_TYPE (decl
));
10797 tree t
= RECUR (init
);
10800 /* If we had an initializer but it
10801 instantiated to nothing,
10802 value-initialize the object. This will
10803 only occur when the initializer was a
10804 pack expansion where the parameter packs
10805 used in that expansion were of length
10807 init
= build_value_init (TREE_TYPE (decl
));
10812 finish_decl (decl
, init
, NULL_TREE
, NULL_TREE
);
10817 /* A DECL_EXPR can also be used as an expression, in the condition
10818 clause of an if/for/while construct. */
10823 stmt
= begin_for_stmt ();
10824 RECUR (FOR_INIT_STMT (t
));
10825 finish_for_init_stmt (stmt
);
10826 tmp
= RECUR (FOR_COND (t
));
10827 finish_for_cond (tmp
, stmt
);
10828 tmp
= RECUR (FOR_EXPR (t
));
10829 finish_for_expr (tmp
, stmt
);
10830 RECUR (FOR_BODY (t
));
10831 finish_for_stmt (stmt
);
10835 stmt
= begin_while_stmt ();
10836 tmp
= RECUR (WHILE_COND (t
));
10837 finish_while_stmt_cond (tmp
, stmt
);
10838 RECUR (WHILE_BODY (t
));
10839 finish_while_stmt (stmt
);
10843 stmt
= begin_do_stmt ();
10844 RECUR (DO_BODY (t
));
10845 finish_do_body (stmt
);
10846 tmp
= RECUR (DO_COND (t
));
10847 finish_do_stmt (tmp
, stmt
);
10851 stmt
= begin_if_stmt ();
10852 tmp
= RECUR (IF_COND (t
));
10853 finish_if_stmt_cond (tmp
, stmt
);
10854 RECUR (THEN_CLAUSE (t
));
10855 finish_then_clause (stmt
);
10857 if (ELSE_CLAUSE (t
))
10859 begin_else_clause (stmt
);
10860 RECUR (ELSE_CLAUSE (t
));
10861 finish_else_clause (stmt
);
10864 finish_if_stmt (stmt
);
10868 if (BIND_EXPR_BODY_BLOCK (t
))
10869 stmt
= begin_function_body ();
10871 stmt
= begin_compound_stmt (BIND_EXPR_TRY_BLOCK (t
)
10872 ? BCS_TRY_BLOCK
: 0);
10874 RECUR (BIND_EXPR_BODY (t
));
10876 if (BIND_EXPR_BODY_BLOCK (t
))
10877 finish_function_body (stmt
);
10879 finish_compound_stmt (stmt
);
10883 finish_break_stmt ();
10886 case CONTINUE_STMT
:
10887 finish_continue_stmt ();
10891 stmt
= begin_switch_stmt ();
10892 tmp
= RECUR (SWITCH_STMT_COND (t
));
10893 finish_switch_cond (tmp
, stmt
);
10894 RECUR (SWITCH_STMT_BODY (t
));
10895 finish_switch_stmt (stmt
);
10898 case CASE_LABEL_EXPR
:
10899 finish_case_label (EXPR_LOCATION (t
),
10900 RECUR (CASE_LOW (t
)),
10901 RECUR (CASE_HIGH (t
)));
10906 tree decl
= LABEL_EXPR_LABEL (t
);
10909 label
= finish_label_stmt (DECL_NAME (decl
));
10910 if (DECL_ATTRIBUTES (decl
) != NULL_TREE
)
10911 cplus_decl_attributes (&label
, DECL_ATTRIBUTES (decl
), 0);
10916 tmp
= GOTO_DESTINATION (t
);
10917 if (TREE_CODE (tmp
) != LABEL_DECL
)
10918 /* Computed goto's must be tsubst'd into. On the other hand,
10919 non-computed gotos must not be; the identifier in question
10920 will have no binding. */
10923 tmp
= DECL_NAME (tmp
);
10924 finish_goto_stmt (tmp
);
10928 tmp
= finish_asm_stmt
10929 (ASM_VOLATILE_P (t
),
10930 RECUR (ASM_STRING (t
)),
10931 tsubst_copy_asm_operands (ASM_OUTPUTS (t
), args
, complain
, in_decl
),
10932 tsubst_copy_asm_operands (ASM_INPUTS (t
), args
, complain
, in_decl
),
10933 tsubst_copy_asm_operands (ASM_CLOBBERS (t
), args
, complain
, in_decl
));
10935 tree asm_expr
= tmp
;
10936 if (TREE_CODE (asm_expr
) == CLEANUP_POINT_EXPR
)
10937 asm_expr
= TREE_OPERAND (asm_expr
, 0);
10938 ASM_INPUT_P (asm_expr
) = ASM_INPUT_P (t
);
10945 stmt
= begin_try_block ();
10946 RECUR (TRY_STMTS (t
));
10947 finish_cleanup_try_block (stmt
);
10948 finish_cleanup (RECUR (TRY_HANDLERS (t
)), stmt
);
10952 tree compound_stmt
= NULL_TREE
;
10954 if (FN_TRY_BLOCK_P (t
))
10955 stmt
= begin_function_try_block (&compound_stmt
);
10957 stmt
= begin_try_block ();
10959 RECUR (TRY_STMTS (t
));
10961 if (FN_TRY_BLOCK_P (t
))
10962 finish_function_try_block (stmt
);
10964 finish_try_block (stmt
);
10966 RECUR (TRY_HANDLERS (t
));
10967 if (FN_TRY_BLOCK_P (t
))
10968 finish_function_handler_sequence (stmt
, compound_stmt
);
10970 finish_handler_sequence (stmt
);
10976 tree decl
= HANDLER_PARMS (t
);
10980 decl
= tsubst (decl
, args
, complain
, in_decl
);
10981 /* Prevent instantiate_decl from trying to instantiate
10982 this variable. We've already done all that needs to be
10984 if (decl
!= error_mark_node
)
10985 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
10987 stmt
= begin_handler ();
10988 finish_handler_parms (decl
, stmt
);
10989 RECUR (HANDLER_BODY (t
));
10990 finish_handler (stmt
);
10995 tsubst (TREE_TYPE (t
), args
, complain
, NULL_TREE
);
10998 case STATIC_ASSERT
:
11001 tsubst_expr (STATIC_ASSERT_CONDITION (t
),
11004 /*integral_constant_expression_p=*/true);
11005 finish_static_assert (condition
,
11006 STATIC_ASSERT_MESSAGE (t
),
11007 STATIC_ASSERT_SOURCE_LOCATION (t
),
11008 /*member_p=*/false);
11013 tmp
= tsubst_omp_clauses (OMP_PARALLEL_CLAUSES (t
),
11014 args
, complain
, in_decl
);
11015 stmt
= begin_omp_parallel ();
11016 RECUR (OMP_PARALLEL_BODY (t
));
11017 OMP_PARALLEL_COMBINED (finish_omp_parallel (tmp
, stmt
))
11018 = OMP_PARALLEL_COMBINED (t
);
11022 tmp
= tsubst_omp_clauses (OMP_TASK_CLAUSES (t
),
11023 args
, complain
, in_decl
);
11024 stmt
= begin_omp_task ();
11025 RECUR (OMP_TASK_BODY (t
));
11026 finish_omp_task (tmp
, stmt
);
11031 tree clauses
, body
, pre_body
;
11032 tree declv
, initv
, condv
, incrv
;
11035 clauses
= tsubst_omp_clauses (OMP_FOR_CLAUSES (t
),
11036 args
, complain
, in_decl
);
11037 declv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
11038 initv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
11039 condv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
11040 incrv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
11042 for (i
= 0; i
< TREE_VEC_LENGTH (OMP_FOR_INIT (t
)); i
++)
11043 tsubst_omp_for_iterator (t
, i
, declv
, initv
, condv
, incrv
,
11044 &clauses
, args
, complain
, in_decl
,
11045 integral_constant_expression_p
);
11047 stmt
= begin_omp_structured_block ();
11049 for (i
= 0; i
< TREE_VEC_LENGTH (initv
); i
++)
11050 if (TREE_VEC_ELT (initv
, i
) == NULL
11051 || TREE_CODE (TREE_VEC_ELT (initv
, i
)) != DECL_EXPR
)
11052 TREE_VEC_ELT (initv
, i
) = RECUR (TREE_VEC_ELT (initv
, i
));
11053 else if (CLASS_TYPE_P (TREE_TYPE (TREE_VEC_ELT (initv
, i
))))
11055 tree init
= RECUR (TREE_VEC_ELT (initv
, i
));
11056 gcc_assert (init
== TREE_VEC_ELT (declv
, i
));
11057 TREE_VEC_ELT (initv
, i
) = NULL_TREE
;
11061 tree decl_expr
= TREE_VEC_ELT (initv
, i
);
11062 tree init
= DECL_INITIAL (DECL_EXPR_DECL (decl_expr
));
11063 gcc_assert (init
!= NULL
);
11064 TREE_VEC_ELT (initv
, i
) = RECUR (init
);
11065 DECL_INITIAL (DECL_EXPR_DECL (decl_expr
)) = NULL
;
11067 DECL_INITIAL (DECL_EXPR_DECL (decl_expr
)) = init
;
11070 pre_body
= push_stmt_list ();
11071 RECUR (OMP_FOR_PRE_BODY (t
));
11072 pre_body
= pop_stmt_list (pre_body
);
11074 body
= push_stmt_list ();
11075 RECUR (OMP_FOR_BODY (t
));
11076 body
= pop_stmt_list (body
);
11078 t
= finish_omp_for (EXPR_LOCATION (t
), declv
, initv
, condv
, incrv
,
11079 body
, pre_body
, clauses
);
11081 add_stmt (finish_omp_structured_block (stmt
));
11087 tmp
= tsubst_omp_clauses (OMP_CLAUSES (t
), args
, complain
, in_decl
);
11088 stmt
= push_stmt_list ();
11089 RECUR (OMP_BODY (t
));
11090 stmt
= pop_stmt_list (stmt
);
11093 OMP_BODY (t
) = stmt
;
11094 OMP_CLAUSES (t
) = tmp
;
11102 stmt
= push_stmt_list ();
11103 RECUR (OMP_BODY (t
));
11104 stmt
= pop_stmt_list (stmt
);
11107 OMP_BODY (t
) = stmt
;
11112 gcc_assert (OMP_ATOMIC_DEPENDENT_P (t
));
11114 tree op1
= TREE_OPERAND (t
, 1);
11115 tree lhs
= RECUR (TREE_OPERAND (op1
, 0));
11116 tree rhs
= RECUR (TREE_OPERAND (op1
, 1));
11117 finish_omp_atomic (TREE_CODE (op1
), lhs
, rhs
);
11121 case EXPR_PACK_EXPANSION
:
11122 error ("invalid use of pack expansion expression");
11123 return error_mark_node
;
11125 case NONTYPE_ARGUMENT_PACK
:
11126 error ("use %<...%> to expand argument pack");
11127 return error_mark_node
;
11130 gcc_assert (!STATEMENT_CODE_P (TREE_CODE (t
)));
11132 return tsubst_copy_and_build (t
, args
, complain
, in_decl
,
11133 /*function_p=*/false,
11134 integral_constant_expression_p
);
11141 /* T is a postfix-expression that is not being used in a function
11142 call. Return the substituted version of T. */
11145 tsubst_non_call_postfix_expression (tree t
, tree args
,
11146 tsubst_flags_t complain
,
11149 if (TREE_CODE (t
) == SCOPE_REF
)
11150 t
= tsubst_qualified_id (t
, args
, complain
, in_decl
,
11151 /*done=*/false, /*address_p=*/false);
11153 t
= tsubst_copy_and_build (t
, args
, complain
, in_decl
,
11154 /*function_p=*/false,
11155 /*integral_constant_expression_p=*/false);
11160 /* Like tsubst but deals with expressions and performs semantic
11161 analysis. FUNCTION_P is true if T is the "F" in "F (ARGS)". */
11164 tsubst_copy_and_build (tree t
,
11166 tsubst_flags_t complain
,
11169 bool integral_constant_expression_p
)
11171 #define RECUR(NODE) \
11172 tsubst_copy_and_build (NODE, args, complain, in_decl, \
11173 /*function_p=*/false, \
11174 integral_constant_expression_p)
11178 if (t
== NULL_TREE
|| t
== error_mark_node
)
11181 switch (TREE_CODE (t
))
11185 /* Fall through. */
11186 case IDENTIFIER_NODE
:
11190 bool non_integral_constant_expression_p
;
11191 const char *error_msg
;
11193 if (IDENTIFIER_TYPENAME_P (t
))
11195 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11196 t
= mangle_conv_op_name_for_type (new_type
);
11199 /* Look up the name. */
11200 decl
= lookup_name (t
);
11202 /* By convention, expressions use ERROR_MARK_NODE to indicate
11203 failure, not NULL_TREE. */
11204 if (decl
== NULL_TREE
)
11205 decl
= error_mark_node
;
11207 decl
= finish_id_expression (t
, decl
, NULL_TREE
,
11209 integral_constant_expression_p
,
11210 /*allow_non_integral_constant_expression_p=*/false,
11211 &non_integral_constant_expression_p
,
11212 /*template_p=*/false,
11214 /*address_p=*/false,
11215 /*template_arg_p=*/false,
11220 if (!function_p
&& TREE_CODE (decl
) == IDENTIFIER_NODE
)
11221 decl
= unqualified_name_lookup_error (decl
);
11225 case TEMPLATE_ID_EXPR
:
11228 tree templ
= RECUR (TREE_OPERAND (t
, 0));
11229 tree targs
= TREE_OPERAND (t
, 1);
11232 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
11234 if (TREE_CODE (templ
) == COMPONENT_REF
)
11236 object
= TREE_OPERAND (templ
, 0);
11237 templ
= TREE_OPERAND (templ
, 1);
11240 object
= NULL_TREE
;
11241 templ
= lookup_template_function (templ
, targs
);
11244 return build3 (COMPONENT_REF
, TREE_TYPE (templ
),
11245 object
, templ
, NULL_TREE
);
11247 return baselink_for_fns (templ
);
11252 tree r
= RECUR (TREE_OPERAND (t
, 0));
11254 if (REFERENCE_REF_P (t
))
11256 /* A type conversion to reference type will be enclosed in
11257 such an indirect ref, but the substitution of the cast
11258 will have also added such an indirect ref. */
11259 if (TREE_CODE (TREE_TYPE (r
)) == REFERENCE_TYPE
)
11260 r
= convert_from_reference (r
);
11263 r
= build_x_indirect_ref (r
, "unary *", complain
);
11269 (tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
11270 RECUR (TREE_OPERAND (t
, 0)));
11273 case REINTERPRET_CAST_EXPR
:
11274 case CONST_CAST_EXPR
:
11275 case DYNAMIC_CAST_EXPR
:
11276 case STATIC_CAST_EXPR
:
11281 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11282 if (integral_constant_expression_p
11283 && !cast_valid_in_integral_constant_expression_p (type
))
11285 if (complain
& tf_error
)
11286 error ("a cast to a type other than an integral or "
11287 "enumeration type cannot appear in a constant-expression");
11288 return error_mark_node
;
11291 op
= RECUR (TREE_OPERAND (t
, 0));
11293 switch (TREE_CODE (t
))
11296 return build_functional_cast (type
, op
, complain
);
11297 case REINTERPRET_CAST_EXPR
:
11298 return build_reinterpret_cast (type
, op
, complain
);
11299 case CONST_CAST_EXPR
:
11300 return build_const_cast (type
, op
, complain
);
11301 case DYNAMIC_CAST_EXPR
:
11302 return build_dynamic_cast (type
, op
, complain
);
11303 case STATIC_CAST_EXPR
:
11304 return build_static_cast (type
, op
, complain
);
11306 gcc_unreachable ();
11310 case POSTDECREMENT_EXPR
:
11311 case POSTINCREMENT_EXPR
:
11312 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
11313 args
, complain
, in_decl
);
11314 return build_x_unary_op (TREE_CODE (t
), op1
, complain
);
11316 case PREDECREMENT_EXPR
:
11317 case PREINCREMENT_EXPR
:
11321 case TRUTH_NOT_EXPR
:
11322 case UNARY_PLUS_EXPR
: /* Unary + */
11323 case REALPART_EXPR
:
11324 case IMAGPART_EXPR
:
11325 return build_x_unary_op (TREE_CODE (t
), RECUR (TREE_OPERAND (t
, 0)),
11329 op1
= TREE_OPERAND (t
, 0);
11330 if (TREE_CODE (op1
) == SCOPE_REF
)
11331 op1
= tsubst_qualified_id (op1
, args
, complain
, in_decl
,
11332 /*done=*/true, /*address_p=*/true);
11334 op1
= tsubst_non_call_postfix_expression (op1
, args
, complain
,
11336 if (TREE_CODE (op1
) == LABEL_DECL
)
11337 return finish_label_address_expr (DECL_NAME (op1
),
11338 EXPR_LOCATION (op1
));
11339 return build_x_unary_op (ADDR_EXPR
, op1
, complain
);
11344 case TRUNC_DIV_EXPR
:
11345 case CEIL_DIV_EXPR
:
11346 case FLOOR_DIV_EXPR
:
11347 case ROUND_DIV_EXPR
:
11348 case EXACT_DIV_EXPR
:
11352 case TRUNC_MOD_EXPR
:
11353 case FLOOR_MOD_EXPR
:
11354 case TRUTH_ANDIF_EXPR
:
11355 case TRUTH_ORIF_EXPR
:
11356 case TRUTH_AND_EXPR
:
11357 case TRUTH_OR_EXPR
:
11372 return build_x_binary_op
11374 RECUR (TREE_OPERAND (t
, 0)),
11375 (TREE_NO_WARNING (TREE_OPERAND (t
, 0))
11377 : TREE_CODE (TREE_OPERAND (t
, 0))),
11378 RECUR (TREE_OPERAND (t
, 1)),
11379 (TREE_NO_WARNING (TREE_OPERAND (t
, 1))
11381 : TREE_CODE (TREE_OPERAND (t
, 1))),
11382 /*overloaded_p=*/NULL
,
11386 return tsubst_qualified_id (t
, args
, complain
, in_decl
, /*done=*/true,
11387 /*address_p=*/false);
11389 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
11390 args
, complain
, in_decl
);
11391 return build_x_array_ref (op1
, RECUR (TREE_OPERAND (t
, 1)), complain
);
11394 if (PACK_EXPANSION_P (TREE_OPERAND (t
, 0)))
11395 return tsubst_copy (t
, args
, complain
, in_decl
);
11399 op1
= TREE_OPERAND (t
, 0);
11402 /* When there are no ARGS, we are trying to evaluate a
11403 non-dependent expression from the parser. Trying to do
11404 the substitutions may not work. */
11406 op1
= TREE_TYPE (op1
);
11411 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
11412 /*function_p=*/false,
11413 /*integral_constant_expression_p=*/false);
11417 return cxx_sizeof_or_alignof_type (op1
, TREE_CODE (t
),
11418 complain
& tf_error
);
11420 return cxx_sizeof_or_alignof_expr (op1
, TREE_CODE (t
),
11421 complain
& tf_error
);
11425 tree r
= build_x_modify_expr
11426 (RECUR (TREE_OPERAND (t
, 0)),
11427 TREE_CODE (TREE_OPERAND (t
, 1)),
11428 RECUR (TREE_OPERAND (t
, 2)),
11430 /* TREE_NO_WARNING must be set if either the expression was
11431 parenthesized or it uses an operator such as >>= rather
11432 than plain assignment. In the former case, it was already
11433 set and must be copied. In the latter case,
11434 build_x_modify_expr sets it and it must not be reset
11436 if (TREE_NO_WARNING (t
))
11437 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
11442 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
11443 args
, complain
, in_decl
);
11444 /* Remember that there was a reference to this entity. */
11447 return build_x_arrow (op1
);
11451 tree placement
= RECUR (TREE_OPERAND (t
, 0));
11452 tree init
= RECUR (TREE_OPERAND (t
, 3));
11453 VEC(tree
,gc
) *placement_vec
;
11454 VEC(tree
,gc
) *init_vec
;
11457 if (placement
== NULL_TREE
)
11458 placement_vec
= NULL
;
11461 placement_vec
= make_tree_vector ();
11462 for (; placement
!= NULL_TREE
; placement
= TREE_CHAIN (placement
))
11463 VEC_safe_push (tree
, gc
, placement_vec
, TREE_VALUE (placement
));
11466 /* If there was an initializer in the original tree, but it
11467 instantiated to an empty list, then we should pass a
11468 non-NULL empty vector to tell build_new that it was an
11469 empty initializer() rather than no initializer. This can
11470 only happen when the initializer is a pack expansion whose
11471 parameter packs are of length zero. */
11472 if (init
== NULL_TREE
&& TREE_OPERAND (t
, 3) == NULL_TREE
)
11476 init_vec
= make_tree_vector ();
11477 if (init
== void_zero_node
)
11478 gcc_assert (init_vec
!= NULL
);
11481 for (; init
!= NULL_TREE
; init
= TREE_CHAIN (init
))
11482 VEC_safe_push (tree
, gc
, init_vec
, TREE_VALUE (init
));
11486 ret
= build_new (&placement_vec
,
11487 RECUR (TREE_OPERAND (t
, 1)),
11488 RECUR (TREE_OPERAND (t
, 2)),
11490 NEW_EXPR_USE_GLOBAL (t
),
11493 if (placement_vec
!= NULL
)
11494 release_tree_vector (placement_vec
);
11495 if (init_vec
!= NULL
)
11496 release_tree_vector (init_vec
);
11502 return delete_sanity
11503 (RECUR (TREE_OPERAND (t
, 0)),
11504 RECUR (TREE_OPERAND (t
, 1)),
11505 DELETE_EXPR_USE_VEC (t
),
11506 DELETE_EXPR_USE_GLOBAL (t
));
11508 case COMPOUND_EXPR
:
11509 return build_x_compound_expr (RECUR (TREE_OPERAND (t
, 0)),
11510 RECUR (TREE_OPERAND (t
, 1)),
11516 VEC(tree
,gc
) *call_args
;
11517 unsigned int nargs
, i
;
11522 function
= CALL_EXPR_FN (t
);
11523 /* When we parsed the expression, we determined whether or
11524 not Koenig lookup should be performed. */
11525 koenig_p
= KOENIG_LOOKUP_P (t
);
11526 if (TREE_CODE (function
) == SCOPE_REF
)
11528 qualified_p
= true;
11529 function
= tsubst_qualified_id (function
, args
, complain
, in_decl
,
11531 /*address_p=*/false);
11535 if (TREE_CODE (function
) == COMPONENT_REF
)
11537 tree op
= TREE_OPERAND (function
, 1);
11539 qualified_p
= (TREE_CODE (op
) == SCOPE_REF
11540 || (BASELINK_P (op
)
11541 && BASELINK_QUALIFIED_P (op
)));
11544 qualified_p
= false;
11546 function
= tsubst_copy_and_build (function
, args
, complain
,
11549 integral_constant_expression_p
);
11551 if (BASELINK_P (function
))
11552 qualified_p
= true;
11555 nargs
= call_expr_nargs (t
);
11556 call_args
= make_tree_vector ();
11557 for (i
= 0; i
< nargs
; ++i
)
11559 tree arg
= CALL_EXPR_ARG (t
, i
);
11561 if (!PACK_EXPANSION_P (arg
))
11562 VEC_safe_push (tree
, gc
, call_args
,
11563 RECUR (CALL_EXPR_ARG (t
, i
)));
11566 /* Expand the pack expansion and push each entry onto
11568 arg
= tsubst_pack_expansion (arg
, args
, complain
, in_decl
);
11569 if (TREE_CODE (arg
) == TREE_VEC
)
11571 unsigned int len
, j
;
11573 len
= TREE_VEC_LENGTH (arg
);
11574 for (j
= 0; j
< len
; ++j
)
11576 tree value
= TREE_VEC_ELT (arg
, j
);
11577 if (value
!= NULL_TREE
)
11578 value
= convert_from_reference (value
);
11579 VEC_safe_push (tree
, gc
, call_args
, value
);
11584 /* A partial substitution. Add one entry. */
11585 VEC_safe_push (tree
, gc
, call_args
, arg
);
11590 /* We do not perform argument-dependent lookup if normal
11591 lookup finds a non-function, in accordance with the
11592 expected resolution of DR 218. */
11594 && ((is_overloaded_fn (function
)
11595 /* If lookup found a member function, the Koenig lookup is
11596 not appropriate, even if an unqualified-name was used
11597 to denote the function. */
11598 && !DECL_FUNCTION_MEMBER_P (get_first_fn (function
)))
11599 || TREE_CODE (function
) == IDENTIFIER_NODE
)
11600 /* Only do this when substitution turns a dependent call
11601 into a non-dependent call. */
11602 && type_dependent_expression_p_push (t
)
11603 && !any_type_dependent_arguments_p (call_args
))
11604 function
= perform_koenig_lookup (function
, call_args
);
11606 if (TREE_CODE (function
) == IDENTIFIER_NODE
)
11608 unqualified_name_lookup_error (function
);
11609 release_tree_vector (call_args
);
11610 return error_mark_node
;
11613 /* Remember that there was a reference to this entity. */
11614 if (DECL_P (function
))
11615 mark_used (function
);
11617 if (TREE_CODE (function
) == OFFSET_REF
)
11618 ret
= build_offset_ref_call_from_tree (function
, &call_args
);
11619 else if (TREE_CODE (function
) == COMPONENT_REF
)
11621 if (!BASELINK_P (TREE_OPERAND (function
, 1)))
11622 ret
= finish_call_expr (function
, &call_args
,
11623 /*disallow_virtual=*/false,
11624 /*koenig_p=*/false,
11627 ret
= (build_new_method_call
11628 (TREE_OPERAND (function
, 0),
11629 TREE_OPERAND (function
, 1),
11630 &call_args
, NULL_TREE
,
11631 qualified_p
? LOOKUP_NONVIRTUAL
: LOOKUP_NORMAL
,
11636 ret
= finish_call_expr (function
, &call_args
,
11637 /*disallow_virtual=*/qualified_p
,
11641 release_tree_vector (call_args
);
11647 return build_x_conditional_expr
11648 (RECUR (TREE_OPERAND (t
, 0)),
11649 RECUR (TREE_OPERAND (t
, 1)),
11650 RECUR (TREE_OPERAND (t
, 2)),
11653 case PSEUDO_DTOR_EXPR
:
11654 return finish_pseudo_destructor_expr
11655 (RECUR (TREE_OPERAND (t
, 0)),
11656 RECUR (TREE_OPERAND (t
, 1)),
11657 RECUR (TREE_OPERAND (t
, 2)));
11661 tree purpose
, value
, chain
;
11663 if (t
== void_list_node
)
11666 if ((TREE_PURPOSE (t
) && PACK_EXPANSION_P (TREE_PURPOSE (t
)))
11667 || (TREE_VALUE (t
) && PACK_EXPANSION_P (TREE_VALUE (t
))))
11669 /* We have pack expansions, so expand those and
11670 create a new list out of it. */
11671 tree purposevec
= NULL_TREE
;
11672 tree valuevec
= NULL_TREE
;
11676 /* Expand the argument expressions. */
11677 if (TREE_PURPOSE (t
))
11678 purposevec
= tsubst_pack_expansion (TREE_PURPOSE (t
), args
,
11679 complain
, in_decl
);
11680 if (TREE_VALUE (t
))
11681 valuevec
= tsubst_pack_expansion (TREE_VALUE (t
), args
,
11682 complain
, in_decl
);
11684 /* Build the rest of the list. */
11685 chain
= TREE_CHAIN (t
);
11686 if (chain
&& chain
!= void_type_node
)
11687 chain
= RECUR (chain
);
11689 /* Determine the number of arguments. */
11690 if (purposevec
&& TREE_CODE (purposevec
) == TREE_VEC
)
11692 len
= TREE_VEC_LENGTH (purposevec
);
11693 gcc_assert (!valuevec
|| len
== TREE_VEC_LENGTH (valuevec
));
11695 else if (TREE_CODE (valuevec
) == TREE_VEC
)
11696 len
= TREE_VEC_LENGTH (valuevec
);
11699 /* Since we only performed a partial substitution into
11700 the argument pack, we only return a single list
11702 if (purposevec
== TREE_PURPOSE (t
)
11703 && valuevec
== TREE_VALUE (t
)
11704 && chain
== TREE_CHAIN (t
))
11707 return tree_cons (purposevec
, valuevec
, chain
);
11710 /* Convert the argument vectors into a TREE_LIST */
11714 /* Grab the Ith values. */
11716 purpose
= purposevec
? TREE_VEC_ELT (purposevec
, i
)
11719 = valuevec
? convert_from_reference (TREE_VEC_ELT (valuevec
, i
))
11722 /* Build the list (backwards). */
11723 chain
= tree_cons (purpose
, value
, chain
);
11729 purpose
= TREE_PURPOSE (t
);
11731 purpose
= RECUR (purpose
);
11732 value
= TREE_VALUE (t
);
11734 value
= RECUR (value
);
11735 chain
= TREE_CHAIN (t
);
11736 if (chain
&& chain
!= void_type_node
)
11737 chain
= RECUR (chain
);
11738 if (purpose
== TREE_PURPOSE (t
)
11739 && value
== TREE_VALUE (t
)
11740 && chain
== TREE_CHAIN (t
))
11742 return tree_cons (purpose
, value
, chain
);
11745 case COMPONENT_REF
:
11751 object
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
11752 args
, complain
, in_decl
);
11753 /* Remember that there was a reference to this entity. */
11754 if (DECL_P (object
))
11755 mark_used (object
);
11756 object_type
= TREE_TYPE (object
);
11758 member
= TREE_OPERAND (t
, 1);
11759 if (BASELINK_P (member
))
11760 member
= tsubst_baselink (member
,
11761 non_reference (TREE_TYPE (object
)),
11762 args
, complain
, in_decl
);
11764 member
= tsubst_copy (member
, args
, complain
, in_decl
);
11765 if (member
== error_mark_node
)
11766 return error_mark_node
;
11768 if (object_type
&& !CLASS_TYPE_P (object_type
))
11770 if (SCALAR_TYPE_P (object_type
))
11772 tree s
= NULL_TREE
;
11773 tree dtor
= member
;
11775 if (TREE_CODE (dtor
) == SCOPE_REF
)
11777 s
= TREE_OPERAND (dtor
, 0);
11778 dtor
= TREE_OPERAND (dtor
, 1);
11780 if (TREE_CODE (dtor
) == BIT_NOT_EXPR
)
11782 dtor
= TREE_OPERAND (dtor
, 0);
11784 return finish_pseudo_destructor_expr (object
, s
, dtor
);
11788 else if (TREE_CODE (member
) == SCOPE_REF
11789 && TREE_CODE (TREE_OPERAND (member
, 1)) == TEMPLATE_ID_EXPR
)
11794 /* Lookup the template functions now that we know what the
11796 tmpl
= TREE_OPERAND (TREE_OPERAND (member
, 1), 0);
11797 args
= TREE_OPERAND (TREE_OPERAND (member
, 1), 1);
11798 member
= lookup_qualified_name (TREE_OPERAND (member
, 0), tmpl
,
11799 /*is_type_p=*/false,
11800 /*complain=*/false);
11801 if (BASELINK_P (member
))
11803 BASELINK_FUNCTIONS (member
)
11804 = build_nt (TEMPLATE_ID_EXPR
, BASELINK_FUNCTIONS (member
),
11806 member
= (adjust_result_of_qualified_name_lookup
11807 (member
, BINFO_TYPE (BASELINK_BINFO (member
)),
11812 qualified_name_lookup_error (object_type
, tmpl
, member
,
11814 return error_mark_node
;
11817 else if (TREE_CODE (member
) == SCOPE_REF
11818 && !CLASS_TYPE_P (TREE_OPERAND (member
, 0))
11819 && TREE_CODE (TREE_OPERAND (member
, 0)) != NAMESPACE_DECL
)
11821 if (complain
& tf_error
)
11823 if (TYPE_P (TREE_OPERAND (member
, 0)))
11824 error ("%qT is not a class or namespace",
11825 TREE_OPERAND (member
, 0));
11827 error ("%qD is not a class or namespace",
11828 TREE_OPERAND (member
, 0));
11830 return error_mark_node
;
11832 else if (TREE_CODE (member
) == FIELD_DECL
)
11833 return finish_non_static_data_member (member
, object
, NULL_TREE
);
11835 return finish_class_member_access_expr (object
, member
,
11836 /*template_p=*/false,
11842 (RECUR (TREE_OPERAND (t
, 0)));
11846 VEC(constructor_elt
,gc
) *n
;
11847 constructor_elt
*ce
;
11848 unsigned HOST_WIDE_INT idx
;
11849 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11850 bool process_index_p
;
11852 bool need_copy_p
= false;
11855 if (type
== error_mark_node
)
11856 return error_mark_node
;
11858 /* digest_init will do the wrong thing if we let it. */
11859 if (type
&& TYPE_PTRMEMFUNC_P (type
))
11862 /* We do not want to process the index of aggregate
11863 initializers as they are identifier nodes which will be
11864 looked up by digest_init. */
11865 process_index_p
= !(type
&& MAYBE_CLASS_TYPE_P (type
));
11867 n
= VEC_copy (constructor_elt
, gc
, CONSTRUCTOR_ELTS (t
));
11868 newlen
= VEC_length (constructor_elt
, n
);
11869 for (idx
= 0; VEC_iterate (constructor_elt
, n
, idx
, ce
); idx
++)
11871 if (ce
->index
&& process_index_p
)
11872 ce
->index
= RECUR (ce
->index
);
11874 if (PACK_EXPANSION_P (ce
->value
))
11876 /* Substitute into the pack expansion. */
11877 ce
->value
= tsubst_pack_expansion (ce
->value
, args
, complain
,
11880 if (ce
->value
== error_mark_node
)
11882 else if (TREE_VEC_LENGTH (ce
->value
) == 1)
11883 /* Just move the argument into place. */
11884 ce
->value
= TREE_VEC_ELT (ce
->value
, 0);
11887 /* Update the length of the final CONSTRUCTOR
11888 arguments vector, and note that we will need to
11890 newlen
= newlen
+ TREE_VEC_LENGTH (ce
->value
) - 1;
11891 need_copy_p
= true;
11895 ce
->value
= RECUR (ce
->value
);
11900 VEC(constructor_elt
,gc
) *old_n
= n
;
11902 n
= VEC_alloc (constructor_elt
, gc
, newlen
);
11903 for (idx
= 0; VEC_iterate (constructor_elt
, old_n
, idx
, ce
);
11906 if (TREE_CODE (ce
->value
) == TREE_VEC
)
11908 int i
, len
= TREE_VEC_LENGTH (ce
->value
);
11909 for (i
= 0; i
< len
; ++i
)
11910 CONSTRUCTOR_APPEND_ELT (n
, 0,
11911 TREE_VEC_ELT (ce
->value
, i
));
11914 CONSTRUCTOR_APPEND_ELT (n
, 0, ce
->value
);
11918 r
= build_constructor (init_list_type_node
, n
);
11919 CONSTRUCTOR_IS_DIRECT_INIT (r
) = CONSTRUCTOR_IS_DIRECT_INIT (t
);
11921 if (TREE_HAS_CONSTRUCTOR (t
))
11922 return finish_compound_literal (type
, r
);
11929 tree operand_0
= RECUR (TREE_OPERAND (t
, 0));
11930 if (TYPE_P (operand_0
))
11931 return get_typeid (operand_0
);
11932 return build_typeid (operand_0
);
11942 tree r
= tsubst_copy (t
, args
, complain
, in_decl
);
11944 if (TREE_CODE (TREE_TYPE (t
)) != REFERENCE_TYPE
)
11945 /* If the original type was a reference, we'll be wrapped in
11946 the appropriate INDIRECT_REF. */
11947 r
= convert_from_reference (r
);
11952 return build_x_va_arg (RECUR (TREE_OPERAND (t
, 0)),
11953 tsubst_copy (TREE_TYPE (t
), args
, complain
,
11956 case OFFSETOF_EXPR
:
11957 return finish_offsetof (RECUR (TREE_OPERAND (t
, 0)));
11961 tree type1
= tsubst_copy (TRAIT_EXPR_TYPE1 (t
), args
,
11962 complain
, in_decl
);
11964 tree type2
= TRAIT_EXPR_TYPE2 (t
);
11966 type2
= tsubst_copy (type2
, args
, complain
, in_decl
);
11968 return finish_trait_expr (TRAIT_EXPR_KIND (t
), type1
, type2
);
11973 tree old_stmt_expr
= cur_stmt_expr
;
11974 tree stmt_expr
= begin_stmt_expr ();
11976 cur_stmt_expr
= stmt_expr
;
11977 tsubst_expr (STMT_EXPR_STMT (t
), args
, complain
, in_decl
,
11978 integral_constant_expression_p
);
11979 stmt_expr
= finish_stmt_expr (stmt_expr
, false);
11980 cur_stmt_expr
= old_stmt_expr
;
11986 t
= tsubst_copy (t
, args
, complain
, in_decl
);
11987 /* As in finish_id_expression, we resolve enumeration constants
11988 to their underlying values. */
11989 if (TREE_CODE (t
) == CONST_DECL
)
11991 used_types_insert (TREE_TYPE (t
));
11992 return DECL_INITIAL (t
);
11997 /* Handle Objective-C++ constructs, if appropriate. */
12000 = objcp_tsubst_copy_and_build (t
, args
, complain
,
12001 in_decl
, /*function_p=*/false);
12005 return tsubst_copy (t
, args
, complain
, in_decl
);
12011 /* Verify that the instantiated ARGS are valid. For type arguments,
12012 make sure that the type's linkage is ok. For non-type arguments,
12013 make sure they are constants if they are integral or enumerations.
12014 Emit an error under control of COMPLAIN, and return TRUE on error. */
12017 check_instantiated_arg (tree tmpl
, tree t
, tsubst_flags_t complain
)
12019 if (ARGUMENT_PACK_P (t
))
12021 tree vec
= ARGUMENT_PACK_ARGS (t
);
12022 int len
= TREE_VEC_LENGTH (vec
);
12023 bool result
= false;
12026 for (i
= 0; i
< len
; ++i
)
12027 if (check_instantiated_arg (tmpl
, TREE_VEC_ELT (vec
, i
), complain
))
12031 else if (TYPE_P (t
))
12033 /* [basic.link]: A name with no linkage (notably, the name
12034 of a class or enumeration declared in a local scope)
12035 shall not be used to declare an entity with linkage.
12036 This implies that names with no linkage cannot be used as
12037 template arguments. */
12038 tree nt
= no_linkage_check (t
, /*relaxed_p=*/false);
12042 /* DR 488 makes use of a type with no linkage cause
12043 type deduction to fail. */
12044 if (complain
& tf_error
)
12046 if (TYPE_ANONYMOUS_P (nt
))
12047 error ("%qT is/uses anonymous type", t
);
12049 error ("template argument for %qD uses local type %qT",
12054 /* In order to avoid all sorts of complications, we do not
12055 allow variably-modified types as template arguments. */
12056 else if (variably_modified_type_p (t
, NULL_TREE
))
12058 if (complain
& tf_error
)
12059 error ("%qT is a variably modified type", t
);
12063 /* A non-type argument of integral or enumerated type must be a
12065 else if (TREE_TYPE (t
)
12066 && INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (t
))
12067 && !TREE_CONSTANT (t
))
12069 if (complain
& tf_error
)
12070 error ("integral expression %qE is not constant", t
);
12077 check_instantiated_args (tree tmpl
, tree args
, tsubst_flags_t complain
)
12079 int ix
, len
= DECL_NTPARMS (tmpl
);
12080 bool result
= false;
12082 for (ix
= 0; ix
!= len
; ix
++)
12084 if (check_instantiated_arg (tmpl
, TREE_VEC_ELT (args
, ix
), complain
))
12087 if (result
&& (complain
& tf_error
))
12088 error (" trying to instantiate %qD", tmpl
);
12092 /* Instantiate the indicated variable or function template TMPL with
12093 the template arguments in TARG_PTR. */
12096 instantiate_template (tree tmpl
, tree targ_ptr
, tsubst_flags_t complain
)
12101 HOST_WIDE_INT saved_processing_template_decl
;
12103 if (tmpl
== error_mark_node
)
12104 return error_mark_node
;
12106 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
);
12108 /* If this function is a clone, handle it specially. */
12109 if (DECL_CLONED_FUNCTION_P (tmpl
))
12114 spec
= instantiate_template (DECL_CLONED_FUNCTION (tmpl
), targ_ptr
,
12116 if (spec
== error_mark_node
)
12117 return error_mark_node
;
12119 /* Look for the clone. */
12120 FOR_EACH_CLONE (clone
, spec
)
12121 if (DECL_NAME (clone
) == DECL_NAME (tmpl
))
12123 /* We should always have found the clone by now. */
12124 gcc_unreachable ();
12128 /* Check to see if we already have this specialization. */
12129 spec
= retrieve_specialization (tmpl
, targ_ptr
,
12130 /*class_specializations_p=*/false);
12131 if (spec
!= NULL_TREE
)
12134 gen_tmpl
= most_general_template (tmpl
);
12135 if (tmpl
!= gen_tmpl
)
12137 /* The TMPL is a partial instantiation. To get a full set of
12138 arguments we must add the arguments used to perform the
12139 partial instantiation. */
12140 targ_ptr
= add_outermost_template_args (DECL_TI_ARGS (tmpl
),
12143 /* Check to see if we already have this specialization. */
12144 spec
= retrieve_specialization (gen_tmpl
, targ_ptr
,
12145 /*class_specializations_p=*/false);
12146 if (spec
!= NULL_TREE
)
12150 if (check_instantiated_args (gen_tmpl
, INNERMOST_TEMPLATE_ARGS (targ_ptr
),
12152 return error_mark_node
;
12154 /* We are building a FUNCTION_DECL, during which the access of its
12155 parameters and return types have to be checked. However this
12156 FUNCTION_DECL which is the desired context for access checking
12157 is not built yet. We solve this chicken-and-egg problem by
12158 deferring all checks until we have the FUNCTION_DECL. */
12159 push_deferring_access_checks (dk_deferred
);
12161 /* Although PROCESSING_TEMPLATE_DECL may be true at this point
12162 (because, for example, we have encountered a non-dependent
12163 function call in the body of a template function and must now
12164 determine which of several overloaded functions will be called),
12165 within the instantiation itself we are not processing a
12167 saved_processing_template_decl
= processing_template_decl
;
12168 processing_template_decl
= 0;
12169 /* Substitute template parameters to obtain the specialization. */
12170 fndecl
= tsubst (DECL_TEMPLATE_RESULT (gen_tmpl
),
12171 targ_ptr
, complain
, gen_tmpl
);
12172 processing_template_decl
= saved_processing_template_decl
;
12173 if (fndecl
== error_mark_node
)
12174 return error_mark_node
;
12176 /* Now we know the specialization, compute access previously
12178 push_access_scope (fndecl
);
12180 /* Some typedefs referenced from within the template code need to be access
12181 checked at template instantiation time, i.e now. These types were
12182 added to the template at parsing time. Let's get those and perfom
12183 the acces checks then. */
12184 perform_typedefs_access_check (DECL_TEMPLATE_RESULT (tmpl
), targ_ptr
);
12185 perform_deferred_access_checks ();
12186 pop_access_scope (fndecl
);
12187 pop_deferring_access_checks ();
12189 /* The DECL_TI_TEMPLATE should always be the immediate parent
12190 template, not the most general template. */
12191 DECL_TI_TEMPLATE (fndecl
) = tmpl
;
12193 /* If we've just instantiated the main entry point for a function,
12194 instantiate all the alternate entry points as well. We do this
12195 by cloning the instantiation of the main entry point, not by
12196 instantiating the template clones. */
12197 if (TREE_CHAIN (gen_tmpl
) && DECL_CLONED_FUNCTION_P (TREE_CHAIN (gen_tmpl
)))
12198 clone_function_decl (fndecl
, /*update_method_vec_p=*/0);
12203 /* The FN is a TEMPLATE_DECL for a function. ARGS is an array with
12204 NARGS elements of the arguments that are being used when calling
12205 it. TARGS is a vector into which the deduced template arguments
12208 Return zero for success, 2 for an incomplete match that doesn't resolve
12209 all the types, and 1 for complete failure. An error message will be
12210 printed only for an incomplete match.
12212 If FN is a conversion operator, or we are trying to produce a specific
12213 specialization, RETURN_TYPE is the return type desired.
12215 The EXPLICIT_TARGS are explicit template arguments provided via a
12218 The parameter STRICT is one of:
12221 We are deducing arguments for a function call, as in
12222 [temp.deduct.call].
12225 We are deducing arguments for a conversion function, as in
12226 [temp.deduct.conv].
12229 We are deducing arguments when doing an explicit instantiation
12230 as in [temp.explicit], when determining an explicit specialization
12231 as in [temp.expl.spec], or when taking the address of a function
12232 template, as in [temp.deduct.funcaddr]. */
12235 fn_type_unification (tree fn
,
12236 tree explicit_targs
,
12239 unsigned int nargs
,
12241 unification_kind_t strict
,
12247 bool incomplete_argument_packs_p
= false;
12249 gcc_assert (TREE_CODE (fn
) == TEMPLATE_DECL
);
12251 fntype
= TREE_TYPE (fn
);
12252 if (explicit_targs
)
12256 The specified template arguments must match the template
12257 parameters in kind (i.e., type, nontype, template), and there
12258 must not be more arguments than there are parameters;
12259 otherwise type deduction fails.
12261 Nontype arguments must match the types of the corresponding
12262 nontype template parameters, or must be convertible to the
12263 types of the corresponding nontype parameters as specified in
12264 _temp.arg.nontype_, otherwise type deduction fails.
12266 All references in the function type of the function template
12267 to the corresponding template parameters are replaced by the
12268 specified template argument values. If a substitution in a
12269 template parameter or in the function type of the function
12270 template results in an invalid type, type deduction fails. */
12271 tree tparms
= DECL_INNERMOST_TEMPLATE_PARMS (fn
);
12272 int i
, len
= TREE_VEC_LENGTH (tparms
);
12273 tree converted_args
;
12274 bool incomplete
= false;
12276 if (explicit_targs
== error_mark_node
)
12280 = (coerce_template_parms (tparms
, explicit_targs
, NULL_TREE
, tf_none
,
12281 /*require_all_args=*/false,
12282 /*use_default_args=*/false));
12283 if (converted_args
== error_mark_node
)
12286 /* Substitute the explicit args into the function type. This is
12287 necessary so that, for instance, explicitly declared function
12288 arguments can match null pointed constants. If we were given
12289 an incomplete set of explicit args, we must not do semantic
12290 processing during substitution as we could create partial
12292 for (i
= 0; i
< len
; i
++)
12294 tree parm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
12295 bool parameter_pack
= false;
12297 /* Dig out the actual parm. */
12298 if (TREE_CODE (parm
) == TYPE_DECL
12299 || TREE_CODE (parm
) == TEMPLATE_DECL
)
12301 parm
= TREE_TYPE (parm
);
12302 parameter_pack
= TEMPLATE_TYPE_PARAMETER_PACK (parm
);
12304 else if (TREE_CODE (parm
) == PARM_DECL
)
12306 parm
= DECL_INITIAL (parm
);
12307 parameter_pack
= TEMPLATE_PARM_PARAMETER_PACK (parm
);
12310 if (parameter_pack
)
12314 template_parm_level_and_index (parm
, &level
, &idx
);
12316 /* Mark the argument pack as "incomplete". We could
12317 still deduce more arguments during unification. */
12318 targ
= TMPL_ARG (converted_args
, level
, idx
);
12321 ARGUMENT_PACK_INCOMPLETE_P(targ
) = 1;
12322 ARGUMENT_PACK_EXPLICIT_ARGS (targ
)
12323 = ARGUMENT_PACK_ARGS (targ
);
12326 /* We have some incomplete argument packs. */
12327 incomplete_argument_packs_p
= true;
12331 if (incomplete_argument_packs_p
)
12332 /* Any substitution is guaranteed to be incomplete if there
12333 are incomplete argument packs, because we can still deduce
12337 incomplete
= NUM_TMPL_ARGS (explicit_targs
) != NUM_TMPL_ARGS (targs
);
12339 processing_template_decl
+= incomplete
;
12340 fntype
= tsubst (fntype
, converted_args
, tf_none
, NULL_TREE
);
12341 processing_template_decl
-= incomplete
;
12343 if (fntype
== error_mark_node
)
12346 /* Place the explicitly specified arguments in TARGS. */
12347 for (i
= NUM_TMPL_ARGS (converted_args
); i
--;)
12348 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (converted_args
, i
);
12351 /* Never do unification on the 'this' parameter. */
12352 parms
= skip_artificial_parms_for (fn
, TYPE_ARG_TYPES (fntype
));
12358 parms
= tree_cons (NULL_TREE
, TREE_TYPE (fntype
), parms
);
12359 new_args
= XALLOCAVEC (tree
, nargs
+ 1);
12360 new_args
[0] = return_type
;
12361 memcpy (new_args
+ 1, args
, nargs
* sizeof (tree
));
12366 /* We allow incomplete unification without an error message here
12367 because the standard doesn't seem to explicitly prohibit it. Our
12368 callers must be ready to deal with unification failures in any
12370 result
= type_unification_real (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
12371 targs
, parms
, args
, nargs
, /*subr=*/0,
12374 if (result
== 0 && incomplete_argument_packs_p
)
12376 int i
, len
= NUM_TMPL_ARGS (targs
);
12378 /* Clear the "incomplete" flags on all argument packs. */
12379 for (i
= 0; i
< len
; i
++)
12381 tree arg
= TREE_VEC_ELT (targs
, i
);
12382 if (ARGUMENT_PACK_P (arg
))
12384 ARGUMENT_PACK_INCOMPLETE_P (arg
) = 0;
12385 ARGUMENT_PACK_EXPLICIT_ARGS (arg
) = NULL_TREE
;
12390 /* Now that we have bindings for all of the template arguments,
12391 ensure that the arguments deduced for the template template
12392 parameters have compatible template parameter lists. We cannot
12393 check this property before we have deduced all template
12394 arguments, because the template parameter types of a template
12395 template parameter might depend on prior template parameters
12396 deduced after the template template parameter. The following
12397 ill-formed example illustrates this issue:
12399 template<typename T, template<T> class C> void f(C<5>, T);
12401 template<int N> struct X {};
12404 f(X<5>(), 5l); // error: template argument deduction fails
12407 The template parameter list of 'C' depends on the template type
12408 parameter 'T', but 'C' is deduced to 'X' before 'T' is deduced to
12409 'long'. Thus, we can't check that 'C' cannot bind to 'X' at the
12410 time that we deduce 'C'. */
12412 && !template_template_parm_bindings_ok_p
12413 (DECL_INNERMOST_TEMPLATE_PARMS (fn
), targs
))
12417 /* All is well so far. Now, check:
12421 When all template arguments have been deduced, all uses of
12422 template parameters in nondeduced contexts are replaced with
12423 the corresponding deduced argument values. If the
12424 substitution results in an invalid type, as described above,
12425 type deduction fails. */
12427 tree substed
= tsubst (TREE_TYPE (fn
), targs
, tf_none
, NULL_TREE
);
12428 if (substed
== error_mark_node
)
12431 /* If we're looking for an exact match, check that what we got
12432 is indeed an exact match. It might not be if some template
12433 parameters are used in non-deduced contexts. */
12434 if (strict
== DEDUCE_EXACT
)
12439 = skip_artificial_parms_for (fn
, TYPE_ARG_TYPES (substed
));
12441 sarg
= tree_cons (NULL_TREE
, TREE_TYPE (substed
), sarg
);
12442 for (i
= 0; i
< nargs
&& sarg
; ++i
, sarg
= TREE_CHAIN (sarg
))
12443 if (!same_type_p (args
[i
], TREE_VALUE (sarg
)))
12451 /* Adjust types before performing type deduction, as described in
12452 [temp.deduct.call] and [temp.deduct.conv]. The rules in these two
12453 sections are symmetric. PARM is the type of a function parameter
12454 or the return type of the conversion function. ARG is the type of
12455 the argument passed to the call, or the type of the value
12456 initialized with the result of the conversion function.
12457 ARG_EXPR is the original argument expression, which may be null. */
12460 maybe_adjust_types_for_deduction (unification_kind_t strict
,
12474 /* Swap PARM and ARG throughout the remainder of this
12475 function; the handling is precisely symmetric since PARM
12476 will initialize ARG rather than vice versa. */
12484 /* There is nothing to do in this case. */
12488 gcc_unreachable ();
12491 if (TREE_CODE (*parm
) != REFERENCE_TYPE
)
12493 /* [temp.deduct.call]
12495 If P is not a reference type:
12497 --If A is an array type, the pointer type produced by the
12498 array-to-pointer standard conversion (_conv.array_) is
12499 used in place of A for type deduction; otherwise,
12501 --If A is a function type, the pointer type produced by
12502 the function-to-pointer standard conversion
12503 (_conv.func_) is used in place of A for type deduction;
12506 --If A is a cv-qualified type, the top level
12507 cv-qualifiers of A's type are ignored for type
12509 if (TREE_CODE (*arg
) == ARRAY_TYPE
)
12510 *arg
= build_pointer_type (TREE_TYPE (*arg
));
12511 else if (TREE_CODE (*arg
) == FUNCTION_TYPE
)
12512 *arg
= build_pointer_type (*arg
);
12514 *arg
= TYPE_MAIN_VARIANT (*arg
);
12517 /* From C++0x [14.8.2.1/3 temp.deduct.call] (after DR606), "If P is
12518 of the form T&&, where T is a template parameter, and the argument
12519 is an lvalue, T is deduced as A& */
12520 if (TREE_CODE (*parm
) == REFERENCE_TYPE
12521 && TYPE_REF_IS_RVALUE (*parm
)
12522 && TREE_CODE (TREE_TYPE (*parm
)) == TEMPLATE_TYPE_PARM
12523 && cp_type_quals (TREE_TYPE (*parm
)) == TYPE_UNQUALIFIED
12524 && arg_expr
&& real_lvalue_p (arg_expr
))
12525 *arg
= build_reference_type (*arg
);
12527 /* [temp.deduct.call]
12529 If P is a cv-qualified type, the top level cv-qualifiers
12530 of P's type are ignored for type deduction. If P is a
12531 reference type, the type referred to by P is used for
12533 *parm
= TYPE_MAIN_VARIANT (*parm
);
12534 if (TREE_CODE (*parm
) == REFERENCE_TYPE
)
12536 *parm
= TREE_TYPE (*parm
);
12537 result
|= UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
12540 /* DR 322. For conversion deduction, remove a reference type on parm
12541 too (which has been swapped into ARG). */
12542 if (strict
== DEDUCE_CONV
&& TREE_CODE (*arg
) == REFERENCE_TYPE
)
12543 *arg
= TREE_TYPE (*arg
);
12548 /* Most parms like fn_type_unification.
12550 If SUBR is 1, we're being called recursively (to unify the
12551 arguments of a function or method parameter of a function
12555 type_unification_real (tree tparms
,
12559 unsigned int xnargs
,
12561 unification_kind_t strict
,
12564 tree parm
, arg
, arg_expr
;
12566 int ntparms
= TREE_VEC_LENGTH (tparms
);
12568 int saw_undeduced
= 0;
12571 unsigned int nargs
;
12574 gcc_assert (TREE_CODE (tparms
) == TREE_VEC
);
12575 gcc_assert (xparms
== NULL_TREE
|| TREE_CODE (xparms
) == TREE_LIST
);
12576 gcc_assert (ntparms
> 0);
12581 sub_strict
= (UNIFY_ALLOW_OUTER_LEVEL
| UNIFY_ALLOW_MORE_CV_QUAL
12582 | UNIFY_ALLOW_DERIVED
);
12586 sub_strict
= UNIFY_ALLOW_LESS_CV_QUAL
;
12590 sub_strict
= UNIFY_ALLOW_NONE
;
12594 gcc_unreachable ();
12603 while (parms
&& parms
!= void_list_node
12606 if (TREE_CODE (TREE_VALUE (parms
)) == TYPE_PACK_EXPANSION
)
12609 parm
= TREE_VALUE (parms
);
12610 parms
= TREE_CHAIN (parms
);
12615 if (arg
== error_mark_node
)
12617 if (arg
== unknown_type_node
)
12618 /* We can't deduce anything from this, but we might get all the
12619 template args from other function args. */
12622 /* Conversions will be performed on a function argument that
12623 corresponds with a function parameter that contains only
12624 non-deducible template parameters and explicitly specified
12625 template parameters. */
12626 if (!uses_template_parms (parm
))
12631 type
= TREE_TYPE (arg
);
12635 if (same_type_p (parm
, type
))
12637 if (strict
!= DEDUCE_EXACT
12638 && can_convert_arg (parm
, type
, TYPE_P (arg
) ? NULL_TREE
: arg
,
12647 gcc_assert (TREE_TYPE (arg
) != NULL_TREE
);
12648 if (type_unknown_p (arg
))
12650 /* [temp.deduct.type]
12652 A template-argument can be deduced from a pointer to
12653 function or pointer to member function argument if
12654 the set of overloaded functions does not contain
12655 function templates and at most one of a set of
12656 overloaded functions provides a unique match. */
12657 if (resolve_overloaded_unification
12658 (tparms
, targs
, parm
, arg
, strict
, sub_strict
))
12664 arg
= unlowered_expr_type (arg
);
12665 if (arg
== error_mark_node
)
12670 int arg_strict
= sub_strict
;
12673 arg_strict
|= maybe_adjust_types_for_deduction (strict
, &parm
, &arg
,
12676 if (arg
== init_list_type_node
&& arg_expr
)
12678 if (unify (tparms
, targs
, parm
, arg
, arg_strict
))
12685 && parms
!= void_list_node
12686 && TREE_CODE (TREE_VALUE (parms
)) == TYPE_PACK_EXPANSION
)
12688 /* Unify the remaining arguments with the pack expansion type. */
12690 tree parmvec
= make_tree_vec (1);
12692 /* Allocate a TREE_VEC and copy in all of the arguments */
12693 argvec
= make_tree_vec (nargs
- ia
);
12694 for (i
= 0; ia
< nargs
; ++ia
, ++i
)
12695 TREE_VEC_ELT (argvec
, i
) = args
[ia
];
12697 /* Copy the parameter into parmvec. */
12698 TREE_VEC_ELT (parmvec
, 0) = TREE_VALUE (parms
);
12699 if (unify_pack_expansion (tparms
, targs
, parmvec
, argvec
, strict
,
12700 /*call_args_p=*/true, /*subr=*/subr
))
12703 /* Advance to the end of the list of parameters. */
12704 parms
= TREE_CHAIN (parms
);
12707 /* Fail if we've reached the end of the parm list, and more args
12708 are present, and the parm list isn't variadic. */
12709 if (ia
< nargs
&& parms
== void_list_node
)
12711 /* Fail if parms are left and they don't have default values. */
12712 if (parms
&& parms
!= void_list_node
12713 && TREE_PURPOSE (parms
) == NULL_TREE
)
12717 for (i
= 0; i
< ntparms
; i
++)
12718 if (!TREE_VEC_ELT (targs
, i
))
12722 if (TREE_VEC_ELT (tparms
, i
) == error_mark_node
)
12725 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
12727 /* If this is an undeduced nontype parameter that depends on
12728 a type parameter, try another pass; its type may have been
12729 deduced from a later argument than the one from which
12730 this parameter can be deduced. */
12731 if (TREE_CODE (tparm
) == PARM_DECL
12732 && uses_template_parms (TREE_TYPE (tparm
))
12733 && !saw_undeduced
++)
12736 /* Core issue #226 (C++0x) [temp.deduct]:
12738 If a template argument has not been deduced, its
12739 default template argument, if any, is used.
12741 When we are in C++98 mode, TREE_PURPOSE will either
12742 be NULL_TREE or ERROR_MARK_NODE, so we do not need
12743 to explicitly check cxx_dialect here. */
12744 if (TREE_PURPOSE (TREE_VEC_ELT (tparms
, i
)))
12746 tree arg
= tsubst (TREE_PURPOSE (TREE_VEC_ELT (tparms
, i
)),
12747 targs
, tf_none
, NULL_TREE
);
12748 if (arg
== error_mark_node
)
12752 TREE_VEC_ELT (targs
, i
) = arg
;
12757 /* If the type parameter is a parameter pack, then it will
12758 be deduced to an empty parameter pack. */
12759 if (template_parameter_pack_p (tparm
))
12763 if (TREE_CODE (tparm
) == TEMPLATE_PARM_INDEX
)
12765 arg
= make_node (NONTYPE_ARGUMENT_PACK
);
12766 TREE_TYPE (arg
) = TREE_TYPE (TEMPLATE_PARM_DECL (tparm
));
12767 TREE_CONSTANT (arg
) = 1;
12770 arg
= make_node (TYPE_ARGUMENT_PACK
);
12772 SET_ARGUMENT_PACK_ARGS (arg
, make_tree_vec (0));
12774 TREE_VEC_ELT (targs
, i
) = arg
;
12784 /* Subroutine of type_unification_real. Args are like the variables
12785 at the call site. ARG is an overloaded function (or template-id);
12786 we try deducing template args from each of the overloads, and if
12787 only one succeeds, we go with that. Modifies TARGS and returns
12788 true on success. */
12791 resolve_overloaded_unification (tree tparms
,
12795 unification_kind_t strict
,
12798 tree tempargs
= copy_node (targs
);
12800 tree goodfn
= NULL_TREE
;
12803 if (TREE_CODE (arg
) == ADDR_EXPR
)
12805 arg
= TREE_OPERAND (arg
, 0);
12811 if (TREE_CODE (arg
) == COMPONENT_REF
)
12812 /* Handle `&x' where `x' is some static or non-static member
12814 arg
= TREE_OPERAND (arg
, 1);
12816 if (TREE_CODE (arg
) == OFFSET_REF
)
12817 arg
= TREE_OPERAND (arg
, 1);
12819 /* Strip baselink information. */
12820 if (BASELINK_P (arg
))
12821 arg
= BASELINK_FUNCTIONS (arg
);
12823 if (TREE_CODE (arg
) == TEMPLATE_ID_EXPR
)
12825 /* If we got some explicit template args, we need to plug them into
12826 the affected templates before we try to unify, in case the
12827 explicit args will completely resolve the templates in question. */
12829 tree expl_subargs
= TREE_OPERAND (arg
, 1);
12830 arg
= TREE_OPERAND (arg
, 0);
12832 for (; arg
; arg
= OVL_NEXT (arg
))
12834 tree fn
= OVL_CURRENT (arg
);
12835 tree subargs
, elem
;
12837 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
12840 ++processing_template_decl
;
12841 subargs
= get_bindings (fn
, DECL_TEMPLATE_RESULT (fn
),
12842 expl_subargs
, /*check_ret=*/false);
12845 elem
= tsubst (TREE_TYPE (fn
), subargs
, tf_none
, NULL_TREE
);
12846 if (try_one_overload (tparms
, targs
, tempargs
, parm
,
12847 elem
, strict
, sub_strict
, addr_p
)
12848 && (!goodfn
|| !decls_match (goodfn
, elem
)))
12854 --processing_template_decl
;
12857 else if (TREE_CODE (arg
) != OVERLOAD
12858 && TREE_CODE (arg
) != FUNCTION_DECL
)
12859 /* If ARG is, for example, "(0, &f)" then its type will be unknown
12860 -- but the deduction does not succeed because the expression is
12861 not just the function on its own. */
12864 for (; arg
; arg
= OVL_NEXT (arg
))
12865 if (try_one_overload (tparms
, targs
, tempargs
, parm
,
12866 TREE_TYPE (OVL_CURRENT (arg
)),
12867 strict
, sub_strict
, addr_p
)
12868 && (!goodfn
|| !decls_match (goodfn
, OVL_CURRENT (arg
))))
12870 goodfn
= OVL_CURRENT (arg
);
12874 /* [temp.deduct.type] A template-argument can be deduced from a pointer
12875 to function or pointer to member function argument if the set of
12876 overloaded functions does not contain function templates and at most
12877 one of a set of overloaded functions provides a unique match.
12879 So if we found multiple possibilities, we return success but don't
12880 deduce anything. */
12884 int i
= TREE_VEC_LENGTH (targs
);
12886 if (TREE_VEC_ELT (tempargs
, i
))
12887 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (tempargs
, i
);
12895 /* Subroutine of resolve_overloaded_unification; does deduction for a single
12896 overload. Fills TARGS with any deduced arguments, or error_mark_node if
12897 different overloads deduce different arguments for a given parm.
12898 ADDR_P is true if the expression for which deduction is being
12899 performed was of the form "& fn" rather than simply "fn".
12901 Returns 1 on success. */
12904 try_one_overload (tree tparms
,
12909 unification_kind_t strict
,
12917 /* [temp.deduct.type] A template-argument can be deduced from a pointer
12918 to function or pointer to member function argument if the set of
12919 overloaded functions does not contain function templates and at most
12920 one of a set of overloaded functions provides a unique match.
12922 So if this is a template, just return success. */
12924 if (uses_template_parms (arg
))
12927 if (TREE_CODE (arg
) == METHOD_TYPE
)
12928 arg
= build_ptrmemfunc_type (build_pointer_type (arg
));
12930 arg
= build_pointer_type (arg
);
12932 sub_strict
|= maybe_adjust_types_for_deduction (strict
, &parm
, &arg
, NULL
);
12934 /* We don't copy orig_targs for this because if we have already deduced
12935 some template args from previous args, unify would complain when we
12936 try to deduce a template parameter for the same argument, even though
12937 there isn't really a conflict. */
12938 nargs
= TREE_VEC_LENGTH (targs
);
12939 tempargs
= make_tree_vec (nargs
);
12941 if (unify (tparms
, tempargs
, parm
, arg
, sub_strict
) != 0)
12944 /* First make sure we didn't deduce anything that conflicts with
12945 explicitly specified args. */
12946 for (i
= nargs
; i
--; )
12948 tree elt
= TREE_VEC_ELT (tempargs
, i
);
12949 tree oldelt
= TREE_VEC_ELT (orig_targs
, i
);
12953 else if (uses_template_parms (elt
))
12954 /* Since we're unifying against ourselves, we will fill in
12955 template args used in the function parm list with our own
12956 template parms. Discard them. */
12957 TREE_VEC_ELT (tempargs
, i
) = NULL_TREE
;
12958 else if (oldelt
&& !template_args_equal (oldelt
, elt
))
12962 for (i
= nargs
; i
--; )
12964 tree elt
= TREE_VEC_ELT (tempargs
, i
);
12967 TREE_VEC_ELT (targs
, i
) = elt
;
12973 /* PARM is a template class (perhaps with unbound template
12974 parameters). ARG is a fully instantiated type. If ARG can be
12975 bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and
12976 TARGS are as for unify. */
12979 try_class_unification (tree tparms
, tree targs
, tree parm
, tree arg
)
12981 tree copy_of_targs
;
12983 if (!CLASSTYPE_TEMPLATE_INFO (arg
)
12984 || (most_general_template (CLASSTYPE_TI_TEMPLATE (arg
))
12985 != most_general_template (CLASSTYPE_TI_TEMPLATE (parm
))))
12988 /* We need to make a new template argument vector for the call to
12989 unify. If we used TARGS, we'd clutter it up with the result of
12990 the attempted unification, even if this class didn't work out.
12991 We also don't want to commit ourselves to all the unifications
12992 we've already done, since unification is supposed to be done on
12993 an argument-by-argument basis. In other words, consider the
12994 following pathological case:
12996 template <int I, int J, int K>
12999 template <int I, int J>
13000 struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {};
13002 template <int I, int J, int K>
13003 void f(S<I, J, K>, S<I, I, I>);
13012 Now, by the time we consider the unification involving `s2', we
13013 already know that we must have `f<0, 0, 0>'. But, even though
13014 `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is invalid
13015 because there are two ways to unify base classes of S<0, 1, 2>
13016 with S<I, I, I>. If we kept the already deduced knowledge, we
13017 would reject the possibility I=1. */
13018 copy_of_targs
= make_tree_vec (TREE_VEC_LENGTH (targs
));
13020 /* If unification failed, we're done. */
13021 if (unify (tparms
, copy_of_targs
, CLASSTYPE_TI_ARGS (parm
),
13022 CLASSTYPE_TI_ARGS (arg
), UNIFY_ALLOW_NONE
))
13028 /* Given a template type PARM and a class type ARG, find the unique
13029 base type in ARG that is an instance of PARM. We do not examine
13030 ARG itself; only its base-classes. If there is not exactly one
13031 appropriate base class, return NULL_TREE. PARM may be the type of
13032 a partial specialization, as well as a plain template type. Used
13036 get_template_base (tree tparms
, tree targs
, tree parm
, tree arg
)
13038 tree rval
= NULL_TREE
;
13041 gcc_assert (RECORD_OR_UNION_CODE_P (TREE_CODE (arg
)));
13043 binfo
= TYPE_BINFO (complete_type (arg
));
13045 /* The type could not be completed. */
13048 /* Walk in inheritance graph order. The search order is not
13049 important, and this avoids multiple walks of virtual bases. */
13050 for (binfo
= TREE_CHAIN (binfo
); binfo
; binfo
= TREE_CHAIN (binfo
))
13052 tree r
= try_class_unification (tparms
, targs
, parm
, BINFO_TYPE (binfo
));
13056 /* If there is more than one satisfactory baseclass, then:
13060 If they yield more than one possible deduced A, the type
13064 if (rval
&& !same_type_p (r
, rval
))
13074 /* Returns the level of DECL, which declares a template parameter. */
13077 template_decl_level (tree decl
)
13079 switch (TREE_CODE (decl
))
13082 case TEMPLATE_DECL
:
13083 return TEMPLATE_TYPE_LEVEL (TREE_TYPE (decl
));
13086 return TEMPLATE_PARM_LEVEL (DECL_INITIAL (decl
));
13089 gcc_unreachable ();
13094 /* Decide whether ARG can be unified with PARM, considering only the
13095 cv-qualifiers of each type, given STRICT as documented for unify.
13096 Returns nonzero iff the unification is OK on that basis. */
13099 check_cv_quals_for_unify (int strict
, tree arg
, tree parm
)
13101 int arg_quals
= cp_type_quals (arg
);
13102 int parm_quals
= cp_type_quals (parm
);
13104 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
13105 && !(strict
& UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
13107 /* Although a CVR qualifier is ignored when being applied to a
13108 substituted template parameter ([8.3.2]/1 for example), that
13109 does not apply during deduction [14.8.2.4]/1, (even though
13110 that is not explicitly mentioned, [14.8.2.4]/9 indicates
13111 this). Except when we're allowing additional CV qualifiers
13112 at the outer level [14.8.2.1]/3,1st bullet. */
13113 if ((TREE_CODE (arg
) == REFERENCE_TYPE
13114 || TREE_CODE (arg
) == FUNCTION_TYPE
13115 || TREE_CODE (arg
) == METHOD_TYPE
)
13116 && (parm_quals
& (TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
)))
13119 if ((!POINTER_TYPE_P (arg
) && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
)
13120 && (parm_quals
& TYPE_QUAL_RESTRICT
))
13124 if (!(strict
& (UNIFY_ALLOW_MORE_CV_QUAL
| UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
13125 && (arg_quals
& parm_quals
) != parm_quals
)
13128 if (!(strict
& (UNIFY_ALLOW_LESS_CV_QUAL
| UNIFY_ALLOW_OUTER_LESS_CV_QUAL
))
13129 && (parm_quals
& arg_quals
) != arg_quals
)
13135 /* Determines the LEVEL and INDEX for the template parameter PARM. */
13137 template_parm_level_and_index (tree parm
, int* level
, int* index
)
13139 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
13140 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
13141 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
13143 *index
= TEMPLATE_TYPE_IDX (parm
);
13144 *level
= TEMPLATE_TYPE_LEVEL (parm
);
13148 *index
= TEMPLATE_PARM_IDX (parm
);
13149 *level
= TEMPLATE_PARM_LEVEL (parm
);
13153 /* Unifies the remaining arguments in PACKED_ARGS with the pack
13154 expansion at the end of PACKED_PARMS. Returns 0 if the type
13155 deduction succeeds, 1 otherwise. STRICT is the same as in
13156 unify. CALL_ARGS_P is true iff PACKED_ARGS is actually a function
13157 call argument list. We'll need to adjust the arguments to make them
13158 types. SUBR tells us if this is from a recursive call to
13159 type_unification_real. */
13161 unify_pack_expansion (tree tparms
, tree targs
, tree packed_parms
,
13162 tree packed_args
, int strict
, bool call_args_p
,
13166 = TREE_VEC_ELT (packed_parms
, TREE_VEC_LENGTH (packed_parms
) - 1);
13167 tree pattern
= PACK_EXPANSION_PATTERN (parm
);
13168 tree pack
, packs
= NULL_TREE
;
13169 int i
, start
= TREE_VEC_LENGTH (packed_parms
) - 1;
13170 int len
= TREE_VEC_LENGTH (packed_args
);
13172 /* Determine the parameter packs we will be deducing from the
13173 pattern, and record their current deductions. */
13174 for (pack
= PACK_EXPANSION_PARAMETER_PACKS (parm
);
13175 pack
; pack
= TREE_CHAIN (pack
))
13177 tree parm_pack
= TREE_VALUE (pack
);
13180 /* Determine the index and level of this parameter pack. */
13181 template_parm_level_and_index (parm_pack
, &level
, &idx
);
13183 /* Keep track of the parameter packs and their corresponding
13185 packs
= tree_cons (parm_pack
, TMPL_ARG (targs
, level
, idx
), packs
);
13186 TREE_TYPE (packs
) = make_tree_vec (len
- start
);
13189 /* Loop through all of the arguments that have not yet been
13190 unified and unify each with the pattern. */
13191 for (i
= start
; i
< len
; i
++)
13193 tree parm
= pattern
;
13195 /* For each parameter pack, clear out the deduced value so that
13196 we can deduce it again. */
13197 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
13200 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
13202 TMPL_ARG (targs
, level
, idx
) = NULL_TREE
;
13205 /* Unify the pattern with the current argument. */
13207 tree arg
= TREE_VEC_ELT (packed_args
, i
);
13208 tree arg_expr
= NULL_TREE
;
13209 int arg_strict
= strict
;
13210 bool skip_arg_p
= false;
13216 /* This mirrors what we do in type_unification_real. */
13220 sub_strict
= (UNIFY_ALLOW_OUTER_LEVEL
13221 | UNIFY_ALLOW_MORE_CV_QUAL
13222 | UNIFY_ALLOW_DERIVED
);
13226 sub_strict
= UNIFY_ALLOW_LESS_CV_QUAL
;
13230 sub_strict
= UNIFY_ALLOW_NONE
;
13234 gcc_unreachable ();
13239 gcc_assert (TREE_TYPE (arg
) != NULL_TREE
);
13240 if (type_unknown_p (arg
))
13242 /* [temp.deduct.type] A template-argument can be
13243 deduced from a pointer to function or pointer
13244 to member function argument if the set of
13245 overloaded functions does not contain function
13246 templates and at most one of a set of
13247 overloaded functions provides a unique
13250 if (resolve_overloaded_unification
13251 (tparms
, targs
, parm
, arg
,
13252 (unification_kind_t
) strict
,
13262 arg
= unlowered_expr_type (arg
);
13263 if (arg
== error_mark_node
)
13268 arg_strict
= sub_strict
;
13272 maybe_adjust_types_for_deduction ((unification_kind_t
) strict
,
13273 &parm
, &arg
, arg_expr
);
13278 if (unify (tparms
, targs
, parm
, arg
, arg_strict
))
13283 /* For each parameter pack, collect the deduced value. */
13284 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
13287 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
13289 TREE_VEC_ELT (TREE_TYPE (pack
), i
- start
) =
13290 TMPL_ARG (targs
, level
, idx
);
13294 /* Verify that the results of unification with the parameter packs
13295 produce results consistent with what we've seen before, and make
13296 the deduced argument packs available. */
13297 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
13299 tree old_pack
= TREE_VALUE (pack
);
13300 tree new_args
= TREE_TYPE (pack
);
13301 int i
, len
= TREE_VEC_LENGTH (new_args
);
13302 bool nondeduced_p
= false;
13304 /* If NEW_ARGS contains any NULL_TREE entries, we didn't
13305 actually deduce anything. */
13306 for (i
= 0; i
< len
&& !nondeduced_p
; ++i
)
13307 if (TREE_VEC_ELT (new_args
, i
) == NULL_TREE
)
13308 nondeduced_p
= true;
13312 if (old_pack
&& ARGUMENT_PACK_INCOMPLETE_P (old_pack
))
13314 /* Prepend the explicit arguments onto NEW_ARGS. */
13315 tree explicit_args
= ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
);
13316 tree old_args
= new_args
;
13317 int i
, explicit_len
= TREE_VEC_LENGTH (explicit_args
);
13318 int len
= explicit_len
+ TREE_VEC_LENGTH (old_args
);
13320 /* Copy the explicit arguments. */
13321 new_args
= make_tree_vec (len
);
13322 for (i
= 0; i
< explicit_len
; i
++)
13323 TREE_VEC_ELT (new_args
, i
) = TREE_VEC_ELT (explicit_args
, i
);
13325 /* Copy the deduced arguments. */
13326 for (; i
< len
; i
++)
13327 TREE_VEC_ELT (new_args
, i
) =
13328 TREE_VEC_ELT (old_args
, i
- explicit_len
);
13336 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
13338 /* Build the deduced *_ARGUMENT_PACK. */
13339 if (TREE_CODE (TREE_PURPOSE (pack
)) == TEMPLATE_PARM_INDEX
)
13341 result
= make_node (NONTYPE_ARGUMENT_PACK
);
13342 TREE_TYPE (result
) =
13343 TREE_TYPE (TEMPLATE_PARM_DECL (TREE_PURPOSE (pack
)));
13344 TREE_CONSTANT (result
) = 1;
13347 result
= make_node (TYPE_ARGUMENT_PACK
);
13349 SET_ARGUMENT_PACK_ARGS (result
, new_args
);
13351 /* Note the deduced argument packs for this parameter
13353 TMPL_ARG (targs
, level
, idx
) = result
;
13355 else if (ARGUMENT_PACK_INCOMPLETE_P (old_pack
)
13356 && (ARGUMENT_PACK_ARGS (old_pack
)
13357 == ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
)))
13359 /* We only had the explicitly-provided arguments before, but
13360 now we have a complete set of arguments. */
13362 tree explicit_args
= ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
);
13363 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
13365 /* Keep the original deduced argument pack. */
13366 TMPL_ARG (targs
, level
, idx
) = old_pack
;
13368 SET_ARGUMENT_PACK_ARGS (old_pack
, new_args
);
13369 ARGUMENT_PACK_INCOMPLETE_P (old_pack
) = 1;
13370 ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
) = explicit_args
;
13372 else if (!comp_template_args (ARGUMENT_PACK_ARGS (old_pack
),
13374 /* Inconsistent unification of this parameter pack. */
13380 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
13382 /* Keep the original deduced argument pack. */
13383 TMPL_ARG (targs
, level
, idx
) = old_pack
;
13390 /* Deduce the value of template parameters. TPARMS is the (innermost)
13391 set of template parameters to a template. TARGS is the bindings
13392 for those template parameters, as determined thus far; TARGS may
13393 include template arguments for outer levels of template parameters
13394 as well. PARM is a parameter to a template function, or a
13395 subcomponent of that parameter; ARG is the corresponding argument.
13396 This function attempts to match PARM with ARG in a manner
13397 consistent with the existing assignments in TARGS. If more values
13398 are deduced, then TARGS is updated.
13400 Returns 0 if the type deduction succeeds, 1 otherwise. The
13401 parameter STRICT is a bitwise or of the following flags:
13404 Require an exact match between PARM and ARG.
13405 UNIFY_ALLOW_MORE_CV_QUAL:
13406 Allow the deduced ARG to be more cv-qualified (by qualification
13407 conversion) than ARG.
13408 UNIFY_ALLOW_LESS_CV_QUAL:
13409 Allow the deduced ARG to be less cv-qualified than ARG.
13410 UNIFY_ALLOW_DERIVED:
13411 Allow the deduced ARG to be a template base class of ARG,
13412 or a pointer to a template base class of the type pointed to by
13414 UNIFY_ALLOW_INTEGER:
13415 Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX
13416 case for more information.
13417 UNIFY_ALLOW_OUTER_LEVEL:
13418 This is the outermost level of a deduction. Used to determine validity
13419 of qualification conversions. A valid qualification conversion must
13420 have const qualified pointers leading up to the inner type which
13421 requires additional CV quals, except at the outer level, where const
13422 is not required [conv.qual]. It would be normal to set this flag in
13423 addition to setting UNIFY_ALLOW_MORE_CV_QUAL.
13424 UNIFY_ALLOW_OUTER_MORE_CV_QUAL:
13425 This is the outermost level of a deduction, and PARM can be more CV
13426 qualified at this point.
13427 UNIFY_ALLOW_OUTER_LESS_CV_QUAL:
13428 This is the outermost level of a deduction, and PARM can be less CV
13429 qualified at this point. */
13432 unify (tree tparms
, tree targs
, tree parm
, tree arg
, int strict
)
13437 int strict_in
= strict
;
13439 /* I don't think this will do the right thing with respect to types.
13440 But the only case I've seen it in so far has been array bounds, where
13441 signedness is the only information lost, and I think that will be
13443 while (TREE_CODE (parm
) == NOP_EXPR
)
13444 parm
= TREE_OPERAND (parm
, 0);
13446 if (arg
== error_mark_node
)
13448 if (arg
== unknown_type_node
13449 || arg
== init_list_type_node
)
13450 /* We can't deduce anything from this, but we might get all the
13451 template args from other function args. */
13454 /* If PARM uses template parameters, then we can't bail out here,
13455 even if ARG == PARM, since we won't record unifications for the
13456 template parameters. We might need them if we're trying to
13457 figure out which of two things is more specialized. */
13458 if (arg
== parm
&& !uses_template_parms (parm
))
13461 /* Handle init lists early, so the rest of the function can assume
13462 we're dealing with a type. */
13463 if (BRACE_ENCLOSED_INITIALIZER_P (arg
))
13468 if (!is_std_init_list (parm
))
13469 /* We can only deduce from an initializer list argument if the
13470 parameter is std::initializer_list; otherwise this is a
13471 non-deduced context. */
13474 elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (parm
), 0);
13476 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (arg
), i
, elt
)
13478 int elt_strict
= strict
;
13479 if (!BRACE_ENCLOSED_INITIALIZER_P (elt
))
13481 tree type
= TREE_TYPE (elt
);
13482 /* It should only be possible to get here for a call. */
13483 gcc_assert (elt_strict
& UNIFY_ALLOW_OUTER_LEVEL
);
13484 elt_strict
|= maybe_adjust_types_for_deduction
13485 (DEDUCE_CALL
, &elttype
, &type
, elt
);
13489 if (unify (tparms
, targs
, elttype
, elt
, elt_strict
))
13495 /* Immediately reject some pairs that won't unify because of
13496 cv-qualification mismatches. */
13497 if (TREE_CODE (arg
) == TREE_CODE (parm
)
13499 /* It is the elements of the array which hold the cv quals of an array
13500 type, and the elements might be template type parms. We'll check
13501 when we recurse. */
13502 && TREE_CODE (arg
) != ARRAY_TYPE
13503 /* We check the cv-qualifiers when unifying with template type
13504 parameters below. We want to allow ARG `const T' to unify with
13505 PARM `T' for example, when computing which of two templates
13506 is more specialized, for example. */
13507 && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
13508 && !check_cv_quals_for_unify (strict_in
, arg
, parm
))
13511 if (!(strict
& UNIFY_ALLOW_OUTER_LEVEL
)
13512 && TYPE_P (parm
) && !CP_TYPE_CONST_P (parm
))
13513 strict
&= ~UNIFY_ALLOW_MORE_CV_QUAL
;
13514 strict
&= ~UNIFY_ALLOW_OUTER_LEVEL
;
13515 strict
&= ~UNIFY_ALLOW_DERIVED
;
13516 strict
&= ~UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
13517 strict
&= ~UNIFY_ALLOW_OUTER_LESS_CV_QUAL
;
13519 switch (TREE_CODE (parm
))
13521 case TYPENAME_TYPE
:
13523 case UNBOUND_CLASS_TEMPLATE
:
13524 /* In a type which contains a nested-name-specifier, template
13525 argument values cannot be deduced for template parameters used
13526 within the nested-name-specifier. */
13529 case TEMPLATE_TYPE_PARM
:
13530 case TEMPLATE_TEMPLATE_PARM
:
13531 case BOUND_TEMPLATE_TEMPLATE_PARM
:
13532 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
13533 if (tparm
== error_mark_node
)
13536 if (TEMPLATE_TYPE_LEVEL (parm
)
13537 != template_decl_level (tparm
))
13538 /* The PARM is not one we're trying to unify. Just check
13539 to see if it matches ARG. */
13540 return (TREE_CODE (arg
) == TREE_CODE (parm
)
13541 && same_type_p (parm
, arg
)) ? 0 : 1;
13542 idx
= TEMPLATE_TYPE_IDX (parm
);
13543 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
13544 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, idx
));
13546 /* Check for mixed types and values. */
13547 if ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
13548 && TREE_CODE (tparm
) != TYPE_DECL
)
13549 || (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
13550 && TREE_CODE (tparm
) != TEMPLATE_DECL
))
13553 if (TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
13555 /* ARG must be constructed from a template class or a template
13556 template parameter. */
13557 if (TREE_CODE (arg
) != BOUND_TEMPLATE_TEMPLATE_PARM
13558 && !CLASSTYPE_SPECIALIZATION_OF_PRIMARY_TEMPLATE_P (arg
))
13562 tree parmvec
= TYPE_TI_ARGS (parm
);
13563 tree argvec
= INNERMOST_TEMPLATE_ARGS (TYPE_TI_ARGS (arg
));
13565 = DECL_INNERMOST_TEMPLATE_PARMS
13566 (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (parm
));
13568 int parm_variadic_p
= 0;
13570 /* The resolution to DR150 makes clear that default
13571 arguments for an N-argument may not be used to bind T
13572 to a template template parameter with fewer than N
13573 parameters. It is not safe to permit the binding of
13574 default arguments as an extension, as that may change
13575 the meaning of a conforming program. Consider:
13577 struct Dense { static const unsigned int dim = 1; };
13579 template <template <typename> class View,
13581 void operator+(float, View<Block> const&);
13583 template <typename Block,
13584 unsigned int Dim = Block::dim>
13585 struct Lvalue_proxy { operator float() const; };
13589 Lvalue_proxy<Dense> p;
13594 Here, if Lvalue_proxy is permitted to bind to View, then
13595 the global operator+ will be used; if they are not, the
13596 Lvalue_proxy will be converted to float. */
13597 if (coerce_template_parms (parm_parms
,
13599 TYPE_TI_TEMPLATE (parm
),
13601 /*require_all_args=*/true,
13602 /*use_default_args=*/false)
13603 == error_mark_node
)
13606 /* Deduce arguments T, i from TT<T> or TT<i>.
13607 We check each element of PARMVEC and ARGVEC individually
13608 rather than the whole TREE_VEC since they can have
13609 different number of elements. */
13611 parmvec
= expand_template_argument_pack (parmvec
);
13612 argvec
= expand_template_argument_pack (argvec
);
13614 len
= TREE_VEC_LENGTH (parmvec
);
13616 /* Check if the parameters end in a pack, making them
13619 && PACK_EXPANSION_P (TREE_VEC_ELT (parmvec
, len
- 1)))
13620 parm_variadic_p
= 1;
13622 if (TREE_VEC_LENGTH (argvec
) < len
- parm_variadic_p
)
13625 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
13627 if (unify (tparms
, targs
,
13628 TREE_VEC_ELT (parmvec
, i
),
13629 TREE_VEC_ELT (argvec
, i
),
13634 if (parm_variadic_p
13635 && unify_pack_expansion (tparms
, targs
,
13638 /*call_args_p=*/false,
13642 arg
= TYPE_TI_TEMPLATE (arg
);
13644 /* Fall through to deduce template name. */
13647 if (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
13648 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
13650 /* Deduce template name TT from TT, TT<>, TT<T> and TT<i>. */
13652 /* Simple cases: Value already set, does match or doesn't. */
13653 if (targ
!= NULL_TREE
&& template_args_equal (targ
, arg
))
13660 /* If PARM is `const T' and ARG is only `int', we don't have
13661 a match unless we are allowing additional qualification.
13662 If ARG is `const int' and PARM is just `T' that's OK;
13663 that binds `const int' to `T'. */
13664 if (!check_cv_quals_for_unify (strict_in
| UNIFY_ALLOW_LESS_CV_QUAL
,
13668 /* Consider the case where ARG is `const volatile int' and
13669 PARM is `const T'. Then, T should be `volatile int'. */
13670 arg
= cp_build_qualified_type_real
13671 (arg
, cp_type_quals (arg
) & ~cp_type_quals (parm
), tf_none
);
13672 if (arg
== error_mark_node
)
13675 /* Simple cases: Value already set, does match or doesn't. */
13676 if (targ
!= NULL_TREE
&& same_type_p (targ
, arg
))
13681 /* Make sure that ARG is not a variable-sized array. (Note
13682 that were talking about variable-sized arrays (like
13683 `int[n]'), rather than arrays of unknown size (like
13684 `int[]').) We'll get very confused by such a type since
13685 the bound of the array will not be computable in an
13686 instantiation. Besides, such types are not allowed in
13687 ISO C++, so we can do as we please here. */
13688 if (variably_modified_type_p (arg
, NULL_TREE
))
13691 /* Strip typedefs as in convert_template_argument. */
13692 arg
= strip_typedefs (arg
);
13695 /* If ARG is a parameter pack or an expansion, we cannot unify
13696 against it unless PARM is also a parameter pack. */
13697 if ((template_parameter_pack_p (arg
) || PACK_EXPANSION_P (arg
))
13698 && !template_parameter_pack_p (parm
))
13701 /* If the argument deduction results is a METHOD_TYPE,
13702 then there is a problem.
13703 METHOD_TYPE doesn't map to any real C++ type the result of
13704 the deduction can not be of that type. */
13705 if (TREE_CODE (arg
) == METHOD_TYPE
)
13708 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = arg
;
13711 case TEMPLATE_PARM_INDEX
:
13712 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
13713 if (tparm
== error_mark_node
)
13716 if (TEMPLATE_PARM_LEVEL (parm
)
13717 != template_decl_level (tparm
))
13718 /* The PARM is not one we're trying to unify. Just check
13719 to see if it matches ARG. */
13720 return !(TREE_CODE (arg
) == TREE_CODE (parm
)
13721 && cp_tree_equal (parm
, arg
));
13723 idx
= TEMPLATE_PARM_IDX (parm
);
13724 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
13727 return !cp_tree_equal (targ
, arg
);
13729 /* [temp.deduct.type] If, in the declaration of a function template
13730 with a non-type template-parameter, the non-type
13731 template-parameter is used in an expression in the function
13732 parameter-list and, if the corresponding template-argument is
13733 deduced, the template-argument type shall match the type of the
13734 template-parameter exactly, except that a template-argument
13735 deduced from an array bound may be of any integral type.
13736 The non-type parameter might use already deduced type parameters. */
13737 tparm
= tsubst (TREE_TYPE (parm
), targs
, 0, NULL_TREE
);
13738 if (!TREE_TYPE (arg
))
13739 /* Template-parameter dependent expression. Just accept it for now.
13740 It will later be processed in convert_template_argument. */
13742 else if (same_type_p (TREE_TYPE (arg
), tparm
))
13744 else if ((strict
& UNIFY_ALLOW_INTEGER
)
13745 && (TREE_CODE (tparm
) == INTEGER_TYPE
13746 || TREE_CODE (tparm
) == BOOLEAN_TYPE
))
13747 /* Convert the ARG to the type of PARM; the deduced non-type
13748 template argument must exactly match the types of the
13749 corresponding parameter. */
13750 arg
= fold (build_nop (tparm
, arg
));
13751 else if (uses_template_parms (tparm
))
13752 /* We haven't deduced the type of this parameter yet. Try again
13758 /* If ARG is a parameter pack or an expansion, we cannot unify
13759 against it unless PARM is also a parameter pack. */
13760 if ((template_parameter_pack_p (arg
) || PACK_EXPANSION_P (arg
))
13761 && !TEMPLATE_PARM_PARAMETER_PACK (parm
))
13764 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = arg
;
13769 /* A pointer-to-member constant can be unified only with
13770 another constant. */
13771 if (TREE_CODE (arg
) != PTRMEM_CST
)
13774 /* Just unify the class member. It would be useless (and possibly
13775 wrong, depending on the strict flags) to unify also
13776 PTRMEM_CST_CLASS, because we want to be sure that both parm and
13777 arg refer to the same variable, even if through different
13778 classes. For instance:
13780 struct A { int x; };
13783 Unification of &A::x and &B::x must succeed. */
13784 return unify (tparms
, targs
, PTRMEM_CST_MEMBER (parm
),
13785 PTRMEM_CST_MEMBER (arg
), strict
);
13790 if (TREE_CODE (arg
) != POINTER_TYPE
)
13793 /* [temp.deduct.call]
13795 A can be another pointer or pointer to member type that can
13796 be converted to the deduced A via a qualification
13797 conversion (_conv.qual_).
13799 We pass down STRICT here rather than UNIFY_ALLOW_NONE.
13800 This will allow for additional cv-qualification of the
13801 pointed-to types if appropriate. */
13803 if (TREE_CODE (TREE_TYPE (arg
)) == RECORD_TYPE
)
13804 /* The derived-to-base conversion only persists through one
13805 level of pointers. */
13806 strict
|= (strict_in
& UNIFY_ALLOW_DERIVED
);
13808 return unify (tparms
, targs
, TREE_TYPE (parm
),
13809 TREE_TYPE (arg
), strict
);
13812 case REFERENCE_TYPE
:
13813 if (TREE_CODE (arg
) != REFERENCE_TYPE
)
13815 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
13816 strict
& UNIFY_ALLOW_MORE_CV_QUAL
);
13819 if (TREE_CODE (arg
) != ARRAY_TYPE
)
13821 if ((TYPE_DOMAIN (parm
) == NULL_TREE
)
13822 != (TYPE_DOMAIN (arg
) == NULL_TREE
))
13824 if (TYPE_DOMAIN (parm
) != NULL_TREE
)
13831 /* Our representation of array types uses "N - 1" as the
13832 TYPE_MAX_VALUE for an array with "N" elements, if "N" is
13833 not an integer constant. We cannot unify arbitrarily
13834 complex expressions, so we eliminate the MINUS_EXPRs
13836 parm_max
= TYPE_MAX_VALUE (TYPE_DOMAIN (parm
));
13837 parm_cst
= TREE_CODE (parm_max
) == INTEGER_CST
;
13840 gcc_assert (TREE_CODE (parm_max
) == MINUS_EXPR
);
13841 parm_max
= TREE_OPERAND (parm_max
, 0);
13843 arg_max
= TYPE_MAX_VALUE (TYPE_DOMAIN (arg
));
13844 arg_cst
= TREE_CODE (arg_max
) == INTEGER_CST
;
13847 /* The ARG_MAX may not be a simple MINUS_EXPR, if we are
13848 trying to unify the type of a variable with the type
13849 of a template parameter. For example:
13851 template <unsigned int N>
13852 void f (char (&) [N]);
13859 Here, the type of the ARG will be "int [g(i)]", and
13860 may be a SAVE_EXPR, etc. */
13861 if (TREE_CODE (arg_max
) != MINUS_EXPR
)
13863 arg_max
= TREE_OPERAND (arg_max
, 0);
13866 /* If only one of the bounds used a MINUS_EXPR, compensate
13867 by adding one to the other bound. */
13868 if (parm_cst
&& !arg_cst
)
13869 parm_max
= fold_build2 (PLUS_EXPR
,
13873 else if (arg_cst
&& !parm_cst
)
13874 arg_max
= fold_build2 (PLUS_EXPR
,
13879 if (unify (tparms
, targs
, parm_max
, arg_max
, UNIFY_ALLOW_INTEGER
))
13882 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
13883 strict
& UNIFY_ALLOW_MORE_CV_QUAL
);
13890 case ENUMERAL_TYPE
:
13892 if (TREE_CODE (arg
) != TREE_CODE (parm
))
13895 /* We have already checked cv-qualification at the top of the
13897 if (!same_type_ignoring_top_level_qualifiers_p (arg
, parm
))
13900 /* As far as unification is concerned, this wins. Later checks
13901 will invalidate it if necessary. */
13904 /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */
13905 /* Type INTEGER_CST can come from ordinary constant template args. */
13907 while (TREE_CODE (arg
) == NOP_EXPR
)
13908 arg
= TREE_OPERAND (arg
, 0);
13910 if (TREE_CODE (arg
) != INTEGER_CST
)
13912 return !tree_int_cst_equal (parm
, arg
);
13917 if (TREE_CODE (arg
) != TREE_VEC
)
13919 if (TREE_VEC_LENGTH (parm
) != TREE_VEC_LENGTH (arg
))
13921 for (i
= 0; i
< TREE_VEC_LENGTH (parm
); ++i
)
13922 if (unify (tparms
, targs
,
13923 TREE_VEC_ELT (parm
, i
), TREE_VEC_ELT (arg
, i
),
13931 if (TREE_CODE (arg
) != TREE_CODE (parm
))
13934 if (TYPE_PTRMEMFUNC_P (parm
))
13936 if (!TYPE_PTRMEMFUNC_P (arg
))
13939 return unify (tparms
, targs
,
13940 TYPE_PTRMEMFUNC_FN_TYPE (parm
),
13941 TYPE_PTRMEMFUNC_FN_TYPE (arg
),
13945 if (CLASSTYPE_TEMPLATE_INFO (parm
))
13947 tree t
= NULL_TREE
;
13949 if (strict_in
& UNIFY_ALLOW_DERIVED
)
13951 /* First, we try to unify the PARM and ARG directly. */
13952 t
= try_class_unification (tparms
, targs
,
13957 /* Fallback to the special case allowed in
13958 [temp.deduct.call]:
13960 If P is a class, and P has the form
13961 template-id, then A can be a derived class of
13962 the deduced A. Likewise, if P is a pointer to
13963 a class of the form template-id, A can be a
13964 pointer to a derived class pointed to by the
13966 t
= get_template_base (tparms
, targs
, parm
, arg
);
13972 else if (CLASSTYPE_TEMPLATE_INFO (arg
)
13973 && (CLASSTYPE_TI_TEMPLATE (parm
)
13974 == CLASSTYPE_TI_TEMPLATE (arg
)))
13975 /* Perhaps PARM is something like S<U> and ARG is S<int>.
13976 Then, we should unify `int' and `U'. */
13979 /* There's no chance of unification succeeding. */
13982 return unify (tparms
, targs
, CLASSTYPE_TI_ARGS (parm
),
13983 CLASSTYPE_TI_ARGS (t
), UNIFY_ALLOW_NONE
);
13985 else if (!same_type_ignoring_top_level_qualifiers_p (parm
, arg
))
13990 case FUNCTION_TYPE
:
13992 unsigned int nargs
;
13997 if (TREE_CODE (arg
) != TREE_CODE (parm
))
14000 /* CV qualifications for methods can never be deduced, they must
14001 match exactly. We need to check them explicitly here,
14002 because type_unification_real treats them as any other
14003 cv-qualified parameter. */
14004 if (TREE_CODE (parm
) == METHOD_TYPE
14005 && (!check_cv_quals_for_unify
14007 TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (arg
))),
14008 TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (parm
))))))
14011 if (unify (tparms
, targs
, TREE_TYPE (parm
),
14012 TREE_TYPE (arg
), UNIFY_ALLOW_NONE
))
14015 nargs
= list_length (TYPE_ARG_TYPES (arg
));
14016 args
= XALLOCAVEC (tree
, nargs
);
14017 for (a
= TYPE_ARG_TYPES (arg
), i
= 0;
14018 a
!= NULL_TREE
&& a
!= void_list_node
;
14019 a
= TREE_CHAIN (a
), ++i
)
14020 args
[i
] = TREE_VALUE (a
);
14023 return type_unification_real (tparms
, targs
, TYPE_ARG_TYPES (parm
),
14024 args
, nargs
, 1, DEDUCE_EXACT
,
14029 /* Unify a pointer to member with a pointer to member function, which
14030 deduces the type of the member as a function type. */
14031 if (TYPE_PTRMEMFUNC_P (arg
))
14035 cp_cv_quals cv_quals
;
14037 /* Check top-level cv qualifiers */
14038 if (!check_cv_quals_for_unify (UNIFY_ALLOW_NONE
, arg
, parm
))
14041 if (unify (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
14042 TYPE_PTRMEMFUNC_OBJECT_TYPE (arg
), UNIFY_ALLOW_NONE
))
14045 /* Determine the type of the function we are unifying against. */
14046 method_type
= TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (arg
));
14048 build_function_type (TREE_TYPE (method_type
),
14049 TREE_CHAIN (TYPE_ARG_TYPES (method_type
)));
14051 /* Extract the cv-qualifiers of the member function from the
14052 implicit object parameter and place them on the function
14053 type to be restored later. */
14055 cp_type_quals(TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (method_type
))));
14056 fntype
= build_qualified_type (fntype
, cv_quals
);
14057 return unify (tparms
, targs
, TREE_TYPE (parm
), fntype
, strict
);
14060 if (TREE_CODE (arg
) != OFFSET_TYPE
)
14062 if (unify (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
14063 TYPE_OFFSET_BASETYPE (arg
), UNIFY_ALLOW_NONE
))
14065 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
14069 if (DECL_TEMPLATE_PARM_P (parm
))
14070 return unify (tparms
, targs
, DECL_INITIAL (parm
), arg
, strict
);
14071 if (arg
!= integral_constant_value (parm
))
14076 case TEMPLATE_DECL
:
14077 /* Matched cases are handled by the ARG == PARM test above. */
14080 case TYPE_ARGUMENT_PACK
:
14081 case NONTYPE_ARGUMENT_PACK
:
14083 tree packed_parms
= ARGUMENT_PACK_ARGS (parm
);
14084 tree packed_args
= ARGUMENT_PACK_ARGS (arg
);
14085 int i
, len
= TREE_VEC_LENGTH (packed_parms
);
14086 int argslen
= TREE_VEC_LENGTH (packed_args
);
14087 int parm_variadic_p
= 0;
14089 for (i
= 0; i
< len
; ++i
)
14091 if (PACK_EXPANSION_P (TREE_VEC_ELT (packed_parms
, i
)))
14094 /* We can unify against something with a trailing
14096 parm_variadic_p
= 1;
14098 /* Since there is something following the pack
14099 expansion, we cannot unify this template argument
14106 /* If we don't have enough arguments to satisfy the parameters
14107 (not counting the pack expression at the end), or we have
14108 too many arguments for a parameter list that doesn't end in
14109 a pack expression, we can't unify. */
14110 if (argslen
< (len
- parm_variadic_p
)
14111 || (argslen
> len
&& !parm_variadic_p
))
14114 /* Unify all of the parameters that precede the (optional)
14115 pack expression. */
14116 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
14118 if (unify (tparms
, targs
, TREE_VEC_ELT (packed_parms
, i
),
14119 TREE_VEC_ELT (packed_args
, i
), strict
))
14123 if (parm_variadic_p
)
14124 return unify_pack_expansion (tparms
, targs
,
14125 packed_parms
, packed_args
,
14126 strict
, /*call_args_p=*/false,
14134 case DECLTYPE_TYPE
:
14135 /* Cannot deduce anything from TYPEOF_TYPE or DECLTYPE_TYPE
14140 /* Unification fails if we hit an error node. */
14144 gcc_assert (EXPR_P (parm
));
14146 /* We must be looking at an expression. This can happen with
14150 void foo(S<I>, S<I + 2>);
14152 This is a "nondeduced context":
14156 The nondeduced contexts are:
14158 --A type that is a template-id in which one or more of
14159 the template-arguments is an expression that references
14160 a template-parameter.
14162 In these cases, we assume deduction succeeded, but don't
14163 actually infer any unifications. */
14165 if (!uses_template_parms (parm
)
14166 && !template_args_equal (parm
, arg
))
14173 /* Note that DECL can be defined in this translation unit, if
14177 mark_definable (tree decl
)
14180 DECL_NOT_REALLY_EXTERN (decl
) = 1;
14181 FOR_EACH_CLONE (clone
, decl
)
14182 DECL_NOT_REALLY_EXTERN (clone
) = 1;
14185 /* Called if RESULT is explicitly instantiated, or is a member of an
14186 explicitly instantiated class. */
14189 mark_decl_instantiated (tree result
, int extern_p
)
14191 SET_DECL_EXPLICIT_INSTANTIATION (result
);
14193 /* If this entity has already been written out, it's too late to
14194 make any modifications. */
14195 if (TREE_ASM_WRITTEN (result
))
14198 if (TREE_CODE (result
) != FUNCTION_DECL
)
14199 /* The TREE_PUBLIC flag for function declarations will have been
14200 set correctly by tsubst. */
14201 TREE_PUBLIC (result
) = 1;
14203 /* This might have been set by an earlier implicit instantiation. */
14204 DECL_COMDAT (result
) = 0;
14207 DECL_NOT_REALLY_EXTERN (result
) = 0;
14210 mark_definable (result
);
14211 /* Always make artificials weak. */
14212 if (DECL_ARTIFICIAL (result
) && flag_weak
)
14213 comdat_linkage (result
);
14214 /* For WIN32 we also want to put explicit instantiations in
14215 linkonce sections. */
14216 else if (TREE_PUBLIC (result
))
14217 maybe_make_one_only (result
);
14220 /* If EXTERN_P, then this function will not be emitted -- unless
14221 followed by an explicit instantiation, at which point its linkage
14222 will be adjusted. If !EXTERN_P, then this function will be
14223 emitted here. In neither circumstance do we want
14224 import_export_decl to adjust the linkage. */
14225 DECL_INTERFACE_KNOWN (result
) = 1;
14228 /* Given two function templates PAT1 and PAT2, return:
14230 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order].
14231 -1 if PAT2 is more specialized than PAT1.
14232 0 if neither is more specialized.
14234 LEN indicates the number of parameters we should consider
14235 (defaulted parameters should not be considered).
14237 The 1998 std underspecified function template partial ordering, and
14238 DR214 addresses the issue. We take pairs of arguments, one from
14239 each of the templates, and deduce them against each other. One of
14240 the templates will be more specialized if all the *other*
14241 template's arguments deduce against its arguments and at least one
14242 of its arguments *does* *not* deduce against the other template's
14243 corresponding argument. Deduction is done as for class templates.
14244 The arguments used in deduction have reference and top level cv
14245 qualifiers removed. Iff both arguments were originally reference
14246 types *and* deduction succeeds in both directions, the template
14247 with the more cv-qualified argument wins for that pairing (if
14248 neither is more cv-qualified, they both are equal). Unlike regular
14249 deduction, after all the arguments have been deduced in this way,
14250 we do *not* verify the deduced template argument values can be
14251 substituted into non-deduced contexts, nor do we have to verify
14252 that all template arguments have been deduced. */
14255 more_specialized_fn (tree pat1
, tree pat2
, int len
)
14257 tree decl1
= DECL_TEMPLATE_RESULT (pat1
);
14258 tree decl2
= DECL_TEMPLATE_RESULT (pat2
);
14259 tree targs1
= make_tree_vec (DECL_NTPARMS (pat1
));
14260 tree targs2
= make_tree_vec (DECL_NTPARMS (pat2
));
14261 tree tparms1
= DECL_INNERMOST_TEMPLATE_PARMS (pat1
);
14262 tree tparms2
= DECL_INNERMOST_TEMPLATE_PARMS (pat2
);
14263 tree args1
= TYPE_ARG_TYPES (TREE_TYPE (decl1
));
14264 tree args2
= TYPE_ARG_TYPES (TREE_TYPE (decl2
));
14268 /* Remove the this parameter from non-static member functions. If
14269 one is a non-static member function and the other is not a static
14270 member function, remove the first parameter from that function
14271 also. This situation occurs for operator functions where we
14272 locate both a member function (with this pointer) and non-member
14273 operator (with explicit first operand). */
14274 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl1
))
14276 len
--; /* LEN is the number of significant arguments for DECL1 */
14277 args1
= TREE_CHAIN (args1
);
14278 if (!DECL_STATIC_FUNCTION_P (decl2
))
14279 args2
= TREE_CHAIN (args2
);
14281 else if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl2
))
14283 args2
= TREE_CHAIN (args2
);
14284 if (!DECL_STATIC_FUNCTION_P (decl1
))
14287 args1
= TREE_CHAIN (args1
);
14291 /* If only one is a conversion operator, they are unordered. */
14292 if (DECL_CONV_FN_P (decl1
) != DECL_CONV_FN_P (decl2
))
14295 /* Consider the return type for a conversion function */
14296 if (DECL_CONV_FN_P (decl1
))
14298 args1
= tree_cons (NULL_TREE
, TREE_TYPE (TREE_TYPE (decl1
)), args1
);
14299 args2
= tree_cons (NULL_TREE
, TREE_TYPE (TREE_TYPE (decl2
)), args2
);
14303 processing_template_decl
++;
14306 /* Stop when an ellipsis is seen. */
14307 && args1
!= NULL_TREE
&& args2
!= NULL_TREE
)
14309 tree arg1
= TREE_VALUE (args1
);
14310 tree arg2
= TREE_VALUE (args2
);
14311 int deduce1
, deduce2
;
14315 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
14316 && TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
14318 /* When both arguments are pack expansions, we need only
14319 unify the patterns themselves. */
14320 arg1
= PACK_EXPANSION_PATTERN (arg1
);
14321 arg2
= PACK_EXPANSION_PATTERN (arg2
);
14323 /* This is the last comparison we need to do. */
14327 if (TREE_CODE (arg1
) == REFERENCE_TYPE
)
14329 arg1
= TREE_TYPE (arg1
);
14330 quals1
= cp_type_quals (arg1
);
14333 if (TREE_CODE (arg2
) == REFERENCE_TYPE
)
14335 arg2
= TREE_TYPE (arg2
);
14336 quals2
= cp_type_quals (arg2
);
14339 if ((quals1
< 0) != (quals2
< 0))
14341 /* Only of the args is a reference, see if we should apply
14342 array/function pointer decay to it. This is not part of
14343 DR214, but is, IMHO, consistent with the deduction rules
14344 for the function call itself, and with our earlier
14345 implementation of the underspecified partial ordering
14346 rules. (nathan). */
14349 switch (TREE_CODE (arg1
))
14352 arg1
= TREE_TYPE (arg1
);
14354 case FUNCTION_TYPE
:
14355 arg1
= build_pointer_type (arg1
);
14364 switch (TREE_CODE (arg2
))
14367 arg2
= TREE_TYPE (arg2
);
14369 case FUNCTION_TYPE
:
14370 arg2
= build_pointer_type (arg2
);
14379 arg1
= TYPE_MAIN_VARIANT (arg1
);
14380 arg2
= TYPE_MAIN_VARIANT (arg2
);
14382 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
)
14384 int i
, len2
= list_length (args2
);
14385 tree parmvec
= make_tree_vec (1);
14386 tree argvec
= make_tree_vec (len2
);
14389 /* Setup the parameter vector, which contains only ARG1. */
14390 TREE_VEC_ELT (parmvec
, 0) = arg1
;
14392 /* Setup the argument vector, which contains the remaining
14394 for (i
= 0; i
< len2
; i
++, ta
= TREE_CHAIN (ta
))
14395 TREE_VEC_ELT (argvec
, i
) = TREE_VALUE (ta
);
14397 deduce1
= !unify_pack_expansion (tparms1
, targs1
, parmvec
,
14398 argvec
, UNIFY_ALLOW_NONE
,
14399 /*call_args_p=*/false,
14402 /* We cannot deduce in the other direction, because ARG1 is
14403 a pack expansion but ARG2 is not. */
14406 else if (TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
14408 int i
, len1
= list_length (args1
);
14409 tree parmvec
= make_tree_vec (1);
14410 tree argvec
= make_tree_vec (len1
);
14413 /* Setup the parameter vector, which contains only ARG1. */
14414 TREE_VEC_ELT (parmvec
, 0) = arg2
;
14416 /* Setup the argument vector, which contains the remaining
14418 for (i
= 0; i
< len1
; i
++, ta
= TREE_CHAIN (ta
))
14419 TREE_VEC_ELT (argvec
, i
) = TREE_VALUE (ta
);
14421 deduce2
= !unify_pack_expansion (tparms2
, targs2
, parmvec
,
14422 argvec
, UNIFY_ALLOW_NONE
,
14423 /*call_args_p=*/false,
14426 /* We cannot deduce in the other direction, because ARG2 is
14427 a pack expansion but ARG1 is not.*/
14433 /* The normal case, where neither argument is a pack
14435 deduce1
= !unify (tparms1
, targs1
, arg1
, arg2
, UNIFY_ALLOW_NONE
);
14436 deduce2
= !unify (tparms2
, targs2
, arg2
, arg1
, UNIFY_ALLOW_NONE
);
14443 if (better1
< 0 && better2
< 0)
14444 /* We've failed to deduce something in either direction.
14445 These must be unordered. */
14448 if (deduce1
&& deduce2
&& quals1
>= 0 && quals2
>= 0)
14450 /* Deduces in both directions, see if quals can
14451 disambiguate. Pretend the worse one failed to deduce. */
14452 if ((quals1
& quals2
) == quals2
)
14454 if ((quals1
& quals2
) == quals1
)
14457 if (deduce1
&& !deduce2
&& !better2
)
14459 if (deduce2
&& !deduce1
&& !better1
)
14462 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
14463 || TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
14464 /* We have already processed all of the arguments in our
14465 handing of the pack expansion type. */
14468 args1
= TREE_CHAIN (args1
);
14469 args2
= TREE_CHAIN (args2
);
14472 processing_template_decl
--;
14474 /* All things being equal, if the next argument is a pack expansion
14475 for one function but not for the other, prefer the
14476 non-variadic function. */
14477 if ((better1
> 0) - (better2
> 0) == 0
14478 && args1
&& TREE_VALUE (args1
)
14479 && args2
&& TREE_VALUE (args2
))
14481 if (TREE_CODE (TREE_VALUE (args1
)) == TYPE_PACK_EXPANSION
)
14482 return TREE_CODE (TREE_VALUE (args2
)) == TYPE_PACK_EXPANSION
? 0 : -1;
14483 else if (TREE_CODE (TREE_VALUE (args2
)) == TYPE_PACK_EXPANSION
)
14487 return (better1
> 0) - (better2
> 0);
14490 /* Determine which of two partial specializations is more specialized.
14492 PAT1 is a TREE_LIST whose TREE_TYPE is the _TYPE node corresponding
14493 to the first partial specialization. The TREE_VALUE is the
14494 innermost set of template parameters for the partial
14495 specialization. PAT2 is similar, but for the second template.
14497 Return 1 if the first partial specialization is more specialized;
14498 -1 if the second is more specialized; 0 if neither is more
14501 See [temp.class.order] for information about determining which of
14502 two templates is more specialized. */
14505 more_specialized_class (tree pat1
, tree pat2
)
14510 bool any_deductions
= false;
14512 tmpl1
= TREE_TYPE (pat1
);
14513 tmpl2
= TREE_TYPE (pat2
);
14515 /* Just like what happens for functions, if we are ordering between
14516 different class template specializations, we may encounter dependent
14517 types in the arguments, and we need our dependency check functions
14518 to behave correctly. */
14519 ++processing_template_decl
;
14520 targs
= get_class_bindings (TREE_VALUE (pat1
),
14521 CLASSTYPE_TI_ARGS (tmpl1
),
14522 CLASSTYPE_TI_ARGS (tmpl2
));
14526 any_deductions
= true;
14529 targs
= get_class_bindings (TREE_VALUE (pat2
),
14530 CLASSTYPE_TI_ARGS (tmpl2
),
14531 CLASSTYPE_TI_ARGS (tmpl1
));
14535 any_deductions
= true;
14537 --processing_template_decl
;
14539 /* In the case of a tie where at least one of the class templates
14540 has a parameter pack at the end, the template with the most
14541 non-packed parameters wins. */
14544 && (template_args_variadic_p (TREE_PURPOSE (pat1
))
14545 || template_args_variadic_p (TREE_PURPOSE (pat2
))))
14547 tree args1
= INNERMOST_TEMPLATE_ARGS (TREE_PURPOSE (pat1
));
14548 tree args2
= INNERMOST_TEMPLATE_ARGS (TREE_PURPOSE (pat2
));
14549 int len1
= TREE_VEC_LENGTH (args1
);
14550 int len2
= TREE_VEC_LENGTH (args2
);
14552 /* We don't count the pack expansion at the end. */
14553 if (template_args_variadic_p (TREE_PURPOSE (pat1
)))
14555 if (template_args_variadic_p (TREE_PURPOSE (pat2
)))
14560 else if (len1
< len2
)
14567 /* Return the template arguments that will produce the function signature
14568 DECL from the function template FN, with the explicit template
14569 arguments EXPLICIT_ARGS. If CHECK_RETTYPE is true, the return type must
14570 also match. Return NULL_TREE if no satisfactory arguments could be
14574 get_bindings (tree fn
, tree decl
, tree explicit_args
, bool check_rettype
)
14576 int ntparms
= DECL_NTPARMS (fn
);
14577 tree targs
= make_tree_vec (ntparms
);
14579 tree decl_arg_types
;
14581 unsigned int nargs
, ix
;
14584 /* Substitute the explicit template arguments into the type of DECL.
14585 The call to fn_type_unification will handle substitution into the
14587 decl_type
= TREE_TYPE (decl
);
14588 if (explicit_args
&& uses_template_parms (decl_type
))
14591 tree converted_args
;
14593 if (DECL_TEMPLATE_INFO (decl
))
14594 tmpl
= DECL_TI_TEMPLATE (decl
);
14596 /* We can get here for some invalid specializations. */
14600 = coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
14601 explicit_args
, NULL_TREE
,
14603 /*require_all_args=*/false,
14604 /*use_default_args=*/false);
14605 if (converted_args
== error_mark_node
)
14608 decl_type
= tsubst (decl_type
, converted_args
, tf_none
, NULL_TREE
);
14609 if (decl_type
== error_mark_node
)
14613 /* Never do unification on the 'this' parameter. */
14614 decl_arg_types
= skip_artificial_parms_for (decl
,
14615 TYPE_ARG_TYPES (decl_type
));
14617 nargs
= list_length (decl_arg_types
);
14618 args
= XALLOCAVEC (tree
, nargs
);
14619 for (arg
= decl_arg_types
, ix
= 0;
14620 arg
!= NULL_TREE
&& arg
!= void_list_node
;
14621 arg
= TREE_CHAIN (arg
), ++ix
)
14622 args
[ix
] = TREE_VALUE (arg
);
14624 if (fn_type_unification (fn
, explicit_args
, targs
,
14626 (check_rettype
|| DECL_CONV_FN_P (fn
)
14627 ? TREE_TYPE (decl_type
) : NULL_TREE
),
14628 DEDUCE_EXACT
, LOOKUP_NORMAL
))
14634 /* Return the innermost template arguments that, when applied to a
14635 template specialization whose innermost template parameters are
14636 TPARMS, and whose specialization arguments are SPEC_ARGS, yield the
14639 For example, suppose we have:
14641 template <class T, class U> struct S {};
14642 template <class T> struct S<T*, int> {};
14644 Then, suppose we want to get `S<double*, int>'. The TPARMS will be
14645 {T}, the SPEC_ARGS will be {T*, int} and the ARGS will be {double*,
14646 int}. The resulting vector will be {double}, indicating that `T'
14647 is bound to `double'. */
14650 get_class_bindings (tree tparms
, tree spec_args
, tree args
)
14652 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
14654 tree innermost_deduced_args
;
14656 innermost_deduced_args
= make_tree_vec (ntparms
);
14657 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
14659 deduced_args
= copy_node (args
);
14660 SET_TMPL_ARGS_LEVEL (deduced_args
,
14661 TMPL_ARGS_DEPTH (deduced_args
),
14662 innermost_deduced_args
);
14665 deduced_args
= innermost_deduced_args
;
14667 if (unify (tparms
, deduced_args
,
14668 INNERMOST_TEMPLATE_ARGS (spec_args
),
14669 INNERMOST_TEMPLATE_ARGS (args
),
14673 for (i
= 0; i
< ntparms
; ++i
)
14674 if (! TREE_VEC_ELT (innermost_deduced_args
, i
))
14677 /* Verify that nondeduced template arguments agree with the type
14678 obtained from argument deduction.
14682 struct A { typedef int X; };
14683 template <class T, class U> struct C {};
14684 template <class T> struct C<T, typename T::X> {};
14686 Then with the instantiation `C<A, int>', we can deduce that
14687 `T' is `A' but unify () does not check whether `typename T::X'
14689 spec_args
= tsubst (spec_args
, deduced_args
, tf_none
, NULL_TREE
);
14690 if (spec_args
== error_mark_node
14691 /* We only need to check the innermost arguments; the other
14692 arguments will always agree. */
14693 || !comp_template_args (INNERMOST_TEMPLATE_ARGS (spec_args
),
14694 INNERMOST_TEMPLATE_ARGS (args
)))
14697 /* Now that we have bindings for all of the template arguments,
14698 ensure that the arguments deduced for the template template
14699 parameters have compatible template parameter lists. See the use
14700 of template_template_parm_bindings_ok_p in fn_type_unification
14701 for more information. */
14702 if (!template_template_parm_bindings_ok_p (tparms
, deduced_args
))
14705 return deduced_args
;
14708 /* TEMPLATES is a TREE_LIST. Each TREE_VALUE is a TEMPLATE_DECL.
14709 Return the TREE_LIST node with the most specialized template, if
14710 any. If there is no most specialized template, the error_mark_node
14713 Note that this function does not look at, or modify, the
14714 TREE_PURPOSE or TREE_TYPE of any of the nodes. Since the node
14715 returned is one of the elements of INSTANTIATIONS, callers may
14716 store information in the TREE_PURPOSE or TREE_TYPE of the nodes,
14717 and retrieve it from the value returned. */
14720 most_specialized_instantiation (tree templates
)
14724 ++processing_template_decl
;
14727 for (fn
= TREE_CHAIN (templates
); fn
; fn
= TREE_CHAIN (fn
))
14731 if (get_bindings (TREE_VALUE (champ
),
14732 DECL_TEMPLATE_RESULT (TREE_VALUE (fn
)),
14733 NULL_TREE
, /*check_ret=*/false))
14736 if (get_bindings (TREE_VALUE (fn
),
14737 DECL_TEMPLATE_RESULT (TREE_VALUE (champ
)),
14738 NULL_TREE
, /*check_ret=*/false))
14745 /* Equally specialized, move to next function. If there
14746 is no next function, nothing's most specialized. */
14747 fn
= TREE_CHAIN (fn
);
14755 /* Now verify that champ is better than everything earlier in the
14756 instantiation list. */
14757 for (fn
= templates
; fn
!= champ
; fn
= TREE_CHAIN (fn
))
14758 if (get_bindings (TREE_VALUE (champ
),
14759 DECL_TEMPLATE_RESULT (TREE_VALUE (fn
)),
14760 NULL_TREE
, /*check_ret=*/false)
14761 || !get_bindings (TREE_VALUE (fn
),
14762 DECL_TEMPLATE_RESULT (TREE_VALUE (champ
)),
14763 NULL_TREE
, /*check_ret=*/false))
14769 processing_template_decl
--;
14772 return error_mark_node
;
14777 /* If DECL is a specialization of some template, return the most
14778 general such template. Otherwise, returns NULL_TREE.
14780 For example, given:
14782 template <class T> struct S { template <class U> void f(U); };
14784 if TMPL is `template <class U> void S<int>::f(U)' this will return
14785 the full template. This function will not trace past partial
14786 specializations, however. For example, given in addition:
14788 template <class T> struct S<T*> { template <class U> void f(U); };
14790 if TMPL is `template <class U> void S<int*>::f(U)' this will return
14791 `template <class T> template <class U> S<T*>::f(U)'. */
14794 most_general_template (tree decl
)
14796 /* If DECL is a FUNCTION_DECL, find the TEMPLATE_DECL of which it is
14797 an immediate specialization. */
14798 if (TREE_CODE (decl
) == FUNCTION_DECL
)
14800 if (DECL_TEMPLATE_INFO (decl
)) {
14801 decl
= DECL_TI_TEMPLATE (decl
);
14803 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE for a
14804 template friend. */
14805 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
14811 /* Look for more and more general templates. */
14812 while (DECL_TEMPLATE_INFO (decl
))
14814 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE in some cases.
14815 (See cp-tree.h for details.) */
14816 if (TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
14819 if (CLASS_TYPE_P (TREE_TYPE (decl
))
14820 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)))
14823 /* Stop if we run into an explicitly specialized class template. */
14824 if (!DECL_NAMESPACE_SCOPE_P (decl
)
14825 && DECL_CONTEXT (decl
)
14826 && CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (decl
)))
14829 decl
= DECL_TI_TEMPLATE (decl
);
14835 /* Return the most specialized of the class template partial
14836 specializations of TMPL which can produce TYPE, a specialization of
14837 TMPL. The value returned is actually a TREE_LIST; the TREE_TYPE is
14838 a _TYPE node corresponding to the partial specialization, while the
14839 TREE_PURPOSE is the set of template arguments that must be
14840 substituted into the TREE_TYPE in order to generate TYPE.
14842 If the choice of partial specialization is ambiguous, a diagnostic
14843 is issued, and the error_mark_node is returned. If there are no
14844 partial specializations of TMPL matching TYPE, then NULL_TREE is
14848 most_specialized_class (tree type
, tree tmpl
)
14850 tree list
= NULL_TREE
;
14856 tree outer_args
= NULL_TREE
;
14858 tmpl
= most_general_template (tmpl
);
14859 args
= CLASSTYPE_TI_ARGS (type
);
14861 /* For determining which partial specialization to use, only the
14862 innermost args are interesting. */
14863 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
14865 outer_args
= strip_innermost_template_args (args
, 1);
14866 args
= INNERMOST_TEMPLATE_ARGS (args
);
14869 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
); t
; t
= TREE_CHAIN (t
))
14871 tree partial_spec_args
;
14873 tree parms
= TREE_VALUE (t
);
14875 partial_spec_args
= CLASSTYPE_TI_ARGS (TREE_TYPE (t
));
14880 ++processing_template_decl
;
14882 /* Discard the outer levels of args, and then substitute in the
14883 template args from the enclosing class. */
14884 partial_spec_args
= INNERMOST_TEMPLATE_ARGS (partial_spec_args
);
14885 partial_spec_args
= tsubst_template_args
14886 (partial_spec_args
, outer_args
, tf_none
, NULL_TREE
);
14888 /* PARMS already refers to just the innermost parms, but the
14889 template parms in partial_spec_args had their levels lowered
14890 by tsubst, so we need to do the same for the parm list. We
14891 can't just tsubst the TREE_VEC itself, as tsubst wants to
14892 treat a TREE_VEC as an argument vector. */
14893 parms
= copy_node (parms
);
14894 for (i
= TREE_VEC_LENGTH (parms
) - 1; i
>= 0; --i
)
14895 TREE_VEC_ELT (parms
, i
) =
14896 tsubst (TREE_VEC_ELT (parms
, i
), outer_args
, tf_none
, NULL_TREE
);
14898 --processing_template_decl
;
14900 spec_args
= get_class_bindings (parms
,
14906 spec_args
= add_to_template_args (outer_args
, spec_args
);
14907 list
= tree_cons (spec_args
, TREE_VALUE (t
), list
);
14908 TREE_TYPE (list
) = TREE_TYPE (t
);
14915 ambiguous_p
= false;
14918 t
= TREE_CHAIN (t
);
14919 for (; t
; t
= TREE_CHAIN (t
))
14921 fate
= more_specialized_class (champ
, t
);
14928 t
= TREE_CHAIN (t
);
14931 ambiguous_p
= true;
14940 for (t
= list
; t
&& t
!= champ
; t
= TREE_CHAIN (t
))
14942 fate
= more_specialized_class (champ
, t
);
14945 ambiguous_p
= true;
14952 const char *str
= "candidates are:";
14953 error ("ambiguous class template instantiation for %q#T", type
);
14954 for (t
= list
; t
; t
= TREE_CHAIN (t
))
14956 error ("%s %+#T", str
, TREE_TYPE (t
));
14959 return error_mark_node
;
14965 /* Explicitly instantiate DECL. */
14968 do_decl_instantiation (tree decl
, tree storage
)
14970 tree result
= NULL_TREE
;
14973 if (!decl
|| decl
== error_mark_node
)
14974 /* An error occurred, for which grokdeclarator has already issued
14975 an appropriate message. */
14977 else if (! DECL_LANG_SPECIFIC (decl
))
14979 error ("explicit instantiation of non-template %q#D", decl
);
14982 else if (TREE_CODE (decl
) == VAR_DECL
)
14984 /* There is an asymmetry here in the way VAR_DECLs and
14985 FUNCTION_DECLs are handled by grokdeclarator. In the case of
14986 the latter, the DECL we get back will be marked as a
14987 template instantiation, and the appropriate
14988 DECL_TEMPLATE_INFO will be set up. This does not happen for
14989 VAR_DECLs so we do the lookup here. Probably, grokdeclarator
14990 should handle VAR_DECLs as it currently handles
14992 if (!DECL_CLASS_SCOPE_P (decl
))
14994 error ("%qD is not a static data member of a class template", decl
);
14997 result
= lookup_field (DECL_CONTEXT (decl
), DECL_NAME (decl
), 0, false);
14998 if (!result
|| TREE_CODE (result
) != VAR_DECL
)
15000 error ("no matching template for %qD found", decl
);
15003 if (!same_type_p (TREE_TYPE (result
), TREE_TYPE (decl
)))
15005 error ("type %qT for explicit instantiation %qD does not match "
15006 "declared type %qT", TREE_TYPE (result
), decl
,
15011 else if (TREE_CODE (decl
) != FUNCTION_DECL
)
15013 error ("explicit instantiation of %q#D", decl
);
15019 /* Check for various error cases. Note that if the explicit
15020 instantiation is valid the RESULT will currently be marked as an
15021 *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set
15022 until we get here. */
15024 if (DECL_TEMPLATE_SPECIALIZATION (result
))
15026 /* DR 259 [temp.spec].
15028 Both an explicit instantiation and a declaration of an explicit
15029 specialization shall not appear in a program unless the explicit
15030 instantiation follows a declaration of the explicit specialization.
15032 For a given set of template parameters, if an explicit
15033 instantiation of a template appears after a declaration of an
15034 explicit specialization for that template, the explicit
15035 instantiation has no effect. */
15038 else if (DECL_EXPLICIT_INSTANTIATION (result
))
15042 No program shall explicitly instantiate any template more
15045 We check DECL_NOT_REALLY_EXTERN so as not to complain when
15046 the first instantiation was `extern' and the second is not,
15047 and EXTERN_P for the opposite case. */
15048 if (DECL_NOT_REALLY_EXTERN (result
) && !extern_p
)
15049 permerror (input_location
, "duplicate explicit instantiation of %q#D", result
);
15050 /* If an "extern" explicit instantiation follows an ordinary
15051 explicit instantiation, the template is instantiated. */
15055 else if (!DECL_IMPLICIT_INSTANTIATION (result
))
15057 error ("no matching template for %qD found", result
);
15060 else if (!DECL_TEMPLATE_INFO (result
))
15062 permerror (input_location
, "explicit instantiation of non-template %q#D", result
);
15066 if (storage
== NULL_TREE
)
15068 else if (storage
== ridpointers
[(int) RID_EXTERN
])
15070 if (!in_system_header
&& (cxx_dialect
== cxx98
))
15071 pedwarn (input_location
, OPT_pedantic
,
15072 "ISO C++ 1998 forbids the use of %<extern%> on explicit "
15077 error ("storage class %qD applied to template instantiation", storage
);
15079 check_explicit_instantiation_namespace (result
);
15080 mark_decl_instantiated (result
, extern_p
);
15082 instantiate_decl (result
, /*defer_ok=*/1,
15083 /*expl_inst_class_mem_p=*/false);
15087 mark_class_instantiated (tree t
, int extern_p
)
15089 SET_CLASSTYPE_EXPLICIT_INSTANTIATION (t
);
15090 SET_CLASSTYPE_INTERFACE_KNOWN (t
);
15091 CLASSTYPE_INTERFACE_ONLY (t
) = extern_p
;
15092 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (t
)) = extern_p
;
15095 CLASSTYPE_DEBUG_REQUESTED (t
) = 1;
15096 rest_of_type_compilation (t
, 1);
15100 /* Called from do_type_instantiation through binding_table_foreach to
15101 do recursive instantiation for the type bound in ENTRY. */
15103 bt_instantiate_type_proc (binding_entry entry
, void *data
)
15105 tree storage
= *(tree
*) data
;
15107 if (MAYBE_CLASS_TYPE_P (entry
->type
)
15108 && !uses_template_parms (CLASSTYPE_TI_ARGS (entry
->type
)))
15109 do_type_instantiation (TYPE_MAIN_DECL (entry
->type
), storage
, 0);
15112 /* Called from do_type_instantiation to instantiate a member
15113 (a member function or a static member variable) of an
15114 explicitly instantiated class template. */
15116 instantiate_class_member (tree decl
, int extern_p
)
15118 mark_decl_instantiated (decl
, extern_p
);
15120 instantiate_decl (decl
, /*defer_ok=*/1,
15121 /*expl_inst_class_mem_p=*/true);
15124 /* Perform an explicit instantiation of template class T. STORAGE, if
15125 non-null, is the RID for extern, inline or static. COMPLAIN is
15126 nonzero if this is called from the parser, zero if called recursively,
15127 since the standard is unclear (as detailed below). */
15130 do_type_instantiation (tree t
, tree storage
, tsubst_flags_t complain
)
15135 int previous_instantiation_extern_p
= 0;
15137 if (TREE_CODE (t
) == TYPE_DECL
)
15140 if (! CLASS_TYPE_P (t
) || ! CLASSTYPE_TEMPLATE_INFO (t
))
15142 error ("explicit instantiation of non-template type %qT", t
);
15148 if (!COMPLETE_TYPE_P (t
))
15150 if (complain
& tf_error
)
15151 error ("explicit instantiation of %q#T before definition of template",
15156 if (storage
!= NULL_TREE
)
15158 if (!in_system_header
)
15160 if (storage
== ridpointers
[(int) RID_EXTERN
])
15162 if (cxx_dialect
== cxx98
)
15163 pedwarn (input_location
, OPT_pedantic
,
15164 "ISO C++ 1998 forbids the use of %<extern%> on "
15165 "explicit instantiations");
15168 pedwarn (input_location
, OPT_pedantic
,
15169 "ISO C++ forbids the use of %qE"
15170 " on explicit instantiations", storage
);
15173 if (storage
== ridpointers
[(int) RID_INLINE
])
15175 else if (storage
== ridpointers
[(int) RID_EXTERN
])
15177 else if (storage
== ridpointers
[(int) RID_STATIC
])
15181 error ("storage class %qD applied to template instantiation",
15187 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
15189 /* DR 259 [temp.spec].
15191 Both an explicit instantiation and a declaration of an explicit
15192 specialization shall not appear in a program unless the explicit
15193 instantiation follows a declaration of the explicit specialization.
15195 For a given set of template parameters, if an explicit
15196 instantiation of a template appears after a declaration of an
15197 explicit specialization for that template, the explicit
15198 instantiation has no effect. */
15201 else if (CLASSTYPE_EXPLICIT_INSTANTIATION (t
))
15205 No program shall explicitly instantiate any template more
15208 If PREVIOUS_INSTANTIATION_EXTERN_P, then the first explicit
15209 instantiation was `extern'. If EXTERN_P then the second is.
15210 These cases are OK. */
15211 previous_instantiation_extern_p
= CLASSTYPE_INTERFACE_ONLY (t
);
15213 if (!previous_instantiation_extern_p
&& !extern_p
15214 && (complain
& tf_error
))
15215 permerror (input_location
, "duplicate explicit instantiation of %q#T", t
);
15217 /* If we've already instantiated the template, just return now. */
15218 if (!CLASSTYPE_INTERFACE_ONLY (t
))
15222 check_explicit_instantiation_namespace (TYPE_NAME (t
));
15223 mark_class_instantiated (t
, extern_p
);
15231 /* In contrast to implicit instantiation, where only the
15232 declarations, and not the definitions, of members are
15233 instantiated, we have here:
15237 The explicit instantiation of a class template specialization
15238 implies the instantiation of all of its members not
15239 previously explicitly specialized in the translation unit
15240 containing the explicit instantiation.
15242 Of course, we can't instantiate member template classes, since
15243 we don't have any arguments for them. Note that the standard
15244 is unclear on whether the instantiation of the members are
15245 *explicit* instantiations or not. However, the most natural
15246 interpretation is that it should be an explicit instantiation. */
15249 for (tmp
= TYPE_METHODS (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
15250 if (TREE_CODE (tmp
) == FUNCTION_DECL
15251 && DECL_TEMPLATE_INSTANTIATION (tmp
))
15252 instantiate_class_member (tmp
, extern_p
);
15254 for (tmp
= TYPE_FIELDS (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
15255 if (TREE_CODE (tmp
) == VAR_DECL
&& DECL_TEMPLATE_INSTANTIATION (tmp
))
15256 instantiate_class_member (tmp
, extern_p
);
15258 if (CLASSTYPE_NESTED_UTDS (t
))
15259 binding_table_foreach (CLASSTYPE_NESTED_UTDS (t
),
15260 bt_instantiate_type_proc
, &storage
);
15264 /* Given a function DECL, which is a specialization of TMPL, modify
15265 DECL to be a re-instantiation of TMPL with the same template
15266 arguments. TMPL should be the template into which tsubst'ing
15267 should occur for DECL, not the most general template.
15269 One reason for doing this is a scenario like this:
15272 void f(const T&, int i);
15274 void g() { f(3, 7); }
15277 void f(const T& t, const int i) { }
15279 Note that when the template is first instantiated, with
15280 instantiate_template, the resulting DECL will have no name for the
15281 first parameter, and the wrong type for the second. So, when we go
15282 to instantiate the DECL, we regenerate it. */
15285 regenerate_decl_from_template (tree decl
, tree tmpl
)
15287 /* The arguments used to instantiate DECL, from the most general
15292 args
= DECL_TI_ARGS (decl
);
15293 code_pattern
= DECL_TEMPLATE_RESULT (tmpl
);
15295 /* Make sure that we can see identifiers, and compute access
15297 push_access_scope (decl
);
15299 if (TREE_CODE (decl
) == FUNCTION_DECL
)
15307 args_depth
= TMPL_ARGS_DEPTH (args
);
15308 parms_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
15309 if (args_depth
> parms_depth
)
15310 args
= get_innermost_template_args (args
, parms_depth
);
15312 specs
= tsubst_exception_specification (TREE_TYPE (code_pattern
),
15313 args
, tf_error
, NULL_TREE
);
15315 TREE_TYPE (decl
) = build_exception_variant (TREE_TYPE (decl
),
15318 /* Merge parameter declarations. */
15319 decl_parm
= skip_artificial_parms_for (decl
,
15320 DECL_ARGUMENTS (decl
));
15322 = skip_artificial_parms_for (code_pattern
,
15323 DECL_ARGUMENTS (code_pattern
));
15324 while (decl_parm
&& !FUNCTION_PARAMETER_PACK_P (pattern_parm
))
15329 if (DECL_NAME (decl_parm
) != DECL_NAME (pattern_parm
))
15330 DECL_NAME (decl_parm
) = DECL_NAME (pattern_parm
);
15331 parm_type
= tsubst (TREE_TYPE (pattern_parm
), args
, tf_error
,
15333 parm_type
= type_decays_to (parm_type
);
15334 if (!same_type_p (TREE_TYPE (decl_parm
), parm_type
))
15335 TREE_TYPE (decl_parm
) = parm_type
;
15336 attributes
= DECL_ATTRIBUTES (pattern_parm
);
15337 if (DECL_ATTRIBUTES (decl_parm
) != attributes
)
15339 DECL_ATTRIBUTES (decl_parm
) = attributes
;
15340 cplus_decl_attributes (&decl_parm
, attributes
, /*flags=*/0);
15342 decl_parm
= TREE_CHAIN (decl_parm
);
15343 pattern_parm
= TREE_CHAIN (pattern_parm
);
15345 /* Merge any parameters that match with the function parameter
15347 if (pattern_parm
&& FUNCTION_PARAMETER_PACK_P (pattern_parm
))
15350 tree expanded_types
;
15351 /* Expand the TYPE_PACK_EXPANSION that provides the types for
15352 the parameters in this function parameter pack. */
15353 expanded_types
= tsubst_pack_expansion (TREE_TYPE (pattern_parm
),
15354 args
, tf_error
, NULL_TREE
);
15355 len
= TREE_VEC_LENGTH (expanded_types
);
15356 for (i
= 0; i
< len
; i
++)
15361 if (DECL_NAME (decl_parm
) != DECL_NAME (pattern_parm
))
15362 /* Rename the parameter to include the index. */
15363 DECL_NAME (decl_parm
) =
15364 make_ith_pack_parameter_name (DECL_NAME (pattern_parm
), i
);
15365 parm_type
= TREE_VEC_ELT (expanded_types
, i
);
15366 parm_type
= type_decays_to (parm_type
);
15367 if (!same_type_p (TREE_TYPE (decl_parm
), parm_type
))
15368 TREE_TYPE (decl_parm
) = parm_type
;
15369 attributes
= DECL_ATTRIBUTES (pattern_parm
);
15370 if (DECL_ATTRIBUTES (decl_parm
) != attributes
)
15372 DECL_ATTRIBUTES (decl_parm
) = attributes
;
15373 cplus_decl_attributes (&decl_parm
, attributes
, /*flags=*/0);
15375 decl_parm
= TREE_CHAIN (decl_parm
);
15378 /* Merge additional specifiers from the CODE_PATTERN. */
15379 if (DECL_DECLARED_INLINE_P (code_pattern
)
15380 && !DECL_DECLARED_INLINE_P (decl
))
15381 DECL_DECLARED_INLINE_P (decl
) = 1;
15383 else if (TREE_CODE (decl
) == VAR_DECL
)
15384 DECL_INITIAL (decl
) =
15385 tsubst_expr (DECL_INITIAL (code_pattern
), args
,
15386 tf_error
, DECL_TI_TEMPLATE (decl
),
15387 /*integral_constant_expression_p=*/false);
15389 gcc_unreachable ();
15391 pop_access_scope (decl
);
15394 /* Return the TEMPLATE_DECL into which DECL_TI_ARGS(DECL) should be
15395 substituted to get DECL. */
15398 template_for_substitution (tree decl
)
15400 tree tmpl
= DECL_TI_TEMPLATE (decl
);
15402 /* Set TMPL to the template whose DECL_TEMPLATE_RESULT is the pattern
15403 for the instantiation. This is not always the most general
15404 template. Consider, for example:
15407 struct S { template <class U> void f();
15408 template <> void f<int>(); };
15410 and an instantiation of S<double>::f<int>. We want TD to be the
15411 specialization S<T>::f<int>, not the more general S<T>::f<U>. */
15412 while (/* An instantiation cannot have a definition, so we need a
15413 more general template. */
15414 DECL_TEMPLATE_INSTANTIATION (tmpl
)
15415 /* We must also deal with friend templates. Given:
15417 template <class T> struct S {
15418 template <class U> friend void f() {};
15421 S<int>::f<U> say, is not an instantiation of S<T>::f<U>,
15422 so far as the language is concerned, but that's still
15423 where we get the pattern for the instantiation from. On
15424 other hand, if the definition comes outside the class, say:
15426 template <class T> struct S {
15427 template <class U> friend void f();
15429 template <class U> friend void f() {}
15431 we don't need to look any further. That's what the check for
15432 DECL_INITIAL is for. */
15433 || (TREE_CODE (decl
) == FUNCTION_DECL
15434 && DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (tmpl
)
15435 && !DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl
))))
15437 /* The present template, TD, should not be a definition. If it
15438 were a definition, we should be using it! Note that we
15439 cannot restructure the loop to just keep going until we find
15440 a template with a definition, since that might go too far if
15441 a specialization was declared, but not defined. */
15442 gcc_assert (TREE_CODE (decl
) != VAR_DECL
15443 || DECL_IN_AGGR_P (DECL_TEMPLATE_RESULT (tmpl
)));
15445 /* Fetch the more general template. */
15446 tmpl
= DECL_TI_TEMPLATE (tmpl
);
15452 /* Produce the definition of D, a _DECL generated from a template. If
15453 DEFER_OK is nonzero, then we don't have to actually do the
15454 instantiation now; we just have to do it sometime. Normally it is
15455 an error if this is an explicit instantiation but D is undefined.
15456 EXPL_INST_CLASS_MEM_P is true iff D is a member of an
15457 explicitly instantiated class template. */
15460 instantiate_decl (tree d
, int defer_ok
,
15461 bool expl_inst_class_mem_p
)
15463 tree tmpl
= DECL_TI_TEMPLATE (d
);
15470 bool pattern_defined
;
15472 location_t saved_loc
= input_location
;
15475 /* This function should only be used to instantiate templates for
15476 functions and static member variables. */
15477 gcc_assert (TREE_CODE (d
) == FUNCTION_DECL
15478 || TREE_CODE (d
) == VAR_DECL
);
15480 /* Variables are never deferred; if instantiation is required, they
15481 are instantiated right away. That allows for better code in the
15482 case that an expression refers to the value of the variable --
15483 if the variable has a constant value the referring expression can
15484 take advantage of that fact. */
15485 if (TREE_CODE (d
) == VAR_DECL
)
15488 /* Don't instantiate cloned functions. Instead, instantiate the
15489 functions they cloned. */
15490 if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_CLONED_FUNCTION_P (d
))
15491 d
= DECL_CLONED_FUNCTION (d
);
15493 if (DECL_TEMPLATE_INSTANTIATED (d
))
15494 /* D has already been instantiated. It might seem reasonable to
15495 check whether or not D is an explicit instantiation, and, if so,
15496 stop here. But when an explicit instantiation is deferred
15497 until the end of the compilation, DECL_EXPLICIT_INSTANTIATION
15498 is set, even though we still need to do the instantiation. */
15501 /* If we already have a specialization of this declaration, then
15502 there's no reason to instantiate it. Note that
15503 retrieve_specialization gives us both instantiations and
15504 specializations, so we must explicitly check
15505 DECL_TEMPLATE_SPECIALIZATION. */
15506 gen_tmpl
= most_general_template (tmpl
);
15507 gen_args
= DECL_TI_ARGS (d
);
15508 spec
= retrieve_specialization (gen_tmpl
, gen_args
,
15509 /*class_specializations_p=*/false);
15510 if (spec
!= NULL_TREE
&& DECL_TEMPLATE_SPECIALIZATION (spec
))
15513 /* This needs to happen before any tsubsting. */
15514 if (! push_tinst_level (d
))
15517 timevar_push (TV_PARSE
);
15519 /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern
15520 for the instantiation. */
15521 td
= template_for_substitution (d
);
15522 code_pattern
= DECL_TEMPLATE_RESULT (td
);
15524 /* We should never be trying to instantiate a member of a class
15525 template or partial specialization. */
15526 gcc_assert (d
!= code_pattern
);
15528 if ((DECL_NAMESPACE_SCOPE_P (d
) && !DECL_INITIALIZED_IN_CLASS_P (d
))
15529 || DECL_TEMPLATE_SPECIALIZATION (td
))
15530 /* In the case of a friend template whose definition is provided
15531 outside the class, we may have too many arguments. Drop the
15532 ones we don't need. The same is true for specializations. */
15533 args
= get_innermost_template_args
15534 (gen_args
, TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (td
)));
15538 if (TREE_CODE (d
) == FUNCTION_DECL
)
15539 pattern_defined
= (DECL_SAVED_TREE (code_pattern
) != NULL_TREE
);
15541 pattern_defined
= ! DECL_IN_AGGR_P (code_pattern
);
15543 /* We may be in the middle of deferred access check. Disable it now. */
15544 push_deferring_access_checks (dk_no_deferred
);
15546 /* Unless an explicit instantiation directive has already determined
15547 the linkage of D, remember that a definition is available for
15549 if (pattern_defined
15550 && !DECL_INTERFACE_KNOWN (d
)
15551 && !DECL_NOT_REALLY_EXTERN (d
))
15552 mark_definable (d
);
15554 input_location
= DECL_SOURCE_LOCATION (d
);
15556 /* If D is a member of an explicitly instantiated class template,
15557 and no definition is available, treat it like an implicit
15559 if (!pattern_defined
&& expl_inst_class_mem_p
15560 && DECL_EXPLICIT_INSTANTIATION (d
))
15562 DECL_NOT_REALLY_EXTERN (d
) = 0;
15563 DECL_INTERFACE_KNOWN (d
) = 0;
15564 SET_DECL_IMPLICIT_INSTANTIATION (d
);
15569 /* Recheck the substitutions to obtain any warning messages
15570 about ignoring cv qualifiers. */
15571 tree gen
= DECL_TEMPLATE_RESULT (gen_tmpl
);
15572 tree type
= TREE_TYPE (gen
);
15574 /* Make sure that we can see identifiers, and compute access
15575 correctly. D is already the target FUNCTION_DECL with the
15577 push_access_scope (d
);
15579 if (TREE_CODE (gen
) == FUNCTION_DECL
)
15581 tsubst (DECL_ARGUMENTS (gen
), gen_args
, tf_warning_or_error
, d
);
15582 tsubst_exception_specification (type
, gen_args
, tf_warning_or_error
,
15584 /* Don't simply tsubst the function type, as that will give
15585 duplicate warnings about poor parameter qualifications.
15586 The function arguments are the same as the decl_arguments
15587 without the top level cv qualifiers. */
15588 type
= TREE_TYPE (type
);
15590 tsubst (type
, gen_args
, tf_warning_or_error
, d
);
15592 pop_access_scope (d
);
15595 /* Check to see whether we know that this template will be
15596 instantiated in some other file, as with "extern template"
15598 external_p
= (DECL_INTERFACE_KNOWN (d
) && DECL_REALLY_EXTERN (d
));
15599 /* In general, we do not instantiate such templates... */
15601 /* ... but we instantiate inline functions so that we can inline
15602 them. An explicit instantiation declaration prohibits implicit
15603 instantiation of non-inline functions. With high levels of
15604 optimization, we would normally inline non-inline functions
15605 -- but we're not allowed to do that for "extern template" functions.
15606 Therefore, we check DECL_DECLARED_INLINE_P, rather than
15607 possibly_inlined_p. And ... */
15608 && ! (TREE_CODE (d
) == FUNCTION_DECL
15609 && DECL_DECLARED_INLINE_P (d
))
15610 /* ... we instantiate static data members whose values are
15611 needed in integral constant expressions. */
15612 && ! (TREE_CODE (d
) == VAR_DECL
15613 && DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (d
)))
15615 /* Defer all other templates, unless we have been explicitly
15616 forbidden from doing so. */
15617 if (/* If there is no definition, we cannot instantiate the
15620 /* If it's OK to postpone instantiation, do so. */
15622 /* If this is a static data member that will be defined
15623 elsewhere, we don't want to instantiate the entire data
15624 member, but we do want to instantiate the initializer so that
15625 we can substitute that elsewhere. */
15626 || (external_p
&& TREE_CODE (d
) == VAR_DECL
))
15628 /* The definition of the static data member is now required so
15629 we must substitute the initializer. */
15630 if (TREE_CODE (d
) == VAR_DECL
15631 && !DECL_INITIAL (d
)
15632 && DECL_INITIAL (code_pattern
))
15637 ns
= decl_namespace_context (d
);
15638 push_nested_namespace (ns
);
15639 push_nested_class (DECL_CONTEXT (d
));
15640 init
= tsubst_expr (DECL_INITIAL (code_pattern
),
15642 tf_warning_or_error
, NULL_TREE
,
15643 /*integral_constant_expression_p=*/false);
15644 cp_finish_decl (d
, init
, /*init_const_expr_p=*/false,
15645 /*asmspec_tree=*/NULL_TREE
,
15646 LOOKUP_ONLYCONVERTING
);
15647 pop_nested_class ();
15648 pop_nested_namespace (ns
);
15651 /* We restore the source position here because it's used by
15652 add_pending_template. */
15653 input_location
= saved_loc
;
15655 if (at_eof
&& !pattern_defined
15656 && DECL_EXPLICIT_INSTANTIATION (d
)
15657 && DECL_NOT_REALLY_EXTERN (d
))
15660 The definition of a non-exported function template, a
15661 non-exported member function template, or a non-exported
15662 member function or static data member of a class template
15663 shall be present in every translation unit in which it is
15664 explicitly instantiated. */
15665 permerror (input_location
, "explicit instantiation of %qD "
15666 "but no definition available", d
);
15668 /* ??? Historically, we have instantiated inline functions, even
15669 when marked as "extern template". */
15670 if (!(external_p
&& TREE_CODE (d
) == VAR_DECL
))
15671 add_pending_template (d
);
15674 /* Tell the repository that D is available in this translation unit
15675 -- and see if it is supposed to be instantiated here. */
15676 if (TREE_PUBLIC (d
) && !DECL_REALLY_EXTERN (d
) && !repo_emit_p (d
))
15678 /* In a PCH file, despite the fact that the repository hasn't
15679 requested instantiation in the PCH it is still possible that
15680 an instantiation will be required in a file that includes the
15683 add_pending_template (d
);
15684 /* Instantiate inline functions so that the inliner can do its
15685 job, even though we'll not be emitting a copy of this
15687 if (!(TREE_CODE (d
) == FUNCTION_DECL
&& possibly_inlined_p (d
)))
15691 need_push
= !cfun
|| !global_bindings_p ();
15693 push_to_top_level ();
15695 /* Mark D as instantiated so that recursive calls to
15696 instantiate_decl do not try to instantiate it again. */
15697 DECL_TEMPLATE_INSTANTIATED (d
) = 1;
15699 /* Regenerate the declaration in case the template has been modified
15700 by a subsequent redeclaration. */
15701 regenerate_decl_from_template (d
, td
);
15703 /* We already set the file and line above. Reset them now in case
15704 they changed as a result of calling regenerate_decl_from_template. */
15705 input_location
= DECL_SOURCE_LOCATION (d
);
15707 if (TREE_CODE (d
) == VAR_DECL
)
15711 /* Clear out DECL_RTL; whatever was there before may not be right
15712 since we've reset the type of the declaration. */
15713 SET_DECL_RTL (d
, NULL_RTX
);
15714 DECL_IN_AGGR_P (d
) = 0;
15716 /* The initializer is placed in DECL_INITIAL by
15717 regenerate_decl_from_template. Pull it out so that
15718 finish_decl can process it. */
15719 init
= DECL_INITIAL (d
);
15720 DECL_INITIAL (d
) = NULL_TREE
;
15721 DECL_INITIALIZED_P (d
) = 0;
15723 /* Clear DECL_EXTERNAL so that cp_finish_decl will process the
15724 initializer. That function will defer actual emission until
15725 we have a chance to determine linkage. */
15726 DECL_EXTERNAL (d
) = 0;
15728 /* Enter the scope of D so that access-checking works correctly. */
15729 push_nested_class (DECL_CONTEXT (d
));
15730 finish_decl (d
, init
, NULL_TREE
, NULL_TREE
);
15731 pop_nested_class ();
15733 else if (TREE_CODE (d
) == FUNCTION_DECL
)
15735 htab_t saved_local_specializations
;
15740 /* Save away the current list, in case we are instantiating one
15741 template from within the body of another. */
15742 saved_local_specializations
= local_specializations
;
15744 /* Set up the list of local specializations. */
15745 local_specializations
= htab_create (37,
15746 hash_local_specialization
,
15747 eq_local_specializations
,
15750 /* Set up context. */
15751 start_preparsed_function (d
, NULL_TREE
, SF_PRE_PARSED
);
15753 /* Create substitution entries for the parameters. */
15754 subst_decl
= DECL_TEMPLATE_RESULT (template_for_substitution (d
));
15755 tmpl_parm
= DECL_ARGUMENTS (subst_decl
);
15756 spec_parm
= DECL_ARGUMENTS (d
);
15757 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (d
))
15759 register_local_specialization (spec_parm
, tmpl_parm
);
15760 spec_parm
= skip_artificial_parms_for (d
, spec_parm
);
15761 tmpl_parm
= skip_artificial_parms_for (subst_decl
, tmpl_parm
);
15763 while (tmpl_parm
&& !FUNCTION_PARAMETER_PACK_P (tmpl_parm
))
15765 register_local_specialization (spec_parm
, tmpl_parm
);
15766 tmpl_parm
= TREE_CHAIN (tmpl_parm
);
15767 spec_parm
= TREE_CHAIN (spec_parm
);
15769 if (tmpl_parm
&& FUNCTION_PARAMETER_PACK_P (tmpl_parm
))
15771 /* Register the (value) argument pack as a specialization of
15772 TMPL_PARM, then move on. */
15773 tree argpack
= make_fnparm_pack (spec_parm
);
15774 register_local_specialization (argpack
, tmpl_parm
);
15775 tmpl_parm
= TREE_CHAIN (tmpl_parm
);
15776 spec_parm
= NULL_TREE
;
15778 gcc_assert (!spec_parm
);
15780 /* Substitute into the body of the function. */
15781 tsubst_expr (DECL_SAVED_TREE (code_pattern
), args
,
15782 tf_warning_or_error
, tmpl
,
15783 /*integral_constant_expression_p=*/false);
15785 /* Set the current input_location to the end of the function
15786 so that finish_function knows where we are. */
15787 input_location
= DECL_STRUCT_FUNCTION (code_pattern
)->function_end_locus
;
15789 /* We don't need the local specializations any more. */
15790 htab_delete (local_specializations
);
15791 local_specializations
= saved_local_specializations
;
15793 /* Finish the function. */
15794 d
= finish_function (0);
15795 expand_or_defer_fn (d
);
15798 /* We're not deferring instantiation any more. */
15799 TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (d
)) = 0;
15802 pop_from_top_level ();
15805 input_location
= saved_loc
;
15806 pop_deferring_access_checks ();
15807 pop_tinst_level ();
15809 timevar_pop (TV_PARSE
);
15814 /* Run through the list of templates that we wish we could
15815 instantiate, and instantiate any we can. RETRIES is the
15816 number of times we retry pending template instantiation. */
15819 instantiate_pending_templates (int retries
)
15822 location_t saved_loc
= input_location
;
15824 /* Instantiating templates may trigger vtable generation. This in turn
15825 may require further template instantiations. We place a limit here
15826 to avoid infinite loop. */
15827 if (pending_templates
&& retries
>= max_tinst_depth
)
15829 tree decl
= pending_templates
->tinst
->decl
;
15831 error ("template instantiation depth exceeds maximum of %d"
15832 " instantiating %q+D, possibly from virtual table generation"
15833 " (use -ftemplate-depth-NN to increase the maximum)",
15834 max_tinst_depth
, decl
);
15835 if (TREE_CODE (decl
) == FUNCTION_DECL
)
15836 /* Pretend that we defined it. */
15837 DECL_INITIAL (decl
) = error_mark_node
;
15843 struct pending_template
**t
= &pending_templates
;
15844 struct pending_template
*last
= NULL
;
15848 tree instantiation
= reopen_tinst_level ((*t
)->tinst
);
15849 bool complete
= false;
15851 if (TYPE_P (instantiation
))
15855 if (!COMPLETE_TYPE_P (instantiation
))
15857 instantiate_class_template (instantiation
);
15858 if (CLASSTYPE_TEMPLATE_INSTANTIATION (instantiation
))
15859 for (fn
= TYPE_METHODS (instantiation
);
15861 fn
= TREE_CHAIN (fn
))
15862 if (! DECL_ARTIFICIAL (fn
))
15863 instantiate_decl (fn
,
15865 /*expl_inst_class_mem_p=*/false);
15866 if (COMPLETE_TYPE_P (instantiation
))
15870 complete
= COMPLETE_TYPE_P (instantiation
);
15874 if (!DECL_TEMPLATE_SPECIALIZATION (instantiation
)
15875 && !DECL_TEMPLATE_INSTANTIATED (instantiation
))
15878 = instantiate_decl (instantiation
,
15880 /*expl_inst_class_mem_p=*/false);
15881 if (DECL_TEMPLATE_INSTANTIATED (instantiation
))
15885 complete
= (DECL_TEMPLATE_SPECIALIZATION (instantiation
)
15886 || DECL_TEMPLATE_INSTANTIATED (instantiation
));
15890 /* If INSTANTIATION has been instantiated, then we don't
15891 need to consider it again in the future. */
15899 current_tinst_level
= NULL
;
15901 last_pending_template
= last
;
15903 while (reconsider
);
15905 input_location
= saved_loc
;
15908 /* Substitute ARGVEC into T, which is a list of initializers for
15909 either base class or a non-static data member. The TREE_PURPOSEs
15910 are DECLs, and the TREE_VALUEs are the initializer values. Used by
15911 instantiate_decl. */
15914 tsubst_initializer_list (tree t
, tree argvec
)
15916 tree inits
= NULL_TREE
;
15918 for (; t
; t
= TREE_CHAIN (t
))
15922 tree expanded_bases
= NULL_TREE
;
15923 tree expanded_arguments
= NULL_TREE
;
15926 if (TREE_CODE (TREE_PURPOSE (t
)) == TYPE_PACK_EXPANSION
)
15931 /* Expand the base class expansion type into separate base
15933 expanded_bases
= tsubst_pack_expansion (TREE_PURPOSE (t
), argvec
,
15934 tf_warning_or_error
,
15936 if (expanded_bases
== error_mark_node
)
15939 /* We'll be building separate TREE_LISTs of arguments for
15941 len
= TREE_VEC_LENGTH (expanded_bases
);
15942 expanded_arguments
= make_tree_vec (len
);
15943 for (i
= 0; i
< len
; i
++)
15944 TREE_VEC_ELT (expanded_arguments
, i
) = NULL_TREE
;
15946 /* Build a dummy EXPR_PACK_EXPANSION that will be used to
15947 expand each argument in the TREE_VALUE of t. */
15948 expr
= make_node (EXPR_PACK_EXPANSION
);
15949 PACK_EXPANSION_PARAMETER_PACKS (expr
) =
15950 PACK_EXPANSION_PARAMETER_PACKS (TREE_PURPOSE (t
));
15952 if (TREE_VALUE (t
) == void_type_node
)
15953 /* VOID_TYPE_NODE is used to indicate
15954 value-initialization. */
15956 for (i
= 0; i
< len
; i
++)
15957 TREE_VEC_ELT (expanded_arguments
, i
) = void_type_node
;
15961 /* Substitute parameter packs into each argument in the
15963 in_base_initializer
= 1;
15964 for (arg
= TREE_VALUE (t
); arg
; arg
= TREE_CHAIN (arg
))
15966 tree expanded_exprs
;
15968 /* Expand the argument. */
15969 SET_PACK_EXPANSION_PATTERN (expr
, TREE_VALUE (arg
));
15971 = tsubst_pack_expansion (expr
, argvec
,
15972 tf_warning_or_error
,
15974 if (expanded_exprs
== error_mark_node
)
15977 /* Prepend each of the expanded expressions to the
15978 corresponding TREE_LIST in EXPANDED_ARGUMENTS. */
15979 for (i
= 0; i
< len
; i
++)
15981 TREE_VEC_ELT (expanded_arguments
, i
) =
15982 tree_cons (NULL_TREE
,
15983 TREE_VEC_ELT (expanded_exprs
, i
),
15984 TREE_VEC_ELT (expanded_arguments
, i
));
15987 in_base_initializer
= 0;
15989 /* Reverse all of the TREE_LISTs in EXPANDED_ARGUMENTS,
15990 since we built them backwards. */
15991 for (i
= 0; i
< len
; i
++)
15993 TREE_VEC_ELT (expanded_arguments
, i
) =
15994 nreverse (TREE_VEC_ELT (expanded_arguments
, i
));
15999 for (i
= 0; i
< len
; ++i
)
16001 if (expanded_bases
)
16003 decl
= TREE_VEC_ELT (expanded_bases
, i
);
16004 decl
= expand_member_init (decl
);
16005 init
= TREE_VEC_ELT (expanded_arguments
, i
);
16009 decl
= tsubst_copy (TREE_PURPOSE (t
), argvec
,
16010 tf_warning_or_error
, NULL_TREE
);
16012 decl
= expand_member_init (decl
);
16013 if (decl
&& !DECL_P (decl
))
16014 in_base_initializer
= 1;
16016 init
= tsubst_expr (TREE_VALUE (t
), argvec
,
16017 tf_warning_or_error
, NULL_TREE
,
16018 /*integral_constant_expression_p=*/false);
16019 in_base_initializer
= 0;
16024 init
= build_tree_list (decl
, init
);
16025 TREE_CHAIN (init
) = inits
;
16033 /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */
16036 set_current_access_from_decl (tree decl
)
16038 if (TREE_PRIVATE (decl
))
16039 current_access_specifier
= access_private_node
;
16040 else if (TREE_PROTECTED (decl
))
16041 current_access_specifier
= access_protected_node
;
16043 current_access_specifier
= access_public_node
;
16046 /* Instantiate an enumerated type. TAG is the template type, NEWTAG
16047 is the instantiation (which should have been created with
16048 start_enum) and ARGS are the template arguments to use. */
16051 tsubst_enum (tree tag
, tree newtag
, tree args
)
16055 for (e
= TYPE_VALUES (tag
); e
; e
= TREE_CHAIN (e
))
16060 decl
= TREE_VALUE (e
);
16061 /* Note that in a template enum, the TREE_VALUE is the
16062 CONST_DECL, not the corresponding INTEGER_CST. */
16063 value
= tsubst_expr (DECL_INITIAL (decl
),
16064 args
, tf_warning_or_error
, NULL_TREE
,
16065 /*integral_constant_expression_p=*/true);
16067 /* Give this enumeration constant the correct access. */
16068 set_current_access_from_decl (decl
);
16070 /* Actually build the enumerator itself. */
16071 build_enumerator (DECL_NAME (decl
), value
, newtag
);
16074 finish_enum (newtag
);
16075 DECL_SOURCE_LOCATION (TYPE_NAME (newtag
))
16076 = DECL_SOURCE_LOCATION (TYPE_NAME (tag
));
16079 /* DECL is a FUNCTION_DECL that is a template specialization. Return
16080 its type -- but without substituting the innermost set of template
16081 arguments. So, innermost set of template parameters will appear in
16085 get_mostly_instantiated_function_type (tree decl
)
16093 tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
16094 targs
= DECL_TI_ARGS (decl
);
16095 tparms
= DECL_TEMPLATE_PARMS (tmpl
);
16096 parm_depth
= TMPL_PARMS_DEPTH (tparms
);
16098 /* There should be as many levels of arguments as there are levels
16100 gcc_assert (parm_depth
== TMPL_ARGS_DEPTH (targs
));
16102 fn_type
= TREE_TYPE (tmpl
);
16104 if (parm_depth
== 1)
16105 /* No substitution is necessary. */
16109 int i
, save_access_control
;
16112 /* Replace the innermost level of the TARGS with NULL_TREEs to
16113 let tsubst know not to substitute for those parameters. */
16114 partial_args
= make_tree_vec (TREE_VEC_LENGTH (targs
));
16115 for (i
= 1; i
< TMPL_ARGS_DEPTH (targs
); ++i
)
16116 SET_TMPL_ARGS_LEVEL (partial_args
, i
,
16117 TMPL_ARGS_LEVEL (targs
, i
));
16118 SET_TMPL_ARGS_LEVEL (partial_args
,
16119 TMPL_ARGS_DEPTH (targs
),
16120 make_tree_vec (DECL_NTPARMS (tmpl
)));
16122 /* Disable access control as this function is used only during
16124 save_access_control
= flag_access_control
;
16125 flag_access_control
= 0;
16127 ++processing_template_decl
;
16128 /* Now, do the (partial) substitution to figure out the
16129 appropriate function type. */
16130 fn_type
= tsubst (fn_type
, partial_args
, tf_error
, NULL_TREE
);
16131 --processing_template_decl
;
16133 /* Substitute into the template parameters to obtain the real
16134 innermost set of parameters. This step is important if the
16135 innermost set of template parameters contains value
16136 parameters whose types depend on outer template parameters. */
16137 TREE_VEC_LENGTH (partial_args
)--;
16138 tparms
= tsubst_template_parms (tparms
, partial_args
, tf_error
);
16140 flag_access_control
= save_access_control
;
16146 /* Return truthvalue if we're processing a template different from
16147 the last one involved in diagnostics. */
16149 problematic_instantiation_changed (void)
16151 return last_template_error_tick
!= tinst_level_tick
;
16154 /* Remember current template involved in diagnostics. */
16156 record_last_problematic_instantiation (void)
16158 last_template_error_tick
= tinst_level_tick
;
16161 struct tinst_level
*
16162 current_instantiation (void)
16164 return current_tinst_level
;
16167 /* [temp.param] Check that template non-type parm TYPE is of an allowable
16168 type. Return zero for ok, nonzero for disallowed. Issue error and
16169 warning messages under control of COMPLAIN. */
16172 invalid_nontype_parm_type_p (tree type
, tsubst_flags_t complain
)
16174 if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
16176 else if (POINTER_TYPE_P (type
))
16178 else if (TYPE_PTR_TO_MEMBER_P (type
))
16180 else if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
)
16182 else if (TREE_CODE (type
) == TYPENAME_TYPE
)
16185 if (complain
& tf_error
)
16186 error ("%q#T is not a valid type for a template constant parameter", type
);
16190 /* Returns TRUE if TYPE is dependent, in the sense of [temp.dep.type].
16191 Assumes that TYPE really is a type, and not the ERROR_MARK_NODE.*/
16194 dependent_type_p_r (tree type
)
16200 A type is dependent if it is:
16202 -- a template parameter. Template template parameters are types
16203 for us (since TYPE_P holds true for them) so we handle
16205 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
16206 || TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
)
16208 /* -- a qualified-id with a nested-name-specifier which contains a
16209 class-name that names a dependent type or whose unqualified-id
16210 names a dependent type. */
16211 if (TREE_CODE (type
) == TYPENAME_TYPE
)
16213 /* -- a cv-qualified type where the cv-unqualified type is
16215 type
= TYPE_MAIN_VARIANT (type
);
16216 /* -- a compound type constructed from any dependent type. */
16217 if (TYPE_PTR_TO_MEMBER_P (type
))
16218 return (dependent_type_p (TYPE_PTRMEM_CLASS_TYPE (type
))
16219 || dependent_type_p (TYPE_PTRMEM_POINTED_TO_TYPE
16221 else if (TREE_CODE (type
) == POINTER_TYPE
16222 || TREE_CODE (type
) == REFERENCE_TYPE
)
16223 return dependent_type_p (TREE_TYPE (type
));
16224 else if (TREE_CODE (type
) == FUNCTION_TYPE
16225 || TREE_CODE (type
) == METHOD_TYPE
)
16229 if (dependent_type_p (TREE_TYPE (type
)))
16231 for (arg_type
= TYPE_ARG_TYPES (type
);
16233 arg_type
= TREE_CHAIN (arg_type
))
16234 if (dependent_type_p (TREE_VALUE (arg_type
)))
16238 /* -- an array type constructed from any dependent type or whose
16239 size is specified by a constant expression that is
16240 value-dependent. */
16241 if (TREE_CODE (type
) == ARRAY_TYPE
)
16243 if (TYPE_DOMAIN (type
)
16244 && dependent_type_p (TYPE_DOMAIN (type
)))
16246 return dependent_type_p (TREE_TYPE (type
));
16248 else if (TREE_CODE (type
) == INTEGER_TYPE
16249 && !TREE_CONSTANT (TYPE_MAX_VALUE (type
)))
16251 /* If this is the TYPE_DOMAIN of an array type, consider it
16252 dependent. We already checked for value-dependence in
16253 compute_array_index_type. */
16254 return type_dependent_expression_p (TYPE_MAX_VALUE (type
));
16257 /* -- a template-id in which either the template name is a template
16259 if (TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
16261 /* ... or any of the template arguments is a dependent type or
16262 an expression that is type-dependent or value-dependent. */
16263 else if (CLASS_TYPE_P (type
) && CLASSTYPE_TEMPLATE_INFO (type
)
16264 && (any_dependent_template_arguments_p
16265 (INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type
)))))
16268 /* All TYPEOF_TYPEs and DECLTYPE_TYPEs are dependent; if the
16269 argument of the `typeof' expression is not type-dependent, then
16270 it should already been have resolved. */
16271 if (TREE_CODE (type
) == TYPEOF_TYPE
16272 || TREE_CODE (type
) == DECLTYPE_TYPE
)
16275 /* A template argument pack is dependent if any of its packed
16277 if (TREE_CODE (type
) == TYPE_ARGUMENT_PACK
)
16279 tree args
= ARGUMENT_PACK_ARGS (type
);
16280 int i
, len
= TREE_VEC_LENGTH (args
);
16281 for (i
= 0; i
< len
; ++i
)
16282 if (dependent_template_arg_p (TREE_VEC_ELT (args
, i
)))
16286 /* All TYPE_PACK_EXPANSIONs are dependent, because parameter packs must
16287 be template parameters. */
16288 if (TREE_CODE (type
) == TYPE_PACK_EXPANSION
)
16291 /* The standard does not specifically mention types that are local
16292 to template functions or local classes, but they should be
16293 considered dependent too. For example:
16295 template <int I> void f() {
16300 The size of `E' cannot be known until the value of `I' has been
16301 determined. Therefore, `E' must be considered dependent. */
16302 scope
= TYPE_CONTEXT (type
);
16303 if (scope
&& TYPE_P (scope
))
16304 return dependent_type_p (scope
);
16305 else if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
)
16306 return type_dependent_expression_p (scope
);
16308 /* Other types are non-dependent. */
16312 /* Returns TRUE if TYPE is dependent, in the sense of
16313 [temp.dep.type]. */
16316 dependent_type_p (tree type
)
16318 /* If there are no template parameters in scope, then there can't be
16319 any dependent types. */
16320 if (!processing_template_decl
)
16322 /* If we are not processing a template, then nobody should be
16323 providing us with a dependent type. */
16325 gcc_assert (TREE_CODE (type
) != TEMPLATE_TYPE_PARM
|| is_auto (type
));
16329 /* If the type is NULL, we have not computed a type for the entity
16330 in question; in that case, the type is dependent. */
16334 /* Erroneous types can be considered non-dependent. */
16335 if (type
== error_mark_node
)
16338 /* If we have not already computed the appropriate value for TYPE,
16340 if (!TYPE_DEPENDENT_P_VALID (type
))
16342 TYPE_DEPENDENT_P (type
) = dependent_type_p_r (type
);
16343 TYPE_DEPENDENT_P_VALID (type
) = 1;
16346 return TYPE_DEPENDENT_P (type
);
16349 /* Returns TRUE if SCOPE is a dependent scope, in which we can't do any
16350 lookup. In other words, a dependent type that is not the current
16354 dependent_scope_p (tree scope
)
16356 return (scope
&& TYPE_P (scope
) && dependent_type_p (scope
)
16357 && !currently_open_class (scope
));
16360 /* Returns TRUE if EXPRESSION is dependent, according to CRITERION. */
16363 dependent_scope_ref_p (tree expression
, bool criterion (tree
))
16368 gcc_assert (TREE_CODE (expression
) == SCOPE_REF
);
16370 if (!TYPE_P (TREE_OPERAND (expression
, 0)))
16373 scope
= TREE_OPERAND (expression
, 0);
16374 name
= TREE_OPERAND (expression
, 1);
16378 An id-expression is type-dependent if it contains a
16379 nested-name-specifier that contains a class-name that names a
16381 /* The suggested resolution to Core Issue 224 implies that if the
16382 qualifying type is the current class, then we must peek
16385 && currently_open_class (scope
)
16386 && !criterion (name
))
16388 if (dependent_type_p (scope
))
16394 /* Returns TRUE if the EXPRESSION is value-dependent, in the sense of
16395 [temp.dep.constexpr]. EXPRESSION is already known to be a constant
16399 value_dependent_expression_p (tree expression
)
16401 if (!processing_template_decl
)
16404 /* A name declared with a dependent type. */
16405 if (DECL_P (expression
) && type_dependent_expression_p (expression
))
16408 switch (TREE_CODE (expression
))
16410 case IDENTIFIER_NODE
:
16411 /* A name that has not been looked up -- must be dependent. */
16414 case TEMPLATE_PARM_INDEX
:
16415 /* A non-type template parm. */
16419 /* A non-type template parm. */
16420 if (DECL_TEMPLATE_PARM_P (expression
))
16422 return value_dependent_expression_p (DECL_INITIAL (expression
));
16425 /* A constant with integral or enumeration type and is initialized
16426 with an expression that is value-dependent. */
16427 if (DECL_INITIAL (expression
)
16428 && INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (expression
))
16429 && value_dependent_expression_p (DECL_INITIAL (expression
)))
16433 case DYNAMIC_CAST_EXPR
:
16434 case STATIC_CAST_EXPR
:
16435 case CONST_CAST_EXPR
:
16436 case REINTERPRET_CAST_EXPR
:
16438 /* These expressions are value-dependent if the type to which
16439 the cast occurs is dependent or the expression being casted
16440 is value-dependent. */
16442 tree type
= TREE_TYPE (expression
);
16444 if (dependent_type_p (type
))
16447 /* A functional cast has a list of operands. */
16448 expression
= TREE_OPERAND (expression
, 0);
16451 /* If there are no operands, it must be an expression such
16452 as "int()". This should not happen for aggregate types
16453 because it would form non-constant expressions. */
16454 gcc_assert (INTEGRAL_OR_ENUMERATION_TYPE_P (type
));
16459 if (TREE_CODE (expression
) == TREE_LIST
)
16460 return any_value_dependent_elements_p (expression
);
16462 return value_dependent_expression_p (expression
);
16467 /* A `sizeof' expression is value-dependent if the operand is
16468 type-dependent or is a pack expansion. */
16469 expression
= TREE_OPERAND (expression
, 0);
16470 if (PACK_EXPANSION_P (expression
))
16472 else if (TYPE_P (expression
))
16473 return dependent_type_p (expression
);
16474 return type_dependent_expression_p (expression
);
16477 return dependent_scope_ref_p (expression
, value_dependent_expression_p
);
16479 case COMPONENT_REF
:
16480 return (value_dependent_expression_p (TREE_OPERAND (expression
, 0))
16481 || value_dependent_expression_p (TREE_OPERAND (expression
, 1)));
16484 /* A CALL_EXPR may appear in a constant expression if it is a
16485 call to a builtin function, e.g., __builtin_constant_p. All
16486 such calls are value-dependent. */
16489 case NONTYPE_ARGUMENT_PACK
:
16490 /* A NONTYPE_ARGUMENT_PACK is value-dependent if any packed argument
16491 is value-dependent. */
16493 tree values
= ARGUMENT_PACK_ARGS (expression
);
16494 int i
, len
= TREE_VEC_LENGTH (values
);
16496 for (i
= 0; i
< len
; ++i
)
16497 if (value_dependent_expression_p (TREE_VEC_ELT (values
, i
)))
16505 tree type2
= TRAIT_EXPR_TYPE2 (expression
);
16506 return (dependent_type_p (TRAIT_EXPR_TYPE1 (expression
))
16507 || (type2
? dependent_type_p (type2
) : false));
16511 return ((value_dependent_expression_p (TREE_OPERAND (expression
, 0)))
16512 || (value_dependent_expression_p (TREE_OPERAND (expression
, 2))));
16515 /* A constant expression is value-dependent if any subexpression is
16516 value-dependent. */
16517 switch (TREE_CODE_CLASS (TREE_CODE (expression
)))
16519 case tcc_reference
:
16521 return (value_dependent_expression_p
16522 (TREE_OPERAND (expression
, 0)));
16524 case tcc_comparison
:
16526 return ((value_dependent_expression_p
16527 (TREE_OPERAND (expression
, 0)))
16528 || (value_dependent_expression_p
16529 (TREE_OPERAND (expression
, 1))));
16531 case tcc_expression
:
16535 for (i
= 0; i
< TREE_OPERAND_LENGTH (expression
); ++i
)
16536 /* In some cases, some of the operands may be missing.
16537 (For example, in the case of PREDECREMENT_EXPR, the
16538 amount to increment by may be missing.) That doesn't
16539 make the expression dependent. */
16540 if (TREE_OPERAND (expression
, i
)
16541 && (value_dependent_expression_p
16542 (TREE_OPERAND (expression
, i
))))
16552 /* The expression is not value-dependent. */
16556 /* Returns TRUE if the EXPRESSION is type-dependent, in the sense of
16557 [temp.dep.expr]. */
16560 type_dependent_expression_p (tree expression
)
16562 if (!processing_template_decl
)
16565 if (expression
== error_mark_node
)
16568 /* An unresolved name is always dependent. */
16569 if (TREE_CODE (expression
) == IDENTIFIER_NODE
16570 || TREE_CODE (expression
) == USING_DECL
)
16573 /* Some expression forms are never type-dependent. */
16574 if (TREE_CODE (expression
) == PSEUDO_DTOR_EXPR
16575 || TREE_CODE (expression
) == SIZEOF_EXPR
16576 || TREE_CODE (expression
) == ALIGNOF_EXPR
16577 || TREE_CODE (expression
) == TRAIT_EXPR
16578 || TREE_CODE (expression
) == TYPEID_EXPR
16579 || TREE_CODE (expression
) == DELETE_EXPR
16580 || TREE_CODE (expression
) == VEC_DELETE_EXPR
16581 || TREE_CODE (expression
) == THROW_EXPR
)
16584 /* The types of these expressions depends only on the type to which
16585 the cast occurs. */
16586 if (TREE_CODE (expression
) == DYNAMIC_CAST_EXPR
16587 || TREE_CODE (expression
) == STATIC_CAST_EXPR
16588 || TREE_CODE (expression
) == CONST_CAST_EXPR
16589 || TREE_CODE (expression
) == REINTERPRET_CAST_EXPR
16590 || TREE_CODE (expression
) == CAST_EXPR
)
16591 return dependent_type_p (TREE_TYPE (expression
));
16593 /* The types of these expressions depends only on the type created
16594 by the expression. */
16595 if (TREE_CODE (expression
) == NEW_EXPR
16596 || TREE_CODE (expression
) == VEC_NEW_EXPR
)
16598 /* For NEW_EXPR tree nodes created inside a template, either
16599 the object type itself or a TREE_LIST may appear as the
16601 tree type
= TREE_OPERAND (expression
, 1);
16602 if (TREE_CODE (type
) == TREE_LIST
)
16603 /* This is an array type. We need to check array dimensions
16605 return dependent_type_p (TREE_VALUE (TREE_PURPOSE (type
)))
16606 || value_dependent_expression_p
16607 (TREE_OPERAND (TREE_VALUE (type
), 1));
16609 return dependent_type_p (type
);
16612 if (TREE_CODE (expression
) == SCOPE_REF
16613 && dependent_scope_ref_p (expression
,
16614 type_dependent_expression_p
))
16617 if (TREE_CODE (expression
) == FUNCTION_DECL
16618 && DECL_LANG_SPECIFIC (expression
)
16619 && DECL_TEMPLATE_INFO (expression
)
16620 && (any_dependent_template_arguments_p
16621 (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (expression
)))))
16624 if (TREE_CODE (expression
) == TEMPLATE_DECL
16625 && !DECL_TEMPLATE_TEMPLATE_PARM_P (expression
))
16628 if (TREE_CODE (expression
) == STMT_EXPR
)
16629 expression
= stmt_expr_value_expr (expression
);
16631 if (BRACE_ENCLOSED_INITIALIZER_P (expression
))
16636 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expression
), i
, elt
)
16638 if (type_dependent_expression_p (elt
))
16644 if (TREE_TYPE (expression
) == unknown_type_node
)
16646 if (TREE_CODE (expression
) == ADDR_EXPR
)
16647 return type_dependent_expression_p (TREE_OPERAND (expression
, 0));
16648 if (TREE_CODE (expression
) == COMPONENT_REF
16649 || TREE_CODE (expression
) == OFFSET_REF
)
16651 if (type_dependent_expression_p (TREE_OPERAND (expression
, 0)))
16653 expression
= TREE_OPERAND (expression
, 1);
16654 if (TREE_CODE (expression
) == IDENTIFIER_NODE
)
16657 /* SCOPE_REF with non-null TREE_TYPE is always non-dependent. */
16658 if (TREE_CODE (expression
) == SCOPE_REF
)
16661 if (TREE_CODE (expression
) == BASELINK
)
16662 expression
= BASELINK_FUNCTIONS (expression
);
16664 if (TREE_CODE (expression
) == TEMPLATE_ID_EXPR
)
16666 if (any_dependent_template_arguments_p
16667 (TREE_OPERAND (expression
, 1)))
16669 expression
= TREE_OPERAND (expression
, 0);
16671 gcc_assert (TREE_CODE (expression
) == OVERLOAD
16672 || TREE_CODE (expression
) == FUNCTION_DECL
);
16676 if (type_dependent_expression_p (OVL_CURRENT (expression
)))
16678 expression
= OVL_NEXT (expression
);
16683 gcc_assert (TREE_CODE (expression
) != TYPE_DECL
);
16685 return (dependent_type_p (TREE_TYPE (expression
)));
16688 /* Like type_dependent_expression_p, but it also works while not processing
16689 a template definition, i.e. during substitution or mangling. */
16692 type_dependent_expression_p_push (tree expr
)
16695 ++processing_template_decl
;
16696 b
= type_dependent_expression_p (expr
);
16697 --processing_template_decl
;
16701 /* Returns TRUE if ARGS contains a type-dependent expression. */
16704 any_type_dependent_arguments_p (const VEC(tree
,gc
) *args
)
16709 for (i
= 0; VEC_iterate (tree
, args
, i
, arg
); ++i
)
16711 if (type_dependent_expression_p (arg
))
16717 /* Returns TRUE if LIST (a TREE_LIST whose TREE_VALUEs are
16718 expressions) contains any value-dependent expressions. */
16721 any_value_dependent_elements_p (const_tree list
)
16723 for (; list
; list
= TREE_CHAIN (list
))
16724 if (value_dependent_expression_p (TREE_VALUE (list
)))
16730 /* Returns TRUE if the ARG (a template argument) is dependent. */
16733 dependent_template_arg_p (tree arg
)
16735 if (!processing_template_decl
)
16738 if (TREE_CODE (arg
) == TEMPLATE_DECL
16739 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
16740 return dependent_template_p (arg
);
16741 else if (ARGUMENT_PACK_P (arg
))
16743 tree args
= ARGUMENT_PACK_ARGS (arg
);
16744 int i
, len
= TREE_VEC_LENGTH (args
);
16745 for (i
= 0; i
< len
; ++i
)
16747 if (dependent_template_arg_p (TREE_VEC_ELT (args
, i
)))
16753 else if (TYPE_P (arg
))
16754 return dependent_type_p (arg
);
16756 return (type_dependent_expression_p (arg
)
16757 || value_dependent_expression_p (arg
));
16760 /* Returns true if ARGS (a collection of template arguments) contains
16761 any types that require structural equality testing. */
16764 any_template_arguments_need_structural_equality_p (tree args
)
16771 if (args
== error_mark_node
)
16774 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
16776 tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
16777 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
16779 tree arg
= TREE_VEC_ELT (level
, j
);
16780 tree packed_args
= NULL_TREE
;
16783 if (ARGUMENT_PACK_P (arg
))
16785 /* Look inside the argument pack. */
16786 packed_args
= ARGUMENT_PACK_ARGS (arg
);
16787 len
= TREE_VEC_LENGTH (packed_args
);
16790 for (k
= 0; k
< len
; ++k
)
16793 arg
= TREE_VEC_ELT (packed_args
, k
);
16795 if (error_operand_p (arg
))
16797 else if (TREE_CODE (arg
) == TEMPLATE_DECL
16798 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
16800 else if (TYPE_P (arg
) && TYPE_STRUCTURAL_EQUALITY_P (arg
))
16802 else if (!TYPE_P (arg
) && TREE_TYPE (arg
)
16803 && TYPE_STRUCTURAL_EQUALITY_P (TREE_TYPE (arg
)))
16812 /* Returns true if ARGS (a collection of template arguments) contains
16813 any dependent arguments. */
16816 any_dependent_template_arguments_p (const_tree args
)
16823 if (args
== error_mark_node
)
16826 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
16828 const_tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
16829 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
16830 if (dependent_template_arg_p (TREE_VEC_ELT (level
, j
)))
16837 /* Returns TRUE if the template TMPL is dependent. */
16840 dependent_template_p (tree tmpl
)
16842 if (TREE_CODE (tmpl
) == OVERLOAD
)
16846 if (dependent_template_p (OVL_FUNCTION (tmpl
)))
16848 tmpl
= OVL_CHAIN (tmpl
);
16853 /* Template template parameters are dependent. */
16854 if (DECL_TEMPLATE_TEMPLATE_PARM_P (tmpl
)
16855 || TREE_CODE (tmpl
) == TEMPLATE_TEMPLATE_PARM
)
16857 /* So are names that have not been looked up. */
16858 if (TREE_CODE (tmpl
) == SCOPE_REF
16859 || TREE_CODE (tmpl
) == IDENTIFIER_NODE
)
16861 /* So are member templates of dependent classes. */
16862 if (TYPE_P (CP_DECL_CONTEXT (tmpl
)))
16863 return dependent_type_p (DECL_CONTEXT (tmpl
));
16867 /* Returns TRUE if the specialization TMPL<ARGS> is dependent. */
16870 dependent_template_id_p (tree tmpl
, tree args
)
16872 return (dependent_template_p (tmpl
)
16873 || any_dependent_template_arguments_p (args
));
16876 /* Returns TRUE if OMP_FOR with DECLV, INITV, CONDV and INCRV vectors
16880 dependent_omp_for_p (tree declv
, tree initv
, tree condv
, tree incrv
)
16884 if (!processing_template_decl
)
16887 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
16889 tree decl
= TREE_VEC_ELT (declv
, i
);
16890 tree init
= TREE_VEC_ELT (initv
, i
);
16891 tree cond
= TREE_VEC_ELT (condv
, i
);
16892 tree incr
= TREE_VEC_ELT (incrv
, i
);
16894 if (type_dependent_expression_p (decl
))
16897 if (init
&& type_dependent_expression_p (init
))
16900 if (type_dependent_expression_p (cond
))
16903 if (COMPARISON_CLASS_P (cond
)
16904 && (type_dependent_expression_p (TREE_OPERAND (cond
, 0))
16905 || type_dependent_expression_p (TREE_OPERAND (cond
, 1))))
16908 if (TREE_CODE (incr
) == MODOP_EXPR
)
16910 if (type_dependent_expression_p (TREE_OPERAND (incr
, 0))
16911 || type_dependent_expression_p (TREE_OPERAND (incr
, 2)))
16914 else if (type_dependent_expression_p (incr
))
16916 else if (TREE_CODE (incr
) == MODIFY_EXPR
)
16918 if (type_dependent_expression_p (TREE_OPERAND (incr
, 0)))
16920 else if (BINARY_CLASS_P (TREE_OPERAND (incr
, 1)))
16922 tree t
= TREE_OPERAND (incr
, 1);
16923 if (type_dependent_expression_p (TREE_OPERAND (t
, 0))
16924 || type_dependent_expression_p (TREE_OPERAND (t
, 1)))
16933 /* TYPE is a TYPENAME_TYPE. Returns the ordinary TYPE to which the
16934 TYPENAME_TYPE corresponds. Returns the original TYPENAME_TYPE if
16935 no such TYPE can be found. Note that this function peers inside
16936 uninstantiated templates and therefore should be used only in
16937 extremely limited situations. ONLY_CURRENT_P restricts this
16938 peering to the currently open classes hierarchy (which is required
16939 when comparing types). */
16942 resolve_typename_type (tree type
, bool only_current_p
)
16951 gcc_assert (TREE_CODE (type
) == TYPENAME_TYPE
);
16953 scope
= TYPE_CONTEXT (type
);
16954 /* Usually the non-qualified identifier of a TYPENAME_TYPE is
16955 TYPE_IDENTIFIER (type). But when 'type' is a typedef variant of
16956 a TYPENAME_TYPE node, then TYPE_NAME (type) is set to the TYPE_DECL representing
16957 the typedef. In that case TYPE_IDENTIFIER (type) is not the non-qualified
16958 identifier of the TYPENAME_TYPE anymore.
16959 So by getting the TYPE_IDENTIFIER of the _main declaration_ of the
16960 TYPENAME_TYPE instead, we avoid messing up with a possible
16961 typedef variant case. */
16962 name
= TYPE_IDENTIFIER (TYPE_MAIN_VARIANT (type
));
16964 /* If the SCOPE is itself a TYPENAME_TYPE, then we need to resolve
16965 it first before we can figure out what NAME refers to. */
16966 if (TREE_CODE (scope
) == TYPENAME_TYPE
)
16967 scope
= resolve_typename_type (scope
, only_current_p
);
16968 /* If we don't know what SCOPE refers to, then we cannot resolve the
16970 if (TREE_CODE (scope
) == TYPENAME_TYPE
)
16972 /* If the SCOPE is a template type parameter, we have no way of
16973 resolving the name. */
16974 if (TREE_CODE (scope
) == TEMPLATE_TYPE_PARM
)
16976 /* If the SCOPE is not the current instantiation, there's no reason
16977 to look inside it. */
16978 if (only_current_p
&& !currently_open_class (scope
))
16980 /* If SCOPE isn't the template itself, it will not have a valid
16981 TYPE_FIELDS list. */
16982 if (same_type_p (scope
, CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope
)))
16983 /* scope is either the template itself or a compatible instantiation
16984 like X<T>, so look up the name in the original template. */
16985 scope
= CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope
);
16987 /* scope is a partial instantiation, so we can't do the lookup or we
16988 will lose the template arguments. */
16990 /* Enter the SCOPE so that name lookup will be resolved as if we
16991 were in the class definition. In particular, SCOPE will no
16992 longer be considered a dependent type. */
16993 pushed_scope
= push_scope (scope
);
16994 /* Look up the declaration. */
16995 decl
= lookup_member (scope
, name
, /*protect=*/0, /*want_type=*/true);
16997 result
= NULL_TREE
;
16999 /* For a TYPENAME_TYPE like "typename X::template Y<T>", we want to
17000 find a TEMPLATE_DECL. Otherwise, we want to find a TYPE_DECL. */
17003 else if (TREE_CODE (TYPENAME_TYPE_FULLNAME (type
)) == IDENTIFIER_NODE
17004 && TREE_CODE (decl
) == TYPE_DECL
)
17006 result
= TREE_TYPE (decl
);
17007 if (result
== error_mark_node
)
17008 result
= NULL_TREE
;
17010 else if (TREE_CODE (TYPENAME_TYPE_FULLNAME (type
)) == TEMPLATE_ID_EXPR
17011 && DECL_CLASS_TEMPLATE_P (decl
))
17015 /* Obtain the template and the arguments. */
17016 tmpl
= TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type
), 0);
17017 args
= TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type
), 1);
17018 /* Instantiate the template. */
17019 result
= lookup_template_class (tmpl
, args
, NULL_TREE
, NULL_TREE
,
17020 /*entering_scope=*/0,
17021 tf_error
| tf_user
);
17022 if (result
== error_mark_node
)
17023 result
= NULL_TREE
;
17026 /* Leave the SCOPE. */
17028 pop_scope (pushed_scope
);
17030 /* If we failed to resolve it, return the original typename. */
17034 /* If lookup found a typename type, resolve that too. */
17035 if (TREE_CODE (result
) == TYPENAME_TYPE
&& !TYPENAME_IS_RESOLVING_P (result
))
17037 /* Ill-formed programs can cause infinite recursion here, so we
17038 must catch that. */
17039 TYPENAME_IS_RESOLVING_P (type
) = 1;
17040 result
= resolve_typename_type (result
, only_current_p
);
17041 TYPENAME_IS_RESOLVING_P (type
) = 0;
17044 /* Qualify the resulting type. */
17045 quals
= cp_type_quals (type
);
17047 result
= cp_build_qualified_type (result
, cp_type_quals (result
) | quals
);
17052 /* EXPR is an expression which is not type-dependent. Return a proxy
17053 for EXPR that can be used to compute the types of larger
17054 expressions containing EXPR. */
17057 build_non_dependent_expr (tree expr
)
17061 /* Preserve null pointer constants so that the type of things like
17062 "p == 0" where "p" is a pointer can be determined. */
17063 if (null_ptr_cst_p (expr
))
17065 /* Preserve OVERLOADs; the functions must be available to resolve
17068 if (TREE_CODE (inner_expr
) == STMT_EXPR
)
17069 inner_expr
= stmt_expr_value_expr (inner_expr
);
17070 if (TREE_CODE (inner_expr
) == ADDR_EXPR
)
17071 inner_expr
= TREE_OPERAND (inner_expr
, 0);
17072 if (TREE_CODE (inner_expr
) == COMPONENT_REF
)
17073 inner_expr
= TREE_OPERAND (inner_expr
, 1);
17074 if (is_overloaded_fn (inner_expr
)
17075 || TREE_CODE (inner_expr
) == OFFSET_REF
)
17077 /* There is no need to return a proxy for a variable. */
17078 if (TREE_CODE (expr
) == VAR_DECL
)
17080 /* Preserve string constants; conversions from string constants to
17081 "char *" are allowed, even though normally a "const char *"
17082 cannot be used to initialize a "char *". */
17083 if (TREE_CODE (expr
) == STRING_CST
)
17085 /* Preserve arithmetic constants, as an optimization -- there is no
17086 reason to create a new node. */
17087 if (TREE_CODE (expr
) == INTEGER_CST
|| TREE_CODE (expr
) == REAL_CST
)
17089 /* Preserve THROW_EXPRs -- all throw-expressions have type "void".
17090 There is at least one place where we want to know that a
17091 particular expression is a throw-expression: when checking a ?:
17092 expression, there are special rules if the second or third
17093 argument is a throw-expression. */
17094 if (TREE_CODE (expr
) == THROW_EXPR
)
17097 if (TREE_CODE (expr
) == COND_EXPR
)
17098 return build3 (COND_EXPR
,
17100 TREE_OPERAND (expr
, 0),
17101 (TREE_OPERAND (expr
, 1)
17102 ? build_non_dependent_expr (TREE_OPERAND (expr
, 1))
17103 : build_non_dependent_expr (TREE_OPERAND (expr
, 0))),
17104 build_non_dependent_expr (TREE_OPERAND (expr
, 2)));
17105 if (TREE_CODE (expr
) == COMPOUND_EXPR
17106 && !COMPOUND_EXPR_OVERLOADED (expr
))
17107 return build2 (COMPOUND_EXPR
,
17109 TREE_OPERAND (expr
, 0),
17110 build_non_dependent_expr (TREE_OPERAND (expr
, 1)));
17112 /* If the type is unknown, it can't really be non-dependent */
17113 gcc_assert (TREE_TYPE (expr
) != unknown_type_node
);
17115 /* Otherwise, build a NON_DEPENDENT_EXPR.
17117 REFERENCE_TYPEs are not stripped for expressions in templates
17118 because doing so would play havoc with mangling. Consider, for
17121 template <typename T> void f<T& g>() { g(); }
17123 In the body of "f", the expression for "g" will have
17124 REFERENCE_TYPE, even though the standard says that it should
17125 not. The reason is that we must preserve the syntactic form of
17126 the expression so that mangling (say) "f<g>" inside the body of
17127 "f" works out correctly. Therefore, the REFERENCE_TYPE is
17129 return build1 (NON_DEPENDENT_EXPR
, non_reference (TREE_TYPE (expr
)), expr
);
17132 /* ARGS is a vector of expressions as arguments to a function call.
17133 Replace the arguments with equivalent non-dependent expressions.
17134 This modifies ARGS in place. */
17137 make_args_non_dependent (VEC(tree
,gc
) *args
)
17142 for (ix
= 0; VEC_iterate (tree
, args
, ix
, arg
); ++ix
)
17144 tree newarg
= build_non_dependent_expr (arg
);
17146 VEC_replace (tree
, args
, ix
, newarg
);
17150 /* Returns a type which represents 'auto'. We use a TEMPLATE_TYPE_PARM
17151 with a level one deeper than the actual template parms. */
17158 /* ??? Is it worth caching this for multiple autos at the same level? */
17159 au
= cxx_make_type (TEMPLATE_TYPE_PARM
);
17160 TYPE_NAME (au
) = build_decl (BUILTINS_LOCATION
,
17161 TYPE_DECL
, get_identifier ("auto"), au
);
17162 TYPE_STUB_DECL (au
) = TYPE_NAME (au
);
17163 TEMPLATE_TYPE_PARM_INDEX (au
) = build_template_parm_index
17164 (0, processing_template_decl
+ 1, processing_template_decl
+ 1,
17165 TYPE_NAME (au
), NULL_TREE
);
17166 TYPE_CANONICAL (au
) = canonical_type_parameter (au
);
17167 DECL_ARTIFICIAL (TYPE_NAME (au
)) = 1;
17168 SET_DECL_TEMPLATE_PARM_P (TYPE_NAME (au
));
17173 /* Replace auto in TYPE with std::initializer_list<auto>. */
17176 listify_autos (tree type
, tree auto_node
)
17178 tree std_init_list
= namespace_binding
17179 (get_identifier ("initializer_list"), std_node
);
17182 if (!std_init_list
|| !DECL_CLASS_TEMPLATE_P (std_init_list
))
17184 error ("deducing auto from brace-enclosed initializer list requires "
17185 "#include <initializer_list>");
17186 return error_mark_node
;
17188 argvec
= make_tree_vec (1);
17189 TREE_VEC_ELT (argvec
, 0) = auto_node
;
17190 init_auto
= lookup_template_class (std_init_list
, argvec
, NULL_TREE
,
17191 NULL_TREE
, 0, tf_warning_or_error
);
17193 TREE_VEC_ELT (argvec
, 0) = init_auto
;
17194 if (processing_template_decl
)
17195 argvec
= add_to_template_args (current_template_args (), argvec
);
17196 return tsubst (type
, argvec
, tf_warning_or_error
, NULL_TREE
);
17199 /* Replace occurrences of 'auto' in TYPE with the appropriate type deduced
17200 from INIT. AUTO_NODE is the TEMPLATE_TYPE_PARM used for 'auto' in TYPE. */
17203 do_auto_deduction (tree type
, tree init
, tree auto_node
)
17205 tree parms
, tparms
, targs
;
17209 /* [dcl.spec.auto]: Obtain P from T by replacing the occurrences of auto
17210 with either a new invented type template parameter U or, if the
17211 initializer is a braced-init-list (8.5.4), with
17212 std::initializer_list<U>. */
17213 if (BRACE_ENCLOSED_INITIALIZER_P (init
))
17214 type
= listify_autos (type
, auto_node
);
17216 parms
= build_tree_list (NULL_TREE
, type
);
17218 tparms
= make_tree_vec (1);
17219 targs
= make_tree_vec (1);
17220 TREE_VEC_ELT (tparms
, 0)
17221 = build_tree_list (NULL_TREE
, TYPE_NAME (auto_node
));
17222 val
= type_unification_real (tparms
, targs
, parms
, args
, 1, 0,
17223 DEDUCE_CALL
, LOOKUP_NORMAL
);
17226 error ("unable to deduce %qT from %qE", type
, init
);
17227 return error_mark_node
;
17230 if (processing_template_decl
)
17231 targs
= add_to_template_args (current_template_args (), targs
);
17232 return tsubst (type
, targs
, tf_warning_or_error
, NULL_TREE
);
17235 /* Substitutes LATE_RETURN_TYPE for 'auto' in TYPE and returns the
17239 splice_late_return_type (tree type
, tree late_return_type
)
17243 if (late_return_type
== NULL_TREE
)
17245 argvec
= make_tree_vec (1);
17246 TREE_VEC_ELT (argvec
, 0) = late_return_type
;
17247 if (processing_template_decl
)
17248 argvec
= add_to_template_args (current_template_args (), argvec
);
17249 return tsubst (type
, argvec
, tf_warning_or_error
, NULL_TREE
);
17252 /* Returns true iff TYPE is a TEMPLATE_TYPE_PARM representing 'auto'. */
17255 is_auto (const_tree type
)
17257 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
17258 && TYPE_IDENTIFIER (type
) == get_identifier ("auto"))
17264 /* Returns true iff TYPE contains a use of 'auto'. Since auto can only
17265 appear as a type-specifier for the declaration in question, we don't
17266 have to look through the whole type. */
17269 type_uses_auto (tree type
)
17271 enum tree_code code
;
17272 if (is_auto (type
))
17275 code
= TREE_CODE (type
);
17277 if (code
== POINTER_TYPE
|| code
== REFERENCE_TYPE
17278 || code
== OFFSET_TYPE
|| code
== FUNCTION_TYPE
17279 || code
== METHOD_TYPE
|| code
== ARRAY_TYPE
)
17280 return type_uses_auto (TREE_TYPE (type
));
17282 if (TYPE_PTRMEMFUNC_P (type
))
17283 return type_uses_auto (TREE_TYPE (TREE_TYPE
17284 (TYPE_PTRMEMFUNC_FN_TYPE (type
))));
17289 /* For a given template T, return the list of typedefs referenced
17290 in T for which access check is needed at T instantiation time.
17291 T is either a FUNCTION_DECL or a RECORD_TYPE.
17292 Those typedefs were added to T by the function
17293 append_type_to_template_for_access_check. */
17296 get_types_needing_access_check (tree t
)
17298 tree ti
, result
= NULL_TREE
;
17300 if (!t
|| t
== error_mark_node
)
17303 if (!(ti
= get_template_info (t
)))
17306 if (TREE_CODE (t
) == RECORD_TYPE
|| TREE_CODE (t
) == FUNCTION_DECL
)
17308 if (!TI_TEMPLATE (ti
))
17311 result
= TI_TYPEDEFS_NEEDING_ACCESS_CHECKING (ti
);
17317 /* Append the typedef TYPE_DECL used in template T to a list of typedefs
17318 tied to T. That list of typedefs will be access checked at
17319 T instantiation time.
17320 T is either a FUNCTION_DECL or a RECORD_TYPE.
17321 TYPE_DECL is a TYPE_DECL node representing a typedef.
17322 SCOPE is the scope through which TYPE_DECL is accessed.
17324 This function is a subroutine of
17325 append_type_to_template_for_access_check. */
17328 append_type_to_template_for_access_check_1 (tree t
,
17334 if (!t
|| t
== error_mark_node
)
17337 gcc_assert ((TREE_CODE (t
) == FUNCTION_DECL
17338 || TREE_CODE (t
) == RECORD_TYPE
)
17340 && TREE_CODE (type_decl
) == TYPE_DECL
17343 if (!(ti
= get_template_info (t
)))
17346 gcc_assert (TI_TEMPLATE (ti
));
17348 TI_TYPEDEFS_NEEDING_ACCESS_CHECKING (ti
) =
17349 tree_cons (type_decl
, scope
, TI_TYPEDEFS_NEEDING_ACCESS_CHECKING (ti
));
17352 /* Append TYPE_DECL to the template TEMPL.
17353 TEMPL is either a class type, a FUNCTION_DECL or a a TEMPLATE_DECL.
17354 At TEMPL instanciation time, TYPE_DECL will be checked to see
17355 if it can be accessed through SCOPE.
17357 e.g. consider the following code snippet:
17364 template<class U> struct S
17371 At S<char> instantiation time, we need to check the access of C::myint
17372 In other words, we need to check the access of the myint typedef through
17373 the C scope. For that purpose, this function will add the myint typedef
17374 and the scope C through which its being accessed to a list of typedefs
17375 tied to the template S. That list will be walked at template instantiation
17376 time and access check performed on each typedefs it contains.
17377 Note that this particular code snippet should yield an error because
17378 myint is private to C. */
17381 append_type_to_template_for_access_check (tree templ
,
17387 gcc_assert (type_decl
&& (TREE_CODE (type_decl
) == TYPE_DECL
));
17389 /* Make sure we don't append the type to the template twice. */
17390 for (node
= get_types_needing_access_check (templ
);
17392 node
= TREE_CHAIN (node
))
17394 tree decl
= TREE_PURPOSE (node
);
17395 tree type_scope
= TREE_VALUE (node
);
17397 if (decl
== type_decl
&& type_scope
== scope
)
17401 append_type_to_template_for_access_check_1 (templ
, type_decl
, scope
);
17404 #include "gt-cp-pt.h"