1 /* Handle parameterized types (templates) for GNU C++.
2 Copyright (C) 1992-2013 Free Software Foundation, Inc.
3 Written by Ken Raeburn (raeburn@cygnus.com) while at Watchmaker Computing.
4 Rewritten by Jason Merrill (jason@cygnus.com).
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3, or (at your option)
13 GCC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
22 /* Known bugs or deficiencies include:
24 all methods must be provided in header files; can't use a source
25 file that contains only the method templates and "just win". */
29 #include "coretypes.h"
33 #include "pointer-set.h"
36 #include "c-family/c-common.h"
37 #include "c-family/c-objc.h"
38 #include "cp-objcp-common.h"
39 #include "tree-inline.h"
43 #include "tree-iterator.h"
45 /* The type of functions taking a tree, and some additional data, and
47 typedef int (*tree_fn_t
) (tree
, void*);
49 /* The PENDING_TEMPLATES is a TREE_LIST of templates whose
50 instantiations have been deferred, either because their definitions
51 were not yet available, or because we were putting off doing the work. */
52 struct GTY ((chain_next ("%h.next"))) pending_template
{
53 struct pending_template
*next
;
54 struct tinst_level
*tinst
;
57 static GTY(()) struct pending_template
*pending_templates
;
58 static GTY(()) struct pending_template
*last_pending_template
;
60 int processing_template_parmlist
;
61 static int template_header_count
;
63 static GTY(()) tree saved_trees
;
64 static vec
<int> inline_parm_levels
;
66 static GTY(()) struct tinst_level
*current_tinst_level
;
68 static GTY(()) tree saved_access_scope
;
70 /* Live only within one (recursive) call to tsubst_expr. We use
71 this to pass the statement expression node from the STMT_EXPR
72 to the EXPR_STMT that is its result. */
73 static tree cur_stmt_expr
;
75 /* A map from local variable declarations in the body of the template
76 presently being instantiated to the corresponding instantiated
78 static struct pointer_map_t
*local_specializations
;
80 /* True if we've recursed into fn_type_unification too many times. */
81 static bool excessive_deduction_depth
;
83 typedef struct GTY(()) spec_entry
90 static GTY ((param_is (spec_entry
)))
91 htab_t decl_specializations
;
93 static GTY ((param_is (spec_entry
)))
94 htab_t type_specializations
;
96 /* Contains canonical template parameter types. The vector is indexed by
97 the TEMPLATE_TYPE_IDX of the template parameter. Each element is a
98 TREE_LIST, whose TREE_VALUEs contain the canonical template
99 parameters of various types and levels. */
100 static GTY(()) vec
<tree
, va_gc
> *canonical_template_parms
;
102 #define UNIFY_ALLOW_NONE 0
103 #define UNIFY_ALLOW_MORE_CV_QUAL 1
104 #define UNIFY_ALLOW_LESS_CV_QUAL 2
105 #define UNIFY_ALLOW_DERIVED 4
106 #define UNIFY_ALLOW_INTEGER 8
107 #define UNIFY_ALLOW_OUTER_LEVEL 16
108 #define UNIFY_ALLOW_OUTER_MORE_CV_QUAL 32
109 #define UNIFY_ALLOW_OUTER_LESS_CV_QUAL 64
111 enum template_base_result
{
113 tbr_ambiguous_baseclass
,
117 static void push_access_scope (tree
);
118 static void pop_access_scope (tree
);
119 static bool resolve_overloaded_unification (tree
, tree
, tree
, tree
,
120 unification_kind_t
, int,
122 static int try_one_overload (tree
, tree
, tree
, tree
, tree
,
123 unification_kind_t
, int, bool, bool);
124 static int unify (tree
, tree
, tree
, tree
, int, bool);
125 static void add_pending_template (tree
);
126 static tree
reopen_tinst_level (struct tinst_level
*);
127 static tree
tsubst_initializer_list (tree
, tree
);
128 static tree
get_class_bindings (tree
, tree
, tree
, tree
);
129 static tree
coerce_template_parms (tree
, tree
, tree
, tsubst_flags_t
,
131 static tree
coerce_innermost_template_parms (tree
, tree
, tree
, tsubst_flags_t
,
133 static void tsubst_enum (tree
, tree
, tree
);
134 static tree
add_to_template_args (tree
, tree
);
135 static tree
add_outermost_template_args (tree
, tree
);
136 static bool check_instantiated_args (tree
, tree
, tsubst_flags_t
);
137 static int maybe_adjust_types_for_deduction (unification_kind_t
, tree
*, tree
*,
139 static int type_unification_real (tree
, tree
, tree
, const tree
*,
140 unsigned int, int, unification_kind_t
, int,
142 static void note_template_header (int);
143 static tree
convert_nontype_argument_function (tree
, tree
);
144 static tree
convert_nontype_argument (tree
, tree
, tsubst_flags_t
);
145 static tree
convert_template_argument (tree
, tree
, tree
,
146 tsubst_flags_t
, int, tree
);
147 static int for_each_template_parm (tree
, tree_fn_t
, void*,
148 struct pointer_set_t
*, bool);
149 static tree
expand_template_argument_pack (tree
);
150 static tree
build_template_parm_index (int, int, int, tree
, tree
);
151 static bool inline_needs_template_parms (tree
);
152 static void push_inline_template_parms_recursive (tree
, int);
153 static tree
retrieve_local_specialization (tree
);
154 static void register_local_specialization (tree
, tree
);
155 static hashval_t
hash_specialization (const void *p
);
156 static tree
reduce_template_parm_level (tree
, tree
, int, tree
, tsubst_flags_t
);
157 static int mark_template_parm (tree
, void *);
158 static int template_parm_this_level_p (tree
, void *);
159 static tree
tsubst_friend_function (tree
, tree
);
160 static tree
tsubst_friend_class (tree
, tree
);
161 static int can_complete_type_without_circularity (tree
);
162 static tree
get_bindings (tree
, tree
, tree
, bool);
163 static int template_decl_level (tree
);
164 static int check_cv_quals_for_unify (int, tree
, tree
);
165 static void template_parm_level_and_index (tree
, int*, int*);
166 static int unify_pack_expansion (tree
, tree
, tree
,
167 tree
, unification_kind_t
, bool, bool);
168 static tree
tsubst_template_arg (tree
, tree
, tsubst_flags_t
, tree
);
169 static tree
tsubst_template_args (tree
, tree
, tsubst_flags_t
, tree
);
170 static tree
tsubst_template_parms (tree
, tree
, tsubst_flags_t
);
171 static void regenerate_decl_from_template (tree
, tree
);
172 static tree
most_specialized_class (tree
, tree
, tsubst_flags_t
);
173 static tree
tsubst_aggr_type (tree
, tree
, tsubst_flags_t
, tree
, int);
174 static tree
tsubst_arg_types (tree
, tree
, tree
, tsubst_flags_t
, tree
);
175 static tree
tsubst_function_type (tree
, tree
, tsubst_flags_t
, tree
);
176 static bool check_specialization_scope (void);
177 static tree
process_partial_specialization (tree
);
178 static void set_current_access_from_decl (tree
);
179 static enum template_base_result
get_template_base (tree
, tree
, tree
, tree
,
181 static tree
try_class_unification (tree
, tree
, tree
, tree
, bool);
182 static int coerce_template_template_parms (tree
, tree
, tsubst_flags_t
,
184 static bool template_template_parm_bindings_ok_p (tree
, tree
);
185 static int template_args_equal (tree
, tree
);
186 static void tsubst_default_arguments (tree
);
187 static tree
for_each_template_parm_r (tree
*, int *, void *);
188 static tree
copy_default_args_to_explicit_spec_1 (tree
, tree
);
189 static void copy_default_args_to_explicit_spec (tree
);
190 static int invalid_nontype_parm_type_p (tree
, tsubst_flags_t
);
191 static bool dependent_template_arg_p (tree
);
192 static bool any_template_arguments_need_structural_equality_p (tree
);
193 static bool dependent_type_p_r (tree
);
194 static tree
tsubst_expr (tree
, tree
, tsubst_flags_t
, tree
, bool);
195 static tree
tsubst_copy (tree
, tree
, tsubst_flags_t
, tree
);
196 static tree
tsubst_pack_expansion (tree
, tree
, tsubst_flags_t
, tree
);
197 static tree
tsubst_decl (tree
, tree
, tsubst_flags_t
);
198 static void perform_typedefs_access_check (tree tmpl
, tree targs
);
199 static void append_type_to_template_for_access_check_1 (tree
, tree
, tree
,
201 static tree
listify (tree
);
202 static tree
listify_autos (tree
, tree
);
203 static tree
template_parm_to_arg (tree t
);
204 static tree
current_template_args (void);
205 static tree
tsubst_template_parm (tree
, tree
, tsubst_flags_t
);
206 static tree
instantiate_alias_template (tree
, tree
, tsubst_flags_t
);
208 /* Make the current scope suitable for access checking when we are
209 processing T. T can be FUNCTION_DECL for instantiated function
210 template, VAR_DECL for static member variable, or TYPE_DECL for
211 alias template (needed by instantiate_decl). */
214 push_access_scope (tree t
)
216 gcc_assert (VAR_OR_FUNCTION_DECL_P (t
)
217 || TREE_CODE (t
) == TYPE_DECL
);
219 if (DECL_FRIEND_CONTEXT (t
))
220 push_nested_class (DECL_FRIEND_CONTEXT (t
));
221 else if (DECL_CLASS_SCOPE_P (t
))
222 push_nested_class (DECL_CONTEXT (t
));
224 push_to_top_level ();
226 if (TREE_CODE (t
) == FUNCTION_DECL
)
228 saved_access_scope
= tree_cons
229 (NULL_TREE
, current_function_decl
, saved_access_scope
);
230 current_function_decl
= t
;
234 /* Restore the scope set up by push_access_scope. T is the node we
238 pop_access_scope (tree t
)
240 if (TREE_CODE (t
) == FUNCTION_DECL
)
242 current_function_decl
= TREE_VALUE (saved_access_scope
);
243 saved_access_scope
= TREE_CHAIN (saved_access_scope
);
246 if (DECL_FRIEND_CONTEXT (t
) || DECL_CLASS_SCOPE_P (t
))
249 pop_from_top_level ();
252 /* Do any processing required when DECL (a member template
253 declaration) is finished. Returns the TEMPLATE_DECL corresponding
254 to DECL, unless it is a specialization, in which case the DECL
255 itself is returned. */
258 finish_member_template_decl (tree decl
)
260 if (decl
== error_mark_node
)
261 return error_mark_node
;
263 gcc_assert (DECL_P (decl
));
265 if (TREE_CODE (decl
) == TYPE_DECL
)
269 type
= TREE_TYPE (decl
);
270 if (type
== error_mark_node
)
271 return error_mark_node
;
272 if (MAYBE_CLASS_TYPE_P (type
)
273 && CLASSTYPE_TEMPLATE_INFO (type
)
274 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
276 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
277 check_member_template (tmpl
);
282 else if (TREE_CODE (decl
) == FIELD_DECL
)
283 error ("data member %qD cannot be a member template", decl
);
284 else if (DECL_TEMPLATE_INFO (decl
))
286 if (!DECL_TEMPLATE_SPECIALIZATION (decl
))
288 check_member_template (DECL_TI_TEMPLATE (decl
));
289 return DECL_TI_TEMPLATE (decl
);
295 error ("invalid member template declaration %qD", decl
);
297 return error_mark_node
;
300 /* Create a template info node. */
303 build_template_info (tree template_decl
, tree template_args
)
305 tree result
= make_node (TEMPLATE_INFO
);
306 TI_TEMPLATE (result
) = template_decl
;
307 TI_ARGS (result
) = template_args
;
311 /* Return the template info node corresponding to T, whatever T is. */
314 get_template_info (const_tree t
)
316 tree tinfo
= NULL_TREE
;
318 if (!t
|| t
== error_mark_node
)
321 if (DECL_P (t
) && DECL_LANG_SPECIFIC (t
))
322 tinfo
= DECL_TEMPLATE_INFO (t
);
324 if (!tinfo
&& DECL_IMPLICIT_TYPEDEF_P (t
))
327 if (OVERLOAD_TYPE_P (t
))
328 tinfo
= TYPE_TEMPLATE_INFO (t
);
329 else if (TREE_CODE (t
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
330 tinfo
= TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t
);
335 /* Returns the template nesting level of the indicated class TYPE.
345 A<T>::B<U> has depth two, while A<T> has depth one.
346 Both A<T>::B<int> and A<int>::B<U> have depth one, if
347 they are instantiations, not specializations.
349 This function is guaranteed to return 0 if passed NULL_TREE so
350 that, for example, `template_class_depth (current_class_type)' is
354 template_class_depth (tree type
)
359 type
&& TREE_CODE (type
) != NAMESPACE_DECL
;
360 type
= (TREE_CODE (type
) == FUNCTION_DECL
)
361 ? CP_DECL_CONTEXT (type
) : CP_TYPE_CONTEXT (type
))
363 tree tinfo
= get_template_info (type
);
365 if (tinfo
&& PRIMARY_TEMPLATE_P (TI_TEMPLATE (tinfo
))
366 && uses_template_parms (INNERMOST_TEMPLATE_ARGS (TI_ARGS (tinfo
))))
373 /* Subroutine of maybe_begin_member_template_processing.
374 Returns true if processing DECL needs us to push template parms. */
377 inline_needs_template_parms (tree decl
)
379 if (! DECL_TEMPLATE_INFO (decl
))
382 return (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (most_general_template (decl
)))
383 > (processing_template_decl
+ DECL_TEMPLATE_SPECIALIZATION (decl
)));
386 /* Subroutine of maybe_begin_member_template_processing.
387 Push the template parms in PARMS, starting from LEVELS steps into the
388 chain, and ending at the beginning, since template parms are listed
392 push_inline_template_parms_recursive (tree parmlist
, int levels
)
394 tree parms
= TREE_VALUE (parmlist
);
398 push_inline_template_parms_recursive (TREE_CHAIN (parmlist
), levels
- 1);
400 ++processing_template_decl
;
401 current_template_parms
402 = tree_cons (size_int (processing_template_decl
),
403 parms
, current_template_parms
);
404 TEMPLATE_PARMS_FOR_INLINE (current_template_parms
) = 1;
406 begin_scope (TREE_VEC_LENGTH (parms
) ? sk_template_parms
: sk_template_spec
,
408 for (i
= 0; i
< TREE_VEC_LENGTH (parms
); ++i
)
410 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
412 if (parm
== error_mark_node
)
415 gcc_assert (DECL_P (parm
));
417 switch (TREE_CODE (parm
))
426 /* Make a CONST_DECL as is done in process_template_parm.
427 It is ugly that we recreate this here; the original
428 version built in process_template_parm is no longer
430 tree decl
= build_decl (DECL_SOURCE_LOCATION (parm
),
431 CONST_DECL
, DECL_NAME (parm
),
433 DECL_ARTIFICIAL (decl
) = 1;
434 TREE_CONSTANT (decl
) = 1;
435 TREE_READONLY (decl
) = 1;
436 DECL_INITIAL (decl
) = DECL_INITIAL (parm
);
437 SET_DECL_TEMPLATE_PARM_P (decl
);
448 /* Restore the template parameter context for a member template or
449 a friend template defined in a class definition. */
452 maybe_begin_member_template_processing (tree decl
)
457 if (inline_needs_template_parms (decl
))
459 parms
= DECL_TEMPLATE_PARMS (most_general_template (decl
));
460 levels
= TMPL_PARMS_DEPTH (parms
) - processing_template_decl
;
462 if (DECL_TEMPLATE_SPECIALIZATION (decl
))
465 parms
= TREE_CHAIN (parms
);
468 push_inline_template_parms_recursive (parms
, levels
);
471 /* Remember how many levels of template parameters we pushed so that
472 we can pop them later. */
473 inline_parm_levels
.safe_push (levels
);
476 /* Undo the effects of maybe_begin_member_template_processing. */
479 maybe_end_member_template_processing (void)
484 if (inline_parm_levels
.length () == 0)
487 last
= inline_parm_levels
.pop ();
488 for (i
= 0; i
< last
; ++i
)
490 --processing_template_decl
;
491 current_template_parms
= TREE_CHAIN (current_template_parms
);
496 /* Return a new template argument vector which contains all of ARGS,
497 but has as its innermost set of arguments the EXTRA_ARGS. */
500 add_to_template_args (tree args
, tree extra_args
)
507 if (args
== NULL_TREE
|| extra_args
== error_mark_node
)
510 extra_depth
= TMPL_ARGS_DEPTH (extra_args
);
511 new_args
= make_tree_vec (TMPL_ARGS_DEPTH (args
) + extra_depth
);
513 for (i
= 1; i
<= TMPL_ARGS_DEPTH (args
); ++i
)
514 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (args
, i
));
516 for (j
= 1; j
<= extra_depth
; ++j
, ++i
)
517 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (extra_args
, j
));
522 /* Like add_to_template_args, but only the outermost ARGS are added to
523 the EXTRA_ARGS. In particular, all but TMPL_ARGS_DEPTH
524 (EXTRA_ARGS) levels are added. This function is used to combine
525 the template arguments from a partial instantiation with the
526 template arguments used to attain the full instantiation from the
527 partial instantiation. */
530 add_outermost_template_args (tree args
, tree extra_args
)
534 /* If there are more levels of EXTRA_ARGS than there are ARGS,
535 something very fishy is going on. */
536 gcc_assert (TMPL_ARGS_DEPTH (args
) >= TMPL_ARGS_DEPTH (extra_args
));
538 /* If *all* the new arguments will be the EXTRA_ARGS, just return
540 if (TMPL_ARGS_DEPTH (args
) == TMPL_ARGS_DEPTH (extra_args
))
543 /* For the moment, we make ARGS look like it contains fewer levels. */
544 TREE_VEC_LENGTH (args
) -= TMPL_ARGS_DEPTH (extra_args
);
546 new_args
= add_to_template_args (args
, extra_args
);
548 /* Now, we restore ARGS to its full dimensions. */
549 TREE_VEC_LENGTH (args
) += TMPL_ARGS_DEPTH (extra_args
);
554 /* Return the N levels of innermost template arguments from the ARGS. */
557 get_innermost_template_args (tree args
, int n
)
565 /* If N is 1, just return the innermost set of template arguments. */
567 return TMPL_ARGS_LEVEL (args
, TMPL_ARGS_DEPTH (args
));
569 /* If we're not removing anything, just return the arguments we were
571 extra_levels
= TMPL_ARGS_DEPTH (args
) - n
;
572 gcc_assert (extra_levels
>= 0);
573 if (extra_levels
== 0)
576 /* Make a new set of arguments, not containing the outer arguments. */
577 new_args
= make_tree_vec (n
);
578 for (i
= 1; i
<= n
; ++i
)
579 SET_TMPL_ARGS_LEVEL (new_args
, i
,
580 TMPL_ARGS_LEVEL (args
, i
+ extra_levels
));
585 /* The inverse of get_innermost_template_args: Return all but the innermost
586 EXTRA_LEVELS levels of template arguments from the ARGS. */
589 strip_innermost_template_args (tree args
, int extra_levels
)
592 int n
= TMPL_ARGS_DEPTH (args
) - extra_levels
;
597 /* If N is 1, just return the outermost set of template arguments. */
599 return TMPL_ARGS_LEVEL (args
, 1);
601 /* If we're not removing anything, just return the arguments we were
603 gcc_assert (extra_levels
>= 0);
604 if (extra_levels
== 0)
607 /* Make a new set of arguments, not containing the inner arguments. */
608 new_args
= make_tree_vec (n
);
609 for (i
= 1; i
<= n
; ++i
)
610 SET_TMPL_ARGS_LEVEL (new_args
, i
,
611 TMPL_ARGS_LEVEL (args
, i
));
616 /* We've got a template header coming up; push to a new level for storing
620 begin_template_parm_list (void)
622 /* We use a non-tag-transparent scope here, which causes pushtag to
623 put tags in this scope, rather than in the enclosing class or
624 namespace scope. This is the right thing, since we want
625 TEMPLATE_DECLS, and not TYPE_DECLS for template classes. For a
626 global template class, push_template_decl handles putting the
627 TEMPLATE_DECL into top-level scope. For a nested template class,
630 template <class T> struct S1 {
631 template <class T> struct S2 {};
634 pushtag contains special code to call pushdecl_with_scope on the
635 TEMPLATE_DECL for S2. */
636 begin_scope (sk_template_parms
, NULL
);
637 ++processing_template_decl
;
638 ++processing_template_parmlist
;
639 note_template_header (0);
642 /* This routine is called when a specialization is declared. If it is
643 invalid to declare a specialization here, an error is reported and
644 false is returned, otherwise this routine will return true. */
647 check_specialization_scope (void)
649 tree scope
= current_scope ();
653 An explicit specialization shall be declared in the namespace of
654 which the template is a member, or, for member templates, in the
655 namespace of which the enclosing class or enclosing class
656 template is a member. An explicit specialization of a member
657 function, member class or static data member of a class template
658 shall be declared in the namespace of which the class template
660 if (scope
&& TREE_CODE (scope
) != NAMESPACE_DECL
)
662 error ("explicit specialization in non-namespace scope %qD", scope
);
668 In an explicit specialization declaration for a member of a class
669 template or a member template that appears in namespace scope,
670 the member template and some of its enclosing class templates may
671 remain unspecialized, except that the declaration shall not
672 explicitly specialize a class member template if its enclosing
673 class templates are not explicitly specialized as well. */
674 if (current_template_parms
)
676 error ("enclosing class templates are not explicitly specialized");
683 /* We've just seen template <>. */
686 begin_specialization (void)
688 begin_scope (sk_template_spec
, NULL
);
689 note_template_header (1);
690 return check_specialization_scope ();
693 /* Called at then end of processing a declaration preceded by
697 end_specialization (void)
700 reset_specialization ();
703 /* Any template <>'s that we have seen thus far are not referring to a
704 function specialization. */
707 reset_specialization (void)
709 processing_specialization
= 0;
710 template_header_count
= 0;
713 /* We've just seen a template header. If SPECIALIZATION is nonzero,
714 it was of the form template <>. */
717 note_template_header (int specialization
)
719 processing_specialization
= specialization
;
720 template_header_count
++;
723 /* We're beginning an explicit instantiation. */
726 begin_explicit_instantiation (void)
728 gcc_assert (!processing_explicit_instantiation
);
729 processing_explicit_instantiation
= true;
734 end_explicit_instantiation (void)
736 gcc_assert (processing_explicit_instantiation
);
737 processing_explicit_instantiation
= false;
740 /* An explicit specialization or partial specialization of TMPL is being
741 declared. Check that the namespace in which the specialization is
742 occurring is permissible. Returns false iff it is invalid to
743 specialize TMPL in the current namespace. */
746 check_specialization_namespace (tree tmpl
)
748 tree tpl_ns
= decl_namespace_context (tmpl
);
752 An explicit specialization shall be declared in the namespace of
753 which the template is a member, or, for member templates, in the
754 namespace of which the enclosing class or enclosing class
755 template is a member. An explicit specialization of a member
756 function, member class or static data member of a class template
757 shall be declared in the namespace of which the class template is
759 if (current_scope() != DECL_CONTEXT (tmpl
)
760 && !at_namespace_scope_p ())
762 error ("specialization of %qD must appear at namespace scope", tmpl
);
765 if (is_associated_namespace (current_namespace
, tpl_ns
))
766 /* Same or super-using namespace. */
770 permerror (input_location
, "specialization of %qD in different namespace", tmpl
);
771 permerror (input_location
, " from definition of %q+#D", tmpl
);
776 /* SPEC is an explicit instantiation. Check that it is valid to
777 perform this explicit instantiation in the current namespace. */
780 check_explicit_instantiation_namespace (tree spec
)
784 /* DR 275: An explicit instantiation shall appear in an enclosing
785 namespace of its template. */
786 ns
= decl_namespace_context (spec
);
787 if (!is_ancestor (current_namespace
, ns
))
788 permerror (input_location
, "explicit instantiation of %qD in namespace %qD "
789 "(which does not enclose namespace %qD)",
790 spec
, current_namespace
, ns
);
793 /* The TYPE is being declared. If it is a template type, that means it
794 is a partial specialization. Do appropriate error-checking. */
797 maybe_process_partial_specialization (tree type
)
801 if (type
== error_mark_node
)
802 return error_mark_node
;
804 /* A lambda that appears in specialization context is not itself a
806 if (CLASS_TYPE_P (type
) && CLASSTYPE_LAMBDA_EXPR (type
))
809 if (TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
811 error ("name of class shadows template template parameter %qD",
813 return error_mark_node
;
816 context
= TYPE_CONTEXT (type
);
818 if (TYPE_ALIAS_P (type
))
820 if (TYPE_TEMPLATE_INFO (type
)
821 && DECL_ALIAS_TEMPLATE_P (TYPE_TI_TEMPLATE (type
)))
822 error ("specialization of alias template %qD",
823 TYPE_TI_TEMPLATE (type
));
825 error ("explicit specialization of non-template %qT", type
);
826 return error_mark_node
;
828 else if (CLASS_TYPE_P (type
) && CLASSTYPE_USE_TEMPLATE (type
))
830 /* This is for ordinary explicit specialization and partial
831 specialization of a template class such as:
833 template <> class C<int>;
837 template <class T> class C<T*>;
839 Make sure that `C<int>' and `C<T*>' are implicit instantiations. */
841 if (CLASSTYPE_IMPLICIT_INSTANTIATION (type
)
842 && !COMPLETE_TYPE_P (type
))
844 check_specialization_namespace (CLASSTYPE_TI_TEMPLATE (type
));
845 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type
);
846 DECL_SOURCE_LOCATION (TYPE_MAIN_DECL (type
)) = input_location
;
847 if (processing_template_decl
)
849 if (push_template_decl (TYPE_MAIN_DECL (type
))
851 return error_mark_node
;
854 else if (CLASSTYPE_TEMPLATE_INSTANTIATION (type
))
855 error ("specialization of %qT after instantiation", type
);
856 else if (errorcount
&& !processing_specialization
857 && CLASSTYPE_TEMPLATE_SPECIALIZATION (type
)
858 && !uses_template_parms (CLASSTYPE_TI_ARGS (type
)))
859 /* Trying to define a specialization either without a template<> header
860 or in an inappropriate place. We've already given an error, so just
861 bail now so we don't actually define the specialization. */
862 return error_mark_node
;
864 else if (CLASS_TYPE_P (type
)
865 && !CLASSTYPE_USE_TEMPLATE (type
)
866 && CLASSTYPE_TEMPLATE_INFO (type
)
867 && context
&& CLASS_TYPE_P (context
)
868 && CLASSTYPE_TEMPLATE_INFO (context
))
870 /* This is for an explicit specialization of member class
871 template according to [temp.expl.spec/18]:
873 template <> template <class U> class C<int>::D;
875 The context `C<int>' must be an implicit instantiation.
876 Otherwise this is just a member class template declared
879 template <> class C<int> { template <class U> class D; };
880 template <> template <class U> class C<int>::D;
882 In the first case, `C<int>::D' is a specialization of `C<T>::D'
883 while in the second case, `C<int>::D' is a primary template
884 and `C<T>::D' may not exist. */
886 if (CLASSTYPE_IMPLICIT_INSTANTIATION (context
)
887 && !COMPLETE_TYPE_P (type
))
890 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
892 if (current_namespace
893 != decl_namespace_context (tmpl
))
895 permerror (input_location
, "specializing %q#T in different namespace", type
);
896 permerror (input_location
, " from definition of %q+#D", tmpl
);
899 /* Check for invalid specialization after instantiation:
901 template <> template <> class C<int>::D<int>;
902 template <> template <class U> class C<int>::D; */
904 for (t
= DECL_TEMPLATE_INSTANTIATIONS (tmpl
);
905 t
; t
= TREE_CHAIN (t
))
907 tree inst
= TREE_VALUE (t
);
908 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (inst
))
910 /* We already have a full specialization of this partial
911 instantiation. Reassign it to the new member
912 specialization template. */
917 elt
.tmpl
= most_general_template (tmpl
);
918 elt
.args
= CLASSTYPE_TI_ARGS (inst
);
921 htab_remove_elt (type_specializations
, &elt
);
924 elt
.args
= INNERMOST_TEMPLATE_ARGS (elt
.args
);
926 slot
= htab_find_slot (type_specializations
, &elt
, INSERT
);
927 entry
= ggc_alloc_spec_entry ();
931 else if (COMPLETE_OR_OPEN_TYPE_P (inst
))
932 /* But if we've had an implicit instantiation, that's a
933 problem ([temp.expl.spec]/6). */
934 error ("specialization %qT after instantiation %qT",
938 /* Mark TYPE as a specialization. And as a result, we only
939 have one level of template argument for the innermost
941 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type
);
942 DECL_SOURCE_LOCATION (TYPE_MAIN_DECL (type
)) = input_location
;
943 CLASSTYPE_TI_ARGS (type
)
944 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type
));
947 else if (processing_specialization
)
949 /* Someday C++0x may allow for enum template specialization. */
950 if (cxx_dialect
> cxx98
&& TREE_CODE (type
) == ENUMERAL_TYPE
951 && CLASS_TYPE_P (context
) && CLASSTYPE_USE_TEMPLATE (context
))
952 pedwarn (input_location
, OPT_Wpedantic
, "template specialization "
953 "of %qD not allowed by ISO C++", type
);
956 error ("explicit specialization of non-template %qT", type
);
957 return error_mark_node
;
964 /* Returns nonzero if we can optimize the retrieval of specializations
965 for TMPL, a TEMPLATE_DECL. In particular, for such a template, we
966 do not use DECL_TEMPLATE_SPECIALIZATIONS at all. */
969 optimize_specialization_lookup_p (tree tmpl
)
971 return (DECL_FUNCTION_TEMPLATE_P (tmpl
)
972 && DECL_CLASS_SCOPE_P (tmpl
)
973 /* DECL_CLASS_SCOPE_P holds of T::f even if T is a template
975 && CLASS_TYPE_P (DECL_CONTEXT (tmpl
))
976 /* The optimized lookup depends on the fact that the
977 template arguments for the member function template apply
978 purely to the containing class, which is not true if the
979 containing class is an explicit or partial
981 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (tmpl
))
982 && !DECL_MEMBER_TEMPLATE_P (tmpl
)
983 && !DECL_CONV_FN_P (tmpl
)
984 /* It is possible to have a template that is not a member
985 template and is not a member of a template class:
987 template <typename T>
988 struct S { friend A::f(); };
990 Here, the friend function is a template, but the context does
991 not have template information. The optimized lookup relies
992 on having ARGS be the template arguments for both the class
993 and the function template. */
994 && !DECL_FRIEND_P (DECL_TEMPLATE_RESULT (tmpl
)));
997 /* Retrieve the specialization (in the sense of [temp.spec] - a
998 specialization is either an instantiation or an explicit
999 specialization) of TMPL for the given template ARGS. If there is
1000 no such specialization, return NULL_TREE. The ARGS are a vector of
1001 arguments, or a vector of vectors of arguments, in the case of
1002 templates with more than one level of parameters.
1004 If TMPL is a type template and CLASS_SPECIALIZATIONS_P is true,
1005 then we search for a partial specialization matching ARGS. This
1006 parameter is ignored if TMPL is not a class template. */
1009 retrieve_specialization (tree tmpl
, tree args
, hashval_t hash
)
1011 if (tmpl
== NULL_TREE
)
1014 if (args
== error_mark_node
)
1017 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
);
1019 /* There should be as many levels of arguments as there are
1020 levels of parameters. */
1021 gcc_assert (TMPL_ARGS_DEPTH (args
)
1022 == TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
)));
1024 if (optimize_specialization_lookup_p (tmpl
))
1026 tree class_template
;
1027 tree class_specialization
;
1028 vec
<tree
, va_gc
> *methods
;
1032 /* The template arguments actually apply to the containing
1033 class. Find the class specialization with those
1035 class_template
= CLASSTYPE_TI_TEMPLATE (DECL_CONTEXT (tmpl
));
1036 class_specialization
1037 = retrieve_specialization (class_template
, args
, 0);
1038 if (!class_specialization
)
1040 /* Now, find the appropriate entry in the CLASSTYPE_METHOD_VEC
1041 for the specialization. */
1042 idx
= class_method_index_for_fn (class_specialization
, tmpl
);
1045 /* Iterate through the methods with the indicated name, looking
1046 for the one that has an instance of TMPL. */
1047 methods
= CLASSTYPE_METHOD_VEC (class_specialization
);
1048 for (fns
= (*methods
)[idx
]; fns
; fns
= OVL_NEXT (fns
))
1050 tree fn
= OVL_CURRENT (fns
);
1051 if (DECL_TEMPLATE_INFO (fn
) && DECL_TI_TEMPLATE (fn
) == tmpl
1052 /* using-declarations can add base methods to the method vec,
1053 and we don't want those here. */
1054 && DECL_CONTEXT (fn
) == class_specialization
)
1063 htab_t specializations
;
1067 elt
.spec
= NULL_TREE
;
1069 if (DECL_CLASS_TEMPLATE_P (tmpl
))
1070 specializations
= type_specializations
;
1072 specializations
= decl_specializations
;
1075 hash
= hash_specialization (&elt
);
1076 found
= (spec_entry
*) htab_find_with_hash (specializations
, &elt
, hash
);
1084 /* Like retrieve_specialization, but for local declarations. */
1087 retrieve_local_specialization (tree tmpl
)
1091 if (local_specializations
== NULL
)
1094 slot
= pointer_map_contains (local_specializations
, tmpl
);
1095 return slot
? (tree
) *slot
: NULL_TREE
;
1098 /* Returns nonzero iff DECL is a specialization of TMPL. */
1101 is_specialization_of (tree decl
, tree tmpl
)
1105 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1109 t
= DECL_TEMPLATE_INFO (t
) ? DECL_TI_TEMPLATE (t
) : NULL_TREE
)
1115 gcc_assert (TREE_CODE (decl
) == TYPE_DECL
);
1117 for (t
= TREE_TYPE (decl
);
1119 t
= CLASSTYPE_USE_TEMPLATE (t
)
1120 ? TREE_TYPE (CLASSTYPE_TI_TEMPLATE (t
)) : NULL_TREE
)
1121 if (same_type_ignoring_top_level_qualifiers_p (t
, TREE_TYPE (tmpl
)))
1128 /* Returns nonzero iff DECL is a specialization of friend declaration
1129 FRIEND_DECL according to [temp.friend]. */
1132 is_specialization_of_friend (tree decl
, tree friend_decl
)
1134 bool need_template
= true;
1137 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
1138 || TREE_CODE (decl
) == TYPE_DECL
);
1140 /* For [temp.friend/6] when FRIEND_DECL is an ordinary member function
1141 of a template class, we want to check if DECL is a specialization
1143 if (TREE_CODE (friend_decl
) == FUNCTION_DECL
1144 && DECL_TEMPLATE_INFO (friend_decl
)
1145 && !DECL_USE_TEMPLATE (friend_decl
))
1147 /* We want a TEMPLATE_DECL for `is_specialization_of'. */
1148 friend_decl
= DECL_TI_TEMPLATE (friend_decl
);
1149 need_template
= false;
1151 else if (TREE_CODE (friend_decl
) == TEMPLATE_DECL
1152 && !PRIMARY_TEMPLATE_P (friend_decl
))
1153 need_template
= false;
1155 /* There is nothing to do if this is not a template friend. */
1156 if (TREE_CODE (friend_decl
) != TEMPLATE_DECL
)
1159 if (is_specialization_of (decl
, friend_decl
))
1163 A member of a class template may be declared to be a friend of a
1164 non-template class. In this case, the corresponding member of
1165 every specialization of the class template is a friend of the
1166 class granting friendship.
1168 For example, given a template friend declaration
1170 template <class T> friend void A<T>::f();
1172 the member function below is considered a friend
1174 template <> struct A<int> {
1178 For this type of template friend, TEMPLATE_DEPTH below will be
1179 nonzero. To determine if DECL is a friend of FRIEND, we first
1180 check if the enclosing class is a specialization of another. */
1182 template_depth
= template_class_depth (CP_DECL_CONTEXT (friend_decl
));
1184 && DECL_CLASS_SCOPE_P (decl
)
1185 && is_specialization_of (TYPE_NAME (DECL_CONTEXT (decl
)),
1186 CLASSTYPE_TI_TEMPLATE (DECL_CONTEXT (friend_decl
))))
1188 /* Next, we check the members themselves. In order to handle
1189 a few tricky cases, such as when FRIEND_DECL's are
1191 template <class T> friend void A<T>::g(T t);
1192 template <class T> template <T t> friend void A<T>::h();
1196 void A<int>::g(int);
1197 template <int> void A<int>::h();
1199 we need to figure out ARGS, the template arguments from
1200 the context of DECL. This is required for template substitution
1201 of `T' in the function parameter of `g' and template parameter
1202 of `h' in the above examples. Here ARGS corresponds to `int'. */
1204 tree context
= DECL_CONTEXT (decl
);
1205 tree args
= NULL_TREE
;
1206 int current_depth
= 0;
1208 while (current_depth
< template_depth
)
1210 if (CLASSTYPE_TEMPLATE_INFO (context
))
1212 if (current_depth
== 0)
1213 args
= TYPE_TI_ARGS (context
);
1215 args
= add_to_template_args (TYPE_TI_ARGS (context
), args
);
1218 context
= TYPE_CONTEXT (context
);
1221 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1226 tree friend_args_type
;
1227 tree decl_args_type
;
1229 /* Make sure that both DECL and FRIEND_DECL are templates or
1231 is_template
= DECL_TEMPLATE_INFO (decl
)
1232 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl
));
1233 if (need_template
^ is_template
)
1235 else if (is_template
)
1237 /* If both are templates, check template parameter list. */
1239 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_decl
),
1241 if (!comp_template_parms
1242 (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (decl
)),
1246 decl_type
= TREE_TYPE (DECL_TI_TEMPLATE (decl
));
1249 decl_type
= TREE_TYPE (decl
);
1251 friend_type
= tsubst_function_type (TREE_TYPE (friend_decl
), args
,
1252 tf_none
, NULL_TREE
);
1253 if (friend_type
== error_mark_node
)
1256 /* Check if return types match. */
1257 if (!same_type_p (TREE_TYPE (decl_type
), TREE_TYPE (friend_type
)))
1260 /* Check if function parameter types match, ignoring the
1261 `this' parameter. */
1262 friend_args_type
= TYPE_ARG_TYPES (friend_type
);
1263 decl_args_type
= TYPE_ARG_TYPES (decl_type
);
1264 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (friend_decl
))
1265 friend_args_type
= TREE_CHAIN (friend_args_type
);
1266 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1267 decl_args_type
= TREE_CHAIN (decl_args_type
);
1269 return compparms (decl_args_type
, friend_args_type
);
1273 /* DECL is a TYPE_DECL */
1275 tree decl_type
= TREE_TYPE (decl
);
1277 /* Make sure that both DECL and FRIEND_DECL are templates or
1280 = CLASSTYPE_TEMPLATE_INFO (decl_type
)
1281 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (decl_type
));
1283 if (need_template
^ is_template
)
1285 else if (is_template
)
1288 /* If both are templates, check the name of the two
1289 TEMPLATE_DECL's first because is_friend didn't. */
1290 if (DECL_NAME (CLASSTYPE_TI_TEMPLATE (decl_type
))
1291 != DECL_NAME (friend_decl
))
1294 /* Now check template parameter list. */
1296 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_decl
),
1298 return comp_template_parms
1299 (DECL_TEMPLATE_PARMS (CLASSTYPE_TI_TEMPLATE (decl_type
)),
1303 return (DECL_NAME (decl
)
1304 == DECL_NAME (friend_decl
));
1310 /* Register the specialization SPEC as a specialization of TMPL with
1311 the indicated ARGS. IS_FRIEND indicates whether the specialization
1312 is actually just a friend declaration. Returns SPEC, or an
1313 equivalent prior declaration, if available. */
1316 register_specialization (tree spec
, tree tmpl
, tree args
, bool is_friend
,
1323 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
&& DECL_P (spec
));
1325 if (TREE_CODE (spec
) == FUNCTION_DECL
1326 && uses_template_parms (DECL_TI_ARGS (spec
)))
1327 /* This is the FUNCTION_DECL for a partial instantiation. Don't
1328 register it; we want the corresponding TEMPLATE_DECL instead.
1329 We use `uses_template_parms (DECL_TI_ARGS (spec))' rather than
1330 the more obvious `uses_template_parms (spec)' to avoid problems
1331 with default function arguments. In particular, given
1332 something like this:
1334 template <class T> void f(T t1, T t = T())
1336 the default argument expression is not substituted for in an
1337 instantiation unless and until it is actually needed. */
1340 if (optimize_specialization_lookup_p (tmpl
))
1341 /* We don't put these specializations in the hash table, but we might
1342 want to give an error about a mismatch. */
1343 fn
= retrieve_specialization (tmpl
, args
, 0);
1351 hash
= hash_specialization (&elt
);
1354 htab_find_slot_with_hash (decl_specializations
, &elt
, hash
, INSERT
);
1356 fn
= ((spec_entry
*) *slot
)->spec
;
1361 /* We can sometimes try to re-register a specialization that we've
1362 already got. In particular, regenerate_decl_from_template calls
1363 duplicate_decls which will update the specialization list. But,
1364 we'll still get called again here anyhow. It's more convenient
1365 to simply allow this than to try to prevent it. */
1368 else if (fn
&& DECL_TEMPLATE_SPECIALIZATION (spec
))
1370 if (DECL_TEMPLATE_INSTANTIATION (fn
))
1372 if (DECL_ODR_USED (fn
)
1373 || DECL_EXPLICIT_INSTANTIATION (fn
))
1375 error ("specialization of %qD after instantiation",
1377 return error_mark_node
;
1382 /* This situation should occur only if the first
1383 specialization is an implicit instantiation, the
1384 second is an explicit specialization, and the
1385 implicit instantiation has not yet been used. That
1386 situation can occur if we have implicitly
1387 instantiated a member function and then specialized
1390 We can also wind up here if a friend declaration that
1391 looked like an instantiation turns out to be a
1394 template <class T> void foo(T);
1395 class S { friend void foo<>(int) };
1396 template <> void foo(int);
1398 We transform the existing DECL in place so that any
1399 pointers to it become pointers to the updated
1402 If there was a definition for the template, but not
1403 for the specialization, we want this to look as if
1404 there were no definition, and vice versa. */
1405 DECL_INITIAL (fn
) = NULL_TREE
;
1406 duplicate_decls (spec
, fn
, is_friend
);
1407 /* The call to duplicate_decls will have applied
1410 An explicit specialization of a function template
1411 is inline only if it is explicitly declared to be,
1412 and independently of whether its function template
1415 to the primary function; now copy the inline bits to
1416 the various clones. */
1417 FOR_EACH_CLONE (clone
, fn
)
1419 DECL_DECLARED_INLINE_P (clone
)
1420 = DECL_DECLARED_INLINE_P (fn
);
1421 DECL_SOURCE_LOCATION (clone
)
1422 = DECL_SOURCE_LOCATION (fn
);
1424 check_specialization_namespace (tmpl
);
1429 else if (DECL_TEMPLATE_SPECIALIZATION (fn
))
1431 if (!duplicate_decls (spec
, fn
, is_friend
) && DECL_INITIAL (spec
))
1432 /* Dup decl failed, but this is a new definition. Set the
1433 line number so any errors match this new
1435 DECL_SOURCE_LOCATION (fn
) = DECL_SOURCE_LOCATION (spec
);
1441 return duplicate_decls (spec
, fn
, is_friend
);
1443 /* A specialization must be declared in the same namespace as the
1444 template it is specializing. */
1445 if (DECL_TEMPLATE_SPECIALIZATION (spec
)
1446 && !check_specialization_namespace (tmpl
))
1447 DECL_CONTEXT (spec
) = DECL_CONTEXT (tmpl
);
1449 if (slot
!= NULL
/* !optimize_specialization_lookup_p (tmpl) */)
1451 spec_entry
*entry
= ggc_alloc_spec_entry ();
1452 gcc_assert (tmpl
&& args
&& spec
);
1455 if (TREE_CODE (spec
) == FUNCTION_DECL
&& DECL_NAMESPACE_SCOPE_P (spec
)
1456 && PRIMARY_TEMPLATE_P (tmpl
)
1457 && DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (tmpl
)) == NULL_TREE
)
1458 /* TMPL is a forward declaration of a template function; keep a list
1459 of all specializations in case we need to reassign them to a friend
1460 template later in tsubst_friend_function. */
1461 DECL_TEMPLATE_INSTANTIATIONS (tmpl
)
1462 = tree_cons (args
, spec
, DECL_TEMPLATE_INSTANTIATIONS (tmpl
));
1468 /* Returns true iff two spec_entry nodes are equivalent. Only compares the
1469 TMPL and ARGS members, ignores SPEC. */
1471 int comparing_specializations
;
1474 eq_specializations (const void *p1
, const void *p2
)
1476 const spec_entry
*e1
= (const spec_entry
*)p1
;
1477 const spec_entry
*e2
= (const spec_entry
*)p2
;
1480 ++comparing_specializations
;
1481 equal
= (e1
->tmpl
== e2
->tmpl
1482 && comp_template_args (e1
->args
, e2
->args
));
1483 --comparing_specializations
;
1488 /* Returns a hash for a template TMPL and template arguments ARGS. */
1491 hash_tmpl_and_args (tree tmpl
, tree args
)
1493 hashval_t val
= DECL_UID (tmpl
);
1494 return iterative_hash_template_arg (args
, val
);
1497 /* Returns a hash for a spec_entry node based on the TMPL and ARGS members,
1501 hash_specialization (const void *p
)
1503 const spec_entry
*e
= (const spec_entry
*)p
;
1504 return hash_tmpl_and_args (e
->tmpl
, e
->args
);
1507 /* Recursively calculate a hash value for a template argument ARG, for use
1508 in the hash tables of template specializations. */
1511 iterative_hash_template_arg (tree arg
, hashval_t val
)
1513 unsigned HOST_WIDE_INT i
;
1514 enum tree_code code
;
1517 if (arg
== NULL_TREE
)
1518 return iterative_hash_object (arg
, val
);
1523 if (TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
1524 /* We can get one of these when re-hashing a previous entry in the middle
1525 of substituting into a pack expansion. Just look through it. */
1526 arg
= ARGUMENT_PACK_SELECT_FROM_PACK (arg
);
1528 code
= TREE_CODE (arg
);
1529 tclass
= TREE_CODE_CLASS (code
);
1531 val
= iterative_hash_object (code
, val
);
1538 case IDENTIFIER_NODE
:
1539 return iterative_hash_object (IDENTIFIER_HASH_VALUE (arg
), val
);
1543 int i
, len
= TREE_VEC_LENGTH (arg
);
1544 for (i
= 0; i
< len
; ++i
)
1545 val
= iterative_hash_template_arg (TREE_VEC_ELT (arg
, i
), val
);
1549 case TYPE_PACK_EXPANSION
:
1550 case EXPR_PACK_EXPANSION
:
1551 val
= iterative_hash_template_arg (PACK_EXPANSION_PATTERN (arg
), val
);
1552 return iterative_hash_template_arg (PACK_EXPANSION_EXTRA_ARGS (arg
), val
);
1554 case TYPE_ARGUMENT_PACK
:
1555 case NONTYPE_ARGUMENT_PACK
:
1556 return iterative_hash_template_arg (ARGUMENT_PACK_ARGS (arg
), val
);
1559 for (; arg
; arg
= TREE_CHAIN (arg
))
1560 val
= iterative_hash_template_arg (TREE_VALUE (arg
), val
);
1564 for (; arg
; arg
= OVL_NEXT (arg
))
1565 val
= iterative_hash_template_arg (OVL_CURRENT (arg
), val
);
1571 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (arg
), i
, field
, value
)
1573 val
= iterative_hash_template_arg (field
, val
);
1574 val
= iterative_hash_template_arg (value
, val
);
1580 if (!DECL_ARTIFICIAL (arg
))
1582 val
= iterative_hash_object (DECL_PARM_INDEX (arg
), val
);
1583 val
= iterative_hash_object (DECL_PARM_LEVEL (arg
), val
);
1585 return iterative_hash_template_arg (TREE_TYPE (arg
), val
);
1588 return iterative_hash_template_arg (TARGET_EXPR_INITIAL (arg
), val
);
1591 val
= iterative_hash_template_arg (PTRMEM_CST_CLASS (arg
), val
);
1592 return iterative_hash_template_arg (PTRMEM_CST_MEMBER (arg
), val
);
1594 case TEMPLATE_PARM_INDEX
:
1595 val
= iterative_hash_template_arg
1596 (TREE_TYPE (TEMPLATE_PARM_DECL (arg
)), val
);
1597 val
= iterative_hash_object (TEMPLATE_PARM_LEVEL (arg
), val
);
1598 return iterative_hash_object (TEMPLATE_PARM_IDX (arg
), val
);
1601 val
= iterative_hash_object (TRAIT_EXPR_KIND (arg
), val
);
1602 val
= iterative_hash_template_arg (TRAIT_EXPR_TYPE1 (arg
), val
);
1603 return iterative_hash_template_arg (TRAIT_EXPR_TYPE2 (arg
), val
);
1606 val
= iterative_hash_template_arg (BINFO_TYPE (BASELINK_BINFO (arg
)),
1608 return iterative_hash_template_arg (DECL_NAME (get_first_fn (arg
)),
1612 val
= iterative_hash_template_arg (TREE_OPERAND (arg
, 0), val
);
1613 code
= TREE_CODE (TREE_OPERAND (arg
, 1));
1614 val
= iterative_hash_object (code
, val
);
1615 return iterative_hash_template_arg (TREE_OPERAND (arg
, 2), val
);
1618 /* A lambda can't appear in a template arg, but don't crash on
1620 gcc_assert (seen_error ());
1624 case IMPLICIT_CONV_EXPR
:
1625 case STATIC_CAST_EXPR
:
1626 case REINTERPRET_CAST_EXPR
:
1627 case CONST_CAST_EXPR
:
1628 case DYNAMIC_CAST_EXPR
:
1630 val
= iterative_hash_template_arg (TREE_TYPE (arg
), val
);
1631 /* Now hash operands as usual. */
1641 if (TYPE_CANONICAL (arg
))
1642 return iterative_hash_object (TYPE_HASH (TYPE_CANONICAL (arg
)),
1644 else if (TREE_CODE (arg
) == DECLTYPE_TYPE
)
1645 return iterative_hash_template_arg (DECLTYPE_TYPE_EXPR (arg
), val
);
1646 /* Otherwise just compare the types during lookup. */
1649 case tcc_declaration
:
1651 return iterative_hash_expr (arg
, val
);
1654 gcc_assert (IS_EXPR_CODE_CLASS (tclass
));
1656 unsigned n
= cp_tree_operand_length (arg
);
1657 for (i
= 0; i
< n
; ++i
)
1658 val
= iterative_hash_template_arg (TREE_OPERAND (arg
, i
), val
);
1666 /* Unregister the specialization SPEC as a specialization of TMPL.
1667 Replace it with NEW_SPEC, if NEW_SPEC is non-NULL. Returns true
1668 if the SPEC was listed as a specialization of TMPL.
1670 Note that SPEC has been ggc_freed, so we can't look inside it. */
1673 reregister_specialization (tree spec
, tree tinfo
, tree new_spec
)
1678 elt
.tmpl
= most_general_template (TI_TEMPLATE (tinfo
));
1679 elt
.args
= TI_ARGS (tinfo
);
1680 elt
.spec
= NULL_TREE
;
1682 entry
= (spec_entry
*) htab_find (decl_specializations
, &elt
);
1685 gcc_assert (entry
->spec
== spec
|| entry
->spec
== new_spec
);
1686 gcc_assert (new_spec
!= NULL_TREE
);
1687 entry
->spec
= new_spec
;
1694 /* Like register_specialization, but for local declarations. We are
1695 registering SPEC, an instantiation of TMPL. */
1698 register_local_specialization (tree spec
, tree tmpl
)
1702 slot
= pointer_map_insert (local_specializations
, tmpl
);
1706 /* TYPE is a class type. Returns true if TYPE is an explicitly
1707 specialized class. */
1710 explicit_class_specialization_p (tree type
)
1712 if (!CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
1714 return !uses_template_parms (CLASSTYPE_TI_ARGS (type
));
1717 /* Print the list of functions at FNS, going through all the overloads
1718 for each element of the list. Alternatively, FNS can not be a
1719 TREE_LIST, in which case it will be printed together with all the
1722 MORE and *STR should respectively be FALSE and NULL when the function
1723 is called from the outside. They are used internally on recursive
1724 calls. print_candidates manages the two parameters and leaves NULL
1725 in *STR when it ends. */
1728 print_candidates_1 (tree fns
, bool more
, const char **str
)
1731 char *spaces
= NULL
;
1733 for (fn
= fns
; fn
; fn
= OVL_NEXT (fn
))
1734 if (TREE_CODE (fn
) == TREE_LIST
)
1736 for (fn2
= fn
; fn2
!= NULL_TREE
; fn2
= TREE_CHAIN (fn2
))
1737 print_candidates_1 (TREE_VALUE (fn2
),
1738 TREE_CHAIN (fn2
) || more
, str
);
1742 tree cand
= OVL_CURRENT (fn
);
1745 /* Pick the prefix string. */
1746 if (!more
&& !OVL_NEXT (fns
))
1748 inform (DECL_SOURCE_LOCATION (cand
),
1749 "candidate is: %#D", cand
);
1753 *str
= _("candidates are:");
1754 spaces
= get_spaces (*str
);
1756 inform (DECL_SOURCE_LOCATION (cand
), "%s %#D", *str
, cand
);
1757 *str
= spaces
? spaces
: *str
;
1767 /* Print the list of candidate FNS in an error message. FNS can also
1768 be a TREE_LIST of non-functions in the case of an ambiguous lookup. */
1771 print_candidates (tree fns
)
1773 const char *str
= NULL
;
1774 print_candidates_1 (fns
, false, &str
);
1775 gcc_assert (str
== NULL
);
1778 /* Returns the template (one of the functions given by TEMPLATE_ID)
1779 which can be specialized to match the indicated DECL with the
1780 explicit template args given in TEMPLATE_ID. The DECL may be
1781 NULL_TREE if none is available. In that case, the functions in
1782 TEMPLATE_ID are non-members.
1784 If NEED_MEMBER_TEMPLATE is nonzero the function is known to be a
1785 specialization of a member template.
1787 The TEMPLATE_COUNT is the number of references to qualifying
1788 template classes that appeared in the name of the function. See
1789 check_explicit_specialization for a more accurate description.
1791 TSK indicates what kind of template declaration (if any) is being
1792 declared. TSK_TEMPLATE indicates that the declaration given by
1793 DECL, though a FUNCTION_DECL, has template parameters, and is
1794 therefore a template function.
1796 The template args (those explicitly specified and those deduced)
1797 are output in a newly created vector *TARGS_OUT.
1799 If it is impossible to determine the result, an error message is
1800 issued. The error_mark_node is returned to indicate failure. */
1803 determine_specialization (tree template_id
,
1806 int need_member_template
,
1812 tree explicit_targs
;
1813 tree candidates
= NULL_TREE
;
1814 /* A TREE_LIST of templates of which DECL may be a specialization.
1815 The TREE_VALUE of each node is a TEMPLATE_DECL. The
1816 corresponding TREE_PURPOSE is the set of template arguments that,
1817 when used to instantiate the template, would produce a function
1818 with the signature of DECL. */
1819 tree templates
= NULL_TREE
;
1821 cp_binding_level
*b
;
1823 *targs_out
= NULL_TREE
;
1825 if (template_id
== error_mark_node
|| decl
== error_mark_node
)
1826 return error_mark_node
;
1828 /* We shouldn't be specializing a member template of an
1829 unspecialized class template; we already gave an error in
1830 check_specialization_scope, now avoid crashing. */
1831 if (template_count
&& DECL_CLASS_SCOPE_P (decl
)
1832 && template_class_depth (DECL_CONTEXT (decl
)) > 0)
1834 gcc_assert (errorcount
);
1835 return error_mark_node
;
1838 fns
= TREE_OPERAND (template_id
, 0);
1839 explicit_targs
= TREE_OPERAND (template_id
, 1);
1841 if (fns
== error_mark_node
)
1842 return error_mark_node
;
1844 /* Check for baselinks. */
1845 if (BASELINK_P (fns
))
1846 fns
= BASELINK_FUNCTIONS (fns
);
1848 if (!is_overloaded_fn (fns
))
1850 error ("%qD is not a function template", fns
);
1851 return error_mark_node
;
1854 /* Count the number of template headers specified for this
1857 for (b
= current_binding_level
;
1858 b
->kind
== sk_template_parms
;
1862 for (; fns
; fns
= OVL_NEXT (fns
))
1864 tree fn
= OVL_CURRENT (fns
);
1866 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
1868 tree decl_arg_types
;
1872 /* In case of explicit specialization, we need to check if
1873 the number of template headers appearing in the specialization
1874 is correct. This is usually done in check_explicit_specialization,
1875 but the check done there cannot be exhaustive when specializing
1876 member functions. Consider the following code:
1878 template <> void A<int>::f(int);
1879 template <> template <> void A<int>::f(int);
1881 Assuming that A<int> is not itself an explicit specialization
1882 already, the first line specializes "f" which is a non-template
1883 member function, whilst the second line specializes "f" which
1884 is a template member function. So both lines are syntactically
1885 correct, and check_explicit_specialization does not reject
1888 Here, we can do better, as we are matching the specialization
1889 against the declarations. We count the number of template
1890 headers, and we check if they match TEMPLATE_COUNT + 1
1891 (TEMPLATE_COUNT is the number of qualifying template classes,
1892 plus there must be another header for the member template
1895 Notice that if header_count is zero, this is not a
1896 specialization but rather a template instantiation, so there
1897 is no check we can perform here. */
1898 if (header_count
&& header_count
!= template_count
+ 1)
1901 /* Check that the number of template arguments at the
1902 innermost level for DECL is the same as for FN. */
1903 if (current_binding_level
->kind
== sk_template_parms
1904 && !current_binding_level
->explicit_spec_p
1905 && (TREE_VEC_LENGTH (DECL_INNERMOST_TEMPLATE_PARMS (fn
))
1906 != TREE_VEC_LENGTH (INNERMOST_TEMPLATE_PARMS
1907 (current_template_parms
))))
1910 /* DECL might be a specialization of FN. */
1911 decl_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
1912 fn_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
1914 /* For a non-static member function, we need to make sure
1915 that the const qualification is the same. Since
1916 get_bindings does not try to merge the "this" parameter,
1917 we must do the comparison explicitly. */
1918 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
1919 && !same_type_p (TREE_VALUE (fn_arg_types
),
1920 TREE_VALUE (decl_arg_types
)))
1923 /* Skip the "this" parameter and, for constructors of
1924 classes with virtual bases, the VTT parameter. A
1925 full specialization of a constructor will have a VTT
1926 parameter, but a template never will. */
1928 = skip_artificial_parms_for (decl
, decl_arg_types
);
1930 = skip_artificial_parms_for (fn
, fn_arg_types
);
1932 /* Function templates cannot be specializations; there are
1933 no partial specializations of functions. Therefore, if
1934 the type of DECL does not match FN, there is no
1936 if (tsk
== tsk_template
)
1938 if (compparms (fn_arg_types
, decl_arg_types
))
1939 candidates
= tree_cons (NULL_TREE
, fn
, candidates
);
1943 /* See whether this function might be a specialization of this
1944 template. Suppress access control because we might be trying
1945 to make this specialization a friend, and we have already done
1946 access control for the declaration of the specialization. */
1947 push_deferring_access_checks (dk_no_check
);
1948 targs
= get_bindings (fn
, decl
, explicit_targs
, /*check_ret=*/true);
1949 pop_deferring_access_checks ();
1952 /* We cannot deduce template arguments that when used to
1953 specialize TMPL will produce DECL. */
1956 /* Make sure that the deduced arguments actually work. */
1957 insttype
= tsubst (TREE_TYPE (fn
), targs
, tf_none
, NULL_TREE
);
1958 if (insttype
== error_mark_node
)
1961 = skip_artificial_parms_for (fn
, TYPE_ARG_TYPES (insttype
));
1962 if (!compparms (fn_arg_types
, decl_arg_types
))
1965 /* Save this template, and the arguments deduced. */
1966 templates
= tree_cons (targs
, fn
, templates
);
1968 else if (need_member_template
)
1969 /* FN is an ordinary member function, and we need a
1970 specialization of a member template. */
1972 else if (TREE_CODE (fn
) != FUNCTION_DECL
)
1973 /* We can get IDENTIFIER_NODEs here in certain erroneous
1976 else if (!DECL_FUNCTION_MEMBER_P (fn
))
1977 /* This is just an ordinary non-member function. Nothing can
1978 be a specialization of that. */
1980 else if (DECL_ARTIFICIAL (fn
))
1981 /* Cannot specialize functions that are created implicitly. */
1985 tree decl_arg_types
;
1987 /* This is an ordinary member function. However, since
1988 we're here, we can assume it's enclosing class is a
1989 template class. For example,
1991 template <typename T> struct S { void f(); };
1992 template <> void S<int>::f() {}
1994 Here, S<int>::f is a non-template, but S<int> is a
1995 template class. If FN has the same type as DECL, we
1996 might be in business. */
1998 if (!DECL_TEMPLATE_INFO (fn
))
1999 /* Its enclosing class is an explicit specialization
2000 of a template class. This is not a candidate. */
2003 if (!same_type_p (TREE_TYPE (TREE_TYPE (decl
)),
2004 TREE_TYPE (TREE_TYPE (fn
))))
2005 /* The return types differ. */
2008 /* Adjust the type of DECL in case FN is a static member. */
2009 decl_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
2010 if (DECL_STATIC_FUNCTION_P (fn
)
2011 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
2012 decl_arg_types
= TREE_CHAIN (decl_arg_types
);
2014 if (compparms (TYPE_ARG_TYPES (TREE_TYPE (fn
)),
2017 candidates
= tree_cons (NULL_TREE
, fn
, candidates
);
2021 if (templates
&& TREE_CHAIN (templates
))
2027 It is possible for a specialization with a given function
2028 signature to be instantiated from more than one function
2029 template. In such cases, explicit specification of the
2030 template arguments must be used to uniquely identify the
2031 function template specialization being specialized.
2033 Note that here, there's no suggestion that we're supposed to
2034 determine which of the candidate templates is most
2035 specialized. However, we, also have:
2039 Partial ordering of overloaded function template
2040 declarations is used in the following contexts to select
2041 the function template to which a function template
2042 specialization refers:
2044 -- when an explicit specialization refers to a function
2047 So, we do use the partial ordering rules, at least for now.
2048 This extension can only serve to make invalid programs valid,
2049 so it's safe. And, there is strong anecdotal evidence that
2050 the committee intended the partial ordering rules to apply;
2051 the EDG front end has that behavior, and John Spicer claims
2052 that the committee simply forgot to delete the wording in
2053 [temp.expl.spec]. */
2054 tree tmpl
= most_specialized_instantiation (templates
);
2055 if (tmpl
!= error_mark_node
)
2058 TREE_CHAIN (templates
) = NULL_TREE
;
2062 if (templates
== NULL_TREE
&& candidates
== NULL_TREE
)
2064 error ("template-id %qD for %q+D does not match any template "
2065 "declaration", template_id
, decl
);
2066 if (header_count
&& header_count
!= template_count
+ 1)
2067 inform (input_location
, "saw %d %<template<>%>, need %d for "
2068 "specializing a member function template",
2069 header_count
, template_count
+ 1);
2070 return error_mark_node
;
2072 else if ((templates
&& TREE_CHAIN (templates
))
2073 || (candidates
&& TREE_CHAIN (candidates
))
2074 || (templates
&& candidates
))
2076 error ("ambiguous template specialization %qD for %q+D",
2078 candidates
= chainon (candidates
, templates
);
2079 print_candidates (candidates
);
2080 return error_mark_node
;
2083 /* We have one, and exactly one, match. */
2086 tree fn
= TREE_VALUE (candidates
);
2087 *targs_out
= copy_node (DECL_TI_ARGS (fn
));
2088 /* DECL is a re-declaration or partial instantiation of a template
2090 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
2092 /* It was a specialization of an ordinary member function in a
2094 return DECL_TI_TEMPLATE (fn
);
2097 /* It was a specialization of a template. */
2098 targs
= DECL_TI_ARGS (DECL_TEMPLATE_RESULT (TREE_VALUE (templates
)));
2099 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (targs
))
2101 *targs_out
= copy_node (targs
);
2102 SET_TMPL_ARGS_LEVEL (*targs_out
,
2103 TMPL_ARGS_DEPTH (*targs_out
),
2104 TREE_PURPOSE (templates
));
2107 *targs_out
= TREE_PURPOSE (templates
);
2108 return TREE_VALUE (templates
);
2111 /* Returns a chain of parameter types, exactly like the SPEC_TYPES,
2112 but with the default argument values filled in from those in the
2116 copy_default_args_to_explicit_spec_1 (tree spec_types
,
2119 tree new_spec_types
;
2124 if (spec_types
== void_list_node
)
2125 return void_list_node
;
2127 /* Substitute into the rest of the list. */
2129 copy_default_args_to_explicit_spec_1 (TREE_CHAIN (spec_types
),
2130 TREE_CHAIN (tmpl_types
));
2132 /* Add the default argument for this parameter. */
2133 return hash_tree_cons (TREE_PURPOSE (tmpl_types
),
2134 TREE_VALUE (spec_types
),
2138 /* DECL is an explicit specialization. Replicate default arguments
2139 from the template it specializes. (That way, code like:
2141 template <class T> void f(T = 3);
2142 template <> void f(double);
2145 works, as required.) An alternative approach would be to look up
2146 the correct default arguments at the call-site, but this approach
2147 is consistent with how implicit instantiations are handled. */
2150 copy_default_args_to_explicit_spec (tree decl
)
2155 tree new_spec_types
;
2159 tree object_type
= NULL_TREE
;
2160 tree in_charge
= NULL_TREE
;
2161 tree vtt
= NULL_TREE
;
2163 /* See if there's anything we need to do. */
2164 tmpl
= DECL_TI_TEMPLATE (decl
);
2165 tmpl_types
= TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (tmpl
)));
2166 for (t
= tmpl_types
; t
; t
= TREE_CHAIN (t
))
2167 if (TREE_PURPOSE (t
))
2172 old_type
= TREE_TYPE (decl
);
2173 spec_types
= TYPE_ARG_TYPES (old_type
);
2175 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
2177 /* Remove the this pointer, but remember the object's type for
2179 object_type
= TREE_TYPE (TREE_VALUE (spec_types
));
2180 spec_types
= TREE_CHAIN (spec_types
);
2181 tmpl_types
= TREE_CHAIN (tmpl_types
);
2183 if (DECL_HAS_IN_CHARGE_PARM_P (decl
))
2185 /* DECL may contain more parameters than TMPL due to the extra
2186 in-charge parameter in constructors and destructors. */
2187 in_charge
= spec_types
;
2188 spec_types
= TREE_CHAIN (spec_types
);
2190 if (DECL_HAS_VTT_PARM_P (decl
))
2193 spec_types
= TREE_CHAIN (spec_types
);
2197 /* Compute the merged default arguments. */
2199 copy_default_args_to_explicit_spec_1 (spec_types
, tmpl_types
);
2201 /* Compute the new FUNCTION_TYPE. */
2205 new_spec_types
= hash_tree_cons (TREE_PURPOSE (vtt
),
2210 /* Put the in-charge parameter back. */
2211 new_spec_types
= hash_tree_cons (TREE_PURPOSE (in_charge
),
2212 TREE_VALUE (in_charge
),
2215 new_type
= build_method_type_directly (object_type
,
2216 TREE_TYPE (old_type
),
2220 new_type
= build_function_type (TREE_TYPE (old_type
),
2222 new_type
= cp_build_type_attribute_variant (new_type
,
2223 TYPE_ATTRIBUTES (old_type
));
2224 new_type
= build_exception_variant (new_type
,
2225 TYPE_RAISES_EXCEPTIONS (old_type
));
2226 TREE_TYPE (decl
) = new_type
;
2229 /* Return the number of template headers we expect to see for a definition
2230 or specialization of CTYPE or one of its non-template members. */
2233 num_template_headers_for_class (tree ctype
)
2235 int num_templates
= 0;
2237 while (ctype
&& CLASS_TYPE_P (ctype
))
2239 /* You're supposed to have one `template <...>' for every
2240 template class, but you don't need one for a full
2241 specialization. For example:
2243 template <class T> struct S{};
2244 template <> struct S<int> { void f(); };
2245 void S<int>::f () {}
2247 is correct; there shouldn't be a `template <>' for the
2248 definition of `S<int>::f'. */
2249 if (!CLASSTYPE_TEMPLATE_INFO (ctype
))
2250 /* If CTYPE does not have template information of any
2251 kind, then it is not a template, nor is it nested
2252 within a template. */
2254 if (explicit_class_specialization_p (ctype
))
2256 if (PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (ctype
)))
2259 ctype
= TYPE_CONTEXT (ctype
);
2262 return num_templates
;
2265 /* Do a simple sanity check on the template headers that precede the
2266 variable declaration DECL. */
2269 check_template_variable (tree decl
)
2271 tree ctx
= CP_DECL_CONTEXT (decl
);
2272 int wanted
= num_template_headers_for_class (ctx
);
2273 if (!TYPE_P (ctx
) || !CLASSTYPE_TEMPLATE_INFO (ctx
))
2274 permerror (DECL_SOURCE_LOCATION (decl
),
2275 "%qD is not a static data member of a class template", decl
);
2276 else if (template_header_count
> wanted
)
2278 pedwarn (DECL_SOURCE_LOCATION (decl
), 0,
2279 "too many template headers for %D (should be %d)",
2281 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (ctx
))
2282 inform (DECL_SOURCE_LOCATION (decl
),
2283 "members of an explicitly specialized class are defined "
2284 "without a template header");
2288 /* Check to see if the function just declared, as indicated in
2289 DECLARATOR, and in DECL, is a specialization of a function
2290 template. We may also discover that the declaration is an explicit
2291 instantiation at this point.
2293 Returns DECL, or an equivalent declaration that should be used
2294 instead if all goes well. Issues an error message if something is
2295 amiss. Returns error_mark_node if the error is not easily
2298 FLAGS is a bitmask consisting of the following flags:
2300 2: The function has a definition.
2301 4: The function is a friend.
2303 The TEMPLATE_COUNT is the number of references to qualifying
2304 template classes that appeared in the name of the function. For
2307 template <class T> struct S { void f(); };
2310 the TEMPLATE_COUNT would be 1. However, explicitly specialized
2311 classes are not counted in the TEMPLATE_COUNT, so that in
2313 template <class T> struct S {};
2314 template <> struct S<int> { void f(); }
2315 template <> void S<int>::f();
2317 the TEMPLATE_COUNT would be 0. (Note that this declaration is
2318 invalid; there should be no template <>.)
2320 If the function is a specialization, it is marked as such via
2321 DECL_TEMPLATE_SPECIALIZATION. Furthermore, its DECL_TEMPLATE_INFO
2322 is set up correctly, and it is added to the list of specializations
2323 for that template. */
2326 check_explicit_specialization (tree declarator
,
2331 int have_def
= flags
& 2;
2332 int is_friend
= flags
& 4;
2333 int specialization
= 0;
2334 int explicit_instantiation
= 0;
2335 int member_specialization
= 0;
2336 tree ctype
= DECL_CLASS_CONTEXT (decl
);
2337 tree dname
= DECL_NAME (decl
);
2342 if (!processing_specialization
)
2345 tsk
= tsk_excessive_parms
;
2348 tsk
= current_tmpl_spec_kind (template_count
);
2353 if (processing_specialization
)
2356 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
2358 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
2361 /* This could be something like:
2363 template <class T> void f(T);
2364 class S { friend void f<>(int); } */
2368 /* This case handles bogus declarations like template <>
2369 template <class T> void f<int>(); */
2371 error ("template-id %qD in declaration of primary template",
2378 case tsk_invalid_member_spec
:
2379 /* The error has already been reported in
2380 check_specialization_scope. */
2381 return error_mark_node
;
2383 case tsk_invalid_expl_inst
:
2384 error ("template parameter list used in explicit instantiation");
2390 error ("definition provided for explicit instantiation");
2392 explicit_instantiation
= 1;
2395 case tsk_excessive_parms
:
2396 case tsk_insufficient_parms
:
2397 if (tsk
== tsk_excessive_parms
)
2398 error ("too many template parameter lists in declaration of %qD",
2400 else if (template_header_count
)
2401 error("too few template parameter lists in declaration of %qD", decl
);
2403 error("explicit specialization of %qD must be introduced by "
2404 "%<template <>%>", decl
);
2408 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
2410 member_specialization
= 1;
2416 if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
2418 /* This case handles bogus declarations like template <>
2419 template <class T> void f<int>(); */
2421 if (uses_template_parms (declarator
))
2422 error ("function template partial specialization %qD "
2423 "is not allowed", declarator
);
2425 error ("template-id %qD in declaration of primary template",
2430 if (ctype
&& CLASSTYPE_TEMPLATE_INSTANTIATION (ctype
))
2431 /* This is a specialization of a member template, without
2432 specialization the containing class. Something like:
2434 template <class T> struct S {
2435 template <class U> void f (U);
2437 template <> template <class U> void S<int>::f(U) {}
2439 That's a specialization -- but of the entire template. */
2447 if (specialization
|| member_specialization
)
2449 tree t
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
2450 for (; t
; t
= TREE_CHAIN (t
))
2451 if (TREE_PURPOSE (t
))
2453 permerror (input_location
,
2454 "default argument specified in explicit specialization");
2459 if (specialization
|| member_specialization
|| explicit_instantiation
)
2461 tree tmpl
= NULL_TREE
;
2462 tree targs
= NULL_TREE
;
2464 /* Make sure that the declarator is a TEMPLATE_ID_EXPR. */
2465 if (TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
2469 gcc_assert (identifier_p (declarator
));
2474 /* If there is no class context, the explicit instantiation
2475 must be at namespace scope. */
2476 gcc_assert (DECL_NAMESPACE_SCOPE_P (decl
));
2478 /* Find the namespace binding, using the declaration
2480 fns
= lookup_qualified_name (CP_DECL_CONTEXT (decl
), dname
,
2482 if (fns
== error_mark_node
|| !is_overloaded_fn (fns
))
2484 error ("%qD is not a template function", dname
);
2485 fns
= error_mark_node
;
2489 tree fn
= OVL_CURRENT (fns
);
2490 if (!is_associated_namespace (CP_DECL_CONTEXT (decl
),
2491 CP_DECL_CONTEXT (fn
)))
2492 error ("%qD is not declared in %qD",
2493 decl
, current_namespace
);
2497 declarator
= lookup_template_function (fns
, NULL_TREE
);
2500 if (declarator
== error_mark_node
)
2501 return error_mark_node
;
2503 if (ctype
!= NULL_TREE
&& TYPE_BEING_DEFINED (ctype
))
2505 if (!explicit_instantiation
)
2506 /* A specialization in class scope. This is invalid,
2507 but the error will already have been flagged by
2508 check_specialization_scope. */
2509 return error_mark_node
;
2512 /* It's not valid to write an explicit instantiation in
2515 class C { template void f(); }
2517 This case is caught by the parser. However, on
2520 template class C { void f(); };
2522 (which is invalid) we can get here. The error will be
2529 else if (ctype
!= NULL_TREE
2530 && (identifier_p (TREE_OPERAND (declarator
, 0))))
2532 /* Find the list of functions in ctype that have the same
2533 name as the declared function. */
2534 tree name
= TREE_OPERAND (declarator
, 0);
2535 tree fns
= NULL_TREE
;
2538 if (constructor_name_p (name
, ctype
))
2540 int is_constructor
= DECL_CONSTRUCTOR_P (decl
);
2542 if (is_constructor
? !TYPE_HAS_USER_CONSTRUCTOR (ctype
)
2543 : !CLASSTYPE_DESTRUCTORS (ctype
))
2545 /* From [temp.expl.spec]:
2547 If such an explicit specialization for the member
2548 of a class template names an implicitly-declared
2549 special member function (clause _special_), the
2550 program is ill-formed.
2552 Similar language is found in [temp.explicit]. */
2553 error ("specialization of implicitly-declared special member function");
2554 return error_mark_node
;
2557 name
= is_constructor
? ctor_identifier
: dtor_identifier
;
2560 if (!DECL_CONV_FN_P (decl
))
2562 idx
= lookup_fnfields_1 (ctype
, name
);
2564 fns
= (*CLASSTYPE_METHOD_VEC (ctype
))[idx
];
2568 vec
<tree
, va_gc
> *methods
;
2571 /* For a type-conversion operator, we cannot do a
2572 name-based lookup. We might be looking for `operator
2573 int' which will be a specialization of `operator T'.
2574 So, we find *all* the conversion operators, and then
2575 select from them. */
2578 methods
= CLASSTYPE_METHOD_VEC (ctype
);
2580 for (idx
= CLASSTYPE_FIRST_CONVERSION_SLOT
;
2581 methods
->iterate (idx
, &ovl
);
2584 if (!DECL_CONV_FN_P (OVL_CURRENT (ovl
)))
2585 /* There are no more conversion functions. */
2588 /* Glue all these conversion functions together
2589 with those we already have. */
2590 for (; ovl
; ovl
= OVL_NEXT (ovl
))
2591 fns
= ovl_cons (OVL_CURRENT (ovl
), fns
);
2595 if (fns
== NULL_TREE
)
2597 error ("no member function %qD declared in %qT", name
, ctype
);
2598 return error_mark_node
;
2601 TREE_OPERAND (declarator
, 0) = fns
;
2604 /* Figure out what exactly is being specialized at this point.
2605 Note that for an explicit instantiation, even one for a
2606 member function, we cannot tell apriori whether the
2607 instantiation is for a member template, or just a member
2608 function of a template class. Even if a member template is
2609 being instantiated, the member template arguments may be
2610 elided if they can be deduced from the rest of the
2612 tmpl
= determine_specialization (declarator
, decl
,
2614 member_specialization
,
2618 if (!tmpl
|| tmpl
== error_mark_node
)
2619 /* We couldn't figure out what this declaration was
2621 return error_mark_node
;
2624 tree gen_tmpl
= most_general_template (tmpl
);
2626 if (explicit_instantiation
)
2628 /* We don't set DECL_EXPLICIT_INSTANTIATION here; that
2629 is done by do_decl_instantiation later. */
2631 int arg_depth
= TMPL_ARGS_DEPTH (targs
);
2632 int parm_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
2634 if (arg_depth
> parm_depth
)
2636 /* If TMPL is not the most general template (for
2637 example, if TMPL is a friend template that is
2638 injected into namespace scope), then there will
2639 be too many levels of TARGS. Remove some of them
2644 new_targs
= make_tree_vec (parm_depth
);
2645 for (i
= arg_depth
- parm_depth
; i
< arg_depth
; ++i
)
2646 TREE_VEC_ELT (new_targs
, i
- (arg_depth
- parm_depth
))
2647 = TREE_VEC_ELT (targs
, i
);
2651 return instantiate_template (tmpl
, targs
, tf_error
);
2654 /* If we thought that the DECL was a member function, but it
2655 turns out to be specializing a static member function,
2656 make DECL a static member function as well. */
2657 if (DECL_STATIC_FUNCTION_P (tmpl
)
2658 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
2659 revert_static_member_fn (decl
);
2661 /* If this is a specialization of a member template of a
2662 template class, we want to return the TEMPLATE_DECL, not
2663 the specialization of it. */
2664 if (tsk
== tsk_template
)
2666 tree result
= DECL_TEMPLATE_RESULT (tmpl
);
2667 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
2668 DECL_INITIAL (result
) = NULL_TREE
;
2672 DECL_SOURCE_LOCATION (tmpl
) = DECL_SOURCE_LOCATION (decl
);
2673 DECL_SOURCE_LOCATION (result
)
2674 = DECL_SOURCE_LOCATION (decl
);
2675 /* We want to use the argument list specified in the
2676 definition, not in the original declaration. */
2677 DECL_ARGUMENTS (result
) = DECL_ARGUMENTS (decl
);
2678 for (parm
= DECL_ARGUMENTS (result
); parm
;
2679 parm
= DECL_CHAIN (parm
))
2680 DECL_CONTEXT (parm
) = result
;
2682 return register_specialization (tmpl
, gen_tmpl
, targs
,
2686 /* Set up the DECL_TEMPLATE_INFO for DECL. */
2687 DECL_TEMPLATE_INFO (decl
) = build_template_info (tmpl
, targs
);
2689 /* Inherit default function arguments from the template
2690 DECL is specializing. */
2691 copy_default_args_to_explicit_spec (decl
);
2693 /* This specialization has the same protection as the
2694 template it specializes. */
2695 TREE_PRIVATE (decl
) = TREE_PRIVATE (gen_tmpl
);
2696 TREE_PROTECTED (decl
) = TREE_PROTECTED (gen_tmpl
);
2698 /* 7.1.1-1 [dcl.stc]
2700 A storage-class-specifier shall not be specified in an
2701 explicit specialization...
2703 The parser rejects these, so unless action is taken here,
2704 explicit function specializations will always appear with
2707 The action recommended by the C++ CWG in response to C++
2708 defect report 605 is to make the storage class and linkage
2709 of the explicit specialization match the templated function:
2711 http://www.open-std.org/jtc1/sc22/wg21/docs/cwg_active.html#605
2713 if (tsk
== tsk_expl_spec
&& DECL_FUNCTION_TEMPLATE_P (gen_tmpl
))
2715 tree tmpl_func
= DECL_TEMPLATE_RESULT (gen_tmpl
);
2716 gcc_assert (TREE_CODE (tmpl_func
) == FUNCTION_DECL
);
2718 /* This specialization has the same linkage and visibility as
2719 the function template it specializes. */
2720 TREE_PUBLIC (decl
) = TREE_PUBLIC (tmpl_func
);
2721 if (! TREE_PUBLIC (decl
))
2723 DECL_INTERFACE_KNOWN (decl
) = 1;
2724 DECL_NOT_REALLY_EXTERN (decl
) = 1;
2726 DECL_THIS_STATIC (decl
) = DECL_THIS_STATIC (tmpl_func
);
2727 if (DECL_VISIBILITY_SPECIFIED (tmpl_func
))
2729 DECL_VISIBILITY_SPECIFIED (decl
) = 1;
2730 DECL_VISIBILITY (decl
) = DECL_VISIBILITY (tmpl_func
);
2734 /* If DECL is a friend declaration, declared using an
2735 unqualified name, the namespace associated with DECL may
2736 have been set incorrectly. For example, in:
2738 template <typename T> void f(T);
2740 struct S { friend void f<int>(int); }
2743 we will have set the DECL_CONTEXT for the friend
2744 declaration to N, rather than to the global namespace. */
2745 if (DECL_NAMESPACE_SCOPE_P (decl
))
2746 DECL_CONTEXT (decl
) = DECL_CONTEXT (tmpl
);
2748 if (is_friend
&& !have_def
)
2749 /* This is not really a declaration of a specialization.
2750 It's just the name of an instantiation. But, it's not
2751 a request for an instantiation, either. */
2752 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
2753 else if (DECL_CONSTRUCTOR_P (decl
) || DECL_DESTRUCTOR_P (decl
))
2754 /* This is indeed a specialization. In case of constructors
2755 and destructors, we need in-charge and not-in-charge
2756 versions in V3 ABI. */
2757 clone_function_decl (decl
, /*update_method_vec_p=*/0);
2759 /* Register this specialization so that we can find it
2761 decl
= register_specialization (decl
, gen_tmpl
, targs
, is_friend
, 0);
2768 /* Returns 1 iff PARMS1 and PARMS2 are identical sets of template
2769 parameters. These are represented in the same format used for
2770 DECL_TEMPLATE_PARMS. */
2773 comp_template_parms (const_tree parms1
, const_tree parms2
)
2778 if (parms1
== parms2
)
2781 for (p1
= parms1
, p2
= parms2
;
2782 p1
!= NULL_TREE
&& p2
!= NULL_TREE
;
2783 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
))
2785 tree t1
= TREE_VALUE (p1
);
2786 tree t2
= TREE_VALUE (p2
);
2789 gcc_assert (TREE_CODE (t1
) == TREE_VEC
);
2790 gcc_assert (TREE_CODE (t2
) == TREE_VEC
);
2792 if (TREE_VEC_LENGTH (t1
) != TREE_VEC_LENGTH (t2
))
2795 for (i
= 0; i
< TREE_VEC_LENGTH (t2
); ++i
)
2797 tree parm1
= TREE_VALUE (TREE_VEC_ELT (t1
, i
));
2798 tree parm2
= TREE_VALUE (TREE_VEC_ELT (t2
, i
));
2800 /* If either of the template parameters are invalid, assume
2801 they match for the sake of error recovery. */
2802 if (parm1
== error_mark_node
|| parm2
== error_mark_node
)
2805 if (TREE_CODE (parm1
) != TREE_CODE (parm2
))
2808 if (TREE_CODE (parm1
) == TEMPLATE_TYPE_PARM
2809 && (TEMPLATE_TYPE_PARAMETER_PACK (parm1
)
2810 == TEMPLATE_TYPE_PARAMETER_PACK (parm2
)))
2812 else if (!same_type_p (TREE_TYPE (parm1
), TREE_TYPE (parm2
)))
2817 if ((p1
!= NULL_TREE
) != (p2
!= NULL_TREE
))
2818 /* One set of parameters has more parameters lists than the
2825 /* Determine whether PARM is a parameter pack. */
2828 template_parameter_pack_p (const_tree parm
)
2830 /* Determine if we have a non-type template parameter pack. */
2831 if (TREE_CODE (parm
) == PARM_DECL
)
2832 return (DECL_TEMPLATE_PARM_P (parm
)
2833 && TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)));
2834 if (TREE_CODE (parm
) == TEMPLATE_PARM_INDEX
)
2835 return TEMPLATE_PARM_PARAMETER_PACK (parm
);
2837 /* If this is a list of template parameters, we could get a
2838 TYPE_DECL or a TEMPLATE_DECL. */
2839 if (TREE_CODE (parm
) == TYPE_DECL
|| TREE_CODE (parm
) == TEMPLATE_DECL
)
2840 parm
= TREE_TYPE (parm
);
2842 /* Otherwise it must be a type template parameter. */
2843 return ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
2844 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
)
2845 && TEMPLATE_TYPE_PARAMETER_PACK (parm
));
2848 /* Determine if T is a function parameter pack. */
2851 function_parameter_pack_p (const_tree t
)
2853 if (t
&& TREE_CODE (t
) == PARM_DECL
)
2854 return FUNCTION_PARAMETER_PACK_P (t
);
2858 /* Return the function template declaration of PRIMARY_FUNC_TMPL_INST.
2859 PRIMARY_FUNC_TMPL_INST is a primary function template instantiation. */
2862 get_function_template_decl (const_tree primary_func_tmpl_inst
)
2864 if (! primary_func_tmpl_inst
2865 || TREE_CODE (primary_func_tmpl_inst
) != FUNCTION_DECL
2866 || ! primary_template_instantiation_p (primary_func_tmpl_inst
))
2869 return DECL_TEMPLATE_RESULT (DECL_TI_TEMPLATE (primary_func_tmpl_inst
));
2872 /* Return true iff the function parameter PARAM_DECL was expanded
2873 from the function parameter pack PACK. */
2876 function_parameter_expanded_from_pack_p (tree param_decl
, tree pack
)
2878 if (DECL_ARTIFICIAL (param_decl
)
2879 || !function_parameter_pack_p (pack
))
2882 /* The parameter pack and its pack arguments have the same
2884 return DECL_PARM_INDEX (pack
) == DECL_PARM_INDEX (param_decl
);
2887 /* Determine whether ARGS describes a variadic template args list,
2888 i.e., one that is terminated by a template argument pack. */
2891 template_args_variadic_p (tree args
)
2896 if (args
== NULL_TREE
)
2899 args
= INNERMOST_TEMPLATE_ARGS (args
);
2900 nargs
= TREE_VEC_LENGTH (args
);
2905 last_parm
= TREE_VEC_ELT (args
, nargs
- 1);
2907 return ARGUMENT_PACK_P (last_parm
);
2910 /* Generate a new name for the parameter pack name NAME (an
2911 IDENTIFIER_NODE) that incorporates its */
2914 make_ith_pack_parameter_name (tree name
, int i
)
2916 /* Munge the name to include the parameter index. */
2917 #define NUMBUF_LEN 128
2918 char numbuf
[NUMBUF_LEN
];
2922 if (name
== NULL_TREE
)
2924 snprintf (numbuf
, NUMBUF_LEN
, "%i", i
);
2925 newname_len
= IDENTIFIER_LENGTH (name
)
2926 + strlen (numbuf
) + 2;
2927 newname
= (char*)alloca (newname_len
);
2928 snprintf (newname
, newname_len
,
2929 "%s#%i", IDENTIFIER_POINTER (name
), i
);
2930 return get_identifier (newname
);
2933 /* Return true if T is a primary function, class or alias template
2937 primary_template_instantiation_p (const_tree t
)
2942 if (TREE_CODE (t
) == FUNCTION_DECL
)
2943 return DECL_LANG_SPECIFIC (t
)
2944 && DECL_TEMPLATE_INSTANTIATION (t
)
2945 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (t
));
2946 else if (CLASS_TYPE_P (t
) && !TYPE_DECL_ALIAS_P (TYPE_NAME (t
)))
2947 return CLASSTYPE_TEMPLATE_INSTANTIATION (t
)
2948 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (t
));
2949 else if (alias_template_specialization_p (t
))
2954 /* Return true if PARM is a template template parameter. */
2957 template_template_parameter_p (const_tree parm
)
2959 return DECL_TEMPLATE_TEMPLATE_PARM_P (parm
);
2962 /* Return true iff PARM is a DECL representing a type template
2966 template_type_parameter_p (const_tree parm
)
2969 && (TREE_CODE (parm
) == TYPE_DECL
2970 || TREE_CODE (parm
) == TEMPLATE_DECL
)
2971 && DECL_TEMPLATE_PARM_P (parm
));
2974 /* Return the template parameters of T if T is a
2975 primary template instantiation, NULL otherwise. */
2978 get_primary_template_innermost_parameters (const_tree t
)
2980 tree parms
= NULL
, template_info
= NULL
;
2982 if ((template_info
= get_template_info (t
))
2983 && primary_template_instantiation_p (t
))
2984 parms
= INNERMOST_TEMPLATE_PARMS
2985 (DECL_TEMPLATE_PARMS (TI_TEMPLATE (template_info
)));
2990 /* Return the template parameters of the LEVELth level from the full list
2991 of template parameters PARMS. */
2994 get_template_parms_at_level (tree parms
, int level
)
2998 || TREE_CODE (parms
) != TREE_LIST
2999 || level
> TMPL_PARMS_DEPTH (parms
))
3002 for (p
= parms
; p
; p
= TREE_CHAIN (p
))
3003 if (TMPL_PARMS_DEPTH (p
) == level
)
3009 /* Returns the template arguments of T if T is a template instantiation,
3013 get_template_innermost_arguments (const_tree t
)
3015 tree args
= NULL
, template_info
= NULL
;
3017 if ((template_info
= get_template_info (t
))
3018 && TI_ARGS (template_info
))
3019 args
= INNERMOST_TEMPLATE_ARGS (TI_ARGS (template_info
));
3024 /* Return the argument pack elements of T if T is a template argument pack,
3028 get_template_argument_pack_elems (const_tree t
)
3030 if (TREE_CODE (t
) != TYPE_ARGUMENT_PACK
3031 && TREE_CODE (t
) != NONTYPE_ARGUMENT_PACK
)
3034 return ARGUMENT_PACK_ARGS (t
);
3037 /* Structure used to track the progress of find_parameter_packs_r. */
3038 struct find_parameter_pack_data
3040 /* TREE_LIST that will contain all of the parameter packs found by
3042 tree
* parameter_packs
;
3044 /* Set of AST nodes that have been visited by the traversal. */
3045 struct pointer_set_t
*visited
;
3048 /* Identifies all of the argument packs that occur in a template
3049 argument and appends them to the TREE_LIST inside DATA, which is a
3050 find_parameter_pack_data structure. This is a subroutine of
3051 make_pack_expansion and uses_parameter_packs. */
3053 find_parameter_packs_r (tree
*tp
, int *walk_subtrees
, void* data
)
3056 struct find_parameter_pack_data
* ppd
=
3057 (struct find_parameter_pack_data
*)data
;
3058 bool parameter_pack_p
= false;
3060 /* Handle type aliases/typedefs. */
3063 && TREE_CODE (TYPE_NAME (t
)) == TYPE_DECL
3064 && TYPE_DECL_ALIAS_P (TYPE_NAME (t
)))
3066 if (TYPE_TEMPLATE_INFO (t
))
3067 cp_walk_tree (&TYPE_TI_ARGS (t
),
3068 &find_parameter_packs_r
,
3074 /* Identify whether this is a parameter pack or not. */
3075 switch (TREE_CODE (t
))
3077 case TEMPLATE_PARM_INDEX
:
3078 if (TEMPLATE_PARM_PARAMETER_PACK (t
))
3079 parameter_pack_p
= true;
3082 case TEMPLATE_TYPE_PARM
:
3083 t
= TYPE_MAIN_VARIANT (t
);
3084 case TEMPLATE_TEMPLATE_PARM
:
3085 if (TEMPLATE_TYPE_PARAMETER_PACK (t
))
3086 parameter_pack_p
= true;
3090 if (FUNCTION_PARAMETER_PACK_P (t
))
3092 /* We don't want to walk into the type of a PARM_DECL,
3093 because we don't want to see the type parameter pack. */
3095 parameter_pack_p
= true;
3100 parameter_pack_p
= true;
3103 /* Not a parameter pack. */
3107 if (parameter_pack_p
)
3109 /* Add this parameter pack to the list. */
3110 *ppd
->parameter_packs
= tree_cons (NULL_TREE
, t
, *ppd
->parameter_packs
);
3114 cp_walk_tree (&TYPE_CONTEXT (t
),
3115 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3117 /* This switch statement will return immediately if we don't find a
3119 switch (TREE_CODE (t
))
3121 case TEMPLATE_PARM_INDEX
:
3124 case BOUND_TEMPLATE_TEMPLATE_PARM
:
3125 /* Check the template itself. */
3126 cp_walk_tree (&TREE_TYPE (TYPE_TI_TEMPLATE (t
)),
3127 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3128 /* Check the template arguments. */
3129 cp_walk_tree (&TYPE_TI_ARGS (t
), &find_parameter_packs_r
, ppd
,
3134 case TEMPLATE_TYPE_PARM
:
3135 case TEMPLATE_TEMPLATE_PARM
:
3142 if (TYPE_PTRMEMFUNC_P (t
))
3148 if (TYPE_TEMPLATE_INFO (t
))
3149 cp_walk_tree (&TI_ARGS (TYPE_TEMPLATE_INFO (t
)),
3150 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3157 cp_walk_tree (&TREE_TYPE (t
),
3158 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3162 cp_walk_tree (&TYPENAME_TYPE_FULLNAME (t
), &find_parameter_packs_r
,
3167 case TYPE_PACK_EXPANSION
:
3168 case EXPR_PACK_EXPANSION
:
3173 cp_walk_tree (&TYPE_MAX_VALUE (t
), &find_parameter_packs_r
,
3178 case IDENTIFIER_NODE
:
3179 cp_walk_tree (&TREE_TYPE (t
), &find_parameter_packs_r
, ppd
,
3191 /* Determines if the expression or type T uses any parameter packs. */
3193 uses_parameter_packs (tree t
)
3195 tree parameter_packs
= NULL_TREE
;
3196 struct find_parameter_pack_data ppd
;
3197 ppd
.parameter_packs
= ¶meter_packs
;
3198 ppd
.visited
= pointer_set_create ();
3199 cp_walk_tree (&t
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
3200 pointer_set_destroy (ppd
.visited
);
3201 return parameter_packs
!= NULL_TREE
;
3204 /* Turn ARG, which may be an expression, type, or a TREE_LIST
3205 representation a base-class initializer into a parameter pack
3206 expansion. If all goes well, the resulting node will be an
3207 EXPR_PACK_EXPANSION, TYPE_PACK_EXPANSION, or TREE_LIST,
3210 make_pack_expansion (tree arg
)
3213 tree parameter_packs
= NULL_TREE
;
3214 bool for_types
= false;
3215 struct find_parameter_pack_data ppd
;
3217 if (!arg
|| arg
== error_mark_node
)
3220 if (TREE_CODE (arg
) == TREE_LIST
)
3222 /* The only time we will see a TREE_LIST here is for a base
3223 class initializer. In this case, the TREE_PURPOSE will be a
3224 _TYPE node (representing the base class expansion we're
3225 initializing) and the TREE_VALUE will be a TREE_LIST
3226 containing the initialization arguments.
3228 The resulting expansion looks somewhat different from most
3229 expansions. Rather than returning just one _EXPANSION, we
3230 return a TREE_LIST whose TREE_PURPOSE is a
3231 TYPE_PACK_EXPANSION containing the bases that will be
3232 initialized. The TREE_VALUE will be identical to the
3233 original TREE_VALUE, which is a list of arguments that will
3234 be passed to each base. We do not introduce any new pack
3235 expansion nodes into the TREE_VALUE (although it is possible
3236 that some already exist), because the TREE_PURPOSE and
3237 TREE_VALUE all need to be expanded together with the same
3238 _EXPANSION node. Note that the TYPE_PACK_EXPANSION in the
3239 resulting TREE_PURPOSE will mention the parameter packs in
3240 both the bases and the arguments to the bases. */
3243 tree parameter_packs
= NULL_TREE
;
3245 /* Determine which parameter packs will be used by the base
3247 ppd
.visited
= pointer_set_create ();
3248 ppd
.parameter_packs
= ¶meter_packs
;
3249 cp_walk_tree (&TREE_PURPOSE (arg
), &find_parameter_packs_r
,
3252 if (parameter_packs
== NULL_TREE
)
3254 error ("base initializer expansion %<%T%> contains no parameter packs", arg
);
3255 pointer_set_destroy (ppd
.visited
);
3256 return error_mark_node
;
3259 if (TREE_VALUE (arg
) != void_type_node
)
3261 /* Collect the sets of parameter packs used in each of the
3262 initialization arguments. */
3263 for (value
= TREE_VALUE (arg
); value
; value
= TREE_CHAIN (value
))
3265 /* Determine which parameter packs will be expanded in this
3267 cp_walk_tree (&TREE_VALUE (value
), &find_parameter_packs_r
,
3272 pointer_set_destroy (ppd
.visited
);
3274 /* Create the pack expansion type for the base type. */
3275 purpose
= cxx_make_type (TYPE_PACK_EXPANSION
);
3276 SET_PACK_EXPANSION_PATTERN (purpose
, TREE_PURPOSE (arg
));
3277 PACK_EXPANSION_PARAMETER_PACKS (purpose
) = parameter_packs
;
3279 /* Just use structural equality for these TYPE_PACK_EXPANSIONS;
3280 they will rarely be compared to anything. */
3281 SET_TYPE_STRUCTURAL_EQUALITY (purpose
);
3283 return tree_cons (purpose
, TREE_VALUE (arg
), NULL_TREE
);
3286 if (TYPE_P (arg
) || TREE_CODE (arg
) == TEMPLATE_DECL
)
3289 /* Build the PACK_EXPANSION_* node. */
3291 ? cxx_make_type (TYPE_PACK_EXPANSION
)
3292 : make_node (EXPR_PACK_EXPANSION
);
3293 SET_PACK_EXPANSION_PATTERN (result
, arg
);
3294 if (TREE_CODE (result
) == EXPR_PACK_EXPANSION
)
3296 /* Propagate type and const-expression information. */
3297 TREE_TYPE (result
) = TREE_TYPE (arg
);
3298 TREE_CONSTANT (result
) = TREE_CONSTANT (arg
);
3301 /* Just use structural equality for these TYPE_PACK_EXPANSIONS;
3302 they will rarely be compared to anything. */
3303 SET_TYPE_STRUCTURAL_EQUALITY (result
);
3305 /* Determine which parameter packs will be expanded. */
3306 ppd
.parameter_packs
= ¶meter_packs
;
3307 ppd
.visited
= pointer_set_create ();
3308 cp_walk_tree (&arg
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
3309 pointer_set_destroy (ppd
.visited
);
3311 /* Make sure we found some parameter packs. */
3312 if (parameter_packs
== NULL_TREE
)
3315 error ("expansion pattern %<%T%> contains no argument packs", arg
);
3317 error ("expansion pattern %<%E%> contains no argument packs", arg
);
3318 return error_mark_node
;
3320 PACK_EXPANSION_PARAMETER_PACKS (result
) = parameter_packs
;
3322 PACK_EXPANSION_LOCAL_P (result
) = at_function_scope_p ();
3327 /* Checks T for any "bare" parameter packs, which have not yet been
3328 expanded, and issues an error if any are found. This operation can
3329 only be done on full expressions or types (e.g., an expression
3330 statement, "if" condition, etc.), because we could have expressions like:
3332 foo(f(g(h(args)))...)
3334 where "args" is a parameter pack. check_for_bare_parameter_packs
3335 should not be called for the subexpressions args, h(args),
3336 g(h(args)), or f(g(h(args))), because we would produce erroneous
3339 Returns TRUE and emits an error if there were bare parameter packs,
3340 returns FALSE otherwise. */
3342 check_for_bare_parameter_packs (tree t
)
3344 tree parameter_packs
= NULL_TREE
;
3345 struct find_parameter_pack_data ppd
;
3347 if (!processing_template_decl
|| !t
|| t
== error_mark_node
)
3350 if (TREE_CODE (t
) == TYPE_DECL
)
3353 ppd
.parameter_packs
= ¶meter_packs
;
3354 ppd
.visited
= pointer_set_create ();
3355 cp_walk_tree (&t
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
3356 pointer_set_destroy (ppd
.visited
);
3358 if (parameter_packs
)
3360 error ("parameter packs not expanded with %<...%>:");
3361 while (parameter_packs
)
3363 tree pack
= TREE_VALUE (parameter_packs
);
3364 tree name
= NULL_TREE
;
3366 if (TREE_CODE (pack
) == TEMPLATE_TYPE_PARM
3367 || TREE_CODE (pack
) == TEMPLATE_TEMPLATE_PARM
)
3368 name
= TYPE_NAME (pack
);
3369 else if (TREE_CODE (pack
) == TEMPLATE_PARM_INDEX
)
3370 name
= DECL_NAME (TEMPLATE_PARM_DECL (pack
));
3372 name
= DECL_NAME (pack
);
3375 inform (input_location
, " %qD", name
);
3377 inform (input_location
, " <anonymous>");
3379 parameter_packs
= TREE_CHAIN (parameter_packs
);
3388 /* Expand any parameter packs that occur in the template arguments in
3391 expand_template_argument_pack (tree args
)
3393 tree result_args
= NULL_TREE
;
3394 int in_arg
, out_arg
= 0, nargs
= args
? TREE_VEC_LENGTH (args
) : 0;
3395 int num_result_args
= -1;
3396 int non_default_args_count
= -1;
3398 /* First, determine if we need to expand anything, and the number of
3399 slots we'll need. */
3400 for (in_arg
= 0; in_arg
< nargs
; ++in_arg
)
3402 tree arg
= TREE_VEC_ELT (args
, in_arg
);
3403 if (arg
== NULL_TREE
)
3405 if (ARGUMENT_PACK_P (arg
))
3407 int num_packed
= TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg
));
3408 if (num_result_args
< 0)
3409 num_result_args
= in_arg
+ num_packed
;
3411 num_result_args
+= num_packed
;
3415 if (num_result_args
>= 0)
3420 /* If no expansion is necessary, we're done. */
3421 if (num_result_args
< 0)
3424 /* Expand arguments. */
3425 result_args
= make_tree_vec (num_result_args
);
3426 if (NON_DEFAULT_TEMPLATE_ARGS_COUNT (args
))
3427 non_default_args_count
=
3428 GET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (args
);
3429 for (in_arg
= 0; in_arg
< nargs
; ++in_arg
)
3431 tree arg
= TREE_VEC_ELT (args
, in_arg
);
3432 if (ARGUMENT_PACK_P (arg
))
3434 tree packed
= ARGUMENT_PACK_ARGS (arg
);
3435 int i
, num_packed
= TREE_VEC_LENGTH (packed
);
3436 for (i
= 0; i
< num_packed
; ++i
, ++out_arg
)
3437 TREE_VEC_ELT (result_args
, out_arg
) = TREE_VEC_ELT(packed
, i
);
3438 if (non_default_args_count
> 0)
3439 non_default_args_count
+= num_packed
;
3443 TREE_VEC_ELT (result_args
, out_arg
) = arg
;
3447 if (non_default_args_count
>= 0)
3448 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (result_args
, non_default_args_count
);
3452 /* Checks if DECL shadows a template parameter.
3454 [temp.local]: A template-parameter shall not be redeclared within its
3455 scope (including nested scopes).
3457 Emits an error and returns TRUE if the DECL shadows a parameter,
3458 returns FALSE otherwise. */
3461 check_template_shadow (tree decl
)
3465 /* If we're not in a template, we can't possibly shadow a template
3467 if (!current_template_parms
)
3470 /* Figure out what we're shadowing. */
3471 if (TREE_CODE (decl
) == OVERLOAD
)
3472 decl
= OVL_CURRENT (decl
);
3473 olddecl
= innermost_non_namespace_value (DECL_NAME (decl
));
3475 /* If there's no previous binding for this name, we're not shadowing
3476 anything, let alone a template parameter. */
3480 /* If we're not shadowing a template parameter, we're done. Note
3481 that OLDDECL might be an OVERLOAD (or perhaps even an
3482 ERROR_MARK), so we can't just blithely assume it to be a _DECL
3484 if (!DECL_P (olddecl
) || !DECL_TEMPLATE_PARM_P (olddecl
))
3487 /* We check for decl != olddecl to avoid bogus errors for using a
3488 name inside a class. We check TPFI to avoid duplicate errors for
3489 inline member templates. */
3491 || TEMPLATE_PARMS_FOR_INLINE (current_template_parms
))
3494 error ("declaration of %q+#D", decl
);
3495 error (" shadows template parm %q+#D", olddecl
);
3499 /* Return a new TEMPLATE_PARM_INDEX with the indicated INDEX, LEVEL,
3500 ORIG_LEVEL, DECL, and TYPE. */
3503 build_template_parm_index (int index
,
3509 tree t
= make_node (TEMPLATE_PARM_INDEX
);
3510 TEMPLATE_PARM_IDX (t
) = index
;
3511 TEMPLATE_PARM_LEVEL (t
) = level
;
3512 TEMPLATE_PARM_ORIG_LEVEL (t
) = orig_level
;
3513 TEMPLATE_PARM_DECL (t
) = decl
;
3514 TREE_TYPE (t
) = type
;
3515 TREE_CONSTANT (t
) = TREE_CONSTANT (decl
);
3516 TREE_READONLY (t
) = TREE_READONLY (decl
);
3521 /* Find the canonical type parameter for the given template type
3522 parameter. Returns the canonical type parameter, which may be TYPE
3523 if no such parameter existed. */
3526 canonical_type_parameter (tree type
)
3529 int idx
= TEMPLATE_TYPE_IDX (type
);
3530 if (!canonical_template_parms
)
3531 vec_alloc (canonical_template_parms
, idx
+1);
3533 while (canonical_template_parms
->length () <= (unsigned)idx
)
3534 vec_safe_push (canonical_template_parms
, NULL_TREE
);
3536 list
= (*canonical_template_parms
)[idx
];
3537 while (list
&& !comptypes (type
, TREE_VALUE (list
), COMPARE_STRUCTURAL
))
3538 list
= TREE_CHAIN (list
);
3541 return TREE_VALUE (list
);
3544 (*canonical_template_parms
)[idx
]
3545 = tree_cons (NULL_TREE
, type
,
3546 (*canonical_template_parms
)[idx
]);
3551 /* Return a TEMPLATE_PARM_INDEX, similar to INDEX, but whose
3552 TEMPLATE_PARM_LEVEL has been decreased by LEVELS. If such a
3553 TEMPLATE_PARM_INDEX already exists, it is returned; otherwise, a
3554 new one is created. */
3557 reduce_template_parm_level (tree index
, tree type
, int levels
, tree args
,
3558 tsubst_flags_t complain
)
3560 if (TEMPLATE_PARM_DESCENDANTS (index
) == NULL_TREE
3561 || (TEMPLATE_PARM_LEVEL (TEMPLATE_PARM_DESCENDANTS (index
))
3562 != TEMPLATE_PARM_LEVEL (index
) - levels
)
3563 || !same_type_p (type
, TREE_TYPE (TEMPLATE_PARM_DESCENDANTS (index
))))
3565 tree orig_decl
= TEMPLATE_PARM_DECL (index
);
3568 decl
= build_decl (DECL_SOURCE_LOCATION (orig_decl
),
3569 TREE_CODE (orig_decl
), DECL_NAME (orig_decl
), type
);
3570 TREE_CONSTANT (decl
) = TREE_CONSTANT (orig_decl
);
3571 TREE_READONLY (decl
) = TREE_READONLY (orig_decl
);
3572 DECL_ARTIFICIAL (decl
) = 1;
3573 SET_DECL_TEMPLATE_PARM_P (decl
);
3575 t
= build_template_parm_index (TEMPLATE_PARM_IDX (index
),
3576 TEMPLATE_PARM_LEVEL (index
) - levels
,
3577 TEMPLATE_PARM_ORIG_LEVEL (index
),
3579 TEMPLATE_PARM_DESCENDANTS (index
) = t
;
3580 TEMPLATE_PARM_PARAMETER_PACK (t
)
3581 = TEMPLATE_PARM_PARAMETER_PACK (index
);
3583 /* Template template parameters need this. */
3584 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
3585 DECL_TEMPLATE_PARMS (decl
) = tsubst_template_parms
3586 (DECL_TEMPLATE_PARMS (TEMPLATE_PARM_DECL (index
)),
3590 return TEMPLATE_PARM_DESCENDANTS (index
);
3593 /* Process information from new template parameter PARM and append it
3594 to the LIST being built. This new parameter is a non-type
3595 parameter iff IS_NON_TYPE is true. This new parameter is a
3596 parameter pack iff IS_PARAMETER_PACK is true. The location of PARM
3597 is in PARM_LOC. NUM_TEMPLATE_PARMS is the size of the template
3598 parameter list PARM belongs to. This is used used to create a
3599 proper canonical type for the type of PARM that is to be created,
3600 iff PARM is a type. If the size is not known, this parameter shall
3604 process_template_parm (tree list
, location_t parm_loc
, tree parm
,
3605 bool is_non_type
, bool is_parameter_pack
)
3612 gcc_assert (TREE_CODE (parm
) == TREE_LIST
);
3613 defval
= TREE_PURPOSE (parm
);
3617 tree p
= tree_last (list
);
3619 if (p
&& TREE_VALUE (p
) != error_mark_node
)
3622 if (TREE_CODE (p
) == TYPE_DECL
|| TREE_CODE (p
) == TEMPLATE_DECL
)
3623 idx
= TEMPLATE_TYPE_IDX (TREE_TYPE (p
));
3625 idx
= TEMPLATE_PARM_IDX (DECL_INITIAL (p
));
3635 parm
= TREE_VALUE (parm
);
3637 SET_DECL_TEMPLATE_PARM_P (parm
);
3639 if (TREE_TYPE (parm
) == error_mark_node
)
3641 err_parm_list
= build_tree_list (defval
, parm
);
3642 TREE_VALUE (err_parm_list
) = error_mark_node
;
3643 return chainon (list
, err_parm_list
);
3649 The top-level cv-qualifiers on the template-parameter are
3650 ignored when determining its type. */
3651 TREE_TYPE (parm
) = TYPE_MAIN_VARIANT (TREE_TYPE (parm
));
3652 if (invalid_nontype_parm_type_p (TREE_TYPE (parm
), 1))
3654 err_parm_list
= build_tree_list (defval
, parm
);
3655 TREE_VALUE (err_parm_list
) = error_mark_node
;
3656 return chainon (list
, err_parm_list
);
3659 if (uses_parameter_packs (TREE_TYPE (parm
)) && !is_parameter_pack
)
3661 /* This template parameter is not a parameter pack, but it
3662 should be. Complain about "bare" parameter packs. */
3663 check_for_bare_parameter_packs (TREE_TYPE (parm
));
3665 /* Recover by calling this a parameter pack. */
3666 is_parameter_pack
= true;
3670 /* A template parameter is not modifiable. */
3671 TREE_CONSTANT (parm
) = 1;
3672 TREE_READONLY (parm
) = 1;
3673 decl
= build_decl (parm_loc
,
3674 CONST_DECL
, DECL_NAME (parm
), TREE_TYPE (parm
));
3675 TREE_CONSTANT (decl
) = 1;
3676 TREE_READONLY (decl
) = 1;
3677 DECL_INITIAL (parm
) = DECL_INITIAL (decl
)
3678 = build_template_parm_index (idx
, processing_template_decl
,
3679 processing_template_decl
,
3680 decl
, TREE_TYPE (parm
));
3682 TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
))
3683 = is_parameter_pack
;
3688 parm
= TREE_VALUE (TREE_VALUE (parm
));
3690 if (parm
&& TREE_CODE (parm
) == TEMPLATE_DECL
)
3692 t
= cxx_make_type (TEMPLATE_TEMPLATE_PARM
);
3693 /* This is for distinguishing between real templates and template
3694 template parameters */
3695 TREE_TYPE (parm
) = t
;
3696 TREE_TYPE (DECL_TEMPLATE_RESULT (parm
)) = t
;
3701 t
= cxx_make_type (TEMPLATE_TYPE_PARM
);
3702 /* parm is either IDENTIFIER_NODE or NULL_TREE. */
3703 decl
= build_decl (parm_loc
,
3704 TYPE_DECL
, parm
, t
);
3707 TYPE_NAME (t
) = decl
;
3708 TYPE_STUB_DECL (t
) = decl
;
3710 TEMPLATE_TYPE_PARM_INDEX (t
)
3711 = build_template_parm_index (idx
, processing_template_decl
,
3712 processing_template_decl
,
3713 decl
, TREE_TYPE (parm
));
3714 TEMPLATE_TYPE_PARAMETER_PACK (t
) = is_parameter_pack
;
3715 TYPE_CANONICAL (t
) = canonical_type_parameter (t
);
3717 DECL_ARTIFICIAL (decl
) = 1;
3718 SET_DECL_TEMPLATE_PARM_P (decl
);
3720 parm
= build_tree_list (defval
, parm
);
3721 return chainon (list
, parm
);
3724 /* The end of a template parameter list has been reached. Process the
3725 tree list into a parameter vector, converting each parameter into a more
3726 useful form. Type parameters are saved as IDENTIFIER_NODEs, and others
3730 end_template_parm_list (tree parms
)
3734 tree saved_parmlist
= make_tree_vec (list_length (parms
));
3736 current_template_parms
3737 = tree_cons (size_int (processing_template_decl
),
3738 saved_parmlist
, current_template_parms
);
3740 for (parm
= parms
, nparms
= 0; parm
; parm
= next
, nparms
++)
3742 next
= TREE_CHAIN (parm
);
3743 TREE_VEC_ELT (saved_parmlist
, nparms
) = parm
;
3744 TREE_CHAIN (parm
) = NULL_TREE
;
3747 --processing_template_parmlist
;
3749 return saved_parmlist
;
3752 /* end_template_decl is called after a template declaration is seen. */
3755 end_template_decl (void)
3757 reset_specialization ();
3759 if (! processing_template_decl
)
3762 /* This matches the pushlevel in begin_template_parm_list. */
3765 --processing_template_decl
;
3766 current_template_parms
= TREE_CHAIN (current_template_parms
);
3769 /* Takes a TREE_LIST representing a template parameter and convert it
3770 into an argument suitable to be passed to the type substitution
3771 functions. Note that If the TREE_LIST contains an error_mark
3772 node, the returned argument is error_mark_node. */
3775 template_parm_to_arg (tree t
)
3779 || TREE_CODE (t
) != TREE_LIST
)
3782 if (error_operand_p (TREE_VALUE (t
)))
3783 return error_mark_node
;
3787 if (TREE_CODE (t
) == TYPE_DECL
3788 || TREE_CODE (t
) == TEMPLATE_DECL
)
3792 if (TEMPLATE_TYPE_PARAMETER_PACK (t
))
3794 /* Turn this argument into a TYPE_ARGUMENT_PACK
3795 with a single element, which expands T. */
3796 tree vec
= make_tree_vec (1);
3797 #ifdef ENABLE_CHECKING
3798 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT
3799 (vec
, TREE_VEC_LENGTH (vec
));
3801 TREE_VEC_ELT (vec
, 0) = make_pack_expansion (t
);
3803 t
= cxx_make_type (TYPE_ARGUMENT_PACK
);
3804 SET_ARGUMENT_PACK_ARGS (t
, vec
);
3809 t
= DECL_INITIAL (t
);
3811 if (TEMPLATE_PARM_PARAMETER_PACK (t
))
3813 /* Turn this argument into a NONTYPE_ARGUMENT_PACK
3814 with a single element, which expands T. */
3815 tree vec
= make_tree_vec (1);
3816 tree type
= TREE_TYPE (TEMPLATE_PARM_DECL (t
));
3817 #ifdef ENABLE_CHECKING
3818 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT
3819 (vec
, TREE_VEC_LENGTH (vec
));
3821 TREE_VEC_ELT (vec
, 0) = make_pack_expansion (t
);
3823 t
= make_node (NONTYPE_ARGUMENT_PACK
);
3824 SET_ARGUMENT_PACK_ARGS (t
, vec
);
3825 TREE_TYPE (t
) = type
;
3831 /* Given a set of template parameters, return them as a set of template
3832 arguments. The template parameters are represented as a TREE_VEC, in
3833 the form documented in cp-tree.h for template arguments. */
3836 template_parms_to_args (tree parms
)
3839 tree args
= NULL_TREE
;
3840 int length
= TMPL_PARMS_DEPTH (parms
);
3843 /* If there is only one level of template parameters, we do not
3844 create a TREE_VEC of TREE_VECs. Instead, we return a single
3845 TREE_VEC containing the arguments. */
3847 args
= make_tree_vec (length
);
3849 for (header
= parms
; header
; header
= TREE_CHAIN (header
))
3851 tree a
= copy_node (TREE_VALUE (header
));
3854 TREE_TYPE (a
) = NULL_TREE
;
3855 for (i
= TREE_VEC_LENGTH (a
) - 1; i
>= 0; --i
)
3856 TREE_VEC_ELT (a
, i
) = template_parm_to_arg (TREE_VEC_ELT (a
, i
));
3858 #ifdef ENABLE_CHECKING
3859 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (a
, TREE_VEC_LENGTH (a
));
3863 TREE_VEC_ELT (args
, --l
) = a
;
3868 if (length
> 1 && TREE_VEC_ELT (args
, 0) == NULL_TREE
)
3869 /* This can happen for template parms of a template template
3872 template<template<class T, class U> class TT> struct S;
3874 Consider the level of the parms of TT; T and U both have
3875 level 2; TT has no template parm of level 1. So in this case
3876 the first element of full_template_args is NULL_TREE. If we
3877 leave it like this TMPL_ARGS_DEPTH on args returns 1 instead
3878 of 2. This will make tsubst wrongly consider that T and U
3879 have level 1. Instead, let's create a dummy vector as the
3880 first element of full_template_args so that TMPL_ARGS_DEPTH
3881 returns the correct depth for args. */
3882 TREE_VEC_ELT (args
, 0) = make_tree_vec (1);
3886 /* Within the declaration of a template, return the currently active
3887 template parameters as an argument TREE_VEC. */
3890 current_template_args (void)
3892 return template_parms_to_args (current_template_parms
);
3895 /* Update the declared TYPE by doing any lookups which were thought to be
3896 dependent, but are not now that we know the SCOPE of the declarator. */
3899 maybe_update_decl_type (tree orig_type
, tree scope
)
3901 tree type
= orig_type
;
3903 if (type
== NULL_TREE
)
3906 if (TREE_CODE (orig_type
) == TYPE_DECL
)
3907 type
= TREE_TYPE (type
);
3909 if (scope
&& TYPE_P (scope
) && dependent_type_p (scope
)
3910 && dependent_type_p (type
)
3911 /* Don't bother building up the args in this case. */
3912 && TREE_CODE (type
) != TEMPLATE_TYPE_PARM
)
3914 /* tsubst in the args corresponding to the template parameters,
3915 including auto if present. Most things will be unchanged, but
3916 make_typename_type and tsubst_qualified_id will resolve
3917 TYPENAME_TYPEs and SCOPE_REFs that were previously dependent. */
3918 tree args
= current_template_args ();
3919 tree auto_node
= type_uses_auto (type
);
3923 tree auto_vec
= make_tree_vec (1);
3924 TREE_VEC_ELT (auto_vec
, 0) = auto_node
;
3925 args
= add_to_template_args (args
, auto_vec
);
3927 pushed
= push_scope (scope
);
3928 type
= tsubst (type
, args
, tf_warning_or_error
, NULL_TREE
);
3933 if (type
== error_mark_node
)
3936 if (TREE_CODE (orig_type
) == TYPE_DECL
)
3938 if (same_type_p (type
, TREE_TYPE (orig_type
)))
3941 type
= TYPE_NAME (type
);
3946 /* Return a TEMPLATE_DECL corresponding to DECL, using the indicated
3947 template PARMS. If MEMBER_TEMPLATE_P is true, the new template is
3948 a member template. Used by push_template_decl below. */
3951 build_template_decl (tree decl
, tree parms
, bool member_template_p
)
3953 tree tmpl
= build_lang_decl (TEMPLATE_DECL
, DECL_NAME (decl
), NULL_TREE
);
3954 DECL_TEMPLATE_PARMS (tmpl
) = parms
;
3955 DECL_CONTEXT (tmpl
) = DECL_CONTEXT (decl
);
3956 DECL_SOURCE_LOCATION (tmpl
) = DECL_SOURCE_LOCATION (decl
);
3957 DECL_MEMBER_TEMPLATE_P (tmpl
) = member_template_p
;
3962 struct template_parm_data
3964 /* The level of the template parameters we are currently
3968 /* The index of the specialization argument we are currently
3972 /* An array whose size is the number of template parameters. The
3973 elements are nonzero if the parameter has been used in any one
3974 of the arguments processed so far. */
3977 /* An array whose size is the number of template arguments. The
3978 elements are nonzero if the argument makes use of template
3979 parameters of this level. */
3980 int* arg_uses_template_parms
;
3983 /* Subroutine of push_template_decl used to see if each template
3984 parameter in a partial specialization is used in the explicit
3985 argument list. If T is of the LEVEL given in DATA (which is
3986 treated as a template_parm_data*), then DATA->PARMS is marked
3990 mark_template_parm (tree t
, void* data
)
3994 struct template_parm_data
* tpd
= (struct template_parm_data
*) data
;
3996 if (TREE_CODE (t
) == TEMPLATE_PARM_INDEX
)
3998 level
= TEMPLATE_PARM_LEVEL (t
);
3999 idx
= TEMPLATE_PARM_IDX (t
);
4003 level
= TEMPLATE_TYPE_LEVEL (t
);
4004 idx
= TEMPLATE_TYPE_IDX (t
);
4007 if (level
== tpd
->level
)
4009 tpd
->parms
[idx
] = 1;
4010 tpd
->arg_uses_template_parms
[tpd
->current_arg
] = 1;
4013 /* Return zero so that for_each_template_parm will continue the
4014 traversal of the tree; we want to mark *every* template parm. */
4018 /* Process the partial specialization DECL. */
4021 process_partial_specialization (tree decl
)
4023 tree type
= TREE_TYPE (decl
);
4024 tree maintmpl
= CLASSTYPE_TI_TEMPLATE (type
);
4025 tree specargs
= CLASSTYPE_TI_ARGS (type
);
4026 tree inner_args
= INNERMOST_TEMPLATE_ARGS (specargs
);
4027 tree main_inner_parms
= DECL_INNERMOST_TEMPLATE_PARMS (maintmpl
);
4030 int nargs
= TREE_VEC_LENGTH (inner_args
);
4033 bool did_error_intro
= false;
4034 struct template_parm_data tpd
;
4035 struct template_parm_data tpd2
;
4037 gcc_assert (current_template_parms
);
4039 inner_parms
= INNERMOST_TEMPLATE_PARMS (current_template_parms
);
4040 ntparms
= TREE_VEC_LENGTH (inner_parms
);
4042 /* We check that each of the template parameters given in the
4043 partial specialization is used in the argument list to the
4044 specialization. For example:
4046 template <class T> struct S;
4047 template <class T> struct S<T*>;
4049 The second declaration is OK because `T*' uses the template
4050 parameter T, whereas
4052 template <class T> struct S<int>;
4054 is no good. Even trickier is:
4065 The S2<T> declaration is actually invalid; it is a
4066 full-specialization. Of course,
4069 struct S2<T (*)(U)>;
4071 or some such would have been OK. */
4072 tpd
.level
= TMPL_PARMS_DEPTH (current_template_parms
);
4073 tpd
.parms
= XALLOCAVEC (int, ntparms
);
4074 memset (tpd
.parms
, 0, sizeof (int) * ntparms
);
4076 tpd
.arg_uses_template_parms
= XALLOCAVEC (int, nargs
);
4077 memset (tpd
.arg_uses_template_parms
, 0, sizeof (int) * nargs
);
4078 for (i
= 0; i
< nargs
; ++i
)
4080 tpd
.current_arg
= i
;
4081 for_each_template_parm (TREE_VEC_ELT (inner_args
, i
),
4082 &mark_template_parm
,
4085 /*include_nondeduced_p=*/false);
4087 for (i
= 0; i
< ntparms
; ++i
)
4088 if (tpd
.parms
[i
] == 0)
4090 /* One of the template parms was not used in the
4092 if (!did_error_intro
)
4094 error ("template parameters not used in partial specialization:");
4095 did_error_intro
= true;
4098 error (" %qD", TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
)));
4101 if (did_error_intro
)
4102 return error_mark_node
;
4104 /* [temp.class.spec]
4106 The argument list of the specialization shall not be identical to
4107 the implicit argument list of the primary template. */
4108 if (comp_template_args
4110 INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE
4112 error ("partial specialization %qT does not specialize any template arguments", type
);
4114 /* A partial specialization that replaces multiple parameters of the
4115 primary template with a pack expansion is less specialized for those
4117 if (nargs
< DECL_NTPARMS (maintmpl
))
4119 error ("partial specialization is not more specialized than the "
4120 "primary template because it replaces multiple parameters "
4121 "with a pack expansion");
4122 inform (DECL_SOURCE_LOCATION (maintmpl
), "primary template here");
4126 /* [temp.class.spec]
4128 A partially specialized non-type argument expression shall not
4129 involve template parameters of the partial specialization except
4130 when the argument expression is a simple identifier.
4132 The type of a template parameter corresponding to a specialized
4133 non-type argument shall not be dependent on a parameter of the
4136 Also, we verify that pack expansions only occur at the
4137 end of the argument list. */
4138 gcc_assert (nargs
== DECL_NTPARMS (maintmpl
));
4140 for (i
= 0; i
< nargs
; ++i
)
4142 tree parm
= TREE_VALUE (TREE_VEC_ELT (main_inner_parms
, i
));
4143 tree arg
= TREE_VEC_ELT (inner_args
, i
);
4144 tree packed_args
= NULL_TREE
;
4147 if (ARGUMENT_PACK_P (arg
))
4149 /* Extract the arguments from the argument pack. We'll be
4150 iterating over these in the following loop. */
4151 packed_args
= ARGUMENT_PACK_ARGS (arg
);
4152 len
= TREE_VEC_LENGTH (packed_args
);
4155 for (j
= 0; j
< len
; j
++)
4158 /* Get the Jth argument in the parameter pack. */
4159 arg
= TREE_VEC_ELT (packed_args
, j
);
4161 if (PACK_EXPANSION_P (arg
))
4163 /* Pack expansions must come at the end of the
4165 if ((packed_args
&& j
< len
- 1)
4166 || (!packed_args
&& i
< nargs
- 1))
4168 if (TREE_CODE (arg
) == EXPR_PACK_EXPANSION
)
4169 error ("parameter pack argument %qE must be at the "
4170 "end of the template argument list", arg
);
4172 error ("parameter pack argument %qT must be at the "
4173 "end of the template argument list", arg
);
4177 if (TREE_CODE (arg
) == EXPR_PACK_EXPANSION
)
4178 /* We only care about the pattern. */
4179 arg
= PACK_EXPANSION_PATTERN (arg
);
4181 if (/* These first two lines are the `non-type' bit. */
4183 && TREE_CODE (arg
) != TEMPLATE_DECL
4184 /* This next line is the `argument expression is not just a
4185 simple identifier' condition and also the `specialized
4186 non-type argument' bit. */
4187 && TREE_CODE (arg
) != TEMPLATE_PARM_INDEX
)
4189 if ((!packed_args
&& tpd
.arg_uses_template_parms
[i
])
4190 || (packed_args
&& uses_template_parms (arg
)))
4191 error ("template argument %qE involves template parameter(s)",
4195 /* Look at the corresponding template parameter,
4196 marking which template parameters its type depends
4198 tree type
= TREE_TYPE (parm
);
4202 /* We haven't yet initialized TPD2. Do so now. */
4203 tpd2
.arg_uses_template_parms
= XALLOCAVEC (int, nargs
);
4204 /* The number of parameters here is the number in the
4205 main template, which, as checked in the assertion
4207 tpd2
.parms
= XALLOCAVEC (int, nargs
);
4209 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (maintmpl
));
4212 /* Mark the template parameters. But this time, we're
4213 looking for the template parameters of the main
4214 template, not in the specialization. */
4215 tpd2
.current_arg
= i
;
4216 tpd2
.arg_uses_template_parms
[i
] = 0;
4217 memset (tpd2
.parms
, 0, sizeof (int) * nargs
);
4218 for_each_template_parm (type
,
4219 &mark_template_parm
,
4222 /*include_nondeduced_p=*/false);
4224 if (tpd2
.arg_uses_template_parms
[i
])
4226 /* The type depended on some template parameters.
4227 If they are fully specialized in the
4228 specialization, that's OK. */
4231 for (j
= 0; j
< nargs
; ++j
)
4232 if (tpd2
.parms
[j
] != 0
4233 && tpd
.arg_uses_template_parms
[j
])
4236 error_n (input_location
, count
,
4237 "type %qT of template argument %qE depends "
4238 "on a template parameter",
4239 "type %qT of template argument %qE depends "
4240 "on template parameters",
4249 /* We should only get here once. */
4250 gcc_assert (!COMPLETE_TYPE_P (type
));
4252 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)
4253 = tree_cons (specargs
, inner_parms
,
4254 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
));
4255 TREE_TYPE (DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)) = type
;
4257 for (inst
= DECL_TEMPLATE_INSTANTIATIONS (maintmpl
); inst
;
4258 inst
= TREE_CHAIN (inst
))
4260 tree inst_type
= TREE_VALUE (inst
);
4261 if (COMPLETE_TYPE_P (inst_type
)
4262 && CLASSTYPE_IMPLICIT_INSTANTIATION (inst_type
))
4264 tree spec
= most_specialized_class (inst_type
, maintmpl
, tf_none
);
4265 if (spec
&& TREE_TYPE (spec
) == type
)
4266 permerror (input_location
,
4267 "partial specialization of %qT after instantiation "
4268 "of %qT", type
, inst_type
);
4275 /* Check that a template declaration's use of default arguments and
4276 parameter packs is not invalid. Here, PARMS are the template
4277 parameters. IS_PRIMARY is true if DECL is the thing declared by
4278 a primary template. IS_PARTIAL is true if DECL is a partial
4281 IS_FRIEND_DECL is nonzero if DECL is a friend function template
4282 declaration (but not a definition); 1 indicates a declaration, 2
4283 indicates a redeclaration. When IS_FRIEND_DECL=2, no errors are
4284 emitted for extraneous default arguments.
4286 Returns TRUE if there were no errors found, FALSE otherwise. */
4289 check_default_tmpl_args (tree decl
, tree parms
, bool is_primary
,
4290 bool is_partial
, int is_friend_decl
)
4293 int last_level_to_check
;
4295 bool no_errors
= true;
4299 A default template-argument shall not be specified in a
4300 function template declaration or a function template definition, nor
4301 in the template-parameter-list of the definition of a member of a
4304 if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == FUNCTION_DECL
)
4305 /* You can't have a function template declaration in a local
4306 scope, nor you can you define a member of a class template in a
4310 if (TREE_CODE (decl
) == TYPE_DECL
4312 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
4313 /* A lambda doesn't have an explicit declaration; don't complain
4314 about the parms of the enclosing class. */
4317 if (current_class_type
4318 && !TYPE_BEING_DEFINED (current_class_type
)
4319 && DECL_LANG_SPECIFIC (decl
)
4320 && DECL_DECLARES_FUNCTION_P (decl
)
4321 /* If this is either a friend defined in the scope of the class
4322 or a member function. */
4323 && (DECL_FUNCTION_MEMBER_P (decl
)
4324 ? same_type_p (DECL_CONTEXT (decl
), current_class_type
)
4325 : DECL_FRIEND_CONTEXT (decl
)
4326 ? same_type_p (DECL_FRIEND_CONTEXT (decl
), current_class_type
)
4328 /* And, if it was a member function, it really was defined in
4329 the scope of the class. */
4330 && (!DECL_FUNCTION_MEMBER_P (decl
)
4331 || DECL_INITIALIZED_IN_CLASS_P (decl
)))
4332 /* We already checked these parameters when the template was
4333 declared, so there's no need to do it again now. This function
4334 was defined in class scope, but we're processing it's body now
4335 that the class is complete. */
4338 /* Core issue 226 (C++0x only): the following only applies to class
4341 && ((cxx_dialect
== cxx98
) || TREE_CODE (decl
) != FUNCTION_DECL
))
4345 If a template-parameter has a default template-argument, all
4346 subsequent template-parameters shall have a default
4347 template-argument supplied. */
4348 for (parm_level
= parms
; parm_level
; parm_level
= TREE_CHAIN (parm_level
))
4350 tree inner_parms
= TREE_VALUE (parm_level
);
4351 int ntparms
= TREE_VEC_LENGTH (inner_parms
);
4352 int seen_def_arg_p
= 0;
4355 for (i
= 0; i
< ntparms
; ++i
)
4357 tree parm
= TREE_VEC_ELT (inner_parms
, i
);
4359 if (parm
== error_mark_node
)
4362 if (TREE_PURPOSE (parm
))
4364 else if (seen_def_arg_p
4365 && !template_parameter_pack_p (TREE_VALUE (parm
)))
4367 error ("no default argument for %qD", TREE_VALUE (parm
));
4368 /* For better subsequent error-recovery, we indicate that
4369 there should have been a default argument. */
4370 TREE_PURPOSE (parm
) = error_mark_node
;
4373 else if (!is_partial
4375 /* Don't complain about an enclosing partial
4377 && parm_level
== parms
4378 && TREE_CODE (decl
) == TYPE_DECL
4380 && template_parameter_pack_p (TREE_VALUE (parm
)))
4382 /* A primary class template can only have one
4383 parameter pack, at the end of the template
4386 if (TREE_CODE (TREE_VALUE (parm
)) == PARM_DECL
)
4387 error ("parameter pack %qE must be at the end of the"
4388 " template parameter list", TREE_VALUE (parm
));
4390 error ("parameter pack %qT must be at the end of the"
4391 " template parameter list",
4392 TREE_TYPE (TREE_VALUE (parm
)));
4394 TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
))
4402 if (((cxx_dialect
== cxx98
) && TREE_CODE (decl
) != TYPE_DECL
)
4406 /* For an ordinary class template, default template arguments are
4407 allowed at the innermost level, e.g.:
4408 template <class T = int>
4410 but, in a partial specialization, they're not allowed even
4411 there, as we have in [temp.class.spec]:
4413 The template parameter list of a specialization shall not
4414 contain default template argument values.
4416 So, for a partial specialization, or for a function template
4417 (in C++98/C++03), we look at all of them. */
4420 /* But, for a primary class template that is not a partial
4421 specialization we look at all template parameters except the
4423 parms
= TREE_CHAIN (parms
);
4425 /* Figure out what error message to issue. */
4426 if (is_friend_decl
== 2)
4427 msg
= G_("default template arguments may not be used in function template "
4428 "friend re-declaration");
4429 else if (is_friend_decl
)
4430 msg
= G_("default template arguments may not be used in function template "
4431 "friend declarations");
4432 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& (cxx_dialect
== cxx98
))
4433 msg
= G_("default template arguments may not be used in function templates "
4434 "without -std=c++11 or -std=gnu++11");
4435 else if (is_partial
)
4436 msg
= G_("default template arguments may not be used in "
4437 "partial specializations");
4439 msg
= G_("default argument for template parameter for class enclosing %qD");
4441 if (current_class_type
&& TYPE_BEING_DEFINED (current_class_type
))
4442 /* If we're inside a class definition, there's no need to
4443 examine the parameters to the class itself. On the one
4444 hand, they will be checked when the class is defined, and,
4445 on the other, default arguments are valid in things like:
4446 template <class T = double>
4447 struct S { template <class U> void f(U); };
4448 Here the default argument for `S' has no bearing on the
4449 declaration of `f'. */
4450 last_level_to_check
= template_class_depth (current_class_type
) + 1;
4452 /* Check everything. */
4453 last_level_to_check
= 0;
4455 for (parm_level
= parms
;
4456 parm_level
&& TMPL_PARMS_DEPTH (parm_level
) >= last_level_to_check
;
4457 parm_level
= TREE_CHAIN (parm_level
))
4459 tree inner_parms
= TREE_VALUE (parm_level
);
4463 ntparms
= TREE_VEC_LENGTH (inner_parms
);
4464 for (i
= 0; i
< ntparms
; ++i
)
4466 if (TREE_VEC_ELT (inner_parms
, i
) == error_mark_node
)
4469 if (TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)))
4474 if (is_friend_decl
== 2)
4481 /* Clear out the default argument so that we are not
4483 TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)) = NULL_TREE
;
4487 /* At this point, if we're still interested in issuing messages,
4488 they must apply to classes surrounding the object declared. */
4490 msg
= G_("default argument for template parameter for class "
4497 /* Worker for push_template_decl_real, called via
4498 for_each_template_parm. DATA is really an int, indicating the
4499 level of the parameters we are interested in. If T is a template
4500 parameter of that level, return nonzero. */
4503 template_parm_this_level_p (tree t
, void* data
)
4505 int this_level
= *(int *)data
;
4508 if (TREE_CODE (t
) == TEMPLATE_PARM_INDEX
)
4509 level
= TEMPLATE_PARM_LEVEL (t
);
4511 level
= TEMPLATE_TYPE_LEVEL (t
);
4512 return level
== this_level
;
4515 /* Creates a TEMPLATE_DECL for the indicated DECL using the template
4516 parameters given by current_template_args, or reuses a
4517 previously existing one, if appropriate. Returns the DECL, or an
4518 equivalent one, if it is replaced via a call to duplicate_decls.
4520 If IS_FRIEND is true, DECL is a friend declaration. */
4523 push_template_decl_real (tree decl
, bool is_friend
)
4531 int new_template_p
= 0;
4532 /* True if the template is a member template, in the sense of
4534 bool member_template_p
= false;
4536 if (decl
== error_mark_node
|| !current_template_parms
)
4537 return error_mark_node
;
4539 /* See if this is a partial specialization. */
4540 is_partial
= (DECL_IMPLICIT_TYPEDEF_P (decl
)
4541 && TREE_CODE (TREE_TYPE (decl
)) != ENUMERAL_TYPE
4542 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)));
4544 if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_FRIEND_P (decl
))
4548 /* For a friend, we want the context of the friend function, not
4549 the type of which it is a friend. */
4550 ctx
= CP_DECL_CONTEXT (decl
);
4551 else if (CP_DECL_CONTEXT (decl
)
4552 && TREE_CODE (CP_DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
4553 /* In the case of a virtual function, we want the class in which
4555 ctx
= CP_DECL_CONTEXT (decl
);
4557 /* Otherwise, if we're currently defining some class, the DECL
4558 is assumed to be a member of the class. */
4559 ctx
= current_scope ();
4561 if (ctx
&& TREE_CODE (ctx
) == NAMESPACE_DECL
)
4564 if (!DECL_CONTEXT (decl
))
4565 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
4567 /* See if this is a primary template. */
4568 if (is_friend
&& ctx
)
4569 /* A friend template that specifies a class context, i.e.
4570 template <typename T> friend void A<T>::f();
4574 is_primary
= template_parm_scope_p ();
4578 if (DECL_CLASS_SCOPE_P (decl
))
4579 member_template_p
= true;
4580 if (TREE_CODE (decl
) == TYPE_DECL
4581 && ANON_AGGRNAME_P (DECL_NAME (decl
)))
4583 error ("template class without a name");
4584 return error_mark_node
;
4586 else if (TREE_CODE (decl
) == FUNCTION_DECL
)
4588 if (DECL_DESTRUCTOR_P (decl
))
4592 A destructor shall not be a member template. */
4593 error ("destructor %qD declared as member template", decl
);
4594 return error_mark_node
;
4596 if (NEW_DELETE_OPNAME_P (DECL_NAME (decl
))
4597 && (!prototype_p (TREE_TYPE (decl
))
4598 || TYPE_ARG_TYPES (TREE_TYPE (decl
)) == void_list_node
4599 || !TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)))
4600 || (TREE_CHAIN (TYPE_ARG_TYPES ((TREE_TYPE (decl
))))
4601 == void_list_node
)))
4603 /* [basic.stc.dynamic.allocation]
4605 An allocation function can be a function
4606 template. ... Template allocation functions shall
4607 have two or more parameters. */
4608 error ("invalid template declaration of %qD", decl
);
4609 return error_mark_node
;
4612 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
4613 && CLASS_TYPE_P (TREE_TYPE (decl
)))
4615 else if (TREE_CODE (decl
) == TYPE_DECL
4616 && TYPE_DECL_ALIAS_P (decl
))
4617 /* alias-declaration */
4618 gcc_assert (!DECL_ARTIFICIAL (decl
));
4621 error ("template declaration of %q#D", decl
);
4622 return error_mark_node
;
4626 /* Check to see that the rules regarding the use of default
4627 arguments are not being violated. */
4628 check_default_tmpl_args (decl
, current_template_parms
,
4629 is_primary
, is_partial
, /*is_friend_decl=*/0);
4631 /* Ensure that there are no parameter packs in the type of this
4632 declaration that have not been expanded. */
4633 if (TREE_CODE (decl
) == FUNCTION_DECL
)
4635 /* Check each of the arguments individually to see if there are
4636 any bare parameter packs. */
4637 tree type
= TREE_TYPE (decl
);
4638 tree arg
= DECL_ARGUMENTS (decl
);
4639 tree argtype
= TYPE_ARG_TYPES (type
);
4641 while (arg
&& argtype
)
4643 if (!FUNCTION_PARAMETER_PACK_P (arg
)
4644 && check_for_bare_parameter_packs (TREE_TYPE (arg
)))
4646 /* This is a PARM_DECL that contains unexpanded parameter
4647 packs. We have already complained about this in the
4648 check_for_bare_parameter_packs call, so just replace
4649 these types with ERROR_MARK_NODE. */
4650 TREE_TYPE (arg
) = error_mark_node
;
4651 TREE_VALUE (argtype
) = error_mark_node
;
4654 arg
= DECL_CHAIN (arg
);
4655 argtype
= TREE_CHAIN (argtype
);
4658 /* Check for bare parameter packs in the return type and the
4659 exception specifiers. */
4660 if (check_for_bare_parameter_packs (TREE_TYPE (type
)))
4661 /* Errors were already issued, set return type to int
4662 as the frontend doesn't expect error_mark_node as
4664 TREE_TYPE (type
) = integer_type_node
;
4665 if (check_for_bare_parameter_packs (TYPE_RAISES_EXCEPTIONS (type
)))
4666 TYPE_RAISES_EXCEPTIONS (type
) = NULL_TREE
;
4668 else if (check_for_bare_parameter_packs ((TREE_CODE (decl
) == TYPE_DECL
4669 && TYPE_DECL_ALIAS_P (decl
))
4670 ? DECL_ORIGINAL_TYPE (decl
)
4671 : TREE_TYPE (decl
)))
4673 TREE_TYPE (decl
) = error_mark_node
;
4674 return error_mark_node
;
4678 return process_partial_specialization (decl
);
4680 args
= current_template_args ();
4683 || TREE_CODE (ctx
) == FUNCTION_DECL
4684 || (CLASS_TYPE_P (ctx
) && TYPE_BEING_DEFINED (ctx
))
4685 || (TREE_CODE (decl
) == TYPE_DECL
4686 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
4687 || (is_friend
&& !DECL_TEMPLATE_INFO (decl
)))
4689 if (DECL_LANG_SPECIFIC (decl
)
4690 && DECL_TEMPLATE_INFO (decl
)
4691 && DECL_TI_TEMPLATE (decl
))
4692 tmpl
= DECL_TI_TEMPLATE (decl
);
4693 /* If DECL is a TYPE_DECL for a class-template, then there won't
4694 be DECL_LANG_SPECIFIC. The information equivalent to
4695 DECL_TEMPLATE_INFO is found in TYPE_TEMPLATE_INFO instead. */
4696 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
4697 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl
))
4698 && TYPE_TI_TEMPLATE (TREE_TYPE (decl
)))
4700 /* Since a template declaration already existed for this
4701 class-type, we must be redeclaring it here. Make sure
4702 that the redeclaration is valid. */
4703 redeclare_class_template (TREE_TYPE (decl
),
4704 current_template_parms
);
4705 /* We don't need to create a new TEMPLATE_DECL; just use the
4706 one we already had. */
4707 tmpl
= TYPE_TI_TEMPLATE (TREE_TYPE (decl
));
4711 tmpl
= build_template_decl (decl
, current_template_parms
,
4715 if (DECL_LANG_SPECIFIC (decl
)
4716 && DECL_TEMPLATE_SPECIALIZATION (decl
))
4718 /* A specialization of a member template of a template
4720 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
4721 DECL_TEMPLATE_INFO (tmpl
) = DECL_TEMPLATE_INFO (decl
);
4722 DECL_TEMPLATE_INFO (decl
) = NULL_TREE
;
4728 tree a
, t
, current
, parms
;
4730 tree tinfo
= get_template_info (decl
);
4734 error ("template definition of non-template %q#D", decl
);
4735 return error_mark_node
;
4738 tmpl
= TI_TEMPLATE (tinfo
);
4740 if (DECL_FUNCTION_TEMPLATE_P (tmpl
)
4741 && DECL_TEMPLATE_INFO (decl
) && DECL_TI_ARGS (decl
)
4742 && DECL_TEMPLATE_SPECIALIZATION (decl
)
4743 && DECL_MEMBER_TEMPLATE_P (tmpl
))
4747 /* The declaration is a specialization of a member
4748 template, declared outside the class. Therefore, the
4749 innermost template arguments will be NULL, so we
4750 replace them with the arguments determined by the
4751 earlier call to check_explicit_specialization. */
4752 args
= DECL_TI_ARGS (decl
);
4755 = build_template_decl (decl
, current_template_parms
,
4757 DECL_TEMPLATE_RESULT (new_tmpl
) = decl
;
4758 TREE_TYPE (new_tmpl
) = TREE_TYPE (decl
);
4759 DECL_TI_TEMPLATE (decl
) = new_tmpl
;
4760 SET_DECL_TEMPLATE_SPECIALIZATION (new_tmpl
);
4761 DECL_TEMPLATE_INFO (new_tmpl
)
4762 = build_template_info (tmpl
, args
);
4764 register_specialization (new_tmpl
,
4765 most_general_template (tmpl
),
4771 /* Make sure the template headers we got make sense. */
4773 parms
= DECL_TEMPLATE_PARMS (tmpl
);
4774 i
= TMPL_PARMS_DEPTH (parms
);
4775 if (TMPL_ARGS_DEPTH (args
) != i
)
4777 error ("expected %d levels of template parms for %q#D, got %d",
4778 i
, decl
, TMPL_ARGS_DEPTH (args
));
4781 for (current
= decl
; i
> 0; --i
, parms
= TREE_CHAIN (parms
))
4783 a
= TMPL_ARGS_LEVEL (args
, i
);
4784 t
= INNERMOST_TEMPLATE_PARMS (parms
);
4786 if (TREE_VEC_LENGTH (t
) != TREE_VEC_LENGTH (a
))
4788 if (current
== decl
)
4789 error ("got %d template parameters for %q#D",
4790 TREE_VEC_LENGTH (a
), decl
);
4792 error ("got %d template parameters for %q#T",
4793 TREE_VEC_LENGTH (a
), current
);
4794 error (" but %d required", TREE_VEC_LENGTH (t
));
4795 /* Avoid crash in import_export_decl. */
4796 DECL_INTERFACE_KNOWN (decl
) = 1;
4797 return error_mark_node
;
4800 if (current
== decl
)
4802 else if (current
== NULL_TREE
)
4803 /* Can happen in erroneous input. */
4806 current
= get_containing_scope (current
);
4809 /* Check that the parms are used in the appropriate qualifying scopes
4810 in the declarator. */
4811 if (!comp_template_args
4813 TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (tmpl
)))))
4816 template arguments to %qD do not match original template %qD",
4817 decl
, DECL_TEMPLATE_RESULT (tmpl
));
4818 if (!uses_template_parms (TI_ARGS (tinfo
)))
4819 inform (input_location
, "use template<> for an explicit specialization");
4820 /* Avoid crash in import_export_decl. */
4821 DECL_INTERFACE_KNOWN (decl
) = 1;
4822 return error_mark_node
;
4826 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
4827 TREE_TYPE (tmpl
) = TREE_TYPE (decl
);
4829 /* Push template declarations for global functions and types. Note
4830 that we do not try to push a global template friend declared in a
4831 template class; such a thing may well depend on the template
4832 parameters of the class. */
4833 if (new_template_p
&& !ctx
4834 && !(is_friend
&& template_class_depth (current_class_type
) > 0))
4836 tmpl
= pushdecl_namespace_level (tmpl
, is_friend
);
4837 if (tmpl
== error_mark_node
)
4838 return error_mark_node
;
4840 /* Hide template friend classes that haven't been declared yet. */
4841 if (is_friend
&& TREE_CODE (decl
) == TYPE_DECL
)
4843 DECL_ANTICIPATED (tmpl
) = 1;
4844 DECL_FRIEND_P (tmpl
) = 1;
4850 tree parms
= DECL_TEMPLATE_PARMS (tmpl
);
4853 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
4854 if (DECL_CONV_FN_P (tmpl
))
4856 int depth
= TMPL_PARMS_DEPTH (parms
);
4858 /* It is a conversion operator. See if the type converted to
4859 depends on innermost template operands. */
4861 if (uses_template_parms_level (TREE_TYPE (TREE_TYPE (tmpl
)),
4863 DECL_TEMPLATE_CONV_FN_P (tmpl
) = 1;
4866 /* Give template template parms a DECL_CONTEXT of the template
4867 for which they are a parameter. */
4868 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
4869 for (i
= TREE_VEC_LENGTH (parms
) - 1; i
>= 0; --i
)
4871 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
4872 if (TREE_CODE (parm
) == TEMPLATE_DECL
)
4873 DECL_CONTEXT (parm
) = tmpl
;
4877 /* The DECL_TI_ARGS of DECL contains full set of arguments referring
4878 back to its most general template. If TMPL is a specialization,
4879 ARGS may only have the innermost set of arguments. Add the missing
4880 argument levels if necessary. */
4881 if (DECL_TEMPLATE_INFO (tmpl
))
4882 args
= add_outermost_template_args (DECL_TI_ARGS (tmpl
), args
);
4884 info
= build_template_info (tmpl
, args
);
4886 if (DECL_IMPLICIT_TYPEDEF_P (decl
))
4887 SET_TYPE_TEMPLATE_INFO (TREE_TYPE (tmpl
), info
);
4890 if (is_primary
&& !DECL_LANG_SPECIFIC (decl
))
4891 retrofit_lang_decl (decl
);
4892 if (DECL_LANG_SPECIFIC (decl
))
4893 DECL_TEMPLATE_INFO (decl
) = info
;
4896 return DECL_TEMPLATE_RESULT (tmpl
);
4900 push_template_decl (tree decl
)
4902 return push_template_decl_real (decl
, false);
4905 /* FN is an inheriting constructor that inherits from the constructor
4906 template INHERITED; turn FN into a constructor template with a matching
4910 add_inherited_template_parms (tree fn
, tree inherited
)
4913 = INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (inherited
));
4914 inner_parms
= copy_node (inner_parms
);
4916 = tree_cons (size_int (processing_template_decl
+ 1),
4917 inner_parms
, current_template_parms
);
4918 tree tmpl
= build_template_decl (fn
, parms
, /*member*/true);
4919 tree args
= template_parms_to_args (parms
);
4920 DECL_TEMPLATE_INFO (fn
) = build_template_info (tmpl
, args
);
4921 TREE_TYPE (tmpl
) = TREE_TYPE (fn
);
4922 DECL_TEMPLATE_RESULT (tmpl
) = fn
;
4923 DECL_ARTIFICIAL (tmpl
) = true;
4924 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
4928 /* Called when a class template TYPE is redeclared with the indicated
4929 template PARMS, e.g.:
4931 template <class T> struct S;
4932 template <class T> struct S {}; */
4935 redeclare_class_template (tree type
, tree parms
)
4941 if (!TYPE_TEMPLATE_INFO (type
))
4943 error ("%qT is not a template type", type
);
4947 tmpl
= TYPE_TI_TEMPLATE (type
);
4948 if (!PRIMARY_TEMPLATE_P (tmpl
))
4949 /* The type is nested in some template class. Nothing to worry
4950 about here; there are no new template parameters for the nested
4956 error ("template specifiers not specified in declaration of %qD",
4961 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
4962 tmpl_parms
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl
);
4964 if (TREE_VEC_LENGTH (parms
) != TREE_VEC_LENGTH (tmpl_parms
))
4966 error_n (input_location
, TREE_VEC_LENGTH (parms
),
4967 "redeclared with %d template parameter",
4968 "redeclared with %d template parameters",
4969 TREE_VEC_LENGTH (parms
));
4970 inform_n (input_location
, TREE_VEC_LENGTH (tmpl_parms
),
4971 "previous declaration %q+D used %d template parameter",
4972 "previous declaration %q+D used %d template parameters",
4973 tmpl
, TREE_VEC_LENGTH (tmpl_parms
));
4977 for (i
= 0; i
< TREE_VEC_LENGTH (tmpl_parms
); ++i
)
4984 if (TREE_VEC_ELT (tmpl_parms
, i
) == error_mark_node
4985 || TREE_VEC_ELT (parms
, i
) == error_mark_node
)
4988 tmpl_parm
= TREE_VALUE (TREE_VEC_ELT (tmpl_parms
, i
));
4989 if (tmpl_parm
== error_mark_node
)
4992 parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
4993 tmpl_default
= TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
));
4994 parm_default
= TREE_PURPOSE (TREE_VEC_ELT (parms
, i
));
4996 /* TMPL_PARM and PARM can be either TYPE_DECL, PARM_DECL, or
4998 if (TREE_CODE (tmpl_parm
) != TREE_CODE (parm
)
4999 || (TREE_CODE (tmpl_parm
) != TYPE_DECL
5000 && !same_type_p (TREE_TYPE (tmpl_parm
), TREE_TYPE (parm
)))
5001 || (TREE_CODE (tmpl_parm
) != PARM_DECL
5002 && (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (tmpl_parm
))
5003 != TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
))))
5004 || (TREE_CODE (tmpl_parm
) == PARM_DECL
5005 && (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (tmpl_parm
))
5006 != TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))))
5008 error ("template parameter %q+#D", tmpl_parm
);
5009 error ("redeclared here as %q#D", parm
);
5013 if (tmpl_default
!= NULL_TREE
&& parm_default
!= NULL_TREE
)
5015 /* We have in [temp.param]:
5017 A template-parameter may not be given default arguments
5018 by two different declarations in the same scope. */
5019 error_at (input_location
, "redefinition of default argument for %q#D", parm
);
5020 inform (DECL_SOURCE_LOCATION (tmpl_parm
),
5021 "original definition appeared here");
5025 if (parm_default
!= NULL_TREE
)
5026 /* Update the previous template parameters (which are the ones
5027 that will really count) with the new default value. */
5028 TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
)) = parm_default
;
5029 else if (tmpl_default
!= NULL_TREE
)
5030 /* Update the new parameters, too; they'll be used as the
5031 parameters for any members. */
5032 TREE_PURPOSE (TREE_VEC_ELT (parms
, i
)) = tmpl_default
;
5038 /* Simplify EXPR if it is a non-dependent expression. Returns the
5039 (possibly simplified) expression. */
5042 fold_non_dependent_expr_sfinae (tree expr
, tsubst_flags_t complain
)
5044 if (expr
== NULL_TREE
)
5047 /* If we're in a template, but EXPR isn't value dependent, simplify
5048 it. We're supposed to treat:
5050 template <typename T> void f(T[1 + 1]);
5051 template <typename T> void f(T[2]);
5053 as two declarations of the same function, for example. */
5054 if (processing_template_decl
5055 && !instantiation_dependent_expression_p (expr
)
5056 && potential_constant_expression (expr
))
5058 HOST_WIDE_INT saved_processing_template_decl
;
5060 saved_processing_template_decl
= processing_template_decl
;
5061 processing_template_decl
= 0;
5062 expr
= tsubst_copy_and_build (expr
,
5065 /*in_decl=*/NULL_TREE
,
5066 /*function_p=*/false,
5067 /*integral_constant_expression_p=*/true);
5068 processing_template_decl
= saved_processing_template_decl
;
5074 fold_non_dependent_expr (tree expr
)
5076 return fold_non_dependent_expr_sfinae (expr
, tf_error
);
5079 /* Return TRUE iff T is a type alias, a TEMPLATE_DECL for an alias
5080 template declaration, or a TYPE_DECL for an alias declaration. */
5083 alias_type_or_template_p (tree t
)
5087 return ((TREE_CODE (t
) == TYPE_DECL
&& TYPE_DECL_ALIAS_P (t
))
5090 && TYPE_DECL_ALIAS_P (TYPE_NAME (t
)))
5091 || DECL_ALIAS_TEMPLATE_P (t
));
5094 /* Return TRUE iff is a specialization of an alias template. */
5097 alias_template_specialization_p (const_tree t
)
5103 && TYPE_TEMPLATE_INFO (t
)
5104 && PRIMARY_TEMPLATE_P (TYPE_TI_TEMPLATE (t
))
5105 && DECL_ALIAS_TEMPLATE_P (TYPE_TI_TEMPLATE (t
)));
5108 /* Subroutine of convert_nontype_argument. Converts EXPR to TYPE, which
5109 must be a function or a pointer-to-function type, as specified
5110 in [temp.arg.nontype]: disambiguate EXPR if it is an overload set,
5111 and check that the resulting function has external linkage. */
5114 convert_nontype_argument_function (tree type
, tree expr
)
5118 linkage_kind linkage
;
5120 fn
= instantiate_type (type
, fns
, tf_none
);
5121 if (fn
== error_mark_node
)
5122 return error_mark_node
;
5125 if (TREE_CODE (fn_no_ptr
) == ADDR_EXPR
)
5126 fn_no_ptr
= TREE_OPERAND (fn_no_ptr
, 0);
5127 if (BASELINK_P (fn_no_ptr
))
5128 fn_no_ptr
= BASELINK_FUNCTIONS (fn_no_ptr
);
5130 /* [temp.arg.nontype]/1
5132 A template-argument for a non-type, non-template template-parameter
5135 -- the address of an object or function with external [C++11: or
5136 internal] linkage. */
5138 if (TREE_CODE (fn_no_ptr
) != FUNCTION_DECL
)
5140 error ("%qE is not a valid template argument for type %qT", expr
, type
);
5141 if (TYPE_PTR_P (type
))
5142 error ("it must be the address of a function with external linkage");
5144 error ("it must be the name of a function with external linkage");
5148 linkage
= decl_linkage (fn_no_ptr
);
5149 if (cxx_dialect
>= cxx0x
? linkage
== lk_none
: linkage
!= lk_external
)
5151 if (cxx_dialect
>= cxx0x
)
5152 error ("%qE is not a valid template argument for type %qT "
5153 "because %qD has no linkage",
5154 expr
, type
, fn_no_ptr
);
5156 error ("%qE is not a valid template argument for type %qT "
5157 "because %qD does not have external linkage",
5158 expr
, type
, fn_no_ptr
);
5165 /* Subroutine of convert_nontype_argument.
5166 Check if EXPR of type TYPE is a valid pointer-to-member constant.
5167 Emit an error otherwise. */
5170 check_valid_ptrmem_cst_expr (tree type
, tree expr
,
5171 tsubst_flags_t complain
)
5174 if (expr
&& (null_ptr_cst_p (expr
) || TREE_CODE (expr
) == PTRMEM_CST
))
5176 if (cxx_dialect
>= cxx0x
&& null_member_pointer_value_p (expr
))
5178 if (complain
& tf_error
)
5180 error ("%qE is not a valid template argument for type %qT",
5182 error ("it must be a pointer-to-member of the form %<&X::Y%>");
5187 /* Returns TRUE iff the address of OP is value-dependent.
5189 14.6.2.4 [temp.dep.temp]:
5190 A non-integral non-type template-argument is dependent if its type is
5191 dependent or it has either of the following forms
5194 and contains a nested-name-specifier which specifies a class-name that
5195 names a dependent type.
5197 We generalize this to just say that the address of a member of a
5198 dependent class is value-dependent; the above doesn't cover the
5199 address of a static data member named with an unqualified-id. */
5202 has_value_dependent_address (tree op
)
5204 /* We could use get_inner_reference here, but there's no need;
5205 this is only relevant for template non-type arguments, which
5206 can only be expressed as &id-expression. */
5209 tree ctx
= CP_DECL_CONTEXT (op
);
5210 if (TYPE_P (ctx
) && dependent_type_p (ctx
))
5217 /* The next set of functions are used for providing helpful explanatory
5218 diagnostics for failed overload resolution. Their messages should be
5219 indented by two spaces for consistency with the messages in
5223 unify_success (bool /*explain_p*/)
5229 unify_parameter_deduction_failure (bool explain_p
, tree parm
)
5232 inform (input_location
,
5233 " couldn't deduce template parameter %qD", parm
);
5238 unify_invalid (bool /*explain_p*/)
5244 unify_cv_qual_mismatch (bool explain_p
, tree parm
, tree arg
)
5247 inform (input_location
,
5248 " types %qT and %qT have incompatible cv-qualifiers",
5254 unify_type_mismatch (bool explain_p
, tree parm
, tree arg
)
5257 inform (input_location
, " mismatched types %qT and %qT", parm
, arg
);
5262 unify_parameter_pack_mismatch (bool explain_p
, tree parm
, tree arg
)
5265 inform (input_location
,
5266 " template parameter %qD is not a parameter pack, but "
5273 unify_ptrmem_cst_mismatch (bool explain_p
, tree parm
, tree arg
)
5276 inform (input_location
,
5277 " template argument %qE does not match "
5278 "pointer-to-member constant %qE",
5284 unify_expression_unequal (bool explain_p
, tree parm
, tree arg
)
5287 inform (input_location
, " %qE is not equivalent to %qE", parm
, arg
);
5292 unify_parameter_pack_inconsistent (bool explain_p
, tree old_arg
, tree new_arg
)
5295 inform (input_location
,
5296 " inconsistent parameter pack deduction with %qT and %qT",
5302 unify_inconsistency (bool explain_p
, tree parm
, tree first
, tree second
)
5307 inform (input_location
,
5308 " deduced conflicting types for parameter %qT (%qT and %qT)",
5309 parm
, first
, second
);
5311 inform (input_location
,
5312 " deduced conflicting values for non-type parameter "
5313 "%qE (%qE and %qE)", parm
, first
, second
);
5319 unify_vla_arg (bool explain_p
, tree arg
)
5322 inform (input_location
,
5323 " variable-sized array type %qT is not "
5324 "a valid template argument",
5330 unify_method_type_error (bool explain_p
, tree arg
)
5333 inform (input_location
,
5334 " member function type %qT is not a valid template argument",
5340 unify_arity (bool explain_p
, int have
, int wanted
)
5343 inform_n (input_location
, wanted
,
5344 " candidate expects %d argument, %d provided",
5345 " candidate expects %d arguments, %d provided",
5351 unify_too_many_arguments (bool explain_p
, int have
, int wanted
)
5353 return unify_arity (explain_p
, have
, wanted
);
5357 unify_too_few_arguments (bool explain_p
, int have
, int wanted
)
5359 return unify_arity (explain_p
, have
, wanted
);
5363 unify_arg_conversion (bool explain_p
, tree to_type
,
5364 tree from_type
, tree arg
)
5367 inform (input_location
, " cannot convert %qE (type %qT) to type %qT",
5368 arg
, from_type
, to_type
);
5373 unify_no_common_base (bool explain_p
, enum template_base_result r
,
5374 tree parm
, tree arg
)
5379 case tbr_ambiguous_baseclass
:
5380 inform (input_location
, " %qT is an ambiguous base class of %qT",
5384 inform (input_location
, " %qT is not derived from %qT", arg
, parm
);
5391 unify_inconsistent_template_template_parameters (bool explain_p
)
5394 inform (input_location
,
5395 " template parameters of a template template argument are "
5396 "inconsistent with other deduced template arguments");
5401 unify_template_deduction_failure (bool explain_p
, tree parm
, tree arg
)
5404 inform (input_location
,
5405 " can't deduce a template for %qT from non-template type %qT",
5411 unify_template_argument_mismatch (bool explain_p
, tree parm
, tree arg
)
5414 inform (input_location
,
5415 " template argument %qE does not match %qD", arg
, parm
);
5420 unify_overload_resolution_failure (bool explain_p
, tree arg
)
5423 inform (input_location
,
5424 " could not resolve address from overloaded function %qE",
5429 /* Attempt to convert the non-type template parameter EXPR to the
5430 indicated TYPE. If the conversion is successful, return the
5431 converted value. If the conversion is unsuccessful, return
5432 NULL_TREE if we issued an error message, or error_mark_node if we
5433 did not. We issue error messages for out-and-out bad template
5434 parameters, but not simply because the conversion failed, since we
5435 might be just trying to do argument deduction. Both TYPE and EXPR
5436 must be non-dependent.
5438 The conversion follows the special rules described in
5439 [temp.arg.nontype], and it is much more strict than an implicit
5442 This function is called twice for each template argument (see
5443 lookup_template_class for a more accurate description of this
5444 problem). This means that we need to handle expressions which
5445 are not valid in a C++ source, but can be created from the
5446 first call (for instance, casts to perform conversions). These
5447 hacks can go away after we fix the double coercion problem. */
5450 convert_nontype_argument (tree type
, tree expr
, tsubst_flags_t complain
)
5454 /* Detect immediately string literals as invalid non-type argument.
5455 This special-case is not needed for correctness (we would easily
5456 catch this later), but only to provide better diagnostic for this
5457 common user mistake. As suggested by DR 100, we do not mention
5458 linkage issues in the diagnostic as this is not the point. */
5459 /* FIXME we're making this OK. */
5460 if (TREE_CODE (expr
) == STRING_CST
)
5462 if (complain
& tf_error
)
5463 error ("%qE is not a valid template argument for type %qT "
5464 "because string literals can never be used in this context",
5469 /* Add the ADDR_EXPR now for the benefit of
5470 value_dependent_expression_p. */
5471 if (TYPE_PTROBV_P (type
)
5472 && TREE_CODE (TREE_TYPE (expr
)) == ARRAY_TYPE
)
5474 expr
= decay_conversion (expr
, complain
);
5475 if (expr
== error_mark_node
)
5476 return error_mark_node
;
5479 /* If we are in a template, EXPR may be non-dependent, but still
5480 have a syntactic, rather than semantic, form. For example, EXPR
5481 might be a SCOPE_REF, rather than the VAR_DECL to which the
5482 SCOPE_REF refers. Preserving the qualifying scope is necessary
5483 so that access checking can be performed when the template is
5484 instantiated -- but here we need the resolved form so that we can
5485 convert the argument. */
5486 if (TYPE_REF_OBJ_P (type
)
5487 && has_value_dependent_address (expr
))
5488 /* If we want the address and it's value-dependent, don't fold. */;
5489 else if (!type_unknown_p (expr
))
5490 expr
= fold_non_dependent_expr_sfinae (expr
, complain
);
5491 if (error_operand_p (expr
))
5492 return error_mark_node
;
5493 expr_type
= TREE_TYPE (expr
);
5494 if (TREE_CODE (type
) == REFERENCE_TYPE
)
5495 expr
= mark_lvalue_use (expr
);
5497 expr
= mark_rvalue_use (expr
);
5499 /* 14.3.2/5: The null pointer{,-to-member} conversion is applied
5500 to a non-type argument of "nullptr". */
5501 if (expr
== nullptr_node
&& TYPE_PTR_OR_PTRMEM_P (type
))
5502 expr
= convert (type
, expr
);
5504 /* In C++11, integral or enumeration non-type template arguments can be
5505 arbitrary constant expressions. Pointer and pointer to
5506 member arguments can be general constant expressions that evaluate
5507 to a null value, but otherwise still need to be of a specific form. */
5508 if (cxx_dialect
>= cxx0x
)
5510 if (TREE_CODE (expr
) == PTRMEM_CST
)
5511 /* A PTRMEM_CST is already constant, and a valid template
5512 argument for a parameter of pointer to member type, we just want
5513 to leave it in that form rather than lower it to a
5515 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
5516 expr
= maybe_constant_value (expr
);
5517 else if (TYPE_PTR_OR_PTRMEM_P (type
))
5519 tree folded
= maybe_constant_value (expr
);
5520 if (TYPE_PTR_P (type
) ? integer_zerop (folded
)
5521 : null_member_pointer_value_p (folded
))
5526 /* HACK: Due to double coercion, we can get a
5527 NOP_EXPR<REFERENCE_TYPE>(ADDR_EXPR<POINTER_TYPE> (arg)) here,
5528 which is the tree that we built on the first call (see
5529 below when coercing to reference to object or to reference to
5530 function). We just strip everything and get to the arg.
5531 See g++.old-deja/g++.oliva/template4.C and g++.dg/template/nontype9.C
5533 if (TYPE_REF_OBJ_P (type
) || TYPE_REFFN_P (type
))
5535 tree probe_type
, probe
= expr
;
5536 if (REFERENCE_REF_P (probe
))
5537 probe
= TREE_OPERAND (probe
, 0);
5538 probe_type
= TREE_TYPE (probe
);
5539 if (TREE_CODE (probe
) == NOP_EXPR
)
5541 /* ??? Maybe we could use convert_from_reference here, but we
5542 would need to relax its constraints because the NOP_EXPR
5543 could actually change the type to something more cv-qualified,
5544 and this is not folded by convert_from_reference. */
5545 tree addr
= TREE_OPERAND (probe
, 0);
5546 if (TREE_CODE (probe_type
) == REFERENCE_TYPE
5547 && TREE_CODE (addr
) == ADDR_EXPR
5548 && TYPE_PTR_P (TREE_TYPE (addr
))
5549 && (same_type_ignoring_top_level_qualifiers_p
5550 (TREE_TYPE (probe_type
),
5551 TREE_TYPE (TREE_TYPE (addr
)))))
5553 expr
= TREE_OPERAND (addr
, 0);
5554 expr_type
= TREE_TYPE (expr
);
5559 /* We could also generate a NOP_EXPR(ADDR_EXPR()) when the
5560 parameter is a pointer to object, through decay and
5561 qualification conversion. Let's strip everything. */
5562 else if (TREE_CODE (expr
) == NOP_EXPR
&& TYPE_PTROBV_P (type
))
5566 if (TREE_CODE (probe
) == ADDR_EXPR
5567 && TYPE_PTR_P (TREE_TYPE (probe
)))
5569 /* Skip the ADDR_EXPR only if it is part of the decay for
5570 an array. Otherwise, it is part of the original argument
5571 in the source code. */
5572 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (probe
, 0))) == ARRAY_TYPE
)
5573 probe
= TREE_OPERAND (probe
, 0);
5575 expr_type
= TREE_TYPE (expr
);
5579 /* [temp.arg.nontype]/5, bullet 1
5581 For a non-type template-parameter of integral or enumeration type,
5582 integral promotions (_conv.prom_) and integral conversions
5583 (_conv.integral_) are applied. */
5584 if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
5586 tree t
= build_integral_nontype_arg_conv (type
, expr
, complain
);
5587 t
= maybe_constant_value (t
);
5588 if (t
!= error_mark_node
)
5591 if (!same_type_ignoring_top_level_qualifiers_p (type
, TREE_TYPE (expr
)))
5592 return error_mark_node
;
5594 /* Notice that there are constant expressions like '4 % 0' which
5595 do not fold into integer constants. */
5596 if (TREE_CODE (expr
) != INTEGER_CST
)
5598 if (complain
& tf_error
)
5600 int errs
= errorcount
, warns
= warningcount
+ werrorcount
;
5601 if (processing_template_decl
5602 && !require_potential_constant_expression (expr
))
5604 expr
= cxx_constant_value (expr
);
5605 if (errorcount
> errs
|| warningcount
+ werrorcount
> warns
)
5606 inform (EXPR_LOC_OR_HERE (expr
),
5607 "in template argument for type %qT ", type
);
5608 if (expr
== error_mark_node
)
5610 /* else cxx_constant_value complained but gave us
5611 a real constant, so go ahead. */
5612 gcc_assert (TREE_CODE (expr
) == INTEGER_CST
);
5618 /* [temp.arg.nontype]/5, bullet 2
5620 For a non-type template-parameter of type pointer to object,
5621 qualification conversions (_conv.qual_) and the array-to-pointer
5622 conversion (_conv.array_) are applied. */
5623 else if (TYPE_PTROBV_P (type
))
5625 /* [temp.arg.nontype]/1 (TC1 version, DR 49):
5627 A template-argument for a non-type, non-template template-parameter
5628 shall be one of: [...]
5630 -- the name of a non-type template-parameter;
5631 -- the address of an object or function with external linkage, [...]
5632 expressed as "& id-expression" where the & is optional if the name
5633 refers to a function or array, or if the corresponding
5634 template-parameter is a reference.
5636 Here, we do not care about functions, as they are invalid anyway
5637 for a parameter of type pointer-to-object. */
5639 if (DECL_P (expr
) && DECL_TEMPLATE_PARM_P (expr
))
5640 /* Non-type template parameters are OK. */
5642 else if (cxx_dialect
>= cxx0x
&& integer_zerop (expr
))
5643 /* Null pointer values are OK in C++11. */;
5644 else if (TREE_CODE (expr
) != ADDR_EXPR
5645 && TREE_CODE (expr_type
) != ARRAY_TYPE
)
5649 error ("%qD is not a valid template argument "
5650 "because %qD is a variable, not the address of "
5655 if (POINTER_TYPE_P (expr_type
))
5657 error ("%qE is not a valid template argument for %qT"
5658 "because it is not the address of a variable",
5662 /* Other values, like integer constants, might be valid
5663 non-type arguments of some other type. */
5664 return error_mark_node
;
5670 decl
= ((TREE_CODE (expr
) == ADDR_EXPR
)
5671 ? TREE_OPERAND (expr
, 0) : expr
);
5674 error ("%qE is not a valid template argument of type %qT "
5675 "because %qE is not a variable",
5679 else if (cxx_dialect
< cxx0x
&& !DECL_EXTERNAL_LINKAGE_P (decl
))
5681 error ("%qE is not a valid template argument of type %qT "
5682 "because %qD does not have external linkage",
5686 else if (cxx_dialect
>= cxx0x
&& decl_linkage (decl
) == lk_none
)
5688 error ("%qE is not a valid template argument of type %qT "
5689 "because %qD has no linkage",
5695 expr
= decay_conversion (expr
, complain
);
5696 if (expr
== error_mark_node
)
5697 return error_mark_node
;
5699 expr
= perform_qualification_conversions (type
, expr
);
5700 if (expr
== error_mark_node
)
5701 return error_mark_node
;
5703 /* [temp.arg.nontype]/5, bullet 3
5705 For a non-type template-parameter of type reference to object, no
5706 conversions apply. The type referred to by the reference may be more
5707 cv-qualified than the (otherwise identical) type of the
5708 template-argument. The template-parameter is bound directly to the
5709 template-argument, which must be an lvalue. */
5710 else if (TYPE_REF_OBJ_P (type
))
5712 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type
),
5714 return error_mark_node
;
5716 if (!at_least_as_qualified_p (TREE_TYPE (type
), expr_type
))
5718 error ("%qE is not a valid template argument for type %qT "
5719 "because of conflicts in cv-qualification", expr
, type
);
5723 if (!real_lvalue_p (expr
))
5725 error ("%qE is not a valid template argument for type %qT "
5726 "because it is not an lvalue", expr
, type
);
5730 /* [temp.arg.nontype]/1
5732 A template-argument for a non-type, non-template template-parameter
5733 shall be one of: [...]
5735 -- the address of an object or function with external linkage. */
5736 if (INDIRECT_REF_P (expr
)
5737 && TYPE_REF_OBJ_P (TREE_TYPE (TREE_OPERAND (expr
, 0))))
5739 expr
= TREE_OPERAND (expr
, 0);
5742 error ("%q#D is not a valid template argument for type %qT "
5743 "because a reference variable does not have a constant "
5744 "address", expr
, type
);
5751 error ("%qE is not a valid template argument for type %qT "
5752 "because it is not an object with external linkage",
5757 if (!DECL_EXTERNAL_LINKAGE_P (expr
))
5759 error ("%qE is not a valid template argument for type %qT "
5760 "because object %qD has not external linkage",
5765 expr
= build_nop (type
, build_address (expr
));
5767 /* [temp.arg.nontype]/5, bullet 4
5769 For a non-type template-parameter of type pointer to function, only
5770 the function-to-pointer conversion (_conv.func_) is applied. If the
5771 template-argument represents a set of overloaded functions (or a
5772 pointer to such), the matching function is selected from the set
5774 else if (TYPE_PTRFN_P (type
))
5776 /* If the argument is a template-id, we might not have enough
5777 context information to decay the pointer. */
5778 if (!type_unknown_p (expr_type
))
5780 expr
= decay_conversion (expr
, complain
);
5781 if (expr
== error_mark_node
)
5782 return error_mark_node
;
5785 if (cxx_dialect
>= cxx0x
&& integer_zerop (expr
))
5786 /* Null pointer values are OK in C++11. */
5787 return perform_qualification_conversions (type
, expr
);
5789 expr
= convert_nontype_argument_function (type
, expr
);
5790 if (!expr
|| expr
== error_mark_node
)
5793 /* [temp.arg.nontype]/5, bullet 5
5795 For a non-type template-parameter of type reference to function, no
5796 conversions apply. If the template-argument represents a set of
5797 overloaded functions, the matching function is selected from the set
5799 else if (TYPE_REFFN_P (type
))
5801 if (TREE_CODE (expr
) == ADDR_EXPR
)
5803 error ("%qE is not a valid template argument for type %qT "
5804 "because it is a pointer", expr
, type
);
5805 inform (input_location
, "try using %qE instead", TREE_OPERAND (expr
, 0));
5809 expr
= convert_nontype_argument_function (type
, expr
);
5810 if (!expr
|| expr
== error_mark_node
)
5813 expr
= build_nop (type
, build_address (expr
));
5815 /* [temp.arg.nontype]/5, bullet 6
5817 For a non-type template-parameter of type pointer to member function,
5818 no conversions apply. If the template-argument represents a set of
5819 overloaded member functions, the matching member function is selected
5820 from the set (_over.over_). */
5821 else if (TYPE_PTRMEMFUNC_P (type
))
5823 expr
= instantiate_type (type
, expr
, tf_none
);
5824 if (expr
== error_mark_node
)
5825 return error_mark_node
;
5827 /* [temp.arg.nontype] bullet 1 says the pointer to member
5828 expression must be a pointer-to-member constant. */
5829 if (!check_valid_ptrmem_cst_expr (type
, expr
, complain
))
5830 return error_mark_node
;
5832 /* There is no way to disable standard conversions in
5833 resolve_address_of_overloaded_function (called by
5834 instantiate_type). It is possible that the call succeeded by
5835 converting &B::I to &D::I (where B is a base of D), so we need
5836 to reject this conversion here.
5838 Actually, even if there was a way to disable standard conversions,
5839 it would still be better to reject them here so that we can
5840 provide a superior diagnostic. */
5841 if (!same_type_p (TREE_TYPE (expr
), type
))
5843 error ("%qE is not a valid template argument for type %qT "
5844 "because it is of type %qT", expr
, type
,
5846 /* If we are just one standard conversion off, explain. */
5847 if (can_convert (type
, TREE_TYPE (expr
), complain
))
5848 inform (input_location
,
5849 "standard conversions are not allowed in this context");
5853 /* [temp.arg.nontype]/5, bullet 7
5855 For a non-type template-parameter of type pointer to data member,
5856 qualification conversions (_conv.qual_) are applied. */
5857 else if (TYPE_PTRDATAMEM_P (type
))
5859 /* [temp.arg.nontype] bullet 1 says the pointer to member
5860 expression must be a pointer-to-member constant. */
5861 if (!check_valid_ptrmem_cst_expr (type
, expr
, complain
))
5862 return error_mark_node
;
5864 expr
= perform_qualification_conversions (type
, expr
);
5865 if (expr
== error_mark_node
)
5868 else if (NULLPTR_TYPE_P (type
))
5870 if (expr
!= nullptr_node
)
5872 error ("%qE is not a valid template argument for type %qT "
5873 "because it is of type %qT", expr
, type
, TREE_TYPE (expr
));
5878 /* A template non-type parameter must be one of the above. */
5882 /* Sanity check: did we actually convert the argument to the
5884 gcc_assert (same_type_ignoring_top_level_qualifiers_p
5885 (type
, TREE_TYPE (expr
)));
5889 /* Subroutine of coerce_template_template_parms, which returns 1 if
5890 PARM_PARM and ARG_PARM match using the rule for the template
5891 parameters of template template parameters. Both PARM and ARG are
5892 template parameters; the rest of the arguments are the same as for
5893 coerce_template_template_parms.
5896 coerce_template_template_parm (tree parm
,
5898 tsubst_flags_t complain
,
5902 if (arg
== NULL_TREE
|| arg
== error_mark_node
5903 || parm
== NULL_TREE
|| parm
== error_mark_node
)
5906 if (TREE_CODE (arg
) != TREE_CODE (parm
))
5909 switch (TREE_CODE (parm
))
5912 /* We encounter instantiations of templates like
5913 template <template <template <class> class> class TT>
5916 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
5917 tree argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
5919 if (!coerce_template_template_parms
5920 (parmparm
, argparm
, complain
, in_decl
, outer_args
))
5926 if (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (arg
))
5927 && !TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
)))
5928 /* Argument is a parameter pack but parameter is not. */
5933 /* The tsubst call is used to handle cases such as
5935 template <int> class C {};
5936 template <class T, template <T> class TT> class D {};
5939 i.e. the parameter list of TT depends on earlier parameters. */
5940 if (!uses_template_parms (TREE_TYPE (arg
))
5942 (tsubst (TREE_TYPE (parm
), outer_args
, complain
, in_decl
),
5946 if (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (arg
))
5947 && !TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))
5948 /* Argument is a parameter pack but parameter is not. */
5961 /* Return 1 if PARM_PARMS and ARG_PARMS matches using rule for
5962 template template parameters. Both PARM_PARMS and ARG_PARMS are
5963 vectors of TREE_LIST nodes containing TYPE_DECL, TEMPLATE_DECL
5966 Consider the example:
5967 template <class T> class A;
5968 template<template <class U> class TT> class B;
5970 For B<A>, PARM_PARMS are the parameters to TT, while ARG_PARMS are
5971 the parameters to A, and OUTER_ARGS contains A. */
5974 coerce_template_template_parms (tree parm_parms
,
5976 tsubst_flags_t complain
,
5980 int nparms
, nargs
, i
;
5984 gcc_assert (TREE_CODE (parm_parms
) == TREE_VEC
);
5985 gcc_assert (TREE_CODE (arg_parms
) == TREE_VEC
);
5987 nparms
= TREE_VEC_LENGTH (parm_parms
);
5988 nargs
= TREE_VEC_LENGTH (arg_parms
);
5990 /* Determine whether we have a parameter pack at the end of the
5991 template template parameter's template parameter list. */
5992 if (TREE_VEC_ELT (parm_parms
, nparms
- 1) != error_mark_node
)
5994 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, nparms
- 1));
5996 if (parm
== error_mark_node
)
5999 switch (TREE_CODE (parm
))
6003 if (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
)))
6008 if (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))
6018 && !(variadic_p
&& nargs
>= nparms
- 1))
6021 /* Check all of the template parameters except the parameter pack at
6022 the end (if any). */
6023 for (i
= 0; i
< nparms
- variadic_p
; ++i
)
6025 if (TREE_VEC_ELT (parm_parms
, i
) == error_mark_node
6026 || TREE_VEC_ELT (arg_parms
, i
) == error_mark_node
)
6029 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
6030 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
6032 if (!coerce_template_template_parm (parm
, arg
, complain
, in_decl
,
6040 /* Check each of the template parameters in the template
6041 argument against the template parameter pack at the end of
6042 the template template parameter. */
6043 if (TREE_VEC_ELT (parm_parms
, i
) == error_mark_node
)
6046 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
6048 for (; i
< nargs
; ++i
)
6050 if (TREE_VEC_ELT (arg_parms
, i
) == error_mark_node
)
6053 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
6055 if (!coerce_template_template_parm (parm
, arg
, complain
, in_decl
,
6064 /* Verifies that the deduced template arguments (in TARGS) for the
6065 template template parameters (in TPARMS) represent valid bindings,
6066 by comparing the template parameter list of each template argument
6067 to the template parameter list of its corresponding template
6068 template parameter, in accordance with DR150. This
6069 routine can only be called after all template arguments have been
6070 deduced. It will return TRUE if all of the template template
6071 parameter bindings are okay, FALSE otherwise. */
6073 template_template_parm_bindings_ok_p (tree tparms
, tree targs
)
6075 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
6078 /* We're dealing with template parms in this process. */
6079 ++processing_template_decl
;
6081 targs
= INNERMOST_TEMPLATE_ARGS (targs
);
6083 for (i
= 0; i
< ntparms
; ++i
)
6085 tree tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
6086 tree targ
= TREE_VEC_ELT (targs
, i
);
6088 if (TREE_CODE (tparm
) == TEMPLATE_DECL
&& targ
)
6090 tree packed_args
= NULL_TREE
;
6093 if (ARGUMENT_PACK_P (targ
))
6095 /* Look inside the argument pack. */
6096 packed_args
= ARGUMENT_PACK_ARGS (targ
);
6097 len
= TREE_VEC_LENGTH (packed_args
);
6100 for (idx
= 0; idx
< len
; ++idx
)
6102 tree targ_parms
= NULL_TREE
;
6105 /* Extract the next argument from the argument
6107 targ
= TREE_VEC_ELT (packed_args
, idx
);
6109 if (PACK_EXPANSION_P (targ
))
6110 /* Look at the pattern of the pack expansion. */
6111 targ
= PACK_EXPANSION_PATTERN (targ
);
6113 /* Extract the template parameters from the template
6115 if (TREE_CODE (targ
) == TEMPLATE_DECL
)
6116 targ_parms
= DECL_INNERMOST_TEMPLATE_PARMS (targ
);
6117 else if (TREE_CODE (targ
) == TEMPLATE_TEMPLATE_PARM
)
6118 targ_parms
= DECL_INNERMOST_TEMPLATE_PARMS (TYPE_NAME (targ
));
6120 /* Verify that we can coerce the template template
6121 parameters from the template argument to the template
6122 parameter. This requires an exact match. */
6124 && !coerce_template_template_parms
6125 (DECL_INNERMOST_TEMPLATE_PARMS (tparm
),
6140 --processing_template_decl
;
6144 /* Since type attributes aren't mangled, we need to strip them from
6145 template type arguments. */
6148 canonicalize_type_argument (tree arg
, tsubst_flags_t complain
)
6151 if (!arg
|| arg
== error_mark_node
|| arg
== TYPE_CANONICAL (arg
))
6153 mv
= TYPE_MAIN_VARIANT (arg
);
6154 arg
= strip_typedefs (arg
);
6155 if (TYPE_ALIGN (arg
) != TYPE_ALIGN (mv
)
6156 || TYPE_ATTRIBUTES (arg
) != TYPE_ATTRIBUTES (mv
))
6158 if (complain
& tf_warning
)
6159 warning (0, "ignoring attributes on template argument %qT", arg
);
6160 arg
= build_aligned_type (arg
, TYPE_ALIGN (mv
));
6161 arg
= cp_build_type_attribute_variant (arg
, TYPE_ATTRIBUTES (mv
));
6166 /* Convert the indicated template ARG as necessary to match the
6167 indicated template PARM. Returns the converted ARG, or
6168 error_mark_node if the conversion was unsuccessful. Error and
6169 warning messages are issued under control of COMPLAIN. This
6170 conversion is for the Ith parameter in the parameter list. ARGS is
6171 the full set of template arguments deduced so far. */
6174 convert_template_argument (tree parm
,
6177 tsubst_flags_t complain
,
6183 int is_type
, requires_type
, is_tmpl_type
, requires_tmpl_type
;
6185 if (TREE_CODE (arg
) == TREE_LIST
6186 && TREE_CODE (TREE_VALUE (arg
)) == OFFSET_REF
)
6188 /* The template argument was the name of some
6189 member function. That's usually
6190 invalid, but static members are OK. In any
6191 case, grab the underlying fields/functions
6192 and issue an error later if required. */
6193 orig_arg
= TREE_VALUE (arg
);
6194 TREE_TYPE (arg
) = unknown_type_node
;
6199 requires_tmpl_type
= TREE_CODE (parm
) == TEMPLATE_DECL
;
6200 requires_type
= (TREE_CODE (parm
) == TYPE_DECL
6201 || requires_tmpl_type
);
6203 /* When determining whether an argument pack expansion is a template,
6204 look at the pattern. */
6205 if (TREE_CODE (arg
) == TYPE_PACK_EXPANSION
)
6206 arg
= PACK_EXPANSION_PATTERN (arg
);
6208 /* Deal with an injected-class-name used as a template template arg. */
6209 if (requires_tmpl_type
&& CLASS_TYPE_P (arg
))
6211 tree t
= maybe_get_template_decl_from_type_decl (TYPE_NAME (arg
));
6212 if (TREE_CODE (t
) == TEMPLATE_DECL
)
6214 if (cxx_dialect
>= cxx0x
)
6215 /* OK under DR 1004. */;
6216 else if (complain
& tf_warning_or_error
)
6217 pedwarn (input_location
, OPT_Wpedantic
, "injected-class-name %qD"
6218 " used as template template argument", TYPE_NAME (arg
));
6219 else if (flag_pedantic_errors
)
6227 ((TREE_CODE (arg
) == TEMPLATE_DECL
6228 && TREE_CODE (DECL_TEMPLATE_RESULT (arg
)) == TYPE_DECL
)
6229 || (requires_tmpl_type
&& TREE_CODE (arg
) == TYPE_ARGUMENT_PACK
)
6230 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
6231 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
);
6234 && (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
6235 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
))
6236 arg
= TYPE_STUB_DECL (arg
);
6238 is_type
= TYPE_P (arg
) || is_tmpl_type
;
6240 if (requires_type
&& ! is_type
&& TREE_CODE (arg
) == SCOPE_REF
6241 && TREE_CODE (TREE_OPERAND (arg
, 0)) == TEMPLATE_TYPE_PARM
)
6243 if (TREE_CODE (TREE_OPERAND (arg
, 1)) == BIT_NOT_EXPR
)
6245 if (complain
& tf_error
)
6246 error ("invalid use of destructor %qE as a type", orig_arg
);
6247 return error_mark_node
;
6250 permerror (input_location
,
6251 "to refer to a type member of a template parameter, "
6252 "use %<typename %E%>", orig_arg
);
6254 orig_arg
= make_typename_type (TREE_OPERAND (arg
, 0),
6255 TREE_OPERAND (arg
, 1),
6261 if (is_type
!= requires_type
)
6265 if (complain
& tf_error
)
6267 error ("type/value mismatch at argument %d in template "
6268 "parameter list for %qD",
6271 error (" expected a constant of type %qT, got %qT",
6273 (DECL_P (arg
) ? DECL_NAME (arg
) : orig_arg
));
6274 else if (requires_tmpl_type
)
6275 error (" expected a class template, got %qE", orig_arg
);
6277 error (" expected a type, got %qE", orig_arg
);
6280 return error_mark_node
;
6282 if (is_tmpl_type
^ requires_tmpl_type
)
6284 if (in_decl
&& (complain
& tf_error
))
6286 error ("type/value mismatch at argument %d in template "
6287 "parameter list for %qD",
6290 error (" expected a type, got %qT", DECL_NAME (arg
));
6292 error (" expected a class template, got %qT", orig_arg
);
6294 return error_mark_node
;
6299 if (requires_tmpl_type
)
6301 if (template_parameter_pack_p (parm
) && ARGUMENT_PACK_P (orig_arg
))
6303 else if (TREE_CODE (TREE_TYPE (arg
)) == UNBOUND_CLASS_TEMPLATE
)
6304 /* The number of argument required is not known yet.
6305 Just accept it for now. */
6306 val
= TREE_TYPE (arg
);
6309 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
6312 argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
6314 if (coerce_template_template_parms (parmparm
, argparm
,
6320 /* TEMPLATE_TEMPLATE_PARM node is preferred over
6322 if (val
!= error_mark_node
)
6324 if (DECL_TEMPLATE_TEMPLATE_PARM_P (val
))
6325 val
= TREE_TYPE (val
);
6326 if (TREE_CODE (orig_arg
) == TYPE_PACK_EXPANSION
)
6327 val
= make_pack_expansion (val
);
6332 if (in_decl
&& (complain
& tf_error
))
6334 error ("type/value mismatch at argument %d in "
6335 "template parameter list for %qD",
6337 error (" expected a template of type %qD, got %qT",
6341 val
= error_mark_node
;
6347 /* We only form one instance of each template specialization.
6348 Therefore, if we use a non-canonical variant (i.e., a
6349 typedef), any future messages referring to the type will use
6350 the typedef, which is confusing if those future uses do not
6351 themselves also use the typedef. */
6353 val
= canonicalize_type_argument (val
, complain
);
6357 tree t
= tsubst (TREE_TYPE (parm
), args
, complain
, in_decl
);
6359 if (invalid_nontype_parm_type_p (t
, complain
))
6360 return error_mark_node
;
6362 if (template_parameter_pack_p (parm
) && ARGUMENT_PACK_P (orig_arg
))
6364 if (same_type_p (t
, TREE_TYPE (orig_arg
)))
6368 /* Not sure if this is reachable, but it doesn't hurt
6370 error ("type mismatch in nontype parameter pack");
6371 val
= error_mark_node
;
6374 else if (!uses_template_parms (orig_arg
) && !uses_template_parms (t
))
6375 /* We used to call digest_init here. However, digest_init
6376 will report errors, which we don't want when complain
6377 is zero. More importantly, digest_init will try too
6378 hard to convert things: for example, `0' should not be
6379 converted to pointer type at this point according to
6380 the standard. Accepting this is not merely an
6381 extension, since deciding whether or not these
6382 conversions can occur is part of determining which
6383 function template to call, or whether a given explicit
6384 argument specification is valid. */
6385 val
= convert_nontype_argument (t
, orig_arg
, complain
);
6387 val
= strip_typedefs_expr (orig_arg
);
6389 if (val
== NULL_TREE
)
6390 val
= error_mark_node
;
6391 else if (val
== error_mark_node
&& (complain
& tf_error
))
6392 error ("could not convert template argument %qE to %qT", orig_arg
, t
);
6394 if (TREE_CODE (val
) == SCOPE_REF
)
6396 /* Strip typedefs from the SCOPE_REF. */
6397 tree type
= canonicalize_type_argument (TREE_TYPE (val
), complain
);
6398 tree scope
= canonicalize_type_argument (TREE_OPERAND (val
, 0),
6400 val
= build_qualified_name (type
, scope
, TREE_OPERAND (val
, 1),
6401 QUALIFIED_NAME_IS_TEMPLATE (val
));
6408 /* Coerces the remaining template arguments in INNER_ARGS (from
6409 ARG_IDX to the end) into the parameter pack at PARM_IDX in PARMS.
6410 Returns the coerced argument pack. PARM_IDX is the position of this
6411 parameter in the template parameter list. ARGS is the original
6412 template argument list. */
6414 coerce_template_parameter_pack (tree parms
,
6422 tsubst_flags_t complain
)
6424 tree parm
= TREE_VEC_ELT (parms
, parm_idx
);
6425 int nargs
= inner_args
? NUM_TMPL_ARGS (inner_args
) : 0;
6428 tree packed_types
= NULL_TREE
;
6430 if (arg_idx
> nargs
)
6433 packed_args
= make_tree_vec (nargs
- arg_idx
);
6435 if (TREE_CODE (TREE_VALUE (parm
)) == PARM_DECL
6436 && uses_parameter_packs (TREE_TYPE (TREE_VALUE (parm
))))
6438 /* When the template parameter is a non-type template
6439 parameter pack whose type uses parameter packs, we need
6440 to look at each of the template arguments
6441 separately. Build a vector of the types for these
6442 non-type template parameters in PACKED_TYPES. */
6444 = make_pack_expansion (TREE_TYPE (TREE_VALUE (parm
)));
6445 packed_types
= tsubst_pack_expansion (expansion
, args
,
6448 if (packed_types
== error_mark_node
)
6449 return error_mark_node
;
6451 /* Check that we have the right number of arguments. */
6453 && !PACK_EXPANSION_P (TREE_VEC_ELT (inner_args
, arg_idx
))
6454 && nargs
- arg_idx
!= TREE_VEC_LENGTH (packed_types
))
6457 = TREE_VEC_LENGTH (parms
) - 1 + TREE_VEC_LENGTH (packed_types
);
6458 error ("wrong number of template arguments (%d, should be %d)",
6459 nargs
, needed_parms
);
6460 return error_mark_node
;
6463 /* If we aren't able to check the actual arguments now
6464 (because they haven't been expanded yet), we can at least
6465 verify that all of the types used for the non-type
6466 template parameter pack are, in fact, valid for non-type
6467 template parameters. */
6469 && PACK_EXPANSION_P (TREE_VEC_ELT (inner_args
, arg_idx
)))
6471 int j
, len
= TREE_VEC_LENGTH (packed_types
);
6472 for (j
= 0; j
< len
; ++j
)
6474 tree t
= TREE_VEC_ELT (packed_types
, j
);
6475 if (invalid_nontype_parm_type_p (t
, complain
))
6476 return error_mark_node
;
6481 /* Convert the remaining arguments, which will be a part of the
6482 parameter pack "parm". */
6483 for (; arg_idx
< nargs
; ++arg_idx
)
6485 tree arg
= TREE_VEC_ELT (inner_args
, arg_idx
);
6486 tree actual_parm
= TREE_VALUE (parm
);
6488 if (packed_types
&& !PACK_EXPANSION_P (arg
))
6490 /* When we have a vector of types (corresponding to the
6491 non-type template parameter pack that uses parameter
6492 packs in its type, as mention above), and the
6493 argument is not an expansion (which expands to a
6494 currently unknown number of arguments), clone the
6495 parm and give it the next type in PACKED_TYPES. */
6496 actual_parm
= copy_node (actual_parm
);
6497 TREE_TYPE (actual_parm
) =
6498 TREE_VEC_ELT (packed_types
, arg_idx
- parm_idx
);
6501 if (arg
== error_mark_node
)
6503 if (complain
& tf_error
)
6504 error ("template argument %d is invalid", arg_idx
+ 1);
6507 arg
= convert_template_argument (actual_parm
,
6508 arg
, new_args
, complain
, parm_idx
,
6510 if (arg
== error_mark_node
)
6512 TREE_VEC_ELT (packed_args
, arg_idx
- parm_idx
) = arg
;
6515 if (TREE_CODE (TREE_VALUE (parm
)) == TYPE_DECL
6516 || TREE_CODE (TREE_VALUE (parm
)) == TEMPLATE_DECL
)
6517 argument_pack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
6520 argument_pack
= make_node (NONTYPE_ARGUMENT_PACK
);
6521 TREE_TYPE (argument_pack
)
6522 = tsubst (TREE_TYPE (TREE_VALUE (parm
)), new_args
, complain
, in_decl
);
6523 TREE_CONSTANT (argument_pack
) = 1;
6526 SET_ARGUMENT_PACK_ARGS (argument_pack
, packed_args
);
6527 #ifdef ENABLE_CHECKING
6528 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (packed_args
,
6529 TREE_VEC_LENGTH (packed_args
));
6531 return argument_pack
;
6534 /* Returns true if the template argument vector ARGS contains
6535 any pack expansions, false otherwise. */
6538 any_pack_expanson_args_p (tree args
)
6542 for (i
= 0; i
< TREE_VEC_LENGTH (args
); ++i
)
6543 if (PACK_EXPANSION_P (TREE_VEC_ELT (args
, i
)))
6548 /* Convert all template arguments to their appropriate types, and
6549 return a vector containing the innermost resulting template
6550 arguments. If any error occurs, return error_mark_node. Error and
6551 warning messages are issued under control of COMPLAIN.
6553 If REQUIRE_ALL_ARGS is false, argument deduction will be performed
6554 for arguments not specified in ARGS. Otherwise, if
6555 USE_DEFAULT_ARGS is true, default arguments will be used to fill in
6556 unspecified arguments. If REQUIRE_ALL_ARGS is true, but
6557 USE_DEFAULT_ARGS is false, then all arguments must be specified in
6561 coerce_template_parms (tree parms
,
6564 tsubst_flags_t complain
,
6565 bool require_all_args
,
6566 bool use_default_args
)
6568 int nparms
, nargs
, parm_idx
, arg_idx
, lost
= 0;
6571 tree new_inner_args
;
6572 int saved_unevaluated_operand
;
6573 int saved_inhibit_evaluation_warnings
;
6575 /* When used as a boolean value, indicates whether this is a
6576 variadic template parameter list. Since it's an int, we can also
6577 subtract it from nparms to get the number of non-variadic
6580 int post_variadic_parms
= 0;
6582 if (args
== error_mark_node
)
6583 return error_mark_node
;
6585 nparms
= TREE_VEC_LENGTH (parms
);
6587 /* Determine if there are any parameter packs. */
6588 for (parm_idx
= 0; parm_idx
< nparms
; ++parm_idx
)
6590 tree tparm
= TREE_VALUE (TREE_VEC_ELT (parms
, parm_idx
));
6592 ++post_variadic_parms
;
6593 if (template_parameter_pack_p (tparm
))
6597 inner_args
= INNERMOST_TEMPLATE_ARGS (args
);
6598 /* If there are no parameters that follow a parameter pack, we need to
6599 expand any argument packs so that we can deduce a parameter pack from
6600 some non-packed args followed by an argument pack, as in variadic85.C.
6601 If there are such parameters, we need to leave argument packs intact
6602 so the arguments are assigned properly. This can happen when dealing
6603 with a nested class inside a partial specialization of a class
6604 template, as in variadic92.C, or when deducing a template parameter pack
6605 from a sub-declarator, as in variadic114.C. */
6606 if (!post_variadic_parms
)
6607 inner_args
= expand_template_argument_pack (inner_args
);
6609 nargs
= inner_args
? NUM_TMPL_ARGS (inner_args
) : 0;
6610 if ((nargs
> nparms
&& !variadic_p
)
6611 || (nargs
< nparms
- variadic_p
6613 && !any_pack_expanson_args_p (inner_args
)
6614 && (!use_default_args
6615 || (TREE_VEC_ELT (parms
, nargs
) != error_mark_node
6616 && !TREE_PURPOSE (TREE_VEC_ELT (parms
, nargs
))))))
6618 if (complain
& tf_error
)
6622 nparms
-= variadic_p
;
6623 error ("wrong number of template arguments "
6624 "(%d, should be %d or more)", nargs
, nparms
);
6627 error ("wrong number of template arguments "
6628 "(%d, should be %d)", nargs
, nparms
);
6631 error ("provided for %q+D", in_decl
);
6634 return error_mark_node
;
6637 /* We need to evaluate the template arguments, even though this
6638 template-id may be nested within a "sizeof". */
6639 saved_unevaluated_operand
= cp_unevaluated_operand
;
6640 cp_unevaluated_operand
= 0;
6641 saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
6642 c_inhibit_evaluation_warnings
= 0;
6643 new_inner_args
= make_tree_vec (nparms
);
6644 new_args
= add_outermost_template_args (args
, new_inner_args
);
6645 for (parm_idx
= 0, arg_idx
= 0; parm_idx
< nparms
; parm_idx
++, arg_idx
++)
6650 /* Get the Ith template parameter. */
6651 parm
= TREE_VEC_ELT (parms
, parm_idx
);
6653 if (parm
== error_mark_node
)
6655 TREE_VEC_ELT (new_inner_args
, arg_idx
) = error_mark_node
;
6659 /* Calculate the next argument. */
6660 if (arg_idx
< nargs
)
6661 arg
= TREE_VEC_ELT (inner_args
, arg_idx
);
6665 if (template_parameter_pack_p (TREE_VALUE (parm
))
6666 && !(arg
&& ARGUMENT_PACK_P (arg
)))
6668 /* All remaining arguments will be placed in the
6669 template parameter pack PARM. */
6670 arg
= coerce_template_parameter_pack (parms
, parm_idx
, args
,
6671 inner_args
, arg_idx
,
6675 /* Store this argument. */
6676 if (arg
== error_mark_node
)
6678 TREE_VEC_ELT (new_inner_args
, parm_idx
) = arg
;
6680 /* We are done with all of the arguments. */
6687 if (PACK_EXPANSION_P (arg
))
6689 /* We don't know how many args we have yet, just
6690 use the unconverted ones for now. */
6691 new_inner_args
= inner_args
;
6695 else if (require_all_args
)
6697 /* There must be a default arg in this case. */
6698 arg
= tsubst_template_arg (TREE_PURPOSE (parm
), new_args
,
6700 /* The position of the first default template argument,
6701 is also the number of non-defaulted arguments in NEW_INNER_ARGS.
6703 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
))
6704 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
, arg_idx
);
6709 if (arg
== error_mark_node
)
6711 if (complain
& tf_error
)
6712 error ("template argument %d is invalid", arg_idx
+ 1);
6715 /* This only occurs if there was an error in the template
6716 parameter list itself (which we would already have
6717 reported) that we are trying to recover from, e.g., a class
6718 template with a parameter list such as
6719 template<typename..., typename>. */
6722 arg
= convert_template_argument (TREE_VALUE (parm
),
6723 arg
, new_args
, complain
,
6726 if (arg
== error_mark_node
)
6728 TREE_VEC_ELT (new_inner_args
, arg_idx
) = arg
;
6730 cp_unevaluated_operand
= saved_unevaluated_operand
;
6731 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
6734 return error_mark_node
;
6736 #ifdef ENABLE_CHECKING
6737 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
))
6738 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
,
6739 TREE_VEC_LENGTH (new_inner_args
));
6742 return new_inner_args
;
6745 /* Like coerce_template_parms. If PARMS represents all template
6746 parameters levels, this function returns a vector of vectors
6747 representing all the resulting argument levels. Note that in this
6748 case, only the innermost arguments are coerced because the
6749 outermost ones are supposed to have been coerced already.
6751 Otherwise, if PARMS represents only (the innermost) vector of
6752 parameters, this function returns a vector containing just the
6753 innermost resulting arguments. */
6756 coerce_innermost_template_parms (tree parms
,
6759 tsubst_flags_t complain
,
6760 bool require_all_args
,
6761 bool use_default_args
)
6763 int parms_depth
= TMPL_PARMS_DEPTH (parms
);
6764 int args_depth
= TMPL_ARGS_DEPTH (args
);
6767 if (parms_depth
> 1)
6769 coerced_args
= make_tree_vec (parms_depth
);
6773 for (level
= parms
, cur_depth
= parms_depth
;
6774 parms_depth
> 0 && level
!= NULL_TREE
;
6775 level
= TREE_CHAIN (level
), --cur_depth
)
6778 if (cur_depth
== args_depth
)
6779 l
= coerce_template_parms (TREE_VALUE (level
),
6780 args
, in_decl
, complain
,
6784 l
= TMPL_ARGS_LEVEL (args
, cur_depth
);
6786 if (l
== error_mark_node
)
6787 return error_mark_node
;
6789 SET_TMPL_ARGS_LEVEL (coerced_args
, cur_depth
, l
);
6793 coerced_args
= coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parms
),
6794 args
, in_decl
, complain
,
6797 return coerced_args
;
6800 /* Returns 1 if template args OT and NT are equivalent. */
6803 template_args_equal (tree ot
, tree nt
)
6807 if (nt
== NULL_TREE
|| ot
== NULL_TREE
)
6810 if (TREE_CODE (nt
) == TREE_VEC
)
6811 /* For member templates */
6812 return TREE_CODE (ot
) == TREE_VEC
&& comp_template_args (ot
, nt
);
6813 else if (PACK_EXPANSION_P (ot
))
6814 return (PACK_EXPANSION_P (nt
)
6815 && template_args_equal (PACK_EXPANSION_PATTERN (ot
),
6816 PACK_EXPANSION_PATTERN (nt
))
6817 && template_args_equal (PACK_EXPANSION_EXTRA_ARGS (ot
),
6818 PACK_EXPANSION_EXTRA_ARGS (nt
)));
6819 else if (ARGUMENT_PACK_P (ot
))
6824 if (!ARGUMENT_PACK_P (nt
))
6827 opack
= ARGUMENT_PACK_ARGS (ot
);
6828 npack
= ARGUMENT_PACK_ARGS (nt
);
6829 len
= TREE_VEC_LENGTH (opack
);
6830 if (TREE_VEC_LENGTH (npack
) != len
)
6832 for (i
= 0; i
< len
; ++i
)
6833 if (!template_args_equal (TREE_VEC_ELT (opack
, i
),
6834 TREE_VEC_ELT (npack
, i
)))
6838 else if (ot
&& TREE_CODE (ot
) == ARGUMENT_PACK_SELECT
)
6840 /* We get here probably because we are in the middle of substituting
6841 into the pattern of a pack expansion. In that case the
6842 ARGUMENT_PACK_SELECT temporarily replaces the pack argument we are
6843 interested in. So we want to use the initial pack argument for
6845 ot
= ARGUMENT_PACK_SELECT_FROM_PACK (ot
);
6846 if (nt
&& TREE_CODE (nt
) == ARGUMENT_PACK_SELECT
)
6847 nt
= ARGUMENT_PACK_SELECT_FROM_PACK (nt
);
6848 return template_args_equal (ot
, nt
);
6850 else if (TYPE_P (nt
))
6851 return TYPE_P (ot
) && same_type_p (ot
, nt
);
6852 else if (TREE_CODE (ot
) == TREE_VEC
|| TYPE_P (ot
))
6855 return cp_tree_equal (ot
, nt
);
6858 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets of
6859 template arguments. Returns 0 otherwise, and updates OLDARG_PTR and
6860 NEWARG_PTR with the offending arguments if they are non-NULL. */
6863 comp_template_args_with_info (tree oldargs
, tree newargs
,
6864 tree
*oldarg_ptr
, tree
*newarg_ptr
)
6868 if (oldargs
== newargs
)
6871 if (!oldargs
|| !newargs
)
6874 if (TREE_VEC_LENGTH (oldargs
) != TREE_VEC_LENGTH (newargs
))
6877 for (i
= 0; i
< TREE_VEC_LENGTH (oldargs
); ++i
)
6879 tree nt
= TREE_VEC_ELT (newargs
, i
);
6880 tree ot
= TREE_VEC_ELT (oldargs
, i
);
6882 if (! template_args_equal (ot
, nt
))
6884 if (oldarg_ptr
!= NULL
)
6886 if (newarg_ptr
!= NULL
)
6894 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets
6895 of template arguments. Returns 0 otherwise. */
6898 comp_template_args (tree oldargs
, tree newargs
)
6900 return comp_template_args_with_info (oldargs
, newargs
, NULL
, NULL
);
6904 add_pending_template (tree d
)
6906 tree ti
= (TYPE_P (d
)
6907 ? CLASSTYPE_TEMPLATE_INFO (d
)
6908 : DECL_TEMPLATE_INFO (d
));
6909 struct pending_template
*pt
;
6912 if (TI_PENDING_TEMPLATE_FLAG (ti
))
6915 /* We are called both from instantiate_decl, where we've already had a
6916 tinst_level pushed, and instantiate_template, where we haven't.
6918 level
= !current_tinst_level
|| current_tinst_level
->decl
!= d
;
6921 push_tinst_level (d
);
6923 pt
= ggc_alloc_pending_template ();
6925 pt
->tinst
= current_tinst_level
;
6926 if (last_pending_template
)
6927 last_pending_template
->next
= pt
;
6929 pending_templates
= pt
;
6931 last_pending_template
= pt
;
6933 TI_PENDING_TEMPLATE_FLAG (ti
) = 1;
6940 /* Return a TEMPLATE_ID_EXPR corresponding to the indicated FNS and
6941 ARGLIST. Valid choices for FNS are given in the cp-tree.def
6942 documentation for TEMPLATE_ID_EXPR. */
6945 lookup_template_function (tree fns
, tree arglist
)
6949 if (fns
== error_mark_node
|| arglist
== error_mark_node
)
6950 return error_mark_node
;
6952 gcc_assert (!arglist
|| TREE_CODE (arglist
) == TREE_VEC
);
6954 if (!is_overloaded_fn (fns
) && !identifier_p (fns
))
6956 error ("%q#D is not a function template", fns
);
6957 return error_mark_node
;
6960 if (BASELINK_P (fns
))
6962 BASELINK_FUNCTIONS (fns
) = build2 (TEMPLATE_ID_EXPR
,
6964 BASELINK_FUNCTIONS (fns
),
6969 type
= TREE_TYPE (fns
);
6970 if (TREE_CODE (fns
) == OVERLOAD
|| !type
)
6971 type
= unknown_type_node
;
6973 return build2 (TEMPLATE_ID_EXPR
, type
, fns
, arglist
);
6976 /* Within the scope of a template class S<T>, the name S gets bound
6977 (in build_self_reference) to a TYPE_DECL for the class, not a
6978 TEMPLATE_DECL. If DECL is a TYPE_DECL for current_class_type,
6979 or one of its enclosing classes, and that type is a template,
6980 return the associated TEMPLATE_DECL. Otherwise, the original
6983 Also handle the case when DECL is a TREE_LIST of ambiguous
6984 injected-class-names from different bases. */
6987 maybe_get_template_decl_from_type_decl (tree decl
)
6989 if (decl
== NULL_TREE
)
6992 /* DR 176: A lookup that finds an injected-class-name (10.2
6993 [class.member.lookup]) can result in an ambiguity in certain cases
6994 (for example, if it is found in more than one base class). If all of
6995 the injected-class-names that are found refer to specializations of
6996 the same class template, and if the name is followed by a
6997 template-argument-list, the reference refers to the class template
6998 itself and not a specialization thereof, and is not ambiguous. */
6999 if (TREE_CODE (decl
) == TREE_LIST
)
7001 tree t
, tmpl
= NULL_TREE
;
7002 for (t
= decl
; t
; t
= TREE_CHAIN (t
))
7004 tree elt
= maybe_get_template_decl_from_type_decl (TREE_VALUE (t
));
7007 else if (tmpl
!= elt
)
7010 if (tmpl
&& t
== NULL_TREE
)
7016 return (decl
!= NULL_TREE
7017 && DECL_SELF_REFERENCE_P (decl
)
7018 && CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (decl
)))
7019 ? CLASSTYPE_TI_TEMPLATE (TREE_TYPE (decl
)) : decl
;
7022 /* Given an IDENTIFIER_NODE (type TEMPLATE_DECL) and a chain of
7023 parameters, find the desired type.
7025 D1 is the PTYPENAME terminal, and ARGLIST is the list of arguments.
7027 IN_DECL, if non-NULL, is the template declaration we are trying to
7030 If ENTERING_SCOPE is nonzero, we are about to enter the scope of
7031 the class we are looking up.
7033 Issue error and warning messages under control of COMPLAIN.
7035 If the template class is really a local class in a template
7036 function, then the FUNCTION_CONTEXT is the function in which it is
7039 ??? Note that this function is currently called *twice* for each
7040 template-id: the first time from the parser, while creating the
7041 incomplete type (finish_template_type), and the second type during the
7042 real instantiation (instantiate_template_class). This is surely something
7043 that we want to avoid. It also causes some problems with argument
7044 coercion (see convert_nontype_argument for more information on this). */
7047 lookup_template_class_1 (tree d1
, tree arglist
, tree in_decl
, tree context
,
7048 int entering_scope
, tsubst_flags_t complain
)
7050 tree templ
= NULL_TREE
, parmlist
;
7057 if (identifier_p (d1
))
7059 tree value
= innermost_non_namespace_value (d1
);
7060 if (value
&& DECL_TEMPLATE_TEMPLATE_PARM_P (value
))
7065 push_decl_namespace (context
);
7066 templ
= lookup_name (d1
);
7067 templ
= maybe_get_template_decl_from_type_decl (templ
);
7069 pop_decl_namespace ();
7072 context
= DECL_CONTEXT (templ
);
7074 else if (TREE_CODE (d1
) == TYPE_DECL
&& MAYBE_CLASS_TYPE_P (TREE_TYPE (d1
)))
7076 tree type
= TREE_TYPE (d1
);
7078 /* If we are declaring a constructor, say A<T>::A<T>, we will get
7079 an implicit typename for the second A. Deal with it. */
7080 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
7081 type
= TREE_TYPE (type
);
7083 if (CLASSTYPE_TEMPLATE_INFO (type
))
7085 templ
= CLASSTYPE_TI_TEMPLATE (type
);
7086 d1
= DECL_NAME (templ
);
7089 else if (TREE_CODE (d1
) == ENUMERAL_TYPE
7090 || (TYPE_P (d1
) && MAYBE_CLASS_TYPE_P (d1
)))
7092 templ
= TYPE_TI_TEMPLATE (d1
);
7093 d1
= DECL_NAME (templ
);
7095 else if (TREE_CODE (d1
) == TEMPLATE_DECL
7096 && DECL_TEMPLATE_RESULT (d1
)
7097 && TREE_CODE (DECL_TEMPLATE_RESULT (d1
)) == TYPE_DECL
)
7100 d1
= DECL_NAME (templ
);
7101 context
= DECL_CONTEXT (templ
);
7104 /* Issue an error message if we didn't find a template. */
7107 if (complain
& tf_error
)
7108 error ("%qT is not a template", d1
);
7109 return error_mark_node
;
7112 if (TREE_CODE (templ
) != TEMPLATE_DECL
7113 /* Make sure it's a user visible template, if it was named by
7115 || ((complain
& tf_user
) && !DECL_TEMPLATE_PARM_P (templ
)
7116 && !PRIMARY_TEMPLATE_P (templ
)))
7118 if (complain
& tf_error
)
7120 error ("non-template type %qT used as a template", d1
);
7122 error ("for template declaration %q+D", in_decl
);
7124 return error_mark_node
;
7127 complain
&= ~tf_user
;
7129 if (DECL_TEMPLATE_TEMPLATE_PARM_P (templ
))
7131 /* Create a new TEMPLATE_DECL and TEMPLATE_TEMPLATE_PARM node to store
7132 template arguments */
7138 parmlist
= DECL_INNERMOST_TEMPLATE_PARMS (templ
);
7140 /* Consider an example where a template template parameter declared as
7142 template <class T, class U = std::allocator<T> > class TT
7144 The template parameter level of T and U are one level larger than
7145 of TT. To proper process the default argument of U, say when an
7146 instantiation `TT<int>' is seen, we need to build the full
7147 arguments containing {int} as the innermost level. Outer levels,
7148 available when not appearing as default template argument, can be
7149 obtained from the arguments of the enclosing template.
7151 Suppose that TT is later substituted with std::vector. The above
7152 instantiation is `TT<int, std::allocator<T> >' with TT at
7153 level 1, and T at level 2, while the template arguments at level 1
7154 becomes {std::vector} and the inner level 2 is {int}. */
7156 outer
= DECL_CONTEXT (templ
);
7158 outer
= TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (outer
)));
7159 else if (current_template_parms
)
7160 /* This is an argument of the current template, so we haven't set
7161 DECL_CONTEXT yet. */
7162 outer
= current_template_args ();
7165 arglist
= add_to_template_args (outer
, arglist
);
7167 arglist2
= coerce_template_parms (parmlist
, arglist
, templ
,
7169 /*require_all_args=*/true,
7170 /*use_default_args=*/true);
7171 if (arglist2
== error_mark_node
7172 || (!uses_template_parms (arglist2
)
7173 && check_instantiated_args (templ
, arglist2
, complain
)))
7174 return error_mark_node
;
7176 parm
= bind_template_template_parm (TREE_TYPE (templ
), arglist2
);
7181 tree template_type
= TREE_TYPE (templ
);
7184 tree found
= NULL_TREE
;
7187 int is_dependent_type
;
7188 int use_partial_inst_tmpl
= false;
7190 if (template_type
== error_mark_node
)
7191 /* An error occured while building the template TEMPL, and a
7192 diagnostic has most certainly been emitted for that
7193 already. Let's propagate that error. */
7194 return error_mark_node
;
7196 gen_tmpl
= most_general_template (templ
);
7197 parmlist
= DECL_TEMPLATE_PARMS (gen_tmpl
);
7198 parm_depth
= TMPL_PARMS_DEPTH (parmlist
);
7199 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
7201 if (arg_depth
== 1 && parm_depth
> 1)
7203 /* We've been given an incomplete set of template arguments.
7206 template <class T> struct S1 {
7207 template <class U> struct S2 {};
7208 template <class U> struct S2<U*> {};
7211 we will be called with an ARGLIST of `U*', but the
7212 TEMPLATE will be `template <class T> template
7213 <class U> struct S1<T>::S2'. We must fill in the missing
7216 = add_outermost_template_args (TYPE_TI_ARGS (TREE_TYPE (templ
)),
7218 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
7221 /* Now we should have enough arguments. */
7222 gcc_assert (parm_depth
== arg_depth
);
7224 /* From here on, we're only interested in the most general
7227 /* Calculate the BOUND_ARGS. These will be the args that are
7228 actually tsubst'd into the definition to create the
7232 /* We have multiple levels of arguments to coerce, at once. */
7234 int saved_depth
= TMPL_ARGS_DEPTH (arglist
);
7236 tree bound_args
= make_tree_vec (parm_depth
);
7238 for (i
= saved_depth
,
7239 t
= DECL_TEMPLATE_PARMS (gen_tmpl
);
7240 i
> 0 && t
!= NULL_TREE
;
7241 --i
, t
= TREE_CHAIN (t
))
7244 if (i
== saved_depth
)
7245 a
= coerce_template_parms (TREE_VALUE (t
),
7248 /*require_all_args=*/true,
7249 /*use_default_args=*/true);
7251 /* Outer levels should have already been coerced. */
7252 a
= TMPL_ARGS_LEVEL (arglist
, i
);
7254 /* Don't process further if one of the levels fails. */
7255 if (a
== error_mark_node
)
7257 /* Restore the ARGLIST to its full size. */
7258 TREE_VEC_LENGTH (arglist
) = saved_depth
;
7259 return error_mark_node
;
7262 SET_TMPL_ARGS_LEVEL (bound_args
, i
, a
);
7264 /* We temporarily reduce the length of the ARGLIST so
7265 that coerce_template_parms will see only the arguments
7266 corresponding to the template parameters it is
7268 TREE_VEC_LENGTH (arglist
)--;
7271 /* Restore the ARGLIST to its full size. */
7272 TREE_VEC_LENGTH (arglist
) = saved_depth
;
7274 arglist
= bound_args
;
7278 = coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parmlist
),
7279 INNERMOST_TEMPLATE_ARGS (arglist
),
7282 /*require_all_args=*/true,
7283 /*use_default_args=*/true);
7285 if (arglist
== error_mark_node
)
7286 /* We were unable to bind the arguments. */
7287 return error_mark_node
;
7289 /* In the scope of a template class, explicit references to the
7290 template class refer to the type of the template, not any
7291 instantiation of it. For example, in:
7293 template <class T> class C { void f(C<T>); }
7295 the `C<T>' is just the same as `C'. Outside of the
7296 class, however, such a reference is an instantiation. */
7298 || !PRIMARY_TEMPLATE_P (gen_tmpl
)
7299 || currently_open_class (template_type
))
7300 /* comp_template_args is expensive, check it last. */
7301 && comp_template_args (TYPE_TI_ARGS (template_type
),
7303 return template_type
;
7305 /* If we already have this specialization, return it. */
7306 elt
.tmpl
= gen_tmpl
;
7308 hash
= hash_specialization (&elt
);
7309 entry
= (spec_entry
*) htab_find_with_hash (type_specializations
,
7315 is_dependent_type
= uses_template_parms (arglist
);
7317 /* If the deduced arguments are invalid, then the binding
7319 if (!is_dependent_type
7320 && check_instantiated_args (gen_tmpl
,
7321 INNERMOST_TEMPLATE_ARGS (arglist
),
7323 return error_mark_node
;
7325 if (!is_dependent_type
7326 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
7327 && !LAMBDA_TYPE_P (TREE_TYPE (gen_tmpl
))
7328 && TREE_CODE (CP_DECL_CONTEXT (gen_tmpl
)) == NAMESPACE_DECL
)
7330 found
= xref_tag_from_type (TREE_TYPE (gen_tmpl
),
7331 DECL_NAME (gen_tmpl
),
7332 /*tag_scope=*/ts_global
);
7336 context
= tsubst (DECL_CONTEXT (gen_tmpl
), arglist
,
7338 if (context
== error_mark_node
)
7339 return error_mark_node
;
7342 context
= global_namespace
;
7344 /* Create the type. */
7345 if (TREE_CODE (template_type
) == ENUMERAL_TYPE
)
7347 if (!is_dependent_type
)
7349 set_current_access_from_decl (TYPE_NAME (template_type
));
7350 t
= start_enum (TYPE_IDENTIFIER (template_type
), NULL_TREE
,
7351 tsubst (ENUM_UNDERLYING_TYPE (template_type
),
7352 arglist
, complain
, in_decl
),
7353 SCOPED_ENUM_P (template_type
), NULL
);
7357 /* We don't want to call start_enum for this type, since
7358 the values for the enumeration constants may involve
7359 template parameters. And, no one should be interested
7360 in the enumeration constants for such a type. */
7361 t
= cxx_make_type (ENUMERAL_TYPE
);
7362 SET_SCOPED_ENUM_P (t
, SCOPED_ENUM_P (template_type
));
7364 SET_OPAQUE_ENUM_P (t
, OPAQUE_ENUM_P (template_type
));
7365 ENUM_FIXED_UNDERLYING_TYPE_P (t
)
7366 = ENUM_FIXED_UNDERLYING_TYPE_P (template_type
);
7368 else if (DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
7370 /* The user referred to a specialization of an alias
7371 template represented by GEN_TMPL.
7373 [temp.alias]/2 says:
7375 When a template-id refers to the specialization of an
7376 alias template, it is equivalent to the associated
7377 type obtained by substitution of its
7378 template-arguments for the template-parameters in the
7379 type-id of the alias template. */
7381 t
= tsubst (TREE_TYPE (gen_tmpl
), arglist
, complain
, in_decl
);
7382 /* Note that the call above (by indirectly calling
7383 register_specialization in tsubst_decl) registers the
7384 TYPE_DECL representing the specialization of the alias
7385 template. So next time someone substitutes ARGLIST for
7386 the template parms into the alias template (GEN_TMPL),
7387 she'll get that TYPE_DECL back. */
7389 if (t
== error_mark_node
)
7392 else if (CLASS_TYPE_P (template_type
))
7394 t
= make_class_type (TREE_CODE (template_type
));
7395 CLASSTYPE_DECLARED_CLASS (t
)
7396 = CLASSTYPE_DECLARED_CLASS (template_type
);
7397 SET_CLASSTYPE_IMPLICIT_INSTANTIATION (t
);
7398 TYPE_FOR_JAVA (t
) = TYPE_FOR_JAVA (template_type
);
7400 /* A local class. Make sure the decl gets registered properly. */
7401 if (context
== current_function_decl
)
7402 pushtag (DECL_NAME (gen_tmpl
), t
, /*tag_scope=*/ts_current
);
7404 if (comp_template_args (CLASSTYPE_TI_ARGS (template_type
), arglist
))
7405 /* This instantiation is another name for the primary
7406 template type. Set the TYPE_CANONICAL field
7408 TYPE_CANONICAL (t
) = template_type
;
7409 else if (any_template_arguments_need_structural_equality_p (arglist
))
7410 /* Some of the template arguments require structural
7411 equality testing, so this template class requires
7412 structural equality testing. */
7413 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7418 /* If we called start_enum or pushtag above, this information
7419 will already be set up. */
7422 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
7424 type_decl
= create_implicit_typedef (DECL_NAME (gen_tmpl
), t
);
7425 DECL_CONTEXT (type_decl
) = TYPE_CONTEXT (t
);
7426 DECL_SOURCE_LOCATION (type_decl
)
7427 = DECL_SOURCE_LOCATION (TYPE_STUB_DECL (template_type
));
7430 type_decl
= TYPE_NAME (t
);
7432 if (CLASS_TYPE_P (template_type
))
7434 TREE_PRIVATE (type_decl
)
7435 = TREE_PRIVATE (TYPE_MAIN_DECL (template_type
));
7436 TREE_PROTECTED (type_decl
)
7437 = TREE_PROTECTED (TYPE_MAIN_DECL (template_type
));
7438 if (CLASSTYPE_VISIBILITY_SPECIFIED (template_type
))
7440 DECL_VISIBILITY_SPECIFIED (type_decl
) = 1;
7441 DECL_VISIBILITY (type_decl
) = CLASSTYPE_VISIBILITY (template_type
);
7445 /* Let's consider the explicit specialization of a member
7446 of a class template specialization that is implicitely instantiated,
7451 template<class U> struct M {}; //#0
7456 struct S<int>::M<char> //#1
7460 [temp.expl.spec]/4 says this is valid.
7462 In this case, when we write:
7465 M is instantiated from the CLASSTYPE_TI_TEMPLATE of #1, not from
7468 When we encounter #1, we want to store the partial instantiation
7469 of M (template<class T> S<int>::M<T>) in it's CLASSTYPE_TI_TEMPLATE.
7471 For all cases other than this "explicit specialization of member of a
7472 class template", we just want to store the most general template into
7473 the CLASSTYPE_TI_TEMPLATE of M.
7475 This case of "explicit specialization of member of a class template"
7477 1/ the enclosing class is an instantiation of, and therefore not
7478 the same as, the context of the most general template, and
7479 2/ we aren't looking at the partial instantiation itself, i.e.
7480 the innermost arguments are not the same as the innermost parms of
7481 the most general template.
7483 So it's only when 1/ and 2/ happens that we want to use the partial
7484 instantiation of the member template in lieu of its most general
7487 if (PRIMARY_TEMPLATE_P (gen_tmpl
)
7488 && TMPL_ARGS_HAVE_MULTIPLE_LEVELS (arglist
)
7489 /* the enclosing class must be an instantiation... */
7490 && CLASS_TYPE_P (context
)
7491 && !same_type_p (context
, DECL_CONTEXT (gen_tmpl
)))
7493 tree partial_inst_args
;
7494 TREE_VEC_LENGTH (arglist
)--;
7495 ++processing_template_decl
;
7497 tsubst (INNERMOST_TEMPLATE_ARGS
7498 (TYPE_TI_ARGS (TREE_TYPE (gen_tmpl
))),
7499 arglist
, complain
, NULL_TREE
);
7500 --processing_template_decl
;
7501 TREE_VEC_LENGTH (arglist
)++;
7502 use_partial_inst_tmpl
=
7503 /*...and we must not be looking at the partial instantiation
7505 !comp_template_args (INNERMOST_TEMPLATE_ARGS (arglist
),
7509 if (!use_partial_inst_tmpl
)
7510 /* This case is easy; there are no member templates involved. */
7514 /* This is a full instantiation of a member template. Find
7515 the partial instantiation of which this is an instance. */
7517 /* Temporarily reduce by one the number of levels in the ARGLIST
7518 so as to avoid comparing the last set of arguments. */
7519 TREE_VEC_LENGTH (arglist
)--;
7520 found
= tsubst (gen_tmpl
, arglist
, complain
, NULL_TREE
);
7521 TREE_VEC_LENGTH (arglist
)++;
7522 /* FOUND is either a proper class type, or an alias
7523 template specialization. In the later case, it's a
7524 TYPE_DECL, resulting from the substituting of arguments
7525 for parameters in the TYPE_DECL of the alias template
7526 done earlier. So be careful while getting the template
7528 found
= TREE_CODE (found
) == TYPE_DECL
7529 ? TYPE_TI_TEMPLATE (TREE_TYPE (found
))
7530 : CLASSTYPE_TI_TEMPLATE (found
);
7533 SET_TYPE_TEMPLATE_INFO (t
, build_template_info (found
, arglist
));
7536 slot
= htab_find_slot_with_hash (type_specializations
,
7537 &elt
, hash
, INSERT
);
7538 entry
= ggc_alloc_spec_entry ();
7542 /* Note this use of the partial instantiation so we can check it
7543 later in maybe_process_partial_specialization. */
7544 DECL_TEMPLATE_INSTANTIATIONS (templ
)
7545 = tree_cons (arglist
, t
,
7546 DECL_TEMPLATE_INSTANTIATIONS (templ
));
7548 if (TREE_CODE (template_type
) == ENUMERAL_TYPE
&& !is_dependent_type
)
7549 /* Now that the type has been registered on the instantiations
7550 list, we set up the enumerators. Because the enumeration
7551 constants may involve the enumeration type itself, we make
7552 sure to register the type first, and then create the
7553 constants. That way, doing tsubst_expr for the enumeration
7554 constants won't result in recursive calls here; we'll find
7555 the instantiation and exit above. */
7556 tsubst_enum (template_type
, t
, arglist
);
7558 if (CLASS_TYPE_P (template_type
) && is_dependent_type
)
7559 /* If the type makes use of template parameters, the
7560 code that generates debugging information will crash. */
7561 DECL_IGNORED_P (TYPE_STUB_DECL (t
)) = 1;
7563 /* Possibly limit visibility based on template args. */
7564 TREE_PUBLIC (type_decl
) = 1;
7565 determine_visibility (type_decl
);
7571 /* Wrapper for lookup_template_class_1. */
7574 lookup_template_class (tree d1
, tree arglist
, tree in_decl
, tree context
,
7575 int entering_scope
, tsubst_flags_t complain
)
7578 timevar_push (TV_TEMPLATE_INST
);
7579 ret
= lookup_template_class_1 (d1
, arglist
, in_decl
, context
,
7580 entering_scope
, complain
);
7581 timevar_pop (TV_TEMPLATE_INST
);
7589 /* True when we should also visit template parameters that occur in
7590 non-deduced contexts. */
7591 bool include_nondeduced_p
;
7592 struct pointer_set_t
*visited
;
7595 /* Called from for_each_template_parm via walk_tree. */
7598 for_each_template_parm_r (tree
*tp
, int *walk_subtrees
, void *d
)
7601 struct pair_fn_data
*pfd
= (struct pair_fn_data
*) d
;
7602 tree_fn_t fn
= pfd
->fn
;
7603 void *data
= pfd
->data
;
7606 && (pfd
->include_nondeduced_p
|| TREE_CODE (t
) != TYPENAME_TYPE
)
7607 && for_each_template_parm (TYPE_CONTEXT (t
), fn
, data
, pfd
->visited
,
7608 pfd
->include_nondeduced_p
))
7609 return error_mark_node
;
7611 switch (TREE_CODE (t
))
7614 if (TYPE_PTRMEMFUNC_P (t
))
7620 if (!TYPE_TEMPLATE_INFO (t
))
7622 else if (for_each_template_parm (TI_ARGS (TYPE_TEMPLATE_INFO (t
)),
7623 fn
, data
, pfd
->visited
,
7624 pfd
->include_nondeduced_p
))
7625 return error_mark_node
;
7629 if (for_each_template_parm (TYPE_MIN_VALUE (t
),
7630 fn
, data
, pfd
->visited
,
7631 pfd
->include_nondeduced_p
)
7632 || for_each_template_parm (TYPE_MAX_VALUE (t
),
7633 fn
, data
, pfd
->visited
,
7634 pfd
->include_nondeduced_p
))
7635 return error_mark_node
;
7639 /* Since we're not going to walk subtrees, we have to do this
7641 if (for_each_template_parm (TYPE_METHOD_BASETYPE (t
), fn
, data
,
7642 pfd
->visited
, pfd
->include_nondeduced_p
))
7643 return error_mark_node
;
7647 /* Check the return type. */
7648 if (for_each_template_parm (TREE_TYPE (t
), fn
, data
, pfd
->visited
,
7649 pfd
->include_nondeduced_p
))
7650 return error_mark_node
;
7652 /* Check the parameter types. Since default arguments are not
7653 instantiated until they are needed, the TYPE_ARG_TYPES may
7654 contain expressions that involve template parameters. But,
7655 no-one should be looking at them yet. And, once they're
7656 instantiated, they don't contain template parameters, so
7657 there's no point in looking at them then, either. */
7661 for (parm
= TYPE_ARG_TYPES (t
); parm
; parm
= TREE_CHAIN (parm
))
7662 if (for_each_template_parm (TREE_VALUE (parm
), fn
, data
,
7663 pfd
->visited
, pfd
->include_nondeduced_p
))
7664 return error_mark_node
;
7666 /* Since we've already handled the TYPE_ARG_TYPES, we don't
7667 want walk_tree walking into them itself. */
7673 case UNDERLYING_TYPE
:
7674 if (pfd
->include_nondeduced_p
7675 && for_each_template_parm (TYPE_FIELDS (t
), fn
, data
,
7677 pfd
->include_nondeduced_p
))
7678 return error_mark_node
;
7683 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
)
7684 && for_each_template_parm (DECL_TI_ARGS (t
), fn
, data
,
7685 pfd
->visited
, pfd
->include_nondeduced_p
))
7686 return error_mark_node
;
7691 if (TREE_CODE (t
) == CONST_DECL
&& DECL_TEMPLATE_PARM_P (t
)
7692 && for_each_template_parm (DECL_INITIAL (t
), fn
, data
,
7693 pfd
->visited
, pfd
->include_nondeduced_p
))
7694 return error_mark_node
;
7695 if (DECL_CONTEXT (t
)
7696 && pfd
->include_nondeduced_p
7697 && for_each_template_parm (DECL_CONTEXT (t
), fn
, data
,
7698 pfd
->visited
, pfd
->include_nondeduced_p
))
7699 return error_mark_node
;
7702 case BOUND_TEMPLATE_TEMPLATE_PARM
:
7703 /* Record template parameters such as `T' inside `TT<T>'. */
7704 if (for_each_template_parm (TYPE_TI_ARGS (t
), fn
, data
, pfd
->visited
,
7705 pfd
->include_nondeduced_p
))
7706 return error_mark_node
;
7709 case TEMPLATE_TEMPLATE_PARM
:
7710 case TEMPLATE_TYPE_PARM
:
7711 case TEMPLATE_PARM_INDEX
:
7712 if (fn
&& (*fn
)(t
, data
))
7713 return error_mark_node
;
7715 return error_mark_node
;
7719 /* A template template parameter is encountered. */
7720 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
)
7721 && for_each_template_parm (TREE_TYPE (t
), fn
, data
, pfd
->visited
,
7722 pfd
->include_nondeduced_p
))
7723 return error_mark_node
;
7725 /* Already substituted template template parameter */
7731 || for_each_template_parm (TYPENAME_TYPE_FULLNAME (t
), fn
,
7733 pfd
->include_nondeduced_p
))
7734 return error_mark_node
;
7738 if (TREE_TYPE (t
) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t
))
7739 && pfd
->include_nondeduced_p
7740 && for_each_template_parm (TYPE_PTRMEMFUNC_FN_TYPE
7741 (TREE_TYPE (t
)), fn
, data
,
7742 pfd
->visited
, pfd
->include_nondeduced_p
))
7743 return error_mark_node
;
7748 /* If there's no type, then this thing must be some expression
7749 involving template parameters. */
7750 if (!fn
&& !TREE_TYPE (t
))
7751 return error_mark_node
;
7756 case IMPLICIT_CONV_EXPR
:
7757 case REINTERPRET_CAST_EXPR
:
7758 case CONST_CAST_EXPR
:
7759 case STATIC_CAST_EXPR
:
7760 case DYNAMIC_CAST_EXPR
:
7764 case PSEUDO_DTOR_EXPR
:
7766 return error_mark_node
;
7773 /* We didn't find any template parameters we liked. */
7777 /* For each TEMPLATE_TYPE_PARM, TEMPLATE_TEMPLATE_PARM,
7778 BOUND_TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX in T,
7779 call FN with the parameter and the DATA.
7780 If FN returns nonzero, the iteration is terminated, and
7781 for_each_template_parm returns 1. Otherwise, the iteration
7782 continues. If FN never returns a nonzero value, the value
7783 returned by for_each_template_parm is 0. If FN is NULL, it is
7784 considered to be the function which always returns 1.
7786 If INCLUDE_NONDEDUCED_P, then this routine will also visit template
7787 parameters that occur in non-deduced contexts. When false, only
7788 visits those template parameters that can be deduced. */
7791 for_each_template_parm (tree t
, tree_fn_t fn
, void* data
,
7792 struct pointer_set_t
*visited
,
7793 bool include_nondeduced_p
)
7795 struct pair_fn_data pfd
;
7801 pfd
.include_nondeduced_p
= include_nondeduced_p
;
7803 /* Walk the tree. (Conceptually, we would like to walk without
7804 duplicates, but for_each_template_parm_r recursively calls
7805 for_each_template_parm, so we would need to reorganize a fair
7806 bit to use walk_tree_without_duplicates, so we keep our own
7809 pfd
.visited
= visited
;
7811 pfd
.visited
= pointer_set_create ();
7812 result
= cp_walk_tree (&t
,
7813 for_each_template_parm_r
,
7815 pfd
.visited
) != NULL_TREE
;
7820 pointer_set_destroy (pfd
.visited
);
7827 /* Returns true if T depends on any template parameter. */
7830 uses_template_parms (tree t
)
7833 int saved_processing_template_decl
;
7835 saved_processing_template_decl
= processing_template_decl
;
7836 if (!saved_processing_template_decl
)
7837 processing_template_decl
= 1;
7839 dependent_p
= dependent_type_p (t
);
7840 else if (TREE_CODE (t
) == TREE_VEC
)
7841 dependent_p
= any_dependent_template_arguments_p (t
);
7842 else if (TREE_CODE (t
) == TREE_LIST
)
7843 dependent_p
= (uses_template_parms (TREE_VALUE (t
))
7844 || uses_template_parms (TREE_CHAIN (t
)));
7845 else if (TREE_CODE (t
) == TYPE_DECL
)
7846 dependent_p
= dependent_type_p (TREE_TYPE (t
));
7849 || TREE_CODE (t
) == TEMPLATE_PARM_INDEX
7850 || TREE_CODE (t
) == OVERLOAD
7853 || TREE_CODE (t
) == TRAIT_EXPR
7854 || TREE_CODE (t
) == CONSTRUCTOR
7855 || CONSTANT_CLASS_P (t
))
7856 dependent_p
= (type_dependent_expression_p (t
)
7857 || value_dependent_expression_p (t
));
7860 gcc_assert (t
== error_mark_node
);
7861 dependent_p
= false;
7864 processing_template_decl
= saved_processing_template_decl
;
7869 /* Returns true iff current_function_decl is an incompletely instantiated
7870 template. Useful instead of processing_template_decl because the latter
7871 is set to 0 during fold_non_dependent_expr. */
7874 in_template_function (void)
7876 tree fn
= current_function_decl
;
7878 ++processing_template_decl
;
7879 ret
= (fn
&& DECL_LANG_SPECIFIC (fn
)
7880 && DECL_TEMPLATE_INFO (fn
)
7881 && any_dependent_template_arguments_p (DECL_TI_ARGS (fn
)));
7882 --processing_template_decl
;
7886 /* Returns true if T depends on any template parameter with level LEVEL. */
7889 uses_template_parms_level (tree t
, int level
)
7891 return for_each_template_parm (t
, template_parm_this_level_p
, &level
, NULL
,
7892 /*include_nondeduced_p=*/true);
7895 /* Returns TRUE iff INST is an instantiation we don't need to do in an
7896 ill-formed translation unit, i.e. a variable or function that isn't
7897 usable in a constant expression. */
7900 neglectable_inst_p (tree d
)
7903 && !(TREE_CODE (d
) == FUNCTION_DECL
? DECL_DECLARED_CONSTEXPR_P (d
)
7904 : decl_maybe_constant_var_p (d
)));
7907 /* Returns TRUE iff we should refuse to instantiate DECL because it's
7908 neglectable and instantiated from within an erroneous instantiation. */
7911 limit_bad_template_recursion (tree decl
)
7913 struct tinst_level
*lev
= current_tinst_level
;
7914 int errs
= errorcount
+ sorrycount
;
7915 if (lev
== NULL
|| errs
== 0 || !neglectable_inst_p (decl
))
7918 for (; lev
; lev
= lev
->next
)
7919 if (neglectable_inst_p (lev
->decl
))
7922 return (lev
&& errs
> lev
->errors
);
7925 static int tinst_depth
;
7926 extern int max_tinst_depth
;
7929 static GTY(()) struct tinst_level
*last_error_tinst_level
;
7931 /* We're starting to instantiate D; record the template instantiation context
7932 for diagnostics and to restore it later. */
7935 push_tinst_level (tree d
)
7937 struct tinst_level
*new_level
;
7939 if (tinst_depth
>= max_tinst_depth
)
7941 last_error_tinst_level
= current_tinst_level
;
7942 if (TREE_CODE (d
) == TREE_LIST
)
7943 error ("template instantiation depth exceeds maximum of %d (use "
7944 "-ftemplate-depth= to increase the maximum) substituting %qS",
7945 max_tinst_depth
, d
);
7947 error ("template instantiation depth exceeds maximum of %d (use "
7948 "-ftemplate-depth= to increase the maximum) instantiating %qD",
7949 max_tinst_depth
, d
);
7951 print_instantiation_context ();
7956 /* If the current instantiation caused problems, don't let it instantiate
7957 anything else. Do allow deduction substitution and decls usable in
7958 constant expressions. */
7959 if (limit_bad_template_recursion (d
))
7962 new_level
= ggc_alloc_tinst_level ();
7963 new_level
->decl
= d
;
7964 new_level
->locus
= input_location
;
7965 new_level
->errors
= errorcount
+sorrycount
;
7966 new_level
->in_system_header_p
= in_system_header
;
7967 new_level
->next
= current_tinst_level
;
7968 current_tinst_level
= new_level
;
7971 if (GATHER_STATISTICS
&& (tinst_depth
> depth_reached
))
7972 depth_reached
= tinst_depth
;
7977 /* We're done instantiating this template; return to the instantiation
7981 pop_tinst_level (void)
7983 /* Restore the filename and line number stashed away when we started
7984 this instantiation. */
7985 input_location
= current_tinst_level
->locus
;
7986 current_tinst_level
= current_tinst_level
->next
;
7990 /* We're instantiating a deferred template; restore the template
7991 instantiation context in which the instantiation was requested, which
7992 is one step out from LEVEL. Return the corresponding DECL or TYPE. */
7995 reopen_tinst_level (struct tinst_level
*level
)
7997 struct tinst_level
*t
;
8000 for (t
= level
; t
; t
= t
->next
)
8003 current_tinst_level
= level
;
8005 if (current_tinst_level
)
8006 current_tinst_level
->errors
= errorcount
+sorrycount
;
8010 /* Returns the TINST_LEVEL which gives the original instantiation
8013 struct tinst_level
*
8014 outermost_tinst_level (void)
8016 struct tinst_level
*level
= current_tinst_level
;
8019 level
= level
->next
;
8023 /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the
8024 vector of template arguments, as for tsubst.
8026 Returns an appropriate tsubst'd friend declaration. */
8029 tsubst_friend_function (tree decl
, tree args
)
8033 if (TREE_CODE (decl
) == FUNCTION_DECL
8034 && DECL_TEMPLATE_INSTANTIATION (decl
)
8035 && TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
8036 /* This was a friend declared with an explicit template
8037 argument list, e.g.:
8041 to indicate that f was a template instantiation, not a new
8042 function declaration. Now, we have to figure out what
8043 instantiation of what template. */
8045 tree template_id
, arglist
, fns
;
8048 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (current_class_type
));
8050 /* Friend functions are looked up in the containing namespace scope.
8051 We must enter that scope, to avoid finding member functions of the
8052 current class with same name. */
8053 push_nested_namespace (ns
);
8054 fns
= tsubst_expr (DECL_TI_TEMPLATE (decl
), args
,
8055 tf_warning_or_error
, NULL_TREE
,
8056 /*integral_constant_expression_p=*/false);
8057 pop_nested_namespace (ns
);
8058 arglist
= tsubst (DECL_TI_ARGS (decl
), args
,
8059 tf_warning_or_error
, NULL_TREE
);
8060 template_id
= lookup_template_function (fns
, arglist
);
8062 new_friend
= tsubst (decl
, args
, tf_warning_or_error
, NULL_TREE
);
8063 tmpl
= determine_specialization (template_id
, new_friend
,
8065 /*need_member_template=*/0,
8066 TREE_VEC_LENGTH (args
),
8068 return instantiate_template (tmpl
, new_args
, tf_error
);
8071 new_friend
= tsubst (decl
, args
, tf_warning_or_error
, NULL_TREE
);
8073 /* The NEW_FRIEND will look like an instantiation, to the
8074 compiler, but is not an instantiation from the point of view of
8075 the language. For example, we might have had:
8077 template <class T> struct S {
8078 template <class U> friend void f(T, U);
8081 Then, in S<int>, template <class U> void f(int, U) is not an
8082 instantiation of anything. */
8083 if (new_friend
== error_mark_node
)
8084 return error_mark_node
;
8086 DECL_USE_TEMPLATE (new_friend
) = 0;
8087 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
8089 DECL_USE_TEMPLATE (DECL_TEMPLATE_RESULT (new_friend
)) = 0;
8090 DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (new_friend
))
8091 = DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (decl
));
8094 /* The mangled name for the NEW_FRIEND is incorrect. The function
8095 is not a template instantiation and should not be mangled like
8096 one. Therefore, we forget the mangling here; we'll recompute it
8097 later if we need it. */
8098 if (TREE_CODE (new_friend
) != TEMPLATE_DECL
)
8100 SET_DECL_RTL (new_friend
, NULL
);
8101 SET_DECL_ASSEMBLER_NAME (new_friend
, NULL_TREE
);
8104 if (DECL_NAMESPACE_SCOPE_P (new_friend
))
8107 tree new_friend_template_info
;
8108 tree new_friend_result_template_info
;
8110 int new_friend_is_defn
;
8112 /* We must save some information from NEW_FRIEND before calling
8113 duplicate decls since that function will free NEW_FRIEND if
8115 new_friend_template_info
= DECL_TEMPLATE_INFO (new_friend
);
8116 new_friend_is_defn
=
8117 (DECL_INITIAL (DECL_TEMPLATE_RESULT
8118 (template_for_substitution (new_friend
)))
8120 if (TREE_CODE (new_friend
) == TEMPLATE_DECL
)
8122 /* This declaration is a `primary' template. */
8123 DECL_PRIMARY_TEMPLATE (new_friend
) = new_friend
;
8125 new_friend_result_template_info
8126 = DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (new_friend
));
8129 new_friend_result_template_info
= NULL_TREE
;
8131 /* Make the init_value nonzero so pushdecl knows this is a defn. */
8132 if (new_friend_is_defn
)
8133 DECL_INITIAL (new_friend
) = error_mark_node
;
8135 /* Inside pushdecl_namespace_level, we will push into the
8136 current namespace. However, the friend function should go
8137 into the namespace of the template. */
8138 ns
= decl_namespace_context (new_friend
);
8139 push_nested_namespace (ns
);
8140 old_decl
= pushdecl_namespace_level (new_friend
, /*is_friend=*/true);
8141 pop_nested_namespace (ns
);
8143 if (old_decl
== error_mark_node
)
8144 return error_mark_node
;
8146 if (old_decl
!= new_friend
)
8148 /* This new friend declaration matched an existing
8149 declaration. For example, given:
8151 template <class T> void f(T);
8152 template <class U> class C {
8153 template <class T> friend void f(T) {}
8156 the friend declaration actually provides the definition
8157 of `f', once C has been instantiated for some type. So,
8158 old_decl will be the out-of-class template declaration,
8159 while new_friend is the in-class definition.
8161 But, if `f' was called before this point, the
8162 instantiation of `f' will have DECL_TI_ARGS corresponding
8163 to `T' but not to `U', references to which might appear
8164 in the definition of `f'. Previously, the most general
8165 template for an instantiation of `f' was the out-of-class
8166 version; now it is the in-class version. Therefore, we
8167 run through all specialization of `f', adding to their
8168 DECL_TI_ARGS appropriately. In particular, they need a
8169 new set of outer arguments, corresponding to the
8170 arguments for this class instantiation.
8172 The same situation can arise with something like this:
8175 template <class T> class C {
8179 when `C<int>' is instantiated. Now, `f(int)' is defined
8182 if (!new_friend_is_defn
)
8183 /* On the other hand, if the in-class declaration does
8184 *not* provide a definition, then we don't want to alter
8185 existing definitions. We can just leave everything
8190 tree new_template
= TI_TEMPLATE (new_friend_template_info
);
8191 tree new_args
= TI_ARGS (new_friend_template_info
);
8193 /* Overwrite whatever template info was there before, if
8194 any, with the new template information pertaining to
8196 DECL_TEMPLATE_INFO (old_decl
) = new_friend_template_info
;
8198 if (TREE_CODE (old_decl
) != TEMPLATE_DECL
)
8200 /* We should have called reregister_specialization in
8202 gcc_assert (retrieve_specialization (new_template
,
8206 /* Instantiate it if the global has already been used. */
8207 if (DECL_ODR_USED (old_decl
))
8208 instantiate_decl (old_decl
, /*defer_ok=*/true,
8209 /*expl_inst_class_mem_p=*/false);
8215 /* Indicate that the old function template is a partial
8217 DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (old_decl
))
8218 = new_friend_result_template_info
;
8220 gcc_assert (new_template
8221 == most_general_template (new_template
));
8222 gcc_assert (new_template
!= old_decl
);
8224 /* Reassign any specializations already in the hash table
8225 to the new more general template, and add the
8226 additional template args. */
8227 for (t
= DECL_TEMPLATE_INSTANTIATIONS (old_decl
);
8231 tree spec
= TREE_VALUE (t
);
8234 elt
.tmpl
= old_decl
;
8235 elt
.args
= DECL_TI_ARGS (spec
);
8236 elt
.spec
= NULL_TREE
;
8238 htab_remove_elt (decl_specializations
, &elt
);
8241 = add_outermost_template_args (new_args
,
8242 DECL_TI_ARGS (spec
));
8244 register_specialization
8245 (spec
, new_template
, DECL_TI_ARGS (spec
), true, 0);
8248 DECL_TEMPLATE_INSTANTIATIONS (old_decl
) = NULL_TREE
;
8252 /* The information from NEW_FRIEND has been merged into OLD_DECL
8253 by duplicate_decls. */
8254 new_friend
= old_decl
;
8259 tree context
= DECL_CONTEXT (new_friend
);
8263 template <class T> class C {
8264 template <class U> friend void C1<U>::f (); // case 1
8265 friend void C2<T>::f (); // case 2
8267 we only need to make sure CONTEXT is a complete type for
8268 case 2. To distinguish between the two cases, we note that
8269 CONTEXT of case 1 remains dependent type after tsubst while
8270 this isn't true for case 2. */
8271 ++processing_template_decl
;
8272 dependent_p
= dependent_type_p (context
);
8273 --processing_template_decl
;
8276 && !complete_type_or_else (context
, NULL_TREE
))
8277 return error_mark_node
;
8279 if (COMPLETE_TYPE_P (context
))
8281 /* Check to see that the declaration is really present, and,
8282 possibly obtain an improved declaration. */
8283 tree fn
= check_classfn (context
,
8284 new_friend
, NULL_TREE
);
8294 /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of
8295 template arguments, as for tsubst.
8297 Returns an appropriate tsubst'd friend type or error_mark_node on
8301 tsubst_friend_class (tree friend_tmpl
, tree args
)
8307 if (DECL_TEMPLATE_TEMPLATE_PARM_P (friend_tmpl
))
8309 tree t
= tsubst (TREE_TYPE (friend_tmpl
), args
, tf_none
, NULL_TREE
);
8310 return TREE_TYPE (t
);
8313 context
= CP_DECL_CONTEXT (friend_tmpl
);
8315 if (context
!= global_namespace
)
8317 if (TREE_CODE (context
) == NAMESPACE_DECL
)
8318 push_nested_namespace (context
);
8320 push_nested_class (tsubst (context
, args
, tf_none
, NULL_TREE
));
8323 /* Look for a class template declaration. We look for hidden names
8324 because two friend declarations of the same template are the
8325 same. For example, in:
8328 template <typename> friend class F;
8330 template <typename> struct B {
8331 template <typename> friend class F;
8334 both F templates are the same. */
8335 tmpl
= lookup_name_real (DECL_NAME (friend_tmpl
), 0, 0,
8336 /*block_p=*/true, 0, LOOKUP_HIDDEN
);
8338 /* But, if we don't find one, it might be because we're in a
8339 situation like this:
8347 Here, in the scope of (say) S<int>, `S' is bound to a TYPE_DECL
8348 for `S<int>', not the TEMPLATE_DECL. */
8349 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
8351 tmpl
= lookup_name_prefer_type (DECL_NAME (friend_tmpl
), 1);
8352 tmpl
= maybe_get_template_decl_from_type_decl (tmpl
);
8355 if (tmpl
&& DECL_CLASS_TEMPLATE_P (tmpl
))
8357 /* The friend template has already been declared. Just
8358 check to see that the declarations match, and install any new
8359 default parameters. We must tsubst the default parameters,
8360 of course. We only need the innermost template parameters
8361 because that is all that redeclare_class_template will look
8363 if (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (friend_tmpl
))
8364 > TMPL_ARGS_DEPTH (args
))
8367 location_t saved_input_location
;
8368 parms
= tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_tmpl
),
8369 args
, tf_warning_or_error
);
8371 saved_input_location
= input_location
;
8372 input_location
= DECL_SOURCE_LOCATION (friend_tmpl
);
8373 redeclare_class_template (TREE_TYPE (tmpl
), parms
);
8374 input_location
= saved_input_location
;
8378 friend_type
= TREE_TYPE (tmpl
);
8382 /* The friend template has not already been declared. In this
8383 case, the instantiation of the template class will cause the
8384 injection of this template into the global scope. */
8385 tmpl
= tsubst (friend_tmpl
, args
, tf_warning_or_error
, NULL_TREE
);
8386 if (tmpl
== error_mark_node
)
8387 return error_mark_node
;
8389 /* The new TMPL is not an instantiation of anything, so we
8390 forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE for
8391 the new type because that is supposed to be the corresponding
8392 template decl, i.e., TMPL. */
8393 DECL_USE_TEMPLATE (tmpl
) = 0;
8394 DECL_TEMPLATE_INFO (tmpl
) = NULL_TREE
;
8395 CLASSTYPE_USE_TEMPLATE (TREE_TYPE (tmpl
)) = 0;
8396 CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl
))
8397 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl
)));
8399 /* Inject this template into the global scope. */
8400 friend_type
= TREE_TYPE (pushdecl_top_level_maybe_friend (tmpl
, true));
8403 if (context
!= global_namespace
)
8405 if (TREE_CODE (context
) == NAMESPACE_DECL
)
8406 pop_nested_namespace (context
);
8408 pop_nested_class ();
8414 /* Returns zero if TYPE cannot be completed later due to circularity.
8415 Otherwise returns one. */
8418 can_complete_type_without_circularity (tree type
)
8420 if (type
== NULL_TREE
|| type
== error_mark_node
)
8422 else if (COMPLETE_TYPE_P (type
))
8424 else if (TREE_CODE (type
) == ARRAY_TYPE
&& TYPE_DOMAIN (type
))
8425 return can_complete_type_without_circularity (TREE_TYPE (type
));
8426 else if (CLASS_TYPE_P (type
)
8427 && TYPE_BEING_DEFINED (TYPE_MAIN_VARIANT (type
)))
8433 /* Apply any attributes which had to be deferred until instantiation
8434 time. DECL_P, ATTRIBUTES and ATTR_FLAGS are as cplus_decl_attributes;
8435 ARGS, COMPLAIN, IN_DECL are as tsubst. */
8438 apply_late_template_attributes (tree
*decl_p
, tree attributes
, int attr_flags
,
8439 tree args
, tsubst_flags_t complain
, tree in_decl
)
8441 tree last_dep
= NULL_TREE
;
8445 for (t
= attributes
; t
; t
= TREE_CHAIN (t
))
8446 if (ATTR_IS_DEPENDENT (t
))
8449 attributes
= copy_list (attributes
);
8453 if (DECL_P (*decl_p
))
8455 if (TREE_TYPE (*decl_p
) == error_mark_node
)
8457 p
= &DECL_ATTRIBUTES (*decl_p
);
8460 p
= &TYPE_ATTRIBUTES (*decl_p
);
8464 tree late_attrs
= NULL_TREE
;
8465 tree
*q
= &late_attrs
;
8467 for (*p
= attributes
; *p
; )
8470 if (ATTR_IS_DEPENDENT (t
))
8472 *p
= TREE_CHAIN (t
);
8473 TREE_CHAIN (t
) = NULL_TREE
;
8474 /* If the first attribute argument is an identifier, don't
8475 pass it through tsubst. Attributes like mode, format,
8476 cleanup and several target specific attributes expect it
8479 && TREE_CODE (TREE_VALUE (t
)) == TREE_LIST
8480 && TREE_VALUE (TREE_VALUE (t
))
8481 && (identifier_p (TREE_VALUE (TREE_VALUE (t
)))))
8484 = tsubst_expr (TREE_CHAIN (TREE_VALUE (t
)), args
, complain
,
8486 /*integral_constant_expression_p=*/false);
8487 if (chain
!= TREE_CHAIN (TREE_VALUE (t
)))
8489 = tree_cons (NULL_TREE
, TREE_VALUE (TREE_VALUE (t
)),
8494 = tsubst_expr (TREE_VALUE (t
), args
, complain
, in_decl
,
8495 /*integral_constant_expression_p=*/false);
8497 q
= &TREE_CHAIN (t
);
8500 p
= &TREE_CHAIN (t
);
8503 cplus_decl_attributes (decl_p
, late_attrs
, attr_flags
);
8507 /* Perform (or defer) access check for typedefs that were referenced
8508 from within the template TMPL code.
8509 This is a subroutine of instantiate_decl and instantiate_class_template.
8510 TMPL is the template to consider and TARGS is the list of arguments of
8514 perform_typedefs_access_check (tree tmpl
, tree targs
)
8516 location_t saved_location
;
8518 qualified_typedef_usage_t
*iter
;
8521 || (!CLASS_TYPE_P (tmpl
)
8522 && TREE_CODE (tmpl
) != FUNCTION_DECL
))
8525 saved_location
= input_location
;
8526 FOR_EACH_VEC_SAFE_ELT (get_types_needing_access_check (tmpl
), i
, iter
)
8528 tree type_decl
= iter
->typedef_decl
;
8529 tree type_scope
= iter
->context
;
8531 if (!type_decl
|| !type_scope
|| !CLASS_TYPE_P (type_scope
))
8534 if (uses_template_parms (type_decl
))
8535 type_decl
= tsubst (type_decl
, targs
, tf_error
, NULL_TREE
);
8536 if (uses_template_parms (type_scope
))
8537 type_scope
= tsubst (type_scope
, targs
, tf_error
, NULL_TREE
);
8539 /* Make access check error messages point to the location
8540 of the use of the typedef. */
8541 input_location
= iter
->locus
;
8542 perform_or_defer_access_check (TYPE_BINFO (type_scope
),
8543 type_decl
, type_decl
,
8544 tf_warning_or_error
);
8546 input_location
= saved_location
;
8550 instantiate_class_template_1 (tree type
)
8552 tree templ
, args
, pattern
, t
, member
;
8556 unsigned int saved_maximum_field_alignment
;
8559 if (type
== error_mark_node
)
8560 return error_mark_node
;
8562 if (COMPLETE_OR_OPEN_TYPE_P (type
)
8563 || uses_template_parms (type
))
8566 /* Figure out which template is being instantiated. */
8567 templ
= most_general_template (CLASSTYPE_TI_TEMPLATE (type
));
8568 gcc_assert (TREE_CODE (templ
) == TEMPLATE_DECL
);
8570 /* Determine what specialization of the original template to
8572 t
= most_specialized_class (type
, templ
, tf_warning_or_error
);
8573 if (t
== error_mark_node
)
8575 TYPE_BEING_DEFINED (type
) = 1;
8576 return error_mark_node
;
8580 /* This TYPE is actually an instantiation of a partial
8581 specialization. We replace the innermost set of ARGS with
8582 the arguments appropriate for substitution. For example,
8585 template <class T> struct S {};
8586 template <class T> struct S<T*> {};
8588 and supposing that we are instantiating S<int*>, ARGS will
8589 presently be {int*} -- but we need {int}. */
8590 pattern
= TREE_TYPE (t
);
8591 args
= TREE_PURPOSE (t
);
8595 pattern
= TREE_TYPE (templ
);
8596 args
= CLASSTYPE_TI_ARGS (type
);
8599 /* If the template we're instantiating is incomplete, then clearly
8600 there's nothing we can do. */
8601 if (!COMPLETE_TYPE_P (pattern
))
8604 /* If we've recursively instantiated too many templates, stop. */
8605 if (! push_tinst_level (type
))
8608 /* Now we're really doing the instantiation. Mark the type as in
8609 the process of being defined. */
8610 TYPE_BEING_DEFINED (type
) = 1;
8612 /* We may be in the middle of deferred access check. Disable
8614 push_deferring_access_checks (dk_no_deferred
);
8616 fn_context
= decl_function_context (TYPE_MAIN_DECL (type
));
8618 push_to_top_level ();
8619 /* Use #pragma pack from the template context. */
8620 saved_maximum_field_alignment
= maximum_field_alignment
;
8621 maximum_field_alignment
= TYPE_PRECISION (pattern
);
8623 SET_CLASSTYPE_INTERFACE_UNKNOWN (type
);
8625 /* Set the input location to the most specialized template definition.
8626 This is needed if tsubsting causes an error. */
8627 typedecl
= TYPE_MAIN_DECL (pattern
);
8628 input_location
= DECL_SOURCE_LOCATION (TYPE_NAME (type
)) =
8629 DECL_SOURCE_LOCATION (typedecl
);
8631 TYPE_PACKED (type
) = TYPE_PACKED (pattern
);
8632 TYPE_ALIGN (type
) = TYPE_ALIGN (pattern
);
8633 TYPE_USER_ALIGN (type
) = TYPE_USER_ALIGN (pattern
);
8634 TYPE_FOR_JAVA (type
) = TYPE_FOR_JAVA (pattern
); /* For libjava's JArray<T> */
8635 if (ANON_AGGR_TYPE_P (pattern
))
8636 SET_ANON_AGGR_TYPE_P (type
);
8637 if (CLASSTYPE_VISIBILITY_SPECIFIED (pattern
))
8639 CLASSTYPE_VISIBILITY_SPECIFIED (type
) = 1;
8640 CLASSTYPE_VISIBILITY (type
) = CLASSTYPE_VISIBILITY (pattern
);
8641 /* Adjust visibility for template arguments. */
8642 determine_visibility (TYPE_MAIN_DECL (type
));
8644 CLASSTYPE_FINAL (type
) = CLASSTYPE_FINAL (pattern
);
8646 pbinfo
= TYPE_BINFO (pattern
);
8648 /* We should never instantiate a nested class before its enclosing
8649 class; we need to look up the nested class by name before we can
8650 instantiate it, and that lookup should instantiate the enclosing
8652 gcc_assert (!DECL_CLASS_SCOPE_P (TYPE_MAIN_DECL (pattern
))
8653 || COMPLETE_OR_OPEN_TYPE_P (TYPE_CONTEXT (type
)));
8655 base_list
= NULL_TREE
;
8656 if (BINFO_N_BASE_BINFOS (pbinfo
))
8662 /* We must enter the scope containing the type, as that is where
8663 the accessibility of types named in dependent bases are
8665 pushed_scope
= push_scope (CP_TYPE_CONTEXT (type
));
8667 /* Substitute into each of the bases to determine the actual
8669 for (i
= 0; BINFO_BASE_ITERATE (pbinfo
, i
, pbase_binfo
); i
++)
8672 tree access
= BINFO_BASE_ACCESS (pbinfo
, i
);
8673 tree expanded_bases
= NULL_TREE
;
8676 if (PACK_EXPANSION_P (BINFO_TYPE (pbase_binfo
)))
8679 tsubst_pack_expansion (BINFO_TYPE (pbase_binfo
),
8680 args
, tf_error
, NULL_TREE
);
8681 if (expanded_bases
== error_mark_node
)
8684 len
= TREE_VEC_LENGTH (expanded_bases
);
8687 for (idx
= 0; idx
< len
; idx
++)
8690 /* Extract the already-expanded base class. */
8691 base
= TREE_VEC_ELT (expanded_bases
, idx
);
8693 /* Substitute to figure out the base class. */
8694 base
= tsubst (BINFO_TYPE (pbase_binfo
), args
, tf_error
,
8697 if (base
== error_mark_node
)
8700 base_list
= tree_cons (access
, base
, base_list
);
8701 if (BINFO_VIRTUAL_P (pbase_binfo
))
8702 TREE_TYPE (base_list
) = integer_type_node
;
8706 /* The list is now in reverse order; correct that. */
8707 base_list
= nreverse (base_list
);
8710 pop_scope (pushed_scope
);
8712 /* Now call xref_basetypes to set up all the base-class
8714 xref_basetypes (type
, base_list
);
8716 apply_late_template_attributes (&type
, TYPE_ATTRIBUTES (pattern
),
8717 (int) ATTR_FLAG_TYPE_IN_PLACE
,
8718 args
, tf_error
, NULL_TREE
);
8719 fixup_attribute_variants (type
);
8721 /* Now that our base classes are set up, enter the scope of the
8722 class, so that name lookups into base classes, etc. will work
8723 correctly. This is precisely analogous to what we do in
8724 begin_class_definition when defining an ordinary non-template
8725 class, except we also need to push the enclosing classes. */
8726 push_nested_class (type
);
8728 /* Now members are processed in the order of declaration. */
8729 for (member
= CLASSTYPE_DECL_LIST (pattern
);
8730 member
; member
= TREE_CHAIN (member
))
8732 tree t
= TREE_VALUE (member
);
8734 if (TREE_PURPOSE (member
))
8738 /* Build new CLASSTYPE_NESTED_UTDS. */
8741 bool class_template_p
;
8743 class_template_p
= (TREE_CODE (t
) != ENUMERAL_TYPE
8744 && TYPE_LANG_SPECIFIC (t
)
8745 && CLASSTYPE_IS_TEMPLATE (t
));
8746 /* If the member is a class template, then -- even after
8747 substitution -- there may be dependent types in the
8748 template argument list for the class. We increment
8749 PROCESSING_TEMPLATE_DECL so that dependent_type_p, as
8750 that function will assume that no types are dependent
8751 when outside of a template. */
8752 if (class_template_p
)
8753 ++processing_template_decl
;
8754 newtag
= tsubst (t
, args
, tf_error
, NULL_TREE
);
8755 if (class_template_p
)
8756 --processing_template_decl
;
8757 if (newtag
== error_mark_node
)
8760 if (TREE_CODE (newtag
) != ENUMERAL_TYPE
)
8762 tree name
= TYPE_IDENTIFIER (t
);
8764 if (class_template_p
)
8765 /* Unfortunately, lookup_template_class sets
8766 CLASSTYPE_IMPLICIT_INSTANTIATION for a partial
8767 instantiation (i.e., for the type of a member
8768 template class nested within a template class.)
8769 This behavior is required for
8770 maybe_process_partial_specialization to work
8771 correctly, but is not accurate in this case;
8772 the TAG is not an instantiation of anything.
8773 (The corresponding TEMPLATE_DECL is an
8774 instantiation, but the TYPE is not.) */
8775 CLASSTYPE_USE_TEMPLATE (newtag
) = 0;
8777 /* Now, we call pushtag to put this NEWTAG into the scope of
8778 TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid
8779 pushtag calling push_template_decl. We don't have to do
8780 this for enums because it will already have been done in
8783 SET_IDENTIFIER_TYPE_VALUE (name
, newtag
);
8784 pushtag (name
, newtag
, /*tag_scope=*/ts_current
);
8787 else if (DECL_DECLARES_FUNCTION_P (t
))
8789 /* Build new TYPE_METHODS. */
8792 if (TREE_CODE (t
) == TEMPLATE_DECL
)
8793 ++processing_template_decl
;
8794 r
= tsubst (t
, args
, tf_error
, NULL_TREE
);
8795 if (TREE_CODE (t
) == TEMPLATE_DECL
)
8796 --processing_template_decl
;
8797 set_current_access_from_decl (r
);
8798 finish_member_declaration (r
);
8799 /* Instantiate members marked with attribute used. */
8800 if (r
!= error_mark_node
&& DECL_PRESERVE_P (r
))
8805 /* Build new TYPE_FIELDS. */
8806 if (TREE_CODE (t
) == STATIC_ASSERT
)
8810 ++c_inhibit_evaluation_warnings
;
8812 tsubst_expr (STATIC_ASSERT_CONDITION (t
), args
,
8813 tf_warning_or_error
, NULL_TREE
,
8814 /*integral_constant_expression_p=*/true);
8815 --c_inhibit_evaluation_warnings
;
8817 finish_static_assert (condition
,
8818 STATIC_ASSERT_MESSAGE (t
),
8819 STATIC_ASSERT_SOURCE_LOCATION (t
),
8822 else if (TREE_CODE (t
) != CONST_DECL
)
8826 /* The file and line for this declaration, to
8827 assist in error message reporting. Since we
8828 called push_tinst_level above, we don't need to
8830 input_location
= DECL_SOURCE_LOCATION (t
);
8832 if (TREE_CODE (t
) == TEMPLATE_DECL
)
8833 ++processing_template_decl
;
8834 r
= tsubst (t
, args
, tf_warning_or_error
, NULL_TREE
);
8835 if (TREE_CODE (t
) == TEMPLATE_DECL
)
8836 --processing_template_decl
;
8841 [t]he initialization (and any associated
8842 side-effects) of a static data member does
8843 not occur unless the static data member is
8844 itself used in a way that requires the
8845 definition of the static data member to
8848 Therefore, we do not substitute into the
8849 initialized for the static data member here. */
8850 finish_static_data_member_decl
8853 /*init_const_expr_p=*/false,
8854 /*asmspec_tree=*/NULL_TREE
,
8856 /* Instantiate members marked with attribute used. */
8857 if (r
!= error_mark_node
&& DECL_PRESERVE_P (r
))
8860 else if (TREE_CODE (r
) == FIELD_DECL
)
8862 /* Determine whether R has a valid type and can be
8863 completed later. If R is invalid, then it is
8864 replaced by error_mark_node so that it will not be
8865 added to TYPE_FIELDS. */
8866 tree rtype
= TREE_TYPE (r
);
8867 if (can_complete_type_without_circularity (rtype
))
8868 complete_type (rtype
);
8870 if (!COMPLETE_TYPE_P (rtype
))
8872 cxx_incomplete_type_error (r
, rtype
);
8873 r
= error_mark_node
;
8877 /* If it is a TYPE_DECL for a class-scoped ENUMERAL_TYPE,
8878 such a thing will already have been added to the field
8879 list by tsubst_enum in finish_member_declaration in the
8880 CLASSTYPE_NESTED_UTDS case above. */
8881 if (!(TREE_CODE (r
) == TYPE_DECL
8882 && TREE_CODE (TREE_TYPE (r
)) == ENUMERAL_TYPE
8883 && DECL_ARTIFICIAL (r
)))
8885 set_current_access_from_decl (r
);
8886 finish_member_declaration (r
);
8893 if (TYPE_P (t
) || DECL_CLASS_TEMPLATE_P (t
)
8894 || DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
8896 /* Build new CLASSTYPE_FRIEND_CLASSES. */
8898 tree friend_type
= t
;
8899 bool adjust_processing_template_decl
= false;
8901 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
8903 /* template <class T> friend class C; */
8904 friend_type
= tsubst_friend_class (friend_type
, args
);
8905 adjust_processing_template_decl
= true;
8907 else if (TREE_CODE (friend_type
) == UNBOUND_CLASS_TEMPLATE
)
8909 /* template <class T> friend class C::D; */
8910 friend_type
= tsubst (friend_type
, args
,
8911 tf_warning_or_error
, NULL_TREE
);
8912 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
8913 friend_type
= TREE_TYPE (friend_type
);
8914 adjust_processing_template_decl
= true;
8916 else if (TREE_CODE (friend_type
) == TYPENAME_TYPE
8917 || TREE_CODE (friend_type
) == TEMPLATE_TYPE_PARM
)
8919 /* This could be either
8923 when dependent_type_p is false or
8925 template <class U> friend class T::C;
8928 friend_type
= tsubst (friend_type
, args
,
8929 tf_warning_or_error
, NULL_TREE
);
8930 /* Bump processing_template_decl for correct
8931 dependent_type_p calculation. */
8932 ++processing_template_decl
;
8933 if (dependent_type_p (friend_type
))
8934 adjust_processing_template_decl
= true;
8935 --processing_template_decl
;
8937 else if (!CLASSTYPE_USE_TEMPLATE (friend_type
)
8938 && hidden_name_p (TYPE_NAME (friend_type
)))
8942 where C hasn't been declared yet. Let's lookup name
8943 from namespace scope directly, bypassing any name that
8944 come from dependent base class. */
8945 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (friend_type
));
8947 /* The call to xref_tag_from_type does injection for friend
8949 push_nested_namespace (ns
);
8951 xref_tag_from_type (friend_type
, NULL_TREE
,
8952 /*tag_scope=*/ts_current
);
8953 pop_nested_namespace (ns
);
8955 else if (uses_template_parms (friend_type
))
8956 /* friend class C<T>; */
8957 friend_type
= tsubst (friend_type
, args
,
8958 tf_warning_or_error
, NULL_TREE
);
8963 where C is already declared or
8965 friend class C<int>;
8967 We don't have to do anything in these cases. */
8969 if (adjust_processing_template_decl
)
8970 /* Trick make_friend_class into realizing that the friend
8971 we're adding is a template, not an ordinary class. It's
8972 important that we use make_friend_class since it will
8973 perform some error-checking and output cross-reference
8975 ++processing_template_decl
;
8977 if (friend_type
!= error_mark_node
)
8978 make_friend_class (type
, friend_type
, /*complain=*/false);
8980 if (adjust_processing_template_decl
)
8981 --processing_template_decl
;
8985 /* Build new DECL_FRIENDLIST. */
8988 /* The file and line for this declaration, to
8989 assist in error message reporting. Since we
8990 called push_tinst_level above, we don't need to
8992 input_location
= DECL_SOURCE_LOCATION (t
);
8994 if (TREE_CODE (t
) == TEMPLATE_DECL
)
8996 ++processing_template_decl
;
8997 push_deferring_access_checks (dk_no_check
);
9000 r
= tsubst_friend_function (t
, args
);
9001 add_friend (type
, r
, /*complain=*/false);
9002 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9004 pop_deferring_access_checks ();
9005 --processing_template_decl
;
9011 if (tree expr
= CLASSTYPE_LAMBDA_EXPR (type
))
9013 tree decl
= lambda_function (type
);
9016 instantiate_decl (decl
, false, false);
9018 /* We need to instantiate the capture list from the template
9019 after we've instantiated the closure members, but before we
9020 consider adding the conversion op. Also keep any captures
9021 that may have been added during instantiation of the op(). */
9022 tree tmpl_expr
= CLASSTYPE_LAMBDA_EXPR (pattern
);
9024 = tsubst_copy_and_build (LAMBDA_EXPR_CAPTURE_LIST (tmpl_expr
),
9025 args
, tf_warning_or_error
, NULL_TREE
,
9028 LAMBDA_EXPR_CAPTURE_LIST (expr
)
9029 = chainon (tmpl_cap
, nreverse (LAMBDA_EXPR_CAPTURE_LIST (expr
)));
9031 maybe_add_lambda_conv_op (type
);
9034 gcc_assert (errorcount
);
9037 /* Set the file and line number information to whatever is given for
9038 the class itself. This puts error messages involving generated
9039 implicit functions at a predictable point, and the same point
9040 that would be used for non-template classes. */
9041 input_location
= DECL_SOURCE_LOCATION (typedecl
);
9043 unreverse_member_declarations (type
);
9044 finish_struct_1 (type
);
9045 TYPE_BEING_DEFINED (type
) = 0;
9047 /* We don't instantiate default arguments for member functions. 14.7.1:
9049 The implicit instantiation of a class template specialization causes
9050 the implicit instantiation of the declarations, but not of the
9051 definitions or default arguments, of the class member functions,
9052 member classes, static data members and member templates.... */
9054 /* Some typedefs referenced from within the template code need to be access
9055 checked at template instantiation time, i.e now. These types were
9056 added to the template at parsing time. Let's get those and perform
9057 the access checks then. */
9058 perform_typedefs_access_check (pattern
, args
);
9059 perform_deferred_access_checks (tf_warning_or_error
);
9060 pop_nested_class ();
9061 maximum_field_alignment
= saved_maximum_field_alignment
;
9063 pop_from_top_level ();
9064 pop_deferring_access_checks ();
9067 /* The vtable for a template class can be emitted in any translation
9068 unit in which the class is instantiated. When there is no key
9069 method, however, finish_struct_1 will already have added TYPE to
9070 the keyed_classes list. */
9071 if (TYPE_CONTAINS_VPTR_P (type
) && CLASSTYPE_KEY_METHOD (type
))
9072 keyed_classes
= tree_cons (NULL_TREE
, type
, keyed_classes
);
9077 /* Wrapper for instantiate_class_template_1. */
9080 instantiate_class_template (tree type
)
9083 timevar_push (TV_TEMPLATE_INST
);
9084 ret
= instantiate_class_template_1 (type
);
9085 timevar_pop (TV_TEMPLATE_INST
);
9090 tsubst_template_arg (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
9096 else if (TYPE_P (t
))
9097 r
= tsubst (t
, args
, complain
, in_decl
);
9100 if (!(complain
& tf_warning
))
9101 ++c_inhibit_evaluation_warnings
;
9102 r
= tsubst_expr (t
, args
, complain
, in_decl
,
9103 /*integral_constant_expression_p=*/true);
9104 if (!(complain
& tf_warning
))
9105 --c_inhibit_evaluation_warnings
;
9106 /* Preserve the raw-reference nature of T. */
9107 if (TREE_TYPE (t
) && TREE_CODE (TREE_TYPE (t
)) == REFERENCE_TYPE
9108 && REFERENCE_REF_P (r
))
9109 r
= TREE_OPERAND (r
, 0);
9114 /* Given a function parameter pack TMPL_PARM and some function parameters
9115 instantiated from it at *SPEC_P, return a NONTYPE_ARGUMENT_PACK of them
9116 and set *SPEC_P to point at the next point in the list. */
9119 extract_fnparm_pack (tree tmpl_parm
, tree
*spec_p
)
9121 /* Collect all of the extra "packed" parameters into an
9125 tree argpack
= make_node (NONTYPE_ARGUMENT_PACK
);
9126 tree argtypepack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
9127 tree spec_parm
= *spec_p
;
9130 for (len
= 0; spec_parm
; ++len
, spec_parm
= TREE_CHAIN (spec_parm
))
9132 && !function_parameter_expanded_from_pack_p (spec_parm
, tmpl_parm
))
9135 /* Fill in PARMVEC and PARMTYPEVEC with all of the parameters. */
9136 parmvec
= make_tree_vec (len
);
9137 parmtypevec
= make_tree_vec (len
);
9138 spec_parm
= *spec_p
;
9139 for (i
= 0; i
< len
; i
++, spec_parm
= DECL_CHAIN (spec_parm
))
9141 TREE_VEC_ELT (parmvec
, i
) = spec_parm
;
9142 TREE_VEC_ELT (parmtypevec
, i
) = TREE_TYPE (spec_parm
);
9145 /* Build the argument packs. */
9146 SET_ARGUMENT_PACK_ARGS (argpack
, parmvec
);
9147 SET_ARGUMENT_PACK_ARGS (argtypepack
, parmtypevec
);
9148 TREE_TYPE (argpack
) = argtypepack
;
9149 *spec_p
= spec_parm
;
9154 /* Give a chain SPEC_PARM of PARM_DECLs, pack them into a
9155 NONTYPE_ARGUMENT_PACK. */
9158 make_fnparm_pack (tree spec_parm
)
9160 return extract_fnparm_pack (NULL_TREE
, &spec_parm
);
9163 /* Return true iff the Ith element of the argument pack ARG_PACK is a
9167 argument_pack_element_is_expansion_p (tree arg_pack
, int i
)
9169 tree vec
= ARGUMENT_PACK_ARGS (arg_pack
);
9170 if (i
>= TREE_VEC_LENGTH (vec
))
9172 return PACK_EXPANSION_P (TREE_VEC_ELT (vec
, i
));
9176 /* Creates and return an ARGUMENT_PACK_SELECT tree node. */
9179 make_argument_pack_select (tree arg_pack
, unsigned index
)
9181 tree aps
= make_node (ARGUMENT_PACK_SELECT
);
9183 ARGUMENT_PACK_SELECT_FROM_PACK (aps
) = arg_pack
;
9184 ARGUMENT_PACK_SELECT_INDEX (aps
) = index
;
9189 /* This is a subroutine of tsubst_pack_expansion.
9191 It returns TRUE if we need to use the PACK_EXPANSION_EXTRA_ARGS
9192 mechanism to store the (non complete list of) arguments of the
9193 substitution and return a non substituted pack expansion, in order
9194 to wait for when we have enough arguments to really perform the
9198 use_pack_expansion_extra_args_p (tree parm_packs
,
9202 if (parm_packs
== NULL_TREE
)
9205 bool has_expansion_arg
= false;
9206 for (int i
= 0 ; i
< arg_pack_len
; ++i
)
9208 bool has_non_expansion_arg
= false;
9209 for (tree parm_pack
= parm_packs
;
9211 parm_pack
= TREE_CHAIN (parm_pack
))
9213 tree arg
= TREE_VALUE (parm_pack
);
9215 if (argument_pack_element_is_expansion_p (arg
, i
))
9216 has_expansion_arg
= true;
9218 has_non_expansion_arg
= true;
9221 /* If one pack has an expansion and another pack has a normal
9222 argument or if one pack has an empty argument another one
9223 hasn't then tsubst_pack_expansion cannot perform the
9224 substitution and need to fall back on the
9225 PACK_EXPANSION_EXTRA mechanism. */
9226 if ((has_expansion_arg
&& has_non_expansion_arg
)
9227 || (has_empty_arg
&& (has_expansion_arg
|| has_non_expansion_arg
)))
9233 /* [temp.variadic]/6 says that:
9235 The instantiation of a pack expansion [...]
9236 produces a list E1,E2, ..., En, where N is the number of elements
9237 in the pack expansion parameters.
9239 This subroutine of tsubst_pack_expansion produces one of these Ei.
9241 PATTERN is the pattern of the pack expansion. PARM_PACKS is a
9242 TREE_LIST in which each TREE_PURPOSE is a parameter pack of
9243 PATTERN, and each TREE_VALUE is its corresponding argument pack.
9244 INDEX is the index 'i' of the element Ei to produce. ARGS,
9245 COMPLAIN, and IN_DECL are the same parameters as for the
9246 tsubst_pack_expansion function.
9248 The function returns the resulting Ei upon successful completion,
9251 Note that this function possibly modifies the ARGS parameter, so
9252 it's the responsibility of the caller to restore it. */
9255 gen_elem_of_pack_expansion_instantiation (tree pattern
,
9258 tree args
/* This parm gets
9260 tsubst_flags_t complain
,
9264 bool ith_elem_is_expansion
= false;
9266 /* For each parameter pack, change the substitution of the parameter
9267 pack to the ith argument in its argument pack, then expand the
9269 for (tree pack
= parm_packs
; pack
; pack
= TREE_CHAIN (pack
))
9271 tree parm
= TREE_PURPOSE (pack
);
9272 tree arg_pack
= TREE_VALUE (pack
);
9273 tree aps
; /* instance of ARGUMENT_PACK_SELECT. */
9275 ith_elem_is_expansion
|=
9276 argument_pack_element_is_expansion_p (arg_pack
, index
);
9278 /* Select the Ith argument from the pack. */
9279 if (TREE_CODE (parm
) == PARM_DECL
)
9283 aps
= make_argument_pack_select (arg_pack
, index
);
9285 register_local_specialization (aps
, parm
);
9288 aps
= retrieve_local_specialization (parm
);
9293 template_parm_level_and_index (parm
, &level
, &idx
);
9297 aps
= make_argument_pack_select (arg_pack
, index
);
9298 /* Update the corresponding argument. */
9299 TMPL_ARG (args
, level
, idx
) = aps
;
9302 /* Re-use the ARGUMENT_PACK_SELECT. */
9303 aps
= TMPL_ARG (args
, level
, idx
);
9305 ARGUMENT_PACK_SELECT_INDEX (aps
) = index
;
9308 /* Substitute into the PATTERN with the (possibly altered)
9310 if (!TYPE_P (pattern
))
9311 t
= tsubst_expr (pattern
, args
, complain
, in_decl
,
9312 /*integral_constant_expression_p=*/false);
9314 t
= tsubst (pattern
, args
, complain
, in_decl
);
9316 /* If the Ith argument pack element is a pack expansion, then
9317 the Ith element resulting from the substituting is going to
9318 be a pack expansion as well. */
9319 if (ith_elem_is_expansion
)
9320 t
= make_pack_expansion (t
);
9325 /* Substitute ARGS into T, which is an pack expansion
9326 (i.e. TYPE_PACK_EXPANSION or EXPR_PACK_EXPANSION). Returns a
9327 TREE_VEC with the substituted arguments, a PACK_EXPANSION_* node
9328 (if only a partial substitution could be performed) or
9329 ERROR_MARK_NODE if there was an error. */
9331 tsubst_pack_expansion (tree t
, tree args
, tsubst_flags_t complain
,
9335 tree pack
, packs
= NULL_TREE
;
9336 bool unsubstituted_packs
= false;
9339 struct pointer_map_t
*saved_local_specializations
= NULL
;
9340 bool need_local_specializations
= false;
9343 gcc_assert (PACK_EXPANSION_P (t
));
9344 pattern
= PACK_EXPANSION_PATTERN (t
);
9346 /* Add in any args remembered from an earlier partial instantiation. */
9347 args
= add_to_template_args (PACK_EXPANSION_EXTRA_ARGS (t
), args
);
9349 levels
= TMPL_ARGS_DEPTH (args
);
9351 /* Determine the argument packs that will instantiate the parameter
9352 packs used in the expansion expression. While we're at it,
9353 compute the number of arguments to be expanded and make sure it
9355 for (pack
= PACK_EXPANSION_PARAMETER_PACKS (t
); pack
;
9356 pack
= TREE_CHAIN (pack
))
9358 tree parm_pack
= TREE_VALUE (pack
);
9359 tree arg_pack
= NULL_TREE
;
9360 tree orig_arg
= NULL_TREE
;
9363 if (TREE_CODE (parm_pack
) == BASES
)
9365 if (BASES_DIRECT (parm_pack
))
9366 return calculate_direct_bases (tsubst_expr (BASES_TYPE (parm_pack
),
9367 args
, complain
, in_decl
, false));
9369 return calculate_bases (tsubst_expr (BASES_TYPE (parm_pack
),
9370 args
, complain
, in_decl
, false));
9372 if (TREE_CODE (parm_pack
) == PARM_DECL
)
9374 if (PACK_EXPANSION_LOCAL_P (t
))
9375 arg_pack
= retrieve_local_specialization (parm_pack
);
9378 /* We can't rely on local_specializations for a parameter
9379 name used later in a function declaration (such as in a
9380 late-specified return type). Even if it exists, it might
9381 have the wrong value for a recursive call. Just make a
9382 dummy decl, since it's only used for its type. */
9383 arg_pack
= tsubst_decl (parm_pack
, args
, complain
);
9384 if (arg_pack
&& FUNCTION_PARAMETER_PACK_P (arg_pack
))
9385 /* Partial instantiation of the parm_pack, we can't build
9386 up an argument pack yet. */
9387 arg_pack
= NULL_TREE
;
9389 arg_pack
= make_fnparm_pack (arg_pack
);
9390 need_local_specializations
= true;
9396 template_parm_level_and_index (parm_pack
, &level
, &idx
);
9398 if (level
<= levels
)
9399 arg_pack
= TMPL_ARG (args
, level
, idx
);
9402 orig_arg
= arg_pack
;
9403 if (arg_pack
&& TREE_CODE (arg_pack
) == ARGUMENT_PACK_SELECT
)
9404 arg_pack
= ARGUMENT_PACK_SELECT_FROM_PACK (arg_pack
);
9406 if (arg_pack
&& !ARGUMENT_PACK_P (arg_pack
))
9407 /* This can only happen if we forget to expand an argument
9408 pack somewhere else. Just return an error, silently. */
9410 result
= make_tree_vec (1);
9411 TREE_VEC_ELT (result
, 0) = error_mark_node
;
9418 TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg_pack
));
9420 /* Don't bother trying to do a partial substitution with
9421 incomplete packs; we'll try again after deduction. */
9422 if (ARGUMENT_PACK_INCOMPLETE_P (arg_pack
))
9427 else if (len
!= my_len
)
9429 if (!(complain
& tf_error
))
9430 /* Fail quietly. */;
9431 else if (TREE_CODE (t
) == TYPE_PACK_EXPANSION
)
9432 error ("mismatched argument pack lengths while expanding "
9436 error ("mismatched argument pack lengths while expanding "
9439 return error_mark_node
;
9442 /* Keep track of the parameter packs and their corresponding
9444 packs
= tree_cons (parm_pack
, arg_pack
, packs
);
9445 TREE_TYPE (packs
) = orig_arg
;
9449 /* We can't substitute for this parameter pack. We use a flag as
9450 well as the missing_level counter because function parameter
9451 packs don't have a level. */
9452 unsubstituted_packs
= true;
9456 /* We cannot expand this expansion expression, because we don't have
9457 all of the argument packs we need. */
9458 if (use_pack_expansion_extra_args_p (packs
, len
, unsubstituted_packs
))
9460 /* We got some full packs, but we can't substitute them in until we
9461 have values for all the packs. So remember these until then. */
9463 t
= make_pack_expansion (pattern
);
9464 PACK_EXPANSION_EXTRA_ARGS (t
) = args
;
9467 else if (unsubstituted_packs
)
9469 /* There were no real arguments, we're just replacing a parameter
9470 pack with another version of itself. Substitute into the
9471 pattern and return a PACK_EXPANSION_*. The caller will need to
9473 if (TREE_CODE (t
) == EXPR_PACK_EXPANSION
)
9474 t
= tsubst_expr (pattern
, args
, complain
, in_decl
,
9475 /*integral_constant_expression_p=*/false);
9477 t
= tsubst (pattern
, args
, complain
, in_decl
);
9478 t
= make_pack_expansion (t
);
9482 gcc_assert (len
>= 0);
9484 if (need_local_specializations
)
9486 /* We're in a late-specified return type, so create our own local
9487 specializations map; the current map is either NULL or (in the
9488 case of recursive unification) might have bindings that we don't
9489 want to use or alter. */
9490 saved_local_specializations
= local_specializations
;
9491 local_specializations
= pointer_map_create ();
9494 /* For each argument in each argument pack, substitute into the
9496 result
= make_tree_vec (len
);
9497 for (i
= 0; i
< len
; ++i
)
9499 t
= gen_elem_of_pack_expansion_instantiation (pattern
, packs
,
9503 TREE_VEC_ELT (result
, i
) = t
;
9504 if (t
== error_mark_node
)
9506 result
= error_mark_node
;
9511 /* Update ARGS to restore the substitution from parameter packs to
9512 their argument packs. */
9513 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
9515 tree parm
= TREE_PURPOSE (pack
);
9517 if (TREE_CODE (parm
) == PARM_DECL
)
9518 register_local_specialization (TREE_TYPE (pack
), parm
);
9523 if (TREE_VALUE (pack
) == NULL_TREE
)
9526 template_parm_level_and_index (parm
, &level
, &idx
);
9528 /* Update the corresponding argument. */
9529 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
9530 TREE_VEC_ELT (TREE_VEC_ELT (args
, level
-1 ), idx
) =
9533 TREE_VEC_ELT (args
, idx
) = TREE_TYPE (pack
);
9537 if (need_local_specializations
)
9539 pointer_map_destroy (local_specializations
);
9540 local_specializations
= saved_local_specializations
;
9546 /* Given PARM_DECL PARM, find the corresponding PARM_DECL in the template
9547 TMPL. We do this using DECL_PARM_INDEX, which should work even with
9548 parameter packs; all parms generated from a function parameter pack will
9549 have the same DECL_PARM_INDEX. */
9552 get_pattern_parm (tree parm
, tree tmpl
)
9554 tree pattern
= DECL_TEMPLATE_RESULT (tmpl
);
9557 if (DECL_ARTIFICIAL (parm
))
9559 for (patparm
= DECL_ARGUMENTS (pattern
);
9560 patparm
; patparm
= DECL_CHAIN (patparm
))
9561 if (DECL_ARTIFICIAL (patparm
)
9562 && DECL_NAME (parm
) == DECL_NAME (patparm
))
9567 patparm
= FUNCTION_FIRST_USER_PARM (DECL_TEMPLATE_RESULT (tmpl
));
9568 patparm
= chain_index (DECL_PARM_INDEX (parm
)-1, patparm
);
9569 gcc_assert (DECL_PARM_INDEX (patparm
)
9570 == DECL_PARM_INDEX (parm
));
9576 /* Substitute ARGS into the vector or list of template arguments T. */
9579 tsubst_template_args (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
9582 int len
, need_new
= 0, i
, expanded_len_adjust
= 0, out
;
9585 if (t
== error_mark_node
)
9586 return error_mark_node
;
9588 len
= TREE_VEC_LENGTH (t
);
9589 elts
= XALLOCAVEC (tree
, len
);
9591 for (i
= 0; i
< len
; i
++)
9593 tree orig_arg
= TREE_VEC_ELT (t
, i
);
9596 if (TREE_CODE (orig_arg
) == TREE_VEC
)
9597 new_arg
= tsubst_template_args (orig_arg
, args
, complain
, in_decl
);
9598 else if (PACK_EXPANSION_P (orig_arg
))
9600 /* Substitute into an expansion expression. */
9601 new_arg
= tsubst_pack_expansion (orig_arg
, args
, complain
, in_decl
);
9603 if (TREE_CODE (new_arg
) == TREE_VEC
)
9604 /* Add to the expanded length adjustment the number of
9605 expanded arguments. We subtract one from this
9606 measurement, because the argument pack expression
9607 itself is already counted as 1 in
9608 LEN. EXPANDED_LEN_ADJUST can actually be negative, if
9609 the argument pack is empty. */
9610 expanded_len_adjust
+= TREE_VEC_LENGTH (new_arg
) - 1;
9612 else if (ARGUMENT_PACK_P (orig_arg
))
9614 /* Substitute into each of the arguments. */
9615 new_arg
= TYPE_P (orig_arg
)
9616 ? cxx_make_type (TREE_CODE (orig_arg
))
9617 : make_node (TREE_CODE (orig_arg
));
9619 SET_ARGUMENT_PACK_ARGS (
9621 tsubst_template_args (ARGUMENT_PACK_ARGS (orig_arg
),
9622 args
, complain
, in_decl
));
9624 if (ARGUMENT_PACK_ARGS (new_arg
) == error_mark_node
)
9625 new_arg
= error_mark_node
;
9627 if (TREE_CODE (new_arg
) == NONTYPE_ARGUMENT_PACK
) {
9628 TREE_TYPE (new_arg
) = tsubst (TREE_TYPE (orig_arg
), args
,
9630 TREE_CONSTANT (new_arg
) = TREE_CONSTANT (orig_arg
);
9632 if (TREE_TYPE (new_arg
) == error_mark_node
)
9633 new_arg
= error_mark_node
;
9637 new_arg
= tsubst_template_arg (orig_arg
, args
, complain
, in_decl
);
9639 if (new_arg
== error_mark_node
)
9640 return error_mark_node
;
9643 if (new_arg
!= orig_arg
)
9650 /* Make space for the expanded arguments coming from template
9652 t
= make_tree_vec (len
+ expanded_len_adjust
);
9653 /* ORIG_T can contain TREE_VECs. That happens if ORIG_T contains the
9654 arguments for a member template.
9655 In that case each TREE_VEC in ORIG_T represents a level of template
9656 arguments, and ORIG_T won't carry any non defaulted argument count.
9657 It will rather be the nested TREE_VECs that will carry one.
9658 In other words, ORIG_T carries a non defaulted argument count only
9659 if it doesn't contain any nested TREE_VEC. */
9660 if (NON_DEFAULT_TEMPLATE_ARGS_COUNT (orig_t
))
9662 int count
= GET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (orig_t
);
9663 count
+= expanded_len_adjust
;
9664 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (t
, count
);
9666 for (i
= 0, out
= 0; i
< len
; i
++)
9668 if ((PACK_EXPANSION_P (TREE_VEC_ELT (orig_t
, i
))
9669 || ARGUMENT_PACK_P (TREE_VEC_ELT (orig_t
, i
)))
9670 && TREE_CODE (elts
[i
]) == TREE_VEC
)
9674 /* Now expand the template argument pack "in place". */
9675 for (idx
= 0; idx
< TREE_VEC_LENGTH (elts
[i
]); idx
++, out
++)
9676 TREE_VEC_ELT (t
, out
) = TREE_VEC_ELT (elts
[i
], idx
);
9680 TREE_VEC_ELT (t
, out
) = elts
[i
];
9688 /* Return the result of substituting ARGS into the template parameters
9689 given by PARMS. If there are m levels of ARGS and m + n levels of
9690 PARMS, then the result will contain n levels of PARMS. For
9691 example, if PARMS is `template <class T> template <class U>
9692 template <T*, U, class V>' and ARGS is {{int}, {double}} then the
9693 result will be `template <int*, double, class V>'. */
9696 tsubst_template_parms (tree parms
, tree args
, tsubst_flags_t complain
)
9701 /* When substituting into a template, we must set
9702 PROCESSING_TEMPLATE_DECL as the template parameters may be
9703 dependent if they are based on one-another, and the dependency
9704 predicates are short-circuit outside of templates. */
9705 ++processing_template_decl
;
9707 for (new_parms
= &r
;
9708 parms
&& TMPL_PARMS_DEPTH (parms
) > TMPL_ARGS_DEPTH (args
);
9709 new_parms
= &(TREE_CHAIN (*new_parms
)),
9710 parms
= TREE_CHAIN (parms
))
9713 make_tree_vec (TREE_VEC_LENGTH (TREE_VALUE (parms
)));
9716 for (i
= 0; i
< TREE_VEC_LENGTH (new_vec
); ++i
)
9720 if (parms
== error_mark_node
)
9723 tuple
= TREE_VEC_ELT (TREE_VALUE (parms
), i
);
9725 if (tuple
== error_mark_node
)
9728 TREE_VEC_ELT (new_vec
, i
) =
9729 tsubst_template_parm (tuple
, args
, complain
);
9733 tree_cons (size_int (TMPL_PARMS_DEPTH (parms
)
9734 - TMPL_ARGS_DEPTH (args
)),
9735 new_vec
, NULL_TREE
);
9738 --processing_template_decl
;
9743 /* Return the result of substituting ARGS into one template parameter
9744 given by T. T Must be a TREE_LIST which TREE_VALUE is the template
9745 parameter and which TREE_PURPOSE is the default argument of the
9746 template parameter. */
9749 tsubst_template_parm (tree t
, tree args
, tsubst_flags_t complain
)
9751 tree default_value
, parm_decl
;
9753 if (args
== NULL_TREE
9755 || t
== error_mark_node
)
9758 gcc_assert (TREE_CODE (t
) == TREE_LIST
);
9760 default_value
= TREE_PURPOSE (t
);
9761 parm_decl
= TREE_VALUE (t
);
9763 parm_decl
= tsubst (parm_decl
, args
, complain
, NULL_TREE
);
9764 if (TREE_CODE (parm_decl
) == PARM_DECL
9765 && invalid_nontype_parm_type_p (TREE_TYPE (parm_decl
), complain
))
9766 parm_decl
= error_mark_node
;
9767 default_value
= tsubst_template_arg (default_value
, args
,
9768 complain
, NULL_TREE
);
9770 return build_tree_list (default_value
, parm_decl
);
9773 /* Substitute the ARGS into the indicated aggregate (or enumeration)
9774 type T. If T is not an aggregate or enumeration type, it is
9775 handled as if by tsubst. IN_DECL is as for tsubst. If
9776 ENTERING_SCOPE is nonzero, T is the context for a template which
9777 we are presently tsubst'ing. Return the substituted value. */
9780 tsubst_aggr_type (tree t
,
9782 tsubst_flags_t complain
,
9789 switch (TREE_CODE (t
))
9792 if (TYPE_PTRMEMFUNC_P (t
))
9793 return tsubst (TYPE_PTRMEMFUNC_FN_TYPE (t
), args
, complain
, in_decl
);
9795 /* Else fall through. */
9798 if (TYPE_TEMPLATE_INFO (t
) && uses_template_parms (t
))
9803 int saved_unevaluated_operand
;
9804 int saved_inhibit_evaluation_warnings
;
9806 /* In "sizeof(X<I>)" we need to evaluate "I". */
9807 saved_unevaluated_operand
= cp_unevaluated_operand
;
9808 cp_unevaluated_operand
= 0;
9809 saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
9810 c_inhibit_evaluation_warnings
= 0;
9812 /* First, determine the context for the type we are looking
9814 context
= TYPE_CONTEXT (t
);
9815 if (context
&& TYPE_P (context
))
9817 context
= tsubst_aggr_type (context
, args
, complain
,
9818 in_decl
, /*entering_scope=*/1);
9819 /* If context is a nested class inside a class template,
9820 it may still need to be instantiated (c++/33959). */
9821 context
= complete_type (context
);
9824 /* Then, figure out what arguments are appropriate for the
9825 type we are trying to find. For example, given:
9827 template <class T> struct S;
9828 template <class T, class U> void f(T, U) { S<U> su; }
9830 and supposing that we are instantiating f<int, double>,
9831 then our ARGS will be {int, double}, but, when looking up
9832 S we only want {double}. */
9833 argvec
= tsubst_template_args (TYPE_TI_ARGS (t
), args
,
9835 if (argvec
== error_mark_node
)
9836 r
= error_mark_node
;
9839 r
= lookup_template_class (t
, argvec
, in_decl
, context
,
9840 entering_scope
, complain
);
9841 r
= cp_build_qualified_type_real (r
, cp_type_quals (t
), complain
);
9844 cp_unevaluated_operand
= saved_unevaluated_operand
;
9845 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
9850 /* This is not a template type, so there's nothing to do. */
9854 return tsubst (t
, args
, complain
, in_decl
);
9858 /* Substitute into the default argument ARG (a default argument for
9859 FN), which has the indicated TYPE. */
9862 tsubst_default_argument (tree fn
, tree type
, tree arg
)
9864 tree saved_class_ptr
= NULL_TREE
;
9865 tree saved_class_ref
= NULL_TREE
;
9866 int errs
= errorcount
+ sorrycount
;
9868 /* This can happen in invalid code. */
9869 if (TREE_CODE (arg
) == DEFAULT_ARG
)
9872 /* This default argument came from a template. Instantiate the
9873 default argument here, not in tsubst. In the case of
9882 we must be careful to do name lookup in the scope of S<T>,
9883 rather than in the current class. */
9884 push_access_scope (fn
);
9885 /* The "this" pointer is not valid in a default argument. */
9888 saved_class_ptr
= current_class_ptr
;
9889 cp_function_chain
->x_current_class_ptr
= NULL_TREE
;
9890 saved_class_ref
= current_class_ref
;
9891 cp_function_chain
->x_current_class_ref
= NULL_TREE
;
9894 push_deferring_access_checks(dk_no_deferred
);
9895 /* The default argument expression may cause implicitly defined
9896 member functions to be synthesized, which will result in garbage
9897 collection. We must treat this situation as if we were within
9898 the body of function so as to avoid collecting live data on the
9901 arg
= tsubst_expr (arg
, DECL_TI_ARGS (fn
),
9902 tf_warning_or_error
, NULL_TREE
,
9903 /*integral_constant_expression_p=*/false);
9905 pop_deferring_access_checks();
9907 /* Restore the "this" pointer. */
9910 cp_function_chain
->x_current_class_ptr
= saved_class_ptr
;
9911 cp_function_chain
->x_current_class_ref
= saved_class_ref
;
9914 if (errorcount
+sorrycount
> errs
)
9915 inform (input_location
,
9916 " when instantiating default argument for call to %D", fn
);
9918 /* Make sure the default argument is reasonable. */
9919 arg
= check_default_argument (type
, arg
);
9921 pop_access_scope (fn
);
9926 /* Substitute into all the default arguments for FN. */
9929 tsubst_default_arguments (tree fn
)
9934 tmpl_args
= DECL_TI_ARGS (fn
);
9936 /* If this function is not yet instantiated, we certainly don't need
9937 its default arguments. */
9938 if (uses_template_parms (tmpl_args
))
9940 /* Don't do this again for clones. */
9941 if (DECL_CLONED_FUNCTION_P (fn
))
9944 for (arg
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
9946 arg
= TREE_CHAIN (arg
))
9947 if (TREE_PURPOSE (arg
))
9948 TREE_PURPOSE (arg
) = tsubst_default_argument (fn
,
9950 TREE_PURPOSE (arg
));
9953 /* Substitute the ARGS into the T, which is a _DECL. Return the
9954 result of the substitution. Issue error and warning messages under
9955 control of COMPLAIN. */
9958 tsubst_decl (tree t
, tree args
, tsubst_flags_t complain
)
9960 #define RETURN(EXP) do { r = (EXP); goto out; } while(0)
9961 location_t saved_loc
;
9966 /* Set the filename and linenumber to improve error-reporting. */
9967 saved_loc
= input_location
;
9968 input_location
= DECL_SOURCE_LOCATION (t
);
9970 switch (TREE_CODE (t
))
9974 /* We can get here when processing a member function template,
9975 member class template, or template template parameter. */
9976 tree decl
= DECL_TEMPLATE_RESULT (t
);
9981 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
9983 /* Template template parameter is treated here. */
9984 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
9985 if (new_type
== error_mark_node
)
9986 RETURN (error_mark_node
);
9987 /* If we get a real template back, return it. This can happen in
9988 the context of most_specialized_class. */
9989 if (TREE_CODE (new_type
) == TEMPLATE_DECL
)
9993 DECL_CHAIN (r
) = NULL_TREE
;
9994 TREE_TYPE (r
) = new_type
;
9995 DECL_TEMPLATE_RESULT (r
)
9996 = build_decl (DECL_SOURCE_LOCATION (decl
),
9997 TYPE_DECL
, DECL_NAME (decl
), new_type
);
9998 DECL_TEMPLATE_PARMS (r
)
9999 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
,
10001 TYPE_NAME (new_type
) = r
;
10005 /* We might already have an instance of this template.
10006 The ARGS are for the surrounding class type, so the
10007 full args contain the tsubst'd args for the context,
10008 plus the innermost args from the template decl. */
10009 tmpl_args
= DECL_CLASS_TEMPLATE_P (t
)
10010 ? CLASSTYPE_TI_ARGS (TREE_TYPE (t
))
10011 : DECL_TI_ARGS (DECL_TEMPLATE_RESULT (t
));
10012 /* Because this is a template, the arguments will still be
10013 dependent, even after substitution. If
10014 PROCESSING_TEMPLATE_DECL is not set, the dependency
10015 predicates will short-circuit. */
10016 ++processing_template_decl
;
10017 full_args
= tsubst_template_args (tmpl_args
, args
,
10018 complain
, in_decl
);
10019 --processing_template_decl
;
10020 if (full_args
== error_mark_node
)
10021 RETURN (error_mark_node
);
10023 /* If this is a default template template argument,
10024 tsubst might not have changed anything. */
10025 if (full_args
== tmpl_args
)
10028 hash
= hash_tmpl_and_args (t
, full_args
);
10029 spec
= retrieve_specialization (t
, full_args
, hash
);
10030 if (spec
!= NULL_TREE
)
10036 /* Make a new template decl. It will be similar to the
10037 original, but will record the current template arguments.
10038 We also create a new function declaration, which is just
10039 like the old one, but points to this new template, rather
10040 than the old one. */
10042 gcc_assert (DECL_LANG_SPECIFIC (r
) != 0);
10043 DECL_CHAIN (r
) = NULL_TREE
;
10045 DECL_TEMPLATE_INFO (r
) = build_template_info (t
, args
);
10047 if (TREE_CODE (decl
) == TYPE_DECL
10048 && !TYPE_DECL_ALIAS_P (decl
))
10051 ++processing_template_decl
;
10052 new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
10053 --processing_template_decl
;
10054 if (new_type
== error_mark_node
)
10055 RETURN (error_mark_node
);
10057 TREE_TYPE (r
) = new_type
;
10058 CLASSTYPE_TI_TEMPLATE (new_type
) = r
;
10059 DECL_TEMPLATE_RESULT (r
) = TYPE_MAIN_DECL (new_type
);
10060 DECL_TI_ARGS (r
) = CLASSTYPE_TI_ARGS (new_type
);
10061 DECL_CONTEXT (r
) = TYPE_CONTEXT (new_type
);
10066 ++processing_template_decl
;
10067 new_decl
= tsubst (decl
, args
, complain
, in_decl
);
10068 --processing_template_decl
;
10069 if (new_decl
== error_mark_node
)
10070 RETURN (error_mark_node
);
10072 DECL_TEMPLATE_RESULT (r
) = new_decl
;
10073 DECL_TI_TEMPLATE (new_decl
) = r
;
10074 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
10075 DECL_TI_ARGS (r
) = DECL_TI_ARGS (new_decl
);
10076 DECL_CONTEXT (r
) = DECL_CONTEXT (new_decl
);
10079 SET_DECL_IMPLICIT_INSTANTIATION (r
);
10080 DECL_TEMPLATE_INSTANTIATIONS (r
) = NULL_TREE
;
10081 DECL_TEMPLATE_SPECIALIZATIONS (r
) = NULL_TREE
;
10083 /* The template parameters for this new template are all the
10084 template parameters for the old template, except the
10085 outermost level of parameters. */
10086 DECL_TEMPLATE_PARMS (r
)
10087 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
,
10090 if (PRIMARY_TEMPLATE_P (t
))
10091 DECL_PRIMARY_TEMPLATE (r
) = r
;
10093 if (TREE_CODE (decl
) != TYPE_DECL
)
10094 /* Record this non-type partial instantiation. */
10095 register_specialization (r
, t
,
10096 DECL_TI_ARGS (DECL_TEMPLATE_RESULT (r
)),
10101 case FUNCTION_DECL
:
10104 tree argvec
= NULL_TREE
;
10112 /* Nobody should be tsubst'ing into non-template functions. */
10113 gcc_assert (DECL_TEMPLATE_INFO (t
) != NULL_TREE
);
10115 if (TREE_CODE (DECL_TI_TEMPLATE (t
)) == TEMPLATE_DECL
)
10120 /* If T is not dependent, just return it. We have to
10121 increment PROCESSING_TEMPLATE_DECL because
10122 value_dependent_expression_p assumes that nothing is
10123 dependent when PROCESSING_TEMPLATE_DECL is zero. */
10124 ++processing_template_decl
;
10125 dependent_p
= value_dependent_expression_p (t
);
10126 --processing_template_decl
;
10130 /* Calculate the most general template of which R is a
10131 specialization, and the complete set of arguments used to
10133 gen_tmpl
= most_general_template (DECL_TI_TEMPLATE (t
));
10134 argvec
= tsubst_template_args (DECL_TI_ARGS
10135 (DECL_TEMPLATE_RESULT
10136 (DECL_TI_TEMPLATE (t
))),
10137 args
, complain
, in_decl
);
10138 if (argvec
== error_mark_node
)
10139 RETURN (error_mark_node
);
10141 /* Check to see if we already have this specialization. */
10142 hash
= hash_tmpl_and_args (gen_tmpl
, argvec
);
10143 spec
= retrieve_specialization (gen_tmpl
, argvec
, hash
);
10151 /* We can see more levels of arguments than parameters if
10152 there was a specialization of a member template, like
10155 template <class T> struct S { template <class U> void f(); }
10156 template <> template <class U> void S<int>::f(U);
10158 Here, we'll be substituting into the specialization,
10159 because that's where we can find the code we actually
10160 want to generate, but we'll have enough arguments for
10161 the most general template.
10163 We also deal with the peculiar case:
10165 template <class T> struct S {
10166 template <class U> friend void f();
10168 template <class U> void f() {}
10170 template void f<double>();
10172 Here, the ARGS for the instantiation of will be {int,
10173 double}. But, we only need as many ARGS as there are
10174 levels of template parameters in CODE_PATTERN. We are
10175 careful not to get fooled into reducing the ARGS in
10178 template <class T> struct S { template <class U> void f(U); }
10179 template <class T> template <> void S<T>::f(int) {}
10181 which we can spot because the pattern will be a
10182 specialization in this case. */
10183 args_depth
= TMPL_ARGS_DEPTH (args
);
10185 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (t
)));
10186 if (args_depth
> parms_depth
10187 && !DECL_TEMPLATE_SPECIALIZATION (t
))
10188 args
= get_innermost_template_args (args
, parms_depth
);
10192 /* This special case arises when we have something like this:
10194 template <class T> struct S {
10195 friend void f<int>(int, double);
10198 Here, the DECL_TI_TEMPLATE for the friend declaration
10199 will be an IDENTIFIER_NODE. We are being called from
10200 tsubst_friend_function, and we want only to create a
10201 new decl (R) with appropriate types so that we can call
10202 determine_specialization. */
10203 gen_tmpl
= NULL_TREE
;
10206 if (DECL_CLASS_SCOPE_P (t
))
10208 if (DECL_NAME (t
) == constructor_name (DECL_CONTEXT (t
)))
10212 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
,
10213 complain
, t
, /*entering_scope=*/1);
10218 ctx
= DECL_CONTEXT (t
);
10220 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
10221 if (type
== error_mark_node
)
10222 RETURN (error_mark_node
);
10224 /* If we hit excessive deduction depth, the type is bogus even if
10225 it isn't error_mark_node, so don't build a decl. */
10226 if (excessive_deduction_depth
)
10227 RETURN (error_mark_node
);
10229 /* We do NOT check for matching decls pushed separately at this
10230 point, as they may not represent instantiations of this
10231 template, and in any case are considered separate under the
10234 DECL_USE_TEMPLATE (r
) = 0;
10235 TREE_TYPE (r
) = type
;
10236 /* Clear out the mangled name and RTL for the instantiation. */
10237 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
10238 SET_DECL_RTL (r
, NULL
);
10239 /* Leave DECL_INITIAL set on deleted instantiations. */
10240 if (!DECL_DELETED_FN (r
))
10241 DECL_INITIAL (r
) = NULL_TREE
;
10242 DECL_CONTEXT (r
) = ctx
;
10244 if (member
&& DECL_CONV_FN_P (r
))
10245 /* Type-conversion operator. Reconstruct the name, in
10246 case it's the name of one of the template's parameters. */
10247 DECL_NAME (r
) = mangle_conv_op_name_for_type (TREE_TYPE (type
));
10249 DECL_ARGUMENTS (r
) = tsubst (DECL_ARGUMENTS (t
), args
,
10251 DECL_RESULT (r
) = NULL_TREE
;
10253 TREE_STATIC (r
) = 0;
10254 TREE_PUBLIC (r
) = TREE_PUBLIC (t
);
10255 DECL_EXTERNAL (r
) = 1;
10256 /* If this is an instantiation of a function with internal
10257 linkage, we already know what object file linkage will be
10258 assigned to the instantiation. */
10259 DECL_INTERFACE_KNOWN (r
) = !TREE_PUBLIC (r
);
10260 DECL_DEFER_OUTPUT (r
) = 0;
10261 DECL_CHAIN (r
) = NULL_TREE
;
10262 DECL_PENDING_INLINE_INFO (r
) = 0;
10263 DECL_PENDING_INLINE_P (r
) = 0;
10264 DECL_SAVED_TREE (r
) = NULL_TREE
;
10265 DECL_STRUCT_FUNCTION (r
) = NULL
;
10267 /* We'll re-clone as appropriate in instantiate_template. */
10268 DECL_CLONED_FUNCTION (r
) = NULL_TREE
;
10270 /* If we aren't complaining now, return on error before we register
10271 the specialization so that we'll complain eventually. */
10272 if ((complain
& tf_error
) == 0
10273 && IDENTIFIER_OPNAME_P (DECL_NAME (r
))
10274 && !grok_op_properties (r
, /*complain=*/false))
10275 RETURN (error_mark_node
);
10277 /* Set up the DECL_TEMPLATE_INFO for R. There's no need to do
10278 this in the special friend case mentioned above where
10279 GEN_TMPL is NULL. */
10282 DECL_TEMPLATE_INFO (r
)
10283 = build_template_info (gen_tmpl
, argvec
);
10284 SET_DECL_IMPLICIT_INSTANTIATION (r
);
10287 = register_specialization (r
, gen_tmpl
, argvec
, false, hash
);
10289 /* We instantiated this while substituting into
10290 the type earlier (template/friend54.C). */
10293 /* We're not supposed to instantiate default arguments
10294 until they are called, for a template. But, for a
10297 template <class T> void f ()
10298 { extern void g(int i = T()); }
10300 we should do the substitution when the template is
10301 instantiated. We handle the member function case in
10302 instantiate_class_template since the default arguments
10303 might refer to other members of the class. */
10305 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
10306 && !uses_template_parms (argvec
))
10307 tsubst_default_arguments (r
);
10310 DECL_TEMPLATE_INFO (r
) = NULL_TREE
;
10312 /* Copy the list of befriending classes. */
10313 for (friends
= &DECL_BEFRIENDING_CLASSES (r
);
10315 friends
= &TREE_CHAIN (*friends
))
10317 *friends
= copy_node (*friends
);
10318 TREE_VALUE (*friends
) = tsubst (TREE_VALUE (*friends
),
10323 if (DECL_CONSTRUCTOR_P (r
) || DECL_DESTRUCTOR_P (r
))
10325 maybe_retrofit_in_chrg (r
);
10326 if (DECL_CONSTRUCTOR_P (r
))
10327 grok_ctor_properties (ctx
, r
);
10328 if (DECL_INHERITED_CTOR_BASE (r
))
10329 deduce_inheriting_ctor (r
);
10330 /* If this is an instantiation of a member template, clone it.
10331 If it isn't, that'll be handled by
10332 clone_constructors_and_destructors. */
10333 if (PRIMARY_TEMPLATE_P (gen_tmpl
))
10334 clone_function_decl (r
, /*update_method_vec_p=*/0);
10336 else if ((complain
& tf_error
) != 0
10337 && IDENTIFIER_OPNAME_P (DECL_NAME (r
))
10338 && !grok_op_properties (r
, /*complain=*/true))
10339 RETURN (error_mark_node
);
10341 if (DECL_FRIEND_P (t
) && DECL_FRIEND_CONTEXT (t
))
10342 SET_DECL_FRIEND_CONTEXT (r
,
10343 tsubst (DECL_FRIEND_CONTEXT (t
),
10344 args
, complain
, in_decl
));
10346 /* Possibly limit visibility based on template args. */
10347 DECL_VISIBILITY (r
) = VISIBILITY_DEFAULT
;
10348 if (DECL_VISIBILITY_SPECIFIED (t
))
10350 DECL_VISIBILITY_SPECIFIED (r
) = 0;
10351 DECL_ATTRIBUTES (r
)
10352 = remove_attribute ("visibility", DECL_ATTRIBUTES (r
));
10354 determine_visibility (r
);
10355 if (DECL_DEFAULTED_OUTSIDE_CLASS_P (r
)
10356 && !processing_template_decl
)
10357 defaulted_late_check (r
);
10359 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
10360 args
, complain
, in_decl
);
10366 tree type
= NULL_TREE
;
10368 tree expanded_types
= NULL_TREE
;
10369 tree prev_r
= NULL_TREE
;
10370 tree first_r
= NULL_TREE
;
10372 if (FUNCTION_PARAMETER_PACK_P (t
))
10374 /* If there is a local specialization that isn't a
10375 parameter pack, it means that we're doing a "simple"
10376 substitution from inside tsubst_pack_expansion. Just
10377 return the local specialization (which will be a single
10379 tree spec
= retrieve_local_specialization (t
);
10381 && TREE_CODE (spec
) == PARM_DECL
10382 && TREE_CODE (TREE_TYPE (spec
)) != TYPE_PACK_EXPANSION
)
10385 /* Expand the TYPE_PACK_EXPANSION that provides the types for
10386 the parameters in this function parameter pack. */
10387 expanded_types
= tsubst_pack_expansion (TREE_TYPE (t
), args
,
10388 complain
, in_decl
);
10389 if (TREE_CODE (expanded_types
) == TREE_VEC
)
10391 len
= TREE_VEC_LENGTH (expanded_types
);
10393 /* Zero-length parameter packs are boring. Just substitute
10396 RETURN (tsubst (TREE_CHAIN (t
), args
, complain
,
10401 /* All we did was update the type. Make a note of that. */
10402 type
= expanded_types
;
10403 expanded_types
= NULL_TREE
;
10407 /* Loop through all of the parameter's we'll build. When T is
10408 a function parameter pack, LEN is the number of expanded
10409 types in EXPANDED_TYPES; otherwise, LEN is 1. */
10411 for (i
= 0; i
< len
; ++i
)
10415 if (DECL_TEMPLATE_PARM_P (t
))
10416 SET_DECL_TEMPLATE_PARM_P (r
);
10418 if (expanded_types
)
10419 /* We're on the Ith parameter of the function parameter
10422 /* An argument of a function parameter pack is not a parameter
10424 FUNCTION_PARAMETER_PACK_P (r
) = false;
10426 /* Get the Ith type. */
10427 type
= TREE_VEC_ELT (expanded_types
, i
);
10429 /* Rename the parameter to include the index. */
10431 = make_ith_pack_parameter_name (DECL_NAME (r
), i
);
10434 /* We're dealing with a normal parameter. */
10435 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
10437 type
= type_decays_to (type
);
10438 TREE_TYPE (r
) = type
;
10439 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
10441 if (DECL_INITIAL (r
))
10443 if (TREE_CODE (DECL_INITIAL (r
)) != TEMPLATE_PARM_INDEX
)
10444 DECL_INITIAL (r
) = TREE_TYPE (r
);
10446 DECL_INITIAL (r
) = tsubst (DECL_INITIAL (r
), args
,
10447 complain
, in_decl
);
10450 DECL_CONTEXT (r
) = NULL_TREE
;
10452 if (!DECL_TEMPLATE_PARM_P (r
))
10453 DECL_ARG_TYPE (r
) = type_passed_as (type
);
10455 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
10456 args
, complain
, in_decl
);
10458 /* Keep track of the first new parameter we
10459 generate. That's what will be returned to the
10464 /* Build a proper chain of parameters when substituting
10465 into a function parameter pack. */
10467 DECL_CHAIN (prev_r
) = r
;
10470 /* If cp_unevaluated_operand is set, we're just looking for a
10471 single dummy parameter, so don't keep going. */
10472 if (DECL_CHAIN (t
) && !cp_unevaluated_operand
)
10473 DECL_CHAIN (r
) = tsubst (DECL_CHAIN (t
), args
,
10474 complain
, DECL_CHAIN (t
));
10476 /* FIRST_R contains the start of the chain we've built. */
10486 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
10487 if (type
== error_mark_node
)
10488 RETURN (error_mark_node
);
10489 TREE_TYPE (r
) = type
;
10490 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
10492 if (DECL_C_BIT_FIELD (r
))
10493 /* For bit-fields, DECL_INITIAL gives the number of bits. For
10494 non-bit-fields DECL_INITIAL is a non-static data member
10495 initializer, which gets deferred instantiation. */
10497 = tsubst_expr (DECL_INITIAL (t
), args
,
10499 /*integral_constant_expression_p=*/true);
10500 else if (DECL_INITIAL (t
))
10502 /* Set up DECL_TEMPLATE_INFO so that we can get at the
10503 NSDMI in perform_member_init. Still set DECL_INITIAL
10504 so that we know there is one. */
10505 DECL_INITIAL (r
) = void_zero_node
;
10506 gcc_assert (DECL_LANG_SPECIFIC (r
) == NULL
);
10507 retrofit_lang_decl (r
);
10508 DECL_TEMPLATE_INFO (r
) = build_template_info (t
, args
);
10510 /* We don't have to set DECL_CONTEXT here; it is set by
10511 finish_member_declaration. */
10512 DECL_CHAIN (r
) = NULL_TREE
;
10513 if (VOID_TYPE_P (type
))
10514 error ("instantiation of %q+D as type %qT", r
, type
);
10516 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
10517 args
, complain
, in_decl
);
10522 /* We reach here only for member using decls. We also need to check
10523 uses_template_parms because DECL_DEPENDENT_P is not set for a
10524 using-declaration that designates a member of the current
10525 instantiation (c++/53549). */
10526 if (DECL_DEPENDENT_P (t
)
10527 || uses_template_parms (USING_DECL_SCOPE (t
)))
10529 tree inst_scope
= tsubst_copy (USING_DECL_SCOPE (t
), args
,
10530 complain
, in_decl
);
10531 tree name
= tsubst_copy (DECL_NAME (t
), args
, complain
, in_decl
);
10532 r
= do_class_using_decl (inst_scope
, name
);
10534 r
= error_mark_node
;
10537 TREE_PROTECTED (r
) = TREE_PROTECTED (t
);
10538 TREE_PRIVATE (r
) = TREE_PRIVATE (t
);
10544 DECL_CHAIN (r
) = NULL_TREE
;
10551 tree argvec
= NULL_TREE
;
10552 tree gen_tmpl
= NULL_TREE
;
10554 tree tmpl
= NULL_TREE
;
10556 tree type
= NULL_TREE
;
10559 if (TREE_CODE (t
) == TYPE_DECL
10560 && t
== TYPE_MAIN_DECL (TREE_TYPE (t
)))
10562 /* If this is the canonical decl, we don't have to
10563 mess with instantiations, and often we can't (for
10564 typename, template type parms and such). Note that
10565 TYPE_NAME is not correct for the above test if
10566 we've copied the type for a typedef. */
10567 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
10568 if (type
== error_mark_node
)
10569 RETURN (error_mark_node
);
10570 r
= TYPE_NAME (type
);
10574 /* Check to see if we already have the specialization we
10577 if (DECL_CLASS_SCOPE_P (t
) || DECL_NAMESPACE_SCOPE_P (t
))
10579 /* T is a static data member or namespace-scope entity.
10580 We have to substitute into namespace-scope variables
10581 (even though such entities are never templates) because
10584 template <class T> void f() { extern T t; }
10586 where the entity referenced is not known until
10587 instantiation time. */
10589 ctx
= DECL_CONTEXT (t
);
10590 if (DECL_CLASS_SCOPE_P (t
))
10592 ctx
= tsubst_aggr_type (ctx
, args
,
10594 in_decl
, /*entering_scope=*/1);
10595 /* If CTX is unchanged, then T is in fact the
10596 specialization we want. That situation occurs when
10597 referencing a static data member within in its own
10598 class. We can use pointer equality, rather than
10599 same_type_p, because DECL_CONTEXT is always
10601 if (ctx
== DECL_CONTEXT (t
)
10602 && (TREE_CODE (t
) != TYPE_DECL
10603 /* ... unless T is a member template; in which
10604 case our caller can be willing to create a
10605 specialization of that template represented
10607 || !(DECL_TI_TEMPLATE (t
)
10608 && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (t
)))))
10614 tmpl
= DECL_TI_TEMPLATE (t
);
10615 gen_tmpl
= most_general_template (tmpl
);
10616 argvec
= tsubst (DECL_TI_ARGS (t
), args
, complain
, in_decl
);
10617 if (argvec
== error_mark_node
)
10618 RETURN (error_mark_node
);
10619 hash
= hash_tmpl_and_args (gen_tmpl
, argvec
);
10620 spec
= retrieve_specialization (gen_tmpl
, argvec
, hash
);
10625 /* A local variable. */
10627 /* Subsequent calls to pushdecl will fill this in. */
10629 spec
= retrieve_local_specialization (t
);
10631 /* If we already have the specialization we need, there is
10632 nothing more to do. */
10639 if (VAR_P (t
) && DECL_ANON_UNION_VAR_P (t
))
10641 /* Just use name lookup to find a member alias for an anonymous
10642 union, but then add it to the hash table. */
10643 r
= lookup_name (DECL_NAME (t
));
10644 gcc_assert (DECL_ANON_UNION_VAR_P (r
));
10645 register_local_specialization (r
, t
);
10649 /* Create a new node for the specialization we need. */
10651 if (type
== NULL_TREE
)
10653 if (is_typedef_decl (t
))
10654 type
= DECL_ORIGINAL_TYPE (t
);
10656 type
= TREE_TYPE (t
);
10658 && VAR_HAD_UNKNOWN_BOUND (t
)
10659 && type
!= error_mark_node
)
10660 type
= strip_array_domain (type
);
10661 type
= tsubst (type
, args
, complain
, in_decl
);
10665 /* Even if the original location is out of scope, the
10666 newly substituted one is not. */
10667 DECL_DEAD_FOR_LOCAL (r
) = 0;
10668 DECL_INITIALIZED_P (r
) = 0;
10669 DECL_TEMPLATE_INSTANTIATED (r
) = 0;
10670 if (type
== error_mark_node
)
10671 RETURN (error_mark_node
);
10672 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10674 /* It may seem that this case cannot occur, since:
10679 declares a function, not a variable. However:
10682 template <typename T> void g() { T t; }
10683 template void g<f>();
10685 is an attempt to declare a variable with function
10687 error ("variable %qD has function type",
10688 /* R is not yet sufficiently initialized, so we
10689 just use its name. */
10691 RETURN (error_mark_node
);
10693 type
= complete_type (type
);
10694 /* Wait until cp_finish_decl to set this again, to handle
10695 circular dependency (template/instantiate6.C). */
10696 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r
) = 0;
10697 type
= check_var_type (DECL_NAME (r
), type
);
10699 if (DECL_HAS_VALUE_EXPR_P (t
))
10701 tree ve
= DECL_VALUE_EXPR (t
);
10702 ve
= tsubst_expr (ve
, args
, complain
, in_decl
,
10703 /*constant_expression_p=*/false);
10704 if (REFERENCE_REF_P (ve
))
10706 gcc_assert (TREE_CODE (type
) == REFERENCE_TYPE
);
10707 ve
= TREE_OPERAND (ve
, 0);
10709 SET_DECL_VALUE_EXPR (r
, ve
);
10712 else if (DECL_SELF_REFERENCE_P (t
))
10713 SET_DECL_SELF_REFERENCE_P (r
);
10714 TREE_TYPE (r
) = type
;
10715 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
10716 DECL_CONTEXT (r
) = ctx
;
10717 /* Clear out the mangled name and RTL for the instantiation. */
10718 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
10719 if (CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_DECL_WRTL
))
10720 SET_DECL_RTL (r
, NULL
);
10721 /* The initializer must not be expanded until it is required;
10722 see [temp.inst]. */
10723 DECL_INITIAL (r
) = NULL_TREE
;
10724 if (CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_DECL_WRTL
))
10725 SET_DECL_RTL (r
, NULL
);
10726 DECL_SIZE (r
) = DECL_SIZE_UNIT (r
) = 0;
10729 /* Possibly limit visibility based on template args. */
10730 DECL_VISIBILITY (r
) = VISIBILITY_DEFAULT
;
10731 if (DECL_VISIBILITY_SPECIFIED (t
))
10733 DECL_VISIBILITY_SPECIFIED (r
) = 0;
10734 DECL_ATTRIBUTES (r
)
10735 = remove_attribute ("visibility", DECL_ATTRIBUTES (r
));
10737 determine_visibility (r
);
10742 /* A static data member declaration is always marked
10743 external when it is declared in-class, even if an
10744 initializer is present. We mimic the non-template
10745 processing here. */
10746 DECL_EXTERNAL (r
) = 1;
10748 register_specialization (r
, gen_tmpl
, argvec
, false, hash
);
10749 DECL_TEMPLATE_INFO (r
) = build_template_info (tmpl
, argvec
);
10750 SET_DECL_IMPLICIT_INSTANTIATION (r
);
10752 else if (cp_unevaluated_operand
)
10754 /* We're substituting this var in a decltype outside of its
10755 scope, such as for a lambda return type. Don't add it to
10756 local_specializations, do perform auto deduction. */
10757 tree auto_node
= type_uses_auto (type
);
10761 = tsubst_expr (DECL_INITIAL (t
), args
, complain
, in_decl
,
10762 /*constant_expression_p=*/false);
10763 init
= resolve_nondeduced_context (init
);
10764 TREE_TYPE (r
) = type
10765 = do_auto_deduction (type
, init
, auto_node
);
10769 register_local_specialization (r
, t
);
10771 DECL_CHAIN (r
) = NULL_TREE
;
10773 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
),
10775 args
, complain
, in_decl
);
10777 /* Preserve a typedef that names a type. */
10778 if (is_typedef_decl (r
))
10780 DECL_ORIGINAL_TYPE (r
) = NULL_TREE
;
10781 set_underlying_type (r
);
10784 layout_decl (r
, 0);
10789 gcc_unreachable ();
10794 /* Restore the file and line information. */
10795 input_location
= saved_loc
;
10800 /* Substitute into the ARG_TYPES of a function type.
10801 If END is a TREE_CHAIN, leave it and any following types
10805 tsubst_arg_types (tree arg_types
,
10808 tsubst_flags_t complain
,
10811 tree remaining_arg_types
;
10812 tree type
= NULL_TREE
;
10814 tree expanded_args
= NULL_TREE
;
10817 if (!arg_types
|| arg_types
== void_list_node
|| arg_types
== end
)
10820 remaining_arg_types
= tsubst_arg_types (TREE_CHAIN (arg_types
),
10821 args
, end
, complain
, in_decl
);
10822 if (remaining_arg_types
== error_mark_node
)
10823 return error_mark_node
;
10825 if (PACK_EXPANSION_P (TREE_VALUE (arg_types
)))
10827 /* For a pack expansion, perform substitution on the
10828 entire expression. Later on, we'll handle the arguments
10830 expanded_args
= tsubst_pack_expansion (TREE_VALUE (arg_types
),
10831 args
, complain
, in_decl
);
10833 if (TREE_CODE (expanded_args
) == TREE_VEC
)
10834 /* So that we'll spin through the parameters, one by one. */
10835 i
= TREE_VEC_LENGTH (expanded_args
);
10838 /* We only partially substituted into the parameter
10839 pack. Our type is TYPE_PACK_EXPANSION. */
10840 type
= expanded_args
;
10841 expanded_args
= NULL_TREE
;
10849 type
= TREE_VEC_ELT (expanded_args
, i
);
10851 type
= tsubst (TREE_VALUE (arg_types
), args
, complain
, in_decl
);
10853 if (type
== error_mark_node
)
10854 return error_mark_node
;
10855 if (VOID_TYPE_P (type
))
10857 if (complain
& tf_error
)
10859 error ("invalid parameter type %qT", type
);
10861 error ("in declaration %q+D", in_decl
);
10863 return error_mark_node
;
10866 if (abstract_virtuals_error_sfinae (ACU_PARM
, type
, complain
))
10867 return error_mark_node
;
10869 /* Do array-to-pointer, function-to-pointer conversion, and ignore
10870 top-level qualifiers as required. */
10871 type
= cv_unqualified (type_decays_to (type
));
10873 /* We do not substitute into default arguments here. The standard
10874 mandates that they be instantiated only when needed, which is
10875 done in build_over_call. */
10876 default_arg
= TREE_PURPOSE (arg_types
);
10878 if (default_arg
&& TREE_CODE (default_arg
) == DEFAULT_ARG
)
10880 /* We've instantiated a template before its default arguments
10881 have been parsed. This can happen for a nested template
10882 class, and is not an error unless we require the default
10883 argument in a call of this function. */
10884 remaining_arg_types
=
10885 tree_cons (default_arg
, type
, remaining_arg_types
);
10886 vec_safe_push (DEFARG_INSTANTIATIONS(default_arg
), remaining_arg_types
);
10889 remaining_arg_types
=
10890 hash_tree_cons (default_arg
, type
, remaining_arg_types
);
10893 return remaining_arg_types
;
10896 /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does
10897 *not* handle the exception-specification for FNTYPE, because the
10898 initial substitution of explicitly provided template parameters
10899 during argument deduction forbids substitution into the
10900 exception-specification:
10904 All references in the function type of the function template to the
10905 corresponding template parameters are replaced by the specified tem-
10906 plate argument values. If a substitution in a template parameter or
10907 in the function type of the function template results in an invalid
10908 type, type deduction fails. [Note: The equivalent substitution in
10909 exception specifications is done only when the function is instanti-
10910 ated, at which point a program is ill-formed if the substitution
10911 results in an invalid type.] */
10914 tsubst_function_type (tree t
,
10916 tsubst_flags_t complain
,
10923 /* The TYPE_CONTEXT is not used for function/method types. */
10924 gcc_assert (TYPE_CONTEXT (t
) == NULL_TREE
);
10926 /* Substitute the return type. */
10927 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
10928 if (return_type
== error_mark_node
)
10929 return error_mark_node
;
10930 /* DR 486 clarifies that creation of a function type with an
10931 invalid return type is a deduction failure. */
10932 if (TREE_CODE (return_type
) == ARRAY_TYPE
10933 || TREE_CODE (return_type
) == FUNCTION_TYPE
)
10935 if (complain
& tf_error
)
10937 if (TREE_CODE (return_type
) == ARRAY_TYPE
)
10938 error ("function returning an array");
10940 error ("function returning a function");
10942 return error_mark_node
;
10945 if (abstract_virtuals_error_sfinae (ACU_RETURN
, return_type
, complain
))
10946 return error_mark_node
;
10948 /* Substitute the argument types. */
10949 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
, NULL_TREE
,
10950 complain
, in_decl
);
10951 if (arg_types
== error_mark_node
)
10952 return error_mark_node
;
10954 /* Construct a new type node and return it. */
10955 if (TREE_CODE (t
) == FUNCTION_TYPE
)
10957 fntype
= build_function_type (return_type
, arg_types
);
10958 fntype
= apply_memfn_quals (fntype
,
10959 type_memfn_quals (t
),
10960 type_memfn_rqual (t
));
10964 tree r
= TREE_TYPE (TREE_VALUE (arg_types
));
10965 if (! MAYBE_CLASS_TYPE_P (r
))
10969 Type deduction may fail for any of the following
10972 -- Attempting to create "pointer to member of T" when T
10973 is not a class type. */
10974 if (complain
& tf_error
)
10975 error ("creating pointer to member function of non-class type %qT",
10977 return error_mark_node
;
10980 fntype
= build_method_type_directly (r
, return_type
,
10981 TREE_CHAIN (arg_types
));
10982 fntype
= build_ref_qualified_type (fntype
, type_memfn_rqual (t
));
10984 fntype
= cp_build_type_attribute_variant (fntype
, TYPE_ATTRIBUTES (t
));
10989 /* FNTYPE is a FUNCTION_TYPE or METHOD_TYPE. Substitute the template
10990 ARGS into that specification, and return the substituted
10991 specification. If there is no specification, return NULL_TREE. */
10994 tsubst_exception_specification (tree fntype
,
10996 tsubst_flags_t complain
,
11003 specs
= TYPE_RAISES_EXCEPTIONS (fntype
);
11004 new_specs
= NULL_TREE
;
11005 if (specs
&& TREE_PURPOSE (specs
))
11007 /* A noexcept-specifier. */
11008 tree expr
= TREE_PURPOSE (specs
);
11009 if (TREE_CODE (expr
) == INTEGER_CST
)
11013 /* Defer instantiation of noexcept-specifiers to avoid
11014 excessive instantiations (c++/49107). */
11015 new_specs
= make_node (DEFERRED_NOEXCEPT
);
11016 if (DEFERRED_NOEXCEPT_SPEC_P (specs
))
11018 /* We already partially instantiated this member template,
11019 so combine the new args with the old. */
11020 DEFERRED_NOEXCEPT_PATTERN (new_specs
)
11021 = DEFERRED_NOEXCEPT_PATTERN (expr
);
11022 DEFERRED_NOEXCEPT_ARGS (new_specs
)
11023 = add_to_template_args (DEFERRED_NOEXCEPT_ARGS (expr
), args
);
11027 DEFERRED_NOEXCEPT_PATTERN (new_specs
) = expr
;
11028 DEFERRED_NOEXCEPT_ARGS (new_specs
) = args
;
11032 new_specs
= tsubst_copy_and_build
11033 (expr
, args
, complain
, in_decl
, /*function_p=*/false,
11034 /*integral_constant_expression_p=*/true);
11035 new_specs
= build_noexcept_spec (new_specs
, complain
);
11039 if (! TREE_VALUE (specs
))
11046 tree expanded_specs
= NULL_TREE
;
11048 if (PACK_EXPANSION_P (TREE_VALUE (specs
)))
11050 /* Expand the pack expansion type. */
11051 expanded_specs
= tsubst_pack_expansion (TREE_VALUE (specs
),
11055 if (expanded_specs
== error_mark_node
)
11056 return error_mark_node
;
11057 else if (TREE_CODE (expanded_specs
) == TREE_VEC
)
11058 len
= TREE_VEC_LENGTH (expanded_specs
);
11061 /* We're substituting into a member template, so
11062 we got a TYPE_PACK_EXPANSION back. Add that
11063 expansion and move on. */
11064 gcc_assert (TREE_CODE (expanded_specs
)
11065 == TYPE_PACK_EXPANSION
);
11066 new_specs
= add_exception_specifier (new_specs
,
11069 specs
= TREE_CHAIN (specs
);
11074 for (i
= 0; i
< len
; ++i
)
11076 if (expanded_specs
)
11077 spec
= TREE_VEC_ELT (expanded_specs
, i
);
11079 spec
= tsubst (TREE_VALUE (specs
), args
, complain
, in_decl
);
11080 if (spec
== error_mark_node
)
11082 new_specs
= add_exception_specifier (new_specs
, spec
,
11086 specs
= TREE_CHAIN (specs
);
11092 /* Take the tree structure T and replace template parameters used
11093 therein with the argument vector ARGS. IN_DECL is an associated
11094 decl for diagnostics. If an error occurs, returns ERROR_MARK_NODE.
11095 Issue error and warning messages under control of COMPLAIN. Note
11096 that we must be relatively non-tolerant of extensions here, in
11097 order to preserve conformance; if we allow substitutions that
11098 should not be allowed, we may allow argument deductions that should
11099 not succeed, and therefore report ambiguous overload situations
11100 where there are none. In theory, we could allow the substitution,
11101 but indicate that it should have failed, and allow our caller to
11102 make sure that the right thing happens, but we don't try to do this
11105 This function is used for dealing with types, decls and the like;
11106 for expressions, use tsubst_expr or tsubst_copy. */
11109 tsubst (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
11111 enum tree_code code
;
11112 tree type
, r
= NULL_TREE
;
11114 if (t
== NULL_TREE
|| t
== error_mark_node
11115 || t
== integer_type_node
11116 || t
== void_type_node
11117 || t
== char_type_node
11118 || t
== unknown_type_node
11119 || TREE_CODE (t
) == NAMESPACE_DECL
11120 || TREE_CODE (t
) == TRANSLATION_UNIT_DECL
)
11124 return tsubst_decl (t
, args
, complain
);
11126 if (args
== NULL_TREE
)
11129 code
= TREE_CODE (t
);
11131 if (code
== IDENTIFIER_NODE
)
11132 type
= IDENTIFIER_TYPE_VALUE (t
);
11134 type
= TREE_TYPE (t
);
11136 gcc_assert (type
!= unknown_type_node
);
11138 /* Reuse typedefs. We need to do this to handle dependent attributes,
11139 such as attribute aligned. */
11141 && typedef_variant_p (t
))
11143 tree decl
= TYPE_NAME (t
);
11145 if (alias_template_specialization_p (t
))
11147 /* DECL represents an alias template and we want to
11149 tree tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
11150 tree gen_args
= tsubst (DECL_TI_ARGS (decl
), args
, complain
, in_decl
);
11151 r
= instantiate_alias_template (tmpl
, gen_args
, complain
);
11153 else if (DECL_CLASS_SCOPE_P (decl
)
11154 && CLASSTYPE_TEMPLATE_INFO (DECL_CONTEXT (decl
))
11155 && uses_template_parms (DECL_CONTEXT (decl
)))
11157 tree tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
11158 tree gen_args
= tsubst (DECL_TI_ARGS (decl
), args
, complain
, in_decl
);
11159 r
= retrieve_specialization (tmpl
, gen_args
, 0);
11161 else if (DECL_FUNCTION_SCOPE_P (decl
)
11162 && DECL_TEMPLATE_INFO (DECL_CONTEXT (decl
))
11163 && uses_template_parms (DECL_TI_ARGS (DECL_CONTEXT (decl
))))
11164 r
= retrieve_local_specialization (decl
);
11166 /* The typedef is from a non-template context. */
11172 r
= cp_build_qualified_type_real
11173 (r
, cp_type_quals (t
) | cp_type_quals (r
),
11174 complain
| tf_ignore_bad_quals
);
11179 /* We don't have an instantiation yet, so drop the typedef. */
11180 int quals
= cp_type_quals (t
);
11181 t
= DECL_ORIGINAL_TYPE (decl
);
11182 t
= cp_build_qualified_type_real (t
, quals
,
11183 complain
| tf_ignore_bad_quals
);
11188 && code
!= TYPENAME_TYPE
11189 && code
!= TEMPLATE_TYPE_PARM
11190 && code
!= IDENTIFIER_NODE
11191 && code
!= FUNCTION_TYPE
11192 && code
!= METHOD_TYPE
)
11193 type
= tsubst (type
, args
, complain
, in_decl
);
11194 if (type
== error_mark_node
)
11195 return error_mark_node
;
11201 case ENUMERAL_TYPE
:
11202 return tsubst_aggr_type (t
, args
, complain
, in_decl
,
11203 /*entering_scope=*/0);
11206 case IDENTIFIER_NODE
:
11217 if (t
== integer_type_node
)
11220 if (TREE_CODE (TYPE_MIN_VALUE (t
)) == INTEGER_CST
11221 && TREE_CODE (TYPE_MAX_VALUE (t
)) == INTEGER_CST
)
11225 tree max
, omax
= TREE_OPERAND (TYPE_MAX_VALUE (t
), 0);
11227 max
= tsubst_expr (omax
, args
, complain
, in_decl
,
11228 /*integral_constant_expression_p=*/false);
11230 /* Fix up type of the magic NOP_EXPR with TREE_SIDE_EFFECTS if
11232 if (TREE_CODE (max
) == NOP_EXPR
11233 && TREE_SIDE_EFFECTS (omax
)
11234 && !TREE_TYPE (max
))
11235 TREE_TYPE (max
) = TREE_TYPE (TREE_OPERAND (max
, 0));
11237 /* If we're in a partial instantiation, preserve the magic NOP_EXPR
11238 with TREE_SIDE_EFFECTS that indicates this is not an integral
11239 constant expression. */
11240 if (processing_template_decl
11241 && TREE_SIDE_EFFECTS (omax
) && TREE_CODE (omax
) == NOP_EXPR
)
11243 gcc_assert (TREE_CODE (max
) == NOP_EXPR
);
11244 TREE_SIDE_EFFECTS (max
) = 1;
11247 return compute_array_index_type (NULL_TREE
, max
, complain
);
11250 case TEMPLATE_TYPE_PARM
:
11251 case TEMPLATE_TEMPLATE_PARM
:
11252 case BOUND_TEMPLATE_TEMPLATE_PARM
:
11253 case TEMPLATE_PARM_INDEX
:
11258 tree arg
= NULL_TREE
;
11262 gcc_assert (TREE_VEC_LENGTH (args
) > 0);
11263 template_parm_level_and_index (t
, &level
, &idx
);
11265 levels
= TMPL_ARGS_DEPTH (args
);
11266 if (level
<= levels
)
11268 arg
= TMPL_ARG (args
, level
, idx
);
11270 if (arg
&& TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
11272 /* See through ARGUMENT_PACK_SELECT arguments. */
11273 arg
= ARGUMENT_PACK_SELECT_ARG (arg
);
11274 /* If the selected argument is an expansion E, that most
11275 likely means we were called from
11276 gen_elem_of_pack_expansion_instantiation during the
11277 substituting of pack an argument pack (which Ith
11278 element is a pack expansion, where I is
11279 ARGUMENT_PACK_SELECT_INDEX) into a pack expansion.
11280 In this case, the Ith element resulting from this
11281 substituting is going to be a pack expansion, which
11282 pattern is the pattern of E. Let's return the
11284 gen_elem_of_pack_expansion_instantiation will
11285 build the resulting pack expansion from it. */
11286 if (PACK_EXPANSION_P (arg
))
11287 arg
= PACK_EXPANSION_PATTERN (arg
);
11291 if (arg
== error_mark_node
)
11292 return error_mark_node
;
11293 else if (arg
!= NULL_TREE
)
11295 if (ARGUMENT_PACK_P (arg
))
11296 /* If ARG is an argument pack, we don't actually want to
11297 perform a substitution here, because substitutions
11298 for argument packs are only done
11299 element-by-element. We can get to this point when
11300 substituting the type of a non-type template
11301 parameter pack, when that type actually contains
11302 template parameter packs from an outer template, e.g.,
11304 template<typename... Types> struct A {
11305 template<Types... Values> struct B { };
11309 if (code
== TEMPLATE_TYPE_PARM
)
11312 gcc_assert (TYPE_P (arg
));
11314 quals
= cp_type_quals (arg
) | cp_type_quals (t
);
11316 return cp_build_qualified_type_real
11317 (arg
, quals
, complain
| tf_ignore_bad_quals
);
11319 else if (code
== BOUND_TEMPLATE_TEMPLATE_PARM
)
11321 /* We are processing a type constructed from a
11322 template template parameter. */
11323 tree argvec
= tsubst (TYPE_TI_ARGS (t
),
11324 args
, complain
, in_decl
);
11325 if (argvec
== error_mark_node
)
11326 return error_mark_node
;
11328 gcc_assert (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
11329 || TREE_CODE (arg
) == TEMPLATE_DECL
11330 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
);
11332 if (TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
)
11333 /* Consider this code:
11335 template <template <class> class Template>
11337 template <class Arg> using Bind = Template<Arg>;
11340 template <template <class> class Template, class Arg>
11341 using Instantiate = Template<Arg>; //#0
11343 template <template <class> class Template,
11346 Instantiate<Internal<Template>::template Bind,
11349 When #1 is parsed, the
11350 BOUND_TEMPLATE_TEMPLATE_PARM representing the
11351 parameter `Template' in #0 matches the
11352 UNBOUND_CLASS_TEMPLATE representing the argument
11353 `Internal<Template>::template Bind'; We then want
11354 to assemble the type `Bind<Argument>' that can't
11355 be fully created right now, because
11356 `Internal<Template>' not being complete, the Bind
11357 template cannot be looked up in that context. So
11358 we need to "store" `Bind<Argument>' for later
11359 when the context of Bind becomes complete. Let's
11360 store that in a TYPENAME_TYPE. */
11361 return make_typename_type (TYPE_CONTEXT (arg
),
11362 build_nt (TEMPLATE_ID_EXPR
,
11363 TYPE_IDENTIFIER (arg
),
11368 /* We can get a TEMPLATE_TEMPLATE_PARM here when we
11369 are resolving nested-types in the signature of a
11370 member function templates. Otherwise ARG is a
11371 TEMPLATE_DECL and is the real template to be
11373 if (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
11374 arg
= TYPE_NAME (arg
);
11376 r
= lookup_template_class (arg
,
11378 DECL_CONTEXT (arg
),
11379 /*entering_scope=*/0,
11381 return cp_build_qualified_type_real
11382 (r
, cp_type_quals (t
), complain
);
11385 /* TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX. */
11386 return convert_from_reference (unshare_expr (arg
));
11390 /* This can happen during the attempted tsubst'ing in
11391 unify. This means that we don't yet have any information
11392 about the template parameter in question. */
11395 /* Early in template argument deduction substitution, we don't
11396 want to reduce the level of 'auto', or it will be confused
11397 with a normal template parm in subsequent deduction. */
11398 if (is_auto (t
) && (complain
& tf_partial
))
11401 /* If we get here, we must have been looking at a parm for a
11402 more deeply nested template. Make a new version of this
11403 template parameter, but with a lower level. */
11406 case TEMPLATE_TYPE_PARM
:
11407 case TEMPLATE_TEMPLATE_PARM
:
11408 case BOUND_TEMPLATE_TEMPLATE_PARM
:
11409 if (cp_type_quals (t
))
11411 r
= tsubst (TYPE_MAIN_VARIANT (t
), args
, complain
, in_decl
);
11412 r
= cp_build_qualified_type_real
11413 (r
, cp_type_quals (t
),
11414 complain
| (code
== TEMPLATE_TYPE_PARM
11415 ? tf_ignore_bad_quals
: 0));
11420 TEMPLATE_TYPE_PARM_INDEX (r
)
11421 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (t
),
11422 r
, levels
, args
, complain
);
11423 TYPE_STUB_DECL (r
) = TYPE_NAME (r
) = TEMPLATE_TYPE_DECL (r
);
11424 TYPE_MAIN_VARIANT (r
) = r
;
11425 TYPE_POINTER_TO (r
) = NULL_TREE
;
11426 TYPE_REFERENCE_TO (r
) = NULL_TREE
;
11428 if (TREE_CODE (r
) == TEMPLATE_TEMPLATE_PARM
)
11429 /* We have reduced the level of the template
11430 template parameter, but not the levels of its
11431 template parameters, so canonical_type_parameter
11432 will not be able to find the canonical template
11433 template parameter for this level. Thus, we
11434 require structural equality checking to compare
11435 TEMPLATE_TEMPLATE_PARMs. */
11436 SET_TYPE_STRUCTURAL_EQUALITY (r
);
11437 else if (TYPE_STRUCTURAL_EQUALITY_P (t
))
11438 SET_TYPE_STRUCTURAL_EQUALITY (r
);
11440 TYPE_CANONICAL (r
) = canonical_type_parameter (r
);
11442 if (code
== BOUND_TEMPLATE_TEMPLATE_PARM
)
11444 tree argvec
= tsubst (TYPE_TI_ARGS (t
), args
,
11445 complain
, in_decl
);
11446 if (argvec
== error_mark_node
)
11447 return error_mark_node
;
11449 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (r
)
11450 = build_template_info (TYPE_TI_TEMPLATE (t
), argvec
);
11455 case TEMPLATE_PARM_INDEX
:
11456 r
= reduce_template_parm_level (t
, type
, levels
, args
, complain
);
11460 gcc_unreachable ();
11468 tree purpose
, value
, chain
;
11470 if (t
== void_list_node
)
11473 purpose
= TREE_PURPOSE (t
);
11476 purpose
= tsubst (purpose
, args
, complain
, in_decl
);
11477 if (purpose
== error_mark_node
)
11478 return error_mark_node
;
11480 value
= TREE_VALUE (t
);
11483 value
= tsubst (value
, args
, complain
, in_decl
);
11484 if (value
== error_mark_node
)
11485 return error_mark_node
;
11487 chain
= TREE_CHAIN (t
);
11488 if (chain
&& chain
!= void_type_node
)
11490 chain
= tsubst (chain
, args
, complain
, in_decl
);
11491 if (chain
== error_mark_node
)
11492 return error_mark_node
;
11494 if (purpose
== TREE_PURPOSE (t
)
11495 && value
== TREE_VALUE (t
)
11496 && chain
== TREE_CHAIN (t
))
11498 return hash_tree_cons (purpose
, value
, chain
);
11502 /* We should never be tsubsting a binfo. */
11503 gcc_unreachable ();
11506 /* A vector of template arguments. */
11507 gcc_assert (!type
);
11508 return tsubst_template_args (t
, args
, complain
, in_decl
);
11511 case REFERENCE_TYPE
:
11513 if (type
== TREE_TYPE (t
) && TREE_CODE (type
) != METHOD_TYPE
)
11518 Type deduction may fail for any of the following
11521 -- Attempting to create a pointer to reference type.
11522 -- Attempting to create a reference to a reference type or
11523 a reference to void.
11525 Core issue 106 says that creating a reference to a reference
11526 during instantiation is no longer a cause for failure. We
11527 only enforce this check in strict C++98 mode. */
11528 if ((TREE_CODE (type
) == REFERENCE_TYPE
11529 && (((cxx_dialect
== cxx98
) && flag_iso
) || code
!= REFERENCE_TYPE
))
11530 || (code
== REFERENCE_TYPE
&& VOID_TYPE_P (type
)))
11532 static location_t last_loc
;
11534 /* We keep track of the last time we issued this error
11535 message to avoid spewing a ton of messages during a
11536 single bad template instantiation. */
11537 if (complain
& tf_error
11538 && last_loc
!= input_location
)
11540 if (VOID_TYPE_P (type
))
11541 error ("forming reference to void");
11542 else if (code
== POINTER_TYPE
)
11543 error ("forming pointer to reference type %qT", type
);
11545 error ("forming reference to reference type %qT", type
);
11546 last_loc
= input_location
;
11549 return error_mark_node
;
11551 else if (code
== POINTER_TYPE
)
11553 r
= build_pointer_type (type
);
11554 if (TREE_CODE (type
) == METHOD_TYPE
)
11555 r
= build_ptrmemfunc_type (r
);
11557 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
11558 /* In C++0x, during template argument substitution, when there is an
11559 attempt to create a reference to a reference type, reference
11560 collapsing is applied as described in [14.3.1/4 temp.arg.type]:
11562 "If a template-argument for a template-parameter T names a type
11563 that is a reference to a type A, an attempt to create the type
11564 'lvalue reference to cv T' creates the type 'lvalue reference to
11565 A,' while an attempt to create the type type rvalue reference to
11566 cv T' creates the type T"
11568 r
= cp_build_reference_type
11570 TYPE_REF_IS_RVALUE (t
) && TYPE_REF_IS_RVALUE (type
));
11572 r
= cp_build_reference_type (type
, TYPE_REF_IS_RVALUE (t
));
11573 r
= cp_build_qualified_type_real (r
, cp_type_quals (t
), complain
);
11575 if (r
!= error_mark_node
)
11576 /* Will this ever be needed for TYPE_..._TO values? */
11583 r
= tsubst (TYPE_OFFSET_BASETYPE (t
), args
, complain
, in_decl
);
11584 if (r
== error_mark_node
|| !MAYBE_CLASS_TYPE_P (r
))
11588 Type deduction may fail for any of the following
11591 -- Attempting to create "pointer to member of T" when T
11592 is not a class type. */
11593 if (complain
& tf_error
)
11594 error ("creating pointer to member of non-class type %qT", r
);
11595 return error_mark_node
;
11597 if (TREE_CODE (type
) == REFERENCE_TYPE
)
11599 if (complain
& tf_error
)
11600 error ("creating pointer to member reference type %qT", type
);
11601 return error_mark_node
;
11603 if (VOID_TYPE_P (type
))
11605 if (complain
& tf_error
)
11606 error ("creating pointer to member of type void");
11607 return error_mark_node
;
11609 gcc_assert (TREE_CODE (type
) != METHOD_TYPE
);
11610 if (TREE_CODE (type
) == FUNCTION_TYPE
)
11612 /* The type of the implicit object parameter gets its
11613 cv-qualifiers from the FUNCTION_TYPE. */
11616 = build_memfn_type (type
, r
, type_memfn_quals (type
),
11617 type_memfn_rqual (type
));
11618 memptr
= build_ptrmemfunc_type (build_pointer_type (method_type
));
11619 return cp_build_qualified_type_real (memptr
, cp_type_quals (t
),
11623 return cp_build_qualified_type_real (build_ptrmem_type (r
, type
),
11627 case FUNCTION_TYPE
:
11632 fntype
= tsubst_function_type (t
, args
, complain
, in_decl
);
11633 if (fntype
== error_mark_node
)
11634 return error_mark_node
;
11636 /* Substitute the exception specification. */
11637 specs
= tsubst_exception_specification (t
, args
, complain
,
11638 in_decl
, /*defer_ok*/true);
11639 if (specs
== error_mark_node
)
11640 return error_mark_node
;
11642 fntype
= build_exception_variant (fntype
, specs
);
11647 tree domain
= tsubst (TYPE_DOMAIN (t
), args
, complain
, in_decl
);
11648 if (domain
== error_mark_node
)
11649 return error_mark_node
;
11651 /* As an optimization, we avoid regenerating the array type if
11652 it will obviously be the same as T. */
11653 if (type
== TREE_TYPE (t
) && domain
== TYPE_DOMAIN (t
))
11656 /* These checks should match the ones in grokdeclarator.
11660 The deduction may fail for any of the following reasons:
11662 -- Attempting to create an array with an element type that
11663 is void, a function type, or a reference type, or [DR337]
11664 an abstract class type. */
11665 if (VOID_TYPE_P (type
)
11666 || TREE_CODE (type
) == FUNCTION_TYPE
11667 || TREE_CODE (type
) == REFERENCE_TYPE
)
11669 if (complain
& tf_error
)
11670 error ("creating array of %qT", type
);
11671 return error_mark_node
;
11674 if (abstract_virtuals_error_sfinae (ACU_ARRAY
, type
, complain
))
11675 return error_mark_node
;
11677 r
= build_cplus_array_type (type
, domain
);
11679 if (TYPE_USER_ALIGN (t
))
11681 TYPE_ALIGN (r
) = TYPE_ALIGN (t
);
11682 TYPE_USER_ALIGN (r
) = 1;
11688 case TYPENAME_TYPE
:
11690 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
11691 in_decl
, /*entering_scope=*/1);
11692 tree f
= tsubst_copy (TYPENAME_TYPE_FULLNAME (t
), args
,
11693 complain
, in_decl
);
11695 if (ctx
== error_mark_node
|| f
== error_mark_node
)
11696 return error_mark_node
;
11698 if (!MAYBE_CLASS_TYPE_P (ctx
))
11700 if (complain
& tf_error
)
11701 error ("%qT is not a class, struct, or union type", ctx
);
11702 return error_mark_node
;
11704 else if (!uses_template_parms (ctx
) && !TYPE_BEING_DEFINED (ctx
))
11706 /* Normally, make_typename_type does not require that the CTX
11707 have complete type in order to allow things like:
11709 template <class T> struct S { typename S<T>::X Y; };
11711 But, such constructs have already been resolved by this
11712 point, so here CTX really should have complete type, unless
11713 it's a partial instantiation. */
11714 ctx
= complete_type (ctx
);
11715 if (!COMPLETE_TYPE_P (ctx
))
11717 if (complain
& tf_error
)
11718 cxx_incomplete_type_error (NULL_TREE
, ctx
);
11719 return error_mark_node
;
11723 f
= make_typename_type (ctx
, f
, typename_type
,
11724 complain
| tf_keep_type_decl
);
11725 if (f
== error_mark_node
)
11727 if (TREE_CODE (f
) == TYPE_DECL
)
11729 complain
|= tf_ignore_bad_quals
;
11733 if (TREE_CODE (f
) != TYPENAME_TYPE
)
11735 if (TYPENAME_IS_ENUM_P (t
) && TREE_CODE (f
) != ENUMERAL_TYPE
)
11737 if (complain
& tf_error
)
11738 error ("%qT resolves to %qT, which is not an enumeration type",
11741 return error_mark_node
;
11743 else if (TYPENAME_IS_CLASS_P (t
) && !CLASS_TYPE_P (f
))
11745 if (complain
& tf_error
)
11746 error ("%qT resolves to %qT, which is is not a class type",
11749 return error_mark_node
;
11753 return cp_build_qualified_type_real
11754 (f
, cp_type_quals (f
) | cp_type_quals (t
), complain
);
11757 case UNBOUND_CLASS_TEMPLATE
:
11759 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
11760 in_decl
, /*entering_scope=*/1);
11761 tree name
= TYPE_IDENTIFIER (t
);
11762 tree parm_list
= DECL_TEMPLATE_PARMS (TYPE_NAME (t
));
11764 if (ctx
== error_mark_node
|| name
== error_mark_node
)
11765 return error_mark_node
;
11768 parm_list
= tsubst_template_parms (parm_list
, args
, complain
);
11769 return make_unbound_class_template (ctx
, name
, parm_list
, complain
);
11776 ++cp_unevaluated_operand
;
11777 ++c_inhibit_evaluation_warnings
;
11779 type
= tsubst_expr (TYPEOF_TYPE_EXPR (t
), args
,
11781 /*integral_constant_expression_p=*/false);
11783 --cp_unevaluated_operand
;
11784 --c_inhibit_evaluation_warnings
;
11786 type
= finish_typeof (type
);
11787 return cp_build_qualified_type_real (type
,
11789 | cp_type_quals (type
),
11793 case DECLTYPE_TYPE
:
11797 ++cp_unevaluated_operand
;
11798 ++c_inhibit_evaluation_warnings
;
11800 type
= tsubst_expr (DECLTYPE_TYPE_EXPR (t
), args
,
11801 complain
|tf_decltype
, in_decl
,
11802 /*integral_constant_expression_p=*/false);
11804 --cp_unevaluated_operand
;
11805 --c_inhibit_evaluation_warnings
;
11807 if (DECLTYPE_FOR_LAMBDA_CAPTURE (t
))
11808 type
= lambda_capture_field_type (type
);
11809 else if (DECLTYPE_FOR_LAMBDA_PROXY (t
))
11810 type
= lambda_proxy_type (type
);
11812 type
= finish_decltype_type
11813 (type
, DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t
), complain
);
11814 return cp_build_qualified_type_real (type
,
11816 | cp_type_quals (type
),
11820 case UNDERLYING_TYPE
:
11822 tree type
= tsubst (UNDERLYING_TYPE_TYPE (t
), args
,
11823 complain
, in_decl
);
11824 return finish_underlying_type (type
);
11827 case TYPE_ARGUMENT_PACK
:
11828 case NONTYPE_ARGUMENT_PACK
:
11830 tree r
= TYPE_P (t
) ? cxx_make_type (code
) : make_node (code
);
11832 tsubst_template_args (ARGUMENT_PACK_ARGS (t
),
11836 SET_ARGUMENT_PACK_ARGS (r
, packed_out
);
11838 /* For template nontype argument packs, also substitute into
11840 if (code
== NONTYPE_ARGUMENT_PACK
)
11841 TREE_TYPE (r
) = tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11859 /* We should use one of the expression tsubsts for these codes. */
11860 gcc_unreachable ();
11863 sorry ("use of %qs in template", tree_code_name
[(int) code
]);
11864 return error_mark_node
;
11868 /* Like tsubst_expr for a BASELINK. OBJECT_TYPE, if non-NULL, is the
11869 type of the expression on the left-hand side of the "." or "->"
11873 tsubst_baselink (tree baselink
, tree object_type
,
11874 tree args
, tsubst_flags_t complain
, tree in_decl
)
11877 tree qualifying_scope
;
11880 tree template_args
= 0;
11881 bool template_id_p
= false;
11882 bool qualified
= BASELINK_QUALIFIED_P (baselink
);
11884 /* A baselink indicates a function from a base class. Both the
11885 BASELINK_ACCESS_BINFO and the base class referenced may
11886 indicate bases of the template class, rather than the
11887 instantiated class. In addition, lookups that were not
11888 ambiguous before may be ambiguous now. Therefore, we perform
11889 the lookup again. */
11890 qualifying_scope
= BINFO_TYPE (BASELINK_ACCESS_BINFO (baselink
));
11891 qualifying_scope
= tsubst (qualifying_scope
, args
,
11892 complain
, in_decl
);
11893 fns
= BASELINK_FUNCTIONS (baselink
);
11894 optype
= tsubst (BASELINK_OPTYPE (baselink
), args
, complain
, in_decl
);
11895 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
11897 template_id_p
= true;
11898 template_args
= TREE_OPERAND (fns
, 1);
11899 fns
= TREE_OPERAND (fns
, 0);
11901 template_args
= tsubst_template_args (template_args
, args
,
11902 complain
, in_decl
);
11904 name
= DECL_NAME (get_first_fn (fns
));
11905 if (IDENTIFIER_TYPENAME_P (name
))
11906 name
= mangle_conv_op_name_for_type (optype
);
11907 baselink
= lookup_fnfields (qualifying_scope
, name
, /*protect=*/1);
11909 return error_mark_node
;
11911 /* If lookup found a single function, mark it as used at this
11912 point. (If it lookup found multiple functions the one selected
11913 later by overload resolution will be marked as used at that
11915 if (BASELINK_P (baselink
))
11916 fns
= BASELINK_FUNCTIONS (baselink
);
11917 if (!template_id_p
&& !really_overloaded_fn (fns
))
11918 mark_used (OVL_CURRENT (fns
));
11920 /* Add back the template arguments, if present. */
11921 if (BASELINK_P (baselink
) && template_id_p
)
11922 BASELINK_FUNCTIONS (baselink
)
11923 = build_nt (TEMPLATE_ID_EXPR
,
11924 BASELINK_FUNCTIONS (baselink
),
11926 /* Update the conversion operator type. */
11927 BASELINK_OPTYPE (baselink
) = optype
;
11930 object_type
= current_class_type
;
11933 baselink
= adjust_result_of_qualified_name_lookup (baselink
,
11939 /* Like tsubst_expr for a SCOPE_REF, given by QUALIFIED_ID. DONE is
11940 true if the qualified-id will be a postfix-expression in-and-of
11941 itself; false if more of the postfix-expression follows the
11942 QUALIFIED_ID. ADDRESS_P is true if the qualified-id is the operand
11946 tsubst_qualified_id (tree qualified_id
, tree args
,
11947 tsubst_flags_t complain
, tree in_decl
,
11948 bool done
, bool address_p
)
11954 tree template_args
;
11955 location_t loc
= UNKNOWN_LOCATION
;
11957 gcc_assert (TREE_CODE (qualified_id
) == SCOPE_REF
);
11959 /* Figure out what name to look up. */
11960 name
= TREE_OPERAND (qualified_id
, 1);
11961 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
11963 is_template
= true;
11964 loc
= EXPR_LOCATION (name
);
11965 template_args
= TREE_OPERAND (name
, 1);
11967 template_args
= tsubst_template_args (template_args
, args
,
11968 complain
, in_decl
);
11969 name
= TREE_OPERAND (name
, 0);
11973 is_template
= false;
11974 template_args
= NULL_TREE
;
11977 /* Substitute into the qualifying scope. When there are no ARGS, we
11978 are just trying to simplify a non-dependent expression. In that
11979 case the qualifying scope may be dependent, and, in any case,
11980 substituting will not help. */
11981 scope
= TREE_OPERAND (qualified_id
, 0);
11984 scope
= tsubst (scope
, args
, complain
, in_decl
);
11985 expr
= tsubst_copy (name
, args
, complain
, in_decl
);
11990 if (dependent_scope_p (scope
))
11993 expr
= build_min_nt_loc (loc
, TEMPLATE_ID_EXPR
, expr
, template_args
);
11994 return build_qualified_name (NULL_TREE
, scope
, expr
,
11995 QUALIFIED_NAME_IS_TEMPLATE (qualified_id
));
11998 if (!BASELINK_P (name
) && !DECL_P (expr
))
12000 if (TREE_CODE (expr
) == BIT_NOT_EXPR
)
12002 /* A BIT_NOT_EXPR is used to represent a destructor. */
12003 if (!check_dtor_name (scope
, TREE_OPERAND (expr
, 0)))
12005 error ("qualifying type %qT does not match destructor name ~%qT",
12006 scope
, TREE_OPERAND (expr
, 0));
12007 expr
= error_mark_node
;
12010 expr
= lookup_qualified_name (scope
, complete_dtor_identifier
,
12011 /*is_type_p=*/0, false);
12014 expr
= lookup_qualified_name (scope
, expr
, /*is_type_p=*/0, false);
12015 if (TREE_CODE (TREE_CODE (expr
) == TEMPLATE_DECL
12016 ? DECL_TEMPLATE_RESULT (expr
) : expr
) == TYPE_DECL
)
12018 if (complain
& tf_error
)
12020 error ("dependent-name %qE is parsed as a non-type, but "
12021 "instantiation yields a type", qualified_id
);
12022 inform (input_location
, "say %<typename %E%> if a type is meant", qualified_id
);
12024 return error_mark_node
;
12030 check_accessibility_of_qualified_id (expr
, /*object_type=*/NULL_TREE
,
12032 /* Remember that there was a reference to this entity. */
12036 if (expr
== error_mark_node
|| TREE_CODE (expr
) == TREE_LIST
)
12038 if (complain
& tf_error
)
12039 qualified_name_lookup_error (scope
,
12040 TREE_OPERAND (qualified_id
, 1),
12041 expr
, input_location
);
12042 return error_mark_node
;
12046 expr
= lookup_template_function (expr
, template_args
);
12048 if (expr
== error_mark_node
&& complain
& tf_error
)
12049 qualified_name_lookup_error (scope
, TREE_OPERAND (qualified_id
, 1),
12050 expr
, input_location
);
12051 else if (TYPE_P (scope
))
12053 expr
= (adjust_result_of_qualified_name_lookup
12054 (expr
, scope
, current_nonlambda_class_type ()));
12055 expr
= (finish_qualified_id_expr
12056 (scope
, expr
, done
, address_p
&& PTRMEM_OK_P (qualified_id
),
12057 QUALIFIED_NAME_IS_TEMPLATE (qualified_id
),
12058 /*template_arg_p=*/false));
12061 /* Expressions do not generally have reference type. */
12062 if (TREE_CODE (expr
) != SCOPE_REF
12063 /* However, if we're about to form a pointer-to-member, we just
12064 want the referenced member referenced. */
12065 && TREE_CODE (expr
) != OFFSET_REF
)
12066 expr
= convert_from_reference (expr
);
12071 /* Like tsubst, but deals with expressions. This function just replaces
12072 template parms; to finish processing the resultant expression, use
12073 tsubst_copy_and_build or tsubst_expr. */
12076 tsubst_copy (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
12078 enum tree_code code
;
12081 if (t
== NULL_TREE
|| t
== error_mark_node
|| args
== NULL_TREE
)
12084 code
= TREE_CODE (t
);
12089 r
= retrieve_local_specialization (t
);
12091 if (r
== NULL_TREE
)
12093 /* We get here for a use of 'this' in an NSDMI. */
12094 if (DECL_NAME (t
) == this_identifier
12095 && at_function_scope_p ()
12096 && DECL_CONSTRUCTOR_P (current_function_decl
))
12097 return current_class_ptr
;
12099 /* This can happen for a parameter name used later in a function
12100 declaration (such as in a late-specified return type). Just
12101 make a dummy decl, since it's only used for its type. */
12102 gcc_assert (cp_unevaluated_operand
!= 0);
12103 r
= tsubst_decl (t
, args
, complain
);
12104 /* Give it the template pattern as its context; its true context
12105 hasn't been instantiated yet and this is good enough for
12107 DECL_CONTEXT (r
) = DECL_CONTEXT (t
);
12110 if (TREE_CODE (r
) == ARGUMENT_PACK_SELECT
)
12111 r
= ARGUMENT_PACK_SELECT_ARG (r
);
12120 if (DECL_TEMPLATE_PARM_P (t
))
12121 return tsubst_copy (DECL_INITIAL (t
), args
, complain
, in_decl
);
12122 /* There is no need to substitute into namespace-scope
12124 if (DECL_NAMESPACE_SCOPE_P (t
))
12126 /* If ARGS is NULL, then T is known to be non-dependent. */
12127 if (args
== NULL_TREE
)
12128 return integral_constant_value (t
);
12130 /* Unfortunately, we cannot just call lookup_name here.
12133 template <int I> int f() {
12135 struct S { void g() { E e = a; } };
12138 When we instantiate f<7>::S::g(), say, lookup_name is not
12139 clever enough to find f<7>::a. */
12141 = tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
12142 /*entering_scope=*/0);
12144 for (v
= TYPE_VALUES (enum_type
);
12146 v
= TREE_CHAIN (v
))
12147 if (TREE_PURPOSE (v
) == DECL_NAME (t
))
12148 return TREE_VALUE (v
);
12150 /* We didn't find the name. That should never happen; if
12151 name-lookup found it during preliminary parsing, we
12152 should find it again here during instantiation. */
12153 gcc_unreachable ();
12158 if (DECL_CONTEXT (t
))
12162 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
12163 /*entering_scope=*/1);
12164 if (ctx
!= DECL_CONTEXT (t
))
12166 tree r
= lookup_field (ctx
, DECL_NAME (t
), 0, false);
12169 if (complain
& tf_error
)
12170 error ("using invalid field %qD", t
);
12171 return error_mark_node
;
12180 case FUNCTION_DECL
:
12181 if ((DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
))
12182 || local_variable_p (t
))
12183 t
= tsubst (t
, args
, complain
, in_decl
);
12187 case NAMESPACE_DECL
:
12191 /* An OVERLOAD will always be a non-dependent overload set; an
12192 overload set from function scope will just be represented with an
12193 IDENTIFIER_NODE, and from class scope with a BASELINK. */
12194 gcc_assert (!uses_template_parms (t
));
12198 return tsubst_baselink (t
, current_class_type
, args
, complain
, in_decl
);
12200 case TEMPLATE_DECL
:
12201 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
12202 return tsubst (TREE_TYPE (DECL_TEMPLATE_RESULT (t
)),
12203 args
, complain
, in_decl
);
12204 else if (DECL_FUNCTION_TEMPLATE_P (t
) && DECL_MEMBER_TEMPLATE_P (t
))
12205 return tsubst (t
, args
, complain
, in_decl
);
12206 else if (DECL_CLASS_SCOPE_P (t
)
12207 && uses_template_parms (DECL_CONTEXT (t
)))
12209 /* Template template argument like the following example need
12212 template <template <class> class TT> struct C {};
12213 template <class T> struct D {
12214 template <class U> struct E {};
12219 We are processing the template argument `E' in #1 for
12220 the template instantiation #2. Originally, `E' is a
12221 TEMPLATE_DECL with `D<T>' as its DECL_CONTEXT. Now we
12222 have to substitute this with one having context `D<int>'. */
12224 tree context
= tsubst (DECL_CONTEXT (t
), args
, complain
, in_decl
);
12225 return lookup_field (context
, DECL_NAME(t
), 0, false);
12228 /* Ordinary template template argument. */
12232 case REINTERPRET_CAST_EXPR
:
12233 case CONST_CAST_EXPR
:
12234 case STATIC_CAST_EXPR
:
12235 case DYNAMIC_CAST_EXPR
:
12236 case IMPLICIT_CONV_EXPR
:
12240 (code
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
12241 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
));
12244 if (PACK_EXPANSION_P (TREE_OPERAND (t
, 0)))
12247 tree expanded
, op
= TREE_OPERAND (t
, 0);
12250 if (SIZEOF_EXPR_TYPE_P (t
))
12251 op
= TREE_TYPE (op
);
12253 ++cp_unevaluated_operand
;
12254 ++c_inhibit_evaluation_warnings
;
12255 /* We only want to compute the number of arguments. */
12256 expanded
= tsubst_pack_expansion (op
, args
, complain
, in_decl
);
12257 --cp_unevaluated_operand
;
12258 --c_inhibit_evaluation_warnings
;
12260 if (TREE_CODE (expanded
) == TREE_VEC
)
12261 len
= TREE_VEC_LENGTH (expanded
);
12263 if (expanded
== error_mark_node
)
12264 return error_mark_node
;
12265 else if (PACK_EXPANSION_P (expanded
)
12266 || (TREE_CODE (expanded
) == TREE_VEC
12268 && PACK_EXPANSION_P (TREE_VEC_ELT (expanded
, len
-1))))
12270 if (TREE_CODE (expanded
) == TREE_VEC
)
12271 expanded
= TREE_VEC_ELT (expanded
, len
- 1);
12273 if (TYPE_P (expanded
))
12274 return cxx_sizeof_or_alignof_type (expanded
, SIZEOF_EXPR
,
12275 complain
& tf_error
);
12277 return cxx_sizeof_or_alignof_expr (expanded
, SIZEOF_EXPR
,
12278 complain
& tf_error
);
12281 return build_int_cst (size_type_node
, len
);
12283 if (SIZEOF_EXPR_TYPE_P (t
))
12285 r
= tsubst (TREE_TYPE (TREE_OPERAND (t
, 0)),
12286 args
, complain
, in_decl
);
12287 r
= build1 (NOP_EXPR
, r
, error_mark_node
);
12288 r
= build1 (SIZEOF_EXPR
,
12289 tsubst (TREE_TYPE (t
), args
, complain
, in_decl
), r
);
12290 SIZEOF_EXPR_TYPE_P (r
) = 1;
12297 case TRUTH_NOT_EXPR
:
12300 case UNARY_PLUS_EXPR
: /* Unary + */
12302 case AT_ENCODE_EXPR
:
12306 case REALPART_EXPR
:
12307 case IMAGPART_EXPR
:
12310 (code
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
12311 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
));
12313 case COMPONENT_REF
:
12318 object
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
12319 name
= TREE_OPERAND (t
, 1);
12320 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
12322 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
12323 complain
, in_decl
);
12324 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
12326 else if (TREE_CODE (name
) == SCOPE_REF
12327 && TREE_CODE (TREE_OPERAND (name
, 1)) == BIT_NOT_EXPR
)
12329 tree base
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
12330 complain
, in_decl
);
12331 name
= TREE_OPERAND (name
, 1);
12332 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
12333 complain
, in_decl
);
12334 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
12335 name
= build_qualified_name (/*type=*/NULL_TREE
,
12337 /*template_p=*/false);
12339 else if (BASELINK_P (name
))
12340 name
= tsubst_baselink (name
,
12341 non_reference (TREE_TYPE (object
)),
12345 name
= tsubst_copy (name
, args
, complain
, in_decl
);
12346 return build_nt (COMPONENT_REF
, object
, name
, NULL_TREE
);
12352 case TRUNC_DIV_EXPR
:
12353 case CEIL_DIV_EXPR
:
12354 case FLOOR_DIV_EXPR
:
12355 case ROUND_DIV_EXPR
:
12356 case EXACT_DIV_EXPR
:
12360 case TRUNC_MOD_EXPR
:
12361 case FLOOR_MOD_EXPR
:
12362 case TRUTH_ANDIF_EXPR
:
12363 case TRUTH_ORIF_EXPR
:
12364 case TRUTH_AND_EXPR
:
12365 case TRUTH_OR_EXPR
:
12378 case COMPOUND_EXPR
:
12381 case PREDECREMENT_EXPR
:
12382 case PREINCREMENT_EXPR
:
12383 case POSTDECREMENT_EXPR
:
12384 case POSTINCREMENT_EXPR
:
12386 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
12387 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
));
12390 return build_qualified_name (/*type=*/NULL_TREE
,
12391 tsubst_copy (TREE_OPERAND (t
, 0),
12392 args
, complain
, in_decl
),
12393 tsubst_copy (TREE_OPERAND (t
, 1),
12394 args
, complain
, in_decl
),
12395 QUALIFIED_NAME_IS_TEMPLATE (t
));
12400 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
12401 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
),
12402 NULL_TREE
, NULL_TREE
);
12406 int n
= VL_EXP_OPERAND_LENGTH (t
);
12407 tree result
= build_vl_exp (CALL_EXPR
, n
);
12409 for (i
= 0; i
< n
; i
++)
12410 TREE_OPERAND (t
, i
) = tsubst_copy (TREE_OPERAND (t
, i
), args
,
12411 complain
, in_decl
);
12417 case PSEUDO_DTOR_EXPR
:
12420 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
12421 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
),
12422 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
));
12423 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
12430 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
12431 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
),
12432 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
));
12433 NEW_EXPR_USE_GLOBAL (r
) = NEW_EXPR_USE_GLOBAL (t
);
12440 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
12441 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
));
12442 DELETE_EXPR_USE_GLOBAL (r
) = DELETE_EXPR_USE_GLOBAL (t
);
12443 DELETE_EXPR_USE_VEC (r
) = DELETE_EXPR_USE_VEC (t
);
12447 case TEMPLATE_ID_EXPR
:
12449 /* Substituted template arguments */
12450 tree fn
= TREE_OPERAND (t
, 0);
12451 tree targs
= TREE_OPERAND (t
, 1);
12453 fn
= tsubst_copy (fn
, args
, complain
, in_decl
);
12455 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
12457 return lookup_template_function (fn
, targs
);
12462 tree purpose
, value
, chain
;
12464 if (t
== void_list_node
)
12467 purpose
= TREE_PURPOSE (t
);
12469 purpose
= tsubst_copy (purpose
, args
, complain
, in_decl
);
12470 value
= TREE_VALUE (t
);
12472 value
= tsubst_copy (value
, args
, complain
, in_decl
);
12473 chain
= TREE_CHAIN (t
);
12474 if (chain
&& chain
!= void_type_node
)
12475 chain
= tsubst_copy (chain
, args
, complain
, in_decl
);
12476 if (purpose
== TREE_PURPOSE (t
)
12477 && value
== TREE_VALUE (t
)
12478 && chain
== TREE_CHAIN (t
))
12480 return tree_cons (purpose
, value
, chain
);
12485 case ENUMERAL_TYPE
:
12487 case TEMPLATE_TYPE_PARM
:
12488 case TEMPLATE_TEMPLATE_PARM
:
12489 case BOUND_TEMPLATE_TEMPLATE_PARM
:
12490 case TEMPLATE_PARM_INDEX
:
12492 case REFERENCE_TYPE
:
12494 case FUNCTION_TYPE
:
12497 case TYPENAME_TYPE
:
12498 case UNBOUND_CLASS_TEMPLATE
:
12500 case DECLTYPE_TYPE
:
12502 return tsubst (t
, args
, complain
, in_decl
);
12504 case IDENTIFIER_NODE
:
12505 if (IDENTIFIER_TYPENAME_P (t
))
12507 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12508 return mangle_conv_op_name_for_type (new_type
);
12514 /* This is handled by tsubst_copy_and_build. */
12515 gcc_unreachable ();
12518 return build_x_va_arg (EXPR_LOCATION (t
),
12519 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
,
12521 tsubst (TREE_TYPE (t
), args
, complain
, in_decl
));
12523 case CLEANUP_POINT_EXPR
:
12524 /* We shouldn't have built any of these during initial template
12525 generation. Instead, they should be built during instantiation
12526 in response to the saved STMT_IS_FULL_EXPR_P setting. */
12527 gcc_unreachable ();
12531 (code
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
12532 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
12533 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
));
12534 PTRMEM_OK_P (r
) = PTRMEM_OK_P (t
);
12535 mark_used (TREE_OPERAND (r
, 1));
12538 case EXPR_PACK_EXPANSION
:
12539 error ("invalid use of pack expansion expression");
12540 return error_mark_node
;
12542 case NONTYPE_ARGUMENT_PACK
:
12543 error ("use %<...%> to expand argument pack");
12544 return error_mark_node
;
12551 /* Instantiate any typedefs in the type. */
12552 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12553 r
= fold_convert (type
, t
);
12554 gcc_assert (TREE_CODE (r
) == code
);
12559 /* These can sometimes show up in a partial instantiation, but never
12560 involve template parms. */
12561 gcc_assert (!uses_template_parms (t
));
12565 /* We shouldn't get here, but keep going if !ENABLE_CHECKING. */
12566 gcc_checking_assert (false);
12571 /* Like tsubst_copy, but specifically for OpenMP clauses. */
12574 tsubst_omp_clauses (tree clauses
, tree args
, tsubst_flags_t complain
,
12577 tree new_clauses
= NULL
, nc
, oc
;
12579 for (oc
= clauses
; oc
; oc
= OMP_CLAUSE_CHAIN (oc
))
12581 nc
= copy_node (oc
);
12582 OMP_CLAUSE_CHAIN (nc
) = new_clauses
;
12585 switch (OMP_CLAUSE_CODE (nc
))
12587 case OMP_CLAUSE_LASTPRIVATE
:
12588 if (OMP_CLAUSE_LASTPRIVATE_STMT (oc
))
12590 OMP_CLAUSE_LASTPRIVATE_STMT (nc
) = push_stmt_list ();
12591 tsubst_expr (OMP_CLAUSE_LASTPRIVATE_STMT (oc
), args
, complain
,
12592 in_decl
, /*integral_constant_expression_p=*/false);
12593 OMP_CLAUSE_LASTPRIVATE_STMT (nc
)
12594 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (nc
));
12597 case OMP_CLAUSE_PRIVATE
:
12598 case OMP_CLAUSE_SHARED
:
12599 case OMP_CLAUSE_FIRSTPRIVATE
:
12600 case OMP_CLAUSE_REDUCTION
:
12601 case OMP_CLAUSE_COPYIN
:
12602 case OMP_CLAUSE_COPYPRIVATE
:
12603 case OMP_CLAUSE_IF
:
12604 case OMP_CLAUSE_NUM_THREADS
:
12605 case OMP_CLAUSE_SCHEDULE
:
12606 case OMP_CLAUSE_COLLAPSE
:
12607 case OMP_CLAUSE_FINAL
:
12608 OMP_CLAUSE_OPERAND (nc
, 0)
12609 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 0), args
, complain
,
12610 in_decl
, /*integral_constant_expression_p=*/false);
12612 case OMP_CLAUSE_NOWAIT
:
12613 case OMP_CLAUSE_ORDERED
:
12614 case OMP_CLAUSE_DEFAULT
:
12615 case OMP_CLAUSE_UNTIED
:
12616 case OMP_CLAUSE_MERGEABLE
:
12619 gcc_unreachable ();
12623 return finish_omp_clauses (nreverse (new_clauses
));
12626 /* Like tsubst_copy_and_build, but unshare TREE_LIST nodes. */
12629 tsubst_copy_asm_operands (tree t
, tree args
, tsubst_flags_t complain
,
12632 #define RECUR(t) tsubst_copy_asm_operands (t, args, complain, in_decl)
12634 tree purpose
, value
, chain
;
12639 if (TREE_CODE (t
) != TREE_LIST
)
12640 return tsubst_copy_and_build (t
, args
, complain
, in_decl
,
12641 /*function_p=*/false,
12642 /*integral_constant_expression_p=*/false);
12644 if (t
== void_list_node
)
12647 purpose
= TREE_PURPOSE (t
);
12649 purpose
= RECUR (purpose
);
12650 value
= TREE_VALUE (t
);
12653 if (TREE_CODE (value
) != LABEL_DECL
)
12654 value
= RECUR (value
);
12657 value
= lookup_label (DECL_NAME (value
));
12658 gcc_assert (TREE_CODE (value
) == LABEL_DECL
);
12659 TREE_USED (value
) = 1;
12662 chain
= TREE_CHAIN (t
);
12663 if (chain
&& chain
!= void_type_node
)
12664 chain
= RECUR (chain
);
12665 return tree_cons (purpose
, value
, chain
);
12669 /* Substitute one OMP_FOR iterator. */
12672 tsubst_omp_for_iterator (tree t
, int i
, tree declv
, tree initv
,
12673 tree condv
, tree incrv
, tree
*clauses
,
12674 tree args
, tsubst_flags_t complain
, tree in_decl
,
12675 bool integral_constant_expression_p
)
12677 #define RECUR(NODE) \
12678 tsubst_expr ((NODE), args, complain, in_decl, \
12679 integral_constant_expression_p)
12680 tree decl
, init
, cond
, incr
;
12683 init
= TREE_VEC_ELT (OMP_FOR_INIT (t
), i
);
12684 gcc_assert (TREE_CODE (init
) == MODIFY_EXPR
);
12685 decl
= TREE_OPERAND (init
, 0);
12686 init
= TREE_OPERAND (init
, 1);
12687 /* Do this before substituting into decl to handle 'auto'. */
12688 init_decl
= (init
&& TREE_CODE (init
) == DECL_EXPR
);
12689 init
= RECUR (init
);
12690 decl
= RECUR (decl
);
12693 gcc_assert (!processing_template_decl
);
12694 init
= DECL_INITIAL (decl
);
12695 DECL_INITIAL (decl
) = NULL_TREE
;
12698 gcc_assert (!type_dependent_expression_p (decl
));
12700 if (!CLASS_TYPE_P (TREE_TYPE (decl
)))
12702 cond
= RECUR (TREE_VEC_ELT (OMP_FOR_COND (t
), i
));
12703 incr
= TREE_VEC_ELT (OMP_FOR_INCR (t
), i
);
12704 if (TREE_CODE (incr
) == MODIFY_EXPR
)
12705 incr
= build_x_modify_expr (EXPR_LOCATION (incr
),
12706 RECUR (TREE_OPERAND (incr
, 0)), NOP_EXPR
,
12707 RECUR (TREE_OPERAND (incr
, 1)),
12710 incr
= RECUR (incr
);
12711 TREE_VEC_ELT (declv
, i
) = decl
;
12712 TREE_VEC_ELT (initv
, i
) = init
;
12713 TREE_VEC_ELT (condv
, i
) = cond
;
12714 TREE_VEC_ELT (incrv
, i
) = incr
;
12718 if (init
&& !init_decl
)
12721 for (c
= *clauses
; c
; c
= OMP_CLAUSE_CHAIN (c
))
12723 if ((OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_PRIVATE
12724 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_LASTPRIVATE
)
12725 && OMP_CLAUSE_DECL (c
) == decl
)
12727 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_FIRSTPRIVATE
12728 && OMP_CLAUSE_DECL (c
) == decl
)
12729 error ("iteration variable %qD should not be firstprivate", decl
);
12730 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
12731 && OMP_CLAUSE_DECL (c
) == decl
)
12732 error ("iteration variable %qD should not be reduction", decl
);
12736 c
= build_omp_clause (input_location
, OMP_CLAUSE_PRIVATE
);
12737 OMP_CLAUSE_DECL (c
) = decl
;
12738 c
= finish_omp_clauses (c
);
12741 OMP_CLAUSE_CHAIN (c
) = *clauses
;
12746 cond
= TREE_VEC_ELT (OMP_FOR_COND (t
), i
);
12747 if (COMPARISON_CLASS_P (cond
))
12748 cond
= build2 (TREE_CODE (cond
), boolean_type_node
,
12749 RECUR (TREE_OPERAND (cond
, 0)),
12750 RECUR (TREE_OPERAND (cond
, 1)));
12752 cond
= RECUR (cond
);
12753 incr
= TREE_VEC_ELT (OMP_FOR_INCR (t
), i
);
12754 switch (TREE_CODE (incr
))
12756 case PREINCREMENT_EXPR
:
12757 case PREDECREMENT_EXPR
:
12758 case POSTINCREMENT_EXPR
:
12759 case POSTDECREMENT_EXPR
:
12760 incr
= build2 (TREE_CODE (incr
), TREE_TYPE (decl
),
12761 RECUR (TREE_OPERAND (incr
, 0)), NULL_TREE
);
12764 if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
12765 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
12767 tree rhs
= TREE_OPERAND (incr
, 1);
12768 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
),
12769 RECUR (TREE_OPERAND (incr
, 0)),
12770 build2 (TREE_CODE (rhs
), TREE_TYPE (decl
),
12771 RECUR (TREE_OPERAND (rhs
, 0)),
12772 RECUR (TREE_OPERAND (rhs
, 1))));
12775 incr
= RECUR (incr
);
12778 if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
12779 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
12781 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
12782 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
12783 build2 (TREE_CODE (TREE_OPERAND (incr
, 1)),
12784 TREE_TYPE (decl
), lhs
,
12785 RECUR (TREE_OPERAND (incr
, 2))));
12787 else if (TREE_CODE (TREE_OPERAND (incr
, 1)) == NOP_EXPR
12788 && (TREE_CODE (TREE_OPERAND (incr
, 2)) == PLUS_EXPR
12789 || (TREE_CODE (TREE_OPERAND (incr
, 2)) == MINUS_EXPR
)))
12791 tree rhs
= TREE_OPERAND (incr
, 2);
12792 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
),
12793 RECUR (TREE_OPERAND (incr
, 0)),
12794 build2 (TREE_CODE (rhs
), TREE_TYPE (decl
),
12795 RECUR (TREE_OPERAND (rhs
, 0)),
12796 RECUR (TREE_OPERAND (rhs
, 1))));
12799 incr
= RECUR (incr
);
12802 incr
= RECUR (incr
);
12806 TREE_VEC_ELT (declv
, i
) = decl
;
12807 TREE_VEC_ELT (initv
, i
) = init
;
12808 TREE_VEC_ELT (condv
, i
) = cond
;
12809 TREE_VEC_ELT (incrv
, i
) = incr
;
12813 /* Like tsubst_copy for expressions, etc. but also does semantic
12817 tsubst_expr (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
,
12818 bool integral_constant_expression_p
)
12820 #define RETURN(EXP) do { r = (EXP); goto out; } while(0)
12821 #define RECUR(NODE) \
12822 tsubst_expr ((NODE), args, complain, in_decl, \
12823 integral_constant_expression_p)
12829 if (t
== NULL_TREE
|| t
== error_mark_node
)
12832 loc
= input_location
;
12833 if (EXPR_HAS_LOCATION (t
))
12834 input_location
= EXPR_LOCATION (t
);
12835 if (STATEMENT_CODE_P (TREE_CODE (t
)))
12836 current_stmt_tree ()->stmts_are_full_exprs_p
= STMT_IS_FULL_EXPR_P (t
);
12838 switch (TREE_CODE (t
))
12840 case STATEMENT_LIST
:
12842 tree_stmt_iterator i
;
12843 for (i
= tsi_start (t
); !tsi_end_p (i
); tsi_next (&i
))
12844 RECUR (tsi_stmt (i
));
12848 case CTOR_INITIALIZER
:
12849 finish_mem_initializers (tsubst_initializer_list
12850 (TREE_OPERAND (t
, 0), args
));
12854 finish_return_stmt (RECUR (TREE_OPERAND (t
, 0)));
12858 tmp
= RECUR (EXPR_STMT_EXPR (t
));
12859 if (EXPR_STMT_STMT_EXPR_RESULT (t
))
12860 finish_stmt_expr_expr (tmp
, cur_stmt_expr
);
12862 finish_expr_stmt (tmp
);
12866 do_using_directive (USING_STMT_NAMESPACE (t
));
12871 tree decl
, pattern_decl
;
12874 pattern_decl
= decl
= DECL_EXPR_DECL (t
);
12875 if (TREE_CODE (decl
) == LABEL_DECL
)
12876 finish_label_decl (DECL_NAME (decl
));
12877 else if (TREE_CODE (decl
) == USING_DECL
)
12879 tree scope
= USING_DECL_SCOPE (decl
);
12880 tree name
= DECL_NAME (decl
);
12883 scope
= tsubst (scope
, args
, complain
, in_decl
);
12884 decl
= lookup_qualified_name (scope
, name
,
12885 /*is_type_p=*/false,
12886 /*complain=*/false);
12887 if (decl
== error_mark_node
|| TREE_CODE (decl
) == TREE_LIST
)
12888 qualified_name_lookup_error (scope
, name
, decl
, input_location
);
12890 do_local_using_decl (decl
, scope
, name
);
12894 init
= DECL_INITIAL (decl
);
12895 decl
= tsubst (decl
, args
, complain
, in_decl
);
12896 if (decl
!= error_mark_node
)
12898 /* By marking the declaration as instantiated, we avoid
12899 trying to instantiate it. Since instantiate_decl can't
12900 handle local variables, and since we've already done
12901 all that needs to be done, that's the right thing to
12904 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
12906 && ANON_AGGR_TYPE_P (TREE_TYPE (decl
)))
12907 /* Anonymous aggregates are a special case. */
12908 finish_anon_union (decl
);
12909 else if (is_capture_proxy (DECL_EXPR_DECL (t
)))
12911 DECL_CONTEXT (decl
) = current_function_decl
;
12912 if (DECL_NAME (decl
) == this_identifier
)
12914 tree lam
= DECL_CONTEXT (current_function_decl
);
12915 lam
= CLASSTYPE_LAMBDA_EXPR (lam
);
12916 LAMBDA_EXPR_THIS_CAPTURE (lam
) = decl
;
12918 insert_capture_proxy (decl
);
12920 else if (DECL_IMPLICIT_TYPEDEF_P (t
))
12921 /* We already did a pushtag. */;
12924 int const_init
= false;
12925 maybe_push_decl (decl
);
12927 && DECL_PRETTY_FUNCTION_P (decl
))
12929 /* For __PRETTY_FUNCTION__ we have to adjust the
12931 const char *const name
12932 = cxx_printable_name (current_function_decl
, 2);
12933 init
= cp_fname_init (name
, &TREE_TYPE (decl
));
12937 tree t
= RECUR (init
);
12941 /* If we had an initializer but it
12942 instantiated to nothing,
12943 value-initialize the object. This will
12944 only occur when the initializer was a
12945 pack expansion where the parameter packs
12946 used in that expansion were of length
12948 init
= build_value_init (TREE_TYPE (decl
),
12950 if (TREE_CODE (init
) == AGGR_INIT_EXPR
)
12951 init
= get_target_expr_sfinae (init
, complain
);
12958 const_init
= (DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P
12960 cp_finish_decl (decl
, init
, const_init
, NULL_TREE
, 0);
12969 stmt
= begin_for_stmt (NULL_TREE
, NULL_TREE
);
12970 RECUR (FOR_INIT_STMT (t
));
12971 finish_for_init_stmt (stmt
);
12972 tmp
= RECUR (FOR_COND (t
));
12973 finish_for_cond (tmp
, stmt
);
12974 tmp
= RECUR (FOR_EXPR (t
));
12975 finish_for_expr (tmp
, stmt
);
12976 RECUR (FOR_BODY (t
));
12977 finish_for_stmt (stmt
);
12980 case RANGE_FOR_STMT
:
12983 stmt
= begin_for_stmt (NULL_TREE
, NULL_TREE
);
12984 decl
= RANGE_FOR_DECL (t
);
12985 decl
= tsubst (decl
, args
, complain
, in_decl
);
12986 maybe_push_decl (decl
);
12987 expr
= RECUR (RANGE_FOR_EXPR (t
));
12988 stmt
= cp_convert_range_for (stmt
, decl
, expr
);
12989 RECUR (RANGE_FOR_BODY (t
));
12990 finish_for_stmt (stmt
);
12995 stmt
= begin_while_stmt ();
12996 tmp
= RECUR (WHILE_COND (t
));
12997 finish_while_stmt_cond (tmp
, stmt
);
12998 RECUR (WHILE_BODY (t
));
12999 finish_while_stmt (stmt
);
13003 stmt
= begin_do_stmt ();
13004 RECUR (DO_BODY (t
));
13005 finish_do_body (stmt
);
13006 tmp
= RECUR (DO_COND (t
));
13007 finish_do_stmt (tmp
, stmt
);
13011 stmt
= begin_if_stmt ();
13012 tmp
= RECUR (IF_COND (t
));
13013 finish_if_stmt_cond (tmp
, stmt
);
13014 RECUR (THEN_CLAUSE (t
));
13015 finish_then_clause (stmt
);
13017 if (ELSE_CLAUSE (t
))
13019 begin_else_clause (stmt
);
13020 RECUR (ELSE_CLAUSE (t
));
13021 finish_else_clause (stmt
);
13024 finish_if_stmt (stmt
);
13028 if (BIND_EXPR_BODY_BLOCK (t
))
13029 stmt
= begin_function_body ();
13031 stmt
= begin_compound_stmt (BIND_EXPR_TRY_BLOCK (t
)
13032 ? BCS_TRY_BLOCK
: 0);
13034 RECUR (BIND_EXPR_BODY (t
));
13036 if (BIND_EXPR_BODY_BLOCK (t
))
13037 finish_function_body (stmt
);
13039 finish_compound_stmt (stmt
);
13043 finish_break_stmt ();
13046 case CONTINUE_STMT
:
13047 finish_continue_stmt ();
13051 stmt
= begin_switch_stmt ();
13052 tmp
= RECUR (SWITCH_STMT_COND (t
));
13053 finish_switch_cond (tmp
, stmt
);
13054 RECUR (SWITCH_STMT_BODY (t
));
13055 finish_switch_stmt (stmt
);
13058 case CASE_LABEL_EXPR
:
13059 finish_case_label (EXPR_LOCATION (t
),
13060 RECUR (CASE_LOW (t
)),
13061 RECUR (CASE_HIGH (t
)));
13066 tree decl
= LABEL_EXPR_LABEL (t
);
13069 label
= finish_label_stmt (DECL_NAME (decl
));
13070 if (DECL_ATTRIBUTES (decl
) != NULL_TREE
)
13071 cplus_decl_attributes (&label
, DECL_ATTRIBUTES (decl
), 0);
13076 tmp
= GOTO_DESTINATION (t
);
13077 if (TREE_CODE (tmp
) != LABEL_DECL
)
13078 /* Computed goto's must be tsubst'd into. On the other hand,
13079 non-computed gotos must not be; the identifier in question
13080 will have no binding. */
13083 tmp
= DECL_NAME (tmp
);
13084 finish_goto_stmt (tmp
);
13088 tmp
= finish_asm_stmt
13089 (ASM_VOLATILE_P (t
),
13090 RECUR (ASM_STRING (t
)),
13091 tsubst_copy_asm_operands (ASM_OUTPUTS (t
), args
, complain
, in_decl
),
13092 tsubst_copy_asm_operands (ASM_INPUTS (t
), args
, complain
, in_decl
),
13093 tsubst_copy_asm_operands (ASM_CLOBBERS (t
), args
, complain
, in_decl
),
13094 tsubst_copy_asm_operands (ASM_LABELS (t
), args
, complain
, in_decl
));
13096 tree asm_expr
= tmp
;
13097 if (TREE_CODE (asm_expr
) == CLEANUP_POINT_EXPR
)
13098 asm_expr
= TREE_OPERAND (asm_expr
, 0);
13099 ASM_INPUT_P (asm_expr
) = ASM_INPUT_P (t
);
13106 stmt
= begin_try_block ();
13107 RECUR (TRY_STMTS (t
));
13108 finish_cleanup_try_block (stmt
);
13109 finish_cleanup (RECUR (TRY_HANDLERS (t
)), stmt
);
13113 tree compound_stmt
= NULL_TREE
;
13115 if (FN_TRY_BLOCK_P (t
))
13116 stmt
= begin_function_try_block (&compound_stmt
);
13118 stmt
= begin_try_block ();
13120 RECUR (TRY_STMTS (t
));
13122 if (FN_TRY_BLOCK_P (t
))
13123 finish_function_try_block (stmt
);
13125 finish_try_block (stmt
);
13127 RECUR (TRY_HANDLERS (t
));
13128 if (FN_TRY_BLOCK_P (t
))
13129 finish_function_handler_sequence (stmt
, compound_stmt
);
13131 finish_handler_sequence (stmt
);
13137 tree decl
= HANDLER_PARMS (t
);
13141 decl
= tsubst (decl
, args
, complain
, in_decl
);
13142 /* Prevent instantiate_decl from trying to instantiate
13143 this variable. We've already done all that needs to be
13145 if (decl
!= error_mark_node
)
13146 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
13148 stmt
= begin_handler ();
13149 finish_handler_parms (decl
, stmt
);
13150 RECUR (HANDLER_BODY (t
));
13151 finish_handler (stmt
);
13156 tmp
= tsubst (TREE_TYPE (t
), args
, complain
, NULL_TREE
);
13157 if (CLASS_TYPE_P (tmp
))
13159 /* Local classes are not independent templates; they are
13160 instantiated along with their containing function. And this
13161 way we don't have to deal with pushing out of one local class
13162 to instantiate a member of another local class. */
13164 /* Closures are handled by the LAMBDA_EXPR. */
13165 gcc_assert (!LAMBDA_TYPE_P (TREE_TYPE (t
)));
13166 complete_type (tmp
);
13167 for (fn
= TYPE_METHODS (tmp
); fn
; fn
= DECL_CHAIN (fn
))
13168 if (!DECL_ARTIFICIAL (fn
))
13169 instantiate_decl (fn
, /*defer_ok*/0, /*expl_inst_class*/false);
13173 case STATIC_ASSERT
:
13177 ++c_inhibit_evaluation_warnings
;
13179 tsubst_expr (STATIC_ASSERT_CONDITION (t
),
13182 /*integral_constant_expression_p=*/true);
13183 --c_inhibit_evaluation_warnings
;
13185 finish_static_assert (condition
,
13186 STATIC_ASSERT_MESSAGE (t
),
13187 STATIC_ASSERT_SOURCE_LOCATION (t
),
13188 /*member_p=*/false);
13193 tmp
= tsubst_omp_clauses (OMP_PARALLEL_CLAUSES (t
),
13194 args
, complain
, in_decl
);
13195 stmt
= begin_omp_parallel ();
13196 RECUR (OMP_PARALLEL_BODY (t
));
13197 OMP_PARALLEL_COMBINED (finish_omp_parallel (tmp
, stmt
))
13198 = OMP_PARALLEL_COMBINED (t
);
13202 tmp
= tsubst_omp_clauses (OMP_TASK_CLAUSES (t
),
13203 args
, complain
, in_decl
);
13204 stmt
= begin_omp_task ();
13205 RECUR (OMP_TASK_BODY (t
));
13206 finish_omp_task (tmp
, stmt
);
13211 tree clauses
, body
, pre_body
;
13212 tree declv
, initv
, condv
, incrv
;
13215 clauses
= tsubst_omp_clauses (OMP_FOR_CLAUSES (t
),
13216 args
, complain
, in_decl
);
13217 declv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
13218 initv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
13219 condv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
13220 incrv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
13222 stmt
= begin_omp_structured_block ();
13224 for (i
= 0; i
< TREE_VEC_LENGTH (OMP_FOR_INIT (t
)); i
++)
13225 tsubst_omp_for_iterator (t
, i
, declv
, initv
, condv
, incrv
,
13226 &clauses
, args
, complain
, in_decl
,
13227 integral_constant_expression_p
);
13229 pre_body
= push_stmt_list ();
13230 RECUR (OMP_FOR_PRE_BODY (t
));
13231 pre_body
= pop_stmt_list (pre_body
);
13233 body
= push_stmt_list ();
13234 RECUR (OMP_FOR_BODY (t
));
13235 body
= pop_stmt_list (body
);
13237 t
= finish_omp_for (EXPR_LOCATION (t
), declv
, initv
, condv
, incrv
,
13238 body
, pre_body
, clauses
);
13240 add_stmt (finish_omp_structured_block (stmt
));
13246 tmp
= tsubst_omp_clauses (OMP_CLAUSES (t
), args
, complain
, in_decl
);
13247 stmt
= push_stmt_list ();
13248 RECUR (OMP_BODY (t
));
13249 stmt
= pop_stmt_list (stmt
);
13252 OMP_BODY (t
) = stmt
;
13253 OMP_CLAUSES (t
) = tmp
;
13261 stmt
= push_stmt_list ();
13262 RECUR (OMP_BODY (t
));
13263 stmt
= pop_stmt_list (stmt
);
13266 OMP_BODY (t
) = stmt
;
13271 gcc_assert (OMP_ATOMIC_DEPENDENT_P (t
));
13272 if (TREE_CODE (TREE_OPERAND (t
, 1)) != MODIFY_EXPR
)
13274 tree op1
= TREE_OPERAND (t
, 1);
13275 tree rhs1
= NULL_TREE
;
13277 if (TREE_CODE (op1
) == COMPOUND_EXPR
)
13279 rhs1
= RECUR (TREE_OPERAND (op1
, 0));
13280 op1
= TREE_OPERAND (op1
, 1);
13282 lhs
= RECUR (TREE_OPERAND (op1
, 0));
13283 rhs
= RECUR (TREE_OPERAND (op1
, 1));
13284 finish_omp_atomic (OMP_ATOMIC
, TREE_CODE (op1
), lhs
, rhs
,
13285 NULL_TREE
, NULL_TREE
, rhs1
);
13289 tree op1
= TREE_OPERAND (t
, 1);
13290 tree v
= NULL_TREE
, lhs
, rhs
= NULL_TREE
, lhs1
= NULL_TREE
;
13291 tree rhs1
= NULL_TREE
;
13292 enum tree_code code
= TREE_CODE (TREE_OPERAND (op1
, 1));
13293 enum tree_code opcode
= NOP_EXPR
;
13294 if (code
== OMP_ATOMIC_READ
)
13296 v
= RECUR (TREE_OPERAND (op1
, 0));
13297 lhs
= RECUR (TREE_OPERAND (TREE_OPERAND (op1
, 1), 0));
13299 else if (code
== OMP_ATOMIC_CAPTURE_OLD
13300 || code
== OMP_ATOMIC_CAPTURE_NEW
)
13302 tree op11
= TREE_OPERAND (TREE_OPERAND (op1
, 1), 1);
13303 v
= RECUR (TREE_OPERAND (op1
, 0));
13304 lhs1
= RECUR (TREE_OPERAND (TREE_OPERAND (op1
, 1), 0));
13305 if (TREE_CODE (op11
) == COMPOUND_EXPR
)
13307 rhs1
= RECUR (TREE_OPERAND (op11
, 0));
13308 op11
= TREE_OPERAND (op11
, 1);
13310 lhs
= RECUR (TREE_OPERAND (op11
, 0));
13311 rhs
= RECUR (TREE_OPERAND (op11
, 1));
13312 opcode
= TREE_CODE (op11
);
13317 lhs
= RECUR (TREE_OPERAND (op1
, 0));
13318 rhs
= RECUR (TREE_OPERAND (op1
, 1));
13320 finish_omp_atomic (code
, opcode
, lhs
, rhs
, v
, lhs1
, rhs1
);
13324 case TRANSACTION_EXPR
:
13327 flags
|= (TRANSACTION_EXPR_OUTER (t
) ? TM_STMT_ATTR_OUTER
: 0);
13328 flags
|= (TRANSACTION_EXPR_RELAXED (t
) ? TM_STMT_ATTR_RELAXED
: 0);
13330 if (TRANSACTION_EXPR_IS_STMT (t
))
13332 tree body
= TRANSACTION_EXPR_BODY (t
);
13333 tree noex
= NULL_TREE
;
13334 if (TREE_CODE (body
) == MUST_NOT_THROW_EXPR
)
13336 noex
= MUST_NOT_THROW_COND (body
);
13337 if (noex
== NULL_TREE
)
13338 noex
= boolean_true_node
;
13339 body
= TREE_OPERAND (body
, 0);
13341 stmt
= begin_transaction_stmt (input_location
, NULL
, flags
);
13343 finish_transaction_stmt (stmt
, NULL
, flags
, RECUR (noex
));
13347 stmt
= build_transaction_expr (EXPR_LOCATION (t
),
13348 RECUR (TRANSACTION_EXPR_BODY (t
)),
13355 case MUST_NOT_THROW_EXPR
:
13356 RETURN (build_must_not_throw_expr (RECUR (TREE_OPERAND (t
, 0)),
13357 RECUR (MUST_NOT_THROW_COND (t
))));
13359 case EXPR_PACK_EXPANSION
:
13360 error ("invalid use of pack expansion expression");
13361 RETURN (error_mark_node
);
13363 case NONTYPE_ARGUMENT_PACK
:
13364 error ("use %<...%> to expand argument pack");
13365 RETURN (error_mark_node
);
13367 case COMPOUND_EXPR
:
13368 tmp
= RECUR (TREE_OPERAND (t
, 0));
13369 if (tmp
== NULL_TREE
)
13370 /* If the first operand was a statement, we're done with it. */
13371 RETURN (RECUR (TREE_OPERAND (t
, 1)));
13372 RETURN (build_x_compound_expr (EXPR_LOCATION (t
), tmp
,
13373 RECUR (TREE_OPERAND (t
, 1)),
13377 gcc_assert (!STATEMENT_CODE_P (TREE_CODE (t
)));
13379 RETURN (tsubst_copy_and_build (t
, args
, complain
, in_decl
,
13380 /*function_p=*/false,
13381 integral_constant_expression_p
));
13384 RETURN (NULL_TREE
);
13386 input_location
= loc
;
13392 /* T is a postfix-expression that is not being used in a function
13393 call. Return the substituted version of T. */
13396 tsubst_non_call_postfix_expression (tree t
, tree args
,
13397 tsubst_flags_t complain
,
13400 if (TREE_CODE (t
) == SCOPE_REF
)
13401 t
= tsubst_qualified_id (t
, args
, complain
, in_decl
,
13402 /*done=*/false, /*address_p=*/false);
13404 t
= tsubst_copy_and_build (t
, args
, complain
, in_decl
,
13405 /*function_p=*/false,
13406 /*integral_constant_expression_p=*/false);
13411 /* Like tsubst but deals with expressions and performs semantic
13412 analysis. FUNCTION_P is true if T is the "F" in "F (ARGS)". */
13415 tsubst_copy_and_build (tree t
,
13417 tsubst_flags_t complain
,
13420 bool integral_constant_expression_p
)
13422 #define RETURN(EXP) do { retval = (EXP); goto out; } while(0)
13423 #define RECUR(NODE) \
13424 tsubst_copy_and_build (NODE, args, complain, in_decl, \
13425 /*function_p=*/false, \
13426 integral_constant_expression_p)
13431 if (t
== NULL_TREE
|| t
== error_mark_node
)
13434 loc
= input_location
;
13435 if (EXPR_HAS_LOCATION (t
))
13436 input_location
= EXPR_LOCATION (t
);
13438 /* N3276 decltype magic only applies to calls at the top level or on the
13439 right side of a comma. */
13440 if (TREE_CODE (t
) != CALL_EXPR
13441 && TREE_CODE (t
) != COMPOUND_EXPR
)
13442 complain
&= ~tf_decltype
;
13444 switch (TREE_CODE (t
))
13448 /* Fall through. */
13449 case IDENTIFIER_NODE
:
13453 bool non_integral_constant_expression_p
;
13454 const char *error_msg
;
13456 if (IDENTIFIER_TYPENAME_P (t
))
13458 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13459 t
= mangle_conv_op_name_for_type (new_type
);
13462 /* Look up the name. */
13463 decl
= lookup_name (t
);
13465 /* By convention, expressions use ERROR_MARK_NODE to indicate
13466 failure, not NULL_TREE. */
13467 if (decl
== NULL_TREE
)
13468 decl
= error_mark_node
;
13470 decl
= finish_id_expression (t
, decl
, NULL_TREE
,
13472 integral_constant_expression_p
,
13473 /*allow_non_integral_constant_expression_p=*/(cxx_dialect
>= cxx0x
),
13474 &non_integral_constant_expression_p
,
13475 /*template_p=*/false,
13477 /*address_p=*/false,
13478 /*template_arg_p=*/false,
13483 if (!function_p
&& identifier_p (decl
))
13485 if (complain
& tf_error
)
13486 unqualified_name_lookup_error (decl
);
13487 decl
= error_mark_node
;
13492 case TEMPLATE_ID_EXPR
:
13495 tree templ
= RECUR (TREE_OPERAND (t
, 0));
13496 tree targs
= TREE_OPERAND (t
, 1);
13499 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
13501 if (TREE_CODE (templ
) == COMPONENT_REF
)
13503 object
= TREE_OPERAND (templ
, 0);
13504 templ
= TREE_OPERAND (templ
, 1);
13507 object
= NULL_TREE
;
13508 templ
= lookup_template_function (templ
, targs
);
13511 RETURN (build3 (COMPONENT_REF
, TREE_TYPE (templ
),
13512 object
, templ
, NULL_TREE
));
13514 RETURN (baselink_for_fns (templ
));
13519 tree r
= RECUR (TREE_OPERAND (t
, 0));
13521 if (REFERENCE_REF_P (t
))
13523 /* A type conversion to reference type will be enclosed in
13524 such an indirect ref, but the substitution of the cast
13525 will have also added such an indirect ref. */
13526 if (TREE_CODE (TREE_TYPE (r
)) == REFERENCE_TYPE
)
13527 r
= convert_from_reference (r
);
13530 r
= build_x_indirect_ref (input_location
, r
, RO_UNARY_STAR
, complain
);
13536 (tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
13537 RECUR (TREE_OPERAND (t
, 0))));
13539 case IMPLICIT_CONV_EXPR
:
13541 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13542 tree expr
= RECUR (TREE_OPERAND (t
, 0));
13543 int flags
= LOOKUP_IMPLICIT
;
13544 if (IMPLICIT_CONV_EXPR_DIRECT_INIT (t
))
13545 flags
= LOOKUP_NORMAL
;
13546 RETURN (perform_implicit_conversion_flags (type
, expr
, complain
,
13553 tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
13554 RECUR (TREE_OPERAND (t
, 0))));
13557 case REINTERPRET_CAST_EXPR
:
13558 case CONST_CAST_EXPR
:
13559 case DYNAMIC_CAST_EXPR
:
13560 case STATIC_CAST_EXPR
:
13563 tree op
, r
= NULL_TREE
;
13565 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13566 if (integral_constant_expression_p
13567 && !cast_valid_in_integral_constant_expression_p (type
))
13569 if (complain
& tf_error
)
13570 error ("a cast to a type other than an integral or "
13571 "enumeration type cannot appear in a constant-expression");
13572 RETURN (error_mark_node
);
13575 op
= RECUR (TREE_OPERAND (t
, 0));
13577 ++c_inhibit_evaluation_warnings
;
13578 switch (TREE_CODE (t
))
13581 r
= build_functional_cast (type
, op
, complain
);
13583 case REINTERPRET_CAST_EXPR
:
13584 r
= build_reinterpret_cast (type
, op
, complain
);
13586 case CONST_CAST_EXPR
:
13587 r
= build_const_cast (type
, op
, complain
);
13589 case DYNAMIC_CAST_EXPR
:
13590 r
= build_dynamic_cast (type
, op
, complain
);
13592 case STATIC_CAST_EXPR
:
13593 r
= build_static_cast (type
, op
, complain
);
13596 gcc_unreachable ();
13598 --c_inhibit_evaluation_warnings
;
13603 case POSTDECREMENT_EXPR
:
13604 case POSTINCREMENT_EXPR
:
13605 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
13606 args
, complain
, in_decl
);
13607 RETURN (build_x_unary_op (input_location
, TREE_CODE (t
), op1
, complain
));
13609 case PREDECREMENT_EXPR
:
13610 case PREINCREMENT_EXPR
:
13614 case TRUTH_NOT_EXPR
:
13615 case UNARY_PLUS_EXPR
: /* Unary + */
13616 case REALPART_EXPR
:
13617 case IMAGPART_EXPR
:
13618 RETURN (build_x_unary_op (input_location
, TREE_CODE (t
),
13619 RECUR (TREE_OPERAND (t
, 0)), complain
));
13621 case FIX_TRUNC_EXPR
:
13622 RETURN (cp_build_unary_op (FIX_TRUNC_EXPR
, RECUR (TREE_OPERAND (t
, 0)),
13626 op1
= TREE_OPERAND (t
, 0);
13627 if (TREE_CODE (op1
) == LABEL_DECL
)
13628 RETURN (finish_label_address_expr (DECL_NAME (op1
),
13629 EXPR_LOCATION (op1
)));
13630 if (TREE_CODE (op1
) == SCOPE_REF
)
13631 op1
= tsubst_qualified_id (op1
, args
, complain
, in_decl
,
13632 /*done=*/true, /*address_p=*/true);
13634 op1
= tsubst_non_call_postfix_expression (op1
, args
, complain
,
13636 RETURN (build_x_unary_op (input_location
, ADDR_EXPR
, op1
, complain
));
13641 case TRUNC_DIV_EXPR
:
13642 case CEIL_DIV_EXPR
:
13643 case FLOOR_DIV_EXPR
:
13644 case ROUND_DIV_EXPR
:
13645 case EXACT_DIV_EXPR
:
13649 case TRUNC_MOD_EXPR
:
13650 case FLOOR_MOD_EXPR
:
13651 case TRUTH_ANDIF_EXPR
:
13652 case TRUTH_ORIF_EXPR
:
13653 case TRUTH_AND_EXPR
:
13654 case TRUTH_OR_EXPR
:
13672 ++c_inhibit_evaluation_warnings
;
13674 r
= build_x_binary_op
13675 (input_location
, TREE_CODE (t
),
13676 RECUR (TREE_OPERAND (t
, 0)),
13677 (TREE_NO_WARNING (TREE_OPERAND (t
, 0))
13679 : TREE_CODE (TREE_OPERAND (t
, 0))),
13680 RECUR (TREE_OPERAND (t
, 1)),
13681 (TREE_NO_WARNING (TREE_OPERAND (t
, 1))
13683 : TREE_CODE (TREE_OPERAND (t
, 1))),
13686 if (EXPR_P (r
) && TREE_NO_WARNING (t
))
13687 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
13689 --c_inhibit_evaluation_warnings
;
13695 RETURN (tsubst_qualified_id (t
, args
, complain
, in_decl
, /*done=*/true,
13696 /*address_p=*/false));
13698 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
13699 args
, complain
, in_decl
);
13700 RETURN (build_x_array_ref (EXPR_LOCATION (t
), op1
,
13701 RECUR (TREE_OPERAND (t
, 1)), complain
));
13704 if (PACK_EXPANSION_P (TREE_OPERAND (t
, 0)))
13705 RETURN (tsubst_copy (t
, args
, complain
, in_decl
));
13712 op1
= TREE_OPERAND (t
, 0);
13713 if (TREE_CODE (t
) == SIZEOF_EXPR
&& SIZEOF_EXPR_TYPE_P (t
))
13714 op1
= TREE_TYPE (op1
);
13717 /* When there are no ARGS, we are trying to evaluate a
13718 non-dependent expression from the parser. Trying to do
13719 the substitutions may not work. */
13721 op1
= TREE_TYPE (op1
);
13725 ++cp_unevaluated_operand
;
13726 ++c_inhibit_evaluation_warnings
;
13728 op1
= tsubst (op1
, args
, complain
, in_decl
);
13730 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
13731 /*function_p=*/false,
13732 /*integral_constant_expression_p=*/
13734 --cp_unevaluated_operand
;
13735 --c_inhibit_evaluation_warnings
;
13738 r
= cxx_sizeof_or_alignof_type (op1
, TREE_CODE (t
),
13739 complain
& tf_error
);
13741 r
= cxx_sizeof_or_alignof_expr (op1
, TREE_CODE (t
),
13742 complain
& tf_error
);
13743 if (TREE_CODE (t
) == SIZEOF_EXPR
&& r
!= error_mark_node
)
13745 if (TREE_CODE (r
) != SIZEOF_EXPR
|| TYPE_P (op1
))
13747 if (!processing_template_decl
&& TYPE_P (op1
))
13749 r
= build_min (SIZEOF_EXPR
, size_type_node
,
13750 build1 (NOP_EXPR
, op1
, error_mark_node
));
13751 SIZEOF_EXPR_TYPE_P (r
) = 1;
13754 r
= build_min (SIZEOF_EXPR
, size_type_node
, op1
);
13755 TREE_SIDE_EFFECTS (r
) = 0;
13756 TREE_READONLY (r
) = 1;
13758 SET_EXPR_LOCATION (r
, EXPR_LOCATION (t
));
13763 case AT_ENCODE_EXPR
:
13765 op1
= TREE_OPERAND (t
, 0);
13766 ++cp_unevaluated_operand
;
13767 ++c_inhibit_evaluation_warnings
;
13768 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
13769 /*function_p=*/false,
13770 /*integral_constant_expression_p=*/false);
13771 --cp_unevaluated_operand
;
13772 --c_inhibit_evaluation_warnings
;
13773 RETURN (objc_build_encode_expr (op1
));
13776 case NOEXCEPT_EXPR
:
13777 op1
= TREE_OPERAND (t
, 0);
13778 ++cp_unevaluated_operand
;
13779 ++c_inhibit_evaluation_warnings
;
13780 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
13781 /*function_p=*/false,
13782 /*integral_constant_expression_p=*/false);
13783 --cp_unevaluated_operand
;
13784 --c_inhibit_evaluation_warnings
;
13785 RETURN (finish_noexcept_expr (op1
, complain
));
13789 tree r
= build_x_modify_expr
13790 (EXPR_LOCATION (t
),
13791 RECUR (TREE_OPERAND (t
, 0)),
13792 TREE_CODE (TREE_OPERAND (t
, 1)),
13793 RECUR (TREE_OPERAND (t
, 2)),
13795 /* TREE_NO_WARNING must be set if either the expression was
13796 parenthesized or it uses an operator such as >>= rather
13797 than plain assignment. In the former case, it was already
13798 set and must be copied. In the latter case,
13799 build_x_modify_expr sets it and it must not be reset
13801 if (TREE_NO_WARNING (t
))
13802 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
13807 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
13808 args
, complain
, in_decl
);
13809 /* Remember that there was a reference to this entity. */
13812 RETURN (build_x_arrow (input_location
, op1
, complain
));
13816 tree placement
= RECUR (TREE_OPERAND (t
, 0));
13817 tree init
= RECUR (TREE_OPERAND (t
, 3));
13818 vec
<tree
, va_gc
> *placement_vec
;
13819 vec
<tree
, va_gc
> *init_vec
;
13822 if (placement
== NULL_TREE
)
13823 placement_vec
= NULL
;
13826 placement_vec
= make_tree_vector ();
13827 for (; placement
!= NULL_TREE
; placement
= TREE_CHAIN (placement
))
13828 vec_safe_push (placement_vec
, TREE_VALUE (placement
));
13831 /* If there was an initializer in the original tree, but it
13832 instantiated to an empty list, then we should pass a
13833 non-NULL empty vector to tell build_new that it was an
13834 empty initializer() rather than no initializer. This can
13835 only happen when the initializer is a pack expansion whose
13836 parameter packs are of length zero. */
13837 if (init
== NULL_TREE
&& TREE_OPERAND (t
, 3) == NULL_TREE
)
13841 init_vec
= make_tree_vector ();
13842 if (init
== void_zero_node
)
13843 gcc_assert (init_vec
!= NULL
);
13846 for (; init
!= NULL_TREE
; init
= TREE_CHAIN (init
))
13847 vec_safe_push (init_vec
, TREE_VALUE (init
));
13851 ret
= build_new (&placement_vec
,
13852 tsubst (TREE_OPERAND (t
, 1), args
, complain
, in_decl
),
13853 RECUR (TREE_OPERAND (t
, 2)),
13855 NEW_EXPR_USE_GLOBAL (t
),
13858 if (placement_vec
!= NULL
)
13859 release_tree_vector (placement_vec
);
13860 if (init_vec
!= NULL
)
13861 release_tree_vector (init_vec
);
13867 RETURN (delete_sanity
13868 (RECUR (TREE_OPERAND (t
, 0)),
13869 RECUR (TREE_OPERAND (t
, 1)),
13870 DELETE_EXPR_USE_VEC (t
),
13871 DELETE_EXPR_USE_GLOBAL (t
),
13874 case COMPOUND_EXPR
:
13876 tree op0
= tsubst_copy_and_build (TREE_OPERAND (t
, 0), args
,
13877 complain
& ~tf_decltype
, in_decl
,
13878 /*function_p=*/false,
13879 integral_constant_expression_p
);
13880 RETURN (build_x_compound_expr (EXPR_LOCATION (t
),
13882 RECUR (TREE_OPERAND (t
, 1)),
13889 vec
<tree
, va_gc
> *call_args
;
13890 unsigned int nargs
, i
;
13895 /* Don't pass tf_decltype down to subexpressions. */
13896 tsubst_flags_t decltype_flag
= (complain
& tf_decltype
);
13897 complain
&= ~tf_decltype
;
13899 function
= CALL_EXPR_FN (t
);
13900 /* When we parsed the expression, we determined whether or
13901 not Koenig lookup should be performed. */
13902 koenig_p
= KOENIG_LOOKUP_P (t
);
13903 if (TREE_CODE (function
) == SCOPE_REF
)
13905 qualified_p
= true;
13906 function
= tsubst_qualified_id (function
, args
, complain
, in_decl
,
13908 /*address_p=*/false);
13910 else if (koenig_p
&& identifier_p (function
))
13912 /* Do nothing; calling tsubst_copy_and_build on an identifier
13913 would incorrectly perform unqualified lookup again.
13915 Note that we can also have an IDENTIFIER_NODE if the earlier
13916 unqualified lookup found a member function; in that case
13917 koenig_p will be false and we do want to do the lookup
13918 again to find the instantiated member function.
13920 FIXME but doing that causes c++/15272, so we need to stop
13921 using IDENTIFIER_NODE in that situation. */
13922 qualified_p
= false;
13926 if (TREE_CODE (function
) == COMPONENT_REF
)
13928 tree op
= TREE_OPERAND (function
, 1);
13930 qualified_p
= (TREE_CODE (op
) == SCOPE_REF
13931 || (BASELINK_P (op
)
13932 && BASELINK_QUALIFIED_P (op
)));
13935 qualified_p
= false;
13937 if (TREE_CODE (function
) == ADDR_EXPR
13938 && TREE_CODE (TREE_OPERAND (function
, 0)) == FUNCTION_DECL
)
13939 /* Avoid error about taking the address of a constructor. */
13940 function
= TREE_OPERAND (function
, 0);
13942 function
= tsubst_copy_and_build (function
, args
, complain
,
13945 integral_constant_expression_p
);
13947 if (BASELINK_P (function
))
13948 qualified_p
= true;
13951 nargs
= call_expr_nargs (t
);
13952 call_args
= make_tree_vector ();
13953 for (i
= 0; i
< nargs
; ++i
)
13955 tree arg
= CALL_EXPR_ARG (t
, i
);
13957 if (!PACK_EXPANSION_P (arg
))
13958 vec_safe_push (call_args
, RECUR (CALL_EXPR_ARG (t
, i
)));
13961 /* Expand the pack expansion and push each entry onto
13963 arg
= tsubst_pack_expansion (arg
, args
, complain
, in_decl
);
13964 if (TREE_CODE (arg
) == TREE_VEC
)
13966 unsigned int len
, j
;
13968 len
= TREE_VEC_LENGTH (arg
);
13969 for (j
= 0; j
< len
; ++j
)
13971 tree value
= TREE_VEC_ELT (arg
, j
);
13972 if (value
!= NULL_TREE
)
13973 value
= convert_from_reference (value
);
13974 vec_safe_push (call_args
, value
);
13979 /* A partial substitution. Add one entry. */
13980 vec_safe_push (call_args
, arg
);
13985 /* We do not perform argument-dependent lookup if normal
13986 lookup finds a non-function, in accordance with the
13987 expected resolution of DR 218. */
13989 && ((is_overloaded_fn (function
)
13990 /* If lookup found a member function, the Koenig lookup is
13991 not appropriate, even if an unqualified-name was used
13992 to denote the function. */
13993 && !DECL_FUNCTION_MEMBER_P (get_first_fn (function
)))
13994 || identifier_p (function
))
13995 /* Only do this when substitution turns a dependent call
13996 into a non-dependent call. */
13997 && type_dependent_expression_p_push (t
)
13998 && !any_type_dependent_arguments_p (call_args
))
13999 function
= perform_koenig_lookup (function
, call_args
, false,
14002 if (identifier_p (function
)
14003 && !any_type_dependent_arguments_p (call_args
))
14005 if (koenig_p
&& (complain
& tf_warning_or_error
))
14007 /* For backwards compatibility and good diagnostics, try
14008 the unqualified lookup again if we aren't in SFINAE
14010 tree unq
= (tsubst_copy_and_build
14011 (function
, args
, complain
, in_decl
, true,
14012 integral_constant_expression_p
));
14013 if (unq
== error_mark_node
)
14014 RETURN (error_mark_node
);
14016 if (unq
!= function
)
14019 if (INDIRECT_REF_P (fn
))
14020 fn
= TREE_OPERAND (fn
, 0);
14021 if (TREE_CODE (fn
) == COMPONENT_REF
)
14022 fn
= TREE_OPERAND (fn
, 1);
14023 if (is_overloaded_fn (fn
))
14024 fn
= get_first_fn (fn
);
14025 if (permerror (EXPR_LOC_OR_HERE (t
),
14026 "%qD was not declared in this scope, "
14027 "and no declarations were found by "
14028 "argument-dependent lookup at the point "
14029 "of instantiation", function
))
14032 /* Can't say anything more. */;
14033 else if (DECL_CLASS_SCOPE_P (fn
))
14035 inform (EXPR_LOC_OR_HERE (t
),
14036 "declarations in dependent base %qT are "
14037 "not found by unqualified lookup",
14038 DECL_CLASS_CONTEXT (fn
));
14039 if (current_class_ptr
)
14040 inform (EXPR_LOC_OR_HERE (t
),
14041 "use %<this->%D%> instead", function
);
14043 inform (EXPR_LOC_OR_HERE (t
),
14044 "use %<%T::%D%> instead",
14045 current_class_name
, function
);
14048 inform (0, "%q+D declared here, later in the "
14049 "translation unit", fn
);
14054 if (identifier_p (function
))
14056 if (complain
& tf_error
)
14057 unqualified_name_lookup_error (function
);
14058 release_tree_vector (call_args
);
14059 RETURN (error_mark_node
);
14063 /* Remember that there was a reference to this entity. */
14064 if (DECL_P (function
))
14065 mark_used (function
);
14067 /* Put back tf_decltype for the actual call. */
14068 complain
|= decltype_flag
;
14070 if (TREE_CODE (function
) == OFFSET_REF
)
14071 ret
= build_offset_ref_call_from_tree (function
, &call_args
,
14073 else if (TREE_CODE (function
) == COMPONENT_REF
)
14075 tree instance
= TREE_OPERAND (function
, 0);
14076 tree fn
= TREE_OPERAND (function
, 1);
14078 if (processing_template_decl
14079 && (type_dependent_expression_p (instance
)
14080 || (!BASELINK_P (fn
)
14081 && TREE_CODE (fn
) != FIELD_DECL
)
14082 || type_dependent_expression_p (fn
)
14083 || any_type_dependent_arguments_p (call_args
)))
14084 ret
= build_nt_call_vec (function
, call_args
);
14085 else if (!BASELINK_P (fn
))
14086 ret
= finish_call_expr (function
, &call_args
,
14087 /*disallow_virtual=*/false,
14088 /*koenig_p=*/false,
14091 ret
= (build_new_method_call
14093 &call_args
, NULL_TREE
,
14094 qualified_p
? LOOKUP_NONVIRTUAL
: LOOKUP_NORMAL
,
14099 ret
= finish_call_expr (function
, &call_args
,
14100 /*disallow_virtual=*/qualified_p
,
14104 release_tree_vector (call_args
);
14111 tree cond
= RECUR (TREE_OPERAND (t
, 0));
14114 if (TREE_CODE (cond
) == INTEGER_CST
)
14116 if (integer_zerop (cond
))
14118 ++c_inhibit_evaluation_warnings
;
14119 exp1
= RECUR (TREE_OPERAND (t
, 1));
14120 --c_inhibit_evaluation_warnings
;
14121 exp2
= RECUR (TREE_OPERAND (t
, 2));
14125 exp1
= RECUR (TREE_OPERAND (t
, 1));
14126 ++c_inhibit_evaluation_warnings
;
14127 exp2
= RECUR (TREE_OPERAND (t
, 2));
14128 --c_inhibit_evaluation_warnings
;
14133 exp1
= RECUR (TREE_OPERAND (t
, 1));
14134 exp2
= RECUR (TREE_OPERAND (t
, 2));
14137 RETURN (build_x_conditional_expr (EXPR_LOCATION (t
),
14138 cond
, exp1
, exp2
, complain
));
14141 case PSEUDO_DTOR_EXPR
:
14142 RETURN (finish_pseudo_destructor_expr
14143 (RECUR (TREE_OPERAND (t
, 0)),
14144 RECUR (TREE_OPERAND (t
, 1)),
14145 tsubst (TREE_OPERAND (t
, 2), args
, complain
, in_decl
)));
14149 tree purpose
, value
, chain
;
14151 if (t
== void_list_node
)
14154 if ((TREE_PURPOSE (t
) && PACK_EXPANSION_P (TREE_PURPOSE (t
)))
14155 || (TREE_VALUE (t
) && PACK_EXPANSION_P (TREE_VALUE (t
))))
14157 /* We have pack expansions, so expand those and
14158 create a new list out of it. */
14159 tree purposevec
= NULL_TREE
;
14160 tree valuevec
= NULL_TREE
;
14164 /* Expand the argument expressions. */
14165 if (TREE_PURPOSE (t
))
14166 purposevec
= tsubst_pack_expansion (TREE_PURPOSE (t
), args
,
14167 complain
, in_decl
);
14168 if (TREE_VALUE (t
))
14169 valuevec
= tsubst_pack_expansion (TREE_VALUE (t
), args
,
14170 complain
, in_decl
);
14172 /* Build the rest of the list. */
14173 chain
= TREE_CHAIN (t
);
14174 if (chain
&& chain
!= void_type_node
)
14175 chain
= RECUR (chain
);
14177 /* Determine the number of arguments. */
14178 if (purposevec
&& TREE_CODE (purposevec
) == TREE_VEC
)
14180 len
= TREE_VEC_LENGTH (purposevec
);
14181 gcc_assert (!valuevec
|| len
== TREE_VEC_LENGTH (valuevec
));
14183 else if (TREE_CODE (valuevec
) == TREE_VEC
)
14184 len
= TREE_VEC_LENGTH (valuevec
);
14187 /* Since we only performed a partial substitution into
14188 the argument pack, we only RETURN (a single list
14190 if (purposevec
== TREE_PURPOSE (t
)
14191 && valuevec
== TREE_VALUE (t
)
14192 && chain
== TREE_CHAIN (t
))
14195 RETURN (tree_cons (purposevec
, valuevec
, chain
));
14198 /* Convert the argument vectors into a TREE_LIST */
14202 /* Grab the Ith values. */
14204 purpose
= purposevec
? TREE_VEC_ELT (purposevec
, i
)
14207 = valuevec
? convert_from_reference (TREE_VEC_ELT (valuevec
, i
))
14210 /* Build the list (backwards). */
14211 chain
= tree_cons (purpose
, value
, chain
);
14217 purpose
= TREE_PURPOSE (t
);
14219 purpose
= RECUR (purpose
);
14220 value
= TREE_VALUE (t
);
14222 value
= RECUR (value
);
14223 chain
= TREE_CHAIN (t
);
14224 if (chain
&& chain
!= void_type_node
)
14225 chain
= RECUR (chain
);
14226 if (purpose
== TREE_PURPOSE (t
)
14227 && value
== TREE_VALUE (t
)
14228 && chain
== TREE_CHAIN (t
))
14230 RETURN (tree_cons (purpose
, value
, chain
));
14233 case COMPONENT_REF
:
14239 object
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
14240 args
, complain
, in_decl
);
14241 /* Remember that there was a reference to this entity. */
14242 if (DECL_P (object
))
14243 mark_used (object
);
14244 object_type
= TREE_TYPE (object
);
14246 member
= TREE_OPERAND (t
, 1);
14247 if (BASELINK_P (member
))
14248 member
= tsubst_baselink (member
,
14249 non_reference (TREE_TYPE (object
)),
14250 args
, complain
, in_decl
);
14252 member
= tsubst_copy (member
, args
, complain
, in_decl
);
14253 if (member
== error_mark_node
)
14254 RETURN (error_mark_node
);
14256 if (type_dependent_expression_p (object
))
14257 /* We can't do much here. */;
14258 else if (!CLASS_TYPE_P (object_type
))
14260 if (scalarish_type_p (object_type
))
14262 tree s
= NULL_TREE
;
14263 tree dtor
= member
;
14265 if (TREE_CODE (dtor
) == SCOPE_REF
)
14267 s
= TREE_OPERAND (dtor
, 0);
14268 dtor
= TREE_OPERAND (dtor
, 1);
14270 if (TREE_CODE (dtor
) == BIT_NOT_EXPR
)
14272 dtor
= TREE_OPERAND (dtor
, 0);
14274 RETURN (finish_pseudo_destructor_expr (object
, s
, dtor
));
14278 else if (TREE_CODE (member
) == SCOPE_REF
14279 && TREE_CODE (TREE_OPERAND (member
, 1)) == TEMPLATE_ID_EXPR
)
14281 /* Lookup the template functions now that we know what the
14283 tree scope
= TREE_OPERAND (member
, 0);
14284 tree tmpl
= TREE_OPERAND (TREE_OPERAND (member
, 1), 0);
14285 tree args
= TREE_OPERAND (TREE_OPERAND (member
, 1), 1);
14286 member
= lookup_qualified_name (scope
, tmpl
,
14287 /*is_type_p=*/false,
14288 /*complain=*/false);
14289 if (BASELINK_P (member
))
14291 BASELINK_FUNCTIONS (member
)
14292 = build_nt (TEMPLATE_ID_EXPR
, BASELINK_FUNCTIONS (member
),
14294 member
= (adjust_result_of_qualified_name_lookup
14295 (member
, BINFO_TYPE (BASELINK_BINFO (member
)),
14300 qualified_name_lookup_error (scope
, tmpl
, member
,
14302 RETURN (error_mark_node
);
14305 else if (TREE_CODE (member
) == SCOPE_REF
14306 && !CLASS_TYPE_P (TREE_OPERAND (member
, 0))
14307 && TREE_CODE (TREE_OPERAND (member
, 0)) != NAMESPACE_DECL
)
14309 if (complain
& tf_error
)
14311 if (TYPE_P (TREE_OPERAND (member
, 0)))
14312 error ("%qT is not a class or namespace",
14313 TREE_OPERAND (member
, 0));
14315 error ("%qD is not a class or namespace",
14316 TREE_OPERAND (member
, 0));
14318 RETURN (error_mark_node
);
14320 else if (TREE_CODE (member
) == FIELD_DECL
)
14321 RETURN (finish_non_static_data_member (member
, object
, NULL_TREE
));
14323 RETURN (finish_class_member_access_expr (object
, member
,
14324 /*template_p=*/false,
14329 RETURN (build_throw
14330 (RECUR (TREE_OPERAND (t
, 0))));
14334 vec
<constructor_elt
, va_gc
> *n
;
14335 constructor_elt
*ce
;
14336 unsigned HOST_WIDE_INT idx
;
14337 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14338 bool process_index_p
;
14340 bool need_copy_p
= false;
14343 if (type
== error_mark_node
)
14344 RETURN (error_mark_node
);
14346 /* digest_init will do the wrong thing if we let it. */
14347 if (type
&& TYPE_PTRMEMFUNC_P (type
))
14350 /* We do not want to process the index of aggregate
14351 initializers as they are identifier nodes which will be
14352 looked up by digest_init. */
14353 process_index_p
= !(type
&& MAYBE_CLASS_TYPE_P (type
));
14355 n
= vec_safe_copy (CONSTRUCTOR_ELTS (t
));
14356 newlen
= vec_safe_length (n
);
14357 FOR_EACH_VEC_SAFE_ELT (n
, idx
, ce
)
14359 if (ce
->index
&& process_index_p
)
14360 ce
->index
= RECUR (ce
->index
);
14362 if (PACK_EXPANSION_P (ce
->value
))
14364 /* Substitute into the pack expansion. */
14365 ce
->value
= tsubst_pack_expansion (ce
->value
, args
, complain
,
14368 if (ce
->value
== error_mark_node
14369 || PACK_EXPANSION_P (ce
->value
))
14371 else if (TREE_VEC_LENGTH (ce
->value
) == 1)
14372 /* Just move the argument into place. */
14373 ce
->value
= TREE_VEC_ELT (ce
->value
, 0);
14376 /* Update the length of the final CONSTRUCTOR
14377 arguments vector, and note that we will need to
14379 newlen
= newlen
+ TREE_VEC_LENGTH (ce
->value
) - 1;
14380 need_copy_p
= true;
14384 ce
->value
= RECUR (ce
->value
);
14389 vec
<constructor_elt
, va_gc
> *old_n
= n
;
14391 vec_alloc (n
, newlen
);
14392 FOR_EACH_VEC_ELT (*old_n
, idx
, ce
)
14394 if (TREE_CODE (ce
->value
) == TREE_VEC
)
14396 int i
, len
= TREE_VEC_LENGTH (ce
->value
);
14397 for (i
= 0; i
< len
; ++i
)
14398 CONSTRUCTOR_APPEND_ELT (n
, 0,
14399 TREE_VEC_ELT (ce
->value
, i
));
14402 CONSTRUCTOR_APPEND_ELT (n
, 0, ce
->value
);
14406 r
= build_constructor (init_list_type_node
, n
);
14407 CONSTRUCTOR_IS_DIRECT_INIT (r
) = CONSTRUCTOR_IS_DIRECT_INIT (t
);
14409 if (TREE_HAS_CONSTRUCTOR (t
))
14410 RETURN (finish_compound_literal (type
, r
, complain
));
14412 TREE_TYPE (r
) = type
;
14418 tree operand_0
= TREE_OPERAND (t
, 0);
14419 if (TYPE_P (operand_0
))
14421 operand_0
= tsubst (operand_0
, args
, complain
, in_decl
);
14422 RETURN (get_typeid (operand_0
, complain
));
14426 operand_0
= RECUR (operand_0
);
14427 RETURN (build_typeid (operand_0
, complain
));
14438 tree r
= tsubst_copy (t
, args
, complain
, in_decl
);
14440 if (TREE_CODE (TREE_TYPE (t
)) != REFERENCE_TYPE
)
14441 /* If the original type was a reference, we'll be wrapped in
14442 the appropriate INDIRECT_REF. */
14443 r
= convert_from_reference (r
);
14448 RETURN (build_x_va_arg (EXPR_LOCATION (t
),
14449 RECUR (TREE_OPERAND (t
, 0)),
14450 tsubst (TREE_TYPE (t
), args
, complain
, in_decl
)));
14452 case OFFSETOF_EXPR
:
14453 RETURN (finish_offsetof (RECUR (TREE_OPERAND (t
, 0))));
14457 tree type1
= tsubst_copy (TRAIT_EXPR_TYPE1 (t
), args
,
14458 complain
, in_decl
);
14460 tree type2
= TRAIT_EXPR_TYPE2 (t
);
14462 type2
= tsubst_copy (type2
, args
, complain
, in_decl
);
14464 RETURN (finish_trait_expr (TRAIT_EXPR_KIND (t
), type1
, type2
));
14469 tree old_stmt_expr
= cur_stmt_expr
;
14470 tree stmt_expr
= begin_stmt_expr ();
14472 cur_stmt_expr
= stmt_expr
;
14473 tsubst_expr (STMT_EXPR_STMT (t
), args
, complain
, in_decl
,
14474 integral_constant_expression_p
);
14475 stmt_expr
= finish_stmt_expr (stmt_expr
, false);
14476 cur_stmt_expr
= old_stmt_expr
;
14478 /* If the resulting list of expression statement is empty,
14479 fold it further into void_zero_node. */
14480 if (empty_expr_stmt_p (stmt_expr
))
14481 stmt_expr
= void_zero_node
;
14483 RETURN (stmt_expr
);
14488 tree r
= build_lambda_expr ();
14490 tree type
= tsubst (LAMBDA_EXPR_CLOSURE (t
), args
, complain
, NULL_TREE
);
14491 LAMBDA_EXPR_CLOSURE (r
) = type
;
14492 CLASSTYPE_LAMBDA_EXPR (type
) = r
;
14494 LAMBDA_EXPR_LOCATION (r
)
14495 = LAMBDA_EXPR_LOCATION (t
);
14496 LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (r
)
14497 = LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (t
);
14498 LAMBDA_EXPR_MUTABLE_P (r
) = LAMBDA_EXPR_MUTABLE_P (t
);
14499 LAMBDA_EXPR_DISCRIMINATOR (r
)
14500 = (LAMBDA_EXPR_DISCRIMINATOR (t
));
14501 /* For a function scope, we want to use tsubst so that we don't
14502 complain about referring to an auto function before its return
14503 type has been deduced. Otherwise, we want to use tsubst_copy so
14504 that we look up the existing field/parameter/variable rather
14505 than build a new one. */
14506 tree scope
= LAMBDA_EXPR_EXTRA_SCOPE (t
);
14507 if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
)
14508 scope
= tsubst (scope
, args
, complain
, in_decl
);
14509 else if (scope
&& TREE_CODE (scope
) == PARM_DECL
)
14511 /* Look up the parameter we want directly, as tsubst_copy
14512 doesn't do what we need. */
14513 tree fn
= tsubst (DECL_CONTEXT (scope
), args
, complain
, in_decl
);
14514 tree parm
= FUNCTION_FIRST_USER_PARM (fn
);
14515 while (DECL_PARM_INDEX (parm
) != DECL_PARM_INDEX (scope
))
14516 parm
= DECL_CHAIN (parm
);
14518 /* FIXME Work around the parm not having DECL_CONTEXT set. */
14519 if (DECL_CONTEXT (scope
) == NULL_TREE
)
14520 DECL_CONTEXT (scope
) = fn
;
14523 scope
= RECUR (scope
);
14524 LAMBDA_EXPR_EXTRA_SCOPE (r
) = scope
;
14525 LAMBDA_EXPR_RETURN_TYPE (r
)
14526 = tsubst (LAMBDA_EXPR_RETURN_TYPE (t
), args
, complain
, in_decl
);
14528 gcc_assert (LAMBDA_EXPR_THIS_CAPTURE (t
) == NULL_TREE
14529 && LAMBDA_EXPR_PENDING_PROXIES (t
) == NULL
);
14531 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
14532 determine_visibility (TYPE_NAME (type
));
14533 /* Now that we know visibility, instantiate the type so we have a
14534 declaration of the op() for later calls to lambda_function. */
14535 complete_type (type
);
14537 LAMBDA_EXPR_THIS_CAPTURE (r
) = NULL_TREE
;
14539 RETURN (build_lambda_object (r
));
14543 /* We can get here for a constant initializer of non-dependent type.
14544 FIXME stop folding in cp_parser_initializer_clause. */
14546 tree r
= get_target_expr_sfinae (RECUR (TARGET_EXPR_INITIAL (t
)),
14551 case TRANSACTION_EXPR
:
14552 RETURN (tsubst_expr(t
, args
, complain
, in_decl
,
14553 integral_constant_expression_p
));
14556 RETURN (finish_parenthesized_expr (RECUR (TREE_OPERAND (t
, 0))));
14559 /* Handle Objective-C++ constructs, if appropriate. */
14562 = objcp_tsubst_copy_and_build (t
, args
, complain
,
14563 in_decl
, /*function_p=*/false);
14567 RETURN (tsubst_copy (t
, args
, complain
, in_decl
));
14573 input_location
= loc
;
14577 /* Verify that the instantiated ARGS are valid. For type arguments,
14578 make sure that the type's linkage is ok. For non-type arguments,
14579 make sure they are constants if they are integral or enumerations.
14580 Emit an error under control of COMPLAIN, and return TRUE on error. */
14583 check_instantiated_arg (tree tmpl
, tree t
, tsubst_flags_t complain
)
14585 if (dependent_template_arg_p (t
))
14587 if (ARGUMENT_PACK_P (t
))
14589 tree vec
= ARGUMENT_PACK_ARGS (t
);
14590 int len
= TREE_VEC_LENGTH (vec
);
14591 bool result
= false;
14594 for (i
= 0; i
< len
; ++i
)
14595 if (check_instantiated_arg (tmpl
, TREE_VEC_ELT (vec
, i
), complain
))
14599 else if (TYPE_P (t
))
14601 /* [basic.link]: A name with no linkage (notably, the name
14602 of a class or enumeration declared in a local scope)
14603 shall not be used to declare an entity with linkage.
14604 This implies that names with no linkage cannot be used as
14607 DR 757 relaxes this restriction for C++0x. */
14608 tree nt
= (cxx_dialect
> cxx98
? NULL_TREE
14609 : no_linkage_check (t
, /*relaxed_p=*/false));
14613 /* DR 488 makes use of a type with no linkage cause
14614 type deduction to fail. */
14615 if (complain
& tf_error
)
14617 if (TYPE_ANONYMOUS_P (nt
))
14618 error ("%qT is/uses anonymous type", t
);
14620 error ("template argument for %qD uses local type %qT",
14625 /* In order to avoid all sorts of complications, we do not
14626 allow variably-modified types as template arguments. */
14627 else if (variably_modified_type_p (t
, NULL_TREE
))
14629 if (complain
& tf_error
)
14630 error ("%qT is a variably modified type", t
);
14634 /* Class template and alias template arguments should be OK. */
14635 else if (DECL_TYPE_TEMPLATE_P (t
))
14637 /* A non-type argument of integral or enumerated type must be a
14639 else if (TREE_TYPE (t
)
14640 && INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (t
))
14641 && !TREE_CONSTANT (t
))
14643 if (complain
& tf_error
)
14644 error ("integral expression %qE is not constant", t
);
14651 check_instantiated_args (tree tmpl
, tree args
, tsubst_flags_t complain
)
14653 int ix
, len
= DECL_NTPARMS (tmpl
);
14654 bool result
= false;
14656 for (ix
= 0; ix
!= len
; ix
++)
14658 if (check_instantiated_arg (tmpl
, TREE_VEC_ELT (args
, ix
), complain
))
14661 if (result
&& (complain
& tf_error
))
14662 error (" trying to instantiate %qD", tmpl
);
14666 /* We're out of SFINAE context now, so generate diagnostics for the access
14667 errors we saw earlier when instantiating D from TMPL and ARGS. */
14670 recheck_decl_substitution (tree d
, tree tmpl
, tree args
)
14672 tree pattern
= DECL_TEMPLATE_RESULT (tmpl
);
14673 tree type
= TREE_TYPE (pattern
);
14674 location_t loc
= input_location
;
14676 push_access_scope (d
);
14677 push_deferring_access_checks (dk_no_deferred
);
14678 input_location
= DECL_SOURCE_LOCATION (pattern
);
14679 tsubst (type
, args
, tf_warning_or_error
, d
);
14680 input_location
= loc
;
14681 pop_deferring_access_checks ();
14682 pop_access_scope (d
);
14685 /* Instantiate the indicated variable, function, or alias template TMPL with
14686 the template arguments in TARG_PTR. */
14689 instantiate_template_1 (tree tmpl
, tree orig_args
, tsubst_flags_t complain
)
14691 tree targ_ptr
= orig_args
;
14695 bool access_ok
= true;
14697 if (tmpl
== error_mark_node
)
14698 return error_mark_node
;
14700 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
);
14702 /* If this function is a clone, handle it specially. */
14703 if (DECL_CLONED_FUNCTION_P (tmpl
))
14708 /* Use DECL_ABSTRACT_ORIGIN because only FUNCTION_DECLs have
14709 DECL_CLONED_FUNCTION. */
14710 spec
= instantiate_template (DECL_ABSTRACT_ORIGIN (tmpl
),
14711 targ_ptr
, complain
);
14712 if (spec
== error_mark_node
)
14713 return error_mark_node
;
14715 /* Look for the clone. */
14716 FOR_EACH_CLONE (clone
, spec
)
14717 if (DECL_NAME (clone
) == DECL_NAME (tmpl
))
14719 /* We should always have found the clone by now. */
14720 gcc_unreachable ();
14724 /* Check to see if we already have this specialization. */
14725 gen_tmpl
= most_general_template (tmpl
);
14726 if (tmpl
!= gen_tmpl
)
14727 /* The TMPL is a partial instantiation. To get a full set of
14728 arguments we must add the arguments used to perform the
14729 partial instantiation. */
14730 targ_ptr
= add_outermost_template_args (DECL_TI_ARGS (tmpl
),
14733 /* It would be nice to avoid hashing here and then again in tsubst_decl,
14734 but it doesn't seem to be on the hot path. */
14735 spec
= retrieve_specialization (gen_tmpl
, targ_ptr
, 0);
14737 gcc_assert (tmpl
== gen_tmpl
14738 || ((fndecl
= retrieve_specialization (tmpl
, orig_args
, 0))
14740 || fndecl
== NULL_TREE
);
14742 if (spec
!= NULL_TREE
)
14744 if (FNDECL_HAS_ACCESS_ERRORS (spec
))
14746 if (complain
& tf_error
)
14747 recheck_decl_substitution (spec
, gen_tmpl
, targ_ptr
);
14748 return error_mark_node
;
14753 if (check_instantiated_args (gen_tmpl
, INNERMOST_TEMPLATE_ARGS (targ_ptr
),
14755 return error_mark_node
;
14757 /* We are building a FUNCTION_DECL, during which the access of its
14758 parameters and return types have to be checked. However this
14759 FUNCTION_DECL which is the desired context for access checking
14760 is not built yet. We solve this chicken-and-egg problem by
14761 deferring all checks until we have the FUNCTION_DECL. */
14762 push_deferring_access_checks (dk_deferred
);
14764 /* Instantiation of the function happens in the context of the function
14765 template, not the context of the overload resolution we're doing. */
14766 push_to_top_level ();
14767 /* If there are dependent arguments, e.g. because we're doing partial
14768 ordering, make sure processing_template_decl stays set. */
14769 if (uses_template_parms (targ_ptr
))
14770 ++processing_template_decl
;
14771 if (DECL_CLASS_SCOPE_P (gen_tmpl
))
14773 tree ctx
= tsubst (DECL_CONTEXT (gen_tmpl
), targ_ptr
,
14774 complain
, gen_tmpl
);
14775 push_nested_class (ctx
);
14777 /* Substitute template parameters to obtain the specialization. */
14778 fndecl
= tsubst (DECL_TEMPLATE_RESULT (gen_tmpl
),
14779 targ_ptr
, complain
, gen_tmpl
);
14780 if (DECL_CLASS_SCOPE_P (gen_tmpl
))
14781 pop_nested_class ();
14782 pop_from_top_level ();
14784 if (fndecl
== error_mark_node
)
14786 pop_deferring_access_checks ();
14787 return error_mark_node
;
14790 /* The DECL_TI_TEMPLATE should always be the immediate parent
14791 template, not the most general template. */
14792 DECL_TI_TEMPLATE (fndecl
) = tmpl
;
14794 /* Now we know the specialization, compute access previously
14796 push_access_scope (fndecl
);
14797 if (!perform_deferred_access_checks (complain
))
14799 pop_access_scope (fndecl
);
14800 pop_deferring_access_checks ();
14802 /* If we've just instantiated the main entry point for a function,
14803 instantiate all the alternate entry points as well. We do this
14804 by cloning the instantiation of the main entry point, not by
14805 instantiating the template clones. */
14806 if (DECL_CHAIN (gen_tmpl
) && DECL_CLONED_FUNCTION_P (DECL_CHAIN (gen_tmpl
)))
14807 clone_function_decl (fndecl
, /*update_method_vec_p=*/0);
14811 if (!(complain
& tf_error
))
14813 /* Remember to reinstantiate when we're out of SFINAE so the user
14814 can see the errors. */
14815 FNDECL_HAS_ACCESS_ERRORS (fndecl
) = true;
14817 return error_mark_node
;
14822 /* Wrapper for instantiate_template_1. */
14825 instantiate_template (tree tmpl
, tree orig_args
, tsubst_flags_t complain
)
14828 timevar_push (TV_TEMPLATE_INST
);
14829 ret
= instantiate_template_1 (tmpl
, orig_args
, complain
);
14830 timevar_pop (TV_TEMPLATE_INST
);
14834 /* Instantiate the alias template TMPL with ARGS. Also push a template
14835 instantiation level, which instantiate_template doesn't do because
14836 functions and variables have sufficient context established by the
14840 instantiate_alias_template (tree tmpl
, tree args
, tsubst_flags_t complain
)
14842 struct pending_template
*old_last_pend
= last_pending_template
;
14843 struct tinst_level
*old_error_tinst
= last_error_tinst_level
;
14844 if (tmpl
== error_mark_node
|| args
== error_mark_node
)
14845 return error_mark_node
;
14846 tree tinst
= build_tree_list (tmpl
, args
);
14847 if (!push_tinst_level (tinst
))
14850 return error_mark_node
;
14854 coerce_innermost_template_parms (DECL_TEMPLATE_PARMS (tmpl
),
14855 args
, tmpl
, complain
,
14856 /*require_all_args=*/true,
14857 /*use_default_args=*/true);
14859 tree r
= instantiate_template (tmpl
, args
, complain
);
14860 pop_tinst_level ();
14861 /* We can't free this if a pending_template entry or last_error_tinst_level
14862 is pointing at it. */
14863 if (last_pending_template
== old_last_pend
14864 && last_error_tinst_level
== old_error_tinst
)
14870 /* PARM is a template parameter pack for FN. Returns true iff
14871 PARM is used in a deducible way in the argument list of FN. */
14874 pack_deducible_p (tree parm
, tree fn
)
14876 tree t
= FUNCTION_FIRST_USER_PARMTYPE (fn
);
14877 for (; t
; t
= TREE_CHAIN (t
))
14879 tree type
= TREE_VALUE (t
);
14881 if (!PACK_EXPANSION_P (type
))
14883 for (packs
= PACK_EXPANSION_PARAMETER_PACKS (type
);
14884 packs
; packs
= TREE_CHAIN (packs
))
14885 if (TREE_VALUE (packs
) == parm
)
14887 /* The template parameter pack is used in a function parameter
14888 pack. If this is the end of the parameter list, the
14889 template parameter pack is deducible. */
14890 if (TREE_CHAIN (t
) == void_list_node
)
14893 /* Otherwise, not. Well, it could be deduced from
14894 a non-pack parameter, but doing so would end up with
14895 a deduction mismatch, so don't bother. */
14899 /* The template parameter pack isn't used in any function parameter
14900 packs, but it might be used deeper, e.g. tuple<Args...>. */
14904 /* The FN is a TEMPLATE_DECL for a function. ARGS is an array with
14905 NARGS elements of the arguments that are being used when calling
14906 it. TARGS is a vector into which the deduced template arguments
14909 Return zero for success, 2 for an incomplete match that doesn't resolve
14910 all the types, and 1 for complete failure. An error message will be
14911 printed only for an incomplete match.
14913 If FN is a conversion operator, or we are trying to produce a specific
14914 specialization, RETURN_TYPE is the return type desired.
14916 The EXPLICIT_TARGS are explicit template arguments provided via a
14919 The parameter STRICT is one of:
14922 We are deducing arguments for a function call, as in
14923 [temp.deduct.call].
14926 We are deducing arguments for a conversion function, as in
14927 [temp.deduct.conv].
14930 We are deducing arguments when doing an explicit instantiation
14931 as in [temp.explicit], when determining an explicit specialization
14932 as in [temp.expl.spec], or when taking the address of a function
14933 template, as in [temp.deduct.funcaddr]. */
14936 fn_type_unification (tree fn
,
14937 tree explicit_targs
,
14940 unsigned int nargs
,
14942 unification_kind_t strict
,
14949 tree decl
= NULL_TREE
;
14950 tsubst_flags_t complain
= (explain_p
? tf_warning_or_error
: tf_none
);
14952 static int deduction_depth
;
14953 struct pending_template
*old_last_pend
= last_pending_template
;
14954 struct tinst_level
*old_error_tinst
= last_error_tinst_level
;
14955 tree tparms
= DECL_INNERMOST_TEMPLATE_PARMS (fn
);
14957 tree r
= error_mark_node
;
14960 complain
|= tf_decltype
;
14962 /* In C++0x, it's possible to have a function template whose type depends
14963 on itself recursively. This is most obvious with decltype, but can also
14964 occur with enumeration scope (c++/48969). So we need to catch infinite
14965 recursion and reject the substitution at deduction time; this function
14966 will return error_mark_node for any repeated substitution.
14968 This also catches excessive recursion such as when f<N> depends on
14969 f<N-1> across all integers, and returns error_mark_node for all the
14970 substitutions back up to the initial one.
14972 This is, of course, not reentrant. */
14973 if (excessive_deduction_depth
)
14974 return error_mark_node
;
14975 tinst
= build_tree_list (fn
, NULL_TREE
);
14977 push_deferring_access_checks (dk_deferred
);
14979 gcc_assert (TREE_CODE (fn
) == TEMPLATE_DECL
);
14981 fntype
= TREE_TYPE (fn
);
14982 if (explicit_targs
)
14986 The specified template arguments must match the template
14987 parameters in kind (i.e., type, nontype, template), and there
14988 must not be more arguments than there are parameters;
14989 otherwise type deduction fails.
14991 Nontype arguments must match the types of the corresponding
14992 nontype template parameters, or must be convertible to the
14993 types of the corresponding nontype parameters as specified in
14994 _temp.arg.nontype_, otherwise type deduction fails.
14996 All references in the function type of the function template
14997 to the corresponding template parameters are replaced by the
14998 specified template argument values. If a substitution in a
14999 template parameter or in the function type of the function
15000 template results in an invalid type, type deduction fails. */
15001 int i
, len
= TREE_VEC_LENGTH (tparms
);
15002 location_t loc
= input_location
;
15003 bool incomplete
= false;
15005 /* Adjust any explicit template arguments before entering the
15006 substitution context. */
15008 = (coerce_template_parms (tparms
, explicit_targs
, NULL_TREE
,
15010 /*require_all_args=*/false,
15011 /*use_default_args=*/false));
15012 if (explicit_targs
== error_mark_node
)
15015 /* Substitute the explicit args into the function type. This is
15016 necessary so that, for instance, explicitly declared function
15017 arguments can match null pointed constants. If we were given
15018 an incomplete set of explicit args, we must not do semantic
15019 processing during substitution as we could create partial
15021 for (i
= 0; i
< len
; i
++)
15023 tree parm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
15024 bool parameter_pack
= false;
15025 tree targ
= TREE_VEC_ELT (explicit_targs
, i
);
15027 /* Dig out the actual parm. */
15028 if (TREE_CODE (parm
) == TYPE_DECL
15029 || TREE_CODE (parm
) == TEMPLATE_DECL
)
15031 parm
= TREE_TYPE (parm
);
15032 parameter_pack
= TEMPLATE_TYPE_PARAMETER_PACK (parm
);
15034 else if (TREE_CODE (parm
) == PARM_DECL
)
15036 parm
= DECL_INITIAL (parm
);
15037 parameter_pack
= TEMPLATE_PARM_PARAMETER_PACK (parm
);
15040 if (!parameter_pack
&& targ
== NULL_TREE
)
15041 /* No explicit argument for this template parameter. */
15044 if (parameter_pack
&& pack_deducible_p (parm
, fn
))
15046 /* Mark the argument pack as "incomplete". We could
15047 still deduce more arguments during unification.
15048 We remove this mark in type_unification_real. */
15051 ARGUMENT_PACK_INCOMPLETE_P(targ
) = 1;
15052 ARGUMENT_PACK_EXPLICIT_ARGS (targ
)
15053 = ARGUMENT_PACK_ARGS (targ
);
15056 /* We have some incomplete argument packs. */
15061 TREE_VALUE (tinst
) = explicit_targs
;
15062 if (!push_tinst_level (tinst
))
15064 excessive_deduction_depth
= true;
15067 processing_template_decl
+= incomplete
;
15068 input_location
= DECL_SOURCE_LOCATION (fn
);
15069 fntype
= tsubst (TREE_TYPE (fn
), explicit_targs
,
15070 complain
| tf_partial
, NULL_TREE
);
15071 input_location
= loc
;
15072 processing_template_decl
-= incomplete
;
15073 pop_tinst_level ();
15075 if (fntype
== error_mark_node
)
15078 /* Throw away these access checks; we'll see them again in
15079 instantiate_template and they might have the wrong
15080 access path at this point. */
15081 pop_deferring_access_checks ();
15082 push_deferring_access_checks (dk_deferred
);
15084 /* Place the explicitly specified arguments in TARGS. */
15085 for (i
= NUM_TMPL_ARGS (explicit_targs
); i
--;)
15086 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (explicit_targs
, i
);
15089 /* Never do unification on the 'this' parameter. */
15090 parms
= skip_artificial_parms_for (fn
, TYPE_ARG_TYPES (fntype
));
15096 parms
= tree_cons (NULL_TREE
, TREE_TYPE (fntype
), parms
);
15097 new_args
= XALLOCAVEC (tree
, nargs
+ 1);
15098 new_args
[0] = return_type
;
15099 memcpy (new_args
+ 1, args
, nargs
* sizeof (tree
));
15104 /* We allow incomplete unification without an error message here
15105 because the standard doesn't seem to explicitly prohibit it. Our
15106 callers must be ready to deal with unification failures in any
15109 ok
= !type_unification_real (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
15110 targs
, parms
, args
, nargs
, /*subr=*/0,
15111 strict
, flags
, explain_p
);
15115 /* Now that we have bindings for all of the template arguments,
15116 ensure that the arguments deduced for the template template
15117 parameters have compatible template parameter lists. We cannot
15118 check this property before we have deduced all template
15119 arguments, because the template parameter types of a template
15120 template parameter might depend on prior template parameters
15121 deduced after the template template parameter. The following
15122 ill-formed example illustrates this issue:
15124 template<typename T, template<T> class C> void f(C<5>, T);
15126 template<int N> struct X {};
15129 f(X<5>(), 5l); // error: template argument deduction fails
15132 The template parameter list of 'C' depends on the template type
15133 parameter 'T', but 'C' is deduced to 'X' before 'T' is deduced to
15134 'long'. Thus, we can't check that 'C' cannot bind to 'X' at the
15135 time that we deduce 'C'. */
15136 if (!template_template_parm_bindings_ok_p
15137 (DECL_INNERMOST_TEMPLATE_PARMS (fn
), targs
))
15139 unify_inconsistent_template_template_parameters (explain_p
);
15143 /* All is well so far. Now, check:
15147 When all template arguments have been deduced, all uses of
15148 template parameters in nondeduced contexts are replaced with
15149 the corresponding deduced argument values. If the
15150 substitution results in an invalid type, as described above,
15151 type deduction fails. */
15152 TREE_VALUE (tinst
) = targs
;
15153 if (!push_tinst_level (tinst
))
15155 excessive_deduction_depth
= true;
15158 decl
= instantiate_template (fn
, targs
, complain
);
15159 pop_tinst_level ();
15161 if (decl
== error_mark_node
)
15164 /* Now perform any access checks encountered during deduction, such as
15165 for default template arguments. */
15166 push_access_scope (decl
);
15167 ok
= perform_deferred_access_checks (complain
);
15168 pop_access_scope (decl
);
15172 /* If we're looking for an exact match, check that what we got
15173 is indeed an exact match. It might not be if some template
15174 parameters are used in non-deduced contexts. */
15175 if (strict
== DEDUCE_EXACT
)
15177 tree substed
= TREE_TYPE (decl
);
15181 = skip_artificial_parms_for (decl
, TYPE_ARG_TYPES (substed
));
15183 sarg
= tree_cons (NULL_TREE
, TREE_TYPE (substed
), sarg
);
15184 for (i
= 0; i
< nargs
&& sarg
; ++i
, sarg
= TREE_CHAIN (sarg
))
15185 if (!same_type_p (args
[i
], TREE_VALUE (sarg
)))
15187 unify_type_mismatch (explain_p
, args
[i
],
15188 TREE_VALUE (sarg
));
15196 pop_deferring_access_checks ();
15198 if (excessive_deduction_depth
)
15200 if (deduction_depth
== 0)
15201 /* Reset once we're all the way out. */
15202 excessive_deduction_depth
= false;
15205 /* We can't free this if a pending_template entry or last_error_tinst_level
15206 is pointing at it. */
15207 if (last_pending_template
== old_last_pend
15208 && last_error_tinst_level
== old_error_tinst
)
15214 /* Adjust types before performing type deduction, as described in
15215 [temp.deduct.call] and [temp.deduct.conv]. The rules in these two
15216 sections are symmetric. PARM is the type of a function parameter
15217 or the return type of the conversion function. ARG is the type of
15218 the argument passed to the call, or the type of the value
15219 initialized with the result of the conversion function.
15220 ARG_EXPR is the original argument expression, which may be null. */
15223 maybe_adjust_types_for_deduction (unification_kind_t strict
,
15237 /* Swap PARM and ARG throughout the remainder of this
15238 function; the handling is precisely symmetric since PARM
15239 will initialize ARG rather than vice versa. */
15247 /* Core issue #873: Do the DR606 thing (see below) for these cases,
15248 too, but here handle it by stripping the reference from PARM
15249 rather than by adding it to ARG. */
15250 if (TREE_CODE (*parm
) == REFERENCE_TYPE
15251 && TYPE_REF_IS_RVALUE (*parm
)
15252 && TREE_CODE (TREE_TYPE (*parm
)) == TEMPLATE_TYPE_PARM
15253 && cp_type_quals (TREE_TYPE (*parm
)) == TYPE_UNQUALIFIED
15254 && TREE_CODE (*arg
) == REFERENCE_TYPE
15255 && !TYPE_REF_IS_RVALUE (*arg
))
15256 *parm
= TREE_TYPE (*parm
);
15257 /* Nothing else to do in this case. */
15261 gcc_unreachable ();
15264 if (TREE_CODE (*parm
) != REFERENCE_TYPE
)
15266 /* [temp.deduct.call]
15268 If P is not a reference type:
15270 --If A is an array type, the pointer type produced by the
15271 array-to-pointer standard conversion (_conv.array_) is
15272 used in place of A for type deduction; otherwise,
15274 --If A is a function type, the pointer type produced by
15275 the function-to-pointer standard conversion
15276 (_conv.func_) is used in place of A for type deduction;
15279 --If A is a cv-qualified type, the top level
15280 cv-qualifiers of A's type are ignored for type
15282 if (TREE_CODE (*arg
) == ARRAY_TYPE
)
15283 *arg
= build_pointer_type (TREE_TYPE (*arg
));
15284 else if (TREE_CODE (*arg
) == FUNCTION_TYPE
)
15285 *arg
= build_pointer_type (*arg
);
15287 *arg
= TYPE_MAIN_VARIANT (*arg
);
15290 /* From C++0x [14.8.2.1/3 temp.deduct.call] (after DR606), "If P is
15291 of the form T&&, where T is a template parameter, and the argument
15292 is an lvalue, T is deduced as A& */
15293 if (TREE_CODE (*parm
) == REFERENCE_TYPE
15294 && TYPE_REF_IS_RVALUE (*parm
)
15295 && TREE_CODE (TREE_TYPE (*parm
)) == TEMPLATE_TYPE_PARM
15296 && cp_type_quals (TREE_TYPE (*parm
)) == TYPE_UNQUALIFIED
15297 && (arg_expr
? real_lvalue_p (arg_expr
)
15298 /* try_one_overload doesn't provide an arg_expr, but
15299 functions are always lvalues. */
15300 : TREE_CODE (*arg
) == FUNCTION_TYPE
))
15301 *arg
= build_reference_type (*arg
);
15303 /* [temp.deduct.call]
15305 If P is a cv-qualified type, the top level cv-qualifiers
15306 of P's type are ignored for type deduction. If P is a
15307 reference type, the type referred to by P is used for
15309 *parm
= TYPE_MAIN_VARIANT (*parm
);
15310 if (TREE_CODE (*parm
) == REFERENCE_TYPE
)
15312 *parm
= TREE_TYPE (*parm
);
15313 result
|= UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
15316 /* DR 322. For conversion deduction, remove a reference type on parm
15317 too (which has been swapped into ARG). */
15318 if (strict
== DEDUCE_CONV
&& TREE_CODE (*arg
) == REFERENCE_TYPE
)
15319 *arg
= TREE_TYPE (*arg
);
15324 /* Subroutine of unify_one_argument. PARM is a function parameter of a
15325 template which does contain any deducible template parameters; check if
15326 ARG is a suitable match for it. STRICT, FLAGS and EXPLAIN_P are as in
15327 unify_one_argument. */
15330 check_non_deducible_conversion (tree parm
, tree arg
, int strict
,
15331 int flags
, bool explain_p
)
15336 type
= TREE_TYPE (arg
);
15340 if (same_type_p (parm
, type
))
15341 return unify_success (explain_p
);
15343 if (strict
== DEDUCE_CONV
)
15345 if (can_convert_arg (type
, parm
, NULL_TREE
, flags
,
15346 explain_p
? tf_warning_or_error
: tf_none
))
15347 return unify_success (explain_p
);
15349 else if (strict
!= DEDUCE_EXACT
)
15351 if (can_convert_arg (parm
, type
,
15352 TYPE_P (arg
) ? NULL_TREE
: arg
,
15353 flags
, explain_p
? tf_warning_or_error
: tf_none
))
15354 return unify_success (explain_p
);
15357 if (strict
== DEDUCE_EXACT
)
15358 return unify_type_mismatch (explain_p
, parm
, arg
);
15360 return unify_arg_conversion (explain_p
, parm
, type
, arg
);
15363 /* Subroutine of type_unification_real and unify_pack_expansion to
15364 handle unification of a single P/A pair. Parameters are as
15365 for those functions. */
15368 unify_one_argument (tree tparms
, tree targs
, tree parm
, tree arg
,
15369 int subr
, unification_kind_t strict
, int flags
,
15372 tree arg_expr
= NULL_TREE
;
15375 if (arg
== error_mark_node
|| parm
== error_mark_node
)
15376 return unify_invalid (explain_p
);
15377 if (arg
== unknown_type_node
)
15378 /* We can't deduce anything from this, but we might get all the
15379 template args from other function args. */
15380 return unify_success (explain_p
);
15382 /* FIXME uses_deducible_template_parms */
15383 if (TYPE_P (parm
) && !uses_template_parms (parm
))
15384 return check_non_deducible_conversion (parm
, arg
, strict
, flags
,
15390 arg_strict
= (UNIFY_ALLOW_OUTER_LEVEL
15391 | UNIFY_ALLOW_MORE_CV_QUAL
15392 | UNIFY_ALLOW_DERIVED
);
15396 arg_strict
= UNIFY_ALLOW_LESS_CV_QUAL
;
15400 arg_strict
= UNIFY_ALLOW_NONE
;
15404 gcc_unreachable ();
15407 /* We only do these transformations if this is the top-level
15408 parameter_type_list in a call or declaration matching; in other
15409 situations (nested function declarators, template argument lists) we
15410 won't be comparing a type to an expression, and we don't do any type
15416 gcc_assert (TREE_TYPE (arg
) != NULL_TREE
);
15417 if (type_unknown_p (arg
))
15419 /* [temp.deduct.type] A template-argument can be
15420 deduced from a pointer to function or pointer
15421 to member function argument if the set of
15422 overloaded functions does not contain function
15423 templates and at most one of a set of
15424 overloaded functions provides a unique
15427 if (resolve_overloaded_unification
15428 (tparms
, targs
, parm
, arg
, strict
,
15429 arg_strict
, explain_p
))
15430 return unify_success (explain_p
);
15431 return unify_overload_resolution_failure (explain_p
, arg
);
15435 arg
= unlowered_expr_type (arg
);
15436 if (arg
== error_mark_node
)
15437 return unify_invalid (explain_p
);
15441 maybe_adjust_types_for_deduction (strict
, &parm
, &arg
, arg_expr
);
15444 gcc_assert ((TYPE_P (parm
) || TREE_CODE (parm
) == TEMPLATE_DECL
)
15445 == (TYPE_P (arg
) || TREE_CODE (arg
) == TEMPLATE_DECL
));
15447 /* For deduction from an init-list we need the actual list. */
15448 if (arg_expr
&& BRACE_ENCLOSED_INITIALIZER_P (arg_expr
))
15450 return unify (tparms
, targs
, parm
, arg
, arg_strict
, explain_p
);
15453 /* Most parms like fn_type_unification.
15455 If SUBR is 1, we're being called recursively (to unify the
15456 arguments of a function or method parameter of a function
15460 type_unification_real (tree tparms
,
15464 unsigned int xnargs
,
15466 unification_kind_t strict
,
15472 int ntparms
= TREE_VEC_LENGTH (tparms
);
15473 int saw_undeduced
= 0;
15476 unsigned int nargs
;
15479 gcc_assert (TREE_CODE (tparms
) == TREE_VEC
);
15480 gcc_assert (xparms
== NULL_TREE
|| TREE_CODE (xparms
) == TREE_LIST
);
15481 gcc_assert (ntparms
> 0);
15483 /* Reset the number of non-defaulted template arguments contained
15485 NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
) = NULL_TREE
;
15493 while (parms
&& parms
!= void_list_node
15496 parm
= TREE_VALUE (parms
);
15498 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
15499 && (!TREE_CHAIN (parms
) || TREE_CHAIN (parms
) == void_list_node
))
15500 /* For a function parameter pack that occurs at the end of the
15501 parameter-declaration-list, the type A of each remaining
15502 argument of the call is compared with the type P of the
15503 declarator-id of the function parameter pack. */
15506 parms
= TREE_CHAIN (parms
);
15508 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
)
15509 /* For a function parameter pack that does not occur at the
15510 end of the parameter-declaration-list, the type of the
15511 parameter pack is a non-deduced context. */
15517 if (unify_one_argument (tparms
, targs
, parm
, arg
, subr
, strict
,
15523 && parms
!= void_list_node
15524 && TREE_CODE (TREE_VALUE (parms
)) == TYPE_PACK_EXPANSION
)
15526 /* Unify the remaining arguments with the pack expansion type. */
15528 tree parmvec
= make_tree_vec (1);
15530 /* Allocate a TREE_VEC and copy in all of the arguments */
15531 argvec
= make_tree_vec (nargs
- ia
);
15532 for (i
= 0; ia
< nargs
; ++ia
, ++i
)
15533 TREE_VEC_ELT (argvec
, i
) = args
[ia
];
15535 /* Copy the parameter into parmvec. */
15536 TREE_VEC_ELT (parmvec
, 0) = TREE_VALUE (parms
);
15537 if (unify_pack_expansion (tparms
, targs
, parmvec
, argvec
, strict
,
15538 /*subr=*/subr
, explain_p
))
15541 /* Advance to the end of the list of parameters. */
15542 parms
= TREE_CHAIN (parms
);
15545 /* Fail if we've reached the end of the parm list, and more args
15546 are present, and the parm list isn't variadic. */
15547 if (ia
< nargs
&& parms
== void_list_node
)
15548 return unify_too_many_arguments (explain_p
, nargs
, ia
);
15549 /* Fail if parms are left and they don't have default values. */
15550 if (parms
&& parms
!= void_list_node
15551 && TREE_PURPOSE (parms
) == NULL_TREE
)
15553 unsigned int count
= nargs
;
15555 while (p
&& p
!= void_list_node
)
15558 p
= TREE_CHAIN (p
);
15560 return unify_too_few_arguments (explain_p
, ia
, count
);
15565 tsubst_flags_t complain
= (explain_p
15566 ? tf_warning_or_error
15569 for (i
= 0; i
< ntparms
; i
++)
15571 tree targ
= TREE_VEC_ELT (targs
, i
);
15572 tree tparm
= TREE_VEC_ELT (tparms
, i
);
15574 /* Clear the "incomplete" flags on all argument packs now so that
15575 substituting them into later default arguments works. */
15576 if (targ
&& ARGUMENT_PACK_P (targ
))
15578 ARGUMENT_PACK_INCOMPLETE_P (targ
) = 0;
15579 ARGUMENT_PACK_EXPLICIT_ARGS (targ
) = NULL_TREE
;
15582 if (targ
|| tparm
== error_mark_node
)
15584 tparm
= TREE_VALUE (tparm
);
15586 /* If this is an undeduced nontype parameter that depends on
15587 a type parameter, try another pass; its type may have been
15588 deduced from a later argument than the one from which
15589 this parameter can be deduced. */
15590 if (TREE_CODE (tparm
) == PARM_DECL
15591 && uses_template_parms (TREE_TYPE (tparm
))
15592 && !saw_undeduced
++)
15595 /* Core issue #226 (C++0x) [temp.deduct]:
15597 If a template argument has not been deduced, its
15598 default template argument, if any, is used.
15600 When we are in C++98 mode, TREE_PURPOSE will either
15601 be NULL_TREE or ERROR_MARK_NODE, so we do not need
15602 to explicitly check cxx_dialect here. */
15603 if (TREE_PURPOSE (TREE_VEC_ELT (tparms
, i
)))
15605 tree parm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
15606 tree arg
= TREE_PURPOSE (TREE_VEC_ELT (tparms
, i
));
15607 location_t save_loc
= input_location
;
15609 input_location
= DECL_SOURCE_LOCATION (parm
);
15610 arg
= tsubst_template_arg (arg
, targs
, complain
, NULL_TREE
);
15611 arg
= convert_template_argument (parm
, arg
, targs
, complain
,
15613 input_location
= save_loc
;
15614 if (arg
== error_mark_node
)
15618 TREE_VEC_ELT (targs
, i
) = arg
;
15619 /* The position of the first default template argument,
15620 is also the number of non-defaulted arguments in TARGS.
15622 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
))
15623 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
, i
);
15628 /* If the type parameter is a parameter pack, then it will
15629 be deduced to an empty parameter pack. */
15630 if (template_parameter_pack_p (tparm
))
15634 if (TREE_CODE (tparm
) == TEMPLATE_PARM_INDEX
)
15636 arg
= make_node (NONTYPE_ARGUMENT_PACK
);
15637 TREE_TYPE (arg
) = TREE_TYPE (TEMPLATE_PARM_DECL (tparm
));
15638 TREE_CONSTANT (arg
) = 1;
15641 arg
= cxx_make_type (TYPE_ARGUMENT_PACK
);
15643 SET_ARGUMENT_PACK_ARGS (arg
, make_tree_vec (0));
15645 TREE_VEC_ELT (targs
, i
) = arg
;
15649 return unify_parameter_deduction_failure (explain_p
, tparm
);
15652 #ifdef ENABLE_CHECKING
15653 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
))
15654 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
, TREE_VEC_LENGTH (targs
));
15657 return unify_success (explain_p
);
15660 /* Subroutine of type_unification_real. Args are like the variables
15661 at the call site. ARG is an overloaded function (or template-id);
15662 we try deducing template args from each of the overloads, and if
15663 only one succeeds, we go with that. Modifies TARGS and returns
15664 true on success. */
15667 resolve_overloaded_unification (tree tparms
,
15671 unification_kind_t strict
,
15675 tree tempargs
= copy_node (targs
);
15677 tree goodfn
= NULL_TREE
;
15680 if (TREE_CODE (arg
) == ADDR_EXPR
)
15682 arg
= TREE_OPERAND (arg
, 0);
15688 if (TREE_CODE (arg
) == COMPONENT_REF
)
15689 /* Handle `&x' where `x' is some static or non-static member
15691 arg
= TREE_OPERAND (arg
, 1);
15693 if (TREE_CODE (arg
) == OFFSET_REF
)
15694 arg
= TREE_OPERAND (arg
, 1);
15696 /* Strip baselink information. */
15697 if (BASELINK_P (arg
))
15698 arg
= BASELINK_FUNCTIONS (arg
);
15700 if (TREE_CODE (arg
) == TEMPLATE_ID_EXPR
)
15702 /* If we got some explicit template args, we need to plug them into
15703 the affected templates before we try to unify, in case the
15704 explicit args will completely resolve the templates in question. */
15707 tree expl_subargs
= TREE_OPERAND (arg
, 1);
15708 arg
= TREE_OPERAND (arg
, 0);
15710 for (; arg
; arg
= OVL_NEXT (arg
))
15712 tree fn
= OVL_CURRENT (arg
);
15713 tree subargs
, elem
;
15715 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
15718 subargs
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
15719 expl_subargs
, NULL_TREE
, tf_none
,
15720 /*require_all_args=*/true,
15721 /*use_default_args=*/true);
15722 if (subargs
!= error_mark_node
15723 && !any_dependent_template_arguments_p (subargs
))
15725 elem
= tsubst (TREE_TYPE (fn
), subargs
, tf_none
, NULL_TREE
);
15726 if (try_one_overload (tparms
, targs
, tempargs
, parm
,
15727 elem
, strict
, sub_strict
, addr_p
, explain_p
)
15728 && (!goodfn
|| !same_type_p (goodfn
, elem
)))
15737 /* If no templates (or more than one) are fully resolved by the
15738 explicit arguments, this template-id is a non-deduced context; it
15739 could still be OK if we deduce all template arguments for the
15740 enclosing call through other arguments. */
15744 else if (TREE_CODE (arg
) != OVERLOAD
15745 && TREE_CODE (arg
) != FUNCTION_DECL
)
15746 /* If ARG is, for example, "(0, &f)" then its type will be unknown
15747 -- but the deduction does not succeed because the expression is
15748 not just the function on its own. */
15751 for (; arg
; arg
= OVL_NEXT (arg
))
15752 if (try_one_overload (tparms
, targs
, tempargs
, parm
,
15753 TREE_TYPE (OVL_CURRENT (arg
)),
15754 strict
, sub_strict
, addr_p
, explain_p
)
15755 && (!goodfn
|| !decls_match (goodfn
, OVL_CURRENT (arg
))))
15757 goodfn
= OVL_CURRENT (arg
);
15761 /* [temp.deduct.type] A template-argument can be deduced from a pointer
15762 to function or pointer to member function argument if the set of
15763 overloaded functions does not contain function templates and at most
15764 one of a set of overloaded functions provides a unique match.
15766 So if we found multiple possibilities, we return success but don't
15767 deduce anything. */
15771 int i
= TREE_VEC_LENGTH (targs
);
15773 if (TREE_VEC_ELT (tempargs
, i
))
15774 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (tempargs
, i
);
15782 /* Core DR 115: In contexts where deduction is done and fails, or in
15783 contexts where deduction is not done, if a template argument list is
15784 specified and it, along with any default template arguments, identifies
15785 a single function template specialization, then the template-id is an
15786 lvalue for the function template specialization. */
15789 resolve_nondeduced_context (tree orig_expr
)
15791 tree expr
, offset
, baselink
;
15794 if (!type_unknown_p (orig_expr
))
15799 offset
= NULL_TREE
;
15800 baselink
= NULL_TREE
;
15802 if (TREE_CODE (expr
) == ADDR_EXPR
)
15804 expr
= TREE_OPERAND (expr
, 0);
15807 if (TREE_CODE (expr
) == OFFSET_REF
)
15810 expr
= TREE_OPERAND (expr
, 1);
15812 if (BASELINK_P (expr
))
15815 expr
= BASELINK_FUNCTIONS (expr
);
15818 if (TREE_CODE (expr
) == TEMPLATE_ID_EXPR
)
15821 tree goodfn
= NULL_TREE
;
15823 /* If we got some explicit template args, we need to plug them into
15824 the affected templates before we try to unify, in case the
15825 explicit args will completely resolve the templates in question. */
15827 tree expl_subargs
= TREE_OPERAND (expr
, 1);
15828 tree arg
= TREE_OPERAND (expr
, 0);
15829 tree badfn
= NULL_TREE
;
15830 tree badargs
= NULL_TREE
;
15832 for (; arg
; arg
= OVL_NEXT (arg
))
15834 tree fn
= OVL_CURRENT (arg
);
15835 tree subargs
, elem
;
15837 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
15840 subargs
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
15841 expl_subargs
, NULL_TREE
, tf_none
,
15842 /*require_all_args=*/true,
15843 /*use_default_args=*/true);
15844 if (subargs
!= error_mark_node
15845 && !any_dependent_template_arguments_p (subargs
))
15847 elem
= instantiate_template (fn
, subargs
, tf_none
);
15848 if (elem
== error_mark_node
)
15853 else if (elem
&& (!goodfn
|| !decls_match (goodfn
, elem
)))
15862 mark_used (goodfn
);
15865 expr
= build_baselink (BASELINK_BINFO (baselink
),
15866 BASELINK_ACCESS_BINFO (baselink
),
15867 expr
, BASELINK_OPTYPE (baselink
));
15871 = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (offset
, 0)));
15872 expr
= build_offset_ref (base
, expr
, addr
);
15875 expr
= cp_build_addr_expr (expr
, tf_warning_or_error
);
15878 else if (good
== 0 && badargs
)
15879 /* There were no good options and at least one bad one, so let the
15880 user know what the problem is. */
15881 instantiate_template (badfn
, badargs
, tf_warning_or_error
);
15886 /* Subroutine of resolve_overloaded_unification; does deduction for a single
15887 overload. Fills TARGS with any deduced arguments, or error_mark_node if
15888 different overloads deduce different arguments for a given parm.
15889 ADDR_P is true if the expression for which deduction is being
15890 performed was of the form "& fn" rather than simply "fn".
15892 Returns 1 on success. */
15895 try_one_overload (tree tparms
,
15900 unification_kind_t strict
,
15909 if (arg
== error_mark_node
)
15912 /* [temp.deduct.type] A template-argument can be deduced from a pointer
15913 to function or pointer to member function argument if the set of
15914 overloaded functions does not contain function templates and at most
15915 one of a set of overloaded functions provides a unique match.
15917 So if this is a template, just return success. */
15919 if (uses_template_parms (arg
))
15922 if (TREE_CODE (arg
) == METHOD_TYPE
)
15923 arg
= build_ptrmemfunc_type (build_pointer_type (arg
));
15925 arg
= build_pointer_type (arg
);
15927 sub_strict
|= maybe_adjust_types_for_deduction (strict
, &parm
, &arg
, NULL
);
15929 /* We don't copy orig_targs for this because if we have already deduced
15930 some template args from previous args, unify would complain when we
15931 try to deduce a template parameter for the same argument, even though
15932 there isn't really a conflict. */
15933 nargs
= TREE_VEC_LENGTH (targs
);
15934 tempargs
= make_tree_vec (nargs
);
15936 if (unify (tparms
, tempargs
, parm
, arg
, sub_strict
, explain_p
))
15939 /* First make sure we didn't deduce anything that conflicts with
15940 explicitly specified args. */
15941 for (i
= nargs
; i
--; )
15943 tree elt
= TREE_VEC_ELT (tempargs
, i
);
15944 tree oldelt
= TREE_VEC_ELT (orig_targs
, i
);
15948 else if (uses_template_parms (elt
))
15949 /* Since we're unifying against ourselves, we will fill in
15950 template args used in the function parm list with our own
15951 template parms. Discard them. */
15952 TREE_VEC_ELT (tempargs
, i
) = NULL_TREE
;
15953 else if (oldelt
&& !template_args_equal (oldelt
, elt
))
15957 for (i
= nargs
; i
--; )
15959 tree elt
= TREE_VEC_ELT (tempargs
, i
);
15962 TREE_VEC_ELT (targs
, i
) = elt
;
15968 /* PARM is a template class (perhaps with unbound template
15969 parameters). ARG is a fully instantiated type. If ARG can be
15970 bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and
15971 TARGS are as for unify. */
15974 try_class_unification (tree tparms
, tree targs
, tree parm
, tree arg
,
15977 tree copy_of_targs
;
15979 if (!CLASSTYPE_TEMPLATE_INFO (arg
)
15980 || (most_general_template (CLASSTYPE_TI_TEMPLATE (arg
))
15981 != most_general_template (CLASSTYPE_TI_TEMPLATE (parm
))))
15984 /* We need to make a new template argument vector for the call to
15985 unify. If we used TARGS, we'd clutter it up with the result of
15986 the attempted unification, even if this class didn't work out.
15987 We also don't want to commit ourselves to all the unifications
15988 we've already done, since unification is supposed to be done on
15989 an argument-by-argument basis. In other words, consider the
15990 following pathological case:
15992 template <int I, int J, int K>
15995 template <int I, int J>
15996 struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {};
15998 template <int I, int J, int K>
15999 void f(S<I, J, K>, S<I, I, I>);
16008 Now, by the time we consider the unification involving `s2', we
16009 already know that we must have `f<0, 0, 0>'. But, even though
16010 `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is invalid
16011 because there are two ways to unify base classes of S<0, 1, 2>
16012 with S<I, I, I>. If we kept the already deduced knowledge, we
16013 would reject the possibility I=1. */
16014 copy_of_targs
= make_tree_vec (TREE_VEC_LENGTH (targs
));
16016 /* If unification failed, we're done. */
16017 if (unify (tparms
, copy_of_targs
, CLASSTYPE_TI_ARGS (parm
),
16018 CLASSTYPE_TI_ARGS (arg
), UNIFY_ALLOW_NONE
, explain_p
))
16024 /* Given a template type PARM and a class type ARG, find the unique
16025 base type in ARG that is an instance of PARM. We do not examine
16026 ARG itself; only its base-classes. If there is not exactly one
16027 appropriate base class, return NULL_TREE. PARM may be the type of
16028 a partial specialization, as well as a plain template type. Used
16031 static enum template_base_result
16032 get_template_base (tree tparms
, tree targs
, tree parm
, tree arg
,
16033 bool explain_p
, tree
*result
)
16035 tree rval
= NULL_TREE
;
16038 gcc_assert (RECORD_OR_UNION_CODE_P (TREE_CODE (arg
)));
16040 binfo
= TYPE_BINFO (complete_type (arg
));
16043 /* The type could not be completed. */
16044 *result
= NULL_TREE
;
16045 return tbr_incomplete_type
;
16048 /* Walk in inheritance graph order. The search order is not
16049 important, and this avoids multiple walks of virtual bases. */
16050 for (binfo
= TREE_CHAIN (binfo
); binfo
; binfo
= TREE_CHAIN (binfo
))
16052 tree r
= try_class_unification (tparms
, targs
, parm
,
16053 BINFO_TYPE (binfo
), explain_p
);
16057 /* If there is more than one satisfactory baseclass, then:
16061 If they yield more than one possible deduced A, the type
16065 if (rval
&& !same_type_p (r
, rval
))
16067 *result
= NULL_TREE
;
16068 return tbr_ambiguous_baseclass
;
16076 return tbr_success
;
16079 /* Returns the level of DECL, which declares a template parameter. */
16082 template_decl_level (tree decl
)
16084 switch (TREE_CODE (decl
))
16087 case TEMPLATE_DECL
:
16088 return TEMPLATE_TYPE_LEVEL (TREE_TYPE (decl
));
16091 return TEMPLATE_PARM_LEVEL (DECL_INITIAL (decl
));
16094 gcc_unreachable ();
16099 /* Decide whether ARG can be unified with PARM, considering only the
16100 cv-qualifiers of each type, given STRICT as documented for unify.
16101 Returns nonzero iff the unification is OK on that basis. */
16104 check_cv_quals_for_unify (int strict
, tree arg
, tree parm
)
16106 int arg_quals
= cp_type_quals (arg
);
16107 int parm_quals
= cp_type_quals (parm
);
16109 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
16110 && !(strict
& UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
16112 /* Although a CVR qualifier is ignored when being applied to a
16113 substituted template parameter ([8.3.2]/1 for example), that
16114 does not allow us to unify "const T" with "int&" because both
16115 types are not of the form "cv-list T" [14.8.2.5 temp.deduct.type].
16116 It is ok when we're allowing additional CV qualifiers
16117 at the outer level [14.8.2.1]/3,1st bullet. */
16118 if ((TREE_CODE (arg
) == REFERENCE_TYPE
16119 || TREE_CODE (arg
) == FUNCTION_TYPE
16120 || TREE_CODE (arg
) == METHOD_TYPE
)
16121 && (parm_quals
& (TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
)))
16124 if ((!POINTER_TYPE_P (arg
) && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
)
16125 && (parm_quals
& TYPE_QUAL_RESTRICT
))
16129 if (!(strict
& (UNIFY_ALLOW_MORE_CV_QUAL
| UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
16130 && (arg_quals
& parm_quals
) != parm_quals
)
16133 if (!(strict
& (UNIFY_ALLOW_LESS_CV_QUAL
| UNIFY_ALLOW_OUTER_LESS_CV_QUAL
))
16134 && (parm_quals
& arg_quals
) != arg_quals
)
16140 /* Determines the LEVEL and INDEX for the template parameter PARM. */
16142 template_parm_level_and_index (tree parm
, int* level
, int* index
)
16144 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
16145 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
16146 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
16148 *index
= TEMPLATE_TYPE_IDX (parm
);
16149 *level
= TEMPLATE_TYPE_LEVEL (parm
);
16153 *index
= TEMPLATE_PARM_IDX (parm
);
16154 *level
= TEMPLATE_PARM_LEVEL (parm
);
16158 #define RECUR_AND_CHECK_FAILURE(TP, TA, P, A, S, EP) \
16160 if (unify (TP, TA, P, A, S, EP)) \
16164 /* Unifies the remaining arguments in PACKED_ARGS with the pack
16165 expansion at the end of PACKED_PARMS. Returns 0 if the type
16166 deduction succeeds, 1 otherwise. STRICT is the same as in
16167 unify. CALL_ARGS_P is true iff PACKED_ARGS is actually a function
16168 call argument list. We'll need to adjust the arguments to make them
16169 types. SUBR tells us if this is from a recursive call to
16170 type_unification_real, or for comparing two template argument
16174 unify_pack_expansion (tree tparms
, tree targs
, tree packed_parms
,
16175 tree packed_args
, unification_kind_t strict
,
16176 bool subr
, bool explain_p
)
16179 = TREE_VEC_ELT (packed_parms
, TREE_VEC_LENGTH (packed_parms
) - 1);
16180 tree pattern
= PACK_EXPANSION_PATTERN (parm
);
16181 tree pack
, packs
= NULL_TREE
;
16182 int i
, start
= TREE_VEC_LENGTH (packed_parms
) - 1;
16183 int len
= TREE_VEC_LENGTH (packed_args
);
16185 /* Determine the parameter packs we will be deducing from the
16186 pattern, and record their current deductions. */
16187 for (pack
= PACK_EXPANSION_PARAMETER_PACKS (parm
);
16188 pack
; pack
= TREE_CHAIN (pack
))
16190 tree parm_pack
= TREE_VALUE (pack
);
16193 /* Determine the index and level of this parameter pack. */
16194 template_parm_level_and_index (parm_pack
, &level
, &idx
);
16196 /* Keep track of the parameter packs and their corresponding
16198 packs
= tree_cons (parm_pack
, TMPL_ARG (targs
, level
, idx
), packs
);
16199 TREE_TYPE (packs
) = make_tree_vec (len
- start
);
16202 /* Loop through all of the arguments that have not yet been
16203 unified and unify each with the pattern. */
16204 for (i
= start
; i
< len
; i
++)
16207 bool any_explicit
= false;
16208 tree arg
= TREE_VEC_ELT (packed_args
, i
);
16210 /* For each parameter pack, set its TMPL_ARG to either NULL_TREE
16211 or the element of its argument pack at the current index if
16212 this argument was explicitly specified. */
16213 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
16217 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
16220 if (TREE_VALUE (pack
)
16221 && (pargs
= ARGUMENT_PACK_EXPLICIT_ARGS (TREE_VALUE (pack
)))
16222 && (i
- start
< TREE_VEC_LENGTH (pargs
)))
16224 any_explicit
= true;
16225 arg
= TREE_VEC_ELT (pargs
, i
- start
);
16227 TMPL_ARG (targs
, level
, idx
) = arg
;
16230 /* If we had explicit template arguments, substitute them into the
16231 pattern before deduction. */
16234 /* Some arguments might still be unspecified or dependent. */
16236 ++processing_template_decl
;
16237 dependent
= any_dependent_template_arguments_p (targs
);
16239 --processing_template_decl
;
16240 parm
= tsubst (pattern
, targs
,
16241 explain_p
? tf_warning_or_error
: tf_none
,
16244 --processing_template_decl
;
16245 if (parm
== error_mark_node
)
16251 /* Unify the pattern with the current argument. */
16252 if (unify_one_argument (tparms
, targs
, parm
, arg
, subr
, strict
,
16253 LOOKUP_IMPLICIT
, explain_p
))
16256 /* For each parameter pack, collect the deduced value. */
16257 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
16260 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
16262 TREE_VEC_ELT (TREE_TYPE (pack
), i
- start
) =
16263 TMPL_ARG (targs
, level
, idx
);
16267 /* Verify that the results of unification with the parameter packs
16268 produce results consistent with what we've seen before, and make
16269 the deduced argument packs available. */
16270 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
16272 tree old_pack
= TREE_VALUE (pack
);
16273 tree new_args
= TREE_TYPE (pack
);
16274 int i
, len
= TREE_VEC_LENGTH (new_args
);
16276 bool nondeduced_p
= false;
16278 /* By default keep the original deduced argument pack.
16279 If necessary, more specific code is going to update the
16280 resulting deduced argument later down in this function. */
16281 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
16282 TMPL_ARG (targs
, level
, idx
) = old_pack
;
16284 /* If NEW_ARGS contains any NULL_TREE entries, we didn't
16285 actually deduce anything. */
16286 for (i
= 0; i
< len
&& !nondeduced_p
; ++i
)
16287 if (TREE_VEC_ELT (new_args
, i
) == NULL_TREE
)
16288 nondeduced_p
= true;
16292 if (old_pack
&& ARGUMENT_PACK_INCOMPLETE_P (old_pack
))
16294 /* If we had fewer function args than explicit template args,
16295 just use the explicits. */
16296 tree explicit_args
= ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
);
16297 int explicit_len
= TREE_VEC_LENGTH (explicit_args
);
16298 if (len
< explicit_len
)
16299 new_args
= explicit_args
;
16305 /* Build the deduced *_ARGUMENT_PACK. */
16306 if (TREE_CODE (TREE_PURPOSE (pack
)) == TEMPLATE_PARM_INDEX
)
16308 result
= make_node (NONTYPE_ARGUMENT_PACK
);
16309 TREE_TYPE (result
) =
16310 TREE_TYPE (TEMPLATE_PARM_DECL (TREE_PURPOSE (pack
)));
16311 TREE_CONSTANT (result
) = 1;
16314 result
= cxx_make_type (TYPE_ARGUMENT_PACK
);
16316 SET_ARGUMENT_PACK_ARGS (result
, new_args
);
16318 /* Note the deduced argument packs for this parameter
16320 TMPL_ARG (targs
, level
, idx
) = result
;
16322 else if (ARGUMENT_PACK_INCOMPLETE_P (old_pack
)
16323 && (ARGUMENT_PACK_ARGS (old_pack
)
16324 == ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
)))
16326 /* We only had the explicitly-provided arguments before, but
16327 now we have a complete set of arguments. */
16328 tree explicit_args
= ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
);
16330 SET_ARGUMENT_PACK_ARGS (old_pack
, new_args
);
16331 ARGUMENT_PACK_INCOMPLETE_P (old_pack
) = 1;
16332 ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
) = explicit_args
;
16336 tree bad_old_arg
= NULL_TREE
, bad_new_arg
= NULL_TREE
;
16337 tree old_args
= ARGUMENT_PACK_ARGS (old_pack
);
16339 if (!comp_template_args_with_info (old_args
, new_args
,
16340 &bad_old_arg
, &bad_new_arg
))
16341 /* Inconsistent unification of this parameter pack. */
16342 return unify_parameter_pack_inconsistent (explain_p
,
16348 return unify_success (explain_p
);
16351 /* Deduce the value of template parameters. TPARMS is the (innermost)
16352 set of template parameters to a template. TARGS is the bindings
16353 for those template parameters, as determined thus far; TARGS may
16354 include template arguments for outer levels of template parameters
16355 as well. PARM is a parameter to a template function, or a
16356 subcomponent of that parameter; ARG is the corresponding argument.
16357 This function attempts to match PARM with ARG in a manner
16358 consistent with the existing assignments in TARGS. If more values
16359 are deduced, then TARGS is updated.
16361 Returns 0 if the type deduction succeeds, 1 otherwise. The
16362 parameter STRICT is a bitwise or of the following flags:
16365 Require an exact match between PARM and ARG.
16366 UNIFY_ALLOW_MORE_CV_QUAL:
16367 Allow the deduced ARG to be more cv-qualified (by qualification
16368 conversion) than ARG.
16369 UNIFY_ALLOW_LESS_CV_QUAL:
16370 Allow the deduced ARG to be less cv-qualified than ARG.
16371 UNIFY_ALLOW_DERIVED:
16372 Allow the deduced ARG to be a template base class of ARG,
16373 or a pointer to a template base class of the type pointed to by
16375 UNIFY_ALLOW_INTEGER:
16376 Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX
16377 case for more information.
16378 UNIFY_ALLOW_OUTER_LEVEL:
16379 This is the outermost level of a deduction. Used to determine validity
16380 of qualification conversions. A valid qualification conversion must
16381 have const qualified pointers leading up to the inner type which
16382 requires additional CV quals, except at the outer level, where const
16383 is not required [conv.qual]. It would be normal to set this flag in
16384 addition to setting UNIFY_ALLOW_MORE_CV_QUAL.
16385 UNIFY_ALLOW_OUTER_MORE_CV_QUAL:
16386 This is the outermost level of a deduction, and PARM can be more CV
16387 qualified at this point.
16388 UNIFY_ALLOW_OUTER_LESS_CV_QUAL:
16389 This is the outermost level of a deduction, and PARM can be less CV
16390 qualified at this point. */
16393 unify (tree tparms
, tree targs
, tree parm
, tree arg
, int strict
,
16399 int strict_in
= strict
;
16401 /* I don't think this will do the right thing with respect to types.
16402 But the only case I've seen it in so far has been array bounds, where
16403 signedness is the only information lost, and I think that will be
16405 while (TREE_CODE (parm
) == NOP_EXPR
)
16406 parm
= TREE_OPERAND (parm
, 0);
16408 if (arg
== error_mark_node
)
16409 return unify_invalid (explain_p
);
16410 if (arg
== unknown_type_node
16411 || arg
== init_list_type_node
)
16412 /* We can't deduce anything from this, but we might get all the
16413 template args from other function args. */
16414 return unify_success (explain_p
);
16416 /* If PARM uses template parameters, then we can't bail out here,
16417 even if ARG == PARM, since we won't record unifications for the
16418 template parameters. We might need them if we're trying to
16419 figure out which of two things is more specialized. */
16420 if (arg
== parm
&& !uses_template_parms (parm
))
16421 return unify_success (explain_p
);
16423 /* Handle init lists early, so the rest of the function can assume
16424 we're dealing with a type. */
16425 if (BRACE_ENCLOSED_INITIALIZER_P (arg
))
16429 tree orig_parm
= parm
;
16431 /* Replace T with std::initializer_list<T> for deduction. */
16432 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
16433 && flag_deduce_init_list
)
16434 parm
= listify (parm
);
16436 if (!is_std_init_list (parm
))
16437 /* We can only deduce from an initializer list argument if the
16438 parameter is std::initializer_list; otherwise this is a
16439 non-deduced context. */
16440 return unify_success (explain_p
);
16442 elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (parm
), 0);
16444 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (arg
), i
, elt
)
16446 int elt_strict
= strict
;
16448 if (elt
== error_mark_node
)
16449 return unify_invalid (explain_p
);
16451 if (!BRACE_ENCLOSED_INITIALIZER_P (elt
))
16453 tree type
= TREE_TYPE (elt
);
16454 /* It should only be possible to get here for a call. */
16455 gcc_assert (elt_strict
& UNIFY_ALLOW_OUTER_LEVEL
);
16456 elt_strict
|= maybe_adjust_types_for_deduction
16457 (DEDUCE_CALL
, &elttype
, &type
, elt
);
16461 RECUR_AND_CHECK_FAILURE (tparms
, targs
, elttype
, elt
, elt_strict
,
16465 /* If the std::initializer_list<T> deduction worked, replace the
16466 deduced A with std::initializer_list<A>. */
16467 if (orig_parm
!= parm
)
16469 idx
= TEMPLATE_TYPE_IDX (orig_parm
);
16470 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
16471 targ
= listify (targ
);
16472 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = targ
;
16474 return unify_success (explain_p
);
16477 /* Immediately reject some pairs that won't unify because of
16478 cv-qualification mismatches. */
16479 if (TREE_CODE (arg
) == TREE_CODE (parm
)
16481 /* It is the elements of the array which hold the cv quals of an array
16482 type, and the elements might be template type parms. We'll check
16483 when we recurse. */
16484 && TREE_CODE (arg
) != ARRAY_TYPE
16485 /* We check the cv-qualifiers when unifying with template type
16486 parameters below. We want to allow ARG `const T' to unify with
16487 PARM `T' for example, when computing which of two templates
16488 is more specialized, for example. */
16489 && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
16490 && !check_cv_quals_for_unify (strict_in
, arg
, parm
))
16491 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
16493 if (!(strict
& UNIFY_ALLOW_OUTER_LEVEL
)
16494 && TYPE_P (parm
) && !CP_TYPE_CONST_P (parm
))
16495 strict
&= ~UNIFY_ALLOW_MORE_CV_QUAL
;
16496 strict
&= ~UNIFY_ALLOW_OUTER_LEVEL
;
16497 strict
&= ~UNIFY_ALLOW_DERIVED
;
16498 strict
&= ~UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
16499 strict
&= ~UNIFY_ALLOW_OUTER_LESS_CV_QUAL
;
16501 switch (TREE_CODE (parm
))
16503 case TYPENAME_TYPE
:
16505 case UNBOUND_CLASS_TEMPLATE
:
16506 /* In a type which contains a nested-name-specifier, template
16507 argument values cannot be deduced for template parameters used
16508 within the nested-name-specifier. */
16509 return unify_success (explain_p
);
16511 case TEMPLATE_TYPE_PARM
:
16512 case TEMPLATE_TEMPLATE_PARM
:
16513 case BOUND_TEMPLATE_TEMPLATE_PARM
:
16514 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
16515 if (tparm
== error_mark_node
)
16516 return unify_invalid (explain_p
);
16518 if (TEMPLATE_TYPE_LEVEL (parm
)
16519 != template_decl_level (tparm
))
16520 /* The PARM is not one we're trying to unify. Just check
16521 to see if it matches ARG. */
16523 if (TREE_CODE (arg
) == TREE_CODE (parm
)
16524 && (is_auto (parm
) ? is_auto (arg
)
16525 : same_type_p (parm
, arg
)))
16526 return unify_success (explain_p
);
16528 return unify_type_mismatch (explain_p
, parm
, arg
);
16530 idx
= TEMPLATE_TYPE_IDX (parm
);
16531 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
16532 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, idx
));
16533 if (tparm
== error_mark_node
)
16534 return unify_invalid (explain_p
);
16536 /* Check for mixed types and values. */
16537 if ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
16538 && TREE_CODE (tparm
) != TYPE_DECL
)
16539 || (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
16540 && TREE_CODE (tparm
) != TEMPLATE_DECL
))
16541 gcc_unreachable ();
16543 if (TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
16545 /* ARG must be constructed from a template class or a template
16546 template parameter. */
16547 if (TREE_CODE (arg
) != BOUND_TEMPLATE_TEMPLATE_PARM
16548 && !CLASSTYPE_SPECIALIZATION_OF_PRIMARY_TEMPLATE_P (arg
))
16549 return unify_template_deduction_failure (explain_p
, parm
, arg
);
16552 tree parmvec
= TYPE_TI_ARGS (parm
);
16553 tree argvec
= INNERMOST_TEMPLATE_ARGS (TYPE_TI_ARGS (arg
));
16554 tree full_argvec
= add_to_template_args (targs
, argvec
);
16556 = DECL_INNERMOST_TEMPLATE_PARMS
16557 (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (parm
));
16559 int parm_variadic_p
= 0;
16561 /* The resolution to DR150 makes clear that default
16562 arguments for an N-argument may not be used to bind T
16563 to a template template parameter with fewer than N
16564 parameters. It is not safe to permit the binding of
16565 default arguments as an extension, as that may change
16566 the meaning of a conforming program. Consider:
16568 struct Dense { static const unsigned int dim = 1; };
16570 template <template <typename> class View,
16572 void operator+(float, View<Block> const&);
16574 template <typename Block,
16575 unsigned int Dim = Block::dim>
16576 struct Lvalue_proxy { operator float() const; };
16580 Lvalue_proxy<Dense> p;
16585 Here, if Lvalue_proxy is permitted to bind to View, then
16586 the global operator+ will be used; if they are not, the
16587 Lvalue_proxy will be converted to float. */
16588 if (coerce_template_parms (parm_parms
,
16590 TYPE_TI_TEMPLATE (parm
),
16592 ? tf_warning_or_error
16594 /*require_all_args=*/true,
16595 /*use_default_args=*/false)
16596 == error_mark_node
)
16599 /* Deduce arguments T, i from TT<T> or TT<i>.
16600 We check each element of PARMVEC and ARGVEC individually
16601 rather than the whole TREE_VEC since they can have
16602 different number of elements. */
16604 parmvec
= expand_template_argument_pack (parmvec
);
16605 argvec
= expand_template_argument_pack (argvec
);
16607 len
= TREE_VEC_LENGTH (parmvec
);
16609 /* Check if the parameters end in a pack, making them
16612 && PACK_EXPANSION_P (TREE_VEC_ELT (parmvec
, len
- 1)))
16613 parm_variadic_p
= 1;
16615 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
16616 /* If the template argument list of P contains a pack
16617 expansion that is not the last template argument, the
16618 entire template argument list is a non-deduced
16620 if (PACK_EXPANSION_P (TREE_VEC_ELT (parmvec
, i
)))
16621 return unify_success (explain_p
);
16623 if (TREE_VEC_LENGTH (argvec
) < len
- parm_variadic_p
)
16624 return unify_too_few_arguments (explain_p
,
16625 TREE_VEC_LENGTH (argvec
), len
);
16627 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
16629 RECUR_AND_CHECK_FAILURE (tparms
, targs
,
16630 TREE_VEC_ELT (parmvec
, i
),
16631 TREE_VEC_ELT (argvec
, i
),
16632 UNIFY_ALLOW_NONE
, explain_p
);
16635 if (parm_variadic_p
16636 && unify_pack_expansion (tparms
, targs
,
16639 /*subr=*/true, explain_p
))
16642 arg
= TYPE_TI_TEMPLATE (arg
);
16644 /* Fall through to deduce template name. */
16647 if (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
16648 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
16650 /* Deduce template name TT from TT, TT<>, TT<T> and TT<i>. */
16652 /* Simple cases: Value already set, does match or doesn't. */
16653 if (targ
!= NULL_TREE
&& template_args_equal (targ
, arg
))
16654 return unify_success (explain_p
);
16656 return unify_inconsistency (explain_p
, parm
, targ
, arg
);
16660 /* If PARM is `const T' and ARG is only `int', we don't have
16661 a match unless we are allowing additional qualification.
16662 If ARG is `const int' and PARM is just `T' that's OK;
16663 that binds `const int' to `T'. */
16664 if (!check_cv_quals_for_unify (strict_in
| UNIFY_ALLOW_LESS_CV_QUAL
,
16666 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
16668 /* Consider the case where ARG is `const volatile int' and
16669 PARM is `const T'. Then, T should be `volatile int'. */
16670 arg
= cp_build_qualified_type_real
16671 (arg
, cp_type_quals (arg
) & ~cp_type_quals (parm
), tf_none
);
16672 if (arg
== error_mark_node
)
16673 return unify_invalid (explain_p
);
16675 /* Simple cases: Value already set, does match or doesn't. */
16676 if (targ
!= NULL_TREE
&& same_type_p (targ
, arg
))
16677 return unify_success (explain_p
);
16679 return unify_inconsistency (explain_p
, parm
, targ
, arg
);
16681 /* Make sure that ARG is not a variable-sized array. (Note
16682 that were talking about variable-sized arrays (like
16683 `int[n]'), rather than arrays of unknown size (like
16684 `int[]').) We'll get very confused by such a type since
16685 the bound of the array is not constant, and therefore
16686 not mangleable. Besides, such types are not allowed in
16687 ISO C++, so we can do as we please here. We do allow
16688 them for 'auto' deduction, since that isn't ABI-exposed. */
16689 if (!is_auto (parm
) && variably_modified_type_p (arg
, NULL_TREE
))
16690 return unify_vla_arg (explain_p
, arg
);
16692 /* Strip typedefs as in convert_template_argument. */
16693 arg
= canonicalize_type_argument (arg
, tf_none
);
16696 /* If ARG is a parameter pack or an expansion, we cannot unify
16697 against it unless PARM is also a parameter pack. */
16698 if ((template_parameter_pack_p (arg
) || PACK_EXPANSION_P (arg
))
16699 && !template_parameter_pack_p (parm
))
16700 return unify_parameter_pack_mismatch (explain_p
, parm
, arg
);
16702 /* If the argument deduction results is a METHOD_TYPE,
16703 then there is a problem.
16704 METHOD_TYPE doesn't map to any real C++ type the result of
16705 the deduction can not be of that type. */
16706 if (TREE_CODE (arg
) == METHOD_TYPE
)
16707 return unify_method_type_error (explain_p
, arg
);
16709 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = arg
;
16710 return unify_success (explain_p
);
16712 case TEMPLATE_PARM_INDEX
:
16713 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
16714 if (tparm
== error_mark_node
)
16715 return unify_invalid (explain_p
);
16717 if (TEMPLATE_PARM_LEVEL (parm
)
16718 != template_decl_level (tparm
))
16720 /* The PARM is not one we're trying to unify. Just check
16721 to see if it matches ARG. */
16722 int result
= !(TREE_CODE (arg
) == TREE_CODE (parm
)
16723 && cp_tree_equal (parm
, arg
));
16725 unify_expression_unequal (explain_p
, parm
, arg
);
16729 idx
= TEMPLATE_PARM_IDX (parm
);
16730 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
16734 int x
= !cp_tree_equal (targ
, arg
);
16736 unify_inconsistency (explain_p
, parm
, targ
, arg
);
16740 /* [temp.deduct.type] If, in the declaration of a function template
16741 with a non-type template-parameter, the non-type
16742 template-parameter is used in an expression in the function
16743 parameter-list and, if the corresponding template-argument is
16744 deduced, the template-argument type shall match the type of the
16745 template-parameter exactly, except that a template-argument
16746 deduced from an array bound may be of any integral type.
16747 The non-type parameter might use already deduced type parameters. */
16748 tparm
= tsubst (TREE_TYPE (parm
), targs
, 0, NULL_TREE
);
16749 if (!TREE_TYPE (arg
))
16750 /* Template-parameter dependent expression. Just accept it for now.
16751 It will later be processed in convert_template_argument. */
16753 else if (same_type_p (TREE_TYPE (arg
), tparm
))
16755 else if ((strict
& UNIFY_ALLOW_INTEGER
)
16756 && CP_INTEGRAL_TYPE_P (tparm
))
16757 /* Convert the ARG to the type of PARM; the deduced non-type
16758 template argument must exactly match the types of the
16759 corresponding parameter. */
16760 arg
= fold (build_nop (tparm
, arg
));
16761 else if (uses_template_parms (tparm
))
16762 /* We haven't deduced the type of this parameter yet. Try again
16764 return unify_success (explain_p
);
16766 return unify_type_mismatch (explain_p
, tparm
, arg
);
16768 /* If ARG is a parameter pack or an expansion, we cannot unify
16769 against it unless PARM is also a parameter pack. */
16770 if ((template_parameter_pack_p (arg
) || PACK_EXPANSION_P (arg
))
16771 && !TEMPLATE_PARM_PARAMETER_PACK (parm
))
16772 return unify_parameter_pack_mismatch (explain_p
, parm
, arg
);
16774 arg
= strip_typedefs_expr (arg
);
16775 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = arg
;
16776 return unify_success (explain_p
);
16780 /* A pointer-to-member constant can be unified only with
16781 another constant. */
16782 if (TREE_CODE (arg
) != PTRMEM_CST
)
16783 return unify_ptrmem_cst_mismatch (explain_p
, parm
, arg
);
16785 /* Just unify the class member. It would be useless (and possibly
16786 wrong, depending on the strict flags) to unify also
16787 PTRMEM_CST_CLASS, because we want to be sure that both parm and
16788 arg refer to the same variable, even if through different
16789 classes. For instance:
16791 struct A { int x; };
16794 Unification of &A::x and &B::x must succeed. */
16795 return unify (tparms
, targs
, PTRMEM_CST_MEMBER (parm
),
16796 PTRMEM_CST_MEMBER (arg
), strict
, explain_p
);
16801 if (!TYPE_PTR_P (arg
))
16802 return unify_type_mismatch (explain_p
, parm
, arg
);
16804 /* [temp.deduct.call]
16806 A can be another pointer or pointer to member type that can
16807 be converted to the deduced A via a qualification
16808 conversion (_conv.qual_).
16810 We pass down STRICT here rather than UNIFY_ALLOW_NONE.
16811 This will allow for additional cv-qualification of the
16812 pointed-to types if appropriate. */
16814 if (TREE_CODE (TREE_TYPE (arg
)) == RECORD_TYPE
)
16815 /* The derived-to-base conversion only persists through one
16816 level of pointers. */
16817 strict
|= (strict_in
& UNIFY_ALLOW_DERIVED
);
16819 return unify (tparms
, targs
, TREE_TYPE (parm
),
16820 TREE_TYPE (arg
), strict
, explain_p
);
16823 case REFERENCE_TYPE
:
16824 if (TREE_CODE (arg
) != REFERENCE_TYPE
)
16825 return unify_type_mismatch (explain_p
, parm
, arg
);
16826 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
16827 strict
& UNIFY_ALLOW_MORE_CV_QUAL
, explain_p
);
16830 if (TREE_CODE (arg
) != ARRAY_TYPE
)
16831 return unify_type_mismatch (explain_p
, parm
, arg
);
16832 if ((TYPE_DOMAIN (parm
) == NULL_TREE
)
16833 != (TYPE_DOMAIN (arg
) == NULL_TREE
))
16834 return unify_type_mismatch (explain_p
, parm
, arg
);
16835 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
16836 strict
& UNIFY_ALLOW_MORE_CV_QUAL
, explain_p
);
16837 if (TYPE_DOMAIN (parm
) != NULL_TREE
)
16844 /* Our representation of array types uses "N - 1" as the
16845 TYPE_MAX_VALUE for an array with "N" elements, if "N" is
16846 not an integer constant. We cannot unify arbitrarily
16847 complex expressions, so we eliminate the MINUS_EXPRs
16849 parm_max
= TYPE_MAX_VALUE (TYPE_DOMAIN (parm
));
16850 parm_cst
= TREE_CODE (parm_max
) == INTEGER_CST
;
16853 gcc_assert (TREE_CODE (parm_max
) == MINUS_EXPR
);
16854 parm_max
= TREE_OPERAND (parm_max
, 0);
16856 arg_max
= TYPE_MAX_VALUE (TYPE_DOMAIN (arg
));
16857 arg_cst
= TREE_CODE (arg_max
) == INTEGER_CST
;
16860 /* The ARG_MAX may not be a simple MINUS_EXPR, if we are
16861 trying to unify the type of a variable with the type
16862 of a template parameter. For example:
16864 template <unsigned int N>
16865 void f (char (&) [N]);
16872 Here, the type of the ARG will be "int [g(i)]", and
16873 may be a SAVE_EXPR, etc. */
16874 if (TREE_CODE (arg_max
) != MINUS_EXPR
)
16875 return unify_vla_arg (explain_p
, arg
);
16876 arg_max
= TREE_OPERAND (arg_max
, 0);
16879 /* If only one of the bounds used a MINUS_EXPR, compensate
16880 by adding one to the other bound. */
16881 if (parm_cst
&& !arg_cst
)
16882 parm_max
= fold_build2_loc (input_location
, PLUS_EXPR
,
16886 else if (arg_cst
&& !parm_cst
)
16887 arg_max
= fold_build2_loc (input_location
, PLUS_EXPR
,
16892 RECUR_AND_CHECK_FAILURE (tparms
, targs
, parm_max
, arg_max
,
16893 UNIFY_ALLOW_INTEGER
, explain_p
);
16895 return unify_success (explain_p
);
16902 case ENUMERAL_TYPE
:
16905 if (TREE_CODE (arg
) != TREE_CODE (parm
))
16906 return unify_type_mismatch (explain_p
, parm
, arg
);
16908 /* We have already checked cv-qualification at the top of the
16910 if (!same_type_ignoring_top_level_qualifiers_p (arg
, parm
))
16911 return unify_type_mismatch (explain_p
, parm
, arg
);
16913 /* As far as unification is concerned, this wins. Later checks
16914 will invalidate it if necessary. */
16915 return unify_success (explain_p
);
16917 /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */
16918 /* Type INTEGER_CST can come from ordinary constant template args. */
16920 while (TREE_CODE (arg
) == NOP_EXPR
)
16921 arg
= TREE_OPERAND (arg
, 0);
16923 if (TREE_CODE (arg
) != INTEGER_CST
)
16924 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
16925 return (tree_int_cst_equal (parm
, arg
)
16926 ? unify_success (explain_p
)
16927 : unify_template_argument_mismatch (explain_p
, parm
, arg
));
16931 int i
, len
, argslen
;
16932 int parm_variadic_p
= 0;
16934 if (TREE_CODE (arg
) != TREE_VEC
)
16935 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
16937 len
= TREE_VEC_LENGTH (parm
);
16938 argslen
= TREE_VEC_LENGTH (arg
);
16940 /* Check for pack expansions in the parameters. */
16941 for (i
= 0; i
< len
; ++i
)
16943 if (PACK_EXPANSION_P (TREE_VEC_ELT (parm
, i
)))
16946 /* We can unify against something with a trailing
16948 parm_variadic_p
= 1;
16950 /* [temp.deduct.type]/9: If the template argument list of
16951 P contains a pack expansion that is not the last
16952 template argument, the entire template argument list
16953 is a non-deduced context. */
16954 return unify_success (explain_p
);
16958 /* If we don't have enough arguments to satisfy the parameters
16959 (not counting the pack expression at the end), or we have
16960 too many arguments for a parameter list that doesn't end in
16961 a pack expression, we can't unify. */
16962 if (parm_variadic_p
16963 ? argslen
< len
- parm_variadic_p
16965 return unify_arity (explain_p
, TREE_VEC_LENGTH (arg
), len
);
16967 /* Unify all of the parameters that precede the (optional)
16968 pack expression. */
16969 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
16971 RECUR_AND_CHECK_FAILURE (tparms
, targs
,
16972 TREE_VEC_ELT (parm
, i
),
16973 TREE_VEC_ELT (arg
, i
),
16974 UNIFY_ALLOW_NONE
, explain_p
);
16976 if (parm_variadic_p
)
16977 return unify_pack_expansion (tparms
, targs
, parm
, arg
,
16979 /*subr=*/true, explain_p
);
16980 return unify_success (explain_p
);
16985 if (TREE_CODE (arg
) != TREE_CODE (parm
))
16986 return unify_type_mismatch (explain_p
, parm
, arg
);
16988 if (TYPE_PTRMEMFUNC_P (parm
))
16990 if (!TYPE_PTRMEMFUNC_P (arg
))
16991 return unify_type_mismatch (explain_p
, parm
, arg
);
16993 return unify (tparms
, targs
,
16994 TYPE_PTRMEMFUNC_FN_TYPE (parm
),
16995 TYPE_PTRMEMFUNC_FN_TYPE (arg
),
16996 strict
, explain_p
);
16999 if (CLASSTYPE_TEMPLATE_INFO (parm
))
17001 tree t
= NULL_TREE
;
17003 if (strict_in
& UNIFY_ALLOW_DERIVED
)
17005 /* First, we try to unify the PARM and ARG directly. */
17006 t
= try_class_unification (tparms
, targs
,
17007 parm
, arg
, explain_p
);
17011 /* Fallback to the special case allowed in
17012 [temp.deduct.call]:
17014 If P is a class, and P has the form
17015 template-id, then A can be a derived class of
17016 the deduced A. Likewise, if P is a pointer to
17017 a class of the form template-id, A can be a
17018 pointer to a derived class pointed to by the
17020 enum template_base_result r
;
17021 r
= get_template_base (tparms
, targs
, parm
, arg
,
17025 return unify_no_common_base (explain_p
, r
, parm
, arg
);
17028 else if (CLASSTYPE_TEMPLATE_INFO (arg
)
17029 && (CLASSTYPE_TI_TEMPLATE (parm
)
17030 == CLASSTYPE_TI_TEMPLATE (arg
)))
17031 /* Perhaps PARM is something like S<U> and ARG is S<int>.
17032 Then, we should unify `int' and `U'. */
17035 /* There's no chance of unification succeeding. */
17036 return unify_type_mismatch (explain_p
, parm
, arg
);
17038 return unify (tparms
, targs
, CLASSTYPE_TI_ARGS (parm
),
17039 CLASSTYPE_TI_ARGS (t
), UNIFY_ALLOW_NONE
, explain_p
);
17041 else if (!same_type_ignoring_top_level_qualifiers_p (parm
, arg
))
17042 return unify_type_mismatch (explain_p
, parm
, arg
);
17043 return unify_success (explain_p
);
17046 case FUNCTION_TYPE
:
17048 unsigned int nargs
;
17053 if (TREE_CODE (arg
) != TREE_CODE (parm
))
17054 return unify_type_mismatch (explain_p
, parm
, arg
);
17056 /* CV qualifications for methods can never be deduced, they must
17057 match exactly. We need to check them explicitly here,
17058 because type_unification_real treats them as any other
17059 cv-qualified parameter. */
17060 if (TREE_CODE (parm
) == METHOD_TYPE
17061 && (!check_cv_quals_for_unify
17063 class_of_this_parm (arg
),
17064 class_of_this_parm (parm
))))
17065 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
17067 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TREE_TYPE (parm
),
17068 TREE_TYPE (arg
), UNIFY_ALLOW_NONE
, explain_p
);
17070 nargs
= list_length (TYPE_ARG_TYPES (arg
));
17071 args
= XALLOCAVEC (tree
, nargs
);
17072 for (a
= TYPE_ARG_TYPES (arg
), i
= 0;
17073 a
!= NULL_TREE
&& a
!= void_list_node
;
17074 a
= TREE_CHAIN (a
), ++i
)
17075 args
[i
] = TREE_VALUE (a
);
17078 return type_unification_real (tparms
, targs
, TYPE_ARG_TYPES (parm
),
17079 args
, nargs
, 1, DEDUCE_EXACT
,
17080 LOOKUP_NORMAL
, explain_p
);
17084 /* Unify a pointer to member with a pointer to member function, which
17085 deduces the type of the member as a function type. */
17086 if (TYPE_PTRMEMFUNC_P (arg
))
17088 /* Check top-level cv qualifiers */
17089 if (!check_cv_quals_for_unify (UNIFY_ALLOW_NONE
, arg
, parm
))
17090 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
17092 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
17093 TYPE_PTRMEMFUNC_OBJECT_TYPE (arg
),
17094 UNIFY_ALLOW_NONE
, explain_p
);
17096 /* Determine the type of the function we are unifying against. */
17097 tree fntype
= static_fn_type (arg
);
17099 return unify (tparms
, targs
, TREE_TYPE (parm
), fntype
, strict
, explain_p
);
17102 if (TREE_CODE (arg
) != OFFSET_TYPE
)
17103 return unify_type_mismatch (explain_p
, parm
, arg
);
17104 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
17105 TYPE_OFFSET_BASETYPE (arg
),
17106 UNIFY_ALLOW_NONE
, explain_p
);
17107 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
17108 strict
, explain_p
);
17111 if (DECL_TEMPLATE_PARM_P (parm
))
17112 return unify (tparms
, targs
, DECL_INITIAL (parm
), arg
, strict
, explain_p
);
17113 if (arg
!= integral_constant_value (parm
))
17114 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
17115 return unify_success (explain_p
);
17118 case TEMPLATE_DECL
:
17119 /* Matched cases are handled by the ARG == PARM test above. */
17120 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
17123 /* A non-type template parameter that is a variable should be a
17124 an integral constant, in which case, it whould have been
17125 folded into its (constant) value. So we should not be getting
17126 a variable here. */
17127 gcc_unreachable ();
17129 case TYPE_ARGUMENT_PACK
:
17130 case NONTYPE_ARGUMENT_PACK
:
17131 return unify (tparms
, targs
, ARGUMENT_PACK_ARGS (parm
),
17132 ARGUMENT_PACK_ARGS (arg
), strict
, explain_p
);
17135 case DECLTYPE_TYPE
:
17136 case UNDERLYING_TYPE
:
17137 /* Cannot deduce anything from TYPEOF_TYPE, DECLTYPE_TYPE,
17138 or UNDERLYING_TYPE nodes. */
17139 return unify_success (explain_p
);
17142 /* Unification fails if we hit an error node. */
17143 return unify_invalid (explain_p
);
17146 /* An unresolved overload is a nondeduced context. */
17147 if (is_overloaded_fn (parm
) || type_unknown_p (parm
))
17148 return unify_success (explain_p
);
17149 gcc_assert (EXPR_P (parm
));
17151 /* We must be looking at an expression. This can happen with
17155 void foo(S<I>, S<I + 2>);
17157 This is a "nondeduced context":
17161 The nondeduced contexts are:
17163 --A type that is a template-id in which one or more of
17164 the template-arguments is an expression that references
17165 a template-parameter.
17167 In these cases, we assume deduction succeeded, but don't
17168 actually infer any unifications. */
17170 if (!uses_template_parms (parm
)
17171 && !template_args_equal (parm
, arg
))
17172 return unify_expression_unequal (explain_p
, parm
, arg
);
17174 return unify_success (explain_p
);
17177 #undef RECUR_AND_CHECK_FAILURE
17179 /* Note that DECL can be defined in this translation unit, if
17183 mark_definable (tree decl
)
17186 DECL_NOT_REALLY_EXTERN (decl
) = 1;
17187 FOR_EACH_CLONE (clone
, decl
)
17188 DECL_NOT_REALLY_EXTERN (clone
) = 1;
17191 /* Called if RESULT is explicitly instantiated, or is a member of an
17192 explicitly instantiated class. */
17195 mark_decl_instantiated (tree result
, int extern_p
)
17197 SET_DECL_EXPLICIT_INSTANTIATION (result
);
17199 /* If this entity has already been written out, it's too late to
17200 make any modifications. */
17201 if (TREE_ASM_WRITTEN (result
))
17204 if (TREE_CODE (result
) != FUNCTION_DECL
)
17205 /* The TREE_PUBLIC flag for function declarations will have been
17206 set correctly by tsubst. */
17207 TREE_PUBLIC (result
) = 1;
17209 /* This might have been set by an earlier implicit instantiation. */
17210 DECL_COMDAT (result
) = 0;
17213 DECL_NOT_REALLY_EXTERN (result
) = 0;
17216 mark_definable (result
);
17217 /* Always make artificials weak. */
17218 if (DECL_ARTIFICIAL (result
) && flag_weak
)
17219 comdat_linkage (result
);
17220 /* For WIN32 we also want to put explicit instantiations in
17221 linkonce sections. */
17222 else if (TREE_PUBLIC (result
))
17223 maybe_make_one_only (result
);
17226 /* If EXTERN_P, then this function will not be emitted -- unless
17227 followed by an explicit instantiation, at which point its linkage
17228 will be adjusted. If !EXTERN_P, then this function will be
17229 emitted here. In neither circumstance do we want
17230 import_export_decl to adjust the linkage. */
17231 DECL_INTERFACE_KNOWN (result
) = 1;
17234 /* Subroutine of more_specialized_fn: check whether TARGS is missing any
17235 important template arguments. If any are missing, we check whether
17236 they're important by using error_mark_node for substituting into any
17237 args that were used for partial ordering (the ones between ARGS and END)
17238 and seeing if it bubbles up. */
17241 check_undeduced_parms (tree targs
, tree args
, tree end
)
17243 bool found
= false;
17245 for (i
= TREE_VEC_LENGTH (targs
) - 1; i
>= 0; --i
)
17246 if (TREE_VEC_ELT (targs
, i
) == NULL_TREE
)
17249 TREE_VEC_ELT (targs
, i
) = error_mark_node
;
17253 tree substed
= tsubst_arg_types (args
, targs
, end
, tf_none
, NULL_TREE
);
17254 if (substed
== error_mark_node
)
17260 /* Given two function templates PAT1 and PAT2, return:
17262 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order].
17263 -1 if PAT2 is more specialized than PAT1.
17264 0 if neither is more specialized.
17266 LEN indicates the number of parameters we should consider
17267 (defaulted parameters should not be considered).
17269 The 1998 std underspecified function template partial ordering, and
17270 DR214 addresses the issue. We take pairs of arguments, one from
17271 each of the templates, and deduce them against each other. One of
17272 the templates will be more specialized if all the *other*
17273 template's arguments deduce against its arguments and at least one
17274 of its arguments *does* *not* deduce against the other template's
17275 corresponding argument. Deduction is done as for class templates.
17276 The arguments used in deduction have reference and top level cv
17277 qualifiers removed. Iff both arguments were originally reference
17278 types *and* deduction succeeds in both directions, the template
17279 with the more cv-qualified argument wins for that pairing (if
17280 neither is more cv-qualified, they both are equal). Unlike regular
17281 deduction, after all the arguments have been deduced in this way,
17282 we do *not* verify the deduced template argument values can be
17283 substituted into non-deduced contexts.
17285 The logic can be a bit confusing here, because we look at deduce1 and
17286 targs1 to see if pat2 is at least as specialized, and vice versa; if we
17287 can find template arguments for pat1 to make arg1 look like arg2, that
17288 means that arg2 is at least as specialized as arg1. */
17291 more_specialized_fn (tree pat1
, tree pat2
, int len
)
17293 tree decl1
= DECL_TEMPLATE_RESULT (pat1
);
17294 tree decl2
= DECL_TEMPLATE_RESULT (pat2
);
17295 tree targs1
= make_tree_vec (DECL_NTPARMS (pat1
));
17296 tree targs2
= make_tree_vec (DECL_NTPARMS (pat2
));
17297 tree tparms1
= DECL_INNERMOST_TEMPLATE_PARMS (pat1
);
17298 tree tparms2
= DECL_INNERMOST_TEMPLATE_PARMS (pat2
);
17299 tree args1
= TYPE_ARG_TYPES (TREE_TYPE (decl1
));
17300 tree args2
= TYPE_ARG_TYPES (TREE_TYPE (decl2
));
17301 tree origs1
, origs2
;
17302 bool lose1
= false;
17303 bool lose2
= false;
17305 /* Remove the this parameter from non-static member functions. If
17306 one is a non-static member function and the other is not a static
17307 member function, remove the first parameter from that function
17308 also. This situation occurs for operator functions where we
17309 locate both a member function (with this pointer) and non-member
17310 operator (with explicit first operand). */
17311 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl1
))
17313 len
--; /* LEN is the number of significant arguments for DECL1 */
17314 args1
= TREE_CHAIN (args1
);
17315 if (!DECL_STATIC_FUNCTION_P (decl2
))
17316 args2
= TREE_CHAIN (args2
);
17318 else if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl2
))
17320 args2
= TREE_CHAIN (args2
);
17321 if (!DECL_STATIC_FUNCTION_P (decl1
))
17324 args1
= TREE_CHAIN (args1
);
17328 /* If only one is a conversion operator, they are unordered. */
17329 if (DECL_CONV_FN_P (decl1
) != DECL_CONV_FN_P (decl2
))
17332 /* Consider the return type for a conversion function */
17333 if (DECL_CONV_FN_P (decl1
))
17335 args1
= tree_cons (NULL_TREE
, TREE_TYPE (TREE_TYPE (decl1
)), args1
);
17336 args2
= tree_cons (NULL_TREE
, TREE_TYPE (TREE_TYPE (decl2
)), args2
);
17340 processing_template_decl
++;
17346 /* Stop when an ellipsis is seen. */
17347 && args1
!= NULL_TREE
&& args2
!= NULL_TREE
)
17349 tree arg1
= TREE_VALUE (args1
);
17350 tree arg2
= TREE_VALUE (args2
);
17351 int deduce1
, deduce2
;
17355 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
17356 && TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
17358 /* When both arguments are pack expansions, we need only
17359 unify the patterns themselves. */
17360 arg1
= PACK_EXPANSION_PATTERN (arg1
);
17361 arg2
= PACK_EXPANSION_PATTERN (arg2
);
17363 /* This is the last comparison we need to do. */
17367 if (TREE_CODE (arg1
) == REFERENCE_TYPE
)
17369 arg1
= TREE_TYPE (arg1
);
17370 quals1
= cp_type_quals (arg1
);
17373 if (TREE_CODE (arg2
) == REFERENCE_TYPE
)
17375 arg2
= TREE_TYPE (arg2
);
17376 quals2
= cp_type_quals (arg2
);
17379 arg1
= TYPE_MAIN_VARIANT (arg1
);
17380 arg2
= TYPE_MAIN_VARIANT (arg2
);
17382 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
)
17384 int i
, len2
= list_length (args2
);
17385 tree parmvec
= make_tree_vec (1);
17386 tree argvec
= make_tree_vec (len2
);
17389 /* Setup the parameter vector, which contains only ARG1. */
17390 TREE_VEC_ELT (parmvec
, 0) = arg1
;
17392 /* Setup the argument vector, which contains the remaining
17394 for (i
= 0; i
< len2
; i
++, ta
= TREE_CHAIN (ta
))
17395 TREE_VEC_ELT (argvec
, i
) = TREE_VALUE (ta
);
17397 deduce1
= (unify_pack_expansion (tparms1
, targs1
, parmvec
,
17398 argvec
, DEDUCE_EXACT
,
17399 /*subr=*/true, /*explain_p=*/false)
17402 /* We cannot deduce in the other direction, because ARG1 is
17403 a pack expansion but ARG2 is not. */
17406 else if (TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
17408 int i
, len1
= list_length (args1
);
17409 tree parmvec
= make_tree_vec (1);
17410 tree argvec
= make_tree_vec (len1
);
17413 /* Setup the parameter vector, which contains only ARG1. */
17414 TREE_VEC_ELT (parmvec
, 0) = arg2
;
17416 /* Setup the argument vector, which contains the remaining
17418 for (i
= 0; i
< len1
; i
++, ta
= TREE_CHAIN (ta
))
17419 TREE_VEC_ELT (argvec
, i
) = TREE_VALUE (ta
);
17421 deduce2
= (unify_pack_expansion (tparms2
, targs2
, parmvec
,
17422 argvec
, DEDUCE_EXACT
,
17423 /*subr=*/true, /*explain_p=*/false)
17426 /* We cannot deduce in the other direction, because ARG2 is
17427 a pack expansion but ARG1 is not.*/
17433 /* The normal case, where neither argument is a pack
17435 deduce1
= (unify (tparms1
, targs1
, arg1
, arg2
,
17436 UNIFY_ALLOW_NONE
, /*explain_p=*/false)
17438 deduce2
= (unify (tparms2
, targs2
, arg2
, arg1
,
17439 UNIFY_ALLOW_NONE
, /*explain_p=*/false)
17443 /* If we couldn't deduce arguments for tparms1 to make arg1 match
17444 arg2, then arg2 is not as specialized as arg1. */
17450 /* "If, for a given type, deduction succeeds in both directions
17451 (i.e., the types are identical after the transformations above)
17452 and if the type from the argument template is more cv-qualified
17453 than the type from the parameter template (as described above)
17454 that type is considered to be more specialized than the other. If
17455 neither type is more cv-qualified than the other then neither type
17456 is more specialized than the other." */
17458 if (deduce1
&& deduce2
17459 && quals1
!= quals2
&& quals1
>= 0 && quals2
>= 0)
17461 if ((quals1
& quals2
) == quals2
)
17463 if ((quals1
& quals2
) == quals1
)
17467 if (lose1
&& lose2
)
17468 /* We've failed to deduce something in either direction.
17469 These must be unordered. */
17472 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
17473 || TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
17474 /* We have already processed all of the arguments in our
17475 handing of the pack expansion type. */
17478 args1
= TREE_CHAIN (args1
);
17479 args2
= TREE_CHAIN (args2
);
17482 /* "In most cases, all template parameters must have values in order for
17483 deduction to succeed, but for partial ordering purposes a template
17484 parameter may remain without a value provided it is not used in the
17485 types being used for partial ordering."
17487 Thus, if we are missing any of the targs1 we need to substitute into
17488 origs1, then pat2 is not as specialized as pat1. This can happen when
17489 there is a nondeduced context. */
17490 if (!lose2
&& check_undeduced_parms (targs1
, origs1
, args1
))
17492 if (!lose1
&& check_undeduced_parms (targs2
, origs2
, args2
))
17495 processing_template_decl
--;
17497 /* All things being equal, if the next argument is a pack expansion
17498 for one function but not for the other, prefer the
17499 non-variadic function. FIXME this is bogus; see c++/41958. */
17501 && args1
&& TREE_VALUE (args1
)
17502 && args2
&& TREE_VALUE (args2
))
17504 lose1
= TREE_CODE (TREE_VALUE (args1
)) == TYPE_PACK_EXPANSION
;
17505 lose2
= TREE_CODE (TREE_VALUE (args2
)) == TYPE_PACK_EXPANSION
;
17508 if (lose1
== lose2
)
17516 /* Determine which of two partial specializations of MAIN_TMPL is more
17519 PAT1 is a TREE_LIST whose TREE_TYPE is the _TYPE node corresponding
17520 to the first partial specialization. The TREE_VALUE is the
17521 innermost set of template parameters for the partial
17522 specialization. PAT2 is similar, but for the second template.
17524 Return 1 if the first partial specialization is more specialized;
17525 -1 if the second is more specialized; 0 if neither is more
17528 See [temp.class.order] for information about determining which of
17529 two templates is more specialized. */
17532 more_specialized_class (tree main_tmpl
, tree pat1
, tree pat2
)
17537 bool any_deductions
= false;
17539 tmpl1
= TREE_TYPE (pat1
);
17540 tmpl2
= TREE_TYPE (pat2
);
17542 /* Just like what happens for functions, if we are ordering between
17543 different class template specializations, we may encounter dependent
17544 types in the arguments, and we need our dependency check functions
17545 to behave correctly. */
17546 ++processing_template_decl
;
17547 targs
= get_class_bindings (main_tmpl
, TREE_VALUE (pat1
),
17548 CLASSTYPE_TI_ARGS (tmpl1
),
17549 CLASSTYPE_TI_ARGS (tmpl2
));
17553 any_deductions
= true;
17556 targs
= get_class_bindings (main_tmpl
, TREE_VALUE (pat2
),
17557 CLASSTYPE_TI_ARGS (tmpl2
),
17558 CLASSTYPE_TI_ARGS (tmpl1
));
17562 any_deductions
= true;
17564 --processing_template_decl
;
17566 /* In the case of a tie where at least one of the class templates
17567 has a parameter pack at the end, the template with the most
17568 non-packed parameters wins. */
17571 && (template_args_variadic_p (TREE_PURPOSE (pat1
))
17572 || template_args_variadic_p (TREE_PURPOSE (pat2
))))
17574 tree args1
= INNERMOST_TEMPLATE_ARGS (TREE_PURPOSE (pat1
));
17575 tree args2
= INNERMOST_TEMPLATE_ARGS (TREE_PURPOSE (pat2
));
17576 int len1
= TREE_VEC_LENGTH (args1
);
17577 int len2
= TREE_VEC_LENGTH (args2
);
17579 /* We don't count the pack expansion at the end. */
17580 if (template_args_variadic_p (TREE_PURPOSE (pat1
)))
17582 if (template_args_variadic_p (TREE_PURPOSE (pat2
)))
17587 else if (len1
< len2
)
17594 /* Return the template arguments that will produce the function signature
17595 DECL from the function template FN, with the explicit template
17596 arguments EXPLICIT_ARGS. If CHECK_RETTYPE is true, the return type must
17597 also match. Return NULL_TREE if no satisfactory arguments could be
17601 get_bindings (tree fn
, tree decl
, tree explicit_args
, bool check_rettype
)
17603 int ntparms
= DECL_NTPARMS (fn
);
17604 tree targs
= make_tree_vec (ntparms
);
17605 tree decl_type
= TREE_TYPE (decl
);
17606 tree decl_arg_types
;
17608 unsigned int nargs
, ix
;
17611 gcc_assert (decl
!= DECL_TEMPLATE_RESULT (fn
));
17613 /* Never do unification on the 'this' parameter. */
17614 decl_arg_types
= skip_artificial_parms_for (decl
,
17615 TYPE_ARG_TYPES (decl_type
));
17617 nargs
= list_length (decl_arg_types
);
17618 args
= XALLOCAVEC (tree
, nargs
);
17619 for (arg
= decl_arg_types
, ix
= 0;
17620 arg
!= NULL_TREE
&& arg
!= void_list_node
;
17621 arg
= TREE_CHAIN (arg
), ++ix
)
17622 args
[ix
] = TREE_VALUE (arg
);
17624 if (fn_type_unification (fn
, explicit_args
, targs
,
17626 (check_rettype
|| DECL_CONV_FN_P (fn
)
17627 ? TREE_TYPE (decl_type
) : NULL_TREE
),
17628 DEDUCE_EXACT
, LOOKUP_NORMAL
, /*explain_p=*/false,
17630 == error_mark_node
)
17636 /* Return the innermost template arguments that, when applied to a partial
17637 specialization of MAIN_TMPL whose innermost template parameters are
17638 TPARMS, and whose specialization arguments are SPEC_ARGS, yield the
17641 For example, suppose we have:
17643 template <class T, class U> struct S {};
17644 template <class T> struct S<T*, int> {};
17646 Then, suppose we want to get `S<double*, int>'. The TPARMS will be
17647 {T}, the SPEC_ARGS will be {T*, int} and the ARGS will be {double*,
17648 int}. The resulting vector will be {double}, indicating that `T'
17649 is bound to `double'. */
17652 get_class_bindings (tree main_tmpl
, tree tparms
, tree spec_args
, tree args
)
17654 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
17656 tree innermost_deduced_args
;
17658 innermost_deduced_args
= make_tree_vec (ntparms
);
17659 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
17661 deduced_args
= copy_node (args
);
17662 SET_TMPL_ARGS_LEVEL (deduced_args
,
17663 TMPL_ARGS_DEPTH (deduced_args
),
17664 innermost_deduced_args
);
17667 deduced_args
= innermost_deduced_args
;
17669 if (unify (tparms
, deduced_args
,
17670 INNERMOST_TEMPLATE_ARGS (spec_args
),
17671 INNERMOST_TEMPLATE_ARGS (args
),
17672 UNIFY_ALLOW_NONE
, /*explain_p=*/false))
17675 for (i
= 0; i
< ntparms
; ++i
)
17676 if (! TREE_VEC_ELT (innermost_deduced_args
, i
))
17679 /* Verify that nondeduced template arguments agree with the type
17680 obtained from argument deduction.
17684 struct A { typedef int X; };
17685 template <class T, class U> struct C {};
17686 template <class T> struct C<T, typename T::X> {};
17688 Then with the instantiation `C<A, int>', we can deduce that
17689 `T' is `A' but unify () does not check whether `typename T::X'
17691 spec_args
= tsubst (spec_args
, deduced_args
, tf_none
, NULL_TREE
);
17692 spec_args
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (main_tmpl
),
17693 spec_args
, main_tmpl
,
17694 tf_none
, false, false);
17695 if (spec_args
== error_mark_node
17696 /* We only need to check the innermost arguments; the other
17697 arguments will always agree. */
17698 || !comp_template_args (INNERMOST_TEMPLATE_ARGS (spec_args
),
17699 INNERMOST_TEMPLATE_ARGS (args
)))
17702 /* Now that we have bindings for all of the template arguments,
17703 ensure that the arguments deduced for the template template
17704 parameters have compatible template parameter lists. See the use
17705 of template_template_parm_bindings_ok_p in fn_type_unification
17706 for more information. */
17707 if (!template_template_parm_bindings_ok_p (tparms
, deduced_args
))
17710 return deduced_args
;
17713 /* TEMPLATES is a TREE_LIST. Each TREE_VALUE is a TEMPLATE_DECL.
17714 Return the TREE_LIST node with the most specialized template, if
17715 any. If there is no most specialized template, the error_mark_node
17718 Note that this function does not look at, or modify, the
17719 TREE_PURPOSE or TREE_TYPE of any of the nodes. Since the node
17720 returned is one of the elements of INSTANTIATIONS, callers may
17721 store information in the TREE_PURPOSE or TREE_TYPE of the nodes,
17722 and retrieve it from the value returned. */
17725 most_specialized_instantiation (tree templates
)
17729 ++processing_template_decl
;
17732 for (fn
= TREE_CHAIN (templates
); fn
; fn
= TREE_CHAIN (fn
))
17736 if (get_bindings (TREE_VALUE (champ
),
17737 DECL_TEMPLATE_RESULT (TREE_VALUE (fn
)),
17738 NULL_TREE
, /*check_ret=*/true))
17741 if (get_bindings (TREE_VALUE (fn
),
17742 DECL_TEMPLATE_RESULT (TREE_VALUE (champ
)),
17743 NULL_TREE
, /*check_ret=*/true))
17750 /* Equally specialized, move to next function. If there
17751 is no next function, nothing's most specialized. */
17752 fn
= TREE_CHAIN (fn
);
17760 /* Now verify that champ is better than everything earlier in the
17761 instantiation list. */
17762 for (fn
= templates
; fn
!= champ
; fn
= TREE_CHAIN (fn
))
17763 if (get_bindings (TREE_VALUE (champ
),
17764 DECL_TEMPLATE_RESULT (TREE_VALUE (fn
)),
17765 NULL_TREE
, /*check_ret=*/true)
17766 || !get_bindings (TREE_VALUE (fn
),
17767 DECL_TEMPLATE_RESULT (TREE_VALUE (champ
)),
17768 NULL_TREE
, /*check_ret=*/true))
17774 processing_template_decl
--;
17777 return error_mark_node
;
17782 /* If DECL is a specialization of some template, return the most
17783 general such template. Otherwise, returns NULL_TREE.
17785 For example, given:
17787 template <class T> struct S { template <class U> void f(U); };
17789 if TMPL is `template <class U> void S<int>::f(U)' this will return
17790 the full template. This function will not trace past partial
17791 specializations, however. For example, given in addition:
17793 template <class T> struct S<T*> { template <class U> void f(U); };
17795 if TMPL is `template <class U> void S<int*>::f(U)' this will return
17796 `template <class T> template <class U> S<T*>::f(U)'. */
17799 most_general_template (tree decl
)
17801 /* If DECL is a FUNCTION_DECL, find the TEMPLATE_DECL of which it is
17802 an immediate specialization. */
17803 if (TREE_CODE (decl
) == FUNCTION_DECL
)
17805 if (DECL_TEMPLATE_INFO (decl
)) {
17806 decl
= DECL_TI_TEMPLATE (decl
);
17808 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE for a
17809 template friend. */
17810 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
17816 /* Look for more and more general templates. */
17817 while (DECL_TEMPLATE_INFO (decl
))
17819 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE in some cases.
17820 (See cp-tree.h for details.) */
17821 if (TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
17824 if (CLASS_TYPE_P (TREE_TYPE (decl
))
17825 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)))
17828 /* Stop if we run into an explicitly specialized class template. */
17829 if (!DECL_NAMESPACE_SCOPE_P (decl
)
17830 && DECL_CONTEXT (decl
)
17831 && CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (decl
)))
17834 decl
= DECL_TI_TEMPLATE (decl
);
17840 /* Return the most specialized of the class template partial
17841 specializations of TMPL which can produce TYPE, a specialization of
17842 TMPL. The value returned is actually a TREE_LIST; the TREE_TYPE is
17843 a _TYPE node corresponding to the partial specialization, while the
17844 TREE_PURPOSE is the set of template arguments that must be
17845 substituted into the TREE_TYPE in order to generate TYPE.
17847 If the choice of partial specialization is ambiguous, a diagnostic
17848 is issued, and the error_mark_node is returned. If there are no
17849 partial specializations of TMPL matching TYPE, then NULL_TREE is
17853 most_specialized_class (tree type
, tree tmpl
, tsubst_flags_t complain
)
17855 tree list
= NULL_TREE
;
17861 tree outer_args
= NULL_TREE
;
17863 tmpl
= most_general_template (tmpl
);
17864 args
= CLASSTYPE_TI_ARGS (type
);
17866 /* For determining which partial specialization to use, only the
17867 innermost args are interesting. */
17868 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
17870 outer_args
= strip_innermost_template_args (args
, 1);
17871 args
= INNERMOST_TEMPLATE_ARGS (args
);
17874 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
); t
; t
= TREE_CHAIN (t
))
17876 tree partial_spec_args
;
17878 tree parms
= TREE_VALUE (t
);
17880 partial_spec_args
= CLASSTYPE_TI_ARGS (TREE_TYPE (t
));
17882 ++processing_template_decl
;
17888 /* Discard the outer levels of args, and then substitute in the
17889 template args from the enclosing class. */
17890 partial_spec_args
= INNERMOST_TEMPLATE_ARGS (partial_spec_args
);
17891 partial_spec_args
= tsubst_template_args
17892 (partial_spec_args
, outer_args
, tf_none
, NULL_TREE
);
17894 /* PARMS already refers to just the innermost parms, but the
17895 template parms in partial_spec_args had their levels lowered
17896 by tsubst, so we need to do the same for the parm list. We
17897 can't just tsubst the TREE_VEC itself, as tsubst wants to
17898 treat a TREE_VEC as an argument vector. */
17899 parms
= copy_node (parms
);
17900 for (i
= TREE_VEC_LENGTH (parms
) - 1; i
>= 0; --i
)
17901 TREE_VEC_ELT (parms
, i
) =
17902 tsubst (TREE_VEC_ELT (parms
, i
), outer_args
, tf_none
, NULL_TREE
);
17906 partial_spec_args
=
17907 coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
17908 add_to_template_args (outer_args
,
17909 partial_spec_args
),
17911 /*require_all_args=*/true,
17912 /*use_default_args=*/true);
17914 --processing_template_decl
;
17916 if (partial_spec_args
== error_mark_node
)
17917 return error_mark_node
;
17919 spec_args
= get_class_bindings (tmpl
, parms
,
17925 spec_args
= add_to_template_args (outer_args
, spec_args
);
17926 list
= tree_cons (spec_args
, TREE_VALUE (t
), list
);
17927 TREE_TYPE (list
) = TREE_TYPE (t
);
17934 ambiguous_p
= false;
17937 t
= TREE_CHAIN (t
);
17938 for (; t
; t
= TREE_CHAIN (t
))
17940 fate
= more_specialized_class (tmpl
, champ
, t
);
17947 t
= TREE_CHAIN (t
);
17950 ambiguous_p
= true;
17959 for (t
= list
; t
&& t
!= champ
; t
= TREE_CHAIN (t
))
17961 fate
= more_specialized_class (tmpl
, champ
, t
);
17964 ambiguous_p
= true;
17972 char *spaces
= NULL
;
17973 if (!(complain
& tf_error
))
17974 return error_mark_node
;
17975 error ("ambiguous class template instantiation for %q#T", type
);
17976 str
= ngettext ("candidate is:", "candidates are:", list_length (list
));
17977 for (t
= list
; t
; t
= TREE_CHAIN (t
))
17979 error ("%s %+#T", spaces
? spaces
: str
, TREE_TYPE (t
));
17980 spaces
= spaces
? spaces
: get_spaces (str
);
17983 return error_mark_node
;
17989 /* Explicitly instantiate DECL. */
17992 do_decl_instantiation (tree decl
, tree storage
)
17994 tree result
= NULL_TREE
;
17997 if (!decl
|| decl
== error_mark_node
)
17998 /* An error occurred, for which grokdeclarator has already issued
17999 an appropriate message. */
18001 else if (! DECL_LANG_SPECIFIC (decl
))
18003 error ("explicit instantiation of non-template %q#D", decl
);
18006 else if (VAR_P (decl
))
18008 /* There is an asymmetry here in the way VAR_DECLs and
18009 FUNCTION_DECLs are handled by grokdeclarator. In the case of
18010 the latter, the DECL we get back will be marked as a
18011 template instantiation, and the appropriate
18012 DECL_TEMPLATE_INFO will be set up. This does not happen for
18013 VAR_DECLs so we do the lookup here. Probably, grokdeclarator
18014 should handle VAR_DECLs as it currently handles
18016 if (!DECL_CLASS_SCOPE_P (decl
))
18018 error ("%qD is not a static data member of a class template", decl
);
18021 result
= lookup_field (DECL_CONTEXT (decl
), DECL_NAME (decl
), 0, false);
18022 if (!result
|| !VAR_P (result
))
18024 error ("no matching template for %qD found", decl
);
18027 if (!same_type_p (TREE_TYPE (result
), TREE_TYPE (decl
)))
18029 error ("type %qT for explicit instantiation %qD does not match "
18030 "declared type %qT", TREE_TYPE (result
), decl
,
18035 else if (TREE_CODE (decl
) != FUNCTION_DECL
)
18037 error ("explicit instantiation of %q#D", decl
);
18043 /* Check for various error cases. Note that if the explicit
18044 instantiation is valid the RESULT will currently be marked as an
18045 *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set
18046 until we get here. */
18048 if (DECL_TEMPLATE_SPECIALIZATION (result
))
18050 /* DR 259 [temp.spec].
18052 Both an explicit instantiation and a declaration of an explicit
18053 specialization shall not appear in a program unless the explicit
18054 instantiation follows a declaration of the explicit specialization.
18056 For a given set of template parameters, if an explicit
18057 instantiation of a template appears after a declaration of an
18058 explicit specialization for that template, the explicit
18059 instantiation has no effect. */
18062 else if (DECL_EXPLICIT_INSTANTIATION (result
))
18066 No program shall explicitly instantiate any template more
18069 We check DECL_NOT_REALLY_EXTERN so as not to complain when
18070 the first instantiation was `extern' and the second is not,
18071 and EXTERN_P for the opposite case. */
18072 if (DECL_NOT_REALLY_EXTERN (result
) && !extern_p
)
18073 permerror (input_location
, "duplicate explicit instantiation of %q#D", result
);
18074 /* If an "extern" explicit instantiation follows an ordinary
18075 explicit instantiation, the template is instantiated. */
18079 else if (!DECL_IMPLICIT_INSTANTIATION (result
))
18081 error ("no matching template for %qD found", result
);
18084 else if (!DECL_TEMPLATE_INFO (result
))
18086 permerror (input_location
, "explicit instantiation of non-template %q#D", result
);
18090 if (storage
== NULL_TREE
)
18092 else if (storage
== ridpointers
[(int) RID_EXTERN
])
18094 if (!in_system_header
&& (cxx_dialect
== cxx98
))
18095 pedwarn (input_location
, OPT_Wpedantic
,
18096 "ISO C++ 1998 forbids the use of %<extern%> on explicit "
18101 error ("storage class %qD applied to template instantiation", storage
);
18103 check_explicit_instantiation_namespace (result
);
18104 mark_decl_instantiated (result
, extern_p
);
18106 instantiate_decl (result
, /*defer_ok=*/1,
18107 /*expl_inst_class_mem_p=*/false);
18111 mark_class_instantiated (tree t
, int extern_p
)
18113 SET_CLASSTYPE_EXPLICIT_INSTANTIATION (t
);
18114 SET_CLASSTYPE_INTERFACE_KNOWN (t
);
18115 CLASSTYPE_INTERFACE_ONLY (t
) = extern_p
;
18116 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (t
)) = extern_p
;
18119 CLASSTYPE_DEBUG_REQUESTED (t
) = 1;
18120 rest_of_type_compilation (t
, 1);
18124 /* Called from do_type_instantiation through binding_table_foreach to
18125 do recursive instantiation for the type bound in ENTRY. */
18127 bt_instantiate_type_proc (binding_entry entry
, void *data
)
18129 tree storage
= *(tree
*) data
;
18131 if (MAYBE_CLASS_TYPE_P (entry
->type
)
18132 && !uses_template_parms (CLASSTYPE_TI_ARGS (entry
->type
)))
18133 do_type_instantiation (TYPE_MAIN_DECL (entry
->type
), storage
, 0);
18136 /* Called from do_type_instantiation to instantiate a member
18137 (a member function or a static member variable) of an
18138 explicitly instantiated class template. */
18140 instantiate_class_member (tree decl
, int extern_p
)
18142 mark_decl_instantiated (decl
, extern_p
);
18144 instantiate_decl (decl
, /*defer_ok=*/1,
18145 /*expl_inst_class_mem_p=*/true);
18148 /* Perform an explicit instantiation of template class T. STORAGE, if
18149 non-null, is the RID for extern, inline or static. COMPLAIN is
18150 nonzero if this is called from the parser, zero if called recursively,
18151 since the standard is unclear (as detailed below). */
18154 do_type_instantiation (tree t
, tree storage
, tsubst_flags_t complain
)
18159 int previous_instantiation_extern_p
= 0;
18161 if (TREE_CODE (t
) == TYPE_DECL
)
18164 if (! CLASS_TYPE_P (t
) || ! CLASSTYPE_TEMPLATE_INFO (t
))
18167 (TYPE_TEMPLATE_INFO (t
)) ? TYPE_TI_TEMPLATE (t
) : NULL
;
18169 error ("explicit instantiation of non-class template %qD", tmpl
);
18171 error ("explicit instantiation of non-template type %qT", t
);
18177 if (!COMPLETE_TYPE_P (t
))
18179 if (complain
& tf_error
)
18180 error ("explicit instantiation of %q#T before definition of template",
18185 if (storage
!= NULL_TREE
)
18187 if (!in_system_header
)
18189 if (storage
== ridpointers
[(int) RID_EXTERN
])
18191 if (cxx_dialect
== cxx98
)
18192 pedwarn (input_location
, OPT_Wpedantic
,
18193 "ISO C++ 1998 forbids the use of %<extern%> on "
18194 "explicit instantiations");
18197 pedwarn (input_location
, OPT_Wpedantic
,
18198 "ISO C++ forbids the use of %qE"
18199 " on explicit instantiations", storage
);
18202 if (storage
== ridpointers
[(int) RID_INLINE
])
18204 else if (storage
== ridpointers
[(int) RID_EXTERN
])
18206 else if (storage
== ridpointers
[(int) RID_STATIC
])
18210 error ("storage class %qD applied to template instantiation",
18216 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
18218 /* DR 259 [temp.spec].
18220 Both an explicit instantiation and a declaration of an explicit
18221 specialization shall not appear in a program unless the explicit
18222 instantiation follows a declaration of the explicit specialization.
18224 For a given set of template parameters, if an explicit
18225 instantiation of a template appears after a declaration of an
18226 explicit specialization for that template, the explicit
18227 instantiation has no effect. */
18230 else if (CLASSTYPE_EXPLICIT_INSTANTIATION (t
))
18234 No program shall explicitly instantiate any template more
18237 If PREVIOUS_INSTANTIATION_EXTERN_P, then the first explicit
18238 instantiation was `extern'. If EXTERN_P then the second is.
18239 These cases are OK. */
18240 previous_instantiation_extern_p
= CLASSTYPE_INTERFACE_ONLY (t
);
18242 if (!previous_instantiation_extern_p
&& !extern_p
18243 && (complain
& tf_error
))
18244 permerror (input_location
, "duplicate explicit instantiation of %q#T", t
);
18246 /* If we've already instantiated the template, just return now. */
18247 if (!CLASSTYPE_INTERFACE_ONLY (t
))
18251 check_explicit_instantiation_namespace (TYPE_NAME (t
));
18252 mark_class_instantiated (t
, extern_p
);
18260 /* In contrast to implicit instantiation, where only the
18261 declarations, and not the definitions, of members are
18262 instantiated, we have here:
18266 The explicit instantiation of a class template specialization
18267 implies the instantiation of all of its members not
18268 previously explicitly specialized in the translation unit
18269 containing the explicit instantiation.
18271 Of course, we can't instantiate member template classes, since
18272 we don't have any arguments for them. Note that the standard
18273 is unclear on whether the instantiation of the members are
18274 *explicit* instantiations or not. However, the most natural
18275 interpretation is that it should be an explicit instantiation. */
18278 for (tmp
= TYPE_METHODS (t
); tmp
; tmp
= DECL_CHAIN (tmp
))
18279 if (TREE_CODE (tmp
) == FUNCTION_DECL
18280 && DECL_TEMPLATE_INSTANTIATION (tmp
))
18281 instantiate_class_member (tmp
, extern_p
);
18283 for (tmp
= TYPE_FIELDS (t
); tmp
; tmp
= DECL_CHAIN (tmp
))
18284 if (VAR_P (tmp
) && DECL_TEMPLATE_INSTANTIATION (tmp
))
18285 instantiate_class_member (tmp
, extern_p
);
18287 if (CLASSTYPE_NESTED_UTDS (t
))
18288 binding_table_foreach (CLASSTYPE_NESTED_UTDS (t
),
18289 bt_instantiate_type_proc
, &storage
);
18293 /* Given a function DECL, which is a specialization of TMPL, modify
18294 DECL to be a re-instantiation of TMPL with the same template
18295 arguments. TMPL should be the template into which tsubst'ing
18296 should occur for DECL, not the most general template.
18298 One reason for doing this is a scenario like this:
18301 void f(const T&, int i);
18303 void g() { f(3, 7); }
18306 void f(const T& t, const int i) { }
18308 Note that when the template is first instantiated, with
18309 instantiate_template, the resulting DECL will have no name for the
18310 first parameter, and the wrong type for the second. So, when we go
18311 to instantiate the DECL, we regenerate it. */
18314 regenerate_decl_from_template (tree decl
, tree tmpl
)
18316 /* The arguments used to instantiate DECL, from the most general
18321 args
= DECL_TI_ARGS (decl
);
18322 code_pattern
= DECL_TEMPLATE_RESULT (tmpl
);
18324 /* Make sure that we can see identifiers, and compute access
18326 push_access_scope (decl
);
18328 if (TREE_CODE (decl
) == FUNCTION_DECL
)
18336 args_depth
= TMPL_ARGS_DEPTH (args
);
18337 parms_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
18338 if (args_depth
> parms_depth
)
18339 args
= get_innermost_template_args (args
, parms_depth
);
18341 specs
= tsubst_exception_specification (TREE_TYPE (code_pattern
),
18342 args
, tf_error
, NULL_TREE
,
18343 /*defer_ok*/false);
18344 if (specs
&& specs
!= error_mark_node
)
18345 TREE_TYPE (decl
) = build_exception_variant (TREE_TYPE (decl
),
18348 /* Merge parameter declarations. */
18349 decl_parm
= skip_artificial_parms_for (decl
,
18350 DECL_ARGUMENTS (decl
));
18352 = skip_artificial_parms_for (code_pattern
,
18353 DECL_ARGUMENTS (code_pattern
));
18354 while (decl_parm
&& !FUNCTION_PARAMETER_PACK_P (pattern_parm
))
18359 if (DECL_NAME (decl_parm
) != DECL_NAME (pattern_parm
))
18360 DECL_NAME (decl_parm
) = DECL_NAME (pattern_parm
);
18361 parm_type
= tsubst (TREE_TYPE (pattern_parm
), args
, tf_error
,
18363 parm_type
= type_decays_to (parm_type
);
18364 if (!same_type_p (TREE_TYPE (decl_parm
), parm_type
))
18365 TREE_TYPE (decl_parm
) = parm_type
;
18366 attributes
= DECL_ATTRIBUTES (pattern_parm
);
18367 if (DECL_ATTRIBUTES (decl_parm
) != attributes
)
18369 DECL_ATTRIBUTES (decl_parm
) = attributes
;
18370 cplus_decl_attributes (&decl_parm
, attributes
, /*flags=*/0);
18372 decl_parm
= DECL_CHAIN (decl_parm
);
18373 pattern_parm
= DECL_CHAIN (pattern_parm
);
18375 /* Merge any parameters that match with the function parameter
18377 if (pattern_parm
&& FUNCTION_PARAMETER_PACK_P (pattern_parm
))
18380 tree expanded_types
;
18381 /* Expand the TYPE_PACK_EXPANSION that provides the types for
18382 the parameters in this function parameter pack. */
18383 expanded_types
= tsubst_pack_expansion (TREE_TYPE (pattern_parm
),
18384 args
, tf_error
, NULL_TREE
);
18385 len
= TREE_VEC_LENGTH (expanded_types
);
18386 for (i
= 0; i
< len
; i
++)
18391 if (DECL_NAME (decl_parm
) != DECL_NAME (pattern_parm
))
18392 /* Rename the parameter to include the index. */
18393 DECL_NAME (decl_parm
) =
18394 make_ith_pack_parameter_name (DECL_NAME (pattern_parm
), i
);
18395 parm_type
= TREE_VEC_ELT (expanded_types
, i
);
18396 parm_type
= type_decays_to (parm_type
);
18397 if (!same_type_p (TREE_TYPE (decl_parm
), parm_type
))
18398 TREE_TYPE (decl_parm
) = parm_type
;
18399 attributes
= DECL_ATTRIBUTES (pattern_parm
);
18400 if (DECL_ATTRIBUTES (decl_parm
) != attributes
)
18402 DECL_ATTRIBUTES (decl_parm
) = attributes
;
18403 cplus_decl_attributes (&decl_parm
, attributes
, /*flags=*/0);
18405 decl_parm
= DECL_CHAIN (decl_parm
);
18408 /* Merge additional specifiers from the CODE_PATTERN. */
18409 if (DECL_DECLARED_INLINE_P (code_pattern
)
18410 && !DECL_DECLARED_INLINE_P (decl
))
18411 DECL_DECLARED_INLINE_P (decl
) = 1;
18413 else if (VAR_P (decl
))
18415 DECL_INITIAL (decl
) =
18416 tsubst_expr (DECL_INITIAL (code_pattern
), args
,
18417 tf_error
, DECL_TI_TEMPLATE (decl
),
18418 /*integral_constant_expression_p=*/false);
18419 if (VAR_HAD_UNKNOWN_BOUND (decl
))
18420 TREE_TYPE (decl
) = tsubst (TREE_TYPE (code_pattern
), args
,
18421 tf_error
, DECL_TI_TEMPLATE (decl
));
18424 gcc_unreachable ();
18426 pop_access_scope (decl
);
18429 /* Return the TEMPLATE_DECL into which DECL_TI_ARGS(DECL) should be
18430 substituted to get DECL. */
18433 template_for_substitution (tree decl
)
18435 tree tmpl
= DECL_TI_TEMPLATE (decl
);
18437 /* Set TMPL to the template whose DECL_TEMPLATE_RESULT is the pattern
18438 for the instantiation. This is not always the most general
18439 template. Consider, for example:
18442 struct S { template <class U> void f();
18443 template <> void f<int>(); };
18445 and an instantiation of S<double>::f<int>. We want TD to be the
18446 specialization S<T>::f<int>, not the more general S<T>::f<U>. */
18447 while (/* An instantiation cannot have a definition, so we need a
18448 more general template. */
18449 DECL_TEMPLATE_INSTANTIATION (tmpl
)
18450 /* We must also deal with friend templates. Given:
18452 template <class T> struct S {
18453 template <class U> friend void f() {};
18456 S<int>::f<U> say, is not an instantiation of S<T>::f<U>,
18457 so far as the language is concerned, but that's still
18458 where we get the pattern for the instantiation from. On
18459 other hand, if the definition comes outside the class, say:
18461 template <class T> struct S {
18462 template <class U> friend void f();
18464 template <class U> friend void f() {}
18466 we don't need to look any further. That's what the check for
18467 DECL_INITIAL is for. */
18468 || (TREE_CODE (decl
) == FUNCTION_DECL
18469 && DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (tmpl
)
18470 && !DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl
))))
18472 /* The present template, TD, should not be a definition. If it
18473 were a definition, we should be using it! Note that we
18474 cannot restructure the loop to just keep going until we find
18475 a template with a definition, since that might go too far if
18476 a specialization was declared, but not defined. */
18477 gcc_assert (!VAR_P (decl
)
18478 || DECL_IN_AGGR_P (DECL_TEMPLATE_RESULT (tmpl
)));
18480 /* Fetch the more general template. */
18481 tmpl
= DECL_TI_TEMPLATE (tmpl
);
18487 /* Returns true if we need to instantiate this template instance even if we
18488 know we aren't going to emit it.. */
18491 always_instantiate_p (tree decl
)
18493 /* We always instantiate inline functions so that we can inline them. An
18494 explicit instantiation declaration prohibits implicit instantiation of
18495 non-inline functions. With high levels of optimization, we would
18496 normally inline non-inline functions -- but we're not allowed to do
18497 that for "extern template" functions. Therefore, we check
18498 DECL_DECLARED_INLINE_P, rather than possibly_inlined_p. */
18499 return ((TREE_CODE (decl
) == FUNCTION_DECL
18500 && (DECL_DECLARED_INLINE_P (decl
)
18501 || type_uses_auto (TREE_TYPE (TREE_TYPE (decl
)))))
18502 /* And we need to instantiate static data members so that
18503 their initializers are available in integral constant
18506 && decl_maybe_constant_var_p (decl
)));
18509 /* If FN has a noexcept-specifier that hasn't been instantiated yet,
18510 instantiate it now, modifying TREE_TYPE (fn). */
18513 maybe_instantiate_noexcept (tree fn
)
18515 tree fntype
, spec
, noex
, clone
;
18517 if (DECL_CLONED_FUNCTION_P (fn
))
18518 fn
= DECL_CLONED_FUNCTION (fn
);
18519 fntype
= TREE_TYPE (fn
);
18520 spec
= TYPE_RAISES_EXCEPTIONS (fntype
);
18522 if (!DEFERRED_NOEXCEPT_SPEC_P (spec
))
18525 noex
= TREE_PURPOSE (spec
);
18527 if (TREE_CODE (noex
) == DEFERRED_NOEXCEPT
)
18529 if (push_tinst_level (fn
))
18531 push_access_scope (fn
);
18532 push_deferring_access_checks (dk_no_deferred
);
18533 input_location
= DECL_SOURCE_LOCATION (fn
);
18534 noex
= tsubst_copy_and_build (DEFERRED_NOEXCEPT_PATTERN (noex
),
18535 DEFERRED_NOEXCEPT_ARGS (noex
),
18536 tf_warning_or_error
, fn
,
18537 /*function_p=*/false,
18538 /*integral_constant_expression_p=*/true);
18539 pop_deferring_access_checks ();
18540 pop_access_scope (fn
);
18541 pop_tinst_level ();
18542 spec
= build_noexcept_spec (noex
, tf_warning_or_error
);
18543 if (spec
== error_mark_node
)
18544 spec
= noexcept_false_spec
;
18547 spec
= noexcept_false_spec
;
18551 /* This is an implicitly declared function, so NOEX is a list of
18552 other functions to evaluate and merge. */
18554 spec
= noexcept_true_spec
;
18555 for (elt
= noex
; elt
; elt
= OVL_NEXT (elt
))
18557 tree fn
= OVL_CURRENT (elt
);
18559 maybe_instantiate_noexcept (fn
);
18560 subspec
= TYPE_RAISES_EXCEPTIONS (TREE_TYPE (fn
));
18561 spec
= merge_exception_specifiers (spec
, subspec
, NULL_TREE
);
18565 TREE_TYPE (fn
) = build_exception_variant (fntype
, spec
);
18567 FOR_EACH_CLONE (clone
, fn
)
18569 if (TREE_TYPE (clone
) == fntype
)
18570 TREE_TYPE (clone
) = TREE_TYPE (fn
);
18572 TREE_TYPE (clone
) = build_exception_variant (TREE_TYPE (clone
), spec
);
18576 /* Produce the definition of D, a _DECL generated from a template. If
18577 DEFER_OK is nonzero, then we don't have to actually do the
18578 instantiation now; we just have to do it sometime. Normally it is
18579 an error if this is an explicit instantiation but D is undefined.
18580 EXPL_INST_CLASS_MEM_P is true iff D is a member of an
18581 explicitly instantiated class template. */
18584 instantiate_decl (tree d
, int defer_ok
,
18585 bool expl_inst_class_mem_p
)
18587 tree tmpl
= DECL_TI_TEMPLATE (d
);
18594 bool pattern_defined
;
18595 location_t saved_loc
= input_location
;
18600 /* This function should only be used to instantiate templates for
18601 functions and static member variables. */
18602 gcc_assert (VAR_OR_FUNCTION_DECL_P (d
));
18604 /* Variables are never deferred; if instantiation is required, they
18605 are instantiated right away. That allows for better code in the
18606 case that an expression refers to the value of the variable --
18607 if the variable has a constant value the referring expression can
18608 take advantage of that fact. */
18610 || DECL_DECLARED_CONSTEXPR_P (d
))
18613 /* Don't instantiate cloned functions. Instead, instantiate the
18614 functions they cloned. */
18615 if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_CLONED_FUNCTION_P (d
))
18616 d
= DECL_CLONED_FUNCTION (d
);
18618 if (DECL_TEMPLATE_INSTANTIATED (d
)
18619 || (TREE_CODE (d
) == FUNCTION_DECL
18620 && DECL_DEFAULTED_FN (d
) && DECL_INITIAL (d
))
18621 || DECL_TEMPLATE_SPECIALIZATION (d
))
18622 /* D has already been instantiated or explicitly specialized, so
18623 there's nothing for us to do here.
18625 It might seem reasonable to check whether or not D is an explicit
18626 instantiation, and, if so, stop here. But when an explicit
18627 instantiation is deferred until the end of the compilation,
18628 DECL_EXPLICIT_INSTANTIATION is set, even though we still need to do
18629 the instantiation. */
18632 /* Check to see whether we know that this template will be
18633 instantiated in some other file, as with "extern template"
18635 external_p
= (DECL_INTERFACE_KNOWN (d
) && DECL_REALLY_EXTERN (d
));
18637 /* In general, we do not instantiate such templates. */
18638 if (external_p
&& !always_instantiate_p (d
))
18641 gen_tmpl
= most_general_template (tmpl
);
18642 gen_args
= DECL_TI_ARGS (d
);
18644 if (tmpl
!= gen_tmpl
)
18645 /* We should already have the extra args. */
18646 gcc_assert (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (gen_tmpl
))
18647 == TMPL_ARGS_DEPTH (gen_args
));
18648 /* And what's in the hash table should match D. */
18649 gcc_assert ((spec
= retrieve_specialization (gen_tmpl
, gen_args
, 0)) == d
18650 || spec
== NULL_TREE
);
18652 /* This needs to happen before any tsubsting. */
18653 if (! push_tinst_level (d
))
18656 timevar_push (TV_TEMPLATE_INST
);
18658 /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern
18659 for the instantiation. */
18660 td
= template_for_substitution (d
);
18661 code_pattern
= DECL_TEMPLATE_RESULT (td
);
18663 /* We should never be trying to instantiate a member of a class
18664 template or partial specialization. */
18665 gcc_assert (d
!= code_pattern
);
18667 if ((DECL_NAMESPACE_SCOPE_P (d
) && !DECL_INITIALIZED_IN_CLASS_P (d
))
18668 || DECL_TEMPLATE_SPECIALIZATION (td
))
18669 /* In the case of a friend template whose definition is provided
18670 outside the class, we may have too many arguments. Drop the
18671 ones we don't need. The same is true for specializations. */
18672 args
= get_innermost_template_args
18673 (gen_args
, TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (td
)));
18677 if (TREE_CODE (d
) == FUNCTION_DECL
)
18678 pattern_defined
= (DECL_SAVED_TREE (code_pattern
) != NULL_TREE
18679 || DECL_DEFAULTED_OUTSIDE_CLASS_P (code_pattern
));
18681 pattern_defined
= ! DECL_IN_AGGR_P (code_pattern
);
18683 /* We may be in the middle of deferred access check. Disable it now. */
18684 push_deferring_access_checks (dk_no_deferred
);
18686 /* Unless an explicit instantiation directive has already determined
18687 the linkage of D, remember that a definition is available for
18689 if (pattern_defined
18690 && !DECL_INTERFACE_KNOWN (d
)
18691 && !DECL_NOT_REALLY_EXTERN (d
))
18692 mark_definable (d
);
18694 DECL_SOURCE_LOCATION (td
) = DECL_SOURCE_LOCATION (code_pattern
);
18695 DECL_SOURCE_LOCATION (d
) = DECL_SOURCE_LOCATION (code_pattern
);
18696 input_location
= DECL_SOURCE_LOCATION (d
);
18698 /* If D is a member of an explicitly instantiated class template,
18699 and no definition is available, treat it like an implicit
18701 if (!pattern_defined
&& expl_inst_class_mem_p
18702 && DECL_EXPLICIT_INSTANTIATION (d
))
18704 /* Leave linkage flags alone on instantiations with anonymous
18706 if (TREE_PUBLIC (d
))
18708 DECL_NOT_REALLY_EXTERN (d
) = 0;
18709 DECL_INTERFACE_KNOWN (d
) = 0;
18711 SET_DECL_IMPLICIT_INSTANTIATION (d
);
18714 if (TREE_CODE (d
) == FUNCTION_DECL
)
18715 maybe_instantiate_noexcept (d
);
18717 /* Defer all other templates, unless we have been explicitly
18718 forbidden from doing so. */
18719 if (/* If there is no definition, we cannot instantiate the
18722 /* If it's OK to postpone instantiation, do so. */
18724 /* If this is a static data member that will be defined
18725 elsewhere, we don't want to instantiate the entire data
18726 member, but we do want to instantiate the initializer so that
18727 we can substitute that elsewhere. */
18728 || (external_p
&& VAR_P (d
)))
18730 /* The definition of the static data member is now required so
18731 we must substitute the initializer. */
18733 && !DECL_INITIAL (d
)
18734 && DECL_INITIAL (code_pattern
))
18738 bool const_init
= false;
18740 ns
= decl_namespace_context (d
);
18741 push_nested_namespace (ns
);
18742 push_nested_class (DECL_CONTEXT (d
));
18743 init
= tsubst_expr (DECL_INITIAL (code_pattern
),
18745 tf_warning_or_error
, NULL_TREE
,
18746 /*integral_constant_expression_p=*/false);
18747 /* Make sure the initializer is still constant, in case of
18748 circular dependency (template/instantiate6.C). */
18750 = DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (code_pattern
);
18751 cp_finish_decl (d
, init
, /*init_const_expr_p=*/const_init
,
18752 /*asmspec_tree=*/NULL_TREE
,
18753 LOOKUP_ONLYCONVERTING
);
18754 pop_nested_class ();
18755 pop_nested_namespace (ns
);
18758 /* We restore the source position here because it's used by
18759 add_pending_template. */
18760 input_location
= saved_loc
;
18762 if (at_eof
&& !pattern_defined
18763 && DECL_EXPLICIT_INSTANTIATION (d
)
18764 && DECL_NOT_REALLY_EXTERN (d
))
18767 The definition of a non-exported function template, a
18768 non-exported member function template, or a non-exported
18769 member function or static data member of a class template
18770 shall be present in every translation unit in which it is
18771 explicitly instantiated. */
18772 permerror (input_location
, "explicit instantiation of %qD "
18773 "but no definition available", d
);
18775 /* If we're in unevaluated context, we just wanted to get the
18776 constant value; this isn't an odr use, so don't queue
18777 a full instantiation. */
18778 if (cp_unevaluated_operand
!= 0)
18780 /* ??? Historically, we have instantiated inline functions, even
18781 when marked as "extern template". */
18782 if (!(external_p
&& VAR_P (d
)))
18783 add_pending_template (d
);
18786 /* Tell the repository that D is available in this translation unit
18787 -- and see if it is supposed to be instantiated here. */
18788 if (TREE_PUBLIC (d
) && !DECL_REALLY_EXTERN (d
) && !repo_emit_p (d
))
18790 /* In a PCH file, despite the fact that the repository hasn't
18791 requested instantiation in the PCH it is still possible that
18792 an instantiation will be required in a file that includes the
18795 add_pending_template (d
);
18796 /* Instantiate inline functions so that the inliner can do its
18797 job, even though we'll not be emitting a copy of this
18799 if (!(TREE_CODE (d
) == FUNCTION_DECL
&& possibly_inlined_p (d
)))
18803 fn_context
= decl_function_context (d
);
18804 nested
= (current_function_decl
!= NULL_TREE
);
18806 push_to_top_level ();
18808 push_function_context ();
18810 /* Mark D as instantiated so that recursive calls to
18811 instantiate_decl do not try to instantiate it again. */
18812 DECL_TEMPLATE_INSTANTIATED (d
) = 1;
18814 /* Regenerate the declaration in case the template has been modified
18815 by a subsequent redeclaration. */
18816 regenerate_decl_from_template (d
, td
);
18818 /* We already set the file and line above. Reset them now in case
18819 they changed as a result of calling regenerate_decl_from_template. */
18820 input_location
= DECL_SOURCE_LOCATION (d
);
18825 bool const_init
= false;
18827 /* Clear out DECL_RTL; whatever was there before may not be right
18828 since we've reset the type of the declaration. */
18829 SET_DECL_RTL (d
, NULL
);
18830 DECL_IN_AGGR_P (d
) = 0;
18832 /* The initializer is placed in DECL_INITIAL by
18833 regenerate_decl_from_template so we don't need to
18834 push/pop_access_scope again here. Pull it out so that
18835 cp_finish_decl can process it. */
18836 init
= DECL_INITIAL (d
);
18837 DECL_INITIAL (d
) = NULL_TREE
;
18838 DECL_INITIALIZED_P (d
) = 0;
18840 /* Clear DECL_EXTERNAL so that cp_finish_decl will process the
18841 initializer. That function will defer actual emission until
18842 we have a chance to determine linkage. */
18843 DECL_EXTERNAL (d
) = 0;
18845 /* Enter the scope of D so that access-checking works correctly. */
18846 push_nested_class (DECL_CONTEXT (d
));
18847 const_init
= DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (code_pattern
);
18848 cp_finish_decl (d
, init
, const_init
, NULL_TREE
, 0);
18849 pop_nested_class ();
18851 else if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_DEFAULTED_FN (code_pattern
))
18852 synthesize_method (d
);
18853 else if (TREE_CODE (d
) == FUNCTION_DECL
)
18855 struct pointer_map_t
*saved_local_specializations
;
18860 /* Save away the current list, in case we are instantiating one
18861 template from within the body of another. */
18862 saved_local_specializations
= local_specializations
;
18864 /* Set up the list of local specializations. */
18865 local_specializations
= pointer_map_create ();
18867 /* Set up context. */
18868 start_preparsed_function (d
, NULL_TREE
, SF_PRE_PARSED
);
18870 /* Some typedefs referenced from within the template code need to be
18871 access checked at template instantiation time, i.e now. These
18872 types were added to the template at parsing time. Let's get those
18873 and perform the access checks then. */
18874 perform_typedefs_access_check (DECL_TEMPLATE_RESULT (gen_tmpl
),
18877 /* Create substitution entries for the parameters. */
18878 subst_decl
= DECL_TEMPLATE_RESULT (template_for_substitution (d
));
18879 tmpl_parm
= DECL_ARGUMENTS (subst_decl
);
18880 spec_parm
= DECL_ARGUMENTS (d
);
18881 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (d
))
18883 register_local_specialization (spec_parm
, tmpl_parm
);
18884 spec_parm
= skip_artificial_parms_for (d
, spec_parm
);
18885 tmpl_parm
= skip_artificial_parms_for (subst_decl
, tmpl_parm
);
18887 for (; tmpl_parm
; tmpl_parm
= DECL_CHAIN (tmpl_parm
))
18889 if (!FUNCTION_PARAMETER_PACK_P (tmpl_parm
))
18891 register_local_specialization (spec_parm
, tmpl_parm
);
18892 spec_parm
= DECL_CHAIN (spec_parm
);
18896 /* Register the (value) argument pack as a specialization of
18897 TMPL_PARM, then move on. */
18898 tree argpack
= extract_fnparm_pack (tmpl_parm
, &spec_parm
);
18899 register_local_specialization (argpack
, tmpl_parm
);
18902 gcc_assert (!spec_parm
);
18904 /* Substitute into the body of the function. */
18905 tsubst_expr (DECL_SAVED_TREE (code_pattern
), args
,
18906 tf_warning_or_error
, tmpl
,
18907 /*integral_constant_expression_p=*/false);
18909 /* Set the current input_location to the end of the function
18910 so that finish_function knows where we are. */
18911 input_location
= DECL_STRUCT_FUNCTION (code_pattern
)->function_end_locus
;
18913 /* We don't need the local specializations any more. */
18914 pointer_map_destroy (local_specializations
);
18915 local_specializations
= saved_local_specializations
;
18917 /* Finish the function. */
18918 d
= finish_function (0);
18919 expand_or_defer_fn (d
);
18922 /* We're not deferring instantiation any more. */
18923 TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (d
)) = 0;
18926 pop_from_top_level ();
18928 pop_function_context ();
18931 input_location
= saved_loc
;
18932 pop_deferring_access_checks ();
18933 pop_tinst_level ();
18935 timevar_pop (TV_TEMPLATE_INST
);
18940 /* Run through the list of templates that we wish we could
18941 instantiate, and instantiate any we can. RETRIES is the
18942 number of times we retry pending template instantiation. */
18945 instantiate_pending_templates (int retries
)
18948 location_t saved_loc
= input_location
;
18950 /* Instantiating templates may trigger vtable generation. This in turn
18951 may require further template instantiations. We place a limit here
18952 to avoid infinite loop. */
18953 if (pending_templates
&& retries
>= max_tinst_depth
)
18955 tree decl
= pending_templates
->tinst
->decl
;
18957 error ("template instantiation depth exceeds maximum of %d"
18958 " instantiating %q+D, possibly from virtual table generation"
18959 " (use -ftemplate-depth= to increase the maximum)",
18960 max_tinst_depth
, decl
);
18961 if (TREE_CODE (decl
) == FUNCTION_DECL
)
18962 /* Pretend that we defined it. */
18963 DECL_INITIAL (decl
) = error_mark_node
;
18969 struct pending_template
**t
= &pending_templates
;
18970 struct pending_template
*last
= NULL
;
18974 tree instantiation
= reopen_tinst_level ((*t
)->tinst
);
18975 bool complete
= false;
18977 if (TYPE_P (instantiation
))
18981 if (!COMPLETE_TYPE_P (instantiation
))
18983 instantiate_class_template (instantiation
);
18984 if (CLASSTYPE_TEMPLATE_INSTANTIATION (instantiation
))
18985 for (fn
= TYPE_METHODS (instantiation
);
18987 fn
= TREE_CHAIN (fn
))
18988 if (! DECL_ARTIFICIAL (fn
))
18989 instantiate_decl (fn
,
18991 /*expl_inst_class_mem_p=*/false);
18992 if (COMPLETE_TYPE_P (instantiation
))
18996 complete
= COMPLETE_TYPE_P (instantiation
);
19000 if (!DECL_TEMPLATE_SPECIALIZATION (instantiation
)
19001 && !DECL_TEMPLATE_INSTANTIATED (instantiation
))
19004 = instantiate_decl (instantiation
,
19006 /*expl_inst_class_mem_p=*/false);
19007 if (DECL_TEMPLATE_INSTANTIATED (instantiation
))
19011 complete
= (DECL_TEMPLATE_SPECIALIZATION (instantiation
)
19012 || DECL_TEMPLATE_INSTANTIATED (instantiation
));
19016 /* If INSTANTIATION has been instantiated, then we don't
19017 need to consider it again in the future. */
19025 current_tinst_level
= NULL
;
19027 last_pending_template
= last
;
19029 while (reconsider
);
19031 input_location
= saved_loc
;
19034 /* Substitute ARGVEC into T, which is a list of initializers for
19035 either base class or a non-static data member. The TREE_PURPOSEs
19036 are DECLs, and the TREE_VALUEs are the initializer values. Used by
19037 instantiate_decl. */
19040 tsubst_initializer_list (tree t
, tree argvec
)
19042 tree inits
= NULL_TREE
;
19044 for (; t
; t
= TREE_CHAIN (t
))
19048 tree expanded_bases
= NULL_TREE
;
19049 tree expanded_arguments
= NULL_TREE
;
19052 if (TREE_CODE (TREE_PURPOSE (t
)) == TYPE_PACK_EXPANSION
)
19057 /* Expand the base class expansion type into separate base
19059 expanded_bases
= tsubst_pack_expansion (TREE_PURPOSE (t
), argvec
,
19060 tf_warning_or_error
,
19062 if (expanded_bases
== error_mark_node
)
19065 /* We'll be building separate TREE_LISTs of arguments for
19067 len
= TREE_VEC_LENGTH (expanded_bases
);
19068 expanded_arguments
= make_tree_vec (len
);
19069 for (i
= 0; i
< len
; i
++)
19070 TREE_VEC_ELT (expanded_arguments
, i
) = NULL_TREE
;
19072 /* Build a dummy EXPR_PACK_EXPANSION that will be used to
19073 expand each argument in the TREE_VALUE of t. */
19074 expr
= make_node (EXPR_PACK_EXPANSION
);
19075 PACK_EXPANSION_LOCAL_P (expr
) = true;
19076 PACK_EXPANSION_PARAMETER_PACKS (expr
) =
19077 PACK_EXPANSION_PARAMETER_PACKS (TREE_PURPOSE (t
));
19079 if (TREE_VALUE (t
) == void_type_node
)
19080 /* VOID_TYPE_NODE is used to indicate
19081 value-initialization. */
19083 for (i
= 0; i
< len
; i
++)
19084 TREE_VEC_ELT (expanded_arguments
, i
) = void_type_node
;
19088 /* Substitute parameter packs into each argument in the
19090 in_base_initializer
= 1;
19091 for (arg
= TREE_VALUE (t
); arg
; arg
= TREE_CHAIN (arg
))
19093 tree expanded_exprs
;
19095 /* Expand the argument. */
19096 SET_PACK_EXPANSION_PATTERN (expr
, TREE_VALUE (arg
));
19098 = tsubst_pack_expansion (expr
, argvec
,
19099 tf_warning_or_error
,
19101 if (expanded_exprs
== error_mark_node
)
19104 /* Prepend each of the expanded expressions to the
19105 corresponding TREE_LIST in EXPANDED_ARGUMENTS. */
19106 for (i
= 0; i
< len
; i
++)
19108 TREE_VEC_ELT (expanded_arguments
, i
) =
19109 tree_cons (NULL_TREE
,
19110 TREE_VEC_ELT (expanded_exprs
, i
),
19111 TREE_VEC_ELT (expanded_arguments
, i
));
19114 in_base_initializer
= 0;
19116 /* Reverse all of the TREE_LISTs in EXPANDED_ARGUMENTS,
19117 since we built them backwards. */
19118 for (i
= 0; i
< len
; i
++)
19120 TREE_VEC_ELT (expanded_arguments
, i
) =
19121 nreverse (TREE_VEC_ELT (expanded_arguments
, i
));
19126 for (i
= 0; i
< len
; ++i
)
19128 if (expanded_bases
)
19130 decl
= TREE_VEC_ELT (expanded_bases
, i
);
19131 decl
= expand_member_init (decl
);
19132 init
= TREE_VEC_ELT (expanded_arguments
, i
);
19137 decl
= tsubst_copy (TREE_PURPOSE (t
), argvec
,
19138 tf_warning_or_error
, NULL_TREE
);
19140 decl
= expand_member_init (decl
);
19141 if (decl
&& !DECL_P (decl
))
19142 in_base_initializer
= 1;
19144 init
= TREE_VALUE (t
);
19146 if (init
!= void_type_node
)
19147 init
= tsubst_expr (init
, argvec
,
19148 tf_warning_or_error
, NULL_TREE
,
19149 /*integral_constant_expression_p=*/false);
19150 if (init
== NULL_TREE
&& tmp
!= NULL_TREE
)
19151 /* If we had an initializer but it instantiated to nothing,
19152 value-initialize the object. This will only occur when
19153 the initializer was a pack expansion where the parameter
19154 packs used in that expansion were of length zero. */
19155 init
= void_type_node
;
19156 in_base_initializer
= 0;
19161 init
= build_tree_list (decl
, init
);
19162 TREE_CHAIN (init
) = inits
;
19170 /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */
19173 set_current_access_from_decl (tree decl
)
19175 if (TREE_PRIVATE (decl
))
19176 current_access_specifier
= access_private_node
;
19177 else if (TREE_PROTECTED (decl
))
19178 current_access_specifier
= access_protected_node
;
19180 current_access_specifier
= access_public_node
;
19183 /* Instantiate an enumerated type. TAG is the template type, NEWTAG
19184 is the instantiation (which should have been created with
19185 start_enum) and ARGS are the template arguments to use. */
19188 tsubst_enum (tree tag
, tree newtag
, tree args
)
19192 if (SCOPED_ENUM_P (newtag
))
19193 begin_scope (sk_scoped_enum
, newtag
);
19195 for (e
= TYPE_VALUES (tag
); e
; e
= TREE_CHAIN (e
))
19200 decl
= TREE_VALUE (e
);
19201 /* Note that in a template enum, the TREE_VALUE is the
19202 CONST_DECL, not the corresponding INTEGER_CST. */
19203 value
= tsubst_expr (DECL_INITIAL (decl
),
19204 args
, tf_warning_or_error
, NULL_TREE
,
19205 /*integral_constant_expression_p=*/true);
19207 /* Give this enumeration constant the correct access. */
19208 set_current_access_from_decl (decl
);
19210 /* Actually build the enumerator itself. */
19212 (DECL_NAME (decl
), value
, newtag
, DECL_SOURCE_LOCATION (decl
));
19215 if (SCOPED_ENUM_P (newtag
))
19218 finish_enum_value_list (newtag
);
19219 finish_enum (newtag
);
19221 DECL_SOURCE_LOCATION (TYPE_NAME (newtag
))
19222 = DECL_SOURCE_LOCATION (TYPE_NAME (tag
));
19225 /* DECL is a FUNCTION_DECL that is a template specialization. Return
19226 its type -- but without substituting the innermost set of template
19227 arguments. So, innermost set of template parameters will appear in
19231 get_mostly_instantiated_function_type (tree decl
)
19239 tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
19240 targs
= DECL_TI_ARGS (decl
);
19241 tparms
= DECL_TEMPLATE_PARMS (tmpl
);
19242 parm_depth
= TMPL_PARMS_DEPTH (tparms
);
19244 /* There should be as many levels of arguments as there are levels
19246 gcc_assert (parm_depth
== TMPL_ARGS_DEPTH (targs
));
19248 fn_type
= TREE_TYPE (tmpl
);
19250 if (parm_depth
== 1)
19251 /* No substitution is necessary. */
19258 /* Replace the innermost level of the TARGS with NULL_TREEs to
19259 let tsubst know not to substitute for those parameters. */
19260 partial_args
= make_tree_vec (TREE_VEC_LENGTH (targs
));
19261 for (i
= 1; i
< TMPL_ARGS_DEPTH (targs
); ++i
)
19262 SET_TMPL_ARGS_LEVEL (partial_args
, i
,
19263 TMPL_ARGS_LEVEL (targs
, i
));
19264 SET_TMPL_ARGS_LEVEL (partial_args
,
19265 TMPL_ARGS_DEPTH (targs
),
19266 make_tree_vec (DECL_NTPARMS (tmpl
)));
19268 /* Make sure that we can see identifiers, and compute access
19270 push_access_scope (decl
);
19272 ++processing_template_decl
;
19273 /* Now, do the (partial) substitution to figure out the
19274 appropriate function type. */
19275 fn_type
= tsubst (fn_type
, partial_args
, tf_error
, NULL_TREE
);
19276 --processing_template_decl
;
19278 /* Substitute into the template parameters to obtain the real
19279 innermost set of parameters. This step is important if the
19280 innermost set of template parameters contains value
19281 parameters whose types depend on outer template parameters. */
19282 TREE_VEC_LENGTH (partial_args
)--;
19283 tparms
= tsubst_template_parms (tparms
, partial_args
, tf_error
);
19285 pop_access_scope (decl
);
19291 /* Return truthvalue if we're processing a template different from
19292 the last one involved in diagnostics. */
19294 problematic_instantiation_changed (void)
19296 return current_tinst_level
!= last_error_tinst_level
;
19299 /* Remember current template involved in diagnostics. */
19301 record_last_problematic_instantiation (void)
19303 last_error_tinst_level
= current_tinst_level
;
19306 struct tinst_level
*
19307 current_instantiation (void)
19309 return current_tinst_level
;
19312 /* [temp.param] Check that template non-type parm TYPE is of an allowable
19313 type. Return zero for ok, nonzero for disallowed. Issue error and
19314 warning messages under control of COMPLAIN. */
19317 invalid_nontype_parm_type_p (tree type
, tsubst_flags_t complain
)
19319 if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
19321 else if (POINTER_TYPE_P (type
))
19323 else if (TYPE_PTRMEM_P (type
))
19325 else if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
)
19327 else if (TREE_CODE (type
) == TYPENAME_TYPE
)
19329 else if (TREE_CODE (type
) == DECLTYPE_TYPE
)
19331 else if (TREE_CODE (type
) == NULLPTR_TYPE
)
19334 if (complain
& tf_error
)
19336 if (type
== error_mark_node
)
19337 inform (input_location
, "invalid template non-type parameter");
19339 error ("%q#T is not a valid type for a template non-type parameter",
19345 /* Returns TRUE if TYPE is dependent, in the sense of [temp.dep.type].
19346 Assumes that TYPE really is a type, and not the ERROR_MARK_NODE.*/
19349 dependent_type_p_r (tree type
)
19355 A type is dependent if it is:
19357 -- a template parameter. Template template parameters are types
19358 for us (since TYPE_P holds true for them) so we handle
19360 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
19361 || TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
)
19363 /* -- a qualified-id with a nested-name-specifier which contains a
19364 class-name that names a dependent type or whose unqualified-id
19365 names a dependent type. */
19366 if (TREE_CODE (type
) == TYPENAME_TYPE
)
19368 /* -- a cv-qualified type where the cv-unqualified type is
19370 type
= TYPE_MAIN_VARIANT (type
);
19371 /* -- a compound type constructed from any dependent type. */
19372 if (TYPE_PTRMEM_P (type
))
19373 return (dependent_type_p (TYPE_PTRMEM_CLASS_TYPE (type
))
19374 || dependent_type_p (TYPE_PTRMEM_POINTED_TO_TYPE
19376 else if (TYPE_PTR_P (type
)
19377 || TREE_CODE (type
) == REFERENCE_TYPE
)
19378 return dependent_type_p (TREE_TYPE (type
));
19379 else if (TREE_CODE (type
) == FUNCTION_TYPE
19380 || TREE_CODE (type
) == METHOD_TYPE
)
19384 if (dependent_type_p (TREE_TYPE (type
)))
19386 for (arg_type
= TYPE_ARG_TYPES (type
);
19388 arg_type
= TREE_CHAIN (arg_type
))
19389 if (dependent_type_p (TREE_VALUE (arg_type
)))
19393 /* -- an array type constructed from any dependent type or whose
19394 size is specified by a constant expression that is
19397 We checked for type- and value-dependence of the bounds in
19398 compute_array_index_type, so TYPE_DEPENDENT_P is already set. */
19399 if (TREE_CODE (type
) == ARRAY_TYPE
)
19401 if (TYPE_DOMAIN (type
)
19402 && dependent_type_p (TYPE_DOMAIN (type
)))
19404 return dependent_type_p (TREE_TYPE (type
));
19407 /* -- a template-id in which either the template name is a template
19409 if (TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
19411 /* ... or any of the template arguments is a dependent type or
19412 an expression that is type-dependent or value-dependent. */
19413 else if (CLASS_TYPE_P (type
) && CLASSTYPE_TEMPLATE_INFO (type
)
19414 && (any_dependent_template_arguments_p
19415 (INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type
)))))
19418 /* All TYPEOF_TYPEs, DECLTYPE_TYPEs, and UNDERLYING_TYPEs are
19419 dependent; if the argument of the `typeof' expression is not
19420 type-dependent, then it should already been have resolved. */
19421 if (TREE_CODE (type
) == TYPEOF_TYPE
19422 || TREE_CODE (type
) == DECLTYPE_TYPE
19423 || TREE_CODE (type
) == UNDERLYING_TYPE
)
19426 /* A template argument pack is dependent if any of its packed
19428 if (TREE_CODE (type
) == TYPE_ARGUMENT_PACK
)
19430 tree args
= ARGUMENT_PACK_ARGS (type
);
19431 int i
, len
= TREE_VEC_LENGTH (args
);
19432 for (i
= 0; i
< len
; ++i
)
19433 if (dependent_template_arg_p (TREE_VEC_ELT (args
, i
)))
19437 /* All TYPE_PACK_EXPANSIONs are dependent, because parameter packs must
19438 be template parameters. */
19439 if (TREE_CODE (type
) == TYPE_PACK_EXPANSION
)
19442 /* The standard does not specifically mention types that are local
19443 to template functions or local classes, but they should be
19444 considered dependent too. For example:
19446 template <int I> void f() {
19451 The size of `E' cannot be known until the value of `I' has been
19452 determined. Therefore, `E' must be considered dependent. */
19453 scope
= TYPE_CONTEXT (type
);
19454 if (scope
&& TYPE_P (scope
))
19455 return dependent_type_p (scope
);
19456 /* Don't use type_dependent_expression_p here, as it can lead
19457 to infinite recursion trying to determine whether a lambda
19458 nested in a lambda is dependent (c++/47687). */
19459 else if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
19460 && DECL_LANG_SPECIFIC (scope
)
19461 && DECL_TEMPLATE_INFO (scope
)
19462 && (any_dependent_template_arguments_p
19463 (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (scope
)))))
19466 /* Other types are non-dependent. */
19470 /* Returns TRUE if TYPE is dependent, in the sense of
19471 [temp.dep.type]. Note that a NULL type is considered dependent. */
19474 dependent_type_p (tree type
)
19476 /* If there are no template parameters in scope, then there can't be
19477 any dependent types. */
19478 if (!processing_template_decl
)
19480 /* If we are not processing a template, then nobody should be
19481 providing us with a dependent type. */
19483 gcc_assert (TREE_CODE (type
) != TEMPLATE_TYPE_PARM
|| is_auto (type
));
19487 /* If the type is NULL, we have not computed a type for the entity
19488 in question; in that case, the type is dependent. */
19492 /* Erroneous types can be considered non-dependent. */
19493 if (type
== error_mark_node
)
19496 /* If we have not already computed the appropriate value for TYPE,
19498 if (!TYPE_DEPENDENT_P_VALID (type
))
19500 TYPE_DEPENDENT_P (type
) = dependent_type_p_r (type
);
19501 TYPE_DEPENDENT_P_VALID (type
) = 1;
19504 return TYPE_DEPENDENT_P (type
);
19507 /* Returns TRUE if SCOPE is a dependent scope, in which we can't do any
19508 lookup. In other words, a dependent type that is not the current
19512 dependent_scope_p (tree scope
)
19514 return (scope
&& TYPE_P (scope
) && dependent_type_p (scope
)
19515 && !currently_open_class (scope
));
19518 /* T is a SCOPE_REF; return whether we need to consider it
19519 instantiation-dependent so that we can check access at instantiation
19520 time even though we know which member it resolves to. */
19523 instantiation_dependent_scope_ref_p (tree t
)
19525 if (DECL_P (TREE_OPERAND (t
, 1))
19526 && CLASS_TYPE_P (TREE_OPERAND (t
, 0))
19527 && accessible_in_template_p (TREE_OPERAND (t
, 0),
19528 TREE_OPERAND (t
, 1)))
19534 /* Returns TRUE if the EXPRESSION is value-dependent, in the sense of
19535 [temp.dep.constexpr]. EXPRESSION is already known to be a constant
19538 /* Note that this predicate is not appropriate for general expressions;
19539 only constant expressions (that satisfy potential_constant_expression)
19540 can be tested for value dependence. */
19543 value_dependent_expression_p (tree expression
)
19545 if (!processing_template_decl
)
19548 /* A name declared with a dependent type. */
19549 if (DECL_P (expression
) && type_dependent_expression_p (expression
))
19552 switch (TREE_CODE (expression
))
19554 case IDENTIFIER_NODE
:
19555 /* A name that has not been looked up -- must be dependent. */
19558 case TEMPLATE_PARM_INDEX
:
19559 /* A non-type template parm. */
19563 /* A non-type template parm. */
19564 if (DECL_TEMPLATE_PARM_P (expression
))
19566 return value_dependent_expression_p (DECL_INITIAL (expression
));
19569 /* A constant with literal type and is initialized
19570 with an expression that is value-dependent.
19572 Note that a non-dependent parenthesized initializer will have
19573 already been replaced with its constant value, so if we see
19574 a TREE_LIST it must be dependent. */
19575 if (DECL_INITIAL (expression
)
19576 && decl_constant_var_p (expression
)
19577 && (TREE_CODE (DECL_INITIAL (expression
)) == TREE_LIST
19578 || value_dependent_expression_p (DECL_INITIAL (expression
))))
19582 case DYNAMIC_CAST_EXPR
:
19583 case STATIC_CAST_EXPR
:
19584 case CONST_CAST_EXPR
:
19585 case REINTERPRET_CAST_EXPR
:
19587 /* These expressions are value-dependent if the type to which
19588 the cast occurs is dependent or the expression being casted
19589 is value-dependent. */
19591 tree type
= TREE_TYPE (expression
);
19593 if (dependent_type_p (type
))
19596 /* A functional cast has a list of operands. */
19597 expression
= TREE_OPERAND (expression
, 0);
19600 /* If there are no operands, it must be an expression such
19601 as "int()". This should not happen for aggregate types
19602 because it would form non-constant expressions. */
19603 gcc_assert (cxx_dialect
>= cxx0x
19604 || INTEGRAL_OR_ENUMERATION_TYPE_P (type
));
19609 if (TREE_CODE (expression
) == TREE_LIST
)
19610 return any_value_dependent_elements_p (expression
);
19612 return value_dependent_expression_p (expression
);
19616 if (SIZEOF_EXPR_TYPE_P (expression
))
19617 return dependent_type_p (TREE_TYPE (TREE_OPERAND (expression
, 0)));
19621 /* A `sizeof' expression is value-dependent if the operand is
19622 type-dependent or is a pack expansion. */
19623 expression
= TREE_OPERAND (expression
, 0);
19624 if (PACK_EXPANSION_P (expression
))
19626 else if (TYPE_P (expression
))
19627 return dependent_type_p (expression
);
19628 return instantiation_dependent_expression_p (expression
);
19630 case AT_ENCODE_EXPR
:
19631 /* An 'encode' expression is value-dependent if the operand is
19633 expression
= TREE_OPERAND (expression
, 0);
19634 return dependent_type_p (expression
);
19636 case NOEXCEPT_EXPR
:
19637 expression
= TREE_OPERAND (expression
, 0);
19638 return instantiation_dependent_expression_p (expression
);
19641 /* All instantiation-dependent expressions should also be considered
19642 value-dependent. */
19643 return instantiation_dependent_scope_ref_p (expression
);
19645 case COMPONENT_REF
:
19646 return (value_dependent_expression_p (TREE_OPERAND (expression
, 0))
19647 || value_dependent_expression_p (TREE_OPERAND (expression
, 1)));
19649 case NONTYPE_ARGUMENT_PACK
:
19650 /* A NONTYPE_ARGUMENT_PACK is value-dependent if any packed argument
19651 is value-dependent. */
19653 tree values
= ARGUMENT_PACK_ARGS (expression
);
19654 int i
, len
= TREE_VEC_LENGTH (values
);
19656 for (i
= 0; i
< len
; ++i
)
19657 if (value_dependent_expression_p (TREE_VEC_ELT (values
, i
)))
19665 tree type2
= TRAIT_EXPR_TYPE2 (expression
);
19666 return (dependent_type_p (TRAIT_EXPR_TYPE1 (expression
))
19667 || (type2
? dependent_type_p (type2
) : false));
19671 return ((value_dependent_expression_p (TREE_OPERAND (expression
, 0)))
19672 || (value_dependent_expression_p (TREE_OPERAND (expression
, 2))));
19675 return ((value_dependent_expression_p (TREE_OPERAND (expression
, 0)))
19676 || (value_dependent_expression_p (TREE_OPERAND (expression
, 1))));
19680 tree op
= TREE_OPERAND (expression
, 0);
19681 return (value_dependent_expression_p (op
)
19682 || has_value_dependent_address (op
));
19687 tree fn
= get_callee_fndecl (expression
);
19689 if (!fn
&& value_dependent_expression_p (CALL_EXPR_FN (expression
)))
19691 nargs
= call_expr_nargs (expression
);
19692 for (i
= 0; i
< nargs
; ++i
)
19694 tree op
= CALL_EXPR_ARG (expression
, i
);
19695 /* In a call to a constexpr member function, look through the
19696 implicit ADDR_EXPR on the object argument so that it doesn't
19697 cause the call to be considered value-dependent. We also
19698 look through it in potential_constant_expression. */
19699 if (i
== 0 && fn
&& DECL_DECLARED_CONSTEXPR_P (fn
)
19700 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
19701 && TREE_CODE (op
) == ADDR_EXPR
)
19702 op
= TREE_OPERAND (op
, 0);
19703 if (value_dependent_expression_p (op
))
19709 case TEMPLATE_ID_EXPR
:
19710 /* If a TEMPLATE_ID_EXPR involves a dependent name, it will be
19712 return type_dependent_expression_p (expression
);
19718 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expression
), ix
, val
)
19719 if (value_dependent_expression_p (val
))
19725 /* Treat a GNU statement expression as dependent to avoid crashing
19726 under fold_non_dependent_expr; it can't be constant. */
19730 /* A constant expression is value-dependent if any subexpression is
19731 value-dependent. */
19732 switch (TREE_CODE_CLASS (TREE_CODE (expression
)))
19734 case tcc_reference
:
19736 case tcc_comparison
:
19738 case tcc_expression
:
19741 int i
, len
= cp_tree_operand_length (expression
);
19743 for (i
= 0; i
< len
; i
++)
19745 tree t
= TREE_OPERAND (expression
, i
);
19747 /* In some cases, some of the operands may be missing.l
19748 (For example, in the case of PREDECREMENT_EXPR, the
19749 amount to increment by may be missing.) That doesn't
19750 make the expression dependent. */
19751 if (t
&& value_dependent_expression_p (t
))
19762 /* The expression is not value-dependent. */
19766 /* Returns TRUE if the EXPRESSION is type-dependent, in the sense of
19767 [temp.dep.expr]. Note that an expression with no type is
19768 considered dependent. Other parts of the compiler arrange for an
19769 expression with type-dependent subexpressions to have no type, so
19770 this function doesn't have to be fully recursive. */
19773 type_dependent_expression_p (tree expression
)
19775 if (!processing_template_decl
)
19778 if (expression
== error_mark_node
)
19781 /* An unresolved name is always dependent. */
19782 if (identifier_p (expression
) || TREE_CODE (expression
) == USING_DECL
)
19785 /* Some expression forms are never type-dependent. */
19786 if (TREE_CODE (expression
) == PSEUDO_DTOR_EXPR
19787 || TREE_CODE (expression
) == SIZEOF_EXPR
19788 || TREE_CODE (expression
) == ALIGNOF_EXPR
19789 || TREE_CODE (expression
) == AT_ENCODE_EXPR
19790 || TREE_CODE (expression
) == NOEXCEPT_EXPR
19791 || TREE_CODE (expression
) == TRAIT_EXPR
19792 || TREE_CODE (expression
) == TYPEID_EXPR
19793 || TREE_CODE (expression
) == DELETE_EXPR
19794 || TREE_CODE (expression
) == VEC_DELETE_EXPR
19795 || TREE_CODE (expression
) == THROW_EXPR
)
19798 /* The types of these expressions depends only on the type to which
19799 the cast occurs. */
19800 if (TREE_CODE (expression
) == DYNAMIC_CAST_EXPR
19801 || TREE_CODE (expression
) == STATIC_CAST_EXPR
19802 || TREE_CODE (expression
) == CONST_CAST_EXPR
19803 || TREE_CODE (expression
) == REINTERPRET_CAST_EXPR
19804 || TREE_CODE (expression
) == IMPLICIT_CONV_EXPR
19805 || TREE_CODE (expression
) == CAST_EXPR
)
19806 return dependent_type_p (TREE_TYPE (expression
));
19808 /* The types of these expressions depends only on the type created
19809 by the expression. */
19810 if (TREE_CODE (expression
) == NEW_EXPR
19811 || TREE_CODE (expression
) == VEC_NEW_EXPR
)
19813 /* For NEW_EXPR tree nodes created inside a template, either
19814 the object type itself or a TREE_LIST may appear as the
19816 tree type
= TREE_OPERAND (expression
, 1);
19817 if (TREE_CODE (type
) == TREE_LIST
)
19818 /* This is an array type. We need to check array dimensions
19820 return dependent_type_p (TREE_VALUE (TREE_PURPOSE (type
)))
19821 || value_dependent_expression_p
19822 (TREE_OPERAND (TREE_VALUE (type
), 1));
19824 return dependent_type_p (type
);
19827 if (TREE_CODE (expression
) == SCOPE_REF
)
19829 tree scope
= TREE_OPERAND (expression
, 0);
19830 tree name
= TREE_OPERAND (expression
, 1);
19832 /* 14.6.2.2 [temp.dep.expr]: An id-expression is type-dependent if it
19833 contains an identifier associated by name lookup with one or more
19834 declarations declared with a dependent type, or...a
19835 nested-name-specifier or qualified-id that names a member of an
19836 unknown specialization. */
19837 return (type_dependent_expression_p (name
)
19838 || dependent_scope_p (scope
));
19841 if (TREE_CODE (expression
) == FUNCTION_DECL
19842 && DECL_LANG_SPECIFIC (expression
)
19843 && DECL_TEMPLATE_INFO (expression
)
19844 && (any_dependent_template_arguments_p
19845 (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (expression
)))))
19848 if (TREE_CODE (expression
) == TEMPLATE_DECL
19849 && !DECL_TEMPLATE_TEMPLATE_PARM_P (expression
))
19852 if (TREE_CODE (expression
) == STMT_EXPR
)
19853 expression
= stmt_expr_value_expr (expression
);
19855 if (BRACE_ENCLOSED_INITIALIZER_P (expression
))
19860 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expression
), i
, elt
)
19862 if (type_dependent_expression_p (elt
))
19868 /* A static data member of the current instantiation with incomplete
19869 array type is type-dependent, as the definition and specializations
19870 can have different bounds. */
19871 if (VAR_P (expression
)
19872 && DECL_CLASS_SCOPE_P (expression
)
19873 && dependent_type_p (DECL_CONTEXT (expression
))
19874 && VAR_HAD_UNKNOWN_BOUND (expression
))
19877 if (TREE_TYPE (expression
) == unknown_type_node
)
19879 if (TREE_CODE (expression
) == ADDR_EXPR
)
19880 return type_dependent_expression_p (TREE_OPERAND (expression
, 0));
19881 if (TREE_CODE (expression
) == COMPONENT_REF
19882 || TREE_CODE (expression
) == OFFSET_REF
)
19884 if (type_dependent_expression_p (TREE_OPERAND (expression
, 0)))
19886 expression
= TREE_OPERAND (expression
, 1);
19887 if (identifier_p (expression
))
19890 /* SCOPE_REF with non-null TREE_TYPE is always non-dependent. */
19891 if (TREE_CODE (expression
) == SCOPE_REF
)
19894 if (BASELINK_P (expression
))
19895 expression
= BASELINK_FUNCTIONS (expression
);
19897 if (TREE_CODE (expression
) == TEMPLATE_ID_EXPR
)
19899 if (any_dependent_template_arguments_p
19900 (TREE_OPERAND (expression
, 1)))
19902 expression
= TREE_OPERAND (expression
, 0);
19904 gcc_assert (TREE_CODE (expression
) == OVERLOAD
19905 || TREE_CODE (expression
) == FUNCTION_DECL
);
19909 if (type_dependent_expression_p (OVL_CURRENT (expression
)))
19911 expression
= OVL_NEXT (expression
);
19916 gcc_assert (TREE_CODE (expression
) != TYPE_DECL
);
19918 return (dependent_type_p (TREE_TYPE (expression
)));
19921 /* walk_tree callback function for instantiation_dependent_expression_p,
19922 below. Returns non-zero if a dependent subexpression is found. */
19925 instantiation_dependent_r (tree
*tp
, int *walk_subtrees
,
19930 /* We don't have to worry about decltype currently because decltype
19931 of an instantiation-dependent expr is a dependent type. This
19932 might change depending on the resolution of DR 1172. */
19933 *walk_subtrees
= false;
19936 enum tree_code code
= TREE_CODE (*tp
);
19939 /* Don't treat an argument list as dependent just because it has no
19947 /* A constant with a dependent initializer is dependent. */
19948 if (value_dependent_expression_p (*tp
))
19952 case TEMPLATE_PARM_INDEX
:
19955 /* Handle expressions with type operands. */
19959 case AT_ENCODE_EXPR
:
19961 tree op
= TREE_OPERAND (*tp
, 0);
19962 if (code
== SIZEOF_EXPR
&& SIZEOF_EXPR_TYPE_P (*tp
))
19963 op
= TREE_TYPE (op
);
19966 if (dependent_type_p (op
))
19970 *walk_subtrees
= false;
19978 if (dependent_type_p (TRAIT_EXPR_TYPE1 (*tp
))
19979 || dependent_type_p (TRAIT_EXPR_TYPE2 (*tp
)))
19981 *walk_subtrees
= false;
19984 case COMPONENT_REF
:
19985 if (identifier_p (TREE_OPERAND (*tp
, 1)))
19986 /* In a template, finish_class_member_access_expr creates a
19987 COMPONENT_REF with an IDENTIFIER_NODE for op1 even if it isn't
19988 type-dependent, so that we can check access control at
19989 instantiation time (PR 42277). See also Core issue 1273. */
19994 if (instantiation_dependent_scope_ref_p (*tp
))
19999 /* Treat statement-expressions as dependent. */
20007 if (type_dependent_expression_p (*tp
))
20013 /* Returns TRUE if the EXPRESSION is instantiation-dependent, in the
20014 sense defined by the ABI:
20016 "An expression is instantiation-dependent if it is type-dependent
20017 or value-dependent, or it has a subexpression that is type-dependent
20018 or value-dependent." */
20021 instantiation_dependent_expression_p (tree expression
)
20025 if (!processing_template_decl
)
20028 if (expression
== error_mark_node
)
20031 result
= cp_walk_tree_without_duplicates (&expression
,
20032 instantiation_dependent_r
, NULL
);
20033 return result
!= NULL_TREE
;
20036 /* Like type_dependent_expression_p, but it also works while not processing
20037 a template definition, i.e. during substitution or mangling. */
20040 type_dependent_expression_p_push (tree expr
)
20043 ++processing_template_decl
;
20044 b
= type_dependent_expression_p (expr
);
20045 --processing_template_decl
;
20049 /* Returns TRUE if ARGS contains a type-dependent expression. */
20052 any_type_dependent_arguments_p (const vec
<tree
, va_gc
> *args
)
20057 FOR_EACH_VEC_SAFE_ELT (args
, i
, arg
)
20059 if (type_dependent_expression_p (arg
))
20065 /* Returns TRUE if LIST (a TREE_LIST whose TREE_VALUEs are
20066 expressions) contains any type-dependent expressions. */
20069 any_type_dependent_elements_p (const_tree list
)
20071 for (; list
; list
= TREE_CHAIN (list
))
20072 if (value_dependent_expression_p (TREE_VALUE (list
)))
20078 /* Returns TRUE if LIST (a TREE_LIST whose TREE_VALUEs are
20079 expressions) contains any value-dependent expressions. */
20082 any_value_dependent_elements_p (const_tree list
)
20084 for (; list
; list
= TREE_CHAIN (list
))
20085 if (value_dependent_expression_p (TREE_VALUE (list
)))
20091 /* Returns TRUE if the ARG (a template argument) is dependent. */
20094 dependent_template_arg_p (tree arg
)
20096 if (!processing_template_decl
)
20099 /* Assume a template argument that was wrongly written by the user
20100 is dependent. This is consistent with what
20101 any_dependent_template_arguments_p [that calls this function]
20103 if (!arg
|| arg
== error_mark_node
)
20106 if (TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
20107 arg
= ARGUMENT_PACK_SELECT_ARG (arg
);
20109 if (TREE_CODE (arg
) == TEMPLATE_DECL
20110 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
20111 return dependent_template_p (arg
);
20112 else if (ARGUMENT_PACK_P (arg
))
20114 tree args
= ARGUMENT_PACK_ARGS (arg
);
20115 int i
, len
= TREE_VEC_LENGTH (args
);
20116 for (i
= 0; i
< len
; ++i
)
20118 if (dependent_template_arg_p (TREE_VEC_ELT (args
, i
)))
20124 else if (TYPE_P (arg
))
20125 return dependent_type_p (arg
);
20127 return (type_dependent_expression_p (arg
)
20128 || value_dependent_expression_p (arg
));
20131 /* Returns true if ARGS (a collection of template arguments) contains
20132 any types that require structural equality testing. */
20135 any_template_arguments_need_structural_equality_p (tree args
)
20142 if (args
== error_mark_node
)
20145 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
20147 tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
20148 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
20150 tree arg
= TREE_VEC_ELT (level
, j
);
20151 tree packed_args
= NULL_TREE
;
20154 if (ARGUMENT_PACK_P (arg
))
20156 /* Look inside the argument pack. */
20157 packed_args
= ARGUMENT_PACK_ARGS (arg
);
20158 len
= TREE_VEC_LENGTH (packed_args
);
20161 for (k
= 0; k
< len
; ++k
)
20164 arg
= TREE_VEC_ELT (packed_args
, k
);
20166 if (error_operand_p (arg
))
20168 else if (TREE_CODE (arg
) == TEMPLATE_DECL
20169 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
20171 else if (TYPE_P (arg
) && TYPE_STRUCTURAL_EQUALITY_P (arg
))
20173 else if (!TYPE_P (arg
) && TREE_TYPE (arg
)
20174 && TYPE_STRUCTURAL_EQUALITY_P (TREE_TYPE (arg
)))
20183 /* Returns true if ARGS (a collection of template arguments) contains
20184 any dependent arguments. */
20187 any_dependent_template_arguments_p (const_tree args
)
20194 if (args
== error_mark_node
)
20197 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
20199 const_tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
20200 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
20201 if (dependent_template_arg_p (TREE_VEC_ELT (level
, j
)))
20208 /* Returns TRUE if the template TMPL is dependent. */
20211 dependent_template_p (tree tmpl
)
20213 if (TREE_CODE (tmpl
) == OVERLOAD
)
20217 if (dependent_template_p (OVL_CURRENT (tmpl
)))
20219 tmpl
= OVL_NEXT (tmpl
);
20224 /* Template template parameters are dependent. */
20225 if (DECL_TEMPLATE_TEMPLATE_PARM_P (tmpl
)
20226 || TREE_CODE (tmpl
) == TEMPLATE_TEMPLATE_PARM
)
20228 /* So are names that have not been looked up. */
20229 if (TREE_CODE (tmpl
) == SCOPE_REF
|| identifier_p (tmpl
))
20231 /* So are member templates of dependent classes. */
20232 if (TYPE_P (CP_DECL_CONTEXT (tmpl
)))
20233 return dependent_type_p (DECL_CONTEXT (tmpl
));
20237 /* Returns TRUE if the specialization TMPL<ARGS> is dependent. */
20240 dependent_template_id_p (tree tmpl
, tree args
)
20242 return (dependent_template_p (tmpl
)
20243 || any_dependent_template_arguments_p (args
));
20246 /* Returns TRUE if OMP_FOR with DECLV, INITV, CONDV and INCRV vectors
20250 dependent_omp_for_p (tree declv
, tree initv
, tree condv
, tree incrv
)
20254 if (!processing_template_decl
)
20257 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
20259 tree decl
= TREE_VEC_ELT (declv
, i
);
20260 tree init
= TREE_VEC_ELT (initv
, i
);
20261 tree cond
= TREE_VEC_ELT (condv
, i
);
20262 tree incr
= TREE_VEC_ELT (incrv
, i
);
20264 if (type_dependent_expression_p (decl
))
20267 if (init
&& type_dependent_expression_p (init
))
20270 if (type_dependent_expression_p (cond
))
20273 if (COMPARISON_CLASS_P (cond
)
20274 && (type_dependent_expression_p (TREE_OPERAND (cond
, 0))
20275 || type_dependent_expression_p (TREE_OPERAND (cond
, 1))))
20278 if (TREE_CODE (incr
) == MODOP_EXPR
)
20280 if (type_dependent_expression_p (TREE_OPERAND (incr
, 0))
20281 || type_dependent_expression_p (TREE_OPERAND (incr
, 2)))
20284 else if (type_dependent_expression_p (incr
))
20286 else if (TREE_CODE (incr
) == MODIFY_EXPR
)
20288 if (type_dependent_expression_p (TREE_OPERAND (incr
, 0)))
20290 else if (BINARY_CLASS_P (TREE_OPERAND (incr
, 1)))
20292 tree t
= TREE_OPERAND (incr
, 1);
20293 if (type_dependent_expression_p (TREE_OPERAND (t
, 0))
20294 || type_dependent_expression_p (TREE_OPERAND (t
, 1)))
20303 /* TYPE is a TYPENAME_TYPE. Returns the ordinary TYPE to which the
20304 TYPENAME_TYPE corresponds. Returns the original TYPENAME_TYPE if
20305 no such TYPE can be found. Note that this function peers inside
20306 uninstantiated templates and therefore should be used only in
20307 extremely limited situations. ONLY_CURRENT_P restricts this
20308 peering to the currently open classes hierarchy (which is required
20309 when comparing types). */
20312 resolve_typename_type (tree type
, bool only_current_p
)
20321 gcc_assert (TREE_CODE (type
) == TYPENAME_TYPE
);
20323 scope
= TYPE_CONTEXT (type
);
20324 /* Usually the non-qualified identifier of a TYPENAME_TYPE is
20325 TYPE_IDENTIFIER (type). But when 'type' is a typedef variant of
20326 a TYPENAME_TYPE node, then TYPE_NAME (type) is set to the TYPE_DECL representing
20327 the typedef. In that case TYPE_IDENTIFIER (type) is not the non-qualified
20328 identifier of the TYPENAME_TYPE anymore.
20329 So by getting the TYPE_IDENTIFIER of the _main declaration_ of the
20330 TYPENAME_TYPE instead, we avoid messing up with a possible
20331 typedef variant case. */
20332 name
= TYPE_IDENTIFIER (TYPE_MAIN_VARIANT (type
));
20334 /* If the SCOPE is itself a TYPENAME_TYPE, then we need to resolve
20335 it first before we can figure out what NAME refers to. */
20336 if (TREE_CODE (scope
) == TYPENAME_TYPE
)
20338 if (TYPENAME_IS_RESOLVING_P (scope
))
20339 /* Given a class template A with a dependent base with nested type C,
20340 typedef typename A::C::C C will land us here, as trying to resolve
20341 the initial A::C leads to the local C typedef, which leads back to
20342 A::C::C. So we break the recursion now. */
20345 scope
= resolve_typename_type (scope
, only_current_p
);
20347 /* If we don't know what SCOPE refers to, then we cannot resolve the
20349 if (TREE_CODE (scope
) == TYPENAME_TYPE
)
20351 /* If the SCOPE is a template type parameter, we have no way of
20352 resolving the name. */
20353 if (TREE_CODE (scope
) == TEMPLATE_TYPE_PARM
)
20355 /* If the SCOPE is not the current instantiation, there's no reason
20356 to look inside it. */
20357 if (only_current_p
&& !currently_open_class (scope
))
20359 /* If this is a typedef, we don't want to look inside (c++/11987). */
20360 if (typedef_variant_p (type
))
20362 /* If SCOPE isn't the template itself, it will not have a valid
20363 TYPE_FIELDS list. */
20364 if (same_type_p (scope
, CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope
)))
20365 /* scope is either the template itself or a compatible instantiation
20366 like X<T>, so look up the name in the original template. */
20367 scope
= CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope
);
20369 /* scope is a partial instantiation, so we can't do the lookup or we
20370 will lose the template arguments. */
20372 /* Enter the SCOPE so that name lookup will be resolved as if we
20373 were in the class definition. In particular, SCOPE will no
20374 longer be considered a dependent type. */
20375 pushed_scope
= push_scope (scope
);
20376 /* Look up the declaration. */
20377 decl
= lookup_member (scope
, name
, /*protect=*/0, /*want_type=*/true,
20378 tf_warning_or_error
);
20380 result
= NULL_TREE
;
20382 /* For a TYPENAME_TYPE like "typename X::template Y<T>", we want to
20383 find a TEMPLATE_DECL. Otherwise, we want to find a TYPE_DECL. */
20386 else if (identifier_p (TYPENAME_TYPE_FULLNAME (type
))
20387 && TREE_CODE (decl
) == TYPE_DECL
)
20389 result
= TREE_TYPE (decl
);
20390 if (result
== error_mark_node
)
20391 result
= NULL_TREE
;
20393 else if (TREE_CODE (TYPENAME_TYPE_FULLNAME (type
)) == TEMPLATE_ID_EXPR
20394 && DECL_CLASS_TEMPLATE_P (decl
))
20398 /* Obtain the template and the arguments. */
20399 tmpl
= TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type
), 0);
20400 args
= TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type
), 1);
20401 /* Instantiate the template. */
20402 result
= lookup_template_class (tmpl
, args
, NULL_TREE
, NULL_TREE
,
20403 /*entering_scope=*/0,
20404 tf_error
| tf_user
);
20405 if (result
== error_mark_node
)
20406 result
= NULL_TREE
;
20409 /* Leave the SCOPE. */
20411 pop_scope (pushed_scope
);
20413 /* If we failed to resolve it, return the original typename. */
20417 /* If lookup found a typename type, resolve that too. */
20418 if (TREE_CODE (result
) == TYPENAME_TYPE
&& !TYPENAME_IS_RESOLVING_P (result
))
20420 /* Ill-formed programs can cause infinite recursion here, so we
20421 must catch that. */
20422 TYPENAME_IS_RESOLVING_P (type
) = 1;
20423 result
= resolve_typename_type (result
, only_current_p
);
20424 TYPENAME_IS_RESOLVING_P (type
) = 0;
20427 /* Qualify the resulting type. */
20428 quals
= cp_type_quals (type
);
20430 result
= cp_build_qualified_type (result
, cp_type_quals (result
) | quals
);
20435 /* EXPR is an expression which is not type-dependent. Return a proxy
20436 for EXPR that can be used to compute the types of larger
20437 expressions containing EXPR. */
20440 build_non_dependent_expr (tree expr
)
20444 #ifdef ENABLE_CHECKING
20445 /* Try to get a constant value for all non-dependent expressions in
20446 order to expose bugs in *_dependent_expression_p and constexpr. */
20447 if (cxx_dialect
>= cxx0x
)
20448 maybe_constant_value (fold_non_dependent_expr_sfinae (expr
, tf_none
));
20451 /* Preserve OVERLOADs; the functions must be available to resolve
20454 if (TREE_CODE (inner_expr
) == STMT_EXPR
)
20455 inner_expr
= stmt_expr_value_expr (inner_expr
);
20456 if (TREE_CODE (inner_expr
) == ADDR_EXPR
)
20457 inner_expr
= TREE_OPERAND (inner_expr
, 0);
20458 if (TREE_CODE (inner_expr
) == COMPONENT_REF
)
20459 inner_expr
= TREE_OPERAND (inner_expr
, 1);
20460 if (is_overloaded_fn (inner_expr
)
20461 || TREE_CODE (inner_expr
) == OFFSET_REF
)
20463 /* There is no need to return a proxy for a variable. */
20466 /* Preserve string constants; conversions from string constants to
20467 "char *" are allowed, even though normally a "const char *"
20468 cannot be used to initialize a "char *". */
20469 if (TREE_CODE (expr
) == STRING_CST
)
20471 /* Preserve arithmetic constants, as an optimization -- there is no
20472 reason to create a new node. */
20473 if (TREE_CODE (expr
) == INTEGER_CST
|| TREE_CODE (expr
) == REAL_CST
)
20475 /* Preserve THROW_EXPRs -- all throw-expressions have type "void".
20476 There is at least one place where we want to know that a
20477 particular expression is a throw-expression: when checking a ?:
20478 expression, there are special rules if the second or third
20479 argument is a throw-expression. */
20480 if (TREE_CODE (expr
) == THROW_EXPR
)
20483 /* Don't wrap an initializer list, we need to be able to look inside. */
20484 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
20487 /* Don't wrap a dummy object, we need to be able to test for it. */
20488 if (is_dummy_object (expr
))
20491 if (TREE_CODE (expr
) == COND_EXPR
)
20492 return build3 (COND_EXPR
,
20494 TREE_OPERAND (expr
, 0),
20495 (TREE_OPERAND (expr
, 1)
20496 ? build_non_dependent_expr (TREE_OPERAND (expr
, 1))
20497 : build_non_dependent_expr (TREE_OPERAND (expr
, 0))),
20498 build_non_dependent_expr (TREE_OPERAND (expr
, 2)));
20499 if (TREE_CODE (expr
) == COMPOUND_EXPR
20500 && !COMPOUND_EXPR_OVERLOADED (expr
))
20501 return build2 (COMPOUND_EXPR
,
20503 TREE_OPERAND (expr
, 0),
20504 build_non_dependent_expr (TREE_OPERAND (expr
, 1)));
20506 /* If the type is unknown, it can't really be non-dependent */
20507 gcc_assert (TREE_TYPE (expr
) != unknown_type_node
);
20509 /* Otherwise, build a NON_DEPENDENT_EXPR. */
20510 return build1 (NON_DEPENDENT_EXPR
, TREE_TYPE (expr
), expr
);
20513 /* ARGS is a vector of expressions as arguments to a function call.
20514 Replace the arguments with equivalent non-dependent expressions.
20515 This modifies ARGS in place. */
20518 make_args_non_dependent (vec
<tree
, va_gc
> *args
)
20523 FOR_EACH_VEC_SAFE_ELT (args
, ix
, arg
)
20525 tree newarg
= build_non_dependent_expr (arg
);
20527 (*args
)[ix
] = newarg
;
20531 /* Returns a type which represents 'auto'. We use a TEMPLATE_TYPE_PARM
20532 with a level one deeper than the actual template parms. */
20537 tree au
= cxx_make_type (TEMPLATE_TYPE_PARM
);
20538 TYPE_NAME (au
) = build_decl (BUILTINS_LOCATION
,
20539 TYPE_DECL
, get_identifier ("auto"), au
);
20540 TYPE_STUB_DECL (au
) = TYPE_NAME (au
);
20541 TEMPLATE_TYPE_PARM_INDEX (au
) = build_template_parm_index
20542 (0, processing_template_decl
+ 1, processing_template_decl
+ 1,
20543 TYPE_NAME (au
), NULL_TREE
);
20544 TYPE_CANONICAL (au
) = canonical_type_parameter (au
);
20545 DECL_ARTIFICIAL (TYPE_NAME (au
)) = 1;
20546 SET_DECL_TEMPLATE_PARM_P (TYPE_NAME (au
));
20551 /* Given type ARG, return std::initializer_list<ARG>. */
20556 tree std_init_list
= namespace_binding
20557 (get_identifier ("initializer_list"), std_node
);
20559 if (!std_init_list
|| !DECL_CLASS_TEMPLATE_P (std_init_list
))
20561 error ("deducing from brace-enclosed initializer list requires "
20562 "#include <initializer_list>");
20563 return error_mark_node
;
20565 argvec
= make_tree_vec (1);
20566 TREE_VEC_ELT (argvec
, 0) = arg
;
20567 return lookup_template_class (std_init_list
, argvec
, NULL_TREE
,
20568 NULL_TREE
, 0, tf_warning_or_error
);
20571 /* Replace auto in TYPE with std::initializer_list<auto>. */
20574 listify_autos (tree type
, tree auto_node
)
20576 tree init_auto
= listify (auto_node
);
20577 tree argvec
= make_tree_vec (1);
20578 TREE_VEC_ELT (argvec
, 0) = init_auto
;
20579 if (processing_template_decl
)
20580 argvec
= add_to_template_args (current_template_args (), argvec
);
20581 return tsubst (type
, argvec
, tf_warning_or_error
, NULL_TREE
);
20584 /* Replace occurrences of 'auto' in TYPE with the appropriate type deduced
20585 from INIT. AUTO_NODE is the TEMPLATE_TYPE_PARM used for 'auto' in TYPE. */
20588 do_auto_deduction (tree type
, tree init
, tree auto_node
)
20592 if (init
== error_mark_node
)
20593 return error_mark_node
;
20595 if (type_dependent_expression_p (init
))
20596 /* Defining a subset of type-dependent expressions that we can deduce
20597 from ahead of time isn't worth the trouble. */
20600 /* [dcl.spec.auto]: Obtain P from T by replacing the occurrences of auto
20601 with either a new invented type template parameter U or, if the
20602 initializer is a braced-init-list (8.5.4), with
20603 std::initializer_list<U>. */
20604 if (BRACE_ENCLOSED_INITIALIZER_P (init
))
20605 type
= listify_autos (type
, auto_node
);
20607 init
= resolve_nondeduced_context (init
);
20609 targs
= make_tree_vec (1);
20610 if (AUTO_IS_DECLTYPE (auto_node
))
20612 bool id
= (DECL_P (init
) || TREE_CODE (init
) == COMPONENT_REF
);
20613 TREE_VEC_ELT (targs
, 0)
20614 = finish_decltype_type (init
, id
, tf_warning_or_error
);
20618 tree parms
= build_tree_list (NULL_TREE
, type
);
20619 tree tparms
= make_tree_vec (1);
20622 TREE_VEC_ELT (tparms
, 0)
20623 = build_tree_list (NULL_TREE
, TYPE_NAME (auto_node
));
20624 val
= type_unification_real (tparms
, targs
, parms
, &init
, 1, 0,
20625 DEDUCE_CALL
, LOOKUP_NORMAL
,
20626 /*explain_p=*/false);
20629 if (processing_template_decl
)
20630 /* Try again at instantiation time. */
20632 if (type
&& type
!= error_mark_node
)
20633 /* If type is error_mark_node a diagnostic must have been
20634 emitted by now. Also, having a mention to '<type error>'
20635 in the diagnostic is not really useful to the user. */
20637 if (cfun
&& auto_node
== current_function_auto_return_pattern
20638 && LAMBDA_FUNCTION_P (current_function_decl
))
20639 error ("unable to deduce lambda return type from %qE", init
);
20641 error ("unable to deduce %qT from %qE", type
, init
);
20643 return error_mark_node
;
20647 /* If the list of declarators contains more than one declarator, the type
20648 of each declared variable is determined as described above. If the
20649 type deduced for the template parameter U is not the same in each
20650 deduction, the program is ill-formed. */
20651 if (TREE_TYPE (auto_node
)
20652 && !same_type_p (TREE_TYPE (auto_node
), TREE_VEC_ELT (targs
, 0)))
20654 if (cfun
&& auto_node
== current_function_auto_return_pattern
20655 && LAMBDA_FUNCTION_P (current_function_decl
))
20656 error ("inconsistent types %qT and %qT deduced for "
20657 "lambda return type", TREE_TYPE (auto_node
),
20658 TREE_VEC_ELT (targs
, 0));
20660 error ("inconsistent deduction for %qT: %qT and then %qT",
20661 auto_node
, TREE_TYPE (auto_node
), TREE_VEC_ELT (targs
, 0));
20662 return error_mark_node
;
20664 TREE_TYPE (auto_node
) = TREE_VEC_ELT (targs
, 0);
20666 if (processing_template_decl
)
20667 targs
= add_to_template_args (current_template_args (), targs
);
20668 return tsubst (type
, targs
, tf_warning_or_error
, NULL_TREE
);
20671 /* Substitutes LATE_RETURN_TYPE for 'auto' in TYPE and returns the
20675 splice_late_return_type (tree type
, tree late_return_type
)
20679 if (late_return_type
== NULL_TREE
)
20681 argvec
= make_tree_vec (1);
20682 TREE_VEC_ELT (argvec
, 0) = late_return_type
;
20683 if (processing_template_parmlist
)
20684 /* For a late-specified return type in a template type-parameter, we
20685 need to add a dummy argument level for its parmlist. */
20686 argvec
= add_to_template_args
20687 (make_tree_vec (processing_template_parmlist
), argvec
);
20688 if (current_template_parms
)
20689 argvec
= add_to_template_args (current_template_args (), argvec
);
20690 return tsubst (type
, argvec
, tf_warning_or_error
, NULL_TREE
);
20693 /* Returns true iff TYPE is a TEMPLATE_TYPE_PARM representing 'auto'. */
20696 is_auto (const_tree type
)
20698 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
20699 && TYPE_IDENTIFIER (type
) == get_identifier ("auto"))
20705 /* Returns true iff TYPE contains a use of 'auto'. Since auto can only
20706 appear as a type-specifier for the declaration in question, we don't
20707 have to look through the whole type. */
20710 type_uses_auto (tree type
)
20712 enum tree_code code
;
20713 if (is_auto (type
))
20716 code
= TREE_CODE (type
);
20718 if (code
== POINTER_TYPE
|| code
== REFERENCE_TYPE
20719 || code
== OFFSET_TYPE
|| code
== FUNCTION_TYPE
20720 || code
== METHOD_TYPE
|| code
== ARRAY_TYPE
)
20721 return type_uses_auto (TREE_TYPE (type
));
20723 if (TYPE_PTRMEMFUNC_P (type
))
20724 return type_uses_auto (TREE_TYPE (TREE_TYPE
20725 (TYPE_PTRMEMFUNC_FN_TYPE (type
))));
20730 /* For a given template T, return the vector of typedefs referenced
20731 in T for which access check is needed at T instantiation time.
20732 T is either a FUNCTION_DECL or a RECORD_TYPE.
20733 Those typedefs were added to T by the function
20734 append_type_to_template_for_access_check. */
20736 vec
<qualified_typedef_usage_t
, va_gc
> *
20737 get_types_needing_access_check (tree t
)
20740 vec
<qualified_typedef_usage_t
, va_gc
> *result
= NULL
;
20742 if (!t
|| t
== error_mark_node
)
20745 if (!(ti
= get_template_info (t
)))
20748 if (CLASS_TYPE_P (t
)
20749 || TREE_CODE (t
) == FUNCTION_DECL
)
20751 if (!TI_TEMPLATE (ti
))
20754 result
= TI_TYPEDEFS_NEEDING_ACCESS_CHECKING (ti
);
20760 /* Append the typedef TYPE_DECL used in template T to a list of typedefs
20761 tied to T. That list of typedefs will be access checked at
20762 T instantiation time.
20763 T is either a FUNCTION_DECL or a RECORD_TYPE.
20764 TYPE_DECL is a TYPE_DECL node representing a typedef.
20765 SCOPE is the scope through which TYPE_DECL is accessed.
20766 LOCATION is the location of the usage point of TYPE_DECL.
20768 This function is a subroutine of
20769 append_type_to_template_for_access_check. */
20772 append_type_to_template_for_access_check_1 (tree t
,
20775 location_t location
)
20777 qualified_typedef_usage_t typedef_usage
;
20780 if (!t
|| t
== error_mark_node
)
20783 gcc_assert ((TREE_CODE (t
) == FUNCTION_DECL
20784 || CLASS_TYPE_P (t
))
20786 && TREE_CODE (type_decl
) == TYPE_DECL
20789 if (!(ti
= get_template_info (t
)))
20792 gcc_assert (TI_TEMPLATE (ti
));
20794 typedef_usage
.typedef_decl
= type_decl
;
20795 typedef_usage
.context
= scope
;
20796 typedef_usage
.locus
= location
;
20798 vec_safe_push (TI_TYPEDEFS_NEEDING_ACCESS_CHECKING (ti
), typedef_usage
);
20801 /* Append TYPE_DECL to the template TEMPL.
20802 TEMPL is either a class type, a FUNCTION_DECL or a a TEMPLATE_DECL.
20803 At TEMPL instanciation time, TYPE_DECL will be checked to see
20804 if it can be accessed through SCOPE.
20805 LOCATION is the location of the usage point of TYPE_DECL.
20807 e.g. consider the following code snippet:
20814 template<class U> struct S
20816 C::myint mi; // <-- usage point of the typedef C::myint
20821 At S<char> instantiation time, we need to check the access of C::myint
20822 In other words, we need to check the access of the myint typedef through
20823 the C scope. For that purpose, this function will add the myint typedef
20824 and the scope C through which its being accessed to a list of typedefs
20825 tied to the template S. That list will be walked at template instantiation
20826 time and access check performed on each typedefs it contains.
20827 Note that this particular code snippet should yield an error because
20828 myint is private to C. */
20831 append_type_to_template_for_access_check (tree templ
,
20834 location_t location
)
20836 qualified_typedef_usage_t
*iter
;
20839 gcc_assert (type_decl
&& (TREE_CODE (type_decl
) == TYPE_DECL
));
20841 /* Make sure we don't append the type to the template twice. */
20842 FOR_EACH_VEC_SAFE_ELT (get_types_needing_access_check (templ
), i
, iter
)
20843 if (iter
->typedef_decl
== type_decl
&& scope
== iter
->context
)
20846 append_type_to_template_for_access_check_1 (templ
, type_decl
,
20850 /* Set up the hash tables for template instantiations. */
20853 init_template_processing (void)
20855 decl_specializations
= htab_create_ggc (37,
20856 hash_specialization
,
20857 eq_specializations
,
20859 type_specializations
= htab_create_ggc (37,
20860 hash_specialization
,
20861 eq_specializations
,
20865 /* Print stats about the template hash tables for -fstats. */
20868 print_template_statistics (void)
20870 fprintf (stderr
, "decl_specializations: size %ld, %ld elements, "
20871 "%f collisions\n", (long) htab_size (decl_specializations
),
20872 (long) htab_elements (decl_specializations
),
20873 htab_collisions (decl_specializations
));
20874 fprintf (stderr
, "type_specializations: size %ld, %ld elements, "
20875 "%f collisions\n", (long) htab_size (type_specializations
),
20876 (long) htab_elements (type_specializations
),
20877 htab_collisions (type_specializations
));
20880 #include "gt-cp-pt.h"