1 /* Handle parameterized types (templates) for GNU -*- C++ -*-.
2 Copyright (C) 1992-2014 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"
32 #include "stringpool.h"
35 #include "stor-layout.h"
37 #include "pointer-set.h"
40 #include "c-family/c-common.h"
41 #include "c-family/c-objc.h"
42 #include "cp-objcp-common.h"
43 #include "tree-inline.h"
47 #include "tree-iterator.h"
48 #include "type-utils.h"
51 /* The type of functions taking a tree, and some additional data, and
53 typedef int (*tree_fn_t
) (tree
, void*);
55 /* The PENDING_TEMPLATES is a TREE_LIST of templates whose
56 instantiations have been deferred, either because their definitions
57 were not yet available, or because we were putting off doing the work. */
58 struct GTY ((chain_next ("%h.next"))) pending_template
{
59 struct pending_template
*next
;
60 struct tinst_level
*tinst
;
63 static GTY(()) struct pending_template
*pending_templates
;
64 static GTY(()) struct pending_template
*last_pending_template
;
66 int processing_template_parmlist
;
67 static int template_header_count
;
69 static GTY(()) tree saved_trees
;
70 static vec
<int> inline_parm_levels
;
72 static GTY(()) struct tinst_level
*current_tinst_level
;
74 static GTY(()) tree saved_access_scope
;
76 /* Live only within one (recursive) call to tsubst_expr. We use
77 this to pass the statement expression node from the STMT_EXPR
78 to the EXPR_STMT that is its result. */
79 static tree cur_stmt_expr
;
81 /* True if we've recursed into fn_type_unification too many times. */
82 static bool excessive_deduction_depth
;
84 typedef struct GTY(()) spec_entry
91 static GTY ((param_is (spec_entry
)))
92 htab_t decl_specializations
;
94 static GTY ((param_is (spec_entry
)))
95 htab_t type_specializations
;
97 /* Contains canonical template parameter types. The vector is indexed by
98 the TEMPLATE_TYPE_IDX of the template parameter. Each element is a
99 TREE_LIST, whose TREE_VALUEs contain the canonical template
100 parameters of various types and levels. */
101 static GTY(()) vec
<tree
, va_gc
> *canonical_template_parms
;
103 #define UNIFY_ALLOW_NONE 0
104 #define UNIFY_ALLOW_MORE_CV_QUAL 1
105 #define UNIFY_ALLOW_LESS_CV_QUAL 2
106 #define UNIFY_ALLOW_DERIVED 4
107 #define UNIFY_ALLOW_INTEGER 8
108 #define UNIFY_ALLOW_OUTER_LEVEL 16
109 #define UNIFY_ALLOW_OUTER_MORE_CV_QUAL 32
110 #define UNIFY_ALLOW_OUTER_LESS_CV_QUAL 64
112 enum template_base_result
{
114 tbr_ambiguous_baseclass
,
118 static void push_access_scope (tree
);
119 static void pop_access_scope (tree
);
120 static bool resolve_overloaded_unification (tree
, tree
, tree
, tree
,
121 unification_kind_t
, int,
123 static int try_one_overload (tree
, tree
, tree
, tree
, tree
,
124 unification_kind_t
, int, bool, bool);
125 static int unify (tree
, tree
, tree
, tree
, int, bool);
126 static void add_pending_template (tree
);
127 static tree
reopen_tinst_level (struct tinst_level
*);
128 static tree
tsubst_initializer_list (tree
, tree
);
129 static tree
get_class_bindings (tree
, tree
, tree
, tree
);
130 static tree
coerce_template_parms (tree
, tree
, tree
, tsubst_flags_t
,
132 static tree
coerce_innermost_template_parms (tree
, tree
, tree
, tsubst_flags_t
,
134 static void tsubst_enum (tree
, tree
, tree
);
135 static tree
add_to_template_args (tree
, tree
);
136 static tree
add_outermost_template_args (tree
, tree
);
137 static bool check_instantiated_args (tree
, tree
, tsubst_flags_t
);
138 static int maybe_adjust_types_for_deduction (unification_kind_t
, tree
*, tree
*,
140 static int type_unification_real (tree
, tree
, tree
, const tree
*,
141 unsigned int, int, unification_kind_t
, int,
142 vec
<deferred_access_check
, va_gc
> **,
144 static void note_template_header (int);
145 static tree
convert_nontype_argument_function (tree
, tree
);
146 static tree
convert_nontype_argument (tree
, tree
, tsubst_flags_t
);
147 static tree
convert_template_argument (tree
, tree
, tree
,
148 tsubst_flags_t
, int, tree
);
149 static int for_each_template_parm (tree
, tree_fn_t
, void*,
150 struct pointer_set_t
*, bool);
151 static tree
expand_template_argument_pack (tree
);
152 static tree
build_template_parm_index (int, int, int, tree
, tree
);
153 static bool inline_needs_template_parms (tree
, bool);
154 static void push_inline_template_parms_recursive (tree
, int);
155 static tree
retrieve_local_specialization (tree
);
156 static void register_local_specialization (tree
, tree
);
157 static hashval_t
hash_specialization (const void *p
);
158 static tree
reduce_template_parm_level (tree
, tree
, int, tree
, tsubst_flags_t
);
159 static int mark_template_parm (tree
, void *);
160 static int template_parm_this_level_p (tree
, void *);
161 static tree
tsubst_friend_function (tree
, tree
);
162 static tree
tsubst_friend_class (tree
, tree
);
163 static int can_complete_type_without_circularity (tree
);
164 static tree
get_bindings (tree
, tree
, tree
, bool);
165 static int template_decl_level (tree
);
166 static int check_cv_quals_for_unify (int, tree
, tree
);
167 static void template_parm_level_and_index (tree
, int*, int*);
168 static int unify_pack_expansion (tree
, tree
, tree
,
169 tree
, unification_kind_t
, bool, bool);
170 static tree
tsubst_template_arg (tree
, tree
, tsubst_flags_t
, tree
);
171 static tree
tsubst_template_args (tree
, tree
, tsubst_flags_t
, tree
);
172 static tree
tsubst_template_parms (tree
, tree
, tsubst_flags_t
);
173 static void regenerate_decl_from_template (tree
, tree
);
174 static tree
most_specialized_class (tree
, tsubst_flags_t
);
175 static tree
tsubst_aggr_type (tree
, tree
, tsubst_flags_t
, tree
, int);
176 static tree
tsubst_arg_types (tree
, tree
, tree
, tsubst_flags_t
, tree
);
177 static tree
tsubst_function_type (tree
, tree
, tsubst_flags_t
, tree
);
178 static bool check_specialization_scope (void);
179 static tree
process_partial_specialization (tree
);
180 static void set_current_access_from_decl (tree
);
181 static enum template_base_result
get_template_base (tree
, tree
, tree
, tree
,
183 static tree
try_class_unification (tree
, tree
, tree
, tree
, bool);
184 static int coerce_template_template_parms (tree
, tree
, tsubst_flags_t
,
186 static bool template_template_parm_bindings_ok_p (tree
, tree
);
187 static int template_args_equal (tree
, tree
);
188 static void tsubst_default_arguments (tree
, tsubst_flags_t
);
189 static tree
for_each_template_parm_r (tree
*, int *, void *);
190 static tree
copy_default_args_to_explicit_spec_1 (tree
, tree
);
191 static void copy_default_args_to_explicit_spec (tree
);
192 static int invalid_nontype_parm_type_p (tree
, tsubst_flags_t
);
193 static bool dependent_template_arg_p (tree
);
194 static bool any_template_arguments_need_structural_equality_p (tree
);
195 static bool dependent_type_p_r (tree
);
196 static tree
tsubst_expr (tree
, tree
, tsubst_flags_t
, tree
, bool);
197 static tree
tsubst_copy (tree
, tree
, tsubst_flags_t
, tree
);
198 static tree
tsubst_pack_expansion (tree
, tree
, tsubst_flags_t
, tree
);
199 static tree
tsubst_decl (tree
, tree
, tsubst_flags_t
);
200 static void perform_typedefs_access_check (tree tmpl
, tree targs
);
201 static void append_type_to_template_for_access_check_1 (tree
, tree
, tree
,
203 static tree
listify (tree
);
204 static tree
listify_autos (tree
, tree
);
205 static tree
template_parm_to_arg (tree t
);
206 static tree
current_template_args (void);
207 static tree
tsubst_template_parm (tree
, tree
, tsubst_flags_t
);
208 static tree
instantiate_alias_template (tree
, tree
, tsubst_flags_t
);
210 /* Make the current scope suitable for access checking when we are
211 processing T. T can be FUNCTION_DECL for instantiated function
212 template, VAR_DECL for static member variable, or TYPE_DECL for
213 alias template (needed by instantiate_decl). */
216 push_access_scope (tree t
)
218 gcc_assert (VAR_OR_FUNCTION_DECL_P (t
)
219 || TREE_CODE (t
) == TYPE_DECL
);
221 if (DECL_FRIEND_CONTEXT (t
))
222 push_nested_class (DECL_FRIEND_CONTEXT (t
));
223 else if (DECL_CLASS_SCOPE_P (t
))
224 push_nested_class (DECL_CONTEXT (t
));
226 push_to_top_level ();
228 if (TREE_CODE (t
) == FUNCTION_DECL
)
230 saved_access_scope
= tree_cons
231 (NULL_TREE
, current_function_decl
, saved_access_scope
);
232 current_function_decl
= t
;
236 /* Restore the scope set up by push_access_scope. T is the node we
240 pop_access_scope (tree t
)
242 if (TREE_CODE (t
) == FUNCTION_DECL
)
244 current_function_decl
= TREE_VALUE (saved_access_scope
);
245 saved_access_scope
= TREE_CHAIN (saved_access_scope
);
248 if (DECL_FRIEND_CONTEXT (t
) || DECL_CLASS_SCOPE_P (t
))
251 pop_from_top_level ();
254 /* Do any processing required when DECL (a member template
255 declaration) is finished. Returns the TEMPLATE_DECL corresponding
256 to DECL, unless it is a specialization, in which case the DECL
257 itself is returned. */
260 finish_member_template_decl (tree decl
)
262 if (decl
== error_mark_node
)
263 return error_mark_node
;
265 gcc_assert (DECL_P (decl
));
267 if (TREE_CODE (decl
) == TYPE_DECL
)
271 type
= TREE_TYPE (decl
);
272 if (type
== error_mark_node
)
273 return error_mark_node
;
274 if (MAYBE_CLASS_TYPE_P (type
)
275 && CLASSTYPE_TEMPLATE_INFO (type
)
276 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
278 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
279 check_member_template (tmpl
);
284 else if (TREE_CODE (decl
) == FIELD_DECL
)
285 error ("data member %qD cannot be a member template", decl
);
286 else if (DECL_TEMPLATE_INFO (decl
))
288 if (!DECL_TEMPLATE_SPECIALIZATION (decl
))
290 check_member_template (DECL_TI_TEMPLATE (decl
));
291 return DECL_TI_TEMPLATE (decl
);
297 error ("invalid member template declaration %qD", decl
);
299 return error_mark_node
;
302 /* Create a template info node. */
305 build_template_info (tree template_decl
, tree template_args
)
307 tree result
= make_node (TEMPLATE_INFO
);
308 TI_TEMPLATE (result
) = template_decl
;
309 TI_ARGS (result
) = template_args
;
313 /* Return the template info node corresponding to T, whatever T is. */
316 get_template_info (const_tree t
)
318 tree tinfo
= NULL_TREE
;
320 if (!t
|| t
== error_mark_node
)
323 if (TREE_CODE (t
) == NAMESPACE_DECL
)
326 if (DECL_P (t
) && DECL_LANG_SPECIFIC (t
))
327 tinfo
= DECL_TEMPLATE_INFO (t
);
329 if (!tinfo
&& DECL_IMPLICIT_TYPEDEF_P (t
))
332 if (OVERLOAD_TYPE_P (t
))
333 tinfo
= TYPE_TEMPLATE_INFO (t
);
334 else if (TREE_CODE (t
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
335 tinfo
= TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t
);
340 /* Returns the template nesting level of the indicated class TYPE.
350 A<T>::B<U> has depth two, while A<T> has depth one.
351 Both A<T>::B<int> and A<int>::B<U> have depth one, if
352 they are instantiations, not specializations.
354 This function is guaranteed to return 0 if passed NULL_TREE so
355 that, for example, `template_class_depth (current_class_type)' is
359 template_class_depth (tree type
)
364 type
&& TREE_CODE (type
) != NAMESPACE_DECL
;
365 type
= (TREE_CODE (type
) == FUNCTION_DECL
)
366 ? CP_DECL_CONTEXT (type
) : CP_TYPE_CONTEXT (type
))
368 tree tinfo
= get_template_info (type
);
370 if (tinfo
&& PRIMARY_TEMPLATE_P (TI_TEMPLATE (tinfo
))
371 && uses_template_parms (INNERMOST_TEMPLATE_ARGS (TI_ARGS (tinfo
))))
378 /* Subroutine of maybe_begin_member_template_processing.
379 Returns true if processing DECL needs us to push template parms. */
382 inline_needs_template_parms (tree decl
, bool nsdmi
)
384 if (!decl
|| (!nsdmi
&& ! DECL_TEMPLATE_INFO (decl
)))
387 return (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (most_general_template (decl
)))
388 > (processing_template_decl
+ DECL_TEMPLATE_SPECIALIZATION (decl
)));
391 /* Subroutine of maybe_begin_member_template_processing.
392 Push the template parms in PARMS, starting from LEVELS steps into the
393 chain, and ending at the beginning, since template parms are listed
397 push_inline_template_parms_recursive (tree parmlist
, int levels
)
399 tree parms
= TREE_VALUE (parmlist
);
403 push_inline_template_parms_recursive (TREE_CHAIN (parmlist
), levels
- 1);
405 ++processing_template_decl
;
406 current_template_parms
407 = tree_cons (size_int (processing_template_decl
),
408 parms
, current_template_parms
);
409 TEMPLATE_PARMS_FOR_INLINE (current_template_parms
) = 1;
411 begin_scope (TREE_VEC_LENGTH (parms
) ? sk_template_parms
: sk_template_spec
,
413 for (i
= 0; i
< TREE_VEC_LENGTH (parms
); ++i
)
415 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
417 if (error_operand_p (parm
))
420 gcc_assert (DECL_P (parm
));
422 switch (TREE_CODE (parm
))
431 /* Make a CONST_DECL as is done in process_template_parm.
432 It is ugly that we recreate this here; the original
433 version built in process_template_parm is no longer
435 tree decl
= build_decl (DECL_SOURCE_LOCATION (parm
),
436 CONST_DECL
, DECL_NAME (parm
),
438 DECL_ARTIFICIAL (decl
) = 1;
439 TREE_CONSTANT (decl
) = 1;
440 TREE_READONLY (decl
) = 1;
441 DECL_INITIAL (decl
) = DECL_INITIAL (parm
);
442 SET_DECL_TEMPLATE_PARM_P (decl
);
453 /* Restore the template parameter context for a member template, a
454 friend template defined in a class definition, or a non-template
455 member of template class. */
458 maybe_begin_member_template_processing (tree decl
)
462 bool nsdmi
= TREE_CODE (decl
) == FIELD_DECL
;
465 decl
= (CLASSTYPE_TEMPLATE_INFO (DECL_CONTEXT (decl
))
466 ? CLASSTYPE_TI_TEMPLATE (DECL_CONTEXT (decl
))
469 if (inline_needs_template_parms (decl
, nsdmi
))
471 parms
= DECL_TEMPLATE_PARMS (most_general_template (decl
));
472 levels
= TMPL_PARMS_DEPTH (parms
) - processing_template_decl
;
474 if (DECL_TEMPLATE_SPECIALIZATION (decl
))
477 parms
= TREE_CHAIN (parms
);
480 push_inline_template_parms_recursive (parms
, levels
);
483 /* Remember how many levels of template parameters we pushed so that
484 we can pop them later. */
485 inline_parm_levels
.safe_push (levels
);
488 /* Undo the effects of maybe_begin_member_template_processing. */
491 maybe_end_member_template_processing (void)
496 if (inline_parm_levels
.length () == 0)
499 last
= inline_parm_levels
.pop ();
500 for (i
= 0; i
< last
; ++i
)
502 --processing_template_decl
;
503 current_template_parms
= TREE_CHAIN (current_template_parms
);
508 /* Return a new template argument vector which contains all of ARGS,
509 but has as its innermost set of arguments the EXTRA_ARGS. */
512 add_to_template_args (tree args
, tree extra_args
)
519 if (args
== NULL_TREE
|| extra_args
== error_mark_node
)
522 extra_depth
= TMPL_ARGS_DEPTH (extra_args
);
523 new_args
= make_tree_vec (TMPL_ARGS_DEPTH (args
) + extra_depth
);
525 for (i
= 1; i
<= TMPL_ARGS_DEPTH (args
); ++i
)
526 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (args
, i
));
528 for (j
= 1; j
<= extra_depth
; ++j
, ++i
)
529 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (extra_args
, j
));
534 /* Like add_to_template_args, but only the outermost ARGS are added to
535 the EXTRA_ARGS. In particular, all but TMPL_ARGS_DEPTH
536 (EXTRA_ARGS) levels are added. This function is used to combine
537 the template arguments from a partial instantiation with the
538 template arguments used to attain the full instantiation from the
539 partial instantiation. */
542 add_outermost_template_args (tree args
, tree extra_args
)
546 /* If there are more levels of EXTRA_ARGS than there are ARGS,
547 something very fishy is going on. */
548 gcc_assert (TMPL_ARGS_DEPTH (args
) >= TMPL_ARGS_DEPTH (extra_args
));
550 /* If *all* the new arguments will be the EXTRA_ARGS, just return
552 if (TMPL_ARGS_DEPTH (args
) == TMPL_ARGS_DEPTH (extra_args
))
555 /* For the moment, we make ARGS look like it contains fewer levels. */
556 TREE_VEC_LENGTH (args
) -= TMPL_ARGS_DEPTH (extra_args
);
558 new_args
= add_to_template_args (args
, extra_args
);
560 /* Now, we restore ARGS to its full dimensions. */
561 TREE_VEC_LENGTH (args
) += TMPL_ARGS_DEPTH (extra_args
);
566 /* Return the N levels of innermost template arguments from the ARGS. */
569 get_innermost_template_args (tree args
, int n
)
577 /* If N is 1, just return the innermost set of template arguments. */
579 return TMPL_ARGS_LEVEL (args
, TMPL_ARGS_DEPTH (args
));
581 /* If we're not removing anything, just return the arguments we were
583 extra_levels
= TMPL_ARGS_DEPTH (args
) - n
;
584 gcc_assert (extra_levels
>= 0);
585 if (extra_levels
== 0)
588 /* Make a new set of arguments, not containing the outer arguments. */
589 new_args
= make_tree_vec (n
);
590 for (i
= 1; i
<= n
; ++i
)
591 SET_TMPL_ARGS_LEVEL (new_args
, i
,
592 TMPL_ARGS_LEVEL (args
, i
+ extra_levels
));
597 /* The inverse of get_innermost_template_args: Return all but the innermost
598 EXTRA_LEVELS levels of template arguments from the ARGS. */
601 strip_innermost_template_args (tree args
, int extra_levels
)
604 int n
= TMPL_ARGS_DEPTH (args
) - extra_levels
;
609 /* If N is 1, just return the outermost set of template arguments. */
611 return TMPL_ARGS_LEVEL (args
, 1);
613 /* If we're not removing anything, just return the arguments we were
615 gcc_assert (extra_levels
>= 0);
616 if (extra_levels
== 0)
619 /* Make a new set of arguments, not containing the inner arguments. */
620 new_args
= make_tree_vec (n
);
621 for (i
= 1; i
<= n
; ++i
)
622 SET_TMPL_ARGS_LEVEL (new_args
, i
,
623 TMPL_ARGS_LEVEL (args
, i
));
628 /* We've got a template header coming up; push to a new level for storing
632 begin_template_parm_list (void)
634 /* We use a non-tag-transparent scope here, which causes pushtag to
635 put tags in this scope, rather than in the enclosing class or
636 namespace scope. This is the right thing, since we want
637 TEMPLATE_DECLS, and not TYPE_DECLS for template classes. For a
638 global template class, push_template_decl handles putting the
639 TEMPLATE_DECL into top-level scope. For a nested template class,
642 template <class T> struct S1 {
643 template <class T> struct S2 {};
646 pushtag contains special code to call pushdecl_with_scope on the
647 TEMPLATE_DECL for S2. */
648 begin_scope (sk_template_parms
, NULL
);
649 ++processing_template_decl
;
650 ++processing_template_parmlist
;
651 note_template_header (0);
654 /* This routine is called when a specialization is declared. If it is
655 invalid to declare a specialization here, an error is reported and
656 false is returned, otherwise this routine will return true. */
659 check_specialization_scope (void)
661 tree scope
= current_scope ();
665 An explicit specialization shall be declared in the namespace of
666 which the template is a member, or, for member templates, in the
667 namespace of which the enclosing class or enclosing class
668 template is a member. An explicit specialization of a member
669 function, member class or static data member of a class template
670 shall be declared in the namespace of which the class template
672 if (scope
&& TREE_CODE (scope
) != NAMESPACE_DECL
)
674 error ("explicit specialization in non-namespace scope %qD", scope
);
680 In an explicit specialization declaration for a member of a class
681 template or a member template that appears in namespace scope,
682 the member template and some of its enclosing class templates may
683 remain unspecialized, except that the declaration shall not
684 explicitly specialize a class member template if its enclosing
685 class templates are not explicitly specialized as well. */
686 if (current_template_parms
)
688 error ("enclosing class templates are not explicitly specialized");
695 /* We've just seen template <>. */
698 begin_specialization (void)
700 begin_scope (sk_template_spec
, NULL
);
701 note_template_header (1);
702 return check_specialization_scope ();
705 /* Called at then end of processing a declaration preceded by
709 end_specialization (void)
712 reset_specialization ();
715 /* Any template <>'s that we have seen thus far are not referring to a
716 function specialization. */
719 reset_specialization (void)
721 processing_specialization
= 0;
722 template_header_count
= 0;
725 /* We've just seen a template header. If SPECIALIZATION is nonzero,
726 it was of the form template <>. */
729 note_template_header (int specialization
)
731 processing_specialization
= specialization
;
732 template_header_count
++;
735 /* We're beginning an explicit instantiation. */
738 begin_explicit_instantiation (void)
740 gcc_assert (!processing_explicit_instantiation
);
741 processing_explicit_instantiation
= true;
746 end_explicit_instantiation (void)
748 gcc_assert (processing_explicit_instantiation
);
749 processing_explicit_instantiation
= false;
752 /* An explicit specialization or partial specialization of TMPL is being
753 declared. Check that the namespace in which the specialization is
754 occurring is permissible. Returns false iff it is invalid to
755 specialize TMPL in the current namespace. */
758 check_specialization_namespace (tree tmpl
)
760 tree tpl_ns
= decl_namespace_context (tmpl
);
764 An explicit specialization shall be declared in the namespace of
765 which the template is a member, or, for member templates, in the
766 namespace of which the enclosing class or enclosing class
767 template is a member. An explicit specialization of a member
768 function, member class or static data member of a class template
769 shall be declared in the namespace of which the class template is
771 if (current_scope() != DECL_CONTEXT (tmpl
)
772 && !at_namespace_scope_p ())
774 error ("specialization of %qD must appear at namespace scope", tmpl
);
777 if (is_associated_namespace (current_namespace
, tpl_ns
))
778 /* Same or super-using namespace. */
782 permerror (input_location
, "specialization of %qD in different namespace", tmpl
);
783 permerror (input_location
, " from definition of %q+#D", tmpl
);
788 /* SPEC is an explicit instantiation. Check that it is valid to
789 perform this explicit instantiation in the current namespace. */
792 check_explicit_instantiation_namespace (tree spec
)
796 /* DR 275: An explicit instantiation shall appear in an enclosing
797 namespace of its template. */
798 ns
= decl_namespace_context (spec
);
799 if (!is_ancestor (current_namespace
, ns
))
800 permerror (input_location
, "explicit instantiation of %qD in namespace %qD "
801 "(which does not enclose namespace %qD)",
802 spec
, current_namespace
, ns
);
805 /* The TYPE is being declared. If it is a template type, that means it
806 is a partial specialization. Do appropriate error-checking. */
809 maybe_process_partial_specialization (tree type
)
813 if (type
== error_mark_node
)
814 return error_mark_node
;
816 /* A lambda that appears in specialization context is not itself a
818 if (CLASS_TYPE_P (type
) && CLASSTYPE_LAMBDA_EXPR (type
))
821 if (TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
823 error ("name of class shadows template template parameter %qD",
825 return error_mark_node
;
828 context
= TYPE_CONTEXT (type
);
830 if (TYPE_ALIAS_P (type
))
832 if (TYPE_TEMPLATE_INFO (type
)
833 && DECL_ALIAS_TEMPLATE_P (TYPE_TI_TEMPLATE (type
)))
834 error ("specialization of alias template %qD",
835 TYPE_TI_TEMPLATE (type
));
837 error ("explicit specialization of non-template %qT", type
);
838 return error_mark_node
;
840 else if (CLASS_TYPE_P (type
) && CLASSTYPE_USE_TEMPLATE (type
))
842 /* This is for ordinary explicit specialization and partial
843 specialization of a template class such as:
845 template <> class C<int>;
849 template <class T> class C<T*>;
851 Make sure that `C<int>' and `C<T*>' are implicit instantiations. */
853 if (CLASSTYPE_IMPLICIT_INSTANTIATION (type
)
854 && !COMPLETE_TYPE_P (type
))
856 if (!check_specialization_namespace (CLASSTYPE_TI_TEMPLATE (type
))
857 && !at_namespace_scope_p ())
858 return error_mark_node
;
859 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type
);
860 DECL_SOURCE_LOCATION (TYPE_MAIN_DECL (type
)) = input_location
;
861 if (processing_template_decl
)
863 if (push_template_decl (TYPE_MAIN_DECL (type
))
865 return error_mark_node
;
868 else if (CLASSTYPE_TEMPLATE_INSTANTIATION (type
))
869 error ("specialization of %qT after instantiation", type
);
870 else if (errorcount
&& !processing_specialization
871 && CLASSTYPE_TEMPLATE_SPECIALIZATION (type
)
872 && !uses_template_parms (CLASSTYPE_TI_ARGS (type
)))
873 /* Trying to define a specialization either without a template<> header
874 or in an inappropriate place. We've already given an error, so just
875 bail now so we don't actually define the specialization. */
876 return error_mark_node
;
878 else if (CLASS_TYPE_P (type
)
879 && !CLASSTYPE_USE_TEMPLATE (type
)
880 && CLASSTYPE_TEMPLATE_INFO (type
)
881 && context
&& CLASS_TYPE_P (context
)
882 && CLASSTYPE_TEMPLATE_INFO (context
))
884 /* This is for an explicit specialization of member class
885 template according to [temp.expl.spec/18]:
887 template <> template <class U> class C<int>::D;
889 The context `C<int>' must be an implicit instantiation.
890 Otherwise this is just a member class template declared
893 template <> class C<int> { template <class U> class D; };
894 template <> template <class U> class C<int>::D;
896 In the first case, `C<int>::D' is a specialization of `C<T>::D'
897 while in the second case, `C<int>::D' is a primary template
898 and `C<T>::D' may not exist. */
900 if (CLASSTYPE_IMPLICIT_INSTANTIATION (context
)
901 && !COMPLETE_TYPE_P (type
))
904 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
906 if (current_namespace
907 != decl_namespace_context (tmpl
))
909 permerror (input_location
, "specializing %q#T in different namespace", type
);
910 permerror (input_location
, " from definition of %q+#D", tmpl
);
913 /* Check for invalid specialization after instantiation:
915 template <> template <> class C<int>::D<int>;
916 template <> template <class U> class C<int>::D; */
918 for (t
= DECL_TEMPLATE_INSTANTIATIONS (tmpl
);
919 t
; t
= TREE_CHAIN (t
))
921 tree inst
= TREE_VALUE (t
);
922 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (inst
)
923 || !COMPLETE_OR_OPEN_TYPE_P (inst
))
925 /* We already have a full specialization of this partial
926 instantiation, or a full specialization has been
927 looked up but not instantiated. Reassign it to the
928 new member specialization template. */
933 elt
.tmpl
= most_general_template (tmpl
);
934 elt
.args
= CLASSTYPE_TI_ARGS (inst
);
937 htab_remove_elt (type_specializations
, &elt
);
940 elt
.args
= INNERMOST_TEMPLATE_ARGS (elt
.args
);
942 slot
= htab_find_slot (type_specializations
, &elt
, INSERT
);
943 entry
= ggc_alloc_spec_entry ();
948 /* But if we've had an implicit instantiation, that's a
949 problem ([temp.expl.spec]/6). */
950 error ("specialization %qT after instantiation %qT",
954 /* Mark TYPE as a specialization. And as a result, we only
955 have one level of template argument for the innermost
957 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type
);
958 DECL_SOURCE_LOCATION (TYPE_MAIN_DECL (type
)) = input_location
;
959 CLASSTYPE_TI_ARGS (type
)
960 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type
));
963 else if (processing_specialization
)
965 /* Someday C++0x may allow for enum template specialization. */
966 if (cxx_dialect
> cxx98
&& TREE_CODE (type
) == ENUMERAL_TYPE
967 && CLASS_TYPE_P (context
) && CLASSTYPE_USE_TEMPLATE (context
))
968 pedwarn (input_location
, OPT_Wpedantic
, "template specialization "
969 "of %qD not allowed by ISO C++", type
);
972 error ("explicit specialization of non-template %qT", type
);
973 return error_mark_node
;
980 /* Returns nonzero if we can optimize the retrieval of specializations
981 for TMPL, a TEMPLATE_DECL. In particular, for such a template, we
982 do not use DECL_TEMPLATE_SPECIALIZATIONS at all. */
985 optimize_specialization_lookup_p (tree tmpl
)
987 return (DECL_FUNCTION_TEMPLATE_P (tmpl
)
988 && DECL_CLASS_SCOPE_P (tmpl
)
989 /* DECL_CLASS_SCOPE_P holds of T::f even if T is a template
991 && CLASS_TYPE_P (DECL_CONTEXT (tmpl
))
992 /* The optimized lookup depends on the fact that the
993 template arguments for the member function template apply
994 purely to the containing class, which is not true if the
995 containing class is an explicit or partial
997 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (tmpl
))
998 && !DECL_MEMBER_TEMPLATE_P (tmpl
)
999 && !DECL_CONV_FN_P (tmpl
)
1000 /* It is possible to have a template that is not a member
1001 template and is not a member of a template class:
1003 template <typename T>
1004 struct S { friend A::f(); };
1006 Here, the friend function is a template, but the context does
1007 not have template information. The optimized lookup relies
1008 on having ARGS be the template arguments for both the class
1009 and the function template. */
1010 && !DECL_FRIEND_P (DECL_TEMPLATE_RESULT (tmpl
)));
1013 /* Retrieve the specialization (in the sense of [temp.spec] - a
1014 specialization is either an instantiation or an explicit
1015 specialization) of TMPL for the given template ARGS. If there is
1016 no such specialization, return NULL_TREE. The ARGS are a vector of
1017 arguments, or a vector of vectors of arguments, in the case of
1018 templates with more than one level of parameters.
1020 If TMPL is a type template and CLASS_SPECIALIZATIONS_P is true,
1021 then we search for a partial specialization matching ARGS. This
1022 parameter is ignored if TMPL is not a class template.
1024 We can also look up a FIELD_DECL, if it is a lambda capture pack; the
1025 result is a NONTYPE_ARGUMENT_PACK. */
1028 retrieve_specialization (tree tmpl
, tree args
, hashval_t hash
)
1030 if (tmpl
== NULL_TREE
)
1033 if (args
== error_mark_node
)
1036 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
1037 || TREE_CODE (tmpl
) == FIELD_DECL
);
1039 /* There should be as many levels of arguments as there are
1040 levels of parameters. */
1041 gcc_assert (TMPL_ARGS_DEPTH (args
)
1042 == (TREE_CODE (tmpl
) == TEMPLATE_DECL
1043 ? TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
))
1044 : template_class_depth (DECL_CONTEXT (tmpl
))));
1046 if (optimize_specialization_lookup_p (tmpl
))
1048 tree class_template
;
1049 tree class_specialization
;
1050 vec
<tree
, va_gc
> *methods
;
1054 /* The template arguments actually apply to the containing
1055 class. Find the class specialization with those
1057 class_template
= CLASSTYPE_TI_TEMPLATE (DECL_CONTEXT (tmpl
));
1058 class_specialization
1059 = retrieve_specialization (class_template
, args
, 0);
1060 if (!class_specialization
)
1062 /* Now, find the appropriate entry in the CLASSTYPE_METHOD_VEC
1063 for the specialization. */
1064 idx
= class_method_index_for_fn (class_specialization
, tmpl
);
1067 /* Iterate through the methods with the indicated name, looking
1068 for the one that has an instance of TMPL. */
1069 methods
= CLASSTYPE_METHOD_VEC (class_specialization
);
1070 for (fns
= (*methods
)[idx
]; fns
; fns
= OVL_NEXT (fns
))
1072 tree fn
= OVL_CURRENT (fns
);
1073 if (DECL_TEMPLATE_INFO (fn
) && DECL_TI_TEMPLATE (fn
) == tmpl
1074 /* using-declarations can add base methods to the method vec,
1075 and we don't want those here. */
1076 && DECL_CONTEXT (fn
) == class_specialization
)
1085 htab_t specializations
;
1089 elt
.spec
= NULL_TREE
;
1091 if (DECL_CLASS_TEMPLATE_P (tmpl
))
1092 specializations
= type_specializations
;
1094 specializations
= decl_specializations
;
1097 hash
= hash_specialization (&elt
);
1098 found
= (spec_entry
*) htab_find_with_hash (specializations
, &elt
, hash
);
1106 /* Like retrieve_specialization, but for local declarations. */
1109 retrieve_local_specialization (tree tmpl
)
1113 if (local_specializations
== NULL
)
1116 slot
= pointer_map_contains (local_specializations
, tmpl
);
1117 return slot
? (tree
) *slot
: NULL_TREE
;
1120 /* Returns nonzero iff DECL is a specialization of TMPL. */
1123 is_specialization_of (tree decl
, tree tmpl
)
1127 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1131 t
= DECL_TEMPLATE_INFO (t
) ? DECL_TI_TEMPLATE (t
) : NULL_TREE
)
1137 gcc_assert (TREE_CODE (decl
) == TYPE_DECL
);
1139 for (t
= TREE_TYPE (decl
);
1141 t
= CLASSTYPE_USE_TEMPLATE (t
)
1142 ? TREE_TYPE (CLASSTYPE_TI_TEMPLATE (t
)) : NULL_TREE
)
1143 if (same_type_ignoring_top_level_qualifiers_p (t
, TREE_TYPE (tmpl
)))
1150 /* Returns nonzero iff DECL is a specialization of friend declaration
1151 FRIEND_DECL according to [temp.friend]. */
1154 is_specialization_of_friend (tree decl
, tree friend_decl
)
1156 bool need_template
= true;
1159 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
1160 || TREE_CODE (decl
) == TYPE_DECL
);
1162 /* For [temp.friend/6] when FRIEND_DECL is an ordinary member function
1163 of a template class, we want to check if DECL is a specialization
1165 if (TREE_CODE (friend_decl
) == FUNCTION_DECL
1166 && DECL_TEMPLATE_INFO (friend_decl
)
1167 && !DECL_USE_TEMPLATE (friend_decl
))
1169 /* We want a TEMPLATE_DECL for `is_specialization_of'. */
1170 friend_decl
= DECL_TI_TEMPLATE (friend_decl
);
1171 need_template
= false;
1173 else if (TREE_CODE (friend_decl
) == TEMPLATE_DECL
1174 && !PRIMARY_TEMPLATE_P (friend_decl
))
1175 need_template
= false;
1177 /* There is nothing to do if this is not a template friend. */
1178 if (TREE_CODE (friend_decl
) != TEMPLATE_DECL
)
1181 if (is_specialization_of (decl
, friend_decl
))
1185 A member of a class template may be declared to be a friend of a
1186 non-template class. In this case, the corresponding member of
1187 every specialization of the class template is a friend of the
1188 class granting friendship.
1190 For example, given a template friend declaration
1192 template <class T> friend void A<T>::f();
1194 the member function below is considered a friend
1196 template <> struct A<int> {
1200 For this type of template friend, TEMPLATE_DEPTH below will be
1201 nonzero. To determine if DECL is a friend of FRIEND, we first
1202 check if the enclosing class is a specialization of another. */
1204 template_depth
= template_class_depth (CP_DECL_CONTEXT (friend_decl
));
1206 && DECL_CLASS_SCOPE_P (decl
)
1207 && is_specialization_of (TYPE_NAME (DECL_CONTEXT (decl
)),
1208 CLASSTYPE_TI_TEMPLATE (DECL_CONTEXT (friend_decl
))))
1210 /* Next, we check the members themselves. In order to handle
1211 a few tricky cases, such as when FRIEND_DECL's are
1213 template <class T> friend void A<T>::g(T t);
1214 template <class T> template <T t> friend void A<T>::h();
1218 void A<int>::g(int);
1219 template <int> void A<int>::h();
1221 we need to figure out ARGS, the template arguments from
1222 the context of DECL. This is required for template substitution
1223 of `T' in the function parameter of `g' and template parameter
1224 of `h' in the above examples. Here ARGS corresponds to `int'. */
1226 tree context
= DECL_CONTEXT (decl
);
1227 tree args
= NULL_TREE
;
1228 int current_depth
= 0;
1230 while (current_depth
< template_depth
)
1232 if (CLASSTYPE_TEMPLATE_INFO (context
))
1234 if (current_depth
== 0)
1235 args
= TYPE_TI_ARGS (context
);
1237 args
= add_to_template_args (TYPE_TI_ARGS (context
), args
);
1240 context
= TYPE_CONTEXT (context
);
1243 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1248 tree friend_args_type
;
1249 tree decl_args_type
;
1251 /* Make sure that both DECL and FRIEND_DECL are templates or
1253 is_template
= DECL_TEMPLATE_INFO (decl
)
1254 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl
));
1255 if (need_template
^ is_template
)
1257 else if (is_template
)
1259 /* If both are templates, check template parameter list. */
1261 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_decl
),
1263 if (!comp_template_parms
1264 (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (decl
)),
1268 decl_type
= TREE_TYPE (DECL_TI_TEMPLATE (decl
));
1271 decl_type
= TREE_TYPE (decl
);
1273 friend_type
= tsubst_function_type (TREE_TYPE (friend_decl
), args
,
1274 tf_none
, NULL_TREE
);
1275 if (friend_type
== error_mark_node
)
1278 /* Check if return types match. */
1279 if (!same_type_p (TREE_TYPE (decl_type
), TREE_TYPE (friend_type
)))
1282 /* Check if function parameter types match, ignoring the
1283 `this' parameter. */
1284 friend_args_type
= TYPE_ARG_TYPES (friend_type
);
1285 decl_args_type
= TYPE_ARG_TYPES (decl_type
);
1286 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (friend_decl
))
1287 friend_args_type
= TREE_CHAIN (friend_args_type
);
1288 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1289 decl_args_type
= TREE_CHAIN (decl_args_type
);
1291 return compparms (decl_args_type
, friend_args_type
);
1295 /* DECL is a TYPE_DECL */
1297 tree decl_type
= TREE_TYPE (decl
);
1299 /* Make sure that both DECL and FRIEND_DECL are templates or
1302 = CLASSTYPE_TEMPLATE_INFO (decl_type
)
1303 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (decl_type
));
1305 if (need_template
^ is_template
)
1307 else if (is_template
)
1310 /* If both are templates, check the name of the two
1311 TEMPLATE_DECL's first because is_friend didn't. */
1312 if (DECL_NAME (CLASSTYPE_TI_TEMPLATE (decl_type
))
1313 != DECL_NAME (friend_decl
))
1316 /* Now check template parameter list. */
1318 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_decl
),
1320 return comp_template_parms
1321 (DECL_TEMPLATE_PARMS (CLASSTYPE_TI_TEMPLATE (decl_type
)),
1325 return (DECL_NAME (decl
)
1326 == DECL_NAME (friend_decl
));
1332 /* Register the specialization SPEC as a specialization of TMPL with
1333 the indicated ARGS. IS_FRIEND indicates whether the specialization
1334 is actually just a friend declaration. Returns SPEC, or an
1335 equivalent prior declaration, if available.
1337 We also store instantiations of field packs in the hash table, even
1338 though they are not themselves templates, to make lookup easier. */
1341 register_specialization (tree spec
, tree tmpl
, tree args
, bool is_friend
,
1348 gcc_assert ((TREE_CODE (tmpl
) == TEMPLATE_DECL
&& DECL_P (spec
))
1349 || (TREE_CODE (tmpl
) == FIELD_DECL
1350 && TREE_CODE (spec
) == NONTYPE_ARGUMENT_PACK
));
1352 if (TREE_CODE (spec
) == FUNCTION_DECL
1353 && uses_template_parms (DECL_TI_ARGS (spec
)))
1354 /* This is the FUNCTION_DECL for a partial instantiation. Don't
1355 register it; we want the corresponding TEMPLATE_DECL instead.
1356 We use `uses_template_parms (DECL_TI_ARGS (spec))' rather than
1357 the more obvious `uses_template_parms (spec)' to avoid problems
1358 with default function arguments. In particular, given
1359 something like this:
1361 template <class T> void f(T t1, T t = T())
1363 the default argument expression is not substituted for in an
1364 instantiation unless and until it is actually needed. */
1367 if (optimize_specialization_lookup_p (tmpl
))
1368 /* We don't put these specializations in the hash table, but we might
1369 want to give an error about a mismatch. */
1370 fn
= retrieve_specialization (tmpl
, args
, 0);
1378 hash
= hash_specialization (&elt
);
1381 htab_find_slot_with_hash (decl_specializations
, &elt
, hash
, INSERT
);
1383 fn
= ((spec_entry
*) *slot
)->spec
;
1388 /* We can sometimes try to re-register a specialization that we've
1389 already got. In particular, regenerate_decl_from_template calls
1390 duplicate_decls which will update the specialization list. But,
1391 we'll still get called again here anyhow. It's more convenient
1392 to simply allow this than to try to prevent it. */
1395 else if (fn
&& DECL_TEMPLATE_SPECIALIZATION (spec
))
1397 if (DECL_TEMPLATE_INSTANTIATION (fn
))
1399 if (DECL_ODR_USED (fn
)
1400 || DECL_EXPLICIT_INSTANTIATION (fn
))
1402 error ("specialization of %qD after instantiation",
1404 return error_mark_node
;
1409 /* This situation should occur only if the first
1410 specialization is an implicit instantiation, the
1411 second is an explicit specialization, and the
1412 implicit instantiation has not yet been used. That
1413 situation can occur if we have implicitly
1414 instantiated a member function and then specialized
1417 We can also wind up here if a friend declaration that
1418 looked like an instantiation turns out to be a
1421 template <class T> void foo(T);
1422 class S { friend void foo<>(int) };
1423 template <> void foo(int);
1425 We transform the existing DECL in place so that any
1426 pointers to it become pointers to the updated
1429 If there was a definition for the template, but not
1430 for the specialization, we want this to look as if
1431 there were no definition, and vice versa. */
1432 DECL_INITIAL (fn
) = NULL_TREE
;
1433 duplicate_decls (spec
, fn
, is_friend
);
1434 /* The call to duplicate_decls will have applied
1437 An explicit specialization of a function template
1438 is inline only if it is explicitly declared to be,
1439 and independently of whether its function template
1442 to the primary function; now copy the inline bits to
1443 the various clones. */
1444 FOR_EACH_CLONE (clone
, fn
)
1446 DECL_DECLARED_INLINE_P (clone
)
1447 = DECL_DECLARED_INLINE_P (fn
);
1448 DECL_SOURCE_LOCATION (clone
)
1449 = DECL_SOURCE_LOCATION (fn
);
1450 DECL_DELETED_FN (clone
)
1451 = DECL_DELETED_FN (fn
);
1453 check_specialization_namespace (tmpl
);
1458 else if (DECL_TEMPLATE_SPECIALIZATION (fn
))
1460 if (!duplicate_decls (spec
, fn
, is_friend
) && DECL_INITIAL (spec
))
1461 /* Dup decl failed, but this is a new definition. Set the
1462 line number so any errors match this new
1464 DECL_SOURCE_LOCATION (fn
) = DECL_SOURCE_LOCATION (spec
);
1470 return duplicate_decls (spec
, fn
, is_friend
);
1472 /* A specialization must be declared in the same namespace as the
1473 template it is specializing. */
1474 if (DECL_P (spec
) && DECL_TEMPLATE_SPECIALIZATION (spec
)
1475 && !check_specialization_namespace (tmpl
))
1476 DECL_CONTEXT (spec
) = DECL_CONTEXT (tmpl
);
1478 if (slot
!= NULL
/* !optimize_specialization_lookup_p (tmpl) */)
1480 spec_entry
*entry
= ggc_alloc_spec_entry ();
1481 gcc_assert (tmpl
&& args
&& spec
);
1484 if (TREE_CODE (spec
) == FUNCTION_DECL
&& DECL_NAMESPACE_SCOPE_P (spec
)
1485 && PRIMARY_TEMPLATE_P (tmpl
)
1486 && DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (tmpl
)) == NULL_TREE
)
1487 /* TMPL is a forward declaration of a template function; keep a list
1488 of all specializations in case we need to reassign them to a friend
1489 template later in tsubst_friend_function. */
1490 DECL_TEMPLATE_INSTANTIATIONS (tmpl
)
1491 = tree_cons (args
, spec
, DECL_TEMPLATE_INSTANTIATIONS (tmpl
));
1497 /* Returns true iff two spec_entry nodes are equivalent. Only compares the
1498 TMPL and ARGS members, ignores SPEC. */
1500 int comparing_specializations
;
1503 eq_specializations (const void *p1
, const void *p2
)
1505 const spec_entry
*e1
= (const spec_entry
*)p1
;
1506 const spec_entry
*e2
= (const spec_entry
*)p2
;
1509 ++comparing_specializations
;
1510 equal
= (e1
->tmpl
== e2
->tmpl
1511 && comp_template_args (e1
->args
, e2
->args
));
1512 --comparing_specializations
;
1517 /* Returns a hash for a template TMPL and template arguments ARGS. */
1520 hash_tmpl_and_args (tree tmpl
, tree args
)
1522 hashval_t val
= DECL_UID (tmpl
);
1523 return iterative_hash_template_arg (args
, val
);
1526 /* Returns a hash for a spec_entry node based on the TMPL and ARGS members,
1530 hash_specialization (const void *p
)
1532 const spec_entry
*e
= (const spec_entry
*)p
;
1533 return hash_tmpl_and_args (e
->tmpl
, e
->args
);
1536 /* Recursively calculate a hash value for a template argument ARG, for use
1537 in the hash tables of template specializations. */
1540 iterative_hash_template_arg (tree arg
, hashval_t val
)
1542 unsigned HOST_WIDE_INT i
;
1543 enum tree_code code
;
1546 if (arg
== NULL_TREE
)
1547 return iterative_hash_object (arg
, val
);
1552 if (TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
1553 /* We can get one of these when re-hashing a previous entry in the middle
1554 of substituting into a pack expansion. Just look through it. */
1555 arg
= ARGUMENT_PACK_SELECT_FROM_PACK (arg
);
1557 code
= TREE_CODE (arg
);
1558 tclass
= TREE_CODE_CLASS (code
);
1560 val
= iterative_hash_object (code
, val
);
1567 case IDENTIFIER_NODE
:
1568 return iterative_hash_object (IDENTIFIER_HASH_VALUE (arg
), val
);
1572 int i
, len
= TREE_VEC_LENGTH (arg
);
1573 for (i
= 0; i
< len
; ++i
)
1574 val
= iterative_hash_template_arg (TREE_VEC_ELT (arg
, i
), val
);
1578 case TYPE_PACK_EXPANSION
:
1579 case EXPR_PACK_EXPANSION
:
1580 val
= iterative_hash_template_arg (PACK_EXPANSION_PATTERN (arg
), val
);
1581 return iterative_hash_template_arg (PACK_EXPANSION_EXTRA_ARGS (arg
), val
);
1583 case TYPE_ARGUMENT_PACK
:
1584 case NONTYPE_ARGUMENT_PACK
:
1585 return iterative_hash_template_arg (ARGUMENT_PACK_ARGS (arg
), val
);
1588 for (; arg
; arg
= TREE_CHAIN (arg
))
1589 val
= iterative_hash_template_arg (TREE_VALUE (arg
), val
);
1593 for (; arg
; arg
= OVL_NEXT (arg
))
1594 val
= iterative_hash_template_arg (OVL_CURRENT (arg
), val
);
1600 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (arg
), i
, field
, value
)
1602 val
= iterative_hash_template_arg (field
, val
);
1603 val
= iterative_hash_template_arg (value
, val
);
1609 if (!DECL_ARTIFICIAL (arg
))
1611 val
= iterative_hash_object (DECL_PARM_INDEX (arg
), val
);
1612 val
= iterative_hash_object (DECL_PARM_LEVEL (arg
), val
);
1614 return iterative_hash_template_arg (TREE_TYPE (arg
), val
);
1617 return iterative_hash_template_arg (TARGET_EXPR_INITIAL (arg
), val
);
1620 val
= iterative_hash_template_arg (PTRMEM_CST_CLASS (arg
), val
);
1621 return iterative_hash_template_arg (PTRMEM_CST_MEMBER (arg
), val
);
1623 case TEMPLATE_PARM_INDEX
:
1624 val
= iterative_hash_template_arg
1625 (TREE_TYPE (TEMPLATE_PARM_DECL (arg
)), val
);
1626 val
= iterative_hash_object (TEMPLATE_PARM_LEVEL (arg
), val
);
1627 return iterative_hash_object (TEMPLATE_PARM_IDX (arg
), val
);
1630 val
= iterative_hash_object (TRAIT_EXPR_KIND (arg
), val
);
1631 val
= iterative_hash_template_arg (TRAIT_EXPR_TYPE1 (arg
), val
);
1632 return iterative_hash_template_arg (TRAIT_EXPR_TYPE2 (arg
), val
);
1635 val
= iterative_hash_template_arg (BINFO_TYPE (BASELINK_BINFO (arg
)),
1637 return iterative_hash_template_arg (DECL_NAME (get_first_fn (arg
)),
1641 val
= iterative_hash_template_arg (TREE_OPERAND (arg
, 0), val
);
1642 code
= TREE_CODE (TREE_OPERAND (arg
, 1));
1643 val
= iterative_hash_object (code
, val
);
1644 return iterative_hash_template_arg (TREE_OPERAND (arg
, 2), val
);
1647 /* A lambda can't appear in a template arg, but don't crash on
1649 gcc_assert (seen_error ());
1653 case IMPLICIT_CONV_EXPR
:
1654 case STATIC_CAST_EXPR
:
1655 case REINTERPRET_CAST_EXPR
:
1656 case CONST_CAST_EXPR
:
1657 case DYNAMIC_CAST_EXPR
:
1659 val
= iterative_hash_template_arg (TREE_TYPE (arg
), val
);
1660 /* Now hash operands as usual. */
1670 if (TYPE_CANONICAL (arg
))
1671 return iterative_hash_object (TYPE_HASH (TYPE_CANONICAL (arg
)),
1673 else if (TREE_CODE (arg
) == DECLTYPE_TYPE
)
1674 return iterative_hash_template_arg (DECLTYPE_TYPE_EXPR (arg
), val
);
1675 /* Otherwise just compare the types during lookup. */
1678 case tcc_declaration
:
1680 return iterative_hash_expr (arg
, val
);
1683 gcc_assert (IS_EXPR_CODE_CLASS (tclass
));
1685 unsigned n
= cp_tree_operand_length (arg
);
1686 for (i
= 0; i
< n
; ++i
)
1687 val
= iterative_hash_template_arg (TREE_OPERAND (arg
, i
), val
);
1695 /* Unregister the specialization SPEC as a specialization of TMPL.
1696 Replace it with NEW_SPEC, if NEW_SPEC is non-NULL. Returns true
1697 if the SPEC was listed as a specialization of TMPL.
1699 Note that SPEC has been ggc_freed, so we can't look inside it. */
1702 reregister_specialization (tree spec
, tree tinfo
, tree new_spec
)
1707 elt
.tmpl
= most_general_template (TI_TEMPLATE (tinfo
));
1708 elt
.args
= TI_ARGS (tinfo
);
1709 elt
.spec
= NULL_TREE
;
1711 entry
= (spec_entry
*) htab_find (decl_specializations
, &elt
);
1714 gcc_assert (entry
->spec
== spec
|| entry
->spec
== new_spec
);
1715 gcc_assert (new_spec
!= NULL_TREE
);
1716 entry
->spec
= new_spec
;
1723 /* Like register_specialization, but for local declarations. We are
1724 registering SPEC, an instantiation of TMPL. */
1727 register_local_specialization (tree spec
, tree tmpl
)
1731 slot
= pointer_map_insert (local_specializations
, tmpl
);
1735 /* TYPE is a class type. Returns true if TYPE is an explicitly
1736 specialized class. */
1739 explicit_class_specialization_p (tree type
)
1741 if (!CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
1743 return !uses_template_parms (CLASSTYPE_TI_ARGS (type
));
1746 /* Print the list of functions at FNS, going through all the overloads
1747 for each element of the list. Alternatively, FNS can not be a
1748 TREE_LIST, in which case it will be printed together with all the
1751 MORE and *STR should respectively be FALSE and NULL when the function
1752 is called from the outside. They are used internally on recursive
1753 calls. print_candidates manages the two parameters and leaves NULL
1754 in *STR when it ends. */
1757 print_candidates_1 (tree fns
, bool more
, const char **str
)
1760 char *spaces
= NULL
;
1762 for (fn
= fns
; fn
; fn
= OVL_NEXT (fn
))
1763 if (TREE_CODE (fn
) == TREE_LIST
)
1765 for (fn2
= fn
; fn2
!= NULL_TREE
; fn2
= TREE_CHAIN (fn2
))
1766 print_candidates_1 (TREE_VALUE (fn2
),
1767 TREE_CHAIN (fn2
) || more
, str
);
1771 tree cand
= OVL_CURRENT (fn
);
1774 /* Pick the prefix string. */
1775 if (!more
&& !OVL_NEXT (fns
))
1777 inform (DECL_SOURCE_LOCATION (cand
),
1778 "candidate is: %#D", cand
);
1782 *str
= _("candidates are:");
1783 spaces
= get_spaces (*str
);
1785 inform (DECL_SOURCE_LOCATION (cand
), "%s %#D", *str
, cand
);
1786 *str
= spaces
? spaces
: *str
;
1796 /* Print the list of candidate FNS in an error message. FNS can also
1797 be a TREE_LIST of non-functions in the case of an ambiguous lookup. */
1800 print_candidates (tree fns
)
1802 const char *str
= NULL
;
1803 print_candidates_1 (fns
, false, &str
);
1804 gcc_assert (str
== NULL
);
1807 /* Returns the template (one of the functions given by TEMPLATE_ID)
1808 which can be specialized to match the indicated DECL with the
1809 explicit template args given in TEMPLATE_ID. The DECL may be
1810 NULL_TREE if none is available. In that case, the functions in
1811 TEMPLATE_ID are non-members.
1813 If NEED_MEMBER_TEMPLATE is nonzero the function is known to be a
1814 specialization of a member template.
1816 The TEMPLATE_COUNT is the number of references to qualifying
1817 template classes that appeared in the name of the function. See
1818 check_explicit_specialization for a more accurate description.
1820 TSK indicates what kind of template declaration (if any) is being
1821 declared. TSK_TEMPLATE indicates that the declaration given by
1822 DECL, though a FUNCTION_DECL, has template parameters, and is
1823 therefore a template function.
1825 The template args (those explicitly specified and those deduced)
1826 are output in a newly created vector *TARGS_OUT.
1828 If it is impossible to determine the result, an error message is
1829 issued. The error_mark_node is returned to indicate failure. */
1832 determine_specialization (tree template_id
,
1835 int need_member_template
,
1841 tree explicit_targs
;
1842 tree candidates
= NULL_TREE
;
1843 /* A TREE_LIST of templates of which DECL may be a specialization.
1844 The TREE_VALUE of each node is a TEMPLATE_DECL. The
1845 corresponding TREE_PURPOSE is the set of template arguments that,
1846 when used to instantiate the template, would produce a function
1847 with the signature of DECL. */
1848 tree templates
= NULL_TREE
;
1850 cp_binding_level
*b
;
1852 *targs_out
= NULL_TREE
;
1854 if (template_id
== error_mark_node
|| decl
== error_mark_node
)
1855 return error_mark_node
;
1857 /* We shouldn't be specializing a member template of an
1858 unspecialized class template; we already gave an error in
1859 check_specialization_scope, now avoid crashing. */
1860 if (template_count
&& DECL_CLASS_SCOPE_P (decl
)
1861 && template_class_depth (DECL_CONTEXT (decl
)) > 0)
1863 gcc_assert (errorcount
);
1864 return error_mark_node
;
1867 fns
= TREE_OPERAND (template_id
, 0);
1868 explicit_targs
= TREE_OPERAND (template_id
, 1);
1870 if (fns
== error_mark_node
)
1871 return error_mark_node
;
1873 /* Check for baselinks. */
1874 if (BASELINK_P (fns
))
1875 fns
= BASELINK_FUNCTIONS (fns
);
1877 if (!is_overloaded_fn (fns
))
1879 error ("%qD is not a function template", fns
);
1880 return error_mark_node
;
1883 /* Count the number of template headers specified for this
1886 for (b
= current_binding_level
;
1887 b
->kind
== sk_template_parms
;
1891 for (; fns
; fns
= OVL_NEXT (fns
))
1893 tree fn
= OVL_CURRENT (fns
);
1895 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
1897 tree decl_arg_types
;
1901 /* In case of explicit specialization, we need to check if
1902 the number of template headers appearing in the specialization
1903 is correct. This is usually done in check_explicit_specialization,
1904 but the check done there cannot be exhaustive when specializing
1905 member functions. Consider the following code:
1907 template <> void A<int>::f(int);
1908 template <> template <> void A<int>::f(int);
1910 Assuming that A<int> is not itself an explicit specialization
1911 already, the first line specializes "f" which is a non-template
1912 member function, whilst the second line specializes "f" which
1913 is a template member function. So both lines are syntactically
1914 correct, and check_explicit_specialization does not reject
1917 Here, we can do better, as we are matching the specialization
1918 against the declarations. We count the number of template
1919 headers, and we check if they match TEMPLATE_COUNT + 1
1920 (TEMPLATE_COUNT is the number of qualifying template classes,
1921 plus there must be another header for the member template
1924 Notice that if header_count is zero, this is not a
1925 specialization but rather a template instantiation, so there
1926 is no check we can perform here. */
1927 if (header_count
&& header_count
!= template_count
+ 1)
1930 /* Check that the number of template arguments at the
1931 innermost level for DECL is the same as for FN. */
1932 if (current_binding_level
->kind
== sk_template_parms
1933 && !current_binding_level
->explicit_spec_p
1934 && (TREE_VEC_LENGTH (DECL_INNERMOST_TEMPLATE_PARMS (fn
))
1935 != TREE_VEC_LENGTH (INNERMOST_TEMPLATE_PARMS
1936 (current_template_parms
))))
1939 /* DECL might be a specialization of FN. */
1940 decl_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
1941 fn_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
1943 /* For a non-static member function, we need to make sure
1944 that the const qualification is the same. Since
1945 get_bindings does not try to merge the "this" parameter,
1946 we must do the comparison explicitly. */
1947 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
1948 && !same_type_p (TREE_VALUE (fn_arg_types
),
1949 TREE_VALUE (decl_arg_types
)))
1952 /* Skip the "this" parameter and, for constructors of
1953 classes with virtual bases, the VTT parameter. A
1954 full specialization of a constructor will have a VTT
1955 parameter, but a template never will. */
1957 = skip_artificial_parms_for (decl
, decl_arg_types
);
1959 = skip_artificial_parms_for (fn
, fn_arg_types
);
1961 /* Function templates cannot be specializations; there are
1962 no partial specializations of functions. Therefore, if
1963 the type of DECL does not match FN, there is no
1965 if (tsk
== tsk_template
)
1967 if (compparms (fn_arg_types
, decl_arg_types
))
1968 candidates
= tree_cons (NULL_TREE
, fn
, candidates
);
1972 /* See whether this function might be a specialization of this
1973 template. Suppress access control because we might be trying
1974 to make this specialization a friend, and we have already done
1975 access control for the declaration of the specialization. */
1976 push_deferring_access_checks (dk_no_check
);
1977 targs
= get_bindings (fn
, decl
, explicit_targs
, /*check_ret=*/true);
1978 pop_deferring_access_checks ();
1981 /* We cannot deduce template arguments that when used to
1982 specialize TMPL will produce DECL. */
1985 /* Make sure that the deduced arguments actually work. */
1986 insttype
= tsubst (TREE_TYPE (fn
), targs
, tf_none
, NULL_TREE
);
1987 if (insttype
== error_mark_node
)
1990 = skip_artificial_parms_for (fn
, TYPE_ARG_TYPES (insttype
));
1991 if (!compparms (fn_arg_types
, decl_arg_types
))
1994 /* Save this template, and the arguments deduced. */
1995 templates
= tree_cons (targs
, fn
, templates
);
1997 else if (need_member_template
)
1998 /* FN is an ordinary member function, and we need a
1999 specialization of a member template. */
2001 else if (TREE_CODE (fn
) != FUNCTION_DECL
)
2002 /* We can get IDENTIFIER_NODEs here in certain erroneous
2005 else if (!DECL_FUNCTION_MEMBER_P (fn
))
2006 /* This is just an ordinary non-member function. Nothing can
2007 be a specialization of that. */
2009 else if (DECL_ARTIFICIAL (fn
))
2010 /* Cannot specialize functions that are created implicitly. */
2014 tree decl_arg_types
;
2016 /* This is an ordinary member function. However, since
2017 we're here, we can assume its enclosing class is a
2018 template class. For example,
2020 template <typename T> struct S { void f(); };
2021 template <> void S<int>::f() {}
2023 Here, S<int>::f is a non-template, but S<int> is a
2024 template class. If FN has the same type as DECL, we
2025 might be in business. */
2027 if (!DECL_TEMPLATE_INFO (fn
))
2028 /* Its enclosing class is an explicit specialization
2029 of a template class. This is not a candidate. */
2032 if (!same_type_p (TREE_TYPE (TREE_TYPE (decl
)),
2033 TREE_TYPE (TREE_TYPE (fn
))))
2034 /* The return types differ. */
2037 /* Adjust the type of DECL in case FN is a static member. */
2038 decl_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
2039 if (DECL_STATIC_FUNCTION_P (fn
)
2040 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
2041 decl_arg_types
= TREE_CHAIN (decl_arg_types
);
2043 if (compparms (TYPE_ARG_TYPES (TREE_TYPE (fn
)),
2046 candidates
= tree_cons (NULL_TREE
, fn
, candidates
);
2050 if (templates
&& TREE_CHAIN (templates
))
2056 It is possible for a specialization with a given function
2057 signature to be instantiated from more than one function
2058 template. In such cases, explicit specification of the
2059 template arguments must be used to uniquely identify the
2060 function template specialization being specialized.
2062 Note that here, there's no suggestion that we're supposed to
2063 determine which of the candidate templates is most
2064 specialized. However, we, also have:
2068 Partial ordering of overloaded function template
2069 declarations is used in the following contexts to select
2070 the function template to which a function template
2071 specialization refers:
2073 -- when an explicit specialization refers to a function
2076 So, we do use the partial ordering rules, at least for now.
2077 This extension can only serve to make invalid programs valid,
2078 so it's safe. And, there is strong anecdotal evidence that
2079 the committee intended the partial ordering rules to apply;
2080 the EDG front end has that behavior, and John Spicer claims
2081 that the committee simply forgot to delete the wording in
2082 [temp.expl.spec]. */
2083 tree tmpl
= most_specialized_instantiation (templates
);
2084 if (tmpl
!= error_mark_node
)
2087 TREE_CHAIN (templates
) = NULL_TREE
;
2091 if (templates
== NULL_TREE
&& candidates
== NULL_TREE
)
2093 error ("template-id %qD for %q+D does not match any template "
2094 "declaration", template_id
, decl
);
2095 if (header_count
&& header_count
!= template_count
+ 1)
2096 inform (input_location
, "saw %d %<template<>%>, need %d for "
2097 "specializing a member function template",
2098 header_count
, template_count
+ 1);
2099 return error_mark_node
;
2101 else if ((templates
&& TREE_CHAIN (templates
))
2102 || (candidates
&& TREE_CHAIN (candidates
))
2103 || (templates
&& candidates
))
2105 error ("ambiguous template specialization %qD for %q+D",
2107 candidates
= chainon (candidates
, templates
);
2108 print_candidates (candidates
);
2109 return error_mark_node
;
2112 /* We have one, and exactly one, match. */
2115 tree fn
= TREE_VALUE (candidates
);
2116 *targs_out
= copy_node (DECL_TI_ARGS (fn
));
2117 /* DECL is a re-declaration or partial instantiation of a template
2119 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
2121 /* It was a specialization of an ordinary member function in a
2123 return DECL_TI_TEMPLATE (fn
);
2126 /* It was a specialization of a template. */
2127 targs
= DECL_TI_ARGS (DECL_TEMPLATE_RESULT (TREE_VALUE (templates
)));
2128 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (targs
))
2130 *targs_out
= copy_node (targs
);
2131 SET_TMPL_ARGS_LEVEL (*targs_out
,
2132 TMPL_ARGS_DEPTH (*targs_out
),
2133 TREE_PURPOSE (templates
));
2136 *targs_out
= TREE_PURPOSE (templates
);
2137 return TREE_VALUE (templates
);
2140 /* Returns a chain of parameter types, exactly like the SPEC_TYPES,
2141 but with the default argument values filled in from those in the
2145 copy_default_args_to_explicit_spec_1 (tree spec_types
,
2148 tree new_spec_types
;
2153 if (spec_types
== void_list_node
)
2154 return void_list_node
;
2156 /* Substitute into the rest of the list. */
2158 copy_default_args_to_explicit_spec_1 (TREE_CHAIN (spec_types
),
2159 TREE_CHAIN (tmpl_types
));
2161 /* Add the default argument for this parameter. */
2162 return hash_tree_cons (TREE_PURPOSE (tmpl_types
),
2163 TREE_VALUE (spec_types
),
2167 /* DECL is an explicit specialization. Replicate default arguments
2168 from the template it specializes. (That way, code like:
2170 template <class T> void f(T = 3);
2171 template <> void f(double);
2174 works, as required.) An alternative approach would be to look up
2175 the correct default arguments at the call-site, but this approach
2176 is consistent with how implicit instantiations are handled. */
2179 copy_default_args_to_explicit_spec (tree decl
)
2184 tree new_spec_types
;
2188 tree object_type
= NULL_TREE
;
2189 tree in_charge
= NULL_TREE
;
2190 tree vtt
= NULL_TREE
;
2192 /* See if there's anything we need to do. */
2193 tmpl
= DECL_TI_TEMPLATE (decl
);
2194 tmpl_types
= TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (tmpl
)));
2195 for (t
= tmpl_types
; t
; t
= TREE_CHAIN (t
))
2196 if (TREE_PURPOSE (t
))
2201 old_type
= TREE_TYPE (decl
);
2202 spec_types
= TYPE_ARG_TYPES (old_type
);
2204 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
2206 /* Remove the this pointer, but remember the object's type for
2208 object_type
= TREE_TYPE (TREE_VALUE (spec_types
));
2209 spec_types
= TREE_CHAIN (spec_types
);
2210 tmpl_types
= TREE_CHAIN (tmpl_types
);
2212 if (DECL_HAS_IN_CHARGE_PARM_P (decl
))
2214 /* DECL may contain more parameters than TMPL due to the extra
2215 in-charge parameter in constructors and destructors. */
2216 in_charge
= spec_types
;
2217 spec_types
= TREE_CHAIN (spec_types
);
2219 if (DECL_HAS_VTT_PARM_P (decl
))
2222 spec_types
= TREE_CHAIN (spec_types
);
2226 /* Compute the merged default arguments. */
2228 copy_default_args_to_explicit_spec_1 (spec_types
, tmpl_types
);
2230 /* Compute the new FUNCTION_TYPE. */
2234 new_spec_types
= hash_tree_cons (TREE_PURPOSE (vtt
),
2239 /* Put the in-charge parameter back. */
2240 new_spec_types
= hash_tree_cons (TREE_PURPOSE (in_charge
),
2241 TREE_VALUE (in_charge
),
2244 new_type
= build_method_type_directly (object_type
,
2245 TREE_TYPE (old_type
),
2249 new_type
= build_function_type (TREE_TYPE (old_type
),
2251 new_type
= cp_build_type_attribute_variant (new_type
,
2252 TYPE_ATTRIBUTES (old_type
));
2253 new_type
= build_exception_variant (new_type
,
2254 TYPE_RAISES_EXCEPTIONS (old_type
));
2255 TREE_TYPE (decl
) = new_type
;
2258 /* Return the number of template headers we expect to see for a definition
2259 or specialization of CTYPE or one of its non-template members. */
2262 num_template_headers_for_class (tree ctype
)
2264 int num_templates
= 0;
2266 while (ctype
&& CLASS_TYPE_P (ctype
))
2268 /* You're supposed to have one `template <...>' for every
2269 template class, but you don't need one for a full
2270 specialization. For example:
2272 template <class T> struct S{};
2273 template <> struct S<int> { void f(); };
2274 void S<int>::f () {}
2276 is correct; there shouldn't be a `template <>' for the
2277 definition of `S<int>::f'. */
2278 if (!CLASSTYPE_TEMPLATE_INFO (ctype
))
2279 /* If CTYPE does not have template information of any
2280 kind, then it is not a template, nor is it nested
2281 within a template. */
2283 if (explicit_class_specialization_p (ctype
))
2285 if (PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (ctype
)))
2288 ctype
= TYPE_CONTEXT (ctype
);
2291 return num_templates
;
2294 /* Do a simple sanity check on the template headers that precede the
2295 variable declaration DECL. */
2298 check_template_variable (tree decl
)
2300 tree ctx
= CP_DECL_CONTEXT (decl
);
2301 int wanted
= num_template_headers_for_class (ctx
);
2302 if (!TYPE_P (ctx
) || !CLASSTYPE_TEMPLATE_INFO (ctx
))
2303 permerror (DECL_SOURCE_LOCATION (decl
),
2304 "%qD is not a static data member of a class template", decl
);
2305 else if (template_header_count
> wanted
)
2307 pedwarn (DECL_SOURCE_LOCATION (decl
), 0,
2308 "too many template headers for %D (should be %d)",
2310 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (ctx
))
2311 inform (DECL_SOURCE_LOCATION (decl
),
2312 "members of an explicitly specialized class are defined "
2313 "without a template header");
2317 /* Check to see if the function just declared, as indicated in
2318 DECLARATOR, and in DECL, is a specialization of a function
2319 template. We may also discover that the declaration is an explicit
2320 instantiation at this point.
2322 Returns DECL, or an equivalent declaration that should be used
2323 instead if all goes well. Issues an error message if something is
2324 amiss. Returns error_mark_node if the error is not easily
2327 FLAGS is a bitmask consisting of the following flags:
2329 2: The function has a definition.
2330 4: The function is a friend.
2332 The TEMPLATE_COUNT is the number of references to qualifying
2333 template classes that appeared in the name of the function. For
2336 template <class T> struct S { void f(); };
2339 the TEMPLATE_COUNT would be 1. However, explicitly specialized
2340 classes are not counted in the TEMPLATE_COUNT, so that in
2342 template <class T> struct S {};
2343 template <> struct S<int> { void f(); }
2344 template <> void S<int>::f();
2346 the TEMPLATE_COUNT would be 0. (Note that this declaration is
2347 invalid; there should be no template <>.)
2349 If the function is a specialization, it is marked as such via
2350 DECL_TEMPLATE_SPECIALIZATION. Furthermore, its DECL_TEMPLATE_INFO
2351 is set up correctly, and it is added to the list of specializations
2352 for that template. */
2355 check_explicit_specialization (tree declarator
,
2360 int have_def
= flags
& 2;
2361 int is_friend
= flags
& 4;
2362 int specialization
= 0;
2363 int explicit_instantiation
= 0;
2364 int member_specialization
= 0;
2365 tree ctype
= DECL_CLASS_CONTEXT (decl
);
2366 tree dname
= DECL_NAME (decl
);
2371 if (!processing_specialization
)
2374 tsk
= tsk_excessive_parms
;
2377 tsk
= current_tmpl_spec_kind (template_count
);
2382 if (processing_specialization
)
2385 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
2387 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
2390 /* This could be something like:
2392 template <class T> void f(T);
2393 class S { friend void f<>(int); } */
2397 /* This case handles bogus declarations like template <>
2398 template <class T> void f<int>(); */
2400 error ("template-id %qD in declaration of primary template",
2407 case tsk_invalid_member_spec
:
2408 /* The error has already been reported in
2409 check_specialization_scope. */
2410 return error_mark_node
;
2412 case tsk_invalid_expl_inst
:
2413 error ("template parameter list used in explicit instantiation");
2419 error ("definition provided for explicit instantiation");
2421 explicit_instantiation
= 1;
2424 case tsk_excessive_parms
:
2425 case tsk_insufficient_parms
:
2426 if (tsk
== tsk_excessive_parms
)
2427 error ("too many template parameter lists in declaration of %qD",
2429 else if (template_header_count
)
2430 error("too few template parameter lists in declaration of %qD", decl
);
2432 error("explicit specialization of %qD must be introduced by "
2433 "%<template <>%>", decl
);
2437 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
2439 member_specialization
= 1;
2445 if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
2447 /* This case handles bogus declarations like template <>
2448 template <class T> void f<int>(); */
2450 if (uses_template_parms (declarator
))
2451 error ("function template partial specialization %qD "
2452 "is not allowed", declarator
);
2454 error ("template-id %qD in declaration of primary template",
2459 if (ctype
&& CLASSTYPE_TEMPLATE_INSTANTIATION (ctype
))
2460 /* This is a specialization of a member template, without
2461 specialization the containing class. Something like:
2463 template <class T> struct S {
2464 template <class U> void f (U);
2466 template <> template <class U> void S<int>::f(U) {}
2468 That's a specialization -- but of the entire template. */
2476 if (specialization
|| member_specialization
)
2478 tree t
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
2479 for (; t
; t
= TREE_CHAIN (t
))
2480 if (TREE_PURPOSE (t
))
2482 permerror (input_location
,
2483 "default argument specified in explicit specialization");
2488 if (specialization
|| member_specialization
|| explicit_instantiation
)
2490 tree tmpl
= NULL_TREE
;
2491 tree targs
= NULL_TREE
;
2493 /* Make sure that the declarator is a TEMPLATE_ID_EXPR. */
2494 if (TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
2498 gcc_assert (identifier_p (declarator
));
2503 /* If there is no class context, the explicit instantiation
2504 must be at namespace scope. */
2505 gcc_assert (DECL_NAMESPACE_SCOPE_P (decl
));
2507 /* Find the namespace binding, using the declaration
2509 fns
= lookup_qualified_name (CP_DECL_CONTEXT (decl
), dname
,
2511 if (fns
== error_mark_node
|| !is_overloaded_fn (fns
))
2513 error ("%qD is not a template function", dname
);
2514 fns
= error_mark_node
;
2518 tree fn
= OVL_CURRENT (fns
);
2519 if (!is_associated_namespace (CP_DECL_CONTEXT (decl
),
2520 CP_DECL_CONTEXT (fn
)))
2521 error ("%qD is not declared in %qD",
2522 decl
, current_namespace
);
2526 declarator
= lookup_template_function (fns
, NULL_TREE
);
2529 if (declarator
== error_mark_node
)
2530 return error_mark_node
;
2532 if (ctype
!= NULL_TREE
&& TYPE_BEING_DEFINED (ctype
))
2534 if (!explicit_instantiation
)
2535 /* A specialization in class scope. This is invalid,
2536 but the error will already have been flagged by
2537 check_specialization_scope. */
2538 return error_mark_node
;
2541 /* It's not valid to write an explicit instantiation in
2544 class C { template void f(); }
2546 This case is caught by the parser. However, on
2549 template class C { void f(); };
2551 (which is invalid) we can get here. The error will be
2558 else if (ctype
!= NULL_TREE
2559 && (identifier_p (TREE_OPERAND (declarator
, 0))))
2561 /* Find the list of functions in ctype that have the same
2562 name as the declared function. */
2563 tree name
= TREE_OPERAND (declarator
, 0);
2564 tree fns
= NULL_TREE
;
2567 if (constructor_name_p (name
, ctype
))
2569 int is_constructor
= DECL_CONSTRUCTOR_P (decl
);
2571 if (is_constructor
? !TYPE_HAS_USER_CONSTRUCTOR (ctype
)
2572 : !CLASSTYPE_DESTRUCTORS (ctype
))
2574 /* From [temp.expl.spec]:
2576 If such an explicit specialization for the member
2577 of a class template names an implicitly-declared
2578 special member function (clause _special_), the
2579 program is ill-formed.
2581 Similar language is found in [temp.explicit]. */
2582 error ("specialization of implicitly-declared special member function");
2583 return error_mark_node
;
2586 name
= is_constructor
? ctor_identifier
: dtor_identifier
;
2589 if (!DECL_CONV_FN_P (decl
))
2591 idx
= lookup_fnfields_1 (ctype
, name
);
2593 fns
= (*CLASSTYPE_METHOD_VEC (ctype
))[idx
];
2597 vec
<tree
, va_gc
> *methods
;
2600 /* For a type-conversion operator, we cannot do a
2601 name-based lookup. We might be looking for `operator
2602 int' which will be a specialization of `operator T'.
2603 So, we find *all* the conversion operators, and then
2604 select from them. */
2607 methods
= CLASSTYPE_METHOD_VEC (ctype
);
2609 for (idx
= CLASSTYPE_FIRST_CONVERSION_SLOT
;
2610 methods
->iterate (idx
, &ovl
);
2613 if (!DECL_CONV_FN_P (OVL_CURRENT (ovl
)))
2614 /* There are no more conversion functions. */
2617 /* Glue all these conversion functions together
2618 with those we already have. */
2619 for (; ovl
; ovl
= OVL_NEXT (ovl
))
2620 fns
= ovl_cons (OVL_CURRENT (ovl
), fns
);
2624 if (fns
== NULL_TREE
)
2626 error ("no member function %qD declared in %qT", name
, ctype
);
2627 return error_mark_node
;
2630 TREE_OPERAND (declarator
, 0) = fns
;
2633 /* Figure out what exactly is being specialized at this point.
2634 Note that for an explicit instantiation, even one for a
2635 member function, we cannot tell apriori whether the
2636 instantiation is for a member template, or just a member
2637 function of a template class. Even if a member template is
2638 being instantiated, the member template arguments may be
2639 elided if they can be deduced from the rest of the
2641 tmpl
= determine_specialization (declarator
, decl
,
2643 member_specialization
,
2647 if (!tmpl
|| tmpl
== error_mark_node
)
2648 /* We couldn't figure out what this declaration was
2650 return error_mark_node
;
2653 tree gen_tmpl
= most_general_template (tmpl
);
2655 if (explicit_instantiation
)
2657 /* We don't set DECL_EXPLICIT_INSTANTIATION here; that
2658 is done by do_decl_instantiation later. */
2660 int arg_depth
= TMPL_ARGS_DEPTH (targs
);
2661 int parm_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
2663 if (arg_depth
> parm_depth
)
2665 /* If TMPL is not the most general template (for
2666 example, if TMPL is a friend template that is
2667 injected into namespace scope), then there will
2668 be too many levels of TARGS. Remove some of them
2673 new_targs
= make_tree_vec (parm_depth
);
2674 for (i
= arg_depth
- parm_depth
; i
< arg_depth
; ++i
)
2675 TREE_VEC_ELT (new_targs
, i
- (arg_depth
- parm_depth
))
2676 = TREE_VEC_ELT (targs
, i
);
2680 return instantiate_template (tmpl
, targs
, tf_error
);
2683 /* If we thought that the DECL was a member function, but it
2684 turns out to be specializing a static member function,
2685 make DECL a static member function as well. */
2686 if (DECL_STATIC_FUNCTION_P (tmpl
)
2687 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
2688 revert_static_member_fn (decl
);
2690 /* If this is a specialization of a member template of a
2691 template class, we want to return the TEMPLATE_DECL, not
2692 the specialization of it. */
2693 if (tsk
== tsk_template
)
2695 tree result
= DECL_TEMPLATE_RESULT (tmpl
);
2696 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
2697 DECL_INITIAL (result
) = NULL_TREE
;
2701 DECL_SOURCE_LOCATION (tmpl
) = DECL_SOURCE_LOCATION (decl
);
2702 DECL_SOURCE_LOCATION (result
)
2703 = DECL_SOURCE_LOCATION (decl
);
2704 /* We want to use the argument list specified in the
2705 definition, not in the original declaration. */
2706 DECL_ARGUMENTS (result
) = DECL_ARGUMENTS (decl
);
2707 for (parm
= DECL_ARGUMENTS (result
); parm
;
2708 parm
= DECL_CHAIN (parm
))
2709 DECL_CONTEXT (parm
) = result
;
2711 return register_specialization (tmpl
, gen_tmpl
, targs
,
2715 /* Set up the DECL_TEMPLATE_INFO for DECL. */
2716 DECL_TEMPLATE_INFO (decl
) = build_template_info (tmpl
, targs
);
2718 /* Inherit default function arguments from the template
2719 DECL is specializing. */
2720 copy_default_args_to_explicit_spec (decl
);
2722 /* This specialization has the same protection as the
2723 template it specializes. */
2724 TREE_PRIVATE (decl
) = TREE_PRIVATE (gen_tmpl
);
2725 TREE_PROTECTED (decl
) = TREE_PROTECTED (gen_tmpl
);
2727 /* 7.1.1-1 [dcl.stc]
2729 A storage-class-specifier shall not be specified in an
2730 explicit specialization...
2732 The parser rejects these, so unless action is taken here,
2733 explicit function specializations will always appear with
2736 The action recommended by the C++ CWG in response to C++
2737 defect report 605 is to make the storage class and linkage
2738 of the explicit specialization match the templated function:
2740 http://www.open-std.org/jtc1/sc22/wg21/docs/cwg_active.html#605
2742 if (tsk
== tsk_expl_spec
&& DECL_FUNCTION_TEMPLATE_P (gen_tmpl
))
2744 tree tmpl_func
= DECL_TEMPLATE_RESULT (gen_tmpl
);
2745 gcc_assert (TREE_CODE (tmpl_func
) == FUNCTION_DECL
);
2747 /* This specialization has the same linkage and visibility as
2748 the function template it specializes. */
2749 TREE_PUBLIC (decl
) = TREE_PUBLIC (tmpl_func
);
2750 if (! TREE_PUBLIC (decl
))
2752 DECL_INTERFACE_KNOWN (decl
) = 1;
2753 DECL_NOT_REALLY_EXTERN (decl
) = 1;
2755 DECL_THIS_STATIC (decl
) = DECL_THIS_STATIC (tmpl_func
);
2756 if (DECL_VISIBILITY_SPECIFIED (tmpl_func
))
2758 DECL_VISIBILITY_SPECIFIED (decl
) = 1;
2759 DECL_VISIBILITY (decl
) = DECL_VISIBILITY (tmpl_func
);
2763 /* If DECL is a friend declaration, declared using an
2764 unqualified name, the namespace associated with DECL may
2765 have been set incorrectly. For example, in:
2767 template <typename T> void f(T);
2769 struct S { friend void f<int>(int); }
2772 we will have set the DECL_CONTEXT for the friend
2773 declaration to N, rather than to the global namespace. */
2774 if (DECL_NAMESPACE_SCOPE_P (decl
))
2775 DECL_CONTEXT (decl
) = DECL_CONTEXT (tmpl
);
2777 if (is_friend
&& !have_def
)
2778 /* This is not really a declaration of a specialization.
2779 It's just the name of an instantiation. But, it's not
2780 a request for an instantiation, either. */
2781 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
2783 /* Register this specialization so that we can find it
2785 decl
= register_specialization (decl
, gen_tmpl
, targs
, is_friend
, 0);
2787 /* A 'structor should already have clones. */
2788 gcc_assert (decl
== error_mark_node
2789 || !(DECL_CONSTRUCTOR_P (decl
)
2790 || DECL_DESTRUCTOR_P (decl
))
2791 || DECL_CLONED_FUNCTION_P (DECL_CHAIN (decl
)));
2798 /* Returns 1 iff PARMS1 and PARMS2 are identical sets of template
2799 parameters. These are represented in the same format used for
2800 DECL_TEMPLATE_PARMS. */
2803 comp_template_parms (const_tree parms1
, const_tree parms2
)
2808 if (parms1
== parms2
)
2811 for (p1
= parms1
, p2
= parms2
;
2812 p1
!= NULL_TREE
&& p2
!= NULL_TREE
;
2813 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
))
2815 tree t1
= TREE_VALUE (p1
);
2816 tree t2
= TREE_VALUE (p2
);
2819 gcc_assert (TREE_CODE (t1
) == TREE_VEC
);
2820 gcc_assert (TREE_CODE (t2
) == TREE_VEC
);
2822 if (TREE_VEC_LENGTH (t1
) != TREE_VEC_LENGTH (t2
))
2825 for (i
= 0; i
< TREE_VEC_LENGTH (t2
); ++i
)
2827 tree parm1
= TREE_VALUE (TREE_VEC_ELT (t1
, i
));
2828 tree parm2
= TREE_VALUE (TREE_VEC_ELT (t2
, i
));
2830 /* If either of the template parameters are invalid, assume
2831 they match for the sake of error recovery. */
2832 if (error_operand_p (parm1
) || error_operand_p (parm2
))
2835 if (TREE_CODE (parm1
) != TREE_CODE (parm2
))
2838 if (TREE_CODE (parm1
) == TEMPLATE_TYPE_PARM
2839 && (TEMPLATE_TYPE_PARAMETER_PACK (parm1
)
2840 == TEMPLATE_TYPE_PARAMETER_PACK (parm2
)))
2842 else if (!same_type_p (TREE_TYPE (parm1
), TREE_TYPE (parm2
)))
2847 if ((p1
!= NULL_TREE
) != (p2
!= NULL_TREE
))
2848 /* One set of parameters has more parameters lists than the
2855 /* Determine whether PARM is a parameter pack. */
2858 template_parameter_pack_p (const_tree parm
)
2860 /* Determine if we have a non-type template parameter pack. */
2861 if (TREE_CODE (parm
) == PARM_DECL
)
2862 return (DECL_TEMPLATE_PARM_P (parm
)
2863 && TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)));
2864 if (TREE_CODE (parm
) == TEMPLATE_PARM_INDEX
)
2865 return TEMPLATE_PARM_PARAMETER_PACK (parm
);
2867 /* If this is a list of template parameters, we could get a
2868 TYPE_DECL or a TEMPLATE_DECL. */
2869 if (TREE_CODE (parm
) == TYPE_DECL
|| TREE_CODE (parm
) == TEMPLATE_DECL
)
2870 parm
= TREE_TYPE (parm
);
2872 /* Otherwise it must be a type template parameter. */
2873 return ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
2874 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
)
2875 && TEMPLATE_TYPE_PARAMETER_PACK (parm
));
2878 /* Determine if T is a function parameter pack. */
2881 function_parameter_pack_p (const_tree t
)
2883 if (t
&& TREE_CODE (t
) == PARM_DECL
)
2884 return DECL_PACK_P (t
);
2888 /* Return the function template declaration of PRIMARY_FUNC_TMPL_INST.
2889 PRIMARY_FUNC_TMPL_INST is a primary function template instantiation. */
2892 get_function_template_decl (const_tree primary_func_tmpl_inst
)
2894 if (! primary_func_tmpl_inst
2895 || TREE_CODE (primary_func_tmpl_inst
) != FUNCTION_DECL
2896 || ! primary_template_instantiation_p (primary_func_tmpl_inst
))
2899 return DECL_TEMPLATE_RESULT (DECL_TI_TEMPLATE (primary_func_tmpl_inst
));
2902 /* Return true iff the function parameter PARAM_DECL was expanded
2903 from the function parameter pack PACK. */
2906 function_parameter_expanded_from_pack_p (tree param_decl
, tree pack
)
2908 if (DECL_ARTIFICIAL (param_decl
)
2909 || !function_parameter_pack_p (pack
))
2912 /* The parameter pack and its pack arguments have the same
2914 return DECL_PARM_INDEX (pack
) == DECL_PARM_INDEX (param_decl
);
2917 /* Determine whether ARGS describes a variadic template args list,
2918 i.e., one that is terminated by a template argument pack. */
2921 template_args_variadic_p (tree args
)
2926 if (args
== NULL_TREE
)
2929 args
= INNERMOST_TEMPLATE_ARGS (args
);
2930 nargs
= TREE_VEC_LENGTH (args
);
2935 last_parm
= TREE_VEC_ELT (args
, nargs
- 1);
2937 return ARGUMENT_PACK_P (last_parm
);
2940 /* Generate a new name for the parameter pack name NAME (an
2941 IDENTIFIER_NODE) that incorporates its */
2944 make_ith_pack_parameter_name (tree name
, int i
)
2946 /* Munge the name to include the parameter index. */
2947 #define NUMBUF_LEN 128
2948 char numbuf
[NUMBUF_LEN
];
2952 if (name
== NULL_TREE
)
2954 snprintf (numbuf
, NUMBUF_LEN
, "%i", i
);
2955 newname_len
= IDENTIFIER_LENGTH (name
)
2956 + strlen (numbuf
) + 2;
2957 newname
= (char*)alloca (newname_len
);
2958 snprintf (newname
, newname_len
,
2959 "%s#%i", IDENTIFIER_POINTER (name
), i
);
2960 return get_identifier (newname
);
2963 /* Return true if T is a primary function, class or alias template
2967 primary_template_instantiation_p (const_tree t
)
2972 if (TREE_CODE (t
) == FUNCTION_DECL
)
2973 return DECL_LANG_SPECIFIC (t
)
2974 && DECL_TEMPLATE_INSTANTIATION (t
)
2975 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (t
));
2976 else if (CLASS_TYPE_P (t
) && !TYPE_DECL_ALIAS_P (TYPE_NAME (t
)))
2977 return CLASSTYPE_TEMPLATE_INSTANTIATION (t
)
2978 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (t
));
2979 else if (alias_template_specialization_p (t
))
2984 /* Return true if PARM is a template template parameter. */
2987 template_template_parameter_p (const_tree parm
)
2989 return DECL_TEMPLATE_TEMPLATE_PARM_P (parm
);
2992 /* Return true iff PARM is a DECL representing a type template
2996 template_type_parameter_p (const_tree parm
)
2999 && (TREE_CODE (parm
) == TYPE_DECL
3000 || TREE_CODE (parm
) == TEMPLATE_DECL
)
3001 && DECL_TEMPLATE_PARM_P (parm
));
3004 /* Return the template parameters of T if T is a
3005 primary template instantiation, NULL otherwise. */
3008 get_primary_template_innermost_parameters (const_tree t
)
3010 tree parms
= NULL
, template_info
= NULL
;
3012 if ((template_info
= get_template_info (t
))
3013 && primary_template_instantiation_p (t
))
3014 parms
= INNERMOST_TEMPLATE_PARMS
3015 (DECL_TEMPLATE_PARMS (TI_TEMPLATE (template_info
)));
3020 /* Return the template parameters of the LEVELth level from the full list
3021 of template parameters PARMS. */
3024 get_template_parms_at_level (tree parms
, int level
)
3028 || TREE_CODE (parms
) != TREE_LIST
3029 || level
> TMPL_PARMS_DEPTH (parms
))
3032 for (p
= parms
; p
; p
= TREE_CHAIN (p
))
3033 if (TMPL_PARMS_DEPTH (p
) == level
)
3039 /* Returns the template arguments of T if T is a template instantiation,
3043 get_template_innermost_arguments (const_tree t
)
3045 tree args
= NULL
, template_info
= NULL
;
3047 if ((template_info
= get_template_info (t
))
3048 && TI_ARGS (template_info
))
3049 args
= INNERMOST_TEMPLATE_ARGS (TI_ARGS (template_info
));
3054 /* Return the argument pack elements of T if T is a template argument pack,
3058 get_template_argument_pack_elems (const_tree t
)
3060 if (TREE_CODE (t
) != TYPE_ARGUMENT_PACK
3061 && TREE_CODE (t
) != NONTYPE_ARGUMENT_PACK
)
3064 return ARGUMENT_PACK_ARGS (t
);
3067 /* Structure used to track the progress of find_parameter_packs_r. */
3068 struct find_parameter_pack_data
3070 /* TREE_LIST that will contain all of the parameter packs found by
3072 tree
* parameter_packs
;
3074 /* Set of AST nodes that have been visited by the traversal. */
3075 struct pointer_set_t
*visited
;
3078 /* Identifies all of the argument packs that occur in a template
3079 argument and appends them to the TREE_LIST inside DATA, which is a
3080 find_parameter_pack_data structure. This is a subroutine of
3081 make_pack_expansion and uses_parameter_packs. */
3083 find_parameter_packs_r (tree
*tp
, int *walk_subtrees
, void* data
)
3086 struct find_parameter_pack_data
* ppd
=
3087 (struct find_parameter_pack_data
*)data
;
3088 bool parameter_pack_p
= false;
3090 /* Handle type aliases/typedefs. */
3091 if (TYPE_ALIAS_P (t
))
3093 if (TYPE_TEMPLATE_INFO (t
))
3094 cp_walk_tree (&TYPE_TI_ARGS (t
),
3095 &find_parameter_packs_r
,
3101 /* Identify whether this is a parameter pack or not. */
3102 switch (TREE_CODE (t
))
3104 case TEMPLATE_PARM_INDEX
:
3105 if (TEMPLATE_PARM_PARAMETER_PACK (t
))
3106 parameter_pack_p
= true;
3109 case TEMPLATE_TYPE_PARM
:
3110 t
= TYPE_MAIN_VARIANT (t
);
3111 case TEMPLATE_TEMPLATE_PARM
:
3112 if (TEMPLATE_TYPE_PARAMETER_PACK (t
))
3113 parameter_pack_p
= true;
3118 if (DECL_PACK_P (t
))
3120 /* We don't want to walk into the type of a PARM_DECL,
3121 because we don't want to see the type parameter pack. */
3123 parameter_pack_p
= true;
3127 /* Look through a lambda capture proxy to the field pack. */
3129 if (DECL_HAS_VALUE_EXPR_P (t
))
3131 tree v
= DECL_VALUE_EXPR (t
);
3133 &find_parameter_packs_r
,
3140 parameter_pack_p
= true;
3143 /* Not a parameter pack. */
3147 if (parameter_pack_p
)
3149 /* Add this parameter pack to the list. */
3150 *ppd
->parameter_packs
= tree_cons (NULL_TREE
, t
, *ppd
->parameter_packs
);
3154 cp_walk_tree (&TYPE_CONTEXT (t
),
3155 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3157 /* This switch statement will return immediately if we don't find a
3159 switch (TREE_CODE (t
))
3161 case TEMPLATE_PARM_INDEX
:
3164 case BOUND_TEMPLATE_TEMPLATE_PARM
:
3165 /* Check the template itself. */
3166 cp_walk_tree (&TREE_TYPE (TYPE_TI_TEMPLATE (t
)),
3167 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3168 /* Check the template arguments. */
3169 cp_walk_tree (&TYPE_TI_ARGS (t
), &find_parameter_packs_r
, ppd
,
3174 case TEMPLATE_TYPE_PARM
:
3175 case TEMPLATE_TEMPLATE_PARM
:
3182 if (TYPE_PTRMEMFUNC_P (t
))
3188 if (TYPE_TEMPLATE_INFO (t
))
3189 cp_walk_tree (&TYPE_TI_ARGS (t
),
3190 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3197 cp_walk_tree (&TREE_TYPE (t
),
3198 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3202 cp_walk_tree (&TYPENAME_TYPE_FULLNAME (t
), &find_parameter_packs_r
,
3207 case TYPE_PACK_EXPANSION
:
3208 case EXPR_PACK_EXPANSION
:
3213 cp_walk_tree (&TYPE_MAX_VALUE (t
), &find_parameter_packs_r
,
3218 case IDENTIFIER_NODE
:
3219 cp_walk_tree (&TREE_TYPE (t
), &find_parameter_packs_r
, ppd
,
3231 /* Determines if the expression or type T uses any parameter packs. */
3233 uses_parameter_packs (tree t
)
3235 tree parameter_packs
= NULL_TREE
;
3236 struct find_parameter_pack_data ppd
;
3237 ppd
.parameter_packs
= ¶meter_packs
;
3238 ppd
.visited
= pointer_set_create ();
3239 cp_walk_tree (&t
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
3240 pointer_set_destroy (ppd
.visited
);
3241 return parameter_packs
!= NULL_TREE
;
3244 /* Turn ARG, which may be an expression, type, or a TREE_LIST
3245 representation a base-class initializer into a parameter pack
3246 expansion. If all goes well, the resulting node will be an
3247 EXPR_PACK_EXPANSION, TYPE_PACK_EXPANSION, or TREE_LIST,
3250 make_pack_expansion (tree arg
)
3253 tree parameter_packs
= NULL_TREE
;
3254 bool for_types
= false;
3255 struct find_parameter_pack_data ppd
;
3257 if (!arg
|| arg
== error_mark_node
)
3260 if (TREE_CODE (arg
) == TREE_LIST
)
3262 /* The only time we will see a TREE_LIST here is for a base
3263 class initializer. In this case, the TREE_PURPOSE will be a
3264 _TYPE node (representing the base class expansion we're
3265 initializing) and the TREE_VALUE will be a TREE_LIST
3266 containing the initialization arguments.
3268 The resulting expansion looks somewhat different from most
3269 expansions. Rather than returning just one _EXPANSION, we
3270 return a TREE_LIST whose TREE_PURPOSE is a
3271 TYPE_PACK_EXPANSION containing the bases that will be
3272 initialized. The TREE_VALUE will be identical to the
3273 original TREE_VALUE, which is a list of arguments that will
3274 be passed to each base. We do not introduce any new pack
3275 expansion nodes into the TREE_VALUE (although it is possible
3276 that some already exist), because the TREE_PURPOSE and
3277 TREE_VALUE all need to be expanded together with the same
3278 _EXPANSION node. Note that the TYPE_PACK_EXPANSION in the
3279 resulting TREE_PURPOSE will mention the parameter packs in
3280 both the bases and the arguments to the bases. */
3283 tree parameter_packs
= NULL_TREE
;
3285 /* Determine which parameter packs will be used by the base
3287 ppd
.visited
= pointer_set_create ();
3288 ppd
.parameter_packs
= ¶meter_packs
;
3289 cp_walk_tree (&TREE_PURPOSE (arg
), &find_parameter_packs_r
,
3292 if (parameter_packs
== NULL_TREE
)
3294 error ("base initializer expansion %<%T%> contains no parameter packs", arg
);
3295 pointer_set_destroy (ppd
.visited
);
3296 return error_mark_node
;
3299 if (TREE_VALUE (arg
) != void_type_node
)
3301 /* Collect the sets of parameter packs used in each of the
3302 initialization arguments. */
3303 for (value
= TREE_VALUE (arg
); value
; value
= TREE_CHAIN (value
))
3305 /* Determine which parameter packs will be expanded in this
3307 cp_walk_tree (&TREE_VALUE (value
), &find_parameter_packs_r
,
3312 pointer_set_destroy (ppd
.visited
);
3314 /* Create the pack expansion type for the base type. */
3315 purpose
= cxx_make_type (TYPE_PACK_EXPANSION
);
3316 SET_PACK_EXPANSION_PATTERN (purpose
, TREE_PURPOSE (arg
));
3317 PACK_EXPANSION_PARAMETER_PACKS (purpose
) = parameter_packs
;
3319 /* Just use structural equality for these TYPE_PACK_EXPANSIONS;
3320 they will rarely be compared to anything. */
3321 SET_TYPE_STRUCTURAL_EQUALITY (purpose
);
3323 return tree_cons (purpose
, TREE_VALUE (arg
), NULL_TREE
);
3326 if (TYPE_P (arg
) || TREE_CODE (arg
) == TEMPLATE_DECL
)
3329 /* Build the PACK_EXPANSION_* node. */
3331 ? cxx_make_type (TYPE_PACK_EXPANSION
)
3332 : make_node (EXPR_PACK_EXPANSION
);
3333 SET_PACK_EXPANSION_PATTERN (result
, arg
);
3334 if (TREE_CODE (result
) == EXPR_PACK_EXPANSION
)
3336 /* Propagate type and const-expression information. */
3337 TREE_TYPE (result
) = TREE_TYPE (arg
);
3338 TREE_CONSTANT (result
) = TREE_CONSTANT (arg
);
3341 /* Just use structural equality for these TYPE_PACK_EXPANSIONS;
3342 they will rarely be compared to anything. */
3343 SET_TYPE_STRUCTURAL_EQUALITY (result
);
3345 /* Determine which parameter packs will be expanded. */
3346 ppd
.parameter_packs
= ¶meter_packs
;
3347 ppd
.visited
= pointer_set_create ();
3348 cp_walk_tree (&arg
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
3349 pointer_set_destroy (ppd
.visited
);
3351 /* Make sure we found some parameter packs. */
3352 if (parameter_packs
== NULL_TREE
)
3355 error ("expansion pattern %<%T%> contains no argument packs", arg
);
3357 error ("expansion pattern %<%E%> contains no argument packs", arg
);
3358 return error_mark_node
;
3360 PACK_EXPANSION_PARAMETER_PACKS (result
) = parameter_packs
;
3362 PACK_EXPANSION_LOCAL_P (result
) = at_function_scope_p ();
3367 /* Checks T for any "bare" parameter packs, which have not yet been
3368 expanded, and issues an error if any are found. This operation can
3369 only be done on full expressions or types (e.g., an expression
3370 statement, "if" condition, etc.), because we could have expressions like:
3372 foo(f(g(h(args)))...)
3374 where "args" is a parameter pack. check_for_bare_parameter_packs
3375 should not be called for the subexpressions args, h(args),
3376 g(h(args)), or f(g(h(args))), because we would produce erroneous
3379 Returns TRUE and emits an error if there were bare parameter packs,
3380 returns FALSE otherwise. */
3382 check_for_bare_parameter_packs (tree t
)
3384 tree parameter_packs
= NULL_TREE
;
3385 struct find_parameter_pack_data ppd
;
3387 if (!processing_template_decl
|| !t
|| t
== error_mark_node
)
3390 if (TREE_CODE (t
) == TYPE_DECL
)
3393 ppd
.parameter_packs
= ¶meter_packs
;
3394 ppd
.visited
= pointer_set_create ();
3395 cp_walk_tree (&t
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
3396 pointer_set_destroy (ppd
.visited
);
3398 if (parameter_packs
)
3400 error ("parameter packs not expanded with %<...%>:");
3401 while (parameter_packs
)
3403 tree pack
= TREE_VALUE (parameter_packs
);
3404 tree name
= NULL_TREE
;
3406 if (TREE_CODE (pack
) == TEMPLATE_TYPE_PARM
3407 || TREE_CODE (pack
) == TEMPLATE_TEMPLATE_PARM
)
3408 name
= TYPE_NAME (pack
);
3409 else if (TREE_CODE (pack
) == TEMPLATE_PARM_INDEX
)
3410 name
= DECL_NAME (TEMPLATE_PARM_DECL (pack
));
3412 name
= DECL_NAME (pack
);
3415 inform (input_location
, " %qD", name
);
3417 inform (input_location
, " <anonymous>");
3419 parameter_packs
= TREE_CHAIN (parameter_packs
);
3428 /* Expand any parameter packs that occur in the template arguments in
3431 expand_template_argument_pack (tree args
)
3433 tree result_args
= NULL_TREE
;
3434 int in_arg
, out_arg
= 0, nargs
= args
? TREE_VEC_LENGTH (args
) : 0;
3435 int num_result_args
= -1;
3436 int non_default_args_count
= -1;
3438 /* First, determine if we need to expand anything, and the number of
3439 slots we'll need. */
3440 for (in_arg
= 0; in_arg
< nargs
; ++in_arg
)
3442 tree arg
= TREE_VEC_ELT (args
, in_arg
);
3443 if (arg
== NULL_TREE
)
3445 if (ARGUMENT_PACK_P (arg
))
3447 int num_packed
= TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg
));
3448 if (num_result_args
< 0)
3449 num_result_args
= in_arg
+ num_packed
;
3451 num_result_args
+= num_packed
;
3455 if (num_result_args
>= 0)
3460 /* If no expansion is necessary, we're done. */
3461 if (num_result_args
< 0)
3464 /* Expand arguments. */
3465 result_args
= make_tree_vec (num_result_args
);
3466 if (NON_DEFAULT_TEMPLATE_ARGS_COUNT (args
))
3467 non_default_args_count
=
3468 GET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (args
);
3469 for (in_arg
= 0; in_arg
< nargs
; ++in_arg
)
3471 tree arg
= TREE_VEC_ELT (args
, in_arg
);
3472 if (ARGUMENT_PACK_P (arg
))
3474 tree packed
= ARGUMENT_PACK_ARGS (arg
);
3475 int i
, num_packed
= TREE_VEC_LENGTH (packed
);
3476 for (i
= 0; i
< num_packed
; ++i
, ++out_arg
)
3477 TREE_VEC_ELT (result_args
, out_arg
) = TREE_VEC_ELT(packed
, i
);
3478 if (non_default_args_count
> 0)
3479 non_default_args_count
+= num_packed
- 1;
3483 TREE_VEC_ELT (result_args
, out_arg
) = arg
;
3487 if (non_default_args_count
>= 0)
3488 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (result_args
, non_default_args_count
);
3492 /* Checks if DECL shadows a template parameter.
3494 [temp.local]: A template-parameter shall not be redeclared within its
3495 scope (including nested scopes).
3497 Emits an error and returns TRUE if the DECL shadows a parameter,
3498 returns FALSE otherwise. */
3501 check_template_shadow (tree decl
)
3505 /* If we're not in a template, we can't possibly shadow a template
3507 if (!current_template_parms
)
3510 /* Figure out what we're shadowing. */
3511 if (TREE_CODE (decl
) == OVERLOAD
)
3512 decl
= OVL_CURRENT (decl
);
3513 olddecl
= innermost_non_namespace_value (DECL_NAME (decl
));
3515 /* If there's no previous binding for this name, we're not shadowing
3516 anything, let alone a template parameter. */
3520 /* If we're not shadowing a template parameter, we're done. Note
3521 that OLDDECL might be an OVERLOAD (or perhaps even an
3522 ERROR_MARK), so we can't just blithely assume it to be a _DECL
3524 if (!DECL_P (olddecl
) || !DECL_TEMPLATE_PARM_P (olddecl
))
3527 /* We check for decl != olddecl to avoid bogus errors for using a
3528 name inside a class. We check TPFI to avoid duplicate errors for
3529 inline member templates. */
3531 || (DECL_TEMPLATE_PARM_P (decl
)
3532 && TEMPLATE_PARMS_FOR_INLINE (current_template_parms
)))
3535 /* Don't complain about the injected class name, as we've already
3536 complained about the class itself. */
3537 if (DECL_SELF_REFERENCE_P (decl
))
3540 error ("declaration of %q+#D", decl
);
3541 error (" shadows template parm %q+#D", olddecl
);
3545 /* Return a new TEMPLATE_PARM_INDEX with the indicated INDEX, LEVEL,
3546 ORIG_LEVEL, DECL, and TYPE. */
3549 build_template_parm_index (int index
,
3555 tree t
= make_node (TEMPLATE_PARM_INDEX
);
3556 TEMPLATE_PARM_IDX (t
) = index
;
3557 TEMPLATE_PARM_LEVEL (t
) = level
;
3558 TEMPLATE_PARM_ORIG_LEVEL (t
) = orig_level
;
3559 TEMPLATE_PARM_DECL (t
) = decl
;
3560 TREE_TYPE (t
) = type
;
3561 TREE_CONSTANT (t
) = TREE_CONSTANT (decl
);
3562 TREE_READONLY (t
) = TREE_READONLY (decl
);
3567 /* Find the canonical type parameter for the given template type
3568 parameter. Returns the canonical type parameter, which may be TYPE
3569 if no such parameter existed. */
3572 canonical_type_parameter (tree type
)
3575 int idx
= TEMPLATE_TYPE_IDX (type
);
3576 if (!canonical_template_parms
)
3577 vec_alloc (canonical_template_parms
, idx
+1);
3579 while (canonical_template_parms
->length () <= (unsigned)idx
)
3580 vec_safe_push (canonical_template_parms
, NULL_TREE
);
3582 list
= (*canonical_template_parms
)[idx
];
3583 while (list
&& !comptypes (type
, TREE_VALUE (list
), COMPARE_STRUCTURAL
))
3584 list
= TREE_CHAIN (list
);
3587 return TREE_VALUE (list
);
3590 (*canonical_template_parms
)[idx
]
3591 = tree_cons (NULL_TREE
, type
,
3592 (*canonical_template_parms
)[idx
]);
3597 /* Return a TEMPLATE_PARM_INDEX, similar to INDEX, but whose
3598 TEMPLATE_PARM_LEVEL has been decreased by LEVELS. If such a
3599 TEMPLATE_PARM_INDEX already exists, it is returned; otherwise, a
3600 new one is created. */
3603 reduce_template_parm_level (tree index
, tree type
, int levels
, tree args
,
3604 tsubst_flags_t complain
)
3606 if (TEMPLATE_PARM_DESCENDANTS (index
) == NULL_TREE
3607 || (TEMPLATE_PARM_LEVEL (TEMPLATE_PARM_DESCENDANTS (index
))
3608 != TEMPLATE_PARM_LEVEL (index
) - levels
)
3609 || !same_type_p (type
, TREE_TYPE (TEMPLATE_PARM_DESCENDANTS (index
))))
3611 tree orig_decl
= TEMPLATE_PARM_DECL (index
);
3614 decl
= build_decl (DECL_SOURCE_LOCATION (orig_decl
),
3615 TREE_CODE (orig_decl
), DECL_NAME (orig_decl
), type
);
3616 TREE_CONSTANT (decl
) = TREE_CONSTANT (orig_decl
);
3617 TREE_READONLY (decl
) = TREE_READONLY (orig_decl
);
3618 DECL_ARTIFICIAL (decl
) = 1;
3619 SET_DECL_TEMPLATE_PARM_P (decl
);
3621 t
= build_template_parm_index (TEMPLATE_PARM_IDX (index
),
3622 TEMPLATE_PARM_LEVEL (index
) - levels
,
3623 TEMPLATE_PARM_ORIG_LEVEL (index
),
3625 TEMPLATE_PARM_DESCENDANTS (index
) = t
;
3626 TEMPLATE_PARM_PARAMETER_PACK (t
)
3627 = TEMPLATE_PARM_PARAMETER_PACK (index
);
3629 /* Template template parameters need this. */
3630 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
3631 DECL_TEMPLATE_PARMS (decl
) = tsubst_template_parms
3632 (DECL_TEMPLATE_PARMS (TEMPLATE_PARM_DECL (index
)),
3636 return TEMPLATE_PARM_DESCENDANTS (index
);
3639 /* Process information from new template parameter PARM and append it
3640 to the LIST being built. This new parameter is a non-type
3641 parameter iff IS_NON_TYPE is true. This new parameter is a
3642 parameter pack iff IS_PARAMETER_PACK is true. The location of PARM
3646 process_template_parm (tree list
, location_t parm_loc
, tree parm
,
3647 bool is_non_type
, bool is_parameter_pack
)
3653 gcc_assert (TREE_CODE (parm
) == TREE_LIST
);
3654 defval
= TREE_PURPOSE (parm
);
3658 tree p
= tree_last (list
);
3660 if (p
&& TREE_VALUE (p
) != error_mark_node
)
3663 if (TREE_CODE (p
) == TYPE_DECL
|| TREE_CODE (p
) == TEMPLATE_DECL
)
3664 idx
= TEMPLATE_TYPE_IDX (TREE_TYPE (p
));
3666 idx
= TEMPLATE_PARM_IDX (DECL_INITIAL (p
));
3674 parm
= TREE_VALUE (parm
);
3676 SET_DECL_TEMPLATE_PARM_P (parm
);
3678 if (TREE_TYPE (parm
) != error_mark_node
)
3682 The top-level cv-qualifiers on the template-parameter are
3683 ignored when determining its type. */
3684 TREE_TYPE (parm
) = TYPE_MAIN_VARIANT (TREE_TYPE (parm
));
3685 if (invalid_nontype_parm_type_p (TREE_TYPE (parm
), 1))
3686 TREE_TYPE (parm
) = error_mark_node
;
3687 else if (uses_parameter_packs (TREE_TYPE (parm
))
3688 && !is_parameter_pack
3689 /* If we're in a nested template parameter list, the template
3690 template parameter could be a parameter pack. */
3691 && processing_template_parmlist
== 1)
3693 /* This template parameter is not a parameter pack, but it
3694 should be. Complain about "bare" parameter packs. */
3695 check_for_bare_parameter_packs (TREE_TYPE (parm
));
3697 /* Recover by calling this a parameter pack. */
3698 is_parameter_pack
= true;
3702 /* A template parameter is not modifiable. */
3703 TREE_CONSTANT (parm
) = 1;
3704 TREE_READONLY (parm
) = 1;
3705 decl
= build_decl (parm_loc
,
3706 CONST_DECL
, DECL_NAME (parm
), TREE_TYPE (parm
));
3707 TREE_CONSTANT (decl
) = 1;
3708 TREE_READONLY (decl
) = 1;
3709 DECL_INITIAL (parm
) = DECL_INITIAL (decl
)
3710 = build_template_parm_index (idx
, processing_template_decl
,
3711 processing_template_decl
,
3712 decl
, TREE_TYPE (parm
));
3714 TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
))
3715 = is_parameter_pack
;
3720 parm
= TREE_VALUE (TREE_VALUE (parm
));
3722 if (parm
&& TREE_CODE (parm
) == TEMPLATE_DECL
)
3724 t
= cxx_make_type (TEMPLATE_TEMPLATE_PARM
);
3725 /* This is for distinguishing between real templates and template
3726 template parameters */
3727 TREE_TYPE (parm
) = t
;
3728 TREE_TYPE (DECL_TEMPLATE_RESULT (parm
)) = t
;
3733 t
= cxx_make_type (TEMPLATE_TYPE_PARM
);
3734 /* parm is either IDENTIFIER_NODE or NULL_TREE. */
3735 decl
= build_decl (parm_loc
,
3736 TYPE_DECL
, parm
, t
);
3739 TYPE_NAME (t
) = decl
;
3740 TYPE_STUB_DECL (t
) = decl
;
3742 TEMPLATE_TYPE_PARM_INDEX (t
)
3743 = build_template_parm_index (idx
, processing_template_decl
,
3744 processing_template_decl
,
3745 decl
, TREE_TYPE (parm
));
3746 TEMPLATE_TYPE_PARAMETER_PACK (t
) = is_parameter_pack
;
3747 TYPE_CANONICAL (t
) = canonical_type_parameter (t
);
3749 DECL_ARTIFICIAL (decl
) = 1;
3750 SET_DECL_TEMPLATE_PARM_P (decl
);
3752 parm
= build_tree_list (defval
, parm
);
3753 return chainon (list
, parm
);
3756 /* The end of a template parameter list has been reached. Process the
3757 tree list into a parameter vector, converting each parameter into a more
3758 useful form. Type parameters are saved as IDENTIFIER_NODEs, and others
3762 end_template_parm_list (tree parms
)
3766 tree saved_parmlist
= make_tree_vec (list_length (parms
));
3768 current_template_parms
3769 = tree_cons (size_int (processing_template_decl
),
3770 saved_parmlist
, current_template_parms
);
3772 for (parm
= parms
, nparms
= 0; parm
; parm
= next
, nparms
++)
3774 next
= TREE_CHAIN (parm
);
3775 TREE_VEC_ELT (saved_parmlist
, nparms
) = parm
;
3776 TREE_CHAIN (parm
) = NULL_TREE
;
3779 --processing_template_parmlist
;
3781 return saved_parmlist
;
3784 /* end_template_decl is called after a template declaration is seen. */
3787 end_template_decl (void)
3789 reset_specialization ();
3791 if (! processing_template_decl
)
3794 /* This matches the pushlevel in begin_template_parm_list. */
3797 --processing_template_decl
;
3798 current_template_parms
= TREE_CHAIN (current_template_parms
);
3801 /* Takes a TREE_LIST representing a template parameter and convert it
3802 into an argument suitable to be passed to the type substitution
3803 functions. Note that If the TREE_LIST contains an error_mark
3804 node, the returned argument is error_mark_node. */
3807 template_parm_to_arg (tree t
)
3811 || TREE_CODE (t
) != TREE_LIST
)
3814 if (error_operand_p (TREE_VALUE (t
)))
3815 return error_mark_node
;
3819 if (TREE_CODE (t
) == TYPE_DECL
3820 || TREE_CODE (t
) == TEMPLATE_DECL
)
3824 if (TEMPLATE_TYPE_PARAMETER_PACK (t
))
3826 /* Turn this argument into a TYPE_ARGUMENT_PACK
3827 with a single element, which expands T. */
3828 tree vec
= make_tree_vec (1);
3829 #ifdef ENABLE_CHECKING
3830 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT
3831 (vec
, TREE_VEC_LENGTH (vec
));
3833 TREE_VEC_ELT (vec
, 0) = make_pack_expansion (t
);
3835 t
= cxx_make_type (TYPE_ARGUMENT_PACK
);
3836 SET_ARGUMENT_PACK_ARGS (t
, vec
);
3841 t
= DECL_INITIAL (t
);
3843 if (TEMPLATE_PARM_PARAMETER_PACK (t
))
3845 /* Turn this argument into a NONTYPE_ARGUMENT_PACK
3846 with a single element, which expands T. */
3847 tree vec
= make_tree_vec (1);
3848 tree type
= TREE_TYPE (TEMPLATE_PARM_DECL (t
));
3849 #ifdef ENABLE_CHECKING
3850 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT
3851 (vec
, TREE_VEC_LENGTH (vec
));
3853 t
= convert_from_reference (t
);
3854 TREE_VEC_ELT (vec
, 0) = make_pack_expansion (t
);
3856 t
= make_node (NONTYPE_ARGUMENT_PACK
);
3857 SET_ARGUMENT_PACK_ARGS (t
, vec
);
3858 TREE_TYPE (t
) = type
;
3861 t
= convert_from_reference (t
);
3866 /* Given a set of template parameters, return them as a set of template
3867 arguments. The template parameters are represented as a TREE_VEC, in
3868 the form documented in cp-tree.h for template arguments. */
3871 template_parms_to_args (tree parms
)
3874 tree args
= NULL_TREE
;
3875 int length
= TMPL_PARMS_DEPTH (parms
);
3878 /* If there is only one level of template parameters, we do not
3879 create a TREE_VEC of TREE_VECs. Instead, we return a single
3880 TREE_VEC containing the arguments. */
3882 args
= make_tree_vec (length
);
3884 for (header
= parms
; header
; header
= TREE_CHAIN (header
))
3886 tree a
= copy_node (TREE_VALUE (header
));
3889 TREE_TYPE (a
) = NULL_TREE
;
3890 for (i
= TREE_VEC_LENGTH (a
) - 1; i
>= 0; --i
)
3891 TREE_VEC_ELT (a
, i
) = template_parm_to_arg (TREE_VEC_ELT (a
, i
));
3893 #ifdef ENABLE_CHECKING
3894 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (a
, TREE_VEC_LENGTH (a
));
3898 TREE_VEC_ELT (args
, --l
) = a
;
3903 if (length
> 1 && TREE_VEC_ELT (args
, 0) == NULL_TREE
)
3904 /* This can happen for template parms of a template template
3907 template<template<class T, class U> class TT> struct S;
3909 Consider the level of the parms of TT; T and U both have
3910 level 2; TT has no template parm of level 1. So in this case
3911 the first element of full_template_args is NULL_TREE. If we
3912 leave it like this TMPL_ARGS_DEPTH on args returns 1 instead
3913 of 2. This will make tsubst wrongly consider that T and U
3914 have level 1. Instead, let's create a dummy vector as the
3915 first element of full_template_args so that TMPL_ARGS_DEPTH
3916 returns the correct depth for args. */
3917 TREE_VEC_ELT (args
, 0) = make_tree_vec (1);
3921 /* Within the declaration of a template, return the currently active
3922 template parameters as an argument TREE_VEC. */
3925 current_template_args (void)
3927 return template_parms_to_args (current_template_parms
);
3930 /* Update the declared TYPE by doing any lookups which were thought to be
3931 dependent, but are not now that we know the SCOPE of the declarator. */
3934 maybe_update_decl_type (tree orig_type
, tree scope
)
3936 tree type
= orig_type
;
3938 if (type
== NULL_TREE
)
3941 if (TREE_CODE (orig_type
) == TYPE_DECL
)
3942 type
= TREE_TYPE (type
);
3944 if (scope
&& TYPE_P (scope
) && dependent_type_p (scope
)
3945 && dependent_type_p (type
)
3946 /* Don't bother building up the args in this case. */
3947 && TREE_CODE (type
) != TEMPLATE_TYPE_PARM
)
3949 /* tsubst in the args corresponding to the template parameters,
3950 including auto if present. Most things will be unchanged, but
3951 make_typename_type and tsubst_qualified_id will resolve
3952 TYPENAME_TYPEs and SCOPE_REFs that were previously dependent. */
3953 tree args
= current_template_args ();
3954 tree auto_node
= type_uses_auto (type
);
3958 tree auto_vec
= make_tree_vec (1);
3959 TREE_VEC_ELT (auto_vec
, 0) = auto_node
;
3960 args
= add_to_template_args (args
, auto_vec
);
3962 pushed
= push_scope (scope
);
3963 type
= tsubst (type
, args
, tf_warning_or_error
, NULL_TREE
);
3968 if (type
== error_mark_node
)
3971 if (TREE_CODE (orig_type
) == TYPE_DECL
)
3973 if (same_type_p (type
, TREE_TYPE (orig_type
)))
3976 type
= TYPE_NAME (type
);
3981 /* Return a TEMPLATE_DECL corresponding to DECL, using the indicated
3982 template PARMS. If MEMBER_TEMPLATE_P is true, the new template is
3983 a member template. Used by push_template_decl below. */
3986 build_template_decl (tree decl
, tree parms
, bool member_template_p
)
3988 tree tmpl
= build_lang_decl (TEMPLATE_DECL
, DECL_NAME (decl
), NULL_TREE
);
3989 DECL_TEMPLATE_PARMS (tmpl
) = parms
;
3990 DECL_CONTEXT (tmpl
) = DECL_CONTEXT (decl
);
3991 DECL_SOURCE_LOCATION (tmpl
) = DECL_SOURCE_LOCATION (decl
);
3992 DECL_MEMBER_TEMPLATE_P (tmpl
) = member_template_p
;
3997 struct template_parm_data
3999 /* The level of the template parameters we are currently
4003 /* The index of the specialization argument we are currently
4007 /* An array whose size is the number of template parameters. The
4008 elements are nonzero if the parameter has been used in any one
4009 of the arguments processed so far. */
4012 /* An array whose size is the number of template arguments. The
4013 elements are nonzero if the argument makes use of template
4014 parameters of this level. */
4015 int* arg_uses_template_parms
;
4018 /* Subroutine of push_template_decl used to see if each template
4019 parameter in a partial specialization is used in the explicit
4020 argument list. If T is of the LEVEL given in DATA (which is
4021 treated as a template_parm_data*), then DATA->PARMS is marked
4025 mark_template_parm (tree t
, void* data
)
4029 struct template_parm_data
* tpd
= (struct template_parm_data
*) data
;
4031 if (TREE_CODE (t
) == TEMPLATE_PARM_INDEX
)
4033 level
= TEMPLATE_PARM_LEVEL (t
);
4034 idx
= TEMPLATE_PARM_IDX (t
);
4038 level
= TEMPLATE_TYPE_LEVEL (t
);
4039 idx
= TEMPLATE_TYPE_IDX (t
);
4042 if (level
== tpd
->level
)
4044 tpd
->parms
[idx
] = 1;
4045 tpd
->arg_uses_template_parms
[tpd
->current_arg
] = 1;
4048 /* Return zero so that for_each_template_parm will continue the
4049 traversal of the tree; we want to mark *every* template parm. */
4053 /* Process the partial specialization DECL. */
4056 process_partial_specialization (tree decl
)
4058 tree type
= TREE_TYPE (decl
);
4059 tree maintmpl
= CLASSTYPE_TI_TEMPLATE (type
);
4060 tree specargs
= CLASSTYPE_TI_ARGS (type
);
4061 tree inner_args
= INNERMOST_TEMPLATE_ARGS (specargs
);
4062 tree main_inner_parms
= DECL_INNERMOST_TEMPLATE_PARMS (maintmpl
);
4065 int nargs
= TREE_VEC_LENGTH (inner_args
);
4068 bool did_error_intro
= false;
4069 struct template_parm_data tpd
;
4070 struct template_parm_data tpd2
;
4072 gcc_assert (current_template_parms
);
4074 inner_parms
= INNERMOST_TEMPLATE_PARMS (current_template_parms
);
4075 ntparms
= TREE_VEC_LENGTH (inner_parms
);
4077 /* We check that each of the template parameters given in the
4078 partial specialization is used in the argument list to the
4079 specialization. For example:
4081 template <class T> struct S;
4082 template <class T> struct S<T*>;
4084 The second declaration is OK because `T*' uses the template
4085 parameter T, whereas
4087 template <class T> struct S<int>;
4089 is no good. Even trickier is:
4100 The S2<T> declaration is actually invalid; it is a
4101 full-specialization. Of course,
4104 struct S2<T (*)(U)>;
4106 or some such would have been OK. */
4107 tpd
.level
= TMPL_PARMS_DEPTH (current_template_parms
);
4108 tpd
.parms
= XALLOCAVEC (int, ntparms
);
4109 memset (tpd
.parms
, 0, sizeof (int) * ntparms
);
4111 tpd
.arg_uses_template_parms
= XALLOCAVEC (int, nargs
);
4112 memset (tpd
.arg_uses_template_parms
, 0, sizeof (int) * nargs
);
4113 for (i
= 0; i
< nargs
; ++i
)
4115 tpd
.current_arg
= i
;
4116 for_each_template_parm (TREE_VEC_ELT (inner_args
, i
),
4117 &mark_template_parm
,
4120 /*include_nondeduced_p=*/false);
4122 for (i
= 0; i
< ntparms
; ++i
)
4123 if (tpd
.parms
[i
] == 0)
4125 /* One of the template parms was not used in a deduced context in the
4127 if (!did_error_intro
)
4129 error ("template parameters not deducible in "
4130 "partial specialization:");
4131 did_error_intro
= true;
4134 inform (input_location
, " %qD",
4135 TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
)));
4138 if (did_error_intro
)
4139 return error_mark_node
;
4141 /* [temp.class.spec]
4143 The argument list of the specialization shall not be identical to
4144 the implicit argument list of the primary template. */
4145 if (comp_template_args
4147 INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE
4149 error ("partial specialization %qT does not specialize any template arguments", type
);
4151 /* A partial specialization that replaces multiple parameters of the
4152 primary template with a pack expansion is less specialized for those
4154 if (nargs
< DECL_NTPARMS (maintmpl
))
4156 error ("partial specialization is not more specialized than the "
4157 "primary template because it replaces multiple parameters "
4158 "with a pack expansion");
4159 inform (DECL_SOURCE_LOCATION (maintmpl
), "primary template here");
4163 /* [temp.class.spec]
4165 A partially specialized non-type argument expression shall not
4166 involve template parameters of the partial specialization except
4167 when the argument expression is a simple identifier.
4169 The type of a template parameter corresponding to a specialized
4170 non-type argument shall not be dependent on a parameter of the
4173 Also, we verify that pack expansions only occur at the
4174 end of the argument list. */
4175 gcc_assert (nargs
== DECL_NTPARMS (maintmpl
));
4177 for (i
= 0; i
< nargs
; ++i
)
4179 tree parm
= TREE_VALUE (TREE_VEC_ELT (main_inner_parms
, i
));
4180 tree arg
= TREE_VEC_ELT (inner_args
, i
);
4181 tree packed_args
= NULL_TREE
;
4184 if (ARGUMENT_PACK_P (arg
))
4186 /* Extract the arguments from the argument pack. We'll be
4187 iterating over these in the following loop. */
4188 packed_args
= ARGUMENT_PACK_ARGS (arg
);
4189 len
= TREE_VEC_LENGTH (packed_args
);
4192 for (j
= 0; j
< len
; j
++)
4195 /* Get the Jth argument in the parameter pack. */
4196 arg
= TREE_VEC_ELT (packed_args
, j
);
4198 if (PACK_EXPANSION_P (arg
))
4200 /* Pack expansions must come at the end of the
4202 if ((packed_args
&& j
< len
- 1)
4203 || (!packed_args
&& i
< nargs
- 1))
4205 if (TREE_CODE (arg
) == EXPR_PACK_EXPANSION
)
4206 error ("parameter pack argument %qE must be at the "
4207 "end of the template argument list", arg
);
4209 error ("parameter pack argument %qT must be at the "
4210 "end of the template argument list", arg
);
4214 if (TREE_CODE (arg
) == EXPR_PACK_EXPANSION
)
4215 /* We only care about the pattern. */
4216 arg
= PACK_EXPANSION_PATTERN (arg
);
4218 if (/* These first two lines are the `non-type' bit. */
4220 && TREE_CODE (arg
) != TEMPLATE_DECL
4221 /* This next two lines are the `argument expression is not just a
4222 simple identifier' condition and also the `specialized
4223 non-type argument' bit. */
4224 && TREE_CODE (arg
) != TEMPLATE_PARM_INDEX
4225 && !(REFERENCE_REF_P (arg
)
4226 && TREE_CODE (TREE_OPERAND (arg
, 0)) == TEMPLATE_PARM_INDEX
))
4228 if ((!packed_args
&& tpd
.arg_uses_template_parms
[i
])
4229 || (packed_args
&& uses_template_parms (arg
)))
4230 error ("template argument %qE involves template parameter(s)",
4234 /* Look at the corresponding template parameter,
4235 marking which template parameters its type depends
4237 tree type
= TREE_TYPE (parm
);
4241 /* We haven't yet initialized TPD2. Do so now. */
4242 tpd2
.arg_uses_template_parms
= XALLOCAVEC (int, nargs
);
4243 /* The number of parameters here is the number in the
4244 main template, which, as checked in the assertion
4246 tpd2
.parms
= XALLOCAVEC (int, nargs
);
4248 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (maintmpl
));
4251 /* Mark the template parameters. But this time, we're
4252 looking for the template parameters of the main
4253 template, not in the specialization. */
4254 tpd2
.current_arg
= i
;
4255 tpd2
.arg_uses_template_parms
[i
] = 0;
4256 memset (tpd2
.parms
, 0, sizeof (int) * nargs
);
4257 for_each_template_parm (type
,
4258 &mark_template_parm
,
4261 /*include_nondeduced_p=*/false);
4263 if (tpd2
.arg_uses_template_parms
[i
])
4265 /* The type depended on some template parameters.
4266 If they are fully specialized in the
4267 specialization, that's OK. */
4270 for (j
= 0; j
< nargs
; ++j
)
4271 if (tpd2
.parms
[j
] != 0
4272 && tpd
.arg_uses_template_parms
[j
])
4275 error_n (input_location
, count
,
4276 "type %qT of template argument %qE depends "
4277 "on a template parameter",
4278 "type %qT of template argument %qE depends "
4279 "on template parameters",
4288 /* We should only get here once. */
4289 gcc_assert (!COMPLETE_TYPE_P (type
));
4291 tree tmpl
= build_template_decl (decl
, current_template_parms
,
4292 DECL_MEMBER_TEMPLATE_P (maintmpl
));
4293 TREE_TYPE (tmpl
) = type
;
4294 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
4295 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
4296 DECL_TEMPLATE_INFO (tmpl
) = build_template_info (maintmpl
, specargs
);
4297 DECL_PRIMARY_TEMPLATE (tmpl
) = maintmpl
;
4299 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)
4300 = tree_cons (specargs
, tmpl
,
4301 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
));
4302 TREE_TYPE (DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)) = type
;
4304 for (inst
= DECL_TEMPLATE_INSTANTIATIONS (maintmpl
); inst
;
4305 inst
= TREE_CHAIN (inst
))
4307 tree inst_type
= TREE_VALUE (inst
);
4308 if (COMPLETE_TYPE_P (inst_type
)
4309 && CLASSTYPE_IMPLICIT_INSTANTIATION (inst_type
))
4311 tree spec
= most_specialized_class (inst_type
, tf_none
);
4312 if (spec
&& TREE_TYPE (spec
) == type
)
4313 permerror (input_location
,
4314 "partial specialization of %qT after instantiation "
4315 "of %qT", type
, inst_type
);
4322 /* PARM is a template parameter of some form; return the corresponding
4323 TEMPLATE_PARM_INDEX. */
4326 get_template_parm_index (tree parm
)
4328 if (TREE_CODE (parm
) == PARM_DECL
4329 || TREE_CODE (parm
) == CONST_DECL
)
4330 parm
= DECL_INITIAL (parm
);
4331 else if (TREE_CODE (parm
) == TYPE_DECL
4332 || TREE_CODE (parm
) == TEMPLATE_DECL
)
4333 parm
= TREE_TYPE (parm
);
4334 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
4335 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
)
4336 parm
= TEMPLATE_TYPE_PARM_INDEX (parm
);
4337 gcc_assert (TREE_CODE (parm
) == TEMPLATE_PARM_INDEX
);
4341 /* Subroutine of fixed_parameter_pack_p below. Look for any template
4342 parameter packs used by the template parameter PARM. */
4345 fixed_parameter_pack_p_1 (tree parm
, struct find_parameter_pack_data
*ppd
)
4347 /* A type parm can't refer to another parm. */
4348 if (TREE_CODE (parm
) == TYPE_DECL
)
4350 else if (TREE_CODE (parm
) == PARM_DECL
)
4352 cp_walk_tree (&TREE_TYPE (parm
), &find_parameter_packs_r
,
4357 gcc_assert (TREE_CODE (parm
) == TEMPLATE_DECL
);
4359 tree vec
= INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (parm
));
4360 for (int i
= 0; i
< TREE_VEC_LENGTH (vec
); ++i
)
4361 fixed_parameter_pack_p_1 (TREE_VALUE (TREE_VEC_ELT (vec
, i
)), ppd
);
4364 /* PARM is a template parameter pack. Return any parameter packs used in
4365 its type or the type of any of its template parameters. If there are
4366 any such packs, it will be instantiated into a fixed template parameter
4367 list by partial instantiation rather than be fully deduced. */
4370 fixed_parameter_pack_p (tree parm
)
4372 /* This can only be true in a member template. */
4373 if (TEMPLATE_PARM_ORIG_LEVEL (get_template_parm_index (parm
)) < 2)
4375 /* This can only be true for a parameter pack. */
4376 if (!template_parameter_pack_p (parm
))
4378 /* A type parm can't refer to another parm. */
4379 if (TREE_CODE (parm
) == TYPE_DECL
)
4382 tree parameter_packs
= NULL_TREE
;
4383 struct find_parameter_pack_data ppd
;
4384 ppd
.parameter_packs
= ¶meter_packs
;
4385 ppd
.visited
= pointer_set_create ();
4387 fixed_parameter_pack_p_1 (parm
, &ppd
);
4389 pointer_set_destroy (ppd
.visited
);
4390 return parameter_packs
;
4393 /* Check that a template declaration's use of default arguments and
4394 parameter packs is not invalid. Here, PARMS are the template
4395 parameters. IS_PRIMARY is true if DECL is the thing declared by
4396 a primary template. IS_PARTIAL is true if DECL is a partial
4399 IS_FRIEND_DECL is nonzero if DECL is a friend function template
4400 declaration (but not a definition); 1 indicates a declaration, 2
4401 indicates a redeclaration. When IS_FRIEND_DECL=2, no errors are
4402 emitted for extraneous default arguments.
4404 Returns TRUE if there were no errors found, FALSE otherwise. */
4407 check_default_tmpl_args (tree decl
, tree parms
, bool is_primary
,
4408 bool is_partial
, int is_friend_decl
)
4411 int last_level_to_check
;
4413 bool no_errors
= true;
4417 A default template-argument shall not be specified in a
4418 function template declaration or a function template definition, nor
4419 in the template-parameter-list of the definition of a member of a
4422 if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == FUNCTION_DECL
)
4423 /* You can't have a function template declaration in a local
4424 scope, nor you can you define a member of a class template in a
4428 if (TREE_CODE (decl
) == TYPE_DECL
4430 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
4431 /* A lambda doesn't have an explicit declaration; don't complain
4432 about the parms of the enclosing class. */
4435 if (current_class_type
4436 && !TYPE_BEING_DEFINED (current_class_type
)
4437 && DECL_LANG_SPECIFIC (decl
)
4438 && DECL_DECLARES_FUNCTION_P (decl
)
4439 /* If this is either a friend defined in the scope of the class
4440 or a member function. */
4441 && (DECL_FUNCTION_MEMBER_P (decl
)
4442 ? same_type_p (DECL_CONTEXT (decl
), current_class_type
)
4443 : DECL_FRIEND_CONTEXT (decl
)
4444 ? same_type_p (DECL_FRIEND_CONTEXT (decl
), current_class_type
)
4446 /* And, if it was a member function, it really was defined in
4447 the scope of the class. */
4448 && (!DECL_FUNCTION_MEMBER_P (decl
)
4449 || DECL_INITIALIZED_IN_CLASS_P (decl
)))
4450 /* We already checked these parameters when the template was
4451 declared, so there's no need to do it again now. This function
4452 was defined in class scope, but we're processing its body now
4453 that the class is complete. */
4456 /* Core issue 226 (C++0x only): the following only applies to class
4459 && ((cxx_dialect
== cxx98
) || TREE_CODE (decl
) != FUNCTION_DECL
))
4463 If a template-parameter has a default template-argument, all
4464 subsequent template-parameters shall have a default
4465 template-argument supplied. */
4466 for (parm_level
= parms
; parm_level
; parm_level
= TREE_CHAIN (parm_level
))
4468 tree inner_parms
= TREE_VALUE (parm_level
);
4469 int ntparms
= TREE_VEC_LENGTH (inner_parms
);
4470 int seen_def_arg_p
= 0;
4473 for (i
= 0; i
< ntparms
; ++i
)
4475 tree parm
= TREE_VEC_ELT (inner_parms
, i
);
4477 if (parm
== error_mark_node
)
4480 if (TREE_PURPOSE (parm
))
4482 else if (seen_def_arg_p
4483 && !template_parameter_pack_p (TREE_VALUE (parm
)))
4485 error ("no default argument for %qD", TREE_VALUE (parm
));
4486 /* For better subsequent error-recovery, we indicate that
4487 there should have been a default argument. */
4488 TREE_PURPOSE (parm
) = error_mark_node
;
4491 else if (!is_partial
4493 /* Don't complain about an enclosing partial
4495 && parm_level
== parms
4496 && TREE_CODE (decl
) == TYPE_DECL
4498 && template_parameter_pack_p (TREE_VALUE (parm
))
4499 /* A fixed parameter pack will be partially
4500 instantiated into a fixed length list. */
4501 && !fixed_parameter_pack_p (TREE_VALUE (parm
)))
4503 /* A primary class template can only have one
4504 parameter pack, at the end of the template
4507 if (TREE_CODE (TREE_VALUE (parm
)) == PARM_DECL
)
4508 error ("parameter pack %qE must be at the end of the"
4509 " template parameter list", TREE_VALUE (parm
));
4511 error ("parameter pack %qT must be at the end of the"
4512 " template parameter list",
4513 TREE_TYPE (TREE_VALUE (parm
)));
4515 TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
))
4523 if (((cxx_dialect
== cxx98
) && TREE_CODE (decl
) != TYPE_DECL
)
4527 /* For an ordinary class template, default template arguments are
4528 allowed at the innermost level, e.g.:
4529 template <class T = int>
4531 but, in a partial specialization, they're not allowed even
4532 there, as we have in [temp.class.spec]:
4534 The template parameter list of a specialization shall not
4535 contain default template argument values.
4537 So, for a partial specialization, or for a function template
4538 (in C++98/C++03), we look at all of them. */
4541 /* But, for a primary class template that is not a partial
4542 specialization we look at all template parameters except the
4544 parms
= TREE_CHAIN (parms
);
4546 /* Figure out what error message to issue. */
4547 if (is_friend_decl
== 2)
4548 msg
= G_("default template arguments may not be used in function template "
4549 "friend re-declaration");
4550 else if (is_friend_decl
)
4551 msg
= G_("default template arguments may not be used in function template "
4552 "friend declarations");
4553 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& (cxx_dialect
== cxx98
))
4554 msg
= G_("default template arguments may not be used in function templates "
4555 "without -std=c++11 or -std=gnu++11");
4556 else if (is_partial
)
4557 msg
= G_("default template arguments may not be used in "
4558 "partial specializations");
4560 msg
= G_("default argument for template parameter for class enclosing %qD");
4562 if (current_class_type
&& TYPE_BEING_DEFINED (current_class_type
))
4563 /* If we're inside a class definition, there's no need to
4564 examine the parameters to the class itself. On the one
4565 hand, they will be checked when the class is defined, and,
4566 on the other, default arguments are valid in things like:
4567 template <class T = double>
4568 struct S { template <class U> void f(U); };
4569 Here the default argument for `S' has no bearing on the
4570 declaration of `f'. */
4571 last_level_to_check
= template_class_depth (current_class_type
) + 1;
4573 /* Check everything. */
4574 last_level_to_check
= 0;
4576 for (parm_level
= parms
;
4577 parm_level
&& TMPL_PARMS_DEPTH (parm_level
) >= last_level_to_check
;
4578 parm_level
= TREE_CHAIN (parm_level
))
4580 tree inner_parms
= TREE_VALUE (parm_level
);
4584 ntparms
= TREE_VEC_LENGTH (inner_parms
);
4585 for (i
= 0; i
< ntparms
; ++i
)
4587 if (TREE_VEC_ELT (inner_parms
, i
) == error_mark_node
)
4590 if (TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)))
4595 if (is_friend_decl
== 2)
4602 /* Clear out the default argument so that we are not
4604 TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)) = NULL_TREE
;
4608 /* At this point, if we're still interested in issuing messages,
4609 they must apply to classes surrounding the object declared. */
4611 msg
= G_("default argument for template parameter for class "
4618 /* Worker for push_template_decl_real, called via
4619 for_each_template_parm. DATA is really an int, indicating the
4620 level of the parameters we are interested in. If T is a template
4621 parameter of that level, return nonzero. */
4624 template_parm_this_level_p (tree t
, void* data
)
4626 int this_level
= *(int *)data
;
4629 if (TREE_CODE (t
) == TEMPLATE_PARM_INDEX
)
4630 level
= TEMPLATE_PARM_LEVEL (t
);
4632 level
= TEMPLATE_TYPE_LEVEL (t
);
4633 return level
== this_level
;
4636 /* Creates a TEMPLATE_DECL for the indicated DECL using the template
4637 parameters given by current_template_args, or reuses a
4638 previously existing one, if appropriate. Returns the DECL, or an
4639 equivalent one, if it is replaced via a call to duplicate_decls.
4641 If IS_FRIEND is true, DECL is a friend declaration. */
4644 push_template_decl_real (tree decl
, bool is_friend
)
4652 int new_template_p
= 0;
4653 /* True if the template is a member template, in the sense of
4655 bool member_template_p
= false;
4657 if (decl
== error_mark_node
|| !current_template_parms
)
4658 return error_mark_node
;
4660 /* See if this is a partial specialization. */
4661 is_partial
= (DECL_IMPLICIT_TYPEDEF_P (decl
)
4662 && TREE_CODE (TREE_TYPE (decl
)) != ENUMERAL_TYPE
4663 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)));
4665 if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_FRIEND_P (decl
))
4669 /* For a friend, we want the context of the friend function, not
4670 the type of which it is a friend. */
4671 ctx
= CP_DECL_CONTEXT (decl
);
4672 else if (CP_DECL_CONTEXT (decl
)
4673 && TREE_CODE (CP_DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
4674 /* In the case of a virtual function, we want the class in which
4676 ctx
= CP_DECL_CONTEXT (decl
);
4678 /* Otherwise, if we're currently defining some class, the DECL
4679 is assumed to be a member of the class. */
4680 ctx
= current_scope ();
4682 if (ctx
&& TREE_CODE (ctx
) == NAMESPACE_DECL
)
4685 if (!DECL_CONTEXT (decl
))
4686 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
4688 /* See if this is a primary template. */
4689 if (is_friend
&& ctx
4690 && uses_template_parms_level (ctx
, processing_template_decl
))
4691 /* A friend template that specifies a class context, i.e.
4692 template <typename T> friend void A<T>::f();
4696 is_primary
= template_parm_scope_p ();
4700 if (DECL_CLASS_SCOPE_P (decl
))
4701 member_template_p
= true;
4702 if (TREE_CODE (decl
) == TYPE_DECL
4703 && ANON_AGGRNAME_P (DECL_NAME (decl
)))
4705 error ("template class without a name");
4706 return error_mark_node
;
4708 else if (TREE_CODE (decl
) == FUNCTION_DECL
)
4710 if (DECL_DESTRUCTOR_P (decl
))
4714 A destructor shall not be a member template. */
4715 error ("destructor %qD declared as member template", decl
);
4716 return error_mark_node
;
4718 if (NEW_DELETE_OPNAME_P (DECL_NAME (decl
))
4719 && (!prototype_p (TREE_TYPE (decl
))
4720 || TYPE_ARG_TYPES (TREE_TYPE (decl
)) == void_list_node
4721 || !TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)))
4722 || (TREE_CHAIN (TYPE_ARG_TYPES ((TREE_TYPE (decl
))))
4723 == void_list_node
)))
4725 /* [basic.stc.dynamic.allocation]
4727 An allocation function can be a function
4728 template. ... Template allocation functions shall
4729 have two or more parameters. */
4730 error ("invalid template declaration of %qD", decl
);
4731 return error_mark_node
;
4734 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
4735 && CLASS_TYPE_P (TREE_TYPE (decl
)))
4737 else if (TREE_CODE (decl
) == TYPE_DECL
4738 && TYPE_DECL_ALIAS_P (decl
))
4739 /* alias-declaration */
4740 gcc_assert (!DECL_ARTIFICIAL (decl
));
4743 error ("template declaration of %q#D", decl
);
4744 return error_mark_node
;
4748 /* Check to see that the rules regarding the use of default
4749 arguments are not being violated. */
4750 check_default_tmpl_args (decl
, current_template_parms
,
4751 is_primary
, is_partial
, /*is_friend_decl=*/0);
4753 /* Ensure that there are no parameter packs in the type of this
4754 declaration that have not been expanded. */
4755 if (TREE_CODE (decl
) == FUNCTION_DECL
)
4757 /* Check each of the arguments individually to see if there are
4758 any bare parameter packs. */
4759 tree type
= TREE_TYPE (decl
);
4760 tree arg
= DECL_ARGUMENTS (decl
);
4761 tree argtype
= TYPE_ARG_TYPES (type
);
4763 while (arg
&& argtype
)
4765 if (!DECL_PACK_P (arg
)
4766 && check_for_bare_parameter_packs (TREE_TYPE (arg
)))
4768 /* This is a PARM_DECL that contains unexpanded parameter
4769 packs. We have already complained about this in the
4770 check_for_bare_parameter_packs call, so just replace
4771 these types with ERROR_MARK_NODE. */
4772 TREE_TYPE (arg
) = error_mark_node
;
4773 TREE_VALUE (argtype
) = error_mark_node
;
4776 arg
= DECL_CHAIN (arg
);
4777 argtype
= TREE_CHAIN (argtype
);
4780 /* Check for bare parameter packs in the return type and the
4781 exception specifiers. */
4782 if (check_for_bare_parameter_packs (TREE_TYPE (type
)))
4783 /* Errors were already issued, set return type to int
4784 as the frontend doesn't expect error_mark_node as
4786 TREE_TYPE (type
) = integer_type_node
;
4787 if (check_for_bare_parameter_packs (TYPE_RAISES_EXCEPTIONS (type
)))
4788 TYPE_RAISES_EXCEPTIONS (type
) = NULL_TREE
;
4790 else if (check_for_bare_parameter_packs ((TREE_CODE (decl
) == TYPE_DECL
4791 && TYPE_DECL_ALIAS_P (decl
))
4792 ? DECL_ORIGINAL_TYPE (decl
)
4793 : TREE_TYPE (decl
)))
4795 TREE_TYPE (decl
) = error_mark_node
;
4796 return error_mark_node
;
4800 return process_partial_specialization (decl
);
4802 args
= current_template_args ();
4805 || TREE_CODE (ctx
) == FUNCTION_DECL
4806 || (CLASS_TYPE_P (ctx
) && TYPE_BEING_DEFINED (ctx
))
4807 || (TREE_CODE (decl
) == TYPE_DECL
4808 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
4809 || (is_friend
&& !DECL_TEMPLATE_INFO (decl
)))
4811 if (DECL_LANG_SPECIFIC (decl
)
4812 && DECL_TEMPLATE_INFO (decl
)
4813 && DECL_TI_TEMPLATE (decl
))
4814 tmpl
= DECL_TI_TEMPLATE (decl
);
4815 /* If DECL is a TYPE_DECL for a class-template, then there won't
4816 be DECL_LANG_SPECIFIC. The information equivalent to
4817 DECL_TEMPLATE_INFO is found in TYPE_TEMPLATE_INFO instead. */
4818 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
4819 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl
))
4820 && TYPE_TI_TEMPLATE (TREE_TYPE (decl
)))
4822 /* Since a template declaration already existed for this
4823 class-type, we must be redeclaring it here. Make sure
4824 that the redeclaration is valid. */
4825 redeclare_class_template (TREE_TYPE (decl
),
4826 current_template_parms
);
4827 /* We don't need to create a new TEMPLATE_DECL; just use the
4828 one we already had. */
4829 tmpl
= TYPE_TI_TEMPLATE (TREE_TYPE (decl
));
4833 tmpl
= build_template_decl (decl
, current_template_parms
,
4837 if (DECL_LANG_SPECIFIC (decl
)
4838 && DECL_TEMPLATE_SPECIALIZATION (decl
))
4840 /* A specialization of a member template of a template
4842 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
4843 DECL_TEMPLATE_INFO (tmpl
) = DECL_TEMPLATE_INFO (decl
);
4844 DECL_TEMPLATE_INFO (decl
) = NULL_TREE
;
4850 tree a
, t
, current
, parms
;
4852 tree tinfo
= get_template_info (decl
);
4856 error ("template definition of non-template %q#D", decl
);
4857 return error_mark_node
;
4860 tmpl
= TI_TEMPLATE (tinfo
);
4862 if (DECL_FUNCTION_TEMPLATE_P (tmpl
)
4863 && DECL_TEMPLATE_INFO (decl
) && DECL_TI_ARGS (decl
)
4864 && DECL_TEMPLATE_SPECIALIZATION (decl
)
4865 && DECL_MEMBER_TEMPLATE_P (tmpl
))
4869 /* The declaration is a specialization of a member
4870 template, declared outside the class. Therefore, the
4871 innermost template arguments will be NULL, so we
4872 replace them with the arguments determined by the
4873 earlier call to check_explicit_specialization. */
4874 args
= DECL_TI_ARGS (decl
);
4877 = build_template_decl (decl
, current_template_parms
,
4879 DECL_TEMPLATE_RESULT (new_tmpl
) = decl
;
4880 TREE_TYPE (new_tmpl
) = TREE_TYPE (decl
);
4881 DECL_TI_TEMPLATE (decl
) = new_tmpl
;
4882 SET_DECL_TEMPLATE_SPECIALIZATION (new_tmpl
);
4883 DECL_TEMPLATE_INFO (new_tmpl
)
4884 = build_template_info (tmpl
, args
);
4886 register_specialization (new_tmpl
,
4887 most_general_template (tmpl
),
4893 /* Make sure the template headers we got make sense. */
4895 parms
= DECL_TEMPLATE_PARMS (tmpl
);
4896 i
= TMPL_PARMS_DEPTH (parms
);
4897 if (TMPL_ARGS_DEPTH (args
) != i
)
4899 error ("expected %d levels of template parms for %q#D, got %d",
4900 i
, decl
, TMPL_ARGS_DEPTH (args
));
4901 DECL_INTERFACE_KNOWN (decl
) = 1;
4902 return error_mark_node
;
4905 for (current
= decl
; i
> 0; --i
, parms
= TREE_CHAIN (parms
))
4907 a
= TMPL_ARGS_LEVEL (args
, i
);
4908 t
= INNERMOST_TEMPLATE_PARMS (parms
);
4910 if (TREE_VEC_LENGTH (t
) != TREE_VEC_LENGTH (a
))
4912 if (current
== decl
)
4913 error ("got %d template parameters for %q#D",
4914 TREE_VEC_LENGTH (a
), decl
);
4916 error ("got %d template parameters for %q#T",
4917 TREE_VEC_LENGTH (a
), current
);
4918 error (" but %d required", TREE_VEC_LENGTH (t
));
4919 /* Avoid crash in import_export_decl. */
4920 DECL_INTERFACE_KNOWN (decl
) = 1;
4921 return error_mark_node
;
4924 if (current
== decl
)
4926 else if (current
== NULL_TREE
)
4927 /* Can happen in erroneous input. */
4930 current
= get_containing_scope (current
);
4933 /* Check that the parms are used in the appropriate qualifying scopes
4934 in the declarator. */
4935 if (!comp_template_args
4937 TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (tmpl
)))))
4940 template arguments to %qD do not match original template %qD",
4941 decl
, DECL_TEMPLATE_RESULT (tmpl
));
4942 if (!uses_template_parms (TI_ARGS (tinfo
)))
4943 inform (input_location
, "use template<> for an explicit specialization");
4944 /* Avoid crash in import_export_decl. */
4945 DECL_INTERFACE_KNOWN (decl
) = 1;
4946 return error_mark_node
;
4950 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
4951 TREE_TYPE (tmpl
) = TREE_TYPE (decl
);
4953 /* Push template declarations for global functions and types. Note
4954 that we do not try to push a global template friend declared in a
4955 template class; such a thing may well depend on the template
4956 parameters of the class. */
4957 if (new_template_p
&& !ctx
4958 && !(is_friend
&& template_class_depth (current_class_type
) > 0))
4960 tmpl
= pushdecl_namespace_level (tmpl
, is_friend
);
4961 if (tmpl
== error_mark_node
)
4962 return error_mark_node
;
4964 /* Hide template friend classes that haven't been declared yet. */
4965 if (is_friend
&& TREE_CODE (decl
) == TYPE_DECL
)
4967 DECL_ANTICIPATED (tmpl
) = 1;
4968 DECL_FRIEND_P (tmpl
) = 1;
4974 tree parms
= DECL_TEMPLATE_PARMS (tmpl
);
4977 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
4978 if (DECL_CONV_FN_P (tmpl
))
4980 int depth
= TMPL_PARMS_DEPTH (parms
);
4982 /* It is a conversion operator. See if the type converted to
4983 depends on innermost template operands. */
4985 if (uses_template_parms_level (TREE_TYPE (TREE_TYPE (tmpl
)),
4987 DECL_TEMPLATE_CONV_FN_P (tmpl
) = 1;
4990 /* Give template template parms a DECL_CONTEXT of the template
4991 for which they are a parameter. */
4992 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
4993 for (i
= TREE_VEC_LENGTH (parms
) - 1; i
>= 0; --i
)
4995 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
4996 if (TREE_CODE (parm
) == TEMPLATE_DECL
)
4997 DECL_CONTEXT (parm
) = tmpl
;
5001 /* The DECL_TI_ARGS of DECL contains full set of arguments referring
5002 back to its most general template. If TMPL is a specialization,
5003 ARGS may only have the innermost set of arguments. Add the missing
5004 argument levels if necessary. */
5005 if (DECL_TEMPLATE_INFO (tmpl
))
5006 args
= add_outermost_template_args (DECL_TI_ARGS (tmpl
), args
);
5008 info
= build_template_info (tmpl
, args
);
5010 if (DECL_IMPLICIT_TYPEDEF_P (decl
))
5011 SET_TYPE_TEMPLATE_INFO (TREE_TYPE (tmpl
), info
);
5014 if (is_primary
&& !DECL_LANG_SPECIFIC (decl
))
5015 retrofit_lang_decl (decl
);
5016 if (DECL_LANG_SPECIFIC (decl
))
5017 DECL_TEMPLATE_INFO (decl
) = info
;
5020 return DECL_TEMPLATE_RESULT (tmpl
);
5024 push_template_decl (tree decl
)
5026 return push_template_decl_real (decl
, false);
5029 /* FN is an inheriting constructor that inherits from the constructor
5030 template INHERITED; turn FN into a constructor template with a matching
5034 add_inherited_template_parms (tree fn
, tree inherited
)
5037 = INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (inherited
));
5038 inner_parms
= copy_node (inner_parms
);
5040 = tree_cons (size_int (processing_template_decl
+ 1),
5041 inner_parms
, current_template_parms
);
5042 tree tmpl
= build_template_decl (fn
, parms
, /*member*/true);
5043 tree args
= template_parms_to_args (parms
);
5044 DECL_TEMPLATE_INFO (fn
) = build_template_info (tmpl
, args
);
5045 TREE_TYPE (tmpl
) = TREE_TYPE (fn
);
5046 DECL_TEMPLATE_RESULT (tmpl
) = fn
;
5047 DECL_ARTIFICIAL (tmpl
) = true;
5048 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
5052 /* Called when a class template TYPE is redeclared with the indicated
5053 template PARMS, e.g.:
5055 template <class T> struct S;
5056 template <class T> struct S {}; */
5059 redeclare_class_template (tree type
, tree parms
)
5065 if (!TYPE_TEMPLATE_INFO (type
))
5067 error ("%qT is not a template type", type
);
5071 tmpl
= TYPE_TI_TEMPLATE (type
);
5072 if (!PRIMARY_TEMPLATE_P (tmpl
))
5073 /* The type is nested in some template class. Nothing to worry
5074 about here; there are no new template parameters for the nested
5080 error ("template specifiers not specified in declaration of %qD",
5085 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
5086 tmpl_parms
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl
);
5088 if (TREE_VEC_LENGTH (parms
) != TREE_VEC_LENGTH (tmpl_parms
))
5090 error_n (input_location
, TREE_VEC_LENGTH (parms
),
5091 "redeclared with %d template parameter",
5092 "redeclared with %d template parameters",
5093 TREE_VEC_LENGTH (parms
));
5094 inform_n (input_location
, TREE_VEC_LENGTH (tmpl_parms
),
5095 "previous declaration %q+D used %d template parameter",
5096 "previous declaration %q+D used %d template parameters",
5097 tmpl
, TREE_VEC_LENGTH (tmpl_parms
));
5101 for (i
= 0; i
< TREE_VEC_LENGTH (tmpl_parms
); ++i
)
5108 if (TREE_VEC_ELT (tmpl_parms
, i
) == error_mark_node
5109 || TREE_VEC_ELT (parms
, i
) == error_mark_node
)
5112 tmpl_parm
= TREE_VALUE (TREE_VEC_ELT (tmpl_parms
, i
));
5113 if (error_operand_p (tmpl_parm
))
5116 parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
5117 tmpl_default
= TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
));
5118 parm_default
= TREE_PURPOSE (TREE_VEC_ELT (parms
, i
));
5120 /* TMPL_PARM and PARM can be either TYPE_DECL, PARM_DECL, or
5122 if (TREE_CODE (tmpl_parm
) != TREE_CODE (parm
)
5123 || (TREE_CODE (tmpl_parm
) != TYPE_DECL
5124 && !same_type_p (TREE_TYPE (tmpl_parm
), TREE_TYPE (parm
)))
5125 || (TREE_CODE (tmpl_parm
) != PARM_DECL
5126 && (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (tmpl_parm
))
5127 != TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
))))
5128 || (TREE_CODE (tmpl_parm
) == PARM_DECL
5129 && (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (tmpl_parm
))
5130 != TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))))
5132 error ("template parameter %q+#D", tmpl_parm
);
5133 error ("redeclared here as %q#D", parm
);
5137 if (tmpl_default
!= NULL_TREE
&& parm_default
!= NULL_TREE
)
5139 /* We have in [temp.param]:
5141 A template-parameter may not be given default arguments
5142 by two different declarations in the same scope. */
5143 error_at (input_location
, "redefinition of default argument for %q#D", parm
);
5144 inform (DECL_SOURCE_LOCATION (tmpl_parm
),
5145 "original definition appeared here");
5149 if (parm_default
!= NULL_TREE
)
5150 /* Update the previous template parameters (which are the ones
5151 that will really count) with the new default value. */
5152 TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
)) = parm_default
;
5153 else if (tmpl_default
!= NULL_TREE
)
5154 /* Update the new parameters, too; they'll be used as the
5155 parameters for any members. */
5156 TREE_PURPOSE (TREE_VEC_ELT (parms
, i
)) = tmpl_default
;
5162 /* Simplify EXPR if it is a non-dependent expression. Returns the
5163 (possibly simplified) expression. */
5166 fold_non_dependent_expr_sfinae (tree expr
, tsubst_flags_t complain
)
5168 if (expr
== NULL_TREE
)
5171 /* If we're in a template, but EXPR isn't value dependent, simplify
5172 it. We're supposed to treat:
5174 template <typename T> void f(T[1 + 1]);
5175 template <typename T> void f(T[2]);
5177 as two declarations of the same function, for example. */
5178 if (processing_template_decl
5179 && !instantiation_dependent_expression_p (expr
)
5180 && potential_constant_expression (expr
))
5182 HOST_WIDE_INT saved_processing_template_decl
;
5184 saved_processing_template_decl
= processing_template_decl
;
5185 processing_template_decl
= 0;
5186 expr
= tsubst_copy_and_build (expr
,
5189 /*in_decl=*/NULL_TREE
,
5190 /*function_p=*/false,
5191 /*integral_constant_expression_p=*/true);
5192 processing_template_decl
= saved_processing_template_decl
;
5198 fold_non_dependent_expr (tree expr
)
5200 return fold_non_dependent_expr_sfinae (expr
, tf_error
);
5203 /* Return TRUE iff T is a type alias, a TEMPLATE_DECL for an alias
5204 template declaration, or a TYPE_DECL for an alias declaration. */
5207 alias_type_or_template_p (tree t
)
5211 return ((TREE_CODE (t
) == TYPE_DECL
&& TYPE_DECL_ALIAS_P (t
))
5214 && TYPE_DECL_ALIAS_P (TYPE_NAME (t
)))
5215 || DECL_ALIAS_TEMPLATE_P (t
));
5218 /* Return TRUE iff is a specialization of an alias template. */
5221 alias_template_specialization_p (const_tree t
)
5227 && TYPE_TEMPLATE_INFO (t
)
5228 && PRIMARY_TEMPLATE_P (TYPE_TI_TEMPLATE (t
))
5229 && DECL_ALIAS_TEMPLATE_P (TYPE_TI_TEMPLATE (t
)));
5232 /* Return the number of innermost template parameters in TMPL. */
5235 num_innermost_template_parms (tree tmpl
)
5237 tree parms
= INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (tmpl
));
5238 return TREE_VEC_LENGTH (parms
);
5241 /* Return either TMPL or another template that it is equivalent to under DR
5242 1286: An alias that just changes the name of a template is equivalent to
5243 the other template. */
5246 get_underlying_template (tree tmpl
)
5248 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
);
5249 while (DECL_ALIAS_TEMPLATE_P (tmpl
))
5251 tree result
= DECL_ORIGINAL_TYPE (DECL_TEMPLATE_RESULT (tmpl
));
5252 if (TYPE_TEMPLATE_INFO (result
))
5254 tree sub
= TYPE_TI_TEMPLATE (result
);
5255 if (PRIMARY_TEMPLATE_P (sub
)
5256 && (num_innermost_template_parms (tmpl
)
5257 == num_innermost_template_parms (sub
)))
5259 tree alias_args
= INNERMOST_TEMPLATE_ARGS
5260 (template_parms_to_args (DECL_TEMPLATE_PARMS (tmpl
)));
5261 if (!comp_template_args (TYPE_TI_ARGS (result
), alias_args
))
5263 /* The alias type is equivalent to the pattern of the
5264 underlying template, so strip the alias. */
5274 /* Subroutine of convert_nontype_argument. Converts EXPR to TYPE, which
5275 must be a function or a pointer-to-function type, as specified
5276 in [temp.arg.nontype]: disambiguate EXPR if it is an overload set,
5277 and check that the resulting function has external linkage. */
5280 convert_nontype_argument_function (tree type
, tree expr
)
5284 linkage_kind linkage
;
5286 fn
= instantiate_type (type
, fns
, tf_none
);
5287 if (fn
== error_mark_node
)
5288 return error_mark_node
;
5291 if (TREE_CODE (fn_no_ptr
) == ADDR_EXPR
)
5292 fn_no_ptr
= TREE_OPERAND (fn_no_ptr
, 0);
5293 if (BASELINK_P (fn_no_ptr
))
5294 fn_no_ptr
= BASELINK_FUNCTIONS (fn_no_ptr
);
5296 /* [temp.arg.nontype]/1
5298 A template-argument for a non-type, non-template template-parameter
5301 -- the address of an object or function with external [C++11: or
5302 internal] linkage. */
5304 if (TREE_CODE (fn_no_ptr
) != FUNCTION_DECL
)
5306 error ("%qE is not a valid template argument for type %qT", expr
, type
);
5307 if (TYPE_PTR_P (type
))
5308 error ("it must be the address of a function with external linkage");
5310 error ("it must be the name of a function with external linkage");
5314 linkage
= decl_linkage (fn_no_ptr
);
5315 if (cxx_dialect
>= cxx11
? linkage
== lk_none
: linkage
!= lk_external
)
5317 if (cxx_dialect
>= cxx11
)
5318 error ("%qE is not a valid template argument for type %qT "
5319 "because %qD has no linkage",
5320 expr
, type
, fn_no_ptr
);
5322 error ("%qE is not a valid template argument for type %qT "
5323 "because %qD does not have external linkage",
5324 expr
, type
, fn_no_ptr
);
5331 /* Subroutine of convert_nontype_argument.
5332 Check if EXPR of type TYPE is a valid pointer-to-member constant.
5333 Emit an error otherwise. */
5336 check_valid_ptrmem_cst_expr (tree type
, tree expr
,
5337 tsubst_flags_t complain
)
5340 if (expr
&& (null_ptr_cst_p (expr
) || TREE_CODE (expr
) == PTRMEM_CST
))
5342 if (cxx_dialect
>= cxx11
&& null_member_pointer_value_p (expr
))
5344 if (complain
& tf_error
)
5346 error ("%qE is not a valid template argument for type %qT",
5348 error ("it must be a pointer-to-member of the form %<&X::Y%>");
5353 /* Returns TRUE iff the address of OP is value-dependent.
5355 14.6.2.4 [temp.dep.temp]:
5356 A non-integral non-type template-argument is dependent if its type is
5357 dependent or it has either of the following forms
5360 and contains a nested-name-specifier which specifies a class-name that
5361 names a dependent type.
5363 We generalize this to just say that the address of a member of a
5364 dependent class is value-dependent; the above doesn't cover the
5365 address of a static data member named with an unqualified-id. */
5368 has_value_dependent_address (tree op
)
5370 /* We could use get_inner_reference here, but there's no need;
5371 this is only relevant for template non-type arguments, which
5372 can only be expressed as &id-expression. */
5375 tree ctx
= CP_DECL_CONTEXT (op
);
5376 if (TYPE_P (ctx
) && dependent_type_p (ctx
))
5383 /* The next set of functions are used for providing helpful explanatory
5384 diagnostics for failed overload resolution. Their messages should be
5385 indented by two spaces for consistency with the messages in
5389 unify_success (bool /*explain_p*/)
5395 unify_parameter_deduction_failure (bool explain_p
, tree parm
)
5398 inform (input_location
,
5399 " couldn't deduce template parameter %qD", parm
);
5404 unify_invalid (bool /*explain_p*/)
5410 unify_cv_qual_mismatch (bool explain_p
, tree parm
, tree arg
)
5413 inform (input_location
,
5414 " types %qT and %qT have incompatible cv-qualifiers",
5420 unify_type_mismatch (bool explain_p
, tree parm
, tree arg
)
5423 inform (input_location
, " mismatched types %qT and %qT", parm
, arg
);
5428 unify_parameter_pack_mismatch (bool explain_p
, tree parm
, tree arg
)
5431 inform (input_location
,
5432 " template parameter %qD is not a parameter pack, but "
5439 unify_ptrmem_cst_mismatch (bool explain_p
, tree parm
, tree arg
)
5442 inform (input_location
,
5443 " template argument %qE does not match "
5444 "pointer-to-member constant %qE",
5450 unify_expression_unequal (bool explain_p
, tree parm
, tree arg
)
5453 inform (input_location
, " %qE is not equivalent to %qE", parm
, arg
);
5458 unify_parameter_pack_inconsistent (bool explain_p
, tree old_arg
, tree new_arg
)
5461 inform (input_location
,
5462 " inconsistent parameter pack deduction with %qT and %qT",
5468 unify_inconsistency (bool explain_p
, tree parm
, tree first
, tree second
)
5473 inform (input_location
,
5474 " deduced conflicting types for parameter %qT (%qT and %qT)",
5475 parm
, first
, second
);
5477 inform (input_location
,
5478 " deduced conflicting values for non-type parameter "
5479 "%qE (%qE and %qE)", parm
, first
, second
);
5485 unify_vla_arg (bool explain_p
, tree arg
)
5488 inform (input_location
,
5489 " variable-sized array type %qT is not "
5490 "a valid template argument",
5496 unify_method_type_error (bool explain_p
, tree arg
)
5499 inform (input_location
,
5500 " member function type %qT is not a valid template argument",
5506 unify_arity (bool explain_p
, int have
, int wanted
)
5509 inform_n (input_location
, wanted
,
5510 " candidate expects %d argument, %d provided",
5511 " candidate expects %d arguments, %d provided",
5517 unify_too_many_arguments (bool explain_p
, int have
, int wanted
)
5519 return unify_arity (explain_p
, have
, wanted
);
5523 unify_too_few_arguments (bool explain_p
, int have
, int wanted
)
5525 return unify_arity (explain_p
, have
, wanted
);
5529 unify_arg_conversion (bool explain_p
, tree to_type
,
5530 tree from_type
, tree arg
)
5533 inform (EXPR_LOC_OR_LOC (arg
, input_location
),
5534 " cannot convert %qE (type %qT) to type %qT",
5535 arg
, from_type
, to_type
);
5540 unify_no_common_base (bool explain_p
, enum template_base_result r
,
5541 tree parm
, tree arg
)
5546 case tbr_ambiguous_baseclass
:
5547 inform (input_location
, " %qT is an ambiguous base class of %qT",
5551 inform (input_location
, " %qT is not derived from %qT", arg
, parm
);
5558 unify_inconsistent_template_template_parameters (bool explain_p
)
5561 inform (input_location
,
5562 " template parameters of a template template argument are "
5563 "inconsistent with other deduced template arguments");
5568 unify_template_deduction_failure (bool explain_p
, tree parm
, tree arg
)
5571 inform (input_location
,
5572 " can't deduce a template for %qT from non-template type %qT",
5578 unify_template_argument_mismatch (bool explain_p
, tree parm
, tree arg
)
5581 inform (input_location
,
5582 " template argument %qE does not match %qD", arg
, parm
);
5587 unify_overload_resolution_failure (bool explain_p
, tree arg
)
5590 inform (input_location
,
5591 " could not resolve address from overloaded function %qE",
5596 /* Attempt to convert the non-type template parameter EXPR to the
5597 indicated TYPE. If the conversion is successful, return the
5598 converted value. If the conversion is unsuccessful, return
5599 NULL_TREE if we issued an error message, or error_mark_node if we
5600 did not. We issue error messages for out-and-out bad template
5601 parameters, but not simply because the conversion failed, since we
5602 might be just trying to do argument deduction. Both TYPE and EXPR
5603 must be non-dependent.
5605 The conversion follows the special rules described in
5606 [temp.arg.nontype], and it is much more strict than an implicit
5609 This function is called twice for each template argument (see
5610 lookup_template_class for a more accurate description of this
5611 problem). This means that we need to handle expressions which
5612 are not valid in a C++ source, but can be created from the
5613 first call (for instance, casts to perform conversions). These
5614 hacks can go away after we fix the double coercion problem. */
5617 convert_nontype_argument (tree type
, tree expr
, tsubst_flags_t complain
)
5621 /* Detect immediately string literals as invalid non-type argument.
5622 This special-case is not needed for correctness (we would easily
5623 catch this later), but only to provide better diagnostic for this
5624 common user mistake. As suggested by DR 100, we do not mention
5625 linkage issues in the diagnostic as this is not the point. */
5626 /* FIXME we're making this OK. */
5627 if (TREE_CODE (expr
) == STRING_CST
)
5629 if (complain
& tf_error
)
5630 error ("%qE is not a valid template argument for type %qT "
5631 "because string literals can never be used in this context",
5636 /* Add the ADDR_EXPR now for the benefit of
5637 value_dependent_expression_p. */
5638 if (TYPE_PTROBV_P (type
)
5639 && TREE_CODE (TREE_TYPE (expr
)) == ARRAY_TYPE
)
5641 expr
= decay_conversion (expr
, complain
);
5642 if (expr
== error_mark_node
)
5643 return error_mark_node
;
5646 /* If we are in a template, EXPR may be non-dependent, but still
5647 have a syntactic, rather than semantic, form. For example, EXPR
5648 might be a SCOPE_REF, rather than the VAR_DECL to which the
5649 SCOPE_REF refers. Preserving the qualifying scope is necessary
5650 so that access checking can be performed when the template is
5651 instantiated -- but here we need the resolved form so that we can
5652 convert the argument. */
5653 if (TYPE_REF_OBJ_P (type
)
5654 && has_value_dependent_address (expr
))
5655 /* If we want the address and it's value-dependent, don't fold. */;
5656 else if (!type_unknown_p (expr
))
5657 expr
= fold_non_dependent_expr_sfinae (expr
, complain
);
5658 if (error_operand_p (expr
))
5659 return error_mark_node
;
5660 expr_type
= TREE_TYPE (expr
);
5661 if (TREE_CODE (type
) == REFERENCE_TYPE
)
5662 expr
= mark_lvalue_use (expr
);
5664 expr
= mark_rvalue_use (expr
);
5666 /* 14.3.2/5: The null pointer{,-to-member} conversion is applied
5667 to a non-type argument of "nullptr". */
5668 if (expr
== nullptr_node
&& TYPE_PTR_OR_PTRMEM_P (type
))
5669 expr
= convert (type
, expr
);
5671 /* In C++11, integral or enumeration non-type template arguments can be
5672 arbitrary constant expressions. Pointer and pointer to
5673 member arguments can be general constant expressions that evaluate
5674 to a null value, but otherwise still need to be of a specific form. */
5675 if (cxx_dialect
>= cxx11
)
5677 if (TREE_CODE (expr
) == PTRMEM_CST
)
5678 /* A PTRMEM_CST is already constant, and a valid template
5679 argument for a parameter of pointer to member type, we just want
5680 to leave it in that form rather than lower it to a
5682 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
5683 expr
= maybe_constant_value (expr
);
5684 else if (TYPE_PTR_OR_PTRMEM_P (type
))
5686 tree folded
= maybe_constant_value (expr
);
5687 if (TYPE_PTR_P (type
) ? integer_zerop (folded
)
5688 : null_member_pointer_value_p (folded
))
5693 /* HACK: Due to double coercion, we can get a
5694 NOP_EXPR<REFERENCE_TYPE>(ADDR_EXPR<POINTER_TYPE> (arg)) here,
5695 which is the tree that we built on the first call (see
5696 below when coercing to reference to object or to reference to
5697 function). We just strip everything and get to the arg.
5698 See g++.old-deja/g++.oliva/template4.C and g++.dg/template/nontype9.C
5700 if (TYPE_REF_OBJ_P (type
) || TYPE_REFFN_P (type
))
5702 tree probe_type
, probe
= expr
;
5703 if (REFERENCE_REF_P (probe
))
5704 probe
= TREE_OPERAND (probe
, 0);
5705 probe_type
= TREE_TYPE (probe
);
5706 if (TREE_CODE (probe
) == NOP_EXPR
)
5708 /* ??? Maybe we could use convert_from_reference here, but we
5709 would need to relax its constraints because the NOP_EXPR
5710 could actually change the type to something more cv-qualified,
5711 and this is not folded by convert_from_reference. */
5712 tree addr
= TREE_OPERAND (probe
, 0);
5713 if (TREE_CODE (probe_type
) == REFERENCE_TYPE
5714 && TREE_CODE (addr
) == ADDR_EXPR
5715 && TYPE_PTR_P (TREE_TYPE (addr
))
5716 && (same_type_ignoring_top_level_qualifiers_p
5717 (TREE_TYPE (probe_type
),
5718 TREE_TYPE (TREE_TYPE (addr
)))))
5720 expr
= TREE_OPERAND (addr
, 0);
5721 expr_type
= TREE_TYPE (probe_type
);
5726 /* We could also generate a NOP_EXPR(ADDR_EXPR()) when the
5727 parameter is a pointer to object, through decay and
5728 qualification conversion. Let's strip everything. */
5729 else if (TREE_CODE (expr
) == NOP_EXPR
&& TYPE_PTROBV_P (type
))
5733 if (TREE_CODE (probe
) == ADDR_EXPR
5734 && TYPE_PTR_P (TREE_TYPE (probe
)))
5736 /* Skip the ADDR_EXPR only if it is part of the decay for
5737 an array. Otherwise, it is part of the original argument
5738 in the source code. */
5739 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (probe
, 0))) == ARRAY_TYPE
)
5740 probe
= TREE_OPERAND (probe
, 0);
5742 expr_type
= TREE_TYPE (expr
);
5746 /* [temp.arg.nontype]/5, bullet 1
5748 For a non-type template-parameter of integral or enumeration type,
5749 integral promotions (_conv.prom_) and integral conversions
5750 (_conv.integral_) are applied. */
5751 if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
5753 tree t
= build_integral_nontype_arg_conv (type
, expr
, complain
);
5754 t
= maybe_constant_value (t
);
5755 if (t
!= error_mark_node
)
5758 if (!same_type_ignoring_top_level_qualifiers_p (type
, TREE_TYPE (expr
)))
5759 return error_mark_node
;
5761 /* Notice that there are constant expressions like '4 % 0' which
5762 do not fold into integer constants. */
5763 if (TREE_CODE (expr
) != INTEGER_CST
)
5765 if (complain
& tf_error
)
5767 int errs
= errorcount
, warns
= warningcount
+ werrorcount
;
5768 if (processing_template_decl
5769 && !require_potential_constant_expression (expr
))
5771 expr
= cxx_constant_value (expr
);
5772 if (errorcount
> errs
|| warningcount
+ werrorcount
> warns
)
5773 inform (EXPR_LOC_OR_LOC (expr
, input_location
),
5774 "in template argument for type %qT ", type
);
5775 if (expr
== error_mark_node
)
5777 /* else cxx_constant_value complained but gave us
5778 a real constant, so go ahead. */
5779 gcc_assert (TREE_CODE (expr
) == INTEGER_CST
);
5785 /* Avoid typedef problems. */
5786 if (TREE_TYPE (expr
) != type
)
5787 expr
= fold_convert (type
, expr
);
5789 /* [temp.arg.nontype]/5, bullet 2
5791 For a non-type template-parameter of type pointer to object,
5792 qualification conversions (_conv.qual_) and the array-to-pointer
5793 conversion (_conv.array_) are applied. */
5794 else if (TYPE_PTROBV_P (type
))
5796 /* [temp.arg.nontype]/1 (TC1 version, DR 49):
5798 A template-argument for a non-type, non-template template-parameter
5799 shall be one of: [...]
5801 -- the name of a non-type template-parameter;
5802 -- the address of an object or function with external linkage, [...]
5803 expressed as "& id-expression" where the & is optional if the name
5804 refers to a function or array, or if the corresponding
5805 template-parameter is a reference.
5807 Here, we do not care about functions, as they are invalid anyway
5808 for a parameter of type pointer-to-object. */
5810 if (DECL_P (expr
) && DECL_TEMPLATE_PARM_P (expr
))
5811 /* Non-type template parameters are OK. */
5813 else if (cxx_dialect
>= cxx11
&& integer_zerop (expr
))
5814 /* Null pointer values are OK in C++11. */;
5815 else if (TREE_CODE (expr
) != ADDR_EXPR
5816 && TREE_CODE (expr_type
) != ARRAY_TYPE
)
5820 error ("%qD is not a valid template argument "
5821 "because %qD is a variable, not the address of "
5826 if (POINTER_TYPE_P (expr_type
))
5828 error ("%qE is not a valid template argument for %qT "
5829 "because it is not the address of a variable",
5833 /* Other values, like integer constants, might be valid
5834 non-type arguments of some other type. */
5835 return error_mark_node
;
5841 decl
= ((TREE_CODE (expr
) == ADDR_EXPR
)
5842 ? TREE_OPERAND (expr
, 0) : expr
);
5845 error ("%qE is not a valid template argument of type %qT "
5846 "because %qE is not a variable",
5850 else if (cxx_dialect
< cxx11
&& !DECL_EXTERNAL_LINKAGE_P (decl
))
5852 error ("%qE is not a valid template argument of type %qT "
5853 "because %qD does not have external linkage",
5857 else if (cxx_dialect
>= cxx11
&& decl_linkage (decl
) == lk_none
)
5859 error ("%qE is not a valid template argument of type %qT "
5860 "because %qD has no linkage",
5866 expr
= decay_conversion (expr
, complain
);
5867 if (expr
== error_mark_node
)
5868 return error_mark_node
;
5870 expr
= perform_qualification_conversions (type
, expr
);
5871 if (expr
== error_mark_node
)
5872 return error_mark_node
;
5874 /* [temp.arg.nontype]/5, bullet 3
5876 For a non-type template-parameter of type reference to object, no
5877 conversions apply. The type referred to by the reference may be more
5878 cv-qualified than the (otherwise identical) type of the
5879 template-argument. The template-parameter is bound directly to the
5880 template-argument, which must be an lvalue. */
5881 else if (TYPE_REF_OBJ_P (type
))
5883 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type
),
5885 return error_mark_node
;
5887 if (!at_least_as_qualified_p (TREE_TYPE (type
), expr_type
))
5889 error ("%qE is not a valid template argument for type %qT "
5890 "because of conflicts in cv-qualification", expr
, type
);
5894 if (!real_lvalue_p (expr
))
5896 error ("%qE is not a valid template argument for type %qT "
5897 "because it is not an lvalue", expr
, type
);
5901 /* [temp.arg.nontype]/1
5903 A template-argument for a non-type, non-template template-parameter
5904 shall be one of: [...]
5906 -- the address of an object or function with external linkage. */
5907 if (INDIRECT_REF_P (expr
)
5908 && TYPE_REF_OBJ_P (TREE_TYPE (TREE_OPERAND (expr
, 0))))
5910 expr
= TREE_OPERAND (expr
, 0);
5913 error ("%q#D is not a valid template argument for type %qT "
5914 "because a reference variable does not have a constant "
5915 "address", expr
, type
);
5922 error ("%qE is not a valid template argument for type %qT "
5923 "because it is not an object with external linkage",
5928 if (!DECL_EXTERNAL_LINKAGE_P (expr
))
5930 error ("%qE is not a valid template argument for type %qT "
5931 "because object %qD has not external linkage",
5936 expr
= build_nop (type
, build_address (expr
));
5938 /* [temp.arg.nontype]/5, bullet 4
5940 For a non-type template-parameter of type pointer to function, only
5941 the function-to-pointer conversion (_conv.func_) is applied. If the
5942 template-argument represents a set of overloaded functions (or a
5943 pointer to such), the matching function is selected from the set
5945 else if (TYPE_PTRFN_P (type
))
5947 /* If the argument is a template-id, we might not have enough
5948 context information to decay the pointer. */
5949 if (!type_unknown_p (expr_type
))
5951 expr
= decay_conversion (expr
, complain
);
5952 if (expr
== error_mark_node
)
5953 return error_mark_node
;
5956 if (cxx_dialect
>= cxx11
&& integer_zerop (expr
))
5957 /* Null pointer values are OK in C++11. */
5958 return perform_qualification_conversions (type
, expr
);
5960 expr
= convert_nontype_argument_function (type
, expr
);
5961 if (!expr
|| expr
== error_mark_node
)
5964 /* [temp.arg.nontype]/5, bullet 5
5966 For a non-type template-parameter of type reference to function, no
5967 conversions apply. If the template-argument represents a set of
5968 overloaded functions, the matching function is selected from the set
5970 else if (TYPE_REFFN_P (type
))
5972 if (TREE_CODE (expr
) == ADDR_EXPR
)
5974 error ("%qE is not a valid template argument for type %qT "
5975 "because it is a pointer", expr
, type
);
5976 inform (input_location
, "try using %qE instead", TREE_OPERAND (expr
, 0));
5980 expr
= convert_nontype_argument_function (type
, expr
);
5981 if (!expr
|| expr
== error_mark_node
)
5984 expr
= build_nop (type
, build_address (expr
));
5986 /* [temp.arg.nontype]/5, bullet 6
5988 For a non-type template-parameter of type pointer to member function,
5989 no conversions apply. If the template-argument represents a set of
5990 overloaded member functions, the matching member function is selected
5991 from the set (_over.over_). */
5992 else if (TYPE_PTRMEMFUNC_P (type
))
5994 expr
= instantiate_type (type
, expr
, tf_none
);
5995 if (expr
== error_mark_node
)
5996 return error_mark_node
;
5998 /* [temp.arg.nontype] bullet 1 says the pointer to member
5999 expression must be a pointer-to-member constant. */
6000 if (!check_valid_ptrmem_cst_expr (type
, expr
, complain
))
6001 return error_mark_node
;
6003 /* There is no way to disable standard conversions in
6004 resolve_address_of_overloaded_function (called by
6005 instantiate_type). It is possible that the call succeeded by
6006 converting &B::I to &D::I (where B is a base of D), so we need
6007 to reject this conversion here.
6009 Actually, even if there was a way to disable standard conversions,
6010 it would still be better to reject them here so that we can
6011 provide a superior diagnostic. */
6012 if (!same_type_p (TREE_TYPE (expr
), type
))
6014 error ("%qE is not a valid template argument for type %qT "
6015 "because it is of type %qT", expr
, type
,
6017 /* If we are just one standard conversion off, explain. */
6018 if (can_convert_standard (type
, TREE_TYPE (expr
), complain
))
6019 inform (input_location
,
6020 "standard conversions are not allowed in this context");
6024 /* [temp.arg.nontype]/5, bullet 7
6026 For a non-type template-parameter of type pointer to data member,
6027 qualification conversions (_conv.qual_) are applied. */
6028 else if (TYPE_PTRDATAMEM_P (type
))
6030 /* [temp.arg.nontype] bullet 1 says the pointer to member
6031 expression must be a pointer-to-member constant. */
6032 if (!check_valid_ptrmem_cst_expr (type
, expr
, complain
))
6033 return error_mark_node
;
6035 expr
= perform_qualification_conversions (type
, expr
);
6036 if (expr
== error_mark_node
)
6039 else if (NULLPTR_TYPE_P (type
))
6041 if (expr
!= nullptr_node
)
6043 error ("%qE is not a valid template argument for type %qT "
6044 "because it is of type %qT", expr
, type
, TREE_TYPE (expr
));
6049 /* A template non-type parameter must be one of the above. */
6053 /* Sanity check: did we actually convert the argument to the
6055 gcc_assert (same_type_ignoring_top_level_qualifiers_p
6056 (type
, TREE_TYPE (expr
)));
6060 /* Subroutine of coerce_template_template_parms, which returns 1 if
6061 PARM_PARM and ARG_PARM match using the rule for the template
6062 parameters of template template parameters. Both PARM and ARG are
6063 template parameters; the rest of the arguments are the same as for
6064 coerce_template_template_parms.
6067 coerce_template_template_parm (tree parm
,
6069 tsubst_flags_t complain
,
6073 if (arg
== NULL_TREE
|| error_operand_p (arg
)
6074 || parm
== NULL_TREE
|| error_operand_p (parm
))
6077 if (TREE_CODE (arg
) != TREE_CODE (parm
))
6080 switch (TREE_CODE (parm
))
6083 /* We encounter instantiations of templates like
6084 template <template <template <class> class> class TT>
6087 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
6088 tree argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
6090 if (!coerce_template_template_parms
6091 (parmparm
, argparm
, complain
, in_decl
, outer_args
))
6097 if (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (arg
))
6098 && !TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
)))
6099 /* Argument is a parameter pack but parameter is not. */
6104 /* The tsubst call is used to handle cases such as
6106 template <int> class C {};
6107 template <class T, template <T> class TT> class D {};
6110 i.e. the parameter list of TT depends on earlier parameters. */
6111 if (!uses_template_parms (TREE_TYPE (arg
))
6113 (tsubst (TREE_TYPE (parm
), outer_args
, complain
, in_decl
),
6117 if (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (arg
))
6118 && !TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))
6119 /* Argument is a parameter pack but parameter is not. */
6132 /* Return 1 if PARM_PARMS and ARG_PARMS matches using rule for
6133 template template parameters. Both PARM_PARMS and ARG_PARMS are
6134 vectors of TREE_LIST nodes containing TYPE_DECL, TEMPLATE_DECL
6137 Consider the example:
6138 template <class T> class A;
6139 template<template <class U> class TT> class B;
6141 For B<A>, PARM_PARMS are the parameters to TT, while ARG_PARMS are
6142 the parameters to A, and OUTER_ARGS contains A. */
6145 coerce_template_template_parms (tree parm_parms
,
6147 tsubst_flags_t complain
,
6151 int nparms
, nargs
, i
;
6155 gcc_assert (TREE_CODE (parm_parms
) == TREE_VEC
);
6156 gcc_assert (TREE_CODE (arg_parms
) == TREE_VEC
);
6158 nparms
= TREE_VEC_LENGTH (parm_parms
);
6159 nargs
= TREE_VEC_LENGTH (arg_parms
);
6161 /* Determine whether we have a parameter pack at the end of the
6162 template template parameter's template parameter list. */
6163 if (TREE_VEC_ELT (parm_parms
, nparms
- 1) != error_mark_node
)
6165 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, nparms
- 1));
6167 if (error_operand_p (parm
))
6170 switch (TREE_CODE (parm
))
6174 if (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
)))
6179 if (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))
6189 && !(variadic_p
&& nargs
>= nparms
- 1))
6192 /* Check all of the template parameters except the parameter pack at
6193 the end (if any). */
6194 for (i
= 0; i
< nparms
- variadic_p
; ++i
)
6196 if (TREE_VEC_ELT (parm_parms
, i
) == error_mark_node
6197 || TREE_VEC_ELT (arg_parms
, i
) == error_mark_node
)
6200 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
6201 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
6203 if (!coerce_template_template_parm (parm
, arg
, complain
, in_decl
,
6211 /* Check each of the template parameters in the template
6212 argument against the template parameter pack at the end of
6213 the template template parameter. */
6214 if (TREE_VEC_ELT (parm_parms
, i
) == error_mark_node
)
6217 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
6219 for (; i
< nargs
; ++i
)
6221 if (TREE_VEC_ELT (arg_parms
, i
) == error_mark_node
)
6224 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
6226 if (!coerce_template_template_parm (parm
, arg
, complain
, in_decl
,
6235 /* Verifies that the deduced template arguments (in TARGS) for the
6236 template template parameters (in TPARMS) represent valid bindings,
6237 by comparing the template parameter list of each template argument
6238 to the template parameter list of its corresponding template
6239 template parameter, in accordance with DR150. This
6240 routine can only be called after all template arguments have been
6241 deduced. It will return TRUE if all of the template template
6242 parameter bindings are okay, FALSE otherwise. */
6244 template_template_parm_bindings_ok_p (tree tparms
, tree targs
)
6246 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
6249 /* We're dealing with template parms in this process. */
6250 ++processing_template_decl
;
6252 targs
= INNERMOST_TEMPLATE_ARGS (targs
);
6254 for (i
= 0; i
< ntparms
; ++i
)
6256 tree tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
6257 tree targ
= TREE_VEC_ELT (targs
, i
);
6259 if (TREE_CODE (tparm
) == TEMPLATE_DECL
&& targ
)
6261 tree packed_args
= NULL_TREE
;
6264 if (ARGUMENT_PACK_P (targ
))
6266 /* Look inside the argument pack. */
6267 packed_args
= ARGUMENT_PACK_ARGS (targ
);
6268 len
= TREE_VEC_LENGTH (packed_args
);
6271 for (idx
= 0; idx
< len
; ++idx
)
6273 tree targ_parms
= NULL_TREE
;
6276 /* Extract the next argument from the argument
6278 targ
= TREE_VEC_ELT (packed_args
, idx
);
6280 if (PACK_EXPANSION_P (targ
))
6281 /* Look at the pattern of the pack expansion. */
6282 targ
= PACK_EXPANSION_PATTERN (targ
);
6284 /* Extract the template parameters from the template
6286 if (TREE_CODE (targ
) == TEMPLATE_DECL
)
6287 targ_parms
= DECL_INNERMOST_TEMPLATE_PARMS (targ
);
6288 else if (TREE_CODE (targ
) == TEMPLATE_TEMPLATE_PARM
)
6289 targ_parms
= DECL_INNERMOST_TEMPLATE_PARMS (TYPE_NAME (targ
));
6291 /* Verify that we can coerce the template template
6292 parameters from the template argument to the template
6293 parameter. This requires an exact match. */
6295 && !coerce_template_template_parms
6296 (DECL_INNERMOST_TEMPLATE_PARMS (tparm
),
6311 --processing_template_decl
;
6315 /* Since type attributes aren't mangled, we need to strip them from
6316 template type arguments. */
6319 canonicalize_type_argument (tree arg
, tsubst_flags_t complain
)
6322 if (!arg
|| arg
== error_mark_node
|| arg
== TYPE_CANONICAL (arg
))
6324 mv
= TYPE_MAIN_VARIANT (arg
);
6325 arg
= strip_typedefs (arg
);
6326 if (TYPE_ALIGN (arg
) != TYPE_ALIGN (mv
)
6327 || TYPE_ATTRIBUTES (arg
) != TYPE_ATTRIBUTES (mv
))
6329 if (complain
& tf_warning
)
6330 warning (0, "ignoring attributes on template argument %qT", arg
);
6331 arg
= build_aligned_type (arg
, TYPE_ALIGN (mv
));
6332 arg
= cp_build_type_attribute_variant (arg
, TYPE_ATTRIBUTES (mv
));
6337 /* Convert the indicated template ARG as necessary to match the
6338 indicated template PARM. Returns the converted ARG, or
6339 error_mark_node if the conversion was unsuccessful. Error and
6340 warning messages are issued under control of COMPLAIN. This
6341 conversion is for the Ith parameter in the parameter list. ARGS is
6342 the full set of template arguments deduced so far. */
6345 convert_template_argument (tree parm
,
6348 tsubst_flags_t complain
,
6354 int is_type
, requires_type
, is_tmpl_type
, requires_tmpl_type
;
6356 if (TREE_CODE (arg
) == TREE_LIST
6357 && TREE_CODE (TREE_VALUE (arg
)) == OFFSET_REF
)
6359 /* The template argument was the name of some
6360 member function. That's usually
6361 invalid, but static members are OK. In any
6362 case, grab the underlying fields/functions
6363 and issue an error later if required. */
6364 orig_arg
= TREE_VALUE (arg
);
6365 TREE_TYPE (arg
) = unknown_type_node
;
6370 requires_tmpl_type
= TREE_CODE (parm
) == TEMPLATE_DECL
;
6371 requires_type
= (TREE_CODE (parm
) == TYPE_DECL
6372 || requires_tmpl_type
);
6374 /* When determining whether an argument pack expansion is a template,
6375 look at the pattern. */
6376 if (TREE_CODE (arg
) == TYPE_PACK_EXPANSION
)
6377 arg
= PACK_EXPANSION_PATTERN (arg
);
6379 /* Deal with an injected-class-name used as a template template arg. */
6380 if (requires_tmpl_type
&& CLASS_TYPE_P (arg
))
6382 tree t
= maybe_get_template_decl_from_type_decl (TYPE_NAME (arg
));
6383 if (TREE_CODE (t
) == TEMPLATE_DECL
)
6385 if (cxx_dialect
>= cxx11
)
6386 /* OK under DR 1004. */;
6387 else if (complain
& tf_warning_or_error
)
6388 pedwarn (input_location
, OPT_Wpedantic
, "injected-class-name %qD"
6389 " used as template template argument", TYPE_NAME (arg
));
6390 else if (flag_pedantic_errors
)
6398 ((TREE_CODE (arg
) == TEMPLATE_DECL
6399 && TREE_CODE (DECL_TEMPLATE_RESULT (arg
)) == TYPE_DECL
)
6400 || (requires_tmpl_type
&& TREE_CODE (arg
) == TYPE_ARGUMENT_PACK
)
6401 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
6402 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
);
6405 && (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
6406 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
))
6407 arg
= TYPE_STUB_DECL (arg
);
6409 is_type
= TYPE_P (arg
) || is_tmpl_type
;
6411 if (requires_type
&& ! is_type
&& TREE_CODE (arg
) == SCOPE_REF
6412 && TREE_CODE (TREE_OPERAND (arg
, 0)) == TEMPLATE_TYPE_PARM
)
6414 if (TREE_CODE (TREE_OPERAND (arg
, 1)) == BIT_NOT_EXPR
)
6416 if (complain
& tf_error
)
6417 error ("invalid use of destructor %qE as a type", orig_arg
);
6418 return error_mark_node
;
6421 permerror (input_location
,
6422 "to refer to a type member of a template parameter, "
6423 "use %<typename %E%>", orig_arg
);
6425 orig_arg
= make_typename_type (TREE_OPERAND (arg
, 0),
6426 TREE_OPERAND (arg
, 1),
6432 if (is_type
!= requires_type
)
6436 if (complain
& tf_error
)
6438 error ("type/value mismatch at argument %d in template "
6439 "parameter list for %qD",
6442 error (" expected a constant of type %qT, got %qT",
6444 (DECL_P (arg
) ? DECL_NAME (arg
) : orig_arg
));
6445 else if (requires_tmpl_type
)
6446 error (" expected a class template, got %qE", orig_arg
);
6448 error (" expected a type, got %qE", orig_arg
);
6451 return error_mark_node
;
6453 if (is_tmpl_type
^ requires_tmpl_type
)
6455 if (in_decl
&& (complain
& tf_error
))
6457 error ("type/value mismatch at argument %d in template "
6458 "parameter list for %qD",
6461 error (" expected a type, got %qT", DECL_NAME (arg
));
6463 error (" expected a class template, got %qT", orig_arg
);
6465 return error_mark_node
;
6470 if (requires_tmpl_type
)
6472 if (template_parameter_pack_p (parm
) && ARGUMENT_PACK_P (orig_arg
))
6474 else if (TREE_CODE (TREE_TYPE (arg
)) == UNBOUND_CLASS_TEMPLATE
)
6475 /* The number of argument required is not known yet.
6476 Just accept it for now. */
6477 val
= TREE_TYPE (arg
);
6480 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
6483 /* Strip alias templates that are equivalent to another
6485 arg
= get_underlying_template (arg
);
6486 argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
6488 if (coerce_template_template_parms (parmparm
, argparm
,
6494 /* TEMPLATE_TEMPLATE_PARM node is preferred over
6496 if (val
!= error_mark_node
)
6498 if (DECL_TEMPLATE_TEMPLATE_PARM_P (val
))
6499 val
= TREE_TYPE (val
);
6500 if (TREE_CODE (orig_arg
) == TYPE_PACK_EXPANSION
)
6501 val
= make_pack_expansion (val
);
6506 if (in_decl
&& (complain
& tf_error
))
6508 error ("type/value mismatch at argument %d in "
6509 "template parameter list for %qD",
6511 error (" expected a template of type %qD, got %qT",
6515 val
= error_mark_node
;
6521 /* We only form one instance of each template specialization.
6522 Therefore, if we use a non-canonical variant (i.e., a
6523 typedef), any future messages referring to the type will use
6524 the typedef, which is confusing if those future uses do not
6525 themselves also use the typedef. */
6527 val
= canonicalize_type_argument (val
, complain
);
6531 tree t
= tsubst (TREE_TYPE (parm
), args
, complain
, in_decl
);
6533 if (invalid_nontype_parm_type_p (t
, complain
))
6534 return error_mark_node
;
6536 if (template_parameter_pack_p (parm
) && ARGUMENT_PACK_P (orig_arg
))
6538 if (same_type_p (t
, TREE_TYPE (orig_arg
)))
6542 /* Not sure if this is reachable, but it doesn't hurt
6544 error ("type mismatch in nontype parameter pack");
6545 val
= error_mark_node
;
6548 else if (!dependent_template_arg_p (orig_arg
)
6549 && !uses_template_parms (t
))
6550 /* We used to call digest_init here. However, digest_init
6551 will report errors, which we don't want when complain
6552 is zero. More importantly, digest_init will try too
6553 hard to convert things: for example, `0' should not be
6554 converted to pointer type at this point according to
6555 the standard. Accepting this is not merely an
6556 extension, since deciding whether or not these
6557 conversions can occur is part of determining which
6558 function template to call, or whether a given explicit
6559 argument specification is valid. */
6560 val
= convert_nontype_argument (t
, orig_arg
, complain
);
6562 val
= strip_typedefs_expr (orig_arg
);
6564 if (val
== NULL_TREE
)
6565 val
= error_mark_node
;
6566 else if (val
== error_mark_node
&& (complain
& tf_error
))
6567 error ("could not convert template argument %qE to %qT", orig_arg
, t
);
6569 if (TREE_CODE (val
) == SCOPE_REF
)
6571 /* Strip typedefs from the SCOPE_REF. */
6572 tree type
= canonicalize_type_argument (TREE_TYPE (val
), complain
);
6573 tree scope
= canonicalize_type_argument (TREE_OPERAND (val
, 0),
6575 val
= build_qualified_name (type
, scope
, TREE_OPERAND (val
, 1),
6576 QUALIFIED_NAME_IS_TEMPLATE (val
));
6583 /* Coerces the remaining template arguments in INNER_ARGS (from
6584 ARG_IDX to the end) into the parameter pack at PARM_IDX in PARMS.
6585 Returns the coerced argument pack. PARM_IDX is the position of this
6586 parameter in the template parameter list. ARGS is the original
6587 template argument list. */
6589 coerce_template_parameter_pack (tree parms
,
6597 tsubst_flags_t complain
)
6599 tree parm
= TREE_VEC_ELT (parms
, parm_idx
);
6600 int nargs
= inner_args
? NUM_TMPL_ARGS (inner_args
) : 0;
6603 tree packed_parms
= NULL_TREE
;
6605 if (arg_idx
> nargs
)
6608 if (tree packs
= fixed_parameter_pack_p (TREE_VALUE (parm
)))
6610 /* When the template parameter is a non-type template parameter pack
6611 or template template parameter pack whose type or template
6612 parameters use parameter packs, we know exactly how many arguments
6613 we are looking for. Build a vector of the instantiated decls for
6614 these template parameters in PACKED_PARMS. */
6615 /* We can't use make_pack_expansion here because it would interpret a
6616 _DECL as a use rather than a declaration. */
6617 tree decl
= TREE_VALUE (parm
);
6618 tree exp
= cxx_make_type (TYPE_PACK_EXPANSION
);
6619 SET_PACK_EXPANSION_PATTERN (exp
, decl
);
6620 PACK_EXPANSION_PARAMETER_PACKS (exp
) = packs
;
6621 SET_TYPE_STRUCTURAL_EQUALITY (exp
);
6623 TREE_VEC_LENGTH (args
)--;
6624 packed_parms
= tsubst_pack_expansion (exp
, args
, complain
, decl
);
6625 TREE_VEC_LENGTH (args
)++;
6627 if (packed_parms
== error_mark_node
)
6628 return error_mark_node
;
6630 /* If we're doing a partial instantiation of a member template,
6631 verify that all of the types used for the non-type
6632 template parameter pack are, in fact, valid for non-type
6633 template parameters. */
6635 && PACK_EXPANSION_P (TREE_VEC_ELT (inner_args
, arg_idx
)))
6637 int j
, len
= TREE_VEC_LENGTH (packed_parms
);
6638 for (j
= 0; j
< len
; ++j
)
6640 tree t
= TREE_TYPE (TREE_VEC_ELT (packed_parms
, j
));
6641 if (invalid_nontype_parm_type_p (t
, complain
))
6642 return error_mark_node
;
6646 packed_args
= make_tree_vec (TREE_VEC_LENGTH (packed_parms
));
6649 packed_args
= make_tree_vec (nargs
- arg_idx
);
6651 /* Convert the remaining arguments, which will be a part of the
6652 parameter pack "parm". */
6653 for (; arg_idx
< nargs
; ++arg_idx
)
6655 tree arg
= TREE_VEC_ELT (inner_args
, arg_idx
);
6656 tree actual_parm
= TREE_VALUE (parm
);
6657 int pack_idx
= arg_idx
- parm_idx
;
6661 /* Once we've packed as many args as we have types, stop. */
6662 if (pack_idx
>= TREE_VEC_LENGTH (packed_parms
))
6664 else if (PACK_EXPANSION_P (arg
))
6665 /* We don't know how many args we have yet, just
6666 use the unconverted ones for now. */
6669 actual_parm
= TREE_VEC_ELT (packed_parms
, pack_idx
);
6672 if (arg
== error_mark_node
)
6674 if (complain
& tf_error
)
6675 error ("template argument %d is invalid", arg_idx
+ 1);
6678 arg
= convert_template_argument (actual_parm
,
6679 arg
, new_args
, complain
, parm_idx
,
6681 if (arg
== error_mark_node
)
6683 TREE_VEC_ELT (packed_args
, pack_idx
) = arg
;
6686 if (arg_idx
- parm_idx
< TREE_VEC_LENGTH (packed_args
)
6687 && TREE_VEC_LENGTH (packed_args
) > 0)
6689 error ("wrong number of template arguments (%d, should be %d)",
6690 arg_idx
- parm_idx
, TREE_VEC_LENGTH (packed_args
));
6691 return error_mark_node
;
6694 if (TREE_CODE (TREE_VALUE (parm
)) == TYPE_DECL
6695 || TREE_CODE (TREE_VALUE (parm
)) == TEMPLATE_DECL
)
6696 argument_pack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
6699 argument_pack
= make_node (NONTYPE_ARGUMENT_PACK
);
6700 TREE_TYPE (argument_pack
)
6701 = tsubst (TREE_TYPE (TREE_VALUE (parm
)), new_args
, complain
, in_decl
);
6702 TREE_CONSTANT (argument_pack
) = 1;
6705 SET_ARGUMENT_PACK_ARGS (argument_pack
, packed_args
);
6706 #ifdef ENABLE_CHECKING
6707 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (packed_args
,
6708 TREE_VEC_LENGTH (packed_args
));
6710 return argument_pack
;
6713 /* Returns the number of pack expansions in the template argument vector
6717 pack_expansion_args_count (tree args
)
6722 for (i
= 0; i
< TREE_VEC_LENGTH (args
); ++i
)
6724 tree elt
= TREE_VEC_ELT (args
, i
);
6725 if (elt
&& PACK_EXPANSION_P (elt
))
6731 /* Convert all template arguments to their appropriate types, and
6732 return a vector containing the innermost resulting template
6733 arguments. If any error occurs, return error_mark_node. Error and
6734 warning messages are issued under control of COMPLAIN.
6736 If REQUIRE_ALL_ARGS is false, argument deduction will be performed
6737 for arguments not specified in ARGS. Otherwise, if
6738 USE_DEFAULT_ARGS is true, default arguments will be used to fill in
6739 unspecified arguments. If REQUIRE_ALL_ARGS is true, but
6740 USE_DEFAULT_ARGS is false, then all arguments must be specified in
6744 coerce_template_parms (tree parms
,
6747 tsubst_flags_t complain
,
6748 bool require_all_args
,
6749 bool use_default_args
)
6751 int nparms
, nargs
, parm_idx
, arg_idx
, lost
= 0;
6752 tree orig_inner_args
;
6755 tree new_inner_args
;
6756 int saved_unevaluated_operand
;
6757 int saved_inhibit_evaluation_warnings
;
6759 /* When used as a boolean value, indicates whether this is a
6760 variadic template parameter list. Since it's an int, we can also
6761 subtract it from nparms to get the number of non-variadic
6764 int variadic_args_p
= 0;
6765 int post_variadic_parms
= 0;
6767 if (args
== error_mark_node
)
6768 return error_mark_node
;
6770 nparms
= TREE_VEC_LENGTH (parms
);
6772 /* Determine if there are any parameter packs. */
6773 for (parm_idx
= 0; parm_idx
< nparms
; ++parm_idx
)
6775 tree tparm
= TREE_VALUE (TREE_VEC_ELT (parms
, parm_idx
));
6777 ++post_variadic_parms
;
6778 if (template_parameter_pack_p (tparm
))
6782 inner_args
= orig_inner_args
= INNERMOST_TEMPLATE_ARGS (args
);
6783 /* If there are no parameters that follow a parameter pack, we need to
6784 expand any argument packs so that we can deduce a parameter pack from
6785 some non-packed args followed by an argument pack, as in variadic85.C.
6786 If there are such parameters, we need to leave argument packs intact
6787 so the arguments are assigned properly. This can happen when dealing
6788 with a nested class inside a partial specialization of a class
6789 template, as in variadic92.C, or when deducing a template parameter pack
6790 from a sub-declarator, as in variadic114.C. */
6791 if (!post_variadic_parms
)
6792 inner_args
= expand_template_argument_pack (inner_args
);
6794 /* Count any pack expansion args. */
6795 variadic_args_p
= pack_expansion_args_count (inner_args
);
6797 nargs
= inner_args
? NUM_TMPL_ARGS (inner_args
) : 0;
6798 if ((nargs
> nparms
&& !variadic_p
)
6799 || (nargs
< nparms
- variadic_p
6802 && (!use_default_args
6803 || (TREE_VEC_ELT (parms
, nargs
) != error_mark_node
6804 && !TREE_PURPOSE (TREE_VEC_ELT (parms
, nargs
))))))
6806 if (complain
& tf_error
)
6810 nparms
-= variadic_p
;
6811 error ("wrong number of template arguments "
6812 "(%d, should be %d or more)", nargs
, nparms
);
6815 error ("wrong number of template arguments "
6816 "(%d, should be %d)", nargs
, nparms
);
6819 error ("provided for %q+D", in_decl
);
6822 return error_mark_node
;
6824 /* We can't pass a pack expansion to a non-pack parameter of an alias
6825 template (DR 1430). */
6826 else if (in_decl
&& DECL_ALIAS_TEMPLATE_P (in_decl
)
6828 && nargs
- variadic_args_p
< nparms
- variadic_p
)
6830 if (complain
& tf_error
)
6832 for (int i
= 0; i
< TREE_VEC_LENGTH (inner_args
); ++i
)
6834 tree arg
= TREE_VEC_ELT (inner_args
, i
);
6835 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
6837 if (PACK_EXPANSION_P (arg
)
6838 && !template_parameter_pack_p (parm
))
6840 error ("pack expansion argument for non-pack parameter "
6841 "%qD of alias template %qD", parm
, in_decl
);
6842 inform (DECL_SOURCE_LOCATION (parm
), "declared here");
6849 return error_mark_node
;
6852 /* We need to evaluate the template arguments, even though this
6853 template-id may be nested within a "sizeof". */
6854 saved_unevaluated_operand
= cp_unevaluated_operand
;
6855 cp_unevaluated_operand
= 0;
6856 saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
6857 c_inhibit_evaluation_warnings
= 0;
6858 new_inner_args
= make_tree_vec (nparms
);
6859 new_args
= add_outermost_template_args (args
, new_inner_args
);
6860 int pack_adjust
= 0;
6861 for (parm_idx
= 0, arg_idx
= 0; parm_idx
< nparms
; parm_idx
++, arg_idx
++)
6866 /* Get the Ith template parameter. */
6867 parm
= TREE_VEC_ELT (parms
, parm_idx
);
6869 if (parm
== error_mark_node
)
6871 TREE_VEC_ELT (new_inner_args
, arg_idx
) = error_mark_node
;
6875 /* Calculate the next argument. */
6876 if (arg_idx
< nargs
)
6877 arg
= TREE_VEC_ELT (inner_args
, arg_idx
);
6881 if (template_parameter_pack_p (TREE_VALUE (parm
))
6882 && !(arg
&& ARGUMENT_PACK_P (arg
)))
6884 /* Some arguments will be placed in the
6885 template parameter pack PARM. */
6886 arg
= coerce_template_parameter_pack (parms
, parm_idx
, args
,
6887 inner_args
, arg_idx
,
6891 if (arg
== NULL_TREE
)
6893 /* We don't know how many args we have yet, just use the
6894 unconverted (and still packed) ones for now. */
6895 new_inner_args
= orig_inner_args
;
6900 TREE_VEC_ELT (new_inner_args
, parm_idx
) = arg
;
6902 /* Store this argument. */
6903 if (arg
== error_mark_node
)
6906 /* We are done with all of the arguments. */
6911 pack_adjust
= TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg
)) - 1;
6912 arg_idx
+= pack_adjust
;
6919 if (PACK_EXPANSION_P (arg
))
6921 /* "If every valid specialization of a variadic template
6922 requires an empty template parameter pack, the template is
6923 ill-formed, no diagnostic required." So check that the
6924 pattern works with this parameter. */
6925 tree pattern
= PACK_EXPANSION_PATTERN (arg
);
6926 tree conv
= convert_template_argument (TREE_VALUE (parm
),
6930 if (conv
== error_mark_node
)
6932 inform (input_location
, "so any instantiation with a "
6933 "non-empty parameter pack would be ill-formed");
6936 else if (TYPE_P (conv
) && !TYPE_P (pattern
))
6937 /* Recover from missing typename. */
6938 TREE_VEC_ELT (inner_args
, arg_idx
)
6939 = make_pack_expansion (conv
);
6941 /* We don't know how many args we have yet, just
6942 use the unconverted ones for now. */
6943 new_inner_args
= inner_args
;
6948 else if (require_all_args
)
6950 /* There must be a default arg in this case. */
6951 arg
= tsubst_template_arg (TREE_PURPOSE (parm
), new_args
,
6953 /* The position of the first default template argument,
6954 is also the number of non-defaulted arguments in NEW_INNER_ARGS.
6956 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
))
6957 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
,
6958 arg_idx
- pack_adjust
);
6963 if (arg
== error_mark_node
)
6965 if (complain
& tf_error
)
6966 error ("template argument %d is invalid", arg_idx
+ 1);
6969 /* This only occurs if there was an error in the template
6970 parameter list itself (which we would already have
6971 reported) that we are trying to recover from, e.g., a class
6972 template with a parameter list such as
6973 template<typename..., typename>. */
6976 arg
= convert_template_argument (TREE_VALUE (parm
),
6977 arg
, new_args
, complain
,
6980 if (arg
== error_mark_node
)
6982 TREE_VEC_ELT (new_inner_args
, arg_idx
- pack_adjust
) = arg
;
6984 cp_unevaluated_operand
= saved_unevaluated_operand
;
6985 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
6987 if (variadic_p
&& arg_idx
< nargs
)
6989 if (complain
& tf_error
)
6991 error ("wrong number of template arguments "
6992 "(%d, should be %d)", nargs
, arg_idx
);
6994 error ("provided for %q+D", in_decl
);
6996 return error_mark_node
;
7000 return error_mark_node
;
7002 #ifdef ENABLE_CHECKING
7003 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
))
7004 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
,
7005 TREE_VEC_LENGTH (new_inner_args
));
7008 return new_inner_args
;
7011 /* Like coerce_template_parms. If PARMS represents all template
7012 parameters levels, this function returns a vector of vectors
7013 representing all the resulting argument levels. Note that in this
7014 case, only the innermost arguments are coerced because the
7015 outermost ones are supposed to have been coerced already.
7017 Otherwise, if PARMS represents only (the innermost) vector of
7018 parameters, this function returns a vector containing just the
7019 innermost resulting arguments. */
7022 coerce_innermost_template_parms (tree parms
,
7025 tsubst_flags_t complain
,
7026 bool require_all_args
,
7027 bool use_default_args
)
7029 int parms_depth
= TMPL_PARMS_DEPTH (parms
);
7030 int args_depth
= TMPL_ARGS_DEPTH (args
);
7033 if (parms_depth
> 1)
7035 coerced_args
= make_tree_vec (parms_depth
);
7039 for (level
= parms
, cur_depth
= parms_depth
;
7040 parms_depth
> 0 && level
!= NULL_TREE
;
7041 level
= TREE_CHAIN (level
), --cur_depth
)
7044 if (cur_depth
== args_depth
)
7045 l
= coerce_template_parms (TREE_VALUE (level
),
7046 args
, in_decl
, complain
,
7050 l
= TMPL_ARGS_LEVEL (args
, cur_depth
);
7052 if (l
== error_mark_node
)
7053 return error_mark_node
;
7055 SET_TMPL_ARGS_LEVEL (coerced_args
, cur_depth
, l
);
7059 coerced_args
= coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parms
),
7060 args
, in_decl
, complain
,
7063 return coerced_args
;
7066 /* Returns 1 if template args OT and NT are equivalent. */
7069 template_args_equal (tree ot
, tree nt
)
7073 if (nt
== NULL_TREE
|| ot
== NULL_TREE
)
7076 if (TREE_CODE (nt
) == TREE_VEC
)
7077 /* For member templates */
7078 return TREE_CODE (ot
) == TREE_VEC
&& comp_template_args (ot
, nt
);
7079 else if (PACK_EXPANSION_P (ot
))
7080 return (PACK_EXPANSION_P (nt
)
7081 && template_args_equal (PACK_EXPANSION_PATTERN (ot
),
7082 PACK_EXPANSION_PATTERN (nt
))
7083 && template_args_equal (PACK_EXPANSION_EXTRA_ARGS (ot
),
7084 PACK_EXPANSION_EXTRA_ARGS (nt
)));
7085 else if (ARGUMENT_PACK_P (ot
))
7090 if (!ARGUMENT_PACK_P (nt
))
7093 opack
= ARGUMENT_PACK_ARGS (ot
);
7094 npack
= ARGUMENT_PACK_ARGS (nt
);
7095 len
= TREE_VEC_LENGTH (opack
);
7096 if (TREE_VEC_LENGTH (npack
) != len
)
7098 for (i
= 0; i
< len
; ++i
)
7099 if (!template_args_equal (TREE_VEC_ELT (opack
, i
),
7100 TREE_VEC_ELT (npack
, i
)))
7104 else if (ot
&& TREE_CODE (ot
) == ARGUMENT_PACK_SELECT
)
7106 /* We get here probably because we are in the middle of substituting
7107 into the pattern of a pack expansion. In that case the
7108 ARGUMENT_PACK_SELECT temporarily replaces the pack argument we are
7109 interested in. So we want to use the initial pack argument for
7111 ot
= ARGUMENT_PACK_SELECT_FROM_PACK (ot
);
7112 if (nt
&& TREE_CODE (nt
) == ARGUMENT_PACK_SELECT
)
7113 nt
= ARGUMENT_PACK_SELECT_FROM_PACK (nt
);
7114 return template_args_equal (ot
, nt
);
7116 else if (TYPE_P (nt
))
7117 return TYPE_P (ot
) && same_type_p (ot
, nt
);
7118 else if (TREE_CODE (ot
) == TREE_VEC
|| TYPE_P (ot
))
7121 return cp_tree_equal (ot
, nt
);
7124 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets of
7125 template arguments. Returns 0 otherwise, and updates OLDARG_PTR and
7126 NEWARG_PTR with the offending arguments if they are non-NULL. */
7129 comp_template_args_with_info (tree oldargs
, tree newargs
,
7130 tree
*oldarg_ptr
, tree
*newarg_ptr
)
7134 if (oldargs
== newargs
)
7137 if (!oldargs
|| !newargs
)
7140 if (TREE_VEC_LENGTH (oldargs
) != TREE_VEC_LENGTH (newargs
))
7143 for (i
= 0; i
< TREE_VEC_LENGTH (oldargs
); ++i
)
7145 tree nt
= TREE_VEC_ELT (newargs
, i
);
7146 tree ot
= TREE_VEC_ELT (oldargs
, i
);
7148 if (! template_args_equal (ot
, nt
))
7150 if (oldarg_ptr
!= NULL
)
7152 if (newarg_ptr
!= NULL
)
7160 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets
7161 of template arguments. Returns 0 otherwise. */
7164 comp_template_args (tree oldargs
, tree newargs
)
7166 return comp_template_args_with_info (oldargs
, newargs
, NULL
, NULL
);
7170 add_pending_template (tree d
)
7172 tree ti
= (TYPE_P (d
)
7173 ? CLASSTYPE_TEMPLATE_INFO (d
)
7174 : DECL_TEMPLATE_INFO (d
));
7175 struct pending_template
*pt
;
7178 if (TI_PENDING_TEMPLATE_FLAG (ti
))
7181 /* We are called both from instantiate_decl, where we've already had a
7182 tinst_level pushed, and instantiate_template, where we haven't.
7184 level
= !current_tinst_level
|| current_tinst_level
->decl
!= d
;
7187 push_tinst_level (d
);
7189 pt
= ggc_alloc_pending_template ();
7191 pt
->tinst
= current_tinst_level
;
7192 if (last_pending_template
)
7193 last_pending_template
->next
= pt
;
7195 pending_templates
= pt
;
7197 last_pending_template
= pt
;
7199 TI_PENDING_TEMPLATE_FLAG (ti
) = 1;
7206 /* Return a TEMPLATE_ID_EXPR corresponding to the indicated FNS and
7207 ARGLIST. Valid choices for FNS are given in the cp-tree.def
7208 documentation for TEMPLATE_ID_EXPR. */
7211 lookup_template_function (tree fns
, tree arglist
)
7215 if (fns
== error_mark_node
|| arglist
== error_mark_node
)
7216 return error_mark_node
;
7218 gcc_assert (!arglist
|| TREE_CODE (arglist
) == TREE_VEC
);
7220 if (!is_overloaded_fn (fns
) && !identifier_p (fns
))
7222 error ("%q#D is not a function template", fns
);
7223 return error_mark_node
;
7226 if (BASELINK_P (fns
))
7228 BASELINK_FUNCTIONS (fns
) = build2 (TEMPLATE_ID_EXPR
,
7230 BASELINK_FUNCTIONS (fns
),
7235 type
= TREE_TYPE (fns
);
7236 if (TREE_CODE (fns
) == OVERLOAD
|| !type
)
7237 type
= unknown_type_node
;
7239 return build2 (TEMPLATE_ID_EXPR
, type
, fns
, arglist
);
7242 /* Within the scope of a template class S<T>, the name S gets bound
7243 (in build_self_reference) to a TYPE_DECL for the class, not a
7244 TEMPLATE_DECL. If DECL is a TYPE_DECL for current_class_type,
7245 or one of its enclosing classes, and that type is a template,
7246 return the associated TEMPLATE_DECL. Otherwise, the original
7249 Also handle the case when DECL is a TREE_LIST of ambiguous
7250 injected-class-names from different bases. */
7253 maybe_get_template_decl_from_type_decl (tree decl
)
7255 if (decl
== NULL_TREE
)
7258 /* DR 176: A lookup that finds an injected-class-name (10.2
7259 [class.member.lookup]) can result in an ambiguity in certain cases
7260 (for example, if it is found in more than one base class). If all of
7261 the injected-class-names that are found refer to specializations of
7262 the same class template, and if the name is followed by a
7263 template-argument-list, the reference refers to the class template
7264 itself and not a specialization thereof, and is not ambiguous. */
7265 if (TREE_CODE (decl
) == TREE_LIST
)
7267 tree t
, tmpl
= NULL_TREE
;
7268 for (t
= decl
; t
; t
= TREE_CHAIN (t
))
7270 tree elt
= maybe_get_template_decl_from_type_decl (TREE_VALUE (t
));
7273 else if (tmpl
!= elt
)
7276 if (tmpl
&& t
== NULL_TREE
)
7282 return (decl
!= NULL_TREE
7283 && DECL_SELF_REFERENCE_P (decl
)
7284 && CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (decl
)))
7285 ? CLASSTYPE_TI_TEMPLATE (TREE_TYPE (decl
)) : decl
;
7288 /* Given an IDENTIFIER_NODE (or type TEMPLATE_DECL) and a chain of
7289 parameters, find the desired type.
7291 D1 is the PTYPENAME terminal, and ARGLIST is the list of arguments.
7293 IN_DECL, if non-NULL, is the template declaration we are trying to
7296 If ENTERING_SCOPE is nonzero, we are about to enter the scope of
7297 the class we are looking up.
7299 Issue error and warning messages under control of COMPLAIN.
7301 If the template class is really a local class in a template
7302 function, then the FUNCTION_CONTEXT is the function in which it is
7305 ??? Note that this function is currently called *twice* for each
7306 template-id: the first time from the parser, while creating the
7307 incomplete type (finish_template_type), and the second type during the
7308 real instantiation (instantiate_template_class). This is surely something
7309 that we want to avoid. It also causes some problems with argument
7310 coercion (see convert_nontype_argument for more information on this). */
7313 lookup_template_class_1 (tree d1
, tree arglist
, tree in_decl
, tree context
,
7314 int entering_scope
, tsubst_flags_t complain
)
7316 tree templ
= NULL_TREE
, parmlist
;
7323 if (identifier_p (d1
))
7325 tree value
= innermost_non_namespace_value (d1
);
7326 if (value
&& DECL_TEMPLATE_TEMPLATE_PARM_P (value
))
7331 push_decl_namespace (context
);
7332 templ
= lookup_name (d1
);
7333 templ
= maybe_get_template_decl_from_type_decl (templ
);
7335 pop_decl_namespace ();
7338 context
= DECL_CONTEXT (templ
);
7340 else if (TREE_CODE (d1
) == TYPE_DECL
&& MAYBE_CLASS_TYPE_P (TREE_TYPE (d1
)))
7342 tree type
= TREE_TYPE (d1
);
7344 /* If we are declaring a constructor, say A<T>::A<T>, we will get
7345 an implicit typename for the second A. Deal with it. */
7346 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
7347 type
= TREE_TYPE (type
);
7349 if (CLASSTYPE_TEMPLATE_INFO (type
))
7351 templ
= CLASSTYPE_TI_TEMPLATE (type
);
7352 d1
= DECL_NAME (templ
);
7355 else if (TREE_CODE (d1
) == ENUMERAL_TYPE
7356 || (TYPE_P (d1
) && MAYBE_CLASS_TYPE_P (d1
)))
7358 templ
= TYPE_TI_TEMPLATE (d1
);
7359 d1
= DECL_NAME (templ
);
7361 else if (TREE_CODE (d1
) == TEMPLATE_DECL
7362 && DECL_TEMPLATE_RESULT (d1
)
7363 && TREE_CODE (DECL_TEMPLATE_RESULT (d1
)) == TYPE_DECL
)
7366 d1
= DECL_NAME (templ
);
7367 context
= DECL_CONTEXT (templ
);
7369 else if (DECL_TEMPLATE_TEMPLATE_PARM_P (d1
))
7372 d1
= DECL_NAME (templ
);
7375 /* Issue an error message if we didn't find a template. */
7378 if (complain
& tf_error
)
7379 error ("%qT is not a template", d1
);
7380 return error_mark_node
;
7383 if (TREE_CODE (templ
) != TEMPLATE_DECL
7384 /* Make sure it's a user visible template, if it was named by
7386 || ((complain
& tf_user
) && !DECL_TEMPLATE_PARM_P (templ
)
7387 && !PRIMARY_TEMPLATE_P (templ
)))
7389 if (complain
& tf_error
)
7391 error ("non-template type %qT used as a template", d1
);
7393 error ("for template declaration %q+D", in_decl
);
7395 return error_mark_node
;
7398 complain
&= ~tf_user
;
7400 /* An alias that just changes the name of a template is equivalent to the
7401 other template, so if any of the arguments are pack expansions, strip
7402 the alias to avoid problems with a pack expansion passed to a non-pack
7403 alias template parameter (DR 1430). */
7404 if (pack_expansion_args_count (INNERMOST_TEMPLATE_ARGS (arglist
)))
7405 templ
= get_underlying_template (templ
);
7407 if (DECL_TEMPLATE_TEMPLATE_PARM_P (templ
))
7409 /* Create a new TEMPLATE_DECL and TEMPLATE_TEMPLATE_PARM node to store
7410 template arguments */
7416 parmlist
= DECL_INNERMOST_TEMPLATE_PARMS (templ
);
7418 /* Consider an example where a template template parameter declared as
7420 template <class T, class U = std::allocator<T> > class TT
7422 The template parameter level of T and U are one level larger than
7423 of TT. To proper process the default argument of U, say when an
7424 instantiation `TT<int>' is seen, we need to build the full
7425 arguments containing {int} as the innermost level. Outer levels,
7426 available when not appearing as default template argument, can be
7427 obtained from the arguments of the enclosing template.
7429 Suppose that TT is later substituted with std::vector. The above
7430 instantiation is `TT<int, std::allocator<T> >' with TT at
7431 level 1, and T at level 2, while the template arguments at level 1
7432 becomes {std::vector} and the inner level 2 is {int}. */
7434 outer
= DECL_CONTEXT (templ
);
7436 outer
= TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (outer
)));
7437 else if (current_template_parms
)
7438 /* This is an argument of the current template, so we haven't set
7439 DECL_CONTEXT yet. */
7440 outer
= current_template_args ();
7443 arglist
= add_to_template_args (outer
, arglist
);
7445 arglist2
= coerce_template_parms (parmlist
, arglist
, templ
,
7447 /*require_all_args=*/true,
7448 /*use_default_args=*/true);
7449 if (arglist2
== error_mark_node
7450 || (!uses_template_parms (arglist2
)
7451 && check_instantiated_args (templ
, arglist2
, complain
)))
7452 return error_mark_node
;
7454 parm
= bind_template_template_parm (TREE_TYPE (templ
), arglist2
);
7459 tree template_type
= TREE_TYPE (templ
);
7462 tree found
= NULL_TREE
;
7465 int is_dependent_type
;
7466 int use_partial_inst_tmpl
= false;
7468 if (template_type
== error_mark_node
)
7469 /* An error occurred while building the template TEMPL, and a
7470 diagnostic has most certainly been emitted for that
7471 already. Let's propagate that error. */
7472 return error_mark_node
;
7474 gen_tmpl
= most_general_template (templ
);
7475 parmlist
= DECL_TEMPLATE_PARMS (gen_tmpl
);
7476 parm_depth
= TMPL_PARMS_DEPTH (parmlist
);
7477 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
7479 if (arg_depth
== 1 && parm_depth
> 1)
7481 /* We've been given an incomplete set of template arguments.
7484 template <class T> struct S1 {
7485 template <class U> struct S2 {};
7486 template <class U> struct S2<U*> {};
7489 we will be called with an ARGLIST of `U*', but the
7490 TEMPLATE will be `template <class T> template
7491 <class U> struct S1<T>::S2'. We must fill in the missing
7494 = add_outermost_template_args (TYPE_TI_ARGS (TREE_TYPE (templ
)),
7496 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
7499 /* Now we should have enough arguments. */
7500 gcc_assert (parm_depth
== arg_depth
);
7502 /* From here on, we're only interested in the most general
7505 /* Calculate the BOUND_ARGS. These will be the args that are
7506 actually tsubst'd into the definition to create the
7510 /* We have multiple levels of arguments to coerce, at once. */
7512 int saved_depth
= TMPL_ARGS_DEPTH (arglist
);
7514 tree bound_args
= make_tree_vec (parm_depth
);
7516 for (i
= saved_depth
,
7517 t
= DECL_TEMPLATE_PARMS (gen_tmpl
);
7518 i
> 0 && t
!= NULL_TREE
;
7519 --i
, t
= TREE_CHAIN (t
))
7522 if (i
== saved_depth
)
7523 a
= coerce_template_parms (TREE_VALUE (t
),
7526 /*require_all_args=*/true,
7527 /*use_default_args=*/true);
7529 /* Outer levels should have already been coerced. */
7530 a
= TMPL_ARGS_LEVEL (arglist
, i
);
7532 /* Don't process further if one of the levels fails. */
7533 if (a
== error_mark_node
)
7535 /* Restore the ARGLIST to its full size. */
7536 TREE_VEC_LENGTH (arglist
) = saved_depth
;
7537 return error_mark_node
;
7540 SET_TMPL_ARGS_LEVEL (bound_args
, i
, a
);
7542 /* We temporarily reduce the length of the ARGLIST so
7543 that coerce_template_parms will see only the arguments
7544 corresponding to the template parameters it is
7546 TREE_VEC_LENGTH (arglist
)--;
7549 /* Restore the ARGLIST to its full size. */
7550 TREE_VEC_LENGTH (arglist
) = saved_depth
;
7552 arglist
= bound_args
;
7556 = coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parmlist
),
7557 INNERMOST_TEMPLATE_ARGS (arglist
),
7560 /*require_all_args=*/true,
7561 /*use_default_args=*/true);
7563 if (arglist
== error_mark_node
)
7564 /* We were unable to bind the arguments. */
7565 return error_mark_node
;
7567 /* In the scope of a template class, explicit references to the
7568 template class refer to the type of the template, not any
7569 instantiation of it. For example, in:
7571 template <class T> class C { void f(C<T>); }
7573 the `C<T>' is just the same as `C'. Outside of the
7574 class, however, such a reference is an instantiation. */
7576 || !PRIMARY_TEMPLATE_P (gen_tmpl
)
7577 || currently_open_class (template_type
))
7578 /* comp_template_args is expensive, check it last. */
7579 && comp_template_args (TYPE_TI_ARGS (template_type
),
7581 return template_type
;
7583 /* If we already have this specialization, return it. */
7584 elt
.tmpl
= gen_tmpl
;
7586 hash
= hash_specialization (&elt
);
7587 entry
= (spec_entry
*) htab_find_with_hash (type_specializations
,
7593 is_dependent_type
= uses_template_parms (arglist
);
7595 /* If the deduced arguments are invalid, then the binding
7597 if (!is_dependent_type
7598 && check_instantiated_args (gen_tmpl
,
7599 INNERMOST_TEMPLATE_ARGS (arglist
),
7601 return error_mark_node
;
7603 if (!is_dependent_type
7604 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
7605 && !LAMBDA_TYPE_P (TREE_TYPE (gen_tmpl
))
7606 && TREE_CODE (CP_DECL_CONTEXT (gen_tmpl
)) == NAMESPACE_DECL
)
7608 found
= xref_tag_from_type (TREE_TYPE (gen_tmpl
),
7609 DECL_NAME (gen_tmpl
),
7610 /*tag_scope=*/ts_global
);
7614 context
= tsubst (DECL_CONTEXT (gen_tmpl
), arglist
,
7616 if (context
== error_mark_node
)
7617 return error_mark_node
;
7620 context
= global_namespace
;
7622 /* Create the type. */
7623 if (DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
7625 /* The user referred to a specialization of an alias
7626 template represented by GEN_TMPL.
7628 [temp.alias]/2 says:
7630 When a template-id refers to the specialization of an
7631 alias template, it is equivalent to the associated
7632 type obtained by substitution of its
7633 template-arguments for the template-parameters in the
7634 type-id of the alias template. */
7636 t
= tsubst (TREE_TYPE (gen_tmpl
), arglist
, complain
, in_decl
);
7637 /* Note that the call above (by indirectly calling
7638 register_specialization in tsubst_decl) registers the
7639 TYPE_DECL representing the specialization of the alias
7640 template. So next time someone substitutes ARGLIST for
7641 the template parms into the alias template (GEN_TMPL),
7642 she'll get that TYPE_DECL back. */
7644 if (t
== error_mark_node
)
7647 else if (TREE_CODE (template_type
) == ENUMERAL_TYPE
)
7649 if (!is_dependent_type
)
7651 set_current_access_from_decl (TYPE_NAME (template_type
));
7652 t
= start_enum (TYPE_IDENTIFIER (template_type
), NULL_TREE
,
7653 tsubst (ENUM_UNDERLYING_TYPE (template_type
),
7654 arglist
, complain
, in_decl
),
7655 SCOPED_ENUM_P (template_type
), NULL
);
7657 if (t
== error_mark_node
)
7662 /* We don't want to call start_enum for this type, since
7663 the values for the enumeration constants may involve
7664 template parameters. And, no one should be interested
7665 in the enumeration constants for such a type. */
7666 t
= cxx_make_type (ENUMERAL_TYPE
);
7667 SET_SCOPED_ENUM_P (t
, SCOPED_ENUM_P (template_type
));
7669 SET_OPAQUE_ENUM_P (t
, OPAQUE_ENUM_P (template_type
));
7670 ENUM_FIXED_UNDERLYING_TYPE_P (t
)
7671 = ENUM_FIXED_UNDERLYING_TYPE_P (template_type
);
7673 else if (CLASS_TYPE_P (template_type
))
7675 t
= make_class_type (TREE_CODE (template_type
));
7676 CLASSTYPE_DECLARED_CLASS (t
)
7677 = CLASSTYPE_DECLARED_CLASS (template_type
);
7678 SET_CLASSTYPE_IMPLICIT_INSTANTIATION (t
);
7679 TYPE_FOR_JAVA (t
) = TYPE_FOR_JAVA (template_type
);
7681 /* A local class. Make sure the decl gets registered properly. */
7682 if (context
== current_function_decl
)
7683 pushtag (DECL_NAME (gen_tmpl
), t
, /*tag_scope=*/ts_current
);
7685 if (comp_template_args (CLASSTYPE_TI_ARGS (template_type
), arglist
))
7686 /* This instantiation is another name for the primary
7687 template type. Set the TYPE_CANONICAL field
7689 TYPE_CANONICAL (t
) = template_type
;
7690 else if (any_template_arguments_need_structural_equality_p (arglist
))
7691 /* Some of the template arguments require structural
7692 equality testing, so this template class requires
7693 structural equality testing. */
7694 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7699 /* If we called start_enum or pushtag above, this information
7700 will already be set up. */
7703 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
7705 type_decl
= create_implicit_typedef (DECL_NAME (gen_tmpl
), t
);
7706 DECL_CONTEXT (type_decl
) = TYPE_CONTEXT (t
);
7707 DECL_SOURCE_LOCATION (type_decl
)
7708 = DECL_SOURCE_LOCATION (TYPE_STUB_DECL (template_type
));
7711 type_decl
= TYPE_NAME (t
);
7713 if (CLASS_TYPE_P (template_type
))
7715 TREE_PRIVATE (type_decl
)
7716 = TREE_PRIVATE (TYPE_MAIN_DECL (template_type
));
7717 TREE_PROTECTED (type_decl
)
7718 = TREE_PROTECTED (TYPE_MAIN_DECL (template_type
));
7719 if (CLASSTYPE_VISIBILITY_SPECIFIED (template_type
))
7721 DECL_VISIBILITY_SPECIFIED (type_decl
) = 1;
7722 DECL_VISIBILITY (type_decl
) = CLASSTYPE_VISIBILITY (template_type
);
7726 /* Let's consider the explicit specialization of a member
7727 of a class template specialization that is implicitly instantiated,
7732 template<class U> struct M {}; //#0
7737 struct S<int>::M<char> //#1
7741 [temp.expl.spec]/4 says this is valid.
7743 In this case, when we write:
7746 M is instantiated from the CLASSTYPE_TI_TEMPLATE of #1, not from
7749 When we encounter #1, we want to store the partial instantiation
7750 of M (template<class T> S<int>::M<T>) in its CLASSTYPE_TI_TEMPLATE.
7752 For all cases other than this "explicit specialization of member of a
7753 class template", we just want to store the most general template into
7754 the CLASSTYPE_TI_TEMPLATE of M.
7756 This case of "explicit specialization of member of a class template"
7758 1/ the enclosing class is an instantiation of, and therefore not
7759 the same as, the context of the most general template, and
7760 2/ we aren't looking at the partial instantiation itself, i.e.
7761 the innermost arguments are not the same as the innermost parms of
7762 the most general template.
7764 So it's only when 1/ and 2/ happens that we want to use the partial
7765 instantiation of the member template in lieu of its most general
7768 if (PRIMARY_TEMPLATE_P (gen_tmpl
)
7769 && TMPL_ARGS_HAVE_MULTIPLE_LEVELS (arglist
)
7770 /* the enclosing class must be an instantiation... */
7771 && CLASS_TYPE_P (context
)
7772 && !same_type_p (context
, DECL_CONTEXT (gen_tmpl
)))
7774 tree partial_inst_args
;
7775 TREE_VEC_LENGTH (arglist
)--;
7776 ++processing_template_decl
;
7778 tsubst (INNERMOST_TEMPLATE_ARGS
7779 (TYPE_TI_ARGS (TREE_TYPE (gen_tmpl
))),
7780 arglist
, complain
, NULL_TREE
);
7781 --processing_template_decl
;
7782 TREE_VEC_LENGTH (arglist
)++;
7783 use_partial_inst_tmpl
=
7784 /*...and we must not be looking at the partial instantiation
7786 !comp_template_args (INNERMOST_TEMPLATE_ARGS (arglist
),
7790 if (!use_partial_inst_tmpl
)
7791 /* This case is easy; there are no member templates involved. */
7795 /* This is a full instantiation of a member template. Find
7796 the partial instantiation of which this is an instance. */
7798 /* Temporarily reduce by one the number of levels in the ARGLIST
7799 so as to avoid comparing the last set of arguments. */
7800 TREE_VEC_LENGTH (arglist
)--;
7801 found
= tsubst (gen_tmpl
, arglist
, complain
, NULL_TREE
);
7802 TREE_VEC_LENGTH (arglist
)++;
7803 /* FOUND is either a proper class type, or an alias
7804 template specialization. In the later case, it's a
7805 TYPE_DECL, resulting from the substituting of arguments
7806 for parameters in the TYPE_DECL of the alias template
7807 done earlier. So be careful while getting the template
7809 found
= TREE_CODE (found
) == TYPE_DECL
7810 ? TYPE_TI_TEMPLATE (TREE_TYPE (found
))
7811 : CLASSTYPE_TI_TEMPLATE (found
);
7814 SET_TYPE_TEMPLATE_INFO (t
, build_template_info (found
, arglist
));
7817 slot
= htab_find_slot_with_hash (type_specializations
,
7818 &elt
, hash
, INSERT
);
7819 entry
= ggc_alloc_spec_entry ();
7823 /* Note this use of the partial instantiation so we can check it
7824 later in maybe_process_partial_specialization. */
7825 DECL_TEMPLATE_INSTANTIATIONS (found
)
7826 = tree_cons (arglist
, t
,
7827 DECL_TEMPLATE_INSTANTIATIONS (found
));
7829 if (TREE_CODE (template_type
) == ENUMERAL_TYPE
&& !is_dependent_type
7830 && !DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
7831 /* Now that the type has been registered on the instantiations
7832 list, we set up the enumerators. Because the enumeration
7833 constants may involve the enumeration type itself, we make
7834 sure to register the type first, and then create the
7835 constants. That way, doing tsubst_expr for the enumeration
7836 constants won't result in recursive calls here; we'll find
7837 the instantiation and exit above. */
7838 tsubst_enum (template_type
, t
, arglist
);
7840 if (CLASS_TYPE_P (template_type
) && is_dependent_type
)
7841 /* If the type makes use of template parameters, the
7842 code that generates debugging information will crash. */
7843 DECL_IGNORED_P (TYPE_MAIN_DECL (t
)) = 1;
7845 /* Possibly limit visibility based on template args. */
7846 TREE_PUBLIC (type_decl
) = 1;
7847 determine_visibility (type_decl
);
7853 /* Wrapper for lookup_template_class_1. */
7856 lookup_template_class (tree d1
, tree arglist
, tree in_decl
, tree context
,
7857 int entering_scope
, tsubst_flags_t complain
)
7860 timevar_push (TV_TEMPLATE_INST
);
7861 ret
= lookup_template_class_1 (d1
, arglist
, in_decl
, context
,
7862 entering_scope
, complain
);
7863 timevar_pop (TV_TEMPLATE_INST
);
7871 /* True when we should also visit template parameters that occur in
7872 non-deduced contexts. */
7873 bool include_nondeduced_p
;
7874 struct pointer_set_t
*visited
;
7877 /* Called from for_each_template_parm via walk_tree. */
7880 for_each_template_parm_r (tree
*tp
, int *walk_subtrees
, void *d
)
7883 struct pair_fn_data
*pfd
= (struct pair_fn_data
*) d
;
7884 tree_fn_t fn
= pfd
->fn
;
7885 void *data
= pfd
->data
;
7888 && (pfd
->include_nondeduced_p
|| TREE_CODE (t
) != TYPENAME_TYPE
)
7889 && for_each_template_parm (TYPE_CONTEXT (t
), fn
, data
, pfd
->visited
,
7890 pfd
->include_nondeduced_p
))
7891 return error_mark_node
;
7893 switch (TREE_CODE (t
))
7896 if (TYPE_PTRMEMFUNC_P (t
))
7902 if (!TYPE_TEMPLATE_INFO (t
))
7904 else if (for_each_template_parm (TYPE_TI_ARGS (t
),
7905 fn
, data
, pfd
->visited
,
7906 pfd
->include_nondeduced_p
))
7907 return error_mark_node
;
7911 if (for_each_template_parm (TYPE_MIN_VALUE (t
),
7912 fn
, data
, pfd
->visited
,
7913 pfd
->include_nondeduced_p
)
7914 || for_each_template_parm (TYPE_MAX_VALUE (t
),
7915 fn
, data
, pfd
->visited
,
7916 pfd
->include_nondeduced_p
))
7917 return error_mark_node
;
7921 /* Since we're not going to walk subtrees, we have to do this
7923 if (for_each_template_parm (TYPE_METHOD_BASETYPE (t
), fn
, data
,
7924 pfd
->visited
, pfd
->include_nondeduced_p
))
7925 return error_mark_node
;
7929 /* Check the return type. */
7930 if (for_each_template_parm (TREE_TYPE (t
), fn
, data
, pfd
->visited
,
7931 pfd
->include_nondeduced_p
))
7932 return error_mark_node
;
7934 /* Check the parameter types. Since default arguments are not
7935 instantiated until they are needed, the TYPE_ARG_TYPES may
7936 contain expressions that involve template parameters. But,
7937 no-one should be looking at them yet. And, once they're
7938 instantiated, they don't contain template parameters, so
7939 there's no point in looking at them then, either. */
7943 for (parm
= TYPE_ARG_TYPES (t
); parm
; parm
= TREE_CHAIN (parm
))
7944 if (for_each_template_parm (TREE_VALUE (parm
), fn
, data
,
7945 pfd
->visited
, pfd
->include_nondeduced_p
))
7946 return error_mark_node
;
7948 /* Since we've already handled the TYPE_ARG_TYPES, we don't
7949 want walk_tree walking into them itself. */
7955 case UNDERLYING_TYPE
:
7956 if (pfd
->include_nondeduced_p
7957 && for_each_template_parm (TYPE_FIELDS (t
), fn
, data
,
7959 pfd
->include_nondeduced_p
))
7960 return error_mark_node
;
7965 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
)
7966 && for_each_template_parm (DECL_TI_ARGS (t
), fn
, data
,
7967 pfd
->visited
, pfd
->include_nondeduced_p
))
7968 return error_mark_node
;
7973 if (TREE_CODE (t
) == CONST_DECL
&& DECL_TEMPLATE_PARM_P (t
)
7974 && for_each_template_parm (DECL_INITIAL (t
), fn
, data
,
7975 pfd
->visited
, pfd
->include_nondeduced_p
))
7976 return error_mark_node
;
7977 if (DECL_CONTEXT (t
)
7978 && pfd
->include_nondeduced_p
7979 && for_each_template_parm (DECL_CONTEXT (t
), fn
, data
,
7980 pfd
->visited
, pfd
->include_nondeduced_p
))
7981 return error_mark_node
;
7984 case BOUND_TEMPLATE_TEMPLATE_PARM
:
7985 /* Record template parameters such as `T' inside `TT<T>'. */
7986 if (for_each_template_parm (TYPE_TI_ARGS (t
), fn
, data
, pfd
->visited
,
7987 pfd
->include_nondeduced_p
))
7988 return error_mark_node
;
7991 case TEMPLATE_TEMPLATE_PARM
:
7992 case TEMPLATE_TYPE_PARM
:
7993 case TEMPLATE_PARM_INDEX
:
7994 if (fn
&& (*fn
)(t
, data
))
7995 return error_mark_node
;
7997 return error_mark_node
;
8001 /* A template template parameter is encountered. */
8002 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
)
8003 && for_each_template_parm (TREE_TYPE (t
), fn
, data
, pfd
->visited
,
8004 pfd
->include_nondeduced_p
))
8005 return error_mark_node
;
8007 /* Already substituted template template parameter */
8013 || for_each_template_parm (TYPENAME_TYPE_FULLNAME (t
), fn
,
8015 pfd
->include_nondeduced_p
))
8016 return error_mark_node
;
8020 if (TREE_TYPE (t
) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t
))
8021 && pfd
->include_nondeduced_p
8022 && for_each_template_parm (TYPE_PTRMEMFUNC_FN_TYPE
8023 (TREE_TYPE (t
)), fn
, data
,
8024 pfd
->visited
, pfd
->include_nondeduced_p
))
8025 return error_mark_node
;
8030 /* If there's no type, then this thing must be some expression
8031 involving template parameters. */
8032 if (!fn
&& !TREE_TYPE (t
))
8033 return error_mark_node
;
8038 case IMPLICIT_CONV_EXPR
:
8039 case REINTERPRET_CAST_EXPR
:
8040 case CONST_CAST_EXPR
:
8041 case STATIC_CAST_EXPR
:
8042 case DYNAMIC_CAST_EXPR
:
8046 case PSEUDO_DTOR_EXPR
:
8048 return error_mark_node
;
8055 /* We didn't find any template parameters we liked. */
8059 /* For each TEMPLATE_TYPE_PARM, TEMPLATE_TEMPLATE_PARM,
8060 BOUND_TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX in T,
8061 call FN with the parameter and the DATA.
8062 If FN returns nonzero, the iteration is terminated, and
8063 for_each_template_parm returns 1. Otherwise, the iteration
8064 continues. If FN never returns a nonzero value, the value
8065 returned by for_each_template_parm is 0. If FN is NULL, it is
8066 considered to be the function which always returns 1.
8068 If INCLUDE_NONDEDUCED_P, then this routine will also visit template
8069 parameters that occur in non-deduced contexts. When false, only
8070 visits those template parameters that can be deduced. */
8073 for_each_template_parm (tree t
, tree_fn_t fn
, void* data
,
8074 struct pointer_set_t
*visited
,
8075 bool include_nondeduced_p
)
8077 struct pair_fn_data pfd
;
8083 pfd
.include_nondeduced_p
= include_nondeduced_p
;
8085 /* Walk the tree. (Conceptually, we would like to walk without
8086 duplicates, but for_each_template_parm_r recursively calls
8087 for_each_template_parm, so we would need to reorganize a fair
8088 bit to use walk_tree_without_duplicates, so we keep our own
8091 pfd
.visited
= visited
;
8093 pfd
.visited
= pointer_set_create ();
8094 result
= cp_walk_tree (&t
,
8095 for_each_template_parm_r
,
8097 pfd
.visited
) != NULL_TREE
;
8102 pointer_set_destroy (pfd
.visited
);
8109 /* Returns true if T depends on any template parameter. */
8112 uses_template_parms (tree t
)
8115 int saved_processing_template_decl
;
8117 saved_processing_template_decl
= processing_template_decl
;
8118 if (!saved_processing_template_decl
)
8119 processing_template_decl
= 1;
8121 dependent_p
= dependent_type_p (t
);
8122 else if (TREE_CODE (t
) == TREE_VEC
)
8123 dependent_p
= any_dependent_template_arguments_p (t
);
8124 else if (TREE_CODE (t
) == TREE_LIST
)
8125 dependent_p
= (uses_template_parms (TREE_VALUE (t
))
8126 || uses_template_parms (TREE_CHAIN (t
)));
8127 else if (TREE_CODE (t
) == TYPE_DECL
)
8128 dependent_p
= dependent_type_p (TREE_TYPE (t
));
8131 || TREE_CODE (t
) == TEMPLATE_PARM_INDEX
8132 || TREE_CODE (t
) == OVERLOAD
8135 || TREE_CODE (t
) == TRAIT_EXPR
8136 || TREE_CODE (t
) == CONSTRUCTOR
8137 || CONSTANT_CLASS_P (t
))
8138 dependent_p
= (type_dependent_expression_p (t
)
8139 || value_dependent_expression_p (t
));
8142 gcc_assert (t
== error_mark_node
);
8143 dependent_p
= false;
8146 processing_template_decl
= saved_processing_template_decl
;
8151 /* Returns true iff current_function_decl is an incompletely instantiated
8152 template. Useful instead of processing_template_decl because the latter
8153 is set to 0 during fold_non_dependent_expr. */
8156 in_template_function (void)
8158 tree fn
= current_function_decl
;
8160 ++processing_template_decl
;
8161 ret
= (fn
&& DECL_LANG_SPECIFIC (fn
)
8162 && DECL_TEMPLATE_INFO (fn
)
8163 && any_dependent_template_arguments_p (DECL_TI_ARGS (fn
)));
8164 --processing_template_decl
;
8168 /* Returns true if T depends on any template parameter with level LEVEL. */
8171 uses_template_parms_level (tree t
, int level
)
8173 return for_each_template_parm (t
, template_parm_this_level_p
, &level
, NULL
,
8174 /*include_nondeduced_p=*/true);
8177 /* Returns TRUE iff INST is an instantiation we don't need to do in an
8178 ill-formed translation unit, i.e. a variable or function that isn't
8179 usable in a constant expression. */
8182 neglectable_inst_p (tree d
)
8185 && !(TREE_CODE (d
) == FUNCTION_DECL
? DECL_DECLARED_CONSTEXPR_P (d
)
8186 : decl_maybe_constant_var_p (d
)));
8189 /* Returns TRUE iff we should refuse to instantiate DECL because it's
8190 neglectable and instantiated from within an erroneous instantiation. */
8193 limit_bad_template_recursion (tree decl
)
8195 struct tinst_level
*lev
= current_tinst_level
;
8196 int errs
= errorcount
+ sorrycount
;
8197 if (lev
== NULL
|| errs
== 0 || !neglectable_inst_p (decl
))
8200 for (; lev
; lev
= lev
->next
)
8201 if (neglectable_inst_p (lev
->decl
))
8204 return (lev
&& errs
> lev
->errors
);
8207 static int tinst_depth
;
8208 extern int max_tinst_depth
;
8211 static GTY(()) struct tinst_level
*last_error_tinst_level
;
8213 /* We're starting to instantiate D; record the template instantiation context
8214 for diagnostics and to restore it later. */
8217 push_tinst_level (tree d
)
8219 struct tinst_level
*new_level
;
8221 if (tinst_depth
>= max_tinst_depth
)
8223 last_error_tinst_level
= current_tinst_level
;
8224 if (TREE_CODE (d
) == TREE_LIST
)
8225 error ("template instantiation depth exceeds maximum of %d (use "
8226 "-ftemplate-depth= to increase the maximum) substituting %qS",
8227 max_tinst_depth
, d
);
8229 error ("template instantiation depth exceeds maximum of %d (use "
8230 "-ftemplate-depth= to increase the maximum) instantiating %qD",
8231 max_tinst_depth
, d
);
8233 print_instantiation_context ();
8238 /* If the current instantiation caused problems, don't let it instantiate
8239 anything else. Do allow deduction substitution and decls usable in
8240 constant expressions. */
8241 if (limit_bad_template_recursion (d
))
8244 new_level
= ggc_alloc_tinst_level ();
8245 new_level
->decl
= d
;
8246 new_level
->locus
= input_location
;
8247 new_level
->errors
= errorcount
+sorrycount
;
8248 new_level
->in_system_header_p
= in_system_header_at (input_location
);
8249 new_level
->next
= current_tinst_level
;
8250 current_tinst_level
= new_level
;
8253 if (GATHER_STATISTICS
&& (tinst_depth
> depth_reached
))
8254 depth_reached
= tinst_depth
;
8259 /* We're done instantiating this template; return to the instantiation
8263 pop_tinst_level (void)
8265 /* Restore the filename and line number stashed away when we started
8266 this instantiation. */
8267 input_location
= current_tinst_level
->locus
;
8268 current_tinst_level
= current_tinst_level
->next
;
8272 /* We're instantiating a deferred template; restore the template
8273 instantiation context in which the instantiation was requested, which
8274 is one step out from LEVEL. Return the corresponding DECL or TYPE. */
8277 reopen_tinst_level (struct tinst_level
*level
)
8279 struct tinst_level
*t
;
8282 for (t
= level
; t
; t
= t
->next
)
8285 current_tinst_level
= level
;
8287 if (current_tinst_level
)
8288 current_tinst_level
->errors
= errorcount
+sorrycount
;
8292 /* Returns the TINST_LEVEL which gives the original instantiation
8295 struct tinst_level
*
8296 outermost_tinst_level (void)
8298 struct tinst_level
*level
= current_tinst_level
;
8301 level
= level
->next
;
8305 /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the
8306 vector of template arguments, as for tsubst.
8308 Returns an appropriate tsubst'd friend declaration. */
8311 tsubst_friend_function (tree decl
, tree args
)
8315 if (TREE_CODE (decl
) == FUNCTION_DECL
8316 && DECL_TEMPLATE_INSTANTIATION (decl
)
8317 && TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
8318 /* This was a friend declared with an explicit template
8319 argument list, e.g.:
8323 to indicate that f was a template instantiation, not a new
8324 function declaration. Now, we have to figure out what
8325 instantiation of what template. */
8327 tree template_id
, arglist
, fns
;
8330 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (current_class_type
));
8332 /* Friend functions are looked up in the containing namespace scope.
8333 We must enter that scope, to avoid finding member functions of the
8334 current class with same name. */
8335 push_nested_namespace (ns
);
8336 fns
= tsubst_expr (DECL_TI_TEMPLATE (decl
), args
,
8337 tf_warning_or_error
, NULL_TREE
,
8338 /*integral_constant_expression_p=*/false);
8339 pop_nested_namespace (ns
);
8340 arglist
= tsubst (DECL_TI_ARGS (decl
), args
,
8341 tf_warning_or_error
, NULL_TREE
);
8342 template_id
= lookup_template_function (fns
, arglist
);
8344 new_friend
= tsubst (decl
, args
, tf_warning_or_error
, NULL_TREE
);
8345 tmpl
= determine_specialization (template_id
, new_friend
,
8347 /*need_member_template=*/0,
8348 TREE_VEC_LENGTH (args
),
8350 return instantiate_template (tmpl
, new_args
, tf_error
);
8353 new_friend
= tsubst (decl
, args
, tf_warning_or_error
, NULL_TREE
);
8355 /* The NEW_FRIEND will look like an instantiation, to the
8356 compiler, but is not an instantiation from the point of view of
8357 the language. For example, we might have had:
8359 template <class T> struct S {
8360 template <class U> friend void f(T, U);
8363 Then, in S<int>, template <class U> void f(int, U) is not an
8364 instantiation of anything. */
8365 if (new_friend
== error_mark_node
)
8366 return error_mark_node
;
8368 DECL_USE_TEMPLATE (new_friend
) = 0;
8369 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
8371 DECL_USE_TEMPLATE (DECL_TEMPLATE_RESULT (new_friend
)) = 0;
8372 DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (new_friend
))
8373 = DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (decl
));
8376 /* The mangled name for the NEW_FRIEND is incorrect. The function
8377 is not a template instantiation and should not be mangled like
8378 one. Therefore, we forget the mangling here; we'll recompute it
8379 later if we need it. */
8380 if (TREE_CODE (new_friend
) != TEMPLATE_DECL
)
8382 SET_DECL_RTL (new_friend
, NULL
);
8383 SET_DECL_ASSEMBLER_NAME (new_friend
, NULL_TREE
);
8386 if (DECL_NAMESPACE_SCOPE_P (new_friend
))
8389 tree new_friend_template_info
;
8390 tree new_friend_result_template_info
;
8392 int new_friend_is_defn
;
8394 /* We must save some information from NEW_FRIEND before calling
8395 duplicate decls since that function will free NEW_FRIEND if
8397 new_friend_template_info
= DECL_TEMPLATE_INFO (new_friend
);
8398 new_friend_is_defn
=
8399 (DECL_INITIAL (DECL_TEMPLATE_RESULT
8400 (template_for_substitution (new_friend
)))
8402 if (TREE_CODE (new_friend
) == TEMPLATE_DECL
)
8404 /* This declaration is a `primary' template. */
8405 DECL_PRIMARY_TEMPLATE (new_friend
) = new_friend
;
8407 new_friend_result_template_info
8408 = DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (new_friend
));
8411 new_friend_result_template_info
= NULL_TREE
;
8413 /* Make the init_value nonzero so pushdecl knows this is a defn. */
8414 if (new_friend_is_defn
)
8415 DECL_INITIAL (new_friend
) = error_mark_node
;
8417 /* Inside pushdecl_namespace_level, we will push into the
8418 current namespace. However, the friend function should go
8419 into the namespace of the template. */
8420 ns
= decl_namespace_context (new_friend
);
8421 push_nested_namespace (ns
);
8422 old_decl
= pushdecl_namespace_level (new_friend
, /*is_friend=*/true);
8423 pop_nested_namespace (ns
);
8425 if (old_decl
== error_mark_node
)
8426 return error_mark_node
;
8428 if (old_decl
!= new_friend
)
8430 /* This new friend declaration matched an existing
8431 declaration. For example, given:
8433 template <class T> void f(T);
8434 template <class U> class C {
8435 template <class T> friend void f(T) {}
8438 the friend declaration actually provides the definition
8439 of `f', once C has been instantiated for some type. So,
8440 old_decl will be the out-of-class template declaration,
8441 while new_friend is the in-class definition.
8443 But, if `f' was called before this point, the
8444 instantiation of `f' will have DECL_TI_ARGS corresponding
8445 to `T' but not to `U', references to which might appear
8446 in the definition of `f'. Previously, the most general
8447 template for an instantiation of `f' was the out-of-class
8448 version; now it is the in-class version. Therefore, we
8449 run through all specialization of `f', adding to their
8450 DECL_TI_ARGS appropriately. In particular, they need a
8451 new set of outer arguments, corresponding to the
8452 arguments for this class instantiation.
8454 The same situation can arise with something like this:
8457 template <class T> class C {
8461 when `C<int>' is instantiated. Now, `f(int)' is defined
8464 if (!new_friend_is_defn
)
8465 /* On the other hand, if the in-class declaration does
8466 *not* provide a definition, then we don't want to alter
8467 existing definitions. We can just leave everything
8472 tree new_template
= TI_TEMPLATE (new_friend_template_info
);
8473 tree new_args
= TI_ARGS (new_friend_template_info
);
8475 /* Overwrite whatever template info was there before, if
8476 any, with the new template information pertaining to
8478 DECL_TEMPLATE_INFO (old_decl
) = new_friend_template_info
;
8480 if (TREE_CODE (old_decl
) != TEMPLATE_DECL
)
8482 /* We should have called reregister_specialization in
8484 gcc_assert (retrieve_specialization (new_template
,
8488 /* Instantiate it if the global has already been used. */
8489 if (DECL_ODR_USED (old_decl
))
8490 instantiate_decl (old_decl
, /*defer_ok=*/true,
8491 /*expl_inst_class_mem_p=*/false);
8497 /* Indicate that the old function template is a partial
8499 DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (old_decl
))
8500 = new_friend_result_template_info
;
8502 gcc_assert (new_template
8503 == most_general_template (new_template
));
8504 gcc_assert (new_template
!= old_decl
);
8506 /* Reassign any specializations already in the hash table
8507 to the new more general template, and add the
8508 additional template args. */
8509 for (t
= DECL_TEMPLATE_INSTANTIATIONS (old_decl
);
8513 tree spec
= TREE_VALUE (t
);
8516 elt
.tmpl
= old_decl
;
8517 elt
.args
= DECL_TI_ARGS (spec
);
8518 elt
.spec
= NULL_TREE
;
8520 htab_remove_elt (decl_specializations
, &elt
);
8523 = add_outermost_template_args (new_args
,
8524 DECL_TI_ARGS (spec
));
8526 register_specialization
8527 (spec
, new_template
, DECL_TI_ARGS (spec
), true, 0);
8530 DECL_TEMPLATE_INSTANTIATIONS (old_decl
) = NULL_TREE
;
8534 /* The information from NEW_FRIEND has been merged into OLD_DECL
8535 by duplicate_decls. */
8536 new_friend
= old_decl
;
8541 tree context
= DECL_CONTEXT (new_friend
);
8545 template <class T> class C {
8546 template <class U> friend void C1<U>::f (); // case 1
8547 friend void C2<T>::f (); // case 2
8549 we only need to make sure CONTEXT is a complete type for
8550 case 2. To distinguish between the two cases, we note that
8551 CONTEXT of case 1 remains dependent type after tsubst while
8552 this isn't true for case 2. */
8553 ++processing_template_decl
;
8554 dependent_p
= dependent_type_p (context
);
8555 --processing_template_decl
;
8558 && !complete_type_or_else (context
, NULL_TREE
))
8559 return error_mark_node
;
8561 if (COMPLETE_TYPE_P (context
))
8563 tree fn
= new_friend
;
8564 /* do_friend adds the TEMPLATE_DECL for any member friend
8565 template even if it isn't a member template, i.e.
8566 template <class T> friend A<T>::f();
8567 Look through it in that case. */
8568 if (TREE_CODE (fn
) == TEMPLATE_DECL
8569 && !PRIMARY_TEMPLATE_P (fn
))
8570 fn
= DECL_TEMPLATE_RESULT (fn
);
8571 /* Check to see that the declaration is really present, and,
8572 possibly obtain an improved declaration. */
8573 fn
= check_classfn (context
, fn
, NULL_TREE
);
8583 /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of
8584 template arguments, as for tsubst.
8586 Returns an appropriate tsubst'd friend type or error_mark_node on
8590 tsubst_friend_class (tree friend_tmpl
, tree args
)
8596 if (DECL_TEMPLATE_TEMPLATE_PARM_P (friend_tmpl
))
8598 tree t
= tsubst (TREE_TYPE (friend_tmpl
), args
, tf_none
, NULL_TREE
);
8599 return TREE_TYPE (t
);
8602 context
= CP_DECL_CONTEXT (friend_tmpl
);
8604 if (context
!= global_namespace
)
8606 if (TREE_CODE (context
) == NAMESPACE_DECL
)
8607 push_nested_namespace (context
);
8609 push_nested_class (tsubst (context
, args
, tf_none
, NULL_TREE
));
8612 /* Look for a class template declaration. We look for hidden names
8613 because two friend declarations of the same template are the
8614 same. For example, in:
8617 template <typename> friend class F;
8619 template <typename> struct B {
8620 template <typename> friend class F;
8623 both F templates are the same. */
8624 tmpl
= lookup_name_real (DECL_NAME (friend_tmpl
), 0, 0,
8625 /*block_p=*/true, 0, LOOKUP_HIDDEN
);
8627 /* But, if we don't find one, it might be because we're in a
8628 situation like this:
8636 Here, in the scope of (say) S<int>, `S' is bound to a TYPE_DECL
8637 for `S<int>', not the TEMPLATE_DECL. */
8638 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
8640 tmpl
= lookup_name_prefer_type (DECL_NAME (friend_tmpl
), 1);
8641 tmpl
= maybe_get_template_decl_from_type_decl (tmpl
);
8644 if (tmpl
&& DECL_CLASS_TEMPLATE_P (tmpl
))
8646 /* The friend template has already been declared. Just
8647 check to see that the declarations match, and install any new
8648 default parameters. We must tsubst the default parameters,
8649 of course. We only need the innermost template parameters
8650 because that is all that redeclare_class_template will look
8652 if (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (friend_tmpl
))
8653 > TMPL_ARGS_DEPTH (args
))
8656 location_t saved_input_location
;
8657 parms
= tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_tmpl
),
8658 args
, tf_warning_or_error
);
8660 saved_input_location
= input_location
;
8661 input_location
= DECL_SOURCE_LOCATION (friend_tmpl
);
8662 redeclare_class_template (TREE_TYPE (tmpl
), parms
);
8663 input_location
= saved_input_location
;
8667 friend_type
= TREE_TYPE (tmpl
);
8671 /* The friend template has not already been declared. In this
8672 case, the instantiation of the template class will cause the
8673 injection of this template into the global scope. */
8674 tmpl
= tsubst (friend_tmpl
, args
, tf_warning_or_error
, NULL_TREE
);
8675 if (tmpl
== error_mark_node
)
8676 return error_mark_node
;
8678 /* The new TMPL is not an instantiation of anything, so we
8679 forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE for
8680 the new type because that is supposed to be the corresponding
8681 template decl, i.e., TMPL. */
8682 DECL_USE_TEMPLATE (tmpl
) = 0;
8683 DECL_TEMPLATE_INFO (tmpl
) = NULL_TREE
;
8684 CLASSTYPE_USE_TEMPLATE (TREE_TYPE (tmpl
)) = 0;
8685 CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl
))
8686 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl
)));
8688 /* Inject this template into the global scope. */
8689 friend_type
= TREE_TYPE (pushdecl_top_level_maybe_friend (tmpl
, true));
8692 if (context
!= global_namespace
)
8694 if (TREE_CODE (context
) == NAMESPACE_DECL
)
8695 pop_nested_namespace (context
);
8697 pop_nested_class ();
8703 /* Returns zero if TYPE cannot be completed later due to circularity.
8704 Otherwise returns one. */
8707 can_complete_type_without_circularity (tree type
)
8709 if (type
== NULL_TREE
|| type
== error_mark_node
)
8711 else if (COMPLETE_TYPE_P (type
))
8713 else if (TREE_CODE (type
) == ARRAY_TYPE
&& TYPE_DOMAIN (type
))
8714 return can_complete_type_without_circularity (TREE_TYPE (type
));
8715 else if (CLASS_TYPE_P (type
)
8716 && TYPE_BEING_DEFINED (TYPE_MAIN_VARIANT (type
)))
8722 static tree
tsubst_omp_clauses (tree
, bool, tree
, tsubst_flags_t
, tree
);
8724 /* Apply any attributes which had to be deferred until instantiation
8725 time. DECL_P, ATTRIBUTES and ATTR_FLAGS are as cplus_decl_attributes;
8726 ARGS, COMPLAIN, IN_DECL are as tsubst. */
8729 apply_late_template_attributes (tree
*decl_p
, tree attributes
, int attr_flags
,
8730 tree args
, tsubst_flags_t complain
, tree in_decl
)
8732 tree last_dep
= NULL_TREE
;
8736 for (t
= attributes
; t
; t
= TREE_CHAIN (t
))
8737 if (ATTR_IS_DEPENDENT (t
))
8740 attributes
= copy_list (attributes
);
8744 if (DECL_P (*decl_p
))
8746 if (TREE_TYPE (*decl_p
) == error_mark_node
)
8748 p
= &DECL_ATTRIBUTES (*decl_p
);
8751 p
= &TYPE_ATTRIBUTES (*decl_p
);
8755 tree late_attrs
= NULL_TREE
;
8756 tree
*q
= &late_attrs
;
8758 for (*p
= attributes
; *p
; )
8761 if (ATTR_IS_DEPENDENT (t
))
8763 *p
= TREE_CHAIN (t
);
8764 TREE_CHAIN (t
) = NULL_TREE
;
8765 if ((flag_openmp
|| flag_cilkplus
)
8766 && is_attribute_p ("omp declare simd",
8767 get_attribute_name (t
))
8770 tree clauses
= TREE_VALUE (TREE_VALUE (t
));
8771 clauses
= tsubst_omp_clauses (clauses
, true, args
,
8773 c_omp_declare_simd_clauses_to_decls (*decl_p
, clauses
);
8774 clauses
= finish_omp_clauses (clauses
);
8775 tree parms
= DECL_ARGUMENTS (*decl_p
);
8777 = c_omp_declare_simd_clauses_to_numbers (parms
, clauses
);
8779 TREE_VALUE (TREE_VALUE (t
)) = clauses
;
8781 TREE_VALUE (t
) = NULL_TREE
;
8783 /* If the first attribute argument is an identifier, don't
8784 pass it through tsubst. Attributes like mode, format,
8785 cleanup and several target specific attributes expect it
8787 else if (attribute_takes_identifier_p (get_attribute_name (t
))
8791 = tsubst_expr (TREE_CHAIN (TREE_VALUE (t
)), args
, complain
,
8793 /*integral_constant_expression_p=*/false);
8794 if (chain
!= TREE_CHAIN (TREE_VALUE (t
)))
8796 = tree_cons (NULL_TREE
, TREE_VALUE (TREE_VALUE (t
)),
8801 = tsubst_expr (TREE_VALUE (t
), args
, complain
, in_decl
,
8802 /*integral_constant_expression_p=*/false);
8804 q
= &TREE_CHAIN (t
);
8807 p
= &TREE_CHAIN (t
);
8810 cplus_decl_attributes (decl_p
, late_attrs
, attr_flags
);
8814 /* Perform (or defer) access check for typedefs that were referenced
8815 from within the template TMPL code.
8816 This is a subroutine of instantiate_decl and instantiate_class_template.
8817 TMPL is the template to consider and TARGS is the list of arguments of
8821 perform_typedefs_access_check (tree tmpl
, tree targs
)
8823 location_t saved_location
;
8825 qualified_typedef_usage_t
*iter
;
8828 || (!CLASS_TYPE_P (tmpl
)
8829 && TREE_CODE (tmpl
) != FUNCTION_DECL
))
8832 saved_location
= input_location
;
8833 FOR_EACH_VEC_SAFE_ELT (get_types_needing_access_check (tmpl
), i
, iter
)
8835 tree type_decl
= iter
->typedef_decl
;
8836 tree type_scope
= iter
->context
;
8838 if (!type_decl
|| !type_scope
|| !CLASS_TYPE_P (type_scope
))
8841 if (uses_template_parms (type_decl
))
8842 type_decl
= tsubst (type_decl
, targs
, tf_error
, NULL_TREE
);
8843 if (uses_template_parms (type_scope
))
8844 type_scope
= tsubst (type_scope
, targs
, tf_error
, NULL_TREE
);
8846 /* Make access check error messages point to the location
8847 of the use of the typedef. */
8848 input_location
= iter
->locus
;
8849 perform_or_defer_access_check (TYPE_BINFO (type_scope
),
8850 type_decl
, type_decl
,
8851 tf_warning_or_error
);
8853 input_location
= saved_location
;
8857 instantiate_class_template_1 (tree type
)
8859 tree templ
, args
, pattern
, t
, member
;
8863 unsigned int saved_maximum_field_alignment
;
8866 if (type
== error_mark_node
)
8867 return error_mark_node
;
8869 if (COMPLETE_OR_OPEN_TYPE_P (type
)
8870 || uses_template_parms (type
))
8873 /* Figure out which template is being instantiated. */
8874 templ
= most_general_template (CLASSTYPE_TI_TEMPLATE (type
));
8875 gcc_assert (TREE_CODE (templ
) == TEMPLATE_DECL
);
8877 /* Determine what specialization of the original template to
8879 t
= most_specialized_class (type
, tf_warning_or_error
);
8880 if (t
== error_mark_node
)
8882 TYPE_BEING_DEFINED (type
) = 1;
8883 return error_mark_node
;
8887 /* This TYPE is actually an instantiation of a partial
8888 specialization. We replace the innermost set of ARGS with
8889 the arguments appropriate for substitution. For example,
8892 template <class T> struct S {};
8893 template <class T> struct S<T*> {};
8895 and supposing that we are instantiating S<int*>, ARGS will
8896 presently be {int*} -- but we need {int}. */
8897 pattern
= TREE_TYPE (t
);
8898 args
= TREE_PURPOSE (t
);
8902 pattern
= TREE_TYPE (templ
);
8903 args
= CLASSTYPE_TI_ARGS (type
);
8906 /* If the template we're instantiating is incomplete, then clearly
8907 there's nothing we can do. */
8908 if (!COMPLETE_TYPE_P (pattern
))
8911 /* If we've recursively instantiated too many templates, stop. */
8912 if (! push_tinst_level (type
))
8915 /* Now we're really doing the instantiation. Mark the type as in
8916 the process of being defined. */
8917 TYPE_BEING_DEFINED (type
) = 1;
8919 /* We may be in the middle of deferred access check. Disable
8921 push_deferring_access_checks (dk_no_deferred
);
8923 fn_context
= decl_function_context (TYPE_MAIN_DECL (type
));
8925 push_to_top_level ();
8926 /* Use #pragma pack from the template context. */
8927 saved_maximum_field_alignment
= maximum_field_alignment
;
8928 maximum_field_alignment
= TYPE_PRECISION (pattern
);
8930 SET_CLASSTYPE_INTERFACE_UNKNOWN (type
);
8932 /* Set the input location to the most specialized template definition.
8933 This is needed if tsubsting causes an error. */
8934 typedecl
= TYPE_MAIN_DECL (pattern
);
8935 input_location
= DECL_SOURCE_LOCATION (TYPE_NAME (type
)) =
8936 DECL_SOURCE_LOCATION (typedecl
);
8938 TYPE_PACKED (type
) = TYPE_PACKED (pattern
);
8939 TYPE_ALIGN (type
) = TYPE_ALIGN (pattern
);
8940 TYPE_USER_ALIGN (type
) = TYPE_USER_ALIGN (pattern
);
8941 TYPE_FOR_JAVA (type
) = TYPE_FOR_JAVA (pattern
); /* For libjava's JArray<T> */
8942 if (ANON_AGGR_TYPE_P (pattern
))
8943 SET_ANON_AGGR_TYPE_P (type
);
8944 if (CLASSTYPE_VISIBILITY_SPECIFIED (pattern
))
8946 CLASSTYPE_VISIBILITY_SPECIFIED (type
) = 1;
8947 CLASSTYPE_VISIBILITY (type
) = CLASSTYPE_VISIBILITY (pattern
);
8948 /* Adjust visibility for template arguments. */
8949 determine_visibility (TYPE_MAIN_DECL (type
));
8951 if (CLASS_TYPE_P (type
))
8952 CLASSTYPE_FINAL (type
) = CLASSTYPE_FINAL (pattern
);
8954 pbinfo
= TYPE_BINFO (pattern
);
8956 /* We should never instantiate a nested class before its enclosing
8957 class; we need to look up the nested class by name before we can
8958 instantiate it, and that lookup should instantiate the enclosing
8960 gcc_assert (!DECL_CLASS_SCOPE_P (TYPE_MAIN_DECL (pattern
))
8961 || COMPLETE_OR_OPEN_TYPE_P (TYPE_CONTEXT (type
)));
8963 base_list
= NULL_TREE
;
8964 if (BINFO_N_BASE_BINFOS (pbinfo
))
8970 /* We must enter the scope containing the type, as that is where
8971 the accessibility of types named in dependent bases are
8973 pushed_scope
= push_scope (CP_TYPE_CONTEXT (type
));
8975 /* Substitute into each of the bases to determine the actual
8977 for (i
= 0; BINFO_BASE_ITERATE (pbinfo
, i
, pbase_binfo
); i
++)
8980 tree access
= BINFO_BASE_ACCESS (pbinfo
, i
);
8981 tree expanded_bases
= NULL_TREE
;
8984 if (PACK_EXPANSION_P (BINFO_TYPE (pbase_binfo
)))
8987 tsubst_pack_expansion (BINFO_TYPE (pbase_binfo
),
8988 args
, tf_error
, NULL_TREE
);
8989 if (expanded_bases
== error_mark_node
)
8992 len
= TREE_VEC_LENGTH (expanded_bases
);
8995 for (idx
= 0; idx
< len
; idx
++)
8998 /* Extract the already-expanded base class. */
8999 base
= TREE_VEC_ELT (expanded_bases
, idx
);
9001 /* Substitute to figure out the base class. */
9002 base
= tsubst (BINFO_TYPE (pbase_binfo
), args
, tf_error
,
9005 if (base
== error_mark_node
)
9008 base_list
= tree_cons (access
, base
, base_list
);
9009 if (BINFO_VIRTUAL_P (pbase_binfo
))
9010 TREE_TYPE (base_list
) = integer_type_node
;
9014 /* The list is now in reverse order; correct that. */
9015 base_list
= nreverse (base_list
);
9018 pop_scope (pushed_scope
);
9020 /* Now call xref_basetypes to set up all the base-class
9022 xref_basetypes (type
, base_list
);
9024 apply_late_template_attributes (&type
, TYPE_ATTRIBUTES (pattern
),
9025 (int) ATTR_FLAG_TYPE_IN_PLACE
,
9026 args
, tf_error
, NULL_TREE
);
9027 fixup_attribute_variants (type
);
9029 /* Now that our base classes are set up, enter the scope of the
9030 class, so that name lookups into base classes, etc. will work
9031 correctly. This is precisely analogous to what we do in
9032 begin_class_definition when defining an ordinary non-template
9033 class, except we also need to push the enclosing classes. */
9034 push_nested_class (type
);
9036 /* Now members are processed in the order of declaration. */
9037 for (member
= CLASSTYPE_DECL_LIST (pattern
);
9038 member
; member
= TREE_CHAIN (member
))
9040 tree t
= TREE_VALUE (member
);
9042 if (TREE_PURPOSE (member
))
9046 /* Build new CLASSTYPE_NESTED_UTDS. */
9049 bool class_template_p
;
9051 class_template_p
= (TREE_CODE (t
) != ENUMERAL_TYPE
9052 && TYPE_LANG_SPECIFIC (t
)
9053 && CLASSTYPE_IS_TEMPLATE (t
));
9054 /* If the member is a class template, then -- even after
9055 substitution -- there may be dependent types in the
9056 template argument list for the class. We increment
9057 PROCESSING_TEMPLATE_DECL so that dependent_type_p, as
9058 that function will assume that no types are dependent
9059 when outside of a template. */
9060 if (class_template_p
)
9061 ++processing_template_decl
;
9062 newtag
= tsubst (t
, args
, tf_error
, NULL_TREE
);
9063 if (class_template_p
)
9064 --processing_template_decl
;
9065 if (newtag
== error_mark_node
)
9068 if (TREE_CODE (newtag
) != ENUMERAL_TYPE
)
9070 tree name
= TYPE_IDENTIFIER (t
);
9072 if (class_template_p
)
9073 /* Unfortunately, lookup_template_class sets
9074 CLASSTYPE_IMPLICIT_INSTANTIATION for a partial
9075 instantiation (i.e., for the type of a member
9076 template class nested within a template class.)
9077 This behavior is required for
9078 maybe_process_partial_specialization to work
9079 correctly, but is not accurate in this case;
9080 the TAG is not an instantiation of anything.
9081 (The corresponding TEMPLATE_DECL is an
9082 instantiation, but the TYPE is not.) */
9083 CLASSTYPE_USE_TEMPLATE (newtag
) = 0;
9085 /* Now, we call pushtag to put this NEWTAG into the scope of
9086 TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid
9087 pushtag calling push_template_decl. We don't have to do
9088 this for enums because it will already have been done in
9091 SET_IDENTIFIER_TYPE_VALUE (name
, newtag
);
9092 pushtag (name
, newtag
, /*tag_scope=*/ts_current
);
9095 else if (DECL_DECLARES_FUNCTION_P (t
))
9097 /* Build new TYPE_METHODS. */
9100 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9101 ++processing_template_decl
;
9102 r
= tsubst (t
, args
, tf_error
, NULL_TREE
);
9103 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9104 --processing_template_decl
;
9105 set_current_access_from_decl (r
);
9106 finish_member_declaration (r
);
9107 /* Instantiate members marked with attribute used. */
9108 if (r
!= error_mark_node
&& DECL_PRESERVE_P (r
))
9110 if (TREE_CODE (r
) == FUNCTION_DECL
9111 && DECL_OMP_DECLARE_REDUCTION_P (r
))
9112 cp_check_omp_declare_reduction (r
);
9116 /* Build new TYPE_FIELDS. */
9117 if (TREE_CODE (t
) == STATIC_ASSERT
)
9121 ++c_inhibit_evaluation_warnings
;
9123 tsubst_expr (STATIC_ASSERT_CONDITION (t
), args
,
9124 tf_warning_or_error
, NULL_TREE
,
9125 /*integral_constant_expression_p=*/true);
9126 --c_inhibit_evaluation_warnings
;
9128 finish_static_assert (condition
,
9129 STATIC_ASSERT_MESSAGE (t
),
9130 STATIC_ASSERT_SOURCE_LOCATION (t
),
9133 else if (TREE_CODE (t
) != CONST_DECL
)
9136 tree vec
= NULL_TREE
;
9139 /* The file and line for this declaration, to
9140 assist in error message reporting. Since we
9141 called push_tinst_level above, we don't need to
9143 input_location
= DECL_SOURCE_LOCATION (t
);
9145 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9146 ++processing_template_decl
;
9147 r
= tsubst (t
, args
, tf_warning_or_error
, NULL_TREE
);
9148 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9149 --processing_template_decl
;
9151 if (TREE_CODE (r
) == TREE_VEC
)
9153 /* A capture pack became multiple fields. */
9155 len
= TREE_VEC_LENGTH (vec
);
9158 for (int i
= 0; i
< len
; ++i
)
9161 r
= TREE_VEC_ELT (vec
, i
);
9166 [t]he initialization (and any associated
9167 side-effects) of a static data member does
9168 not occur unless the static data member is
9169 itself used in a way that requires the
9170 definition of the static data member to
9173 Therefore, we do not substitute into the
9174 initialized for the static data member here. */
9175 finish_static_data_member_decl
9178 /*init_const_expr_p=*/false,
9179 /*asmspec_tree=*/NULL_TREE
,
9181 /* Instantiate members marked with attribute used. */
9182 if (r
!= error_mark_node
&& DECL_PRESERVE_P (r
))
9185 else if (TREE_CODE (r
) == FIELD_DECL
)
9187 /* Determine whether R has a valid type and can be
9188 completed later. If R is invalid, then its type
9189 is replaced by error_mark_node. */
9190 tree rtype
= TREE_TYPE (r
);
9191 if (can_complete_type_without_circularity (rtype
))
9192 complete_type (rtype
);
9194 if (!COMPLETE_TYPE_P (rtype
))
9196 cxx_incomplete_type_error (r
, rtype
);
9197 TREE_TYPE (r
) = error_mark_node
;
9201 /* If it is a TYPE_DECL for a class-scoped ENUMERAL_TYPE,
9202 such a thing will already have been added to the field
9203 list by tsubst_enum in finish_member_declaration in the
9204 CLASSTYPE_NESTED_UTDS case above. */
9205 if (!(TREE_CODE (r
) == TYPE_DECL
9206 && TREE_CODE (TREE_TYPE (r
)) == ENUMERAL_TYPE
9207 && DECL_ARTIFICIAL (r
)))
9209 set_current_access_from_decl (r
);
9210 finish_member_declaration (r
);
9218 if (TYPE_P (t
) || DECL_CLASS_TEMPLATE_P (t
)
9219 || DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
9221 /* Build new CLASSTYPE_FRIEND_CLASSES. */
9223 tree friend_type
= t
;
9224 bool adjust_processing_template_decl
= false;
9226 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
9228 /* template <class T> friend class C; */
9229 friend_type
= tsubst_friend_class (friend_type
, args
);
9230 adjust_processing_template_decl
= true;
9232 else if (TREE_CODE (friend_type
) == UNBOUND_CLASS_TEMPLATE
)
9234 /* template <class T> friend class C::D; */
9235 friend_type
= tsubst (friend_type
, args
,
9236 tf_warning_or_error
, NULL_TREE
);
9237 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
9238 friend_type
= TREE_TYPE (friend_type
);
9239 adjust_processing_template_decl
= true;
9241 else if (TREE_CODE (friend_type
) == TYPENAME_TYPE
9242 || TREE_CODE (friend_type
) == TEMPLATE_TYPE_PARM
)
9244 /* This could be either
9248 when dependent_type_p is false or
9250 template <class U> friend class T::C;
9253 friend_type
= tsubst (friend_type
, args
,
9254 tf_warning_or_error
, NULL_TREE
);
9255 /* Bump processing_template_decl for correct
9256 dependent_type_p calculation. */
9257 ++processing_template_decl
;
9258 if (dependent_type_p (friend_type
))
9259 adjust_processing_template_decl
= true;
9260 --processing_template_decl
;
9262 else if (!CLASSTYPE_USE_TEMPLATE (friend_type
)
9263 && hidden_name_p (TYPE_NAME (friend_type
)))
9267 where C hasn't been declared yet. Let's lookup name
9268 from namespace scope directly, bypassing any name that
9269 come from dependent base class. */
9270 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (friend_type
));
9272 /* The call to xref_tag_from_type does injection for friend
9274 push_nested_namespace (ns
);
9276 xref_tag_from_type (friend_type
, NULL_TREE
,
9277 /*tag_scope=*/ts_current
);
9278 pop_nested_namespace (ns
);
9280 else if (uses_template_parms (friend_type
))
9281 /* friend class C<T>; */
9282 friend_type
= tsubst (friend_type
, args
,
9283 tf_warning_or_error
, NULL_TREE
);
9288 where C is already declared or
9290 friend class C<int>;
9292 We don't have to do anything in these cases. */
9294 if (adjust_processing_template_decl
)
9295 /* Trick make_friend_class into realizing that the friend
9296 we're adding is a template, not an ordinary class. It's
9297 important that we use make_friend_class since it will
9298 perform some error-checking and output cross-reference
9300 ++processing_template_decl
;
9302 if (friend_type
!= error_mark_node
)
9303 make_friend_class (type
, friend_type
, /*complain=*/false);
9305 if (adjust_processing_template_decl
)
9306 --processing_template_decl
;
9310 /* Build new DECL_FRIENDLIST. */
9313 /* The file and line for this declaration, to
9314 assist in error message reporting. Since we
9315 called push_tinst_level above, we don't need to
9317 input_location
= DECL_SOURCE_LOCATION (t
);
9319 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9321 ++processing_template_decl
;
9322 push_deferring_access_checks (dk_no_check
);
9325 r
= tsubst_friend_function (t
, args
);
9326 add_friend (type
, r
, /*complain=*/false);
9327 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9329 pop_deferring_access_checks ();
9330 --processing_template_decl
;
9336 if (tree expr
= CLASSTYPE_LAMBDA_EXPR (type
))
9338 tree decl
= lambda_function (type
);
9341 if (!DECL_TEMPLATE_INFO (decl
)
9342 || DECL_TEMPLATE_RESULT (DECL_TI_TEMPLATE (decl
)) != decl
)
9343 instantiate_decl (decl
, false, false);
9345 /* We need to instantiate the capture list from the template
9346 after we've instantiated the closure members, but before we
9347 consider adding the conversion op. Also keep any captures
9348 that may have been added during instantiation of the op(). */
9349 tree tmpl_expr
= CLASSTYPE_LAMBDA_EXPR (pattern
);
9351 = tsubst_copy_and_build (LAMBDA_EXPR_CAPTURE_LIST (tmpl_expr
),
9352 args
, tf_warning_or_error
, NULL_TREE
,
9355 LAMBDA_EXPR_CAPTURE_LIST (expr
)
9356 = chainon (tmpl_cap
, nreverse (LAMBDA_EXPR_CAPTURE_LIST (expr
)));
9358 maybe_add_lambda_conv_op (type
);
9361 gcc_assert (errorcount
);
9364 /* Set the file and line number information to whatever is given for
9365 the class itself. This puts error messages involving generated
9366 implicit functions at a predictable point, and the same point
9367 that would be used for non-template classes. */
9368 input_location
= DECL_SOURCE_LOCATION (typedecl
);
9370 unreverse_member_declarations (type
);
9371 finish_struct_1 (type
);
9372 TYPE_BEING_DEFINED (type
) = 0;
9374 /* We don't instantiate default arguments for member functions. 14.7.1:
9376 The implicit instantiation of a class template specialization causes
9377 the implicit instantiation of the declarations, but not of the
9378 definitions or default arguments, of the class member functions,
9379 member classes, static data members and member templates.... */
9381 /* Some typedefs referenced from within the template code need to be access
9382 checked at template instantiation time, i.e now. These types were
9383 added to the template at parsing time. Let's get those and perform
9384 the access checks then. */
9385 perform_typedefs_access_check (pattern
, args
);
9386 perform_deferred_access_checks (tf_warning_or_error
);
9387 pop_nested_class ();
9388 maximum_field_alignment
= saved_maximum_field_alignment
;
9390 pop_from_top_level ();
9391 pop_deferring_access_checks ();
9394 /* The vtable for a template class can be emitted in any translation
9395 unit in which the class is instantiated. When there is no key
9396 method, however, finish_struct_1 will already have added TYPE to
9397 the keyed_classes list. */
9398 if (TYPE_CONTAINS_VPTR_P (type
) && CLASSTYPE_KEY_METHOD (type
))
9399 keyed_classes
= tree_cons (NULL_TREE
, type
, keyed_classes
);
9404 /* Wrapper for instantiate_class_template_1. */
9407 instantiate_class_template (tree type
)
9410 timevar_push (TV_TEMPLATE_INST
);
9411 ret
= instantiate_class_template_1 (type
);
9412 timevar_pop (TV_TEMPLATE_INST
);
9417 tsubst_template_arg (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
9423 else if (TYPE_P (t
))
9424 r
= tsubst (t
, args
, complain
, in_decl
);
9427 if (!(complain
& tf_warning
))
9428 ++c_inhibit_evaluation_warnings
;
9429 r
= tsubst_expr (t
, args
, complain
, in_decl
,
9430 /*integral_constant_expression_p=*/true);
9431 if (!(complain
& tf_warning
))
9432 --c_inhibit_evaluation_warnings
;
9437 /* Given a function parameter pack TMPL_PARM and some function parameters
9438 instantiated from it at *SPEC_P, return a NONTYPE_ARGUMENT_PACK of them
9439 and set *SPEC_P to point at the next point in the list. */
9442 extract_fnparm_pack (tree tmpl_parm
, tree
*spec_p
)
9444 /* Collect all of the extra "packed" parameters into an
9448 tree argpack
= make_node (NONTYPE_ARGUMENT_PACK
);
9449 tree argtypepack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
9450 tree spec_parm
= *spec_p
;
9453 for (len
= 0; spec_parm
; ++len
, spec_parm
= TREE_CHAIN (spec_parm
))
9455 && !function_parameter_expanded_from_pack_p (spec_parm
, tmpl_parm
))
9458 /* Fill in PARMVEC and PARMTYPEVEC with all of the parameters. */
9459 parmvec
= make_tree_vec (len
);
9460 parmtypevec
= make_tree_vec (len
);
9461 spec_parm
= *spec_p
;
9462 for (i
= 0; i
< len
; i
++, spec_parm
= DECL_CHAIN (spec_parm
))
9464 TREE_VEC_ELT (parmvec
, i
) = spec_parm
;
9465 TREE_VEC_ELT (parmtypevec
, i
) = TREE_TYPE (spec_parm
);
9468 /* Build the argument packs. */
9469 SET_ARGUMENT_PACK_ARGS (argpack
, parmvec
);
9470 SET_ARGUMENT_PACK_ARGS (argtypepack
, parmtypevec
);
9471 TREE_TYPE (argpack
) = argtypepack
;
9472 *spec_p
= spec_parm
;
9477 /* Give a chain SPEC_PARM of PARM_DECLs, pack them into a
9478 NONTYPE_ARGUMENT_PACK. */
9481 make_fnparm_pack (tree spec_parm
)
9483 return extract_fnparm_pack (NULL_TREE
, &spec_parm
);
9486 /* Return true iff the Ith element of the argument pack ARG_PACK is a
9490 argument_pack_element_is_expansion_p (tree arg_pack
, int i
)
9492 tree vec
= ARGUMENT_PACK_ARGS (arg_pack
);
9493 if (i
>= TREE_VEC_LENGTH (vec
))
9495 return PACK_EXPANSION_P (TREE_VEC_ELT (vec
, i
));
9499 /* Creates and return an ARGUMENT_PACK_SELECT tree node. */
9502 make_argument_pack_select (tree arg_pack
, unsigned index
)
9504 tree aps
= make_node (ARGUMENT_PACK_SELECT
);
9506 ARGUMENT_PACK_SELECT_FROM_PACK (aps
) = arg_pack
;
9507 ARGUMENT_PACK_SELECT_INDEX (aps
) = index
;
9512 /* This is a subroutine of tsubst_pack_expansion.
9514 It returns TRUE if we need to use the PACK_EXPANSION_EXTRA_ARGS
9515 mechanism to store the (non complete list of) arguments of the
9516 substitution and return a non substituted pack expansion, in order
9517 to wait for when we have enough arguments to really perform the
9521 use_pack_expansion_extra_args_p (tree parm_packs
,
9525 /* If one pack has an expansion and another pack has a normal
9526 argument or if one pack has an empty argument and an another
9527 one hasn't then tsubst_pack_expansion cannot perform the
9528 substitution and need to fall back on the
9529 PACK_EXPANSION_EXTRA mechanism. */
9530 if (parm_packs
== NULL_TREE
)
9532 else if (has_empty_arg
)
9535 bool has_expansion_arg
= false;
9536 for (int i
= 0 ; i
< arg_pack_len
; ++i
)
9538 bool has_non_expansion_arg
= false;
9539 for (tree parm_pack
= parm_packs
;
9541 parm_pack
= TREE_CHAIN (parm_pack
))
9543 tree arg
= TREE_VALUE (parm_pack
);
9545 if (argument_pack_element_is_expansion_p (arg
, i
))
9546 has_expansion_arg
= true;
9548 has_non_expansion_arg
= true;
9551 if (has_expansion_arg
&& has_non_expansion_arg
)
9557 /* [temp.variadic]/6 says that:
9559 The instantiation of a pack expansion [...]
9560 produces a list E1,E2, ..., En, where N is the number of elements
9561 in the pack expansion parameters.
9563 This subroutine of tsubst_pack_expansion produces one of these Ei.
9565 PATTERN is the pattern of the pack expansion. PARM_PACKS is a
9566 TREE_LIST in which each TREE_PURPOSE is a parameter pack of
9567 PATTERN, and each TREE_VALUE is its corresponding argument pack.
9568 INDEX is the index 'i' of the element Ei to produce. ARGS,
9569 COMPLAIN, and IN_DECL are the same parameters as for the
9570 tsubst_pack_expansion function.
9572 The function returns the resulting Ei upon successful completion,
9575 Note that this function possibly modifies the ARGS parameter, so
9576 it's the responsibility of the caller to restore it. */
9579 gen_elem_of_pack_expansion_instantiation (tree pattern
,
9582 tree args
/* This parm gets
9584 tsubst_flags_t complain
,
9588 bool ith_elem_is_expansion
= false;
9590 /* For each parameter pack, change the substitution of the parameter
9591 pack to the ith argument in its argument pack, then expand the
9593 for (tree pack
= parm_packs
; pack
; pack
= TREE_CHAIN (pack
))
9595 tree parm
= TREE_PURPOSE (pack
);
9596 tree arg_pack
= TREE_VALUE (pack
);
9597 tree aps
; /* instance of ARGUMENT_PACK_SELECT. */
9599 ith_elem_is_expansion
|=
9600 argument_pack_element_is_expansion_p (arg_pack
, index
);
9602 /* Select the Ith argument from the pack. */
9603 if (TREE_CODE (parm
) == PARM_DECL
9604 || TREE_CODE (parm
) == FIELD_DECL
)
9608 aps
= make_argument_pack_select (arg_pack
, index
);
9610 register_local_specialization (aps
, parm
);
9613 aps
= retrieve_local_specialization (parm
);
9618 template_parm_level_and_index (parm
, &level
, &idx
);
9622 aps
= make_argument_pack_select (arg_pack
, index
);
9623 /* Update the corresponding argument. */
9624 TMPL_ARG (args
, level
, idx
) = aps
;
9627 /* Re-use the ARGUMENT_PACK_SELECT. */
9628 aps
= TMPL_ARG (args
, level
, idx
);
9630 ARGUMENT_PACK_SELECT_INDEX (aps
) = index
;
9633 /* Substitute into the PATTERN with the (possibly altered)
9635 if (pattern
== in_decl
)
9636 /* Expanding a fixed parameter pack from
9637 coerce_template_parameter_pack. */
9638 t
= tsubst_decl (pattern
, args
, complain
);
9639 else if (!TYPE_P (pattern
))
9640 t
= tsubst_expr (pattern
, args
, complain
, in_decl
,
9641 /*integral_constant_expression_p=*/false);
9643 t
= tsubst (pattern
, args
, complain
, in_decl
);
9645 /* If the Ith argument pack element is a pack expansion, then
9646 the Ith element resulting from the substituting is going to
9647 be a pack expansion as well. */
9648 if (ith_elem_is_expansion
)
9649 t
= make_pack_expansion (t
);
9654 /* Substitute ARGS into T, which is an pack expansion
9655 (i.e. TYPE_PACK_EXPANSION or EXPR_PACK_EXPANSION). Returns a
9656 TREE_VEC with the substituted arguments, a PACK_EXPANSION_* node
9657 (if only a partial substitution could be performed) or
9658 ERROR_MARK_NODE if there was an error. */
9660 tsubst_pack_expansion (tree t
, tree args
, tsubst_flags_t complain
,
9664 tree pack
, packs
= NULL_TREE
;
9665 bool unsubstituted_packs
= false;
9668 struct pointer_map_t
*saved_local_specializations
= NULL
;
9669 bool need_local_specializations
= false;
9672 gcc_assert (PACK_EXPANSION_P (t
));
9673 pattern
= PACK_EXPANSION_PATTERN (t
);
9675 /* Add in any args remembered from an earlier partial instantiation. */
9676 args
= add_to_template_args (PACK_EXPANSION_EXTRA_ARGS (t
), args
);
9678 levels
= TMPL_ARGS_DEPTH (args
);
9680 /* Determine the argument packs that will instantiate the parameter
9681 packs used in the expansion expression. While we're at it,
9682 compute the number of arguments to be expanded and make sure it
9684 for (pack
= PACK_EXPANSION_PARAMETER_PACKS (t
); pack
;
9685 pack
= TREE_CHAIN (pack
))
9687 tree parm_pack
= TREE_VALUE (pack
);
9688 tree arg_pack
= NULL_TREE
;
9689 tree orig_arg
= NULL_TREE
;
9692 if (TREE_CODE (parm_pack
) == BASES
)
9694 if (BASES_DIRECT (parm_pack
))
9695 return calculate_direct_bases (tsubst_expr (BASES_TYPE (parm_pack
),
9696 args
, complain
, in_decl
, false));
9698 return calculate_bases (tsubst_expr (BASES_TYPE (parm_pack
),
9699 args
, complain
, in_decl
, false));
9701 if (TREE_CODE (parm_pack
) == PARM_DECL
)
9703 if (PACK_EXPANSION_LOCAL_P (t
))
9704 arg_pack
= retrieve_local_specialization (parm_pack
);
9707 /* We can't rely on local_specializations for a parameter
9708 name used later in a function declaration (such as in a
9709 late-specified return type). Even if it exists, it might
9710 have the wrong value for a recursive call. Just make a
9711 dummy decl, since it's only used for its type. */
9712 arg_pack
= tsubst_decl (parm_pack
, args
, complain
);
9713 if (arg_pack
&& DECL_PACK_P (arg_pack
))
9714 /* Partial instantiation of the parm_pack, we can't build
9715 up an argument pack yet. */
9716 arg_pack
= NULL_TREE
;
9718 arg_pack
= make_fnparm_pack (arg_pack
);
9719 need_local_specializations
= true;
9722 else if (TREE_CODE (parm_pack
) == FIELD_DECL
)
9723 arg_pack
= tsubst_copy (parm_pack
, args
, complain
, in_decl
);
9727 template_parm_level_and_index (parm_pack
, &level
, &idx
);
9729 if (level
<= levels
)
9730 arg_pack
= TMPL_ARG (args
, level
, idx
);
9733 orig_arg
= arg_pack
;
9734 if (arg_pack
&& TREE_CODE (arg_pack
) == ARGUMENT_PACK_SELECT
)
9735 arg_pack
= ARGUMENT_PACK_SELECT_FROM_PACK (arg_pack
);
9737 if (arg_pack
&& !ARGUMENT_PACK_P (arg_pack
))
9738 /* This can only happen if we forget to expand an argument
9739 pack somewhere else. Just return an error, silently. */
9741 result
= make_tree_vec (1);
9742 TREE_VEC_ELT (result
, 0) = error_mark_node
;
9749 TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg_pack
));
9751 /* Don't bother trying to do a partial substitution with
9752 incomplete packs; we'll try again after deduction. */
9753 if (ARGUMENT_PACK_INCOMPLETE_P (arg_pack
))
9758 else if (len
!= my_len
)
9760 if (!(complain
& tf_error
))
9761 /* Fail quietly. */;
9762 else if (TREE_CODE (t
) == TYPE_PACK_EXPANSION
)
9763 error ("mismatched argument pack lengths while expanding "
9767 error ("mismatched argument pack lengths while expanding "
9770 return error_mark_node
;
9773 /* Keep track of the parameter packs and their corresponding
9775 packs
= tree_cons (parm_pack
, arg_pack
, packs
);
9776 TREE_TYPE (packs
) = orig_arg
;
9780 /* We can't substitute for this parameter pack. We use a flag as
9781 well as the missing_level counter because function parameter
9782 packs don't have a level. */
9783 unsubstituted_packs
= true;
9787 /* We cannot expand this expansion expression, because we don't have
9788 all of the argument packs we need. */
9789 if (use_pack_expansion_extra_args_p (packs
, len
, unsubstituted_packs
))
9791 /* We got some full packs, but we can't substitute them in until we
9792 have values for all the packs. So remember these until then. */
9794 t
= make_pack_expansion (pattern
);
9795 PACK_EXPANSION_EXTRA_ARGS (t
) = args
;
9798 else if (unsubstituted_packs
)
9800 /* There were no real arguments, we're just replacing a parameter
9801 pack with another version of itself. Substitute into the
9802 pattern and return a PACK_EXPANSION_*. The caller will need to
9804 if (TREE_CODE (t
) == EXPR_PACK_EXPANSION
)
9805 t
= tsubst_expr (pattern
, args
, complain
, in_decl
,
9806 /*integral_constant_expression_p=*/false);
9808 t
= tsubst (pattern
, args
, complain
, in_decl
);
9809 t
= make_pack_expansion (t
);
9813 gcc_assert (len
>= 0);
9815 if (need_local_specializations
)
9817 /* We're in a late-specified return type, so create our own local
9818 specializations map; the current map is either NULL or (in the
9819 case of recursive unification) might have bindings that we don't
9820 want to use or alter. */
9821 saved_local_specializations
= local_specializations
;
9822 local_specializations
= pointer_map_create ();
9825 /* For each argument in each argument pack, substitute into the
9827 result
= make_tree_vec (len
);
9828 for (i
= 0; i
< len
; ++i
)
9830 t
= gen_elem_of_pack_expansion_instantiation (pattern
, packs
,
9834 TREE_VEC_ELT (result
, i
) = t
;
9835 if (t
== error_mark_node
)
9837 result
= error_mark_node
;
9842 /* Update ARGS to restore the substitution from parameter packs to
9843 their argument packs. */
9844 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
9846 tree parm
= TREE_PURPOSE (pack
);
9848 if (TREE_CODE (parm
) == PARM_DECL
9849 || TREE_CODE (parm
) == FIELD_DECL
)
9850 register_local_specialization (TREE_TYPE (pack
), parm
);
9855 if (TREE_VALUE (pack
) == NULL_TREE
)
9858 template_parm_level_and_index (parm
, &level
, &idx
);
9860 /* Update the corresponding argument. */
9861 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
9862 TREE_VEC_ELT (TREE_VEC_ELT (args
, level
-1 ), idx
) =
9865 TREE_VEC_ELT (args
, idx
) = TREE_TYPE (pack
);
9869 if (need_local_specializations
)
9871 pointer_map_destroy (local_specializations
);
9872 local_specializations
= saved_local_specializations
;
9878 /* Given PARM_DECL PARM, find the corresponding PARM_DECL in the template
9879 TMPL. We do this using DECL_PARM_INDEX, which should work even with
9880 parameter packs; all parms generated from a function parameter pack will
9881 have the same DECL_PARM_INDEX. */
9884 get_pattern_parm (tree parm
, tree tmpl
)
9886 tree pattern
= DECL_TEMPLATE_RESULT (tmpl
);
9889 if (DECL_ARTIFICIAL (parm
))
9891 for (patparm
= DECL_ARGUMENTS (pattern
);
9892 patparm
; patparm
= DECL_CHAIN (patparm
))
9893 if (DECL_ARTIFICIAL (patparm
)
9894 && DECL_NAME (parm
) == DECL_NAME (patparm
))
9899 patparm
= FUNCTION_FIRST_USER_PARM (DECL_TEMPLATE_RESULT (tmpl
));
9900 patparm
= chain_index (DECL_PARM_INDEX (parm
)-1, patparm
);
9901 gcc_assert (DECL_PARM_INDEX (patparm
)
9902 == DECL_PARM_INDEX (parm
));
9908 /* Substitute ARGS into the vector or list of template arguments T. */
9911 tsubst_template_args (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
9914 int len
, need_new
= 0, i
, expanded_len_adjust
= 0, out
;
9917 if (t
== error_mark_node
)
9918 return error_mark_node
;
9920 len
= TREE_VEC_LENGTH (t
);
9921 elts
= XALLOCAVEC (tree
, len
);
9923 for (i
= 0; i
< len
; i
++)
9925 tree orig_arg
= TREE_VEC_ELT (t
, i
);
9928 if (TREE_CODE (orig_arg
) == TREE_VEC
)
9929 new_arg
= tsubst_template_args (orig_arg
, args
, complain
, in_decl
);
9930 else if (PACK_EXPANSION_P (orig_arg
))
9932 /* Substitute into an expansion expression. */
9933 new_arg
= tsubst_pack_expansion (orig_arg
, args
, complain
, in_decl
);
9935 if (TREE_CODE (new_arg
) == TREE_VEC
)
9936 /* Add to the expanded length adjustment the number of
9937 expanded arguments. We subtract one from this
9938 measurement, because the argument pack expression
9939 itself is already counted as 1 in
9940 LEN. EXPANDED_LEN_ADJUST can actually be negative, if
9941 the argument pack is empty. */
9942 expanded_len_adjust
+= TREE_VEC_LENGTH (new_arg
) - 1;
9944 else if (ARGUMENT_PACK_P (orig_arg
))
9946 /* Substitute into each of the arguments. */
9947 new_arg
= TYPE_P (orig_arg
)
9948 ? cxx_make_type (TREE_CODE (orig_arg
))
9949 : make_node (TREE_CODE (orig_arg
));
9951 SET_ARGUMENT_PACK_ARGS (
9953 tsubst_template_args (ARGUMENT_PACK_ARGS (orig_arg
),
9954 args
, complain
, in_decl
));
9956 if (ARGUMENT_PACK_ARGS (new_arg
) == error_mark_node
)
9957 new_arg
= error_mark_node
;
9959 if (TREE_CODE (new_arg
) == NONTYPE_ARGUMENT_PACK
) {
9960 TREE_TYPE (new_arg
) = tsubst (TREE_TYPE (orig_arg
), args
,
9962 TREE_CONSTANT (new_arg
) = TREE_CONSTANT (orig_arg
);
9964 if (TREE_TYPE (new_arg
) == error_mark_node
)
9965 new_arg
= error_mark_node
;
9969 new_arg
= tsubst_template_arg (orig_arg
, args
, complain
, in_decl
);
9971 if (new_arg
== error_mark_node
)
9972 return error_mark_node
;
9975 if (new_arg
!= orig_arg
)
9982 /* Make space for the expanded arguments coming from template
9984 t
= make_tree_vec (len
+ expanded_len_adjust
);
9985 /* ORIG_T can contain TREE_VECs. That happens if ORIG_T contains the
9986 arguments for a member template.
9987 In that case each TREE_VEC in ORIG_T represents a level of template
9988 arguments, and ORIG_T won't carry any non defaulted argument count.
9989 It will rather be the nested TREE_VECs that will carry one.
9990 In other words, ORIG_T carries a non defaulted argument count only
9991 if it doesn't contain any nested TREE_VEC. */
9992 if (NON_DEFAULT_TEMPLATE_ARGS_COUNT (orig_t
))
9994 int count
= GET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (orig_t
);
9995 count
+= expanded_len_adjust
;
9996 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (t
, count
);
9998 for (i
= 0, out
= 0; i
< len
; i
++)
10000 if ((PACK_EXPANSION_P (TREE_VEC_ELT (orig_t
, i
))
10001 || ARGUMENT_PACK_P (TREE_VEC_ELT (orig_t
, i
)))
10002 && TREE_CODE (elts
[i
]) == TREE_VEC
)
10006 /* Now expand the template argument pack "in place". */
10007 for (idx
= 0; idx
< TREE_VEC_LENGTH (elts
[i
]); idx
++, out
++)
10008 TREE_VEC_ELT (t
, out
) = TREE_VEC_ELT (elts
[i
], idx
);
10012 TREE_VEC_ELT (t
, out
) = elts
[i
];
10020 /* Return the result of substituting ARGS into the template parameters
10021 given by PARMS. If there are m levels of ARGS and m + n levels of
10022 PARMS, then the result will contain n levels of PARMS. For
10023 example, if PARMS is `template <class T> template <class U>
10024 template <T*, U, class V>' and ARGS is {{int}, {double}} then the
10025 result will be `template <int*, double, class V>'. */
10028 tsubst_template_parms (tree parms
, tree args
, tsubst_flags_t complain
)
10030 tree r
= NULL_TREE
;
10033 /* When substituting into a template, we must set
10034 PROCESSING_TEMPLATE_DECL as the template parameters may be
10035 dependent if they are based on one-another, and the dependency
10036 predicates are short-circuit outside of templates. */
10037 ++processing_template_decl
;
10039 for (new_parms
= &r
;
10040 parms
&& TMPL_PARMS_DEPTH (parms
) > TMPL_ARGS_DEPTH (args
);
10041 new_parms
= &(TREE_CHAIN (*new_parms
)),
10042 parms
= TREE_CHAIN (parms
))
10045 make_tree_vec (TREE_VEC_LENGTH (TREE_VALUE (parms
)));
10048 for (i
= 0; i
< TREE_VEC_LENGTH (new_vec
); ++i
)
10052 if (parms
== error_mark_node
)
10055 tuple
= TREE_VEC_ELT (TREE_VALUE (parms
), i
);
10057 if (tuple
== error_mark_node
)
10060 TREE_VEC_ELT (new_vec
, i
) =
10061 tsubst_template_parm (tuple
, args
, complain
);
10065 tree_cons (size_int (TMPL_PARMS_DEPTH (parms
)
10066 - TMPL_ARGS_DEPTH (args
)),
10067 new_vec
, NULL_TREE
);
10070 --processing_template_decl
;
10075 /* Return the result of substituting ARGS into one template parameter
10076 given by T. T Must be a TREE_LIST which TREE_VALUE is the template
10077 parameter and which TREE_PURPOSE is the default argument of the
10078 template parameter. */
10081 tsubst_template_parm (tree t
, tree args
, tsubst_flags_t complain
)
10083 tree default_value
, parm_decl
;
10085 if (args
== NULL_TREE
10087 || t
== error_mark_node
)
10090 gcc_assert (TREE_CODE (t
) == TREE_LIST
);
10092 default_value
= TREE_PURPOSE (t
);
10093 parm_decl
= TREE_VALUE (t
);
10095 parm_decl
= tsubst (parm_decl
, args
, complain
, NULL_TREE
);
10096 if (TREE_CODE (parm_decl
) == PARM_DECL
10097 && invalid_nontype_parm_type_p (TREE_TYPE (parm_decl
), complain
))
10098 parm_decl
= error_mark_node
;
10099 default_value
= tsubst_template_arg (default_value
, args
,
10100 complain
, NULL_TREE
);
10102 return build_tree_list (default_value
, parm_decl
);
10105 /* Substitute the ARGS into the indicated aggregate (or enumeration)
10106 type T. If T is not an aggregate or enumeration type, it is
10107 handled as if by tsubst. IN_DECL is as for tsubst. If
10108 ENTERING_SCOPE is nonzero, T is the context for a template which
10109 we are presently tsubst'ing. Return the substituted value. */
10112 tsubst_aggr_type (tree t
,
10114 tsubst_flags_t complain
,
10116 int entering_scope
)
10118 if (t
== NULL_TREE
)
10121 switch (TREE_CODE (t
))
10124 if (TYPE_PTRMEMFUNC_P (t
))
10125 return tsubst (TYPE_PTRMEMFUNC_FN_TYPE (t
), args
, complain
, in_decl
);
10127 /* Else fall through. */
10128 case ENUMERAL_TYPE
:
10130 if (TYPE_TEMPLATE_INFO (t
) && uses_template_parms (t
))
10135 int saved_unevaluated_operand
;
10136 int saved_inhibit_evaluation_warnings
;
10138 /* In "sizeof(X<I>)" we need to evaluate "I". */
10139 saved_unevaluated_operand
= cp_unevaluated_operand
;
10140 cp_unevaluated_operand
= 0;
10141 saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
10142 c_inhibit_evaluation_warnings
= 0;
10144 /* First, determine the context for the type we are looking
10146 context
= TYPE_CONTEXT (t
);
10147 if (context
&& TYPE_P (context
))
10149 context
= tsubst_aggr_type (context
, args
, complain
,
10150 in_decl
, /*entering_scope=*/1);
10151 /* If context is a nested class inside a class template,
10152 it may still need to be instantiated (c++/33959). */
10153 context
= complete_type (context
);
10156 /* Then, figure out what arguments are appropriate for the
10157 type we are trying to find. For example, given:
10159 template <class T> struct S;
10160 template <class T, class U> void f(T, U) { S<U> su; }
10162 and supposing that we are instantiating f<int, double>,
10163 then our ARGS will be {int, double}, but, when looking up
10164 S we only want {double}. */
10165 argvec
= tsubst_template_args (TYPE_TI_ARGS (t
), args
,
10166 complain
, in_decl
);
10167 if (argvec
== error_mark_node
)
10168 r
= error_mark_node
;
10171 r
= lookup_template_class (t
, argvec
, in_decl
, context
,
10172 entering_scope
, complain
);
10173 r
= cp_build_qualified_type_real (r
, cp_type_quals (t
), complain
);
10176 cp_unevaluated_operand
= saved_unevaluated_operand
;
10177 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
10182 /* This is not a template type, so there's nothing to do. */
10186 return tsubst (t
, args
, complain
, in_decl
);
10190 /* Substitute into the default argument ARG (a default argument for
10191 FN), which has the indicated TYPE. */
10194 tsubst_default_argument (tree fn
, tree type
, tree arg
, tsubst_flags_t complain
)
10196 tree saved_class_ptr
= NULL_TREE
;
10197 tree saved_class_ref
= NULL_TREE
;
10198 int errs
= errorcount
+ sorrycount
;
10200 /* This can happen in invalid code. */
10201 if (TREE_CODE (arg
) == DEFAULT_ARG
)
10204 /* This default argument came from a template. Instantiate the
10205 default argument here, not in tsubst. In the case of
10214 we must be careful to do name lookup in the scope of S<T>,
10215 rather than in the current class. */
10216 push_access_scope (fn
);
10217 /* The "this" pointer is not valid in a default argument. */
10220 saved_class_ptr
= current_class_ptr
;
10221 cp_function_chain
->x_current_class_ptr
= NULL_TREE
;
10222 saved_class_ref
= current_class_ref
;
10223 cp_function_chain
->x_current_class_ref
= NULL_TREE
;
10226 push_deferring_access_checks(dk_no_deferred
);
10227 /* The default argument expression may cause implicitly defined
10228 member functions to be synthesized, which will result in garbage
10229 collection. We must treat this situation as if we were within
10230 the body of function so as to avoid collecting live data on the
10233 arg
= tsubst_expr (arg
, DECL_TI_ARGS (fn
),
10234 complain
, NULL_TREE
,
10235 /*integral_constant_expression_p=*/false);
10237 pop_deferring_access_checks();
10239 /* Restore the "this" pointer. */
10242 cp_function_chain
->x_current_class_ptr
= saved_class_ptr
;
10243 cp_function_chain
->x_current_class_ref
= saved_class_ref
;
10246 if (errorcount
+sorrycount
> errs
10247 && (complain
& tf_warning_or_error
))
10248 inform (input_location
,
10249 " when instantiating default argument for call to %D", fn
);
10251 /* Make sure the default argument is reasonable. */
10252 arg
= check_default_argument (type
, arg
, complain
);
10254 pop_access_scope (fn
);
10259 /* Substitute into all the default arguments for FN. */
10262 tsubst_default_arguments (tree fn
, tsubst_flags_t complain
)
10267 tmpl_args
= DECL_TI_ARGS (fn
);
10269 /* If this function is not yet instantiated, we certainly don't need
10270 its default arguments. */
10271 if (uses_template_parms (tmpl_args
))
10273 /* Don't do this again for clones. */
10274 if (DECL_CLONED_FUNCTION_P (fn
))
10277 for (arg
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
10279 arg
= TREE_CHAIN (arg
))
10280 if (TREE_PURPOSE (arg
))
10281 TREE_PURPOSE (arg
) = tsubst_default_argument (fn
,
10283 TREE_PURPOSE (arg
),
10287 /* Substitute the ARGS into the T, which is a _DECL. Return the
10288 result of the substitution. Issue error and warning messages under
10289 control of COMPLAIN. */
10292 tsubst_decl (tree t
, tree args
, tsubst_flags_t complain
)
10294 #define RETURN(EXP) do { r = (EXP); goto out; } while(0)
10295 location_t saved_loc
;
10296 tree r
= NULL_TREE
;
10298 hashval_t hash
= 0;
10300 /* Set the filename and linenumber to improve error-reporting. */
10301 saved_loc
= input_location
;
10302 input_location
= DECL_SOURCE_LOCATION (t
);
10304 switch (TREE_CODE (t
))
10306 case TEMPLATE_DECL
:
10308 /* We can get here when processing a member function template,
10309 member class template, or template template parameter. */
10310 tree decl
= DECL_TEMPLATE_RESULT (t
);
10315 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
10317 /* Template template parameter is treated here. */
10318 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
10319 if (new_type
== error_mark_node
)
10320 RETURN (error_mark_node
);
10321 /* If we get a real template back, return it. This can happen in
10322 the context of most_specialized_class. */
10323 if (TREE_CODE (new_type
) == TEMPLATE_DECL
)
10327 DECL_CHAIN (r
) = NULL_TREE
;
10328 TREE_TYPE (r
) = new_type
;
10329 DECL_TEMPLATE_RESULT (r
)
10330 = build_decl (DECL_SOURCE_LOCATION (decl
),
10331 TYPE_DECL
, DECL_NAME (decl
), new_type
);
10332 DECL_TEMPLATE_PARMS (r
)
10333 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
,
10335 TYPE_NAME (new_type
) = r
;
10339 /* We might already have an instance of this template.
10340 The ARGS are for the surrounding class type, so the
10341 full args contain the tsubst'd args for the context,
10342 plus the innermost args from the template decl. */
10343 tmpl_args
= DECL_CLASS_TEMPLATE_P (t
)
10344 ? CLASSTYPE_TI_ARGS (TREE_TYPE (t
))
10345 : DECL_TI_ARGS (DECL_TEMPLATE_RESULT (t
));
10346 /* Because this is a template, the arguments will still be
10347 dependent, even after substitution. If
10348 PROCESSING_TEMPLATE_DECL is not set, the dependency
10349 predicates will short-circuit. */
10350 ++processing_template_decl
;
10351 full_args
= tsubst_template_args (tmpl_args
, args
,
10352 complain
, in_decl
);
10353 --processing_template_decl
;
10354 if (full_args
== error_mark_node
)
10355 RETURN (error_mark_node
);
10357 /* If this is a default template template argument,
10358 tsubst might not have changed anything. */
10359 if (full_args
== tmpl_args
)
10362 hash
= hash_tmpl_and_args (t
, full_args
);
10363 spec
= retrieve_specialization (t
, full_args
, hash
);
10364 if (spec
!= NULL_TREE
)
10370 /* Make a new template decl. It will be similar to the
10371 original, but will record the current template arguments.
10372 We also create a new function declaration, which is just
10373 like the old one, but points to this new template, rather
10374 than the old one. */
10376 gcc_assert (DECL_LANG_SPECIFIC (r
) != 0);
10377 DECL_CHAIN (r
) = NULL_TREE
;
10379 DECL_TEMPLATE_INFO (r
) = build_template_info (t
, args
);
10381 if (TREE_CODE (decl
) == TYPE_DECL
10382 && !TYPE_DECL_ALIAS_P (decl
))
10385 ++processing_template_decl
;
10386 new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
10387 --processing_template_decl
;
10388 if (new_type
== error_mark_node
)
10389 RETURN (error_mark_node
);
10391 TREE_TYPE (r
) = new_type
;
10392 /* For a partial specialization, we need to keep pointing to
10393 the primary template. */
10394 if (!DECL_TEMPLATE_SPECIALIZATION (t
))
10395 CLASSTYPE_TI_TEMPLATE (new_type
) = r
;
10396 DECL_TEMPLATE_RESULT (r
) = TYPE_MAIN_DECL (new_type
);
10397 DECL_TI_ARGS (r
) = CLASSTYPE_TI_ARGS (new_type
);
10398 DECL_CONTEXT (r
) = TYPE_CONTEXT (new_type
);
10403 ++processing_template_decl
;
10404 new_decl
= tsubst (decl
, args
, complain
, in_decl
);
10405 --processing_template_decl
;
10406 if (new_decl
== error_mark_node
)
10407 RETURN (error_mark_node
);
10409 DECL_TEMPLATE_RESULT (r
) = new_decl
;
10410 DECL_TI_TEMPLATE (new_decl
) = r
;
10411 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
10412 DECL_TI_ARGS (r
) = DECL_TI_ARGS (new_decl
);
10413 DECL_CONTEXT (r
) = DECL_CONTEXT (new_decl
);
10416 SET_DECL_IMPLICIT_INSTANTIATION (r
);
10417 DECL_TEMPLATE_INSTANTIATIONS (r
) = NULL_TREE
;
10418 DECL_TEMPLATE_SPECIALIZATIONS (r
) = NULL_TREE
;
10420 /* The template parameters for this new template are all the
10421 template parameters for the old template, except the
10422 outermost level of parameters. */
10423 DECL_TEMPLATE_PARMS (r
)
10424 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
,
10427 if (PRIMARY_TEMPLATE_P (t
))
10428 DECL_PRIMARY_TEMPLATE (r
) = r
;
10430 if (TREE_CODE (decl
) != TYPE_DECL
)
10431 /* Record this non-type partial instantiation. */
10432 register_specialization (r
, t
,
10433 DECL_TI_ARGS (DECL_TEMPLATE_RESULT (r
)),
10438 case FUNCTION_DECL
:
10441 tree argvec
= NULL_TREE
;
10449 /* Nobody should be tsubst'ing into non-template functions. */
10450 gcc_assert (DECL_TEMPLATE_INFO (t
) != NULL_TREE
);
10452 if (TREE_CODE (DECL_TI_TEMPLATE (t
)) == TEMPLATE_DECL
)
10457 /* If T is not dependent, just return it. We have to
10458 increment PROCESSING_TEMPLATE_DECL because
10459 value_dependent_expression_p assumes that nothing is
10460 dependent when PROCESSING_TEMPLATE_DECL is zero. */
10461 ++processing_template_decl
;
10462 dependent_p
= value_dependent_expression_p (t
);
10463 --processing_template_decl
;
10467 /* Calculate the most general template of which R is a
10468 specialization, and the complete set of arguments used to
10470 gen_tmpl
= most_general_template (DECL_TI_TEMPLATE (t
));
10471 argvec
= tsubst_template_args (DECL_TI_ARGS
10472 (DECL_TEMPLATE_RESULT
10473 (DECL_TI_TEMPLATE (t
))),
10474 args
, complain
, in_decl
);
10475 if (argvec
== error_mark_node
)
10476 RETURN (error_mark_node
);
10478 /* Check to see if we already have this specialization. */
10479 hash
= hash_tmpl_and_args (gen_tmpl
, argvec
);
10480 spec
= retrieve_specialization (gen_tmpl
, argvec
, hash
);
10488 /* We can see more levels of arguments than parameters if
10489 there was a specialization of a member template, like
10492 template <class T> struct S { template <class U> void f(); }
10493 template <> template <class U> void S<int>::f(U);
10495 Here, we'll be substituting into the specialization,
10496 because that's where we can find the code we actually
10497 want to generate, but we'll have enough arguments for
10498 the most general template.
10500 We also deal with the peculiar case:
10502 template <class T> struct S {
10503 template <class U> friend void f();
10505 template <class U> void f() {}
10507 template void f<double>();
10509 Here, the ARGS for the instantiation of will be {int,
10510 double}. But, we only need as many ARGS as there are
10511 levels of template parameters in CODE_PATTERN. We are
10512 careful not to get fooled into reducing the ARGS in
10515 template <class T> struct S { template <class U> void f(U); }
10516 template <class T> template <> void S<T>::f(int) {}
10518 which we can spot because the pattern will be a
10519 specialization in this case. */
10520 args_depth
= TMPL_ARGS_DEPTH (args
);
10522 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (t
)));
10523 if (args_depth
> parms_depth
10524 && !DECL_TEMPLATE_SPECIALIZATION (t
))
10525 args
= get_innermost_template_args (args
, parms_depth
);
10529 /* This special case arises when we have something like this:
10531 template <class T> struct S {
10532 friend void f<int>(int, double);
10535 Here, the DECL_TI_TEMPLATE for the friend declaration
10536 will be an IDENTIFIER_NODE. We are being called from
10537 tsubst_friend_function, and we want only to create a
10538 new decl (R) with appropriate types so that we can call
10539 determine_specialization. */
10540 gen_tmpl
= NULL_TREE
;
10543 if (DECL_CLASS_SCOPE_P (t
))
10545 if (DECL_NAME (t
) == constructor_name (DECL_CONTEXT (t
)))
10549 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
,
10550 complain
, t
, /*entering_scope=*/1);
10555 ctx
= DECL_CONTEXT (t
);
10557 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
10558 if (type
== error_mark_node
)
10559 RETURN (error_mark_node
);
10561 /* If we hit excessive deduction depth, the type is bogus even if
10562 it isn't error_mark_node, so don't build a decl. */
10563 if (excessive_deduction_depth
)
10564 RETURN (error_mark_node
);
10566 /* We do NOT check for matching decls pushed separately at this
10567 point, as they may not represent instantiations of this
10568 template, and in any case are considered separate under the
10571 DECL_USE_TEMPLATE (r
) = 0;
10572 TREE_TYPE (r
) = type
;
10573 /* Clear out the mangled name and RTL for the instantiation. */
10574 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
10575 SET_DECL_RTL (r
, NULL
);
10576 /* Leave DECL_INITIAL set on deleted instantiations. */
10577 if (!DECL_DELETED_FN (r
))
10578 DECL_INITIAL (r
) = NULL_TREE
;
10579 DECL_CONTEXT (r
) = ctx
;
10581 /* OpenMP UDRs have the only argument a reference to the declared
10582 type. We want to diagnose if the declared type is a reference,
10583 which is invalid, but as references to references are usually
10584 quietly merged, diagnose it here. */
10585 if (DECL_OMP_DECLARE_REDUCTION_P (t
))
10588 = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (t
))));
10589 argtype
= tsubst (argtype
, args
, complain
, in_decl
);
10590 if (TREE_CODE (argtype
) == REFERENCE_TYPE
)
10591 error_at (DECL_SOURCE_LOCATION (t
),
10592 "reference type %qT in "
10593 "%<#pragma omp declare reduction%>", argtype
);
10594 if (strchr (IDENTIFIER_POINTER (DECL_NAME (t
)), '~') == NULL
)
10595 DECL_NAME (r
) = omp_reduction_id (ERROR_MARK
, DECL_NAME (t
),
10599 if (member
&& DECL_CONV_FN_P (r
))
10600 /* Type-conversion operator. Reconstruct the name, in
10601 case it's the name of one of the template's parameters. */
10602 DECL_NAME (r
) = mangle_conv_op_name_for_type (TREE_TYPE (type
));
10604 DECL_ARGUMENTS (r
) = tsubst (DECL_ARGUMENTS (t
), args
,
10606 DECL_RESULT (r
) = NULL_TREE
;
10608 TREE_STATIC (r
) = 0;
10609 TREE_PUBLIC (r
) = TREE_PUBLIC (t
);
10610 DECL_EXTERNAL (r
) = 1;
10611 /* If this is an instantiation of a function with internal
10612 linkage, we already know what object file linkage will be
10613 assigned to the instantiation. */
10614 DECL_INTERFACE_KNOWN (r
) = !TREE_PUBLIC (r
);
10615 DECL_DEFER_OUTPUT (r
) = 0;
10616 DECL_CHAIN (r
) = NULL_TREE
;
10617 DECL_PENDING_INLINE_INFO (r
) = 0;
10618 DECL_PENDING_INLINE_P (r
) = 0;
10619 DECL_SAVED_TREE (r
) = NULL_TREE
;
10620 DECL_STRUCT_FUNCTION (r
) = NULL
;
10622 /* We'll re-clone as appropriate in instantiate_template. */
10623 DECL_CLONED_FUNCTION (r
) = NULL_TREE
;
10625 /* If we aren't complaining now, return on error before we register
10626 the specialization so that we'll complain eventually. */
10627 if ((complain
& tf_error
) == 0
10628 && IDENTIFIER_OPNAME_P (DECL_NAME (r
))
10629 && !grok_op_properties (r
, /*complain=*/false))
10630 RETURN (error_mark_node
);
10632 /* Set up the DECL_TEMPLATE_INFO for R. There's no need to do
10633 this in the special friend case mentioned above where
10634 GEN_TMPL is NULL. */
10637 DECL_TEMPLATE_INFO (r
)
10638 = build_template_info (gen_tmpl
, argvec
);
10639 SET_DECL_IMPLICIT_INSTANTIATION (r
);
10642 = register_specialization (r
, gen_tmpl
, argvec
, false, hash
);
10644 /* We instantiated this while substituting into
10645 the type earlier (template/friend54.C). */
10648 /* We're not supposed to instantiate default arguments
10649 until they are called, for a template. But, for a
10652 template <class T> void f ()
10653 { extern void g(int i = T()); }
10655 we should do the substitution when the template is
10656 instantiated. We handle the member function case in
10657 instantiate_class_template since the default arguments
10658 might refer to other members of the class. */
10660 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
10661 && !uses_template_parms (argvec
))
10662 tsubst_default_arguments (r
, complain
);
10665 DECL_TEMPLATE_INFO (r
) = NULL_TREE
;
10667 /* Copy the list of befriending classes. */
10668 for (friends
= &DECL_BEFRIENDING_CLASSES (r
);
10670 friends
= &TREE_CHAIN (*friends
))
10672 *friends
= copy_node (*friends
);
10673 TREE_VALUE (*friends
) = tsubst (TREE_VALUE (*friends
),
10678 if (DECL_CONSTRUCTOR_P (r
) || DECL_DESTRUCTOR_P (r
))
10680 maybe_retrofit_in_chrg (r
);
10681 if (DECL_CONSTRUCTOR_P (r
))
10682 grok_ctor_properties (ctx
, r
);
10683 if (DECL_INHERITED_CTOR_BASE (r
))
10684 deduce_inheriting_ctor (r
);
10685 /* If this is an instantiation of a member template, clone it.
10686 If it isn't, that'll be handled by
10687 clone_constructors_and_destructors. */
10688 if (PRIMARY_TEMPLATE_P (gen_tmpl
))
10689 clone_function_decl (r
, /*update_method_vec_p=*/0);
10691 else if ((complain
& tf_error
) != 0
10692 && IDENTIFIER_OPNAME_P (DECL_NAME (r
))
10693 && !grok_op_properties (r
, /*complain=*/true))
10694 RETURN (error_mark_node
);
10696 if (DECL_FRIEND_P (t
) && DECL_FRIEND_CONTEXT (t
))
10697 SET_DECL_FRIEND_CONTEXT (r
,
10698 tsubst (DECL_FRIEND_CONTEXT (t
),
10699 args
, complain
, in_decl
));
10701 /* Possibly limit visibility based on template args. */
10702 DECL_VISIBILITY (r
) = VISIBILITY_DEFAULT
;
10703 if (DECL_VISIBILITY_SPECIFIED (t
))
10705 DECL_VISIBILITY_SPECIFIED (r
) = 0;
10706 DECL_ATTRIBUTES (r
)
10707 = remove_attribute ("visibility", DECL_ATTRIBUTES (r
));
10709 determine_visibility (r
);
10710 if (DECL_DEFAULTED_OUTSIDE_CLASS_P (r
)
10711 && !processing_template_decl
)
10712 defaulted_late_check (r
);
10714 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
10715 args
, complain
, in_decl
);
10721 tree type
= NULL_TREE
;
10723 tree expanded_types
= NULL_TREE
;
10724 tree prev_r
= NULL_TREE
;
10725 tree first_r
= NULL_TREE
;
10727 if (DECL_PACK_P (t
))
10729 /* If there is a local specialization that isn't a
10730 parameter pack, it means that we're doing a "simple"
10731 substitution from inside tsubst_pack_expansion. Just
10732 return the local specialization (which will be a single
10734 tree spec
= retrieve_local_specialization (t
);
10736 && TREE_CODE (spec
) == PARM_DECL
10737 && TREE_CODE (TREE_TYPE (spec
)) != TYPE_PACK_EXPANSION
)
10740 /* Expand the TYPE_PACK_EXPANSION that provides the types for
10741 the parameters in this function parameter pack. */
10742 expanded_types
= tsubst_pack_expansion (TREE_TYPE (t
), args
,
10743 complain
, in_decl
);
10744 if (TREE_CODE (expanded_types
) == TREE_VEC
)
10746 len
= TREE_VEC_LENGTH (expanded_types
);
10748 /* Zero-length parameter packs are boring. Just substitute
10751 RETURN (tsubst (TREE_CHAIN (t
), args
, complain
,
10756 /* All we did was update the type. Make a note of that. */
10757 type
= expanded_types
;
10758 expanded_types
= NULL_TREE
;
10762 /* Loop through all of the parameters we'll build. When T is
10763 a function parameter pack, LEN is the number of expanded
10764 types in EXPANDED_TYPES; otherwise, LEN is 1. */
10766 for (i
= 0; i
< len
; ++i
)
10770 if (DECL_TEMPLATE_PARM_P (t
))
10771 SET_DECL_TEMPLATE_PARM_P (r
);
10773 if (expanded_types
)
10774 /* We're on the Ith parameter of the function parameter
10777 /* Get the Ith type. */
10778 type
= TREE_VEC_ELT (expanded_types
, i
);
10780 /* Rename the parameter to include the index. */
10782 = make_ith_pack_parameter_name (DECL_NAME (r
), i
);
10785 /* We're dealing with a normal parameter. */
10786 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
10788 type
= type_decays_to (type
);
10789 TREE_TYPE (r
) = type
;
10790 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
10792 if (DECL_INITIAL (r
))
10794 if (TREE_CODE (DECL_INITIAL (r
)) != TEMPLATE_PARM_INDEX
)
10795 DECL_INITIAL (r
) = TREE_TYPE (r
);
10797 DECL_INITIAL (r
) = tsubst (DECL_INITIAL (r
), args
,
10798 complain
, in_decl
);
10801 DECL_CONTEXT (r
) = NULL_TREE
;
10803 if (!DECL_TEMPLATE_PARM_P (r
))
10804 DECL_ARG_TYPE (r
) = type_passed_as (type
);
10806 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
10807 args
, complain
, in_decl
);
10809 /* Keep track of the first new parameter we
10810 generate. That's what will be returned to the
10815 /* Build a proper chain of parameters when substituting
10816 into a function parameter pack. */
10818 DECL_CHAIN (prev_r
) = r
;
10821 /* If cp_unevaluated_operand is set, we're just looking for a
10822 single dummy parameter, so don't keep going. */
10823 if (DECL_CHAIN (t
) && !cp_unevaluated_operand
)
10824 DECL_CHAIN (r
) = tsubst (DECL_CHAIN (t
), args
,
10825 complain
, DECL_CHAIN (t
));
10827 /* FIRST_R contains the start of the chain we've built. */
10834 tree type
= NULL_TREE
;
10835 tree vec
= NULL_TREE
;
10836 tree expanded_types
= NULL_TREE
;
10839 if (PACK_EXPANSION_P (TREE_TYPE (t
)))
10841 /* This field is a lambda capture pack. Return a TREE_VEC of
10842 the expanded fields to instantiate_class_template_1 and
10843 store them in the specializations hash table as a
10844 NONTYPE_ARGUMENT_PACK so that tsubst_copy can find them. */
10845 expanded_types
= tsubst_pack_expansion (TREE_TYPE (t
), args
,
10846 complain
, in_decl
);
10847 if (TREE_CODE (expanded_types
) == TREE_VEC
)
10849 len
= TREE_VEC_LENGTH (expanded_types
);
10850 vec
= make_tree_vec (len
);
10854 /* All we did was update the type. Make a note of that. */
10855 type
= expanded_types
;
10856 expanded_types
= NULL_TREE
;
10860 for (int i
= 0; i
< len
; ++i
)
10863 if (expanded_types
)
10865 type
= TREE_VEC_ELT (expanded_types
, i
);
10867 = make_ith_pack_parameter_name (DECL_NAME (r
), i
);
10870 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
10872 if (type
== error_mark_node
)
10873 RETURN (error_mark_node
);
10874 TREE_TYPE (r
) = type
;
10875 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
10877 if (DECL_C_BIT_FIELD (r
))
10878 /* For bit-fields, DECL_INITIAL gives the number of bits. For
10879 non-bit-fields DECL_INITIAL is a non-static data member
10880 initializer, which gets deferred instantiation. */
10882 = tsubst_expr (DECL_INITIAL (t
), args
,
10884 /*integral_constant_expression_p=*/true);
10885 else if (DECL_INITIAL (t
))
10887 /* Set up DECL_TEMPLATE_INFO so that we can get at the
10888 NSDMI in perform_member_init. Still set DECL_INITIAL
10889 so that we know there is one. */
10890 DECL_INITIAL (r
) = void_zero_node
;
10891 gcc_assert (DECL_LANG_SPECIFIC (r
) == NULL
);
10892 retrofit_lang_decl (r
);
10893 DECL_TEMPLATE_INFO (r
) = build_template_info (t
, args
);
10895 /* We don't have to set DECL_CONTEXT here; it is set by
10896 finish_member_declaration. */
10897 DECL_CHAIN (r
) = NULL_TREE
;
10899 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
10900 args
, complain
, in_decl
);
10903 TREE_VEC_ELT (vec
, i
) = r
;
10909 tree pack
= make_node (NONTYPE_ARGUMENT_PACK
);
10910 tree tpack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
10911 SET_ARGUMENT_PACK_ARGS (pack
, vec
);
10912 SET_ARGUMENT_PACK_ARGS (tpack
, expanded_types
);
10913 TREE_TYPE (pack
) = tpack
;
10914 register_specialization (pack
, t
, args
, false, 0);
10920 /* We reach here only for member using decls. We also need to check
10921 uses_template_parms because DECL_DEPENDENT_P is not set for a
10922 using-declaration that designates a member of the current
10923 instantiation (c++/53549). */
10924 if (DECL_DEPENDENT_P (t
)
10925 || uses_template_parms (USING_DECL_SCOPE (t
)))
10927 tree inst_scope
= tsubst_copy (USING_DECL_SCOPE (t
), args
,
10928 complain
, in_decl
);
10929 tree name
= tsubst_copy (DECL_NAME (t
), args
, complain
, in_decl
);
10930 r
= do_class_using_decl (inst_scope
, name
);
10932 r
= error_mark_node
;
10935 TREE_PROTECTED (r
) = TREE_PROTECTED (t
);
10936 TREE_PRIVATE (r
) = TREE_PRIVATE (t
);
10942 DECL_CHAIN (r
) = NULL_TREE
;
10949 tree argvec
= NULL_TREE
;
10950 tree gen_tmpl
= NULL_TREE
;
10952 tree tmpl
= NULL_TREE
;
10954 tree type
= NULL_TREE
;
10957 if (TREE_TYPE (t
) == error_mark_node
)
10958 RETURN (error_mark_node
);
10960 if (TREE_CODE (t
) == TYPE_DECL
10961 && t
== TYPE_MAIN_DECL (TREE_TYPE (t
)))
10963 /* If this is the canonical decl, we don't have to
10964 mess with instantiations, and often we can't (for
10965 typename, template type parms and such). Note that
10966 TYPE_NAME is not correct for the above test if
10967 we've copied the type for a typedef. */
10968 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
10969 if (type
== error_mark_node
)
10970 RETURN (error_mark_node
);
10971 r
= TYPE_NAME (type
);
10975 /* Check to see if we already have the specialization we
10978 if (DECL_CLASS_SCOPE_P (t
) || DECL_NAMESPACE_SCOPE_P (t
))
10980 /* T is a static data member or namespace-scope entity.
10981 We have to substitute into namespace-scope variables
10982 (even though such entities are never templates) because
10985 template <class T> void f() { extern T t; }
10987 where the entity referenced is not known until
10988 instantiation time. */
10990 ctx
= DECL_CONTEXT (t
);
10991 if (DECL_CLASS_SCOPE_P (t
))
10993 ctx
= tsubst_aggr_type (ctx
, args
,
10995 in_decl
, /*entering_scope=*/1);
10996 /* If CTX is unchanged, then T is in fact the
10997 specialization we want. That situation occurs when
10998 referencing a static data member within in its own
10999 class. We can use pointer equality, rather than
11000 same_type_p, because DECL_CONTEXT is always
11002 if (ctx
== DECL_CONTEXT (t
)
11003 && (TREE_CODE (t
) != TYPE_DECL
11004 /* ... unless T is a member template; in which
11005 case our caller can be willing to create a
11006 specialization of that template represented
11008 || !(DECL_TI_TEMPLATE (t
)
11009 && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (t
)))))
11015 tmpl
= DECL_TI_TEMPLATE (t
);
11016 gen_tmpl
= most_general_template (tmpl
);
11017 argvec
= tsubst (DECL_TI_ARGS (t
), args
, complain
, in_decl
);
11018 if (argvec
== error_mark_node
)
11019 RETURN (error_mark_node
);
11020 hash
= hash_tmpl_and_args (gen_tmpl
, argvec
);
11021 spec
= retrieve_specialization (gen_tmpl
, argvec
, hash
);
11026 /* A local variable. */
11028 /* Subsequent calls to pushdecl will fill this in. */
11030 spec
= retrieve_local_specialization (t
);
11032 /* If we already have the specialization we need, there is
11033 nothing more to do. */
11040 /* Create a new node for the specialization we need. */
11042 if (type
== NULL_TREE
)
11044 if (is_typedef_decl (t
))
11045 type
= DECL_ORIGINAL_TYPE (t
);
11047 type
= TREE_TYPE (t
);
11049 && VAR_HAD_UNKNOWN_BOUND (t
)
11050 && type
!= error_mark_node
)
11051 type
= strip_array_domain (type
);
11052 type
= tsubst (type
, args
, complain
, in_decl
);
11056 /* Even if the original location is out of scope, the
11057 newly substituted one is not. */
11058 DECL_DEAD_FOR_LOCAL (r
) = 0;
11059 DECL_INITIALIZED_P (r
) = 0;
11060 DECL_TEMPLATE_INSTANTIATED (r
) = 0;
11061 if (type
== error_mark_node
)
11062 RETURN (error_mark_node
);
11063 if (TREE_CODE (type
) == FUNCTION_TYPE
)
11065 /* It may seem that this case cannot occur, since:
11070 declares a function, not a variable. However:
11073 template <typename T> void g() { T t; }
11074 template void g<f>();
11076 is an attempt to declare a variable with function
11078 error ("variable %qD has function type",
11079 /* R is not yet sufficiently initialized, so we
11080 just use its name. */
11082 RETURN (error_mark_node
);
11084 type
= complete_type (type
);
11085 /* Wait until cp_finish_decl to set this again, to handle
11086 circular dependency (template/instantiate6.C). */
11087 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r
) = 0;
11088 type
= check_var_type (DECL_NAME (r
), type
);
11090 if (DECL_HAS_VALUE_EXPR_P (t
))
11092 tree ve
= DECL_VALUE_EXPR (t
);
11093 ve
= tsubst_expr (ve
, args
, complain
, in_decl
,
11094 /*constant_expression_p=*/false);
11095 if (REFERENCE_REF_P (ve
))
11097 gcc_assert (TREE_CODE (type
) == REFERENCE_TYPE
);
11098 ve
= TREE_OPERAND (ve
, 0);
11100 SET_DECL_VALUE_EXPR (r
, ve
);
11103 else if (DECL_SELF_REFERENCE_P (t
))
11104 SET_DECL_SELF_REFERENCE_P (r
);
11105 TREE_TYPE (r
) = type
;
11106 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
11107 DECL_CONTEXT (r
) = ctx
;
11108 /* Clear out the mangled name and RTL for the instantiation. */
11109 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
11110 if (CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_DECL_WRTL
))
11111 SET_DECL_RTL (r
, NULL
);
11112 /* The initializer must not be expanded until it is required;
11113 see [temp.inst]. */
11114 DECL_INITIAL (r
) = NULL_TREE
;
11115 if (CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_DECL_WRTL
))
11116 SET_DECL_RTL (r
, NULL
);
11117 DECL_SIZE (r
) = DECL_SIZE_UNIT (r
) = 0;
11120 /* Possibly limit visibility based on template args. */
11121 DECL_VISIBILITY (r
) = VISIBILITY_DEFAULT
;
11122 if (DECL_VISIBILITY_SPECIFIED (t
))
11124 DECL_VISIBILITY_SPECIFIED (r
) = 0;
11125 DECL_ATTRIBUTES (r
)
11126 = remove_attribute ("visibility", DECL_ATTRIBUTES (r
));
11128 determine_visibility (r
);
11133 /* A static data member declaration is always marked
11134 external when it is declared in-class, even if an
11135 initializer is present. We mimic the non-template
11136 processing here. */
11137 DECL_EXTERNAL (r
) = 1;
11139 register_specialization (r
, gen_tmpl
, argvec
, false, hash
);
11140 DECL_TEMPLATE_INFO (r
) = build_template_info (tmpl
, argvec
);
11141 SET_DECL_IMPLICIT_INSTANTIATION (r
);
11143 else if (!cp_unevaluated_operand
)
11144 register_local_specialization (r
, t
);
11146 DECL_CHAIN (r
) = NULL_TREE
;
11148 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
),
11150 args
, complain
, in_decl
);
11152 /* Preserve a typedef that names a type. */
11153 if (is_typedef_decl (r
))
11155 DECL_ORIGINAL_TYPE (r
) = NULL_TREE
;
11156 set_underlying_type (r
);
11159 layout_decl (r
, 0);
11164 gcc_unreachable ();
11169 /* Restore the file and line information. */
11170 input_location
= saved_loc
;
11175 /* Substitute into the ARG_TYPES of a function type.
11176 If END is a TREE_CHAIN, leave it and any following types
11180 tsubst_arg_types (tree arg_types
,
11183 tsubst_flags_t complain
,
11186 tree remaining_arg_types
;
11187 tree type
= NULL_TREE
;
11189 tree expanded_args
= NULL_TREE
;
11192 if (!arg_types
|| arg_types
== void_list_node
|| arg_types
== end
)
11195 remaining_arg_types
= tsubst_arg_types (TREE_CHAIN (arg_types
),
11196 args
, end
, complain
, in_decl
);
11197 if (remaining_arg_types
== error_mark_node
)
11198 return error_mark_node
;
11200 if (PACK_EXPANSION_P (TREE_VALUE (arg_types
)))
11202 /* For a pack expansion, perform substitution on the
11203 entire expression. Later on, we'll handle the arguments
11205 expanded_args
= tsubst_pack_expansion (TREE_VALUE (arg_types
),
11206 args
, complain
, in_decl
);
11208 if (TREE_CODE (expanded_args
) == TREE_VEC
)
11209 /* So that we'll spin through the parameters, one by one. */
11210 i
= TREE_VEC_LENGTH (expanded_args
);
11213 /* We only partially substituted into the parameter
11214 pack. Our type is TYPE_PACK_EXPANSION. */
11215 type
= expanded_args
;
11216 expanded_args
= NULL_TREE
;
11224 type
= TREE_VEC_ELT (expanded_args
, i
);
11226 type
= tsubst (TREE_VALUE (arg_types
), args
, complain
, in_decl
);
11228 if (type
== error_mark_node
)
11229 return error_mark_node
;
11230 if (VOID_TYPE_P (type
))
11232 if (complain
& tf_error
)
11234 error ("invalid parameter type %qT", type
);
11236 error ("in declaration %q+D", in_decl
);
11238 return error_mark_node
;
11241 if (abstract_virtuals_error_sfinae (ACU_PARM
, type
, complain
))
11242 return error_mark_node
;
11244 /* Do array-to-pointer, function-to-pointer conversion, and ignore
11245 top-level qualifiers as required. */
11246 type
= cv_unqualified (type_decays_to (type
));
11248 /* We do not substitute into default arguments here. The standard
11249 mandates that they be instantiated only when needed, which is
11250 done in build_over_call. */
11251 default_arg
= TREE_PURPOSE (arg_types
);
11253 if (default_arg
&& TREE_CODE (default_arg
) == DEFAULT_ARG
)
11255 /* We've instantiated a template before its default arguments
11256 have been parsed. This can happen for a nested template
11257 class, and is not an error unless we require the default
11258 argument in a call of this function. */
11259 remaining_arg_types
=
11260 tree_cons (default_arg
, type
, remaining_arg_types
);
11261 vec_safe_push (DEFARG_INSTANTIATIONS(default_arg
), remaining_arg_types
);
11264 remaining_arg_types
=
11265 hash_tree_cons (default_arg
, type
, remaining_arg_types
);
11268 return remaining_arg_types
;
11271 /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does
11272 *not* handle the exception-specification for FNTYPE, because the
11273 initial substitution of explicitly provided template parameters
11274 during argument deduction forbids substitution into the
11275 exception-specification:
11279 All references in the function type of the function template to the
11280 corresponding template parameters are replaced by the specified tem-
11281 plate argument values. If a substitution in a template parameter or
11282 in the function type of the function template results in an invalid
11283 type, type deduction fails. [Note: The equivalent substitution in
11284 exception specifications is done only when the function is instanti-
11285 ated, at which point a program is ill-formed if the substitution
11286 results in an invalid type.] */
11289 tsubst_function_type (tree t
,
11291 tsubst_flags_t complain
,
11298 /* The TYPE_CONTEXT is not used for function/method types. */
11299 gcc_assert (TYPE_CONTEXT (t
) == NULL_TREE
);
11301 /* Substitute the return type. */
11302 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11303 if (return_type
== error_mark_node
)
11304 return error_mark_node
;
11305 /* DR 486 clarifies that creation of a function type with an
11306 invalid return type is a deduction failure. */
11307 if (TREE_CODE (return_type
) == ARRAY_TYPE
11308 || TREE_CODE (return_type
) == FUNCTION_TYPE
)
11310 if (complain
& tf_error
)
11312 if (TREE_CODE (return_type
) == ARRAY_TYPE
)
11313 error ("function returning an array");
11315 error ("function returning a function");
11317 return error_mark_node
;
11320 if (abstract_virtuals_error_sfinae (ACU_RETURN
, return_type
, complain
))
11321 return error_mark_node
;
11323 /* Substitute the argument types. */
11324 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
, NULL_TREE
,
11325 complain
, in_decl
);
11326 if (arg_types
== error_mark_node
)
11327 return error_mark_node
;
11329 /* Construct a new type node and return it. */
11330 if (TREE_CODE (t
) == FUNCTION_TYPE
)
11332 fntype
= build_function_type (return_type
, arg_types
);
11333 fntype
= apply_memfn_quals (fntype
,
11334 type_memfn_quals (t
),
11335 type_memfn_rqual (t
));
11339 tree r
= TREE_TYPE (TREE_VALUE (arg_types
));
11340 /* Don't pick up extra function qualifiers from the basetype. */
11341 r
= cp_build_qualified_type_real (r
, type_memfn_quals (t
), complain
);
11342 if (! MAYBE_CLASS_TYPE_P (r
))
11346 Type deduction may fail for any of the following
11349 -- Attempting to create "pointer to member of T" when T
11350 is not a class type. */
11351 if (complain
& tf_error
)
11352 error ("creating pointer to member function of non-class type %qT",
11354 return error_mark_node
;
11357 fntype
= build_method_type_directly (r
, return_type
,
11358 TREE_CHAIN (arg_types
));
11359 fntype
= build_ref_qualified_type (fntype
, type_memfn_rqual (t
));
11361 fntype
= cp_build_type_attribute_variant (fntype
, TYPE_ATTRIBUTES (t
));
11366 /* FNTYPE is a FUNCTION_TYPE or METHOD_TYPE. Substitute the template
11367 ARGS into that specification, and return the substituted
11368 specification. If there is no specification, return NULL_TREE. */
11371 tsubst_exception_specification (tree fntype
,
11373 tsubst_flags_t complain
,
11380 specs
= TYPE_RAISES_EXCEPTIONS (fntype
);
11381 new_specs
= NULL_TREE
;
11382 if (specs
&& TREE_PURPOSE (specs
))
11384 /* A noexcept-specifier. */
11385 tree expr
= TREE_PURPOSE (specs
);
11386 if (TREE_CODE (expr
) == INTEGER_CST
)
11390 /* Defer instantiation of noexcept-specifiers to avoid
11391 excessive instantiations (c++/49107). */
11392 new_specs
= make_node (DEFERRED_NOEXCEPT
);
11393 if (DEFERRED_NOEXCEPT_SPEC_P (specs
))
11395 /* We already partially instantiated this member template,
11396 so combine the new args with the old. */
11397 DEFERRED_NOEXCEPT_PATTERN (new_specs
)
11398 = DEFERRED_NOEXCEPT_PATTERN (expr
);
11399 DEFERRED_NOEXCEPT_ARGS (new_specs
)
11400 = add_to_template_args (DEFERRED_NOEXCEPT_ARGS (expr
), args
);
11404 DEFERRED_NOEXCEPT_PATTERN (new_specs
) = expr
;
11405 DEFERRED_NOEXCEPT_ARGS (new_specs
) = args
;
11409 new_specs
= tsubst_copy_and_build
11410 (expr
, args
, complain
, in_decl
, /*function_p=*/false,
11411 /*integral_constant_expression_p=*/true);
11412 new_specs
= build_noexcept_spec (new_specs
, complain
);
11416 if (! TREE_VALUE (specs
))
11423 tree expanded_specs
= NULL_TREE
;
11425 if (PACK_EXPANSION_P (TREE_VALUE (specs
)))
11427 /* Expand the pack expansion type. */
11428 expanded_specs
= tsubst_pack_expansion (TREE_VALUE (specs
),
11432 if (expanded_specs
== error_mark_node
)
11433 return error_mark_node
;
11434 else if (TREE_CODE (expanded_specs
) == TREE_VEC
)
11435 len
= TREE_VEC_LENGTH (expanded_specs
);
11438 /* We're substituting into a member template, so
11439 we got a TYPE_PACK_EXPANSION back. Add that
11440 expansion and move on. */
11441 gcc_assert (TREE_CODE (expanded_specs
)
11442 == TYPE_PACK_EXPANSION
);
11443 new_specs
= add_exception_specifier (new_specs
,
11446 specs
= TREE_CHAIN (specs
);
11451 for (i
= 0; i
< len
; ++i
)
11453 if (expanded_specs
)
11454 spec
= TREE_VEC_ELT (expanded_specs
, i
);
11456 spec
= tsubst (TREE_VALUE (specs
), args
, complain
, in_decl
);
11457 if (spec
== error_mark_node
)
11459 new_specs
= add_exception_specifier (new_specs
, spec
,
11463 specs
= TREE_CHAIN (specs
);
11469 /* Take the tree structure T and replace template parameters used
11470 therein with the argument vector ARGS. IN_DECL is an associated
11471 decl for diagnostics. If an error occurs, returns ERROR_MARK_NODE.
11472 Issue error and warning messages under control of COMPLAIN. Note
11473 that we must be relatively non-tolerant of extensions here, in
11474 order to preserve conformance; if we allow substitutions that
11475 should not be allowed, we may allow argument deductions that should
11476 not succeed, and therefore report ambiguous overload situations
11477 where there are none. In theory, we could allow the substitution,
11478 but indicate that it should have failed, and allow our caller to
11479 make sure that the right thing happens, but we don't try to do this
11482 This function is used for dealing with types, decls and the like;
11483 for expressions, use tsubst_expr or tsubst_copy. */
11486 tsubst (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
11488 enum tree_code code
;
11489 tree type
, r
= NULL_TREE
;
11491 if (t
== NULL_TREE
|| t
== error_mark_node
11492 || t
== integer_type_node
11493 || t
== void_type_node
11494 || t
== char_type_node
11495 || t
== unknown_type_node
11496 || TREE_CODE (t
) == NAMESPACE_DECL
11497 || TREE_CODE (t
) == TRANSLATION_UNIT_DECL
)
11501 return tsubst_decl (t
, args
, complain
);
11503 if (args
== NULL_TREE
)
11506 code
= TREE_CODE (t
);
11508 if (code
== IDENTIFIER_NODE
)
11509 type
= IDENTIFIER_TYPE_VALUE (t
);
11511 type
= TREE_TYPE (t
);
11513 gcc_assert (type
!= unknown_type_node
);
11515 /* Reuse typedefs. We need to do this to handle dependent attributes,
11516 such as attribute aligned. */
11518 && typedef_variant_p (t
))
11520 tree decl
= TYPE_NAME (t
);
11522 if (alias_template_specialization_p (t
))
11524 /* DECL represents an alias template and we want to
11526 tree tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
11527 tree gen_args
= tsubst (DECL_TI_ARGS (decl
), args
, complain
, in_decl
);
11528 r
= instantiate_alias_template (tmpl
, gen_args
, complain
);
11530 else if (DECL_CLASS_SCOPE_P (decl
)
11531 && CLASSTYPE_TEMPLATE_INFO (DECL_CONTEXT (decl
))
11532 && uses_template_parms (DECL_CONTEXT (decl
)))
11534 tree tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
11535 tree gen_args
= tsubst (DECL_TI_ARGS (decl
), args
, complain
, in_decl
);
11536 r
= retrieve_specialization (tmpl
, gen_args
, 0);
11538 else if (DECL_FUNCTION_SCOPE_P (decl
)
11539 && DECL_TEMPLATE_INFO (DECL_CONTEXT (decl
))
11540 && uses_template_parms (DECL_TI_ARGS (DECL_CONTEXT (decl
))))
11541 r
= retrieve_local_specialization (decl
);
11543 /* The typedef is from a non-template context. */
11549 r
= cp_build_qualified_type_real
11550 (r
, cp_type_quals (t
) | cp_type_quals (r
),
11551 complain
| tf_ignore_bad_quals
);
11556 /* We don't have an instantiation yet, so drop the typedef. */
11557 int quals
= cp_type_quals (t
);
11558 t
= DECL_ORIGINAL_TYPE (decl
);
11559 t
= cp_build_qualified_type_real (t
, quals
,
11560 complain
| tf_ignore_bad_quals
);
11565 && code
!= TYPENAME_TYPE
11566 && code
!= TEMPLATE_TYPE_PARM
11567 && code
!= IDENTIFIER_NODE
11568 && code
!= FUNCTION_TYPE
11569 && code
!= METHOD_TYPE
)
11570 type
= tsubst (type
, args
, complain
, in_decl
);
11571 if (type
== error_mark_node
)
11572 return error_mark_node
;
11578 case ENUMERAL_TYPE
:
11579 return tsubst_aggr_type (t
, args
, complain
, in_decl
,
11580 /*entering_scope=*/0);
11583 case IDENTIFIER_NODE
:
11594 if (t
== integer_type_node
)
11597 if (TREE_CODE (TYPE_MIN_VALUE (t
)) == INTEGER_CST
11598 && TREE_CODE (TYPE_MAX_VALUE (t
)) == INTEGER_CST
)
11602 tree max
, omax
= TREE_OPERAND (TYPE_MAX_VALUE (t
), 0);
11604 max
= tsubst_expr (omax
, args
, complain
, in_decl
,
11605 /*integral_constant_expression_p=*/false);
11607 /* Fix up type of the magic NOP_EXPR with TREE_SIDE_EFFECTS if
11609 if (TREE_CODE (max
) == NOP_EXPR
11610 && TREE_SIDE_EFFECTS (omax
)
11611 && !TREE_TYPE (max
))
11612 TREE_TYPE (max
) = TREE_TYPE (TREE_OPERAND (max
, 0));
11614 /* If we're in a partial instantiation, preserve the magic NOP_EXPR
11615 with TREE_SIDE_EFFECTS that indicates this is not an integral
11616 constant expression. */
11617 if (processing_template_decl
11618 && TREE_SIDE_EFFECTS (omax
) && TREE_CODE (omax
) == NOP_EXPR
)
11620 gcc_assert (TREE_CODE (max
) == NOP_EXPR
);
11621 TREE_SIDE_EFFECTS (max
) = 1;
11624 return compute_array_index_type (NULL_TREE
, max
, complain
);
11627 case TEMPLATE_TYPE_PARM
:
11628 case TEMPLATE_TEMPLATE_PARM
:
11629 case BOUND_TEMPLATE_TEMPLATE_PARM
:
11630 case TEMPLATE_PARM_INDEX
:
11635 tree arg
= NULL_TREE
;
11639 gcc_assert (TREE_VEC_LENGTH (args
) > 0);
11640 template_parm_level_and_index (t
, &level
, &idx
);
11642 levels
= TMPL_ARGS_DEPTH (args
);
11643 if (level
<= levels
)
11645 arg
= TMPL_ARG (args
, level
, idx
);
11647 if (arg
&& TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
11649 /* See through ARGUMENT_PACK_SELECT arguments. */
11650 arg
= ARGUMENT_PACK_SELECT_ARG (arg
);
11651 /* If the selected argument is an expansion E, that most
11652 likely means we were called from
11653 gen_elem_of_pack_expansion_instantiation during the
11654 substituting of pack an argument pack (which Ith
11655 element is a pack expansion, where I is
11656 ARGUMENT_PACK_SELECT_INDEX) into a pack expansion.
11657 In this case, the Ith element resulting from this
11658 substituting is going to be a pack expansion, which
11659 pattern is the pattern of E. Let's return the
11661 gen_elem_of_pack_expansion_instantiation will
11662 build the resulting pack expansion from it. */
11663 if (PACK_EXPANSION_P (arg
))
11664 arg
= PACK_EXPANSION_PATTERN (arg
);
11668 if (arg
== error_mark_node
)
11669 return error_mark_node
;
11670 else if (arg
!= NULL_TREE
)
11672 if (ARGUMENT_PACK_P (arg
))
11673 /* If ARG is an argument pack, we don't actually want to
11674 perform a substitution here, because substitutions
11675 for argument packs are only done
11676 element-by-element. We can get to this point when
11677 substituting the type of a non-type template
11678 parameter pack, when that type actually contains
11679 template parameter packs from an outer template, e.g.,
11681 template<typename... Types> struct A {
11682 template<Types... Values> struct B { };
11686 if (code
== TEMPLATE_TYPE_PARM
)
11689 gcc_assert (TYPE_P (arg
));
11691 quals
= cp_type_quals (arg
) | cp_type_quals (t
);
11693 return cp_build_qualified_type_real
11694 (arg
, quals
, complain
| tf_ignore_bad_quals
);
11696 else if (code
== BOUND_TEMPLATE_TEMPLATE_PARM
)
11698 /* We are processing a type constructed from a
11699 template template parameter. */
11700 tree argvec
= tsubst (TYPE_TI_ARGS (t
),
11701 args
, complain
, in_decl
);
11702 if (argvec
== error_mark_node
)
11703 return error_mark_node
;
11705 gcc_assert (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
11706 || TREE_CODE (arg
) == TEMPLATE_DECL
11707 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
);
11709 if (TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
)
11710 /* Consider this code:
11712 template <template <class> class Template>
11714 template <class Arg> using Bind = Template<Arg>;
11717 template <template <class> class Template, class Arg>
11718 using Instantiate = Template<Arg>; //#0
11720 template <template <class> class Template,
11723 Instantiate<Internal<Template>::template Bind,
11726 When #1 is parsed, the
11727 BOUND_TEMPLATE_TEMPLATE_PARM representing the
11728 parameter `Template' in #0 matches the
11729 UNBOUND_CLASS_TEMPLATE representing the argument
11730 `Internal<Template>::template Bind'; We then want
11731 to assemble the type `Bind<Argument>' that can't
11732 be fully created right now, because
11733 `Internal<Template>' not being complete, the Bind
11734 template cannot be looked up in that context. So
11735 we need to "store" `Bind<Argument>' for later
11736 when the context of Bind becomes complete. Let's
11737 store that in a TYPENAME_TYPE. */
11738 return make_typename_type (TYPE_CONTEXT (arg
),
11739 build_nt (TEMPLATE_ID_EXPR
,
11740 TYPE_IDENTIFIER (arg
),
11745 /* We can get a TEMPLATE_TEMPLATE_PARM here when we
11746 are resolving nested-types in the signature of a
11747 member function templates. Otherwise ARG is a
11748 TEMPLATE_DECL and is the real template to be
11750 if (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
11751 arg
= TYPE_NAME (arg
);
11753 r
= lookup_template_class (arg
,
11755 DECL_CONTEXT (arg
),
11756 /*entering_scope=*/0,
11758 return cp_build_qualified_type_real
11759 (r
, cp_type_quals (t
) | cp_type_quals (r
), complain
);
11762 /* TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX. */
11763 return convert_from_reference (unshare_expr (arg
));
11767 /* This can happen during the attempted tsubst'ing in
11768 unify. This means that we don't yet have any information
11769 about the template parameter in question. */
11772 /* Early in template argument deduction substitution, we don't
11773 want to reduce the level of 'auto', or it will be confused
11774 with a normal template parm in subsequent deduction. */
11775 if (is_auto (t
) && (complain
& tf_partial
))
11778 /* If we get here, we must have been looking at a parm for a
11779 more deeply nested template. Make a new version of this
11780 template parameter, but with a lower level. */
11783 case TEMPLATE_TYPE_PARM
:
11784 case TEMPLATE_TEMPLATE_PARM
:
11785 case BOUND_TEMPLATE_TEMPLATE_PARM
:
11786 if (cp_type_quals (t
))
11788 r
= tsubst (TYPE_MAIN_VARIANT (t
), args
, complain
, in_decl
);
11789 r
= cp_build_qualified_type_real
11790 (r
, cp_type_quals (t
),
11791 complain
| (code
== TEMPLATE_TYPE_PARM
11792 ? tf_ignore_bad_quals
: 0));
11797 TEMPLATE_TYPE_PARM_INDEX (r
)
11798 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (t
),
11799 r
, levels
, args
, complain
);
11800 TYPE_STUB_DECL (r
) = TYPE_NAME (r
) = TEMPLATE_TYPE_DECL (r
);
11801 TYPE_MAIN_VARIANT (r
) = r
;
11802 TYPE_POINTER_TO (r
) = NULL_TREE
;
11803 TYPE_REFERENCE_TO (r
) = NULL_TREE
;
11805 if (TREE_CODE (r
) == TEMPLATE_TEMPLATE_PARM
)
11806 /* We have reduced the level of the template
11807 template parameter, but not the levels of its
11808 template parameters, so canonical_type_parameter
11809 will not be able to find the canonical template
11810 template parameter for this level. Thus, we
11811 require structural equality checking to compare
11812 TEMPLATE_TEMPLATE_PARMs. */
11813 SET_TYPE_STRUCTURAL_EQUALITY (r
);
11814 else if (TYPE_STRUCTURAL_EQUALITY_P (t
))
11815 SET_TYPE_STRUCTURAL_EQUALITY (r
);
11817 TYPE_CANONICAL (r
) = canonical_type_parameter (r
);
11819 if (code
== BOUND_TEMPLATE_TEMPLATE_PARM
)
11821 tree argvec
= tsubst (TYPE_TI_ARGS (t
), args
,
11822 complain
, in_decl
);
11823 if (argvec
== error_mark_node
)
11824 return error_mark_node
;
11826 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (r
)
11827 = build_template_info (TYPE_TI_TEMPLATE (t
), argvec
);
11832 case TEMPLATE_PARM_INDEX
:
11833 r
= reduce_template_parm_level (t
, type
, levels
, args
, complain
);
11837 gcc_unreachable ();
11845 tree purpose
, value
, chain
;
11847 if (t
== void_list_node
)
11850 purpose
= TREE_PURPOSE (t
);
11853 purpose
= tsubst (purpose
, args
, complain
, in_decl
);
11854 if (purpose
== error_mark_node
)
11855 return error_mark_node
;
11857 value
= TREE_VALUE (t
);
11860 value
= tsubst (value
, args
, complain
, in_decl
);
11861 if (value
== error_mark_node
)
11862 return error_mark_node
;
11864 chain
= TREE_CHAIN (t
);
11865 if (chain
&& chain
!= void_type_node
)
11867 chain
= tsubst (chain
, args
, complain
, in_decl
);
11868 if (chain
== error_mark_node
)
11869 return error_mark_node
;
11871 if (purpose
== TREE_PURPOSE (t
)
11872 && value
== TREE_VALUE (t
)
11873 && chain
== TREE_CHAIN (t
))
11875 return hash_tree_cons (purpose
, value
, chain
);
11879 /* We should never be tsubsting a binfo. */
11880 gcc_unreachable ();
11883 /* A vector of template arguments. */
11884 gcc_assert (!type
);
11885 return tsubst_template_args (t
, args
, complain
, in_decl
);
11888 case REFERENCE_TYPE
:
11890 if (type
== TREE_TYPE (t
) && TREE_CODE (type
) != METHOD_TYPE
)
11895 Type deduction may fail for any of the following
11898 -- Attempting to create a pointer to reference type.
11899 -- Attempting to create a reference to a reference type or
11900 a reference to void.
11902 Core issue 106 says that creating a reference to a reference
11903 during instantiation is no longer a cause for failure. We
11904 only enforce this check in strict C++98 mode. */
11905 if ((TREE_CODE (type
) == REFERENCE_TYPE
11906 && (((cxx_dialect
== cxx98
) && flag_iso
) || code
!= REFERENCE_TYPE
))
11907 || (code
== REFERENCE_TYPE
&& VOID_TYPE_P (type
)))
11909 static location_t last_loc
;
11911 /* We keep track of the last time we issued this error
11912 message to avoid spewing a ton of messages during a
11913 single bad template instantiation. */
11914 if (complain
& tf_error
11915 && last_loc
!= input_location
)
11917 if (VOID_TYPE_P (type
))
11918 error ("forming reference to void");
11919 else if (code
== POINTER_TYPE
)
11920 error ("forming pointer to reference type %qT", type
);
11922 error ("forming reference to reference type %qT", type
);
11923 last_loc
= input_location
;
11926 return error_mark_node
;
11928 else if (TREE_CODE (type
) == FUNCTION_TYPE
11929 && (type_memfn_quals (type
) != TYPE_UNQUALIFIED
11930 || type_memfn_rqual (type
) != REF_QUAL_NONE
))
11932 if (complain
& tf_error
)
11934 if (code
== POINTER_TYPE
)
11935 error ("forming pointer to qualified function type %qT",
11938 error ("forming reference to qualified function type %qT",
11941 return error_mark_node
;
11943 else if (code
== POINTER_TYPE
)
11945 r
= build_pointer_type (type
);
11946 if (TREE_CODE (type
) == METHOD_TYPE
)
11947 r
= build_ptrmemfunc_type (r
);
11949 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
11950 /* In C++0x, during template argument substitution, when there is an
11951 attempt to create a reference to a reference type, reference
11952 collapsing is applied as described in [14.3.1/4 temp.arg.type]:
11954 "If a template-argument for a template-parameter T names a type
11955 that is a reference to a type A, an attempt to create the type
11956 'lvalue reference to cv T' creates the type 'lvalue reference to
11957 A,' while an attempt to create the type type rvalue reference to
11958 cv T' creates the type T"
11960 r
= cp_build_reference_type
11962 TYPE_REF_IS_RVALUE (t
) && TYPE_REF_IS_RVALUE (type
));
11964 r
= cp_build_reference_type (type
, TYPE_REF_IS_RVALUE (t
));
11965 r
= cp_build_qualified_type_real (r
, cp_type_quals (t
), complain
);
11967 if (cxx_dialect
>= cxx1y
11968 && !(TREE_CODE (t
) == REFERENCE_TYPE
&& REFERENCE_VLA_OK (t
))
11969 && array_of_runtime_bound_p (type
)
11970 && (flag_iso
|| warn_vla
> 0))
11972 if (complain
& tf_warning_or_error
)
11974 (input_location
, OPT_Wvla
,
11975 code
== REFERENCE_TYPE
11976 ? G_("cannot declare reference to array of runtime bound")
11977 : G_("cannot declare pointer to array of runtime bound"));
11979 r
= error_mark_node
;
11982 if (r
!= error_mark_node
)
11983 /* Will this ever be needed for TYPE_..._TO values? */
11990 r
= tsubst (TYPE_OFFSET_BASETYPE (t
), args
, complain
, in_decl
);
11991 if (r
== error_mark_node
|| !MAYBE_CLASS_TYPE_P (r
))
11995 Type deduction may fail for any of the following
11998 -- Attempting to create "pointer to member of T" when T
11999 is not a class type. */
12000 if (complain
& tf_error
)
12001 error ("creating pointer to member of non-class type %qT", r
);
12002 return error_mark_node
;
12004 if (TREE_CODE (type
) == REFERENCE_TYPE
)
12006 if (complain
& tf_error
)
12007 error ("creating pointer to member reference type %qT", type
);
12008 return error_mark_node
;
12010 if (VOID_TYPE_P (type
))
12012 if (complain
& tf_error
)
12013 error ("creating pointer to member of type void");
12014 return error_mark_node
;
12016 gcc_assert (TREE_CODE (type
) != METHOD_TYPE
);
12017 if (TREE_CODE (type
) == FUNCTION_TYPE
)
12019 /* The type of the implicit object parameter gets its
12020 cv-qualifiers from the FUNCTION_TYPE. */
12023 = build_memfn_type (type
, r
, type_memfn_quals (type
),
12024 type_memfn_rqual (type
));
12025 memptr
= build_ptrmemfunc_type (build_pointer_type (method_type
));
12026 return cp_build_qualified_type_real (memptr
, cp_type_quals (t
),
12030 return cp_build_qualified_type_real (build_ptrmem_type (r
, type
),
12034 case FUNCTION_TYPE
:
12039 fntype
= tsubst_function_type (t
, args
, complain
, in_decl
);
12040 if (fntype
== error_mark_node
)
12041 return error_mark_node
;
12043 /* Substitute the exception specification. */
12044 specs
= tsubst_exception_specification (t
, args
, complain
,
12045 in_decl
, /*defer_ok*/true);
12046 if (specs
== error_mark_node
)
12047 return error_mark_node
;
12049 fntype
= build_exception_variant (fntype
, specs
);
12054 tree domain
= tsubst (TYPE_DOMAIN (t
), args
, complain
, in_decl
);
12055 if (domain
== error_mark_node
)
12056 return error_mark_node
;
12058 /* As an optimization, we avoid regenerating the array type if
12059 it will obviously be the same as T. */
12060 if (type
== TREE_TYPE (t
) && domain
== TYPE_DOMAIN (t
))
12063 /* These checks should match the ones in grokdeclarator.
12067 The deduction may fail for any of the following reasons:
12069 -- Attempting to create an array with an element type that
12070 is void, a function type, or a reference type, or [DR337]
12071 an abstract class type. */
12072 if (VOID_TYPE_P (type
)
12073 || TREE_CODE (type
) == FUNCTION_TYPE
12074 || TREE_CODE (type
) == REFERENCE_TYPE
)
12076 if (complain
& tf_error
)
12077 error ("creating array of %qT", type
);
12078 return error_mark_node
;
12081 if (abstract_virtuals_error_sfinae (ACU_ARRAY
, type
, complain
))
12082 return error_mark_node
;
12084 r
= build_cplus_array_type (type
, domain
);
12086 if (TYPE_USER_ALIGN (t
))
12088 TYPE_ALIGN (r
) = TYPE_ALIGN (t
);
12089 TYPE_USER_ALIGN (r
) = 1;
12095 case TYPENAME_TYPE
:
12097 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
12098 in_decl
, /*entering_scope=*/1);
12099 tree f
= tsubst_copy (TYPENAME_TYPE_FULLNAME (t
), args
,
12100 complain
, in_decl
);
12102 if (ctx
== error_mark_node
|| f
== error_mark_node
)
12103 return error_mark_node
;
12105 if (!MAYBE_CLASS_TYPE_P (ctx
))
12107 if (complain
& tf_error
)
12108 error ("%qT is not a class, struct, or union type", ctx
);
12109 return error_mark_node
;
12111 else if (!uses_template_parms (ctx
) && !TYPE_BEING_DEFINED (ctx
))
12113 /* Normally, make_typename_type does not require that the CTX
12114 have complete type in order to allow things like:
12116 template <class T> struct S { typename S<T>::X Y; };
12118 But, such constructs have already been resolved by this
12119 point, so here CTX really should have complete type, unless
12120 it's a partial instantiation. */
12121 ctx
= complete_type (ctx
);
12122 if (!COMPLETE_TYPE_P (ctx
))
12124 if (complain
& tf_error
)
12125 cxx_incomplete_type_error (NULL_TREE
, ctx
);
12126 return error_mark_node
;
12130 f
= make_typename_type (ctx
, f
, typename_type
,
12131 complain
| tf_keep_type_decl
);
12132 if (f
== error_mark_node
)
12134 if (TREE_CODE (f
) == TYPE_DECL
)
12136 complain
|= tf_ignore_bad_quals
;
12140 if (TREE_CODE (f
) != TYPENAME_TYPE
)
12142 if (TYPENAME_IS_ENUM_P (t
) && TREE_CODE (f
) != ENUMERAL_TYPE
)
12144 if (complain
& tf_error
)
12145 error ("%qT resolves to %qT, which is not an enumeration type",
12148 return error_mark_node
;
12150 else if (TYPENAME_IS_CLASS_P (t
) && !CLASS_TYPE_P (f
))
12152 if (complain
& tf_error
)
12153 error ("%qT resolves to %qT, which is is not a class type",
12156 return error_mark_node
;
12160 return cp_build_qualified_type_real
12161 (f
, cp_type_quals (f
) | cp_type_quals (t
), complain
);
12164 case UNBOUND_CLASS_TEMPLATE
:
12166 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
12167 in_decl
, /*entering_scope=*/1);
12168 tree name
= TYPE_IDENTIFIER (t
);
12169 tree parm_list
= DECL_TEMPLATE_PARMS (TYPE_NAME (t
));
12171 if (ctx
== error_mark_node
|| name
== error_mark_node
)
12172 return error_mark_node
;
12175 parm_list
= tsubst_template_parms (parm_list
, args
, complain
);
12176 return make_unbound_class_template (ctx
, name
, parm_list
, complain
);
12183 ++cp_unevaluated_operand
;
12184 ++c_inhibit_evaluation_warnings
;
12186 type
= tsubst_expr (TYPEOF_TYPE_EXPR (t
), args
,
12188 /*integral_constant_expression_p=*/false);
12190 --cp_unevaluated_operand
;
12191 --c_inhibit_evaluation_warnings
;
12193 type
= finish_typeof (type
);
12194 return cp_build_qualified_type_real (type
,
12196 | cp_type_quals (type
),
12200 case DECLTYPE_TYPE
:
12204 ++cp_unevaluated_operand
;
12205 ++c_inhibit_evaluation_warnings
;
12207 type
= tsubst_copy_and_build (DECLTYPE_TYPE_EXPR (t
), args
,
12208 complain
|tf_decltype
, in_decl
,
12209 /*function_p*/false,
12210 /*integral_constant_expression*/false);
12212 --cp_unevaluated_operand
;
12213 --c_inhibit_evaluation_warnings
;
12215 if (DECLTYPE_FOR_LAMBDA_CAPTURE (t
))
12216 type
= lambda_capture_field_type (type
,
12217 DECLTYPE_FOR_INIT_CAPTURE (t
));
12218 else if (DECLTYPE_FOR_LAMBDA_PROXY (t
))
12219 type
= lambda_proxy_type (type
);
12222 bool id
= DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t
);
12223 if (id
&& TREE_CODE (DECLTYPE_TYPE_EXPR (t
)) == BIT_NOT_EXPR
12225 /* In a template ~id could be either a complement expression
12226 or an unqualified-id naming a destructor; if instantiating
12227 it produces an expression, it's not an id-expression or
12230 type
= finish_decltype_type (type
, id
, complain
);
12232 return cp_build_qualified_type_real (type
,
12234 | cp_type_quals (type
),
12238 case UNDERLYING_TYPE
:
12240 tree type
= tsubst (UNDERLYING_TYPE_TYPE (t
), args
,
12241 complain
, in_decl
);
12242 return finish_underlying_type (type
);
12245 case TYPE_ARGUMENT_PACK
:
12246 case NONTYPE_ARGUMENT_PACK
:
12248 tree r
= TYPE_P (t
) ? cxx_make_type (code
) : make_node (code
);
12250 tsubst_template_args (ARGUMENT_PACK_ARGS (t
),
12254 SET_ARGUMENT_PACK_ARGS (r
, packed_out
);
12256 /* For template nontype argument packs, also substitute into
12258 if (code
== NONTYPE_ARGUMENT_PACK
)
12259 TREE_TYPE (r
) = tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12277 /* We should use one of the expression tsubsts for these codes. */
12278 gcc_unreachable ();
12281 sorry ("use of %qs in template", get_tree_code_name (code
));
12282 return error_mark_node
;
12286 /* Like tsubst_expr for a BASELINK. OBJECT_TYPE, if non-NULL, is the
12287 type of the expression on the left-hand side of the "." or "->"
12291 tsubst_baselink (tree baselink
, tree object_type
,
12292 tree args
, tsubst_flags_t complain
, tree in_decl
)
12295 tree qualifying_scope
;
12298 tree template_args
= 0;
12299 bool template_id_p
= false;
12300 bool qualified
= BASELINK_QUALIFIED_P (baselink
);
12302 /* A baselink indicates a function from a base class. Both the
12303 BASELINK_ACCESS_BINFO and the base class referenced may
12304 indicate bases of the template class, rather than the
12305 instantiated class. In addition, lookups that were not
12306 ambiguous before may be ambiguous now. Therefore, we perform
12307 the lookup again. */
12308 qualifying_scope
= BINFO_TYPE (BASELINK_ACCESS_BINFO (baselink
));
12309 qualifying_scope
= tsubst (qualifying_scope
, args
,
12310 complain
, in_decl
);
12311 fns
= BASELINK_FUNCTIONS (baselink
);
12312 optype
= tsubst (BASELINK_OPTYPE (baselink
), args
, complain
, in_decl
);
12313 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
12315 template_id_p
= true;
12316 template_args
= TREE_OPERAND (fns
, 1);
12317 fns
= TREE_OPERAND (fns
, 0);
12319 template_args
= tsubst_template_args (template_args
, args
,
12320 complain
, in_decl
);
12322 name
= DECL_NAME (get_first_fn (fns
));
12323 if (IDENTIFIER_TYPENAME_P (name
))
12324 name
= mangle_conv_op_name_for_type (optype
);
12325 baselink
= lookup_fnfields (qualifying_scope
, name
, /*protect=*/1);
12327 return error_mark_node
;
12329 /* If lookup found a single function, mark it as used at this
12330 point. (If it lookup found multiple functions the one selected
12331 later by overload resolution will be marked as used at that
12333 if (BASELINK_P (baselink
))
12334 fns
= BASELINK_FUNCTIONS (baselink
);
12335 if (!template_id_p
&& !really_overloaded_fn (fns
))
12336 mark_used (OVL_CURRENT (fns
));
12338 /* Add back the template arguments, if present. */
12339 if (BASELINK_P (baselink
) && template_id_p
)
12340 BASELINK_FUNCTIONS (baselink
)
12341 = build_nt (TEMPLATE_ID_EXPR
,
12342 BASELINK_FUNCTIONS (baselink
),
12344 /* Update the conversion operator type. */
12345 BASELINK_OPTYPE (baselink
) = optype
;
12348 object_type
= current_class_type
;
12351 baselink
= adjust_result_of_qualified_name_lookup (baselink
,
12357 /* Like tsubst_expr for a SCOPE_REF, given by QUALIFIED_ID. DONE is
12358 true if the qualified-id will be a postfix-expression in-and-of
12359 itself; false if more of the postfix-expression follows the
12360 QUALIFIED_ID. ADDRESS_P is true if the qualified-id is the operand
12364 tsubst_qualified_id (tree qualified_id
, tree args
,
12365 tsubst_flags_t complain
, tree in_decl
,
12366 bool done
, bool address_p
)
12372 tree template_args
;
12373 location_t loc
= UNKNOWN_LOCATION
;
12375 gcc_assert (TREE_CODE (qualified_id
) == SCOPE_REF
);
12377 /* Figure out what name to look up. */
12378 name
= TREE_OPERAND (qualified_id
, 1);
12379 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
12381 is_template
= true;
12382 loc
= EXPR_LOCATION (name
);
12383 template_args
= TREE_OPERAND (name
, 1);
12385 template_args
= tsubst_template_args (template_args
, args
,
12386 complain
, in_decl
);
12387 name
= TREE_OPERAND (name
, 0);
12391 is_template
= false;
12392 template_args
= NULL_TREE
;
12395 /* Substitute into the qualifying scope. When there are no ARGS, we
12396 are just trying to simplify a non-dependent expression. In that
12397 case the qualifying scope may be dependent, and, in any case,
12398 substituting will not help. */
12399 scope
= TREE_OPERAND (qualified_id
, 0);
12402 scope
= tsubst (scope
, args
, complain
, in_decl
);
12403 expr
= tsubst_copy (name
, args
, complain
, in_decl
);
12408 if (dependent_scope_p (scope
))
12411 expr
= build_min_nt_loc (loc
, TEMPLATE_ID_EXPR
, expr
, template_args
);
12412 return build_qualified_name (NULL_TREE
, scope
, expr
,
12413 QUALIFIED_NAME_IS_TEMPLATE (qualified_id
));
12416 if (!BASELINK_P (name
) && !DECL_P (expr
))
12418 if (TREE_CODE (expr
) == BIT_NOT_EXPR
)
12420 /* A BIT_NOT_EXPR is used to represent a destructor. */
12421 if (!check_dtor_name (scope
, TREE_OPERAND (expr
, 0)))
12423 error ("qualifying type %qT does not match destructor name ~%qT",
12424 scope
, TREE_OPERAND (expr
, 0));
12425 expr
= error_mark_node
;
12428 expr
= lookup_qualified_name (scope
, complete_dtor_identifier
,
12429 /*is_type_p=*/0, false);
12432 expr
= lookup_qualified_name (scope
, expr
, /*is_type_p=*/0, false);
12433 if (TREE_CODE (TREE_CODE (expr
) == TEMPLATE_DECL
12434 ? DECL_TEMPLATE_RESULT (expr
) : expr
) == TYPE_DECL
)
12436 if (complain
& tf_error
)
12438 error ("dependent-name %qE is parsed as a non-type, but "
12439 "instantiation yields a type", qualified_id
);
12440 inform (input_location
, "say %<typename %E%> if a type is meant", qualified_id
);
12442 return error_mark_node
;
12448 check_accessibility_of_qualified_id (expr
, /*object_type=*/NULL_TREE
,
12450 /* Remember that there was a reference to this entity. */
12454 if (expr
== error_mark_node
|| TREE_CODE (expr
) == TREE_LIST
)
12456 if (complain
& tf_error
)
12457 qualified_name_lookup_error (scope
,
12458 TREE_OPERAND (qualified_id
, 1),
12459 expr
, input_location
);
12460 return error_mark_node
;
12464 expr
= lookup_template_function (expr
, template_args
);
12466 if (expr
== error_mark_node
&& complain
& tf_error
)
12467 qualified_name_lookup_error (scope
, TREE_OPERAND (qualified_id
, 1),
12468 expr
, input_location
);
12469 else if (TYPE_P (scope
))
12471 expr
= (adjust_result_of_qualified_name_lookup
12472 (expr
, scope
, current_nonlambda_class_type ()));
12473 expr
= (finish_qualified_id_expr
12474 (scope
, expr
, done
, address_p
&& PTRMEM_OK_P (qualified_id
),
12475 QUALIFIED_NAME_IS_TEMPLATE (qualified_id
),
12476 /*template_arg_p=*/false, complain
));
12479 /* Expressions do not generally have reference type. */
12480 if (TREE_CODE (expr
) != SCOPE_REF
12481 /* However, if we're about to form a pointer-to-member, we just
12482 want the referenced member referenced. */
12483 && TREE_CODE (expr
) != OFFSET_REF
)
12484 expr
= convert_from_reference (expr
);
12489 /* Like tsubst, but deals with expressions. This function just replaces
12490 template parms; to finish processing the resultant expression, use
12491 tsubst_copy_and_build or tsubst_expr. */
12494 tsubst_copy (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
12496 enum tree_code code
;
12499 if (t
== NULL_TREE
|| t
== error_mark_node
|| args
== NULL_TREE
)
12502 code
= TREE_CODE (t
);
12507 r
= retrieve_local_specialization (t
);
12509 if (r
== NULL_TREE
)
12511 /* We get here for a use of 'this' in an NSDMI. */
12512 if (DECL_NAME (t
) == this_identifier
12513 && at_function_scope_p ()
12514 && DECL_CONSTRUCTOR_P (current_function_decl
))
12515 return current_class_ptr
;
12517 /* This can happen for a parameter name used later in a function
12518 declaration (such as in a late-specified return type). Just
12519 make a dummy decl, since it's only used for its type. */
12520 gcc_assert (cp_unevaluated_operand
!= 0);
12521 r
= tsubst_decl (t
, args
, complain
);
12522 /* Give it the template pattern as its context; its true context
12523 hasn't been instantiated yet and this is good enough for
12525 DECL_CONTEXT (r
) = DECL_CONTEXT (t
);
12528 if (TREE_CODE (r
) == ARGUMENT_PACK_SELECT
)
12529 r
= ARGUMENT_PACK_SELECT_ARG (r
);
12538 if (DECL_TEMPLATE_PARM_P (t
))
12539 return tsubst_copy (DECL_INITIAL (t
), args
, complain
, in_decl
);
12540 /* There is no need to substitute into namespace-scope
12542 if (DECL_NAMESPACE_SCOPE_P (t
))
12544 /* If ARGS is NULL, then T is known to be non-dependent. */
12545 if (args
== NULL_TREE
)
12546 return integral_constant_value (t
);
12548 /* Unfortunately, we cannot just call lookup_name here.
12551 template <int I> int f() {
12553 struct S { void g() { E e = a; } };
12556 When we instantiate f<7>::S::g(), say, lookup_name is not
12557 clever enough to find f<7>::a. */
12559 = tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
12560 /*entering_scope=*/0);
12562 for (v
= TYPE_VALUES (enum_type
);
12564 v
= TREE_CHAIN (v
))
12565 if (TREE_PURPOSE (v
) == DECL_NAME (t
))
12566 return TREE_VALUE (v
);
12568 /* We didn't find the name. That should never happen; if
12569 name-lookup found it during preliminary parsing, we
12570 should find it again here during instantiation. */
12571 gcc_unreachable ();
12576 if (PACK_EXPANSION_P (TREE_TYPE (t
)))
12578 /* Check for a local specialization set up by
12579 tsubst_pack_expansion. */
12580 if (tree r
= retrieve_local_specialization (t
))
12582 if (TREE_CODE (r
) == ARGUMENT_PACK_SELECT
)
12583 r
= ARGUMENT_PACK_SELECT_ARG (r
);
12587 /* When retrieving a capture pack from a generic lambda, remove the
12588 lambda call op's own template argument list from ARGS. Only the
12589 template arguments active for the closure type should be used to
12590 retrieve the pack specialization. */
12591 if (LAMBDA_FUNCTION_P (current_function_decl
)
12592 && (template_class_depth (DECL_CONTEXT (t
))
12593 != TMPL_ARGS_DEPTH (args
)))
12594 args
= strip_innermost_template_args (args
, 1);
12596 /* Otherwise return the full NONTYPE_ARGUMENT_PACK that
12597 tsubst_decl put in the hash table. */
12598 return retrieve_specialization (t
, args
, 0);
12601 if (DECL_CONTEXT (t
))
12605 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
12606 /*entering_scope=*/1);
12607 if (ctx
!= DECL_CONTEXT (t
))
12609 tree r
= lookup_field (ctx
, DECL_NAME (t
), 0, false);
12612 if (complain
& tf_error
)
12613 error ("using invalid field %qD", t
);
12614 return error_mark_node
;
12623 case FUNCTION_DECL
:
12624 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
))
12625 r
= tsubst (t
, args
, complain
, in_decl
);
12626 else if (local_variable_p (t
))
12628 r
= retrieve_local_specialization (t
);
12629 if (r
== NULL_TREE
)
12631 if (DECL_ANON_UNION_VAR_P (t
))
12633 /* Just use name lookup to find a member alias for an
12634 anonymous union, but then add it to the hash table. */
12635 r
= lookup_name (DECL_NAME (t
));
12636 gcc_assert (DECL_ANON_UNION_VAR_P (r
));
12637 register_local_specialization (r
, t
);
12641 /* This can happen for a variable used in a late-specified
12642 return type of a local lambda. Just make a dummy decl
12643 since it's only used for its type. */
12644 if (cp_unevaluated_operand
)
12645 return tsubst_decl (t
, args
, complain
);
12646 gcc_assert (errorcount
|| sorrycount
);
12647 return error_mark_node
;
12656 case NAMESPACE_DECL
:
12660 /* An OVERLOAD will always be a non-dependent overload set; an
12661 overload set from function scope will just be represented with an
12662 IDENTIFIER_NODE, and from class scope with a BASELINK. */
12663 gcc_assert (!uses_template_parms (t
));
12667 return tsubst_baselink (t
, current_nonlambda_class_type (),
12668 args
, complain
, in_decl
);
12670 case TEMPLATE_DECL
:
12671 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
12672 return tsubst (TREE_TYPE (DECL_TEMPLATE_RESULT (t
)),
12673 args
, complain
, in_decl
);
12674 else if (DECL_FUNCTION_TEMPLATE_P (t
) && DECL_MEMBER_TEMPLATE_P (t
))
12675 return tsubst (t
, args
, complain
, in_decl
);
12676 else if (DECL_CLASS_SCOPE_P (t
)
12677 && uses_template_parms (DECL_CONTEXT (t
)))
12679 /* Template template argument like the following example need
12682 template <template <class> class TT> struct C {};
12683 template <class T> struct D {
12684 template <class U> struct E {};
12689 We are processing the template argument `E' in #1 for
12690 the template instantiation #2. Originally, `E' is a
12691 TEMPLATE_DECL with `D<T>' as its DECL_CONTEXT. Now we
12692 have to substitute this with one having context `D<int>'. */
12694 tree context
= tsubst (DECL_CONTEXT (t
), args
, complain
, in_decl
);
12695 return lookup_field (context
, DECL_NAME(t
), 0, false);
12698 /* Ordinary template template argument. */
12702 case REINTERPRET_CAST_EXPR
:
12703 case CONST_CAST_EXPR
:
12704 case STATIC_CAST_EXPR
:
12705 case DYNAMIC_CAST_EXPR
:
12706 case IMPLICIT_CONV_EXPR
:
12710 (code
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
12711 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
));
12714 if (PACK_EXPANSION_P (TREE_OPERAND (t
, 0)))
12717 tree expanded
, op
= TREE_OPERAND (t
, 0);
12720 if (SIZEOF_EXPR_TYPE_P (t
))
12721 op
= TREE_TYPE (op
);
12723 ++cp_unevaluated_operand
;
12724 ++c_inhibit_evaluation_warnings
;
12725 /* We only want to compute the number of arguments. */
12726 expanded
= tsubst_pack_expansion (op
, args
, complain
, in_decl
);
12727 --cp_unevaluated_operand
;
12728 --c_inhibit_evaluation_warnings
;
12730 if (TREE_CODE (expanded
) == TREE_VEC
)
12731 len
= TREE_VEC_LENGTH (expanded
);
12733 if (expanded
== error_mark_node
)
12734 return error_mark_node
;
12735 else if (PACK_EXPANSION_P (expanded
)
12736 || (TREE_CODE (expanded
) == TREE_VEC
12738 && PACK_EXPANSION_P (TREE_VEC_ELT (expanded
, len
-1))))
12740 if (TREE_CODE (expanded
) == TREE_VEC
)
12741 expanded
= TREE_VEC_ELT (expanded
, len
- 1);
12743 if (TYPE_P (expanded
))
12744 return cxx_sizeof_or_alignof_type (expanded
, SIZEOF_EXPR
,
12745 complain
& tf_error
);
12747 return cxx_sizeof_or_alignof_expr (expanded
, SIZEOF_EXPR
,
12748 complain
& tf_error
);
12751 return build_int_cst (size_type_node
, len
);
12753 if (SIZEOF_EXPR_TYPE_P (t
))
12755 r
= tsubst (TREE_TYPE (TREE_OPERAND (t
, 0)),
12756 args
, complain
, in_decl
);
12757 r
= build1 (NOP_EXPR
, r
, error_mark_node
);
12758 r
= build1 (SIZEOF_EXPR
,
12759 tsubst (TREE_TYPE (t
), args
, complain
, in_decl
), r
);
12760 SIZEOF_EXPR_TYPE_P (r
) = 1;
12767 case TRUTH_NOT_EXPR
:
12770 case UNARY_PLUS_EXPR
: /* Unary + */
12772 case AT_ENCODE_EXPR
:
12776 case REALPART_EXPR
:
12777 case IMAGPART_EXPR
:
12780 (code
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
12781 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
));
12783 case COMPONENT_REF
:
12788 object
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
12789 name
= TREE_OPERAND (t
, 1);
12790 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
12792 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
12793 complain
, in_decl
);
12794 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
12796 else if (TREE_CODE (name
) == SCOPE_REF
12797 && TREE_CODE (TREE_OPERAND (name
, 1)) == BIT_NOT_EXPR
)
12799 tree base
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
12800 complain
, in_decl
);
12801 name
= TREE_OPERAND (name
, 1);
12802 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
12803 complain
, in_decl
);
12804 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
12805 name
= build_qualified_name (/*type=*/NULL_TREE
,
12807 /*template_p=*/false);
12809 else if (BASELINK_P (name
))
12810 name
= tsubst_baselink (name
,
12811 non_reference (TREE_TYPE (object
)),
12815 name
= tsubst_copy (name
, args
, complain
, in_decl
);
12816 return build_nt (COMPONENT_REF
, object
, name
, NULL_TREE
);
12822 case TRUNC_DIV_EXPR
:
12823 case CEIL_DIV_EXPR
:
12824 case FLOOR_DIV_EXPR
:
12825 case ROUND_DIV_EXPR
:
12826 case EXACT_DIV_EXPR
:
12830 case TRUNC_MOD_EXPR
:
12831 case FLOOR_MOD_EXPR
:
12832 case TRUTH_ANDIF_EXPR
:
12833 case TRUTH_ORIF_EXPR
:
12834 case TRUTH_AND_EXPR
:
12835 case TRUTH_OR_EXPR
:
12848 case COMPOUND_EXPR
:
12851 case PREDECREMENT_EXPR
:
12852 case PREINCREMENT_EXPR
:
12853 case POSTDECREMENT_EXPR
:
12854 case POSTINCREMENT_EXPR
:
12856 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
12857 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
));
12860 return build_qualified_name (/*type=*/NULL_TREE
,
12861 tsubst_copy (TREE_OPERAND (t
, 0),
12862 args
, complain
, in_decl
),
12863 tsubst_copy (TREE_OPERAND (t
, 1),
12864 args
, complain
, in_decl
),
12865 QUALIFIED_NAME_IS_TEMPLATE (t
));
12870 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
12871 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
),
12872 NULL_TREE
, NULL_TREE
);
12876 int n
= VL_EXP_OPERAND_LENGTH (t
);
12877 tree result
= build_vl_exp (CALL_EXPR
, n
);
12879 for (i
= 0; i
< n
; i
++)
12880 TREE_OPERAND (t
, i
) = tsubst_copy (TREE_OPERAND (t
, i
), args
,
12881 complain
, in_decl
);
12887 case PSEUDO_DTOR_EXPR
:
12888 case VEC_PERM_EXPR
:
12891 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
12892 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
),
12893 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
));
12894 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
12901 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
12902 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
),
12903 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
));
12904 NEW_EXPR_USE_GLOBAL (r
) = NEW_EXPR_USE_GLOBAL (t
);
12911 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
12912 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
));
12913 DELETE_EXPR_USE_GLOBAL (r
) = DELETE_EXPR_USE_GLOBAL (t
);
12914 DELETE_EXPR_USE_VEC (r
) = DELETE_EXPR_USE_VEC (t
);
12918 case TEMPLATE_ID_EXPR
:
12920 /* Substituted template arguments */
12921 tree fn
= TREE_OPERAND (t
, 0);
12922 tree targs
= TREE_OPERAND (t
, 1);
12924 fn
= tsubst_copy (fn
, args
, complain
, in_decl
);
12926 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
12928 return lookup_template_function (fn
, targs
);
12933 tree purpose
, value
, chain
;
12935 if (t
== void_list_node
)
12938 purpose
= TREE_PURPOSE (t
);
12940 purpose
= tsubst_copy (purpose
, args
, complain
, in_decl
);
12941 value
= TREE_VALUE (t
);
12943 value
= tsubst_copy (value
, args
, complain
, in_decl
);
12944 chain
= TREE_CHAIN (t
);
12945 if (chain
&& chain
!= void_type_node
)
12946 chain
= tsubst_copy (chain
, args
, complain
, in_decl
);
12947 if (purpose
== TREE_PURPOSE (t
)
12948 && value
== TREE_VALUE (t
)
12949 && chain
== TREE_CHAIN (t
))
12951 return tree_cons (purpose
, value
, chain
);
12956 case ENUMERAL_TYPE
:
12958 case TEMPLATE_TYPE_PARM
:
12959 case TEMPLATE_TEMPLATE_PARM
:
12960 case BOUND_TEMPLATE_TEMPLATE_PARM
:
12961 case TEMPLATE_PARM_INDEX
:
12963 case REFERENCE_TYPE
:
12965 case FUNCTION_TYPE
:
12968 case TYPENAME_TYPE
:
12969 case UNBOUND_CLASS_TEMPLATE
:
12971 case DECLTYPE_TYPE
:
12973 return tsubst (t
, args
, complain
, in_decl
);
12977 /* Fall through. */
12978 case IDENTIFIER_NODE
:
12979 if (IDENTIFIER_TYPENAME_P (t
))
12981 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12982 return mangle_conv_op_name_for_type (new_type
);
12988 /* This is handled by tsubst_copy_and_build. */
12989 gcc_unreachable ();
12992 return build_x_va_arg (EXPR_LOCATION (t
),
12993 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
,
12995 tsubst (TREE_TYPE (t
), args
, complain
, in_decl
));
12997 case CLEANUP_POINT_EXPR
:
12998 /* We shouldn't have built any of these during initial template
12999 generation. Instead, they should be built during instantiation
13000 in response to the saved STMT_IS_FULL_EXPR_P setting. */
13001 gcc_unreachable ();
13005 (code
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
13006 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
13007 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
));
13008 PTRMEM_OK_P (r
) = PTRMEM_OK_P (t
);
13009 mark_used (TREE_OPERAND (r
, 1));
13012 case EXPR_PACK_EXPANSION
:
13013 error ("invalid use of pack expansion expression");
13014 return error_mark_node
;
13016 case NONTYPE_ARGUMENT_PACK
:
13017 error ("use %<...%> to expand argument pack");
13018 return error_mark_node
;
13025 /* Instantiate any typedefs in the type. */
13026 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13027 r
= fold_convert (type
, t
);
13028 gcc_assert (TREE_CODE (r
) == code
);
13033 /* These can sometimes show up in a partial instantiation, but never
13034 involve template parms. */
13035 gcc_assert (!uses_template_parms (t
));
13039 /* We shouldn't get here, but keep going if !ENABLE_CHECKING. */
13040 gcc_checking_assert (false);
13045 /* Like tsubst_copy, but specifically for OpenMP clauses. */
13048 tsubst_omp_clauses (tree clauses
, bool declare_simd
,
13049 tree args
, tsubst_flags_t complain
, tree in_decl
)
13051 tree new_clauses
= NULL
, nc
, oc
;
13053 for (oc
= clauses
; oc
; oc
= OMP_CLAUSE_CHAIN (oc
))
13055 nc
= copy_node (oc
);
13056 OMP_CLAUSE_CHAIN (nc
) = new_clauses
;
13059 switch (OMP_CLAUSE_CODE (nc
))
13061 case OMP_CLAUSE_LASTPRIVATE
:
13062 if (OMP_CLAUSE_LASTPRIVATE_STMT (oc
))
13064 OMP_CLAUSE_LASTPRIVATE_STMT (nc
) = push_stmt_list ();
13065 tsubst_expr (OMP_CLAUSE_LASTPRIVATE_STMT (oc
), args
, complain
,
13066 in_decl
, /*integral_constant_expression_p=*/false);
13067 OMP_CLAUSE_LASTPRIVATE_STMT (nc
)
13068 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (nc
));
13071 case OMP_CLAUSE_PRIVATE
:
13072 case OMP_CLAUSE_SHARED
:
13073 case OMP_CLAUSE_FIRSTPRIVATE
:
13074 case OMP_CLAUSE_COPYIN
:
13075 case OMP_CLAUSE_COPYPRIVATE
:
13076 case OMP_CLAUSE_IF
:
13077 case OMP_CLAUSE_NUM_THREADS
:
13078 case OMP_CLAUSE_SCHEDULE
:
13079 case OMP_CLAUSE_COLLAPSE
:
13080 case OMP_CLAUSE_FINAL
:
13081 case OMP_CLAUSE_DEPEND
:
13082 case OMP_CLAUSE_FROM
:
13083 case OMP_CLAUSE_TO
:
13084 case OMP_CLAUSE_UNIFORM
:
13085 case OMP_CLAUSE_MAP
:
13086 case OMP_CLAUSE_DEVICE
:
13087 case OMP_CLAUSE_DIST_SCHEDULE
:
13088 case OMP_CLAUSE_NUM_TEAMS
:
13089 case OMP_CLAUSE_THREAD_LIMIT
:
13090 case OMP_CLAUSE_SAFELEN
:
13091 case OMP_CLAUSE_SIMDLEN
:
13092 OMP_CLAUSE_OPERAND (nc
, 0)
13093 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 0), args
, complain
,
13094 in_decl
, /*integral_constant_expression_p=*/false);
13096 case OMP_CLAUSE_REDUCTION
:
13097 if (OMP_CLAUSE_REDUCTION_PLACEHOLDER (oc
))
13099 tree placeholder
= OMP_CLAUSE_REDUCTION_PLACEHOLDER (oc
);
13100 if (TREE_CODE (placeholder
) == SCOPE_REF
)
13102 tree scope
= tsubst (TREE_OPERAND (placeholder
, 0), args
,
13103 complain
, in_decl
);
13104 OMP_CLAUSE_REDUCTION_PLACEHOLDER (nc
)
13105 = build_qualified_name (NULL_TREE
, scope
,
13106 TREE_OPERAND (placeholder
, 1),
13110 gcc_assert (identifier_p (placeholder
));
13112 OMP_CLAUSE_OPERAND (nc
, 0)
13113 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 0), args
, complain
,
13114 in_decl
, /*integral_constant_expression_p=*/false);
13116 case OMP_CLAUSE_LINEAR
:
13117 case OMP_CLAUSE_ALIGNED
:
13118 OMP_CLAUSE_OPERAND (nc
, 0)
13119 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 0), args
, complain
,
13120 in_decl
, /*integral_constant_expression_p=*/false);
13121 OMP_CLAUSE_OPERAND (nc
, 1)
13122 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 1), args
, complain
,
13123 in_decl
, /*integral_constant_expression_p=*/false);
13126 case OMP_CLAUSE_NOWAIT
:
13127 case OMP_CLAUSE_ORDERED
:
13128 case OMP_CLAUSE_DEFAULT
:
13129 case OMP_CLAUSE_UNTIED
:
13130 case OMP_CLAUSE_MERGEABLE
:
13131 case OMP_CLAUSE_INBRANCH
:
13132 case OMP_CLAUSE_NOTINBRANCH
:
13133 case OMP_CLAUSE_PROC_BIND
:
13134 case OMP_CLAUSE_FOR
:
13135 case OMP_CLAUSE_PARALLEL
:
13136 case OMP_CLAUSE_SECTIONS
:
13137 case OMP_CLAUSE_TASKGROUP
:
13140 gcc_unreachable ();
13144 new_clauses
= nreverse (new_clauses
);
13146 new_clauses
= finish_omp_clauses (new_clauses
);
13147 return new_clauses
;
13150 /* Like tsubst_copy_and_build, but unshare TREE_LIST nodes. */
13153 tsubst_copy_asm_operands (tree t
, tree args
, tsubst_flags_t complain
,
13156 #define RECUR(t) tsubst_copy_asm_operands (t, args, complain, in_decl)
13158 tree purpose
, value
, chain
;
13163 if (TREE_CODE (t
) != TREE_LIST
)
13164 return tsubst_copy_and_build (t
, args
, complain
, in_decl
,
13165 /*function_p=*/false,
13166 /*integral_constant_expression_p=*/false);
13168 if (t
== void_list_node
)
13171 purpose
= TREE_PURPOSE (t
);
13173 purpose
= RECUR (purpose
);
13174 value
= TREE_VALUE (t
);
13177 if (TREE_CODE (value
) != LABEL_DECL
)
13178 value
= RECUR (value
);
13181 value
= lookup_label (DECL_NAME (value
));
13182 gcc_assert (TREE_CODE (value
) == LABEL_DECL
);
13183 TREE_USED (value
) = 1;
13186 chain
= TREE_CHAIN (t
);
13187 if (chain
&& chain
!= void_type_node
)
13188 chain
= RECUR (chain
);
13189 return tree_cons (purpose
, value
, chain
);
13193 /* Substitute one OMP_FOR iterator. */
13196 tsubst_omp_for_iterator (tree t
, int i
, tree declv
, tree initv
,
13197 tree condv
, tree incrv
, tree
*clauses
,
13198 tree args
, tsubst_flags_t complain
, tree in_decl
,
13199 bool integral_constant_expression_p
)
13201 #define RECUR(NODE) \
13202 tsubst_expr ((NODE), args, complain, in_decl, \
13203 integral_constant_expression_p)
13204 tree decl
, init
, cond
, incr
;
13206 init
= TREE_VEC_ELT (OMP_FOR_INIT (t
), i
);
13207 gcc_assert (TREE_CODE (init
) == MODIFY_EXPR
);
13208 decl
= TREE_OPERAND (init
, 0);
13209 init
= TREE_OPERAND (init
, 1);
13210 tree decl_expr
= NULL_TREE
;
13211 if (init
&& TREE_CODE (init
) == DECL_EXPR
)
13213 /* We need to jump through some hoops to handle declarations in the
13214 for-init-statement, since we might need to handle auto deduction,
13215 but we need to keep control of initialization. */
13217 init
= DECL_INITIAL (DECL_EXPR_DECL (init
));
13218 decl
= tsubst_decl (decl
, args
, complain
);
13221 decl
= RECUR (decl
);
13222 init
= RECUR (init
);
13224 tree auto_node
= type_uses_auto (TREE_TYPE (decl
));
13225 if (auto_node
&& init
)
13227 = do_auto_deduction (TREE_TYPE (decl
), init
, auto_node
);
13229 gcc_assert (!type_dependent_expression_p (decl
));
13231 if (!CLASS_TYPE_P (TREE_TYPE (decl
)))
13235 /* Declare the variable, but don't let that initialize it. */
13236 tree init_sav
= DECL_INITIAL (DECL_EXPR_DECL (decl_expr
));
13237 DECL_INITIAL (DECL_EXPR_DECL (decl_expr
)) = NULL_TREE
;
13239 DECL_INITIAL (DECL_EXPR_DECL (decl_expr
)) = init_sav
;
13242 cond
= RECUR (TREE_VEC_ELT (OMP_FOR_COND (t
), i
));
13243 incr
= TREE_VEC_ELT (OMP_FOR_INCR (t
), i
);
13244 if (TREE_CODE (incr
) == MODIFY_EXPR
)
13245 incr
= build_x_modify_expr (EXPR_LOCATION (incr
),
13246 RECUR (TREE_OPERAND (incr
, 0)), NOP_EXPR
,
13247 RECUR (TREE_OPERAND (incr
, 1)),
13250 incr
= RECUR (incr
);
13251 TREE_VEC_ELT (declv
, i
) = decl
;
13252 TREE_VEC_ELT (initv
, i
) = init
;
13253 TREE_VEC_ELT (condv
, i
) = cond
;
13254 TREE_VEC_ELT (incrv
, i
) = incr
;
13260 /* Declare and initialize the variable. */
13267 for (c
= *clauses
; c
; c
= OMP_CLAUSE_CHAIN (c
))
13269 if ((OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_PRIVATE
13270 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_LASTPRIVATE
)
13271 && OMP_CLAUSE_DECL (c
) == decl
)
13273 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_FIRSTPRIVATE
13274 && OMP_CLAUSE_DECL (c
) == decl
)
13275 error ("iteration variable %qD should not be firstprivate", decl
);
13276 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
13277 && OMP_CLAUSE_DECL (c
) == decl
)
13278 error ("iteration variable %qD should not be reduction", decl
);
13282 c
= build_omp_clause (input_location
, OMP_CLAUSE_PRIVATE
);
13283 OMP_CLAUSE_DECL (c
) = decl
;
13284 c
= finish_omp_clauses (c
);
13287 OMP_CLAUSE_CHAIN (c
) = *clauses
;
13292 cond
= TREE_VEC_ELT (OMP_FOR_COND (t
), i
);
13293 if (COMPARISON_CLASS_P (cond
))
13294 cond
= build2 (TREE_CODE (cond
), boolean_type_node
,
13295 RECUR (TREE_OPERAND (cond
, 0)),
13296 RECUR (TREE_OPERAND (cond
, 1)));
13298 cond
= RECUR (cond
);
13299 incr
= TREE_VEC_ELT (OMP_FOR_INCR (t
), i
);
13300 switch (TREE_CODE (incr
))
13302 case PREINCREMENT_EXPR
:
13303 case PREDECREMENT_EXPR
:
13304 case POSTINCREMENT_EXPR
:
13305 case POSTDECREMENT_EXPR
:
13306 incr
= build2 (TREE_CODE (incr
), TREE_TYPE (decl
),
13307 RECUR (TREE_OPERAND (incr
, 0)), NULL_TREE
);
13310 if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
13311 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
13313 tree rhs
= TREE_OPERAND (incr
, 1);
13314 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
),
13315 RECUR (TREE_OPERAND (incr
, 0)),
13316 build2 (TREE_CODE (rhs
), TREE_TYPE (decl
),
13317 RECUR (TREE_OPERAND (rhs
, 0)),
13318 RECUR (TREE_OPERAND (rhs
, 1))));
13321 incr
= RECUR (incr
);
13324 if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
13325 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
13327 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
13328 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
13329 build2 (TREE_CODE (TREE_OPERAND (incr
, 1)),
13330 TREE_TYPE (decl
), lhs
,
13331 RECUR (TREE_OPERAND (incr
, 2))));
13333 else if (TREE_CODE (TREE_OPERAND (incr
, 1)) == NOP_EXPR
13334 && (TREE_CODE (TREE_OPERAND (incr
, 2)) == PLUS_EXPR
13335 || (TREE_CODE (TREE_OPERAND (incr
, 2)) == MINUS_EXPR
)))
13337 tree rhs
= TREE_OPERAND (incr
, 2);
13338 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
),
13339 RECUR (TREE_OPERAND (incr
, 0)),
13340 build2 (TREE_CODE (rhs
), TREE_TYPE (decl
),
13341 RECUR (TREE_OPERAND (rhs
, 0)),
13342 RECUR (TREE_OPERAND (rhs
, 1))));
13345 incr
= RECUR (incr
);
13348 incr
= RECUR (incr
);
13352 TREE_VEC_ELT (declv
, i
) = decl
;
13353 TREE_VEC_ELT (initv
, i
) = init
;
13354 TREE_VEC_ELT (condv
, i
) = cond
;
13355 TREE_VEC_ELT (incrv
, i
) = incr
;
13359 /* Like tsubst_copy for expressions, etc. but also does semantic
13363 tsubst_expr (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
,
13364 bool integral_constant_expression_p
)
13366 #define RETURN(EXP) do { r = (EXP); goto out; } while(0)
13367 #define RECUR(NODE) \
13368 tsubst_expr ((NODE), args, complain, in_decl, \
13369 integral_constant_expression_p)
13375 if (t
== NULL_TREE
|| t
== error_mark_node
)
13378 loc
= input_location
;
13379 if (EXPR_HAS_LOCATION (t
))
13380 input_location
= EXPR_LOCATION (t
);
13381 if (STATEMENT_CODE_P (TREE_CODE (t
)))
13382 current_stmt_tree ()->stmts_are_full_exprs_p
= STMT_IS_FULL_EXPR_P (t
);
13384 switch (TREE_CODE (t
))
13386 case STATEMENT_LIST
:
13388 tree_stmt_iterator i
;
13389 for (i
= tsi_start (t
); !tsi_end_p (i
); tsi_next (&i
))
13390 RECUR (tsi_stmt (i
));
13394 case CTOR_INITIALIZER
:
13395 finish_mem_initializers (tsubst_initializer_list
13396 (TREE_OPERAND (t
, 0), args
));
13400 finish_return_stmt (RECUR (TREE_OPERAND (t
, 0)));
13404 tmp
= RECUR (EXPR_STMT_EXPR (t
));
13405 if (EXPR_STMT_STMT_EXPR_RESULT (t
))
13406 finish_stmt_expr_expr (tmp
, cur_stmt_expr
);
13408 finish_expr_stmt (tmp
);
13412 do_using_directive (USING_STMT_NAMESPACE (t
));
13417 tree decl
, pattern_decl
;
13420 pattern_decl
= decl
= DECL_EXPR_DECL (t
);
13421 if (TREE_CODE (decl
) == LABEL_DECL
)
13422 finish_label_decl (DECL_NAME (decl
));
13423 else if (TREE_CODE (decl
) == USING_DECL
)
13425 tree scope
= USING_DECL_SCOPE (decl
);
13426 tree name
= DECL_NAME (decl
);
13429 scope
= tsubst (scope
, args
, complain
, in_decl
);
13430 decl
= lookup_qualified_name (scope
, name
,
13431 /*is_type_p=*/false,
13432 /*complain=*/false);
13433 if (decl
== error_mark_node
|| TREE_CODE (decl
) == TREE_LIST
)
13434 qualified_name_lookup_error (scope
, name
, decl
, input_location
);
13436 do_local_using_decl (decl
, scope
, name
);
13438 else if (DECL_PACK_P (decl
))
13440 /* Don't build up decls for a variadic capture proxy, we'll
13441 instantiate the elements directly as needed. */
13446 init
= DECL_INITIAL (decl
);
13447 decl
= tsubst (decl
, args
, complain
, in_decl
);
13448 if (decl
!= error_mark_node
)
13450 /* By marking the declaration as instantiated, we avoid
13451 trying to instantiate it. Since instantiate_decl can't
13452 handle local variables, and since we've already done
13453 all that needs to be done, that's the right thing to
13456 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
13458 && ANON_AGGR_TYPE_P (TREE_TYPE (decl
)))
13459 /* Anonymous aggregates are a special case. */
13460 finish_anon_union (decl
);
13461 else if (is_capture_proxy (DECL_EXPR_DECL (t
)))
13463 DECL_CONTEXT (decl
) = current_function_decl
;
13464 if (DECL_NAME (decl
) == this_identifier
)
13466 tree lam
= DECL_CONTEXT (current_function_decl
);
13467 lam
= CLASSTYPE_LAMBDA_EXPR (lam
);
13468 LAMBDA_EXPR_THIS_CAPTURE (lam
) = decl
;
13470 insert_capture_proxy (decl
);
13472 else if (DECL_IMPLICIT_TYPEDEF_P (t
))
13473 /* We already did a pushtag. */;
13474 else if (TREE_CODE (decl
) == FUNCTION_DECL
13475 && DECL_OMP_DECLARE_REDUCTION_P (decl
)
13476 && DECL_FUNCTION_SCOPE_P (pattern_decl
))
13478 DECL_CONTEXT (decl
) = NULL_TREE
;
13480 DECL_CONTEXT (decl
) = current_function_decl
;
13481 cp_check_omp_declare_reduction (decl
);
13485 int const_init
= false;
13486 maybe_push_decl (decl
);
13488 && DECL_PRETTY_FUNCTION_P (decl
))
13490 /* For __PRETTY_FUNCTION__ we have to adjust the
13492 const char *const name
13493 = cxx_printable_name (current_function_decl
, 2);
13494 init
= cp_fname_init (name
, &TREE_TYPE (decl
));
13498 tree t
= RECUR (init
);
13502 /* If we had an initializer but it
13503 instantiated to nothing,
13504 value-initialize the object. This will
13505 only occur when the initializer was a
13506 pack expansion where the parameter packs
13507 used in that expansion were of length
13509 init
= build_value_init (TREE_TYPE (decl
),
13511 if (TREE_CODE (init
) == AGGR_INIT_EXPR
)
13512 init
= get_target_expr_sfinae (init
, complain
);
13519 const_init
= (DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P
13521 cp_finish_decl (decl
, init
, const_init
, NULL_TREE
, 0);
13530 stmt
= begin_for_stmt (NULL_TREE
, NULL_TREE
);
13531 RECUR (FOR_INIT_STMT (t
));
13532 finish_for_init_stmt (stmt
);
13533 tmp
= RECUR (FOR_COND (t
));
13534 finish_for_cond (tmp
, stmt
, false);
13535 tmp
= RECUR (FOR_EXPR (t
));
13536 finish_for_expr (tmp
, stmt
);
13537 RECUR (FOR_BODY (t
));
13538 finish_for_stmt (stmt
);
13541 case RANGE_FOR_STMT
:
13544 stmt
= begin_for_stmt (NULL_TREE
, NULL_TREE
);
13545 decl
= RANGE_FOR_DECL (t
);
13546 decl
= tsubst (decl
, args
, complain
, in_decl
);
13547 maybe_push_decl (decl
);
13548 expr
= RECUR (RANGE_FOR_EXPR (t
));
13549 stmt
= cp_convert_range_for (stmt
, decl
, expr
, RANGE_FOR_IVDEP (t
));
13550 RECUR (RANGE_FOR_BODY (t
));
13551 finish_for_stmt (stmt
);
13556 stmt
= begin_while_stmt ();
13557 tmp
= RECUR (WHILE_COND (t
));
13558 finish_while_stmt_cond (tmp
, stmt
, false);
13559 RECUR (WHILE_BODY (t
));
13560 finish_while_stmt (stmt
);
13564 stmt
= begin_do_stmt ();
13565 RECUR (DO_BODY (t
));
13566 finish_do_body (stmt
);
13567 tmp
= RECUR (DO_COND (t
));
13568 finish_do_stmt (tmp
, stmt
, false);
13572 stmt
= begin_if_stmt ();
13573 tmp
= RECUR (IF_COND (t
));
13574 finish_if_stmt_cond (tmp
, stmt
);
13575 RECUR (THEN_CLAUSE (t
));
13576 finish_then_clause (stmt
);
13578 if (ELSE_CLAUSE (t
))
13580 begin_else_clause (stmt
);
13581 RECUR (ELSE_CLAUSE (t
));
13582 finish_else_clause (stmt
);
13585 finish_if_stmt (stmt
);
13589 if (BIND_EXPR_BODY_BLOCK (t
))
13590 stmt
= begin_function_body ();
13592 stmt
= begin_compound_stmt (BIND_EXPR_TRY_BLOCK (t
)
13593 ? BCS_TRY_BLOCK
: 0);
13595 RECUR (BIND_EXPR_BODY (t
));
13597 if (BIND_EXPR_BODY_BLOCK (t
))
13598 finish_function_body (stmt
);
13600 finish_compound_stmt (stmt
);
13604 finish_break_stmt ();
13607 case CONTINUE_STMT
:
13608 finish_continue_stmt ();
13612 stmt
= begin_switch_stmt ();
13613 tmp
= RECUR (SWITCH_STMT_COND (t
));
13614 finish_switch_cond (tmp
, stmt
);
13615 RECUR (SWITCH_STMT_BODY (t
));
13616 finish_switch_stmt (stmt
);
13619 case CASE_LABEL_EXPR
:
13620 finish_case_label (EXPR_LOCATION (t
),
13621 RECUR (CASE_LOW (t
)),
13622 RECUR (CASE_HIGH (t
)));
13627 tree decl
= LABEL_EXPR_LABEL (t
);
13630 label
= finish_label_stmt (DECL_NAME (decl
));
13631 if (DECL_ATTRIBUTES (decl
) != NULL_TREE
)
13632 cplus_decl_attributes (&label
, DECL_ATTRIBUTES (decl
), 0);
13637 tmp
= GOTO_DESTINATION (t
);
13638 if (TREE_CODE (tmp
) != LABEL_DECL
)
13639 /* Computed goto's must be tsubst'd into. On the other hand,
13640 non-computed gotos must not be; the identifier in question
13641 will have no binding. */
13644 tmp
= DECL_NAME (tmp
);
13645 finish_goto_stmt (tmp
);
13649 tmp
= finish_asm_stmt
13650 (ASM_VOLATILE_P (t
),
13651 RECUR (ASM_STRING (t
)),
13652 tsubst_copy_asm_operands (ASM_OUTPUTS (t
), args
, complain
, in_decl
),
13653 tsubst_copy_asm_operands (ASM_INPUTS (t
), args
, complain
, in_decl
),
13654 tsubst_copy_asm_operands (ASM_CLOBBERS (t
), args
, complain
, in_decl
),
13655 tsubst_copy_asm_operands (ASM_LABELS (t
), args
, complain
, in_decl
));
13657 tree asm_expr
= tmp
;
13658 if (TREE_CODE (asm_expr
) == CLEANUP_POINT_EXPR
)
13659 asm_expr
= TREE_OPERAND (asm_expr
, 0);
13660 ASM_INPUT_P (asm_expr
) = ASM_INPUT_P (t
);
13667 stmt
= begin_try_block ();
13668 RECUR (TRY_STMTS (t
));
13669 finish_cleanup_try_block (stmt
);
13670 finish_cleanup (RECUR (TRY_HANDLERS (t
)), stmt
);
13674 tree compound_stmt
= NULL_TREE
;
13676 if (FN_TRY_BLOCK_P (t
))
13677 stmt
= begin_function_try_block (&compound_stmt
);
13679 stmt
= begin_try_block ();
13681 RECUR (TRY_STMTS (t
));
13683 if (FN_TRY_BLOCK_P (t
))
13684 finish_function_try_block (stmt
);
13686 finish_try_block (stmt
);
13688 RECUR (TRY_HANDLERS (t
));
13689 if (FN_TRY_BLOCK_P (t
))
13690 finish_function_handler_sequence (stmt
, compound_stmt
);
13692 finish_handler_sequence (stmt
);
13698 tree decl
= HANDLER_PARMS (t
);
13702 decl
= tsubst (decl
, args
, complain
, in_decl
);
13703 /* Prevent instantiate_decl from trying to instantiate
13704 this variable. We've already done all that needs to be
13706 if (decl
!= error_mark_node
)
13707 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
13709 stmt
= begin_handler ();
13710 finish_handler_parms (decl
, stmt
);
13711 RECUR (HANDLER_BODY (t
));
13712 finish_handler (stmt
);
13717 tmp
= tsubst (TREE_TYPE (t
), args
, complain
, NULL_TREE
);
13718 if (CLASS_TYPE_P (tmp
))
13720 /* Local classes are not independent templates; they are
13721 instantiated along with their containing function. And this
13722 way we don't have to deal with pushing out of one local class
13723 to instantiate a member of another local class. */
13725 /* Closures are handled by the LAMBDA_EXPR. */
13726 gcc_assert (!LAMBDA_TYPE_P (TREE_TYPE (t
)));
13727 complete_type (tmp
);
13728 for (fn
= TYPE_METHODS (tmp
); fn
; fn
= DECL_CHAIN (fn
))
13729 if (!DECL_ARTIFICIAL (fn
))
13730 instantiate_decl (fn
, /*defer_ok*/0, /*expl_inst_class*/false);
13734 case STATIC_ASSERT
:
13738 ++c_inhibit_evaluation_warnings
;
13740 tsubst_expr (STATIC_ASSERT_CONDITION (t
),
13743 /*integral_constant_expression_p=*/true);
13744 --c_inhibit_evaluation_warnings
;
13746 finish_static_assert (condition
,
13747 STATIC_ASSERT_MESSAGE (t
),
13748 STATIC_ASSERT_SOURCE_LOCATION (t
),
13749 /*member_p=*/false);
13754 tmp
= tsubst_omp_clauses (OMP_PARALLEL_CLAUSES (t
), false,
13755 args
, complain
, in_decl
);
13756 stmt
= begin_omp_parallel ();
13757 RECUR (OMP_PARALLEL_BODY (t
));
13758 OMP_PARALLEL_COMBINED (finish_omp_parallel (tmp
, stmt
))
13759 = OMP_PARALLEL_COMBINED (t
);
13763 tmp
= tsubst_omp_clauses (OMP_TASK_CLAUSES (t
), false,
13764 args
, complain
, in_decl
);
13765 stmt
= begin_omp_task ();
13766 RECUR (OMP_TASK_BODY (t
));
13767 finish_omp_task (tmp
, stmt
);
13773 case OMP_DISTRIBUTE
:
13775 tree clauses
, body
, pre_body
;
13776 tree declv
= NULL_TREE
, initv
= NULL_TREE
, condv
= NULL_TREE
;
13777 tree incrv
= NULL_TREE
;
13780 clauses
= tsubst_omp_clauses (OMP_FOR_CLAUSES (t
), false,
13781 args
, complain
, in_decl
);
13782 if (OMP_FOR_INIT (t
) != NULL_TREE
)
13784 declv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
13785 initv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
13786 condv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
13787 incrv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
13790 stmt
= begin_omp_structured_block ();
13792 pre_body
= push_stmt_list ();
13793 RECUR (OMP_FOR_PRE_BODY (t
));
13794 pre_body
= pop_stmt_list (pre_body
);
13796 if (OMP_FOR_INIT (t
) != NULL_TREE
)
13797 for (i
= 0; i
< TREE_VEC_LENGTH (OMP_FOR_INIT (t
)); i
++)
13798 tsubst_omp_for_iterator (t
, i
, declv
, initv
, condv
, incrv
,
13799 &clauses
, args
, complain
, in_decl
,
13800 integral_constant_expression_p
);
13802 body
= push_stmt_list ();
13803 RECUR (OMP_FOR_BODY (t
));
13804 body
= pop_stmt_list (body
);
13806 if (OMP_FOR_INIT (t
) != NULL_TREE
)
13807 t
= finish_omp_for (EXPR_LOCATION (t
), TREE_CODE (t
), declv
, initv
,
13808 condv
, incrv
, body
, pre_body
, clauses
);
13811 t
= make_node (TREE_CODE (t
));
13812 TREE_TYPE (t
) = void_type_node
;
13813 OMP_FOR_BODY (t
) = body
;
13814 OMP_FOR_PRE_BODY (t
) = pre_body
;
13815 OMP_FOR_CLAUSES (t
) = clauses
;
13816 SET_EXPR_LOCATION (t
, EXPR_LOCATION (t
));
13820 add_stmt (finish_omp_structured_block (stmt
));
13827 case OMP_TARGET_DATA
:
13829 tmp
= tsubst_omp_clauses (OMP_CLAUSES (t
), false,
13830 args
, complain
, in_decl
);
13831 stmt
= push_stmt_list ();
13832 RECUR (OMP_BODY (t
));
13833 stmt
= pop_stmt_list (stmt
);
13836 OMP_BODY (t
) = stmt
;
13837 OMP_CLAUSES (t
) = tmp
;
13841 case OMP_TARGET_UPDATE
:
13842 tmp
= tsubst_omp_clauses (OMP_TARGET_UPDATE_CLAUSES (t
), false,
13843 args
, complain
, in_decl
);
13845 OMP_CLAUSES (t
) = tmp
;
13852 case OMP_TASKGROUP
:
13854 stmt
= push_stmt_list ();
13855 RECUR (OMP_BODY (t
));
13856 stmt
= pop_stmt_list (stmt
);
13859 OMP_BODY (t
) = stmt
;
13864 gcc_assert (OMP_ATOMIC_DEPENDENT_P (t
));
13865 if (TREE_CODE (TREE_OPERAND (t
, 1)) != MODIFY_EXPR
)
13867 tree op1
= TREE_OPERAND (t
, 1);
13868 tree rhs1
= NULL_TREE
;
13870 if (TREE_CODE (op1
) == COMPOUND_EXPR
)
13872 rhs1
= RECUR (TREE_OPERAND (op1
, 0));
13873 op1
= TREE_OPERAND (op1
, 1);
13875 lhs
= RECUR (TREE_OPERAND (op1
, 0));
13876 rhs
= RECUR (TREE_OPERAND (op1
, 1));
13877 finish_omp_atomic (OMP_ATOMIC
, TREE_CODE (op1
), lhs
, rhs
,
13878 NULL_TREE
, NULL_TREE
, rhs1
,
13879 OMP_ATOMIC_SEQ_CST (t
));
13883 tree op1
= TREE_OPERAND (t
, 1);
13884 tree v
= NULL_TREE
, lhs
, rhs
= NULL_TREE
, lhs1
= NULL_TREE
;
13885 tree rhs1
= NULL_TREE
;
13886 enum tree_code code
= TREE_CODE (TREE_OPERAND (op1
, 1));
13887 enum tree_code opcode
= NOP_EXPR
;
13888 if (code
== OMP_ATOMIC_READ
)
13890 v
= RECUR (TREE_OPERAND (op1
, 0));
13891 lhs
= RECUR (TREE_OPERAND (TREE_OPERAND (op1
, 1), 0));
13893 else if (code
== OMP_ATOMIC_CAPTURE_OLD
13894 || code
== OMP_ATOMIC_CAPTURE_NEW
)
13896 tree op11
= TREE_OPERAND (TREE_OPERAND (op1
, 1), 1);
13897 v
= RECUR (TREE_OPERAND (op1
, 0));
13898 lhs1
= RECUR (TREE_OPERAND (TREE_OPERAND (op1
, 1), 0));
13899 if (TREE_CODE (op11
) == COMPOUND_EXPR
)
13901 rhs1
= RECUR (TREE_OPERAND (op11
, 0));
13902 op11
= TREE_OPERAND (op11
, 1);
13904 lhs
= RECUR (TREE_OPERAND (op11
, 0));
13905 rhs
= RECUR (TREE_OPERAND (op11
, 1));
13906 opcode
= TREE_CODE (op11
);
13907 if (opcode
== MODIFY_EXPR
)
13913 lhs
= RECUR (TREE_OPERAND (op1
, 0));
13914 rhs
= RECUR (TREE_OPERAND (op1
, 1));
13916 finish_omp_atomic (code
, opcode
, lhs
, rhs
, v
, lhs1
, rhs1
,
13917 OMP_ATOMIC_SEQ_CST (t
));
13921 case TRANSACTION_EXPR
:
13924 flags
|= (TRANSACTION_EXPR_OUTER (t
) ? TM_STMT_ATTR_OUTER
: 0);
13925 flags
|= (TRANSACTION_EXPR_RELAXED (t
) ? TM_STMT_ATTR_RELAXED
: 0);
13927 if (TRANSACTION_EXPR_IS_STMT (t
))
13929 tree body
= TRANSACTION_EXPR_BODY (t
);
13930 tree noex
= NULL_TREE
;
13931 if (TREE_CODE (body
) == MUST_NOT_THROW_EXPR
)
13933 noex
= MUST_NOT_THROW_COND (body
);
13934 if (noex
== NULL_TREE
)
13935 noex
= boolean_true_node
;
13936 body
= TREE_OPERAND (body
, 0);
13938 stmt
= begin_transaction_stmt (input_location
, NULL
, flags
);
13940 finish_transaction_stmt (stmt
, NULL
, flags
, RECUR (noex
));
13944 stmt
= build_transaction_expr (EXPR_LOCATION (t
),
13945 RECUR (TRANSACTION_EXPR_BODY (t
)),
13952 case MUST_NOT_THROW_EXPR
:
13953 RETURN (build_must_not_throw_expr (RECUR (TREE_OPERAND (t
, 0)),
13954 RECUR (MUST_NOT_THROW_COND (t
))));
13956 case EXPR_PACK_EXPANSION
:
13957 error ("invalid use of pack expansion expression");
13958 RETURN (error_mark_node
);
13960 case NONTYPE_ARGUMENT_PACK
:
13961 error ("use %<...%> to expand argument pack");
13962 RETURN (error_mark_node
);
13964 case CILK_SPAWN_STMT
:
13965 cfun
->calls_cilk_spawn
= 1;
13966 RETURN (build_cilk_spawn (EXPR_LOCATION (t
), RECUR (CILK_SPAWN_FN (t
))));
13968 case CILK_SYNC_STMT
:
13969 RETURN (build_cilk_sync ());
13971 case COMPOUND_EXPR
:
13972 tmp
= RECUR (TREE_OPERAND (t
, 0));
13973 if (tmp
== NULL_TREE
)
13974 /* If the first operand was a statement, we're done with it. */
13975 RETURN (RECUR (TREE_OPERAND (t
, 1)));
13976 RETURN (build_x_compound_expr (EXPR_LOCATION (t
), tmp
,
13977 RECUR (TREE_OPERAND (t
, 1)),
13980 case ANNOTATE_EXPR
:
13981 tmp
= RECUR (TREE_OPERAND (t
, 0));
13982 RETURN (build2_loc (EXPR_LOCATION (t
), ANNOTATE_EXPR
,
13983 TREE_TYPE (tmp
), tmp
, RECUR (TREE_OPERAND (t
, 1))));
13986 gcc_assert (!STATEMENT_CODE_P (TREE_CODE (t
)));
13988 RETURN (tsubst_copy_and_build (t
, args
, complain
, in_decl
,
13989 /*function_p=*/false,
13990 integral_constant_expression_p
));
13993 RETURN (NULL_TREE
);
13995 input_location
= loc
;
14001 /* Instantiate the special body of the artificial DECL_OMP_DECLARE_REDUCTION
14002 function. For description of the body see comment above
14003 cp_parser_omp_declare_reduction_exprs. */
14006 tsubst_omp_udr (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
14008 if (t
== NULL_TREE
|| t
== error_mark_node
)
14011 gcc_assert (TREE_CODE (t
) == STATEMENT_LIST
);
14013 tree_stmt_iterator tsi
;
14016 memset (stmts
, 0, sizeof stmts
);
14017 for (i
= 0, tsi
= tsi_start (t
);
14018 i
< 7 && !tsi_end_p (tsi
);
14019 i
++, tsi_next (&tsi
))
14020 stmts
[i
] = tsi_stmt (tsi
);
14021 gcc_assert (tsi_end_p (tsi
));
14025 gcc_assert (TREE_CODE (stmts
[0]) == DECL_EXPR
14026 && TREE_CODE (stmts
[1]) == DECL_EXPR
);
14027 tree omp_out
= tsubst (DECL_EXPR_DECL (stmts
[0]),
14028 args
, complain
, in_decl
);
14029 tree omp_in
= tsubst (DECL_EXPR_DECL (stmts
[1]),
14030 args
, complain
, in_decl
);
14031 DECL_CONTEXT (omp_out
) = current_function_decl
;
14032 DECL_CONTEXT (omp_in
) = current_function_decl
;
14033 keep_next_level (true);
14034 tree block
= begin_omp_structured_block ();
14035 tsubst_expr (stmts
[2], args
, complain
, in_decl
, false);
14036 block
= finish_omp_structured_block (block
);
14037 block
= maybe_cleanup_point_expr_void (block
);
14038 add_decl_expr (omp_out
);
14039 if (TREE_NO_WARNING (DECL_EXPR_DECL (stmts
[0])))
14040 TREE_NO_WARNING (omp_out
) = 1;
14041 add_decl_expr (omp_in
);
14042 finish_expr_stmt (block
);
14046 gcc_assert (TREE_CODE (stmts
[3]) == DECL_EXPR
14047 && TREE_CODE (stmts
[4]) == DECL_EXPR
);
14048 tree omp_priv
= tsubst (DECL_EXPR_DECL (stmts
[3]),
14049 args
, complain
, in_decl
);
14050 tree omp_orig
= tsubst (DECL_EXPR_DECL (stmts
[4]),
14051 args
, complain
, in_decl
);
14052 DECL_CONTEXT (omp_priv
) = current_function_decl
;
14053 DECL_CONTEXT (omp_orig
) = current_function_decl
;
14054 keep_next_level (true);
14055 tree block
= begin_omp_structured_block ();
14056 tsubst_expr (stmts
[5], args
, complain
, in_decl
, false);
14057 block
= finish_omp_structured_block (block
);
14058 block
= maybe_cleanup_point_expr_void (block
);
14059 cp_walk_tree (&block
, cp_remove_omp_priv_cleanup_stmt
, omp_priv
, NULL
);
14060 add_decl_expr (omp_priv
);
14061 add_decl_expr (omp_orig
);
14062 finish_expr_stmt (block
);
14064 add_decl_expr (omp_orig
);
14068 /* T is a postfix-expression that is not being used in a function
14069 call. Return the substituted version of T. */
14072 tsubst_non_call_postfix_expression (tree t
, tree args
,
14073 tsubst_flags_t complain
,
14076 if (TREE_CODE (t
) == SCOPE_REF
)
14077 t
= tsubst_qualified_id (t
, args
, complain
, in_decl
,
14078 /*done=*/false, /*address_p=*/false);
14080 t
= tsubst_copy_and_build (t
, args
, complain
, in_decl
,
14081 /*function_p=*/false,
14082 /*integral_constant_expression_p=*/false);
14087 /* Sentinel to disable certain warnings during template substitution. */
14089 struct warning_sentinel
{
14092 warning_sentinel(int& flag
, bool suppress
=true)
14093 : flag(flag
), val(flag
) { if (suppress
) flag
= 0; }
14094 ~warning_sentinel() { flag
= val
; }
14097 /* Like tsubst but deals with expressions and performs semantic
14098 analysis. FUNCTION_P is true if T is the "F" in "F (ARGS)". */
14101 tsubst_copy_and_build (tree t
,
14103 tsubst_flags_t complain
,
14106 bool integral_constant_expression_p
)
14108 #define RETURN(EXP) do { retval = (EXP); goto out; } while(0)
14109 #define RECUR(NODE) \
14110 tsubst_copy_and_build (NODE, args, complain, in_decl, \
14111 /*function_p=*/false, \
14112 integral_constant_expression_p)
14117 if (t
== NULL_TREE
|| t
== error_mark_node
)
14120 loc
= input_location
;
14121 if (EXPR_HAS_LOCATION (t
))
14122 input_location
= EXPR_LOCATION (t
);
14124 /* N3276 decltype magic only applies to calls at the top level or on the
14125 right side of a comma. */
14126 tsubst_flags_t decltype_flag
= (complain
& tf_decltype
);
14127 complain
&= ~tf_decltype
;
14129 switch (TREE_CODE (t
))
14133 /* Fall through. */
14134 case IDENTIFIER_NODE
:
14138 bool non_integral_constant_expression_p
;
14139 const char *error_msg
;
14141 if (IDENTIFIER_TYPENAME_P (t
))
14143 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14144 t
= mangle_conv_op_name_for_type (new_type
);
14147 /* Look up the name. */
14148 decl
= lookup_name (t
);
14150 /* By convention, expressions use ERROR_MARK_NODE to indicate
14151 failure, not NULL_TREE. */
14152 if (decl
== NULL_TREE
)
14153 decl
= error_mark_node
;
14155 decl
= finish_id_expression (t
, decl
, NULL_TREE
,
14157 integral_constant_expression_p
,
14158 /*allow_non_integral_constant_expression_p=*/(cxx_dialect
>= cxx11
),
14159 &non_integral_constant_expression_p
,
14160 /*template_p=*/false,
14162 /*address_p=*/false,
14163 /*template_arg_p=*/false,
14168 if (!function_p
&& identifier_p (decl
))
14170 if (complain
& tf_error
)
14171 unqualified_name_lookup_error (decl
);
14172 decl
= error_mark_node
;
14177 case TEMPLATE_ID_EXPR
:
14180 tree templ
= RECUR (TREE_OPERAND (t
, 0));
14181 tree targs
= TREE_OPERAND (t
, 1);
14184 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
14186 if (TREE_CODE (templ
) == COMPONENT_REF
)
14188 object
= TREE_OPERAND (templ
, 0);
14189 templ
= TREE_OPERAND (templ
, 1);
14192 object
= NULL_TREE
;
14193 templ
= lookup_template_function (templ
, targs
);
14196 RETURN (build3 (COMPONENT_REF
, TREE_TYPE (templ
),
14197 object
, templ
, NULL_TREE
));
14199 RETURN (baselink_for_fns (templ
));
14204 tree r
= RECUR (TREE_OPERAND (t
, 0));
14206 if (REFERENCE_REF_P (t
))
14208 /* A type conversion to reference type will be enclosed in
14209 such an indirect ref, but the substitution of the cast
14210 will have also added such an indirect ref. */
14211 if (TREE_CODE (TREE_TYPE (r
)) == REFERENCE_TYPE
)
14212 r
= convert_from_reference (r
);
14215 r
= build_x_indirect_ref (input_location
, r
, RO_UNARY_STAR
,
14216 complain
|decltype_flag
);
14222 (tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
14223 RECUR (TREE_OPERAND (t
, 0))));
14225 case IMPLICIT_CONV_EXPR
:
14227 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14228 tree expr
= RECUR (TREE_OPERAND (t
, 0));
14229 int flags
= LOOKUP_IMPLICIT
;
14230 if (IMPLICIT_CONV_EXPR_DIRECT_INIT (t
))
14231 flags
= LOOKUP_NORMAL
;
14232 RETURN (perform_implicit_conversion_flags (type
, expr
, complain
,
14239 tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
14240 RECUR (TREE_OPERAND (t
, 0))));
14243 case REINTERPRET_CAST_EXPR
:
14244 case CONST_CAST_EXPR
:
14245 case DYNAMIC_CAST_EXPR
:
14246 case STATIC_CAST_EXPR
:
14249 tree op
, r
= NULL_TREE
;
14251 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14252 if (integral_constant_expression_p
14253 && !cast_valid_in_integral_constant_expression_p (type
))
14255 if (complain
& tf_error
)
14256 error ("a cast to a type other than an integral or "
14257 "enumeration type cannot appear in a constant-expression");
14258 RETURN (error_mark_node
);
14261 op
= RECUR (TREE_OPERAND (t
, 0));
14263 warning_sentinel
s(warn_useless_cast
);
14264 switch (TREE_CODE (t
))
14267 r
= build_functional_cast (type
, op
, complain
);
14269 case REINTERPRET_CAST_EXPR
:
14270 r
= build_reinterpret_cast (type
, op
, complain
);
14272 case CONST_CAST_EXPR
:
14273 r
= build_const_cast (type
, op
, complain
);
14275 case DYNAMIC_CAST_EXPR
:
14276 r
= build_dynamic_cast (type
, op
, complain
);
14278 case STATIC_CAST_EXPR
:
14279 r
= build_static_cast (type
, op
, complain
);
14282 gcc_unreachable ();
14288 case POSTDECREMENT_EXPR
:
14289 case POSTINCREMENT_EXPR
:
14290 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
14291 args
, complain
, in_decl
);
14292 RETURN (build_x_unary_op (input_location
, TREE_CODE (t
), op1
,
14293 complain
|decltype_flag
));
14295 case PREDECREMENT_EXPR
:
14296 case PREINCREMENT_EXPR
:
14300 case TRUTH_NOT_EXPR
:
14301 case UNARY_PLUS_EXPR
: /* Unary + */
14302 case REALPART_EXPR
:
14303 case IMAGPART_EXPR
:
14304 RETURN (build_x_unary_op (input_location
, TREE_CODE (t
),
14305 RECUR (TREE_OPERAND (t
, 0)),
14306 complain
|decltype_flag
));
14308 case FIX_TRUNC_EXPR
:
14309 RETURN (cp_build_unary_op (FIX_TRUNC_EXPR
, RECUR (TREE_OPERAND (t
, 0)),
14313 op1
= TREE_OPERAND (t
, 0);
14314 if (TREE_CODE (op1
) == LABEL_DECL
)
14315 RETURN (finish_label_address_expr (DECL_NAME (op1
),
14316 EXPR_LOCATION (op1
)));
14317 if (TREE_CODE (op1
) == SCOPE_REF
)
14318 op1
= tsubst_qualified_id (op1
, args
, complain
, in_decl
,
14319 /*done=*/true, /*address_p=*/true);
14321 op1
= tsubst_non_call_postfix_expression (op1
, args
, complain
,
14323 RETURN (build_x_unary_op (input_location
, ADDR_EXPR
, op1
,
14324 complain
|decltype_flag
));
14329 case TRUNC_DIV_EXPR
:
14330 case CEIL_DIV_EXPR
:
14331 case FLOOR_DIV_EXPR
:
14332 case ROUND_DIV_EXPR
:
14333 case EXACT_DIV_EXPR
:
14337 case TRUNC_MOD_EXPR
:
14338 case FLOOR_MOD_EXPR
:
14339 case TRUTH_ANDIF_EXPR
:
14340 case TRUTH_ORIF_EXPR
:
14341 case TRUTH_AND_EXPR
:
14342 case TRUTH_OR_EXPR
:
14358 warning_sentinel
s1(warn_type_limits
);
14359 warning_sentinel
s2(warn_div_by_zero
);
14360 tree r
= build_x_binary_op
14361 (input_location
, TREE_CODE (t
),
14362 RECUR (TREE_OPERAND (t
, 0)),
14363 (TREE_NO_WARNING (TREE_OPERAND (t
, 0))
14365 : TREE_CODE (TREE_OPERAND (t
, 0))),
14366 RECUR (TREE_OPERAND (t
, 1)),
14367 (TREE_NO_WARNING (TREE_OPERAND (t
, 1))
14369 : TREE_CODE (TREE_OPERAND (t
, 1))),
14371 complain
|decltype_flag
);
14372 if (EXPR_P (r
) && TREE_NO_WARNING (t
))
14373 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
14378 case POINTER_PLUS_EXPR
:
14379 return fold_build_pointer_plus (RECUR (TREE_OPERAND (t
, 0)),
14380 RECUR (TREE_OPERAND (t
, 1)));
14383 RETURN (tsubst_qualified_id (t
, args
, complain
, in_decl
, /*done=*/true,
14384 /*address_p=*/false));
14386 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
14387 args
, complain
, in_decl
);
14388 RETURN (build_x_array_ref (EXPR_LOCATION (t
), op1
,
14389 RECUR (TREE_OPERAND (t
, 1)),
14390 complain
|decltype_flag
));
14392 case ARRAY_NOTATION_REF
:
14394 tree start_index
, length
, stride
;
14395 op1
= tsubst_non_call_postfix_expression (ARRAY_NOTATION_ARRAY (t
),
14396 args
, complain
, in_decl
);
14397 start_index
= RECUR (ARRAY_NOTATION_START (t
));
14398 length
= RECUR (ARRAY_NOTATION_LENGTH (t
));
14399 stride
= RECUR (ARRAY_NOTATION_STRIDE (t
));
14400 RETURN (build_array_notation_ref (EXPR_LOCATION (t
), op1
, start_index
,
14401 length
, stride
, TREE_TYPE (op1
)));
14404 if (PACK_EXPANSION_P (TREE_OPERAND (t
, 0)))
14405 RETURN (tsubst_copy (t
, args
, complain
, in_decl
));
14412 op1
= TREE_OPERAND (t
, 0);
14413 if (TREE_CODE (t
) == SIZEOF_EXPR
&& SIZEOF_EXPR_TYPE_P (t
))
14414 op1
= TREE_TYPE (op1
);
14417 /* When there are no ARGS, we are trying to evaluate a
14418 non-dependent expression from the parser. Trying to do
14419 the substitutions may not work. */
14421 op1
= TREE_TYPE (op1
);
14425 ++cp_unevaluated_operand
;
14426 ++c_inhibit_evaluation_warnings
;
14428 op1
= tsubst (op1
, args
, complain
, in_decl
);
14430 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
14431 /*function_p=*/false,
14432 /*integral_constant_expression_p=*/
14434 --cp_unevaluated_operand
;
14435 --c_inhibit_evaluation_warnings
;
14438 r
= cxx_sizeof_or_alignof_type (op1
, TREE_CODE (t
),
14439 complain
& tf_error
);
14441 r
= cxx_sizeof_or_alignof_expr (op1
, TREE_CODE (t
),
14442 complain
& tf_error
);
14443 if (TREE_CODE (t
) == SIZEOF_EXPR
&& r
!= error_mark_node
)
14445 if (TREE_CODE (r
) != SIZEOF_EXPR
|| TYPE_P (op1
))
14447 if (!processing_template_decl
&& TYPE_P (op1
))
14449 r
= build_min (SIZEOF_EXPR
, size_type_node
,
14450 build1 (NOP_EXPR
, op1
, error_mark_node
));
14451 SIZEOF_EXPR_TYPE_P (r
) = 1;
14454 r
= build_min (SIZEOF_EXPR
, size_type_node
, op1
);
14455 TREE_SIDE_EFFECTS (r
) = 0;
14456 TREE_READONLY (r
) = 1;
14458 SET_EXPR_LOCATION (r
, EXPR_LOCATION (t
));
14463 case AT_ENCODE_EXPR
:
14465 op1
= TREE_OPERAND (t
, 0);
14466 ++cp_unevaluated_operand
;
14467 ++c_inhibit_evaluation_warnings
;
14468 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
14469 /*function_p=*/false,
14470 /*integral_constant_expression_p=*/false);
14471 --cp_unevaluated_operand
;
14472 --c_inhibit_evaluation_warnings
;
14473 RETURN (objc_build_encode_expr (op1
));
14476 case NOEXCEPT_EXPR
:
14477 op1
= TREE_OPERAND (t
, 0);
14478 ++cp_unevaluated_operand
;
14479 ++c_inhibit_evaluation_warnings
;
14480 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
14481 /*function_p=*/false,
14482 /*integral_constant_expression_p=*/false);
14483 --cp_unevaluated_operand
;
14484 --c_inhibit_evaluation_warnings
;
14485 RETURN (finish_noexcept_expr (op1
, complain
));
14489 warning_sentinel
s(warn_div_by_zero
);
14490 tree r
= build_x_modify_expr
14491 (EXPR_LOCATION (t
),
14492 RECUR (TREE_OPERAND (t
, 0)),
14493 TREE_CODE (TREE_OPERAND (t
, 1)),
14494 RECUR (TREE_OPERAND (t
, 2)),
14495 complain
|decltype_flag
);
14496 /* TREE_NO_WARNING must be set if either the expression was
14497 parenthesized or it uses an operator such as >>= rather
14498 than plain assignment. In the former case, it was already
14499 set and must be copied. In the latter case,
14500 build_x_modify_expr sets it and it must not be reset
14502 if (TREE_NO_WARNING (t
))
14503 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
14509 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
14510 args
, complain
, in_decl
);
14511 /* Remember that there was a reference to this entity. */
14514 RETURN (build_x_arrow (input_location
, op1
, complain
));
14518 tree placement
= RECUR (TREE_OPERAND (t
, 0));
14519 tree init
= RECUR (TREE_OPERAND (t
, 3));
14520 vec
<tree
, va_gc
> *placement_vec
;
14521 vec
<tree
, va_gc
> *init_vec
;
14524 if (placement
== NULL_TREE
)
14525 placement_vec
= NULL
;
14528 placement_vec
= make_tree_vector ();
14529 for (; placement
!= NULL_TREE
; placement
= TREE_CHAIN (placement
))
14530 vec_safe_push (placement_vec
, TREE_VALUE (placement
));
14533 /* If there was an initializer in the original tree, but it
14534 instantiated to an empty list, then we should pass a
14535 non-NULL empty vector to tell build_new that it was an
14536 empty initializer() rather than no initializer. This can
14537 only happen when the initializer is a pack expansion whose
14538 parameter packs are of length zero. */
14539 if (init
== NULL_TREE
&& TREE_OPERAND (t
, 3) == NULL_TREE
)
14543 init_vec
= make_tree_vector ();
14544 if (init
== void_zero_node
)
14545 gcc_assert (init_vec
!= NULL
);
14548 for (; init
!= NULL_TREE
; init
= TREE_CHAIN (init
))
14549 vec_safe_push (init_vec
, TREE_VALUE (init
));
14553 ret
= build_new (&placement_vec
,
14554 tsubst (TREE_OPERAND (t
, 1), args
, complain
, in_decl
),
14555 RECUR (TREE_OPERAND (t
, 2)),
14557 NEW_EXPR_USE_GLOBAL (t
),
14560 if (placement_vec
!= NULL
)
14561 release_tree_vector (placement_vec
);
14562 if (init_vec
!= NULL
)
14563 release_tree_vector (init_vec
);
14569 RETURN (delete_sanity
14570 (RECUR (TREE_OPERAND (t
, 0)),
14571 RECUR (TREE_OPERAND (t
, 1)),
14572 DELETE_EXPR_USE_VEC (t
),
14573 DELETE_EXPR_USE_GLOBAL (t
),
14576 case COMPOUND_EXPR
:
14578 tree op0
= tsubst_copy_and_build (TREE_OPERAND (t
, 0), args
,
14579 complain
& ~tf_decltype
, in_decl
,
14580 /*function_p=*/false,
14581 integral_constant_expression_p
);
14582 RETURN (build_x_compound_expr (EXPR_LOCATION (t
),
14584 RECUR (TREE_OPERAND (t
, 1)),
14585 complain
|decltype_flag
));
14591 vec
<tree
, va_gc
> *call_args
;
14592 unsigned int nargs
, i
;
14597 function
= CALL_EXPR_FN (t
);
14598 /* When we parsed the expression, we determined whether or
14599 not Koenig lookup should be performed. */
14600 koenig_p
= KOENIG_LOOKUP_P (t
);
14601 if (TREE_CODE (function
) == SCOPE_REF
)
14603 qualified_p
= true;
14604 function
= tsubst_qualified_id (function
, args
, complain
, in_decl
,
14606 /*address_p=*/false);
14608 else if (koenig_p
&& identifier_p (function
))
14610 /* Do nothing; calling tsubst_copy_and_build on an identifier
14611 would incorrectly perform unqualified lookup again.
14613 Note that we can also have an IDENTIFIER_NODE if the earlier
14614 unqualified lookup found a member function; in that case
14615 koenig_p will be false and we do want to do the lookup
14616 again to find the instantiated member function.
14618 FIXME but doing that causes c++/15272, so we need to stop
14619 using IDENTIFIER_NODE in that situation. */
14620 qualified_p
= false;
14624 if (TREE_CODE (function
) == COMPONENT_REF
)
14626 tree op
= TREE_OPERAND (function
, 1);
14628 qualified_p
= (TREE_CODE (op
) == SCOPE_REF
14629 || (BASELINK_P (op
)
14630 && BASELINK_QUALIFIED_P (op
)));
14633 qualified_p
= false;
14635 if (TREE_CODE (function
) == ADDR_EXPR
14636 && TREE_CODE (TREE_OPERAND (function
, 0)) == FUNCTION_DECL
)
14637 /* Avoid error about taking the address of a constructor. */
14638 function
= TREE_OPERAND (function
, 0);
14640 function
= tsubst_copy_and_build (function
, args
, complain
,
14643 integral_constant_expression_p
);
14645 if (BASELINK_P (function
))
14646 qualified_p
= true;
14649 nargs
= call_expr_nargs (t
);
14650 call_args
= make_tree_vector ();
14651 for (i
= 0; i
< nargs
; ++i
)
14653 tree arg
= CALL_EXPR_ARG (t
, i
);
14655 if (!PACK_EXPANSION_P (arg
))
14656 vec_safe_push (call_args
, RECUR (CALL_EXPR_ARG (t
, i
)));
14659 /* Expand the pack expansion and push each entry onto
14661 arg
= tsubst_pack_expansion (arg
, args
, complain
, in_decl
);
14662 if (TREE_CODE (arg
) == TREE_VEC
)
14664 unsigned int len
, j
;
14666 len
= TREE_VEC_LENGTH (arg
);
14667 for (j
= 0; j
< len
; ++j
)
14669 tree value
= TREE_VEC_ELT (arg
, j
);
14670 if (value
!= NULL_TREE
)
14671 value
= convert_from_reference (value
);
14672 vec_safe_push (call_args
, value
);
14677 /* A partial substitution. Add one entry. */
14678 vec_safe_push (call_args
, arg
);
14683 /* We do not perform argument-dependent lookup if normal
14684 lookup finds a non-function, in accordance with the
14685 expected resolution of DR 218. */
14687 && ((is_overloaded_fn (function
)
14688 /* If lookup found a member function, the Koenig lookup is
14689 not appropriate, even if an unqualified-name was used
14690 to denote the function. */
14691 && !DECL_FUNCTION_MEMBER_P (get_first_fn (function
)))
14692 || identifier_p (function
))
14693 /* Only do this when substitution turns a dependent call
14694 into a non-dependent call. */
14695 && type_dependent_expression_p_push (t
)
14696 && !any_type_dependent_arguments_p (call_args
))
14697 function
= perform_koenig_lookup (function
, call_args
, tf_none
);
14699 if (identifier_p (function
)
14700 && !any_type_dependent_arguments_p (call_args
))
14702 if (koenig_p
&& (complain
& tf_warning_or_error
))
14704 /* For backwards compatibility and good diagnostics, try
14705 the unqualified lookup again if we aren't in SFINAE
14707 tree unq
= (tsubst_copy_and_build
14708 (function
, args
, complain
, in_decl
, true,
14709 integral_constant_expression_p
));
14710 if (unq
== error_mark_node
)
14711 RETURN (error_mark_node
);
14713 if (unq
!= function
)
14716 if (INDIRECT_REF_P (fn
))
14717 fn
= TREE_OPERAND (fn
, 0);
14718 if (TREE_CODE (fn
) == COMPONENT_REF
)
14719 fn
= TREE_OPERAND (fn
, 1);
14720 if (is_overloaded_fn (fn
))
14721 fn
= get_first_fn (fn
);
14722 if (permerror (EXPR_LOC_OR_LOC (t
, input_location
),
14723 "%qD was not declared in this scope, "
14724 "and no declarations were found by "
14725 "argument-dependent lookup at the point "
14726 "of instantiation", function
))
14729 /* Can't say anything more. */;
14730 else if (DECL_CLASS_SCOPE_P (fn
))
14732 location_t loc
= EXPR_LOC_OR_LOC (t
,
14735 "declarations in dependent base %qT are "
14736 "not found by unqualified lookup",
14737 DECL_CLASS_CONTEXT (fn
));
14738 if (current_class_ptr
)
14740 "use %<this->%D%> instead", function
);
14743 "use %<%T::%D%> instead",
14744 current_class_name
, function
);
14747 inform (0, "%q+D declared here, later in the "
14748 "translation unit", fn
);
14753 if (identifier_p (function
))
14755 if (complain
& tf_error
)
14756 unqualified_name_lookup_error (function
);
14757 release_tree_vector (call_args
);
14758 RETURN (error_mark_node
);
14762 /* Remember that there was a reference to this entity. */
14763 if (DECL_P (function
))
14764 mark_used (function
);
14766 /* Put back tf_decltype for the actual call. */
14767 complain
|= decltype_flag
;
14769 if (TREE_CODE (function
) == OFFSET_REF
)
14770 ret
= build_offset_ref_call_from_tree (function
, &call_args
,
14772 else if (TREE_CODE (function
) == COMPONENT_REF
)
14774 tree instance
= TREE_OPERAND (function
, 0);
14775 tree fn
= TREE_OPERAND (function
, 1);
14777 if (processing_template_decl
14778 && (type_dependent_expression_p (instance
)
14779 || (!BASELINK_P (fn
)
14780 && TREE_CODE (fn
) != FIELD_DECL
)
14781 || type_dependent_expression_p (fn
)
14782 || any_type_dependent_arguments_p (call_args
)))
14783 ret
= build_nt_call_vec (function
, call_args
);
14784 else if (!BASELINK_P (fn
))
14785 ret
= finish_call_expr (function
, &call_args
,
14786 /*disallow_virtual=*/false,
14787 /*koenig_p=*/false,
14790 ret
= (build_new_method_call
14792 &call_args
, NULL_TREE
,
14793 qualified_p
? LOOKUP_NONVIRTUAL
: LOOKUP_NORMAL
,
14798 ret
= finish_call_expr (function
, &call_args
,
14799 /*disallow_virtual=*/qualified_p
,
14803 release_tree_vector (call_args
);
14810 tree cond
= RECUR (TREE_OPERAND (t
, 0));
14813 if (TREE_CODE (cond
) == INTEGER_CST
)
14815 if (integer_zerop (cond
))
14817 ++c_inhibit_evaluation_warnings
;
14818 exp1
= RECUR (TREE_OPERAND (t
, 1));
14819 --c_inhibit_evaluation_warnings
;
14820 exp2
= RECUR (TREE_OPERAND (t
, 2));
14824 exp1
= RECUR (TREE_OPERAND (t
, 1));
14825 ++c_inhibit_evaluation_warnings
;
14826 exp2
= RECUR (TREE_OPERAND (t
, 2));
14827 --c_inhibit_evaluation_warnings
;
14832 exp1
= RECUR (TREE_OPERAND (t
, 1));
14833 exp2
= RECUR (TREE_OPERAND (t
, 2));
14836 RETURN (build_x_conditional_expr (EXPR_LOCATION (t
),
14837 cond
, exp1
, exp2
, complain
));
14840 case PSEUDO_DTOR_EXPR
:
14841 RETURN (finish_pseudo_destructor_expr
14842 (RECUR (TREE_OPERAND (t
, 0)),
14843 RECUR (TREE_OPERAND (t
, 1)),
14844 tsubst (TREE_OPERAND (t
, 2), args
, complain
, in_decl
),
14849 tree purpose
, value
, chain
;
14851 if (t
== void_list_node
)
14854 if ((TREE_PURPOSE (t
) && PACK_EXPANSION_P (TREE_PURPOSE (t
)))
14855 || (TREE_VALUE (t
) && PACK_EXPANSION_P (TREE_VALUE (t
))))
14857 /* We have pack expansions, so expand those and
14858 create a new list out of it. */
14859 tree purposevec
= NULL_TREE
;
14860 tree valuevec
= NULL_TREE
;
14864 /* Expand the argument expressions. */
14865 if (TREE_PURPOSE (t
))
14866 purposevec
= tsubst_pack_expansion (TREE_PURPOSE (t
), args
,
14867 complain
, in_decl
);
14868 if (TREE_VALUE (t
))
14869 valuevec
= tsubst_pack_expansion (TREE_VALUE (t
), args
,
14870 complain
, in_decl
);
14872 /* Build the rest of the list. */
14873 chain
= TREE_CHAIN (t
);
14874 if (chain
&& chain
!= void_type_node
)
14875 chain
= RECUR (chain
);
14877 /* Determine the number of arguments. */
14878 if (purposevec
&& TREE_CODE (purposevec
) == TREE_VEC
)
14880 len
= TREE_VEC_LENGTH (purposevec
);
14881 gcc_assert (!valuevec
|| len
== TREE_VEC_LENGTH (valuevec
));
14883 else if (TREE_CODE (valuevec
) == TREE_VEC
)
14884 len
= TREE_VEC_LENGTH (valuevec
);
14887 /* Since we only performed a partial substitution into
14888 the argument pack, we only RETURN (a single list
14890 if (purposevec
== TREE_PURPOSE (t
)
14891 && valuevec
== TREE_VALUE (t
)
14892 && chain
== TREE_CHAIN (t
))
14895 RETURN (tree_cons (purposevec
, valuevec
, chain
));
14898 /* Convert the argument vectors into a TREE_LIST */
14902 /* Grab the Ith values. */
14904 purpose
= purposevec
? TREE_VEC_ELT (purposevec
, i
)
14907 = valuevec
? convert_from_reference (TREE_VEC_ELT (valuevec
, i
))
14910 /* Build the list (backwards). */
14911 chain
= tree_cons (purpose
, value
, chain
);
14917 purpose
= TREE_PURPOSE (t
);
14919 purpose
= RECUR (purpose
);
14920 value
= TREE_VALUE (t
);
14922 value
= RECUR (value
);
14923 chain
= TREE_CHAIN (t
);
14924 if (chain
&& chain
!= void_type_node
)
14925 chain
= RECUR (chain
);
14926 if (purpose
== TREE_PURPOSE (t
)
14927 && value
== TREE_VALUE (t
)
14928 && chain
== TREE_CHAIN (t
))
14930 RETURN (tree_cons (purpose
, value
, chain
));
14933 case COMPONENT_REF
:
14940 object
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
14941 args
, complain
, in_decl
);
14942 /* Remember that there was a reference to this entity. */
14943 if (DECL_P (object
))
14944 mark_used (object
);
14945 object_type
= TREE_TYPE (object
);
14947 member
= TREE_OPERAND (t
, 1);
14948 if (BASELINK_P (member
))
14949 member
= tsubst_baselink (member
,
14950 non_reference (TREE_TYPE (object
)),
14951 args
, complain
, in_decl
);
14953 member
= tsubst_copy (member
, args
, complain
, in_decl
);
14954 if (member
== error_mark_node
)
14955 RETURN (error_mark_node
);
14957 if (type_dependent_expression_p (object
))
14958 /* We can't do much here. */;
14959 else if (!CLASS_TYPE_P (object_type
))
14961 if (scalarish_type_p (object_type
))
14963 tree s
= NULL_TREE
;
14964 tree dtor
= member
;
14966 if (TREE_CODE (dtor
) == SCOPE_REF
)
14968 s
= TREE_OPERAND (dtor
, 0);
14969 dtor
= TREE_OPERAND (dtor
, 1);
14971 if (TREE_CODE (dtor
) == BIT_NOT_EXPR
)
14973 dtor
= TREE_OPERAND (dtor
, 0);
14975 RETURN (finish_pseudo_destructor_expr
14976 (object
, s
, dtor
, input_location
));
14980 else if (TREE_CODE (member
) == SCOPE_REF
14981 && TREE_CODE (TREE_OPERAND (member
, 1)) == TEMPLATE_ID_EXPR
)
14983 /* Lookup the template functions now that we know what the
14985 tree scope
= TREE_OPERAND (member
, 0);
14986 tree tmpl
= TREE_OPERAND (TREE_OPERAND (member
, 1), 0);
14987 tree args
= TREE_OPERAND (TREE_OPERAND (member
, 1), 1);
14988 member
= lookup_qualified_name (scope
, tmpl
,
14989 /*is_type_p=*/false,
14990 /*complain=*/false);
14991 if (BASELINK_P (member
))
14993 BASELINK_FUNCTIONS (member
)
14994 = build_nt (TEMPLATE_ID_EXPR
, BASELINK_FUNCTIONS (member
),
14996 member
= (adjust_result_of_qualified_name_lookup
14997 (member
, BINFO_TYPE (BASELINK_BINFO (member
)),
15002 qualified_name_lookup_error (scope
, tmpl
, member
,
15004 RETURN (error_mark_node
);
15007 else if (TREE_CODE (member
) == SCOPE_REF
15008 && !CLASS_TYPE_P (TREE_OPERAND (member
, 0))
15009 && TREE_CODE (TREE_OPERAND (member
, 0)) != NAMESPACE_DECL
)
15011 if (complain
& tf_error
)
15013 if (TYPE_P (TREE_OPERAND (member
, 0)))
15014 error ("%qT is not a class or namespace",
15015 TREE_OPERAND (member
, 0));
15017 error ("%qD is not a class or namespace",
15018 TREE_OPERAND (member
, 0));
15020 RETURN (error_mark_node
);
15022 else if (TREE_CODE (member
) == FIELD_DECL
)
15024 r
= finish_non_static_data_member (member
, object
, NULL_TREE
);
15025 if (TREE_CODE (r
) == COMPONENT_REF
)
15026 REF_PARENTHESIZED_P (r
) = REF_PARENTHESIZED_P (t
);
15030 r
= finish_class_member_access_expr (object
, member
,
15031 /*template_p=*/false,
15033 if (TREE_CODE (r
) == COMPONENT_REF
)
15034 REF_PARENTHESIZED_P (r
) = REF_PARENTHESIZED_P (t
);
15039 RETURN (build_throw
15040 (RECUR (TREE_OPERAND (t
, 0))));
15044 vec
<constructor_elt
, va_gc
> *n
;
15045 constructor_elt
*ce
;
15046 unsigned HOST_WIDE_INT idx
;
15047 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15048 bool process_index_p
;
15050 bool need_copy_p
= false;
15053 if (type
== error_mark_node
)
15054 RETURN (error_mark_node
);
15056 /* digest_init will do the wrong thing if we let it. */
15057 if (type
&& TYPE_PTRMEMFUNC_P (type
))
15060 /* We do not want to process the index of aggregate
15061 initializers as they are identifier nodes which will be
15062 looked up by digest_init. */
15063 process_index_p
= !(type
&& MAYBE_CLASS_TYPE_P (type
));
15065 n
= vec_safe_copy (CONSTRUCTOR_ELTS (t
));
15066 newlen
= vec_safe_length (n
);
15067 FOR_EACH_VEC_SAFE_ELT (n
, idx
, ce
)
15069 if (ce
->index
&& process_index_p
15070 /* An identifier index is looked up in the type
15071 being initialized, not the current scope. */
15072 && TREE_CODE (ce
->index
) != IDENTIFIER_NODE
)
15073 ce
->index
= RECUR (ce
->index
);
15075 if (PACK_EXPANSION_P (ce
->value
))
15077 /* Substitute into the pack expansion. */
15078 ce
->value
= tsubst_pack_expansion (ce
->value
, args
, complain
,
15081 if (ce
->value
== error_mark_node
15082 || PACK_EXPANSION_P (ce
->value
))
15084 else if (TREE_VEC_LENGTH (ce
->value
) == 1)
15085 /* Just move the argument into place. */
15086 ce
->value
= TREE_VEC_ELT (ce
->value
, 0);
15089 /* Update the length of the final CONSTRUCTOR
15090 arguments vector, and note that we will need to
15092 newlen
= newlen
+ TREE_VEC_LENGTH (ce
->value
) - 1;
15093 need_copy_p
= true;
15097 ce
->value
= RECUR (ce
->value
);
15102 vec
<constructor_elt
, va_gc
> *old_n
= n
;
15104 vec_alloc (n
, newlen
);
15105 FOR_EACH_VEC_ELT (*old_n
, idx
, ce
)
15107 if (TREE_CODE (ce
->value
) == TREE_VEC
)
15109 int i
, len
= TREE_VEC_LENGTH (ce
->value
);
15110 for (i
= 0; i
< len
; ++i
)
15111 CONSTRUCTOR_APPEND_ELT (n
, 0,
15112 TREE_VEC_ELT (ce
->value
, i
));
15115 CONSTRUCTOR_APPEND_ELT (n
, 0, ce
->value
);
15119 r
= build_constructor (init_list_type_node
, n
);
15120 CONSTRUCTOR_IS_DIRECT_INIT (r
) = CONSTRUCTOR_IS_DIRECT_INIT (t
);
15122 if (TREE_HAS_CONSTRUCTOR (t
))
15123 RETURN (finish_compound_literal (type
, r
, complain
));
15125 TREE_TYPE (r
) = type
;
15131 tree operand_0
= TREE_OPERAND (t
, 0);
15132 if (TYPE_P (operand_0
))
15134 operand_0
= tsubst (operand_0
, args
, complain
, in_decl
);
15135 RETURN (get_typeid (operand_0
, complain
));
15139 operand_0
= RECUR (operand_0
);
15140 RETURN (build_typeid (operand_0
, complain
));
15147 else if (DECL_PACK_P (t
))
15149 /* We don't build decls for an instantiation of a
15150 variadic capture proxy, we instantiate the elements
15152 gcc_assert (DECL_HAS_VALUE_EXPR_P (t
));
15153 return RECUR (DECL_VALUE_EXPR (t
));
15159 tree r
= tsubst_copy (t
, args
, complain
, in_decl
);
15161 if (TREE_CODE (TREE_TYPE (t
)) != REFERENCE_TYPE
)
15162 /* If the original type was a reference, we'll be wrapped in
15163 the appropriate INDIRECT_REF. */
15164 r
= convert_from_reference (r
);
15169 RETURN (build_x_va_arg (EXPR_LOCATION (t
),
15170 RECUR (TREE_OPERAND (t
, 0)),
15171 tsubst (TREE_TYPE (t
), args
, complain
, in_decl
)));
15173 case OFFSETOF_EXPR
:
15174 RETURN (finish_offsetof (RECUR (TREE_OPERAND (t
, 0))));
15178 tree type1
= tsubst (TRAIT_EXPR_TYPE1 (t
), args
,
15179 complain
, in_decl
);
15181 tree type2
= TRAIT_EXPR_TYPE2 (t
);
15183 type2
= tsubst (type2
, args
, complain
, in_decl
);
15185 RETURN (finish_trait_expr (TRAIT_EXPR_KIND (t
), type1
, type2
));
15190 tree old_stmt_expr
= cur_stmt_expr
;
15191 tree stmt_expr
= begin_stmt_expr ();
15193 cur_stmt_expr
= stmt_expr
;
15194 tsubst_expr (STMT_EXPR_STMT (t
), args
, complain
, in_decl
,
15195 integral_constant_expression_p
);
15196 stmt_expr
= finish_stmt_expr (stmt_expr
, false);
15197 cur_stmt_expr
= old_stmt_expr
;
15199 /* If the resulting list of expression statement is empty,
15200 fold it further into void_zero_node. */
15201 if (empty_expr_stmt_p (stmt_expr
))
15202 stmt_expr
= void_zero_node
;
15204 RETURN (stmt_expr
);
15209 tree r
= build_lambda_expr ();
15211 tree type
= tsubst (LAMBDA_EXPR_CLOSURE (t
), args
, complain
, NULL_TREE
);
15212 LAMBDA_EXPR_CLOSURE (r
) = type
;
15213 CLASSTYPE_LAMBDA_EXPR (type
) = r
;
15215 LAMBDA_EXPR_LOCATION (r
)
15216 = LAMBDA_EXPR_LOCATION (t
);
15217 LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (r
)
15218 = LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (t
);
15219 LAMBDA_EXPR_MUTABLE_P (r
) = LAMBDA_EXPR_MUTABLE_P (t
);
15220 LAMBDA_EXPR_DISCRIMINATOR (r
)
15221 = (LAMBDA_EXPR_DISCRIMINATOR (t
));
15222 /* For a function scope, we want to use tsubst so that we don't
15223 complain about referring to an auto function before its return
15224 type has been deduced. Otherwise, we want to use tsubst_copy so
15225 that we look up the existing field/parameter/variable rather
15226 than build a new one. */
15227 tree scope
= LAMBDA_EXPR_EXTRA_SCOPE (t
);
15228 if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
)
15229 scope
= tsubst (scope
, args
, complain
, in_decl
);
15230 else if (scope
&& TREE_CODE (scope
) == PARM_DECL
)
15232 /* Look up the parameter we want directly, as tsubst_copy
15233 doesn't do what we need. */
15234 tree fn
= tsubst (DECL_CONTEXT (scope
), args
, complain
, in_decl
);
15235 tree parm
= FUNCTION_FIRST_USER_PARM (fn
);
15236 while (DECL_PARM_INDEX (parm
) != DECL_PARM_INDEX (scope
))
15237 parm
= DECL_CHAIN (parm
);
15239 /* FIXME Work around the parm not having DECL_CONTEXT set. */
15240 if (DECL_CONTEXT (scope
) == NULL_TREE
)
15241 DECL_CONTEXT (scope
) = fn
;
15244 scope
= RECUR (scope
);
15245 LAMBDA_EXPR_EXTRA_SCOPE (r
) = scope
;
15246 LAMBDA_EXPR_RETURN_TYPE (r
)
15247 = tsubst (LAMBDA_EXPR_RETURN_TYPE (t
), args
, complain
, in_decl
);
15249 gcc_assert (LAMBDA_EXPR_THIS_CAPTURE (t
) == NULL_TREE
15250 && LAMBDA_EXPR_PENDING_PROXIES (t
) == NULL
);
15252 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
15253 determine_visibility (TYPE_NAME (type
));
15254 /* Now that we know visibility, instantiate the type so we have a
15255 declaration of the op() for later calls to lambda_function. */
15256 complete_type (type
);
15258 LAMBDA_EXPR_THIS_CAPTURE (r
) = NULL_TREE
;
15260 RETURN (build_lambda_object (r
));
15264 /* We can get here for a constant initializer of non-dependent type.
15265 FIXME stop folding in cp_parser_initializer_clause. */
15267 tree r
= get_target_expr_sfinae (RECUR (TARGET_EXPR_INITIAL (t
)),
15272 case TRANSACTION_EXPR
:
15273 RETURN (tsubst_expr(t
, args
, complain
, in_decl
,
15274 integral_constant_expression_p
));
15277 RETURN (finish_parenthesized_expr (RECUR (TREE_OPERAND (t
, 0))));
15279 case VEC_PERM_EXPR
:
15280 RETURN (build_x_vec_perm_expr (input_location
,
15281 RECUR (TREE_OPERAND (t
, 0)),
15282 RECUR (TREE_OPERAND (t
, 1)),
15283 RECUR (TREE_OPERAND (t
, 2)),
15287 /* Handle Objective-C++ constructs, if appropriate. */
15290 = objcp_tsubst_copy_and_build (t
, args
, complain
,
15291 in_decl
, /*function_p=*/false);
15295 RETURN (tsubst_copy (t
, args
, complain
, in_decl
));
15301 input_location
= loc
;
15305 /* Verify that the instantiated ARGS are valid. For type arguments,
15306 make sure that the type's linkage is ok. For non-type arguments,
15307 make sure they are constants if they are integral or enumerations.
15308 Emit an error under control of COMPLAIN, and return TRUE on error. */
15311 check_instantiated_arg (tree tmpl
, tree t
, tsubst_flags_t complain
)
15313 if (dependent_template_arg_p (t
))
15315 if (ARGUMENT_PACK_P (t
))
15317 tree vec
= ARGUMENT_PACK_ARGS (t
);
15318 int len
= TREE_VEC_LENGTH (vec
);
15319 bool result
= false;
15322 for (i
= 0; i
< len
; ++i
)
15323 if (check_instantiated_arg (tmpl
, TREE_VEC_ELT (vec
, i
), complain
))
15327 else if (TYPE_P (t
))
15329 /* [basic.link]: A name with no linkage (notably, the name
15330 of a class or enumeration declared in a local scope)
15331 shall not be used to declare an entity with linkage.
15332 This implies that names with no linkage cannot be used as
15335 DR 757 relaxes this restriction for C++0x. */
15336 tree nt
= (cxx_dialect
> cxx98
? NULL_TREE
15337 : no_linkage_check (t
, /*relaxed_p=*/false));
15341 /* DR 488 makes use of a type with no linkage cause
15342 type deduction to fail. */
15343 if (complain
& tf_error
)
15345 if (TYPE_ANONYMOUS_P (nt
))
15346 error ("%qT is/uses anonymous type", t
);
15348 error ("template argument for %qD uses local type %qT",
15353 /* In order to avoid all sorts of complications, we do not
15354 allow variably-modified types as template arguments. */
15355 else if (variably_modified_type_p (t
, NULL_TREE
))
15357 if (complain
& tf_error
)
15358 error ("%qT is a variably modified type", t
);
15362 /* Class template and alias template arguments should be OK. */
15363 else if (DECL_TYPE_TEMPLATE_P (t
))
15365 /* A non-type argument of integral or enumerated type must be a
15367 else if (TREE_TYPE (t
)
15368 && INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (t
))
15369 && !TREE_CONSTANT (t
))
15371 if (complain
& tf_error
)
15372 error ("integral expression %qE is not constant", t
);
15379 check_instantiated_args (tree tmpl
, tree args
, tsubst_flags_t complain
)
15381 int ix
, len
= DECL_NTPARMS (tmpl
);
15382 bool result
= false;
15384 for (ix
= 0; ix
!= len
; ix
++)
15386 if (check_instantiated_arg (tmpl
, TREE_VEC_ELT (args
, ix
), complain
))
15389 if (result
&& (complain
& tf_error
))
15390 error (" trying to instantiate %qD", tmpl
);
15394 /* We're out of SFINAE context now, so generate diagnostics for the access
15395 errors we saw earlier when instantiating D from TMPL and ARGS. */
15398 recheck_decl_substitution (tree d
, tree tmpl
, tree args
)
15400 tree pattern
= DECL_TEMPLATE_RESULT (tmpl
);
15401 tree type
= TREE_TYPE (pattern
);
15402 location_t loc
= input_location
;
15404 push_access_scope (d
);
15405 push_deferring_access_checks (dk_no_deferred
);
15406 input_location
= DECL_SOURCE_LOCATION (pattern
);
15407 tsubst (type
, args
, tf_warning_or_error
, d
);
15408 input_location
= loc
;
15409 pop_deferring_access_checks ();
15410 pop_access_scope (d
);
15413 /* Instantiate the indicated variable, function, or alias template TMPL with
15414 the template arguments in TARG_PTR. */
15417 instantiate_template_1 (tree tmpl
, tree orig_args
, tsubst_flags_t complain
)
15419 tree targ_ptr
= orig_args
;
15423 bool access_ok
= true;
15425 if (tmpl
== error_mark_node
)
15426 return error_mark_node
;
15428 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
);
15430 /* If this function is a clone, handle it specially. */
15431 if (DECL_CLONED_FUNCTION_P (tmpl
))
15436 /* Use DECL_ABSTRACT_ORIGIN because only FUNCTION_DECLs have
15437 DECL_CLONED_FUNCTION. */
15438 spec
= instantiate_template (DECL_ABSTRACT_ORIGIN (tmpl
),
15439 targ_ptr
, complain
);
15440 if (spec
== error_mark_node
)
15441 return error_mark_node
;
15443 /* Look for the clone. */
15444 FOR_EACH_CLONE (clone
, spec
)
15445 if (DECL_NAME (clone
) == DECL_NAME (tmpl
))
15447 /* We should always have found the clone by now. */
15448 gcc_unreachable ();
15452 if (targ_ptr
== error_mark_node
)
15453 return error_mark_node
;
15455 /* Check to see if we already have this specialization. */
15456 gen_tmpl
= most_general_template (tmpl
);
15457 if (tmpl
!= gen_tmpl
)
15458 /* The TMPL is a partial instantiation. To get a full set of
15459 arguments we must add the arguments used to perform the
15460 partial instantiation. */
15461 targ_ptr
= add_outermost_template_args (DECL_TI_ARGS (tmpl
),
15464 /* It would be nice to avoid hashing here and then again in tsubst_decl,
15465 but it doesn't seem to be on the hot path. */
15466 spec
= retrieve_specialization (gen_tmpl
, targ_ptr
, 0);
15468 gcc_assert (tmpl
== gen_tmpl
15469 || ((fndecl
= retrieve_specialization (tmpl
, orig_args
, 0))
15471 || fndecl
== NULL_TREE
);
15473 if (spec
!= NULL_TREE
)
15475 if (FNDECL_HAS_ACCESS_ERRORS (spec
))
15477 if (complain
& tf_error
)
15478 recheck_decl_substitution (spec
, gen_tmpl
, targ_ptr
);
15479 return error_mark_node
;
15484 if (check_instantiated_args (gen_tmpl
, INNERMOST_TEMPLATE_ARGS (targ_ptr
),
15486 return error_mark_node
;
15488 /* We are building a FUNCTION_DECL, during which the access of its
15489 parameters and return types have to be checked. However this
15490 FUNCTION_DECL which is the desired context for access checking
15491 is not built yet. We solve this chicken-and-egg problem by
15492 deferring all checks until we have the FUNCTION_DECL. */
15493 push_deferring_access_checks (dk_deferred
);
15495 /* Instantiation of the function happens in the context of the function
15496 template, not the context of the overload resolution we're doing. */
15497 push_to_top_level ();
15498 /* If there are dependent arguments, e.g. because we're doing partial
15499 ordering, make sure processing_template_decl stays set. */
15500 if (uses_template_parms (targ_ptr
))
15501 ++processing_template_decl
;
15502 if (DECL_CLASS_SCOPE_P (gen_tmpl
))
15504 tree ctx
= tsubst (DECL_CONTEXT (gen_tmpl
), targ_ptr
,
15505 complain
, gen_tmpl
);
15506 push_nested_class (ctx
);
15508 /* Substitute template parameters to obtain the specialization. */
15509 fndecl
= tsubst (DECL_TEMPLATE_RESULT (gen_tmpl
),
15510 targ_ptr
, complain
, gen_tmpl
);
15511 if (DECL_CLASS_SCOPE_P (gen_tmpl
))
15512 pop_nested_class ();
15513 pop_from_top_level ();
15515 if (fndecl
== error_mark_node
)
15517 pop_deferring_access_checks ();
15518 return error_mark_node
;
15521 /* The DECL_TI_TEMPLATE should always be the immediate parent
15522 template, not the most general template. */
15523 DECL_TI_TEMPLATE (fndecl
) = tmpl
;
15525 /* Now we know the specialization, compute access previously
15527 push_access_scope (fndecl
);
15528 if (!perform_deferred_access_checks (complain
))
15530 pop_access_scope (fndecl
);
15531 pop_deferring_access_checks ();
15533 /* If we've just instantiated the main entry point for a function,
15534 instantiate all the alternate entry points as well. We do this
15535 by cloning the instantiation of the main entry point, not by
15536 instantiating the template clones. */
15537 if (DECL_CHAIN (gen_tmpl
) && DECL_CLONED_FUNCTION_P (DECL_CHAIN (gen_tmpl
)))
15538 clone_function_decl (fndecl
, /*update_method_vec_p=*/0);
15542 if (!(complain
& tf_error
))
15544 /* Remember to reinstantiate when we're out of SFINAE so the user
15545 can see the errors. */
15546 FNDECL_HAS_ACCESS_ERRORS (fndecl
) = true;
15548 return error_mark_node
;
15553 /* Wrapper for instantiate_template_1. */
15556 instantiate_template (tree tmpl
, tree orig_args
, tsubst_flags_t complain
)
15559 timevar_push (TV_TEMPLATE_INST
);
15560 ret
= instantiate_template_1 (tmpl
, orig_args
, complain
);
15561 timevar_pop (TV_TEMPLATE_INST
);
15565 /* Instantiate the alias template TMPL with ARGS. Also push a template
15566 instantiation level, which instantiate_template doesn't do because
15567 functions and variables have sufficient context established by the
15571 instantiate_alias_template (tree tmpl
, tree args
, tsubst_flags_t complain
)
15573 struct pending_template
*old_last_pend
= last_pending_template
;
15574 struct tinst_level
*old_error_tinst
= last_error_tinst_level
;
15575 if (tmpl
== error_mark_node
|| args
== error_mark_node
)
15576 return error_mark_node
;
15577 tree tinst
= build_tree_list (tmpl
, args
);
15578 if (!push_tinst_level (tinst
))
15581 return error_mark_node
;
15585 coerce_innermost_template_parms (DECL_TEMPLATE_PARMS (tmpl
),
15586 args
, tmpl
, complain
,
15587 /*require_all_args=*/true,
15588 /*use_default_args=*/true);
15590 tree r
= instantiate_template (tmpl
, args
, complain
);
15591 pop_tinst_level ();
15592 /* We can't free this if a pending_template entry or last_error_tinst_level
15593 is pointing at it. */
15594 if (last_pending_template
== old_last_pend
15595 && last_error_tinst_level
== old_error_tinst
)
15601 /* PARM is a template parameter pack for FN. Returns true iff
15602 PARM is used in a deducible way in the argument list of FN. */
15605 pack_deducible_p (tree parm
, tree fn
)
15607 tree t
= FUNCTION_FIRST_USER_PARMTYPE (fn
);
15608 for (; t
; t
= TREE_CHAIN (t
))
15610 tree type
= TREE_VALUE (t
);
15612 if (!PACK_EXPANSION_P (type
))
15614 for (packs
= PACK_EXPANSION_PARAMETER_PACKS (type
);
15615 packs
; packs
= TREE_CHAIN (packs
))
15616 if (TREE_VALUE (packs
) == parm
)
15618 /* The template parameter pack is used in a function parameter
15619 pack. If this is the end of the parameter list, the
15620 template parameter pack is deducible. */
15621 if (TREE_CHAIN (t
) == void_list_node
)
15624 /* Otherwise, not. Well, it could be deduced from
15625 a non-pack parameter, but doing so would end up with
15626 a deduction mismatch, so don't bother. */
15630 /* The template parameter pack isn't used in any function parameter
15631 packs, but it might be used deeper, e.g. tuple<Args...>. */
15635 /* The FN is a TEMPLATE_DECL for a function. ARGS is an array with
15636 NARGS elements of the arguments that are being used when calling
15637 it. TARGS is a vector into which the deduced template arguments
15640 Returns either a FUNCTION_DECL for the matching specialization of FN or
15641 NULL_TREE if no suitable specialization can be found. If EXPLAIN_P is
15642 true, diagnostics will be printed to explain why it failed.
15644 If FN is a conversion operator, or we are trying to produce a specific
15645 specialization, RETURN_TYPE is the return type desired.
15647 The EXPLICIT_TARGS are explicit template arguments provided via a
15650 The parameter STRICT is one of:
15653 We are deducing arguments for a function call, as in
15654 [temp.deduct.call].
15657 We are deducing arguments for a conversion function, as in
15658 [temp.deduct.conv].
15661 We are deducing arguments when doing an explicit instantiation
15662 as in [temp.explicit], when determining an explicit specialization
15663 as in [temp.expl.spec], or when taking the address of a function
15664 template, as in [temp.deduct.funcaddr]. */
15667 fn_type_unification (tree fn
,
15668 tree explicit_targs
,
15671 unsigned int nargs
,
15673 unification_kind_t strict
,
15680 tree decl
= NULL_TREE
;
15681 tsubst_flags_t complain
= (explain_p
? tf_warning_or_error
: tf_none
);
15683 static int deduction_depth
;
15684 struct pending_template
*old_last_pend
= last_pending_template
;
15685 struct tinst_level
*old_error_tinst
= last_error_tinst_level
;
15686 tree tparms
= DECL_INNERMOST_TEMPLATE_PARMS (fn
);
15688 tree r
= error_mark_node
;
15691 complain
|= tf_decltype
;
15693 /* In C++0x, it's possible to have a function template whose type depends
15694 on itself recursively. This is most obvious with decltype, but can also
15695 occur with enumeration scope (c++/48969). So we need to catch infinite
15696 recursion and reject the substitution at deduction time; this function
15697 will return error_mark_node for any repeated substitution.
15699 This also catches excessive recursion such as when f<N> depends on
15700 f<N-1> across all integers, and returns error_mark_node for all the
15701 substitutions back up to the initial one.
15703 This is, of course, not reentrant. */
15704 if (excessive_deduction_depth
)
15705 return error_mark_node
;
15706 tinst
= build_tree_list (fn
, NULL_TREE
);
15709 gcc_assert (TREE_CODE (fn
) == TEMPLATE_DECL
);
15711 fntype
= TREE_TYPE (fn
);
15712 if (explicit_targs
)
15716 The specified template arguments must match the template
15717 parameters in kind (i.e., type, nontype, template), and there
15718 must not be more arguments than there are parameters;
15719 otherwise type deduction fails.
15721 Nontype arguments must match the types of the corresponding
15722 nontype template parameters, or must be convertible to the
15723 types of the corresponding nontype parameters as specified in
15724 _temp.arg.nontype_, otherwise type deduction fails.
15726 All references in the function type of the function template
15727 to the corresponding template parameters are replaced by the
15728 specified template argument values. If a substitution in a
15729 template parameter or in the function type of the function
15730 template results in an invalid type, type deduction fails. */
15731 int i
, len
= TREE_VEC_LENGTH (tparms
);
15732 location_t loc
= input_location
;
15733 bool incomplete
= false;
15735 /* Adjust any explicit template arguments before entering the
15736 substitution context. */
15738 = (coerce_template_parms (tparms
, explicit_targs
, NULL_TREE
,
15740 /*require_all_args=*/false,
15741 /*use_default_args=*/false));
15742 if (explicit_targs
== error_mark_node
)
15745 /* Substitute the explicit args into the function type. This is
15746 necessary so that, for instance, explicitly declared function
15747 arguments can match null pointed constants. If we were given
15748 an incomplete set of explicit args, we must not do semantic
15749 processing during substitution as we could create partial
15751 for (i
= 0; i
< len
; i
++)
15753 tree parm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
15754 bool parameter_pack
= false;
15755 tree targ
= TREE_VEC_ELT (explicit_targs
, i
);
15757 /* Dig out the actual parm. */
15758 if (TREE_CODE (parm
) == TYPE_DECL
15759 || TREE_CODE (parm
) == TEMPLATE_DECL
)
15761 parm
= TREE_TYPE (parm
);
15762 parameter_pack
= TEMPLATE_TYPE_PARAMETER_PACK (parm
);
15764 else if (TREE_CODE (parm
) == PARM_DECL
)
15766 parm
= DECL_INITIAL (parm
);
15767 parameter_pack
= TEMPLATE_PARM_PARAMETER_PACK (parm
);
15770 if (!parameter_pack
&& targ
== NULL_TREE
)
15771 /* No explicit argument for this template parameter. */
15774 if (parameter_pack
&& pack_deducible_p (parm
, fn
))
15776 /* Mark the argument pack as "incomplete". We could
15777 still deduce more arguments during unification.
15778 We remove this mark in type_unification_real. */
15781 ARGUMENT_PACK_INCOMPLETE_P(targ
) = 1;
15782 ARGUMENT_PACK_EXPLICIT_ARGS (targ
)
15783 = ARGUMENT_PACK_ARGS (targ
);
15786 /* We have some incomplete argument packs. */
15791 TREE_VALUE (tinst
) = explicit_targs
;
15792 if (!push_tinst_level (tinst
))
15794 excessive_deduction_depth
= true;
15797 processing_template_decl
+= incomplete
;
15798 input_location
= DECL_SOURCE_LOCATION (fn
);
15799 /* Ignore any access checks; we'll see them again in
15800 instantiate_template and they might have the wrong
15801 access path at this point. */
15802 push_deferring_access_checks (dk_deferred
);
15803 fntype
= tsubst (TREE_TYPE (fn
), explicit_targs
,
15804 complain
| tf_partial
, NULL_TREE
);
15805 pop_deferring_access_checks ();
15806 input_location
= loc
;
15807 processing_template_decl
-= incomplete
;
15808 pop_tinst_level ();
15810 if (fntype
== error_mark_node
)
15813 /* Place the explicitly specified arguments in TARGS. */
15814 for (i
= NUM_TMPL_ARGS (explicit_targs
); i
--;)
15815 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (explicit_targs
, i
);
15818 /* Never do unification on the 'this' parameter. */
15819 parms
= skip_artificial_parms_for (fn
, TYPE_ARG_TYPES (fntype
));
15825 parms
= tree_cons (NULL_TREE
, TREE_TYPE (fntype
), parms
);
15826 new_args
= XALLOCAVEC (tree
, nargs
+ 1);
15827 new_args
[0] = return_type
;
15828 memcpy (new_args
+ 1, args
, nargs
* sizeof (tree
));
15833 /* We allow incomplete unification without an error message here
15834 because the standard doesn't seem to explicitly prohibit it. Our
15835 callers must be ready to deal with unification failures in any
15838 TREE_VALUE (tinst
) = targs
;
15839 /* If we aren't explaining yet, push tinst context so we can see where
15840 any errors (e.g. from class instantiations triggered by instantiation
15841 of default template arguments) come from. If we are explaining, this
15842 context is redundant. */
15843 if (!explain_p
&& !push_tinst_level (tinst
))
15845 excessive_deduction_depth
= true;
15849 /* type_unification_real will pass back any access checks from default
15850 template argument substitution. */
15851 vec
<deferred_access_check
, va_gc
> *checks
;
15854 ok
= !type_unification_real (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
15855 targs
, parms
, args
, nargs
, /*subr=*/0,
15856 strict
, flags
, &checks
, explain_p
);
15858 pop_tinst_level ();
15862 /* Now that we have bindings for all of the template arguments,
15863 ensure that the arguments deduced for the template template
15864 parameters have compatible template parameter lists. We cannot
15865 check this property before we have deduced all template
15866 arguments, because the template parameter types of a template
15867 template parameter might depend on prior template parameters
15868 deduced after the template template parameter. The following
15869 ill-formed example illustrates this issue:
15871 template<typename T, template<T> class C> void f(C<5>, T);
15873 template<int N> struct X {};
15876 f(X<5>(), 5l); // error: template argument deduction fails
15879 The template parameter list of 'C' depends on the template type
15880 parameter 'T', but 'C' is deduced to 'X' before 'T' is deduced to
15881 'long'. Thus, we can't check that 'C' cannot bind to 'X' at the
15882 time that we deduce 'C'. */
15883 if (!template_template_parm_bindings_ok_p
15884 (DECL_INNERMOST_TEMPLATE_PARMS (fn
), targs
))
15886 unify_inconsistent_template_template_parameters (explain_p
);
15890 /* All is well so far. Now, check:
15894 When all template arguments have been deduced, all uses of
15895 template parameters in nondeduced contexts are replaced with
15896 the corresponding deduced argument values. If the
15897 substitution results in an invalid type, as described above,
15898 type deduction fails. */
15899 TREE_VALUE (tinst
) = targs
;
15900 if (!push_tinst_level (tinst
))
15902 excessive_deduction_depth
= true;
15906 /* Also collect access checks from the instantiation. */
15907 reopen_deferring_access_checks (checks
);
15909 decl
= instantiate_template (fn
, targs
, complain
);
15911 checks
= get_deferred_access_checks ();
15912 pop_deferring_access_checks ();
15914 pop_tinst_level ();
15916 if (decl
== error_mark_node
)
15919 /* Now perform any access checks encountered during substitution. */
15920 push_access_scope (decl
);
15921 ok
= perform_access_checks (checks
, complain
);
15922 pop_access_scope (decl
);
15926 /* If we're looking for an exact match, check that what we got
15927 is indeed an exact match. It might not be if some template
15928 parameters are used in non-deduced contexts. But don't check
15929 for an exact match if we have dependent template arguments;
15930 in that case we're doing partial ordering, and we already know
15931 that we have two candidates that will provide the actual type. */
15932 if (strict
== DEDUCE_EXACT
&& !any_dependent_template_arguments_p (targs
))
15934 tree substed
= TREE_TYPE (decl
);
15938 = skip_artificial_parms_for (decl
, TYPE_ARG_TYPES (substed
));
15940 sarg
= tree_cons (NULL_TREE
, TREE_TYPE (substed
), sarg
);
15941 for (i
= 0; i
< nargs
&& sarg
; ++i
, sarg
= TREE_CHAIN (sarg
))
15942 if (!same_type_p (args
[i
], TREE_VALUE (sarg
)))
15944 unify_type_mismatch (explain_p
, args
[i
],
15945 TREE_VALUE (sarg
));
15954 if (excessive_deduction_depth
)
15956 if (deduction_depth
== 0)
15957 /* Reset once we're all the way out. */
15958 excessive_deduction_depth
= false;
15961 /* We can't free this if a pending_template entry or last_error_tinst_level
15962 is pointing at it. */
15963 if (last_pending_template
== old_last_pend
15964 && last_error_tinst_level
== old_error_tinst
)
15970 /* Adjust types before performing type deduction, as described in
15971 [temp.deduct.call] and [temp.deduct.conv]. The rules in these two
15972 sections are symmetric. PARM is the type of a function parameter
15973 or the return type of the conversion function. ARG is the type of
15974 the argument passed to the call, or the type of the value
15975 initialized with the result of the conversion function.
15976 ARG_EXPR is the original argument expression, which may be null. */
15979 maybe_adjust_types_for_deduction (unification_kind_t strict
,
15993 /* Swap PARM and ARG throughout the remainder of this
15994 function; the handling is precisely symmetric since PARM
15995 will initialize ARG rather than vice versa. */
16003 /* Core issue #873: Do the DR606 thing (see below) for these cases,
16004 too, but here handle it by stripping the reference from PARM
16005 rather than by adding it to ARG. */
16006 if (TREE_CODE (*parm
) == REFERENCE_TYPE
16007 && TYPE_REF_IS_RVALUE (*parm
)
16008 && TREE_CODE (TREE_TYPE (*parm
)) == TEMPLATE_TYPE_PARM
16009 && cp_type_quals (TREE_TYPE (*parm
)) == TYPE_UNQUALIFIED
16010 && TREE_CODE (*arg
) == REFERENCE_TYPE
16011 && !TYPE_REF_IS_RVALUE (*arg
))
16012 *parm
= TREE_TYPE (*parm
);
16013 /* Nothing else to do in this case. */
16017 gcc_unreachable ();
16020 if (TREE_CODE (*parm
) != REFERENCE_TYPE
)
16022 /* [temp.deduct.call]
16024 If P is not a reference type:
16026 --If A is an array type, the pointer type produced by the
16027 array-to-pointer standard conversion (_conv.array_) is
16028 used in place of A for type deduction; otherwise,
16030 --If A is a function type, the pointer type produced by
16031 the function-to-pointer standard conversion
16032 (_conv.func_) is used in place of A for type deduction;
16035 --If A is a cv-qualified type, the top level
16036 cv-qualifiers of A's type are ignored for type
16038 if (TREE_CODE (*arg
) == ARRAY_TYPE
)
16039 *arg
= build_pointer_type (TREE_TYPE (*arg
));
16040 else if (TREE_CODE (*arg
) == FUNCTION_TYPE
)
16041 *arg
= build_pointer_type (*arg
);
16043 *arg
= TYPE_MAIN_VARIANT (*arg
);
16046 /* From C++0x [14.8.2.1/3 temp.deduct.call] (after DR606), "If P is
16047 of the form T&&, where T is a template parameter, and the argument
16048 is an lvalue, T is deduced as A& */
16049 if (TREE_CODE (*parm
) == REFERENCE_TYPE
16050 && TYPE_REF_IS_RVALUE (*parm
)
16051 && TREE_CODE (TREE_TYPE (*parm
)) == TEMPLATE_TYPE_PARM
16052 && cp_type_quals (TREE_TYPE (*parm
)) == TYPE_UNQUALIFIED
16053 && (arg_expr
? real_lvalue_p (arg_expr
)
16054 /* try_one_overload doesn't provide an arg_expr, but
16055 functions are always lvalues. */
16056 : TREE_CODE (*arg
) == FUNCTION_TYPE
))
16057 *arg
= build_reference_type (*arg
);
16059 /* [temp.deduct.call]
16061 If P is a cv-qualified type, the top level cv-qualifiers
16062 of P's type are ignored for type deduction. If P is a
16063 reference type, the type referred to by P is used for
16065 *parm
= TYPE_MAIN_VARIANT (*parm
);
16066 if (TREE_CODE (*parm
) == REFERENCE_TYPE
)
16068 *parm
= TREE_TYPE (*parm
);
16069 result
|= UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
16072 /* DR 322. For conversion deduction, remove a reference type on parm
16073 too (which has been swapped into ARG). */
16074 if (strict
== DEDUCE_CONV
&& TREE_CODE (*arg
) == REFERENCE_TYPE
)
16075 *arg
= TREE_TYPE (*arg
);
16080 /* Subroutine of unify_one_argument. PARM is a function parameter of a
16081 template which does contain any deducible template parameters; check if
16082 ARG is a suitable match for it. STRICT, FLAGS and EXPLAIN_P are as in
16083 unify_one_argument. */
16086 check_non_deducible_conversion (tree parm
, tree arg
, int strict
,
16087 int flags
, bool explain_p
)
16092 type
= TREE_TYPE (arg
);
16096 if (same_type_p (parm
, type
))
16097 return unify_success (explain_p
);
16099 if (strict
== DEDUCE_CONV
)
16101 if (can_convert_arg (type
, parm
, NULL_TREE
, flags
,
16102 explain_p
? tf_warning_or_error
: tf_none
))
16103 return unify_success (explain_p
);
16105 else if (strict
!= DEDUCE_EXACT
)
16107 if (can_convert_arg (parm
, type
,
16108 TYPE_P (arg
) ? NULL_TREE
: arg
,
16109 flags
, explain_p
? tf_warning_or_error
: tf_none
))
16110 return unify_success (explain_p
);
16113 if (strict
== DEDUCE_EXACT
)
16114 return unify_type_mismatch (explain_p
, parm
, arg
);
16116 return unify_arg_conversion (explain_p
, parm
, type
, arg
);
16119 static bool uses_deducible_template_parms (tree type
);
16121 /* Returns true iff the expression EXPR is one from which a template
16122 argument can be deduced. In other words, if it's an undecorated
16123 use of a template non-type parameter. */
16126 deducible_expression (tree expr
)
16128 return (TREE_CODE (expr
) == TEMPLATE_PARM_INDEX
);
16131 /* Returns true iff the array domain DOMAIN uses a template parameter in a
16132 deducible way; that is, if it has a max value of <PARM> - 1. */
16135 deducible_array_bound (tree domain
)
16137 if (domain
== NULL_TREE
)
16140 tree max
= TYPE_MAX_VALUE (domain
);
16141 if (TREE_CODE (max
) != MINUS_EXPR
)
16144 return deducible_expression (TREE_OPERAND (max
, 0));
16147 /* Returns true iff the template arguments ARGS use a template parameter
16148 in a deducible way. */
16151 deducible_template_args (tree args
)
16153 for (int i
= 0; i
< TREE_VEC_LENGTH (args
); ++i
)
16156 tree elt
= TREE_VEC_ELT (args
, i
);
16157 if (ARGUMENT_PACK_P (elt
))
16158 deducible
= deducible_template_args (ARGUMENT_PACK_ARGS (elt
));
16161 if (PACK_EXPANSION_P (elt
))
16162 elt
= PACK_EXPANSION_PATTERN (elt
);
16163 if (TREE_CODE (elt
) == TEMPLATE_TEMPLATE_PARM
)
16165 else if (TYPE_P (elt
))
16166 deducible
= uses_deducible_template_parms (elt
);
16168 deducible
= deducible_expression (elt
);
16176 /* Returns true iff TYPE contains any deducible references to template
16177 parameters, as per 14.8.2.5. */
16180 uses_deducible_template_parms (tree type
)
16182 if (PACK_EXPANSION_P (type
))
16183 type
= PACK_EXPANSION_PATTERN (type
);
16190 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
16191 || TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
16197 if (POINTER_TYPE_P (type
))
16198 return uses_deducible_template_parms (TREE_TYPE (type
));
16200 /* T[integer-constant ]
16202 if (TREE_CODE (type
) == ARRAY_TYPE
)
16203 return (uses_deducible_template_parms (TREE_TYPE (type
))
16204 || deducible_array_bound (TYPE_DOMAIN (type
)));
16216 if (TYPE_PTRMEM_P (type
))
16217 return (uses_deducible_template_parms (TYPE_PTRMEM_CLASS_TYPE (type
))
16218 || (uses_deducible_template_parms
16219 (TYPE_PTRMEM_POINTED_TO_TYPE (type
))));
16221 /* template-name <T> (where template-name refers to a class template)
16222 template-name <i> (where template-name refers to a class template) */
16223 if (CLASS_TYPE_P (type
)
16224 && CLASSTYPE_TEMPLATE_INFO (type
)
16225 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (type
)))
16226 return deducible_template_args (INNERMOST_TEMPLATE_ARGS
16227 (CLASSTYPE_TI_ARGS (type
)));
16232 if (TREE_CODE (type
) == FUNCTION_TYPE
16233 || TREE_CODE (type
) == METHOD_TYPE
)
16235 if (uses_deducible_template_parms (TREE_TYPE (type
)))
16237 tree parm
= TYPE_ARG_TYPES (type
);
16238 if (TREE_CODE (type
) == METHOD_TYPE
)
16239 parm
= TREE_CHAIN (parm
);
16240 for (; parm
; parm
= TREE_CHAIN (parm
))
16241 if (uses_deducible_template_parms (TREE_VALUE (parm
)))
16248 /* Subroutine of type_unification_real and unify_pack_expansion to
16249 handle unification of a single P/A pair. Parameters are as
16250 for those functions. */
16253 unify_one_argument (tree tparms
, tree targs
, tree parm
, tree arg
,
16254 int subr
, unification_kind_t strict
, int flags
,
16257 tree arg_expr
= NULL_TREE
;
16260 if (arg
== error_mark_node
|| parm
== error_mark_node
)
16261 return unify_invalid (explain_p
);
16262 if (arg
== unknown_type_node
)
16263 /* We can't deduce anything from this, but we might get all the
16264 template args from other function args. */
16265 return unify_success (explain_p
);
16267 /* Implicit conversions (Clause 4) will be performed on a function
16268 argument to convert it to the type of the corresponding function
16269 parameter if the parameter type contains no template-parameters that
16270 participate in template argument deduction. */
16271 if (TYPE_P (parm
) && !uses_template_parms (parm
))
16272 /* For function parameters that contain no template-parameters at all,
16273 we have historically checked for convertibility in order to shortcut
16274 consideration of this candidate. */
16275 return check_non_deducible_conversion (parm
, arg
, strict
, flags
,
16277 else if (strict
== DEDUCE_CALL
16278 && TYPE_P (parm
) && !uses_deducible_template_parms (parm
))
16279 /* For function parameters with only non-deducible template parameters,
16281 return unify_success (explain_p
);
16286 arg_strict
= (UNIFY_ALLOW_OUTER_LEVEL
16287 | UNIFY_ALLOW_MORE_CV_QUAL
16288 | UNIFY_ALLOW_DERIVED
);
16292 arg_strict
= UNIFY_ALLOW_LESS_CV_QUAL
;
16296 arg_strict
= UNIFY_ALLOW_NONE
;
16300 gcc_unreachable ();
16303 /* We only do these transformations if this is the top-level
16304 parameter_type_list in a call or declaration matching; in other
16305 situations (nested function declarators, template argument lists) we
16306 won't be comparing a type to an expression, and we don't do any type
16312 gcc_assert (TREE_TYPE (arg
) != NULL_TREE
);
16313 if (type_unknown_p (arg
))
16315 /* [temp.deduct.type] A template-argument can be
16316 deduced from a pointer to function or pointer
16317 to member function argument if the set of
16318 overloaded functions does not contain function
16319 templates and at most one of a set of
16320 overloaded functions provides a unique
16323 if (resolve_overloaded_unification
16324 (tparms
, targs
, parm
, arg
, strict
,
16325 arg_strict
, explain_p
))
16326 return unify_success (explain_p
);
16327 return unify_overload_resolution_failure (explain_p
, arg
);
16331 arg
= unlowered_expr_type (arg
);
16332 if (arg
== error_mark_node
)
16333 return unify_invalid (explain_p
);
16337 maybe_adjust_types_for_deduction (strict
, &parm
, &arg
, arg_expr
);
16340 gcc_assert ((TYPE_P (parm
) || TREE_CODE (parm
) == TEMPLATE_DECL
)
16341 == (TYPE_P (arg
) || TREE_CODE (arg
) == TEMPLATE_DECL
));
16343 /* For deduction from an init-list we need the actual list. */
16344 if (arg_expr
&& BRACE_ENCLOSED_INITIALIZER_P (arg_expr
))
16346 return unify (tparms
, targs
, parm
, arg
, arg_strict
, explain_p
);
16349 /* Most parms like fn_type_unification.
16351 If SUBR is 1, we're being called recursively (to unify the
16352 arguments of a function or method parameter of a function
16355 CHECKS is a pointer to a vector of access checks encountered while
16356 substituting default template arguments. */
16359 type_unification_real (tree tparms
,
16363 unsigned int xnargs
,
16365 unification_kind_t strict
,
16367 vec
<deferred_access_check
, va_gc
> **checks
,
16372 int ntparms
= TREE_VEC_LENGTH (tparms
);
16373 int saw_undeduced
= 0;
16376 unsigned int nargs
;
16379 gcc_assert (TREE_CODE (tparms
) == TREE_VEC
);
16380 gcc_assert (xparms
== NULL_TREE
|| TREE_CODE (xparms
) == TREE_LIST
);
16381 gcc_assert (ntparms
> 0);
16383 /* Reset the number of non-defaulted template arguments contained
16385 NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
) = NULL_TREE
;
16393 while (parms
&& parms
!= void_list_node
16396 parm
= TREE_VALUE (parms
);
16398 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
16399 && (!TREE_CHAIN (parms
) || TREE_CHAIN (parms
) == void_list_node
))
16400 /* For a function parameter pack that occurs at the end of the
16401 parameter-declaration-list, the type A of each remaining
16402 argument of the call is compared with the type P of the
16403 declarator-id of the function parameter pack. */
16406 parms
= TREE_CHAIN (parms
);
16408 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
)
16409 /* For a function parameter pack that does not occur at the
16410 end of the parameter-declaration-list, the type of the
16411 parameter pack is a non-deduced context. */
16417 if (unify_one_argument (tparms
, targs
, parm
, arg
, subr
, strict
,
16423 && parms
!= void_list_node
16424 && TREE_CODE (TREE_VALUE (parms
)) == TYPE_PACK_EXPANSION
)
16426 /* Unify the remaining arguments with the pack expansion type. */
16428 tree parmvec
= make_tree_vec (1);
16430 /* Allocate a TREE_VEC and copy in all of the arguments */
16431 argvec
= make_tree_vec (nargs
- ia
);
16432 for (i
= 0; ia
< nargs
; ++ia
, ++i
)
16433 TREE_VEC_ELT (argvec
, i
) = args
[ia
];
16435 /* Copy the parameter into parmvec. */
16436 TREE_VEC_ELT (parmvec
, 0) = TREE_VALUE (parms
);
16437 if (unify_pack_expansion (tparms
, targs
, parmvec
, argvec
, strict
,
16438 /*subr=*/subr
, explain_p
))
16441 /* Advance to the end of the list of parameters. */
16442 parms
= TREE_CHAIN (parms
);
16445 /* Fail if we've reached the end of the parm list, and more args
16446 are present, and the parm list isn't variadic. */
16447 if (ia
< nargs
&& parms
== void_list_node
)
16448 return unify_too_many_arguments (explain_p
, nargs
, ia
);
16449 /* Fail if parms are left and they don't have default values. */
16450 if (parms
&& parms
!= void_list_node
16451 && TREE_PURPOSE (parms
) == NULL_TREE
)
16453 unsigned int count
= nargs
;
16455 while (p
&& p
!= void_list_node
)
16458 p
= TREE_CHAIN (p
);
16460 return unify_too_few_arguments (explain_p
, ia
, count
);
16465 tsubst_flags_t complain
= (explain_p
16466 ? tf_warning_or_error
16469 for (i
= 0; i
< ntparms
; i
++)
16471 tree targ
= TREE_VEC_ELT (targs
, i
);
16472 tree tparm
= TREE_VEC_ELT (tparms
, i
);
16474 /* Clear the "incomplete" flags on all argument packs now so that
16475 substituting them into later default arguments works. */
16476 if (targ
&& ARGUMENT_PACK_P (targ
))
16478 ARGUMENT_PACK_INCOMPLETE_P (targ
) = 0;
16479 ARGUMENT_PACK_EXPLICIT_ARGS (targ
) = NULL_TREE
;
16482 if (targ
|| tparm
== error_mark_node
)
16484 tparm
= TREE_VALUE (tparm
);
16486 /* If this is an undeduced nontype parameter that depends on
16487 a type parameter, try another pass; its type may have been
16488 deduced from a later argument than the one from which
16489 this parameter can be deduced. */
16490 if (TREE_CODE (tparm
) == PARM_DECL
16491 && uses_template_parms (TREE_TYPE (tparm
))
16492 && !saw_undeduced
++)
16495 /* Core issue #226 (C++0x) [temp.deduct]:
16497 If a template argument has not been deduced, its
16498 default template argument, if any, is used.
16500 When we are in C++98 mode, TREE_PURPOSE will either
16501 be NULL_TREE or ERROR_MARK_NODE, so we do not need
16502 to explicitly check cxx_dialect here. */
16503 if (TREE_PURPOSE (TREE_VEC_ELT (tparms
, i
)))
16505 tree parm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
16506 tree arg
= TREE_PURPOSE (TREE_VEC_ELT (tparms
, i
));
16507 reopen_deferring_access_checks (*checks
);
16508 location_t save_loc
= input_location
;
16510 input_location
= DECL_SOURCE_LOCATION (parm
);
16511 arg
= tsubst_template_arg (arg
, targs
, complain
, NULL_TREE
);
16512 arg
= convert_template_argument (parm
, arg
, targs
, complain
,
16514 input_location
= save_loc
;
16515 *checks
= get_deferred_access_checks ();
16516 pop_deferring_access_checks ();
16517 if (arg
== error_mark_node
)
16521 TREE_VEC_ELT (targs
, i
) = arg
;
16522 /* The position of the first default template argument,
16523 is also the number of non-defaulted arguments in TARGS.
16525 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
))
16526 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
, i
);
16531 /* If the type parameter is a parameter pack, then it will
16532 be deduced to an empty parameter pack. */
16533 if (template_parameter_pack_p (tparm
))
16537 if (TREE_CODE (tparm
) == TEMPLATE_PARM_INDEX
)
16539 arg
= make_node (NONTYPE_ARGUMENT_PACK
);
16540 TREE_TYPE (arg
) = TREE_TYPE (TEMPLATE_PARM_DECL (tparm
));
16541 TREE_CONSTANT (arg
) = 1;
16544 arg
= cxx_make_type (TYPE_ARGUMENT_PACK
);
16546 SET_ARGUMENT_PACK_ARGS (arg
, make_tree_vec (0));
16548 TREE_VEC_ELT (targs
, i
) = arg
;
16552 return unify_parameter_deduction_failure (explain_p
, tparm
);
16555 #ifdef ENABLE_CHECKING
16556 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
))
16557 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
, TREE_VEC_LENGTH (targs
));
16560 return unify_success (explain_p
);
16563 /* Subroutine of type_unification_real. Args are like the variables
16564 at the call site. ARG is an overloaded function (or template-id);
16565 we try deducing template args from each of the overloads, and if
16566 only one succeeds, we go with that. Modifies TARGS and returns
16567 true on success. */
16570 resolve_overloaded_unification (tree tparms
,
16574 unification_kind_t strict
,
16578 tree tempargs
= copy_node (targs
);
16580 tree goodfn
= NULL_TREE
;
16583 if (TREE_CODE (arg
) == ADDR_EXPR
)
16585 arg
= TREE_OPERAND (arg
, 0);
16591 if (TREE_CODE (arg
) == COMPONENT_REF
)
16592 /* Handle `&x' where `x' is some static or non-static member
16594 arg
= TREE_OPERAND (arg
, 1);
16596 if (TREE_CODE (arg
) == OFFSET_REF
)
16597 arg
= TREE_OPERAND (arg
, 1);
16599 /* Strip baselink information. */
16600 if (BASELINK_P (arg
))
16601 arg
= BASELINK_FUNCTIONS (arg
);
16603 if (TREE_CODE (arg
) == TEMPLATE_ID_EXPR
)
16605 /* If we got some explicit template args, we need to plug them into
16606 the affected templates before we try to unify, in case the
16607 explicit args will completely resolve the templates in question. */
16610 tree expl_subargs
= TREE_OPERAND (arg
, 1);
16611 arg
= TREE_OPERAND (arg
, 0);
16613 for (; arg
; arg
= OVL_NEXT (arg
))
16615 tree fn
= OVL_CURRENT (arg
);
16616 tree subargs
, elem
;
16618 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
16621 subargs
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
16622 expl_subargs
, NULL_TREE
, tf_none
,
16623 /*require_all_args=*/true,
16624 /*use_default_args=*/true);
16625 if (subargs
!= error_mark_node
16626 && !any_dependent_template_arguments_p (subargs
))
16628 elem
= TREE_TYPE (instantiate_template (fn
, subargs
, tf_none
));
16629 if (try_one_overload (tparms
, targs
, tempargs
, parm
,
16630 elem
, strict
, sub_strict
, addr_p
, explain_p
)
16631 && (!goodfn
|| !same_type_p (goodfn
, elem
)))
16640 /* If no templates (or more than one) are fully resolved by the
16641 explicit arguments, this template-id is a non-deduced context; it
16642 could still be OK if we deduce all template arguments for the
16643 enclosing call through other arguments. */
16647 else if (TREE_CODE (arg
) != OVERLOAD
16648 && TREE_CODE (arg
) != FUNCTION_DECL
)
16649 /* If ARG is, for example, "(0, &f)" then its type will be unknown
16650 -- but the deduction does not succeed because the expression is
16651 not just the function on its own. */
16654 for (; arg
; arg
= OVL_NEXT (arg
))
16655 if (try_one_overload (tparms
, targs
, tempargs
, parm
,
16656 TREE_TYPE (OVL_CURRENT (arg
)),
16657 strict
, sub_strict
, addr_p
, explain_p
)
16658 && (!goodfn
|| !decls_match (goodfn
, OVL_CURRENT (arg
))))
16660 goodfn
= OVL_CURRENT (arg
);
16664 /* [temp.deduct.type] A template-argument can be deduced from a pointer
16665 to function or pointer to member function argument if the set of
16666 overloaded functions does not contain function templates and at most
16667 one of a set of overloaded functions provides a unique match.
16669 So if we found multiple possibilities, we return success but don't
16670 deduce anything. */
16674 int i
= TREE_VEC_LENGTH (targs
);
16676 if (TREE_VEC_ELT (tempargs
, i
))
16677 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (tempargs
, i
);
16685 /* Core DR 115: In contexts where deduction is done and fails, or in
16686 contexts where deduction is not done, if a template argument list is
16687 specified and it, along with any default template arguments, identifies
16688 a single function template specialization, then the template-id is an
16689 lvalue for the function template specialization. */
16692 resolve_nondeduced_context (tree orig_expr
)
16694 tree expr
, offset
, baselink
;
16697 if (!type_unknown_p (orig_expr
))
16702 offset
= NULL_TREE
;
16703 baselink
= NULL_TREE
;
16705 if (TREE_CODE (expr
) == ADDR_EXPR
)
16707 expr
= TREE_OPERAND (expr
, 0);
16710 if (TREE_CODE (expr
) == OFFSET_REF
)
16713 expr
= TREE_OPERAND (expr
, 1);
16715 if (BASELINK_P (expr
))
16718 expr
= BASELINK_FUNCTIONS (expr
);
16721 if (TREE_CODE (expr
) == TEMPLATE_ID_EXPR
)
16724 tree goodfn
= NULL_TREE
;
16726 /* If we got some explicit template args, we need to plug them into
16727 the affected templates before we try to unify, in case the
16728 explicit args will completely resolve the templates in question. */
16730 tree expl_subargs
= TREE_OPERAND (expr
, 1);
16731 tree arg
= TREE_OPERAND (expr
, 0);
16732 tree badfn
= NULL_TREE
;
16733 tree badargs
= NULL_TREE
;
16735 for (; arg
; arg
= OVL_NEXT (arg
))
16737 tree fn
= OVL_CURRENT (arg
);
16738 tree subargs
, elem
;
16740 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
16743 subargs
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
16744 expl_subargs
, NULL_TREE
, tf_none
,
16745 /*require_all_args=*/true,
16746 /*use_default_args=*/true);
16747 if (subargs
!= error_mark_node
16748 && !any_dependent_template_arguments_p (subargs
))
16750 elem
= instantiate_template (fn
, subargs
, tf_none
);
16751 if (elem
== error_mark_node
)
16756 else if (elem
&& (!goodfn
|| !decls_match (goodfn
, elem
)))
16765 mark_used (goodfn
);
16768 expr
= build_baselink (BASELINK_BINFO (baselink
),
16769 BASELINK_ACCESS_BINFO (baselink
),
16770 expr
, BASELINK_OPTYPE (baselink
));
16774 = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (offset
, 0)));
16775 expr
= build_offset_ref (base
, expr
, addr
, tf_warning_or_error
);
16778 expr
= cp_build_addr_expr (expr
, tf_warning_or_error
);
16781 else if (good
== 0 && badargs
)
16782 /* There were no good options and at least one bad one, so let the
16783 user know what the problem is. */
16784 instantiate_template (badfn
, badargs
, tf_warning_or_error
);
16789 /* Subroutine of resolve_overloaded_unification; does deduction for a single
16790 overload. Fills TARGS with any deduced arguments, or error_mark_node if
16791 different overloads deduce different arguments for a given parm.
16792 ADDR_P is true if the expression for which deduction is being
16793 performed was of the form "& fn" rather than simply "fn".
16795 Returns 1 on success. */
16798 try_one_overload (tree tparms
,
16803 unification_kind_t strict
,
16812 if (arg
== error_mark_node
)
16815 /* [temp.deduct.type] A template-argument can be deduced from a pointer
16816 to function or pointer to member function argument if the set of
16817 overloaded functions does not contain function templates and at most
16818 one of a set of overloaded functions provides a unique match.
16820 So if this is a template, just return success. */
16822 if (uses_template_parms (arg
))
16825 if (TREE_CODE (arg
) == METHOD_TYPE
)
16826 arg
= build_ptrmemfunc_type (build_pointer_type (arg
));
16828 arg
= build_pointer_type (arg
);
16830 sub_strict
|= maybe_adjust_types_for_deduction (strict
, &parm
, &arg
, NULL
);
16832 /* We don't copy orig_targs for this because if we have already deduced
16833 some template args from previous args, unify would complain when we
16834 try to deduce a template parameter for the same argument, even though
16835 there isn't really a conflict. */
16836 nargs
= TREE_VEC_LENGTH (targs
);
16837 tempargs
= make_tree_vec (nargs
);
16839 if (unify (tparms
, tempargs
, parm
, arg
, sub_strict
, explain_p
))
16842 /* First make sure we didn't deduce anything that conflicts with
16843 explicitly specified args. */
16844 for (i
= nargs
; i
--; )
16846 tree elt
= TREE_VEC_ELT (tempargs
, i
);
16847 tree oldelt
= TREE_VEC_ELT (orig_targs
, i
);
16851 else if (uses_template_parms (elt
))
16852 /* Since we're unifying against ourselves, we will fill in
16853 template args used in the function parm list with our own
16854 template parms. Discard them. */
16855 TREE_VEC_ELT (tempargs
, i
) = NULL_TREE
;
16856 else if (oldelt
&& !template_args_equal (oldelt
, elt
))
16860 for (i
= nargs
; i
--; )
16862 tree elt
= TREE_VEC_ELT (tempargs
, i
);
16865 TREE_VEC_ELT (targs
, i
) = elt
;
16871 /* PARM is a template class (perhaps with unbound template
16872 parameters). ARG is a fully instantiated type. If ARG can be
16873 bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and
16874 TARGS are as for unify. */
16877 try_class_unification (tree tparms
, tree targs
, tree parm
, tree arg
,
16880 tree copy_of_targs
;
16882 if (!CLASSTYPE_TEMPLATE_INFO (arg
)
16883 || (most_general_template (CLASSTYPE_TI_TEMPLATE (arg
))
16884 != most_general_template (CLASSTYPE_TI_TEMPLATE (parm
))))
16887 /* We need to make a new template argument vector for the call to
16888 unify. If we used TARGS, we'd clutter it up with the result of
16889 the attempted unification, even if this class didn't work out.
16890 We also don't want to commit ourselves to all the unifications
16891 we've already done, since unification is supposed to be done on
16892 an argument-by-argument basis. In other words, consider the
16893 following pathological case:
16895 template <int I, int J, int K>
16898 template <int I, int J>
16899 struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {};
16901 template <int I, int J, int K>
16902 void f(S<I, J, K>, S<I, I, I>);
16911 Now, by the time we consider the unification involving `s2', we
16912 already know that we must have `f<0, 0, 0>'. But, even though
16913 `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is invalid
16914 because there are two ways to unify base classes of S<0, 1, 2>
16915 with S<I, I, I>. If we kept the already deduced knowledge, we
16916 would reject the possibility I=1. */
16917 copy_of_targs
= make_tree_vec (TREE_VEC_LENGTH (targs
));
16919 /* If unification failed, we're done. */
16920 if (unify (tparms
, copy_of_targs
, CLASSTYPE_TI_ARGS (parm
),
16921 CLASSTYPE_TI_ARGS (arg
), UNIFY_ALLOW_NONE
, explain_p
))
16927 /* Given a template type PARM and a class type ARG, find the unique
16928 base type in ARG that is an instance of PARM. We do not examine
16929 ARG itself; only its base-classes. If there is not exactly one
16930 appropriate base class, return NULL_TREE. PARM may be the type of
16931 a partial specialization, as well as a plain template type. Used
16934 static enum template_base_result
16935 get_template_base (tree tparms
, tree targs
, tree parm
, tree arg
,
16936 bool explain_p
, tree
*result
)
16938 tree rval
= NULL_TREE
;
16941 gcc_assert (RECORD_OR_UNION_CODE_P (TREE_CODE (arg
)));
16943 binfo
= TYPE_BINFO (complete_type (arg
));
16946 /* The type could not be completed. */
16947 *result
= NULL_TREE
;
16948 return tbr_incomplete_type
;
16951 /* Walk in inheritance graph order. The search order is not
16952 important, and this avoids multiple walks of virtual bases. */
16953 for (binfo
= TREE_CHAIN (binfo
); binfo
; binfo
= TREE_CHAIN (binfo
))
16955 tree r
= try_class_unification (tparms
, targs
, parm
,
16956 BINFO_TYPE (binfo
), explain_p
);
16960 /* If there is more than one satisfactory baseclass, then:
16964 If they yield more than one possible deduced A, the type
16968 if (rval
&& !same_type_p (r
, rval
))
16970 *result
= NULL_TREE
;
16971 return tbr_ambiguous_baseclass
;
16979 return tbr_success
;
16982 /* Returns the level of DECL, which declares a template parameter. */
16985 template_decl_level (tree decl
)
16987 switch (TREE_CODE (decl
))
16990 case TEMPLATE_DECL
:
16991 return TEMPLATE_TYPE_LEVEL (TREE_TYPE (decl
));
16994 return TEMPLATE_PARM_LEVEL (DECL_INITIAL (decl
));
16997 gcc_unreachable ();
17002 /* Decide whether ARG can be unified with PARM, considering only the
17003 cv-qualifiers of each type, given STRICT as documented for unify.
17004 Returns nonzero iff the unification is OK on that basis. */
17007 check_cv_quals_for_unify (int strict
, tree arg
, tree parm
)
17009 int arg_quals
= cp_type_quals (arg
);
17010 int parm_quals
= cp_type_quals (parm
);
17012 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
17013 && !(strict
& UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
17015 /* Although a CVR qualifier is ignored when being applied to a
17016 substituted template parameter ([8.3.2]/1 for example), that
17017 does not allow us to unify "const T" with "int&" because both
17018 types are not of the form "cv-list T" [14.8.2.5 temp.deduct.type].
17019 It is ok when we're allowing additional CV qualifiers
17020 at the outer level [14.8.2.1]/3,1st bullet. */
17021 if ((TREE_CODE (arg
) == REFERENCE_TYPE
17022 || TREE_CODE (arg
) == FUNCTION_TYPE
17023 || TREE_CODE (arg
) == METHOD_TYPE
)
17024 && (parm_quals
& (TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
)))
17027 if ((!POINTER_TYPE_P (arg
) && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
)
17028 && (parm_quals
& TYPE_QUAL_RESTRICT
))
17032 if (!(strict
& (UNIFY_ALLOW_MORE_CV_QUAL
| UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
17033 && (arg_quals
& parm_quals
) != parm_quals
)
17036 if (!(strict
& (UNIFY_ALLOW_LESS_CV_QUAL
| UNIFY_ALLOW_OUTER_LESS_CV_QUAL
))
17037 && (parm_quals
& arg_quals
) != arg_quals
)
17043 /* Determines the LEVEL and INDEX for the template parameter PARM. */
17045 template_parm_level_and_index (tree parm
, int* level
, int* index
)
17047 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
17048 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
17049 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
17051 *index
= TEMPLATE_TYPE_IDX (parm
);
17052 *level
= TEMPLATE_TYPE_LEVEL (parm
);
17056 *index
= TEMPLATE_PARM_IDX (parm
);
17057 *level
= TEMPLATE_PARM_LEVEL (parm
);
17061 #define RECUR_AND_CHECK_FAILURE(TP, TA, P, A, S, EP) \
17063 if (unify (TP, TA, P, A, S, EP)) \
17067 /* Unifies the remaining arguments in PACKED_ARGS with the pack
17068 expansion at the end of PACKED_PARMS. Returns 0 if the type
17069 deduction succeeds, 1 otherwise. STRICT is the same as in
17070 unify. CALL_ARGS_P is true iff PACKED_ARGS is actually a function
17071 call argument list. We'll need to adjust the arguments to make them
17072 types. SUBR tells us if this is from a recursive call to
17073 type_unification_real, or for comparing two template argument
17077 unify_pack_expansion (tree tparms
, tree targs
, tree packed_parms
,
17078 tree packed_args
, unification_kind_t strict
,
17079 bool subr
, bool explain_p
)
17082 = TREE_VEC_ELT (packed_parms
, TREE_VEC_LENGTH (packed_parms
) - 1);
17083 tree pattern
= PACK_EXPANSION_PATTERN (parm
);
17084 tree pack
, packs
= NULL_TREE
;
17085 int i
, start
= TREE_VEC_LENGTH (packed_parms
) - 1;
17087 packed_args
= expand_template_argument_pack (packed_args
);
17089 int len
= TREE_VEC_LENGTH (packed_args
);
17091 /* Determine the parameter packs we will be deducing from the
17092 pattern, and record their current deductions. */
17093 for (pack
= PACK_EXPANSION_PARAMETER_PACKS (parm
);
17094 pack
; pack
= TREE_CHAIN (pack
))
17096 tree parm_pack
= TREE_VALUE (pack
);
17099 /* Determine the index and level of this parameter pack. */
17100 template_parm_level_and_index (parm_pack
, &level
, &idx
);
17102 /* Keep track of the parameter packs and their corresponding
17104 packs
= tree_cons (parm_pack
, TMPL_ARG (targs
, level
, idx
), packs
);
17105 TREE_TYPE (packs
) = make_tree_vec (len
- start
);
17108 /* Loop through all of the arguments that have not yet been
17109 unified and unify each with the pattern. */
17110 for (i
= start
; i
< len
; i
++)
17113 bool any_explicit
= false;
17114 tree arg
= TREE_VEC_ELT (packed_args
, i
);
17116 /* For each parameter pack, set its TMPL_ARG to either NULL_TREE
17117 or the element of its argument pack at the current index if
17118 this argument was explicitly specified. */
17119 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
17123 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
17126 if (TREE_VALUE (pack
)
17127 && (pargs
= ARGUMENT_PACK_EXPLICIT_ARGS (TREE_VALUE (pack
)))
17128 && (i
- start
< TREE_VEC_LENGTH (pargs
)))
17130 any_explicit
= true;
17131 arg
= TREE_VEC_ELT (pargs
, i
- start
);
17133 TMPL_ARG (targs
, level
, idx
) = arg
;
17136 /* If we had explicit template arguments, substitute them into the
17137 pattern before deduction. */
17140 /* Some arguments might still be unspecified or dependent. */
17142 ++processing_template_decl
;
17143 dependent
= any_dependent_template_arguments_p (targs
);
17145 --processing_template_decl
;
17146 parm
= tsubst (pattern
, targs
,
17147 explain_p
? tf_warning_or_error
: tf_none
,
17150 --processing_template_decl
;
17151 if (parm
== error_mark_node
)
17157 /* Unify the pattern with the current argument. */
17158 if (unify_one_argument (tparms
, targs
, parm
, arg
, subr
, strict
,
17159 LOOKUP_IMPLICIT
, explain_p
))
17162 /* For each parameter pack, collect the deduced value. */
17163 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
17166 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
17168 TREE_VEC_ELT (TREE_TYPE (pack
), i
- start
) =
17169 TMPL_ARG (targs
, level
, idx
);
17173 /* Verify that the results of unification with the parameter packs
17174 produce results consistent with what we've seen before, and make
17175 the deduced argument packs available. */
17176 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
17178 tree old_pack
= TREE_VALUE (pack
);
17179 tree new_args
= TREE_TYPE (pack
);
17180 int i
, len
= TREE_VEC_LENGTH (new_args
);
17182 bool nondeduced_p
= false;
17184 /* By default keep the original deduced argument pack.
17185 If necessary, more specific code is going to update the
17186 resulting deduced argument later down in this function. */
17187 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
17188 TMPL_ARG (targs
, level
, idx
) = old_pack
;
17190 /* If NEW_ARGS contains any NULL_TREE entries, we didn't
17191 actually deduce anything. */
17192 for (i
= 0; i
< len
&& !nondeduced_p
; ++i
)
17193 if (TREE_VEC_ELT (new_args
, i
) == NULL_TREE
)
17194 nondeduced_p
= true;
17198 if (old_pack
&& ARGUMENT_PACK_INCOMPLETE_P (old_pack
))
17200 /* If we had fewer function args than explicit template args,
17201 just use the explicits. */
17202 tree explicit_args
= ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
);
17203 int explicit_len
= TREE_VEC_LENGTH (explicit_args
);
17204 if (len
< explicit_len
)
17205 new_args
= explicit_args
;
17211 /* Build the deduced *_ARGUMENT_PACK. */
17212 if (TREE_CODE (TREE_PURPOSE (pack
)) == TEMPLATE_PARM_INDEX
)
17214 result
= make_node (NONTYPE_ARGUMENT_PACK
);
17215 TREE_TYPE (result
) =
17216 TREE_TYPE (TEMPLATE_PARM_DECL (TREE_PURPOSE (pack
)));
17217 TREE_CONSTANT (result
) = 1;
17220 result
= cxx_make_type (TYPE_ARGUMENT_PACK
);
17222 SET_ARGUMENT_PACK_ARGS (result
, new_args
);
17224 /* Note the deduced argument packs for this parameter
17226 TMPL_ARG (targs
, level
, idx
) = result
;
17228 else if (ARGUMENT_PACK_INCOMPLETE_P (old_pack
)
17229 && (ARGUMENT_PACK_ARGS (old_pack
)
17230 == ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
)))
17232 /* We only had the explicitly-provided arguments before, but
17233 now we have a complete set of arguments. */
17234 tree explicit_args
= ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
);
17236 SET_ARGUMENT_PACK_ARGS (old_pack
, new_args
);
17237 ARGUMENT_PACK_INCOMPLETE_P (old_pack
) = 1;
17238 ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
) = explicit_args
;
17242 tree bad_old_arg
= NULL_TREE
, bad_new_arg
= NULL_TREE
;
17243 tree old_args
= ARGUMENT_PACK_ARGS (old_pack
);
17245 if (!comp_template_args_with_info (old_args
, new_args
,
17246 &bad_old_arg
, &bad_new_arg
))
17247 /* Inconsistent unification of this parameter pack. */
17248 return unify_parameter_pack_inconsistent (explain_p
,
17254 return unify_success (explain_p
);
17257 /* Handle unification of the domain of an array. PARM_DOM and ARG_DOM are
17258 INTEGER_TYPEs representing the TYPE_DOMAIN of ARRAY_TYPEs. The other
17259 parameters and return value are as for unify. */
17262 unify_array_domain (tree tparms
, tree targs
,
17263 tree parm_dom
, tree arg_dom
,
17271 /* Our representation of array types uses "N - 1" as the
17272 TYPE_MAX_VALUE for an array with "N" elements, if "N" is
17273 not an integer constant. We cannot unify arbitrarily
17274 complex expressions, so we eliminate the MINUS_EXPRs
17276 parm_max
= TYPE_MAX_VALUE (parm_dom
);
17277 parm_cst
= TREE_CODE (parm_max
) == INTEGER_CST
;
17280 gcc_assert (TREE_CODE (parm_max
) == MINUS_EXPR
);
17281 parm_max
= TREE_OPERAND (parm_max
, 0);
17283 arg_max
= TYPE_MAX_VALUE (arg_dom
);
17284 arg_cst
= TREE_CODE (arg_max
) == INTEGER_CST
;
17287 /* The ARG_MAX may not be a simple MINUS_EXPR, if we are
17288 trying to unify the type of a variable with the type
17289 of a template parameter. For example:
17291 template <unsigned int N>
17292 void f (char (&) [N]);
17299 Here, the type of the ARG will be "int [g(i)]", and
17300 may be a SAVE_EXPR, etc. */
17301 if (TREE_CODE (arg_max
) != MINUS_EXPR
)
17302 return unify_vla_arg (explain_p
, arg_dom
);
17303 arg_max
= TREE_OPERAND (arg_max
, 0);
17306 /* If only one of the bounds used a MINUS_EXPR, compensate
17307 by adding one to the other bound. */
17308 if (parm_cst
&& !arg_cst
)
17309 parm_max
= fold_build2_loc (input_location
, PLUS_EXPR
,
17313 else if (arg_cst
&& !parm_cst
)
17314 arg_max
= fold_build2_loc (input_location
, PLUS_EXPR
,
17319 return unify (tparms
, targs
, parm_max
, arg_max
,
17320 UNIFY_ALLOW_INTEGER
, explain_p
);
17323 /* Deduce the value of template parameters. TPARMS is the (innermost)
17324 set of template parameters to a template. TARGS is the bindings
17325 for those template parameters, as determined thus far; TARGS may
17326 include template arguments for outer levels of template parameters
17327 as well. PARM is a parameter to a template function, or a
17328 subcomponent of that parameter; ARG is the corresponding argument.
17329 This function attempts to match PARM with ARG in a manner
17330 consistent with the existing assignments in TARGS. If more values
17331 are deduced, then TARGS is updated.
17333 Returns 0 if the type deduction succeeds, 1 otherwise. The
17334 parameter STRICT is a bitwise or of the following flags:
17337 Require an exact match between PARM and ARG.
17338 UNIFY_ALLOW_MORE_CV_QUAL:
17339 Allow the deduced ARG to be more cv-qualified (by qualification
17340 conversion) than ARG.
17341 UNIFY_ALLOW_LESS_CV_QUAL:
17342 Allow the deduced ARG to be less cv-qualified than ARG.
17343 UNIFY_ALLOW_DERIVED:
17344 Allow the deduced ARG to be a template base class of ARG,
17345 or a pointer to a template base class of the type pointed to by
17347 UNIFY_ALLOW_INTEGER:
17348 Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX
17349 case for more information.
17350 UNIFY_ALLOW_OUTER_LEVEL:
17351 This is the outermost level of a deduction. Used to determine validity
17352 of qualification conversions. A valid qualification conversion must
17353 have const qualified pointers leading up to the inner type which
17354 requires additional CV quals, except at the outer level, where const
17355 is not required [conv.qual]. It would be normal to set this flag in
17356 addition to setting UNIFY_ALLOW_MORE_CV_QUAL.
17357 UNIFY_ALLOW_OUTER_MORE_CV_QUAL:
17358 This is the outermost level of a deduction, and PARM can be more CV
17359 qualified at this point.
17360 UNIFY_ALLOW_OUTER_LESS_CV_QUAL:
17361 This is the outermost level of a deduction, and PARM can be less CV
17362 qualified at this point. */
17365 unify (tree tparms
, tree targs
, tree parm
, tree arg
, int strict
,
17371 int strict_in
= strict
;
17373 /* I don't think this will do the right thing with respect to types.
17374 But the only case I've seen it in so far has been array bounds, where
17375 signedness is the only information lost, and I think that will be
17377 while (TREE_CODE (parm
) == NOP_EXPR
)
17378 parm
= TREE_OPERAND (parm
, 0);
17380 if (arg
== error_mark_node
)
17381 return unify_invalid (explain_p
);
17382 if (arg
== unknown_type_node
17383 || arg
== init_list_type_node
)
17384 /* We can't deduce anything from this, but we might get all the
17385 template args from other function args. */
17386 return unify_success (explain_p
);
17388 /* If PARM uses template parameters, then we can't bail out here,
17389 even if ARG == PARM, since we won't record unifications for the
17390 template parameters. We might need them if we're trying to
17391 figure out which of two things is more specialized. */
17392 if (arg
== parm
&& !uses_template_parms (parm
))
17393 return unify_success (explain_p
);
17395 /* Handle init lists early, so the rest of the function can assume
17396 we're dealing with a type. */
17397 if (BRACE_ENCLOSED_INITIALIZER_P (arg
))
17401 tree orig_parm
= parm
;
17403 /* Replace T with std::initializer_list<T> for deduction. */
17404 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
17405 && flag_deduce_init_list
)
17406 parm
= listify (parm
);
17408 if (!is_std_init_list (parm
)
17409 && TREE_CODE (parm
) != ARRAY_TYPE
)
17410 /* We can only deduce from an initializer list argument if the
17411 parameter is std::initializer_list or an array; otherwise this
17412 is a non-deduced context. */
17413 return unify_success (explain_p
);
17415 if (TREE_CODE (parm
) == ARRAY_TYPE
)
17416 elttype
= TREE_TYPE (parm
);
17418 elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (parm
), 0);
17420 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (arg
), i
, elt
)
17422 int elt_strict
= strict
;
17424 if (elt
== error_mark_node
)
17425 return unify_invalid (explain_p
);
17427 if (!BRACE_ENCLOSED_INITIALIZER_P (elt
))
17429 tree type
= TREE_TYPE (elt
);
17430 /* It should only be possible to get here for a call. */
17431 gcc_assert (elt_strict
& UNIFY_ALLOW_OUTER_LEVEL
);
17432 elt_strict
|= maybe_adjust_types_for_deduction
17433 (DEDUCE_CALL
, &elttype
, &type
, elt
);
17437 RECUR_AND_CHECK_FAILURE (tparms
, targs
, elttype
, elt
, elt_strict
,
17441 if (TREE_CODE (parm
) == ARRAY_TYPE
17442 && deducible_array_bound (TYPE_DOMAIN (parm
)))
17444 /* Also deduce from the length of the initializer list. */
17445 tree max
= size_int (CONSTRUCTOR_NELTS (arg
));
17446 tree idx
= compute_array_index_type (NULL_TREE
, max
, tf_none
);
17447 if (idx
== error_mark_node
)
17448 return unify_invalid (explain_p
);
17449 return unify_array_domain (tparms
, targs
, TYPE_DOMAIN (parm
),
17453 /* If the std::initializer_list<T> deduction worked, replace the
17454 deduced A with std::initializer_list<A>. */
17455 if (orig_parm
!= parm
)
17457 idx
= TEMPLATE_TYPE_IDX (orig_parm
);
17458 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
17459 targ
= listify (targ
);
17460 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = targ
;
17462 return unify_success (explain_p
);
17465 /* Immediately reject some pairs that won't unify because of
17466 cv-qualification mismatches. */
17467 if (TREE_CODE (arg
) == TREE_CODE (parm
)
17469 /* It is the elements of the array which hold the cv quals of an array
17470 type, and the elements might be template type parms. We'll check
17471 when we recurse. */
17472 && TREE_CODE (arg
) != ARRAY_TYPE
17473 /* We check the cv-qualifiers when unifying with template type
17474 parameters below. We want to allow ARG `const T' to unify with
17475 PARM `T' for example, when computing which of two templates
17476 is more specialized, for example. */
17477 && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
17478 && !check_cv_quals_for_unify (strict_in
, arg
, parm
))
17479 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
17481 if (!(strict
& UNIFY_ALLOW_OUTER_LEVEL
)
17482 && TYPE_P (parm
) && !CP_TYPE_CONST_P (parm
))
17483 strict
&= ~UNIFY_ALLOW_MORE_CV_QUAL
;
17484 strict
&= ~UNIFY_ALLOW_OUTER_LEVEL
;
17485 strict
&= ~UNIFY_ALLOW_DERIVED
;
17486 strict
&= ~UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
17487 strict
&= ~UNIFY_ALLOW_OUTER_LESS_CV_QUAL
;
17489 switch (TREE_CODE (parm
))
17491 case TYPENAME_TYPE
:
17493 case UNBOUND_CLASS_TEMPLATE
:
17494 /* In a type which contains a nested-name-specifier, template
17495 argument values cannot be deduced for template parameters used
17496 within the nested-name-specifier. */
17497 return unify_success (explain_p
);
17499 case TEMPLATE_TYPE_PARM
:
17500 case TEMPLATE_TEMPLATE_PARM
:
17501 case BOUND_TEMPLATE_TEMPLATE_PARM
:
17502 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
17503 if (error_operand_p (tparm
))
17504 return unify_invalid (explain_p
);
17506 if (TEMPLATE_TYPE_LEVEL (parm
)
17507 != template_decl_level (tparm
))
17508 /* The PARM is not one we're trying to unify. Just check
17509 to see if it matches ARG. */
17511 if (TREE_CODE (arg
) == TREE_CODE (parm
)
17512 && (is_auto (parm
) ? is_auto (arg
)
17513 : same_type_p (parm
, arg
)))
17514 return unify_success (explain_p
);
17516 return unify_type_mismatch (explain_p
, parm
, arg
);
17518 idx
= TEMPLATE_TYPE_IDX (parm
);
17519 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
17520 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, idx
));
17521 if (error_operand_p (tparm
))
17522 return unify_invalid (explain_p
);
17524 /* Check for mixed types and values. */
17525 if ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
17526 && TREE_CODE (tparm
) != TYPE_DECL
)
17527 || (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
17528 && TREE_CODE (tparm
) != TEMPLATE_DECL
))
17529 gcc_unreachable ();
17531 if (TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
17533 /* ARG must be constructed from a template class or a template
17534 template parameter. */
17535 if (TREE_CODE (arg
) != BOUND_TEMPLATE_TEMPLATE_PARM
17536 && !CLASSTYPE_SPECIALIZATION_OF_PRIMARY_TEMPLATE_P (arg
))
17537 return unify_template_deduction_failure (explain_p
, parm
, arg
);
17539 tree parmvec
= TYPE_TI_ARGS (parm
);
17540 /* An alias template name is never deduced. */
17541 if (TYPE_ALIAS_P (arg
))
17542 arg
= strip_typedefs (arg
);
17543 tree argvec
= INNERMOST_TEMPLATE_ARGS (TYPE_TI_ARGS (arg
));
17544 tree full_argvec
= add_to_template_args (targs
, argvec
);
17546 = DECL_INNERMOST_TEMPLATE_PARMS
17547 (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (parm
));
17549 int parm_variadic_p
= 0;
17551 /* The resolution to DR150 makes clear that default
17552 arguments for an N-argument may not be used to bind T
17553 to a template template parameter with fewer than N
17554 parameters. It is not safe to permit the binding of
17555 default arguments as an extension, as that may change
17556 the meaning of a conforming program. Consider:
17558 struct Dense { static const unsigned int dim = 1; };
17560 template <template <typename> class View,
17562 void operator+(float, View<Block> const&);
17564 template <typename Block,
17565 unsigned int Dim = Block::dim>
17566 struct Lvalue_proxy { operator float() const; };
17570 Lvalue_proxy<Dense> p;
17575 Here, if Lvalue_proxy is permitted to bind to View, then
17576 the global operator+ will be used; if they are not, the
17577 Lvalue_proxy will be converted to float. */
17578 if (coerce_template_parms (parm_parms
,
17580 TYPE_TI_TEMPLATE (parm
),
17582 ? tf_warning_or_error
17584 /*require_all_args=*/true,
17585 /*use_default_args=*/false)
17586 == error_mark_node
)
17589 /* Deduce arguments T, i from TT<T> or TT<i>.
17590 We check each element of PARMVEC and ARGVEC individually
17591 rather than the whole TREE_VEC since they can have
17592 different number of elements. */
17594 parmvec
= expand_template_argument_pack (parmvec
);
17595 argvec
= expand_template_argument_pack (argvec
);
17597 len
= TREE_VEC_LENGTH (parmvec
);
17599 /* Check if the parameters end in a pack, making them
17602 && PACK_EXPANSION_P (TREE_VEC_ELT (parmvec
, len
- 1)))
17603 parm_variadic_p
= 1;
17605 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
17606 /* If the template argument list of P contains a pack
17607 expansion that is not the last template argument, the
17608 entire template argument list is a non-deduced
17610 if (PACK_EXPANSION_P (TREE_VEC_ELT (parmvec
, i
)))
17611 return unify_success (explain_p
);
17613 if (TREE_VEC_LENGTH (argvec
) < len
- parm_variadic_p
)
17614 return unify_too_few_arguments (explain_p
,
17615 TREE_VEC_LENGTH (argvec
), len
);
17617 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
17619 RECUR_AND_CHECK_FAILURE (tparms
, targs
,
17620 TREE_VEC_ELT (parmvec
, i
),
17621 TREE_VEC_ELT (argvec
, i
),
17622 UNIFY_ALLOW_NONE
, explain_p
);
17625 if (parm_variadic_p
17626 && unify_pack_expansion (tparms
, targs
,
17629 /*subr=*/true, explain_p
))
17632 arg
= TYPE_TI_TEMPLATE (arg
);
17634 /* Fall through to deduce template name. */
17637 if (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
17638 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
17640 /* Deduce template name TT from TT, TT<>, TT<T> and TT<i>. */
17642 /* Simple cases: Value already set, does match or doesn't. */
17643 if (targ
!= NULL_TREE
&& template_args_equal (targ
, arg
))
17644 return unify_success (explain_p
);
17646 return unify_inconsistency (explain_p
, parm
, targ
, arg
);
17650 /* If PARM is `const T' and ARG is only `int', we don't have
17651 a match unless we are allowing additional qualification.
17652 If ARG is `const int' and PARM is just `T' that's OK;
17653 that binds `const int' to `T'. */
17654 if (!check_cv_quals_for_unify (strict_in
| UNIFY_ALLOW_LESS_CV_QUAL
,
17656 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
17658 /* Consider the case where ARG is `const volatile int' and
17659 PARM is `const T'. Then, T should be `volatile int'. */
17660 arg
= cp_build_qualified_type_real
17661 (arg
, cp_type_quals (arg
) & ~cp_type_quals (parm
), tf_none
);
17662 if (arg
== error_mark_node
)
17663 return unify_invalid (explain_p
);
17665 /* Simple cases: Value already set, does match or doesn't. */
17666 if (targ
!= NULL_TREE
&& same_type_p (targ
, arg
))
17667 return unify_success (explain_p
);
17669 return unify_inconsistency (explain_p
, parm
, targ
, arg
);
17671 /* Make sure that ARG is not a variable-sized array. (Note
17672 that were talking about variable-sized arrays (like
17673 `int[n]'), rather than arrays of unknown size (like
17674 `int[]').) We'll get very confused by such a type since
17675 the bound of the array is not constant, and therefore
17676 not mangleable. Besides, such types are not allowed in
17677 ISO C++, so we can do as we please here. We do allow
17678 them for 'auto' deduction, since that isn't ABI-exposed. */
17679 if (!is_auto (parm
) && variably_modified_type_p (arg
, NULL_TREE
))
17680 return unify_vla_arg (explain_p
, arg
);
17682 /* Strip typedefs as in convert_template_argument. */
17683 arg
= canonicalize_type_argument (arg
, tf_none
);
17686 /* If ARG is a parameter pack or an expansion, we cannot unify
17687 against it unless PARM is also a parameter pack. */
17688 if ((template_parameter_pack_p (arg
) || PACK_EXPANSION_P (arg
))
17689 && !template_parameter_pack_p (parm
))
17690 return unify_parameter_pack_mismatch (explain_p
, parm
, arg
);
17692 /* If the argument deduction results is a METHOD_TYPE,
17693 then there is a problem.
17694 METHOD_TYPE doesn't map to any real C++ type the result of
17695 the deduction can not be of that type. */
17696 if (TREE_CODE (arg
) == METHOD_TYPE
)
17697 return unify_method_type_error (explain_p
, arg
);
17699 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = arg
;
17700 return unify_success (explain_p
);
17702 case TEMPLATE_PARM_INDEX
:
17703 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
17704 if (error_operand_p (tparm
))
17705 return unify_invalid (explain_p
);
17707 if (TEMPLATE_PARM_LEVEL (parm
)
17708 != template_decl_level (tparm
))
17710 /* The PARM is not one we're trying to unify. Just check
17711 to see if it matches ARG. */
17712 int result
= !(TREE_CODE (arg
) == TREE_CODE (parm
)
17713 && cp_tree_equal (parm
, arg
));
17715 unify_expression_unequal (explain_p
, parm
, arg
);
17719 idx
= TEMPLATE_PARM_IDX (parm
);
17720 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
17724 int x
= !cp_tree_equal (targ
, arg
);
17726 unify_inconsistency (explain_p
, parm
, targ
, arg
);
17730 /* [temp.deduct.type] If, in the declaration of a function template
17731 with a non-type template-parameter, the non-type
17732 template-parameter is used in an expression in the function
17733 parameter-list and, if the corresponding template-argument is
17734 deduced, the template-argument type shall match the type of the
17735 template-parameter exactly, except that a template-argument
17736 deduced from an array bound may be of any integral type.
17737 The non-type parameter might use already deduced type parameters. */
17738 tparm
= tsubst (TREE_TYPE (parm
), targs
, 0, NULL_TREE
);
17739 if (!TREE_TYPE (arg
))
17740 /* Template-parameter dependent expression. Just accept it for now.
17741 It will later be processed in convert_template_argument. */
17743 else if (same_type_p (TREE_TYPE (arg
), tparm
))
17745 else if ((strict
& UNIFY_ALLOW_INTEGER
)
17746 && CP_INTEGRAL_TYPE_P (tparm
))
17747 /* Convert the ARG to the type of PARM; the deduced non-type
17748 template argument must exactly match the types of the
17749 corresponding parameter. */
17750 arg
= fold (build_nop (tparm
, arg
));
17751 else if (uses_template_parms (tparm
))
17752 /* We haven't deduced the type of this parameter yet. Try again
17754 return unify_success (explain_p
);
17756 return unify_type_mismatch (explain_p
, tparm
, TREE_TYPE (arg
));
17758 /* If ARG is a parameter pack or an expansion, we cannot unify
17759 against it unless PARM is also a parameter pack. */
17760 if ((template_parameter_pack_p (arg
) || PACK_EXPANSION_P (arg
))
17761 && !TEMPLATE_PARM_PARAMETER_PACK (parm
))
17762 return unify_parameter_pack_mismatch (explain_p
, parm
, arg
);
17764 arg
= strip_typedefs_expr (arg
);
17765 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = arg
;
17766 return unify_success (explain_p
);
17770 /* A pointer-to-member constant can be unified only with
17771 another constant. */
17772 if (TREE_CODE (arg
) != PTRMEM_CST
)
17773 return unify_ptrmem_cst_mismatch (explain_p
, parm
, arg
);
17775 /* Just unify the class member. It would be useless (and possibly
17776 wrong, depending on the strict flags) to unify also
17777 PTRMEM_CST_CLASS, because we want to be sure that both parm and
17778 arg refer to the same variable, even if through different
17779 classes. For instance:
17781 struct A { int x; };
17784 Unification of &A::x and &B::x must succeed. */
17785 return unify (tparms
, targs
, PTRMEM_CST_MEMBER (parm
),
17786 PTRMEM_CST_MEMBER (arg
), strict
, explain_p
);
17791 if (!TYPE_PTR_P (arg
))
17792 return unify_type_mismatch (explain_p
, parm
, arg
);
17794 /* [temp.deduct.call]
17796 A can be another pointer or pointer to member type that can
17797 be converted to the deduced A via a qualification
17798 conversion (_conv.qual_).
17800 We pass down STRICT here rather than UNIFY_ALLOW_NONE.
17801 This will allow for additional cv-qualification of the
17802 pointed-to types if appropriate. */
17804 if (TREE_CODE (TREE_TYPE (arg
)) == RECORD_TYPE
)
17805 /* The derived-to-base conversion only persists through one
17806 level of pointers. */
17807 strict
|= (strict_in
& UNIFY_ALLOW_DERIVED
);
17809 return unify (tparms
, targs
, TREE_TYPE (parm
),
17810 TREE_TYPE (arg
), strict
, explain_p
);
17813 case REFERENCE_TYPE
:
17814 if (TREE_CODE (arg
) != REFERENCE_TYPE
)
17815 return unify_type_mismatch (explain_p
, parm
, arg
);
17816 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
17817 strict
& UNIFY_ALLOW_MORE_CV_QUAL
, explain_p
);
17820 if (TREE_CODE (arg
) != ARRAY_TYPE
)
17821 return unify_type_mismatch (explain_p
, parm
, arg
);
17822 if ((TYPE_DOMAIN (parm
) == NULL_TREE
)
17823 != (TYPE_DOMAIN (arg
) == NULL_TREE
))
17824 return unify_type_mismatch (explain_p
, parm
, arg
);
17825 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
17826 strict
& UNIFY_ALLOW_MORE_CV_QUAL
, explain_p
);
17827 if (TYPE_DOMAIN (parm
) != NULL_TREE
)
17828 return unify_array_domain (tparms
, targs
, TYPE_DOMAIN (parm
),
17829 TYPE_DOMAIN (arg
), explain_p
);
17830 return unify_success (explain_p
);
17837 case ENUMERAL_TYPE
:
17840 if (TREE_CODE (arg
) != TREE_CODE (parm
))
17841 return unify_type_mismatch (explain_p
, parm
, arg
);
17843 /* We have already checked cv-qualification at the top of the
17845 if (!same_type_ignoring_top_level_qualifiers_p (arg
, parm
))
17846 return unify_type_mismatch (explain_p
, parm
, arg
);
17848 /* As far as unification is concerned, this wins. Later checks
17849 will invalidate it if necessary. */
17850 return unify_success (explain_p
);
17852 /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */
17853 /* Type INTEGER_CST can come from ordinary constant template args. */
17855 while (TREE_CODE (arg
) == NOP_EXPR
)
17856 arg
= TREE_OPERAND (arg
, 0);
17858 if (TREE_CODE (arg
) != INTEGER_CST
)
17859 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
17860 return (tree_int_cst_equal (parm
, arg
)
17861 ? unify_success (explain_p
)
17862 : unify_template_argument_mismatch (explain_p
, parm
, arg
));
17866 int i
, len
, argslen
;
17867 int parm_variadic_p
= 0;
17869 if (TREE_CODE (arg
) != TREE_VEC
)
17870 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
17872 len
= TREE_VEC_LENGTH (parm
);
17873 argslen
= TREE_VEC_LENGTH (arg
);
17875 /* Check for pack expansions in the parameters. */
17876 for (i
= 0; i
< len
; ++i
)
17878 if (PACK_EXPANSION_P (TREE_VEC_ELT (parm
, i
)))
17881 /* We can unify against something with a trailing
17883 parm_variadic_p
= 1;
17885 /* [temp.deduct.type]/9: If the template argument list of
17886 P contains a pack expansion that is not the last
17887 template argument, the entire template argument list
17888 is a non-deduced context. */
17889 return unify_success (explain_p
);
17893 /* If we don't have enough arguments to satisfy the parameters
17894 (not counting the pack expression at the end), or we have
17895 too many arguments for a parameter list that doesn't end in
17896 a pack expression, we can't unify. */
17897 if (parm_variadic_p
17898 ? argslen
< len
- parm_variadic_p
17900 return unify_arity (explain_p
, TREE_VEC_LENGTH (arg
), len
);
17902 /* Unify all of the parameters that precede the (optional)
17903 pack expression. */
17904 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
17906 RECUR_AND_CHECK_FAILURE (tparms
, targs
,
17907 TREE_VEC_ELT (parm
, i
),
17908 TREE_VEC_ELT (arg
, i
),
17909 UNIFY_ALLOW_NONE
, explain_p
);
17911 if (parm_variadic_p
)
17912 return unify_pack_expansion (tparms
, targs
, parm
, arg
,
17914 /*subr=*/true, explain_p
);
17915 return unify_success (explain_p
);
17920 if (TREE_CODE (arg
) != TREE_CODE (parm
))
17921 return unify_type_mismatch (explain_p
, parm
, arg
);
17923 if (TYPE_PTRMEMFUNC_P (parm
))
17925 if (!TYPE_PTRMEMFUNC_P (arg
))
17926 return unify_type_mismatch (explain_p
, parm
, arg
);
17928 return unify (tparms
, targs
,
17929 TYPE_PTRMEMFUNC_FN_TYPE (parm
),
17930 TYPE_PTRMEMFUNC_FN_TYPE (arg
),
17931 strict
, explain_p
);
17934 if (CLASSTYPE_TEMPLATE_INFO (parm
))
17936 tree t
= NULL_TREE
;
17938 if (strict_in
& UNIFY_ALLOW_DERIVED
)
17940 /* First, we try to unify the PARM and ARG directly. */
17941 t
= try_class_unification (tparms
, targs
,
17942 parm
, arg
, explain_p
);
17946 /* Fallback to the special case allowed in
17947 [temp.deduct.call]:
17949 If P is a class, and P has the form
17950 template-id, then A can be a derived class of
17951 the deduced A. Likewise, if P is a pointer to
17952 a class of the form template-id, A can be a
17953 pointer to a derived class pointed to by the
17955 enum template_base_result r
;
17956 r
= get_template_base (tparms
, targs
, parm
, arg
,
17960 return unify_no_common_base (explain_p
, r
, parm
, arg
);
17963 else if (CLASSTYPE_TEMPLATE_INFO (arg
)
17964 && (CLASSTYPE_TI_TEMPLATE (parm
)
17965 == CLASSTYPE_TI_TEMPLATE (arg
)))
17966 /* Perhaps PARM is something like S<U> and ARG is S<int>.
17967 Then, we should unify `int' and `U'. */
17970 /* There's no chance of unification succeeding. */
17971 return unify_type_mismatch (explain_p
, parm
, arg
);
17973 return unify (tparms
, targs
, CLASSTYPE_TI_ARGS (parm
),
17974 CLASSTYPE_TI_ARGS (t
), UNIFY_ALLOW_NONE
, explain_p
);
17976 else if (!same_type_ignoring_top_level_qualifiers_p (parm
, arg
))
17977 return unify_type_mismatch (explain_p
, parm
, arg
);
17978 return unify_success (explain_p
);
17981 case FUNCTION_TYPE
:
17983 unsigned int nargs
;
17988 if (TREE_CODE (arg
) != TREE_CODE (parm
))
17989 return unify_type_mismatch (explain_p
, parm
, arg
);
17991 /* CV qualifications for methods can never be deduced, they must
17992 match exactly. We need to check them explicitly here,
17993 because type_unification_real treats them as any other
17994 cv-qualified parameter. */
17995 if (TREE_CODE (parm
) == METHOD_TYPE
17996 && (!check_cv_quals_for_unify
17998 class_of_this_parm (arg
),
17999 class_of_this_parm (parm
))))
18000 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
18002 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TREE_TYPE (parm
),
18003 TREE_TYPE (arg
), UNIFY_ALLOW_NONE
, explain_p
);
18005 nargs
= list_length (TYPE_ARG_TYPES (arg
));
18006 args
= XALLOCAVEC (tree
, nargs
);
18007 for (a
= TYPE_ARG_TYPES (arg
), i
= 0;
18008 a
!= NULL_TREE
&& a
!= void_list_node
;
18009 a
= TREE_CHAIN (a
), ++i
)
18010 args
[i
] = TREE_VALUE (a
);
18013 return type_unification_real (tparms
, targs
, TYPE_ARG_TYPES (parm
),
18014 args
, nargs
, 1, DEDUCE_EXACT
,
18015 LOOKUP_NORMAL
, NULL
, explain_p
);
18019 /* Unify a pointer to member with a pointer to member function, which
18020 deduces the type of the member as a function type. */
18021 if (TYPE_PTRMEMFUNC_P (arg
))
18023 /* Check top-level cv qualifiers */
18024 if (!check_cv_quals_for_unify (UNIFY_ALLOW_NONE
, arg
, parm
))
18025 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
18027 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
18028 TYPE_PTRMEMFUNC_OBJECT_TYPE (arg
),
18029 UNIFY_ALLOW_NONE
, explain_p
);
18031 /* Determine the type of the function we are unifying against. */
18032 tree fntype
= static_fn_type (arg
);
18034 return unify (tparms
, targs
, TREE_TYPE (parm
), fntype
, strict
, explain_p
);
18037 if (TREE_CODE (arg
) != OFFSET_TYPE
)
18038 return unify_type_mismatch (explain_p
, parm
, arg
);
18039 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
18040 TYPE_OFFSET_BASETYPE (arg
),
18041 UNIFY_ALLOW_NONE
, explain_p
);
18042 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
18043 strict
, explain_p
);
18046 if (DECL_TEMPLATE_PARM_P (parm
))
18047 return unify (tparms
, targs
, DECL_INITIAL (parm
), arg
, strict
, explain_p
);
18048 if (arg
!= integral_constant_value (parm
))
18049 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
18050 return unify_success (explain_p
);
18053 case TEMPLATE_DECL
:
18054 /* Matched cases are handled by the ARG == PARM test above. */
18055 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
18058 /* A non-type template parameter that is a variable should be a
18059 an integral constant, in which case, it whould have been
18060 folded into its (constant) value. So we should not be getting
18061 a variable here. */
18062 gcc_unreachable ();
18064 case TYPE_ARGUMENT_PACK
:
18065 case NONTYPE_ARGUMENT_PACK
:
18066 return unify (tparms
, targs
, ARGUMENT_PACK_ARGS (parm
),
18067 ARGUMENT_PACK_ARGS (arg
), strict
, explain_p
);
18070 case DECLTYPE_TYPE
:
18071 case UNDERLYING_TYPE
:
18072 /* Cannot deduce anything from TYPEOF_TYPE, DECLTYPE_TYPE,
18073 or UNDERLYING_TYPE nodes. */
18074 return unify_success (explain_p
);
18077 /* Unification fails if we hit an error node. */
18078 return unify_invalid (explain_p
);
18081 if (REFERENCE_REF_P (parm
))
18082 return unify (tparms
, targs
, TREE_OPERAND (parm
, 0), arg
,
18083 strict
, explain_p
);
18087 /* An unresolved overload is a nondeduced context. */
18088 if (is_overloaded_fn (parm
) || type_unknown_p (parm
))
18089 return unify_success (explain_p
);
18090 gcc_assert (EXPR_P (parm
));
18092 /* We must be looking at an expression. This can happen with
18096 void foo(S<I>, S<I + 2>);
18098 This is a "nondeduced context":
18102 The nondeduced contexts are:
18104 --A type that is a template-id in which one or more of
18105 the template-arguments is an expression that references
18106 a template-parameter.
18108 In these cases, we assume deduction succeeded, but don't
18109 actually infer any unifications. */
18111 if (!uses_template_parms (parm
)
18112 && !template_args_equal (parm
, arg
))
18113 return unify_expression_unequal (explain_p
, parm
, arg
);
18115 return unify_success (explain_p
);
18118 #undef RECUR_AND_CHECK_FAILURE
18120 /* Note that DECL can be defined in this translation unit, if
18124 mark_definable (tree decl
)
18127 DECL_NOT_REALLY_EXTERN (decl
) = 1;
18128 FOR_EACH_CLONE (clone
, decl
)
18129 DECL_NOT_REALLY_EXTERN (clone
) = 1;
18132 /* Called if RESULT is explicitly instantiated, or is a member of an
18133 explicitly instantiated class. */
18136 mark_decl_instantiated (tree result
, int extern_p
)
18138 SET_DECL_EXPLICIT_INSTANTIATION (result
);
18140 /* If this entity has already been written out, it's too late to
18141 make any modifications. */
18142 if (TREE_ASM_WRITTEN (result
))
18145 /* For anonymous namespace we don't need to do anything. */
18146 if (decl_anon_ns_mem_p (result
))
18148 gcc_assert (!TREE_PUBLIC (result
));
18152 if (TREE_CODE (result
) != FUNCTION_DECL
)
18153 /* The TREE_PUBLIC flag for function declarations will have been
18154 set correctly by tsubst. */
18155 TREE_PUBLIC (result
) = 1;
18157 /* This might have been set by an earlier implicit instantiation. */
18158 DECL_COMDAT (result
) = 0;
18161 DECL_NOT_REALLY_EXTERN (result
) = 0;
18164 mark_definable (result
);
18165 mark_needed (result
);
18166 /* Always make artificials weak. */
18167 if (DECL_ARTIFICIAL (result
) && flag_weak
)
18168 comdat_linkage (result
);
18169 /* For WIN32 we also want to put explicit instantiations in
18170 linkonce sections. */
18171 else if (TREE_PUBLIC (result
))
18172 maybe_make_one_only (result
);
18175 /* If EXTERN_P, then this function will not be emitted -- unless
18176 followed by an explicit instantiation, at which point its linkage
18177 will be adjusted. If !EXTERN_P, then this function will be
18178 emitted here. In neither circumstance do we want
18179 import_export_decl to adjust the linkage. */
18180 DECL_INTERFACE_KNOWN (result
) = 1;
18183 /* Subroutine of more_specialized_fn: check whether TARGS is missing any
18184 important template arguments. If any are missing, we check whether
18185 they're important by using error_mark_node for substituting into any
18186 args that were used for partial ordering (the ones between ARGS and END)
18187 and seeing if it bubbles up. */
18190 check_undeduced_parms (tree targs
, tree args
, tree end
)
18192 bool found
= false;
18194 for (i
= TREE_VEC_LENGTH (targs
) - 1; i
>= 0; --i
)
18195 if (TREE_VEC_ELT (targs
, i
) == NULL_TREE
)
18198 TREE_VEC_ELT (targs
, i
) = error_mark_node
;
18202 tree substed
= tsubst_arg_types (args
, targs
, end
, tf_none
, NULL_TREE
);
18203 if (substed
== error_mark_node
)
18209 /* Given two function templates PAT1 and PAT2, return:
18211 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order].
18212 -1 if PAT2 is more specialized than PAT1.
18213 0 if neither is more specialized.
18215 LEN indicates the number of parameters we should consider
18216 (defaulted parameters should not be considered).
18218 The 1998 std underspecified function template partial ordering, and
18219 DR214 addresses the issue. We take pairs of arguments, one from
18220 each of the templates, and deduce them against each other. One of
18221 the templates will be more specialized if all the *other*
18222 template's arguments deduce against its arguments and at least one
18223 of its arguments *does* *not* deduce against the other template's
18224 corresponding argument. Deduction is done as for class templates.
18225 The arguments used in deduction have reference and top level cv
18226 qualifiers removed. Iff both arguments were originally reference
18227 types *and* deduction succeeds in both directions, an lvalue reference
18228 wins against an rvalue reference and otherwise the template
18229 with the more cv-qualified argument wins for that pairing (if
18230 neither is more cv-qualified, they both are equal). Unlike regular
18231 deduction, after all the arguments have been deduced in this way,
18232 we do *not* verify the deduced template argument values can be
18233 substituted into non-deduced contexts.
18235 The logic can be a bit confusing here, because we look at deduce1 and
18236 targs1 to see if pat2 is at least as specialized, and vice versa; if we
18237 can find template arguments for pat1 to make arg1 look like arg2, that
18238 means that arg2 is at least as specialized as arg1. */
18241 more_specialized_fn (tree pat1
, tree pat2
, int len
)
18243 tree decl1
= DECL_TEMPLATE_RESULT (pat1
);
18244 tree decl2
= DECL_TEMPLATE_RESULT (pat2
);
18245 tree targs1
= make_tree_vec (DECL_NTPARMS (pat1
));
18246 tree targs2
= make_tree_vec (DECL_NTPARMS (pat2
));
18247 tree tparms1
= DECL_INNERMOST_TEMPLATE_PARMS (pat1
);
18248 tree tparms2
= DECL_INNERMOST_TEMPLATE_PARMS (pat2
);
18249 tree args1
= TYPE_ARG_TYPES (TREE_TYPE (decl1
));
18250 tree args2
= TYPE_ARG_TYPES (TREE_TYPE (decl2
));
18251 tree origs1
, origs2
;
18252 bool lose1
= false;
18253 bool lose2
= false;
18255 /* Remove the this parameter from non-static member functions. If
18256 one is a non-static member function and the other is not a static
18257 member function, remove the first parameter from that function
18258 also. This situation occurs for operator functions where we
18259 locate both a member function (with this pointer) and non-member
18260 operator (with explicit first operand). */
18261 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl1
))
18263 len
--; /* LEN is the number of significant arguments for DECL1 */
18264 args1
= TREE_CHAIN (args1
);
18265 if (!DECL_STATIC_FUNCTION_P (decl2
))
18266 args2
= TREE_CHAIN (args2
);
18268 else if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl2
))
18270 args2
= TREE_CHAIN (args2
);
18271 if (!DECL_STATIC_FUNCTION_P (decl1
))
18274 args1
= TREE_CHAIN (args1
);
18278 /* If only one is a conversion operator, they are unordered. */
18279 if (DECL_CONV_FN_P (decl1
) != DECL_CONV_FN_P (decl2
))
18282 /* Consider the return type for a conversion function */
18283 if (DECL_CONV_FN_P (decl1
))
18285 args1
= tree_cons (NULL_TREE
, TREE_TYPE (TREE_TYPE (decl1
)), args1
);
18286 args2
= tree_cons (NULL_TREE
, TREE_TYPE (TREE_TYPE (decl2
)), args2
);
18290 processing_template_decl
++;
18296 /* Stop when an ellipsis is seen. */
18297 && args1
!= NULL_TREE
&& args2
!= NULL_TREE
)
18299 tree arg1
= TREE_VALUE (args1
);
18300 tree arg2
= TREE_VALUE (args2
);
18301 int deduce1
, deduce2
;
18307 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
18308 && TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
18310 /* When both arguments are pack expansions, we need only
18311 unify the patterns themselves. */
18312 arg1
= PACK_EXPANSION_PATTERN (arg1
);
18313 arg2
= PACK_EXPANSION_PATTERN (arg2
);
18315 /* This is the last comparison we need to do. */
18319 if (TREE_CODE (arg1
) == REFERENCE_TYPE
)
18321 ref1
= TYPE_REF_IS_RVALUE (arg1
) + 1;
18322 arg1
= TREE_TYPE (arg1
);
18323 quals1
= cp_type_quals (arg1
);
18326 if (TREE_CODE (arg2
) == REFERENCE_TYPE
)
18328 ref2
= TYPE_REF_IS_RVALUE (arg2
) + 1;
18329 arg2
= TREE_TYPE (arg2
);
18330 quals2
= cp_type_quals (arg2
);
18333 arg1
= TYPE_MAIN_VARIANT (arg1
);
18334 arg2
= TYPE_MAIN_VARIANT (arg2
);
18336 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
)
18338 int i
, len2
= list_length (args2
);
18339 tree parmvec
= make_tree_vec (1);
18340 tree argvec
= make_tree_vec (len2
);
18343 /* Setup the parameter vector, which contains only ARG1. */
18344 TREE_VEC_ELT (parmvec
, 0) = arg1
;
18346 /* Setup the argument vector, which contains the remaining
18348 for (i
= 0; i
< len2
; i
++, ta
= TREE_CHAIN (ta
))
18349 TREE_VEC_ELT (argvec
, i
) = TREE_VALUE (ta
);
18351 deduce1
= (unify_pack_expansion (tparms1
, targs1
, parmvec
,
18352 argvec
, DEDUCE_EXACT
,
18353 /*subr=*/true, /*explain_p=*/false)
18356 /* We cannot deduce in the other direction, because ARG1 is
18357 a pack expansion but ARG2 is not. */
18360 else if (TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
18362 int i
, len1
= list_length (args1
);
18363 tree parmvec
= make_tree_vec (1);
18364 tree argvec
= make_tree_vec (len1
);
18367 /* Setup the parameter vector, which contains only ARG1. */
18368 TREE_VEC_ELT (parmvec
, 0) = arg2
;
18370 /* Setup the argument vector, which contains the remaining
18372 for (i
= 0; i
< len1
; i
++, ta
= TREE_CHAIN (ta
))
18373 TREE_VEC_ELT (argvec
, i
) = TREE_VALUE (ta
);
18375 deduce2
= (unify_pack_expansion (tparms2
, targs2
, parmvec
,
18376 argvec
, DEDUCE_EXACT
,
18377 /*subr=*/true, /*explain_p=*/false)
18380 /* We cannot deduce in the other direction, because ARG2 is
18381 a pack expansion but ARG1 is not.*/
18387 /* The normal case, where neither argument is a pack
18389 deduce1
= (unify (tparms1
, targs1
, arg1
, arg2
,
18390 UNIFY_ALLOW_NONE
, /*explain_p=*/false)
18392 deduce2
= (unify (tparms2
, targs2
, arg2
, arg1
,
18393 UNIFY_ALLOW_NONE
, /*explain_p=*/false)
18397 /* If we couldn't deduce arguments for tparms1 to make arg1 match
18398 arg2, then arg2 is not as specialized as arg1. */
18404 /* "If, for a given type, deduction succeeds in both directions
18405 (i.e., the types are identical after the transformations above)
18406 and both P and A were reference types (before being replaced with
18407 the type referred to above):
18408 - if the type from the argument template was an lvalue reference and
18409 the type from the parameter template was not, the argument type is
18410 considered to be more specialized than the other; otherwise,
18411 - if the type from the argument template is more cv-qualified
18412 than the type from the parameter template (as described above),
18413 the argument type is considered to be more specialized than the other;
18415 - neither type is more specialized than the other." */
18417 if (deduce1
&& deduce2
)
18419 if (ref1
&& ref2
&& ref1
!= ref2
)
18426 else if (quals1
!= quals2
&& quals1
>= 0 && quals2
>= 0)
18428 if ((quals1
& quals2
) == quals2
)
18430 if ((quals1
& quals2
) == quals1
)
18435 if (lose1
&& lose2
)
18436 /* We've failed to deduce something in either direction.
18437 These must be unordered. */
18440 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
18441 || TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
18442 /* We have already processed all of the arguments in our
18443 handing of the pack expansion type. */
18446 args1
= TREE_CHAIN (args1
);
18447 args2
= TREE_CHAIN (args2
);
18450 /* "In most cases, all template parameters must have values in order for
18451 deduction to succeed, but for partial ordering purposes a template
18452 parameter may remain without a value provided it is not used in the
18453 types being used for partial ordering."
18455 Thus, if we are missing any of the targs1 we need to substitute into
18456 origs1, then pat2 is not as specialized as pat1. This can happen when
18457 there is a nondeduced context. */
18458 if (!lose2
&& check_undeduced_parms (targs1
, origs1
, args1
))
18460 if (!lose1
&& check_undeduced_parms (targs2
, origs2
, args2
))
18463 processing_template_decl
--;
18465 /* All things being equal, if the next argument is a pack expansion
18466 for one function but not for the other, prefer the
18467 non-variadic function. FIXME this is bogus; see c++/41958. */
18469 && args1
&& TREE_VALUE (args1
)
18470 && args2
&& TREE_VALUE (args2
))
18472 lose1
= TREE_CODE (TREE_VALUE (args1
)) == TYPE_PACK_EXPANSION
;
18473 lose2
= TREE_CODE (TREE_VALUE (args2
)) == TYPE_PACK_EXPANSION
;
18476 if (lose1
== lose2
)
18484 /* Determine which of two partial specializations of TMPL is more
18487 PAT1 is a TREE_LIST whose TREE_TYPE is the _TYPE node corresponding
18488 to the first partial specialization. The TREE_VALUE is the
18489 innermost set of template parameters for the partial
18490 specialization. PAT2 is similar, but for the second template.
18492 Return 1 if the first partial specialization is more specialized;
18493 -1 if the second is more specialized; 0 if neither is more
18496 See [temp.class.order] for information about determining which of
18497 two templates is more specialized. */
18500 more_specialized_class (tree tmpl
, tree pat1
, tree pat2
)
18505 bool any_deductions
= false;
18507 tmpl1
= TREE_TYPE (pat1
);
18508 tmpl2
= TREE_TYPE (pat2
);
18510 /* Just like what happens for functions, if we are ordering between
18511 different class template specializations, we may encounter dependent
18512 types in the arguments, and we need our dependency check functions
18513 to behave correctly. */
18514 ++processing_template_decl
;
18515 targs
= get_class_bindings (tmpl
, TREE_VALUE (pat1
),
18516 CLASSTYPE_TI_ARGS (tmpl1
),
18517 CLASSTYPE_TI_ARGS (tmpl2
));
18521 any_deductions
= true;
18524 targs
= get_class_bindings (tmpl
, TREE_VALUE (pat2
),
18525 CLASSTYPE_TI_ARGS (tmpl2
),
18526 CLASSTYPE_TI_ARGS (tmpl1
));
18530 any_deductions
= true;
18532 --processing_template_decl
;
18534 /* In the case of a tie where at least one of the class templates
18535 has a parameter pack at the end, the template with the most
18536 non-packed parameters wins. */
18539 && (template_args_variadic_p (TREE_PURPOSE (pat1
))
18540 || template_args_variadic_p (TREE_PURPOSE (pat2
))))
18542 tree args1
= INNERMOST_TEMPLATE_ARGS (TREE_PURPOSE (pat1
));
18543 tree args2
= INNERMOST_TEMPLATE_ARGS (TREE_PURPOSE (pat2
));
18544 int len1
= TREE_VEC_LENGTH (args1
);
18545 int len2
= TREE_VEC_LENGTH (args2
);
18547 /* We don't count the pack expansion at the end. */
18548 if (template_args_variadic_p (TREE_PURPOSE (pat1
)))
18550 if (template_args_variadic_p (TREE_PURPOSE (pat2
)))
18555 else if (len1
< len2
)
18562 /* Return the template arguments that will produce the function signature
18563 DECL from the function template FN, with the explicit template
18564 arguments EXPLICIT_ARGS. If CHECK_RETTYPE is true, the return type must
18565 also match. Return NULL_TREE if no satisfactory arguments could be
18569 get_bindings (tree fn
, tree decl
, tree explicit_args
, bool check_rettype
)
18571 int ntparms
= DECL_NTPARMS (fn
);
18572 tree targs
= make_tree_vec (ntparms
);
18573 tree decl_type
= TREE_TYPE (decl
);
18574 tree decl_arg_types
;
18576 unsigned int nargs
, ix
;
18579 gcc_assert (decl
!= DECL_TEMPLATE_RESULT (fn
));
18581 /* Never do unification on the 'this' parameter. */
18582 decl_arg_types
= skip_artificial_parms_for (decl
,
18583 TYPE_ARG_TYPES (decl_type
));
18585 nargs
= list_length (decl_arg_types
);
18586 args
= XALLOCAVEC (tree
, nargs
);
18587 for (arg
= decl_arg_types
, ix
= 0;
18588 arg
!= NULL_TREE
&& arg
!= void_list_node
;
18589 arg
= TREE_CHAIN (arg
), ++ix
)
18590 args
[ix
] = TREE_VALUE (arg
);
18592 if (fn_type_unification (fn
, explicit_args
, targs
,
18594 (check_rettype
|| DECL_CONV_FN_P (fn
)
18595 ? TREE_TYPE (decl_type
) : NULL_TREE
),
18596 DEDUCE_EXACT
, LOOKUP_NORMAL
, /*explain_p=*/false,
18598 == error_mark_node
)
18604 /* Return the innermost template arguments that, when applied to a partial
18605 specialization of TMPL whose innermost template parameters are
18606 TPARMS, and whose specialization arguments are SPEC_ARGS, yield the
18609 For example, suppose we have:
18611 template <class T, class U> struct S {};
18612 template <class T> struct S<T*, int> {};
18614 Then, suppose we want to get `S<double*, int>'. The TPARMS will be
18615 {T}, the SPEC_ARGS will be {T*, int} and the ARGS will be {double*,
18616 int}. The resulting vector will be {double}, indicating that `T'
18617 is bound to `double'. */
18620 get_class_bindings (tree tmpl
, tree tparms
, tree spec_args
, tree args
)
18622 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
18624 tree innermost_deduced_args
;
18626 innermost_deduced_args
= make_tree_vec (ntparms
);
18627 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
18629 deduced_args
= copy_node (args
);
18630 SET_TMPL_ARGS_LEVEL (deduced_args
,
18631 TMPL_ARGS_DEPTH (deduced_args
),
18632 innermost_deduced_args
);
18635 deduced_args
= innermost_deduced_args
;
18637 if (unify (tparms
, deduced_args
,
18638 INNERMOST_TEMPLATE_ARGS (spec_args
),
18639 INNERMOST_TEMPLATE_ARGS (args
),
18640 UNIFY_ALLOW_NONE
, /*explain_p=*/false))
18643 for (i
= 0; i
< ntparms
; ++i
)
18644 if (! TREE_VEC_ELT (innermost_deduced_args
, i
))
18647 /* Verify that nondeduced template arguments agree with the type
18648 obtained from argument deduction.
18652 struct A { typedef int X; };
18653 template <class T, class U> struct C {};
18654 template <class T> struct C<T, typename T::X> {};
18656 Then with the instantiation `C<A, int>', we can deduce that
18657 `T' is `A' but unify () does not check whether `typename T::X'
18659 spec_args
= tsubst (spec_args
, deduced_args
, tf_none
, NULL_TREE
);
18660 spec_args
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
18662 tf_none
, false, false);
18663 if (spec_args
== error_mark_node
18664 /* We only need to check the innermost arguments; the other
18665 arguments will always agree. */
18666 || !comp_template_args (INNERMOST_TEMPLATE_ARGS (spec_args
),
18667 INNERMOST_TEMPLATE_ARGS (args
)))
18670 /* Now that we have bindings for all of the template arguments,
18671 ensure that the arguments deduced for the template template
18672 parameters have compatible template parameter lists. See the use
18673 of template_template_parm_bindings_ok_p in fn_type_unification
18674 for more information. */
18675 if (!template_template_parm_bindings_ok_p (tparms
, deduced_args
))
18678 return deduced_args
;
18681 /* TEMPLATES is a TREE_LIST. Each TREE_VALUE is a TEMPLATE_DECL.
18682 Return the TREE_LIST node with the most specialized template, if
18683 any. If there is no most specialized template, the error_mark_node
18686 Note that this function does not look at, or modify, the
18687 TREE_PURPOSE or TREE_TYPE of any of the nodes. Since the node
18688 returned is one of the elements of INSTANTIATIONS, callers may
18689 store information in the TREE_PURPOSE or TREE_TYPE of the nodes,
18690 and retrieve it from the value returned. */
18693 most_specialized_instantiation (tree templates
)
18697 ++processing_template_decl
;
18700 for (fn
= TREE_CHAIN (templates
); fn
; fn
= TREE_CHAIN (fn
))
18704 if (get_bindings (TREE_VALUE (champ
),
18705 DECL_TEMPLATE_RESULT (TREE_VALUE (fn
)),
18706 NULL_TREE
, /*check_ret=*/true))
18709 if (get_bindings (TREE_VALUE (fn
),
18710 DECL_TEMPLATE_RESULT (TREE_VALUE (champ
)),
18711 NULL_TREE
, /*check_ret=*/true))
18718 /* Equally specialized, move to next function. If there
18719 is no next function, nothing's most specialized. */
18720 fn
= TREE_CHAIN (fn
);
18728 /* Now verify that champ is better than everything earlier in the
18729 instantiation list. */
18730 for (fn
= templates
; fn
!= champ
; fn
= TREE_CHAIN (fn
))
18731 if (get_bindings (TREE_VALUE (champ
),
18732 DECL_TEMPLATE_RESULT (TREE_VALUE (fn
)),
18733 NULL_TREE
, /*check_ret=*/true)
18734 || !get_bindings (TREE_VALUE (fn
),
18735 DECL_TEMPLATE_RESULT (TREE_VALUE (champ
)),
18736 NULL_TREE
, /*check_ret=*/true))
18742 processing_template_decl
--;
18745 return error_mark_node
;
18750 /* If DECL is a specialization of some template, return the most
18751 general such template. Otherwise, returns NULL_TREE.
18753 For example, given:
18755 template <class T> struct S { template <class U> void f(U); };
18757 if TMPL is `template <class U> void S<int>::f(U)' this will return
18758 the full template. This function will not trace past partial
18759 specializations, however. For example, given in addition:
18761 template <class T> struct S<T*> { template <class U> void f(U); };
18763 if TMPL is `template <class U> void S<int*>::f(U)' this will return
18764 `template <class T> template <class U> S<T*>::f(U)'. */
18767 most_general_template (tree decl
)
18769 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
18771 if (tree tinfo
= get_template_info (decl
))
18772 decl
= TI_TEMPLATE (tinfo
);
18773 /* The TI_TEMPLATE can be an IDENTIFIER_NODE for a
18774 template friend, or a FIELD_DECL for a capture pack. */
18775 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
18779 /* Look for more and more general templates. */
18780 while (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
))
18782 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE in some cases.
18783 (See cp-tree.h for details.) */
18784 if (TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
18787 if (CLASS_TYPE_P (TREE_TYPE (decl
))
18788 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)))
18791 /* Stop if we run into an explicitly specialized class template. */
18792 if (!DECL_NAMESPACE_SCOPE_P (decl
)
18793 && DECL_CONTEXT (decl
)
18794 && CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (decl
)))
18797 decl
= DECL_TI_TEMPLATE (decl
);
18803 /* Return the most specialized of the class template partial
18804 specializations which can produce TYPE, a specialization of some class
18805 template. The value returned is actually a TREE_LIST; the TREE_TYPE is
18806 a _TYPE node corresponding to the partial specialization, while the
18807 TREE_PURPOSE is the set of template arguments that must be
18808 substituted into the TREE_TYPE in order to generate TYPE.
18810 If the choice of partial specialization is ambiguous, a diagnostic
18811 is issued, and the error_mark_node is returned. If there are no
18812 partial specializations matching TYPE, then NULL_TREE is
18813 returned, indicating that the primary template should be used. */
18816 most_specialized_class (tree type
, tsubst_flags_t complain
)
18818 tree list
= NULL_TREE
;
18823 tree outer_args
= NULL_TREE
;
18825 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
18826 tree main_tmpl
= most_general_template (tmpl
);
18827 tree args
= CLASSTYPE_TI_ARGS (type
);
18829 /* For determining which partial specialization to use, only the
18830 innermost args are interesting. */
18831 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
18833 outer_args
= strip_innermost_template_args (args
, 1);
18834 args
= INNERMOST_TEMPLATE_ARGS (args
);
18837 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (main_tmpl
); t
; t
= TREE_CHAIN (t
))
18839 tree partial_spec_args
;
18841 tree spec_tmpl
= TREE_VALUE (t
);
18842 tree orig_parms
= DECL_INNERMOST_TEMPLATE_PARMS (spec_tmpl
);
18844 partial_spec_args
= CLASSTYPE_TI_ARGS (TREE_TYPE (t
));
18846 ++processing_template_decl
;
18850 /* Discard the outer levels of args, and then substitute in the
18851 template args from the enclosing class. */
18852 partial_spec_args
= INNERMOST_TEMPLATE_ARGS (partial_spec_args
);
18853 partial_spec_args
= tsubst_template_args
18854 (partial_spec_args
, outer_args
, tf_none
, NULL_TREE
);
18856 /* And the same for the partial specialization TEMPLATE_DECL. */
18857 spec_tmpl
= tsubst (spec_tmpl
, outer_args
, tf_none
, NULL_TREE
);
18860 partial_spec_args
=
18861 coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
18864 /*require_all_args=*/true,
18865 /*use_default_args=*/true);
18867 --processing_template_decl
;
18869 if (partial_spec_args
== error_mark_node
)
18870 return error_mark_node
;
18871 if (spec_tmpl
== error_mark_node
)
18872 return error_mark_node
;
18874 tree parms
= DECL_INNERMOST_TEMPLATE_PARMS (spec_tmpl
);
18875 spec_args
= get_class_bindings (tmpl
, parms
,
18881 spec_args
= add_to_template_args (outer_args
, spec_args
);
18882 list
= tree_cons (spec_args
, orig_parms
, list
);
18883 TREE_TYPE (list
) = TREE_TYPE (t
);
18890 ambiguous_p
= false;
18893 t
= TREE_CHAIN (t
);
18894 for (; t
; t
= TREE_CHAIN (t
))
18896 fate
= more_specialized_class (tmpl
, champ
, t
);
18903 t
= TREE_CHAIN (t
);
18906 ambiguous_p
= true;
18915 for (t
= list
; t
&& t
!= champ
; t
= TREE_CHAIN (t
))
18917 fate
= more_specialized_class (tmpl
, champ
, t
);
18920 ambiguous_p
= true;
18928 char *spaces
= NULL
;
18929 if (!(complain
& tf_error
))
18930 return error_mark_node
;
18931 error ("ambiguous class template instantiation for %q#T", type
);
18932 str
= ngettext ("candidate is:", "candidates are:", list_length (list
));
18933 for (t
= list
; t
; t
= TREE_CHAIN (t
))
18935 error ("%s %+#T", spaces
? spaces
: str
, TREE_TYPE (t
));
18936 spaces
= spaces
? spaces
: get_spaces (str
);
18939 return error_mark_node
;
18945 /* Explicitly instantiate DECL. */
18948 do_decl_instantiation (tree decl
, tree storage
)
18950 tree result
= NULL_TREE
;
18953 if (!decl
|| decl
== error_mark_node
)
18954 /* An error occurred, for which grokdeclarator has already issued
18955 an appropriate message. */
18957 else if (! DECL_LANG_SPECIFIC (decl
))
18959 error ("explicit instantiation of non-template %q#D", decl
);
18962 else if (VAR_P (decl
))
18964 /* There is an asymmetry here in the way VAR_DECLs and
18965 FUNCTION_DECLs are handled by grokdeclarator. In the case of
18966 the latter, the DECL we get back will be marked as a
18967 template instantiation, and the appropriate
18968 DECL_TEMPLATE_INFO will be set up. This does not happen for
18969 VAR_DECLs so we do the lookup here. Probably, grokdeclarator
18970 should handle VAR_DECLs as it currently handles
18972 if (!DECL_CLASS_SCOPE_P (decl
))
18974 error ("%qD is not a static data member of a class template", decl
);
18977 result
= lookup_field (DECL_CONTEXT (decl
), DECL_NAME (decl
), 0, false);
18978 if (!result
|| !VAR_P (result
))
18980 error ("no matching template for %qD found", decl
);
18983 if (!same_type_p (TREE_TYPE (result
), TREE_TYPE (decl
)))
18985 error ("type %qT for explicit instantiation %qD does not match "
18986 "declared type %qT", TREE_TYPE (result
), decl
,
18991 else if (TREE_CODE (decl
) != FUNCTION_DECL
)
18993 error ("explicit instantiation of %q#D", decl
);
18999 /* Check for various error cases. Note that if the explicit
19000 instantiation is valid the RESULT will currently be marked as an
19001 *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set
19002 until we get here. */
19004 if (DECL_TEMPLATE_SPECIALIZATION (result
))
19006 /* DR 259 [temp.spec].
19008 Both an explicit instantiation and a declaration of an explicit
19009 specialization shall not appear in a program unless the explicit
19010 instantiation follows a declaration of the explicit specialization.
19012 For a given set of template parameters, if an explicit
19013 instantiation of a template appears after a declaration of an
19014 explicit specialization for that template, the explicit
19015 instantiation has no effect. */
19018 else if (DECL_EXPLICIT_INSTANTIATION (result
))
19022 No program shall explicitly instantiate any template more
19025 We check DECL_NOT_REALLY_EXTERN so as not to complain when
19026 the first instantiation was `extern' and the second is not,
19027 and EXTERN_P for the opposite case. */
19028 if (DECL_NOT_REALLY_EXTERN (result
) && !extern_p
)
19029 permerror (input_location
, "duplicate explicit instantiation of %q#D", result
);
19030 /* If an "extern" explicit instantiation follows an ordinary
19031 explicit instantiation, the template is instantiated. */
19035 else if (!DECL_IMPLICIT_INSTANTIATION (result
))
19037 error ("no matching template for %qD found", result
);
19040 else if (!DECL_TEMPLATE_INFO (result
))
19042 permerror (input_location
, "explicit instantiation of non-template %q#D", result
);
19046 if (storage
== NULL_TREE
)
19048 else if (storage
== ridpointers
[(int) RID_EXTERN
])
19050 if (!in_system_header_at (input_location
) && (cxx_dialect
== cxx98
))
19051 pedwarn (input_location
, OPT_Wpedantic
,
19052 "ISO C++ 1998 forbids the use of %<extern%> on explicit "
19057 error ("storage class %qD applied to template instantiation", storage
);
19059 check_explicit_instantiation_namespace (result
);
19060 mark_decl_instantiated (result
, extern_p
);
19062 instantiate_decl (result
, /*defer_ok=*/1,
19063 /*expl_inst_class_mem_p=*/false);
19067 mark_class_instantiated (tree t
, int extern_p
)
19069 SET_CLASSTYPE_EXPLICIT_INSTANTIATION (t
);
19070 SET_CLASSTYPE_INTERFACE_KNOWN (t
);
19071 CLASSTYPE_INTERFACE_ONLY (t
) = extern_p
;
19072 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (t
)) = extern_p
;
19075 CLASSTYPE_DEBUG_REQUESTED (t
) = 1;
19076 rest_of_type_compilation (t
, 1);
19080 /* Called from do_type_instantiation through binding_table_foreach to
19081 do recursive instantiation for the type bound in ENTRY. */
19083 bt_instantiate_type_proc (binding_entry entry
, void *data
)
19085 tree storage
= *(tree
*) data
;
19087 if (MAYBE_CLASS_TYPE_P (entry
->type
)
19088 && !uses_template_parms (CLASSTYPE_TI_ARGS (entry
->type
)))
19089 do_type_instantiation (TYPE_MAIN_DECL (entry
->type
), storage
, 0);
19092 /* Called from do_type_instantiation to instantiate a member
19093 (a member function or a static member variable) of an
19094 explicitly instantiated class template. */
19096 instantiate_class_member (tree decl
, int extern_p
)
19098 mark_decl_instantiated (decl
, extern_p
);
19100 instantiate_decl (decl
, /*defer_ok=*/1,
19101 /*expl_inst_class_mem_p=*/true);
19104 /* Perform an explicit instantiation of template class T. STORAGE, if
19105 non-null, is the RID for extern, inline or static. COMPLAIN is
19106 nonzero if this is called from the parser, zero if called recursively,
19107 since the standard is unclear (as detailed below). */
19110 do_type_instantiation (tree t
, tree storage
, tsubst_flags_t complain
)
19115 int previous_instantiation_extern_p
= 0;
19117 if (TREE_CODE (t
) == TYPE_DECL
)
19120 if (! CLASS_TYPE_P (t
) || ! CLASSTYPE_TEMPLATE_INFO (t
))
19123 (TYPE_TEMPLATE_INFO (t
)) ? TYPE_TI_TEMPLATE (t
) : NULL
;
19125 error ("explicit instantiation of non-class template %qD", tmpl
);
19127 error ("explicit instantiation of non-template type %qT", t
);
19133 if (!COMPLETE_TYPE_P (t
))
19135 if (complain
& tf_error
)
19136 error ("explicit instantiation of %q#T before definition of template",
19141 if (storage
!= NULL_TREE
)
19143 if (!in_system_header_at (input_location
))
19145 if (storage
== ridpointers
[(int) RID_EXTERN
])
19147 if (cxx_dialect
== cxx98
)
19148 pedwarn (input_location
, OPT_Wpedantic
,
19149 "ISO C++ 1998 forbids the use of %<extern%> on "
19150 "explicit instantiations");
19153 pedwarn (input_location
, OPT_Wpedantic
,
19154 "ISO C++ forbids the use of %qE"
19155 " on explicit instantiations", storage
);
19158 if (storage
== ridpointers
[(int) RID_INLINE
])
19160 else if (storage
== ridpointers
[(int) RID_EXTERN
])
19162 else if (storage
== ridpointers
[(int) RID_STATIC
])
19166 error ("storage class %qD applied to template instantiation",
19172 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
19174 /* DR 259 [temp.spec].
19176 Both an explicit instantiation and a declaration of an explicit
19177 specialization shall not appear in a program unless the explicit
19178 instantiation follows a declaration of the explicit specialization.
19180 For a given set of template parameters, if an explicit
19181 instantiation of a template appears after a declaration of an
19182 explicit specialization for that template, the explicit
19183 instantiation has no effect. */
19186 else if (CLASSTYPE_EXPLICIT_INSTANTIATION (t
))
19190 No program shall explicitly instantiate any template more
19193 If PREVIOUS_INSTANTIATION_EXTERN_P, then the first explicit
19194 instantiation was `extern'. If EXTERN_P then the second is.
19195 These cases are OK. */
19196 previous_instantiation_extern_p
= CLASSTYPE_INTERFACE_ONLY (t
);
19198 if (!previous_instantiation_extern_p
&& !extern_p
19199 && (complain
& tf_error
))
19200 permerror (input_location
, "duplicate explicit instantiation of %q#T", t
);
19202 /* If we've already instantiated the template, just return now. */
19203 if (!CLASSTYPE_INTERFACE_ONLY (t
))
19207 check_explicit_instantiation_namespace (TYPE_NAME (t
));
19208 mark_class_instantiated (t
, extern_p
);
19216 /* In contrast to implicit instantiation, where only the
19217 declarations, and not the definitions, of members are
19218 instantiated, we have here:
19222 The explicit instantiation of a class template specialization
19223 implies the instantiation of all of its members not
19224 previously explicitly specialized in the translation unit
19225 containing the explicit instantiation.
19227 Of course, we can't instantiate member template classes, since
19228 we don't have any arguments for them. Note that the standard
19229 is unclear on whether the instantiation of the members are
19230 *explicit* instantiations or not. However, the most natural
19231 interpretation is that it should be an explicit instantiation. */
19234 for (tmp
= TYPE_METHODS (t
); tmp
; tmp
= DECL_CHAIN (tmp
))
19235 if (TREE_CODE (tmp
) == FUNCTION_DECL
19236 && DECL_TEMPLATE_INSTANTIATION (tmp
))
19237 instantiate_class_member (tmp
, extern_p
);
19239 for (tmp
= TYPE_FIELDS (t
); tmp
; tmp
= DECL_CHAIN (tmp
))
19240 if (VAR_P (tmp
) && DECL_TEMPLATE_INSTANTIATION (tmp
))
19241 instantiate_class_member (tmp
, extern_p
);
19243 if (CLASSTYPE_NESTED_UTDS (t
))
19244 binding_table_foreach (CLASSTYPE_NESTED_UTDS (t
),
19245 bt_instantiate_type_proc
, &storage
);
19249 /* Given a function DECL, which is a specialization of TMPL, modify
19250 DECL to be a re-instantiation of TMPL with the same template
19251 arguments. TMPL should be the template into which tsubst'ing
19252 should occur for DECL, not the most general template.
19254 One reason for doing this is a scenario like this:
19257 void f(const T&, int i);
19259 void g() { f(3, 7); }
19262 void f(const T& t, const int i) { }
19264 Note that when the template is first instantiated, with
19265 instantiate_template, the resulting DECL will have no name for the
19266 first parameter, and the wrong type for the second. So, when we go
19267 to instantiate the DECL, we regenerate it. */
19270 regenerate_decl_from_template (tree decl
, tree tmpl
)
19272 /* The arguments used to instantiate DECL, from the most general
19277 args
= DECL_TI_ARGS (decl
);
19278 code_pattern
= DECL_TEMPLATE_RESULT (tmpl
);
19280 /* Make sure that we can see identifiers, and compute access
19282 push_access_scope (decl
);
19284 if (TREE_CODE (decl
) == FUNCTION_DECL
)
19292 args_depth
= TMPL_ARGS_DEPTH (args
);
19293 parms_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
19294 if (args_depth
> parms_depth
)
19295 args
= get_innermost_template_args (args
, parms_depth
);
19297 specs
= tsubst_exception_specification (TREE_TYPE (code_pattern
),
19298 args
, tf_error
, NULL_TREE
,
19299 /*defer_ok*/false);
19300 if (specs
&& specs
!= error_mark_node
)
19301 TREE_TYPE (decl
) = build_exception_variant (TREE_TYPE (decl
),
19304 /* Merge parameter declarations. */
19305 decl_parm
= skip_artificial_parms_for (decl
,
19306 DECL_ARGUMENTS (decl
));
19308 = skip_artificial_parms_for (code_pattern
,
19309 DECL_ARGUMENTS (code_pattern
));
19310 while (decl_parm
&& !DECL_PACK_P (pattern_parm
))
19315 if (DECL_NAME (decl_parm
) != DECL_NAME (pattern_parm
))
19316 DECL_NAME (decl_parm
) = DECL_NAME (pattern_parm
);
19317 parm_type
= tsubst (TREE_TYPE (pattern_parm
), args
, tf_error
,
19319 parm_type
= type_decays_to (parm_type
);
19320 if (!same_type_p (TREE_TYPE (decl_parm
), parm_type
))
19321 TREE_TYPE (decl_parm
) = parm_type
;
19322 attributes
= DECL_ATTRIBUTES (pattern_parm
);
19323 if (DECL_ATTRIBUTES (decl_parm
) != attributes
)
19325 DECL_ATTRIBUTES (decl_parm
) = attributes
;
19326 cplus_decl_attributes (&decl_parm
, attributes
, /*flags=*/0);
19328 decl_parm
= DECL_CHAIN (decl_parm
);
19329 pattern_parm
= DECL_CHAIN (pattern_parm
);
19331 /* Merge any parameters that match with the function parameter
19333 if (pattern_parm
&& DECL_PACK_P (pattern_parm
))
19336 tree expanded_types
;
19337 /* Expand the TYPE_PACK_EXPANSION that provides the types for
19338 the parameters in this function parameter pack. */
19339 expanded_types
= tsubst_pack_expansion (TREE_TYPE (pattern_parm
),
19340 args
, tf_error
, NULL_TREE
);
19341 len
= TREE_VEC_LENGTH (expanded_types
);
19342 for (i
= 0; i
< len
; i
++)
19347 if (DECL_NAME (decl_parm
) != DECL_NAME (pattern_parm
))
19348 /* Rename the parameter to include the index. */
19349 DECL_NAME (decl_parm
) =
19350 make_ith_pack_parameter_name (DECL_NAME (pattern_parm
), i
);
19351 parm_type
= TREE_VEC_ELT (expanded_types
, i
);
19352 parm_type
= type_decays_to (parm_type
);
19353 if (!same_type_p (TREE_TYPE (decl_parm
), parm_type
))
19354 TREE_TYPE (decl_parm
) = parm_type
;
19355 attributes
= DECL_ATTRIBUTES (pattern_parm
);
19356 if (DECL_ATTRIBUTES (decl_parm
) != attributes
)
19358 DECL_ATTRIBUTES (decl_parm
) = attributes
;
19359 cplus_decl_attributes (&decl_parm
, attributes
, /*flags=*/0);
19361 decl_parm
= DECL_CHAIN (decl_parm
);
19364 /* Merge additional specifiers from the CODE_PATTERN. */
19365 if (DECL_DECLARED_INLINE_P (code_pattern
)
19366 && !DECL_DECLARED_INLINE_P (decl
))
19367 DECL_DECLARED_INLINE_P (decl
) = 1;
19369 else if (VAR_P (decl
))
19371 DECL_INITIAL (decl
) =
19372 tsubst_expr (DECL_INITIAL (code_pattern
), args
,
19373 tf_error
, DECL_TI_TEMPLATE (decl
),
19374 /*integral_constant_expression_p=*/false);
19375 if (VAR_HAD_UNKNOWN_BOUND (decl
))
19376 TREE_TYPE (decl
) = tsubst (TREE_TYPE (code_pattern
), args
,
19377 tf_error
, DECL_TI_TEMPLATE (decl
));
19380 gcc_unreachable ();
19382 pop_access_scope (decl
);
19385 /* Return the TEMPLATE_DECL into which DECL_TI_ARGS(DECL) should be
19386 substituted to get DECL. */
19389 template_for_substitution (tree decl
)
19391 tree tmpl
= DECL_TI_TEMPLATE (decl
);
19393 /* Set TMPL to the template whose DECL_TEMPLATE_RESULT is the pattern
19394 for the instantiation. This is not always the most general
19395 template. Consider, for example:
19398 struct S { template <class U> void f();
19399 template <> void f<int>(); };
19401 and an instantiation of S<double>::f<int>. We want TD to be the
19402 specialization S<T>::f<int>, not the more general S<T>::f<U>. */
19403 while (/* An instantiation cannot have a definition, so we need a
19404 more general template. */
19405 DECL_TEMPLATE_INSTANTIATION (tmpl
)
19406 /* We must also deal with friend templates. Given:
19408 template <class T> struct S {
19409 template <class U> friend void f() {};
19412 S<int>::f<U> say, is not an instantiation of S<T>::f<U>,
19413 so far as the language is concerned, but that's still
19414 where we get the pattern for the instantiation from. On
19415 other hand, if the definition comes outside the class, say:
19417 template <class T> struct S {
19418 template <class U> friend void f();
19420 template <class U> friend void f() {}
19422 we don't need to look any further. That's what the check for
19423 DECL_INITIAL is for. */
19424 || (TREE_CODE (decl
) == FUNCTION_DECL
19425 && DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (tmpl
)
19426 && !DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl
))))
19428 /* The present template, TD, should not be a definition. If it
19429 were a definition, we should be using it! Note that we
19430 cannot restructure the loop to just keep going until we find
19431 a template with a definition, since that might go too far if
19432 a specialization was declared, but not defined. */
19433 gcc_assert (!VAR_P (decl
)
19434 || DECL_IN_AGGR_P (DECL_TEMPLATE_RESULT (tmpl
)));
19436 /* Fetch the more general template. */
19437 tmpl
= DECL_TI_TEMPLATE (tmpl
);
19443 /* Returns true if we need to instantiate this template instance even if we
19444 know we aren't going to emit it.. */
19447 always_instantiate_p (tree decl
)
19449 /* We always instantiate inline functions so that we can inline them. An
19450 explicit instantiation declaration prohibits implicit instantiation of
19451 non-inline functions. With high levels of optimization, we would
19452 normally inline non-inline functions -- but we're not allowed to do
19453 that for "extern template" functions. Therefore, we check
19454 DECL_DECLARED_INLINE_P, rather than possibly_inlined_p. */
19455 return ((TREE_CODE (decl
) == FUNCTION_DECL
19456 && (DECL_DECLARED_INLINE_P (decl
)
19457 || type_uses_auto (TREE_TYPE (TREE_TYPE (decl
)))))
19458 /* And we need to instantiate static data members so that
19459 their initializers are available in integral constant
19462 && decl_maybe_constant_var_p (decl
)));
19465 /* If FN has a noexcept-specifier that hasn't been instantiated yet,
19466 instantiate it now, modifying TREE_TYPE (fn). */
19469 maybe_instantiate_noexcept (tree fn
)
19471 tree fntype
, spec
, noex
, clone
;
19473 /* Don't instantiate a noexcept-specification from template context. */
19474 if (processing_template_decl
)
19477 if (DECL_CLONED_FUNCTION_P (fn
))
19478 fn
= DECL_CLONED_FUNCTION (fn
);
19479 fntype
= TREE_TYPE (fn
);
19480 spec
= TYPE_RAISES_EXCEPTIONS (fntype
);
19482 if (!DEFERRED_NOEXCEPT_SPEC_P (spec
))
19485 noex
= TREE_PURPOSE (spec
);
19487 if (TREE_CODE (noex
) == DEFERRED_NOEXCEPT
)
19489 if (push_tinst_level (fn
))
19491 push_access_scope (fn
);
19492 push_deferring_access_checks (dk_no_deferred
);
19493 input_location
= DECL_SOURCE_LOCATION (fn
);
19494 noex
= tsubst_copy_and_build (DEFERRED_NOEXCEPT_PATTERN (noex
),
19495 DEFERRED_NOEXCEPT_ARGS (noex
),
19496 tf_warning_or_error
, fn
,
19497 /*function_p=*/false,
19498 /*integral_constant_expression_p=*/true);
19499 pop_deferring_access_checks ();
19500 pop_access_scope (fn
);
19501 pop_tinst_level ();
19502 spec
= build_noexcept_spec (noex
, tf_warning_or_error
);
19503 if (spec
== error_mark_node
)
19504 spec
= noexcept_false_spec
;
19507 spec
= noexcept_false_spec
;
19511 /* This is an implicitly declared function, so NOEX is a list of
19512 other functions to evaluate and merge. */
19514 spec
= noexcept_true_spec
;
19515 for (elt
= noex
; elt
; elt
= OVL_NEXT (elt
))
19517 tree fn
= OVL_CURRENT (elt
);
19519 maybe_instantiate_noexcept (fn
);
19520 subspec
= TYPE_RAISES_EXCEPTIONS (TREE_TYPE (fn
));
19521 spec
= merge_exception_specifiers (spec
, subspec
, NULL_TREE
);
19525 TREE_TYPE (fn
) = build_exception_variant (fntype
, spec
);
19527 FOR_EACH_CLONE (clone
, fn
)
19529 if (TREE_TYPE (clone
) == fntype
)
19530 TREE_TYPE (clone
) = TREE_TYPE (fn
);
19532 TREE_TYPE (clone
) = build_exception_variant (TREE_TYPE (clone
), spec
);
19536 /* Produce the definition of D, a _DECL generated from a template. If
19537 DEFER_OK is nonzero, then we don't have to actually do the
19538 instantiation now; we just have to do it sometime. Normally it is
19539 an error if this is an explicit instantiation but D is undefined.
19540 EXPL_INST_CLASS_MEM_P is true iff D is a member of an
19541 explicitly instantiated class template. */
19544 instantiate_decl (tree d
, int defer_ok
,
19545 bool expl_inst_class_mem_p
)
19547 tree tmpl
= DECL_TI_TEMPLATE (d
);
19554 bool pattern_defined
;
19555 location_t saved_loc
= input_location
;
19556 int saved_unevaluated_operand
= cp_unevaluated_operand
;
19557 int saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
19562 /* This function should only be used to instantiate templates for
19563 functions and static member variables. */
19564 gcc_assert (VAR_OR_FUNCTION_DECL_P (d
));
19566 /* Variables are never deferred; if instantiation is required, they
19567 are instantiated right away. That allows for better code in the
19568 case that an expression refers to the value of the variable --
19569 if the variable has a constant value the referring expression can
19570 take advantage of that fact. */
19572 || DECL_DECLARED_CONSTEXPR_P (d
))
19575 /* Don't instantiate cloned functions. Instead, instantiate the
19576 functions they cloned. */
19577 if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_CLONED_FUNCTION_P (d
))
19578 d
= DECL_CLONED_FUNCTION (d
);
19580 if (DECL_TEMPLATE_INSTANTIATED (d
)
19581 || (TREE_CODE (d
) == FUNCTION_DECL
19582 && DECL_DEFAULTED_FN (d
) && DECL_INITIAL (d
))
19583 || DECL_TEMPLATE_SPECIALIZATION (d
))
19584 /* D has already been instantiated or explicitly specialized, so
19585 there's nothing for us to do here.
19587 It might seem reasonable to check whether or not D is an explicit
19588 instantiation, and, if so, stop here. But when an explicit
19589 instantiation is deferred until the end of the compilation,
19590 DECL_EXPLICIT_INSTANTIATION is set, even though we still need to do
19591 the instantiation. */
19594 /* Check to see whether we know that this template will be
19595 instantiated in some other file, as with "extern template"
19597 external_p
= (DECL_INTERFACE_KNOWN (d
) && DECL_REALLY_EXTERN (d
));
19599 /* In general, we do not instantiate such templates. */
19600 if (external_p
&& !always_instantiate_p (d
))
19603 gen_tmpl
= most_general_template (tmpl
);
19604 gen_args
= DECL_TI_ARGS (d
);
19606 if (tmpl
!= gen_tmpl
)
19607 /* We should already have the extra args. */
19608 gcc_assert (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (gen_tmpl
))
19609 == TMPL_ARGS_DEPTH (gen_args
));
19610 /* And what's in the hash table should match D. */
19611 gcc_assert ((spec
= retrieve_specialization (gen_tmpl
, gen_args
, 0)) == d
19612 || spec
== NULL_TREE
);
19614 /* This needs to happen before any tsubsting. */
19615 if (! push_tinst_level (d
))
19618 timevar_push (TV_TEMPLATE_INST
);
19620 /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern
19621 for the instantiation. */
19622 td
= template_for_substitution (d
);
19623 code_pattern
= DECL_TEMPLATE_RESULT (td
);
19625 /* We should never be trying to instantiate a member of a class
19626 template or partial specialization. */
19627 gcc_assert (d
!= code_pattern
);
19629 if ((DECL_NAMESPACE_SCOPE_P (d
) && !DECL_INITIALIZED_IN_CLASS_P (d
))
19630 || DECL_TEMPLATE_SPECIALIZATION (td
))
19631 /* In the case of a friend template whose definition is provided
19632 outside the class, we may have too many arguments. Drop the
19633 ones we don't need. The same is true for specializations. */
19634 args
= get_innermost_template_args
19635 (gen_args
, TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (td
)));
19639 if (TREE_CODE (d
) == FUNCTION_DECL
)
19640 pattern_defined
= (DECL_SAVED_TREE (code_pattern
) != NULL_TREE
19641 || DECL_DEFAULTED_OUTSIDE_CLASS_P (code_pattern
));
19643 pattern_defined
= ! DECL_IN_AGGR_P (code_pattern
);
19645 /* We may be in the middle of deferred access check. Disable it now. */
19646 push_deferring_access_checks (dk_no_deferred
);
19648 /* Unless an explicit instantiation directive has already determined
19649 the linkage of D, remember that a definition is available for
19651 if (pattern_defined
19652 && !DECL_INTERFACE_KNOWN (d
)
19653 && !DECL_NOT_REALLY_EXTERN (d
))
19654 mark_definable (d
);
19656 DECL_SOURCE_LOCATION (td
) = DECL_SOURCE_LOCATION (code_pattern
);
19657 DECL_SOURCE_LOCATION (d
) = DECL_SOURCE_LOCATION (code_pattern
);
19658 input_location
= DECL_SOURCE_LOCATION (d
);
19660 /* If D is a member of an explicitly instantiated class template,
19661 and no definition is available, treat it like an implicit
19663 if (!pattern_defined
&& expl_inst_class_mem_p
19664 && DECL_EXPLICIT_INSTANTIATION (d
))
19666 /* Leave linkage flags alone on instantiations with anonymous
19668 if (TREE_PUBLIC (d
))
19670 DECL_NOT_REALLY_EXTERN (d
) = 0;
19671 DECL_INTERFACE_KNOWN (d
) = 0;
19673 SET_DECL_IMPLICIT_INSTANTIATION (d
);
19676 if (TREE_CODE (d
) == FUNCTION_DECL
)
19677 maybe_instantiate_noexcept (d
);
19679 /* Defer all other templates, unless we have been explicitly
19680 forbidden from doing so. */
19681 if (/* If there is no definition, we cannot instantiate the
19684 /* If it's OK to postpone instantiation, do so. */
19686 /* If this is a static data member that will be defined
19687 elsewhere, we don't want to instantiate the entire data
19688 member, but we do want to instantiate the initializer so that
19689 we can substitute that elsewhere. */
19690 || (external_p
&& VAR_P (d
)))
19692 /* The definition of the static data member is now required so
19693 we must substitute the initializer. */
19695 && !DECL_INITIAL (d
)
19696 && DECL_INITIAL (code_pattern
))
19700 bool const_init
= false;
19702 ns
= decl_namespace_context (d
);
19703 push_nested_namespace (ns
);
19704 push_nested_class (DECL_CONTEXT (d
));
19705 init
= tsubst_expr (DECL_INITIAL (code_pattern
),
19707 tf_warning_or_error
, NULL_TREE
,
19708 /*integral_constant_expression_p=*/false);
19709 /* Make sure the initializer is still constant, in case of
19710 circular dependency (template/instantiate6.C). */
19712 = DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (code_pattern
);
19713 cp_finish_decl (d
, init
, /*init_const_expr_p=*/const_init
,
19714 /*asmspec_tree=*/NULL_TREE
,
19715 LOOKUP_ONLYCONVERTING
);
19716 pop_nested_class ();
19717 pop_nested_namespace (ns
);
19720 /* We restore the source position here because it's used by
19721 add_pending_template. */
19722 input_location
= saved_loc
;
19724 if (at_eof
&& !pattern_defined
19725 && DECL_EXPLICIT_INSTANTIATION (d
)
19726 && DECL_NOT_REALLY_EXTERN (d
))
19729 The definition of a non-exported function template, a
19730 non-exported member function template, or a non-exported
19731 member function or static data member of a class template
19732 shall be present in every translation unit in which it is
19733 explicitly instantiated. */
19734 permerror (input_location
, "explicit instantiation of %qD "
19735 "but no definition available", d
);
19737 /* If we're in unevaluated context, we just wanted to get the
19738 constant value; this isn't an odr use, so don't queue
19739 a full instantiation. */
19740 if (cp_unevaluated_operand
!= 0)
19742 /* ??? Historically, we have instantiated inline functions, even
19743 when marked as "extern template". */
19744 if (!(external_p
&& VAR_P (d
)))
19745 add_pending_template (d
);
19748 /* Tell the repository that D is available in this translation unit
19749 -- and see if it is supposed to be instantiated here. */
19750 if (TREE_PUBLIC (d
) && !DECL_REALLY_EXTERN (d
) && !repo_emit_p (d
))
19752 /* In a PCH file, despite the fact that the repository hasn't
19753 requested instantiation in the PCH it is still possible that
19754 an instantiation will be required in a file that includes the
19757 add_pending_template (d
);
19758 /* Instantiate inline functions so that the inliner can do its
19759 job, even though we'll not be emitting a copy of this
19761 if (!(TREE_CODE (d
) == FUNCTION_DECL
&& possibly_inlined_p (d
)))
19765 fn_context
= decl_function_context (d
);
19766 nested
= (current_function_decl
!= NULL_TREE
);
19768 push_to_top_level ();
19772 push_function_context ();
19773 cp_unevaluated_operand
= 0;
19774 c_inhibit_evaluation_warnings
= 0;
19777 /* Mark D as instantiated so that recursive calls to
19778 instantiate_decl do not try to instantiate it again. */
19779 DECL_TEMPLATE_INSTANTIATED (d
) = 1;
19781 /* Regenerate the declaration in case the template has been modified
19782 by a subsequent redeclaration. */
19783 regenerate_decl_from_template (d
, td
);
19785 /* We already set the file and line above. Reset them now in case
19786 they changed as a result of calling regenerate_decl_from_template. */
19787 input_location
= DECL_SOURCE_LOCATION (d
);
19792 bool const_init
= false;
19794 /* Clear out DECL_RTL; whatever was there before may not be right
19795 since we've reset the type of the declaration. */
19796 SET_DECL_RTL (d
, NULL
);
19797 DECL_IN_AGGR_P (d
) = 0;
19799 /* The initializer is placed in DECL_INITIAL by
19800 regenerate_decl_from_template so we don't need to
19801 push/pop_access_scope again here. Pull it out so that
19802 cp_finish_decl can process it. */
19803 init
= DECL_INITIAL (d
);
19804 DECL_INITIAL (d
) = NULL_TREE
;
19805 DECL_INITIALIZED_P (d
) = 0;
19807 /* Clear DECL_EXTERNAL so that cp_finish_decl will process the
19808 initializer. That function will defer actual emission until
19809 we have a chance to determine linkage. */
19810 DECL_EXTERNAL (d
) = 0;
19812 /* Enter the scope of D so that access-checking works correctly. */
19813 push_nested_class (DECL_CONTEXT (d
));
19814 const_init
= DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (code_pattern
);
19815 cp_finish_decl (d
, init
, const_init
, NULL_TREE
, 0);
19816 pop_nested_class ();
19818 else if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_DEFAULTED_FN (code_pattern
))
19819 synthesize_method (d
);
19820 else if (TREE_CODE (d
) == FUNCTION_DECL
)
19822 struct pointer_map_t
*saved_local_specializations
;
19826 tree block
= NULL_TREE
;
19828 /* Save away the current list, in case we are instantiating one
19829 template from within the body of another. */
19830 saved_local_specializations
= local_specializations
;
19832 /* Set up the list of local specializations. */
19833 local_specializations
= pointer_map_create ();
19835 /* Set up context. */
19836 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
)
19837 && TREE_CODE (DECL_CONTEXT (code_pattern
)) == FUNCTION_DECL
)
19838 block
= push_stmt_list ();
19840 start_preparsed_function (d
, NULL_TREE
, SF_PRE_PARSED
);
19842 /* Some typedefs referenced from within the template code need to be
19843 access checked at template instantiation time, i.e now. These
19844 types were added to the template at parsing time. Let's get those
19845 and perform the access checks then. */
19846 perform_typedefs_access_check (DECL_TEMPLATE_RESULT (gen_tmpl
),
19849 /* Create substitution entries for the parameters. */
19850 subst_decl
= DECL_TEMPLATE_RESULT (template_for_substitution (d
));
19851 tmpl_parm
= DECL_ARGUMENTS (subst_decl
);
19852 spec_parm
= DECL_ARGUMENTS (d
);
19853 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (d
))
19855 register_local_specialization (spec_parm
, tmpl_parm
);
19856 spec_parm
= skip_artificial_parms_for (d
, spec_parm
);
19857 tmpl_parm
= skip_artificial_parms_for (subst_decl
, tmpl_parm
);
19859 for (; tmpl_parm
; tmpl_parm
= DECL_CHAIN (tmpl_parm
))
19861 if (!DECL_PACK_P (tmpl_parm
))
19863 register_local_specialization (spec_parm
, tmpl_parm
);
19864 spec_parm
= DECL_CHAIN (spec_parm
);
19868 /* Register the (value) argument pack as a specialization of
19869 TMPL_PARM, then move on. */
19870 tree argpack
= extract_fnparm_pack (tmpl_parm
, &spec_parm
);
19871 register_local_specialization (argpack
, tmpl_parm
);
19874 gcc_assert (!spec_parm
);
19876 /* Substitute into the body of the function. */
19877 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
))
19878 tsubst_omp_udr (DECL_SAVED_TREE (code_pattern
), args
,
19879 tf_warning_or_error
, tmpl
);
19882 tsubst_expr (DECL_SAVED_TREE (code_pattern
), args
,
19883 tf_warning_or_error
, tmpl
,
19884 /*integral_constant_expression_p=*/false);
19886 /* Set the current input_location to the end of the function
19887 so that finish_function knows where we are. */
19889 = DECL_STRUCT_FUNCTION (code_pattern
)->function_end_locus
;
19891 /* Remember if we saw an infinite loop in the template. */
19892 current_function_infinite_loop
19893 = DECL_STRUCT_FUNCTION (code_pattern
)->language
->infinite_loop
;
19896 /* We don't need the local specializations any more. */
19897 pointer_map_destroy (local_specializations
);
19898 local_specializations
= saved_local_specializations
;
19900 /* Finish the function. */
19901 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
)
19902 && TREE_CODE (DECL_CONTEXT (code_pattern
)) == FUNCTION_DECL
)
19903 DECL_SAVED_TREE (d
) = pop_stmt_list (block
);
19906 d
= finish_function (0);
19907 expand_or_defer_fn (d
);
19910 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
))
19911 cp_check_omp_declare_reduction (d
);
19914 /* We're not deferring instantiation any more. */
19915 TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (d
)) = 0;
19918 pop_from_top_level ();
19920 pop_function_context ();
19923 input_location
= saved_loc
;
19924 cp_unevaluated_operand
= saved_unevaluated_operand
;
19925 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
19926 pop_deferring_access_checks ();
19927 pop_tinst_level ();
19929 timevar_pop (TV_TEMPLATE_INST
);
19934 /* Run through the list of templates that we wish we could
19935 instantiate, and instantiate any we can. RETRIES is the
19936 number of times we retry pending template instantiation. */
19939 instantiate_pending_templates (int retries
)
19942 location_t saved_loc
= input_location
;
19944 /* Instantiating templates may trigger vtable generation. This in turn
19945 may require further template instantiations. We place a limit here
19946 to avoid infinite loop. */
19947 if (pending_templates
&& retries
>= max_tinst_depth
)
19949 tree decl
= pending_templates
->tinst
->decl
;
19951 error ("template instantiation depth exceeds maximum of %d"
19952 " instantiating %q+D, possibly from virtual table generation"
19953 " (use -ftemplate-depth= to increase the maximum)",
19954 max_tinst_depth
, decl
);
19955 if (TREE_CODE (decl
) == FUNCTION_DECL
)
19956 /* Pretend that we defined it. */
19957 DECL_INITIAL (decl
) = error_mark_node
;
19963 struct pending_template
**t
= &pending_templates
;
19964 struct pending_template
*last
= NULL
;
19968 tree instantiation
= reopen_tinst_level ((*t
)->tinst
);
19969 bool complete
= false;
19971 if (TYPE_P (instantiation
))
19975 if (!COMPLETE_TYPE_P (instantiation
))
19977 instantiate_class_template (instantiation
);
19978 if (CLASSTYPE_TEMPLATE_INSTANTIATION (instantiation
))
19979 for (fn
= TYPE_METHODS (instantiation
);
19981 fn
= TREE_CHAIN (fn
))
19982 if (! DECL_ARTIFICIAL (fn
))
19983 instantiate_decl (fn
,
19985 /*expl_inst_class_mem_p=*/false);
19986 if (COMPLETE_TYPE_P (instantiation
))
19990 complete
= COMPLETE_TYPE_P (instantiation
);
19994 if (!DECL_TEMPLATE_SPECIALIZATION (instantiation
)
19995 && !DECL_TEMPLATE_INSTANTIATED (instantiation
))
19998 = instantiate_decl (instantiation
,
20000 /*expl_inst_class_mem_p=*/false);
20001 if (DECL_TEMPLATE_INSTANTIATED (instantiation
))
20005 complete
= (DECL_TEMPLATE_SPECIALIZATION (instantiation
)
20006 || DECL_TEMPLATE_INSTANTIATED (instantiation
));
20010 /* If INSTANTIATION has been instantiated, then we don't
20011 need to consider it again in the future. */
20019 current_tinst_level
= NULL
;
20021 last_pending_template
= last
;
20023 while (reconsider
);
20025 input_location
= saved_loc
;
20028 /* Substitute ARGVEC into T, which is a list of initializers for
20029 either base class or a non-static data member. The TREE_PURPOSEs
20030 are DECLs, and the TREE_VALUEs are the initializer values. Used by
20031 instantiate_decl. */
20034 tsubst_initializer_list (tree t
, tree argvec
)
20036 tree inits
= NULL_TREE
;
20038 for (; t
; t
= TREE_CHAIN (t
))
20042 tree expanded_bases
= NULL_TREE
;
20043 tree expanded_arguments
= NULL_TREE
;
20046 if (TREE_CODE (TREE_PURPOSE (t
)) == TYPE_PACK_EXPANSION
)
20051 /* Expand the base class expansion type into separate base
20053 expanded_bases
= tsubst_pack_expansion (TREE_PURPOSE (t
), argvec
,
20054 tf_warning_or_error
,
20056 if (expanded_bases
== error_mark_node
)
20059 /* We'll be building separate TREE_LISTs of arguments for
20061 len
= TREE_VEC_LENGTH (expanded_bases
);
20062 expanded_arguments
= make_tree_vec (len
);
20063 for (i
= 0; i
< len
; i
++)
20064 TREE_VEC_ELT (expanded_arguments
, i
) = NULL_TREE
;
20066 /* Build a dummy EXPR_PACK_EXPANSION that will be used to
20067 expand each argument in the TREE_VALUE of t. */
20068 expr
= make_node (EXPR_PACK_EXPANSION
);
20069 PACK_EXPANSION_LOCAL_P (expr
) = true;
20070 PACK_EXPANSION_PARAMETER_PACKS (expr
) =
20071 PACK_EXPANSION_PARAMETER_PACKS (TREE_PURPOSE (t
));
20073 if (TREE_VALUE (t
) == void_type_node
)
20074 /* VOID_TYPE_NODE is used to indicate
20075 value-initialization. */
20077 for (i
= 0; i
< len
; i
++)
20078 TREE_VEC_ELT (expanded_arguments
, i
) = void_type_node
;
20082 /* Substitute parameter packs into each argument in the
20084 in_base_initializer
= 1;
20085 for (arg
= TREE_VALUE (t
); arg
; arg
= TREE_CHAIN (arg
))
20087 tree expanded_exprs
;
20089 /* Expand the argument. */
20090 SET_PACK_EXPANSION_PATTERN (expr
, TREE_VALUE (arg
));
20092 = tsubst_pack_expansion (expr
, argvec
,
20093 tf_warning_or_error
,
20095 if (expanded_exprs
== error_mark_node
)
20098 /* Prepend each of the expanded expressions to the
20099 corresponding TREE_LIST in EXPANDED_ARGUMENTS. */
20100 for (i
= 0; i
< len
; i
++)
20102 TREE_VEC_ELT (expanded_arguments
, i
) =
20103 tree_cons (NULL_TREE
,
20104 TREE_VEC_ELT (expanded_exprs
, i
),
20105 TREE_VEC_ELT (expanded_arguments
, i
));
20108 in_base_initializer
= 0;
20110 /* Reverse all of the TREE_LISTs in EXPANDED_ARGUMENTS,
20111 since we built them backwards. */
20112 for (i
= 0; i
< len
; i
++)
20114 TREE_VEC_ELT (expanded_arguments
, i
) =
20115 nreverse (TREE_VEC_ELT (expanded_arguments
, i
));
20120 for (i
= 0; i
< len
; ++i
)
20122 if (expanded_bases
)
20124 decl
= TREE_VEC_ELT (expanded_bases
, i
);
20125 decl
= expand_member_init (decl
);
20126 init
= TREE_VEC_ELT (expanded_arguments
, i
);
20131 decl
= tsubst_copy (TREE_PURPOSE (t
), argvec
,
20132 tf_warning_or_error
, NULL_TREE
);
20134 decl
= expand_member_init (decl
);
20135 if (decl
&& !DECL_P (decl
))
20136 in_base_initializer
= 1;
20138 init
= TREE_VALUE (t
);
20140 if (init
!= void_type_node
)
20141 init
= tsubst_expr (init
, argvec
,
20142 tf_warning_or_error
, NULL_TREE
,
20143 /*integral_constant_expression_p=*/false);
20144 if (init
== NULL_TREE
&& tmp
!= NULL_TREE
)
20145 /* If we had an initializer but it instantiated to nothing,
20146 value-initialize the object. This will only occur when
20147 the initializer was a pack expansion where the parameter
20148 packs used in that expansion were of length zero. */
20149 init
= void_type_node
;
20150 in_base_initializer
= 0;
20155 init
= build_tree_list (decl
, init
);
20156 TREE_CHAIN (init
) = inits
;
20164 /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */
20167 set_current_access_from_decl (tree decl
)
20169 if (TREE_PRIVATE (decl
))
20170 current_access_specifier
= access_private_node
;
20171 else if (TREE_PROTECTED (decl
))
20172 current_access_specifier
= access_protected_node
;
20174 current_access_specifier
= access_public_node
;
20177 /* Instantiate an enumerated type. TAG is the template type, NEWTAG
20178 is the instantiation (which should have been created with
20179 start_enum) and ARGS are the template arguments to use. */
20182 tsubst_enum (tree tag
, tree newtag
, tree args
)
20186 if (SCOPED_ENUM_P (newtag
))
20187 begin_scope (sk_scoped_enum
, newtag
);
20189 for (e
= TYPE_VALUES (tag
); e
; e
= TREE_CHAIN (e
))
20194 decl
= TREE_VALUE (e
);
20195 /* Note that in a template enum, the TREE_VALUE is the
20196 CONST_DECL, not the corresponding INTEGER_CST. */
20197 value
= tsubst_expr (DECL_INITIAL (decl
),
20198 args
, tf_warning_or_error
, NULL_TREE
,
20199 /*integral_constant_expression_p=*/true);
20201 /* Give this enumeration constant the correct access. */
20202 set_current_access_from_decl (decl
);
20204 /* Actually build the enumerator itself. */
20206 (DECL_NAME (decl
), value
, newtag
, DECL_SOURCE_LOCATION (decl
));
20209 if (SCOPED_ENUM_P (newtag
))
20212 finish_enum_value_list (newtag
);
20213 finish_enum (newtag
);
20215 DECL_SOURCE_LOCATION (TYPE_NAME (newtag
))
20216 = DECL_SOURCE_LOCATION (TYPE_NAME (tag
));
20219 /* DECL is a FUNCTION_DECL that is a template specialization. Return
20220 its type -- but without substituting the innermost set of template
20221 arguments. So, innermost set of template parameters will appear in
20225 get_mostly_instantiated_function_type (tree decl
)
20233 tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
20234 targs
= DECL_TI_ARGS (decl
);
20235 tparms
= DECL_TEMPLATE_PARMS (tmpl
);
20236 parm_depth
= TMPL_PARMS_DEPTH (tparms
);
20238 /* There should be as many levels of arguments as there are levels
20240 gcc_assert (parm_depth
== TMPL_ARGS_DEPTH (targs
));
20242 fn_type
= TREE_TYPE (tmpl
);
20244 if (parm_depth
== 1)
20245 /* No substitution is necessary. */
20252 /* Replace the innermost level of the TARGS with NULL_TREEs to
20253 let tsubst know not to substitute for those parameters. */
20254 partial_args
= make_tree_vec (TREE_VEC_LENGTH (targs
));
20255 for (i
= 1; i
< TMPL_ARGS_DEPTH (targs
); ++i
)
20256 SET_TMPL_ARGS_LEVEL (partial_args
, i
,
20257 TMPL_ARGS_LEVEL (targs
, i
));
20258 SET_TMPL_ARGS_LEVEL (partial_args
,
20259 TMPL_ARGS_DEPTH (targs
),
20260 make_tree_vec (DECL_NTPARMS (tmpl
)));
20262 /* Make sure that we can see identifiers, and compute access
20264 push_access_scope (decl
);
20266 ++processing_template_decl
;
20267 /* Now, do the (partial) substitution to figure out the
20268 appropriate function type. */
20269 fn_type
= tsubst (fn_type
, partial_args
, tf_error
, NULL_TREE
);
20270 --processing_template_decl
;
20272 /* Substitute into the template parameters to obtain the real
20273 innermost set of parameters. This step is important if the
20274 innermost set of template parameters contains value
20275 parameters whose types depend on outer template parameters. */
20276 TREE_VEC_LENGTH (partial_args
)--;
20277 tparms
= tsubst_template_parms (tparms
, partial_args
, tf_error
);
20279 pop_access_scope (decl
);
20285 /* Return truthvalue if we're processing a template different from
20286 the last one involved in diagnostics. */
20288 problematic_instantiation_changed (void)
20290 return current_tinst_level
!= last_error_tinst_level
;
20293 /* Remember current template involved in diagnostics. */
20295 record_last_problematic_instantiation (void)
20297 last_error_tinst_level
= current_tinst_level
;
20300 struct tinst_level
*
20301 current_instantiation (void)
20303 return current_tinst_level
;
20306 /* [temp.param] Check that template non-type parm TYPE is of an allowable
20307 type. Return zero for ok, nonzero for disallowed. Issue error and
20308 warning messages under control of COMPLAIN. */
20311 invalid_nontype_parm_type_p (tree type
, tsubst_flags_t complain
)
20313 if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
20315 else if (POINTER_TYPE_P (type
))
20317 else if (TYPE_PTRMEM_P (type
))
20319 else if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
)
20321 else if (TREE_CODE (type
) == TYPENAME_TYPE
)
20323 else if (TREE_CODE (type
) == DECLTYPE_TYPE
)
20325 else if (TREE_CODE (type
) == NULLPTR_TYPE
)
20328 if (complain
& tf_error
)
20330 if (type
== error_mark_node
)
20331 inform (input_location
, "invalid template non-type parameter");
20333 error ("%q#T is not a valid type for a template non-type parameter",
20339 /* Returns TRUE if TYPE is dependent, in the sense of [temp.dep.type].
20340 Assumes that TYPE really is a type, and not the ERROR_MARK_NODE.*/
20343 dependent_type_p_r (tree type
)
20349 A type is dependent if it is:
20351 -- a template parameter. Template template parameters are types
20352 for us (since TYPE_P holds true for them) so we handle
20354 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
20355 || TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
)
20357 /* -- a qualified-id with a nested-name-specifier which contains a
20358 class-name that names a dependent type or whose unqualified-id
20359 names a dependent type. */
20360 if (TREE_CODE (type
) == TYPENAME_TYPE
)
20362 /* -- a cv-qualified type where the cv-unqualified type is
20364 type
= TYPE_MAIN_VARIANT (type
);
20365 /* -- a compound type constructed from any dependent type. */
20366 if (TYPE_PTRMEM_P (type
))
20367 return (dependent_type_p (TYPE_PTRMEM_CLASS_TYPE (type
))
20368 || dependent_type_p (TYPE_PTRMEM_POINTED_TO_TYPE
20370 else if (TYPE_PTR_P (type
)
20371 || TREE_CODE (type
) == REFERENCE_TYPE
)
20372 return dependent_type_p (TREE_TYPE (type
));
20373 else if (TREE_CODE (type
) == FUNCTION_TYPE
20374 || TREE_CODE (type
) == METHOD_TYPE
)
20378 if (dependent_type_p (TREE_TYPE (type
)))
20380 for (arg_type
= TYPE_ARG_TYPES (type
);
20382 arg_type
= TREE_CHAIN (arg_type
))
20383 if (dependent_type_p (TREE_VALUE (arg_type
)))
20387 /* -- an array type constructed from any dependent type or whose
20388 size is specified by a constant expression that is
20391 We checked for type- and value-dependence of the bounds in
20392 compute_array_index_type, so TYPE_DEPENDENT_P is already set. */
20393 if (TREE_CODE (type
) == ARRAY_TYPE
)
20395 if (TYPE_DOMAIN (type
)
20396 && dependent_type_p (TYPE_DOMAIN (type
)))
20398 return dependent_type_p (TREE_TYPE (type
));
20401 /* -- a template-id in which either the template name is a template
20403 if (TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
20405 /* ... or any of the template arguments is a dependent type or
20406 an expression that is type-dependent or value-dependent. */
20407 else if (CLASS_TYPE_P (type
) && CLASSTYPE_TEMPLATE_INFO (type
)
20408 && (any_dependent_template_arguments_p
20409 (INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type
)))))
20412 /* All TYPEOF_TYPEs, DECLTYPE_TYPEs, and UNDERLYING_TYPEs are
20413 dependent; if the argument of the `typeof' expression is not
20414 type-dependent, then it should already been have resolved. */
20415 if (TREE_CODE (type
) == TYPEOF_TYPE
20416 || TREE_CODE (type
) == DECLTYPE_TYPE
20417 || TREE_CODE (type
) == UNDERLYING_TYPE
)
20420 /* A template argument pack is dependent if any of its packed
20422 if (TREE_CODE (type
) == TYPE_ARGUMENT_PACK
)
20424 tree args
= ARGUMENT_PACK_ARGS (type
);
20425 int i
, len
= TREE_VEC_LENGTH (args
);
20426 for (i
= 0; i
< len
; ++i
)
20427 if (dependent_template_arg_p (TREE_VEC_ELT (args
, i
)))
20431 /* All TYPE_PACK_EXPANSIONs are dependent, because parameter packs must
20432 be template parameters. */
20433 if (TREE_CODE (type
) == TYPE_PACK_EXPANSION
)
20436 /* The standard does not specifically mention types that are local
20437 to template functions or local classes, but they should be
20438 considered dependent too. For example:
20440 template <int I> void f() {
20445 The size of `E' cannot be known until the value of `I' has been
20446 determined. Therefore, `E' must be considered dependent. */
20447 scope
= TYPE_CONTEXT (type
);
20448 if (scope
&& TYPE_P (scope
))
20449 return dependent_type_p (scope
);
20450 /* Don't use type_dependent_expression_p here, as it can lead
20451 to infinite recursion trying to determine whether a lambda
20452 nested in a lambda is dependent (c++/47687). */
20453 else if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
20454 && DECL_LANG_SPECIFIC (scope
)
20455 && DECL_TEMPLATE_INFO (scope
)
20456 && (any_dependent_template_arguments_p
20457 (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (scope
)))))
20460 /* Other types are non-dependent. */
20464 /* Returns TRUE if TYPE is dependent, in the sense of
20465 [temp.dep.type]. Note that a NULL type is considered dependent. */
20468 dependent_type_p (tree type
)
20470 /* If there are no template parameters in scope, then there can't be
20471 any dependent types. */
20472 if (!processing_template_decl
)
20474 /* If we are not processing a template, then nobody should be
20475 providing us with a dependent type. */
20477 gcc_assert (TREE_CODE (type
) != TEMPLATE_TYPE_PARM
|| is_auto (type
));
20481 /* If the type is NULL, we have not computed a type for the entity
20482 in question; in that case, the type is dependent. */
20486 /* Erroneous types can be considered non-dependent. */
20487 if (type
== error_mark_node
)
20490 /* If we have not already computed the appropriate value for TYPE,
20492 if (!TYPE_DEPENDENT_P_VALID (type
))
20494 TYPE_DEPENDENT_P (type
) = dependent_type_p_r (type
);
20495 TYPE_DEPENDENT_P_VALID (type
) = 1;
20498 return TYPE_DEPENDENT_P (type
);
20501 /* Returns TRUE if SCOPE is a dependent scope, in which we can't do any
20502 lookup. In other words, a dependent type that is not the current
20506 dependent_scope_p (tree scope
)
20508 return (scope
&& TYPE_P (scope
) && dependent_type_p (scope
)
20509 && !currently_open_class (scope
));
20512 /* T is a SCOPE_REF; return whether we need to consider it
20513 instantiation-dependent so that we can check access at instantiation
20514 time even though we know which member it resolves to. */
20517 instantiation_dependent_scope_ref_p (tree t
)
20519 if (DECL_P (TREE_OPERAND (t
, 1))
20520 && CLASS_TYPE_P (TREE_OPERAND (t
, 0))
20521 && accessible_in_template_p (TREE_OPERAND (t
, 0),
20522 TREE_OPERAND (t
, 1)))
20528 /* Returns TRUE if the EXPRESSION is value-dependent, in the sense of
20529 [temp.dep.constexpr]. EXPRESSION is already known to be a constant
20532 /* Note that this predicate is not appropriate for general expressions;
20533 only constant expressions (that satisfy potential_constant_expression)
20534 can be tested for value dependence. */
20537 value_dependent_expression_p (tree expression
)
20539 if (!processing_template_decl
)
20542 /* A name declared with a dependent type. */
20543 if (DECL_P (expression
) && type_dependent_expression_p (expression
))
20546 switch (TREE_CODE (expression
))
20548 case IDENTIFIER_NODE
:
20549 /* A name that has not been looked up -- must be dependent. */
20552 case TEMPLATE_PARM_INDEX
:
20553 /* A non-type template parm. */
20557 /* A non-type template parm. */
20558 if (DECL_TEMPLATE_PARM_P (expression
))
20560 return value_dependent_expression_p (DECL_INITIAL (expression
));
20563 /* A constant with literal type and is initialized
20564 with an expression that is value-dependent.
20566 Note that a non-dependent parenthesized initializer will have
20567 already been replaced with its constant value, so if we see
20568 a TREE_LIST it must be dependent. */
20569 if (DECL_INITIAL (expression
)
20570 && decl_constant_var_p (expression
)
20571 && (TREE_CODE (DECL_INITIAL (expression
)) == TREE_LIST
20572 || value_dependent_expression_p (DECL_INITIAL (expression
))))
20576 case DYNAMIC_CAST_EXPR
:
20577 case STATIC_CAST_EXPR
:
20578 case CONST_CAST_EXPR
:
20579 case REINTERPRET_CAST_EXPR
:
20581 /* These expressions are value-dependent if the type to which
20582 the cast occurs is dependent or the expression being casted
20583 is value-dependent. */
20585 tree type
= TREE_TYPE (expression
);
20587 if (dependent_type_p (type
))
20590 /* A functional cast has a list of operands. */
20591 expression
= TREE_OPERAND (expression
, 0);
20594 /* If there are no operands, it must be an expression such
20595 as "int()". This should not happen for aggregate types
20596 because it would form non-constant expressions. */
20597 gcc_assert (cxx_dialect
>= cxx11
20598 || INTEGRAL_OR_ENUMERATION_TYPE_P (type
));
20603 if (TREE_CODE (expression
) == TREE_LIST
)
20604 return any_value_dependent_elements_p (expression
);
20606 return value_dependent_expression_p (expression
);
20610 if (SIZEOF_EXPR_TYPE_P (expression
))
20611 return dependent_type_p (TREE_TYPE (TREE_OPERAND (expression
, 0)));
20615 /* A `sizeof' expression is value-dependent if the operand is
20616 type-dependent or is a pack expansion. */
20617 expression
= TREE_OPERAND (expression
, 0);
20618 if (PACK_EXPANSION_P (expression
))
20620 else if (TYPE_P (expression
))
20621 return dependent_type_p (expression
);
20622 return instantiation_dependent_expression_p (expression
);
20624 case AT_ENCODE_EXPR
:
20625 /* An 'encode' expression is value-dependent if the operand is
20627 expression
= TREE_OPERAND (expression
, 0);
20628 return dependent_type_p (expression
);
20630 case NOEXCEPT_EXPR
:
20631 expression
= TREE_OPERAND (expression
, 0);
20632 return instantiation_dependent_expression_p (expression
);
20635 /* All instantiation-dependent expressions should also be considered
20636 value-dependent. */
20637 return instantiation_dependent_scope_ref_p (expression
);
20639 case COMPONENT_REF
:
20640 return (value_dependent_expression_p (TREE_OPERAND (expression
, 0))
20641 || value_dependent_expression_p (TREE_OPERAND (expression
, 1)));
20643 case NONTYPE_ARGUMENT_PACK
:
20644 /* A NONTYPE_ARGUMENT_PACK is value-dependent if any packed argument
20645 is value-dependent. */
20647 tree values
= ARGUMENT_PACK_ARGS (expression
);
20648 int i
, len
= TREE_VEC_LENGTH (values
);
20650 for (i
= 0; i
< len
; ++i
)
20651 if (value_dependent_expression_p (TREE_VEC_ELT (values
, i
)))
20659 tree type2
= TRAIT_EXPR_TYPE2 (expression
);
20660 return (dependent_type_p (TRAIT_EXPR_TYPE1 (expression
))
20661 || (type2
? dependent_type_p (type2
) : false));
20665 return ((value_dependent_expression_p (TREE_OPERAND (expression
, 0)))
20666 || (value_dependent_expression_p (TREE_OPERAND (expression
, 2))));
20669 return ((value_dependent_expression_p (TREE_OPERAND (expression
, 0)))
20670 || (value_dependent_expression_p (TREE_OPERAND (expression
, 1))));
20674 tree op
= TREE_OPERAND (expression
, 0);
20675 return (value_dependent_expression_p (op
)
20676 || has_value_dependent_address (op
));
20681 tree fn
= get_callee_fndecl (expression
);
20683 if (!fn
&& value_dependent_expression_p (CALL_EXPR_FN (expression
)))
20685 nargs
= call_expr_nargs (expression
);
20686 for (i
= 0; i
< nargs
; ++i
)
20688 tree op
= CALL_EXPR_ARG (expression
, i
);
20689 /* In a call to a constexpr member function, look through the
20690 implicit ADDR_EXPR on the object argument so that it doesn't
20691 cause the call to be considered value-dependent. We also
20692 look through it in potential_constant_expression. */
20693 if (i
== 0 && fn
&& DECL_DECLARED_CONSTEXPR_P (fn
)
20694 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
20695 && TREE_CODE (op
) == ADDR_EXPR
)
20696 op
= TREE_OPERAND (op
, 0);
20697 if (value_dependent_expression_p (op
))
20703 case TEMPLATE_ID_EXPR
:
20704 /* If a TEMPLATE_ID_EXPR involves a dependent name, it will be
20706 return type_dependent_expression_p (expression
);
20712 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expression
), ix
, val
)
20713 if (value_dependent_expression_p (val
))
20719 /* Treat a GNU statement expression as dependent to avoid crashing
20720 under fold_non_dependent_expr; it can't be constant. */
20724 /* A constant expression is value-dependent if any subexpression is
20725 value-dependent. */
20726 switch (TREE_CODE_CLASS (TREE_CODE (expression
)))
20728 case tcc_reference
:
20730 case tcc_comparison
:
20732 case tcc_expression
:
20735 int i
, len
= cp_tree_operand_length (expression
);
20737 for (i
= 0; i
< len
; i
++)
20739 tree t
= TREE_OPERAND (expression
, i
);
20741 /* In some cases, some of the operands may be missing.l
20742 (For example, in the case of PREDECREMENT_EXPR, the
20743 amount to increment by may be missing.) That doesn't
20744 make the expression dependent. */
20745 if (t
&& value_dependent_expression_p (t
))
20756 /* The expression is not value-dependent. */
20760 /* Returns TRUE if the EXPRESSION is type-dependent, in the sense of
20761 [temp.dep.expr]. Note that an expression with no type is
20762 considered dependent. Other parts of the compiler arrange for an
20763 expression with type-dependent subexpressions to have no type, so
20764 this function doesn't have to be fully recursive. */
20767 type_dependent_expression_p (tree expression
)
20769 if (!processing_template_decl
)
20772 if (expression
== NULL_TREE
|| expression
== error_mark_node
)
20775 /* An unresolved name is always dependent. */
20776 if (identifier_p (expression
) || TREE_CODE (expression
) == USING_DECL
)
20779 /* Some expression forms are never type-dependent. */
20780 if (TREE_CODE (expression
) == PSEUDO_DTOR_EXPR
20781 || TREE_CODE (expression
) == SIZEOF_EXPR
20782 || TREE_CODE (expression
) == ALIGNOF_EXPR
20783 || TREE_CODE (expression
) == AT_ENCODE_EXPR
20784 || TREE_CODE (expression
) == NOEXCEPT_EXPR
20785 || TREE_CODE (expression
) == TRAIT_EXPR
20786 || TREE_CODE (expression
) == TYPEID_EXPR
20787 || TREE_CODE (expression
) == DELETE_EXPR
20788 || TREE_CODE (expression
) == VEC_DELETE_EXPR
20789 || TREE_CODE (expression
) == THROW_EXPR
)
20792 /* The types of these expressions depends only on the type to which
20793 the cast occurs. */
20794 if (TREE_CODE (expression
) == DYNAMIC_CAST_EXPR
20795 || TREE_CODE (expression
) == STATIC_CAST_EXPR
20796 || TREE_CODE (expression
) == CONST_CAST_EXPR
20797 || TREE_CODE (expression
) == REINTERPRET_CAST_EXPR
20798 || TREE_CODE (expression
) == IMPLICIT_CONV_EXPR
20799 || TREE_CODE (expression
) == CAST_EXPR
)
20800 return dependent_type_p (TREE_TYPE (expression
));
20802 /* The types of these expressions depends only on the type created
20803 by the expression. */
20804 if (TREE_CODE (expression
) == NEW_EXPR
20805 || TREE_CODE (expression
) == VEC_NEW_EXPR
)
20807 /* For NEW_EXPR tree nodes created inside a template, either
20808 the object type itself or a TREE_LIST may appear as the
20810 tree type
= TREE_OPERAND (expression
, 1);
20811 if (TREE_CODE (type
) == TREE_LIST
)
20812 /* This is an array type. We need to check array dimensions
20814 return dependent_type_p (TREE_VALUE (TREE_PURPOSE (type
)))
20815 || value_dependent_expression_p
20816 (TREE_OPERAND (TREE_VALUE (type
), 1));
20818 return dependent_type_p (type
);
20821 if (TREE_CODE (expression
) == SCOPE_REF
)
20823 tree scope
= TREE_OPERAND (expression
, 0);
20824 tree name
= TREE_OPERAND (expression
, 1);
20826 /* 14.6.2.2 [temp.dep.expr]: An id-expression is type-dependent if it
20827 contains an identifier associated by name lookup with one or more
20828 declarations declared with a dependent type, or...a
20829 nested-name-specifier or qualified-id that names a member of an
20830 unknown specialization. */
20831 return (type_dependent_expression_p (name
)
20832 || dependent_scope_p (scope
));
20835 if (TREE_CODE (expression
) == FUNCTION_DECL
20836 && DECL_LANG_SPECIFIC (expression
)
20837 && DECL_TEMPLATE_INFO (expression
)
20838 && (any_dependent_template_arguments_p
20839 (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (expression
)))))
20842 if (TREE_CODE (expression
) == TEMPLATE_DECL
20843 && !DECL_TEMPLATE_TEMPLATE_PARM_P (expression
))
20846 if (TREE_CODE (expression
) == STMT_EXPR
)
20847 expression
= stmt_expr_value_expr (expression
);
20849 if (BRACE_ENCLOSED_INITIALIZER_P (expression
))
20854 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expression
), i
, elt
)
20856 if (type_dependent_expression_p (elt
))
20862 /* A static data member of the current instantiation with incomplete
20863 array type is type-dependent, as the definition and specializations
20864 can have different bounds. */
20865 if (VAR_P (expression
)
20866 && DECL_CLASS_SCOPE_P (expression
)
20867 && dependent_type_p (DECL_CONTEXT (expression
))
20868 && VAR_HAD_UNKNOWN_BOUND (expression
))
20871 /* An array of unknown bound depending on a variadic parameter, eg:
20873 template<typename... Args>
20874 void foo (Args... args)
20876 int arr[] = { args... };
20879 template<int... vals>
20882 int arr[] = { vals... };
20885 If the array has no length and has an initializer, it must be that
20886 we couldn't determine its length in cp_complete_array_type because
20887 it is dependent. */
20888 if (VAR_P (expression
)
20889 && TREE_CODE (TREE_TYPE (expression
)) == ARRAY_TYPE
20890 && !TYPE_DOMAIN (TREE_TYPE (expression
))
20891 && DECL_INITIAL (expression
))
20894 if (TREE_TYPE (expression
) == unknown_type_node
)
20896 if (TREE_CODE (expression
) == ADDR_EXPR
)
20897 return type_dependent_expression_p (TREE_OPERAND (expression
, 0));
20898 if (TREE_CODE (expression
) == COMPONENT_REF
20899 || TREE_CODE (expression
) == OFFSET_REF
)
20901 if (type_dependent_expression_p (TREE_OPERAND (expression
, 0)))
20903 expression
= TREE_OPERAND (expression
, 1);
20904 if (identifier_p (expression
))
20907 /* SCOPE_REF with non-null TREE_TYPE is always non-dependent. */
20908 if (TREE_CODE (expression
) == SCOPE_REF
)
20911 /* Always dependent, on the number of arguments if nothing else. */
20912 if (TREE_CODE (expression
) == EXPR_PACK_EXPANSION
)
20915 if (BASELINK_P (expression
))
20916 expression
= BASELINK_FUNCTIONS (expression
);
20918 if (TREE_CODE (expression
) == TEMPLATE_ID_EXPR
)
20920 if (any_dependent_template_arguments_p
20921 (TREE_OPERAND (expression
, 1)))
20923 expression
= TREE_OPERAND (expression
, 0);
20925 gcc_assert (TREE_CODE (expression
) == OVERLOAD
20926 || TREE_CODE (expression
) == FUNCTION_DECL
);
20930 if (type_dependent_expression_p (OVL_CURRENT (expression
)))
20932 expression
= OVL_NEXT (expression
);
20937 gcc_assert (TREE_CODE (expression
) != TYPE_DECL
);
20939 return (dependent_type_p (TREE_TYPE (expression
)));
20942 /* walk_tree callback function for instantiation_dependent_expression_p,
20943 below. Returns non-zero if a dependent subexpression is found. */
20946 instantiation_dependent_r (tree
*tp
, int *walk_subtrees
,
20951 /* We don't have to worry about decltype currently because decltype
20952 of an instantiation-dependent expr is a dependent type. This
20953 might change depending on the resolution of DR 1172. */
20954 *walk_subtrees
= false;
20957 enum tree_code code
= TREE_CODE (*tp
);
20960 /* Don't treat an argument list as dependent just because it has no
20968 /* A constant with a dependent initializer is dependent. */
20969 if (value_dependent_expression_p (*tp
))
20973 case TEMPLATE_PARM_INDEX
:
20976 /* Handle expressions with type operands. */
20980 case AT_ENCODE_EXPR
:
20982 tree op
= TREE_OPERAND (*tp
, 0);
20983 if (code
== SIZEOF_EXPR
&& SIZEOF_EXPR_TYPE_P (*tp
))
20984 op
= TREE_TYPE (op
);
20987 if (dependent_type_p (op
))
20991 *walk_subtrees
= false;
20999 if (dependent_type_p (TRAIT_EXPR_TYPE1 (*tp
))
21000 || (TRAIT_EXPR_TYPE2 (*tp
)
21001 && dependent_type_p (TRAIT_EXPR_TYPE2 (*tp
))))
21003 *walk_subtrees
= false;
21006 case COMPONENT_REF
:
21007 if (identifier_p (TREE_OPERAND (*tp
, 1)))
21008 /* In a template, finish_class_member_access_expr creates a
21009 COMPONENT_REF with an IDENTIFIER_NODE for op1 even if it isn't
21010 type-dependent, so that we can check access control at
21011 instantiation time (PR 42277). See also Core issue 1273. */
21016 if (instantiation_dependent_scope_ref_p (*tp
))
21021 /* Treat statement-expressions as dependent. */
21029 if (type_dependent_expression_p (*tp
))
21035 /* Returns TRUE if the EXPRESSION is instantiation-dependent, in the
21036 sense defined by the ABI:
21038 "An expression is instantiation-dependent if it is type-dependent
21039 or value-dependent, or it has a subexpression that is type-dependent
21040 or value-dependent." */
21043 instantiation_dependent_expression_p (tree expression
)
21047 if (!processing_template_decl
)
21050 if (expression
== error_mark_node
)
21053 result
= cp_walk_tree_without_duplicates (&expression
,
21054 instantiation_dependent_r
, NULL
);
21055 return result
!= NULL_TREE
;
21058 /* Like type_dependent_expression_p, but it also works while not processing
21059 a template definition, i.e. during substitution or mangling. */
21062 type_dependent_expression_p_push (tree expr
)
21065 ++processing_template_decl
;
21066 b
= type_dependent_expression_p (expr
);
21067 --processing_template_decl
;
21071 /* Returns TRUE if ARGS contains a type-dependent expression. */
21074 any_type_dependent_arguments_p (const vec
<tree
, va_gc
> *args
)
21079 FOR_EACH_VEC_SAFE_ELT (args
, i
, arg
)
21081 if (type_dependent_expression_p (arg
))
21087 /* Returns TRUE if LIST (a TREE_LIST whose TREE_VALUEs are
21088 expressions) contains any type-dependent expressions. */
21091 any_type_dependent_elements_p (const_tree list
)
21093 for (; list
; list
= TREE_CHAIN (list
))
21094 if (type_dependent_expression_p (TREE_VALUE (list
)))
21100 /* Returns TRUE if LIST (a TREE_LIST whose TREE_VALUEs are
21101 expressions) contains any value-dependent expressions. */
21104 any_value_dependent_elements_p (const_tree list
)
21106 for (; list
; list
= TREE_CHAIN (list
))
21107 if (value_dependent_expression_p (TREE_VALUE (list
)))
21113 /* Returns TRUE if the ARG (a template argument) is dependent. */
21116 dependent_template_arg_p (tree arg
)
21118 if (!processing_template_decl
)
21121 /* Assume a template argument that was wrongly written by the user
21122 is dependent. This is consistent with what
21123 any_dependent_template_arguments_p [that calls this function]
21125 if (!arg
|| arg
== error_mark_node
)
21128 if (TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
21129 arg
= ARGUMENT_PACK_SELECT_ARG (arg
);
21131 if (TREE_CODE (arg
) == TEMPLATE_DECL
21132 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
21133 return dependent_template_p (arg
);
21134 else if (ARGUMENT_PACK_P (arg
))
21136 tree args
= ARGUMENT_PACK_ARGS (arg
);
21137 int i
, len
= TREE_VEC_LENGTH (args
);
21138 for (i
= 0; i
< len
; ++i
)
21140 if (dependent_template_arg_p (TREE_VEC_ELT (args
, i
)))
21146 else if (TYPE_P (arg
))
21147 return dependent_type_p (arg
);
21149 return (type_dependent_expression_p (arg
)
21150 || value_dependent_expression_p (arg
));
21153 /* Returns true if ARGS (a collection of template arguments) contains
21154 any types that require structural equality testing. */
21157 any_template_arguments_need_structural_equality_p (tree args
)
21164 if (args
== error_mark_node
)
21167 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
21169 tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
21170 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
21172 tree arg
= TREE_VEC_ELT (level
, j
);
21173 tree packed_args
= NULL_TREE
;
21176 if (ARGUMENT_PACK_P (arg
))
21178 /* Look inside the argument pack. */
21179 packed_args
= ARGUMENT_PACK_ARGS (arg
);
21180 len
= TREE_VEC_LENGTH (packed_args
);
21183 for (k
= 0; k
< len
; ++k
)
21186 arg
= TREE_VEC_ELT (packed_args
, k
);
21188 if (error_operand_p (arg
))
21190 else if (TREE_CODE (arg
) == TEMPLATE_DECL
)
21192 else if (TYPE_P (arg
) && TYPE_STRUCTURAL_EQUALITY_P (arg
))
21194 else if (!TYPE_P (arg
) && TREE_TYPE (arg
)
21195 && TYPE_STRUCTURAL_EQUALITY_P (TREE_TYPE (arg
)))
21204 /* Returns true if ARGS (a collection of template arguments) contains
21205 any dependent arguments. */
21208 any_dependent_template_arguments_p (const_tree args
)
21215 if (args
== error_mark_node
)
21218 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
21220 const_tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
21221 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
21222 if (dependent_template_arg_p (TREE_VEC_ELT (level
, j
)))
21229 /* Returns TRUE if the template TMPL is dependent. */
21232 dependent_template_p (tree tmpl
)
21234 if (TREE_CODE (tmpl
) == OVERLOAD
)
21238 if (dependent_template_p (OVL_CURRENT (tmpl
)))
21240 tmpl
= OVL_NEXT (tmpl
);
21245 /* Template template parameters are dependent. */
21246 if (DECL_TEMPLATE_TEMPLATE_PARM_P (tmpl
)
21247 || TREE_CODE (tmpl
) == TEMPLATE_TEMPLATE_PARM
)
21249 /* So are names that have not been looked up. */
21250 if (TREE_CODE (tmpl
) == SCOPE_REF
|| identifier_p (tmpl
))
21252 /* So are member templates of dependent classes. */
21253 if (TYPE_P (CP_DECL_CONTEXT (tmpl
)))
21254 return dependent_type_p (DECL_CONTEXT (tmpl
));
21258 /* Returns TRUE if the specialization TMPL<ARGS> is dependent. */
21261 dependent_template_id_p (tree tmpl
, tree args
)
21263 return (dependent_template_p (tmpl
)
21264 || any_dependent_template_arguments_p (args
));
21267 /* Returns TRUE if OMP_FOR with DECLV, INITV, CONDV and INCRV vectors
21271 dependent_omp_for_p (tree declv
, tree initv
, tree condv
, tree incrv
)
21275 if (!processing_template_decl
)
21278 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
21280 tree decl
= TREE_VEC_ELT (declv
, i
);
21281 tree init
= TREE_VEC_ELT (initv
, i
);
21282 tree cond
= TREE_VEC_ELT (condv
, i
);
21283 tree incr
= TREE_VEC_ELT (incrv
, i
);
21285 if (type_dependent_expression_p (decl
))
21288 if (init
&& type_dependent_expression_p (init
))
21291 if (type_dependent_expression_p (cond
))
21294 if (COMPARISON_CLASS_P (cond
)
21295 && (type_dependent_expression_p (TREE_OPERAND (cond
, 0))
21296 || type_dependent_expression_p (TREE_OPERAND (cond
, 1))))
21299 if (TREE_CODE (incr
) == MODOP_EXPR
)
21301 if (type_dependent_expression_p (TREE_OPERAND (incr
, 0))
21302 || type_dependent_expression_p (TREE_OPERAND (incr
, 2)))
21305 else if (type_dependent_expression_p (incr
))
21307 else if (TREE_CODE (incr
) == MODIFY_EXPR
)
21309 if (type_dependent_expression_p (TREE_OPERAND (incr
, 0)))
21311 else if (BINARY_CLASS_P (TREE_OPERAND (incr
, 1)))
21313 tree t
= TREE_OPERAND (incr
, 1);
21314 if (type_dependent_expression_p (TREE_OPERAND (t
, 0))
21315 || type_dependent_expression_p (TREE_OPERAND (t
, 1)))
21324 /* TYPE is a TYPENAME_TYPE. Returns the ordinary TYPE to which the
21325 TYPENAME_TYPE corresponds. Returns the original TYPENAME_TYPE if
21326 no such TYPE can be found. Note that this function peers inside
21327 uninstantiated templates and therefore should be used only in
21328 extremely limited situations. ONLY_CURRENT_P restricts this
21329 peering to the currently open classes hierarchy (which is required
21330 when comparing types). */
21333 resolve_typename_type (tree type
, bool only_current_p
)
21342 gcc_assert (TREE_CODE (type
) == TYPENAME_TYPE
);
21344 scope
= TYPE_CONTEXT (type
);
21345 /* Usually the non-qualified identifier of a TYPENAME_TYPE is
21346 TYPE_IDENTIFIER (type). But when 'type' is a typedef variant of
21347 a TYPENAME_TYPE node, then TYPE_NAME (type) is set to the TYPE_DECL representing
21348 the typedef. In that case TYPE_IDENTIFIER (type) is not the non-qualified
21349 identifier of the TYPENAME_TYPE anymore.
21350 So by getting the TYPE_IDENTIFIER of the _main declaration_ of the
21351 TYPENAME_TYPE instead, we avoid messing up with a possible
21352 typedef variant case. */
21353 name
= TYPE_IDENTIFIER (TYPE_MAIN_VARIANT (type
));
21355 /* If the SCOPE is itself a TYPENAME_TYPE, then we need to resolve
21356 it first before we can figure out what NAME refers to. */
21357 if (TREE_CODE (scope
) == TYPENAME_TYPE
)
21359 if (TYPENAME_IS_RESOLVING_P (scope
))
21360 /* Given a class template A with a dependent base with nested type C,
21361 typedef typename A::C::C C will land us here, as trying to resolve
21362 the initial A::C leads to the local C typedef, which leads back to
21363 A::C::C. So we break the recursion now. */
21366 scope
= resolve_typename_type (scope
, only_current_p
);
21368 /* If we don't know what SCOPE refers to, then we cannot resolve the
21370 if (TREE_CODE (scope
) == TYPENAME_TYPE
)
21372 /* If the SCOPE is a template type parameter, we have no way of
21373 resolving the name. */
21374 if (TREE_CODE (scope
) == TEMPLATE_TYPE_PARM
)
21376 /* If the SCOPE is not the current instantiation, there's no reason
21377 to look inside it. */
21378 if (only_current_p
&& !currently_open_class (scope
))
21380 /* If this is a typedef, we don't want to look inside (c++/11987). */
21381 if (typedef_variant_p (type
))
21383 /* If SCOPE isn't the template itself, it will not have a valid
21384 TYPE_FIELDS list. */
21385 if (same_type_p (scope
, CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope
)))
21386 /* scope is either the template itself or a compatible instantiation
21387 like X<T>, so look up the name in the original template. */
21388 scope
= CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope
);
21390 /* scope is a partial instantiation, so we can't do the lookup or we
21391 will lose the template arguments. */
21393 /* Enter the SCOPE so that name lookup will be resolved as if we
21394 were in the class definition. In particular, SCOPE will no
21395 longer be considered a dependent type. */
21396 pushed_scope
= push_scope (scope
);
21397 /* Look up the declaration. */
21398 decl
= lookup_member (scope
, name
, /*protect=*/0, /*want_type=*/true,
21399 tf_warning_or_error
);
21401 result
= NULL_TREE
;
21403 /* For a TYPENAME_TYPE like "typename X::template Y<T>", we want to
21404 find a TEMPLATE_DECL. Otherwise, we want to find a TYPE_DECL. */
21407 else if (identifier_p (TYPENAME_TYPE_FULLNAME (type
))
21408 && TREE_CODE (decl
) == TYPE_DECL
)
21410 result
= TREE_TYPE (decl
);
21411 if (result
== error_mark_node
)
21412 result
= NULL_TREE
;
21414 else if (TREE_CODE (TYPENAME_TYPE_FULLNAME (type
)) == TEMPLATE_ID_EXPR
21415 && DECL_CLASS_TEMPLATE_P (decl
))
21419 /* Obtain the template and the arguments. */
21420 tmpl
= TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type
), 0);
21421 args
= TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type
), 1);
21422 /* Instantiate the template. */
21423 result
= lookup_template_class (tmpl
, args
, NULL_TREE
, NULL_TREE
,
21424 /*entering_scope=*/0,
21425 tf_error
| tf_user
);
21426 if (result
== error_mark_node
)
21427 result
= NULL_TREE
;
21430 /* Leave the SCOPE. */
21432 pop_scope (pushed_scope
);
21434 /* If we failed to resolve it, return the original typename. */
21438 /* If lookup found a typename type, resolve that too. */
21439 if (TREE_CODE (result
) == TYPENAME_TYPE
&& !TYPENAME_IS_RESOLVING_P (result
))
21441 /* Ill-formed programs can cause infinite recursion here, so we
21442 must catch that. */
21443 TYPENAME_IS_RESOLVING_P (type
) = 1;
21444 result
= resolve_typename_type (result
, only_current_p
);
21445 TYPENAME_IS_RESOLVING_P (type
) = 0;
21448 /* Qualify the resulting type. */
21449 quals
= cp_type_quals (type
);
21451 result
= cp_build_qualified_type (result
, cp_type_quals (result
) | quals
);
21456 /* EXPR is an expression which is not type-dependent. Return a proxy
21457 for EXPR that can be used to compute the types of larger
21458 expressions containing EXPR. */
21461 build_non_dependent_expr (tree expr
)
21465 #ifdef ENABLE_CHECKING
21466 /* Try to get a constant value for all non-dependent expressions in
21467 order to expose bugs in *_dependent_expression_p and constexpr. */
21468 if (cxx_dialect
>= cxx11
)
21469 maybe_constant_value (fold_non_dependent_expr_sfinae (expr
, tf_none
));
21472 /* Preserve OVERLOADs; the functions must be available to resolve
21475 if (TREE_CODE (inner_expr
) == STMT_EXPR
)
21476 inner_expr
= stmt_expr_value_expr (inner_expr
);
21477 if (TREE_CODE (inner_expr
) == ADDR_EXPR
)
21478 inner_expr
= TREE_OPERAND (inner_expr
, 0);
21479 if (TREE_CODE (inner_expr
) == COMPONENT_REF
)
21480 inner_expr
= TREE_OPERAND (inner_expr
, 1);
21481 if (is_overloaded_fn (inner_expr
)
21482 || TREE_CODE (inner_expr
) == OFFSET_REF
)
21484 /* There is no need to return a proxy for a variable. */
21487 /* Preserve string constants; conversions from string constants to
21488 "char *" are allowed, even though normally a "const char *"
21489 cannot be used to initialize a "char *". */
21490 if (TREE_CODE (expr
) == STRING_CST
)
21492 /* Preserve arithmetic constants, as an optimization -- there is no
21493 reason to create a new node. */
21494 if (TREE_CODE (expr
) == INTEGER_CST
|| TREE_CODE (expr
) == REAL_CST
)
21496 /* Preserve THROW_EXPRs -- all throw-expressions have type "void".
21497 There is at least one place where we want to know that a
21498 particular expression is a throw-expression: when checking a ?:
21499 expression, there are special rules if the second or third
21500 argument is a throw-expression. */
21501 if (TREE_CODE (expr
) == THROW_EXPR
)
21504 /* Don't wrap an initializer list, we need to be able to look inside. */
21505 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
21508 /* Don't wrap a dummy object, we need to be able to test for it. */
21509 if (is_dummy_object (expr
))
21512 if (TREE_CODE (expr
) == COND_EXPR
)
21513 return build3 (COND_EXPR
,
21515 TREE_OPERAND (expr
, 0),
21516 (TREE_OPERAND (expr
, 1)
21517 ? build_non_dependent_expr (TREE_OPERAND (expr
, 1))
21518 : build_non_dependent_expr (TREE_OPERAND (expr
, 0))),
21519 build_non_dependent_expr (TREE_OPERAND (expr
, 2)));
21520 if (TREE_CODE (expr
) == COMPOUND_EXPR
21521 && !COMPOUND_EXPR_OVERLOADED (expr
))
21522 return build2 (COMPOUND_EXPR
,
21524 TREE_OPERAND (expr
, 0),
21525 build_non_dependent_expr (TREE_OPERAND (expr
, 1)));
21527 /* If the type is unknown, it can't really be non-dependent */
21528 gcc_assert (TREE_TYPE (expr
) != unknown_type_node
);
21530 /* Otherwise, build a NON_DEPENDENT_EXPR. */
21531 return build1 (NON_DEPENDENT_EXPR
, TREE_TYPE (expr
), expr
);
21534 /* ARGS is a vector of expressions as arguments to a function call.
21535 Replace the arguments with equivalent non-dependent expressions.
21536 This modifies ARGS in place. */
21539 make_args_non_dependent (vec
<tree
, va_gc
> *args
)
21544 FOR_EACH_VEC_SAFE_ELT (args
, ix
, arg
)
21546 tree newarg
= build_non_dependent_expr (arg
);
21548 (*args
)[ix
] = newarg
;
21552 /* Returns a type which represents 'auto' or 'decltype(auto)'. We use a
21553 TEMPLATE_TYPE_PARM with a level one deeper than the actual template
21557 make_auto_1 (tree name
)
21559 tree au
= cxx_make_type (TEMPLATE_TYPE_PARM
);
21560 TYPE_NAME (au
) = build_decl (input_location
,
21561 TYPE_DECL
, name
, au
);
21562 TYPE_STUB_DECL (au
) = TYPE_NAME (au
);
21563 TEMPLATE_TYPE_PARM_INDEX (au
) = build_template_parm_index
21564 (0, processing_template_decl
+ 1, processing_template_decl
+ 1,
21565 TYPE_NAME (au
), NULL_TREE
);
21566 TYPE_CANONICAL (au
) = canonical_type_parameter (au
);
21567 DECL_ARTIFICIAL (TYPE_NAME (au
)) = 1;
21568 SET_DECL_TEMPLATE_PARM_P (TYPE_NAME (au
));
21574 make_decltype_auto (void)
21576 return make_auto_1 (get_identifier ("decltype(auto)"));
21582 return make_auto_1 (get_identifier ("auto"));
21585 /* Given type ARG, return std::initializer_list<ARG>. */
21590 tree std_init_list
= namespace_binding
21591 (get_identifier ("initializer_list"), std_node
);
21593 if (!std_init_list
|| !DECL_CLASS_TEMPLATE_P (std_init_list
))
21595 error ("deducing from brace-enclosed initializer list requires "
21596 "#include <initializer_list>");
21597 return error_mark_node
;
21599 argvec
= make_tree_vec (1);
21600 TREE_VEC_ELT (argvec
, 0) = arg
;
21601 return lookup_template_class (std_init_list
, argvec
, NULL_TREE
,
21602 NULL_TREE
, 0, tf_warning_or_error
);
21605 /* Replace auto in TYPE with std::initializer_list<auto>. */
21608 listify_autos (tree type
, tree auto_node
)
21610 tree init_auto
= listify (auto_node
);
21611 tree argvec
= make_tree_vec (1);
21612 TREE_VEC_ELT (argvec
, 0) = init_auto
;
21613 if (processing_template_decl
)
21614 argvec
= add_to_template_args (current_template_args (), argvec
);
21615 return tsubst (type
, argvec
, tf_warning_or_error
, NULL_TREE
);
21618 /* Replace occurrences of 'auto' in TYPE with the appropriate type deduced
21619 from INIT. AUTO_NODE is the TEMPLATE_TYPE_PARM used for 'auto' in TYPE. */
21622 do_auto_deduction (tree type
, tree init
, tree auto_node
)
21626 if (init
== error_mark_node
)
21627 return error_mark_node
;
21629 if (type_dependent_expression_p (init
))
21630 /* Defining a subset of type-dependent expressions that we can deduce
21631 from ahead of time isn't worth the trouble. */
21634 /* [dcl.spec.auto]: Obtain P from T by replacing the occurrences of auto
21635 with either a new invented type template parameter U or, if the
21636 initializer is a braced-init-list (8.5.4), with
21637 std::initializer_list<U>. */
21638 if (BRACE_ENCLOSED_INITIALIZER_P (init
))
21639 type
= listify_autos (type
, auto_node
);
21641 init
= resolve_nondeduced_context (init
);
21643 targs
= make_tree_vec (1);
21644 if (AUTO_IS_DECLTYPE (auto_node
))
21646 bool id
= (DECL_P (init
) || (TREE_CODE (init
) == COMPONENT_REF
21647 && !REF_PARENTHESIZED_P (init
)));
21648 TREE_VEC_ELT (targs
, 0)
21649 = finish_decltype_type (init
, id
, tf_warning_or_error
);
21650 if (type
!= auto_node
)
21652 error ("%qT as type rather than plain %<decltype(auto)%>", type
);
21653 return error_mark_node
;
21658 tree parms
= build_tree_list (NULL_TREE
, type
);
21659 tree tparms
= make_tree_vec (1);
21662 TREE_VEC_ELT (tparms
, 0)
21663 = build_tree_list (NULL_TREE
, TYPE_NAME (auto_node
));
21664 val
= type_unification_real (tparms
, targs
, parms
, &init
, 1, 0,
21665 DEDUCE_CALL
, LOOKUP_NORMAL
,
21666 NULL
, /*explain_p=*/false);
21669 if (processing_template_decl
)
21670 /* Try again at instantiation time. */
21672 if (type
&& type
!= error_mark_node
)
21673 /* If type is error_mark_node a diagnostic must have been
21674 emitted by now. Also, having a mention to '<type error>'
21675 in the diagnostic is not really useful to the user. */
21677 if (cfun
&& auto_node
== current_function_auto_return_pattern
21678 && LAMBDA_FUNCTION_P (current_function_decl
))
21679 error ("unable to deduce lambda return type from %qE", init
);
21681 error ("unable to deduce %qT from %qE", type
, init
);
21683 return error_mark_node
;
21687 /* If the list of declarators contains more than one declarator, the type
21688 of each declared variable is determined as described above. If the
21689 type deduced for the template parameter U is not the same in each
21690 deduction, the program is ill-formed. */
21691 if (TREE_TYPE (auto_node
)
21692 && !same_type_p (TREE_TYPE (auto_node
), TREE_VEC_ELT (targs
, 0)))
21694 if (cfun
&& auto_node
== current_function_auto_return_pattern
21695 && LAMBDA_FUNCTION_P (current_function_decl
))
21696 error ("inconsistent types %qT and %qT deduced for "
21697 "lambda return type", TREE_TYPE (auto_node
),
21698 TREE_VEC_ELT (targs
, 0));
21700 error ("inconsistent deduction for %qT: %qT and then %qT",
21701 auto_node
, TREE_TYPE (auto_node
), TREE_VEC_ELT (targs
, 0));
21702 return error_mark_node
;
21704 TREE_TYPE (auto_node
) = TREE_VEC_ELT (targs
, 0);
21706 if (processing_template_decl
)
21707 targs
= add_to_template_args (current_template_args (), targs
);
21708 return tsubst (type
, targs
, tf_warning_or_error
, NULL_TREE
);
21711 /* Substitutes LATE_RETURN_TYPE for 'auto' in TYPE and returns the
21715 splice_late_return_type (tree type
, tree late_return_type
)
21719 if (late_return_type
== NULL_TREE
)
21721 argvec
= make_tree_vec (1);
21722 TREE_VEC_ELT (argvec
, 0) = late_return_type
;
21723 if (processing_template_parmlist
)
21724 /* For a late-specified return type in a template type-parameter, we
21725 need to add a dummy argument level for its parmlist. */
21726 argvec
= add_to_template_args
21727 (make_tree_vec (processing_template_parmlist
), argvec
);
21728 if (current_template_parms
)
21729 argvec
= add_to_template_args (current_template_args (), argvec
);
21730 return tsubst (type
, argvec
, tf_warning_or_error
, NULL_TREE
);
21733 /* Returns true iff TYPE is a TEMPLATE_TYPE_PARM representing 'auto' or
21734 'decltype(auto)'. */
21737 is_auto (const_tree type
)
21739 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
21740 && (TYPE_IDENTIFIER (type
) == get_identifier ("auto")
21741 || TYPE_IDENTIFIER (type
) == get_identifier ("decltype(auto)")))
21747 /* Returns the TEMPLATE_TYPE_PARM in TYPE representing `auto' iff TYPE contains
21748 a use of `auto'. Returns NULL_TREE otherwise. */
21751 type_uses_auto (tree type
)
21753 return find_type_usage (type
, is_auto
);
21756 /* Returns true iff TYPE is a TEMPLATE_TYPE_PARM representing 'auto',
21757 'decltype(auto)' or a concept. */
21760 is_auto_or_concept (const_tree type
)
21762 return is_auto (type
); // or concept
21765 /* Returns the TEMPLATE_TYPE_PARM in TYPE representing a generic type (`auto' or
21766 a concept identifier) iff TYPE contains a use of a generic type. Returns
21767 NULL_TREE otherwise. */
21770 type_uses_auto_or_concept (tree type
)
21772 return find_type_usage (type
, is_auto_or_concept
);
21776 /* For a given template T, return the vector of typedefs referenced
21777 in T for which access check is needed at T instantiation time.
21778 T is either a FUNCTION_DECL or a RECORD_TYPE.
21779 Those typedefs were added to T by the function
21780 append_type_to_template_for_access_check. */
21782 vec
<qualified_typedef_usage_t
, va_gc
> *
21783 get_types_needing_access_check (tree t
)
21786 vec
<qualified_typedef_usage_t
, va_gc
> *result
= NULL
;
21788 if (!t
|| t
== error_mark_node
)
21791 if (!(ti
= get_template_info (t
)))
21794 if (CLASS_TYPE_P (t
)
21795 || TREE_CODE (t
) == FUNCTION_DECL
)
21797 if (!TI_TEMPLATE (ti
))
21800 result
= TI_TYPEDEFS_NEEDING_ACCESS_CHECKING (ti
);
21806 /* Append the typedef TYPE_DECL used in template T to a list of typedefs
21807 tied to T. That list of typedefs will be access checked at
21808 T instantiation time.
21809 T is either a FUNCTION_DECL or a RECORD_TYPE.
21810 TYPE_DECL is a TYPE_DECL node representing a typedef.
21811 SCOPE is the scope through which TYPE_DECL is accessed.
21812 LOCATION is the location of the usage point of TYPE_DECL.
21814 This function is a subroutine of
21815 append_type_to_template_for_access_check. */
21818 append_type_to_template_for_access_check_1 (tree t
,
21821 location_t location
)
21823 qualified_typedef_usage_t typedef_usage
;
21826 if (!t
|| t
== error_mark_node
)
21829 gcc_assert ((TREE_CODE (t
) == FUNCTION_DECL
21830 || CLASS_TYPE_P (t
))
21832 && TREE_CODE (type_decl
) == TYPE_DECL
21835 if (!(ti
= get_template_info (t
)))
21838 gcc_assert (TI_TEMPLATE (ti
));
21840 typedef_usage
.typedef_decl
= type_decl
;
21841 typedef_usage
.context
= scope
;
21842 typedef_usage
.locus
= location
;
21844 vec_safe_push (TI_TYPEDEFS_NEEDING_ACCESS_CHECKING (ti
), typedef_usage
);
21847 /* Append TYPE_DECL to the template TEMPL.
21848 TEMPL is either a class type, a FUNCTION_DECL or a a TEMPLATE_DECL.
21849 At TEMPL instanciation time, TYPE_DECL will be checked to see
21850 if it can be accessed through SCOPE.
21851 LOCATION is the location of the usage point of TYPE_DECL.
21853 e.g. consider the following code snippet:
21860 template<class U> struct S
21862 C::myint mi; // <-- usage point of the typedef C::myint
21867 At S<char> instantiation time, we need to check the access of C::myint
21868 In other words, we need to check the access of the myint typedef through
21869 the C scope. For that purpose, this function will add the myint typedef
21870 and the scope C through which its being accessed to a list of typedefs
21871 tied to the template S. That list will be walked at template instantiation
21872 time and access check performed on each typedefs it contains.
21873 Note that this particular code snippet should yield an error because
21874 myint is private to C. */
21877 append_type_to_template_for_access_check (tree templ
,
21880 location_t location
)
21882 qualified_typedef_usage_t
*iter
;
21885 gcc_assert (type_decl
&& (TREE_CODE (type_decl
) == TYPE_DECL
));
21887 /* Make sure we don't append the type to the template twice. */
21888 FOR_EACH_VEC_SAFE_ELT (get_types_needing_access_check (templ
), i
, iter
)
21889 if (iter
->typedef_decl
== type_decl
&& scope
== iter
->context
)
21892 append_type_to_template_for_access_check_1 (templ
, type_decl
,
21896 /* Convert the generic type parameters in PARM that match the types given in the
21897 range [START_IDX, END_IDX) from the current_template_parms into generic type
21901 convert_generic_types_to_packs (tree parm
, int start_idx
, int end_idx
)
21903 tree current
= current_template_parms
;
21904 int depth
= TMPL_PARMS_DEPTH (current
);
21905 current
= INNERMOST_TEMPLATE_PARMS (current
);
21906 tree replacement
= make_tree_vec (TREE_VEC_LENGTH (current
));
21908 for (int i
= 0; i
< start_idx
; ++i
)
21909 TREE_VEC_ELT (replacement
, i
)
21910 = TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (current
, i
)));
21912 for (int i
= start_idx
; i
< end_idx
; ++i
)
21914 /* Create a distinct parameter pack type from the current parm and add it
21915 to the replacement args to tsubst below into the generic function
21918 tree o
= TREE_TYPE (TREE_VALUE
21919 (TREE_VEC_ELT (current
, i
)));
21920 tree t
= copy_type (o
);
21921 TEMPLATE_TYPE_PARM_INDEX (t
)
21922 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (o
),
21924 TREE_TYPE (TEMPLATE_TYPE_DECL (t
)) = t
;
21925 TYPE_STUB_DECL (t
) = TYPE_NAME (t
) = TEMPLATE_TYPE_DECL (t
);
21926 TYPE_MAIN_VARIANT (t
) = t
;
21927 TEMPLATE_TYPE_PARAMETER_PACK (t
) = true;
21928 TYPE_CANONICAL (t
) = canonical_type_parameter (t
);
21929 TREE_VEC_ELT (replacement
, i
) = t
;
21930 TREE_VALUE (TREE_VEC_ELT (current
, i
)) = TREE_CHAIN (t
);
21933 for (int i
= end_idx
, e
= TREE_VEC_LENGTH (current
); i
< e
; ++i
)
21934 TREE_VEC_ELT (replacement
, i
)
21935 = TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (current
, i
)));
21937 /* If there are more levels then build up the replacement with the outer
21940 replacement
= add_to_template_args (template_parms_to_args
21941 (TREE_CHAIN (current_template_parms
)),
21944 return tsubst (parm
, replacement
, tf_none
, NULL_TREE
);
21948 /* Set up the hash tables for template instantiations. */
21951 init_template_processing (void)
21953 decl_specializations
= htab_create_ggc (37,
21954 hash_specialization
,
21955 eq_specializations
,
21957 type_specializations
= htab_create_ggc (37,
21958 hash_specialization
,
21959 eq_specializations
,
21963 /* Print stats about the template hash tables for -fstats. */
21966 print_template_statistics (void)
21968 fprintf (stderr
, "decl_specializations: size %ld, %ld elements, "
21969 "%f collisions\n", (long) htab_size (decl_specializations
),
21970 (long) htab_elements (decl_specializations
),
21971 htab_collisions (decl_specializations
));
21972 fprintf (stderr
, "type_specializations: size %ld, %ld elements, "
21973 "%f collisions\n", (long) htab_size (type_specializations
),
21974 (long) htab_elements (type_specializations
),
21975 htab_collisions (type_specializations
));
21978 #include "gt-cp-pt.h"