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. */
3061 if (TYPE_ALIAS_P (t
))
3063 if (TYPE_TEMPLATE_INFO (t
))
3064 cp_walk_tree (&TYPE_TI_ARGS (t
),
3065 &find_parameter_packs_r
,
3071 /* Identify whether this is a parameter pack or not. */
3072 switch (TREE_CODE (t
))
3074 case TEMPLATE_PARM_INDEX
:
3075 if (TEMPLATE_PARM_PARAMETER_PACK (t
))
3076 parameter_pack_p
= true;
3079 case TEMPLATE_TYPE_PARM
:
3080 t
= TYPE_MAIN_VARIANT (t
);
3081 case TEMPLATE_TEMPLATE_PARM
:
3082 if (TEMPLATE_TYPE_PARAMETER_PACK (t
))
3083 parameter_pack_p
= true;
3087 if (FUNCTION_PARAMETER_PACK_P (t
))
3089 /* We don't want to walk into the type of a PARM_DECL,
3090 because we don't want to see the type parameter pack. */
3092 parameter_pack_p
= true;
3097 parameter_pack_p
= true;
3100 /* Not a parameter pack. */
3104 if (parameter_pack_p
)
3106 /* Add this parameter pack to the list. */
3107 *ppd
->parameter_packs
= tree_cons (NULL_TREE
, t
, *ppd
->parameter_packs
);
3111 cp_walk_tree (&TYPE_CONTEXT (t
),
3112 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3114 /* This switch statement will return immediately if we don't find a
3116 switch (TREE_CODE (t
))
3118 case TEMPLATE_PARM_INDEX
:
3121 case BOUND_TEMPLATE_TEMPLATE_PARM
:
3122 /* Check the template itself. */
3123 cp_walk_tree (&TREE_TYPE (TYPE_TI_TEMPLATE (t
)),
3124 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3125 /* Check the template arguments. */
3126 cp_walk_tree (&TYPE_TI_ARGS (t
), &find_parameter_packs_r
, ppd
,
3131 case TEMPLATE_TYPE_PARM
:
3132 case TEMPLATE_TEMPLATE_PARM
:
3139 if (TYPE_PTRMEMFUNC_P (t
))
3145 if (TYPE_TEMPLATE_INFO (t
))
3146 cp_walk_tree (&TYPE_TI_ARGS (t
),
3147 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3154 cp_walk_tree (&TREE_TYPE (t
),
3155 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3159 cp_walk_tree (&TYPENAME_TYPE_FULLNAME (t
), &find_parameter_packs_r
,
3164 case TYPE_PACK_EXPANSION
:
3165 case EXPR_PACK_EXPANSION
:
3170 cp_walk_tree (&TYPE_MAX_VALUE (t
), &find_parameter_packs_r
,
3175 case IDENTIFIER_NODE
:
3176 cp_walk_tree (&TREE_TYPE (t
), &find_parameter_packs_r
, ppd
,
3188 /* Determines if the expression or type T uses any parameter packs. */
3190 uses_parameter_packs (tree t
)
3192 tree parameter_packs
= NULL_TREE
;
3193 struct find_parameter_pack_data ppd
;
3194 ppd
.parameter_packs
= ¶meter_packs
;
3195 ppd
.visited
= pointer_set_create ();
3196 cp_walk_tree (&t
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
3197 pointer_set_destroy (ppd
.visited
);
3198 return parameter_packs
!= NULL_TREE
;
3201 /* Turn ARG, which may be an expression, type, or a TREE_LIST
3202 representation a base-class initializer into a parameter pack
3203 expansion. If all goes well, the resulting node will be an
3204 EXPR_PACK_EXPANSION, TYPE_PACK_EXPANSION, or TREE_LIST,
3207 make_pack_expansion (tree arg
)
3210 tree parameter_packs
= NULL_TREE
;
3211 bool for_types
= false;
3212 struct find_parameter_pack_data ppd
;
3214 if (!arg
|| arg
== error_mark_node
)
3217 if (TREE_CODE (arg
) == TREE_LIST
)
3219 /* The only time we will see a TREE_LIST here is for a base
3220 class initializer. In this case, the TREE_PURPOSE will be a
3221 _TYPE node (representing the base class expansion we're
3222 initializing) and the TREE_VALUE will be a TREE_LIST
3223 containing the initialization arguments.
3225 The resulting expansion looks somewhat different from most
3226 expansions. Rather than returning just one _EXPANSION, we
3227 return a TREE_LIST whose TREE_PURPOSE is a
3228 TYPE_PACK_EXPANSION containing the bases that will be
3229 initialized. The TREE_VALUE will be identical to the
3230 original TREE_VALUE, which is a list of arguments that will
3231 be passed to each base. We do not introduce any new pack
3232 expansion nodes into the TREE_VALUE (although it is possible
3233 that some already exist), because the TREE_PURPOSE and
3234 TREE_VALUE all need to be expanded together with the same
3235 _EXPANSION node. Note that the TYPE_PACK_EXPANSION in the
3236 resulting TREE_PURPOSE will mention the parameter packs in
3237 both the bases and the arguments to the bases. */
3240 tree parameter_packs
= NULL_TREE
;
3242 /* Determine which parameter packs will be used by the base
3244 ppd
.visited
= pointer_set_create ();
3245 ppd
.parameter_packs
= ¶meter_packs
;
3246 cp_walk_tree (&TREE_PURPOSE (arg
), &find_parameter_packs_r
,
3249 if (parameter_packs
== NULL_TREE
)
3251 error ("base initializer expansion %<%T%> contains no parameter packs", arg
);
3252 pointer_set_destroy (ppd
.visited
);
3253 return error_mark_node
;
3256 if (TREE_VALUE (arg
) != void_type_node
)
3258 /* Collect the sets of parameter packs used in each of the
3259 initialization arguments. */
3260 for (value
= TREE_VALUE (arg
); value
; value
= TREE_CHAIN (value
))
3262 /* Determine which parameter packs will be expanded in this
3264 cp_walk_tree (&TREE_VALUE (value
), &find_parameter_packs_r
,
3269 pointer_set_destroy (ppd
.visited
);
3271 /* Create the pack expansion type for the base type. */
3272 purpose
= cxx_make_type (TYPE_PACK_EXPANSION
);
3273 SET_PACK_EXPANSION_PATTERN (purpose
, TREE_PURPOSE (arg
));
3274 PACK_EXPANSION_PARAMETER_PACKS (purpose
) = parameter_packs
;
3276 /* Just use structural equality for these TYPE_PACK_EXPANSIONS;
3277 they will rarely be compared to anything. */
3278 SET_TYPE_STRUCTURAL_EQUALITY (purpose
);
3280 return tree_cons (purpose
, TREE_VALUE (arg
), NULL_TREE
);
3283 if (TYPE_P (arg
) || TREE_CODE (arg
) == TEMPLATE_DECL
)
3286 /* Build the PACK_EXPANSION_* node. */
3288 ? cxx_make_type (TYPE_PACK_EXPANSION
)
3289 : make_node (EXPR_PACK_EXPANSION
);
3290 SET_PACK_EXPANSION_PATTERN (result
, arg
);
3291 if (TREE_CODE (result
) == EXPR_PACK_EXPANSION
)
3293 /* Propagate type and const-expression information. */
3294 TREE_TYPE (result
) = TREE_TYPE (arg
);
3295 TREE_CONSTANT (result
) = TREE_CONSTANT (arg
);
3298 /* Just use structural equality for these TYPE_PACK_EXPANSIONS;
3299 they will rarely be compared to anything. */
3300 SET_TYPE_STRUCTURAL_EQUALITY (result
);
3302 /* Determine which parameter packs will be expanded. */
3303 ppd
.parameter_packs
= ¶meter_packs
;
3304 ppd
.visited
= pointer_set_create ();
3305 cp_walk_tree (&arg
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
3306 pointer_set_destroy (ppd
.visited
);
3308 /* Make sure we found some parameter packs. */
3309 if (parameter_packs
== NULL_TREE
)
3312 error ("expansion pattern %<%T%> contains no argument packs", arg
);
3314 error ("expansion pattern %<%E%> contains no argument packs", arg
);
3315 return error_mark_node
;
3317 PACK_EXPANSION_PARAMETER_PACKS (result
) = parameter_packs
;
3319 PACK_EXPANSION_LOCAL_P (result
) = at_function_scope_p ();
3324 /* Checks T for any "bare" parameter packs, which have not yet been
3325 expanded, and issues an error if any are found. This operation can
3326 only be done on full expressions or types (e.g., an expression
3327 statement, "if" condition, etc.), because we could have expressions like:
3329 foo(f(g(h(args)))...)
3331 where "args" is a parameter pack. check_for_bare_parameter_packs
3332 should not be called for the subexpressions args, h(args),
3333 g(h(args)), or f(g(h(args))), because we would produce erroneous
3336 Returns TRUE and emits an error if there were bare parameter packs,
3337 returns FALSE otherwise. */
3339 check_for_bare_parameter_packs (tree t
)
3341 tree parameter_packs
= NULL_TREE
;
3342 struct find_parameter_pack_data ppd
;
3344 if (!processing_template_decl
|| !t
|| t
== error_mark_node
)
3347 if (TREE_CODE (t
) == TYPE_DECL
)
3350 ppd
.parameter_packs
= ¶meter_packs
;
3351 ppd
.visited
= pointer_set_create ();
3352 cp_walk_tree (&t
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
3353 pointer_set_destroy (ppd
.visited
);
3355 if (parameter_packs
)
3357 error ("parameter packs not expanded with %<...%>:");
3358 while (parameter_packs
)
3360 tree pack
= TREE_VALUE (parameter_packs
);
3361 tree name
= NULL_TREE
;
3363 if (TREE_CODE (pack
) == TEMPLATE_TYPE_PARM
3364 || TREE_CODE (pack
) == TEMPLATE_TEMPLATE_PARM
)
3365 name
= TYPE_NAME (pack
);
3366 else if (TREE_CODE (pack
) == TEMPLATE_PARM_INDEX
)
3367 name
= DECL_NAME (TEMPLATE_PARM_DECL (pack
));
3369 name
= DECL_NAME (pack
);
3372 inform (input_location
, " %qD", name
);
3374 inform (input_location
, " <anonymous>");
3376 parameter_packs
= TREE_CHAIN (parameter_packs
);
3385 /* Expand any parameter packs that occur in the template arguments in
3388 expand_template_argument_pack (tree args
)
3390 tree result_args
= NULL_TREE
;
3391 int in_arg
, out_arg
= 0, nargs
= args
? TREE_VEC_LENGTH (args
) : 0;
3392 int num_result_args
= -1;
3393 int non_default_args_count
= -1;
3395 /* First, determine if we need to expand anything, and the number of
3396 slots we'll need. */
3397 for (in_arg
= 0; in_arg
< nargs
; ++in_arg
)
3399 tree arg
= TREE_VEC_ELT (args
, in_arg
);
3400 if (arg
== NULL_TREE
)
3402 if (ARGUMENT_PACK_P (arg
))
3404 int num_packed
= TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg
));
3405 if (num_result_args
< 0)
3406 num_result_args
= in_arg
+ num_packed
;
3408 num_result_args
+= num_packed
;
3412 if (num_result_args
>= 0)
3417 /* If no expansion is necessary, we're done. */
3418 if (num_result_args
< 0)
3421 /* Expand arguments. */
3422 result_args
= make_tree_vec (num_result_args
);
3423 if (NON_DEFAULT_TEMPLATE_ARGS_COUNT (args
))
3424 non_default_args_count
=
3425 GET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (args
);
3426 for (in_arg
= 0; in_arg
< nargs
; ++in_arg
)
3428 tree arg
= TREE_VEC_ELT (args
, in_arg
);
3429 if (ARGUMENT_PACK_P (arg
))
3431 tree packed
= ARGUMENT_PACK_ARGS (arg
);
3432 int i
, num_packed
= TREE_VEC_LENGTH (packed
);
3433 for (i
= 0; i
< num_packed
; ++i
, ++out_arg
)
3434 TREE_VEC_ELT (result_args
, out_arg
) = TREE_VEC_ELT(packed
, i
);
3435 if (non_default_args_count
> 0)
3436 non_default_args_count
+= num_packed
;
3440 TREE_VEC_ELT (result_args
, out_arg
) = arg
;
3444 if (non_default_args_count
>= 0)
3445 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (result_args
, non_default_args_count
);
3449 /* Checks if DECL shadows a template parameter.
3451 [temp.local]: A template-parameter shall not be redeclared within its
3452 scope (including nested scopes).
3454 Emits an error and returns TRUE if the DECL shadows a parameter,
3455 returns FALSE otherwise. */
3458 check_template_shadow (tree decl
)
3462 /* If we're not in a template, we can't possibly shadow a template
3464 if (!current_template_parms
)
3467 /* Figure out what we're shadowing. */
3468 if (TREE_CODE (decl
) == OVERLOAD
)
3469 decl
= OVL_CURRENT (decl
);
3470 olddecl
= innermost_non_namespace_value (DECL_NAME (decl
));
3472 /* If there's no previous binding for this name, we're not shadowing
3473 anything, let alone a template parameter. */
3477 /* If we're not shadowing a template parameter, we're done. Note
3478 that OLDDECL might be an OVERLOAD (or perhaps even an
3479 ERROR_MARK), so we can't just blithely assume it to be a _DECL
3481 if (!DECL_P (olddecl
) || !DECL_TEMPLATE_PARM_P (olddecl
))
3484 /* We check for decl != olddecl to avoid bogus errors for using a
3485 name inside a class. We check TPFI to avoid duplicate errors for
3486 inline member templates. */
3488 || TEMPLATE_PARMS_FOR_INLINE (current_template_parms
))
3491 error ("declaration of %q+#D", decl
);
3492 error (" shadows template parm %q+#D", olddecl
);
3496 /* Return a new TEMPLATE_PARM_INDEX with the indicated INDEX, LEVEL,
3497 ORIG_LEVEL, DECL, and TYPE. */
3500 build_template_parm_index (int index
,
3506 tree t
= make_node (TEMPLATE_PARM_INDEX
);
3507 TEMPLATE_PARM_IDX (t
) = index
;
3508 TEMPLATE_PARM_LEVEL (t
) = level
;
3509 TEMPLATE_PARM_ORIG_LEVEL (t
) = orig_level
;
3510 TEMPLATE_PARM_DECL (t
) = decl
;
3511 TREE_TYPE (t
) = type
;
3512 TREE_CONSTANT (t
) = TREE_CONSTANT (decl
);
3513 TREE_READONLY (t
) = TREE_READONLY (decl
);
3518 /* Find the canonical type parameter for the given template type
3519 parameter. Returns the canonical type parameter, which may be TYPE
3520 if no such parameter existed. */
3523 canonical_type_parameter (tree type
)
3526 int idx
= TEMPLATE_TYPE_IDX (type
);
3527 if (!canonical_template_parms
)
3528 vec_alloc (canonical_template_parms
, idx
+1);
3530 while (canonical_template_parms
->length () <= (unsigned)idx
)
3531 vec_safe_push (canonical_template_parms
, NULL_TREE
);
3533 list
= (*canonical_template_parms
)[idx
];
3534 while (list
&& !comptypes (type
, TREE_VALUE (list
), COMPARE_STRUCTURAL
))
3535 list
= TREE_CHAIN (list
);
3538 return TREE_VALUE (list
);
3541 (*canonical_template_parms
)[idx
]
3542 = tree_cons (NULL_TREE
, type
,
3543 (*canonical_template_parms
)[idx
]);
3548 /* Return a TEMPLATE_PARM_INDEX, similar to INDEX, but whose
3549 TEMPLATE_PARM_LEVEL has been decreased by LEVELS. If such a
3550 TEMPLATE_PARM_INDEX already exists, it is returned; otherwise, a
3551 new one is created. */
3554 reduce_template_parm_level (tree index
, tree type
, int levels
, tree args
,
3555 tsubst_flags_t complain
)
3557 if (TEMPLATE_PARM_DESCENDANTS (index
) == NULL_TREE
3558 || (TEMPLATE_PARM_LEVEL (TEMPLATE_PARM_DESCENDANTS (index
))
3559 != TEMPLATE_PARM_LEVEL (index
) - levels
)
3560 || !same_type_p (type
, TREE_TYPE (TEMPLATE_PARM_DESCENDANTS (index
))))
3562 tree orig_decl
= TEMPLATE_PARM_DECL (index
);
3565 decl
= build_decl (DECL_SOURCE_LOCATION (orig_decl
),
3566 TREE_CODE (orig_decl
), DECL_NAME (orig_decl
), type
);
3567 TREE_CONSTANT (decl
) = TREE_CONSTANT (orig_decl
);
3568 TREE_READONLY (decl
) = TREE_READONLY (orig_decl
);
3569 DECL_ARTIFICIAL (decl
) = 1;
3570 SET_DECL_TEMPLATE_PARM_P (decl
);
3572 t
= build_template_parm_index (TEMPLATE_PARM_IDX (index
),
3573 TEMPLATE_PARM_LEVEL (index
) - levels
,
3574 TEMPLATE_PARM_ORIG_LEVEL (index
),
3576 TEMPLATE_PARM_DESCENDANTS (index
) = t
;
3577 TEMPLATE_PARM_PARAMETER_PACK (t
)
3578 = TEMPLATE_PARM_PARAMETER_PACK (index
);
3580 /* Template template parameters need this. */
3581 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
3582 DECL_TEMPLATE_PARMS (decl
) = tsubst_template_parms
3583 (DECL_TEMPLATE_PARMS (TEMPLATE_PARM_DECL (index
)),
3587 return TEMPLATE_PARM_DESCENDANTS (index
);
3590 /* Process information from new template parameter PARM and append it
3591 to the LIST being built. This new parameter is a non-type
3592 parameter iff IS_NON_TYPE is true. This new parameter is a
3593 parameter pack iff IS_PARAMETER_PACK is true. The location of PARM
3594 is in PARM_LOC. NUM_TEMPLATE_PARMS is the size of the template
3595 parameter list PARM belongs to. This is used used to create a
3596 proper canonical type for the type of PARM that is to be created,
3597 iff PARM is a type. If the size is not known, this parameter shall
3601 process_template_parm (tree list
, location_t parm_loc
, tree parm
,
3602 bool is_non_type
, bool is_parameter_pack
)
3609 gcc_assert (TREE_CODE (parm
) == TREE_LIST
);
3610 defval
= TREE_PURPOSE (parm
);
3614 tree p
= tree_last (list
);
3616 if (p
&& TREE_VALUE (p
) != error_mark_node
)
3619 if (TREE_CODE (p
) == TYPE_DECL
|| TREE_CODE (p
) == TEMPLATE_DECL
)
3620 idx
= TEMPLATE_TYPE_IDX (TREE_TYPE (p
));
3622 idx
= TEMPLATE_PARM_IDX (DECL_INITIAL (p
));
3632 parm
= TREE_VALUE (parm
);
3634 SET_DECL_TEMPLATE_PARM_P (parm
);
3636 if (TREE_TYPE (parm
) == error_mark_node
)
3638 err_parm_list
= build_tree_list (defval
, parm
);
3639 TREE_VALUE (err_parm_list
) = error_mark_node
;
3640 return chainon (list
, err_parm_list
);
3646 The top-level cv-qualifiers on the template-parameter are
3647 ignored when determining its type. */
3648 TREE_TYPE (parm
) = TYPE_MAIN_VARIANT (TREE_TYPE (parm
));
3649 if (invalid_nontype_parm_type_p (TREE_TYPE (parm
), 1))
3651 err_parm_list
= build_tree_list (defval
, parm
);
3652 TREE_VALUE (err_parm_list
) = error_mark_node
;
3653 return chainon (list
, err_parm_list
);
3656 if (uses_parameter_packs (TREE_TYPE (parm
)) && !is_parameter_pack
)
3658 /* This template parameter is not a parameter pack, but it
3659 should be. Complain about "bare" parameter packs. */
3660 check_for_bare_parameter_packs (TREE_TYPE (parm
));
3662 /* Recover by calling this a parameter pack. */
3663 is_parameter_pack
= true;
3667 /* A template parameter is not modifiable. */
3668 TREE_CONSTANT (parm
) = 1;
3669 TREE_READONLY (parm
) = 1;
3670 decl
= build_decl (parm_loc
,
3671 CONST_DECL
, DECL_NAME (parm
), TREE_TYPE (parm
));
3672 TREE_CONSTANT (decl
) = 1;
3673 TREE_READONLY (decl
) = 1;
3674 DECL_INITIAL (parm
) = DECL_INITIAL (decl
)
3675 = build_template_parm_index (idx
, processing_template_decl
,
3676 processing_template_decl
,
3677 decl
, TREE_TYPE (parm
));
3679 TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
))
3680 = is_parameter_pack
;
3685 parm
= TREE_VALUE (TREE_VALUE (parm
));
3687 if (parm
&& TREE_CODE (parm
) == TEMPLATE_DECL
)
3689 t
= cxx_make_type (TEMPLATE_TEMPLATE_PARM
);
3690 /* This is for distinguishing between real templates and template
3691 template parameters */
3692 TREE_TYPE (parm
) = t
;
3693 TREE_TYPE (DECL_TEMPLATE_RESULT (parm
)) = t
;
3698 t
= cxx_make_type (TEMPLATE_TYPE_PARM
);
3699 /* parm is either IDENTIFIER_NODE or NULL_TREE. */
3700 decl
= build_decl (parm_loc
,
3701 TYPE_DECL
, parm
, t
);
3704 TYPE_NAME (t
) = decl
;
3705 TYPE_STUB_DECL (t
) = decl
;
3707 TEMPLATE_TYPE_PARM_INDEX (t
)
3708 = build_template_parm_index (idx
, processing_template_decl
,
3709 processing_template_decl
,
3710 decl
, TREE_TYPE (parm
));
3711 TEMPLATE_TYPE_PARAMETER_PACK (t
) = is_parameter_pack
;
3712 TYPE_CANONICAL (t
) = canonical_type_parameter (t
);
3714 DECL_ARTIFICIAL (decl
) = 1;
3715 SET_DECL_TEMPLATE_PARM_P (decl
);
3717 parm
= build_tree_list (defval
, parm
);
3718 return chainon (list
, parm
);
3721 /* The end of a template parameter list has been reached. Process the
3722 tree list into a parameter vector, converting each parameter into a more
3723 useful form. Type parameters are saved as IDENTIFIER_NODEs, and others
3727 end_template_parm_list (tree parms
)
3731 tree saved_parmlist
= make_tree_vec (list_length (parms
));
3733 current_template_parms
3734 = tree_cons (size_int (processing_template_decl
),
3735 saved_parmlist
, current_template_parms
);
3737 for (parm
= parms
, nparms
= 0; parm
; parm
= next
, nparms
++)
3739 next
= TREE_CHAIN (parm
);
3740 TREE_VEC_ELT (saved_parmlist
, nparms
) = parm
;
3741 TREE_CHAIN (parm
) = NULL_TREE
;
3744 --processing_template_parmlist
;
3746 return saved_parmlist
;
3749 /* end_template_decl is called after a template declaration is seen. */
3752 end_template_decl (void)
3754 reset_specialization ();
3756 if (! processing_template_decl
)
3759 /* This matches the pushlevel in begin_template_parm_list. */
3762 --processing_template_decl
;
3763 current_template_parms
= TREE_CHAIN (current_template_parms
);
3766 /* Takes a TREE_LIST representing a template parameter and convert it
3767 into an argument suitable to be passed to the type substitution
3768 functions. Note that If the TREE_LIST contains an error_mark
3769 node, the returned argument is error_mark_node. */
3772 template_parm_to_arg (tree t
)
3776 || TREE_CODE (t
) != TREE_LIST
)
3779 if (error_operand_p (TREE_VALUE (t
)))
3780 return error_mark_node
;
3784 if (TREE_CODE (t
) == TYPE_DECL
3785 || TREE_CODE (t
) == TEMPLATE_DECL
)
3789 if (TEMPLATE_TYPE_PARAMETER_PACK (t
))
3791 /* Turn this argument into a TYPE_ARGUMENT_PACK
3792 with a single element, which expands T. */
3793 tree vec
= make_tree_vec (1);
3794 #ifdef ENABLE_CHECKING
3795 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT
3796 (vec
, TREE_VEC_LENGTH (vec
));
3798 TREE_VEC_ELT (vec
, 0) = make_pack_expansion (t
);
3800 t
= cxx_make_type (TYPE_ARGUMENT_PACK
);
3801 SET_ARGUMENT_PACK_ARGS (t
, vec
);
3806 t
= DECL_INITIAL (t
);
3808 if (TEMPLATE_PARM_PARAMETER_PACK (t
))
3810 /* Turn this argument into a NONTYPE_ARGUMENT_PACK
3811 with a single element, which expands T. */
3812 tree vec
= make_tree_vec (1);
3813 tree type
= TREE_TYPE (TEMPLATE_PARM_DECL (t
));
3814 #ifdef ENABLE_CHECKING
3815 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT
3816 (vec
, TREE_VEC_LENGTH (vec
));
3818 TREE_VEC_ELT (vec
, 0) = make_pack_expansion (t
);
3820 t
= make_node (NONTYPE_ARGUMENT_PACK
);
3821 SET_ARGUMENT_PACK_ARGS (t
, vec
);
3822 TREE_TYPE (t
) = type
;
3828 /* Given a set of template parameters, return them as a set of template
3829 arguments. The template parameters are represented as a TREE_VEC, in
3830 the form documented in cp-tree.h for template arguments. */
3833 template_parms_to_args (tree parms
)
3836 tree args
= NULL_TREE
;
3837 int length
= TMPL_PARMS_DEPTH (parms
);
3840 /* If there is only one level of template parameters, we do not
3841 create a TREE_VEC of TREE_VECs. Instead, we return a single
3842 TREE_VEC containing the arguments. */
3844 args
= make_tree_vec (length
);
3846 for (header
= parms
; header
; header
= TREE_CHAIN (header
))
3848 tree a
= copy_node (TREE_VALUE (header
));
3851 TREE_TYPE (a
) = NULL_TREE
;
3852 for (i
= TREE_VEC_LENGTH (a
) - 1; i
>= 0; --i
)
3853 TREE_VEC_ELT (a
, i
) = template_parm_to_arg (TREE_VEC_ELT (a
, i
));
3855 #ifdef ENABLE_CHECKING
3856 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (a
, TREE_VEC_LENGTH (a
));
3860 TREE_VEC_ELT (args
, --l
) = a
;
3865 if (length
> 1 && TREE_VEC_ELT (args
, 0) == NULL_TREE
)
3866 /* This can happen for template parms of a template template
3869 template<template<class T, class U> class TT> struct S;
3871 Consider the level of the parms of TT; T and U both have
3872 level 2; TT has no template parm of level 1. So in this case
3873 the first element of full_template_args is NULL_TREE. If we
3874 leave it like this TMPL_ARGS_DEPTH on args returns 1 instead
3875 of 2. This will make tsubst wrongly consider that T and U
3876 have level 1. Instead, let's create a dummy vector as the
3877 first element of full_template_args so that TMPL_ARGS_DEPTH
3878 returns the correct depth for args. */
3879 TREE_VEC_ELT (args
, 0) = make_tree_vec (1);
3883 /* Within the declaration of a template, return the currently active
3884 template parameters as an argument TREE_VEC. */
3887 current_template_args (void)
3889 return template_parms_to_args (current_template_parms
);
3892 /* Update the declared TYPE by doing any lookups which were thought to be
3893 dependent, but are not now that we know the SCOPE of the declarator. */
3896 maybe_update_decl_type (tree orig_type
, tree scope
)
3898 tree type
= orig_type
;
3900 if (type
== NULL_TREE
)
3903 if (TREE_CODE (orig_type
) == TYPE_DECL
)
3904 type
= TREE_TYPE (type
);
3906 if (scope
&& TYPE_P (scope
) && dependent_type_p (scope
)
3907 && dependent_type_p (type
)
3908 /* Don't bother building up the args in this case. */
3909 && TREE_CODE (type
) != TEMPLATE_TYPE_PARM
)
3911 /* tsubst in the args corresponding to the template parameters,
3912 including auto if present. Most things will be unchanged, but
3913 make_typename_type and tsubst_qualified_id will resolve
3914 TYPENAME_TYPEs and SCOPE_REFs that were previously dependent. */
3915 tree args
= current_template_args ();
3916 tree auto_node
= type_uses_auto (type
);
3920 tree auto_vec
= make_tree_vec (1);
3921 TREE_VEC_ELT (auto_vec
, 0) = auto_node
;
3922 args
= add_to_template_args (args
, auto_vec
);
3924 pushed
= push_scope (scope
);
3925 type
= tsubst (type
, args
, tf_warning_or_error
, NULL_TREE
);
3930 if (type
== error_mark_node
)
3933 if (TREE_CODE (orig_type
) == TYPE_DECL
)
3935 if (same_type_p (type
, TREE_TYPE (orig_type
)))
3938 type
= TYPE_NAME (type
);
3943 /* Return a TEMPLATE_DECL corresponding to DECL, using the indicated
3944 template PARMS. If MEMBER_TEMPLATE_P is true, the new template is
3945 a member template. Used by push_template_decl below. */
3948 build_template_decl (tree decl
, tree parms
, bool member_template_p
)
3950 tree tmpl
= build_lang_decl (TEMPLATE_DECL
, DECL_NAME (decl
), NULL_TREE
);
3951 DECL_TEMPLATE_PARMS (tmpl
) = parms
;
3952 DECL_CONTEXT (tmpl
) = DECL_CONTEXT (decl
);
3953 DECL_SOURCE_LOCATION (tmpl
) = DECL_SOURCE_LOCATION (decl
);
3954 DECL_MEMBER_TEMPLATE_P (tmpl
) = member_template_p
;
3959 struct template_parm_data
3961 /* The level of the template parameters we are currently
3965 /* The index of the specialization argument we are currently
3969 /* An array whose size is the number of template parameters. The
3970 elements are nonzero if the parameter has been used in any one
3971 of the arguments processed so far. */
3974 /* An array whose size is the number of template arguments. The
3975 elements are nonzero if the argument makes use of template
3976 parameters of this level. */
3977 int* arg_uses_template_parms
;
3980 /* Subroutine of push_template_decl used to see if each template
3981 parameter in a partial specialization is used in the explicit
3982 argument list. If T is of the LEVEL given in DATA (which is
3983 treated as a template_parm_data*), then DATA->PARMS is marked
3987 mark_template_parm (tree t
, void* data
)
3991 struct template_parm_data
* tpd
= (struct template_parm_data
*) data
;
3993 if (TREE_CODE (t
) == TEMPLATE_PARM_INDEX
)
3995 level
= TEMPLATE_PARM_LEVEL (t
);
3996 idx
= TEMPLATE_PARM_IDX (t
);
4000 level
= TEMPLATE_TYPE_LEVEL (t
);
4001 idx
= TEMPLATE_TYPE_IDX (t
);
4004 if (level
== tpd
->level
)
4006 tpd
->parms
[idx
] = 1;
4007 tpd
->arg_uses_template_parms
[tpd
->current_arg
] = 1;
4010 /* Return zero so that for_each_template_parm will continue the
4011 traversal of the tree; we want to mark *every* template parm. */
4015 /* Process the partial specialization DECL. */
4018 process_partial_specialization (tree decl
)
4020 tree type
= TREE_TYPE (decl
);
4021 tree maintmpl
= CLASSTYPE_TI_TEMPLATE (type
);
4022 tree specargs
= CLASSTYPE_TI_ARGS (type
);
4023 tree inner_args
= INNERMOST_TEMPLATE_ARGS (specargs
);
4024 tree main_inner_parms
= DECL_INNERMOST_TEMPLATE_PARMS (maintmpl
);
4027 int nargs
= TREE_VEC_LENGTH (inner_args
);
4030 bool did_error_intro
= false;
4031 struct template_parm_data tpd
;
4032 struct template_parm_data tpd2
;
4034 gcc_assert (current_template_parms
);
4036 inner_parms
= INNERMOST_TEMPLATE_PARMS (current_template_parms
);
4037 ntparms
= TREE_VEC_LENGTH (inner_parms
);
4039 /* We check that each of the template parameters given in the
4040 partial specialization is used in the argument list to the
4041 specialization. For example:
4043 template <class T> struct S;
4044 template <class T> struct S<T*>;
4046 The second declaration is OK because `T*' uses the template
4047 parameter T, whereas
4049 template <class T> struct S<int>;
4051 is no good. Even trickier is:
4062 The S2<T> declaration is actually invalid; it is a
4063 full-specialization. Of course,
4066 struct S2<T (*)(U)>;
4068 or some such would have been OK. */
4069 tpd
.level
= TMPL_PARMS_DEPTH (current_template_parms
);
4070 tpd
.parms
= XALLOCAVEC (int, ntparms
);
4071 memset (tpd
.parms
, 0, sizeof (int) * ntparms
);
4073 tpd
.arg_uses_template_parms
= XALLOCAVEC (int, nargs
);
4074 memset (tpd
.arg_uses_template_parms
, 0, sizeof (int) * nargs
);
4075 for (i
= 0; i
< nargs
; ++i
)
4077 tpd
.current_arg
= i
;
4078 for_each_template_parm (TREE_VEC_ELT (inner_args
, i
),
4079 &mark_template_parm
,
4082 /*include_nondeduced_p=*/false);
4084 for (i
= 0; i
< ntparms
; ++i
)
4085 if (tpd
.parms
[i
] == 0)
4087 /* One of the template parms was not used in the
4089 if (!did_error_intro
)
4091 error ("template parameters not used in partial specialization:");
4092 did_error_intro
= true;
4095 error (" %qD", TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
)));
4098 if (did_error_intro
)
4099 return error_mark_node
;
4101 /* [temp.class.spec]
4103 The argument list of the specialization shall not be identical to
4104 the implicit argument list of the primary template. */
4105 if (comp_template_args
4107 INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE
4109 error ("partial specialization %qT does not specialize any template arguments", type
);
4111 /* A partial specialization that replaces multiple parameters of the
4112 primary template with a pack expansion is less specialized for those
4114 if (nargs
< DECL_NTPARMS (maintmpl
))
4116 error ("partial specialization is not more specialized than the "
4117 "primary template because it replaces multiple parameters "
4118 "with a pack expansion");
4119 inform (DECL_SOURCE_LOCATION (maintmpl
), "primary template here");
4123 /* [temp.class.spec]
4125 A partially specialized non-type argument expression shall not
4126 involve template parameters of the partial specialization except
4127 when the argument expression is a simple identifier.
4129 The type of a template parameter corresponding to a specialized
4130 non-type argument shall not be dependent on a parameter of the
4133 Also, we verify that pack expansions only occur at the
4134 end of the argument list. */
4135 gcc_assert (nargs
== DECL_NTPARMS (maintmpl
));
4137 for (i
= 0; i
< nargs
; ++i
)
4139 tree parm
= TREE_VALUE (TREE_VEC_ELT (main_inner_parms
, i
));
4140 tree arg
= TREE_VEC_ELT (inner_args
, i
);
4141 tree packed_args
= NULL_TREE
;
4144 if (ARGUMENT_PACK_P (arg
))
4146 /* Extract the arguments from the argument pack. We'll be
4147 iterating over these in the following loop. */
4148 packed_args
= ARGUMENT_PACK_ARGS (arg
);
4149 len
= TREE_VEC_LENGTH (packed_args
);
4152 for (j
= 0; j
< len
; j
++)
4155 /* Get the Jth argument in the parameter pack. */
4156 arg
= TREE_VEC_ELT (packed_args
, j
);
4158 if (PACK_EXPANSION_P (arg
))
4160 /* Pack expansions must come at the end of the
4162 if ((packed_args
&& j
< len
- 1)
4163 || (!packed_args
&& i
< nargs
- 1))
4165 if (TREE_CODE (arg
) == EXPR_PACK_EXPANSION
)
4166 error ("parameter pack argument %qE must be at the "
4167 "end of the template argument list", arg
);
4169 error ("parameter pack argument %qT must be at the "
4170 "end of the template argument list", arg
);
4174 if (TREE_CODE (arg
) == EXPR_PACK_EXPANSION
)
4175 /* We only care about the pattern. */
4176 arg
= PACK_EXPANSION_PATTERN (arg
);
4178 if (/* These first two lines are the `non-type' bit. */
4180 && TREE_CODE (arg
) != TEMPLATE_DECL
4181 /* This next line is the `argument expression is not just a
4182 simple identifier' condition and also the `specialized
4183 non-type argument' bit. */
4184 && TREE_CODE (arg
) != TEMPLATE_PARM_INDEX
)
4186 if ((!packed_args
&& tpd
.arg_uses_template_parms
[i
])
4187 || (packed_args
&& uses_template_parms (arg
)))
4188 error ("template argument %qE involves template parameter(s)",
4192 /* Look at the corresponding template parameter,
4193 marking which template parameters its type depends
4195 tree type
= TREE_TYPE (parm
);
4199 /* We haven't yet initialized TPD2. Do so now. */
4200 tpd2
.arg_uses_template_parms
= XALLOCAVEC (int, nargs
);
4201 /* The number of parameters here is the number in the
4202 main template, which, as checked in the assertion
4204 tpd2
.parms
= XALLOCAVEC (int, nargs
);
4206 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (maintmpl
));
4209 /* Mark the template parameters. But this time, we're
4210 looking for the template parameters of the main
4211 template, not in the specialization. */
4212 tpd2
.current_arg
= i
;
4213 tpd2
.arg_uses_template_parms
[i
] = 0;
4214 memset (tpd2
.parms
, 0, sizeof (int) * nargs
);
4215 for_each_template_parm (type
,
4216 &mark_template_parm
,
4219 /*include_nondeduced_p=*/false);
4221 if (tpd2
.arg_uses_template_parms
[i
])
4223 /* The type depended on some template parameters.
4224 If they are fully specialized in the
4225 specialization, that's OK. */
4228 for (j
= 0; j
< nargs
; ++j
)
4229 if (tpd2
.parms
[j
] != 0
4230 && tpd
.arg_uses_template_parms
[j
])
4233 error_n (input_location
, count
,
4234 "type %qT of template argument %qE depends "
4235 "on a template parameter",
4236 "type %qT of template argument %qE depends "
4237 "on template parameters",
4246 /* We should only get here once. */
4247 gcc_assert (!COMPLETE_TYPE_P (type
));
4249 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)
4250 = tree_cons (specargs
, inner_parms
,
4251 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
));
4252 TREE_TYPE (DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)) = type
;
4254 for (inst
= DECL_TEMPLATE_INSTANTIATIONS (maintmpl
); inst
;
4255 inst
= TREE_CHAIN (inst
))
4257 tree inst_type
= TREE_VALUE (inst
);
4258 if (COMPLETE_TYPE_P (inst_type
)
4259 && CLASSTYPE_IMPLICIT_INSTANTIATION (inst_type
))
4261 tree spec
= most_specialized_class (inst_type
, maintmpl
, tf_none
);
4262 if (spec
&& TREE_TYPE (spec
) == type
)
4263 permerror (input_location
,
4264 "partial specialization of %qT after instantiation "
4265 "of %qT", type
, inst_type
);
4272 /* Check that a template declaration's use of default arguments and
4273 parameter packs is not invalid. Here, PARMS are the template
4274 parameters. IS_PRIMARY is true if DECL is the thing declared by
4275 a primary template. IS_PARTIAL is true if DECL is a partial
4278 IS_FRIEND_DECL is nonzero if DECL is a friend function template
4279 declaration (but not a definition); 1 indicates a declaration, 2
4280 indicates a redeclaration. When IS_FRIEND_DECL=2, no errors are
4281 emitted for extraneous default arguments.
4283 Returns TRUE if there were no errors found, FALSE otherwise. */
4286 check_default_tmpl_args (tree decl
, tree parms
, bool is_primary
,
4287 bool is_partial
, int is_friend_decl
)
4290 int last_level_to_check
;
4292 bool no_errors
= true;
4296 A default template-argument shall not be specified in a
4297 function template declaration or a function template definition, nor
4298 in the template-parameter-list of the definition of a member of a
4301 if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == FUNCTION_DECL
)
4302 /* You can't have a function template declaration in a local
4303 scope, nor you can you define a member of a class template in a
4307 if (TREE_CODE (decl
) == TYPE_DECL
4309 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
4310 /* A lambda doesn't have an explicit declaration; don't complain
4311 about the parms of the enclosing class. */
4314 if (current_class_type
4315 && !TYPE_BEING_DEFINED (current_class_type
)
4316 && DECL_LANG_SPECIFIC (decl
)
4317 && DECL_DECLARES_FUNCTION_P (decl
)
4318 /* If this is either a friend defined in the scope of the class
4319 or a member function. */
4320 && (DECL_FUNCTION_MEMBER_P (decl
)
4321 ? same_type_p (DECL_CONTEXT (decl
), current_class_type
)
4322 : DECL_FRIEND_CONTEXT (decl
)
4323 ? same_type_p (DECL_FRIEND_CONTEXT (decl
), current_class_type
)
4325 /* And, if it was a member function, it really was defined in
4326 the scope of the class. */
4327 && (!DECL_FUNCTION_MEMBER_P (decl
)
4328 || DECL_INITIALIZED_IN_CLASS_P (decl
)))
4329 /* We already checked these parameters when the template was
4330 declared, so there's no need to do it again now. This function
4331 was defined in class scope, but we're processing it's body now
4332 that the class is complete. */
4335 /* Core issue 226 (C++0x only): the following only applies to class
4338 && ((cxx_dialect
== cxx98
) || TREE_CODE (decl
) != FUNCTION_DECL
))
4342 If a template-parameter has a default template-argument, all
4343 subsequent template-parameters shall have a default
4344 template-argument supplied. */
4345 for (parm_level
= parms
; parm_level
; parm_level
= TREE_CHAIN (parm_level
))
4347 tree inner_parms
= TREE_VALUE (parm_level
);
4348 int ntparms
= TREE_VEC_LENGTH (inner_parms
);
4349 int seen_def_arg_p
= 0;
4352 for (i
= 0; i
< ntparms
; ++i
)
4354 tree parm
= TREE_VEC_ELT (inner_parms
, i
);
4356 if (parm
== error_mark_node
)
4359 if (TREE_PURPOSE (parm
))
4361 else if (seen_def_arg_p
4362 && !template_parameter_pack_p (TREE_VALUE (parm
)))
4364 error ("no default argument for %qD", TREE_VALUE (parm
));
4365 /* For better subsequent error-recovery, we indicate that
4366 there should have been a default argument. */
4367 TREE_PURPOSE (parm
) = error_mark_node
;
4370 else if (!is_partial
4372 /* Don't complain about an enclosing partial
4374 && parm_level
== parms
4375 && TREE_CODE (decl
) == TYPE_DECL
4377 && template_parameter_pack_p (TREE_VALUE (parm
)))
4379 /* A primary class template can only have one
4380 parameter pack, at the end of the template
4383 if (TREE_CODE (TREE_VALUE (parm
)) == PARM_DECL
)
4384 error ("parameter pack %qE must be at the end of the"
4385 " template parameter list", TREE_VALUE (parm
));
4387 error ("parameter pack %qT must be at the end of the"
4388 " template parameter list",
4389 TREE_TYPE (TREE_VALUE (parm
)));
4391 TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
))
4399 if (((cxx_dialect
== cxx98
) && TREE_CODE (decl
) != TYPE_DECL
)
4403 /* For an ordinary class template, default template arguments are
4404 allowed at the innermost level, e.g.:
4405 template <class T = int>
4407 but, in a partial specialization, they're not allowed even
4408 there, as we have in [temp.class.spec]:
4410 The template parameter list of a specialization shall not
4411 contain default template argument values.
4413 So, for a partial specialization, or for a function template
4414 (in C++98/C++03), we look at all of them. */
4417 /* But, for a primary class template that is not a partial
4418 specialization we look at all template parameters except the
4420 parms
= TREE_CHAIN (parms
);
4422 /* Figure out what error message to issue. */
4423 if (is_friend_decl
== 2)
4424 msg
= G_("default template arguments may not be used in function template "
4425 "friend re-declaration");
4426 else if (is_friend_decl
)
4427 msg
= G_("default template arguments may not be used in function template "
4428 "friend declarations");
4429 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& (cxx_dialect
== cxx98
))
4430 msg
= G_("default template arguments may not be used in function templates "
4431 "without -std=c++11 or -std=gnu++11");
4432 else if (is_partial
)
4433 msg
= G_("default template arguments may not be used in "
4434 "partial specializations");
4436 msg
= G_("default argument for template parameter for class enclosing %qD");
4438 if (current_class_type
&& TYPE_BEING_DEFINED (current_class_type
))
4439 /* If we're inside a class definition, there's no need to
4440 examine the parameters to the class itself. On the one
4441 hand, they will be checked when the class is defined, and,
4442 on the other, default arguments are valid in things like:
4443 template <class T = double>
4444 struct S { template <class U> void f(U); };
4445 Here the default argument for `S' has no bearing on the
4446 declaration of `f'. */
4447 last_level_to_check
= template_class_depth (current_class_type
) + 1;
4449 /* Check everything. */
4450 last_level_to_check
= 0;
4452 for (parm_level
= parms
;
4453 parm_level
&& TMPL_PARMS_DEPTH (parm_level
) >= last_level_to_check
;
4454 parm_level
= TREE_CHAIN (parm_level
))
4456 tree inner_parms
= TREE_VALUE (parm_level
);
4460 ntparms
= TREE_VEC_LENGTH (inner_parms
);
4461 for (i
= 0; i
< ntparms
; ++i
)
4463 if (TREE_VEC_ELT (inner_parms
, i
) == error_mark_node
)
4466 if (TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)))
4471 if (is_friend_decl
== 2)
4478 /* Clear out the default argument so that we are not
4480 TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)) = NULL_TREE
;
4484 /* At this point, if we're still interested in issuing messages,
4485 they must apply to classes surrounding the object declared. */
4487 msg
= G_("default argument for template parameter for class "
4494 /* Worker for push_template_decl_real, called via
4495 for_each_template_parm. DATA is really an int, indicating the
4496 level of the parameters we are interested in. If T is a template
4497 parameter of that level, return nonzero. */
4500 template_parm_this_level_p (tree t
, void* data
)
4502 int this_level
= *(int *)data
;
4505 if (TREE_CODE (t
) == TEMPLATE_PARM_INDEX
)
4506 level
= TEMPLATE_PARM_LEVEL (t
);
4508 level
= TEMPLATE_TYPE_LEVEL (t
);
4509 return level
== this_level
;
4512 /* Creates a TEMPLATE_DECL for the indicated DECL using the template
4513 parameters given by current_template_args, or reuses a
4514 previously existing one, if appropriate. Returns the DECL, or an
4515 equivalent one, if it is replaced via a call to duplicate_decls.
4517 If IS_FRIEND is true, DECL is a friend declaration. */
4520 push_template_decl_real (tree decl
, bool is_friend
)
4528 int new_template_p
= 0;
4529 /* True if the template is a member template, in the sense of
4531 bool member_template_p
= false;
4533 if (decl
== error_mark_node
|| !current_template_parms
)
4534 return error_mark_node
;
4536 /* See if this is a partial specialization. */
4537 is_partial
= (DECL_IMPLICIT_TYPEDEF_P (decl
)
4538 && TREE_CODE (TREE_TYPE (decl
)) != ENUMERAL_TYPE
4539 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)));
4541 if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_FRIEND_P (decl
))
4545 /* For a friend, we want the context of the friend function, not
4546 the type of which it is a friend. */
4547 ctx
= CP_DECL_CONTEXT (decl
);
4548 else if (CP_DECL_CONTEXT (decl
)
4549 && TREE_CODE (CP_DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
4550 /* In the case of a virtual function, we want the class in which
4552 ctx
= CP_DECL_CONTEXT (decl
);
4554 /* Otherwise, if we're currently defining some class, the DECL
4555 is assumed to be a member of the class. */
4556 ctx
= current_scope ();
4558 if (ctx
&& TREE_CODE (ctx
) == NAMESPACE_DECL
)
4561 if (!DECL_CONTEXT (decl
))
4562 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
4564 /* See if this is a primary template. */
4565 if (is_friend
&& ctx
)
4566 /* A friend template that specifies a class context, i.e.
4567 template <typename T> friend void A<T>::f();
4571 is_primary
= template_parm_scope_p ();
4575 if (DECL_CLASS_SCOPE_P (decl
))
4576 member_template_p
= true;
4577 if (TREE_CODE (decl
) == TYPE_DECL
4578 && ANON_AGGRNAME_P (DECL_NAME (decl
)))
4580 error ("template class without a name");
4581 return error_mark_node
;
4583 else if (TREE_CODE (decl
) == FUNCTION_DECL
)
4585 if (DECL_DESTRUCTOR_P (decl
))
4589 A destructor shall not be a member template. */
4590 error ("destructor %qD declared as member template", decl
);
4591 return error_mark_node
;
4593 if (NEW_DELETE_OPNAME_P (DECL_NAME (decl
))
4594 && (!prototype_p (TREE_TYPE (decl
))
4595 || TYPE_ARG_TYPES (TREE_TYPE (decl
)) == void_list_node
4596 || !TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)))
4597 || (TREE_CHAIN (TYPE_ARG_TYPES ((TREE_TYPE (decl
))))
4598 == void_list_node
)))
4600 /* [basic.stc.dynamic.allocation]
4602 An allocation function can be a function
4603 template. ... Template allocation functions shall
4604 have two or more parameters. */
4605 error ("invalid template declaration of %qD", decl
);
4606 return error_mark_node
;
4609 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
4610 && CLASS_TYPE_P (TREE_TYPE (decl
)))
4612 else if (TREE_CODE (decl
) == TYPE_DECL
4613 && TYPE_DECL_ALIAS_P (decl
))
4614 /* alias-declaration */
4615 gcc_assert (!DECL_ARTIFICIAL (decl
));
4618 error ("template declaration of %q#D", decl
);
4619 return error_mark_node
;
4623 /* Check to see that the rules regarding the use of default
4624 arguments are not being violated. */
4625 check_default_tmpl_args (decl
, current_template_parms
,
4626 is_primary
, is_partial
, /*is_friend_decl=*/0);
4628 /* Ensure that there are no parameter packs in the type of this
4629 declaration that have not been expanded. */
4630 if (TREE_CODE (decl
) == FUNCTION_DECL
)
4632 /* Check each of the arguments individually to see if there are
4633 any bare parameter packs. */
4634 tree type
= TREE_TYPE (decl
);
4635 tree arg
= DECL_ARGUMENTS (decl
);
4636 tree argtype
= TYPE_ARG_TYPES (type
);
4638 while (arg
&& argtype
)
4640 if (!FUNCTION_PARAMETER_PACK_P (arg
)
4641 && check_for_bare_parameter_packs (TREE_TYPE (arg
)))
4643 /* This is a PARM_DECL that contains unexpanded parameter
4644 packs. We have already complained about this in the
4645 check_for_bare_parameter_packs call, so just replace
4646 these types with ERROR_MARK_NODE. */
4647 TREE_TYPE (arg
) = error_mark_node
;
4648 TREE_VALUE (argtype
) = error_mark_node
;
4651 arg
= DECL_CHAIN (arg
);
4652 argtype
= TREE_CHAIN (argtype
);
4655 /* Check for bare parameter packs in the return type and the
4656 exception specifiers. */
4657 if (check_for_bare_parameter_packs (TREE_TYPE (type
)))
4658 /* Errors were already issued, set return type to int
4659 as the frontend doesn't expect error_mark_node as
4661 TREE_TYPE (type
) = integer_type_node
;
4662 if (check_for_bare_parameter_packs (TYPE_RAISES_EXCEPTIONS (type
)))
4663 TYPE_RAISES_EXCEPTIONS (type
) = NULL_TREE
;
4665 else if (check_for_bare_parameter_packs ((TREE_CODE (decl
) == TYPE_DECL
4666 && TYPE_DECL_ALIAS_P (decl
))
4667 ? DECL_ORIGINAL_TYPE (decl
)
4668 : TREE_TYPE (decl
)))
4670 TREE_TYPE (decl
) = error_mark_node
;
4671 return error_mark_node
;
4675 return process_partial_specialization (decl
);
4677 args
= current_template_args ();
4680 || TREE_CODE (ctx
) == FUNCTION_DECL
4681 || (CLASS_TYPE_P (ctx
) && TYPE_BEING_DEFINED (ctx
))
4682 || (TREE_CODE (decl
) == TYPE_DECL
4683 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
4684 || (is_friend
&& !DECL_TEMPLATE_INFO (decl
)))
4686 if (DECL_LANG_SPECIFIC (decl
)
4687 && DECL_TEMPLATE_INFO (decl
)
4688 && DECL_TI_TEMPLATE (decl
))
4689 tmpl
= DECL_TI_TEMPLATE (decl
);
4690 /* If DECL is a TYPE_DECL for a class-template, then there won't
4691 be DECL_LANG_SPECIFIC. The information equivalent to
4692 DECL_TEMPLATE_INFO is found in TYPE_TEMPLATE_INFO instead. */
4693 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
4694 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl
))
4695 && TYPE_TI_TEMPLATE (TREE_TYPE (decl
)))
4697 /* Since a template declaration already existed for this
4698 class-type, we must be redeclaring it here. Make sure
4699 that the redeclaration is valid. */
4700 redeclare_class_template (TREE_TYPE (decl
),
4701 current_template_parms
);
4702 /* We don't need to create a new TEMPLATE_DECL; just use the
4703 one we already had. */
4704 tmpl
= TYPE_TI_TEMPLATE (TREE_TYPE (decl
));
4708 tmpl
= build_template_decl (decl
, current_template_parms
,
4712 if (DECL_LANG_SPECIFIC (decl
)
4713 && DECL_TEMPLATE_SPECIALIZATION (decl
))
4715 /* A specialization of a member template of a template
4717 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
4718 DECL_TEMPLATE_INFO (tmpl
) = DECL_TEMPLATE_INFO (decl
);
4719 DECL_TEMPLATE_INFO (decl
) = NULL_TREE
;
4725 tree a
, t
, current
, parms
;
4727 tree tinfo
= get_template_info (decl
);
4731 error ("template definition of non-template %q#D", decl
);
4732 return error_mark_node
;
4735 tmpl
= TI_TEMPLATE (tinfo
);
4737 if (DECL_FUNCTION_TEMPLATE_P (tmpl
)
4738 && DECL_TEMPLATE_INFO (decl
) && DECL_TI_ARGS (decl
)
4739 && DECL_TEMPLATE_SPECIALIZATION (decl
)
4740 && DECL_MEMBER_TEMPLATE_P (tmpl
))
4744 /* The declaration is a specialization of a member
4745 template, declared outside the class. Therefore, the
4746 innermost template arguments will be NULL, so we
4747 replace them with the arguments determined by the
4748 earlier call to check_explicit_specialization. */
4749 args
= DECL_TI_ARGS (decl
);
4752 = build_template_decl (decl
, current_template_parms
,
4754 DECL_TEMPLATE_RESULT (new_tmpl
) = decl
;
4755 TREE_TYPE (new_tmpl
) = TREE_TYPE (decl
);
4756 DECL_TI_TEMPLATE (decl
) = new_tmpl
;
4757 SET_DECL_TEMPLATE_SPECIALIZATION (new_tmpl
);
4758 DECL_TEMPLATE_INFO (new_tmpl
)
4759 = build_template_info (tmpl
, args
);
4761 register_specialization (new_tmpl
,
4762 most_general_template (tmpl
),
4768 /* Make sure the template headers we got make sense. */
4770 parms
= DECL_TEMPLATE_PARMS (tmpl
);
4771 i
= TMPL_PARMS_DEPTH (parms
);
4772 if (TMPL_ARGS_DEPTH (args
) != i
)
4774 error ("expected %d levels of template parms for %q#D, got %d",
4775 i
, decl
, TMPL_ARGS_DEPTH (args
));
4778 for (current
= decl
; i
> 0; --i
, parms
= TREE_CHAIN (parms
))
4780 a
= TMPL_ARGS_LEVEL (args
, i
);
4781 t
= INNERMOST_TEMPLATE_PARMS (parms
);
4783 if (TREE_VEC_LENGTH (t
) != TREE_VEC_LENGTH (a
))
4785 if (current
== decl
)
4786 error ("got %d template parameters for %q#D",
4787 TREE_VEC_LENGTH (a
), decl
);
4789 error ("got %d template parameters for %q#T",
4790 TREE_VEC_LENGTH (a
), current
);
4791 error (" but %d required", TREE_VEC_LENGTH (t
));
4792 /* Avoid crash in import_export_decl. */
4793 DECL_INTERFACE_KNOWN (decl
) = 1;
4794 return error_mark_node
;
4797 if (current
== decl
)
4799 else if (current
== NULL_TREE
)
4800 /* Can happen in erroneous input. */
4803 current
= get_containing_scope (current
);
4806 /* Check that the parms are used in the appropriate qualifying scopes
4807 in the declarator. */
4808 if (!comp_template_args
4810 TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (tmpl
)))))
4813 template arguments to %qD do not match original template %qD",
4814 decl
, DECL_TEMPLATE_RESULT (tmpl
));
4815 if (!uses_template_parms (TI_ARGS (tinfo
)))
4816 inform (input_location
, "use template<> for an explicit specialization");
4817 /* Avoid crash in import_export_decl. */
4818 DECL_INTERFACE_KNOWN (decl
) = 1;
4819 return error_mark_node
;
4823 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
4824 TREE_TYPE (tmpl
) = TREE_TYPE (decl
);
4826 /* Push template declarations for global functions and types. Note
4827 that we do not try to push a global template friend declared in a
4828 template class; such a thing may well depend on the template
4829 parameters of the class. */
4830 if (new_template_p
&& !ctx
4831 && !(is_friend
&& template_class_depth (current_class_type
) > 0))
4833 tmpl
= pushdecl_namespace_level (tmpl
, is_friend
);
4834 if (tmpl
== error_mark_node
)
4835 return error_mark_node
;
4837 /* Hide template friend classes that haven't been declared yet. */
4838 if (is_friend
&& TREE_CODE (decl
) == TYPE_DECL
)
4840 DECL_ANTICIPATED (tmpl
) = 1;
4841 DECL_FRIEND_P (tmpl
) = 1;
4847 tree parms
= DECL_TEMPLATE_PARMS (tmpl
);
4850 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
4851 if (DECL_CONV_FN_P (tmpl
))
4853 int depth
= TMPL_PARMS_DEPTH (parms
);
4855 /* It is a conversion operator. See if the type converted to
4856 depends on innermost template operands. */
4858 if (uses_template_parms_level (TREE_TYPE (TREE_TYPE (tmpl
)),
4860 DECL_TEMPLATE_CONV_FN_P (tmpl
) = 1;
4863 /* Give template template parms a DECL_CONTEXT of the template
4864 for which they are a parameter. */
4865 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
4866 for (i
= TREE_VEC_LENGTH (parms
) - 1; i
>= 0; --i
)
4868 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
4869 if (TREE_CODE (parm
) == TEMPLATE_DECL
)
4870 DECL_CONTEXT (parm
) = tmpl
;
4874 /* The DECL_TI_ARGS of DECL contains full set of arguments referring
4875 back to its most general template. If TMPL is a specialization,
4876 ARGS may only have the innermost set of arguments. Add the missing
4877 argument levels if necessary. */
4878 if (DECL_TEMPLATE_INFO (tmpl
))
4879 args
= add_outermost_template_args (DECL_TI_ARGS (tmpl
), args
);
4881 info
= build_template_info (tmpl
, args
);
4883 if (DECL_IMPLICIT_TYPEDEF_P (decl
))
4884 SET_TYPE_TEMPLATE_INFO (TREE_TYPE (tmpl
), info
);
4887 if (is_primary
&& !DECL_LANG_SPECIFIC (decl
))
4888 retrofit_lang_decl (decl
);
4889 if (DECL_LANG_SPECIFIC (decl
))
4890 DECL_TEMPLATE_INFO (decl
) = info
;
4893 return DECL_TEMPLATE_RESULT (tmpl
);
4897 push_template_decl (tree decl
)
4899 return push_template_decl_real (decl
, false);
4902 /* FN is an inheriting constructor that inherits from the constructor
4903 template INHERITED; turn FN into a constructor template with a matching
4907 add_inherited_template_parms (tree fn
, tree inherited
)
4910 = INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (inherited
));
4911 inner_parms
= copy_node (inner_parms
);
4913 = tree_cons (size_int (processing_template_decl
+ 1),
4914 inner_parms
, current_template_parms
);
4915 tree tmpl
= build_template_decl (fn
, parms
, /*member*/true);
4916 tree args
= template_parms_to_args (parms
);
4917 DECL_TEMPLATE_INFO (fn
) = build_template_info (tmpl
, args
);
4918 TREE_TYPE (tmpl
) = TREE_TYPE (fn
);
4919 DECL_TEMPLATE_RESULT (tmpl
) = fn
;
4920 DECL_ARTIFICIAL (tmpl
) = true;
4921 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
4925 /* Called when a class template TYPE is redeclared with the indicated
4926 template PARMS, e.g.:
4928 template <class T> struct S;
4929 template <class T> struct S {}; */
4932 redeclare_class_template (tree type
, tree parms
)
4938 if (!TYPE_TEMPLATE_INFO (type
))
4940 error ("%qT is not a template type", type
);
4944 tmpl
= TYPE_TI_TEMPLATE (type
);
4945 if (!PRIMARY_TEMPLATE_P (tmpl
))
4946 /* The type is nested in some template class. Nothing to worry
4947 about here; there are no new template parameters for the nested
4953 error ("template specifiers not specified in declaration of %qD",
4958 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
4959 tmpl_parms
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl
);
4961 if (TREE_VEC_LENGTH (parms
) != TREE_VEC_LENGTH (tmpl_parms
))
4963 error_n (input_location
, TREE_VEC_LENGTH (parms
),
4964 "redeclared with %d template parameter",
4965 "redeclared with %d template parameters",
4966 TREE_VEC_LENGTH (parms
));
4967 inform_n (input_location
, TREE_VEC_LENGTH (tmpl_parms
),
4968 "previous declaration %q+D used %d template parameter",
4969 "previous declaration %q+D used %d template parameters",
4970 tmpl
, TREE_VEC_LENGTH (tmpl_parms
));
4974 for (i
= 0; i
< TREE_VEC_LENGTH (tmpl_parms
); ++i
)
4981 if (TREE_VEC_ELT (tmpl_parms
, i
) == error_mark_node
4982 || TREE_VEC_ELT (parms
, i
) == error_mark_node
)
4985 tmpl_parm
= TREE_VALUE (TREE_VEC_ELT (tmpl_parms
, i
));
4986 if (tmpl_parm
== error_mark_node
)
4989 parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
4990 tmpl_default
= TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
));
4991 parm_default
= TREE_PURPOSE (TREE_VEC_ELT (parms
, i
));
4993 /* TMPL_PARM and PARM can be either TYPE_DECL, PARM_DECL, or
4995 if (TREE_CODE (tmpl_parm
) != TREE_CODE (parm
)
4996 || (TREE_CODE (tmpl_parm
) != TYPE_DECL
4997 && !same_type_p (TREE_TYPE (tmpl_parm
), TREE_TYPE (parm
)))
4998 || (TREE_CODE (tmpl_parm
) != PARM_DECL
4999 && (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (tmpl_parm
))
5000 != TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
))))
5001 || (TREE_CODE (tmpl_parm
) == PARM_DECL
5002 && (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (tmpl_parm
))
5003 != TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))))
5005 error ("template parameter %q+#D", tmpl_parm
);
5006 error ("redeclared here as %q#D", parm
);
5010 if (tmpl_default
!= NULL_TREE
&& parm_default
!= NULL_TREE
)
5012 /* We have in [temp.param]:
5014 A template-parameter may not be given default arguments
5015 by two different declarations in the same scope. */
5016 error_at (input_location
, "redefinition of default argument for %q#D", parm
);
5017 inform (DECL_SOURCE_LOCATION (tmpl_parm
),
5018 "original definition appeared here");
5022 if (parm_default
!= NULL_TREE
)
5023 /* Update the previous template parameters (which are the ones
5024 that will really count) with the new default value. */
5025 TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
)) = parm_default
;
5026 else if (tmpl_default
!= NULL_TREE
)
5027 /* Update the new parameters, too; they'll be used as the
5028 parameters for any members. */
5029 TREE_PURPOSE (TREE_VEC_ELT (parms
, i
)) = tmpl_default
;
5035 /* Simplify EXPR if it is a non-dependent expression. Returns the
5036 (possibly simplified) expression. */
5039 fold_non_dependent_expr_sfinae (tree expr
, tsubst_flags_t complain
)
5041 if (expr
== NULL_TREE
)
5044 /* If we're in a template, but EXPR isn't value dependent, simplify
5045 it. We're supposed to treat:
5047 template <typename T> void f(T[1 + 1]);
5048 template <typename T> void f(T[2]);
5050 as two declarations of the same function, for example. */
5051 if (processing_template_decl
5052 && !instantiation_dependent_expression_p (expr
)
5053 && potential_constant_expression (expr
))
5055 HOST_WIDE_INT saved_processing_template_decl
;
5057 saved_processing_template_decl
= processing_template_decl
;
5058 processing_template_decl
= 0;
5059 expr
= tsubst_copy_and_build (expr
,
5062 /*in_decl=*/NULL_TREE
,
5063 /*function_p=*/false,
5064 /*integral_constant_expression_p=*/true);
5065 processing_template_decl
= saved_processing_template_decl
;
5071 fold_non_dependent_expr (tree expr
)
5073 return fold_non_dependent_expr_sfinae (expr
, tf_error
);
5076 /* Return TRUE iff T is a type alias, a TEMPLATE_DECL for an alias
5077 template declaration, or a TYPE_DECL for an alias declaration. */
5080 alias_type_or_template_p (tree t
)
5084 return ((TREE_CODE (t
) == TYPE_DECL
&& TYPE_DECL_ALIAS_P (t
))
5087 && TYPE_DECL_ALIAS_P (TYPE_NAME (t
)))
5088 || DECL_ALIAS_TEMPLATE_P (t
));
5091 /* Return TRUE iff is a specialization of an alias template. */
5094 alias_template_specialization_p (const_tree t
)
5100 && TYPE_TEMPLATE_INFO (t
)
5101 && PRIMARY_TEMPLATE_P (TYPE_TI_TEMPLATE (t
))
5102 && DECL_ALIAS_TEMPLATE_P (TYPE_TI_TEMPLATE (t
)));
5105 /* Subroutine of convert_nontype_argument. Converts EXPR to TYPE, which
5106 must be a function or a pointer-to-function type, as specified
5107 in [temp.arg.nontype]: disambiguate EXPR if it is an overload set,
5108 and check that the resulting function has external linkage. */
5111 convert_nontype_argument_function (tree type
, tree expr
)
5115 linkage_kind linkage
;
5117 fn
= instantiate_type (type
, fns
, tf_none
);
5118 if (fn
== error_mark_node
)
5119 return error_mark_node
;
5122 if (TREE_CODE (fn_no_ptr
) == ADDR_EXPR
)
5123 fn_no_ptr
= TREE_OPERAND (fn_no_ptr
, 0);
5124 if (BASELINK_P (fn_no_ptr
))
5125 fn_no_ptr
= BASELINK_FUNCTIONS (fn_no_ptr
);
5127 /* [temp.arg.nontype]/1
5129 A template-argument for a non-type, non-template template-parameter
5132 -- the address of an object or function with external [C++11: or
5133 internal] linkage. */
5135 if (TREE_CODE (fn_no_ptr
) != FUNCTION_DECL
)
5137 error ("%qE is not a valid template argument for type %qT", expr
, type
);
5138 if (TYPE_PTR_P (type
))
5139 error ("it must be the address of a function with external linkage");
5141 error ("it must be the name of a function with external linkage");
5145 linkage
= decl_linkage (fn_no_ptr
);
5146 if (cxx_dialect
>= cxx0x
? linkage
== lk_none
: linkage
!= lk_external
)
5148 if (cxx_dialect
>= cxx0x
)
5149 error ("%qE is not a valid template argument for type %qT "
5150 "because %qD has no linkage",
5151 expr
, type
, fn_no_ptr
);
5153 error ("%qE is not a valid template argument for type %qT "
5154 "because %qD does not have external linkage",
5155 expr
, type
, fn_no_ptr
);
5162 /* Subroutine of convert_nontype_argument.
5163 Check if EXPR of type TYPE is a valid pointer-to-member constant.
5164 Emit an error otherwise. */
5167 check_valid_ptrmem_cst_expr (tree type
, tree expr
,
5168 tsubst_flags_t complain
)
5171 if (expr
&& (null_ptr_cst_p (expr
) || TREE_CODE (expr
) == PTRMEM_CST
))
5173 if (cxx_dialect
>= cxx0x
&& null_member_pointer_value_p (expr
))
5175 if (complain
& tf_error
)
5177 error ("%qE is not a valid template argument for type %qT",
5179 error ("it must be a pointer-to-member of the form %<&X::Y%>");
5184 /* Returns TRUE iff the address of OP is value-dependent.
5186 14.6.2.4 [temp.dep.temp]:
5187 A non-integral non-type template-argument is dependent if its type is
5188 dependent or it has either of the following forms
5191 and contains a nested-name-specifier which specifies a class-name that
5192 names a dependent type.
5194 We generalize this to just say that the address of a member of a
5195 dependent class is value-dependent; the above doesn't cover the
5196 address of a static data member named with an unqualified-id. */
5199 has_value_dependent_address (tree op
)
5201 /* We could use get_inner_reference here, but there's no need;
5202 this is only relevant for template non-type arguments, which
5203 can only be expressed as &id-expression. */
5206 tree ctx
= CP_DECL_CONTEXT (op
);
5207 if (TYPE_P (ctx
) && dependent_type_p (ctx
))
5214 /* The next set of functions are used for providing helpful explanatory
5215 diagnostics for failed overload resolution. Their messages should be
5216 indented by two spaces for consistency with the messages in
5220 unify_success (bool /*explain_p*/)
5226 unify_parameter_deduction_failure (bool explain_p
, tree parm
)
5229 inform (input_location
,
5230 " couldn't deduce template parameter %qD", parm
);
5235 unify_invalid (bool /*explain_p*/)
5241 unify_cv_qual_mismatch (bool explain_p
, tree parm
, tree arg
)
5244 inform (input_location
,
5245 " types %qT and %qT have incompatible cv-qualifiers",
5251 unify_type_mismatch (bool explain_p
, tree parm
, tree arg
)
5254 inform (input_location
, " mismatched types %qT and %qT", parm
, arg
);
5259 unify_parameter_pack_mismatch (bool explain_p
, tree parm
, tree arg
)
5262 inform (input_location
,
5263 " template parameter %qD is not a parameter pack, but "
5270 unify_ptrmem_cst_mismatch (bool explain_p
, tree parm
, tree arg
)
5273 inform (input_location
,
5274 " template argument %qE does not match "
5275 "pointer-to-member constant %qE",
5281 unify_expression_unequal (bool explain_p
, tree parm
, tree arg
)
5284 inform (input_location
, " %qE is not equivalent to %qE", parm
, arg
);
5289 unify_parameter_pack_inconsistent (bool explain_p
, tree old_arg
, tree new_arg
)
5292 inform (input_location
,
5293 " inconsistent parameter pack deduction with %qT and %qT",
5299 unify_inconsistency (bool explain_p
, tree parm
, tree first
, tree second
)
5304 inform (input_location
,
5305 " deduced conflicting types for parameter %qT (%qT and %qT)",
5306 parm
, first
, second
);
5308 inform (input_location
,
5309 " deduced conflicting values for non-type parameter "
5310 "%qE (%qE and %qE)", parm
, first
, second
);
5316 unify_vla_arg (bool explain_p
, tree arg
)
5319 inform (input_location
,
5320 " variable-sized array type %qT is not "
5321 "a valid template argument",
5327 unify_method_type_error (bool explain_p
, tree arg
)
5330 inform (input_location
,
5331 " member function type %qT is not a valid template argument",
5337 unify_arity (bool explain_p
, int have
, int wanted
)
5340 inform_n (input_location
, wanted
,
5341 " candidate expects %d argument, %d provided",
5342 " candidate expects %d arguments, %d provided",
5348 unify_too_many_arguments (bool explain_p
, int have
, int wanted
)
5350 return unify_arity (explain_p
, have
, wanted
);
5354 unify_too_few_arguments (bool explain_p
, int have
, int wanted
)
5356 return unify_arity (explain_p
, have
, wanted
);
5360 unify_arg_conversion (bool explain_p
, tree to_type
,
5361 tree from_type
, tree arg
)
5364 inform (input_location
, " cannot convert %qE (type %qT) to type %qT",
5365 arg
, from_type
, to_type
);
5370 unify_no_common_base (bool explain_p
, enum template_base_result r
,
5371 tree parm
, tree arg
)
5376 case tbr_ambiguous_baseclass
:
5377 inform (input_location
, " %qT is an ambiguous base class of %qT",
5381 inform (input_location
, " %qT is not derived from %qT", arg
, parm
);
5388 unify_inconsistent_template_template_parameters (bool explain_p
)
5391 inform (input_location
,
5392 " template parameters of a template template argument are "
5393 "inconsistent with other deduced template arguments");
5398 unify_template_deduction_failure (bool explain_p
, tree parm
, tree arg
)
5401 inform (input_location
,
5402 " can't deduce a template for %qT from non-template type %qT",
5408 unify_template_argument_mismatch (bool explain_p
, tree parm
, tree arg
)
5411 inform (input_location
,
5412 " template argument %qE does not match %qD", arg
, parm
);
5417 unify_overload_resolution_failure (bool explain_p
, tree arg
)
5420 inform (input_location
,
5421 " could not resolve address from overloaded function %qE",
5426 /* Attempt to convert the non-type template parameter EXPR to the
5427 indicated TYPE. If the conversion is successful, return the
5428 converted value. If the conversion is unsuccessful, return
5429 NULL_TREE if we issued an error message, or error_mark_node if we
5430 did not. We issue error messages for out-and-out bad template
5431 parameters, but not simply because the conversion failed, since we
5432 might be just trying to do argument deduction. Both TYPE and EXPR
5433 must be non-dependent.
5435 The conversion follows the special rules described in
5436 [temp.arg.nontype], and it is much more strict than an implicit
5439 This function is called twice for each template argument (see
5440 lookup_template_class for a more accurate description of this
5441 problem). This means that we need to handle expressions which
5442 are not valid in a C++ source, but can be created from the
5443 first call (for instance, casts to perform conversions). These
5444 hacks can go away after we fix the double coercion problem. */
5447 convert_nontype_argument (tree type
, tree expr
, tsubst_flags_t complain
)
5451 /* Detect immediately string literals as invalid non-type argument.
5452 This special-case is not needed for correctness (we would easily
5453 catch this later), but only to provide better diagnostic for this
5454 common user mistake. As suggested by DR 100, we do not mention
5455 linkage issues in the diagnostic as this is not the point. */
5456 /* FIXME we're making this OK. */
5457 if (TREE_CODE (expr
) == STRING_CST
)
5459 if (complain
& tf_error
)
5460 error ("%qE is not a valid template argument for type %qT "
5461 "because string literals can never be used in this context",
5466 /* Add the ADDR_EXPR now for the benefit of
5467 value_dependent_expression_p. */
5468 if (TYPE_PTROBV_P (type
)
5469 && TREE_CODE (TREE_TYPE (expr
)) == ARRAY_TYPE
)
5471 expr
= decay_conversion (expr
, complain
);
5472 if (expr
== error_mark_node
)
5473 return error_mark_node
;
5476 /* If we are in a template, EXPR may be non-dependent, but still
5477 have a syntactic, rather than semantic, form. For example, EXPR
5478 might be a SCOPE_REF, rather than the VAR_DECL to which the
5479 SCOPE_REF refers. Preserving the qualifying scope is necessary
5480 so that access checking can be performed when the template is
5481 instantiated -- but here we need the resolved form so that we can
5482 convert the argument. */
5483 if (TYPE_REF_OBJ_P (type
)
5484 && has_value_dependent_address (expr
))
5485 /* If we want the address and it's value-dependent, don't fold. */;
5486 else if (!type_unknown_p (expr
))
5487 expr
= fold_non_dependent_expr_sfinae (expr
, complain
);
5488 if (error_operand_p (expr
))
5489 return error_mark_node
;
5490 expr_type
= TREE_TYPE (expr
);
5491 if (TREE_CODE (type
) == REFERENCE_TYPE
)
5492 expr
= mark_lvalue_use (expr
);
5494 expr
= mark_rvalue_use (expr
);
5496 /* 14.3.2/5: The null pointer{,-to-member} conversion is applied
5497 to a non-type argument of "nullptr". */
5498 if (expr
== nullptr_node
&& TYPE_PTR_OR_PTRMEM_P (type
))
5499 expr
= convert (type
, expr
);
5501 /* In C++11, integral or enumeration non-type template arguments can be
5502 arbitrary constant expressions. Pointer and pointer to
5503 member arguments can be general constant expressions that evaluate
5504 to a null value, but otherwise still need to be of a specific form. */
5505 if (cxx_dialect
>= cxx0x
)
5507 if (TREE_CODE (expr
) == PTRMEM_CST
)
5508 /* A PTRMEM_CST is already constant, and a valid template
5509 argument for a parameter of pointer to member type, we just want
5510 to leave it in that form rather than lower it to a
5512 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
5513 expr
= maybe_constant_value (expr
);
5514 else if (TYPE_PTR_OR_PTRMEM_P (type
))
5516 tree folded
= maybe_constant_value (expr
);
5517 if (TYPE_PTR_P (type
) ? integer_zerop (folded
)
5518 : null_member_pointer_value_p (folded
))
5523 /* HACK: Due to double coercion, we can get a
5524 NOP_EXPR<REFERENCE_TYPE>(ADDR_EXPR<POINTER_TYPE> (arg)) here,
5525 which is the tree that we built on the first call (see
5526 below when coercing to reference to object or to reference to
5527 function). We just strip everything and get to the arg.
5528 See g++.old-deja/g++.oliva/template4.C and g++.dg/template/nontype9.C
5530 if (TYPE_REF_OBJ_P (type
) || TYPE_REFFN_P (type
))
5532 tree probe_type
, probe
= expr
;
5533 if (REFERENCE_REF_P (probe
))
5534 probe
= TREE_OPERAND (probe
, 0);
5535 probe_type
= TREE_TYPE (probe
);
5536 if (TREE_CODE (probe
) == NOP_EXPR
)
5538 /* ??? Maybe we could use convert_from_reference here, but we
5539 would need to relax its constraints because the NOP_EXPR
5540 could actually change the type to something more cv-qualified,
5541 and this is not folded by convert_from_reference. */
5542 tree addr
= TREE_OPERAND (probe
, 0);
5543 if (TREE_CODE (probe_type
) == REFERENCE_TYPE
5544 && TREE_CODE (addr
) == ADDR_EXPR
5545 && TYPE_PTR_P (TREE_TYPE (addr
))
5546 && (same_type_ignoring_top_level_qualifiers_p
5547 (TREE_TYPE (probe_type
),
5548 TREE_TYPE (TREE_TYPE (addr
)))))
5550 expr
= TREE_OPERAND (addr
, 0);
5551 expr_type
= TREE_TYPE (expr
);
5556 /* We could also generate a NOP_EXPR(ADDR_EXPR()) when the
5557 parameter is a pointer to object, through decay and
5558 qualification conversion. Let's strip everything. */
5559 else if (TREE_CODE (expr
) == NOP_EXPR
&& TYPE_PTROBV_P (type
))
5563 if (TREE_CODE (probe
) == ADDR_EXPR
5564 && TYPE_PTR_P (TREE_TYPE (probe
)))
5566 /* Skip the ADDR_EXPR only if it is part of the decay for
5567 an array. Otherwise, it is part of the original argument
5568 in the source code. */
5569 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (probe
, 0))) == ARRAY_TYPE
)
5570 probe
= TREE_OPERAND (probe
, 0);
5572 expr_type
= TREE_TYPE (expr
);
5576 /* [temp.arg.nontype]/5, bullet 1
5578 For a non-type template-parameter of integral or enumeration type,
5579 integral promotions (_conv.prom_) and integral conversions
5580 (_conv.integral_) are applied. */
5581 if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
5583 tree t
= build_integral_nontype_arg_conv (type
, expr
, complain
);
5584 t
= maybe_constant_value (t
);
5585 if (t
!= error_mark_node
)
5588 if (!same_type_ignoring_top_level_qualifiers_p (type
, TREE_TYPE (expr
)))
5589 return error_mark_node
;
5591 /* Notice that there are constant expressions like '4 % 0' which
5592 do not fold into integer constants. */
5593 if (TREE_CODE (expr
) != INTEGER_CST
)
5595 if (complain
& tf_error
)
5597 int errs
= errorcount
, warns
= warningcount
+ werrorcount
;
5598 if (processing_template_decl
5599 && !require_potential_constant_expression (expr
))
5601 expr
= cxx_constant_value (expr
);
5602 if (errorcount
> errs
|| warningcount
+ werrorcount
> warns
)
5603 inform (EXPR_LOC_OR_HERE (expr
),
5604 "in template argument for type %qT ", type
);
5605 if (expr
== error_mark_node
)
5607 /* else cxx_constant_value complained but gave us
5608 a real constant, so go ahead. */
5609 gcc_assert (TREE_CODE (expr
) == INTEGER_CST
);
5615 /* [temp.arg.nontype]/5, bullet 2
5617 For a non-type template-parameter of type pointer to object,
5618 qualification conversions (_conv.qual_) and the array-to-pointer
5619 conversion (_conv.array_) are applied. */
5620 else if (TYPE_PTROBV_P (type
))
5622 /* [temp.arg.nontype]/1 (TC1 version, DR 49):
5624 A template-argument for a non-type, non-template template-parameter
5625 shall be one of: [...]
5627 -- the name of a non-type template-parameter;
5628 -- the address of an object or function with external linkage, [...]
5629 expressed as "& id-expression" where the & is optional if the name
5630 refers to a function or array, or if the corresponding
5631 template-parameter is a reference.
5633 Here, we do not care about functions, as they are invalid anyway
5634 for a parameter of type pointer-to-object. */
5636 if (DECL_P (expr
) && DECL_TEMPLATE_PARM_P (expr
))
5637 /* Non-type template parameters are OK. */
5639 else if (cxx_dialect
>= cxx0x
&& integer_zerop (expr
))
5640 /* Null pointer values are OK in C++11. */;
5641 else if (TREE_CODE (expr
) != ADDR_EXPR
5642 && TREE_CODE (expr_type
) != ARRAY_TYPE
)
5646 error ("%qD is not a valid template argument "
5647 "because %qD is a variable, not the address of "
5652 if (POINTER_TYPE_P (expr_type
))
5654 error ("%qE is not a valid template argument for %qT"
5655 "because it is not the address of a variable",
5659 /* Other values, like integer constants, might be valid
5660 non-type arguments of some other type. */
5661 return error_mark_node
;
5667 decl
= ((TREE_CODE (expr
) == ADDR_EXPR
)
5668 ? TREE_OPERAND (expr
, 0) : expr
);
5671 error ("%qE is not a valid template argument of type %qT "
5672 "because %qE is not a variable",
5676 else if (cxx_dialect
< cxx0x
&& !DECL_EXTERNAL_LINKAGE_P (decl
))
5678 error ("%qE is not a valid template argument of type %qT "
5679 "because %qD does not have external linkage",
5683 else if (cxx_dialect
>= cxx0x
&& decl_linkage (decl
) == lk_none
)
5685 error ("%qE is not a valid template argument of type %qT "
5686 "because %qD has no linkage",
5692 expr
= decay_conversion (expr
, complain
);
5693 if (expr
== error_mark_node
)
5694 return error_mark_node
;
5696 expr
= perform_qualification_conversions (type
, expr
);
5697 if (expr
== error_mark_node
)
5698 return error_mark_node
;
5700 /* [temp.arg.nontype]/5, bullet 3
5702 For a non-type template-parameter of type reference to object, no
5703 conversions apply. The type referred to by the reference may be more
5704 cv-qualified than the (otherwise identical) type of the
5705 template-argument. The template-parameter is bound directly to the
5706 template-argument, which must be an lvalue. */
5707 else if (TYPE_REF_OBJ_P (type
))
5709 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type
),
5711 return error_mark_node
;
5713 if (!at_least_as_qualified_p (TREE_TYPE (type
), expr_type
))
5715 error ("%qE is not a valid template argument for type %qT "
5716 "because of conflicts in cv-qualification", expr
, type
);
5720 if (!real_lvalue_p (expr
))
5722 error ("%qE is not a valid template argument for type %qT "
5723 "because it is not an lvalue", expr
, type
);
5727 /* [temp.arg.nontype]/1
5729 A template-argument for a non-type, non-template template-parameter
5730 shall be one of: [...]
5732 -- the address of an object or function with external linkage. */
5733 if (INDIRECT_REF_P (expr
)
5734 && TYPE_REF_OBJ_P (TREE_TYPE (TREE_OPERAND (expr
, 0))))
5736 expr
= TREE_OPERAND (expr
, 0);
5739 error ("%q#D is not a valid template argument for type %qT "
5740 "because a reference variable does not have a constant "
5741 "address", expr
, type
);
5748 error ("%qE is not a valid template argument for type %qT "
5749 "because it is not an object with external linkage",
5754 if (!DECL_EXTERNAL_LINKAGE_P (expr
))
5756 error ("%qE is not a valid template argument for type %qT "
5757 "because object %qD has not external linkage",
5762 expr
= build_nop (type
, build_address (expr
));
5764 /* [temp.arg.nontype]/5, bullet 4
5766 For a non-type template-parameter of type pointer to function, only
5767 the function-to-pointer conversion (_conv.func_) is applied. If the
5768 template-argument represents a set of overloaded functions (or a
5769 pointer to such), the matching function is selected from the set
5771 else if (TYPE_PTRFN_P (type
))
5773 /* If the argument is a template-id, we might not have enough
5774 context information to decay the pointer. */
5775 if (!type_unknown_p (expr_type
))
5777 expr
= decay_conversion (expr
, complain
);
5778 if (expr
== error_mark_node
)
5779 return error_mark_node
;
5782 if (cxx_dialect
>= cxx0x
&& integer_zerop (expr
))
5783 /* Null pointer values are OK in C++11. */
5784 return perform_qualification_conversions (type
, expr
);
5786 expr
= convert_nontype_argument_function (type
, expr
);
5787 if (!expr
|| expr
== error_mark_node
)
5790 /* [temp.arg.nontype]/5, bullet 5
5792 For a non-type template-parameter of type reference to function, no
5793 conversions apply. If the template-argument represents a set of
5794 overloaded functions, the matching function is selected from the set
5796 else if (TYPE_REFFN_P (type
))
5798 if (TREE_CODE (expr
) == ADDR_EXPR
)
5800 error ("%qE is not a valid template argument for type %qT "
5801 "because it is a pointer", expr
, type
);
5802 inform (input_location
, "try using %qE instead", TREE_OPERAND (expr
, 0));
5806 expr
= convert_nontype_argument_function (type
, expr
);
5807 if (!expr
|| expr
== error_mark_node
)
5810 expr
= build_nop (type
, build_address (expr
));
5812 /* [temp.arg.nontype]/5, bullet 6
5814 For a non-type template-parameter of type pointer to member function,
5815 no conversions apply. If the template-argument represents a set of
5816 overloaded member functions, the matching member function is selected
5817 from the set (_over.over_). */
5818 else if (TYPE_PTRMEMFUNC_P (type
))
5820 expr
= instantiate_type (type
, expr
, tf_none
);
5821 if (expr
== error_mark_node
)
5822 return error_mark_node
;
5824 /* [temp.arg.nontype] bullet 1 says the pointer to member
5825 expression must be a pointer-to-member constant. */
5826 if (!check_valid_ptrmem_cst_expr (type
, expr
, complain
))
5827 return error_mark_node
;
5829 /* There is no way to disable standard conversions in
5830 resolve_address_of_overloaded_function (called by
5831 instantiate_type). It is possible that the call succeeded by
5832 converting &B::I to &D::I (where B is a base of D), so we need
5833 to reject this conversion here.
5835 Actually, even if there was a way to disable standard conversions,
5836 it would still be better to reject them here so that we can
5837 provide a superior diagnostic. */
5838 if (!same_type_p (TREE_TYPE (expr
), type
))
5840 error ("%qE is not a valid template argument for type %qT "
5841 "because it is of type %qT", expr
, type
,
5843 /* If we are just one standard conversion off, explain. */
5844 if (can_convert (type
, TREE_TYPE (expr
), complain
))
5845 inform (input_location
,
5846 "standard conversions are not allowed in this context");
5850 /* [temp.arg.nontype]/5, bullet 7
5852 For a non-type template-parameter of type pointer to data member,
5853 qualification conversions (_conv.qual_) are applied. */
5854 else if (TYPE_PTRDATAMEM_P (type
))
5856 /* [temp.arg.nontype] bullet 1 says the pointer to member
5857 expression must be a pointer-to-member constant. */
5858 if (!check_valid_ptrmem_cst_expr (type
, expr
, complain
))
5859 return error_mark_node
;
5861 expr
= perform_qualification_conversions (type
, expr
);
5862 if (expr
== error_mark_node
)
5865 else if (NULLPTR_TYPE_P (type
))
5867 if (expr
!= nullptr_node
)
5869 error ("%qE is not a valid template argument for type %qT "
5870 "because it is of type %qT", expr
, type
, TREE_TYPE (expr
));
5875 /* A template non-type parameter must be one of the above. */
5879 /* Sanity check: did we actually convert the argument to the
5881 gcc_assert (same_type_ignoring_top_level_qualifiers_p
5882 (type
, TREE_TYPE (expr
)));
5886 /* Subroutine of coerce_template_template_parms, which returns 1 if
5887 PARM_PARM and ARG_PARM match using the rule for the template
5888 parameters of template template parameters. Both PARM and ARG are
5889 template parameters; the rest of the arguments are the same as for
5890 coerce_template_template_parms.
5893 coerce_template_template_parm (tree parm
,
5895 tsubst_flags_t complain
,
5899 if (arg
== NULL_TREE
|| arg
== error_mark_node
5900 || parm
== NULL_TREE
|| parm
== error_mark_node
)
5903 if (TREE_CODE (arg
) != TREE_CODE (parm
))
5906 switch (TREE_CODE (parm
))
5909 /* We encounter instantiations of templates like
5910 template <template <template <class> class> class TT>
5913 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
5914 tree argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
5916 if (!coerce_template_template_parms
5917 (parmparm
, argparm
, complain
, in_decl
, outer_args
))
5923 if (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (arg
))
5924 && !TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
)))
5925 /* Argument is a parameter pack but parameter is not. */
5930 /* The tsubst call is used to handle cases such as
5932 template <int> class C {};
5933 template <class T, template <T> class TT> class D {};
5936 i.e. the parameter list of TT depends on earlier parameters. */
5937 if (!uses_template_parms (TREE_TYPE (arg
))
5939 (tsubst (TREE_TYPE (parm
), outer_args
, complain
, in_decl
),
5943 if (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (arg
))
5944 && !TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))
5945 /* Argument is a parameter pack but parameter is not. */
5958 /* Return 1 if PARM_PARMS and ARG_PARMS matches using rule for
5959 template template parameters. Both PARM_PARMS and ARG_PARMS are
5960 vectors of TREE_LIST nodes containing TYPE_DECL, TEMPLATE_DECL
5963 Consider the example:
5964 template <class T> class A;
5965 template<template <class U> class TT> class B;
5967 For B<A>, PARM_PARMS are the parameters to TT, while ARG_PARMS are
5968 the parameters to A, and OUTER_ARGS contains A. */
5971 coerce_template_template_parms (tree parm_parms
,
5973 tsubst_flags_t complain
,
5977 int nparms
, nargs
, i
;
5981 gcc_assert (TREE_CODE (parm_parms
) == TREE_VEC
);
5982 gcc_assert (TREE_CODE (arg_parms
) == TREE_VEC
);
5984 nparms
= TREE_VEC_LENGTH (parm_parms
);
5985 nargs
= TREE_VEC_LENGTH (arg_parms
);
5987 /* Determine whether we have a parameter pack at the end of the
5988 template template parameter's template parameter list. */
5989 if (TREE_VEC_ELT (parm_parms
, nparms
- 1) != error_mark_node
)
5991 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, nparms
- 1));
5993 if (parm
== error_mark_node
)
5996 switch (TREE_CODE (parm
))
6000 if (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
)))
6005 if (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))
6015 && !(variadic_p
&& nargs
>= nparms
- 1))
6018 /* Check all of the template parameters except the parameter pack at
6019 the end (if any). */
6020 for (i
= 0; i
< nparms
- variadic_p
; ++i
)
6022 if (TREE_VEC_ELT (parm_parms
, i
) == error_mark_node
6023 || TREE_VEC_ELT (arg_parms
, i
) == error_mark_node
)
6026 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
6027 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
6029 if (!coerce_template_template_parm (parm
, arg
, complain
, in_decl
,
6037 /* Check each of the template parameters in the template
6038 argument against the template parameter pack at the end of
6039 the template template parameter. */
6040 if (TREE_VEC_ELT (parm_parms
, i
) == error_mark_node
)
6043 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
6045 for (; i
< nargs
; ++i
)
6047 if (TREE_VEC_ELT (arg_parms
, i
) == error_mark_node
)
6050 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
6052 if (!coerce_template_template_parm (parm
, arg
, complain
, in_decl
,
6061 /* Verifies that the deduced template arguments (in TARGS) for the
6062 template template parameters (in TPARMS) represent valid bindings,
6063 by comparing the template parameter list of each template argument
6064 to the template parameter list of its corresponding template
6065 template parameter, in accordance with DR150. This
6066 routine can only be called after all template arguments have been
6067 deduced. It will return TRUE if all of the template template
6068 parameter bindings are okay, FALSE otherwise. */
6070 template_template_parm_bindings_ok_p (tree tparms
, tree targs
)
6072 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
6075 /* We're dealing with template parms in this process. */
6076 ++processing_template_decl
;
6078 targs
= INNERMOST_TEMPLATE_ARGS (targs
);
6080 for (i
= 0; i
< ntparms
; ++i
)
6082 tree tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
6083 tree targ
= TREE_VEC_ELT (targs
, i
);
6085 if (TREE_CODE (tparm
) == TEMPLATE_DECL
&& targ
)
6087 tree packed_args
= NULL_TREE
;
6090 if (ARGUMENT_PACK_P (targ
))
6092 /* Look inside the argument pack. */
6093 packed_args
= ARGUMENT_PACK_ARGS (targ
);
6094 len
= TREE_VEC_LENGTH (packed_args
);
6097 for (idx
= 0; idx
< len
; ++idx
)
6099 tree targ_parms
= NULL_TREE
;
6102 /* Extract the next argument from the argument
6104 targ
= TREE_VEC_ELT (packed_args
, idx
);
6106 if (PACK_EXPANSION_P (targ
))
6107 /* Look at the pattern of the pack expansion. */
6108 targ
= PACK_EXPANSION_PATTERN (targ
);
6110 /* Extract the template parameters from the template
6112 if (TREE_CODE (targ
) == TEMPLATE_DECL
)
6113 targ_parms
= DECL_INNERMOST_TEMPLATE_PARMS (targ
);
6114 else if (TREE_CODE (targ
) == TEMPLATE_TEMPLATE_PARM
)
6115 targ_parms
= DECL_INNERMOST_TEMPLATE_PARMS (TYPE_NAME (targ
));
6117 /* Verify that we can coerce the template template
6118 parameters from the template argument to the template
6119 parameter. This requires an exact match. */
6121 && !coerce_template_template_parms
6122 (DECL_INNERMOST_TEMPLATE_PARMS (tparm
),
6137 --processing_template_decl
;
6141 /* Since type attributes aren't mangled, we need to strip them from
6142 template type arguments. */
6145 canonicalize_type_argument (tree arg
, tsubst_flags_t complain
)
6148 if (!arg
|| arg
== error_mark_node
|| arg
== TYPE_CANONICAL (arg
))
6150 mv
= TYPE_MAIN_VARIANT (arg
);
6151 arg
= strip_typedefs (arg
);
6152 if (TYPE_ALIGN (arg
) != TYPE_ALIGN (mv
)
6153 || TYPE_ATTRIBUTES (arg
) != TYPE_ATTRIBUTES (mv
))
6155 if (complain
& tf_warning
)
6156 warning (0, "ignoring attributes on template argument %qT", arg
);
6157 arg
= build_aligned_type (arg
, TYPE_ALIGN (mv
));
6158 arg
= cp_build_type_attribute_variant (arg
, TYPE_ATTRIBUTES (mv
));
6163 /* Convert the indicated template ARG as necessary to match the
6164 indicated template PARM. Returns the converted ARG, or
6165 error_mark_node if the conversion was unsuccessful. Error and
6166 warning messages are issued under control of COMPLAIN. This
6167 conversion is for the Ith parameter in the parameter list. ARGS is
6168 the full set of template arguments deduced so far. */
6171 convert_template_argument (tree parm
,
6174 tsubst_flags_t complain
,
6180 int is_type
, requires_type
, is_tmpl_type
, requires_tmpl_type
;
6182 if (TREE_CODE (arg
) == TREE_LIST
6183 && TREE_CODE (TREE_VALUE (arg
)) == OFFSET_REF
)
6185 /* The template argument was the name of some
6186 member function. That's usually
6187 invalid, but static members are OK. In any
6188 case, grab the underlying fields/functions
6189 and issue an error later if required. */
6190 orig_arg
= TREE_VALUE (arg
);
6191 TREE_TYPE (arg
) = unknown_type_node
;
6196 requires_tmpl_type
= TREE_CODE (parm
) == TEMPLATE_DECL
;
6197 requires_type
= (TREE_CODE (parm
) == TYPE_DECL
6198 || requires_tmpl_type
);
6200 /* When determining whether an argument pack expansion is a template,
6201 look at the pattern. */
6202 if (TREE_CODE (arg
) == TYPE_PACK_EXPANSION
)
6203 arg
= PACK_EXPANSION_PATTERN (arg
);
6205 /* Deal with an injected-class-name used as a template template arg. */
6206 if (requires_tmpl_type
&& CLASS_TYPE_P (arg
))
6208 tree t
= maybe_get_template_decl_from_type_decl (TYPE_NAME (arg
));
6209 if (TREE_CODE (t
) == TEMPLATE_DECL
)
6211 if (cxx_dialect
>= cxx0x
)
6212 /* OK under DR 1004. */;
6213 else if (complain
& tf_warning_or_error
)
6214 pedwarn (input_location
, OPT_Wpedantic
, "injected-class-name %qD"
6215 " used as template template argument", TYPE_NAME (arg
));
6216 else if (flag_pedantic_errors
)
6224 ((TREE_CODE (arg
) == TEMPLATE_DECL
6225 && TREE_CODE (DECL_TEMPLATE_RESULT (arg
)) == TYPE_DECL
)
6226 || (requires_tmpl_type
&& TREE_CODE (arg
) == TYPE_ARGUMENT_PACK
)
6227 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
6228 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
);
6231 && (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
6232 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
))
6233 arg
= TYPE_STUB_DECL (arg
);
6235 is_type
= TYPE_P (arg
) || is_tmpl_type
;
6237 if (requires_type
&& ! is_type
&& TREE_CODE (arg
) == SCOPE_REF
6238 && TREE_CODE (TREE_OPERAND (arg
, 0)) == TEMPLATE_TYPE_PARM
)
6240 if (TREE_CODE (TREE_OPERAND (arg
, 1)) == BIT_NOT_EXPR
)
6242 if (complain
& tf_error
)
6243 error ("invalid use of destructor %qE as a type", orig_arg
);
6244 return error_mark_node
;
6247 permerror (input_location
,
6248 "to refer to a type member of a template parameter, "
6249 "use %<typename %E%>", orig_arg
);
6251 orig_arg
= make_typename_type (TREE_OPERAND (arg
, 0),
6252 TREE_OPERAND (arg
, 1),
6258 if (is_type
!= requires_type
)
6262 if (complain
& tf_error
)
6264 error ("type/value mismatch at argument %d in template "
6265 "parameter list for %qD",
6268 error (" expected a constant of type %qT, got %qT",
6270 (DECL_P (arg
) ? DECL_NAME (arg
) : orig_arg
));
6271 else if (requires_tmpl_type
)
6272 error (" expected a class template, got %qE", orig_arg
);
6274 error (" expected a type, got %qE", orig_arg
);
6277 return error_mark_node
;
6279 if (is_tmpl_type
^ requires_tmpl_type
)
6281 if (in_decl
&& (complain
& tf_error
))
6283 error ("type/value mismatch at argument %d in template "
6284 "parameter list for %qD",
6287 error (" expected a type, got %qT", DECL_NAME (arg
));
6289 error (" expected a class template, got %qT", orig_arg
);
6291 return error_mark_node
;
6296 if (requires_tmpl_type
)
6298 if (template_parameter_pack_p (parm
) && ARGUMENT_PACK_P (orig_arg
))
6300 else if (TREE_CODE (TREE_TYPE (arg
)) == UNBOUND_CLASS_TEMPLATE
)
6301 /* The number of argument required is not known yet.
6302 Just accept it for now. */
6303 val
= TREE_TYPE (arg
);
6306 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
6309 argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
6311 if (coerce_template_template_parms (parmparm
, argparm
,
6317 /* TEMPLATE_TEMPLATE_PARM node is preferred over
6319 if (val
!= error_mark_node
)
6321 if (DECL_TEMPLATE_TEMPLATE_PARM_P (val
))
6322 val
= TREE_TYPE (val
);
6323 if (TREE_CODE (orig_arg
) == TYPE_PACK_EXPANSION
)
6324 val
= make_pack_expansion (val
);
6329 if (in_decl
&& (complain
& tf_error
))
6331 error ("type/value mismatch at argument %d in "
6332 "template parameter list for %qD",
6334 error (" expected a template of type %qD, got %qT",
6338 val
= error_mark_node
;
6344 /* We only form one instance of each template specialization.
6345 Therefore, if we use a non-canonical variant (i.e., a
6346 typedef), any future messages referring to the type will use
6347 the typedef, which is confusing if those future uses do not
6348 themselves also use the typedef. */
6350 val
= canonicalize_type_argument (val
, complain
);
6354 tree t
= tsubst (TREE_TYPE (parm
), args
, complain
, in_decl
);
6356 if (invalid_nontype_parm_type_p (t
, complain
))
6357 return error_mark_node
;
6359 if (template_parameter_pack_p (parm
) && ARGUMENT_PACK_P (orig_arg
))
6361 if (same_type_p (t
, TREE_TYPE (orig_arg
)))
6365 /* Not sure if this is reachable, but it doesn't hurt
6367 error ("type mismatch in nontype parameter pack");
6368 val
= error_mark_node
;
6371 else if (!uses_template_parms (orig_arg
) && !uses_template_parms (t
))
6372 /* We used to call digest_init here. However, digest_init
6373 will report errors, which we don't want when complain
6374 is zero. More importantly, digest_init will try too
6375 hard to convert things: for example, `0' should not be
6376 converted to pointer type at this point according to
6377 the standard. Accepting this is not merely an
6378 extension, since deciding whether or not these
6379 conversions can occur is part of determining which
6380 function template to call, or whether a given explicit
6381 argument specification is valid. */
6382 val
= convert_nontype_argument (t
, orig_arg
, complain
);
6384 val
= strip_typedefs_expr (orig_arg
);
6386 if (val
== NULL_TREE
)
6387 val
= error_mark_node
;
6388 else if (val
== error_mark_node
&& (complain
& tf_error
))
6389 error ("could not convert template argument %qE to %qT", orig_arg
, t
);
6391 if (TREE_CODE (val
) == SCOPE_REF
)
6393 /* Strip typedefs from the SCOPE_REF. */
6394 tree type
= canonicalize_type_argument (TREE_TYPE (val
), complain
);
6395 tree scope
= canonicalize_type_argument (TREE_OPERAND (val
, 0),
6397 val
= build_qualified_name (type
, scope
, TREE_OPERAND (val
, 1),
6398 QUALIFIED_NAME_IS_TEMPLATE (val
));
6405 /* Coerces the remaining template arguments in INNER_ARGS (from
6406 ARG_IDX to the end) into the parameter pack at PARM_IDX in PARMS.
6407 Returns the coerced argument pack. PARM_IDX is the position of this
6408 parameter in the template parameter list. ARGS is the original
6409 template argument list. */
6411 coerce_template_parameter_pack (tree parms
,
6419 tsubst_flags_t complain
)
6421 tree parm
= TREE_VEC_ELT (parms
, parm_idx
);
6422 int nargs
= inner_args
? NUM_TMPL_ARGS (inner_args
) : 0;
6425 tree packed_types
= NULL_TREE
;
6427 if (arg_idx
> nargs
)
6430 packed_args
= make_tree_vec (nargs
- arg_idx
);
6432 if (TREE_CODE (TREE_VALUE (parm
)) == PARM_DECL
6433 && uses_parameter_packs (TREE_TYPE (TREE_VALUE (parm
))))
6435 /* When the template parameter is a non-type template
6436 parameter pack whose type uses parameter packs, we need
6437 to look at each of the template arguments
6438 separately. Build a vector of the types for these
6439 non-type template parameters in PACKED_TYPES. */
6441 = make_pack_expansion (TREE_TYPE (TREE_VALUE (parm
)));
6442 packed_types
= tsubst_pack_expansion (expansion
, args
,
6445 if (packed_types
== error_mark_node
)
6446 return error_mark_node
;
6448 /* Check that we have the right number of arguments. */
6450 && !PACK_EXPANSION_P (TREE_VEC_ELT (inner_args
, arg_idx
))
6451 && nargs
- arg_idx
!= TREE_VEC_LENGTH (packed_types
))
6454 = TREE_VEC_LENGTH (parms
) - 1 + TREE_VEC_LENGTH (packed_types
);
6455 error ("wrong number of template arguments (%d, should be %d)",
6456 nargs
, needed_parms
);
6457 return error_mark_node
;
6460 /* If we aren't able to check the actual arguments now
6461 (because they haven't been expanded yet), we can at least
6462 verify that all of the types used for the non-type
6463 template parameter pack are, in fact, valid for non-type
6464 template parameters. */
6466 && PACK_EXPANSION_P (TREE_VEC_ELT (inner_args
, arg_idx
)))
6468 int j
, len
= TREE_VEC_LENGTH (packed_types
);
6469 for (j
= 0; j
< len
; ++j
)
6471 tree t
= TREE_VEC_ELT (packed_types
, j
);
6472 if (invalid_nontype_parm_type_p (t
, complain
))
6473 return error_mark_node
;
6478 /* Convert the remaining arguments, which will be a part of the
6479 parameter pack "parm". */
6480 for (; arg_idx
< nargs
; ++arg_idx
)
6482 tree arg
= TREE_VEC_ELT (inner_args
, arg_idx
);
6483 tree actual_parm
= TREE_VALUE (parm
);
6485 if (packed_types
&& !PACK_EXPANSION_P (arg
))
6487 /* When we have a vector of types (corresponding to the
6488 non-type template parameter pack that uses parameter
6489 packs in its type, as mention above), and the
6490 argument is not an expansion (which expands to a
6491 currently unknown number of arguments), clone the
6492 parm and give it the next type in PACKED_TYPES. */
6493 actual_parm
= copy_node (actual_parm
);
6494 TREE_TYPE (actual_parm
) =
6495 TREE_VEC_ELT (packed_types
, arg_idx
- parm_idx
);
6498 if (arg
== error_mark_node
)
6500 if (complain
& tf_error
)
6501 error ("template argument %d is invalid", arg_idx
+ 1);
6504 arg
= convert_template_argument (actual_parm
,
6505 arg
, new_args
, complain
, parm_idx
,
6507 if (arg
== error_mark_node
)
6509 TREE_VEC_ELT (packed_args
, arg_idx
- parm_idx
) = arg
;
6512 if (TREE_CODE (TREE_VALUE (parm
)) == TYPE_DECL
6513 || TREE_CODE (TREE_VALUE (parm
)) == TEMPLATE_DECL
)
6514 argument_pack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
6517 argument_pack
= make_node (NONTYPE_ARGUMENT_PACK
);
6518 TREE_TYPE (argument_pack
)
6519 = tsubst (TREE_TYPE (TREE_VALUE (parm
)), new_args
, complain
, in_decl
);
6520 TREE_CONSTANT (argument_pack
) = 1;
6523 SET_ARGUMENT_PACK_ARGS (argument_pack
, packed_args
);
6524 #ifdef ENABLE_CHECKING
6525 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (packed_args
,
6526 TREE_VEC_LENGTH (packed_args
));
6528 return argument_pack
;
6531 /* Returns true if the template argument vector ARGS contains
6532 any pack expansions, false otherwise. */
6535 any_pack_expanson_args_p (tree args
)
6539 for (i
= 0; i
< TREE_VEC_LENGTH (args
); ++i
)
6540 if (PACK_EXPANSION_P (TREE_VEC_ELT (args
, i
)))
6545 /* Convert all template arguments to their appropriate types, and
6546 return a vector containing the innermost resulting template
6547 arguments. If any error occurs, return error_mark_node. Error and
6548 warning messages are issued under control of COMPLAIN.
6550 If REQUIRE_ALL_ARGS is false, argument deduction will be performed
6551 for arguments not specified in ARGS. Otherwise, if
6552 USE_DEFAULT_ARGS is true, default arguments will be used to fill in
6553 unspecified arguments. If REQUIRE_ALL_ARGS is true, but
6554 USE_DEFAULT_ARGS is false, then all arguments must be specified in
6558 coerce_template_parms (tree parms
,
6561 tsubst_flags_t complain
,
6562 bool require_all_args
,
6563 bool use_default_args
)
6565 int nparms
, nargs
, parm_idx
, arg_idx
, lost
= 0;
6568 tree new_inner_args
;
6569 int saved_unevaluated_operand
;
6570 int saved_inhibit_evaluation_warnings
;
6572 /* When used as a boolean value, indicates whether this is a
6573 variadic template parameter list. Since it's an int, we can also
6574 subtract it from nparms to get the number of non-variadic
6577 int post_variadic_parms
= 0;
6579 if (args
== error_mark_node
)
6580 return error_mark_node
;
6582 nparms
= TREE_VEC_LENGTH (parms
);
6584 /* Determine if there are any parameter packs. */
6585 for (parm_idx
= 0; parm_idx
< nparms
; ++parm_idx
)
6587 tree tparm
= TREE_VALUE (TREE_VEC_ELT (parms
, parm_idx
));
6589 ++post_variadic_parms
;
6590 if (template_parameter_pack_p (tparm
))
6594 inner_args
= INNERMOST_TEMPLATE_ARGS (args
);
6595 /* If there are no parameters that follow a parameter pack, we need to
6596 expand any argument packs so that we can deduce a parameter pack from
6597 some non-packed args followed by an argument pack, as in variadic85.C.
6598 If there are such parameters, we need to leave argument packs intact
6599 so the arguments are assigned properly. This can happen when dealing
6600 with a nested class inside a partial specialization of a class
6601 template, as in variadic92.C, or when deducing a template parameter pack
6602 from a sub-declarator, as in variadic114.C. */
6603 if (!post_variadic_parms
)
6604 inner_args
= expand_template_argument_pack (inner_args
);
6606 nargs
= inner_args
? NUM_TMPL_ARGS (inner_args
) : 0;
6607 if ((nargs
> nparms
&& !variadic_p
)
6608 || (nargs
< nparms
- variadic_p
6610 && !any_pack_expanson_args_p (inner_args
)
6611 && (!use_default_args
6612 || (TREE_VEC_ELT (parms
, nargs
) != error_mark_node
6613 && !TREE_PURPOSE (TREE_VEC_ELT (parms
, nargs
))))))
6615 if (complain
& tf_error
)
6619 nparms
-= variadic_p
;
6620 error ("wrong number of template arguments "
6621 "(%d, should be %d or more)", nargs
, nparms
);
6624 error ("wrong number of template arguments "
6625 "(%d, should be %d)", nargs
, nparms
);
6628 error ("provided for %q+D", in_decl
);
6631 return error_mark_node
;
6634 /* We need to evaluate the template arguments, even though this
6635 template-id may be nested within a "sizeof". */
6636 saved_unevaluated_operand
= cp_unevaluated_operand
;
6637 cp_unevaluated_operand
= 0;
6638 saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
6639 c_inhibit_evaluation_warnings
= 0;
6640 new_inner_args
= make_tree_vec (nparms
);
6641 new_args
= add_outermost_template_args (args
, new_inner_args
);
6642 for (parm_idx
= 0, arg_idx
= 0; parm_idx
< nparms
; parm_idx
++, arg_idx
++)
6647 /* Get the Ith template parameter. */
6648 parm
= TREE_VEC_ELT (parms
, parm_idx
);
6650 if (parm
== error_mark_node
)
6652 TREE_VEC_ELT (new_inner_args
, arg_idx
) = error_mark_node
;
6656 /* Calculate the next argument. */
6657 if (arg_idx
< nargs
)
6658 arg
= TREE_VEC_ELT (inner_args
, arg_idx
);
6662 if (template_parameter_pack_p (TREE_VALUE (parm
))
6663 && !(arg
&& ARGUMENT_PACK_P (arg
)))
6665 /* All remaining arguments will be placed in the
6666 template parameter pack PARM. */
6667 arg
= coerce_template_parameter_pack (parms
, parm_idx
, args
,
6668 inner_args
, arg_idx
,
6672 /* Store this argument. */
6673 if (arg
== error_mark_node
)
6675 TREE_VEC_ELT (new_inner_args
, parm_idx
) = arg
;
6677 /* We are done with all of the arguments. */
6684 if (PACK_EXPANSION_P (arg
))
6686 /* We don't know how many args we have yet, just
6687 use the unconverted ones for now. */
6688 new_inner_args
= inner_args
;
6692 else if (require_all_args
)
6694 /* There must be a default arg in this case. */
6695 arg
= tsubst_template_arg (TREE_PURPOSE (parm
), new_args
,
6697 /* The position of the first default template argument,
6698 is also the number of non-defaulted arguments in NEW_INNER_ARGS.
6700 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
))
6701 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
, arg_idx
);
6706 if (arg
== error_mark_node
)
6708 if (complain
& tf_error
)
6709 error ("template argument %d is invalid", arg_idx
+ 1);
6712 /* This only occurs if there was an error in the template
6713 parameter list itself (which we would already have
6714 reported) that we are trying to recover from, e.g., a class
6715 template with a parameter list such as
6716 template<typename..., typename>. */
6719 arg
= convert_template_argument (TREE_VALUE (parm
),
6720 arg
, new_args
, complain
,
6723 if (arg
== error_mark_node
)
6725 TREE_VEC_ELT (new_inner_args
, arg_idx
) = arg
;
6727 cp_unevaluated_operand
= saved_unevaluated_operand
;
6728 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
6731 return error_mark_node
;
6733 #ifdef ENABLE_CHECKING
6734 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
))
6735 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
,
6736 TREE_VEC_LENGTH (new_inner_args
));
6739 return new_inner_args
;
6742 /* Like coerce_template_parms. If PARMS represents all template
6743 parameters levels, this function returns a vector of vectors
6744 representing all the resulting argument levels. Note that in this
6745 case, only the innermost arguments are coerced because the
6746 outermost ones are supposed to have been coerced already.
6748 Otherwise, if PARMS represents only (the innermost) vector of
6749 parameters, this function returns a vector containing just the
6750 innermost resulting arguments. */
6753 coerce_innermost_template_parms (tree parms
,
6756 tsubst_flags_t complain
,
6757 bool require_all_args
,
6758 bool use_default_args
)
6760 int parms_depth
= TMPL_PARMS_DEPTH (parms
);
6761 int args_depth
= TMPL_ARGS_DEPTH (args
);
6764 if (parms_depth
> 1)
6766 coerced_args
= make_tree_vec (parms_depth
);
6770 for (level
= parms
, cur_depth
= parms_depth
;
6771 parms_depth
> 0 && level
!= NULL_TREE
;
6772 level
= TREE_CHAIN (level
), --cur_depth
)
6775 if (cur_depth
== args_depth
)
6776 l
= coerce_template_parms (TREE_VALUE (level
),
6777 args
, in_decl
, complain
,
6781 l
= TMPL_ARGS_LEVEL (args
, cur_depth
);
6783 if (l
== error_mark_node
)
6784 return error_mark_node
;
6786 SET_TMPL_ARGS_LEVEL (coerced_args
, cur_depth
, l
);
6790 coerced_args
= coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parms
),
6791 args
, in_decl
, complain
,
6794 return coerced_args
;
6797 /* Returns 1 if template args OT and NT are equivalent. */
6800 template_args_equal (tree ot
, tree nt
)
6804 if (nt
== NULL_TREE
|| ot
== NULL_TREE
)
6807 if (TREE_CODE (nt
) == TREE_VEC
)
6808 /* For member templates */
6809 return TREE_CODE (ot
) == TREE_VEC
&& comp_template_args (ot
, nt
);
6810 else if (PACK_EXPANSION_P (ot
))
6811 return (PACK_EXPANSION_P (nt
)
6812 && template_args_equal (PACK_EXPANSION_PATTERN (ot
),
6813 PACK_EXPANSION_PATTERN (nt
))
6814 && template_args_equal (PACK_EXPANSION_EXTRA_ARGS (ot
),
6815 PACK_EXPANSION_EXTRA_ARGS (nt
)));
6816 else if (ARGUMENT_PACK_P (ot
))
6821 if (!ARGUMENT_PACK_P (nt
))
6824 opack
= ARGUMENT_PACK_ARGS (ot
);
6825 npack
= ARGUMENT_PACK_ARGS (nt
);
6826 len
= TREE_VEC_LENGTH (opack
);
6827 if (TREE_VEC_LENGTH (npack
) != len
)
6829 for (i
= 0; i
< len
; ++i
)
6830 if (!template_args_equal (TREE_VEC_ELT (opack
, i
),
6831 TREE_VEC_ELT (npack
, i
)))
6835 else if (ot
&& TREE_CODE (ot
) == ARGUMENT_PACK_SELECT
)
6837 /* We get here probably because we are in the middle of substituting
6838 into the pattern of a pack expansion. In that case the
6839 ARGUMENT_PACK_SELECT temporarily replaces the pack argument we are
6840 interested in. So we want to use the initial pack argument for
6842 ot
= ARGUMENT_PACK_SELECT_FROM_PACK (ot
);
6843 if (nt
&& TREE_CODE (nt
) == ARGUMENT_PACK_SELECT
)
6844 nt
= ARGUMENT_PACK_SELECT_FROM_PACK (nt
);
6845 return template_args_equal (ot
, nt
);
6847 else if (TYPE_P (nt
))
6848 return TYPE_P (ot
) && same_type_p (ot
, nt
);
6849 else if (TREE_CODE (ot
) == TREE_VEC
|| TYPE_P (ot
))
6852 return cp_tree_equal (ot
, nt
);
6855 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets of
6856 template arguments. Returns 0 otherwise, and updates OLDARG_PTR and
6857 NEWARG_PTR with the offending arguments if they are non-NULL. */
6860 comp_template_args_with_info (tree oldargs
, tree newargs
,
6861 tree
*oldarg_ptr
, tree
*newarg_ptr
)
6865 if (oldargs
== newargs
)
6868 if (!oldargs
|| !newargs
)
6871 if (TREE_VEC_LENGTH (oldargs
) != TREE_VEC_LENGTH (newargs
))
6874 for (i
= 0; i
< TREE_VEC_LENGTH (oldargs
); ++i
)
6876 tree nt
= TREE_VEC_ELT (newargs
, i
);
6877 tree ot
= TREE_VEC_ELT (oldargs
, i
);
6879 if (! template_args_equal (ot
, nt
))
6881 if (oldarg_ptr
!= NULL
)
6883 if (newarg_ptr
!= NULL
)
6891 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets
6892 of template arguments. Returns 0 otherwise. */
6895 comp_template_args (tree oldargs
, tree newargs
)
6897 return comp_template_args_with_info (oldargs
, newargs
, NULL
, NULL
);
6901 add_pending_template (tree d
)
6903 tree ti
= (TYPE_P (d
)
6904 ? CLASSTYPE_TEMPLATE_INFO (d
)
6905 : DECL_TEMPLATE_INFO (d
));
6906 struct pending_template
*pt
;
6909 if (TI_PENDING_TEMPLATE_FLAG (ti
))
6912 /* We are called both from instantiate_decl, where we've already had a
6913 tinst_level pushed, and instantiate_template, where we haven't.
6915 level
= !current_tinst_level
|| current_tinst_level
->decl
!= d
;
6918 push_tinst_level (d
);
6920 pt
= ggc_alloc_pending_template ();
6922 pt
->tinst
= current_tinst_level
;
6923 if (last_pending_template
)
6924 last_pending_template
->next
= pt
;
6926 pending_templates
= pt
;
6928 last_pending_template
= pt
;
6930 TI_PENDING_TEMPLATE_FLAG (ti
) = 1;
6937 /* Return a TEMPLATE_ID_EXPR corresponding to the indicated FNS and
6938 ARGLIST. Valid choices for FNS are given in the cp-tree.def
6939 documentation for TEMPLATE_ID_EXPR. */
6942 lookup_template_function (tree fns
, tree arglist
)
6946 if (fns
== error_mark_node
|| arglist
== error_mark_node
)
6947 return error_mark_node
;
6949 gcc_assert (!arglist
|| TREE_CODE (arglist
) == TREE_VEC
);
6951 if (!is_overloaded_fn (fns
) && !identifier_p (fns
))
6953 error ("%q#D is not a function template", fns
);
6954 return error_mark_node
;
6957 if (BASELINK_P (fns
))
6959 BASELINK_FUNCTIONS (fns
) = build2 (TEMPLATE_ID_EXPR
,
6961 BASELINK_FUNCTIONS (fns
),
6966 type
= TREE_TYPE (fns
);
6967 if (TREE_CODE (fns
) == OVERLOAD
|| !type
)
6968 type
= unknown_type_node
;
6970 return build2 (TEMPLATE_ID_EXPR
, type
, fns
, arglist
);
6973 /* Within the scope of a template class S<T>, the name S gets bound
6974 (in build_self_reference) to a TYPE_DECL for the class, not a
6975 TEMPLATE_DECL. If DECL is a TYPE_DECL for current_class_type,
6976 or one of its enclosing classes, and that type is a template,
6977 return the associated TEMPLATE_DECL. Otherwise, the original
6980 Also handle the case when DECL is a TREE_LIST of ambiguous
6981 injected-class-names from different bases. */
6984 maybe_get_template_decl_from_type_decl (tree decl
)
6986 if (decl
== NULL_TREE
)
6989 /* DR 176: A lookup that finds an injected-class-name (10.2
6990 [class.member.lookup]) can result in an ambiguity in certain cases
6991 (for example, if it is found in more than one base class). If all of
6992 the injected-class-names that are found refer to specializations of
6993 the same class template, and if the name is followed by a
6994 template-argument-list, the reference refers to the class template
6995 itself and not a specialization thereof, and is not ambiguous. */
6996 if (TREE_CODE (decl
) == TREE_LIST
)
6998 tree t
, tmpl
= NULL_TREE
;
6999 for (t
= decl
; t
; t
= TREE_CHAIN (t
))
7001 tree elt
= maybe_get_template_decl_from_type_decl (TREE_VALUE (t
));
7004 else if (tmpl
!= elt
)
7007 if (tmpl
&& t
== NULL_TREE
)
7013 return (decl
!= NULL_TREE
7014 && DECL_SELF_REFERENCE_P (decl
)
7015 && CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (decl
)))
7016 ? CLASSTYPE_TI_TEMPLATE (TREE_TYPE (decl
)) : decl
;
7019 /* Given an IDENTIFIER_NODE (type TEMPLATE_DECL) and a chain of
7020 parameters, find the desired type.
7022 D1 is the PTYPENAME terminal, and ARGLIST is the list of arguments.
7024 IN_DECL, if non-NULL, is the template declaration we are trying to
7027 If ENTERING_SCOPE is nonzero, we are about to enter the scope of
7028 the class we are looking up.
7030 Issue error and warning messages under control of COMPLAIN.
7032 If the template class is really a local class in a template
7033 function, then the FUNCTION_CONTEXT is the function in which it is
7036 ??? Note that this function is currently called *twice* for each
7037 template-id: the first time from the parser, while creating the
7038 incomplete type (finish_template_type), and the second type during the
7039 real instantiation (instantiate_template_class). This is surely something
7040 that we want to avoid. It also causes some problems with argument
7041 coercion (see convert_nontype_argument for more information on this). */
7044 lookup_template_class_1 (tree d1
, tree arglist
, tree in_decl
, tree context
,
7045 int entering_scope
, tsubst_flags_t complain
)
7047 tree templ
= NULL_TREE
, parmlist
;
7054 if (identifier_p (d1
))
7056 tree value
= innermost_non_namespace_value (d1
);
7057 if (value
&& DECL_TEMPLATE_TEMPLATE_PARM_P (value
))
7062 push_decl_namespace (context
);
7063 templ
= lookup_name (d1
);
7064 templ
= maybe_get_template_decl_from_type_decl (templ
);
7066 pop_decl_namespace ();
7069 context
= DECL_CONTEXT (templ
);
7071 else if (TREE_CODE (d1
) == TYPE_DECL
&& MAYBE_CLASS_TYPE_P (TREE_TYPE (d1
)))
7073 tree type
= TREE_TYPE (d1
);
7075 /* If we are declaring a constructor, say A<T>::A<T>, we will get
7076 an implicit typename for the second A. Deal with it. */
7077 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
7078 type
= TREE_TYPE (type
);
7080 if (CLASSTYPE_TEMPLATE_INFO (type
))
7082 templ
= CLASSTYPE_TI_TEMPLATE (type
);
7083 d1
= DECL_NAME (templ
);
7086 else if (TREE_CODE (d1
) == ENUMERAL_TYPE
7087 || (TYPE_P (d1
) && MAYBE_CLASS_TYPE_P (d1
)))
7089 templ
= TYPE_TI_TEMPLATE (d1
);
7090 d1
= DECL_NAME (templ
);
7092 else if (TREE_CODE (d1
) == TEMPLATE_DECL
7093 && DECL_TEMPLATE_RESULT (d1
)
7094 && TREE_CODE (DECL_TEMPLATE_RESULT (d1
)) == TYPE_DECL
)
7097 d1
= DECL_NAME (templ
);
7098 context
= DECL_CONTEXT (templ
);
7101 /* Issue an error message if we didn't find a template. */
7104 if (complain
& tf_error
)
7105 error ("%qT is not a template", d1
);
7106 return error_mark_node
;
7109 if (TREE_CODE (templ
) != TEMPLATE_DECL
7110 /* Make sure it's a user visible template, if it was named by
7112 || ((complain
& tf_user
) && !DECL_TEMPLATE_PARM_P (templ
)
7113 && !PRIMARY_TEMPLATE_P (templ
)))
7115 if (complain
& tf_error
)
7117 error ("non-template type %qT used as a template", d1
);
7119 error ("for template declaration %q+D", in_decl
);
7121 return error_mark_node
;
7124 complain
&= ~tf_user
;
7126 if (DECL_TEMPLATE_TEMPLATE_PARM_P (templ
))
7128 /* Create a new TEMPLATE_DECL and TEMPLATE_TEMPLATE_PARM node to store
7129 template arguments */
7135 parmlist
= DECL_INNERMOST_TEMPLATE_PARMS (templ
);
7137 /* Consider an example where a template template parameter declared as
7139 template <class T, class U = std::allocator<T> > class TT
7141 The template parameter level of T and U are one level larger than
7142 of TT. To proper process the default argument of U, say when an
7143 instantiation `TT<int>' is seen, we need to build the full
7144 arguments containing {int} as the innermost level. Outer levels,
7145 available when not appearing as default template argument, can be
7146 obtained from the arguments of the enclosing template.
7148 Suppose that TT is later substituted with std::vector. The above
7149 instantiation is `TT<int, std::allocator<T> >' with TT at
7150 level 1, and T at level 2, while the template arguments at level 1
7151 becomes {std::vector} and the inner level 2 is {int}. */
7153 outer
= DECL_CONTEXT (templ
);
7155 outer
= TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (outer
)));
7156 else if (current_template_parms
)
7157 /* This is an argument of the current template, so we haven't set
7158 DECL_CONTEXT yet. */
7159 outer
= current_template_args ();
7162 arglist
= add_to_template_args (outer
, arglist
);
7164 arglist2
= coerce_template_parms (parmlist
, arglist
, templ
,
7166 /*require_all_args=*/true,
7167 /*use_default_args=*/true);
7168 if (arglist2
== error_mark_node
7169 || (!uses_template_parms (arglist2
)
7170 && check_instantiated_args (templ
, arglist2
, complain
)))
7171 return error_mark_node
;
7173 parm
= bind_template_template_parm (TREE_TYPE (templ
), arglist2
);
7178 tree template_type
= TREE_TYPE (templ
);
7181 tree found
= NULL_TREE
;
7184 int is_dependent_type
;
7185 int use_partial_inst_tmpl
= false;
7187 if (template_type
== error_mark_node
)
7188 /* An error occured while building the template TEMPL, and a
7189 diagnostic has most certainly been emitted for that
7190 already. Let's propagate that error. */
7191 return error_mark_node
;
7193 gen_tmpl
= most_general_template (templ
);
7194 parmlist
= DECL_TEMPLATE_PARMS (gen_tmpl
);
7195 parm_depth
= TMPL_PARMS_DEPTH (parmlist
);
7196 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
7198 if (arg_depth
== 1 && parm_depth
> 1)
7200 /* We've been given an incomplete set of template arguments.
7203 template <class T> struct S1 {
7204 template <class U> struct S2 {};
7205 template <class U> struct S2<U*> {};
7208 we will be called with an ARGLIST of `U*', but the
7209 TEMPLATE will be `template <class T> template
7210 <class U> struct S1<T>::S2'. We must fill in the missing
7213 = add_outermost_template_args (TYPE_TI_ARGS (TREE_TYPE (templ
)),
7215 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
7218 /* Now we should have enough arguments. */
7219 gcc_assert (parm_depth
== arg_depth
);
7221 /* From here on, we're only interested in the most general
7224 /* Calculate the BOUND_ARGS. These will be the args that are
7225 actually tsubst'd into the definition to create the
7229 /* We have multiple levels of arguments to coerce, at once. */
7231 int saved_depth
= TMPL_ARGS_DEPTH (arglist
);
7233 tree bound_args
= make_tree_vec (parm_depth
);
7235 for (i
= saved_depth
,
7236 t
= DECL_TEMPLATE_PARMS (gen_tmpl
);
7237 i
> 0 && t
!= NULL_TREE
;
7238 --i
, t
= TREE_CHAIN (t
))
7241 if (i
== saved_depth
)
7242 a
= coerce_template_parms (TREE_VALUE (t
),
7245 /*require_all_args=*/true,
7246 /*use_default_args=*/true);
7248 /* Outer levels should have already been coerced. */
7249 a
= TMPL_ARGS_LEVEL (arglist
, i
);
7251 /* Don't process further if one of the levels fails. */
7252 if (a
== error_mark_node
)
7254 /* Restore the ARGLIST to its full size. */
7255 TREE_VEC_LENGTH (arglist
) = saved_depth
;
7256 return error_mark_node
;
7259 SET_TMPL_ARGS_LEVEL (bound_args
, i
, a
);
7261 /* We temporarily reduce the length of the ARGLIST so
7262 that coerce_template_parms will see only the arguments
7263 corresponding to the template parameters it is
7265 TREE_VEC_LENGTH (arglist
)--;
7268 /* Restore the ARGLIST to its full size. */
7269 TREE_VEC_LENGTH (arglist
) = saved_depth
;
7271 arglist
= bound_args
;
7275 = coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parmlist
),
7276 INNERMOST_TEMPLATE_ARGS (arglist
),
7279 /*require_all_args=*/true,
7280 /*use_default_args=*/true);
7282 if (arglist
== error_mark_node
)
7283 /* We were unable to bind the arguments. */
7284 return error_mark_node
;
7286 /* In the scope of a template class, explicit references to the
7287 template class refer to the type of the template, not any
7288 instantiation of it. For example, in:
7290 template <class T> class C { void f(C<T>); }
7292 the `C<T>' is just the same as `C'. Outside of the
7293 class, however, such a reference is an instantiation. */
7295 || !PRIMARY_TEMPLATE_P (gen_tmpl
)
7296 || currently_open_class (template_type
))
7297 /* comp_template_args is expensive, check it last. */
7298 && comp_template_args (TYPE_TI_ARGS (template_type
),
7300 return template_type
;
7302 /* If we already have this specialization, return it. */
7303 elt
.tmpl
= gen_tmpl
;
7305 hash
= hash_specialization (&elt
);
7306 entry
= (spec_entry
*) htab_find_with_hash (type_specializations
,
7312 is_dependent_type
= uses_template_parms (arglist
);
7314 /* If the deduced arguments are invalid, then the binding
7316 if (!is_dependent_type
7317 && check_instantiated_args (gen_tmpl
,
7318 INNERMOST_TEMPLATE_ARGS (arglist
),
7320 return error_mark_node
;
7322 if (!is_dependent_type
7323 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
7324 && !LAMBDA_TYPE_P (TREE_TYPE (gen_tmpl
))
7325 && TREE_CODE (CP_DECL_CONTEXT (gen_tmpl
)) == NAMESPACE_DECL
)
7327 found
= xref_tag_from_type (TREE_TYPE (gen_tmpl
),
7328 DECL_NAME (gen_tmpl
),
7329 /*tag_scope=*/ts_global
);
7333 context
= tsubst (DECL_CONTEXT (gen_tmpl
), arglist
,
7335 if (context
== error_mark_node
)
7336 return error_mark_node
;
7339 context
= global_namespace
;
7341 /* Create the type. */
7342 if (TREE_CODE (template_type
) == ENUMERAL_TYPE
)
7344 if (!is_dependent_type
)
7346 set_current_access_from_decl (TYPE_NAME (template_type
));
7347 t
= start_enum (TYPE_IDENTIFIER (template_type
), NULL_TREE
,
7348 tsubst (ENUM_UNDERLYING_TYPE (template_type
),
7349 arglist
, complain
, in_decl
),
7350 SCOPED_ENUM_P (template_type
), NULL
);
7354 /* We don't want to call start_enum for this type, since
7355 the values for the enumeration constants may involve
7356 template parameters. And, no one should be interested
7357 in the enumeration constants for such a type. */
7358 t
= cxx_make_type (ENUMERAL_TYPE
);
7359 SET_SCOPED_ENUM_P (t
, SCOPED_ENUM_P (template_type
));
7361 SET_OPAQUE_ENUM_P (t
, OPAQUE_ENUM_P (template_type
));
7362 ENUM_FIXED_UNDERLYING_TYPE_P (t
)
7363 = ENUM_FIXED_UNDERLYING_TYPE_P (template_type
);
7365 else if (DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
7367 /* The user referred to a specialization of an alias
7368 template represented by GEN_TMPL.
7370 [temp.alias]/2 says:
7372 When a template-id refers to the specialization of an
7373 alias template, it is equivalent to the associated
7374 type obtained by substitution of its
7375 template-arguments for the template-parameters in the
7376 type-id of the alias template. */
7378 t
= tsubst (TREE_TYPE (gen_tmpl
), arglist
, complain
, in_decl
);
7379 /* Note that the call above (by indirectly calling
7380 register_specialization in tsubst_decl) registers the
7381 TYPE_DECL representing the specialization of the alias
7382 template. So next time someone substitutes ARGLIST for
7383 the template parms into the alias template (GEN_TMPL),
7384 she'll get that TYPE_DECL back. */
7386 if (t
== error_mark_node
)
7389 else if (CLASS_TYPE_P (template_type
))
7391 t
= make_class_type (TREE_CODE (template_type
));
7392 CLASSTYPE_DECLARED_CLASS (t
)
7393 = CLASSTYPE_DECLARED_CLASS (template_type
);
7394 SET_CLASSTYPE_IMPLICIT_INSTANTIATION (t
);
7395 TYPE_FOR_JAVA (t
) = TYPE_FOR_JAVA (template_type
);
7397 /* A local class. Make sure the decl gets registered properly. */
7398 if (context
== current_function_decl
)
7399 pushtag (DECL_NAME (gen_tmpl
), t
, /*tag_scope=*/ts_current
);
7401 if (comp_template_args (CLASSTYPE_TI_ARGS (template_type
), arglist
))
7402 /* This instantiation is another name for the primary
7403 template type. Set the TYPE_CANONICAL field
7405 TYPE_CANONICAL (t
) = template_type
;
7406 else if (any_template_arguments_need_structural_equality_p (arglist
))
7407 /* Some of the template arguments require structural
7408 equality testing, so this template class requires
7409 structural equality testing. */
7410 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7415 /* If we called start_enum or pushtag above, this information
7416 will already be set up. */
7419 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
7421 type_decl
= create_implicit_typedef (DECL_NAME (gen_tmpl
), t
);
7422 DECL_CONTEXT (type_decl
) = TYPE_CONTEXT (t
);
7423 DECL_SOURCE_LOCATION (type_decl
)
7424 = DECL_SOURCE_LOCATION (TYPE_STUB_DECL (template_type
));
7427 type_decl
= TYPE_NAME (t
);
7429 if (CLASS_TYPE_P (template_type
))
7431 TREE_PRIVATE (type_decl
)
7432 = TREE_PRIVATE (TYPE_MAIN_DECL (template_type
));
7433 TREE_PROTECTED (type_decl
)
7434 = TREE_PROTECTED (TYPE_MAIN_DECL (template_type
));
7435 if (CLASSTYPE_VISIBILITY_SPECIFIED (template_type
))
7437 DECL_VISIBILITY_SPECIFIED (type_decl
) = 1;
7438 DECL_VISIBILITY (type_decl
) = CLASSTYPE_VISIBILITY (template_type
);
7442 /* Let's consider the explicit specialization of a member
7443 of a class template specialization that is implicitely instantiated,
7448 template<class U> struct M {}; //#0
7453 struct S<int>::M<char> //#1
7457 [temp.expl.spec]/4 says this is valid.
7459 In this case, when we write:
7462 M is instantiated from the CLASSTYPE_TI_TEMPLATE of #1, not from
7465 When we encounter #1, we want to store the partial instantiation
7466 of M (template<class T> S<int>::M<T>) in it's CLASSTYPE_TI_TEMPLATE.
7468 For all cases other than this "explicit specialization of member of a
7469 class template", we just want to store the most general template into
7470 the CLASSTYPE_TI_TEMPLATE of M.
7472 This case of "explicit specialization of member of a class template"
7474 1/ the enclosing class is an instantiation of, and therefore not
7475 the same as, the context of the most general template, and
7476 2/ we aren't looking at the partial instantiation itself, i.e.
7477 the innermost arguments are not the same as the innermost parms of
7478 the most general template.
7480 So it's only when 1/ and 2/ happens that we want to use the partial
7481 instantiation of the member template in lieu of its most general
7484 if (PRIMARY_TEMPLATE_P (gen_tmpl
)
7485 && TMPL_ARGS_HAVE_MULTIPLE_LEVELS (arglist
)
7486 /* the enclosing class must be an instantiation... */
7487 && CLASS_TYPE_P (context
)
7488 && !same_type_p (context
, DECL_CONTEXT (gen_tmpl
)))
7490 tree partial_inst_args
;
7491 TREE_VEC_LENGTH (arglist
)--;
7492 ++processing_template_decl
;
7494 tsubst (INNERMOST_TEMPLATE_ARGS
7495 (TYPE_TI_ARGS (TREE_TYPE (gen_tmpl
))),
7496 arglist
, complain
, NULL_TREE
);
7497 --processing_template_decl
;
7498 TREE_VEC_LENGTH (arglist
)++;
7499 use_partial_inst_tmpl
=
7500 /*...and we must not be looking at the partial instantiation
7502 !comp_template_args (INNERMOST_TEMPLATE_ARGS (arglist
),
7506 if (!use_partial_inst_tmpl
)
7507 /* This case is easy; there are no member templates involved. */
7511 /* This is a full instantiation of a member template. Find
7512 the partial instantiation of which this is an instance. */
7514 /* Temporarily reduce by one the number of levels in the ARGLIST
7515 so as to avoid comparing the last set of arguments. */
7516 TREE_VEC_LENGTH (arglist
)--;
7517 found
= tsubst (gen_tmpl
, arglist
, complain
, NULL_TREE
);
7518 TREE_VEC_LENGTH (arglist
)++;
7519 /* FOUND is either a proper class type, or an alias
7520 template specialization. In the later case, it's a
7521 TYPE_DECL, resulting from the substituting of arguments
7522 for parameters in the TYPE_DECL of the alias template
7523 done earlier. So be careful while getting the template
7525 found
= TREE_CODE (found
) == TYPE_DECL
7526 ? TYPE_TI_TEMPLATE (TREE_TYPE (found
))
7527 : CLASSTYPE_TI_TEMPLATE (found
);
7530 SET_TYPE_TEMPLATE_INFO (t
, build_template_info (found
, arglist
));
7533 slot
= htab_find_slot_with_hash (type_specializations
,
7534 &elt
, hash
, INSERT
);
7535 entry
= ggc_alloc_spec_entry ();
7539 /* Note this use of the partial instantiation so we can check it
7540 later in maybe_process_partial_specialization. */
7541 DECL_TEMPLATE_INSTANTIATIONS (templ
)
7542 = tree_cons (arglist
, t
,
7543 DECL_TEMPLATE_INSTANTIATIONS (templ
));
7545 if (TREE_CODE (template_type
) == ENUMERAL_TYPE
&& !is_dependent_type
)
7546 /* Now that the type has been registered on the instantiations
7547 list, we set up the enumerators. Because the enumeration
7548 constants may involve the enumeration type itself, we make
7549 sure to register the type first, and then create the
7550 constants. That way, doing tsubst_expr for the enumeration
7551 constants won't result in recursive calls here; we'll find
7552 the instantiation and exit above. */
7553 tsubst_enum (template_type
, t
, arglist
);
7555 if (CLASS_TYPE_P (template_type
) && is_dependent_type
)
7556 /* If the type makes use of template parameters, the
7557 code that generates debugging information will crash. */
7558 DECL_IGNORED_P (TYPE_STUB_DECL (t
)) = 1;
7560 /* Possibly limit visibility based on template args. */
7561 TREE_PUBLIC (type_decl
) = 1;
7562 determine_visibility (type_decl
);
7568 /* Wrapper for lookup_template_class_1. */
7571 lookup_template_class (tree d1
, tree arglist
, tree in_decl
, tree context
,
7572 int entering_scope
, tsubst_flags_t complain
)
7575 timevar_push (TV_TEMPLATE_INST
);
7576 ret
= lookup_template_class_1 (d1
, arglist
, in_decl
, context
,
7577 entering_scope
, complain
);
7578 timevar_pop (TV_TEMPLATE_INST
);
7586 /* True when we should also visit template parameters that occur in
7587 non-deduced contexts. */
7588 bool include_nondeduced_p
;
7589 struct pointer_set_t
*visited
;
7592 /* Called from for_each_template_parm via walk_tree. */
7595 for_each_template_parm_r (tree
*tp
, int *walk_subtrees
, void *d
)
7598 struct pair_fn_data
*pfd
= (struct pair_fn_data
*) d
;
7599 tree_fn_t fn
= pfd
->fn
;
7600 void *data
= pfd
->data
;
7603 && (pfd
->include_nondeduced_p
|| TREE_CODE (t
) != TYPENAME_TYPE
)
7604 && for_each_template_parm (TYPE_CONTEXT (t
), fn
, data
, pfd
->visited
,
7605 pfd
->include_nondeduced_p
))
7606 return error_mark_node
;
7608 switch (TREE_CODE (t
))
7611 if (TYPE_PTRMEMFUNC_P (t
))
7617 if (!TYPE_TEMPLATE_INFO (t
))
7619 else if (for_each_template_parm (TYPE_TI_ARGS (t
),
7620 fn
, data
, pfd
->visited
,
7621 pfd
->include_nondeduced_p
))
7622 return error_mark_node
;
7626 if (for_each_template_parm (TYPE_MIN_VALUE (t
),
7627 fn
, data
, pfd
->visited
,
7628 pfd
->include_nondeduced_p
)
7629 || for_each_template_parm (TYPE_MAX_VALUE (t
),
7630 fn
, data
, pfd
->visited
,
7631 pfd
->include_nondeduced_p
))
7632 return error_mark_node
;
7636 /* Since we're not going to walk subtrees, we have to do this
7638 if (for_each_template_parm (TYPE_METHOD_BASETYPE (t
), fn
, data
,
7639 pfd
->visited
, pfd
->include_nondeduced_p
))
7640 return error_mark_node
;
7644 /* Check the return type. */
7645 if (for_each_template_parm (TREE_TYPE (t
), fn
, data
, pfd
->visited
,
7646 pfd
->include_nondeduced_p
))
7647 return error_mark_node
;
7649 /* Check the parameter types. Since default arguments are not
7650 instantiated until they are needed, the TYPE_ARG_TYPES may
7651 contain expressions that involve template parameters. But,
7652 no-one should be looking at them yet. And, once they're
7653 instantiated, they don't contain template parameters, so
7654 there's no point in looking at them then, either. */
7658 for (parm
= TYPE_ARG_TYPES (t
); parm
; parm
= TREE_CHAIN (parm
))
7659 if (for_each_template_parm (TREE_VALUE (parm
), fn
, data
,
7660 pfd
->visited
, pfd
->include_nondeduced_p
))
7661 return error_mark_node
;
7663 /* Since we've already handled the TYPE_ARG_TYPES, we don't
7664 want walk_tree walking into them itself. */
7670 case UNDERLYING_TYPE
:
7671 if (pfd
->include_nondeduced_p
7672 && for_each_template_parm (TYPE_FIELDS (t
), fn
, data
,
7674 pfd
->include_nondeduced_p
))
7675 return error_mark_node
;
7680 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
)
7681 && for_each_template_parm (DECL_TI_ARGS (t
), fn
, data
,
7682 pfd
->visited
, pfd
->include_nondeduced_p
))
7683 return error_mark_node
;
7688 if (TREE_CODE (t
) == CONST_DECL
&& DECL_TEMPLATE_PARM_P (t
)
7689 && for_each_template_parm (DECL_INITIAL (t
), fn
, data
,
7690 pfd
->visited
, pfd
->include_nondeduced_p
))
7691 return error_mark_node
;
7692 if (DECL_CONTEXT (t
)
7693 && pfd
->include_nondeduced_p
7694 && for_each_template_parm (DECL_CONTEXT (t
), fn
, data
,
7695 pfd
->visited
, pfd
->include_nondeduced_p
))
7696 return error_mark_node
;
7699 case BOUND_TEMPLATE_TEMPLATE_PARM
:
7700 /* Record template parameters such as `T' inside `TT<T>'. */
7701 if (for_each_template_parm (TYPE_TI_ARGS (t
), fn
, data
, pfd
->visited
,
7702 pfd
->include_nondeduced_p
))
7703 return error_mark_node
;
7706 case TEMPLATE_TEMPLATE_PARM
:
7707 case TEMPLATE_TYPE_PARM
:
7708 case TEMPLATE_PARM_INDEX
:
7709 if (fn
&& (*fn
)(t
, data
))
7710 return error_mark_node
;
7712 return error_mark_node
;
7716 /* A template template parameter is encountered. */
7717 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
)
7718 && for_each_template_parm (TREE_TYPE (t
), fn
, data
, pfd
->visited
,
7719 pfd
->include_nondeduced_p
))
7720 return error_mark_node
;
7722 /* Already substituted template template parameter */
7728 || for_each_template_parm (TYPENAME_TYPE_FULLNAME (t
), fn
,
7730 pfd
->include_nondeduced_p
))
7731 return error_mark_node
;
7735 if (TREE_TYPE (t
) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t
))
7736 && pfd
->include_nondeduced_p
7737 && for_each_template_parm (TYPE_PTRMEMFUNC_FN_TYPE
7738 (TREE_TYPE (t
)), fn
, data
,
7739 pfd
->visited
, pfd
->include_nondeduced_p
))
7740 return error_mark_node
;
7745 /* If there's no type, then this thing must be some expression
7746 involving template parameters. */
7747 if (!fn
&& !TREE_TYPE (t
))
7748 return error_mark_node
;
7753 case IMPLICIT_CONV_EXPR
:
7754 case REINTERPRET_CAST_EXPR
:
7755 case CONST_CAST_EXPR
:
7756 case STATIC_CAST_EXPR
:
7757 case DYNAMIC_CAST_EXPR
:
7761 case PSEUDO_DTOR_EXPR
:
7763 return error_mark_node
;
7770 /* We didn't find any template parameters we liked. */
7774 /* For each TEMPLATE_TYPE_PARM, TEMPLATE_TEMPLATE_PARM,
7775 BOUND_TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX in T,
7776 call FN with the parameter and the DATA.
7777 If FN returns nonzero, the iteration is terminated, and
7778 for_each_template_parm returns 1. Otherwise, the iteration
7779 continues. If FN never returns a nonzero value, the value
7780 returned by for_each_template_parm is 0. If FN is NULL, it is
7781 considered to be the function which always returns 1.
7783 If INCLUDE_NONDEDUCED_P, then this routine will also visit template
7784 parameters that occur in non-deduced contexts. When false, only
7785 visits those template parameters that can be deduced. */
7788 for_each_template_parm (tree t
, tree_fn_t fn
, void* data
,
7789 struct pointer_set_t
*visited
,
7790 bool include_nondeduced_p
)
7792 struct pair_fn_data pfd
;
7798 pfd
.include_nondeduced_p
= include_nondeduced_p
;
7800 /* Walk the tree. (Conceptually, we would like to walk without
7801 duplicates, but for_each_template_parm_r recursively calls
7802 for_each_template_parm, so we would need to reorganize a fair
7803 bit to use walk_tree_without_duplicates, so we keep our own
7806 pfd
.visited
= visited
;
7808 pfd
.visited
= pointer_set_create ();
7809 result
= cp_walk_tree (&t
,
7810 for_each_template_parm_r
,
7812 pfd
.visited
) != NULL_TREE
;
7817 pointer_set_destroy (pfd
.visited
);
7824 /* Returns true if T depends on any template parameter. */
7827 uses_template_parms (tree t
)
7830 int saved_processing_template_decl
;
7832 saved_processing_template_decl
= processing_template_decl
;
7833 if (!saved_processing_template_decl
)
7834 processing_template_decl
= 1;
7836 dependent_p
= dependent_type_p (t
);
7837 else if (TREE_CODE (t
) == TREE_VEC
)
7838 dependent_p
= any_dependent_template_arguments_p (t
);
7839 else if (TREE_CODE (t
) == TREE_LIST
)
7840 dependent_p
= (uses_template_parms (TREE_VALUE (t
))
7841 || uses_template_parms (TREE_CHAIN (t
)));
7842 else if (TREE_CODE (t
) == TYPE_DECL
)
7843 dependent_p
= dependent_type_p (TREE_TYPE (t
));
7846 || TREE_CODE (t
) == TEMPLATE_PARM_INDEX
7847 || TREE_CODE (t
) == OVERLOAD
7850 || TREE_CODE (t
) == TRAIT_EXPR
7851 || TREE_CODE (t
) == CONSTRUCTOR
7852 || CONSTANT_CLASS_P (t
))
7853 dependent_p
= (type_dependent_expression_p (t
)
7854 || value_dependent_expression_p (t
));
7857 gcc_assert (t
== error_mark_node
);
7858 dependent_p
= false;
7861 processing_template_decl
= saved_processing_template_decl
;
7866 /* Returns true iff current_function_decl is an incompletely instantiated
7867 template. Useful instead of processing_template_decl because the latter
7868 is set to 0 during fold_non_dependent_expr. */
7871 in_template_function (void)
7873 tree fn
= current_function_decl
;
7875 ++processing_template_decl
;
7876 ret
= (fn
&& DECL_LANG_SPECIFIC (fn
)
7877 && DECL_TEMPLATE_INFO (fn
)
7878 && any_dependent_template_arguments_p (DECL_TI_ARGS (fn
)));
7879 --processing_template_decl
;
7883 /* Returns true if T depends on any template parameter with level LEVEL. */
7886 uses_template_parms_level (tree t
, int level
)
7888 return for_each_template_parm (t
, template_parm_this_level_p
, &level
, NULL
,
7889 /*include_nondeduced_p=*/true);
7892 /* Returns TRUE iff INST is an instantiation we don't need to do in an
7893 ill-formed translation unit, i.e. a variable or function that isn't
7894 usable in a constant expression. */
7897 neglectable_inst_p (tree d
)
7900 && !(TREE_CODE (d
) == FUNCTION_DECL
? DECL_DECLARED_CONSTEXPR_P (d
)
7901 : decl_maybe_constant_var_p (d
)));
7904 /* Returns TRUE iff we should refuse to instantiate DECL because it's
7905 neglectable and instantiated from within an erroneous instantiation. */
7908 limit_bad_template_recursion (tree decl
)
7910 struct tinst_level
*lev
= current_tinst_level
;
7911 int errs
= errorcount
+ sorrycount
;
7912 if (lev
== NULL
|| errs
== 0 || !neglectable_inst_p (decl
))
7915 for (; lev
; lev
= lev
->next
)
7916 if (neglectable_inst_p (lev
->decl
))
7919 return (lev
&& errs
> lev
->errors
);
7922 static int tinst_depth
;
7923 extern int max_tinst_depth
;
7926 static GTY(()) struct tinst_level
*last_error_tinst_level
;
7928 /* We're starting to instantiate D; record the template instantiation context
7929 for diagnostics and to restore it later. */
7932 push_tinst_level (tree d
)
7934 struct tinst_level
*new_level
;
7936 if (tinst_depth
>= max_tinst_depth
)
7938 last_error_tinst_level
= current_tinst_level
;
7939 if (TREE_CODE (d
) == TREE_LIST
)
7940 error ("template instantiation depth exceeds maximum of %d (use "
7941 "-ftemplate-depth= to increase the maximum) substituting %qS",
7942 max_tinst_depth
, d
);
7944 error ("template instantiation depth exceeds maximum of %d (use "
7945 "-ftemplate-depth= to increase the maximum) instantiating %qD",
7946 max_tinst_depth
, d
);
7948 print_instantiation_context ();
7953 /* If the current instantiation caused problems, don't let it instantiate
7954 anything else. Do allow deduction substitution and decls usable in
7955 constant expressions. */
7956 if (limit_bad_template_recursion (d
))
7959 new_level
= ggc_alloc_tinst_level ();
7960 new_level
->decl
= d
;
7961 new_level
->locus
= input_location
;
7962 new_level
->errors
= errorcount
+sorrycount
;
7963 new_level
->in_system_header_p
= in_system_header
;
7964 new_level
->next
= current_tinst_level
;
7965 current_tinst_level
= new_level
;
7968 if (GATHER_STATISTICS
&& (tinst_depth
> depth_reached
))
7969 depth_reached
= tinst_depth
;
7974 /* We're done instantiating this template; return to the instantiation
7978 pop_tinst_level (void)
7980 /* Restore the filename and line number stashed away when we started
7981 this instantiation. */
7982 input_location
= current_tinst_level
->locus
;
7983 current_tinst_level
= current_tinst_level
->next
;
7987 /* We're instantiating a deferred template; restore the template
7988 instantiation context in which the instantiation was requested, which
7989 is one step out from LEVEL. Return the corresponding DECL or TYPE. */
7992 reopen_tinst_level (struct tinst_level
*level
)
7994 struct tinst_level
*t
;
7997 for (t
= level
; t
; t
= t
->next
)
8000 current_tinst_level
= level
;
8002 if (current_tinst_level
)
8003 current_tinst_level
->errors
= errorcount
+sorrycount
;
8007 /* Returns the TINST_LEVEL which gives the original instantiation
8010 struct tinst_level
*
8011 outermost_tinst_level (void)
8013 struct tinst_level
*level
= current_tinst_level
;
8016 level
= level
->next
;
8020 /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the
8021 vector of template arguments, as for tsubst.
8023 Returns an appropriate tsubst'd friend declaration. */
8026 tsubst_friend_function (tree decl
, tree args
)
8030 if (TREE_CODE (decl
) == FUNCTION_DECL
8031 && DECL_TEMPLATE_INSTANTIATION (decl
)
8032 && TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
8033 /* This was a friend declared with an explicit template
8034 argument list, e.g.:
8038 to indicate that f was a template instantiation, not a new
8039 function declaration. Now, we have to figure out what
8040 instantiation of what template. */
8042 tree template_id
, arglist
, fns
;
8045 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (current_class_type
));
8047 /* Friend functions are looked up in the containing namespace scope.
8048 We must enter that scope, to avoid finding member functions of the
8049 current class with same name. */
8050 push_nested_namespace (ns
);
8051 fns
= tsubst_expr (DECL_TI_TEMPLATE (decl
), args
,
8052 tf_warning_or_error
, NULL_TREE
,
8053 /*integral_constant_expression_p=*/false);
8054 pop_nested_namespace (ns
);
8055 arglist
= tsubst (DECL_TI_ARGS (decl
), args
,
8056 tf_warning_or_error
, NULL_TREE
);
8057 template_id
= lookup_template_function (fns
, arglist
);
8059 new_friend
= tsubst (decl
, args
, tf_warning_or_error
, NULL_TREE
);
8060 tmpl
= determine_specialization (template_id
, new_friend
,
8062 /*need_member_template=*/0,
8063 TREE_VEC_LENGTH (args
),
8065 return instantiate_template (tmpl
, new_args
, tf_error
);
8068 new_friend
= tsubst (decl
, args
, tf_warning_or_error
, NULL_TREE
);
8070 /* The NEW_FRIEND will look like an instantiation, to the
8071 compiler, but is not an instantiation from the point of view of
8072 the language. For example, we might have had:
8074 template <class T> struct S {
8075 template <class U> friend void f(T, U);
8078 Then, in S<int>, template <class U> void f(int, U) is not an
8079 instantiation of anything. */
8080 if (new_friend
== error_mark_node
)
8081 return error_mark_node
;
8083 DECL_USE_TEMPLATE (new_friend
) = 0;
8084 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
8086 DECL_USE_TEMPLATE (DECL_TEMPLATE_RESULT (new_friend
)) = 0;
8087 DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (new_friend
))
8088 = DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (decl
));
8091 /* The mangled name for the NEW_FRIEND is incorrect. The function
8092 is not a template instantiation and should not be mangled like
8093 one. Therefore, we forget the mangling here; we'll recompute it
8094 later if we need it. */
8095 if (TREE_CODE (new_friend
) != TEMPLATE_DECL
)
8097 SET_DECL_RTL (new_friend
, NULL
);
8098 SET_DECL_ASSEMBLER_NAME (new_friend
, NULL_TREE
);
8101 if (DECL_NAMESPACE_SCOPE_P (new_friend
))
8104 tree new_friend_template_info
;
8105 tree new_friend_result_template_info
;
8107 int new_friend_is_defn
;
8109 /* We must save some information from NEW_FRIEND before calling
8110 duplicate decls since that function will free NEW_FRIEND if
8112 new_friend_template_info
= DECL_TEMPLATE_INFO (new_friend
);
8113 new_friend_is_defn
=
8114 (DECL_INITIAL (DECL_TEMPLATE_RESULT
8115 (template_for_substitution (new_friend
)))
8117 if (TREE_CODE (new_friend
) == TEMPLATE_DECL
)
8119 /* This declaration is a `primary' template. */
8120 DECL_PRIMARY_TEMPLATE (new_friend
) = new_friend
;
8122 new_friend_result_template_info
8123 = DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (new_friend
));
8126 new_friend_result_template_info
= NULL_TREE
;
8128 /* Make the init_value nonzero so pushdecl knows this is a defn. */
8129 if (new_friend_is_defn
)
8130 DECL_INITIAL (new_friend
) = error_mark_node
;
8132 /* Inside pushdecl_namespace_level, we will push into the
8133 current namespace. However, the friend function should go
8134 into the namespace of the template. */
8135 ns
= decl_namespace_context (new_friend
);
8136 push_nested_namespace (ns
);
8137 old_decl
= pushdecl_namespace_level (new_friend
, /*is_friend=*/true);
8138 pop_nested_namespace (ns
);
8140 if (old_decl
== error_mark_node
)
8141 return error_mark_node
;
8143 if (old_decl
!= new_friend
)
8145 /* This new friend declaration matched an existing
8146 declaration. For example, given:
8148 template <class T> void f(T);
8149 template <class U> class C {
8150 template <class T> friend void f(T) {}
8153 the friend declaration actually provides the definition
8154 of `f', once C has been instantiated for some type. So,
8155 old_decl will be the out-of-class template declaration,
8156 while new_friend is the in-class definition.
8158 But, if `f' was called before this point, the
8159 instantiation of `f' will have DECL_TI_ARGS corresponding
8160 to `T' but not to `U', references to which might appear
8161 in the definition of `f'. Previously, the most general
8162 template for an instantiation of `f' was the out-of-class
8163 version; now it is the in-class version. Therefore, we
8164 run through all specialization of `f', adding to their
8165 DECL_TI_ARGS appropriately. In particular, they need a
8166 new set of outer arguments, corresponding to the
8167 arguments for this class instantiation.
8169 The same situation can arise with something like this:
8172 template <class T> class C {
8176 when `C<int>' is instantiated. Now, `f(int)' is defined
8179 if (!new_friend_is_defn
)
8180 /* On the other hand, if the in-class declaration does
8181 *not* provide a definition, then we don't want to alter
8182 existing definitions. We can just leave everything
8187 tree new_template
= TI_TEMPLATE (new_friend_template_info
);
8188 tree new_args
= TI_ARGS (new_friend_template_info
);
8190 /* Overwrite whatever template info was there before, if
8191 any, with the new template information pertaining to
8193 DECL_TEMPLATE_INFO (old_decl
) = new_friend_template_info
;
8195 if (TREE_CODE (old_decl
) != TEMPLATE_DECL
)
8197 /* We should have called reregister_specialization in
8199 gcc_assert (retrieve_specialization (new_template
,
8203 /* Instantiate it if the global has already been used. */
8204 if (DECL_ODR_USED (old_decl
))
8205 instantiate_decl (old_decl
, /*defer_ok=*/true,
8206 /*expl_inst_class_mem_p=*/false);
8212 /* Indicate that the old function template is a partial
8214 DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (old_decl
))
8215 = new_friend_result_template_info
;
8217 gcc_assert (new_template
8218 == most_general_template (new_template
));
8219 gcc_assert (new_template
!= old_decl
);
8221 /* Reassign any specializations already in the hash table
8222 to the new more general template, and add the
8223 additional template args. */
8224 for (t
= DECL_TEMPLATE_INSTANTIATIONS (old_decl
);
8228 tree spec
= TREE_VALUE (t
);
8231 elt
.tmpl
= old_decl
;
8232 elt
.args
= DECL_TI_ARGS (spec
);
8233 elt
.spec
= NULL_TREE
;
8235 htab_remove_elt (decl_specializations
, &elt
);
8238 = add_outermost_template_args (new_args
,
8239 DECL_TI_ARGS (spec
));
8241 register_specialization
8242 (spec
, new_template
, DECL_TI_ARGS (spec
), true, 0);
8245 DECL_TEMPLATE_INSTANTIATIONS (old_decl
) = NULL_TREE
;
8249 /* The information from NEW_FRIEND has been merged into OLD_DECL
8250 by duplicate_decls. */
8251 new_friend
= old_decl
;
8256 tree context
= DECL_CONTEXT (new_friend
);
8260 template <class T> class C {
8261 template <class U> friend void C1<U>::f (); // case 1
8262 friend void C2<T>::f (); // case 2
8264 we only need to make sure CONTEXT is a complete type for
8265 case 2. To distinguish between the two cases, we note that
8266 CONTEXT of case 1 remains dependent type after tsubst while
8267 this isn't true for case 2. */
8268 ++processing_template_decl
;
8269 dependent_p
= dependent_type_p (context
);
8270 --processing_template_decl
;
8273 && !complete_type_or_else (context
, NULL_TREE
))
8274 return error_mark_node
;
8276 if (COMPLETE_TYPE_P (context
))
8278 /* Check to see that the declaration is really present, and,
8279 possibly obtain an improved declaration. */
8280 tree fn
= check_classfn (context
,
8281 new_friend
, NULL_TREE
);
8291 /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of
8292 template arguments, as for tsubst.
8294 Returns an appropriate tsubst'd friend type or error_mark_node on
8298 tsubst_friend_class (tree friend_tmpl
, tree args
)
8304 if (DECL_TEMPLATE_TEMPLATE_PARM_P (friend_tmpl
))
8306 tree t
= tsubst (TREE_TYPE (friend_tmpl
), args
, tf_none
, NULL_TREE
);
8307 return TREE_TYPE (t
);
8310 context
= CP_DECL_CONTEXT (friend_tmpl
);
8312 if (context
!= global_namespace
)
8314 if (TREE_CODE (context
) == NAMESPACE_DECL
)
8315 push_nested_namespace (context
);
8317 push_nested_class (tsubst (context
, args
, tf_none
, NULL_TREE
));
8320 /* Look for a class template declaration. We look for hidden names
8321 because two friend declarations of the same template are the
8322 same. For example, in:
8325 template <typename> friend class F;
8327 template <typename> struct B {
8328 template <typename> friend class F;
8331 both F templates are the same. */
8332 tmpl
= lookup_name_real (DECL_NAME (friend_tmpl
), 0, 0,
8333 /*block_p=*/true, 0, LOOKUP_HIDDEN
);
8335 /* But, if we don't find one, it might be because we're in a
8336 situation like this:
8344 Here, in the scope of (say) S<int>, `S' is bound to a TYPE_DECL
8345 for `S<int>', not the TEMPLATE_DECL. */
8346 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
8348 tmpl
= lookup_name_prefer_type (DECL_NAME (friend_tmpl
), 1);
8349 tmpl
= maybe_get_template_decl_from_type_decl (tmpl
);
8352 if (tmpl
&& DECL_CLASS_TEMPLATE_P (tmpl
))
8354 /* The friend template has already been declared. Just
8355 check to see that the declarations match, and install any new
8356 default parameters. We must tsubst the default parameters,
8357 of course. We only need the innermost template parameters
8358 because that is all that redeclare_class_template will look
8360 if (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (friend_tmpl
))
8361 > TMPL_ARGS_DEPTH (args
))
8364 location_t saved_input_location
;
8365 parms
= tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_tmpl
),
8366 args
, tf_warning_or_error
);
8368 saved_input_location
= input_location
;
8369 input_location
= DECL_SOURCE_LOCATION (friend_tmpl
);
8370 redeclare_class_template (TREE_TYPE (tmpl
), parms
);
8371 input_location
= saved_input_location
;
8375 friend_type
= TREE_TYPE (tmpl
);
8379 /* The friend template has not already been declared. In this
8380 case, the instantiation of the template class will cause the
8381 injection of this template into the global scope. */
8382 tmpl
= tsubst (friend_tmpl
, args
, tf_warning_or_error
, NULL_TREE
);
8383 if (tmpl
== error_mark_node
)
8384 return error_mark_node
;
8386 /* The new TMPL is not an instantiation of anything, so we
8387 forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE for
8388 the new type because that is supposed to be the corresponding
8389 template decl, i.e., TMPL. */
8390 DECL_USE_TEMPLATE (tmpl
) = 0;
8391 DECL_TEMPLATE_INFO (tmpl
) = NULL_TREE
;
8392 CLASSTYPE_USE_TEMPLATE (TREE_TYPE (tmpl
)) = 0;
8393 CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl
))
8394 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl
)));
8396 /* Inject this template into the global scope. */
8397 friend_type
= TREE_TYPE (pushdecl_top_level_maybe_friend (tmpl
, true));
8400 if (context
!= global_namespace
)
8402 if (TREE_CODE (context
) == NAMESPACE_DECL
)
8403 pop_nested_namespace (context
);
8405 pop_nested_class ();
8411 /* Returns zero if TYPE cannot be completed later due to circularity.
8412 Otherwise returns one. */
8415 can_complete_type_without_circularity (tree type
)
8417 if (type
== NULL_TREE
|| type
== error_mark_node
)
8419 else if (COMPLETE_TYPE_P (type
))
8421 else if (TREE_CODE (type
) == ARRAY_TYPE
&& TYPE_DOMAIN (type
))
8422 return can_complete_type_without_circularity (TREE_TYPE (type
));
8423 else if (CLASS_TYPE_P (type
)
8424 && TYPE_BEING_DEFINED (TYPE_MAIN_VARIANT (type
)))
8430 /* Apply any attributes which had to be deferred until instantiation
8431 time. DECL_P, ATTRIBUTES and ATTR_FLAGS are as cplus_decl_attributes;
8432 ARGS, COMPLAIN, IN_DECL are as tsubst. */
8435 apply_late_template_attributes (tree
*decl_p
, tree attributes
, int attr_flags
,
8436 tree args
, tsubst_flags_t complain
, tree in_decl
)
8438 tree last_dep
= NULL_TREE
;
8442 for (t
= attributes
; t
; t
= TREE_CHAIN (t
))
8443 if (ATTR_IS_DEPENDENT (t
))
8446 attributes
= copy_list (attributes
);
8450 if (DECL_P (*decl_p
))
8452 if (TREE_TYPE (*decl_p
) == error_mark_node
)
8454 p
= &DECL_ATTRIBUTES (*decl_p
);
8457 p
= &TYPE_ATTRIBUTES (*decl_p
);
8461 tree late_attrs
= NULL_TREE
;
8462 tree
*q
= &late_attrs
;
8464 for (*p
= attributes
; *p
; )
8467 if (ATTR_IS_DEPENDENT (t
))
8469 *p
= TREE_CHAIN (t
);
8470 TREE_CHAIN (t
) = NULL_TREE
;
8471 /* If the first attribute argument is an identifier, don't
8472 pass it through tsubst. Attributes like mode, format,
8473 cleanup and several target specific attributes expect it
8476 && TREE_CODE (TREE_VALUE (t
)) == TREE_LIST
8477 && TREE_VALUE (TREE_VALUE (t
))
8478 && (identifier_p (TREE_VALUE (TREE_VALUE (t
)))))
8481 = tsubst_expr (TREE_CHAIN (TREE_VALUE (t
)), args
, complain
,
8483 /*integral_constant_expression_p=*/false);
8484 if (chain
!= TREE_CHAIN (TREE_VALUE (t
)))
8486 = tree_cons (NULL_TREE
, TREE_VALUE (TREE_VALUE (t
)),
8491 = tsubst_expr (TREE_VALUE (t
), args
, complain
, in_decl
,
8492 /*integral_constant_expression_p=*/false);
8494 q
= &TREE_CHAIN (t
);
8497 p
= &TREE_CHAIN (t
);
8500 cplus_decl_attributes (decl_p
, late_attrs
, attr_flags
);
8504 /* Perform (or defer) access check for typedefs that were referenced
8505 from within the template TMPL code.
8506 This is a subroutine of instantiate_decl and instantiate_class_template.
8507 TMPL is the template to consider and TARGS is the list of arguments of
8511 perform_typedefs_access_check (tree tmpl
, tree targs
)
8513 location_t saved_location
;
8515 qualified_typedef_usage_t
*iter
;
8518 || (!CLASS_TYPE_P (tmpl
)
8519 && TREE_CODE (tmpl
) != FUNCTION_DECL
))
8522 saved_location
= input_location
;
8523 FOR_EACH_VEC_SAFE_ELT (get_types_needing_access_check (tmpl
), i
, iter
)
8525 tree type_decl
= iter
->typedef_decl
;
8526 tree type_scope
= iter
->context
;
8528 if (!type_decl
|| !type_scope
|| !CLASS_TYPE_P (type_scope
))
8531 if (uses_template_parms (type_decl
))
8532 type_decl
= tsubst (type_decl
, targs
, tf_error
, NULL_TREE
);
8533 if (uses_template_parms (type_scope
))
8534 type_scope
= tsubst (type_scope
, targs
, tf_error
, NULL_TREE
);
8536 /* Make access check error messages point to the location
8537 of the use of the typedef. */
8538 input_location
= iter
->locus
;
8539 perform_or_defer_access_check (TYPE_BINFO (type_scope
),
8540 type_decl
, type_decl
,
8541 tf_warning_or_error
);
8543 input_location
= saved_location
;
8547 instantiate_class_template_1 (tree type
)
8549 tree templ
, args
, pattern
, t
, member
;
8553 unsigned int saved_maximum_field_alignment
;
8556 if (type
== error_mark_node
)
8557 return error_mark_node
;
8559 if (COMPLETE_OR_OPEN_TYPE_P (type
)
8560 || uses_template_parms (type
))
8563 /* Figure out which template is being instantiated. */
8564 templ
= most_general_template (CLASSTYPE_TI_TEMPLATE (type
));
8565 gcc_assert (TREE_CODE (templ
) == TEMPLATE_DECL
);
8567 /* Determine what specialization of the original template to
8569 t
= most_specialized_class (type
, templ
, tf_warning_or_error
);
8570 if (t
== error_mark_node
)
8572 TYPE_BEING_DEFINED (type
) = 1;
8573 return error_mark_node
;
8577 /* This TYPE is actually an instantiation of a partial
8578 specialization. We replace the innermost set of ARGS with
8579 the arguments appropriate for substitution. For example,
8582 template <class T> struct S {};
8583 template <class T> struct S<T*> {};
8585 and supposing that we are instantiating S<int*>, ARGS will
8586 presently be {int*} -- but we need {int}. */
8587 pattern
= TREE_TYPE (t
);
8588 args
= TREE_PURPOSE (t
);
8592 pattern
= TREE_TYPE (templ
);
8593 args
= CLASSTYPE_TI_ARGS (type
);
8596 /* If the template we're instantiating is incomplete, then clearly
8597 there's nothing we can do. */
8598 if (!COMPLETE_TYPE_P (pattern
))
8601 /* If we've recursively instantiated too many templates, stop. */
8602 if (! push_tinst_level (type
))
8605 /* Now we're really doing the instantiation. Mark the type as in
8606 the process of being defined. */
8607 TYPE_BEING_DEFINED (type
) = 1;
8609 /* We may be in the middle of deferred access check. Disable
8611 push_deferring_access_checks (dk_no_deferred
);
8613 fn_context
= decl_function_context (TYPE_MAIN_DECL (type
));
8615 push_to_top_level ();
8616 /* Use #pragma pack from the template context. */
8617 saved_maximum_field_alignment
= maximum_field_alignment
;
8618 maximum_field_alignment
= TYPE_PRECISION (pattern
);
8620 SET_CLASSTYPE_INTERFACE_UNKNOWN (type
);
8622 /* Set the input location to the most specialized template definition.
8623 This is needed if tsubsting causes an error. */
8624 typedecl
= TYPE_MAIN_DECL (pattern
);
8625 input_location
= DECL_SOURCE_LOCATION (TYPE_NAME (type
)) =
8626 DECL_SOURCE_LOCATION (typedecl
);
8628 TYPE_PACKED (type
) = TYPE_PACKED (pattern
);
8629 TYPE_ALIGN (type
) = TYPE_ALIGN (pattern
);
8630 TYPE_USER_ALIGN (type
) = TYPE_USER_ALIGN (pattern
);
8631 TYPE_FOR_JAVA (type
) = TYPE_FOR_JAVA (pattern
); /* For libjava's JArray<T> */
8632 if (ANON_AGGR_TYPE_P (pattern
))
8633 SET_ANON_AGGR_TYPE_P (type
);
8634 if (CLASSTYPE_VISIBILITY_SPECIFIED (pattern
))
8636 CLASSTYPE_VISIBILITY_SPECIFIED (type
) = 1;
8637 CLASSTYPE_VISIBILITY (type
) = CLASSTYPE_VISIBILITY (pattern
);
8638 /* Adjust visibility for template arguments. */
8639 determine_visibility (TYPE_MAIN_DECL (type
));
8641 CLASSTYPE_FINAL (type
) = CLASSTYPE_FINAL (pattern
);
8643 pbinfo
= TYPE_BINFO (pattern
);
8645 /* We should never instantiate a nested class before its enclosing
8646 class; we need to look up the nested class by name before we can
8647 instantiate it, and that lookup should instantiate the enclosing
8649 gcc_assert (!DECL_CLASS_SCOPE_P (TYPE_MAIN_DECL (pattern
))
8650 || COMPLETE_OR_OPEN_TYPE_P (TYPE_CONTEXT (type
)));
8652 base_list
= NULL_TREE
;
8653 if (BINFO_N_BASE_BINFOS (pbinfo
))
8659 /* We must enter the scope containing the type, as that is where
8660 the accessibility of types named in dependent bases are
8662 pushed_scope
= push_scope (CP_TYPE_CONTEXT (type
));
8664 /* Substitute into each of the bases to determine the actual
8666 for (i
= 0; BINFO_BASE_ITERATE (pbinfo
, i
, pbase_binfo
); i
++)
8669 tree access
= BINFO_BASE_ACCESS (pbinfo
, i
);
8670 tree expanded_bases
= NULL_TREE
;
8673 if (PACK_EXPANSION_P (BINFO_TYPE (pbase_binfo
)))
8676 tsubst_pack_expansion (BINFO_TYPE (pbase_binfo
),
8677 args
, tf_error
, NULL_TREE
);
8678 if (expanded_bases
== error_mark_node
)
8681 len
= TREE_VEC_LENGTH (expanded_bases
);
8684 for (idx
= 0; idx
< len
; idx
++)
8687 /* Extract the already-expanded base class. */
8688 base
= TREE_VEC_ELT (expanded_bases
, idx
);
8690 /* Substitute to figure out the base class. */
8691 base
= tsubst (BINFO_TYPE (pbase_binfo
), args
, tf_error
,
8694 if (base
== error_mark_node
)
8697 base_list
= tree_cons (access
, base
, base_list
);
8698 if (BINFO_VIRTUAL_P (pbase_binfo
))
8699 TREE_TYPE (base_list
) = integer_type_node
;
8703 /* The list is now in reverse order; correct that. */
8704 base_list
= nreverse (base_list
);
8707 pop_scope (pushed_scope
);
8709 /* Now call xref_basetypes to set up all the base-class
8711 xref_basetypes (type
, base_list
);
8713 apply_late_template_attributes (&type
, TYPE_ATTRIBUTES (pattern
),
8714 (int) ATTR_FLAG_TYPE_IN_PLACE
,
8715 args
, tf_error
, NULL_TREE
);
8716 fixup_attribute_variants (type
);
8718 /* Now that our base classes are set up, enter the scope of the
8719 class, so that name lookups into base classes, etc. will work
8720 correctly. This is precisely analogous to what we do in
8721 begin_class_definition when defining an ordinary non-template
8722 class, except we also need to push the enclosing classes. */
8723 push_nested_class (type
);
8725 /* Now members are processed in the order of declaration. */
8726 for (member
= CLASSTYPE_DECL_LIST (pattern
);
8727 member
; member
= TREE_CHAIN (member
))
8729 tree t
= TREE_VALUE (member
);
8731 if (TREE_PURPOSE (member
))
8735 /* Build new CLASSTYPE_NESTED_UTDS. */
8738 bool class_template_p
;
8740 class_template_p
= (TREE_CODE (t
) != ENUMERAL_TYPE
8741 && TYPE_LANG_SPECIFIC (t
)
8742 && CLASSTYPE_IS_TEMPLATE (t
));
8743 /* If the member is a class template, then -- even after
8744 substitution -- there may be dependent types in the
8745 template argument list for the class. We increment
8746 PROCESSING_TEMPLATE_DECL so that dependent_type_p, as
8747 that function will assume that no types are dependent
8748 when outside of a template. */
8749 if (class_template_p
)
8750 ++processing_template_decl
;
8751 newtag
= tsubst (t
, args
, tf_error
, NULL_TREE
);
8752 if (class_template_p
)
8753 --processing_template_decl
;
8754 if (newtag
== error_mark_node
)
8757 if (TREE_CODE (newtag
) != ENUMERAL_TYPE
)
8759 tree name
= TYPE_IDENTIFIER (t
);
8761 if (class_template_p
)
8762 /* Unfortunately, lookup_template_class sets
8763 CLASSTYPE_IMPLICIT_INSTANTIATION for a partial
8764 instantiation (i.e., for the type of a member
8765 template class nested within a template class.)
8766 This behavior is required for
8767 maybe_process_partial_specialization to work
8768 correctly, but is not accurate in this case;
8769 the TAG is not an instantiation of anything.
8770 (The corresponding TEMPLATE_DECL is an
8771 instantiation, but the TYPE is not.) */
8772 CLASSTYPE_USE_TEMPLATE (newtag
) = 0;
8774 /* Now, we call pushtag to put this NEWTAG into the scope of
8775 TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid
8776 pushtag calling push_template_decl. We don't have to do
8777 this for enums because it will already have been done in
8780 SET_IDENTIFIER_TYPE_VALUE (name
, newtag
);
8781 pushtag (name
, newtag
, /*tag_scope=*/ts_current
);
8784 else if (DECL_DECLARES_FUNCTION_P (t
))
8786 /* Build new TYPE_METHODS. */
8789 if (TREE_CODE (t
) == TEMPLATE_DECL
)
8790 ++processing_template_decl
;
8791 r
= tsubst (t
, args
, tf_error
, NULL_TREE
);
8792 if (TREE_CODE (t
) == TEMPLATE_DECL
)
8793 --processing_template_decl
;
8794 set_current_access_from_decl (r
);
8795 finish_member_declaration (r
);
8796 /* Instantiate members marked with attribute used. */
8797 if (r
!= error_mark_node
&& DECL_PRESERVE_P (r
))
8802 /* Build new TYPE_FIELDS. */
8803 if (TREE_CODE (t
) == STATIC_ASSERT
)
8807 ++c_inhibit_evaluation_warnings
;
8809 tsubst_expr (STATIC_ASSERT_CONDITION (t
), args
,
8810 tf_warning_or_error
, NULL_TREE
,
8811 /*integral_constant_expression_p=*/true);
8812 --c_inhibit_evaluation_warnings
;
8814 finish_static_assert (condition
,
8815 STATIC_ASSERT_MESSAGE (t
),
8816 STATIC_ASSERT_SOURCE_LOCATION (t
),
8819 else if (TREE_CODE (t
) != CONST_DECL
)
8823 /* The file and line for this declaration, to
8824 assist in error message reporting. Since we
8825 called push_tinst_level above, we don't need to
8827 input_location
= DECL_SOURCE_LOCATION (t
);
8829 if (TREE_CODE (t
) == TEMPLATE_DECL
)
8830 ++processing_template_decl
;
8831 r
= tsubst (t
, args
, tf_warning_or_error
, NULL_TREE
);
8832 if (TREE_CODE (t
) == TEMPLATE_DECL
)
8833 --processing_template_decl
;
8838 [t]he initialization (and any associated
8839 side-effects) of a static data member does
8840 not occur unless the static data member is
8841 itself used in a way that requires the
8842 definition of the static data member to
8845 Therefore, we do not substitute into the
8846 initialized for the static data member here. */
8847 finish_static_data_member_decl
8850 /*init_const_expr_p=*/false,
8851 /*asmspec_tree=*/NULL_TREE
,
8853 /* Instantiate members marked with attribute used. */
8854 if (r
!= error_mark_node
&& DECL_PRESERVE_P (r
))
8857 else if (TREE_CODE (r
) == FIELD_DECL
)
8859 /* Determine whether R has a valid type and can be
8860 completed later. If R is invalid, then it is
8861 replaced by error_mark_node so that it will not be
8862 added to TYPE_FIELDS. */
8863 tree rtype
= TREE_TYPE (r
);
8864 if (can_complete_type_without_circularity (rtype
))
8865 complete_type (rtype
);
8867 if (!COMPLETE_TYPE_P (rtype
))
8869 cxx_incomplete_type_error (r
, rtype
);
8870 r
= error_mark_node
;
8874 /* If it is a TYPE_DECL for a class-scoped ENUMERAL_TYPE,
8875 such a thing will already have been added to the field
8876 list by tsubst_enum in finish_member_declaration in the
8877 CLASSTYPE_NESTED_UTDS case above. */
8878 if (!(TREE_CODE (r
) == TYPE_DECL
8879 && TREE_CODE (TREE_TYPE (r
)) == ENUMERAL_TYPE
8880 && DECL_ARTIFICIAL (r
)))
8882 set_current_access_from_decl (r
);
8883 finish_member_declaration (r
);
8890 if (TYPE_P (t
) || DECL_CLASS_TEMPLATE_P (t
)
8891 || DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
8893 /* Build new CLASSTYPE_FRIEND_CLASSES. */
8895 tree friend_type
= t
;
8896 bool adjust_processing_template_decl
= false;
8898 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
8900 /* template <class T> friend class C; */
8901 friend_type
= tsubst_friend_class (friend_type
, args
);
8902 adjust_processing_template_decl
= true;
8904 else if (TREE_CODE (friend_type
) == UNBOUND_CLASS_TEMPLATE
)
8906 /* template <class T> friend class C::D; */
8907 friend_type
= tsubst (friend_type
, args
,
8908 tf_warning_or_error
, NULL_TREE
);
8909 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
8910 friend_type
= TREE_TYPE (friend_type
);
8911 adjust_processing_template_decl
= true;
8913 else if (TREE_CODE (friend_type
) == TYPENAME_TYPE
8914 || TREE_CODE (friend_type
) == TEMPLATE_TYPE_PARM
)
8916 /* This could be either
8920 when dependent_type_p is false or
8922 template <class U> friend class T::C;
8925 friend_type
= tsubst (friend_type
, args
,
8926 tf_warning_or_error
, NULL_TREE
);
8927 /* Bump processing_template_decl for correct
8928 dependent_type_p calculation. */
8929 ++processing_template_decl
;
8930 if (dependent_type_p (friend_type
))
8931 adjust_processing_template_decl
= true;
8932 --processing_template_decl
;
8934 else if (!CLASSTYPE_USE_TEMPLATE (friend_type
)
8935 && hidden_name_p (TYPE_NAME (friend_type
)))
8939 where C hasn't been declared yet. Let's lookup name
8940 from namespace scope directly, bypassing any name that
8941 come from dependent base class. */
8942 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (friend_type
));
8944 /* The call to xref_tag_from_type does injection for friend
8946 push_nested_namespace (ns
);
8948 xref_tag_from_type (friend_type
, NULL_TREE
,
8949 /*tag_scope=*/ts_current
);
8950 pop_nested_namespace (ns
);
8952 else if (uses_template_parms (friend_type
))
8953 /* friend class C<T>; */
8954 friend_type
= tsubst (friend_type
, args
,
8955 tf_warning_or_error
, NULL_TREE
);
8960 where C is already declared or
8962 friend class C<int>;
8964 We don't have to do anything in these cases. */
8966 if (adjust_processing_template_decl
)
8967 /* Trick make_friend_class into realizing that the friend
8968 we're adding is a template, not an ordinary class. It's
8969 important that we use make_friend_class since it will
8970 perform some error-checking and output cross-reference
8972 ++processing_template_decl
;
8974 if (friend_type
!= error_mark_node
)
8975 make_friend_class (type
, friend_type
, /*complain=*/false);
8977 if (adjust_processing_template_decl
)
8978 --processing_template_decl
;
8982 /* Build new DECL_FRIENDLIST. */
8985 /* The file and line for this declaration, to
8986 assist in error message reporting. Since we
8987 called push_tinst_level above, we don't need to
8989 input_location
= DECL_SOURCE_LOCATION (t
);
8991 if (TREE_CODE (t
) == TEMPLATE_DECL
)
8993 ++processing_template_decl
;
8994 push_deferring_access_checks (dk_no_check
);
8997 r
= tsubst_friend_function (t
, args
);
8998 add_friend (type
, r
, /*complain=*/false);
8999 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9001 pop_deferring_access_checks ();
9002 --processing_template_decl
;
9008 if (tree expr
= CLASSTYPE_LAMBDA_EXPR (type
))
9010 tree decl
= lambda_function (type
);
9013 instantiate_decl (decl
, false, false);
9015 /* We need to instantiate the capture list from the template
9016 after we've instantiated the closure members, but before we
9017 consider adding the conversion op. Also keep any captures
9018 that may have been added during instantiation of the op(). */
9019 tree tmpl_expr
= CLASSTYPE_LAMBDA_EXPR (pattern
);
9021 = tsubst_copy_and_build (LAMBDA_EXPR_CAPTURE_LIST (tmpl_expr
),
9022 args
, tf_warning_or_error
, NULL_TREE
,
9025 LAMBDA_EXPR_CAPTURE_LIST (expr
)
9026 = chainon (tmpl_cap
, nreverse (LAMBDA_EXPR_CAPTURE_LIST (expr
)));
9028 maybe_add_lambda_conv_op (type
);
9031 gcc_assert (errorcount
);
9034 /* Set the file and line number information to whatever is given for
9035 the class itself. This puts error messages involving generated
9036 implicit functions at a predictable point, and the same point
9037 that would be used for non-template classes. */
9038 input_location
= DECL_SOURCE_LOCATION (typedecl
);
9040 unreverse_member_declarations (type
);
9041 finish_struct_1 (type
);
9042 TYPE_BEING_DEFINED (type
) = 0;
9044 /* We don't instantiate default arguments for member functions. 14.7.1:
9046 The implicit instantiation of a class template specialization causes
9047 the implicit instantiation of the declarations, but not of the
9048 definitions or default arguments, of the class member functions,
9049 member classes, static data members and member templates.... */
9051 /* Some typedefs referenced from within the template code need to be access
9052 checked at template instantiation time, i.e now. These types were
9053 added to the template at parsing time. Let's get those and perform
9054 the access checks then. */
9055 perform_typedefs_access_check (pattern
, args
);
9056 perform_deferred_access_checks (tf_warning_or_error
);
9057 pop_nested_class ();
9058 maximum_field_alignment
= saved_maximum_field_alignment
;
9060 pop_from_top_level ();
9061 pop_deferring_access_checks ();
9064 /* The vtable for a template class can be emitted in any translation
9065 unit in which the class is instantiated. When there is no key
9066 method, however, finish_struct_1 will already have added TYPE to
9067 the keyed_classes list. */
9068 if (TYPE_CONTAINS_VPTR_P (type
) && CLASSTYPE_KEY_METHOD (type
))
9069 keyed_classes
= tree_cons (NULL_TREE
, type
, keyed_classes
);
9074 /* Wrapper for instantiate_class_template_1. */
9077 instantiate_class_template (tree type
)
9080 timevar_push (TV_TEMPLATE_INST
);
9081 ret
= instantiate_class_template_1 (type
);
9082 timevar_pop (TV_TEMPLATE_INST
);
9087 tsubst_template_arg (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
9093 else if (TYPE_P (t
))
9094 r
= tsubst (t
, args
, complain
, in_decl
);
9097 if (!(complain
& tf_warning
))
9098 ++c_inhibit_evaluation_warnings
;
9099 r
= tsubst_expr (t
, args
, complain
, in_decl
,
9100 /*integral_constant_expression_p=*/true);
9101 if (!(complain
& tf_warning
))
9102 --c_inhibit_evaluation_warnings
;
9103 /* Preserve the raw-reference nature of T. */
9104 if (TREE_TYPE (t
) && TREE_CODE (TREE_TYPE (t
)) == REFERENCE_TYPE
9105 && REFERENCE_REF_P (r
))
9106 r
= TREE_OPERAND (r
, 0);
9111 /* Given a function parameter pack TMPL_PARM and some function parameters
9112 instantiated from it at *SPEC_P, return a NONTYPE_ARGUMENT_PACK of them
9113 and set *SPEC_P to point at the next point in the list. */
9116 extract_fnparm_pack (tree tmpl_parm
, tree
*spec_p
)
9118 /* Collect all of the extra "packed" parameters into an
9122 tree argpack
= make_node (NONTYPE_ARGUMENT_PACK
);
9123 tree argtypepack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
9124 tree spec_parm
= *spec_p
;
9127 for (len
= 0; spec_parm
; ++len
, spec_parm
= TREE_CHAIN (spec_parm
))
9129 && !function_parameter_expanded_from_pack_p (spec_parm
, tmpl_parm
))
9132 /* Fill in PARMVEC and PARMTYPEVEC with all of the parameters. */
9133 parmvec
= make_tree_vec (len
);
9134 parmtypevec
= make_tree_vec (len
);
9135 spec_parm
= *spec_p
;
9136 for (i
= 0; i
< len
; i
++, spec_parm
= DECL_CHAIN (spec_parm
))
9138 TREE_VEC_ELT (parmvec
, i
) = spec_parm
;
9139 TREE_VEC_ELT (parmtypevec
, i
) = TREE_TYPE (spec_parm
);
9142 /* Build the argument packs. */
9143 SET_ARGUMENT_PACK_ARGS (argpack
, parmvec
);
9144 SET_ARGUMENT_PACK_ARGS (argtypepack
, parmtypevec
);
9145 TREE_TYPE (argpack
) = argtypepack
;
9146 *spec_p
= spec_parm
;
9151 /* Give a chain SPEC_PARM of PARM_DECLs, pack them into a
9152 NONTYPE_ARGUMENT_PACK. */
9155 make_fnparm_pack (tree spec_parm
)
9157 return extract_fnparm_pack (NULL_TREE
, &spec_parm
);
9160 /* Return true iff the Ith element of the argument pack ARG_PACK is a
9164 argument_pack_element_is_expansion_p (tree arg_pack
, int i
)
9166 tree vec
= ARGUMENT_PACK_ARGS (arg_pack
);
9167 if (i
>= TREE_VEC_LENGTH (vec
))
9169 return PACK_EXPANSION_P (TREE_VEC_ELT (vec
, i
));
9173 /* Creates and return an ARGUMENT_PACK_SELECT tree node. */
9176 make_argument_pack_select (tree arg_pack
, unsigned index
)
9178 tree aps
= make_node (ARGUMENT_PACK_SELECT
);
9180 ARGUMENT_PACK_SELECT_FROM_PACK (aps
) = arg_pack
;
9181 ARGUMENT_PACK_SELECT_INDEX (aps
) = index
;
9186 /* This is a subroutine of tsubst_pack_expansion.
9188 It returns TRUE if we need to use the PACK_EXPANSION_EXTRA_ARGS
9189 mechanism to store the (non complete list of) arguments of the
9190 substitution and return a non substituted pack expansion, in order
9191 to wait for when we have enough arguments to really perform the
9195 use_pack_expansion_extra_args_p (tree parm_packs
,
9199 if (parm_packs
== NULL_TREE
)
9202 bool has_expansion_arg
= false;
9203 for (int i
= 0 ; i
< arg_pack_len
; ++i
)
9205 bool has_non_expansion_arg
= false;
9206 for (tree parm_pack
= parm_packs
;
9208 parm_pack
= TREE_CHAIN (parm_pack
))
9210 tree arg
= TREE_VALUE (parm_pack
);
9212 if (argument_pack_element_is_expansion_p (arg
, i
))
9213 has_expansion_arg
= true;
9215 has_non_expansion_arg
= true;
9218 /* If one pack has an expansion and another pack has a normal
9219 argument or if one pack has an empty argument another one
9220 hasn't then tsubst_pack_expansion cannot perform the
9221 substitution and need to fall back on the
9222 PACK_EXPANSION_EXTRA mechanism. */
9223 if ((has_expansion_arg
&& has_non_expansion_arg
)
9224 || (has_empty_arg
&& (has_expansion_arg
|| has_non_expansion_arg
)))
9230 /* [temp.variadic]/6 says that:
9232 The instantiation of a pack expansion [...]
9233 produces a list E1,E2, ..., En, where N is the number of elements
9234 in the pack expansion parameters.
9236 This subroutine of tsubst_pack_expansion produces one of these Ei.
9238 PATTERN is the pattern of the pack expansion. PARM_PACKS is a
9239 TREE_LIST in which each TREE_PURPOSE is a parameter pack of
9240 PATTERN, and each TREE_VALUE is its corresponding argument pack.
9241 INDEX is the index 'i' of the element Ei to produce. ARGS,
9242 COMPLAIN, and IN_DECL are the same parameters as for the
9243 tsubst_pack_expansion function.
9245 The function returns the resulting Ei upon successful completion,
9248 Note that this function possibly modifies the ARGS parameter, so
9249 it's the responsibility of the caller to restore it. */
9252 gen_elem_of_pack_expansion_instantiation (tree pattern
,
9255 tree args
/* This parm gets
9257 tsubst_flags_t complain
,
9261 bool ith_elem_is_expansion
= false;
9263 /* For each parameter pack, change the substitution of the parameter
9264 pack to the ith argument in its argument pack, then expand the
9266 for (tree pack
= parm_packs
; pack
; pack
= TREE_CHAIN (pack
))
9268 tree parm
= TREE_PURPOSE (pack
);
9269 tree arg_pack
= TREE_VALUE (pack
);
9270 tree aps
; /* instance of ARGUMENT_PACK_SELECT. */
9272 ith_elem_is_expansion
|=
9273 argument_pack_element_is_expansion_p (arg_pack
, index
);
9275 /* Select the Ith argument from the pack. */
9276 if (TREE_CODE (parm
) == PARM_DECL
)
9280 aps
= make_argument_pack_select (arg_pack
, index
);
9282 register_local_specialization (aps
, parm
);
9285 aps
= retrieve_local_specialization (parm
);
9290 template_parm_level_and_index (parm
, &level
, &idx
);
9294 aps
= make_argument_pack_select (arg_pack
, index
);
9295 /* Update the corresponding argument. */
9296 TMPL_ARG (args
, level
, idx
) = aps
;
9299 /* Re-use the ARGUMENT_PACK_SELECT. */
9300 aps
= TMPL_ARG (args
, level
, idx
);
9302 ARGUMENT_PACK_SELECT_INDEX (aps
) = index
;
9305 /* Substitute into the PATTERN with the (possibly altered)
9307 if (!TYPE_P (pattern
))
9308 t
= tsubst_expr (pattern
, args
, complain
, in_decl
,
9309 /*integral_constant_expression_p=*/false);
9311 t
= tsubst (pattern
, args
, complain
, in_decl
);
9313 /* If the Ith argument pack element is a pack expansion, then
9314 the Ith element resulting from the substituting is going to
9315 be a pack expansion as well. */
9316 if (ith_elem_is_expansion
)
9317 t
= make_pack_expansion (t
);
9322 /* Substitute ARGS into T, which is an pack expansion
9323 (i.e. TYPE_PACK_EXPANSION or EXPR_PACK_EXPANSION). Returns a
9324 TREE_VEC with the substituted arguments, a PACK_EXPANSION_* node
9325 (if only a partial substitution could be performed) or
9326 ERROR_MARK_NODE if there was an error. */
9328 tsubst_pack_expansion (tree t
, tree args
, tsubst_flags_t complain
,
9332 tree pack
, packs
= NULL_TREE
;
9333 bool unsubstituted_packs
= false;
9336 struct pointer_map_t
*saved_local_specializations
= NULL
;
9337 bool need_local_specializations
= false;
9340 gcc_assert (PACK_EXPANSION_P (t
));
9341 pattern
= PACK_EXPANSION_PATTERN (t
);
9343 /* Add in any args remembered from an earlier partial instantiation. */
9344 args
= add_to_template_args (PACK_EXPANSION_EXTRA_ARGS (t
), args
);
9346 levels
= TMPL_ARGS_DEPTH (args
);
9348 /* Determine the argument packs that will instantiate the parameter
9349 packs used in the expansion expression. While we're at it,
9350 compute the number of arguments to be expanded and make sure it
9352 for (pack
= PACK_EXPANSION_PARAMETER_PACKS (t
); pack
;
9353 pack
= TREE_CHAIN (pack
))
9355 tree parm_pack
= TREE_VALUE (pack
);
9356 tree arg_pack
= NULL_TREE
;
9357 tree orig_arg
= NULL_TREE
;
9360 if (TREE_CODE (parm_pack
) == BASES
)
9362 if (BASES_DIRECT (parm_pack
))
9363 return calculate_direct_bases (tsubst_expr (BASES_TYPE (parm_pack
),
9364 args
, complain
, in_decl
, false));
9366 return calculate_bases (tsubst_expr (BASES_TYPE (parm_pack
),
9367 args
, complain
, in_decl
, false));
9369 if (TREE_CODE (parm_pack
) == PARM_DECL
)
9371 if (PACK_EXPANSION_LOCAL_P (t
))
9372 arg_pack
= retrieve_local_specialization (parm_pack
);
9375 /* We can't rely on local_specializations for a parameter
9376 name used later in a function declaration (such as in a
9377 late-specified return type). Even if it exists, it might
9378 have the wrong value for a recursive call. Just make a
9379 dummy decl, since it's only used for its type. */
9380 arg_pack
= tsubst_decl (parm_pack
, args
, complain
);
9381 if (arg_pack
&& FUNCTION_PARAMETER_PACK_P (arg_pack
))
9382 /* Partial instantiation of the parm_pack, we can't build
9383 up an argument pack yet. */
9384 arg_pack
= NULL_TREE
;
9386 arg_pack
= make_fnparm_pack (arg_pack
);
9387 need_local_specializations
= true;
9393 template_parm_level_and_index (parm_pack
, &level
, &idx
);
9395 if (level
<= levels
)
9396 arg_pack
= TMPL_ARG (args
, level
, idx
);
9399 orig_arg
= arg_pack
;
9400 if (arg_pack
&& TREE_CODE (arg_pack
) == ARGUMENT_PACK_SELECT
)
9401 arg_pack
= ARGUMENT_PACK_SELECT_FROM_PACK (arg_pack
);
9403 if (arg_pack
&& !ARGUMENT_PACK_P (arg_pack
))
9404 /* This can only happen if we forget to expand an argument
9405 pack somewhere else. Just return an error, silently. */
9407 result
= make_tree_vec (1);
9408 TREE_VEC_ELT (result
, 0) = error_mark_node
;
9415 TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg_pack
));
9417 /* Don't bother trying to do a partial substitution with
9418 incomplete packs; we'll try again after deduction. */
9419 if (ARGUMENT_PACK_INCOMPLETE_P (arg_pack
))
9424 else if (len
!= my_len
)
9426 if (!(complain
& tf_error
))
9427 /* Fail quietly. */;
9428 else if (TREE_CODE (t
) == TYPE_PACK_EXPANSION
)
9429 error ("mismatched argument pack lengths while expanding "
9433 error ("mismatched argument pack lengths while expanding "
9436 return error_mark_node
;
9439 /* Keep track of the parameter packs and their corresponding
9441 packs
= tree_cons (parm_pack
, arg_pack
, packs
);
9442 TREE_TYPE (packs
) = orig_arg
;
9446 /* We can't substitute for this parameter pack. We use a flag as
9447 well as the missing_level counter because function parameter
9448 packs don't have a level. */
9449 unsubstituted_packs
= true;
9453 /* We cannot expand this expansion expression, because we don't have
9454 all of the argument packs we need. */
9455 if (use_pack_expansion_extra_args_p (packs
, len
, unsubstituted_packs
))
9457 /* We got some full packs, but we can't substitute them in until we
9458 have values for all the packs. So remember these until then. */
9460 t
= make_pack_expansion (pattern
);
9461 PACK_EXPANSION_EXTRA_ARGS (t
) = args
;
9464 else if (unsubstituted_packs
)
9466 /* There were no real arguments, we're just replacing a parameter
9467 pack with another version of itself. Substitute into the
9468 pattern and return a PACK_EXPANSION_*. The caller will need to
9470 if (TREE_CODE (t
) == EXPR_PACK_EXPANSION
)
9471 t
= tsubst_expr (pattern
, args
, complain
, in_decl
,
9472 /*integral_constant_expression_p=*/false);
9474 t
= tsubst (pattern
, args
, complain
, in_decl
);
9475 t
= make_pack_expansion (t
);
9479 gcc_assert (len
>= 0);
9481 if (need_local_specializations
)
9483 /* We're in a late-specified return type, so create our own local
9484 specializations map; the current map is either NULL or (in the
9485 case of recursive unification) might have bindings that we don't
9486 want to use or alter. */
9487 saved_local_specializations
= local_specializations
;
9488 local_specializations
= pointer_map_create ();
9491 /* For each argument in each argument pack, substitute into the
9493 result
= make_tree_vec (len
);
9494 for (i
= 0; i
< len
; ++i
)
9496 t
= gen_elem_of_pack_expansion_instantiation (pattern
, packs
,
9500 TREE_VEC_ELT (result
, i
) = t
;
9501 if (t
== error_mark_node
)
9503 result
= error_mark_node
;
9508 /* Update ARGS to restore the substitution from parameter packs to
9509 their argument packs. */
9510 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
9512 tree parm
= TREE_PURPOSE (pack
);
9514 if (TREE_CODE (parm
) == PARM_DECL
)
9515 register_local_specialization (TREE_TYPE (pack
), parm
);
9520 if (TREE_VALUE (pack
) == NULL_TREE
)
9523 template_parm_level_and_index (parm
, &level
, &idx
);
9525 /* Update the corresponding argument. */
9526 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
9527 TREE_VEC_ELT (TREE_VEC_ELT (args
, level
-1 ), idx
) =
9530 TREE_VEC_ELT (args
, idx
) = TREE_TYPE (pack
);
9534 if (need_local_specializations
)
9536 pointer_map_destroy (local_specializations
);
9537 local_specializations
= saved_local_specializations
;
9543 /* Given PARM_DECL PARM, find the corresponding PARM_DECL in the template
9544 TMPL. We do this using DECL_PARM_INDEX, which should work even with
9545 parameter packs; all parms generated from a function parameter pack will
9546 have the same DECL_PARM_INDEX. */
9549 get_pattern_parm (tree parm
, tree tmpl
)
9551 tree pattern
= DECL_TEMPLATE_RESULT (tmpl
);
9554 if (DECL_ARTIFICIAL (parm
))
9556 for (patparm
= DECL_ARGUMENTS (pattern
);
9557 patparm
; patparm
= DECL_CHAIN (patparm
))
9558 if (DECL_ARTIFICIAL (patparm
)
9559 && DECL_NAME (parm
) == DECL_NAME (patparm
))
9564 patparm
= FUNCTION_FIRST_USER_PARM (DECL_TEMPLATE_RESULT (tmpl
));
9565 patparm
= chain_index (DECL_PARM_INDEX (parm
)-1, patparm
);
9566 gcc_assert (DECL_PARM_INDEX (patparm
)
9567 == DECL_PARM_INDEX (parm
));
9573 /* Substitute ARGS into the vector or list of template arguments T. */
9576 tsubst_template_args (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
9579 int len
, need_new
= 0, i
, expanded_len_adjust
= 0, out
;
9582 if (t
== error_mark_node
)
9583 return error_mark_node
;
9585 len
= TREE_VEC_LENGTH (t
);
9586 elts
= XALLOCAVEC (tree
, len
);
9588 for (i
= 0; i
< len
; i
++)
9590 tree orig_arg
= TREE_VEC_ELT (t
, i
);
9593 if (TREE_CODE (orig_arg
) == TREE_VEC
)
9594 new_arg
= tsubst_template_args (orig_arg
, args
, complain
, in_decl
);
9595 else if (PACK_EXPANSION_P (orig_arg
))
9597 /* Substitute into an expansion expression. */
9598 new_arg
= tsubst_pack_expansion (orig_arg
, args
, complain
, in_decl
);
9600 if (TREE_CODE (new_arg
) == TREE_VEC
)
9601 /* Add to the expanded length adjustment the number of
9602 expanded arguments. We subtract one from this
9603 measurement, because the argument pack expression
9604 itself is already counted as 1 in
9605 LEN. EXPANDED_LEN_ADJUST can actually be negative, if
9606 the argument pack is empty. */
9607 expanded_len_adjust
+= TREE_VEC_LENGTH (new_arg
) - 1;
9609 else if (ARGUMENT_PACK_P (orig_arg
))
9611 /* Substitute into each of the arguments. */
9612 new_arg
= TYPE_P (orig_arg
)
9613 ? cxx_make_type (TREE_CODE (orig_arg
))
9614 : make_node (TREE_CODE (orig_arg
));
9616 SET_ARGUMENT_PACK_ARGS (
9618 tsubst_template_args (ARGUMENT_PACK_ARGS (orig_arg
),
9619 args
, complain
, in_decl
));
9621 if (ARGUMENT_PACK_ARGS (new_arg
) == error_mark_node
)
9622 new_arg
= error_mark_node
;
9624 if (TREE_CODE (new_arg
) == NONTYPE_ARGUMENT_PACK
) {
9625 TREE_TYPE (new_arg
) = tsubst (TREE_TYPE (orig_arg
), args
,
9627 TREE_CONSTANT (new_arg
) = TREE_CONSTANT (orig_arg
);
9629 if (TREE_TYPE (new_arg
) == error_mark_node
)
9630 new_arg
= error_mark_node
;
9634 new_arg
= tsubst_template_arg (orig_arg
, args
, complain
, in_decl
);
9636 if (new_arg
== error_mark_node
)
9637 return error_mark_node
;
9640 if (new_arg
!= orig_arg
)
9647 /* Make space for the expanded arguments coming from template
9649 t
= make_tree_vec (len
+ expanded_len_adjust
);
9650 /* ORIG_T can contain TREE_VECs. That happens if ORIG_T contains the
9651 arguments for a member template.
9652 In that case each TREE_VEC in ORIG_T represents a level of template
9653 arguments, and ORIG_T won't carry any non defaulted argument count.
9654 It will rather be the nested TREE_VECs that will carry one.
9655 In other words, ORIG_T carries a non defaulted argument count only
9656 if it doesn't contain any nested TREE_VEC. */
9657 if (NON_DEFAULT_TEMPLATE_ARGS_COUNT (orig_t
))
9659 int count
= GET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (orig_t
);
9660 count
+= expanded_len_adjust
;
9661 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (t
, count
);
9663 for (i
= 0, out
= 0; i
< len
; i
++)
9665 if ((PACK_EXPANSION_P (TREE_VEC_ELT (orig_t
, i
))
9666 || ARGUMENT_PACK_P (TREE_VEC_ELT (orig_t
, i
)))
9667 && TREE_CODE (elts
[i
]) == TREE_VEC
)
9671 /* Now expand the template argument pack "in place". */
9672 for (idx
= 0; idx
< TREE_VEC_LENGTH (elts
[i
]); idx
++, out
++)
9673 TREE_VEC_ELT (t
, out
) = TREE_VEC_ELT (elts
[i
], idx
);
9677 TREE_VEC_ELT (t
, out
) = elts
[i
];
9685 /* Return the result of substituting ARGS into the template parameters
9686 given by PARMS. If there are m levels of ARGS and m + n levels of
9687 PARMS, then the result will contain n levels of PARMS. For
9688 example, if PARMS is `template <class T> template <class U>
9689 template <T*, U, class V>' and ARGS is {{int}, {double}} then the
9690 result will be `template <int*, double, class V>'. */
9693 tsubst_template_parms (tree parms
, tree args
, tsubst_flags_t complain
)
9698 /* When substituting into a template, we must set
9699 PROCESSING_TEMPLATE_DECL as the template parameters may be
9700 dependent if they are based on one-another, and the dependency
9701 predicates are short-circuit outside of templates. */
9702 ++processing_template_decl
;
9704 for (new_parms
= &r
;
9705 parms
&& TMPL_PARMS_DEPTH (parms
) > TMPL_ARGS_DEPTH (args
);
9706 new_parms
= &(TREE_CHAIN (*new_parms
)),
9707 parms
= TREE_CHAIN (parms
))
9710 make_tree_vec (TREE_VEC_LENGTH (TREE_VALUE (parms
)));
9713 for (i
= 0; i
< TREE_VEC_LENGTH (new_vec
); ++i
)
9717 if (parms
== error_mark_node
)
9720 tuple
= TREE_VEC_ELT (TREE_VALUE (parms
), i
);
9722 if (tuple
== error_mark_node
)
9725 TREE_VEC_ELT (new_vec
, i
) =
9726 tsubst_template_parm (tuple
, args
, complain
);
9730 tree_cons (size_int (TMPL_PARMS_DEPTH (parms
)
9731 - TMPL_ARGS_DEPTH (args
)),
9732 new_vec
, NULL_TREE
);
9735 --processing_template_decl
;
9740 /* Return the result of substituting ARGS into one template parameter
9741 given by T. T Must be a TREE_LIST which TREE_VALUE is the template
9742 parameter and which TREE_PURPOSE is the default argument of the
9743 template parameter. */
9746 tsubst_template_parm (tree t
, tree args
, tsubst_flags_t complain
)
9748 tree default_value
, parm_decl
;
9750 if (args
== NULL_TREE
9752 || t
== error_mark_node
)
9755 gcc_assert (TREE_CODE (t
) == TREE_LIST
);
9757 default_value
= TREE_PURPOSE (t
);
9758 parm_decl
= TREE_VALUE (t
);
9760 parm_decl
= tsubst (parm_decl
, args
, complain
, NULL_TREE
);
9761 if (TREE_CODE (parm_decl
) == PARM_DECL
9762 && invalid_nontype_parm_type_p (TREE_TYPE (parm_decl
), complain
))
9763 parm_decl
= error_mark_node
;
9764 default_value
= tsubst_template_arg (default_value
, args
,
9765 complain
, NULL_TREE
);
9767 return build_tree_list (default_value
, parm_decl
);
9770 /* Substitute the ARGS into the indicated aggregate (or enumeration)
9771 type T. If T is not an aggregate or enumeration type, it is
9772 handled as if by tsubst. IN_DECL is as for tsubst. If
9773 ENTERING_SCOPE is nonzero, T is the context for a template which
9774 we are presently tsubst'ing. Return the substituted value. */
9777 tsubst_aggr_type (tree t
,
9779 tsubst_flags_t complain
,
9786 switch (TREE_CODE (t
))
9789 if (TYPE_PTRMEMFUNC_P (t
))
9790 return tsubst (TYPE_PTRMEMFUNC_FN_TYPE (t
), args
, complain
, in_decl
);
9792 /* Else fall through. */
9795 if (TYPE_TEMPLATE_INFO (t
) && uses_template_parms (t
))
9800 int saved_unevaluated_operand
;
9801 int saved_inhibit_evaluation_warnings
;
9803 /* In "sizeof(X<I>)" we need to evaluate "I". */
9804 saved_unevaluated_operand
= cp_unevaluated_operand
;
9805 cp_unevaluated_operand
= 0;
9806 saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
9807 c_inhibit_evaluation_warnings
= 0;
9809 /* First, determine the context for the type we are looking
9811 context
= TYPE_CONTEXT (t
);
9812 if (context
&& TYPE_P (context
))
9814 context
= tsubst_aggr_type (context
, args
, complain
,
9815 in_decl
, /*entering_scope=*/1);
9816 /* If context is a nested class inside a class template,
9817 it may still need to be instantiated (c++/33959). */
9818 context
= complete_type (context
);
9821 /* Then, figure out what arguments are appropriate for the
9822 type we are trying to find. For example, given:
9824 template <class T> struct S;
9825 template <class T, class U> void f(T, U) { S<U> su; }
9827 and supposing that we are instantiating f<int, double>,
9828 then our ARGS will be {int, double}, but, when looking up
9829 S we only want {double}. */
9830 argvec
= tsubst_template_args (TYPE_TI_ARGS (t
), args
,
9832 if (argvec
== error_mark_node
)
9833 r
= error_mark_node
;
9836 r
= lookup_template_class (t
, argvec
, in_decl
, context
,
9837 entering_scope
, complain
);
9838 r
= cp_build_qualified_type_real (r
, cp_type_quals (t
), complain
);
9841 cp_unevaluated_operand
= saved_unevaluated_operand
;
9842 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
9847 /* This is not a template type, so there's nothing to do. */
9851 return tsubst (t
, args
, complain
, in_decl
);
9855 /* Substitute into the default argument ARG (a default argument for
9856 FN), which has the indicated TYPE. */
9859 tsubst_default_argument (tree fn
, tree type
, tree arg
)
9861 tree saved_class_ptr
= NULL_TREE
;
9862 tree saved_class_ref
= NULL_TREE
;
9863 int errs
= errorcount
+ sorrycount
;
9865 /* This can happen in invalid code. */
9866 if (TREE_CODE (arg
) == DEFAULT_ARG
)
9869 /* This default argument came from a template. Instantiate the
9870 default argument here, not in tsubst. In the case of
9879 we must be careful to do name lookup in the scope of S<T>,
9880 rather than in the current class. */
9881 push_access_scope (fn
);
9882 /* The "this" pointer is not valid in a default argument. */
9885 saved_class_ptr
= current_class_ptr
;
9886 cp_function_chain
->x_current_class_ptr
= NULL_TREE
;
9887 saved_class_ref
= current_class_ref
;
9888 cp_function_chain
->x_current_class_ref
= NULL_TREE
;
9891 push_deferring_access_checks(dk_no_deferred
);
9892 /* The default argument expression may cause implicitly defined
9893 member functions to be synthesized, which will result in garbage
9894 collection. We must treat this situation as if we were within
9895 the body of function so as to avoid collecting live data on the
9898 arg
= tsubst_expr (arg
, DECL_TI_ARGS (fn
),
9899 tf_warning_or_error
, NULL_TREE
,
9900 /*integral_constant_expression_p=*/false);
9902 pop_deferring_access_checks();
9904 /* Restore the "this" pointer. */
9907 cp_function_chain
->x_current_class_ptr
= saved_class_ptr
;
9908 cp_function_chain
->x_current_class_ref
= saved_class_ref
;
9911 if (errorcount
+sorrycount
> errs
)
9912 inform (input_location
,
9913 " when instantiating default argument for call to %D", fn
);
9915 /* Make sure the default argument is reasonable. */
9916 arg
= check_default_argument (type
, arg
);
9918 pop_access_scope (fn
);
9923 /* Substitute into all the default arguments for FN. */
9926 tsubst_default_arguments (tree fn
)
9931 tmpl_args
= DECL_TI_ARGS (fn
);
9933 /* If this function is not yet instantiated, we certainly don't need
9934 its default arguments. */
9935 if (uses_template_parms (tmpl_args
))
9937 /* Don't do this again for clones. */
9938 if (DECL_CLONED_FUNCTION_P (fn
))
9941 for (arg
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
9943 arg
= TREE_CHAIN (arg
))
9944 if (TREE_PURPOSE (arg
))
9945 TREE_PURPOSE (arg
) = tsubst_default_argument (fn
,
9947 TREE_PURPOSE (arg
));
9950 /* Substitute the ARGS into the T, which is a _DECL. Return the
9951 result of the substitution. Issue error and warning messages under
9952 control of COMPLAIN. */
9955 tsubst_decl (tree t
, tree args
, tsubst_flags_t complain
)
9957 #define RETURN(EXP) do { r = (EXP); goto out; } while(0)
9958 location_t saved_loc
;
9963 /* Set the filename and linenumber to improve error-reporting. */
9964 saved_loc
= input_location
;
9965 input_location
= DECL_SOURCE_LOCATION (t
);
9967 switch (TREE_CODE (t
))
9971 /* We can get here when processing a member function template,
9972 member class template, or template template parameter. */
9973 tree decl
= DECL_TEMPLATE_RESULT (t
);
9978 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
9980 /* Template template parameter is treated here. */
9981 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
9982 if (new_type
== error_mark_node
)
9983 RETURN (error_mark_node
);
9984 /* If we get a real template back, return it. This can happen in
9985 the context of most_specialized_class. */
9986 if (TREE_CODE (new_type
) == TEMPLATE_DECL
)
9990 DECL_CHAIN (r
) = NULL_TREE
;
9991 TREE_TYPE (r
) = new_type
;
9992 DECL_TEMPLATE_RESULT (r
)
9993 = build_decl (DECL_SOURCE_LOCATION (decl
),
9994 TYPE_DECL
, DECL_NAME (decl
), new_type
);
9995 DECL_TEMPLATE_PARMS (r
)
9996 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
,
9998 TYPE_NAME (new_type
) = r
;
10002 /* We might already have an instance of this template.
10003 The ARGS are for the surrounding class type, so the
10004 full args contain the tsubst'd args for the context,
10005 plus the innermost args from the template decl. */
10006 tmpl_args
= DECL_CLASS_TEMPLATE_P (t
)
10007 ? CLASSTYPE_TI_ARGS (TREE_TYPE (t
))
10008 : DECL_TI_ARGS (DECL_TEMPLATE_RESULT (t
));
10009 /* Because this is a template, the arguments will still be
10010 dependent, even after substitution. If
10011 PROCESSING_TEMPLATE_DECL is not set, the dependency
10012 predicates will short-circuit. */
10013 ++processing_template_decl
;
10014 full_args
= tsubst_template_args (tmpl_args
, args
,
10015 complain
, in_decl
);
10016 --processing_template_decl
;
10017 if (full_args
== error_mark_node
)
10018 RETURN (error_mark_node
);
10020 /* If this is a default template template argument,
10021 tsubst might not have changed anything. */
10022 if (full_args
== tmpl_args
)
10025 hash
= hash_tmpl_and_args (t
, full_args
);
10026 spec
= retrieve_specialization (t
, full_args
, hash
);
10027 if (spec
!= NULL_TREE
)
10033 /* Make a new template decl. It will be similar to the
10034 original, but will record the current template arguments.
10035 We also create a new function declaration, which is just
10036 like the old one, but points to this new template, rather
10037 than the old one. */
10039 gcc_assert (DECL_LANG_SPECIFIC (r
) != 0);
10040 DECL_CHAIN (r
) = NULL_TREE
;
10042 DECL_TEMPLATE_INFO (r
) = build_template_info (t
, args
);
10044 if (TREE_CODE (decl
) == TYPE_DECL
10045 && !TYPE_DECL_ALIAS_P (decl
))
10048 ++processing_template_decl
;
10049 new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
10050 --processing_template_decl
;
10051 if (new_type
== error_mark_node
)
10052 RETURN (error_mark_node
);
10054 TREE_TYPE (r
) = new_type
;
10055 CLASSTYPE_TI_TEMPLATE (new_type
) = r
;
10056 DECL_TEMPLATE_RESULT (r
) = TYPE_MAIN_DECL (new_type
);
10057 DECL_TI_ARGS (r
) = CLASSTYPE_TI_ARGS (new_type
);
10058 DECL_CONTEXT (r
) = TYPE_CONTEXT (new_type
);
10063 ++processing_template_decl
;
10064 new_decl
= tsubst (decl
, args
, complain
, in_decl
);
10065 --processing_template_decl
;
10066 if (new_decl
== error_mark_node
)
10067 RETURN (error_mark_node
);
10069 DECL_TEMPLATE_RESULT (r
) = new_decl
;
10070 DECL_TI_TEMPLATE (new_decl
) = r
;
10071 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
10072 DECL_TI_ARGS (r
) = DECL_TI_ARGS (new_decl
);
10073 DECL_CONTEXT (r
) = DECL_CONTEXT (new_decl
);
10076 SET_DECL_IMPLICIT_INSTANTIATION (r
);
10077 DECL_TEMPLATE_INSTANTIATIONS (r
) = NULL_TREE
;
10078 DECL_TEMPLATE_SPECIALIZATIONS (r
) = NULL_TREE
;
10080 /* The template parameters for this new template are all the
10081 template parameters for the old template, except the
10082 outermost level of parameters. */
10083 DECL_TEMPLATE_PARMS (r
)
10084 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
,
10087 if (PRIMARY_TEMPLATE_P (t
))
10088 DECL_PRIMARY_TEMPLATE (r
) = r
;
10090 if (TREE_CODE (decl
) != TYPE_DECL
)
10091 /* Record this non-type partial instantiation. */
10092 register_specialization (r
, t
,
10093 DECL_TI_ARGS (DECL_TEMPLATE_RESULT (r
)),
10098 case FUNCTION_DECL
:
10101 tree argvec
= NULL_TREE
;
10109 /* Nobody should be tsubst'ing into non-template functions. */
10110 gcc_assert (DECL_TEMPLATE_INFO (t
) != NULL_TREE
);
10112 if (TREE_CODE (DECL_TI_TEMPLATE (t
)) == TEMPLATE_DECL
)
10117 /* If T is not dependent, just return it. We have to
10118 increment PROCESSING_TEMPLATE_DECL because
10119 value_dependent_expression_p assumes that nothing is
10120 dependent when PROCESSING_TEMPLATE_DECL is zero. */
10121 ++processing_template_decl
;
10122 dependent_p
= value_dependent_expression_p (t
);
10123 --processing_template_decl
;
10127 /* Calculate the most general template of which R is a
10128 specialization, and the complete set of arguments used to
10130 gen_tmpl
= most_general_template (DECL_TI_TEMPLATE (t
));
10131 argvec
= tsubst_template_args (DECL_TI_ARGS
10132 (DECL_TEMPLATE_RESULT
10133 (DECL_TI_TEMPLATE (t
))),
10134 args
, complain
, in_decl
);
10135 if (argvec
== error_mark_node
)
10136 RETURN (error_mark_node
);
10138 /* Check to see if we already have this specialization. */
10139 hash
= hash_tmpl_and_args (gen_tmpl
, argvec
);
10140 spec
= retrieve_specialization (gen_tmpl
, argvec
, hash
);
10148 /* We can see more levels of arguments than parameters if
10149 there was a specialization of a member template, like
10152 template <class T> struct S { template <class U> void f(); }
10153 template <> template <class U> void S<int>::f(U);
10155 Here, we'll be substituting into the specialization,
10156 because that's where we can find the code we actually
10157 want to generate, but we'll have enough arguments for
10158 the most general template.
10160 We also deal with the peculiar case:
10162 template <class T> struct S {
10163 template <class U> friend void f();
10165 template <class U> void f() {}
10167 template void f<double>();
10169 Here, the ARGS for the instantiation of will be {int,
10170 double}. But, we only need as many ARGS as there are
10171 levels of template parameters in CODE_PATTERN. We are
10172 careful not to get fooled into reducing the ARGS in
10175 template <class T> struct S { template <class U> void f(U); }
10176 template <class T> template <> void S<T>::f(int) {}
10178 which we can spot because the pattern will be a
10179 specialization in this case. */
10180 args_depth
= TMPL_ARGS_DEPTH (args
);
10182 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (t
)));
10183 if (args_depth
> parms_depth
10184 && !DECL_TEMPLATE_SPECIALIZATION (t
))
10185 args
= get_innermost_template_args (args
, parms_depth
);
10189 /* This special case arises when we have something like this:
10191 template <class T> struct S {
10192 friend void f<int>(int, double);
10195 Here, the DECL_TI_TEMPLATE for the friend declaration
10196 will be an IDENTIFIER_NODE. We are being called from
10197 tsubst_friend_function, and we want only to create a
10198 new decl (R) with appropriate types so that we can call
10199 determine_specialization. */
10200 gen_tmpl
= NULL_TREE
;
10203 if (DECL_CLASS_SCOPE_P (t
))
10205 if (DECL_NAME (t
) == constructor_name (DECL_CONTEXT (t
)))
10209 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
,
10210 complain
, t
, /*entering_scope=*/1);
10215 ctx
= DECL_CONTEXT (t
);
10217 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
10218 if (type
== error_mark_node
)
10219 RETURN (error_mark_node
);
10221 /* If we hit excessive deduction depth, the type is bogus even if
10222 it isn't error_mark_node, so don't build a decl. */
10223 if (excessive_deduction_depth
)
10224 RETURN (error_mark_node
);
10226 /* We do NOT check for matching decls pushed separately at this
10227 point, as they may not represent instantiations of this
10228 template, and in any case are considered separate under the
10231 DECL_USE_TEMPLATE (r
) = 0;
10232 TREE_TYPE (r
) = type
;
10233 /* Clear out the mangled name and RTL for the instantiation. */
10234 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
10235 SET_DECL_RTL (r
, NULL
);
10236 /* Leave DECL_INITIAL set on deleted instantiations. */
10237 if (!DECL_DELETED_FN (r
))
10238 DECL_INITIAL (r
) = NULL_TREE
;
10239 DECL_CONTEXT (r
) = ctx
;
10241 if (member
&& DECL_CONV_FN_P (r
))
10242 /* Type-conversion operator. Reconstruct the name, in
10243 case it's the name of one of the template's parameters. */
10244 DECL_NAME (r
) = mangle_conv_op_name_for_type (TREE_TYPE (type
));
10246 DECL_ARGUMENTS (r
) = tsubst (DECL_ARGUMENTS (t
), args
,
10248 DECL_RESULT (r
) = NULL_TREE
;
10250 TREE_STATIC (r
) = 0;
10251 TREE_PUBLIC (r
) = TREE_PUBLIC (t
);
10252 DECL_EXTERNAL (r
) = 1;
10253 /* If this is an instantiation of a function with internal
10254 linkage, we already know what object file linkage will be
10255 assigned to the instantiation. */
10256 DECL_INTERFACE_KNOWN (r
) = !TREE_PUBLIC (r
);
10257 DECL_DEFER_OUTPUT (r
) = 0;
10258 DECL_CHAIN (r
) = NULL_TREE
;
10259 DECL_PENDING_INLINE_INFO (r
) = 0;
10260 DECL_PENDING_INLINE_P (r
) = 0;
10261 DECL_SAVED_TREE (r
) = NULL_TREE
;
10262 DECL_STRUCT_FUNCTION (r
) = NULL
;
10264 /* We'll re-clone as appropriate in instantiate_template. */
10265 DECL_CLONED_FUNCTION (r
) = NULL_TREE
;
10267 /* If we aren't complaining now, return on error before we register
10268 the specialization so that we'll complain eventually. */
10269 if ((complain
& tf_error
) == 0
10270 && IDENTIFIER_OPNAME_P (DECL_NAME (r
))
10271 && !grok_op_properties (r
, /*complain=*/false))
10272 RETURN (error_mark_node
);
10274 /* Set up the DECL_TEMPLATE_INFO for R. There's no need to do
10275 this in the special friend case mentioned above where
10276 GEN_TMPL is NULL. */
10279 DECL_TEMPLATE_INFO (r
)
10280 = build_template_info (gen_tmpl
, argvec
);
10281 SET_DECL_IMPLICIT_INSTANTIATION (r
);
10284 = register_specialization (r
, gen_tmpl
, argvec
, false, hash
);
10286 /* We instantiated this while substituting into
10287 the type earlier (template/friend54.C). */
10290 /* We're not supposed to instantiate default arguments
10291 until they are called, for a template. But, for a
10294 template <class T> void f ()
10295 { extern void g(int i = T()); }
10297 we should do the substitution when the template is
10298 instantiated. We handle the member function case in
10299 instantiate_class_template since the default arguments
10300 might refer to other members of the class. */
10302 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
10303 && !uses_template_parms (argvec
))
10304 tsubst_default_arguments (r
);
10307 DECL_TEMPLATE_INFO (r
) = NULL_TREE
;
10309 /* Copy the list of befriending classes. */
10310 for (friends
= &DECL_BEFRIENDING_CLASSES (r
);
10312 friends
= &TREE_CHAIN (*friends
))
10314 *friends
= copy_node (*friends
);
10315 TREE_VALUE (*friends
) = tsubst (TREE_VALUE (*friends
),
10320 if (DECL_CONSTRUCTOR_P (r
) || DECL_DESTRUCTOR_P (r
))
10322 maybe_retrofit_in_chrg (r
);
10323 if (DECL_CONSTRUCTOR_P (r
))
10324 grok_ctor_properties (ctx
, r
);
10325 if (DECL_INHERITED_CTOR_BASE (r
))
10326 deduce_inheriting_ctor (r
);
10327 /* If this is an instantiation of a member template, clone it.
10328 If it isn't, that'll be handled by
10329 clone_constructors_and_destructors. */
10330 if (PRIMARY_TEMPLATE_P (gen_tmpl
))
10331 clone_function_decl (r
, /*update_method_vec_p=*/0);
10333 else if ((complain
& tf_error
) != 0
10334 && IDENTIFIER_OPNAME_P (DECL_NAME (r
))
10335 && !grok_op_properties (r
, /*complain=*/true))
10336 RETURN (error_mark_node
);
10338 if (DECL_FRIEND_P (t
) && DECL_FRIEND_CONTEXT (t
))
10339 SET_DECL_FRIEND_CONTEXT (r
,
10340 tsubst (DECL_FRIEND_CONTEXT (t
),
10341 args
, complain
, in_decl
));
10343 /* Possibly limit visibility based on template args. */
10344 DECL_VISIBILITY (r
) = VISIBILITY_DEFAULT
;
10345 if (DECL_VISIBILITY_SPECIFIED (t
))
10347 DECL_VISIBILITY_SPECIFIED (r
) = 0;
10348 DECL_ATTRIBUTES (r
)
10349 = remove_attribute ("visibility", DECL_ATTRIBUTES (r
));
10351 determine_visibility (r
);
10352 if (DECL_DEFAULTED_OUTSIDE_CLASS_P (r
)
10353 && !processing_template_decl
)
10354 defaulted_late_check (r
);
10356 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
10357 args
, complain
, in_decl
);
10363 tree type
= NULL_TREE
;
10365 tree expanded_types
= NULL_TREE
;
10366 tree prev_r
= NULL_TREE
;
10367 tree first_r
= NULL_TREE
;
10369 if (FUNCTION_PARAMETER_PACK_P (t
))
10371 /* If there is a local specialization that isn't a
10372 parameter pack, it means that we're doing a "simple"
10373 substitution from inside tsubst_pack_expansion. Just
10374 return the local specialization (which will be a single
10376 tree spec
= retrieve_local_specialization (t
);
10378 && TREE_CODE (spec
) == PARM_DECL
10379 && TREE_CODE (TREE_TYPE (spec
)) != TYPE_PACK_EXPANSION
)
10382 /* Expand the TYPE_PACK_EXPANSION that provides the types for
10383 the parameters in this function parameter pack. */
10384 expanded_types
= tsubst_pack_expansion (TREE_TYPE (t
), args
,
10385 complain
, in_decl
);
10386 if (TREE_CODE (expanded_types
) == TREE_VEC
)
10388 len
= TREE_VEC_LENGTH (expanded_types
);
10390 /* Zero-length parameter packs are boring. Just substitute
10393 RETURN (tsubst (TREE_CHAIN (t
), args
, complain
,
10398 /* All we did was update the type. Make a note of that. */
10399 type
= expanded_types
;
10400 expanded_types
= NULL_TREE
;
10404 /* Loop through all of the parameter's we'll build. When T is
10405 a function parameter pack, LEN is the number of expanded
10406 types in EXPANDED_TYPES; otherwise, LEN is 1. */
10408 for (i
= 0; i
< len
; ++i
)
10412 if (DECL_TEMPLATE_PARM_P (t
))
10413 SET_DECL_TEMPLATE_PARM_P (r
);
10415 if (expanded_types
)
10416 /* We're on the Ith parameter of the function parameter
10419 /* An argument of a function parameter pack is not a parameter
10421 FUNCTION_PARAMETER_PACK_P (r
) = false;
10423 /* Get the Ith type. */
10424 type
= TREE_VEC_ELT (expanded_types
, i
);
10426 /* Rename the parameter to include the index. */
10428 = make_ith_pack_parameter_name (DECL_NAME (r
), i
);
10431 /* We're dealing with a normal parameter. */
10432 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
10434 type
= type_decays_to (type
);
10435 TREE_TYPE (r
) = type
;
10436 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
10438 if (DECL_INITIAL (r
))
10440 if (TREE_CODE (DECL_INITIAL (r
)) != TEMPLATE_PARM_INDEX
)
10441 DECL_INITIAL (r
) = TREE_TYPE (r
);
10443 DECL_INITIAL (r
) = tsubst (DECL_INITIAL (r
), args
,
10444 complain
, in_decl
);
10447 DECL_CONTEXT (r
) = NULL_TREE
;
10449 if (!DECL_TEMPLATE_PARM_P (r
))
10450 DECL_ARG_TYPE (r
) = type_passed_as (type
);
10452 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
10453 args
, complain
, in_decl
);
10455 /* Keep track of the first new parameter we
10456 generate. That's what will be returned to the
10461 /* Build a proper chain of parameters when substituting
10462 into a function parameter pack. */
10464 DECL_CHAIN (prev_r
) = r
;
10467 /* If cp_unevaluated_operand is set, we're just looking for a
10468 single dummy parameter, so don't keep going. */
10469 if (DECL_CHAIN (t
) && !cp_unevaluated_operand
)
10470 DECL_CHAIN (r
) = tsubst (DECL_CHAIN (t
), args
,
10471 complain
, DECL_CHAIN (t
));
10473 /* FIRST_R contains the start of the chain we've built. */
10483 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
10484 if (type
== error_mark_node
)
10485 RETURN (error_mark_node
);
10486 TREE_TYPE (r
) = type
;
10487 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
10489 if (DECL_C_BIT_FIELD (r
))
10490 /* For bit-fields, DECL_INITIAL gives the number of bits. For
10491 non-bit-fields DECL_INITIAL is a non-static data member
10492 initializer, which gets deferred instantiation. */
10494 = tsubst_expr (DECL_INITIAL (t
), args
,
10496 /*integral_constant_expression_p=*/true);
10497 else if (DECL_INITIAL (t
))
10499 /* Set up DECL_TEMPLATE_INFO so that we can get at the
10500 NSDMI in perform_member_init. Still set DECL_INITIAL
10501 so that we know there is one. */
10502 DECL_INITIAL (r
) = void_zero_node
;
10503 gcc_assert (DECL_LANG_SPECIFIC (r
) == NULL
);
10504 retrofit_lang_decl (r
);
10505 DECL_TEMPLATE_INFO (r
) = build_template_info (t
, args
);
10507 /* We don't have to set DECL_CONTEXT here; it is set by
10508 finish_member_declaration. */
10509 DECL_CHAIN (r
) = NULL_TREE
;
10510 if (VOID_TYPE_P (type
))
10511 error ("instantiation of %q+D as type %qT", r
, type
);
10513 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
10514 args
, complain
, in_decl
);
10519 /* We reach here only for member using decls. We also need to check
10520 uses_template_parms because DECL_DEPENDENT_P is not set for a
10521 using-declaration that designates a member of the current
10522 instantiation (c++/53549). */
10523 if (DECL_DEPENDENT_P (t
)
10524 || uses_template_parms (USING_DECL_SCOPE (t
)))
10526 tree inst_scope
= tsubst_copy (USING_DECL_SCOPE (t
), args
,
10527 complain
, in_decl
);
10528 tree name
= tsubst_copy (DECL_NAME (t
), args
, complain
, in_decl
);
10529 r
= do_class_using_decl (inst_scope
, name
);
10531 r
= error_mark_node
;
10534 TREE_PROTECTED (r
) = TREE_PROTECTED (t
);
10535 TREE_PRIVATE (r
) = TREE_PRIVATE (t
);
10541 DECL_CHAIN (r
) = NULL_TREE
;
10548 tree argvec
= NULL_TREE
;
10549 tree gen_tmpl
= NULL_TREE
;
10551 tree tmpl
= NULL_TREE
;
10553 tree type
= NULL_TREE
;
10556 if (TREE_CODE (t
) == TYPE_DECL
10557 && t
== TYPE_MAIN_DECL (TREE_TYPE (t
)))
10559 /* If this is the canonical decl, we don't have to
10560 mess with instantiations, and often we can't (for
10561 typename, template type parms and such). Note that
10562 TYPE_NAME is not correct for the above test if
10563 we've copied the type for a typedef. */
10564 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
10565 if (type
== error_mark_node
)
10566 RETURN (error_mark_node
);
10567 r
= TYPE_NAME (type
);
10571 /* Check to see if we already have the specialization we
10574 if (DECL_CLASS_SCOPE_P (t
) || DECL_NAMESPACE_SCOPE_P (t
))
10576 /* T is a static data member or namespace-scope entity.
10577 We have to substitute into namespace-scope variables
10578 (even though such entities are never templates) because
10581 template <class T> void f() { extern T t; }
10583 where the entity referenced is not known until
10584 instantiation time. */
10586 ctx
= DECL_CONTEXT (t
);
10587 if (DECL_CLASS_SCOPE_P (t
))
10589 ctx
= tsubst_aggr_type (ctx
, args
,
10591 in_decl
, /*entering_scope=*/1);
10592 /* If CTX is unchanged, then T is in fact the
10593 specialization we want. That situation occurs when
10594 referencing a static data member within in its own
10595 class. We can use pointer equality, rather than
10596 same_type_p, because DECL_CONTEXT is always
10598 if (ctx
== DECL_CONTEXT (t
)
10599 && (TREE_CODE (t
) != TYPE_DECL
10600 /* ... unless T is a member template; in which
10601 case our caller can be willing to create a
10602 specialization of that template represented
10604 || !(DECL_TI_TEMPLATE (t
)
10605 && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (t
)))))
10611 tmpl
= DECL_TI_TEMPLATE (t
);
10612 gen_tmpl
= most_general_template (tmpl
);
10613 argvec
= tsubst (DECL_TI_ARGS (t
), args
, complain
, in_decl
);
10614 if (argvec
== error_mark_node
)
10615 RETURN (error_mark_node
);
10616 hash
= hash_tmpl_and_args (gen_tmpl
, argvec
);
10617 spec
= retrieve_specialization (gen_tmpl
, argvec
, hash
);
10622 /* A local variable. */
10624 /* Subsequent calls to pushdecl will fill this in. */
10626 spec
= retrieve_local_specialization (t
);
10628 /* If we already have the specialization we need, there is
10629 nothing more to do. */
10636 /* Create a new node for the specialization we need. */
10638 if (type
== NULL_TREE
)
10640 if (is_typedef_decl (t
))
10641 type
= DECL_ORIGINAL_TYPE (t
);
10643 type
= TREE_TYPE (t
);
10645 && VAR_HAD_UNKNOWN_BOUND (t
)
10646 && type
!= error_mark_node
)
10647 type
= strip_array_domain (type
);
10648 type
= tsubst (type
, args
, complain
, in_decl
);
10652 /* Even if the original location is out of scope, the
10653 newly substituted one is not. */
10654 DECL_DEAD_FOR_LOCAL (r
) = 0;
10655 DECL_INITIALIZED_P (r
) = 0;
10656 DECL_TEMPLATE_INSTANTIATED (r
) = 0;
10657 if (type
== error_mark_node
)
10658 RETURN (error_mark_node
);
10659 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10661 /* It may seem that this case cannot occur, since:
10666 declares a function, not a variable. However:
10669 template <typename T> void g() { T t; }
10670 template void g<f>();
10672 is an attempt to declare a variable with function
10674 error ("variable %qD has function type",
10675 /* R is not yet sufficiently initialized, so we
10676 just use its name. */
10678 RETURN (error_mark_node
);
10680 type
= complete_type (type
);
10681 /* Wait until cp_finish_decl to set this again, to handle
10682 circular dependency (template/instantiate6.C). */
10683 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r
) = 0;
10684 type
= check_var_type (DECL_NAME (r
), type
);
10686 if (DECL_HAS_VALUE_EXPR_P (t
))
10688 tree ve
= DECL_VALUE_EXPR (t
);
10689 ve
= tsubst_expr (ve
, args
, complain
, in_decl
,
10690 /*constant_expression_p=*/false);
10691 if (REFERENCE_REF_P (ve
))
10693 gcc_assert (TREE_CODE (type
) == REFERENCE_TYPE
);
10694 ve
= TREE_OPERAND (ve
, 0);
10696 SET_DECL_VALUE_EXPR (r
, ve
);
10699 else if (DECL_SELF_REFERENCE_P (t
))
10700 SET_DECL_SELF_REFERENCE_P (r
);
10701 TREE_TYPE (r
) = type
;
10702 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
10703 DECL_CONTEXT (r
) = ctx
;
10704 /* Clear out the mangled name and RTL for the instantiation. */
10705 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
10706 if (CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_DECL_WRTL
))
10707 SET_DECL_RTL (r
, NULL
);
10708 /* The initializer must not be expanded until it is required;
10709 see [temp.inst]. */
10710 DECL_INITIAL (r
) = NULL_TREE
;
10711 if (CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_DECL_WRTL
))
10712 SET_DECL_RTL (r
, NULL
);
10713 DECL_SIZE (r
) = DECL_SIZE_UNIT (r
) = 0;
10716 /* Possibly limit visibility based on template args. */
10717 DECL_VISIBILITY (r
) = VISIBILITY_DEFAULT
;
10718 if (DECL_VISIBILITY_SPECIFIED (t
))
10720 DECL_VISIBILITY_SPECIFIED (r
) = 0;
10721 DECL_ATTRIBUTES (r
)
10722 = remove_attribute ("visibility", DECL_ATTRIBUTES (r
));
10724 determine_visibility (r
);
10729 /* A static data member declaration is always marked
10730 external when it is declared in-class, even if an
10731 initializer is present. We mimic the non-template
10732 processing here. */
10733 DECL_EXTERNAL (r
) = 1;
10735 register_specialization (r
, gen_tmpl
, argvec
, false, hash
);
10736 DECL_TEMPLATE_INFO (r
) = build_template_info (tmpl
, argvec
);
10737 SET_DECL_IMPLICIT_INSTANTIATION (r
);
10739 else if (cp_unevaluated_operand
)
10740 gcc_unreachable ();
10742 register_local_specialization (r
, t
);
10744 DECL_CHAIN (r
) = NULL_TREE
;
10746 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
),
10748 args
, complain
, in_decl
);
10750 /* Preserve a typedef that names a type. */
10751 if (is_typedef_decl (r
))
10753 DECL_ORIGINAL_TYPE (r
) = NULL_TREE
;
10754 set_underlying_type (r
);
10757 layout_decl (r
, 0);
10762 gcc_unreachable ();
10767 /* Restore the file and line information. */
10768 input_location
= saved_loc
;
10773 /* Substitute into the ARG_TYPES of a function type.
10774 If END is a TREE_CHAIN, leave it and any following types
10778 tsubst_arg_types (tree arg_types
,
10781 tsubst_flags_t complain
,
10784 tree remaining_arg_types
;
10785 tree type
= NULL_TREE
;
10787 tree expanded_args
= NULL_TREE
;
10790 if (!arg_types
|| arg_types
== void_list_node
|| arg_types
== end
)
10793 remaining_arg_types
= tsubst_arg_types (TREE_CHAIN (arg_types
),
10794 args
, end
, complain
, in_decl
);
10795 if (remaining_arg_types
== error_mark_node
)
10796 return error_mark_node
;
10798 if (PACK_EXPANSION_P (TREE_VALUE (arg_types
)))
10800 /* For a pack expansion, perform substitution on the
10801 entire expression. Later on, we'll handle the arguments
10803 expanded_args
= tsubst_pack_expansion (TREE_VALUE (arg_types
),
10804 args
, complain
, in_decl
);
10806 if (TREE_CODE (expanded_args
) == TREE_VEC
)
10807 /* So that we'll spin through the parameters, one by one. */
10808 i
= TREE_VEC_LENGTH (expanded_args
);
10811 /* We only partially substituted into the parameter
10812 pack. Our type is TYPE_PACK_EXPANSION. */
10813 type
= expanded_args
;
10814 expanded_args
= NULL_TREE
;
10822 type
= TREE_VEC_ELT (expanded_args
, i
);
10824 type
= tsubst (TREE_VALUE (arg_types
), args
, complain
, in_decl
);
10826 if (type
== error_mark_node
)
10827 return error_mark_node
;
10828 if (VOID_TYPE_P (type
))
10830 if (complain
& tf_error
)
10832 error ("invalid parameter type %qT", type
);
10834 error ("in declaration %q+D", in_decl
);
10836 return error_mark_node
;
10839 if (abstract_virtuals_error_sfinae (ACU_PARM
, type
, complain
))
10840 return error_mark_node
;
10842 /* Do array-to-pointer, function-to-pointer conversion, and ignore
10843 top-level qualifiers as required. */
10844 type
= cv_unqualified (type_decays_to (type
));
10846 /* We do not substitute into default arguments here. The standard
10847 mandates that they be instantiated only when needed, which is
10848 done in build_over_call. */
10849 default_arg
= TREE_PURPOSE (arg_types
);
10851 if (default_arg
&& TREE_CODE (default_arg
) == DEFAULT_ARG
)
10853 /* We've instantiated a template before its default arguments
10854 have been parsed. This can happen for a nested template
10855 class, and is not an error unless we require the default
10856 argument in a call of this function. */
10857 remaining_arg_types
=
10858 tree_cons (default_arg
, type
, remaining_arg_types
);
10859 vec_safe_push (DEFARG_INSTANTIATIONS(default_arg
), remaining_arg_types
);
10862 remaining_arg_types
=
10863 hash_tree_cons (default_arg
, type
, remaining_arg_types
);
10866 return remaining_arg_types
;
10869 /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does
10870 *not* handle the exception-specification for FNTYPE, because the
10871 initial substitution of explicitly provided template parameters
10872 during argument deduction forbids substitution into the
10873 exception-specification:
10877 All references in the function type of the function template to the
10878 corresponding template parameters are replaced by the specified tem-
10879 plate argument values. If a substitution in a template parameter or
10880 in the function type of the function template results in an invalid
10881 type, type deduction fails. [Note: The equivalent substitution in
10882 exception specifications is done only when the function is instanti-
10883 ated, at which point a program is ill-formed if the substitution
10884 results in an invalid type.] */
10887 tsubst_function_type (tree t
,
10889 tsubst_flags_t complain
,
10896 /* The TYPE_CONTEXT is not used for function/method types. */
10897 gcc_assert (TYPE_CONTEXT (t
) == NULL_TREE
);
10899 /* Substitute the return type. */
10900 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
10901 if (return_type
== error_mark_node
)
10902 return error_mark_node
;
10903 /* DR 486 clarifies that creation of a function type with an
10904 invalid return type is a deduction failure. */
10905 if (TREE_CODE (return_type
) == ARRAY_TYPE
10906 || TREE_CODE (return_type
) == FUNCTION_TYPE
)
10908 if (complain
& tf_error
)
10910 if (TREE_CODE (return_type
) == ARRAY_TYPE
)
10911 error ("function returning an array");
10913 error ("function returning a function");
10915 return error_mark_node
;
10918 if (abstract_virtuals_error_sfinae (ACU_RETURN
, return_type
, complain
))
10919 return error_mark_node
;
10921 /* Substitute the argument types. */
10922 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
, NULL_TREE
,
10923 complain
, in_decl
);
10924 if (arg_types
== error_mark_node
)
10925 return error_mark_node
;
10927 /* Construct a new type node and return it. */
10928 if (TREE_CODE (t
) == FUNCTION_TYPE
)
10930 fntype
= build_function_type (return_type
, arg_types
);
10931 fntype
= apply_memfn_quals (fntype
,
10932 type_memfn_quals (t
),
10933 type_memfn_rqual (t
));
10937 tree r
= TREE_TYPE (TREE_VALUE (arg_types
));
10938 if (! MAYBE_CLASS_TYPE_P (r
))
10942 Type deduction may fail for any of the following
10945 -- Attempting to create "pointer to member of T" when T
10946 is not a class type. */
10947 if (complain
& tf_error
)
10948 error ("creating pointer to member function of non-class type %qT",
10950 return error_mark_node
;
10953 fntype
= build_method_type_directly (r
, return_type
,
10954 TREE_CHAIN (arg_types
));
10955 fntype
= build_ref_qualified_type (fntype
, type_memfn_rqual (t
));
10957 fntype
= cp_build_type_attribute_variant (fntype
, TYPE_ATTRIBUTES (t
));
10962 /* FNTYPE is a FUNCTION_TYPE or METHOD_TYPE. Substitute the template
10963 ARGS into that specification, and return the substituted
10964 specification. If there is no specification, return NULL_TREE. */
10967 tsubst_exception_specification (tree fntype
,
10969 tsubst_flags_t complain
,
10976 specs
= TYPE_RAISES_EXCEPTIONS (fntype
);
10977 new_specs
= NULL_TREE
;
10978 if (specs
&& TREE_PURPOSE (specs
))
10980 /* A noexcept-specifier. */
10981 tree expr
= TREE_PURPOSE (specs
);
10982 if (TREE_CODE (expr
) == INTEGER_CST
)
10986 /* Defer instantiation of noexcept-specifiers to avoid
10987 excessive instantiations (c++/49107). */
10988 new_specs
= make_node (DEFERRED_NOEXCEPT
);
10989 if (DEFERRED_NOEXCEPT_SPEC_P (specs
))
10991 /* We already partially instantiated this member template,
10992 so combine the new args with the old. */
10993 DEFERRED_NOEXCEPT_PATTERN (new_specs
)
10994 = DEFERRED_NOEXCEPT_PATTERN (expr
);
10995 DEFERRED_NOEXCEPT_ARGS (new_specs
)
10996 = add_to_template_args (DEFERRED_NOEXCEPT_ARGS (expr
), args
);
11000 DEFERRED_NOEXCEPT_PATTERN (new_specs
) = expr
;
11001 DEFERRED_NOEXCEPT_ARGS (new_specs
) = args
;
11005 new_specs
= tsubst_copy_and_build
11006 (expr
, args
, complain
, in_decl
, /*function_p=*/false,
11007 /*integral_constant_expression_p=*/true);
11008 new_specs
= build_noexcept_spec (new_specs
, complain
);
11012 if (! TREE_VALUE (specs
))
11019 tree expanded_specs
= NULL_TREE
;
11021 if (PACK_EXPANSION_P (TREE_VALUE (specs
)))
11023 /* Expand the pack expansion type. */
11024 expanded_specs
= tsubst_pack_expansion (TREE_VALUE (specs
),
11028 if (expanded_specs
== error_mark_node
)
11029 return error_mark_node
;
11030 else if (TREE_CODE (expanded_specs
) == TREE_VEC
)
11031 len
= TREE_VEC_LENGTH (expanded_specs
);
11034 /* We're substituting into a member template, so
11035 we got a TYPE_PACK_EXPANSION back. Add that
11036 expansion and move on. */
11037 gcc_assert (TREE_CODE (expanded_specs
)
11038 == TYPE_PACK_EXPANSION
);
11039 new_specs
= add_exception_specifier (new_specs
,
11042 specs
= TREE_CHAIN (specs
);
11047 for (i
= 0; i
< len
; ++i
)
11049 if (expanded_specs
)
11050 spec
= TREE_VEC_ELT (expanded_specs
, i
);
11052 spec
= tsubst (TREE_VALUE (specs
), args
, complain
, in_decl
);
11053 if (spec
== error_mark_node
)
11055 new_specs
= add_exception_specifier (new_specs
, spec
,
11059 specs
= TREE_CHAIN (specs
);
11065 /* Take the tree structure T and replace template parameters used
11066 therein with the argument vector ARGS. IN_DECL is an associated
11067 decl for diagnostics. If an error occurs, returns ERROR_MARK_NODE.
11068 Issue error and warning messages under control of COMPLAIN. Note
11069 that we must be relatively non-tolerant of extensions here, in
11070 order to preserve conformance; if we allow substitutions that
11071 should not be allowed, we may allow argument deductions that should
11072 not succeed, and therefore report ambiguous overload situations
11073 where there are none. In theory, we could allow the substitution,
11074 but indicate that it should have failed, and allow our caller to
11075 make sure that the right thing happens, but we don't try to do this
11078 This function is used for dealing with types, decls and the like;
11079 for expressions, use tsubst_expr or tsubst_copy. */
11082 tsubst (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
11084 enum tree_code code
;
11085 tree type
, r
= NULL_TREE
;
11087 if (t
== NULL_TREE
|| t
== error_mark_node
11088 || t
== integer_type_node
11089 || t
== void_type_node
11090 || t
== char_type_node
11091 || t
== unknown_type_node
11092 || TREE_CODE (t
) == NAMESPACE_DECL
11093 || TREE_CODE (t
) == TRANSLATION_UNIT_DECL
)
11097 return tsubst_decl (t
, args
, complain
);
11099 if (args
== NULL_TREE
)
11102 code
= TREE_CODE (t
);
11104 if (code
== IDENTIFIER_NODE
)
11105 type
= IDENTIFIER_TYPE_VALUE (t
);
11107 type
= TREE_TYPE (t
);
11109 gcc_assert (type
!= unknown_type_node
);
11111 /* Reuse typedefs. We need to do this to handle dependent attributes,
11112 such as attribute aligned. */
11114 && typedef_variant_p (t
))
11116 tree decl
= TYPE_NAME (t
);
11118 if (alias_template_specialization_p (t
))
11120 /* DECL represents an alias template and we want to
11122 tree tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
11123 tree gen_args
= tsubst (DECL_TI_ARGS (decl
), args
, complain
, in_decl
);
11124 r
= instantiate_alias_template (tmpl
, gen_args
, complain
);
11126 else if (DECL_CLASS_SCOPE_P (decl
)
11127 && CLASSTYPE_TEMPLATE_INFO (DECL_CONTEXT (decl
))
11128 && uses_template_parms (DECL_CONTEXT (decl
)))
11130 tree tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
11131 tree gen_args
= tsubst (DECL_TI_ARGS (decl
), args
, complain
, in_decl
);
11132 r
= retrieve_specialization (tmpl
, gen_args
, 0);
11134 else if (DECL_FUNCTION_SCOPE_P (decl
)
11135 && DECL_TEMPLATE_INFO (DECL_CONTEXT (decl
))
11136 && uses_template_parms (DECL_TI_ARGS (DECL_CONTEXT (decl
))))
11137 r
= retrieve_local_specialization (decl
);
11139 /* The typedef is from a non-template context. */
11145 r
= cp_build_qualified_type_real
11146 (r
, cp_type_quals (t
) | cp_type_quals (r
),
11147 complain
| tf_ignore_bad_quals
);
11152 /* We don't have an instantiation yet, so drop the typedef. */
11153 int quals
= cp_type_quals (t
);
11154 t
= DECL_ORIGINAL_TYPE (decl
);
11155 t
= cp_build_qualified_type_real (t
, quals
,
11156 complain
| tf_ignore_bad_quals
);
11161 && code
!= TYPENAME_TYPE
11162 && code
!= TEMPLATE_TYPE_PARM
11163 && code
!= IDENTIFIER_NODE
11164 && code
!= FUNCTION_TYPE
11165 && code
!= METHOD_TYPE
)
11166 type
= tsubst (type
, args
, complain
, in_decl
);
11167 if (type
== error_mark_node
)
11168 return error_mark_node
;
11174 case ENUMERAL_TYPE
:
11175 return tsubst_aggr_type (t
, args
, complain
, in_decl
,
11176 /*entering_scope=*/0);
11179 case IDENTIFIER_NODE
:
11190 if (t
== integer_type_node
)
11193 if (TREE_CODE (TYPE_MIN_VALUE (t
)) == INTEGER_CST
11194 && TREE_CODE (TYPE_MAX_VALUE (t
)) == INTEGER_CST
)
11198 tree max
, omax
= TREE_OPERAND (TYPE_MAX_VALUE (t
), 0);
11200 max
= tsubst_expr (omax
, args
, complain
, in_decl
,
11201 /*integral_constant_expression_p=*/false);
11203 /* Fix up type of the magic NOP_EXPR with TREE_SIDE_EFFECTS if
11205 if (TREE_CODE (max
) == NOP_EXPR
11206 && TREE_SIDE_EFFECTS (omax
)
11207 && !TREE_TYPE (max
))
11208 TREE_TYPE (max
) = TREE_TYPE (TREE_OPERAND (max
, 0));
11210 /* If we're in a partial instantiation, preserve the magic NOP_EXPR
11211 with TREE_SIDE_EFFECTS that indicates this is not an integral
11212 constant expression. */
11213 if (processing_template_decl
11214 && TREE_SIDE_EFFECTS (omax
) && TREE_CODE (omax
) == NOP_EXPR
)
11216 gcc_assert (TREE_CODE (max
) == NOP_EXPR
);
11217 TREE_SIDE_EFFECTS (max
) = 1;
11220 return compute_array_index_type (NULL_TREE
, max
, complain
);
11223 case TEMPLATE_TYPE_PARM
:
11224 case TEMPLATE_TEMPLATE_PARM
:
11225 case BOUND_TEMPLATE_TEMPLATE_PARM
:
11226 case TEMPLATE_PARM_INDEX
:
11231 tree arg
= NULL_TREE
;
11235 gcc_assert (TREE_VEC_LENGTH (args
) > 0);
11236 template_parm_level_and_index (t
, &level
, &idx
);
11238 levels
= TMPL_ARGS_DEPTH (args
);
11239 if (level
<= levels
)
11241 arg
= TMPL_ARG (args
, level
, idx
);
11243 if (arg
&& TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
11245 /* See through ARGUMENT_PACK_SELECT arguments. */
11246 arg
= ARGUMENT_PACK_SELECT_ARG (arg
);
11247 /* If the selected argument is an expansion E, that most
11248 likely means we were called from
11249 gen_elem_of_pack_expansion_instantiation during the
11250 substituting of pack an argument pack (which Ith
11251 element is a pack expansion, where I is
11252 ARGUMENT_PACK_SELECT_INDEX) into a pack expansion.
11253 In this case, the Ith element resulting from this
11254 substituting is going to be a pack expansion, which
11255 pattern is the pattern of E. Let's return the
11257 gen_elem_of_pack_expansion_instantiation will
11258 build the resulting pack expansion from it. */
11259 if (PACK_EXPANSION_P (arg
))
11260 arg
= PACK_EXPANSION_PATTERN (arg
);
11264 if (arg
== error_mark_node
)
11265 return error_mark_node
;
11266 else if (arg
!= NULL_TREE
)
11268 if (ARGUMENT_PACK_P (arg
))
11269 /* If ARG is an argument pack, we don't actually want to
11270 perform a substitution here, because substitutions
11271 for argument packs are only done
11272 element-by-element. We can get to this point when
11273 substituting the type of a non-type template
11274 parameter pack, when that type actually contains
11275 template parameter packs from an outer template, e.g.,
11277 template<typename... Types> struct A {
11278 template<Types... Values> struct B { };
11282 if (code
== TEMPLATE_TYPE_PARM
)
11285 gcc_assert (TYPE_P (arg
));
11287 quals
= cp_type_quals (arg
) | cp_type_quals (t
);
11289 return cp_build_qualified_type_real
11290 (arg
, quals
, complain
| tf_ignore_bad_quals
);
11292 else if (code
== BOUND_TEMPLATE_TEMPLATE_PARM
)
11294 /* We are processing a type constructed from a
11295 template template parameter. */
11296 tree argvec
= tsubst (TYPE_TI_ARGS (t
),
11297 args
, complain
, in_decl
);
11298 if (argvec
== error_mark_node
)
11299 return error_mark_node
;
11301 gcc_assert (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
11302 || TREE_CODE (arg
) == TEMPLATE_DECL
11303 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
);
11305 if (TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
)
11306 /* Consider this code:
11308 template <template <class> class Template>
11310 template <class Arg> using Bind = Template<Arg>;
11313 template <template <class> class Template, class Arg>
11314 using Instantiate = Template<Arg>; //#0
11316 template <template <class> class Template,
11319 Instantiate<Internal<Template>::template Bind,
11322 When #1 is parsed, the
11323 BOUND_TEMPLATE_TEMPLATE_PARM representing the
11324 parameter `Template' in #0 matches the
11325 UNBOUND_CLASS_TEMPLATE representing the argument
11326 `Internal<Template>::template Bind'; We then want
11327 to assemble the type `Bind<Argument>' that can't
11328 be fully created right now, because
11329 `Internal<Template>' not being complete, the Bind
11330 template cannot be looked up in that context. So
11331 we need to "store" `Bind<Argument>' for later
11332 when the context of Bind becomes complete. Let's
11333 store that in a TYPENAME_TYPE. */
11334 return make_typename_type (TYPE_CONTEXT (arg
),
11335 build_nt (TEMPLATE_ID_EXPR
,
11336 TYPE_IDENTIFIER (arg
),
11341 /* We can get a TEMPLATE_TEMPLATE_PARM here when we
11342 are resolving nested-types in the signature of a
11343 member function templates. Otherwise ARG is a
11344 TEMPLATE_DECL and is the real template to be
11346 if (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
11347 arg
= TYPE_NAME (arg
);
11349 r
= lookup_template_class (arg
,
11351 DECL_CONTEXT (arg
),
11352 /*entering_scope=*/0,
11354 return cp_build_qualified_type_real
11355 (r
, cp_type_quals (t
), complain
);
11358 /* TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX. */
11359 return convert_from_reference (unshare_expr (arg
));
11363 /* This can happen during the attempted tsubst'ing in
11364 unify. This means that we don't yet have any information
11365 about the template parameter in question. */
11368 /* Early in template argument deduction substitution, we don't
11369 want to reduce the level of 'auto', or it will be confused
11370 with a normal template parm in subsequent deduction. */
11371 if (is_auto (t
) && (complain
& tf_partial
))
11374 /* If we get here, we must have been looking at a parm for a
11375 more deeply nested template. Make a new version of this
11376 template parameter, but with a lower level. */
11379 case TEMPLATE_TYPE_PARM
:
11380 case TEMPLATE_TEMPLATE_PARM
:
11381 case BOUND_TEMPLATE_TEMPLATE_PARM
:
11382 if (cp_type_quals (t
))
11384 r
= tsubst (TYPE_MAIN_VARIANT (t
), args
, complain
, in_decl
);
11385 r
= cp_build_qualified_type_real
11386 (r
, cp_type_quals (t
),
11387 complain
| (code
== TEMPLATE_TYPE_PARM
11388 ? tf_ignore_bad_quals
: 0));
11393 TEMPLATE_TYPE_PARM_INDEX (r
)
11394 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (t
),
11395 r
, levels
, args
, complain
);
11396 TYPE_STUB_DECL (r
) = TYPE_NAME (r
) = TEMPLATE_TYPE_DECL (r
);
11397 TYPE_MAIN_VARIANT (r
) = r
;
11398 TYPE_POINTER_TO (r
) = NULL_TREE
;
11399 TYPE_REFERENCE_TO (r
) = NULL_TREE
;
11401 if (TREE_CODE (r
) == TEMPLATE_TEMPLATE_PARM
)
11402 /* We have reduced the level of the template
11403 template parameter, but not the levels of its
11404 template parameters, so canonical_type_parameter
11405 will not be able to find the canonical template
11406 template parameter for this level. Thus, we
11407 require structural equality checking to compare
11408 TEMPLATE_TEMPLATE_PARMs. */
11409 SET_TYPE_STRUCTURAL_EQUALITY (r
);
11410 else if (TYPE_STRUCTURAL_EQUALITY_P (t
))
11411 SET_TYPE_STRUCTURAL_EQUALITY (r
);
11413 TYPE_CANONICAL (r
) = canonical_type_parameter (r
);
11415 if (code
== BOUND_TEMPLATE_TEMPLATE_PARM
)
11417 tree argvec
= tsubst (TYPE_TI_ARGS (t
), args
,
11418 complain
, in_decl
);
11419 if (argvec
== error_mark_node
)
11420 return error_mark_node
;
11422 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (r
)
11423 = build_template_info (TYPE_TI_TEMPLATE (t
), argvec
);
11428 case TEMPLATE_PARM_INDEX
:
11429 r
= reduce_template_parm_level (t
, type
, levels
, args
, complain
);
11433 gcc_unreachable ();
11441 tree purpose
, value
, chain
;
11443 if (t
== void_list_node
)
11446 purpose
= TREE_PURPOSE (t
);
11449 purpose
= tsubst (purpose
, args
, complain
, in_decl
);
11450 if (purpose
== error_mark_node
)
11451 return error_mark_node
;
11453 value
= TREE_VALUE (t
);
11456 value
= tsubst (value
, args
, complain
, in_decl
);
11457 if (value
== error_mark_node
)
11458 return error_mark_node
;
11460 chain
= TREE_CHAIN (t
);
11461 if (chain
&& chain
!= void_type_node
)
11463 chain
= tsubst (chain
, args
, complain
, in_decl
);
11464 if (chain
== error_mark_node
)
11465 return error_mark_node
;
11467 if (purpose
== TREE_PURPOSE (t
)
11468 && value
== TREE_VALUE (t
)
11469 && chain
== TREE_CHAIN (t
))
11471 return hash_tree_cons (purpose
, value
, chain
);
11475 /* We should never be tsubsting a binfo. */
11476 gcc_unreachable ();
11479 /* A vector of template arguments. */
11480 gcc_assert (!type
);
11481 return tsubst_template_args (t
, args
, complain
, in_decl
);
11484 case REFERENCE_TYPE
:
11486 if (type
== TREE_TYPE (t
) && TREE_CODE (type
) != METHOD_TYPE
)
11491 Type deduction may fail for any of the following
11494 -- Attempting to create a pointer to reference type.
11495 -- Attempting to create a reference to a reference type or
11496 a reference to void.
11498 Core issue 106 says that creating a reference to a reference
11499 during instantiation is no longer a cause for failure. We
11500 only enforce this check in strict C++98 mode. */
11501 if ((TREE_CODE (type
) == REFERENCE_TYPE
11502 && (((cxx_dialect
== cxx98
) && flag_iso
) || code
!= REFERENCE_TYPE
))
11503 || (code
== REFERENCE_TYPE
&& VOID_TYPE_P (type
)))
11505 static location_t last_loc
;
11507 /* We keep track of the last time we issued this error
11508 message to avoid spewing a ton of messages during a
11509 single bad template instantiation. */
11510 if (complain
& tf_error
11511 && last_loc
!= input_location
)
11513 if (VOID_TYPE_P (type
))
11514 error ("forming reference to void");
11515 else if (code
== POINTER_TYPE
)
11516 error ("forming pointer to reference type %qT", type
);
11518 error ("forming reference to reference type %qT", type
);
11519 last_loc
= input_location
;
11522 return error_mark_node
;
11524 else if (TREE_CODE (type
) == FUNCTION_TYPE
11525 && (type_memfn_quals (type
) != TYPE_UNQUALIFIED
11526 || type_memfn_rqual (type
) != REF_QUAL_NONE
))
11528 if (complain
& tf_error
)
11530 if (code
== POINTER_TYPE
)
11531 error ("forming pointer to qualified function type %qT",
11534 error ("forming reference to qualified function type %qT",
11537 return error_mark_node
;
11539 else if (code
== POINTER_TYPE
)
11541 r
= build_pointer_type (type
);
11542 if (TREE_CODE (type
) == METHOD_TYPE
)
11543 r
= build_ptrmemfunc_type (r
);
11545 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
11546 /* In C++0x, during template argument substitution, when there is an
11547 attempt to create a reference to a reference type, reference
11548 collapsing is applied as described in [14.3.1/4 temp.arg.type]:
11550 "If a template-argument for a template-parameter T names a type
11551 that is a reference to a type A, an attempt to create the type
11552 'lvalue reference to cv T' creates the type 'lvalue reference to
11553 A,' while an attempt to create the type type rvalue reference to
11554 cv T' creates the type T"
11556 r
= cp_build_reference_type
11558 TYPE_REF_IS_RVALUE (t
) && TYPE_REF_IS_RVALUE (type
));
11560 r
= cp_build_reference_type (type
, TYPE_REF_IS_RVALUE (t
));
11561 r
= cp_build_qualified_type_real (r
, cp_type_quals (t
), complain
);
11563 if (r
!= error_mark_node
)
11564 /* Will this ever be needed for TYPE_..._TO values? */
11571 r
= tsubst (TYPE_OFFSET_BASETYPE (t
), args
, complain
, in_decl
);
11572 if (r
== error_mark_node
|| !MAYBE_CLASS_TYPE_P (r
))
11576 Type deduction may fail for any of the following
11579 -- Attempting to create "pointer to member of T" when T
11580 is not a class type. */
11581 if (complain
& tf_error
)
11582 error ("creating pointer to member of non-class type %qT", r
);
11583 return error_mark_node
;
11585 if (TREE_CODE (type
) == REFERENCE_TYPE
)
11587 if (complain
& tf_error
)
11588 error ("creating pointer to member reference type %qT", type
);
11589 return error_mark_node
;
11591 if (VOID_TYPE_P (type
))
11593 if (complain
& tf_error
)
11594 error ("creating pointer to member of type void");
11595 return error_mark_node
;
11597 gcc_assert (TREE_CODE (type
) != METHOD_TYPE
);
11598 if (TREE_CODE (type
) == FUNCTION_TYPE
)
11600 /* The type of the implicit object parameter gets its
11601 cv-qualifiers from the FUNCTION_TYPE. */
11604 = build_memfn_type (type
, r
, type_memfn_quals (type
),
11605 type_memfn_rqual (type
));
11606 memptr
= build_ptrmemfunc_type (build_pointer_type (method_type
));
11607 return cp_build_qualified_type_real (memptr
, cp_type_quals (t
),
11611 return cp_build_qualified_type_real (build_ptrmem_type (r
, type
),
11615 case FUNCTION_TYPE
:
11620 fntype
= tsubst_function_type (t
, args
, complain
, in_decl
);
11621 if (fntype
== error_mark_node
)
11622 return error_mark_node
;
11624 /* Substitute the exception specification. */
11625 specs
= tsubst_exception_specification (t
, args
, complain
,
11626 in_decl
, /*defer_ok*/true);
11627 if (specs
== error_mark_node
)
11628 return error_mark_node
;
11630 fntype
= build_exception_variant (fntype
, specs
);
11635 tree domain
= tsubst (TYPE_DOMAIN (t
), args
, complain
, in_decl
);
11636 if (domain
== error_mark_node
)
11637 return error_mark_node
;
11639 /* As an optimization, we avoid regenerating the array type if
11640 it will obviously be the same as T. */
11641 if (type
== TREE_TYPE (t
) && domain
== TYPE_DOMAIN (t
))
11644 /* These checks should match the ones in grokdeclarator.
11648 The deduction may fail for any of the following reasons:
11650 -- Attempting to create an array with an element type that
11651 is void, a function type, or a reference type, or [DR337]
11652 an abstract class type. */
11653 if (VOID_TYPE_P (type
)
11654 || TREE_CODE (type
) == FUNCTION_TYPE
11655 || TREE_CODE (type
) == REFERENCE_TYPE
)
11657 if (complain
& tf_error
)
11658 error ("creating array of %qT", type
);
11659 return error_mark_node
;
11662 if (abstract_virtuals_error_sfinae (ACU_ARRAY
, type
, complain
))
11663 return error_mark_node
;
11665 r
= build_cplus_array_type (type
, domain
);
11667 if (TYPE_USER_ALIGN (t
))
11669 TYPE_ALIGN (r
) = TYPE_ALIGN (t
);
11670 TYPE_USER_ALIGN (r
) = 1;
11676 case TYPENAME_TYPE
:
11678 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
11679 in_decl
, /*entering_scope=*/1);
11680 tree f
= tsubst_copy (TYPENAME_TYPE_FULLNAME (t
), args
,
11681 complain
, in_decl
);
11683 if (ctx
== error_mark_node
|| f
== error_mark_node
)
11684 return error_mark_node
;
11686 if (!MAYBE_CLASS_TYPE_P (ctx
))
11688 if (complain
& tf_error
)
11689 error ("%qT is not a class, struct, or union type", ctx
);
11690 return error_mark_node
;
11692 else if (!uses_template_parms (ctx
) && !TYPE_BEING_DEFINED (ctx
))
11694 /* Normally, make_typename_type does not require that the CTX
11695 have complete type in order to allow things like:
11697 template <class T> struct S { typename S<T>::X Y; };
11699 But, such constructs have already been resolved by this
11700 point, so here CTX really should have complete type, unless
11701 it's a partial instantiation. */
11702 ctx
= complete_type (ctx
);
11703 if (!COMPLETE_TYPE_P (ctx
))
11705 if (complain
& tf_error
)
11706 cxx_incomplete_type_error (NULL_TREE
, ctx
);
11707 return error_mark_node
;
11711 f
= make_typename_type (ctx
, f
, typename_type
,
11712 complain
| tf_keep_type_decl
);
11713 if (f
== error_mark_node
)
11715 if (TREE_CODE (f
) == TYPE_DECL
)
11717 complain
|= tf_ignore_bad_quals
;
11721 if (TREE_CODE (f
) != TYPENAME_TYPE
)
11723 if (TYPENAME_IS_ENUM_P (t
) && TREE_CODE (f
) != ENUMERAL_TYPE
)
11725 if (complain
& tf_error
)
11726 error ("%qT resolves to %qT, which is not an enumeration type",
11729 return error_mark_node
;
11731 else if (TYPENAME_IS_CLASS_P (t
) && !CLASS_TYPE_P (f
))
11733 if (complain
& tf_error
)
11734 error ("%qT resolves to %qT, which is is not a class type",
11737 return error_mark_node
;
11741 return cp_build_qualified_type_real
11742 (f
, cp_type_quals (f
) | cp_type_quals (t
), complain
);
11745 case UNBOUND_CLASS_TEMPLATE
:
11747 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
11748 in_decl
, /*entering_scope=*/1);
11749 tree name
= TYPE_IDENTIFIER (t
);
11750 tree parm_list
= DECL_TEMPLATE_PARMS (TYPE_NAME (t
));
11752 if (ctx
== error_mark_node
|| name
== error_mark_node
)
11753 return error_mark_node
;
11756 parm_list
= tsubst_template_parms (parm_list
, args
, complain
);
11757 return make_unbound_class_template (ctx
, name
, parm_list
, complain
);
11764 ++cp_unevaluated_operand
;
11765 ++c_inhibit_evaluation_warnings
;
11767 type
= tsubst_expr (TYPEOF_TYPE_EXPR (t
), args
,
11769 /*integral_constant_expression_p=*/false);
11771 --cp_unevaluated_operand
;
11772 --c_inhibit_evaluation_warnings
;
11774 type
= finish_typeof (type
);
11775 return cp_build_qualified_type_real (type
,
11777 | cp_type_quals (type
),
11781 case DECLTYPE_TYPE
:
11785 ++cp_unevaluated_operand
;
11786 ++c_inhibit_evaluation_warnings
;
11788 type
= tsubst_copy_and_build (DECLTYPE_TYPE_EXPR (t
), args
,
11789 complain
|tf_decltype
, in_decl
,
11790 /*function_p*/false,
11791 /*integral_constant_expression*/false);
11793 --cp_unevaluated_operand
;
11794 --c_inhibit_evaluation_warnings
;
11796 if (DECLTYPE_FOR_LAMBDA_CAPTURE (t
))
11797 type
= lambda_capture_field_type (type
,
11798 DECLTYPE_FOR_INIT_CAPTURE (t
));
11799 else if (DECLTYPE_FOR_LAMBDA_PROXY (t
))
11800 type
= lambda_proxy_type (type
);
11803 bool id
= DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t
);
11804 if (id
&& TREE_CODE (DECLTYPE_TYPE_EXPR (t
)) == BIT_NOT_EXPR
11806 /* In a template ~id could be either a complement expression
11807 or an unqualified-id naming a destructor; if instantiating
11808 it produces an expression, it's not an id-expression or
11811 type
= finish_decltype_type (type
, id
, complain
);
11813 return cp_build_qualified_type_real (type
,
11815 | cp_type_quals (type
),
11819 case UNDERLYING_TYPE
:
11821 tree type
= tsubst (UNDERLYING_TYPE_TYPE (t
), args
,
11822 complain
, in_decl
);
11823 return finish_underlying_type (type
);
11826 case TYPE_ARGUMENT_PACK
:
11827 case NONTYPE_ARGUMENT_PACK
:
11829 tree r
= TYPE_P (t
) ? cxx_make_type (code
) : make_node (code
);
11831 tsubst_template_args (ARGUMENT_PACK_ARGS (t
),
11835 SET_ARGUMENT_PACK_ARGS (r
, packed_out
);
11837 /* For template nontype argument packs, also substitute into
11839 if (code
== NONTYPE_ARGUMENT_PACK
)
11840 TREE_TYPE (r
) = tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11858 /* We should use one of the expression tsubsts for these codes. */
11859 gcc_unreachable ();
11862 sorry ("use of %qs in template", tree_code_name
[(int) code
]);
11863 return error_mark_node
;
11867 /* Like tsubst_expr for a BASELINK. OBJECT_TYPE, if non-NULL, is the
11868 type of the expression on the left-hand side of the "." or "->"
11872 tsubst_baselink (tree baselink
, tree object_type
,
11873 tree args
, tsubst_flags_t complain
, tree in_decl
)
11876 tree qualifying_scope
;
11879 tree template_args
= 0;
11880 bool template_id_p
= false;
11881 bool qualified
= BASELINK_QUALIFIED_P (baselink
);
11883 /* A baselink indicates a function from a base class. Both the
11884 BASELINK_ACCESS_BINFO and the base class referenced may
11885 indicate bases of the template class, rather than the
11886 instantiated class. In addition, lookups that were not
11887 ambiguous before may be ambiguous now. Therefore, we perform
11888 the lookup again. */
11889 qualifying_scope
= BINFO_TYPE (BASELINK_ACCESS_BINFO (baselink
));
11890 qualifying_scope
= tsubst (qualifying_scope
, args
,
11891 complain
, in_decl
);
11892 fns
= BASELINK_FUNCTIONS (baselink
);
11893 optype
= tsubst (BASELINK_OPTYPE (baselink
), args
, complain
, in_decl
);
11894 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
11896 template_id_p
= true;
11897 template_args
= TREE_OPERAND (fns
, 1);
11898 fns
= TREE_OPERAND (fns
, 0);
11900 template_args
= tsubst_template_args (template_args
, args
,
11901 complain
, in_decl
);
11903 name
= DECL_NAME (get_first_fn (fns
));
11904 if (IDENTIFIER_TYPENAME_P (name
))
11905 name
= mangle_conv_op_name_for_type (optype
);
11906 baselink
= lookup_fnfields (qualifying_scope
, name
, /*protect=*/1);
11908 return error_mark_node
;
11910 /* If lookup found a single function, mark it as used at this
11911 point. (If it lookup found multiple functions the one selected
11912 later by overload resolution will be marked as used at that
11914 if (BASELINK_P (baselink
))
11915 fns
= BASELINK_FUNCTIONS (baselink
);
11916 if (!template_id_p
&& !really_overloaded_fn (fns
))
11917 mark_used (OVL_CURRENT (fns
));
11919 /* Add back the template arguments, if present. */
11920 if (BASELINK_P (baselink
) && template_id_p
)
11921 BASELINK_FUNCTIONS (baselink
)
11922 = build_nt (TEMPLATE_ID_EXPR
,
11923 BASELINK_FUNCTIONS (baselink
),
11925 /* Update the conversion operator type. */
11926 BASELINK_OPTYPE (baselink
) = optype
;
11929 object_type
= current_class_type
;
11932 baselink
= adjust_result_of_qualified_name_lookup (baselink
,
11938 /* Like tsubst_expr for a SCOPE_REF, given by QUALIFIED_ID. DONE is
11939 true if the qualified-id will be a postfix-expression in-and-of
11940 itself; false if more of the postfix-expression follows the
11941 QUALIFIED_ID. ADDRESS_P is true if the qualified-id is the operand
11945 tsubst_qualified_id (tree qualified_id
, tree args
,
11946 tsubst_flags_t complain
, tree in_decl
,
11947 bool done
, bool address_p
)
11953 tree template_args
;
11954 location_t loc
= UNKNOWN_LOCATION
;
11956 gcc_assert (TREE_CODE (qualified_id
) == SCOPE_REF
);
11958 /* Figure out what name to look up. */
11959 name
= TREE_OPERAND (qualified_id
, 1);
11960 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
11962 is_template
= true;
11963 loc
= EXPR_LOCATION (name
);
11964 template_args
= TREE_OPERAND (name
, 1);
11966 template_args
= tsubst_template_args (template_args
, args
,
11967 complain
, in_decl
);
11968 name
= TREE_OPERAND (name
, 0);
11972 is_template
= false;
11973 template_args
= NULL_TREE
;
11976 /* Substitute into the qualifying scope. When there are no ARGS, we
11977 are just trying to simplify a non-dependent expression. In that
11978 case the qualifying scope may be dependent, and, in any case,
11979 substituting will not help. */
11980 scope
= TREE_OPERAND (qualified_id
, 0);
11983 scope
= tsubst (scope
, args
, complain
, in_decl
);
11984 expr
= tsubst_copy (name
, args
, complain
, in_decl
);
11989 if (dependent_scope_p (scope
))
11992 expr
= build_min_nt_loc (loc
, TEMPLATE_ID_EXPR
, expr
, template_args
);
11993 return build_qualified_name (NULL_TREE
, scope
, expr
,
11994 QUALIFIED_NAME_IS_TEMPLATE (qualified_id
));
11997 if (!BASELINK_P (name
) && !DECL_P (expr
))
11999 if (TREE_CODE (expr
) == BIT_NOT_EXPR
)
12001 /* A BIT_NOT_EXPR is used to represent a destructor. */
12002 if (!check_dtor_name (scope
, TREE_OPERAND (expr
, 0)))
12004 error ("qualifying type %qT does not match destructor name ~%qT",
12005 scope
, TREE_OPERAND (expr
, 0));
12006 expr
= error_mark_node
;
12009 expr
= lookup_qualified_name (scope
, complete_dtor_identifier
,
12010 /*is_type_p=*/0, false);
12013 expr
= lookup_qualified_name (scope
, expr
, /*is_type_p=*/0, false);
12014 if (TREE_CODE (TREE_CODE (expr
) == TEMPLATE_DECL
12015 ? DECL_TEMPLATE_RESULT (expr
) : expr
) == TYPE_DECL
)
12017 if (complain
& tf_error
)
12019 error ("dependent-name %qE is parsed as a non-type, but "
12020 "instantiation yields a type", qualified_id
);
12021 inform (input_location
, "say %<typename %E%> if a type is meant", qualified_id
);
12023 return error_mark_node
;
12029 check_accessibility_of_qualified_id (expr
, /*object_type=*/NULL_TREE
,
12031 /* Remember that there was a reference to this entity. */
12035 if (expr
== error_mark_node
|| TREE_CODE (expr
) == TREE_LIST
)
12037 if (complain
& tf_error
)
12038 qualified_name_lookup_error (scope
,
12039 TREE_OPERAND (qualified_id
, 1),
12040 expr
, input_location
);
12041 return error_mark_node
;
12045 expr
= lookup_template_function (expr
, template_args
);
12047 if (expr
== error_mark_node
&& complain
& tf_error
)
12048 qualified_name_lookup_error (scope
, TREE_OPERAND (qualified_id
, 1),
12049 expr
, input_location
);
12050 else if (TYPE_P (scope
))
12052 expr
= (adjust_result_of_qualified_name_lookup
12053 (expr
, scope
, current_nonlambda_class_type ()));
12054 expr
= (finish_qualified_id_expr
12055 (scope
, expr
, done
, address_p
&& PTRMEM_OK_P (qualified_id
),
12056 QUALIFIED_NAME_IS_TEMPLATE (qualified_id
),
12057 /*template_arg_p=*/false, complain
));
12060 /* Expressions do not generally have reference type. */
12061 if (TREE_CODE (expr
) != SCOPE_REF
12062 /* However, if we're about to form a pointer-to-member, we just
12063 want the referenced member referenced. */
12064 && TREE_CODE (expr
) != OFFSET_REF
)
12065 expr
= convert_from_reference (expr
);
12070 /* Like tsubst, but deals with expressions. This function just replaces
12071 template parms; to finish processing the resultant expression, use
12072 tsubst_copy_and_build or tsubst_expr. */
12075 tsubst_copy (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
12077 enum tree_code code
;
12080 if (t
== NULL_TREE
|| t
== error_mark_node
|| args
== NULL_TREE
)
12083 code
= TREE_CODE (t
);
12088 r
= retrieve_local_specialization (t
);
12090 if (r
== NULL_TREE
)
12092 /* We get here for a use of 'this' in an NSDMI. */
12093 if (DECL_NAME (t
) == this_identifier
12094 && at_function_scope_p ()
12095 && DECL_CONSTRUCTOR_P (current_function_decl
))
12096 return current_class_ptr
;
12098 /* This can happen for a parameter name used later in a function
12099 declaration (such as in a late-specified return type). Just
12100 make a dummy decl, since it's only used for its type. */
12101 gcc_assert (cp_unevaluated_operand
!= 0);
12102 r
= tsubst_decl (t
, args
, complain
);
12103 /* Give it the template pattern as its context; its true context
12104 hasn't been instantiated yet and this is good enough for
12106 DECL_CONTEXT (r
) = DECL_CONTEXT (t
);
12109 if (TREE_CODE (r
) == ARGUMENT_PACK_SELECT
)
12110 r
= ARGUMENT_PACK_SELECT_ARG (r
);
12119 if (DECL_TEMPLATE_PARM_P (t
))
12120 return tsubst_copy (DECL_INITIAL (t
), args
, complain
, in_decl
);
12121 /* There is no need to substitute into namespace-scope
12123 if (DECL_NAMESPACE_SCOPE_P (t
))
12125 /* If ARGS is NULL, then T is known to be non-dependent. */
12126 if (args
== NULL_TREE
)
12127 return integral_constant_value (t
);
12129 /* Unfortunately, we cannot just call lookup_name here.
12132 template <int I> int f() {
12134 struct S { void g() { E e = a; } };
12137 When we instantiate f<7>::S::g(), say, lookup_name is not
12138 clever enough to find f<7>::a. */
12140 = tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
12141 /*entering_scope=*/0);
12143 for (v
= TYPE_VALUES (enum_type
);
12145 v
= TREE_CHAIN (v
))
12146 if (TREE_PURPOSE (v
) == DECL_NAME (t
))
12147 return TREE_VALUE (v
);
12149 /* We didn't find the name. That should never happen; if
12150 name-lookup found it during preliminary parsing, we
12151 should find it again here during instantiation. */
12152 gcc_unreachable ();
12157 if (DECL_CONTEXT (t
))
12161 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
12162 /*entering_scope=*/1);
12163 if (ctx
!= DECL_CONTEXT (t
))
12165 tree r
= lookup_field (ctx
, DECL_NAME (t
), 0, false);
12168 if (complain
& tf_error
)
12169 error ("using invalid field %qD", t
);
12170 return error_mark_node
;
12179 case FUNCTION_DECL
:
12180 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
))
12181 r
= tsubst (t
, args
, complain
, in_decl
);
12182 else if (local_variable_p (t
))
12184 r
= retrieve_local_specialization (t
);
12185 if (r
== NULL_TREE
)
12187 if (DECL_ANON_UNION_VAR_P (t
))
12189 /* Just use name lookup to find a member alias for an
12190 anonymous union, but then add it to the hash table. */
12191 r
= lookup_name (DECL_NAME (t
));
12192 gcc_assert (DECL_ANON_UNION_VAR_P (r
));
12193 register_local_specialization (r
, t
);
12197 gcc_assert (errorcount
|| sorrycount
);
12198 return error_mark_node
;
12207 case NAMESPACE_DECL
:
12211 /* An OVERLOAD will always be a non-dependent overload set; an
12212 overload set from function scope will just be represented with an
12213 IDENTIFIER_NODE, and from class scope with a BASELINK. */
12214 gcc_assert (!uses_template_parms (t
));
12218 return tsubst_baselink (t
, current_class_type
, args
, complain
, in_decl
);
12220 case TEMPLATE_DECL
:
12221 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
12222 return tsubst (TREE_TYPE (DECL_TEMPLATE_RESULT (t
)),
12223 args
, complain
, in_decl
);
12224 else if (DECL_FUNCTION_TEMPLATE_P (t
) && DECL_MEMBER_TEMPLATE_P (t
))
12225 return tsubst (t
, args
, complain
, in_decl
);
12226 else if (DECL_CLASS_SCOPE_P (t
)
12227 && uses_template_parms (DECL_CONTEXT (t
)))
12229 /* Template template argument like the following example need
12232 template <template <class> class TT> struct C {};
12233 template <class T> struct D {
12234 template <class U> struct E {};
12239 We are processing the template argument `E' in #1 for
12240 the template instantiation #2. Originally, `E' is a
12241 TEMPLATE_DECL with `D<T>' as its DECL_CONTEXT. Now we
12242 have to substitute this with one having context `D<int>'. */
12244 tree context
= tsubst (DECL_CONTEXT (t
), args
, complain
, in_decl
);
12245 return lookup_field (context
, DECL_NAME(t
), 0, false);
12248 /* Ordinary template template argument. */
12252 case REINTERPRET_CAST_EXPR
:
12253 case CONST_CAST_EXPR
:
12254 case STATIC_CAST_EXPR
:
12255 case DYNAMIC_CAST_EXPR
:
12256 case IMPLICIT_CONV_EXPR
:
12260 (code
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
12261 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
));
12264 if (PACK_EXPANSION_P (TREE_OPERAND (t
, 0)))
12267 tree expanded
, op
= TREE_OPERAND (t
, 0);
12270 if (SIZEOF_EXPR_TYPE_P (t
))
12271 op
= TREE_TYPE (op
);
12273 ++cp_unevaluated_operand
;
12274 ++c_inhibit_evaluation_warnings
;
12275 /* We only want to compute the number of arguments. */
12276 expanded
= tsubst_pack_expansion (op
, args
, complain
, in_decl
);
12277 --cp_unevaluated_operand
;
12278 --c_inhibit_evaluation_warnings
;
12280 if (TREE_CODE (expanded
) == TREE_VEC
)
12281 len
= TREE_VEC_LENGTH (expanded
);
12283 if (expanded
== error_mark_node
)
12284 return error_mark_node
;
12285 else if (PACK_EXPANSION_P (expanded
)
12286 || (TREE_CODE (expanded
) == TREE_VEC
12288 && PACK_EXPANSION_P (TREE_VEC_ELT (expanded
, len
-1))))
12290 if (TREE_CODE (expanded
) == TREE_VEC
)
12291 expanded
= TREE_VEC_ELT (expanded
, len
- 1);
12293 if (TYPE_P (expanded
))
12294 return cxx_sizeof_or_alignof_type (expanded
, SIZEOF_EXPR
,
12295 complain
& tf_error
);
12297 return cxx_sizeof_or_alignof_expr (expanded
, SIZEOF_EXPR
,
12298 complain
& tf_error
);
12301 return build_int_cst (size_type_node
, len
);
12303 if (SIZEOF_EXPR_TYPE_P (t
))
12305 r
= tsubst (TREE_TYPE (TREE_OPERAND (t
, 0)),
12306 args
, complain
, in_decl
);
12307 r
= build1 (NOP_EXPR
, r
, error_mark_node
);
12308 r
= build1 (SIZEOF_EXPR
,
12309 tsubst (TREE_TYPE (t
), args
, complain
, in_decl
), r
);
12310 SIZEOF_EXPR_TYPE_P (r
) = 1;
12317 case TRUTH_NOT_EXPR
:
12320 case UNARY_PLUS_EXPR
: /* Unary + */
12322 case AT_ENCODE_EXPR
:
12326 case REALPART_EXPR
:
12327 case IMAGPART_EXPR
:
12330 (code
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
12331 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
));
12333 case COMPONENT_REF
:
12338 object
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
12339 name
= TREE_OPERAND (t
, 1);
12340 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
12342 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
12343 complain
, in_decl
);
12344 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
12346 else if (TREE_CODE (name
) == SCOPE_REF
12347 && TREE_CODE (TREE_OPERAND (name
, 1)) == BIT_NOT_EXPR
)
12349 tree base
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
12350 complain
, in_decl
);
12351 name
= TREE_OPERAND (name
, 1);
12352 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
12353 complain
, in_decl
);
12354 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
12355 name
= build_qualified_name (/*type=*/NULL_TREE
,
12357 /*template_p=*/false);
12359 else if (BASELINK_P (name
))
12360 name
= tsubst_baselink (name
,
12361 non_reference (TREE_TYPE (object
)),
12365 name
= tsubst_copy (name
, args
, complain
, in_decl
);
12366 return build_nt (COMPONENT_REF
, object
, name
, NULL_TREE
);
12372 case TRUNC_DIV_EXPR
:
12373 case CEIL_DIV_EXPR
:
12374 case FLOOR_DIV_EXPR
:
12375 case ROUND_DIV_EXPR
:
12376 case EXACT_DIV_EXPR
:
12380 case TRUNC_MOD_EXPR
:
12381 case FLOOR_MOD_EXPR
:
12382 case TRUTH_ANDIF_EXPR
:
12383 case TRUTH_ORIF_EXPR
:
12384 case TRUTH_AND_EXPR
:
12385 case TRUTH_OR_EXPR
:
12398 case COMPOUND_EXPR
:
12401 case PREDECREMENT_EXPR
:
12402 case PREINCREMENT_EXPR
:
12403 case POSTDECREMENT_EXPR
:
12404 case POSTINCREMENT_EXPR
:
12406 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
12407 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
));
12410 return build_qualified_name (/*type=*/NULL_TREE
,
12411 tsubst_copy (TREE_OPERAND (t
, 0),
12412 args
, complain
, in_decl
),
12413 tsubst_copy (TREE_OPERAND (t
, 1),
12414 args
, complain
, in_decl
),
12415 QUALIFIED_NAME_IS_TEMPLATE (t
));
12420 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
12421 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
),
12422 NULL_TREE
, NULL_TREE
);
12426 int n
= VL_EXP_OPERAND_LENGTH (t
);
12427 tree result
= build_vl_exp (CALL_EXPR
, n
);
12429 for (i
= 0; i
< n
; i
++)
12430 TREE_OPERAND (t
, i
) = tsubst_copy (TREE_OPERAND (t
, i
), args
,
12431 complain
, in_decl
);
12437 case PSEUDO_DTOR_EXPR
:
12440 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
12441 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
),
12442 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
));
12443 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
12450 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
12451 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
),
12452 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
));
12453 NEW_EXPR_USE_GLOBAL (r
) = NEW_EXPR_USE_GLOBAL (t
);
12460 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
12461 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
));
12462 DELETE_EXPR_USE_GLOBAL (r
) = DELETE_EXPR_USE_GLOBAL (t
);
12463 DELETE_EXPR_USE_VEC (r
) = DELETE_EXPR_USE_VEC (t
);
12467 case TEMPLATE_ID_EXPR
:
12469 /* Substituted template arguments */
12470 tree fn
= TREE_OPERAND (t
, 0);
12471 tree targs
= TREE_OPERAND (t
, 1);
12473 fn
= tsubst_copy (fn
, args
, complain
, in_decl
);
12475 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
12477 return lookup_template_function (fn
, targs
);
12482 tree purpose
, value
, chain
;
12484 if (t
== void_list_node
)
12487 purpose
= TREE_PURPOSE (t
);
12489 purpose
= tsubst_copy (purpose
, args
, complain
, in_decl
);
12490 value
= TREE_VALUE (t
);
12492 value
= tsubst_copy (value
, args
, complain
, in_decl
);
12493 chain
= TREE_CHAIN (t
);
12494 if (chain
&& chain
!= void_type_node
)
12495 chain
= tsubst_copy (chain
, args
, complain
, in_decl
);
12496 if (purpose
== TREE_PURPOSE (t
)
12497 && value
== TREE_VALUE (t
)
12498 && chain
== TREE_CHAIN (t
))
12500 return tree_cons (purpose
, value
, chain
);
12505 case ENUMERAL_TYPE
:
12507 case TEMPLATE_TYPE_PARM
:
12508 case TEMPLATE_TEMPLATE_PARM
:
12509 case BOUND_TEMPLATE_TEMPLATE_PARM
:
12510 case TEMPLATE_PARM_INDEX
:
12512 case REFERENCE_TYPE
:
12514 case FUNCTION_TYPE
:
12517 case TYPENAME_TYPE
:
12518 case UNBOUND_CLASS_TEMPLATE
:
12520 case DECLTYPE_TYPE
:
12522 return tsubst (t
, args
, complain
, in_decl
);
12524 case IDENTIFIER_NODE
:
12525 if (IDENTIFIER_TYPENAME_P (t
))
12527 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12528 return mangle_conv_op_name_for_type (new_type
);
12534 /* This is handled by tsubst_copy_and_build. */
12535 gcc_unreachable ();
12538 return build_x_va_arg (EXPR_LOCATION (t
),
12539 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
,
12541 tsubst (TREE_TYPE (t
), args
, complain
, in_decl
));
12543 case CLEANUP_POINT_EXPR
:
12544 /* We shouldn't have built any of these during initial template
12545 generation. Instead, they should be built during instantiation
12546 in response to the saved STMT_IS_FULL_EXPR_P setting. */
12547 gcc_unreachable ();
12551 (code
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
12552 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
12553 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
));
12554 PTRMEM_OK_P (r
) = PTRMEM_OK_P (t
);
12555 mark_used (TREE_OPERAND (r
, 1));
12558 case EXPR_PACK_EXPANSION
:
12559 error ("invalid use of pack expansion expression");
12560 return error_mark_node
;
12562 case NONTYPE_ARGUMENT_PACK
:
12563 error ("use %<...%> to expand argument pack");
12564 return error_mark_node
;
12571 /* Instantiate any typedefs in the type. */
12572 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12573 r
= fold_convert (type
, t
);
12574 gcc_assert (TREE_CODE (r
) == code
);
12579 /* These can sometimes show up in a partial instantiation, but never
12580 involve template parms. */
12581 gcc_assert (!uses_template_parms (t
));
12585 /* We shouldn't get here, but keep going if !ENABLE_CHECKING. */
12586 gcc_checking_assert (false);
12591 /* Like tsubst_copy, but specifically for OpenMP clauses. */
12594 tsubst_omp_clauses (tree clauses
, tree args
, tsubst_flags_t complain
,
12597 tree new_clauses
= NULL
, nc
, oc
;
12599 for (oc
= clauses
; oc
; oc
= OMP_CLAUSE_CHAIN (oc
))
12601 nc
= copy_node (oc
);
12602 OMP_CLAUSE_CHAIN (nc
) = new_clauses
;
12605 switch (OMP_CLAUSE_CODE (nc
))
12607 case OMP_CLAUSE_LASTPRIVATE
:
12608 if (OMP_CLAUSE_LASTPRIVATE_STMT (oc
))
12610 OMP_CLAUSE_LASTPRIVATE_STMT (nc
) = push_stmt_list ();
12611 tsubst_expr (OMP_CLAUSE_LASTPRIVATE_STMT (oc
), args
, complain
,
12612 in_decl
, /*integral_constant_expression_p=*/false);
12613 OMP_CLAUSE_LASTPRIVATE_STMT (nc
)
12614 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (nc
));
12617 case OMP_CLAUSE_PRIVATE
:
12618 case OMP_CLAUSE_SHARED
:
12619 case OMP_CLAUSE_FIRSTPRIVATE
:
12620 case OMP_CLAUSE_REDUCTION
:
12621 case OMP_CLAUSE_COPYIN
:
12622 case OMP_CLAUSE_COPYPRIVATE
:
12623 case OMP_CLAUSE_IF
:
12624 case OMP_CLAUSE_NUM_THREADS
:
12625 case OMP_CLAUSE_SCHEDULE
:
12626 case OMP_CLAUSE_COLLAPSE
:
12627 case OMP_CLAUSE_FINAL
:
12628 OMP_CLAUSE_OPERAND (nc
, 0)
12629 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 0), args
, complain
,
12630 in_decl
, /*integral_constant_expression_p=*/false);
12632 case OMP_CLAUSE_NOWAIT
:
12633 case OMP_CLAUSE_ORDERED
:
12634 case OMP_CLAUSE_DEFAULT
:
12635 case OMP_CLAUSE_UNTIED
:
12636 case OMP_CLAUSE_MERGEABLE
:
12639 gcc_unreachable ();
12643 return finish_omp_clauses (nreverse (new_clauses
));
12646 /* Like tsubst_copy_and_build, but unshare TREE_LIST nodes. */
12649 tsubst_copy_asm_operands (tree t
, tree args
, tsubst_flags_t complain
,
12652 #define RECUR(t) tsubst_copy_asm_operands (t, args, complain, in_decl)
12654 tree purpose
, value
, chain
;
12659 if (TREE_CODE (t
) != TREE_LIST
)
12660 return tsubst_copy_and_build (t
, args
, complain
, in_decl
,
12661 /*function_p=*/false,
12662 /*integral_constant_expression_p=*/false);
12664 if (t
== void_list_node
)
12667 purpose
= TREE_PURPOSE (t
);
12669 purpose
= RECUR (purpose
);
12670 value
= TREE_VALUE (t
);
12673 if (TREE_CODE (value
) != LABEL_DECL
)
12674 value
= RECUR (value
);
12677 value
= lookup_label (DECL_NAME (value
));
12678 gcc_assert (TREE_CODE (value
) == LABEL_DECL
);
12679 TREE_USED (value
) = 1;
12682 chain
= TREE_CHAIN (t
);
12683 if (chain
&& chain
!= void_type_node
)
12684 chain
= RECUR (chain
);
12685 return tree_cons (purpose
, value
, chain
);
12689 /* Substitute one OMP_FOR iterator. */
12692 tsubst_omp_for_iterator (tree t
, int i
, tree declv
, tree initv
,
12693 tree condv
, tree incrv
, tree
*clauses
,
12694 tree args
, tsubst_flags_t complain
, tree in_decl
,
12695 bool integral_constant_expression_p
)
12697 #define RECUR(NODE) \
12698 tsubst_expr ((NODE), args, complain, in_decl, \
12699 integral_constant_expression_p)
12700 tree decl
, init
, cond
, incr
;
12703 init
= TREE_VEC_ELT (OMP_FOR_INIT (t
), i
);
12704 gcc_assert (TREE_CODE (init
) == MODIFY_EXPR
);
12705 decl
= TREE_OPERAND (init
, 0);
12706 init
= TREE_OPERAND (init
, 1);
12707 /* Do this before substituting into decl to handle 'auto'. */
12708 init_decl
= (init
&& TREE_CODE (init
) == DECL_EXPR
);
12709 init
= RECUR (init
);
12710 decl
= RECUR (decl
);
12713 gcc_assert (!processing_template_decl
);
12714 init
= DECL_INITIAL (decl
);
12715 DECL_INITIAL (decl
) = NULL_TREE
;
12718 gcc_assert (!type_dependent_expression_p (decl
));
12720 if (!CLASS_TYPE_P (TREE_TYPE (decl
)))
12722 cond
= RECUR (TREE_VEC_ELT (OMP_FOR_COND (t
), i
));
12723 incr
= TREE_VEC_ELT (OMP_FOR_INCR (t
), i
);
12724 if (TREE_CODE (incr
) == MODIFY_EXPR
)
12725 incr
= build_x_modify_expr (EXPR_LOCATION (incr
),
12726 RECUR (TREE_OPERAND (incr
, 0)), NOP_EXPR
,
12727 RECUR (TREE_OPERAND (incr
, 1)),
12730 incr
= RECUR (incr
);
12731 TREE_VEC_ELT (declv
, i
) = decl
;
12732 TREE_VEC_ELT (initv
, i
) = init
;
12733 TREE_VEC_ELT (condv
, i
) = cond
;
12734 TREE_VEC_ELT (incrv
, i
) = incr
;
12738 if (init
&& !init_decl
)
12741 for (c
= *clauses
; c
; c
= OMP_CLAUSE_CHAIN (c
))
12743 if ((OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_PRIVATE
12744 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_LASTPRIVATE
)
12745 && OMP_CLAUSE_DECL (c
) == decl
)
12747 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_FIRSTPRIVATE
12748 && OMP_CLAUSE_DECL (c
) == decl
)
12749 error ("iteration variable %qD should not be firstprivate", decl
);
12750 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
12751 && OMP_CLAUSE_DECL (c
) == decl
)
12752 error ("iteration variable %qD should not be reduction", decl
);
12756 c
= build_omp_clause (input_location
, OMP_CLAUSE_PRIVATE
);
12757 OMP_CLAUSE_DECL (c
) = decl
;
12758 c
= finish_omp_clauses (c
);
12761 OMP_CLAUSE_CHAIN (c
) = *clauses
;
12766 cond
= TREE_VEC_ELT (OMP_FOR_COND (t
), i
);
12767 if (COMPARISON_CLASS_P (cond
))
12768 cond
= build2 (TREE_CODE (cond
), boolean_type_node
,
12769 RECUR (TREE_OPERAND (cond
, 0)),
12770 RECUR (TREE_OPERAND (cond
, 1)));
12772 cond
= RECUR (cond
);
12773 incr
= TREE_VEC_ELT (OMP_FOR_INCR (t
), i
);
12774 switch (TREE_CODE (incr
))
12776 case PREINCREMENT_EXPR
:
12777 case PREDECREMENT_EXPR
:
12778 case POSTINCREMENT_EXPR
:
12779 case POSTDECREMENT_EXPR
:
12780 incr
= build2 (TREE_CODE (incr
), TREE_TYPE (decl
),
12781 RECUR (TREE_OPERAND (incr
, 0)), NULL_TREE
);
12784 if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
12785 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
12787 tree rhs
= TREE_OPERAND (incr
, 1);
12788 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
),
12789 RECUR (TREE_OPERAND (incr
, 0)),
12790 build2 (TREE_CODE (rhs
), TREE_TYPE (decl
),
12791 RECUR (TREE_OPERAND (rhs
, 0)),
12792 RECUR (TREE_OPERAND (rhs
, 1))));
12795 incr
= RECUR (incr
);
12798 if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
12799 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
12801 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
12802 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
12803 build2 (TREE_CODE (TREE_OPERAND (incr
, 1)),
12804 TREE_TYPE (decl
), lhs
,
12805 RECUR (TREE_OPERAND (incr
, 2))));
12807 else if (TREE_CODE (TREE_OPERAND (incr
, 1)) == NOP_EXPR
12808 && (TREE_CODE (TREE_OPERAND (incr
, 2)) == PLUS_EXPR
12809 || (TREE_CODE (TREE_OPERAND (incr
, 2)) == MINUS_EXPR
)))
12811 tree rhs
= TREE_OPERAND (incr
, 2);
12812 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
),
12813 RECUR (TREE_OPERAND (incr
, 0)),
12814 build2 (TREE_CODE (rhs
), TREE_TYPE (decl
),
12815 RECUR (TREE_OPERAND (rhs
, 0)),
12816 RECUR (TREE_OPERAND (rhs
, 1))));
12819 incr
= RECUR (incr
);
12822 incr
= RECUR (incr
);
12826 TREE_VEC_ELT (declv
, i
) = decl
;
12827 TREE_VEC_ELT (initv
, i
) = init
;
12828 TREE_VEC_ELT (condv
, i
) = cond
;
12829 TREE_VEC_ELT (incrv
, i
) = incr
;
12833 /* Like tsubst_copy for expressions, etc. but also does semantic
12837 tsubst_expr (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
,
12838 bool integral_constant_expression_p
)
12840 #define RETURN(EXP) do { r = (EXP); goto out; } while(0)
12841 #define RECUR(NODE) \
12842 tsubst_expr ((NODE), args, complain, in_decl, \
12843 integral_constant_expression_p)
12849 if (t
== NULL_TREE
|| t
== error_mark_node
)
12852 loc
= input_location
;
12853 if (EXPR_HAS_LOCATION (t
))
12854 input_location
= EXPR_LOCATION (t
);
12855 if (STATEMENT_CODE_P (TREE_CODE (t
)))
12856 current_stmt_tree ()->stmts_are_full_exprs_p
= STMT_IS_FULL_EXPR_P (t
);
12858 switch (TREE_CODE (t
))
12860 case STATEMENT_LIST
:
12862 tree_stmt_iterator i
;
12863 for (i
= tsi_start (t
); !tsi_end_p (i
); tsi_next (&i
))
12864 RECUR (tsi_stmt (i
));
12868 case CTOR_INITIALIZER
:
12869 finish_mem_initializers (tsubst_initializer_list
12870 (TREE_OPERAND (t
, 0), args
));
12874 finish_return_stmt (RECUR (TREE_OPERAND (t
, 0)));
12878 tmp
= RECUR (EXPR_STMT_EXPR (t
));
12879 if (EXPR_STMT_STMT_EXPR_RESULT (t
))
12880 finish_stmt_expr_expr (tmp
, cur_stmt_expr
);
12882 finish_expr_stmt (tmp
);
12886 do_using_directive (USING_STMT_NAMESPACE (t
));
12891 tree decl
, pattern_decl
;
12894 pattern_decl
= decl
= DECL_EXPR_DECL (t
);
12895 if (TREE_CODE (decl
) == LABEL_DECL
)
12896 finish_label_decl (DECL_NAME (decl
));
12897 else if (TREE_CODE (decl
) == USING_DECL
)
12899 tree scope
= USING_DECL_SCOPE (decl
);
12900 tree name
= DECL_NAME (decl
);
12903 scope
= tsubst (scope
, args
, complain
, in_decl
);
12904 decl
= lookup_qualified_name (scope
, name
,
12905 /*is_type_p=*/false,
12906 /*complain=*/false);
12907 if (decl
== error_mark_node
|| TREE_CODE (decl
) == TREE_LIST
)
12908 qualified_name_lookup_error (scope
, name
, decl
, input_location
);
12910 do_local_using_decl (decl
, scope
, name
);
12914 init
= DECL_INITIAL (decl
);
12915 decl
= tsubst (decl
, args
, complain
, in_decl
);
12916 if (decl
!= error_mark_node
)
12918 /* By marking the declaration as instantiated, we avoid
12919 trying to instantiate it. Since instantiate_decl can't
12920 handle local variables, and since we've already done
12921 all that needs to be done, that's the right thing to
12924 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
12926 && ANON_AGGR_TYPE_P (TREE_TYPE (decl
)))
12927 /* Anonymous aggregates are a special case. */
12928 finish_anon_union (decl
);
12929 else if (is_capture_proxy (DECL_EXPR_DECL (t
)))
12931 DECL_CONTEXT (decl
) = current_function_decl
;
12932 if (DECL_NAME (decl
) == this_identifier
)
12934 tree lam
= DECL_CONTEXT (current_function_decl
);
12935 lam
= CLASSTYPE_LAMBDA_EXPR (lam
);
12936 LAMBDA_EXPR_THIS_CAPTURE (lam
) = decl
;
12938 insert_capture_proxy (decl
);
12940 else if (DECL_IMPLICIT_TYPEDEF_P (t
))
12941 /* We already did a pushtag. */;
12944 int const_init
= false;
12945 maybe_push_decl (decl
);
12947 && DECL_PRETTY_FUNCTION_P (decl
))
12949 /* For __PRETTY_FUNCTION__ we have to adjust the
12951 const char *const name
12952 = cxx_printable_name (current_function_decl
, 2);
12953 init
= cp_fname_init (name
, &TREE_TYPE (decl
));
12957 tree t
= RECUR (init
);
12961 /* If we had an initializer but it
12962 instantiated to nothing,
12963 value-initialize the object. This will
12964 only occur when the initializer was a
12965 pack expansion where the parameter packs
12966 used in that expansion were of length
12968 init
= build_value_init (TREE_TYPE (decl
),
12970 if (TREE_CODE (init
) == AGGR_INIT_EXPR
)
12971 init
= get_target_expr_sfinae (init
, complain
);
12978 const_init
= (DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P
12980 cp_finish_decl (decl
, init
, const_init
, NULL_TREE
, 0);
12989 stmt
= begin_for_stmt (NULL_TREE
, NULL_TREE
);
12990 RECUR (FOR_INIT_STMT (t
));
12991 finish_for_init_stmt (stmt
);
12992 tmp
= RECUR (FOR_COND (t
));
12993 finish_for_cond (tmp
, stmt
);
12994 tmp
= RECUR (FOR_EXPR (t
));
12995 finish_for_expr (tmp
, stmt
);
12996 RECUR (FOR_BODY (t
));
12997 finish_for_stmt (stmt
);
13000 case RANGE_FOR_STMT
:
13003 stmt
= begin_for_stmt (NULL_TREE
, NULL_TREE
);
13004 decl
= RANGE_FOR_DECL (t
);
13005 decl
= tsubst (decl
, args
, complain
, in_decl
);
13006 maybe_push_decl (decl
);
13007 expr
= RECUR (RANGE_FOR_EXPR (t
));
13008 stmt
= cp_convert_range_for (stmt
, decl
, expr
);
13009 RECUR (RANGE_FOR_BODY (t
));
13010 finish_for_stmt (stmt
);
13015 stmt
= begin_while_stmt ();
13016 tmp
= RECUR (WHILE_COND (t
));
13017 finish_while_stmt_cond (tmp
, stmt
);
13018 RECUR (WHILE_BODY (t
));
13019 finish_while_stmt (stmt
);
13023 stmt
= begin_do_stmt ();
13024 RECUR (DO_BODY (t
));
13025 finish_do_body (stmt
);
13026 tmp
= RECUR (DO_COND (t
));
13027 finish_do_stmt (tmp
, stmt
);
13031 stmt
= begin_if_stmt ();
13032 tmp
= RECUR (IF_COND (t
));
13033 finish_if_stmt_cond (tmp
, stmt
);
13034 RECUR (THEN_CLAUSE (t
));
13035 finish_then_clause (stmt
);
13037 if (ELSE_CLAUSE (t
))
13039 begin_else_clause (stmt
);
13040 RECUR (ELSE_CLAUSE (t
));
13041 finish_else_clause (stmt
);
13044 finish_if_stmt (stmt
);
13048 if (BIND_EXPR_BODY_BLOCK (t
))
13049 stmt
= begin_function_body ();
13051 stmt
= begin_compound_stmt (BIND_EXPR_TRY_BLOCK (t
)
13052 ? BCS_TRY_BLOCK
: 0);
13054 RECUR (BIND_EXPR_BODY (t
));
13056 if (BIND_EXPR_BODY_BLOCK (t
))
13057 finish_function_body (stmt
);
13059 finish_compound_stmt (stmt
);
13063 finish_break_stmt ();
13066 case CONTINUE_STMT
:
13067 finish_continue_stmt ();
13071 stmt
= begin_switch_stmt ();
13072 tmp
= RECUR (SWITCH_STMT_COND (t
));
13073 finish_switch_cond (tmp
, stmt
);
13074 RECUR (SWITCH_STMT_BODY (t
));
13075 finish_switch_stmt (stmt
);
13078 case CASE_LABEL_EXPR
:
13079 finish_case_label (EXPR_LOCATION (t
),
13080 RECUR (CASE_LOW (t
)),
13081 RECUR (CASE_HIGH (t
)));
13086 tree decl
= LABEL_EXPR_LABEL (t
);
13089 label
= finish_label_stmt (DECL_NAME (decl
));
13090 if (DECL_ATTRIBUTES (decl
) != NULL_TREE
)
13091 cplus_decl_attributes (&label
, DECL_ATTRIBUTES (decl
), 0);
13096 tmp
= GOTO_DESTINATION (t
);
13097 if (TREE_CODE (tmp
) != LABEL_DECL
)
13098 /* Computed goto's must be tsubst'd into. On the other hand,
13099 non-computed gotos must not be; the identifier in question
13100 will have no binding. */
13103 tmp
= DECL_NAME (tmp
);
13104 finish_goto_stmt (tmp
);
13108 tmp
= finish_asm_stmt
13109 (ASM_VOLATILE_P (t
),
13110 RECUR (ASM_STRING (t
)),
13111 tsubst_copy_asm_operands (ASM_OUTPUTS (t
), args
, complain
, in_decl
),
13112 tsubst_copy_asm_operands (ASM_INPUTS (t
), args
, complain
, in_decl
),
13113 tsubst_copy_asm_operands (ASM_CLOBBERS (t
), args
, complain
, in_decl
),
13114 tsubst_copy_asm_operands (ASM_LABELS (t
), args
, complain
, in_decl
));
13116 tree asm_expr
= tmp
;
13117 if (TREE_CODE (asm_expr
) == CLEANUP_POINT_EXPR
)
13118 asm_expr
= TREE_OPERAND (asm_expr
, 0);
13119 ASM_INPUT_P (asm_expr
) = ASM_INPUT_P (t
);
13126 stmt
= begin_try_block ();
13127 RECUR (TRY_STMTS (t
));
13128 finish_cleanup_try_block (stmt
);
13129 finish_cleanup (RECUR (TRY_HANDLERS (t
)), stmt
);
13133 tree compound_stmt
= NULL_TREE
;
13135 if (FN_TRY_BLOCK_P (t
))
13136 stmt
= begin_function_try_block (&compound_stmt
);
13138 stmt
= begin_try_block ();
13140 RECUR (TRY_STMTS (t
));
13142 if (FN_TRY_BLOCK_P (t
))
13143 finish_function_try_block (stmt
);
13145 finish_try_block (stmt
);
13147 RECUR (TRY_HANDLERS (t
));
13148 if (FN_TRY_BLOCK_P (t
))
13149 finish_function_handler_sequence (stmt
, compound_stmt
);
13151 finish_handler_sequence (stmt
);
13157 tree decl
= HANDLER_PARMS (t
);
13161 decl
= tsubst (decl
, args
, complain
, in_decl
);
13162 /* Prevent instantiate_decl from trying to instantiate
13163 this variable. We've already done all that needs to be
13165 if (decl
!= error_mark_node
)
13166 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
13168 stmt
= begin_handler ();
13169 finish_handler_parms (decl
, stmt
);
13170 RECUR (HANDLER_BODY (t
));
13171 finish_handler (stmt
);
13176 tmp
= tsubst (TREE_TYPE (t
), args
, complain
, NULL_TREE
);
13177 if (CLASS_TYPE_P (tmp
))
13179 /* Local classes are not independent templates; they are
13180 instantiated along with their containing function. And this
13181 way we don't have to deal with pushing out of one local class
13182 to instantiate a member of another local class. */
13184 /* Closures are handled by the LAMBDA_EXPR. */
13185 gcc_assert (!LAMBDA_TYPE_P (TREE_TYPE (t
)));
13186 complete_type (tmp
);
13187 for (fn
= TYPE_METHODS (tmp
); fn
; fn
= DECL_CHAIN (fn
))
13188 if (!DECL_ARTIFICIAL (fn
))
13189 instantiate_decl (fn
, /*defer_ok*/0, /*expl_inst_class*/false);
13193 case STATIC_ASSERT
:
13197 ++c_inhibit_evaluation_warnings
;
13199 tsubst_expr (STATIC_ASSERT_CONDITION (t
),
13202 /*integral_constant_expression_p=*/true);
13203 --c_inhibit_evaluation_warnings
;
13205 finish_static_assert (condition
,
13206 STATIC_ASSERT_MESSAGE (t
),
13207 STATIC_ASSERT_SOURCE_LOCATION (t
),
13208 /*member_p=*/false);
13213 tmp
= tsubst_omp_clauses (OMP_PARALLEL_CLAUSES (t
),
13214 args
, complain
, in_decl
);
13215 stmt
= begin_omp_parallel ();
13216 RECUR (OMP_PARALLEL_BODY (t
));
13217 OMP_PARALLEL_COMBINED (finish_omp_parallel (tmp
, stmt
))
13218 = OMP_PARALLEL_COMBINED (t
);
13222 tmp
= tsubst_omp_clauses (OMP_TASK_CLAUSES (t
),
13223 args
, complain
, in_decl
);
13224 stmt
= begin_omp_task ();
13225 RECUR (OMP_TASK_BODY (t
));
13226 finish_omp_task (tmp
, stmt
);
13231 tree clauses
, body
, pre_body
;
13232 tree declv
, initv
, condv
, incrv
;
13235 clauses
= tsubst_omp_clauses (OMP_FOR_CLAUSES (t
),
13236 args
, complain
, in_decl
);
13237 declv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
13238 initv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
13239 condv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
13240 incrv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
13242 stmt
= begin_omp_structured_block ();
13244 pre_body
= push_stmt_list ();
13245 RECUR (OMP_FOR_PRE_BODY (t
));
13246 pre_body
= pop_stmt_list (pre_body
);
13248 for (i
= 0; i
< TREE_VEC_LENGTH (OMP_FOR_INIT (t
)); i
++)
13249 tsubst_omp_for_iterator (t
, i
, declv
, initv
, condv
, incrv
,
13250 &clauses
, args
, complain
, in_decl
,
13251 integral_constant_expression_p
);
13253 body
= push_stmt_list ();
13254 RECUR (OMP_FOR_BODY (t
));
13255 body
= pop_stmt_list (body
);
13257 t
= finish_omp_for (EXPR_LOCATION (t
), declv
, initv
, condv
, incrv
,
13258 body
, pre_body
, clauses
);
13260 add_stmt (finish_omp_structured_block (stmt
));
13266 tmp
= tsubst_omp_clauses (OMP_CLAUSES (t
), args
, complain
, in_decl
);
13267 stmt
= push_stmt_list ();
13268 RECUR (OMP_BODY (t
));
13269 stmt
= pop_stmt_list (stmt
);
13272 OMP_BODY (t
) = stmt
;
13273 OMP_CLAUSES (t
) = tmp
;
13281 stmt
= push_stmt_list ();
13282 RECUR (OMP_BODY (t
));
13283 stmt
= pop_stmt_list (stmt
);
13286 OMP_BODY (t
) = stmt
;
13291 gcc_assert (OMP_ATOMIC_DEPENDENT_P (t
));
13292 if (TREE_CODE (TREE_OPERAND (t
, 1)) != MODIFY_EXPR
)
13294 tree op1
= TREE_OPERAND (t
, 1);
13295 tree rhs1
= NULL_TREE
;
13297 if (TREE_CODE (op1
) == COMPOUND_EXPR
)
13299 rhs1
= RECUR (TREE_OPERAND (op1
, 0));
13300 op1
= TREE_OPERAND (op1
, 1);
13302 lhs
= RECUR (TREE_OPERAND (op1
, 0));
13303 rhs
= RECUR (TREE_OPERAND (op1
, 1));
13304 finish_omp_atomic (OMP_ATOMIC
, TREE_CODE (op1
), lhs
, rhs
,
13305 NULL_TREE
, NULL_TREE
, rhs1
);
13309 tree op1
= TREE_OPERAND (t
, 1);
13310 tree v
= NULL_TREE
, lhs
, rhs
= NULL_TREE
, lhs1
= NULL_TREE
;
13311 tree rhs1
= NULL_TREE
;
13312 enum tree_code code
= TREE_CODE (TREE_OPERAND (op1
, 1));
13313 enum tree_code opcode
= NOP_EXPR
;
13314 if (code
== OMP_ATOMIC_READ
)
13316 v
= RECUR (TREE_OPERAND (op1
, 0));
13317 lhs
= RECUR (TREE_OPERAND (TREE_OPERAND (op1
, 1), 0));
13319 else if (code
== OMP_ATOMIC_CAPTURE_OLD
13320 || code
== OMP_ATOMIC_CAPTURE_NEW
)
13322 tree op11
= TREE_OPERAND (TREE_OPERAND (op1
, 1), 1);
13323 v
= RECUR (TREE_OPERAND (op1
, 0));
13324 lhs1
= RECUR (TREE_OPERAND (TREE_OPERAND (op1
, 1), 0));
13325 if (TREE_CODE (op11
) == COMPOUND_EXPR
)
13327 rhs1
= RECUR (TREE_OPERAND (op11
, 0));
13328 op11
= TREE_OPERAND (op11
, 1);
13330 lhs
= RECUR (TREE_OPERAND (op11
, 0));
13331 rhs
= RECUR (TREE_OPERAND (op11
, 1));
13332 opcode
= TREE_CODE (op11
);
13337 lhs
= RECUR (TREE_OPERAND (op1
, 0));
13338 rhs
= RECUR (TREE_OPERAND (op1
, 1));
13340 finish_omp_atomic (code
, opcode
, lhs
, rhs
, v
, lhs1
, rhs1
);
13344 case TRANSACTION_EXPR
:
13347 flags
|= (TRANSACTION_EXPR_OUTER (t
) ? TM_STMT_ATTR_OUTER
: 0);
13348 flags
|= (TRANSACTION_EXPR_RELAXED (t
) ? TM_STMT_ATTR_RELAXED
: 0);
13350 if (TRANSACTION_EXPR_IS_STMT (t
))
13352 tree body
= TRANSACTION_EXPR_BODY (t
);
13353 tree noex
= NULL_TREE
;
13354 if (TREE_CODE (body
) == MUST_NOT_THROW_EXPR
)
13356 noex
= MUST_NOT_THROW_COND (body
);
13357 if (noex
== NULL_TREE
)
13358 noex
= boolean_true_node
;
13359 body
= TREE_OPERAND (body
, 0);
13361 stmt
= begin_transaction_stmt (input_location
, NULL
, flags
);
13363 finish_transaction_stmt (stmt
, NULL
, flags
, RECUR (noex
));
13367 stmt
= build_transaction_expr (EXPR_LOCATION (t
),
13368 RECUR (TRANSACTION_EXPR_BODY (t
)),
13375 case MUST_NOT_THROW_EXPR
:
13376 RETURN (build_must_not_throw_expr (RECUR (TREE_OPERAND (t
, 0)),
13377 RECUR (MUST_NOT_THROW_COND (t
))));
13379 case EXPR_PACK_EXPANSION
:
13380 error ("invalid use of pack expansion expression");
13381 RETURN (error_mark_node
);
13383 case NONTYPE_ARGUMENT_PACK
:
13384 error ("use %<...%> to expand argument pack");
13385 RETURN (error_mark_node
);
13387 case COMPOUND_EXPR
:
13388 tmp
= RECUR (TREE_OPERAND (t
, 0));
13389 if (tmp
== NULL_TREE
)
13390 /* If the first operand was a statement, we're done with it. */
13391 RETURN (RECUR (TREE_OPERAND (t
, 1)));
13392 RETURN (build_x_compound_expr (EXPR_LOCATION (t
), tmp
,
13393 RECUR (TREE_OPERAND (t
, 1)),
13397 gcc_assert (!STATEMENT_CODE_P (TREE_CODE (t
)));
13399 RETURN (tsubst_copy_and_build (t
, args
, complain
, in_decl
,
13400 /*function_p=*/false,
13401 integral_constant_expression_p
));
13404 RETURN (NULL_TREE
);
13406 input_location
= loc
;
13412 /* T is a postfix-expression that is not being used in a function
13413 call. Return the substituted version of T. */
13416 tsubst_non_call_postfix_expression (tree t
, tree args
,
13417 tsubst_flags_t complain
,
13420 if (TREE_CODE (t
) == SCOPE_REF
)
13421 t
= tsubst_qualified_id (t
, args
, complain
, in_decl
,
13422 /*done=*/false, /*address_p=*/false);
13424 t
= tsubst_copy_and_build (t
, args
, complain
, in_decl
,
13425 /*function_p=*/false,
13426 /*integral_constant_expression_p=*/false);
13431 /* Like tsubst but deals with expressions and performs semantic
13432 analysis. FUNCTION_P is true if T is the "F" in "F (ARGS)". */
13435 tsubst_copy_and_build (tree t
,
13437 tsubst_flags_t complain
,
13440 bool integral_constant_expression_p
)
13442 #define RETURN(EXP) do { retval = (EXP); goto out; } while(0)
13443 #define RECUR(NODE) \
13444 tsubst_copy_and_build (NODE, args, complain, in_decl, \
13445 /*function_p=*/false, \
13446 integral_constant_expression_p)
13451 if (t
== NULL_TREE
|| t
== error_mark_node
)
13454 loc
= input_location
;
13455 if (EXPR_HAS_LOCATION (t
))
13456 input_location
= EXPR_LOCATION (t
);
13458 /* N3276 decltype magic only applies to calls at the top level or on the
13459 right side of a comma. */
13460 tsubst_flags_t decltype_flag
= (complain
& tf_decltype
);
13461 complain
&= ~tf_decltype
;
13463 switch (TREE_CODE (t
))
13467 /* Fall through. */
13468 case IDENTIFIER_NODE
:
13472 bool non_integral_constant_expression_p
;
13473 const char *error_msg
;
13475 if (IDENTIFIER_TYPENAME_P (t
))
13477 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13478 t
= mangle_conv_op_name_for_type (new_type
);
13481 /* Look up the name. */
13482 decl
= lookup_name (t
);
13484 /* By convention, expressions use ERROR_MARK_NODE to indicate
13485 failure, not NULL_TREE. */
13486 if (decl
== NULL_TREE
)
13487 decl
= error_mark_node
;
13489 decl
= finish_id_expression (t
, decl
, NULL_TREE
,
13491 integral_constant_expression_p
,
13492 /*allow_non_integral_constant_expression_p=*/(cxx_dialect
>= cxx0x
),
13493 &non_integral_constant_expression_p
,
13494 /*template_p=*/false,
13496 /*address_p=*/false,
13497 /*template_arg_p=*/false,
13502 if (!function_p
&& identifier_p (decl
))
13504 if (complain
& tf_error
)
13505 unqualified_name_lookup_error (decl
);
13506 decl
= error_mark_node
;
13511 case TEMPLATE_ID_EXPR
:
13514 tree templ
= RECUR (TREE_OPERAND (t
, 0));
13515 tree targs
= TREE_OPERAND (t
, 1);
13518 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
13520 if (TREE_CODE (templ
) == COMPONENT_REF
)
13522 object
= TREE_OPERAND (templ
, 0);
13523 templ
= TREE_OPERAND (templ
, 1);
13526 object
= NULL_TREE
;
13527 templ
= lookup_template_function (templ
, targs
);
13530 RETURN (build3 (COMPONENT_REF
, TREE_TYPE (templ
),
13531 object
, templ
, NULL_TREE
));
13533 RETURN (baselink_for_fns (templ
));
13538 tree r
= RECUR (TREE_OPERAND (t
, 0));
13540 if (REFERENCE_REF_P (t
))
13542 /* A type conversion to reference type will be enclosed in
13543 such an indirect ref, but the substitution of the cast
13544 will have also added such an indirect ref. */
13545 if (TREE_CODE (TREE_TYPE (r
)) == REFERENCE_TYPE
)
13546 r
= convert_from_reference (r
);
13549 r
= build_x_indirect_ref (input_location
, r
, RO_UNARY_STAR
,
13550 complain
|decltype_flag
);
13556 (tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
13557 RECUR (TREE_OPERAND (t
, 0))));
13559 case IMPLICIT_CONV_EXPR
:
13561 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13562 tree expr
= RECUR (TREE_OPERAND (t
, 0));
13563 int flags
= LOOKUP_IMPLICIT
;
13564 if (IMPLICIT_CONV_EXPR_DIRECT_INIT (t
))
13565 flags
= LOOKUP_NORMAL
;
13566 RETURN (perform_implicit_conversion_flags (type
, expr
, complain
,
13573 tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
13574 RECUR (TREE_OPERAND (t
, 0))));
13577 case REINTERPRET_CAST_EXPR
:
13578 case CONST_CAST_EXPR
:
13579 case DYNAMIC_CAST_EXPR
:
13580 case STATIC_CAST_EXPR
:
13583 tree op
, r
= NULL_TREE
;
13585 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13586 if (integral_constant_expression_p
13587 && !cast_valid_in_integral_constant_expression_p (type
))
13589 if (complain
& tf_error
)
13590 error ("a cast to a type other than an integral or "
13591 "enumeration type cannot appear in a constant-expression");
13592 RETURN (error_mark_node
);
13595 op
= RECUR (TREE_OPERAND (t
, 0));
13597 ++c_inhibit_evaluation_warnings
;
13598 switch (TREE_CODE (t
))
13601 r
= build_functional_cast (type
, op
, complain
);
13603 case REINTERPRET_CAST_EXPR
:
13604 r
= build_reinterpret_cast (type
, op
, complain
);
13606 case CONST_CAST_EXPR
:
13607 r
= build_const_cast (type
, op
, complain
);
13609 case DYNAMIC_CAST_EXPR
:
13610 r
= build_dynamic_cast (type
, op
, complain
);
13612 case STATIC_CAST_EXPR
:
13613 r
= build_static_cast (type
, op
, complain
);
13616 gcc_unreachable ();
13618 --c_inhibit_evaluation_warnings
;
13623 case POSTDECREMENT_EXPR
:
13624 case POSTINCREMENT_EXPR
:
13625 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
13626 args
, complain
, in_decl
);
13627 RETURN (build_x_unary_op (input_location
, TREE_CODE (t
), op1
,
13628 complain
|decltype_flag
));
13630 case PREDECREMENT_EXPR
:
13631 case PREINCREMENT_EXPR
:
13635 case TRUTH_NOT_EXPR
:
13636 case UNARY_PLUS_EXPR
: /* Unary + */
13637 case REALPART_EXPR
:
13638 case IMAGPART_EXPR
:
13639 RETURN (build_x_unary_op (input_location
, TREE_CODE (t
),
13640 RECUR (TREE_OPERAND (t
, 0)),
13641 complain
|decltype_flag
));
13643 case FIX_TRUNC_EXPR
:
13644 RETURN (cp_build_unary_op (FIX_TRUNC_EXPR
, RECUR (TREE_OPERAND (t
, 0)),
13648 op1
= TREE_OPERAND (t
, 0);
13649 if (TREE_CODE (op1
) == LABEL_DECL
)
13650 RETURN (finish_label_address_expr (DECL_NAME (op1
),
13651 EXPR_LOCATION (op1
)));
13652 if (TREE_CODE (op1
) == SCOPE_REF
)
13653 op1
= tsubst_qualified_id (op1
, args
, complain
, in_decl
,
13654 /*done=*/true, /*address_p=*/true);
13656 op1
= tsubst_non_call_postfix_expression (op1
, args
, complain
,
13658 RETURN (build_x_unary_op (input_location
, ADDR_EXPR
, op1
,
13659 complain
|decltype_flag
));
13664 case TRUNC_DIV_EXPR
:
13665 case CEIL_DIV_EXPR
:
13666 case FLOOR_DIV_EXPR
:
13667 case ROUND_DIV_EXPR
:
13668 case EXACT_DIV_EXPR
:
13672 case TRUNC_MOD_EXPR
:
13673 case FLOOR_MOD_EXPR
:
13674 case TRUTH_ANDIF_EXPR
:
13675 case TRUTH_ORIF_EXPR
:
13676 case TRUTH_AND_EXPR
:
13677 case TRUTH_OR_EXPR
:
13695 ++c_inhibit_evaluation_warnings
;
13697 r
= build_x_binary_op
13698 (input_location
, TREE_CODE (t
),
13699 RECUR (TREE_OPERAND (t
, 0)),
13700 (TREE_NO_WARNING (TREE_OPERAND (t
, 0))
13702 : TREE_CODE (TREE_OPERAND (t
, 0))),
13703 RECUR (TREE_OPERAND (t
, 1)),
13704 (TREE_NO_WARNING (TREE_OPERAND (t
, 1))
13706 : TREE_CODE (TREE_OPERAND (t
, 1))),
13708 complain
|decltype_flag
);
13709 if (EXPR_P (r
) && TREE_NO_WARNING (t
))
13710 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
13712 --c_inhibit_evaluation_warnings
;
13718 RETURN (tsubst_qualified_id (t
, args
, complain
, in_decl
, /*done=*/true,
13719 /*address_p=*/false));
13721 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
13722 args
, complain
, in_decl
);
13723 RETURN (build_x_array_ref (EXPR_LOCATION (t
), op1
,
13724 RECUR (TREE_OPERAND (t
, 1)),
13725 complain
|decltype_flag
));
13728 if (PACK_EXPANSION_P (TREE_OPERAND (t
, 0)))
13729 RETURN (tsubst_copy (t
, args
, complain
, in_decl
));
13736 op1
= TREE_OPERAND (t
, 0);
13737 if (TREE_CODE (t
) == SIZEOF_EXPR
&& SIZEOF_EXPR_TYPE_P (t
))
13738 op1
= TREE_TYPE (op1
);
13741 /* When there are no ARGS, we are trying to evaluate a
13742 non-dependent expression from the parser. Trying to do
13743 the substitutions may not work. */
13745 op1
= TREE_TYPE (op1
);
13749 ++cp_unevaluated_operand
;
13750 ++c_inhibit_evaluation_warnings
;
13752 op1
= tsubst (op1
, args
, complain
, in_decl
);
13754 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
13755 /*function_p=*/false,
13756 /*integral_constant_expression_p=*/
13758 --cp_unevaluated_operand
;
13759 --c_inhibit_evaluation_warnings
;
13762 r
= cxx_sizeof_or_alignof_type (op1
, TREE_CODE (t
),
13763 complain
& tf_error
);
13765 r
= cxx_sizeof_or_alignof_expr (op1
, TREE_CODE (t
),
13766 complain
& tf_error
);
13767 if (TREE_CODE (t
) == SIZEOF_EXPR
&& r
!= error_mark_node
)
13769 if (TREE_CODE (r
) != SIZEOF_EXPR
|| TYPE_P (op1
))
13771 if (!processing_template_decl
&& TYPE_P (op1
))
13773 r
= build_min (SIZEOF_EXPR
, size_type_node
,
13774 build1 (NOP_EXPR
, op1
, error_mark_node
));
13775 SIZEOF_EXPR_TYPE_P (r
) = 1;
13778 r
= build_min (SIZEOF_EXPR
, size_type_node
, op1
);
13779 TREE_SIDE_EFFECTS (r
) = 0;
13780 TREE_READONLY (r
) = 1;
13782 SET_EXPR_LOCATION (r
, EXPR_LOCATION (t
));
13787 case AT_ENCODE_EXPR
:
13789 op1
= TREE_OPERAND (t
, 0);
13790 ++cp_unevaluated_operand
;
13791 ++c_inhibit_evaluation_warnings
;
13792 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
13793 /*function_p=*/false,
13794 /*integral_constant_expression_p=*/false);
13795 --cp_unevaluated_operand
;
13796 --c_inhibit_evaluation_warnings
;
13797 RETURN (objc_build_encode_expr (op1
));
13800 case NOEXCEPT_EXPR
:
13801 op1
= TREE_OPERAND (t
, 0);
13802 ++cp_unevaluated_operand
;
13803 ++c_inhibit_evaluation_warnings
;
13804 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
13805 /*function_p=*/false,
13806 /*integral_constant_expression_p=*/false);
13807 --cp_unevaluated_operand
;
13808 --c_inhibit_evaluation_warnings
;
13809 RETURN (finish_noexcept_expr (op1
, complain
));
13813 tree r
= build_x_modify_expr
13814 (EXPR_LOCATION (t
),
13815 RECUR (TREE_OPERAND (t
, 0)),
13816 TREE_CODE (TREE_OPERAND (t
, 1)),
13817 RECUR (TREE_OPERAND (t
, 2)),
13818 complain
|decltype_flag
);
13819 /* TREE_NO_WARNING must be set if either the expression was
13820 parenthesized or it uses an operator such as >>= rather
13821 than plain assignment. In the former case, it was already
13822 set and must be copied. In the latter case,
13823 build_x_modify_expr sets it and it must not be reset
13825 if (TREE_NO_WARNING (t
))
13826 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
13831 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
13832 args
, complain
, in_decl
);
13833 /* Remember that there was a reference to this entity. */
13836 RETURN (build_x_arrow (input_location
, op1
, complain
));
13840 tree placement
= RECUR (TREE_OPERAND (t
, 0));
13841 tree init
= RECUR (TREE_OPERAND (t
, 3));
13842 vec
<tree
, va_gc
> *placement_vec
;
13843 vec
<tree
, va_gc
> *init_vec
;
13846 if (placement
== NULL_TREE
)
13847 placement_vec
= NULL
;
13850 placement_vec
= make_tree_vector ();
13851 for (; placement
!= NULL_TREE
; placement
= TREE_CHAIN (placement
))
13852 vec_safe_push (placement_vec
, TREE_VALUE (placement
));
13855 /* If there was an initializer in the original tree, but it
13856 instantiated to an empty list, then we should pass a
13857 non-NULL empty vector to tell build_new that it was an
13858 empty initializer() rather than no initializer. This can
13859 only happen when the initializer is a pack expansion whose
13860 parameter packs are of length zero. */
13861 if (init
== NULL_TREE
&& TREE_OPERAND (t
, 3) == NULL_TREE
)
13865 init_vec
= make_tree_vector ();
13866 if (init
== void_zero_node
)
13867 gcc_assert (init_vec
!= NULL
);
13870 for (; init
!= NULL_TREE
; init
= TREE_CHAIN (init
))
13871 vec_safe_push (init_vec
, TREE_VALUE (init
));
13875 ret
= build_new (&placement_vec
,
13876 tsubst (TREE_OPERAND (t
, 1), args
, complain
, in_decl
),
13877 RECUR (TREE_OPERAND (t
, 2)),
13879 NEW_EXPR_USE_GLOBAL (t
),
13882 if (placement_vec
!= NULL
)
13883 release_tree_vector (placement_vec
);
13884 if (init_vec
!= NULL
)
13885 release_tree_vector (init_vec
);
13891 RETURN (delete_sanity
13892 (RECUR (TREE_OPERAND (t
, 0)),
13893 RECUR (TREE_OPERAND (t
, 1)),
13894 DELETE_EXPR_USE_VEC (t
),
13895 DELETE_EXPR_USE_GLOBAL (t
),
13898 case COMPOUND_EXPR
:
13900 tree op0
= tsubst_copy_and_build (TREE_OPERAND (t
, 0), args
,
13901 complain
& ~tf_decltype
, in_decl
,
13902 /*function_p=*/false,
13903 integral_constant_expression_p
);
13904 RETURN (build_x_compound_expr (EXPR_LOCATION (t
),
13906 RECUR (TREE_OPERAND (t
, 1)),
13907 complain
|decltype_flag
));
13913 vec
<tree
, va_gc
> *call_args
;
13914 unsigned int nargs
, i
;
13919 function
= CALL_EXPR_FN (t
);
13920 /* When we parsed the expression, we determined whether or
13921 not Koenig lookup should be performed. */
13922 koenig_p
= KOENIG_LOOKUP_P (t
);
13923 if (TREE_CODE (function
) == SCOPE_REF
)
13925 qualified_p
= true;
13926 function
= tsubst_qualified_id (function
, args
, complain
, in_decl
,
13928 /*address_p=*/false);
13930 else if (koenig_p
&& identifier_p (function
))
13932 /* Do nothing; calling tsubst_copy_and_build on an identifier
13933 would incorrectly perform unqualified lookup again.
13935 Note that we can also have an IDENTIFIER_NODE if the earlier
13936 unqualified lookup found a member function; in that case
13937 koenig_p will be false and we do want to do the lookup
13938 again to find the instantiated member function.
13940 FIXME but doing that causes c++/15272, so we need to stop
13941 using IDENTIFIER_NODE in that situation. */
13942 qualified_p
= false;
13946 if (TREE_CODE (function
) == COMPONENT_REF
)
13948 tree op
= TREE_OPERAND (function
, 1);
13950 qualified_p
= (TREE_CODE (op
) == SCOPE_REF
13951 || (BASELINK_P (op
)
13952 && BASELINK_QUALIFIED_P (op
)));
13955 qualified_p
= false;
13957 if (TREE_CODE (function
) == ADDR_EXPR
13958 && TREE_CODE (TREE_OPERAND (function
, 0)) == FUNCTION_DECL
)
13959 /* Avoid error about taking the address of a constructor. */
13960 function
= TREE_OPERAND (function
, 0);
13962 function
= tsubst_copy_and_build (function
, args
, complain
,
13965 integral_constant_expression_p
);
13967 if (BASELINK_P (function
))
13968 qualified_p
= true;
13971 nargs
= call_expr_nargs (t
);
13972 call_args
= make_tree_vector ();
13973 for (i
= 0; i
< nargs
; ++i
)
13975 tree arg
= CALL_EXPR_ARG (t
, i
);
13977 if (!PACK_EXPANSION_P (arg
))
13978 vec_safe_push (call_args
, RECUR (CALL_EXPR_ARG (t
, i
)));
13981 /* Expand the pack expansion and push each entry onto
13983 arg
= tsubst_pack_expansion (arg
, args
, complain
, in_decl
);
13984 if (TREE_CODE (arg
) == TREE_VEC
)
13986 unsigned int len
, j
;
13988 len
= TREE_VEC_LENGTH (arg
);
13989 for (j
= 0; j
< len
; ++j
)
13991 tree value
= TREE_VEC_ELT (arg
, j
);
13992 if (value
!= NULL_TREE
)
13993 value
= convert_from_reference (value
);
13994 vec_safe_push (call_args
, value
);
13999 /* A partial substitution. Add one entry. */
14000 vec_safe_push (call_args
, arg
);
14005 /* We do not perform argument-dependent lookup if normal
14006 lookup finds a non-function, in accordance with the
14007 expected resolution of DR 218. */
14009 && ((is_overloaded_fn (function
)
14010 /* If lookup found a member function, the Koenig lookup is
14011 not appropriate, even if an unqualified-name was used
14012 to denote the function. */
14013 && !DECL_FUNCTION_MEMBER_P (get_first_fn (function
)))
14014 || identifier_p (function
))
14015 /* Only do this when substitution turns a dependent call
14016 into a non-dependent call. */
14017 && type_dependent_expression_p_push (t
)
14018 && !any_type_dependent_arguments_p (call_args
))
14019 function
= perform_koenig_lookup (function
, call_args
, false,
14022 if (identifier_p (function
)
14023 && !any_type_dependent_arguments_p (call_args
))
14025 if (koenig_p
&& (complain
& tf_warning_or_error
))
14027 /* For backwards compatibility and good diagnostics, try
14028 the unqualified lookup again if we aren't in SFINAE
14030 tree unq
= (tsubst_copy_and_build
14031 (function
, args
, complain
, in_decl
, true,
14032 integral_constant_expression_p
));
14033 if (unq
== error_mark_node
)
14034 RETURN (error_mark_node
);
14036 if (unq
!= function
)
14039 if (INDIRECT_REF_P (fn
))
14040 fn
= TREE_OPERAND (fn
, 0);
14041 if (TREE_CODE (fn
) == COMPONENT_REF
)
14042 fn
= TREE_OPERAND (fn
, 1);
14043 if (is_overloaded_fn (fn
))
14044 fn
= get_first_fn (fn
);
14045 if (permerror (EXPR_LOC_OR_HERE (t
),
14046 "%qD was not declared in this scope, "
14047 "and no declarations were found by "
14048 "argument-dependent lookup at the point "
14049 "of instantiation", function
))
14052 /* Can't say anything more. */;
14053 else if (DECL_CLASS_SCOPE_P (fn
))
14055 inform (EXPR_LOC_OR_HERE (t
),
14056 "declarations in dependent base %qT are "
14057 "not found by unqualified lookup",
14058 DECL_CLASS_CONTEXT (fn
));
14059 if (current_class_ptr
)
14060 inform (EXPR_LOC_OR_HERE (t
),
14061 "use %<this->%D%> instead", function
);
14063 inform (EXPR_LOC_OR_HERE (t
),
14064 "use %<%T::%D%> instead",
14065 current_class_name
, function
);
14068 inform (0, "%q+D declared here, later in the "
14069 "translation unit", fn
);
14074 if (identifier_p (function
))
14076 if (complain
& tf_error
)
14077 unqualified_name_lookup_error (function
);
14078 release_tree_vector (call_args
);
14079 RETURN (error_mark_node
);
14083 /* Remember that there was a reference to this entity. */
14084 if (DECL_P (function
))
14085 mark_used (function
);
14087 /* Put back tf_decltype for the actual call. */
14088 complain
|= decltype_flag
;
14090 if (TREE_CODE (function
) == OFFSET_REF
)
14091 ret
= build_offset_ref_call_from_tree (function
, &call_args
,
14093 else if (TREE_CODE (function
) == COMPONENT_REF
)
14095 tree instance
= TREE_OPERAND (function
, 0);
14096 tree fn
= TREE_OPERAND (function
, 1);
14098 if (processing_template_decl
14099 && (type_dependent_expression_p (instance
)
14100 || (!BASELINK_P (fn
)
14101 && TREE_CODE (fn
) != FIELD_DECL
)
14102 || type_dependent_expression_p (fn
)
14103 || any_type_dependent_arguments_p (call_args
)))
14104 ret
= build_nt_call_vec (function
, call_args
);
14105 else if (!BASELINK_P (fn
))
14106 ret
= finish_call_expr (function
, &call_args
,
14107 /*disallow_virtual=*/false,
14108 /*koenig_p=*/false,
14111 ret
= (build_new_method_call
14113 &call_args
, NULL_TREE
,
14114 qualified_p
? LOOKUP_NONVIRTUAL
: LOOKUP_NORMAL
,
14119 ret
= finish_call_expr (function
, &call_args
,
14120 /*disallow_virtual=*/qualified_p
,
14124 release_tree_vector (call_args
);
14131 tree cond
= RECUR (TREE_OPERAND (t
, 0));
14134 if (TREE_CODE (cond
) == INTEGER_CST
)
14136 if (integer_zerop (cond
))
14138 ++c_inhibit_evaluation_warnings
;
14139 exp1
= RECUR (TREE_OPERAND (t
, 1));
14140 --c_inhibit_evaluation_warnings
;
14141 exp2
= RECUR (TREE_OPERAND (t
, 2));
14145 exp1
= RECUR (TREE_OPERAND (t
, 1));
14146 ++c_inhibit_evaluation_warnings
;
14147 exp2
= RECUR (TREE_OPERAND (t
, 2));
14148 --c_inhibit_evaluation_warnings
;
14153 exp1
= RECUR (TREE_OPERAND (t
, 1));
14154 exp2
= RECUR (TREE_OPERAND (t
, 2));
14157 RETURN (build_x_conditional_expr (EXPR_LOCATION (t
),
14158 cond
, exp1
, exp2
, complain
));
14161 case PSEUDO_DTOR_EXPR
:
14162 RETURN (finish_pseudo_destructor_expr
14163 (RECUR (TREE_OPERAND (t
, 0)),
14164 RECUR (TREE_OPERAND (t
, 1)),
14165 tsubst (TREE_OPERAND (t
, 2), args
, complain
, in_decl
)));
14169 tree purpose
, value
, chain
;
14171 if (t
== void_list_node
)
14174 if ((TREE_PURPOSE (t
) && PACK_EXPANSION_P (TREE_PURPOSE (t
)))
14175 || (TREE_VALUE (t
) && PACK_EXPANSION_P (TREE_VALUE (t
))))
14177 /* We have pack expansions, so expand those and
14178 create a new list out of it. */
14179 tree purposevec
= NULL_TREE
;
14180 tree valuevec
= NULL_TREE
;
14184 /* Expand the argument expressions. */
14185 if (TREE_PURPOSE (t
))
14186 purposevec
= tsubst_pack_expansion (TREE_PURPOSE (t
), args
,
14187 complain
, in_decl
);
14188 if (TREE_VALUE (t
))
14189 valuevec
= tsubst_pack_expansion (TREE_VALUE (t
), args
,
14190 complain
, in_decl
);
14192 /* Build the rest of the list. */
14193 chain
= TREE_CHAIN (t
);
14194 if (chain
&& chain
!= void_type_node
)
14195 chain
= RECUR (chain
);
14197 /* Determine the number of arguments. */
14198 if (purposevec
&& TREE_CODE (purposevec
) == TREE_VEC
)
14200 len
= TREE_VEC_LENGTH (purposevec
);
14201 gcc_assert (!valuevec
|| len
== TREE_VEC_LENGTH (valuevec
));
14203 else if (TREE_CODE (valuevec
) == TREE_VEC
)
14204 len
= TREE_VEC_LENGTH (valuevec
);
14207 /* Since we only performed a partial substitution into
14208 the argument pack, we only RETURN (a single list
14210 if (purposevec
== TREE_PURPOSE (t
)
14211 && valuevec
== TREE_VALUE (t
)
14212 && chain
== TREE_CHAIN (t
))
14215 RETURN (tree_cons (purposevec
, valuevec
, chain
));
14218 /* Convert the argument vectors into a TREE_LIST */
14222 /* Grab the Ith values. */
14224 purpose
= purposevec
? TREE_VEC_ELT (purposevec
, i
)
14227 = valuevec
? convert_from_reference (TREE_VEC_ELT (valuevec
, i
))
14230 /* Build the list (backwards). */
14231 chain
= tree_cons (purpose
, value
, chain
);
14237 purpose
= TREE_PURPOSE (t
);
14239 purpose
= RECUR (purpose
);
14240 value
= TREE_VALUE (t
);
14242 value
= RECUR (value
);
14243 chain
= TREE_CHAIN (t
);
14244 if (chain
&& chain
!= void_type_node
)
14245 chain
= RECUR (chain
);
14246 if (purpose
== TREE_PURPOSE (t
)
14247 && value
== TREE_VALUE (t
)
14248 && chain
== TREE_CHAIN (t
))
14250 RETURN (tree_cons (purpose
, value
, chain
));
14253 case COMPONENT_REF
:
14259 object
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
14260 args
, complain
, in_decl
);
14261 /* Remember that there was a reference to this entity. */
14262 if (DECL_P (object
))
14263 mark_used (object
);
14264 object_type
= TREE_TYPE (object
);
14266 member
= TREE_OPERAND (t
, 1);
14267 if (BASELINK_P (member
))
14268 member
= tsubst_baselink (member
,
14269 non_reference (TREE_TYPE (object
)),
14270 args
, complain
, in_decl
);
14272 member
= tsubst_copy (member
, args
, complain
, in_decl
);
14273 if (member
== error_mark_node
)
14274 RETURN (error_mark_node
);
14276 if (type_dependent_expression_p (object
))
14277 /* We can't do much here. */;
14278 else if (!CLASS_TYPE_P (object_type
))
14280 if (scalarish_type_p (object_type
))
14282 tree s
= NULL_TREE
;
14283 tree dtor
= member
;
14285 if (TREE_CODE (dtor
) == SCOPE_REF
)
14287 s
= TREE_OPERAND (dtor
, 0);
14288 dtor
= TREE_OPERAND (dtor
, 1);
14290 if (TREE_CODE (dtor
) == BIT_NOT_EXPR
)
14292 dtor
= TREE_OPERAND (dtor
, 0);
14294 RETURN (finish_pseudo_destructor_expr (object
, s
, dtor
));
14298 else if (TREE_CODE (member
) == SCOPE_REF
14299 && TREE_CODE (TREE_OPERAND (member
, 1)) == TEMPLATE_ID_EXPR
)
14301 /* Lookup the template functions now that we know what the
14303 tree scope
= TREE_OPERAND (member
, 0);
14304 tree tmpl
= TREE_OPERAND (TREE_OPERAND (member
, 1), 0);
14305 tree args
= TREE_OPERAND (TREE_OPERAND (member
, 1), 1);
14306 member
= lookup_qualified_name (scope
, tmpl
,
14307 /*is_type_p=*/false,
14308 /*complain=*/false);
14309 if (BASELINK_P (member
))
14311 BASELINK_FUNCTIONS (member
)
14312 = build_nt (TEMPLATE_ID_EXPR
, BASELINK_FUNCTIONS (member
),
14314 member
= (adjust_result_of_qualified_name_lookup
14315 (member
, BINFO_TYPE (BASELINK_BINFO (member
)),
14320 qualified_name_lookup_error (scope
, tmpl
, member
,
14322 RETURN (error_mark_node
);
14325 else if (TREE_CODE (member
) == SCOPE_REF
14326 && !CLASS_TYPE_P (TREE_OPERAND (member
, 0))
14327 && TREE_CODE (TREE_OPERAND (member
, 0)) != NAMESPACE_DECL
)
14329 if (complain
& tf_error
)
14331 if (TYPE_P (TREE_OPERAND (member
, 0)))
14332 error ("%qT is not a class or namespace",
14333 TREE_OPERAND (member
, 0));
14335 error ("%qD is not a class or namespace",
14336 TREE_OPERAND (member
, 0));
14338 RETURN (error_mark_node
);
14340 else if (TREE_CODE (member
) == FIELD_DECL
)
14341 RETURN (finish_non_static_data_member (member
, object
, NULL_TREE
));
14343 RETURN (finish_class_member_access_expr (object
, member
,
14344 /*template_p=*/false,
14349 RETURN (build_throw
14350 (RECUR (TREE_OPERAND (t
, 0))));
14354 vec
<constructor_elt
, va_gc
> *n
;
14355 constructor_elt
*ce
;
14356 unsigned HOST_WIDE_INT idx
;
14357 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14358 bool process_index_p
;
14360 bool need_copy_p
= false;
14363 if (type
== error_mark_node
)
14364 RETURN (error_mark_node
);
14366 /* digest_init will do the wrong thing if we let it. */
14367 if (type
&& TYPE_PTRMEMFUNC_P (type
))
14370 /* We do not want to process the index of aggregate
14371 initializers as they are identifier nodes which will be
14372 looked up by digest_init. */
14373 process_index_p
= !(type
&& MAYBE_CLASS_TYPE_P (type
));
14375 n
= vec_safe_copy (CONSTRUCTOR_ELTS (t
));
14376 newlen
= vec_safe_length (n
);
14377 FOR_EACH_VEC_SAFE_ELT (n
, idx
, ce
)
14379 if (ce
->index
&& process_index_p
)
14380 ce
->index
= RECUR (ce
->index
);
14382 if (PACK_EXPANSION_P (ce
->value
))
14384 /* Substitute into the pack expansion. */
14385 ce
->value
= tsubst_pack_expansion (ce
->value
, args
, complain
,
14388 if (ce
->value
== error_mark_node
14389 || PACK_EXPANSION_P (ce
->value
))
14391 else if (TREE_VEC_LENGTH (ce
->value
) == 1)
14392 /* Just move the argument into place. */
14393 ce
->value
= TREE_VEC_ELT (ce
->value
, 0);
14396 /* Update the length of the final CONSTRUCTOR
14397 arguments vector, and note that we will need to
14399 newlen
= newlen
+ TREE_VEC_LENGTH (ce
->value
) - 1;
14400 need_copy_p
= true;
14404 ce
->value
= RECUR (ce
->value
);
14409 vec
<constructor_elt
, va_gc
> *old_n
= n
;
14411 vec_alloc (n
, newlen
);
14412 FOR_EACH_VEC_ELT (*old_n
, idx
, ce
)
14414 if (TREE_CODE (ce
->value
) == TREE_VEC
)
14416 int i
, len
= TREE_VEC_LENGTH (ce
->value
);
14417 for (i
= 0; i
< len
; ++i
)
14418 CONSTRUCTOR_APPEND_ELT (n
, 0,
14419 TREE_VEC_ELT (ce
->value
, i
));
14422 CONSTRUCTOR_APPEND_ELT (n
, 0, ce
->value
);
14426 r
= build_constructor (init_list_type_node
, n
);
14427 CONSTRUCTOR_IS_DIRECT_INIT (r
) = CONSTRUCTOR_IS_DIRECT_INIT (t
);
14429 if (TREE_HAS_CONSTRUCTOR (t
))
14430 RETURN (finish_compound_literal (type
, r
, complain
));
14432 TREE_TYPE (r
) = type
;
14438 tree operand_0
= TREE_OPERAND (t
, 0);
14439 if (TYPE_P (operand_0
))
14441 operand_0
= tsubst (operand_0
, args
, complain
, in_decl
);
14442 RETURN (get_typeid (operand_0
, complain
));
14446 operand_0
= RECUR (operand_0
);
14447 RETURN (build_typeid (operand_0
, complain
));
14458 tree r
= tsubst_copy (t
, args
, complain
, in_decl
);
14460 if (TREE_CODE (TREE_TYPE (t
)) != REFERENCE_TYPE
)
14461 /* If the original type was a reference, we'll be wrapped in
14462 the appropriate INDIRECT_REF. */
14463 r
= convert_from_reference (r
);
14468 RETURN (build_x_va_arg (EXPR_LOCATION (t
),
14469 RECUR (TREE_OPERAND (t
, 0)),
14470 tsubst (TREE_TYPE (t
), args
, complain
, in_decl
)));
14472 case OFFSETOF_EXPR
:
14473 RETURN (finish_offsetof (RECUR (TREE_OPERAND (t
, 0))));
14477 tree type1
= tsubst_copy (TRAIT_EXPR_TYPE1 (t
), args
,
14478 complain
, in_decl
);
14480 tree type2
= TRAIT_EXPR_TYPE2 (t
);
14482 type2
= tsubst_copy (type2
, args
, complain
, in_decl
);
14484 RETURN (finish_trait_expr (TRAIT_EXPR_KIND (t
), type1
, type2
));
14489 tree old_stmt_expr
= cur_stmt_expr
;
14490 tree stmt_expr
= begin_stmt_expr ();
14492 cur_stmt_expr
= stmt_expr
;
14493 tsubst_expr (STMT_EXPR_STMT (t
), args
, complain
, in_decl
,
14494 integral_constant_expression_p
);
14495 stmt_expr
= finish_stmt_expr (stmt_expr
, false);
14496 cur_stmt_expr
= old_stmt_expr
;
14498 /* If the resulting list of expression statement is empty,
14499 fold it further into void_zero_node. */
14500 if (empty_expr_stmt_p (stmt_expr
))
14501 stmt_expr
= void_zero_node
;
14503 RETURN (stmt_expr
);
14508 tree r
= build_lambda_expr ();
14510 tree type
= tsubst (LAMBDA_EXPR_CLOSURE (t
), args
, complain
, NULL_TREE
);
14511 LAMBDA_EXPR_CLOSURE (r
) = type
;
14512 CLASSTYPE_LAMBDA_EXPR (type
) = r
;
14514 LAMBDA_EXPR_LOCATION (r
)
14515 = LAMBDA_EXPR_LOCATION (t
);
14516 LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (r
)
14517 = LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (t
);
14518 LAMBDA_EXPR_MUTABLE_P (r
) = LAMBDA_EXPR_MUTABLE_P (t
);
14519 LAMBDA_EXPR_DISCRIMINATOR (r
)
14520 = (LAMBDA_EXPR_DISCRIMINATOR (t
));
14521 /* For a function scope, we want to use tsubst so that we don't
14522 complain about referring to an auto function before its return
14523 type has been deduced. Otherwise, we want to use tsubst_copy so
14524 that we look up the existing field/parameter/variable rather
14525 than build a new one. */
14526 tree scope
= LAMBDA_EXPR_EXTRA_SCOPE (t
);
14527 if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
)
14528 scope
= tsubst (scope
, args
, complain
, in_decl
);
14529 else if (scope
&& TREE_CODE (scope
) == PARM_DECL
)
14531 /* Look up the parameter we want directly, as tsubst_copy
14532 doesn't do what we need. */
14533 tree fn
= tsubst (DECL_CONTEXT (scope
), args
, complain
, in_decl
);
14534 tree parm
= FUNCTION_FIRST_USER_PARM (fn
);
14535 while (DECL_PARM_INDEX (parm
) != DECL_PARM_INDEX (scope
))
14536 parm
= DECL_CHAIN (parm
);
14538 /* FIXME Work around the parm not having DECL_CONTEXT set. */
14539 if (DECL_CONTEXT (scope
) == NULL_TREE
)
14540 DECL_CONTEXT (scope
) = fn
;
14543 scope
= RECUR (scope
);
14544 LAMBDA_EXPR_EXTRA_SCOPE (r
) = scope
;
14545 LAMBDA_EXPR_RETURN_TYPE (r
)
14546 = tsubst (LAMBDA_EXPR_RETURN_TYPE (t
), args
, complain
, in_decl
);
14548 gcc_assert (LAMBDA_EXPR_THIS_CAPTURE (t
) == NULL_TREE
14549 && LAMBDA_EXPR_PENDING_PROXIES (t
) == NULL
);
14551 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
14552 determine_visibility (TYPE_NAME (type
));
14553 /* Now that we know visibility, instantiate the type so we have a
14554 declaration of the op() for later calls to lambda_function. */
14555 complete_type (type
);
14557 LAMBDA_EXPR_THIS_CAPTURE (r
) = NULL_TREE
;
14559 RETURN (build_lambda_object (r
));
14563 /* We can get here for a constant initializer of non-dependent type.
14564 FIXME stop folding in cp_parser_initializer_clause. */
14566 tree r
= get_target_expr_sfinae (RECUR (TARGET_EXPR_INITIAL (t
)),
14571 case TRANSACTION_EXPR
:
14572 RETURN (tsubst_expr(t
, args
, complain
, in_decl
,
14573 integral_constant_expression_p
));
14576 RETURN (finish_parenthesized_expr (RECUR (TREE_OPERAND (t
, 0))));
14579 /* Handle Objective-C++ constructs, if appropriate. */
14582 = objcp_tsubst_copy_and_build (t
, args
, complain
,
14583 in_decl
, /*function_p=*/false);
14587 RETURN (tsubst_copy (t
, args
, complain
, in_decl
));
14593 input_location
= loc
;
14597 /* Verify that the instantiated ARGS are valid. For type arguments,
14598 make sure that the type's linkage is ok. For non-type arguments,
14599 make sure they are constants if they are integral or enumerations.
14600 Emit an error under control of COMPLAIN, and return TRUE on error. */
14603 check_instantiated_arg (tree tmpl
, tree t
, tsubst_flags_t complain
)
14605 if (dependent_template_arg_p (t
))
14607 if (ARGUMENT_PACK_P (t
))
14609 tree vec
= ARGUMENT_PACK_ARGS (t
);
14610 int len
= TREE_VEC_LENGTH (vec
);
14611 bool result
= false;
14614 for (i
= 0; i
< len
; ++i
)
14615 if (check_instantiated_arg (tmpl
, TREE_VEC_ELT (vec
, i
), complain
))
14619 else if (TYPE_P (t
))
14621 /* [basic.link]: A name with no linkage (notably, the name
14622 of a class or enumeration declared in a local scope)
14623 shall not be used to declare an entity with linkage.
14624 This implies that names with no linkage cannot be used as
14627 DR 757 relaxes this restriction for C++0x. */
14628 tree nt
= (cxx_dialect
> cxx98
? NULL_TREE
14629 : no_linkage_check (t
, /*relaxed_p=*/false));
14633 /* DR 488 makes use of a type with no linkage cause
14634 type deduction to fail. */
14635 if (complain
& tf_error
)
14637 if (TYPE_ANONYMOUS_P (nt
))
14638 error ("%qT is/uses anonymous type", t
);
14640 error ("template argument for %qD uses local type %qT",
14645 /* In order to avoid all sorts of complications, we do not
14646 allow variably-modified types as template arguments. */
14647 else if (variably_modified_type_p (t
, NULL_TREE
))
14649 if (complain
& tf_error
)
14650 error ("%qT is a variably modified type", t
);
14654 /* Class template and alias template arguments should be OK. */
14655 else if (DECL_TYPE_TEMPLATE_P (t
))
14657 /* A non-type argument of integral or enumerated type must be a
14659 else if (TREE_TYPE (t
)
14660 && INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (t
))
14661 && !TREE_CONSTANT (t
))
14663 if (complain
& tf_error
)
14664 error ("integral expression %qE is not constant", t
);
14671 check_instantiated_args (tree tmpl
, tree args
, tsubst_flags_t complain
)
14673 int ix
, len
= DECL_NTPARMS (tmpl
);
14674 bool result
= false;
14676 for (ix
= 0; ix
!= len
; ix
++)
14678 if (check_instantiated_arg (tmpl
, TREE_VEC_ELT (args
, ix
), complain
))
14681 if (result
&& (complain
& tf_error
))
14682 error (" trying to instantiate %qD", tmpl
);
14686 /* We're out of SFINAE context now, so generate diagnostics for the access
14687 errors we saw earlier when instantiating D from TMPL and ARGS. */
14690 recheck_decl_substitution (tree d
, tree tmpl
, tree args
)
14692 tree pattern
= DECL_TEMPLATE_RESULT (tmpl
);
14693 tree type
= TREE_TYPE (pattern
);
14694 location_t loc
= input_location
;
14696 push_access_scope (d
);
14697 push_deferring_access_checks (dk_no_deferred
);
14698 input_location
= DECL_SOURCE_LOCATION (pattern
);
14699 tsubst (type
, args
, tf_warning_or_error
, d
);
14700 input_location
= loc
;
14701 pop_deferring_access_checks ();
14702 pop_access_scope (d
);
14705 /* Instantiate the indicated variable, function, or alias template TMPL with
14706 the template arguments in TARG_PTR. */
14709 instantiate_template_1 (tree tmpl
, tree orig_args
, tsubst_flags_t complain
)
14711 tree targ_ptr
= orig_args
;
14715 bool access_ok
= true;
14717 if (tmpl
== error_mark_node
)
14718 return error_mark_node
;
14720 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
);
14722 /* If this function is a clone, handle it specially. */
14723 if (DECL_CLONED_FUNCTION_P (tmpl
))
14728 /* Use DECL_ABSTRACT_ORIGIN because only FUNCTION_DECLs have
14729 DECL_CLONED_FUNCTION. */
14730 spec
= instantiate_template (DECL_ABSTRACT_ORIGIN (tmpl
),
14731 targ_ptr
, complain
);
14732 if (spec
== error_mark_node
)
14733 return error_mark_node
;
14735 /* Look for the clone. */
14736 FOR_EACH_CLONE (clone
, spec
)
14737 if (DECL_NAME (clone
) == DECL_NAME (tmpl
))
14739 /* We should always have found the clone by now. */
14740 gcc_unreachable ();
14744 /* Check to see if we already have this specialization. */
14745 gen_tmpl
= most_general_template (tmpl
);
14746 if (tmpl
!= gen_tmpl
)
14747 /* The TMPL is a partial instantiation. To get a full set of
14748 arguments we must add the arguments used to perform the
14749 partial instantiation. */
14750 targ_ptr
= add_outermost_template_args (DECL_TI_ARGS (tmpl
),
14753 /* It would be nice to avoid hashing here and then again in tsubst_decl,
14754 but it doesn't seem to be on the hot path. */
14755 spec
= retrieve_specialization (gen_tmpl
, targ_ptr
, 0);
14757 gcc_assert (tmpl
== gen_tmpl
14758 || ((fndecl
= retrieve_specialization (tmpl
, orig_args
, 0))
14760 || fndecl
== NULL_TREE
);
14762 if (spec
!= NULL_TREE
)
14764 if (FNDECL_HAS_ACCESS_ERRORS (spec
))
14766 if (complain
& tf_error
)
14767 recheck_decl_substitution (spec
, gen_tmpl
, targ_ptr
);
14768 return error_mark_node
;
14773 if (check_instantiated_args (gen_tmpl
, INNERMOST_TEMPLATE_ARGS (targ_ptr
),
14775 return error_mark_node
;
14777 /* We are building a FUNCTION_DECL, during which the access of its
14778 parameters and return types have to be checked. However this
14779 FUNCTION_DECL which is the desired context for access checking
14780 is not built yet. We solve this chicken-and-egg problem by
14781 deferring all checks until we have the FUNCTION_DECL. */
14782 push_deferring_access_checks (dk_deferred
);
14784 /* Instantiation of the function happens in the context of the function
14785 template, not the context of the overload resolution we're doing. */
14786 push_to_top_level ();
14787 /* If there are dependent arguments, e.g. because we're doing partial
14788 ordering, make sure processing_template_decl stays set. */
14789 if (uses_template_parms (targ_ptr
))
14790 ++processing_template_decl
;
14791 if (DECL_CLASS_SCOPE_P (gen_tmpl
))
14793 tree ctx
= tsubst (DECL_CONTEXT (gen_tmpl
), targ_ptr
,
14794 complain
, gen_tmpl
);
14795 push_nested_class (ctx
);
14797 /* Substitute template parameters to obtain the specialization. */
14798 fndecl
= tsubst (DECL_TEMPLATE_RESULT (gen_tmpl
),
14799 targ_ptr
, complain
, gen_tmpl
);
14800 if (DECL_CLASS_SCOPE_P (gen_tmpl
))
14801 pop_nested_class ();
14802 pop_from_top_level ();
14804 if (fndecl
== error_mark_node
)
14806 pop_deferring_access_checks ();
14807 return error_mark_node
;
14810 /* The DECL_TI_TEMPLATE should always be the immediate parent
14811 template, not the most general template. */
14812 DECL_TI_TEMPLATE (fndecl
) = tmpl
;
14814 /* Now we know the specialization, compute access previously
14816 push_access_scope (fndecl
);
14817 if (!perform_deferred_access_checks (complain
))
14819 pop_access_scope (fndecl
);
14820 pop_deferring_access_checks ();
14822 /* If we've just instantiated the main entry point for a function,
14823 instantiate all the alternate entry points as well. We do this
14824 by cloning the instantiation of the main entry point, not by
14825 instantiating the template clones. */
14826 if (DECL_CHAIN (gen_tmpl
) && DECL_CLONED_FUNCTION_P (DECL_CHAIN (gen_tmpl
)))
14827 clone_function_decl (fndecl
, /*update_method_vec_p=*/0);
14831 if (!(complain
& tf_error
))
14833 /* Remember to reinstantiate when we're out of SFINAE so the user
14834 can see the errors. */
14835 FNDECL_HAS_ACCESS_ERRORS (fndecl
) = true;
14837 return error_mark_node
;
14842 /* Wrapper for instantiate_template_1. */
14845 instantiate_template (tree tmpl
, tree orig_args
, tsubst_flags_t complain
)
14848 timevar_push (TV_TEMPLATE_INST
);
14849 ret
= instantiate_template_1 (tmpl
, orig_args
, complain
);
14850 timevar_pop (TV_TEMPLATE_INST
);
14854 /* Instantiate the alias template TMPL with ARGS. Also push a template
14855 instantiation level, which instantiate_template doesn't do because
14856 functions and variables have sufficient context established by the
14860 instantiate_alias_template (tree tmpl
, tree args
, tsubst_flags_t complain
)
14862 struct pending_template
*old_last_pend
= last_pending_template
;
14863 struct tinst_level
*old_error_tinst
= last_error_tinst_level
;
14864 if (tmpl
== error_mark_node
|| args
== error_mark_node
)
14865 return error_mark_node
;
14866 tree tinst
= build_tree_list (tmpl
, args
);
14867 if (!push_tinst_level (tinst
))
14870 return error_mark_node
;
14874 coerce_innermost_template_parms (DECL_TEMPLATE_PARMS (tmpl
),
14875 args
, tmpl
, complain
,
14876 /*require_all_args=*/true,
14877 /*use_default_args=*/true);
14879 tree r
= instantiate_template (tmpl
, args
, complain
);
14880 pop_tinst_level ();
14881 /* We can't free this if a pending_template entry or last_error_tinst_level
14882 is pointing at it. */
14883 if (last_pending_template
== old_last_pend
14884 && last_error_tinst_level
== old_error_tinst
)
14890 /* PARM is a template parameter pack for FN. Returns true iff
14891 PARM is used in a deducible way in the argument list of FN. */
14894 pack_deducible_p (tree parm
, tree fn
)
14896 tree t
= FUNCTION_FIRST_USER_PARMTYPE (fn
);
14897 for (; t
; t
= TREE_CHAIN (t
))
14899 tree type
= TREE_VALUE (t
);
14901 if (!PACK_EXPANSION_P (type
))
14903 for (packs
= PACK_EXPANSION_PARAMETER_PACKS (type
);
14904 packs
; packs
= TREE_CHAIN (packs
))
14905 if (TREE_VALUE (packs
) == parm
)
14907 /* The template parameter pack is used in a function parameter
14908 pack. If this is the end of the parameter list, the
14909 template parameter pack is deducible. */
14910 if (TREE_CHAIN (t
) == void_list_node
)
14913 /* Otherwise, not. Well, it could be deduced from
14914 a non-pack parameter, but doing so would end up with
14915 a deduction mismatch, so don't bother. */
14919 /* The template parameter pack isn't used in any function parameter
14920 packs, but it might be used deeper, e.g. tuple<Args...>. */
14924 /* The FN is a TEMPLATE_DECL for a function. ARGS is an array with
14925 NARGS elements of the arguments that are being used when calling
14926 it. TARGS is a vector into which the deduced template arguments
14929 Return zero for success, 2 for an incomplete match that doesn't resolve
14930 all the types, and 1 for complete failure. An error message will be
14931 printed only for an incomplete match.
14933 If FN is a conversion operator, or we are trying to produce a specific
14934 specialization, RETURN_TYPE is the return type desired.
14936 The EXPLICIT_TARGS are explicit template arguments provided via a
14939 The parameter STRICT is one of:
14942 We are deducing arguments for a function call, as in
14943 [temp.deduct.call].
14946 We are deducing arguments for a conversion function, as in
14947 [temp.deduct.conv].
14950 We are deducing arguments when doing an explicit instantiation
14951 as in [temp.explicit], when determining an explicit specialization
14952 as in [temp.expl.spec], or when taking the address of a function
14953 template, as in [temp.deduct.funcaddr]. */
14956 fn_type_unification (tree fn
,
14957 tree explicit_targs
,
14960 unsigned int nargs
,
14962 unification_kind_t strict
,
14969 tree decl
= NULL_TREE
;
14970 tsubst_flags_t complain
= (explain_p
? tf_warning_or_error
: tf_none
);
14972 static int deduction_depth
;
14973 struct pending_template
*old_last_pend
= last_pending_template
;
14974 struct tinst_level
*old_error_tinst
= last_error_tinst_level
;
14975 tree tparms
= DECL_INNERMOST_TEMPLATE_PARMS (fn
);
14977 tree r
= error_mark_node
;
14980 complain
|= tf_decltype
;
14982 /* In C++0x, it's possible to have a function template whose type depends
14983 on itself recursively. This is most obvious with decltype, but can also
14984 occur with enumeration scope (c++/48969). So we need to catch infinite
14985 recursion and reject the substitution at deduction time; this function
14986 will return error_mark_node for any repeated substitution.
14988 This also catches excessive recursion such as when f<N> depends on
14989 f<N-1> across all integers, and returns error_mark_node for all the
14990 substitutions back up to the initial one.
14992 This is, of course, not reentrant. */
14993 if (excessive_deduction_depth
)
14994 return error_mark_node
;
14995 tinst
= build_tree_list (fn
, NULL_TREE
);
14997 push_deferring_access_checks (dk_deferred
);
14999 gcc_assert (TREE_CODE (fn
) == TEMPLATE_DECL
);
15001 fntype
= TREE_TYPE (fn
);
15002 if (explicit_targs
)
15006 The specified template arguments must match the template
15007 parameters in kind (i.e., type, nontype, template), and there
15008 must not be more arguments than there are parameters;
15009 otherwise type deduction fails.
15011 Nontype arguments must match the types of the corresponding
15012 nontype template parameters, or must be convertible to the
15013 types of the corresponding nontype parameters as specified in
15014 _temp.arg.nontype_, otherwise type deduction fails.
15016 All references in the function type of the function template
15017 to the corresponding template parameters are replaced by the
15018 specified template argument values. If a substitution in a
15019 template parameter or in the function type of the function
15020 template results in an invalid type, type deduction fails. */
15021 int i
, len
= TREE_VEC_LENGTH (tparms
);
15022 location_t loc
= input_location
;
15023 bool incomplete
= false;
15025 /* Adjust any explicit template arguments before entering the
15026 substitution context. */
15028 = (coerce_template_parms (tparms
, explicit_targs
, NULL_TREE
,
15030 /*require_all_args=*/false,
15031 /*use_default_args=*/false));
15032 if (explicit_targs
== error_mark_node
)
15035 /* Substitute the explicit args into the function type. This is
15036 necessary so that, for instance, explicitly declared function
15037 arguments can match null pointed constants. If we were given
15038 an incomplete set of explicit args, we must not do semantic
15039 processing during substitution as we could create partial
15041 for (i
= 0; i
< len
; i
++)
15043 tree parm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
15044 bool parameter_pack
= false;
15045 tree targ
= TREE_VEC_ELT (explicit_targs
, i
);
15047 /* Dig out the actual parm. */
15048 if (TREE_CODE (parm
) == TYPE_DECL
15049 || TREE_CODE (parm
) == TEMPLATE_DECL
)
15051 parm
= TREE_TYPE (parm
);
15052 parameter_pack
= TEMPLATE_TYPE_PARAMETER_PACK (parm
);
15054 else if (TREE_CODE (parm
) == PARM_DECL
)
15056 parm
= DECL_INITIAL (parm
);
15057 parameter_pack
= TEMPLATE_PARM_PARAMETER_PACK (parm
);
15060 if (!parameter_pack
&& targ
== NULL_TREE
)
15061 /* No explicit argument for this template parameter. */
15064 if (parameter_pack
&& pack_deducible_p (parm
, fn
))
15066 /* Mark the argument pack as "incomplete". We could
15067 still deduce more arguments during unification.
15068 We remove this mark in type_unification_real. */
15071 ARGUMENT_PACK_INCOMPLETE_P(targ
) = 1;
15072 ARGUMENT_PACK_EXPLICIT_ARGS (targ
)
15073 = ARGUMENT_PACK_ARGS (targ
);
15076 /* We have some incomplete argument packs. */
15081 TREE_VALUE (tinst
) = explicit_targs
;
15082 if (!push_tinst_level (tinst
))
15084 excessive_deduction_depth
= true;
15087 processing_template_decl
+= incomplete
;
15088 input_location
= DECL_SOURCE_LOCATION (fn
);
15089 fntype
= tsubst (TREE_TYPE (fn
), explicit_targs
,
15090 complain
| tf_partial
, NULL_TREE
);
15091 input_location
= loc
;
15092 processing_template_decl
-= incomplete
;
15093 pop_tinst_level ();
15095 if (fntype
== error_mark_node
)
15098 /* Throw away these access checks; we'll see them again in
15099 instantiate_template and they might have the wrong
15100 access path at this point. */
15101 pop_deferring_access_checks ();
15102 push_deferring_access_checks (dk_deferred
);
15104 /* Place the explicitly specified arguments in TARGS. */
15105 for (i
= NUM_TMPL_ARGS (explicit_targs
); i
--;)
15106 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (explicit_targs
, i
);
15109 /* Never do unification on the 'this' parameter. */
15110 parms
= skip_artificial_parms_for (fn
, TYPE_ARG_TYPES (fntype
));
15116 parms
= tree_cons (NULL_TREE
, TREE_TYPE (fntype
), parms
);
15117 new_args
= XALLOCAVEC (tree
, nargs
+ 1);
15118 new_args
[0] = return_type
;
15119 memcpy (new_args
+ 1, args
, nargs
* sizeof (tree
));
15124 /* We allow incomplete unification without an error message here
15125 because the standard doesn't seem to explicitly prohibit it. Our
15126 callers must be ready to deal with unification failures in any
15129 TREE_VALUE (tinst
) = targs
;
15130 /* If we aren't explaining yet, push tinst context so we can see where
15131 any errors (e.g. from class instantiations triggered by instantiation
15132 of default template arguments) come from. If we are explaining, this
15133 context is redundant. */
15134 if (!explain_p
&& !push_tinst_level (tinst
))
15136 excessive_deduction_depth
= true;
15139 ok
= !type_unification_real (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
15140 targs
, parms
, args
, nargs
, /*subr=*/0,
15141 strict
, flags
, explain_p
);
15143 pop_tinst_level ();
15147 /* Now that we have bindings for all of the template arguments,
15148 ensure that the arguments deduced for the template template
15149 parameters have compatible template parameter lists. We cannot
15150 check this property before we have deduced all template
15151 arguments, because the template parameter types of a template
15152 template parameter might depend on prior template parameters
15153 deduced after the template template parameter. The following
15154 ill-formed example illustrates this issue:
15156 template<typename T, template<T> class C> void f(C<5>, T);
15158 template<int N> struct X {};
15161 f(X<5>(), 5l); // error: template argument deduction fails
15164 The template parameter list of 'C' depends on the template type
15165 parameter 'T', but 'C' is deduced to 'X' before 'T' is deduced to
15166 'long'. Thus, we can't check that 'C' cannot bind to 'X' at the
15167 time that we deduce 'C'. */
15168 if (!template_template_parm_bindings_ok_p
15169 (DECL_INNERMOST_TEMPLATE_PARMS (fn
), targs
))
15171 unify_inconsistent_template_template_parameters (explain_p
);
15175 /* All is well so far. Now, check:
15179 When all template arguments have been deduced, all uses of
15180 template parameters in nondeduced contexts are replaced with
15181 the corresponding deduced argument values. If the
15182 substitution results in an invalid type, as described above,
15183 type deduction fails. */
15184 TREE_VALUE (tinst
) = targs
;
15185 if (!push_tinst_level (tinst
))
15187 excessive_deduction_depth
= true;
15190 decl
= instantiate_template (fn
, targs
, complain
);
15191 pop_tinst_level ();
15193 if (decl
== error_mark_node
)
15196 /* Now perform any access checks encountered during deduction, such as
15197 for default template arguments. */
15198 push_access_scope (decl
);
15199 ok
= perform_deferred_access_checks (complain
);
15200 pop_access_scope (decl
);
15204 /* If we're looking for an exact match, check that what we got
15205 is indeed an exact match. It might not be if some template
15206 parameters are used in non-deduced contexts. */
15207 if (strict
== DEDUCE_EXACT
)
15209 tree substed
= TREE_TYPE (decl
);
15213 = skip_artificial_parms_for (decl
, TYPE_ARG_TYPES (substed
));
15215 sarg
= tree_cons (NULL_TREE
, TREE_TYPE (substed
), sarg
);
15216 for (i
= 0; i
< nargs
&& sarg
; ++i
, sarg
= TREE_CHAIN (sarg
))
15217 if (!same_type_p (args
[i
], TREE_VALUE (sarg
)))
15219 unify_type_mismatch (explain_p
, args
[i
],
15220 TREE_VALUE (sarg
));
15228 pop_deferring_access_checks ();
15230 if (excessive_deduction_depth
)
15232 if (deduction_depth
== 0)
15233 /* Reset once we're all the way out. */
15234 excessive_deduction_depth
= false;
15237 /* We can't free this if a pending_template entry or last_error_tinst_level
15238 is pointing at it. */
15239 if (last_pending_template
== old_last_pend
15240 && last_error_tinst_level
== old_error_tinst
)
15246 /* Adjust types before performing type deduction, as described in
15247 [temp.deduct.call] and [temp.deduct.conv]. The rules in these two
15248 sections are symmetric. PARM is the type of a function parameter
15249 or the return type of the conversion function. ARG is the type of
15250 the argument passed to the call, or the type of the value
15251 initialized with the result of the conversion function.
15252 ARG_EXPR is the original argument expression, which may be null. */
15255 maybe_adjust_types_for_deduction (unification_kind_t strict
,
15269 /* Swap PARM and ARG throughout the remainder of this
15270 function; the handling is precisely symmetric since PARM
15271 will initialize ARG rather than vice versa. */
15279 /* Core issue #873: Do the DR606 thing (see below) for these cases,
15280 too, but here handle it by stripping the reference from PARM
15281 rather than by adding it to ARG. */
15282 if (TREE_CODE (*parm
) == REFERENCE_TYPE
15283 && TYPE_REF_IS_RVALUE (*parm
)
15284 && TREE_CODE (TREE_TYPE (*parm
)) == TEMPLATE_TYPE_PARM
15285 && cp_type_quals (TREE_TYPE (*parm
)) == TYPE_UNQUALIFIED
15286 && TREE_CODE (*arg
) == REFERENCE_TYPE
15287 && !TYPE_REF_IS_RVALUE (*arg
))
15288 *parm
= TREE_TYPE (*parm
);
15289 /* Nothing else to do in this case. */
15293 gcc_unreachable ();
15296 if (TREE_CODE (*parm
) != REFERENCE_TYPE
)
15298 /* [temp.deduct.call]
15300 If P is not a reference type:
15302 --If A is an array type, the pointer type produced by the
15303 array-to-pointer standard conversion (_conv.array_) is
15304 used in place of A for type deduction; otherwise,
15306 --If A is a function type, the pointer type produced by
15307 the function-to-pointer standard conversion
15308 (_conv.func_) is used in place of A for type deduction;
15311 --If A is a cv-qualified type, the top level
15312 cv-qualifiers of A's type are ignored for type
15314 if (TREE_CODE (*arg
) == ARRAY_TYPE
)
15315 *arg
= build_pointer_type (TREE_TYPE (*arg
));
15316 else if (TREE_CODE (*arg
) == FUNCTION_TYPE
)
15317 *arg
= build_pointer_type (*arg
);
15319 *arg
= TYPE_MAIN_VARIANT (*arg
);
15322 /* From C++0x [14.8.2.1/3 temp.deduct.call] (after DR606), "If P is
15323 of the form T&&, where T is a template parameter, and the argument
15324 is an lvalue, T is deduced as A& */
15325 if (TREE_CODE (*parm
) == REFERENCE_TYPE
15326 && TYPE_REF_IS_RVALUE (*parm
)
15327 && TREE_CODE (TREE_TYPE (*parm
)) == TEMPLATE_TYPE_PARM
15328 && cp_type_quals (TREE_TYPE (*parm
)) == TYPE_UNQUALIFIED
15329 && (arg_expr
? real_lvalue_p (arg_expr
)
15330 /* try_one_overload doesn't provide an arg_expr, but
15331 functions are always lvalues. */
15332 : TREE_CODE (*arg
) == FUNCTION_TYPE
))
15333 *arg
= build_reference_type (*arg
);
15335 /* [temp.deduct.call]
15337 If P is a cv-qualified type, the top level cv-qualifiers
15338 of P's type are ignored for type deduction. If P is a
15339 reference type, the type referred to by P is used for
15341 *parm
= TYPE_MAIN_VARIANT (*parm
);
15342 if (TREE_CODE (*parm
) == REFERENCE_TYPE
)
15344 *parm
= TREE_TYPE (*parm
);
15345 result
|= UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
15348 /* DR 322. For conversion deduction, remove a reference type on parm
15349 too (which has been swapped into ARG). */
15350 if (strict
== DEDUCE_CONV
&& TREE_CODE (*arg
) == REFERENCE_TYPE
)
15351 *arg
= TREE_TYPE (*arg
);
15356 /* Subroutine of unify_one_argument. PARM is a function parameter of a
15357 template which does contain any deducible template parameters; check if
15358 ARG is a suitable match for it. STRICT, FLAGS and EXPLAIN_P are as in
15359 unify_one_argument. */
15362 check_non_deducible_conversion (tree parm
, tree arg
, int strict
,
15363 int flags
, bool explain_p
)
15368 type
= TREE_TYPE (arg
);
15372 if (same_type_p (parm
, type
))
15373 return unify_success (explain_p
);
15375 if (strict
== DEDUCE_CONV
)
15377 if (can_convert_arg (type
, parm
, NULL_TREE
, flags
,
15378 explain_p
? tf_warning_or_error
: tf_none
))
15379 return unify_success (explain_p
);
15381 else if (strict
!= DEDUCE_EXACT
)
15383 if (can_convert_arg (parm
, type
,
15384 TYPE_P (arg
) ? NULL_TREE
: arg
,
15385 flags
, explain_p
? tf_warning_or_error
: tf_none
))
15386 return unify_success (explain_p
);
15389 if (strict
== DEDUCE_EXACT
)
15390 return unify_type_mismatch (explain_p
, parm
, arg
);
15392 return unify_arg_conversion (explain_p
, parm
, type
, arg
);
15395 static bool uses_deducible_template_parms (tree type
);
15397 /* Returns true iff the expression EXPR is one from which a template
15398 argument can be deduced. In other words, if it's an undecorated
15399 use of a template non-type parameter. */
15402 deducible_expression (tree expr
)
15404 return (TREE_CODE (expr
) == TEMPLATE_PARM_INDEX
);
15407 /* Returns true iff the array domain DOMAIN uses a template parameter in a
15408 deducible way; that is, if it has a max value of <PARM> - 1. */
15411 deducible_array_bound (tree domain
)
15413 if (domain
== NULL_TREE
)
15416 tree max
= TYPE_MAX_VALUE (domain
);
15417 if (TREE_CODE (max
) != MINUS_EXPR
)
15420 return deducible_expression (TREE_OPERAND (max
, 0));
15423 /* Returns true iff the template arguments ARGS use a template parameter
15424 in a deducible way. */
15427 deducible_template_args (tree args
)
15429 for (int i
= 0; i
< TREE_VEC_LENGTH (args
); ++i
)
15432 tree elt
= TREE_VEC_ELT (args
, i
);
15433 if (ARGUMENT_PACK_P (elt
))
15434 deducible
= deducible_template_args (ARGUMENT_PACK_ARGS (elt
));
15437 if (PACK_EXPANSION_P (elt
))
15438 elt
= PACK_EXPANSION_PATTERN (elt
);
15439 if (TREE_CODE (elt
) == TEMPLATE_TEMPLATE_PARM
)
15441 else if (TYPE_P (elt
))
15442 deducible
= uses_deducible_template_parms (elt
);
15444 deducible
= deducible_expression (elt
);
15452 /* Returns true iff TYPE contains any deducible references to template
15453 parameters, as per 14.8.2.5. */
15456 uses_deducible_template_parms (tree type
)
15458 if (PACK_EXPANSION_P (type
))
15459 type
= PACK_EXPANSION_PATTERN (type
);
15466 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
15467 || TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
15473 if (POINTER_TYPE_P (type
))
15474 return uses_deducible_template_parms (TREE_TYPE (type
));
15476 /* T[integer-constant ]
15478 if (TREE_CODE (type
) == ARRAY_TYPE
)
15479 return (uses_deducible_template_parms (TREE_TYPE (type
))
15480 || deducible_array_bound (TYPE_DOMAIN (type
)));
15492 if (TYPE_PTRMEM_P (type
))
15493 return (uses_deducible_template_parms (TYPE_PTRMEM_CLASS_TYPE (type
))
15494 || (uses_deducible_template_parms
15495 (TYPE_PTRMEM_POINTED_TO_TYPE (type
))));
15497 /* template-name <T> (where template-name refers to a class template)
15498 template-name <i> (where template-name refers to a class template) */
15499 if (CLASS_TYPE_P (type
)
15500 && CLASSTYPE_TEMPLATE_INFO (type
)
15501 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (type
)))
15502 return deducible_template_args (INNERMOST_TEMPLATE_ARGS
15503 (CLASSTYPE_TI_ARGS (type
)));
15508 if (TREE_CODE (type
) == FUNCTION_TYPE
15509 || TREE_CODE (type
) == METHOD_TYPE
)
15511 if (uses_deducible_template_parms (TREE_TYPE (type
)))
15513 tree parm
= TYPE_ARG_TYPES (type
);
15514 if (TREE_CODE (type
) == METHOD_TYPE
)
15515 parm
= TREE_CHAIN (parm
);
15516 for (; parm
; parm
= TREE_CHAIN (parm
))
15517 if (uses_deducible_template_parms (TREE_VALUE (parm
)))
15524 /* Subroutine of type_unification_real and unify_pack_expansion to
15525 handle unification of a single P/A pair. Parameters are as
15526 for those functions. */
15529 unify_one_argument (tree tparms
, tree targs
, tree parm
, tree arg
,
15530 int subr
, unification_kind_t strict
, int flags
,
15533 tree arg_expr
= NULL_TREE
;
15536 if (arg
== error_mark_node
|| parm
== error_mark_node
)
15537 return unify_invalid (explain_p
);
15538 if (arg
== unknown_type_node
)
15539 /* We can't deduce anything from this, but we might get all the
15540 template args from other function args. */
15541 return unify_success (explain_p
);
15543 /* Implicit conversions (Clause 4) will be performed on a function
15544 argument to convert it to the type of the corresponding function
15545 parameter if the parameter type contains no template-parameters that
15546 participate in template argument deduction. */
15547 if (TYPE_P (parm
) && !uses_template_parms (parm
))
15548 /* For function parameters that contain no template-parameters at all,
15549 we have historically checked for convertibility in order to shortcut
15550 consideration of this candidate. */
15551 return check_non_deducible_conversion (parm
, arg
, strict
, flags
,
15553 else if (strict
== DEDUCE_CALL
15554 && TYPE_P (parm
) && !uses_deducible_template_parms (parm
))
15555 /* For function parameters with only non-deducible template parameters,
15557 return unify_success (explain_p
);
15562 arg_strict
= (UNIFY_ALLOW_OUTER_LEVEL
15563 | UNIFY_ALLOW_MORE_CV_QUAL
15564 | UNIFY_ALLOW_DERIVED
);
15568 arg_strict
= UNIFY_ALLOW_LESS_CV_QUAL
;
15572 arg_strict
= UNIFY_ALLOW_NONE
;
15576 gcc_unreachable ();
15579 /* We only do these transformations if this is the top-level
15580 parameter_type_list in a call or declaration matching; in other
15581 situations (nested function declarators, template argument lists) we
15582 won't be comparing a type to an expression, and we don't do any type
15588 gcc_assert (TREE_TYPE (arg
) != NULL_TREE
);
15589 if (type_unknown_p (arg
))
15591 /* [temp.deduct.type] A template-argument can be
15592 deduced from a pointer to function or pointer
15593 to member function argument if the set of
15594 overloaded functions does not contain function
15595 templates and at most one of a set of
15596 overloaded functions provides a unique
15599 if (resolve_overloaded_unification
15600 (tparms
, targs
, parm
, arg
, strict
,
15601 arg_strict
, explain_p
))
15602 return unify_success (explain_p
);
15603 return unify_overload_resolution_failure (explain_p
, arg
);
15607 arg
= unlowered_expr_type (arg
);
15608 if (arg
== error_mark_node
)
15609 return unify_invalid (explain_p
);
15613 maybe_adjust_types_for_deduction (strict
, &parm
, &arg
, arg_expr
);
15616 gcc_assert ((TYPE_P (parm
) || TREE_CODE (parm
) == TEMPLATE_DECL
)
15617 == (TYPE_P (arg
) || TREE_CODE (arg
) == TEMPLATE_DECL
));
15619 /* For deduction from an init-list we need the actual list. */
15620 if (arg_expr
&& BRACE_ENCLOSED_INITIALIZER_P (arg_expr
))
15622 return unify (tparms
, targs
, parm
, arg
, arg_strict
, explain_p
);
15625 /* Most parms like fn_type_unification.
15627 If SUBR is 1, we're being called recursively (to unify the
15628 arguments of a function or method parameter of a function
15632 type_unification_real (tree tparms
,
15636 unsigned int xnargs
,
15638 unification_kind_t strict
,
15644 int ntparms
= TREE_VEC_LENGTH (tparms
);
15645 int saw_undeduced
= 0;
15648 unsigned int nargs
;
15651 gcc_assert (TREE_CODE (tparms
) == TREE_VEC
);
15652 gcc_assert (xparms
== NULL_TREE
|| TREE_CODE (xparms
) == TREE_LIST
);
15653 gcc_assert (ntparms
> 0);
15655 /* Reset the number of non-defaulted template arguments contained
15657 NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
) = NULL_TREE
;
15665 while (parms
&& parms
!= void_list_node
15668 parm
= TREE_VALUE (parms
);
15670 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
15671 && (!TREE_CHAIN (parms
) || TREE_CHAIN (parms
) == void_list_node
))
15672 /* For a function parameter pack that occurs at the end of the
15673 parameter-declaration-list, the type A of each remaining
15674 argument of the call is compared with the type P of the
15675 declarator-id of the function parameter pack. */
15678 parms
= TREE_CHAIN (parms
);
15680 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
)
15681 /* For a function parameter pack that does not occur at the
15682 end of the parameter-declaration-list, the type of the
15683 parameter pack is a non-deduced context. */
15689 if (unify_one_argument (tparms
, targs
, parm
, arg
, subr
, strict
,
15695 && parms
!= void_list_node
15696 && TREE_CODE (TREE_VALUE (parms
)) == TYPE_PACK_EXPANSION
)
15698 /* Unify the remaining arguments with the pack expansion type. */
15700 tree parmvec
= make_tree_vec (1);
15702 /* Allocate a TREE_VEC and copy in all of the arguments */
15703 argvec
= make_tree_vec (nargs
- ia
);
15704 for (i
= 0; ia
< nargs
; ++ia
, ++i
)
15705 TREE_VEC_ELT (argvec
, i
) = args
[ia
];
15707 /* Copy the parameter into parmvec. */
15708 TREE_VEC_ELT (parmvec
, 0) = TREE_VALUE (parms
);
15709 if (unify_pack_expansion (tparms
, targs
, parmvec
, argvec
, strict
,
15710 /*subr=*/subr
, explain_p
))
15713 /* Advance to the end of the list of parameters. */
15714 parms
= TREE_CHAIN (parms
);
15717 /* Fail if we've reached the end of the parm list, and more args
15718 are present, and the parm list isn't variadic. */
15719 if (ia
< nargs
&& parms
== void_list_node
)
15720 return unify_too_many_arguments (explain_p
, nargs
, ia
);
15721 /* Fail if parms are left and they don't have default values. */
15722 if (parms
&& parms
!= void_list_node
15723 && TREE_PURPOSE (parms
) == NULL_TREE
)
15725 unsigned int count
= nargs
;
15727 while (p
&& p
!= void_list_node
)
15730 p
= TREE_CHAIN (p
);
15732 return unify_too_few_arguments (explain_p
, ia
, count
);
15737 tsubst_flags_t complain
= (explain_p
15738 ? tf_warning_or_error
15741 for (i
= 0; i
< ntparms
; i
++)
15743 tree targ
= TREE_VEC_ELT (targs
, i
);
15744 tree tparm
= TREE_VEC_ELT (tparms
, i
);
15746 /* Clear the "incomplete" flags on all argument packs now so that
15747 substituting them into later default arguments works. */
15748 if (targ
&& ARGUMENT_PACK_P (targ
))
15750 ARGUMENT_PACK_INCOMPLETE_P (targ
) = 0;
15751 ARGUMENT_PACK_EXPLICIT_ARGS (targ
) = NULL_TREE
;
15754 if (targ
|| tparm
== error_mark_node
)
15756 tparm
= TREE_VALUE (tparm
);
15758 /* If this is an undeduced nontype parameter that depends on
15759 a type parameter, try another pass; its type may have been
15760 deduced from a later argument than the one from which
15761 this parameter can be deduced. */
15762 if (TREE_CODE (tparm
) == PARM_DECL
15763 && uses_template_parms (TREE_TYPE (tparm
))
15764 && !saw_undeduced
++)
15767 /* Core issue #226 (C++0x) [temp.deduct]:
15769 If a template argument has not been deduced, its
15770 default template argument, if any, is used.
15772 When we are in C++98 mode, TREE_PURPOSE will either
15773 be NULL_TREE or ERROR_MARK_NODE, so we do not need
15774 to explicitly check cxx_dialect here. */
15775 if (TREE_PURPOSE (TREE_VEC_ELT (tparms
, i
)))
15777 tree parm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
15778 tree arg
= TREE_PURPOSE (TREE_VEC_ELT (tparms
, i
));
15779 location_t save_loc
= input_location
;
15781 input_location
= DECL_SOURCE_LOCATION (parm
);
15782 arg
= tsubst_template_arg (arg
, targs
, complain
, NULL_TREE
);
15783 arg
= convert_template_argument (parm
, arg
, targs
, complain
,
15785 input_location
= save_loc
;
15786 if (arg
== error_mark_node
)
15790 TREE_VEC_ELT (targs
, i
) = arg
;
15791 /* The position of the first default template argument,
15792 is also the number of non-defaulted arguments in TARGS.
15794 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
))
15795 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
, i
);
15800 /* If the type parameter is a parameter pack, then it will
15801 be deduced to an empty parameter pack. */
15802 if (template_parameter_pack_p (tparm
))
15806 if (TREE_CODE (tparm
) == TEMPLATE_PARM_INDEX
)
15808 arg
= make_node (NONTYPE_ARGUMENT_PACK
);
15809 TREE_TYPE (arg
) = TREE_TYPE (TEMPLATE_PARM_DECL (tparm
));
15810 TREE_CONSTANT (arg
) = 1;
15813 arg
= cxx_make_type (TYPE_ARGUMENT_PACK
);
15815 SET_ARGUMENT_PACK_ARGS (arg
, make_tree_vec (0));
15817 TREE_VEC_ELT (targs
, i
) = arg
;
15821 return unify_parameter_deduction_failure (explain_p
, tparm
);
15824 #ifdef ENABLE_CHECKING
15825 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
))
15826 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
, TREE_VEC_LENGTH (targs
));
15829 return unify_success (explain_p
);
15832 /* Subroutine of type_unification_real. Args are like the variables
15833 at the call site. ARG is an overloaded function (or template-id);
15834 we try deducing template args from each of the overloads, and if
15835 only one succeeds, we go with that. Modifies TARGS and returns
15836 true on success. */
15839 resolve_overloaded_unification (tree tparms
,
15843 unification_kind_t strict
,
15847 tree tempargs
= copy_node (targs
);
15849 tree goodfn
= NULL_TREE
;
15852 if (TREE_CODE (arg
) == ADDR_EXPR
)
15854 arg
= TREE_OPERAND (arg
, 0);
15860 if (TREE_CODE (arg
) == COMPONENT_REF
)
15861 /* Handle `&x' where `x' is some static or non-static member
15863 arg
= TREE_OPERAND (arg
, 1);
15865 if (TREE_CODE (arg
) == OFFSET_REF
)
15866 arg
= TREE_OPERAND (arg
, 1);
15868 /* Strip baselink information. */
15869 if (BASELINK_P (arg
))
15870 arg
= BASELINK_FUNCTIONS (arg
);
15872 if (TREE_CODE (arg
) == TEMPLATE_ID_EXPR
)
15874 /* If we got some explicit template args, we need to plug them into
15875 the affected templates before we try to unify, in case the
15876 explicit args will completely resolve the templates in question. */
15879 tree expl_subargs
= TREE_OPERAND (arg
, 1);
15880 arg
= TREE_OPERAND (arg
, 0);
15882 for (; arg
; arg
= OVL_NEXT (arg
))
15884 tree fn
= OVL_CURRENT (arg
);
15885 tree subargs
, elem
;
15887 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
15890 subargs
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
15891 expl_subargs
, NULL_TREE
, tf_none
,
15892 /*require_all_args=*/true,
15893 /*use_default_args=*/true);
15894 if (subargs
!= error_mark_node
15895 && !any_dependent_template_arguments_p (subargs
))
15897 elem
= tsubst (TREE_TYPE (fn
), subargs
, tf_none
, NULL_TREE
);
15898 if (try_one_overload (tparms
, targs
, tempargs
, parm
,
15899 elem
, strict
, sub_strict
, addr_p
, explain_p
)
15900 && (!goodfn
|| !same_type_p (goodfn
, elem
)))
15909 /* If no templates (or more than one) are fully resolved by the
15910 explicit arguments, this template-id is a non-deduced context; it
15911 could still be OK if we deduce all template arguments for the
15912 enclosing call through other arguments. */
15916 else if (TREE_CODE (arg
) != OVERLOAD
15917 && TREE_CODE (arg
) != FUNCTION_DECL
)
15918 /* If ARG is, for example, "(0, &f)" then its type will be unknown
15919 -- but the deduction does not succeed because the expression is
15920 not just the function on its own. */
15923 for (; arg
; arg
= OVL_NEXT (arg
))
15924 if (try_one_overload (tparms
, targs
, tempargs
, parm
,
15925 TREE_TYPE (OVL_CURRENT (arg
)),
15926 strict
, sub_strict
, addr_p
, explain_p
)
15927 && (!goodfn
|| !decls_match (goodfn
, OVL_CURRENT (arg
))))
15929 goodfn
= OVL_CURRENT (arg
);
15933 /* [temp.deduct.type] A template-argument can be deduced from a pointer
15934 to function or pointer to member function argument if the set of
15935 overloaded functions does not contain function templates and at most
15936 one of a set of overloaded functions provides a unique match.
15938 So if we found multiple possibilities, we return success but don't
15939 deduce anything. */
15943 int i
= TREE_VEC_LENGTH (targs
);
15945 if (TREE_VEC_ELT (tempargs
, i
))
15946 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (tempargs
, i
);
15954 /* Core DR 115: In contexts where deduction is done and fails, or in
15955 contexts where deduction is not done, if a template argument list is
15956 specified and it, along with any default template arguments, identifies
15957 a single function template specialization, then the template-id is an
15958 lvalue for the function template specialization. */
15961 resolve_nondeduced_context (tree orig_expr
)
15963 tree expr
, offset
, baselink
;
15966 if (!type_unknown_p (orig_expr
))
15971 offset
= NULL_TREE
;
15972 baselink
= NULL_TREE
;
15974 if (TREE_CODE (expr
) == ADDR_EXPR
)
15976 expr
= TREE_OPERAND (expr
, 0);
15979 if (TREE_CODE (expr
) == OFFSET_REF
)
15982 expr
= TREE_OPERAND (expr
, 1);
15984 if (BASELINK_P (expr
))
15987 expr
= BASELINK_FUNCTIONS (expr
);
15990 if (TREE_CODE (expr
) == TEMPLATE_ID_EXPR
)
15993 tree goodfn
= NULL_TREE
;
15995 /* If we got some explicit template args, we need to plug them into
15996 the affected templates before we try to unify, in case the
15997 explicit args will completely resolve the templates in question. */
15999 tree expl_subargs
= TREE_OPERAND (expr
, 1);
16000 tree arg
= TREE_OPERAND (expr
, 0);
16001 tree badfn
= NULL_TREE
;
16002 tree badargs
= NULL_TREE
;
16004 for (; arg
; arg
= OVL_NEXT (arg
))
16006 tree fn
= OVL_CURRENT (arg
);
16007 tree subargs
, elem
;
16009 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
16012 subargs
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
16013 expl_subargs
, NULL_TREE
, tf_none
,
16014 /*require_all_args=*/true,
16015 /*use_default_args=*/true);
16016 if (subargs
!= error_mark_node
16017 && !any_dependent_template_arguments_p (subargs
))
16019 elem
= instantiate_template (fn
, subargs
, tf_none
);
16020 if (elem
== error_mark_node
)
16025 else if (elem
&& (!goodfn
|| !decls_match (goodfn
, elem
)))
16034 mark_used (goodfn
);
16037 expr
= build_baselink (BASELINK_BINFO (baselink
),
16038 BASELINK_ACCESS_BINFO (baselink
),
16039 expr
, BASELINK_OPTYPE (baselink
));
16043 = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (offset
, 0)));
16044 expr
= build_offset_ref (base
, expr
, addr
, tf_warning_or_error
);
16047 expr
= cp_build_addr_expr (expr
, tf_warning_or_error
);
16050 else if (good
== 0 && badargs
)
16051 /* There were no good options and at least one bad one, so let the
16052 user know what the problem is. */
16053 instantiate_template (badfn
, badargs
, tf_warning_or_error
);
16058 /* Subroutine of resolve_overloaded_unification; does deduction for a single
16059 overload. Fills TARGS with any deduced arguments, or error_mark_node if
16060 different overloads deduce different arguments for a given parm.
16061 ADDR_P is true if the expression for which deduction is being
16062 performed was of the form "& fn" rather than simply "fn".
16064 Returns 1 on success. */
16067 try_one_overload (tree tparms
,
16072 unification_kind_t strict
,
16081 if (arg
== error_mark_node
)
16084 /* [temp.deduct.type] A template-argument can be deduced from a pointer
16085 to function or pointer to member function argument if the set of
16086 overloaded functions does not contain function templates and at most
16087 one of a set of overloaded functions provides a unique match.
16089 So if this is a template, just return success. */
16091 if (uses_template_parms (arg
))
16094 if (TREE_CODE (arg
) == METHOD_TYPE
)
16095 arg
= build_ptrmemfunc_type (build_pointer_type (arg
));
16097 arg
= build_pointer_type (arg
);
16099 sub_strict
|= maybe_adjust_types_for_deduction (strict
, &parm
, &arg
, NULL
);
16101 /* We don't copy orig_targs for this because if we have already deduced
16102 some template args from previous args, unify would complain when we
16103 try to deduce a template parameter for the same argument, even though
16104 there isn't really a conflict. */
16105 nargs
= TREE_VEC_LENGTH (targs
);
16106 tempargs
= make_tree_vec (nargs
);
16108 if (unify (tparms
, tempargs
, parm
, arg
, sub_strict
, explain_p
))
16111 /* First make sure we didn't deduce anything that conflicts with
16112 explicitly specified args. */
16113 for (i
= nargs
; i
--; )
16115 tree elt
= TREE_VEC_ELT (tempargs
, i
);
16116 tree oldelt
= TREE_VEC_ELT (orig_targs
, i
);
16120 else if (uses_template_parms (elt
))
16121 /* Since we're unifying against ourselves, we will fill in
16122 template args used in the function parm list with our own
16123 template parms. Discard them. */
16124 TREE_VEC_ELT (tempargs
, i
) = NULL_TREE
;
16125 else if (oldelt
&& !template_args_equal (oldelt
, elt
))
16129 for (i
= nargs
; i
--; )
16131 tree elt
= TREE_VEC_ELT (tempargs
, i
);
16134 TREE_VEC_ELT (targs
, i
) = elt
;
16140 /* PARM is a template class (perhaps with unbound template
16141 parameters). ARG is a fully instantiated type. If ARG can be
16142 bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and
16143 TARGS are as for unify. */
16146 try_class_unification (tree tparms
, tree targs
, tree parm
, tree arg
,
16149 tree copy_of_targs
;
16151 if (!CLASSTYPE_TEMPLATE_INFO (arg
)
16152 || (most_general_template (CLASSTYPE_TI_TEMPLATE (arg
))
16153 != most_general_template (CLASSTYPE_TI_TEMPLATE (parm
))))
16156 /* We need to make a new template argument vector for the call to
16157 unify. If we used TARGS, we'd clutter it up with the result of
16158 the attempted unification, even if this class didn't work out.
16159 We also don't want to commit ourselves to all the unifications
16160 we've already done, since unification is supposed to be done on
16161 an argument-by-argument basis. In other words, consider the
16162 following pathological case:
16164 template <int I, int J, int K>
16167 template <int I, int J>
16168 struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {};
16170 template <int I, int J, int K>
16171 void f(S<I, J, K>, S<I, I, I>);
16180 Now, by the time we consider the unification involving `s2', we
16181 already know that we must have `f<0, 0, 0>'. But, even though
16182 `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is invalid
16183 because there are two ways to unify base classes of S<0, 1, 2>
16184 with S<I, I, I>. If we kept the already deduced knowledge, we
16185 would reject the possibility I=1. */
16186 copy_of_targs
= make_tree_vec (TREE_VEC_LENGTH (targs
));
16188 /* If unification failed, we're done. */
16189 if (unify (tparms
, copy_of_targs
, CLASSTYPE_TI_ARGS (parm
),
16190 CLASSTYPE_TI_ARGS (arg
), UNIFY_ALLOW_NONE
, explain_p
))
16196 /* Given a template type PARM and a class type ARG, find the unique
16197 base type in ARG that is an instance of PARM. We do not examine
16198 ARG itself; only its base-classes. If there is not exactly one
16199 appropriate base class, return NULL_TREE. PARM may be the type of
16200 a partial specialization, as well as a plain template type. Used
16203 static enum template_base_result
16204 get_template_base (tree tparms
, tree targs
, tree parm
, tree arg
,
16205 bool explain_p
, tree
*result
)
16207 tree rval
= NULL_TREE
;
16210 gcc_assert (RECORD_OR_UNION_CODE_P (TREE_CODE (arg
)));
16212 binfo
= TYPE_BINFO (complete_type (arg
));
16215 /* The type could not be completed. */
16216 *result
= NULL_TREE
;
16217 return tbr_incomplete_type
;
16220 /* Walk in inheritance graph order. The search order is not
16221 important, and this avoids multiple walks of virtual bases. */
16222 for (binfo
= TREE_CHAIN (binfo
); binfo
; binfo
= TREE_CHAIN (binfo
))
16224 tree r
= try_class_unification (tparms
, targs
, parm
,
16225 BINFO_TYPE (binfo
), explain_p
);
16229 /* If there is more than one satisfactory baseclass, then:
16233 If they yield more than one possible deduced A, the type
16237 if (rval
&& !same_type_p (r
, rval
))
16239 *result
= NULL_TREE
;
16240 return tbr_ambiguous_baseclass
;
16248 return tbr_success
;
16251 /* Returns the level of DECL, which declares a template parameter. */
16254 template_decl_level (tree decl
)
16256 switch (TREE_CODE (decl
))
16259 case TEMPLATE_DECL
:
16260 return TEMPLATE_TYPE_LEVEL (TREE_TYPE (decl
));
16263 return TEMPLATE_PARM_LEVEL (DECL_INITIAL (decl
));
16266 gcc_unreachable ();
16271 /* Decide whether ARG can be unified with PARM, considering only the
16272 cv-qualifiers of each type, given STRICT as documented for unify.
16273 Returns nonzero iff the unification is OK on that basis. */
16276 check_cv_quals_for_unify (int strict
, tree arg
, tree parm
)
16278 int arg_quals
= cp_type_quals (arg
);
16279 int parm_quals
= cp_type_quals (parm
);
16281 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
16282 && !(strict
& UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
16284 /* Although a CVR qualifier is ignored when being applied to a
16285 substituted template parameter ([8.3.2]/1 for example), that
16286 does not allow us to unify "const T" with "int&" because both
16287 types are not of the form "cv-list T" [14.8.2.5 temp.deduct.type].
16288 It is ok when we're allowing additional CV qualifiers
16289 at the outer level [14.8.2.1]/3,1st bullet. */
16290 if ((TREE_CODE (arg
) == REFERENCE_TYPE
16291 || TREE_CODE (arg
) == FUNCTION_TYPE
16292 || TREE_CODE (arg
) == METHOD_TYPE
)
16293 && (parm_quals
& (TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
)))
16296 if ((!POINTER_TYPE_P (arg
) && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
)
16297 && (parm_quals
& TYPE_QUAL_RESTRICT
))
16301 if (!(strict
& (UNIFY_ALLOW_MORE_CV_QUAL
| UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
16302 && (arg_quals
& parm_quals
) != parm_quals
)
16305 if (!(strict
& (UNIFY_ALLOW_LESS_CV_QUAL
| UNIFY_ALLOW_OUTER_LESS_CV_QUAL
))
16306 && (parm_quals
& arg_quals
) != arg_quals
)
16312 /* Determines the LEVEL and INDEX for the template parameter PARM. */
16314 template_parm_level_and_index (tree parm
, int* level
, int* index
)
16316 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
16317 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
16318 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
16320 *index
= TEMPLATE_TYPE_IDX (parm
);
16321 *level
= TEMPLATE_TYPE_LEVEL (parm
);
16325 *index
= TEMPLATE_PARM_IDX (parm
);
16326 *level
= TEMPLATE_PARM_LEVEL (parm
);
16330 #define RECUR_AND_CHECK_FAILURE(TP, TA, P, A, S, EP) \
16332 if (unify (TP, TA, P, A, S, EP)) \
16336 /* Unifies the remaining arguments in PACKED_ARGS with the pack
16337 expansion at the end of PACKED_PARMS. Returns 0 if the type
16338 deduction succeeds, 1 otherwise. STRICT is the same as in
16339 unify. CALL_ARGS_P is true iff PACKED_ARGS is actually a function
16340 call argument list. We'll need to adjust the arguments to make them
16341 types. SUBR tells us if this is from a recursive call to
16342 type_unification_real, or for comparing two template argument
16346 unify_pack_expansion (tree tparms
, tree targs
, tree packed_parms
,
16347 tree packed_args
, unification_kind_t strict
,
16348 bool subr
, bool explain_p
)
16351 = TREE_VEC_ELT (packed_parms
, TREE_VEC_LENGTH (packed_parms
) - 1);
16352 tree pattern
= PACK_EXPANSION_PATTERN (parm
);
16353 tree pack
, packs
= NULL_TREE
;
16354 int i
, start
= TREE_VEC_LENGTH (packed_parms
) - 1;
16355 int len
= TREE_VEC_LENGTH (packed_args
);
16357 /* Determine the parameter packs we will be deducing from the
16358 pattern, and record their current deductions. */
16359 for (pack
= PACK_EXPANSION_PARAMETER_PACKS (parm
);
16360 pack
; pack
= TREE_CHAIN (pack
))
16362 tree parm_pack
= TREE_VALUE (pack
);
16365 /* Determine the index and level of this parameter pack. */
16366 template_parm_level_and_index (parm_pack
, &level
, &idx
);
16368 /* Keep track of the parameter packs and their corresponding
16370 packs
= tree_cons (parm_pack
, TMPL_ARG (targs
, level
, idx
), packs
);
16371 TREE_TYPE (packs
) = make_tree_vec (len
- start
);
16374 /* Loop through all of the arguments that have not yet been
16375 unified and unify each with the pattern. */
16376 for (i
= start
; i
< len
; i
++)
16379 bool any_explicit
= false;
16380 tree arg
= TREE_VEC_ELT (packed_args
, i
);
16382 /* For each parameter pack, set its TMPL_ARG to either NULL_TREE
16383 or the element of its argument pack at the current index if
16384 this argument was explicitly specified. */
16385 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
16389 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
16392 if (TREE_VALUE (pack
)
16393 && (pargs
= ARGUMENT_PACK_EXPLICIT_ARGS (TREE_VALUE (pack
)))
16394 && (i
- start
< TREE_VEC_LENGTH (pargs
)))
16396 any_explicit
= true;
16397 arg
= TREE_VEC_ELT (pargs
, i
- start
);
16399 TMPL_ARG (targs
, level
, idx
) = arg
;
16402 /* If we had explicit template arguments, substitute them into the
16403 pattern before deduction. */
16406 /* Some arguments might still be unspecified or dependent. */
16408 ++processing_template_decl
;
16409 dependent
= any_dependent_template_arguments_p (targs
);
16411 --processing_template_decl
;
16412 parm
= tsubst (pattern
, targs
,
16413 explain_p
? tf_warning_or_error
: tf_none
,
16416 --processing_template_decl
;
16417 if (parm
== error_mark_node
)
16423 /* Unify the pattern with the current argument. */
16424 if (unify_one_argument (tparms
, targs
, parm
, arg
, subr
, strict
,
16425 LOOKUP_IMPLICIT
, explain_p
))
16428 /* For each parameter pack, collect the deduced value. */
16429 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
16432 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
16434 TREE_VEC_ELT (TREE_TYPE (pack
), i
- start
) =
16435 TMPL_ARG (targs
, level
, idx
);
16439 /* Verify that the results of unification with the parameter packs
16440 produce results consistent with what we've seen before, and make
16441 the deduced argument packs available. */
16442 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
16444 tree old_pack
= TREE_VALUE (pack
);
16445 tree new_args
= TREE_TYPE (pack
);
16446 int i
, len
= TREE_VEC_LENGTH (new_args
);
16448 bool nondeduced_p
= false;
16450 /* By default keep the original deduced argument pack.
16451 If necessary, more specific code is going to update the
16452 resulting deduced argument later down in this function. */
16453 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
16454 TMPL_ARG (targs
, level
, idx
) = old_pack
;
16456 /* If NEW_ARGS contains any NULL_TREE entries, we didn't
16457 actually deduce anything. */
16458 for (i
= 0; i
< len
&& !nondeduced_p
; ++i
)
16459 if (TREE_VEC_ELT (new_args
, i
) == NULL_TREE
)
16460 nondeduced_p
= true;
16464 if (old_pack
&& ARGUMENT_PACK_INCOMPLETE_P (old_pack
))
16466 /* If we had fewer function args than explicit template args,
16467 just use the explicits. */
16468 tree explicit_args
= ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
);
16469 int explicit_len
= TREE_VEC_LENGTH (explicit_args
);
16470 if (len
< explicit_len
)
16471 new_args
= explicit_args
;
16477 /* Build the deduced *_ARGUMENT_PACK. */
16478 if (TREE_CODE (TREE_PURPOSE (pack
)) == TEMPLATE_PARM_INDEX
)
16480 result
= make_node (NONTYPE_ARGUMENT_PACK
);
16481 TREE_TYPE (result
) =
16482 TREE_TYPE (TEMPLATE_PARM_DECL (TREE_PURPOSE (pack
)));
16483 TREE_CONSTANT (result
) = 1;
16486 result
= cxx_make_type (TYPE_ARGUMENT_PACK
);
16488 SET_ARGUMENT_PACK_ARGS (result
, new_args
);
16490 /* Note the deduced argument packs for this parameter
16492 TMPL_ARG (targs
, level
, idx
) = result
;
16494 else if (ARGUMENT_PACK_INCOMPLETE_P (old_pack
)
16495 && (ARGUMENT_PACK_ARGS (old_pack
)
16496 == ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
)))
16498 /* We only had the explicitly-provided arguments before, but
16499 now we have a complete set of arguments. */
16500 tree explicit_args
= ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
);
16502 SET_ARGUMENT_PACK_ARGS (old_pack
, new_args
);
16503 ARGUMENT_PACK_INCOMPLETE_P (old_pack
) = 1;
16504 ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
) = explicit_args
;
16508 tree bad_old_arg
= NULL_TREE
, bad_new_arg
= NULL_TREE
;
16509 tree old_args
= ARGUMENT_PACK_ARGS (old_pack
);
16511 if (!comp_template_args_with_info (old_args
, new_args
,
16512 &bad_old_arg
, &bad_new_arg
))
16513 /* Inconsistent unification of this parameter pack. */
16514 return unify_parameter_pack_inconsistent (explain_p
,
16520 return unify_success (explain_p
);
16523 /* Deduce the value of template parameters. TPARMS is the (innermost)
16524 set of template parameters to a template. TARGS is the bindings
16525 for those template parameters, as determined thus far; TARGS may
16526 include template arguments for outer levels of template parameters
16527 as well. PARM is a parameter to a template function, or a
16528 subcomponent of that parameter; ARG is the corresponding argument.
16529 This function attempts to match PARM with ARG in a manner
16530 consistent with the existing assignments in TARGS. If more values
16531 are deduced, then TARGS is updated.
16533 Returns 0 if the type deduction succeeds, 1 otherwise. The
16534 parameter STRICT is a bitwise or of the following flags:
16537 Require an exact match between PARM and ARG.
16538 UNIFY_ALLOW_MORE_CV_QUAL:
16539 Allow the deduced ARG to be more cv-qualified (by qualification
16540 conversion) than ARG.
16541 UNIFY_ALLOW_LESS_CV_QUAL:
16542 Allow the deduced ARG to be less cv-qualified than ARG.
16543 UNIFY_ALLOW_DERIVED:
16544 Allow the deduced ARG to be a template base class of ARG,
16545 or a pointer to a template base class of the type pointed to by
16547 UNIFY_ALLOW_INTEGER:
16548 Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX
16549 case for more information.
16550 UNIFY_ALLOW_OUTER_LEVEL:
16551 This is the outermost level of a deduction. Used to determine validity
16552 of qualification conversions. A valid qualification conversion must
16553 have const qualified pointers leading up to the inner type which
16554 requires additional CV quals, except at the outer level, where const
16555 is not required [conv.qual]. It would be normal to set this flag in
16556 addition to setting UNIFY_ALLOW_MORE_CV_QUAL.
16557 UNIFY_ALLOW_OUTER_MORE_CV_QUAL:
16558 This is the outermost level of a deduction, and PARM can be more CV
16559 qualified at this point.
16560 UNIFY_ALLOW_OUTER_LESS_CV_QUAL:
16561 This is the outermost level of a deduction, and PARM can be less CV
16562 qualified at this point. */
16565 unify (tree tparms
, tree targs
, tree parm
, tree arg
, int strict
,
16571 int strict_in
= strict
;
16573 /* I don't think this will do the right thing with respect to types.
16574 But the only case I've seen it in so far has been array bounds, where
16575 signedness is the only information lost, and I think that will be
16577 while (TREE_CODE (parm
) == NOP_EXPR
)
16578 parm
= TREE_OPERAND (parm
, 0);
16580 if (arg
== error_mark_node
)
16581 return unify_invalid (explain_p
);
16582 if (arg
== unknown_type_node
16583 || arg
== init_list_type_node
)
16584 /* We can't deduce anything from this, but we might get all the
16585 template args from other function args. */
16586 return unify_success (explain_p
);
16588 /* If PARM uses template parameters, then we can't bail out here,
16589 even if ARG == PARM, since we won't record unifications for the
16590 template parameters. We might need them if we're trying to
16591 figure out which of two things is more specialized. */
16592 if (arg
== parm
&& !uses_template_parms (parm
))
16593 return unify_success (explain_p
);
16595 /* Handle init lists early, so the rest of the function can assume
16596 we're dealing with a type. */
16597 if (BRACE_ENCLOSED_INITIALIZER_P (arg
))
16601 tree orig_parm
= parm
;
16603 /* Replace T with std::initializer_list<T> for deduction. */
16604 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
16605 && flag_deduce_init_list
)
16606 parm
= listify (parm
);
16608 if (!is_std_init_list (parm
))
16609 /* We can only deduce from an initializer list argument if the
16610 parameter is std::initializer_list; otherwise this is a
16611 non-deduced context. */
16612 return unify_success (explain_p
);
16614 elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (parm
), 0);
16616 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (arg
), i
, elt
)
16618 int elt_strict
= strict
;
16620 if (elt
== error_mark_node
)
16621 return unify_invalid (explain_p
);
16623 if (!BRACE_ENCLOSED_INITIALIZER_P (elt
))
16625 tree type
= TREE_TYPE (elt
);
16626 /* It should only be possible to get here for a call. */
16627 gcc_assert (elt_strict
& UNIFY_ALLOW_OUTER_LEVEL
);
16628 elt_strict
|= maybe_adjust_types_for_deduction
16629 (DEDUCE_CALL
, &elttype
, &type
, elt
);
16633 RECUR_AND_CHECK_FAILURE (tparms
, targs
, elttype
, elt
, elt_strict
,
16637 /* If the std::initializer_list<T> deduction worked, replace the
16638 deduced A with std::initializer_list<A>. */
16639 if (orig_parm
!= parm
)
16641 idx
= TEMPLATE_TYPE_IDX (orig_parm
);
16642 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
16643 targ
= listify (targ
);
16644 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = targ
;
16646 return unify_success (explain_p
);
16649 /* Immediately reject some pairs that won't unify because of
16650 cv-qualification mismatches. */
16651 if (TREE_CODE (arg
) == TREE_CODE (parm
)
16653 /* It is the elements of the array which hold the cv quals of an array
16654 type, and the elements might be template type parms. We'll check
16655 when we recurse. */
16656 && TREE_CODE (arg
) != ARRAY_TYPE
16657 /* We check the cv-qualifiers when unifying with template type
16658 parameters below. We want to allow ARG `const T' to unify with
16659 PARM `T' for example, when computing which of two templates
16660 is more specialized, for example. */
16661 && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
16662 && !check_cv_quals_for_unify (strict_in
, arg
, parm
))
16663 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
16665 if (!(strict
& UNIFY_ALLOW_OUTER_LEVEL
)
16666 && TYPE_P (parm
) && !CP_TYPE_CONST_P (parm
))
16667 strict
&= ~UNIFY_ALLOW_MORE_CV_QUAL
;
16668 strict
&= ~UNIFY_ALLOW_OUTER_LEVEL
;
16669 strict
&= ~UNIFY_ALLOW_DERIVED
;
16670 strict
&= ~UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
16671 strict
&= ~UNIFY_ALLOW_OUTER_LESS_CV_QUAL
;
16673 switch (TREE_CODE (parm
))
16675 case TYPENAME_TYPE
:
16677 case UNBOUND_CLASS_TEMPLATE
:
16678 /* In a type which contains a nested-name-specifier, template
16679 argument values cannot be deduced for template parameters used
16680 within the nested-name-specifier. */
16681 return unify_success (explain_p
);
16683 case TEMPLATE_TYPE_PARM
:
16684 case TEMPLATE_TEMPLATE_PARM
:
16685 case BOUND_TEMPLATE_TEMPLATE_PARM
:
16686 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
16687 if (tparm
== error_mark_node
)
16688 return unify_invalid (explain_p
);
16690 if (TEMPLATE_TYPE_LEVEL (parm
)
16691 != template_decl_level (tparm
))
16692 /* The PARM is not one we're trying to unify. Just check
16693 to see if it matches ARG. */
16695 if (TREE_CODE (arg
) == TREE_CODE (parm
)
16696 && (is_auto (parm
) ? is_auto (arg
)
16697 : same_type_p (parm
, arg
)))
16698 return unify_success (explain_p
);
16700 return unify_type_mismatch (explain_p
, parm
, arg
);
16702 idx
= TEMPLATE_TYPE_IDX (parm
);
16703 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
16704 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, idx
));
16705 if (tparm
== error_mark_node
)
16706 return unify_invalid (explain_p
);
16708 /* Check for mixed types and values. */
16709 if ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
16710 && TREE_CODE (tparm
) != TYPE_DECL
)
16711 || (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
16712 && TREE_CODE (tparm
) != TEMPLATE_DECL
))
16713 gcc_unreachable ();
16715 if (TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
16717 /* ARG must be constructed from a template class or a template
16718 template parameter. */
16719 if (TREE_CODE (arg
) != BOUND_TEMPLATE_TEMPLATE_PARM
16720 && !CLASSTYPE_SPECIALIZATION_OF_PRIMARY_TEMPLATE_P (arg
))
16721 return unify_template_deduction_failure (explain_p
, parm
, arg
);
16724 tree parmvec
= TYPE_TI_ARGS (parm
);
16725 tree argvec
= INNERMOST_TEMPLATE_ARGS (TYPE_TI_ARGS (arg
));
16726 tree full_argvec
= add_to_template_args (targs
, argvec
);
16728 = DECL_INNERMOST_TEMPLATE_PARMS
16729 (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (parm
));
16731 int parm_variadic_p
= 0;
16733 /* The resolution to DR150 makes clear that default
16734 arguments for an N-argument may not be used to bind T
16735 to a template template parameter with fewer than N
16736 parameters. It is not safe to permit the binding of
16737 default arguments as an extension, as that may change
16738 the meaning of a conforming program. Consider:
16740 struct Dense { static const unsigned int dim = 1; };
16742 template <template <typename> class View,
16744 void operator+(float, View<Block> const&);
16746 template <typename Block,
16747 unsigned int Dim = Block::dim>
16748 struct Lvalue_proxy { operator float() const; };
16752 Lvalue_proxy<Dense> p;
16757 Here, if Lvalue_proxy is permitted to bind to View, then
16758 the global operator+ will be used; if they are not, the
16759 Lvalue_proxy will be converted to float. */
16760 if (coerce_template_parms (parm_parms
,
16762 TYPE_TI_TEMPLATE (parm
),
16764 ? tf_warning_or_error
16766 /*require_all_args=*/true,
16767 /*use_default_args=*/false)
16768 == error_mark_node
)
16771 /* Deduce arguments T, i from TT<T> or TT<i>.
16772 We check each element of PARMVEC and ARGVEC individually
16773 rather than the whole TREE_VEC since they can have
16774 different number of elements. */
16776 parmvec
= expand_template_argument_pack (parmvec
);
16777 argvec
= expand_template_argument_pack (argvec
);
16779 len
= TREE_VEC_LENGTH (parmvec
);
16781 /* Check if the parameters end in a pack, making them
16784 && PACK_EXPANSION_P (TREE_VEC_ELT (parmvec
, len
- 1)))
16785 parm_variadic_p
= 1;
16787 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
16788 /* If the template argument list of P contains a pack
16789 expansion that is not the last template argument, the
16790 entire template argument list is a non-deduced
16792 if (PACK_EXPANSION_P (TREE_VEC_ELT (parmvec
, i
)))
16793 return unify_success (explain_p
);
16795 if (TREE_VEC_LENGTH (argvec
) < len
- parm_variadic_p
)
16796 return unify_too_few_arguments (explain_p
,
16797 TREE_VEC_LENGTH (argvec
), len
);
16799 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
16801 RECUR_AND_CHECK_FAILURE (tparms
, targs
,
16802 TREE_VEC_ELT (parmvec
, i
),
16803 TREE_VEC_ELT (argvec
, i
),
16804 UNIFY_ALLOW_NONE
, explain_p
);
16807 if (parm_variadic_p
16808 && unify_pack_expansion (tparms
, targs
,
16811 /*subr=*/true, explain_p
))
16814 arg
= TYPE_TI_TEMPLATE (arg
);
16816 /* Fall through to deduce template name. */
16819 if (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
16820 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
16822 /* Deduce template name TT from TT, TT<>, TT<T> and TT<i>. */
16824 /* Simple cases: Value already set, does match or doesn't. */
16825 if (targ
!= NULL_TREE
&& template_args_equal (targ
, arg
))
16826 return unify_success (explain_p
);
16828 return unify_inconsistency (explain_p
, parm
, targ
, arg
);
16832 /* If PARM is `const T' and ARG is only `int', we don't have
16833 a match unless we are allowing additional qualification.
16834 If ARG is `const int' and PARM is just `T' that's OK;
16835 that binds `const int' to `T'. */
16836 if (!check_cv_quals_for_unify (strict_in
| UNIFY_ALLOW_LESS_CV_QUAL
,
16838 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
16840 /* Consider the case where ARG is `const volatile int' and
16841 PARM is `const T'. Then, T should be `volatile int'. */
16842 arg
= cp_build_qualified_type_real
16843 (arg
, cp_type_quals (arg
) & ~cp_type_quals (parm
), tf_none
);
16844 if (arg
== error_mark_node
)
16845 return unify_invalid (explain_p
);
16847 /* Simple cases: Value already set, does match or doesn't. */
16848 if (targ
!= NULL_TREE
&& same_type_p (targ
, arg
))
16849 return unify_success (explain_p
);
16851 return unify_inconsistency (explain_p
, parm
, targ
, arg
);
16853 /* Make sure that ARG is not a variable-sized array. (Note
16854 that were talking about variable-sized arrays (like
16855 `int[n]'), rather than arrays of unknown size (like
16856 `int[]').) We'll get very confused by such a type since
16857 the bound of the array is not constant, and therefore
16858 not mangleable. Besides, such types are not allowed in
16859 ISO C++, so we can do as we please here. We do allow
16860 them for 'auto' deduction, since that isn't ABI-exposed. */
16861 if (!is_auto (parm
) && variably_modified_type_p (arg
, NULL_TREE
))
16862 return unify_vla_arg (explain_p
, arg
);
16864 /* Strip typedefs as in convert_template_argument. */
16865 arg
= canonicalize_type_argument (arg
, tf_none
);
16868 /* If ARG is a parameter pack or an expansion, we cannot unify
16869 against it unless PARM is also a parameter pack. */
16870 if ((template_parameter_pack_p (arg
) || PACK_EXPANSION_P (arg
))
16871 && !template_parameter_pack_p (parm
))
16872 return unify_parameter_pack_mismatch (explain_p
, parm
, arg
);
16874 /* If the argument deduction results is a METHOD_TYPE,
16875 then there is a problem.
16876 METHOD_TYPE doesn't map to any real C++ type the result of
16877 the deduction can not be of that type. */
16878 if (TREE_CODE (arg
) == METHOD_TYPE
)
16879 return unify_method_type_error (explain_p
, arg
);
16881 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = arg
;
16882 return unify_success (explain_p
);
16884 case TEMPLATE_PARM_INDEX
:
16885 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
16886 if (tparm
== error_mark_node
)
16887 return unify_invalid (explain_p
);
16889 if (TEMPLATE_PARM_LEVEL (parm
)
16890 != template_decl_level (tparm
))
16892 /* The PARM is not one we're trying to unify. Just check
16893 to see if it matches ARG. */
16894 int result
= !(TREE_CODE (arg
) == TREE_CODE (parm
)
16895 && cp_tree_equal (parm
, arg
));
16897 unify_expression_unequal (explain_p
, parm
, arg
);
16901 idx
= TEMPLATE_PARM_IDX (parm
);
16902 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
16906 int x
= !cp_tree_equal (targ
, arg
);
16908 unify_inconsistency (explain_p
, parm
, targ
, arg
);
16912 /* [temp.deduct.type] If, in the declaration of a function template
16913 with a non-type template-parameter, the non-type
16914 template-parameter is used in an expression in the function
16915 parameter-list and, if the corresponding template-argument is
16916 deduced, the template-argument type shall match the type of the
16917 template-parameter exactly, except that a template-argument
16918 deduced from an array bound may be of any integral type.
16919 The non-type parameter might use already deduced type parameters. */
16920 tparm
= tsubst (TREE_TYPE (parm
), targs
, 0, NULL_TREE
);
16921 if (!TREE_TYPE (arg
))
16922 /* Template-parameter dependent expression. Just accept it for now.
16923 It will later be processed in convert_template_argument. */
16925 else if (same_type_p (TREE_TYPE (arg
), tparm
))
16927 else if ((strict
& UNIFY_ALLOW_INTEGER
)
16928 && CP_INTEGRAL_TYPE_P (tparm
))
16929 /* Convert the ARG to the type of PARM; the deduced non-type
16930 template argument must exactly match the types of the
16931 corresponding parameter. */
16932 arg
= fold (build_nop (tparm
, arg
));
16933 else if (uses_template_parms (tparm
))
16934 /* We haven't deduced the type of this parameter yet. Try again
16936 return unify_success (explain_p
);
16938 return unify_type_mismatch (explain_p
, tparm
, arg
);
16940 /* If ARG is a parameter pack or an expansion, we cannot unify
16941 against it unless PARM is also a parameter pack. */
16942 if ((template_parameter_pack_p (arg
) || PACK_EXPANSION_P (arg
))
16943 && !TEMPLATE_PARM_PARAMETER_PACK (parm
))
16944 return unify_parameter_pack_mismatch (explain_p
, parm
, arg
);
16946 arg
= strip_typedefs_expr (arg
);
16947 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = arg
;
16948 return unify_success (explain_p
);
16952 /* A pointer-to-member constant can be unified only with
16953 another constant. */
16954 if (TREE_CODE (arg
) != PTRMEM_CST
)
16955 return unify_ptrmem_cst_mismatch (explain_p
, parm
, arg
);
16957 /* Just unify the class member. It would be useless (and possibly
16958 wrong, depending on the strict flags) to unify also
16959 PTRMEM_CST_CLASS, because we want to be sure that both parm and
16960 arg refer to the same variable, even if through different
16961 classes. For instance:
16963 struct A { int x; };
16966 Unification of &A::x and &B::x must succeed. */
16967 return unify (tparms
, targs
, PTRMEM_CST_MEMBER (parm
),
16968 PTRMEM_CST_MEMBER (arg
), strict
, explain_p
);
16973 if (!TYPE_PTR_P (arg
))
16974 return unify_type_mismatch (explain_p
, parm
, arg
);
16976 /* [temp.deduct.call]
16978 A can be another pointer or pointer to member type that can
16979 be converted to the deduced A via a qualification
16980 conversion (_conv.qual_).
16982 We pass down STRICT here rather than UNIFY_ALLOW_NONE.
16983 This will allow for additional cv-qualification of the
16984 pointed-to types if appropriate. */
16986 if (TREE_CODE (TREE_TYPE (arg
)) == RECORD_TYPE
)
16987 /* The derived-to-base conversion only persists through one
16988 level of pointers. */
16989 strict
|= (strict_in
& UNIFY_ALLOW_DERIVED
);
16991 return unify (tparms
, targs
, TREE_TYPE (parm
),
16992 TREE_TYPE (arg
), strict
, explain_p
);
16995 case REFERENCE_TYPE
:
16996 if (TREE_CODE (arg
) != REFERENCE_TYPE
)
16997 return unify_type_mismatch (explain_p
, parm
, arg
);
16998 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
16999 strict
& UNIFY_ALLOW_MORE_CV_QUAL
, explain_p
);
17002 if (TREE_CODE (arg
) != ARRAY_TYPE
)
17003 return unify_type_mismatch (explain_p
, parm
, arg
);
17004 if ((TYPE_DOMAIN (parm
) == NULL_TREE
)
17005 != (TYPE_DOMAIN (arg
) == NULL_TREE
))
17006 return unify_type_mismatch (explain_p
, parm
, arg
);
17007 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
17008 strict
& UNIFY_ALLOW_MORE_CV_QUAL
, explain_p
);
17009 if (TYPE_DOMAIN (parm
) != NULL_TREE
)
17016 /* Our representation of array types uses "N - 1" as the
17017 TYPE_MAX_VALUE for an array with "N" elements, if "N" is
17018 not an integer constant. We cannot unify arbitrarily
17019 complex expressions, so we eliminate the MINUS_EXPRs
17021 parm_max
= TYPE_MAX_VALUE (TYPE_DOMAIN (parm
));
17022 parm_cst
= TREE_CODE (parm_max
) == INTEGER_CST
;
17025 gcc_assert (TREE_CODE (parm_max
) == MINUS_EXPR
);
17026 parm_max
= TREE_OPERAND (parm_max
, 0);
17028 arg_max
= TYPE_MAX_VALUE (TYPE_DOMAIN (arg
));
17029 arg_cst
= TREE_CODE (arg_max
) == INTEGER_CST
;
17032 /* The ARG_MAX may not be a simple MINUS_EXPR, if we are
17033 trying to unify the type of a variable with the type
17034 of a template parameter. For example:
17036 template <unsigned int N>
17037 void f (char (&) [N]);
17044 Here, the type of the ARG will be "int [g(i)]", and
17045 may be a SAVE_EXPR, etc. */
17046 if (TREE_CODE (arg_max
) != MINUS_EXPR
)
17047 return unify_vla_arg (explain_p
, arg
);
17048 arg_max
= TREE_OPERAND (arg_max
, 0);
17051 /* If only one of the bounds used a MINUS_EXPR, compensate
17052 by adding one to the other bound. */
17053 if (parm_cst
&& !arg_cst
)
17054 parm_max
= fold_build2_loc (input_location
, PLUS_EXPR
,
17058 else if (arg_cst
&& !parm_cst
)
17059 arg_max
= fold_build2_loc (input_location
, PLUS_EXPR
,
17064 RECUR_AND_CHECK_FAILURE (tparms
, targs
, parm_max
, arg_max
,
17065 UNIFY_ALLOW_INTEGER
, explain_p
);
17067 return unify_success (explain_p
);
17074 case ENUMERAL_TYPE
:
17077 if (TREE_CODE (arg
) != TREE_CODE (parm
))
17078 return unify_type_mismatch (explain_p
, parm
, arg
);
17080 /* We have already checked cv-qualification at the top of the
17082 if (!same_type_ignoring_top_level_qualifiers_p (arg
, parm
))
17083 return unify_type_mismatch (explain_p
, parm
, arg
);
17085 /* As far as unification is concerned, this wins. Later checks
17086 will invalidate it if necessary. */
17087 return unify_success (explain_p
);
17089 /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */
17090 /* Type INTEGER_CST can come from ordinary constant template args. */
17092 while (TREE_CODE (arg
) == NOP_EXPR
)
17093 arg
= TREE_OPERAND (arg
, 0);
17095 if (TREE_CODE (arg
) != INTEGER_CST
)
17096 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
17097 return (tree_int_cst_equal (parm
, arg
)
17098 ? unify_success (explain_p
)
17099 : unify_template_argument_mismatch (explain_p
, parm
, arg
));
17103 int i
, len
, argslen
;
17104 int parm_variadic_p
= 0;
17106 if (TREE_CODE (arg
) != TREE_VEC
)
17107 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
17109 len
= TREE_VEC_LENGTH (parm
);
17110 argslen
= TREE_VEC_LENGTH (arg
);
17112 /* Check for pack expansions in the parameters. */
17113 for (i
= 0; i
< len
; ++i
)
17115 if (PACK_EXPANSION_P (TREE_VEC_ELT (parm
, i
)))
17118 /* We can unify against something with a trailing
17120 parm_variadic_p
= 1;
17122 /* [temp.deduct.type]/9: If the template argument list of
17123 P contains a pack expansion that is not the last
17124 template argument, the entire template argument list
17125 is a non-deduced context. */
17126 return unify_success (explain_p
);
17130 /* If we don't have enough arguments to satisfy the parameters
17131 (not counting the pack expression at the end), or we have
17132 too many arguments for a parameter list that doesn't end in
17133 a pack expression, we can't unify. */
17134 if (parm_variadic_p
17135 ? argslen
< len
- parm_variadic_p
17137 return unify_arity (explain_p
, TREE_VEC_LENGTH (arg
), len
);
17139 /* Unify all of the parameters that precede the (optional)
17140 pack expression. */
17141 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
17143 RECUR_AND_CHECK_FAILURE (tparms
, targs
,
17144 TREE_VEC_ELT (parm
, i
),
17145 TREE_VEC_ELT (arg
, i
),
17146 UNIFY_ALLOW_NONE
, explain_p
);
17148 if (parm_variadic_p
)
17149 return unify_pack_expansion (tparms
, targs
, parm
, arg
,
17151 /*subr=*/true, explain_p
);
17152 return unify_success (explain_p
);
17157 if (TREE_CODE (arg
) != TREE_CODE (parm
))
17158 return unify_type_mismatch (explain_p
, parm
, arg
);
17160 if (TYPE_PTRMEMFUNC_P (parm
))
17162 if (!TYPE_PTRMEMFUNC_P (arg
))
17163 return unify_type_mismatch (explain_p
, parm
, arg
);
17165 return unify (tparms
, targs
,
17166 TYPE_PTRMEMFUNC_FN_TYPE (parm
),
17167 TYPE_PTRMEMFUNC_FN_TYPE (arg
),
17168 strict
, explain_p
);
17171 if (CLASSTYPE_TEMPLATE_INFO (parm
))
17173 tree t
= NULL_TREE
;
17175 if (strict_in
& UNIFY_ALLOW_DERIVED
)
17177 /* First, we try to unify the PARM and ARG directly. */
17178 t
= try_class_unification (tparms
, targs
,
17179 parm
, arg
, explain_p
);
17183 /* Fallback to the special case allowed in
17184 [temp.deduct.call]:
17186 If P is a class, and P has the form
17187 template-id, then A can be a derived class of
17188 the deduced A. Likewise, if P is a pointer to
17189 a class of the form template-id, A can be a
17190 pointer to a derived class pointed to by the
17192 enum template_base_result r
;
17193 r
= get_template_base (tparms
, targs
, parm
, arg
,
17197 return unify_no_common_base (explain_p
, r
, parm
, arg
);
17200 else if (CLASSTYPE_TEMPLATE_INFO (arg
)
17201 && (CLASSTYPE_TI_TEMPLATE (parm
)
17202 == CLASSTYPE_TI_TEMPLATE (arg
)))
17203 /* Perhaps PARM is something like S<U> and ARG is S<int>.
17204 Then, we should unify `int' and `U'. */
17207 /* There's no chance of unification succeeding. */
17208 return unify_type_mismatch (explain_p
, parm
, arg
);
17210 return unify (tparms
, targs
, CLASSTYPE_TI_ARGS (parm
),
17211 CLASSTYPE_TI_ARGS (t
), UNIFY_ALLOW_NONE
, explain_p
);
17213 else if (!same_type_ignoring_top_level_qualifiers_p (parm
, arg
))
17214 return unify_type_mismatch (explain_p
, parm
, arg
);
17215 return unify_success (explain_p
);
17218 case FUNCTION_TYPE
:
17220 unsigned int nargs
;
17225 if (TREE_CODE (arg
) != TREE_CODE (parm
))
17226 return unify_type_mismatch (explain_p
, parm
, arg
);
17228 /* CV qualifications for methods can never be deduced, they must
17229 match exactly. We need to check them explicitly here,
17230 because type_unification_real treats them as any other
17231 cv-qualified parameter. */
17232 if (TREE_CODE (parm
) == METHOD_TYPE
17233 && (!check_cv_quals_for_unify
17235 class_of_this_parm (arg
),
17236 class_of_this_parm (parm
))))
17237 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
17239 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TREE_TYPE (parm
),
17240 TREE_TYPE (arg
), UNIFY_ALLOW_NONE
, explain_p
);
17242 nargs
= list_length (TYPE_ARG_TYPES (arg
));
17243 args
= XALLOCAVEC (tree
, nargs
);
17244 for (a
= TYPE_ARG_TYPES (arg
), i
= 0;
17245 a
!= NULL_TREE
&& a
!= void_list_node
;
17246 a
= TREE_CHAIN (a
), ++i
)
17247 args
[i
] = TREE_VALUE (a
);
17250 return type_unification_real (tparms
, targs
, TYPE_ARG_TYPES (parm
),
17251 args
, nargs
, 1, DEDUCE_EXACT
,
17252 LOOKUP_NORMAL
, explain_p
);
17256 /* Unify a pointer to member with a pointer to member function, which
17257 deduces the type of the member as a function type. */
17258 if (TYPE_PTRMEMFUNC_P (arg
))
17260 /* Check top-level cv qualifiers */
17261 if (!check_cv_quals_for_unify (UNIFY_ALLOW_NONE
, arg
, parm
))
17262 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
17264 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
17265 TYPE_PTRMEMFUNC_OBJECT_TYPE (arg
),
17266 UNIFY_ALLOW_NONE
, explain_p
);
17268 /* Determine the type of the function we are unifying against. */
17269 tree fntype
= static_fn_type (arg
);
17271 return unify (tparms
, targs
, TREE_TYPE (parm
), fntype
, strict
, explain_p
);
17274 if (TREE_CODE (arg
) != OFFSET_TYPE
)
17275 return unify_type_mismatch (explain_p
, parm
, arg
);
17276 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
17277 TYPE_OFFSET_BASETYPE (arg
),
17278 UNIFY_ALLOW_NONE
, explain_p
);
17279 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
17280 strict
, explain_p
);
17283 if (DECL_TEMPLATE_PARM_P (parm
))
17284 return unify (tparms
, targs
, DECL_INITIAL (parm
), arg
, strict
, explain_p
);
17285 if (arg
!= integral_constant_value (parm
))
17286 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
17287 return unify_success (explain_p
);
17290 case TEMPLATE_DECL
:
17291 /* Matched cases are handled by the ARG == PARM test above. */
17292 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
17295 /* A non-type template parameter that is a variable should be a
17296 an integral constant, in which case, it whould have been
17297 folded into its (constant) value. So we should not be getting
17298 a variable here. */
17299 gcc_unreachable ();
17301 case TYPE_ARGUMENT_PACK
:
17302 case NONTYPE_ARGUMENT_PACK
:
17303 return unify (tparms
, targs
, ARGUMENT_PACK_ARGS (parm
),
17304 ARGUMENT_PACK_ARGS (arg
), strict
, explain_p
);
17307 case DECLTYPE_TYPE
:
17308 case UNDERLYING_TYPE
:
17309 /* Cannot deduce anything from TYPEOF_TYPE, DECLTYPE_TYPE,
17310 or UNDERLYING_TYPE nodes. */
17311 return unify_success (explain_p
);
17314 /* Unification fails if we hit an error node. */
17315 return unify_invalid (explain_p
);
17318 /* An unresolved overload is a nondeduced context. */
17319 if (is_overloaded_fn (parm
) || type_unknown_p (parm
))
17320 return unify_success (explain_p
);
17321 gcc_assert (EXPR_P (parm
));
17323 /* We must be looking at an expression. This can happen with
17327 void foo(S<I>, S<I + 2>);
17329 This is a "nondeduced context":
17333 The nondeduced contexts are:
17335 --A type that is a template-id in which one or more of
17336 the template-arguments is an expression that references
17337 a template-parameter.
17339 In these cases, we assume deduction succeeded, but don't
17340 actually infer any unifications. */
17342 if (!uses_template_parms (parm
)
17343 && !template_args_equal (parm
, arg
))
17344 return unify_expression_unequal (explain_p
, parm
, arg
);
17346 return unify_success (explain_p
);
17349 #undef RECUR_AND_CHECK_FAILURE
17351 /* Note that DECL can be defined in this translation unit, if
17355 mark_definable (tree decl
)
17358 DECL_NOT_REALLY_EXTERN (decl
) = 1;
17359 FOR_EACH_CLONE (clone
, decl
)
17360 DECL_NOT_REALLY_EXTERN (clone
) = 1;
17363 /* Called if RESULT is explicitly instantiated, or is a member of an
17364 explicitly instantiated class. */
17367 mark_decl_instantiated (tree result
, int extern_p
)
17369 SET_DECL_EXPLICIT_INSTANTIATION (result
);
17371 /* If this entity has already been written out, it's too late to
17372 make any modifications. */
17373 if (TREE_ASM_WRITTEN (result
))
17376 if (TREE_CODE (result
) != FUNCTION_DECL
)
17377 /* The TREE_PUBLIC flag for function declarations will have been
17378 set correctly by tsubst. */
17379 TREE_PUBLIC (result
) = 1;
17381 /* This might have been set by an earlier implicit instantiation. */
17382 DECL_COMDAT (result
) = 0;
17385 DECL_NOT_REALLY_EXTERN (result
) = 0;
17388 mark_definable (result
);
17389 /* Always make artificials weak. */
17390 if (DECL_ARTIFICIAL (result
) && flag_weak
)
17391 comdat_linkage (result
);
17392 /* For WIN32 we also want to put explicit instantiations in
17393 linkonce sections. */
17394 else if (TREE_PUBLIC (result
))
17395 maybe_make_one_only (result
);
17398 /* If EXTERN_P, then this function will not be emitted -- unless
17399 followed by an explicit instantiation, at which point its linkage
17400 will be adjusted. If !EXTERN_P, then this function will be
17401 emitted here. In neither circumstance do we want
17402 import_export_decl to adjust the linkage. */
17403 DECL_INTERFACE_KNOWN (result
) = 1;
17406 /* Subroutine of more_specialized_fn: check whether TARGS is missing any
17407 important template arguments. If any are missing, we check whether
17408 they're important by using error_mark_node for substituting into any
17409 args that were used for partial ordering (the ones between ARGS and END)
17410 and seeing if it bubbles up. */
17413 check_undeduced_parms (tree targs
, tree args
, tree end
)
17415 bool found
= false;
17417 for (i
= TREE_VEC_LENGTH (targs
) - 1; i
>= 0; --i
)
17418 if (TREE_VEC_ELT (targs
, i
) == NULL_TREE
)
17421 TREE_VEC_ELT (targs
, i
) = error_mark_node
;
17425 tree substed
= tsubst_arg_types (args
, targs
, end
, tf_none
, NULL_TREE
);
17426 if (substed
== error_mark_node
)
17432 /* Given two function templates PAT1 and PAT2, return:
17434 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order].
17435 -1 if PAT2 is more specialized than PAT1.
17436 0 if neither is more specialized.
17438 LEN indicates the number of parameters we should consider
17439 (defaulted parameters should not be considered).
17441 The 1998 std underspecified function template partial ordering, and
17442 DR214 addresses the issue. We take pairs of arguments, one from
17443 each of the templates, and deduce them against each other. One of
17444 the templates will be more specialized if all the *other*
17445 template's arguments deduce against its arguments and at least one
17446 of its arguments *does* *not* deduce against the other template's
17447 corresponding argument. Deduction is done as for class templates.
17448 The arguments used in deduction have reference and top level cv
17449 qualifiers removed. Iff both arguments were originally reference
17450 types *and* deduction succeeds in both directions, the template
17451 with the more cv-qualified argument wins for that pairing (if
17452 neither is more cv-qualified, they both are equal). Unlike regular
17453 deduction, after all the arguments have been deduced in this way,
17454 we do *not* verify the deduced template argument values can be
17455 substituted into non-deduced contexts.
17457 The logic can be a bit confusing here, because we look at deduce1 and
17458 targs1 to see if pat2 is at least as specialized, and vice versa; if we
17459 can find template arguments for pat1 to make arg1 look like arg2, that
17460 means that arg2 is at least as specialized as arg1. */
17463 more_specialized_fn (tree pat1
, tree pat2
, int len
)
17465 tree decl1
= DECL_TEMPLATE_RESULT (pat1
);
17466 tree decl2
= DECL_TEMPLATE_RESULT (pat2
);
17467 tree targs1
= make_tree_vec (DECL_NTPARMS (pat1
));
17468 tree targs2
= make_tree_vec (DECL_NTPARMS (pat2
));
17469 tree tparms1
= DECL_INNERMOST_TEMPLATE_PARMS (pat1
);
17470 tree tparms2
= DECL_INNERMOST_TEMPLATE_PARMS (pat2
);
17471 tree args1
= TYPE_ARG_TYPES (TREE_TYPE (decl1
));
17472 tree args2
= TYPE_ARG_TYPES (TREE_TYPE (decl2
));
17473 tree origs1
, origs2
;
17474 bool lose1
= false;
17475 bool lose2
= false;
17477 /* Remove the this parameter from non-static member functions. If
17478 one is a non-static member function and the other is not a static
17479 member function, remove the first parameter from that function
17480 also. This situation occurs for operator functions where we
17481 locate both a member function (with this pointer) and non-member
17482 operator (with explicit first operand). */
17483 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl1
))
17485 len
--; /* LEN is the number of significant arguments for DECL1 */
17486 args1
= TREE_CHAIN (args1
);
17487 if (!DECL_STATIC_FUNCTION_P (decl2
))
17488 args2
= TREE_CHAIN (args2
);
17490 else if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl2
))
17492 args2
= TREE_CHAIN (args2
);
17493 if (!DECL_STATIC_FUNCTION_P (decl1
))
17496 args1
= TREE_CHAIN (args1
);
17500 /* If only one is a conversion operator, they are unordered. */
17501 if (DECL_CONV_FN_P (decl1
) != DECL_CONV_FN_P (decl2
))
17504 /* Consider the return type for a conversion function */
17505 if (DECL_CONV_FN_P (decl1
))
17507 args1
= tree_cons (NULL_TREE
, TREE_TYPE (TREE_TYPE (decl1
)), args1
);
17508 args2
= tree_cons (NULL_TREE
, TREE_TYPE (TREE_TYPE (decl2
)), args2
);
17512 processing_template_decl
++;
17518 /* Stop when an ellipsis is seen. */
17519 && args1
!= NULL_TREE
&& args2
!= NULL_TREE
)
17521 tree arg1
= TREE_VALUE (args1
);
17522 tree arg2
= TREE_VALUE (args2
);
17523 int deduce1
, deduce2
;
17527 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
17528 && TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
17530 /* When both arguments are pack expansions, we need only
17531 unify the patterns themselves. */
17532 arg1
= PACK_EXPANSION_PATTERN (arg1
);
17533 arg2
= PACK_EXPANSION_PATTERN (arg2
);
17535 /* This is the last comparison we need to do. */
17539 if (TREE_CODE (arg1
) == REFERENCE_TYPE
)
17541 arg1
= TREE_TYPE (arg1
);
17542 quals1
= cp_type_quals (arg1
);
17545 if (TREE_CODE (arg2
) == REFERENCE_TYPE
)
17547 arg2
= TREE_TYPE (arg2
);
17548 quals2
= cp_type_quals (arg2
);
17551 arg1
= TYPE_MAIN_VARIANT (arg1
);
17552 arg2
= TYPE_MAIN_VARIANT (arg2
);
17554 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
)
17556 int i
, len2
= list_length (args2
);
17557 tree parmvec
= make_tree_vec (1);
17558 tree argvec
= make_tree_vec (len2
);
17561 /* Setup the parameter vector, which contains only ARG1. */
17562 TREE_VEC_ELT (parmvec
, 0) = arg1
;
17564 /* Setup the argument vector, which contains the remaining
17566 for (i
= 0; i
< len2
; i
++, ta
= TREE_CHAIN (ta
))
17567 TREE_VEC_ELT (argvec
, i
) = TREE_VALUE (ta
);
17569 deduce1
= (unify_pack_expansion (tparms1
, targs1
, parmvec
,
17570 argvec
, DEDUCE_EXACT
,
17571 /*subr=*/true, /*explain_p=*/false)
17574 /* We cannot deduce in the other direction, because ARG1 is
17575 a pack expansion but ARG2 is not. */
17578 else if (TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
17580 int i
, len1
= list_length (args1
);
17581 tree parmvec
= make_tree_vec (1);
17582 tree argvec
= make_tree_vec (len1
);
17585 /* Setup the parameter vector, which contains only ARG1. */
17586 TREE_VEC_ELT (parmvec
, 0) = arg2
;
17588 /* Setup the argument vector, which contains the remaining
17590 for (i
= 0; i
< len1
; i
++, ta
= TREE_CHAIN (ta
))
17591 TREE_VEC_ELT (argvec
, i
) = TREE_VALUE (ta
);
17593 deduce2
= (unify_pack_expansion (tparms2
, targs2
, parmvec
,
17594 argvec
, DEDUCE_EXACT
,
17595 /*subr=*/true, /*explain_p=*/false)
17598 /* We cannot deduce in the other direction, because ARG2 is
17599 a pack expansion but ARG1 is not.*/
17605 /* The normal case, where neither argument is a pack
17607 deduce1
= (unify (tparms1
, targs1
, arg1
, arg2
,
17608 UNIFY_ALLOW_NONE
, /*explain_p=*/false)
17610 deduce2
= (unify (tparms2
, targs2
, arg2
, arg1
,
17611 UNIFY_ALLOW_NONE
, /*explain_p=*/false)
17615 /* If we couldn't deduce arguments for tparms1 to make arg1 match
17616 arg2, then arg2 is not as specialized as arg1. */
17622 /* "If, for a given type, deduction succeeds in both directions
17623 (i.e., the types are identical after the transformations above)
17624 and if the type from the argument template is more cv-qualified
17625 than the type from the parameter template (as described above)
17626 that type is considered to be more specialized than the other. If
17627 neither type is more cv-qualified than the other then neither type
17628 is more specialized than the other." */
17630 if (deduce1
&& deduce2
17631 && quals1
!= quals2
&& quals1
>= 0 && quals2
>= 0)
17633 if ((quals1
& quals2
) == quals2
)
17635 if ((quals1
& quals2
) == quals1
)
17639 if (lose1
&& lose2
)
17640 /* We've failed to deduce something in either direction.
17641 These must be unordered. */
17644 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
17645 || TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
17646 /* We have already processed all of the arguments in our
17647 handing of the pack expansion type. */
17650 args1
= TREE_CHAIN (args1
);
17651 args2
= TREE_CHAIN (args2
);
17654 /* "In most cases, all template parameters must have values in order for
17655 deduction to succeed, but for partial ordering purposes a template
17656 parameter may remain without a value provided it is not used in the
17657 types being used for partial ordering."
17659 Thus, if we are missing any of the targs1 we need to substitute into
17660 origs1, then pat2 is not as specialized as pat1. This can happen when
17661 there is a nondeduced context. */
17662 if (!lose2
&& check_undeduced_parms (targs1
, origs1
, args1
))
17664 if (!lose1
&& check_undeduced_parms (targs2
, origs2
, args2
))
17667 processing_template_decl
--;
17669 /* All things being equal, if the next argument is a pack expansion
17670 for one function but not for the other, prefer the
17671 non-variadic function. FIXME this is bogus; see c++/41958. */
17673 && args1
&& TREE_VALUE (args1
)
17674 && args2
&& TREE_VALUE (args2
))
17676 lose1
= TREE_CODE (TREE_VALUE (args1
)) == TYPE_PACK_EXPANSION
;
17677 lose2
= TREE_CODE (TREE_VALUE (args2
)) == TYPE_PACK_EXPANSION
;
17680 if (lose1
== lose2
)
17688 /* Determine which of two partial specializations of MAIN_TMPL is more
17691 PAT1 is a TREE_LIST whose TREE_TYPE is the _TYPE node corresponding
17692 to the first partial specialization. The TREE_VALUE is the
17693 innermost set of template parameters for the partial
17694 specialization. PAT2 is similar, but for the second template.
17696 Return 1 if the first partial specialization is more specialized;
17697 -1 if the second is more specialized; 0 if neither is more
17700 See [temp.class.order] for information about determining which of
17701 two templates is more specialized. */
17704 more_specialized_class (tree main_tmpl
, tree pat1
, tree pat2
)
17709 bool any_deductions
= false;
17711 tmpl1
= TREE_TYPE (pat1
);
17712 tmpl2
= TREE_TYPE (pat2
);
17714 /* Just like what happens for functions, if we are ordering between
17715 different class template specializations, we may encounter dependent
17716 types in the arguments, and we need our dependency check functions
17717 to behave correctly. */
17718 ++processing_template_decl
;
17719 targs
= get_class_bindings (main_tmpl
, TREE_VALUE (pat1
),
17720 CLASSTYPE_TI_ARGS (tmpl1
),
17721 CLASSTYPE_TI_ARGS (tmpl2
));
17725 any_deductions
= true;
17728 targs
= get_class_bindings (main_tmpl
, TREE_VALUE (pat2
),
17729 CLASSTYPE_TI_ARGS (tmpl2
),
17730 CLASSTYPE_TI_ARGS (tmpl1
));
17734 any_deductions
= true;
17736 --processing_template_decl
;
17738 /* In the case of a tie where at least one of the class templates
17739 has a parameter pack at the end, the template with the most
17740 non-packed parameters wins. */
17743 && (template_args_variadic_p (TREE_PURPOSE (pat1
))
17744 || template_args_variadic_p (TREE_PURPOSE (pat2
))))
17746 tree args1
= INNERMOST_TEMPLATE_ARGS (TREE_PURPOSE (pat1
));
17747 tree args2
= INNERMOST_TEMPLATE_ARGS (TREE_PURPOSE (pat2
));
17748 int len1
= TREE_VEC_LENGTH (args1
);
17749 int len2
= TREE_VEC_LENGTH (args2
);
17751 /* We don't count the pack expansion at the end. */
17752 if (template_args_variadic_p (TREE_PURPOSE (pat1
)))
17754 if (template_args_variadic_p (TREE_PURPOSE (pat2
)))
17759 else if (len1
< len2
)
17766 /* Return the template arguments that will produce the function signature
17767 DECL from the function template FN, with the explicit template
17768 arguments EXPLICIT_ARGS. If CHECK_RETTYPE is true, the return type must
17769 also match. Return NULL_TREE if no satisfactory arguments could be
17773 get_bindings (tree fn
, tree decl
, tree explicit_args
, bool check_rettype
)
17775 int ntparms
= DECL_NTPARMS (fn
);
17776 tree targs
= make_tree_vec (ntparms
);
17777 tree decl_type
= TREE_TYPE (decl
);
17778 tree decl_arg_types
;
17780 unsigned int nargs
, ix
;
17783 gcc_assert (decl
!= DECL_TEMPLATE_RESULT (fn
));
17785 /* Never do unification on the 'this' parameter. */
17786 decl_arg_types
= skip_artificial_parms_for (decl
,
17787 TYPE_ARG_TYPES (decl_type
));
17789 nargs
= list_length (decl_arg_types
);
17790 args
= XALLOCAVEC (tree
, nargs
);
17791 for (arg
= decl_arg_types
, ix
= 0;
17792 arg
!= NULL_TREE
&& arg
!= void_list_node
;
17793 arg
= TREE_CHAIN (arg
), ++ix
)
17794 args
[ix
] = TREE_VALUE (arg
);
17796 if (fn_type_unification (fn
, explicit_args
, targs
,
17798 (check_rettype
|| DECL_CONV_FN_P (fn
)
17799 ? TREE_TYPE (decl_type
) : NULL_TREE
),
17800 DEDUCE_EXACT
, LOOKUP_NORMAL
, /*explain_p=*/false,
17802 == error_mark_node
)
17808 /* Return the innermost template arguments that, when applied to a partial
17809 specialization of MAIN_TMPL whose innermost template parameters are
17810 TPARMS, and whose specialization arguments are SPEC_ARGS, yield the
17813 For example, suppose we have:
17815 template <class T, class U> struct S {};
17816 template <class T> struct S<T*, int> {};
17818 Then, suppose we want to get `S<double*, int>'. The TPARMS will be
17819 {T}, the SPEC_ARGS will be {T*, int} and the ARGS will be {double*,
17820 int}. The resulting vector will be {double}, indicating that `T'
17821 is bound to `double'. */
17824 get_class_bindings (tree main_tmpl
, tree tparms
, tree spec_args
, tree args
)
17826 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
17828 tree innermost_deduced_args
;
17830 innermost_deduced_args
= make_tree_vec (ntparms
);
17831 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
17833 deduced_args
= copy_node (args
);
17834 SET_TMPL_ARGS_LEVEL (deduced_args
,
17835 TMPL_ARGS_DEPTH (deduced_args
),
17836 innermost_deduced_args
);
17839 deduced_args
= innermost_deduced_args
;
17841 if (unify (tparms
, deduced_args
,
17842 INNERMOST_TEMPLATE_ARGS (spec_args
),
17843 INNERMOST_TEMPLATE_ARGS (args
),
17844 UNIFY_ALLOW_NONE
, /*explain_p=*/false))
17847 for (i
= 0; i
< ntparms
; ++i
)
17848 if (! TREE_VEC_ELT (innermost_deduced_args
, i
))
17851 /* Verify that nondeduced template arguments agree with the type
17852 obtained from argument deduction.
17856 struct A { typedef int X; };
17857 template <class T, class U> struct C {};
17858 template <class T> struct C<T, typename T::X> {};
17860 Then with the instantiation `C<A, int>', we can deduce that
17861 `T' is `A' but unify () does not check whether `typename T::X'
17863 spec_args
= tsubst (spec_args
, deduced_args
, tf_none
, NULL_TREE
);
17864 spec_args
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (main_tmpl
),
17865 spec_args
, main_tmpl
,
17866 tf_none
, false, false);
17867 if (spec_args
== error_mark_node
17868 /* We only need to check the innermost arguments; the other
17869 arguments will always agree. */
17870 || !comp_template_args (INNERMOST_TEMPLATE_ARGS (spec_args
),
17871 INNERMOST_TEMPLATE_ARGS (args
)))
17874 /* Now that we have bindings for all of the template arguments,
17875 ensure that the arguments deduced for the template template
17876 parameters have compatible template parameter lists. See the use
17877 of template_template_parm_bindings_ok_p in fn_type_unification
17878 for more information. */
17879 if (!template_template_parm_bindings_ok_p (tparms
, deduced_args
))
17882 return deduced_args
;
17885 /* TEMPLATES is a TREE_LIST. Each TREE_VALUE is a TEMPLATE_DECL.
17886 Return the TREE_LIST node with the most specialized template, if
17887 any. If there is no most specialized template, the error_mark_node
17890 Note that this function does not look at, or modify, the
17891 TREE_PURPOSE or TREE_TYPE of any of the nodes. Since the node
17892 returned is one of the elements of INSTANTIATIONS, callers may
17893 store information in the TREE_PURPOSE or TREE_TYPE of the nodes,
17894 and retrieve it from the value returned. */
17897 most_specialized_instantiation (tree templates
)
17901 ++processing_template_decl
;
17904 for (fn
= TREE_CHAIN (templates
); fn
; fn
= TREE_CHAIN (fn
))
17908 if (get_bindings (TREE_VALUE (champ
),
17909 DECL_TEMPLATE_RESULT (TREE_VALUE (fn
)),
17910 NULL_TREE
, /*check_ret=*/true))
17913 if (get_bindings (TREE_VALUE (fn
),
17914 DECL_TEMPLATE_RESULT (TREE_VALUE (champ
)),
17915 NULL_TREE
, /*check_ret=*/true))
17922 /* Equally specialized, move to next function. If there
17923 is no next function, nothing's most specialized. */
17924 fn
= TREE_CHAIN (fn
);
17932 /* Now verify that champ is better than everything earlier in the
17933 instantiation list. */
17934 for (fn
= templates
; fn
!= champ
; fn
= TREE_CHAIN (fn
))
17935 if (get_bindings (TREE_VALUE (champ
),
17936 DECL_TEMPLATE_RESULT (TREE_VALUE (fn
)),
17937 NULL_TREE
, /*check_ret=*/true)
17938 || !get_bindings (TREE_VALUE (fn
),
17939 DECL_TEMPLATE_RESULT (TREE_VALUE (champ
)),
17940 NULL_TREE
, /*check_ret=*/true))
17946 processing_template_decl
--;
17949 return error_mark_node
;
17954 /* If DECL is a specialization of some template, return the most
17955 general such template. Otherwise, returns NULL_TREE.
17957 For example, given:
17959 template <class T> struct S { template <class U> void f(U); };
17961 if TMPL is `template <class U> void S<int>::f(U)' this will return
17962 the full template. This function will not trace past partial
17963 specializations, however. For example, given in addition:
17965 template <class T> struct S<T*> { template <class U> void f(U); };
17967 if TMPL is `template <class U> void S<int*>::f(U)' this will return
17968 `template <class T> template <class U> S<T*>::f(U)'. */
17971 most_general_template (tree decl
)
17973 /* If DECL is a FUNCTION_DECL, find the TEMPLATE_DECL of which it is
17974 an immediate specialization. */
17975 if (TREE_CODE (decl
) == FUNCTION_DECL
)
17977 if (DECL_TEMPLATE_INFO (decl
)) {
17978 decl
= DECL_TI_TEMPLATE (decl
);
17980 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE for a
17981 template friend. */
17982 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
17988 /* Look for more and more general templates. */
17989 while (DECL_TEMPLATE_INFO (decl
))
17991 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE in some cases.
17992 (See cp-tree.h for details.) */
17993 if (TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
17996 if (CLASS_TYPE_P (TREE_TYPE (decl
))
17997 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)))
18000 /* Stop if we run into an explicitly specialized class template. */
18001 if (!DECL_NAMESPACE_SCOPE_P (decl
)
18002 && DECL_CONTEXT (decl
)
18003 && CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (decl
)))
18006 decl
= DECL_TI_TEMPLATE (decl
);
18012 /* Return the most specialized of the class template partial
18013 specializations of TMPL which can produce TYPE, a specialization of
18014 TMPL. The value returned is actually a TREE_LIST; the TREE_TYPE is
18015 a _TYPE node corresponding to the partial specialization, while the
18016 TREE_PURPOSE is the set of template arguments that must be
18017 substituted into the TREE_TYPE in order to generate TYPE.
18019 If the choice of partial specialization is ambiguous, a diagnostic
18020 is issued, and the error_mark_node is returned. If there are no
18021 partial specializations of TMPL matching TYPE, then NULL_TREE is
18025 most_specialized_class (tree type
, tree tmpl
, tsubst_flags_t complain
)
18027 tree list
= NULL_TREE
;
18033 tree outer_args
= NULL_TREE
;
18035 tmpl
= most_general_template (tmpl
);
18036 args
= CLASSTYPE_TI_ARGS (type
);
18038 /* For determining which partial specialization to use, only the
18039 innermost args are interesting. */
18040 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
18042 outer_args
= strip_innermost_template_args (args
, 1);
18043 args
= INNERMOST_TEMPLATE_ARGS (args
);
18046 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
); t
; t
= TREE_CHAIN (t
))
18048 tree partial_spec_args
;
18050 tree parms
= TREE_VALUE (t
);
18052 partial_spec_args
= CLASSTYPE_TI_ARGS (TREE_TYPE (t
));
18054 ++processing_template_decl
;
18060 /* Discard the outer levels of args, and then substitute in the
18061 template args from the enclosing class. */
18062 partial_spec_args
= INNERMOST_TEMPLATE_ARGS (partial_spec_args
);
18063 partial_spec_args
= tsubst_template_args
18064 (partial_spec_args
, outer_args
, tf_none
, NULL_TREE
);
18066 /* PARMS already refers to just the innermost parms, but the
18067 template parms in partial_spec_args had their levels lowered
18068 by tsubst, so we need to do the same for the parm list. We
18069 can't just tsubst the TREE_VEC itself, as tsubst wants to
18070 treat a TREE_VEC as an argument vector. */
18071 parms
= copy_node (parms
);
18072 for (i
= TREE_VEC_LENGTH (parms
) - 1; i
>= 0; --i
)
18073 TREE_VEC_ELT (parms
, i
) =
18074 tsubst (TREE_VEC_ELT (parms
, i
), outer_args
, tf_none
, NULL_TREE
);
18078 partial_spec_args
=
18079 coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
18080 add_to_template_args (outer_args
,
18081 partial_spec_args
),
18083 /*require_all_args=*/true,
18084 /*use_default_args=*/true);
18086 --processing_template_decl
;
18088 if (partial_spec_args
== error_mark_node
)
18089 return error_mark_node
;
18091 spec_args
= get_class_bindings (tmpl
, parms
,
18097 spec_args
= add_to_template_args (outer_args
, spec_args
);
18098 list
= tree_cons (spec_args
, TREE_VALUE (t
), list
);
18099 TREE_TYPE (list
) = TREE_TYPE (t
);
18106 ambiguous_p
= false;
18109 t
= TREE_CHAIN (t
);
18110 for (; t
; t
= TREE_CHAIN (t
))
18112 fate
= more_specialized_class (tmpl
, champ
, t
);
18119 t
= TREE_CHAIN (t
);
18122 ambiguous_p
= true;
18131 for (t
= list
; t
&& t
!= champ
; t
= TREE_CHAIN (t
))
18133 fate
= more_specialized_class (tmpl
, champ
, t
);
18136 ambiguous_p
= true;
18144 char *spaces
= NULL
;
18145 if (!(complain
& tf_error
))
18146 return error_mark_node
;
18147 error ("ambiguous class template instantiation for %q#T", type
);
18148 str
= ngettext ("candidate is:", "candidates are:", list_length (list
));
18149 for (t
= list
; t
; t
= TREE_CHAIN (t
))
18151 error ("%s %+#T", spaces
? spaces
: str
, TREE_TYPE (t
));
18152 spaces
= spaces
? spaces
: get_spaces (str
);
18155 return error_mark_node
;
18161 /* Explicitly instantiate DECL. */
18164 do_decl_instantiation (tree decl
, tree storage
)
18166 tree result
= NULL_TREE
;
18169 if (!decl
|| decl
== error_mark_node
)
18170 /* An error occurred, for which grokdeclarator has already issued
18171 an appropriate message. */
18173 else if (! DECL_LANG_SPECIFIC (decl
))
18175 error ("explicit instantiation of non-template %q#D", decl
);
18178 else if (VAR_P (decl
))
18180 /* There is an asymmetry here in the way VAR_DECLs and
18181 FUNCTION_DECLs are handled by grokdeclarator. In the case of
18182 the latter, the DECL we get back will be marked as a
18183 template instantiation, and the appropriate
18184 DECL_TEMPLATE_INFO will be set up. This does not happen for
18185 VAR_DECLs so we do the lookup here. Probably, grokdeclarator
18186 should handle VAR_DECLs as it currently handles
18188 if (!DECL_CLASS_SCOPE_P (decl
))
18190 error ("%qD is not a static data member of a class template", decl
);
18193 result
= lookup_field (DECL_CONTEXT (decl
), DECL_NAME (decl
), 0, false);
18194 if (!result
|| !VAR_P (result
))
18196 error ("no matching template for %qD found", decl
);
18199 if (!same_type_p (TREE_TYPE (result
), TREE_TYPE (decl
)))
18201 error ("type %qT for explicit instantiation %qD does not match "
18202 "declared type %qT", TREE_TYPE (result
), decl
,
18207 else if (TREE_CODE (decl
) != FUNCTION_DECL
)
18209 error ("explicit instantiation of %q#D", decl
);
18215 /* Check for various error cases. Note that if the explicit
18216 instantiation is valid the RESULT will currently be marked as an
18217 *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set
18218 until we get here. */
18220 if (DECL_TEMPLATE_SPECIALIZATION (result
))
18222 /* DR 259 [temp.spec].
18224 Both an explicit instantiation and a declaration of an explicit
18225 specialization shall not appear in a program unless the explicit
18226 instantiation follows a declaration of the explicit specialization.
18228 For a given set of template parameters, if an explicit
18229 instantiation of a template appears after a declaration of an
18230 explicit specialization for that template, the explicit
18231 instantiation has no effect. */
18234 else if (DECL_EXPLICIT_INSTANTIATION (result
))
18238 No program shall explicitly instantiate any template more
18241 We check DECL_NOT_REALLY_EXTERN so as not to complain when
18242 the first instantiation was `extern' and the second is not,
18243 and EXTERN_P for the opposite case. */
18244 if (DECL_NOT_REALLY_EXTERN (result
) && !extern_p
)
18245 permerror (input_location
, "duplicate explicit instantiation of %q#D", result
);
18246 /* If an "extern" explicit instantiation follows an ordinary
18247 explicit instantiation, the template is instantiated. */
18251 else if (!DECL_IMPLICIT_INSTANTIATION (result
))
18253 error ("no matching template for %qD found", result
);
18256 else if (!DECL_TEMPLATE_INFO (result
))
18258 permerror (input_location
, "explicit instantiation of non-template %q#D", result
);
18262 if (storage
== NULL_TREE
)
18264 else if (storage
== ridpointers
[(int) RID_EXTERN
])
18266 if (!in_system_header
&& (cxx_dialect
== cxx98
))
18267 pedwarn (input_location
, OPT_Wpedantic
,
18268 "ISO C++ 1998 forbids the use of %<extern%> on explicit "
18273 error ("storage class %qD applied to template instantiation", storage
);
18275 check_explicit_instantiation_namespace (result
);
18276 mark_decl_instantiated (result
, extern_p
);
18278 instantiate_decl (result
, /*defer_ok=*/1,
18279 /*expl_inst_class_mem_p=*/false);
18283 mark_class_instantiated (tree t
, int extern_p
)
18285 SET_CLASSTYPE_EXPLICIT_INSTANTIATION (t
);
18286 SET_CLASSTYPE_INTERFACE_KNOWN (t
);
18287 CLASSTYPE_INTERFACE_ONLY (t
) = extern_p
;
18288 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (t
)) = extern_p
;
18291 CLASSTYPE_DEBUG_REQUESTED (t
) = 1;
18292 rest_of_type_compilation (t
, 1);
18296 /* Called from do_type_instantiation through binding_table_foreach to
18297 do recursive instantiation for the type bound in ENTRY. */
18299 bt_instantiate_type_proc (binding_entry entry
, void *data
)
18301 tree storage
= *(tree
*) data
;
18303 if (MAYBE_CLASS_TYPE_P (entry
->type
)
18304 && !uses_template_parms (CLASSTYPE_TI_ARGS (entry
->type
)))
18305 do_type_instantiation (TYPE_MAIN_DECL (entry
->type
), storage
, 0);
18308 /* Called from do_type_instantiation to instantiate a member
18309 (a member function or a static member variable) of an
18310 explicitly instantiated class template. */
18312 instantiate_class_member (tree decl
, int extern_p
)
18314 mark_decl_instantiated (decl
, extern_p
);
18316 instantiate_decl (decl
, /*defer_ok=*/1,
18317 /*expl_inst_class_mem_p=*/true);
18320 /* Perform an explicit instantiation of template class T. STORAGE, if
18321 non-null, is the RID for extern, inline or static. COMPLAIN is
18322 nonzero if this is called from the parser, zero if called recursively,
18323 since the standard is unclear (as detailed below). */
18326 do_type_instantiation (tree t
, tree storage
, tsubst_flags_t complain
)
18331 int previous_instantiation_extern_p
= 0;
18333 if (TREE_CODE (t
) == TYPE_DECL
)
18336 if (! CLASS_TYPE_P (t
) || ! CLASSTYPE_TEMPLATE_INFO (t
))
18339 (TYPE_TEMPLATE_INFO (t
)) ? TYPE_TI_TEMPLATE (t
) : NULL
;
18341 error ("explicit instantiation of non-class template %qD", tmpl
);
18343 error ("explicit instantiation of non-template type %qT", t
);
18349 if (!COMPLETE_TYPE_P (t
))
18351 if (complain
& tf_error
)
18352 error ("explicit instantiation of %q#T before definition of template",
18357 if (storage
!= NULL_TREE
)
18359 if (!in_system_header
)
18361 if (storage
== ridpointers
[(int) RID_EXTERN
])
18363 if (cxx_dialect
== cxx98
)
18364 pedwarn (input_location
, OPT_Wpedantic
,
18365 "ISO C++ 1998 forbids the use of %<extern%> on "
18366 "explicit instantiations");
18369 pedwarn (input_location
, OPT_Wpedantic
,
18370 "ISO C++ forbids the use of %qE"
18371 " on explicit instantiations", storage
);
18374 if (storage
== ridpointers
[(int) RID_INLINE
])
18376 else if (storage
== ridpointers
[(int) RID_EXTERN
])
18378 else if (storage
== ridpointers
[(int) RID_STATIC
])
18382 error ("storage class %qD applied to template instantiation",
18388 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
18390 /* DR 259 [temp.spec].
18392 Both an explicit instantiation and a declaration of an explicit
18393 specialization shall not appear in a program unless the explicit
18394 instantiation follows a declaration of the explicit specialization.
18396 For a given set of template parameters, if an explicit
18397 instantiation of a template appears after a declaration of an
18398 explicit specialization for that template, the explicit
18399 instantiation has no effect. */
18402 else if (CLASSTYPE_EXPLICIT_INSTANTIATION (t
))
18406 No program shall explicitly instantiate any template more
18409 If PREVIOUS_INSTANTIATION_EXTERN_P, then the first explicit
18410 instantiation was `extern'. If EXTERN_P then the second is.
18411 These cases are OK. */
18412 previous_instantiation_extern_p
= CLASSTYPE_INTERFACE_ONLY (t
);
18414 if (!previous_instantiation_extern_p
&& !extern_p
18415 && (complain
& tf_error
))
18416 permerror (input_location
, "duplicate explicit instantiation of %q#T", t
);
18418 /* If we've already instantiated the template, just return now. */
18419 if (!CLASSTYPE_INTERFACE_ONLY (t
))
18423 check_explicit_instantiation_namespace (TYPE_NAME (t
));
18424 mark_class_instantiated (t
, extern_p
);
18432 /* In contrast to implicit instantiation, where only the
18433 declarations, and not the definitions, of members are
18434 instantiated, we have here:
18438 The explicit instantiation of a class template specialization
18439 implies the instantiation of all of its members not
18440 previously explicitly specialized in the translation unit
18441 containing the explicit instantiation.
18443 Of course, we can't instantiate member template classes, since
18444 we don't have any arguments for them. Note that the standard
18445 is unclear on whether the instantiation of the members are
18446 *explicit* instantiations or not. However, the most natural
18447 interpretation is that it should be an explicit instantiation. */
18450 for (tmp
= TYPE_METHODS (t
); tmp
; tmp
= DECL_CHAIN (tmp
))
18451 if (TREE_CODE (tmp
) == FUNCTION_DECL
18452 && DECL_TEMPLATE_INSTANTIATION (tmp
))
18453 instantiate_class_member (tmp
, extern_p
);
18455 for (tmp
= TYPE_FIELDS (t
); tmp
; tmp
= DECL_CHAIN (tmp
))
18456 if (VAR_P (tmp
) && DECL_TEMPLATE_INSTANTIATION (tmp
))
18457 instantiate_class_member (tmp
, extern_p
);
18459 if (CLASSTYPE_NESTED_UTDS (t
))
18460 binding_table_foreach (CLASSTYPE_NESTED_UTDS (t
),
18461 bt_instantiate_type_proc
, &storage
);
18465 /* Given a function DECL, which is a specialization of TMPL, modify
18466 DECL to be a re-instantiation of TMPL with the same template
18467 arguments. TMPL should be the template into which tsubst'ing
18468 should occur for DECL, not the most general template.
18470 One reason for doing this is a scenario like this:
18473 void f(const T&, int i);
18475 void g() { f(3, 7); }
18478 void f(const T& t, const int i) { }
18480 Note that when the template is first instantiated, with
18481 instantiate_template, the resulting DECL will have no name for the
18482 first parameter, and the wrong type for the second. So, when we go
18483 to instantiate the DECL, we regenerate it. */
18486 regenerate_decl_from_template (tree decl
, tree tmpl
)
18488 /* The arguments used to instantiate DECL, from the most general
18493 args
= DECL_TI_ARGS (decl
);
18494 code_pattern
= DECL_TEMPLATE_RESULT (tmpl
);
18496 /* Make sure that we can see identifiers, and compute access
18498 push_access_scope (decl
);
18500 if (TREE_CODE (decl
) == FUNCTION_DECL
)
18508 args_depth
= TMPL_ARGS_DEPTH (args
);
18509 parms_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
18510 if (args_depth
> parms_depth
)
18511 args
= get_innermost_template_args (args
, parms_depth
);
18513 specs
= tsubst_exception_specification (TREE_TYPE (code_pattern
),
18514 args
, tf_error
, NULL_TREE
,
18515 /*defer_ok*/false);
18516 if (specs
&& specs
!= error_mark_node
)
18517 TREE_TYPE (decl
) = build_exception_variant (TREE_TYPE (decl
),
18520 /* Merge parameter declarations. */
18521 decl_parm
= skip_artificial_parms_for (decl
,
18522 DECL_ARGUMENTS (decl
));
18524 = skip_artificial_parms_for (code_pattern
,
18525 DECL_ARGUMENTS (code_pattern
));
18526 while (decl_parm
&& !FUNCTION_PARAMETER_PACK_P (pattern_parm
))
18531 if (DECL_NAME (decl_parm
) != DECL_NAME (pattern_parm
))
18532 DECL_NAME (decl_parm
) = DECL_NAME (pattern_parm
);
18533 parm_type
= tsubst (TREE_TYPE (pattern_parm
), args
, tf_error
,
18535 parm_type
= type_decays_to (parm_type
);
18536 if (!same_type_p (TREE_TYPE (decl_parm
), parm_type
))
18537 TREE_TYPE (decl_parm
) = parm_type
;
18538 attributes
= DECL_ATTRIBUTES (pattern_parm
);
18539 if (DECL_ATTRIBUTES (decl_parm
) != attributes
)
18541 DECL_ATTRIBUTES (decl_parm
) = attributes
;
18542 cplus_decl_attributes (&decl_parm
, attributes
, /*flags=*/0);
18544 decl_parm
= DECL_CHAIN (decl_parm
);
18545 pattern_parm
= DECL_CHAIN (pattern_parm
);
18547 /* Merge any parameters that match with the function parameter
18549 if (pattern_parm
&& FUNCTION_PARAMETER_PACK_P (pattern_parm
))
18552 tree expanded_types
;
18553 /* Expand the TYPE_PACK_EXPANSION that provides the types for
18554 the parameters in this function parameter pack. */
18555 expanded_types
= tsubst_pack_expansion (TREE_TYPE (pattern_parm
),
18556 args
, tf_error
, NULL_TREE
);
18557 len
= TREE_VEC_LENGTH (expanded_types
);
18558 for (i
= 0; i
< len
; i
++)
18563 if (DECL_NAME (decl_parm
) != DECL_NAME (pattern_parm
))
18564 /* Rename the parameter to include the index. */
18565 DECL_NAME (decl_parm
) =
18566 make_ith_pack_parameter_name (DECL_NAME (pattern_parm
), i
);
18567 parm_type
= TREE_VEC_ELT (expanded_types
, i
);
18568 parm_type
= type_decays_to (parm_type
);
18569 if (!same_type_p (TREE_TYPE (decl_parm
), parm_type
))
18570 TREE_TYPE (decl_parm
) = parm_type
;
18571 attributes
= DECL_ATTRIBUTES (pattern_parm
);
18572 if (DECL_ATTRIBUTES (decl_parm
) != attributes
)
18574 DECL_ATTRIBUTES (decl_parm
) = attributes
;
18575 cplus_decl_attributes (&decl_parm
, attributes
, /*flags=*/0);
18577 decl_parm
= DECL_CHAIN (decl_parm
);
18580 /* Merge additional specifiers from the CODE_PATTERN. */
18581 if (DECL_DECLARED_INLINE_P (code_pattern
)
18582 && !DECL_DECLARED_INLINE_P (decl
))
18583 DECL_DECLARED_INLINE_P (decl
) = 1;
18585 else if (VAR_P (decl
))
18587 DECL_INITIAL (decl
) =
18588 tsubst_expr (DECL_INITIAL (code_pattern
), args
,
18589 tf_error
, DECL_TI_TEMPLATE (decl
),
18590 /*integral_constant_expression_p=*/false);
18591 if (VAR_HAD_UNKNOWN_BOUND (decl
))
18592 TREE_TYPE (decl
) = tsubst (TREE_TYPE (code_pattern
), args
,
18593 tf_error
, DECL_TI_TEMPLATE (decl
));
18596 gcc_unreachable ();
18598 pop_access_scope (decl
);
18601 /* Return the TEMPLATE_DECL into which DECL_TI_ARGS(DECL) should be
18602 substituted to get DECL. */
18605 template_for_substitution (tree decl
)
18607 tree tmpl
= DECL_TI_TEMPLATE (decl
);
18609 /* Set TMPL to the template whose DECL_TEMPLATE_RESULT is the pattern
18610 for the instantiation. This is not always the most general
18611 template. Consider, for example:
18614 struct S { template <class U> void f();
18615 template <> void f<int>(); };
18617 and an instantiation of S<double>::f<int>. We want TD to be the
18618 specialization S<T>::f<int>, not the more general S<T>::f<U>. */
18619 while (/* An instantiation cannot have a definition, so we need a
18620 more general template. */
18621 DECL_TEMPLATE_INSTANTIATION (tmpl
)
18622 /* We must also deal with friend templates. Given:
18624 template <class T> struct S {
18625 template <class U> friend void f() {};
18628 S<int>::f<U> say, is not an instantiation of S<T>::f<U>,
18629 so far as the language is concerned, but that's still
18630 where we get the pattern for the instantiation from. On
18631 other hand, if the definition comes outside the class, say:
18633 template <class T> struct S {
18634 template <class U> friend void f();
18636 template <class U> friend void f() {}
18638 we don't need to look any further. That's what the check for
18639 DECL_INITIAL is for. */
18640 || (TREE_CODE (decl
) == FUNCTION_DECL
18641 && DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (tmpl
)
18642 && !DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl
))))
18644 /* The present template, TD, should not be a definition. If it
18645 were a definition, we should be using it! Note that we
18646 cannot restructure the loop to just keep going until we find
18647 a template with a definition, since that might go too far if
18648 a specialization was declared, but not defined. */
18649 gcc_assert (!VAR_P (decl
)
18650 || DECL_IN_AGGR_P (DECL_TEMPLATE_RESULT (tmpl
)));
18652 /* Fetch the more general template. */
18653 tmpl
= DECL_TI_TEMPLATE (tmpl
);
18659 /* Returns true if we need to instantiate this template instance even if we
18660 know we aren't going to emit it.. */
18663 always_instantiate_p (tree decl
)
18665 /* We always instantiate inline functions so that we can inline them. An
18666 explicit instantiation declaration prohibits implicit instantiation of
18667 non-inline functions. With high levels of optimization, we would
18668 normally inline non-inline functions -- but we're not allowed to do
18669 that for "extern template" functions. Therefore, we check
18670 DECL_DECLARED_INLINE_P, rather than possibly_inlined_p. */
18671 return ((TREE_CODE (decl
) == FUNCTION_DECL
18672 && (DECL_DECLARED_INLINE_P (decl
)
18673 || type_uses_auto (TREE_TYPE (TREE_TYPE (decl
)))))
18674 /* And we need to instantiate static data members so that
18675 their initializers are available in integral constant
18678 && decl_maybe_constant_var_p (decl
)));
18681 /* If FN has a noexcept-specifier that hasn't been instantiated yet,
18682 instantiate it now, modifying TREE_TYPE (fn). */
18685 maybe_instantiate_noexcept (tree fn
)
18687 tree fntype
, spec
, noex
, clone
;
18689 if (DECL_CLONED_FUNCTION_P (fn
))
18690 fn
= DECL_CLONED_FUNCTION (fn
);
18691 fntype
= TREE_TYPE (fn
);
18692 spec
= TYPE_RAISES_EXCEPTIONS (fntype
);
18694 if (!DEFERRED_NOEXCEPT_SPEC_P (spec
))
18697 noex
= TREE_PURPOSE (spec
);
18699 if (TREE_CODE (noex
) == DEFERRED_NOEXCEPT
)
18701 if (push_tinst_level (fn
))
18703 push_access_scope (fn
);
18704 push_deferring_access_checks (dk_no_deferred
);
18705 input_location
= DECL_SOURCE_LOCATION (fn
);
18706 noex
= tsubst_copy_and_build (DEFERRED_NOEXCEPT_PATTERN (noex
),
18707 DEFERRED_NOEXCEPT_ARGS (noex
),
18708 tf_warning_or_error
, fn
,
18709 /*function_p=*/false,
18710 /*integral_constant_expression_p=*/true);
18711 pop_deferring_access_checks ();
18712 pop_access_scope (fn
);
18713 pop_tinst_level ();
18714 spec
= build_noexcept_spec (noex
, tf_warning_or_error
);
18715 if (spec
== error_mark_node
)
18716 spec
= noexcept_false_spec
;
18719 spec
= noexcept_false_spec
;
18723 /* This is an implicitly declared function, so NOEX is a list of
18724 other functions to evaluate and merge. */
18726 spec
= noexcept_true_spec
;
18727 for (elt
= noex
; elt
; elt
= OVL_NEXT (elt
))
18729 tree fn
= OVL_CURRENT (elt
);
18731 maybe_instantiate_noexcept (fn
);
18732 subspec
= TYPE_RAISES_EXCEPTIONS (TREE_TYPE (fn
));
18733 spec
= merge_exception_specifiers (spec
, subspec
, NULL_TREE
);
18737 TREE_TYPE (fn
) = build_exception_variant (fntype
, spec
);
18739 FOR_EACH_CLONE (clone
, fn
)
18741 if (TREE_TYPE (clone
) == fntype
)
18742 TREE_TYPE (clone
) = TREE_TYPE (fn
);
18744 TREE_TYPE (clone
) = build_exception_variant (TREE_TYPE (clone
), spec
);
18748 /* Produce the definition of D, a _DECL generated from a template. If
18749 DEFER_OK is nonzero, then we don't have to actually do the
18750 instantiation now; we just have to do it sometime. Normally it is
18751 an error if this is an explicit instantiation but D is undefined.
18752 EXPL_INST_CLASS_MEM_P is true iff D is a member of an
18753 explicitly instantiated class template. */
18756 instantiate_decl (tree d
, int defer_ok
,
18757 bool expl_inst_class_mem_p
)
18759 tree tmpl
= DECL_TI_TEMPLATE (d
);
18766 bool pattern_defined
;
18767 location_t saved_loc
= input_location
;
18772 /* This function should only be used to instantiate templates for
18773 functions and static member variables. */
18774 gcc_assert (VAR_OR_FUNCTION_DECL_P (d
));
18776 /* Variables are never deferred; if instantiation is required, they
18777 are instantiated right away. That allows for better code in the
18778 case that an expression refers to the value of the variable --
18779 if the variable has a constant value the referring expression can
18780 take advantage of that fact. */
18782 || DECL_DECLARED_CONSTEXPR_P (d
))
18785 /* Don't instantiate cloned functions. Instead, instantiate the
18786 functions they cloned. */
18787 if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_CLONED_FUNCTION_P (d
))
18788 d
= DECL_CLONED_FUNCTION (d
);
18790 if (DECL_TEMPLATE_INSTANTIATED (d
)
18791 || (TREE_CODE (d
) == FUNCTION_DECL
18792 && DECL_DEFAULTED_FN (d
) && DECL_INITIAL (d
))
18793 || DECL_TEMPLATE_SPECIALIZATION (d
))
18794 /* D has already been instantiated or explicitly specialized, so
18795 there's nothing for us to do here.
18797 It might seem reasonable to check whether or not D is an explicit
18798 instantiation, and, if so, stop here. But when an explicit
18799 instantiation is deferred until the end of the compilation,
18800 DECL_EXPLICIT_INSTANTIATION is set, even though we still need to do
18801 the instantiation. */
18804 /* Check to see whether we know that this template will be
18805 instantiated in some other file, as with "extern template"
18807 external_p
= (DECL_INTERFACE_KNOWN (d
) && DECL_REALLY_EXTERN (d
));
18809 /* In general, we do not instantiate such templates. */
18810 if (external_p
&& !always_instantiate_p (d
))
18813 gen_tmpl
= most_general_template (tmpl
);
18814 gen_args
= DECL_TI_ARGS (d
);
18816 if (tmpl
!= gen_tmpl
)
18817 /* We should already have the extra args. */
18818 gcc_assert (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (gen_tmpl
))
18819 == TMPL_ARGS_DEPTH (gen_args
));
18820 /* And what's in the hash table should match D. */
18821 gcc_assert ((spec
= retrieve_specialization (gen_tmpl
, gen_args
, 0)) == d
18822 || spec
== NULL_TREE
);
18824 /* This needs to happen before any tsubsting. */
18825 if (! push_tinst_level (d
))
18828 timevar_push (TV_TEMPLATE_INST
);
18830 /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern
18831 for the instantiation. */
18832 td
= template_for_substitution (d
);
18833 code_pattern
= DECL_TEMPLATE_RESULT (td
);
18835 /* We should never be trying to instantiate a member of a class
18836 template or partial specialization. */
18837 gcc_assert (d
!= code_pattern
);
18839 if ((DECL_NAMESPACE_SCOPE_P (d
) && !DECL_INITIALIZED_IN_CLASS_P (d
))
18840 || DECL_TEMPLATE_SPECIALIZATION (td
))
18841 /* In the case of a friend template whose definition is provided
18842 outside the class, we may have too many arguments. Drop the
18843 ones we don't need. The same is true for specializations. */
18844 args
= get_innermost_template_args
18845 (gen_args
, TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (td
)));
18849 if (TREE_CODE (d
) == FUNCTION_DECL
)
18850 pattern_defined
= (DECL_SAVED_TREE (code_pattern
) != NULL_TREE
18851 || DECL_DEFAULTED_OUTSIDE_CLASS_P (code_pattern
));
18853 pattern_defined
= ! DECL_IN_AGGR_P (code_pattern
);
18855 /* We may be in the middle of deferred access check. Disable it now. */
18856 push_deferring_access_checks (dk_no_deferred
);
18858 /* Unless an explicit instantiation directive has already determined
18859 the linkage of D, remember that a definition is available for
18861 if (pattern_defined
18862 && !DECL_INTERFACE_KNOWN (d
)
18863 && !DECL_NOT_REALLY_EXTERN (d
))
18864 mark_definable (d
);
18866 DECL_SOURCE_LOCATION (td
) = DECL_SOURCE_LOCATION (code_pattern
);
18867 DECL_SOURCE_LOCATION (d
) = DECL_SOURCE_LOCATION (code_pattern
);
18868 input_location
= DECL_SOURCE_LOCATION (d
);
18870 /* If D is a member of an explicitly instantiated class template,
18871 and no definition is available, treat it like an implicit
18873 if (!pattern_defined
&& expl_inst_class_mem_p
18874 && DECL_EXPLICIT_INSTANTIATION (d
))
18876 /* Leave linkage flags alone on instantiations with anonymous
18878 if (TREE_PUBLIC (d
))
18880 DECL_NOT_REALLY_EXTERN (d
) = 0;
18881 DECL_INTERFACE_KNOWN (d
) = 0;
18883 SET_DECL_IMPLICIT_INSTANTIATION (d
);
18886 if (TREE_CODE (d
) == FUNCTION_DECL
)
18887 maybe_instantiate_noexcept (d
);
18889 /* Defer all other templates, unless we have been explicitly
18890 forbidden from doing so. */
18891 if (/* If there is no definition, we cannot instantiate the
18894 /* If it's OK to postpone instantiation, do so. */
18896 /* If this is a static data member that will be defined
18897 elsewhere, we don't want to instantiate the entire data
18898 member, but we do want to instantiate the initializer so that
18899 we can substitute that elsewhere. */
18900 || (external_p
&& VAR_P (d
)))
18902 /* The definition of the static data member is now required so
18903 we must substitute the initializer. */
18905 && !DECL_INITIAL (d
)
18906 && DECL_INITIAL (code_pattern
))
18910 bool const_init
= false;
18912 ns
= decl_namespace_context (d
);
18913 push_nested_namespace (ns
);
18914 push_nested_class (DECL_CONTEXT (d
));
18915 init
= tsubst_expr (DECL_INITIAL (code_pattern
),
18917 tf_warning_or_error
, NULL_TREE
,
18918 /*integral_constant_expression_p=*/false);
18919 /* Make sure the initializer is still constant, in case of
18920 circular dependency (template/instantiate6.C). */
18922 = DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (code_pattern
);
18923 cp_finish_decl (d
, init
, /*init_const_expr_p=*/const_init
,
18924 /*asmspec_tree=*/NULL_TREE
,
18925 LOOKUP_ONLYCONVERTING
);
18926 pop_nested_class ();
18927 pop_nested_namespace (ns
);
18930 /* We restore the source position here because it's used by
18931 add_pending_template. */
18932 input_location
= saved_loc
;
18934 if (at_eof
&& !pattern_defined
18935 && DECL_EXPLICIT_INSTANTIATION (d
)
18936 && DECL_NOT_REALLY_EXTERN (d
))
18939 The definition of a non-exported function template, a
18940 non-exported member function template, or a non-exported
18941 member function or static data member of a class template
18942 shall be present in every translation unit in which it is
18943 explicitly instantiated. */
18944 permerror (input_location
, "explicit instantiation of %qD "
18945 "but no definition available", d
);
18947 /* If we're in unevaluated context, we just wanted to get the
18948 constant value; this isn't an odr use, so don't queue
18949 a full instantiation. */
18950 if (cp_unevaluated_operand
!= 0)
18952 /* ??? Historically, we have instantiated inline functions, even
18953 when marked as "extern template". */
18954 if (!(external_p
&& VAR_P (d
)))
18955 add_pending_template (d
);
18958 /* Tell the repository that D is available in this translation unit
18959 -- and see if it is supposed to be instantiated here. */
18960 if (TREE_PUBLIC (d
) && !DECL_REALLY_EXTERN (d
) && !repo_emit_p (d
))
18962 /* In a PCH file, despite the fact that the repository hasn't
18963 requested instantiation in the PCH it is still possible that
18964 an instantiation will be required in a file that includes the
18967 add_pending_template (d
);
18968 /* Instantiate inline functions so that the inliner can do its
18969 job, even though we'll not be emitting a copy of this
18971 if (!(TREE_CODE (d
) == FUNCTION_DECL
&& possibly_inlined_p (d
)))
18975 fn_context
= decl_function_context (d
);
18976 nested
= (current_function_decl
!= NULL_TREE
);
18978 push_to_top_level ();
18980 push_function_context ();
18982 /* Mark D as instantiated so that recursive calls to
18983 instantiate_decl do not try to instantiate it again. */
18984 DECL_TEMPLATE_INSTANTIATED (d
) = 1;
18986 /* Regenerate the declaration in case the template has been modified
18987 by a subsequent redeclaration. */
18988 regenerate_decl_from_template (d
, td
);
18990 /* We already set the file and line above. Reset them now in case
18991 they changed as a result of calling regenerate_decl_from_template. */
18992 input_location
= DECL_SOURCE_LOCATION (d
);
18997 bool const_init
= false;
18999 /* Clear out DECL_RTL; whatever was there before may not be right
19000 since we've reset the type of the declaration. */
19001 SET_DECL_RTL (d
, NULL
);
19002 DECL_IN_AGGR_P (d
) = 0;
19004 /* The initializer is placed in DECL_INITIAL by
19005 regenerate_decl_from_template so we don't need to
19006 push/pop_access_scope again here. Pull it out so that
19007 cp_finish_decl can process it. */
19008 init
= DECL_INITIAL (d
);
19009 DECL_INITIAL (d
) = NULL_TREE
;
19010 DECL_INITIALIZED_P (d
) = 0;
19012 /* Clear DECL_EXTERNAL so that cp_finish_decl will process the
19013 initializer. That function will defer actual emission until
19014 we have a chance to determine linkage. */
19015 DECL_EXTERNAL (d
) = 0;
19017 /* Enter the scope of D so that access-checking works correctly. */
19018 push_nested_class (DECL_CONTEXT (d
));
19019 const_init
= DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (code_pattern
);
19020 cp_finish_decl (d
, init
, const_init
, NULL_TREE
, 0);
19021 pop_nested_class ();
19023 else if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_DEFAULTED_FN (code_pattern
))
19024 synthesize_method (d
);
19025 else if (TREE_CODE (d
) == FUNCTION_DECL
)
19027 struct pointer_map_t
*saved_local_specializations
;
19032 /* Save away the current list, in case we are instantiating one
19033 template from within the body of another. */
19034 saved_local_specializations
= local_specializations
;
19036 /* Set up the list of local specializations. */
19037 local_specializations
= pointer_map_create ();
19039 /* Set up context. */
19040 start_preparsed_function (d
, NULL_TREE
, SF_PRE_PARSED
);
19042 /* Some typedefs referenced from within the template code need to be
19043 access checked at template instantiation time, i.e now. These
19044 types were added to the template at parsing time. Let's get those
19045 and perform the access checks then. */
19046 perform_typedefs_access_check (DECL_TEMPLATE_RESULT (gen_tmpl
),
19049 /* Create substitution entries for the parameters. */
19050 subst_decl
= DECL_TEMPLATE_RESULT (template_for_substitution (d
));
19051 tmpl_parm
= DECL_ARGUMENTS (subst_decl
);
19052 spec_parm
= DECL_ARGUMENTS (d
);
19053 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (d
))
19055 register_local_specialization (spec_parm
, tmpl_parm
);
19056 spec_parm
= skip_artificial_parms_for (d
, spec_parm
);
19057 tmpl_parm
= skip_artificial_parms_for (subst_decl
, tmpl_parm
);
19059 for (; tmpl_parm
; tmpl_parm
= DECL_CHAIN (tmpl_parm
))
19061 if (!FUNCTION_PARAMETER_PACK_P (tmpl_parm
))
19063 register_local_specialization (spec_parm
, tmpl_parm
);
19064 spec_parm
= DECL_CHAIN (spec_parm
);
19068 /* Register the (value) argument pack as a specialization of
19069 TMPL_PARM, then move on. */
19070 tree argpack
= extract_fnparm_pack (tmpl_parm
, &spec_parm
);
19071 register_local_specialization (argpack
, tmpl_parm
);
19074 gcc_assert (!spec_parm
);
19076 /* Substitute into the body of the function. */
19077 tsubst_expr (DECL_SAVED_TREE (code_pattern
), args
,
19078 tf_warning_or_error
, tmpl
,
19079 /*integral_constant_expression_p=*/false);
19081 /* Set the current input_location to the end of the function
19082 so that finish_function knows where we are. */
19083 input_location
= DECL_STRUCT_FUNCTION (code_pattern
)->function_end_locus
;
19085 /* We don't need the local specializations any more. */
19086 pointer_map_destroy (local_specializations
);
19087 local_specializations
= saved_local_specializations
;
19089 /* Finish the function. */
19090 d
= finish_function (0);
19091 expand_or_defer_fn (d
);
19094 /* We're not deferring instantiation any more. */
19095 TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (d
)) = 0;
19098 pop_from_top_level ();
19100 pop_function_context ();
19103 input_location
= saved_loc
;
19104 pop_deferring_access_checks ();
19105 pop_tinst_level ();
19107 timevar_pop (TV_TEMPLATE_INST
);
19112 /* Run through the list of templates that we wish we could
19113 instantiate, and instantiate any we can. RETRIES is the
19114 number of times we retry pending template instantiation. */
19117 instantiate_pending_templates (int retries
)
19120 location_t saved_loc
= input_location
;
19122 /* Instantiating templates may trigger vtable generation. This in turn
19123 may require further template instantiations. We place a limit here
19124 to avoid infinite loop. */
19125 if (pending_templates
&& retries
>= max_tinst_depth
)
19127 tree decl
= pending_templates
->tinst
->decl
;
19129 error ("template instantiation depth exceeds maximum of %d"
19130 " instantiating %q+D, possibly from virtual table generation"
19131 " (use -ftemplate-depth= to increase the maximum)",
19132 max_tinst_depth
, decl
);
19133 if (TREE_CODE (decl
) == FUNCTION_DECL
)
19134 /* Pretend that we defined it. */
19135 DECL_INITIAL (decl
) = error_mark_node
;
19141 struct pending_template
**t
= &pending_templates
;
19142 struct pending_template
*last
= NULL
;
19146 tree instantiation
= reopen_tinst_level ((*t
)->tinst
);
19147 bool complete
= false;
19149 if (TYPE_P (instantiation
))
19153 if (!COMPLETE_TYPE_P (instantiation
))
19155 instantiate_class_template (instantiation
);
19156 if (CLASSTYPE_TEMPLATE_INSTANTIATION (instantiation
))
19157 for (fn
= TYPE_METHODS (instantiation
);
19159 fn
= TREE_CHAIN (fn
))
19160 if (! DECL_ARTIFICIAL (fn
))
19161 instantiate_decl (fn
,
19163 /*expl_inst_class_mem_p=*/false);
19164 if (COMPLETE_TYPE_P (instantiation
))
19168 complete
= COMPLETE_TYPE_P (instantiation
);
19172 if (!DECL_TEMPLATE_SPECIALIZATION (instantiation
)
19173 && !DECL_TEMPLATE_INSTANTIATED (instantiation
))
19176 = instantiate_decl (instantiation
,
19178 /*expl_inst_class_mem_p=*/false);
19179 if (DECL_TEMPLATE_INSTANTIATED (instantiation
))
19183 complete
= (DECL_TEMPLATE_SPECIALIZATION (instantiation
)
19184 || DECL_TEMPLATE_INSTANTIATED (instantiation
));
19188 /* If INSTANTIATION has been instantiated, then we don't
19189 need to consider it again in the future. */
19197 current_tinst_level
= NULL
;
19199 last_pending_template
= last
;
19201 while (reconsider
);
19203 input_location
= saved_loc
;
19206 /* Substitute ARGVEC into T, which is a list of initializers for
19207 either base class or a non-static data member. The TREE_PURPOSEs
19208 are DECLs, and the TREE_VALUEs are the initializer values. Used by
19209 instantiate_decl. */
19212 tsubst_initializer_list (tree t
, tree argvec
)
19214 tree inits
= NULL_TREE
;
19216 for (; t
; t
= TREE_CHAIN (t
))
19220 tree expanded_bases
= NULL_TREE
;
19221 tree expanded_arguments
= NULL_TREE
;
19224 if (TREE_CODE (TREE_PURPOSE (t
)) == TYPE_PACK_EXPANSION
)
19229 /* Expand the base class expansion type into separate base
19231 expanded_bases
= tsubst_pack_expansion (TREE_PURPOSE (t
), argvec
,
19232 tf_warning_or_error
,
19234 if (expanded_bases
== error_mark_node
)
19237 /* We'll be building separate TREE_LISTs of arguments for
19239 len
= TREE_VEC_LENGTH (expanded_bases
);
19240 expanded_arguments
= make_tree_vec (len
);
19241 for (i
= 0; i
< len
; i
++)
19242 TREE_VEC_ELT (expanded_arguments
, i
) = NULL_TREE
;
19244 /* Build a dummy EXPR_PACK_EXPANSION that will be used to
19245 expand each argument in the TREE_VALUE of t. */
19246 expr
= make_node (EXPR_PACK_EXPANSION
);
19247 PACK_EXPANSION_LOCAL_P (expr
) = true;
19248 PACK_EXPANSION_PARAMETER_PACKS (expr
) =
19249 PACK_EXPANSION_PARAMETER_PACKS (TREE_PURPOSE (t
));
19251 if (TREE_VALUE (t
) == void_type_node
)
19252 /* VOID_TYPE_NODE is used to indicate
19253 value-initialization. */
19255 for (i
= 0; i
< len
; i
++)
19256 TREE_VEC_ELT (expanded_arguments
, i
) = void_type_node
;
19260 /* Substitute parameter packs into each argument in the
19262 in_base_initializer
= 1;
19263 for (arg
= TREE_VALUE (t
); arg
; arg
= TREE_CHAIN (arg
))
19265 tree expanded_exprs
;
19267 /* Expand the argument. */
19268 SET_PACK_EXPANSION_PATTERN (expr
, TREE_VALUE (arg
));
19270 = tsubst_pack_expansion (expr
, argvec
,
19271 tf_warning_or_error
,
19273 if (expanded_exprs
== error_mark_node
)
19276 /* Prepend each of the expanded expressions to the
19277 corresponding TREE_LIST in EXPANDED_ARGUMENTS. */
19278 for (i
= 0; i
< len
; i
++)
19280 TREE_VEC_ELT (expanded_arguments
, i
) =
19281 tree_cons (NULL_TREE
,
19282 TREE_VEC_ELT (expanded_exprs
, i
),
19283 TREE_VEC_ELT (expanded_arguments
, i
));
19286 in_base_initializer
= 0;
19288 /* Reverse all of the TREE_LISTs in EXPANDED_ARGUMENTS,
19289 since we built them backwards. */
19290 for (i
= 0; i
< len
; i
++)
19292 TREE_VEC_ELT (expanded_arguments
, i
) =
19293 nreverse (TREE_VEC_ELT (expanded_arguments
, i
));
19298 for (i
= 0; i
< len
; ++i
)
19300 if (expanded_bases
)
19302 decl
= TREE_VEC_ELT (expanded_bases
, i
);
19303 decl
= expand_member_init (decl
);
19304 init
= TREE_VEC_ELT (expanded_arguments
, i
);
19309 decl
= tsubst_copy (TREE_PURPOSE (t
), argvec
,
19310 tf_warning_or_error
, NULL_TREE
);
19312 decl
= expand_member_init (decl
);
19313 if (decl
&& !DECL_P (decl
))
19314 in_base_initializer
= 1;
19316 init
= TREE_VALUE (t
);
19318 if (init
!= void_type_node
)
19319 init
= tsubst_expr (init
, argvec
,
19320 tf_warning_or_error
, NULL_TREE
,
19321 /*integral_constant_expression_p=*/false);
19322 if (init
== NULL_TREE
&& tmp
!= NULL_TREE
)
19323 /* If we had an initializer but it instantiated to nothing,
19324 value-initialize the object. This will only occur when
19325 the initializer was a pack expansion where the parameter
19326 packs used in that expansion were of length zero. */
19327 init
= void_type_node
;
19328 in_base_initializer
= 0;
19333 init
= build_tree_list (decl
, init
);
19334 TREE_CHAIN (init
) = inits
;
19342 /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */
19345 set_current_access_from_decl (tree decl
)
19347 if (TREE_PRIVATE (decl
))
19348 current_access_specifier
= access_private_node
;
19349 else if (TREE_PROTECTED (decl
))
19350 current_access_specifier
= access_protected_node
;
19352 current_access_specifier
= access_public_node
;
19355 /* Instantiate an enumerated type. TAG is the template type, NEWTAG
19356 is the instantiation (which should have been created with
19357 start_enum) and ARGS are the template arguments to use. */
19360 tsubst_enum (tree tag
, tree newtag
, tree args
)
19364 if (SCOPED_ENUM_P (newtag
))
19365 begin_scope (sk_scoped_enum
, newtag
);
19367 for (e
= TYPE_VALUES (tag
); e
; e
= TREE_CHAIN (e
))
19372 decl
= TREE_VALUE (e
);
19373 /* Note that in a template enum, the TREE_VALUE is the
19374 CONST_DECL, not the corresponding INTEGER_CST. */
19375 value
= tsubst_expr (DECL_INITIAL (decl
),
19376 args
, tf_warning_or_error
, NULL_TREE
,
19377 /*integral_constant_expression_p=*/true);
19379 /* Give this enumeration constant the correct access. */
19380 set_current_access_from_decl (decl
);
19382 /* Actually build the enumerator itself. */
19384 (DECL_NAME (decl
), value
, newtag
, DECL_SOURCE_LOCATION (decl
));
19387 if (SCOPED_ENUM_P (newtag
))
19390 finish_enum_value_list (newtag
);
19391 finish_enum (newtag
);
19393 DECL_SOURCE_LOCATION (TYPE_NAME (newtag
))
19394 = DECL_SOURCE_LOCATION (TYPE_NAME (tag
));
19397 /* DECL is a FUNCTION_DECL that is a template specialization. Return
19398 its type -- but without substituting the innermost set of template
19399 arguments. So, innermost set of template parameters will appear in
19403 get_mostly_instantiated_function_type (tree decl
)
19411 tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
19412 targs
= DECL_TI_ARGS (decl
);
19413 tparms
= DECL_TEMPLATE_PARMS (tmpl
);
19414 parm_depth
= TMPL_PARMS_DEPTH (tparms
);
19416 /* There should be as many levels of arguments as there are levels
19418 gcc_assert (parm_depth
== TMPL_ARGS_DEPTH (targs
));
19420 fn_type
= TREE_TYPE (tmpl
);
19422 if (parm_depth
== 1)
19423 /* No substitution is necessary. */
19430 /* Replace the innermost level of the TARGS with NULL_TREEs to
19431 let tsubst know not to substitute for those parameters. */
19432 partial_args
= make_tree_vec (TREE_VEC_LENGTH (targs
));
19433 for (i
= 1; i
< TMPL_ARGS_DEPTH (targs
); ++i
)
19434 SET_TMPL_ARGS_LEVEL (partial_args
, i
,
19435 TMPL_ARGS_LEVEL (targs
, i
));
19436 SET_TMPL_ARGS_LEVEL (partial_args
,
19437 TMPL_ARGS_DEPTH (targs
),
19438 make_tree_vec (DECL_NTPARMS (tmpl
)));
19440 /* Make sure that we can see identifiers, and compute access
19442 push_access_scope (decl
);
19444 ++processing_template_decl
;
19445 /* Now, do the (partial) substitution to figure out the
19446 appropriate function type. */
19447 fn_type
= tsubst (fn_type
, partial_args
, tf_error
, NULL_TREE
);
19448 --processing_template_decl
;
19450 /* Substitute into the template parameters to obtain the real
19451 innermost set of parameters. This step is important if the
19452 innermost set of template parameters contains value
19453 parameters whose types depend on outer template parameters. */
19454 TREE_VEC_LENGTH (partial_args
)--;
19455 tparms
= tsubst_template_parms (tparms
, partial_args
, tf_error
);
19457 pop_access_scope (decl
);
19463 /* Return truthvalue if we're processing a template different from
19464 the last one involved in diagnostics. */
19466 problematic_instantiation_changed (void)
19468 return current_tinst_level
!= last_error_tinst_level
;
19471 /* Remember current template involved in diagnostics. */
19473 record_last_problematic_instantiation (void)
19475 last_error_tinst_level
= current_tinst_level
;
19478 struct tinst_level
*
19479 current_instantiation (void)
19481 return current_tinst_level
;
19484 /* [temp.param] Check that template non-type parm TYPE is of an allowable
19485 type. Return zero for ok, nonzero for disallowed. Issue error and
19486 warning messages under control of COMPLAIN. */
19489 invalid_nontype_parm_type_p (tree type
, tsubst_flags_t complain
)
19491 if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
19493 else if (POINTER_TYPE_P (type
))
19495 else if (TYPE_PTRMEM_P (type
))
19497 else if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
)
19499 else if (TREE_CODE (type
) == TYPENAME_TYPE
)
19501 else if (TREE_CODE (type
) == DECLTYPE_TYPE
)
19503 else if (TREE_CODE (type
) == NULLPTR_TYPE
)
19506 if (complain
& tf_error
)
19508 if (type
== error_mark_node
)
19509 inform (input_location
, "invalid template non-type parameter");
19511 error ("%q#T is not a valid type for a template non-type parameter",
19517 /* Returns TRUE if TYPE is dependent, in the sense of [temp.dep.type].
19518 Assumes that TYPE really is a type, and not the ERROR_MARK_NODE.*/
19521 dependent_type_p_r (tree type
)
19527 A type is dependent if it is:
19529 -- a template parameter. Template template parameters are types
19530 for us (since TYPE_P holds true for them) so we handle
19532 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
19533 || TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
)
19535 /* -- a qualified-id with a nested-name-specifier which contains a
19536 class-name that names a dependent type or whose unqualified-id
19537 names a dependent type. */
19538 if (TREE_CODE (type
) == TYPENAME_TYPE
)
19540 /* -- a cv-qualified type where the cv-unqualified type is
19542 type
= TYPE_MAIN_VARIANT (type
);
19543 /* -- a compound type constructed from any dependent type. */
19544 if (TYPE_PTRMEM_P (type
))
19545 return (dependent_type_p (TYPE_PTRMEM_CLASS_TYPE (type
))
19546 || dependent_type_p (TYPE_PTRMEM_POINTED_TO_TYPE
19548 else if (TYPE_PTR_P (type
)
19549 || TREE_CODE (type
) == REFERENCE_TYPE
)
19550 return dependent_type_p (TREE_TYPE (type
));
19551 else if (TREE_CODE (type
) == FUNCTION_TYPE
19552 || TREE_CODE (type
) == METHOD_TYPE
)
19556 if (dependent_type_p (TREE_TYPE (type
)))
19558 for (arg_type
= TYPE_ARG_TYPES (type
);
19560 arg_type
= TREE_CHAIN (arg_type
))
19561 if (dependent_type_p (TREE_VALUE (arg_type
)))
19565 /* -- an array type constructed from any dependent type or whose
19566 size is specified by a constant expression that is
19569 We checked for type- and value-dependence of the bounds in
19570 compute_array_index_type, so TYPE_DEPENDENT_P is already set. */
19571 if (TREE_CODE (type
) == ARRAY_TYPE
)
19573 if (TYPE_DOMAIN (type
)
19574 && dependent_type_p (TYPE_DOMAIN (type
)))
19576 return dependent_type_p (TREE_TYPE (type
));
19579 /* -- a template-id in which either the template name is a template
19581 if (TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
19583 /* ... or any of the template arguments is a dependent type or
19584 an expression that is type-dependent or value-dependent. */
19585 else if (CLASS_TYPE_P (type
) && CLASSTYPE_TEMPLATE_INFO (type
)
19586 && (any_dependent_template_arguments_p
19587 (INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type
)))))
19590 /* All TYPEOF_TYPEs, DECLTYPE_TYPEs, and UNDERLYING_TYPEs are
19591 dependent; if the argument of the `typeof' expression is not
19592 type-dependent, then it should already been have resolved. */
19593 if (TREE_CODE (type
) == TYPEOF_TYPE
19594 || TREE_CODE (type
) == DECLTYPE_TYPE
19595 || TREE_CODE (type
) == UNDERLYING_TYPE
)
19598 /* A template argument pack is dependent if any of its packed
19600 if (TREE_CODE (type
) == TYPE_ARGUMENT_PACK
)
19602 tree args
= ARGUMENT_PACK_ARGS (type
);
19603 int i
, len
= TREE_VEC_LENGTH (args
);
19604 for (i
= 0; i
< len
; ++i
)
19605 if (dependent_template_arg_p (TREE_VEC_ELT (args
, i
)))
19609 /* All TYPE_PACK_EXPANSIONs are dependent, because parameter packs must
19610 be template parameters. */
19611 if (TREE_CODE (type
) == TYPE_PACK_EXPANSION
)
19614 /* The standard does not specifically mention types that are local
19615 to template functions or local classes, but they should be
19616 considered dependent too. For example:
19618 template <int I> void f() {
19623 The size of `E' cannot be known until the value of `I' has been
19624 determined. Therefore, `E' must be considered dependent. */
19625 scope
= TYPE_CONTEXT (type
);
19626 if (scope
&& TYPE_P (scope
))
19627 return dependent_type_p (scope
);
19628 /* Don't use type_dependent_expression_p here, as it can lead
19629 to infinite recursion trying to determine whether a lambda
19630 nested in a lambda is dependent (c++/47687). */
19631 else if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
19632 && DECL_LANG_SPECIFIC (scope
)
19633 && DECL_TEMPLATE_INFO (scope
)
19634 && (any_dependent_template_arguments_p
19635 (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (scope
)))))
19638 /* Other types are non-dependent. */
19642 /* Returns TRUE if TYPE is dependent, in the sense of
19643 [temp.dep.type]. Note that a NULL type is considered dependent. */
19646 dependent_type_p (tree type
)
19648 /* If there are no template parameters in scope, then there can't be
19649 any dependent types. */
19650 if (!processing_template_decl
)
19652 /* If we are not processing a template, then nobody should be
19653 providing us with a dependent type. */
19655 gcc_assert (TREE_CODE (type
) != TEMPLATE_TYPE_PARM
|| is_auto (type
));
19659 /* If the type is NULL, we have not computed a type for the entity
19660 in question; in that case, the type is dependent. */
19664 /* Erroneous types can be considered non-dependent. */
19665 if (type
== error_mark_node
)
19668 /* If we have not already computed the appropriate value for TYPE,
19670 if (!TYPE_DEPENDENT_P_VALID (type
))
19672 TYPE_DEPENDENT_P (type
) = dependent_type_p_r (type
);
19673 TYPE_DEPENDENT_P_VALID (type
) = 1;
19676 return TYPE_DEPENDENT_P (type
);
19679 /* Returns TRUE if SCOPE is a dependent scope, in which we can't do any
19680 lookup. In other words, a dependent type that is not the current
19684 dependent_scope_p (tree scope
)
19686 return (scope
&& TYPE_P (scope
) && dependent_type_p (scope
)
19687 && !currently_open_class (scope
));
19690 /* T is a SCOPE_REF; return whether we need to consider it
19691 instantiation-dependent so that we can check access at instantiation
19692 time even though we know which member it resolves to. */
19695 instantiation_dependent_scope_ref_p (tree t
)
19697 if (DECL_P (TREE_OPERAND (t
, 1))
19698 && CLASS_TYPE_P (TREE_OPERAND (t
, 0))
19699 && accessible_in_template_p (TREE_OPERAND (t
, 0),
19700 TREE_OPERAND (t
, 1)))
19706 /* Returns TRUE if the EXPRESSION is value-dependent, in the sense of
19707 [temp.dep.constexpr]. EXPRESSION is already known to be a constant
19710 /* Note that this predicate is not appropriate for general expressions;
19711 only constant expressions (that satisfy potential_constant_expression)
19712 can be tested for value dependence. */
19715 value_dependent_expression_p (tree expression
)
19717 if (!processing_template_decl
)
19720 /* A name declared with a dependent type. */
19721 if (DECL_P (expression
) && type_dependent_expression_p (expression
))
19724 switch (TREE_CODE (expression
))
19726 case IDENTIFIER_NODE
:
19727 /* A name that has not been looked up -- must be dependent. */
19730 case TEMPLATE_PARM_INDEX
:
19731 /* A non-type template parm. */
19735 /* A non-type template parm. */
19736 if (DECL_TEMPLATE_PARM_P (expression
))
19738 return value_dependent_expression_p (DECL_INITIAL (expression
));
19741 /* A constant with literal type and is initialized
19742 with an expression that is value-dependent.
19744 Note that a non-dependent parenthesized initializer will have
19745 already been replaced with its constant value, so if we see
19746 a TREE_LIST it must be dependent. */
19747 if (DECL_INITIAL (expression
)
19748 && decl_constant_var_p (expression
)
19749 && (TREE_CODE (DECL_INITIAL (expression
)) == TREE_LIST
19750 || value_dependent_expression_p (DECL_INITIAL (expression
))))
19754 case DYNAMIC_CAST_EXPR
:
19755 case STATIC_CAST_EXPR
:
19756 case CONST_CAST_EXPR
:
19757 case REINTERPRET_CAST_EXPR
:
19759 /* These expressions are value-dependent if the type to which
19760 the cast occurs is dependent or the expression being casted
19761 is value-dependent. */
19763 tree type
= TREE_TYPE (expression
);
19765 if (dependent_type_p (type
))
19768 /* A functional cast has a list of operands. */
19769 expression
= TREE_OPERAND (expression
, 0);
19772 /* If there are no operands, it must be an expression such
19773 as "int()". This should not happen for aggregate types
19774 because it would form non-constant expressions. */
19775 gcc_assert (cxx_dialect
>= cxx0x
19776 || INTEGRAL_OR_ENUMERATION_TYPE_P (type
));
19781 if (TREE_CODE (expression
) == TREE_LIST
)
19782 return any_value_dependent_elements_p (expression
);
19784 return value_dependent_expression_p (expression
);
19788 if (SIZEOF_EXPR_TYPE_P (expression
))
19789 return dependent_type_p (TREE_TYPE (TREE_OPERAND (expression
, 0)));
19793 /* A `sizeof' expression is value-dependent if the operand is
19794 type-dependent or is a pack expansion. */
19795 expression
= TREE_OPERAND (expression
, 0);
19796 if (PACK_EXPANSION_P (expression
))
19798 else if (TYPE_P (expression
))
19799 return dependent_type_p (expression
);
19800 return instantiation_dependent_expression_p (expression
);
19802 case AT_ENCODE_EXPR
:
19803 /* An 'encode' expression is value-dependent if the operand is
19805 expression
= TREE_OPERAND (expression
, 0);
19806 return dependent_type_p (expression
);
19808 case NOEXCEPT_EXPR
:
19809 expression
= TREE_OPERAND (expression
, 0);
19810 return instantiation_dependent_expression_p (expression
);
19813 /* All instantiation-dependent expressions should also be considered
19814 value-dependent. */
19815 return instantiation_dependent_scope_ref_p (expression
);
19817 case COMPONENT_REF
:
19818 return (value_dependent_expression_p (TREE_OPERAND (expression
, 0))
19819 || value_dependent_expression_p (TREE_OPERAND (expression
, 1)));
19821 case NONTYPE_ARGUMENT_PACK
:
19822 /* A NONTYPE_ARGUMENT_PACK is value-dependent if any packed argument
19823 is value-dependent. */
19825 tree values
= ARGUMENT_PACK_ARGS (expression
);
19826 int i
, len
= TREE_VEC_LENGTH (values
);
19828 for (i
= 0; i
< len
; ++i
)
19829 if (value_dependent_expression_p (TREE_VEC_ELT (values
, i
)))
19837 tree type2
= TRAIT_EXPR_TYPE2 (expression
);
19838 return (dependent_type_p (TRAIT_EXPR_TYPE1 (expression
))
19839 || (type2
? dependent_type_p (type2
) : false));
19843 return ((value_dependent_expression_p (TREE_OPERAND (expression
, 0)))
19844 || (value_dependent_expression_p (TREE_OPERAND (expression
, 2))));
19847 return ((value_dependent_expression_p (TREE_OPERAND (expression
, 0)))
19848 || (value_dependent_expression_p (TREE_OPERAND (expression
, 1))));
19852 tree op
= TREE_OPERAND (expression
, 0);
19853 return (value_dependent_expression_p (op
)
19854 || has_value_dependent_address (op
));
19859 tree fn
= get_callee_fndecl (expression
);
19861 if (!fn
&& value_dependent_expression_p (CALL_EXPR_FN (expression
)))
19863 nargs
= call_expr_nargs (expression
);
19864 for (i
= 0; i
< nargs
; ++i
)
19866 tree op
= CALL_EXPR_ARG (expression
, i
);
19867 /* In a call to a constexpr member function, look through the
19868 implicit ADDR_EXPR on the object argument so that it doesn't
19869 cause the call to be considered value-dependent. We also
19870 look through it in potential_constant_expression. */
19871 if (i
== 0 && fn
&& DECL_DECLARED_CONSTEXPR_P (fn
)
19872 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
19873 && TREE_CODE (op
) == ADDR_EXPR
)
19874 op
= TREE_OPERAND (op
, 0);
19875 if (value_dependent_expression_p (op
))
19881 case TEMPLATE_ID_EXPR
:
19882 /* If a TEMPLATE_ID_EXPR involves a dependent name, it will be
19884 return type_dependent_expression_p (expression
);
19890 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expression
), ix
, val
)
19891 if (value_dependent_expression_p (val
))
19897 /* Treat a GNU statement expression as dependent to avoid crashing
19898 under fold_non_dependent_expr; it can't be constant. */
19902 /* A constant expression is value-dependent if any subexpression is
19903 value-dependent. */
19904 switch (TREE_CODE_CLASS (TREE_CODE (expression
)))
19906 case tcc_reference
:
19908 case tcc_comparison
:
19910 case tcc_expression
:
19913 int i
, len
= cp_tree_operand_length (expression
);
19915 for (i
= 0; i
< len
; i
++)
19917 tree t
= TREE_OPERAND (expression
, i
);
19919 /* In some cases, some of the operands may be missing.l
19920 (For example, in the case of PREDECREMENT_EXPR, the
19921 amount to increment by may be missing.) That doesn't
19922 make the expression dependent. */
19923 if (t
&& value_dependent_expression_p (t
))
19934 /* The expression is not value-dependent. */
19938 /* Returns TRUE if the EXPRESSION is type-dependent, in the sense of
19939 [temp.dep.expr]. Note that an expression with no type is
19940 considered dependent. Other parts of the compiler arrange for an
19941 expression with type-dependent subexpressions to have no type, so
19942 this function doesn't have to be fully recursive. */
19945 type_dependent_expression_p (tree expression
)
19947 if (!processing_template_decl
)
19950 if (expression
== error_mark_node
)
19953 /* An unresolved name is always dependent. */
19954 if (identifier_p (expression
) || TREE_CODE (expression
) == USING_DECL
)
19957 /* Some expression forms are never type-dependent. */
19958 if (TREE_CODE (expression
) == PSEUDO_DTOR_EXPR
19959 || TREE_CODE (expression
) == SIZEOF_EXPR
19960 || TREE_CODE (expression
) == ALIGNOF_EXPR
19961 || TREE_CODE (expression
) == AT_ENCODE_EXPR
19962 || TREE_CODE (expression
) == NOEXCEPT_EXPR
19963 || TREE_CODE (expression
) == TRAIT_EXPR
19964 || TREE_CODE (expression
) == TYPEID_EXPR
19965 || TREE_CODE (expression
) == DELETE_EXPR
19966 || TREE_CODE (expression
) == VEC_DELETE_EXPR
19967 || TREE_CODE (expression
) == THROW_EXPR
)
19970 /* The types of these expressions depends only on the type to which
19971 the cast occurs. */
19972 if (TREE_CODE (expression
) == DYNAMIC_CAST_EXPR
19973 || TREE_CODE (expression
) == STATIC_CAST_EXPR
19974 || TREE_CODE (expression
) == CONST_CAST_EXPR
19975 || TREE_CODE (expression
) == REINTERPRET_CAST_EXPR
19976 || TREE_CODE (expression
) == IMPLICIT_CONV_EXPR
19977 || TREE_CODE (expression
) == CAST_EXPR
)
19978 return dependent_type_p (TREE_TYPE (expression
));
19980 /* The types of these expressions depends only on the type created
19981 by the expression. */
19982 if (TREE_CODE (expression
) == NEW_EXPR
19983 || TREE_CODE (expression
) == VEC_NEW_EXPR
)
19985 /* For NEW_EXPR tree nodes created inside a template, either
19986 the object type itself or a TREE_LIST may appear as the
19988 tree type
= TREE_OPERAND (expression
, 1);
19989 if (TREE_CODE (type
) == TREE_LIST
)
19990 /* This is an array type. We need to check array dimensions
19992 return dependent_type_p (TREE_VALUE (TREE_PURPOSE (type
)))
19993 || value_dependent_expression_p
19994 (TREE_OPERAND (TREE_VALUE (type
), 1));
19996 return dependent_type_p (type
);
19999 if (TREE_CODE (expression
) == SCOPE_REF
)
20001 tree scope
= TREE_OPERAND (expression
, 0);
20002 tree name
= TREE_OPERAND (expression
, 1);
20004 /* 14.6.2.2 [temp.dep.expr]: An id-expression is type-dependent if it
20005 contains an identifier associated by name lookup with one or more
20006 declarations declared with a dependent type, or...a
20007 nested-name-specifier or qualified-id that names a member of an
20008 unknown specialization. */
20009 return (type_dependent_expression_p (name
)
20010 || dependent_scope_p (scope
));
20013 if (TREE_CODE (expression
) == FUNCTION_DECL
20014 && DECL_LANG_SPECIFIC (expression
)
20015 && DECL_TEMPLATE_INFO (expression
)
20016 && (any_dependent_template_arguments_p
20017 (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (expression
)))))
20020 if (TREE_CODE (expression
) == TEMPLATE_DECL
20021 && !DECL_TEMPLATE_TEMPLATE_PARM_P (expression
))
20024 if (TREE_CODE (expression
) == STMT_EXPR
)
20025 expression
= stmt_expr_value_expr (expression
);
20027 if (BRACE_ENCLOSED_INITIALIZER_P (expression
))
20032 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expression
), i
, elt
)
20034 if (type_dependent_expression_p (elt
))
20040 /* A static data member of the current instantiation with incomplete
20041 array type is type-dependent, as the definition and specializations
20042 can have different bounds. */
20043 if (VAR_P (expression
)
20044 && DECL_CLASS_SCOPE_P (expression
)
20045 && dependent_type_p (DECL_CONTEXT (expression
))
20046 && VAR_HAD_UNKNOWN_BOUND (expression
))
20049 if (TREE_TYPE (expression
) == unknown_type_node
)
20051 if (TREE_CODE (expression
) == ADDR_EXPR
)
20052 return type_dependent_expression_p (TREE_OPERAND (expression
, 0));
20053 if (TREE_CODE (expression
) == COMPONENT_REF
20054 || TREE_CODE (expression
) == OFFSET_REF
)
20056 if (type_dependent_expression_p (TREE_OPERAND (expression
, 0)))
20058 expression
= TREE_OPERAND (expression
, 1);
20059 if (identifier_p (expression
))
20062 /* SCOPE_REF with non-null TREE_TYPE is always non-dependent. */
20063 if (TREE_CODE (expression
) == SCOPE_REF
)
20066 if (BASELINK_P (expression
))
20067 expression
= BASELINK_FUNCTIONS (expression
);
20069 if (TREE_CODE (expression
) == TEMPLATE_ID_EXPR
)
20071 if (any_dependent_template_arguments_p
20072 (TREE_OPERAND (expression
, 1)))
20074 expression
= TREE_OPERAND (expression
, 0);
20076 gcc_assert (TREE_CODE (expression
) == OVERLOAD
20077 || TREE_CODE (expression
) == FUNCTION_DECL
);
20081 if (type_dependent_expression_p (OVL_CURRENT (expression
)))
20083 expression
= OVL_NEXT (expression
);
20088 gcc_assert (TREE_CODE (expression
) != TYPE_DECL
);
20090 return (dependent_type_p (TREE_TYPE (expression
)));
20093 /* walk_tree callback function for instantiation_dependent_expression_p,
20094 below. Returns non-zero if a dependent subexpression is found. */
20097 instantiation_dependent_r (tree
*tp
, int *walk_subtrees
,
20102 /* We don't have to worry about decltype currently because decltype
20103 of an instantiation-dependent expr is a dependent type. This
20104 might change depending on the resolution of DR 1172. */
20105 *walk_subtrees
= false;
20108 enum tree_code code
= TREE_CODE (*tp
);
20111 /* Don't treat an argument list as dependent just because it has no
20119 /* A constant with a dependent initializer is dependent. */
20120 if (value_dependent_expression_p (*tp
))
20124 case TEMPLATE_PARM_INDEX
:
20127 /* Handle expressions with type operands. */
20131 case AT_ENCODE_EXPR
:
20133 tree op
= TREE_OPERAND (*tp
, 0);
20134 if (code
== SIZEOF_EXPR
&& SIZEOF_EXPR_TYPE_P (*tp
))
20135 op
= TREE_TYPE (op
);
20138 if (dependent_type_p (op
))
20142 *walk_subtrees
= false;
20150 if (dependent_type_p (TRAIT_EXPR_TYPE1 (*tp
))
20151 || dependent_type_p (TRAIT_EXPR_TYPE2 (*tp
)))
20153 *walk_subtrees
= false;
20156 case COMPONENT_REF
:
20157 if (identifier_p (TREE_OPERAND (*tp
, 1)))
20158 /* In a template, finish_class_member_access_expr creates a
20159 COMPONENT_REF with an IDENTIFIER_NODE for op1 even if it isn't
20160 type-dependent, so that we can check access control at
20161 instantiation time (PR 42277). See also Core issue 1273. */
20166 if (instantiation_dependent_scope_ref_p (*tp
))
20171 /* Treat statement-expressions as dependent. */
20179 if (type_dependent_expression_p (*tp
))
20185 /* Returns TRUE if the EXPRESSION is instantiation-dependent, in the
20186 sense defined by the ABI:
20188 "An expression is instantiation-dependent if it is type-dependent
20189 or value-dependent, or it has a subexpression that is type-dependent
20190 or value-dependent." */
20193 instantiation_dependent_expression_p (tree expression
)
20197 if (!processing_template_decl
)
20200 if (expression
== error_mark_node
)
20203 result
= cp_walk_tree_without_duplicates (&expression
,
20204 instantiation_dependent_r
, NULL
);
20205 return result
!= NULL_TREE
;
20208 /* Like type_dependent_expression_p, but it also works while not processing
20209 a template definition, i.e. during substitution or mangling. */
20212 type_dependent_expression_p_push (tree expr
)
20215 ++processing_template_decl
;
20216 b
= type_dependent_expression_p (expr
);
20217 --processing_template_decl
;
20221 /* Returns TRUE if ARGS contains a type-dependent expression. */
20224 any_type_dependent_arguments_p (const vec
<tree
, va_gc
> *args
)
20229 FOR_EACH_VEC_SAFE_ELT (args
, i
, arg
)
20231 if (type_dependent_expression_p (arg
))
20237 /* Returns TRUE if LIST (a TREE_LIST whose TREE_VALUEs are
20238 expressions) contains any type-dependent expressions. */
20241 any_type_dependent_elements_p (const_tree list
)
20243 for (; list
; list
= TREE_CHAIN (list
))
20244 if (value_dependent_expression_p (TREE_VALUE (list
)))
20250 /* Returns TRUE if LIST (a TREE_LIST whose TREE_VALUEs are
20251 expressions) contains any value-dependent expressions. */
20254 any_value_dependent_elements_p (const_tree list
)
20256 for (; list
; list
= TREE_CHAIN (list
))
20257 if (value_dependent_expression_p (TREE_VALUE (list
)))
20263 /* Returns TRUE if the ARG (a template argument) is dependent. */
20266 dependent_template_arg_p (tree arg
)
20268 if (!processing_template_decl
)
20271 /* Assume a template argument that was wrongly written by the user
20272 is dependent. This is consistent with what
20273 any_dependent_template_arguments_p [that calls this function]
20275 if (!arg
|| arg
== error_mark_node
)
20278 if (TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
20279 arg
= ARGUMENT_PACK_SELECT_ARG (arg
);
20281 if (TREE_CODE (arg
) == TEMPLATE_DECL
20282 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
20283 return dependent_template_p (arg
);
20284 else if (ARGUMENT_PACK_P (arg
))
20286 tree args
= ARGUMENT_PACK_ARGS (arg
);
20287 int i
, len
= TREE_VEC_LENGTH (args
);
20288 for (i
= 0; i
< len
; ++i
)
20290 if (dependent_template_arg_p (TREE_VEC_ELT (args
, i
)))
20296 else if (TYPE_P (arg
))
20297 return dependent_type_p (arg
);
20299 return (type_dependent_expression_p (arg
)
20300 || value_dependent_expression_p (arg
));
20303 /* Returns true if ARGS (a collection of template arguments) contains
20304 any types that require structural equality testing. */
20307 any_template_arguments_need_structural_equality_p (tree args
)
20314 if (args
== error_mark_node
)
20317 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
20319 tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
20320 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
20322 tree arg
= TREE_VEC_ELT (level
, j
);
20323 tree packed_args
= NULL_TREE
;
20326 if (ARGUMENT_PACK_P (arg
))
20328 /* Look inside the argument pack. */
20329 packed_args
= ARGUMENT_PACK_ARGS (arg
);
20330 len
= TREE_VEC_LENGTH (packed_args
);
20333 for (k
= 0; k
< len
; ++k
)
20336 arg
= TREE_VEC_ELT (packed_args
, k
);
20338 if (error_operand_p (arg
))
20340 else if (TREE_CODE (arg
) == TEMPLATE_DECL
20341 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
20343 else if (TYPE_P (arg
) && TYPE_STRUCTURAL_EQUALITY_P (arg
))
20345 else if (!TYPE_P (arg
) && TREE_TYPE (arg
)
20346 && TYPE_STRUCTURAL_EQUALITY_P (TREE_TYPE (arg
)))
20355 /* Returns true if ARGS (a collection of template arguments) contains
20356 any dependent arguments. */
20359 any_dependent_template_arguments_p (const_tree args
)
20366 if (args
== error_mark_node
)
20369 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
20371 const_tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
20372 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
20373 if (dependent_template_arg_p (TREE_VEC_ELT (level
, j
)))
20380 /* Returns TRUE if the template TMPL is dependent. */
20383 dependent_template_p (tree tmpl
)
20385 if (TREE_CODE (tmpl
) == OVERLOAD
)
20389 if (dependent_template_p (OVL_CURRENT (tmpl
)))
20391 tmpl
= OVL_NEXT (tmpl
);
20396 /* Template template parameters are dependent. */
20397 if (DECL_TEMPLATE_TEMPLATE_PARM_P (tmpl
)
20398 || TREE_CODE (tmpl
) == TEMPLATE_TEMPLATE_PARM
)
20400 /* So are names that have not been looked up. */
20401 if (TREE_CODE (tmpl
) == SCOPE_REF
|| identifier_p (tmpl
))
20403 /* So are member templates of dependent classes. */
20404 if (TYPE_P (CP_DECL_CONTEXT (tmpl
)))
20405 return dependent_type_p (DECL_CONTEXT (tmpl
));
20409 /* Returns TRUE if the specialization TMPL<ARGS> is dependent. */
20412 dependent_template_id_p (tree tmpl
, tree args
)
20414 return (dependent_template_p (tmpl
)
20415 || any_dependent_template_arguments_p (args
));
20418 /* Returns TRUE if OMP_FOR with DECLV, INITV, CONDV and INCRV vectors
20422 dependent_omp_for_p (tree declv
, tree initv
, tree condv
, tree incrv
)
20426 if (!processing_template_decl
)
20429 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
20431 tree decl
= TREE_VEC_ELT (declv
, i
);
20432 tree init
= TREE_VEC_ELT (initv
, i
);
20433 tree cond
= TREE_VEC_ELT (condv
, i
);
20434 tree incr
= TREE_VEC_ELT (incrv
, i
);
20436 if (type_dependent_expression_p (decl
))
20439 if (init
&& type_dependent_expression_p (init
))
20442 if (type_dependent_expression_p (cond
))
20445 if (COMPARISON_CLASS_P (cond
)
20446 && (type_dependent_expression_p (TREE_OPERAND (cond
, 0))
20447 || type_dependent_expression_p (TREE_OPERAND (cond
, 1))))
20450 if (TREE_CODE (incr
) == MODOP_EXPR
)
20452 if (type_dependent_expression_p (TREE_OPERAND (incr
, 0))
20453 || type_dependent_expression_p (TREE_OPERAND (incr
, 2)))
20456 else if (type_dependent_expression_p (incr
))
20458 else if (TREE_CODE (incr
) == MODIFY_EXPR
)
20460 if (type_dependent_expression_p (TREE_OPERAND (incr
, 0)))
20462 else if (BINARY_CLASS_P (TREE_OPERAND (incr
, 1)))
20464 tree t
= TREE_OPERAND (incr
, 1);
20465 if (type_dependent_expression_p (TREE_OPERAND (t
, 0))
20466 || type_dependent_expression_p (TREE_OPERAND (t
, 1)))
20475 /* TYPE is a TYPENAME_TYPE. Returns the ordinary TYPE to which the
20476 TYPENAME_TYPE corresponds. Returns the original TYPENAME_TYPE if
20477 no such TYPE can be found. Note that this function peers inside
20478 uninstantiated templates and therefore should be used only in
20479 extremely limited situations. ONLY_CURRENT_P restricts this
20480 peering to the currently open classes hierarchy (which is required
20481 when comparing types). */
20484 resolve_typename_type (tree type
, bool only_current_p
)
20493 gcc_assert (TREE_CODE (type
) == TYPENAME_TYPE
);
20495 scope
= TYPE_CONTEXT (type
);
20496 /* Usually the non-qualified identifier of a TYPENAME_TYPE is
20497 TYPE_IDENTIFIER (type). But when 'type' is a typedef variant of
20498 a TYPENAME_TYPE node, then TYPE_NAME (type) is set to the TYPE_DECL representing
20499 the typedef. In that case TYPE_IDENTIFIER (type) is not the non-qualified
20500 identifier of the TYPENAME_TYPE anymore.
20501 So by getting the TYPE_IDENTIFIER of the _main declaration_ of the
20502 TYPENAME_TYPE instead, we avoid messing up with a possible
20503 typedef variant case. */
20504 name
= TYPE_IDENTIFIER (TYPE_MAIN_VARIANT (type
));
20506 /* If the SCOPE is itself a TYPENAME_TYPE, then we need to resolve
20507 it first before we can figure out what NAME refers to. */
20508 if (TREE_CODE (scope
) == TYPENAME_TYPE
)
20510 if (TYPENAME_IS_RESOLVING_P (scope
))
20511 /* Given a class template A with a dependent base with nested type C,
20512 typedef typename A::C::C C will land us here, as trying to resolve
20513 the initial A::C leads to the local C typedef, which leads back to
20514 A::C::C. So we break the recursion now. */
20517 scope
= resolve_typename_type (scope
, only_current_p
);
20519 /* If we don't know what SCOPE refers to, then we cannot resolve the
20521 if (TREE_CODE (scope
) == TYPENAME_TYPE
)
20523 /* If the SCOPE is a template type parameter, we have no way of
20524 resolving the name. */
20525 if (TREE_CODE (scope
) == TEMPLATE_TYPE_PARM
)
20527 /* If the SCOPE is not the current instantiation, there's no reason
20528 to look inside it. */
20529 if (only_current_p
&& !currently_open_class (scope
))
20531 /* If this is a typedef, we don't want to look inside (c++/11987). */
20532 if (typedef_variant_p (type
))
20534 /* If SCOPE isn't the template itself, it will not have a valid
20535 TYPE_FIELDS list. */
20536 if (same_type_p (scope
, CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope
)))
20537 /* scope is either the template itself or a compatible instantiation
20538 like X<T>, so look up the name in the original template. */
20539 scope
= CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope
);
20541 /* scope is a partial instantiation, so we can't do the lookup or we
20542 will lose the template arguments. */
20544 /* Enter the SCOPE so that name lookup will be resolved as if we
20545 were in the class definition. In particular, SCOPE will no
20546 longer be considered a dependent type. */
20547 pushed_scope
= push_scope (scope
);
20548 /* Look up the declaration. */
20549 decl
= lookup_member (scope
, name
, /*protect=*/0, /*want_type=*/true,
20550 tf_warning_or_error
);
20552 result
= NULL_TREE
;
20554 /* For a TYPENAME_TYPE like "typename X::template Y<T>", we want to
20555 find a TEMPLATE_DECL. Otherwise, we want to find a TYPE_DECL. */
20558 else if (identifier_p (TYPENAME_TYPE_FULLNAME (type
))
20559 && TREE_CODE (decl
) == TYPE_DECL
)
20561 result
= TREE_TYPE (decl
);
20562 if (result
== error_mark_node
)
20563 result
= NULL_TREE
;
20565 else if (TREE_CODE (TYPENAME_TYPE_FULLNAME (type
)) == TEMPLATE_ID_EXPR
20566 && DECL_CLASS_TEMPLATE_P (decl
))
20570 /* Obtain the template and the arguments. */
20571 tmpl
= TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type
), 0);
20572 args
= TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type
), 1);
20573 /* Instantiate the template. */
20574 result
= lookup_template_class (tmpl
, args
, NULL_TREE
, NULL_TREE
,
20575 /*entering_scope=*/0,
20576 tf_error
| tf_user
);
20577 if (result
== error_mark_node
)
20578 result
= NULL_TREE
;
20581 /* Leave the SCOPE. */
20583 pop_scope (pushed_scope
);
20585 /* If we failed to resolve it, return the original typename. */
20589 /* If lookup found a typename type, resolve that too. */
20590 if (TREE_CODE (result
) == TYPENAME_TYPE
&& !TYPENAME_IS_RESOLVING_P (result
))
20592 /* Ill-formed programs can cause infinite recursion here, so we
20593 must catch that. */
20594 TYPENAME_IS_RESOLVING_P (type
) = 1;
20595 result
= resolve_typename_type (result
, only_current_p
);
20596 TYPENAME_IS_RESOLVING_P (type
) = 0;
20599 /* Qualify the resulting type. */
20600 quals
= cp_type_quals (type
);
20602 result
= cp_build_qualified_type (result
, cp_type_quals (result
) | quals
);
20607 /* EXPR is an expression which is not type-dependent. Return a proxy
20608 for EXPR that can be used to compute the types of larger
20609 expressions containing EXPR. */
20612 build_non_dependent_expr (tree expr
)
20616 #ifdef ENABLE_CHECKING
20617 /* Try to get a constant value for all non-dependent expressions in
20618 order to expose bugs in *_dependent_expression_p and constexpr. */
20619 if (cxx_dialect
>= cxx0x
)
20620 maybe_constant_value (fold_non_dependent_expr_sfinae (expr
, tf_none
));
20623 /* Preserve OVERLOADs; the functions must be available to resolve
20626 if (TREE_CODE (inner_expr
) == STMT_EXPR
)
20627 inner_expr
= stmt_expr_value_expr (inner_expr
);
20628 if (TREE_CODE (inner_expr
) == ADDR_EXPR
)
20629 inner_expr
= TREE_OPERAND (inner_expr
, 0);
20630 if (TREE_CODE (inner_expr
) == COMPONENT_REF
)
20631 inner_expr
= TREE_OPERAND (inner_expr
, 1);
20632 if (is_overloaded_fn (inner_expr
)
20633 || TREE_CODE (inner_expr
) == OFFSET_REF
)
20635 /* There is no need to return a proxy for a variable. */
20638 /* Preserve string constants; conversions from string constants to
20639 "char *" are allowed, even though normally a "const char *"
20640 cannot be used to initialize a "char *". */
20641 if (TREE_CODE (expr
) == STRING_CST
)
20643 /* Preserve arithmetic constants, as an optimization -- there is no
20644 reason to create a new node. */
20645 if (TREE_CODE (expr
) == INTEGER_CST
|| TREE_CODE (expr
) == REAL_CST
)
20647 /* Preserve THROW_EXPRs -- all throw-expressions have type "void".
20648 There is at least one place where we want to know that a
20649 particular expression is a throw-expression: when checking a ?:
20650 expression, there are special rules if the second or third
20651 argument is a throw-expression. */
20652 if (TREE_CODE (expr
) == THROW_EXPR
)
20655 /* Don't wrap an initializer list, we need to be able to look inside. */
20656 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
20659 /* Don't wrap a dummy object, we need to be able to test for it. */
20660 if (is_dummy_object (expr
))
20663 if (TREE_CODE (expr
) == COND_EXPR
)
20664 return build3 (COND_EXPR
,
20666 TREE_OPERAND (expr
, 0),
20667 (TREE_OPERAND (expr
, 1)
20668 ? build_non_dependent_expr (TREE_OPERAND (expr
, 1))
20669 : build_non_dependent_expr (TREE_OPERAND (expr
, 0))),
20670 build_non_dependent_expr (TREE_OPERAND (expr
, 2)));
20671 if (TREE_CODE (expr
) == COMPOUND_EXPR
20672 && !COMPOUND_EXPR_OVERLOADED (expr
))
20673 return build2 (COMPOUND_EXPR
,
20675 TREE_OPERAND (expr
, 0),
20676 build_non_dependent_expr (TREE_OPERAND (expr
, 1)));
20678 /* If the type is unknown, it can't really be non-dependent */
20679 gcc_assert (TREE_TYPE (expr
) != unknown_type_node
);
20681 /* Otherwise, build a NON_DEPENDENT_EXPR. */
20682 return build1 (NON_DEPENDENT_EXPR
, TREE_TYPE (expr
), expr
);
20685 /* ARGS is a vector of expressions as arguments to a function call.
20686 Replace the arguments with equivalent non-dependent expressions.
20687 This modifies ARGS in place. */
20690 make_args_non_dependent (vec
<tree
, va_gc
> *args
)
20695 FOR_EACH_VEC_SAFE_ELT (args
, ix
, arg
)
20697 tree newarg
= build_non_dependent_expr (arg
);
20699 (*args
)[ix
] = newarg
;
20703 /* Returns a type which represents 'auto' or 'decltype(auto)'. We use a
20704 TEMPLATE_TYPE_PARM with a level one deeper than the actual template
20708 make_auto_1 (tree name
)
20710 tree au
= cxx_make_type (TEMPLATE_TYPE_PARM
);
20711 TYPE_NAME (au
) = build_decl (BUILTINS_LOCATION
,
20712 TYPE_DECL
, name
, au
);
20713 TYPE_STUB_DECL (au
) = TYPE_NAME (au
);
20714 TEMPLATE_TYPE_PARM_INDEX (au
) = build_template_parm_index
20715 (0, processing_template_decl
+ 1, processing_template_decl
+ 1,
20716 TYPE_NAME (au
), NULL_TREE
);
20717 TYPE_CANONICAL (au
) = canonical_type_parameter (au
);
20718 DECL_ARTIFICIAL (TYPE_NAME (au
)) = 1;
20719 SET_DECL_TEMPLATE_PARM_P (TYPE_NAME (au
));
20725 make_decltype_auto (void)
20727 return make_auto_1 (get_identifier ("decltype(auto)"));
20733 return make_auto_1 (get_identifier ("auto"));
20736 /* Given type ARG, return std::initializer_list<ARG>. */
20741 tree std_init_list
= namespace_binding
20742 (get_identifier ("initializer_list"), std_node
);
20744 if (!std_init_list
|| !DECL_CLASS_TEMPLATE_P (std_init_list
))
20746 error ("deducing from brace-enclosed initializer list requires "
20747 "#include <initializer_list>");
20748 return error_mark_node
;
20750 argvec
= make_tree_vec (1);
20751 TREE_VEC_ELT (argvec
, 0) = arg
;
20752 return lookup_template_class (std_init_list
, argvec
, NULL_TREE
,
20753 NULL_TREE
, 0, tf_warning_or_error
);
20756 /* Replace auto in TYPE with std::initializer_list<auto>. */
20759 listify_autos (tree type
, tree auto_node
)
20761 tree init_auto
= listify (auto_node
);
20762 tree argvec
= make_tree_vec (1);
20763 TREE_VEC_ELT (argvec
, 0) = init_auto
;
20764 if (processing_template_decl
)
20765 argvec
= add_to_template_args (current_template_args (), argvec
);
20766 return tsubst (type
, argvec
, tf_warning_or_error
, NULL_TREE
);
20769 /* Replace occurrences of 'auto' in TYPE with the appropriate type deduced
20770 from INIT. AUTO_NODE is the TEMPLATE_TYPE_PARM used for 'auto' in TYPE. */
20773 do_auto_deduction (tree type
, tree init
, tree auto_node
)
20777 if (init
== error_mark_node
)
20778 return error_mark_node
;
20780 if (type_dependent_expression_p (init
))
20781 /* Defining a subset of type-dependent expressions that we can deduce
20782 from ahead of time isn't worth the trouble. */
20785 /* [dcl.spec.auto]: Obtain P from T by replacing the occurrences of auto
20786 with either a new invented type template parameter U or, if the
20787 initializer is a braced-init-list (8.5.4), with
20788 std::initializer_list<U>. */
20789 if (BRACE_ENCLOSED_INITIALIZER_P (init
))
20790 type
= listify_autos (type
, auto_node
);
20792 init
= resolve_nondeduced_context (init
);
20794 targs
= make_tree_vec (1);
20795 if (AUTO_IS_DECLTYPE (auto_node
))
20797 bool id
= (DECL_P (init
) || TREE_CODE (init
) == COMPONENT_REF
);
20798 TREE_VEC_ELT (targs
, 0)
20799 = finish_decltype_type (init
, id
, tf_warning_or_error
);
20800 if (type
!= auto_node
)
20802 error ("%qT as type rather than plain %<decltype(auto)%>", type
);
20803 return error_mark_node
;
20808 tree parms
= build_tree_list (NULL_TREE
, type
);
20809 tree tparms
= make_tree_vec (1);
20812 TREE_VEC_ELT (tparms
, 0)
20813 = build_tree_list (NULL_TREE
, TYPE_NAME (auto_node
));
20814 val
= type_unification_real (tparms
, targs
, parms
, &init
, 1, 0,
20815 DEDUCE_CALL
, LOOKUP_NORMAL
,
20816 /*explain_p=*/false);
20819 if (processing_template_decl
)
20820 /* Try again at instantiation time. */
20822 if (type
&& type
!= error_mark_node
)
20823 /* If type is error_mark_node a diagnostic must have been
20824 emitted by now. Also, having a mention to '<type error>'
20825 in the diagnostic is not really useful to the user. */
20827 if (cfun
&& auto_node
== current_function_auto_return_pattern
20828 && LAMBDA_FUNCTION_P (current_function_decl
))
20829 error ("unable to deduce lambda return type from %qE", init
);
20831 error ("unable to deduce %qT from %qE", type
, init
);
20833 return error_mark_node
;
20837 /* If the list of declarators contains more than one declarator, the type
20838 of each declared variable is determined as described above. If the
20839 type deduced for the template parameter U is not the same in each
20840 deduction, the program is ill-formed. */
20841 if (TREE_TYPE (auto_node
)
20842 && !same_type_p (TREE_TYPE (auto_node
), TREE_VEC_ELT (targs
, 0)))
20844 if (cfun
&& auto_node
== current_function_auto_return_pattern
20845 && LAMBDA_FUNCTION_P (current_function_decl
))
20846 error ("inconsistent types %qT and %qT deduced for "
20847 "lambda return type", TREE_TYPE (auto_node
),
20848 TREE_VEC_ELT (targs
, 0));
20850 error ("inconsistent deduction for %qT: %qT and then %qT",
20851 auto_node
, TREE_TYPE (auto_node
), TREE_VEC_ELT (targs
, 0));
20852 return error_mark_node
;
20854 TREE_TYPE (auto_node
) = TREE_VEC_ELT (targs
, 0);
20856 if (processing_template_decl
)
20857 targs
= add_to_template_args (current_template_args (), targs
);
20858 return tsubst (type
, targs
, tf_warning_or_error
, NULL_TREE
);
20861 /* Substitutes LATE_RETURN_TYPE for 'auto' in TYPE and returns the
20865 splice_late_return_type (tree type
, tree late_return_type
)
20869 if (late_return_type
== NULL_TREE
)
20871 argvec
= make_tree_vec (1);
20872 TREE_VEC_ELT (argvec
, 0) = late_return_type
;
20873 if (processing_template_parmlist
)
20874 /* For a late-specified return type in a template type-parameter, we
20875 need to add a dummy argument level for its parmlist. */
20876 argvec
= add_to_template_args
20877 (make_tree_vec (processing_template_parmlist
), argvec
);
20878 if (current_template_parms
)
20879 argvec
= add_to_template_args (current_template_args (), argvec
);
20880 return tsubst (type
, argvec
, tf_warning_or_error
, NULL_TREE
);
20883 /* Returns true iff TYPE is a TEMPLATE_TYPE_PARM representing 'auto' or
20884 'decltype(auto)'. */
20887 is_auto (const_tree type
)
20889 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
20890 && (TYPE_IDENTIFIER (type
) == get_identifier ("auto")
20891 || TYPE_IDENTIFIER (type
) == get_identifier ("decltype(auto)")))
20897 /* Returns true iff TYPE contains a use of 'auto'. Since auto can only
20898 appear as a type-specifier for the declaration in question, we don't
20899 have to look through the whole type. */
20902 type_uses_auto (tree type
)
20904 enum tree_code code
;
20905 if (is_auto (type
))
20908 code
= TREE_CODE (type
);
20910 if (code
== POINTER_TYPE
|| code
== REFERENCE_TYPE
20911 || code
== OFFSET_TYPE
|| code
== FUNCTION_TYPE
20912 || code
== METHOD_TYPE
|| code
== ARRAY_TYPE
)
20913 return type_uses_auto (TREE_TYPE (type
));
20915 if (TYPE_PTRMEMFUNC_P (type
))
20916 return type_uses_auto (TREE_TYPE (TREE_TYPE
20917 (TYPE_PTRMEMFUNC_FN_TYPE (type
))));
20922 /* For a given template T, return the vector of typedefs referenced
20923 in T for which access check is needed at T instantiation time.
20924 T is either a FUNCTION_DECL or a RECORD_TYPE.
20925 Those typedefs were added to T by the function
20926 append_type_to_template_for_access_check. */
20928 vec
<qualified_typedef_usage_t
, va_gc
> *
20929 get_types_needing_access_check (tree t
)
20932 vec
<qualified_typedef_usage_t
, va_gc
> *result
= NULL
;
20934 if (!t
|| t
== error_mark_node
)
20937 if (!(ti
= get_template_info (t
)))
20940 if (CLASS_TYPE_P (t
)
20941 || TREE_CODE (t
) == FUNCTION_DECL
)
20943 if (!TI_TEMPLATE (ti
))
20946 result
= TI_TYPEDEFS_NEEDING_ACCESS_CHECKING (ti
);
20952 /* Append the typedef TYPE_DECL used in template T to a list of typedefs
20953 tied to T. That list of typedefs will be access checked at
20954 T instantiation time.
20955 T is either a FUNCTION_DECL or a RECORD_TYPE.
20956 TYPE_DECL is a TYPE_DECL node representing a typedef.
20957 SCOPE is the scope through which TYPE_DECL is accessed.
20958 LOCATION is the location of the usage point of TYPE_DECL.
20960 This function is a subroutine of
20961 append_type_to_template_for_access_check. */
20964 append_type_to_template_for_access_check_1 (tree t
,
20967 location_t location
)
20969 qualified_typedef_usage_t typedef_usage
;
20972 if (!t
|| t
== error_mark_node
)
20975 gcc_assert ((TREE_CODE (t
) == FUNCTION_DECL
20976 || CLASS_TYPE_P (t
))
20978 && TREE_CODE (type_decl
) == TYPE_DECL
20981 if (!(ti
= get_template_info (t
)))
20984 gcc_assert (TI_TEMPLATE (ti
));
20986 typedef_usage
.typedef_decl
= type_decl
;
20987 typedef_usage
.context
= scope
;
20988 typedef_usage
.locus
= location
;
20990 vec_safe_push (TI_TYPEDEFS_NEEDING_ACCESS_CHECKING (ti
), typedef_usage
);
20993 /* Append TYPE_DECL to the template TEMPL.
20994 TEMPL is either a class type, a FUNCTION_DECL or a a TEMPLATE_DECL.
20995 At TEMPL instanciation time, TYPE_DECL will be checked to see
20996 if it can be accessed through SCOPE.
20997 LOCATION is the location of the usage point of TYPE_DECL.
20999 e.g. consider the following code snippet:
21006 template<class U> struct S
21008 C::myint mi; // <-- usage point of the typedef C::myint
21013 At S<char> instantiation time, we need to check the access of C::myint
21014 In other words, we need to check the access of the myint typedef through
21015 the C scope. For that purpose, this function will add the myint typedef
21016 and the scope C through which its being accessed to a list of typedefs
21017 tied to the template S. That list will be walked at template instantiation
21018 time and access check performed on each typedefs it contains.
21019 Note that this particular code snippet should yield an error because
21020 myint is private to C. */
21023 append_type_to_template_for_access_check (tree templ
,
21026 location_t location
)
21028 qualified_typedef_usage_t
*iter
;
21031 gcc_assert (type_decl
&& (TREE_CODE (type_decl
) == TYPE_DECL
));
21033 /* Make sure we don't append the type to the template twice. */
21034 FOR_EACH_VEC_SAFE_ELT (get_types_needing_access_check (templ
), i
, iter
)
21035 if (iter
->typedef_decl
== type_decl
&& scope
== iter
->context
)
21038 append_type_to_template_for_access_check_1 (templ
, type_decl
,
21042 /* Set up the hash tables for template instantiations. */
21045 init_template_processing (void)
21047 decl_specializations
= htab_create_ggc (37,
21048 hash_specialization
,
21049 eq_specializations
,
21051 type_specializations
= htab_create_ggc (37,
21052 hash_specialization
,
21053 eq_specializations
,
21057 /* Print stats about the template hash tables for -fstats. */
21060 print_template_statistics (void)
21062 fprintf (stderr
, "decl_specializations: size %ld, %ld elements, "
21063 "%f collisions\n", (long) htab_size (decl_specializations
),
21064 (long) htab_elements (decl_specializations
),
21065 htab_collisions (decl_specializations
));
21066 fprintf (stderr
, "type_specializations: size %ld, %ld elements, "
21067 "%f collisions\n", (long) htab_size (type_specializations
),
21068 (long) htab_elements (type_specializations
),
21069 htab_collisions (type_specializations
));
21072 #include "gt-cp-pt.h"