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 (!dependent_template_arg_p (orig_arg
)
6372 && !uses_template_parms (t
))
6373 /* We used to call digest_init here. However, digest_init
6374 will report errors, which we don't want when complain
6375 is zero. More importantly, digest_init will try too
6376 hard to convert things: for example, `0' should not be
6377 converted to pointer type at this point according to
6378 the standard. Accepting this is not merely an
6379 extension, since deciding whether or not these
6380 conversions can occur is part of determining which
6381 function template to call, or whether a given explicit
6382 argument specification is valid. */
6383 val
= convert_nontype_argument (t
, orig_arg
, complain
);
6385 val
= strip_typedefs_expr (orig_arg
);
6387 if (val
== NULL_TREE
)
6388 val
= error_mark_node
;
6389 else if (val
== error_mark_node
&& (complain
& tf_error
))
6390 error ("could not convert template argument %qE to %qT", orig_arg
, t
);
6392 if (TREE_CODE (val
) == SCOPE_REF
)
6394 /* Strip typedefs from the SCOPE_REF. */
6395 tree type
= canonicalize_type_argument (TREE_TYPE (val
), complain
);
6396 tree scope
= canonicalize_type_argument (TREE_OPERAND (val
, 0),
6398 val
= build_qualified_name (type
, scope
, TREE_OPERAND (val
, 1),
6399 QUALIFIED_NAME_IS_TEMPLATE (val
));
6406 /* Coerces the remaining template arguments in INNER_ARGS (from
6407 ARG_IDX to the end) into the parameter pack at PARM_IDX in PARMS.
6408 Returns the coerced argument pack. PARM_IDX is the position of this
6409 parameter in the template parameter list. ARGS is the original
6410 template argument list. */
6412 coerce_template_parameter_pack (tree parms
,
6420 tsubst_flags_t complain
)
6422 tree parm
= TREE_VEC_ELT (parms
, parm_idx
);
6423 int nargs
= inner_args
? NUM_TMPL_ARGS (inner_args
) : 0;
6426 tree packed_types
= NULL_TREE
;
6428 if (arg_idx
> nargs
)
6431 packed_args
= make_tree_vec (nargs
- arg_idx
);
6433 if (TREE_CODE (TREE_VALUE (parm
)) == PARM_DECL
6434 && uses_parameter_packs (TREE_TYPE (TREE_VALUE (parm
))))
6436 /* When the template parameter is a non-type template
6437 parameter pack whose type uses parameter packs, we need
6438 to look at each of the template arguments
6439 separately. Build a vector of the types for these
6440 non-type template parameters in PACKED_TYPES. */
6442 = make_pack_expansion (TREE_TYPE (TREE_VALUE (parm
)));
6443 packed_types
= tsubst_pack_expansion (expansion
, args
,
6446 if (packed_types
== error_mark_node
)
6447 return error_mark_node
;
6449 /* Check that we have the right number of arguments. */
6451 && !PACK_EXPANSION_P (TREE_VEC_ELT (inner_args
, arg_idx
))
6452 && nargs
- arg_idx
!= TREE_VEC_LENGTH (packed_types
))
6455 = TREE_VEC_LENGTH (parms
) - 1 + TREE_VEC_LENGTH (packed_types
);
6456 error ("wrong number of template arguments (%d, should be %d)",
6457 nargs
, needed_parms
);
6458 return error_mark_node
;
6461 /* If we aren't able to check the actual arguments now
6462 (because they haven't been expanded yet), we can at least
6463 verify that all of the types used for the non-type
6464 template parameter pack are, in fact, valid for non-type
6465 template parameters. */
6467 && PACK_EXPANSION_P (TREE_VEC_ELT (inner_args
, arg_idx
)))
6469 int j
, len
= TREE_VEC_LENGTH (packed_types
);
6470 for (j
= 0; j
< len
; ++j
)
6472 tree t
= TREE_VEC_ELT (packed_types
, j
);
6473 if (invalid_nontype_parm_type_p (t
, complain
))
6474 return error_mark_node
;
6479 /* Convert the remaining arguments, which will be a part of the
6480 parameter pack "parm". */
6481 for (; arg_idx
< nargs
; ++arg_idx
)
6483 tree arg
= TREE_VEC_ELT (inner_args
, arg_idx
);
6484 tree actual_parm
= TREE_VALUE (parm
);
6486 if (packed_types
&& !PACK_EXPANSION_P (arg
))
6488 /* When we have a vector of types (corresponding to the
6489 non-type template parameter pack that uses parameter
6490 packs in its type, as mention above), and the
6491 argument is not an expansion (which expands to a
6492 currently unknown number of arguments), clone the
6493 parm and give it the next type in PACKED_TYPES. */
6494 actual_parm
= copy_node (actual_parm
);
6495 TREE_TYPE (actual_parm
) =
6496 TREE_VEC_ELT (packed_types
, arg_idx
- parm_idx
);
6499 if (arg
== error_mark_node
)
6501 if (complain
& tf_error
)
6502 error ("template argument %d is invalid", arg_idx
+ 1);
6505 arg
= convert_template_argument (actual_parm
,
6506 arg
, new_args
, complain
, parm_idx
,
6508 if (arg
== error_mark_node
)
6510 TREE_VEC_ELT (packed_args
, arg_idx
- parm_idx
) = arg
;
6513 if (TREE_CODE (TREE_VALUE (parm
)) == TYPE_DECL
6514 || TREE_CODE (TREE_VALUE (parm
)) == TEMPLATE_DECL
)
6515 argument_pack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
6518 argument_pack
= make_node (NONTYPE_ARGUMENT_PACK
);
6519 TREE_TYPE (argument_pack
)
6520 = tsubst (TREE_TYPE (TREE_VALUE (parm
)), new_args
, complain
, in_decl
);
6521 TREE_CONSTANT (argument_pack
) = 1;
6524 SET_ARGUMENT_PACK_ARGS (argument_pack
, packed_args
);
6525 #ifdef ENABLE_CHECKING
6526 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (packed_args
,
6527 TREE_VEC_LENGTH (packed_args
));
6529 return argument_pack
;
6532 /* Returns true if the template argument vector ARGS contains
6533 any pack expansions, false otherwise. */
6536 any_pack_expanson_args_p (tree args
)
6540 for (i
= 0; i
< TREE_VEC_LENGTH (args
); ++i
)
6541 if (PACK_EXPANSION_P (TREE_VEC_ELT (args
, i
)))
6546 /* Convert all template arguments to their appropriate types, and
6547 return a vector containing the innermost resulting template
6548 arguments. If any error occurs, return error_mark_node. Error and
6549 warning messages are issued under control of COMPLAIN.
6551 If REQUIRE_ALL_ARGS is false, argument deduction will be performed
6552 for arguments not specified in ARGS. Otherwise, if
6553 USE_DEFAULT_ARGS is true, default arguments will be used to fill in
6554 unspecified arguments. If REQUIRE_ALL_ARGS is true, but
6555 USE_DEFAULT_ARGS is false, then all arguments must be specified in
6559 coerce_template_parms (tree parms
,
6562 tsubst_flags_t complain
,
6563 bool require_all_args
,
6564 bool use_default_args
)
6566 int nparms
, nargs
, parm_idx
, arg_idx
, lost
= 0;
6569 tree new_inner_args
;
6570 int saved_unevaluated_operand
;
6571 int saved_inhibit_evaluation_warnings
;
6573 /* When used as a boolean value, indicates whether this is a
6574 variadic template parameter list. Since it's an int, we can also
6575 subtract it from nparms to get the number of non-variadic
6578 int post_variadic_parms
= 0;
6580 if (args
== error_mark_node
)
6581 return error_mark_node
;
6583 nparms
= TREE_VEC_LENGTH (parms
);
6585 /* Determine if there are any parameter packs. */
6586 for (parm_idx
= 0; parm_idx
< nparms
; ++parm_idx
)
6588 tree tparm
= TREE_VALUE (TREE_VEC_ELT (parms
, parm_idx
));
6590 ++post_variadic_parms
;
6591 if (template_parameter_pack_p (tparm
))
6595 inner_args
= INNERMOST_TEMPLATE_ARGS (args
);
6596 /* If there are no parameters that follow a parameter pack, we need to
6597 expand any argument packs so that we can deduce a parameter pack from
6598 some non-packed args followed by an argument pack, as in variadic85.C.
6599 If there are such parameters, we need to leave argument packs intact
6600 so the arguments are assigned properly. This can happen when dealing
6601 with a nested class inside a partial specialization of a class
6602 template, as in variadic92.C, or when deducing a template parameter pack
6603 from a sub-declarator, as in variadic114.C. */
6604 if (!post_variadic_parms
)
6605 inner_args
= expand_template_argument_pack (inner_args
);
6607 nargs
= inner_args
? NUM_TMPL_ARGS (inner_args
) : 0;
6608 if ((nargs
> nparms
&& !variadic_p
)
6609 || (nargs
< nparms
- variadic_p
6611 && !any_pack_expanson_args_p (inner_args
)
6612 && (!use_default_args
6613 || (TREE_VEC_ELT (parms
, nargs
) != error_mark_node
6614 && !TREE_PURPOSE (TREE_VEC_ELT (parms
, nargs
))))))
6616 if (complain
& tf_error
)
6620 nparms
-= variadic_p
;
6621 error ("wrong number of template arguments "
6622 "(%d, should be %d or more)", nargs
, nparms
);
6625 error ("wrong number of template arguments "
6626 "(%d, should be %d)", nargs
, nparms
);
6629 error ("provided for %q+D", in_decl
);
6632 return error_mark_node
;
6635 /* We need to evaluate the template arguments, even though this
6636 template-id may be nested within a "sizeof". */
6637 saved_unevaluated_operand
= cp_unevaluated_operand
;
6638 cp_unevaluated_operand
= 0;
6639 saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
6640 c_inhibit_evaluation_warnings
= 0;
6641 new_inner_args
= make_tree_vec (nparms
);
6642 new_args
= add_outermost_template_args (args
, new_inner_args
);
6643 for (parm_idx
= 0, arg_idx
= 0; parm_idx
< nparms
; parm_idx
++, arg_idx
++)
6648 /* Get the Ith template parameter. */
6649 parm
= TREE_VEC_ELT (parms
, parm_idx
);
6651 if (parm
== error_mark_node
)
6653 TREE_VEC_ELT (new_inner_args
, arg_idx
) = error_mark_node
;
6657 /* Calculate the next argument. */
6658 if (arg_idx
< nargs
)
6659 arg
= TREE_VEC_ELT (inner_args
, arg_idx
);
6663 if (template_parameter_pack_p (TREE_VALUE (parm
))
6664 && !(arg
&& ARGUMENT_PACK_P (arg
)))
6666 /* All remaining arguments will be placed in the
6667 template parameter pack PARM. */
6668 arg
= coerce_template_parameter_pack (parms
, parm_idx
, args
,
6669 inner_args
, arg_idx
,
6673 /* Store this argument. */
6674 if (arg
== error_mark_node
)
6676 TREE_VEC_ELT (new_inner_args
, parm_idx
) = arg
;
6678 /* We are done with all of the arguments. */
6685 if (PACK_EXPANSION_P (arg
))
6687 /* We don't know how many args we have yet, just
6688 use the unconverted ones for now. */
6689 new_inner_args
= inner_args
;
6693 else if (require_all_args
)
6695 /* There must be a default arg in this case. */
6696 arg
= tsubst_template_arg (TREE_PURPOSE (parm
), new_args
,
6698 /* The position of the first default template argument,
6699 is also the number of non-defaulted arguments in NEW_INNER_ARGS.
6701 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
))
6702 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
, arg_idx
);
6707 if (arg
== error_mark_node
)
6709 if (complain
& tf_error
)
6710 error ("template argument %d is invalid", arg_idx
+ 1);
6713 /* This only occurs if there was an error in the template
6714 parameter list itself (which we would already have
6715 reported) that we are trying to recover from, e.g., a class
6716 template with a parameter list such as
6717 template<typename..., typename>. */
6720 arg
= convert_template_argument (TREE_VALUE (parm
),
6721 arg
, new_args
, complain
,
6724 if (arg
== error_mark_node
)
6726 TREE_VEC_ELT (new_inner_args
, arg_idx
) = arg
;
6728 cp_unevaluated_operand
= saved_unevaluated_operand
;
6729 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
6732 return error_mark_node
;
6734 #ifdef ENABLE_CHECKING
6735 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
))
6736 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
,
6737 TREE_VEC_LENGTH (new_inner_args
));
6740 return new_inner_args
;
6743 /* Like coerce_template_parms. If PARMS represents all template
6744 parameters levels, this function returns a vector of vectors
6745 representing all the resulting argument levels. Note that in this
6746 case, only the innermost arguments are coerced because the
6747 outermost ones are supposed to have been coerced already.
6749 Otherwise, if PARMS represents only (the innermost) vector of
6750 parameters, this function returns a vector containing just the
6751 innermost resulting arguments. */
6754 coerce_innermost_template_parms (tree parms
,
6757 tsubst_flags_t complain
,
6758 bool require_all_args
,
6759 bool use_default_args
)
6761 int parms_depth
= TMPL_PARMS_DEPTH (parms
);
6762 int args_depth
= TMPL_ARGS_DEPTH (args
);
6765 if (parms_depth
> 1)
6767 coerced_args
= make_tree_vec (parms_depth
);
6771 for (level
= parms
, cur_depth
= parms_depth
;
6772 parms_depth
> 0 && level
!= NULL_TREE
;
6773 level
= TREE_CHAIN (level
), --cur_depth
)
6776 if (cur_depth
== args_depth
)
6777 l
= coerce_template_parms (TREE_VALUE (level
),
6778 args
, in_decl
, complain
,
6782 l
= TMPL_ARGS_LEVEL (args
, cur_depth
);
6784 if (l
== error_mark_node
)
6785 return error_mark_node
;
6787 SET_TMPL_ARGS_LEVEL (coerced_args
, cur_depth
, l
);
6791 coerced_args
= coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parms
),
6792 args
, in_decl
, complain
,
6795 return coerced_args
;
6798 /* Returns 1 if template args OT and NT are equivalent. */
6801 template_args_equal (tree ot
, tree nt
)
6805 if (nt
== NULL_TREE
|| ot
== NULL_TREE
)
6808 if (TREE_CODE (nt
) == TREE_VEC
)
6809 /* For member templates */
6810 return TREE_CODE (ot
) == TREE_VEC
&& comp_template_args (ot
, nt
);
6811 else if (PACK_EXPANSION_P (ot
))
6812 return (PACK_EXPANSION_P (nt
)
6813 && template_args_equal (PACK_EXPANSION_PATTERN (ot
),
6814 PACK_EXPANSION_PATTERN (nt
))
6815 && template_args_equal (PACK_EXPANSION_EXTRA_ARGS (ot
),
6816 PACK_EXPANSION_EXTRA_ARGS (nt
)));
6817 else if (ARGUMENT_PACK_P (ot
))
6822 if (!ARGUMENT_PACK_P (nt
))
6825 opack
= ARGUMENT_PACK_ARGS (ot
);
6826 npack
= ARGUMENT_PACK_ARGS (nt
);
6827 len
= TREE_VEC_LENGTH (opack
);
6828 if (TREE_VEC_LENGTH (npack
) != len
)
6830 for (i
= 0; i
< len
; ++i
)
6831 if (!template_args_equal (TREE_VEC_ELT (opack
, i
),
6832 TREE_VEC_ELT (npack
, i
)))
6836 else if (ot
&& TREE_CODE (ot
) == ARGUMENT_PACK_SELECT
)
6838 /* We get here probably because we are in the middle of substituting
6839 into the pattern of a pack expansion. In that case the
6840 ARGUMENT_PACK_SELECT temporarily replaces the pack argument we are
6841 interested in. So we want to use the initial pack argument for
6843 ot
= ARGUMENT_PACK_SELECT_FROM_PACK (ot
);
6844 if (nt
&& TREE_CODE (nt
) == ARGUMENT_PACK_SELECT
)
6845 nt
= ARGUMENT_PACK_SELECT_FROM_PACK (nt
);
6846 return template_args_equal (ot
, nt
);
6848 else if (TYPE_P (nt
))
6849 return TYPE_P (ot
) && same_type_p (ot
, nt
);
6850 else if (TREE_CODE (ot
) == TREE_VEC
|| TYPE_P (ot
))
6853 return cp_tree_equal (ot
, nt
);
6856 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets of
6857 template arguments. Returns 0 otherwise, and updates OLDARG_PTR and
6858 NEWARG_PTR with the offending arguments if they are non-NULL. */
6861 comp_template_args_with_info (tree oldargs
, tree newargs
,
6862 tree
*oldarg_ptr
, tree
*newarg_ptr
)
6866 if (oldargs
== newargs
)
6869 if (!oldargs
|| !newargs
)
6872 if (TREE_VEC_LENGTH (oldargs
) != TREE_VEC_LENGTH (newargs
))
6875 for (i
= 0; i
< TREE_VEC_LENGTH (oldargs
); ++i
)
6877 tree nt
= TREE_VEC_ELT (newargs
, i
);
6878 tree ot
= TREE_VEC_ELT (oldargs
, i
);
6880 if (! template_args_equal (ot
, nt
))
6882 if (oldarg_ptr
!= NULL
)
6884 if (newarg_ptr
!= NULL
)
6892 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets
6893 of template arguments. Returns 0 otherwise. */
6896 comp_template_args (tree oldargs
, tree newargs
)
6898 return comp_template_args_with_info (oldargs
, newargs
, NULL
, NULL
);
6902 add_pending_template (tree d
)
6904 tree ti
= (TYPE_P (d
)
6905 ? CLASSTYPE_TEMPLATE_INFO (d
)
6906 : DECL_TEMPLATE_INFO (d
));
6907 struct pending_template
*pt
;
6910 if (TI_PENDING_TEMPLATE_FLAG (ti
))
6913 /* We are called both from instantiate_decl, where we've already had a
6914 tinst_level pushed, and instantiate_template, where we haven't.
6916 level
= !current_tinst_level
|| current_tinst_level
->decl
!= d
;
6919 push_tinst_level (d
);
6921 pt
= ggc_alloc_pending_template ();
6923 pt
->tinst
= current_tinst_level
;
6924 if (last_pending_template
)
6925 last_pending_template
->next
= pt
;
6927 pending_templates
= pt
;
6929 last_pending_template
= pt
;
6931 TI_PENDING_TEMPLATE_FLAG (ti
) = 1;
6938 /* Return a TEMPLATE_ID_EXPR corresponding to the indicated FNS and
6939 ARGLIST. Valid choices for FNS are given in the cp-tree.def
6940 documentation for TEMPLATE_ID_EXPR. */
6943 lookup_template_function (tree fns
, tree arglist
)
6947 if (fns
== error_mark_node
|| arglist
== error_mark_node
)
6948 return error_mark_node
;
6950 gcc_assert (!arglist
|| TREE_CODE (arglist
) == TREE_VEC
);
6952 if (!is_overloaded_fn (fns
) && !identifier_p (fns
))
6954 error ("%q#D is not a function template", fns
);
6955 return error_mark_node
;
6958 if (BASELINK_P (fns
))
6960 BASELINK_FUNCTIONS (fns
) = build2 (TEMPLATE_ID_EXPR
,
6962 BASELINK_FUNCTIONS (fns
),
6967 type
= TREE_TYPE (fns
);
6968 if (TREE_CODE (fns
) == OVERLOAD
|| !type
)
6969 type
= unknown_type_node
;
6971 return build2 (TEMPLATE_ID_EXPR
, type
, fns
, arglist
);
6974 /* Within the scope of a template class S<T>, the name S gets bound
6975 (in build_self_reference) to a TYPE_DECL for the class, not a
6976 TEMPLATE_DECL. If DECL is a TYPE_DECL for current_class_type,
6977 or one of its enclosing classes, and that type is a template,
6978 return the associated TEMPLATE_DECL. Otherwise, the original
6981 Also handle the case when DECL is a TREE_LIST of ambiguous
6982 injected-class-names from different bases. */
6985 maybe_get_template_decl_from_type_decl (tree decl
)
6987 if (decl
== NULL_TREE
)
6990 /* DR 176: A lookup that finds an injected-class-name (10.2
6991 [class.member.lookup]) can result in an ambiguity in certain cases
6992 (for example, if it is found in more than one base class). If all of
6993 the injected-class-names that are found refer to specializations of
6994 the same class template, and if the name is followed by a
6995 template-argument-list, the reference refers to the class template
6996 itself and not a specialization thereof, and is not ambiguous. */
6997 if (TREE_CODE (decl
) == TREE_LIST
)
6999 tree t
, tmpl
= NULL_TREE
;
7000 for (t
= decl
; t
; t
= TREE_CHAIN (t
))
7002 tree elt
= maybe_get_template_decl_from_type_decl (TREE_VALUE (t
));
7005 else if (tmpl
!= elt
)
7008 if (tmpl
&& t
== NULL_TREE
)
7014 return (decl
!= NULL_TREE
7015 && DECL_SELF_REFERENCE_P (decl
)
7016 && CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (decl
)))
7017 ? CLASSTYPE_TI_TEMPLATE (TREE_TYPE (decl
)) : decl
;
7020 /* Given an IDENTIFIER_NODE (or type TEMPLATE_DECL) and a chain of
7021 parameters, find the desired type.
7023 D1 is the PTYPENAME terminal, and ARGLIST is the list of arguments.
7025 IN_DECL, if non-NULL, is the template declaration we are trying to
7028 If ENTERING_SCOPE is nonzero, we are about to enter the scope of
7029 the class we are looking up.
7031 Issue error and warning messages under control of COMPLAIN.
7033 If the template class is really a local class in a template
7034 function, then the FUNCTION_CONTEXT is the function in which it is
7037 ??? Note that this function is currently called *twice* for each
7038 template-id: the first time from the parser, while creating the
7039 incomplete type (finish_template_type), and the second type during the
7040 real instantiation (instantiate_template_class). This is surely something
7041 that we want to avoid. It also causes some problems with argument
7042 coercion (see convert_nontype_argument for more information on this). */
7045 lookup_template_class_1 (tree d1
, tree arglist
, tree in_decl
, tree context
,
7046 int entering_scope
, tsubst_flags_t complain
)
7048 tree templ
= NULL_TREE
, parmlist
;
7055 if (identifier_p (d1
))
7057 tree value
= innermost_non_namespace_value (d1
);
7058 if (value
&& DECL_TEMPLATE_TEMPLATE_PARM_P (value
))
7063 push_decl_namespace (context
);
7064 templ
= lookup_name (d1
);
7065 templ
= maybe_get_template_decl_from_type_decl (templ
);
7067 pop_decl_namespace ();
7070 context
= DECL_CONTEXT (templ
);
7072 else if (TREE_CODE (d1
) == TYPE_DECL
&& MAYBE_CLASS_TYPE_P (TREE_TYPE (d1
)))
7074 tree type
= TREE_TYPE (d1
);
7076 /* If we are declaring a constructor, say A<T>::A<T>, we will get
7077 an implicit typename for the second A. Deal with it. */
7078 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
7079 type
= TREE_TYPE (type
);
7081 if (CLASSTYPE_TEMPLATE_INFO (type
))
7083 templ
= CLASSTYPE_TI_TEMPLATE (type
);
7084 d1
= DECL_NAME (templ
);
7087 else if (TREE_CODE (d1
) == ENUMERAL_TYPE
7088 || (TYPE_P (d1
) && MAYBE_CLASS_TYPE_P (d1
)))
7090 templ
= TYPE_TI_TEMPLATE (d1
);
7091 d1
= DECL_NAME (templ
);
7093 else if (TREE_CODE (d1
) == TEMPLATE_DECL
7094 && DECL_TEMPLATE_RESULT (d1
)
7095 && TREE_CODE (DECL_TEMPLATE_RESULT (d1
)) == TYPE_DECL
)
7098 d1
= DECL_NAME (templ
);
7099 context
= DECL_CONTEXT (templ
);
7101 else if (DECL_TEMPLATE_TEMPLATE_PARM_P (d1
))
7104 d1
= DECL_NAME (templ
);
7107 /* Issue an error message if we didn't find a template. */
7110 if (complain
& tf_error
)
7111 error ("%qT is not a template", d1
);
7112 return error_mark_node
;
7115 if (TREE_CODE (templ
) != TEMPLATE_DECL
7116 /* Make sure it's a user visible template, if it was named by
7118 || ((complain
& tf_user
) && !DECL_TEMPLATE_PARM_P (templ
)
7119 && !PRIMARY_TEMPLATE_P (templ
)))
7121 if (complain
& tf_error
)
7123 error ("non-template type %qT used as a template", d1
);
7125 error ("for template declaration %q+D", in_decl
);
7127 return error_mark_node
;
7130 complain
&= ~tf_user
;
7132 if (DECL_TEMPLATE_TEMPLATE_PARM_P (templ
))
7134 /* Create a new TEMPLATE_DECL and TEMPLATE_TEMPLATE_PARM node to store
7135 template arguments */
7141 parmlist
= DECL_INNERMOST_TEMPLATE_PARMS (templ
);
7143 /* Consider an example where a template template parameter declared as
7145 template <class T, class U = std::allocator<T> > class TT
7147 The template parameter level of T and U are one level larger than
7148 of TT. To proper process the default argument of U, say when an
7149 instantiation `TT<int>' is seen, we need to build the full
7150 arguments containing {int} as the innermost level. Outer levels,
7151 available when not appearing as default template argument, can be
7152 obtained from the arguments of the enclosing template.
7154 Suppose that TT is later substituted with std::vector. The above
7155 instantiation is `TT<int, std::allocator<T> >' with TT at
7156 level 1, and T at level 2, while the template arguments at level 1
7157 becomes {std::vector} and the inner level 2 is {int}. */
7159 outer
= DECL_CONTEXT (templ
);
7161 outer
= TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (outer
)));
7162 else if (current_template_parms
)
7163 /* This is an argument of the current template, so we haven't set
7164 DECL_CONTEXT yet. */
7165 outer
= current_template_args ();
7168 arglist
= add_to_template_args (outer
, arglist
);
7170 arglist2
= coerce_template_parms (parmlist
, arglist
, templ
,
7172 /*require_all_args=*/true,
7173 /*use_default_args=*/true);
7174 if (arglist2
== error_mark_node
7175 || (!uses_template_parms (arglist2
)
7176 && check_instantiated_args (templ
, arglist2
, complain
)))
7177 return error_mark_node
;
7179 parm
= bind_template_template_parm (TREE_TYPE (templ
), arglist2
);
7184 tree template_type
= TREE_TYPE (templ
);
7187 tree found
= NULL_TREE
;
7190 int is_dependent_type
;
7191 int use_partial_inst_tmpl
= false;
7193 if (template_type
== error_mark_node
)
7194 /* An error occured while building the template TEMPL, and a
7195 diagnostic has most certainly been emitted for that
7196 already. Let's propagate that error. */
7197 return error_mark_node
;
7199 gen_tmpl
= most_general_template (templ
);
7200 parmlist
= DECL_TEMPLATE_PARMS (gen_tmpl
);
7201 parm_depth
= TMPL_PARMS_DEPTH (parmlist
);
7202 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
7204 if (arg_depth
== 1 && parm_depth
> 1)
7206 /* We've been given an incomplete set of template arguments.
7209 template <class T> struct S1 {
7210 template <class U> struct S2 {};
7211 template <class U> struct S2<U*> {};
7214 we will be called with an ARGLIST of `U*', but the
7215 TEMPLATE will be `template <class T> template
7216 <class U> struct S1<T>::S2'. We must fill in the missing
7219 = add_outermost_template_args (TYPE_TI_ARGS (TREE_TYPE (templ
)),
7221 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
7224 /* Now we should have enough arguments. */
7225 gcc_assert (parm_depth
== arg_depth
);
7227 /* From here on, we're only interested in the most general
7230 /* Calculate the BOUND_ARGS. These will be the args that are
7231 actually tsubst'd into the definition to create the
7235 /* We have multiple levels of arguments to coerce, at once. */
7237 int saved_depth
= TMPL_ARGS_DEPTH (arglist
);
7239 tree bound_args
= make_tree_vec (parm_depth
);
7241 for (i
= saved_depth
,
7242 t
= DECL_TEMPLATE_PARMS (gen_tmpl
);
7243 i
> 0 && t
!= NULL_TREE
;
7244 --i
, t
= TREE_CHAIN (t
))
7247 if (i
== saved_depth
)
7248 a
= coerce_template_parms (TREE_VALUE (t
),
7251 /*require_all_args=*/true,
7252 /*use_default_args=*/true);
7254 /* Outer levels should have already been coerced. */
7255 a
= TMPL_ARGS_LEVEL (arglist
, i
);
7257 /* Don't process further if one of the levels fails. */
7258 if (a
== error_mark_node
)
7260 /* Restore the ARGLIST to its full size. */
7261 TREE_VEC_LENGTH (arglist
) = saved_depth
;
7262 return error_mark_node
;
7265 SET_TMPL_ARGS_LEVEL (bound_args
, i
, a
);
7267 /* We temporarily reduce the length of the ARGLIST so
7268 that coerce_template_parms will see only the arguments
7269 corresponding to the template parameters it is
7271 TREE_VEC_LENGTH (arglist
)--;
7274 /* Restore the ARGLIST to its full size. */
7275 TREE_VEC_LENGTH (arglist
) = saved_depth
;
7277 arglist
= bound_args
;
7281 = coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parmlist
),
7282 INNERMOST_TEMPLATE_ARGS (arglist
),
7285 /*require_all_args=*/true,
7286 /*use_default_args=*/true);
7288 if (arglist
== error_mark_node
)
7289 /* We were unable to bind the arguments. */
7290 return error_mark_node
;
7292 /* In the scope of a template class, explicit references to the
7293 template class refer to the type of the template, not any
7294 instantiation of it. For example, in:
7296 template <class T> class C { void f(C<T>); }
7298 the `C<T>' is just the same as `C'. Outside of the
7299 class, however, such a reference is an instantiation. */
7301 || !PRIMARY_TEMPLATE_P (gen_tmpl
)
7302 || currently_open_class (template_type
))
7303 /* comp_template_args is expensive, check it last. */
7304 && comp_template_args (TYPE_TI_ARGS (template_type
),
7306 return template_type
;
7308 /* If we already have this specialization, return it. */
7309 elt
.tmpl
= gen_tmpl
;
7311 hash
= hash_specialization (&elt
);
7312 entry
= (spec_entry
*) htab_find_with_hash (type_specializations
,
7318 is_dependent_type
= uses_template_parms (arglist
);
7320 /* If the deduced arguments are invalid, then the binding
7322 if (!is_dependent_type
7323 && check_instantiated_args (gen_tmpl
,
7324 INNERMOST_TEMPLATE_ARGS (arglist
),
7326 return error_mark_node
;
7328 if (!is_dependent_type
7329 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
7330 && !LAMBDA_TYPE_P (TREE_TYPE (gen_tmpl
))
7331 && TREE_CODE (CP_DECL_CONTEXT (gen_tmpl
)) == NAMESPACE_DECL
)
7333 found
= xref_tag_from_type (TREE_TYPE (gen_tmpl
),
7334 DECL_NAME (gen_tmpl
),
7335 /*tag_scope=*/ts_global
);
7339 context
= tsubst (DECL_CONTEXT (gen_tmpl
), arglist
,
7341 if (context
== error_mark_node
)
7342 return error_mark_node
;
7345 context
= global_namespace
;
7347 /* Create the type. */
7348 if (TREE_CODE (template_type
) == ENUMERAL_TYPE
)
7350 if (!is_dependent_type
)
7352 set_current_access_from_decl (TYPE_NAME (template_type
));
7353 t
= start_enum (TYPE_IDENTIFIER (template_type
), NULL_TREE
,
7354 tsubst (ENUM_UNDERLYING_TYPE (template_type
),
7355 arglist
, complain
, in_decl
),
7356 SCOPED_ENUM_P (template_type
), NULL
);
7360 /* We don't want to call start_enum for this type, since
7361 the values for the enumeration constants may involve
7362 template parameters. And, no one should be interested
7363 in the enumeration constants for such a type. */
7364 t
= cxx_make_type (ENUMERAL_TYPE
);
7365 SET_SCOPED_ENUM_P (t
, SCOPED_ENUM_P (template_type
));
7367 SET_OPAQUE_ENUM_P (t
, OPAQUE_ENUM_P (template_type
));
7368 ENUM_FIXED_UNDERLYING_TYPE_P (t
)
7369 = ENUM_FIXED_UNDERLYING_TYPE_P (template_type
);
7371 else if (DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
7373 /* The user referred to a specialization of an alias
7374 template represented by GEN_TMPL.
7376 [temp.alias]/2 says:
7378 When a template-id refers to the specialization of an
7379 alias template, it is equivalent to the associated
7380 type obtained by substitution of its
7381 template-arguments for the template-parameters in the
7382 type-id of the alias template. */
7384 t
= tsubst (TREE_TYPE (gen_tmpl
), arglist
, complain
, in_decl
);
7385 /* Note that the call above (by indirectly calling
7386 register_specialization in tsubst_decl) registers the
7387 TYPE_DECL representing the specialization of the alias
7388 template. So next time someone substitutes ARGLIST for
7389 the template parms into the alias template (GEN_TMPL),
7390 she'll get that TYPE_DECL back. */
7392 if (t
== error_mark_node
)
7395 else if (CLASS_TYPE_P (template_type
))
7397 t
= make_class_type (TREE_CODE (template_type
));
7398 CLASSTYPE_DECLARED_CLASS (t
)
7399 = CLASSTYPE_DECLARED_CLASS (template_type
);
7400 SET_CLASSTYPE_IMPLICIT_INSTANTIATION (t
);
7401 TYPE_FOR_JAVA (t
) = TYPE_FOR_JAVA (template_type
);
7403 /* A local class. Make sure the decl gets registered properly. */
7404 if (context
== current_function_decl
)
7405 pushtag (DECL_NAME (gen_tmpl
), t
, /*tag_scope=*/ts_current
);
7407 if (comp_template_args (CLASSTYPE_TI_ARGS (template_type
), arglist
))
7408 /* This instantiation is another name for the primary
7409 template type. Set the TYPE_CANONICAL field
7411 TYPE_CANONICAL (t
) = template_type
;
7412 else if (any_template_arguments_need_structural_equality_p (arglist
))
7413 /* Some of the template arguments require structural
7414 equality testing, so this template class requires
7415 structural equality testing. */
7416 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7421 /* If we called start_enum or pushtag above, this information
7422 will already be set up. */
7425 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
7427 type_decl
= create_implicit_typedef (DECL_NAME (gen_tmpl
), t
);
7428 DECL_CONTEXT (type_decl
) = TYPE_CONTEXT (t
);
7429 DECL_SOURCE_LOCATION (type_decl
)
7430 = DECL_SOURCE_LOCATION (TYPE_STUB_DECL (template_type
));
7433 type_decl
= TYPE_NAME (t
);
7435 if (CLASS_TYPE_P (template_type
))
7437 TREE_PRIVATE (type_decl
)
7438 = TREE_PRIVATE (TYPE_MAIN_DECL (template_type
));
7439 TREE_PROTECTED (type_decl
)
7440 = TREE_PROTECTED (TYPE_MAIN_DECL (template_type
));
7441 if (CLASSTYPE_VISIBILITY_SPECIFIED (template_type
))
7443 DECL_VISIBILITY_SPECIFIED (type_decl
) = 1;
7444 DECL_VISIBILITY (type_decl
) = CLASSTYPE_VISIBILITY (template_type
);
7448 /* Let's consider the explicit specialization of a member
7449 of a class template specialization that is implicitely instantiated,
7454 template<class U> struct M {}; //#0
7459 struct S<int>::M<char> //#1
7463 [temp.expl.spec]/4 says this is valid.
7465 In this case, when we write:
7468 M is instantiated from the CLASSTYPE_TI_TEMPLATE of #1, not from
7471 When we encounter #1, we want to store the partial instantiation
7472 of M (template<class T> S<int>::M<T>) in it's CLASSTYPE_TI_TEMPLATE.
7474 For all cases other than this "explicit specialization of member of a
7475 class template", we just want to store the most general template into
7476 the CLASSTYPE_TI_TEMPLATE of M.
7478 This case of "explicit specialization of member of a class template"
7480 1/ the enclosing class is an instantiation of, and therefore not
7481 the same as, the context of the most general template, and
7482 2/ we aren't looking at the partial instantiation itself, i.e.
7483 the innermost arguments are not the same as the innermost parms of
7484 the most general template.
7486 So it's only when 1/ and 2/ happens that we want to use the partial
7487 instantiation of the member template in lieu of its most general
7490 if (PRIMARY_TEMPLATE_P (gen_tmpl
)
7491 && TMPL_ARGS_HAVE_MULTIPLE_LEVELS (arglist
)
7492 /* the enclosing class must be an instantiation... */
7493 && CLASS_TYPE_P (context
)
7494 && !same_type_p (context
, DECL_CONTEXT (gen_tmpl
)))
7496 tree partial_inst_args
;
7497 TREE_VEC_LENGTH (arglist
)--;
7498 ++processing_template_decl
;
7500 tsubst (INNERMOST_TEMPLATE_ARGS
7501 (TYPE_TI_ARGS (TREE_TYPE (gen_tmpl
))),
7502 arglist
, complain
, NULL_TREE
);
7503 --processing_template_decl
;
7504 TREE_VEC_LENGTH (arglist
)++;
7505 use_partial_inst_tmpl
=
7506 /*...and we must not be looking at the partial instantiation
7508 !comp_template_args (INNERMOST_TEMPLATE_ARGS (arglist
),
7512 if (!use_partial_inst_tmpl
)
7513 /* This case is easy; there are no member templates involved. */
7517 /* This is a full instantiation of a member template. Find
7518 the partial instantiation of which this is an instance. */
7520 /* Temporarily reduce by one the number of levels in the ARGLIST
7521 so as to avoid comparing the last set of arguments. */
7522 TREE_VEC_LENGTH (arglist
)--;
7523 found
= tsubst (gen_tmpl
, arglist
, complain
, NULL_TREE
);
7524 TREE_VEC_LENGTH (arglist
)++;
7525 /* FOUND is either a proper class type, or an alias
7526 template specialization. In the later case, it's a
7527 TYPE_DECL, resulting from the substituting of arguments
7528 for parameters in the TYPE_DECL of the alias template
7529 done earlier. So be careful while getting the template
7531 found
= TREE_CODE (found
) == TYPE_DECL
7532 ? TYPE_TI_TEMPLATE (TREE_TYPE (found
))
7533 : CLASSTYPE_TI_TEMPLATE (found
);
7536 SET_TYPE_TEMPLATE_INFO (t
, build_template_info (found
, arglist
));
7539 slot
= htab_find_slot_with_hash (type_specializations
,
7540 &elt
, hash
, INSERT
);
7541 entry
= ggc_alloc_spec_entry ();
7545 /* Note this use of the partial instantiation so we can check it
7546 later in maybe_process_partial_specialization. */
7547 DECL_TEMPLATE_INSTANTIATIONS (templ
)
7548 = tree_cons (arglist
, t
,
7549 DECL_TEMPLATE_INSTANTIATIONS (templ
));
7551 if (TREE_CODE (template_type
) == ENUMERAL_TYPE
&& !is_dependent_type
)
7552 /* Now that the type has been registered on the instantiations
7553 list, we set up the enumerators. Because the enumeration
7554 constants may involve the enumeration type itself, we make
7555 sure to register the type first, and then create the
7556 constants. That way, doing tsubst_expr for the enumeration
7557 constants won't result in recursive calls here; we'll find
7558 the instantiation and exit above. */
7559 tsubst_enum (template_type
, t
, arglist
);
7561 if (CLASS_TYPE_P (template_type
) && is_dependent_type
)
7562 /* If the type makes use of template parameters, the
7563 code that generates debugging information will crash. */
7564 DECL_IGNORED_P (TYPE_STUB_DECL (t
)) = 1;
7566 /* Possibly limit visibility based on template args. */
7567 TREE_PUBLIC (type_decl
) = 1;
7568 determine_visibility (type_decl
);
7574 /* Wrapper for lookup_template_class_1. */
7577 lookup_template_class (tree d1
, tree arglist
, tree in_decl
, tree context
,
7578 int entering_scope
, tsubst_flags_t complain
)
7581 timevar_push (TV_TEMPLATE_INST
);
7582 ret
= lookup_template_class_1 (d1
, arglist
, in_decl
, context
,
7583 entering_scope
, complain
);
7584 timevar_pop (TV_TEMPLATE_INST
);
7592 /* True when we should also visit template parameters that occur in
7593 non-deduced contexts. */
7594 bool include_nondeduced_p
;
7595 struct pointer_set_t
*visited
;
7598 /* Called from for_each_template_parm via walk_tree. */
7601 for_each_template_parm_r (tree
*tp
, int *walk_subtrees
, void *d
)
7604 struct pair_fn_data
*pfd
= (struct pair_fn_data
*) d
;
7605 tree_fn_t fn
= pfd
->fn
;
7606 void *data
= pfd
->data
;
7609 && (pfd
->include_nondeduced_p
|| TREE_CODE (t
) != TYPENAME_TYPE
)
7610 && for_each_template_parm (TYPE_CONTEXT (t
), fn
, data
, pfd
->visited
,
7611 pfd
->include_nondeduced_p
))
7612 return error_mark_node
;
7614 switch (TREE_CODE (t
))
7617 if (TYPE_PTRMEMFUNC_P (t
))
7623 if (!TYPE_TEMPLATE_INFO (t
))
7625 else if (for_each_template_parm (TYPE_TI_ARGS (t
),
7626 fn
, data
, pfd
->visited
,
7627 pfd
->include_nondeduced_p
))
7628 return error_mark_node
;
7632 if (for_each_template_parm (TYPE_MIN_VALUE (t
),
7633 fn
, data
, pfd
->visited
,
7634 pfd
->include_nondeduced_p
)
7635 || for_each_template_parm (TYPE_MAX_VALUE (t
),
7636 fn
, data
, pfd
->visited
,
7637 pfd
->include_nondeduced_p
))
7638 return error_mark_node
;
7642 /* Since we're not going to walk subtrees, we have to do this
7644 if (for_each_template_parm (TYPE_METHOD_BASETYPE (t
), fn
, data
,
7645 pfd
->visited
, pfd
->include_nondeduced_p
))
7646 return error_mark_node
;
7650 /* Check the return type. */
7651 if (for_each_template_parm (TREE_TYPE (t
), fn
, data
, pfd
->visited
,
7652 pfd
->include_nondeduced_p
))
7653 return error_mark_node
;
7655 /* Check the parameter types. Since default arguments are not
7656 instantiated until they are needed, the TYPE_ARG_TYPES may
7657 contain expressions that involve template parameters. But,
7658 no-one should be looking at them yet. And, once they're
7659 instantiated, they don't contain template parameters, so
7660 there's no point in looking at them then, either. */
7664 for (parm
= TYPE_ARG_TYPES (t
); parm
; parm
= TREE_CHAIN (parm
))
7665 if (for_each_template_parm (TREE_VALUE (parm
), fn
, data
,
7666 pfd
->visited
, pfd
->include_nondeduced_p
))
7667 return error_mark_node
;
7669 /* Since we've already handled the TYPE_ARG_TYPES, we don't
7670 want walk_tree walking into them itself. */
7676 case UNDERLYING_TYPE
:
7677 if (pfd
->include_nondeduced_p
7678 && for_each_template_parm (TYPE_FIELDS (t
), fn
, data
,
7680 pfd
->include_nondeduced_p
))
7681 return error_mark_node
;
7686 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
)
7687 && for_each_template_parm (DECL_TI_ARGS (t
), fn
, data
,
7688 pfd
->visited
, pfd
->include_nondeduced_p
))
7689 return error_mark_node
;
7694 if (TREE_CODE (t
) == CONST_DECL
&& DECL_TEMPLATE_PARM_P (t
)
7695 && for_each_template_parm (DECL_INITIAL (t
), fn
, data
,
7696 pfd
->visited
, pfd
->include_nondeduced_p
))
7697 return error_mark_node
;
7698 if (DECL_CONTEXT (t
)
7699 && pfd
->include_nondeduced_p
7700 && for_each_template_parm (DECL_CONTEXT (t
), fn
, data
,
7701 pfd
->visited
, pfd
->include_nondeduced_p
))
7702 return error_mark_node
;
7705 case BOUND_TEMPLATE_TEMPLATE_PARM
:
7706 /* Record template parameters such as `T' inside `TT<T>'. */
7707 if (for_each_template_parm (TYPE_TI_ARGS (t
), fn
, data
, pfd
->visited
,
7708 pfd
->include_nondeduced_p
))
7709 return error_mark_node
;
7712 case TEMPLATE_TEMPLATE_PARM
:
7713 case TEMPLATE_TYPE_PARM
:
7714 case TEMPLATE_PARM_INDEX
:
7715 if (fn
&& (*fn
)(t
, data
))
7716 return error_mark_node
;
7718 return error_mark_node
;
7722 /* A template template parameter is encountered. */
7723 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
)
7724 && for_each_template_parm (TREE_TYPE (t
), fn
, data
, pfd
->visited
,
7725 pfd
->include_nondeduced_p
))
7726 return error_mark_node
;
7728 /* Already substituted template template parameter */
7734 || for_each_template_parm (TYPENAME_TYPE_FULLNAME (t
), fn
,
7736 pfd
->include_nondeduced_p
))
7737 return error_mark_node
;
7741 if (TREE_TYPE (t
) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t
))
7742 && pfd
->include_nondeduced_p
7743 && for_each_template_parm (TYPE_PTRMEMFUNC_FN_TYPE
7744 (TREE_TYPE (t
)), fn
, data
,
7745 pfd
->visited
, pfd
->include_nondeduced_p
))
7746 return error_mark_node
;
7751 /* If there's no type, then this thing must be some expression
7752 involving template parameters. */
7753 if (!fn
&& !TREE_TYPE (t
))
7754 return error_mark_node
;
7759 case IMPLICIT_CONV_EXPR
:
7760 case REINTERPRET_CAST_EXPR
:
7761 case CONST_CAST_EXPR
:
7762 case STATIC_CAST_EXPR
:
7763 case DYNAMIC_CAST_EXPR
:
7767 case PSEUDO_DTOR_EXPR
:
7769 return error_mark_node
;
7776 /* We didn't find any template parameters we liked. */
7780 /* For each TEMPLATE_TYPE_PARM, TEMPLATE_TEMPLATE_PARM,
7781 BOUND_TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX in T,
7782 call FN with the parameter and the DATA.
7783 If FN returns nonzero, the iteration is terminated, and
7784 for_each_template_parm returns 1. Otherwise, the iteration
7785 continues. If FN never returns a nonzero value, the value
7786 returned by for_each_template_parm is 0. If FN is NULL, it is
7787 considered to be the function which always returns 1.
7789 If INCLUDE_NONDEDUCED_P, then this routine will also visit template
7790 parameters that occur in non-deduced contexts. When false, only
7791 visits those template parameters that can be deduced. */
7794 for_each_template_parm (tree t
, tree_fn_t fn
, void* data
,
7795 struct pointer_set_t
*visited
,
7796 bool include_nondeduced_p
)
7798 struct pair_fn_data pfd
;
7804 pfd
.include_nondeduced_p
= include_nondeduced_p
;
7806 /* Walk the tree. (Conceptually, we would like to walk without
7807 duplicates, but for_each_template_parm_r recursively calls
7808 for_each_template_parm, so we would need to reorganize a fair
7809 bit to use walk_tree_without_duplicates, so we keep our own
7812 pfd
.visited
= visited
;
7814 pfd
.visited
= pointer_set_create ();
7815 result
= cp_walk_tree (&t
,
7816 for_each_template_parm_r
,
7818 pfd
.visited
) != NULL_TREE
;
7823 pointer_set_destroy (pfd
.visited
);
7830 /* Returns true if T depends on any template parameter. */
7833 uses_template_parms (tree t
)
7836 int saved_processing_template_decl
;
7838 saved_processing_template_decl
= processing_template_decl
;
7839 if (!saved_processing_template_decl
)
7840 processing_template_decl
= 1;
7842 dependent_p
= dependent_type_p (t
);
7843 else if (TREE_CODE (t
) == TREE_VEC
)
7844 dependent_p
= any_dependent_template_arguments_p (t
);
7845 else if (TREE_CODE (t
) == TREE_LIST
)
7846 dependent_p
= (uses_template_parms (TREE_VALUE (t
))
7847 || uses_template_parms (TREE_CHAIN (t
)));
7848 else if (TREE_CODE (t
) == TYPE_DECL
)
7849 dependent_p
= dependent_type_p (TREE_TYPE (t
));
7852 || TREE_CODE (t
) == TEMPLATE_PARM_INDEX
7853 || TREE_CODE (t
) == OVERLOAD
7856 || TREE_CODE (t
) == TRAIT_EXPR
7857 || TREE_CODE (t
) == CONSTRUCTOR
7858 || CONSTANT_CLASS_P (t
))
7859 dependent_p
= (type_dependent_expression_p (t
)
7860 || value_dependent_expression_p (t
));
7863 gcc_assert (t
== error_mark_node
);
7864 dependent_p
= false;
7867 processing_template_decl
= saved_processing_template_decl
;
7872 /* Returns true iff current_function_decl is an incompletely instantiated
7873 template. Useful instead of processing_template_decl because the latter
7874 is set to 0 during fold_non_dependent_expr. */
7877 in_template_function (void)
7879 tree fn
= current_function_decl
;
7881 ++processing_template_decl
;
7882 ret
= (fn
&& DECL_LANG_SPECIFIC (fn
)
7883 && DECL_TEMPLATE_INFO (fn
)
7884 && any_dependent_template_arguments_p (DECL_TI_ARGS (fn
)));
7885 --processing_template_decl
;
7889 /* Returns true if T depends on any template parameter with level LEVEL. */
7892 uses_template_parms_level (tree t
, int level
)
7894 return for_each_template_parm (t
, template_parm_this_level_p
, &level
, NULL
,
7895 /*include_nondeduced_p=*/true);
7898 /* Returns TRUE iff INST is an instantiation we don't need to do in an
7899 ill-formed translation unit, i.e. a variable or function that isn't
7900 usable in a constant expression. */
7903 neglectable_inst_p (tree d
)
7906 && !(TREE_CODE (d
) == FUNCTION_DECL
? DECL_DECLARED_CONSTEXPR_P (d
)
7907 : decl_maybe_constant_var_p (d
)));
7910 /* Returns TRUE iff we should refuse to instantiate DECL because it's
7911 neglectable and instantiated from within an erroneous instantiation. */
7914 limit_bad_template_recursion (tree decl
)
7916 struct tinst_level
*lev
= current_tinst_level
;
7917 int errs
= errorcount
+ sorrycount
;
7918 if (lev
== NULL
|| errs
== 0 || !neglectable_inst_p (decl
))
7921 for (; lev
; lev
= lev
->next
)
7922 if (neglectable_inst_p (lev
->decl
))
7925 return (lev
&& errs
> lev
->errors
);
7928 static int tinst_depth
;
7929 extern int max_tinst_depth
;
7932 static GTY(()) struct tinst_level
*last_error_tinst_level
;
7934 /* We're starting to instantiate D; record the template instantiation context
7935 for diagnostics and to restore it later. */
7938 push_tinst_level (tree d
)
7940 struct tinst_level
*new_level
;
7942 if (tinst_depth
>= max_tinst_depth
)
7944 last_error_tinst_level
= current_tinst_level
;
7945 if (TREE_CODE (d
) == TREE_LIST
)
7946 error ("template instantiation depth exceeds maximum of %d (use "
7947 "-ftemplate-depth= to increase the maximum) substituting %qS",
7948 max_tinst_depth
, d
);
7950 error ("template instantiation depth exceeds maximum of %d (use "
7951 "-ftemplate-depth= to increase the maximum) instantiating %qD",
7952 max_tinst_depth
, d
);
7954 print_instantiation_context ();
7959 /* If the current instantiation caused problems, don't let it instantiate
7960 anything else. Do allow deduction substitution and decls usable in
7961 constant expressions. */
7962 if (limit_bad_template_recursion (d
))
7965 new_level
= ggc_alloc_tinst_level ();
7966 new_level
->decl
= d
;
7967 new_level
->locus
= input_location
;
7968 new_level
->errors
= errorcount
+sorrycount
;
7969 new_level
->in_system_header_p
= in_system_header
;
7970 new_level
->next
= current_tinst_level
;
7971 current_tinst_level
= new_level
;
7974 if (GATHER_STATISTICS
&& (tinst_depth
> depth_reached
))
7975 depth_reached
= tinst_depth
;
7980 /* We're done instantiating this template; return to the instantiation
7984 pop_tinst_level (void)
7986 /* Restore the filename and line number stashed away when we started
7987 this instantiation. */
7988 input_location
= current_tinst_level
->locus
;
7989 current_tinst_level
= current_tinst_level
->next
;
7993 /* We're instantiating a deferred template; restore the template
7994 instantiation context in which the instantiation was requested, which
7995 is one step out from LEVEL. Return the corresponding DECL or TYPE. */
7998 reopen_tinst_level (struct tinst_level
*level
)
8000 struct tinst_level
*t
;
8003 for (t
= level
; t
; t
= t
->next
)
8006 current_tinst_level
= level
;
8008 if (current_tinst_level
)
8009 current_tinst_level
->errors
= errorcount
+sorrycount
;
8013 /* Returns the TINST_LEVEL which gives the original instantiation
8016 struct tinst_level
*
8017 outermost_tinst_level (void)
8019 struct tinst_level
*level
= current_tinst_level
;
8022 level
= level
->next
;
8026 /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the
8027 vector of template arguments, as for tsubst.
8029 Returns an appropriate tsubst'd friend declaration. */
8032 tsubst_friend_function (tree decl
, tree args
)
8036 if (TREE_CODE (decl
) == FUNCTION_DECL
8037 && DECL_TEMPLATE_INSTANTIATION (decl
)
8038 && TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
8039 /* This was a friend declared with an explicit template
8040 argument list, e.g.:
8044 to indicate that f was a template instantiation, not a new
8045 function declaration. Now, we have to figure out what
8046 instantiation of what template. */
8048 tree template_id
, arglist
, fns
;
8051 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (current_class_type
));
8053 /* Friend functions are looked up in the containing namespace scope.
8054 We must enter that scope, to avoid finding member functions of the
8055 current class with same name. */
8056 push_nested_namespace (ns
);
8057 fns
= tsubst_expr (DECL_TI_TEMPLATE (decl
), args
,
8058 tf_warning_or_error
, NULL_TREE
,
8059 /*integral_constant_expression_p=*/false);
8060 pop_nested_namespace (ns
);
8061 arglist
= tsubst (DECL_TI_ARGS (decl
), args
,
8062 tf_warning_or_error
, NULL_TREE
);
8063 template_id
= lookup_template_function (fns
, arglist
);
8065 new_friend
= tsubst (decl
, args
, tf_warning_or_error
, NULL_TREE
);
8066 tmpl
= determine_specialization (template_id
, new_friend
,
8068 /*need_member_template=*/0,
8069 TREE_VEC_LENGTH (args
),
8071 return instantiate_template (tmpl
, new_args
, tf_error
);
8074 new_friend
= tsubst (decl
, args
, tf_warning_or_error
, NULL_TREE
);
8076 /* The NEW_FRIEND will look like an instantiation, to the
8077 compiler, but is not an instantiation from the point of view of
8078 the language. For example, we might have had:
8080 template <class T> struct S {
8081 template <class U> friend void f(T, U);
8084 Then, in S<int>, template <class U> void f(int, U) is not an
8085 instantiation of anything. */
8086 if (new_friend
== error_mark_node
)
8087 return error_mark_node
;
8089 DECL_USE_TEMPLATE (new_friend
) = 0;
8090 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
8092 DECL_USE_TEMPLATE (DECL_TEMPLATE_RESULT (new_friend
)) = 0;
8093 DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (new_friend
))
8094 = DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (decl
));
8097 /* The mangled name for the NEW_FRIEND is incorrect. The function
8098 is not a template instantiation and should not be mangled like
8099 one. Therefore, we forget the mangling here; we'll recompute it
8100 later if we need it. */
8101 if (TREE_CODE (new_friend
) != TEMPLATE_DECL
)
8103 SET_DECL_RTL (new_friend
, NULL
);
8104 SET_DECL_ASSEMBLER_NAME (new_friend
, NULL_TREE
);
8107 if (DECL_NAMESPACE_SCOPE_P (new_friend
))
8110 tree new_friend_template_info
;
8111 tree new_friend_result_template_info
;
8113 int new_friend_is_defn
;
8115 /* We must save some information from NEW_FRIEND before calling
8116 duplicate decls since that function will free NEW_FRIEND if
8118 new_friend_template_info
= DECL_TEMPLATE_INFO (new_friend
);
8119 new_friend_is_defn
=
8120 (DECL_INITIAL (DECL_TEMPLATE_RESULT
8121 (template_for_substitution (new_friend
)))
8123 if (TREE_CODE (new_friend
) == TEMPLATE_DECL
)
8125 /* This declaration is a `primary' template. */
8126 DECL_PRIMARY_TEMPLATE (new_friend
) = new_friend
;
8128 new_friend_result_template_info
8129 = DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (new_friend
));
8132 new_friend_result_template_info
= NULL_TREE
;
8134 /* Make the init_value nonzero so pushdecl knows this is a defn. */
8135 if (new_friend_is_defn
)
8136 DECL_INITIAL (new_friend
) = error_mark_node
;
8138 /* Inside pushdecl_namespace_level, we will push into the
8139 current namespace. However, the friend function should go
8140 into the namespace of the template. */
8141 ns
= decl_namespace_context (new_friend
);
8142 push_nested_namespace (ns
);
8143 old_decl
= pushdecl_namespace_level (new_friend
, /*is_friend=*/true);
8144 pop_nested_namespace (ns
);
8146 if (old_decl
== error_mark_node
)
8147 return error_mark_node
;
8149 if (old_decl
!= new_friend
)
8151 /* This new friend declaration matched an existing
8152 declaration. For example, given:
8154 template <class T> void f(T);
8155 template <class U> class C {
8156 template <class T> friend void f(T) {}
8159 the friend declaration actually provides the definition
8160 of `f', once C has been instantiated for some type. So,
8161 old_decl will be the out-of-class template declaration,
8162 while new_friend is the in-class definition.
8164 But, if `f' was called before this point, the
8165 instantiation of `f' will have DECL_TI_ARGS corresponding
8166 to `T' but not to `U', references to which might appear
8167 in the definition of `f'. Previously, the most general
8168 template for an instantiation of `f' was the out-of-class
8169 version; now it is the in-class version. Therefore, we
8170 run through all specialization of `f', adding to their
8171 DECL_TI_ARGS appropriately. In particular, they need a
8172 new set of outer arguments, corresponding to the
8173 arguments for this class instantiation.
8175 The same situation can arise with something like this:
8178 template <class T> class C {
8182 when `C<int>' is instantiated. Now, `f(int)' is defined
8185 if (!new_friend_is_defn
)
8186 /* On the other hand, if the in-class declaration does
8187 *not* provide a definition, then we don't want to alter
8188 existing definitions. We can just leave everything
8193 tree new_template
= TI_TEMPLATE (new_friend_template_info
);
8194 tree new_args
= TI_ARGS (new_friend_template_info
);
8196 /* Overwrite whatever template info was there before, if
8197 any, with the new template information pertaining to
8199 DECL_TEMPLATE_INFO (old_decl
) = new_friend_template_info
;
8201 if (TREE_CODE (old_decl
) != TEMPLATE_DECL
)
8203 /* We should have called reregister_specialization in
8205 gcc_assert (retrieve_specialization (new_template
,
8209 /* Instantiate it if the global has already been used. */
8210 if (DECL_ODR_USED (old_decl
))
8211 instantiate_decl (old_decl
, /*defer_ok=*/true,
8212 /*expl_inst_class_mem_p=*/false);
8218 /* Indicate that the old function template is a partial
8220 DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (old_decl
))
8221 = new_friend_result_template_info
;
8223 gcc_assert (new_template
8224 == most_general_template (new_template
));
8225 gcc_assert (new_template
!= old_decl
);
8227 /* Reassign any specializations already in the hash table
8228 to the new more general template, and add the
8229 additional template args. */
8230 for (t
= DECL_TEMPLATE_INSTANTIATIONS (old_decl
);
8234 tree spec
= TREE_VALUE (t
);
8237 elt
.tmpl
= old_decl
;
8238 elt
.args
= DECL_TI_ARGS (spec
);
8239 elt
.spec
= NULL_TREE
;
8241 htab_remove_elt (decl_specializations
, &elt
);
8244 = add_outermost_template_args (new_args
,
8245 DECL_TI_ARGS (spec
));
8247 register_specialization
8248 (spec
, new_template
, DECL_TI_ARGS (spec
), true, 0);
8251 DECL_TEMPLATE_INSTANTIATIONS (old_decl
) = NULL_TREE
;
8255 /* The information from NEW_FRIEND has been merged into OLD_DECL
8256 by duplicate_decls. */
8257 new_friend
= old_decl
;
8262 tree context
= DECL_CONTEXT (new_friend
);
8266 template <class T> class C {
8267 template <class U> friend void C1<U>::f (); // case 1
8268 friend void C2<T>::f (); // case 2
8270 we only need to make sure CONTEXT is a complete type for
8271 case 2. To distinguish between the two cases, we note that
8272 CONTEXT of case 1 remains dependent type after tsubst while
8273 this isn't true for case 2. */
8274 ++processing_template_decl
;
8275 dependent_p
= dependent_type_p (context
);
8276 --processing_template_decl
;
8279 && !complete_type_or_else (context
, NULL_TREE
))
8280 return error_mark_node
;
8282 if (COMPLETE_TYPE_P (context
))
8284 /* Check to see that the declaration is really present, and,
8285 possibly obtain an improved declaration. */
8286 tree fn
= check_classfn (context
,
8287 new_friend
, NULL_TREE
);
8297 /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of
8298 template arguments, as for tsubst.
8300 Returns an appropriate tsubst'd friend type or error_mark_node on
8304 tsubst_friend_class (tree friend_tmpl
, tree args
)
8310 if (DECL_TEMPLATE_TEMPLATE_PARM_P (friend_tmpl
))
8312 tree t
= tsubst (TREE_TYPE (friend_tmpl
), args
, tf_none
, NULL_TREE
);
8313 return TREE_TYPE (t
);
8316 context
= CP_DECL_CONTEXT (friend_tmpl
);
8318 if (context
!= global_namespace
)
8320 if (TREE_CODE (context
) == NAMESPACE_DECL
)
8321 push_nested_namespace (context
);
8323 push_nested_class (tsubst (context
, args
, tf_none
, NULL_TREE
));
8326 /* Look for a class template declaration. We look for hidden names
8327 because two friend declarations of the same template are the
8328 same. For example, in:
8331 template <typename> friend class F;
8333 template <typename> struct B {
8334 template <typename> friend class F;
8337 both F templates are the same. */
8338 tmpl
= lookup_name_real (DECL_NAME (friend_tmpl
), 0, 0,
8339 /*block_p=*/true, 0, LOOKUP_HIDDEN
);
8341 /* But, if we don't find one, it might be because we're in a
8342 situation like this:
8350 Here, in the scope of (say) S<int>, `S' is bound to a TYPE_DECL
8351 for `S<int>', not the TEMPLATE_DECL. */
8352 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
8354 tmpl
= lookup_name_prefer_type (DECL_NAME (friend_tmpl
), 1);
8355 tmpl
= maybe_get_template_decl_from_type_decl (tmpl
);
8358 if (tmpl
&& DECL_CLASS_TEMPLATE_P (tmpl
))
8360 /* The friend template has already been declared. Just
8361 check to see that the declarations match, and install any new
8362 default parameters. We must tsubst the default parameters,
8363 of course. We only need the innermost template parameters
8364 because that is all that redeclare_class_template will look
8366 if (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (friend_tmpl
))
8367 > TMPL_ARGS_DEPTH (args
))
8370 location_t saved_input_location
;
8371 parms
= tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_tmpl
),
8372 args
, tf_warning_or_error
);
8374 saved_input_location
= input_location
;
8375 input_location
= DECL_SOURCE_LOCATION (friend_tmpl
);
8376 redeclare_class_template (TREE_TYPE (tmpl
), parms
);
8377 input_location
= saved_input_location
;
8381 friend_type
= TREE_TYPE (tmpl
);
8385 /* The friend template has not already been declared. In this
8386 case, the instantiation of the template class will cause the
8387 injection of this template into the global scope. */
8388 tmpl
= tsubst (friend_tmpl
, args
, tf_warning_or_error
, NULL_TREE
);
8389 if (tmpl
== error_mark_node
)
8390 return error_mark_node
;
8392 /* The new TMPL is not an instantiation of anything, so we
8393 forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE for
8394 the new type because that is supposed to be the corresponding
8395 template decl, i.e., TMPL. */
8396 DECL_USE_TEMPLATE (tmpl
) = 0;
8397 DECL_TEMPLATE_INFO (tmpl
) = NULL_TREE
;
8398 CLASSTYPE_USE_TEMPLATE (TREE_TYPE (tmpl
)) = 0;
8399 CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl
))
8400 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl
)));
8402 /* Inject this template into the global scope. */
8403 friend_type
= TREE_TYPE (pushdecl_top_level_maybe_friend (tmpl
, true));
8406 if (context
!= global_namespace
)
8408 if (TREE_CODE (context
) == NAMESPACE_DECL
)
8409 pop_nested_namespace (context
);
8411 pop_nested_class ();
8417 /* Returns zero if TYPE cannot be completed later due to circularity.
8418 Otherwise returns one. */
8421 can_complete_type_without_circularity (tree type
)
8423 if (type
== NULL_TREE
|| type
== error_mark_node
)
8425 else if (COMPLETE_TYPE_P (type
))
8427 else if (TREE_CODE (type
) == ARRAY_TYPE
&& TYPE_DOMAIN (type
))
8428 return can_complete_type_without_circularity (TREE_TYPE (type
));
8429 else if (CLASS_TYPE_P (type
)
8430 && TYPE_BEING_DEFINED (TYPE_MAIN_VARIANT (type
)))
8436 /* Apply any attributes which had to be deferred until instantiation
8437 time. DECL_P, ATTRIBUTES and ATTR_FLAGS are as cplus_decl_attributes;
8438 ARGS, COMPLAIN, IN_DECL are as tsubst. */
8441 apply_late_template_attributes (tree
*decl_p
, tree attributes
, int attr_flags
,
8442 tree args
, tsubst_flags_t complain
, tree in_decl
)
8444 tree last_dep
= NULL_TREE
;
8448 for (t
= attributes
; t
; t
= TREE_CHAIN (t
))
8449 if (ATTR_IS_DEPENDENT (t
))
8452 attributes
= copy_list (attributes
);
8456 if (DECL_P (*decl_p
))
8458 if (TREE_TYPE (*decl_p
) == error_mark_node
)
8460 p
= &DECL_ATTRIBUTES (*decl_p
);
8463 p
= &TYPE_ATTRIBUTES (*decl_p
);
8467 tree late_attrs
= NULL_TREE
;
8468 tree
*q
= &late_attrs
;
8470 for (*p
= attributes
; *p
; )
8473 if (ATTR_IS_DEPENDENT (t
))
8475 *p
= TREE_CHAIN (t
);
8476 TREE_CHAIN (t
) = NULL_TREE
;
8477 /* If the first attribute argument is an identifier, don't
8478 pass it through tsubst. Attributes like mode, format,
8479 cleanup and several target specific attributes expect it
8482 && TREE_CODE (TREE_VALUE (t
)) == TREE_LIST
8483 && TREE_VALUE (TREE_VALUE (t
))
8484 && (identifier_p (TREE_VALUE (TREE_VALUE (t
)))))
8487 = tsubst_expr (TREE_CHAIN (TREE_VALUE (t
)), args
, complain
,
8489 /*integral_constant_expression_p=*/false);
8490 if (chain
!= TREE_CHAIN (TREE_VALUE (t
)))
8492 = tree_cons (NULL_TREE
, TREE_VALUE (TREE_VALUE (t
)),
8497 = tsubst_expr (TREE_VALUE (t
), args
, complain
, in_decl
,
8498 /*integral_constant_expression_p=*/false);
8500 q
= &TREE_CHAIN (t
);
8503 p
= &TREE_CHAIN (t
);
8506 cplus_decl_attributes (decl_p
, late_attrs
, attr_flags
);
8510 /* Perform (or defer) access check for typedefs that were referenced
8511 from within the template TMPL code.
8512 This is a subroutine of instantiate_decl and instantiate_class_template.
8513 TMPL is the template to consider and TARGS is the list of arguments of
8517 perform_typedefs_access_check (tree tmpl
, tree targs
)
8519 location_t saved_location
;
8521 qualified_typedef_usage_t
*iter
;
8524 || (!CLASS_TYPE_P (tmpl
)
8525 && TREE_CODE (tmpl
) != FUNCTION_DECL
))
8528 saved_location
= input_location
;
8529 FOR_EACH_VEC_SAFE_ELT (get_types_needing_access_check (tmpl
), i
, iter
)
8531 tree type_decl
= iter
->typedef_decl
;
8532 tree type_scope
= iter
->context
;
8534 if (!type_decl
|| !type_scope
|| !CLASS_TYPE_P (type_scope
))
8537 if (uses_template_parms (type_decl
))
8538 type_decl
= tsubst (type_decl
, targs
, tf_error
, NULL_TREE
);
8539 if (uses_template_parms (type_scope
))
8540 type_scope
= tsubst (type_scope
, targs
, tf_error
, NULL_TREE
);
8542 /* Make access check error messages point to the location
8543 of the use of the typedef. */
8544 input_location
= iter
->locus
;
8545 perform_or_defer_access_check (TYPE_BINFO (type_scope
),
8546 type_decl
, type_decl
,
8547 tf_warning_or_error
);
8549 input_location
= saved_location
;
8553 instantiate_class_template_1 (tree type
)
8555 tree templ
, args
, pattern
, t
, member
;
8559 unsigned int saved_maximum_field_alignment
;
8562 if (type
== error_mark_node
)
8563 return error_mark_node
;
8565 if (COMPLETE_OR_OPEN_TYPE_P (type
)
8566 || uses_template_parms (type
))
8569 /* Figure out which template is being instantiated. */
8570 templ
= most_general_template (CLASSTYPE_TI_TEMPLATE (type
));
8571 gcc_assert (TREE_CODE (templ
) == TEMPLATE_DECL
);
8573 /* Determine what specialization of the original template to
8575 t
= most_specialized_class (type
, templ
, tf_warning_or_error
);
8576 if (t
== error_mark_node
)
8578 TYPE_BEING_DEFINED (type
) = 1;
8579 return error_mark_node
;
8583 /* This TYPE is actually an instantiation of a partial
8584 specialization. We replace the innermost set of ARGS with
8585 the arguments appropriate for substitution. For example,
8588 template <class T> struct S {};
8589 template <class T> struct S<T*> {};
8591 and supposing that we are instantiating S<int*>, ARGS will
8592 presently be {int*} -- but we need {int}. */
8593 pattern
= TREE_TYPE (t
);
8594 args
= TREE_PURPOSE (t
);
8598 pattern
= TREE_TYPE (templ
);
8599 args
= CLASSTYPE_TI_ARGS (type
);
8602 /* If the template we're instantiating is incomplete, then clearly
8603 there's nothing we can do. */
8604 if (!COMPLETE_TYPE_P (pattern
))
8607 /* If we've recursively instantiated too many templates, stop. */
8608 if (! push_tinst_level (type
))
8611 /* Now we're really doing the instantiation. Mark the type as in
8612 the process of being defined. */
8613 TYPE_BEING_DEFINED (type
) = 1;
8615 /* We may be in the middle of deferred access check. Disable
8617 push_deferring_access_checks (dk_no_deferred
);
8619 fn_context
= decl_function_context (TYPE_MAIN_DECL (type
));
8621 push_to_top_level ();
8622 /* Use #pragma pack from the template context. */
8623 saved_maximum_field_alignment
= maximum_field_alignment
;
8624 maximum_field_alignment
= TYPE_PRECISION (pattern
);
8626 SET_CLASSTYPE_INTERFACE_UNKNOWN (type
);
8628 /* Set the input location to the most specialized template definition.
8629 This is needed if tsubsting causes an error. */
8630 typedecl
= TYPE_MAIN_DECL (pattern
);
8631 input_location
= DECL_SOURCE_LOCATION (TYPE_NAME (type
)) =
8632 DECL_SOURCE_LOCATION (typedecl
);
8634 TYPE_PACKED (type
) = TYPE_PACKED (pattern
);
8635 TYPE_ALIGN (type
) = TYPE_ALIGN (pattern
);
8636 TYPE_USER_ALIGN (type
) = TYPE_USER_ALIGN (pattern
);
8637 TYPE_FOR_JAVA (type
) = TYPE_FOR_JAVA (pattern
); /* For libjava's JArray<T> */
8638 if (ANON_AGGR_TYPE_P (pattern
))
8639 SET_ANON_AGGR_TYPE_P (type
);
8640 if (CLASSTYPE_VISIBILITY_SPECIFIED (pattern
))
8642 CLASSTYPE_VISIBILITY_SPECIFIED (type
) = 1;
8643 CLASSTYPE_VISIBILITY (type
) = CLASSTYPE_VISIBILITY (pattern
);
8644 /* Adjust visibility for template arguments. */
8645 determine_visibility (TYPE_MAIN_DECL (type
));
8647 CLASSTYPE_FINAL (type
) = CLASSTYPE_FINAL (pattern
);
8649 pbinfo
= TYPE_BINFO (pattern
);
8651 /* We should never instantiate a nested class before its enclosing
8652 class; we need to look up the nested class by name before we can
8653 instantiate it, and that lookup should instantiate the enclosing
8655 gcc_assert (!DECL_CLASS_SCOPE_P (TYPE_MAIN_DECL (pattern
))
8656 || COMPLETE_OR_OPEN_TYPE_P (TYPE_CONTEXT (type
)));
8658 base_list
= NULL_TREE
;
8659 if (BINFO_N_BASE_BINFOS (pbinfo
))
8665 /* We must enter the scope containing the type, as that is where
8666 the accessibility of types named in dependent bases are
8668 pushed_scope
= push_scope (CP_TYPE_CONTEXT (type
));
8670 /* Substitute into each of the bases to determine the actual
8672 for (i
= 0; BINFO_BASE_ITERATE (pbinfo
, i
, pbase_binfo
); i
++)
8675 tree access
= BINFO_BASE_ACCESS (pbinfo
, i
);
8676 tree expanded_bases
= NULL_TREE
;
8679 if (PACK_EXPANSION_P (BINFO_TYPE (pbase_binfo
)))
8682 tsubst_pack_expansion (BINFO_TYPE (pbase_binfo
),
8683 args
, tf_error
, NULL_TREE
);
8684 if (expanded_bases
== error_mark_node
)
8687 len
= TREE_VEC_LENGTH (expanded_bases
);
8690 for (idx
= 0; idx
< len
; idx
++)
8693 /* Extract the already-expanded base class. */
8694 base
= TREE_VEC_ELT (expanded_bases
, idx
);
8696 /* Substitute to figure out the base class. */
8697 base
= tsubst (BINFO_TYPE (pbase_binfo
), args
, tf_error
,
8700 if (base
== error_mark_node
)
8703 base_list
= tree_cons (access
, base
, base_list
);
8704 if (BINFO_VIRTUAL_P (pbase_binfo
))
8705 TREE_TYPE (base_list
) = integer_type_node
;
8709 /* The list is now in reverse order; correct that. */
8710 base_list
= nreverse (base_list
);
8713 pop_scope (pushed_scope
);
8715 /* Now call xref_basetypes to set up all the base-class
8717 xref_basetypes (type
, base_list
);
8719 apply_late_template_attributes (&type
, TYPE_ATTRIBUTES (pattern
),
8720 (int) ATTR_FLAG_TYPE_IN_PLACE
,
8721 args
, tf_error
, NULL_TREE
);
8722 fixup_attribute_variants (type
);
8724 /* Now that our base classes are set up, enter the scope of the
8725 class, so that name lookups into base classes, etc. will work
8726 correctly. This is precisely analogous to what we do in
8727 begin_class_definition when defining an ordinary non-template
8728 class, except we also need to push the enclosing classes. */
8729 push_nested_class (type
);
8731 /* Now members are processed in the order of declaration. */
8732 for (member
= CLASSTYPE_DECL_LIST (pattern
);
8733 member
; member
= TREE_CHAIN (member
))
8735 tree t
= TREE_VALUE (member
);
8737 if (TREE_PURPOSE (member
))
8741 /* Build new CLASSTYPE_NESTED_UTDS. */
8744 bool class_template_p
;
8746 class_template_p
= (TREE_CODE (t
) != ENUMERAL_TYPE
8747 && TYPE_LANG_SPECIFIC (t
)
8748 && CLASSTYPE_IS_TEMPLATE (t
));
8749 /* If the member is a class template, then -- even after
8750 substitution -- there may be dependent types in the
8751 template argument list for the class. We increment
8752 PROCESSING_TEMPLATE_DECL so that dependent_type_p, as
8753 that function will assume that no types are dependent
8754 when outside of a template. */
8755 if (class_template_p
)
8756 ++processing_template_decl
;
8757 newtag
= tsubst (t
, args
, tf_error
, NULL_TREE
);
8758 if (class_template_p
)
8759 --processing_template_decl
;
8760 if (newtag
== error_mark_node
)
8763 if (TREE_CODE (newtag
) != ENUMERAL_TYPE
)
8765 tree name
= TYPE_IDENTIFIER (t
);
8767 if (class_template_p
)
8768 /* Unfortunately, lookup_template_class sets
8769 CLASSTYPE_IMPLICIT_INSTANTIATION for a partial
8770 instantiation (i.e., for the type of a member
8771 template class nested within a template class.)
8772 This behavior is required for
8773 maybe_process_partial_specialization to work
8774 correctly, but is not accurate in this case;
8775 the TAG is not an instantiation of anything.
8776 (The corresponding TEMPLATE_DECL is an
8777 instantiation, but the TYPE is not.) */
8778 CLASSTYPE_USE_TEMPLATE (newtag
) = 0;
8780 /* Now, we call pushtag to put this NEWTAG into the scope of
8781 TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid
8782 pushtag calling push_template_decl. We don't have to do
8783 this for enums because it will already have been done in
8786 SET_IDENTIFIER_TYPE_VALUE (name
, newtag
);
8787 pushtag (name
, newtag
, /*tag_scope=*/ts_current
);
8790 else if (DECL_DECLARES_FUNCTION_P (t
))
8792 /* Build new TYPE_METHODS. */
8795 if (TREE_CODE (t
) == TEMPLATE_DECL
)
8796 ++processing_template_decl
;
8797 r
= tsubst (t
, args
, tf_error
, NULL_TREE
);
8798 if (TREE_CODE (t
) == TEMPLATE_DECL
)
8799 --processing_template_decl
;
8800 set_current_access_from_decl (r
);
8801 finish_member_declaration (r
);
8802 /* Instantiate members marked with attribute used. */
8803 if (r
!= error_mark_node
&& DECL_PRESERVE_P (r
))
8808 /* Build new TYPE_FIELDS. */
8809 if (TREE_CODE (t
) == STATIC_ASSERT
)
8813 ++c_inhibit_evaluation_warnings
;
8815 tsubst_expr (STATIC_ASSERT_CONDITION (t
), args
,
8816 tf_warning_or_error
, NULL_TREE
,
8817 /*integral_constant_expression_p=*/true);
8818 --c_inhibit_evaluation_warnings
;
8820 finish_static_assert (condition
,
8821 STATIC_ASSERT_MESSAGE (t
),
8822 STATIC_ASSERT_SOURCE_LOCATION (t
),
8825 else if (TREE_CODE (t
) != CONST_DECL
)
8829 /* The file and line for this declaration, to
8830 assist in error message reporting. Since we
8831 called push_tinst_level above, we don't need to
8833 input_location
= DECL_SOURCE_LOCATION (t
);
8835 if (TREE_CODE (t
) == TEMPLATE_DECL
)
8836 ++processing_template_decl
;
8837 r
= tsubst (t
, args
, tf_warning_or_error
, NULL_TREE
);
8838 if (TREE_CODE (t
) == TEMPLATE_DECL
)
8839 --processing_template_decl
;
8844 [t]he initialization (and any associated
8845 side-effects) of a static data member does
8846 not occur unless the static data member is
8847 itself used in a way that requires the
8848 definition of the static data member to
8851 Therefore, we do not substitute into the
8852 initialized for the static data member here. */
8853 finish_static_data_member_decl
8856 /*init_const_expr_p=*/false,
8857 /*asmspec_tree=*/NULL_TREE
,
8859 /* Instantiate members marked with attribute used. */
8860 if (r
!= error_mark_node
&& DECL_PRESERVE_P (r
))
8863 else if (TREE_CODE (r
) == FIELD_DECL
)
8865 /* Determine whether R has a valid type and can be
8866 completed later. If R is invalid, then it is
8867 replaced by error_mark_node so that it will not be
8868 added to TYPE_FIELDS. */
8869 tree rtype
= TREE_TYPE (r
);
8870 if (can_complete_type_without_circularity (rtype
))
8871 complete_type (rtype
);
8873 if (!COMPLETE_TYPE_P (rtype
))
8875 cxx_incomplete_type_error (r
, rtype
);
8876 r
= error_mark_node
;
8880 /* If it is a TYPE_DECL for a class-scoped ENUMERAL_TYPE,
8881 such a thing will already have been added to the field
8882 list by tsubst_enum in finish_member_declaration in the
8883 CLASSTYPE_NESTED_UTDS case above. */
8884 if (!(TREE_CODE (r
) == TYPE_DECL
8885 && TREE_CODE (TREE_TYPE (r
)) == ENUMERAL_TYPE
8886 && DECL_ARTIFICIAL (r
)))
8888 set_current_access_from_decl (r
);
8889 finish_member_declaration (r
);
8896 if (TYPE_P (t
) || DECL_CLASS_TEMPLATE_P (t
)
8897 || DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
8899 /* Build new CLASSTYPE_FRIEND_CLASSES. */
8901 tree friend_type
= t
;
8902 bool adjust_processing_template_decl
= false;
8904 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
8906 /* template <class T> friend class C; */
8907 friend_type
= tsubst_friend_class (friend_type
, args
);
8908 adjust_processing_template_decl
= true;
8910 else if (TREE_CODE (friend_type
) == UNBOUND_CLASS_TEMPLATE
)
8912 /* template <class T> friend class C::D; */
8913 friend_type
= tsubst (friend_type
, args
,
8914 tf_warning_or_error
, NULL_TREE
);
8915 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
8916 friend_type
= TREE_TYPE (friend_type
);
8917 adjust_processing_template_decl
= true;
8919 else if (TREE_CODE (friend_type
) == TYPENAME_TYPE
8920 || TREE_CODE (friend_type
) == TEMPLATE_TYPE_PARM
)
8922 /* This could be either
8926 when dependent_type_p is false or
8928 template <class U> friend class T::C;
8931 friend_type
= tsubst (friend_type
, args
,
8932 tf_warning_or_error
, NULL_TREE
);
8933 /* Bump processing_template_decl for correct
8934 dependent_type_p calculation. */
8935 ++processing_template_decl
;
8936 if (dependent_type_p (friend_type
))
8937 adjust_processing_template_decl
= true;
8938 --processing_template_decl
;
8940 else if (!CLASSTYPE_USE_TEMPLATE (friend_type
)
8941 && hidden_name_p (TYPE_NAME (friend_type
)))
8945 where C hasn't been declared yet. Let's lookup name
8946 from namespace scope directly, bypassing any name that
8947 come from dependent base class. */
8948 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (friend_type
));
8950 /* The call to xref_tag_from_type does injection for friend
8952 push_nested_namespace (ns
);
8954 xref_tag_from_type (friend_type
, NULL_TREE
,
8955 /*tag_scope=*/ts_current
);
8956 pop_nested_namespace (ns
);
8958 else if (uses_template_parms (friend_type
))
8959 /* friend class C<T>; */
8960 friend_type
= tsubst (friend_type
, args
,
8961 tf_warning_or_error
, NULL_TREE
);
8966 where C is already declared or
8968 friend class C<int>;
8970 We don't have to do anything in these cases. */
8972 if (adjust_processing_template_decl
)
8973 /* Trick make_friend_class into realizing that the friend
8974 we're adding is a template, not an ordinary class. It's
8975 important that we use make_friend_class since it will
8976 perform some error-checking and output cross-reference
8978 ++processing_template_decl
;
8980 if (friend_type
!= error_mark_node
)
8981 make_friend_class (type
, friend_type
, /*complain=*/false);
8983 if (adjust_processing_template_decl
)
8984 --processing_template_decl
;
8988 /* Build new DECL_FRIENDLIST. */
8991 /* The file and line for this declaration, to
8992 assist in error message reporting. Since we
8993 called push_tinst_level above, we don't need to
8995 input_location
= DECL_SOURCE_LOCATION (t
);
8997 if (TREE_CODE (t
) == TEMPLATE_DECL
)
8999 ++processing_template_decl
;
9000 push_deferring_access_checks (dk_no_check
);
9003 r
= tsubst_friend_function (t
, args
);
9004 add_friend (type
, r
, /*complain=*/false);
9005 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9007 pop_deferring_access_checks ();
9008 --processing_template_decl
;
9014 if (tree expr
= CLASSTYPE_LAMBDA_EXPR (type
))
9016 tree decl
= lambda_function (type
);
9019 instantiate_decl (decl
, false, false);
9021 /* We need to instantiate the capture list from the template
9022 after we've instantiated the closure members, but before we
9023 consider adding the conversion op. Also keep any captures
9024 that may have been added during instantiation of the op(). */
9025 tree tmpl_expr
= CLASSTYPE_LAMBDA_EXPR (pattern
);
9027 = tsubst_copy_and_build (LAMBDA_EXPR_CAPTURE_LIST (tmpl_expr
),
9028 args
, tf_warning_or_error
, NULL_TREE
,
9031 LAMBDA_EXPR_CAPTURE_LIST (expr
)
9032 = chainon (tmpl_cap
, nreverse (LAMBDA_EXPR_CAPTURE_LIST (expr
)));
9034 maybe_add_lambda_conv_op (type
);
9037 gcc_assert (errorcount
);
9040 /* Set the file and line number information to whatever is given for
9041 the class itself. This puts error messages involving generated
9042 implicit functions at a predictable point, and the same point
9043 that would be used for non-template classes. */
9044 input_location
= DECL_SOURCE_LOCATION (typedecl
);
9046 unreverse_member_declarations (type
);
9047 finish_struct_1 (type
);
9048 TYPE_BEING_DEFINED (type
) = 0;
9050 /* We don't instantiate default arguments for member functions. 14.7.1:
9052 The implicit instantiation of a class template specialization causes
9053 the implicit instantiation of the declarations, but not of the
9054 definitions or default arguments, of the class member functions,
9055 member classes, static data members and member templates.... */
9057 /* Some typedefs referenced from within the template code need to be access
9058 checked at template instantiation time, i.e now. These types were
9059 added to the template at parsing time. Let's get those and perform
9060 the access checks then. */
9061 perform_typedefs_access_check (pattern
, args
);
9062 perform_deferred_access_checks (tf_warning_or_error
);
9063 pop_nested_class ();
9064 maximum_field_alignment
= saved_maximum_field_alignment
;
9066 pop_from_top_level ();
9067 pop_deferring_access_checks ();
9070 /* The vtable for a template class can be emitted in any translation
9071 unit in which the class is instantiated. When there is no key
9072 method, however, finish_struct_1 will already have added TYPE to
9073 the keyed_classes list. */
9074 if (TYPE_CONTAINS_VPTR_P (type
) && CLASSTYPE_KEY_METHOD (type
))
9075 keyed_classes
= tree_cons (NULL_TREE
, type
, keyed_classes
);
9080 /* Wrapper for instantiate_class_template_1. */
9083 instantiate_class_template (tree type
)
9086 timevar_push (TV_TEMPLATE_INST
);
9087 ret
= instantiate_class_template_1 (type
);
9088 timevar_pop (TV_TEMPLATE_INST
);
9093 tsubst_template_arg (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
9099 else if (TYPE_P (t
))
9100 r
= tsubst (t
, args
, complain
, in_decl
);
9103 if (!(complain
& tf_warning
))
9104 ++c_inhibit_evaluation_warnings
;
9105 r
= tsubst_expr (t
, args
, complain
, in_decl
,
9106 /*integral_constant_expression_p=*/true);
9107 if (!(complain
& tf_warning
))
9108 --c_inhibit_evaluation_warnings
;
9109 /* Preserve the raw-reference nature of T. */
9110 if (TREE_TYPE (t
) && TREE_CODE (TREE_TYPE (t
)) == REFERENCE_TYPE
9111 && REFERENCE_REF_P (r
))
9112 r
= TREE_OPERAND (r
, 0);
9117 /* Given a function parameter pack TMPL_PARM and some function parameters
9118 instantiated from it at *SPEC_P, return a NONTYPE_ARGUMENT_PACK of them
9119 and set *SPEC_P to point at the next point in the list. */
9122 extract_fnparm_pack (tree tmpl_parm
, tree
*spec_p
)
9124 /* Collect all of the extra "packed" parameters into an
9128 tree argpack
= make_node (NONTYPE_ARGUMENT_PACK
);
9129 tree argtypepack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
9130 tree spec_parm
= *spec_p
;
9133 for (len
= 0; spec_parm
; ++len
, spec_parm
= TREE_CHAIN (spec_parm
))
9135 && !function_parameter_expanded_from_pack_p (spec_parm
, tmpl_parm
))
9138 /* Fill in PARMVEC and PARMTYPEVEC with all of the parameters. */
9139 parmvec
= make_tree_vec (len
);
9140 parmtypevec
= make_tree_vec (len
);
9141 spec_parm
= *spec_p
;
9142 for (i
= 0; i
< len
; i
++, spec_parm
= DECL_CHAIN (spec_parm
))
9144 TREE_VEC_ELT (parmvec
, i
) = spec_parm
;
9145 TREE_VEC_ELT (parmtypevec
, i
) = TREE_TYPE (spec_parm
);
9148 /* Build the argument packs. */
9149 SET_ARGUMENT_PACK_ARGS (argpack
, parmvec
);
9150 SET_ARGUMENT_PACK_ARGS (argtypepack
, parmtypevec
);
9151 TREE_TYPE (argpack
) = argtypepack
;
9152 *spec_p
= spec_parm
;
9157 /* Give a chain SPEC_PARM of PARM_DECLs, pack them into a
9158 NONTYPE_ARGUMENT_PACK. */
9161 make_fnparm_pack (tree spec_parm
)
9163 return extract_fnparm_pack (NULL_TREE
, &spec_parm
);
9166 /* Return true iff the Ith element of the argument pack ARG_PACK is a
9170 argument_pack_element_is_expansion_p (tree arg_pack
, int i
)
9172 tree vec
= ARGUMENT_PACK_ARGS (arg_pack
);
9173 if (i
>= TREE_VEC_LENGTH (vec
))
9175 return PACK_EXPANSION_P (TREE_VEC_ELT (vec
, i
));
9179 /* Creates and return an ARGUMENT_PACK_SELECT tree node. */
9182 make_argument_pack_select (tree arg_pack
, unsigned index
)
9184 tree aps
= make_node (ARGUMENT_PACK_SELECT
);
9186 ARGUMENT_PACK_SELECT_FROM_PACK (aps
) = arg_pack
;
9187 ARGUMENT_PACK_SELECT_INDEX (aps
) = index
;
9192 /* This is a subroutine of tsubst_pack_expansion.
9194 It returns TRUE if we need to use the PACK_EXPANSION_EXTRA_ARGS
9195 mechanism to store the (non complete list of) arguments of the
9196 substitution and return a non substituted pack expansion, in order
9197 to wait for when we have enough arguments to really perform the
9201 use_pack_expansion_extra_args_p (tree parm_packs
,
9205 if (parm_packs
== NULL_TREE
)
9208 bool has_expansion_arg
= false;
9209 for (int i
= 0 ; i
< arg_pack_len
; ++i
)
9211 bool has_non_expansion_arg
= false;
9212 for (tree parm_pack
= parm_packs
;
9214 parm_pack
= TREE_CHAIN (parm_pack
))
9216 tree arg
= TREE_VALUE (parm_pack
);
9218 if (argument_pack_element_is_expansion_p (arg
, i
))
9219 has_expansion_arg
= true;
9221 has_non_expansion_arg
= true;
9224 /* If one pack has an expansion and another pack has a normal
9225 argument or if one pack has an empty argument another one
9226 hasn't then tsubst_pack_expansion cannot perform the
9227 substitution and need to fall back on the
9228 PACK_EXPANSION_EXTRA mechanism. */
9229 if ((has_expansion_arg
&& has_non_expansion_arg
)
9230 || (has_empty_arg
&& (has_expansion_arg
|| has_non_expansion_arg
)))
9236 /* [temp.variadic]/6 says that:
9238 The instantiation of a pack expansion [...]
9239 produces a list E1,E2, ..., En, where N is the number of elements
9240 in the pack expansion parameters.
9242 This subroutine of tsubst_pack_expansion produces one of these Ei.
9244 PATTERN is the pattern of the pack expansion. PARM_PACKS is a
9245 TREE_LIST in which each TREE_PURPOSE is a parameter pack of
9246 PATTERN, and each TREE_VALUE is its corresponding argument pack.
9247 INDEX is the index 'i' of the element Ei to produce. ARGS,
9248 COMPLAIN, and IN_DECL are the same parameters as for the
9249 tsubst_pack_expansion function.
9251 The function returns the resulting Ei upon successful completion,
9254 Note that this function possibly modifies the ARGS parameter, so
9255 it's the responsibility of the caller to restore it. */
9258 gen_elem_of_pack_expansion_instantiation (tree pattern
,
9261 tree args
/* This parm gets
9263 tsubst_flags_t complain
,
9267 bool ith_elem_is_expansion
= false;
9269 /* For each parameter pack, change the substitution of the parameter
9270 pack to the ith argument in its argument pack, then expand the
9272 for (tree pack
= parm_packs
; pack
; pack
= TREE_CHAIN (pack
))
9274 tree parm
= TREE_PURPOSE (pack
);
9275 tree arg_pack
= TREE_VALUE (pack
);
9276 tree aps
; /* instance of ARGUMENT_PACK_SELECT. */
9278 ith_elem_is_expansion
|=
9279 argument_pack_element_is_expansion_p (arg_pack
, index
);
9281 /* Select the Ith argument from the pack. */
9282 if (TREE_CODE (parm
) == PARM_DECL
)
9286 aps
= make_argument_pack_select (arg_pack
, index
);
9288 register_local_specialization (aps
, parm
);
9291 aps
= retrieve_local_specialization (parm
);
9296 template_parm_level_and_index (parm
, &level
, &idx
);
9300 aps
= make_argument_pack_select (arg_pack
, index
);
9301 /* Update the corresponding argument. */
9302 TMPL_ARG (args
, level
, idx
) = aps
;
9305 /* Re-use the ARGUMENT_PACK_SELECT. */
9306 aps
= TMPL_ARG (args
, level
, idx
);
9308 ARGUMENT_PACK_SELECT_INDEX (aps
) = index
;
9311 /* Substitute into the PATTERN with the (possibly altered)
9313 if (!TYPE_P (pattern
))
9314 t
= tsubst_expr (pattern
, args
, complain
, in_decl
,
9315 /*integral_constant_expression_p=*/false);
9317 t
= tsubst (pattern
, args
, complain
, in_decl
);
9319 /* If the Ith argument pack element is a pack expansion, then
9320 the Ith element resulting from the substituting is going to
9321 be a pack expansion as well. */
9322 if (ith_elem_is_expansion
)
9323 t
= make_pack_expansion (t
);
9328 /* Substitute ARGS into T, which is an pack expansion
9329 (i.e. TYPE_PACK_EXPANSION or EXPR_PACK_EXPANSION). Returns a
9330 TREE_VEC with the substituted arguments, a PACK_EXPANSION_* node
9331 (if only a partial substitution could be performed) or
9332 ERROR_MARK_NODE if there was an error. */
9334 tsubst_pack_expansion (tree t
, tree args
, tsubst_flags_t complain
,
9338 tree pack
, packs
= NULL_TREE
;
9339 bool unsubstituted_packs
= false;
9342 struct pointer_map_t
*saved_local_specializations
= NULL
;
9343 bool need_local_specializations
= false;
9346 gcc_assert (PACK_EXPANSION_P (t
));
9347 pattern
= PACK_EXPANSION_PATTERN (t
);
9349 /* Add in any args remembered from an earlier partial instantiation. */
9350 args
= add_to_template_args (PACK_EXPANSION_EXTRA_ARGS (t
), args
);
9352 levels
= TMPL_ARGS_DEPTH (args
);
9354 /* Determine the argument packs that will instantiate the parameter
9355 packs used in the expansion expression. While we're at it,
9356 compute the number of arguments to be expanded and make sure it
9358 for (pack
= PACK_EXPANSION_PARAMETER_PACKS (t
); pack
;
9359 pack
= TREE_CHAIN (pack
))
9361 tree parm_pack
= TREE_VALUE (pack
);
9362 tree arg_pack
= NULL_TREE
;
9363 tree orig_arg
= NULL_TREE
;
9366 if (TREE_CODE (parm_pack
) == BASES
)
9368 if (BASES_DIRECT (parm_pack
))
9369 return calculate_direct_bases (tsubst_expr (BASES_TYPE (parm_pack
),
9370 args
, complain
, in_decl
, false));
9372 return calculate_bases (tsubst_expr (BASES_TYPE (parm_pack
),
9373 args
, complain
, in_decl
, false));
9375 if (TREE_CODE (parm_pack
) == PARM_DECL
)
9377 if (PACK_EXPANSION_LOCAL_P (t
))
9378 arg_pack
= retrieve_local_specialization (parm_pack
);
9381 /* We can't rely on local_specializations for a parameter
9382 name used later in a function declaration (such as in a
9383 late-specified return type). Even if it exists, it might
9384 have the wrong value for a recursive call. Just make a
9385 dummy decl, since it's only used for its type. */
9386 arg_pack
= tsubst_decl (parm_pack
, args
, complain
);
9387 if (arg_pack
&& FUNCTION_PARAMETER_PACK_P (arg_pack
))
9388 /* Partial instantiation of the parm_pack, we can't build
9389 up an argument pack yet. */
9390 arg_pack
= NULL_TREE
;
9392 arg_pack
= make_fnparm_pack (arg_pack
);
9393 need_local_specializations
= true;
9399 template_parm_level_and_index (parm_pack
, &level
, &idx
);
9401 if (level
<= levels
)
9402 arg_pack
= TMPL_ARG (args
, level
, idx
);
9405 orig_arg
= arg_pack
;
9406 if (arg_pack
&& TREE_CODE (arg_pack
) == ARGUMENT_PACK_SELECT
)
9407 arg_pack
= ARGUMENT_PACK_SELECT_FROM_PACK (arg_pack
);
9409 if (arg_pack
&& !ARGUMENT_PACK_P (arg_pack
))
9410 /* This can only happen if we forget to expand an argument
9411 pack somewhere else. Just return an error, silently. */
9413 result
= make_tree_vec (1);
9414 TREE_VEC_ELT (result
, 0) = error_mark_node
;
9421 TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg_pack
));
9423 /* Don't bother trying to do a partial substitution with
9424 incomplete packs; we'll try again after deduction. */
9425 if (ARGUMENT_PACK_INCOMPLETE_P (arg_pack
))
9430 else if (len
!= my_len
)
9432 if (!(complain
& tf_error
))
9433 /* Fail quietly. */;
9434 else if (TREE_CODE (t
) == TYPE_PACK_EXPANSION
)
9435 error ("mismatched argument pack lengths while expanding "
9439 error ("mismatched argument pack lengths while expanding "
9442 return error_mark_node
;
9445 /* Keep track of the parameter packs and their corresponding
9447 packs
= tree_cons (parm_pack
, arg_pack
, packs
);
9448 TREE_TYPE (packs
) = orig_arg
;
9452 /* We can't substitute for this parameter pack. We use a flag as
9453 well as the missing_level counter because function parameter
9454 packs don't have a level. */
9455 unsubstituted_packs
= true;
9459 /* We cannot expand this expansion expression, because we don't have
9460 all of the argument packs we need. */
9461 if (use_pack_expansion_extra_args_p (packs
, len
, unsubstituted_packs
))
9463 /* We got some full packs, but we can't substitute them in until we
9464 have values for all the packs. So remember these until then. */
9466 t
= make_pack_expansion (pattern
);
9467 PACK_EXPANSION_EXTRA_ARGS (t
) = args
;
9470 else if (unsubstituted_packs
)
9472 /* There were no real arguments, we're just replacing a parameter
9473 pack with another version of itself. Substitute into the
9474 pattern and return a PACK_EXPANSION_*. The caller will need to
9476 if (TREE_CODE (t
) == EXPR_PACK_EXPANSION
)
9477 t
= tsubst_expr (pattern
, args
, complain
, in_decl
,
9478 /*integral_constant_expression_p=*/false);
9480 t
= tsubst (pattern
, args
, complain
, in_decl
);
9481 t
= make_pack_expansion (t
);
9485 gcc_assert (len
>= 0);
9487 if (need_local_specializations
)
9489 /* We're in a late-specified return type, so create our own local
9490 specializations map; the current map is either NULL or (in the
9491 case of recursive unification) might have bindings that we don't
9492 want to use or alter. */
9493 saved_local_specializations
= local_specializations
;
9494 local_specializations
= pointer_map_create ();
9497 /* For each argument in each argument pack, substitute into the
9499 result
= make_tree_vec (len
);
9500 for (i
= 0; i
< len
; ++i
)
9502 t
= gen_elem_of_pack_expansion_instantiation (pattern
, packs
,
9506 TREE_VEC_ELT (result
, i
) = t
;
9507 if (t
== error_mark_node
)
9509 result
= error_mark_node
;
9514 /* Update ARGS to restore the substitution from parameter packs to
9515 their argument packs. */
9516 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
9518 tree parm
= TREE_PURPOSE (pack
);
9520 if (TREE_CODE (parm
) == PARM_DECL
)
9521 register_local_specialization (TREE_TYPE (pack
), parm
);
9526 if (TREE_VALUE (pack
) == NULL_TREE
)
9529 template_parm_level_and_index (parm
, &level
, &idx
);
9531 /* Update the corresponding argument. */
9532 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
9533 TREE_VEC_ELT (TREE_VEC_ELT (args
, level
-1 ), idx
) =
9536 TREE_VEC_ELT (args
, idx
) = TREE_TYPE (pack
);
9540 if (need_local_specializations
)
9542 pointer_map_destroy (local_specializations
);
9543 local_specializations
= saved_local_specializations
;
9549 /* Given PARM_DECL PARM, find the corresponding PARM_DECL in the template
9550 TMPL. We do this using DECL_PARM_INDEX, which should work even with
9551 parameter packs; all parms generated from a function parameter pack will
9552 have the same DECL_PARM_INDEX. */
9555 get_pattern_parm (tree parm
, tree tmpl
)
9557 tree pattern
= DECL_TEMPLATE_RESULT (tmpl
);
9560 if (DECL_ARTIFICIAL (parm
))
9562 for (patparm
= DECL_ARGUMENTS (pattern
);
9563 patparm
; patparm
= DECL_CHAIN (patparm
))
9564 if (DECL_ARTIFICIAL (patparm
)
9565 && DECL_NAME (parm
) == DECL_NAME (patparm
))
9570 patparm
= FUNCTION_FIRST_USER_PARM (DECL_TEMPLATE_RESULT (tmpl
));
9571 patparm
= chain_index (DECL_PARM_INDEX (parm
)-1, patparm
);
9572 gcc_assert (DECL_PARM_INDEX (patparm
)
9573 == DECL_PARM_INDEX (parm
));
9579 /* Substitute ARGS into the vector or list of template arguments T. */
9582 tsubst_template_args (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
9585 int len
, need_new
= 0, i
, expanded_len_adjust
= 0, out
;
9588 if (t
== error_mark_node
)
9589 return error_mark_node
;
9591 len
= TREE_VEC_LENGTH (t
);
9592 elts
= XALLOCAVEC (tree
, len
);
9594 for (i
= 0; i
< len
; i
++)
9596 tree orig_arg
= TREE_VEC_ELT (t
, i
);
9599 if (TREE_CODE (orig_arg
) == TREE_VEC
)
9600 new_arg
= tsubst_template_args (orig_arg
, args
, complain
, in_decl
);
9601 else if (PACK_EXPANSION_P (orig_arg
))
9603 /* Substitute into an expansion expression. */
9604 new_arg
= tsubst_pack_expansion (orig_arg
, args
, complain
, in_decl
);
9606 if (TREE_CODE (new_arg
) == TREE_VEC
)
9607 /* Add to the expanded length adjustment the number of
9608 expanded arguments. We subtract one from this
9609 measurement, because the argument pack expression
9610 itself is already counted as 1 in
9611 LEN. EXPANDED_LEN_ADJUST can actually be negative, if
9612 the argument pack is empty. */
9613 expanded_len_adjust
+= TREE_VEC_LENGTH (new_arg
) - 1;
9615 else if (ARGUMENT_PACK_P (orig_arg
))
9617 /* Substitute into each of the arguments. */
9618 new_arg
= TYPE_P (orig_arg
)
9619 ? cxx_make_type (TREE_CODE (orig_arg
))
9620 : make_node (TREE_CODE (orig_arg
));
9622 SET_ARGUMENT_PACK_ARGS (
9624 tsubst_template_args (ARGUMENT_PACK_ARGS (orig_arg
),
9625 args
, complain
, in_decl
));
9627 if (ARGUMENT_PACK_ARGS (new_arg
) == error_mark_node
)
9628 new_arg
= error_mark_node
;
9630 if (TREE_CODE (new_arg
) == NONTYPE_ARGUMENT_PACK
) {
9631 TREE_TYPE (new_arg
) = tsubst (TREE_TYPE (orig_arg
), args
,
9633 TREE_CONSTANT (new_arg
) = TREE_CONSTANT (orig_arg
);
9635 if (TREE_TYPE (new_arg
) == error_mark_node
)
9636 new_arg
= error_mark_node
;
9640 new_arg
= tsubst_template_arg (orig_arg
, args
, complain
, in_decl
);
9642 if (new_arg
== error_mark_node
)
9643 return error_mark_node
;
9646 if (new_arg
!= orig_arg
)
9653 /* Make space for the expanded arguments coming from template
9655 t
= make_tree_vec (len
+ expanded_len_adjust
);
9656 /* ORIG_T can contain TREE_VECs. That happens if ORIG_T contains the
9657 arguments for a member template.
9658 In that case each TREE_VEC in ORIG_T represents a level of template
9659 arguments, and ORIG_T won't carry any non defaulted argument count.
9660 It will rather be the nested TREE_VECs that will carry one.
9661 In other words, ORIG_T carries a non defaulted argument count only
9662 if it doesn't contain any nested TREE_VEC. */
9663 if (NON_DEFAULT_TEMPLATE_ARGS_COUNT (orig_t
))
9665 int count
= GET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (orig_t
);
9666 count
+= expanded_len_adjust
;
9667 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (t
, count
);
9669 for (i
= 0, out
= 0; i
< len
; i
++)
9671 if ((PACK_EXPANSION_P (TREE_VEC_ELT (orig_t
, i
))
9672 || ARGUMENT_PACK_P (TREE_VEC_ELT (orig_t
, i
)))
9673 && TREE_CODE (elts
[i
]) == TREE_VEC
)
9677 /* Now expand the template argument pack "in place". */
9678 for (idx
= 0; idx
< TREE_VEC_LENGTH (elts
[i
]); idx
++, out
++)
9679 TREE_VEC_ELT (t
, out
) = TREE_VEC_ELT (elts
[i
], idx
);
9683 TREE_VEC_ELT (t
, out
) = elts
[i
];
9691 /* Return the result of substituting ARGS into the template parameters
9692 given by PARMS. If there are m levels of ARGS and m + n levels of
9693 PARMS, then the result will contain n levels of PARMS. For
9694 example, if PARMS is `template <class T> template <class U>
9695 template <T*, U, class V>' and ARGS is {{int}, {double}} then the
9696 result will be `template <int*, double, class V>'. */
9699 tsubst_template_parms (tree parms
, tree args
, tsubst_flags_t complain
)
9704 /* When substituting into a template, we must set
9705 PROCESSING_TEMPLATE_DECL as the template parameters may be
9706 dependent if they are based on one-another, and the dependency
9707 predicates are short-circuit outside of templates. */
9708 ++processing_template_decl
;
9710 for (new_parms
= &r
;
9711 parms
&& TMPL_PARMS_DEPTH (parms
) > TMPL_ARGS_DEPTH (args
);
9712 new_parms
= &(TREE_CHAIN (*new_parms
)),
9713 parms
= TREE_CHAIN (parms
))
9716 make_tree_vec (TREE_VEC_LENGTH (TREE_VALUE (parms
)));
9719 for (i
= 0; i
< TREE_VEC_LENGTH (new_vec
); ++i
)
9723 if (parms
== error_mark_node
)
9726 tuple
= TREE_VEC_ELT (TREE_VALUE (parms
), i
);
9728 if (tuple
== error_mark_node
)
9731 TREE_VEC_ELT (new_vec
, i
) =
9732 tsubst_template_parm (tuple
, args
, complain
);
9736 tree_cons (size_int (TMPL_PARMS_DEPTH (parms
)
9737 - TMPL_ARGS_DEPTH (args
)),
9738 new_vec
, NULL_TREE
);
9741 --processing_template_decl
;
9746 /* Return the result of substituting ARGS into one template parameter
9747 given by T. T Must be a TREE_LIST which TREE_VALUE is the template
9748 parameter and which TREE_PURPOSE is the default argument of the
9749 template parameter. */
9752 tsubst_template_parm (tree t
, tree args
, tsubst_flags_t complain
)
9754 tree default_value
, parm_decl
;
9756 if (args
== NULL_TREE
9758 || t
== error_mark_node
)
9761 gcc_assert (TREE_CODE (t
) == TREE_LIST
);
9763 default_value
= TREE_PURPOSE (t
);
9764 parm_decl
= TREE_VALUE (t
);
9766 parm_decl
= tsubst (parm_decl
, args
, complain
, NULL_TREE
);
9767 if (TREE_CODE (parm_decl
) == PARM_DECL
9768 && invalid_nontype_parm_type_p (TREE_TYPE (parm_decl
), complain
))
9769 parm_decl
= error_mark_node
;
9770 default_value
= tsubst_template_arg (default_value
, args
,
9771 complain
, NULL_TREE
);
9773 return build_tree_list (default_value
, parm_decl
);
9776 /* Substitute the ARGS into the indicated aggregate (or enumeration)
9777 type T. If T is not an aggregate or enumeration type, it is
9778 handled as if by tsubst. IN_DECL is as for tsubst. If
9779 ENTERING_SCOPE is nonzero, T is the context for a template which
9780 we are presently tsubst'ing. Return the substituted value. */
9783 tsubst_aggr_type (tree t
,
9785 tsubst_flags_t complain
,
9792 switch (TREE_CODE (t
))
9795 if (TYPE_PTRMEMFUNC_P (t
))
9796 return tsubst (TYPE_PTRMEMFUNC_FN_TYPE (t
), args
, complain
, in_decl
);
9798 /* Else fall through. */
9801 if (TYPE_TEMPLATE_INFO (t
) && uses_template_parms (t
))
9806 int saved_unevaluated_operand
;
9807 int saved_inhibit_evaluation_warnings
;
9809 /* In "sizeof(X<I>)" we need to evaluate "I". */
9810 saved_unevaluated_operand
= cp_unevaluated_operand
;
9811 cp_unevaluated_operand
= 0;
9812 saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
9813 c_inhibit_evaluation_warnings
= 0;
9815 /* First, determine the context for the type we are looking
9817 context
= TYPE_CONTEXT (t
);
9818 if (context
&& TYPE_P (context
))
9820 context
= tsubst_aggr_type (context
, args
, complain
,
9821 in_decl
, /*entering_scope=*/1);
9822 /* If context is a nested class inside a class template,
9823 it may still need to be instantiated (c++/33959). */
9824 context
= complete_type (context
);
9827 /* Then, figure out what arguments are appropriate for the
9828 type we are trying to find. For example, given:
9830 template <class T> struct S;
9831 template <class T, class U> void f(T, U) { S<U> su; }
9833 and supposing that we are instantiating f<int, double>,
9834 then our ARGS will be {int, double}, but, when looking up
9835 S we only want {double}. */
9836 argvec
= tsubst_template_args (TYPE_TI_ARGS (t
), args
,
9838 if (argvec
== error_mark_node
)
9839 r
= error_mark_node
;
9842 r
= lookup_template_class (t
, argvec
, in_decl
, context
,
9843 entering_scope
, complain
);
9844 r
= cp_build_qualified_type_real (r
, cp_type_quals (t
), complain
);
9847 cp_unevaluated_operand
= saved_unevaluated_operand
;
9848 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
9853 /* This is not a template type, so there's nothing to do. */
9857 return tsubst (t
, args
, complain
, in_decl
);
9861 /* Substitute into the default argument ARG (a default argument for
9862 FN), which has the indicated TYPE. */
9865 tsubst_default_argument (tree fn
, tree type
, tree arg
)
9867 tree saved_class_ptr
= NULL_TREE
;
9868 tree saved_class_ref
= NULL_TREE
;
9869 int errs
= errorcount
+ sorrycount
;
9871 /* This can happen in invalid code. */
9872 if (TREE_CODE (arg
) == DEFAULT_ARG
)
9875 /* This default argument came from a template. Instantiate the
9876 default argument here, not in tsubst. In the case of
9885 we must be careful to do name lookup in the scope of S<T>,
9886 rather than in the current class. */
9887 push_access_scope (fn
);
9888 /* The "this" pointer is not valid in a default argument. */
9891 saved_class_ptr
= current_class_ptr
;
9892 cp_function_chain
->x_current_class_ptr
= NULL_TREE
;
9893 saved_class_ref
= current_class_ref
;
9894 cp_function_chain
->x_current_class_ref
= NULL_TREE
;
9897 push_deferring_access_checks(dk_no_deferred
);
9898 /* The default argument expression may cause implicitly defined
9899 member functions to be synthesized, which will result in garbage
9900 collection. We must treat this situation as if we were within
9901 the body of function so as to avoid collecting live data on the
9904 arg
= tsubst_expr (arg
, DECL_TI_ARGS (fn
),
9905 tf_warning_or_error
, NULL_TREE
,
9906 /*integral_constant_expression_p=*/false);
9908 pop_deferring_access_checks();
9910 /* Restore the "this" pointer. */
9913 cp_function_chain
->x_current_class_ptr
= saved_class_ptr
;
9914 cp_function_chain
->x_current_class_ref
= saved_class_ref
;
9917 if (errorcount
+sorrycount
> errs
)
9918 inform (input_location
,
9919 " when instantiating default argument for call to %D", fn
);
9921 /* Make sure the default argument is reasonable. */
9922 arg
= check_default_argument (type
, arg
);
9924 pop_access_scope (fn
);
9929 /* Substitute into all the default arguments for FN. */
9932 tsubst_default_arguments (tree fn
)
9937 tmpl_args
= DECL_TI_ARGS (fn
);
9939 /* If this function is not yet instantiated, we certainly don't need
9940 its default arguments. */
9941 if (uses_template_parms (tmpl_args
))
9943 /* Don't do this again for clones. */
9944 if (DECL_CLONED_FUNCTION_P (fn
))
9947 for (arg
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
9949 arg
= TREE_CHAIN (arg
))
9950 if (TREE_PURPOSE (arg
))
9951 TREE_PURPOSE (arg
) = tsubst_default_argument (fn
,
9953 TREE_PURPOSE (arg
));
9956 /* Substitute the ARGS into the T, which is a _DECL. Return the
9957 result of the substitution. Issue error and warning messages under
9958 control of COMPLAIN. */
9961 tsubst_decl (tree t
, tree args
, tsubst_flags_t complain
)
9963 #define RETURN(EXP) do { r = (EXP); goto out; } while(0)
9964 location_t saved_loc
;
9969 /* Set the filename and linenumber to improve error-reporting. */
9970 saved_loc
= input_location
;
9971 input_location
= DECL_SOURCE_LOCATION (t
);
9973 switch (TREE_CODE (t
))
9977 /* We can get here when processing a member function template,
9978 member class template, or template template parameter. */
9979 tree decl
= DECL_TEMPLATE_RESULT (t
);
9984 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
9986 /* Template template parameter is treated here. */
9987 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
9988 if (new_type
== error_mark_node
)
9989 RETURN (error_mark_node
);
9990 /* If we get a real template back, return it. This can happen in
9991 the context of most_specialized_class. */
9992 if (TREE_CODE (new_type
) == TEMPLATE_DECL
)
9996 DECL_CHAIN (r
) = NULL_TREE
;
9997 TREE_TYPE (r
) = new_type
;
9998 DECL_TEMPLATE_RESULT (r
)
9999 = build_decl (DECL_SOURCE_LOCATION (decl
),
10000 TYPE_DECL
, DECL_NAME (decl
), new_type
);
10001 DECL_TEMPLATE_PARMS (r
)
10002 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
,
10004 TYPE_NAME (new_type
) = r
;
10008 /* We might already have an instance of this template.
10009 The ARGS are for the surrounding class type, so the
10010 full args contain the tsubst'd args for the context,
10011 plus the innermost args from the template decl. */
10012 tmpl_args
= DECL_CLASS_TEMPLATE_P (t
)
10013 ? CLASSTYPE_TI_ARGS (TREE_TYPE (t
))
10014 : DECL_TI_ARGS (DECL_TEMPLATE_RESULT (t
));
10015 /* Because this is a template, the arguments will still be
10016 dependent, even after substitution. If
10017 PROCESSING_TEMPLATE_DECL is not set, the dependency
10018 predicates will short-circuit. */
10019 ++processing_template_decl
;
10020 full_args
= tsubst_template_args (tmpl_args
, args
,
10021 complain
, in_decl
);
10022 --processing_template_decl
;
10023 if (full_args
== error_mark_node
)
10024 RETURN (error_mark_node
);
10026 /* If this is a default template template argument,
10027 tsubst might not have changed anything. */
10028 if (full_args
== tmpl_args
)
10031 hash
= hash_tmpl_and_args (t
, full_args
);
10032 spec
= retrieve_specialization (t
, full_args
, hash
);
10033 if (spec
!= NULL_TREE
)
10039 /* Make a new template decl. It will be similar to the
10040 original, but will record the current template arguments.
10041 We also create a new function declaration, which is just
10042 like the old one, but points to this new template, rather
10043 than the old one. */
10045 gcc_assert (DECL_LANG_SPECIFIC (r
) != 0);
10046 DECL_CHAIN (r
) = NULL_TREE
;
10048 DECL_TEMPLATE_INFO (r
) = build_template_info (t
, args
);
10050 if (TREE_CODE (decl
) == TYPE_DECL
10051 && !TYPE_DECL_ALIAS_P (decl
))
10054 ++processing_template_decl
;
10055 new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
10056 --processing_template_decl
;
10057 if (new_type
== error_mark_node
)
10058 RETURN (error_mark_node
);
10060 TREE_TYPE (r
) = new_type
;
10061 CLASSTYPE_TI_TEMPLATE (new_type
) = r
;
10062 DECL_TEMPLATE_RESULT (r
) = TYPE_MAIN_DECL (new_type
);
10063 DECL_TI_ARGS (r
) = CLASSTYPE_TI_ARGS (new_type
);
10064 DECL_CONTEXT (r
) = TYPE_CONTEXT (new_type
);
10069 ++processing_template_decl
;
10070 new_decl
= tsubst (decl
, args
, complain
, in_decl
);
10071 --processing_template_decl
;
10072 if (new_decl
== error_mark_node
)
10073 RETURN (error_mark_node
);
10075 DECL_TEMPLATE_RESULT (r
) = new_decl
;
10076 DECL_TI_TEMPLATE (new_decl
) = r
;
10077 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
10078 DECL_TI_ARGS (r
) = DECL_TI_ARGS (new_decl
);
10079 DECL_CONTEXT (r
) = DECL_CONTEXT (new_decl
);
10082 SET_DECL_IMPLICIT_INSTANTIATION (r
);
10083 DECL_TEMPLATE_INSTANTIATIONS (r
) = NULL_TREE
;
10084 DECL_TEMPLATE_SPECIALIZATIONS (r
) = NULL_TREE
;
10086 /* The template parameters for this new template are all the
10087 template parameters for the old template, except the
10088 outermost level of parameters. */
10089 DECL_TEMPLATE_PARMS (r
)
10090 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
,
10093 if (PRIMARY_TEMPLATE_P (t
))
10094 DECL_PRIMARY_TEMPLATE (r
) = r
;
10096 if (TREE_CODE (decl
) != TYPE_DECL
)
10097 /* Record this non-type partial instantiation. */
10098 register_specialization (r
, t
,
10099 DECL_TI_ARGS (DECL_TEMPLATE_RESULT (r
)),
10104 case FUNCTION_DECL
:
10107 tree argvec
= NULL_TREE
;
10115 /* Nobody should be tsubst'ing into non-template functions. */
10116 gcc_assert (DECL_TEMPLATE_INFO (t
) != NULL_TREE
);
10118 if (TREE_CODE (DECL_TI_TEMPLATE (t
)) == TEMPLATE_DECL
)
10123 /* If T is not dependent, just return it. We have to
10124 increment PROCESSING_TEMPLATE_DECL because
10125 value_dependent_expression_p assumes that nothing is
10126 dependent when PROCESSING_TEMPLATE_DECL is zero. */
10127 ++processing_template_decl
;
10128 dependent_p
= value_dependent_expression_p (t
);
10129 --processing_template_decl
;
10133 /* Calculate the most general template of which R is a
10134 specialization, and the complete set of arguments used to
10136 gen_tmpl
= most_general_template (DECL_TI_TEMPLATE (t
));
10137 argvec
= tsubst_template_args (DECL_TI_ARGS
10138 (DECL_TEMPLATE_RESULT
10139 (DECL_TI_TEMPLATE (t
))),
10140 args
, complain
, in_decl
);
10141 if (argvec
== error_mark_node
)
10142 RETURN (error_mark_node
);
10144 /* Check to see if we already have this specialization. */
10145 hash
= hash_tmpl_and_args (gen_tmpl
, argvec
);
10146 spec
= retrieve_specialization (gen_tmpl
, argvec
, hash
);
10154 /* We can see more levels of arguments than parameters if
10155 there was a specialization of a member template, like
10158 template <class T> struct S { template <class U> void f(); }
10159 template <> template <class U> void S<int>::f(U);
10161 Here, we'll be substituting into the specialization,
10162 because that's where we can find the code we actually
10163 want to generate, but we'll have enough arguments for
10164 the most general template.
10166 We also deal with the peculiar case:
10168 template <class T> struct S {
10169 template <class U> friend void f();
10171 template <class U> void f() {}
10173 template void f<double>();
10175 Here, the ARGS for the instantiation of will be {int,
10176 double}. But, we only need as many ARGS as there are
10177 levels of template parameters in CODE_PATTERN. We are
10178 careful not to get fooled into reducing the ARGS in
10181 template <class T> struct S { template <class U> void f(U); }
10182 template <class T> template <> void S<T>::f(int) {}
10184 which we can spot because the pattern will be a
10185 specialization in this case. */
10186 args_depth
= TMPL_ARGS_DEPTH (args
);
10188 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (t
)));
10189 if (args_depth
> parms_depth
10190 && !DECL_TEMPLATE_SPECIALIZATION (t
))
10191 args
= get_innermost_template_args (args
, parms_depth
);
10195 /* This special case arises when we have something like this:
10197 template <class T> struct S {
10198 friend void f<int>(int, double);
10201 Here, the DECL_TI_TEMPLATE for the friend declaration
10202 will be an IDENTIFIER_NODE. We are being called from
10203 tsubst_friend_function, and we want only to create a
10204 new decl (R) with appropriate types so that we can call
10205 determine_specialization. */
10206 gen_tmpl
= NULL_TREE
;
10209 if (DECL_CLASS_SCOPE_P (t
))
10211 if (DECL_NAME (t
) == constructor_name (DECL_CONTEXT (t
)))
10215 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
,
10216 complain
, t
, /*entering_scope=*/1);
10221 ctx
= DECL_CONTEXT (t
);
10223 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
10224 if (type
== error_mark_node
)
10225 RETURN (error_mark_node
);
10227 /* If we hit excessive deduction depth, the type is bogus even if
10228 it isn't error_mark_node, so don't build a decl. */
10229 if (excessive_deduction_depth
)
10230 RETURN (error_mark_node
);
10232 /* We do NOT check for matching decls pushed separately at this
10233 point, as they may not represent instantiations of this
10234 template, and in any case are considered separate under the
10237 DECL_USE_TEMPLATE (r
) = 0;
10238 TREE_TYPE (r
) = type
;
10239 /* Clear out the mangled name and RTL for the instantiation. */
10240 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
10241 SET_DECL_RTL (r
, NULL
);
10242 /* Leave DECL_INITIAL set on deleted instantiations. */
10243 if (!DECL_DELETED_FN (r
))
10244 DECL_INITIAL (r
) = NULL_TREE
;
10245 DECL_CONTEXT (r
) = ctx
;
10247 if (member
&& DECL_CONV_FN_P (r
))
10248 /* Type-conversion operator. Reconstruct the name, in
10249 case it's the name of one of the template's parameters. */
10250 DECL_NAME (r
) = mangle_conv_op_name_for_type (TREE_TYPE (type
));
10252 DECL_ARGUMENTS (r
) = tsubst (DECL_ARGUMENTS (t
), args
,
10254 DECL_RESULT (r
) = NULL_TREE
;
10256 TREE_STATIC (r
) = 0;
10257 TREE_PUBLIC (r
) = TREE_PUBLIC (t
);
10258 DECL_EXTERNAL (r
) = 1;
10259 /* If this is an instantiation of a function with internal
10260 linkage, we already know what object file linkage will be
10261 assigned to the instantiation. */
10262 DECL_INTERFACE_KNOWN (r
) = !TREE_PUBLIC (r
);
10263 DECL_DEFER_OUTPUT (r
) = 0;
10264 DECL_CHAIN (r
) = NULL_TREE
;
10265 DECL_PENDING_INLINE_INFO (r
) = 0;
10266 DECL_PENDING_INLINE_P (r
) = 0;
10267 DECL_SAVED_TREE (r
) = NULL_TREE
;
10268 DECL_STRUCT_FUNCTION (r
) = NULL
;
10270 /* We'll re-clone as appropriate in instantiate_template. */
10271 DECL_CLONED_FUNCTION (r
) = NULL_TREE
;
10273 /* If we aren't complaining now, return on error before we register
10274 the specialization so that we'll complain eventually. */
10275 if ((complain
& tf_error
) == 0
10276 && IDENTIFIER_OPNAME_P (DECL_NAME (r
))
10277 && !grok_op_properties (r
, /*complain=*/false))
10278 RETURN (error_mark_node
);
10280 /* Set up the DECL_TEMPLATE_INFO for R. There's no need to do
10281 this in the special friend case mentioned above where
10282 GEN_TMPL is NULL. */
10285 DECL_TEMPLATE_INFO (r
)
10286 = build_template_info (gen_tmpl
, argvec
);
10287 SET_DECL_IMPLICIT_INSTANTIATION (r
);
10290 = register_specialization (r
, gen_tmpl
, argvec
, false, hash
);
10292 /* We instantiated this while substituting into
10293 the type earlier (template/friend54.C). */
10296 /* We're not supposed to instantiate default arguments
10297 until they are called, for a template. But, for a
10300 template <class T> void f ()
10301 { extern void g(int i = T()); }
10303 we should do the substitution when the template is
10304 instantiated. We handle the member function case in
10305 instantiate_class_template since the default arguments
10306 might refer to other members of the class. */
10308 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
10309 && !uses_template_parms (argvec
))
10310 tsubst_default_arguments (r
);
10313 DECL_TEMPLATE_INFO (r
) = NULL_TREE
;
10315 /* Copy the list of befriending classes. */
10316 for (friends
= &DECL_BEFRIENDING_CLASSES (r
);
10318 friends
= &TREE_CHAIN (*friends
))
10320 *friends
= copy_node (*friends
);
10321 TREE_VALUE (*friends
) = tsubst (TREE_VALUE (*friends
),
10326 if (DECL_CONSTRUCTOR_P (r
) || DECL_DESTRUCTOR_P (r
))
10328 maybe_retrofit_in_chrg (r
);
10329 if (DECL_CONSTRUCTOR_P (r
))
10330 grok_ctor_properties (ctx
, r
);
10331 if (DECL_INHERITED_CTOR_BASE (r
))
10332 deduce_inheriting_ctor (r
);
10333 /* If this is an instantiation of a member template, clone it.
10334 If it isn't, that'll be handled by
10335 clone_constructors_and_destructors. */
10336 if (PRIMARY_TEMPLATE_P (gen_tmpl
))
10337 clone_function_decl (r
, /*update_method_vec_p=*/0);
10339 else if ((complain
& tf_error
) != 0
10340 && IDENTIFIER_OPNAME_P (DECL_NAME (r
))
10341 && !grok_op_properties (r
, /*complain=*/true))
10342 RETURN (error_mark_node
);
10344 if (DECL_FRIEND_P (t
) && DECL_FRIEND_CONTEXT (t
))
10345 SET_DECL_FRIEND_CONTEXT (r
,
10346 tsubst (DECL_FRIEND_CONTEXT (t
),
10347 args
, complain
, in_decl
));
10349 /* Possibly limit visibility based on template args. */
10350 DECL_VISIBILITY (r
) = VISIBILITY_DEFAULT
;
10351 if (DECL_VISIBILITY_SPECIFIED (t
))
10353 DECL_VISIBILITY_SPECIFIED (r
) = 0;
10354 DECL_ATTRIBUTES (r
)
10355 = remove_attribute ("visibility", DECL_ATTRIBUTES (r
));
10357 determine_visibility (r
);
10358 if (DECL_DEFAULTED_OUTSIDE_CLASS_P (r
)
10359 && !processing_template_decl
)
10360 defaulted_late_check (r
);
10362 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
10363 args
, complain
, in_decl
);
10369 tree type
= NULL_TREE
;
10371 tree expanded_types
= NULL_TREE
;
10372 tree prev_r
= NULL_TREE
;
10373 tree first_r
= NULL_TREE
;
10375 if (FUNCTION_PARAMETER_PACK_P (t
))
10377 /* If there is a local specialization that isn't a
10378 parameter pack, it means that we're doing a "simple"
10379 substitution from inside tsubst_pack_expansion. Just
10380 return the local specialization (which will be a single
10382 tree spec
= retrieve_local_specialization (t
);
10384 && TREE_CODE (spec
) == PARM_DECL
10385 && TREE_CODE (TREE_TYPE (spec
)) != TYPE_PACK_EXPANSION
)
10388 /* Expand the TYPE_PACK_EXPANSION that provides the types for
10389 the parameters in this function parameter pack. */
10390 expanded_types
= tsubst_pack_expansion (TREE_TYPE (t
), args
,
10391 complain
, in_decl
);
10392 if (TREE_CODE (expanded_types
) == TREE_VEC
)
10394 len
= TREE_VEC_LENGTH (expanded_types
);
10396 /* Zero-length parameter packs are boring. Just substitute
10399 RETURN (tsubst (TREE_CHAIN (t
), args
, complain
,
10404 /* All we did was update the type. Make a note of that. */
10405 type
= expanded_types
;
10406 expanded_types
= NULL_TREE
;
10410 /* Loop through all of the parameter's we'll build. When T is
10411 a function parameter pack, LEN is the number of expanded
10412 types in EXPANDED_TYPES; otherwise, LEN is 1. */
10414 for (i
= 0; i
< len
; ++i
)
10418 if (DECL_TEMPLATE_PARM_P (t
))
10419 SET_DECL_TEMPLATE_PARM_P (r
);
10421 if (expanded_types
)
10422 /* We're on the Ith parameter of the function parameter
10425 /* An argument of a function parameter pack is not a parameter
10427 FUNCTION_PARAMETER_PACK_P (r
) = false;
10429 /* Get the Ith type. */
10430 type
= TREE_VEC_ELT (expanded_types
, i
);
10432 /* Rename the parameter to include the index. */
10434 = make_ith_pack_parameter_name (DECL_NAME (r
), i
);
10437 /* We're dealing with a normal parameter. */
10438 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
10440 type
= type_decays_to (type
);
10441 TREE_TYPE (r
) = type
;
10442 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
10444 if (DECL_INITIAL (r
))
10446 if (TREE_CODE (DECL_INITIAL (r
)) != TEMPLATE_PARM_INDEX
)
10447 DECL_INITIAL (r
) = TREE_TYPE (r
);
10449 DECL_INITIAL (r
) = tsubst (DECL_INITIAL (r
), args
,
10450 complain
, in_decl
);
10453 DECL_CONTEXT (r
) = NULL_TREE
;
10455 if (!DECL_TEMPLATE_PARM_P (r
))
10456 DECL_ARG_TYPE (r
) = type_passed_as (type
);
10458 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
10459 args
, complain
, in_decl
);
10461 /* Keep track of the first new parameter we
10462 generate. That's what will be returned to the
10467 /* Build a proper chain of parameters when substituting
10468 into a function parameter pack. */
10470 DECL_CHAIN (prev_r
) = r
;
10473 /* If cp_unevaluated_operand is set, we're just looking for a
10474 single dummy parameter, so don't keep going. */
10475 if (DECL_CHAIN (t
) && !cp_unevaluated_operand
)
10476 DECL_CHAIN (r
) = tsubst (DECL_CHAIN (t
), args
,
10477 complain
, DECL_CHAIN (t
));
10479 /* FIRST_R contains the start of the chain we've built. */
10489 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
10490 if (type
== error_mark_node
)
10491 RETURN (error_mark_node
);
10492 TREE_TYPE (r
) = type
;
10493 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
10495 if (DECL_C_BIT_FIELD (r
))
10496 /* For bit-fields, DECL_INITIAL gives the number of bits. For
10497 non-bit-fields DECL_INITIAL is a non-static data member
10498 initializer, which gets deferred instantiation. */
10500 = tsubst_expr (DECL_INITIAL (t
), args
,
10502 /*integral_constant_expression_p=*/true);
10503 else if (DECL_INITIAL (t
))
10505 /* Set up DECL_TEMPLATE_INFO so that we can get at the
10506 NSDMI in perform_member_init. Still set DECL_INITIAL
10507 so that we know there is one. */
10508 DECL_INITIAL (r
) = void_zero_node
;
10509 gcc_assert (DECL_LANG_SPECIFIC (r
) == NULL
);
10510 retrofit_lang_decl (r
);
10511 DECL_TEMPLATE_INFO (r
) = build_template_info (t
, args
);
10513 /* We don't have to set DECL_CONTEXT here; it is set by
10514 finish_member_declaration. */
10515 DECL_CHAIN (r
) = NULL_TREE
;
10516 if (VOID_TYPE_P (type
))
10517 error ("instantiation of %q+D as type %qT", r
, type
);
10519 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
10520 args
, complain
, in_decl
);
10525 /* We reach here only for member using decls. We also need to check
10526 uses_template_parms because DECL_DEPENDENT_P is not set for a
10527 using-declaration that designates a member of the current
10528 instantiation (c++/53549). */
10529 if (DECL_DEPENDENT_P (t
)
10530 || uses_template_parms (USING_DECL_SCOPE (t
)))
10532 tree inst_scope
= tsubst_copy (USING_DECL_SCOPE (t
), args
,
10533 complain
, in_decl
);
10534 tree name
= tsubst_copy (DECL_NAME (t
), args
, complain
, in_decl
);
10535 r
= do_class_using_decl (inst_scope
, name
);
10537 r
= error_mark_node
;
10540 TREE_PROTECTED (r
) = TREE_PROTECTED (t
);
10541 TREE_PRIVATE (r
) = TREE_PRIVATE (t
);
10547 DECL_CHAIN (r
) = NULL_TREE
;
10554 tree argvec
= NULL_TREE
;
10555 tree gen_tmpl
= NULL_TREE
;
10557 tree tmpl
= NULL_TREE
;
10559 tree type
= NULL_TREE
;
10562 if (TREE_CODE (t
) == TYPE_DECL
10563 && t
== TYPE_MAIN_DECL (TREE_TYPE (t
)))
10565 /* If this is the canonical decl, we don't have to
10566 mess with instantiations, and often we can't (for
10567 typename, template type parms and such). Note that
10568 TYPE_NAME is not correct for the above test if
10569 we've copied the type for a typedef. */
10570 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
10571 if (type
== error_mark_node
)
10572 RETURN (error_mark_node
);
10573 r
= TYPE_NAME (type
);
10577 /* Check to see if we already have the specialization we
10580 if (DECL_CLASS_SCOPE_P (t
) || DECL_NAMESPACE_SCOPE_P (t
))
10582 /* T is a static data member or namespace-scope entity.
10583 We have to substitute into namespace-scope variables
10584 (even though such entities are never templates) because
10587 template <class T> void f() { extern T t; }
10589 where the entity referenced is not known until
10590 instantiation time. */
10592 ctx
= DECL_CONTEXT (t
);
10593 if (DECL_CLASS_SCOPE_P (t
))
10595 ctx
= tsubst_aggr_type (ctx
, args
,
10597 in_decl
, /*entering_scope=*/1);
10598 /* If CTX is unchanged, then T is in fact the
10599 specialization we want. That situation occurs when
10600 referencing a static data member within in its own
10601 class. We can use pointer equality, rather than
10602 same_type_p, because DECL_CONTEXT is always
10604 if (ctx
== DECL_CONTEXT (t
)
10605 && (TREE_CODE (t
) != TYPE_DECL
10606 /* ... unless T is a member template; in which
10607 case our caller can be willing to create a
10608 specialization of that template represented
10610 || !(DECL_TI_TEMPLATE (t
)
10611 && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (t
)))))
10617 tmpl
= DECL_TI_TEMPLATE (t
);
10618 gen_tmpl
= most_general_template (tmpl
);
10619 argvec
= tsubst (DECL_TI_ARGS (t
), args
, complain
, in_decl
);
10620 if (argvec
== error_mark_node
)
10621 RETURN (error_mark_node
);
10622 hash
= hash_tmpl_and_args (gen_tmpl
, argvec
);
10623 spec
= retrieve_specialization (gen_tmpl
, argvec
, hash
);
10628 /* A local variable. */
10630 /* Subsequent calls to pushdecl will fill this in. */
10632 spec
= retrieve_local_specialization (t
);
10634 /* If we already have the specialization we need, there is
10635 nothing more to do. */
10642 /* Create a new node for the specialization we need. */
10644 if (type
== NULL_TREE
)
10646 if (is_typedef_decl (t
))
10647 type
= DECL_ORIGINAL_TYPE (t
);
10649 type
= TREE_TYPE (t
);
10651 && VAR_HAD_UNKNOWN_BOUND (t
)
10652 && type
!= error_mark_node
)
10653 type
= strip_array_domain (type
);
10654 type
= tsubst (type
, args
, complain
, in_decl
);
10658 /* Even if the original location is out of scope, the
10659 newly substituted one is not. */
10660 DECL_DEAD_FOR_LOCAL (r
) = 0;
10661 DECL_INITIALIZED_P (r
) = 0;
10662 DECL_TEMPLATE_INSTANTIATED (r
) = 0;
10663 if (type
== error_mark_node
)
10664 RETURN (error_mark_node
);
10665 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10667 /* It may seem that this case cannot occur, since:
10672 declares a function, not a variable. However:
10675 template <typename T> void g() { T t; }
10676 template void g<f>();
10678 is an attempt to declare a variable with function
10680 error ("variable %qD has function type",
10681 /* R is not yet sufficiently initialized, so we
10682 just use its name. */
10684 RETURN (error_mark_node
);
10686 type
= complete_type (type
);
10687 /* Wait until cp_finish_decl to set this again, to handle
10688 circular dependency (template/instantiate6.C). */
10689 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r
) = 0;
10690 type
= check_var_type (DECL_NAME (r
), type
);
10692 if (DECL_HAS_VALUE_EXPR_P (t
))
10694 tree ve
= DECL_VALUE_EXPR (t
);
10695 ve
= tsubst_expr (ve
, args
, complain
, in_decl
,
10696 /*constant_expression_p=*/false);
10697 if (REFERENCE_REF_P (ve
))
10699 gcc_assert (TREE_CODE (type
) == REFERENCE_TYPE
);
10700 ve
= TREE_OPERAND (ve
, 0);
10702 SET_DECL_VALUE_EXPR (r
, ve
);
10705 else if (DECL_SELF_REFERENCE_P (t
))
10706 SET_DECL_SELF_REFERENCE_P (r
);
10707 TREE_TYPE (r
) = type
;
10708 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
10709 DECL_CONTEXT (r
) = ctx
;
10710 /* Clear out the mangled name and RTL for the instantiation. */
10711 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
10712 if (CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_DECL_WRTL
))
10713 SET_DECL_RTL (r
, NULL
);
10714 /* The initializer must not be expanded until it is required;
10715 see [temp.inst]. */
10716 DECL_INITIAL (r
) = NULL_TREE
;
10717 if (CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_DECL_WRTL
))
10718 SET_DECL_RTL (r
, NULL
);
10719 DECL_SIZE (r
) = DECL_SIZE_UNIT (r
) = 0;
10722 /* Possibly limit visibility based on template args. */
10723 DECL_VISIBILITY (r
) = VISIBILITY_DEFAULT
;
10724 if (DECL_VISIBILITY_SPECIFIED (t
))
10726 DECL_VISIBILITY_SPECIFIED (r
) = 0;
10727 DECL_ATTRIBUTES (r
)
10728 = remove_attribute ("visibility", DECL_ATTRIBUTES (r
));
10730 determine_visibility (r
);
10735 /* A static data member declaration is always marked
10736 external when it is declared in-class, even if an
10737 initializer is present. We mimic the non-template
10738 processing here. */
10739 DECL_EXTERNAL (r
) = 1;
10741 register_specialization (r
, gen_tmpl
, argvec
, false, hash
);
10742 DECL_TEMPLATE_INFO (r
) = build_template_info (tmpl
, argvec
);
10743 SET_DECL_IMPLICIT_INSTANTIATION (r
);
10745 else if (cp_unevaluated_operand
)
10746 gcc_unreachable ();
10748 register_local_specialization (r
, t
);
10750 DECL_CHAIN (r
) = NULL_TREE
;
10752 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
),
10754 args
, complain
, in_decl
);
10756 /* Preserve a typedef that names a type. */
10757 if (is_typedef_decl (r
))
10759 DECL_ORIGINAL_TYPE (r
) = NULL_TREE
;
10760 set_underlying_type (r
);
10763 layout_decl (r
, 0);
10768 gcc_unreachable ();
10773 /* Restore the file and line information. */
10774 input_location
= saved_loc
;
10779 /* Substitute into the ARG_TYPES of a function type.
10780 If END is a TREE_CHAIN, leave it and any following types
10784 tsubst_arg_types (tree arg_types
,
10787 tsubst_flags_t complain
,
10790 tree remaining_arg_types
;
10791 tree type
= NULL_TREE
;
10793 tree expanded_args
= NULL_TREE
;
10796 if (!arg_types
|| arg_types
== void_list_node
|| arg_types
== end
)
10799 remaining_arg_types
= tsubst_arg_types (TREE_CHAIN (arg_types
),
10800 args
, end
, complain
, in_decl
);
10801 if (remaining_arg_types
== error_mark_node
)
10802 return error_mark_node
;
10804 if (PACK_EXPANSION_P (TREE_VALUE (arg_types
)))
10806 /* For a pack expansion, perform substitution on the
10807 entire expression. Later on, we'll handle the arguments
10809 expanded_args
= tsubst_pack_expansion (TREE_VALUE (arg_types
),
10810 args
, complain
, in_decl
);
10812 if (TREE_CODE (expanded_args
) == TREE_VEC
)
10813 /* So that we'll spin through the parameters, one by one. */
10814 i
= TREE_VEC_LENGTH (expanded_args
);
10817 /* We only partially substituted into the parameter
10818 pack. Our type is TYPE_PACK_EXPANSION. */
10819 type
= expanded_args
;
10820 expanded_args
= NULL_TREE
;
10828 type
= TREE_VEC_ELT (expanded_args
, i
);
10830 type
= tsubst (TREE_VALUE (arg_types
), args
, complain
, in_decl
);
10832 if (type
== error_mark_node
)
10833 return error_mark_node
;
10834 if (VOID_TYPE_P (type
))
10836 if (complain
& tf_error
)
10838 error ("invalid parameter type %qT", type
);
10840 error ("in declaration %q+D", in_decl
);
10842 return error_mark_node
;
10845 if (abstract_virtuals_error_sfinae (ACU_PARM
, type
, complain
))
10846 return error_mark_node
;
10848 /* Do array-to-pointer, function-to-pointer conversion, and ignore
10849 top-level qualifiers as required. */
10850 type
= cv_unqualified (type_decays_to (type
));
10852 /* We do not substitute into default arguments here. The standard
10853 mandates that they be instantiated only when needed, which is
10854 done in build_over_call. */
10855 default_arg
= TREE_PURPOSE (arg_types
);
10857 if (default_arg
&& TREE_CODE (default_arg
) == DEFAULT_ARG
)
10859 /* We've instantiated a template before its default arguments
10860 have been parsed. This can happen for a nested template
10861 class, and is not an error unless we require the default
10862 argument in a call of this function. */
10863 remaining_arg_types
=
10864 tree_cons (default_arg
, type
, remaining_arg_types
);
10865 vec_safe_push (DEFARG_INSTANTIATIONS(default_arg
), remaining_arg_types
);
10868 remaining_arg_types
=
10869 hash_tree_cons (default_arg
, type
, remaining_arg_types
);
10872 return remaining_arg_types
;
10875 /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does
10876 *not* handle the exception-specification for FNTYPE, because the
10877 initial substitution of explicitly provided template parameters
10878 during argument deduction forbids substitution into the
10879 exception-specification:
10883 All references in the function type of the function template to the
10884 corresponding template parameters are replaced by the specified tem-
10885 plate argument values. If a substitution in a template parameter or
10886 in the function type of the function template results in an invalid
10887 type, type deduction fails. [Note: The equivalent substitution in
10888 exception specifications is done only when the function is instanti-
10889 ated, at which point a program is ill-formed if the substitution
10890 results in an invalid type.] */
10893 tsubst_function_type (tree t
,
10895 tsubst_flags_t complain
,
10902 /* The TYPE_CONTEXT is not used for function/method types. */
10903 gcc_assert (TYPE_CONTEXT (t
) == NULL_TREE
);
10905 /* Substitute the return type. */
10906 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
10907 if (return_type
== error_mark_node
)
10908 return error_mark_node
;
10909 /* DR 486 clarifies that creation of a function type with an
10910 invalid return type is a deduction failure. */
10911 if (TREE_CODE (return_type
) == ARRAY_TYPE
10912 || TREE_CODE (return_type
) == FUNCTION_TYPE
)
10914 if (complain
& tf_error
)
10916 if (TREE_CODE (return_type
) == ARRAY_TYPE
)
10917 error ("function returning an array");
10919 error ("function returning a function");
10921 return error_mark_node
;
10924 if (abstract_virtuals_error_sfinae (ACU_RETURN
, return_type
, complain
))
10925 return error_mark_node
;
10927 /* Substitute the argument types. */
10928 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
, NULL_TREE
,
10929 complain
, in_decl
);
10930 if (arg_types
== error_mark_node
)
10931 return error_mark_node
;
10933 /* Construct a new type node and return it. */
10934 if (TREE_CODE (t
) == FUNCTION_TYPE
)
10936 fntype
= build_function_type (return_type
, arg_types
);
10937 fntype
= apply_memfn_quals (fntype
,
10938 type_memfn_quals (t
),
10939 type_memfn_rqual (t
));
10943 tree r
= TREE_TYPE (TREE_VALUE (arg_types
));
10944 if (! MAYBE_CLASS_TYPE_P (r
))
10948 Type deduction may fail for any of the following
10951 -- Attempting to create "pointer to member of T" when T
10952 is not a class type. */
10953 if (complain
& tf_error
)
10954 error ("creating pointer to member function of non-class type %qT",
10956 return error_mark_node
;
10959 fntype
= build_method_type_directly (r
, return_type
,
10960 TREE_CHAIN (arg_types
));
10961 fntype
= build_ref_qualified_type (fntype
, type_memfn_rqual (t
));
10963 fntype
= cp_build_type_attribute_variant (fntype
, TYPE_ATTRIBUTES (t
));
10968 /* FNTYPE is a FUNCTION_TYPE or METHOD_TYPE. Substitute the template
10969 ARGS into that specification, and return the substituted
10970 specification. If there is no specification, return NULL_TREE. */
10973 tsubst_exception_specification (tree fntype
,
10975 tsubst_flags_t complain
,
10982 specs
= TYPE_RAISES_EXCEPTIONS (fntype
);
10983 new_specs
= NULL_TREE
;
10984 if (specs
&& TREE_PURPOSE (specs
))
10986 /* A noexcept-specifier. */
10987 tree expr
= TREE_PURPOSE (specs
);
10988 if (TREE_CODE (expr
) == INTEGER_CST
)
10992 /* Defer instantiation of noexcept-specifiers to avoid
10993 excessive instantiations (c++/49107). */
10994 new_specs
= make_node (DEFERRED_NOEXCEPT
);
10995 if (DEFERRED_NOEXCEPT_SPEC_P (specs
))
10997 /* We already partially instantiated this member template,
10998 so combine the new args with the old. */
10999 DEFERRED_NOEXCEPT_PATTERN (new_specs
)
11000 = DEFERRED_NOEXCEPT_PATTERN (expr
);
11001 DEFERRED_NOEXCEPT_ARGS (new_specs
)
11002 = add_to_template_args (DEFERRED_NOEXCEPT_ARGS (expr
), args
);
11006 DEFERRED_NOEXCEPT_PATTERN (new_specs
) = expr
;
11007 DEFERRED_NOEXCEPT_ARGS (new_specs
) = args
;
11011 new_specs
= tsubst_copy_and_build
11012 (expr
, args
, complain
, in_decl
, /*function_p=*/false,
11013 /*integral_constant_expression_p=*/true);
11014 new_specs
= build_noexcept_spec (new_specs
, complain
);
11018 if (! TREE_VALUE (specs
))
11025 tree expanded_specs
= NULL_TREE
;
11027 if (PACK_EXPANSION_P (TREE_VALUE (specs
)))
11029 /* Expand the pack expansion type. */
11030 expanded_specs
= tsubst_pack_expansion (TREE_VALUE (specs
),
11034 if (expanded_specs
== error_mark_node
)
11035 return error_mark_node
;
11036 else if (TREE_CODE (expanded_specs
) == TREE_VEC
)
11037 len
= TREE_VEC_LENGTH (expanded_specs
);
11040 /* We're substituting into a member template, so
11041 we got a TYPE_PACK_EXPANSION back. Add that
11042 expansion and move on. */
11043 gcc_assert (TREE_CODE (expanded_specs
)
11044 == TYPE_PACK_EXPANSION
);
11045 new_specs
= add_exception_specifier (new_specs
,
11048 specs
= TREE_CHAIN (specs
);
11053 for (i
= 0; i
< len
; ++i
)
11055 if (expanded_specs
)
11056 spec
= TREE_VEC_ELT (expanded_specs
, i
);
11058 spec
= tsubst (TREE_VALUE (specs
), args
, complain
, in_decl
);
11059 if (spec
== error_mark_node
)
11061 new_specs
= add_exception_specifier (new_specs
, spec
,
11065 specs
= TREE_CHAIN (specs
);
11071 /* Take the tree structure T and replace template parameters used
11072 therein with the argument vector ARGS. IN_DECL is an associated
11073 decl for diagnostics. If an error occurs, returns ERROR_MARK_NODE.
11074 Issue error and warning messages under control of COMPLAIN. Note
11075 that we must be relatively non-tolerant of extensions here, in
11076 order to preserve conformance; if we allow substitutions that
11077 should not be allowed, we may allow argument deductions that should
11078 not succeed, and therefore report ambiguous overload situations
11079 where there are none. In theory, we could allow the substitution,
11080 but indicate that it should have failed, and allow our caller to
11081 make sure that the right thing happens, but we don't try to do this
11084 This function is used for dealing with types, decls and the like;
11085 for expressions, use tsubst_expr or tsubst_copy. */
11088 tsubst (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
11090 enum tree_code code
;
11091 tree type
, r
= NULL_TREE
;
11093 if (t
== NULL_TREE
|| t
== error_mark_node
11094 || t
== integer_type_node
11095 || t
== void_type_node
11096 || t
== char_type_node
11097 || t
== unknown_type_node
11098 || TREE_CODE (t
) == NAMESPACE_DECL
11099 || TREE_CODE (t
) == TRANSLATION_UNIT_DECL
)
11103 return tsubst_decl (t
, args
, complain
);
11105 if (args
== NULL_TREE
)
11108 code
= TREE_CODE (t
);
11110 if (code
== IDENTIFIER_NODE
)
11111 type
= IDENTIFIER_TYPE_VALUE (t
);
11113 type
= TREE_TYPE (t
);
11115 gcc_assert (type
!= unknown_type_node
);
11117 /* Reuse typedefs. We need to do this to handle dependent attributes,
11118 such as attribute aligned. */
11120 && typedef_variant_p (t
))
11122 tree decl
= TYPE_NAME (t
);
11124 if (alias_template_specialization_p (t
))
11126 /* DECL represents an alias template and we want to
11128 tree tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
11129 tree gen_args
= tsubst (DECL_TI_ARGS (decl
), args
, complain
, in_decl
);
11130 r
= instantiate_alias_template (tmpl
, gen_args
, complain
);
11132 else if (DECL_CLASS_SCOPE_P (decl
)
11133 && CLASSTYPE_TEMPLATE_INFO (DECL_CONTEXT (decl
))
11134 && uses_template_parms (DECL_CONTEXT (decl
)))
11136 tree tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
11137 tree gen_args
= tsubst (DECL_TI_ARGS (decl
), args
, complain
, in_decl
);
11138 r
= retrieve_specialization (tmpl
, gen_args
, 0);
11140 else if (DECL_FUNCTION_SCOPE_P (decl
)
11141 && DECL_TEMPLATE_INFO (DECL_CONTEXT (decl
))
11142 && uses_template_parms (DECL_TI_ARGS (DECL_CONTEXT (decl
))))
11143 r
= retrieve_local_specialization (decl
);
11145 /* The typedef is from a non-template context. */
11151 r
= cp_build_qualified_type_real
11152 (r
, cp_type_quals (t
) | cp_type_quals (r
),
11153 complain
| tf_ignore_bad_quals
);
11158 /* We don't have an instantiation yet, so drop the typedef. */
11159 int quals
= cp_type_quals (t
);
11160 t
= DECL_ORIGINAL_TYPE (decl
);
11161 t
= cp_build_qualified_type_real (t
, quals
,
11162 complain
| tf_ignore_bad_quals
);
11167 && code
!= TYPENAME_TYPE
11168 && code
!= TEMPLATE_TYPE_PARM
11169 && code
!= IDENTIFIER_NODE
11170 && code
!= FUNCTION_TYPE
11171 && code
!= METHOD_TYPE
)
11172 type
= tsubst (type
, args
, complain
, in_decl
);
11173 if (type
== error_mark_node
)
11174 return error_mark_node
;
11180 case ENUMERAL_TYPE
:
11181 return tsubst_aggr_type (t
, args
, complain
, in_decl
,
11182 /*entering_scope=*/0);
11185 case IDENTIFIER_NODE
:
11196 if (t
== integer_type_node
)
11199 if (TREE_CODE (TYPE_MIN_VALUE (t
)) == INTEGER_CST
11200 && TREE_CODE (TYPE_MAX_VALUE (t
)) == INTEGER_CST
)
11204 tree max
, omax
= TREE_OPERAND (TYPE_MAX_VALUE (t
), 0);
11206 max
= tsubst_expr (omax
, args
, complain
, in_decl
,
11207 /*integral_constant_expression_p=*/false);
11209 /* Fix up type of the magic NOP_EXPR with TREE_SIDE_EFFECTS if
11211 if (TREE_CODE (max
) == NOP_EXPR
11212 && TREE_SIDE_EFFECTS (omax
)
11213 && !TREE_TYPE (max
))
11214 TREE_TYPE (max
) = TREE_TYPE (TREE_OPERAND (max
, 0));
11216 /* If we're in a partial instantiation, preserve the magic NOP_EXPR
11217 with TREE_SIDE_EFFECTS that indicates this is not an integral
11218 constant expression. */
11219 if (processing_template_decl
11220 && TREE_SIDE_EFFECTS (omax
) && TREE_CODE (omax
) == NOP_EXPR
)
11222 gcc_assert (TREE_CODE (max
) == NOP_EXPR
);
11223 TREE_SIDE_EFFECTS (max
) = 1;
11226 return compute_array_index_type (NULL_TREE
, max
, complain
);
11229 case TEMPLATE_TYPE_PARM
:
11230 case TEMPLATE_TEMPLATE_PARM
:
11231 case BOUND_TEMPLATE_TEMPLATE_PARM
:
11232 case TEMPLATE_PARM_INDEX
:
11237 tree arg
= NULL_TREE
;
11241 gcc_assert (TREE_VEC_LENGTH (args
) > 0);
11242 template_parm_level_and_index (t
, &level
, &idx
);
11244 levels
= TMPL_ARGS_DEPTH (args
);
11245 if (level
<= levels
)
11247 arg
= TMPL_ARG (args
, level
, idx
);
11249 if (arg
&& TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
11251 /* See through ARGUMENT_PACK_SELECT arguments. */
11252 arg
= ARGUMENT_PACK_SELECT_ARG (arg
);
11253 /* If the selected argument is an expansion E, that most
11254 likely means we were called from
11255 gen_elem_of_pack_expansion_instantiation during the
11256 substituting of pack an argument pack (which Ith
11257 element is a pack expansion, where I is
11258 ARGUMENT_PACK_SELECT_INDEX) into a pack expansion.
11259 In this case, the Ith element resulting from this
11260 substituting is going to be a pack expansion, which
11261 pattern is the pattern of E. Let's return the
11263 gen_elem_of_pack_expansion_instantiation will
11264 build the resulting pack expansion from it. */
11265 if (PACK_EXPANSION_P (arg
))
11266 arg
= PACK_EXPANSION_PATTERN (arg
);
11270 if (arg
== error_mark_node
)
11271 return error_mark_node
;
11272 else if (arg
!= NULL_TREE
)
11274 if (ARGUMENT_PACK_P (arg
))
11275 /* If ARG is an argument pack, we don't actually want to
11276 perform a substitution here, because substitutions
11277 for argument packs are only done
11278 element-by-element. We can get to this point when
11279 substituting the type of a non-type template
11280 parameter pack, when that type actually contains
11281 template parameter packs from an outer template, e.g.,
11283 template<typename... Types> struct A {
11284 template<Types... Values> struct B { };
11288 if (code
== TEMPLATE_TYPE_PARM
)
11291 gcc_assert (TYPE_P (arg
));
11293 quals
= cp_type_quals (arg
) | cp_type_quals (t
);
11295 return cp_build_qualified_type_real
11296 (arg
, quals
, complain
| tf_ignore_bad_quals
);
11298 else if (code
== BOUND_TEMPLATE_TEMPLATE_PARM
)
11300 /* We are processing a type constructed from a
11301 template template parameter. */
11302 tree argvec
= tsubst (TYPE_TI_ARGS (t
),
11303 args
, complain
, in_decl
);
11304 if (argvec
== error_mark_node
)
11305 return error_mark_node
;
11307 gcc_assert (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
11308 || TREE_CODE (arg
) == TEMPLATE_DECL
11309 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
);
11311 if (TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
)
11312 /* Consider this code:
11314 template <template <class> class Template>
11316 template <class Arg> using Bind = Template<Arg>;
11319 template <template <class> class Template, class Arg>
11320 using Instantiate = Template<Arg>; //#0
11322 template <template <class> class Template,
11325 Instantiate<Internal<Template>::template Bind,
11328 When #1 is parsed, the
11329 BOUND_TEMPLATE_TEMPLATE_PARM representing the
11330 parameter `Template' in #0 matches the
11331 UNBOUND_CLASS_TEMPLATE representing the argument
11332 `Internal<Template>::template Bind'; We then want
11333 to assemble the type `Bind<Argument>' that can't
11334 be fully created right now, because
11335 `Internal<Template>' not being complete, the Bind
11336 template cannot be looked up in that context. So
11337 we need to "store" `Bind<Argument>' for later
11338 when the context of Bind becomes complete. Let's
11339 store that in a TYPENAME_TYPE. */
11340 return make_typename_type (TYPE_CONTEXT (arg
),
11341 build_nt (TEMPLATE_ID_EXPR
,
11342 TYPE_IDENTIFIER (arg
),
11347 /* We can get a TEMPLATE_TEMPLATE_PARM here when we
11348 are resolving nested-types in the signature of a
11349 member function templates. Otherwise ARG is a
11350 TEMPLATE_DECL and is the real template to be
11352 if (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
11353 arg
= TYPE_NAME (arg
);
11355 r
= lookup_template_class (arg
,
11357 DECL_CONTEXT (arg
),
11358 /*entering_scope=*/0,
11360 return cp_build_qualified_type_real
11361 (r
, cp_type_quals (t
), complain
);
11364 /* TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX. */
11365 return convert_from_reference (unshare_expr (arg
));
11369 /* This can happen during the attempted tsubst'ing in
11370 unify. This means that we don't yet have any information
11371 about the template parameter in question. */
11374 /* Early in template argument deduction substitution, we don't
11375 want to reduce the level of 'auto', or it will be confused
11376 with a normal template parm in subsequent deduction. */
11377 if (is_auto (t
) && (complain
& tf_partial
))
11380 /* If we get here, we must have been looking at a parm for a
11381 more deeply nested template. Make a new version of this
11382 template parameter, but with a lower level. */
11385 case TEMPLATE_TYPE_PARM
:
11386 case TEMPLATE_TEMPLATE_PARM
:
11387 case BOUND_TEMPLATE_TEMPLATE_PARM
:
11388 if (cp_type_quals (t
))
11390 r
= tsubst (TYPE_MAIN_VARIANT (t
), args
, complain
, in_decl
);
11391 r
= cp_build_qualified_type_real
11392 (r
, cp_type_quals (t
),
11393 complain
| (code
== TEMPLATE_TYPE_PARM
11394 ? tf_ignore_bad_quals
: 0));
11399 TEMPLATE_TYPE_PARM_INDEX (r
)
11400 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (t
),
11401 r
, levels
, args
, complain
);
11402 TYPE_STUB_DECL (r
) = TYPE_NAME (r
) = TEMPLATE_TYPE_DECL (r
);
11403 TYPE_MAIN_VARIANT (r
) = r
;
11404 TYPE_POINTER_TO (r
) = NULL_TREE
;
11405 TYPE_REFERENCE_TO (r
) = NULL_TREE
;
11407 if (TREE_CODE (r
) == TEMPLATE_TEMPLATE_PARM
)
11408 /* We have reduced the level of the template
11409 template parameter, but not the levels of its
11410 template parameters, so canonical_type_parameter
11411 will not be able to find the canonical template
11412 template parameter for this level. Thus, we
11413 require structural equality checking to compare
11414 TEMPLATE_TEMPLATE_PARMs. */
11415 SET_TYPE_STRUCTURAL_EQUALITY (r
);
11416 else if (TYPE_STRUCTURAL_EQUALITY_P (t
))
11417 SET_TYPE_STRUCTURAL_EQUALITY (r
);
11419 TYPE_CANONICAL (r
) = canonical_type_parameter (r
);
11421 if (code
== BOUND_TEMPLATE_TEMPLATE_PARM
)
11423 tree argvec
= tsubst (TYPE_TI_ARGS (t
), args
,
11424 complain
, in_decl
);
11425 if (argvec
== error_mark_node
)
11426 return error_mark_node
;
11428 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (r
)
11429 = build_template_info (TYPE_TI_TEMPLATE (t
), argvec
);
11434 case TEMPLATE_PARM_INDEX
:
11435 r
= reduce_template_parm_level (t
, type
, levels
, args
, complain
);
11439 gcc_unreachable ();
11447 tree purpose
, value
, chain
;
11449 if (t
== void_list_node
)
11452 purpose
= TREE_PURPOSE (t
);
11455 purpose
= tsubst (purpose
, args
, complain
, in_decl
);
11456 if (purpose
== error_mark_node
)
11457 return error_mark_node
;
11459 value
= TREE_VALUE (t
);
11462 value
= tsubst (value
, args
, complain
, in_decl
);
11463 if (value
== error_mark_node
)
11464 return error_mark_node
;
11466 chain
= TREE_CHAIN (t
);
11467 if (chain
&& chain
!= void_type_node
)
11469 chain
= tsubst (chain
, args
, complain
, in_decl
);
11470 if (chain
== error_mark_node
)
11471 return error_mark_node
;
11473 if (purpose
== TREE_PURPOSE (t
)
11474 && value
== TREE_VALUE (t
)
11475 && chain
== TREE_CHAIN (t
))
11477 return hash_tree_cons (purpose
, value
, chain
);
11481 /* We should never be tsubsting a binfo. */
11482 gcc_unreachable ();
11485 /* A vector of template arguments. */
11486 gcc_assert (!type
);
11487 return tsubst_template_args (t
, args
, complain
, in_decl
);
11490 case REFERENCE_TYPE
:
11492 if (type
== TREE_TYPE (t
) && TREE_CODE (type
) != METHOD_TYPE
)
11497 Type deduction may fail for any of the following
11500 -- Attempting to create a pointer to reference type.
11501 -- Attempting to create a reference to a reference type or
11502 a reference to void.
11504 Core issue 106 says that creating a reference to a reference
11505 during instantiation is no longer a cause for failure. We
11506 only enforce this check in strict C++98 mode. */
11507 if ((TREE_CODE (type
) == REFERENCE_TYPE
11508 && (((cxx_dialect
== cxx98
) && flag_iso
) || code
!= REFERENCE_TYPE
))
11509 || (code
== REFERENCE_TYPE
&& VOID_TYPE_P (type
)))
11511 static location_t last_loc
;
11513 /* We keep track of the last time we issued this error
11514 message to avoid spewing a ton of messages during a
11515 single bad template instantiation. */
11516 if (complain
& tf_error
11517 && last_loc
!= input_location
)
11519 if (VOID_TYPE_P (type
))
11520 error ("forming reference to void");
11521 else if (code
== POINTER_TYPE
)
11522 error ("forming pointer to reference type %qT", type
);
11524 error ("forming reference to reference type %qT", type
);
11525 last_loc
= input_location
;
11528 return error_mark_node
;
11530 else if (TREE_CODE (type
) == FUNCTION_TYPE
11531 && (type_memfn_quals (type
) != TYPE_UNQUALIFIED
11532 || type_memfn_rqual (type
) != REF_QUAL_NONE
))
11534 if (complain
& tf_error
)
11536 if (code
== POINTER_TYPE
)
11537 error ("forming pointer to qualified function type %qT",
11540 error ("forming reference to qualified function type %qT",
11543 return error_mark_node
;
11545 else if (code
== POINTER_TYPE
)
11547 r
= build_pointer_type (type
);
11548 if (TREE_CODE (type
) == METHOD_TYPE
)
11549 r
= build_ptrmemfunc_type (r
);
11551 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
11552 /* In C++0x, during template argument substitution, when there is an
11553 attempt to create a reference to a reference type, reference
11554 collapsing is applied as described in [14.3.1/4 temp.arg.type]:
11556 "If a template-argument for a template-parameter T names a type
11557 that is a reference to a type A, an attempt to create the type
11558 'lvalue reference to cv T' creates the type 'lvalue reference to
11559 A,' while an attempt to create the type type rvalue reference to
11560 cv T' creates the type T"
11562 r
= cp_build_reference_type
11564 TYPE_REF_IS_RVALUE (t
) && TYPE_REF_IS_RVALUE (type
));
11566 r
= cp_build_reference_type (type
, TYPE_REF_IS_RVALUE (t
));
11567 r
= cp_build_qualified_type_real (r
, cp_type_quals (t
), complain
);
11569 if (cxx_dialect
>= cxx1y
&& array_of_runtime_bound_p (type
))
11571 if (complain
& tf_warning_or_error
)
11573 (input_location
, OPT_Wvla
,
11574 code
== REFERENCE_TYPE
11575 ? G_("cannot declare reference to array of runtime bound")
11576 : G_("cannot declare pointer to array of runtime bound"));
11578 r
= error_mark_node
;
11581 if (r
!= error_mark_node
)
11582 /* Will this ever be needed for TYPE_..._TO values? */
11589 r
= tsubst (TYPE_OFFSET_BASETYPE (t
), args
, complain
, in_decl
);
11590 if (r
== error_mark_node
|| !MAYBE_CLASS_TYPE_P (r
))
11594 Type deduction may fail for any of the following
11597 -- Attempting to create "pointer to member of T" when T
11598 is not a class type. */
11599 if (complain
& tf_error
)
11600 error ("creating pointer to member of non-class type %qT", r
);
11601 return error_mark_node
;
11603 if (TREE_CODE (type
) == REFERENCE_TYPE
)
11605 if (complain
& tf_error
)
11606 error ("creating pointer to member reference type %qT", type
);
11607 return error_mark_node
;
11609 if (VOID_TYPE_P (type
))
11611 if (complain
& tf_error
)
11612 error ("creating pointer to member of type void");
11613 return error_mark_node
;
11615 gcc_assert (TREE_CODE (type
) != METHOD_TYPE
);
11616 if (TREE_CODE (type
) == FUNCTION_TYPE
)
11618 /* The type of the implicit object parameter gets its
11619 cv-qualifiers from the FUNCTION_TYPE. */
11622 = build_memfn_type (type
, r
, type_memfn_quals (type
),
11623 type_memfn_rqual (type
));
11624 memptr
= build_ptrmemfunc_type (build_pointer_type (method_type
));
11625 return cp_build_qualified_type_real (memptr
, cp_type_quals (t
),
11629 return cp_build_qualified_type_real (build_ptrmem_type (r
, type
),
11633 case FUNCTION_TYPE
:
11638 fntype
= tsubst_function_type (t
, args
, complain
, in_decl
);
11639 if (fntype
== error_mark_node
)
11640 return error_mark_node
;
11642 /* Substitute the exception specification. */
11643 specs
= tsubst_exception_specification (t
, args
, complain
,
11644 in_decl
, /*defer_ok*/true);
11645 if (specs
== error_mark_node
)
11646 return error_mark_node
;
11648 fntype
= build_exception_variant (fntype
, specs
);
11653 tree domain
= tsubst (TYPE_DOMAIN (t
), args
, complain
, in_decl
);
11654 if (domain
== error_mark_node
)
11655 return error_mark_node
;
11657 /* As an optimization, we avoid regenerating the array type if
11658 it will obviously be the same as T. */
11659 if (type
== TREE_TYPE (t
) && domain
== TYPE_DOMAIN (t
))
11662 /* These checks should match the ones in grokdeclarator.
11666 The deduction may fail for any of the following reasons:
11668 -- Attempting to create an array with an element type that
11669 is void, a function type, or a reference type, or [DR337]
11670 an abstract class type. */
11671 if (VOID_TYPE_P (type
)
11672 || TREE_CODE (type
) == FUNCTION_TYPE
11673 || TREE_CODE (type
) == REFERENCE_TYPE
)
11675 if (complain
& tf_error
)
11676 error ("creating array of %qT", type
);
11677 return error_mark_node
;
11680 if (abstract_virtuals_error_sfinae (ACU_ARRAY
, type
, complain
))
11681 return error_mark_node
;
11683 r
= build_cplus_array_type (type
, domain
);
11685 if (TYPE_USER_ALIGN (t
))
11687 TYPE_ALIGN (r
) = TYPE_ALIGN (t
);
11688 TYPE_USER_ALIGN (r
) = 1;
11694 case TYPENAME_TYPE
:
11696 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
11697 in_decl
, /*entering_scope=*/1);
11698 tree f
= tsubst_copy (TYPENAME_TYPE_FULLNAME (t
), args
,
11699 complain
, in_decl
);
11701 if (ctx
== error_mark_node
|| f
== error_mark_node
)
11702 return error_mark_node
;
11704 if (!MAYBE_CLASS_TYPE_P (ctx
))
11706 if (complain
& tf_error
)
11707 error ("%qT is not a class, struct, or union type", ctx
);
11708 return error_mark_node
;
11710 else if (!uses_template_parms (ctx
) && !TYPE_BEING_DEFINED (ctx
))
11712 /* Normally, make_typename_type does not require that the CTX
11713 have complete type in order to allow things like:
11715 template <class T> struct S { typename S<T>::X Y; };
11717 But, such constructs have already been resolved by this
11718 point, so here CTX really should have complete type, unless
11719 it's a partial instantiation. */
11720 ctx
= complete_type (ctx
);
11721 if (!COMPLETE_TYPE_P (ctx
))
11723 if (complain
& tf_error
)
11724 cxx_incomplete_type_error (NULL_TREE
, ctx
);
11725 return error_mark_node
;
11729 f
= make_typename_type (ctx
, f
, typename_type
,
11730 complain
| tf_keep_type_decl
);
11731 if (f
== error_mark_node
)
11733 if (TREE_CODE (f
) == TYPE_DECL
)
11735 complain
|= tf_ignore_bad_quals
;
11739 if (TREE_CODE (f
) != TYPENAME_TYPE
)
11741 if (TYPENAME_IS_ENUM_P (t
) && TREE_CODE (f
) != ENUMERAL_TYPE
)
11743 if (complain
& tf_error
)
11744 error ("%qT resolves to %qT, which is not an enumeration type",
11747 return error_mark_node
;
11749 else if (TYPENAME_IS_CLASS_P (t
) && !CLASS_TYPE_P (f
))
11751 if (complain
& tf_error
)
11752 error ("%qT resolves to %qT, which is is not a class type",
11755 return error_mark_node
;
11759 return cp_build_qualified_type_real
11760 (f
, cp_type_quals (f
) | cp_type_quals (t
), complain
);
11763 case UNBOUND_CLASS_TEMPLATE
:
11765 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
11766 in_decl
, /*entering_scope=*/1);
11767 tree name
= TYPE_IDENTIFIER (t
);
11768 tree parm_list
= DECL_TEMPLATE_PARMS (TYPE_NAME (t
));
11770 if (ctx
== error_mark_node
|| name
== error_mark_node
)
11771 return error_mark_node
;
11774 parm_list
= tsubst_template_parms (parm_list
, args
, complain
);
11775 return make_unbound_class_template (ctx
, name
, parm_list
, complain
);
11782 ++cp_unevaluated_operand
;
11783 ++c_inhibit_evaluation_warnings
;
11785 type
= tsubst_expr (TYPEOF_TYPE_EXPR (t
), args
,
11787 /*integral_constant_expression_p=*/false);
11789 --cp_unevaluated_operand
;
11790 --c_inhibit_evaluation_warnings
;
11792 type
= finish_typeof (type
);
11793 return cp_build_qualified_type_real (type
,
11795 | cp_type_quals (type
),
11799 case DECLTYPE_TYPE
:
11803 ++cp_unevaluated_operand
;
11804 ++c_inhibit_evaluation_warnings
;
11806 type
= tsubst_copy_and_build (DECLTYPE_TYPE_EXPR (t
), args
,
11807 complain
|tf_decltype
, in_decl
,
11808 /*function_p*/false,
11809 /*integral_constant_expression*/false);
11811 --cp_unevaluated_operand
;
11812 --c_inhibit_evaluation_warnings
;
11814 if (DECLTYPE_FOR_LAMBDA_CAPTURE (t
))
11815 type
= lambda_capture_field_type (type
,
11816 DECLTYPE_FOR_INIT_CAPTURE (t
));
11817 else if (DECLTYPE_FOR_LAMBDA_PROXY (t
))
11818 type
= lambda_proxy_type (type
);
11821 bool id
= DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t
);
11822 if (id
&& TREE_CODE (DECLTYPE_TYPE_EXPR (t
)) == BIT_NOT_EXPR
11824 /* In a template ~id could be either a complement expression
11825 or an unqualified-id naming a destructor; if instantiating
11826 it produces an expression, it's not an id-expression or
11829 type
= finish_decltype_type (type
, id
, complain
);
11831 return cp_build_qualified_type_real (type
,
11833 | cp_type_quals (type
),
11837 case UNDERLYING_TYPE
:
11839 tree type
= tsubst (UNDERLYING_TYPE_TYPE (t
), args
,
11840 complain
, in_decl
);
11841 return finish_underlying_type (type
);
11844 case TYPE_ARGUMENT_PACK
:
11845 case NONTYPE_ARGUMENT_PACK
:
11847 tree r
= TYPE_P (t
) ? cxx_make_type (code
) : make_node (code
);
11849 tsubst_template_args (ARGUMENT_PACK_ARGS (t
),
11853 SET_ARGUMENT_PACK_ARGS (r
, packed_out
);
11855 /* For template nontype argument packs, also substitute into
11857 if (code
== NONTYPE_ARGUMENT_PACK
)
11858 TREE_TYPE (r
) = tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11876 /* We should use one of the expression tsubsts for these codes. */
11877 gcc_unreachable ();
11880 sorry ("use of %qs in template", tree_code_name
[(int) code
]);
11881 return error_mark_node
;
11885 /* Like tsubst_expr for a BASELINK. OBJECT_TYPE, if non-NULL, is the
11886 type of the expression on the left-hand side of the "." or "->"
11890 tsubst_baselink (tree baselink
, tree object_type
,
11891 tree args
, tsubst_flags_t complain
, tree in_decl
)
11894 tree qualifying_scope
;
11897 tree template_args
= 0;
11898 bool template_id_p
= false;
11899 bool qualified
= BASELINK_QUALIFIED_P (baselink
);
11901 /* A baselink indicates a function from a base class. Both the
11902 BASELINK_ACCESS_BINFO and the base class referenced may
11903 indicate bases of the template class, rather than the
11904 instantiated class. In addition, lookups that were not
11905 ambiguous before may be ambiguous now. Therefore, we perform
11906 the lookup again. */
11907 qualifying_scope
= BINFO_TYPE (BASELINK_ACCESS_BINFO (baselink
));
11908 qualifying_scope
= tsubst (qualifying_scope
, args
,
11909 complain
, in_decl
);
11910 fns
= BASELINK_FUNCTIONS (baselink
);
11911 optype
= tsubst (BASELINK_OPTYPE (baselink
), args
, complain
, in_decl
);
11912 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
11914 template_id_p
= true;
11915 template_args
= TREE_OPERAND (fns
, 1);
11916 fns
= TREE_OPERAND (fns
, 0);
11918 template_args
= tsubst_template_args (template_args
, args
,
11919 complain
, in_decl
);
11921 name
= DECL_NAME (get_first_fn (fns
));
11922 if (IDENTIFIER_TYPENAME_P (name
))
11923 name
= mangle_conv_op_name_for_type (optype
);
11924 baselink
= lookup_fnfields (qualifying_scope
, name
, /*protect=*/1);
11926 return error_mark_node
;
11928 /* If lookup found a single function, mark it as used at this
11929 point. (If it lookup found multiple functions the one selected
11930 later by overload resolution will be marked as used at that
11932 if (BASELINK_P (baselink
))
11933 fns
= BASELINK_FUNCTIONS (baselink
);
11934 if (!template_id_p
&& !really_overloaded_fn (fns
))
11935 mark_used (OVL_CURRENT (fns
));
11937 /* Add back the template arguments, if present. */
11938 if (BASELINK_P (baselink
) && template_id_p
)
11939 BASELINK_FUNCTIONS (baselink
)
11940 = build_nt (TEMPLATE_ID_EXPR
,
11941 BASELINK_FUNCTIONS (baselink
),
11943 /* Update the conversion operator type. */
11944 BASELINK_OPTYPE (baselink
) = optype
;
11947 object_type
= current_class_type
;
11950 baselink
= adjust_result_of_qualified_name_lookup (baselink
,
11956 /* Like tsubst_expr for a SCOPE_REF, given by QUALIFIED_ID. DONE is
11957 true if the qualified-id will be a postfix-expression in-and-of
11958 itself; false if more of the postfix-expression follows the
11959 QUALIFIED_ID. ADDRESS_P is true if the qualified-id is the operand
11963 tsubst_qualified_id (tree qualified_id
, tree args
,
11964 tsubst_flags_t complain
, tree in_decl
,
11965 bool done
, bool address_p
)
11971 tree template_args
;
11972 location_t loc
= UNKNOWN_LOCATION
;
11974 gcc_assert (TREE_CODE (qualified_id
) == SCOPE_REF
);
11976 /* Figure out what name to look up. */
11977 name
= TREE_OPERAND (qualified_id
, 1);
11978 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
11980 is_template
= true;
11981 loc
= EXPR_LOCATION (name
);
11982 template_args
= TREE_OPERAND (name
, 1);
11984 template_args
= tsubst_template_args (template_args
, args
,
11985 complain
, in_decl
);
11986 name
= TREE_OPERAND (name
, 0);
11990 is_template
= false;
11991 template_args
= NULL_TREE
;
11994 /* Substitute into the qualifying scope. When there are no ARGS, we
11995 are just trying to simplify a non-dependent expression. In that
11996 case the qualifying scope may be dependent, and, in any case,
11997 substituting will not help. */
11998 scope
= TREE_OPERAND (qualified_id
, 0);
12001 scope
= tsubst (scope
, args
, complain
, in_decl
);
12002 expr
= tsubst_copy (name
, args
, complain
, in_decl
);
12007 if (dependent_scope_p (scope
))
12010 expr
= build_min_nt_loc (loc
, TEMPLATE_ID_EXPR
, expr
, template_args
);
12011 return build_qualified_name (NULL_TREE
, scope
, expr
,
12012 QUALIFIED_NAME_IS_TEMPLATE (qualified_id
));
12015 if (!BASELINK_P (name
) && !DECL_P (expr
))
12017 if (TREE_CODE (expr
) == BIT_NOT_EXPR
)
12019 /* A BIT_NOT_EXPR is used to represent a destructor. */
12020 if (!check_dtor_name (scope
, TREE_OPERAND (expr
, 0)))
12022 error ("qualifying type %qT does not match destructor name ~%qT",
12023 scope
, TREE_OPERAND (expr
, 0));
12024 expr
= error_mark_node
;
12027 expr
= lookup_qualified_name (scope
, complete_dtor_identifier
,
12028 /*is_type_p=*/0, false);
12031 expr
= lookup_qualified_name (scope
, expr
, /*is_type_p=*/0, false);
12032 if (TREE_CODE (TREE_CODE (expr
) == TEMPLATE_DECL
12033 ? DECL_TEMPLATE_RESULT (expr
) : expr
) == TYPE_DECL
)
12035 if (complain
& tf_error
)
12037 error ("dependent-name %qE is parsed as a non-type, but "
12038 "instantiation yields a type", qualified_id
);
12039 inform (input_location
, "say %<typename %E%> if a type is meant", qualified_id
);
12041 return error_mark_node
;
12047 check_accessibility_of_qualified_id (expr
, /*object_type=*/NULL_TREE
,
12049 /* Remember that there was a reference to this entity. */
12053 if (expr
== error_mark_node
|| TREE_CODE (expr
) == TREE_LIST
)
12055 if (complain
& tf_error
)
12056 qualified_name_lookup_error (scope
,
12057 TREE_OPERAND (qualified_id
, 1),
12058 expr
, input_location
);
12059 return error_mark_node
;
12063 expr
= lookup_template_function (expr
, template_args
);
12065 if (expr
== error_mark_node
&& complain
& tf_error
)
12066 qualified_name_lookup_error (scope
, TREE_OPERAND (qualified_id
, 1),
12067 expr
, input_location
);
12068 else if (TYPE_P (scope
))
12070 expr
= (adjust_result_of_qualified_name_lookup
12071 (expr
, scope
, current_nonlambda_class_type ()));
12072 expr
= (finish_qualified_id_expr
12073 (scope
, expr
, done
, address_p
&& PTRMEM_OK_P (qualified_id
),
12074 QUALIFIED_NAME_IS_TEMPLATE (qualified_id
),
12075 /*template_arg_p=*/false, complain
));
12078 /* Expressions do not generally have reference type. */
12079 if (TREE_CODE (expr
) != SCOPE_REF
12080 /* However, if we're about to form a pointer-to-member, we just
12081 want the referenced member referenced. */
12082 && TREE_CODE (expr
) != OFFSET_REF
)
12083 expr
= convert_from_reference (expr
);
12088 /* Like tsubst, but deals with expressions. This function just replaces
12089 template parms; to finish processing the resultant expression, use
12090 tsubst_copy_and_build or tsubst_expr. */
12093 tsubst_copy (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
12095 enum tree_code code
;
12098 if (t
== NULL_TREE
|| t
== error_mark_node
|| args
== NULL_TREE
)
12101 code
= TREE_CODE (t
);
12106 r
= retrieve_local_specialization (t
);
12108 if (r
== NULL_TREE
)
12110 /* We get here for a use of 'this' in an NSDMI. */
12111 if (DECL_NAME (t
) == this_identifier
12112 && at_function_scope_p ()
12113 && DECL_CONSTRUCTOR_P (current_function_decl
))
12114 return current_class_ptr
;
12116 /* This can happen for a parameter name used later in a function
12117 declaration (such as in a late-specified return type). Just
12118 make a dummy decl, since it's only used for its type. */
12119 gcc_assert (cp_unevaluated_operand
!= 0);
12120 r
= tsubst_decl (t
, args
, complain
);
12121 /* Give it the template pattern as its context; its true context
12122 hasn't been instantiated yet and this is good enough for
12124 DECL_CONTEXT (r
) = DECL_CONTEXT (t
);
12127 if (TREE_CODE (r
) == ARGUMENT_PACK_SELECT
)
12128 r
= ARGUMENT_PACK_SELECT_ARG (r
);
12137 if (DECL_TEMPLATE_PARM_P (t
))
12138 return tsubst_copy (DECL_INITIAL (t
), args
, complain
, in_decl
);
12139 /* There is no need to substitute into namespace-scope
12141 if (DECL_NAMESPACE_SCOPE_P (t
))
12143 /* If ARGS is NULL, then T is known to be non-dependent. */
12144 if (args
== NULL_TREE
)
12145 return integral_constant_value (t
);
12147 /* Unfortunately, we cannot just call lookup_name here.
12150 template <int I> int f() {
12152 struct S { void g() { E e = a; } };
12155 When we instantiate f<7>::S::g(), say, lookup_name is not
12156 clever enough to find f<7>::a. */
12158 = tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
12159 /*entering_scope=*/0);
12161 for (v
= TYPE_VALUES (enum_type
);
12163 v
= TREE_CHAIN (v
))
12164 if (TREE_PURPOSE (v
) == DECL_NAME (t
))
12165 return TREE_VALUE (v
);
12167 /* We didn't find the name. That should never happen; if
12168 name-lookup found it during preliminary parsing, we
12169 should find it again here during instantiation. */
12170 gcc_unreachable ();
12175 if (DECL_CONTEXT (t
))
12179 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
12180 /*entering_scope=*/1);
12181 if (ctx
!= DECL_CONTEXT (t
))
12183 tree r
= lookup_field (ctx
, DECL_NAME (t
), 0, false);
12186 if (complain
& tf_error
)
12187 error ("using invalid field %qD", t
);
12188 return error_mark_node
;
12197 case FUNCTION_DECL
:
12198 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
))
12199 r
= tsubst (t
, args
, complain
, in_decl
);
12200 else if (local_variable_p (t
))
12202 r
= retrieve_local_specialization (t
);
12203 if (r
== NULL_TREE
)
12205 if (DECL_ANON_UNION_VAR_P (t
))
12207 /* Just use name lookup to find a member alias for an
12208 anonymous union, but then add it to the hash table. */
12209 r
= lookup_name (DECL_NAME (t
));
12210 gcc_assert (DECL_ANON_UNION_VAR_P (r
));
12211 register_local_specialization (r
, t
);
12215 gcc_assert (errorcount
|| sorrycount
);
12216 return error_mark_node
;
12225 case NAMESPACE_DECL
:
12229 /* An OVERLOAD will always be a non-dependent overload set; an
12230 overload set from function scope will just be represented with an
12231 IDENTIFIER_NODE, and from class scope with a BASELINK. */
12232 gcc_assert (!uses_template_parms (t
));
12236 return tsubst_baselink (t
, current_class_type
, args
, complain
, in_decl
);
12238 case TEMPLATE_DECL
:
12239 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
12240 return tsubst (TREE_TYPE (DECL_TEMPLATE_RESULT (t
)),
12241 args
, complain
, in_decl
);
12242 else if (DECL_FUNCTION_TEMPLATE_P (t
) && DECL_MEMBER_TEMPLATE_P (t
))
12243 return tsubst (t
, args
, complain
, in_decl
);
12244 else if (DECL_CLASS_SCOPE_P (t
)
12245 && uses_template_parms (DECL_CONTEXT (t
)))
12247 /* Template template argument like the following example need
12250 template <template <class> class TT> struct C {};
12251 template <class T> struct D {
12252 template <class U> struct E {};
12257 We are processing the template argument `E' in #1 for
12258 the template instantiation #2. Originally, `E' is a
12259 TEMPLATE_DECL with `D<T>' as its DECL_CONTEXT. Now we
12260 have to substitute this with one having context `D<int>'. */
12262 tree context
= tsubst (DECL_CONTEXT (t
), args
, complain
, in_decl
);
12263 return lookup_field (context
, DECL_NAME(t
), 0, false);
12266 /* Ordinary template template argument. */
12270 case REINTERPRET_CAST_EXPR
:
12271 case CONST_CAST_EXPR
:
12272 case STATIC_CAST_EXPR
:
12273 case DYNAMIC_CAST_EXPR
:
12274 case IMPLICIT_CONV_EXPR
:
12278 (code
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
12279 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
));
12282 if (PACK_EXPANSION_P (TREE_OPERAND (t
, 0)))
12285 tree expanded
, op
= TREE_OPERAND (t
, 0);
12288 if (SIZEOF_EXPR_TYPE_P (t
))
12289 op
= TREE_TYPE (op
);
12291 ++cp_unevaluated_operand
;
12292 ++c_inhibit_evaluation_warnings
;
12293 /* We only want to compute the number of arguments. */
12294 expanded
= tsubst_pack_expansion (op
, args
, complain
, in_decl
);
12295 --cp_unevaluated_operand
;
12296 --c_inhibit_evaluation_warnings
;
12298 if (TREE_CODE (expanded
) == TREE_VEC
)
12299 len
= TREE_VEC_LENGTH (expanded
);
12301 if (expanded
== error_mark_node
)
12302 return error_mark_node
;
12303 else if (PACK_EXPANSION_P (expanded
)
12304 || (TREE_CODE (expanded
) == TREE_VEC
12306 && PACK_EXPANSION_P (TREE_VEC_ELT (expanded
, len
-1))))
12308 if (TREE_CODE (expanded
) == TREE_VEC
)
12309 expanded
= TREE_VEC_ELT (expanded
, len
- 1);
12311 if (TYPE_P (expanded
))
12312 return cxx_sizeof_or_alignof_type (expanded
, SIZEOF_EXPR
,
12313 complain
& tf_error
);
12315 return cxx_sizeof_or_alignof_expr (expanded
, SIZEOF_EXPR
,
12316 complain
& tf_error
);
12319 return build_int_cst (size_type_node
, len
);
12321 if (SIZEOF_EXPR_TYPE_P (t
))
12323 r
= tsubst (TREE_TYPE (TREE_OPERAND (t
, 0)),
12324 args
, complain
, in_decl
);
12325 r
= build1 (NOP_EXPR
, r
, error_mark_node
);
12326 r
= build1 (SIZEOF_EXPR
,
12327 tsubst (TREE_TYPE (t
), args
, complain
, in_decl
), r
);
12328 SIZEOF_EXPR_TYPE_P (r
) = 1;
12335 case TRUTH_NOT_EXPR
:
12338 case UNARY_PLUS_EXPR
: /* Unary + */
12340 case AT_ENCODE_EXPR
:
12344 case REALPART_EXPR
:
12345 case IMAGPART_EXPR
:
12348 (code
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
12349 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
));
12351 case COMPONENT_REF
:
12356 object
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
12357 name
= TREE_OPERAND (t
, 1);
12358 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
12360 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
12361 complain
, in_decl
);
12362 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
12364 else if (TREE_CODE (name
) == SCOPE_REF
12365 && TREE_CODE (TREE_OPERAND (name
, 1)) == BIT_NOT_EXPR
)
12367 tree base
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
12368 complain
, in_decl
);
12369 name
= TREE_OPERAND (name
, 1);
12370 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
12371 complain
, in_decl
);
12372 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
12373 name
= build_qualified_name (/*type=*/NULL_TREE
,
12375 /*template_p=*/false);
12377 else if (BASELINK_P (name
))
12378 name
= tsubst_baselink (name
,
12379 non_reference (TREE_TYPE (object
)),
12383 name
= tsubst_copy (name
, args
, complain
, in_decl
);
12384 return build_nt (COMPONENT_REF
, object
, name
, NULL_TREE
);
12390 case TRUNC_DIV_EXPR
:
12391 case CEIL_DIV_EXPR
:
12392 case FLOOR_DIV_EXPR
:
12393 case ROUND_DIV_EXPR
:
12394 case EXACT_DIV_EXPR
:
12398 case TRUNC_MOD_EXPR
:
12399 case FLOOR_MOD_EXPR
:
12400 case TRUTH_ANDIF_EXPR
:
12401 case TRUTH_ORIF_EXPR
:
12402 case TRUTH_AND_EXPR
:
12403 case TRUTH_OR_EXPR
:
12416 case COMPOUND_EXPR
:
12419 case PREDECREMENT_EXPR
:
12420 case PREINCREMENT_EXPR
:
12421 case POSTDECREMENT_EXPR
:
12422 case POSTINCREMENT_EXPR
:
12424 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
12425 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
));
12428 return build_qualified_name (/*type=*/NULL_TREE
,
12429 tsubst_copy (TREE_OPERAND (t
, 0),
12430 args
, complain
, in_decl
),
12431 tsubst_copy (TREE_OPERAND (t
, 1),
12432 args
, complain
, in_decl
),
12433 QUALIFIED_NAME_IS_TEMPLATE (t
));
12438 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
12439 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
),
12440 NULL_TREE
, NULL_TREE
);
12444 int n
= VL_EXP_OPERAND_LENGTH (t
);
12445 tree result
= build_vl_exp (CALL_EXPR
, n
);
12447 for (i
= 0; i
< n
; i
++)
12448 TREE_OPERAND (t
, i
) = tsubst_copy (TREE_OPERAND (t
, i
), args
,
12449 complain
, in_decl
);
12455 case PSEUDO_DTOR_EXPR
:
12458 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
12459 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
),
12460 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
));
12461 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
12468 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
12469 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
),
12470 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
));
12471 NEW_EXPR_USE_GLOBAL (r
) = NEW_EXPR_USE_GLOBAL (t
);
12478 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
12479 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
));
12480 DELETE_EXPR_USE_GLOBAL (r
) = DELETE_EXPR_USE_GLOBAL (t
);
12481 DELETE_EXPR_USE_VEC (r
) = DELETE_EXPR_USE_VEC (t
);
12485 case TEMPLATE_ID_EXPR
:
12487 /* Substituted template arguments */
12488 tree fn
= TREE_OPERAND (t
, 0);
12489 tree targs
= TREE_OPERAND (t
, 1);
12491 fn
= tsubst_copy (fn
, args
, complain
, in_decl
);
12493 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
12495 return lookup_template_function (fn
, targs
);
12500 tree purpose
, value
, chain
;
12502 if (t
== void_list_node
)
12505 purpose
= TREE_PURPOSE (t
);
12507 purpose
= tsubst_copy (purpose
, args
, complain
, in_decl
);
12508 value
= TREE_VALUE (t
);
12510 value
= tsubst_copy (value
, args
, complain
, in_decl
);
12511 chain
= TREE_CHAIN (t
);
12512 if (chain
&& chain
!= void_type_node
)
12513 chain
= tsubst_copy (chain
, args
, complain
, in_decl
);
12514 if (purpose
== TREE_PURPOSE (t
)
12515 && value
== TREE_VALUE (t
)
12516 && chain
== TREE_CHAIN (t
))
12518 return tree_cons (purpose
, value
, chain
);
12523 case ENUMERAL_TYPE
:
12525 case TEMPLATE_TYPE_PARM
:
12526 case TEMPLATE_TEMPLATE_PARM
:
12527 case BOUND_TEMPLATE_TEMPLATE_PARM
:
12528 case TEMPLATE_PARM_INDEX
:
12530 case REFERENCE_TYPE
:
12532 case FUNCTION_TYPE
:
12535 case TYPENAME_TYPE
:
12536 case UNBOUND_CLASS_TEMPLATE
:
12538 case DECLTYPE_TYPE
:
12540 return tsubst (t
, args
, complain
, in_decl
);
12542 case IDENTIFIER_NODE
:
12543 if (IDENTIFIER_TYPENAME_P (t
))
12545 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12546 return mangle_conv_op_name_for_type (new_type
);
12552 /* This is handled by tsubst_copy_and_build. */
12553 gcc_unreachable ();
12556 return build_x_va_arg (EXPR_LOCATION (t
),
12557 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
,
12559 tsubst (TREE_TYPE (t
), args
, complain
, in_decl
));
12561 case CLEANUP_POINT_EXPR
:
12562 /* We shouldn't have built any of these during initial template
12563 generation. Instead, they should be built during instantiation
12564 in response to the saved STMT_IS_FULL_EXPR_P setting. */
12565 gcc_unreachable ();
12569 (code
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
12570 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
12571 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
));
12572 PTRMEM_OK_P (r
) = PTRMEM_OK_P (t
);
12573 mark_used (TREE_OPERAND (r
, 1));
12576 case EXPR_PACK_EXPANSION
:
12577 error ("invalid use of pack expansion expression");
12578 return error_mark_node
;
12580 case NONTYPE_ARGUMENT_PACK
:
12581 error ("use %<...%> to expand argument pack");
12582 return error_mark_node
;
12589 /* Instantiate any typedefs in the type. */
12590 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12591 r
= fold_convert (type
, t
);
12592 gcc_assert (TREE_CODE (r
) == code
);
12597 /* These can sometimes show up in a partial instantiation, but never
12598 involve template parms. */
12599 gcc_assert (!uses_template_parms (t
));
12603 /* We shouldn't get here, but keep going if !ENABLE_CHECKING. */
12604 gcc_checking_assert (false);
12609 /* Like tsubst_copy, but specifically for OpenMP clauses. */
12612 tsubst_omp_clauses (tree clauses
, tree args
, tsubst_flags_t complain
,
12615 tree new_clauses
= NULL
, nc
, oc
;
12617 for (oc
= clauses
; oc
; oc
= OMP_CLAUSE_CHAIN (oc
))
12619 nc
= copy_node (oc
);
12620 OMP_CLAUSE_CHAIN (nc
) = new_clauses
;
12623 switch (OMP_CLAUSE_CODE (nc
))
12625 case OMP_CLAUSE_LASTPRIVATE
:
12626 if (OMP_CLAUSE_LASTPRIVATE_STMT (oc
))
12628 OMP_CLAUSE_LASTPRIVATE_STMT (nc
) = push_stmt_list ();
12629 tsubst_expr (OMP_CLAUSE_LASTPRIVATE_STMT (oc
), args
, complain
,
12630 in_decl
, /*integral_constant_expression_p=*/false);
12631 OMP_CLAUSE_LASTPRIVATE_STMT (nc
)
12632 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (nc
));
12635 case OMP_CLAUSE_PRIVATE
:
12636 case OMP_CLAUSE_SHARED
:
12637 case OMP_CLAUSE_FIRSTPRIVATE
:
12638 case OMP_CLAUSE_REDUCTION
:
12639 case OMP_CLAUSE_COPYIN
:
12640 case OMP_CLAUSE_COPYPRIVATE
:
12641 case OMP_CLAUSE_IF
:
12642 case OMP_CLAUSE_NUM_THREADS
:
12643 case OMP_CLAUSE_SCHEDULE
:
12644 case OMP_CLAUSE_COLLAPSE
:
12645 case OMP_CLAUSE_FINAL
:
12646 OMP_CLAUSE_OPERAND (nc
, 0)
12647 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 0), args
, complain
,
12648 in_decl
, /*integral_constant_expression_p=*/false);
12650 case OMP_CLAUSE_NOWAIT
:
12651 case OMP_CLAUSE_ORDERED
:
12652 case OMP_CLAUSE_DEFAULT
:
12653 case OMP_CLAUSE_UNTIED
:
12654 case OMP_CLAUSE_MERGEABLE
:
12657 gcc_unreachable ();
12661 return finish_omp_clauses (nreverse (new_clauses
));
12664 /* Like tsubst_copy_and_build, but unshare TREE_LIST nodes. */
12667 tsubst_copy_asm_operands (tree t
, tree args
, tsubst_flags_t complain
,
12670 #define RECUR(t) tsubst_copy_asm_operands (t, args, complain, in_decl)
12672 tree purpose
, value
, chain
;
12677 if (TREE_CODE (t
) != TREE_LIST
)
12678 return tsubst_copy_and_build (t
, args
, complain
, in_decl
,
12679 /*function_p=*/false,
12680 /*integral_constant_expression_p=*/false);
12682 if (t
== void_list_node
)
12685 purpose
= TREE_PURPOSE (t
);
12687 purpose
= RECUR (purpose
);
12688 value
= TREE_VALUE (t
);
12691 if (TREE_CODE (value
) != LABEL_DECL
)
12692 value
= RECUR (value
);
12695 value
= lookup_label (DECL_NAME (value
));
12696 gcc_assert (TREE_CODE (value
) == LABEL_DECL
);
12697 TREE_USED (value
) = 1;
12700 chain
= TREE_CHAIN (t
);
12701 if (chain
&& chain
!= void_type_node
)
12702 chain
= RECUR (chain
);
12703 return tree_cons (purpose
, value
, chain
);
12707 /* Substitute one OMP_FOR iterator. */
12710 tsubst_omp_for_iterator (tree t
, int i
, tree declv
, tree initv
,
12711 tree condv
, tree incrv
, tree
*clauses
,
12712 tree args
, tsubst_flags_t complain
, tree in_decl
,
12713 bool integral_constant_expression_p
)
12715 #define RECUR(NODE) \
12716 tsubst_expr ((NODE), args, complain, in_decl, \
12717 integral_constant_expression_p)
12718 tree decl
, init
, cond
, incr
;
12721 init
= TREE_VEC_ELT (OMP_FOR_INIT (t
), i
);
12722 gcc_assert (TREE_CODE (init
) == MODIFY_EXPR
);
12723 decl
= TREE_OPERAND (init
, 0);
12724 init
= TREE_OPERAND (init
, 1);
12725 /* Do this before substituting into decl to handle 'auto'. */
12726 init_decl
= (init
&& TREE_CODE (init
) == DECL_EXPR
);
12727 init
= RECUR (init
);
12728 decl
= RECUR (decl
);
12731 gcc_assert (!processing_template_decl
);
12732 init
= DECL_INITIAL (decl
);
12733 DECL_INITIAL (decl
) = NULL_TREE
;
12736 gcc_assert (!type_dependent_expression_p (decl
));
12738 if (!CLASS_TYPE_P (TREE_TYPE (decl
)))
12740 cond
= RECUR (TREE_VEC_ELT (OMP_FOR_COND (t
), i
));
12741 incr
= TREE_VEC_ELT (OMP_FOR_INCR (t
), i
);
12742 if (TREE_CODE (incr
) == MODIFY_EXPR
)
12743 incr
= build_x_modify_expr (EXPR_LOCATION (incr
),
12744 RECUR (TREE_OPERAND (incr
, 0)), NOP_EXPR
,
12745 RECUR (TREE_OPERAND (incr
, 1)),
12748 incr
= RECUR (incr
);
12749 TREE_VEC_ELT (declv
, i
) = decl
;
12750 TREE_VEC_ELT (initv
, i
) = init
;
12751 TREE_VEC_ELT (condv
, i
) = cond
;
12752 TREE_VEC_ELT (incrv
, i
) = incr
;
12756 if (init
&& !init_decl
)
12759 for (c
= *clauses
; c
; c
= OMP_CLAUSE_CHAIN (c
))
12761 if ((OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_PRIVATE
12762 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_LASTPRIVATE
)
12763 && OMP_CLAUSE_DECL (c
) == decl
)
12765 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_FIRSTPRIVATE
12766 && OMP_CLAUSE_DECL (c
) == decl
)
12767 error ("iteration variable %qD should not be firstprivate", decl
);
12768 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
12769 && OMP_CLAUSE_DECL (c
) == decl
)
12770 error ("iteration variable %qD should not be reduction", decl
);
12774 c
= build_omp_clause (input_location
, OMP_CLAUSE_PRIVATE
);
12775 OMP_CLAUSE_DECL (c
) = decl
;
12776 c
= finish_omp_clauses (c
);
12779 OMP_CLAUSE_CHAIN (c
) = *clauses
;
12784 cond
= TREE_VEC_ELT (OMP_FOR_COND (t
), i
);
12785 if (COMPARISON_CLASS_P (cond
))
12786 cond
= build2 (TREE_CODE (cond
), boolean_type_node
,
12787 RECUR (TREE_OPERAND (cond
, 0)),
12788 RECUR (TREE_OPERAND (cond
, 1)));
12790 cond
= RECUR (cond
);
12791 incr
= TREE_VEC_ELT (OMP_FOR_INCR (t
), i
);
12792 switch (TREE_CODE (incr
))
12794 case PREINCREMENT_EXPR
:
12795 case PREDECREMENT_EXPR
:
12796 case POSTINCREMENT_EXPR
:
12797 case POSTDECREMENT_EXPR
:
12798 incr
= build2 (TREE_CODE (incr
), TREE_TYPE (decl
),
12799 RECUR (TREE_OPERAND (incr
, 0)), NULL_TREE
);
12802 if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
12803 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
12805 tree rhs
= TREE_OPERAND (incr
, 1);
12806 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
),
12807 RECUR (TREE_OPERAND (incr
, 0)),
12808 build2 (TREE_CODE (rhs
), TREE_TYPE (decl
),
12809 RECUR (TREE_OPERAND (rhs
, 0)),
12810 RECUR (TREE_OPERAND (rhs
, 1))));
12813 incr
= RECUR (incr
);
12816 if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
12817 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
12819 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
12820 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
12821 build2 (TREE_CODE (TREE_OPERAND (incr
, 1)),
12822 TREE_TYPE (decl
), lhs
,
12823 RECUR (TREE_OPERAND (incr
, 2))));
12825 else if (TREE_CODE (TREE_OPERAND (incr
, 1)) == NOP_EXPR
12826 && (TREE_CODE (TREE_OPERAND (incr
, 2)) == PLUS_EXPR
12827 || (TREE_CODE (TREE_OPERAND (incr
, 2)) == MINUS_EXPR
)))
12829 tree rhs
= TREE_OPERAND (incr
, 2);
12830 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
),
12831 RECUR (TREE_OPERAND (incr
, 0)),
12832 build2 (TREE_CODE (rhs
), TREE_TYPE (decl
),
12833 RECUR (TREE_OPERAND (rhs
, 0)),
12834 RECUR (TREE_OPERAND (rhs
, 1))));
12837 incr
= RECUR (incr
);
12840 incr
= RECUR (incr
);
12844 TREE_VEC_ELT (declv
, i
) = decl
;
12845 TREE_VEC_ELT (initv
, i
) = init
;
12846 TREE_VEC_ELT (condv
, i
) = cond
;
12847 TREE_VEC_ELT (incrv
, i
) = incr
;
12851 /* Like tsubst_copy for expressions, etc. but also does semantic
12855 tsubst_expr (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
,
12856 bool integral_constant_expression_p
)
12858 #define RETURN(EXP) do { r = (EXP); goto out; } while(0)
12859 #define RECUR(NODE) \
12860 tsubst_expr ((NODE), args, complain, in_decl, \
12861 integral_constant_expression_p)
12867 if (t
== NULL_TREE
|| t
== error_mark_node
)
12870 loc
= input_location
;
12871 if (EXPR_HAS_LOCATION (t
))
12872 input_location
= EXPR_LOCATION (t
);
12873 if (STATEMENT_CODE_P (TREE_CODE (t
)))
12874 current_stmt_tree ()->stmts_are_full_exprs_p
= STMT_IS_FULL_EXPR_P (t
);
12876 switch (TREE_CODE (t
))
12878 case STATEMENT_LIST
:
12880 tree_stmt_iterator i
;
12881 for (i
= tsi_start (t
); !tsi_end_p (i
); tsi_next (&i
))
12882 RECUR (tsi_stmt (i
));
12886 case CTOR_INITIALIZER
:
12887 finish_mem_initializers (tsubst_initializer_list
12888 (TREE_OPERAND (t
, 0), args
));
12892 finish_return_stmt (RECUR (TREE_OPERAND (t
, 0)));
12896 tmp
= RECUR (EXPR_STMT_EXPR (t
));
12897 if (EXPR_STMT_STMT_EXPR_RESULT (t
))
12898 finish_stmt_expr_expr (tmp
, cur_stmt_expr
);
12900 finish_expr_stmt (tmp
);
12904 do_using_directive (USING_STMT_NAMESPACE (t
));
12909 tree decl
, pattern_decl
;
12912 pattern_decl
= decl
= DECL_EXPR_DECL (t
);
12913 if (TREE_CODE (decl
) == LABEL_DECL
)
12914 finish_label_decl (DECL_NAME (decl
));
12915 else if (TREE_CODE (decl
) == USING_DECL
)
12917 tree scope
= USING_DECL_SCOPE (decl
);
12918 tree name
= DECL_NAME (decl
);
12921 scope
= tsubst (scope
, args
, complain
, in_decl
);
12922 decl
= lookup_qualified_name (scope
, name
,
12923 /*is_type_p=*/false,
12924 /*complain=*/false);
12925 if (decl
== error_mark_node
|| TREE_CODE (decl
) == TREE_LIST
)
12926 qualified_name_lookup_error (scope
, name
, decl
, input_location
);
12928 do_local_using_decl (decl
, scope
, name
);
12932 init
= DECL_INITIAL (decl
);
12933 decl
= tsubst (decl
, args
, complain
, in_decl
);
12934 if (decl
!= error_mark_node
)
12936 /* By marking the declaration as instantiated, we avoid
12937 trying to instantiate it. Since instantiate_decl can't
12938 handle local variables, and since we've already done
12939 all that needs to be done, that's the right thing to
12942 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
12944 && ANON_AGGR_TYPE_P (TREE_TYPE (decl
)))
12945 /* Anonymous aggregates are a special case. */
12946 finish_anon_union (decl
);
12947 else if (is_capture_proxy (DECL_EXPR_DECL (t
)))
12949 DECL_CONTEXT (decl
) = current_function_decl
;
12950 if (DECL_NAME (decl
) == this_identifier
)
12952 tree lam
= DECL_CONTEXT (current_function_decl
);
12953 lam
= CLASSTYPE_LAMBDA_EXPR (lam
);
12954 LAMBDA_EXPR_THIS_CAPTURE (lam
) = decl
;
12956 insert_capture_proxy (decl
);
12958 else if (DECL_IMPLICIT_TYPEDEF_P (t
))
12959 /* We already did a pushtag. */;
12962 int const_init
= false;
12963 maybe_push_decl (decl
);
12965 && DECL_PRETTY_FUNCTION_P (decl
))
12967 /* For __PRETTY_FUNCTION__ we have to adjust the
12969 const char *const name
12970 = cxx_printable_name (current_function_decl
, 2);
12971 init
= cp_fname_init (name
, &TREE_TYPE (decl
));
12975 tree t
= RECUR (init
);
12979 /* If we had an initializer but it
12980 instantiated to nothing,
12981 value-initialize the object. This will
12982 only occur when the initializer was a
12983 pack expansion where the parameter packs
12984 used in that expansion were of length
12986 init
= build_value_init (TREE_TYPE (decl
),
12988 if (TREE_CODE (init
) == AGGR_INIT_EXPR
)
12989 init
= get_target_expr_sfinae (init
, complain
);
12996 const_init
= (DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P
12998 cp_finish_decl (decl
, init
, const_init
, NULL_TREE
, 0);
13007 stmt
= begin_for_stmt (NULL_TREE
, NULL_TREE
);
13008 RECUR (FOR_INIT_STMT (t
));
13009 finish_for_init_stmt (stmt
);
13010 tmp
= RECUR (FOR_COND (t
));
13011 finish_for_cond (tmp
, stmt
);
13012 tmp
= RECUR (FOR_EXPR (t
));
13013 finish_for_expr (tmp
, stmt
);
13014 RECUR (FOR_BODY (t
));
13015 finish_for_stmt (stmt
);
13018 case RANGE_FOR_STMT
:
13021 stmt
= begin_for_stmt (NULL_TREE
, NULL_TREE
);
13022 decl
= RANGE_FOR_DECL (t
);
13023 decl
= tsubst (decl
, args
, complain
, in_decl
);
13024 maybe_push_decl (decl
);
13025 expr
= RECUR (RANGE_FOR_EXPR (t
));
13026 stmt
= cp_convert_range_for (stmt
, decl
, expr
);
13027 RECUR (RANGE_FOR_BODY (t
));
13028 finish_for_stmt (stmt
);
13033 stmt
= begin_while_stmt ();
13034 tmp
= RECUR (WHILE_COND (t
));
13035 finish_while_stmt_cond (tmp
, stmt
);
13036 RECUR (WHILE_BODY (t
));
13037 finish_while_stmt (stmt
);
13041 stmt
= begin_do_stmt ();
13042 RECUR (DO_BODY (t
));
13043 finish_do_body (stmt
);
13044 tmp
= RECUR (DO_COND (t
));
13045 finish_do_stmt (tmp
, stmt
);
13049 stmt
= begin_if_stmt ();
13050 tmp
= RECUR (IF_COND (t
));
13051 finish_if_stmt_cond (tmp
, stmt
);
13052 RECUR (THEN_CLAUSE (t
));
13053 finish_then_clause (stmt
);
13055 if (ELSE_CLAUSE (t
))
13057 begin_else_clause (stmt
);
13058 RECUR (ELSE_CLAUSE (t
));
13059 finish_else_clause (stmt
);
13062 finish_if_stmt (stmt
);
13066 if (BIND_EXPR_BODY_BLOCK (t
))
13067 stmt
= begin_function_body ();
13069 stmt
= begin_compound_stmt (BIND_EXPR_TRY_BLOCK (t
)
13070 ? BCS_TRY_BLOCK
: 0);
13072 RECUR (BIND_EXPR_BODY (t
));
13074 if (BIND_EXPR_BODY_BLOCK (t
))
13075 finish_function_body (stmt
);
13077 finish_compound_stmt (stmt
);
13081 finish_break_stmt ();
13084 case CONTINUE_STMT
:
13085 finish_continue_stmt ();
13089 stmt
= begin_switch_stmt ();
13090 tmp
= RECUR (SWITCH_STMT_COND (t
));
13091 finish_switch_cond (tmp
, stmt
);
13092 RECUR (SWITCH_STMT_BODY (t
));
13093 finish_switch_stmt (stmt
);
13096 case CASE_LABEL_EXPR
:
13097 finish_case_label (EXPR_LOCATION (t
),
13098 RECUR (CASE_LOW (t
)),
13099 RECUR (CASE_HIGH (t
)));
13104 tree decl
= LABEL_EXPR_LABEL (t
);
13107 label
= finish_label_stmt (DECL_NAME (decl
));
13108 if (DECL_ATTRIBUTES (decl
) != NULL_TREE
)
13109 cplus_decl_attributes (&label
, DECL_ATTRIBUTES (decl
), 0);
13114 tmp
= GOTO_DESTINATION (t
);
13115 if (TREE_CODE (tmp
) != LABEL_DECL
)
13116 /* Computed goto's must be tsubst'd into. On the other hand,
13117 non-computed gotos must not be; the identifier in question
13118 will have no binding. */
13121 tmp
= DECL_NAME (tmp
);
13122 finish_goto_stmt (tmp
);
13126 tmp
= finish_asm_stmt
13127 (ASM_VOLATILE_P (t
),
13128 RECUR (ASM_STRING (t
)),
13129 tsubst_copy_asm_operands (ASM_OUTPUTS (t
), args
, complain
, in_decl
),
13130 tsubst_copy_asm_operands (ASM_INPUTS (t
), args
, complain
, in_decl
),
13131 tsubst_copy_asm_operands (ASM_CLOBBERS (t
), args
, complain
, in_decl
),
13132 tsubst_copy_asm_operands (ASM_LABELS (t
), args
, complain
, in_decl
));
13134 tree asm_expr
= tmp
;
13135 if (TREE_CODE (asm_expr
) == CLEANUP_POINT_EXPR
)
13136 asm_expr
= TREE_OPERAND (asm_expr
, 0);
13137 ASM_INPUT_P (asm_expr
) = ASM_INPUT_P (t
);
13144 stmt
= begin_try_block ();
13145 RECUR (TRY_STMTS (t
));
13146 finish_cleanup_try_block (stmt
);
13147 finish_cleanup (RECUR (TRY_HANDLERS (t
)), stmt
);
13151 tree compound_stmt
= NULL_TREE
;
13153 if (FN_TRY_BLOCK_P (t
))
13154 stmt
= begin_function_try_block (&compound_stmt
);
13156 stmt
= begin_try_block ();
13158 RECUR (TRY_STMTS (t
));
13160 if (FN_TRY_BLOCK_P (t
))
13161 finish_function_try_block (stmt
);
13163 finish_try_block (stmt
);
13165 RECUR (TRY_HANDLERS (t
));
13166 if (FN_TRY_BLOCK_P (t
))
13167 finish_function_handler_sequence (stmt
, compound_stmt
);
13169 finish_handler_sequence (stmt
);
13175 tree decl
= HANDLER_PARMS (t
);
13179 decl
= tsubst (decl
, args
, complain
, in_decl
);
13180 /* Prevent instantiate_decl from trying to instantiate
13181 this variable. We've already done all that needs to be
13183 if (decl
!= error_mark_node
)
13184 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
13186 stmt
= begin_handler ();
13187 finish_handler_parms (decl
, stmt
);
13188 RECUR (HANDLER_BODY (t
));
13189 finish_handler (stmt
);
13194 tmp
= tsubst (TREE_TYPE (t
), args
, complain
, NULL_TREE
);
13195 if (CLASS_TYPE_P (tmp
))
13197 /* Local classes are not independent templates; they are
13198 instantiated along with their containing function. And this
13199 way we don't have to deal with pushing out of one local class
13200 to instantiate a member of another local class. */
13202 /* Closures are handled by the LAMBDA_EXPR. */
13203 gcc_assert (!LAMBDA_TYPE_P (TREE_TYPE (t
)));
13204 complete_type (tmp
);
13205 for (fn
= TYPE_METHODS (tmp
); fn
; fn
= DECL_CHAIN (fn
))
13206 if (!DECL_ARTIFICIAL (fn
))
13207 instantiate_decl (fn
, /*defer_ok*/0, /*expl_inst_class*/false);
13211 case STATIC_ASSERT
:
13215 ++c_inhibit_evaluation_warnings
;
13217 tsubst_expr (STATIC_ASSERT_CONDITION (t
),
13220 /*integral_constant_expression_p=*/true);
13221 --c_inhibit_evaluation_warnings
;
13223 finish_static_assert (condition
,
13224 STATIC_ASSERT_MESSAGE (t
),
13225 STATIC_ASSERT_SOURCE_LOCATION (t
),
13226 /*member_p=*/false);
13231 tmp
= tsubst_omp_clauses (OMP_PARALLEL_CLAUSES (t
),
13232 args
, complain
, in_decl
);
13233 stmt
= begin_omp_parallel ();
13234 RECUR (OMP_PARALLEL_BODY (t
));
13235 OMP_PARALLEL_COMBINED (finish_omp_parallel (tmp
, stmt
))
13236 = OMP_PARALLEL_COMBINED (t
);
13240 tmp
= tsubst_omp_clauses (OMP_TASK_CLAUSES (t
),
13241 args
, complain
, in_decl
);
13242 stmt
= begin_omp_task ();
13243 RECUR (OMP_TASK_BODY (t
));
13244 finish_omp_task (tmp
, stmt
);
13249 tree clauses
, body
, pre_body
;
13250 tree declv
, initv
, condv
, incrv
;
13253 clauses
= tsubst_omp_clauses (OMP_FOR_CLAUSES (t
),
13254 args
, complain
, in_decl
);
13255 declv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
13256 initv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
13257 condv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
13258 incrv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
13260 stmt
= begin_omp_structured_block ();
13262 pre_body
= push_stmt_list ();
13263 RECUR (OMP_FOR_PRE_BODY (t
));
13264 pre_body
= pop_stmt_list (pre_body
);
13266 for (i
= 0; i
< TREE_VEC_LENGTH (OMP_FOR_INIT (t
)); i
++)
13267 tsubst_omp_for_iterator (t
, i
, declv
, initv
, condv
, incrv
,
13268 &clauses
, args
, complain
, in_decl
,
13269 integral_constant_expression_p
);
13271 body
= push_stmt_list ();
13272 RECUR (OMP_FOR_BODY (t
));
13273 body
= pop_stmt_list (body
);
13275 t
= finish_omp_for (EXPR_LOCATION (t
), declv
, initv
, condv
, incrv
,
13276 body
, pre_body
, clauses
);
13278 add_stmt (finish_omp_structured_block (stmt
));
13284 tmp
= tsubst_omp_clauses (OMP_CLAUSES (t
), args
, complain
, in_decl
);
13285 stmt
= push_stmt_list ();
13286 RECUR (OMP_BODY (t
));
13287 stmt
= pop_stmt_list (stmt
);
13290 OMP_BODY (t
) = stmt
;
13291 OMP_CLAUSES (t
) = tmp
;
13299 stmt
= push_stmt_list ();
13300 RECUR (OMP_BODY (t
));
13301 stmt
= pop_stmt_list (stmt
);
13304 OMP_BODY (t
) = stmt
;
13309 gcc_assert (OMP_ATOMIC_DEPENDENT_P (t
));
13310 if (TREE_CODE (TREE_OPERAND (t
, 1)) != MODIFY_EXPR
)
13312 tree op1
= TREE_OPERAND (t
, 1);
13313 tree rhs1
= NULL_TREE
;
13315 if (TREE_CODE (op1
) == COMPOUND_EXPR
)
13317 rhs1
= RECUR (TREE_OPERAND (op1
, 0));
13318 op1
= TREE_OPERAND (op1
, 1);
13320 lhs
= RECUR (TREE_OPERAND (op1
, 0));
13321 rhs
= RECUR (TREE_OPERAND (op1
, 1));
13322 finish_omp_atomic (OMP_ATOMIC
, TREE_CODE (op1
), lhs
, rhs
,
13323 NULL_TREE
, NULL_TREE
, rhs1
);
13327 tree op1
= TREE_OPERAND (t
, 1);
13328 tree v
= NULL_TREE
, lhs
, rhs
= NULL_TREE
, lhs1
= NULL_TREE
;
13329 tree rhs1
= NULL_TREE
;
13330 enum tree_code code
= TREE_CODE (TREE_OPERAND (op1
, 1));
13331 enum tree_code opcode
= NOP_EXPR
;
13332 if (code
== OMP_ATOMIC_READ
)
13334 v
= RECUR (TREE_OPERAND (op1
, 0));
13335 lhs
= RECUR (TREE_OPERAND (TREE_OPERAND (op1
, 1), 0));
13337 else if (code
== OMP_ATOMIC_CAPTURE_OLD
13338 || code
== OMP_ATOMIC_CAPTURE_NEW
)
13340 tree op11
= TREE_OPERAND (TREE_OPERAND (op1
, 1), 1);
13341 v
= RECUR (TREE_OPERAND (op1
, 0));
13342 lhs1
= RECUR (TREE_OPERAND (TREE_OPERAND (op1
, 1), 0));
13343 if (TREE_CODE (op11
) == COMPOUND_EXPR
)
13345 rhs1
= RECUR (TREE_OPERAND (op11
, 0));
13346 op11
= TREE_OPERAND (op11
, 1);
13348 lhs
= RECUR (TREE_OPERAND (op11
, 0));
13349 rhs
= RECUR (TREE_OPERAND (op11
, 1));
13350 opcode
= TREE_CODE (op11
);
13355 lhs
= RECUR (TREE_OPERAND (op1
, 0));
13356 rhs
= RECUR (TREE_OPERAND (op1
, 1));
13358 finish_omp_atomic (code
, opcode
, lhs
, rhs
, v
, lhs1
, rhs1
);
13362 case TRANSACTION_EXPR
:
13365 flags
|= (TRANSACTION_EXPR_OUTER (t
) ? TM_STMT_ATTR_OUTER
: 0);
13366 flags
|= (TRANSACTION_EXPR_RELAXED (t
) ? TM_STMT_ATTR_RELAXED
: 0);
13368 if (TRANSACTION_EXPR_IS_STMT (t
))
13370 tree body
= TRANSACTION_EXPR_BODY (t
);
13371 tree noex
= NULL_TREE
;
13372 if (TREE_CODE (body
) == MUST_NOT_THROW_EXPR
)
13374 noex
= MUST_NOT_THROW_COND (body
);
13375 if (noex
== NULL_TREE
)
13376 noex
= boolean_true_node
;
13377 body
= TREE_OPERAND (body
, 0);
13379 stmt
= begin_transaction_stmt (input_location
, NULL
, flags
);
13381 finish_transaction_stmt (stmt
, NULL
, flags
, RECUR (noex
));
13385 stmt
= build_transaction_expr (EXPR_LOCATION (t
),
13386 RECUR (TRANSACTION_EXPR_BODY (t
)),
13393 case MUST_NOT_THROW_EXPR
:
13394 RETURN (build_must_not_throw_expr (RECUR (TREE_OPERAND (t
, 0)),
13395 RECUR (MUST_NOT_THROW_COND (t
))));
13397 case EXPR_PACK_EXPANSION
:
13398 error ("invalid use of pack expansion expression");
13399 RETURN (error_mark_node
);
13401 case NONTYPE_ARGUMENT_PACK
:
13402 error ("use %<...%> to expand argument pack");
13403 RETURN (error_mark_node
);
13405 case COMPOUND_EXPR
:
13406 tmp
= RECUR (TREE_OPERAND (t
, 0));
13407 if (tmp
== NULL_TREE
)
13408 /* If the first operand was a statement, we're done with it. */
13409 RETURN (RECUR (TREE_OPERAND (t
, 1)));
13410 RETURN (build_x_compound_expr (EXPR_LOCATION (t
), tmp
,
13411 RECUR (TREE_OPERAND (t
, 1)),
13415 gcc_assert (!STATEMENT_CODE_P (TREE_CODE (t
)));
13417 RETURN (tsubst_copy_and_build (t
, args
, complain
, in_decl
,
13418 /*function_p=*/false,
13419 integral_constant_expression_p
));
13422 RETURN (NULL_TREE
);
13424 input_location
= loc
;
13430 /* T is a postfix-expression that is not being used in a function
13431 call. Return the substituted version of T. */
13434 tsubst_non_call_postfix_expression (tree t
, tree args
,
13435 tsubst_flags_t complain
,
13438 if (TREE_CODE (t
) == SCOPE_REF
)
13439 t
= tsubst_qualified_id (t
, args
, complain
, in_decl
,
13440 /*done=*/false, /*address_p=*/false);
13442 t
= tsubst_copy_and_build (t
, args
, complain
, in_decl
,
13443 /*function_p=*/false,
13444 /*integral_constant_expression_p=*/false);
13449 /* Like tsubst but deals with expressions and performs semantic
13450 analysis. FUNCTION_P is true if T is the "F" in "F (ARGS)". */
13453 tsubst_copy_and_build (tree t
,
13455 tsubst_flags_t complain
,
13458 bool integral_constant_expression_p
)
13460 #define RETURN(EXP) do { retval = (EXP); goto out; } while(0)
13461 #define RECUR(NODE) \
13462 tsubst_copy_and_build (NODE, args, complain, in_decl, \
13463 /*function_p=*/false, \
13464 integral_constant_expression_p)
13469 if (t
== NULL_TREE
|| t
== error_mark_node
)
13472 loc
= input_location
;
13473 if (EXPR_HAS_LOCATION (t
))
13474 input_location
= EXPR_LOCATION (t
);
13476 /* N3276 decltype magic only applies to calls at the top level or on the
13477 right side of a comma. */
13478 tsubst_flags_t decltype_flag
= (complain
& tf_decltype
);
13479 complain
&= ~tf_decltype
;
13481 switch (TREE_CODE (t
))
13485 /* Fall through. */
13486 case IDENTIFIER_NODE
:
13490 bool non_integral_constant_expression_p
;
13491 const char *error_msg
;
13493 if (IDENTIFIER_TYPENAME_P (t
))
13495 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13496 t
= mangle_conv_op_name_for_type (new_type
);
13499 /* Look up the name. */
13500 decl
= lookup_name (t
);
13502 /* By convention, expressions use ERROR_MARK_NODE to indicate
13503 failure, not NULL_TREE. */
13504 if (decl
== NULL_TREE
)
13505 decl
= error_mark_node
;
13507 decl
= finish_id_expression (t
, decl
, NULL_TREE
,
13509 integral_constant_expression_p
,
13510 /*allow_non_integral_constant_expression_p=*/(cxx_dialect
>= cxx0x
),
13511 &non_integral_constant_expression_p
,
13512 /*template_p=*/false,
13514 /*address_p=*/false,
13515 /*template_arg_p=*/false,
13520 if (!function_p
&& identifier_p (decl
))
13522 if (complain
& tf_error
)
13523 unqualified_name_lookup_error (decl
);
13524 decl
= error_mark_node
;
13529 case TEMPLATE_ID_EXPR
:
13532 tree templ
= RECUR (TREE_OPERAND (t
, 0));
13533 tree targs
= TREE_OPERAND (t
, 1);
13536 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
13538 if (TREE_CODE (templ
) == COMPONENT_REF
)
13540 object
= TREE_OPERAND (templ
, 0);
13541 templ
= TREE_OPERAND (templ
, 1);
13544 object
= NULL_TREE
;
13545 templ
= lookup_template_function (templ
, targs
);
13548 RETURN (build3 (COMPONENT_REF
, TREE_TYPE (templ
),
13549 object
, templ
, NULL_TREE
));
13551 RETURN (baselink_for_fns (templ
));
13556 tree r
= RECUR (TREE_OPERAND (t
, 0));
13558 if (REFERENCE_REF_P (t
))
13560 /* A type conversion to reference type will be enclosed in
13561 such an indirect ref, but the substitution of the cast
13562 will have also added such an indirect ref. */
13563 if (TREE_CODE (TREE_TYPE (r
)) == REFERENCE_TYPE
)
13564 r
= convert_from_reference (r
);
13567 r
= build_x_indirect_ref (input_location
, r
, RO_UNARY_STAR
,
13568 complain
|decltype_flag
);
13574 (tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
13575 RECUR (TREE_OPERAND (t
, 0))));
13577 case IMPLICIT_CONV_EXPR
:
13579 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13580 tree expr
= RECUR (TREE_OPERAND (t
, 0));
13581 int flags
= LOOKUP_IMPLICIT
;
13582 if (IMPLICIT_CONV_EXPR_DIRECT_INIT (t
))
13583 flags
= LOOKUP_NORMAL
;
13584 RETURN (perform_implicit_conversion_flags (type
, expr
, complain
,
13591 tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
13592 RECUR (TREE_OPERAND (t
, 0))));
13595 case REINTERPRET_CAST_EXPR
:
13596 case CONST_CAST_EXPR
:
13597 case DYNAMIC_CAST_EXPR
:
13598 case STATIC_CAST_EXPR
:
13601 tree op
, r
= NULL_TREE
;
13603 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13604 if (integral_constant_expression_p
13605 && !cast_valid_in_integral_constant_expression_p (type
))
13607 if (complain
& tf_error
)
13608 error ("a cast to a type other than an integral or "
13609 "enumeration type cannot appear in a constant-expression");
13610 RETURN (error_mark_node
);
13613 op
= RECUR (TREE_OPERAND (t
, 0));
13615 ++c_inhibit_evaluation_warnings
;
13616 switch (TREE_CODE (t
))
13619 r
= build_functional_cast (type
, op
, complain
);
13621 case REINTERPRET_CAST_EXPR
:
13622 r
= build_reinterpret_cast (type
, op
, complain
);
13624 case CONST_CAST_EXPR
:
13625 r
= build_const_cast (type
, op
, complain
);
13627 case DYNAMIC_CAST_EXPR
:
13628 r
= build_dynamic_cast (type
, op
, complain
);
13630 case STATIC_CAST_EXPR
:
13631 r
= build_static_cast (type
, op
, complain
);
13634 gcc_unreachable ();
13636 --c_inhibit_evaluation_warnings
;
13641 case POSTDECREMENT_EXPR
:
13642 case POSTINCREMENT_EXPR
:
13643 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
13644 args
, complain
, in_decl
);
13645 RETURN (build_x_unary_op (input_location
, TREE_CODE (t
), op1
,
13646 complain
|decltype_flag
));
13648 case PREDECREMENT_EXPR
:
13649 case PREINCREMENT_EXPR
:
13653 case TRUTH_NOT_EXPR
:
13654 case UNARY_PLUS_EXPR
: /* Unary + */
13655 case REALPART_EXPR
:
13656 case IMAGPART_EXPR
:
13657 RETURN (build_x_unary_op (input_location
, TREE_CODE (t
),
13658 RECUR (TREE_OPERAND (t
, 0)),
13659 complain
|decltype_flag
));
13661 case FIX_TRUNC_EXPR
:
13662 RETURN (cp_build_unary_op (FIX_TRUNC_EXPR
, RECUR (TREE_OPERAND (t
, 0)),
13666 op1
= TREE_OPERAND (t
, 0);
13667 if (TREE_CODE (op1
) == LABEL_DECL
)
13668 RETURN (finish_label_address_expr (DECL_NAME (op1
),
13669 EXPR_LOCATION (op1
)));
13670 if (TREE_CODE (op1
) == SCOPE_REF
)
13671 op1
= tsubst_qualified_id (op1
, args
, complain
, in_decl
,
13672 /*done=*/true, /*address_p=*/true);
13674 op1
= tsubst_non_call_postfix_expression (op1
, args
, complain
,
13676 RETURN (build_x_unary_op (input_location
, ADDR_EXPR
, op1
,
13677 complain
|decltype_flag
));
13682 case TRUNC_DIV_EXPR
:
13683 case CEIL_DIV_EXPR
:
13684 case FLOOR_DIV_EXPR
:
13685 case ROUND_DIV_EXPR
:
13686 case EXACT_DIV_EXPR
:
13690 case TRUNC_MOD_EXPR
:
13691 case FLOOR_MOD_EXPR
:
13692 case TRUTH_ANDIF_EXPR
:
13693 case TRUTH_ORIF_EXPR
:
13694 case TRUTH_AND_EXPR
:
13695 case TRUTH_OR_EXPR
:
13713 ++c_inhibit_evaluation_warnings
;
13715 r
= build_x_binary_op
13716 (input_location
, TREE_CODE (t
),
13717 RECUR (TREE_OPERAND (t
, 0)),
13718 (TREE_NO_WARNING (TREE_OPERAND (t
, 0))
13720 : TREE_CODE (TREE_OPERAND (t
, 0))),
13721 RECUR (TREE_OPERAND (t
, 1)),
13722 (TREE_NO_WARNING (TREE_OPERAND (t
, 1))
13724 : TREE_CODE (TREE_OPERAND (t
, 1))),
13726 complain
|decltype_flag
);
13727 if (EXPR_P (r
) && TREE_NO_WARNING (t
))
13728 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
13730 --c_inhibit_evaluation_warnings
;
13736 RETURN (tsubst_qualified_id (t
, args
, complain
, in_decl
, /*done=*/true,
13737 /*address_p=*/false));
13739 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
13740 args
, complain
, in_decl
);
13741 RETURN (build_x_array_ref (EXPR_LOCATION (t
), op1
,
13742 RECUR (TREE_OPERAND (t
, 1)),
13743 complain
|decltype_flag
));
13746 if (PACK_EXPANSION_P (TREE_OPERAND (t
, 0)))
13747 RETURN (tsubst_copy (t
, args
, complain
, in_decl
));
13754 op1
= TREE_OPERAND (t
, 0);
13755 if (TREE_CODE (t
) == SIZEOF_EXPR
&& SIZEOF_EXPR_TYPE_P (t
))
13756 op1
= TREE_TYPE (op1
);
13759 /* When there are no ARGS, we are trying to evaluate a
13760 non-dependent expression from the parser. Trying to do
13761 the substitutions may not work. */
13763 op1
= TREE_TYPE (op1
);
13767 ++cp_unevaluated_operand
;
13768 ++c_inhibit_evaluation_warnings
;
13770 op1
= tsubst (op1
, args
, complain
, in_decl
);
13772 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
13773 /*function_p=*/false,
13774 /*integral_constant_expression_p=*/
13776 --cp_unevaluated_operand
;
13777 --c_inhibit_evaluation_warnings
;
13780 r
= cxx_sizeof_or_alignof_type (op1
, TREE_CODE (t
),
13781 complain
& tf_error
);
13783 r
= cxx_sizeof_or_alignof_expr (op1
, TREE_CODE (t
),
13784 complain
& tf_error
);
13785 if (TREE_CODE (t
) == SIZEOF_EXPR
&& r
!= error_mark_node
)
13787 if (TREE_CODE (r
) != SIZEOF_EXPR
|| TYPE_P (op1
))
13789 if (!processing_template_decl
&& TYPE_P (op1
))
13791 r
= build_min (SIZEOF_EXPR
, size_type_node
,
13792 build1 (NOP_EXPR
, op1
, error_mark_node
));
13793 SIZEOF_EXPR_TYPE_P (r
) = 1;
13796 r
= build_min (SIZEOF_EXPR
, size_type_node
, op1
);
13797 TREE_SIDE_EFFECTS (r
) = 0;
13798 TREE_READONLY (r
) = 1;
13800 SET_EXPR_LOCATION (r
, EXPR_LOCATION (t
));
13805 case AT_ENCODE_EXPR
:
13807 op1
= TREE_OPERAND (t
, 0);
13808 ++cp_unevaluated_operand
;
13809 ++c_inhibit_evaluation_warnings
;
13810 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
13811 /*function_p=*/false,
13812 /*integral_constant_expression_p=*/false);
13813 --cp_unevaluated_operand
;
13814 --c_inhibit_evaluation_warnings
;
13815 RETURN (objc_build_encode_expr (op1
));
13818 case NOEXCEPT_EXPR
:
13819 op1
= TREE_OPERAND (t
, 0);
13820 ++cp_unevaluated_operand
;
13821 ++c_inhibit_evaluation_warnings
;
13822 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
13823 /*function_p=*/false,
13824 /*integral_constant_expression_p=*/false);
13825 --cp_unevaluated_operand
;
13826 --c_inhibit_evaluation_warnings
;
13827 RETURN (finish_noexcept_expr (op1
, complain
));
13833 ++c_inhibit_evaluation_warnings
;
13835 r
= build_x_modify_expr
13836 (EXPR_LOCATION (t
),
13837 RECUR (TREE_OPERAND (t
, 0)),
13838 TREE_CODE (TREE_OPERAND (t
, 1)),
13839 RECUR (TREE_OPERAND (t
, 2)),
13840 complain
|decltype_flag
);
13841 /* TREE_NO_WARNING must be set if either the expression was
13842 parenthesized or it uses an operator such as >>= rather
13843 than plain assignment. In the former case, it was already
13844 set and must be copied. In the latter case,
13845 build_x_modify_expr sets it and it must not be reset
13847 if (TREE_NO_WARNING (t
))
13848 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
13850 --c_inhibit_evaluation_warnings
;
13856 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
13857 args
, complain
, in_decl
);
13858 /* Remember that there was a reference to this entity. */
13861 RETURN (build_x_arrow (input_location
, op1
, complain
));
13865 tree placement
= RECUR (TREE_OPERAND (t
, 0));
13866 tree init
= RECUR (TREE_OPERAND (t
, 3));
13867 vec
<tree
, va_gc
> *placement_vec
;
13868 vec
<tree
, va_gc
> *init_vec
;
13871 if (placement
== NULL_TREE
)
13872 placement_vec
= NULL
;
13875 placement_vec
= make_tree_vector ();
13876 for (; placement
!= NULL_TREE
; placement
= TREE_CHAIN (placement
))
13877 vec_safe_push (placement_vec
, TREE_VALUE (placement
));
13880 /* If there was an initializer in the original tree, but it
13881 instantiated to an empty list, then we should pass a
13882 non-NULL empty vector to tell build_new that it was an
13883 empty initializer() rather than no initializer. This can
13884 only happen when the initializer is a pack expansion whose
13885 parameter packs are of length zero. */
13886 if (init
== NULL_TREE
&& TREE_OPERAND (t
, 3) == NULL_TREE
)
13890 init_vec
= make_tree_vector ();
13891 if (init
== void_zero_node
)
13892 gcc_assert (init_vec
!= NULL
);
13895 for (; init
!= NULL_TREE
; init
= TREE_CHAIN (init
))
13896 vec_safe_push (init_vec
, TREE_VALUE (init
));
13900 ret
= build_new (&placement_vec
,
13901 tsubst (TREE_OPERAND (t
, 1), args
, complain
, in_decl
),
13902 RECUR (TREE_OPERAND (t
, 2)),
13904 NEW_EXPR_USE_GLOBAL (t
),
13907 if (placement_vec
!= NULL
)
13908 release_tree_vector (placement_vec
);
13909 if (init_vec
!= NULL
)
13910 release_tree_vector (init_vec
);
13916 RETURN (delete_sanity
13917 (RECUR (TREE_OPERAND (t
, 0)),
13918 RECUR (TREE_OPERAND (t
, 1)),
13919 DELETE_EXPR_USE_VEC (t
),
13920 DELETE_EXPR_USE_GLOBAL (t
),
13923 case COMPOUND_EXPR
:
13925 tree op0
= tsubst_copy_and_build (TREE_OPERAND (t
, 0), args
,
13926 complain
& ~tf_decltype
, in_decl
,
13927 /*function_p=*/false,
13928 integral_constant_expression_p
);
13929 RETURN (build_x_compound_expr (EXPR_LOCATION (t
),
13931 RECUR (TREE_OPERAND (t
, 1)),
13932 complain
|decltype_flag
));
13938 vec
<tree
, va_gc
> *call_args
;
13939 unsigned int nargs
, i
;
13944 function
= CALL_EXPR_FN (t
);
13945 /* When we parsed the expression, we determined whether or
13946 not Koenig lookup should be performed. */
13947 koenig_p
= KOENIG_LOOKUP_P (t
);
13948 if (TREE_CODE (function
) == SCOPE_REF
)
13950 qualified_p
= true;
13951 function
= tsubst_qualified_id (function
, args
, complain
, in_decl
,
13953 /*address_p=*/false);
13955 else if (koenig_p
&& identifier_p (function
))
13957 /* Do nothing; calling tsubst_copy_and_build on an identifier
13958 would incorrectly perform unqualified lookup again.
13960 Note that we can also have an IDENTIFIER_NODE if the earlier
13961 unqualified lookup found a member function; in that case
13962 koenig_p will be false and we do want to do the lookup
13963 again to find the instantiated member function.
13965 FIXME but doing that causes c++/15272, so we need to stop
13966 using IDENTIFIER_NODE in that situation. */
13967 qualified_p
= false;
13971 if (TREE_CODE (function
) == COMPONENT_REF
)
13973 tree op
= TREE_OPERAND (function
, 1);
13975 qualified_p
= (TREE_CODE (op
) == SCOPE_REF
13976 || (BASELINK_P (op
)
13977 && BASELINK_QUALIFIED_P (op
)));
13980 qualified_p
= false;
13982 if (TREE_CODE (function
) == ADDR_EXPR
13983 && TREE_CODE (TREE_OPERAND (function
, 0)) == FUNCTION_DECL
)
13984 /* Avoid error about taking the address of a constructor. */
13985 function
= TREE_OPERAND (function
, 0);
13987 function
= tsubst_copy_and_build (function
, args
, complain
,
13990 integral_constant_expression_p
);
13992 if (BASELINK_P (function
))
13993 qualified_p
= true;
13996 nargs
= call_expr_nargs (t
);
13997 call_args
= make_tree_vector ();
13998 for (i
= 0; i
< nargs
; ++i
)
14000 tree arg
= CALL_EXPR_ARG (t
, i
);
14002 if (!PACK_EXPANSION_P (arg
))
14003 vec_safe_push (call_args
, RECUR (CALL_EXPR_ARG (t
, i
)));
14006 /* Expand the pack expansion and push each entry onto
14008 arg
= tsubst_pack_expansion (arg
, args
, complain
, in_decl
);
14009 if (TREE_CODE (arg
) == TREE_VEC
)
14011 unsigned int len
, j
;
14013 len
= TREE_VEC_LENGTH (arg
);
14014 for (j
= 0; j
< len
; ++j
)
14016 tree value
= TREE_VEC_ELT (arg
, j
);
14017 if (value
!= NULL_TREE
)
14018 value
= convert_from_reference (value
);
14019 vec_safe_push (call_args
, value
);
14024 /* A partial substitution. Add one entry. */
14025 vec_safe_push (call_args
, arg
);
14030 /* We do not perform argument-dependent lookup if normal
14031 lookup finds a non-function, in accordance with the
14032 expected resolution of DR 218. */
14034 && ((is_overloaded_fn (function
)
14035 /* If lookup found a member function, the Koenig lookup is
14036 not appropriate, even if an unqualified-name was used
14037 to denote the function. */
14038 && !DECL_FUNCTION_MEMBER_P (get_first_fn (function
)))
14039 || identifier_p (function
))
14040 /* Only do this when substitution turns a dependent call
14041 into a non-dependent call. */
14042 && type_dependent_expression_p_push (t
)
14043 && !any_type_dependent_arguments_p (call_args
))
14044 function
= perform_koenig_lookup (function
, call_args
, false,
14047 if (identifier_p (function
)
14048 && !any_type_dependent_arguments_p (call_args
))
14050 if (koenig_p
&& (complain
& tf_warning_or_error
))
14052 /* For backwards compatibility and good diagnostics, try
14053 the unqualified lookup again if we aren't in SFINAE
14055 tree unq
= (tsubst_copy_and_build
14056 (function
, args
, complain
, in_decl
, true,
14057 integral_constant_expression_p
));
14058 if (unq
== error_mark_node
)
14059 RETURN (error_mark_node
);
14061 if (unq
!= function
)
14064 if (INDIRECT_REF_P (fn
))
14065 fn
= TREE_OPERAND (fn
, 0);
14066 if (TREE_CODE (fn
) == COMPONENT_REF
)
14067 fn
= TREE_OPERAND (fn
, 1);
14068 if (is_overloaded_fn (fn
))
14069 fn
= get_first_fn (fn
);
14070 if (permerror (EXPR_LOC_OR_HERE (t
),
14071 "%qD was not declared in this scope, "
14072 "and no declarations were found by "
14073 "argument-dependent lookup at the point "
14074 "of instantiation", function
))
14077 /* Can't say anything more. */;
14078 else if (DECL_CLASS_SCOPE_P (fn
))
14080 inform (EXPR_LOC_OR_HERE (t
),
14081 "declarations in dependent base %qT are "
14082 "not found by unqualified lookup",
14083 DECL_CLASS_CONTEXT (fn
));
14084 if (current_class_ptr
)
14085 inform (EXPR_LOC_OR_HERE (t
),
14086 "use %<this->%D%> instead", function
);
14088 inform (EXPR_LOC_OR_HERE (t
),
14089 "use %<%T::%D%> instead",
14090 current_class_name
, function
);
14093 inform (0, "%q+D declared here, later in the "
14094 "translation unit", fn
);
14099 if (identifier_p (function
))
14101 if (complain
& tf_error
)
14102 unqualified_name_lookup_error (function
);
14103 release_tree_vector (call_args
);
14104 RETURN (error_mark_node
);
14108 /* Remember that there was a reference to this entity. */
14109 if (DECL_P (function
))
14110 mark_used (function
);
14112 /* Put back tf_decltype for the actual call. */
14113 complain
|= decltype_flag
;
14115 if (TREE_CODE (function
) == OFFSET_REF
)
14116 ret
= build_offset_ref_call_from_tree (function
, &call_args
,
14118 else if (TREE_CODE (function
) == COMPONENT_REF
)
14120 tree instance
= TREE_OPERAND (function
, 0);
14121 tree fn
= TREE_OPERAND (function
, 1);
14123 if (processing_template_decl
14124 && (type_dependent_expression_p (instance
)
14125 || (!BASELINK_P (fn
)
14126 && TREE_CODE (fn
) != FIELD_DECL
)
14127 || type_dependent_expression_p (fn
)
14128 || any_type_dependent_arguments_p (call_args
)))
14129 ret
= build_nt_call_vec (function
, call_args
);
14130 else if (!BASELINK_P (fn
))
14131 ret
= finish_call_expr (function
, &call_args
,
14132 /*disallow_virtual=*/false,
14133 /*koenig_p=*/false,
14136 ret
= (build_new_method_call
14138 &call_args
, NULL_TREE
,
14139 qualified_p
? LOOKUP_NONVIRTUAL
: LOOKUP_NORMAL
,
14144 ret
= finish_call_expr (function
, &call_args
,
14145 /*disallow_virtual=*/qualified_p
,
14149 release_tree_vector (call_args
);
14156 tree cond
= RECUR (TREE_OPERAND (t
, 0));
14159 if (TREE_CODE (cond
) == INTEGER_CST
)
14161 if (integer_zerop (cond
))
14163 ++c_inhibit_evaluation_warnings
;
14164 exp1
= RECUR (TREE_OPERAND (t
, 1));
14165 --c_inhibit_evaluation_warnings
;
14166 exp2
= RECUR (TREE_OPERAND (t
, 2));
14170 exp1
= RECUR (TREE_OPERAND (t
, 1));
14171 ++c_inhibit_evaluation_warnings
;
14172 exp2
= RECUR (TREE_OPERAND (t
, 2));
14173 --c_inhibit_evaluation_warnings
;
14178 exp1
= RECUR (TREE_OPERAND (t
, 1));
14179 exp2
= RECUR (TREE_OPERAND (t
, 2));
14182 RETURN (build_x_conditional_expr (EXPR_LOCATION (t
),
14183 cond
, exp1
, exp2
, complain
));
14186 case PSEUDO_DTOR_EXPR
:
14187 RETURN (finish_pseudo_destructor_expr
14188 (RECUR (TREE_OPERAND (t
, 0)),
14189 RECUR (TREE_OPERAND (t
, 1)),
14190 tsubst (TREE_OPERAND (t
, 2), args
, complain
, in_decl
)));
14194 tree purpose
, value
, chain
;
14196 if (t
== void_list_node
)
14199 if ((TREE_PURPOSE (t
) && PACK_EXPANSION_P (TREE_PURPOSE (t
)))
14200 || (TREE_VALUE (t
) && PACK_EXPANSION_P (TREE_VALUE (t
))))
14202 /* We have pack expansions, so expand those and
14203 create a new list out of it. */
14204 tree purposevec
= NULL_TREE
;
14205 tree valuevec
= NULL_TREE
;
14209 /* Expand the argument expressions. */
14210 if (TREE_PURPOSE (t
))
14211 purposevec
= tsubst_pack_expansion (TREE_PURPOSE (t
), args
,
14212 complain
, in_decl
);
14213 if (TREE_VALUE (t
))
14214 valuevec
= tsubst_pack_expansion (TREE_VALUE (t
), args
,
14215 complain
, in_decl
);
14217 /* Build the rest of the list. */
14218 chain
= TREE_CHAIN (t
);
14219 if (chain
&& chain
!= void_type_node
)
14220 chain
= RECUR (chain
);
14222 /* Determine the number of arguments. */
14223 if (purposevec
&& TREE_CODE (purposevec
) == TREE_VEC
)
14225 len
= TREE_VEC_LENGTH (purposevec
);
14226 gcc_assert (!valuevec
|| len
== TREE_VEC_LENGTH (valuevec
));
14228 else if (TREE_CODE (valuevec
) == TREE_VEC
)
14229 len
= TREE_VEC_LENGTH (valuevec
);
14232 /* Since we only performed a partial substitution into
14233 the argument pack, we only RETURN (a single list
14235 if (purposevec
== TREE_PURPOSE (t
)
14236 && valuevec
== TREE_VALUE (t
)
14237 && chain
== TREE_CHAIN (t
))
14240 RETURN (tree_cons (purposevec
, valuevec
, chain
));
14243 /* Convert the argument vectors into a TREE_LIST */
14247 /* Grab the Ith values. */
14249 purpose
= purposevec
? TREE_VEC_ELT (purposevec
, i
)
14252 = valuevec
? convert_from_reference (TREE_VEC_ELT (valuevec
, i
))
14255 /* Build the list (backwards). */
14256 chain
= tree_cons (purpose
, value
, chain
);
14262 purpose
= TREE_PURPOSE (t
);
14264 purpose
= RECUR (purpose
);
14265 value
= TREE_VALUE (t
);
14267 value
= RECUR (value
);
14268 chain
= TREE_CHAIN (t
);
14269 if (chain
&& chain
!= void_type_node
)
14270 chain
= RECUR (chain
);
14271 if (purpose
== TREE_PURPOSE (t
)
14272 && value
== TREE_VALUE (t
)
14273 && chain
== TREE_CHAIN (t
))
14275 RETURN (tree_cons (purpose
, value
, chain
));
14278 case COMPONENT_REF
:
14284 object
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
14285 args
, complain
, in_decl
);
14286 /* Remember that there was a reference to this entity. */
14287 if (DECL_P (object
))
14288 mark_used (object
);
14289 object_type
= TREE_TYPE (object
);
14291 member
= TREE_OPERAND (t
, 1);
14292 if (BASELINK_P (member
))
14293 member
= tsubst_baselink (member
,
14294 non_reference (TREE_TYPE (object
)),
14295 args
, complain
, in_decl
);
14297 member
= tsubst_copy (member
, args
, complain
, in_decl
);
14298 if (member
== error_mark_node
)
14299 RETURN (error_mark_node
);
14301 if (type_dependent_expression_p (object
))
14302 /* We can't do much here. */;
14303 else if (!CLASS_TYPE_P (object_type
))
14305 if (scalarish_type_p (object_type
))
14307 tree s
= NULL_TREE
;
14308 tree dtor
= member
;
14310 if (TREE_CODE (dtor
) == SCOPE_REF
)
14312 s
= TREE_OPERAND (dtor
, 0);
14313 dtor
= TREE_OPERAND (dtor
, 1);
14315 if (TREE_CODE (dtor
) == BIT_NOT_EXPR
)
14317 dtor
= TREE_OPERAND (dtor
, 0);
14319 RETURN (finish_pseudo_destructor_expr (object
, s
, dtor
));
14323 else if (TREE_CODE (member
) == SCOPE_REF
14324 && TREE_CODE (TREE_OPERAND (member
, 1)) == TEMPLATE_ID_EXPR
)
14326 /* Lookup the template functions now that we know what the
14328 tree scope
= TREE_OPERAND (member
, 0);
14329 tree tmpl
= TREE_OPERAND (TREE_OPERAND (member
, 1), 0);
14330 tree args
= TREE_OPERAND (TREE_OPERAND (member
, 1), 1);
14331 member
= lookup_qualified_name (scope
, tmpl
,
14332 /*is_type_p=*/false,
14333 /*complain=*/false);
14334 if (BASELINK_P (member
))
14336 BASELINK_FUNCTIONS (member
)
14337 = build_nt (TEMPLATE_ID_EXPR
, BASELINK_FUNCTIONS (member
),
14339 member
= (adjust_result_of_qualified_name_lookup
14340 (member
, BINFO_TYPE (BASELINK_BINFO (member
)),
14345 qualified_name_lookup_error (scope
, tmpl
, member
,
14347 RETURN (error_mark_node
);
14350 else if (TREE_CODE (member
) == SCOPE_REF
14351 && !CLASS_TYPE_P (TREE_OPERAND (member
, 0))
14352 && TREE_CODE (TREE_OPERAND (member
, 0)) != NAMESPACE_DECL
)
14354 if (complain
& tf_error
)
14356 if (TYPE_P (TREE_OPERAND (member
, 0)))
14357 error ("%qT is not a class or namespace",
14358 TREE_OPERAND (member
, 0));
14360 error ("%qD is not a class or namespace",
14361 TREE_OPERAND (member
, 0));
14363 RETURN (error_mark_node
);
14365 else if (TREE_CODE (member
) == FIELD_DECL
)
14366 RETURN (finish_non_static_data_member (member
, object
, NULL_TREE
));
14368 RETURN (finish_class_member_access_expr (object
, member
,
14369 /*template_p=*/false,
14374 RETURN (build_throw
14375 (RECUR (TREE_OPERAND (t
, 0))));
14379 vec
<constructor_elt
, va_gc
> *n
;
14380 constructor_elt
*ce
;
14381 unsigned HOST_WIDE_INT idx
;
14382 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14383 bool process_index_p
;
14385 bool need_copy_p
= false;
14388 if (type
== error_mark_node
)
14389 RETURN (error_mark_node
);
14391 /* digest_init will do the wrong thing if we let it. */
14392 if (type
&& TYPE_PTRMEMFUNC_P (type
))
14395 /* We do not want to process the index of aggregate
14396 initializers as they are identifier nodes which will be
14397 looked up by digest_init. */
14398 process_index_p
= !(type
&& MAYBE_CLASS_TYPE_P (type
));
14400 n
= vec_safe_copy (CONSTRUCTOR_ELTS (t
));
14401 newlen
= vec_safe_length (n
);
14402 FOR_EACH_VEC_SAFE_ELT (n
, idx
, ce
)
14404 if (ce
->index
&& process_index_p
)
14405 ce
->index
= RECUR (ce
->index
);
14407 if (PACK_EXPANSION_P (ce
->value
))
14409 /* Substitute into the pack expansion. */
14410 ce
->value
= tsubst_pack_expansion (ce
->value
, args
, complain
,
14413 if (ce
->value
== error_mark_node
14414 || PACK_EXPANSION_P (ce
->value
))
14416 else if (TREE_VEC_LENGTH (ce
->value
) == 1)
14417 /* Just move the argument into place. */
14418 ce
->value
= TREE_VEC_ELT (ce
->value
, 0);
14421 /* Update the length of the final CONSTRUCTOR
14422 arguments vector, and note that we will need to
14424 newlen
= newlen
+ TREE_VEC_LENGTH (ce
->value
) - 1;
14425 need_copy_p
= true;
14429 ce
->value
= RECUR (ce
->value
);
14434 vec
<constructor_elt
, va_gc
> *old_n
= n
;
14436 vec_alloc (n
, newlen
);
14437 FOR_EACH_VEC_ELT (*old_n
, idx
, ce
)
14439 if (TREE_CODE (ce
->value
) == TREE_VEC
)
14441 int i
, len
= TREE_VEC_LENGTH (ce
->value
);
14442 for (i
= 0; i
< len
; ++i
)
14443 CONSTRUCTOR_APPEND_ELT (n
, 0,
14444 TREE_VEC_ELT (ce
->value
, i
));
14447 CONSTRUCTOR_APPEND_ELT (n
, 0, ce
->value
);
14451 r
= build_constructor (init_list_type_node
, n
);
14452 CONSTRUCTOR_IS_DIRECT_INIT (r
) = CONSTRUCTOR_IS_DIRECT_INIT (t
);
14454 if (TREE_HAS_CONSTRUCTOR (t
))
14455 RETURN (finish_compound_literal (type
, r
, complain
));
14457 TREE_TYPE (r
) = type
;
14463 tree operand_0
= TREE_OPERAND (t
, 0);
14464 if (TYPE_P (operand_0
))
14466 operand_0
= tsubst (operand_0
, args
, complain
, in_decl
);
14467 RETURN (get_typeid (operand_0
, complain
));
14471 operand_0
= RECUR (operand_0
);
14472 RETURN (build_typeid (operand_0
, complain
));
14483 tree r
= tsubst_copy (t
, args
, complain
, in_decl
);
14485 if (TREE_CODE (TREE_TYPE (t
)) != REFERENCE_TYPE
)
14486 /* If the original type was a reference, we'll be wrapped in
14487 the appropriate INDIRECT_REF. */
14488 r
= convert_from_reference (r
);
14493 RETURN (build_x_va_arg (EXPR_LOCATION (t
),
14494 RECUR (TREE_OPERAND (t
, 0)),
14495 tsubst (TREE_TYPE (t
), args
, complain
, in_decl
)));
14497 case OFFSETOF_EXPR
:
14498 RETURN (finish_offsetof (RECUR (TREE_OPERAND (t
, 0))));
14502 tree type1
= tsubst_copy (TRAIT_EXPR_TYPE1 (t
), args
,
14503 complain
, in_decl
);
14505 tree type2
= TRAIT_EXPR_TYPE2 (t
);
14507 type2
= tsubst_copy (type2
, args
, complain
, in_decl
);
14509 RETURN (finish_trait_expr (TRAIT_EXPR_KIND (t
), type1
, type2
));
14514 tree old_stmt_expr
= cur_stmt_expr
;
14515 tree stmt_expr
= begin_stmt_expr ();
14517 cur_stmt_expr
= stmt_expr
;
14518 tsubst_expr (STMT_EXPR_STMT (t
), args
, complain
, in_decl
,
14519 integral_constant_expression_p
);
14520 stmt_expr
= finish_stmt_expr (stmt_expr
, false);
14521 cur_stmt_expr
= old_stmt_expr
;
14523 /* If the resulting list of expression statement is empty,
14524 fold it further into void_zero_node. */
14525 if (empty_expr_stmt_p (stmt_expr
))
14526 stmt_expr
= void_zero_node
;
14528 RETURN (stmt_expr
);
14533 tree r
= build_lambda_expr ();
14535 tree type
= tsubst (LAMBDA_EXPR_CLOSURE (t
), args
, complain
, NULL_TREE
);
14536 LAMBDA_EXPR_CLOSURE (r
) = type
;
14537 CLASSTYPE_LAMBDA_EXPR (type
) = r
;
14539 LAMBDA_EXPR_LOCATION (r
)
14540 = LAMBDA_EXPR_LOCATION (t
);
14541 LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (r
)
14542 = LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (t
);
14543 LAMBDA_EXPR_MUTABLE_P (r
) = LAMBDA_EXPR_MUTABLE_P (t
);
14544 LAMBDA_EXPR_DISCRIMINATOR (r
)
14545 = (LAMBDA_EXPR_DISCRIMINATOR (t
));
14546 /* For a function scope, we want to use tsubst so that we don't
14547 complain about referring to an auto function before its return
14548 type has been deduced. Otherwise, we want to use tsubst_copy so
14549 that we look up the existing field/parameter/variable rather
14550 than build a new one. */
14551 tree scope
= LAMBDA_EXPR_EXTRA_SCOPE (t
);
14552 if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
)
14553 scope
= tsubst (scope
, args
, complain
, in_decl
);
14554 else if (scope
&& TREE_CODE (scope
) == PARM_DECL
)
14556 /* Look up the parameter we want directly, as tsubst_copy
14557 doesn't do what we need. */
14558 tree fn
= tsubst (DECL_CONTEXT (scope
), args
, complain
, in_decl
);
14559 tree parm
= FUNCTION_FIRST_USER_PARM (fn
);
14560 while (DECL_PARM_INDEX (parm
) != DECL_PARM_INDEX (scope
))
14561 parm
= DECL_CHAIN (parm
);
14563 /* FIXME Work around the parm not having DECL_CONTEXT set. */
14564 if (DECL_CONTEXT (scope
) == NULL_TREE
)
14565 DECL_CONTEXT (scope
) = fn
;
14568 scope
= RECUR (scope
);
14569 LAMBDA_EXPR_EXTRA_SCOPE (r
) = scope
;
14570 LAMBDA_EXPR_RETURN_TYPE (r
)
14571 = tsubst (LAMBDA_EXPR_RETURN_TYPE (t
), args
, complain
, in_decl
);
14573 gcc_assert (LAMBDA_EXPR_THIS_CAPTURE (t
) == NULL_TREE
14574 && LAMBDA_EXPR_PENDING_PROXIES (t
) == NULL
);
14576 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
14577 determine_visibility (TYPE_NAME (type
));
14578 /* Now that we know visibility, instantiate the type so we have a
14579 declaration of the op() for later calls to lambda_function. */
14580 complete_type (type
);
14582 LAMBDA_EXPR_THIS_CAPTURE (r
) = NULL_TREE
;
14584 RETURN (build_lambda_object (r
));
14588 /* We can get here for a constant initializer of non-dependent type.
14589 FIXME stop folding in cp_parser_initializer_clause. */
14591 tree r
= get_target_expr_sfinae (RECUR (TARGET_EXPR_INITIAL (t
)),
14596 case TRANSACTION_EXPR
:
14597 RETURN (tsubst_expr(t
, args
, complain
, in_decl
,
14598 integral_constant_expression_p
));
14601 RETURN (finish_parenthesized_expr (RECUR (TREE_OPERAND (t
, 0))));
14604 /* Handle Objective-C++ constructs, if appropriate. */
14607 = objcp_tsubst_copy_and_build (t
, args
, complain
,
14608 in_decl
, /*function_p=*/false);
14612 RETURN (tsubst_copy (t
, args
, complain
, in_decl
));
14618 input_location
= loc
;
14622 /* Verify that the instantiated ARGS are valid. For type arguments,
14623 make sure that the type's linkage is ok. For non-type arguments,
14624 make sure they are constants if they are integral or enumerations.
14625 Emit an error under control of COMPLAIN, and return TRUE on error. */
14628 check_instantiated_arg (tree tmpl
, tree t
, tsubst_flags_t complain
)
14630 if (dependent_template_arg_p (t
))
14632 if (ARGUMENT_PACK_P (t
))
14634 tree vec
= ARGUMENT_PACK_ARGS (t
);
14635 int len
= TREE_VEC_LENGTH (vec
);
14636 bool result
= false;
14639 for (i
= 0; i
< len
; ++i
)
14640 if (check_instantiated_arg (tmpl
, TREE_VEC_ELT (vec
, i
), complain
))
14644 else if (TYPE_P (t
))
14646 /* [basic.link]: A name with no linkage (notably, the name
14647 of a class or enumeration declared in a local scope)
14648 shall not be used to declare an entity with linkage.
14649 This implies that names with no linkage cannot be used as
14652 DR 757 relaxes this restriction for C++0x. */
14653 tree nt
= (cxx_dialect
> cxx98
? NULL_TREE
14654 : no_linkage_check (t
, /*relaxed_p=*/false));
14658 /* DR 488 makes use of a type with no linkage cause
14659 type deduction to fail. */
14660 if (complain
& tf_error
)
14662 if (TYPE_ANONYMOUS_P (nt
))
14663 error ("%qT is/uses anonymous type", t
);
14665 error ("template argument for %qD uses local type %qT",
14670 /* In order to avoid all sorts of complications, we do not
14671 allow variably-modified types as template arguments. */
14672 else if (variably_modified_type_p (t
, NULL_TREE
))
14674 if (complain
& tf_error
)
14675 error ("%qT is a variably modified type", t
);
14679 /* Class template and alias template arguments should be OK. */
14680 else if (DECL_TYPE_TEMPLATE_P (t
))
14682 /* A non-type argument of integral or enumerated type must be a
14684 else if (TREE_TYPE (t
)
14685 && INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (t
))
14686 && !TREE_CONSTANT (t
))
14688 if (complain
& tf_error
)
14689 error ("integral expression %qE is not constant", t
);
14696 check_instantiated_args (tree tmpl
, tree args
, tsubst_flags_t complain
)
14698 int ix
, len
= DECL_NTPARMS (tmpl
);
14699 bool result
= false;
14701 for (ix
= 0; ix
!= len
; ix
++)
14703 if (check_instantiated_arg (tmpl
, TREE_VEC_ELT (args
, ix
), complain
))
14706 if (result
&& (complain
& tf_error
))
14707 error (" trying to instantiate %qD", tmpl
);
14711 /* We're out of SFINAE context now, so generate diagnostics for the access
14712 errors we saw earlier when instantiating D from TMPL and ARGS. */
14715 recheck_decl_substitution (tree d
, tree tmpl
, tree args
)
14717 tree pattern
= DECL_TEMPLATE_RESULT (tmpl
);
14718 tree type
= TREE_TYPE (pattern
);
14719 location_t loc
= input_location
;
14721 push_access_scope (d
);
14722 push_deferring_access_checks (dk_no_deferred
);
14723 input_location
= DECL_SOURCE_LOCATION (pattern
);
14724 tsubst (type
, args
, tf_warning_or_error
, d
);
14725 input_location
= loc
;
14726 pop_deferring_access_checks ();
14727 pop_access_scope (d
);
14730 /* Instantiate the indicated variable, function, or alias template TMPL with
14731 the template arguments in TARG_PTR. */
14734 instantiate_template_1 (tree tmpl
, tree orig_args
, tsubst_flags_t complain
)
14736 tree targ_ptr
= orig_args
;
14740 bool access_ok
= true;
14742 if (tmpl
== error_mark_node
)
14743 return error_mark_node
;
14745 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
);
14747 /* If this function is a clone, handle it specially. */
14748 if (DECL_CLONED_FUNCTION_P (tmpl
))
14753 /* Use DECL_ABSTRACT_ORIGIN because only FUNCTION_DECLs have
14754 DECL_CLONED_FUNCTION. */
14755 spec
= instantiate_template (DECL_ABSTRACT_ORIGIN (tmpl
),
14756 targ_ptr
, complain
);
14757 if (spec
== error_mark_node
)
14758 return error_mark_node
;
14760 /* Look for the clone. */
14761 FOR_EACH_CLONE (clone
, spec
)
14762 if (DECL_NAME (clone
) == DECL_NAME (tmpl
))
14764 /* We should always have found the clone by now. */
14765 gcc_unreachable ();
14769 /* Check to see if we already have this specialization. */
14770 gen_tmpl
= most_general_template (tmpl
);
14771 if (tmpl
!= gen_tmpl
)
14772 /* The TMPL is a partial instantiation. To get a full set of
14773 arguments we must add the arguments used to perform the
14774 partial instantiation. */
14775 targ_ptr
= add_outermost_template_args (DECL_TI_ARGS (tmpl
),
14778 /* It would be nice to avoid hashing here and then again in tsubst_decl,
14779 but it doesn't seem to be on the hot path. */
14780 spec
= retrieve_specialization (gen_tmpl
, targ_ptr
, 0);
14782 gcc_assert (tmpl
== gen_tmpl
14783 || ((fndecl
= retrieve_specialization (tmpl
, orig_args
, 0))
14785 || fndecl
== NULL_TREE
);
14787 if (spec
!= NULL_TREE
)
14789 if (FNDECL_HAS_ACCESS_ERRORS (spec
))
14791 if (complain
& tf_error
)
14792 recheck_decl_substitution (spec
, gen_tmpl
, targ_ptr
);
14793 return error_mark_node
;
14798 if (check_instantiated_args (gen_tmpl
, INNERMOST_TEMPLATE_ARGS (targ_ptr
),
14800 return error_mark_node
;
14802 /* We are building a FUNCTION_DECL, during which the access of its
14803 parameters and return types have to be checked. However this
14804 FUNCTION_DECL which is the desired context for access checking
14805 is not built yet. We solve this chicken-and-egg problem by
14806 deferring all checks until we have the FUNCTION_DECL. */
14807 push_deferring_access_checks (dk_deferred
);
14809 /* Instantiation of the function happens in the context of the function
14810 template, not the context of the overload resolution we're doing. */
14811 push_to_top_level ();
14812 /* If there are dependent arguments, e.g. because we're doing partial
14813 ordering, make sure processing_template_decl stays set. */
14814 if (uses_template_parms (targ_ptr
))
14815 ++processing_template_decl
;
14816 if (DECL_CLASS_SCOPE_P (gen_tmpl
))
14818 tree ctx
= tsubst (DECL_CONTEXT (gen_tmpl
), targ_ptr
,
14819 complain
, gen_tmpl
);
14820 push_nested_class (ctx
);
14822 /* Substitute template parameters to obtain the specialization. */
14823 fndecl
= tsubst (DECL_TEMPLATE_RESULT (gen_tmpl
),
14824 targ_ptr
, complain
, gen_tmpl
);
14825 if (DECL_CLASS_SCOPE_P (gen_tmpl
))
14826 pop_nested_class ();
14827 pop_from_top_level ();
14829 if (fndecl
== error_mark_node
)
14831 pop_deferring_access_checks ();
14832 return error_mark_node
;
14835 /* The DECL_TI_TEMPLATE should always be the immediate parent
14836 template, not the most general template. */
14837 DECL_TI_TEMPLATE (fndecl
) = tmpl
;
14839 /* Now we know the specialization, compute access previously
14841 push_access_scope (fndecl
);
14842 if (!perform_deferred_access_checks (complain
))
14844 pop_access_scope (fndecl
);
14845 pop_deferring_access_checks ();
14847 /* If we've just instantiated the main entry point for a function,
14848 instantiate all the alternate entry points as well. We do this
14849 by cloning the instantiation of the main entry point, not by
14850 instantiating the template clones. */
14851 if (DECL_CHAIN (gen_tmpl
) && DECL_CLONED_FUNCTION_P (DECL_CHAIN (gen_tmpl
)))
14852 clone_function_decl (fndecl
, /*update_method_vec_p=*/0);
14856 if (!(complain
& tf_error
))
14858 /* Remember to reinstantiate when we're out of SFINAE so the user
14859 can see the errors. */
14860 FNDECL_HAS_ACCESS_ERRORS (fndecl
) = true;
14862 return error_mark_node
;
14867 /* Wrapper for instantiate_template_1. */
14870 instantiate_template (tree tmpl
, tree orig_args
, tsubst_flags_t complain
)
14873 timevar_push (TV_TEMPLATE_INST
);
14874 ret
= instantiate_template_1 (tmpl
, orig_args
, complain
);
14875 timevar_pop (TV_TEMPLATE_INST
);
14879 /* Instantiate the alias template TMPL with ARGS. Also push a template
14880 instantiation level, which instantiate_template doesn't do because
14881 functions and variables have sufficient context established by the
14885 instantiate_alias_template (tree tmpl
, tree args
, tsubst_flags_t complain
)
14887 struct pending_template
*old_last_pend
= last_pending_template
;
14888 struct tinst_level
*old_error_tinst
= last_error_tinst_level
;
14889 if (tmpl
== error_mark_node
|| args
== error_mark_node
)
14890 return error_mark_node
;
14891 tree tinst
= build_tree_list (tmpl
, args
);
14892 if (!push_tinst_level (tinst
))
14895 return error_mark_node
;
14899 coerce_innermost_template_parms (DECL_TEMPLATE_PARMS (tmpl
),
14900 args
, tmpl
, complain
,
14901 /*require_all_args=*/true,
14902 /*use_default_args=*/true);
14904 tree r
= instantiate_template (tmpl
, args
, complain
);
14905 pop_tinst_level ();
14906 /* We can't free this if a pending_template entry or last_error_tinst_level
14907 is pointing at it. */
14908 if (last_pending_template
== old_last_pend
14909 && last_error_tinst_level
== old_error_tinst
)
14915 /* PARM is a template parameter pack for FN. Returns true iff
14916 PARM is used in a deducible way in the argument list of FN. */
14919 pack_deducible_p (tree parm
, tree fn
)
14921 tree t
= FUNCTION_FIRST_USER_PARMTYPE (fn
);
14922 for (; t
; t
= TREE_CHAIN (t
))
14924 tree type
= TREE_VALUE (t
);
14926 if (!PACK_EXPANSION_P (type
))
14928 for (packs
= PACK_EXPANSION_PARAMETER_PACKS (type
);
14929 packs
; packs
= TREE_CHAIN (packs
))
14930 if (TREE_VALUE (packs
) == parm
)
14932 /* The template parameter pack is used in a function parameter
14933 pack. If this is the end of the parameter list, the
14934 template parameter pack is deducible. */
14935 if (TREE_CHAIN (t
) == void_list_node
)
14938 /* Otherwise, not. Well, it could be deduced from
14939 a non-pack parameter, but doing so would end up with
14940 a deduction mismatch, so don't bother. */
14944 /* The template parameter pack isn't used in any function parameter
14945 packs, but it might be used deeper, e.g. tuple<Args...>. */
14949 /* The FN is a TEMPLATE_DECL for a function. ARGS is an array with
14950 NARGS elements of the arguments that are being used when calling
14951 it. TARGS is a vector into which the deduced template arguments
14954 Return zero for success, 2 for an incomplete match that doesn't resolve
14955 all the types, and 1 for complete failure. An error message will be
14956 printed only for an incomplete match.
14958 If FN is a conversion operator, or we are trying to produce a specific
14959 specialization, RETURN_TYPE is the return type desired.
14961 The EXPLICIT_TARGS are explicit template arguments provided via a
14964 The parameter STRICT is one of:
14967 We are deducing arguments for a function call, as in
14968 [temp.deduct.call].
14971 We are deducing arguments for a conversion function, as in
14972 [temp.deduct.conv].
14975 We are deducing arguments when doing an explicit instantiation
14976 as in [temp.explicit], when determining an explicit specialization
14977 as in [temp.expl.spec], or when taking the address of a function
14978 template, as in [temp.deduct.funcaddr]. */
14981 fn_type_unification (tree fn
,
14982 tree explicit_targs
,
14985 unsigned int nargs
,
14987 unification_kind_t strict
,
14994 tree decl
= NULL_TREE
;
14995 tsubst_flags_t complain
= (explain_p
? tf_warning_or_error
: tf_none
);
14997 static int deduction_depth
;
14998 struct pending_template
*old_last_pend
= last_pending_template
;
14999 struct tinst_level
*old_error_tinst
= last_error_tinst_level
;
15000 tree tparms
= DECL_INNERMOST_TEMPLATE_PARMS (fn
);
15002 tree r
= error_mark_node
;
15005 complain
|= tf_decltype
;
15007 /* In C++0x, it's possible to have a function template whose type depends
15008 on itself recursively. This is most obvious with decltype, but can also
15009 occur with enumeration scope (c++/48969). So we need to catch infinite
15010 recursion and reject the substitution at deduction time; this function
15011 will return error_mark_node for any repeated substitution.
15013 This also catches excessive recursion such as when f<N> depends on
15014 f<N-1> across all integers, and returns error_mark_node for all the
15015 substitutions back up to the initial one.
15017 This is, of course, not reentrant. */
15018 if (excessive_deduction_depth
)
15019 return error_mark_node
;
15020 tinst
= build_tree_list (fn
, NULL_TREE
);
15022 push_deferring_access_checks (dk_deferred
);
15024 gcc_assert (TREE_CODE (fn
) == TEMPLATE_DECL
);
15026 fntype
= TREE_TYPE (fn
);
15027 if (explicit_targs
)
15031 The specified template arguments must match the template
15032 parameters in kind (i.e., type, nontype, template), and there
15033 must not be more arguments than there are parameters;
15034 otherwise type deduction fails.
15036 Nontype arguments must match the types of the corresponding
15037 nontype template parameters, or must be convertible to the
15038 types of the corresponding nontype parameters as specified in
15039 _temp.arg.nontype_, otherwise type deduction fails.
15041 All references in the function type of the function template
15042 to the corresponding template parameters are replaced by the
15043 specified template argument values. If a substitution in a
15044 template parameter or in the function type of the function
15045 template results in an invalid type, type deduction fails. */
15046 int i
, len
= TREE_VEC_LENGTH (tparms
);
15047 location_t loc
= input_location
;
15048 bool incomplete
= false;
15050 /* Adjust any explicit template arguments before entering the
15051 substitution context. */
15053 = (coerce_template_parms (tparms
, explicit_targs
, NULL_TREE
,
15055 /*require_all_args=*/false,
15056 /*use_default_args=*/false));
15057 if (explicit_targs
== error_mark_node
)
15060 /* Substitute the explicit args into the function type. This is
15061 necessary so that, for instance, explicitly declared function
15062 arguments can match null pointed constants. If we were given
15063 an incomplete set of explicit args, we must not do semantic
15064 processing during substitution as we could create partial
15066 for (i
= 0; i
< len
; i
++)
15068 tree parm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
15069 bool parameter_pack
= false;
15070 tree targ
= TREE_VEC_ELT (explicit_targs
, i
);
15072 /* Dig out the actual parm. */
15073 if (TREE_CODE (parm
) == TYPE_DECL
15074 || TREE_CODE (parm
) == TEMPLATE_DECL
)
15076 parm
= TREE_TYPE (parm
);
15077 parameter_pack
= TEMPLATE_TYPE_PARAMETER_PACK (parm
);
15079 else if (TREE_CODE (parm
) == PARM_DECL
)
15081 parm
= DECL_INITIAL (parm
);
15082 parameter_pack
= TEMPLATE_PARM_PARAMETER_PACK (parm
);
15085 if (!parameter_pack
&& targ
== NULL_TREE
)
15086 /* No explicit argument for this template parameter. */
15089 if (parameter_pack
&& pack_deducible_p (parm
, fn
))
15091 /* Mark the argument pack as "incomplete". We could
15092 still deduce more arguments during unification.
15093 We remove this mark in type_unification_real. */
15096 ARGUMENT_PACK_INCOMPLETE_P(targ
) = 1;
15097 ARGUMENT_PACK_EXPLICIT_ARGS (targ
)
15098 = ARGUMENT_PACK_ARGS (targ
);
15101 /* We have some incomplete argument packs. */
15106 TREE_VALUE (tinst
) = explicit_targs
;
15107 if (!push_tinst_level (tinst
))
15109 excessive_deduction_depth
= true;
15112 processing_template_decl
+= incomplete
;
15113 input_location
= DECL_SOURCE_LOCATION (fn
);
15114 fntype
= tsubst (TREE_TYPE (fn
), explicit_targs
,
15115 complain
| tf_partial
, NULL_TREE
);
15116 input_location
= loc
;
15117 processing_template_decl
-= incomplete
;
15118 pop_tinst_level ();
15120 if (fntype
== error_mark_node
)
15123 /* Throw away these access checks; we'll see them again in
15124 instantiate_template and they might have the wrong
15125 access path at this point. */
15126 pop_deferring_access_checks ();
15127 push_deferring_access_checks (dk_deferred
);
15129 /* Place the explicitly specified arguments in TARGS. */
15130 for (i
= NUM_TMPL_ARGS (explicit_targs
); i
--;)
15131 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (explicit_targs
, i
);
15134 /* Never do unification on the 'this' parameter. */
15135 parms
= skip_artificial_parms_for (fn
, TYPE_ARG_TYPES (fntype
));
15141 parms
= tree_cons (NULL_TREE
, TREE_TYPE (fntype
), parms
);
15142 new_args
= XALLOCAVEC (tree
, nargs
+ 1);
15143 new_args
[0] = return_type
;
15144 memcpy (new_args
+ 1, args
, nargs
* sizeof (tree
));
15149 /* We allow incomplete unification without an error message here
15150 because the standard doesn't seem to explicitly prohibit it. Our
15151 callers must be ready to deal with unification failures in any
15154 TREE_VALUE (tinst
) = targs
;
15155 /* If we aren't explaining yet, push tinst context so we can see where
15156 any errors (e.g. from class instantiations triggered by instantiation
15157 of default template arguments) come from. If we are explaining, this
15158 context is redundant. */
15159 if (!explain_p
&& !push_tinst_level (tinst
))
15161 excessive_deduction_depth
= true;
15164 ok
= !type_unification_real (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
15165 targs
, parms
, args
, nargs
, /*subr=*/0,
15166 strict
, flags
, explain_p
);
15168 pop_tinst_level ();
15172 /* Now that we have bindings for all of the template arguments,
15173 ensure that the arguments deduced for the template template
15174 parameters have compatible template parameter lists. We cannot
15175 check this property before we have deduced all template
15176 arguments, because the template parameter types of a template
15177 template parameter might depend on prior template parameters
15178 deduced after the template template parameter. The following
15179 ill-formed example illustrates this issue:
15181 template<typename T, template<T> class C> void f(C<5>, T);
15183 template<int N> struct X {};
15186 f(X<5>(), 5l); // error: template argument deduction fails
15189 The template parameter list of 'C' depends on the template type
15190 parameter 'T', but 'C' is deduced to 'X' before 'T' is deduced to
15191 'long'. Thus, we can't check that 'C' cannot bind to 'X' at the
15192 time that we deduce 'C'. */
15193 if (!template_template_parm_bindings_ok_p
15194 (DECL_INNERMOST_TEMPLATE_PARMS (fn
), targs
))
15196 unify_inconsistent_template_template_parameters (explain_p
);
15200 /* All is well so far. Now, check:
15204 When all template arguments have been deduced, all uses of
15205 template parameters in nondeduced contexts are replaced with
15206 the corresponding deduced argument values. If the
15207 substitution results in an invalid type, as described above,
15208 type deduction fails. */
15209 TREE_VALUE (tinst
) = targs
;
15210 if (!push_tinst_level (tinst
))
15212 excessive_deduction_depth
= true;
15215 decl
= instantiate_template (fn
, targs
, complain
);
15216 pop_tinst_level ();
15218 if (decl
== error_mark_node
)
15221 /* Now perform any access checks encountered during deduction, such as
15222 for default template arguments. */
15223 push_access_scope (decl
);
15224 ok
= perform_deferred_access_checks (complain
);
15225 pop_access_scope (decl
);
15229 /* If we're looking for an exact match, check that what we got
15230 is indeed an exact match. It might not be if some template
15231 parameters are used in non-deduced contexts. */
15232 if (strict
== DEDUCE_EXACT
)
15234 tree substed
= TREE_TYPE (decl
);
15238 = skip_artificial_parms_for (decl
, TYPE_ARG_TYPES (substed
));
15240 sarg
= tree_cons (NULL_TREE
, TREE_TYPE (substed
), sarg
);
15241 for (i
= 0; i
< nargs
&& sarg
; ++i
, sarg
= TREE_CHAIN (sarg
))
15242 if (!same_type_p (args
[i
], TREE_VALUE (sarg
)))
15244 unify_type_mismatch (explain_p
, args
[i
],
15245 TREE_VALUE (sarg
));
15253 pop_deferring_access_checks ();
15255 if (excessive_deduction_depth
)
15257 if (deduction_depth
== 0)
15258 /* Reset once we're all the way out. */
15259 excessive_deduction_depth
= false;
15262 /* We can't free this if a pending_template entry or last_error_tinst_level
15263 is pointing at it. */
15264 if (last_pending_template
== old_last_pend
15265 && last_error_tinst_level
== old_error_tinst
)
15271 /* Adjust types before performing type deduction, as described in
15272 [temp.deduct.call] and [temp.deduct.conv]. The rules in these two
15273 sections are symmetric. PARM is the type of a function parameter
15274 or the return type of the conversion function. ARG is the type of
15275 the argument passed to the call, or the type of the value
15276 initialized with the result of the conversion function.
15277 ARG_EXPR is the original argument expression, which may be null. */
15280 maybe_adjust_types_for_deduction (unification_kind_t strict
,
15294 /* Swap PARM and ARG throughout the remainder of this
15295 function; the handling is precisely symmetric since PARM
15296 will initialize ARG rather than vice versa. */
15304 /* Core issue #873: Do the DR606 thing (see below) for these cases,
15305 too, but here handle it by stripping the reference from PARM
15306 rather than by adding it to ARG. */
15307 if (TREE_CODE (*parm
) == REFERENCE_TYPE
15308 && TYPE_REF_IS_RVALUE (*parm
)
15309 && TREE_CODE (TREE_TYPE (*parm
)) == TEMPLATE_TYPE_PARM
15310 && cp_type_quals (TREE_TYPE (*parm
)) == TYPE_UNQUALIFIED
15311 && TREE_CODE (*arg
) == REFERENCE_TYPE
15312 && !TYPE_REF_IS_RVALUE (*arg
))
15313 *parm
= TREE_TYPE (*parm
);
15314 /* Nothing else to do in this case. */
15318 gcc_unreachable ();
15321 if (TREE_CODE (*parm
) != REFERENCE_TYPE
)
15323 /* [temp.deduct.call]
15325 If P is not a reference type:
15327 --If A is an array type, the pointer type produced by the
15328 array-to-pointer standard conversion (_conv.array_) is
15329 used in place of A for type deduction; otherwise,
15331 --If A is a function type, the pointer type produced by
15332 the function-to-pointer standard conversion
15333 (_conv.func_) is used in place of A for type deduction;
15336 --If A is a cv-qualified type, the top level
15337 cv-qualifiers of A's type are ignored for type
15339 if (TREE_CODE (*arg
) == ARRAY_TYPE
)
15340 *arg
= build_pointer_type (TREE_TYPE (*arg
));
15341 else if (TREE_CODE (*arg
) == FUNCTION_TYPE
)
15342 *arg
= build_pointer_type (*arg
);
15344 *arg
= TYPE_MAIN_VARIANT (*arg
);
15347 /* From C++0x [14.8.2.1/3 temp.deduct.call] (after DR606), "If P is
15348 of the form T&&, where T is a template parameter, and the argument
15349 is an lvalue, T is deduced as A& */
15350 if (TREE_CODE (*parm
) == REFERENCE_TYPE
15351 && TYPE_REF_IS_RVALUE (*parm
)
15352 && TREE_CODE (TREE_TYPE (*parm
)) == TEMPLATE_TYPE_PARM
15353 && cp_type_quals (TREE_TYPE (*parm
)) == TYPE_UNQUALIFIED
15354 && (arg_expr
? real_lvalue_p (arg_expr
)
15355 /* try_one_overload doesn't provide an arg_expr, but
15356 functions are always lvalues. */
15357 : TREE_CODE (*arg
) == FUNCTION_TYPE
))
15358 *arg
= build_reference_type (*arg
);
15360 /* [temp.deduct.call]
15362 If P is a cv-qualified type, the top level cv-qualifiers
15363 of P's type are ignored for type deduction. If P is a
15364 reference type, the type referred to by P is used for
15366 *parm
= TYPE_MAIN_VARIANT (*parm
);
15367 if (TREE_CODE (*parm
) == REFERENCE_TYPE
)
15369 *parm
= TREE_TYPE (*parm
);
15370 result
|= UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
15373 /* DR 322. For conversion deduction, remove a reference type on parm
15374 too (which has been swapped into ARG). */
15375 if (strict
== DEDUCE_CONV
&& TREE_CODE (*arg
) == REFERENCE_TYPE
)
15376 *arg
= TREE_TYPE (*arg
);
15381 /* Subroutine of unify_one_argument. PARM is a function parameter of a
15382 template which does contain any deducible template parameters; check if
15383 ARG is a suitable match for it. STRICT, FLAGS and EXPLAIN_P are as in
15384 unify_one_argument. */
15387 check_non_deducible_conversion (tree parm
, tree arg
, int strict
,
15388 int flags
, bool explain_p
)
15393 type
= TREE_TYPE (arg
);
15397 if (same_type_p (parm
, type
))
15398 return unify_success (explain_p
);
15400 if (strict
== DEDUCE_CONV
)
15402 if (can_convert_arg (type
, parm
, NULL_TREE
, flags
,
15403 explain_p
? tf_warning_or_error
: tf_none
))
15404 return unify_success (explain_p
);
15406 else if (strict
!= DEDUCE_EXACT
)
15408 if (can_convert_arg (parm
, type
,
15409 TYPE_P (arg
) ? NULL_TREE
: arg
,
15410 flags
, explain_p
? tf_warning_or_error
: tf_none
))
15411 return unify_success (explain_p
);
15414 if (strict
== DEDUCE_EXACT
)
15415 return unify_type_mismatch (explain_p
, parm
, arg
);
15417 return unify_arg_conversion (explain_p
, parm
, type
, arg
);
15420 static bool uses_deducible_template_parms (tree type
);
15422 /* Returns true iff the expression EXPR is one from which a template
15423 argument can be deduced. In other words, if it's an undecorated
15424 use of a template non-type parameter. */
15427 deducible_expression (tree expr
)
15429 return (TREE_CODE (expr
) == TEMPLATE_PARM_INDEX
);
15432 /* Returns true iff the array domain DOMAIN uses a template parameter in a
15433 deducible way; that is, if it has a max value of <PARM> - 1. */
15436 deducible_array_bound (tree domain
)
15438 if (domain
== NULL_TREE
)
15441 tree max
= TYPE_MAX_VALUE (domain
);
15442 if (TREE_CODE (max
) != MINUS_EXPR
)
15445 return deducible_expression (TREE_OPERAND (max
, 0));
15448 /* Returns true iff the template arguments ARGS use a template parameter
15449 in a deducible way. */
15452 deducible_template_args (tree args
)
15454 for (int i
= 0; i
< TREE_VEC_LENGTH (args
); ++i
)
15457 tree elt
= TREE_VEC_ELT (args
, i
);
15458 if (ARGUMENT_PACK_P (elt
))
15459 deducible
= deducible_template_args (ARGUMENT_PACK_ARGS (elt
));
15462 if (PACK_EXPANSION_P (elt
))
15463 elt
= PACK_EXPANSION_PATTERN (elt
);
15464 if (TREE_CODE (elt
) == TEMPLATE_TEMPLATE_PARM
)
15466 else if (TYPE_P (elt
))
15467 deducible
= uses_deducible_template_parms (elt
);
15469 deducible
= deducible_expression (elt
);
15477 /* Returns true iff TYPE contains any deducible references to template
15478 parameters, as per 14.8.2.5. */
15481 uses_deducible_template_parms (tree type
)
15483 if (PACK_EXPANSION_P (type
))
15484 type
= PACK_EXPANSION_PATTERN (type
);
15491 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
15492 || TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
15498 if (POINTER_TYPE_P (type
))
15499 return uses_deducible_template_parms (TREE_TYPE (type
));
15501 /* T[integer-constant ]
15503 if (TREE_CODE (type
) == ARRAY_TYPE
)
15504 return (uses_deducible_template_parms (TREE_TYPE (type
))
15505 || deducible_array_bound (TYPE_DOMAIN (type
)));
15517 if (TYPE_PTRMEM_P (type
))
15518 return (uses_deducible_template_parms (TYPE_PTRMEM_CLASS_TYPE (type
))
15519 || (uses_deducible_template_parms
15520 (TYPE_PTRMEM_POINTED_TO_TYPE (type
))));
15522 /* template-name <T> (where template-name refers to a class template)
15523 template-name <i> (where template-name refers to a class template) */
15524 if (CLASS_TYPE_P (type
)
15525 && CLASSTYPE_TEMPLATE_INFO (type
)
15526 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (type
)))
15527 return deducible_template_args (INNERMOST_TEMPLATE_ARGS
15528 (CLASSTYPE_TI_ARGS (type
)));
15533 if (TREE_CODE (type
) == FUNCTION_TYPE
15534 || TREE_CODE (type
) == METHOD_TYPE
)
15536 if (uses_deducible_template_parms (TREE_TYPE (type
)))
15538 tree parm
= TYPE_ARG_TYPES (type
);
15539 if (TREE_CODE (type
) == METHOD_TYPE
)
15540 parm
= TREE_CHAIN (parm
);
15541 for (; parm
; parm
= TREE_CHAIN (parm
))
15542 if (uses_deducible_template_parms (TREE_VALUE (parm
)))
15549 /* Subroutine of type_unification_real and unify_pack_expansion to
15550 handle unification of a single P/A pair. Parameters are as
15551 for those functions. */
15554 unify_one_argument (tree tparms
, tree targs
, tree parm
, tree arg
,
15555 int subr
, unification_kind_t strict
, int flags
,
15558 tree arg_expr
= NULL_TREE
;
15561 if (arg
== error_mark_node
|| parm
== error_mark_node
)
15562 return unify_invalid (explain_p
);
15563 if (arg
== unknown_type_node
)
15564 /* We can't deduce anything from this, but we might get all the
15565 template args from other function args. */
15566 return unify_success (explain_p
);
15568 /* Implicit conversions (Clause 4) will be performed on a function
15569 argument to convert it to the type of the corresponding function
15570 parameter if the parameter type contains no template-parameters that
15571 participate in template argument deduction. */
15572 if (TYPE_P (parm
) && !uses_template_parms (parm
))
15573 /* For function parameters that contain no template-parameters at all,
15574 we have historically checked for convertibility in order to shortcut
15575 consideration of this candidate. */
15576 return check_non_deducible_conversion (parm
, arg
, strict
, flags
,
15578 else if (strict
== DEDUCE_CALL
15579 && TYPE_P (parm
) && !uses_deducible_template_parms (parm
))
15580 /* For function parameters with only non-deducible template parameters,
15582 return unify_success (explain_p
);
15587 arg_strict
= (UNIFY_ALLOW_OUTER_LEVEL
15588 | UNIFY_ALLOW_MORE_CV_QUAL
15589 | UNIFY_ALLOW_DERIVED
);
15593 arg_strict
= UNIFY_ALLOW_LESS_CV_QUAL
;
15597 arg_strict
= UNIFY_ALLOW_NONE
;
15601 gcc_unreachable ();
15604 /* We only do these transformations if this is the top-level
15605 parameter_type_list in a call or declaration matching; in other
15606 situations (nested function declarators, template argument lists) we
15607 won't be comparing a type to an expression, and we don't do any type
15613 gcc_assert (TREE_TYPE (arg
) != NULL_TREE
);
15614 if (type_unknown_p (arg
))
15616 /* [temp.deduct.type] A template-argument can be
15617 deduced from a pointer to function or pointer
15618 to member function argument if the set of
15619 overloaded functions does not contain function
15620 templates and at most one of a set of
15621 overloaded functions provides a unique
15624 if (resolve_overloaded_unification
15625 (tparms
, targs
, parm
, arg
, strict
,
15626 arg_strict
, explain_p
))
15627 return unify_success (explain_p
);
15628 return unify_overload_resolution_failure (explain_p
, arg
);
15632 arg
= unlowered_expr_type (arg
);
15633 if (arg
== error_mark_node
)
15634 return unify_invalid (explain_p
);
15638 maybe_adjust_types_for_deduction (strict
, &parm
, &arg
, arg_expr
);
15641 gcc_assert ((TYPE_P (parm
) || TREE_CODE (parm
) == TEMPLATE_DECL
)
15642 == (TYPE_P (arg
) || TREE_CODE (arg
) == TEMPLATE_DECL
));
15644 /* For deduction from an init-list we need the actual list. */
15645 if (arg_expr
&& BRACE_ENCLOSED_INITIALIZER_P (arg_expr
))
15647 return unify (tparms
, targs
, parm
, arg
, arg_strict
, explain_p
);
15650 /* Most parms like fn_type_unification.
15652 If SUBR is 1, we're being called recursively (to unify the
15653 arguments of a function or method parameter of a function
15657 type_unification_real (tree tparms
,
15661 unsigned int xnargs
,
15663 unification_kind_t strict
,
15669 int ntparms
= TREE_VEC_LENGTH (tparms
);
15670 int saw_undeduced
= 0;
15673 unsigned int nargs
;
15676 gcc_assert (TREE_CODE (tparms
) == TREE_VEC
);
15677 gcc_assert (xparms
== NULL_TREE
|| TREE_CODE (xparms
) == TREE_LIST
);
15678 gcc_assert (ntparms
> 0);
15680 /* Reset the number of non-defaulted template arguments contained
15682 NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
) = NULL_TREE
;
15690 while (parms
&& parms
!= void_list_node
15693 parm
= TREE_VALUE (parms
);
15695 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
15696 && (!TREE_CHAIN (parms
) || TREE_CHAIN (parms
) == void_list_node
))
15697 /* For a function parameter pack that occurs at the end of the
15698 parameter-declaration-list, the type A of each remaining
15699 argument of the call is compared with the type P of the
15700 declarator-id of the function parameter pack. */
15703 parms
= TREE_CHAIN (parms
);
15705 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
)
15706 /* For a function parameter pack that does not occur at the
15707 end of the parameter-declaration-list, the type of the
15708 parameter pack is a non-deduced context. */
15714 if (unify_one_argument (tparms
, targs
, parm
, arg
, subr
, strict
,
15720 && parms
!= void_list_node
15721 && TREE_CODE (TREE_VALUE (parms
)) == TYPE_PACK_EXPANSION
)
15723 /* Unify the remaining arguments with the pack expansion type. */
15725 tree parmvec
= make_tree_vec (1);
15727 /* Allocate a TREE_VEC and copy in all of the arguments */
15728 argvec
= make_tree_vec (nargs
- ia
);
15729 for (i
= 0; ia
< nargs
; ++ia
, ++i
)
15730 TREE_VEC_ELT (argvec
, i
) = args
[ia
];
15732 /* Copy the parameter into parmvec. */
15733 TREE_VEC_ELT (parmvec
, 0) = TREE_VALUE (parms
);
15734 if (unify_pack_expansion (tparms
, targs
, parmvec
, argvec
, strict
,
15735 /*subr=*/subr
, explain_p
))
15738 /* Advance to the end of the list of parameters. */
15739 parms
= TREE_CHAIN (parms
);
15742 /* Fail if we've reached the end of the parm list, and more args
15743 are present, and the parm list isn't variadic. */
15744 if (ia
< nargs
&& parms
== void_list_node
)
15745 return unify_too_many_arguments (explain_p
, nargs
, ia
);
15746 /* Fail if parms are left and they don't have default values. */
15747 if (parms
&& parms
!= void_list_node
15748 && TREE_PURPOSE (parms
) == NULL_TREE
)
15750 unsigned int count
= nargs
;
15752 while (p
&& p
!= void_list_node
)
15755 p
= TREE_CHAIN (p
);
15757 return unify_too_few_arguments (explain_p
, ia
, count
);
15762 tsubst_flags_t complain
= (explain_p
15763 ? tf_warning_or_error
15766 for (i
= 0; i
< ntparms
; i
++)
15768 tree targ
= TREE_VEC_ELT (targs
, i
);
15769 tree tparm
= TREE_VEC_ELT (tparms
, i
);
15771 /* Clear the "incomplete" flags on all argument packs now so that
15772 substituting them into later default arguments works. */
15773 if (targ
&& ARGUMENT_PACK_P (targ
))
15775 ARGUMENT_PACK_INCOMPLETE_P (targ
) = 0;
15776 ARGUMENT_PACK_EXPLICIT_ARGS (targ
) = NULL_TREE
;
15779 if (targ
|| tparm
== error_mark_node
)
15781 tparm
= TREE_VALUE (tparm
);
15783 /* If this is an undeduced nontype parameter that depends on
15784 a type parameter, try another pass; its type may have been
15785 deduced from a later argument than the one from which
15786 this parameter can be deduced. */
15787 if (TREE_CODE (tparm
) == PARM_DECL
15788 && uses_template_parms (TREE_TYPE (tparm
))
15789 && !saw_undeduced
++)
15792 /* Core issue #226 (C++0x) [temp.deduct]:
15794 If a template argument has not been deduced, its
15795 default template argument, if any, is used.
15797 When we are in C++98 mode, TREE_PURPOSE will either
15798 be NULL_TREE or ERROR_MARK_NODE, so we do not need
15799 to explicitly check cxx_dialect here. */
15800 if (TREE_PURPOSE (TREE_VEC_ELT (tparms
, i
)))
15802 tree parm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
15803 tree arg
= TREE_PURPOSE (TREE_VEC_ELT (tparms
, i
));
15804 location_t save_loc
= input_location
;
15806 input_location
= DECL_SOURCE_LOCATION (parm
);
15807 arg
= tsubst_template_arg (arg
, targs
, complain
, NULL_TREE
);
15808 arg
= convert_template_argument (parm
, arg
, targs
, complain
,
15810 input_location
= save_loc
;
15811 if (arg
== error_mark_node
)
15815 TREE_VEC_ELT (targs
, i
) = arg
;
15816 /* The position of the first default template argument,
15817 is also the number of non-defaulted arguments in TARGS.
15819 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
))
15820 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
, i
);
15825 /* If the type parameter is a parameter pack, then it will
15826 be deduced to an empty parameter pack. */
15827 if (template_parameter_pack_p (tparm
))
15831 if (TREE_CODE (tparm
) == TEMPLATE_PARM_INDEX
)
15833 arg
= make_node (NONTYPE_ARGUMENT_PACK
);
15834 TREE_TYPE (arg
) = TREE_TYPE (TEMPLATE_PARM_DECL (tparm
));
15835 TREE_CONSTANT (arg
) = 1;
15838 arg
= cxx_make_type (TYPE_ARGUMENT_PACK
);
15840 SET_ARGUMENT_PACK_ARGS (arg
, make_tree_vec (0));
15842 TREE_VEC_ELT (targs
, i
) = arg
;
15846 return unify_parameter_deduction_failure (explain_p
, tparm
);
15849 #ifdef ENABLE_CHECKING
15850 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
))
15851 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
, TREE_VEC_LENGTH (targs
));
15854 return unify_success (explain_p
);
15857 /* Subroutine of type_unification_real. Args are like the variables
15858 at the call site. ARG is an overloaded function (or template-id);
15859 we try deducing template args from each of the overloads, and if
15860 only one succeeds, we go with that. Modifies TARGS and returns
15861 true on success. */
15864 resolve_overloaded_unification (tree tparms
,
15868 unification_kind_t strict
,
15872 tree tempargs
= copy_node (targs
);
15874 tree goodfn
= NULL_TREE
;
15877 if (TREE_CODE (arg
) == ADDR_EXPR
)
15879 arg
= TREE_OPERAND (arg
, 0);
15885 if (TREE_CODE (arg
) == COMPONENT_REF
)
15886 /* Handle `&x' where `x' is some static or non-static member
15888 arg
= TREE_OPERAND (arg
, 1);
15890 if (TREE_CODE (arg
) == OFFSET_REF
)
15891 arg
= TREE_OPERAND (arg
, 1);
15893 /* Strip baselink information. */
15894 if (BASELINK_P (arg
))
15895 arg
= BASELINK_FUNCTIONS (arg
);
15897 if (TREE_CODE (arg
) == TEMPLATE_ID_EXPR
)
15899 /* If we got some explicit template args, we need to plug them into
15900 the affected templates before we try to unify, in case the
15901 explicit args will completely resolve the templates in question. */
15904 tree expl_subargs
= TREE_OPERAND (arg
, 1);
15905 arg
= TREE_OPERAND (arg
, 0);
15907 for (; arg
; arg
= OVL_NEXT (arg
))
15909 tree fn
= OVL_CURRENT (arg
);
15910 tree subargs
, elem
;
15912 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
15915 subargs
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
15916 expl_subargs
, NULL_TREE
, tf_none
,
15917 /*require_all_args=*/true,
15918 /*use_default_args=*/true);
15919 if (subargs
!= error_mark_node
15920 && !any_dependent_template_arguments_p (subargs
))
15922 elem
= tsubst (TREE_TYPE (fn
), subargs
, tf_none
, NULL_TREE
);
15923 if (try_one_overload (tparms
, targs
, tempargs
, parm
,
15924 elem
, strict
, sub_strict
, addr_p
, explain_p
)
15925 && (!goodfn
|| !same_type_p (goodfn
, elem
)))
15934 /* If no templates (or more than one) are fully resolved by the
15935 explicit arguments, this template-id is a non-deduced context; it
15936 could still be OK if we deduce all template arguments for the
15937 enclosing call through other arguments. */
15941 else if (TREE_CODE (arg
) != OVERLOAD
15942 && TREE_CODE (arg
) != FUNCTION_DECL
)
15943 /* If ARG is, for example, "(0, &f)" then its type will be unknown
15944 -- but the deduction does not succeed because the expression is
15945 not just the function on its own. */
15948 for (; arg
; arg
= OVL_NEXT (arg
))
15949 if (try_one_overload (tparms
, targs
, tempargs
, parm
,
15950 TREE_TYPE (OVL_CURRENT (arg
)),
15951 strict
, sub_strict
, addr_p
, explain_p
)
15952 && (!goodfn
|| !decls_match (goodfn
, OVL_CURRENT (arg
))))
15954 goodfn
= OVL_CURRENT (arg
);
15958 /* [temp.deduct.type] A template-argument can be deduced from a pointer
15959 to function or pointer to member function argument if the set of
15960 overloaded functions does not contain function templates and at most
15961 one of a set of overloaded functions provides a unique match.
15963 So if we found multiple possibilities, we return success but don't
15964 deduce anything. */
15968 int i
= TREE_VEC_LENGTH (targs
);
15970 if (TREE_VEC_ELT (tempargs
, i
))
15971 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (tempargs
, i
);
15979 /* Core DR 115: In contexts where deduction is done and fails, or in
15980 contexts where deduction is not done, if a template argument list is
15981 specified and it, along with any default template arguments, identifies
15982 a single function template specialization, then the template-id is an
15983 lvalue for the function template specialization. */
15986 resolve_nondeduced_context (tree orig_expr
)
15988 tree expr
, offset
, baselink
;
15991 if (!type_unknown_p (orig_expr
))
15996 offset
= NULL_TREE
;
15997 baselink
= NULL_TREE
;
15999 if (TREE_CODE (expr
) == ADDR_EXPR
)
16001 expr
= TREE_OPERAND (expr
, 0);
16004 if (TREE_CODE (expr
) == OFFSET_REF
)
16007 expr
= TREE_OPERAND (expr
, 1);
16009 if (BASELINK_P (expr
))
16012 expr
= BASELINK_FUNCTIONS (expr
);
16015 if (TREE_CODE (expr
) == TEMPLATE_ID_EXPR
)
16018 tree goodfn
= NULL_TREE
;
16020 /* If we got some explicit template args, we need to plug them into
16021 the affected templates before we try to unify, in case the
16022 explicit args will completely resolve the templates in question. */
16024 tree expl_subargs
= TREE_OPERAND (expr
, 1);
16025 tree arg
= TREE_OPERAND (expr
, 0);
16026 tree badfn
= NULL_TREE
;
16027 tree badargs
= NULL_TREE
;
16029 for (; arg
; arg
= OVL_NEXT (arg
))
16031 tree fn
= OVL_CURRENT (arg
);
16032 tree subargs
, elem
;
16034 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
16037 subargs
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
16038 expl_subargs
, NULL_TREE
, tf_none
,
16039 /*require_all_args=*/true,
16040 /*use_default_args=*/true);
16041 if (subargs
!= error_mark_node
16042 && !any_dependent_template_arguments_p (subargs
))
16044 elem
= instantiate_template (fn
, subargs
, tf_none
);
16045 if (elem
== error_mark_node
)
16050 else if (elem
&& (!goodfn
|| !decls_match (goodfn
, elem
)))
16059 mark_used (goodfn
);
16062 expr
= build_baselink (BASELINK_BINFO (baselink
),
16063 BASELINK_ACCESS_BINFO (baselink
),
16064 expr
, BASELINK_OPTYPE (baselink
));
16068 = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (offset
, 0)));
16069 expr
= build_offset_ref (base
, expr
, addr
, tf_warning_or_error
);
16072 expr
= cp_build_addr_expr (expr
, tf_warning_or_error
);
16075 else if (good
== 0 && badargs
)
16076 /* There were no good options and at least one bad one, so let the
16077 user know what the problem is. */
16078 instantiate_template (badfn
, badargs
, tf_warning_or_error
);
16083 /* Subroutine of resolve_overloaded_unification; does deduction for a single
16084 overload. Fills TARGS with any deduced arguments, or error_mark_node if
16085 different overloads deduce different arguments for a given parm.
16086 ADDR_P is true if the expression for which deduction is being
16087 performed was of the form "& fn" rather than simply "fn".
16089 Returns 1 on success. */
16092 try_one_overload (tree tparms
,
16097 unification_kind_t strict
,
16106 if (arg
== error_mark_node
)
16109 /* [temp.deduct.type] A template-argument can be deduced from a pointer
16110 to function or pointer to member function argument if the set of
16111 overloaded functions does not contain function templates and at most
16112 one of a set of overloaded functions provides a unique match.
16114 So if this is a template, just return success. */
16116 if (uses_template_parms (arg
))
16119 if (TREE_CODE (arg
) == METHOD_TYPE
)
16120 arg
= build_ptrmemfunc_type (build_pointer_type (arg
));
16122 arg
= build_pointer_type (arg
);
16124 sub_strict
|= maybe_adjust_types_for_deduction (strict
, &parm
, &arg
, NULL
);
16126 /* We don't copy orig_targs for this because if we have already deduced
16127 some template args from previous args, unify would complain when we
16128 try to deduce a template parameter for the same argument, even though
16129 there isn't really a conflict. */
16130 nargs
= TREE_VEC_LENGTH (targs
);
16131 tempargs
= make_tree_vec (nargs
);
16133 if (unify (tparms
, tempargs
, parm
, arg
, sub_strict
, explain_p
))
16136 /* First make sure we didn't deduce anything that conflicts with
16137 explicitly specified args. */
16138 for (i
= nargs
; i
--; )
16140 tree elt
= TREE_VEC_ELT (tempargs
, i
);
16141 tree oldelt
= TREE_VEC_ELT (orig_targs
, i
);
16145 else if (uses_template_parms (elt
))
16146 /* Since we're unifying against ourselves, we will fill in
16147 template args used in the function parm list with our own
16148 template parms. Discard them. */
16149 TREE_VEC_ELT (tempargs
, i
) = NULL_TREE
;
16150 else if (oldelt
&& !template_args_equal (oldelt
, elt
))
16154 for (i
= nargs
; i
--; )
16156 tree elt
= TREE_VEC_ELT (tempargs
, i
);
16159 TREE_VEC_ELT (targs
, i
) = elt
;
16165 /* PARM is a template class (perhaps with unbound template
16166 parameters). ARG is a fully instantiated type. If ARG can be
16167 bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and
16168 TARGS are as for unify. */
16171 try_class_unification (tree tparms
, tree targs
, tree parm
, tree arg
,
16174 tree copy_of_targs
;
16176 if (!CLASSTYPE_TEMPLATE_INFO (arg
)
16177 || (most_general_template (CLASSTYPE_TI_TEMPLATE (arg
))
16178 != most_general_template (CLASSTYPE_TI_TEMPLATE (parm
))))
16181 /* We need to make a new template argument vector for the call to
16182 unify. If we used TARGS, we'd clutter it up with the result of
16183 the attempted unification, even if this class didn't work out.
16184 We also don't want to commit ourselves to all the unifications
16185 we've already done, since unification is supposed to be done on
16186 an argument-by-argument basis. In other words, consider the
16187 following pathological case:
16189 template <int I, int J, int K>
16192 template <int I, int J>
16193 struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {};
16195 template <int I, int J, int K>
16196 void f(S<I, J, K>, S<I, I, I>);
16205 Now, by the time we consider the unification involving `s2', we
16206 already know that we must have `f<0, 0, 0>'. But, even though
16207 `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is invalid
16208 because there are two ways to unify base classes of S<0, 1, 2>
16209 with S<I, I, I>. If we kept the already deduced knowledge, we
16210 would reject the possibility I=1. */
16211 copy_of_targs
= make_tree_vec (TREE_VEC_LENGTH (targs
));
16213 /* If unification failed, we're done. */
16214 if (unify (tparms
, copy_of_targs
, CLASSTYPE_TI_ARGS (parm
),
16215 CLASSTYPE_TI_ARGS (arg
), UNIFY_ALLOW_NONE
, explain_p
))
16221 /* Given a template type PARM and a class type ARG, find the unique
16222 base type in ARG that is an instance of PARM. We do not examine
16223 ARG itself; only its base-classes. If there is not exactly one
16224 appropriate base class, return NULL_TREE. PARM may be the type of
16225 a partial specialization, as well as a plain template type. Used
16228 static enum template_base_result
16229 get_template_base (tree tparms
, tree targs
, tree parm
, tree arg
,
16230 bool explain_p
, tree
*result
)
16232 tree rval
= NULL_TREE
;
16235 gcc_assert (RECORD_OR_UNION_CODE_P (TREE_CODE (arg
)));
16237 binfo
= TYPE_BINFO (complete_type (arg
));
16240 /* The type could not be completed. */
16241 *result
= NULL_TREE
;
16242 return tbr_incomplete_type
;
16245 /* Walk in inheritance graph order. The search order is not
16246 important, and this avoids multiple walks of virtual bases. */
16247 for (binfo
= TREE_CHAIN (binfo
); binfo
; binfo
= TREE_CHAIN (binfo
))
16249 tree r
= try_class_unification (tparms
, targs
, parm
,
16250 BINFO_TYPE (binfo
), explain_p
);
16254 /* If there is more than one satisfactory baseclass, then:
16258 If they yield more than one possible deduced A, the type
16262 if (rval
&& !same_type_p (r
, rval
))
16264 *result
= NULL_TREE
;
16265 return tbr_ambiguous_baseclass
;
16273 return tbr_success
;
16276 /* Returns the level of DECL, which declares a template parameter. */
16279 template_decl_level (tree decl
)
16281 switch (TREE_CODE (decl
))
16284 case TEMPLATE_DECL
:
16285 return TEMPLATE_TYPE_LEVEL (TREE_TYPE (decl
));
16288 return TEMPLATE_PARM_LEVEL (DECL_INITIAL (decl
));
16291 gcc_unreachable ();
16296 /* Decide whether ARG can be unified with PARM, considering only the
16297 cv-qualifiers of each type, given STRICT as documented for unify.
16298 Returns nonzero iff the unification is OK on that basis. */
16301 check_cv_quals_for_unify (int strict
, tree arg
, tree parm
)
16303 int arg_quals
= cp_type_quals (arg
);
16304 int parm_quals
= cp_type_quals (parm
);
16306 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
16307 && !(strict
& UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
16309 /* Although a CVR qualifier is ignored when being applied to a
16310 substituted template parameter ([8.3.2]/1 for example), that
16311 does not allow us to unify "const T" with "int&" because both
16312 types are not of the form "cv-list T" [14.8.2.5 temp.deduct.type].
16313 It is ok when we're allowing additional CV qualifiers
16314 at the outer level [14.8.2.1]/3,1st bullet. */
16315 if ((TREE_CODE (arg
) == REFERENCE_TYPE
16316 || TREE_CODE (arg
) == FUNCTION_TYPE
16317 || TREE_CODE (arg
) == METHOD_TYPE
)
16318 && (parm_quals
& (TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
)))
16321 if ((!POINTER_TYPE_P (arg
) && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
)
16322 && (parm_quals
& TYPE_QUAL_RESTRICT
))
16326 if (!(strict
& (UNIFY_ALLOW_MORE_CV_QUAL
| UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
16327 && (arg_quals
& parm_quals
) != parm_quals
)
16330 if (!(strict
& (UNIFY_ALLOW_LESS_CV_QUAL
| UNIFY_ALLOW_OUTER_LESS_CV_QUAL
))
16331 && (parm_quals
& arg_quals
) != arg_quals
)
16337 /* Determines the LEVEL and INDEX for the template parameter PARM. */
16339 template_parm_level_and_index (tree parm
, int* level
, int* index
)
16341 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
16342 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
16343 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
16345 *index
= TEMPLATE_TYPE_IDX (parm
);
16346 *level
= TEMPLATE_TYPE_LEVEL (parm
);
16350 *index
= TEMPLATE_PARM_IDX (parm
);
16351 *level
= TEMPLATE_PARM_LEVEL (parm
);
16355 #define RECUR_AND_CHECK_FAILURE(TP, TA, P, A, S, EP) \
16357 if (unify (TP, TA, P, A, S, EP)) \
16361 /* Unifies the remaining arguments in PACKED_ARGS with the pack
16362 expansion at the end of PACKED_PARMS. Returns 0 if the type
16363 deduction succeeds, 1 otherwise. STRICT is the same as in
16364 unify. CALL_ARGS_P is true iff PACKED_ARGS is actually a function
16365 call argument list. We'll need to adjust the arguments to make them
16366 types. SUBR tells us if this is from a recursive call to
16367 type_unification_real, or for comparing two template argument
16371 unify_pack_expansion (tree tparms
, tree targs
, tree packed_parms
,
16372 tree packed_args
, unification_kind_t strict
,
16373 bool subr
, bool explain_p
)
16376 = TREE_VEC_ELT (packed_parms
, TREE_VEC_LENGTH (packed_parms
) - 1);
16377 tree pattern
= PACK_EXPANSION_PATTERN (parm
);
16378 tree pack
, packs
= NULL_TREE
;
16379 int i
, start
= TREE_VEC_LENGTH (packed_parms
) - 1;
16380 int len
= TREE_VEC_LENGTH (packed_args
);
16382 /* Determine the parameter packs we will be deducing from the
16383 pattern, and record their current deductions. */
16384 for (pack
= PACK_EXPANSION_PARAMETER_PACKS (parm
);
16385 pack
; pack
= TREE_CHAIN (pack
))
16387 tree parm_pack
= TREE_VALUE (pack
);
16390 /* Determine the index and level of this parameter pack. */
16391 template_parm_level_and_index (parm_pack
, &level
, &idx
);
16393 /* Keep track of the parameter packs and their corresponding
16395 packs
= tree_cons (parm_pack
, TMPL_ARG (targs
, level
, idx
), packs
);
16396 TREE_TYPE (packs
) = make_tree_vec (len
- start
);
16399 /* Loop through all of the arguments that have not yet been
16400 unified and unify each with the pattern. */
16401 for (i
= start
; i
< len
; i
++)
16404 bool any_explicit
= false;
16405 tree arg
= TREE_VEC_ELT (packed_args
, i
);
16407 /* For each parameter pack, set its TMPL_ARG to either NULL_TREE
16408 or the element of its argument pack at the current index if
16409 this argument was explicitly specified. */
16410 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
16414 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
16417 if (TREE_VALUE (pack
)
16418 && (pargs
= ARGUMENT_PACK_EXPLICIT_ARGS (TREE_VALUE (pack
)))
16419 && (i
- start
< TREE_VEC_LENGTH (pargs
)))
16421 any_explicit
= true;
16422 arg
= TREE_VEC_ELT (pargs
, i
- start
);
16424 TMPL_ARG (targs
, level
, idx
) = arg
;
16427 /* If we had explicit template arguments, substitute them into the
16428 pattern before deduction. */
16431 /* Some arguments might still be unspecified or dependent. */
16433 ++processing_template_decl
;
16434 dependent
= any_dependent_template_arguments_p (targs
);
16436 --processing_template_decl
;
16437 parm
= tsubst (pattern
, targs
,
16438 explain_p
? tf_warning_or_error
: tf_none
,
16441 --processing_template_decl
;
16442 if (parm
== error_mark_node
)
16448 /* Unify the pattern with the current argument. */
16449 if (unify_one_argument (tparms
, targs
, parm
, arg
, subr
, strict
,
16450 LOOKUP_IMPLICIT
, explain_p
))
16453 /* For each parameter pack, collect the deduced value. */
16454 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
16457 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
16459 TREE_VEC_ELT (TREE_TYPE (pack
), i
- start
) =
16460 TMPL_ARG (targs
, level
, idx
);
16464 /* Verify that the results of unification with the parameter packs
16465 produce results consistent with what we've seen before, and make
16466 the deduced argument packs available. */
16467 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
16469 tree old_pack
= TREE_VALUE (pack
);
16470 tree new_args
= TREE_TYPE (pack
);
16471 int i
, len
= TREE_VEC_LENGTH (new_args
);
16473 bool nondeduced_p
= false;
16475 /* By default keep the original deduced argument pack.
16476 If necessary, more specific code is going to update the
16477 resulting deduced argument later down in this function. */
16478 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
16479 TMPL_ARG (targs
, level
, idx
) = old_pack
;
16481 /* If NEW_ARGS contains any NULL_TREE entries, we didn't
16482 actually deduce anything. */
16483 for (i
= 0; i
< len
&& !nondeduced_p
; ++i
)
16484 if (TREE_VEC_ELT (new_args
, i
) == NULL_TREE
)
16485 nondeduced_p
= true;
16489 if (old_pack
&& ARGUMENT_PACK_INCOMPLETE_P (old_pack
))
16491 /* If we had fewer function args than explicit template args,
16492 just use the explicits. */
16493 tree explicit_args
= ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
);
16494 int explicit_len
= TREE_VEC_LENGTH (explicit_args
);
16495 if (len
< explicit_len
)
16496 new_args
= explicit_args
;
16502 /* Build the deduced *_ARGUMENT_PACK. */
16503 if (TREE_CODE (TREE_PURPOSE (pack
)) == TEMPLATE_PARM_INDEX
)
16505 result
= make_node (NONTYPE_ARGUMENT_PACK
);
16506 TREE_TYPE (result
) =
16507 TREE_TYPE (TEMPLATE_PARM_DECL (TREE_PURPOSE (pack
)));
16508 TREE_CONSTANT (result
) = 1;
16511 result
= cxx_make_type (TYPE_ARGUMENT_PACK
);
16513 SET_ARGUMENT_PACK_ARGS (result
, new_args
);
16515 /* Note the deduced argument packs for this parameter
16517 TMPL_ARG (targs
, level
, idx
) = result
;
16519 else if (ARGUMENT_PACK_INCOMPLETE_P (old_pack
)
16520 && (ARGUMENT_PACK_ARGS (old_pack
)
16521 == ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
)))
16523 /* We only had the explicitly-provided arguments before, but
16524 now we have a complete set of arguments. */
16525 tree explicit_args
= ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
);
16527 SET_ARGUMENT_PACK_ARGS (old_pack
, new_args
);
16528 ARGUMENT_PACK_INCOMPLETE_P (old_pack
) = 1;
16529 ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
) = explicit_args
;
16533 tree bad_old_arg
= NULL_TREE
, bad_new_arg
= NULL_TREE
;
16534 tree old_args
= ARGUMENT_PACK_ARGS (old_pack
);
16536 if (!comp_template_args_with_info (old_args
, new_args
,
16537 &bad_old_arg
, &bad_new_arg
))
16538 /* Inconsistent unification of this parameter pack. */
16539 return unify_parameter_pack_inconsistent (explain_p
,
16545 return unify_success (explain_p
);
16548 /* Deduce the value of template parameters. TPARMS is the (innermost)
16549 set of template parameters to a template. TARGS is the bindings
16550 for those template parameters, as determined thus far; TARGS may
16551 include template arguments for outer levels of template parameters
16552 as well. PARM is a parameter to a template function, or a
16553 subcomponent of that parameter; ARG is the corresponding argument.
16554 This function attempts to match PARM with ARG in a manner
16555 consistent with the existing assignments in TARGS. If more values
16556 are deduced, then TARGS is updated.
16558 Returns 0 if the type deduction succeeds, 1 otherwise. The
16559 parameter STRICT is a bitwise or of the following flags:
16562 Require an exact match between PARM and ARG.
16563 UNIFY_ALLOW_MORE_CV_QUAL:
16564 Allow the deduced ARG to be more cv-qualified (by qualification
16565 conversion) than ARG.
16566 UNIFY_ALLOW_LESS_CV_QUAL:
16567 Allow the deduced ARG to be less cv-qualified than ARG.
16568 UNIFY_ALLOW_DERIVED:
16569 Allow the deduced ARG to be a template base class of ARG,
16570 or a pointer to a template base class of the type pointed to by
16572 UNIFY_ALLOW_INTEGER:
16573 Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX
16574 case for more information.
16575 UNIFY_ALLOW_OUTER_LEVEL:
16576 This is the outermost level of a deduction. Used to determine validity
16577 of qualification conversions. A valid qualification conversion must
16578 have const qualified pointers leading up to the inner type which
16579 requires additional CV quals, except at the outer level, where const
16580 is not required [conv.qual]. It would be normal to set this flag in
16581 addition to setting UNIFY_ALLOW_MORE_CV_QUAL.
16582 UNIFY_ALLOW_OUTER_MORE_CV_QUAL:
16583 This is the outermost level of a deduction, and PARM can be more CV
16584 qualified at this point.
16585 UNIFY_ALLOW_OUTER_LESS_CV_QUAL:
16586 This is the outermost level of a deduction, and PARM can be less CV
16587 qualified at this point. */
16590 unify (tree tparms
, tree targs
, tree parm
, tree arg
, int strict
,
16596 int strict_in
= strict
;
16598 /* I don't think this will do the right thing with respect to types.
16599 But the only case I've seen it in so far has been array bounds, where
16600 signedness is the only information lost, and I think that will be
16602 while (TREE_CODE (parm
) == NOP_EXPR
)
16603 parm
= TREE_OPERAND (parm
, 0);
16605 if (arg
== error_mark_node
)
16606 return unify_invalid (explain_p
);
16607 if (arg
== unknown_type_node
16608 || arg
== init_list_type_node
)
16609 /* We can't deduce anything from this, but we might get all the
16610 template args from other function args. */
16611 return unify_success (explain_p
);
16613 /* If PARM uses template parameters, then we can't bail out here,
16614 even if ARG == PARM, since we won't record unifications for the
16615 template parameters. We might need them if we're trying to
16616 figure out which of two things is more specialized. */
16617 if (arg
== parm
&& !uses_template_parms (parm
))
16618 return unify_success (explain_p
);
16620 /* Handle init lists early, so the rest of the function can assume
16621 we're dealing with a type. */
16622 if (BRACE_ENCLOSED_INITIALIZER_P (arg
))
16626 tree orig_parm
= parm
;
16628 /* Replace T with std::initializer_list<T> for deduction. */
16629 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
16630 && flag_deduce_init_list
)
16631 parm
= listify (parm
);
16633 if (!is_std_init_list (parm
))
16634 /* We can only deduce from an initializer list argument if the
16635 parameter is std::initializer_list; otherwise this is a
16636 non-deduced context. */
16637 return unify_success (explain_p
);
16639 elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (parm
), 0);
16641 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (arg
), i
, elt
)
16643 int elt_strict
= strict
;
16645 if (elt
== error_mark_node
)
16646 return unify_invalid (explain_p
);
16648 if (!BRACE_ENCLOSED_INITIALIZER_P (elt
))
16650 tree type
= TREE_TYPE (elt
);
16651 /* It should only be possible to get here for a call. */
16652 gcc_assert (elt_strict
& UNIFY_ALLOW_OUTER_LEVEL
);
16653 elt_strict
|= maybe_adjust_types_for_deduction
16654 (DEDUCE_CALL
, &elttype
, &type
, elt
);
16658 RECUR_AND_CHECK_FAILURE (tparms
, targs
, elttype
, elt
, elt_strict
,
16662 /* If the std::initializer_list<T> deduction worked, replace the
16663 deduced A with std::initializer_list<A>. */
16664 if (orig_parm
!= parm
)
16666 idx
= TEMPLATE_TYPE_IDX (orig_parm
);
16667 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
16668 targ
= listify (targ
);
16669 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = targ
;
16671 return unify_success (explain_p
);
16674 /* Immediately reject some pairs that won't unify because of
16675 cv-qualification mismatches. */
16676 if (TREE_CODE (arg
) == TREE_CODE (parm
)
16678 /* It is the elements of the array which hold the cv quals of an array
16679 type, and the elements might be template type parms. We'll check
16680 when we recurse. */
16681 && TREE_CODE (arg
) != ARRAY_TYPE
16682 /* We check the cv-qualifiers when unifying with template type
16683 parameters below. We want to allow ARG `const T' to unify with
16684 PARM `T' for example, when computing which of two templates
16685 is more specialized, for example. */
16686 && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
16687 && !check_cv_quals_for_unify (strict_in
, arg
, parm
))
16688 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
16690 if (!(strict
& UNIFY_ALLOW_OUTER_LEVEL
)
16691 && TYPE_P (parm
) && !CP_TYPE_CONST_P (parm
))
16692 strict
&= ~UNIFY_ALLOW_MORE_CV_QUAL
;
16693 strict
&= ~UNIFY_ALLOW_OUTER_LEVEL
;
16694 strict
&= ~UNIFY_ALLOW_DERIVED
;
16695 strict
&= ~UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
16696 strict
&= ~UNIFY_ALLOW_OUTER_LESS_CV_QUAL
;
16698 switch (TREE_CODE (parm
))
16700 case TYPENAME_TYPE
:
16702 case UNBOUND_CLASS_TEMPLATE
:
16703 /* In a type which contains a nested-name-specifier, template
16704 argument values cannot be deduced for template parameters used
16705 within the nested-name-specifier. */
16706 return unify_success (explain_p
);
16708 case TEMPLATE_TYPE_PARM
:
16709 case TEMPLATE_TEMPLATE_PARM
:
16710 case BOUND_TEMPLATE_TEMPLATE_PARM
:
16711 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
16712 if (tparm
== error_mark_node
)
16713 return unify_invalid (explain_p
);
16715 if (TEMPLATE_TYPE_LEVEL (parm
)
16716 != template_decl_level (tparm
))
16717 /* The PARM is not one we're trying to unify. Just check
16718 to see if it matches ARG. */
16720 if (TREE_CODE (arg
) == TREE_CODE (parm
)
16721 && (is_auto (parm
) ? is_auto (arg
)
16722 : same_type_p (parm
, arg
)))
16723 return unify_success (explain_p
);
16725 return unify_type_mismatch (explain_p
, parm
, arg
);
16727 idx
= TEMPLATE_TYPE_IDX (parm
);
16728 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
16729 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, idx
));
16730 if (tparm
== error_mark_node
)
16731 return unify_invalid (explain_p
);
16733 /* Check for mixed types and values. */
16734 if ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
16735 && TREE_CODE (tparm
) != TYPE_DECL
)
16736 || (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
16737 && TREE_CODE (tparm
) != TEMPLATE_DECL
))
16738 gcc_unreachable ();
16740 if (TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
16742 /* ARG must be constructed from a template class or a template
16743 template parameter. */
16744 if (TREE_CODE (arg
) != BOUND_TEMPLATE_TEMPLATE_PARM
16745 && !CLASSTYPE_SPECIALIZATION_OF_PRIMARY_TEMPLATE_P (arg
))
16746 return unify_template_deduction_failure (explain_p
, parm
, arg
);
16749 tree parmvec
= TYPE_TI_ARGS (parm
);
16750 tree argvec
= INNERMOST_TEMPLATE_ARGS (TYPE_TI_ARGS (arg
));
16751 tree full_argvec
= add_to_template_args (targs
, argvec
);
16753 = DECL_INNERMOST_TEMPLATE_PARMS
16754 (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (parm
));
16756 int parm_variadic_p
= 0;
16758 /* The resolution to DR150 makes clear that default
16759 arguments for an N-argument may not be used to bind T
16760 to a template template parameter with fewer than N
16761 parameters. It is not safe to permit the binding of
16762 default arguments as an extension, as that may change
16763 the meaning of a conforming program. Consider:
16765 struct Dense { static const unsigned int dim = 1; };
16767 template <template <typename> class View,
16769 void operator+(float, View<Block> const&);
16771 template <typename Block,
16772 unsigned int Dim = Block::dim>
16773 struct Lvalue_proxy { operator float() const; };
16777 Lvalue_proxy<Dense> p;
16782 Here, if Lvalue_proxy is permitted to bind to View, then
16783 the global operator+ will be used; if they are not, the
16784 Lvalue_proxy will be converted to float. */
16785 if (coerce_template_parms (parm_parms
,
16787 TYPE_TI_TEMPLATE (parm
),
16789 ? tf_warning_or_error
16791 /*require_all_args=*/true,
16792 /*use_default_args=*/false)
16793 == error_mark_node
)
16796 /* Deduce arguments T, i from TT<T> or TT<i>.
16797 We check each element of PARMVEC and ARGVEC individually
16798 rather than the whole TREE_VEC since they can have
16799 different number of elements. */
16801 parmvec
= expand_template_argument_pack (parmvec
);
16802 argvec
= expand_template_argument_pack (argvec
);
16804 len
= TREE_VEC_LENGTH (parmvec
);
16806 /* Check if the parameters end in a pack, making them
16809 && PACK_EXPANSION_P (TREE_VEC_ELT (parmvec
, len
- 1)))
16810 parm_variadic_p
= 1;
16812 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
16813 /* If the template argument list of P contains a pack
16814 expansion that is not the last template argument, the
16815 entire template argument list is a non-deduced
16817 if (PACK_EXPANSION_P (TREE_VEC_ELT (parmvec
, i
)))
16818 return unify_success (explain_p
);
16820 if (TREE_VEC_LENGTH (argvec
) < len
- parm_variadic_p
)
16821 return unify_too_few_arguments (explain_p
,
16822 TREE_VEC_LENGTH (argvec
), len
);
16824 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
16826 RECUR_AND_CHECK_FAILURE (tparms
, targs
,
16827 TREE_VEC_ELT (parmvec
, i
),
16828 TREE_VEC_ELT (argvec
, i
),
16829 UNIFY_ALLOW_NONE
, explain_p
);
16832 if (parm_variadic_p
16833 && unify_pack_expansion (tparms
, targs
,
16836 /*subr=*/true, explain_p
))
16839 arg
= TYPE_TI_TEMPLATE (arg
);
16841 /* Fall through to deduce template name. */
16844 if (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
16845 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
16847 /* Deduce template name TT from TT, TT<>, TT<T> and TT<i>. */
16849 /* Simple cases: Value already set, does match or doesn't. */
16850 if (targ
!= NULL_TREE
&& template_args_equal (targ
, arg
))
16851 return unify_success (explain_p
);
16853 return unify_inconsistency (explain_p
, parm
, targ
, arg
);
16857 /* If PARM is `const T' and ARG is only `int', we don't have
16858 a match unless we are allowing additional qualification.
16859 If ARG is `const int' and PARM is just `T' that's OK;
16860 that binds `const int' to `T'. */
16861 if (!check_cv_quals_for_unify (strict_in
| UNIFY_ALLOW_LESS_CV_QUAL
,
16863 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
16865 /* Consider the case where ARG is `const volatile int' and
16866 PARM is `const T'. Then, T should be `volatile int'. */
16867 arg
= cp_build_qualified_type_real
16868 (arg
, cp_type_quals (arg
) & ~cp_type_quals (parm
), tf_none
);
16869 if (arg
== error_mark_node
)
16870 return unify_invalid (explain_p
);
16872 /* Simple cases: Value already set, does match or doesn't. */
16873 if (targ
!= NULL_TREE
&& same_type_p (targ
, arg
))
16874 return unify_success (explain_p
);
16876 return unify_inconsistency (explain_p
, parm
, targ
, arg
);
16878 /* Make sure that ARG is not a variable-sized array. (Note
16879 that were talking about variable-sized arrays (like
16880 `int[n]'), rather than arrays of unknown size (like
16881 `int[]').) We'll get very confused by such a type since
16882 the bound of the array is not constant, and therefore
16883 not mangleable. Besides, such types are not allowed in
16884 ISO C++, so we can do as we please here. We do allow
16885 them for 'auto' deduction, since that isn't ABI-exposed. */
16886 if (!is_auto (parm
) && variably_modified_type_p (arg
, NULL_TREE
))
16887 return unify_vla_arg (explain_p
, arg
);
16889 /* Strip typedefs as in convert_template_argument. */
16890 arg
= canonicalize_type_argument (arg
, tf_none
);
16893 /* If ARG is a parameter pack or an expansion, we cannot unify
16894 against it unless PARM is also a parameter pack. */
16895 if ((template_parameter_pack_p (arg
) || PACK_EXPANSION_P (arg
))
16896 && !template_parameter_pack_p (parm
))
16897 return unify_parameter_pack_mismatch (explain_p
, parm
, arg
);
16899 /* If the argument deduction results is a METHOD_TYPE,
16900 then there is a problem.
16901 METHOD_TYPE doesn't map to any real C++ type the result of
16902 the deduction can not be of that type. */
16903 if (TREE_CODE (arg
) == METHOD_TYPE
)
16904 return unify_method_type_error (explain_p
, arg
);
16906 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = arg
;
16907 return unify_success (explain_p
);
16909 case TEMPLATE_PARM_INDEX
:
16910 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
16911 if (tparm
== error_mark_node
)
16912 return unify_invalid (explain_p
);
16914 if (TEMPLATE_PARM_LEVEL (parm
)
16915 != template_decl_level (tparm
))
16917 /* The PARM is not one we're trying to unify. Just check
16918 to see if it matches ARG. */
16919 int result
= !(TREE_CODE (arg
) == TREE_CODE (parm
)
16920 && cp_tree_equal (parm
, arg
));
16922 unify_expression_unequal (explain_p
, parm
, arg
);
16926 idx
= TEMPLATE_PARM_IDX (parm
);
16927 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
16931 int x
= !cp_tree_equal (targ
, arg
);
16933 unify_inconsistency (explain_p
, parm
, targ
, arg
);
16937 /* [temp.deduct.type] If, in the declaration of a function template
16938 with a non-type template-parameter, the non-type
16939 template-parameter is used in an expression in the function
16940 parameter-list and, if the corresponding template-argument is
16941 deduced, the template-argument type shall match the type of the
16942 template-parameter exactly, except that a template-argument
16943 deduced from an array bound may be of any integral type.
16944 The non-type parameter might use already deduced type parameters. */
16945 tparm
= tsubst (TREE_TYPE (parm
), targs
, 0, NULL_TREE
);
16946 if (!TREE_TYPE (arg
))
16947 /* Template-parameter dependent expression. Just accept it for now.
16948 It will later be processed in convert_template_argument. */
16950 else if (same_type_p (TREE_TYPE (arg
), tparm
))
16952 else if ((strict
& UNIFY_ALLOW_INTEGER
)
16953 && CP_INTEGRAL_TYPE_P (tparm
))
16954 /* Convert the ARG to the type of PARM; the deduced non-type
16955 template argument must exactly match the types of the
16956 corresponding parameter. */
16957 arg
= fold (build_nop (tparm
, arg
));
16958 else if (uses_template_parms (tparm
))
16959 /* We haven't deduced the type of this parameter yet. Try again
16961 return unify_success (explain_p
);
16963 return unify_type_mismatch (explain_p
, tparm
, arg
);
16965 /* If ARG is a parameter pack or an expansion, we cannot unify
16966 against it unless PARM is also a parameter pack. */
16967 if ((template_parameter_pack_p (arg
) || PACK_EXPANSION_P (arg
))
16968 && !TEMPLATE_PARM_PARAMETER_PACK (parm
))
16969 return unify_parameter_pack_mismatch (explain_p
, parm
, arg
);
16971 arg
= strip_typedefs_expr (arg
);
16972 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = arg
;
16973 return unify_success (explain_p
);
16977 /* A pointer-to-member constant can be unified only with
16978 another constant. */
16979 if (TREE_CODE (arg
) != PTRMEM_CST
)
16980 return unify_ptrmem_cst_mismatch (explain_p
, parm
, arg
);
16982 /* Just unify the class member. It would be useless (and possibly
16983 wrong, depending on the strict flags) to unify also
16984 PTRMEM_CST_CLASS, because we want to be sure that both parm and
16985 arg refer to the same variable, even if through different
16986 classes. For instance:
16988 struct A { int x; };
16991 Unification of &A::x and &B::x must succeed. */
16992 return unify (tparms
, targs
, PTRMEM_CST_MEMBER (parm
),
16993 PTRMEM_CST_MEMBER (arg
), strict
, explain_p
);
16998 if (!TYPE_PTR_P (arg
))
16999 return unify_type_mismatch (explain_p
, parm
, arg
);
17001 /* [temp.deduct.call]
17003 A can be another pointer or pointer to member type that can
17004 be converted to the deduced A via a qualification
17005 conversion (_conv.qual_).
17007 We pass down STRICT here rather than UNIFY_ALLOW_NONE.
17008 This will allow for additional cv-qualification of the
17009 pointed-to types if appropriate. */
17011 if (TREE_CODE (TREE_TYPE (arg
)) == RECORD_TYPE
)
17012 /* The derived-to-base conversion only persists through one
17013 level of pointers. */
17014 strict
|= (strict_in
& UNIFY_ALLOW_DERIVED
);
17016 return unify (tparms
, targs
, TREE_TYPE (parm
),
17017 TREE_TYPE (arg
), strict
, explain_p
);
17020 case REFERENCE_TYPE
:
17021 if (TREE_CODE (arg
) != REFERENCE_TYPE
)
17022 return unify_type_mismatch (explain_p
, parm
, arg
);
17023 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
17024 strict
& UNIFY_ALLOW_MORE_CV_QUAL
, explain_p
);
17027 if (TREE_CODE (arg
) != ARRAY_TYPE
)
17028 return unify_type_mismatch (explain_p
, parm
, arg
);
17029 if ((TYPE_DOMAIN (parm
) == NULL_TREE
)
17030 != (TYPE_DOMAIN (arg
) == NULL_TREE
))
17031 return unify_type_mismatch (explain_p
, parm
, arg
);
17032 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
17033 strict
& UNIFY_ALLOW_MORE_CV_QUAL
, explain_p
);
17034 if (TYPE_DOMAIN (parm
) != NULL_TREE
)
17041 /* Our representation of array types uses "N - 1" as the
17042 TYPE_MAX_VALUE for an array with "N" elements, if "N" is
17043 not an integer constant. We cannot unify arbitrarily
17044 complex expressions, so we eliminate the MINUS_EXPRs
17046 parm_max
= TYPE_MAX_VALUE (TYPE_DOMAIN (parm
));
17047 parm_cst
= TREE_CODE (parm_max
) == INTEGER_CST
;
17050 gcc_assert (TREE_CODE (parm_max
) == MINUS_EXPR
);
17051 parm_max
= TREE_OPERAND (parm_max
, 0);
17053 arg_max
= TYPE_MAX_VALUE (TYPE_DOMAIN (arg
));
17054 arg_cst
= TREE_CODE (arg_max
) == INTEGER_CST
;
17057 /* The ARG_MAX may not be a simple MINUS_EXPR, if we are
17058 trying to unify the type of a variable with the type
17059 of a template parameter. For example:
17061 template <unsigned int N>
17062 void f (char (&) [N]);
17069 Here, the type of the ARG will be "int [g(i)]", and
17070 may be a SAVE_EXPR, etc. */
17071 if (TREE_CODE (arg_max
) != MINUS_EXPR
)
17072 return unify_vla_arg (explain_p
, arg
);
17073 arg_max
= TREE_OPERAND (arg_max
, 0);
17076 /* If only one of the bounds used a MINUS_EXPR, compensate
17077 by adding one to the other bound. */
17078 if (parm_cst
&& !arg_cst
)
17079 parm_max
= fold_build2_loc (input_location
, PLUS_EXPR
,
17083 else if (arg_cst
&& !parm_cst
)
17084 arg_max
= fold_build2_loc (input_location
, PLUS_EXPR
,
17089 RECUR_AND_CHECK_FAILURE (tparms
, targs
, parm_max
, arg_max
,
17090 UNIFY_ALLOW_INTEGER
, explain_p
);
17092 return unify_success (explain_p
);
17099 case ENUMERAL_TYPE
:
17102 if (TREE_CODE (arg
) != TREE_CODE (parm
))
17103 return unify_type_mismatch (explain_p
, parm
, arg
);
17105 /* We have already checked cv-qualification at the top of the
17107 if (!same_type_ignoring_top_level_qualifiers_p (arg
, parm
))
17108 return unify_type_mismatch (explain_p
, parm
, arg
);
17110 /* As far as unification is concerned, this wins. Later checks
17111 will invalidate it if necessary. */
17112 return unify_success (explain_p
);
17114 /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */
17115 /* Type INTEGER_CST can come from ordinary constant template args. */
17117 while (TREE_CODE (arg
) == NOP_EXPR
)
17118 arg
= TREE_OPERAND (arg
, 0);
17120 if (TREE_CODE (arg
) != INTEGER_CST
)
17121 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
17122 return (tree_int_cst_equal (parm
, arg
)
17123 ? unify_success (explain_p
)
17124 : unify_template_argument_mismatch (explain_p
, parm
, arg
));
17128 int i
, len
, argslen
;
17129 int parm_variadic_p
= 0;
17131 if (TREE_CODE (arg
) != TREE_VEC
)
17132 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
17134 len
= TREE_VEC_LENGTH (parm
);
17135 argslen
= TREE_VEC_LENGTH (arg
);
17137 /* Check for pack expansions in the parameters. */
17138 for (i
= 0; i
< len
; ++i
)
17140 if (PACK_EXPANSION_P (TREE_VEC_ELT (parm
, i
)))
17143 /* We can unify against something with a trailing
17145 parm_variadic_p
= 1;
17147 /* [temp.deduct.type]/9: If the template argument list of
17148 P contains a pack expansion that is not the last
17149 template argument, the entire template argument list
17150 is a non-deduced context. */
17151 return unify_success (explain_p
);
17155 /* If we don't have enough arguments to satisfy the parameters
17156 (not counting the pack expression at the end), or we have
17157 too many arguments for a parameter list that doesn't end in
17158 a pack expression, we can't unify. */
17159 if (parm_variadic_p
17160 ? argslen
< len
- parm_variadic_p
17162 return unify_arity (explain_p
, TREE_VEC_LENGTH (arg
), len
);
17164 /* Unify all of the parameters that precede the (optional)
17165 pack expression. */
17166 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
17168 RECUR_AND_CHECK_FAILURE (tparms
, targs
,
17169 TREE_VEC_ELT (parm
, i
),
17170 TREE_VEC_ELT (arg
, i
),
17171 UNIFY_ALLOW_NONE
, explain_p
);
17173 if (parm_variadic_p
)
17174 return unify_pack_expansion (tparms
, targs
, parm
, arg
,
17176 /*subr=*/true, explain_p
);
17177 return unify_success (explain_p
);
17182 if (TREE_CODE (arg
) != TREE_CODE (parm
))
17183 return unify_type_mismatch (explain_p
, parm
, arg
);
17185 if (TYPE_PTRMEMFUNC_P (parm
))
17187 if (!TYPE_PTRMEMFUNC_P (arg
))
17188 return unify_type_mismatch (explain_p
, parm
, arg
);
17190 return unify (tparms
, targs
,
17191 TYPE_PTRMEMFUNC_FN_TYPE (parm
),
17192 TYPE_PTRMEMFUNC_FN_TYPE (arg
),
17193 strict
, explain_p
);
17196 if (CLASSTYPE_TEMPLATE_INFO (parm
))
17198 tree t
= NULL_TREE
;
17200 if (strict_in
& UNIFY_ALLOW_DERIVED
)
17202 /* First, we try to unify the PARM and ARG directly. */
17203 t
= try_class_unification (tparms
, targs
,
17204 parm
, arg
, explain_p
);
17208 /* Fallback to the special case allowed in
17209 [temp.deduct.call]:
17211 If P is a class, and P has the form
17212 template-id, then A can be a derived class of
17213 the deduced A. Likewise, if P is a pointer to
17214 a class of the form template-id, A can be a
17215 pointer to a derived class pointed to by the
17217 enum template_base_result r
;
17218 r
= get_template_base (tparms
, targs
, parm
, arg
,
17222 return unify_no_common_base (explain_p
, r
, parm
, arg
);
17225 else if (CLASSTYPE_TEMPLATE_INFO (arg
)
17226 && (CLASSTYPE_TI_TEMPLATE (parm
)
17227 == CLASSTYPE_TI_TEMPLATE (arg
)))
17228 /* Perhaps PARM is something like S<U> and ARG is S<int>.
17229 Then, we should unify `int' and `U'. */
17232 /* There's no chance of unification succeeding. */
17233 return unify_type_mismatch (explain_p
, parm
, arg
);
17235 return unify (tparms
, targs
, CLASSTYPE_TI_ARGS (parm
),
17236 CLASSTYPE_TI_ARGS (t
), UNIFY_ALLOW_NONE
, explain_p
);
17238 else if (!same_type_ignoring_top_level_qualifiers_p (parm
, arg
))
17239 return unify_type_mismatch (explain_p
, parm
, arg
);
17240 return unify_success (explain_p
);
17243 case FUNCTION_TYPE
:
17245 unsigned int nargs
;
17250 if (TREE_CODE (arg
) != TREE_CODE (parm
))
17251 return unify_type_mismatch (explain_p
, parm
, arg
);
17253 /* CV qualifications for methods can never be deduced, they must
17254 match exactly. We need to check them explicitly here,
17255 because type_unification_real treats them as any other
17256 cv-qualified parameter. */
17257 if (TREE_CODE (parm
) == METHOD_TYPE
17258 && (!check_cv_quals_for_unify
17260 class_of_this_parm (arg
),
17261 class_of_this_parm (parm
))))
17262 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
17264 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TREE_TYPE (parm
),
17265 TREE_TYPE (arg
), UNIFY_ALLOW_NONE
, explain_p
);
17267 nargs
= list_length (TYPE_ARG_TYPES (arg
));
17268 args
= XALLOCAVEC (tree
, nargs
);
17269 for (a
= TYPE_ARG_TYPES (arg
), i
= 0;
17270 a
!= NULL_TREE
&& a
!= void_list_node
;
17271 a
= TREE_CHAIN (a
), ++i
)
17272 args
[i
] = TREE_VALUE (a
);
17275 return type_unification_real (tparms
, targs
, TYPE_ARG_TYPES (parm
),
17276 args
, nargs
, 1, DEDUCE_EXACT
,
17277 LOOKUP_NORMAL
, explain_p
);
17281 /* Unify a pointer to member with a pointer to member function, which
17282 deduces the type of the member as a function type. */
17283 if (TYPE_PTRMEMFUNC_P (arg
))
17285 /* Check top-level cv qualifiers */
17286 if (!check_cv_quals_for_unify (UNIFY_ALLOW_NONE
, arg
, parm
))
17287 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
17289 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
17290 TYPE_PTRMEMFUNC_OBJECT_TYPE (arg
),
17291 UNIFY_ALLOW_NONE
, explain_p
);
17293 /* Determine the type of the function we are unifying against. */
17294 tree fntype
= static_fn_type (arg
);
17296 return unify (tparms
, targs
, TREE_TYPE (parm
), fntype
, strict
, explain_p
);
17299 if (TREE_CODE (arg
) != OFFSET_TYPE
)
17300 return unify_type_mismatch (explain_p
, parm
, arg
);
17301 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
17302 TYPE_OFFSET_BASETYPE (arg
),
17303 UNIFY_ALLOW_NONE
, explain_p
);
17304 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
17305 strict
, explain_p
);
17308 if (DECL_TEMPLATE_PARM_P (parm
))
17309 return unify (tparms
, targs
, DECL_INITIAL (parm
), arg
, strict
, explain_p
);
17310 if (arg
!= integral_constant_value (parm
))
17311 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
17312 return unify_success (explain_p
);
17315 case TEMPLATE_DECL
:
17316 /* Matched cases are handled by the ARG == PARM test above. */
17317 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
17320 /* A non-type template parameter that is a variable should be a
17321 an integral constant, in which case, it whould have been
17322 folded into its (constant) value. So we should not be getting
17323 a variable here. */
17324 gcc_unreachable ();
17326 case TYPE_ARGUMENT_PACK
:
17327 case NONTYPE_ARGUMENT_PACK
:
17328 return unify (tparms
, targs
, ARGUMENT_PACK_ARGS (parm
),
17329 ARGUMENT_PACK_ARGS (arg
), strict
, explain_p
);
17332 case DECLTYPE_TYPE
:
17333 case UNDERLYING_TYPE
:
17334 /* Cannot deduce anything from TYPEOF_TYPE, DECLTYPE_TYPE,
17335 or UNDERLYING_TYPE nodes. */
17336 return unify_success (explain_p
);
17339 /* Unification fails if we hit an error node. */
17340 return unify_invalid (explain_p
);
17343 /* An unresolved overload is a nondeduced context. */
17344 if (is_overloaded_fn (parm
) || type_unknown_p (parm
))
17345 return unify_success (explain_p
);
17346 gcc_assert (EXPR_P (parm
));
17348 /* We must be looking at an expression. This can happen with
17352 void foo(S<I>, S<I + 2>);
17354 This is a "nondeduced context":
17358 The nondeduced contexts are:
17360 --A type that is a template-id in which one or more of
17361 the template-arguments is an expression that references
17362 a template-parameter.
17364 In these cases, we assume deduction succeeded, but don't
17365 actually infer any unifications. */
17367 if (!uses_template_parms (parm
)
17368 && !template_args_equal (parm
, arg
))
17369 return unify_expression_unequal (explain_p
, parm
, arg
);
17371 return unify_success (explain_p
);
17374 #undef RECUR_AND_CHECK_FAILURE
17376 /* Note that DECL can be defined in this translation unit, if
17380 mark_definable (tree decl
)
17383 DECL_NOT_REALLY_EXTERN (decl
) = 1;
17384 FOR_EACH_CLONE (clone
, decl
)
17385 DECL_NOT_REALLY_EXTERN (clone
) = 1;
17388 /* Called if RESULT is explicitly instantiated, or is a member of an
17389 explicitly instantiated class. */
17392 mark_decl_instantiated (tree result
, int extern_p
)
17394 SET_DECL_EXPLICIT_INSTANTIATION (result
);
17396 /* If this entity has already been written out, it's too late to
17397 make any modifications. */
17398 if (TREE_ASM_WRITTEN (result
))
17401 if (TREE_CODE (result
) != FUNCTION_DECL
)
17402 /* The TREE_PUBLIC flag for function declarations will have been
17403 set correctly by tsubst. */
17404 TREE_PUBLIC (result
) = 1;
17406 /* This might have been set by an earlier implicit instantiation. */
17407 DECL_COMDAT (result
) = 0;
17410 DECL_NOT_REALLY_EXTERN (result
) = 0;
17413 mark_definable (result
);
17414 /* Always make artificials weak. */
17415 if (DECL_ARTIFICIAL (result
) && flag_weak
)
17416 comdat_linkage (result
);
17417 /* For WIN32 we also want to put explicit instantiations in
17418 linkonce sections. */
17419 else if (TREE_PUBLIC (result
))
17420 maybe_make_one_only (result
);
17423 /* If EXTERN_P, then this function will not be emitted -- unless
17424 followed by an explicit instantiation, at which point its linkage
17425 will be adjusted. If !EXTERN_P, then this function will be
17426 emitted here. In neither circumstance do we want
17427 import_export_decl to adjust the linkage. */
17428 DECL_INTERFACE_KNOWN (result
) = 1;
17431 /* Subroutine of more_specialized_fn: check whether TARGS is missing any
17432 important template arguments. If any are missing, we check whether
17433 they're important by using error_mark_node for substituting into any
17434 args that were used for partial ordering (the ones between ARGS and END)
17435 and seeing if it bubbles up. */
17438 check_undeduced_parms (tree targs
, tree args
, tree end
)
17440 bool found
= false;
17442 for (i
= TREE_VEC_LENGTH (targs
) - 1; i
>= 0; --i
)
17443 if (TREE_VEC_ELT (targs
, i
) == NULL_TREE
)
17446 TREE_VEC_ELT (targs
, i
) = error_mark_node
;
17450 tree substed
= tsubst_arg_types (args
, targs
, end
, tf_none
, NULL_TREE
);
17451 if (substed
== error_mark_node
)
17457 /* Given two function templates PAT1 and PAT2, return:
17459 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order].
17460 -1 if PAT2 is more specialized than PAT1.
17461 0 if neither is more specialized.
17463 LEN indicates the number of parameters we should consider
17464 (defaulted parameters should not be considered).
17466 The 1998 std underspecified function template partial ordering, and
17467 DR214 addresses the issue. We take pairs of arguments, one from
17468 each of the templates, and deduce them against each other. One of
17469 the templates will be more specialized if all the *other*
17470 template's arguments deduce against its arguments and at least one
17471 of its arguments *does* *not* deduce against the other template's
17472 corresponding argument. Deduction is done as for class templates.
17473 The arguments used in deduction have reference and top level cv
17474 qualifiers removed. Iff both arguments were originally reference
17475 types *and* deduction succeeds in both directions, the template
17476 with the more cv-qualified argument wins for that pairing (if
17477 neither is more cv-qualified, they both are equal). Unlike regular
17478 deduction, after all the arguments have been deduced in this way,
17479 we do *not* verify the deduced template argument values can be
17480 substituted into non-deduced contexts.
17482 The logic can be a bit confusing here, because we look at deduce1 and
17483 targs1 to see if pat2 is at least as specialized, and vice versa; if we
17484 can find template arguments for pat1 to make arg1 look like arg2, that
17485 means that arg2 is at least as specialized as arg1. */
17488 more_specialized_fn (tree pat1
, tree pat2
, int len
)
17490 tree decl1
= DECL_TEMPLATE_RESULT (pat1
);
17491 tree decl2
= DECL_TEMPLATE_RESULT (pat2
);
17492 tree targs1
= make_tree_vec (DECL_NTPARMS (pat1
));
17493 tree targs2
= make_tree_vec (DECL_NTPARMS (pat2
));
17494 tree tparms1
= DECL_INNERMOST_TEMPLATE_PARMS (pat1
);
17495 tree tparms2
= DECL_INNERMOST_TEMPLATE_PARMS (pat2
);
17496 tree args1
= TYPE_ARG_TYPES (TREE_TYPE (decl1
));
17497 tree args2
= TYPE_ARG_TYPES (TREE_TYPE (decl2
));
17498 tree origs1
, origs2
;
17499 bool lose1
= false;
17500 bool lose2
= false;
17502 /* Remove the this parameter from non-static member functions. If
17503 one is a non-static member function and the other is not a static
17504 member function, remove the first parameter from that function
17505 also. This situation occurs for operator functions where we
17506 locate both a member function (with this pointer) and non-member
17507 operator (with explicit first operand). */
17508 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl1
))
17510 len
--; /* LEN is the number of significant arguments for DECL1 */
17511 args1
= TREE_CHAIN (args1
);
17512 if (!DECL_STATIC_FUNCTION_P (decl2
))
17513 args2
= TREE_CHAIN (args2
);
17515 else if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl2
))
17517 args2
= TREE_CHAIN (args2
);
17518 if (!DECL_STATIC_FUNCTION_P (decl1
))
17521 args1
= TREE_CHAIN (args1
);
17525 /* If only one is a conversion operator, they are unordered. */
17526 if (DECL_CONV_FN_P (decl1
) != DECL_CONV_FN_P (decl2
))
17529 /* Consider the return type for a conversion function */
17530 if (DECL_CONV_FN_P (decl1
))
17532 args1
= tree_cons (NULL_TREE
, TREE_TYPE (TREE_TYPE (decl1
)), args1
);
17533 args2
= tree_cons (NULL_TREE
, TREE_TYPE (TREE_TYPE (decl2
)), args2
);
17537 processing_template_decl
++;
17543 /* Stop when an ellipsis is seen. */
17544 && args1
!= NULL_TREE
&& args2
!= NULL_TREE
)
17546 tree arg1
= TREE_VALUE (args1
);
17547 tree arg2
= TREE_VALUE (args2
);
17548 int deduce1
, deduce2
;
17552 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
17553 && TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
17555 /* When both arguments are pack expansions, we need only
17556 unify the patterns themselves. */
17557 arg1
= PACK_EXPANSION_PATTERN (arg1
);
17558 arg2
= PACK_EXPANSION_PATTERN (arg2
);
17560 /* This is the last comparison we need to do. */
17564 if (TREE_CODE (arg1
) == REFERENCE_TYPE
)
17566 arg1
= TREE_TYPE (arg1
);
17567 quals1
= cp_type_quals (arg1
);
17570 if (TREE_CODE (arg2
) == REFERENCE_TYPE
)
17572 arg2
= TREE_TYPE (arg2
);
17573 quals2
= cp_type_quals (arg2
);
17576 arg1
= TYPE_MAIN_VARIANT (arg1
);
17577 arg2
= TYPE_MAIN_VARIANT (arg2
);
17579 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
)
17581 int i
, len2
= list_length (args2
);
17582 tree parmvec
= make_tree_vec (1);
17583 tree argvec
= make_tree_vec (len2
);
17586 /* Setup the parameter vector, which contains only ARG1. */
17587 TREE_VEC_ELT (parmvec
, 0) = arg1
;
17589 /* Setup the argument vector, which contains the remaining
17591 for (i
= 0; i
< len2
; i
++, ta
= TREE_CHAIN (ta
))
17592 TREE_VEC_ELT (argvec
, i
) = TREE_VALUE (ta
);
17594 deduce1
= (unify_pack_expansion (tparms1
, targs1
, parmvec
,
17595 argvec
, DEDUCE_EXACT
,
17596 /*subr=*/true, /*explain_p=*/false)
17599 /* We cannot deduce in the other direction, because ARG1 is
17600 a pack expansion but ARG2 is not. */
17603 else if (TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
17605 int i
, len1
= list_length (args1
);
17606 tree parmvec
= make_tree_vec (1);
17607 tree argvec
= make_tree_vec (len1
);
17610 /* Setup the parameter vector, which contains only ARG1. */
17611 TREE_VEC_ELT (parmvec
, 0) = arg2
;
17613 /* Setup the argument vector, which contains the remaining
17615 for (i
= 0; i
< len1
; i
++, ta
= TREE_CHAIN (ta
))
17616 TREE_VEC_ELT (argvec
, i
) = TREE_VALUE (ta
);
17618 deduce2
= (unify_pack_expansion (tparms2
, targs2
, parmvec
,
17619 argvec
, DEDUCE_EXACT
,
17620 /*subr=*/true, /*explain_p=*/false)
17623 /* We cannot deduce in the other direction, because ARG2 is
17624 a pack expansion but ARG1 is not.*/
17630 /* The normal case, where neither argument is a pack
17632 deduce1
= (unify (tparms1
, targs1
, arg1
, arg2
,
17633 UNIFY_ALLOW_NONE
, /*explain_p=*/false)
17635 deduce2
= (unify (tparms2
, targs2
, arg2
, arg1
,
17636 UNIFY_ALLOW_NONE
, /*explain_p=*/false)
17640 /* If we couldn't deduce arguments for tparms1 to make arg1 match
17641 arg2, then arg2 is not as specialized as arg1. */
17647 /* "If, for a given type, deduction succeeds in both directions
17648 (i.e., the types are identical after the transformations above)
17649 and if the type from the argument template is more cv-qualified
17650 than the type from the parameter template (as described above)
17651 that type is considered to be more specialized than the other. If
17652 neither type is more cv-qualified than the other then neither type
17653 is more specialized than the other." */
17655 if (deduce1
&& deduce2
17656 && quals1
!= quals2
&& quals1
>= 0 && quals2
>= 0)
17658 if ((quals1
& quals2
) == quals2
)
17660 if ((quals1
& quals2
) == quals1
)
17664 if (lose1
&& lose2
)
17665 /* We've failed to deduce something in either direction.
17666 These must be unordered. */
17669 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
17670 || TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
17671 /* We have already processed all of the arguments in our
17672 handing of the pack expansion type. */
17675 args1
= TREE_CHAIN (args1
);
17676 args2
= TREE_CHAIN (args2
);
17679 /* "In most cases, all template parameters must have values in order for
17680 deduction to succeed, but for partial ordering purposes a template
17681 parameter may remain without a value provided it is not used in the
17682 types being used for partial ordering."
17684 Thus, if we are missing any of the targs1 we need to substitute into
17685 origs1, then pat2 is not as specialized as pat1. This can happen when
17686 there is a nondeduced context. */
17687 if (!lose2
&& check_undeduced_parms (targs1
, origs1
, args1
))
17689 if (!lose1
&& check_undeduced_parms (targs2
, origs2
, args2
))
17692 processing_template_decl
--;
17694 /* All things being equal, if the next argument is a pack expansion
17695 for one function but not for the other, prefer the
17696 non-variadic function. FIXME this is bogus; see c++/41958. */
17698 && args1
&& TREE_VALUE (args1
)
17699 && args2
&& TREE_VALUE (args2
))
17701 lose1
= TREE_CODE (TREE_VALUE (args1
)) == TYPE_PACK_EXPANSION
;
17702 lose2
= TREE_CODE (TREE_VALUE (args2
)) == TYPE_PACK_EXPANSION
;
17705 if (lose1
== lose2
)
17713 /* Determine which of two partial specializations of MAIN_TMPL is more
17716 PAT1 is a TREE_LIST whose TREE_TYPE is the _TYPE node corresponding
17717 to the first partial specialization. The TREE_VALUE is the
17718 innermost set of template parameters for the partial
17719 specialization. PAT2 is similar, but for the second template.
17721 Return 1 if the first partial specialization is more specialized;
17722 -1 if the second is more specialized; 0 if neither is more
17725 See [temp.class.order] for information about determining which of
17726 two templates is more specialized. */
17729 more_specialized_class (tree main_tmpl
, tree pat1
, tree pat2
)
17734 bool any_deductions
= false;
17736 tmpl1
= TREE_TYPE (pat1
);
17737 tmpl2
= TREE_TYPE (pat2
);
17739 /* Just like what happens for functions, if we are ordering between
17740 different class template specializations, we may encounter dependent
17741 types in the arguments, and we need our dependency check functions
17742 to behave correctly. */
17743 ++processing_template_decl
;
17744 targs
= get_class_bindings (main_tmpl
, TREE_VALUE (pat1
),
17745 CLASSTYPE_TI_ARGS (tmpl1
),
17746 CLASSTYPE_TI_ARGS (tmpl2
));
17750 any_deductions
= true;
17753 targs
= get_class_bindings (main_tmpl
, TREE_VALUE (pat2
),
17754 CLASSTYPE_TI_ARGS (tmpl2
),
17755 CLASSTYPE_TI_ARGS (tmpl1
));
17759 any_deductions
= true;
17761 --processing_template_decl
;
17763 /* In the case of a tie where at least one of the class templates
17764 has a parameter pack at the end, the template with the most
17765 non-packed parameters wins. */
17768 && (template_args_variadic_p (TREE_PURPOSE (pat1
))
17769 || template_args_variadic_p (TREE_PURPOSE (pat2
))))
17771 tree args1
= INNERMOST_TEMPLATE_ARGS (TREE_PURPOSE (pat1
));
17772 tree args2
= INNERMOST_TEMPLATE_ARGS (TREE_PURPOSE (pat2
));
17773 int len1
= TREE_VEC_LENGTH (args1
);
17774 int len2
= TREE_VEC_LENGTH (args2
);
17776 /* We don't count the pack expansion at the end. */
17777 if (template_args_variadic_p (TREE_PURPOSE (pat1
)))
17779 if (template_args_variadic_p (TREE_PURPOSE (pat2
)))
17784 else if (len1
< len2
)
17791 /* Return the template arguments that will produce the function signature
17792 DECL from the function template FN, with the explicit template
17793 arguments EXPLICIT_ARGS. If CHECK_RETTYPE is true, the return type must
17794 also match. Return NULL_TREE if no satisfactory arguments could be
17798 get_bindings (tree fn
, tree decl
, tree explicit_args
, bool check_rettype
)
17800 int ntparms
= DECL_NTPARMS (fn
);
17801 tree targs
= make_tree_vec (ntparms
);
17802 tree decl_type
= TREE_TYPE (decl
);
17803 tree decl_arg_types
;
17805 unsigned int nargs
, ix
;
17808 gcc_assert (decl
!= DECL_TEMPLATE_RESULT (fn
));
17810 /* Never do unification on the 'this' parameter. */
17811 decl_arg_types
= skip_artificial_parms_for (decl
,
17812 TYPE_ARG_TYPES (decl_type
));
17814 nargs
= list_length (decl_arg_types
);
17815 args
= XALLOCAVEC (tree
, nargs
);
17816 for (arg
= decl_arg_types
, ix
= 0;
17817 arg
!= NULL_TREE
&& arg
!= void_list_node
;
17818 arg
= TREE_CHAIN (arg
), ++ix
)
17819 args
[ix
] = TREE_VALUE (arg
);
17821 if (fn_type_unification (fn
, explicit_args
, targs
,
17823 (check_rettype
|| DECL_CONV_FN_P (fn
)
17824 ? TREE_TYPE (decl_type
) : NULL_TREE
),
17825 DEDUCE_EXACT
, LOOKUP_NORMAL
, /*explain_p=*/false,
17827 == error_mark_node
)
17833 /* Return the innermost template arguments that, when applied to a partial
17834 specialization of MAIN_TMPL whose innermost template parameters are
17835 TPARMS, and whose specialization arguments are SPEC_ARGS, yield the
17838 For example, suppose we have:
17840 template <class T, class U> struct S {};
17841 template <class T> struct S<T*, int> {};
17843 Then, suppose we want to get `S<double*, int>'. The TPARMS will be
17844 {T}, the SPEC_ARGS will be {T*, int} and the ARGS will be {double*,
17845 int}. The resulting vector will be {double}, indicating that `T'
17846 is bound to `double'. */
17849 get_class_bindings (tree main_tmpl
, tree tparms
, tree spec_args
, tree args
)
17851 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
17853 tree innermost_deduced_args
;
17855 innermost_deduced_args
= make_tree_vec (ntparms
);
17856 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
17858 deduced_args
= copy_node (args
);
17859 SET_TMPL_ARGS_LEVEL (deduced_args
,
17860 TMPL_ARGS_DEPTH (deduced_args
),
17861 innermost_deduced_args
);
17864 deduced_args
= innermost_deduced_args
;
17866 if (unify (tparms
, deduced_args
,
17867 INNERMOST_TEMPLATE_ARGS (spec_args
),
17868 INNERMOST_TEMPLATE_ARGS (args
),
17869 UNIFY_ALLOW_NONE
, /*explain_p=*/false))
17872 for (i
= 0; i
< ntparms
; ++i
)
17873 if (! TREE_VEC_ELT (innermost_deduced_args
, i
))
17876 /* Verify that nondeduced template arguments agree with the type
17877 obtained from argument deduction.
17881 struct A { typedef int X; };
17882 template <class T, class U> struct C {};
17883 template <class T> struct C<T, typename T::X> {};
17885 Then with the instantiation `C<A, int>', we can deduce that
17886 `T' is `A' but unify () does not check whether `typename T::X'
17888 spec_args
= tsubst (spec_args
, deduced_args
, tf_none
, NULL_TREE
);
17889 spec_args
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (main_tmpl
),
17890 spec_args
, main_tmpl
,
17891 tf_none
, false, false);
17892 if (spec_args
== error_mark_node
17893 /* We only need to check the innermost arguments; the other
17894 arguments will always agree. */
17895 || !comp_template_args (INNERMOST_TEMPLATE_ARGS (spec_args
),
17896 INNERMOST_TEMPLATE_ARGS (args
)))
17899 /* Now that we have bindings for all of the template arguments,
17900 ensure that the arguments deduced for the template template
17901 parameters have compatible template parameter lists. See the use
17902 of template_template_parm_bindings_ok_p in fn_type_unification
17903 for more information. */
17904 if (!template_template_parm_bindings_ok_p (tparms
, deduced_args
))
17907 return deduced_args
;
17910 /* TEMPLATES is a TREE_LIST. Each TREE_VALUE is a TEMPLATE_DECL.
17911 Return the TREE_LIST node with the most specialized template, if
17912 any. If there is no most specialized template, the error_mark_node
17915 Note that this function does not look at, or modify, the
17916 TREE_PURPOSE or TREE_TYPE of any of the nodes. Since the node
17917 returned is one of the elements of INSTANTIATIONS, callers may
17918 store information in the TREE_PURPOSE or TREE_TYPE of the nodes,
17919 and retrieve it from the value returned. */
17922 most_specialized_instantiation (tree templates
)
17926 ++processing_template_decl
;
17929 for (fn
= TREE_CHAIN (templates
); fn
; fn
= TREE_CHAIN (fn
))
17933 if (get_bindings (TREE_VALUE (champ
),
17934 DECL_TEMPLATE_RESULT (TREE_VALUE (fn
)),
17935 NULL_TREE
, /*check_ret=*/true))
17938 if (get_bindings (TREE_VALUE (fn
),
17939 DECL_TEMPLATE_RESULT (TREE_VALUE (champ
)),
17940 NULL_TREE
, /*check_ret=*/true))
17947 /* Equally specialized, move to next function. If there
17948 is no next function, nothing's most specialized. */
17949 fn
= TREE_CHAIN (fn
);
17957 /* Now verify that champ is better than everything earlier in the
17958 instantiation list. */
17959 for (fn
= templates
; fn
!= champ
; fn
= TREE_CHAIN (fn
))
17960 if (get_bindings (TREE_VALUE (champ
),
17961 DECL_TEMPLATE_RESULT (TREE_VALUE (fn
)),
17962 NULL_TREE
, /*check_ret=*/true)
17963 || !get_bindings (TREE_VALUE (fn
),
17964 DECL_TEMPLATE_RESULT (TREE_VALUE (champ
)),
17965 NULL_TREE
, /*check_ret=*/true))
17971 processing_template_decl
--;
17974 return error_mark_node
;
17979 /* If DECL is a specialization of some template, return the most
17980 general such template. Otherwise, returns NULL_TREE.
17982 For example, given:
17984 template <class T> struct S { template <class U> void f(U); };
17986 if TMPL is `template <class U> void S<int>::f(U)' this will return
17987 the full template. This function will not trace past partial
17988 specializations, however. For example, given in addition:
17990 template <class T> struct S<T*> { template <class U> void f(U); };
17992 if TMPL is `template <class U> void S<int*>::f(U)' this will return
17993 `template <class T> template <class U> S<T*>::f(U)'. */
17996 most_general_template (tree decl
)
17998 /* If DECL is a FUNCTION_DECL, find the TEMPLATE_DECL of which it is
17999 an immediate specialization. */
18000 if (TREE_CODE (decl
) == FUNCTION_DECL
)
18002 if (DECL_TEMPLATE_INFO (decl
)) {
18003 decl
= DECL_TI_TEMPLATE (decl
);
18005 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE for a
18006 template friend. */
18007 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
18013 /* Look for more and more general templates. */
18014 while (DECL_TEMPLATE_INFO (decl
))
18016 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE in some cases.
18017 (See cp-tree.h for details.) */
18018 if (TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
18021 if (CLASS_TYPE_P (TREE_TYPE (decl
))
18022 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)))
18025 /* Stop if we run into an explicitly specialized class template. */
18026 if (!DECL_NAMESPACE_SCOPE_P (decl
)
18027 && DECL_CONTEXT (decl
)
18028 && CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (decl
)))
18031 decl
= DECL_TI_TEMPLATE (decl
);
18037 /* Return the most specialized of the class template partial
18038 specializations of TMPL which can produce TYPE, a specialization of
18039 TMPL. The value returned is actually a TREE_LIST; the TREE_TYPE is
18040 a _TYPE node corresponding to the partial specialization, while the
18041 TREE_PURPOSE is the set of template arguments that must be
18042 substituted into the TREE_TYPE in order to generate TYPE.
18044 If the choice of partial specialization is ambiguous, a diagnostic
18045 is issued, and the error_mark_node is returned. If there are no
18046 partial specializations of TMPL matching TYPE, then NULL_TREE is
18050 most_specialized_class (tree type
, tree tmpl
, tsubst_flags_t complain
)
18052 tree list
= NULL_TREE
;
18058 tree outer_args
= NULL_TREE
;
18060 tmpl
= most_general_template (tmpl
);
18061 args
= CLASSTYPE_TI_ARGS (type
);
18063 /* For determining which partial specialization to use, only the
18064 innermost args are interesting. */
18065 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
18067 outer_args
= strip_innermost_template_args (args
, 1);
18068 args
= INNERMOST_TEMPLATE_ARGS (args
);
18071 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
); t
; t
= TREE_CHAIN (t
))
18073 tree partial_spec_args
;
18075 tree parms
= TREE_VALUE (t
);
18077 partial_spec_args
= CLASSTYPE_TI_ARGS (TREE_TYPE (t
));
18079 ++processing_template_decl
;
18085 /* Discard the outer levels of args, and then substitute in the
18086 template args from the enclosing class. */
18087 partial_spec_args
= INNERMOST_TEMPLATE_ARGS (partial_spec_args
);
18088 partial_spec_args
= tsubst_template_args
18089 (partial_spec_args
, outer_args
, tf_none
, NULL_TREE
);
18091 /* PARMS already refers to just the innermost parms, but the
18092 template parms in partial_spec_args had their levels lowered
18093 by tsubst, so we need to do the same for the parm list. We
18094 can't just tsubst the TREE_VEC itself, as tsubst wants to
18095 treat a TREE_VEC as an argument vector. */
18096 parms
= copy_node (parms
);
18097 for (i
= TREE_VEC_LENGTH (parms
) - 1; i
>= 0; --i
)
18098 TREE_VEC_ELT (parms
, i
) =
18099 tsubst (TREE_VEC_ELT (parms
, i
), outer_args
, tf_none
, NULL_TREE
);
18103 partial_spec_args
=
18104 coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
18105 add_to_template_args (outer_args
,
18106 partial_spec_args
),
18108 /*require_all_args=*/true,
18109 /*use_default_args=*/true);
18111 --processing_template_decl
;
18113 if (partial_spec_args
== error_mark_node
)
18114 return error_mark_node
;
18116 spec_args
= get_class_bindings (tmpl
, parms
,
18122 spec_args
= add_to_template_args (outer_args
, spec_args
);
18123 list
= tree_cons (spec_args
, TREE_VALUE (t
), list
);
18124 TREE_TYPE (list
) = TREE_TYPE (t
);
18131 ambiguous_p
= false;
18134 t
= TREE_CHAIN (t
);
18135 for (; t
; t
= TREE_CHAIN (t
))
18137 fate
= more_specialized_class (tmpl
, champ
, t
);
18144 t
= TREE_CHAIN (t
);
18147 ambiguous_p
= true;
18156 for (t
= list
; t
&& t
!= champ
; t
= TREE_CHAIN (t
))
18158 fate
= more_specialized_class (tmpl
, champ
, t
);
18161 ambiguous_p
= true;
18169 char *spaces
= NULL
;
18170 if (!(complain
& tf_error
))
18171 return error_mark_node
;
18172 error ("ambiguous class template instantiation for %q#T", type
);
18173 str
= ngettext ("candidate is:", "candidates are:", list_length (list
));
18174 for (t
= list
; t
; t
= TREE_CHAIN (t
))
18176 error ("%s %+#T", spaces
? spaces
: str
, TREE_TYPE (t
));
18177 spaces
= spaces
? spaces
: get_spaces (str
);
18180 return error_mark_node
;
18186 /* Explicitly instantiate DECL. */
18189 do_decl_instantiation (tree decl
, tree storage
)
18191 tree result
= NULL_TREE
;
18194 if (!decl
|| decl
== error_mark_node
)
18195 /* An error occurred, for which grokdeclarator has already issued
18196 an appropriate message. */
18198 else if (! DECL_LANG_SPECIFIC (decl
))
18200 error ("explicit instantiation of non-template %q#D", decl
);
18203 else if (VAR_P (decl
))
18205 /* There is an asymmetry here in the way VAR_DECLs and
18206 FUNCTION_DECLs are handled by grokdeclarator. In the case of
18207 the latter, the DECL we get back will be marked as a
18208 template instantiation, and the appropriate
18209 DECL_TEMPLATE_INFO will be set up. This does not happen for
18210 VAR_DECLs so we do the lookup here. Probably, grokdeclarator
18211 should handle VAR_DECLs as it currently handles
18213 if (!DECL_CLASS_SCOPE_P (decl
))
18215 error ("%qD is not a static data member of a class template", decl
);
18218 result
= lookup_field (DECL_CONTEXT (decl
), DECL_NAME (decl
), 0, false);
18219 if (!result
|| !VAR_P (result
))
18221 error ("no matching template for %qD found", decl
);
18224 if (!same_type_p (TREE_TYPE (result
), TREE_TYPE (decl
)))
18226 error ("type %qT for explicit instantiation %qD does not match "
18227 "declared type %qT", TREE_TYPE (result
), decl
,
18232 else if (TREE_CODE (decl
) != FUNCTION_DECL
)
18234 error ("explicit instantiation of %q#D", decl
);
18240 /* Check for various error cases. Note that if the explicit
18241 instantiation is valid the RESULT will currently be marked as an
18242 *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set
18243 until we get here. */
18245 if (DECL_TEMPLATE_SPECIALIZATION (result
))
18247 /* DR 259 [temp.spec].
18249 Both an explicit instantiation and a declaration of an explicit
18250 specialization shall not appear in a program unless the explicit
18251 instantiation follows a declaration of the explicit specialization.
18253 For a given set of template parameters, if an explicit
18254 instantiation of a template appears after a declaration of an
18255 explicit specialization for that template, the explicit
18256 instantiation has no effect. */
18259 else if (DECL_EXPLICIT_INSTANTIATION (result
))
18263 No program shall explicitly instantiate any template more
18266 We check DECL_NOT_REALLY_EXTERN so as not to complain when
18267 the first instantiation was `extern' and the second is not,
18268 and EXTERN_P for the opposite case. */
18269 if (DECL_NOT_REALLY_EXTERN (result
) && !extern_p
)
18270 permerror (input_location
, "duplicate explicit instantiation of %q#D", result
);
18271 /* If an "extern" explicit instantiation follows an ordinary
18272 explicit instantiation, the template is instantiated. */
18276 else if (!DECL_IMPLICIT_INSTANTIATION (result
))
18278 error ("no matching template for %qD found", result
);
18281 else if (!DECL_TEMPLATE_INFO (result
))
18283 permerror (input_location
, "explicit instantiation of non-template %q#D", result
);
18287 if (storage
== NULL_TREE
)
18289 else if (storage
== ridpointers
[(int) RID_EXTERN
])
18291 if (!in_system_header
&& (cxx_dialect
== cxx98
))
18292 pedwarn (input_location
, OPT_Wpedantic
,
18293 "ISO C++ 1998 forbids the use of %<extern%> on explicit "
18298 error ("storage class %qD applied to template instantiation", storage
);
18300 check_explicit_instantiation_namespace (result
);
18301 mark_decl_instantiated (result
, extern_p
);
18303 instantiate_decl (result
, /*defer_ok=*/1,
18304 /*expl_inst_class_mem_p=*/false);
18308 mark_class_instantiated (tree t
, int extern_p
)
18310 SET_CLASSTYPE_EXPLICIT_INSTANTIATION (t
);
18311 SET_CLASSTYPE_INTERFACE_KNOWN (t
);
18312 CLASSTYPE_INTERFACE_ONLY (t
) = extern_p
;
18313 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (t
)) = extern_p
;
18316 CLASSTYPE_DEBUG_REQUESTED (t
) = 1;
18317 rest_of_type_compilation (t
, 1);
18321 /* Called from do_type_instantiation through binding_table_foreach to
18322 do recursive instantiation for the type bound in ENTRY. */
18324 bt_instantiate_type_proc (binding_entry entry
, void *data
)
18326 tree storage
= *(tree
*) data
;
18328 if (MAYBE_CLASS_TYPE_P (entry
->type
)
18329 && !uses_template_parms (CLASSTYPE_TI_ARGS (entry
->type
)))
18330 do_type_instantiation (TYPE_MAIN_DECL (entry
->type
), storage
, 0);
18333 /* Called from do_type_instantiation to instantiate a member
18334 (a member function or a static member variable) of an
18335 explicitly instantiated class template. */
18337 instantiate_class_member (tree decl
, int extern_p
)
18339 mark_decl_instantiated (decl
, extern_p
);
18341 instantiate_decl (decl
, /*defer_ok=*/1,
18342 /*expl_inst_class_mem_p=*/true);
18345 /* Perform an explicit instantiation of template class T. STORAGE, if
18346 non-null, is the RID for extern, inline or static. COMPLAIN is
18347 nonzero if this is called from the parser, zero if called recursively,
18348 since the standard is unclear (as detailed below). */
18351 do_type_instantiation (tree t
, tree storage
, tsubst_flags_t complain
)
18356 int previous_instantiation_extern_p
= 0;
18358 if (TREE_CODE (t
) == TYPE_DECL
)
18361 if (! CLASS_TYPE_P (t
) || ! CLASSTYPE_TEMPLATE_INFO (t
))
18364 (TYPE_TEMPLATE_INFO (t
)) ? TYPE_TI_TEMPLATE (t
) : NULL
;
18366 error ("explicit instantiation of non-class template %qD", tmpl
);
18368 error ("explicit instantiation of non-template type %qT", t
);
18374 if (!COMPLETE_TYPE_P (t
))
18376 if (complain
& tf_error
)
18377 error ("explicit instantiation of %q#T before definition of template",
18382 if (storage
!= NULL_TREE
)
18384 if (!in_system_header
)
18386 if (storage
== ridpointers
[(int) RID_EXTERN
])
18388 if (cxx_dialect
== cxx98
)
18389 pedwarn (input_location
, OPT_Wpedantic
,
18390 "ISO C++ 1998 forbids the use of %<extern%> on "
18391 "explicit instantiations");
18394 pedwarn (input_location
, OPT_Wpedantic
,
18395 "ISO C++ forbids the use of %qE"
18396 " on explicit instantiations", storage
);
18399 if (storage
== ridpointers
[(int) RID_INLINE
])
18401 else if (storage
== ridpointers
[(int) RID_EXTERN
])
18403 else if (storage
== ridpointers
[(int) RID_STATIC
])
18407 error ("storage class %qD applied to template instantiation",
18413 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
18415 /* DR 259 [temp.spec].
18417 Both an explicit instantiation and a declaration of an explicit
18418 specialization shall not appear in a program unless the explicit
18419 instantiation follows a declaration of the explicit specialization.
18421 For a given set of template parameters, if an explicit
18422 instantiation of a template appears after a declaration of an
18423 explicit specialization for that template, the explicit
18424 instantiation has no effect. */
18427 else if (CLASSTYPE_EXPLICIT_INSTANTIATION (t
))
18431 No program shall explicitly instantiate any template more
18434 If PREVIOUS_INSTANTIATION_EXTERN_P, then the first explicit
18435 instantiation was `extern'. If EXTERN_P then the second is.
18436 These cases are OK. */
18437 previous_instantiation_extern_p
= CLASSTYPE_INTERFACE_ONLY (t
);
18439 if (!previous_instantiation_extern_p
&& !extern_p
18440 && (complain
& tf_error
))
18441 permerror (input_location
, "duplicate explicit instantiation of %q#T", t
);
18443 /* If we've already instantiated the template, just return now. */
18444 if (!CLASSTYPE_INTERFACE_ONLY (t
))
18448 check_explicit_instantiation_namespace (TYPE_NAME (t
));
18449 mark_class_instantiated (t
, extern_p
);
18457 /* In contrast to implicit instantiation, where only the
18458 declarations, and not the definitions, of members are
18459 instantiated, we have here:
18463 The explicit instantiation of a class template specialization
18464 implies the instantiation of all of its members not
18465 previously explicitly specialized in the translation unit
18466 containing the explicit instantiation.
18468 Of course, we can't instantiate member template classes, since
18469 we don't have any arguments for them. Note that the standard
18470 is unclear on whether the instantiation of the members are
18471 *explicit* instantiations or not. However, the most natural
18472 interpretation is that it should be an explicit instantiation. */
18475 for (tmp
= TYPE_METHODS (t
); tmp
; tmp
= DECL_CHAIN (tmp
))
18476 if (TREE_CODE (tmp
) == FUNCTION_DECL
18477 && DECL_TEMPLATE_INSTANTIATION (tmp
))
18478 instantiate_class_member (tmp
, extern_p
);
18480 for (tmp
= TYPE_FIELDS (t
); tmp
; tmp
= DECL_CHAIN (tmp
))
18481 if (VAR_P (tmp
) && DECL_TEMPLATE_INSTANTIATION (tmp
))
18482 instantiate_class_member (tmp
, extern_p
);
18484 if (CLASSTYPE_NESTED_UTDS (t
))
18485 binding_table_foreach (CLASSTYPE_NESTED_UTDS (t
),
18486 bt_instantiate_type_proc
, &storage
);
18490 /* Given a function DECL, which is a specialization of TMPL, modify
18491 DECL to be a re-instantiation of TMPL with the same template
18492 arguments. TMPL should be the template into which tsubst'ing
18493 should occur for DECL, not the most general template.
18495 One reason for doing this is a scenario like this:
18498 void f(const T&, int i);
18500 void g() { f(3, 7); }
18503 void f(const T& t, const int i) { }
18505 Note that when the template is first instantiated, with
18506 instantiate_template, the resulting DECL will have no name for the
18507 first parameter, and the wrong type for the second. So, when we go
18508 to instantiate the DECL, we regenerate it. */
18511 regenerate_decl_from_template (tree decl
, tree tmpl
)
18513 /* The arguments used to instantiate DECL, from the most general
18518 args
= DECL_TI_ARGS (decl
);
18519 code_pattern
= DECL_TEMPLATE_RESULT (tmpl
);
18521 /* Make sure that we can see identifiers, and compute access
18523 push_access_scope (decl
);
18525 if (TREE_CODE (decl
) == FUNCTION_DECL
)
18533 args_depth
= TMPL_ARGS_DEPTH (args
);
18534 parms_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
18535 if (args_depth
> parms_depth
)
18536 args
= get_innermost_template_args (args
, parms_depth
);
18538 specs
= tsubst_exception_specification (TREE_TYPE (code_pattern
),
18539 args
, tf_error
, NULL_TREE
,
18540 /*defer_ok*/false);
18541 if (specs
&& specs
!= error_mark_node
)
18542 TREE_TYPE (decl
) = build_exception_variant (TREE_TYPE (decl
),
18545 /* Merge parameter declarations. */
18546 decl_parm
= skip_artificial_parms_for (decl
,
18547 DECL_ARGUMENTS (decl
));
18549 = skip_artificial_parms_for (code_pattern
,
18550 DECL_ARGUMENTS (code_pattern
));
18551 while (decl_parm
&& !FUNCTION_PARAMETER_PACK_P (pattern_parm
))
18556 if (DECL_NAME (decl_parm
) != DECL_NAME (pattern_parm
))
18557 DECL_NAME (decl_parm
) = DECL_NAME (pattern_parm
);
18558 parm_type
= tsubst (TREE_TYPE (pattern_parm
), args
, tf_error
,
18560 parm_type
= type_decays_to (parm_type
);
18561 if (!same_type_p (TREE_TYPE (decl_parm
), parm_type
))
18562 TREE_TYPE (decl_parm
) = parm_type
;
18563 attributes
= DECL_ATTRIBUTES (pattern_parm
);
18564 if (DECL_ATTRIBUTES (decl_parm
) != attributes
)
18566 DECL_ATTRIBUTES (decl_parm
) = attributes
;
18567 cplus_decl_attributes (&decl_parm
, attributes
, /*flags=*/0);
18569 decl_parm
= DECL_CHAIN (decl_parm
);
18570 pattern_parm
= DECL_CHAIN (pattern_parm
);
18572 /* Merge any parameters that match with the function parameter
18574 if (pattern_parm
&& FUNCTION_PARAMETER_PACK_P (pattern_parm
))
18577 tree expanded_types
;
18578 /* Expand the TYPE_PACK_EXPANSION that provides the types for
18579 the parameters in this function parameter pack. */
18580 expanded_types
= tsubst_pack_expansion (TREE_TYPE (pattern_parm
),
18581 args
, tf_error
, NULL_TREE
);
18582 len
= TREE_VEC_LENGTH (expanded_types
);
18583 for (i
= 0; i
< len
; i
++)
18588 if (DECL_NAME (decl_parm
) != DECL_NAME (pattern_parm
))
18589 /* Rename the parameter to include the index. */
18590 DECL_NAME (decl_parm
) =
18591 make_ith_pack_parameter_name (DECL_NAME (pattern_parm
), i
);
18592 parm_type
= TREE_VEC_ELT (expanded_types
, i
);
18593 parm_type
= type_decays_to (parm_type
);
18594 if (!same_type_p (TREE_TYPE (decl_parm
), parm_type
))
18595 TREE_TYPE (decl_parm
) = parm_type
;
18596 attributes
= DECL_ATTRIBUTES (pattern_parm
);
18597 if (DECL_ATTRIBUTES (decl_parm
) != attributes
)
18599 DECL_ATTRIBUTES (decl_parm
) = attributes
;
18600 cplus_decl_attributes (&decl_parm
, attributes
, /*flags=*/0);
18602 decl_parm
= DECL_CHAIN (decl_parm
);
18605 /* Merge additional specifiers from the CODE_PATTERN. */
18606 if (DECL_DECLARED_INLINE_P (code_pattern
)
18607 && !DECL_DECLARED_INLINE_P (decl
))
18608 DECL_DECLARED_INLINE_P (decl
) = 1;
18610 else if (VAR_P (decl
))
18612 DECL_INITIAL (decl
) =
18613 tsubst_expr (DECL_INITIAL (code_pattern
), args
,
18614 tf_error
, DECL_TI_TEMPLATE (decl
),
18615 /*integral_constant_expression_p=*/false);
18616 if (VAR_HAD_UNKNOWN_BOUND (decl
))
18617 TREE_TYPE (decl
) = tsubst (TREE_TYPE (code_pattern
), args
,
18618 tf_error
, DECL_TI_TEMPLATE (decl
));
18621 gcc_unreachable ();
18623 pop_access_scope (decl
);
18626 /* Return the TEMPLATE_DECL into which DECL_TI_ARGS(DECL) should be
18627 substituted to get DECL. */
18630 template_for_substitution (tree decl
)
18632 tree tmpl
= DECL_TI_TEMPLATE (decl
);
18634 /* Set TMPL to the template whose DECL_TEMPLATE_RESULT is the pattern
18635 for the instantiation. This is not always the most general
18636 template. Consider, for example:
18639 struct S { template <class U> void f();
18640 template <> void f<int>(); };
18642 and an instantiation of S<double>::f<int>. We want TD to be the
18643 specialization S<T>::f<int>, not the more general S<T>::f<U>. */
18644 while (/* An instantiation cannot have a definition, so we need a
18645 more general template. */
18646 DECL_TEMPLATE_INSTANTIATION (tmpl
)
18647 /* We must also deal with friend templates. Given:
18649 template <class T> struct S {
18650 template <class U> friend void f() {};
18653 S<int>::f<U> say, is not an instantiation of S<T>::f<U>,
18654 so far as the language is concerned, but that's still
18655 where we get the pattern for the instantiation from. On
18656 other hand, if the definition comes outside the class, say:
18658 template <class T> struct S {
18659 template <class U> friend void f();
18661 template <class U> friend void f() {}
18663 we don't need to look any further. That's what the check for
18664 DECL_INITIAL is for. */
18665 || (TREE_CODE (decl
) == FUNCTION_DECL
18666 && DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (tmpl
)
18667 && !DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl
))))
18669 /* The present template, TD, should not be a definition. If it
18670 were a definition, we should be using it! Note that we
18671 cannot restructure the loop to just keep going until we find
18672 a template with a definition, since that might go too far if
18673 a specialization was declared, but not defined. */
18674 gcc_assert (!VAR_P (decl
)
18675 || DECL_IN_AGGR_P (DECL_TEMPLATE_RESULT (tmpl
)));
18677 /* Fetch the more general template. */
18678 tmpl
= DECL_TI_TEMPLATE (tmpl
);
18684 /* Returns true if we need to instantiate this template instance even if we
18685 know we aren't going to emit it.. */
18688 always_instantiate_p (tree decl
)
18690 /* We always instantiate inline functions so that we can inline them. An
18691 explicit instantiation declaration prohibits implicit instantiation of
18692 non-inline functions. With high levels of optimization, we would
18693 normally inline non-inline functions -- but we're not allowed to do
18694 that for "extern template" functions. Therefore, we check
18695 DECL_DECLARED_INLINE_P, rather than possibly_inlined_p. */
18696 return ((TREE_CODE (decl
) == FUNCTION_DECL
18697 && (DECL_DECLARED_INLINE_P (decl
)
18698 || type_uses_auto (TREE_TYPE (TREE_TYPE (decl
)))))
18699 /* And we need to instantiate static data members so that
18700 their initializers are available in integral constant
18703 && decl_maybe_constant_var_p (decl
)));
18706 /* If FN has a noexcept-specifier that hasn't been instantiated yet,
18707 instantiate it now, modifying TREE_TYPE (fn). */
18710 maybe_instantiate_noexcept (tree fn
)
18712 tree fntype
, spec
, noex
, clone
;
18714 if (DECL_CLONED_FUNCTION_P (fn
))
18715 fn
= DECL_CLONED_FUNCTION (fn
);
18716 fntype
= TREE_TYPE (fn
);
18717 spec
= TYPE_RAISES_EXCEPTIONS (fntype
);
18719 if (!DEFERRED_NOEXCEPT_SPEC_P (spec
))
18722 noex
= TREE_PURPOSE (spec
);
18724 if (TREE_CODE (noex
) == DEFERRED_NOEXCEPT
)
18726 if (push_tinst_level (fn
))
18728 push_access_scope (fn
);
18729 push_deferring_access_checks (dk_no_deferred
);
18730 input_location
= DECL_SOURCE_LOCATION (fn
);
18731 noex
= tsubst_copy_and_build (DEFERRED_NOEXCEPT_PATTERN (noex
),
18732 DEFERRED_NOEXCEPT_ARGS (noex
),
18733 tf_warning_or_error
, fn
,
18734 /*function_p=*/false,
18735 /*integral_constant_expression_p=*/true);
18736 pop_deferring_access_checks ();
18737 pop_access_scope (fn
);
18738 pop_tinst_level ();
18739 spec
= build_noexcept_spec (noex
, tf_warning_or_error
);
18740 if (spec
== error_mark_node
)
18741 spec
= noexcept_false_spec
;
18744 spec
= noexcept_false_spec
;
18748 /* This is an implicitly declared function, so NOEX is a list of
18749 other functions to evaluate and merge. */
18751 spec
= noexcept_true_spec
;
18752 for (elt
= noex
; elt
; elt
= OVL_NEXT (elt
))
18754 tree fn
= OVL_CURRENT (elt
);
18756 maybe_instantiate_noexcept (fn
);
18757 subspec
= TYPE_RAISES_EXCEPTIONS (TREE_TYPE (fn
));
18758 spec
= merge_exception_specifiers (spec
, subspec
, NULL_TREE
);
18762 TREE_TYPE (fn
) = build_exception_variant (fntype
, spec
);
18764 FOR_EACH_CLONE (clone
, fn
)
18766 if (TREE_TYPE (clone
) == fntype
)
18767 TREE_TYPE (clone
) = TREE_TYPE (fn
);
18769 TREE_TYPE (clone
) = build_exception_variant (TREE_TYPE (clone
), spec
);
18773 /* Produce the definition of D, a _DECL generated from a template. If
18774 DEFER_OK is nonzero, then we don't have to actually do the
18775 instantiation now; we just have to do it sometime. Normally it is
18776 an error if this is an explicit instantiation but D is undefined.
18777 EXPL_INST_CLASS_MEM_P is true iff D is a member of an
18778 explicitly instantiated class template. */
18781 instantiate_decl (tree d
, int defer_ok
,
18782 bool expl_inst_class_mem_p
)
18784 tree tmpl
= DECL_TI_TEMPLATE (d
);
18791 bool pattern_defined
;
18792 location_t saved_loc
= input_location
;
18797 /* This function should only be used to instantiate templates for
18798 functions and static member variables. */
18799 gcc_assert (VAR_OR_FUNCTION_DECL_P (d
));
18801 /* Variables are never deferred; if instantiation is required, they
18802 are instantiated right away. That allows for better code in the
18803 case that an expression refers to the value of the variable --
18804 if the variable has a constant value the referring expression can
18805 take advantage of that fact. */
18807 || DECL_DECLARED_CONSTEXPR_P (d
))
18810 /* Don't instantiate cloned functions. Instead, instantiate the
18811 functions they cloned. */
18812 if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_CLONED_FUNCTION_P (d
))
18813 d
= DECL_CLONED_FUNCTION (d
);
18815 if (DECL_TEMPLATE_INSTANTIATED (d
)
18816 || (TREE_CODE (d
) == FUNCTION_DECL
18817 && DECL_DEFAULTED_FN (d
) && DECL_INITIAL (d
))
18818 || DECL_TEMPLATE_SPECIALIZATION (d
))
18819 /* D has already been instantiated or explicitly specialized, so
18820 there's nothing for us to do here.
18822 It might seem reasonable to check whether or not D is an explicit
18823 instantiation, and, if so, stop here. But when an explicit
18824 instantiation is deferred until the end of the compilation,
18825 DECL_EXPLICIT_INSTANTIATION is set, even though we still need to do
18826 the instantiation. */
18829 /* Check to see whether we know that this template will be
18830 instantiated in some other file, as with "extern template"
18832 external_p
= (DECL_INTERFACE_KNOWN (d
) && DECL_REALLY_EXTERN (d
));
18834 /* In general, we do not instantiate such templates. */
18835 if (external_p
&& !always_instantiate_p (d
))
18838 gen_tmpl
= most_general_template (tmpl
);
18839 gen_args
= DECL_TI_ARGS (d
);
18841 if (tmpl
!= gen_tmpl
)
18842 /* We should already have the extra args. */
18843 gcc_assert (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (gen_tmpl
))
18844 == TMPL_ARGS_DEPTH (gen_args
));
18845 /* And what's in the hash table should match D. */
18846 gcc_assert ((spec
= retrieve_specialization (gen_tmpl
, gen_args
, 0)) == d
18847 || spec
== NULL_TREE
);
18849 /* This needs to happen before any tsubsting. */
18850 if (! push_tinst_level (d
))
18853 timevar_push (TV_TEMPLATE_INST
);
18855 /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern
18856 for the instantiation. */
18857 td
= template_for_substitution (d
);
18858 code_pattern
= DECL_TEMPLATE_RESULT (td
);
18860 /* We should never be trying to instantiate a member of a class
18861 template or partial specialization. */
18862 gcc_assert (d
!= code_pattern
);
18864 if ((DECL_NAMESPACE_SCOPE_P (d
) && !DECL_INITIALIZED_IN_CLASS_P (d
))
18865 || DECL_TEMPLATE_SPECIALIZATION (td
))
18866 /* In the case of a friend template whose definition is provided
18867 outside the class, we may have too many arguments. Drop the
18868 ones we don't need. The same is true for specializations. */
18869 args
= get_innermost_template_args
18870 (gen_args
, TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (td
)));
18874 if (TREE_CODE (d
) == FUNCTION_DECL
)
18875 pattern_defined
= (DECL_SAVED_TREE (code_pattern
) != NULL_TREE
18876 || DECL_DEFAULTED_OUTSIDE_CLASS_P (code_pattern
));
18878 pattern_defined
= ! DECL_IN_AGGR_P (code_pattern
);
18880 /* We may be in the middle of deferred access check. Disable it now. */
18881 push_deferring_access_checks (dk_no_deferred
);
18883 /* Unless an explicit instantiation directive has already determined
18884 the linkage of D, remember that a definition is available for
18886 if (pattern_defined
18887 && !DECL_INTERFACE_KNOWN (d
)
18888 && !DECL_NOT_REALLY_EXTERN (d
))
18889 mark_definable (d
);
18891 DECL_SOURCE_LOCATION (td
) = DECL_SOURCE_LOCATION (code_pattern
);
18892 DECL_SOURCE_LOCATION (d
) = DECL_SOURCE_LOCATION (code_pattern
);
18893 input_location
= DECL_SOURCE_LOCATION (d
);
18895 /* If D is a member of an explicitly instantiated class template,
18896 and no definition is available, treat it like an implicit
18898 if (!pattern_defined
&& expl_inst_class_mem_p
18899 && DECL_EXPLICIT_INSTANTIATION (d
))
18901 /* Leave linkage flags alone on instantiations with anonymous
18903 if (TREE_PUBLIC (d
))
18905 DECL_NOT_REALLY_EXTERN (d
) = 0;
18906 DECL_INTERFACE_KNOWN (d
) = 0;
18908 SET_DECL_IMPLICIT_INSTANTIATION (d
);
18911 if (TREE_CODE (d
) == FUNCTION_DECL
)
18912 maybe_instantiate_noexcept (d
);
18914 /* Defer all other templates, unless we have been explicitly
18915 forbidden from doing so. */
18916 if (/* If there is no definition, we cannot instantiate the
18919 /* If it's OK to postpone instantiation, do so. */
18921 /* If this is a static data member that will be defined
18922 elsewhere, we don't want to instantiate the entire data
18923 member, but we do want to instantiate the initializer so that
18924 we can substitute that elsewhere. */
18925 || (external_p
&& VAR_P (d
)))
18927 /* The definition of the static data member is now required so
18928 we must substitute the initializer. */
18930 && !DECL_INITIAL (d
)
18931 && DECL_INITIAL (code_pattern
))
18935 bool const_init
= false;
18937 ns
= decl_namespace_context (d
);
18938 push_nested_namespace (ns
);
18939 push_nested_class (DECL_CONTEXT (d
));
18940 init
= tsubst_expr (DECL_INITIAL (code_pattern
),
18942 tf_warning_or_error
, NULL_TREE
,
18943 /*integral_constant_expression_p=*/false);
18944 /* Make sure the initializer is still constant, in case of
18945 circular dependency (template/instantiate6.C). */
18947 = DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (code_pattern
);
18948 cp_finish_decl (d
, init
, /*init_const_expr_p=*/const_init
,
18949 /*asmspec_tree=*/NULL_TREE
,
18950 LOOKUP_ONLYCONVERTING
);
18951 pop_nested_class ();
18952 pop_nested_namespace (ns
);
18955 /* We restore the source position here because it's used by
18956 add_pending_template. */
18957 input_location
= saved_loc
;
18959 if (at_eof
&& !pattern_defined
18960 && DECL_EXPLICIT_INSTANTIATION (d
)
18961 && DECL_NOT_REALLY_EXTERN (d
))
18964 The definition of a non-exported function template, a
18965 non-exported member function template, or a non-exported
18966 member function or static data member of a class template
18967 shall be present in every translation unit in which it is
18968 explicitly instantiated. */
18969 permerror (input_location
, "explicit instantiation of %qD "
18970 "but no definition available", d
);
18972 /* If we're in unevaluated context, we just wanted to get the
18973 constant value; this isn't an odr use, so don't queue
18974 a full instantiation. */
18975 if (cp_unevaluated_operand
!= 0)
18977 /* ??? Historically, we have instantiated inline functions, even
18978 when marked as "extern template". */
18979 if (!(external_p
&& VAR_P (d
)))
18980 add_pending_template (d
);
18983 /* Tell the repository that D is available in this translation unit
18984 -- and see if it is supposed to be instantiated here. */
18985 if (TREE_PUBLIC (d
) && !DECL_REALLY_EXTERN (d
) && !repo_emit_p (d
))
18987 /* In a PCH file, despite the fact that the repository hasn't
18988 requested instantiation in the PCH it is still possible that
18989 an instantiation will be required in a file that includes the
18992 add_pending_template (d
);
18993 /* Instantiate inline functions so that the inliner can do its
18994 job, even though we'll not be emitting a copy of this
18996 if (!(TREE_CODE (d
) == FUNCTION_DECL
&& possibly_inlined_p (d
)))
19000 fn_context
= decl_function_context (d
);
19001 nested
= (current_function_decl
!= NULL_TREE
);
19003 push_to_top_level ();
19005 push_function_context ();
19007 /* Mark D as instantiated so that recursive calls to
19008 instantiate_decl do not try to instantiate it again. */
19009 DECL_TEMPLATE_INSTANTIATED (d
) = 1;
19011 /* Regenerate the declaration in case the template has been modified
19012 by a subsequent redeclaration. */
19013 regenerate_decl_from_template (d
, td
);
19015 /* We already set the file and line above. Reset them now in case
19016 they changed as a result of calling regenerate_decl_from_template. */
19017 input_location
= DECL_SOURCE_LOCATION (d
);
19022 bool const_init
= false;
19024 /* Clear out DECL_RTL; whatever was there before may not be right
19025 since we've reset the type of the declaration. */
19026 SET_DECL_RTL (d
, NULL
);
19027 DECL_IN_AGGR_P (d
) = 0;
19029 /* The initializer is placed in DECL_INITIAL by
19030 regenerate_decl_from_template so we don't need to
19031 push/pop_access_scope again here. Pull it out so that
19032 cp_finish_decl can process it. */
19033 init
= DECL_INITIAL (d
);
19034 DECL_INITIAL (d
) = NULL_TREE
;
19035 DECL_INITIALIZED_P (d
) = 0;
19037 /* Clear DECL_EXTERNAL so that cp_finish_decl will process the
19038 initializer. That function will defer actual emission until
19039 we have a chance to determine linkage. */
19040 DECL_EXTERNAL (d
) = 0;
19042 /* Enter the scope of D so that access-checking works correctly. */
19043 push_nested_class (DECL_CONTEXT (d
));
19044 const_init
= DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (code_pattern
);
19045 cp_finish_decl (d
, init
, const_init
, NULL_TREE
, 0);
19046 pop_nested_class ();
19048 else if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_DEFAULTED_FN (code_pattern
))
19049 synthesize_method (d
);
19050 else if (TREE_CODE (d
) == FUNCTION_DECL
)
19052 struct pointer_map_t
*saved_local_specializations
;
19057 /* Save away the current list, in case we are instantiating one
19058 template from within the body of another. */
19059 saved_local_specializations
= local_specializations
;
19061 /* Set up the list of local specializations. */
19062 local_specializations
= pointer_map_create ();
19064 /* Set up context. */
19065 start_preparsed_function (d
, NULL_TREE
, SF_PRE_PARSED
);
19067 /* Some typedefs referenced from within the template code need to be
19068 access checked at template instantiation time, i.e now. These
19069 types were added to the template at parsing time. Let's get those
19070 and perform the access checks then. */
19071 perform_typedefs_access_check (DECL_TEMPLATE_RESULT (gen_tmpl
),
19074 /* Create substitution entries for the parameters. */
19075 subst_decl
= DECL_TEMPLATE_RESULT (template_for_substitution (d
));
19076 tmpl_parm
= DECL_ARGUMENTS (subst_decl
);
19077 spec_parm
= DECL_ARGUMENTS (d
);
19078 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (d
))
19080 register_local_specialization (spec_parm
, tmpl_parm
);
19081 spec_parm
= skip_artificial_parms_for (d
, spec_parm
);
19082 tmpl_parm
= skip_artificial_parms_for (subst_decl
, tmpl_parm
);
19084 for (; tmpl_parm
; tmpl_parm
= DECL_CHAIN (tmpl_parm
))
19086 if (!FUNCTION_PARAMETER_PACK_P (tmpl_parm
))
19088 register_local_specialization (spec_parm
, tmpl_parm
);
19089 spec_parm
= DECL_CHAIN (spec_parm
);
19093 /* Register the (value) argument pack as a specialization of
19094 TMPL_PARM, then move on. */
19095 tree argpack
= extract_fnparm_pack (tmpl_parm
, &spec_parm
);
19096 register_local_specialization (argpack
, tmpl_parm
);
19099 gcc_assert (!spec_parm
);
19101 /* Substitute into the body of the function. */
19102 tsubst_expr (DECL_SAVED_TREE (code_pattern
), args
,
19103 tf_warning_or_error
, tmpl
,
19104 /*integral_constant_expression_p=*/false);
19106 /* Set the current input_location to the end of the function
19107 so that finish_function knows where we are. */
19108 input_location
= DECL_STRUCT_FUNCTION (code_pattern
)->function_end_locus
;
19110 /* We don't need the local specializations any more. */
19111 pointer_map_destroy (local_specializations
);
19112 local_specializations
= saved_local_specializations
;
19114 /* Finish the function. */
19115 d
= finish_function (0);
19116 expand_or_defer_fn (d
);
19119 /* We're not deferring instantiation any more. */
19120 TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (d
)) = 0;
19123 pop_from_top_level ();
19125 pop_function_context ();
19128 input_location
= saved_loc
;
19129 pop_deferring_access_checks ();
19130 pop_tinst_level ();
19132 timevar_pop (TV_TEMPLATE_INST
);
19137 /* Run through the list of templates that we wish we could
19138 instantiate, and instantiate any we can. RETRIES is the
19139 number of times we retry pending template instantiation. */
19142 instantiate_pending_templates (int retries
)
19145 location_t saved_loc
= input_location
;
19147 /* Instantiating templates may trigger vtable generation. This in turn
19148 may require further template instantiations. We place a limit here
19149 to avoid infinite loop. */
19150 if (pending_templates
&& retries
>= max_tinst_depth
)
19152 tree decl
= pending_templates
->tinst
->decl
;
19154 error ("template instantiation depth exceeds maximum of %d"
19155 " instantiating %q+D, possibly from virtual table generation"
19156 " (use -ftemplate-depth= to increase the maximum)",
19157 max_tinst_depth
, decl
);
19158 if (TREE_CODE (decl
) == FUNCTION_DECL
)
19159 /* Pretend that we defined it. */
19160 DECL_INITIAL (decl
) = error_mark_node
;
19166 struct pending_template
**t
= &pending_templates
;
19167 struct pending_template
*last
= NULL
;
19171 tree instantiation
= reopen_tinst_level ((*t
)->tinst
);
19172 bool complete
= false;
19174 if (TYPE_P (instantiation
))
19178 if (!COMPLETE_TYPE_P (instantiation
))
19180 instantiate_class_template (instantiation
);
19181 if (CLASSTYPE_TEMPLATE_INSTANTIATION (instantiation
))
19182 for (fn
= TYPE_METHODS (instantiation
);
19184 fn
= TREE_CHAIN (fn
))
19185 if (! DECL_ARTIFICIAL (fn
))
19186 instantiate_decl (fn
,
19188 /*expl_inst_class_mem_p=*/false);
19189 if (COMPLETE_TYPE_P (instantiation
))
19193 complete
= COMPLETE_TYPE_P (instantiation
);
19197 if (!DECL_TEMPLATE_SPECIALIZATION (instantiation
)
19198 && !DECL_TEMPLATE_INSTANTIATED (instantiation
))
19201 = instantiate_decl (instantiation
,
19203 /*expl_inst_class_mem_p=*/false);
19204 if (DECL_TEMPLATE_INSTANTIATED (instantiation
))
19208 complete
= (DECL_TEMPLATE_SPECIALIZATION (instantiation
)
19209 || DECL_TEMPLATE_INSTANTIATED (instantiation
));
19213 /* If INSTANTIATION has been instantiated, then we don't
19214 need to consider it again in the future. */
19222 current_tinst_level
= NULL
;
19224 last_pending_template
= last
;
19226 while (reconsider
);
19228 input_location
= saved_loc
;
19231 /* Substitute ARGVEC into T, which is a list of initializers for
19232 either base class or a non-static data member. The TREE_PURPOSEs
19233 are DECLs, and the TREE_VALUEs are the initializer values. Used by
19234 instantiate_decl. */
19237 tsubst_initializer_list (tree t
, tree argvec
)
19239 tree inits
= NULL_TREE
;
19241 for (; t
; t
= TREE_CHAIN (t
))
19245 tree expanded_bases
= NULL_TREE
;
19246 tree expanded_arguments
= NULL_TREE
;
19249 if (TREE_CODE (TREE_PURPOSE (t
)) == TYPE_PACK_EXPANSION
)
19254 /* Expand the base class expansion type into separate base
19256 expanded_bases
= tsubst_pack_expansion (TREE_PURPOSE (t
), argvec
,
19257 tf_warning_or_error
,
19259 if (expanded_bases
== error_mark_node
)
19262 /* We'll be building separate TREE_LISTs of arguments for
19264 len
= TREE_VEC_LENGTH (expanded_bases
);
19265 expanded_arguments
= make_tree_vec (len
);
19266 for (i
= 0; i
< len
; i
++)
19267 TREE_VEC_ELT (expanded_arguments
, i
) = NULL_TREE
;
19269 /* Build a dummy EXPR_PACK_EXPANSION that will be used to
19270 expand each argument in the TREE_VALUE of t. */
19271 expr
= make_node (EXPR_PACK_EXPANSION
);
19272 PACK_EXPANSION_LOCAL_P (expr
) = true;
19273 PACK_EXPANSION_PARAMETER_PACKS (expr
) =
19274 PACK_EXPANSION_PARAMETER_PACKS (TREE_PURPOSE (t
));
19276 if (TREE_VALUE (t
) == void_type_node
)
19277 /* VOID_TYPE_NODE is used to indicate
19278 value-initialization. */
19280 for (i
= 0; i
< len
; i
++)
19281 TREE_VEC_ELT (expanded_arguments
, i
) = void_type_node
;
19285 /* Substitute parameter packs into each argument in the
19287 in_base_initializer
= 1;
19288 for (arg
= TREE_VALUE (t
); arg
; arg
= TREE_CHAIN (arg
))
19290 tree expanded_exprs
;
19292 /* Expand the argument. */
19293 SET_PACK_EXPANSION_PATTERN (expr
, TREE_VALUE (arg
));
19295 = tsubst_pack_expansion (expr
, argvec
,
19296 tf_warning_or_error
,
19298 if (expanded_exprs
== error_mark_node
)
19301 /* Prepend each of the expanded expressions to the
19302 corresponding TREE_LIST in EXPANDED_ARGUMENTS. */
19303 for (i
= 0; i
< len
; i
++)
19305 TREE_VEC_ELT (expanded_arguments
, i
) =
19306 tree_cons (NULL_TREE
,
19307 TREE_VEC_ELT (expanded_exprs
, i
),
19308 TREE_VEC_ELT (expanded_arguments
, i
));
19311 in_base_initializer
= 0;
19313 /* Reverse all of the TREE_LISTs in EXPANDED_ARGUMENTS,
19314 since we built them backwards. */
19315 for (i
= 0; i
< len
; i
++)
19317 TREE_VEC_ELT (expanded_arguments
, i
) =
19318 nreverse (TREE_VEC_ELT (expanded_arguments
, i
));
19323 for (i
= 0; i
< len
; ++i
)
19325 if (expanded_bases
)
19327 decl
= TREE_VEC_ELT (expanded_bases
, i
);
19328 decl
= expand_member_init (decl
);
19329 init
= TREE_VEC_ELT (expanded_arguments
, i
);
19334 decl
= tsubst_copy (TREE_PURPOSE (t
), argvec
,
19335 tf_warning_or_error
, NULL_TREE
);
19337 decl
= expand_member_init (decl
);
19338 if (decl
&& !DECL_P (decl
))
19339 in_base_initializer
= 1;
19341 init
= TREE_VALUE (t
);
19343 if (init
!= void_type_node
)
19344 init
= tsubst_expr (init
, argvec
,
19345 tf_warning_or_error
, NULL_TREE
,
19346 /*integral_constant_expression_p=*/false);
19347 if (init
== NULL_TREE
&& tmp
!= NULL_TREE
)
19348 /* If we had an initializer but it instantiated to nothing,
19349 value-initialize the object. This will only occur when
19350 the initializer was a pack expansion where the parameter
19351 packs used in that expansion were of length zero. */
19352 init
= void_type_node
;
19353 in_base_initializer
= 0;
19358 init
= build_tree_list (decl
, init
);
19359 TREE_CHAIN (init
) = inits
;
19367 /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */
19370 set_current_access_from_decl (tree decl
)
19372 if (TREE_PRIVATE (decl
))
19373 current_access_specifier
= access_private_node
;
19374 else if (TREE_PROTECTED (decl
))
19375 current_access_specifier
= access_protected_node
;
19377 current_access_specifier
= access_public_node
;
19380 /* Instantiate an enumerated type. TAG is the template type, NEWTAG
19381 is the instantiation (which should have been created with
19382 start_enum) and ARGS are the template arguments to use. */
19385 tsubst_enum (tree tag
, tree newtag
, tree args
)
19389 if (SCOPED_ENUM_P (newtag
))
19390 begin_scope (sk_scoped_enum
, newtag
);
19392 for (e
= TYPE_VALUES (tag
); e
; e
= TREE_CHAIN (e
))
19397 decl
= TREE_VALUE (e
);
19398 /* Note that in a template enum, the TREE_VALUE is the
19399 CONST_DECL, not the corresponding INTEGER_CST. */
19400 value
= tsubst_expr (DECL_INITIAL (decl
),
19401 args
, tf_warning_or_error
, NULL_TREE
,
19402 /*integral_constant_expression_p=*/true);
19404 /* Give this enumeration constant the correct access. */
19405 set_current_access_from_decl (decl
);
19407 /* Actually build the enumerator itself. */
19409 (DECL_NAME (decl
), value
, newtag
, DECL_SOURCE_LOCATION (decl
));
19412 if (SCOPED_ENUM_P (newtag
))
19415 finish_enum_value_list (newtag
);
19416 finish_enum (newtag
);
19418 DECL_SOURCE_LOCATION (TYPE_NAME (newtag
))
19419 = DECL_SOURCE_LOCATION (TYPE_NAME (tag
));
19422 /* DECL is a FUNCTION_DECL that is a template specialization. Return
19423 its type -- but without substituting the innermost set of template
19424 arguments. So, innermost set of template parameters will appear in
19428 get_mostly_instantiated_function_type (tree decl
)
19436 tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
19437 targs
= DECL_TI_ARGS (decl
);
19438 tparms
= DECL_TEMPLATE_PARMS (tmpl
);
19439 parm_depth
= TMPL_PARMS_DEPTH (tparms
);
19441 /* There should be as many levels of arguments as there are levels
19443 gcc_assert (parm_depth
== TMPL_ARGS_DEPTH (targs
));
19445 fn_type
= TREE_TYPE (tmpl
);
19447 if (parm_depth
== 1)
19448 /* No substitution is necessary. */
19455 /* Replace the innermost level of the TARGS with NULL_TREEs to
19456 let tsubst know not to substitute for those parameters. */
19457 partial_args
= make_tree_vec (TREE_VEC_LENGTH (targs
));
19458 for (i
= 1; i
< TMPL_ARGS_DEPTH (targs
); ++i
)
19459 SET_TMPL_ARGS_LEVEL (partial_args
, i
,
19460 TMPL_ARGS_LEVEL (targs
, i
));
19461 SET_TMPL_ARGS_LEVEL (partial_args
,
19462 TMPL_ARGS_DEPTH (targs
),
19463 make_tree_vec (DECL_NTPARMS (tmpl
)));
19465 /* Make sure that we can see identifiers, and compute access
19467 push_access_scope (decl
);
19469 ++processing_template_decl
;
19470 /* Now, do the (partial) substitution to figure out the
19471 appropriate function type. */
19472 fn_type
= tsubst (fn_type
, partial_args
, tf_error
, NULL_TREE
);
19473 --processing_template_decl
;
19475 /* Substitute into the template parameters to obtain the real
19476 innermost set of parameters. This step is important if the
19477 innermost set of template parameters contains value
19478 parameters whose types depend on outer template parameters. */
19479 TREE_VEC_LENGTH (partial_args
)--;
19480 tparms
= tsubst_template_parms (tparms
, partial_args
, tf_error
);
19482 pop_access_scope (decl
);
19488 /* Return truthvalue if we're processing a template different from
19489 the last one involved in diagnostics. */
19491 problematic_instantiation_changed (void)
19493 return current_tinst_level
!= last_error_tinst_level
;
19496 /* Remember current template involved in diagnostics. */
19498 record_last_problematic_instantiation (void)
19500 last_error_tinst_level
= current_tinst_level
;
19503 struct tinst_level
*
19504 current_instantiation (void)
19506 return current_tinst_level
;
19509 /* [temp.param] Check that template non-type parm TYPE is of an allowable
19510 type. Return zero for ok, nonzero for disallowed. Issue error and
19511 warning messages under control of COMPLAIN. */
19514 invalid_nontype_parm_type_p (tree type
, tsubst_flags_t complain
)
19516 if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
19518 else if (POINTER_TYPE_P (type
))
19520 else if (TYPE_PTRMEM_P (type
))
19522 else if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
)
19524 else if (TREE_CODE (type
) == TYPENAME_TYPE
)
19526 else if (TREE_CODE (type
) == DECLTYPE_TYPE
)
19528 else if (TREE_CODE (type
) == NULLPTR_TYPE
)
19531 if (complain
& tf_error
)
19533 if (type
== error_mark_node
)
19534 inform (input_location
, "invalid template non-type parameter");
19536 error ("%q#T is not a valid type for a template non-type parameter",
19542 /* Returns TRUE if TYPE is dependent, in the sense of [temp.dep.type].
19543 Assumes that TYPE really is a type, and not the ERROR_MARK_NODE.*/
19546 dependent_type_p_r (tree type
)
19552 A type is dependent if it is:
19554 -- a template parameter. Template template parameters are types
19555 for us (since TYPE_P holds true for them) so we handle
19557 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
19558 || TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
)
19560 /* -- a qualified-id with a nested-name-specifier which contains a
19561 class-name that names a dependent type or whose unqualified-id
19562 names a dependent type. */
19563 if (TREE_CODE (type
) == TYPENAME_TYPE
)
19565 /* -- a cv-qualified type where the cv-unqualified type is
19567 type
= TYPE_MAIN_VARIANT (type
);
19568 /* -- a compound type constructed from any dependent type. */
19569 if (TYPE_PTRMEM_P (type
))
19570 return (dependent_type_p (TYPE_PTRMEM_CLASS_TYPE (type
))
19571 || dependent_type_p (TYPE_PTRMEM_POINTED_TO_TYPE
19573 else if (TYPE_PTR_P (type
)
19574 || TREE_CODE (type
) == REFERENCE_TYPE
)
19575 return dependent_type_p (TREE_TYPE (type
));
19576 else if (TREE_CODE (type
) == FUNCTION_TYPE
19577 || TREE_CODE (type
) == METHOD_TYPE
)
19581 if (dependent_type_p (TREE_TYPE (type
)))
19583 for (arg_type
= TYPE_ARG_TYPES (type
);
19585 arg_type
= TREE_CHAIN (arg_type
))
19586 if (dependent_type_p (TREE_VALUE (arg_type
)))
19590 /* -- an array type constructed from any dependent type or whose
19591 size is specified by a constant expression that is
19594 We checked for type- and value-dependence of the bounds in
19595 compute_array_index_type, so TYPE_DEPENDENT_P is already set. */
19596 if (TREE_CODE (type
) == ARRAY_TYPE
)
19598 if (TYPE_DOMAIN (type
)
19599 && dependent_type_p (TYPE_DOMAIN (type
)))
19601 return dependent_type_p (TREE_TYPE (type
));
19604 /* -- a template-id in which either the template name is a template
19606 if (TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
19608 /* ... or any of the template arguments is a dependent type or
19609 an expression that is type-dependent or value-dependent. */
19610 else if (CLASS_TYPE_P (type
) && CLASSTYPE_TEMPLATE_INFO (type
)
19611 && (any_dependent_template_arguments_p
19612 (INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type
)))))
19615 /* All TYPEOF_TYPEs, DECLTYPE_TYPEs, and UNDERLYING_TYPEs are
19616 dependent; if the argument of the `typeof' expression is not
19617 type-dependent, then it should already been have resolved. */
19618 if (TREE_CODE (type
) == TYPEOF_TYPE
19619 || TREE_CODE (type
) == DECLTYPE_TYPE
19620 || TREE_CODE (type
) == UNDERLYING_TYPE
)
19623 /* A template argument pack is dependent if any of its packed
19625 if (TREE_CODE (type
) == TYPE_ARGUMENT_PACK
)
19627 tree args
= ARGUMENT_PACK_ARGS (type
);
19628 int i
, len
= TREE_VEC_LENGTH (args
);
19629 for (i
= 0; i
< len
; ++i
)
19630 if (dependent_template_arg_p (TREE_VEC_ELT (args
, i
)))
19634 /* All TYPE_PACK_EXPANSIONs are dependent, because parameter packs must
19635 be template parameters. */
19636 if (TREE_CODE (type
) == TYPE_PACK_EXPANSION
)
19639 /* The standard does not specifically mention types that are local
19640 to template functions or local classes, but they should be
19641 considered dependent too. For example:
19643 template <int I> void f() {
19648 The size of `E' cannot be known until the value of `I' has been
19649 determined. Therefore, `E' must be considered dependent. */
19650 scope
= TYPE_CONTEXT (type
);
19651 if (scope
&& TYPE_P (scope
))
19652 return dependent_type_p (scope
);
19653 /* Don't use type_dependent_expression_p here, as it can lead
19654 to infinite recursion trying to determine whether a lambda
19655 nested in a lambda is dependent (c++/47687). */
19656 else if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
19657 && DECL_LANG_SPECIFIC (scope
)
19658 && DECL_TEMPLATE_INFO (scope
)
19659 && (any_dependent_template_arguments_p
19660 (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (scope
)))))
19663 /* Other types are non-dependent. */
19667 /* Returns TRUE if TYPE is dependent, in the sense of
19668 [temp.dep.type]. Note that a NULL type is considered dependent. */
19671 dependent_type_p (tree type
)
19673 /* If there are no template parameters in scope, then there can't be
19674 any dependent types. */
19675 if (!processing_template_decl
)
19677 /* If we are not processing a template, then nobody should be
19678 providing us with a dependent type. */
19680 gcc_assert (TREE_CODE (type
) != TEMPLATE_TYPE_PARM
|| is_auto (type
));
19684 /* If the type is NULL, we have not computed a type for the entity
19685 in question; in that case, the type is dependent. */
19689 /* Erroneous types can be considered non-dependent. */
19690 if (type
== error_mark_node
)
19693 /* If we have not already computed the appropriate value for TYPE,
19695 if (!TYPE_DEPENDENT_P_VALID (type
))
19697 TYPE_DEPENDENT_P (type
) = dependent_type_p_r (type
);
19698 TYPE_DEPENDENT_P_VALID (type
) = 1;
19701 return TYPE_DEPENDENT_P (type
);
19704 /* Returns TRUE if SCOPE is a dependent scope, in which we can't do any
19705 lookup. In other words, a dependent type that is not the current
19709 dependent_scope_p (tree scope
)
19711 return (scope
&& TYPE_P (scope
) && dependent_type_p (scope
)
19712 && !currently_open_class (scope
));
19715 /* T is a SCOPE_REF; return whether we need to consider it
19716 instantiation-dependent so that we can check access at instantiation
19717 time even though we know which member it resolves to. */
19720 instantiation_dependent_scope_ref_p (tree t
)
19722 if (DECL_P (TREE_OPERAND (t
, 1))
19723 && CLASS_TYPE_P (TREE_OPERAND (t
, 0))
19724 && accessible_in_template_p (TREE_OPERAND (t
, 0),
19725 TREE_OPERAND (t
, 1)))
19731 /* Returns TRUE if the EXPRESSION is value-dependent, in the sense of
19732 [temp.dep.constexpr]. EXPRESSION is already known to be a constant
19735 /* Note that this predicate is not appropriate for general expressions;
19736 only constant expressions (that satisfy potential_constant_expression)
19737 can be tested for value dependence. */
19740 value_dependent_expression_p (tree expression
)
19742 if (!processing_template_decl
)
19745 /* A name declared with a dependent type. */
19746 if (DECL_P (expression
) && type_dependent_expression_p (expression
))
19749 switch (TREE_CODE (expression
))
19751 case IDENTIFIER_NODE
:
19752 /* A name that has not been looked up -- must be dependent. */
19755 case TEMPLATE_PARM_INDEX
:
19756 /* A non-type template parm. */
19760 /* A non-type template parm. */
19761 if (DECL_TEMPLATE_PARM_P (expression
))
19763 return value_dependent_expression_p (DECL_INITIAL (expression
));
19766 /* A constant with literal type and is initialized
19767 with an expression that is value-dependent.
19769 Note that a non-dependent parenthesized initializer will have
19770 already been replaced with its constant value, so if we see
19771 a TREE_LIST it must be dependent. */
19772 if (DECL_INITIAL (expression
)
19773 && decl_constant_var_p (expression
)
19774 && (TREE_CODE (DECL_INITIAL (expression
)) == TREE_LIST
19775 || value_dependent_expression_p (DECL_INITIAL (expression
))))
19779 case DYNAMIC_CAST_EXPR
:
19780 case STATIC_CAST_EXPR
:
19781 case CONST_CAST_EXPR
:
19782 case REINTERPRET_CAST_EXPR
:
19784 /* These expressions are value-dependent if the type to which
19785 the cast occurs is dependent or the expression being casted
19786 is value-dependent. */
19788 tree type
= TREE_TYPE (expression
);
19790 if (dependent_type_p (type
))
19793 /* A functional cast has a list of operands. */
19794 expression
= TREE_OPERAND (expression
, 0);
19797 /* If there are no operands, it must be an expression such
19798 as "int()". This should not happen for aggregate types
19799 because it would form non-constant expressions. */
19800 gcc_assert (cxx_dialect
>= cxx0x
19801 || INTEGRAL_OR_ENUMERATION_TYPE_P (type
));
19806 if (TREE_CODE (expression
) == TREE_LIST
)
19807 return any_value_dependent_elements_p (expression
);
19809 return value_dependent_expression_p (expression
);
19813 if (SIZEOF_EXPR_TYPE_P (expression
))
19814 return dependent_type_p (TREE_TYPE (TREE_OPERAND (expression
, 0)));
19818 /* A `sizeof' expression is value-dependent if the operand is
19819 type-dependent or is a pack expansion. */
19820 expression
= TREE_OPERAND (expression
, 0);
19821 if (PACK_EXPANSION_P (expression
))
19823 else if (TYPE_P (expression
))
19824 return dependent_type_p (expression
);
19825 return instantiation_dependent_expression_p (expression
);
19827 case AT_ENCODE_EXPR
:
19828 /* An 'encode' expression is value-dependent if the operand is
19830 expression
= TREE_OPERAND (expression
, 0);
19831 return dependent_type_p (expression
);
19833 case NOEXCEPT_EXPR
:
19834 expression
= TREE_OPERAND (expression
, 0);
19835 return instantiation_dependent_expression_p (expression
);
19838 /* All instantiation-dependent expressions should also be considered
19839 value-dependent. */
19840 return instantiation_dependent_scope_ref_p (expression
);
19842 case COMPONENT_REF
:
19843 return (value_dependent_expression_p (TREE_OPERAND (expression
, 0))
19844 || value_dependent_expression_p (TREE_OPERAND (expression
, 1)));
19846 case NONTYPE_ARGUMENT_PACK
:
19847 /* A NONTYPE_ARGUMENT_PACK is value-dependent if any packed argument
19848 is value-dependent. */
19850 tree values
= ARGUMENT_PACK_ARGS (expression
);
19851 int i
, len
= TREE_VEC_LENGTH (values
);
19853 for (i
= 0; i
< len
; ++i
)
19854 if (value_dependent_expression_p (TREE_VEC_ELT (values
, i
)))
19862 tree type2
= TRAIT_EXPR_TYPE2 (expression
);
19863 return (dependent_type_p (TRAIT_EXPR_TYPE1 (expression
))
19864 || (type2
? dependent_type_p (type2
) : false));
19868 return ((value_dependent_expression_p (TREE_OPERAND (expression
, 0)))
19869 || (value_dependent_expression_p (TREE_OPERAND (expression
, 2))));
19872 return ((value_dependent_expression_p (TREE_OPERAND (expression
, 0)))
19873 || (value_dependent_expression_p (TREE_OPERAND (expression
, 1))));
19877 tree op
= TREE_OPERAND (expression
, 0);
19878 return (value_dependent_expression_p (op
)
19879 || has_value_dependent_address (op
));
19884 tree fn
= get_callee_fndecl (expression
);
19886 if (!fn
&& value_dependent_expression_p (CALL_EXPR_FN (expression
)))
19888 nargs
= call_expr_nargs (expression
);
19889 for (i
= 0; i
< nargs
; ++i
)
19891 tree op
= CALL_EXPR_ARG (expression
, i
);
19892 /* In a call to a constexpr member function, look through the
19893 implicit ADDR_EXPR on the object argument so that it doesn't
19894 cause the call to be considered value-dependent. We also
19895 look through it in potential_constant_expression. */
19896 if (i
== 0 && fn
&& DECL_DECLARED_CONSTEXPR_P (fn
)
19897 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
19898 && TREE_CODE (op
) == ADDR_EXPR
)
19899 op
= TREE_OPERAND (op
, 0);
19900 if (value_dependent_expression_p (op
))
19906 case TEMPLATE_ID_EXPR
:
19907 /* If a TEMPLATE_ID_EXPR involves a dependent name, it will be
19909 return type_dependent_expression_p (expression
);
19915 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expression
), ix
, val
)
19916 if (value_dependent_expression_p (val
))
19922 /* Treat a GNU statement expression as dependent to avoid crashing
19923 under fold_non_dependent_expr; it can't be constant. */
19927 /* A constant expression is value-dependent if any subexpression is
19928 value-dependent. */
19929 switch (TREE_CODE_CLASS (TREE_CODE (expression
)))
19931 case tcc_reference
:
19933 case tcc_comparison
:
19935 case tcc_expression
:
19938 int i
, len
= cp_tree_operand_length (expression
);
19940 for (i
= 0; i
< len
; i
++)
19942 tree t
= TREE_OPERAND (expression
, i
);
19944 /* In some cases, some of the operands may be missing.l
19945 (For example, in the case of PREDECREMENT_EXPR, the
19946 amount to increment by may be missing.) That doesn't
19947 make the expression dependent. */
19948 if (t
&& value_dependent_expression_p (t
))
19959 /* The expression is not value-dependent. */
19963 /* Returns TRUE if the EXPRESSION is type-dependent, in the sense of
19964 [temp.dep.expr]. Note that an expression with no type is
19965 considered dependent. Other parts of the compiler arrange for an
19966 expression with type-dependent subexpressions to have no type, so
19967 this function doesn't have to be fully recursive. */
19970 type_dependent_expression_p (tree expression
)
19972 if (!processing_template_decl
)
19975 if (expression
== error_mark_node
)
19978 /* An unresolved name is always dependent. */
19979 if (identifier_p (expression
) || TREE_CODE (expression
) == USING_DECL
)
19982 /* Some expression forms are never type-dependent. */
19983 if (TREE_CODE (expression
) == PSEUDO_DTOR_EXPR
19984 || TREE_CODE (expression
) == SIZEOF_EXPR
19985 || TREE_CODE (expression
) == ALIGNOF_EXPR
19986 || TREE_CODE (expression
) == AT_ENCODE_EXPR
19987 || TREE_CODE (expression
) == NOEXCEPT_EXPR
19988 || TREE_CODE (expression
) == TRAIT_EXPR
19989 || TREE_CODE (expression
) == TYPEID_EXPR
19990 || TREE_CODE (expression
) == DELETE_EXPR
19991 || TREE_CODE (expression
) == VEC_DELETE_EXPR
19992 || TREE_CODE (expression
) == THROW_EXPR
)
19995 /* The types of these expressions depends only on the type to which
19996 the cast occurs. */
19997 if (TREE_CODE (expression
) == DYNAMIC_CAST_EXPR
19998 || TREE_CODE (expression
) == STATIC_CAST_EXPR
19999 || TREE_CODE (expression
) == CONST_CAST_EXPR
20000 || TREE_CODE (expression
) == REINTERPRET_CAST_EXPR
20001 || TREE_CODE (expression
) == IMPLICIT_CONV_EXPR
20002 || TREE_CODE (expression
) == CAST_EXPR
)
20003 return dependent_type_p (TREE_TYPE (expression
));
20005 /* The types of these expressions depends only on the type created
20006 by the expression. */
20007 if (TREE_CODE (expression
) == NEW_EXPR
20008 || TREE_CODE (expression
) == VEC_NEW_EXPR
)
20010 /* For NEW_EXPR tree nodes created inside a template, either
20011 the object type itself or a TREE_LIST may appear as the
20013 tree type
= TREE_OPERAND (expression
, 1);
20014 if (TREE_CODE (type
) == TREE_LIST
)
20015 /* This is an array type. We need to check array dimensions
20017 return dependent_type_p (TREE_VALUE (TREE_PURPOSE (type
)))
20018 || value_dependent_expression_p
20019 (TREE_OPERAND (TREE_VALUE (type
), 1));
20021 return dependent_type_p (type
);
20024 if (TREE_CODE (expression
) == SCOPE_REF
)
20026 tree scope
= TREE_OPERAND (expression
, 0);
20027 tree name
= TREE_OPERAND (expression
, 1);
20029 /* 14.6.2.2 [temp.dep.expr]: An id-expression is type-dependent if it
20030 contains an identifier associated by name lookup with one or more
20031 declarations declared with a dependent type, or...a
20032 nested-name-specifier or qualified-id that names a member of an
20033 unknown specialization. */
20034 return (type_dependent_expression_p (name
)
20035 || dependent_scope_p (scope
));
20038 if (TREE_CODE (expression
) == FUNCTION_DECL
20039 && DECL_LANG_SPECIFIC (expression
)
20040 && DECL_TEMPLATE_INFO (expression
)
20041 && (any_dependent_template_arguments_p
20042 (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (expression
)))))
20045 if (TREE_CODE (expression
) == TEMPLATE_DECL
20046 && !DECL_TEMPLATE_TEMPLATE_PARM_P (expression
))
20049 if (TREE_CODE (expression
) == STMT_EXPR
)
20050 expression
= stmt_expr_value_expr (expression
);
20052 if (BRACE_ENCLOSED_INITIALIZER_P (expression
))
20057 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expression
), i
, elt
)
20059 if (type_dependent_expression_p (elt
))
20065 /* A static data member of the current instantiation with incomplete
20066 array type is type-dependent, as the definition and specializations
20067 can have different bounds. */
20068 if (VAR_P (expression
)
20069 && DECL_CLASS_SCOPE_P (expression
)
20070 && dependent_type_p (DECL_CONTEXT (expression
))
20071 && VAR_HAD_UNKNOWN_BOUND (expression
))
20074 if (TREE_TYPE (expression
) == unknown_type_node
)
20076 if (TREE_CODE (expression
) == ADDR_EXPR
)
20077 return type_dependent_expression_p (TREE_OPERAND (expression
, 0));
20078 if (TREE_CODE (expression
) == COMPONENT_REF
20079 || TREE_CODE (expression
) == OFFSET_REF
)
20081 if (type_dependent_expression_p (TREE_OPERAND (expression
, 0)))
20083 expression
= TREE_OPERAND (expression
, 1);
20084 if (identifier_p (expression
))
20087 /* SCOPE_REF with non-null TREE_TYPE is always non-dependent. */
20088 if (TREE_CODE (expression
) == SCOPE_REF
)
20091 if (BASELINK_P (expression
))
20092 expression
= BASELINK_FUNCTIONS (expression
);
20094 if (TREE_CODE (expression
) == TEMPLATE_ID_EXPR
)
20096 if (any_dependent_template_arguments_p
20097 (TREE_OPERAND (expression
, 1)))
20099 expression
= TREE_OPERAND (expression
, 0);
20101 gcc_assert (TREE_CODE (expression
) == OVERLOAD
20102 || TREE_CODE (expression
) == FUNCTION_DECL
);
20106 if (type_dependent_expression_p (OVL_CURRENT (expression
)))
20108 expression
= OVL_NEXT (expression
);
20113 gcc_assert (TREE_CODE (expression
) != TYPE_DECL
);
20115 return (dependent_type_p (TREE_TYPE (expression
)));
20118 /* walk_tree callback function for instantiation_dependent_expression_p,
20119 below. Returns non-zero if a dependent subexpression is found. */
20122 instantiation_dependent_r (tree
*tp
, int *walk_subtrees
,
20127 /* We don't have to worry about decltype currently because decltype
20128 of an instantiation-dependent expr is a dependent type. This
20129 might change depending on the resolution of DR 1172. */
20130 *walk_subtrees
= false;
20133 enum tree_code code
= TREE_CODE (*tp
);
20136 /* Don't treat an argument list as dependent just because it has no
20144 /* A constant with a dependent initializer is dependent. */
20145 if (value_dependent_expression_p (*tp
))
20149 case TEMPLATE_PARM_INDEX
:
20152 /* Handle expressions with type operands. */
20156 case AT_ENCODE_EXPR
:
20158 tree op
= TREE_OPERAND (*tp
, 0);
20159 if (code
== SIZEOF_EXPR
&& SIZEOF_EXPR_TYPE_P (*tp
))
20160 op
= TREE_TYPE (op
);
20163 if (dependent_type_p (op
))
20167 *walk_subtrees
= false;
20175 if (dependent_type_p (TRAIT_EXPR_TYPE1 (*tp
))
20176 || dependent_type_p (TRAIT_EXPR_TYPE2 (*tp
)))
20178 *walk_subtrees
= false;
20181 case COMPONENT_REF
:
20182 if (identifier_p (TREE_OPERAND (*tp
, 1)))
20183 /* In a template, finish_class_member_access_expr creates a
20184 COMPONENT_REF with an IDENTIFIER_NODE for op1 even if it isn't
20185 type-dependent, so that we can check access control at
20186 instantiation time (PR 42277). See also Core issue 1273. */
20191 if (instantiation_dependent_scope_ref_p (*tp
))
20196 /* Treat statement-expressions as dependent. */
20204 if (type_dependent_expression_p (*tp
))
20210 /* Returns TRUE if the EXPRESSION is instantiation-dependent, in the
20211 sense defined by the ABI:
20213 "An expression is instantiation-dependent if it is type-dependent
20214 or value-dependent, or it has a subexpression that is type-dependent
20215 or value-dependent." */
20218 instantiation_dependent_expression_p (tree expression
)
20222 if (!processing_template_decl
)
20225 if (expression
== error_mark_node
)
20228 result
= cp_walk_tree_without_duplicates (&expression
,
20229 instantiation_dependent_r
, NULL
);
20230 return result
!= NULL_TREE
;
20233 /* Like type_dependent_expression_p, but it also works while not processing
20234 a template definition, i.e. during substitution or mangling. */
20237 type_dependent_expression_p_push (tree expr
)
20240 ++processing_template_decl
;
20241 b
= type_dependent_expression_p (expr
);
20242 --processing_template_decl
;
20246 /* Returns TRUE if ARGS contains a type-dependent expression. */
20249 any_type_dependent_arguments_p (const vec
<tree
, va_gc
> *args
)
20254 FOR_EACH_VEC_SAFE_ELT (args
, i
, arg
)
20256 if (type_dependent_expression_p (arg
))
20262 /* Returns TRUE if LIST (a TREE_LIST whose TREE_VALUEs are
20263 expressions) contains any type-dependent expressions. */
20266 any_type_dependent_elements_p (const_tree list
)
20268 for (; list
; list
= TREE_CHAIN (list
))
20269 if (value_dependent_expression_p (TREE_VALUE (list
)))
20275 /* Returns TRUE if LIST (a TREE_LIST whose TREE_VALUEs are
20276 expressions) contains any value-dependent expressions. */
20279 any_value_dependent_elements_p (const_tree list
)
20281 for (; list
; list
= TREE_CHAIN (list
))
20282 if (value_dependent_expression_p (TREE_VALUE (list
)))
20288 /* Returns TRUE if the ARG (a template argument) is dependent. */
20291 dependent_template_arg_p (tree arg
)
20293 if (!processing_template_decl
)
20296 /* Assume a template argument that was wrongly written by the user
20297 is dependent. This is consistent with what
20298 any_dependent_template_arguments_p [that calls this function]
20300 if (!arg
|| arg
== error_mark_node
)
20303 if (TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
20304 arg
= ARGUMENT_PACK_SELECT_ARG (arg
);
20306 if (TREE_CODE (arg
) == TEMPLATE_DECL
20307 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
20308 return dependent_template_p (arg
);
20309 else if (ARGUMENT_PACK_P (arg
))
20311 tree args
= ARGUMENT_PACK_ARGS (arg
);
20312 int i
, len
= TREE_VEC_LENGTH (args
);
20313 for (i
= 0; i
< len
; ++i
)
20315 if (dependent_template_arg_p (TREE_VEC_ELT (args
, i
)))
20321 else if (TYPE_P (arg
))
20322 return dependent_type_p (arg
);
20324 return (type_dependent_expression_p (arg
)
20325 || value_dependent_expression_p (arg
));
20328 /* Returns true if ARGS (a collection of template arguments) contains
20329 any types that require structural equality testing. */
20332 any_template_arguments_need_structural_equality_p (tree args
)
20339 if (args
== error_mark_node
)
20342 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
20344 tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
20345 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
20347 tree arg
= TREE_VEC_ELT (level
, j
);
20348 tree packed_args
= NULL_TREE
;
20351 if (ARGUMENT_PACK_P (arg
))
20353 /* Look inside the argument pack. */
20354 packed_args
= ARGUMENT_PACK_ARGS (arg
);
20355 len
= TREE_VEC_LENGTH (packed_args
);
20358 for (k
= 0; k
< len
; ++k
)
20361 arg
= TREE_VEC_ELT (packed_args
, k
);
20363 if (error_operand_p (arg
))
20365 else if (TREE_CODE (arg
) == TEMPLATE_DECL
20366 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
20368 else if (TYPE_P (arg
) && TYPE_STRUCTURAL_EQUALITY_P (arg
))
20370 else if (!TYPE_P (arg
) && TREE_TYPE (arg
)
20371 && TYPE_STRUCTURAL_EQUALITY_P (TREE_TYPE (arg
)))
20380 /* Returns true if ARGS (a collection of template arguments) contains
20381 any dependent arguments. */
20384 any_dependent_template_arguments_p (const_tree args
)
20391 if (args
== error_mark_node
)
20394 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
20396 const_tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
20397 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
20398 if (dependent_template_arg_p (TREE_VEC_ELT (level
, j
)))
20405 /* Returns TRUE if the template TMPL is dependent. */
20408 dependent_template_p (tree tmpl
)
20410 if (TREE_CODE (tmpl
) == OVERLOAD
)
20414 if (dependent_template_p (OVL_CURRENT (tmpl
)))
20416 tmpl
= OVL_NEXT (tmpl
);
20421 /* Template template parameters are dependent. */
20422 if (DECL_TEMPLATE_TEMPLATE_PARM_P (tmpl
)
20423 || TREE_CODE (tmpl
) == TEMPLATE_TEMPLATE_PARM
)
20425 /* So are names that have not been looked up. */
20426 if (TREE_CODE (tmpl
) == SCOPE_REF
|| identifier_p (tmpl
))
20428 /* So are member templates of dependent classes. */
20429 if (TYPE_P (CP_DECL_CONTEXT (tmpl
)))
20430 return dependent_type_p (DECL_CONTEXT (tmpl
));
20434 /* Returns TRUE if the specialization TMPL<ARGS> is dependent. */
20437 dependent_template_id_p (tree tmpl
, tree args
)
20439 return (dependent_template_p (tmpl
)
20440 || any_dependent_template_arguments_p (args
));
20443 /* Returns TRUE if OMP_FOR with DECLV, INITV, CONDV and INCRV vectors
20447 dependent_omp_for_p (tree declv
, tree initv
, tree condv
, tree incrv
)
20451 if (!processing_template_decl
)
20454 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
20456 tree decl
= TREE_VEC_ELT (declv
, i
);
20457 tree init
= TREE_VEC_ELT (initv
, i
);
20458 tree cond
= TREE_VEC_ELT (condv
, i
);
20459 tree incr
= TREE_VEC_ELT (incrv
, i
);
20461 if (type_dependent_expression_p (decl
))
20464 if (init
&& type_dependent_expression_p (init
))
20467 if (type_dependent_expression_p (cond
))
20470 if (COMPARISON_CLASS_P (cond
)
20471 && (type_dependent_expression_p (TREE_OPERAND (cond
, 0))
20472 || type_dependent_expression_p (TREE_OPERAND (cond
, 1))))
20475 if (TREE_CODE (incr
) == MODOP_EXPR
)
20477 if (type_dependent_expression_p (TREE_OPERAND (incr
, 0))
20478 || type_dependent_expression_p (TREE_OPERAND (incr
, 2)))
20481 else if (type_dependent_expression_p (incr
))
20483 else if (TREE_CODE (incr
) == MODIFY_EXPR
)
20485 if (type_dependent_expression_p (TREE_OPERAND (incr
, 0)))
20487 else if (BINARY_CLASS_P (TREE_OPERAND (incr
, 1)))
20489 tree t
= TREE_OPERAND (incr
, 1);
20490 if (type_dependent_expression_p (TREE_OPERAND (t
, 0))
20491 || type_dependent_expression_p (TREE_OPERAND (t
, 1)))
20500 /* TYPE is a TYPENAME_TYPE. Returns the ordinary TYPE to which the
20501 TYPENAME_TYPE corresponds. Returns the original TYPENAME_TYPE if
20502 no such TYPE can be found. Note that this function peers inside
20503 uninstantiated templates and therefore should be used only in
20504 extremely limited situations. ONLY_CURRENT_P restricts this
20505 peering to the currently open classes hierarchy (which is required
20506 when comparing types). */
20509 resolve_typename_type (tree type
, bool only_current_p
)
20518 gcc_assert (TREE_CODE (type
) == TYPENAME_TYPE
);
20520 scope
= TYPE_CONTEXT (type
);
20521 /* Usually the non-qualified identifier of a TYPENAME_TYPE is
20522 TYPE_IDENTIFIER (type). But when 'type' is a typedef variant of
20523 a TYPENAME_TYPE node, then TYPE_NAME (type) is set to the TYPE_DECL representing
20524 the typedef. In that case TYPE_IDENTIFIER (type) is not the non-qualified
20525 identifier of the TYPENAME_TYPE anymore.
20526 So by getting the TYPE_IDENTIFIER of the _main declaration_ of the
20527 TYPENAME_TYPE instead, we avoid messing up with a possible
20528 typedef variant case. */
20529 name
= TYPE_IDENTIFIER (TYPE_MAIN_VARIANT (type
));
20531 /* If the SCOPE is itself a TYPENAME_TYPE, then we need to resolve
20532 it first before we can figure out what NAME refers to. */
20533 if (TREE_CODE (scope
) == TYPENAME_TYPE
)
20535 if (TYPENAME_IS_RESOLVING_P (scope
))
20536 /* Given a class template A with a dependent base with nested type C,
20537 typedef typename A::C::C C will land us here, as trying to resolve
20538 the initial A::C leads to the local C typedef, which leads back to
20539 A::C::C. So we break the recursion now. */
20542 scope
= resolve_typename_type (scope
, only_current_p
);
20544 /* If we don't know what SCOPE refers to, then we cannot resolve the
20546 if (TREE_CODE (scope
) == TYPENAME_TYPE
)
20548 /* If the SCOPE is a template type parameter, we have no way of
20549 resolving the name. */
20550 if (TREE_CODE (scope
) == TEMPLATE_TYPE_PARM
)
20552 /* If the SCOPE is not the current instantiation, there's no reason
20553 to look inside it. */
20554 if (only_current_p
&& !currently_open_class (scope
))
20556 /* If this is a typedef, we don't want to look inside (c++/11987). */
20557 if (typedef_variant_p (type
))
20559 /* If SCOPE isn't the template itself, it will not have a valid
20560 TYPE_FIELDS list. */
20561 if (same_type_p (scope
, CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope
)))
20562 /* scope is either the template itself or a compatible instantiation
20563 like X<T>, so look up the name in the original template. */
20564 scope
= CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope
);
20566 /* scope is a partial instantiation, so we can't do the lookup or we
20567 will lose the template arguments. */
20569 /* Enter the SCOPE so that name lookup will be resolved as if we
20570 were in the class definition. In particular, SCOPE will no
20571 longer be considered a dependent type. */
20572 pushed_scope
= push_scope (scope
);
20573 /* Look up the declaration. */
20574 decl
= lookup_member (scope
, name
, /*protect=*/0, /*want_type=*/true,
20575 tf_warning_or_error
);
20577 result
= NULL_TREE
;
20579 /* For a TYPENAME_TYPE like "typename X::template Y<T>", we want to
20580 find a TEMPLATE_DECL. Otherwise, we want to find a TYPE_DECL. */
20583 else if (identifier_p (TYPENAME_TYPE_FULLNAME (type
))
20584 && TREE_CODE (decl
) == TYPE_DECL
)
20586 result
= TREE_TYPE (decl
);
20587 if (result
== error_mark_node
)
20588 result
= NULL_TREE
;
20590 else if (TREE_CODE (TYPENAME_TYPE_FULLNAME (type
)) == TEMPLATE_ID_EXPR
20591 && DECL_CLASS_TEMPLATE_P (decl
))
20595 /* Obtain the template and the arguments. */
20596 tmpl
= TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type
), 0);
20597 args
= TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type
), 1);
20598 /* Instantiate the template. */
20599 result
= lookup_template_class (tmpl
, args
, NULL_TREE
, NULL_TREE
,
20600 /*entering_scope=*/0,
20601 tf_error
| tf_user
);
20602 if (result
== error_mark_node
)
20603 result
= NULL_TREE
;
20606 /* Leave the SCOPE. */
20608 pop_scope (pushed_scope
);
20610 /* If we failed to resolve it, return the original typename. */
20614 /* If lookup found a typename type, resolve that too. */
20615 if (TREE_CODE (result
) == TYPENAME_TYPE
&& !TYPENAME_IS_RESOLVING_P (result
))
20617 /* Ill-formed programs can cause infinite recursion here, so we
20618 must catch that. */
20619 TYPENAME_IS_RESOLVING_P (type
) = 1;
20620 result
= resolve_typename_type (result
, only_current_p
);
20621 TYPENAME_IS_RESOLVING_P (type
) = 0;
20624 /* Qualify the resulting type. */
20625 quals
= cp_type_quals (type
);
20627 result
= cp_build_qualified_type (result
, cp_type_quals (result
) | quals
);
20632 /* EXPR is an expression which is not type-dependent. Return a proxy
20633 for EXPR that can be used to compute the types of larger
20634 expressions containing EXPR. */
20637 build_non_dependent_expr (tree expr
)
20641 #ifdef ENABLE_CHECKING
20642 /* Try to get a constant value for all non-dependent expressions in
20643 order to expose bugs in *_dependent_expression_p and constexpr. */
20644 if (cxx_dialect
>= cxx0x
)
20645 maybe_constant_value (fold_non_dependent_expr_sfinae (expr
, tf_none
));
20648 /* Preserve OVERLOADs; the functions must be available to resolve
20651 if (TREE_CODE (inner_expr
) == STMT_EXPR
)
20652 inner_expr
= stmt_expr_value_expr (inner_expr
);
20653 if (TREE_CODE (inner_expr
) == ADDR_EXPR
)
20654 inner_expr
= TREE_OPERAND (inner_expr
, 0);
20655 if (TREE_CODE (inner_expr
) == COMPONENT_REF
)
20656 inner_expr
= TREE_OPERAND (inner_expr
, 1);
20657 if (is_overloaded_fn (inner_expr
)
20658 || TREE_CODE (inner_expr
) == OFFSET_REF
)
20660 /* There is no need to return a proxy for a variable. */
20663 /* Preserve string constants; conversions from string constants to
20664 "char *" are allowed, even though normally a "const char *"
20665 cannot be used to initialize a "char *". */
20666 if (TREE_CODE (expr
) == STRING_CST
)
20668 /* Preserve arithmetic constants, as an optimization -- there is no
20669 reason to create a new node. */
20670 if (TREE_CODE (expr
) == INTEGER_CST
|| TREE_CODE (expr
) == REAL_CST
)
20672 /* Preserve THROW_EXPRs -- all throw-expressions have type "void".
20673 There is at least one place where we want to know that a
20674 particular expression is a throw-expression: when checking a ?:
20675 expression, there are special rules if the second or third
20676 argument is a throw-expression. */
20677 if (TREE_CODE (expr
) == THROW_EXPR
)
20680 /* Don't wrap an initializer list, we need to be able to look inside. */
20681 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
20684 /* Don't wrap a dummy object, we need to be able to test for it. */
20685 if (is_dummy_object (expr
))
20688 if (TREE_CODE (expr
) == COND_EXPR
)
20689 return build3 (COND_EXPR
,
20691 TREE_OPERAND (expr
, 0),
20692 (TREE_OPERAND (expr
, 1)
20693 ? build_non_dependent_expr (TREE_OPERAND (expr
, 1))
20694 : build_non_dependent_expr (TREE_OPERAND (expr
, 0))),
20695 build_non_dependent_expr (TREE_OPERAND (expr
, 2)));
20696 if (TREE_CODE (expr
) == COMPOUND_EXPR
20697 && !COMPOUND_EXPR_OVERLOADED (expr
))
20698 return build2 (COMPOUND_EXPR
,
20700 TREE_OPERAND (expr
, 0),
20701 build_non_dependent_expr (TREE_OPERAND (expr
, 1)));
20703 /* If the type is unknown, it can't really be non-dependent */
20704 gcc_assert (TREE_TYPE (expr
) != unknown_type_node
);
20706 /* Otherwise, build a NON_DEPENDENT_EXPR. */
20707 return build1 (NON_DEPENDENT_EXPR
, TREE_TYPE (expr
), expr
);
20710 /* ARGS is a vector of expressions as arguments to a function call.
20711 Replace the arguments with equivalent non-dependent expressions.
20712 This modifies ARGS in place. */
20715 make_args_non_dependent (vec
<tree
, va_gc
> *args
)
20720 FOR_EACH_VEC_SAFE_ELT (args
, ix
, arg
)
20722 tree newarg
= build_non_dependent_expr (arg
);
20724 (*args
)[ix
] = newarg
;
20728 /* Returns a type which represents 'auto' or 'decltype(auto)'. We use a
20729 TEMPLATE_TYPE_PARM with a level one deeper than the actual template
20733 make_auto_1 (tree name
)
20735 tree au
= cxx_make_type (TEMPLATE_TYPE_PARM
);
20736 TYPE_NAME (au
) = build_decl (BUILTINS_LOCATION
,
20737 TYPE_DECL
, name
, au
);
20738 TYPE_STUB_DECL (au
) = TYPE_NAME (au
);
20739 TEMPLATE_TYPE_PARM_INDEX (au
) = build_template_parm_index
20740 (0, processing_template_decl
+ 1, processing_template_decl
+ 1,
20741 TYPE_NAME (au
), NULL_TREE
);
20742 TYPE_CANONICAL (au
) = canonical_type_parameter (au
);
20743 DECL_ARTIFICIAL (TYPE_NAME (au
)) = 1;
20744 SET_DECL_TEMPLATE_PARM_P (TYPE_NAME (au
));
20750 make_decltype_auto (void)
20752 return make_auto_1 (get_identifier ("decltype(auto)"));
20758 return make_auto_1 (get_identifier ("auto"));
20761 /* Given type ARG, return std::initializer_list<ARG>. */
20766 tree std_init_list
= namespace_binding
20767 (get_identifier ("initializer_list"), std_node
);
20769 if (!std_init_list
|| !DECL_CLASS_TEMPLATE_P (std_init_list
))
20771 error ("deducing from brace-enclosed initializer list requires "
20772 "#include <initializer_list>");
20773 return error_mark_node
;
20775 argvec
= make_tree_vec (1);
20776 TREE_VEC_ELT (argvec
, 0) = arg
;
20777 return lookup_template_class (std_init_list
, argvec
, NULL_TREE
,
20778 NULL_TREE
, 0, tf_warning_or_error
);
20781 /* Replace auto in TYPE with std::initializer_list<auto>. */
20784 listify_autos (tree type
, tree auto_node
)
20786 tree init_auto
= listify (auto_node
);
20787 tree argvec
= make_tree_vec (1);
20788 TREE_VEC_ELT (argvec
, 0) = init_auto
;
20789 if (processing_template_decl
)
20790 argvec
= add_to_template_args (current_template_args (), argvec
);
20791 return tsubst (type
, argvec
, tf_warning_or_error
, NULL_TREE
);
20794 /* Replace occurrences of 'auto' in TYPE with the appropriate type deduced
20795 from INIT. AUTO_NODE is the TEMPLATE_TYPE_PARM used for 'auto' in TYPE. */
20798 do_auto_deduction (tree type
, tree init
, tree auto_node
)
20802 if (init
== error_mark_node
)
20803 return error_mark_node
;
20805 if (type_dependent_expression_p (init
))
20806 /* Defining a subset of type-dependent expressions that we can deduce
20807 from ahead of time isn't worth the trouble. */
20810 /* [dcl.spec.auto]: Obtain P from T by replacing the occurrences of auto
20811 with either a new invented type template parameter U or, if the
20812 initializer is a braced-init-list (8.5.4), with
20813 std::initializer_list<U>. */
20814 if (BRACE_ENCLOSED_INITIALIZER_P (init
))
20815 type
= listify_autos (type
, auto_node
);
20817 init
= resolve_nondeduced_context (init
);
20819 targs
= make_tree_vec (1);
20820 if (AUTO_IS_DECLTYPE (auto_node
))
20822 bool id
= (DECL_P (init
) || TREE_CODE (init
) == COMPONENT_REF
);
20823 TREE_VEC_ELT (targs
, 0)
20824 = finish_decltype_type (init
, id
, tf_warning_or_error
);
20825 if (type
!= auto_node
)
20827 error ("%qT as type rather than plain %<decltype(auto)%>", type
);
20828 return error_mark_node
;
20833 tree parms
= build_tree_list (NULL_TREE
, type
);
20834 tree tparms
= make_tree_vec (1);
20837 TREE_VEC_ELT (tparms
, 0)
20838 = build_tree_list (NULL_TREE
, TYPE_NAME (auto_node
));
20839 val
= type_unification_real (tparms
, targs
, parms
, &init
, 1, 0,
20840 DEDUCE_CALL
, LOOKUP_NORMAL
,
20841 /*explain_p=*/false);
20844 if (processing_template_decl
)
20845 /* Try again at instantiation time. */
20847 if (type
&& type
!= error_mark_node
)
20848 /* If type is error_mark_node a diagnostic must have been
20849 emitted by now. Also, having a mention to '<type error>'
20850 in the diagnostic is not really useful to the user. */
20852 if (cfun
&& auto_node
== current_function_auto_return_pattern
20853 && LAMBDA_FUNCTION_P (current_function_decl
))
20854 error ("unable to deduce lambda return type from %qE", init
);
20856 error ("unable to deduce %qT from %qE", type
, init
);
20858 return error_mark_node
;
20862 /* If the list of declarators contains more than one declarator, the type
20863 of each declared variable is determined as described above. If the
20864 type deduced for the template parameter U is not the same in each
20865 deduction, the program is ill-formed. */
20866 if (TREE_TYPE (auto_node
)
20867 && !same_type_p (TREE_TYPE (auto_node
), TREE_VEC_ELT (targs
, 0)))
20869 if (cfun
&& auto_node
== current_function_auto_return_pattern
20870 && LAMBDA_FUNCTION_P (current_function_decl
))
20871 error ("inconsistent types %qT and %qT deduced for "
20872 "lambda return type", TREE_TYPE (auto_node
),
20873 TREE_VEC_ELT (targs
, 0));
20875 error ("inconsistent deduction for %qT: %qT and then %qT",
20876 auto_node
, TREE_TYPE (auto_node
), TREE_VEC_ELT (targs
, 0));
20877 return error_mark_node
;
20879 TREE_TYPE (auto_node
) = TREE_VEC_ELT (targs
, 0);
20881 if (processing_template_decl
)
20882 targs
= add_to_template_args (current_template_args (), targs
);
20883 return tsubst (type
, targs
, tf_warning_or_error
, NULL_TREE
);
20886 /* Substitutes LATE_RETURN_TYPE for 'auto' in TYPE and returns the
20890 splice_late_return_type (tree type
, tree late_return_type
)
20894 if (late_return_type
== NULL_TREE
)
20896 argvec
= make_tree_vec (1);
20897 TREE_VEC_ELT (argvec
, 0) = late_return_type
;
20898 if (processing_template_parmlist
)
20899 /* For a late-specified return type in a template type-parameter, we
20900 need to add a dummy argument level for its parmlist. */
20901 argvec
= add_to_template_args
20902 (make_tree_vec (processing_template_parmlist
), argvec
);
20903 if (current_template_parms
)
20904 argvec
= add_to_template_args (current_template_args (), argvec
);
20905 return tsubst (type
, argvec
, tf_warning_or_error
, NULL_TREE
);
20908 /* Returns true iff TYPE is a TEMPLATE_TYPE_PARM representing 'auto' or
20909 'decltype(auto)'. */
20912 is_auto (const_tree type
)
20914 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
20915 && (TYPE_IDENTIFIER (type
) == get_identifier ("auto")
20916 || TYPE_IDENTIFIER (type
) == get_identifier ("decltype(auto)")))
20922 /* Returns true iff TYPE contains a use of 'auto'. Since auto can only
20923 appear as a type-specifier for the declaration in question, we don't
20924 have to look through the whole type. */
20927 type_uses_auto (tree type
)
20929 enum tree_code code
;
20930 if (is_auto (type
))
20933 code
= TREE_CODE (type
);
20935 if (code
== POINTER_TYPE
|| code
== REFERENCE_TYPE
20936 || code
== OFFSET_TYPE
|| code
== FUNCTION_TYPE
20937 || code
== METHOD_TYPE
|| code
== ARRAY_TYPE
)
20938 return type_uses_auto (TREE_TYPE (type
));
20940 if (TYPE_PTRMEMFUNC_P (type
))
20941 return type_uses_auto (TREE_TYPE (TREE_TYPE
20942 (TYPE_PTRMEMFUNC_FN_TYPE (type
))));
20947 /* For a given template T, return the vector of typedefs referenced
20948 in T for which access check is needed at T instantiation time.
20949 T is either a FUNCTION_DECL or a RECORD_TYPE.
20950 Those typedefs were added to T by the function
20951 append_type_to_template_for_access_check. */
20953 vec
<qualified_typedef_usage_t
, va_gc
> *
20954 get_types_needing_access_check (tree t
)
20957 vec
<qualified_typedef_usage_t
, va_gc
> *result
= NULL
;
20959 if (!t
|| t
== error_mark_node
)
20962 if (!(ti
= get_template_info (t
)))
20965 if (CLASS_TYPE_P (t
)
20966 || TREE_CODE (t
) == FUNCTION_DECL
)
20968 if (!TI_TEMPLATE (ti
))
20971 result
= TI_TYPEDEFS_NEEDING_ACCESS_CHECKING (ti
);
20977 /* Append the typedef TYPE_DECL used in template T to a list of typedefs
20978 tied to T. That list of typedefs will be access checked at
20979 T instantiation time.
20980 T is either a FUNCTION_DECL or a RECORD_TYPE.
20981 TYPE_DECL is a TYPE_DECL node representing a typedef.
20982 SCOPE is the scope through which TYPE_DECL is accessed.
20983 LOCATION is the location of the usage point of TYPE_DECL.
20985 This function is a subroutine of
20986 append_type_to_template_for_access_check. */
20989 append_type_to_template_for_access_check_1 (tree t
,
20992 location_t location
)
20994 qualified_typedef_usage_t typedef_usage
;
20997 if (!t
|| t
== error_mark_node
)
21000 gcc_assert ((TREE_CODE (t
) == FUNCTION_DECL
21001 || CLASS_TYPE_P (t
))
21003 && TREE_CODE (type_decl
) == TYPE_DECL
21006 if (!(ti
= get_template_info (t
)))
21009 gcc_assert (TI_TEMPLATE (ti
));
21011 typedef_usage
.typedef_decl
= type_decl
;
21012 typedef_usage
.context
= scope
;
21013 typedef_usage
.locus
= location
;
21015 vec_safe_push (TI_TYPEDEFS_NEEDING_ACCESS_CHECKING (ti
), typedef_usage
);
21018 /* Append TYPE_DECL to the template TEMPL.
21019 TEMPL is either a class type, a FUNCTION_DECL or a a TEMPLATE_DECL.
21020 At TEMPL instanciation time, TYPE_DECL will be checked to see
21021 if it can be accessed through SCOPE.
21022 LOCATION is the location of the usage point of TYPE_DECL.
21024 e.g. consider the following code snippet:
21031 template<class U> struct S
21033 C::myint mi; // <-- usage point of the typedef C::myint
21038 At S<char> instantiation time, we need to check the access of C::myint
21039 In other words, we need to check the access of the myint typedef through
21040 the C scope. For that purpose, this function will add the myint typedef
21041 and the scope C through which its being accessed to a list of typedefs
21042 tied to the template S. That list will be walked at template instantiation
21043 time and access check performed on each typedefs it contains.
21044 Note that this particular code snippet should yield an error because
21045 myint is private to C. */
21048 append_type_to_template_for_access_check (tree templ
,
21051 location_t location
)
21053 qualified_typedef_usage_t
*iter
;
21056 gcc_assert (type_decl
&& (TREE_CODE (type_decl
) == TYPE_DECL
));
21058 /* Make sure we don't append the type to the template twice. */
21059 FOR_EACH_VEC_SAFE_ELT (get_types_needing_access_check (templ
), i
, iter
)
21060 if (iter
->typedef_decl
== type_decl
&& scope
== iter
->context
)
21063 append_type_to_template_for_access_check_1 (templ
, type_decl
,
21067 /* Set up the hash tables for template instantiations. */
21070 init_template_processing (void)
21072 decl_specializations
= htab_create_ggc (37,
21073 hash_specialization
,
21074 eq_specializations
,
21076 type_specializations
= htab_create_ggc (37,
21077 hash_specialization
,
21078 eq_specializations
,
21082 /* Print stats about the template hash tables for -fstats. */
21085 print_template_statistics (void)
21087 fprintf (stderr
, "decl_specializations: size %ld, %ld elements, "
21088 "%f collisions\n", (long) htab_size (decl_specializations
),
21089 (long) htab_elements (decl_specializations
),
21090 htab_collisions (decl_specializations
));
21091 fprintf (stderr
, "type_specializations: size %ld, %ld elements, "
21092 "%f collisions\n", (long) htab_size (type_specializations
),
21093 (long) htab_elements (type_specializations
),
21094 htab_collisions (type_specializations
));
21097 #include "gt-cp-pt.h"