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"
39 #include "c-family/c-common.h"
40 #include "c-family/c-objc.h"
41 #include "cp-objcp-common.h"
42 #include "tree-inline.h"
46 #include "tree-iterator.h"
47 #include "type-utils.h"
50 /* The type of functions taking a tree, and some additional data, and
52 typedef int (*tree_fn_t
) (tree
, void*);
54 /* The PENDING_TEMPLATES is a TREE_LIST of templates whose
55 instantiations have been deferred, either because their definitions
56 were not yet available, or because we were putting off doing the work. */
57 struct GTY ((chain_next ("%h.next"))) pending_template
{
58 struct pending_template
*next
;
59 struct tinst_level
*tinst
;
62 static GTY(()) struct pending_template
*pending_templates
;
63 static GTY(()) struct pending_template
*last_pending_template
;
65 int processing_template_parmlist
;
66 static int template_header_count
;
68 static GTY(()) tree saved_trees
;
69 static vec
<int> inline_parm_levels
;
71 static GTY(()) struct tinst_level
*current_tinst_level
;
73 static GTY(()) tree saved_access_scope
;
75 /* Live only within one (recursive) call to tsubst_expr. We use
76 this to pass the statement expression node from the STMT_EXPR
77 to the EXPR_STMT that is its result. */
78 static tree cur_stmt_expr
;
80 /* True if we've recursed into fn_type_unification too many times. */
81 static bool excessive_deduction_depth
;
83 typedef struct GTY(()) spec_entry
90 static GTY ((param_is (spec_entry
)))
91 htab_t decl_specializations
;
93 static GTY ((param_is (spec_entry
)))
94 htab_t type_specializations
;
96 /* Contains canonical template parameter types. The vector is indexed by
97 the TEMPLATE_TYPE_IDX of the template parameter. Each element is a
98 TREE_LIST, whose TREE_VALUEs contain the canonical template
99 parameters of various types and levels. */
100 static GTY(()) vec
<tree
, va_gc
> *canonical_template_parms
;
102 #define UNIFY_ALLOW_NONE 0
103 #define UNIFY_ALLOW_MORE_CV_QUAL 1
104 #define UNIFY_ALLOW_LESS_CV_QUAL 2
105 #define UNIFY_ALLOW_DERIVED 4
106 #define UNIFY_ALLOW_INTEGER 8
107 #define UNIFY_ALLOW_OUTER_LEVEL 16
108 #define UNIFY_ALLOW_OUTER_MORE_CV_QUAL 32
109 #define UNIFY_ALLOW_OUTER_LESS_CV_QUAL 64
111 enum template_base_result
{
113 tbr_ambiguous_baseclass
,
117 static void push_access_scope (tree
);
118 static void pop_access_scope (tree
);
119 static bool resolve_overloaded_unification (tree
, tree
, tree
, tree
,
120 unification_kind_t
, int,
122 static int try_one_overload (tree
, tree
, tree
, tree
, tree
,
123 unification_kind_t
, int, bool, bool);
124 static int unify (tree
, tree
, tree
, tree
, int, bool);
125 static void add_pending_template (tree
);
126 static tree
reopen_tinst_level (struct tinst_level
*);
127 static tree
tsubst_initializer_list (tree
, tree
);
128 static tree
get_class_bindings (tree
, tree
, tree
, tree
);
129 static tree
coerce_template_parms (tree
, tree
, tree
, tsubst_flags_t
,
131 static tree
coerce_innermost_template_parms (tree
, tree
, tree
, tsubst_flags_t
,
133 static void tsubst_enum (tree
, tree
, tree
);
134 static tree
add_to_template_args (tree
, tree
);
135 static tree
add_outermost_template_args (tree
, tree
);
136 static bool check_instantiated_args (tree
, tree
, tsubst_flags_t
);
137 static int maybe_adjust_types_for_deduction (unification_kind_t
, tree
*, tree
*,
139 static int type_unification_real (tree
, tree
, tree
, const tree
*,
140 unsigned int, int, unification_kind_t
, int,
141 vec
<deferred_access_check
, va_gc
> **,
143 static void note_template_header (int);
144 static tree
convert_nontype_argument_function (tree
, tree
, tsubst_flags_t
);
145 static tree
convert_nontype_argument (tree
, tree
, tsubst_flags_t
);
146 static tree
convert_template_argument (tree
, tree
, tree
,
147 tsubst_flags_t
, int, tree
);
148 static int for_each_template_parm (tree
, tree_fn_t
, void*,
149 hash_set
<tree
> *, bool);
150 static tree
expand_template_argument_pack (tree
);
151 static tree
build_template_parm_index (int, int, int, tree
, tree
);
152 static bool inline_needs_template_parms (tree
, bool);
153 static void push_inline_template_parms_recursive (tree
, int);
154 static tree
retrieve_local_specialization (tree
);
155 static void register_local_specialization (tree
, tree
);
156 static hashval_t
hash_specialization (const void *p
);
157 static tree
reduce_template_parm_level (tree
, tree
, int, tree
, tsubst_flags_t
);
158 static int mark_template_parm (tree
, void *);
159 static int template_parm_this_level_p (tree
, void *);
160 static tree
tsubst_friend_function (tree
, tree
);
161 static tree
tsubst_friend_class (tree
, tree
);
162 static int can_complete_type_without_circularity (tree
);
163 static tree
get_bindings (tree
, tree
, tree
, bool);
164 static int template_decl_level (tree
);
165 static int check_cv_quals_for_unify (int, tree
, tree
);
166 static void template_parm_level_and_index (tree
, int*, int*);
167 static int unify_pack_expansion (tree
, tree
, tree
,
168 tree
, unification_kind_t
, bool, bool);
169 static tree
tsubst_template_arg (tree
, tree
, tsubst_flags_t
, tree
);
170 static tree
tsubst_template_args (tree
, tree
, tsubst_flags_t
, tree
);
171 static tree
tsubst_template_parms (tree
, tree
, tsubst_flags_t
);
172 static void regenerate_decl_from_template (tree
, tree
);
173 static tree
most_specialized_class (tree
, tsubst_flags_t
);
174 static tree
tsubst_aggr_type (tree
, tree
, tsubst_flags_t
, tree
, int);
175 static tree
tsubst_arg_types (tree
, tree
, tree
, tsubst_flags_t
, tree
);
176 static tree
tsubst_function_type (tree
, tree
, tsubst_flags_t
, tree
);
177 static bool check_specialization_scope (void);
178 static tree
process_partial_specialization (tree
);
179 static void set_current_access_from_decl (tree
);
180 static enum template_base_result
get_template_base (tree
, tree
, tree
, tree
,
182 static tree
try_class_unification (tree
, tree
, tree
, tree
, bool);
183 static int coerce_template_template_parms (tree
, tree
, tsubst_flags_t
,
185 static bool template_template_parm_bindings_ok_p (tree
, tree
);
186 static int template_args_equal (tree
, tree
);
187 static void tsubst_default_arguments (tree
, tsubst_flags_t
);
188 static tree
for_each_template_parm_r (tree
*, int *, void *);
189 static tree
copy_default_args_to_explicit_spec_1 (tree
, tree
);
190 static void copy_default_args_to_explicit_spec (tree
);
191 static int invalid_nontype_parm_type_p (tree
, tsubst_flags_t
);
192 static bool dependent_template_arg_p (tree
);
193 static bool any_template_arguments_need_structural_equality_p (tree
);
194 static bool dependent_type_p_r (tree
);
195 static tree
tsubst_expr (tree
, tree
, tsubst_flags_t
, tree
, bool);
196 static tree
tsubst_copy (tree
, tree
, tsubst_flags_t
, tree
);
197 static tree
tsubst_pack_expansion (tree
, tree
, tsubst_flags_t
, tree
);
198 static tree
tsubst_decl (tree
, tree
, tsubst_flags_t
);
199 static void perform_typedefs_access_check (tree tmpl
, tree targs
);
200 static void append_type_to_template_for_access_check_1 (tree
, tree
, tree
,
202 static tree
listify (tree
);
203 static tree
listify_autos (tree
, tree
);
204 static tree
template_parm_to_arg (tree t
);
205 static tree
current_template_args (void);
206 static tree
tsubst_template_parm (tree
, tree
, tsubst_flags_t
);
207 static tree
instantiate_alias_template (tree
, tree
, tsubst_flags_t
);
209 /* Make the current scope suitable for access checking when we are
210 processing T. T can be FUNCTION_DECL for instantiated function
211 template, VAR_DECL for static member variable, or TYPE_DECL for
212 alias template (needed by instantiate_decl). */
215 push_access_scope (tree t
)
217 gcc_assert (VAR_OR_FUNCTION_DECL_P (t
)
218 || TREE_CODE (t
) == TYPE_DECL
);
220 if (DECL_FRIEND_CONTEXT (t
))
221 push_nested_class (DECL_FRIEND_CONTEXT (t
));
222 else if (DECL_CLASS_SCOPE_P (t
))
223 push_nested_class (DECL_CONTEXT (t
));
225 push_to_top_level ();
227 if (TREE_CODE (t
) == FUNCTION_DECL
)
229 saved_access_scope
= tree_cons
230 (NULL_TREE
, current_function_decl
, saved_access_scope
);
231 current_function_decl
= t
;
235 /* Restore the scope set up by push_access_scope. T is the node we
239 pop_access_scope (tree t
)
241 if (TREE_CODE (t
) == FUNCTION_DECL
)
243 current_function_decl
= TREE_VALUE (saved_access_scope
);
244 saved_access_scope
= TREE_CHAIN (saved_access_scope
);
247 if (DECL_FRIEND_CONTEXT (t
) || DECL_CLASS_SCOPE_P (t
))
250 pop_from_top_level ();
253 /* Do any processing required when DECL (a member template
254 declaration) is finished. Returns the TEMPLATE_DECL corresponding
255 to DECL, unless it is a specialization, in which case the DECL
256 itself is returned. */
259 finish_member_template_decl (tree decl
)
261 if (decl
== error_mark_node
)
262 return error_mark_node
;
264 gcc_assert (DECL_P (decl
));
266 if (TREE_CODE (decl
) == TYPE_DECL
)
270 type
= TREE_TYPE (decl
);
271 if (type
== error_mark_node
)
272 return error_mark_node
;
273 if (MAYBE_CLASS_TYPE_P (type
)
274 && CLASSTYPE_TEMPLATE_INFO (type
)
275 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
277 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
278 check_member_template (tmpl
);
283 else if (TREE_CODE (decl
) == FIELD_DECL
)
284 error ("data member %qD cannot be a member template", decl
);
285 else if (DECL_TEMPLATE_INFO (decl
))
287 if (!DECL_TEMPLATE_SPECIALIZATION (decl
))
289 check_member_template (DECL_TI_TEMPLATE (decl
));
290 return DECL_TI_TEMPLATE (decl
);
296 error ("invalid member template declaration %qD", decl
);
298 return error_mark_node
;
301 /* Create a template info node. */
304 build_template_info (tree template_decl
, tree template_args
)
306 tree result
= make_node (TEMPLATE_INFO
);
307 TI_TEMPLATE (result
) = template_decl
;
308 TI_ARGS (result
) = template_args
;
312 /* Return the template info node corresponding to T, whatever T is. */
315 get_template_info (const_tree t
)
317 tree tinfo
= NULL_TREE
;
319 if (!t
|| t
== error_mark_node
)
322 if (TREE_CODE (t
) == NAMESPACE_DECL
)
325 if (DECL_P (t
) && DECL_LANG_SPECIFIC (t
))
326 tinfo
= DECL_TEMPLATE_INFO (t
);
328 if (!tinfo
&& DECL_IMPLICIT_TYPEDEF_P (t
))
331 if (OVERLOAD_TYPE_P (t
))
332 tinfo
= TYPE_TEMPLATE_INFO (t
);
333 else if (TREE_CODE (t
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
334 tinfo
= TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t
);
339 /* Returns the template nesting level of the indicated class TYPE.
349 A<T>::B<U> has depth two, while A<T> has depth one.
350 Both A<T>::B<int> and A<int>::B<U> have depth one, if
351 they are instantiations, not specializations.
353 This function is guaranteed to return 0 if passed NULL_TREE so
354 that, for example, `template_class_depth (current_class_type)' is
358 template_class_depth (tree type
)
363 type
&& TREE_CODE (type
) != NAMESPACE_DECL
;
364 type
= (TREE_CODE (type
) == FUNCTION_DECL
)
365 ? CP_DECL_CONTEXT (type
) : CP_TYPE_CONTEXT (type
))
367 tree tinfo
= get_template_info (type
);
369 if (tinfo
&& PRIMARY_TEMPLATE_P (TI_TEMPLATE (tinfo
))
370 && uses_template_parms (INNERMOST_TEMPLATE_ARGS (TI_ARGS (tinfo
))))
377 /* Subroutine of maybe_begin_member_template_processing.
378 Returns true if processing DECL needs us to push template parms. */
381 inline_needs_template_parms (tree decl
, bool nsdmi
)
383 if (!decl
|| (!nsdmi
&& ! DECL_TEMPLATE_INFO (decl
)))
386 return (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (most_general_template (decl
)))
387 > (processing_template_decl
+ DECL_TEMPLATE_SPECIALIZATION (decl
)));
390 /* Subroutine of maybe_begin_member_template_processing.
391 Push the template parms in PARMS, starting from LEVELS steps into the
392 chain, and ending at the beginning, since template parms are listed
396 push_inline_template_parms_recursive (tree parmlist
, int levels
)
398 tree parms
= TREE_VALUE (parmlist
);
402 push_inline_template_parms_recursive (TREE_CHAIN (parmlist
), levels
- 1);
404 ++processing_template_decl
;
405 current_template_parms
406 = tree_cons (size_int (processing_template_decl
),
407 parms
, current_template_parms
);
408 TEMPLATE_PARMS_FOR_INLINE (current_template_parms
) = 1;
410 begin_scope (TREE_VEC_LENGTH (parms
) ? sk_template_parms
: sk_template_spec
,
412 for (i
= 0; i
< TREE_VEC_LENGTH (parms
); ++i
)
414 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
416 if (error_operand_p (parm
))
419 gcc_assert (DECL_P (parm
));
421 switch (TREE_CODE (parm
))
430 /* Make a CONST_DECL as is done in process_template_parm.
431 It is ugly that we recreate this here; the original
432 version built in process_template_parm is no longer
434 tree decl
= build_decl (DECL_SOURCE_LOCATION (parm
),
435 CONST_DECL
, DECL_NAME (parm
),
437 DECL_ARTIFICIAL (decl
) = 1;
438 TREE_CONSTANT (decl
) = 1;
439 TREE_READONLY (decl
) = 1;
440 DECL_INITIAL (decl
) = DECL_INITIAL (parm
);
441 SET_DECL_TEMPLATE_PARM_P (decl
);
452 /* Restore the template parameter context for a member template, a
453 friend template defined in a class definition, or a non-template
454 member of template class. */
457 maybe_begin_member_template_processing (tree decl
)
461 bool nsdmi
= TREE_CODE (decl
) == FIELD_DECL
;
465 tree ctx
= DECL_CONTEXT (decl
);
466 decl
= (CLASSTYPE_TEMPLATE_INFO (ctx
)
467 /* Disregard full specializations (c++/60999). */
468 && uses_template_parms (ctx
)
469 ? CLASSTYPE_TI_TEMPLATE (ctx
) : NULL_TREE
);
472 if (inline_needs_template_parms (decl
, nsdmi
))
474 parms
= DECL_TEMPLATE_PARMS (most_general_template (decl
));
475 levels
= TMPL_PARMS_DEPTH (parms
) - processing_template_decl
;
477 if (DECL_TEMPLATE_SPECIALIZATION (decl
))
480 parms
= TREE_CHAIN (parms
);
483 push_inline_template_parms_recursive (parms
, levels
);
486 /* Remember how many levels of template parameters we pushed so that
487 we can pop them later. */
488 inline_parm_levels
.safe_push (levels
);
491 /* Undo the effects of maybe_begin_member_template_processing. */
494 maybe_end_member_template_processing (void)
499 if (inline_parm_levels
.length () == 0)
502 last
= inline_parm_levels
.pop ();
503 for (i
= 0; i
< last
; ++i
)
505 --processing_template_decl
;
506 current_template_parms
= TREE_CHAIN (current_template_parms
);
511 /* Return a new template argument vector which contains all of ARGS,
512 but has as its innermost set of arguments the EXTRA_ARGS. */
515 add_to_template_args (tree args
, tree extra_args
)
522 if (args
== NULL_TREE
|| extra_args
== error_mark_node
)
525 extra_depth
= TMPL_ARGS_DEPTH (extra_args
);
526 new_args
= make_tree_vec (TMPL_ARGS_DEPTH (args
) + extra_depth
);
528 for (i
= 1; i
<= TMPL_ARGS_DEPTH (args
); ++i
)
529 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (args
, i
));
531 for (j
= 1; j
<= extra_depth
; ++j
, ++i
)
532 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (extra_args
, j
));
537 /* Like add_to_template_args, but only the outermost ARGS are added to
538 the EXTRA_ARGS. In particular, all but TMPL_ARGS_DEPTH
539 (EXTRA_ARGS) levels are added. This function is used to combine
540 the template arguments from a partial instantiation with the
541 template arguments used to attain the full instantiation from the
542 partial instantiation. */
545 add_outermost_template_args (tree args
, tree extra_args
)
549 /* If there are more levels of EXTRA_ARGS than there are ARGS,
550 something very fishy is going on. */
551 gcc_assert (TMPL_ARGS_DEPTH (args
) >= TMPL_ARGS_DEPTH (extra_args
));
553 /* If *all* the new arguments will be the EXTRA_ARGS, just return
555 if (TMPL_ARGS_DEPTH (args
) == TMPL_ARGS_DEPTH (extra_args
))
558 /* For the moment, we make ARGS look like it contains fewer levels. */
559 TREE_VEC_LENGTH (args
) -= TMPL_ARGS_DEPTH (extra_args
);
561 new_args
= add_to_template_args (args
, extra_args
);
563 /* Now, we restore ARGS to its full dimensions. */
564 TREE_VEC_LENGTH (args
) += TMPL_ARGS_DEPTH (extra_args
);
569 /* Return the N levels of innermost template arguments from the ARGS. */
572 get_innermost_template_args (tree args
, int n
)
580 /* If N is 1, just return the innermost set of template arguments. */
582 return TMPL_ARGS_LEVEL (args
, TMPL_ARGS_DEPTH (args
));
584 /* If we're not removing anything, just return the arguments we were
586 extra_levels
= TMPL_ARGS_DEPTH (args
) - n
;
587 gcc_assert (extra_levels
>= 0);
588 if (extra_levels
== 0)
591 /* Make a new set of arguments, not containing the outer arguments. */
592 new_args
= make_tree_vec (n
);
593 for (i
= 1; i
<= n
; ++i
)
594 SET_TMPL_ARGS_LEVEL (new_args
, i
,
595 TMPL_ARGS_LEVEL (args
, i
+ extra_levels
));
600 /* The inverse of get_innermost_template_args: Return all but the innermost
601 EXTRA_LEVELS levels of template arguments from the ARGS. */
604 strip_innermost_template_args (tree args
, int extra_levels
)
607 int n
= TMPL_ARGS_DEPTH (args
) - extra_levels
;
612 /* If N is 1, just return the outermost set of template arguments. */
614 return TMPL_ARGS_LEVEL (args
, 1);
616 /* If we're not removing anything, just return the arguments we were
618 gcc_assert (extra_levels
>= 0);
619 if (extra_levels
== 0)
622 /* Make a new set of arguments, not containing the inner arguments. */
623 new_args
= make_tree_vec (n
);
624 for (i
= 1; i
<= n
; ++i
)
625 SET_TMPL_ARGS_LEVEL (new_args
, i
,
626 TMPL_ARGS_LEVEL (args
, i
));
631 /* We've got a template header coming up; push to a new level for storing
635 begin_template_parm_list (void)
637 /* We use a non-tag-transparent scope here, which causes pushtag to
638 put tags in this scope, rather than in the enclosing class or
639 namespace scope. This is the right thing, since we want
640 TEMPLATE_DECLS, and not TYPE_DECLS for template classes. For a
641 global template class, push_template_decl handles putting the
642 TEMPLATE_DECL into top-level scope. For a nested template class,
645 template <class T> struct S1 {
646 template <class T> struct S2 {};
649 pushtag contains special code to call pushdecl_with_scope on the
650 TEMPLATE_DECL for S2. */
651 begin_scope (sk_template_parms
, NULL
);
652 ++processing_template_decl
;
653 ++processing_template_parmlist
;
654 note_template_header (0);
657 /* This routine is called when a specialization is declared. If it is
658 invalid to declare a specialization here, an error is reported and
659 false is returned, otherwise this routine will return true. */
662 check_specialization_scope (void)
664 tree scope
= current_scope ();
668 An explicit specialization shall be declared in the namespace of
669 which the template is a member, or, for member templates, in the
670 namespace of which the enclosing class or enclosing class
671 template is a member. An explicit specialization of a member
672 function, member class or static data member of a class template
673 shall be declared in the namespace of which the class template
675 if (scope
&& TREE_CODE (scope
) != NAMESPACE_DECL
)
677 error ("explicit specialization in non-namespace scope %qD", scope
);
683 In an explicit specialization declaration for a member of a class
684 template or a member template that appears in namespace scope,
685 the member template and some of its enclosing class templates may
686 remain unspecialized, except that the declaration shall not
687 explicitly specialize a class member template if its enclosing
688 class templates are not explicitly specialized as well. */
689 if (current_template_parms
)
691 error ("enclosing class templates are not explicitly specialized");
698 /* We've just seen template <>. */
701 begin_specialization (void)
703 begin_scope (sk_template_spec
, NULL
);
704 note_template_header (1);
705 return check_specialization_scope ();
708 /* Called at then end of processing a declaration preceded by
712 end_specialization (void)
715 reset_specialization ();
718 /* Any template <>'s that we have seen thus far are not referring to a
719 function specialization. */
722 reset_specialization (void)
724 processing_specialization
= 0;
725 template_header_count
= 0;
728 /* We've just seen a template header. If SPECIALIZATION is nonzero,
729 it was of the form template <>. */
732 note_template_header (int specialization
)
734 processing_specialization
= specialization
;
735 template_header_count
++;
738 /* We're beginning an explicit instantiation. */
741 begin_explicit_instantiation (void)
743 gcc_assert (!processing_explicit_instantiation
);
744 processing_explicit_instantiation
= true;
749 end_explicit_instantiation (void)
751 gcc_assert (processing_explicit_instantiation
);
752 processing_explicit_instantiation
= false;
755 /* An explicit specialization or partial specialization of TMPL is being
756 declared. Check that the namespace in which the specialization is
757 occurring is permissible. Returns false iff it is invalid to
758 specialize TMPL in the current namespace. */
761 check_specialization_namespace (tree tmpl
)
763 tree tpl_ns
= decl_namespace_context (tmpl
);
767 An explicit specialization shall be declared in the namespace of
768 which the template is a member, or, for member templates, in the
769 namespace of which the enclosing class or enclosing class
770 template is a member. An explicit specialization of a member
771 function, member class or static data member of a class template
772 shall be declared in the namespace of which the class template is
774 if (current_scope() != DECL_CONTEXT (tmpl
)
775 && !at_namespace_scope_p ())
777 error ("specialization of %qD must appear at namespace scope", tmpl
);
780 if (is_associated_namespace (current_namespace
, tpl_ns
))
781 /* Same or super-using namespace. */
785 permerror (input_location
, "specialization of %qD in different namespace", tmpl
);
786 permerror (input_location
, " from definition of %q+#D", tmpl
);
791 /* SPEC is an explicit instantiation. Check that it is valid to
792 perform this explicit instantiation in the current namespace. */
795 check_explicit_instantiation_namespace (tree spec
)
799 /* DR 275: An explicit instantiation shall appear in an enclosing
800 namespace of its template. */
801 ns
= decl_namespace_context (spec
);
802 if (!is_ancestor (current_namespace
, ns
))
803 permerror (input_location
, "explicit instantiation of %qD in namespace %qD "
804 "(which does not enclose namespace %qD)",
805 spec
, current_namespace
, ns
);
808 /* The TYPE is being declared. If it is a template type, that means it
809 is a partial specialization. Do appropriate error-checking. */
812 maybe_process_partial_specialization (tree type
)
816 if (type
== error_mark_node
)
817 return error_mark_node
;
819 /* A lambda that appears in specialization context is not itself a
821 if (CLASS_TYPE_P (type
) && CLASSTYPE_LAMBDA_EXPR (type
))
824 if (TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
826 error ("name of class shadows template template parameter %qD",
828 return error_mark_node
;
831 context
= TYPE_CONTEXT (type
);
833 if (TYPE_ALIAS_P (type
))
835 if (TYPE_TEMPLATE_INFO (type
)
836 && DECL_ALIAS_TEMPLATE_P (TYPE_TI_TEMPLATE (type
)))
837 error ("specialization of alias template %qD",
838 TYPE_TI_TEMPLATE (type
));
840 error ("explicit specialization of non-template %qT", type
);
841 return error_mark_node
;
843 else if (CLASS_TYPE_P (type
) && CLASSTYPE_USE_TEMPLATE (type
))
845 /* This is for ordinary explicit specialization and partial
846 specialization of a template class such as:
848 template <> class C<int>;
852 template <class T> class C<T*>;
854 Make sure that `C<int>' and `C<T*>' are implicit instantiations. */
856 if (CLASSTYPE_IMPLICIT_INSTANTIATION (type
)
857 && !COMPLETE_TYPE_P (type
))
859 if (!check_specialization_namespace (CLASSTYPE_TI_TEMPLATE (type
))
860 && !at_namespace_scope_p ())
861 return error_mark_node
;
862 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type
);
863 DECL_SOURCE_LOCATION (TYPE_MAIN_DECL (type
)) = input_location
;
864 if (processing_template_decl
)
866 if (push_template_decl (TYPE_MAIN_DECL (type
))
868 return error_mark_node
;
871 else if (CLASSTYPE_TEMPLATE_INSTANTIATION (type
))
872 error ("specialization of %qT after instantiation", type
);
873 else if (errorcount
&& !processing_specialization
874 && CLASSTYPE_TEMPLATE_SPECIALIZATION (type
)
875 && !uses_template_parms (CLASSTYPE_TI_ARGS (type
)))
876 /* Trying to define a specialization either without a template<> header
877 or in an inappropriate place. We've already given an error, so just
878 bail now so we don't actually define the specialization. */
879 return error_mark_node
;
881 else if (CLASS_TYPE_P (type
)
882 && !CLASSTYPE_USE_TEMPLATE (type
)
883 && CLASSTYPE_TEMPLATE_INFO (type
)
884 && context
&& CLASS_TYPE_P (context
)
885 && CLASSTYPE_TEMPLATE_INFO (context
))
887 /* This is for an explicit specialization of member class
888 template according to [temp.expl.spec/18]:
890 template <> template <class U> class C<int>::D;
892 The context `C<int>' must be an implicit instantiation.
893 Otherwise this is just a member class template declared
896 template <> class C<int> { template <class U> class D; };
897 template <> template <class U> class C<int>::D;
899 In the first case, `C<int>::D' is a specialization of `C<T>::D'
900 while in the second case, `C<int>::D' is a primary template
901 and `C<T>::D' may not exist. */
903 if (CLASSTYPE_IMPLICIT_INSTANTIATION (context
)
904 && !COMPLETE_TYPE_P (type
))
907 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
909 if (current_namespace
910 != decl_namespace_context (tmpl
))
912 permerror (input_location
, "specializing %q#T in different namespace", type
);
913 permerror (input_location
, " from definition of %q+#D", tmpl
);
916 /* Check for invalid specialization after instantiation:
918 template <> template <> class C<int>::D<int>;
919 template <> template <class U> class C<int>::D; */
921 for (t
= DECL_TEMPLATE_INSTANTIATIONS (tmpl
);
922 t
; t
= TREE_CHAIN (t
))
924 tree inst
= TREE_VALUE (t
);
925 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (inst
)
926 || !COMPLETE_OR_OPEN_TYPE_P (inst
))
928 /* We already have a full specialization of this partial
929 instantiation, or a full specialization has been
930 looked up but not instantiated. Reassign it to the
931 new member specialization template. */
936 elt
.tmpl
= most_general_template (tmpl
);
937 elt
.args
= CLASSTYPE_TI_ARGS (inst
);
940 htab_remove_elt (type_specializations
, &elt
);
943 elt
.args
= INNERMOST_TEMPLATE_ARGS (elt
.args
);
945 slot
= htab_find_slot (type_specializations
, &elt
, INSERT
);
946 entry
= ggc_alloc
<spec_entry
> ();
951 /* But if we've had an implicit instantiation, that's a
952 problem ([temp.expl.spec]/6). */
953 error ("specialization %qT after instantiation %qT",
957 /* Mark TYPE as a specialization. And as a result, we only
958 have one level of template argument for the innermost
960 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type
);
961 DECL_SOURCE_LOCATION (TYPE_MAIN_DECL (type
)) = input_location
;
962 CLASSTYPE_TI_ARGS (type
)
963 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type
));
966 else if (processing_specialization
)
968 /* Someday C++0x may allow for enum template specialization. */
969 if (cxx_dialect
> cxx98
&& TREE_CODE (type
) == ENUMERAL_TYPE
970 && CLASS_TYPE_P (context
) && CLASSTYPE_USE_TEMPLATE (context
))
971 pedwarn (input_location
, OPT_Wpedantic
, "template specialization "
972 "of %qD not allowed by ISO C++", type
);
975 error ("explicit specialization of non-template %qT", type
);
976 return error_mark_node
;
983 /* Returns nonzero if we can optimize the retrieval of specializations
984 for TMPL, a TEMPLATE_DECL. In particular, for such a template, we
985 do not use DECL_TEMPLATE_SPECIALIZATIONS at all. */
988 optimize_specialization_lookup_p (tree tmpl
)
990 return (DECL_FUNCTION_TEMPLATE_P (tmpl
)
991 && DECL_CLASS_SCOPE_P (tmpl
)
992 /* DECL_CLASS_SCOPE_P holds of T::f even if T is a template
994 && CLASS_TYPE_P (DECL_CONTEXT (tmpl
))
995 /* The optimized lookup depends on the fact that the
996 template arguments for the member function template apply
997 purely to the containing class, which is not true if the
998 containing class is an explicit or partial
1000 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (tmpl
))
1001 && !DECL_MEMBER_TEMPLATE_P (tmpl
)
1002 && !DECL_CONV_FN_P (tmpl
)
1003 /* It is possible to have a template that is not a member
1004 template and is not a member of a template class:
1006 template <typename T>
1007 struct S { friend A::f(); };
1009 Here, the friend function is a template, but the context does
1010 not have template information. The optimized lookup relies
1011 on having ARGS be the template arguments for both the class
1012 and the function template. */
1013 && !DECL_FRIEND_P (DECL_TEMPLATE_RESULT (tmpl
)));
1016 /* Retrieve the specialization (in the sense of [temp.spec] - a
1017 specialization is either an instantiation or an explicit
1018 specialization) of TMPL for the given template ARGS. If there is
1019 no such specialization, return NULL_TREE. The ARGS are a vector of
1020 arguments, or a vector of vectors of arguments, in the case of
1021 templates with more than one level of parameters.
1023 If TMPL is a type template and CLASS_SPECIALIZATIONS_P is true,
1024 then we search for a partial specialization matching ARGS. This
1025 parameter is ignored if TMPL is not a class template.
1027 We can also look up a FIELD_DECL, if it is a lambda capture pack; the
1028 result is a NONTYPE_ARGUMENT_PACK. */
1031 retrieve_specialization (tree tmpl
, tree args
, hashval_t hash
)
1033 if (tmpl
== NULL_TREE
)
1036 if (args
== error_mark_node
)
1039 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
1040 || TREE_CODE (tmpl
) == FIELD_DECL
);
1042 /* There should be as many levels of arguments as there are
1043 levels of parameters. */
1044 gcc_assert (TMPL_ARGS_DEPTH (args
)
1045 == (TREE_CODE (tmpl
) == TEMPLATE_DECL
1046 ? TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
))
1047 : template_class_depth (DECL_CONTEXT (tmpl
))));
1049 if (optimize_specialization_lookup_p (tmpl
))
1051 tree class_template
;
1052 tree class_specialization
;
1053 vec
<tree
, va_gc
> *methods
;
1057 /* The template arguments actually apply to the containing
1058 class. Find the class specialization with those
1060 class_template
= CLASSTYPE_TI_TEMPLATE (DECL_CONTEXT (tmpl
));
1061 class_specialization
1062 = retrieve_specialization (class_template
, args
, 0);
1063 if (!class_specialization
)
1065 /* Now, find the appropriate entry in the CLASSTYPE_METHOD_VEC
1066 for the specialization. */
1067 idx
= class_method_index_for_fn (class_specialization
, tmpl
);
1070 /* Iterate through the methods with the indicated name, looking
1071 for the one that has an instance of TMPL. */
1072 methods
= CLASSTYPE_METHOD_VEC (class_specialization
);
1073 for (fns
= (*methods
)[idx
]; fns
; fns
= OVL_NEXT (fns
))
1075 tree fn
= OVL_CURRENT (fns
);
1076 if (DECL_TEMPLATE_INFO (fn
) && DECL_TI_TEMPLATE (fn
) == tmpl
1077 /* using-declarations can add base methods to the method vec,
1078 and we don't want those here. */
1079 && DECL_CONTEXT (fn
) == class_specialization
)
1088 htab_t specializations
;
1092 elt
.spec
= NULL_TREE
;
1094 if (DECL_CLASS_TEMPLATE_P (tmpl
))
1095 specializations
= type_specializations
;
1097 specializations
= decl_specializations
;
1100 hash
= hash_specialization (&elt
);
1101 found
= (spec_entry
*) htab_find_with_hash (specializations
, &elt
, hash
);
1109 /* Like retrieve_specialization, but for local declarations. */
1112 retrieve_local_specialization (tree tmpl
)
1114 if (local_specializations
== NULL
)
1117 tree
*slot
= local_specializations
->get (tmpl
);
1118 return slot
? *slot
: NULL_TREE
;
1121 /* Returns nonzero iff DECL is a specialization of TMPL. */
1124 is_specialization_of (tree decl
, tree tmpl
)
1128 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1132 t
= DECL_TEMPLATE_INFO (t
) ? DECL_TI_TEMPLATE (t
) : NULL_TREE
)
1138 gcc_assert (TREE_CODE (decl
) == TYPE_DECL
);
1140 for (t
= TREE_TYPE (decl
);
1142 t
= CLASSTYPE_USE_TEMPLATE (t
)
1143 ? TREE_TYPE (CLASSTYPE_TI_TEMPLATE (t
)) : NULL_TREE
)
1144 if (same_type_ignoring_top_level_qualifiers_p (t
, TREE_TYPE (tmpl
)))
1151 /* Returns nonzero iff DECL is a specialization of friend declaration
1152 FRIEND_DECL according to [temp.friend]. */
1155 is_specialization_of_friend (tree decl
, tree friend_decl
)
1157 bool need_template
= true;
1160 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
1161 || TREE_CODE (decl
) == TYPE_DECL
);
1163 /* For [temp.friend/6] when FRIEND_DECL is an ordinary member function
1164 of a template class, we want to check if DECL is a specialization
1166 if (TREE_CODE (friend_decl
) == FUNCTION_DECL
1167 && DECL_TEMPLATE_INFO (friend_decl
)
1168 && !DECL_USE_TEMPLATE (friend_decl
))
1170 /* We want a TEMPLATE_DECL for `is_specialization_of'. */
1171 friend_decl
= DECL_TI_TEMPLATE (friend_decl
);
1172 need_template
= false;
1174 else if (TREE_CODE (friend_decl
) == TEMPLATE_DECL
1175 && !PRIMARY_TEMPLATE_P (friend_decl
))
1176 need_template
= false;
1178 /* There is nothing to do if this is not a template friend. */
1179 if (TREE_CODE (friend_decl
) != TEMPLATE_DECL
)
1182 if (is_specialization_of (decl
, friend_decl
))
1186 A member of a class template may be declared to be a friend of a
1187 non-template class. In this case, the corresponding member of
1188 every specialization of the class template is a friend of the
1189 class granting friendship.
1191 For example, given a template friend declaration
1193 template <class T> friend void A<T>::f();
1195 the member function below is considered a friend
1197 template <> struct A<int> {
1201 For this type of template friend, TEMPLATE_DEPTH below will be
1202 nonzero. To determine if DECL is a friend of FRIEND, we first
1203 check if the enclosing class is a specialization of another. */
1205 template_depth
= template_class_depth (CP_DECL_CONTEXT (friend_decl
));
1207 && DECL_CLASS_SCOPE_P (decl
)
1208 && is_specialization_of (TYPE_NAME (DECL_CONTEXT (decl
)),
1209 CLASSTYPE_TI_TEMPLATE (DECL_CONTEXT (friend_decl
))))
1211 /* Next, we check the members themselves. In order to handle
1212 a few tricky cases, such as when FRIEND_DECL's are
1214 template <class T> friend void A<T>::g(T t);
1215 template <class T> template <T t> friend void A<T>::h();
1219 void A<int>::g(int);
1220 template <int> void A<int>::h();
1222 we need to figure out ARGS, the template arguments from
1223 the context of DECL. This is required for template substitution
1224 of `T' in the function parameter of `g' and template parameter
1225 of `h' in the above examples. Here ARGS corresponds to `int'. */
1227 tree context
= DECL_CONTEXT (decl
);
1228 tree args
= NULL_TREE
;
1229 int current_depth
= 0;
1231 while (current_depth
< template_depth
)
1233 if (CLASSTYPE_TEMPLATE_INFO (context
))
1235 if (current_depth
== 0)
1236 args
= TYPE_TI_ARGS (context
);
1238 args
= add_to_template_args (TYPE_TI_ARGS (context
), args
);
1241 context
= TYPE_CONTEXT (context
);
1244 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1249 tree friend_args_type
;
1250 tree decl_args_type
;
1252 /* Make sure that both DECL and FRIEND_DECL are templates or
1254 is_template
= DECL_TEMPLATE_INFO (decl
)
1255 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl
));
1256 if (need_template
^ is_template
)
1258 else if (is_template
)
1260 /* If both are templates, check template parameter list. */
1262 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_decl
),
1264 if (!comp_template_parms
1265 (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (decl
)),
1269 decl_type
= TREE_TYPE (DECL_TI_TEMPLATE (decl
));
1272 decl_type
= TREE_TYPE (decl
);
1274 friend_type
= tsubst_function_type (TREE_TYPE (friend_decl
), args
,
1275 tf_none
, NULL_TREE
);
1276 if (friend_type
== error_mark_node
)
1279 /* Check if return types match. */
1280 if (!same_type_p (TREE_TYPE (decl_type
), TREE_TYPE (friend_type
)))
1283 /* Check if function parameter types match, ignoring the
1284 `this' parameter. */
1285 friend_args_type
= TYPE_ARG_TYPES (friend_type
);
1286 decl_args_type
= TYPE_ARG_TYPES (decl_type
);
1287 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (friend_decl
))
1288 friend_args_type
= TREE_CHAIN (friend_args_type
);
1289 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1290 decl_args_type
= TREE_CHAIN (decl_args_type
);
1292 return compparms (decl_args_type
, friend_args_type
);
1296 /* DECL is a TYPE_DECL */
1298 tree decl_type
= TREE_TYPE (decl
);
1300 /* Make sure that both DECL and FRIEND_DECL are templates or
1303 = CLASSTYPE_TEMPLATE_INFO (decl_type
)
1304 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (decl_type
));
1306 if (need_template
^ is_template
)
1308 else if (is_template
)
1311 /* If both are templates, check the name of the two
1312 TEMPLATE_DECL's first because is_friend didn't. */
1313 if (DECL_NAME (CLASSTYPE_TI_TEMPLATE (decl_type
))
1314 != DECL_NAME (friend_decl
))
1317 /* Now check template parameter list. */
1319 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_decl
),
1321 return comp_template_parms
1322 (DECL_TEMPLATE_PARMS (CLASSTYPE_TI_TEMPLATE (decl_type
)),
1326 return (DECL_NAME (decl
)
1327 == DECL_NAME (friend_decl
));
1333 /* Register the specialization SPEC as a specialization of TMPL with
1334 the indicated ARGS. IS_FRIEND indicates whether the specialization
1335 is actually just a friend declaration. Returns SPEC, or an
1336 equivalent prior declaration, if available.
1338 We also store instantiations of field packs in the hash table, even
1339 though they are not themselves templates, to make lookup easier. */
1342 register_specialization (tree spec
, tree tmpl
, tree args
, bool is_friend
,
1349 gcc_assert ((TREE_CODE (tmpl
) == TEMPLATE_DECL
&& DECL_P (spec
))
1350 || (TREE_CODE (tmpl
) == FIELD_DECL
1351 && TREE_CODE (spec
) == NONTYPE_ARGUMENT_PACK
));
1353 if (TREE_CODE (spec
) == FUNCTION_DECL
1354 && uses_template_parms (DECL_TI_ARGS (spec
)))
1355 /* This is the FUNCTION_DECL for a partial instantiation. Don't
1356 register it; we want the corresponding TEMPLATE_DECL instead.
1357 We use `uses_template_parms (DECL_TI_ARGS (spec))' rather than
1358 the more obvious `uses_template_parms (spec)' to avoid problems
1359 with default function arguments. In particular, given
1360 something like this:
1362 template <class T> void f(T t1, T t = T())
1364 the default argument expression is not substituted for in an
1365 instantiation unless and until it is actually needed. */
1368 if (optimize_specialization_lookup_p (tmpl
))
1369 /* We don't put these specializations in the hash table, but we might
1370 want to give an error about a mismatch. */
1371 fn
= retrieve_specialization (tmpl
, args
, 0);
1379 hash
= hash_specialization (&elt
);
1382 htab_find_slot_with_hash (decl_specializations
, &elt
, hash
, INSERT
);
1384 fn
= ((spec_entry
*) *slot
)->spec
;
1389 /* We can sometimes try to re-register a specialization that we've
1390 already got. In particular, regenerate_decl_from_template calls
1391 duplicate_decls which will update the specialization list. But,
1392 we'll still get called again here anyhow. It's more convenient
1393 to simply allow this than to try to prevent it. */
1396 else if (fn
&& DECL_TEMPLATE_SPECIALIZATION (spec
))
1398 if (DECL_TEMPLATE_INSTANTIATION (fn
))
1400 if (DECL_ODR_USED (fn
)
1401 || DECL_EXPLICIT_INSTANTIATION (fn
))
1403 error ("specialization of %qD after instantiation",
1405 return error_mark_node
;
1410 /* This situation should occur only if the first
1411 specialization is an implicit instantiation, the
1412 second is an explicit specialization, and the
1413 implicit instantiation has not yet been used. That
1414 situation can occur if we have implicitly
1415 instantiated a member function and then specialized
1418 We can also wind up here if a friend declaration that
1419 looked like an instantiation turns out to be a
1422 template <class T> void foo(T);
1423 class S { friend void foo<>(int) };
1424 template <> void foo(int);
1426 We transform the existing DECL in place so that any
1427 pointers to it become pointers to the updated
1430 If there was a definition for the template, but not
1431 for the specialization, we want this to look as if
1432 there were no definition, and vice versa. */
1433 DECL_INITIAL (fn
) = NULL_TREE
;
1434 duplicate_decls (spec
, fn
, is_friend
);
1435 /* The call to duplicate_decls will have applied
1438 An explicit specialization of a function template
1439 is inline only if it is explicitly declared to be,
1440 and independently of whether its function template
1443 to the primary function; now copy the inline bits to
1444 the various clones. */
1445 FOR_EACH_CLONE (clone
, fn
)
1447 DECL_DECLARED_INLINE_P (clone
)
1448 = DECL_DECLARED_INLINE_P (fn
);
1449 DECL_SOURCE_LOCATION (clone
)
1450 = DECL_SOURCE_LOCATION (fn
);
1451 DECL_DELETED_FN (clone
)
1452 = DECL_DELETED_FN (fn
);
1454 check_specialization_namespace (tmpl
);
1459 else if (DECL_TEMPLATE_SPECIALIZATION (fn
))
1461 if (!duplicate_decls (spec
, fn
, is_friend
) && DECL_INITIAL (spec
))
1462 /* Dup decl failed, but this is a new definition. Set the
1463 line number so any errors match this new
1465 DECL_SOURCE_LOCATION (fn
) = DECL_SOURCE_LOCATION (spec
);
1471 return duplicate_decls (spec
, fn
, is_friend
);
1473 /* A specialization must be declared in the same namespace as the
1474 template it is specializing. */
1475 if (DECL_P (spec
) && DECL_TEMPLATE_SPECIALIZATION (spec
)
1476 && !check_specialization_namespace (tmpl
))
1477 DECL_CONTEXT (spec
) = DECL_CONTEXT (tmpl
);
1479 if (slot
!= NULL
/* !optimize_specialization_lookup_p (tmpl) */)
1481 spec_entry
*entry
= ggc_alloc
<spec_entry
> ();
1482 gcc_assert (tmpl
&& args
&& spec
);
1485 if (TREE_CODE (spec
) == FUNCTION_DECL
&& DECL_NAMESPACE_SCOPE_P (spec
)
1486 && PRIMARY_TEMPLATE_P (tmpl
)
1487 && DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (tmpl
)) == NULL_TREE
)
1488 /* TMPL is a forward declaration of a template function; keep a list
1489 of all specializations in case we need to reassign them to a friend
1490 template later in tsubst_friend_function. */
1491 DECL_TEMPLATE_INSTANTIATIONS (tmpl
)
1492 = tree_cons (args
, spec
, DECL_TEMPLATE_INSTANTIATIONS (tmpl
));
1498 /* Returns true iff two spec_entry nodes are equivalent. Only compares the
1499 TMPL and ARGS members, ignores SPEC. */
1501 int comparing_specializations
;
1504 eq_specializations (const void *p1
, const void *p2
)
1506 const spec_entry
*e1
= (const spec_entry
*)p1
;
1507 const spec_entry
*e2
= (const spec_entry
*)p2
;
1510 ++comparing_specializations
;
1511 equal
= (e1
->tmpl
== e2
->tmpl
1512 && comp_template_args (e1
->args
, e2
->args
));
1513 --comparing_specializations
;
1518 /* Returns a hash for a template TMPL and template arguments ARGS. */
1521 hash_tmpl_and_args (tree tmpl
, tree args
)
1523 hashval_t val
= DECL_UID (tmpl
);
1524 return iterative_hash_template_arg (args
, val
);
1527 /* Returns a hash for a spec_entry node based on the TMPL and ARGS members,
1531 hash_specialization (const void *p
)
1533 const spec_entry
*e
= (const spec_entry
*)p
;
1534 return hash_tmpl_and_args (e
->tmpl
, e
->args
);
1537 /* Recursively calculate a hash value for a template argument ARG, for use
1538 in the hash tables of template specializations. */
1541 iterative_hash_template_arg (tree arg
, hashval_t val
)
1543 unsigned HOST_WIDE_INT i
;
1544 enum tree_code code
;
1547 if (arg
== NULL_TREE
)
1548 return iterative_hash_object (arg
, val
);
1553 if (TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
1554 /* We can get one of these when re-hashing a previous entry in the middle
1555 of substituting into a pack expansion. Just look through it. */
1556 arg
= ARGUMENT_PACK_SELECT_FROM_PACK (arg
);
1558 code
= TREE_CODE (arg
);
1559 tclass
= TREE_CODE_CLASS (code
);
1561 val
= iterative_hash_object (code
, val
);
1568 case IDENTIFIER_NODE
:
1569 return iterative_hash_object (IDENTIFIER_HASH_VALUE (arg
), val
);
1573 int i
, len
= TREE_VEC_LENGTH (arg
);
1574 for (i
= 0; i
< len
; ++i
)
1575 val
= iterative_hash_template_arg (TREE_VEC_ELT (arg
, i
), val
);
1579 case TYPE_PACK_EXPANSION
:
1580 case EXPR_PACK_EXPANSION
:
1581 val
= iterative_hash_template_arg (PACK_EXPANSION_PATTERN (arg
), val
);
1582 return iterative_hash_template_arg (PACK_EXPANSION_EXTRA_ARGS (arg
), val
);
1584 case TYPE_ARGUMENT_PACK
:
1585 case NONTYPE_ARGUMENT_PACK
:
1586 return iterative_hash_template_arg (ARGUMENT_PACK_ARGS (arg
), val
);
1589 for (; arg
; arg
= TREE_CHAIN (arg
))
1590 val
= iterative_hash_template_arg (TREE_VALUE (arg
), val
);
1594 for (; arg
; arg
= OVL_NEXT (arg
))
1595 val
= iterative_hash_template_arg (OVL_CURRENT (arg
), val
);
1601 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (arg
), i
, field
, value
)
1603 val
= iterative_hash_template_arg (field
, val
);
1604 val
= iterative_hash_template_arg (value
, val
);
1610 if (!DECL_ARTIFICIAL (arg
))
1612 val
= iterative_hash_object (DECL_PARM_INDEX (arg
), val
);
1613 val
= iterative_hash_object (DECL_PARM_LEVEL (arg
), val
);
1615 return iterative_hash_template_arg (TREE_TYPE (arg
), val
);
1618 return iterative_hash_template_arg (TARGET_EXPR_INITIAL (arg
), val
);
1621 val
= iterative_hash_template_arg (PTRMEM_CST_CLASS (arg
), val
);
1622 return iterative_hash_template_arg (PTRMEM_CST_MEMBER (arg
), val
);
1624 case TEMPLATE_PARM_INDEX
:
1625 val
= iterative_hash_template_arg
1626 (TREE_TYPE (TEMPLATE_PARM_DECL (arg
)), val
);
1627 val
= iterative_hash_object (TEMPLATE_PARM_LEVEL (arg
), val
);
1628 return iterative_hash_object (TEMPLATE_PARM_IDX (arg
), val
);
1631 val
= iterative_hash_object (TRAIT_EXPR_KIND (arg
), val
);
1632 val
= iterative_hash_template_arg (TRAIT_EXPR_TYPE1 (arg
), val
);
1633 return iterative_hash_template_arg (TRAIT_EXPR_TYPE2 (arg
), val
);
1636 val
= iterative_hash_template_arg (BINFO_TYPE (BASELINK_BINFO (arg
)),
1638 return iterative_hash_template_arg (DECL_NAME (get_first_fn (arg
)),
1642 val
= iterative_hash_template_arg (TREE_OPERAND (arg
, 0), val
);
1643 code
= TREE_CODE (TREE_OPERAND (arg
, 1));
1644 val
= iterative_hash_object (code
, val
);
1645 return iterative_hash_template_arg (TREE_OPERAND (arg
, 2), val
);
1648 /* A lambda can't appear in a template arg, but don't crash on
1650 gcc_assert (seen_error ());
1654 case IMPLICIT_CONV_EXPR
:
1655 case STATIC_CAST_EXPR
:
1656 case REINTERPRET_CAST_EXPR
:
1657 case CONST_CAST_EXPR
:
1658 case DYNAMIC_CAST_EXPR
:
1660 val
= iterative_hash_template_arg (TREE_TYPE (arg
), val
);
1661 /* Now hash operands as usual. */
1671 if (TYPE_CANONICAL (arg
))
1672 return iterative_hash_object (TYPE_HASH (TYPE_CANONICAL (arg
)),
1674 else if (TREE_CODE (arg
) == DECLTYPE_TYPE
)
1675 return iterative_hash_template_arg (DECLTYPE_TYPE_EXPR (arg
), val
);
1676 /* Otherwise just compare the types during lookup. */
1679 case tcc_declaration
:
1681 return iterative_hash_expr (arg
, val
);
1684 gcc_assert (IS_EXPR_CODE_CLASS (tclass
));
1686 unsigned n
= cp_tree_operand_length (arg
);
1687 for (i
= 0; i
< n
; ++i
)
1688 val
= iterative_hash_template_arg (TREE_OPERAND (arg
, i
), val
);
1696 /* Unregister the specialization SPEC as a specialization of TMPL.
1697 Replace it with NEW_SPEC, if NEW_SPEC is non-NULL. Returns true
1698 if the SPEC was listed as a specialization of TMPL.
1700 Note that SPEC has been ggc_freed, so we can't look inside it. */
1703 reregister_specialization (tree spec
, tree tinfo
, tree new_spec
)
1708 elt
.tmpl
= most_general_template (TI_TEMPLATE (tinfo
));
1709 elt
.args
= TI_ARGS (tinfo
);
1710 elt
.spec
= NULL_TREE
;
1712 entry
= (spec_entry
*) htab_find (decl_specializations
, &elt
);
1715 gcc_assert (entry
->spec
== spec
|| entry
->spec
== new_spec
);
1716 gcc_assert (new_spec
!= NULL_TREE
);
1717 entry
->spec
= new_spec
;
1724 /* Like register_specialization, but for local declarations. We are
1725 registering SPEC, an instantiation of TMPL. */
1728 register_local_specialization (tree spec
, tree tmpl
)
1730 local_specializations
->put (tmpl
, spec
);
1733 /* TYPE is a class type. Returns true if TYPE is an explicitly
1734 specialized class. */
1737 explicit_class_specialization_p (tree type
)
1739 if (!CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
1741 return !uses_template_parms (CLASSTYPE_TI_ARGS (type
));
1744 /* Print the list of functions at FNS, going through all the overloads
1745 for each element of the list. Alternatively, FNS can not be a
1746 TREE_LIST, in which case it will be printed together with all the
1749 MORE and *STR should respectively be FALSE and NULL when the function
1750 is called from the outside. They are used internally on recursive
1751 calls. print_candidates manages the two parameters and leaves NULL
1752 in *STR when it ends. */
1755 print_candidates_1 (tree fns
, bool more
, const char **str
)
1758 char *spaces
= NULL
;
1760 for (fn
= fns
; fn
; fn
= OVL_NEXT (fn
))
1761 if (TREE_CODE (fn
) == TREE_LIST
)
1763 for (fn2
= fn
; fn2
!= NULL_TREE
; fn2
= TREE_CHAIN (fn2
))
1764 print_candidates_1 (TREE_VALUE (fn2
),
1765 TREE_CHAIN (fn2
) || more
, str
);
1769 tree cand
= OVL_CURRENT (fn
);
1772 /* Pick the prefix string. */
1773 if (!more
&& !OVL_NEXT (fns
))
1775 inform (DECL_SOURCE_LOCATION (cand
),
1776 "candidate is: %#D", cand
);
1780 *str
= _("candidates are:");
1781 spaces
= get_spaces (*str
);
1783 inform (DECL_SOURCE_LOCATION (cand
), "%s %#D", *str
, cand
);
1784 *str
= spaces
? spaces
: *str
;
1794 /* Print the list of candidate FNS in an error message. FNS can also
1795 be a TREE_LIST of non-functions in the case of an ambiguous lookup. */
1798 print_candidates (tree fns
)
1800 const char *str
= NULL
;
1801 print_candidates_1 (fns
, false, &str
);
1802 gcc_assert (str
== NULL
);
1805 /* Returns the template (one of the functions given by TEMPLATE_ID)
1806 which can be specialized to match the indicated DECL with the
1807 explicit template args given in TEMPLATE_ID. The DECL may be
1808 NULL_TREE if none is available. In that case, the functions in
1809 TEMPLATE_ID are non-members.
1811 If NEED_MEMBER_TEMPLATE is nonzero the function is known to be a
1812 specialization of a member template.
1814 The TEMPLATE_COUNT is the number of references to qualifying
1815 template classes that appeared in the name of the function. See
1816 check_explicit_specialization for a more accurate description.
1818 TSK indicates what kind of template declaration (if any) is being
1819 declared. TSK_TEMPLATE indicates that the declaration given by
1820 DECL, though a FUNCTION_DECL, has template parameters, and is
1821 therefore a template function.
1823 The template args (those explicitly specified and those deduced)
1824 are output in a newly created vector *TARGS_OUT.
1826 If it is impossible to determine the result, an error message is
1827 issued. The error_mark_node is returned to indicate failure. */
1830 determine_specialization (tree template_id
,
1833 int need_member_template
,
1839 tree explicit_targs
;
1840 tree candidates
= NULL_TREE
;
1841 /* A TREE_LIST of templates of which DECL may be a specialization.
1842 The TREE_VALUE of each node is a TEMPLATE_DECL. The
1843 corresponding TREE_PURPOSE is the set of template arguments that,
1844 when used to instantiate the template, would produce a function
1845 with the signature of DECL. */
1846 tree templates
= NULL_TREE
;
1848 cp_binding_level
*b
;
1850 *targs_out
= NULL_TREE
;
1852 if (template_id
== error_mark_node
|| decl
== error_mark_node
)
1853 return error_mark_node
;
1855 /* We shouldn't be specializing a member template of an
1856 unspecialized class template; we already gave an error in
1857 check_specialization_scope, now avoid crashing. */
1858 if (template_count
&& DECL_CLASS_SCOPE_P (decl
)
1859 && template_class_depth (DECL_CONTEXT (decl
)) > 0)
1861 gcc_assert (errorcount
);
1862 return error_mark_node
;
1865 fns
= TREE_OPERAND (template_id
, 0);
1866 explicit_targs
= TREE_OPERAND (template_id
, 1);
1868 if (fns
== error_mark_node
)
1869 return error_mark_node
;
1871 /* Check for baselinks. */
1872 if (BASELINK_P (fns
))
1873 fns
= BASELINK_FUNCTIONS (fns
);
1875 if (TREE_CODE (decl
) == FUNCTION_DECL
&& !is_overloaded_fn (fns
))
1877 error ("%qD is not a function template", fns
);
1878 return error_mark_node
;
1880 else if (VAR_P (decl
) && !variable_template_p (fns
))
1882 error ("%qD is not a variable template", fns
);
1883 return error_mark_node
;
1886 /* Count the number of template headers specified for this
1889 for (b
= current_binding_level
;
1890 b
->kind
== sk_template_parms
;
1894 if (variable_template_p (fns
))
1895 templates
= tree_cons (explicit_targs
, fns
, templates
);
1896 else for (; fns
; fns
= OVL_NEXT (fns
))
1898 tree fn
= OVL_CURRENT (fns
);
1900 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
1902 tree decl_arg_types
;
1906 /* In case of explicit specialization, we need to check if
1907 the number of template headers appearing in the specialization
1908 is correct. This is usually done in check_explicit_specialization,
1909 but the check done there cannot be exhaustive when specializing
1910 member functions. Consider the following code:
1912 template <> void A<int>::f(int);
1913 template <> template <> void A<int>::f(int);
1915 Assuming that A<int> is not itself an explicit specialization
1916 already, the first line specializes "f" which is a non-template
1917 member function, whilst the second line specializes "f" which
1918 is a template member function. So both lines are syntactically
1919 correct, and check_explicit_specialization does not reject
1922 Here, we can do better, as we are matching the specialization
1923 against the declarations. We count the number of template
1924 headers, and we check if they match TEMPLATE_COUNT + 1
1925 (TEMPLATE_COUNT is the number of qualifying template classes,
1926 plus there must be another header for the member template
1929 Notice that if header_count is zero, this is not a
1930 specialization but rather a template instantiation, so there
1931 is no check we can perform here. */
1932 if (header_count
&& header_count
!= template_count
+ 1)
1935 /* Check that the number of template arguments at the
1936 innermost level for DECL is the same as for FN. */
1937 if (current_binding_level
->kind
== sk_template_parms
1938 && !current_binding_level
->explicit_spec_p
1939 && (TREE_VEC_LENGTH (DECL_INNERMOST_TEMPLATE_PARMS (fn
))
1940 != TREE_VEC_LENGTH (INNERMOST_TEMPLATE_PARMS
1941 (current_template_parms
))))
1944 /* DECL might be a specialization of FN. */
1945 decl_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
1946 fn_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
1948 /* For a non-static member function, we need to make sure
1949 that the const qualification is the same. Since
1950 get_bindings does not try to merge the "this" parameter,
1951 we must do the comparison explicitly. */
1952 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
1953 && !same_type_p (TREE_VALUE (fn_arg_types
),
1954 TREE_VALUE (decl_arg_types
)))
1957 /* Skip the "this" parameter and, for constructors of
1958 classes with virtual bases, the VTT parameter. A
1959 full specialization of a constructor will have a VTT
1960 parameter, but a template never will. */
1962 = skip_artificial_parms_for (decl
, decl_arg_types
);
1964 = skip_artificial_parms_for (fn
, fn_arg_types
);
1966 /* Function templates cannot be specializations; there are
1967 no partial specializations of functions. Therefore, if
1968 the type of DECL does not match FN, there is no
1970 if (tsk
== tsk_template
)
1972 if (compparms (fn_arg_types
, decl_arg_types
))
1973 candidates
= tree_cons (NULL_TREE
, fn
, candidates
);
1977 /* See whether this function might be a specialization of this
1978 template. Suppress access control because we might be trying
1979 to make this specialization a friend, and we have already done
1980 access control for the declaration of the specialization. */
1981 push_deferring_access_checks (dk_no_check
);
1982 targs
= get_bindings (fn
, decl
, explicit_targs
, /*check_ret=*/true);
1983 pop_deferring_access_checks ();
1986 /* We cannot deduce template arguments that when used to
1987 specialize TMPL will produce DECL. */
1990 /* Make sure that the deduced arguments actually work. */
1991 insttype
= tsubst (TREE_TYPE (fn
), targs
, tf_none
, NULL_TREE
);
1992 if (insttype
== error_mark_node
)
1995 = skip_artificial_parms_for (fn
, TYPE_ARG_TYPES (insttype
));
1996 if (!compparms (fn_arg_types
, decl_arg_types
))
1999 /* Save this template, and the arguments deduced. */
2000 templates
= tree_cons (targs
, fn
, templates
);
2002 else if (need_member_template
)
2003 /* FN is an ordinary member function, and we need a
2004 specialization of a member template. */
2006 else if (TREE_CODE (fn
) != FUNCTION_DECL
)
2007 /* We can get IDENTIFIER_NODEs here in certain erroneous
2010 else if (!DECL_FUNCTION_MEMBER_P (fn
))
2011 /* This is just an ordinary non-member function. Nothing can
2012 be a specialization of that. */
2014 else if (DECL_ARTIFICIAL (fn
))
2015 /* Cannot specialize functions that are created implicitly. */
2019 tree decl_arg_types
;
2021 /* This is an ordinary member function. However, since
2022 we're here, we can assume its enclosing class is a
2023 template class. For example,
2025 template <typename T> struct S { void f(); };
2026 template <> void S<int>::f() {}
2028 Here, S<int>::f is a non-template, but S<int> is a
2029 template class. If FN has the same type as DECL, we
2030 might be in business. */
2032 if (!DECL_TEMPLATE_INFO (fn
))
2033 /* Its enclosing class is an explicit specialization
2034 of a template class. This is not a candidate. */
2037 if (!same_type_p (TREE_TYPE (TREE_TYPE (decl
)),
2038 TREE_TYPE (TREE_TYPE (fn
))))
2039 /* The return types differ. */
2042 /* Adjust the type of DECL in case FN is a static member. */
2043 decl_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
2044 if (DECL_STATIC_FUNCTION_P (fn
)
2045 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
2046 decl_arg_types
= TREE_CHAIN (decl_arg_types
);
2048 if (compparms (TYPE_ARG_TYPES (TREE_TYPE (fn
)),
2051 candidates
= tree_cons (NULL_TREE
, fn
, candidates
);
2055 if (templates
&& TREE_CHAIN (templates
))
2061 It is possible for a specialization with a given function
2062 signature to be instantiated from more than one function
2063 template. In such cases, explicit specification of the
2064 template arguments must be used to uniquely identify the
2065 function template specialization being specialized.
2067 Note that here, there's no suggestion that we're supposed to
2068 determine which of the candidate templates is most
2069 specialized. However, we, also have:
2073 Partial ordering of overloaded function template
2074 declarations is used in the following contexts to select
2075 the function template to which a function template
2076 specialization refers:
2078 -- when an explicit specialization refers to a function
2081 So, we do use the partial ordering rules, at least for now.
2082 This extension can only serve to make invalid programs valid,
2083 so it's safe. And, there is strong anecdotal evidence that
2084 the committee intended the partial ordering rules to apply;
2085 the EDG front end has that behavior, and John Spicer claims
2086 that the committee simply forgot to delete the wording in
2087 [temp.expl.spec]. */
2088 tree tmpl
= most_specialized_instantiation (templates
);
2089 if (tmpl
!= error_mark_node
)
2092 TREE_CHAIN (templates
) = NULL_TREE
;
2096 if (templates
== NULL_TREE
&& candidates
== NULL_TREE
)
2098 error ("template-id %qD for %q+D does not match any template "
2099 "declaration", template_id
, decl
);
2100 if (header_count
&& header_count
!= template_count
+ 1)
2101 inform (input_location
, "saw %d %<template<>%>, need %d for "
2102 "specializing a member function template",
2103 header_count
, template_count
+ 1);
2104 return error_mark_node
;
2106 else if ((templates
&& TREE_CHAIN (templates
))
2107 || (candidates
&& TREE_CHAIN (candidates
))
2108 || (templates
&& candidates
))
2110 error ("ambiguous template specialization %qD for %q+D",
2112 candidates
= chainon (candidates
, templates
);
2113 print_candidates (candidates
);
2114 return error_mark_node
;
2117 /* We have one, and exactly one, match. */
2120 tree fn
= TREE_VALUE (candidates
);
2121 *targs_out
= copy_node (DECL_TI_ARGS (fn
));
2122 /* DECL is a re-declaration or partial instantiation of a template
2124 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
2126 /* It was a specialization of an ordinary member function in a
2128 return DECL_TI_TEMPLATE (fn
);
2131 /* It was a specialization of a template. */
2132 targs
= DECL_TI_ARGS (DECL_TEMPLATE_RESULT (TREE_VALUE (templates
)));
2133 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (targs
))
2135 *targs_out
= copy_node (targs
);
2136 SET_TMPL_ARGS_LEVEL (*targs_out
,
2137 TMPL_ARGS_DEPTH (*targs_out
),
2138 TREE_PURPOSE (templates
));
2141 *targs_out
= TREE_PURPOSE (templates
);
2142 return TREE_VALUE (templates
);
2145 /* Returns a chain of parameter types, exactly like the SPEC_TYPES,
2146 but with the default argument values filled in from those in the
2150 copy_default_args_to_explicit_spec_1 (tree spec_types
,
2153 tree new_spec_types
;
2158 if (spec_types
== void_list_node
)
2159 return void_list_node
;
2161 /* Substitute into the rest of the list. */
2163 copy_default_args_to_explicit_spec_1 (TREE_CHAIN (spec_types
),
2164 TREE_CHAIN (tmpl_types
));
2166 /* Add the default argument for this parameter. */
2167 return hash_tree_cons (TREE_PURPOSE (tmpl_types
),
2168 TREE_VALUE (spec_types
),
2172 /* DECL is an explicit specialization. Replicate default arguments
2173 from the template it specializes. (That way, code like:
2175 template <class T> void f(T = 3);
2176 template <> void f(double);
2179 works, as required.) An alternative approach would be to look up
2180 the correct default arguments at the call-site, but this approach
2181 is consistent with how implicit instantiations are handled. */
2184 copy_default_args_to_explicit_spec (tree decl
)
2189 tree new_spec_types
;
2193 tree object_type
= NULL_TREE
;
2194 tree in_charge
= NULL_TREE
;
2195 tree vtt
= NULL_TREE
;
2197 /* See if there's anything we need to do. */
2198 tmpl
= DECL_TI_TEMPLATE (decl
);
2199 tmpl_types
= TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (tmpl
)));
2200 for (t
= tmpl_types
; t
; t
= TREE_CHAIN (t
))
2201 if (TREE_PURPOSE (t
))
2206 old_type
= TREE_TYPE (decl
);
2207 spec_types
= TYPE_ARG_TYPES (old_type
);
2209 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
2211 /* Remove the this pointer, but remember the object's type for
2213 object_type
= TREE_TYPE (TREE_VALUE (spec_types
));
2214 spec_types
= TREE_CHAIN (spec_types
);
2215 tmpl_types
= TREE_CHAIN (tmpl_types
);
2217 if (DECL_HAS_IN_CHARGE_PARM_P (decl
))
2219 /* DECL may contain more parameters than TMPL due to the extra
2220 in-charge parameter in constructors and destructors. */
2221 in_charge
= spec_types
;
2222 spec_types
= TREE_CHAIN (spec_types
);
2224 if (DECL_HAS_VTT_PARM_P (decl
))
2227 spec_types
= TREE_CHAIN (spec_types
);
2231 /* Compute the merged default arguments. */
2233 copy_default_args_to_explicit_spec_1 (spec_types
, tmpl_types
);
2235 /* Compute the new FUNCTION_TYPE. */
2239 new_spec_types
= hash_tree_cons (TREE_PURPOSE (vtt
),
2244 /* Put the in-charge parameter back. */
2245 new_spec_types
= hash_tree_cons (TREE_PURPOSE (in_charge
),
2246 TREE_VALUE (in_charge
),
2249 new_type
= build_method_type_directly (object_type
,
2250 TREE_TYPE (old_type
),
2254 new_type
= build_function_type (TREE_TYPE (old_type
),
2256 new_type
= cp_build_type_attribute_variant (new_type
,
2257 TYPE_ATTRIBUTES (old_type
));
2258 new_type
= build_exception_variant (new_type
,
2259 TYPE_RAISES_EXCEPTIONS (old_type
));
2261 if (TYPE_HAS_LATE_RETURN_TYPE (old_type
))
2262 TYPE_HAS_LATE_RETURN_TYPE (new_type
) = 1;
2264 TREE_TYPE (decl
) = new_type
;
2267 /* Return the number of template headers we expect to see for a definition
2268 or specialization of CTYPE or one of its non-template members. */
2271 num_template_headers_for_class (tree ctype
)
2273 int num_templates
= 0;
2275 while (ctype
&& CLASS_TYPE_P (ctype
))
2277 /* You're supposed to have one `template <...>' for every
2278 template class, but you don't need one for a full
2279 specialization. For example:
2281 template <class T> struct S{};
2282 template <> struct S<int> { void f(); };
2283 void S<int>::f () {}
2285 is correct; there shouldn't be a `template <>' for the
2286 definition of `S<int>::f'. */
2287 if (!CLASSTYPE_TEMPLATE_INFO (ctype
))
2288 /* If CTYPE does not have template information of any
2289 kind, then it is not a template, nor is it nested
2290 within a template. */
2292 if (explicit_class_specialization_p (ctype
))
2294 if (PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (ctype
)))
2297 ctype
= TYPE_CONTEXT (ctype
);
2300 return num_templates
;
2303 /* Do a simple sanity check on the template headers that precede the
2304 variable declaration DECL. */
2307 check_template_variable (tree decl
)
2309 tree ctx
= CP_DECL_CONTEXT (decl
);
2310 int wanted
= num_template_headers_for_class (ctx
);
2311 if (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
)
2312 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl
)))
2314 if (cxx_dialect
< cxx14
)
2315 pedwarn (DECL_SOURCE_LOCATION (decl
), 0,
2316 "variable templates only available with "
2317 "-std=c++14 or -std=gnu++14");
2319 // Namespace-scope variable templates should have a template header.
2322 if (template_header_count
> wanted
)
2324 bool warned
= pedwarn (DECL_SOURCE_LOCATION (decl
), 0,
2325 "too many template headers for %D (should be %d)",
2327 if (warned
&& CLASS_TYPE_P (ctx
)
2328 && CLASSTYPE_TEMPLATE_SPECIALIZATION (ctx
))
2329 inform (DECL_SOURCE_LOCATION (decl
),
2330 "members of an explicitly specialized class are defined "
2331 "without a template header");
2335 /* Check to see if the function just declared, as indicated in
2336 DECLARATOR, and in DECL, is a specialization of a function
2337 template. We may also discover that the declaration is an explicit
2338 instantiation at this point.
2340 Returns DECL, or an equivalent declaration that should be used
2341 instead if all goes well. Issues an error message if something is
2342 amiss. Returns error_mark_node if the error is not easily
2345 FLAGS is a bitmask consisting of the following flags:
2347 2: The function has a definition.
2348 4: The function is a friend.
2350 The TEMPLATE_COUNT is the number of references to qualifying
2351 template classes that appeared in the name of the function. For
2354 template <class T> struct S { void f(); };
2357 the TEMPLATE_COUNT would be 1. However, explicitly specialized
2358 classes are not counted in the TEMPLATE_COUNT, so that in
2360 template <class T> struct S {};
2361 template <> struct S<int> { void f(); }
2362 template <> void S<int>::f();
2364 the TEMPLATE_COUNT would be 0. (Note that this declaration is
2365 invalid; there should be no template <>.)
2367 If the function is a specialization, it is marked as such via
2368 DECL_TEMPLATE_SPECIALIZATION. Furthermore, its DECL_TEMPLATE_INFO
2369 is set up correctly, and it is added to the list of specializations
2370 for that template. */
2373 check_explicit_specialization (tree declarator
,
2378 int have_def
= flags
& 2;
2379 int is_friend
= flags
& 4;
2380 int specialization
= 0;
2381 int explicit_instantiation
= 0;
2382 int member_specialization
= 0;
2383 tree ctype
= DECL_CLASS_CONTEXT (decl
);
2384 tree dname
= DECL_NAME (decl
);
2389 if (!processing_specialization
)
2392 tsk
= tsk_excessive_parms
;
2395 tsk
= current_tmpl_spec_kind (template_count
);
2400 if (processing_specialization
)
2403 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
2405 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
2408 /* This could be something like:
2410 template <class T> void f(T);
2411 class S { friend void f<>(int); } */
2415 /* This case handles bogus declarations like template <>
2416 template <class T> void f<int>(); */
2418 error ("template-id %qD in declaration of primary template",
2425 case tsk_invalid_member_spec
:
2426 /* The error has already been reported in
2427 check_specialization_scope. */
2428 return error_mark_node
;
2430 case tsk_invalid_expl_inst
:
2431 error ("template parameter list used in explicit instantiation");
2437 error ("definition provided for explicit instantiation");
2439 explicit_instantiation
= 1;
2442 case tsk_excessive_parms
:
2443 case tsk_insufficient_parms
:
2444 if (tsk
== tsk_excessive_parms
)
2445 error ("too many template parameter lists in declaration of %qD",
2447 else if (template_header_count
)
2448 error("too few template parameter lists in declaration of %qD", decl
);
2450 error("explicit specialization of %qD must be introduced by "
2451 "%<template <>%>", decl
);
2455 if (VAR_P (decl
) && TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
2456 /* In cases like template<> constexpr bool v = true;
2457 We'll give an error in check_template_variable. */
2460 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
2462 member_specialization
= 1;
2468 if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
2470 /* This case handles bogus declarations like template <>
2471 template <class T> void f<int>(); */
2473 if (uses_template_parms (declarator
))
2474 error ("function template partial specialization %qD "
2475 "is not allowed", declarator
);
2477 error ("template-id %qD in declaration of primary template",
2482 if (ctype
&& CLASSTYPE_TEMPLATE_INSTANTIATION (ctype
))
2483 /* This is a specialization of a member template, without
2484 specialization the containing class. Something like:
2486 template <class T> struct S {
2487 template <class U> void f (U);
2489 template <> template <class U> void S<int>::f(U) {}
2491 That's a specialization -- but of the entire template. */
2499 if ((specialization
|| member_specialization
)
2500 /* This doesn't apply to variable templates. */
2501 && (TREE_CODE (TREE_TYPE (decl
)) == FUNCTION_TYPE
2502 || TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
))
2504 tree t
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
2505 for (; t
; t
= TREE_CHAIN (t
))
2506 if (TREE_PURPOSE (t
))
2508 permerror (input_location
,
2509 "default argument specified in explicit specialization");
2514 if (specialization
|| member_specialization
|| explicit_instantiation
)
2516 tree tmpl
= NULL_TREE
;
2517 tree targs
= NULL_TREE
;
2519 /* Make sure that the declarator is a TEMPLATE_ID_EXPR. */
2520 if (TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
2524 gcc_assert (identifier_p (declarator
));
2529 /* If there is no class context, the explicit instantiation
2530 must be at namespace scope. */
2531 gcc_assert (DECL_NAMESPACE_SCOPE_P (decl
));
2533 /* Find the namespace binding, using the declaration
2535 fns
= lookup_qualified_name (CP_DECL_CONTEXT (decl
), dname
,
2537 if (fns
== error_mark_node
|| !is_overloaded_fn (fns
))
2539 error ("%qD is not a template function", dname
);
2540 fns
= error_mark_node
;
2544 tree fn
= OVL_CURRENT (fns
);
2545 if (!is_associated_namespace (CP_DECL_CONTEXT (decl
),
2546 CP_DECL_CONTEXT (fn
)))
2547 error ("%qD is not declared in %qD",
2548 decl
, current_namespace
);
2552 declarator
= lookup_template_function (fns
, NULL_TREE
);
2555 if (declarator
== error_mark_node
)
2556 return error_mark_node
;
2558 if (ctype
!= NULL_TREE
&& TYPE_BEING_DEFINED (ctype
))
2560 if (!explicit_instantiation
)
2561 /* A specialization in class scope. This is invalid,
2562 but the error will already have been flagged by
2563 check_specialization_scope. */
2564 return error_mark_node
;
2567 /* It's not valid to write an explicit instantiation in
2570 class C { template void f(); }
2572 This case is caught by the parser. However, on
2575 template class C { void f(); };
2577 (which is invalid) we can get here. The error will be
2584 else if (ctype
!= NULL_TREE
2585 && (identifier_p (TREE_OPERAND (declarator
, 0))))
2587 // Ignore variable templates.
2591 /* Find the list of functions in ctype that have the same
2592 name as the declared function. */
2593 tree name
= TREE_OPERAND (declarator
, 0);
2594 tree fns
= NULL_TREE
;
2597 if (constructor_name_p (name
, ctype
))
2599 int is_constructor
= DECL_CONSTRUCTOR_P (decl
);
2601 if (is_constructor
? !TYPE_HAS_USER_CONSTRUCTOR (ctype
)
2602 : !CLASSTYPE_DESTRUCTORS (ctype
))
2604 /* From [temp.expl.spec]:
2606 If such an explicit specialization for the member
2607 of a class template names an implicitly-declared
2608 special member function (clause _special_), the
2609 program is ill-formed.
2611 Similar language is found in [temp.explicit]. */
2612 error ("specialization of implicitly-declared special member function");
2613 return error_mark_node
;
2616 name
= is_constructor
? ctor_identifier
: dtor_identifier
;
2619 if (!DECL_CONV_FN_P (decl
))
2621 idx
= lookup_fnfields_1 (ctype
, name
);
2623 fns
= (*CLASSTYPE_METHOD_VEC (ctype
))[idx
];
2627 vec
<tree
, va_gc
> *methods
;
2630 /* For a type-conversion operator, we cannot do a
2631 name-based lookup. We might be looking for `operator
2632 int' which will be a specialization of `operator T'.
2633 So, we find *all* the conversion operators, and then
2634 select from them. */
2637 methods
= CLASSTYPE_METHOD_VEC (ctype
);
2639 for (idx
= CLASSTYPE_FIRST_CONVERSION_SLOT
;
2640 methods
->iterate (idx
, &ovl
);
2643 if (!DECL_CONV_FN_P (OVL_CURRENT (ovl
)))
2644 /* There are no more conversion functions. */
2647 /* Glue all these conversion functions together
2648 with those we already have. */
2649 for (; ovl
; ovl
= OVL_NEXT (ovl
))
2650 fns
= ovl_cons (OVL_CURRENT (ovl
), fns
);
2654 if (fns
== NULL_TREE
)
2656 error ("no member function %qD declared in %qT", name
, ctype
);
2657 return error_mark_node
;
2660 TREE_OPERAND (declarator
, 0) = fns
;
2663 /* Figure out what exactly is being specialized at this point.
2664 Note that for an explicit instantiation, even one for a
2665 member function, we cannot tell apriori whether the
2666 instantiation is for a member template, or just a member
2667 function of a template class. Even if a member template is
2668 being instantiated, the member template arguments may be
2669 elided if they can be deduced from the rest of the
2671 tmpl
= determine_specialization (declarator
, decl
,
2673 member_specialization
,
2677 if (!tmpl
|| tmpl
== error_mark_node
)
2678 /* We couldn't figure out what this declaration was
2680 return error_mark_node
;
2683 tree gen_tmpl
= most_general_template (tmpl
);
2685 if (explicit_instantiation
)
2687 /* We don't set DECL_EXPLICIT_INSTANTIATION here; that
2688 is done by do_decl_instantiation later. */
2690 int arg_depth
= TMPL_ARGS_DEPTH (targs
);
2691 int parm_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
2693 if (arg_depth
> parm_depth
)
2695 /* If TMPL is not the most general template (for
2696 example, if TMPL is a friend template that is
2697 injected into namespace scope), then there will
2698 be too many levels of TARGS. Remove some of them
2703 new_targs
= make_tree_vec (parm_depth
);
2704 for (i
= arg_depth
- parm_depth
; i
< arg_depth
; ++i
)
2705 TREE_VEC_ELT (new_targs
, i
- (arg_depth
- parm_depth
))
2706 = TREE_VEC_ELT (targs
, i
);
2710 return instantiate_template (tmpl
, targs
, tf_error
);
2713 /* If we thought that the DECL was a member function, but it
2714 turns out to be specializing a static member function,
2715 make DECL a static member function as well. */
2716 if (DECL_FUNCTION_TEMPLATE_P (tmpl
)
2717 && DECL_STATIC_FUNCTION_P (tmpl
)
2718 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
2719 revert_static_member_fn (decl
);
2721 /* If this is a specialization of a member template of a
2722 template class, we want to return the TEMPLATE_DECL, not
2723 the specialization of it. */
2724 if (tsk
== tsk_template
)
2726 tree result
= DECL_TEMPLATE_RESULT (tmpl
);
2727 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
2728 DECL_INITIAL (result
) = NULL_TREE
;
2732 DECL_SOURCE_LOCATION (tmpl
) = DECL_SOURCE_LOCATION (decl
);
2733 DECL_SOURCE_LOCATION (result
)
2734 = DECL_SOURCE_LOCATION (decl
);
2735 /* We want to use the argument list specified in the
2736 definition, not in the original declaration. */
2737 DECL_ARGUMENTS (result
) = DECL_ARGUMENTS (decl
);
2738 for (parm
= DECL_ARGUMENTS (result
); parm
;
2739 parm
= DECL_CHAIN (parm
))
2740 DECL_CONTEXT (parm
) = result
;
2742 return register_specialization (tmpl
, gen_tmpl
, targs
,
2746 /* Set up the DECL_TEMPLATE_INFO for DECL. */
2747 DECL_TEMPLATE_INFO (decl
) = build_template_info (tmpl
, targs
);
2749 /* Inherit default function arguments from the template
2750 DECL is specializing. */
2751 if (DECL_FUNCTION_TEMPLATE_P (tmpl
))
2752 copy_default_args_to_explicit_spec (decl
);
2754 /* This specialization has the same protection as the
2755 template it specializes. */
2756 TREE_PRIVATE (decl
) = TREE_PRIVATE (gen_tmpl
);
2757 TREE_PROTECTED (decl
) = TREE_PROTECTED (gen_tmpl
);
2759 /* 7.1.1-1 [dcl.stc]
2761 A storage-class-specifier shall not be specified in an
2762 explicit specialization...
2764 The parser rejects these, so unless action is taken here,
2765 explicit function specializations will always appear with
2768 The action recommended by the C++ CWG in response to C++
2769 defect report 605 is to make the storage class and linkage
2770 of the explicit specialization match the templated function:
2772 http://www.open-std.org/jtc1/sc22/wg21/docs/cwg_active.html#605
2774 if (tsk
== tsk_expl_spec
&& DECL_FUNCTION_TEMPLATE_P (gen_tmpl
))
2776 tree tmpl_func
= DECL_TEMPLATE_RESULT (gen_tmpl
);
2777 gcc_assert (TREE_CODE (tmpl_func
) == FUNCTION_DECL
);
2779 /* This specialization has the same linkage and visibility as
2780 the function template it specializes. */
2781 TREE_PUBLIC (decl
) = TREE_PUBLIC (tmpl_func
);
2782 if (! TREE_PUBLIC (decl
))
2784 DECL_INTERFACE_KNOWN (decl
) = 1;
2785 DECL_NOT_REALLY_EXTERN (decl
) = 1;
2787 DECL_THIS_STATIC (decl
) = DECL_THIS_STATIC (tmpl_func
);
2788 if (DECL_VISIBILITY_SPECIFIED (tmpl_func
))
2790 DECL_VISIBILITY_SPECIFIED (decl
) = 1;
2791 DECL_VISIBILITY (decl
) = DECL_VISIBILITY (tmpl_func
);
2795 /* If DECL is a friend declaration, declared using an
2796 unqualified name, the namespace associated with DECL may
2797 have been set incorrectly. For example, in:
2799 template <typename T> void f(T);
2801 struct S { friend void f<int>(int); }
2804 we will have set the DECL_CONTEXT for the friend
2805 declaration to N, rather than to the global namespace. */
2806 if (DECL_NAMESPACE_SCOPE_P (decl
))
2807 DECL_CONTEXT (decl
) = DECL_CONTEXT (tmpl
);
2809 if (is_friend
&& !have_def
)
2810 /* This is not really a declaration of a specialization.
2811 It's just the name of an instantiation. But, it's not
2812 a request for an instantiation, either. */
2813 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
2814 else if (TREE_CODE (decl
) == FUNCTION_DECL
)
2815 /* A specialization is not necessarily COMDAT. */
2816 DECL_COMDAT (decl
) = DECL_DECLARED_INLINE_P (decl
);
2817 else if (TREE_CODE (decl
) == VAR_DECL
)
2818 DECL_COMDAT (decl
) = false;
2820 /* Register this specialization so that we can find it
2822 decl
= register_specialization (decl
, gen_tmpl
, targs
, is_friend
, 0);
2824 /* A 'structor should already have clones. */
2825 gcc_assert (decl
== error_mark_node
2826 || variable_template_p (tmpl
)
2827 || !(DECL_CONSTRUCTOR_P (decl
)
2828 || DECL_DESTRUCTOR_P (decl
))
2829 || DECL_CLONED_FUNCTION_P (DECL_CHAIN (decl
)));
2836 /* Returns 1 iff PARMS1 and PARMS2 are identical sets of template
2837 parameters. These are represented in the same format used for
2838 DECL_TEMPLATE_PARMS. */
2841 comp_template_parms (const_tree parms1
, const_tree parms2
)
2846 if (parms1
== parms2
)
2849 for (p1
= parms1
, p2
= parms2
;
2850 p1
!= NULL_TREE
&& p2
!= NULL_TREE
;
2851 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
))
2853 tree t1
= TREE_VALUE (p1
);
2854 tree t2
= TREE_VALUE (p2
);
2857 gcc_assert (TREE_CODE (t1
) == TREE_VEC
);
2858 gcc_assert (TREE_CODE (t2
) == TREE_VEC
);
2860 if (TREE_VEC_LENGTH (t1
) != TREE_VEC_LENGTH (t2
))
2863 for (i
= 0; i
< TREE_VEC_LENGTH (t2
); ++i
)
2865 tree parm1
= TREE_VALUE (TREE_VEC_ELT (t1
, i
));
2866 tree parm2
= TREE_VALUE (TREE_VEC_ELT (t2
, i
));
2868 /* If either of the template parameters are invalid, assume
2869 they match for the sake of error recovery. */
2870 if (error_operand_p (parm1
) || error_operand_p (parm2
))
2873 if (TREE_CODE (parm1
) != TREE_CODE (parm2
))
2876 if (TREE_CODE (parm1
) == TEMPLATE_TYPE_PARM
2877 && (TEMPLATE_TYPE_PARAMETER_PACK (parm1
)
2878 == TEMPLATE_TYPE_PARAMETER_PACK (parm2
)))
2880 else if (!same_type_p (TREE_TYPE (parm1
), TREE_TYPE (parm2
)))
2885 if ((p1
!= NULL_TREE
) != (p2
!= NULL_TREE
))
2886 /* One set of parameters has more parameters lists than the
2893 /* Determine whether PARM is a parameter pack. */
2896 template_parameter_pack_p (const_tree parm
)
2898 /* Determine if we have a non-type template parameter pack. */
2899 if (TREE_CODE (parm
) == PARM_DECL
)
2900 return (DECL_TEMPLATE_PARM_P (parm
)
2901 && TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)));
2902 if (TREE_CODE (parm
) == TEMPLATE_PARM_INDEX
)
2903 return TEMPLATE_PARM_PARAMETER_PACK (parm
);
2905 /* If this is a list of template parameters, we could get a
2906 TYPE_DECL or a TEMPLATE_DECL. */
2907 if (TREE_CODE (parm
) == TYPE_DECL
|| TREE_CODE (parm
) == TEMPLATE_DECL
)
2908 parm
= TREE_TYPE (parm
);
2910 /* Otherwise it must be a type template parameter. */
2911 return ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
2912 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
)
2913 && TEMPLATE_TYPE_PARAMETER_PACK (parm
));
2916 /* Determine if T is a function parameter pack. */
2919 function_parameter_pack_p (const_tree t
)
2921 if (t
&& TREE_CODE (t
) == PARM_DECL
)
2922 return DECL_PACK_P (t
);
2926 /* Return the function template declaration of PRIMARY_FUNC_TMPL_INST.
2927 PRIMARY_FUNC_TMPL_INST is a primary function template instantiation. */
2930 get_function_template_decl (const_tree primary_func_tmpl_inst
)
2932 if (! primary_func_tmpl_inst
2933 || TREE_CODE (primary_func_tmpl_inst
) != FUNCTION_DECL
2934 || ! primary_template_instantiation_p (primary_func_tmpl_inst
))
2937 return DECL_TEMPLATE_RESULT (DECL_TI_TEMPLATE (primary_func_tmpl_inst
));
2940 /* Return true iff the function parameter PARAM_DECL was expanded
2941 from the function parameter pack PACK. */
2944 function_parameter_expanded_from_pack_p (tree param_decl
, tree pack
)
2946 if (DECL_ARTIFICIAL (param_decl
)
2947 || !function_parameter_pack_p (pack
))
2950 /* The parameter pack and its pack arguments have the same
2952 return DECL_PARM_INDEX (pack
) == DECL_PARM_INDEX (param_decl
);
2955 /* Determine whether ARGS describes a variadic template args list,
2956 i.e., one that is terminated by a template argument pack. */
2959 template_args_variadic_p (tree args
)
2964 if (args
== NULL_TREE
)
2967 args
= INNERMOST_TEMPLATE_ARGS (args
);
2968 nargs
= TREE_VEC_LENGTH (args
);
2973 last_parm
= TREE_VEC_ELT (args
, nargs
- 1);
2975 return ARGUMENT_PACK_P (last_parm
);
2978 /* Generate a new name for the parameter pack name NAME (an
2979 IDENTIFIER_NODE) that incorporates its */
2982 make_ith_pack_parameter_name (tree name
, int i
)
2984 /* Munge the name to include the parameter index. */
2985 #define NUMBUF_LEN 128
2986 char numbuf
[NUMBUF_LEN
];
2990 if (name
== NULL_TREE
)
2992 snprintf (numbuf
, NUMBUF_LEN
, "%i", i
);
2993 newname_len
= IDENTIFIER_LENGTH (name
)
2994 + strlen (numbuf
) + 2;
2995 newname
= (char*)alloca (newname_len
);
2996 snprintf (newname
, newname_len
,
2997 "%s#%i", IDENTIFIER_POINTER (name
), i
);
2998 return get_identifier (newname
);
3001 /* Return true if T is a primary function, class or alias template
3005 primary_template_instantiation_p (const_tree t
)
3010 if (TREE_CODE (t
) == FUNCTION_DECL
)
3011 return DECL_LANG_SPECIFIC (t
)
3012 && DECL_TEMPLATE_INSTANTIATION (t
)
3013 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (t
));
3014 else if (CLASS_TYPE_P (t
) && !TYPE_DECL_ALIAS_P (TYPE_NAME (t
)))
3015 return CLASSTYPE_TEMPLATE_INSTANTIATION (t
)
3016 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (t
));
3017 else if (alias_template_specialization_p (t
))
3022 /* Return true if PARM is a template template parameter. */
3025 template_template_parameter_p (const_tree parm
)
3027 return DECL_TEMPLATE_TEMPLATE_PARM_P (parm
);
3030 /* Return true iff PARM is a DECL representing a type template
3034 template_type_parameter_p (const_tree parm
)
3037 && (TREE_CODE (parm
) == TYPE_DECL
3038 || TREE_CODE (parm
) == TEMPLATE_DECL
)
3039 && DECL_TEMPLATE_PARM_P (parm
));
3042 /* Return the template parameters of T if T is a
3043 primary template instantiation, NULL otherwise. */
3046 get_primary_template_innermost_parameters (const_tree t
)
3048 tree parms
= NULL
, template_info
= NULL
;
3050 if ((template_info
= get_template_info (t
))
3051 && primary_template_instantiation_p (t
))
3052 parms
= INNERMOST_TEMPLATE_PARMS
3053 (DECL_TEMPLATE_PARMS (TI_TEMPLATE (template_info
)));
3058 /* Return the template parameters of the LEVELth level from the full list
3059 of template parameters PARMS. */
3062 get_template_parms_at_level (tree parms
, int level
)
3066 || TREE_CODE (parms
) != TREE_LIST
3067 || level
> TMPL_PARMS_DEPTH (parms
))
3070 for (p
= parms
; p
; p
= TREE_CHAIN (p
))
3071 if (TMPL_PARMS_DEPTH (p
) == level
)
3077 /* Returns the template arguments of T if T is a template instantiation,
3081 get_template_innermost_arguments (const_tree t
)
3083 tree args
= NULL
, template_info
= NULL
;
3085 if ((template_info
= get_template_info (t
))
3086 && TI_ARGS (template_info
))
3087 args
= INNERMOST_TEMPLATE_ARGS (TI_ARGS (template_info
));
3092 /* Return the argument pack elements of T if T is a template argument pack,
3096 get_template_argument_pack_elems (const_tree t
)
3098 if (TREE_CODE (t
) != TYPE_ARGUMENT_PACK
3099 && TREE_CODE (t
) != NONTYPE_ARGUMENT_PACK
)
3102 return ARGUMENT_PACK_ARGS (t
);
3105 /* Structure used to track the progress of find_parameter_packs_r. */
3106 struct find_parameter_pack_data
3108 /* TREE_LIST that will contain all of the parameter packs found by
3110 tree
* parameter_packs
;
3112 /* Set of AST nodes that have been visited by the traversal. */
3113 hash_set
<tree
> *visited
;
3116 /* Identifies all of the argument packs that occur in a template
3117 argument and appends them to the TREE_LIST inside DATA, which is a
3118 find_parameter_pack_data structure. This is a subroutine of
3119 make_pack_expansion and uses_parameter_packs. */
3121 find_parameter_packs_r (tree
*tp
, int *walk_subtrees
, void* data
)
3124 struct find_parameter_pack_data
* ppd
=
3125 (struct find_parameter_pack_data
*)data
;
3126 bool parameter_pack_p
= false;
3128 /* Handle type aliases/typedefs. */
3129 if (TYPE_ALIAS_P (t
))
3131 if (TYPE_TEMPLATE_INFO (t
))
3132 cp_walk_tree (&TYPE_TI_ARGS (t
),
3133 &find_parameter_packs_r
,
3139 /* Identify whether this is a parameter pack or not. */
3140 switch (TREE_CODE (t
))
3142 case TEMPLATE_PARM_INDEX
:
3143 if (TEMPLATE_PARM_PARAMETER_PACK (t
))
3144 parameter_pack_p
= true;
3147 case TEMPLATE_TYPE_PARM
:
3148 t
= TYPE_MAIN_VARIANT (t
);
3149 case TEMPLATE_TEMPLATE_PARM
:
3150 if (TEMPLATE_TYPE_PARAMETER_PACK (t
))
3151 parameter_pack_p
= true;
3156 if (DECL_PACK_P (t
))
3158 /* We don't want to walk into the type of a PARM_DECL,
3159 because we don't want to see the type parameter pack. */
3161 parameter_pack_p
= true;
3165 /* Look through a lambda capture proxy to the field pack. */
3167 if (DECL_HAS_VALUE_EXPR_P (t
))
3169 tree v
= DECL_VALUE_EXPR (t
);
3171 &find_parameter_packs_r
,
3178 parameter_pack_p
= true;
3181 /* Not a parameter pack. */
3185 if (parameter_pack_p
)
3187 /* Add this parameter pack to the list. */
3188 *ppd
->parameter_packs
= tree_cons (NULL_TREE
, t
, *ppd
->parameter_packs
);
3192 cp_walk_tree (&TYPE_CONTEXT (t
),
3193 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3195 /* This switch statement will return immediately if we don't find a
3197 switch (TREE_CODE (t
))
3199 case TEMPLATE_PARM_INDEX
:
3202 case BOUND_TEMPLATE_TEMPLATE_PARM
:
3203 /* Check the template itself. */
3204 cp_walk_tree (&TREE_TYPE (TYPE_TI_TEMPLATE (t
)),
3205 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3206 /* Check the template arguments. */
3207 cp_walk_tree (&TYPE_TI_ARGS (t
), &find_parameter_packs_r
, ppd
,
3212 case TEMPLATE_TYPE_PARM
:
3213 case TEMPLATE_TEMPLATE_PARM
:
3220 if (TYPE_PTRMEMFUNC_P (t
))
3226 if (TYPE_TEMPLATE_INFO (t
))
3227 cp_walk_tree (&TYPE_TI_ARGS (t
),
3228 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3235 cp_walk_tree (&TREE_TYPE (t
),
3236 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3240 cp_walk_tree (&TYPENAME_TYPE_FULLNAME (t
), &find_parameter_packs_r
,
3245 case TYPE_PACK_EXPANSION
:
3246 case EXPR_PACK_EXPANSION
:
3251 cp_walk_tree (&TYPE_MAX_VALUE (t
), &find_parameter_packs_r
,
3256 case IDENTIFIER_NODE
:
3257 cp_walk_tree (&TREE_TYPE (t
), &find_parameter_packs_r
, ppd
,
3269 /* Determines if the expression or type T uses any parameter packs. */
3271 uses_parameter_packs (tree t
)
3273 tree parameter_packs
= NULL_TREE
;
3274 struct find_parameter_pack_data ppd
;
3275 ppd
.parameter_packs
= ¶meter_packs
;
3276 ppd
.visited
= new hash_set
<tree
>;
3277 cp_walk_tree (&t
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
3279 return parameter_packs
!= NULL_TREE
;
3282 /* Turn ARG, which may be an expression, type, or a TREE_LIST
3283 representation a base-class initializer into a parameter pack
3284 expansion. If all goes well, the resulting node will be an
3285 EXPR_PACK_EXPANSION, TYPE_PACK_EXPANSION, or TREE_LIST,
3288 make_pack_expansion (tree arg
)
3291 tree parameter_packs
= NULL_TREE
;
3292 bool for_types
= false;
3293 struct find_parameter_pack_data ppd
;
3295 if (!arg
|| arg
== error_mark_node
)
3298 if (TREE_CODE (arg
) == TREE_LIST
)
3300 /* The only time we will see a TREE_LIST here is for a base
3301 class initializer. In this case, the TREE_PURPOSE will be a
3302 _TYPE node (representing the base class expansion we're
3303 initializing) and the TREE_VALUE will be a TREE_LIST
3304 containing the initialization arguments.
3306 The resulting expansion looks somewhat different from most
3307 expansions. Rather than returning just one _EXPANSION, we
3308 return a TREE_LIST whose TREE_PURPOSE is a
3309 TYPE_PACK_EXPANSION containing the bases that will be
3310 initialized. The TREE_VALUE will be identical to the
3311 original TREE_VALUE, which is a list of arguments that will
3312 be passed to each base. We do not introduce any new pack
3313 expansion nodes into the TREE_VALUE (although it is possible
3314 that some already exist), because the TREE_PURPOSE and
3315 TREE_VALUE all need to be expanded together with the same
3316 _EXPANSION node. Note that the TYPE_PACK_EXPANSION in the
3317 resulting TREE_PURPOSE will mention the parameter packs in
3318 both the bases and the arguments to the bases. */
3321 tree parameter_packs
= NULL_TREE
;
3323 /* Determine which parameter packs will be used by the base
3325 ppd
.visited
= new hash_set
<tree
>;
3326 ppd
.parameter_packs
= ¶meter_packs
;
3327 cp_walk_tree (&TREE_PURPOSE (arg
), &find_parameter_packs_r
,
3330 if (parameter_packs
== NULL_TREE
)
3332 error ("base initializer expansion %<%T%> contains no parameter packs", arg
);
3334 return error_mark_node
;
3337 if (TREE_VALUE (arg
) != void_type_node
)
3339 /* Collect the sets of parameter packs used in each of the
3340 initialization arguments. */
3341 for (value
= TREE_VALUE (arg
); value
; value
= TREE_CHAIN (value
))
3343 /* Determine which parameter packs will be expanded in this
3345 cp_walk_tree (&TREE_VALUE (value
), &find_parameter_packs_r
,
3352 /* Create the pack expansion type for the base type. */
3353 purpose
= cxx_make_type (TYPE_PACK_EXPANSION
);
3354 SET_PACK_EXPANSION_PATTERN (purpose
, TREE_PURPOSE (arg
));
3355 PACK_EXPANSION_PARAMETER_PACKS (purpose
) = parameter_packs
;
3357 /* Just use structural equality for these TYPE_PACK_EXPANSIONS;
3358 they will rarely be compared to anything. */
3359 SET_TYPE_STRUCTURAL_EQUALITY (purpose
);
3361 return tree_cons (purpose
, TREE_VALUE (arg
), NULL_TREE
);
3364 if (TYPE_P (arg
) || TREE_CODE (arg
) == TEMPLATE_DECL
)
3367 /* Build the PACK_EXPANSION_* node. */
3369 ? cxx_make_type (TYPE_PACK_EXPANSION
)
3370 : make_node (EXPR_PACK_EXPANSION
);
3371 SET_PACK_EXPANSION_PATTERN (result
, arg
);
3372 if (TREE_CODE (result
) == EXPR_PACK_EXPANSION
)
3374 /* Propagate type and const-expression information. */
3375 TREE_TYPE (result
) = TREE_TYPE (arg
);
3376 TREE_CONSTANT (result
) = TREE_CONSTANT (arg
);
3379 /* Just use structural equality for these TYPE_PACK_EXPANSIONS;
3380 they will rarely be compared to anything. */
3381 SET_TYPE_STRUCTURAL_EQUALITY (result
);
3383 /* Determine which parameter packs will be expanded. */
3384 ppd
.parameter_packs
= ¶meter_packs
;
3385 ppd
.visited
= new hash_set
<tree
>;
3386 cp_walk_tree (&arg
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
3389 /* Make sure we found some parameter packs. */
3390 if (parameter_packs
== NULL_TREE
)
3393 error ("expansion pattern %<%T%> contains no argument packs", arg
);
3395 error ("expansion pattern %<%E%> contains no argument packs", arg
);
3396 return error_mark_node
;
3398 PACK_EXPANSION_PARAMETER_PACKS (result
) = parameter_packs
;
3400 PACK_EXPANSION_LOCAL_P (result
) = at_function_scope_p ();
3405 /* Checks T for any "bare" parameter packs, which have not yet been
3406 expanded, and issues an error if any are found. This operation can
3407 only be done on full expressions or types (e.g., an expression
3408 statement, "if" condition, etc.), because we could have expressions like:
3410 foo(f(g(h(args)))...)
3412 where "args" is a parameter pack. check_for_bare_parameter_packs
3413 should not be called for the subexpressions args, h(args),
3414 g(h(args)), or f(g(h(args))), because we would produce erroneous
3417 Returns TRUE and emits an error if there were bare parameter packs,
3418 returns FALSE otherwise. */
3420 check_for_bare_parameter_packs (tree t
)
3422 tree parameter_packs
= NULL_TREE
;
3423 struct find_parameter_pack_data ppd
;
3425 if (!processing_template_decl
|| !t
|| t
== error_mark_node
)
3428 if (TREE_CODE (t
) == TYPE_DECL
)
3431 ppd
.parameter_packs
= ¶meter_packs
;
3432 ppd
.visited
= new hash_set
<tree
>;
3433 cp_walk_tree (&t
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
3436 if (parameter_packs
)
3438 error ("parameter packs not expanded with %<...%>:");
3439 while (parameter_packs
)
3441 tree pack
= TREE_VALUE (parameter_packs
);
3442 tree name
= NULL_TREE
;
3444 if (TREE_CODE (pack
) == TEMPLATE_TYPE_PARM
3445 || TREE_CODE (pack
) == TEMPLATE_TEMPLATE_PARM
)
3446 name
= TYPE_NAME (pack
);
3447 else if (TREE_CODE (pack
) == TEMPLATE_PARM_INDEX
)
3448 name
= DECL_NAME (TEMPLATE_PARM_DECL (pack
));
3450 name
= DECL_NAME (pack
);
3453 inform (input_location
, " %qD", name
);
3455 inform (input_location
, " <anonymous>");
3457 parameter_packs
= TREE_CHAIN (parameter_packs
);
3466 /* Expand any parameter packs that occur in the template arguments in
3469 expand_template_argument_pack (tree args
)
3471 tree result_args
= NULL_TREE
;
3472 int in_arg
, out_arg
= 0, nargs
= args
? TREE_VEC_LENGTH (args
) : 0;
3473 int num_result_args
= -1;
3474 int non_default_args_count
= -1;
3476 /* First, determine if we need to expand anything, and the number of
3477 slots we'll need. */
3478 for (in_arg
= 0; in_arg
< nargs
; ++in_arg
)
3480 tree arg
= TREE_VEC_ELT (args
, in_arg
);
3481 if (arg
== NULL_TREE
)
3483 if (ARGUMENT_PACK_P (arg
))
3485 int num_packed
= TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg
));
3486 if (num_result_args
< 0)
3487 num_result_args
= in_arg
+ num_packed
;
3489 num_result_args
+= num_packed
;
3493 if (num_result_args
>= 0)
3498 /* If no expansion is necessary, we're done. */
3499 if (num_result_args
< 0)
3502 /* Expand arguments. */
3503 result_args
= make_tree_vec (num_result_args
);
3504 if (NON_DEFAULT_TEMPLATE_ARGS_COUNT (args
))
3505 non_default_args_count
=
3506 GET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (args
);
3507 for (in_arg
= 0; in_arg
< nargs
; ++in_arg
)
3509 tree arg
= TREE_VEC_ELT (args
, in_arg
);
3510 if (ARGUMENT_PACK_P (arg
))
3512 tree packed
= ARGUMENT_PACK_ARGS (arg
);
3513 int i
, num_packed
= TREE_VEC_LENGTH (packed
);
3514 for (i
= 0; i
< num_packed
; ++i
, ++out_arg
)
3515 TREE_VEC_ELT (result_args
, out_arg
) = TREE_VEC_ELT(packed
, i
);
3516 if (non_default_args_count
> 0)
3517 non_default_args_count
+= num_packed
- 1;
3521 TREE_VEC_ELT (result_args
, out_arg
) = arg
;
3525 if (non_default_args_count
>= 0)
3526 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (result_args
, non_default_args_count
);
3530 /* Checks if DECL shadows a template parameter.
3532 [temp.local]: A template-parameter shall not be redeclared within its
3533 scope (including nested scopes).
3535 Emits an error and returns TRUE if the DECL shadows a parameter,
3536 returns FALSE otherwise. */
3539 check_template_shadow (tree decl
)
3543 /* If we're not in a template, we can't possibly shadow a template
3545 if (!current_template_parms
)
3548 /* Figure out what we're shadowing. */
3549 if (TREE_CODE (decl
) == OVERLOAD
)
3550 decl
= OVL_CURRENT (decl
);
3551 olddecl
= innermost_non_namespace_value (DECL_NAME (decl
));
3553 /* If there's no previous binding for this name, we're not shadowing
3554 anything, let alone a template parameter. */
3558 /* If we're not shadowing a template parameter, we're done. Note
3559 that OLDDECL might be an OVERLOAD (or perhaps even an
3560 ERROR_MARK), so we can't just blithely assume it to be a _DECL
3562 if (!DECL_P (olddecl
) || !DECL_TEMPLATE_PARM_P (olddecl
))
3565 /* We check for decl != olddecl to avoid bogus errors for using a
3566 name inside a class. We check TPFI to avoid duplicate errors for
3567 inline member templates. */
3569 || (DECL_TEMPLATE_PARM_P (decl
)
3570 && TEMPLATE_PARMS_FOR_INLINE (current_template_parms
)))
3573 /* Don't complain about the injected class name, as we've already
3574 complained about the class itself. */
3575 if (DECL_SELF_REFERENCE_P (decl
))
3578 error ("declaration of %q+#D", decl
);
3579 error (" shadows template parm %q+#D", olddecl
);
3583 /* Return a new TEMPLATE_PARM_INDEX with the indicated INDEX, LEVEL,
3584 ORIG_LEVEL, DECL, and TYPE. */
3587 build_template_parm_index (int index
,
3593 tree t
= make_node (TEMPLATE_PARM_INDEX
);
3594 TEMPLATE_PARM_IDX (t
) = index
;
3595 TEMPLATE_PARM_LEVEL (t
) = level
;
3596 TEMPLATE_PARM_ORIG_LEVEL (t
) = orig_level
;
3597 TEMPLATE_PARM_DECL (t
) = decl
;
3598 TREE_TYPE (t
) = type
;
3599 TREE_CONSTANT (t
) = TREE_CONSTANT (decl
);
3600 TREE_READONLY (t
) = TREE_READONLY (decl
);
3605 /* Find the canonical type parameter for the given template type
3606 parameter. Returns the canonical type parameter, which may be TYPE
3607 if no such parameter existed. */
3610 canonical_type_parameter (tree type
)
3613 int idx
= TEMPLATE_TYPE_IDX (type
);
3614 if (!canonical_template_parms
)
3615 vec_alloc (canonical_template_parms
, idx
+1);
3617 while (canonical_template_parms
->length () <= (unsigned)idx
)
3618 vec_safe_push (canonical_template_parms
, NULL_TREE
);
3620 list
= (*canonical_template_parms
)[idx
];
3621 while (list
&& !comptypes (type
, TREE_VALUE (list
), COMPARE_STRUCTURAL
))
3622 list
= TREE_CHAIN (list
);
3625 return TREE_VALUE (list
);
3628 (*canonical_template_parms
)[idx
]
3629 = tree_cons (NULL_TREE
, type
,
3630 (*canonical_template_parms
)[idx
]);
3635 /* Return a TEMPLATE_PARM_INDEX, similar to INDEX, but whose
3636 TEMPLATE_PARM_LEVEL has been decreased by LEVELS. If such a
3637 TEMPLATE_PARM_INDEX already exists, it is returned; otherwise, a
3638 new one is created. */
3641 reduce_template_parm_level (tree index
, tree type
, int levels
, tree args
,
3642 tsubst_flags_t complain
)
3644 if (TEMPLATE_PARM_DESCENDANTS (index
) == NULL_TREE
3645 || (TEMPLATE_PARM_LEVEL (TEMPLATE_PARM_DESCENDANTS (index
))
3646 != TEMPLATE_PARM_LEVEL (index
) - levels
)
3647 || !same_type_p (type
, TREE_TYPE (TEMPLATE_PARM_DESCENDANTS (index
))))
3649 tree orig_decl
= TEMPLATE_PARM_DECL (index
);
3652 decl
= build_decl (DECL_SOURCE_LOCATION (orig_decl
),
3653 TREE_CODE (orig_decl
), DECL_NAME (orig_decl
), type
);
3654 TREE_CONSTANT (decl
) = TREE_CONSTANT (orig_decl
);
3655 TREE_READONLY (decl
) = TREE_READONLY (orig_decl
);
3656 DECL_ARTIFICIAL (decl
) = 1;
3657 SET_DECL_TEMPLATE_PARM_P (decl
);
3659 t
= build_template_parm_index (TEMPLATE_PARM_IDX (index
),
3660 TEMPLATE_PARM_LEVEL (index
) - levels
,
3661 TEMPLATE_PARM_ORIG_LEVEL (index
),
3663 TEMPLATE_PARM_DESCENDANTS (index
) = t
;
3664 TEMPLATE_PARM_PARAMETER_PACK (t
)
3665 = TEMPLATE_PARM_PARAMETER_PACK (index
);
3667 /* Template template parameters need this. */
3668 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
3669 DECL_TEMPLATE_PARMS (decl
) = tsubst_template_parms
3670 (DECL_TEMPLATE_PARMS (TEMPLATE_PARM_DECL (index
)),
3674 return TEMPLATE_PARM_DESCENDANTS (index
);
3677 /* Process information from new template parameter PARM and append it
3678 to the LIST being built. This new parameter is a non-type
3679 parameter iff IS_NON_TYPE is true. This new parameter is a
3680 parameter pack iff IS_PARAMETER_PACK is true. The location of PARM
3684 process_template_parm (tree list
, location_t parm_loc
, tree parm
,
3685 bool is_non_type
, bool is_parameter_pack
)
3691 gcc_assert (TREE_CODE (parm
) == TREE_LIST
);
3692 defval
= TREE_PURPOSE (parm
);
3696 tree p
= tree_last (list
);
3698 if (p
&& TREE_VALUE (p
) != error_mark_node
)
3701 if (TREE_CODE (p
) == TYPE_DECL
|| TREE_CODE (p
) == TEMPLATE_DECL
)
3702 idx
= TEMPLATE_TYPE_IDX (TREE_TYPE (p
));
3704 idx
= TEMPLATE_PARM_IDX (DECL_INITIAL (p
));
3712 parm
= TREE_VALUE (parm
);
3714 SET_DECL_TEMPLATE_PARM_P (parm
);
3716 if (TREE_TYPE (parm
) != error_mark_node
)
3720 The top-level cv-qualifiers on the template-parameter are
3721 ignored when determining its type. */
3722 TREE_TYPE (parm
) = TYPE_MAIN_VARIANT (TREE_TYPE (parm
));
3723 if (invalid_nontype_parm_type_p (TREE_TYPE (parm
), 1))
3724 TREE_TYPE (parm
) = error_mark_node
;
3725 else if (uses_parameter_packs (TREE_TYPE (parm
))
3726 && !is_parameter_pack
3727 /* If we're in a nested template parameter list, the template
3728 template parameter could be a parameter pack. */
3729 && processing_template_parmlist
== 1)
3731 /* This template parameter is not a parameter pack, but it
3732 should be. Complain about "bare" parameter packs. */
3733 check_for_bare_parameter_packs (TREE_TYPE (parm
));
3735 /* Recover by calling this a parameter pack. */
3736 is_parameter_pack
= true;
3740 /* A template parameter is not modifiable. */
3741 TREE_CONSTANT (parm
) = 1;
3742 TREE_READONLY (parm
) = 1;
3743 decl
= build_decl (parm_loc
,
3744 CONST_DECL
, DECL_NAME (parm
), TREE_TYPE (parm
));
3745 TREE_CONSTANT (decl
) = 1;
3746 TREE_READONLY (decl
) = 1;
3747 DECL_INITIAL (parm
) = DECL_INITIAL (decl
)
3748 = build_template_parm_index (idx
, processing_template_decl
,
3749 processing_template_decl
,
3750 decl
, TREE_TYPE (parm
));
3752 TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
))
3753 = is_parameter_pack
;
3758 parm
= TREE_VALUE (TREE_VALUE (parm
));
3760 if (parm
&& TREE_CODE (parm
) == TEMPLATE_DECL
)
3762 t
= cxx_make_type (TEMPLATE_TEMPLATE_PARM
);
3763 /* This is for distinguishing between real templates and template
3764 template parameters */
3765 TREE_TYPE (parm
) = t
;
3766 TREE_TYPE (DECL_TEMPLATE_RESULT (parm
)) = t
;
3771 t
= cxx_make_type (TEMPLATE_TYPE_PARM
);
3772 /* parm is either IDENTIFIER_NODE or NULL_TREE. */
3773 decl
= build_decl (parm_loc
,
3774 TYPE_DECL
, parm
, t
);
3777 TYPE_NAME (t
) = decl
;
3778 TYPE_STUB_DECL (t
) = decl
;
3780 TEMPLATE_TYPE_PARM_INDEX (t
)
3781 = build_template_parm_index (idx
, processing_template_decl
,
3782 processing_template_decl
,
3783 decl
, TREE_TYPE (parm
));
3784 TEMPLATE_TYPE_PARAMETER_PACK (t
) = is_parameter_pack
;
3785 TYPE_CANONICAL (t
) = canonical_type_parameter (t
);
3787 DECL_ARTIFICIAL (decl
) = 1;
3788 SET_DECL_TEMPLATE_PARM_P (decl
);
3790 parm
= build_tree_list (defval
, parm
);
3791 return chainon (list
, parm
);
3794 /* The end of a template parameter list has been reached. Process the
3795 tree list into a parameter vector, converting each parameter into a more
3796 useful form. Type parameters are saved as IDENTIFIER_NODEs, and others
3800 end_template_parm_list (tree parms
)
3804 tree saved_parmlist
= make_tree_vec (list_length (parms
));
3806 current_template_parms
3807 = tree_cons (size_int (processing_template_decl
),
3808 saved_parmlist
, current_template_parms
);
3810 for (parm
= parms
, nparms
= 0; parm
; parm
= next
, nparms
++)
3812 next
= TREE_CHAIN (parm
);
3813 TREE_VEC_ELT (saved_parmlist
, nparms
) = parm
;
3814 TREE_CHAIN (parm
) = NULL_TREE
;
3817 --processing_template_parmlist
;
3819 return saved_parmlist
;
3822 /* end_template_decl is called after a template declaration is seen. */
3825 end_template_decl (void)
3827 reset_specialization ();
3829 if (! processing_template_decl
)
3832 /* This matches the pushlevel in begin_template_parm_list. */
3835 --processing_template_decl
;
3836 current_template_parms
= TREE_CHAIN (current_template_parms
);
3839 /* Takes a TREE_LIST representing a template parameter and convert it
3840 into an argument suitable to be passed to the type substitution
3841 functions. Note that If the TREE_LIST contains an error_mark
3842 node, the returned argument is error_mark_node. */
3845 template_parm_to_arg (tree t
)
3849 || TREE_CODE (t
) != TREE_LIST
)
3852 if (error_operand_p (TREE_VALUE (t
)))
3853 return error_mark_node
;
3857 if (TREE_CODE (t
) == TYPE_DECL
3858 || TREE_CODE (t
) == TEMPLATE_DECL
)
3862 if (TEMPLATE_TYPE_PARAMETER_PACK (t
))
3864 /* Turn this argument into a TYPE_ARGUMENT_PACK
3865 with a single element, which expands T. */
3866 tree vec
= make_tree_vec (1);
3867 #ifdef ENABLE_CHECKING
3868 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT
3869 (vec
, TREE_VEC_LENGTH (vec
));
3871 TREE_VEC_ELT (vec
, 0) = make_pack_expansion (t
);
3873 t
= cxx_make_type (TYPE_ARGUMENT_PACK
);
3874 SET_ARGUMENT_PACK_ARGS (t
, vec
);
3879 t
= DECL_INITIAL (t
);
3881 if (TEMPLATE_PARM_PARAMETER_PACK (t
))
3883 /* Turn this argument into a NONTYPE_ARGUMENT_PACK
3884 with a single element, which expands T. */
3885 tree vec
= make_tree_vec (1);
3886 tree type
= TREE_TYPE (TEMPLATE_PARM_DECL (t
));
3887 #ifdef ENABLE_CHECKING
3888 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT
3889 (vec
, TREE_VEC_LENGTH (vec
));
3891 t
= convert_from_reference (t
);
3892 TREE_VEC_ELT (vec
, 0) = make_pack_expansion (t
);
3894 t
= make_node (NONTYPE_ARGUMENT_PACK
);
3895 SET_ARGUMENT_PACK_ARGS (t
, vec
);
3896 TREE_TYPE (t
) = type
;
3899 t
= convert_from_reference (t
);
3904 /* Given a set of template parameters, return them as a set of template
3905 arguments. The template parameters are represented as a TREE_VEC, in
3906 the form documented in cp-tree.h for template arguments. */
3909 template_parms_to_args (tree parms
)
3912 tree args
= NULL_TREE
;
3913 int length
= TMPL_PARMS_DEPTH (parms
);
3916 /* If there is only one level of template parameters, we do not
3917 create a TREE_VEC of TREE_VECs. Instead, we return a single
3918 TREE_VEC containing the arguments. */
3920 args
= make_tree_vec (length
);
3922 for (header
= parms
; header
; header
= TREE_CHAIN (header
))
3924 tree a
= copy_node (TREE_VALUE (header
));
3927 TREE_TYPE (a
) = NULL_TREE
;
3928 for (i
= TREE_VEC_LENGTH (a
) - 1; i
>= 0; --i
)
3929 TREE_VEC_ELT (a
, i
) = template_parm_to_arg (TREE_VEC_ELT (a
, i
));
3931 #ifdef ENABLE_CHECKING
3932 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (a
, TREE_VEC_LENGTH (a
));
3936 TREE_VEC_ELT (args
, --l
) = a
;
3941 if (length
> 1 && TREE_VEC_ELT (args
, 0) == NULL_TREE
)
3942 /* This can happen for template parms of a template template
3945 template<template<class T, class U> class TT> struct S;
3947 Consider the level of the parms of TT; T and U both have
3948 level 2; TT has no template parm of level 1. So in this case
3949 the first element of full_template_args is NULL_TREE. If we
3950 leave it like this TMPL_ARGS_DEPTH on args returns 1 instead
3951 of 2. This will make tsubst wrongly consider that T and U
3952 have level 1. Instead, let's create a dummy vector as the
3953 first element of full_template_args so that TMPL_ARGS_DEPTH
3954 returns the correct depth for args. */
3955 TREE_VEC_ELT (args
, 0) = make_tree_vec (1);
3959 /* Within the declaration of a template, return the currently active
3960 template parameters as an argument TREE_VEC. */
3963 current_template_args (void)
3965 return template_parms_to_args (current_template_parms
);
3968 /* Update the declared TYPE by doing any lookups which were thought to be
3969 dependent, but are not now that we know the SCOPE of the declarator. */
3972 maybe_update_decl_type (tree orig_type
, tree scope
)
3974 tree type
= orig_type
;
3976 if (type
== NULL_TREE
)
3979 if (TREE_CODE (orig_type
) == TYPE_DECL
)
3980 type
= TREE_TYPE (type
);
3982 if (scope
&& TYPE_P (scope
) && dependent_type_p (scope
)
3983 && dependent_type_p (type
)
3984 /* Don't bother building up the args in this case. */
3985 && TREE_CODE (type
) != TEMPLATE_TYPE_PARM
)
3987 /* tsubst in the args corresponding to the template parameters,
3988 including auto if present. Most things will be unchanged, but
3989 make_typename_type and tsubst_qualified_id will resolve
3990 TYPENAME_TYPEs and SCOPE_REFs that were previously dependent. */
3991 tree args
= current_template_args ();
3992 tree auto_node
= type_uses_auto (type
);
3996 tree auto_vec
= make_tree_vec (1);
3997 TREE_VEC_ELT (auto_vec
, 0) = auto_node
;
3998 args
= add_to_template_args (args
, auto_vec
);
4000 pushed
= push_scope (scope
);
4001 type
= tsubst (type
, args
, tf_warning_or_error
, NULL_TREE
);
4006 if (type
== error_mark_node
)
4009 if (TREE_CODE (orig_type
) == TYPE_DECL
)
4011 if (same_type_p (type
, TREE_TYPE (orig_type
)))
4014 type
= TYPE_NAME (type
);
4019 /* Return a TEMPLATE_DECL corresponding to DECL, using the indicated
4020 template PARMS. If MEMBER_TEMPLATE_P is true, the new template is
4021 a member template. Used by push_template_decl below. */
4024 build_template_decl (tree decl
, tree parms
, bool member_template_p
)
4026 tree tmpl
= build_lang_decl (TEMPLATE_DECL
, DECL_NAME (decl
), NULL_TREE
);
4027 DECL_TEMPLATE_PARMS (tmpl
) = parms
;
4028 DECL_CONTEXT (tmpl
) = DECL_CONTEXT (decl
);
4029 DECL_SOURCE_LOCATION (tmpl
) = DECL_SOURCE_LOCATION (decl
);
4030 DECL_MEMBER_TEMPLATE_P (tmpl
) = member_template_p
;
4035 struct template_parm_data
4037 /* The level of the template parameters we are currently
4041 /* The index of the specialization argument we are currently
4045 /* An array whose size is the number of template parameters. The
4046 elements are nonzero if the parameter has been used in any one
4047 of the arguments processed so far. */
4050 /* An array whose size is the number of template arguments. The
4051 elements are nonzero if the argument makes use of template
4052 parameters of this level. */
4053 int* arg_uses_template_parms
;
4056 /* Subroutine of push_template_decl used to see if each template
4057 parameter in a partial specialization is used in the explicit
4058 argument list. If T is of the LEVEL given in DATA (which is
4059 treated as a template_parm_data*), then DATA->PARMS is marked
4063 mark_template_parm (tree t
, void* data
)
4067 struct template_parm_data
* tpd
= (struct template_parm_data
*) data
;
4069 template_parm_level_and_index (t
, &level
, &idx
);
4071 if (level
== tpd
->level
)
4073 tpd
->parms
[idx
] = 1;
4074 tpd
->arg_uses_template_parms
[tpd
->current_arg
] = 1;
4077 /* Return zero so that for_each_template_parm will continue the
4078 traversal of the tree; we want to mark *every* template parm. */
4082 /* Process the partial specialization DECL. */
4085 process_partial_specialization (tree decl
)
4087 tree type
= TREE_TYPE (decl
);
4088 tree maintmpl
= CLASSTYPE_TI_TEMPLATE (type
);
4089 tree specargs
= CLASSTYPE_TI_ARGS (type
);
4090 tree inner_args
= INNERMOST_TEMPLATE_ARGS (specargs
);
4091 tree main_inner_parms
= DECL_INNERMOST_TEMPLATE_PARMS (maintmpl
);
4094 int nargs
= TREE_VEC_LENGTH (inner_args
);
4097 bool did_error_intro
= false;
4098 struct template_parm_data tpd
;
4099 struct template_parm_data tpd2
;
4101 gcc_assert (current_template_parms
);
4103 inner_parms
= INNERMOST_TEMPLATE_PARMS (current_template_parms
);
4104 ntparms
= TREE_VEC_LENGTH (inner_parms
);
4106 /* We check that each of the template parameters given in the
4107 partial specialization is used in the argument list to the
4108 specialization. For example:
4110 template <class T> struct S;
4111 template <class T> struct S<T*>;
4113 The second declaration is OK because `T*' uses the template
4114 parameter T, whereas
4116 template <class T> struct S<int>;
4118 is no good. Even trickier is:
4129 The S2<T> declaration is actually invalid; it is a
4130 full-specialization. Of course,
4133 struct S2<T (*)(U)>;
4135 or some such would have been OK. */
4136 tpd
.level
= TMPL_PARMS_DEPTH (current_template_parms
);
4137 tpd
.parms
= XALLOCAVEC (int, ntparms
);
4138 memset (tpd
.parms
, 0, sizeof (int) * ntparms
);
4140 tpd
.arg_uses_template_parms
= XALLOCAVEC (int, nargs
);
4141 memset (tpd
.arg_uses_template_parms
, 0, sizeof (int) * nargs
);
4142 for (i
= 0; i
< nargs
; ++i
)
4144 tpd
.current_arg
= i
;
4145 for_each_template_parm (TREE_VEC_ELT (inner_args
, i
),
4146 &mark_template_parm
,
4149 /*include_nondeduced_p=*/false);
4151 for (i
= 0; i
< ntparms
; ++i
)
4152 if (tpd
.parms
[i
] == 0)
4154 /* One of the template parms was not used in a deduced context in the
4156 if (!did_error_intro
)
4158 error ("template parameters not deducible in "
4159 "partial specialization:");
4160 did_error_intro
= true;
4163 inform (input_location
, " %qD",
4164 TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
)));
4167 if (did_error_intro
)
4168 return error_mark_node
;
4170 /* [temp.class.spec]
4172 The argument list of the specialization shall not be identical to
4173 the implicit argument list of the primary template. */
4174 if (comp_template_args
4176 INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE
4178 error ("partial specialization %qT does not specialize any template arguments", type
);
4180 /* A partial specialization that replaces multiple parameters of the
4181 primary template with a pack expansion is less specialized for those
4183 if (nargs
< DECL_NTPARMS (maintmpl
))
4185 error ("partial specialization is not more specialized than the "
4186 "primary template because it replaces multiple parameters "
4187 "with a pack expansion");
4188 inform (DECL_SOURCE_LOCATION (maintmpl
), "primary template here");
4192 /* [temp.class.spec]
4194 A partially specialized non-type argument expression shall not
4195 involve template parameters of the partial specialization except
4196 when the argument expression is a simple identifier.
4198 The type of a template parameter corresponding to a specialized
4199 non-type argument shall not be dependent on a parameter of the
4202 Also, we verify that pack expansions only occur at the
4203 end of the argument list. */
4204 gcc_assert (nargs
== DECL_NTPARMS (maintmpl
));
4206 for (i
= 0; i
< nargs
; ++i
)
4208 tree parm
= TREE_VALUE (TREE_VEC_ELT (main_inner_parms
, i
));
4209 tree arg
= TREE_VEC_ELT (inner_args
, i
);
4210 tree packed_args
= NULL_TREE
;
4213 if (ARGUMENT_PACK_P (arg
))
4215 /* Extract the arguments from the argument pack. We'll be
4216 iterating over these in the following loop. */
4217 packed_args
= ARGUMENT_PACK_ARGS (arg
);
4218 len
= TREE_VEC_LENGTH (packed_args
);
4221 for (j
= 0; j
< len
; j
++)
4224 /* Get the Jth argument in the parameter pack. */
4225 arg
= TREE_VEC_ELT (packed_args
, j
);
4227 if (PACK_EXPANSION_P (arg
))
4229 /* Pack expansions must come at the end of the
4231 if ((packed_args
&& j
< len
- 1)
4232 || (!packed_args
&& i
< nargs
- 1))
4234 if (TREE_CODE (arg
) == EXPR_PACK_EXPANSION
)
4235 error ("parameter pack argument %qE must be at the "
4236 "end of the template argument list", arg
);
4238 error ("parameter pack argument %qT must be at the "
4239 "end of the template argument list", arg
);
4243 if (TREE_CODE (arg
) == EXPR_PACK_EXPANSION
)
4244 /* We only care about the pattern. */
4245 arg
= PACK_EXPANSION_PATTERN (arg
);
4247 if (/* These first two lines are the `non-type' bit. */
4249 && TREE_CODE (arg
) != TEMPLATE_DECL
4250 /* This next two lines are the `argument expression is not just a
4251 simple identifier' condition and also the `specialized
4252 non-type argument' bit. */
4253 && TREE_CODE (arg
) != TEMPLATE_PARM_INDEX
4254 && !(REFERENCE_REF_P (arg
)
4255 && TREE_CODE (TREE_OPERAND (arg
, 0)) == TEMPLATE_PARM_INDEX
))
4257 if ((!packed_args
&& tpd
.arg_uses_template_parms
[i
])
4258 || (packed_args
&& uses_template_parms (arg
)))
4259 error ("template argument %qE involves template parameter(s)",
4263 /* Look at the corresponding template parameter,
4264 marking which template parameters its type depends
4266 tree type
= TREE_TYPE (parm
);
4270 /* We haven't yet initialized TPD2. Do so now. */
4271 tpd2
.arg_uses_template_parms
= XALLOCAVEC (int, nargs
);
4272 /* The number of parameters here is the number in the
4273 main template, which, as checked in the assertion
4275 tpd2
.parms
= XALLOCAVEC (int, nargs
);
4277 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (maintmpl
));
4280 /* Mark the template parameters. But this time, we're
4281 looking for the template parameters of the main
4282 template, not in the specialization. */
4283 tpd2
.current_arg
= i
;
4284 tpd2
.arg_uses_template_parms
[i
] = 0;
4285 memset (tpd2
.parms
, 0, sizeof (int) * nargs
);
4286 for_each_template_parm (type
,
4287 &mark_template_parm
,
4290 /*include_nondeduced_p=*/false);
4292 if (tpd2
.arg_uses_template_parms
[i
])
4294 /* The type depended on some template parameters.
4295 If they are fully specialized in the
4296 specialization, that's OK. */
4299 for (j
= 0; j
< nargs
; ++j
)
4300 if (tpd2
.parms
[j
] != 0
4301 && tpd
.arg_uses_template_parms
[j
])
4304 error_n (input_location
, count
,
4305 "type %qT of template argument %qE depends "
4306 "on a template parameter",
4307 "type %qT of template argument %qE depends "
4308 "on template parameters",
4317 /* We should only get here once. */
4318 gcc_assert (!COMPLETE_TYPE_P (type
));
4320 tree tmpl
= build_template_decl (decl
, current_template_parms
,
4321 DECL_MEMBER_TEMPLATE_P (maintmpl
));
4322 TREE_TYPE (tmpl
) = type
;
4323 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
4324 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
4325 DECL_TEMPLATE_INFO (tmpl
) = build_template_info (maintmpl
, specargs
);
4326 DECL_PRIMARY_TEMPLATE (tmpl
) = maintmpl
;
4328 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)
4329 = tree_cons (specargs
, tmpl
,
4330 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
));
4331 TREE_TYPE (DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)) = type
;
4333 for (inst
= DECL_TEMPLATE_INSTANTIATIONS (maintmpl
); inst
;
4334 inst
= TREE_CHAIN (inst
))
4336 tree inst_type
= TREE_VALUE (inst
);
4337 if (COMPLETE_TYPE_P (inst_type
)
4338 && CLASSTYPE_IMPLICIT_INSTANTIATION (inst_type
))
4340 tree spec
= most_specialized_class (inst_type
, tf_none
);
4341 if (spec
&& TREE_TYPE (spec
) == type
)
4342 permerror (input_location
,
4343 "partial specialization of %qT after instantiation "
4344 "of %qT", type
, inst_type
);
4351 /* PARM is a template parameter of some form; return the corresponding
4352 TEMPLATE_PARM_INDEX. */
4355 get_template_parm_index (tree parm
)
4357 if (TREE_CODE (parm
) == PARM_DECL
4358 || TREE_CODE (parm
) == CONST_DECL
)
4359 parm
= DECL_INITIAL (parm
);
4360 else if (TREE_CODE (parm
) == TYPE_DECL
4361 || TREE_CODE (parm
) == TEMPLATE_DECL
)
4362 parm
= TREE_TYPE (parm
);
4363 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
4364 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
)
4365 parm
= TEMPLATE_TYPE_PARM_INDEX (parm
);
4366 gcc_assert (TREE_CODE (parm
) == TEMPLATE_PARM_INDEX
);
4370 /* Subroutine of fixed_parameter_pack_p below. Look for any template
4371 parameter packs used by the template parameter PARM. */
4374 fixed_parameter_pack_p_1 (tree parm
, struct find_parameter_pack_data
*ppd
)
4376 /* A type parm can't refer to another parm. */
4377 if (TREE_CODE (parm
) == TYPE_DECL
)
4379 else if (TREE_CODE (parm
) == PARM_DECL
)
4381 cp_walk_tree (&TREE_TYPE (parm
), &find_parameter_packs_r
,
4386 gcc_assert (TREE_CODE (parm
) == TEMPLATE_DECL
);
4388 tree vec
= INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (parm
));
4389 for (int i
= 0; i
< TREE_VEC_LENGTH (vec
); ++i
)
4390 fixed_parameter_pack_p_1 (TREE_VALUE (TREE_VEC_ELT (vec
, i
)), ppd
);
4393 /* PARM is a template parameter pack. Return any parameter packs used in
4394 its type or the type of any of its template parameters. If there are
4395 any such packs, it will be instantiated into a fixed template parameter
4396 list by partial instantiation rather than be fully deduced. */
4399 fixed_parameter_pack_p (tree parm
)
4401 /* This can only be true in a member template. */
4402 if (TEMPLATE_PARM_ORIG_LEVEL (get_template_parm_index (parm
)) < 2)
4404 /* This can only be true for a parameter pack. */
4405 if (!template_parameter_pack_p (parm
))
4407 /* A type parm can't refer to another parm. */
4408 if (TREE_CODE (parm
) == TYPE_DECL
)
4411 tree parameter_packs
= NULL_TREE
;
4412 struct find_parameter_pack_data ppd
;
4413 ppd
.parameter_packs
= ¶meter_packs
;
4414 ppd
.visited
= new hash_set
<tree
>;
4416 fixed_parameter_pack_p_1 (parm
, &ppd
);
4419 return parameter_packs
;
4422 /* Check that a template declaration's use of default arguments and
4423 parameter packs is not invalid. Here, PARMS are the template
4424 parameters. IS_PRIMARY is true if DECL is the thing declared by
4425 a primary template. IS_PARTIAL is true if DECL is a partial
4428 IS_FRIEND_DECL is nonzero if DECL is a friend function template
4429 declaration (but not a definition); 1 indicates a declaration, 2
4430 indicates a redeclaration. When IS_FRIEND_DECL=2, no errors are
4431 emitted for extraneous default arguments.
4433 Returns TRUE if there were no errors found, FALSE otherwise. */
4436 check_default_tmpl_args (tree decl
, tree parms
, bool is_primary
,
4437 bool is_partial
, int is_friend_decl
)
4440 int last_level_to_check
;
4442 bool no_errors
= true;
4446 A default template-argument shall not be specified in a
4447 function template declaration or a function template definition, nor
4448 in the template-parameter-list of the definition of a member of a
4451 if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == FUNCTION_DECL
4452 || (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_LOCAL_FUNCTION_P (decl
)))
4453 /* You can't have a function template declaration in a local
4454 scope, nor you can you define a member of a class template in a
4458 if (TREE_CODE (decl
) == TYPE_DECL
4460 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
4461 /* A lambda doesn't have an explicit declaration; don't complain
4462 about the parms of the enclosing class. */
4465 if (current_class_type
4466 && !TYPE_BEING_DEFINED (current_class_type
)
4467 && DECL_LANG_SPECIFIC (decl
)
4468 && DECL_DECLARES_FUNCTION_P (decl
)
4469 /* If this is either a friend defined in the scope of the class
4470 or a member function. */
4471 && (DECL_FUNCTION_MEMBER_P (decl
)
4472 ? same_type_p (DECL_CONTEXT (decl
), current_class_type
)
4473 : DECL_FRIEND_CONTEXT (decl
)
4474 ? same_type_p (DECL_FRIEND_CONTEXT (decl
), current_class_type
)
4476 /* And, if it was a member function, it really was defined in
4477 the scope of the class. */
4478 && (!DECL_FUNCTION_MEMBER_P (decl
)
4479 || DECL_INITIALIZED_IN_CLASS_P (decl
)))
4480 /* We already checked these parameters when the template was
4481 declared, so there's no need to do it again now. This function
4482 was defined in class scope, but we're processing its body now
4483 that the class is complete. */
4486 /* Core issue 226 (C++0x only): the following only applies to class
4489 && ((cxx_dialect
== cxx98
) || TREE_CODE (decl
) != FUNCTION_DECL
))
4493 If a template-parameter has a default template-argument, all
4494 subsequent template-parameters shall have a default
4495 template-argument supplied. */
4496 for (parm_level
= parms
; parm_level
; parm_level
= TREE_CHAIN (parm_level
))
4498 tree inner_parms
= TREE_VALUE (parm_level
);
4499 int ntparms
= TREE_VEC_LENGTH (inner_parms
);
4500 int seen_def_arg_p
= 0;
4503 for (i
= 0; i
< ntparms
; ++i
)
4505 tree parm
= TREE_VEC_ELT (inner_parms
, i
);
4507 if (parm
== error_mark_node
)
4510 if (TREE_PURPOSE (parm
))
4512 else if (seen_def_arg_p
4513 && !template_parameter_pack_p (TREE_VALUE (parm
)))
4515 error ("no default argument for %qD", TREE_VALUE (parm
));
4516 /* For better subsequent error-recovery, we indicate that
4517 there should have been a default argument. */
4518 TREE_PURPOSE (parm
) = error_mark_node
;
4521 else if (!is_partial
4523 /* Don't complain about an enclosing partial
4525 && parm_level
== parms
4526 && TREE_CODE (decl
) == TYPE_DECL
4528 && template_parameter_pack_p (TREE_VALUE (parm
))
4529 /* A fixed parameter pack will be partially
4530 instantiated into a fixed length list. */
4531 && !fixed_parameter_pack_p (TREE_VALUE (parm
)))
4533 /* A primary class template can only have one
4534 parameter pack, at the end of the template
4537 if (TREE_CODE (TREE_VALUE (parm
)) == PARM_DECL
)
4538 error ("parameter pack %qE must be at the end of the"
4539 " template parameter list", TREE_VALUE (parm
));
4541 error ("parameter pack %qT must be at the end of the"
4542 " template parameter list",
4543 TREE_TYPE (TREE_VALUE (parm
)));
4545 TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
))
4553 if (((cxx_dialect
== cxx98
) && TREE_CODE (decl
) != TYPE_DECL
)
4557 /* For an ordinary class template, default template arguments are
4558 allowed at the innermost level, e.g.:
4559 template <class T = int>
4561 but, in a partial specialization, they're not allowed even
4562 there, as we have in [temp.class.spec]:
4564 The template parameter list of a specialization shall not
4565 contain default template argument values.
4567 So, for a partial specialization, or for a function template
4568 (in C++98/C++03), we look at all of them. */
4571 /* But, for a primary class template that is not a partial
4572 specialization we look at all template parameters except the
4574 parms
= TREE_CHAIN (parms
);
4576 /* Figure out what error message to issue. */
4577 if (is_friend_decl
== 2)
4578 msg
= G_("default template arguments may not be used in function template "
4579 "friend re-declaration");
4580 else if (is_friend_decl
)
4581 msg
= G_("default template arguments may not be used in function template "
4582 "friend declarations");
4583 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& (cxx_dialect
== cxx98
))
4584 msg
= G_("default template arguments may not be used in function templates "
4585 "without -std=c++11 or -std=gnu++11");
4586 else if (is_partial
)
4587 msg
= G_("default template arguments may not be used in "
4588 "partial specializations");
4590 msg
= G_("default argument for template parameter for class enclosing %qD");
4592 if (current_class_type
&& TYPE_BEING_DEFINED (current_class_type
))
4593 /* If we're inside a class definition, there's no need to
4594 examine the parameters to the class itself. On the one
4595 hand, they will be checked when the class is defined, and,
4596 on the other, default arguments are valid in things like:
4597 template <class T = double>
4598 struct S { template <class U> void f(U); };
4599 Here the default argument for `S' has no bearing on the
4600 declaration of `f'. */
4601 last_level_to_check
= template_class_depth (current_class_type
) + 1;
4603 /* Check everything. */
4604 last_level_to_check
= 0;
4606 for (parm_level
= parms
;
4607 parm_level
&& TMPL_PARMS_DEPTH (parm_level
) >= last_level_to_check
;
4608 parm_level
= TREE_CHAIN (parm_level
))
4610 tree inner_parms
= TREE_VALUE (parm_level
);
4614 ntparms
= TREE_VEC_LENGTH (inner_parms
);
4615 for (i
= 0; i
< ntparms
; ++i
)
4617 if (TREE_VEC_ELT (inner_parms
, i
) == error_mark_node
)
4620 if (TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)))
4625 if (is_friend_decl
== 2)
4632 /* Clear out the default argument so that we are not
4634 TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)) = NULL_TREE
;
4638 /* At this point, if we're still interested in issuing messages,
4639 they must apply to classes surrounding the object declared. */
4641 msg
= G_("default argument for template parameter for class "
4648 /* Worker for push_template_decl_real, called via
4649 for_each_template_parm. DATA is really an int, indicating the
4650 level of the parameters we are interested in. If T is a template
4651 parameter of that level, return nonzero. */
4654 template_parm_this_level_p (tree t
, void* data
)
4656 int this_level
= *(int *)data
;
4659 if (TREE_CODE (t
) == TEMPLATE_PARM_INDEX
)
4660 level
= TEMPLATE_PARM_LEVEL (t
);
4662 level
= TEMPLATE_TYPE_LEVEL (t
);
4663 return level
== this_level
;
4666 /* Creates a TEMPLATE_DECL for the indicated DECL using the template
4667 parameters given by current_template_args, or reuses a
4668 previously existing one, if appropriate. Returns the DECL, or an
4669 equivalent one, if it is replaced via a call to duplicate_decls.
4671 If IS_FRIEND is true, DECL is a friend declaration. */
4674 push_template_decl_real (tree decl
, bool is_friend
)
4682 int new_template_p
= 0;
4683 /* True if the template is a member template, in the sense of
4685 bool member_template_p
= false;
4687 if (decl
== error_mark_node
|| !current_template_parms
)
4688 return error_mark_node
;
4690 /* See if this is a partial specialization. */
4691 is_partial
= (DECL_IMPLICIT_TYPEDEF_P (decl
)
4692 && TREE_CODE (TREE_TYPE (decl
)) != ENUMERAL_TYPE
4693 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)));
4695 if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_FRIEND_P (decl
))
4699 /* For a friend, we want the context of the friend function, not
4700 the type of which it is a friend. */
4701 ctx
= CP_DECL_CONTEXT (decl
);
4702 else if (CP_DECL_CONTEXT (decl
)
4703 && TREE_CODE (CP_DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
4704 /* In the case of a virtual function, we want the class in which
4706 ctx
= CP_DECL_CONTEXT (decl
);
4708 /* Otherwise, if we're currently defining some class, the DECL
4709 is assumed to be a member of the class. */
4710 ctx
= current_scope ();
4712 if (ctx
&& TREE_CODE (ctx
) == NAMESPACE_DECL
)
4715 if (!DECL_CONTEXT (decl
))
4716 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
4718 /* See if this is a primary template. */
4719 if (is_friend
&& ctx
4720 && uses_template_parms_level (ctx
, processing_template_decl
))
4721 /* A friend template that specifies a class context, i.e.
4722 template <typename T> friend void A<T>::f();
4725 else if (TREE_CODE (decl
) == TYPE_DECL
4726 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
4729 is_primary
= template_parm_scope_p ();
4733 if (DECL_CLASS_SCOPE_P (decl
))
4734 member_template_p
= true;
4735 if (TREE_CODE (decl
) == TYPE_DECL
4736 && ANON_AGGRNAME_P (DECL_NAME (decl
)))
4738 error ("template class without a name");
4739 return error_mark_node
;
4741 else if (TREE_CODE (decl
) == FUNCTION_DECL
)
4743 if (member_template_p
)
4745 if (DECL_OVERRIDE_P (decl
) || DECL_FINAL_P (decl
))
4746 error ("member template %qD may not have virt-specifiers", decl
);
4748 if (DECL_DESTRUCTOR_P (decl
))
4752 A destructor shall not be a member template. */
4753 error ("destructor %qD declared as member template", decl
);
4754 return error_mark_node
;
4756 if (NEW_DELETE_OPNAME_P (DECL_NAME (decl
))
4757 && (!prototype_p (TREE_TYPE (decl
))
4758 || TYPE_ARG_TYPES (TREE_TYPE (decl
)) == void_list_node
4759 || !TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)))
4760 || (TREE_CHAIN (TYPE_ARG_TYPES ((TREE_TYPE (decl
))))
4761 == void_list_node
)))
4763 /* [basic.stc.dynamic.allocation]
4765 An allocation function can be a function
4766 template. ... Template allocation functions shall
4767 have two or more parameters. */
4768 error ("invalid template declaration of %qD", decl
);
4769 return error_mark_node
;
4772 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
4773 && CLASS_TYPE_P (TREE_TYPE (decl
)))
4775 else if (TREE_CODE (decl
) == TYPE_DECL
4776 && TYPE_DECL_ALIAS_P (decl
))
4777 /* alias-declaration */
4778 gcc_assert (!DECL_ARTIFICIAL (decl
));
4779 else if (VAR_P (decl
))
4780 /* C++14 variable template. */;
4783 error ("template declaration of %q#D", decl
);
4784 return error_mark_node
;
4788 /* Check to see that the rules regarding the use of default
4789 arguments are not being violated. */
4790 check_default_tmpl_args (decl
, current_template_parms
,
4791 is_primary
, is_partial
, /*is_friend_decl=*/0);
4793 /* Ensure that there are no parameter packs in the type of this
4794 declaration that have not been expanded. */
4795 if (TREE_CODE (decl
) == FUNCTION_DECL
)
4797 /* Check each of the arguments individually to see if there are
4798 any bare parameter packs. */
4799 tree type
= TREE_TYPE (decl
);
4800 tree arg
= DECL_ARGUMENTS (decl
);
4801 tree argtype
= TYPE_ARG_TYPES (type
);
4803 while (arg
&& argtype
)
4805 if (!DECL_PACK_P (arg
)
4806 && check_for_bare_parameter_packs (TREE_TYPE (arg
)))
4808 /* This is a PARM_DECL that contains unexpanded parameter
4809 packs. We have already complained about this in the
4810 check_for_bare_parameter_packs call, so just replace
4811 these types with ERROR_MARK_NODE. */
4812 TREE_TYPE (arg
) = error_mark_node
;
4813 TREE_VALUE (argtype
) = error_mark_node
;
4816 arg
= DECL_CHAIN (arg
);
4817 argtype
= TREE_CHAIN (argtype
);
4820 /* Check for bare parameter packs in the return type and the
4821 exception specifiers. */
4822 if (check_for_bare_parameter_packs (TREE_TYPE (type
)))
4823 /* Errors were already issued, set return type to int
4824 as the frontend doesn't expect error_mark_node as
4826 TREE_TYPE (type
) = integer_type_node
;
4827 if (check_for_bare_parameter_packs (TYPE_RAISES_EXCEPTIONS (type
)))
4828 TYPE_RAISES_EXCEPTIONS (type
) = NULL_TREE
;
4830 else if (check_for_bare_parameter_packs ((TREE_CODE (decl
) == TYPE_DECL
4831 && TYPE_DECL_ALIAS_P (decl
))
4832 ? DECL_ORIGINAL_TYPE (decl
)
4833 : TREE_TYPE (decl
)))
4835 TREE_TYPE (decl
) = error_mark_node
;
4836 return error_mark_node
;
4840 return process_partial_specialization (decl
);
4842 args
= current_template_args ();
4845 || TREE_CODE (ctx
) == FUNCTION_DECL
4846 || (CLASS_TYPE_P (ctx
) && TYPE_BEING_DEFINED (ctx
))
4847 || (TREE_CODE (decl
) == TYPE_DECL
4848 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
4849 || (is_friend
&& !DECL_TEMPLATE_INFO (decl
)))
4851 if (DECL_LANG_SPECIFIC (decl
)
4852 && DECL_TEMPLATE_INFO (decl
)
4853 && DECL_TI_TEMPLATE (decl
))
4854 tmpl
= DECL_TI_TEMPLATE (decl
);
4855 /* If DECL is a TYPE_DECL for a class-template, then there won't
4856 be DECL_LANG_SPECIFIC. The information equivalent to
4857 DECL_TEMPLATE_INFO is found in TYPE_TEMPLATE_INFO instead. */
4858 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
4859 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl
))
4860 && TYPE_TI_TEMPLATE (TREE_TYPE (decl
)))
4862 /* Since a template declaration already existed for this
4863 class-type, we must be redeclaring it here. Make sure
4864 that the redeclaration is valid. */
4865 redeclare_class_template (TREE_TYPE (decl
),
4866 current_template_parms
);
4867 /* We don't need to create a new TEMPLATE_DECL; just use the
4868 one we already had. */
4869 tmpl
= TYPE_TI_TEMPLATE (TREE_TYPE (decl
));
4873 tmpl
= build_template_decl (decl
, current_template_parms
,
4877 if (DECL_LANG_SPECIFIC (decl
)
4878 && DECL_TEMPLATE_SPECIALIZATION (decl
))
4880 /* A specialization of a member template of a template
4882 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
4883 DECL_TEMPLATE_INFO (tmpl
) = DECL_TEMPLATE_INFO (decl
);
4884 DECL_TEMPLATE_INFO (decl
) = NULL_TREE
;
4890 tree a
, t
, current
, parms
;
4892 tree tinfo
= get_template_info (decl
);
4896 error ("template definition of non-template %q#D", decl
);
4897 return error_mark_node
;
4900 tmpl
= TI_TEMPLATE (tinfo
);
4902 if (DECL_FUNCTION_TEMPLATE_P (tmpl
)
4903 && DECL_TEMPLATE_INFO (decl
) && DECL_TI_ARGS (decl
)
4904 && DECL_TEMPLATE_SPECIALIZATION (decl
)
4905 && DECL_MEMBER_TEMPLATE_P (tmpl
))
4909 /* The declaration is a specialization of a member
4910 template, declared outside the class. Therefore, the
4911 innermost template arguments will be NULL, so we
4912 replace them with the arguments determined by the
4913 earlier call to check_explicit_specialization. */
4914 args
= DECL_TI_ARGS (decl
);
4917 = build_template_decl (decl
, current_template_parms
,
4919 DECL_TEMPLATE_RESULT (new_tmpl
) = decl
;
4920 TREE_TYPE (new_tmpl
) = TREE_TYPE (decl
);
4921 DECL_TI_TEMPLATE (decl
) = new_tmpl
;
4922 SET_DECL_TEMPLATE_SPECIALIZATION (new_tmpl
);
4923 DECL_TEMPLATE_INFO (new_tmpl
)
4924 = build_template_info (tmpl
, args
);
4926 register_specialization (new_tmpl
,
4927 most_general_template (tmpl
),
4933 /* Make sure the template headers we got make sense. */
4935 parms
= DECL_TEMPLATE_PARMS (tmpl
);
4936 i
= TMPL_PARMS_DEPTH (parms
);
4937 if (TMPL_ARGS_DEPTH (args
) != i
)
4939 error ("expected %d levels of template parms for %q#D, got %d",
4940 i
, decl
, TMPL_ARGS_DEPTH (args
));
4941 DECL_INTERFACE_KNOWN (decl
) = 1;
4942 return error_mark_node
;
4945 for (current
= decl
; i
> 0; --i
, parms
= TREE_CHAIN (parms
))
4947 a
= TMPL_ARGS_LEVEL (args
, i
);
4948 t
= INNERMOST_TEMPLATE_PARMS (parms
);
4950 if (TREE_VEC_LENGTH (t
) != TREE_VEC_LENGTH (a
))
4952 if (current
== decl
)
4953 error ("got %d template parameters for %q#D",
4954 TREE_VEC_LENGTH (a
), decl
);
4956 error ("got %d template parameters for %q#T",
4957 TREE_VEC_LENGTH (a
), current
);
4958 error (" but %d required", TREE_VEC_LENGTH (t
));
4959 /* Avoid crash in import_export_decl. */
4960 DECL_INTERFACE_KNOWN (decl
) = 1;
4961 return error_mark_node
;
4964 if (current
== decl
)
4966 else if (current
== NULL_TREE
)
4967 /* Can happen in erroneous input. */
4970 current
= get_containing_scope (current
);
4973 /* Check that the parms are used in the appropriate qualifying scopes
4974 in the declarator. */
4975 if (!comp_template_args
4977 TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (tmpl
)))))
4980 template arguments to %qD do not match original template %qD",
4981 decl
, DECL_TEMPLATE_RESULT (tmpl
));
4982 if (!uses_template_parms (TI_ARGS (tinfo
)))
4983 inform (input_location
, "use template<> for an explicit specialization");
4984 /* Avoid crash in import_export_decl. */
4985 DECL_INTERFACE_KNOWN (decl
) = 1;
4986 return error_mark_node
;
4990 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
4991 TREE_TYPE (tmpl
) = TREE_TYPE (decl
);
4993 /* Push template declarations for global functions and types. Note
4994 that we do not try to push a global template friend declared in a
4995 template class; such a thing may well depend on the template
4996 parameters of the class. */
4997 if (new_template_p
&& !ctx
4998 && !(is_friend
&& template_class_depth (current_class_type
) > 0))
5000 tmpl
= pushdecl_namespace_level (tmpl
, is_friend
);
5001 if (tmpl
== error_mark_node
)
5002 return error_mark_node
;
5004 /* Hide template friend classes that haven't been declared yet. */
5005 if (is_friend
&& TREE_CODE (decl
) == TYPE_DECL
)
5007 DECL_ANTICIPATED (tmpl
) = 1;
5008 DECL_FRIEND_P (tmpl
) = 1;
5014 tree parms
= DECL_TEMPLATE_PARMS (tmpl
);
5017 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
5018 if (DECL_CONV_FN_P (tmpl
))
5020 int depth
= TMPL_PARMS_DEPTH (parms
);
5022 /* It is a conversion operator. See if the type converted to
5023 depends on innermost template operands. */
5025 if (uses_template_parms_level (TREE_TYPE (TREE_TYPE (tmpl
)),
5027 DECL_TEMPLATE_CONV_FN_P (tmpl
) = 1;
5030 /* Give template template parms a DECL_CONTEXT of the template
5031 for which they are a parameter. */
5032 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
5033 for (i
= TREE_VEC_LENGTH (parms
) - 1; i
>= 0; --i
)
5035 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
5036 if (TREE_CODE (parm
) == TEMPLATE_DECL
)
5037 DECL_CONTEXT (parm
) = tmpl
;
5041 /* The DECL_TI_ARGS of DECL contains full set of arguments referring
5042 back to its most general template. If TMPL is a specialization,
5043 ARGS may only have the innermost set of arguments. Add the missing
5044 argument levels if necessary. */
5045 if (DECL_TEMPLATE_INFO (tmpl
))
5046 args
= add_outermost_template_args (DECL_TI_ARGS (tmpl
), args
);
5048 info
= build_template_info (tmpl
, args
);
5050 if (DECL_IMPLICIT_TYPEDEF_P (decl
))
5051 SET_TYPE_TEMPLATE_INFO (TREE_TYPE (tmpl
), info
);
5054 if (is_primary
&& !DECL_LANG_SPECIFIC (decl
))
5055 retrofit_lang_decl (decl
);
5056 if (DECL_LANG_SPECIFIC (decl
))
5057 DECL_TEMPLATE_INFO (decl
) = info
;
5060 if (flag_implicit_templates
5062 && VAR_OR_FUNCTION_DECL_P (decl
))
5063 /* Set DECL_COMDAT on template instantiations; if we force
5064 them to be emitted by explicit instantiation or -frepo,
5065 mark_needed will tell cgraph to do the right thing. */
5066 DECL_COMDAT (decl
) = true;
5068 return DECL_TEMPLATE_RESULT (tmpl
);
5072 push_template_decl (tree decl
)
5074 return push_template_decl_real (decl
, false);
5077 /* FN is an inheriting constructor that inherits from the constructor
5078 template INHERITED; turn FN into a constructor template with a matching
5082 add_inherited_template_parms (tree fn
, tree inherited
)
5085 = INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (inherited
));
5086 inner_parms
= copy_node (inner_parms
);
5088 = tree_cons (size_int (processing_template_decl
+ 1),
5089 inner_parms
, current_template_parms
);
5090 tree tmpl
= build_template_decl (fn
, parms
, /*member*/true);
5091 tree args
= template_parms_to_args (parms
);
5092 DECL_TEMPLATE_INFO (fn
) = build_template_info (tmpl
, args
);
5093 TREE_TYPE (tmpl
) = TREE_TYPE (fn
);
5094 DECL_TEMPLATE_RESULT (tmpl
) = fn
;
5095 DECL_ARTIFICIAL (tmpl
) = true;
5096 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
5100 /* Called when a class template TYPE is redeclared with the indicated
5101 template PARMS, e.g.:
5103 template <class T> struct S;
5104 template <class T> struct S {}; */
5107 redeclare_class_template (tree type
, tree parms
)
5113 if (!TYPE_TEMPLATE_INFO (type
))
5115 error ("%qT is not a template type", type
);
5119 tmpl
= TYPE_TI_TEMPLATE (type
);
5120 if (!PRIMARY_TEMPLATE_P (tmpl
))
5121 /* The type is nested in some template class. Nothing to worry
5122 about here; there are no new template parameters for the nested
5128 error ("template specifiers not specified in declaration of %qD",
5133 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
5134 tmpl_parms
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl
);
5136 if (TREE_VEC_LENGTH (parms
) != TREE_VEC_LENGTH (tmpl_parms
))
5138 error_n (input_location
, TREE_VEC_LENGTH (parms
),
5139 "redeclared with %d template parameter",
5140 "redeclared with %d template parameters",
5141 TREE_VEC_LENGTH (parms
));
5142 inform_n (input_location
, TREE_VEC_LENGTH (tmpl_parms
),
5143 "previous declaration %q+D used %d template parameter",
5144 "previous declaration %q+D used %d template parameters",
5145 tmpl
, TREE_VEC_LENGTH (tmpl_parms
));
5149 for (i
= 0; i
< TREE_VEC_LENGTH (tmpl_parms
); ++i
)
5156 if (TREE_VEC_ELT (tmpl_parms
, i
) == error_mark_node
5157 || TREE_VEC_ELT (parms
, i
) == error_mark_node
)
5160 tmpl_parm
= TREE_VALUE (TREE_VEC_ELT (tmpl_parms
, i
));
5161 if (error_operand_p (tmpl_parm
))
5164 parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
5165 tmpl_default
= TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
));
5166 parm_default
= TREE_PURPOSE (TREE_VEC_ELT (parms
, i
));
5168 /* TMPL_PARM and PARM can be either TYPE_DECL, PARM_DECL, or
5170 if (TREE_CODE (tmpl_parm
) != TREE_CODE (parm
)
5171 || (TREE_CODE (tmpl_parm
) != TYPE_DECL
5172 && !same_type_p (TREE_TYPE (tmpl_parm
), TREE_TYPE (parm
)))
5173 || (TREE_CODE (tmpl_parm
) != PARM_DECL
5174 && (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (tmpl_parm
))
5175 != TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
))))
5176 || (TREE_CODE (tmpl_parm
) == PARM_DECL
5177 && (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (tmpl_parm
))
5178 != TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))))
5180 error ("template parameter %q+#D", tmpl_parm
);
5181 error ("redeclared here as %q#D", parm
);
5185 if (tmpl_default
!= NULL_TREE
&& parm_default
!= NULL_TREE
)
5187 /* We have in [temp.param]:
5189 A template-parameter may not be given default arguments
5190 by two different declarations in the same scope. */
5191 error_at (input_location
, "redefinition of default argument for %q#D", parm
);
5192 inform (DECL_SOURCE_LOCATION (tmpl_parm
),
5193 "original definition appeared here");
5197 if (parm_default
!= NULL_TREE
)
5198 /* Update the previous template parameters (which are the ones
5199 that will really count) with the new default value. */
5200 TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
)) = parm_default
;
5201 else if (tmpl_default
!= NULL_TREE
)
5202 /* Update the new parameters, too; they'll be used as the
5203 parameters for any members. */
5204 TREE_PURPOSE (TREE_VEC_ELT (parms
, i
)) = tmpl_default
;
5210 /* Simplify EXPR if it is a non-dependent expression. Returns the
5211 (possibly simplified) expression. */
5214 fold_non_dependent_expr_sfinae (tree expr
, tsubst_flags_t complain
)
5216 if (expr
== NULL_TREE
)
5219 /* If we're in a template, but EXPR isn't value dependent, simplify
5220 it. We're supposed to treat:
5222 template <typename T> void f(T[1 + 1]);
5223 template <typename T> void f(T[2]);
5225 as two declarations of the same function, for example. */
5226 if (processing_template_decl
5227 && !instantiation_dependent_expression_p (expr
)
5228 && potential_constant_expression (expr
))
5230 HOST_WIDE_INT saved_processing_template_decl
;
5232 saved_processing_template_decl
= processing_template_decl
;
5233 processing_template_decl
= 0;
5234 expr
= tsubst_copy_and_build (expr
,
5237 /*in_decl=*/NULL_TREE
,
5238 /*function_p=*/false,
5239 /*integral_constant_expression_p=*/true);
5240 processing_template_decl
= saved_processing_template_decl
;
5246 fold_non_dependent_expr (tree expr
)
5248 return fold_non_dependent_expr_sfinae (expr
, tf_error
);
5251 /* Return TRUE iff T is a type alias, a TEMPLATE_DECL for an alias
5252 template declaration, or a TYPE_DECL for an alias declaration. */
5255 alias_type_or_template_p (tree t
)
5259 return ((TREE_CODE (t
) == TYPE_DECL
&& TYPE_DECL_ALIAS_P (t
))
5262 && TYPE_DECL_ALIAS_P (TYPE_NAME (t
)))
5263 || DECL_ALIAS_TEMPLATE_P (t
));
5266 /* Return TRUE iff is a specialization of an alias template. */
5269 alias_template_specialization_p (const_tree t
)
5275 && TYPE_TEMPLATE_INFO (t
)
5276 && PRIMARY_TEMPLATE_P (TYPE_TI_TEMPLATE (t
))
5277 && DECL_ALIAS_TEMPLATE_P (TYPE_TI_TEMPLATE (t
)));
5280 /* Return the number of innermost template parameters in TMPL. */
5283 num_innermost_template_parms (tree tmpl
)
5285 tree parms
= INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (tmpl
));
5286 return TREE_VEC_LENGTH (parms
);
5289 /* Return either TMPL or another template that it is equivalent to under DR
5290 1286: An alias that just changes the name of a template is equivalent to
5291 the other template. */
5294 get_underlying_template (tree tmpl
)
5296 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
);
5297 while (DECL_ALIAS_TEMPLATE_P (tmpl
))
5299 tree result
= DECL_ORIGINAL_TYPE (DECL_TEMPLATE_RESULT (tmpl
));
5300 if (TYPE_TEMPLATE_INFO (result
))
5302 tree sub
= TYPE_TI_TEMPLATE (result
);
5303 if (PRIMARY_TEMPLATE_P (sub
)
5304 && (num_innermost_template_parms (tmpl
)
5305 == num_innermost_template_parms (sub
)))
5307 tree alias_args
= INNERMOST_TEMPLATE_ARGS
5308 (template_parms_to_args (DECL_TEMPLATE_PARMS (tmpl
)));
5309 if (!comp_template_args (TYPE_TI_ARGS (result
), alias_args
))
5311 /* The alias type is equivalent to the pattern of the
5312 underlying template, so strip the alias. */
5322 /* Subroutine of convert_nontype_argument. Converts EXPR to TYPE, which
5323 must be a function or a pointer-to-function type, as specified
5324 in [temp.arg.nontype]: disambiguate EXPR if it is an overload set,
5325 and check that the resulting function has external linkage. */
5328 convert_nontype_argument_function (tree type
, tree expr
,
5329 tsubst_flags_t complain
)
5333 linkage_kind linkage
;
5335 fn
= instantiate_type (type
, fns
, tf_none
);
5336 if (fn
== error_mark_node
)
5337 return error_mark_node
;
5340 if (TREE_CODE (fn_no_ptr
) == ADDR_EXPR
)
5341 fn_no_ptr
= TREE_OPERAND (fn_no_ptr
, 0);
5342 if (BASELINK_P (fn_no_ptr
))
5343 fn_no_ptr
= BASELINK_FUNCTIONS (fn_no_ptr
);
5345 /* [temp.arg.nontype]/1
5347 A template-argument for a non-type, non-template template-parameter
5350 -- the address of an object or function with external [C++11: or
5351 internal] linkage. */
5353 if (TREE_CODE (fn_no_ptr
) != FUNCTION_DECL
)
5355 if (complain
& tf_error
)
5357 error ("%qE is not a valid template argument for type %qT",
5359 if (TYPE_PTR_P (type
))
5360 error ("it must be the address of a function with "
5361 "external linkage");
5363 error ("it must be the name of a function with "
5364 "external linkage");
5369 linkage
= decl_linkage (fn_no_ptr
);
5370 if (cxx_dialect
>= cxx11
? linkage
== lk_none
: linkage
!= lk_external
)
5372 if (complain
& tf_error
)
5374 if (cxx_dialect
>= cxx11
)
5375 error ("%qE is not a valid template argument for type %qT "
5376 "because %qD has no linkage",
5377 expr
, type
, fn_no_ptr
);
5379 error ("%qE is not a valid template argument for type %qT "
5380 "because %qD does not have external linkage",
5381 expr
, type
, fn_no_ptr
);
5389 /* Subroutine of convert_nontype_argument.
5390 Check if EXPR of type TYPE is a valid pointer-to-member constant.
5391 Emit an error otherwise. */
5394 check_valid_ptrmem_cst_expr (tree type
, tree expr
,
5395 tsubst_flags_t complain
)
5398 if (expr
&& (null_ptr_cst_p (expr
) || TREE_CODE (expr
) == PTRMEM_CST
))
5400 if (cxx_dialect
>= cxx11
&& null_member_pointer_value_p (expr
))
5402 if (processing_template_decl
5403 && TREE_CODE (expr
) == ADDR_EXPR
5404 && TREE_CODE (TREE_OPERAND (expr
, 0)) == OFFSET_REF
)
5406 if (complain
& tf_error
)
5408 error ("%qE is not a valid template argument for type %qT",
5410 error ("it must be a pointer-to-member of the form %<&X::Y%>");
5415 /* Returns TRUE iff the address of OP is value-dependent.
5417 14.6.2.4 [temp.dep.temp]:
5418 A non-integral non-type template-argument is dependent if its type is
5419 dependent or it has either of the following forms
5422 and contains a nested-name-specifier which specifies a class-name that
5423 names a dependent type.
5425 We generalize this to just say that the address of a member of a
5426 dependent class is value-dependent; the above doesn't cover the
5427 address of a static data member named with an unqualified-id. */
5430 has_value_dependent_address (tree op
)
5432 /* We could use get_inner_reference here, but there's no need;
5433 this is only relevant for template non-type arguments, which
5434 can only be expressed as &id-expression. */
5437 tree ctx
= CP_DECL_CONTEXT (op
);
5438 if (TYPE_P (ctx
) && dependent_type_p (ctx
))
5445 /* The next set of functions are used for providing helpful explanatory
5446 diagnostics for failed overload resolution. Their messages should be
5447 indented by two spaces for consistency with the messages in
5451 unify_success (bool /*explain_p*/)
5457 unify_parameter_deduction_failure (bool explain_p
, tree parm
)
5460 inform (input_location
,
5461 " couldn't deduce template parameter %qD", parm
);
5466 unify_invalid (bool /*explain_p*/)
5472 unify_cv_qual_mismatch (bool explain_p
, tree parm
, tree arg
)
5475 inform (input_location
,
5476 " types %qT and %qT have incompatible cv-qualifiers",
5482 unify_type_mismatch (bool explain_p
, tree parm
, tree arg
)
5485 inform (input_location
, " mismatched types %qT and %qT", parm
, arg
);
5490 unify_parameter_pack_mismatch (bool explain_p
, tree parm
, tree arg
)
5493 inform (input_location
,
5494 " template parameter %qD is not a parameter pack, but "
5501 unify_ptrmem_cst_mismatch (bool explain_p
, tree parm
, tree arg
)
5504 inform (input_location
,
5505 " template argument %qE does not match "
5506 "pointer-to-member constant %qE",
5512 unify_expression_unequal (bool explain_p
, tree parm
, tree arg
)
5515 inform (input_location
, " %qE is not equivalent to %qE", parm
, arg
);
5520 unify_parameter_pack_inconsistent (bool explain_p
, tree old_arg
, tree new_arg
)
5523 inform (input_location
,
5524 " inconsistent parameter pack deduction with %qT and %qT",
5530 unify_inconsistency (bool explain_p
, tree parm
, tree first
, tree second
)
5535 inform (input_location
,
5536 " deduced conflicting types for parameter %qT (%qT and %qT)",
5537 parm
, first
, second
);
5539 inform (input_location
,
5540 " deduced conflicting values for non-type parameter "
5541 "%qE (%qE and %qE)", parm
, first
, second
);
5547 unify_vla_arg (bool explain_p
, tree arg
)
5550 inform (input_location
,
5551 " variable-sized array type %qT is not "
5552 "a valid template argument",
5558 unify_method_type_error (bool explain_p
, tree arg
)
5561 inform (input_location
,
5562 " member function type %qT is not a valid template argument",
5568 unify_arity (bool explain_p
, int have
, int wanted
, bool least_p
= false)
5573 inform_n (input_location
, wanted
,
5574 " candidate expects at least %d argument, %d provided",
5575 " candidate expects at least %d arguments, %d provided",
5578 inform_n (input_location
, wanted
,
5579 " candidate expects %d argument, %d provided",
5580 " candidate expects %d arguments, %d provided",
5587 unify_too_many_arguments (bool explain_p
, int have
, int wanted
)
5589 return unify_arity (explain_p
, have
, wanted
);
5593 unify_too_few_arguments (bool explain_p
, int have
, int wanted
,
5594 bool least_p
= false)
5596 return unify_arity (explain_p
, have
, wanted
, least_p
);
5600 unify_arg_conversion (bool explain_p
, tree to_type
,
5601 tree from_type
, tree arg
)
5604 inform (EXPR_LOC_OR_LOC (arg
, input_location
),
5605 " cannot convert %qE (type %qT) to type %qT",
5606 arg
, from_type
, to_type
);
5611 unify_no_common_base (bool explain_p
, enum template_base_result r
,
5612 tree parm
, tree arg
)
5617 case tbr_ambiguous_baseclass
:
5618 inform (input_location
, " %qT is an ambiguous base class of %qT",
5622 inform (input_location
, " %qT is not derived from %qT", arg
, parm
);
5629 unify_inconsistent_template_template_parameters (bool explain_p
)
5632 inform (input_location
,
5633 " template parameters of a template template argument are "
5634 "inconsistent with other deduced template arguments");
5639 unify_template_deduction_failure (bool explain_p
, tree parm
, tree arg
)
5642 inform (input_location
,
5643 " can't deduce a template for %qT from non-template type %qT",
5649 unify_template_argument_mismatch (bool explain_p
, tree parm
, tree arg
)
5652 inform (input_location
,
5653 " template argument %qE does not match %qD", arg
, parm
);
5658 unify_overload_resolution_failure (bool explain_p
, tree arg
)
5661 inform (input_location
,
5662 " could not resolve address from overloaded function %qE",
5667 /* Attempt to convert the non-type template parameter EXPR to the
5668 indicated TYPE. If the conversion is successful, return the
5669 converted value. If the conversion is unsuccessful, return
5670 NULL_TREE if we issued an error message, or error_mark_node if we
5671 did not. We issue error messages for out-and-out bad template
5672 parameters, but not simply because the conversion failed, since we
5673 might be just trying to do argument deduction. Both TYPE and EXPR
5674 must be non-dependent.
5676 The conversion follows the special rules described in
5677 [temp.arg.nontype], and it is much more strict than an implicit
5680 This function is called twice for each template argument (see
5681 lookup_template_class for a more accurate description of this
5682 problem). This means that we need to handle expressions which
5683 are not valid in a C++ source, but can be created from the
5684 first call (for instance, casts to perform conversions). These
5685 hacks can go away after we fix the double coercion problem. */
5688 convert_nontype_argument (tree type
, tree expr
, tsubst_flags_t complain
)
5692 /* Detect immediately string literals as invalid non-type argument.
5693 This special-case is not needed for correctness (we would easily
5694 catch this later), but only to provide better diagnostic for this
5695 common user mistake. As suggested by DR 100, we do not mention
5696 linkage issues in the diagnostic as this is not the point. */
5697 /* FIXME we're making this OK. */
5698 if (TREE_CODE (expr
) == STRING_CST
)
5700 if (complain
& tf_error
)
5701 error ("%qE is not a valid template argument for type %qT "
5702 "because string literals can never be used in this context",
5707 /* Add the ADDR_EXPR now for the benefit of
5708 value_dependent_expression_p. */
5709 if (TYPE_PTROBV_P (type
)
5710 && TREE_CODE (TREE_TYPE (expr
)) == ARRAY_TYPE
)
5712 expr
= decay_conversion (expr
, complain
);
5713 if (expr
== error_mark_node
)
5714 return error_mark_node
;
5717 /* If we are in a template, EXPR may be non-dependent, but still
5718 have a syntactic, rather than semantic, form. For example, EXPR
5719 might be a SCOPE_REF, rather than the VAR_DECL to which the
5720 SCOPE_REF refers. Preserving the qualifying scope is necessary
5721 so that access checking can be performed when the template is
5722 instantiated -- but here we need the resolved form so that we can
5723 convert the argument. */
5724 if (TYPE_REF_OBJ_P (type
)
5725 && has_value_dependent_address (expr
))
5726 /* If we want the address and it's value-dependent, don't fold. */;
5727 else if (!type_unknown_p (expr
))
5728 expr
= fold_non_dependent_expr_sfinae (expr
, complain
);
5729 if (error_operand_p (expr
))
5730 return error_mark_node
;
5731 expr_type
= TREE_TYPE (expr
);
5732 if (TREE_CODE (type
) == REFERENCE_TYPE
)
5733 expr
= mark_lvalue_use (expr
);
5735 expr
= mark_rvalue_use (expr
);
5737 /* 14.3.2/5: The null pointer{,-to-member} conversion is applied
5738 to a non-type argument of "nullptr". */
5739 if (expr
== nullptr_node
&& TYPE_PTR_OR_PTRMEM_P (type
))
5740 expr
= convert (type
, expr
);
5742 /* In C++11, integral or enumeration non-type template arguments can be
5743 arbitrary constant expressions. Pointer and pointer to
5744 member arguments can be general constant expressions that evaluate
5745 to a null value, but otherwise still need to be of a specific form. */
5746 if (cxx_dialect
>= cxx11
)
5748 if (TREE_CODE (expr
) == PTRMEM_CST
)
5749 /* A PTRMEM_CST is already constant, and a valid template
5750 argument for a parameter of pointer to member type, we just want
5751 to leave it in that form rather than lower it to a
5753 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
5754 expr
= maybe_constant_value (expr
);
5755 else if (TYPE_PTR_OR_PTRMEM_P (type
))
5757 tree folded
= maybe_constant_value (expr
);
5758 if (TYPE_PTR_P (type
) ? integer_zerop (folded
)
5759 : null_member_pointer_value_p (folded
))
5764 /* HACK: Due to double coercion, we can get a
5765 NOP_EXPR<REFERENCE_TYPE>(ADDR_EXPR<POINTER_TYPE> (arg)) here,
5766 which is the tree that we built on the first call (see
5767 below when coercing to reference to object or to reference to
5768 function). We just strip everything and get to the arg.
5769 See g++.old-deja/g++.oliva/template4.C and g++.dg/template/nontype9.C
5771 if (TYPE_REF_OBJ_P (type
) || TYPE_REFFN_P (type
))
5773 tree probe_type
, probe
= expr
;
5774 if (REFERENCE_REF_P (probe
))
5775 probe
= TREE_OPERAND (probe
, 0);
5776 probe_type
= TREE_TYPE (probe
);
5777 if (TREE_CODE (probe
) == NOP_EXPR
)
5779 /* ??? Maybe we could use convert_from_reference here, but we
5780 would need to relax its constraints because the NOP_EXPR
5781 could actually change the type to something more cv-qualified,
5782 and this is not folded by convert_from_reference. */
5783 tree addr
= TREE_OPERAND (probe
, 0);
5784 if (TREE_CODE (probe_type
) == REFERENCE_TYPE
5785 && TREE_CODE (addr
) == ADDR_EXPR
5786 && TYPE_PTR_P (TREE_TYPE (addr
))
5787 && (same_type_ignoring_top_level_qualifiers_p
5788 (TREE_TYPE (probe_type
),
5789 TREE_TYPE (TREE_TYPE (addr
)))))
5791 expr
= TREE_OPERAND (addr
, 0);
5792 expr_type
= TREE_TYPE (probe_type
);
5797 /* We could also generate a NOP_EXPR(ADDR_EXPR()) when the
5798 parameter is a pointer to object, through decay and
5799 qualification conversion. Let's strip everything. */
5800 else if (TREE_CODE (expr
) == NOP_EXPR
&& TYPE_PTROBV_P (type
))
5804 if (TREE_CODE (probe
) == ADDR_EXPR
5805 && TYPE_PTR_P (TREE_TYPE (probe
)))
5807 /* Skip the ADDR_EXPR only if it is part of the decay for
5808 an array. Otherwise, it is part of the original argument
5809 in the source code. */
5810 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (probe
, 0))) == ARRAY_TYPE
)
5811 probe
= TREE_OPERAND (probe
, 0);
5813 expr_type
= TREE_TYPE (expr
);
5817 /* [temp.arg.nontype]/5, bullet 1
5819 For a non-type template-parameter of integral or enumeration type,
5820 integral promotions (_conv.prom_) and integral conversions
5821 (_conv.integral_) are applied. */
5822 if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
5824 tree t
= build_integral_nontype_arg_conv (type
, expr
, complain
);
5825 t
= maybe_constant_value (t
);
5826 if (t
!= error_mark_node
)
5829 if (!same_type_ignoring_top_level_qualifiers_p (type
, TREE_TYPE (expr
)))
5830 return error_mark_node
;
5832 /* Notice that there are constant expressions like '4 % 0' which
5833 do not fold into integer constants. */
5834 if (TREE_CODE (expr
) != INTEGER_CST
)
5836 if (complain
& tf_error
)
5838 int errs
= errorcount
, warns
= warningcount
+ werrorcount
;
5839 if (processing_template_decl
5840 && !require_potential_constant_expression (expr
))
5842 expr
= cxx_constant_value (expr
);
5843 if (errorcount
> errs
|| warningcount
+ werrorcount
> warns
)
5844 inform (EXPR_LOC_OR_LOC (expr
, input_location
),
5845 "in template argument for type %qT ", type
);
5846 if (expr
== error_mark_node
)
5848 /* else cxx_constant_value complained but gave us
5849 a real constant, so go ahead. */
5850 gcc_assert (TREE_CODE (expr
) == INTEGER_CST
);
5856 /* Avoid typedef problems. */
5857 if (TREE_TYPE (expr
) != type
)
5858 expr
= fold_convert (type
, expr
);
5860 /* [temp.arg.nontype]/5, bullet 2
5862 For a non-type template-parameter of type pointer to object,
5863 qualification conversions (_conv.qual_) and the array-to-pointer
5864 conversion (_conv.array_) are applied. */
5865 else if (TYPE_PTROBV_P (type
))
5867 /* [temp.arg.nontype]/1 (TC1 version, DR 49):
5869 A template-argument for a non-type, non-template template-parameter
5870 shall be one of: [...]
5872 -- the name of a non-type template-parameter;
5873 -- the address of an object or function with external linkage, [...]
5874 expressed as "& id-expression" where the & is optional if the name
5875 refers to a function or array, or if the corresponding
5876 template-parameter is a reference.
5878 Here, we do not care about functions, as they are invalid anyway
5879 for a parameter of type pointer-to-object. */
5881 if (DECL_P (expr
) && DECL_TEMPLATE_PARM_P (expr
))
5882 /* Non-type template parameters are OK. */
5884 else if (cxx_dialect
>= cxx11
&& integer_zerop (expr
))
5885 /* Null pointer values are OK in C++11. */;
5886 else if (TREE_CODE (expr
) != ADDR_EXPR
5887 && TREE_CODE (expr_type
) != ARRAY_TYPE
)
5891 if (complain
& tf_error
)
5892 error ("%qD is not a valid template argument "
5893 "because %qD is a variable, not the address of "
5894 "a variable", expr
, expr
);
5897 if (POINTER_TYPE_P (expr_type
))
5899 if (complain
& tf_error
)
5900 error ("%qE is not a valid template argument for %qT "
5901 "because it is not the address of a variable",
5905 /* Other values, like integer constants, might be valid
5906 non-type arguments of some other type. */
5907 return error_mark_node
;
5913 decl
= ((TREE_CODE (expr
) == ADDR_EXPR
)
5914 ? TREE_OPERAND (expr
, 0) : expr
);
5917 if (complain
& tf_error
)
5918 error ("%qE is not a valid template argument of type %qT "
5919 "because %qE is not a variable", expr
, type
, decl
);
5922 else if (cxx_dialect
< cxx11
&& !DECL_EXTERNAL_LINKAGE_P (decl
))
5924 if (complain
& tf_error
)
5925 error ("%qE is not a valid template argument of type %qT "
5926 "because %qD does not have external linkage",
5930 else if (cxx_dialect
>= cxx11
&& decl_linkage (decl
) == lk_none
)
5932 if (complain
& tf_error
)
5933 error ("%qE is not a valid template argument of type %qT "
5934 "because %qD has no linkage", expr
, type
, decl
);
5939 expr
= decay_conversion (expr
, complain
);
5940 if (expr
== error_mark_node
)
5941 return error_mark_node
;
5943 expr
= perform_qualification_conversions (type
, expr
);
5944 if (expr
== error_mark_node
)
5945 return error_mark_node
;
5947 /* [temp.arg.nontype]/5, bullet 3
5949 For a non-type template-parameter of type reference to object, no
5950 conversions apply. The type referred to by the reference may be more
5951 cv-qualified than the (otherwise identical) type of the
5952 template-argument. The template-parameter is bound directly to the
5953 template-argument, which must be an lvalue. */
5954 else if (TYPE_REF_OBJ_P (type
))
5956 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type
),
5958 return error_mark_node
;
5960 if (!at_least_as_qualified_p (TREE_TYPE (type
), expr_type
))
5962 if (complain
& tf_error
)
5963 error ("%qE is not a valid template argument for type %qT "
5964 "because of conflicts in cv-qualification", expr
, type
);
5968 if (!real_lvalue_p (expr
))
5970 if (complain
& tf_error
)
5971 error ("%qE is not a valid template argument for type %qT "
5972 "because it is not an lvalue", expr
, type
);
5976 /* [temp.arg.nontype]/1
5978 A template-argument for a non-type, non-template template-parameter
5979 shall be one of: [...]
5981 -- the address of an object or function with external linkage. */
5982 if (INDIRECT_REF_P (expr
)
5983 && TYPE_REF_OBJ_P (TREE_TYPE (TREE_OPERAND (expr
, 0))))
5985 expr
= TREE_OPERAND (expr
, 0);
5988 if (complain
& tf_error
)
5989 error ("%q#D is not a valid template argument for type %qT "
5990 "because a reference variable does not have a constant "
5991 "address", expr
, type
);
5998 if (complain
& tf_error
)
5999 error ("%qE is not a valid template argument for type %qT "
6000 "because it is not an object with external linkage",
6005 if (!DECL_EXTERNAL_LINKAGE_P (expr
))
6007 if (complain
& tf_error
)
6008 error ("%qE is not a valid template argument for type %qT "
6009 "because object %qD has not external linkage",
6014 expr
= build_nop (type
, build_address (expr
));
6016 /* [temp.arg.nontype]/5, bullet 4
6018 For a non-type template-parameter of type pointer to function, only
6019 the function-to-pointer conversion (_conv.func_) is applied. If the
6020 template-argument represents a set of overloaded functions (or a
6021 pointer to such), the matching function is selected from the set
6023 else if (TYPE_PTRFN_P (type
))
6025 /* If the argument is a template-id, we might not have enough
6026 context information to decay the pointer. */
6027 if (!type_unknown_p (expr_type
))
6029 expr
= decay_conversion (expr
, complain
);
6030 if (expr
== error_mark_node
)
6031 return error_mark_node
;
6034 if (cxx_dialect
>= cxx11
&& integer_zerop (expr
))
6035 /* Null pointer values are OK in C++11. */
6036 return perform_qualification_conversions (type
, expr
);
6038 expr
= convert_nontype_argument_function (type
, expr
, complain
);
6039 if (!expr
|| expr
== error_mark_node
)
6042 /* [temp.arg.nontype]/5, bullet 5
6044 For a non-type template-parameter of type reference to function, no
6045 conversions apply. If the template-argument represents a set of
6046 overloaded functions, the matching function is selected from the set
6048 else if (TYPE_REFFN_P (type
))
6050 if (TREE_CODE (expr
) == ADDR_EXPR
)
6052 if (complain
& tf_error
)
6054 error ("%qE is not a valid template argument for type %qT "
6055 "because it is a pointer", expr
, type
);
6056 inform (input_location
, "try using %qE instead",
6057 TREE_OPERAND (expr
, 0));
6062 expr
= convert_nontype_argument_function (type
, expr
, complain
);
6063 if (!expr
|| expr
== error_mark_node
)
6066 expr
= build_nop (type
, build_address (expr
));
6068 /* [temp.arg.nontype]/5, bullet 6
6070 For a non-type template-parameter of type pointer to member function,
6071 no conversions apply. If the template-argument represents a set of
6072 overloaded member functions, the matching member function is selected
6073 from the set (_over.over_). */
6074 else if (TYPE_PTRMEMFUNC_P (type
))
6076 expr
= instantiate_type (type
, expr
, tf_none
);
6077 if (expr
== error_mark_node
)
6078 return error_mark_node
;
6080 /* [temp.arg.nontype] bullet 1 says the pointer to member
6081 expression must be a pointer-to-member constant. */
6082 if (!check_valid_ptrmem_cst_expr (type
, expr
, complain
))
6083 return error_mark_node
;
6085 /* There is no way to disable standard conversions in
6086 resolve_address_of_overloaded_function (called by
6087 instantiate_type). It is possible that the call succeeded by
6088 converting &B::I to &D::I (where B is a base of D), so we need
6089 to reject this conversion here.
6091 Actually, even if there was a way to disable standard conversions,
6092 it would still be better to reject them here so that we can
6093 provide a superior diagnostic. */
6094 if (!same_type_p (TREE_TYPE (expr
), type
))
6096 if (complain
& tf_error
)
6098 error ("%qE is not a valid template argument for type %qT "
6099 "because it is of type %qT", expr
, type
,
6101 /* If we are just one standard conversion off, explain. */
6102 if (can_convert_standard (type
, TREE_TYPE (expr
), complain
))
6103 inform (input_location
,
6104 "standard conversions are not allowed in this context");
6109 /* [temp.arg.nontype]/5, bullet 7
6111 For a non-type template-parameter of type pointer to data member,
6112 qualification conversions (_conv.qual_) are applied. */
6113 else if (TYPE_PTRDATAMEM_P (type
))
6115 /* [temp.arg.nontype] bullet 1 says the pointer to member
6116 expression must be a pointer-to-member constant. */
6117 if (!check_valid_ptrmem_cst_expr (type
, expr
, complain
))
6118 return error_mark_node
;
6120 expr
= perform_qualification_conversions (type
, expr
);
6121 if (expr
== error_mark_node
)
6124 else if (NULLPTR_TYPE_P (type
))
6126 if (expr
!= nullptr_node
)
6128 if (complain
& tf_error
)
6129 error ("%qE is not a valid template argument for type %qT "
6130 "because it is of type %qT", expr
, type
, TREE_TYPE (expr
));
6135 /* A template non-type parameter must be one of the above. */
6139 /* Sanity check: did we actually convert the argument to the
6141 gcc_assert (same_type_ignoring_top_level_qualifiers_p
6142 (type
, TREE_TYPE (expr
)));
6146 /* Subroutine of coerce_template_template_parms, which returns 1 if
6147 PARM_PARM and ARG_PARM match using the rule for the template
6148 parameters of template template parameters. Both PARM and ARG are
6149 template parameters; the rest of the arguments are the same as for
6150 coerce_template_template_parms.
6153 coerce_template_template_parm (tree parm
,
6155 tsubst_flags_t complain
,
6159 if (arg
== NULL_TREE
|| error_operand_p (arg
)
6160 || parm
== NULL_TREE
|| error_operand_p (parm
))
6163 if (TREE_CODE (arg
) != TREE_CODE (parm
))
6166 switch (TREE_CODE (parm
))
6169 /* We encounter instantiations of templates like
6170 template <template <template <class> class> class TT>
6173 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
6174 tree argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
6176 if (!coerce_template_template_parms
6177 (parmparm
, argparm
, complain
, in_decl
, outer_args
))
6183 if (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (arg
))
6184 && !TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
)))
6185 /* Argument is a parameter pack but parameter is not. */
6190 /* The tsubst call is used to handle cases such as
6192 template <int> class C {};
6193 template <class T, template <T> class TT> class D {};
6196 i.e. the parameter list of TT depends on earlier parameters. */
6197 if (!uses_template_parms (TREE_TYPE (arg
))
6199 (tsubst (TREE_TYPE (parm
), outer_args
, complain
, in_decl
),
6203 if (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (arg
))
6204 && !TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))
6205 /* Argument is a parameter pack but parameter is not. */
6218 /* Return 1 if PARM_PARMS and ARG_PARMS matches using rule for
6219 template template parameters. Both PARM_PARMS and ARG_PARMS are
6220 vectors of TREE_LIST nodes containing TYPE_DECL, TEMPLATE_DECL
6223 Consider the example:
6224 template <class T> class A;
6225 template<template <class U> class TT> class B;
6227 For B<A>, PARM_PARMS are the parameters to TT, while ARG_PARMS are
6228 the parameters to A, and OUTER_ARGS contains A. */
6231 coerce_template_template_parms (tree parm_parms
,
6233 tsubst_flags_t complain
,
6237 int nparms
, nargs
, i
;
6241 gcc_assert (TREE_CODE (parm_parms
) == TREE_VEC
);
6242 gcc_assert (TREE_CODE (arg_parms
) == TREE_VEC
);
6244 nparms
= TREE_VEC_LENGTH (parm_parms
);
6245 nargs
= TREE_VEC_LENGTH (arg_parms
);
6247 /* Determine whether we have a parameter pack at the end of the
6248 template template parameter's template parameter list. */
6249 if (TREE_VEC_ELT (parm_parms
, nparms
- 1) != error_mark_node
)
6251 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, nparms
- 1));
6253 if (error_operand_p (parm
))
6256 switch (TREE_CODE (parm
))
6260 if (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
)))
6265 if (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))
6275 && !(variadic_p
&& nargs
>= nparms
- 1))
6278 /* Check all of the template parameters except the parameter pack at
6279 the end (if any). */
6280 for (i
= 0; i
< nparms
- variadic_p
; ++i
)
6282 if (TREE_VEC_ELT (parm_parms
, i
) == error_mark_node
6283 || TREE_VEC_ELT (arg_parms
, i
) == error_mark_node
)
6286 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
6287 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
6289 if (!coerce_template_template_parm (parm
, arg
, complain
, in_decl
,
6297 /* Check each of the template parameters in the template
6298 argument against the template parameter pack at the end of
6299 the template template parameter. */
6300 if (TREE_VEC_ELT (parm_parms
, i
) == error_mark_node
)
6303 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
6305 for (; i
< nargs
; ++i
)
6307 if (TREE_VEC_ELT (arg_parms
, i
) == error_mark_node
)
6310 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
6312 if (!coerce_template_template_parm (parm
, arg
, complain
, in_decl
,
6321 /* Verifies that the deduced template arguments (in TARGS) for the
6322 template template parameters (in TPARMS) represent valid bindings,
6323 by comparing the template parameter list of each template argument
6324 to the template parameter list of its corresponding template
6325 template parameter, in accordance with DR150. This
6326 routine can only be called after all template arguments have been
6327 deduced. It will return TRUE if all of the template template
6328 parameter bindings are okay, FALSE otherwise. */
6330 template_template_parm_bindings_ok_p (tree tparms
, tree targs
)
6332 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
6335 /* We're dealing with template parms in this process. */
6336 ++processing_template_decl
;
6338 targs
= INNERMOST_TEMPLATE_ARGS (targs
);
6340 for (i
= 0; i
< ntparms
; ++i
)
6342 tree tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
6343 tree targ
= TREE_VEC_ELT (targs
, i
);
6345 if (TREE_CODE (tparm
) == TEMPLATE_DECL
&& targ
)
6347 tree packed_args
= NULL_TREE
;
6350 if (ARGUMENT_PACK_P (targ
))
6352 /* Look inside the argument pack. */
6353 packed_args
= ARGUMENT_PACK_ARGS (targ
);
6354 len
= TREE_VEC_LENGTH (packed_args
);
6357 for (idx
= 0; idx
< len
; ++idx
)
6359 tree targ_parms
= NULL_TREE
;
6362 /* Extract the next argument from the argument
6364 targ
= TREE_VEC_ELT (packed_args
, idx
);
6366 if (PACK_EXPANSION_P (targ
))
6367 /* Look at the pattern of the pack expansion. */
6368 targ
= PACK_EXPANSION_PATTERN (targ
);
6370 /* Extract the template parameters from the template
6372 if (TREE_CODE (targ
) == TEMPLATE_DECL
)
6373 targ_parms
= DECL_INNERMOST_TEMPLATE_PARMS (targ
);
6374 else if (TREE_CODE (targ
) == TEMPLATE_TEMPLATE_PARM
)
6375 targ_parms
= DECL_INNERMOST_TEMPLATE_PARMS (TYPE_NAME (targ
));
6377 /* Verify that we can coerce the template template
6378 parameters from the template argument to the template
6379 parameter. This requires an exact match. */
6381 && !coerce_template_template_parms
6382 (DECL_INNERMOST_TEMPLATE_PARMS (tparm
),
6397 --processing_template_decl
;
6401 /* Since type attributes aren't mangled, we need to strip them from
6402 template type arguments. */
6405 canonicalize_type_argument (tree arg
, tsubst_flags_t complain
)
6408 if (!arg
|| arg
== error_mark_node
|| arg
== TYPE_CANONICAL (arg
))
6410 mv
= TYPE_MAIN_VARIANT (arg
);
6411 arg
= strip_typedefs (arg
);
6412 if (TYPE_ALIGN (arg
) != TYPE_ALIGN (mv
)
6413 || TYPE_ATTRIBUTES (arg
) != TYPE_ATTRIBUTES (mv
))
6415 if (complain
& tf_warning
)
6416 warning (0, "ignoring attributes on template argument %qT", arg
);
6417 arg
= build_aligned_type (arg
, TYPE_ALIGN (mv
));
6418 arg
= cp_build_type_attribute_variant (arg
, TYPE_ATTRIBUTES (mv
));
6423 /* Convert the indicated template ARG as necessary to match the
6424 indicated template PARM. Returns the converted ARG, or
6425 error_mark_node if the conversion was unsuccessful. Error and
6426 warning messages are issued under control of COMPLAIN. This
6427 conversion is for the Ith parameter in the parameter list. ARGS is
6428 the full set of template arguments deduced so far. */
6431 convert_template_argument (tree parm
,
6434 tsubst_flags_t complain
,
6440 int is_type
, requires_type
, is_tmpl_type
, requires_tmpl_type
;
6442 if (TREE_CODE (arg
) == TREE_LIST
6443 && TREE_CODE (TREE_VALUE (arg
)) == OFFSET_REF
)
6445 /* The template argument was the name of some
6446 member function. That's usually
6447 invalid, but static members are OK. In any
6448 case, grab the underlying fields/functions
6449 and issue an error later if required. */
6450 orig_arg
= TREE_VALUE (arg
);
6451 TREE_TYPE (arg
) = unknown_type_node
;
6456 requires_tmpl_type
= TREE_CODE (parm
) == TEMPLATE_DECL
;
6457 requires_type
= (TREE_CODE (parm
) == TYPE_DECL
6458 || requires_tmpl_type
);
6460 /* When determining whether an argument pack expansion is a template,
6461 look at the pattern. */
6462 if (TREE_CODE (arg
) == TYPE_PACK_EXPANSION
)
6463 arg
= PACK_EXPANSION_PATTERN (arg
);
6465 /* Deal with an injected-class-name used as a template template arg. */
6466 if (requires_tmpl_type
&& CLASS_TYPE_P (arg
))
6468 tree t
= maybe_get_template_decl_from_type_decl (TYPE_NAME (arg
));
6469 if (TREE_CODE (t
) == TEMPLATE_DECL
)
6471 if (cxx_dialect
>= cxx11
)
6472 /* OK under DR 1004. */;
6473 else if (complain
& tf_warning_or_error
)
6474 pedwarn (input_location
, OPT_Wpedantic
, "injected-class-name %qD"
6475 " used as template template argument", TYPE_NAME (arg
));
6476 else if (flag_pedantic_errors
)
6484 ((TREE_CODE (arg
) == TEMPLATE_DECL
6485 && TREE_CODE (DECL_TEMPLATE_RESULT (arg
)) == TYPE_DECL
)
6486 || (requires_tmpl_type
&& TREE_CODE (arg
) == TYPE_ARGUMENT_PACK
)
6487 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
6488 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
);
6491 && (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
6492 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
))
6493 arg
= TYPE_STUB_DECL (arg
);
6495 is_type
= TYPE_P (arg
) || is_tmpl_type
;
6497 if (requires_type
&& ! is_type
&& TREE_CODE (arg
) == SCOPE_REF
6498 && TREE_CODE (TREE_OPERAND (arg
, 0)) == TEMPLATE_TYPE_PARM
)
6500 if (TREE_CODE (TREE_OPERAND (arg
, 1)) == BIT_NOT_EXPR
)
6502 if (complain
& tf_error
)
6503 error ("invalid use of destructor %qE as a type", orig_arg
);
6504 return error_mark_node
;
6507 permerror (input_location
,
6508 "to refer to a type member of a template parameter, "
6509 "use %<typename %E%>", orig_arg
);
6511 orig_arg
= make_typename_type (TREE_OPERAND (arg
, 0),
6512 TREE_OPERAND (arg
, 1),
6518 if (is_type
!= requires_type
)
6522 if (complain
& tf_error
)
6524 error ("type/value mismatch at argument %d in template "
6525 "parameter list for %qD",
6528 inform (input_location
,
6529 " expected a constant of type %qT, got %qT",
6531 (DECL_P (arg
) ? DECL_NAME (arg
) : orig_arg
));
6532 else if (requires_tmpl_type
)
6533 inform (input_location
,
6534 " expected a class template, got %qE", orig_arg
);
6536 inform (input_location
,
6537 " expected a type, got %qE", orig_arg
);
6540 return error_mark_node
;
6542 if (is_tmpl_type
^ requires_tmpl_type
)
6544 if (in_decl
&& (complain
& tf_error
))
6546 error ("type/value mismatch at argument %d in template "
6547 "parameter list for %qD",
6550 inform (input_location
,
6551 " expected a type, got %qT", DECL_NAME (arg
));
6553 inform (input_location
,
6554 " expected a class template, got %qT", orig_arg
);
6556 return error_mark_node
;
6561 if (requires_tmpl_type
)
6563 if (template_parameter_pack_p (parm
) && ARGUMENT_PACK_P (orig_arg
))
6565 else if (TREE_CODE (TREE_TYPE (arg
)) == UNBOUND_CLASS_TEMPLATE
)
6566 /* The number of argument required is not known yet.
6567 Just accept it for now. */
6568 val
= TREE_TYPE (arg
);
6571 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
6574 /* Strip alias templates that are equivalent to another
6576 arg
= get_underlying_template (arg
);
6577 argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
6579 if (coerce_template_template_parms (parmparm
, argparm
,
6585 /* TEMPLATE_TEMPLATE_PARM node is preferred over
6587 if (val
!= error_mark_node
)
6589 if (DECL_TEMPLATE_TEMPLATE_PARM_P (val
))
6590 val
= TREE_TYPE (val
);
6591 if (TREE_CODE (orig_arg
) == TYPE_PACK_EXPANSION
)
6592 val
= make_pack_expansion (val
);
6597 if (in_decl
&& (complain
& tf_error
))
6599 error ("type/value mismatch at argument %d in "
6600 "template parameter list for %qD",
6602 inform (input_location
,
6603 " expected a template of type %qD, got %qT",
6607 val
= error_mark_node
;
6613 /* We only form one instance of each template specialization.
6614 Therefore, if we use a non-canonical variant (i.e., a
6615 typedef), any future messages referring to the type will use
6616 the typedef, which is confusing if those future uses do not
6617 themselves also use the typedef. */
6619 val
= canonicalize_type_argument (val
, complain
);
6623 tree t
= tsubst (TREE_TYPE (parm
), args
, complain
, in_decl
);
6625 if (invalid_nontype_parm_type_p (t
, complain
))
6626 return error_mark_node
;
6628 if (template_parameter_pack_p (parm
) && ARGUMENT_PACK_P (orig_arg
))
6630 if (same_type_p (t
, TREE_TYPE (orig_arg
)))
6634 /* Not sure if this is reachable, but it doesn't hurt
6636 error ("type mismatch in nontype parameter pack");
6637 val
= error_mark_node
;
6640 else if (!dependent_template_arg_p (orig_arg
)
6641 && !uses_template_parms (t
))
6642 /* We used to call digest_init here. However, digest_init
6643 will report errors, which we don't want when complain
6644 is zero. More importantly, digest_init will try too
6645 hard to convert things: for example, `0' should not be
6646 converted to pointer type at this point according to
6647 the standard. Accepting this is not merely an
6648 extension, since deciding whether or not these
6649 conversions can occur is part of determining which
6650 function template to call, or whether a given explicit
6651 argument specification is valid. */
6652 val
= convert_nontype_argument (t
, orig_arg
, complain
);
6654 val
= strip_typedefs_expr (orig_arg
);
6656 if (val
== NULL_TREE
)
6657 val
= error_mark_node
;
6658 else if (val
== error_mark_node
&& (complain
& tf_error
))
6659 error ("could not convert template argument %qE to %qT", orig_arg
, t
);
6661 if (TREE_CODE (val
) == SCOPE_REF
)
6663 /* Strip typedefs from the SCOPE_REF. */
6664 tree type
= canonicalize_type_argument (TREE_TYPE (val
), complain
);
6665 tree scope
= canonicalize_type_argument (TREE_OPERAND (val
, 0),
6667 val
= build_qualified_name (type
, scope
, TREE_OPERAND (val
, 1),
6668 QUALIFIED_NAME_IS_TEMPLATE (val
));
6675 /* Coerces the remaining template arguments in INNER_ARGS (from
6676 ARG_IDX to the end) into the parameter pack at PARM_IDX in PARMS.
6677 Returns the coerced argument pack. PARM_IDX is the position of this
6678 parameter in the template parameter list. ARGS is the original
6679 template argument list. */
6681 coerce_template_parameter_pack (tree parms
,
6689 tsubst_flags_t complain
)
6691 tree parm
= TREE_VEC_ELT (parms
, parm_idx
);
6692 int nargs
= inner_args
? NUM_TMPL_ARGS (inner_args
) : 0;
6695 tree packed_parms
= NULL_TREE
;
6697 if (arg_idx
> nargs
)
6700 if (tree packs
= fixed_parameter_pack_p (TREE_VALUE (parm
)))
6702 /* When the template parameter is a non-type template parameter pack
6703 or template template parameter pack whose type or template
6704 parameters use parameter packs, we know exactly how many arguments
6705 we are looking for. Build a vector of the instantiated decls for
6706 these template parameters in PACKED_PARMS. */
6707 /* We can't use make_pack_expansion here because it would interpret a
6708 _DECL as a use rather than a declaration. */
6709 tree decl
= TREE_VALUE (parm
);
6710 tree exp
= cxx_make_type (TYPE_PACK_EXPANSION
);
6711 SET_PACK_EXPANSION_PATTERN (exp
, decl
);
6712 PACK_EXPANSION_PARAMETER_PACKS (exp
) = packs
;
6713 SET_TYPE_STRUCTURAL_EQUALITY (exp
);
6715 TREE_VEC_LENGTH (args
)--;
6716 packed_parms
= tsubst_pack_expansion (exp
, args
, complain
, decl
);
6717 TREE_VEC_LENGTH (args
)++;
6719 if (packed_parms
== error_mark_node
)
6720 return error_mark_node
;
6722 /* If we're doing a partial instantiation of a member template,
6723 verify that all of the types used for the non-type
6724 template parameter pack are, in fact, valid for non-type
6725 template parameters. */
6727 && PACK_EXPANSION_P (TREE_VEC_ELT (inner_args
, arg_idx
)))
6729 int j
, len
= TREE_VEC_LENGTH (packed_parms
);
6730 for (j
= 0; j
< len
; ++j
)
6732 tree t
= TREE_TYPE (TREE_VEC_ELT (packed_parms
, j
));
6733 if (invalid_nontype_parm_type_p (t
, complain
))
6734 return error_mark_node
;
6738 packed_args
= make_tree_vec (TREE_VEC_LENGTH (packed_parms
));
6741 packed_args
= make_tree_vec (nargs
- arg_idx
);
6743 /* Convert the remaining arguments, which will be a part of the
6744 parameter pack "parm". */
6745 for (; arg_idx
< nargs
; ++arg_idx
)
6747 tree arg
= TREE_VEC_ELT (inner_args
, arg_idx
);
6748 tree actual_parm
= TREE_VALUE (parm
);
6749 int pack_idx
= arg_idx
- parm_idx
;
6753 /* Once we've packed as many args as we have types, stop. */
6754 if (pack_idx
>= TREE_VEC_LENGTH (packed_parms
))
6756 else if (PACK_EXPANSION_P (arg
))
6757 /* We don't know how many args we have yet, just
6758 use the unconverted ones for now. */
6761 actual_parm
= TREE_VEC_ELT (packed_parms
, pack_idx
);
6764 if (arg
== error_mark_node
)
6766 if (complain
& tf_error
)
6767 error ("template argument %d is invalid", arg_idx
+ 1);
6770 arg
= convert_template_argument (actual_parm
,
6771 arg
, new_args
, complain
, parm_idx
,
6773 if (arg
== error_mark_node
)
6775 TREE_VEC_ELT (packed_args
, pack_idx
) = arg
;
6778 if (arg_idx
- parm_idx
< TREE_VEC_LENGTH (packed_args
)
6779 && TREE_VEC_LENGTH (packed_args
) > 0)
6781 if (complain
& tf_error
)
6782 error ("wrong number of template arguments (%d, should be %d)",
6783 arg_idx
- parm_idx
, TREE_VEC_LENGTH (packed_args
));
6784 return error_mark_node
;
6787 if (TREE_CODE (TREE_VALUE (parm
)) == TYPE_DECL
6788 || TREE_CODE (TREE_VALUE (parm
)) == TEMPLATE_DECL
)
6789 argument_pack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
6792 argument_pack
= make_node (NONTYPE_ARGUMENT_PACK
);
6793 TREE_TYPE (argument_pack
)
6794 = tsubst (TREE_TYPE (TREE_VALUE (parm
)), new_args
, complain
, in_decl
);
6795 TREE_CONSTANT (argument_pack
) = 1;
6798 SET_ARGUMENT_PACK_ARGS (argument_pack
, packed_args
);
6799 #ifdef ENABLE_CHECKING
6800 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (packed_args
,
6801 TREE_VEC_LENGTH (packed_args
));
6803 return argument_pack
;
6806 /* Returns the number of pack expansions in the template argument vector
6810 pack_expansion_args_count (tree args
)
6815 for (i
= 0; i
< TREE_VEC_LENGTH (args
); ++i
)
6817 tree elt
= TREE_VEC_ELT (args
, i
);
6818 if (elt
&& PACK_EXPANSION_P (elt
))
6824 /* Convert all template arguments to their appropriate types, and
6825 return a vector containing the innermost resulting template
6826 arguments. If any error occurs, return error_mark_node. Error and
6827 warning messages are issued under control of COMPLAIN.
6829 If REQUIRE_ALL_ARGS is false, argument deduction will be performed
6830 for arguments not specified in ARGS. Otherwise, if
6831 USE_DEFAULT_ARGS is true, default arguments will be used to fill in
6832 unspecified arguments. If REQUIRE_ALL_ARGS is true, but
6833 USE_DEFAULT_ARGS is false, then all arguments must be specified in
6837 coerce_template_parms (tree parms
,
6840 tsubst_flags_t complain
,
6841 bool require_all_args
,
6842 bool use_default_args
)
6844 int nparms
, nargs
, parm_idx
, arg_idx
, lost
= 0;
6845 tree orig_inner_args
;
6848 tree new_inner_args
;
6849 int saved_unevaluated_operand
;
6850 int saved_inhibit_evaluation_warnings
;
6852 /* When used as a boolean value, indicates whether this is a
6853 variadic template parameter list. Since it's an int, we can also
6854 subtract it from nparms to get the number of non-variadic
6857 int variadic_args_p
= 0;
6858 int post_variadic_parms
= 0;
6860 /* Likewise for parameters with default arguments. */
6863 if (args
== error_mark_node
)
6864 return error_mark_node
;
6866 nparms
= TREE_VEC_LENGTH (parms
);
6868 /* Determine if there are any parameter packs or default arguments. */
6869 for (parm_idx
= 0; parm_idx
< nparms
; ++parm_idx
)
6871 tree parm
= TREE_VEC_ELT (parms
, parm_idx
);
6873 ++post_variadic_parms
;
6874 if (template_parameter_pack_p (TREE_VALUE (parm
)))
6876 if (TREE_PURPOSE (parm
))
6880 inner_args
= orig_inner_args
= INNERMOST_TEMPLATE_ARGS (args
);
6881 /* If there are no parameters that follow a parameter pack, we need to
6882 expand any argument packs so that we can deduce a parameter pack from
6883 some non-packed args followed by an argument pack, as in variadic85.C.
6884 If there are such parameters, we need to leave argument packs intact
6885 so the arguments are assigned properly. This can happen when dealing
6886 with a nested class inside a partial specialization of a class
6887 template, as in variadic92.C, or when deducing a template parameter pack
6888 from a sub-declarator, as in variadic114.C. */
6889 if (!post_variadic_parms
)
6890 inner_args
= expand_template_argument_pack (inner_args
);
6892 /* Count any pack expansion args. */
6893 variadic_args_p
= pack_expansion_args_count (inner_args
);
6895 nargs
= inner_args
? NUM_TMPL_ARGS (inner_args
) : 0;
6896 if ((nargs
> nparms
&& !variadic_p
)
6897 || (nargs
< nparms
- variadic_p
6900 && (!use_default_args
6901 || (TREE_VEC_ELT (parms
, nargs
) != error_mark_node
6902 && !TREE_PURPOSE (TREE_VEC_ELT (parms
, nargs
))))))
6904 if (complain
& tf_error
)
6906 if (variadic_p
|| default_p
)
6908 nparms
-= variadic_p
+ default_p
;
6909 error ("wrong number of template arguments "
6910 "(%d, should be at least %d)", nargs
, nparms
);
6913 error ("wrong number of template arguments "
6914 "(%d, should be %d)", nargs
, nparms
);
6917 inform (input_location
, "provided for %q+D", in_decl
);
6920 return error_mark_node
;
6922 /* We can't pass a pack expansion to a non-pack parameter of an alias
6923 template (DR 1430). */
6924 else if (in_decl
&& DECL_ALIAS_TEMPLATE_P (in_decl
)
6926 && nargs
- variadic_args_p
< nparms
- variadic_p
)
6928 if (complain
& tf_error
)
6930 for (int i
= 0; i
< TREE_VEC_LENGTH (inner_args
); ++i
)
6932 tree arg
= TREE_VEC_ELT (inner_args
, i
);
6933 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
6935 if (PACK_EXPANSION_P (arg
)
6936 && !template_parameter_pack_p (parm
))
6938 error ("pack expansion argument for non-pack parameter "
6939 "%qD of alias template %qD", parm
, in_decl
);
6940 inform (DECL_SOURCE_LOCATION (parm
), "declared here");
6947 return error_mark_node
;
6950 /* We need to evaluate the template arguments, even though this
6951 template-id may be nested within a "sizeof". */
6952 saved_unevaluated_operand
= cp_unevaluated_operand
;
6953 cp_unevaluated_operand
= 0;
6954 saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
6955 c_inhibit_evaluation_warnings
= 0;
6956 new_inner_args
= make_tree_vec (nparms
);
6957 new_args
= add_outermost_template_args (args
, new_inner_args
);
6958 int pack_adjust
= 0;
6959 for (parm_idx
= 0, arg_idx
= 0; parm_idx
< nparms
; parm_idx
++, arg_idx
++)
6964 /* Get the Ith template parameter. */
6965 parm
= TREE_VEC_ELT (parms
, parm_idx
);
6967 if (parm
== error_mark_node
)
6969 TREE_VEC_ELT (new_inner_args
, arg_idx
) = error_mark_node
;
6973 /* Calculate the next argument. */
6974 if (arg_idx
< nargs
)
6975 arg
= TREE_VEC_ELT (inner_args
, arg_idx
);
6979 if (template_parameter_pack_p (TREE_VALUE (parm
))
6980 && !(arg
&& ARGUMENT_PACK_P (arg
)))
6982 /* Some arguments will be placed in the
6983 template parameter pack PARM. */
6984 arg
= coerce_template_parameter_pack (parms
, parm_idx
, args
,
6985 inner_args
, arg_idx
,
6989 if (arg
== NULL_TREE
)
6991 /* We don't know how many args we have yet, just use the
6992 unconverted (and still packed) ones for now. */
6993 new_inner_args
= orig_inner_args
;
6998 TREE_VEC_ELT (new_inner_args
, parm_idx
) = arg
;
7000 /* Store this argument. */
7001 if (arg
== error_mark_node
)
7004 /* We are done with all of the arguments. */
7009 pack_adjust
= TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg
)) - 1;
7010 arg_idx
+= pack_adjust
;
7017 if (PACK_EXPANSION_P (arg
))
7019 /* "If every valid specialization of a variadic template
7020 requires an empty template parameter pack, the template is
7021 ill-formed, no diagnostic required." So check that the
7022 pattern works with this parameter. */
7023 tree pattern
= PACK_EXPANSION_PATTERN (arg
);
7024 tree conv
= convert_template_argument (TREE_VALUE (parm
),
7028 if (conv
== error_mark_node
)
7030 inform (input_location
, "so any instantiation with a "
7031 "non-empty parameter pack would be ill-formed");
7034 else if (TYPE_P (conv
) && !TYPE_P (pattern
))
7035 /* Recover from missing typename. */
7036 TREE_VEC_ELT (inner_args
, arg_idx
)
7037 = make_pack_expansion (conv
);
7039 /* We don't know how many args we have yet, just
7040 use the unconverted ones for now. */
7041 new_inner_args
= inner_args
;
7046 else if (require_all_args
)
7048 /* There must be a default arg in this case. */
7049 arg
= tsubst_template_arg (TREE_PURPOSE (parm
), new_args
,
7051 /* The position of the first default template argument,
7052 is also the number of non-defaulted arguments in NEW_INNER_ARGS.
7054 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
))
7055 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
,
7056 arg_idx
- pack_adjust
);
7061 if (arg
== error_mark_node
)
7063 if (complain
& tf_error
)
7064 error ("template argument %d is invalid", arg_idx
+ 1);
7067 /* This only occurs if there was an error in the template
7068 parameter list itself (which we would already have
7069 reported) that we are trying to recover from, e.g., a class
7070 template with a parameter list such as
7071 template<typename..., typename>. */
7074 arg
= convert_template_argument (TREE_VALUE (parm
),
7075 arg
, new_args
, complain
,
7078 if (arg
== error_mark_node
)
7080 TREE_VEC_ELT (new_inner_args
, arg_idx
- pack_adjust
) = arg
;
7082 cp_unevaluated_operand
= saved_unevaluated_operand
;
7083 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
7085 if (variadic_p
&& arg_idx
< nargs
)
7087 if (complain
& tf_error
)
7089 error ("wrong number of template arguments "
7090 "(%d, should be %d)", nargs
, arg_idx
);
7092 error ("provided for %q+D", in_decl
);
7094 return error_mark_node
;
7098 return error_mark_node
;
7100 #ifdef ENABLE_CHECKING
7101 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
))
7102 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
,
7103 TREE_VEC_LENGTH (new_inner_args
));
7106 return new_inner_args
;
7109 /* Like coerce_template_parms. If PARMS represents all template
7110 parameters levels, this function returns a vector of vectors
7111 representing all the resulting argument levels. Note that in this
7112 case, only the innermost arguments are coerced because the
7113 outermost ones are supposed to have been coerced already.
7115 Otherwise, if PARMS represents only (the innermost) vector of
7116 parameters, this function returns a vector containing just the
7117 innermost resulting arguments. */
7120 coerce_innermost_template_parms (tree parms
,
7123 tsubst_flags_t complain
,
7124 bool require_all_args
,
7125 bool use_default_args
)
7127 int parms_depth
= TMPL_PARMS_DEPTH (parms
);
7128 int args_depth
= TMPL_ARGS_DEPTH (args
);
7131 if (parms_depth
> 1)
7133 coerced_args
= make_tree_vec (parms_depth
);
7137 for (level
= parms
, cur_depth
= parms_depth
;
7138 parms_depth
> 0 && level
!= NULL_TREE
;
7139 level
= TREE_CHAIN (level
), --cur_depth
)
7142 if (cur_depth
== args_depth
)
7143 l
= coerce_template_parms (TREE_VALUE (level
),
7144 args
, in_decl
, complain
,
7148 l
= TMPL_ARGS_LEVEL (args
, cur_depth
);
7150 if (l
== error_mark_node
)
7151 return error_mark_node
;
7153 SET_TMPL_ARGS_LEVEL (coerced_args
, cur_depth
, l
);
7157 coerced_args
= coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parms
),
7158 args
, in_decl
, complain
,
7161 return coerced_args
;
7164 /* Returns 1 if template args OT and NT are equivalent. */
7167 template_args_equal (tree ot
, tree nt
)
7171 if (nt
== NULL_TREE
|| ot
== NULL_TREE
)
7174 if (TREE_CODE (nt
) == TREE_VEC
)
7175 /* For member templates */
7176 return TREE_CODE (ot
) == TREE_VEC
&& comp_template_args (ot
, nt
);
7177 else if (PACK_EXPANSION_P (ot
))
7178 return (PACK_EXPANSION_P (nt
)
7179 && template_args_equal (PACK_EXPANSION_PATTERN (ot
),
7180 PACK_EXPANSION_PATTERN (nt
))
7181 && template_args_equal (PACK_EXPANSION_EXTRA_ARGS (ot
),
7182 PACK_EXPANSION_EXTRA_ARGS (nt
)));
7183 else if (ARGUMENT_PACK_P (ot
))
7188 if (!ARGUMENT_PACK_P (nt
))
7191 opack
= ARGUMENT_PACK_ARGS (ot
);
7192 npack
= ARGUMENT_PACK_ARGS (nt
);
7193 len
= TREE_VEC_LENGTH (opack
);
7194 if (TREE_VEC_LENGTH (npack
) != len
)
7196 for (i
= 0; i
< len
; ++i
)
7197 if (!template_args_equal (TREE_VEC_ELT (opack
, i
),
7198 TREE_VEC_ELT (npack
, i
)))
7202 else if (ot
&& TREE_CODE (ot
) == ARGUMENT_PACK_SELECT
)
7204 /* We get here probably because we are in the middle of substituting
7205 into the pattern of a pack expansion. In that case the
7206 ARGUMENT_PACK_SELECT temporarily replaces the pack argument we are
7207 interested in. So we want to use the initial pack argument for
7209 ot
= ARGUMENT_PACK_SELECT_FROM_PACK (ot
);
7210 if (nt
&& TREE_CODE (nt
) == ARGUMENT_PACK_SELECT
)
7211 nt
= ARGUMENT_PACK_SELECT_FROM_PACK (nt
);
7212 return template_args_equal (ot
, nt
);
7214 else if (TYPE_P (nt
))
7215 return TYPE_P (ot
) && same_type_p (ot
, nt
);
7216 else if (TREE_CODE (ot
) == TREE_VEC
|| TYPE_P (ot
))
7219 return cp_tree_equal (ot
, nt
);
7222 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets of
7223 template arguments. Returns 0 otherwise, and updates OLDARG_PTR and
7224 NEWARG_PTR with the offending arguments if they are non-NULL. */
7227 comp_template_args_with_info (tree oldargs
, tree newargs
,
7228 tree
*oldarg_ptr
, tree
*newarg_ptr
)
7232 if (oldargs
== newargs
)
7235 if (!oldargs
|| !newargs
)
7238 if (TREE_VEC_LENGTH (oldargs
) != TREE_VEC_LENGTH (newargs
))
7241 for (i
= 0; i
< TREE_VEC_LENGTH (oldargs
); ++i
)
7243 tree nt
= TREE_VEC_ELT (newargs
, i
);
7244 tree ot
= TREE_VEC_ELT (oldargs
, i
);
7246 if (! template_args_equal (ot
, nt
))
7248 if (oldarg_ptr
!= NULL
)
7250 if (newarg_ptr
!= NULL
)
7258 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets
7259 of template arguments. Returns 0 otherwise. */
7262 comp_template_args (tree oldargs
, tree newargs
)
7264 return comp_template_args_with_info (oldargs
, newargs
, NULL
, NULL
);
7268 add_pending_template (tree d
)
7270 tree ti
= (TYPE_P (d
)
7271 ? CLASSTYPE_TEMPLATE_INFO (d
)
7272 : DECL_TEMPLATE_INFO (d
));
7273 struct pending_template
*pt
;
7276 if (TI_PENDING_TEMPLATE_FLAG (ti
))
7279 /* We are called both from instantiate_decl, where we've already had a
7280 tinst_level pushed, and instantiate_template, where we haven't.
7282 level
= !current_tinst_level
|| current_tinst_level
->decl
!= d
;
7285 push_tinst_level (d
);
7287 pt
= ggc_alloc
<pending_template
> ();
7289 pt
->tinst
= current_tinst_level
;
7290 if (last_pending_template
)
7291 last_pending_template
->next
= pt
;
7293 pending_templates
= pt
;
7295 last_pending_template
= pt
;
7297 TI_PENDING_TEMPLATE_FLAG (ti
) = 1;
7304 /* Return a TEMPLATE_ID_EXPR corresponding to the indicated FNS and
7305 ARGLIST. Valid choices for FNS are given in the cp-tree.def
7306 documentation for TEMPLATE_ID_EXPR. */
7309 lookup_template_function (tree fns
, tree arglist
)
7313 if (fns
== error_mark_node
|| arglist
== error_mark_node
)
7314 return error_mark_node
;
7316 gcc_assert (!arglist
|| TREE_CODE (arglist
) == TREE_VEC
);
7318 if (!is_overloaded_fn (fns
) && !identifier_p (fns
))
7320 error ("%q#D is not a function template", fns
);
7321 return error_mark_node
;
7324 if (BASELINK_P (fns
))
7326 BASELINK_FUNCTIONS (fns
) = build2 (TEMPLATE_ID_EXPR
,
7328 BASELINK_FUNCTIONS (fns
),
7333 type
= TREE_TYPE (fns
);
7334 if (TREE_CODE (fns
) == OVERLOAD
|| !type
)
7335 type
= unknown_type_node
;
7337 return build2 (TEMPLATE_ID_EXPR
, type
, fns
, arglist
);
7340 /* Within the scope of a template class S<T>, the name S gets bound
7341 (in build_self_reference) to a TYPE_DECL for the class, not a
7342 TEMPLATE_DECL. If DECL is a TYPE_DECL for current_class_type,
7343 or one of its enclosing classes, and that type is a template,
7344 return the associated TEMPLATE_DECL. Otherwise, the original
7347 Also handle the case when DECL is a TREE_LIST of ambiguous
7348 injected-class-names from different bases. */
7351 maybe_get_template_decl_from_type_decl (tree decl
)
7353 if (decl
== NULL_TREE
)
7356 /* DR 176: A lookup that finds an injected-class-name (10.2
7357 [class.member.lookup]) can result in an ambiguity in certain cases
7358 (for example, if it is found in more than one base class). If all of
7359 the injected-class-names that are found refer to specializations of
7360 the same class template, and if the name is followed by a
7361 template-argument-list, the reference refers to the class template
7362 itself and not a specialization thereof, and is not ambiguous. */
7363 if (TREE_CODE (decl
) == TREE_LIST
)
7365 tree t
, tmpl
= NULL_TREE
;
7366 for (t
= decl
; t
; t
= TREE_CHAIN (t
))
7368 tree elt
= maybe_get_template_decl_from_type_decl (TREE_VALUE (t
));
7371 else if (tmpl
!= elt
)
7374 if (tmpl
&& t
== NULL_TREE
)
7380 return (decl
!= NULL_TREE
7381 && DECL_SELF_REFERENCE_P (decl
)
7382 && CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (decl
)))
7383 ? CLASSTYPE_TI_TEMPLATE (TREE_TYPE (decl
)) : decl
;
7386 /* Given an IDENTIFIER_NODE (or type TEMPLATE_DECL) and a chain of
7387 parameters, find the desired type.
7389 D1 is the PTYPENAME terminal, and ARGLIST is the list of arguments.
7391 IN_DECL, if non-NULL, is the template declaration we are trying to
7394 If ENTERING_SCOPE is nonzero, we are about to enter the scope of
7395 the class we are looking up.
7397 Issue error and warning messages under control of COMPLAIN.
7399 If the template class is really a local class in a template
7400 function, then the FUNCTION_CONTEXT is the function in which it is
7403 ??? Note that this function is currently called *twice* for each
7404 template-id: the first time from the parser, while creating the
7405 incomplete type (finish_template_type), and the second type during the
7406 real instantiation (instantiate_template_class). This is surely something
7407 that we want to avoid. It also causes some problems with argument
7408 coercion (see convert_nontype_argument for more information on this). */
7411 lookup_template_class_1 (tree d1
, tree arglist
, tree in_decl
, tree context
,
7412 int entering_scope
, tsubst_flags_t complain
)
7414 tree templ
= NULL_TREE
, parmlist
;
7421 if (identifier_p (d1
))
7423 tree value
= innermost_non_namespace_value (d1
);
7424 if (value
&& DECL_TEMPLATE_TEMPLATE_PARM_P (value
))
7429 push_decl_namespace (context
);
7430 templ
= lookup_name (d1
);
7431 templ
= maybe_get_template_decl_from_type_decl (templ
);
7433 pop_decl_namespace ();
7436 context
= DECL_CONTEXT (templ
);
7438 else if (TREE_CODE (d1
) == TYPE_DECL
&& MAYBE_CLASS_TYPE_P (TREE_TYPE (d1
)))
7440 tree type
= TREE_TYPE (d1
);
7442 /* If we are declaring a constructor, say A<T>::A<T>, we will get
7443 an implicit typename for the second A. Deal with it. */
7444 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
7445 type
= TREE_TYPE (type
);
7447 if (CLASSTYPE_TEMPLATE_INFO (type
))
7449 templ
= CLASSTYPE_TI_TEMPLATE (type
);
7450 d1
= DECL_NAME (templ
);
7453 else if (TREE_CODE (d1
) == ENUMERAL_TYPE
7454 || (TYPE_P (d1
) && MAYBE_CLASS_TYPE_P (d1
)))
7456 templ
= TYPE_TI_TEMPLATE (d1
);
7457 d1
= DECL_NAME (templ
);
7459 else if (DECL_TYPE_TEMPLATE_P (d1
))
7462 d1
= DECL_NAME (templ
);
7463 context
= DECL_CONTEXT (templ
);
7465 else if (DECL_TEMPLATE_TEMPLATE_PARM_P (d1
))
7468 d1
= DECL_NAME (templ
);
7471 /* Issue an error message if we didn't find a template. */
7474 if (complain
& tf_error
)
7475 error ("%qT is not a template", d1
);
7476 return error_mark_node
;
7479 if (TREE_CODE (templ
) != TEMPLATE_DECL
7480 /* Make sure it's a user visible template, if it was named by
7482 || ((complain
& tf_user
) && !DECL_TEMPLATE_PARM_P (templ
)
7483 && !PRIMARY_TEMPLATE_P (templ
)))
7485 if (complain
& tf_error
)
7487 error ("non-template type %qT used as a template", d1
);
7489 error ("for template declaration %q+D", in_decl
);
7491 return error_mark_node
;
7494 complain
&= ~tf_user
;
7496 /* An alias that just changes the name of a template is equivalent to the
7497 other template, so if any of the arguments are pack expansions, strip
7498 the alias to avoid problems with a pack expansion passed to a non-pack
7499 alias template parameter (DR 1430). */
7500 if (pack_expansion_args_count (INNERMOST_TEMPLATE_ARGS (arglist
)))
7501 templ
= get_underlying_template (templ
);
7503 if (DECL_TEMPLATE_TEMPLATE_PARM_P (templ
))
7505 /* Create a new TEMPLATE_DECL and TEMPLATE_TEMPLATE_PARM node to store
7506 template arguments */
7512 parmlist
= DECL_INNERMOST_TEMPLATE_PARMS (templ
);
7514 /* Consider an example where a template template parameter declared as
7516 template <class T, class U = std::allocator<T> > class TT
7518 The template parameter level of T and U are one level larger than
7519 of TT. To proper process the default argument of U, say when an
7520 instantiation `TT<int>' is seen, we need to build the full
7521 arguments containing {int} as the innermost level. Outer levels,
7522 available when not appearing as default template argument, can be
7523 obtained from the arguments of the enclosing template.
7525 Suppose that TT is later substituted with std::vector. The above
7526 instantiation is `TT<int, std::allocator<T> >' with TT at
7527 level 1, and T at level 2, while the template arguments at level 1
7528 becomes {std::vector} and the inner level 2 is {int}. */
7530 outer
= DECL_CONTEXT (templ
);
7532 outer
= TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (outer
)));
7533 else if (current_template_parms
)
7534 /* This is an argument of the current template, so we haven't set
7535 DECL_CONTEXT yet. */
7536 outer
= current_template_args ();
7539 arglist
= add_to_template_args (outer
, arglist
);
7541 arglist2
= coerce_template_parms (parmlist
, arglist
, templ
,
7543 /*require_all_args=*/true,
7544 /*use_default_args=*/true);
7545 if (arglist2
== error_mark_node
7546 || (!uses_template_parms (arglist2
)
7547 && check_instantiated_args (templ
, arglist2
, complain
)))
7548 return error_mark_node
;
7550 parm
= bind_template_template_parm (TREE_TYPE (templ
), arglist2
);
7555 tree template_type
= TREE_TYPE (templ
);
7558 tree found
= NULL_TREE
;
7561 int is_dependent_type
;
7562 int use_partial_inst_tmpl
= false;
7564 if (template_type
== error_mark_node
)
7565 /* An error occurred while building the template TEMPL, and a
7566 diagnostic has most certainly been emitted for that
7567 already. Let's propagate that error. */
7568 return error_mark_node
;
7570 gen_tmpl
= most_general_template (templ
);
7571 parmlist
= DECL_TEMPLATE_PARMS (gen_tmpl
);
7572 parm_depth
= TMPL_PARMS_DEPTH (parmlist
);
7573 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
7575 if (arg_depth
== 1 && parm_depth
> 1)
7577 /* We've been given an incomplete set of template arguments.
7580 template <class T> struct S1 {
7581 template <class U> struct S2 {};
7582 template <class U> struct S2<U*> {};
7585 we will be called with an ARGLIST of `U*', but the
7586 TEMPLATE will be `template <class T> template
7587 <class U> struct S1<T>::S2'. We must fill in the missing
7590 = add_outermost_template_args (TYPE_TI_ARGS (TREE_TYPE (templ
)),
7592 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
7595 /* Now we should have enough arguments. */
7596 gcc_assert (parm_depth
== arg_depth
);
7598 /* From here on, we're only interested in the most general
7601 /* Calculate the BOUND_ARGS. These will be the args that are
7602 actually tsubst'd into the definition to create the
7606 /* We have multiple levels of arguments to coerce, at once. */
7608 int saved_depth
= TMPL_ARGS_DEPTH (arglist
);
7610 tree bound_args
= make_tree_vec (parm_depth
);
7612 for (i
= saved_depth
,
7613 t
= DECL_TEMPLATE_PARMS (gen_tmpl
);
7614 i
> 0 && t
!= NULL_TREE
;
7615 --i
, t
= TREE_CHAIN (t
))
7618 if (i
== saved_depth
)
7619 a
= coerce_template_parms (TREE_VALUE (t
),
7622 /*require_all_args=*/true,
7623 /*use_default_args=*/true);
7625 /* Outer levels should have already been coerced. */
7626 a
= TMPL_ARGS_LEVEL (arglist
, i
);
7628 /* Don't process further if one of the levels fails. */
7629 if (a
== error_mark_node
)
7631 /* Restore the ARGLIST to its full size. */
7632 TREE_VEC_LENGTH (arglist
) = saved_depth
;
7633 return error_mark_node
;
7636 SET_TMPL_ARGS_LEVEL (bound_args
, i
, a
);
7638 /* We temporarily reduce the length of the ARGLIST so
7639 that coerce_template_parms will see only the arguments
7640 corresponding to the template parameters it is
7642 TREE_VEC_LENGTH (arglist
)--;
7645 /* Restore the ARGLIST to its full size. */
7646 TREE_VEC_LENGTH (arglist
) = saved_depth
;
7648 arglist
= bound_args
;
7652 = coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parmlist
),
7653 INNERMOST_TEMPLATE_ARGS (arglist
),
7656 /*require_all_args=*/true,
7657 /*use_default_args=*/true);
7659 if (arglist
== error_mark_node
)
7660 /* We were unable to bind the arguments. */
7661 return error_mark_node
;
7663 /* In the scope of a template class, explicit references to the
7664 template class refer to the type of the template, not any
7665 instantiation of it. For example, in:
7667 template <class T> class C { void f(C<T>); }
7669 the `C<T>' is just the same as `C'. Outside of the
7670 class, however, such a reference is an instantiation. */
7672 || !PRIMARY_TEMPLATE_P (gen_tmpl
)
7673 || currently_open_class (template_type
))
7674 /* comp_template_args is expensive, check it last. */
7675 && comp_template_args (TYPE_TI_ARGS (template_type
),
7677 return template_type
;
7679 /* If we already have this specialization, return it. */
7680 elt
.tmpl
= gen_tmpl
;
7682 hash
= hash_specialization (&elt
);
7683 entry
= (spec_entry
*) htab_find_with_hash (type_specializations
,
7689 is_dependent_type
= uses_template_parms (arglist
);
7691 /* If the deduced arguments are invalid, then the binding
7693 if (!is_dependent_type
7694 && check_instantiated_args (gen_tmpl
,
7695 INNERMOST_TEMPLATE_ARGS (arglist
),
7697 return error_mark_node
;
7699 if (!is_dependent_type
7700 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
7701 && !LAMBDA_TYPE_P (TREE_TYPE (gen_tmpl
))
7702 && TREE_CODE (CP_DECL_CONTEXT (gen_tmpl
)) == NAMESPACE_DECL
)
7704 found
= xref_tag_from_type (TREE_TYPE (gen_tmpl
),
7705 DECL_NAME (gen_tmpl
),
7706 /*tag_scope=*/ts_global
);
7710 context
= tsubst (DECL_CONTEXT (gen_tmpl
), arglist
,
7712 if (context
== error_mark_node
)
7713 return error_mark_node
;
7716 context
= global_namespace
;
7718 /* Create the type. */
7719 if (DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
7721 /* The user referred to a specialization of an alias
7722 template represented by GEN_TMPL.
7724 [temp.alias]/2 says:
7726 When a template-id refers to the specialization of an
7727 alias template, it is equivalent to the associated
7728 type obtained by substitution of its
7729 template-arguments for the template-parameters in the
7730 type-id of the alias template. */
7732 t
= tsubst (TREE_TYPE (gen_tmpl
), arglist
, complain
, in_decl
);
7733 /* Note that the call above (by indirectly calling
7734 register_specialization in tsubst_decl) registers the
7735 TYPE_DECL representing the specialization of the alias
7736 template. So next time someone substitutes ARGLIST for
7737 the template parms into the alias template (GEN_TMPL),
7738 she'll get that TYPE_DECL back. */
7740 if (t
== error_mark_node
)
7743 else if (TREE_CODE (template_type
) == ENUMERAL_TYPE
)
7745 if (!is_dependent_type
)
7747 set_current_access_from_decl (TYPE_NAME (template_type
));
7748 t
= start_enum (TYPE_IDENTIFIER (template_type
), NULL_TREE
,
7749 tsubst (ENUM_UNDERLYING_TYPE (template_type
),
7750 arglist
, complain
, in_decl
),
7751 SCOPED_ENUM_P (template_type
), NULL
);
7753 if (t
== error_mark_node
)
7758 /* We don't want to call start_enum for this type, since
7759 the values for the enumeration constants may involve
7760 template parameters. And, no one should be interested
7761 in the enumeration constants for such a type. */
7762 t
= cxx_make_type (ENUMERAL_TYPE
);
7763 SET_SCOPED_ENUM_P (t
, SCOPED_ENUM_P (template_type
));
7765 SET_OPAQUE_ENUM_P (t
, OPAQUE_ENUM_P (template_type
));
7766 ENUM_FIXED_UNDERLYING_TYPE_P (t
)
7767 = ENUM_FIXED_UNDERLYING_TYPE_P (template_type
);
7769 else if (CLASS_TYPE_P (template_type
))
7771 t
= make_class_type (TREE_CODE (template_type
));
7772 CLASSTYPE_DECLARED_CLASS (t
)
7773 = CLASSTYPE_DECLARED_CLASS (template_type
);
7774 SET_CLASSTYPE_IMPLICIT_INSTANTIATION (t
);
7775 TYPE_FOR_JAVA (t
) = TYPE_FOR_JAVA (template_type
);
7777 /* A local class. Make sure the decl gets registered properly. */
7778 if (context
== current_function_decl
)
7779 pushtag (DECL_NAME (gen_tmpl
), t
, /*tag_scope=*/ts_current
);
7781 if (comp_template_args (CLASSTYPE_TI_ARGS (template_type
), arglist
))
7782 /* This instantiation is another name for the primary
7783 template type. Set the TYPE_CANONICAL field
7785 TYPE_CANONICAL (t
) = template_type
;
7786 else if (any_template_arguments_need_structural_equality_p (arglist
))
7787 /* Some of the template arguments require structural
7788 equality testing, so this template class requires
7789 structural equality testing. */
7790 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7795 /* If we called start_enum or pushtag above, this information
7796 will already be set up. */
7799 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
7801 type_decl
= create_implicit_typedef (DECL_NAME (gen_tmpl
), t
);
7802 DECL_CONTEXT (type_decl
) = TYPE_CONTEXT (t
);
7803 DECL_SOURCE_LOCATION (type_decl
)
7804 = DECL_SOURCE_LOCATION (TYPE_STUB_DECL (template_type
));
7807 type_decl
= TYPE_NAME (t
);
7809 if (CLASS_TYPE_P (template_type
))
7811 TREE_PRIVATE (type_decl
)
7812 = TREE_PRIVATE (TYPE_MAIN_DECL (template_type
));
7813 TREE_PROTECTED (type_decl
)
7814 = TREE_PROTECTED (TYPE_MAIN_DECL (template_type
));
7815 if (CLASSTYPE_VISIBILITY_SPECIFIED (template_type
))
7817 DECL_VISIBILITY_SPECIFIED (type_decl
) = 1;
7818 DECL_VISIBILITY (type_decl
) = CLASSTYPE_VISIBILITY (template_type
);
7822 if (OVERLOAD_TYPE_P (t
)
7823 && !DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
7825 = lookup_attribute ("abi_tag", TYPE_ATTRIBUTES (template_type
)))
7826 TYPE_ATTRIBUTES (t
) = attributes
;
7828 /* Let's consider the explicit specialization of a member
7829 of a class template specialization that is implicitly instantiated,
7834 template<class U> struct M {}; //#0
7839 struct S<int>::M<char> //#1
7843 [temp.expl.spec]/4 says this is valid.
7845 In this case, when we write:
7848 M is instantiated from the CLASSTYPE_TI_TEMPLATE of #1, not from
7851 When we encounter #1, we want to store the partial instantiation
7852 of M (template<class T> S<int>::M<T>) in its CLASSTYPE_TI_TEMPLATE.
7854 For all cases other than this "explicit specialization of member of a
7855 class template", we just want to store the most general template into
7856 the CLASSTYPE_TI_TEMPLATE of M.
7858 This case of "explicit specialization of member of a class template"
7860 1/ the enclosing class is an instantiation of, and therefore not
7861 the same as, the context of the most general template, and
7862 2/ we aren't looking at the partial instantiation itself, i.e.
7863 the innermost arguments are not the same as the innermost parms of
7864 the most general template.
7866 So it's only when 1/ and 2/ happens that we want to use the partial
7867 instantiation of the member template in lieu of its most general
7870 if (PRIMARY_TEMPLATE_P (gen_tmpl
)
7871 && TMPL_ARGS_HAVE_MULTIPLE_LEVELS (arglist
)
7872 /* the enclosing class must be an instantiation... */
7873 && CLASS_TYPE_P (context
)
7874 && !same_type_p (context
, DECL_CONTEXT (gen_tmpl
)))
7876 tree partial_inst_args
;
7877 TREE_VEC_LENGTH (arglist
)--;
7878 ++processing_template_decl
;
7880 tsubst (INNERMOST_TEMPLATE_ARGS
7881 (TYPE_TI_ARGS (TREE_TYPE (gen_tmpl
))),
7882 arglist
, complain
, NULL_TREE
);
7883 --processing_template_decl
;
7884 TREE_VEC_LENGTH (arglist
)++;
7885 use_partial_inst_tmpl
=
7886 /*...and we must not be looking at the partial instantiation
7888 !comp_template_args (INNERMOST_TEMPLATE_ARGS (arglist
),
7892 if (!use_partial_inst_tmpl
)
7893 /* This case is easy; there are no member templates involved. */
7897 /* This is a full instantiation of a member template. Find
7898 the partial instantiation of which this is an instance. */
7900 /* Temporarily reduce by one the number of levels in the ARGLIST
7901 so as to avoid comparing the last set of arguments. */
7902 TREE_VEC_LENGTH (arglist
)--;
7903 found
= tsubst (gen_tmpl
, arglist
, complain
, NULL_TREE
);
7904 TREE_VEC_LENGTH (arglist
)++;
7905 /* FOUND is either a proper class type, or an alias
7906 template specialization. In the later case, it's a
7907 TYPE_DECL, resulting from the substituting of arguments
7908 for parameters in the TYPE_DECL of the alias template
7909 done earlier. So be careful while getting the template
7911 found
= TREE_CODE (found
) == TYPE_DECL
7912 ? TYPE_TI_TEMPLATE (TREE_TYPE (found
))
7913 : CLASSTYPE_TI_TEMPLATE (found
);
7916 SET_TYPE_TEMPLATE_INFO (t
, build_template_info (found
, arglist
));
7919 slot
= htab_find_slot_with_hash (type_specializations
,
7920 &elt
, hash
, INSERT
);
7921 entry
= ggc_alloc
<spec_entry
> ();
7925 /* Note this use of the partial instantiation so we can check it
7926 later in maybe_process_partial_specialization. */
7927 DECL_TEMPLATE_INSTANTIATIONS (found
)
7928 = tree_cons (arglist
, t
,
7929 DECL_TEMPLATE_INSTANTIATIONS (found
));
7931 if (TREE_CODE (template_type
) == ENUMERAL_TYPE
&& !is_dependent_type
7932 && !DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
7933 /* Now that the type has been registered on the instantiations
7934 list, we set up the enumerators. Because the enumeration
7935 constants may involve the enumeration type itself, we make
7936 sure to register the type first, and then create the
7937 constants. That way, doing tsubst_expr for the enumeration
7938 constants won't result in recursive calls here; we'll find
7939 the instantiation and exit above. */
7940 tsubst_enum (template_type
, t
, arglist
);
7942 if (CLASS_TYPE_P (template_type
) && is_dependent_type
)
7943 /* If the type makes use of template parameters, the
7944 code that generates debugging information will crash. */
7945 DECL_IGNORED_P (TYPE_MAIN_DECL (t
)) = 1;
7947 /* Possibly limit visibility based on template args. */
7948 TREE_PUBLIC (type_decl
) = 1;
7949 determine_visibility (type_decl
);
7955 /* Wrapper for lookup_template_class_1. */
7958 lookup_template_class (tree d1
, tree arglist
, tree in_decl
, tree context
,
7959 int entering_scope
, tsubst_flags_t complain
)
7962 timevar_push (TV_TEMPLATE_INST
);
7963 ret
= lookup_template_class_1 (d1
, arglist
, in_decl
, context
,
7964 entering_scope
, complain
);
7965 timevar_pop (TV_TEMPLATE_INST
);
7969 /* Return a TEMPLATE_ID_EXPR for the given variable template and ARGLIST.
7970 If the ARGLIST refers to any template parameters, the type of the
7971 expression is the unknown_type_node since the template-id could
7972 refer to an explicit or partial specialization. */
7975 lookup_template_variable (tree templ
, tree arglist
)
7978 if (uses_template_parms (arglist
))
7979 type
= unknown_type_node
;
7981 type
= TREE_TYPE (templ
);
7982 return build2 (TEMPLATE_ID_EXPR
, type
, templ
, arglist
);
7990 /* True when we should also visit template parameters that occur in
7991 non-deduced contexts. */
7992 bool include_nondeduced_p
;
7993 hash_set
<tree
> *visited
;
7996 /* Called from for_each_template_parm via walk_tree. */
7999 for_each_template_parm_r (tree
*tp
, int *walk_subtrees
, void *d
)
8002 struct pair_fn_data
*pfd
= (struct pair_fn_data
*) d
;
8003 tree_fn_t fn
= pfd
->fn
;
8004 void *data
= pfd
->data
;
8007 && (pfd
->include_nondeduced_p
|| TREE_CODE (t
) != TYPENAME_TYPE
)
8008 && for_each_template_parm (TYPE_CONTEXT (t
), fn
, data
, pfd
->visited
,
8009 pfd
->include_nondeduced_p
))
8010 return error_mark_node
;
8012 switch (TREE_CODE (t
))
8015 if (TYPE_PTRMEMFUNC_P (t
))
8021 if (!TYPE_TEMPLATE_INFO (t
))
8023 else if (for_each_template_parm (TYPE_TI_ARGS (t
),
8024 fn
, data
, pfd
->visited
,
8025 pfd
->include_nondeduced_p
))
8026 return error_mark_node
;
8030 if (for_each_template_parm (TYPE_MIN_VALUE (t
),
8031 fn
, data
, pfd
->visited
,
8032 pfd
->include_nondeduced_p
)
8033 || for_each_template_parm (TYPE_MAX_VALUE (t
),
8034 fn
, data
, pfd
->visited
,
8035 pfd
->include_nondeduced_p
))
8036 return error_mark_node
;
8040 /* Since we're not going to walk subtrees, we have to do this
8042 if (for_each_template_parm (TYPE_METHOD_BASETYPE (t
), fn
, data
,
8043 pfd
->visited
, pfd
->include_nondeduced_p
))
8044 return error_mark_node
;
8048 /* Check the return type. */
8049 if (for_each_template_parm (TREE_TYPE (t
), fn
, data
, pfd
->visited
,
8050 pfd
->include_nondeduced_p
))
8051 return error_mark_node
;
8053 /* Check the parameter types. Since default arguments are not
8054 instantiated until they are needed, the TYPE_ARG_TYPES may
8055 contain expressions that involve template parameters. But,
8056 no-one should be looking at them yet. And, once they're
8057 instantiated, they don't contain template parameters, so
8058 there's no point in looking at them then, either. */
8062 for (parm
= TYPE_ARG_TYPES (t
); parm
; parm
= TREE_CHAIN (parm
))
8063 if (for_each_template_parm (TREE_VALUE (parm
), fn
, data
,
8064 pfd
->visited
, pfd
->include_nondeduced_p
))
8065 return error_mark_node
;
8067 /* Since we've already handled the TYPE_ARG_TYPES, we don't
8068 want walk_tree walking into them itself. */
8074 case UNDERLYING_TYPE
:
8075 if (pfd
->include_nondeduced_p
8076 && for_each_template_parm (TYPE_FIELDS (t
), fn
, data
,
8078 pfd
->include_nondeduced_p
))
8079 return error_mark_node
;
8084 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
)
8085 && for_each_template_parm (DECL_TI_ARGS (t
), fn
, data
,
8086 pfd
->visited
, pfd
->include_nondeduced_p
))
8087 return error_mark_node
;
8092 if (TREE_CODE (t
) == CONST_DECL
&& DECL_TEMPLATE_PARM_P (t
)
8093 && for_each_template_parm (DECL_INITIAL (t
), fn
, data
,
8094 pfd
->visited
, pfd
->include_nondeduced_p
))
8095 return error_mark_node
;
8096 if (DECL_CONTEXT (t
)
8097 && pfd
->include_nondeduced_p
8098 && for_each_template_parm (DECL_CONTEXT (t
), fn
, data
,
8099 pfd
->visited
, pfd
->include_nondeduced_p
))
8100 return error_mark_node
;
8103 case BOUND_TEMPLATE_TEMPLATE_PARM
:
8104 /* Record template parameters such as `T' inside `TT<T>'. */
8105 if (for_each_template_parm (TYPE_TI_ARGS (t
), fn
, data
, pfd
->visited
,
8106 pfd
->include_nondeduced_p
))
8107 return error_mark_node
;
8110 case TEMPLATE_TEMPLATE_PARM
:
8111 case TEMPLATE_TYPE_PARM
:
8112 case TEMPLATE_PARM_INDEX
:
8113 if (fn
&& (*fn
)(t
, data
))
8114 return error_mark_node
;
8116 return error_mark_node
;
8120 /* A template template parameter is encountered. */
8121 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
)
8122 && for_each_template_parm (TREE_TYPE (t
), fn
, data
, pfd
->visited
,
8123 pfd
->include_nondeduced_p
))
8124 return error_mark_node
;
8126 /* Already substituted template template parameter */
8132 || for_each_template_parm (TYPENAME_TYPE_FULLNAME (t
), fn
,
8134 pfd
->include_nondeduced_p
))
8135 return error_mark_node
;
8139 if (TREE_TYPE (t
) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t
))
8140 && pfd
->include_nondeduced_p
8141 && for_each_template_parm (TYPE_PTRMEMFUNC_FN_TYPE
8142 (TREE_TYPE (t
)), fn
, data
,
8143 pfd
->visited
, pfd
->include_nondeduced_p
))
8144 return error_mark_node
;
8149 /* If there's no type, then this thing must be some expression
8150 involving template parameters. */
8151 if (!fn
&& !TREE_TYPE (t
))
8152 return error_mark_node
;
8157 case IMPLICIT_CONV_EXPR
:
8158 case REINTERPRET_CAST_EXPR
:
8159 case CONST_CAST_EXPR
:
8160 case STATIC_CAST_EXPR
:
8161 case DYNAMIC_CAST_EXPR
:
8165 case PSEUDO_DTOR_EXPR
:
8167 return error_mark_node
;
8174 /* We didn't find any template parameters we liked. */
8178 /* For each TEMPLATE_TYPE_PARM, TEMPLATE_TEMPLATE_PARM,
8179 BOUND_TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX in T,
8180 call FN with the parameter and the DATA.
8181 If FN returns nonzero, the iteration is terminated, and
8182 for_each_template_parm returns 1. Otherwise, the iteration
8183 continues. If FN never returns a nonzero value, the value
8184 returned by for_each_template_parm is 0. If FN is NULL, it is
8185 considered to be the function which always returns 1.
8187 If INCLUDE_NONDEDUCED_P, then this routine will also visit template
8188 parameters that occur in non-deduced contexts. When false, only
8189 visits those template parameters that can be deduced. */
8192 for_each_template_parm (tree t
, tree_fn_t fn
, void* data
,
8193 hash_set
<tree
> *visited
,
8194 bool include_nondeduced_p
)
8196 struct pair_fn_data pfd
;
8202 pfd
.include_nondeduced_p
= include_nondeduced_p
;
8204 /* Walk the tree. (Conceptually, we would like to walk without
8205 duplicates, but for_each_template_parm_r recursively calls
8206 for_each_template_parm, so we would need to reorganize a fair
8207 bit to use walk_tree_without_duplicates, so we keep our own
8210 pfd
.visited
= visited
;
8212 pfd
.visited
= new hash_set
<tree
>;
8213 result
= cp_walk_tree (&t
,
8214 for_each_template_parm_r
,
8216 pfd
.visited
) != NULL_TREE
;
8228 /* Returns true if T depends on any template parameter. */
8231 uses_template_parms (tree t
)
8234 int saved_processing_template_decl
;
8236 saved_processing_template_decl
= processing_template_decl
;
8237 if (!saved_processing_template_decl
)
8238 processing_template_decl
= 1;
8240 dependent_p
= dependent_type_p (t
);
8241 else if (TREE_CODE (t
) == TREE_VEC
)
8242 dependent_p
= any_dependent_template_arguments_p (t
);
8243 else if (TREE_CODE (t
) == TREE_LIST
)
8244 dependent_p
= (uses_template_parms (TREE_VALUE (t
))
8245 || uses_template_parms (TREE_CHAIN (t
)));
8246 else if (TREE_CODE (t
) == TYPE_DECL
)
8247 dependent_p
= dependent_type_p (TREE_TYPE (t
));
8250 || TREE_CODE (t
) == TEMPLATE_PARM_INDEX
8251 || TREE_CODE (t
) == OVERLOAD
8254 || TREE_CODE (t
) == TRAIT_EXPR
8255 || TREE_CODE (t
) == CONSTRUCTOR
8256 || CONSTANT_CLASS_P (t
))
8257 dependent_p
= (type_dependent_expression_p (t
)
8258 || value_dependent_expression_p (t
));
8261 gcc_assert (t
== error_mark_node
);
8262 dependent_p
= false;
8265 processing_template_decl
= saved_processing_template_decl
;
8270 /* Returns true iff current_function_decl is an incompletely instantiated
8271 template. Useful instead of processing_template_decl because the latter
8272 is set to 0 during fold_non_dependent_expr. */
8275 in_template_function (void)
8277 tree fn
= current_function_decl
;
8279 ++processing_template_decl
;
8280 ret
= (fn
&& DECL_LANG_SPECIFIC (fn
)
8281 && DECL_TEMPLATE_INFO (fn
)
8282 && any_dependent_template_arguments_p (DECL_TI_ARGS (fn
)));
8283 --processing_template_decl
;
8287 /* Returns true if T depends on any template parameter with level LEVEL. */
8290 uses_template_parms_level (tree t
, int level
)
8292 return for_each_template_parm (t
, template_parm_this_level_p
, &level
, NULL
,
8293 /*include_nondeduced_p=*/true);
8296 /* Returns TRUE iff INST is an instantiation we don't need to do in an
8297 ill-formed translation unit, i.e. a variable or function that isn't
8298 usable in a constant expression. */
8301 neglectable_inst_p (tree d
)
8304 && !(TREE_CODE (d
) == FUNCTION_DECL
? DECL_DECLARED_CONSTEXPR_P (d
)
8305 : decl_maybe_constant_var_p (d
)));
8308 /* Returns TRUE iff we should refuse to instantiate DECL because it's
8309 neglectable and instantiated from within an erroneous instantiation. */
8312 limit_bad_template_recursion (tree decl
)
8314 struct tinst_level
*lev
= current_tinst_level
;
8315 int errs
= errorcount
+ sorrycount
;
8316 if (lev
== NULL
|| errs
== 0 || !neglectable_inst_p (decl
))
8319 for (; lev
; lev
= lev
->next
)
8320 if (neglectable_inst_p (lev
->decl
))
8323 return (lev
&& errs
> lev
->errors
);
8326 static int tinst_depth
;
8327 extern int max_tinst_depth
;
8330 static GTY(()) struct tinst_level
*last_error_tinst_level
;
8332 /* We're starting to instantiate D; record the template instantiation context
8333 for diagnostics and to restore it later. */
8336 push_tinst_level (tree d
)
8338 struct tinst_level
*new_level
;
8340 if (tinst_depth
>= max_tinst_depth
)
8342 last_error_tinst_level
= current_tinst_level
;
8343 if (TREE_CODE (d
) == TREE_LIST
)
8344 error ("template instantiation depth exceeds maximum of %d (use "
8345 "-ftemplate-depth= to increase the maximum) substituting %qS",
8346 max_tinst_depth
, d
);
8348 error ("template instantiation depth exceeds maximum of %d (use "
8349 "-ftemplate-depth= to increase the maximum) instantiating %qD",
8350 max_tinst_depth
, d
);
8352 print_instantiation_context ();
8357 /* If the current instantiation caused problems, don't let it instantiate
8358 anything else. Do allow deduction substitution and decls usable in
8359 constant expressions. */
8360 if (limit_bad_template_recursion (d
))
8363 new_level
= ggc_alloc
<tinst_level
> ();
8364 new_level
->decl
= d
;
8365 new_level
->locus
= input_location
;
8366 new_level
->errors
= errorcount
+sorrycount
;
8367 new_level
->in_system_header_p
= in_system_header_at (input_location
);
8368 new_level
->next
= current_tinst_level
;
8369 current_tinst_level
= new_level
;
8372 if (GATHER_STATISTICS
&& (tinst_depth
> depth_reached
))
8373 depth_reached
= tinst_depth
;
8378 /* We're done instantiating this template; return to the instantiation
8382 pop_tinst_level (void)
8384 /* Restore the filename and line number stashed away when we started
8385 this instantiation. */
8386 input_location
= current_tinst_level
->locus
;
8387 current_tinst_level
= current_tinst_level
->next
;
8391 /* We're instantiating a deferred template; restore the template
8392 instantiation context in which the instantiation was requested, which
8393 is one step out from LEVEL. Return the corresponding DECL or TYPE. */
8396 reopen_tinst_level (struct tinst_level
*level
)
8398 struct tinst_level
*t
;
8401 for (t
= level
; t
; t
= t
->next
)
8404 current_tinst_level
= level
;
8406 if (current_tinst_level
)
8407 current_tinst_level
->errors
= errorcount
+sorrycount
;
8411 /* Returns the TINST_LEVEL which gives the original instantiation
8414 struct tinst_level
*
8415 outermost_tinst_level (void)
8417 struct tinst_level
*level
= current_tinst_level
;
8420 level
= level
->next
;
8424 /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the
8425 vector of template arguments, as for tsubst.
8427 Returns an appropriate tsubst'd friend declaration. */
8430 tsubst_friend_function (tree decl
, tree args
)
8434 if (TREE_CODE (decl
) == FUNCTION_DECL
8435 && DECL_TEMPLATE_INSTANTIATION (decl
)
8436 && TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
8437 /* This was a friend declared with an explicit template
8438 argument list, e.g.:
8442 to indicate that f was a template instantiation, not a new
8443 function declaration. Now, we have to figure out what
8444 instantiation of what template. */
8446 tree template_id
, arglist
, fns
;
8449 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (current_class_type
));
8451 /* Friend functions are looked up in the containing namespace scope.
8452 We must enter that scope, to avoid finding member functions of the
8453 current class with same name. */
8454 push_nested_namespace (ns
);
8455 fns
= tsubst_expr (DECL_TI_TEMPLATE (decl
), args
,
8456 tf_warning_or_error
, NULL_TREE
,
8457 /*integral_constant_expression_p=*/false);
8458 pop_nested_namespace (ns
);
8459 arglist
= tsubst (DECL_TI_ARGS (decl
), args
,
8460 tf_warning_or_error
, NULL_TREE
);
8461 template_id
= lookup_template_function (fns
, arglist
);
8463 new_friend
= tsubst (decl
, args
, tf_warning_or_error
, NULL_TREE
);
8464 tmpl
= determine_specialization (template_id
, new_friend
,
8466 /*need_member_template=*/0,
8467 TREE_VEC_LENGTH (args
),
8469 return instantiate_template (tmpl
, new_args
, tf_error
);
8472 new_friend
= tsubst (decl
, args
, tf_warning_or_error
, NULL_TREE
);
8474 /* The NEW_FRIEND will look like an instantiation, to the
8475 compiler, but is not an instantiation from the point of view of
8476 the language. For example, we might have had:
8478 template <class T> struct S {
8479 template <class U> friend void f(T, U);
8482 Then, in S<int>, template <class U> void f(int, U) is not an
8483 instantiation of anything. */
8484 if (new_friend
== error_mark_node
)
8485 return error_mark_node
;
8487 DECL_USE_TEMPLATE (new_friend
) = 0;
8488 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
8490 DECL_USE_TEMPLATE (DECL_TEMPLATE_RESULT (new_friend
)) = 0;
8491 DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (new_friend
))
8492 = DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (decl
));
8495 /* The mangled name for the NEW_FRIEND is incorrect. The function
8496 is not a template instantiation and should not be mangled like
8497 one. Therefore, we forget the mangling here; we'll recompute it
8498 later if we need it. */
8499 if (TREE_CODE (new_friend
) != TEMPLATE_DECL
)
8501 SET_DECL_RTL (new_friend
, NULL
);
8502 SET_DECL_ASSEMBLER_NAME (new_friend
, NULL_TREE
);
8505 if (DECL_NAMESPACE_SCOPE_P (new_friend
))
8508 tree new_friend_template_info
;
8509 tree new_friend_result_template_info
;
8511 int new_friend_is_defn
;
8513 /* We must save some information from NEW_FRIEND before calling
8514 duplicate decls since that function will free NEW_FRIEND if
8516 new_friend_template_info
= DECL_TEMPLATE_INFO (new_friend
);
8517 new_friend_is_defn
=
8518 (DECL_INITIAL (DECL_TEMPLATE_RESULT
8519 (template_for_substitution (new_friend
)))
8521 if (TREE_CODE (new_friend
) == TEMPLATE_DECL
)
8523 /* This declaration is a `primary' template. */
8524 DECL_PRIMARY_TEMPLATE (new_friend
) = new_friend
;
8526 new_friend_result_template_info
8527 = DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (new_friend
));
8530 new_friend_result_template_info
= NULL_TREE
;
8532 /* Make the init_value nonzero so pushdecl knows this is a defn. */
8533 if (new_friend_is_defn
)
8534 DECL_INITIAL (new_friend
) = error_mark_node
;
8536 /* Inside pushdecl_namespace_level, we will push into the
8537 current namespace. However, the friend function should go
8538 into the namespace of the template. */
8539 ns
= decl_namespace_context (new_friend
);
8540 push_nested_namespace (ns
);
8541 old_decl
= pushdecl_namespace_level (new_friend
, /*is_friend=*/true);
8542 pop_nested_namespace (ns
);
8544 if (old_decl
== error_mark_node
)
8545 return error_mark_node
;
8547 if (old_decl
!= new_friend
)
8549 /* This new friend declaration matched an existing
8550 declaration. For example, given:
8552 template <class T> void f(T);
8553 template <class U> class C {
8554 template <class T> friend void f(T) {}
8557 the friend declaration actually provides the definition
8558 of `f', once C has been instantiated for some type. So,
8559 old_decl will be the out-of-class template declaration,
8560 while new_friend is the in-class definition.
8562 But, if `f' was called before this point, the
8563 instantiation of `f' will have DECL_TI_ARGS corresponding
8564 to `T' but not to `U', references to which might appear
8565 in the definition of `f'. Previously, the most general
8566 template for an instantiation of `f' was the out-of-class
8567 version; now it is the in-class version. Therefore, we
8568 run through all specialization of `f', adding to their
8569 DECL_TI_ARGS appropriately. In particular, they need a
8570 new set of outer arguments, corresponding to the
8571 arguments for this class instantiation.
8573 The same situation can arise with something like this:
8576 template <class T> class C {
8580 when `C<int>' is instantiated. Now, `f(int)' is defined
8583 if (!new_friend_is_defn
)
8584 /* On the other hand, if the in-class declaration does
8585 *not* provide a definition, then we don't want to alter
8586 existing definitions. We can just leave everything
8591 tree new_template
= TI_TEMPLATE (new_friend_template_info
);
8592 tree new_args
= TI_ARGS (new_friend_template_info
);
8594 /* Overwrite whatever template info was there before, if
8595 any, with the new template information pertaining to
8597 DECL_TEMPLATE_INFO (old_decl
) = new_friend_template_info
;
8599 if (TREE_CODE (old_decl
) != TEMPLATE_DECL
)
8601 /* We should have called reregister_specialization in
8603 gcc_assert (retrieve_specialization (new_template
,
8607 /* Instantiate it if the global has already been used. */
8608 if (DECL_ODR_USED (old_decl
))
8609 instantiate_decl (old_decl
, /*defer_ok=*/true,
8610 /*expl_inst_class_mem_p=*/false);
8616 /* Indicate that the old function template is a partial
8618 DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (old_decl
))
8619 = new_friend_result_template_info
;
8621 gcc_assert (new_template
8622 == most_general_template (new_template
));
8623 gcc_assert (new_template
!= old_decl
);
8625 /* Reassign any specializations already in the hash table
8626 to the new more general template, and add the
8627 additional template args. */
8628 for (t
= DECL_TEMPLATE_INSTANTIATIONS (old_decl
);
8632 tree spec
= TREE_VALUE (t
);
8635 elt
.tmpl
= old_decl
;
8636 elt
.args
= DECL_TI_ARGS (spec
);
8637 elt
.spec
= NULL_TREE
;
8639 htab_remove_elt (decl_specializations
, &elt
);
8642 = add_outermost_template_args (new_args
,
8643 DECL_TI_ARGS (spec
));
8645 register_specialization
8646 (spec
, new_template
, DECL_TI_ARGS (spec
), true, 0);
8649 DECL_TEMPLATE_INSTANTIATIONS (old_decl
) = NULL_TREE
;
8653 /* The information from NEW_FRIEND has been merged into OLD_DECL
8654 by duplicate_decls. */
8655 new_friend
= old_decl
;
8660 tree context
= DECL_CONTEXT (new_friend
);
8664 template <class T> class C {
8665 template <class U> friend void C1<U>::f (); // case 1
8666 friend void C2<T>::f (); // case 2
8668 we only need to make sure CONTEXT is a complete type for
8669 case 2. To distinguish between the two cases, we note that
8670 CONTEXT of case 1 remains dependent type after tsubst while
8671 this isn't true for case 2. */
8672 ++processing_template_decl
;
8673 dependent_p
= dependent_type_p (context
);
8674 --processing_template_decl
;
8677 && !complete_type_or_else (context
, NULL_TREE
))
8678 return error_mark_node
;
8680 if (COMPLETE_TYPE_P (context
))
8682 tree fn
= new_friend
;
8683 /* do_friend adds the TEMPLATE_DECL for any member friend
8684 template even if it isn't a member template, i.e.
8685 template <class T> friend A<T>::f();
8686 Look through it in that case. */
8687 if (TREE_CODE (fn
) == TEMPLATE_DECL
8688 && !PRIMARY_TEMPLATE_P (fn
))
8689 fn
= DECL_TEMPLATE_RESULT (fn
);
8690 /* Check to see that the declaration is really present, and,
8691 possibly obtain an improved declaration. */
8692 fn
= check_classfn (context
, fn
, NULL_TREE
);
8702 /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of
8703 template arguments, as for tsubst.
8705 Returns an appropriate tsubst'd friend type or error_mark_node on
8709 tsubst_friend_class (tree friend_tmpl
, tree args
)
8715 if (DECL_TEMPLATE_TEMPLATE_PARM_P (friend_tmpl
))
8717 tree t
= tsubst (TREE_TYPE (friend_tmpl
), args
, tf_none
, NULL_TREE
);
8718 return TREE_TYPE (t
);
8721 context
= CP_DECL_CONTEXT (friend_tmpl
);
8723 if (context
!= global_namespace
)
8725 if (TREE_CODE (context
) == NAMESPACE_DECL
)
8726 push_nested_namespace (context
);
8728 push_nested_class (tsubst (context
, args
, tf_none
, NULL_TREE
));
8731 /* Look for a class template declaration. We look for hidden names
8732 because two friend declarations of the same template are the
8733 same. For example, in:
8736 template <typename> friend class F;
8738 template <typename> struct B {
8739 template <typename> friend class F;
8742 both F templates are the same. */
8743 tmpl
= lookup_name_real (DECL_NAME (friend_tmpl
), 0, 0,
8744 /*block_p=*/true, 0, LOOKUP_HIDDEN
);
8746 /* But, if we don't find one, it might be because we're in a
8747 situation like this:
8755 Here, in the scope of (say) S<int>, `S' is bound to a TYPE_DECL
8756 for `S<int>', not the TEMPLATE_DECL. */
8757 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
8759 tmpl
= lookup_name_prefer_type (DECL_NAME (friend_tmpl
), 1);
8760 tmpl
= maybe_get_template_decl_from_type_decl (tmpl
);
8763 if (tmpl
&& DECL_CLASS_TEMPLATE_P (tmpl
))
8765 /* The friend template has already been declared. Just
8766 check to see that the declarations match, and install any new
8767 default parameters. We must tsubst the default parameters,
8768 of course. We only need the innermost template parameters
8769 because that is all that redeclare_class_template will look
8771 if (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (friend_tmpl
))
8772 > TMPL_ARGS_DEPTH (args
))
8775 location_t saved_input_location
;
8776 parms
= tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_tmpl
),
8777 args
, tf_warning_or_error
);
8779 saved_input_location
= input_location
;
8780 input_location
= DECL_SOURCE_LOCATION (friend_tmpl
);
8781 redeclare_class_template (TREE_TYPE (tmpl
), parms
);
8782 input_location
= saved_input_location
;
8786 friend_type
= TREE_TYPE (tmpl
);
8790 /* The friend template has not already been declared. In this
8791 case, the instantiation of the template class will cause the
8792 injection of this template into the global scope. */
8793 tmpl
= tsubst (friend_tmpl
, args
, tf_warning_or_error
, NULL_TREE
);
8794 if (tmpl
== error_mark_node
)
8795 return error_mark_node
;
8797 /* The new TMPL is not an instantiation of anything, so we
8798 forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE for
8799 the new type because that is supposed to be the corresponding
8800 template decl, i.e., TMPL. */
8801 DECL_USE_TEMPLATE (tmpl
) = 0;
8802 DECL_TEMPLATE_INFO (tmpl
) = NULL_TREE
;
8803 CLASSTYPE_USE_TEMPLATE (TREE_TYPE (tmpl
)) = 0;
8804 CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl
))
8805 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl
)));
8807 /* Inject this template into the global scope. */
8808 friend_type
= TREE_TYPE (pushdecl_top_level_maybe_friend (tmpl
, true));
8811 if (context
!= global_namespace
)
8813 if (TREE_CODE (context
) == NAMESPACE_DECL
)
8814 pop_nested_namespace (context
);
8816 pop_nested_class ();
8822 /* Returns zero if TYPE cannot be completed later due to circularity.
8823 Otherwise returns one. */
8826 can_complete_type_without_circularity (tree type
)
8828 if (type
== NULL_TREE
|| type
== error_mark_node
)
8830 else if (COMPLETE_TYPE_P (type
))
8832 else if (TREE_CODE (type
) == ARRAY_TYPE
&& TYPE_DOMAIN (type
))
8833 return can_complete_type_without_circularity (TREE_TYPE (type
));
8834 else if (CLASS_TYPE_P (type
)
8835 && TYPE_BEING_DEFINED (TYPE_MAIN_VARIANT (type
)))
8841 static tree
tsubst_omp_clauses (tree
, bool, tree
, tsubst_flags_t
, tree
);
8843 /* Apply any attributes which had to be deferred until instantiation
8844 time. DECL_P, ATTRIBUTES and ATTR_FLAGS are as cplus_decl_attributes;
8845 ARGS, COMPLAIN, IN_DECL are as tsubst. */
8848 apply_late_template_attributes (tree
*decl_p
, tree attributes
, int attr_flags
,
8849 tree args
, tsubst_flags_t complain
, tree in_decl
)
8851 tree last_dep
= NULL_TREE
;
8855 for (t
= attributes
; t
; t
= TREE_CHAIN (t
))
8856 if (ATTR_IS_DEPENDENT (t
))
8859 attributes
= copy_list (attributes
);
8863 if (DECL_P (*decl_p
))
8865 if (TREE_TYPE (*decl_p
) == error_mark_node
)
8867 p
= &DECL_ATTRIBUTES (*decl_p
);
8870 p
= &TYPE_ATTRIBUTES (*decl_p
);
8874 tree late_attrs
= NULL_TREE
;
8875 tree
*q
= &late_attrs
;
8877 for (*p
= attributes
; *p
; )
8880 if (ATTR_IS_DEPENDENT (t
))
8882 *p
= TREE_CHAIN (t
);
8883 TREE_CHAIN (t
) = NULL_TREE
;
8884 if ((flag_openmp
|| flag_cilkplus
)
8885 && is_attribute_p ("omp declare simd",
8886 get_attribute_name (t
))
8889 tree clauses
= TREE_VALUE (TREE_VALUE (t
));
8890 clauses
= tsubst_omp_clauses (clauses
, true, args
,
8892 c_omp_declare_simd_clauses_to_decls (*decl_p
, clauses
);
8893 clauses
= finish_omp_clauses (clauses
);
8894 tree parms
= DECL_ARGUMENTS (*decl_p
);
8896 = c_omp_declare_simd_clauses_to_numbers (parms
, clauses
);
8898 TREE_VALUE (TREE_VALUE (t
)) = clauses
;
8900 TREE_VALUE (t
) = NULL_TREE
;
8902 /* If the first attribute argument is an identifier, don't
8903 pass it through tsubst. Attributes like mode, format,
8904 cleanup and several target specific attributes expect it
8906 else if (attribute_takes_identifier_p (get_attribute_name (t
))
8910 = tsubst_expr (TREE_CHAIN (TREE_VALUE (t
)), args
, complain
,
8912 /*integral_constant_expression_p=*/false);
8913 if (chain
!= TREE_CHAIN (TREE_VALUE (t
)))
8915 = tree_cons (NULL_TREE
, TREE_VALUE (TREE_VALUE (t
)),
8920 = tsubst_expr (TREE_VALUE (t
), args
, complain
, in_decl
,
8921 /*integral_constant_expression_p=*/false);
8923 q
= &TREE_CHAIN (t
);
8926 p
= &TREE_CHAIN (t
);
8929 cplus_decl_attributes (decl_p
, late_attrs
, attr_flags
);
8933 /* Perform (or defer) access check for typedefs that were referenced
8934 from within the template TMPL code.
8935 This is a subroutine of instantiate_decl and instantiate_class_template.
8936 TMPL is the template to consider and TARGS is the list of arguments of
8940 perform_typedefs_access_check (tree tmpl
, tree targs
)
8942 location_t saved_location
;
8944 qualified_typedef_usage_t
*iter
;
8947 || (!CLASS_TYPE_P (tmpl
)
8948 && TREE_CODE (tmpl
) != FUNCTION_DECL
))
8951 saved_location
= input_location
;
8952 FOR_EACH_VEC_SAFE_ELT (get_types_needing_access_check (tmpl
), i
, iter
)
8954 tree type_decl
= iter
->typedef_decl
;
8955 tree type_scope
= iter
->context
;
8957 if (!type_decl
|| !type_scope
|| !CLASS_TYPE_P (type_scope
))
8960 if (uses_template_parms (type_decl
))
8961 type_decl
= tsubst (type_decl
, targs
, tf_error
, NULL_TREE
);
8962 if (uses_template_parms (type_scope
))
8963 type_scope
= tsubst (type_scope
, targs
, tf_error
, NULL_TREE
);
8965 /* Make access check error messages point to the location
8966 of the use of the typedef. */
8967 input_location
= iter
->locus
;
8968 perform_or_defer_access_check (TYPE_BINFO (type_scope
),
8969 type_decl
, type_decl
,
8970 tf_warning_or_error
);
8972 input_location
= saved_location
;
8976 instantiate_class_template_1 (tree type
)
8978 tree templ
, args
, pattern
, t
, member
;
8982 unsigned int saved_maximum_field_alignment
;
8985 if (type
== error_mark_node
)
8986 return error_mark_node
;
8988 if (COMPLETE_OR_OPEN_TYPE_P (type
)
8989 || uses_template_parms (type
))
8992 /* Figure out which template is being instantiated. */
8993 templ
= most_general_template (CLASSTYPE_TI_TEMPLATE (type
));
8994 gcc_assert (TREE_CODE (templ
) == TEMPLATE_DECL
);
8996 /* Determine what specialization of the original template to
8998 t
= most_specialized_class (type
, tf_warning_or_error
);
8999 if (t
== error_mark_node
)
9001 TYPE_BEING_DEFINED (type
) = 1;
9002 return error_mark_node
;
9006 /* This TYPE is actually an instantiation of a partial
9007 specialization. We replace the innermost set of ARGS with
9008 the arguments appropriate for substitution. For example,
9011 template <class T> struct S {};
9012 template <class T> struct S<T*> {};
9014 and supposing that we are instantiating S<int*>, ARGS will
9015 presently be {int*} -- but we need {int}. */
9016 pattern
= TREE_TYPE (t
);
9017 args
= TREE_PURPOSE (t
);
9021 pattern
= TREE_TYPE (templ
);
9022 args
= CLASSTYPE_TI_ARGS (type
);
9025 /* If the template we're instantiating is incomplete, then clearly
9026 there's nothing we can do. */
9027 if (!COMPLETE_TYPE_P (pattern
))
9030 /* If we've recursively instantiated too many templates, stop. */
9031 if (! push_tinst_level (type
))
9034 /* Now we're really doing the instantiation. Mark the type as in
9035 the process of being defined. */
9036 TYPE_BEING_DEFINED (type
) = 1;
9038 /* We may be in the middle of deferred access check. Disable
9040 push_deferring_access_checks (dk_no_deferred
);
9042 fn_context
= decl_function_context (TYPE_MAIN_DECL (type
));
9043 /* Also avoid push_to_top_level for a lambda in an NSDMI. */
9044 if (!fn_context
&& LAMBDA_TYPE_P (type
) && TYPE_CLASS_SCOPE_P (type
))
9045 fn_context
= error_mark_node
;
9047 push_to_top_level ();
9048 /* Use #pragma pack from the template context. */
9049 saved_maximum_field_alignment
= maximum_field_alignment
;
9050 maximum_field_alignment
= TYPE_PRECISION (pattern
);
9052 SET_CLASSTYPE_INTERFACE_UNKNOWN (type
);
9054 /* Set the input location to the most specialized template definition.
9055 This is needed if tsubsting causes an error. */
9056 typedecl
= TYPE_MAIN_DECL (pattern
);
9057 input_location
= DECL_SOURCE_LOCATION (TYPE_NAME (type
)) =
9058 DECL_SOURCE_LOCATION (typedecl
);
9060 TYPE_PACKED (type
) = TYPE_PACKED (pattern
);
9061 TYPE_ALIGN (type
) = TYPE_ALIGN (pattern
);
9062 TYPE_USER_ALIGN (type
) = TYPE_USER_ALIGN (pattern
);
9063 TYPE_FOR_JAVA (type
) = TYPE_FOR_JAVA (pattern
); /* For libjava's JArray<T> */
9064 if (ANON_AGGR_TYPE_P (pattern
))
9065 SET_ANON_AGGR_TYPE_P (type
);
9066 if (CLASSTYPE_VISIBILITY_SPECIFIED (pattern
))
9068 CLASSTYPE_VISIBILITY_SPECIFIED (type
) = 1;
9069 CLASSTYPE_VISIBILITY (type
) = CLASSTYPE_VISIBILITY (pattern
);
9070 /* Adjust visibility for template arguments. */
9071 determine_visibility (TYPE_MAIN_DECL (type
));
9073 if (CLASS_TYPE_P (type
))
9074 CLASSTYPE_FINAL (type
) = CLASSTYPE_FINAL (pattern
);
9076 pbinfo
= TYPE_BINFO (pattern
);
9078 /* We should never instantiate a nested class before its enclosing
9079 class; we need to look up the nested class by name before we can
9080 instantiate it, and that lookup should instantiate the enclosing
9082 gcc_assert (!DECL_CLASS_SCOPE_P (TYPE_MAIN_DECL (pattern
))
9083 || COMPLETE_OR_OPEN_TYPE_P (TYPE_CONTEXT (type
)));
9085 base_list
= NULL_TREE
;
9086 if (BINFO_N_BASE_BINFOS (pbinfo
))
9092 /* We must enter the scope containing the type, as that is where
9093 the accessibility of types named in dependent bases are
9095 pushed_scope
= push_scope (CP_TYPE_CONTEXT (type
));
9097 /* Substitute into each of the bases to determine the actual
9099 for (i
= 0; BINFO_BASE_ITERATE (pbinfo
, i
, pbase_binfo
); i
++)
9102 tree access
= BINFO_BASE_ACCESS (pbinfo
, i
);
9103 tree expanded_bases
= NULL_TREE
;
9106 if (PACK_EXPANSION_P (BINFO_TYPE (pbase_binfo
)))
9109 tsubst_pack_expansion (BINFO_TYPE (pbase_binfo
),
9110 args
, tf_error
, NULL_TREE
);
9111 if (expanded_bases
== error_mark_node
)
9114 len
= TREE_VEC_LENGTH (expanded_bases
);
9117 for (idx
= 0; idx
< len
; idx
++)
9120 /* Extract the already-expanded base class. */
9121 base
= TREE_VEC_ELT (expanded_bases
, idx
);
9123 /* Substitute to figure out the base class. */
9124 base
= tsubst (BINFO_TYPE (pbase_binfo
), args
, tf_error
,
9127 if (base
== error_mark_node
)
9130 base_list
= tree_cons (access
, base
, base_list
);
9131 if (BINFO_VIRTUAL_P (pbase_binfo
))
9132 TREE_TYPE (base_list
) = integer_type_node
;
9136 /* The list is now in reverse order; correct that. */
9137 base_list
= nreverse (base_list
);
9140 pop_scope (pushed_scope
);
9142 /* Now call xref_basetypes to set up all the base-class
9144 xref_basetypes (type
, base_list
);
9146 apply_late_template_attributes (&type
, TYPE_ATTRIBUTES (pattern
),
9147 (int) ATTR_FLAG_TYPE_IN_PLACE
,
9148 args
, tf_error
, NULL_TREE
);
9149 fixup_attribute_variants (type
);
9151 /* Now that our base classes are set up, enter the scope of the
9152 class, so that name lookups into base classes, etc. will work
9153 correctly. This is precisely analogous to what we do in
9154 begin_class_definition when defining an ordinary non-template
9155 class, except we also need to push the enclosing classes. */
9156 push_nested_class (type
);
9158 /* Now members are processed in the order of declaration. */
9159 for (member
= CLASSTYPE_DECL_LIST (pattern
);
9160 member
; member
= TREE_CHAIN (member
))
9162 tree t
= TREE_VALUE (member
);
9164 if (TREE_PURPOSE (member
))
9168 /* Build new CLASSTYPE_NESTED_UTDS. */
9171 bool class_template_p
;
9173 class_template_p
= (TREE_CODE (t
) != ENUMERAL_TYPE
9174 && TYPE_LANG_SPECIFIC (t
)
9175 && CLASSTYPE_IS_TEMPLATE (t
));
9176 /* If the member is a class template, then -- even after
9177 substitution -- there may be dependent types in the
9178 template argument list for the class. We increment
9179 PROCESSING_TEMPLATE_DECL so that dependent_type_p, as
9180 that function will assume that no types are dependent
9181 when outside of a template. */
9182 if (class_template_p
)
9183 ++processing_template_decl
;
9184 newtag
= tsubst (t
, args
, tf_error
, NULL_TREE
);
9185 if (class_template_p
)
9186 --processing_template_decl
;
9187 if (newtag
== error_mark_node
)
9190 if (TREE_CODE (newtag
) != ENUMERAL_TYPE
)
9192 tree name
= TYPE_IDENTIFIER (t
);
9194 if (class_template_p
)
9195 /* Unfortunately, lookup_template_class sets
9196 CLASSTYPE_IMPLICIT_INSTANTIATION for a partial
9197 instantiation (i.e., for the type of a member
9198 template class nested within a template class.)
9199 This behavior is required for
9200 maybe_process_partial_specialization to work
9201 correctly, but is not accurate in this case;
9202 the TAG is not an instantiation of anything.
9203 (The corresponding TEMPLATE_DECL is an
9204 instantiation, but the TYPE is not.) */
9205 CLASSTYPE_USE_TEMPLATE (newtag
) = 0;
9207 /* Now, we call pushtag to put this NEWTAG into the scope of
9208 TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid
9209 pushtag calling push_template_decl. We don't have to do
9210 this for enums because it will already have been done in
9213 SET_IDENTIFIER_TYPE_VALUE (name
, newtag
);
9214 pushtag (name
, newtag
, /*tag_scope=*/ts_current
);
9217 else if (DECL_DECLARES_FUNCTION_P (t
))
9219 /* Build new TYPE_METHODS. */
9222 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9223 ++processing_template_decl
;
9224 r
= tsubst (t
, args
, tf_error
, NULL_TREE
);
9225 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9226 --processing_template_decl
;
9227 set_current_access_from_decl (r
);
9228 finish_member_declaration (r
);
9229 /* Instantiate members marked with attribute used. */
9230 if (r
!= error_mark_node
&& DECL_PRESERVE_P (r
))
9232 if (TREE_CODE (r
) == FUNCTION_DECL
9233 && DECL_OMP_DECLARE_REDUCTION_P (r
))
9234 cp_check_omp_declare_reduction (r
);
9236 else if (DECL_CLASS_TEMPLATE_P (t
)
9237 && LAMBDA_TYPE_P (TREE_TYPE (t
)))
9238 /* A closure type for a lambda in a default argument for a
9239 member template. Ignore it; it will be instantiated with
9240 the default argument. */;
9243 /* Build new TYPE_FIELDS. */
9244 if (TREE_CODE (t
) == STATIC_ASSERT
)
9248 ++c_inhibit_evaluation_warnings
;
9250 tsubst_expr (STATIC_ASSERT_CONDITION (t
), args
,
9251 tf_warning_or_error
, NULL_TREE
,
9252 /*integral_constant_expression_p=*/true);
9253 --c_inhibit_evaluation_warnings
;
9255 finish_static_assert (condition
,
9256 STATIC_ASSERT_MESSAGE (t
),
9257 STATIC_ASSERT_SOURCE_LOCATION (t
),
9260 else if (TREE_CODE (t
) != CONST_DECL
)
9263 tree vec
= NULL_TREE
;
9266 /* The file and line for this declaration, to
9267 assist in error message reporting. Since we
9268 called push_tinst_level above, we don't need to
9270 input_location
= DECL_SOURCE_LOCATION (t
);
9272 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9273 ++processing_template_decl
;
9274 r
= tsubst (t
, args
, tf_warning_or_error
, NULL_TREE
);
9275 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9276 --processing_template_decl
;
9278 if (TREE_CODE (r
) == TREE_VEC
)
9280 /* A capture pack became multiple fields. */
9282 len
= TREE_VEC_LENGTH (vec
);
9285 for (int i
= 0; i
< len
; ++i
)
9288 r
= TREE_VEC_ELT (vec
, i
);
9293 [t]he initialization (and any associated
9294 side-effects) of a static data member does
9295 not occur unless the static data member is
9296 itself used in a way that requires the
9297 definition of the static data member to
9300 Therefore, we do not substitute into the
9301 initialized for the static data member here. */
9302 finish_static_data_member_decl
9305 /*init_const_expr_p=*/false,
9306 /*asmspec_tree=*/NULL_TREE
,
9308 /* Instantiate members marked with attribute used. */
9309 if (r
!= error_mark_node
&& DECL_PRESERVE_P (r
))
9312 else if (TREE_CODE (r
) == FIELD_DECL
)
9314 /* Determine whether R has a valid type and can be
9315 completed later. If R is invalid, then its type
9316 is replaced by error_mark_node. */
9317 tree rtype
= TREE_TYPE (r
);
9318 if (can_complete_type_without_circularity (rtype
))
9319 complete_type (rtype
);
9321 if (!COMPLETE_TYPE_P (rtype
))
9323 cxx_incomplete_type_error (r
, rtype
);
9324 TREE_TYPE (r
) = error_mark_node
;
9328 /* If it is a TYPE_DECL for a class-scoped ENUMERAL_TYPE,
9329 such a thing will already have been added to the field
9330 list by tsubst_enum in finish_member_declaration in the
9331 CLASSTYPE_NESTED_UTDS case above. */
9332 if (!(TREE_CODE (r
) == TYPE_DECL
9333 && TREE_CODE (TREE_TYPE (r
)) == ENUMERAL_TYPE
9334 && DECL_ARTIFICIAL (r
)))
9336 set_current_access_from_decl (r
);
9337 finish_member_declaration (r
);
9345 if (TYPE_P (t
) || DECL_CLASS_TEMPLATE_P (t
)
9346 || DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
9348 /* Build new CLASSTYPE_FRIEND_CLASSES. */
9350 tree friend_type
= t
;
9351 bool adjust_processing_template_decl
= false;
9353 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
9355 /* template <class T> friend class C; */
9356 friend_type
= tsubst_friend_class (friend_type
, args
);
9357 adjust_processing_template_decl
= true;
9359 else if (TREE_CODE (friend_type
) == UNBOUND_CLASS_TEMPLATE
)
9361 /* template <class T> friend class C::D; */
9362 friend_type
= tsubst (friend_type
, args
,
9363 tf_warning_or_error
, NULL_TREE
);
9364 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
9365 friend_type
= TREE_TYPE (friend_type
);
9366 adjust_processing_template_decl
= true;
9368 else if (TREE_CODE (friend_type
) == TYPENAME_TYPE
9369 || TREE_CODE (friend_type
) == TEMPLATE_TYPE_PARM
)
9371 /* This could be either
9375 when dependent_type_p is false or
9377 template <class U> friend class T::C;
9380 friend_type
= tsubst (friend_type
, args
,
9381 tf_warning_or_error
, NULL_TREE
);
9382 /* Bump processing_template_decl for correct
9383 dependent_type_p calculation. */
9384 ++processing_template_decl
;
9385 if (dependent_type_p (friend_type
))
9386 adjust_processing_template_decl
= true;
9387 --processing_template_decl
;
9389 else if (!CLASSTYPE_USE_TEMPLATE (friend_type
)
9390 && hidden_name_p (TYPE_NAME (friend_type
)))
9394 where C hasn't been declared yet. Let's lookup name
9395 from namespace scope directly, bypassing any name that
9396 come from dependent base class. */
9397 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (friend_type
));
9399 /* The call to xref_tag_from_type does injection for friend
9401 push_nested_namespace (ns
);
9403 xref_tag_from_type (friend_type
, NULL_TREE
,
9404 /*tag_scope=*/ts_current
);
9405 pop_nested_namespace (ns
);
9407 else if (uses_template_parms (friend_type
))
9408 /* friend class C<T>; */
9409 friend_type
= tsubst (friend_type
, args
,
9410 tf_warning_or_error
, NULL_TREE
);
9415 where C is already declared or
9417 friend class C<int>;
9419 We don't have to do anything in these cases. */
9421 if (adjust_processing_template_decl
)
9422 /* Trick make_friend_class into realizing that the friend
9423 we're adding is a template, not an ordinary class. It's
9424 important that we use make_friend_class since it will
9425 perform some error-checking and output cross-reference
9427 ++processing_template_decl
;
9429 if (friend_type
!= error_mark_node
)
9430 make_friend_class (type
, friend_type
, /*complain=*/false);
9432 if (adjust_processing_template_decl
)
9433 --processing_template_decl
;
9437 /* Build new DECL_FRIENDLIST. */
9440 /* The file and line for this declaration, to
9441 assist in error message reporting. Since we
9442 called push_tinst_level above, we don't need to
9444 input_location
= DECL_SOURCE_LOCATION (t
);
9446 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9448 ++processing_template_decl
;
9449 push_deferring_access_checks (dk_no_check
);
9452 r
= tsubst_friend_function (t
, args
);
9453 add_friend (type
, r
, /*complain=*/false);
9454 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9456 pop_deferring_access_checks ();
9457 --processing_template_decl
;
9463 if (tree expr
= CLASSTYPE_LAMBDA_EXPR (type
))
9465 tree decl
= lambda_function (type
);
9468 if (!DECL_TEMPLATE_INFO (decl
)
9469 || DECL_TEMPLATE_RESULT (DECL_TI_TEMPLATE (decl
)) != decl
)
9470 instantiate_decl (decl
, false, false);
9472 /* We need to instantiate the capture list from the template
9473 after we've instantiated the closure members, but before we
9474 consider adding the conversion op. Also keep any captures
9475 that may have been added during instantiation of the op(). */
9476 tree tmpl_expr
= CLASSTYPE_LAMBDA_EXPR (pattern
);
9478 = tsubst_copy_and_build (LAMBDA_EXPR_CAPTURE_LIST (tmpl_expr
),
9479 args
, tf_warning_or_error
, NULL_TREE
,
9482 LAMBDA_EXPR_CAPTURE_LIST (expr
)
9483 = chainon (tmpl_cap
, nreverse (LAMBDA_EXPR_CAPTURE_LIST (expr
)));
9485 maybe_add_lambda_conv_op (type
);
9488 gcc_assert (errorcount
);
9491 /* Set the file and line number information to whatever is given for
9492 the class itself. This puts error messages involving generated
9493 implicit functions at a predictable point, and the same point
9494 that would be used for non-template classes. */
9495 input_location
= DECL_SOURCE_LOCATION (typedecl
);
9497 unreverse_member_declarations (type
);
9498 finish_struct_1 (type
);
9499 TYPE_BEING_DEFINED (type
) = 0;
9501 /* We don't instantiate default arguments for member functions. 14.7.1:
9503 The implicit instantiation of a class template specialization causes
9504 the implicit instantiation of the declarations, but not of the
9505 definitions or default arguments, of the class member functions,
9506 member classes, static data members and member templates.... */
9508 /* Some typedefs referenced from within the template code need to be access
9509 checked at template instantiation time, i.e now. These types were
9510 added to the template at parsing time. Let's get those and perform
9511 the access checks then. */
9512 perform_typedefs_access_check (pattern
, args
);
9513 perform_deferred_access_checks (tf_warning_or_error
);
9514 pop_nested_class ();
9515 maximum_field_alignment
= saved_maximum_field_alignment
;
9517 pop_from_top_level ();
9518 pop_deferring_access_checks ();
9521 /* The vtable for a template class can be emitted in any translation
9522 unit in which the class is instantiated. When there is no key
9523 method, however, finish_struct_1 will already have added TYPE to
9524 the keyed_classes list. */
9525 if (TYPE_CONTAINS_VPTR_P (type
) && CLASSTYPE_KEY_METHOD (type
))
9526 keyed_classes
= tree_cons (NULL_TREE
, type
, keyed_classes
);
9531 /* Wrapper for instantiate_class_template_1. */
9534 instantiate_class_template (tree type
)
9537 timevar_push (TV_TEMPLATE_INST
);
9538 ret
= instantiate_class_template_1 (type
);
9539 timevar_pop (TV_TEMPLATE_INST
);
9544 tsubst_template_arg (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
9550 else if (TYPE_P (t
))
9551 r
= tsubst (t
, args
, complain
, in_decl
);
9554 if (!(complain
& tf_warning
))
9555 ++c_inhibit_evaluation_warnings
;
9556 r
= tsubst_expr (t
, args
, complain
, in_decl
,
9557 /*integral_constant_expression_p=*/true);
9558 if (!(complain
& tf_warning
))
9559 --c_inhibit_evaluation_warnings
;
9564 /* Given a function parameter pack TMPL_PARM and some function parameters
9565 instantiated from it at *SPEC_P, return a NONTYPE_ARGUMENT_PACK of them
9566 and set *SPEC_P to point at the next point in the list. */
9569 extract_fnparm_pack (tree tmpl_parm
, tree
*spec_p
)
9571 /* Collect all of the extra "packed" parameters into an
9575 tree argpack
= make_node (NONTYPE_ARGUMENT_PACK
);
9576 tree argtypepack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
9577 tree spec_parm
= *spec_p
;
9580 for (len
= 0; spec_parm
; ++len
, spec_parm
= TREE_CHAIN (spec_parm
))
9582 && !function_parameter_expanded_from_pack_p (spec_parm
, tmpl_parm
))
9585 /* Fill in PARMVEC and PARMTYPEVEC with all of the parameters. */
9586 parmvec
= make_tree_vec (len
);
9587 parmtypevec
= make_tree_vec (len
);
9588 spec_parm
= *spec_p
;
9589 for (i
= 0; i
< len
; i
++, spec_parm
= DECL_CHAIN (spec_parm
))
9591 TREE_VEC_ELT (parmvec
, i
) = spec_parm
;
9592 TREE_VEC_ELT (parmtypevec
, i
) = TREE_TYPE (spec_parm
);
9595 /* Build the argument packs. */
9596 SET_ARGUMENT_PACK_ARGS (argpack
, parmvec
);
9597 SET_ARGUMENT_PACK_ARGS (argtypepack
, parmtypevec
);
9598 TREE_TYPE (argpack
) = argtypepack
;
9599 *spec_p
= spec_parm
;
9604 /* Give a chain SPEC_PARM of PARM_DECLs, pack them into a
9605 NONTYPE_ARGUMENT_PACK. */
9608 make_fnparm_pack (tree spec_parm
)
9610 return extract_fnparm_pack (NULL_TREE
, &spec_parm
);
9613 /* Return true iff the Ith element of the argument pack ARG_PACK is a
9617 argument_pack_element_is_expansion_p (tree arg_pack
, int i
)
9619 tree vec
= ARGUMENT_PACK_ARGS (arg_pack
);
9620 if (i
>= TREE_VEC_LENGTH (vec
))
9622 return PACK_EXPANSION_P (TREE_VEC_ELT (vec
, i
));
9626 /* Creates and return an ARGUMENT_PACK_SELECT tree node. */
9629 make_argument_pack_select (tree arg_pack
, unsigned index
)
9631 tree aps
= make_node (ARGUMENT_PACK_SELECT
);
9633 ARGUMENT_PACK_SELECT_FROM_PACK (aps
) = arg_pack
;
9634 ARGUMENT_PACK_SELECT_INDEX (aps
) = index
;
9639 /* This is a subroutine of tsubst_pack_expansion.
9641 It returns TRUE if we need to use the PACK_EXPANSION_EXTRA_ARGS
9642 mechanism to store the (non complete list of) arguments of the
9643 substitution and return a non substituted pack expansion, in order
9644 to wait for when we have enough arguments to really perform the
9648 use_pack_expansion_extra_args_p (tree parm_packs
,
9652 /* If one pack has an expansion and another pack has a normal
9653 argument or if one pack has an empty argument and an another
9654 one hasn't then tsubst_pack_expansion cannot perform the
9655 substitution and need to fall back on the
9656 PACK_EXPANSION_EXTRA mechanism. */
9657 if (parm_packs
== NULL_TREE
)
9659 else if (has_empty_arg
)
9662 bool has_expansion_arg
= false;
9663 for (int i
= 0 ; i
< arg_pack_len
; ++i
)
9665 bool has_non_expansion_arg
= false;
9666 for (tree parm_pack
= parm_packs
;
9668 parm_pack
= TREE_CHAIN (parm_pack
))
9670 tree arg
= TREE_VALUE (parm_pack
);
9672 if (argument_pack_element_is_expansion_p (arg
, i
))
9673 has_expansion_arg
= true;
9675 has_non_expansion_arg
= true;
9678 if (has_expansion_arg
&& has_non_expansion_arg
)
9684 /* [temp.variadic]/6 says that:
9686 The instantiation of a pack expansion [...]
9687 produces a list E1,E2, ..., En, where N is the number of elements
9688 in the pack expansion parameters.
9690 This subroutine of tsubst_pack_expansion produces one of these Ei.
9692 PATTERN is the pattern of the pack expansion. PARM_PACKS is a
9693 TREE_LIST in which each TREE_PURPOSE is a parameter pack of
9694 PATTERN, and each TREE_VALUE is its corresponding argument pack.
9695 INDEX is the index 'i' of the element Ei to produce. ARGS,
9696 COMPLAIN, and IN_DECL are the same parameters as for the
9697 tsubst_pack_expansion function.
9699 The function returns the resulting Ei upon successful completion,
9702 Note that this function possibly modifies the ARGS parameter, so
9703 it's the responsibility of the caller to restore it. */
9706 gen_elem_of_pack_expansion_instantiation (tree pattern
,
9709 tree args
/* This parm gets
9711 tsubst_flags_t complain
,
9715 bool ith_elem_is_expansion
= false;
9717 /* For each parameter pack, change the substitution of the parameter
9718 pack to the ith argument in its argument pack, then expand the
9720 for (tree pack
= parm_packs
; pack
; pack
= TREE_CHAIN (pack
))
9722 tree parm
= TREE_PURPOSE (pack
);
9723 tree arg_pack
= TREE_VALUE (pack
);
9724 tree aps
; /* instance of ARGUMENT_PACK_SELECT. */
9726 ith_elem_is_expansion
|=
9727 argument_pack_element_is_expansion_p (arg_pack
, index
);
9729 /* Select the Ith argument from the pack. */
9730 if (TREE_CODE (parm
) == PARM_DECL
9731 || TREE_CODE (parm
) == FIELD_DECL
)
9735 aps
= make_argument_pack_select (arg_pack
, index
);
9737 register_local_specialization (aps
, parm
);
9740 aps
= retrieve_local_specialization (parm
);
9745 template_parm_level_and_index (parm
, &level
, &idx
);
9749 aps
= make_argument_pack_select (arg_pack
, index
);
9750 /* Update the corresponding argument. */
9751 TMPL_ARG (args
, level
, idx
) = aps
;
9754 /* Re-use the ARGUMENT_PACK_SELECT. */
9755 aps
= TMPL_ARG (args
, level
, idx
);
9757 ARGUMENT_PACK_SELECT_INDEX (aps
) = index
;
9760 /* Substitute into the PATTERN with the (possibly altered)
9762 if (pattern
== in_decl
)
9763 /* Expanding a fixed parameter pack from
9764 coerce_template_parameter_pack. */
9765 t
= tsubst_decl (pattern
, args
, complain
);
9766 else if (!TYPE_P (pattern
))
9767 t
= tsubst_expr (pattern
, args
, complain
, in_decl
,
9768 /*integral_constant_expression_p=*/false);
9770 t
= tsubst (pattern
, args
, complain
, in_decl
);
9772 /* If the Ith argument pack element is a pack expansion, then
9773 the Ith element resulting from the substituting is going to
9774 be a pack expansion as well. */
9775 if (ith_elem_is_expansion
)
9776 t
= make_pack_expansion (t
);
9781 /* Substitute ARGS into T, which is an pack expansion
9782 (i.e. TYPE_PACK_EXPANSION or EXPR_PACK_EXPANSION). Returns a
9783 TREE_VEC with the substituted arguments, a PACK_EXPANSION_* node
9784 (if only a partial substitution could be performed) or
9785 ERROR_MARK_NODE if there was an error. */
9787 tsubst_pack_expansion (tree t
, tree args
, tsubst_flags_t complain
,
9791 tree pack
, packs
= NULL_TREE
;
9792 bool unsubstituted_packs
= false;
9795 hash_map
<tree
, tree
> *saved_local_specializations
= NULL
;
9796 bool need_local_specializations
= false;
9799 gcc_assert (PACK_EXPANSION_P (t
));
9800 pattern
= PACK_EXPANSION_PATTERN (t
);
9802 /* Add in any args remembered from an earlier partial instantiation. */
9803 args
= add_to_template_args (PACK_EXPANSION_EXTRA_ARGS (t
), args
);
9805 levels
= TMPL_ARGS_DEPTH (args
);
9807 /* Determine the argument packs that will instantiate the parameter
9808 packs used in the expansion expression. While we're at it,
9809 compute the number of arguments to be expanded and make sure it
9811 for (pack
= PACK_EXPANSION_PARAMETER_PACKS (t
); pack
;
9812 pack
= TREE_CHAIN (pack
))
9814 tree parm_pack
= TREE_VALUE (pack
);
9815 tree arg_pack
= NULL_TREE
;
9816 tree orig_arg
= NULL_TREE
;
9819 if (TREE_CODE (parm_pack
) == BASES
)
9821 if (BASES_DIRECT (parm_pack
))
9822 return calculate_direct_bases (tsubst_expr (BASES_TYPE (parm_pack
),
9823 args
, complain
, in_decl
, false));
9825 return calculate_bases (tsubst_expr (BASES_TYPE (parm_pack
),
9826 args
, complain
, in_decl
, false));
9828 if (TREE_CODE (parm_pack
) == PARM_DECL
)
9830 if (PACK_EXPANSION_LOCAL_P (t
))
9831 arg_pack
= retrieve_local_specialization (parm_pack
);
9834 /* We can't rely on local_specializations for a parameter
9835 name used later in a function declaration (such as in a
9836 late-specified return type). Even if it exists, it might
9837 have the wrong value for a recursive call. Just make a
9838 dummy decl, since it's only used for its type. */
9839 arg_pack
= tsubst_decl (parm_pack
, args
, complain
);
9840 if (arg_pack
&& DECL_PACK_P (arg_pack
))
9841 /* Partial instantiation of the parm_pack, we can't build
9842 up an argument pack yet. */
9843 arg_pack
= NULL_TREE
;
9845 arg_pack
= make_fnparm_pack (arg_pack
);
9846 need_local_specializations
= true;
9849 else if (TREE_CODE (parm_pack
) == FIELD_DECL
)
9850 arg_pack
= tsubst_copy (parm_pack
, args
, complain
, in_decl
);
9854 template_parm_level_and_index (parm_pack
, &level
, &idx
);
9856 if (level
<= levels
)
9857 arg_pack
= TMPL_ARG (args
, level
, idx
);
9860 orig_arg
= arg_pack
;
9861 if (arg_pack
&& TREE_CODE (arg_pack
) == ARGUMENT_PACK_SELECT
)
9862 arg_pack
= ARGUMENT_PACK_SELECT_FROM_PACK (arg_pack
);
9864 if (arg_pack
&& !ARGUMENT_PACK_P (arg_pack
))
9865 /* This can only happen if we forget to expand an argument
9866 pack somewhere else. Just return an error, silently. */
9868 result
= make_tree_vec (1);
9869 TREE_VEC_ELT (result
, 0) = error_mark_node
;
9876 TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg_pack
));
9878 /* Don't bother trying to do a partial substitution with
9879 incomplete packs; we'll try again after deduction. */
9880 if (ARGUMENT_PACK_INCOMPLETE_P (arg_pack
))
9885 else if (len
!= my_len
)
9887 if (!(complain
& tf_error
))
9888 /* Fail quietly. */;
9889 else if (TREE_CODE (t
) == TYPE_PACK_EXPANSION
)
9890 error ("mismatched argument pack lengths while expanding "
9894 error ("mismatched argument pack lengths while expanding "
9897 return error_mark_node
;
9900 /* Keep track of the parameter packs and their corresponding
9902 packs
= tree_cons (parm_pack
, arg_pack
, packs
);
9903 TREE_TYPE (packs
) = orig_arg
;
9907 /* We can't substitute for this parameter pack. We use a flag as
9908 well as the missing_level counter because function parameter
9909 packs don't have a level. */
9910 unsubstituted_packs
= true;
9914 /* We cannot expand this expansion expression, because we don't have
9915 all of the argument packs we need. */
9916 if (use_pack_expansion_extra_args_p (packs
, len
, unsubstituted_packs
))
9918 /* We got some full packs, but we can't substitute them in until we
9919 have values for all the packs. So remember these until then. */
9921 t
= make_pack_expansion (pattern
);
9922 PACK_EXPANSION_EXTRA_ARGS (t
) = args
;
9925 else if (unsubstituted_packs
)
9927 /* There were no real arguments, we're just replacing a parameter
9928 pack with another version of itself. Substitute into the
9929 pattern and return a PACK_EXPANSION_*. The caller will need to
9931 if (TREE_CODE (t
) == EXPR_PACK_EXPANSION
)
9932 t
= tsubst_expr (pattern
, args
, complain
, in_decl
,
9933 /*integral_constant_expression_p=*/false);
9935 t
= tsubst (pattern
, args
, complain
, in_decl
);
9936 t
= make_pack_expansion (t
);
9940 gcc_assert (len
>= 0);
9942 if (need_local_specializations
)
9944 /* We're in a late-specified return type, so create our own local
9945 specializations map; the current map is either NULL or (in the
9946 case of recursive unification) might have bindings that we don't
9947 want to use or alter. */
9948 saved_local_specializations
= local_specializations
;
9949 local_specializations
= new hash_map
<tree
, tree
>;
9952 /* For each argument in each argument pack, substitute into the
9954 result
= make_tree_vec (len
);
9955 for (i
= 0; i
< len
; ++i
)
9957 t
= gen_elem_of_pack_expansion_instantiation (pattern
, packs
,
9961 TREE_VEC_ELT (result
, i
) = t
;
9962 if (t
== error_mark_node
)
9964 result
= error_mark_node
;
9969 /* Update ARGS to restore the substitution from parameter packs to
9970 their argument packs. */
9971 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
9973 tree parm
= TREE_PURPOSE (pack
);
9975 if (TREE_CODE (parm
) == PARM_DECL
9976 || TREE_CODE (parm
) == FIELD_DECL
)
9977 register_local_specialization (TREE_TYPE (pack
), parm
);
9982 if (TREE_VALUE (pack
) == NULL_TREE
)
9985 template_parm_level_and_index (parm
, &level
, &idx
);
9987 /* Update the corresponding argument. */
9988 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
9989 TREE_VEC_ELT (TREE_VEC_ELT (args
, level
-1 ), idx
) =
9992 TREE_VEC_ELT (args
, idx
) = TREE_TYPE (pack
);
9996 if (need_local_specializations
)
9998 delete local_specializations
;
9999 local_specializations
= saved_local_specializations
;
10005 /* Given PARM_DECL PARM, find the corresponding PARM_DECL in the template
10006 TMPL. We do this using DECL_PARM_INDEX, which should work even with
10007 parameter packs; all parms generated from a function parameter pack will
10008 have the same DECL_PARM_INDEX. */
10011 get_pattern_parm (tree parm
, tree tmpl
)
10013 tree pattern
= DECL_TEMPLATE_RESULT (tmpl
);
10016 if (DECL_ARTIFICIAL (parm
))
10018 for (patparm
= DECL_ARGUMENTS (pattern
);
10019 patparm
; patparm
= DECL_CHAIN (patparm
))
10020 if (DECL_ARTIFICIAL (patparm
)
10021 && DECL_NAME (parm
) == DECL_NAME (patparm
))
10026 patparm
= FUNCTION_FIRST_USER_PARM (DECL_TEMPLATE_RESULT (tmpl
));
10027 patparm
= chain_index (DECL_PARM_INDEX (parm
)-1, patparm
);
10028 gcc_assert (DECL_PARM_INDEX (patparm
)
10029 == DECL_PARM_INDEX (parm
));
10035 /* Substitute ARGS into the vector or list of template arguments T. */
10038 tsubst_template_args (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
10041 int len
, need_new
= 0, i
, expanded_len_adjust
= 0, out
;
10044 if (t
== error_mark_node
)
10045 return error_mark_node
;
10047 len
= TREE_VEC_LENGTH (t
);
10048 elts
= XALLOCAVEC (tree
, len
);
10050 for (i
= 0; i
< len
; i
++)
10052 tree orig_arg
= TREE_VEC_ELT (t
, i
);
10055 if (TREE_CODE (orig_arg
) == TREE_VEC
)
10056 new_arg
= tsubst_template_args (orig_arg
, args
, complain
, in_decl
);
10057 else if (PACK_EXPANSION_P (orig_arg
))
10059 /* Substitute into an expansion expression. */
10060 new_arg
= tsubst_pack_expansion (orig_arg
, args
, complain
, in_decl
);
10062 if (TREE_CODE (new_arg
) == TREE_VEC
)
10063 /* Add to the expanded length adjustment the number of
10064 expanded arguments. We subtract one from this
10065 measurement, because the argument pack expression
10066 itself is already counted as 1 in
10067 LEN. EXPANDED_LEN_ADJUST can actually be negative, if
10068 the argument pack is empty. */
10069 expanded_len_adjust
+= TREE_VEC_LENGTH (new_arg
) - 1;
10071 else if (ARGUMENT_PACK_P (orig_arg
))
10073 /* Substitute into each of the arguments. */
10074 new_arg
= TYPE_P (orig_arg
)
10075 ? cxx_make_type (TREE_CODE (orig_arg
))
10076 : make_node (TREE_CODE (orig_arg
));
10078 SET_ARGUMENT_PACK_ARGS (
10080 tsubst_template_args (ARGUMENT_PACK_ARGS (orig_arg
),
10081 args
, complain
, in_decl
));
10083 if (ARGUMENT_PACK_ARGS (new_arg
) == error_mark_node
)
10084 new_arg
= error_mark_node
;
10086 if (TREE_CODE (new_arg
) == NONTYPE_ARGUMENT_PACK
) {
10087 TREE_TYPE (new_arg
) = tsubst (TREE_TYPE (orig_arg
), args
,
10088 complain
, in_decl
);
10089 TREE_CONSTANT (new_arg
) = TREE_CONSTANT (orig_arg
);
10091 if (TREE_TYPE (new_arg
) == error_mark_node
)
10092 new_arg
= error_mark_node
;
10096 new_arg
= tsubst_template_arg (orig_arg
, args
, complain
, in_decl
);
10098 if (new_arg
== error_mark_node
)
10099 return error_mark_node
;
10102 if (new_arg
!= orig_arg
)
10109 /* Make space for the expanded arguments coming from template
10111 t
= make_tree_vec (len
+ expanded_len_adjust
);
10112 /* ORIG_T can contain TREE_VECs. That happens if ORIG_T contains the
10113 arguments for a member template.
10114 In that case each TREE_VEC in ORIG_T represents a level of template
10115 arguments, and ORIG_T won't carry any non defaulted argument count.
10116 It will rather be the nested TREE_VECs that will carry one.
10117 In other words, ORIG_T carries a non defaulted argument count only
10118 if it doesn't contain any nested TREE_VEC. */
10119 if (NON_DEFAULT_TEMPLATE_ARGS_COUNT (orig_t
))
10121 int count
= GET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (orig_t
);
10122 count
+= expanded_len_adjust
;
10123 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (t
, count
);
10125 for (i
= 0, out
= 0; i
< len
; i
++)
10127 if ((PACK_EXPANSION_P (TREE_VEC_ELT (orig_t
, i
))
10128 || ARGUMENT_PACK_P (TREE_VEC_ELT (orig_t
, i
)))
10129 && TREE_CODE (elts
[i
]) == TREE_VEC
)
10133 /* Now expand the template argument pack "in place". */
10134 for (idx
= 0; idx
< TREE_VEC_LENGTH (elts
[i
]); idx
++, out
++)
10135 TREE_VEC_ELT (t
, out
) = TREE_VEC_ELT (elts
[i
], idx
);
10139 TREE_VEC_ELT (t
, out
) = elts
[i
];
10147 /* Return the result of substituting ARGS into the template parameters
10148 given by PARMS. If there are m levels of ARGS and m + n levels of
10149 PARMS, then the result will contain n levels of PARMS. For
10150 example, if PARMS is `template <class T> template <class U>
10151 template <T*, U, class V>' and ARGS is {{int}, {double}} then the
10152 result will be `template <int*, double, class V>'. */
10155 tsubst_template_parms (tree parms
, tree args
, tsubst_flags_t complain
)
10157 tree r
= NULL_TREE
;
10160 /* When substituting into a template, we must set
10161 PROCESSING_TEMPLATE_DECL as the template parameters may be
10162 dependent if they are based on one-another, and the dependency
10163 predicates are short-circuit outside of templates. */
10164 ++processing_template_decl
;
10166 for (new_parms
= &r
;
10167 parms
&& TMPL_PARMS_DEPTH (parms
) > TMPL_ARGS_DEPTH (args
);
10168 new_parms
= &(TREE_CHAIN (*new_parms
)),
10169 parms
= TREE_CHAIN (parms
))
10172 make_tree_vec (TREE_VEC_LENGTH (TREE_VALUE (parms
)));
10175 for (i
= 0; i
< TREE_VEC_LENGTH (new_vec
); ++i
)
10179 if (parms
== error_mark_node
)
10182 tuple
= TREE_VEC_ELT (TREE_VALUE (parms
), i
);
10184 if (tuple
== error_mark_node
)
10187 TREE_VEC_ELT (new_vec
, i
) =
10188 tsubst_template_parm (tuple
, args
, complain
);
10192 tree_cons (size_int (TMPL_PARMS_DEPTH (parms
)
10193 - TMPL_ARGS_DEPTH (args
)),
10194 new_vec
, NULL_TREE
);
10197 --processing_template_decl
;
10202 /* Return the result of substituting ARGS into one template parameter
10203 given by T. T Must be a TREE_LIST which TREE_VALUE is the template
10204 parameter and which TREE_PURPOSE is the default argument of the
10205 template parameter. */
10208 tsubst_template_parm (tree t
, tree args
, tsubst_flags_t complain
)
10210 tree default_value
, parm_decl
;
10212 if (args
== NULL_TREE
10214 || t
== error_mark_node
)
10217 gcc_assert (TREE_CODE (t
) == TREE_LIST
);
10219 default_value
= TREE_PURPOSE (t
);
10220 parm_decl
= TREE_VALUE (t
);
10222 parm_decl
= tsubst (parm_decl
, args
, complain
, NULL_TREE
);
10223 if (TREE_CODE (parm_decl
) == PARM_DECL
10224 && invalid_nontype_parm_type_p (TREE_TYPE (parm_decl
), complain
))
10225 parm_decl
= error_mark_node
;
10226 default_value
= tsubst_template_arg (default_value
, args
,
10227 complain
, NULL_TREE
);
10229 return build_tree_list (default_value
, parm_decl
);
10232 /* Substitute the ARGS into the indicated aggregate (or enumeration)
10233 type T. If T is not an aggregate or enumeration type, it is
10234 handled as if by tsubst. IN_DECL is as for tsubst. If
10235 ENTERING_SCOPE is nonzero, T is the context for a template which
10236 we are presently tsubst'ing. Return the substituted value. */
10239 tsubst_aggr_type (tree t
,
10241 tsubst_flags_t complain
,
10243 int entering_scope
)
10245 if (t
== NULL_TREE
)
10248 switch (TREE_CODE (t
))
10251 if (TYPE_PTRMEMFUNC_P (t
))
10252 return tsubst (TYPE_PTRMEMFUNC_FN_TYPE (t
), args
, complain
, in_decl
);
10254 /* Else fall through. */
10255 case ENUMERAL_TYPE
:
10257 if (TYPE_TEMPLATE_INFO (t
) && uses_template_parms (t
))
10262 int saved_unevaluated_operand
;
10263 int saved_inhibit_evaluation_warnings
;
10265 /* In "sizeof(X<I>)" we need to evaluate "I". */
10266 saved_unevaluated_operand
= cp_unevaluated_operand
;
10267 cp_unevaluated_operand
= 0;
10268 saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
10269 c_inhibit_evaluation_warnings
= 0;
10271 /* First, determine the context for the type we are looking
10273 context
= TYPE_CONTEXT (t
);
10274 if (context
&& TYPE_P (context
))
10276 context
= tsubst_aggr_type (context
, args
, complain
,
10277 in_decl
, /*entering_scope=*/1);
10278 /* If context is a nested class inside a class template,
10279 it may still need to be instantiated (c++/33959). */
10280 context
= complete_type (context
);
10283 /* Then, figure out what arguments are appropriate for the
10284 type we are trying to find. For example, given:
10286 template <class T> struct S;
10287 template <class T, class U> void f(T, U) { S<U> su; }
10289 and supposing that we are instantiating f<int, double>,
10290 then our ARGS will be {int, double}, but, when looking up
10291 S we only want {double}. */
10292 argvec
= tsubst_template_args (TYPE_TI_ARGS (t
), args
,
10293 complain
, in_decl
);
10294 if (argvec
== error_mark_node
)
10295 r
= error_mark_node
;
10298 r
= lookup_template_class (t
, argvec
, in_decl
, context
,
10299 entering_scope
, complain
);
10300 r
= cp_build_qualified_type_real (r
, cp_type_quals (t
), complain
);
10303 cp_unevaluated_operand
= saved_unevaluated_operand
;
10304 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
10309 /* This is not a template type, so there's nothing to do. */
10313 return tsubst (t
, args
, complain
, in_decl
);
10317 /* Substitute into the default argument ARG (a default argument for
10318 FN), which has the indicated TYPE. */
10321 tsubst_default_argument (tree fn
, tree type
, tree arg
, tsubst_flags_t complain
)
10323 tree saved_class_ptr
= NULL_TREE
;
10324 tree saved_class_ref
= NULL_TREE
;
10325 int errs
= errorcount
+ sorrycount
;
10327 /* This can happen in invalid code. */
10328 if (TREE_CODE (arg
) == DEFAULT_ARG
)
10331 /* This default argument came from a template. Instantiate the
10332 default argument here, not in tsubst. In the case of
10341 we must be careful to do name lookup in the scope of S<T>,
10342 rather than in the current class. */
10343 push_access_scope (fn
);
10344 /* The "this" pointer is not valid in a default argument. */
10347 saved_class_ptr
= current_class_ptr
;
10348 cp_function_chain
->x_current_class_ptr
= NULL_TREE
;
10349 saved_class_ref
= current_class_ref
;
10350 cp_function_chain
->x_current_class_ref
= NULL_TREE
;
10353 push_deferring_access_checks(dk_no_deferred
);
10354 /* The default argument expression may cause implicitly defined
10355 member functions to be synthesized, which will result in garbage
10356 collection. We must treat this situation as if we were within
10357 the body of function so as to avoid collecting live data on the
10360 arg
= tsubst_expr (arg
, DECL_TI_ARGS (fn
),
10361 complain
, NULL_TREE
,
10362 /*integral_constant_expression_p=*/false);
10364 pop_deferring_access_checks();
10366 /* Restore the "this" pointer. */
10369 cp_function_chain
->x_current_class_ptr
= saved_class_ptr
;
10370 cp_function_chain
->x_current_class_ref
= saved_class_ref
;
10373 if (errorcount
+sorrycount
> errs
10374 && (complain
& tf_warning_or_error
))
10375 inform (input_location
,
10376 " when instantiating default argument for call to %D", fn
);
10378 /* Make sure the default argument is reasonable. */
10379 arg
= check_default_argument (type
, arg
, complain
);
10381 pop_access_scope (fn
);
10386 /* Substitute into all the default arguments for FN. */
10389 tsubst_default_arguments (tree fn
, tsubst_flags_t complain
)
10394 tmpl_args
= DECL_TI_ARGS (fn
);
10396 /* If this function is not yet instantiated, we certainly don't need
10397 its default arguments. */
10398 if (uses_template_parms (tmpl_args
))
10400 /* Don't do this again for clones. */
10401 if (DECL_CLONED_FUNCTION_P (fn
))
10404 for (arg
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
10406 arg
= TREE_CHAIN (arg
))
10407 if (TREE_PURPOSE (arg
))
10408 TREE_PURPOSE (arg
) = tsubst_default_argument (fn
,
10410 TREE_PURPOSE (arg
),
10414 /* Substitute the ARGS into the T, which is a _DECL. Return the
10415 result of the substitution. Issue error and warning messages under
10416 control of COMPLAIN. */
10419 tsubst_decl (tree t
, tree args
, tsubst_flags_t complain
)
10421 #define RETURN(EXP) do { r = (EXP); goto out; } while(0)
10422 location_t saved_loc
;
10423 tree r
= NULL_TREE
;
10425 hashval_t hash
= 0;
10427 /* Set the filename and linenumber to improve error-reporting. */
10428 saved_loc
= input_location
;
10429 input_location
= DECL_SOURCE_LOCATION (t
);
10431 switch (TREE_CODE (t
))
10433 case TEMPLATE_DECL
:
10435 /* We can get here when processing a member function template,
10436 member class template, or template template parameter. */
10437 tree decl
= DECL_TEMPLATE_RESULT (t
);
10442 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
10444 /* Template template parameter is treated here. */
10445 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
10446 if (new_type
== error_mark_node
)
10447 RETURN (error_mark_node
);
10448 /* If we get a real template back, return it. This can happen in
10449 the context of most_specialized_class. */
10450 if (TREE_CODE (new_type
) == TEMPLATE_DECL
)
10454 DECL_CHAIN (r
) = NULL_TREE
;
10455 TREE_TYPE (r
) = new_type
;
10456 DECL_TEMPLATE_RESULT (r
)
10457 = build_decl (DECL_SOURCE_LOCATION (decl
),
10458 TYPE_DECL
, DECL_NAME (decl
), new_type
);
10459 DECL_TEMPLATE_PARMS (r
)
10460 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
,
10462 TYPE_NAME (new_type
) = r
;
10466 /* We might already have an instance of this template.
10467 The ARGS are for the surrounding class type, so the
10468 full args contain the tsubst'd args for the context,
10469 plus the innermost args from the template decl. */
10470 tmpl_args
= DECL_CLASS_TEMPLATE_P (t
)
10471 ? CLASSTYPE_TI_ARGS (TREE_TYPE (t
))
10472 : DECL_TI_ARGS (DECL_TEMPLATE_RESULT (t
));
10473 /* Because this is a template, the arguments will still be
10474 dependent, even after substitution. If
10475 PROCESSING_TEMPLATE_DECL is not set, the dependency
10476 predicates will short-circuit. */
10477 ++processing_template_decl
;
10478 full_args
= tsubst_template_args (tmpl_args
, args
,
10479 complain
, in_decl
);
10480 --processing_template_decl
;
10481 if (full_args
== error_mark_node
)
10482 RETURN (error_mark_node
);
10484 /* If this is a default template template argument,
10485 tsubst might not have changed anything. */
10486 if (full_args
== tmpl_args
)
10489 hash
= hash_tmpl_and_args (t
, full_args
);
10490 spec
= retrieve_specialization (t
, full_args
, hash
);
10491 if (spec
!= NULL_TREE
)
10497 /* Make a new template decl. It will be similar to the
10498 original, but will record the current template arguments.
10499 We also create a new function declaration, which is just
10500 like the old one, but points to this new template, rather
10501 than the old one. */
10503 gcc_assert (DECL_LANG_SPECIFIC (r
) != 0);
10504 DECL_CHAIN (r
) = NULL_TREE
;
10506 DECL_TEMPLATE_INFO (r
) = build_template_info (t
, args
);
10508 if (TREE_CODE (decl
) == TYPE_DECL
10509 && !TYPE_DECL_ALIAS_P (decl
))
10512 ++processing_template_decl
;
10513 new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
10514 --processing_template_decl
;
10515 if (new_type
== error_mark_node
)
10516 RETURN (error_mark_node
);
10518 TREE_TYPE (r
) = new_type
;
10519 /* For a partial specialization, we need to keep pointing to
10520 the primary template. */
10521 if (!DECL_TEMPLATE_SPECIALIZATION (t
))
10522 CLASSTYPE_TI_TEMPLATE (new_type
) = r
;
10523 DECL_TEMPLATE_RESULT (r
) = TYPE_MAIN_DECL (new_type
);
10524 DECL_TI_ARGS (r
) = CLASSTYPE_TI_ARGS (new_type
);
10525 DECL_CONTEXT (r
) = TYPE_CONTEXT (new_type
);
10530 ++processing_template_decl
;
10531 new_decl
= tsubst (decl
, args
, complain
, in_decl
);
10532 --processing_template_decl
;
10533 if (new_decl
== error_mark_node
)
10534 RETURN (error_mark_node
);
10536 DECL_TEMPLATE_RESULT (r
) = new_decl
;
10537 DECL_TI_TEMPLATE (new_decl
) = r
;
10538 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
10539 DECL_TI_ARGS (r
) = DECL_TI_ARGS (new_decl
);
10540 DECL_CONTEXT (r
) = DECL_CONTEXT (new_decl
);
10543 SET_DECL_IMPLICIT_INSTANTIATION (r
);
10544 DECL_TEMPLATE_INSTANTIATIONS (r
) = NULL_TREE
;
10545 DECL_TEMPLATE_SPECIALIZATIONS (r
) = NULL_TREE
;
10547 /* The template parameters for this new template are all the
10548 template parameters for the old template, except the
10549 outermost level of parameters. */
10550 DECL_TEMPLATE_PARMS (r
)
10551 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
,
10554 if (PRIMARY_TEMPLATE_P (t
))
10555 DECL_PRIMARY_TEMPLATE (r
) = r
;
10557 if (TREE_CODE (decl
) != TYPE_DECL
&& TREE_CODE (decl
) != VAR_DECL
)
10558 /* Record this non-type partial instantiation. */
10559 register_specialization (r
, t
,
10560 DECL_TI_ARGS (DECL_TEMPLATE_RESULT (r
)),
10565 case FUNCTION_DECL
:
10568 tree argvec
= NULL_TREE
;
10576 /* Nobody should be tsubst'ing into non-template functions. */
10577 gcc_assert (DECL_TEMPLATE_INFO (t
) != NULL_TREE
);
10579 if (TREE_CODE (DECL_TI_TEMPLATE (t
)) == TEMPLATE_DECL
)
10584 /* If T is not dependent, just return it. We have to
10585 increment PROCESSING_TEMPLATE_DECL because
10586 value_dependent_expression_p assumes that nothing is
10587 dependent when PROCESSING_TEMPLATE_DECL is zero. */
10588 ++processing_template_decl
;
10589 dependent_p
= value_dependent_expression_p (t
);
10590 --processing_template_decl
;
10594 /* Calculate the most general template of which R is a
10595 specialization, and the complete set of arguments used to
10597 gen_tmpl
= most_general_template (DECL_TI_TEMPLATE (t
));
10598 argvec
= tsubst_template_args (DECL_TI_ARGS
10599 (DECL_TEMPLATE_RESULT
10600 (DECL_TI_TEMPLATE (t
))),
10601 args
, complain
, in_decl
);
10602 if (argvec
== error_mark_node
)
10603 RETURN (error_mark_node
);
10605 /* Check to see if we already have this specialization. */
10606 hash
= hash_tmpl_and_args (gen_tmpl
, argvec
);
10607 spec
= retrieve_specialization (gen_tmpl
, argvec
, hash
);
10615 /* We can see more levels of arguments than parameters if
10616 there was a specialization of a member template, like
10619 template <class T> struct S { template <class U> void f(); }
10620 template <> template <class U> void S<int>::f(U);
10622 Here, we'll be substituting into the specialization,
10623 because that's where we can find the code we actually
10624 want to generate, but we'll have enough arguments for
10625 the most general template.
10627 We also deal with the peculiar case:
10629 template <class T> struct S {
10630 template <class U> friend void f();
10632 template <class U> void f() {}
10634 template void f<double>();
10636 Here, the ARGS for the instantiation of will be {int,
10637 double}. But, we only need as many ARGS as there are
10638 levels of template parameters in CODE_PATTERN. We are
10639 careful not to get fooled into reducing the ARGS in
10642 template <class T> struct S { template <class U> void f(U); }
10643 template <class T> template <> void S<T>::f(int) {}
10645 which we can spot because the pattern will be a
10646 specialization in this case. */
10647 args_depth
= TMPL_ARGS_DEPTH (args
);
10649 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (t
)));
10650 if (args_depth
> parms_depth
10651 && !DECL_TEMPLATE_SPECIALIZATION (t
))
10652 args
= get_innermost_template_args (args
, parms_depth
);
10656 /* This special case arises when we have something like this:
10658 template <class T> struct S {
10659 friend void f<int>(int, double);
10662 Here, the DECL_TI_TEMPLATE for the friend declaration
10663 will be an IDENTIFIER_NODE. We are being called from
10664 tsubst_friend_function, and we want only to create a
10665 new decl (R) with appropriate types so that we can call
10666 determine_specialization. */
10667 gen_tmpl
= NULL_TREE
;
10670 if (DECL_CLASS_SCOPE_P (t
))
10672 if (DECL_NAME (t
) == constructor_name (DECL_CONTEXT (t
)))
10676 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
,
10677 complain
, t
, /*entering_scope=*/1);
10682 ctx
= DECL_CONTEXT (t
);
10684 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
10685 if (type
== error_mark_node
)
10686 RETURN (error_mark_node
);
10688 /* If we hit excessive deduction depth, the type is bogus even if
10689 it isn't error_mark_node, so don't build a decl. */
10690 if (excessive_deduction_depth
)
10691 RETURN (error_mark_node
);
10693 /* We do NOT check for matching decls pushed separately at this
10694 point, as they may not represent instantiations of this
10695 template, and in any case are considered separate under the
10698 DECL_USE_TEMPLATE (r
) = 0;
10699 TREE_TYPE (r
) = type
;
10700 /* Clear out the mangled name and RTL for the instantiation. */
10701 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
10702 SET_DECL_RTL (r
, NULL
);
10703 /* Leave DECL_INITIAL set on deleted instantiations. */
10704 if (!DECL_DELETED_FN (r
))
10705 DECL_INITIAL (r
) = NULL_TREE
;
10706 DECL_CONTEXT (r
) = ctx
;
10708 /* OpenMP UDRs have the only argument a reference to the declared
10709 type. We want to diagnose if the declared type is a reference,
10710 which is invalid, but as references to references are usually
10711 quietly merged, diagnose it here. */
10712 if (DECL_OMP_DECLARE_REDUCTION_P (t
))
10715 = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (t
))));
10716 argtype
= tsubst (argtype
, args
, complain
, in_decl
);
10717 if (TREE_CODE (argtype
) == REFERENCE_TYPE
)
10718 error_at (DECL_SOURCE_LOCATION (t
),
10719 "reference type %qT in "
10720 "%<#pragma omp declare reduction%>", argtype
);
10721 if (strchr (IDENTIFIER_POINTER (DECL_NAME (t
)), '~') == NULL
)
10722 DECL_NAME (r
) = omp_reduction_id (ERROR_MARK
, DECL_NAME (t
),
10726 if (member
&& DECL_CONV_FN_P (r
))
10727 /* Type-conversion operator. Reconstruct the name, in
10728 case it's the name of one of the template's parameters. */
10729 DECL_NAME (r
) = mangle_conv_op_name_for_type (TREE_TYPE (type
));
10731 DECL_ARGUMENTS (r
) = tsubst (DECL_ARGUMENTS (t
), args
,
10733 DECL_RESULT (r
) = NULL_TREE
;
10735 TREE_STATIC (r
) = 0;
10736 TREE_PUBLIC (r
) = TREE_PUBLIC (t
);
10737 DECL_EXTERNAL (r
) = 1;
10738 /* If this is an instantiation of a function with internal
10739 linkage, we already know what object file linkage will be
10740 assigned to the instantiation. */
10741 DECL_INTERFACE_KNOWN (r
) = !TREE_PUBLIC (r
);
10742 DECL_DEFER_OUTPUT (r
) = 0;
10743 DECL_CHAIN (r
) = NULL_TREE
;
10744 DECL_PENDING_INLINE_INFO (r
) = 0;
10745 DECL_PENDING_INLINE_P (r
) = 0;
10746 DECL_SAVED_TREE (r
) = NULL_TREE
;
10747 DECL_STRUCT_FUNCTION (r
) = NULL
;
10749 /* We'll re-clone as appropriate in instantiate_template. */
10750 DECL_CLONED_FUNCTION (r
) = NULL_TREE
;
10752 /* If we aren't complaining now, return on error before we register
10753 the specialization so that we'll complain eventually. */
10754 if ((complain
& tf_error
) == 0
10755 && IDENTIFIER_OPNAME_P (DECL_NAME (r
))
10756 && !grok_op_properties (r
, /*complain=*/false))
10757 RETURN (error_mark_node
);
10759 /* Set up the DECL_TEMPLATE_INFO for R. There's no need to do
10760 this in the special friend case mentioned above where
10761 GEN_TMPL is NULL. */
10764 DECL_TEMPLATE_INFO (r
)
10765 = build_template_info (gen_tmpl
, argvec
);
10766 SET_DECL_IMPLICIT_INSTANTIATION (r
);
10769 = register_specialization (r
, gen_tmpl
, argvec
, false, hash
);
10771 /* We instantiated this while substituting into
10772 the type earlier (template/friend54.C). */
10775 /* We're not supposed to instantiate default arguments
10776 until they are called, for a template. But, for a
10779 template <class T> void f ()
10780 { extern void g(int i = T()); }
10782 we should do the substitution when the template is
10783 instantiated. We handle the member function case in
10784 instantiate_class_template since the default arguments
10785 might refer to other members of the class. */
10787 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
10788 && !uses_template_parms (argvec
))
10789 tsubst_default_arguments (r
, complain
);
10792 DECL_TEMPLATE_INFO (r
) = NULL_TREE
;
10794 /* Copy the list of befriending classes. */
10795 for (friends
= &DECL_BEFRIENDING_CLASSES (r
);
10797 friends
= &TREE_CHAIN (*friends
))
10799 *friends
= copy_node (*friends
);
10800 TREE_VALUE (*friends
) = tsubst (TREE_VALUE (*friends
),
10805 if (DECL_CONSTRUCTOR_P (r
) || DECL_DESTRUCTOR_P (r
))
10807 maybe_retrofit_in_chrg (r
);
10808 if (DECL_CONSTRUCTOR_P (r
))
10809 grok_ctor_properties (ctx
, r
);
10810 if (DECL_INHERITED_CTOR_BASE (r
))
10811 deduce_inheriting_ctor (r
);
10812 /* If this is an instantiation of a member template, clone it.
10813 If it isn't, that'll be handled by
10814 clone_constructors_and_destructors. */
10815 if (PRIMARY_TEMPLATE_P (gen_tmpl
))
10816 clone_function_decl (r
, /*update_method_vec_p=*/0);
10818 else if ((complain
& tf_error
) != 0
10819 && IDENTIFIER_OPNAME_P (DECL_NAME (r
))
10820 && !grok_op_properties (r
, /*complain=*/true))
10821 RETURN (error_mark_node
);
10823 if (DECL_FRIEND_P (t
) && DECL_FRIEND_CONTEXT (t
))
10824 SET_DECL_FRIEND_CONTEXT (r
,
10825 tsubst (DECL_FRIEND_CONTEXT (t
),
10826 args
, complain
, in_decl
));
10828 /* Possibly limit visibility based on template args. */
10829 DECL_VISIBILITY (r
) = VISIBILITY_DEFAULT
;
10830 if (DECL_VISIBILITY_SPECIFIED (t
))
10832 DECL_VISIBILITY_SPECIFIED (r
) = 0;
10833 DECL_ATTRIBUTES (r
)
10834 = remove_attribute ("visibility", DECL_ATTRIBUTES (r
));
10836 determine_visibility (r
);
10837 if (DECL_DEFAULTED_OUTSIDE_CLASS_P (r
)
10838 && !processing_template_decl
)
10839 defaulted_late_check (r
);
10841 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
10842 args
, complain
, in_decl
);
10848 tree type
= NULL_TREE
;
10850 tree expanded_types
= NULL_TREE
;
10851 tree prev_r
= NULL_TREE
;
10852 tree first_r
= NULL_TREE
;
10854 if (DECL_PACK_P (t
))
10856 /* If there is a local specialization that isn't a
10857 parameter pack, it means that we're doing a "simple"
10858 substitution from inside tsubst_pack_expansion. Just
10859 return the local specialization (which will be a single
10861 tree spec
= retrieve_local_specialization (t
);
10863 && TREE_CODE (spec
) == PARM_DECL
10864 && TREE_CODE (TREE_TYPE (spec
)) != TYPE_PACK_EXPANSION
)
10867 /* Expand the TYPE_PACK_EXPANSION that provides the types for
10868 the parameters in this function parameter pack. */
10869 expanded_types
= tsubst_pack_expansion (TREE_TYPE (t
), args
,
10870 complain
, in_decl
);
10871 if (TREE_CODE (expanded_types
) == TREE_VEC
)
10873 len
= TREE_VEC_LENGTH (expanded_types
);
10875 /* Zero-length parameter packs are boring. Just substitute
10878 RETURN (tsubst (TREE_CHAIN (t
), args
, complain
,
10883 /* All we did was update the type. Make a note of that. */
10884 type
= expanded_types
;
10885 expanded_types
= NULL_TREE
;
10889 /* Loop through all of the parameters we'll build. When T is
10890 a function parameter pack, LEN is the number of expanded
10891 types in EXPANDED_TYPES; otherwise, LEN is 1. */
10893 for (i
= 0; i
< len
; ++i
)
10897 if (DECL_TEMPLATE_PARM_P (t
))
10898 SET_DECL_TEMPLATE_PARM_P (r
);
10900 if (expanded_types
)
10901 /* We're on the Ith parameter of the function parameter
10904 /* Get the Ith type. */
10905 type
= TREE_VEC_ELT (expanded_types
, i
);
10907 /* Rename the parameter to include the index. */
10909 = make_ith_pack_parameter_name (DECL_NAME (r
), i
);
10912 /* We're dealing with a normal parameter. */
10913 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
10915 type
= type_decays_to (type
);
10916 TREE_TYPE (r
) = type
;
10917 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
10919 if (DECL_INITIAL (r
))
10921 if (TREE_CODE (DECL_INITIAL (r
)) != TEMPLATE_PARM_INDEX
)
10922 DECL_INITIAL (r
) = TREE_TYPE (r
);
10924 DECL_INITIAL (r
) = tsubst (DECL_INITIAL (r
), args
,
10925 complain
, in_decl
);
10928 DECL_CONTEXT (r
) = NULL_TREE
;
10930 if (!DECL_TEMPLATE_PARM_P (r
))
10931 DECL_ARG_TYPE (r
) = type_passed_as (type
);
10933 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
10934 args
, complain
, in_decl
);
10936 /* Keep track of the first new parameter we
10937 generate. That's what will be returned to the
10942 /* Build a proper chain of parameters when substituting
10943 into a function parameter pack. */
10945 DECL_CHAIN (prev_r
) = r
;
10948 /* If cp_unevaluated_operand is set, we're just looking for a
10949 single dummy parameter, so don't keep going. */
10950 if (DECL_CHAIN (t
) && !cp_unevaluated_operand
)
10951 DECL_CHAIN (r
) = tsubst (DECL_CHAIN (t
), args
,
10952 complain
, DECL_CHAIN (t
));
10954 /* FIRST_R contains the start of the chain we've built. */
10961 tree type
= NULL_TREE
;
10962 tree vec
= NULL_TREE
;
10963 tree expanded_types
= NULL_TREE
;
10966 if (PACK_EXPANSION_P (TREE_TYPE (t
)))
10968 /* This field is a lambda capture pack. Return a TREE_VEC of
10969 the expanded fields to instantiate_class_template_1 and
10970 store them in the specializations hash table as a
10971 NONTYPE_ARGUMENT_PACK so that tsubst_copy can find them. */
10972 expanded_types
= tsubst_pack_expansion (TREE_TYPE (t
), args
,
10973 complain
, in_decl
);
10974 if (TREE_CODE (expanded_types
) == TREE_VEC
)
10976 len
= TREE_VEC_LENGTH (expanded_types
);
10977 vec
= make_tree_vec (len
);
10981 /* All we did was update the type. Make a note of that. */
10982 type
= expanded_types
;
10983 expanded_types
= NULL_TREE
;
10987 for (int i
= 0; i
< len
; ++i
)
10990 if (expanded_types
)
10992 type
= TREE_VEC_ELT (expanded_types
, i
);
10994 = make_ith_pack_parameter_name (DECL_NAME (r
), i
);
10997 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
10999 if (type
== error_mark_node
)
11000 RETURN (error_mark_node
);
11001 TREE_TYPE (r
) = type
;
11002 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
11004 if (DECL_C_BIT_FIELD (r
))
11005 /* For bit-fields, DECL_INITIAL gives the number of bits. For
11006 non-bit-fields DECL_INITIAL is a non-static data member
11007 initializer, which gets deferred instantiation. */
11009 = tsubst_expr (DECL_INITIAL (t
), args
,
11011 /*integral_constant_expression_p=*/true);
11012 else if (DECL_INITIAL (t
))
11014 /* Set up DECL_TEMPLATE_INFO so that we can get at the
11015 NSDMI in perform_member_init. Still set DECL_INITIAL
11016 so that we know there is one. */
11017 DECL_INITIAL (r
) = void_node
;
11018 gcc_assert (DECL_LANG_SPECIFIC (r
) == NULL
);
11019 retrofit_lang_decl (r
);
11020 DECL_TEMPLATE_INFO (r
) = build_template_info (t
, args
);
11022 /* We don't have to set DECL_CONTEXT here; it is set by
11023 finish_member_declaration. */
11024 DECL_CHAIN (r
) = NULL_TREE
;
11026 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
11027 args
, complain
, in_decl
);
11030 TREE_VEC_ELT (vec
, i
) = r
;
11036 tree pack
= make_node (NONTYPE_ARGUMENT_PACK
);
11037 tree tpack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
11038 SET_ARGUMENT_PACK_ARGS (pack
, vec
);
11039 SET_ARGUMENT_PACK_ARGS (tpack
, expanded_types
);
11040 TREE_TYPE (pack
) = tpack
;
11041 register_specialization (pack
, t
, args
, false, 0);
11047 /* We reach here only for member using decls. We also need to check
11048 uses_template_parms because DECL_DEPENDENT_P is not set for a
11049 using-declaration that designates a member of the current
11050 instantiation (c++/53549). */
11051 if (DECL_DEPENDENT_P (t
)
11052 || uses_template_parms (USING_DECL_SCOPE (t
)))
11054 tree inst_scope
= tsubst_copy (USING_DECL_SCOPE (t
), args
,
11055 complain
, in_decl
);
11056 tree name
= tsubst_copy (DECL_NAME (t
), args
, complain
, in_decl
);
11057 r
= do_class_using_decl (inst_scope
, name
);
11059 r
= error_mark_node
;
11062 TREE_PROTECTED (r
) = TREE_PROTECTED (t
);
11063 TREE_PRIVATE (r
) = TREE_PRIVATE (t
);
11069 DECL_CHAIN (r
) = NULL_TREE
;
11076 tree argvec
= NULL_TREE
;
11077 tree gen_tmpl
= NULL_TREE
;
11079 tree tmpl
= NULL_TREE
;
11081 tree type
= NULL_TREE
;
11084 if (TREE_TYPE (t
) == error_mark_node
)
11085 RETURN (error_mark_node
);
11087 if (TREE_CODE (t
) == TYPE_DECL
11088 && t
== TYPE_MAIN_DECL (TREE_TYPE (t
)))
11090 /* If this is the canonical decl, we don't have to
11091 mess with instantiations, and often we can't (for
11092 typename, template type parms and such). Note that
11093 TYPE_NAME is not correct for the above test if
11094 we've copied the type for a typedef. */
11095 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11096 if (type
== error_mark_node
)
11097 RETURN (error_mark_node
);
11098 r
= TYPE_NAME (type
);
11102 /* Check to see if we already have the specialization we
11105 if (DECL_CLASS_SCOPE_P (t
) || DECL_NAMESPACE_SCOPE_P (t
))
11107 /* T is a static data member or namespace-scope entity.
11108 We have to substitute into namespace-scope variables
11109 (even though such entities are never templates) because
11112 template <class T> void f() { extern T t; }
11114 where the entity referenced is not known until
11115 instantiation time. */
11117 ctx
= DECL_CONTEXT (t
);
11118 if (DECL_CLASS_SCOPE_P (t
))
11120 ctx
= tsubst_aggr_type (ctx
, args
,
11122 in_decl
, /*entering_scope=*/1);
11123 /* If CTX is unchanged, then T is in fact the
11124 specialization we want. That situation occurs when
11125 referencing a static data member within in its own
11126 class. We can use pointer equality, rather than
11127 same_type_p, because DECL_CONTEXT is always
11129 if (ctx
== DECL_CONTEXT (t
)
11130 /* ... unless T is a member template; in which
11131 case our caller can be willing to create a
11132 specialization of that template represented
11134 && !(DECL_TI_TEMPLATE (t
)
11135 && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (t
))))
11141 tmpl
= DECL_TI_TEMPLATE (t
);
11142 gen_tmpl
= most_general_template (tmpl
);
11143 argvec
= tsubst (DECL_TI_ARGS (t
), args
, complain
, in_decl
);
11144 if (argvec
== error_mark_node
)
11145 RETURN (error_mark_node
);
11146 hash
= hash_tmpl_and_args (gen_tmpl
, argvec
);
11147 spec
= retrieve_specialization (gen_tmpl
, argvec
, hash
);
11152 /* A local variable. */
11154 /* Subsequent calls to pushdecl will fill this in. */
11156 spec
= retrieve_local_specialization (t
);
11158 /* If we already have the specialization we need, there is
11159 nothing more to do. */
11166 /* Create a new node for the specialization we need. */
11168 if (type
== NULL_TREE
)
11170 if (is_typedef_decl (t
))
11171 type
= DECL_ORIGINAL_TYPE (t
);
11173 type
= TREE_TYPE (t
);
11175 && VAR_HAD_UNKNOWN_BOUND (t
)
11176 && type
!= error_mark_node
)
11177 type
= strip_array_domain (type
);
11178 type
= tsubst (type
, args
, complain
, in_decl
);
11182 /* Even if the original location is out of scope, the
11183 newly substituted one is not. */
11184 DECL_DEAD_FOR_LOCAL (r
) = 0;
11185 DECL_INITIALIZED_P (r
) = 0;
11186 DECL_TEMPLATE_INSTANTIATED (r
) = 0;
11187 if (type
== error_mark_node
)
11188 RETURN (error_mark_node
);
11189 if (TREE_CODE (type
) == FUNCTION_TYPE
)
11191 /* It may seem that this case cannot occur, since:
11196 declares a function, not a variable. However:
11199 template <typename T> void g() { T t; }
11200 template void g<f>();
11202 is an attempt to declare a variable with function
11204 error ("variable %qD has function type",
11205 /* R is not yet sufficiently initialized, so we
11206 just use its name. */
11208 RETURN (error_mark_node
);
11210 type
= complete_type (type
);
11211 /* Wait until cp_finish_decl to set this again, to handle
11212 circular dependency (template/instantiate6.C). */
11213 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r
) = 0;
11214 type
= check_var_type (DECL_NAME (r
), type
);
11216 if (DECL_HAS_VALUE_EXPR_P (t
))
11218 tree ve
= DECL_VALUE_EXPR (t
);
11219 ve
= tsubst_expr (ve
, args
, complain
, in_decl
,
11220 /*constant_expression_p=*/false);
11221 if (REFERENCE_REF_P (ve
))
11223 gcc_assert (TREE_CODE (type
) == REFERENCE_TYPE
);
11224 ve
= TREE_OPERAND (ve
, 0);
11226 SET_DECL_VALUE_EXPR (r
, ve
);
11228 if (TREE_STATIC (r
) || DECL_EXTERNAL (r
))
11229 set_decl_tls_model (r
, decl_tls_model (t
));
11231 else if (DECL_SELF_REFERENCE_P (t
))
11232 SET_DECL_SELF_REFERENCE_P (r
);
11233 TREE_TYPE (r
) = type
;
11234 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
11235 DECL_CONTEXT (r
) = ctx
;
11236 /* Clear out the mangled name and RTL for the instantiation. */
11237 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
11238 if (CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_DECL_WRTL
))
11239 SET_DECL_RTL (r
, NULL
);
11240 /* The initializer must not be expanded until it is required;
11241 see [temp.inst]. */
11242 DECL_INITIAL (r
) = NULL_TREE
;
11243 if (CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_DECL_WRTL
))
11244 SET_DECL_RTL (r
, NULL
);
11245 DECL_SIZE (r
) = DECL_SIZE_UNIT (r
) = 0;
11248 /* Possibly limit visibility based on template args. */
11249 DECL_VISIBILITY (r
) = VISIBILITY_DEFAULT
;
11250 if (DECL_VISIBILITY_SPECIFIED (t
))
11252 DECL_VISIBILITY_SPECIFIED (r
) = 0;
11253 DECL_ATTRIBUTES (r
)
11254 = remove_attribute ("visibility", DECL_ATTRIBUTES (r
));
11256 determine_visibility (r
);
11261 /* A static data member declaration is always marked
11262 external when it is declared in-class, even if an
11263 initializer is present. We mimic the non-template
11264 processing here. */
11265 DECL_EXTERNAL (r
) = 1;
11267 register_specialization (r
, gen_tmpl
, argvec
, false, hash
);
11268 DECL_TEMPLATE_INFO (r
) = build_template_info (tmpl
, argvec
);
11269 SET_DECL_IMPLICIT_INSTANTIATION (r
);
11271 else if (!cp_unevaluated_operand
)
11272 register_local_specialization (r
, t
);
11274 DECL_CHAIN (r
) = NULL_TREE
;
11276 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
),
11278 args
, complain
, in_decl
);
11280 /* Preserve a typedef that names a type. */
11281 if (is_typedef_decl (r
))
11283 DECL_ORIGINAL_TYPE (r
) = NULL_TREE
;
11284 set_underlying_type (r
);
11287 layout_decl (r
, 0);
11292 gcc_unreachable ();
11297 /* Restore the file and line information. */
11298 input_location
= saved_loc
;
11303 /* Substitute into the ARG_TYPES of a function type.
11304 If END is a TREE_CHAIN, leave it and any following types
11308 tsubst_arg_types (tree arg_types
,
11311 tsubst_flags_t complain
,
11314 tree remaining_arg_types
;
11315 tree type
= NULL_TREE
;
11317 tree expanded_args
= NULL_TREE
;
11320 if (!arg_types
|| arg_types
== void_list_node
|| arg_types
== end
)
11323 remaining_arg_types
= tsubst_arg_types (TREE_CHAIN (arg_types
),
11324 args
, end
, complain
, in_decl
);
11325 if (remaining_arg_types
== error_mark_node
)
11326 return error_mark_node
;
11328 if (PACK_EXPANSION_P (TREE_VALUE (arg_types
)))
11330 /* For a pack expansion, perform substitution on the
11331 entire expression. Later on, we'll handle the arguments
11333 expanded_args
= tsubst_pack_expansion (TREE_VALUE (arg_types
),
11334 args
, complain
, in_decl
);
11336 if (TREE_CODE (expanded_args
) == TREE_VEC
)
11337 /* So that we'll spin through the parameters, one by one. */
11338 i
= TREE_VEC_LENGTH (expanded_args
);
11341 /* We only partially substituted into the parameter
11342 pack. Our type is TYPE_PACK_EXPANSION. */
11343 type
= expanded_args
;
11344 expanded_args
= NULL_TREE
;
11352 type
= TREE_VEC_ELT (expanded_args
, i
);
11354 type
= tsubst (TREE_VALUE (arg_types
), args
, complain
, in_decl
);
11356 if (type
== error_mark_node
)
11357 return error_mark_node
;
11358 if (VOID_TYPE_P (type
))
11360 if (complain
& tf_error
)
11362 error ("invalid parameter type %qT", type
);
11364 error ("in declaration %q+D", in_decl
);
11366 return error_mark_node
;
11369 if (abstract_virtuals_error_sfinae (ACU_PARM
, type
, complain
))
11370 return error_mark_node
;
11372 /* Do array-to-pointer, function-to-pointer conversion, and ignore
11373 top-level qualifiers as required. */
11374 type
= cv_unqualified (type_decays_to (type
));
11376 /* We do not substitute into default arguments here. The standard
11377 mandates that they be instantiated only when needed, which is
11378 done in build_over_call. */
11379 default_arg
= TREE_PURPOSE (arg_types
);
11381 if (default_arg
&& TREE_CODE (default_arg
) == DEFAULT_ARG
)
11383 /* We've instantiated a template before its default arguments
11384 have been parsed. This can happen for a nested template
11385 class, and is not an error unless we require the default
11386 argument in a call of this function. */
11387 remaining_arg_types
=
11388 tree_cons (default_arg
, type
, remaining_arg_types
);
11389 vec_safe_push (DEFARG_INSTANTIATIONS(default_arg
), remaining_arg_types
);
11392 remaining_arg_types
=
11393 hash_tree_cons (default_arg
, type
, remaining_arg_types
);
11396 return remaining_arg_types
;
11399 /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does
11400 *not* handle the exception-specification for FNTYPE, because the
11401 initial substitution of explicitly provided template parameters
11402 during argument deduction forbids substitution into the
11403 exception-specification:
11407 All references in the function type of the function template to the
11408 corresponding template parameters are replaced by the specified tem-
11409 plate argument values. If a substitution in a template parameter or
11410 in the function type of the function template results in an invalid
11411 type, type deduction fails. [Note: The equivalent substitution in
11412 exception specifications is done only when the function is instanti-
11413 ated, at which point a program is ill-formed if the substitution
11414 results in an invalid type.] */
11417 tsubst_function_type (tree t
,
11419 tsubst_flags_t complain
,
11423 tree arg_types
= NULL_TREE
;
11426 /* The TYPE_CONTEXT is not used for function/method types. */
11427 gcc_assert (TYPE_CONTEXT (t
) == NULL_TREE
);
11429 /* DR 1227: Mixing immediate and non-immediate contexts in deduction
11431 bool late_return_type_p
= TYPE_HAS_LATE_RETURN_TYPE (t
);
11433 if (late_return_type_p
)
11435 /* Substitute the argument types. */
11436 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
, NULL_TREE
,
11437 complain
, in_decl
);
11438 if (arg_types
== error_mark_node
)
11439 return error_mark_node
;
11441 tree save_ccp
= current_class_ptr
;
11442 tree save_ccr
= current_class_ref
;
11443 tree this_type
= (TREE_CODE (t
) == METHOD_TYPE
11444 ? TREE_TYPE (TREE_VALUE (arg_types
)) : NULL_TREE
);
11445 bool do_inject
= this_type
&& CLASS_TYPE_P (this_type
);
11448 /* DR 1207: 'this' is in scope in the trailing return type. */
11449 inject_this_parameter (this_type
, cp_type_quals (this_type
));
11452 /* Substitute the return type. */
11453 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11457 current_class_ptr
= save_ccp
;
11458 current_class_ref
= save_ccr
;
11462 /* Substitute the return type. */
11463 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11465 if (return_type
== error_mark_node
)
11466 return error_mark_node
;
11467 /* DR 486 clarifies that creation of a function type with an
11468 invalid return type is a deduction failure. */
11469 if (TREE_CODE (return_type
) == ARRAY_TYPE
11470 || TREE_CODE (return_type
) == FUNCTION_TYPE
)
11472 if (complain
& tf_error
)
11474 if (TREE_CODE (return_type
) == ARRAY_TYPE
)
11475 error ("function returning an array");
11477 error ("function returning a function");
11479 return error_mark_node
;
11482 if (abstract_virtuals_error_sfinae (ACU_RETURN
, return_type
, complain
))
11483 return error_mark_node
;
11485 if (!late_return_type_p
)
11487 /* Substitute the argument types. */
11488 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
, NULL_TREE
,
11489 complain
, in_decl
);
11490 if (arg_types
== error_mark_node
)
11491 return error_mark_node
;
11494 /* Construct a new type node and return it. */
11495 if (TREE_CODE (t
) == FUNCTION_TYPE
)
11497 fntype
= build_function_type (return_type
, arg_types
);
11498 fntype
= apply_memfn_quals (fntype
,
11499 type_memfn_quals (t
),
11500 type_memfn_rqual (t
));
11504 tree r
= TREE_TYPE (TREE_VALUE (arg_types
));
11505 /* Don't pick up extra function qualifiers from the basetype. */
11506 r
= cp_build_qualified_type_real (r
, type_memfn_quals (t
), complain
);
11507 if (! MAYBE_CLASS_TYPE_P (r
))
11511 Type deduction may fail for any of the following
11514 -- Attempting to create "pointer to member of T" when T
11515 is not a class type. */
11516 if (complain
& tf_error
)
11517 error ("creating pointer to member function of non-class type %qT",
11519 return error_mark_node
;
11522 fntype
= build_method_type_directly (r
, return_type
,
11523 TREE_CHAIN (arg_types
));
11524 fntype
= build_ref_qualified_type (fntype
, type_memfn_rqual (t
));
11526 fntype
= cp_build_type_attribute_variant (fntype
, TYPE_ATTRIBUTES (t
));
11528 if (late_return_type_p
)
11529 TYPE_HAS_LATE_RETURN_TYPE (fntype
) = 1;
11534 /* FNTYPE is a FUNCTION_TYPE or METHOD_TYPE. Substitute the template
11535 ARGS into that specification, and return the substituted
11536 specification. If there is no specification, return NULL_TREE. */
11539 tsubst_exception_specification (tree fntype
,
11541 tsubst_flags_t complain
,
11548 specs
= TYPE_RAISES_EXCEPTIONS (fntype
);
11549 new_specs
= NULL_TREE
;
11550 if (specs
&& TREE_PURPOSE (specs
))
11552 /* A noexcept-specifier. */
11553 tree expr
= TREE_PURPOSE (specs
);
11554 if (TREE_CODE (expr
) == INTEGER_CST
)
11558 /* Defer instantiation of noexcept-specifiers to avoid
11559 excessive instantiations (c++/49107). */
11560 new_specs
= make_node (DEFERRED_NOEXCEPT
);
11561 if (DEFERRED_NOEXCEPT_SPEC_P (specs
))
11563 /* We already partially instantiated this member template,
11564 so combine the new args with the old. */
11565 DEFERRED_NOEXCEPT_PATTERN (new_specs
)
11566 = DEFERRED_NOEXCEPT_PATTERN (expr
);
11567 DEFERRED_NOEXCEPT_ARGS (new_specs
)
11568 = add_to_template_args (DEFERRED_NOEXCEPT_ARGS (expr
), args
);
11572 DEFERRED_NOEXCEPT_PATTERN (new_specs
) = expr
;
11573 DEFERRED_NOEXCEPT_ARGS (new_specs
) = args
;
11577 new_specs
= tsubst_copy_and_build
11578 (expr
, args
, complain
, in_decl
, /*function_p=*/false,
11579 /*integral_constant_expression_p=*/true);
11580 new_specs
= build_noexcept_spec (new_specs
, complain
);
11584 if (! TREE_VALUE (specs
))
11591 tree expanded_specs
= NULL_TREE
;
11593 if (PACK_EXPANSION_P (TREE_VALUE (specs
)))
11595 /* Expand the pack expansion type. */
11596 expanded_specs
= tsubst_pack_expansion (TREE_VALUE (specs
),
11600 if (expanded_specs
== error_mark_node
)
11601 return error_mark_node
;
11602 else if (TREE_CODE (expanded_specs
) == TREE_VEC
)
11603 len
= TREE_VEC_LENGTH (expanded_specs
);
11606 /* We're substituting into a member template, so
11607 we got a TYPE_PACK_EXPANSION back. Add that
11608 expansion and move on. */
11609 gcc_assert (TREE_CODE (expanded_specs
)
11610 == TYPE_PACK_EXPANSION
);
11611 new_specs
= add_exception_specifier (new_specs
,
11614 specs
= TREE_CHAIN (specs
);
11619 for (i
= 0; i
< len
; ++i
)
11621 if (expanded_specs
)
11622 spec
= TREE_VEC_ELT (expanded_specs
, i
);
11624 spec
= tsubst (TREE_VALUE (specs
), args
, complain
, in_decl
);
11625 if (spec
== error_mark_node
)
11627 new_specs
= add_exception_specifier (new_specs
, spec
,
11631 specs
= TREE_CHAIN (specs
);
11637 /* Take the tree structure T and replace template parameters used
11638 therein with the argument vector ARGS. IN_DECL is an associated
11639 decl for diagnostics. If an error occurs, returns ERROR_MARK_NODE.
11640 Issue error and warning messages under control of COMPLAIN. Note
11641 that we must be relatively non-tolerant of extensions here, in
11642 order to preserve conformance; if we allow substitutions that
11643 should not be allowed, we may allow argument deductions that should
11644 not succeed, and therefore report ambiguous overload situations
11645 where there are none. In theory, we could allow the substitution,
11646 but indicate that it should have failed, and allow our caller to
11647 make sure that the right thing happens, but we don't try to do this
11650 This function is used for dealing with types, decls and the like;
11651 for expressions, use tsubst_expr or tsubst_copy. */
11654 tsubst (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
11656 enum tree_code code
;
11657 tree type
, r
= NULL_TREE
;
11659 if (t
== NULL_TREE
|| t
== error_mark_node
11660 || t
== integer_type_node
11661 || t
== void_type_node
11662 || t
== char_type_node
11663 || t
== unknown_type_node
11664 || TREE_CODE (t
) == NAMESPACE_DECL
11665 || TREE_CODE (t
) == TRANSLATION_UNIT_DECL
)
11669 return tsubst_decl (t
, args
, complain
);
11671 if (args
== NULL_TREE
)
11674 code
= TREE_CODE (t
);
11676 if (code
== IDENTIFIER_NODE
)
11677 type
= IDENTIFIER_TYPE_VALUE (t
);
11679 type
= TREE_TYPE (t
);
11681 gcc_assert (type
!= unknown_type_node
);
11683 /* Reuse typedefs. We need to do this to handle dependent attributes,
11684 such as attribute aligned. */
11686 && typedef_variant_p (t
))
11688 tree decl
= TYPE_NAME (t
);
11690 if (alias_template_specialization_p (t
))
11692 /* DECL represents an alias template and we want to
11694 tree tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
11695 tree gen_args
= tsubst (DECL_TI_ARGS (decl
), args
, complain
, in_decl
);
11696 r
= instantiate_alias_template (tmpl
, gen_args
, complain
);
11698 else if (DECL_CLASS_SCOPE_P (decl
)
11699 && CLASSTYPE_TEMPLATE_INFO (DECL_CONTEXT (decl
))
11700 && uses_template_parms (DECL_CONTEXT (decl
)))
11702 tree tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
11703 tree gen_args
= tsubst (DECL_TI_ARGS (decl
), args
, complain
, in_decl
);
11704 r
= retrieve_specialization (tmpl
, gen_args
, 0);
11706 else if (DECL_FUNCTION_SCOPE_P (decl
)
11707 && DECL_TEMPLATE_INFO (DECL_CONTEXT (decl
))
11708 && uses_template_parms (DECL_TI_ARGS (DECL_CONTEXT (decl
))))
11709 r
= retrieve_local_specialization (decl
);
11711 /* The typedef is from a non-template context. */
11717 r
= cp_build_qualified_type_real
11718 (r
, cp_type_quals (t
) | cp_type_quals (r
),
11719 complain
| tf_ignore_bad_quals
);
11724 /* We don't have an instantiation yet, so drop the typedef. */
11725 int quals
= cp_type_quals (t
);
11726 t
= DECL_ORIGINAL_TYPE (decl
);
11727 t
= cp_build_qualified_type_real (t
, quals
,
11728 complain
| tf_ignore_bad_quals
);
11733 && code
!= TYPENAME_TYPE
11734 && code
!= TEMPLATE_TYPE_PARM
11735 && code
!= IDENTIFIER_NODE
11736 && code
!= FUNCTION_TYPE
11737 && code
!= METHOD_TYPE
)
11738 type
= tsubst (type
, args
, complain
, in_decl
);
11739 if (type
== error_mark_node
)
11740 return error_mark_node
;
11746 case ENUMERAL_TYPE
:
11747 return tsubst_aggr_type (t
, args
, complain
, in_decl
,
11748 /*entering_scope=*/0);
11751 case IDENTIFIER_NODE
:
11762 if (t
== integer_type_node
)
11765 if (TREE_CODE (TYPE_MIN_VALUE (t
)) == INTEGER_CST
11766 && TREE_CODE (TYPE_MAX_VALUE (t
)) == INTEGER_CST
)
11770 tree max
, omax
= TREE_OPERAND (TYPE_MAX_VALUE (t
), 0);
11772 max
= tsubst_expr (omax
, args
, complain
, in_decl
,
11773 /*integral_constant_expression_p=*/false);
11775 /* Fix up type of the magic NOP_EXPR with TREE_SIDE_EFFECTS if
11777 if (TREE_CODE (max
) == NOP_EXPR
11778 && TREE_SIDE_EFFECTS (omax
)
11779 && !TREE_TYPE (max
))
11780 TREE_TYPE (max
) = TREE_TYPE (TREE_OPERAND (max
, 0));
11782 /* If we're in a partial instantiation, preserve the magic NOP_EXPR
11783 with TREE_SIDE_EFFECTS that indicates this is not an integral
11784 constant expression. */
11785 if (processing_template_decl
11786 && TREE_SIDE_EFFECTS (omax
) && TREE_CODE (omax
) == NOP_EXPR
)
11788 gcc_assert (TREE_CODE (max
) == NOP_EXPR
);
11789 TREE_SIDE_EFFECTS (max
) = 1;
11792 return compute_array_index_type (NULL_TREE
, max
, complain
);
11795 case TEMPLATE_TYPE_PARM
:
11796 case TEMPLATE_TEMPLATE_PARM
:
11797 case BOUND_TEMPLATE_TEMPLATE_PARM
:
11798 case TEMPLATE_PARM_INDEX
:
11803 tree arg
= NULL_TREE
;
11807 gcc_assert (TREE_VEC_LENGTH (args
) > 0);
11808 template_parm_level_and_index (t
, &level
, &idx
);
11810 levels
= TMPL_ARGS_DEPTH (args
);
11811 if (level
<= levels
)
11813 arg
= TMPL_ARG (args
, level
, idx
);
11815 if (arg
&& TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
11817 /* See through ARGUMENT_PACK_SELECT arguments. */
11818 arg
= ARGUMENT_PACK_SELECT_ARG (arg
);
11819 /* If the selected argument is an expansion E, that most
11820 likely means we were called from
11821 gen_elem_of_pack_expansion_instantiation during the
11822 substituting of pack an argument pack (which Ith
11823 element is a pack expansion, where I is
11824 ARGUMENT_PACK_SELECT_INDEX) into a pack expansion.
11825 In this case, the Ith element resulting from this
11826 substituting is going to be a pack expansion, which
11827 pattern is the pattern of E. Let's return the
11829 gen_elem_of_pack_expansion_instantiation will
11830 build the resulting pack expansion from it. */
11831 if (PACK_EXPANSION_P (arg
))
11832 arg
= PACK_EXPANSION_PATTERN (arg
);
11836 if (arg
== error_mark_node
)
11837 return error_mark_node
;
11838 else if (arg
!= NULL_TREE
)
11840 if (ARGUMENT_PACK_P (arg
))
11841 /* If ARG is an argument pack, we don't actually want to
11842 perform a substitution here, because substitutions
11843 for argument packs are only done
11844 element-by-element. We can get to this point when
11845 substituting the type of a non-type template
11846 parameter pack, when that type actually contains
11847 template parameter packs from an outer template, e.g.,
11849 template<typename... Types> struct A {
11850 template<Types... Values> struct B { };
11854 if (code
== TEMPLATE_TYPE_PARM
)
11857 gcc_assert (TYPE_P (arg
));
11859 quals
= cp_type_quals (arg
) | cp_type_quals (t
);
11861 return cp_build_qualified_type_real
11862 (arg
, quals
, complain
| tf_ignore_bad_quals
);
11864 else if (code
== BOUND_TEMPLATE_TEMPLATE_PARM
)
11866 /* We are processing a type constructed from a
11867 template template parameter. */
11868 tree argvec
= tsubst (TYPE_TI_ARGS (t
),
11869 args
, complain
, in_decl
);
11870 if (argvec
== error_mark_node
)
11871 return error_mark_node
;
11873 gcc_assert (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
11874 || TREE_CODE (arg
) == TEMPLATE_DECL
11875 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
);
11877 if (TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
)
11878 /* Consider this code:
11880 template <template <class> class Template>
11882 template <class Arg> using Bind = Template<Arg>;
11885 template <template <class> class Template, class Arg>
11886 using Instantiate = Template<Arg>; //#0
11888 template <template <class> class Template,
11891 Instantiate<Internal<Template>::template Bind,
11894 When #1 is parsed, the
11895 BOUND_TEMPLATE_TEMPLATE_PARM representing the
11896 parameter `Template' in #0 matches the
11897 UNBOUND_CLASS_TEMPLATE representing the argument
11898 `Internal<Template>::template Bind'; We then want
11899 to assemble the type `Bind<Argument>' that can't
11900 be fully created right now, because
11901 `Internal<Template>' not being complete, the Bind
11902 template cannot be looked up in that context. So
11903 we need to "store" `Bind<Argument>' for later
11904 when the context of Bind becomes complete. Let's
11905 store that in a TYPENAME_TYPE. */
11906 return make_typename_type (TYPE_CONTEXT (arg
),
11907 build_nt (TEMPLATE_ID_EXPR
,
11908 TYPE_IDENTIFIER (arg
),
11913 /* We can get a TEMPLATE_TEMPLATE_PARM here when we
11914 are resolving nested-types in the signature of a
11915 member function templates. Otherwise ARG is a
11916 TEMPLATE_DECL and is the real template to be
11918 if (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
11919 arg
= TYPE_NAME (arg
);
11921 r
= lookup_template_class (arg
,
11923 DECL_CONTEXT (arg
),
11924 /*entering_scope=*/0,
11926 return cp_build_qualified_type_real
11927 (r
, cp_type_quals (t
) | cp_type_quals (r
), complain
);
11930 /* TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX. */
11931 return convert_from_reference (unshare_expr (arg
));
11935 /* This can happen during the attempted tsubst'ing in
11936 unify. This means that we don't yet have any information
11937 about the template parameter in question. */
11940 /* Early in template argument deduction substitution, we don't
11941 want to reduce the level of 'auto', or it will be confused
11942 with a normal template parm in subsequent deduction. */
11943 if (is_auto (t
) && (complain
& tf_partial
))
11946 /* If we get here, we must have been looking at a parm for a
11947 more deeply nested template. Make a new version of this
11948 template parameter, but with a lower level. */
11951 case TEMPLATE_TYPE_PARM
:
11952 case TEMPLATE_TEMPLATE_PARM
:
11953 case BOUND_TEMPLATE_TEMPLATE_PARM
:
11954 if (cp_type_quals (t
))
11956 r
= tsubst (TYPE_MAIN_VARIANT (t
), args
, complain
, in_decl
);
11957 r
= cp_build_qualified_type_real
11958 (r
, cp_type_quals (t
),
11959 complain
| (code
== TEMPLATE_TYPE_PARM
11960 ? tf_ignore_bad_quals
: 0));
11965 TEMPLATE_TYPE_PARM_INDEX (r
)
11966 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (t
),
11967 r
, levels
, args
, complain
);
11968 TYPE_STUB_DECL (r
) = TYPE_NAME (r
) = TEMPLATE_TYPE_DECL (r
);
11969 TYPE_MAIN_VARIANT (r
) = r
;
11970 TYPE_POINTER_TO (r
) = NULL_TREE
;
11971 TYPE_REFERENCE_TO (r
) = NULL_TREE
;
11973 if (TREE_CODE (r
) == TEMPLATE_TEMPLATE_PARM
)
11974 /* We have reduced the level of the template
11975 template parameter, but not the levels of its
11976 template parameters, so canonical_type_parameter
11977 will not be able to find the canonical template
11978 template parameter for this level. Thus, we
11979 require structural equality checking to compare
11980 TEMPLATE_TEMPLATE_PARMs. */
11981 SET_TYPE_STRUCTURAL_EQUALITY (r
);
11982 else if (TYPE_STRUCTURAL_EQUALITY_P (t
))
11983 SET_TYPE_STRUCTURAL_EQUALITY (r
);
11985 TYPE_CANONICAL (r
) = canonical_type_parameter (r
);
11987 if (code
== BOUND_TEMPLATE_TEMPLATE_PARM
)
11989 tree argvec
= tsubst (TYPE_TI_ARGS (t
), args
,
11990 complain
, in_decl
);
11991 if (argvec
== error_mark_node
)
11992 return error_mark_node
;
11994 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (r
)
11995 = build_template_info (TYPE_TI_TEMPLATE (t
), argvec
);
12000 case TEMPLATE_PARM_INDEX
:
12001 r
= reduce_template_parm_level (t
, type
, levels
, args
, complain
);
12005 gcc_unreachable ();
12013 tree purpose
, value
, chain
;
12015 if (t
== void_list_node
)
12018 purpose
= TREE_PURPOSE (t
);
12021 purpose
= tsubst (purpose
, args
, complain
, in_decl
);
12022 if (purpose
== error_mark_node
)
12023 return error_mark_node
;
12025 value
= TREE_VALUE (t
);
12028 value
= tsubst (value
, args
, complain
, in_decl
);
12029 if (value
== error_mark_node
)
12030 return error_mark_node
;
12032 chain
= TREE_CHAIN (t
);
12033 if (chain
&& chain
!= void_type_node
)
12035 chain
= tsubst (chain
, args
, complain
, in_decl
);
12036 if (chain
== error_mark_node
)
12037 return error_mark_node
;
12039 if (purpose
== TREE_PURPOSE (t
)
12040 && value
== TREE_VALUE (t
)
12041 && chain
== TREE_CHAIN (t
))
12043 return hash_tree_cons (purpose
, value
, chain
);
12047 /* We should never be tsubsting a binfo. */
12048 gcc_unreachable ();
12051 /* A vector of template arguments. */
12052 gcc_assert (!type
);
12053 return tsubst_template_args (t
, args
, complain
, in_decl
);
12056 case REFERENCE_TYPE
:
12058 if (type
== TREE_TYPE (t
) && TREE_CODE (type
) != METHOD_TYPE
)
12063 Type deduction may fail for any of the following
12066 -- Attempting to create a pointer to reference type.
12067 -- Attempting to create a reference to a reference type or
12068 a reference to void.
12070 Core issue 106 says that creating a reference to a reference
12071 during instantiation is no longer a cause for failure. We
12072 only enforce this check in strict C++98 mode. */
12073 if ((TREE_CODE (type
) == REFERENCE_TYPE
12074 && (((cxx_dialect
== cxx98
) && flag_iso
) || code
!= REFERENCE_TYPE
))
12075 || (code
== REFERENCE_TYPE
&& VOID_TYPE_P (type
)))
12077 static location_t last_loc
;
12079 /* We keep track of the last time we issued this error
12080 message to avoid spewing a ton of messages during a
12081 single bad template instantiation. */
12082 if (complain
& tf_error
12083 && last_loc
!= input_location
)
12085 if (VOID_TYPE_P (type
))
12086 error ("forming reference to void");
12087 else if (code
== POINTER_TYPE
)
12088 error ("forming pointer to reference type %qT", type
);
12090 error ("forming reference to reference type %qT", type
);
12091 last_loc
= input_location
;
12094 return error_mark_node
;
12096 else if (TREE_CODE (type
) == FUNCTION_TYPE
12097 && (type_memfn_quals (type
) != TYPE_UNQUALIFIED
12098 || type_memfn_rqual (type
) != REF_QUAL_NONE
))
12100 if (complain
& tf_error
)
12102 if (code
== POINTER_TYPE
)
12103 error ("forming pointer to qualified function type %qT",
12106 error ("forming reference to qualified function type %qT",
12109 return error_mark_node
;
12111 else if (code
== POINTER_TYPE
)
12113 r
= build_pointer_type (type
);
12114 if (TREE_CODE (type
) == METHOD_TYPE
)
12115 r
= build_ptrmemfunc_type (r
);
12117 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
12118 /* In C++0x, during template argument substitution, when there is an
12119 attempt to create a reference to a reference type, reference
12120 collapsing is applied as described in [14.3.1/4 temp.arg.type]:
12122 "If a template-argument for a template-parameter T names a type
12123 that is a reference to a type A, an attempt to create the type
12124 'lvalue reference to cv T' creates the type 'lvalue reference to
12125 A,' while an attempt to create the type type rvalue reference to
12126 cv T' creates the type T"
12128 r
= cp_build_reference_type
12130 TYPE_REF_IS_RVALUE (t
) && TYPE_REF_IS_RVALUE (type
));
12132 r
= cp_build_reference_type (type
, TYPE_REF_IS_RVALUE (t
));
12133 r
= cp_build_qualified_type_real (r
, cp_type_quals (t
), complain
);
12135 if (cxx_dialect
>= cxx14
12136 && !(TREE_CODE (t
) == REFERENCE_TYPE
&& REFERENCE_VLA_OK (t
))
12137 && array_of_runtime_bound_p (type
)
12138 && (flag_iso
|| warn_vla
> 0))
12140 if (complain
& tf_warning_or_error
)
12142 (input_location
, OPT_Wvla
,
12143 code
== REFERENCE_TYPE
12144 ? G_("cannot declare reference to array of runtime bound")
12145 : G_("cannot declare pointer to array of runtime bound"));
12147 r
= error_mark_node
;
12150 if (r
!= error_mark_node
)
12151 /* Will this ever be needed for TYPE_..._TO values? */
12158 r
= tsubst (TYPE_OFFSET_BASETYPE (t
), args
, complain
, in_decl
);
12159 if (r
== error_mark_node
|| !MAYBE_CLASS_TYPE_P (r
))
12163 Type deduction may fail for any of the following
12166 -- Attempting to create "pointer to member of T" when T
12167 is not a class type. */
12168 if (complain
& tf_error
)
12169 error ("creating pointer to member of non-class type %qT", r
);
12170 return error_mark_node
;
12172 if (TREE_CODE (type
) == REFERENCE_TYPE
)
12174 if (complain
& tf_error
)
12175 error ("creating pointer to member reference type %qT", type
);
12176 return error_mark_node
;
12178 if (VOID_TYPE_P (type
))
12180 if (complain
& tf_error
)
12181 error ("creating pointer to member of type void");
12182 return error_mark_node
;
12184 gcc_assert (TREE_CODE (type
) != METHOD_TYPE
);
12185 if (TREE_CODE (type
) == FUNCTION_TYPE
)
12187 /* The type of the implicit object parameter gets its
12188 cv-qualifiers from the FUNCTION_TYPE. */
12191 = build_memfn_type (type
, r
, type_memfn_quals (type
),
12192 type_memfn_rqual (type
));
12193 memptr
= build_ptrmemfunc_type (build_pointer_type (method_type
));
12194 return cp_build_qualified_type_real (memptr
, cp_type_quals (t
),
12198 return cp_build_qualified_type_real (build_ptrmem_type (r
, type
),
12202 case FUNCTION_TYPE
:
12207 fntype
= tsubst_function_type (t
, args
, complain
, in_decl
);
12208 if (fntype
== error_mark_node
)
12209 return error_mark_node
;
12211 /* Substitute the exception specification. */
12212 specs
= tsubst_exception_specification (t
, args
, complain
,
12213 in_decl
, /*defer_ok*/true);
12214 if (specs
== error_mark_node
)
12215 return error_mark_node
;
12217 fntype
= build_exception_variant (fntype
, specs
);
12222 tree domain
= tsubst (TYPE_DOMAIN (t
), args
, complain
, in_decl
);
12223 if (domain
== error_mark_node
)
12224 return error_mark_node
;
12226 /* As an optimization, we avoid regenerating the array type if
12227 it will obviously be the same as T. */
12228 if (type
== TREE_TYPE (t
) && domain
== TYPE_DOMAIN (t
))
12231 /* These checks should match the ones in create_array_type_for_decl.
12235 The deduction may fail for any of the following reasons:
12237 -- Attempting to create an array with an element type that
12238 is void, a function type, or a reference type, or [DR337]
12239 an abstract class type. */
12240 if (VOID_TYPE_P (type
)
12241 || TREE_CODE (type
) == FUNCTION_TYPE
12242 || (TREE_CODE (type
) == ARRAY_TYPE
12243 && TYPE_DOMAIN (type
) == NULL_TREE
)
12244 || TREE_CODE (type
) == REFERENCE_TYPE
)
12246 if (complain
& tf_error
)
12247 error ("creating array of %qT", type
);
12248 return error_mark_node
;
12251 if (abstract_virtuals_error_sfinae (ACU_ARRAY
, type
, complain
))
12252 return error_mark_node
;
12254 r
= build_cplus_array_type (type
, domain
);
12256 if (TYPE_USER_ALIGN (t
))
12258 TYPE_ALIGN (r
) = TYPE_ALIGN (t
);
12259 TYPE_USER_ALIGN (r
) = 1;
12265 case TYPENAME_TYPE
:
12267 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
12268 in_decl
, /*entering_scope=*/1);
12269 tree f
= tsubst_copy (TYPENAME_TYPE_FULLNAME (t
), args
,
12270 complain
, in_decl
);
12272 if (ctx
== error_mark_node
|| f
== error_mark_node
)
12273 return error_mark_node
;
12275 if (!MAYBE_CLASS_TYPE_P (ctx
))
12277 if (complain
& tf_error
)
12278 error ("%qT is not a class, struct, or union type", ctx
);
12279 return error_mark_node
;
12281 else if (!uses_template_parms (ctx
) && !TYPE_BEING_DEFINED (ctx
))
12283 /* Normally, make_typename_type does not require that the CTX
12284 have complete type in order to allow things like:
12286 template <class T> struct S { typename S<T>::X Y; };
12288 But, such constructs have already been resolved by this
12289 point, so here CTX really should have complete type, unless
12290 it's a partial instantiation. */
12291 ctx
= complete_type (ctx
);
12292 if (!COMPLETE_TYPE_P (ctx
))
12294 if (complain
& tf_error
)
12295 cxx_incomplete_type_error (NULL_TREE
, ctx
);
12296 return error_mark_node
;
12300 f
= make_typename_type (ctx
, f
, typename_type
,
12301 complain
| tf_keep_type_decl
);
12302 if (f
== error_mark_node
)
12304 if (TREE_CODE (f
) == TYPE_DECL
)
12306 complain
|= tf_ignore_bad_quals
;
12310 if (TREE_CODE (f
) != TYPENAME_TYPE
)
12312 if (TYPENAME_IS_ENUM_P (t
) && TREE_CODE (f
) != ENUMERAL_TYPE
)
12314 if (complain
& tf_error
)
12315 error ("%qT resolves to %qT, which is not an enumeration type",
12318 return error_mark_node
;
12320 else if (TYPENAME_IS_CLASS_P (t
) && !CLASS_TYPE_P (f
))
12322 if (complain
& tf_error
)
12323 error ("%qT resolves to %qT, which is is not a class type",
12326 return error_mark_node
;
12330 return cp_build_qualified_type_real
12331 (f
, cp_type_quals (f
) | cp_type_quals (t
), complain
);
12334 case UNBOUND_CLASS_TEMPLATE
:
12336 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
12337 in_decl
, /*entering_scope=*/1);
12338 tree name
= TYPE_IDENTIFIER (t
);
12339 tree parm_list
= DECL_TEMPLATE_PARMS (TYPE_NAME (t
));
12341 if (ctx
== error_mark_node
|| name
== error_mark_node
)
12342 return error_mark_node
;
12345 parm_list
= tsubst_template_parms (parm_list
, args
, complain
);
12346 return make_unbound_class_template (ctx
, name
, parm_list
, complain
);
12353 ++cp_unevaluated_operand
;
12354 ++c_inhibit_evaluation_warnings
;
12356 type
= tsubst_expr (TYPEOF_TYPE_EXPR (t
), args
,
12358 /*integral_constant_expression_p=*/false);
12360 --cp_unevaluated_operand
;
12361 --c_inhibit_evaluation_warnings
;
12363 type
= finish_typeof (type
);
12364 return cp_build_qualified_type_real (type
,
12366 | cp_type_quals (type
),
12370 case DECLTYPE_TYPE
:
12374 ++cp_unevaluated_operand
;
12375 ++c_inhibit_evaluation_warnings
;
12377 type
= tsubst_copy_and_build (DECLTYPE_TYPE_EXPR (t
), args
,
12378 complain
|tf_decltype
, in_decl
,
12379 /*function_p*/false,
12380 /*integral_constant_expression*/false);
12382 --cp_unevaluated_operand
;
12383 --c_inhibit_evaluation_warnings
;
12385 if (DECLTYPE_FOR_LAMBDA_CAPTURE (t
))
12386 type
= lambda_capture_field_type (type
,
12387 DECLTYPE_FOR_INIT_CAPTURE (t
));
12388 else if (DECLTYPE_FOR_LAMBDA_PROXY (t
))
12389 type
= lambda_proxy_type (type
);
12392 bool id
= DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t
);
12393 if (id
&& TREE_CODE (DECLTYPE_TYPE_EXPR (t
)) == BIT_NOT_EXPR
12395 /* In a template ~id could be either a complement expression
12396 or an unqualified-id naming a destructor; if instantiating
12397 it produces an expression, it's not an id-expression or
12400 type
= finish_decltype_type (type
, id
, complain
);
12402 return cp_build_qualified_type_real (type
,
12404 | cp_type_quals (type
),
12408 case UNDERLYING_TYPE
:
12410 tree type
= tsubst (UNDERLYING_TYPE_TYPE (t
), args
,
12411 complain
, in_decl
);
12412 return finish_underlying_type (type
);
12415 case TYPE_ARGUMENT_PACK
:
12416 case NONTYPE_ARGUMENT_PACK
:
12418 tree r
= TYPE_P (t
) ? cxx_make_type (code
) : make_node (code
);
12420 tsubst_template_args (ARGUMENT_PACK_ARGS (t
),
12424 SET_ARGUMENT_PACK_ARGS (r
, packed_out
);
12426 /* For template nontype argument packs, also substitute into
12428 if (code
== NONTYPE_ARGUMENT_PACK
)
12429 TREE_TYPE (r
) = tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12448 /* We should use one of the expression tsubsts for these codes. */
12449 gcc_unreachable ();
12452 sorry ("use of %qs in template", get_tree_code_name (code
));
12453 return error_mark_node
;
12457 /* Like tsubst_expr for a BASELINK. OBJECT_TYPE, if non-NULL, is the
12458 type of the expression on the left-hand side of the "." or "->"
12462 tsubst_baselink (tree baselink
, tree object_type
,
12463 tree args
, tsubst_flags_t complain
, tree in_decl
)
12466 tree qualifying_scope
;
12469 tree template_args
= 0;
12470 bool template_id_p
= false;
12471 bool qualified
= BASELINK_QUALIFIED_P (baselink
);
12473 /* A baselink indicates a function from a base class. Both the
12474 BASELINK_ACCESS_BINFO and the base class referenced may
12475 indicate bases of the template class, rather than the
12476 instantiated class. In addition, lookups that were not
12477 ambiguous before may be ambiguous now. Therefore, we perform
12478 the lookup again. */
12479 qualifying_scope
= BINFO_TYPE (BASELINK_ACCESS_BINFO (baselink
));
12480 qualifying_scope
= tsubst (qualifying_scope
, args
,
12481 complain
, in_decl
);
12482 fns
= BASELINK_FUNCTIONS (baselink
);
12483 optype
= tsubst (BASELINK_OPTYPE (baselink
), args
, complain
, in_decl
);
12484 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
12486 template_id_p
= true;
12487 template_args
= TREE_OPERAND (fns
, 1);
12488 fns
= TREE_OPERAND (fns
, 0);
12490 template_args
= tsubst_template_args (template_args
, args
,
12491 complain
, in_decl
);
12493 name
= DECL_NAME (get_first_fn (fns
));
12494 if (IDENTIFIER_TYPENAME_P (name
))
12495 name
= mangle_conv_op_name_for_type (optype
);
12496 baselink
= lookup_fnfields (qualifying_scope
, name
, /*protect=*/1);
12498 return error_mark_node
;
12500 /* If lookup found a single function, mark it as used at this
12501 point. (If it lookup found multiple functions the one selected
12502 later by overload resolution will be marked as used at that
12504 if (BASELINK_P (baselink
))
12505 fns
= BASELINK_FUNCTIONS (baselink
);
12506 if (!template_id_p
&& !really_overloaded_fn (fns
))
12507 mark_used (OVL_CURRENT (fns
));
12509 /* Add back the template arguments, if present. */
12510 if (BASELINK_P (baselink
) && template_id_p
)
12511 BASELINK_FUNCTIONS (baselink
)
12512 = build_nt (TEMPLATE_ID_EXPR
,
12513 BASELINK_FUNCTIONS (baselink
),
12515 /* Update the conversion operator type. */
12516 BASELINK_OPTYPE (baselink
) = optype
;
12519 object_type
= current_class_type
;
12522 baselink
= adjust_result_of_qualified_name_lookup (baselink
,
12528 /* Like tsubst_expr for a SCOPE_REF, given by QUALIFIED_ID. DONE is
12529 true if the qualified-id will be a postfix-expression in-and-of
12530 itself; false if more of the postfix-expression follows the
12531 QUALIFIED_ID. ADDRESS_P is true if the qualified-id is the operand
12535 tsubst_qualified_id (tree qualified_id
, tree args
,
12536 tsubst_flags_t complain
, tree in_decl
,
12537 bool done
, bool address_p
)
12543 tree template_args
;
12544 location_t loc
= UNKNOWN_LOCATION
;
12546 gcc_assert (TREE_CODE (qualified_id
) == SCOPE_REF
);
12548 /* Figure out what name to look up. */
12549 name
= TREE_OPERAND (qualified_id
, 1);
12550 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
12552 is_template
= true;
12553 loc
= EXPR_LOCATION (name
);
12554 template_args
= TREE_OPERAND (name
, 1);
12556 template_args
= tsubst_template_args (template_args
, args
,
12557 complain
, in_decl
);
12558 name
= TREE_OPERAND (name
, 0);
12562 is_template
= false;
12563 template_args
= NULL_TREE
;
12566 /* Substitute into the qualifying scope. When there are no ARGS, we
12567 are just trying to simplify a non-dependent expression. In that
12568 case the qualifying scope may be dependent, and, in any case,
12569 substituting will not help. */
12570 scope
= TREE_OPERAND (qualified_id
, 0);
12573 scope
= tsubst (scope
, args
, complain
, in_decl
);
12574 expr
= tsubst_copy (name
, args
, complain
, in_decl
);
12579 if (dependent_scope_p (scope
))
12582 expr
= build_min_nt_loc (loc
, TEMPLATE_ID_EXPR
, expr
, template_args
);
12583 return build_qualified_name (NULL_TREE
, scope
, expr
,
12584 QUALIFIED_NAME_IS_TEMPLATE (qualified_id
));
12587 if (!BASELINK_P (name
) && !DECL_P (expr
))
12589 if (TREE_CODE (expr
) == BIT_NOT_EXPR
)
12591 /* A BIT_NOT_EXPR is used to represent a destructor. */
12592 if (!check_dtor_name (scope
, TREE_OPERAND (expr
, 0)))
12594 error ("qualifying type %qT does not match destructor name ~%qT",
12595 scope
, TREE_OPERAND (expr
, 0));
12596 expr
= error_mark_node
;
12599 expr
= lookup_qualified_name (scope
, complete_dtor_identifier
,
12600 /*is_type_p=*/0, false);
12603 expr
= lookup_qualified_name (scope
, expr
, /*is_type_p=*/0, false);
12604 if (TREE_CODE (TREE_CODE (expr
) == TEMPLATE_DECL
12605 ? DECL_TEMPLATE_RESULT (expr
) : expr
) == TYPE_DECL
)
12607 if (complain
& tf_error
)
12609 error ("dependent-name %qE is parsed as a non-type, but "
12610 "instantiation yields a type", qualified_id
);
12611 inform (input_location
, "say %<typename %E%> if a type is meant", qualified_id
);
12613 return error_mark_node
;
12619 check_accessibility_of_qualified_id (expr
, /*object_type=*/NULL_TREE
,
12621 /* Remember that there was a reference to this entity. */
12625 if (expr
== error_mark_node
|| TREE_CODE (expr
) == TREE_LIST
)
12627 if (complain
& tf_error
)
12628 qualified_name_lookup_error (scope
,
12629 TREE_OPERAND (qualified_id
, 1),
12630 expr
, input_location
);
12631 return error_mark_node
;
12635 expr
= lookup_template_function (expr
, template_args
);
12637 if (expr
== error_mark_node
&& complain
& tf_error
)
12638 qualified_name_lookup_error (scope
, TREE_OPERAND (qualified_id
, 1),
12639 expr
, input_location
);
12640 else if (TYPE_P (scope
))
12642 expr
= (adjust_result_of_qualified_name_lookup
12643 (expr
, scope
, current_nonlambda_class_type ()));
12644 expr
= (finish_qualified_id_expr
12645 (scope
, expr
, done
, address_p
&& PTRMEM_OK_P (qualified_id
),
12646 QUALIFIED_NAME_IS_TEMPLATE (qualified_id
),
12647 /*template_arg_p=*/false, complain
));
12650 /* Expressions do not generally have reference type. */
12651 if (TREE_CODE (expr
) != SCOPE_REF
12652 /* However, if we're about to form a pointer-to-member, we just
12653 want the referenced member referenced. */
12654 && TREE_CODE (expr
) != OFFSET_REF
)
12655 expr
= convert_from_reference (expr
);
12660 /* tsubst the initializer for a VAR_DECL. INIT is the unsubstituted
12661 initializer, DECL is the substituted VAR_DECL. Other arguments are as
12665 tsubst_init (tree init
, tree decl
, tree args
,
12666 tsubst_flags_t complain
, tree in_decl
)
12671 init
= tsubst_expr (init
, args
, complain
, in_decl
, false);
12675 /* If we had an initializer but it
12676 instantiated to nothing,
12677 value-initialize the object. This will
12678 only occur when the initializer was a
12679 pack expansion where the parameter packs
12680 used in that expansion were of length
12682 init
= build_value_init (TREE_TYPE (decl
),
12684 if (TREE_CODE (init
) == AGGR_INIT_EXPR
)
12685 init
= get_target_expr_sfinae (init
, complain
);
12691 /* Like tsubst, but deals with expressions. This function just replaces
12692 template parms; to finish processing the resultant expression, use
12693 tsubst_copy_and_build or tsubst_expr. */
12696 tsubst_copy (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
12698 enum tree_code code
;
12701 if (t
== NULL_TREE
|| t
== error_mark_node
|| args
== NULL_TREE
)
12704 code
= TREE_CODE (t
);
12709 r
= retrieve_local_specialization (t
);
12711 if (r
== NULL_TREE
)
12713 /* We get here for a use of 'this' in an NSDMI. */
12714 if (DECL_NAME (t
) == this_identifier
12715 && current_function_decl
12716 && DECL_CONSTRUCTOR_P (current_function_decl
))
12717 return current_class_ptr
;
12719 /* This can happen for a parameter name used later in a function
12720 declaration (such as in a late-specified return type). Just
12721 make a dummy decl, since it's only used for its type. */
12722 gcc_assert (cp_unevaluated_operand
!= 0);
12723 r
= tsubst_decl (t
, args
, complain
);
12724 /* Give it the template pattern as its context; its true context
12725 hasn't been instantiated yet and this is good enough for
12727 DECL_CONTEXT (r
) = DECL_CONTEXT (t
);
12730 if (TREE_CODE (r
) == ARGUMENT_PACK_SELECT
)
12731 r
= ARGUMENT_PACK_SELECT_ARG (r
);
12740 if (DECL_TEMPLATE_PARM_P (t
))
12741 return tsubst_copy (DECL_INITIAL (t
), args
, complain
, in_decl
);
12742 /* There is no need to substitute into namespace-scope
12744 if (DECL_NAMESPACE_SCOPE_P (t
))
12746 /* If ARGS is NULL, then T is known to be non-dependent. */
12747 if (args
== NULL_TREE
)
12748 return integral_constant_value (t
);
12750 /* Unfortunately, we cannot just call lookup_name here.
12753 template <int I> int f() {
12755 struct S { void g() { E e = a; } };
12758 When we instantiate f<7>::S::g(), say, lookup_name is not
12759 clever enough to find f<7>::a. */
12761 = tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
12762 /*entering_scope=*/0);
12764 for (v
= TYPE_VALUES (enum_type
);
12766 v
= TREE_CHAIN (v
))
12767 if (TREE_PURPOSE (v
) == DECL_NAME (t
))
12768 return TREE_VALUE (v
);
12770 /* We didn't find the name. That should never happen; if
12771 name-lookup found it during preliminary parsing, we
12772 should find it again here during instantiation. */
12773 gcc_unreachable ();
12778 if (PACK_EXPANSION_P (TREE_TYPE (t
)))
12780 /* Check for a local specialization set up by
12781 tsubst_pack_expansion. */
12782 if (tree r
= retrieve_local_specialization (t
))
12784 if (TREE_CODE (r
) == ARGUMENT_PACK_SELECT
)
12785 r
= ARGUMENT_PACK_SELECT_ARG (r
);
12789 /* When retrieving a capture pack from a generic lambda, remove the
12790 lambda call op's own template argument list from ARGS. Only the
12791 template arguments active for the closure type should be used to
12792 retrieve the pack specialization. */
12793 if (LAMBDA_FUNCTION_P (current_function_decl
)
12794 && (template_class_depth (DECL_CONTEXT (t
))
12795 != TMPL_ARGS_DEPTH (args
)))
12796 args
= strip_innermost_template_args (args
, 1);
12798 /* Otherwise return the full NONTYPE_ARGUMENT_PACK that
12799 tsubst_decl put in the hash table. */
12800 return retrieve_specialization (t
, args
, 0);
12803 if (DECL_CONTEXT (t
))
12807 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
12808 /*entering_scope=*/1);
12809 if (ctx
!= DECL_CONTEXT (t
))
12811 tree r
= lookup_field (ctx
, DECL_NAME (t
), 0, false);
12814 if (complain
& tf_error
)
12815 error ("using invalid field %qD", t
);
12816 return error_mark_node
;
12825 case FUNCTION_DECL
:
12826 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
))
12827 r
= tsubst (t
, args
, complain
, in_decl
);
12828 else if (local_variable_p (t
))
12830 r
= retrieve_local_specialization (t
);
12831 if (r
== NULL_TREE
)
12833 /* First try name lookup to find the instantiation. */
12834 r
= lookup_name (DECL_NAME (t
));
12837 /* Make sure that the one we found is the one we want. */
12838 tree ctx
= tsubst (DECL_CONTEXT (t
), args
,
12839 complain
, in_decl
);
12840 if (ctx
!= DECL_CONTEXT (r
))
12848 /* This can happen for a variable used in a
12849 late-specified return type of a local lambda, or for a
12850 local static or constant. Building a new VAR_DECL
12851 should be OK in all those cases. */
12852 r
= tsubst_decl (t
, args
, complain
);
12853 if (decl_maybe_constant_var_p (r
))
12855 /* We can't call cp_finish_decl, so handle the
12856 initializer by hand. */
12857 tree init
= tsubst_init (DECL_INITIAL (t
), r
, args
,
12858 complain
, in_decl
);
12859 if (!processing_template_decl
)
12860 init
= maybe_constant_init (init
);
12861 if (processing_template_decl
12862 ? potential_constant_expression (init
)
12863 : reduced_constant_expression_p (init
))
12864 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r
)
12865 = TREE_CONSTANT (r
) = true;
12866 DECL_INITIAL (r
) = init
;
12868 gcc_assert (cp_unevaluated_operand
|| TREE_STATIC (r
)
12869 || decl_constant_var_p (r
)
12870 || errorcount
|| sorrycount
);
12871 if (!processing_template_decl
)
12873 if (TREE_STATIC (r
))
12874 rest_of_decl_compilation (r
, toplevel_bindings_p (),
12876 else if (decl_constant_var_p (r
))
12877 /* A use of a local constant decays to its value.
12878 FIXME update for core DR 696. */
12879 r
= integral_constant_value (r
);
12882 /* Remember this for subsequent uses. */
12883 if (local_specializations
)
12884 register_local_specialization (r
, t
);
12892 case NAMESPACE_DECL
:
12896 /* An OVERLOAD will always be a non-dependent overload set; an
12897 overload set from function scope will just be represented with an
12898 IDENTIFIER_NODE, and from class scope with a BASELINK. */
12899 gcc_assert (!uses_template_parms (t
));
12903 return tsubst_baselink (t
, current_nonlambda_class_type (),
12904 args
, complain
, in_decl
);
12906 case TEMPLATE_DECL
:
12907 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
12908 return tsubst (TREE_TYPE (DECL_TEMPLATE_RESULT (t
)),
12909 args
, complain
, in_decl
);
12910 else if (DECL_FUNCTION_TEMPLATE_P (t
) && DECL_MEMBER_TEMPLATE_P (t
))
12911 return tsubst (t
, args
, complain
, in_decl
);
12912 else if (DECL_CLASS_SCOPE_P (t
)
12913 && uses_template_parms (DECL_CONTEXT (t
)))
12915 /* Template template argument like the following example need
12918 template <template <class> class TT> struct C {};
12919 template <class T> struct D {
12920 template <class U> struct E {};
12925 We are processing the template argument `E' in #1 for
12926 the template instantiation #2. Originally, `E' is a
12927 TEMPLATE_DECL with `D<T>' as its DECL_CONTEXT. Now we
12928 have to substitute this with one having context `D<int>'. */
12930 tree context
= tsubst (DECL_CONTEXT (t
), args
, complain
, in_decl
);
12931 return lookup_field (context
, DECL_NAME(t
), 0, false);
12934 /* Ordinary template template argument. */
12938 case REINTERPRET_CAST_EXPR
:
12939 case CONST_CAST_EXPR
:
12940 case STATIC_CAST_EXPR
:
12941 case DYNAMIC_CAST_EXPR
:
12942 case IMPLICIT_CONV_EXPR
:
12946 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12947 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
12948 return build1 (code
, type
, op0
);
12952 if (PACK_EXPANSION_P (TREE_OPERAND (t
, 0)))
12955 tree expanded
, op
= TREE_OPERAND (t
, 0);
12958 if (SIZEOF_EXPR_TYPE_P (t
))
12959 op
= TREE_TYPE (op
);
12961 ++cp_unevaluated_operand
;
12962 ++c_inhibit_evaluation_warnings
;
12963 /* We only want to compute the number of arguments. */
12964 expanded
= tsubst_pack_expansion (op
, args
, complain
, in_decl
);
12965 --cp_unevaluated_operand
;
12966 --c_inhibit_evaluation_warnings
;
12968 if (TREE_CODE (expanded
) == TREE_VEC
)
12969 len
= TREE_VEC_LENGTH (expanded
);
12971 if (expanded
== error_mark_node
)
12972 return error_mark_node
;
12973 else if (PACK_EXPANSION_P (expanded
)
12974 || (TREE_CODE (expanded
) == TREE_VEC
12976 && PACK_EXPANSION_P (TREE_VEC_ELT (expanded
, len
-1))))
12978 if (TREE_CODE (expanded
) == TREE_VEC
)
12979 expanded
= TREE_VEC_ELT (expanded
, len
- 1);
12981 if (TYPE_P (expanded
))
12982 return cxx_sizeof_or_alignof_type (expanded
, SIZEOF_EXPR
,
12983 complain
& tf_error
);
12985 return cxx_sizeof_or_alignof_expr (expanded
, SIZEOF_EXPR
,
12986 complain
& tf_error
);
12989 return build_int_cst (size_type_node
, len
);
12991 if (SIZEOF_EXPR_TYPE_P (t
))
12993 r
= tsubst (TREE_TYPE (TREE_OPERAND (t
, 0)),
12994 args
, complain
, in_decl
);
12995 r
= build1 (NOP_EXPR
, r
, error_mark_node
);
12996 r
= build1 (SIZEOF_EXPR
,
12997 tsubst (TREE_TYPE (t
), args
, complain
, in_decl
), r
);
12998 SIZEOF_EXPR_TYPE_P (r
) = 1;
13005 case TRUTH_NOT_EXPR
:
13008 case UNARY_PLUS_EXPR
: /* Unary + */
13010 case AT_ENCODE_EXPR
:
13014 case REALPART_EXPR
:
13015 case IMAGPART_EXPR
:
13018 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13019 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13020 return build1 (code
, type
, op0
);
13023 case COMPONENT_REF
:
13028 object
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13029 name
= TREE_OPERAND (t
, 1);
13030 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
13032 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
13033 complain
, in_decl
);
13034 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
13036 else if (TREE_CODE (name
) == SCOPE_REF
13037 && TREE_CODE (TREE_OPERAND (name
, 1)) == BIT_NOT_EXPR
)
13039 tree base
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
13040 complain
, in_decl
);
13041 name
= TREE_OPERAND (name
, 1);
13042 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
13043 complain
, in_decl
);
13044 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
13045 name
= build_qualified_name (/*type=*/NULL_TREE
,
13047 /*template_p=*/false);
13049 else if (BASELINK_P (name
))
13050 name
= tsubst_baselink (name
,
13051 non_reference (TREE_TYPE (object
)),
13055 name
= tsubst_copy (name
, args
, complain
, in_decl
);
13056 return build_nt (COMPONENT_REF
, object
, name
, NULL_TREE
);
13062 case TRUNC_DIV_EXPR
:
13063 case CEIL_DIV_EXPR
:
13064 case FLOOR_DIV_EXPR
:
13065 case ROUND_DIV_EXPR
:
13066 case EXACT_DIV_EXPR
:
13070 case TRUNC_MOD_EXPR
:
13071 case FLOOR_MOD_EXPR
:
13072 case TRUTH_ANDIF_EXPR
:
13073 case TRUTH_ORIF_EXPR
:
13074 case TRUTH_AND_EXPR
:
13075 case TRUTH_OR_EXPR
:
13088 case COMPOUND_EXPR
:
13091 case PREDECREMENT_EXPR
:
13092 case PREINCREMENT_EXPR
:
13093 case POSTDECREMENT_EXPR
:
13094 case POSTINCREMENT_EXPR
:
13096 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13097 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
13098 return build_nt (code
, op0
, op1
);
13103 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13104 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
13105 return build_qualified_name (/*type=*/NULL_TREE
, op0
, op1
,
13106 QUALIFIED_NAME_IS_TEMPLATE (t
));
13111 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13112 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
13113 return build_nt (ARRAY_REF
, op0
, op1
, NULL_TREE
, NULL_TREE
);
13118 int n
= VL_EXP_OPERAND_LENGTH (t
);
13119 tree result
= build_vl_exp (CALL_EXPR
, n
);
13121 for (i
= 0; i
< n
; i
++)
13122 TREE_OPERAND (t
, i
) = tsubst_copy (TREE_OPERAND (t
, i
), args
,
13123 complain
, in_decl
);
13129 case PSEUDO_DTOR_EXPR
:
13130 case VEC_PERM_EXPR
:
13132 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13133 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
13134 tree op2
= tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
13135 r
= build_nt (code
, op0
, op1
, op2
);
13136 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
13142 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13143 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
13144 tree op2
= tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
13145 r
= build_nt (code
, op0
, op1
, op2
);
13146 NEW_EXPR_USE_GLOBAL (r
) = NEW_EXPR_USE_GLOBAL (t
);
13152 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13153 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
13154 r
= build_nt (code
, op0
, op1
);
13155 DELETE_EXPR_USE_GLOBAL (r
) = DELETE_EXPR_USE_GLOBAL (t
);
13156 DELETE_EXPR_USE_VEC (r
) = DELETE_EXPR_USE_VEC (t
);
13160 case TEMPLATE_ID_EXPR
:
13162 /* Substituted template arguments */
13163 tree fn
= TREE_OPERAND (t
, 0);
13164 tree targs
= TREE_OPERAND (t
, 1);
13166 fn
= tsubst_copy (fn
, args
, complain
, in_decl
);
13168 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
13170 return lookup_template_function (fn
, targs
);
13175 tree purpose
, value
, chain
;
13177 if (t
== void_list_node
)
13180 purpose
= TREE_PURPOSE (t
);
13182 purpose
= tsubst_copy (purpose
, args
, complain
, in_decl
);
13183 value
= TREE_VALUE (t
);
13185 value
= tsubst_copy (value
, args
, complain
, in_decl
);
13186 chain
= TREE_CHAIN (t
);
13187 if (chain
&& chain
!= void_type_node
)
13188 chain
= tsubst_copy (chain
, args
, complain
, in_decl
);
13189 if (purpose
== TREE_PURPOSE (t
)
13190 && value
== TREE_VALUE (t
)
13191 && chain
== TREE_CHAIN (t
))
13193 return tree_cons (purpose
, value
, chain
);
13198 case ENUMERAL_TYPE
:
13200 case TEMPLATE_TYPE_PARM
:
13201 case TEMPLATE_TEMPLATE_PARM
:
13202 case BOUND_TEMPLATE_TEMPLATE_PARM
:
13203 case TEMPLATE_PARM_INDEX
:
13205 case REFERENCE_TYPE
:
13207 case FUNCTION_TYPE
:
13210 case TYPENAME_TYPE
:
13211 case UNBOUND_CLASS_TEMPLATE
:
13213 case DECLTYPE_TYPE
:
13215 return tsubst (t
, args
, complain
, in_decl
);
13219 /* Fall through. */
13220 case IDENTIFIER_NODE
:
13221 if (IDENTIFIER_TYPENAME_P (t
))
13223 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13224 return mangle_conv_op_name_for_type (new_type
);
13230 /* This is handled by tsubst_copy_and_build. */
13231 gcc_unreachable ();
13235 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13236 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13237 return build_x_va_arg (EXPR_LOCATION (t
), op0
, type
);
13240 case CLEANUP_POINT_EXPR
:
13241 /* We shouldn't have built any of these during initial template
13242 generation. Instead, they should be built during instantiation
13243 in response to the saved STMT_IS_FULL_EXPR_P setting. */
13244 gcc_unreachable ();
13248 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13249 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13250 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
13251 r
= build2 (code
, type
, op0
, op1
);
13252 PTRMEM_OK_P (r
) = PTRMEM_OK_P (t
);
13253 mark_used (TREE_OPERAND (r
, 1));
13257 case EXPR_PACK_EXPANSION
:
13258 error ("invalid use of pack expansion expression");
13259 return error_mark_node
;
13261 case NONTYPE_ARGUMENT_PACK
:
13262 error ("use %<...%> to expand argument pack");
13263 return error_mark_node
;
13266 gcc_checking_assert (t
== void_node
&& VOID_TYPE_P (TREE_TYPE (t
)));
13274 /* Instantiate any typedefs in the type. */
13275 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13276 r
= fold_convert (type
, t
);
13277 gcc_assert (TREE_CODE (r
) == code
);
13282 /* These can sometimes show up in a partial instantiation, but never
13283 involve template parms. */
13284 gcc_assert (!uses_template_parms (t
));
13288 /* We shouldn't get here, but keep going if !ENABLE_CHECKING. */
13289 gcc_checking_assert (false);
13294 /* Like tsubst_copy, but specifically for OpenMP clauses. */
13297 tsubst_omp_clauses (tree clauses
, bool declare_simd
,
13298 tree args
, tsubst_flags_t complain
, tree in_decl
)
13300 tree new_clauses
= NULL
, nc
, oc
;
13302 for (oc
= clauses
; oc
; oc
= OMP_CLAUSE_CHAIN (oc
))
13304 nc
= copy_node (oc
);
13305 OMP_CLAUSE_CHAIN (nc
) = new_clauses
;
13308 switch (OMP_CLAUSE_CODE (nc
))
13310 case OMP_CLAUSE_LASTPRIVATE
:
13311 if (OMP_CLAUSE_LASTPRIVATE_STMT (oc
))
13313 OMP_CLAUSE_LASTPRIVATE_STMT (nc
) = push_stmt_list ();
13314 tsubst_expr (OMP_CLAUSE_LASTPRIVATE_STMT (oc
), args
, complain
,
13315 in_decl
, /*integral_constant_expression_p=*/false);
13316 OMP_CLAUSE_LASTPRIVATE_STMT (nc
)
13317 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (nc
));
13320 case OMP_CLAUSE_PRIVATE
:
13321 case OMP_CLAUSE_SHARED
:
13322 case OMP_CLAUSE_FIRSTPRIVATE
:
13323 case OMP_CLAUSE_COPYIN
:
13324 case OMP_CLAUSE_COPYPRIVATE
:
13325 case OMP_CLAUSE_IF
:
13326 case OMP_CLAUSE_NUM_THREADS
:
13327 case OMP_CLAUSE_SCHEDULE
:
13328 case OMP_CLAUSE_COLLAPSE
:
13329 case OMP_CLAUSE_FINAL
:
13330 case OMP_CLAUSE_DEPEND
:
13331 case OMP_CLAUSE_FROM
:
13332 case OMP_CLAUSE_TO
:
13333 case OMP_CLAUSE_UNIFORM
:
13334 case OMP_CLAUSE_MAP
:
13335 case OMP_CLAUSE_DEVICE
:
13336 case OMP_CLAUSE_DIST_SCHEDULE
:
13337 case OMP_CLAUSE_NUM_TEAMS
:
13338 case OMP_CLAUSE_THREAD_LIMIT
:
13339 case OMP_CLAUSE_SAFELEN
:
13340 case OMP_CLAUSE_SIMDLEN
:
13341 OMP_CLAUSE_OPERAND (nc
, 0)
13342 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 0), args
, complain
,
13343 in_decl
, /*integral_constant_expression_p=*/false);
13345 case OMP_CLAUSE_REDUCTION
:
13346 if (OMP_CLAUSE_REDUCTION_PLACEHOLDER (oc
))
13348 tree placeholder
= OMP_CLAUSE_REDUCTION_PLACEHOLDER (oc
);
13349 if (TREE_CODE (placeholder
) == SCOPE_REF
)
13351 tree scope
= tsubst (TREE_OPERAND (placeholder
, 0), args
,
13352 complain
, in_decl
);
13353 OMP_CLAUSE_REDUCTION_PLACEHOLDER (nc
)
13354 = build_qualified_name (NULL_TREE
, scope
,
13355 TREE_OPERAND (placeholder
, 1),
13359 gcc_assert (identifier_p (placeholder
));
13361 OMP_CLAUSE_OPERAND (nc
, 0)
13362 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 0), args
, complain
,
13363 in_decl
, /*integral_constant_expression_p=*/false);
13365 case OMP_CLAUSE_LINEAR
:
13366 case OMP_CLAUSE_ALIGNED
:
13367 OMP_CLAUSE_OPERAND (nc
, 0)
13368 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 0), args
, complain
,
13369 in_decl
, /*integral_constant_expression_p=*/false);
13370 OMP_CLAUSE_OPERAND (nc
, 1)
13371 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 1), args
, complain
,
13372 in_decl
, /*integral_constant_expression_p=*/false);
13375 case OMP_CLAUSE_NOWAIT
:
13376 case OMP_CLAUSE_ORDERED
:
13377 case OMP_CLAUSE_DEFAULT
:
13378 case OMP_CLAUSE_UNTIED
:
13379 case OMP_CLAUSE_MERGEABLE
:
13380 case OMP_CLAUSE_INBRANCH
:
13381 case OMP_CLAUSE_NOTINBRANCH
:
13382 case OMP_CLAUSE_PROC_BIND
:
13383 case OMP_CLAUSE_FOR
:
13384 case OMP_CLAUSE_PARALLEL
:
13385 case OMP_CLAUSE_SECTIONS
:
13386 case OMP_CLAUSE_TASKGROUP
:
13389 gcc_unreachable ();
13393 new_clauses
= nreverse (new_clauses
);
13395 new_clauses
= finish_omp_clauses (new_clauses
);
13396 return new_clauses
;
13399 /* Like tsubst_copy_and_build, but unshare TREE_LIST nodes. */
13402 tsubst_copy_asm_operands (tree t
, tree args
, tsubst_flags_t complain
,
13405 #define RECUR(t) tsubst_copy_asm_operands (t, args, complain, in_decl)
13407 tree purpose
, value
, chain
;
13412 if (TREE_CODE (t
) != TREE_LIST
)
13413 return tsubst_copy_and_build (t
, args
, complain
, in_decl
,
13414 /*function_p=*/false,
13415 /*integral_constant_expression_p=*/false);
13417 if (t
== void_list_node
)
13420 purpose
= TREE_PURPOSE (t
);
13422 purpose
= RECUR (purpose
);
13423 value
= TREE_VALUE (t
);
13426 if (TREE_CODE (value
) != LABEL_DECL
)
13427 value
= RECUR (value
);
13430 value
= lookup_label (DECL_NAME (value
));
13431 gcc_assert (TREE_CODE (value
) == LABEL_DECL
);
13432 TREE_USED (value
) = 1;
13435 chain
= TREE_CHAIN (t
);
13436 if (chain
&& chain
!= void_type_node
)
13437 chain
= RECUR (chain
);
13438 return tree_cons (purpose
, value
, chain
);
13442 /* Substitute one OMP_FOR iterator. */
13445 tsubst_omp_for_iterator (tree t
, int i
, tree declv
, tree initv
,
13446 tree condv
, tree incrv
, tree
*clauses
,
13447 tree args
, tsubst_flags_t complain
, tree in_decl
,
13448 bool integral_constant_expression_p
)
13450 #define RECUR(NODE) \
13451 tsubst_expr ((NODE), args, complain, in_decl, \
13452 integral_constant_expression_p)
13453 tree decl
, init
, cond
, incr
;
13455 init
= TREE_VEC_ELT (OMP_FOR_INIT (t
), i
);
13456 gcc_assert (TREE_CODE (init
) == MODIFY_EXPR
);
13457 decl
= TREE_OPERAND (init
, 0);
13458 init
= TREE_OPERAND (init
, 1);
13459 tree decl_expr
= NULL_TREE
;
13460 if (init
&& TREE_CODE (init
) == DECL_EXPR
)
13462 /* We need to jump through some hoops to handle declarations in the
13463 for-init-statement, since we might need to handle auto deduction,
13464 but we need to keep control of initialization. */
13466 init
= DECL_INITIAL (DECL_EXPR_DECL (init
));
13467 decl
= tsubst_decl (decl
, args
, complain
);
13470 decl
= RECUR (decl
);
13471 init
= RECUR (init
);
13473 tree auto_node
= type_uses_auto (TREE_TYPE (decl
));
13474 if (auto_node
&& init
)
13476 = do_auto_deduction (TREE_TYPE (decl
), init
, auto_node
);
13478 gcc_assert (!type_dependent_expression_p (decl
));
13480 if (!CLASS_TYPE_P (TREE_TYPE (decl
)))
13484 /* Declare the variable, but don't let that initialize it. */
13485 tree init_sav
= DECL_INITIAL (DECL_EXPR_DECL (decl_expr
));
13486 DECL_INITIAL (DECL_EXPR_DECL (decl_expr
)) = NULL_TREE
;
13488 DECL_INITIAL (DECL_EXPR_DECL (decl_expr
)) = init_sav
;
13491 cond
= RECUR (TREE_VEC_ELT (OMP_FOR_COND (t
), i
));
13492 incr
= TREE_VEC_ELT (OMP_FOR_INCR (t
), i
);
13493 if (TREE_CODE (incr
) == MODIFY_EXPR
)
13495 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
13496 tree rhs
= RECUR (TREE_OPERAND (incr
, 1));
13497 incr
= build_x_modify_expr (EXPR_LOCATION (incr
), lhs
,
13498 NOP_EXPR
, rhs
, complain
);
13501 incr
= RECUR (incr
);
13502 TREE_VEC_ELT (declv
, i
) = decl
;
13503 TREE_VEC_ELT (initv
, i
) = init
;
13504 TREE_VEC_ELT (condv
, i
) = cond
;
13505 TREE_VEC_ELT (incrv
, i
) = incr
;
13511 /* Declare and initialize the variable. */
13518 for (c
= *clauses
; c
; c
= OMP_CLAUSE_CHAIN (c
))
13520 if ((OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_PRIVATE
13521 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_LASTPRIVATE
)
13522 && OMP_CLAUSE_DECL (c
) == decl
)
13524 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_FIRSTPRIVATE
13525 && OMP_CLAUSE_DECL (c
) == decl
)
13526 error ("iteration variable %qD should not be firstprivate", decl
);
13527 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
13528 && OMP_CLAUSE_DECL (c
) == decl
)
13529 error ("iteration variable %qD should not be reduction", decl
);
13533 c
= build_omp_clause (input_location
, OMP_CLAUSE_PRIVATE
);
13534 OMP_CLAUSE_DECL (c
) = decl
;
13535 c
= finish_omp_clauses (c
);
13538 OMP_CLAUSE_CHAIN (c
) = *clauses
;
13543 cond
= TREE_VEC_ELT (OMP_FOR_COND (t
), i
);
13544 if (COMPARISON_CLASS_P (cond
))
13546 tree op0
= RECUR (TREE_OPERAND (cond
, 0));
13547 tree op1
= RECUR (TREE_OPERAND (cond
, 1));
13548 cond
= build2 (TREE_CODE (cond
), boolean_type_node
, op0
, op1
);
13551 cond
= RECUR (cond
);
13552 incr
= TREE_VEC_ELT (OMP_FOR_INCR (t
), i
);
13553 switch (TREE_CODE (incr
))
13555 case PREINCREMENT_EXPR
:
13556 case PREDECREMENT_EXPR
:
13557 case POSTINCREMENT_EXPR
:
13558 case POSTDECREMENT_EXPR
:
13559 incr
= build2 (TREE_CODE (incr
), TREE_TYPE (decl
),
13560 RECUR (TREE_OPERAND (incr
, 0)), NULL_TREE
);
13563 if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
13564 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
13566 tree rhs
= TREE_OPERAND (incr
, 1);
13567 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
13568 tree rhs0
= RECUR (TREE_OPERAND (rhs
, 0));
13569 tree rhs1
= RECUR (TREE_OPERAND (rhs
, 1));
13570 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
13571 build2 (TREE_CODE (rhs
), TREE_TYPE (decl
),
13575 incr
= RECUR (incr
);
13578 if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
13579 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
13581 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
13582 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
13583 build2 (TREE_CODE (TREE_OPERAND (incr
, 1)),
13584 TREE_TYPE (decl
), lhs
,
13585 RECUR (TREE_OPERAND (incr
, 2))));
13587 else if (TREE_CODE (TREE_OPERAND (incr
, 1)) == NOP_EXPR
13588 && (TREE_CODE (TREE_OPERAND (incr
, 2)) == PLUS_EXPR
13589 || (TREE_CODE (TREE_OPERAND (incr
, 2)) == MINUS_EXPR
)))
13591 tree rhs
= TREE_OPERAND (incr
, 2);
13592 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
13593 tree rhs0
= RECUR (TREE_OPERAND (rhs
, 0));
13594 tree rhs1
= RECUR (TREE_OPERAND (rhs
, 1));
13595 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
13596 build2 (TREE_CODE (rhs
), TREE_TYPE (decl
),
13600 incr
= RECUR (incr
);
13603 incr
= RECUR (incr
);
13607 TREE_VEC_ELT (declv
, i
) = decl
;
13608 TREE_VEC_ELT (initv
, i
) = init
;
13609 TREE_VEC_ELT (condv
, i
) = cond
;
13610 TREE_VEC_ELT (incrv
, i
) = incr
;
13614 /* Like tsubst_copy for expressions, etc. but also does semantic
13618 tsubst_expr (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
,
13619 bool integral_constant_expression_p
)
13621 #define RETURN(EXP) do { r = (EXP); goto out; } while(0)
13622 #define RECUR(NODE) \
13623 tsubst_expr ((NODE), args, complain, in_decl, \
13624 integral_constant_expression_p)
13630 if (t
== NULL_TREE
|| t
== error_mark_node
)
13633 loc
= input_location
;
13634 if (EXPR_HAS_LOCATION (t
))
13635 input_location
= EXPR_LOCATION (t
);
13636 if (STATEMENT_CODE_P (TREE_CODE (t
)))
13637 current_stmt_tree ()->stmts_are_full_exprs_p
= STMT_IS_FULL_EXPR_P (t
);
13639 switch (TREE_CODE (t
))
13641 case STATEMENT_LIST
:
13643 tree_stmt_iterator i
;
13644 for (i
= tsi_start (t
); !tsi_end_p (i
); tsi_next (&i
))
13645 RECUR (tsi_stmt (i
));
13649 case CTOR_INITIALIZER
:
13650 finish_mem_initializers (tsubst_initializer_list
13651 (TREE_OPERAND (t
, 0), args
));
13655 finish_return_stmt (RECUR (TREE_OPERAND (t
, 0)));
13659 tmp
= RECUR (EXPR_STMT_EXPR (t
));
13660 if (EXPR_STMT_STMT_EXPR_RESULT (t
))
13661 finish_stmt_expr_expr (tmp
, cur_stmt_expr
);
13663 finish_expr_stmt (tmp
);
13667 do_using_directive (USING_STMT_NAMESPACE (t
));
13672 tree decl
, pattern_decl
;
13675 pattern_decl
= decl
= DECL_EXPR_DECL (t
);
13676 if (TREE_CODE (decl
) == LABEL_DECL
)
13677 finish_label_decl (DECL_NAME (decl
));
13678 else if (TREE_CODE (decl
) == USING_DECL
)
13680 tree scope
= USING_DECL_SCOPE (decl
);
13681 tree name
= DECL_NAME (decl
);
13684 scope
= tsubst (scope
, args
, complain
, in_decl
);
13685 decl
= lookup_qualified_name (scope
, name
,
13686 /*is_type_p=*/false,
13687 /*complain=*/false);
13688 if (decl
== error_mark_node
|| TREE_CODE (decl
) == TREE_LIST
)
13689 qualified_name_lookup_error (scope
, name
, decl
, input_location
);
13691 do_local_using_decl (decl
, scope
, name
);
13693 else if (DECL_PACK_P (decl
))
13695 /* Don't build up decls for a variadic capture proxy, we'll
13696 instantiate the elements directly as needed. */
13701 init
= DECL_INITIAL (decl
);
13702 decl
= tsubst (decl
, args
, complain
, in_decl
);
13703 if (decl
!= error_mark_node
)
13705 /* By marking the declaration as instantiated, we avoid
13706 trying to instantiate it. Since instantiate_decl can't
13707 handle local variables, and since we've already done
13708 all that needs to be done, that's the right thing to
13711 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
13713 && ANON_AGGR_TYPE_P (TREE_TYPE (decl
)))
13714 /* Anonymous aggregates are a special case. */
13715 finish_anon_union (decl
);
13716 else if (is_capture_proxy (DECL_EXPR_DECL (t
)))
13718 DECL_CONTEXT (decl
) = current_function_decl
;
13719 if (DECL_NAME (decl
) == this_identifier
)
13721 tree lam
= DECL_CONTEXT (current_function_decl
);
13722 lam
= CLASSTYPE_LAMBDA_EXPR (lam
);
13723 LAMBDA_EXPR_THIS_CAPTURE (lam
) = decl
;
13725 insert_capture_proxy (decl
);
13727 else if (DECL_IMPLICIT_TYPEDEF_P (t
))
13728 /* We already did a pushtag. */;
13729 else if (TREE_CODE (decl
) == FUNCTION_DECL
13730 && DECL_OMP_DECLARE_REDUCTION_P (decl
)
13731 && DECL_FUNCTION_SCOPE_P (pattern_decl
))
13733 DECL_CONTEXT (decl
) = NULL_TREE
;
13735 DECL_CONTEXT (decl
) = current_function_decl
;
13736 cp_check_omp_declare_reduction (decl
);
13740 int const_init
= false;
13741 maybe_push_decl (decl
);
13743 && DECL_PRETTY_FUNCTION_P (decl
))
13745 /* For __PRETTY_FUNCTION__ we have to adjust the
13747 const char *const name
13748 = cxx_printable_name (current_function_decl
, 2);
13749 init
= cp_fname_init (name
, &TREE_TYPE (decl
));
13752 init
= tsubst_init (init
, decl
, args
, complain
, in_decl
);
13755 const_init
= (DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P
13757 cp_finish_decl (decl
, init
, const_init
, NULL_TREE
, 0);
13766 stmt
= begin_for_stmt (NULL_TREE
, NULL_TREE
);
13767 RECUR (FOR_INIT_STMT (t
));
13768 finish_for_init_stmt (stmt
);
13769 tmp
= RECUR (FOR_COND (t
));
13770 finish_for_cond (tmp
, stmt
, false);
13771 tmp
= RECUR (FOR_EXPR (t
));
13772 finish_for_expr (tmp
, stmt
);
13773 RECUR (FOR_BODY (t
));
13774 finish_for_stmt (stmt
);
13777 case RANGE_FOR_STMT
:
13780 stmt
= begin_for_stmt (NULL_TREE
, NULL_TREE
);
13781 decl
= RANGE_FOR_DECL (t
);
13782 decl
= tsubst (decl
, args
, complain
, in_decl
);
13783 maybe_push_decl (decl
);
13784 expr
= RECUR (RANGE_FOR_EXPR (t
));
13785 stmt
= cp_convert_range_for (stmt
, decl
, expr
, RANGE_FOR_IVDEP (t
));
13786 RECUR (RANGE_FOR_BODY (t
));
13787 finish_for_stmt (stmt
);
13792 stmt
= begin_while_stmt ();
13793 tmp
= RECUR (WHILE_COND (t
));
13794 finish_while_stmt_cond (tmp
, stmt
, false);
13795 RECUR (WHILE_BODY (t
));
13796 finish_while_stmt (stmt
);
13800 stmt
= begin_do_stmt ();
13801 RECUR (DO_BODY (t
));
13802 finish_do_body (stmt
);
13803 tmp
= RECUR (DO_COND (t
));
13804 finish_do_stmt (tmp
, stmt
, false);
13808 stmt
= begin_if_stmt ();
13809 tmp
= RECUR (IF_COND (t
));
13810 finish_if_stmt_cond (tmp
, stmt
);
13811 RECUR (THEN_CLAUSE (t
));
13812 finish_then_clause (stmt
);
13814 if (ELSE_CLAUSE (t
))
13816 begin_else_clause (stmt
);
13817 RECUR (ELSE_CLAUSE (t
));
13818 finish_else_clause (stmt
);
13821 finish_if_stmt (stmt
);
13825 if (BIND_EXPR_BODY_BLOCK (t
))
13826 stmt
= begin_function_body ();
13828 stmt
= begin_compound_stmt (BIND_EXPR_TRY_BLOCK (t
)
13829 ? BCS_TRY_BLOCK
: 0);
13831 RECUR (BIND_EXPR_BODY (t
));
13833 if (BIND_EXPR_BODY_BLOCK (t
))
13834 finish_function_body (stmt
);
13836 finish_compound_stmt (stmt
);
13840 finish_break_stmt ();
13843 case CONTINUE_STMT
:
13844 finish_continue_stmt ();
13848 stmt
= begin_switch_stmt ();
13849 tmp
= RECUR (SWITCH_STMT_COND (t
));
13850 finish_switch_cond (tmp
, stmt
);
13851 RECUR (SWITCH_STMT_BODY (t
));
13852 finish_switch_stmt (stmt
);
13855 case CASE_LABEL_EXPR
:
13857 tree low
= RECUR (CASE_LOW (t
));
13858 tree high
= RECUR (CASE_HIGH (t
));
13859 finish_case_label (EXPR_LOCATION (t
), low
, high
);
13865 tree decl
= LABEL_EXPR_LABEL (t
);
13868 label
= finish_label_stmt (DECL_NAME (decl
));
13869 if (DECL_ATTRIBUTES (decl
) != NULL_TREE
)
13870 cplus_decl_attributes (&label
, DECL_ATTRIBUTES (decl
), 0);
13875 tmp
= GOTO_DESTINATION (t
);
13876 if (TREE_CODE (tmp
) != LABEL_DECL
)
13877 /* Computed goto's must be tsubst'd into. On the other hand,
13878 non-computed gotos must not be; the identifier in question
13879 will have no binding. */
13882 tmp
= DECL_NAME (tmp
);
13883 finish_goto_stmt (tmp
);
13888 tree string
= RECUR (ASM_STRING (t
));
13889 tree outputs
= tsubst_copy_asm_operands (ASM_OUTPUTS (t
), args
,
13890 complain
, in_decl
);
13891 tree inputs
= tsubst_copy_asm_operands (ASM_INPUTS (t
), args
,
13892 complain
, in_decl
);
13893 tree clobbers
= tsubst_copy_asm_operands (ASM_CLOBBERS (t
), args
,
13894 complain
, in_decl
);
13895 tree labels
= tsubst_copy_asm_operands (ASM_LABELS (t
), args
,
13896 complain
, in_decl
);
13897 tmp
= finish_asm_stmt (ASM_VOLATILE_P (t
), string
, outputs
, inputs
,
13899 tree asm_expr
= tmp
;
13900 if (TREE_CODE (asm_expr
) == CLEANUP_POINT_EXPR
)
13901 asm_expr
= TREE_OPERAND (asm_expr
, 0);
13902 ASM_INPUT_P (asm_expr
) = ASM_INPUT_P (t
);
13909 stmt
= begin_try_block ();
13910 RECUR (TRY_STMTS (t
));
13911 finish_cleanup_try_block (stmt
);
13912 finish_cleanup (RECUR (TRY_HANDLERS (t
)), stmt
);
13916 tree compound_stmt
= NULL_TREE
;
13918 if (FN_TRY_BLOCK_P (t
))
13919 stmt
= begin_function_try_block (&compound_stmt
);
13921 stmt
= begin_try_block ();
13923 RECUR (TRY_STMTS (t
));
13925 if (FN_TRY_BLOCK_P (t
))
13926 finish_function_try_block (stmt
);
13928 finish_try_block (stmt
);
13930 RECUR (TRY_HANDLERS (t
));
13931 if (FN_TRY_BLOCK_P (t
))
13932 finish_function_handler_sequence (stmt
, compound_stmt
);
13934 finish_handler_sequence (stmt
);
13940 tree decl
= HANDLER_PARMS (t
);
13944 decl
= tsubst (decl
, args
, complain
, in_decl
);
13945 /* Prevent instantiate_decl from trying to instantiate
13946 this variable. We've already done all that needs to be
13948 if (decl
!= error_mark_node
)
13949 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
13951 stmt
= begin_handler ();
13952 finish_handler_parms (decl
, stmt
);
13953 RECUR (HANDLER_BODY (t
));
13954 finish_handler (stmt
);
13959 tmp
= tsubst (TREE_TYPE (t
), args
, complain
, NULL_TREE
);
13960 if (CLASS_TYPE_P (tmp
))
13962 /* Local classes are not independent templates; they are
13963 instantiated along with their containing function. And this
13964 way we don't have to deal with pushing out of one local class
13965 to instantiate a member of another local class. */
13967 /* Closures are handled by the LAMBDA_EXPR. */
13968 gcc_assert (!LAMBDA_TYPE_P (TREE_TYPE (t
)));
13969 complete_type (tmp
);
13970 for (fn
= TYPE_METHODS (tmp
); fn
; fn
= DECL_CHAIN (fn
))
13971 if (!DECL_ARTIFICIAL (fn
))
13972 instantiate_decl (fn
, /*defer_ok*/0, /*expl_inst_class*/false);
13976 case STATIC_ASSERT
:
13980 ++c_inhibit_evaluation_warnings
;
13982 tsubst_expr (STATIC_ASSERT_CONDITION (t
),
13985 /*integral_constant_expression_p=*/true);
13986 --c_inhibit_evaluation_warnings
;
13988 finish_static_assert (condition
,
13989 STATIC_ASSERT_MESSAGE (t
),
13990 STATIC_ASSERT_SOURCE_LOCATION (t
),
13991 /*member_p=*/false);
13996 tmp
= tsubst_omp_clauses (OMP_PARALLEL_CLAUSES (t
), false,
13997 args
, complain
, in_decl
);
13998 stmt
= begin_omp_parallel ();
13999 RECUR (OMP_PARALLEL_BODY (t
));
14000 OMP_PARALLEL_COMBINED (finish_omp_parallel (tmp
, stmt
))
14001 = OMP_PARALLEL_COMBINED (t
);
14005 tmp
= tsubst_omp_clauses (OMP_TASK_CLAUSES (t
), false,
14006 args
, complain
, in_decl
);
14007 stmt
= begin_omp_task ();
14008 RECUR (OMP_TASK_BODY (t
));
14009 finish_omp_task (tmp
, stmt
);
14016 case OMP_DISTRIBUTE
:
14018 tree clauses
, body
, pre_body
;
14019 tree declv
= NULL_TREE
, initv
= NULL_TREE
, condv
= NULL_TREE
;
14020 tree incrv
= NULL_TREE
;
14023 clauses
= tsubst_omp_clauses (OMP_FOR_CLAUSES (t
), false,
14024 args
, complain
, in_decl
);
14025 if (OMP_FOR_INIT (t
) != NULL_TREE
)
14027 declv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
14028 initv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
14029 condv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
14030 incrv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
14033 stmt
= begin_omp_structured_block ();
14035 pre_body
= push_stmt_list ();
14036 RECUR (OMP_FOR_PRE_BODY (t
));
14037 pre_body
= pop_stmt_list (pre_body
);
14039 if (OMP_FOR_INIT (t
) != NULL_TREE
)
14040 for (i
= 0; i
< TREE_VEC_LENGTH (OMP_FOR_INIT (t
)); i
++)
14041 tsubst_omp_for_iterator (t
, i
, declv
, initv
, condv
, incrv
,
14042 &clauses
, args
, complain
, in_decl
,
14043 integral_constant_expression_p
);
14045 body
= push_stmt_list ();
14046 RECUR (OMP_FOR_BODY (t
));
14047 body
= pop_stmt_list (body
);
14049 if (OMP_FOR_INIT (t
) != NULL_TREE
)
14050 t
= finish_omp_for (EXPR_LOCATION (t
), TREE_CODE (t
), declv
, initv
,
14051 condv
, incrv
, body
, pre_body
, clauses
);
14054 t
= make_node (TREE_CODE (t
));
14055 TREE_TYPE (t
) = void_type_node
;
14056 OMP_FOR_BODY (t
) = body
;
14057 OMP_FOR_PRE_BODY (t
) = pre_body
;
14058 OMP_FOR_CLAUSES (t
) = clauses
;
14059 SET_EXPR_LOCATION (t
, EXPR_LOCATION (t
));
14063 add_stmt (finish_omp_structured_block (stmt
));
14070 case OMP_TARGET_DATA
:
14072 tmp
= tsubst_omp_clauses (OMP_CLAUSES (t
), false,
14073 args
, complain
, in_decl
);
14074 stmt
= push_stmt_list ();
14075 RECUR (OMP_BODY (t
));
14076 stmt
= pop_stmt_list (stmt
);
14079 OMP_BODY (t
) = stmt
;
14080 OMP_CLAUSES (t
) = tmp
;
14084 case OMP_TARGET_UPDATE
:
14085 tmp
= tsubst_omp_clauses (OMP_TARGET_UPDATE_CLAUSES (t
), false,
14086 args
, complain
, in_decl
);
14088 OMP_CLAUSES (t
) = tmp
;
14095 case OMP_TASKGROUP
:
14097 stmt
= push_stmt_list ();
14098 RECUR (OMP_BODY (t
));
14099 stmt
= pop_stmt_list (stmt
);
14102 OMP_BODY (t
) = stmt
;
14107 gcc_assert (OMP_ATOMIC_DEPENDENT_P (t
));
14108 if (TREE_CODE (TREE_OPERAND (t
, 1)) != MODIFY_EXPR
)
14110 tree op1
= TREE_OPERAND (t
, 1);
14111 tree rhs1
= NULL_TREE
;
14113 if (TREE_CODE (op1
) == COMPOUND_EXPR
)
14115 rhs1
= RECUR (TREE_OPERAND (op1
, 0));
14116 op1
= TREE_OPERAND (op1
, 1);
14118 lhs
= RECUR (TREE_OPERAND (op1
, 0));
14119 rhs
= RECUR (TREE_OPERAND (op1
, 1));
14120 finish_omp_atomic (OMP_ATOMIC
, TREE_CODE (op1
), lhs
, rhs
,
14121 NULL_TREE
, NULL_TREE
, rhs1
,
14122 OMP_ATOMIC_SEQ_CST (t
));
14126 tree op1
= TREE_OPERAND (t
, 1);
14127 tree v
= NULL_TREE
, lhs
, rhs
= NULL_TREE
, lhs1
= NULL_TREE
;
14128 tree rhs1
= NULL_TREE
;
14129 enum tree_code code
= TREE_CODE (TREE_OPERAND (op1
, 1));
14130 enum tree_code opcode
= NOP_EXPR
;
14131 if (code
== OMP_ATOMIC_READ
)
14133 v
= RECUR (TREE_OPERAND (op1
, 0));
14134 lhs
= RECUR (TREE_OPERAND (TREE_OPERAND (op1
, 1), 0));
14136 else if (code
== OMP_ATOMIC_CAPTURE_OLD
14137 || code
== OMP_ATOMIC_CAPTURE_NEW
)
14139 tree op11
= TREE_OPERAND (TREE_OPERAND (op1
, 1), 1);
14140 v
= RECUR (TREE_OPERAND (op1
, 0));
14141 lhs1
= RECUR (TREE_OPERAND (TREE_OPERAND (op1
, 1), 0));
14142 if (TREE_CODE (op11
) == COMPOUND_EXPR
)
14144 rhs1
= RECUR (TREE_OPERAND (op11
, 0));
14145 op11
= TREE_OPERAND (op11
, 1);
14147 lhs
= RECUR (TREE_OPERAND (op11
, 0));
14148 rhs
= RECUR (TREE_OPERAND (op11
, 1));
14149 opcode
= TREE_CODE (op11
);
14150 if (opcode
== MODIFY_EXPR
)
14156 lhs
= RECUR (TREE_OPERAND (op1
, 0));
14157 rhs
= RECUR (TREE_OPERAND (op1
, 1));
14159 finish_omp_atomic (code
, opcode
, lhs
, rhs
, v
, lhs1
, rhs1
,
14160 OMP_ATOMIC_SEQ_CST (t
));
14164 case TRANSACTION_EXPR
:
14167 flags
|= (TRANSACTION_EXPR_OUTER (t
) ? TM_STMT_ATTR_OUTER
: 0);
14168 flags
|= (TRANSACTION_EXPR_RELAXED (t
) ? TM_STMT_ATTR_RELAXED
: 0);
14170 if (TRANSACTION_EXPR_IS_STMT (t
))
14172 tree body
= TRANSACTION_EXPR_BODY (t
);
14173 tree noex
= NULL_TREE
;
14174 if (TREE_CODE (body
) == MUST_NOT_THROW_EXPR
)
14176 noex
= MUST_NOT_THROW_COND (body
);
14177 if (noex
== NULL_TREE
)
14178 noex
= boolean_true_node
;
14179 body
= TREE_OPERAND (body
, 0);
14181 stmt
= begin_transaction_stmt (input_location
, NULL
, flags
);
14183 finish_transaction_stmt (stmt
, NULL
, flags
, RECUR (noex
));
14187 stmt
= build_transaction_expr (EXPR_LOCATION (t
),
14188 RECUR (TRANSACTION_EXPR_BODY (t
)),
14195 case MUST_NOT_THROW_EXPR
:
14197 tree op0
= RECUR (TREE_OPERAND (t
, 0));
14198 tree cond
= RECUR (MUST_NOT_THROW_COND (t
));
14199 RETURN (build_must_not_throw_expr (op0
, cond
));
14202 case EXPR_PACK_EXPANSION
:
14203 error ("invalid use of pack expansion expression");
14204 RETURN (error_mark_node
);
14206 case NONTYPE_ARGUMENT_PACK
:
14207 error ("use %<...%> to expand argument pack");
14208 RETURN (error_mark_node
);
14210 case CILK_SPAWN_STMT
:
14211 cfun
->calls_cilk_spawn
= 1;
14212 RETURN (build_cilk_spawn (EXPR_LOCATION (t
), RECUR (CILK_SPAWN_FN (t
))));
14214 case CILK_SYNC_STMT
:
14215 RETURN (build_cilk_sync ());
14217 case COMPOUND_EXPR
:
14218 tmp
= RECUR (TREE_OPERAND (t
, 0));
14219 if (tmp
== NULL_TREE
)
14220 /* If the first operand was a statement, we're done with it. */
14221 RETURN (RECUR (TREE_OPERAND (t
, 1)));
14222 RETURN (build_x_compound_expr (EXPR_LOCATION (t
), tmp
,
14223 RECUR (TREE_OPERAND (t
, 1)),
14226 case ANNOTATE_EXPR
:
14227 tmp
= RECUR (TREE_OPERAND (t
, 0));
14228 RETURN (build2_loc (EXPR_LOCATION (t
), ANNOTATE_EXPR
,
14229 TREE_TYPE (tmp
), tmp
, RECUR (TREE_OPERAND (t
, 1))));
14232 gcc_assert (!STATEMENT_CODE_P (TREE_CODE (t
)));
14234 RETURN (tsubst_copy_and_build (t
, args
, complain
, in_decl
,
14235 /*function_p=*/false,
14236 integral_constant_expression_p
));
14239 RETURN (NULL_TREE
);
14241 input_location
= loc
;
14247 /* Instantiate the special body of the artificial DECL_OMP_DECLARE_REDUCTION
14248 function. For description of the body see comment above
14249 cp_parser_omp_declare_reduction_exprs. */
14252 tsubst_omp_udr (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
14254 if (t
== NULL_TREE
|| t
== error_mark_node
)
14257 gcc_assert (TREE_CODE (t
) == STATEMENT_LIST
);
14259 tree_stmt_iterator tsi
;
14262 memset (stmts
, 0, sizeof stmts
);
14263 for (i
= 0, tsi
= tsi_start (t
);
14264 i
< 7 && !tsi_end_p (tsi
);
14265 i
++, tsi_next (&tsi
))
14266 stmts
[i
] = tsi_stmt (tsi
);
14267 gcc_assert (tsi_end_p (tsi
));
14271 gcc_assert (TREE_CODE (stmts
[0]) == DECL_EXPR
14272 && TREE_CODE (stmts
[1]) == DECL_EXPR
);
14273 tree omp_out
= tsubst (DECL_EXPR_DECL (stmts
[0]),
14274 args
, complain
, in_decl
);
14275 tree omp_in
= tsubst (DECL_EXPR_DECL (stmts
[1]),
14276 args
, complain
, in_decl
);
14277 DECL_CONTEXT (omp_out
) = current_function_decl
;
14278 DECL_CONTEXT (omp_in
) = current_function_decl
;
14279 keep_next_level (true);
14280 tree block
= begin_omp_structured_block ();
14281 tsubst_expr (stmts
[2], args
, complain
, in_decl
, false);
14282 block
= finish_omp_structured_block (block
);
14283 block
= maybe_cleanup_point_expr_void (block
);
14284 add_decl_expr (omp_out
);
14285 if (TREE_NO_WARNING (DECL_EXPR_DECL (stmts
[0])))
14286 TREE_NO_WARNING (omp_out
) = 1;
14287 add_decl_expr (omp_in
);
14288 finish_expr_stmt (block
);
14292 gcc_assert (TREE_CODE (stmts
[3]) == DECL_EXPR
14293 && TREE_CODE (stmts
[4]) == DECL_EXPR
);
14294 tree omp_priv
= tsubst (DECL_EXPR_DECL (stmts
[3]),
14295 args
, complain
, in_decl
);
14296 tree omp_orig
= tsubst (DECL_EXPR_DECL (stmts
[4]),
14297 args
, complain
, in_decl
);
14298 DECL_CONTEXT (omp_priv
) = current_function_decl
;
14299 DECL_CONTEXT (omp_orig
) = current_function_decl
;
14300 keep_next_level (true);
14301 tree block
= begin_omp_structured_block ();
14302 tsubst_expr (stmts
[5], args
, complain
, in_decl
, false);
14303 block
= finish_omp_structured_block (block
);
14304 block
= maybe_cleanup_point_expr_void (block
);
14305 cp_walk_tree (&block
, cp_remove_omp_priv_cleanup_stmt
, omp_priv
, NULL
);
14306 add_decl_expr (omp_priv
);
14307 add_decl_expr (omp_orig
);
14308 finish_expr_stmt (block
);
14310 add_decl_expr (omp_orig
);
14314 /* T is a postfix-expression that is not being used in a function
14315 call. Return the substituted version of T. */
14318 tsubst_non_call_postfix_expression (tree t
, tree args
,
14319 tsubst_flags_t complain
,
14322 if (TREE_CODE (t
) == SCOPE_REF
)
14323 t
= tsubst_qualified_id (t
, args
, complain
, in_decl
,
14324 /*done=*/false, /*address_p=*/false);
14326 t
= tsubst_copy_and_build (t
, args
, complain
, in_decl
,
14327 /*function_p=*/false,
14328 /*integral_constant_expression_p=*/false);
14333 /* Sentinel to disable certain warnings during template substitution. */
14335 struct warning_sentinel
{
14338 warning_sentinel(int& flag
, bool suppress
=true)
14339 : flag(flag
), val(flag
) { if (suppress
) flag
= 0; }
14340 ~warning_sentinel() { flag
= val
; }
14343 /* Like tsubst but deals with expressions and performs semantic
14344 analysis. FUNCTION_P is true if T is the "F" in "F (ARGS)". */
14347 tsubst_copy_and_build (tree t
,
14349 tsubst_flags_t complain
,
14352 bool integral_constant_expression_p
)
14354 #define RETURN(EXP) do { retval = (EXP); goto out; } while(0)
14355 #define RECUR(NODE) \
14356 tsubst_copy_and_build (NODE, args, complain, in_decl, \
14357 /*function_p=*/false, \
14358 integral_constant_expression_p)
14363 if (t
== NULL_TREE
|| t
== error_mark_node
)
14366 loc
= input_location
;
14367 if (EXPR_HAS_LOCATION (t
))
14368 input_location
= EXPR_LOCATION (t
);
14370 /* N3276 decltype magic only applies to calls at the top level or on the
14371 right side of a comma. */
14372 tsubst_flags_t decltype_flag
= (complain
& tf_decltype
);
14373 complain
&= ~tf_decltype
;
14375 switch (TREE_CODE (t
))
14379 /* Fall through. */
14380 case IDENTIFIER_NODE
:
14384 bool non_integral_constant_expression_p
;
14385 const char *error_msg
;
14387 if (IDENTIFIER_TYPENAME_P (t
))
14389 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14390 t
= mangle_conv_op_name_for_type (new_type
);
14393 /* Look up the name. */
14394 decl
= lookup_name (t
);
14396 /* By convention, expressions use ERROR_MARK_NODE to indicate
14397 failure, not NULL_TREE. */
14398 if (decl
== NULL_TREE
)
14399 decl
= error_mark_node
;
14401 decl
= finish_id_expression (t
, decl
, NULL_TREE
,
14403 integral_constant_expression_p
,
14404 /*allow_non_integral_constant_expression_p=*/(cxx_dialect
>= cxx11
),
14405 &non_integral_constant_expression_p
,
14406 /*template_p=*/false,
14408 /*address_p=*/false,
14409 /*template_arg_p=*/false,
14414 if (!function_p
&& identifier_p (decl
))
14416 if (complain
& tf_error
)
14417 unqualified_name_lookup_error (decl
);
14418 decl
= error_mark_node
;
14423 case TEMPLATE_ID_EXPR
:
14426 tree templ
= RECUR (TREE_OPERAND (t
, 0));
14427 tree targs
= TREE_OPERAND (t
, 1);
14430 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
14432 if (TREE_CODE (templ
) == COMPONENT_REF
)
14434 object
= TREE_OPERAND (templ
, 0);
14435 templ
= TREE_OPERAND (templ
, 1);
14438 object
= NULL_TREE
;
14439 templ
= lookup_template_function (templ
, targs
);
14442 RETURN (build3 (COMPONENT_REF
, TREE_TYPE (templ
),
14443 object
, templ
, NULL_TREE
));
14445 RETURN (baselink_for_fns (templ
));
14450 tree r
= RECUR (TREE_OPERAND (t
, 0));
14452 if (REFERENCE_REF_P (t
))
14454 /* A type conversion to reference type will be enclosed in
14455 such an indirect ref, but the substitution of the cast
14456 will have also added such an indirect ref. */
14457 if (TREE_CODE (TREE_TYPE (r
)) == REFERENCE_TYPE
)
14458 r
= convert_from_reference (r
);
14461 r
= build_x_indirect_ref (input_location
, r
, RO_UNARY_STAR
,
14462 complain
|decltype_flag
);
14468 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14469 tree op0
= RECUR (TREE_OPERAND (t
, 0));
14470 RETURN (build_nop (type
, op0
));
14473 case IMPLICIT_CONV_EXPR
:
14475 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14476 tree expr
= RECUR (TREE_OPERAND (t
, 0));
14477 int flags
= LOOKUP_IMPLICIT
;
14478 if (IMPLICIT_CONV_EXPR_DIRECT_INIT (t
))
14479 flags
= LOOKUP_NORMAL
;
14480 RETURN (perform_implicit_conversion_flags (type
, expr
, complain
,
14486 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14487 tree op0
= RECUR (TREE_OPERAND (t
, 0));
14488 RETURN (build1 (CONVERT_EXPR
, type
, op0
));
14492 case REINTERPRET_CAST_EXPR
:
14493 case CONST_CAST_EXPR
:
14494 case DYNAMIC_CAST_EXPR
:
14495 case STATIC_CAST_EXPR
:
14498 tree op
, r
= NULL_TREE
;
14500 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14501 if (integral_constant_expression_p
14502 && !cast_valid_in_integral_constant_expression_p (type
))
14504 if (complain
& tf_error
)
14505 error ("a cast to a type other than an integral or "
14506 "enumeration type cannot appear in a constant-expression");
14507 RETURN (error_mark_node
);
14510 op
= RECUR (TREE_OPERAND (t
, 0));
14512 warning_sentinel
s(warn_useless_cast
);
14513 switch (TREE_CODE (t
))
14516 r
= build_functional_cast (type
, op
, complain
);
14518 case REINTERPRET_CAST_EXPR
:
14519 r
= build_reinterpret_cast (type
, op
, complain
);
14521 case CONST_CAST_EXPR
:
14522 r
= build_const_cast (type
, op
, complain
);
14524 case DYNAMIC_CAST_EXPR
:
14525 r
= build_dynamic_cast (type
, op
, complain
);
14527 case STATIC_CAST_EXPR
:
14528 r
= build_static_cast (type
, op
, complain
);
14531 gcc_unreachable ();
14537 case POSTDECREMENT_EXPR
:
14538 case POSTINCREMENT_EXPR
:
14539 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
14540 args
, complain
, in_decl
);
14541 RETURN (build_x_unary_op (input_location
, TREE_CODE (t
), op1
,
14542 complain
|decltype_flag
));
14544 case PREDECREMENT_EXPR
:
14545 case PREINCREMENT_EXPR
:
14549 case TRUTH_NOT_EXPR
:
14550 case UNARY_PLUS_EXPR
: /* Unary + */
14551 case REALPART_EXPR
:
14552 case IMAGPART_EXPR
:
14553 RETURN (build_x_unary_op (input_location
, TREE_CODE (t
),
14554 RECUR (TREE_OPERAND (t
, 0)),
14555 complain
|decltype_flag
));
14557 case FIX_TRUNC_EXPR
:
14558 RETURN (cp_build_unary_op (FIX_TRUNC_EXPR
, RECUR (TREE_OPERAND (t
, 0)),
14562 op1
= TREE_OPERAND (t
, 0);
14563 if (TREE_CODE (op1
) == LABEL_DECL
)
14564 RETURN (finish_label_address_expr (DECL_NAME (op1
),
14565 EXPR_LOCATION (op1
)));
14566 if (TREE_CODE (op1
) == SCOPE_REF
)
14567 op1
= tsubst_qualified_id (op1
, args
, complain
, in_decl
,
14568 /*done=*/true, /*address_p=*/true);
14570 op1
= tsubst_non_call_postfix_expression (op1
, args
, complain
,
14572 RETURN (build_x_unary_op (input_location
, ADDR_EXPR
, op1
,
14573 complain
|decltype_flag
));
14578 case TRUNC_DIV_EXPR
:
14579 case CEIL_DIV_EXPR
:
14580 case FLOOR_DIV_EXPR
:
14581 case ROUND_DIV_EXPR
:
14582 case EXACT_DIV_EXPR
:
14586 case TRUNC_MOD_EXPR
:
14587 case FLOOR_MOD_EXPR
:
14588 case TRUTH_ANDIF_EXPR
:
14589 case TRUTH_ORIF_EXPR
:
14590 case TRUTH_AND_EXPR
:
14591 case TRUTH_OR_EXPR
:
14607 warning_sentinel
s1(warn_type_limits
);
14608 warning_sentinel
s2(warn_div_by_zero
);
14609 tree op0
= RECUR (TREE_OPERAND (t
, 0));
14610 tree op1
= RECUR (TREE_OPERAND (t
, 1));
14611 tree r
= build_x_binary_op
14612 (input_location
, TREE_CODE (t
),
14614 (TREE_NO_WARNING (TREE_OPERAND (t
, 0))
14616 : TREE_CODE (TREE_OPERAND (t
, 0))),
14618 (TREE_NO_WARNING (TREE_OPERAND (t
, 1))
14620 : TREE_CODE (TREE_OPERAND (t
, 1))),
14622 complain
|decltype_flag
);
14623 if (EXPR_P (r
) && TREE_NO_WARNING (t
))
14624 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
14629 case POINTER_PLUS_EXPR
:
14631 tree op0
= RECUR (TREE_OPERAND (t
, 0));
14632 tree op1
= RECUR (TREE_OPERAND (t
, 1));
14633 return fold_build_pointer_plus (op0
, op1
);
14637 RETURN (tsubst_qualified_id (t
, args
, complain
, in_decl
, /*done=*/true,
14638 /*address_p=*/false));
14640 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
14641 args
, complain
, in_decl
);
14642 RETURN (build_x_array_ref (EXPR_LOCATION (t
), op1
,
14643 RECUR (TREE_OPERAND (t
, 1)),
14644 complain
|decltype_flag
));
14646 case ARRAY_NOTATION_REF
:
14648 tree start_index
, length
, stride
;
14649 op1
= tsubst_non_call_postfix_expression (ARRAY_NOTATION_ARRAY (t
),
14650 args
, complain
, in_decl
);
14651 start_index
= RECUR (ARRAY_NOTATION_START (t
));
14652 length
= RECUR (ARRAY_NOTATION_LENGTH (t
));
14653 stride
= RECUR (ARRAY_NOTATION_STRIDE (t
));
14654 RETURN (build_array_notation_ref (EXPR_LOCATION (t
), op1
, start_index
,
14655 length
, stride
, TREE_TYPE (op1
)));
14658 if (PACK_EXPANSION_P (TREE_OPERAND (t
, 0)))
14659 RETURN (tsubst_copy (t
, args
, complain
, in_decl
));
14666 op1
= TREE_OPERAND (t
, 0);
14667 if (TREE_CODE (t
) == SIZEOF_EXPR
&& SIZEOF_EXPR_TYPE_P (t
))
14668 op1
= TREE_TYPE (op1
);
14671 /* When there are no ARGS, we are trying to evaluate a
14672 non-dependent expression from the parser. Trying to do
14673 the substitutions may not work. */
14675 op1
= TREE_TYPE (op1
);
14679 ++cp_unevaluated_operand
;
14680 ++c_inhibit_evaluation_warnings
;
14682 op1
= tsubst (op1
, args
, complain
, in_decl
);
14684 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
14685 /*function_p=*/false,
14686 /*integral_constant_expression_p=*/
14688 --cp_unevaluated_operand
;
14689 --c_inhibit_evaluation_warnings
;
14692 r
= cxx_sizeof_or_alignof_type (op1
, TREE_CODE (t
),
14693 complain
& tf_error
);
14695 r
= cxx_sizeof_or_alignof_expr (op1
, TREE_CODE (t
),
14696 complain
& tf_error
);
14697 if (TREE_CODE (t
) == SIZEOF_EXPR
&& r
!= error_mark_node
)
14699 if (TREE_CODE (r
) != SIZEOF_EXPR
|| TYPE_P (op1
))
14701 if (!processing_template_decl
&& TYPE_P (op1
))
14703 r
= build_min (SIZEOF_EXPR
, size_type_node
,
14704 build1 (NOP_EXPR
, op1
, error_mark_node
));
14705 SIZEOF_EXPR_TYPE_P (r
) = 1;
14708 r
= build_min (SIZEOF_EXPR
, size_type_node
, op1
);
14709 TREE_SIDE_EFFECTS (r
) = 0;
14710 TREE_READONLY (r
) = 1;
14712 SET_EXPR_LOCATION (r
, EXPR_LOCATION (t
));
14717 case AT_ENCODE_EXPR
:
14719 op1
= TREE_OPERAND (t
, 0);
14720 ++cp_unevaluated_operand
;
14721 ++c_inhibit_evaluation_warnings
;
14722 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
14723 /*function_p=*/false,
14724 /*integral_constant_expression_p=*/false);
14725 --cp_unevaluated_operand
;
14726 --c_inhibit_evaluation_warnings
;
14727 RETURN (objc_build_encode_expr (op1
));
14730 case NOEXCEPT_EXPR
:
14731 op1
= TREE_OPERAND (t
, 0);
14732 ++cp_unevaluated_operand
;
14733 ++c_inhibit_evaluation_warnings
;
14734 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
14735 /*function_p=*/false,
14736 /*integral_constant_expression_p=*/false);
14737 --cp_unevaluated_operand
;
14738 --c_inhibit_evaluation_warnings
;
14739 RETURN (finish_noexcept_expr (op1
, complain
));
14743 warning_sentinel
s(warn_div_by_zero
);
14744 tree lhs
= RECUR (TREE_OPERAND (t
, 0));
14745 tree rhs
= RECUR (TREE_OPERAND (t
, 2));
14746 tree r
= build_x_modify_expr
14747 (EXPR_LOCATION (t
), lhs
, TREE_CODE (TREE_OPERAND (t
, 1)), rhs
,
14748 complain
|decltype_flag
);
14749 /* TREE_NO_WARNING must be set if either the expression was
14750 parenthesized or it uses an operator such as >>= rather
14751 than plain assignment. In the former case, it was already
14752 set and must be copied. In the latter case,
14753 build_x_modify_expr sets it and it must not be reset
14755 if (TREE_NO_WARNING (t
))
14756 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
14762 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
14763 args
, complain
, in_decl
);
14764 /* Remember that there was a reference to this entity. */
14767 RETURN (build_x_arrow (input_location
, op1
, complain
));
14771 tree placement
= RECUR (TREE_OPERAND (t
, 0));
14772 tree init
= RECUR (TREE_OPERAND (t
, 3));
14773 vec
<tree
, va_gc
> *placement_vec
;
14774 vec
<tree
, va_gc
> *init_vec
;
14777 if (placement
== NULL_TREE
)
14778 placement_vec
= NULL
;
14781 placement_vec
= make_tree_vector ();
14782 for (; placement
!= NULL_TREE
; placement
= TREE_CHAIN (placement
))
14783 vec_safe_push (placement_vec
, TREE_VALUE (placement
));
14786 /* If there was an initializer in the original tree, but it
14787 instantiated to an empty list, then we should pass a
14788 non-NULL empty vector to tell build_new that it was an
14789 empty initializer() rather than no initializer. This can
14790 only happen when the initializer is a pack expansion whose
14791 parameter packs are of length zero. */
14792 if (init
== NULL_TREE
&& TREE_OPERAND (t
, 3) == NULL_TREE
)
14796 init_vec
= make_tree_vector ();
14797 if (init
== void_node
)
14798 gcc_assert (init_vec
!= NULL
);
14801 for (; init
!= NULL_TREE
; init
= TREE_CHAIN (init
))
14802 vec_safe_push (init_vec
, TREE_VALUE (init
));
14806 tree op1
= tsubst (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14807 tree op2
= RECUR (TREE_OPERAND (t
, 2));
14808 ret
= build_new (&placement_vec
, op1
, op2
, &init_vec
,
14809 NEW_EXPR_USE_GLOBAL (t
),
14812 if (placement_vec
!= NULL
)
14813 release_tree_vector (placement_vec
);
14814 if (init_vec
!= NULL
)
14815 release_tree_vector (init_vec
);
14822 tree op0
= RECUR (TREE_OPERAND (t
, 0));
14823 tree op1
= RECUR (TREE_OPERAND (t
, 1));
14824 RETURN (delete_sanity (op0
, op1
,
14825 DELETE_EXPR_USE_VEC (t
),
14826 DELETE_EXPR_USE_GLOBAL (t
),
14830 case COMPOUND_EXPR
:
14832 tree op0
= tsubst_copy_and_build (TREE_OPERAND (t
, 0), args
,
14833 complain
& ~tf_decltype
, in_decl
,
14834 /*function_p=*/false,
14835 integral_constant_expression_p
);
14836 RETURN (build_x_compound_expr (EXPR_LOCATION (t
),
14838 RECUR (TREE_OPERAND (t
, 1)),
14839 complain
|decltype_flag
));
14845 vec
<tree
, va_gc
> *call_args
;
14846 unsigned int nargs
, i
;
14851 function
= CALL_EXPR_FN (t
);
14852 /* When we parsed the expression, we determined whether or
14853 not Koenig lookup should be performed. */
14854 koenig_p
= KOENIG_LOOKUP_P (t
);
14855 if (TREE_CODE (function
) == SCOPE_REF
)
14857 qualified_p
= true;
14858 function
= tsubst_qualified_id (function
, args
, complain
, in_decl
,
14860 /*address_p=*/false);
14862 else if (koenig_p
&& identifier_p (function
))
14864 /* Do nothing; calling tsubst_copy_and_build on an identifier
14865 would incorrectly perform unqualified lookup again.
14867 Note that we can also have an IDENTIFIER_NODE if the earlier
14868 unqualified lookup found a member function; in that case
14869 koenig_p will be false and we do want to do the lookup
14870 again to find the instantiated member function.
14872 FIXME but doing that causes c++/15272, so we need to stop
14873 using IDENTIFIER_NODE in that situation. */
14874 qualified_p
= false;
14878 if (TREE_CODE (function
) == COMPONENT_REF
)
14880 tree op
= TREE_OPERAND (function
, 1);
14882 qualified_p
= (TREE_CODE (op
) == SCOPE_REF
14883 || (BASELINK_P (op
)
14884 && BASELINK_QUALIFIED_P (op
)));
14887 qualified_p
= false;
14889 if (TREE_CODE (function
) == ADDR_EXPR
14890 && TREE_CODE (TREE_OPERAND (function
, 0)) == FUNCTION_DECL
)
14891 /* Avoid error about taking the address of a constructor. */
14892 function
= TREE_OPERAND (function
, 0);
14894 function
= tsubst_copy_and_build (function
, args
, complain
,
14897 integral_constant_expression_p
);
14899 if (BASELINK_P (function
))
14900 qualified_p
= true;
14903 nargs
= call_expr_nargs (t
);
14904 call_args
= make_tree_vector ();
14905 for (i
= 0; i
< nargs
; ++i
)
14907 tree arg
= CALL_EXPR_ARG (t
, i
);
14909 if (!PACK_EXPANSION_P (arg
))
14910 vec_safe_push (call_args
, RECUR (CALL_EXPR_ARG (t
, i
)));
14913 /* Expand the pack expansion and push each entry onto
14915 arg
= tsubst_pack_expansion (arg
, args
, complain
, in_decl
);
14916 if (TREE_CODE (arg
) == TREE_VEC
)
14918 unsigned int len
, j
;
14920 len
= TREE_VEC_LENGTH (arg
);
14921 for (j
= 0; j
< len
; ++j
)
14923 tree value
= TREE_VEC_ELT (arg
, j
);
14924 if (value
!= NULL_TREE
)
14925 value
= convert_from_reference (value
);
14926 vec_safe_push (call_args
, value
);
14931 /* A partial substitution. Add one entry. */
14932 vec_safe_push (call_args
, arg
);
14937 /* We do not perform argument-dependent lookup if normal
14938 lookup finds a non-function, in accordance with the
14939 expected resolution of DR 218. */
14941 && ((is_overloaded_fn (function
)
14942 /* If lookup found a member function, the Koenig lookup is
14943 not appropriate, even if an unqualified-name was used
14944 to denote the function. */
14945 && !DECL_FUNCTION_MEMBER_P (get_first_fn (function
)))
14946 || identifier_p (function
))
14947 /* Only do this when substitution turns a dependent call
14948 into a non-dependent call. */
14949 && type_dependent_expression_p_push (t
)
14950 && !any_type_dependent_arguments_p (call_args
))
14951 function
= perform_koenig_lookup (function
, call_args
, tf_none
);
14953 if (identifier_p (function
)
14954 && !any_type_dependent_arguments_p (call_args
))
14956 if (koenig_p
&& (complain
& tf_warning_or_error
))
14958 /* For backwards compatibility and good diagnostics, try
14959 the unqualified lookup again if we aren't in SFINAE
14961 tree unq
= (tsubst_copy_and_build
14962 (function
, args
, complain
, in_decl
, true,
14963 integral_constant_expression_p
));
14964 if (unq
== error_mark_node
)
14965 RETURN (error_mark_node
);
14967 if (unq
!= function
)
14970 if (INDIRECT_REF_P (fn
))
14971 fn
= TREE_OPERAND (fn
, 0);
14972 if (TREE_CODE (fn
) == COMPONENT_REF
)
14973 fn
= TREE_OPERAND (fn
, 1);
14974 if (is_overloaded_fn (fn
))
14975 fn
= get_first_fn (fn
);
14976 if (permerror (EXPR_LOC_OR_LOC (t
, input_location
),
14977 "%qD was not declared in this scope, "
14978 "and no declarations were found by "
14979 "argument-dependent lookup at the point "
14980 "of instantiation", function
))
14983 /* Can't say anything more. */;
14984 else if (DECL_CLASS_SCOPE_P (fn
))
14986 location_t loc
= EXPR_LOC_OR_LOC (t
,
14989 "declarations in dependent base %qT are "
14990 "not found by unqualified lookup",
14991 DECL_CLASS_CONTEXT (fn
));
14992 if (current_class_ptr
)
14994 "use %<this->%D%> instead", function
);
14997 "use %<%T::%D%> instead",
14998 current_class_name
, function
);
15001 inform (0, "%q+D declared here, later in the "
15002 "translation unit", fn
);
15007 if (identifier_p (function
))
15009 if (complain
& tf_error
)
15010 unqualified_name_lookup_error (function
);
15011 release_tree_vector (call_args
);
15012 RETURN (error_mark_node
);
15016 /* Remember that there was a reference to this entity. */
15017 if (DECL_P (function
))
15018 mark_used (function
);
15020 /* Put back tf_decltype for the actual call. */
15021 complain
|= decltype_flag
;
15023 if (TREE_CODE (function
) == OFFSET_REF
)
15024 ret
= build_offset_ref_call_from_tree (function
, &call_args
,
15026 else if (TREE_CODE (function
) == COMPONENT_REF
)
15028 tree instance
= TREE_OPERAND (function
, 0);
15029 tree fn
= TREE_OPERAND (function
, 1);
15031 if (processing_template_decl
15032 && (type_dependent_expression_p (instance
)
15033 || (!BASELINK_P (fn
)
15034 && TREE_CODE (fn
) != FIELD_DECL
)
15035 || type_dependent_expression_p (fn
)
15036 || any_type_dependent_arguments_p (call_args
)))
15037 ret
= build_nt_call_vec (function
, call_args
);
15038 else if (!BASELINK_P (fn
))
15039 ret
= finish_call_expr (function
, &call_args
,
15040 /*disallow_virtual=*/false,
15041 /*koenig_p=*/false,
15044 ret
= (build_new_method_call
15046 &call_args
, NULL_TREE
,
15047 qualified_p
? LOOKUP_NONVIRTUAL
: LOOKUP_NORMAL
,
15052 ret
= finish_call_expr (function
, &call_args
,
15053 /*disallow_virtual=*/qualified_p
,
15057 release_tree_vector (call_args
);
15064 tree cond
= RECUR (TREE_OPERAND (t
, 0));
15067 if (TREE_CODE (cond
) == INTEGER_CST
)
15069 if (integer_zerop (cond
))
15071 ++c_inhibit_evaluation_warnings
;
15072 exp1
= RECUR (TREE_OPERAND (t
, 1));
15073 --c_inhibit_evaluation_warnings
;
15074 exp2
= RECUR (TREE_OPERAND (t
, 2));
15078 exp1
= RECUR (TREE_OPERAND (t
, 1));
15079 ++c_inhibit_evaluation_warnings
;
15080 exp2
= RECUR (TREE_OPERAND (t
, 2));
15081 --c_inhibit_evaluation_warnings
;
15086 exp1
= RECUR (TREE_OPERAND (t
, 1));
15087 exp2
= RECUR (TREE_OPERAND (t
, 2));
15090 RETURN (build_x_conditional_expr (EXPR_LOCATION (t
),
15091 cond
, exp1
, exp2
, complain
));
15094 case PSEUDO_DTOR_EXPR
:
15096 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15097 tree op1
= RECUR (TREE_OPERAND (t
, 1));
15098 tree op2
= tsubst (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
15099 RETURN (finish_pseudo_destructor_expr (op0
, op1
, op2
,
15105 tree purpose
, value
, chain
;
15107 if (t
== void_list_node
)
15110 if ((TREE_PURPOSE (t
) && PACK_EXPANSION_P (TREE_PURPOSE (t
)))
15111 || (TREE_VALUE (t
) && PACK_EXPANSION_P (TREE_VALUE (t
))))
15113 /* We have pack expansions, so expand those and
15114 create a new list out of it. */
15115 tree purposevec
= NULL_TREE
;
15116 tree valuevec
= NULL_TREE
;
15120 /* Expand the argument expressions. */
15121 if (TREE_PURPOSE (t
))
15122 purposevec
= tsubst_pack_expansion (TREE_PURPOSE (t
), args
,
15123 complain
, in_decl
);
15124 if (TREE_VALUE (t
))
15125 valuevec
= tsubst_pack_expansion (TREE_VALUE (t
), args
,
15126 complain
, in_decl
);
15128 /* Build the rest of the list. */
15129 chain
= TREE_CHAIN (t
);
15130 if (chain
&& chain
!= void_type_node
)
15131 chain
= RECUR (chain
);
15133 /* Determine the number of arguments. */
15134 if (purposevec
&& TREE_CODE (purposevec
) == TREE_VEC
)
15136 len
= TREE_VEC_LENGTH (purposevec
);
15137 gcc_assert (!valuevec
|| len
== TREE_VEC_LENGTH (valuevec
));
15139 else if (TREE_CODE (valuevec
) == TREE_VEC
)
15140 len
= TREE_VEC_LENGTH (valuevec
);
15143 /* Since we only performed a partial substitution into
15144 the argument pack, we only RETURN (a single list
15146 if (purposevec
== TREE_PURPOSE (t
)
15147 && valuevec
== TREE_VALUE (t
)
15148 && chain
== TREE_CHAIN (t
))
15151 RETURN (tree_cons (purposevec
, valuevec
, chain
));
15154 /* Convert the argument vectors into a TREE_LIST */
15158 /* Grab the Ith values. */
15160 purpose
= purposevec
? TREE_VEC_ELT (purposevec
, i
)
15163 = valuevec
? convert_from_reference (TREE_VEC_ELT (valuevec
, i
))
15166 /* Build the list (backwards). */
15167 chain
= tree_cons (purpose
, value
, chain
);
15173 purpose
= TREE_PURPOSE (t
);
15175 purpose
= RECUR (purpose
);
15176 value
= TREE_VALUE (t
);
15178 value
= RECUR (value
);
15179 chain
= TREE_CHAIN (t
);
15180 if (chain
&& chain
!= void_type_node
)
15181 chain
= RECUR (chain
);
15182 if (purpose
== TREE_PURPOSE (t
)
15183 && value
== TREE_VALUE (t
)
15184 && chain
== TREE_CHAIN (t
))
15186 RETURN (tree_cons (purpose
, value
, chain
));
15189 case COMPONENT_REF
:
15196 object
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
15197 args
, complain
, in_decl
);
15198 /* Remember that there was a reference to this entity. */
15199 if (DECL_P (object
))
15200 mark_used (object
);
15201 object_type
= TREE_TYPE (object
);
15203 member
= TREE_OPERAND (t
, 1);
15204 if (BASELINK_P (member
))
15205 member
= tsubst_baselink (member
,
15206 non_reference (TREE_TYPE (object
)),
15207 args
, complain
, in_decl
);
15209 member
= tsubst_copy (member
, args
, complain
, in_decl
);
15210 if (member
== error_mark_node
)
15211 RETURN (error_mark_node
);
15213 if (type_dependent_expression_p (object
))
15214 /* We can't do much here. */;
15215 else if (!CLASS_TYPE_P (object_type
))
15217 if (scalarish_type_p (object_type
))
15219 tree s
= NULL_TREE
;
15220 tree dtor
= member
;
15222 if (TREE_CODE (dtor
) == SCOPE_REF
)
15224 s
= TREE_OPERAND (dtor
, 0);
15225 dtor
= TREE_OPERAND (dtor
, 1);
15227 if (TREE_CODE (dtor
) == BIT_NOT_EXPR
)
15229 dtor
= TREE_OPERAND (dtor
, 0);
15231 RETURN (finish_pseudo_destructor_expr
15232 (object
, s
, dtor
, input_location
));
15236 else if (TREE_CODE (member
) == SCOPE_REF
15237 && TREE_CODE (TREE_OPERAND (member
, 1)) == TEMPLATE_ID_EXPR
)
15239 /* Lookup the template functions now that we know what the
15241 tree scope
= TREE_OPERAND (member
, 0);
15242 tree tmpl
= TREE_OPERAND (TREE_OPERAND (member
, 1), 0);
15243 tree args
= TREE_OPERAND (TREE_OPERAND (member
, 1), 1);
15244 member
= lookup_qualified_name (scope
, tmpl
,
15245 /*is_type_p=*/false,
15246 /*complain=*/false);
15247 if (BASELINK_P (member
))
15249 BASELINK_FUNCTIONS (member
)
15250 = build_nt (TEMPLATE_ID_EXPR
, BASELINK_FUNCTIONS (member
),
15252 member
= (adjust_result_of_qualified_name_lookup
15253 (member
, BINFO_TYPE (BASELINK_BINFO (member
)),
15258 qualified_name_lookup_error (scope
, tmpl
, member
,
15260 RETURN (error_mark_node
);
15263 else if (TREE_CODE (member
) == SCOPE_REF
15264 && !CLASS_TYPE_P (TREE_OPERAND (member
, 0))
15265 && TREE_CODE (TREE_OPERAND (member
, 0)) != NAMESPACE_DECL
)
15267 if (complain
& tf_error
)
15269 if (TYPE_P (TREE_OPERAND (member
, 0)))
15270 error ("%qT is not a class or namespace",
15271 TREE_OPERAND (member
, 0));
15273 error ("%qD is not a class or namespace",
15274 TREE_OPERAND (member
, 0));
15276 RETURN (error_mark_node
);
15278 else if (TREE_CODE (member
) == FIELD_DECL
)
15280 r
= finish_non_static_data_member (member
, object
, NULL_TREE
);
15281 if (TREE_CODE (r
) == COMPONENT_REF
)
15282 REF_PARENTHESIZED_P (r
) = REF_PARENTHESIZED_P (t
);
15286 r
= finish_class_member_access_expr (object
, member
,
15287 /*template_p=*/false,
15289 if (TREE_CODE (r
) == COMPONENT_REF
)
15290 REF_PARENTHESIZED_P (r
) = REF_PARENTHESIZED_P (t
);
15295 RETURN (build_throw
15296 (RECUR (TREE_OPERAND (t
, 0))));
15300 vec
<constructor_elt
, va_gc
> *n
;
15301 constructor_elt
*ce
;
15302 unsigned HOST_WIDE_INT idx
;
15303 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15304 bool process_index_p
;
15306 bool need_copy_p
= false;
15309 if (type
== error_mark_node
)
15310 RETURN (error_mark_node
);
15312 /* digest_init will do the wrong thing if we let it. */
15313 if (type
&& TYPE_PTRMEMFUNC_P (type
))
15316 /* We do not want to process the index of aggregate
15317 initializers as they are identifier nodes which will be
15318 looked up by digest_init. */
15319 process_index_p
= !(type
&& MAYBE_CLASS_TYPE_P (type
));
15321 n
= vec_safe_copy (CONSTRUCTOR_ELTS (t
));
15322 newlen
= vec_safe_length (n
);
15323 FOR_EACH_VEC_SAFE_ELT (n
, idx
, ce
)
15325 if (ce
->index
&& process_index_p
15326 /* An identifier index is looked up in the type
15327 being initialized, not the current scope. */
15328 && TREE_CODE (ce
->index
) != IDENTIFIER_NODE
)
15329 ce
->index
= RECUR (ce
->index
);
15331 if (PACK_EXPANSION_P (ce
->value
))
15333 /* Substitute into the pack expansion. */
15334 ce
->value
= tsubst_pack_expansion (ce
->value
, args
, complain
,
15337 if (ce
->value
== error_mark_node
15338 || PACK_EXPANSION_P (ce
->value
))
15340 else if (TREE_VEC_LENGTH (ce
->value
) == 1)
15341 /* Just move the argument into place. */
15342 ce
->value
= TREE_VEC_ELT (ce
->value
, 0);
15345 /* Update the length of the final CONSTRUCTOR
15346 arguments vector, and note that we will need to
15348 newlen
= newlen
+ TREE_VEC_LENGTH (ce
->value
) - 1;
15349 need_copy_p
= true;
15353 ce
->value
= RECUR (ce
->value
);
15358 vec
<constructor_elt
, va_gc
> *old_n
= n
;
15360 vec_alloc (n
, newlen
);
15361 FOR_EACH_VEC_ELT (*old_n
, idx
, ce
)
15363 if (TREE_CODE (ce
->value
) == TREE_VEC
)
15365 int i
, len
= TREE_VEC_LENGTH (ce
->value
);
15366 for (i
= 0; i
< len
; ++i
)
15367 CONSTRUCTOR_APPEND_ELT (n
, 0,
15368 TREE_VEC_ELT (ce
->value
, i
));
15371 CONSTRUCTOR_APPEND_ELT (n
, 0, ce
->value
);
15375 r
= build_constructor (init_list_type_node
, n
);
15376 CONSTRUCTOR_IS_DIRECT_INIT (r
) = CONSTRUCTOR_IS_DIRECT_INIT (t
);
15378 if (TREE_HAS_CONSTRUCTOR (t
))
15379 RETURN (finish_compound_literal (type
, r
, complain
));
15381 TREE_TYPE (r
) = type
;
15387 tree operand_0
= TREE_OPERAND (t
, 0);
15388 if (TYPE_P (operand_0
))
15390 operand_0
= tsubst (operand_0
, args
, complain
, in_decl
);
15391 RETURN (get_typeid (operand_0
, complain
));
15395 operand_0
= RECUR (operand_0
);
15396 RETURN (build_typeid (operand_0
, complain
));
15403 else if (DECL_PACK_P (t
))
15405 /* We don't build decls for an instantiation of a
15406 variadic capture proxy, we instantiate the elements
15408 gcc_assert (DECL_HAS_VALUE_EXPR_P (t
));
15409 return RECUR (DECL_VALUE_EXPR (t
));
15415 tree r
= tsubst_copy (t
, args
, complain
, in_decl
);
15417 && !processing_template_decl
15418 && !cp_unevaluated_operand
15419 && (TREE_STATIC (r
) || DECL_EXTERNAL (r
))
15420 && DECL_THREAD_LOCAL_P (r
))
15422 if (tree wrap
= get_tls_wrapper_fn (r
))
15423 /* Replace an evaluated use of the thread_local variable with
15424 a call to its wrapper. */
15425 r
= build_cxx_call (wrap
, 0, NULL
, tf_warning_or_error
);
15428 if (TREE_CODE (TREE_TYPE (t
)) != REFERENCE_TYPE
)
15429 /* If the original type was a reference, we'll be wrapped in
15430 the appropriate INDIRECT_REF. */
15431 r
= convert_from_reference (r
);
15437 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15438 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15439 RETURN (build_x_va_arg (EXPR_LOCATION (t
), op0
, type
));
15442 case OFFSETOF_EXPR
:
15443 RETURN (finish_offsetof (RECUR (TREE_OPERAND (t
, 0))));
15447 tree type1
= tsubst (TRAIT_EXPR_TYPE1 (t
), args
,
15448 complain
, in_decl
);
15450 tree type2
= TRAIT_EXPR_TYPE2 (t
);
15452 type2
= tsubst (type2
, args
, complain
, in_decl
);
15454 RETURN (finish_trait_expr (TRAIT_EXPR_KIND (t
), type1
, type2
));
15459 tree old_stmt_expr
= cur_stmt_expr
;
15460 tree stmt_expr
= begin_stmt_expr ();
15462 cur_stmt_expr
= stmt_expr
;
15463 tsubst_expr (STMT_EXPR_STMT (t
), args
, complain
, in_decl
,
15464 integral_constant_expression_p
);
15465 stmt_expr
= finish_stmt_expr (stmt_expr
, false);
15466 cur_stmt_expr
= old_stmt_expr
;
15468 /* If the resulting list of expression statement is empty,
15469 fold it further into void_node. */
15470 if (empty_expr_stmt_p (stmt_expr
))
15471 stmt_expr
= void_node
;
15473 RETURN (stmt_expr
);
15478 tree r
= build_lambda_expr ();
15480 tree type
= tsubst (LAMBDA_EXPR_CLOSURE (t
), args
, complain
, NULL_TREE
);
15481 LAMBDA_EXPR_CLOSURE (r
) = type
;
15482 CLASSTYPE_LAMBDA_EXPR (type
) = r
;
15484 LAMBDA_EXPR_LOCATION (r
)
15485 = LAMBDA_EXPR_LOCATION (t
);
15486 LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (r
)
15487 = LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (t
);
15488 LAMBDA_EXPR_MUTABLE_P (r
) = LAMBDA_EXPR_MUTABLE_P (t
);
15489 LAMBDA_EXPR_DISCRIMINATOR (r
)
15490 = (LAMBDA_EXPR_DISCRIMINATOR (t
));
15491 /* For a function scope, we want to use tsubst so that we don't
15492 complain about referring to an auto function before its return
15493 type has been deduced. Otherwise, we want to use tsubst_copy so
15494 that we look up the existing field/parameter/variable rather
15495 than build a new one. */
15496 tree scope
= LAMBDA_EXPR_EXTRA_SCOPE (t
);
15497 if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
)
15498 scope
= tsubst (scope
, args
, complain
, in_decl
);
15499 else if (scope
&& TREE_CODE (scope
) == PARM_DECL
)
15501 /* Look up the parameter we want directly, as tsubst_copy
15502 doesn't do what we need. */
15503 tree fn
= tsubst (DECL_CONTEXT (scope
), args
, complain
, in_decl
);
15504 tree parm
= FUNCTION_FIRST_USER_PARM (fn
);
15505 while (DECL_PARM_INDEX (parm
) != DECL_PARM_INDEX (scope
))
15506 parm
= DECL_CHAIN (parm
);
15508 /* FIXME Work around the parm not having DECL_CONTEXT set. */
15509 if (DECL_CONTEXT (scope
) == NULL_TREE
)
15510 DECL_CONTEXT (scope
) = fn
;
15513 scope
= RECUR (scope
);
15514 LAMBDA_EXPR_EXTRA_SCOPE (r
) = scope
;
15515 LAMBDA_EXPR_RETURN_TYPE (r
)
15516 = tsubst (LAMBDA_EXPR_RETURN_TYPE (t
), args
, complain
, in_decl
);
15518 gcc_assert (LAMBDA_EXPR_THIS_CAPTURE (t
) == NULL_TREE
15519 && LAMBDA_EXPR_PENDING_PROXIES (t
) == NULL
);
15521 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
15522 determine_visibility (TYPE_NAME (type
));
15523 /* Now that we know visibility, instantiate the type so we have a
15524 declaration of the op() for later calls to lambda_function. */
15525 complete_type (type
);
15527 LAMBDA_EXPR_THIS_CAPTURE (r
) = NULL_TREE
;
15529 RETURN (build_lambda_object (r
));
15533 /* We can get here for a constant initializer of non-dependent type.
15534 FIXME stop folding in cp_parser_initializer_clause. */
15536 tree r
= get_target_expr_sfinae (RECUR (TARGET_EXPR_INITIAL (t
)),
15541 case TRANSACTION_EXPR
:
15542 RETURN (tsubst_expr(t
, args
, complain
, in_decl
,
15543 integral_constant_expression_p
));
15546 RETURN (finish_parenthesized_expr (RECUR (TREE_OPERAND (t
, 0))));
15548 case VEC_PERM_EXPR
:
15550 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15551 tree op1
= RECUR (TREE_OPERAND (t
, 1));
15552 tree op2
= RECUR (TREE_OPERAND (t
, 2));
15553 RETURN (build_x_vec_perm_expr (input_location
, op0
, op1
, op2
,
15558 /* Handle Objective-C++ constructs, if appropriate. */
15561 = objcp_tsubst_copy_and_build (t
, args
, complain
,
15562 in_decl
, /*function_p=*/false);
15566 RETURN (tsubst_copy (t
, args
, complain
, in_decl
));
15572 input_location
= loc
;
15576 /* Verify that the instantiated ARGS are valid. For type arguments,
15577 make sure that the type's linkage is ok. For non-type arguments,
15578 make sure they are constants if they are integral or enumerations.
15579 Emit an error under control of COMPLAIN, and return TRUE on error. */
15582 check_instantiated_arg (tree tmpl
, tree t
, tsubst_flags_t complain
)
15584 if (dependent_template_arg_p (t
))
15586 if (ARGUMENT_PACK_P (t
))
15588 tree vec
= ARGUMENT_PACK_ARGS (t
);
15589 int len
= TREE_VEC_LENGTH (vec
);
15590 bool result
= false;
15593 for (i
= 0; i
< len
; ++i
)
15594 if (check_instantiated_arg (tmpl
, TREE_VEC_ELT (vec
, i
), complain
))
15598 else if (TYPE_P (t
))
15600 /* [basic.link]: A name with no linkage (notably, the name
15601 of a class or enumeration declared in a local scope)
15602 shall not be used to declare an entity with linkage.
15603 This implies that names with no linkage cannot be used as
15606 DR 757 relaxes this restriction for C++0x. */
15607 tree nt
= (cxx_dialect
> cxx98
? NULL_TREE
15608 : no_linkage_check (t
, /*relaxed_p=*/false));
15612 /* DR 488 makes use of a type with no linkage cause
15613 type deduction to fail. */
15614 if (complain
& tf_error
)
15616 if (TYPE_ANONYMOUS_P (nt
))
15617 error ("%qT is/uses anonymous type", t
);
15619 error ("template argument for %qD uses local type %qT",
15624 /* In order to avoid all sorts of complications, we do not
15625 allow variably-modified types as template arguments. */
15626 else if (variably_modified_type_p (t
, NULL_TREE
))
15628 if (complain
& tf_error
)
15629 error ("%qT is a variably modified type", t
);
15633 /* Class template and alias template arguments should be OK. */
15634 else if (DECL_TYPE_TEMPLATE_P (t
))
15636 /* A non-type argument of integral or enumerated type must be a
15638 else if (TREE_TYPE (t
)
15639 && INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (t
))
15640 && !TREE_CONSTANT (t
))
15642 if (complain
& tf_error
)
15643 error ("integral expression %qE is not constant", t
);
15650 check_instantiated_args (tree tmpl
, tree args
, tsubst_flags_t complain
)
15652 int ix
, len
= DECL_NTPARMS (tmpl
);
15653 bool result
= false;
15655 for (ix
= 0; ix
!= len
; ix
++)
15657 if (check_instantiated_arg (tmpl
, TREE_VEC_ELT (args
, ix
), complain
))
15660 if (result
&& (complain
& tf_error
))
15661 error (" trying to instantiate %qD", tmpl
);
15665 /* We're out of SFINAE context now, so generate diagnostics for the access
15666 errors we saw earlier when instantiating D from TMPL and ARGS. */
15669 recheck_decl_substitution (tree d
, tree tmpl
, tree args
)
15671 tree pattern
= DECL_TEMPLATE_RESULT (tmpl
);
15672 tree type
= TREE_TYPE (pattern
);
15673 location_t loc
= input_location
;
15675 push_access_scope (d
);
15676 push_deferring_access_checks (dk_no_deferred
);
15677 input_location
= DECL_SOURCE_LOCATION (pattern
);
15678 tsubst (type
, args
, tf_warning_or_error
, d
);
15679 input_location
= loc
;
15680 pop_deferring_access_checks ();
15681 pop_access_scope (d
);
15684 /* Instantiate the indicated variable, function, or alias template TMPL with
15685 the template arguments in TARG_PTR. */
15688 instantiate_template_1 (tree tmpl
, tree orig_args
, tsubst_flags_t complain
)
15690 tree targ_ptr
= orig_args
;
15694 bool access_ok
= true;
15696 if (tmpl
== error_mark_node
)
15697 return error_mark_node
;
15699 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
);
15701 /* If this function is a clone, handle it specially. */
15702 if (DECL_CLONED_FUNCTION_P (tmpl
))
15707 /* Use DECL_ABSTRACT_ORIGIN because only FUNCTION_DECLs have
15708 DECL_CLONED_FUNCTION. */
15709 spec
= instantiate_template (DECL_ABSTRACT_ORIGIN (tmpl
),
15710 targ_ptr
, complain
);
15711 if (spec
== error_mark_node
)
15712 return error_mark_node
;
15714 /* Look for the clone. */
15715 FOR_EACH_CLONE (clone
, spec
)
15716 if (DECL_NAME (clone
) == DECL_NAME (tmpl
))
15718 /* We should always have found the clone by now. */
15719 gcc_unreachable ();
15723 if (targ_ptr
== error_mark_node
)
15724 return error_mark_node
;
15726 /* Check to see if we already have this specialization. */
15727 gen_tmpl
= most_general_template (tmpl
);
15728 if (tmpl
!= gen_tmpl
)
15729 /* The TMPL is a partial instantiation. To get a full set of
15730 arguments we must add the arguments used to perform the
15731 partial instantiation. */
15732 targ_ptr
= add_outermost_template_args (DECL_TI_ARGS (tmpl
),
15735 /* It would be nice to avoid hashing here and then again in tsubst_decl,
15736 but it doesn't seem to be on the hot path. */
15737 spec
= retrieve_specialization (gen_tmpl
, targ_ptr
, 0);
15739 gcc_assert (tmpl
== gen_tmpl
15740 || ((fndecl
= retrieve_specialization (tmpl
, orig_args
, 0))
15742 || fndecl
== NULL_TREE
);
15744 if (spec
!= NULL_TREE
)
15746 if (FNDECL_HAS_ACCESS_ERRORS (spec
))
15748 if (complain
& tf_error
)
15749 recheck_decl_substitution (spec
, gen_tmpl
, targ_ptr
);
15750 return error_mark_node
;
15755 if (check_instantiated_args (gen_tmpl
, INNERMOST_TEMPLATE_ARGS (targ_ptr
),
15757 return error_mark_node
;
15759 /* We are building a FUNCTION_DECL, during which the access of its
15760 parameters and return types have to be checked. However this
15761 FUNCTION_DECL which is the desired context for access checking
15762 is not built yet. We solve this chicken-and-egg problem by
15763 deferring all checks until we have the FUNCTION_DECL. */
15764 push_deferring_access_checks (dk_deferred
);
15766 /* Instantiation of the function happens in the context of the function
15767 template, not the context of the overload resolution we're doing. */
15768 push_to_top_level ();
15769 /* If there are dependent arguments, e.g. because we're doing partial
15770 ordering, make sure processing_template_decl stays set. */
15771 if (uses_template_parms (targ_ptr
))
15772 ++processing_template_decl
;
15773 if (DECL_CLASS_SCOPE_P (gen_tmpl
))
15775 tree ctx
= tsubst (DECL_CONTEXT (gen_tmpl
), targ_ptr
,
15776 complain
, gen_tmpl
);
15777 push_nested_class (ctx
);
15779 /* Substitute template parameters to obtain the specialization. */
15780 fndecl
= tsubst (DECL_TEMPLATE_RESULT (gen_tmpl
),
15781 targ_ptr
, complain
, gen_tmpl
);
15782 if (DECL_CLASS_SCOPE_P (gen_tmpl
))
15783 pop_nested_class ();
15784 pop_from_top_level ();
15786 if (fndecl
== error_mark_node
)
15788 pop_deferring_access_checks ();
15789 return error_mark_node
;
15792 /* The DECL_TI_TEMPLATE should always be the immediate parent
15793 template, not the most general template. */
15794 DECL_TI_TEMPLATE (fndecl
) = tmpl
;
15796 /* Now we know the specialization, compute access previously
15798 push_access_scope (fndecl
);
15799 if (!perform_deferred_access_checks (complain
))
15801 pop_access_scope (fndecl
);
15802 pop_deferring_access_checks ();
15804 /* If we've just instantiated the main entry point for a function,
15805 instantiate all the alternate entry points as well. We do this
15806 by cloning the instantiation of the main entry point, not by
15807 instantiating the template clones. */
15808 if (DECL_CHAIN (gen_tmpl
) && DECL_CLONED_FUNCTION_P (DECL_CHAIN (gen_tmpl
)))
15809 clone_function_decl (fndecl
, /*update_method_vec_p=*/0);
15813 if (!(complain
& tf_error
))
15815 /* Remember to reinstantiate when we're out of SFINAE so the user
15816 can see the errors. */
15817 FNDECL_HAS_ACCESS_ERRORS (fndecl
) = true;
15819 return error_mark_node
;
15824 /* Wrapper for instantiate_template_1. */
15827 instantiate_template (tree tmpl
, tree orig_args
, tsubst_flags_t complain
)
15830 timevar_push (TV_TEMPLATE_INST
);
15831 ret
= instantiate_template_1 (tmpl
, orig_args
, complain
);
15832 timevar_pop (TV_TEMPLATE_INST
);
15836 /* Instantiate the alias template TMPL with ARGS. Also push a template
15837 instantiation level, which instantiate_template doesn't do because
15838 functions and variables have sufficient context established by the
15842 instantiate_alias_template (tree tmpl
, tree args
, tsubst_flags_t complain
)
15844 struct pending_template
*old_last_pend
= last_pending_template
;
15845 struct tinst_level
*old_error_tinst
= last_error_tinst_level
;
15846 if (tmpl
== error_mark_node
|| args
== error_mark_node
)
15847 return error_mark_node
;
15848 tree tinst
= build_tree_list (tmpl
, args
);
15849 if (!push_tinst_level (tinst
))
15852 return error_mark_node
;
15856 coerce_innermost_template_parms (DECL_TEMPLATE_PARMS (tmpl
),
15857 args
, tmpl
, complain
,
15858 /*require_all_args=*/true,
15859 /*use_default_args=*/true);
15861 tree r
= instantiate_template (tmpl
, args
, complain
);
15862 pop_tinst_level ();
15863 /* We can't free this if a pending_template entry or last_error_tinst_level
15864 is pointing at it. */
15865 if (last_pending_template
== old_last_pend
15866 && last_error_tinst_level
== old_error_tinst
)
15872 /* PARM is a template parameter pack for FN. Returns true iff
15873 PARM is used in a deducible way in the argument list of FN. */
15876 pack_deducible_p (tree parm
, tree fn
)
15878 tree t
= FUNCTION_FIRST_USER_PARMTYPE (fn
);
15879 for (; t
; t
= TREE_CHAIN (t
))
15881 tree type
= TREE_VALUE (t
);
15883 if (!PACK_EXPANSION_P (type
))
15885 for (packs
= PACK_EXPANSION_PARAMETER_PACKS (type
);
15886 packs
; packs
= TREE_CHAIN (packs
))
15887 if (template_args_equal (TREE_VALUE (packs
), parm
))
15889 /* The template parameter pack is used in a function parameter
15890 pack. If this is the end of the parameter list, the
15891 template parameter pack is deducible. */
15892 if (TREE_CHAIN (t
) == void_list_node
)
15895 /* Otherwise, not. Well, it could be deduced from
15896 a non-pack parameter, but doing so would end up with
15897 a deduction mismatch, so don't bother. */
15901 /* The template parameter pack isn't used in any function parameter
15902 packs, but it might be used deeper, e.g. tuple<Args...>. */
15906 /* The FN is a TEMPLATE_DECL for a function. ARGS is an array with
15907 NARGS elements of the arguments that are being used when calling
15908 it. TARGS is a vector into which the deduced template arguments
15911 Returns either a FUNCTION_DECL for the matching specialization of FN or
15912 NULL_TREE if no suitable specialization can be found. If EXPLAIN_P is
15913 true, diagnostics will be printed to explain why it failed.
15915 If FN is a conversion operator, or we are trying to produce a specific
15916 specialization, RETURN_TYPE is the return type desired.
15918 The EXPLICIT_TARGS are explicit template arguments provided via a
15921 The parameter STRICT is one of:
15924 We are deducing arguments for a function call, as in
15925 [temp.deduct.call].
15928 We are deducing arguments for a conversion function, as in
15929 [temp.deduct.conv].
15932 We are deducing arguments when doing an explicit instantiation
15933 as in [temp.explicit], when determining an explicit specialization
15934 as in [temp.expl.spec], or when taking the address of a function
15935 template, as in [temp.deduct.funcaddr]. */
15938 fn_type_unification (tree fn
,
15939 tree explicit_targs
,
15942 unsigned int nargs
,
15944 unification_kind_t strict
,
15951 tree decl
= NULL_TREE
;
15952 tsubst_flags_t complain
= (explain_p
? tf_warning_or_error
: tf_none
);
15954 static int deduction_depth
;
15955 struct pending_template
*old_last_pend
= last_pending_template
;
15956 struct tinst_level
*old_error_tinst
= last_error_tinst_level
;
15957 tree tparms
= DECL_INNERMOST_TEMPLATE_PARMS (fn
);
15959 tree r
= error_mark_node
;
15962 complain
|= tf_decltype
;
15964 /* In C++0x, it's possible to have a function template whose type depends
15965 on itself recursively. This is most obvious with decltype, but can also
15966 occur with enumeration scope (c++/48969). So we need to catch infinite
15967 recursion and reject the substitution at deduction time; this function
15968 will return error_mark_node for any repeated substitution.
15970 This also catches excessive recursion such as when f<N> depends on
15971 f<N-1> across all integers, and returns error_mark_node for all the
15972 substitutions back up to the initial one.
15974 This is, of course, not reentrant. */
15975 if (excessive_deduction_depth
)
15976 return error_mark_node
;
15977 tinst
= build_tree_list (fn
, NULL_TREE
);
15980 gcc_assert (TREE_CODE (fn
) == TEMPLATE_DECL
);
15982 fntype
= TREE_TYPE (fn
);
15983 if (explicit_targs
)
15987 The specified template arguments must match the template
15988 parameters in kind (i.e., type, nontype, template), and there
15989 must not be more arguments than there are parameters;
15990 otherwise type deduction fails.
15992 Nontype arguments must match the types of the corresponding
15993 nontype template parameters, or must be convertible to the
15994 types of the corresponding nontype parameters as specified in
15995 _temp.arg.nontype_, otherwise type deduction fails.
15997 All references in the function type of the function template
15998 to the corresponding template parameters are replaced by the
15999 specified template argument values. If a substitution in a
16000 template parameter or in the function type of the function
16001 template results in an invalid type, type deduction fails. */
16002 int i
, len
= TREE_VEC_LENGTH (tparms
);
16003 location_t loc
= input_location
;
16004 bool incomplete
= false;
16006 /* Adjust any explicit template arguments before entering the
16007 substitution context. */
16009 = (coerce_template_parms (tparms
, explicit_targs
, NULL_TREE
,
16011 /*require_all_args=*/false,
16012 /*use_default_args=*/false));
16013 if (explicit_targs
== error_mark_node
)
16016 /* Substitute the explicit args into the function type. This is
16017 necessary so that, for instance, explicitly declared function
16018 arguments can match null pointed constants. If we were given
16019 an incomplete set of explicit args, we must not do semantic
16020 processing during substitution as we could create partial
16022 for (i
= 0; i
< len
; i
++)
16024 tree parm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
16025 bool parameter_pack
= false;
16026 tree targ
= TREE_VEC_ELT (explicit_targs
, i
);
16028 /* Dig out the actual parm. */
16029 if (TREE_CODE (parm
) == TYPE_DECL
16030 || TREE_CODE (parm
) == TEMPLATE_DECL
)
16032 parm
= TREE_TYPE (parm
);
16033 parameter_pack
= TEMPLATE_TYPE_PARAMETER_PACK (parm
);
16035 else if (TREE_CODE (parm
) == PARM_DECL
)
16037 parm
= DECL_INITIAL (parm
);
16038 parameter_pack
= TEMPLATE_PARM_PARAMETER_PACK (parm
);
16041 if (!parameter_pack
&& targ
== NULL_TREE
)
16042 /* No explicit argument for this template parameter. */
16045 if (parameter_pack
&& pack_deducible_p (parm
, fn
))
16047 /* Mark the argument pack as "incomplete". We could
16048 still deduce more arguments during unification.
16049 We remove this mark in type_unification_real. */
16052 ARGUMENT_PACK_INCOMPLETE_P(targ
) = 1;
16053 ARGUMENT_PACK_EXPLICIT_ARGS (targ
)
16054 = ARGUMENT_PACK_ARGS (targ
);
16057 /* We have some incomplete argument packs. */
16062 TREE_VALUE (tinst
) = explicit_targs
;
16063 if (!push_tinst_level (tinst
))
16065 excessive_deduction_depth
= true;
16068 processing_template_decl
+= incomplete
;
16069 input_location
= DECL_SOURCE_LOCATION (fn
);
16070 /* Ignore any access checks; we'll see them again in
16071 instantiate_template and they might have the wrong
16072 access path at this point. */
16073 push_deferring_access_checks (dk_deferred
);
16074 fntype
= tsubst (TREE_TYPE (fn
), explicit_targs
,
16075 complain
| tf_partial
, NULL_TREE
);
16076 pop_deferring_access_checks ();
16077 input_location
= loc
;
16078 processing_template_decl
-= incomplete
;
16079 pop_tinst_level ();
16081 if (fntype
== error_mark_node
)
16084 /* Place the explicitly specified arguments in TARGS. */
16085 for (i
= NUM_TMPL_ARGS (explicit_targs
); i
--;)
16086 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (explicit_targs
, i
);
16089 /* Never do unification on the 'this' parameter. */
16090 parms
= skip_artificial_parms_for (fn
, TYPE_ARG_TYPES (fntype
));
16096 parms
= tree_cons (NULL_TREE
, TREE_TYPE (fntype
), parms
);
16097 new_args
= XALLOCAVEC (tree
, nargs
+ 1);
16098 new_args
[0] = return_type
;
16099 memcpy (new_args
+ 1, args
, nargs
* sizeof (tree
));
16104 /* We allow incomplete unification without an error message here
16105 because the standard doesn't seem to explicitly prohibit it. Our
16106 callers must be ready to deal with unification failures in any
16109 TREE_VALUE (tinst
) = targs
;
16110 /* If we aren't explaining yet, push tinst context so we can see where
16111 any errors (e.g. from class instantiations triggered by instantiation
16112 of default template arguments) come from. If we are explaining, this
16113 context is redundant. */
16114 if (!explain_p
&& !push_tinst_level (tinst
))
16116 excessive_deduction_depth
= true;
16120 /* type_unification_real will pass back any access checks from default
16121 template argument substitution. */
16122 vec
<deferred_access_check
, va_gc
> *checks
;
16125 ok
= !type_unification_real (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
16126 targs
, parms
, args
, nargs
, /*subr=*/0,
16127 strict
, flags
, &checks
, explain_p
);
16129 pop_tinst_level ();
16133 /* Now that we have bindings for all of the template arguments,
16134 ensure that the arguments deduced for the template template
16135 parameters have compatible template parameter lists. We cannot
16136 check this property before we have deduced all template
16137 arguments, because the template parameter types of a template
16138 template parameter might depend on prior template parameters
16139 deduced after the template template parameter. The following
16140 ill-formed example illustrates this issue:
16142 template<typename T, template<T> class C> void f(C<5>, T);
16144 template<int N> struct X {};
16147 f(X<5>(), 5l); // error: template argument deduction fails
16150 The template parameter list of 'C' depends on the template type
16151 parameter 'T', but 'C' is deduced to 'X' before 'T' is deduced to
16152 'long'. Thus, we can't check that 'C' cannot bind to 'X' at the
16153 time that we deduce 'C'. */
16154 if (!template_template_parm_bindings_ok_p
16155 (DECL_INNERMOST_TEMPLATE_PARMS (fn
), targs
))
16157 unify_inconsistent_template_template_parameters (explain_p
);
16161 /* All is well so far. Now, check:
16165 When all template arguments have been deduced, all uses of
16166 template parameters in nondeduced contexts are replaced with
16167 the corresponding deduced argument values. If the
16168 substitution results in an invalid type, as described above,
16169 type deduction fails. */
16170 TREE_VALUE (tinst
) = targs
;
16171 if (!push_tinst_level (tinst
))
16173 excessive_deduction_depth
= true;
16177 /* Also collect access checks from the instantiation. */
16178 reopen_deferring_access_checks (checks
);
16180 decl
= instantiate_template (fn
, targs
, complain
);
16182 checks
= get_deferred_access_checks ();
16183 pop_deferring_access_checks ();
16185 pop_tinst_level ();
16187 if (decl
== error_mark_node
)
16190 /* Now perform any access checks encountered during substitution. */
16191 push_access_scope (decl
);
16192 ok
= perform_access_checks (checks
, complain
);
16193 pop_access_scope (decl
);
16197 /* If we're looking for an exact match, check that what we got
16198 is indeed an exact match. It might not be if some template
16199 parameters are used in non-deduced contexts. But don't check
16200 for an exact match if we have dependent template arguments;
16201 in that case we're doing partial ordering, and we already know
16202 that we have two candidates that will provide the actual type. */
16203 if (strict
== DEDUCE_EXACT
&& !any_dependent_template_arguments_p (targs
))
16205 tree substed
= TREE_TYPE (decl
);
16209 = skip_artificial_parms_for (decl
, TYPE_ARG_TYPES (substed
));
16211 sarg
= tree_cons (NULL_TREE
, TREE_TYPE (substed
), sarg
);
16212 for (i
= 0; i
< nargs
&& sarg
; ++i
, sarg
= TREE_CHAIN (sarg
))
16213 if (!same_type_p (args
[i
], TREE_VALUE (sarg
)))
16215 unify_type_mismatch (explain_p
, args
[i
],
16216 TREE_VALUE (sarg
));
16225 if (excessive_deduction_depth
)
16227 if (deduction_depth
== 0)
16228 /* Reset once we're all the way out. */
16229 excessive_deduction_depth
= false;
16232 /* We can't free this if a pending_template entry or last_error_tinst_level
16233 is pointing at it. */
16234 if (last_pending_template
== old_last_pend
16235 && last_error_tinst_level
== old_error_tinst
)
16241 /* Adjust types before performing type deduction, as described in
16242 [temp.deduct.call] and [temp.deduct.conv]. The rules in these two
16243 sections are symmetric. PARM is the type of a function parameter
16244 or the return type of the conversion function. ARG is the type of
16245 the argument passed to the call, or the type of the value
16246 initialized with the result of the conversion function.
16247 ARG_EXPR is the original argument expression, which may be null. */
16250 maybe_adjust_types_for_deduction (unification_kind_t strict
,
16264 /* Swap PARM and ARG throughout the remainder of this
16265 function; the handling is precisely symmetric since PARM
16266 will initialize ARG rather than vice versa. */
16274 /* Core issue #873: Do the DR606 thing (see below) for these cases,
16275 too, but here handle it by stripping the reference from PARM
16276 rather than by adding it to ARG. */
16277 if (TREE_CODE (*parm
) == REFERENCE_TYPE
16278 && TYPE_REF_IS_RVALUE (*parm
)
16279 && TREE_CODE (TREE_TYPE (*parm
)) == TEMPLATE_TYPE_PARM
16280 && cp_type_quals (TREE_TYPE (*parm
)) == TYPE_UNQUALIFIED
16281 && TREE_CODE (*arg
) == REFERENCE_TYPE
16282 && !TYPE_REF_IS_RVALUE (*arg
))
16283 *parm
= TREE_TYPE (*parm
);
16284 /* Nothing else to do in this case. */
16288 gcc_unreachable ();
16291 if (TREE_CODE (*parm
) != REFERENCE_TYPE
)
16293 /* [temp.deduct.call]
16295 If P is not a reference type:
16297 --If A is an array type, the pointer type produced by the
16298 array-to-pointer standard conversion (_conv.array_) is
16299 used in place of A for type deduction; otherwise,
16301 --If A is a function type, the pointer type produced by
16302 the function-to-pointer standard conversion
16303 (_conv.func_) is used in place of A for type deduction;
16306 --If A is a cv-qualified type, the top level
16307 cv-qualifiers of A's type are ignored for type
16309 if (TREE_CODE (*arg
) == ARRAY_TYPE
)
16310 *arg
= build_pointer_type (TREE_TYPE (*arg
));
16311 else if (TREE_CODE (*arg
) == FUNCTION_TYPE
)
16312 *arg
= build_pointer_type (*arg
);
16314 *arg
= TYPE_MAIN_VARIANT (*arg
);
16317 /* From C++0x [14.8.2.1/3 temp.deduct.call] (after DR606), "If P is
16318 of the form T&&, where T is a template parameter, and the argument
16319 is an lvalue, T is deduced as A& */
16320 if (TREE_CODE (*parm
) == REFERENCE_TYPE
16321 && TYPE_REF_IS_RVALUE (*parm
)
16322 && TREE_CODE (TREE_TYPE (*parm
)) == TEMPLATE_TYPE_PARM
16323 && cp_type_quals (TREE_TYPE (*parm
)) == TYPE_UNQUALIFIED
16324 && (arg_expr
? real_lvalue_p (arg_expr
)
16325 /* try_one_overload doesn't provide an arg_expr, but
16326 functions are always lvalues. */
16327 : TREE_CODE (*arg
) == FUNCTION_TYPE
))
16328 *arg
= build_reference_type (*arg
);
16330 /* [temp.deduct.call]
16332 If P is a cv-qualified type, the top level cv-qualifiers
16333 of P's type are ignored for type deduction. If P is a
16334 reference type, the type referred to by P is used for
16336 *parm
= TYPE_MAIN_VARIANT (*parm
);
16337 if (TREE_CODE (*parm
) == REFERENCE_TYPE
)
16339 *parm
= TREE_TYPE (*parm
);
16340 result
|= UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
16343 /* DR 322. For conversion deduction, remove a reference type on parm
16344 too (which has been swapped into ARG). */
16345 if (strict
== DEDUCE_CONV
&& TREE_CODE (*arg
) == REFERENCE_TYPE
)
16346 *arg
= TREE_TYPE (*arg
);
16351 /* Subroutine of unify_one_argument. PARM is a function parameter of a
16352 template which does contain any deducible template parameters; check if
16353 ARG is a suitable match for it. STRICT, FLAGS and EXPLAIN_P are as in
16354 unify_one_argument. */
16357 check_non_deducible_conversion (tree parm
, tree arg
, int strict
,
16358 int flags
, bool explain_p
)
16363 type
= TREE_TYPE (arg
);
16367 if (same_type_p (parm
, type
))
16368 return unify_success (explain_p
);
16370 if (strict
== DEDUCE_CONV
)
16372 if (can_convert_arg (type
, parm
, NULL_TREE
, flags
,
16373 explain_p
? tf_warning_or_error
: tf_none
))
16374 return unify_success (explain_p
);
16376 else if (strict
!= DEDUCE_EXACT
)
16378 if (can_convert_arg (parm
, type
,
16379 TYPE_P (arg
) ? NULL_TREE
: arg
,
16380 flags
, explain_p
? tf_warning_or_error
: tf_none
))
16381 return unify_success (explain_p
);
16384 if (strict
== DEDUCE_EXACT
)
16385 return unify_type_mismatch (explain_p
, parm
, arg
);
16387 return unify_arg_conversion (explain_p
, parm
, type
, arg
);
16390 static bool uses_deducible_template_parms (tree type
);
16392 /* Returns true iff the expression EXPR is one from which a template
16393 argument can be deduced. In other words, if it's an undecorated
16394 use of a template non-type parameter. */
16397 deducible_expression (tree expr
)
16399 return (TREE_CODE (expr
) == TEMPLATE_PARM_INDEX
);
16402 /* Returns true iff the array domain DOMAIN uses a template parameter in a
16403 deducible way; that is, if it has a max value of <PARM> - 1. */
16406 deducible_array_bound (tree domain
)
16408 if (domain
== NULL_TREE
)
16411 tree max
= TYPE_MAX_VALUE (domain
);
16412 if (TREE_CODE (max
) != MINUS_EXPR
)
16415 return deducible_expression (TREE_OPERAND (max
, 0));
16418 /* Returns true iff the template arguments ARGS use a template parameter
16419 in a deducible way. */
16422 deducible_template_args (tree args
)
16424 for (int i
= 0; i
< TREE_VEC_LENGTH (args
); ++i
)
16427 tree elt
= TREE_VEC_ELT (args
, i
);
16428 if (ARGUMENT_PACK_P (elt
))
16429 deducible
= deducible_template_args (ARGUMENT_PACK_ARGS (elt
));
16432 if (PACK_EXPANSION_P (elt
))
16433 elt
= PACK_EXPANSION_PATTERN (elt
);
16434 if (TREE_CODE (elt
) == TEMPLATE_TEMPLATE_PARM
)
16436 else if (TYPE_P (elt
))
16437 deducible
= uses_deducible_template_parms (elt
);
16439 deducible
= deducible_expression (elt
);
16447 /* Returns true iff TYPE contains any deducible references to template
16448 parameters, as per 14.8.2.5. */
16451 uses_deducible_template_parms (tree type
)
16453 if (PACK_EXPANSION_P (type
))
16454 type
= PACK_EXPANSION_PATTERN (type
);
16461 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
16462 || TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
16468 if (POINTER_TYPE_P (type
))
16469 return uses_deducible_template_parms (TREE_TYPE (type
));
16471 /* T[integer-constant ]
16473 if (TREE_CODE (type
) == ARRAY_TYPE
)
16474 return (uses_deducible_template_parms (TREE_TYPE (type
))
16475 || deducible_array_bound (TYPE_DOMAIN (type
)));
16487 if (TYPE_PTRMEM_P (type
))
16488 return (uses_deducible_template_parms (TYPE_PTRMEM_CLASS_TYPE (type
))
16489 || (uses_deducible_template_parms
16490 (TYPE_PTRMEM_POINTED_TO_TYPE (type
))));
16492 /* template-name <T> (where template-name refers to a class template)
16493 template-name <i> (where template-name refers to a class template) */
16494 if (CLASS_TYPE_P (type
)
16495 && CLASSTYPE_TEMPLATE_INFO (type
)
16496 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (type
)))
16497 return deducible_template_args (INNERMOST_TEMPLATE_ARGS
16498 (CLASSTYPE_TI_ARGS (type
)));
16503 if (TREE_CODE (type
) == FUNCTION_TYPE
16504 || TREE_CODE (type
) == METHOD_TYPE
)
16506 if (uses_deducible_template_parms (TREE_TYPE (type
)))
16508 tree parm
= TYPE_ARG_TYPES (type
);
16509 if (TREE_CODE (type
) == METHOD_TYPE
)
16510 parm
= TREE_CHAIN (parm
);
16511 for (; parm
; parm
= TREE_CHAIN (parm
))
16512 if (uses_deducible_template_parms (TREE_VALUE (parm
)))
16519 /* Subroutine of type_unification_real and unify_pack_expansion to
16520 handle unification of a single P/A pair. Parameters are as
16521 for those functions. */
16524 unify_one_argument (tree tparms
, tree targs
, tree parm
, tree arg
,
16525 int subr
, unification_kind_t strict
, int flags
,
16528 tree arg_expr
= NULL_TREE
;
16531 if (arg
== error_mark_node
|| parm
== error_mark_node
)
16532 return unify_invalid (explain_p
);
16533 if (arg
== unknown_type_node
)
16534 /* We can't deduce anything from this, but we might get all the
16535 template args from other function args. */
16536 return unify_success (explain_p
);
16538 /* Implicit conversions (Clause 4) will be performed on a function
16539 argument to convert it to the type of the corresponding function
16540 parameter if the parameter type contains no template-parameters that
16541 participate in template argument deduction. */
16542 if (TYPE_P (parm
) && !uses_template_parms (parm
))
16543 /* For function parameters that contain no template-parameters at all,
16544 we have historically checked for convertibility in order to shortcut
16545 consideration of this candidate. */
16546 return check_non_deducible_conversion (parm
, arg
, strict
, flags
,
16548 else if (strict
== DEDUCE_CALL
16549 && TYPE_P (parm
) && !uses_deducible_template_parms (parm
))
16550 /* For function parameters with only non-deducible template parameters,
16552 return unify_success (explain_p
);
16557 arg_strict
= (UNIFY_ALLOW_OUTER_LEVEL
16558 | UNIFY_ALLOW_MORE_CV_QUAL
16559 | UNIFY_ALLOW_DERIVED
);
16563 arg_strict
= UNIFY_ALLOW_LESS_CV_QUAL
;
16567 arg_strict
= UNIFY_ALLOW_NONE
;
16571 gcc_unreachable ();
16574 /* We only do these transformations if this is the top-level
16575 parameter_type_list in a call or declaration matching; in other
16576 situations (nested function declarators, template argument lists) we
16577 won't be comparing a type to an expression, and we don't do any type
16583 gcc_assert (TREE_TYPE (arg
) != NULL_TREE
);
16584 if (type_unknown_p (arg
))
16586 /* [temp.deduct.type] A template-argument can be
16587 deduced from a pointer to function or pointer
16588 to member function argument if the set of
16589 overloaded functions does not contain function
16590 templates and at most one of a set of
16591 overloaded functions provides a unique
16594 if (resolve_overloaded_unification
16595 (tparms
, targs
, parm
, arg
, strict
,
16596 arg_strict
, explain_p
))
16597 return unify_success (explain_p
);
16598 return unify_overload_resolution_failure (explain_p
, arg
);
16602 arg
= unlowered_expr_type (arg
);
16603 if (arg
== error_mark_node
)
16604 return unify_invalid (explain_p
);
16608 maybe_adjust_types_for_deduction (strict
, &parm
, &arg
, arg_expr
);
16611 if ((TYPE_P (parm
) || TREE_CODE (parm
) == TEMPLATE_DECL
)
16612 != (TYPE_P (arg
) || TREE_CODE (arg
) == TEMPLATE_DECL
))
16613 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
16615 /* For deduction from an init-list we need the actual list. */
16616 if (arg_expr
&& BRACE_ENCLOSED_INITIALIZER_P (arg_expr
))
16618 return unify (tparms
, targs
, parm
, arg
, arg_strict
, explain_p
);
16621 /* Most parms like fn_type_unification.
16623 If SUBR is 1, we're being called recursively (to unify the
16624 arguments of a function or method parameter of a function
16627 CHECKS is a pointer to a vector of access checks encountered while
16628 substituting default template arguments. */
16631 type_unification_real (tree tparms
,
16635 unsigned int xnargs
,
16637 unification_kind_t strict
,
16639 vec
<deferred_access_check
, va_gc
> **checks
,
16644 int ntparms
= TREE_VEC_LENGTH (tparms
);
16645 int saw_undeduced
= 0;
16648 unsigned int nargs
;
16651 gcc_assert (TREE_CODE (tparms
) == TREE_VEC
);
16652 gcc_assert (xparms
== NULL_TREE
|| TREE_CODE (xparms
) == TREE_LIST
);
16653 gcc_assert (ntparms
> 0);
16655 /* Reset the number of non-defaulted template arguments contained
16657 NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
) = NULL_TREE
;
16665 while (parms
&& parms
!= void_list_node
16668 parm
= TREE_VALUE (parms
);
16670 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
16671 && (!TREE_CHAIN (parms
) || TREE_CHAIN (parms
) == void_list_node
))
16672 /* For a function parameter pack that occurs at the end of the
16673 parameter-declaration-list, the type A of each remaining
16674 argument of the call is compared with the type P of the
16675 declarator-id of the function parameter pack. */
16678 parms
= TREE_CHAIN (parms
);
16680 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
)
16681 /* For a function parameter pack that does not occur at the
16682 end of the parameter-declaration-list, the type of the
16683 parameter pack is a non-deduced context. */
16689 if (unify_one_argument (tparms
, targs
, parm
, arg
, subr
, strict
,
16695 && parms
!= void_list_node
16696 && TREE_CODE (TREE_VALUE (parms
)) == TYPE_PACK_EXPANSION
)
16698 /* Unify the remaining arguments with the pack expansion type. */
16700 tree parmvec
= make_tree_vec (1);
16702 /* Allocate a TREE_VEC and copy in all of the arguments */
16703 argvec
= make_tree_vec (nargs
- ia
);
16704 for (i
= 0; ia
< nargs
; ++ia
, ++i
)
16705 TREE_VEC_ELT (argvec
, i
) = args
[ia
];
16707 /* Copy the parameter into parmvec. */
16708 TREE_VEC_ELT (parmvec
, 0) = TREE_VALUE (parms
);
16709 if (unify_pack_expansion (tparms
, targs
, parmvec
, argvec
, strict
,
16710 /*subr=*/subr
, explain_p
))
16713 /* Advance to the end of the list of parameters. */
16714 parms
= TREE_CHAIN (parms
);
16717 /* Fail if we've reached the end of the parm list, and more args
16718 are present, and the parm list isn't variadic. */
16719 if (ia
< nargs
&& parms
== void_list_node
)
16720 return unify_too_many_arguments (explain_p
, nargs
, ia
);
16721 /* Fail if parms are left and they don't have default values and
16722 they aren't all deduced as empty packs (c++/57397). This is
16723 consistent with sufficient_parms_p. */
16724 if (parms
&& parms
!= void_list_node
16725 && TREE_PURPOSE (parms
) == NULL_TREE
)
16727 unsigned int count
= nargs
;
16732 type_pack_p
= TREE_CODE (TREE_VALUE (p
)) == TYPE_PACK_EXPANSION
;
16735 p
= TREE_CHAIN (p
);
16737 while (p
&& p
!= void_list_node
);
16738 if (count
!= nargs
)
16739 return unify_too_few_arguments (explain_p
, ia
, count
,
16745 tsubst_flags_t complain
= (explain_p
16746 ? tf_warning_or_error
16749 for (i
= 0; i
< ntparms
; i
++)
16751 tree targ
= TREE_VEC_ELT (targs
, i
);
16752 tree tparm
= TREE_VEC_ELT (tparms
, i
);
16754 /* Clear the "incomplete" flags on all argument packs now so that
16755 substituting them into later default arguments works. */
16756 if (targ
&& ARGUMENT_PACK_P (targ
))
16758 ARGUMENT_PACK_INCOMPLETE_P (targ
) = 0;
16759 ARGUMENT_PACK_EXPLICIT_ARGS (targ
) = NULL_TREE
;
16762 if (targ
|| tparm
== error_mark_node
)
16764 tparm
= TREE_VALUE (tparm
);
16766 /* If this is an undeduced nontype parameter that depends on
16767 a type parameter, try another pass; its type may have been
16768 deduced from a later argument than the one from which
16769 this parameter can be deduced. */
16770 if (TREE_CODE (tparm
) == PARM_DECL
16771 && uses_template_parms (TREE_TYPE (tparm
))
16772 && !saw_undeduced
++)
16775 /* Core issue #226 (C++0x) [temp.deduct]:
16777 If a template argument has not been deduced, its
16778 default template argument, if any, is used.
16780 When we are in C++98 mode, TREE_PURPOSE will either
16781 be NULL_TREE or ERROR_MARK_NODE, so we do not need
16782 to explicitly check cxx_dialect here. */
16783 if (TREE_PURPOSE (TREE_VEC_ELT (tparms
, i
)))
16785 tree parm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
16786 tree arg
= TREE_PURPOSE (TREE_VEC_ELT (tparms
, i
));
16787 reopen_deferring_access_checks (*checks
);
16788 location_t save_loc
= input_location
;
16790 input_location
= DECL_SOURCE_LOCATION (parm
);
16791 arg
= tsubst_template_arg (arg
, targs
, complain
, NULL_TREE
);
16792 arg
= convert_template_argument (parm
, arg
, targs
, complain
,
16794 input_location
= save_loc
;
16795 *checks
= get_deferred_access_checks ();
16796 pop_deferring_access_checks ();
16797 if (arg
== error_mark_node
)
16801 TREE_VEC_ELT (targs
, i
) = arg
;
16802 /* The position of the first default template argument,
16803 is also the number of non-defaulted arguments in TARGS.
16805 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
))
16806 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
, i
);
16811 /* If the type parameter is a parameter pack, then it will
16812 be deduced to an empty parameter pack. */
16813 if (template_parameter_pack_p (tparm
))
16817 if (TREE_CODE (tparm
) == TEMPLATE_PARM_INDEX
)
16819 arg
= make_node (NONTYPE_ARGUMENT_PACK
);
16820 TREE_TYPE (arg
) = TREE_TYPE (TEMPLATE_PARM_DECL (tparm
));
16821 TREE_CONSTANT (arg
) = 1;
16824 arg
= cxx_make_type (TYPE_ARGUMENT_PACK
);
16826 SET_ARGUMENT_PACK_ARGS (arg
, make_tree_vec (0));
16828 TREE_VEC_ELT (targs
, i
) = arg
;
16832 return unify_parameter_deduction_failure (explain_p
, tparm
);
16835 #ifdef ENABLE_CHECKING
16836 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
))
16837 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
, TREE_VEC_LENGTH (targs
));
16840 return unify_success (explain_p
);
16843 /* Subroutine of type_unification_real. Args are like the variables
16844 at the call site. ARG is an overloaded function (or template-id);
16845 we try deducing template args from each of the overloads, and if
16846 only one succeeds, we go with that. Modifies TARGS and returns
16847 true on success. */
16850 resolve_overloaded_unification (tree tparms
,
16854 unification_kind_t strict
,
16858 tree tempargs
= copy_node (targs
);
16860 tree goodfn
= NULL_TREE
;
16863 if (TREE_CODE (arg
) == ADDR_EXPR
)
16865 arg
= TREE_OPERAND (arg
, 0);
16871 if (TREE_CODE (arg
) == COMPONENT_REF
)
16872 /* Handle `&x' where `x' is some static or non-static member
16874 arg
= TREE_OPERAND (arg
, 1);
16876 if (TREE_CODE (arg
) == OFFSET_REF
)
16877 arg
= TREE_OPERAND (arg
, 1);
16879 /* Strip baselink information. */
16880 if (BASELINK_P (arg
))
16881 arg
= BASELINK_FUNCTIONS (arg
);
16883 if (TREE_CODE (arg
) == TEMPLATE_ID_EXPR
)
16885 /* If we got some explicit template args, we need to plug them into
16886 the affected templates before we try to unify, in case the
16887 explicit args will completely resolve the templates in question. */
16890 tree expl_subargs
= TREE_OPERAND (arg
, 1);
16891 arg
= TREE_OPERAND (arg
, 0);
16893 for (; arg
; arg
= OVL_NEXT (arg
))
16895 tree fn
= OVL_CURRENT (arg
);
16896 tree subargs
, elem
;
16898 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
16901 subargs
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
16902 expl_subargs
, NULL_TREE
, tf_none
,
16903 /*require_all_args=*/true,
16904 /*use_default_args=*/true);
16905 if (subargs
!= error_mark_node
16906 && !any_dependent_template_arguments_p (subargs
))
16908 elem
= TREE_TYPE (instantiate_template (fn
, subargs
, tf_none
));
16909 if (try_one_overload (tparms
, targs
, tempargs
, parm
,
16910 elem
, strict
, sub_strict
, addr_p
, explain_p
)
16911 && (!goodfn
|| !same_type_p (goodfn
, elem
)))
16920 /* If no templates (or more than one) are fully resolved by the
16921 explicit arguments, this template-id is a non-deduced context; it
16922 could still be OK if we deduce all template arguments for the
16923 enclosing call through other arguments. */
16927 else if (TREE_CODE (arg
) != OVERLOAD
16928 && TREE_CODE (arg
) != FUNCTION_DECL
)
16929 /* If ARG is, for example, "(0, &f)" then its type will be unknown
16930 -- but the deduction does not succeed because the expression is
16931 not just the function on its own. */
16934 for (; arg
; arg
= OVL_NEXT (arg
))
16935 if (try_one_overload (tparms
, targs
, tempargs
, parm
,
16936 TREE_TYPE (OVL_CURRENT (arg
)),
16937 strict
, sub_strict
, addr_p
, explain_p
)
16938 && (!goodfn
|| !decls_match (goodfn
, OVL_CURRENT (arg
))))
16940 goodfn
= OVL_CURRENT (arg
);
16944 /* [temp.deduct.type] A template-argument can be deduced from a pointer
16945 to function or pointer to member function argument if the set of
16946 overloaded functions does not contain function templates and at most
16947 one of a set of overloaded functions provides a unique match.
16949 So if we found multiple possibilities, we return success but don't
16950 deduce anything. */
16954 int i
= TREE_VEC_LENGTH (targs
);
16956 if (TREE_VEC_ELT (tempargs
, i
))
16958 tree old
= TREE_VEC_ELT (targs
, i
);
16959 tree new_
= TREE_VEC_ELT (tempargs
, i
);
16960 if (new_
&& old
&& ARGUMENT_PACK_P (old
)
16961 && ARGUMENT_PACK_EXPLICIT_ARGS (old
))
16962 /* Don't forget explicit template arguments in a pack. */
16963 ARGUMENT_PACK_EXPLICIT_ARGS (new_
)
16964 = ARGUMENT_PACK_EXPLICIT_ARGS (old
);
16965 TREE_VEC_ELT (targs
, i
) = new_
;
16974 /* Core DR 115: In contexts where deduction is done and fails, or in
16975 contexts where deduction is not done, if a template argument list is
16976 specified and it, along with any default template arguments, identifies
16977 a single function template specialization, then the template-id is an
16978 lvalue for the function template specialization. */
16981 resolve_nondeduced_context (tree orig_expr
)
16983 tree expr
, offset
, baselink
;
16986 if (!type_unknown_p (orig_expr
))
16991 offset
= NULL_TREE
;
16992 baselink
= NULL_TREE
;
16994 if (TREE_CODE (expr
) == ADDR_EXPR
)
16996 expr
= TREE_OPERAND (expr
, 0);
16999 if (TREE_CODE (expr
) == OFFSET_REF
)
17002 expr
= TREE_OPERAND (expr
, 1);
17004 if (BASELINK_P (expr
))
17007 expr
= BASELINK_FUNCTIONS (expr
);
17010 if (TREE_CODE (expr
) == TEMPLATE_ID_EXPR
)
17013 tree goodfn
= NULL_TREE
;
17015 /* If we got some explicit template args, we need to plug them into
17016 the affected templates before we try to unify, in case the
17017 explicit args will completely resolve the templates in question. */
17019 tree expl_subargs
= TREE_OPERAND (expr
, 1);
17020 tree arg
= TREE_OPERAND (expr
, 0);
17021 tree badfn
= NULL_TREE
;
17022 tree badargs
= NULL_TREE
;
17024 for (; arg
; arg
= OVL_NEXT (arg
))
17026 tree fn
= OVL_CURRENT (arg
);
17027 tree subargs
, elem
;
17029 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
17032 subargs
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
17033 expl_subargs
, NULL_TREE
, tf_none
,
17034 /*require_all_args=*/true,
17035 /*use_default_args=*/true);
17036 if (subargs
!= error_mark_node
17037 && !any_dependent_template_arguments_p (subargs
))
17039 elem
= instantiate_template (fn
, subargs
, tf_none
);
17040 if (elem
== error_mark_node
)
17045 else if (elem
&& (!goodfn
|| !decls_match (goodfn
, elem
)))
17054 mark_used (goodfn
);
17057 expr
= build_baselink (BASELINK_BINFO (baselink
),
17058 BASELINK_ACCESS_BINFO (baselink
),
17059 expr
, BASELINK_OPTYPE (baselink
));
17063 = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (offset
, 0)));
17064 expr
= build_offset_ref (base
, expr
, addr
, tf_warning_or_error
);
17067 expr
= cp_build_addr_expr (expr
, tf_warning_or_error
);
17070 else if (good
== 0 && badargs
)
17071 /* There were no good options and at least one bad one, so let the
17072 user know what the problem is. */
17073 instantiate_template (badfn
, badargs
, tf_warning_or_error
);
17078 /* Subroutine of resolve_overloaded_unification; does deduction for a single
17079 overload. Fills TARGS with any deduced arguments, or error_mark_node if
17080 different overloads deduce different arguments for a given parm.
17081 ADDR_P is true if the expression for which deduction is being
17082 performed was of the form "& fn" rather than simply "fn".
17084 Returns 1 on success. */
17087 try_one_overload (tree tparms
,
17092 unification_kind_t strict
,
17101 if (arg
== error_mark_node
)
17104 /* [temp.deduct.type] A template-argument can be deduced from a pointer
17105 to function or pointer to member function argument if the set of
17106 overloaded functions does not contain function templates and at most
17107 one of a set of overloaded functions provides a unique match.
17109 So if this is a template, just return success. */
17111 if (uses_template_parms (arg
))
17114 if (TREE_CODE (arg
) == METHOD_TYPE
)
17115 arg
= build_ptrmemfunc_type (build_pointer_type (arg
));
17117 arg
= build_pointer_type (arg
);
17119 sub_strict
|= maybe_adjust_types_for_deduction (strict
, &parm
, &arg
, NULL
);
17121 /* We don't copy orig_targs for this because if we have already deduced
17122 some template args from previous args, unify would complain when we
17123 try to deduce a template parameter for the same argument, even though
17124 there isn't really a conflict. */
17125 nargs
= TREE_VEC_LENGTH (targs
);
17126 tempargs
= make_tree_vec (nargs
);
17128 if (unify (tparms
, tempargs
, parm
, arg
, sub_strict
, explain_p
))
17131 /* First make sure we didn't deduce anything that conflicts with
17132 explicitly specified args. */
17133 for (i
= nargs
; i
--; )
17135 tree elt
= TREE_VEC_ELT (tempargs
, i
);
17136 tree oldelt
= TREE_VEC_ELT (orig_targs
, i
);
17140 else if (uses_template_parms (elt
))
17141 /* Since we're unifying against ourselves, we will fill in
17142 template args used in the function parm list with our own
17143 template parms. Discard them. */
17144 TREE_VEC_ELT (tempargs
, i
) = NULL_TREE
;
17145 else if (oldelt
&& !template_args_equal (oldelt
, elt
))
17149 for (i
= nargs
; i
--; )
17151 tree elt
= TREE_VEC_ELT (tempargs
, i
);
17154 TREE_VEC_ELT (targs
, i
) = elt
;
17160 /* PARM is a template class (perhaps with unbound template
17161 parameters). ARG is a fully instantiated type. If ARG can be
17162 bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and
17163 TARGS are as for unify. */
17166 try_class_unification (tree tparms
, tree targs
, tree parm
, tree arg
,
17169 tree copy_of_targs
;
17171 if (!CLASSTYPE_TEMPLATE_INFO (arg
)
17172 || (most_general_template (CLASSTYPE_TI_TEMPLATE (arg
))
17173 != most_general_template (CLASSTYPE_TI_TEMPLATE (parm
))))
17176 /* We need to make a new template argument vector for the call to
17177 unify. If we used TARGS, we'd clutter it up with the result of
17178 the attempted unification, even if this class didn't work out.
17179 We also don't want to commit ourselves to all the unifications
17180 we've already done, since unification is supposed to be done on
17181 an argument-by-argument basis. In other words, consider the
17182 following pathological case:
17184 template <int I, int J, int K>
17187 template <int I, int J>
17188 struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {};
17190 template <int I, int J, int K>
17191 void f(S<I, J, K>, S<I, I, I>);
17200 Now, by the time we consider the unification involving `s2', we
17201 already know that we must have `f<0, 0, 0>'. But, even though
17202 `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is invalid
17203 because there are two ways to unify base classes of S<0, 1, 2>
17204 with S<I, I, I>. If we kept the already deduced knowledge, we
17205 would reject the possibility I=1. */
17206 copy_of_targs
= make_tree_vec (TREE_VEC_LENGTH (targs
));
17208 /* If unification failed, we're done. */
17209 if (unify (tparms
, copy_of_targs
, CLASSTYPE_TI_ARGS (parm
),
17210 CLASSTYPE_TI_ARGS (arg
), UNIFY_ALLOW_NONE
, explain_p
))
17216 /* Given a template type PARM and a class type ARG, find the unique
17217 base type in ARG that is an instance of PARM. We do not examine
17218 ARG itself; only its base-classes. If there is not exactly one
17219 appropriate base class, return NULL_TREE. PARM may be the type of
17220 a partial specialization, as well as a plain template type. Used
17223 static enum template_base_result
17224 get_template_base (tree tparms
, tree targs
, tree parm
, tree arg
,
17225 bool explain_p
, tree
*result
)
17227 tree rval
= NULL_TREE
;
17230 gcc_assert (RECORD_OR_UNION_CODE_P (TREE_CODE (arg
)));
17232 binfo
= TYPE_BINFO (complete_type (arg
));
17235 /* The type could not be completed. */
17236 *result
= NULL_TREE
;
17237 return tbr_incomplete_type
;
17240 /* Walk in inheritance graph order. The search order is not
17241 important, and this avoids multiple walks of virtual bases. */
17242 for (binfo
= TREE_CHAIN (binfo
); binfo
; binfo
= TREE_CHAIN (binfo
))
17244 tree r
= try_class_unification (tparms
, targs
, parm
,
17245 BINFO_TYPE (binfo
), explain_p
);
17249 /* If there is more than one satisfactory baseclass, then:
17253 If they yield more than one possible deduced A, the type
17257 if (rval
&& !same_type_p (r
, rval
))
17259 *result
= NULL_TREE
;
17260 return tbr_ambiguous_baseclass
;
17268 return tbr_success
;
17271 /* Returns the level of DECL, which declares a template parameter. */
17274 template_decl_level (tree decl
)
17276 switch (TREE_CODE (decl
))
17279 case TEMPLATE_DECL
:
17280 return TEMPLATE_TYPE_LEVEL (TREE_TYPE (decl
));
17283 return TEMPLATE_PARM_LEVEL (DECL_INITIAL (decl
));
17286 gcc_unreachable ();
17291 /* Decide whether ARG can be unified with PARM, considering only the
17292 cv-qualifiers of each type, given STRICT as documented for unify.
17293 Returns nonzero iff the unification is OK on that basis. */
17296 check_cv_quals_for_unify (int strict
, tree arg
, tree parm
)
17298 int arg_quals
= cp_type_quals (arg
);
17299 int parm_quals
= cp_type_quals (parm
);
17301 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
17302 && !(strict
& UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
17304 /* Although a CVR qualifier is ignored when being applied to a
17305 substituted template parameter ([8.3.2]/1 for example), that
17306 does not allow us to unify "const T" with "int&" because both
17307 types are not of the form "cv-list T" [14.8.2.5 temp.deduct.type].
17308 It is ok when we're allowing additional CV qualifiers
17309 at the outer level [14.8.2.1]/3,1st bullet. */
17310 if ((TREE_CODE (arg
) == REFERENCE_TYPE
17311 || TREE_CODE (arg
) == FUNCTION_TYPE
17312 || TREE_CODE (arg
) == METHOD_TYPE
)
17313 && (parm_quals
& (TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
)))
17316 if ((!POINTER_TYPE_P (arg
) && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
)
17317 && (parm_quals
& TYPE_QUAL_RESTRICT
))
17321 if (!(strict
& (UNIFY_ALLOW_MORE_CV_QUAL
| UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
17322 && (arg_quals
& parm_quals
) != parm_quals
)
17325 if (!(strict
& (UNIFY_ALLOW_LESS_CV_QUAL
| UNIFY_ALLOW_OUTER_LESS_CV_QUAL
))
17326 && (parm_quals
& arg_quals
) != arg_quals
)
17332 /* Determines the LEVEL and INDEX for the template parameter PARM. */
17334 template_parm_level_and_index (tree parm
, int* level
, int* index
)
17336 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
17337 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
17338 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
17340 *index
= TEMPLATE_TYPE_IDX (parm
);
17341 *level
= TEMPLATE_TYPE_LEVEL (parm
);
17345 *index
= TEMPLATE_PARM_IDX (parm
);
17346 *level
= TEMPLATE_PARM_LEVEL (parm
);
17350 #define RECUR_AND_CHECK_FAILURE(TP, TA, P, A, S, EP) \
17352 if (unify (TP, TA, P, A, S, EP)) \
17356 /* Unifies the remaining arguments in PACKED_ARGS with the pack
17357 expansion at the end of PACKED_PARMS. Returns 0 if the type
17358 deduction succeeds, 1 otherwise. STRICT is the same as in
17359 unify. CALL_ARGS_P is true iff PACKED_ARGS is actually a function
17360 call argument list. We'll need to adjust the arguments to make them
17361 types. SUBR tells us if this is from a recursive call to
17362 type_unification_real, or for comparing two template argument
17366 unify_pack_expansion (tree tparms
, tree targs
, tree packed_parms
,
17367 tree packed_args
, unification_kind_t strict
,
17368 bool subr
, bool explain_p
)
17371 = TREE_VEC_ELT (packed_parms
, TREE_VEC_LENGTH (packed_parms
) - 1);
17372 tree pattern
= PACK_EXPANSION_PATTERN (parm
);
17373 tree pack
, packs
= NULL_TREE
;
17374 int i
, start
= TREE_VEC_LENGTH (packed_parms
) - 1;
17376 packed_args
= expand_template_argument_pack (packed_args
);
17378 int len
= TREE_VEC_LENGTH (packed_args
);
17380 /* Determine the parameter packs we will be deducing from the
17381 pattern, and record their current deductions. */
17382 for (pack
= PACK_EXPANSION_PARAMETER_PACKS (parm
);
17383 pack
; pack
= TREE_CHAIN (pack
))
17385 tree parm_pack
= TREE_VALUE (pack
);
17388 /* Determine the index and level of this parameter pack. */
17389 template_parm_level_and_index (parm_pack
, &level
, &idx
);
17391 /* Keep track of the parameter packs and their corresponding
17393 packs
= tree_cons (parm_pack
, TMPL_ARG (targs
, level
, idx
), packs
);
17394 TREE_TYPE (packs
) = make_tree_vec (len
- start
);
17397 /* Loop through all of the arguments that have not yet been
17398 unified and unify each with the pattern. */
17399 for (i
= start
; i
< len
; i
++)
17402 bool any_explicit
= false;
17403 tree arg
= TREE_VEC_ELT (packed_args
, i
);
17405 /* For each parameter pack, set its TMPL_ARG to either NULL_TREE
17406 or the element of its argument pack at the current index if
17407 this argument was explicitly specified. */
17408 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
17412 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
17415 if (TREE_VALUE (pack
)
17416 && (pargs
= ARGUMENT_PACK_EXPLICIT_ARGS (TREE_VALUE (pack
)))
17417 && (i
- start
< TREE_VEC_LENGTH (pargs
)))
17419 any_explicit
= true;
17420 arg
= TREE_VEC_ELT (pargs
, i
- start
);
17422 TMPL_ARG (targs
, level
, idx
) = arg
;
17425 /* If we had explicit template arguments, substitute them into the
17426 pattern before deduction. */
17429 /* Some arguments might still be unspecified or dependent. */
17431 ++processing_template_decl
;
17432 dependent
= any_dependent_template_arguments_p (targs
);
17434 --processing_template_decl
;
17435 parm
= tsubst (pattern
, targs
,
17436 explain_p
? tf_warning_or_error
: tf_none
,
17439 --processing_template_decl
;
17440 if (parm
== error_mark_node
)
17446 /* Unify the pattern with the current argument. */
17447 if (unify_one_argument (tparms
, targs
, parm
, arg
, subr
, strict
,
17448 LOOKUP_IMPLICIT
, explain_p
))
17451 /* For each parameter pack, collect the deduced value. */
17452 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
17455 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
17457 TREE_VEC_ELT (TREE_TYPE (pack
), i
- start
) =
17458 TMPL_ARG (targs
, level
, idx
);
17462 /* Verify that the results of unification with the parameter packs
17463 produce results consistent with what we've seen before, and make
17464 the deduced argument packs available. */
17465 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
17467 tree old_pack
= TREE_VALUE (pack
);
17468 tree new_args
= TREE_TYPE (pack
);
17469 int i
, len
= TREE_VEC_LENGTH (new_args
);
17471 bool nondeduced_p
= false;
17473 /* By default keep the original deduced argument pack.
17474 If necessary, more specific code is going to update the
17475 resulting deduced argument later down in this function. */
17476 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
17477 TMPL_ARG (targs
, level
, idx
) = old_pack
;
17479 /* If NEW_ARGS contains any NULL_TREE entries, we didn't
17480 actually deduce anything. */
17481 for (i
= 0; i
< len
&& !nondeduced_p
; ++i
)
17482 if (TREE_VEC_ELT (new_args
, i
) == NULL_TREE
)
17483 nondeduced_p
= true;
17487 if (old_pack
&& ARGUMENT_PACK_INCOMPLETE_P (old_pack
))
17489 /* If we had fewer function args than explicit template args,
17490 just use the explicits. */
17491 tree explicit_args
= ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
);
17492 int explicit_len
= TREE_VEC_LENGTH (explicit_args
);
17493 if (len
< explicit_len
)
17494 new_args
= explicit_args
;
17500 /* Build the deduced *_ARGUMENT_PACK. */
17501 if (TREE_CODE (TREE_PURPOSE (pack
)) == TEMPLATE_PARM_INDEX
)
17503 result
= make_node (NONTYPE_ARGUMENT_PACK
);
17504 TREE_TYPE (result
) =
17505 TREE_TYPE (TEMPLATE_PARM_DECL (TREE_PURPOSE (pack
)));
17506 TREE_CONSTANT (result
) = 1;
17509 result
= cxx_make_type (TYPE_ARGUMENT_PACK
);
17511 SET_ARGUMENT_PACK_ARGS (result
, new_args
);
17513 /* Note the deduced argument packs for this parameter
17515 TMPL_ARG (targs
, level
, idx
) = result
;
17517 else if (ARGUMENT_PACK_INCOMPLETE_P (old_pack
)
17518 && (ARGUMENT_PACK_ARGS (old_pack
)
17519 == ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
)))
17521 /* We only had the explicitly-provided arguments before, but
17522 now we have a complete set of arguments. */
17523 tree explicit_args
= ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
);
17525 SET_ARGUMENT_PACK_ARGS (old_pack
, new_args
);
17526 ARGUMENT_PACK_INCOMPLETE_P (old_pack
) = 1;
17527 ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
) = explicit_args
;
17531 tree bad_old_arg
= NULL_TREE
, bad_new_arg
= NULL_TREE
;
17532 tree old_args
= ARGUMENT_PACK_ARGS (old_pack
);
17534 if (!comp_template_args_with_info (old_args
, new_args
,
17535 &bad_old_arg
, &bad_new_arg
))
17536 /* Inconsistent unification of this parameter pack. */
17537 return unify_parameter_pack_inconsistent (explain_p
,
17543 return unify_success (explain_p
);
17546 /* Handle unification of the domain of an array. PARM_DOM and ARG_DOM are
17547 INTEGER_TYPEs representing the TYPE_DOMAIN of ARRAY_TYPEs. The other
17548 parameters and return value are as for unify. */
17551 unify_array_domain (tree tparms
, tree targs
,
17552 tree parm_dom
, tree arg_dom
,
17560 /* Our representation of array types uses "N - 1" as the
17561 TYPE_MAX_VALUE for an array with "N" elements, if "N" is
17562 not an integer constant. We cannot unify arbitrarily
17563 complex expressions, so we eliminate the MINUS_EXPRs
17565 parm_max
= TYPE_MAX_VALUE (parm_dom
);
17566 parm_cst
= TREE_CODE (parm_max
) == INTEGER_CST
;
17569 gcc_assert (TREE_CODE (parm_max
) == MINUS_EXPR
);
17570 parm_max
= TREE_OPERAND (parm_max
, 0);
17572 arg_max
= TYPE_MAX_VALUE (arg_dom
);
17573 arg_cst
= TREE_CODE (arg_max
) == INTEGER_CST
;
17576 /* The ARG_MAX may not be a simple MINUS_EXPR, if we are
17577 trying to unify the type of a variable with the type
17578 of a template parameter. For example:
17580 template <unsigned int N>
17581 void f (char (&) [N]);
17588 Here, the type of the ARG will be "int [g(i)]", and
17589 may be a SAVE_EXPR, etc. */
17590 if (TREE_CODE (arg_max
) != MINUS_EXPR
)
17591 return unify_vla_arg (explain_p
, arg_dom
);
17592 arg_max
= TREE_OPERAND (arg_max
, 0);
17595 /* If only one of the bounds used a MINUS_EXPR, compensate
17596 by adding one to the other bound. */
17597 if (parm_cst
&& !arg_cst
)
17598 parm_max
= fold_build2_loc (input_location
, PLUS_EXPR
,
17602 else if (arg_cst
&& !parm_cst
)
17603 arg_max
= fold_build2_loc (input_location
, PLUS_EXPR
,
17608 return unify (tparms
, targs
, parm_max
, arg_max
,
17609 UNIFY_ALLOW_INTEGER
, explain_p
);
17612 /* Deduce the value of template parameters. TPARMS is the (innermost)
17613 set of template parameters to a template. TARGS is the bindings
17614 for those template parameters, as determined thus far; TARGS may
17615 include template arguments for outer levels of template parameters
17616 as well. PARM is a parameter to a template function, or a
17617 subcomponent of that parameter; ARG is the corresponding argument.
17618 This function attempts to match PARM with ARG in a manner
17619 consistent with the existing assignments in TARGS. If more values
17620 are deduced, then TARGS is updated.
17622 Returns 0 if the type deduction succeeds, 1 otherwise. The
17623 parameter STRICT is a bitwise or of the following flags:
17626 Require an exact match between PARM and ARG.
17627 UNIFY_ALLOW_MORE_CV_QUAL:
17628 Allow the deduced ARG to be more cv-qualified (by qualification
17629 conversion) than ARG.
17630 UNIFY_ALLOW_LESS_CV_QUAL:
17631 Allow the deduced ARG to be less cv-qualified than ARG.
17632 UNIFY_ALLOW_DERIVED:
17633 Allow the deduced ARG to be a template base class of ARG,
17634 or a pointer to a template base class of the type pointed to by
17636 UNIFY_ALLOW_INTEGER:
17637 Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX
17638 case for more information.
17639 UNIFY_ALLOW_OUTER_LEVEL:
17640 This is the outermost level of a deduction. Used to determine validity
17641 of qualification conversions. A valid qualification conversion must
17642 have const qualified pointers leading up to the inner type which
17643 requires additional CV quals, except at the outer level, where const
17644 is not required [conv.qual]. It would be normal to set this flag in
17645 addition to setting UNIFY_ALLOW_MORE_CV_QUAL.
17646 UNIFY_ALLOW_OUTER_MORE_CV_QUAL:
17647 This is the outermost level of a deduction, and PARM can be more CV
17648 qualified at this point.
17649 UNIFY_ALLOW_OUTER_LESS_CV_QUAL:
17650 This is the outermost level of a deduction, and PARM can be less CV
17651 qualified at this point. */
17654 unify (tree tparms
, tree targs
, tree parm
, tree arg
, int strict
,
17660 int strict_in
= strict
;
17662 /* I don't think this will do the right thing with respect to types.
17663 But the only case I've seen it in so far has been array bounds, where
17664 signedness is the only information lost, and I think that will be
17666 while (TREE_CODE (parm
) == NOP_EXPR
)
17667 parm
= TREE_OPERAND (parm
, 0);
17669 if (arg
== error_mark_node
)
17670 return unify_invalid (explain_p
);
17671 if (arg
== unknown_type_node
17672 || arg
== init_list_type_node
)
17673 /* We can't deduce anything from this, but we might get all the
17674 template args from other function args. */
17675 return unify_success (explain_p
);
17677 /* If PARM uses template parameters, then we can't bail out here,
17678 even if ARG == PARM, since we won't record unifications for the
17679 template parameters. We might need them if we're trying to
17680 figure out which of two things is more specialized. */
17681 if (arg
== parm
&& !uses_template_parms (parm
))
17682 return unify_success (explain_p
);
17684 /* Handle init lists early, so the rest of the function can assume
17685 we're dealing with a type. */
17686 if (BRACE_ENCLOSED_INITIALIZER_P (arg
))
17690 tree orig_parm
= parm
;
17692 /* Replace T with std::initializer_list<T> for deduction. */
17693 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
17694 && flag_deduce_init_list
)
17695 parm
= listify (parm
);
17697 if (!is_std_init_list (parm
)
17698 && TREE_CODE (parm
) != ARRAY_TYPE
)
17699 /* We can only deduce from an initializer list argument if the
17700 parameter is std::initializer_list or an array; otherwise this
17701 is a non-deduced context. */
17702 return unify_success (explain_p
);
17704 if (TREE_CODE (parm
) == ARRAY_TYPE
)
17705 elttype
= TREE_TYPE (parm
);
17707 elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (parm
), 0);
17709 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (arg
), i
, elt
)
17711 int elt_strict
= strict
;
17713 if (elt
== error_mark_node
)
17714 return unify_invalid (explain_p
);
17716 if (!BRACE_ENCLOSED_INITIALIZER_P (elt
))
17718 tree type
= TREE_TYPE (elt
);
17719 /* It should only be possible to get here for a call. */
17720 gcc_assert (elt_strict
& UNIFY_ALLOW_OUTER_LEVEL
);
17721 elt_strict
|= maybe_adjust_types_for_deduction
17722 (DEDUCE_CALL
, &elttype
, &type
, elt
);
17726 RECUR_AND_CHECK_FAILURE (tparms
, targs
, elttype
, elt
, elt_strict
,
17730 if (TREE_CODE (parm
) == ARRAY_TYPE
17731 && deducible_array_bound (TYPE_DOMAIN (parm
)))
17733 /* Also deduce from the length of the initializer list. */
17734 tree max
= size_int (CONSTRUCTOR_NELTS (arg
));
17735 tree idx
= compute_array_index_type (NULL_TREE
, max
, tf_none
);
17736 if (idx
== error_mark_node
)
17737 return unify_invalid (explain_p
);
17738 return unify_array_domain (tparms
, targs
, TYPE_DOMAIN (parm
),
17742 /* If the std::initializer_list<T> deduction worked, replace the
17743 deduced A with std::initializer_list<A>. */
17744 if (orig_parm
!= parm
)
17746 idx
= TEMPLATE_TYPE_IDX (orig_parm
);
17747 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
17748 targ
= listify (targ
);
17749 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = targ
;
17751 return unify_success (explain_p
);
17754 /* Immediately reject some pairs that won't unify because of
17755 cv-qualification mismatches. */
17756 if (TREE_CODE (arg
) == TREE_CODE (parm
)
17758 /* It is the elements of the array which hold the cv quals of an array
17759 type, and the elements might be template type parms. We'll check
17760 when we recurse. */
17761 && TREE_CODE (arg
) != ARRAY_TYPE
17762 /* We check the cv-qualifiers when unifying with template type
17763 parameters below. We want to allow ARG `const T' to unify with
17764 PARM `T' for example, when computing which of two templates
17765 is more specialized, for example. */
17766 && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
17767 && !check_cv_quals_for_unify (strict_in
, arg
, parm
))
17768 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
17770 if (!(strict
& UNIFY_ALLOW_OUTER_LEVEL
)
17771 && TYPE_P (parm
) && !CP_TYPE_CONST_P (parm
))
17772 strict
&= ~UNIFY_ALLOW_MORE_CV_QUAL
;
17773 strict
&= ~UNIFY_ALLOW_OUTER_LEVEL
;
17774 strict
&= ~UNIFY_ALLOW_DERIVED
;
17775 strict
&= ~UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
17776 strict
&= ~UNIFY_ALLOW_OUTER_LESS_CV_QUAL
;
17778 switch (TREE_CODE (parm
))
17780 case TYPENAME_TYPE
:
17782 case UNBOUND_CLASS_TEMPLATE
:
17783 /* In a type which contains a nested-name-specifier, template
17784 argument values cannot be deduced for template parameters used
17785 within the nested-name-specifier. */
17786 return unify_success (explain_p
);
17788 case TEMPLATE_TYPE_PARM
:
17789 case TEMPLATE_TEMPLATE_PARM
:
17790 case BOUND_TEMPLATE_TEMPLATE_PARM
:
17791 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
17792 if (error_operand_p (tparm
))
17793 return unify_invalid (explain_p
);
17795 if (TEMPLATE_TYPE_LEVEL (parm
)
17796 != template_decl_level (tparm
))
17797 /* The PARM is not one we're trying to unify. Just check
17798 to see if it matches ARG. */
17800 if (TREE_CODE (arg
) == TREE_CODE (parm
)
17801 && (is_auto (parm
) ? is_auto (arg
)
17802 : same_type_p (parm
, arg
)))
17803 return unify_success (explain_p
);
17805 return unify_type_mismatch (explain_p
, parm
, arg
);
17807 idx
= TEMPLATE_TYPE_IDX (parm
);
17808 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
17809 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, idx
));
17810 if (error_operand_p (tparm
))
17811 return unify_invalid (explain_p
);
17813 /* Check for mixed types and values. */
17814 if ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
17815 && TREE_CODE (tparm
) != TYPE_DECL
)
17816 || (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
17817 && TREE_CODE (tparm
) != TEMPLATE_DECL
))
17818 gcc_unreachable ();
17820 if (TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
17822 /* ARG must be constructed from a template class or a template
17823 template parameter. */
17824 if (TREE_CODE (arg
) != BOUND_TEMPLATE_TEMPLATE_PARM
17825 && !CLASSTYPE_SPECIALIZATION_OF_PRIMARY_TEMPLATE_P (arg
))
17826 return unify_template_deduction_failure (explain_p
, parm
, arg
);
17828 tree parmvec
= TYPE_TI_ARGS (parm
);
17829 /* An alias template name is never deduced. */
17830 if (TYPE_ALIAS_P (arg
))
17831 arg
= strip_typedefs (arg
);
17832 tree argvec
= INNERMOST_TEMPLATE_ARGS (TYPE_TI_ARGS (arg
));
17833 tree full_argvec
= add_to_template_args (targs
, argvec
);
17835 = DECL_INNERMOST_TEMPLATE_PARMS
17836 (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (parm
));
17838 int parm_variadic_p
= 0;
17840 /* The resolution to DR150 makes clear that default
17841 arguments for an N-argument may not be used to bind T
17842 to a template template parameter with fewer than N
17843 parameters. It is not safe to permit the binding of
17844 default arguments as an extension, as that may change
17845 the meaning of a conforming program. Consider:
17847 struct Dense { static const unsigned int dim = 1; };
17849 template <template <typename> class View,
17851 void operator+(float, View<Block> const&);
17853 template <typename Block,
17854 unsigned int Dim = Block::dim>
17855 struct Lvalue_proxy { operator float() const; };
17859 Lvalue_proxy<Dense> p;
17864 Here, if Lvalue_proxy is permitted to bind to View, then
17865 the global operator+ will be used; if they are not, the
17866 Lvalue_proxy will be converted to float. */
17867 if (coerce_template_parms (parm_parms
,
17869 TYPE_TI_TEMPLATE (parm
),
17871 ? tf_warning_or_error
17873 /*require_all_args=*/true,
17874 /*use_default_args=*/false)
17875 == error_mark_node
)
17878 /* Deduce arguments T, i from TT<T> or TT<i>.
17879 We check each element of PARMVEC and ARGVEC individually
17880 rather than the whole TREE_VEC since they can have
17881 different number of elements. */
17883 parmvec
= expand_template_argument_pack (parmvec
);
17884 argvec
= expand_template_argument_pack (argvec
);
17886 len
= TREE_VEC_LENGTH (parmvec
);
17888 /* Check if the parameters end in a pack, making them
17891 && PACK_EXPANSION_P (TREE_VEC_ELT (parmvec
, len
- 1)))
17892 parm_variadic_p
= 1;
17894 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
17895 /* If the template argument list of P contains a pack
17896 expansion that is not the last template argument, the
17897 entire template argument list is a non-deduced
17899 if (PACK_EXPANSION_P (TREE_VEC_ELT (parmvec
, i
)))
17900 return unify_success (explain_p
);
17902 if (TREE_VEC_LENGTH (argvec
) < len
- parm_variadic_p
)
17903 return unify_too_few_arguments (explain_p
,
17904 TREE_VEC_LENGTH (argvec
), len
);
17906 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
17908 RECUR_AND_CHECK_FAILURE (tparms
, targs
,
17909 TREE_VEC_ELT (parmvec
, i
),
17910 TREE_VEC_ELT (argvec
, i
),
17911 UNIFY_ALLOW_NONE
, explain_p
);
17914 if (parm_variadic_p
17915 && unify_pack_expansion (tparms
, targs
,
17918 /*subr=*/true, explain_p
))
17921 arg
= TYPE_TI_TEMPLATE (arg
);
17923 /* Fall through to deduce template name. */
17926 if (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
17927 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
17929 /* Deduce template name TT from TT, TT<>, TT<T> and TT<i>. */
17931 /* Simple cases: Value already set, does match or doesn't. */
17932 if (targ
!= NULL_TREE
&& template_args_equal (targ
, arg
))
17933 return unify_success (explain_p
);
17935 return unify_inconsistency (explain_p
, parm
, targ
, arg
);
17939 /* If PARM is `const T' and ARG is only `int', we don't have
17940 a match unless we are allowing additional qualification.
17941 If ARG is `const int' and PARM is just `T' that's OK;
17942 that binds `const int' to `T'. */
17943 if (!check_cv_quals_for_unify (strict_in
| UNIFY_ALLOW_LESS_CV_QUAL
,
17945 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
17947 /* Consider the case where ARG is `const volatile int' and
17948 PARM is `const T'. Then, T should be `volatile int'. */
17949 arg
= cp_build_qualified_type_real
17950 (arg
, cp_type_quals (arg
) & ~cp_type_quals (parm
), tf_none
);
17951 if (arg
== error_mark_node
)
17952 return unify_invalid (explain_p
);
17954 /* Simple cases: Value already set, does match or doesn't. */
17955 if (targ
!= NULL_TREE
&& same_type_p (targ
, arg
))
17956 return unify_success (explain_p
);
17958 return unify_inconsistency (explain_p
, parm
, targ
, arg
);
17960 /* Make sure that ARG is not a variable-sized array. (Note
17961 that were talking about variable-sized arrays (like
17962 `int[n]'), rather than arrays of unknown size (like
17963 `int[]').) We'll get very confused by such a type since
17964 the bound of the array is not constant, and therefore
17965 not mangleable. Besides, such types are not allowed in
17966 ISO C++, so we can do as we please here. We do allow
17967 them for 'auto' deduction, since that isn't ABI-exposed. */
17968 if (!is_auto (parm
) && variably_modified_type_p (arg
, NULL_TREE
))
17969 return unify_vla_arg (explain_p
, arg
);
17971 /* Strip typedefs as in convert_template_argument. */
17972 arg
= canonicalize_type_argument (arg
, tf_none
);
17975 /* If ARG is a parameter pack or an expansion, we cannot unify
17976 against it unless PARM is also a parameter pack. */
17977 if ((template_parameter_pack_p (arg
) || PACK_EXPANSION_P (arg
))
17978 && !template_parameter_pack_p (parm
))
17979 return unify_parameter_pack_mismatch (explain_p
, parm
, arg
);
17981 /* If the argument deduction results is a METHOD_TYPE,
17982 then there is a problem.
17983 METHOD_TYPE doesn't map to any real C++ type the result of
17984 the deduction can not be of that type. */
17985 if (TREE_CODE (arg
) == METHOD_TYPE
)
17986 return unify_method_type_error (explain_p
, arg
);
17988 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = arg
;
17989 return unify_success (explain_p
);
17991 case TEMPLATE_PARM_INDEX
:
17992 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
17993 if (error_operand_p (tparm
))
17994 return unify_invalid (explain_p
);
17996 if (TEMPLATE_PARM_LEVEL (parm
)
17997 != template_decl_level (tparm
))
17999 /* The PARM is not one we're trying to unify. Just check
18000 to see if it matches ARG. */
18001 int result
= !(TREE_CODE (arg
) == TREE_CODE (parm
)
18002 && cp_tree_equal (parm
, arg
));
18004 unify_expression_unequal (explain_p
, parm
, arg
);
18008 idx
= TEMPLATE_PARM_IDX (parm
);
18009 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
18013 int x
= !cp_tree_equal (targ
, arg
);
18015 unify_inconsistency (explain_p
, parm
, targ
, arg
);
18019 /* [temp.deduct.type] If, in the declaration of a function template
18020 with a non-type template-parameter, the non-type
18021 template-parameter is used in an expression in the function
18022 parameter-list and, if the corresponding template-argument is
18023 deduced, the template-argument type shall match the type of the
18024 template-parameter exactly, except that a template-argument
18025 deduced from an array bound may be of any integral type.
18026 The non-type parameter might use already deduced type parameters. */
18027 tparm
= tsubst (TREE_TYPE (parm
), targs
, 0, NULL_TREE
);
18028 if (!TREE_TYPE (arg
))
18029 /* Template-parameter dependent expression. Just accept it for now.
18030 It will later be processed in convert_template_argument. */
18032 else if (same_type_p (TREE_TYPE (arg
), tparm
))
18034 else if ((strict
& UNIFY_ALLOW_INTEGER
)
18035 && CP_INTEGRAL_TYPE_P (tparm
))
18036 /* Convert the ARG to the type of PARM; the deduced non-type
18037 template argument must exactly match the types of the
18038 corresponding parameter. */
18039 arg
= fold (build_nop (tparm
, arg
));
18040 else if (uses_template_parms (tparm
))
18041 /* We haven't deduced the type of this parameter yet. Try again
18043 return unify_success (explain_p
);
18045 return unify_type_mismatch (explain_p
, tparm
, TREE_TYPE (arg
));
18047 /* If ARG is a parameter pack or an expansion, we cannot unify
18048 against it unless PARM is also a parameter pack. */
18049 if ((template_parameter_pack_p (arg
) || PACK_EXPANSION_P (arg
))
18050 && !TEMPLATE_PARM_PARAMETER_PACK (parm
))
18051 return unify_parameter_pack_mismatch (explain_p
, parm
, arg
);
18053 arg
= strip_typedefs_expr (arg
);
18054 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = arg
;
18055 return unify_success (explain_p
);
18059 /* A pointer-to-member constant can be unified only with
18060 another constant. */
18061 if (TREE_CODE (arg
) != PTRMEM_CST
)
18062 return unify_ptrmem_cst_mismatch (explain_p
, parm
, arg
);
18064 /* Just unify the class member. It would be useless (and possibly
18065 wrong, depending on the strict flags) to unify also
18066 PTRMEM_CST_CLASS, because we want to be sure that both parm and
18067 arg refer to the same variable, even if through different
18068 classes. For instance:
18070 struct A { int x; };
18073 Unification of &A::x and &B::x must succeed. */
18074 return unify (tparms
, targs
, PTRMEM_CST_MEMBER (parm
),
18075 PTRMEM_CST_MEMBER (arg
), strict
, explain_p
);
18080 if (!TYPE_PTR_P (arg
))
18081 return unify_type_mismatch (explain_p
, parm
, arg
);
18083 /* [temp.deduct.call]
18085 A can be another pointer or pointer to member type that can
18086 be converted to the deduced A via a qualification
18087 conversion (_conv.qual_).
18089 We pass down STRICT here rather than UNIFY_ALLOW_NONE.
18090 This will allow for additional cv-qualification of the
18091 pointed-to types if appropriate. */
18093 if (TREE_CODE (TREE_TYPE (arg
)) == RECORD_TYPE
)
18094 /* The derived-to-base conversion only persists through one
18095 level of pointers. */
18096 strict
|= (strict_in
& UNIFY_ALLOW_DERIVED
);
18098 return unify (tparms
, targs
, TREE_TYPE (parm
),
18099 TREE_TYPE (arg
), strict
, explain_p
);
18102 case REFERENCE_TYPE
:
18103 if (TREE_CODE (arg
) != REFERENCE_TYPE
)
18104 return unify_type_mismatch (explain_p
, parm
, arg
);
18105 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
18106 strict
& UNIFY_ALLOW_MORE_CV_QUAL
, explain_p
);
18109 if (TREE_CODE (arg
) != ARRAY_TYPE
)
18110 return unify_type_mismatch (explain_p
, parm
, arg
);
18111 if ((TYPE_DOMAIN (parm
) == NULL_TREE
)
18112 != (TYPE_DOMAIN (arg
) == NULL_TREE
))
18113 return unify_type_mismatch (explain_p
, parm
, arg
);
18114 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
18115 strict
& UNIFY_ALLOW_MORE_CV_QUAL
, explain_p
);
18116 if (TYPE_DOMAIN (parm
) != NULL_TREE
)
18117 return unify_array_domain (tparms
, targs
, TYPE_DOMAIN (parm
),
18118 TYPE_DOMAIN (arg
), explain_p
);
18119 return unify_success (explain_p
);
18126 case ENUMERAL_TYPE
:
18129 if (TREE_CODE (arg
) != TREE_CODE (parm
))
18130 return unify_type_mismatch (explain_p
, parm
, arg
);
18132 /* We have already checked cv-qualification at the top of the
18134 if (!same_type_ignoring_top_level_qualifiers_p (arg
, parm
))
18135 return unify_type_mismatch (explain_p
, parm
, arg
);
18137 /* As far as unification is concerned, this wins. Later checks
18138 will invalidate it if necessary. */
18139 return unify_success (explain_p
);
18141 /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */
18142 /* Type INTEGER_CST can come from ordinary constant template args. */
18144 while (TREE_CODE (arg
) == NOP_EXPR
)
18145 arg
= TREE_OPERAND (arg
, 0);
18147 if (TREE_CODE (arg
) != INTEGER_CST
)
18148 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
18149 return (tree_int_cst_equal (parm
, arg
)
18150 ? unify_success (explain_p
)
18151 : unify_template_argument_mismatch (explain_p
, parm
, arg
));
18155 int i
, len
, argslen
;
18156 int parm_variadic_p
= 0;
18158 if (TREE_CODE (arg
) != TREE_VEC
)
18159 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
18161 len
= TREE_VEC_LENGTH (parm
);
18162 argslen
= TREE_VEC_LENGTH (arg
);
18164 /* Check for pack expansions in the parameters. */
18165 for (i
= 0; i
< len
; ++i
)
18167 if (PACK_EXPANSION_P (TREE_VEC_ELT (parm
, i
)))
18170 /* We can unify against something with a trailing
18172 parm_variadic_p
= 1;
18174 /* [temp.deduct.type]/9: If the template argument list of
18175 P contains a pack expansion that is not the last
18176 template argument, the entire template argument list
18177 is a non-deduced context. */
18178 return unify_success (explain_p
);
18182 /* If we don't have enough arguments to satisfy the parameters
18183 (not counting the pack expression at the end), or we have
18184 too many arguments for a parameter list that doesn't end in
18185 a pack expression, we can't unify. */
18186 if (parm_variadic_p
18187 ? argslen
< len
- parm_variadic_p
18189 return unify_arity (explain_p
, TREE_VEC_LENGTH (arg
), len
);
18191 /* Unify all of the parameters that precede the (optional)
18192 pack expression. */
18193 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
18195 RECUR_AND_CHECK_FAILURE (tparms
, targs
,
18196 TREE_VEC_ELT (parm
, i
),
18197 TREE_VEC_ELT (arg
, i
),
18198 UNIFY_ALLOW_NONE
, explain_p
);
18200 if (parm_variadic_p
)
18201 return unify_pack_expansion (tparms
, targs
, parm
, arg
,
18203 /*subr=*/true, explain_p
);
18204 return unify_success (explain_p
);
18209 if (TREE_CODE (arg
) != TREE_CODE (parm
))
18210 return unify_type_mismatch (explain_p
, parm
, arg
);
18212 if (TYPE_PTRMEMFUNC_P (parm
))
18214 if (!TYPE_PTRMEMFUNC_P (arg
))
18215 return unify_type_mismatch (explain_p
, parm
, arg
);
18217 return unify (tparms
, targs
,
18218 TYPE_PTRMEMFUNC_FN_TYPE (parm
),
18219 TYPE_PTRMEMFUNC_FN_TYPE (arg
),
18220 strict
, explain_p
);
18222 else if (TYPE_PTRMEMFUNC_P (arg
))
18223 return unify_type_mismatch (explain_p
, parm
, arg
);
18225 if (CLASSTYPE_TEMPLATE_INFO (parm
))
18227 tree t
= NULL_TREE
;
18229 if (strict_in
& UNIFY_ALLOW_DERIVED
)
18231 /* First, we try to unify the PARM and ARG directly. */
18232 t
= try_class_unification (tparms
, targs
,
18233 parm
, arg
, explain_p
);
18237 /* Fallback to the special case allowed in
18238 [temp.deduct.call]:
18240 If P is a class, and P has the form
18241 template-id, then A can be a derived class of
18242 the deduced A. Likewise, if P is a pointer to
18243 a class of the form template-id, A can be a
18244 pointer to a derived class pointed to by the
18246 enum template_base_result r
;
18247 r
= get_template_base (tparms
, targs
, parm
, arg
,
18251 return unify_no_common_base (explain_p
, r
, parm
, arg
);
18254 else if (CLASSTYPE_TEMPLATE_INFO (arg
)
18255 && (CLASSTYPE_TI_TEMPLATE (parm
)
18256 == CLASSTYPE_TI_TEMPLATE (arg
)))
18257 /* Perhaps PARM is something like S<U> and ARG is S<int>.
18258 Then, we should unify `int' and `U'. */
18261 /* There's no chance of unification succeeding. */
18262 return unify_type_mismatch (explain_p
, parm
, arg
);
18264 return unify (tparms
, targs
, CLASSTYPE_TI_ARGS (parm
),
18265 CLASSTYPE_TI_ARGS (t
), UNIFY_ALLOW_NONE
, explain_p
);
18267 else if (!same_type_ignoring_top_level_qualifiers_p (parm
, arg
))
18268 return unify_type_mismatch (explain_p
, parm
, arg
);
18269 return unify_success (explain_p
);
18272 case FUNCTION_TYPE
:
18274 unsigned int nargs
;
18279 if (TREE_CODE (arg
) != TREE_CODE (parm
))
18280 return unify_type_mismatch (explain_p
, parm
, arg
);
18282 /* CV qualifications for methods can never be deduced, they must
18283 match exactly. We need to check them explicitly here,
18284 because type_unification_real treats them as any other
18285 cv-qualified parameter. */
18286 if (TREE_CODE (parm
) == METHOD_TYPE
18287 && (!check_cv_quals_for_unify
18289 class_of_this_parm (arg
),
18290 class_of_this_parm (parm
))))
18291 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
18293 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TREE_TYPE (parm
),
18294 TREE_TYPE (arg
), UNIFY_ALLOW_NONE
, explain_p
);
18296 nargs
= list_length (TYPE_ARG_TYPES (arg
));
18297 args
= XALLOCAVEC (tree
, nargs
);
18298 for (a
= TYPE_ARG_TYPES (arg
), i
= 0;
18299 a
!= NULL_TREE
&& a
!= void_list_node
;
18300 a
= TREE_CHAIN (a
), ++i
)
18301 args
[i
] = TREE_VALUE (a
);
18304 return type_unification_real (tparms
, targs
, TYPE_ARG_TYPES (parm
),
18305 args
, nargs
, 1, DEDUCE_EXACT
,
18306 LOOKUP_NORMAL
, NULL
, explain_p
);
18310 /* Unify a pointer to member with a pointer to member function, which
18311 deduces the type of the member as a function type. */
18312 if (TYPE_PTRMEMFUNC_P (arg
))
18314 /* Check top-level cv qualifiers */
18315 if (!check_cv_quals_for_unify (UNIFY_ALLOW_NONE
, arg
, parm
))
18316 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
18318 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
18319 TYPE_PTRMEMFUNC_OBJECT_TYPE (arg
),
18320 UNIFY_ALLOW_NONE
, explain_p
);
18322 /* Determine the type of the function we are unifying against. */
18323 tree fntype
= static_fn_type (arg
);
18325 return unify (tparms
, targs
, TREE_TYPE (parm
), fntype
, strict
, explain_p
);
18328 if (TREE_CODE (arg
) != OFFSET_TYPE
)
18329 return unify_type_mismatch (explain_p
, parm
, arg
);
18330 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
18331 TYPE_OFFSET_BASETYPE (arg
),
18332 UNIFY_ALLOW_NONE
, explain_p
);
18333 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
18334 strict
, explain_p
);
18337 if (DECL_TEMPLATE_PARM_P (parm
))
18338 return unify (tparms
, targs
, DECL_INITIAL (parm
), arg
, strict
, explain_p
);
18339 if (arg
!= integral_constant_value (parm
))
18340 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
18341 return unify_success (explain_p
);
18344 case TEMPLATE_DECL
:
18345 /* Matched cases are handled by the ARG == PARM test above. */
18346 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
18349 /* A non-type template parameter that is a variable should be a
18350 an integral constant, in which case, it whould have been
18351 folded into its (constant) value. So we should not be getting
18352 a variable here. */
18353 gcc_unreachable ();
18355 case TYPE_ARGUMENT_PACK
:
18356 case NONTYPE_ARGUMENT_PACK
:
18357 return unify (tparms
, targs
, ARGUMENT_PACK_ARGS (parm
),
18358 ARGUMENT_PACK_ARGS (arg
), strict
, explain_p
);
18361 case DECLTYPE_TYPE
:
18362 case UNDERLYING_TYPE
:
18363 /* Cannot deduce anything from TYPEOF_TYPE, DECLTYPE_TYPE,
18364 or UNDERLYING_TYPE nodes. */
18365 return unify_success (explain_p
);
18368 /* Unification fails if we hit an error node. */
18369 return unify_invalid (explain_p
);
18372 if (REFERENCE_REF_P (parm
))
18373 return unify (tparms
, targs
, TREE_OPERAND (parm
, 0), arg
,
18374 strict
, explain_p
);
18378 /* An unresolved overload is a nondeduced context. */
18379 if (is_overloaded_fn (parm
) || type_unknown_p (parm
))
18380 return unify_success (explain_p
);
18381 gcc_assert (EXPR_P (parm
));
18383 /* We must be looking at an expression. This can happen with
18387 void foo(S<I>, S<I + 2>);
18389 This is a "nondeduced context":
18393 The nondeduced contexts are:
18395 --A type that is a template-id in which one or more of
18396 the template-arguments is an expression that references
18397 a template-parameter.
18399 In these cases, we assume deduction succeeded, but don't
18400 actually infer any unifications. */
18402 if (!uses_template_parms (parm
)
18403 && !template_args_equal (parm
, arg
))
18404 return unify_expression_unequal (explain_p
, parm
, arg
);
18406 return unify_success (explain_p
);
18409 #undef RECUR_AND_CHECK_FAILURE
18411 /* Note that DECL can be defined in this translation unit, if
18415 mark_definable (tree decl
)
18418 DECL_NOT_REALLY_EXTERN (decl
) = 1;
18419 FOR_EACH_CLONE (clone
, decl
)
18420 DECL_NOT_REALLY_EXTERN (clone
) = 1;
18423 /* Called if RESULT is explicitly instantiated, or is a member of an
18424 explicitly instantiated class. */
18427 mark_decl_instantiated (tree result
, int extern_p
)
18429 SET_DECL_EXPLICIT_INSTANTIATION (result
);
18431 /* If this entity has already been written out, it's too late to
18432 make any modifications. */
18433 if (TREE_ASM_WRITTEN (result
))
18436 /* For anonymous namespace we don't need to do anything. */
18437 if (decl_anon_ns_mem_p (result
))
18439 gcc_assert (!TREE_PUBLIC (result
));
18443 if (TREE_CODE (result
) != FUNCTION_DECL
)
18444 /* The TREE_PUBLIC flag for function declarations will have been
18445 set correctly by tsubst. */
18446 TREE_PUBLIC (result
) = 1;
18448 /* This might have been set by an earlier implicit instantiation. */
18449 DECL_COMDAT (result
) = 0;
18452 DECL_NOT_REALLY_EXTERN (result
) = 0;
18455 mark_definable (result
);
18456 mark_needed (result
);
18457 /* Always make artificials weak. */
18458 if (DECL_ARTIFICIAL (result
) && flag_weak
)
18459 comdat_linkage (result
);
18460 /* For WIN32 we also want to put explicit instantiations in
18461 linkonce sections. */
18462 else if (TREE_PUBLIC (result
))
18463 maybe_make_one_only (result
);
18466 /* If EXTERN_P, then this function will not be emitted -- unless
18467 followed by an explicit instantiation, at which point its linkage
18468 will be adjusted. If !EXTERN_P, then this function will be
18469 emitted here. In neither circumstance do we want
18470 import_export_decl to adjust the linkage. */
18471 DECL_INTERFACE_KNOWN (result
) = 1;
18474 /* Subroutine of more_specialized_fn: check whether TARGS is missing any
18475 important template arguments. If any are missing, we check whether
18476 they're important by using error_mark_node for substituting into any
18477 args that were used for partial ordering (the ones between ARGS and END)
18478 and seeing if it bubbles up. */
18481 check_undeduced_parms (tree targs
, tree args
, tree end
)
18483 bool found
= false;
18485 for (i
= TREE_VEC_LENGTH (targs
) - 1; i
>= 0; --i
)
18486 if (TREE_VEC_ELT (targs
, i
) == NULL_TREE
)
18489 TREE_VEC_ELT (targs
, i
) = error_mark_node
;
18493 tree substed
= tsubst_arg_types (args
, targs
, end
, tf_none
, NULL_TREE
);
18494 if (substed
== error_mark_node
)
18500 /* Given two function templates PAT1 and PAT2, return:
18502 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order].
18503 -1 if PAT2 is more specialized than PAT1.
18504 0 if neither is more specialized.
18506 LEN indicates the number of parameters we should consider
18507 (defaulted parameters should not be considered).
18509 The 1998 std underspecified function template partial ordering, and
18510 DR214 addresses the issue. We take pairs of arguments, one from
18511 each of the templates, and deduce them against each other. One of
18512 the templates will be more specialized if all the *other*
18513 template's arguments deduce against its arguments and at least one
18514 of its arguments *does* *not* deduce against the other template's
18515 corresponding argument. Deduction is done as for class templates.
18516 The arguments used in deduction have reference and top level cv
18517 qualifiers removed. Iff both arguments were originally reference
18518 types *and* deduction succeeds in both directions, an lvalue reference
18519 wins against an rvalue reference and otherwise the template
18520 with the more cv-qualified argument wins for that pairing (if
18521 neither is more cv-qualified, they both are equal). Unlike regular
18522 deduction, after all the arguments have been deduced in this way,
18523 we do *not* verify the deduced template argument values can be
18524 substituted into non-deduced contexts.
18526 The logic can be a bit confusing here, because we look at deduce1 and
18527 targs1 to see if pat2 is at least as specialized, and vice versa; if we
18528 can find template arguments for pat1 to make arg1 look like arg2, that
18529 means that arg2 is at least as specialized as arg1. */
18532 more_specialized_fn (tree pat1
, tree pat2
, int len
)
18534 tree decl1
= DECL_TEMPLATE_RESULT (pat1
);
18535 tree decl2
= DECL_TEMPLATE_RESULT (pat2
);
18536 tree targs1
= make_tree_vec (DECL_NTPARMS (pat1
));
18537 tree targs2
= make_tree_vec (DECL_NTPARMS (pat2
));
18538 tree tparms1
= DECL_INNERMOST_TEMPLATE_PARMS (pat1
);
18539 tree tparms2
= DECL_INNERMOST_TEMPLATE_PARMS (pat2
);
18540 tree args1
= TYPE_ARG_TYPES (TREE_TYPE (decl1
));
18541 tree args2
= TYPE_ARG_TYPES (TREE_TYPE (decl2
));
18542 tree origs1
, origs2
;
18543 bool lose1
= false;
18544 bool lose2
= false;
18546 /* Remove the this parameter from non-static member functions. If
18547 one is a non-static member function and the other is not a static
18548 member function, remove the first parameter from that function
18549 also. This situation occurs for operator functions where we
18550 locate both a member function (with this pointer) and non-member
18551 operator (with explicit first operand). */
18552 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl1
))
18554 len
--; /* LEN is the number of significant arguments for DECL1 */
18555 args1
= TREE_CHAIN (args1
);
18556 if (!DECL_STATIC_FUNCTION_P (decl2
))
18557 args2
= TREE_CHAIN (args2
);
18559 else if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl2
))
18561 args2
= TREE_CHAIN (args2
);
18562 if (!DECL_STATIC_FUNCTION_P (decl1
))
18565 args1
= TREE_CHAIN (args1
);
18569 /* If only one is a conversion operator, they are unordered. */
18570 if (DECL_CONV_FN_P (decl1
) != DECL_CONV_FN_P (decl2
))
18573 /* Consider the return type for a conversion function */
18574 if (DECL_CONV_FN_P (decl1
))
18576 args1
= tree_cons (NULL_TREE
, TREE_TYPE (TREE_TYPE (decl1
)), args1
);
18577 args2
= tree_cons (NULL_TREE
, TREE_TYPE (TREE_TYPE (decl2
)), args2
);
18581 processing_template_decl
++;
18587 /* Stop when an ellipsis is seen. */
18588 && args1
!= NULL_TREE
&& args2
!= NULL_TREE
)
18590 tree arg1
= TREE_VALUE (args1
);
18591 tree arg2
= TREE_VALUE (args2
);
18592 int deduce1
, deduce2
;
18598 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
18599 && TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
18601 /* When both arguments are pack expansions, we need only
18602 unify the patterns themselves. */
18603 arg1
= PACK_EXPANSION_PATTERN (arg1
);
18604 arg2
= PACK_EXPANSION_PATTERN (arg2
);
18606 /* This is the last comparison we need to do. */
18610 if (TREE_CODE (arg1
) == REFERENCE_TYPE
)
18612 ref1
= TYPE_REF_IS_RVALUE (arg1
) + 1;
18613 arg1
= TREE_TYPE (arg1
);
18614 quals1
= cp_type_quals (arg1
);
18617 if (TREE_CODE (arg2
) == REFERENCE_TYPE
)
18619 ref2
= TYPE_REF_IS_RVALUE (arg2
) + 1;
18620 arg2
= TREE_TYPE (arg2
);
18621 quals2
= cp_type_quals (arg2
);
18624 arg1
= TYPE_MAIN_VARIANT (arg1
);
18625 arg2
= TYPE_MAIN_VARIANT (arg2
);
18627 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
)
18629 int i
, len2
= list_length (args2
);
18630 tree parmvec
= make_tree_vec (1);
18631 tree argvec
= make_tree_vec (len2
);
18634 /* Setup the parameter vector, which contains only ARG1. */
18635 TREE_VEC_ELT (parmvec
, 0) = arg1
;
18637 /* Setup the argument vector, which contains the remaining
18639 for (i
= 0; i
< len2
; i
++, ta
= TREE_CHAIN (ta
))
18640 TREE_VEC_ELT (argvec
, i
) = TREE_VALUE (ta
);
18642 deduce1
= (unify_pack_expansion (tparms1
, targs1
, parmvec
,
18643 argvec
, DEDUCE_EXACT
,
18644 /*subr=*/true, /*explain_p=*/false)
18647 /* We cannot deduce in the other direction, because ARG1 is
18648 a pack expansion but ARG2 is not. */
18651 else if (TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
18653 int i
, len1
= list_length (args1
);
18654 tree parmvec
= make_tree_vec (1);
18655 tree argvec
= make_tree_vec (len1
);
18658 /* Setup the parameter vector, which contains only ARG1. */
18659 TREE_VEC_ELT (parmvec
, 0) = arg2
;
18661 /* Setup the argument vector, which contains the remaining
18663 for (i
= 0; i
< len1
; i
++, ta
= TREE_CHAIN (ta
))
18664 TREE_VEC_ELT (argvec
, i
) = TREE_VALUE (ta
);
18666 deduce2
= (unify_pack_expansion (tparms2
, targs2
, parmvec
,
18667 argvec
, DEDUCE_EXACT
,
18668 /*subr=*/true, /*explain_p=*/false)
18671 /* We cannot deduce in the other direction, because ARG2 is
18672 a pack expansion but ARG1 is not.*/
18678 /* The normal case, where neither argument is a pack
18680 deduce1
= (unify (tparms1
, targs1
, arg1
, arg2
,
18681 UNIFY_ALLOW_NONE
, /*explain_p=*/false)
18683 deduce2
= (unify (tparms2
, targs2
, arg2
, arg1
,
18684 UNIFY_ALLOW_NONE
, /*explain_p=*/false)
18688 /* If we couldn't deduce arguments for tparms1 to make arg1 match
18689 arg2, then arg2 is not as specialized as arg1. */
18695 /* "If, for a given type, deduction succeeds in both directions
18696 (i.e., the types are identical after the transformations above)
18697 and both P and A were reference types (before being replaced with
18698 the type referred to above):
18699 - if the type from the argument template was an lvalue reference and
18700 the type from the parameter template was not, the argument type is
18701 considered to be more specialized than the other; otherwise,
18702 - if the type from the argument template is more cv-qualified
18703 than the type from the parameter template (as described above),
18704 the argument type is considered to be more specialized than the other;
18706 - neither type is more specialized than the other." */
18708 if (deduce1
&& deduce2
)
18710 if (ref1
&& ref2
&& ref1
!= ref2
)
18717 else if (quals1
!= quals2
&& quals1
>= 0 && quals2
>= 0)
18719 if ((quals1
& quals2
) == quals2
)
18721 if ((quals1
& quals2
) == quals1
)
18726 if (lose1
&& lose2
)
18727 /* We've failed to deduce something in either direction.
18728 These must be unordered. */
18731 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
18732 || TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
18733 /* We have already processed all of the arguments in our
18734 handing of the pack expansion type. */
18737 args1
= TREE_CHAIN (args1
);
18738 args2
= TREE_CHAIN (args2
);
18741 /* "In most cases, all template parameters must have values in order for
18742 deduction to succeed, but for partial ordering purposes a template
18743 parameter may remain without a value provided it is not used in the
18744 types being used for partial ordering."
18746 Thus, if we are missing any of the targs1 we need to substitute into
18747 origs1, then pat2 is not as specialized as pat1. This can happen when
18748 there is a nondeduced context. */
18749 if (!lose2
&& check_undeduced_parms (targs1
, origs1
, args1
))
18751 if (!lose1
&& check_undeduced_parms (targs2
, origs2
, args2
))
18754 processing_template_decl
--;
18756 /* All things being equal, if the next argument is a pack expansion
18757 for one function but not for the other, prefer the
18758 non-variadic function. FIXME this is bogus; see c++/41958. */
18760 && args1
&& TREE_VALUE (args1
)
18761 && args2
&& TREE_VALUE (args2
))
18763 lose1
= TREE_CODE (TREE_VALUE (args1
)) == TYPE_PACK_EXPANSION
;
18764 lose2
= TREE_CODE (TREE_VALUE (args2
)) == TYPE_PACK_EXPANSION
;
18767 if (lose1
== lose2
)
18775 /* Determine which of two partial specializations of TMPL is more
18778 PAT1 is a TREE_LIST whose TREE_TYPE is the _TYPE node corresponding
18779 to the first partial specialization. The TREE_VALUE is the
18780 innermost set of template parameters for the partial
18781 specialization. PAT2 is similar, but for the second template.
18783 Return 1 if the first partial specialization is more specialized;
18784 -1 if the second is more specialized; 0 if neither is more
18787 See [temp.class.order] for information about determining which of
18788 two templates is more specialized. */
18791 more_specialized_class (tree tmpl
, tree pat1
, tree pat2
)
18796 bool any_deductions
= false;
18798 tmpl1
= TREE_TYPE (pat1
);
18799 tmpl2
= TREE_TYPE (pat2
);
18801 /* Just like what happens for functions, if we are ordering between
18802 different class template specializations, we may encounter dependent
18803 types in the arguments, and we need our dependency check functions
18804 to behave correctly. */
18805 ++processing_template_decl
;
18806 targs
= get_class_bindings (tmpl
, TREE_VALUE (pat1
),
18807 CLASSTYPE_TI_ARGS (tmpl1
),
18808 CLASSTYPE_TI_ARGS (tmpl2
));
18812 any_deductions
= true;
18815 targs
= get_class_bindings (tmpl
, TREE_VALUE (pat2
),
18816 CLASSTYPE_TI_ARGS (tmpl2
),
18817 CLASSTYPE_TI_ARGS (tmpl1
));
18821 any_deductions
= true;
18823 --processing_template_decl
;
18825 /* In the case of a tie where at least one of the class templates
18826 has a parameter pack at the end, the template with the most
18827 non-packed parameters wins. */
18830 && (template_args_variadic_p (TREE_PURPOSE (pat1
))
18831 || template_args_variadic_p (TREE_PURPOSE (pat2
))))
18833 tree args1
= INNERMOST_TEMPLATE_ARGS (TREE_PURPOSE (pat1
));
18834 tree args2
= INNERMOST_TEMPLATE_ARGS (TREE_PURPOSE (pat2
));
18835 int len1
= TREE_VEC_LENGTH (args1
);
18836 int len2
= TREE_VEC_LENGTH (args2
);
18838 /* We don't count the pack expansion at the end. */
18839 if (template_args_variadic_p (TREE_PURPOSE (pat1
)))
18841 if (template_args_variadic_p (TREE_PURPOSE (pat2
)))
18846 else if (len1
< len2
)
18853 /* Return the template arguments that will produce the function signature
18854 DECL from the function template FN, with the explicit template
18855 arguments EXPLICIT_ARGS. If CHECK_RETTYPE is true, the return type must
18856 also match. Return NULL_TREE if no satisfactory arguments could be
18860 get_bindings (tree fn
, tree decl
, tree explicit_args
, bool check_rettype
)
18862 int ntparms
= DECL_NTPARMS (fn
);
18863 tree targs
= make_tree_vec (ntparms
);
18864 tree decl_type
= TREE_TYPE (decl
);
18865 tree decl_arg_types
;
18867 unsigned int nargs
, ix
;
18870 gcc_assert (decl
!= DECL_TEMPLATE_RESULT (fn
));
18872 /* Never do unification on the 'this' parameter. */
18873 decl_arg_types
= skip_artificial_parms_for (decl
,
18874 TYPE_ARG_TYPES (decl_type
));
18876 nargs
= list_length (decl_arg_types
);
18877 args
= XALLOCAVEC (tree
, nargs
);
18878 for (arg
= decl_arg_types
, ix
= 0;
18879 arg
!= NULL_TREE
&& arg
!= void_list_node
;
18880 arg
= TREE_CHAIN (arg
), ++ix
)
18881 args
[ix
] = TREE_VALUE (arg
);
18883 if (fn_type_unification (fn
, explicit_args
, targs
,
18885 (check_rettype
|| DECL_CONV_FN_P (fn
)
18886 ? TREE_TYPE (decl_type
) : NULL_TREE
),
18887 DEDUCE_EXACT
, LOOKUP_NORMAL
, /*explain_p=*/false,
18889 == error_mark_node
)
18895 /* Return the innermost template arguments that, when applied to a partial
18896 specialization of TMPL whose innermost template parameters are
18897 TPARMS, and whose specialization arguments are SPEC_ARGS, yield the
18900 For example, suppose we have:
18902 template <class T, class U> struct S {};
18903 template <class T> struct S<T*, int> {};
18905 Then, suppose we want to get `S<double*, int>'. The TPARMS will be
18906 {T}, the SPEC_ARGS will be {T*, int} and the ARGS will be {double*,
18907 int}. The resulting vector will be {double}, indicating that `T'
18908 is bound to `double'. */
18911 get_class_bindings (tree tmpl
, tree tparms
, tree spec_args
, tree args
)
18913 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
18915 tree innermost_deduced_args
;
18917 innermost_deduced_args
= make_tree_vec (ntparms
);
18918 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
18920 deduced_args
= copy_node (args
);
18921 SET_TMPL_ARGS_LEVEL (deduced_args
,
18922 TMPL_ARGS_DEPTH (deduced_args
),
18923 innermost_deduced_args
);
18926 deduced_args
= innermost_deduced_args
;
18928 if (unify (tparms
, deduced_args
,
18929 INNERMOST_TEMPLATE_ARGS (spec_args
),
18930 INNERMOST_TEMPLATE_ARGS (args
),
18931 UNIFY_ALLOW_NONE
, /*explain_p=*/false))
18934 for (i
= 0; i
< ntparms
; ++i
)
18935 if (! TREE_VEC_ELT (innermost_deduced_args
, i
))
18938 /* Verify that nondeduced template arguments agree with the type
18939 obtained from argument deduction.
18943 struct A { typedef int X; };
18944 template <class T, class U> struct C {};
18945 template <class T> struct C<T, typename T::X> {};
18947 Then with the instantiation `C<A, int>', we can deduce that
18948 `T' is `A' but unify () does not check whether `typename T::X'
18950 spec_args
= tsubst (spec_args
, deduced_args
, tf_none
, NULL_TREE
);
18951 spec_args
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
18953 tf_none
, false, false);
18954 if (spec_args
== error_mark_node
18955 /* We only need to check the innermost arguments; the other
18956 arguments will always agree. */
18957 || !comp_template_args (INNERMOST_TEMPLATE_ARGS (spec_args
),
18958 INNERMOST_TEMPLATE_ARGS (args
)))
18961 /* Now that we have bindings for all of the template arguments,
18962 ensure that the arguments deduced for the template template
18963 parameters have compatible template parameter lists. See the use
18964 of template_template_parm_bindings_ok_p in fn_type_unification
18965 for more information. */
18966 if (!template_template_parm_bindings_ok_p (tparms
, deduced_args
))
18969 return deduced_args
;
18972 /* TEMPLATES is a TREE_LIST. Each TREE_VALUE is a TEMPLATE_DECL.
18973 Return the TREE_LIST node with the most specialized template, if
18974 any. If there is no most specialized template, the error_mark_node
18977 Note that this function does not look at, or modify, the
18978 TREE_PURPOSE or TREE_TYPE of any of the nodes. Since the node
18979 returned is one of the elements of INSTANTIATIONS, callers may
18980 store information in the TREE_PURPOSE or TREE_TYPE of the nodes,
18981 and retrieve it from the value returned. */
18984 most_specialized_instantiation (tree templates
)
18988 ++processing_template_decl
;
18991 for (fn
= TREE_CHAIN (templates
); fn
; fn
= TREE_CHAIN (fn
))
18995 if (get_bindings (TREE_VALUE (champ
),
18996 DECL_TEMPLATE_RESULT (TREE_VALUE (fn
)),
18997 NULL_TREE
, /*check_ret=*/true))
19000 if (get_bindings (TREE_VALUE (fn
),
19001 DECL_TEMPLATE_RESULT (TREE_VALUE (champ
)),
19002 NULL_TREE
, /*check_ret=*/true))
19009 /* Equally specialized, move to next function. If there
19010 is no next function, nothing's most specialized. */
19011 fn
= TREE_CHAIN (fn
);
19019 /* Now verify that champ is better than everything earlier in the
19020 instantiation list. */
19021 for (fn
= templates
; fn
!= champ
; fn
= TREE_CHAIN (fn
))
19022 if (get_bindings (TREE_VALUE (champ
),
19023 DECL_TEMPLATE_RESULT (TREE_VALUE (fn
)),
19024 NULL_TREE
, /*check_ret=*/true)
19025 || !get_bindings (TREE_VALUE (fn
),
19026 DECL_TEMPLATE_RESULT (TREE_VALUE (champ
)),
19027 NULL_TREE
, /*check_ret=*/true))
19033 processing_template_decl
--;
19036 return error_mark_node
;
19041 /* If DECL is a specialization of some template, return the most
19042 general such template. Otherwise, returns NULL_TREE.
19044 For example, given:
19046 template <class T> struct S { template <class U> void f(U); };
19048 if TMPL is `template <class U> void S<int>::f(U)' this will return
19049 the full template. This function will not trace past partial
19050 specializations, however. For example, given in addition:
19052 template <class T> struct S<T*> { template <class U> void f(U); };
19054 if TMPL is `template <class U> void S<int*>::f(U)' this will return
19055 `template <class T> template <class U> S<T*>::f(U)'. */
19058 most_general_template (tree decl
)
19060 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
19062 if (tree tinfo
= get_template_info (decl
))
19063 decl
= TI_TEMPLATE (tinfo
);
19064 /* The TI_TEMPLATE can be an IDENTIFIER_NODE for a
19065 template friend, or a FIELD_DECL for a capture pack. */
19066 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
19070 /* Look for more and more general templates. */
19071 while (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
))
19073 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE in some cases.
19074 (See cp-tree.h for details.) */
19075 if (TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
19078 if (CLASS_TYPE_P (TREE_TYPE (decl
))
19079 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)))
19082 /* Stop if we run into an explicitly specialized class template. */
19083 if (!DECL_NAMESPACE_SCOPE_P (decl
)
19084 && DECL_CONTEXT (decl
)
19085 && CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (decl
)))
19088 decl
= DECL_TI_TEMPLATE (decl
);
19094 /* Return the most specialized of the class template partial
19095 specializations which can produce TYPE, a specialization of some class
19096 template. The value returned is actually a TREE_LIST; the TREE_TYPE is
19097 a _TYPE node corresponding to the partial specialization, while the
19098 TREE_PURPOSE is the set of template arguments that must be
19099 substituted into the TREE_TYPE in order to generate TYPE.
19101 If the choice of partial specialization is ambiguous, a diagnostic
19102 is issued, and the error_mark_node is returned. If there are no
19103 partial specializations matching TYPE, then NULL_TREE is
19104 returned, indicating that the primary template should be used. */
19107 most_specialized_class (tree type
, tsubst_flags_t complain
)
19109 tree list
= NULL_TREE
;
19114 tree outer_args
= NULL_TREE
;
19116 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
19117 tree main_tmpl
= most_general_template (tmpl
);
19118 tree args
= CLASSTYPE_TI_ARGS (type
);
19120 /* For determining which partial specialization to use, only the
19121 innermost args are interesting. */
19122 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
19124 outer_args
= strip_innermost_template_args (args
, 1);
19125 args
= INNERMOST_TEMPLATE_ARGS (args
);
19128 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (main_tmpl
); t
; t
= TREE_CHAIN (t
))
19130 tree partial_spec_args
;
19132 tree spec_tmpl
= TREE_VALUE (t
);
19133 tree orig_parms
= DECL_INNERMOST_TEMPLATE_PARMS (spec_tmpl
);
19135 partial_spec_args
= CLASSTYPE_TI_ARGS (TREE_TYPE (t
));
19137 ++processing_template_decl
;
19141 /* Discard the outer levels of args, and then substitute in the
19142 template args from the enclosing class. */
19143 partial_spec_args
= INNERMOST_TEMPLATE_ARGS (partial_spec_args
);
19144 partial_spec_args
= tsubst_template_args
19145 (partial_spec_args
, outer_args
, tf_none
, NULL_TREE
);
19147 /* And the same for the partial specialization TEMPLATE_DECL. */
19148 spec_tmpl
= tsubst (spec_tmpl
, outer_args
, tf_none
, NULL_TREE
);
19151 partial_spec_args
=
19152 coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
19155 /*require_all_args=*/true,
19156 /*use_default_args=*/true);
19158 --processing_template_decl
;
19160 if (partial_spec_args
== error_mark_node
)
19161 return error_mark_node
;
19162 if (spec_tmpl
== error_mark_node
)
19163 return error_mark_node
;
19165 tree parms
= DECL_INNERMOST_TEMPLATE_PARMS (spec_tmpl
);
19166 spec_args
= get_class_bindings (tmpl
, parms
,
19172 spec_args
= add_to_template_args (outer_args
, spec_args
);
19173 list
= tree_cons (spec_args
, orig_parms
, list
);
19174 TREE_TYPE (list
) = TREE_TYPE (t
);
19181 ambiguous_p
= false;
19184 t
= TREE_CHAIN (t
);
19185 for (; t
; t
= TREE_CHAIN (t
))
19187 fate
= more_specialized_class (tmpl
, champ
, t
);
19194 t
= TREE_CHAIN (t
);
19197 ambiguous_p
= true;
19206 for (t
= list
; t
&& t
!= champ
; t
= TREE_CHAIN (t
))
19208 fate
= more_specialized_class (tmpl
, champ
, t
);
19211 ambiguous_p
= true;
19219 char *spaces
= NULL
;
19220 if (!(complain
& tf_error
))
19221 return error_mark_node
;
19222 error ("ambiguous class template instantiation for %q#T", type
);
19223 str
= ngettext ("candidate is:", "candidates are:", list_length (list
));
19224 for (t
= list
; t
; t
= TREE_CHAIN (t
))
19226 error ("%s %+#T", spaces
? spaces
: str
, TREE_TYPE (t
));
19227 spaces
= spaces
? spaces
: get_spaces (str
);
19230 return error_mark_node
;
19236 /* Explicitly instantiate DECL. */
19239 do_decl_instantiation (tree decl
, tree storage
)
19241 tree result
= NULL_TREE
;
19244 if (!decl
|| decl
== error_mark_node
)
19245 /* An error occurred, for which grokdeclarator has already issued
19246 an appropriate message. */
19248 else if (! DECL_LANG_SPECIFIC (decl
))
19250 error ("explicit instantiation of non-template %q#D", decl
);
19254 bool var_templ
= (DECL_TEMPLATE_INFO (decl
)
19255 && variable_template_p (DECL_TI_TEMPLATE (decl
)));
19257 if (VAR_P (decl
) && !var_templ
)
19259 /* There is an asymmetry here in the way VAR_DECLs and
19260 FUNCTION_DECLs are handled by grokdeclarator. In the case of
19261 the latter, the DECL we get back will be marked as a
19262 template instantiation, and the appropriate
19263 DECL_TEMPLATE_INFO will be set up. This does not happen for
19264 VAR_DECLs so we do the lookup here. Probably, grokdeclarator
19265 should handle VAR_DECLs as it currently handles
19267 if (!DECL_CLASS_SCOPE_P (decl
))
19269 error ("%qD is not a static data member of a class template", decl
);
19272 result
= lookup_field (DECL_CONTEXT (decl
), DECL_NAME (decl
), 0, false);
19273 if (!result
|| !VAR_P (result
))
19275 error ("no matching template for %qD found", decl
);
19278 if (!same_type_p (TREE_TYPE (result
), TREE_TYPE (decl
)))
19280 error ("type %qT for explicit instantiation %qD does not match "
19281 "declared type %qT", TREE_TYPE (result
), decl
,
19286 else if (TREE_CODE (decl
) != FUNCTION_DECL
&& !var_templ
)
19288 error ("explicit instantiation of %q#D", decl
);
19294 /* Check for various error cases. Note that if the explicit
19295 instantiation is valid the RESULT will currently be marked as an
19296 *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set
19297 until we get here. */
19299 if (DECL_TEMPLATE_SPECIALIZATION (result
))
19301 /* DR 259 [temp.spec].
19303 Both an explicit instantiation and a declaration of an explicit
19304 specialization shall not appear in a program unless the explicit
19305 instantiation follows a declaration of the explicit specialization.
19307 For a given set of template parameters, if an explicit
19308 instantiation of a template appears after a declaration of an
19309 explicit specialization for that template, the explicit
19310 instantiation has no effect. */
19313 else if (DECL_EXPLICIT_INSTANTIATION (result
))
19317 No program shall explicitly instantiate any template more
19320 We check DECL_NOT_REALLY_EXTERN so as not to complain when
19321 the first instantiation was `extern' and the second is not,
19322 and EXTERN_P for the opposite case. */
19323 if (DECL_NOT_REALLY_EXTERN (result
) && !extern_p
)
19324 permerror (input_location
, "duplicate explicit instantiation of %q#D", result
);
19325 /* If an "extern" explicit instantiation follows an ordinary
19326 explicit instantiation, the template is instantiated. */
19330 else if (!DECL_IMPLICIT_INSTANTIATION (result
))
19332 error ("no matching template for %qD found", result
);
19335 else if (!DECL_TEMPLATE_INFO (result
))
19337 permerror (input_location
, "explicit instantiation of non-template %q#D", result
);
19341 if (storage
== NULL_TREE
)
19343 else if (storage
== ridpointers
[(int) RID_EXTERN
])
19345 if (!in_system_header_at (input_location
) && (cxx_dialect
== cxx98
))
19346 pedwarn (input_location
, OPT_Wpedantic
,
19347 "ISO C++ 1998 forbids the use of %<extern%> on explicit "
19352 error ("storage class %qD applied to template instantiation", storage
);
19354 check_explicit_instantiation_namespace (result
);
19355 mark_decl_instantiated (result
, extern_p
);
19357 instantiate_decl (result
, /*defer_ok=*/1,
19358 /*expl_inst_class_mem_p=*/false);
19362 mark_class_instantiated (tree t
, int extern_p
)
19364 SET_CLASSTYPE_EXPLICIT_INSTANTIATION (t
);
19365 SET_CLASSTYPE_INTERFACE_KNOWN (t
);
19366 CLASSTYPE_INTERFACE_ONLY (t
) = extern_p
;
19367 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (t
)) = extern_p
;
19370 CLASSTYPE_DEBUG_REQUESTED (t
) = 1;
19371 rest_of_type_compilation (t
, 1);
19375 /* Called from do_type_instantiation through binding_table_foreach to
19376 do recursive instantiation for the type bound in ENTRY. */
19378 bt_instantiate_type_proc (binding_entry entry
, void *data
)
19380 tree storage
= *(tree
*) data
;
19382 if (MAYBE_CLASS_TYPE_P (entry
->type
)
19383 && !uses_template_parms (CLASSTYPE_TI_ARGS (entry
->type
)))
19384 do_type_instantiation (TYPE_MAIN_DECL (entry
->type
), storage
, 0);
19387 /* Called from do_type_instantiation to instantiate a member
19388 (a member function or a static member variable) of an
19389 explicitly instantiated class template. */
19391 instantiate_class_member (tree decl
, int extern_p
)
19393 mark_decl_instantiated (decl
, extern_p
);
19395 instantiate_decl (decl
, /*defer_ok=*/1,
19396 /*expl_inst_class_mem_p=*/true);
19399 /* Perform an explicit instantiation of template class T. STORAGE, if
19400 non-null, is the RID for extern, inline or static. COMPLAIN is
19401 nonzero if this is called from the parser, zero if called recursively,
19402 since the standard is unclear (as detailed below). */
19405 do_type_instantiation (tree t
, tree storage
, tsubst_flags_t complain
)
19410 int previous_instantiation_extern_p
= 0;
19412 if (TREE_CODE (t
) == TYPE_DECL
)
19415 if (! CLASS_TYPE_P (t
) || ! CLASSTYPE_TEMPLATE_INFO (t
))
19418 (TYPE_TEMPLATE_INFO (t
)) ? TYPE_TI_TEMPLATE (t
) : NULL
;
19420 error ("explicit instantiation of non-class template %qD", tmpl
);
19422 error ("explicit instantiation of non-template type %qT", t
);
19428 if (!COMPLETE_TYPE_P (t
))
19430 if (complain
& tf_error
)
19431 error ("explicit instantiation of %q#T before definition of template",
19436 if (storage
!= NULL_TREE
)
19438 if (!in_system_header_at (input_location
))
19440 if (storage
== ridpointers
[(int) RID_EXTERN
])
19442 if (cxx_dialect
== cxx98
)
19443 pedwarn (input_location
, OPT_Wpedantic
,
19444 "ISO C++ 1998 forbids the use of %<extern%> on "
19445 "explicit instantiations");
19448 pedwarn (input_location
, OPT_Wpedantic
,
19449 "ISO C++ forbids the use of %qE"
19450 " on explicit instantiations", storage
);
19453 if (storage
== ridpointers
[(int) RID_INLINE
])
19455 else if (storage
== ridpointers
[(int) RID_EXTERN
])
19457 else if (storage
== ridpointers
[(int) RID_STATIC
])
19461 error ("storage class %qD applied to template instantiation",
19467 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
19469 /* DR 259 [temp.spec].
19471 Both an explicit instantiation and a declaration of an explicit
19472 specialization shall not appear in a program unless the explicit
19473 instantiation follows a declaration of the explicit specialization.
19475 For a given set of template parameters, if an explicit
19476 instantiation of a template appears after a declaration of an
19477 explicit specialization for that template, the explicit
19478 instantiation has no effect. */
19481 else if (CLASSTYPE_EXPLICIT_INSTANTIATION (t
))
19485 No program shall explicitly instantiate any template more
19488 If PREVIOUS_INSTANTIATION_EXTERN_P, then the first explicit
19489 instantiation was `extern'. If EXTERN_P then the second is.
19490 These cases are OK. */
19491 previous_instantiation_extern_p
= CLASSTYPE_INTERFACE_ONLY (t
);
19493 if (!previous_instantiation_extern_p
&& !extern_p
19494 && (complain
& tf_error
))
19495 permerror (input_location
, "duplicate explicit instantiation of %q#T", t
);
19497 /* If we've already instantiated the template, just return now. */
19498 if (!CLASSTYPE_INTERFACE_ONLY (t
))
19502 check_explicit_instantiation_namespace (TYPE_NAME (t
));
19503 mark_class_instantiated (t
, extern_p
);
19511 /* In contrast to implicit instantiation, where only the
19512 declarations, and not the definitions, of members are
19513 instantiated, we have here:
19517 The explicit instantiation of a class template specialization
19518 implies the instantiation of all of its members not
19519 previously explicitly specialized in the translation unit
19520 containing the explicit instantiation.
19522 Of course, we can't instantiate member template classes, since
19523 we don't have any arguments for them. Note that the standard
19524 is unclear on whether the instantiation of the members are
19525 *explicit* instantiations or not. However, the most natural
19526 interpretation is that it should be an explicit instantiation. */
19529 for (tmp
= TYPE_METHODS (t
); tmp
; tmp
= DECL_CHAIN (tmp
))
19530 if (TREE_CODE (tmp
) == FUNCTION_DECL
19531 && DECL_TEMPLATE_INSTANTIATION (tmp
))
19532 instantiate_class_member (tmp
, extern_p
);
19534 for (tmp
= TYPE_FIELDS (t
); tmp
; tmp
= DECL_CHAIN (tmp
))
19535 if (VAR_P (tmp
) && DECL_TEMPLATE_INSTANTIATION (tmp
))
19536 instantiate_class_member (tmp
, extern_p
);
19538 if (CLASSTYPE_NESTED_UTDS (t
))
19539 binding_table_foreach (CLASSTYPE_NESTED_UTDS (t
),
19540 bt_instantiate_type_proc
, &storage
);
19544 /* Given a function DECL, which is a specialization of TMPL, modify
19545 DECL to be a re-instantiation of TMPL with the same template
19546 arguments. TMPL should be the template into which tsubst'ing
19547 should occur for DECL, not the most general template.
19549 One reason for doing this is a scenario like this:
19552 void f(const T&, int i);
19554 void g() { f(3, 7); }
19557 void f(const T& t, const int i) { }
19559 Note that when the template is first instantiated, with
19560 instantiate_template, the resulting DECL will have no name for the
19561 first parameter, and the wrong type for the second. So, when we go
19562 to instantiate the DECL, we regenerate it. */
19565 regenerate_decl_from_template (tree decl
, tree tmpl
)
19567 /* The arguments used to instantiate DECL, from the most general
19572 args
= DECL_TI_ARGS (decl
);
19573 code_pattern
= DECL_TEMPLATE_RESULT (tmpl
);
19575 /* Make sure that we can see identifiers, and compute access
19577 push_access_scope (decl
);
19579 if (TREE_CODE (decl
) == FUNCTION_DECL
)
19587 args_depth
= TMPL_ARGS_DEPTH (args
);
19588 parms_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
19589 if (args_depth
> parms_depth
)
19590 args
= get_innermost_template_args (args
, parms_depth
);
19592 specs
= tsubst_exception_specification (TREE_TYPE (code_pattern
),
19593 args
, tf_error
, NULL_TREE
,
19594 /*defer_ok*/false);
19595 if (specs
&& specs
!= error_mark_node
)
19596 TREE_TYPE (decl
) = build_exception_variant (TREE_TYPE (decl
),
19599 /* Merge parameter declarations. */
19600 decl_parm
= skip_artificial_parms_for (decl
,
19601 DECL_ARGUMENTS (decl
));
19603 = skip_artificial_parms_for (code_pattern
,
19604 DECL_ARGUMENTS (code_pattern
));
19605 while (decl_parm
&& !DECL_PACK_P (pattern_parm
))
19610 if (DECL_NAME (decl_parm
) != DECL_NAME (pattern_parm
))
19611 DECL_NAME (decl_parm
) = DECL_NAME (pattern_parm
);
19612 parm_type
= tsubst (TREE_TYPE (pattern_parm
), args
, tf_error
,
19614 parm_type
= type_decays_to (parm_type
);
19615 if (!same_type_p (TREE_TYPE (decl_parm
), parm_type
))
19616 TREE_TYPE (decl_parm
) = parm_type
;
19617 attributes
= DECL_ATTRIBUTES (pattern_parm
);
19618 if (DECL_ATTRIBUTES (decl_parm
) != attributes
)
19620 DECL_ATTRIBUTES (decl_parm
) = attributes
;
19621 cplus_decl_attributes (&decl_parm
, attributes
, /*flags=*/0);
19623 decl_parm
= DECL_CHAIN (decl_parm
);
19624 pattern_parm
= DECL_CHAIN (pattern_parm
);
19626 /* Merge any parameters that match with the function parameter
19628 if (pattern_parm
&& DECL_PACK_P (pattern_parm
))
19631 tree expanded_types
;
19632 /* Expand the TYPE_PACK_EXPANSION that provides the types for
19633 the parameters in this function parameter pack. */
19634 expanded_types
= tsubst_pack_expansion (TREE_TYPE (pattern_parm
),
19635 args
, tf_error
, NULL_TREE
);
19636 len
= TREE_VEC_LENGTH (expanded_types
);
19637 for (i
= 0; i
< len
; i
++)
19642 if (DECL_NAME (decl_parm
) != DECL_NAME (pattern_parm
))
19643 /* Rename the parameter to include the index. */
19644 DECL_NAME (decl_parm
) =
19645 make_ith_pack_parameter_name (DECL_NAME (pattern_parm
), i
);
19646 parm_type
= TREE_VEC_ELT (expanded_types
, i
);
19647 parm_type
= type_decays_to (parm_type
);
19648 if (!same_type_p (TREE_TYPE (decl_parm
), parm_type
))
19649 TREE_TYPE (decl_parm
) = parm_type
;
19650 attributes
= DECL_ATTRIBUTES (pattern_parm
);
19651 if (DECL_ATTRIBUTES (decl_parm
) != attributes
)
19653 DECL_ATTRIBUTES (decl_parm
) = attributes
;
19654 cplus_decl_attributes (&decl_parm
, attributes
, /*flags=*/0);
19656 decl_parm
= DECL_CHAIN (decl_parm
);
19659 /* Merge additional specifiers from the CODE_PATTERN. */
19660 if (DECL_DECLARED_INLINE_P (code_pattern
)
19661 && !DECL_DECLARED_INLINE_P (decl
))
19662 DECL_DECLARED_INLINE_P (decl
) = 1;
19664 else if (VAR_P (decl
))
19666 DECL_INITIAL (decl
) =
19667 tsubst_expr (DECL_INITIAL (code_pattern
), args
,
19668 tf_error
, DECL_TI_TEMPLATE (decl
),
19669 /*integral_constant_expression_p=*/false);
19670 if (VAR_HAD_UNKNOWN_BOUND (decl
))
19671 TREE_TYPE (decl
) = tsubst (TREE_TYPE (code_pattern
), args
,
19672 tf_error
, DECL_TI_TEMPLATE (decl
));
19675 gcc_unreachable ();
19677 pop_access_scope (decl
);
19680 /* Return the TEMPLATE_DECL into which DECL_TI_ARGS(DECL) should be
19681 substituted to get DECL. */
19684 template_for_substitution (tree decl
)
19686 tree tmpl
= DECL_TI_TEMPLATE (decl
);
19688 /* Set TMPL to the template whose DECL_TEMPLATE_RESULT is the pattern
19689 for the instantiation. This is not always the most general
19690 template. Consider, for example:
19693 struct S { template <class U> void f();
19694 template <> void f<int>(); };
19696 and an instantiation of S<double>::f<int>. We want TD to be the
19697 specialization S<T>::f<int>, not the more general S<T>::f<U>. */
19698 while (/* An instantiation cannot have a definition, so we need a
19699 more general template. */
19700 DECL_TEMPLATE_INSTANTIATION (tmpl
)
19701 /* We must also deal with friend templates. Given:
19703 template <class T> struct S {
19704 template <class U> friend void f() {};
19707 S<int>::f<U> say, is not an instantiation of S<T>::f<U>,
19708 so far as the language is concerned, but that's still
19709 where we get the pattern for the instantiation from. On
19710 other hand, if the definition comes outside the class, say:
19712 template <class T> struct S {
19713 template <class U> friend void f();
19715 template <class U> friend void f() {}
19717 we don't need to look any further. That's what the check for
19718 DECL_INITIAL is for. */
19719 || (TREE_CODE (decl
) == FUNCTION_DECL
19720 && DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (tmpl
)
19721 && !DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl
))))
19723 /* The present template, TD, should not be a definition. If it
19724 were a definition, we should be using it! Note that we
19725 cannot restructure the loop to just keep going until we find
19726 a template with a definition, since that might go too far if
19727 a specialization was declared, but not defined. */
19729 /* Fetch the more general template. */
19730 tmpl
= DECL_TI_TEMPLATE (tmpl
);
19736 /* Returns true if we need to instantiate this template instance even if we
19737 know we aren't going to emit it.. */
19740 always_instantiate_p (tree decl
)
19742 /* We always instantiate inline functions so that we can inline them. An
19743 explicit instantiation declaration prohibits implicit instantiation of
19744 non-inline functions. With high levels of optimization, we would
19745 normally inline non-inline functions -- but we're not allowed to do
19746 that for "extern template" functions. Therefore, we check
19747 DECL_DECLARED_INLINE_P, rather than possibly_inlined_p. */
19748 return ((TREE_CODE (decl
) == FUNCTION_DECL
19749 && (DECL_DECLARED_INLINE_P (decl
)
19750 || type_uses_auto (TREE_TYPE (TREE_TYPE (decl
)))))
19751 /* And we need to instantiate static data members so that
19752 their initializers are available in integral constant
19755 && decl_maybe_constant_var_p (decl
)));
19758 /* If FN has a noexcept-specifier that hasn't been instantiated yet,
19759 instantiate it now, modifying TREE_TYPE (fn). */
19762 maybe_instantiate_noexcept (tree fn
)
19764 tree fntype
, spec
, noex
, clone
;
19766 /* Don't instantiate a noexcept-specification from template context. */
19767 if (processing_template_decl
)
19770 if (DECL_CLONED_FUNCTION_P (fn
))
19771 fn
= DECL_CLONED_FUNCTION (fn
);
19772 fntype
= TREE_TYPE (fn
);
19773 spec
= TYPE_RAISES_EXCEPTIONS (fntype
);
19775 if (!spec
|| !TREE_PURPOSE (spec
))
19778 noex
= TREE_PURPOSE (spec
);
19780 if (TREE_CODE (noex
) == DEFERRED_NOEXCEPT
)
19782 if (DEFERRED_NOEXCEPT_PATTERN (noex
) == NULL_TREE
)
19783 spec
= get_defaulted_eh_spec (fn
);
19784 else if (push_tinst_level (fn
))
19786 push_access_scope (fn
);
19787 push_deferring_access_checks (dk_no_deferred
);
19788 input_location
= DECL_SOURCE_LOCATION (fn
);
19789 noex
= tsubst_copy_and_build (DEFERRED_NOEXCEPT_PATTERN (noex
),
19790 DEFERRED_NOEXCEPT_ARGS (noex
),
19791 tf_warning_or_error
, fn
,
19792 /*function_p=*/false,
19793 /*integral_constant_expression_p=*/true);
19794 pop_deferring_access_checks ();
19795 pop_access_scope (fn
);
19796 pop_tinst_level ();
19797 spec
= build_noexcept_spec (noex
, tf_warning_or_error
);
19798 if (spec
== error_mark_node
)
19799 spec
= noexcept_false_spec
;
19802 spec
= noexcept_false_spec
;
19804 TREE_TYPE (fn
) = build_exception_variant (fntype
, spec
);
19807 FOR_EACH_CLONE (clone
, fn
)
19809 if (TREE_TYPE (clone
) == fntype
)
19810 TREE_TYPE (clone
) = TREE_TYPE (fn
);
19812 TREE_TYPE (clone
) = build_exception_variant (TREE_TYPE (clone
), spec
);
19816 /* Produce the definition of D, a _DECL generated from a template. If
19817 DEFER_OK is nonzero, then we don't have to actually do the
19818 instantiation now; we just have to do it sometime. Normally it is
19819 an error if this is an explicit instantiation but D is undefined.
19820 EXPL_INST_CLASS_MEM_P is true iff D is a member of an
19821 explicitly instantiated class template. */
19824 instantiate_decl (tree d
, int defer_ok
,
19825 bool expl_inst_class_mem_p
)
19827 tree tmpl
= DECL_TI_TEMPLATE (d
);
19834 bool pattern_defined
;
19835 location_t saved_loc
= input_location
;
19836 int saved_unevaluated_operand
= cp_unevaluated_operand
;
19837 int saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
19843 /* This function should only be used to instantiate templates for
19844 functions and static member variables. */
19845 gcc_assert (VAR_OR_FUNCTION_DECL_P (d
));
19847 /* Variables are never deferred; if instantiation is required, they
19848 are instantiated right away. That allows for better code in the
19849 case that an expression refers to the value of the variable --
19850 if the variable has a constant value the referring expression can
19851 take advantage of that fact. */
19853 || DECL_DECLARED_CONSTEXPR_P (d
))
19856 /* Don't instantiate cloned functions. Instead, instantiate the
19857 functions they cloned. */
19858 if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_CLONED_FUNCTION_P (d
))
19859 d
= DECL_CLONED_FUNCTION (d
);
19861 if (DECL_TEMPLATE_INSTANTIATED (d
)
19862 || (TREE_CODE (d
) == FUNCTION_DECL
19863 && DECL_DEFAULTED_FN (d
) && DECL_INITIAL (d
))
19864 || DECL_TEMPLATE_SPECIALIZATION (d
))
19865 /* D has already been instantiated or explicitly specialized, so
19866 there's nothing for us to do here.
19868 It might seem reasonable to check whether or not D is an explicit
19869 instantiation, and, if so, stop here. But when an explicit
19870 instantiation is deferred until the end of the compilation,
19871 DECL_EXPLICIT_INSTANTIATION is set, even though we still need to do
19872 the instantiation. */
19875 /* Check to see whether we know that this template will be
19876 instantiated in some other file, as with "extern template"
19878 external_p
= (DECL_INTERFACE_KNOWN (d
) && DECL_REALLY_EXTERN (d
));
19880 /* In general, we do not instantiate such templates. */
19881 if (external_p
&& !always_instantiate_p (d
))
19884 gen_tmpl
= most_general_template (tmpl
);
19885 gen_args
= DECL_TI_ARGS (d
);
19887 if (tmpl
!= gen_tmpl
)
19888 /* We should already have the extra args. */
19889 gcc_assert (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (gen_tmpl
))
19890 == TMPL_ARGS_DEPTH (gen_args
));
19891 /* And what's in the hash table should match D. */
19892 gcc_assert ((spec
= retrieve_specialization (gen_tmpl
, gen_args
, 0)) == d
19893 || spec
== NULL_TREE
);
19895 /* This needs to happen before any tsubsting. */
19896 if (! push_tinst_level (d
))
19899 timevar_push (TV_TEMPLATE_INST
);
19901 /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern
19902 for the instantiation. */
19903 td
= template_for_substitution (d
);
19904 code_pattern
= DECL_TEMPLATE_RESULT (td
);
19906 /* We should never be trying to instantiate a member of a class
19907 template or partial specialization. */
19908 gcc_assert (d
!= code_pattern
);
19910 if ((DECL_NAMESPACE_SCOPE_P (d
) && !DECL_INITIALIZED_IN_CLASS_P (d
))
19911 || DECL_TEMPLATE_SPECIALIZATION (td
))
19912 /* In the case of a friend template whose definition is provided
19913 outside the class, we may have too many arguments. Drop the
19914 ones we don't need. The same is true for specializations. */
19915 args
= get_innermost_template_args
19916 (gen_args
, TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (td
)));
19920 if (TREE_CODE (d
) == FUNCTION_DECL
)
19922 deleted_p
= DECL_DELETED_FN (code_pattern
);
19923 pattern_defined
= (DECL_SAVED_TREE (code_pattern
) != NULL_TREE
19924 || DECL_DEFAULTED_OUTSIDE_CLASS_P (code_pattern
)
19930 pattern_defined
= ! DECL_IN_AGGR_P (code_pattern
);
19933 /* We may be in the middle of deferred access check. Disable it now. */
19934 push_deferring_access_checks (dk_no_deferred
);
19936 /* Unless an explicit instantiation directive has already determined
19937 the linkage of D, remember that a definition is available for
19939 if (pattern_defined
19940 && !DECL_INTERFACE_KNOWN (d
)
19941 && !DECL_NOT_REALLY_EXTERN (d
))
19942 mark_definable (d
);
19944 DECL_SOURCE_LOCATION (td
) = DECL_SOURCE_LOCATION (code_pattern
);
19945 DECL_SOURCE_LOCATION (d
) = DECL_SOURCE_LOCATION (code_pattern
);
19946 input_location
= DECL_SOURCE_LOCATION (d
);
19948 /* If D is a member of an explicitly instantiated class template,
19949 and no definition is available, treat it like an implicit
19951 if (!pattern_defined
&& expl_inst_class_mem_p
19952 && DECL_EXPLICIT_INSTANTIATION (d
))
19954 /* Leave linkage flags alone on instantiations with anonymous
19956 if (TREE_PUBLIC (d
))
19958 DECL_NOT_REALLY_EXTERN (d
) = 0;
19959 DECL_INTERFACE_KNOWN (d
) = 0;
19961 SET_DECL_IMPLICIT_INSTANTIATION (d
);
19964 /* Defer all other templates, unless we have been explicitly
19965 forbidden from doing so. */
19966 if (/* If there is no definition, we cannot instantiate the
19969 /* If it's OK to postpone instantiation, do so. */
19971 /* If this is a static data member that will be defined
19972 elsewhere, we don't want to instantiate the entire data
19973 member, but we do want to instantiate the initializer so that
19974 we can substitute that elsewhere. */
19975 || (external_p
&& VAR_P (d
))
19976 /* Handle here a deleted function too, avoid generating
19977 its body (c++/61080). */
19980 /* The definition of the static data member is now required so
19981 we must substitute the initializer. */
19983 && !DECL_INITIAL (d
)
19984 && DECL_INITIAL (code_pattern
))
19988 bool const_init
= false;
19989 bool enter_context
= DECL_CLASS_SCOPE_P (d
);
19991 ns
= decl_namespace_context (d
);
19992 push_nested_namespace (ns
);
19994 push_nested_class (DECL_CONTEXT (d
));
19995 init
= tsubst_expr (DECL_INITIAL (code_pattern
),
19997 tf_warning_or_error
, NULL_TREE
,
19998 /*integral_constant_expression_p=*/false);
19999 /* If instantiating the initializer involved instantiating this
20000 again, don't call cp_finish_decl twice. */
20001 if (!DECL_INITIAL (d
))
20003 /* Make sure the initializer is still constant, in case of
20004 circular dependency (template/instantiate6.C). */
20006 = DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (code_pattern
);
20007 cp_finish_decl (d
, init
, /*init_const_expr_p=*/const_init
,
20008 /*asmspec_tree=*/NULL_TREE
,
20009 LOOKUP_ONLYCONVERTING
);
20012 pop_nested_class ();
20013 pop_nested_namespace (ns
);
20016 /* We restore the source position here because it's used by
20017 add_pending_template. */
20018 input_location
= saved_loc
;
20020 if (at_eof
&& !pattern_defined
20021 && DECL_EXPLICIT_INSTANTIATION (d
)
20022 && DECL_NOT_REALLY_EXTERN (d
))
20025 The definition of a non-exported function template, a
20026 non-exported member function template, or a non-exported
20027 member function or static data member of a class template
20028 shall be present in every translation unit in which it is
20029 explicitly instantiated. */
20030 permerror (input_location
, "explicit instantiation of %qD "
20031 "but no definition available", d
);
20033 /* If we're in unevaluated context, we just wanted to get the
20034 constant value; this isn't an odr use, so don't queue
20035 a full instantiation. */
20036 if (cp_unevaluated_operand
!= 0)
20038 /* ??? Historically, we have instantiated inline functions, even
20039 when marked as "extern template". */
20040 if (!(external_p
&& VAR_P (d
)))
20041 add_pending_template (d
);
20044 /* Tell the repository that D is available in this translation unit
20045 -- and see if it is supposed to be instantiated here. */
20046 if (TREE_PUBLIC (d
) && !DECL_REALLY_EXTERN (d
) && !repo_emit_p (d
))
20048 /* In a PCH file, despite the fact that the repository hasn't
20049 requested instantiation in the PCH it is still possible that
20050 an instantiation will be required in a file that includes the
20053 add_pending_template (d
);
20054 /* Instantiate inline functions so that the inliner can do its
20055 job, even though we'll not be emitting a copy of this
20057 if (!(TREE_CODE (d
) == FUNCTION_DECL
&& possibly_inlined_p (d
)))
20061 fn_context
= decl_function_context (d
);
20062 nested
= (current_function_decl
!= NULL_TREE
);
20064 push_to_top_level ();
20068 push_function_context ();
20069 cp_unevaluated_operand
= 0;
20070 c_inhibit_evaluation_warnings
= 0;
20073 /* Mark D as instantiated so that recursive calls to
20074 instantiate_decl do not try to instantiate it again. */
20075 DECL_TEMPLATE_INSTANTIATED (d
) = 1;
20077 /* Regenerate the declaration in case the template has been modified
20078 by a subsequent redeclaration. */
20079 regenerate_decl_from_template (d
, td
);
20081 /* We already set the file and line above. Reset them now in case
20082 they changed as a result of calling regenerate_decl_from_template. */
20083 input_location
= DECL_SOURCE_LOCATION (d
);
20088 bool const_init
= false;
20090 /* Clear out DECL_RTL; whatever was there before may not be right
20091 since we've reset the type of the declaration. */
20092 SET_DECL_RTL (d
, NULL
);
20093 DECL_IN_AGGR_P (d
) = 0;
20095 /* The initializer is placed in DECL_INITIAL by
20096 regenerate_decl_from_template so we don't need to
20097 push/pop_access_scope again here. Pull it out so that
20098 cp_finish_decl can process it. */
20099 init
= DECL_INITIAL (d
);
20100 DECL_INITIAL (d
) = NULL_TREE
;
20101 DECL_INITIALIZED_P (d
) = 0;
20103 /* Clear DECL_EXTERNAL so that cp_finish_decl will process the
20104 initializer. That function will defer actual emission until
20105 we have a chance to determine linkage. */
20106 DECL_EXTERNAL (d
) = 0;
20108 /* Enter the scope of D so that access-checking works correctly. */
20109 bool enter_context
= DECL_CLASS_SCOPE_P (d
);
20111 push_nested_class (DECL_CONTEXT (d
));
20113 const_init
= DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (code_pattern
);
20114 cp_finish_decl (d
, init
, const_init
, NULL_TREE
, 0);
20117 pop_nested_class ();
20119 if (variable_template_p (td
))
20120 note_variable_template_instantiation (d
);
20122 else if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_DEFAULTED_FN (code_pattern
))
20123 synthesize_method (d
);
20124 else if (TREE_CODE (d
) == FUNCTION_DECL
)
20126 hash_map
<tree
, tree
> *saved_local_specializations
;
20130 tree block
= NULL_TREE
;
20132 /* Save away the current list, in case we are instantiating one
20133 template from within the body of another. */
20134 saved_local_specializations
= local_specializations
;
20136 /* Set up the list of local specializations. */
20137 local_specializations
= new hash_map
<tree
, tree
>;
20139 /* Set up context. */
20140 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
)
20141 && TREE_CODE (DECL_CONTEXT (code_pattern
)) == FUNCTION_DECL
)
20142 block
= push_stmt_list ();
20144 start_preparsed_function (d
, NULL_TREE
, SF_PRE_PARSED
);
20146 /* Some typedefs referenced from within the template code need to be
20147 access checked at template instantiation time, i.e now. These
20148 types were added to the template at parsing time. Let's get those
20149 and perform the access checks then. */
20150 perform_typedefs_access_check (DECL_TEMPLATE_RESULT (gen_tmpl
),
20153 /* Create substitution entries for the parameters. */
20154 subst_decl
= DECL_TEMPLATE_RESULT (template_for_substitution (d
));
20155 tmpl_parm
= DECL_ARGUMENTS (subst_decl
);
20156 spec_parm
= DECL_ARGUMENTS (d
);
20157 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (d
))
20159 register_local_specialization (spec_parm
, tmpl_parm
);
20160 spec_parm
= skip_artificial_parms_for (d
, spec_parm
);
20161 tmpl_parm
= skip_artificial_parms_for (subst_decl
, tmpl_parm
);
20163 for (; tmpl_parm
; tmpl_parm
= DECL_CHAIN (tmpl_parm
))
20165 if (!DECL_PACK_P (tmpl_parm
))
20167 register_local_specialization (spec_parm
, tmpl_parm
);
20168 spec_parm
= DECL_CHAIN (spec_parm
);
20172 /* Register the (value) argument pack as a specialization of
20173 TMPL_PARM, then move on. */
20174 tree argpack
= extract_fnparm_pack (tmpl_parm
, &spec_parm
);
20175 register_local_specialization (argpack
, tmpl_parm
);
20178 gcc_assert (!spec_parm
);
20180 /* Substitute into the body of the function. */
20181 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
))
20182 tsubst_omp_udr (DECL_SAVED_TREE (code_pattern
), args
,
20183 tf_warning_or_error
, tmpl
);
20186 tsubst_expr (DECL_SAVED_TREE (code_pattern
), args
,
20187 tf_warning_or_error
, tmpl
,
20188 /*integral_constant_expression_p=*/false);
20190 /* Set the current input_location to the end of the function
20191 so that finish_function knows where we are. */
20193 = DECL_STRUCT_FUNCTION (code_pattern
)->function_end_locus
;
20195 /* Remember if we saw an infinite loop in the template. */
20196 current_function_infinite_loop
20197 = DECL_STRUCT_FUNCTION (code_pattern
)->language
->infinite_loop
;
20200 /* We don't need the local specializations any more. */
20201 delete local_specializations
;
20202 local_specializations
= saved_local_specializations
;
20204 /* Finish the function. */
20205 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
)
20206 && TREE_CODE (DECL_CONTEXT (code_pattern
)) == FUNCTION_DECL
)
20207 DECL_SAVED_TREE (d
) = pop_stmt_list (block
);
20210 d
= finish_function (0);
20211 expand_or_defer_fn (d
);
20214 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
))
20215 cp_check_omp_declare_reduction (d
);
20218 /* We're not deferring instantiation any more. */
20219 TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (d
)) = 0;
20222 pop_from_top_level ();
20224 pop_function_context ();
20227 input_location
= saved_loc
;
20228 cp_unevaluated_operand
= saved_unevaluated_operand
;
20229 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
20230 pop_deferring_access_checks ();
20231 pop_tinst_level ();
20233 timevar_pop (TV_TEMPLATE_INST
);
20238 /* Run through the list of templates that we wish we could
20239 instantiate, and instantiate any we can. RETRIES is the
20240 number of times we retry pending template instantiation. */
20243 instantiate_pending_templates (int retries
)
20246 location_t saved_loc
= input_location
;
20248 /* Instantiating templates may trigger vtable generation. This in turn
20249 may require further template instantiations. We place a limit here
20250 to avoid infinite loop. */
20251 if (pending_templates
&& retries
>= max_tinst_depth
)
20253 tree decl
= pending_templates
->tinst
->decl
;
20255 error ("template instantiation depth exceeds maximum of %d"
20256 " instantiating %q+D, possibly from virtual table generation"
20257 " (use -ftemplate-depth= to increase the maximum)",
20258 max_tinst_depth
, decl
);
20259 if (TREE_CODE (decl
) == FUNCTION_DECL
)
20260 /* Pretend that we defined it. */
20261 DECL_INITIAL (decl
) = error_mark_node
;
20267 struct pending_template
**t
= &pending_templates
;
20268 struct pending_template
*last
= NULL
;
20272 tree instantiation
= reopen_tinst_level ((*t
)->tinst
);
20273 bool complete
= false;
20275 if (TYPE_P (instantiation
))
20279 if (!COMPLETE_TYPE_P (instantiation
))
20281 instantiate_class_template (instantiation
);
20282 if (CLASSTYPE_TEMPLATE_INSTANTIATION (instantiation
))
20283 for (fn
= TYPE_METHODS (instantiation
);
20285 fn
= TREE_CHAIN (fn
))
20286 if (! DECL_ARTIFICIAL (fn
))
20287 instantiate_decl (fn
,
20289 /*expl_inst_class_mem_p=*/false);
20290 if (COMPLETE_TYPE_P (instantiation
))
20294 complete
= COMPLETE_TYPE_P (instantiation
);
20298 if (!DECL_TEMPLATE_SPECIALIZATION (instantiation
)
20299 && !DECL_TEMPLATE_INSTANTIATED (instantiation
))
20302 = instantiate_decl (instantiation
,
20304 /*expl_inst_class_mem_p=*/false);
20305 if (DECL_TEMPLATE_INSTANTIATED (instantiation
))
20309 complete
= (DECL_TEMPLATE_SPECIALIZATION (instantiation
)
20310 || DECL_TEMPLATE_INSTANTIATED (instantiation
));
20314 /* If INSTANTIATION has been instantiated, then we don't
20315 need to consider it again in the future. */
20323 current_tinst_level
= NULL
;
20325 last_pending_template
= last
;
20327 while (reconsider
);
20329 input_location
= saved_loc
;
20332 /* Substitute ARGVEC into T, which is a list of initializers for
20333 either base class or a non-static data member. The TREE_PURPOSEs
20334 are DECLs, and the TREE_VALUEs are the initializer values. Used by
20335 instantiate_decl. */
20338 tsubst_initializer_list (tree t
, tree argvec
)
20340 tree inits
= NULL_TREE
;
20342 for (; t
; t
= TREE_CHAIN (t
))
20346 tree expanded_bases
= NULL_TREE
;
20347 tree expanded_arguments
= NULL_TREE
;
20350 if (TREE_CODE (TREE_PURPOSE (t
)) == TYPE_PACK_EXPANSION
)
20355 /* Expand the base class expansion type into separate base
20357 expanded_bases
= tsubst_pack_expansion (TREE_PURPOSE (t
), argvec
,
20358 tf_warning_or_error
,
20360 if (expanded_bases
== error_mark_node
)
20363 /* We'll be building separate TREE_LISTs of arguments for
20365 len
= TREE_VEC_LENGTH (expanded_bases
);
20366 expanded_arguments
= make_tree_vec (len
);
20367 for (i
= 0; i
< len
; i
++)
20368 TREE_VEC_ELT (expanded_arguments
, i
) = NULL_TREE
;
20370 /* Build a dummy EXPR_PACK_EXPANSION that will be used to
20371 expand each argument in the TREE_VALUE of t. */
20372 expr
= make_node (EXPR_PACK_EXPANSION
);
20373 PACK_EXPANSION_LOCAL_P (expr
) = true;
20374 PACK_EXPANSION_PARAMETER_PACKS (expr
) =
20375 PACK_EXPANSION_PARAMETER_PACKS (TREE_PURPOSE (t
));
20377 if (TREE_VALUE (t
) == void_type_node
)
20378 /* VOID_TYPE_NODE is used to indicate
20379 value-initialization. */
20381 for (i
= 0; i
< len
; i
++)
20382 TREE_VEC_ELT (expanded_arguments
, i
) = void_type_node
;
20386 /* Substitute parameter packs into each argument in the
20388 in_base_initializer
= 1;
20389 for (arg
= TREE_VALUE (t
); arg
; arg
= TREE_CHAIN (arg
))
20391 tree expanded_exprs
;
20393 /* Expand the argument. */
20394 SET_PACK_EXPANSION_PATTERN (expr
, TREE_VALUE (arg
));
20396 = tsubst_pack_expansion (expr
, argvec
,
20397 tf_warning_or_error
,
20399 if (expanded_exprs
== error_mark_node
)
20402 /* Prepend each of the expanded expressions to the
20403 corresponding TREE_LIST in EXPANDED_ARGUMENTS. */
20404 for (i
= 0; i
< len
; i
++)
20406 TREE_VEC_ELT (expanded_arguments
, i
) =
20407 tree_cons (NULL_TREE
,
20408 TREE_VEC_ELT (expanded_exprs
, i
),
20409 TREE_VEC_ELT (expanded_arguments
, i
));
20412 in_base_initializer
= 0;
20414 /* Reverse all of the TREE_LISTs in EXPANDED_ARGUMENTS,
20415 since we built them backwards. */
20416 for (i
= 0; i
< len
; i
++)
20418 TREE_VEC_ELT (expanded_arguments
, i
) =
20419 nreverse (TREE_VEC_ELT (expanded_arguments
, i
));
20424 for (i
= 0; i
< len
; ++i
)
20426 if (expanded_bases
)
20428 decl
= TREE_VEC_ELT (expanded_bases
, i
);
20429 decl
= expand_member_init (decl
);
20430 init
= TREE_VEC_ELT (expanded_arguments
, i
);
20435 decl
= tsubst_copy (TREE_PURPOSE (t
), argvec
,
20436 tf_warning_or_error
, NULL_TREE
);
20438 decl
= expand_member_init (decl
);
20439 if (decl
&& !DECL_P (decl
))
20440 in_base_initializer
= 1;
20442 init
= TREE_VALUE (t
);
20444 if (init
!= void_type_node
)
20445 init
= tsubst_expr (init
, argvec
,
20446 tf_warning_or_error
, NULL_TREE
,
20447 /*integral_constant_expression_p=*/false);
20448 if (init
== NULL_TREE
&& tmp
!= NULL_TREE
)
20449 /* If we had an initializer but it instantiated to nothing,
20450 value-initialize the object. This will only occur when
20451 the initializer was a pack expansion where the parameter
20452 packs used in that expansion were of length zero. */
20453 init
= void_type_node
;
20454 in_base_initializer
= 0;
20459 init
= build_tree_list (decl
, init
);
20460 TREE_CHAIN (init
) = inits
;
20468 /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */
20471 set_current_access_from_decl (tree decl
)
20473 if (TREE_PRIVATE (decl
))
20474 current_access_specifier
= access_private_node
;
20475 else if (TREE_PROTECTED (decl
))
20476 current_access_specifier
= access_protected_node
;
20478 current_access_specifier
= access_public_node
;
20481 /* Instantiate an enumerated type. TAG is the template type, NEWTAG
20482 is the instantiation (which should have been created with
20483 start_enum) and ARGS are the template arguments to use. */
20486 tsubst_enum (tree tag
, tree newtag
, tree args
)
20490 if (SCOPED_ENUM_P (newtag
))
20491 begin_scope (sk_scoped_enum
, newtag
);
20493 for (e
= TYPE_VALUES (tag
); e
; e
= TREE_CHAIN (e
))
20498 decl
= TREE_VALUE (e
);
20499 /* Note that in a template enum, the TREE_VALUE is the
20500 CONST_DECL, not the corresponding INTEGER_CST. */
20501 value
= tsubst_expr (DECL_INITIAL (decl
),
20502 args
, tf_warning_or_error
, NULL_TREE
,
20503 /*integral_constant_expression_p=*/true);
20505 /* Give this enumeration constant the correct access. */
20506 set_current_access_from_decl (decl
);
20508 /* Actually build the enumerator itself. */
20510 (DECL_NAME (decl
), value
, newtag
, DECL_SOURCE_LOCATION (decl
));
20513 if (SCOPED_ENUM_P (newtag
))
20516 finish_enum_value_list (newtag
);
20517 finish_enum (newtag
);
20519 DECL_SOURCE_LOCATION (TYPE_NAME (newtag
))
20520 = DECL_SOURCE_LOCATION (TYPE_NAME (tag
));
20523 /* DECL is a FUNCTION_DECL that is a template specialization. Return
20524 its type -- but without substituting the innermost set of template
20525 arguments. So, innermost set of template parameters will appear in
20529 get_mostly_instantiated_function_type (tree decl
)
20537 tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
20538 targs
= DECL_TI_ARGS (decl
);
20539 tparms
= DECL_TEMPLATE_PARMS (tmpl
);
20540 parm_depth
= TMPL_PARMS_DEPTH (tparms
);
20542 /* There should be as many levels of arguments as there are levels
20544 gcc_assert (parm_depth
== TMPL_ARGS_DEPTH (targs
));
20546 fn_type
= TREE_TYPE (tmpl
);
20548 if (parm_depth
== 1)
20549 /* No substitution is necessary. */
20556 /* Replace the innermost level of the TARGS with NULL_TREEs to
20557 let tsubst know not to substitute for those parameters. */
20558 partial_args
= make_tree_vec (TREE_VEC_LENGTH (targs
));
20559 for (i
= 1; i
< TMPL_ARGS_DEPTH (targs
); ++i
)
20560 SET_TMPL_ARGS_LEVEL (partial_args
, i
,
20561 TMPL_ARGS_LEVEL (targs
, i
));
20562 SET_TMPL_ARGS_LEVEL (partial_args
,
20563 TMPL_ARGS_DEPTH (targs
),
20564 make_tree_vec (DECL_NTPARMS (tmpl
)));
20566 /* Make sure that we can see identifiers, and compute access
20568 push_access_scope (decl
);
20570 ++processing_template_decl
;
20571 /* Now, do the (partial) substitution to figure out the
20572 appropriate function type. */
20573 fn_type
= tsubst (fn_type
, partial_args
, tf_error
, NULL_TREE
);
20574 --processing_template_decl
;
20576 /* Substitute into the template parameters to obtain the real
20577 innermost set of parameters. This step is important if the
20578 innermost set of template parameters contains value
20579 parameters whose types depend on outer template parameters. */
20580 TREE_VEC_LENGTH (partial_args
)--;
20581 tparms
= tsubst_template_parms (tparms
, partial_args
, tf_error
);
20583 pop_access_scope (decl
);
20589 /* Return truthvalue if we're processing a template different from
20590 the last one involved in diagnostics. */
20592 problematic_instantiation_changed (void)
20594 return current_tinst_level
!= last_error_tinst_level
;
20597 /* Remember current template involved in diagnostics. */
20599 record_last_problematic_instantiation (void)
20601 last_error_tinst_level
= current_tinst_level
;
20604 struct tinst_level
*
20605 current_instantiation (void)
20607 return current_tinst_level
;
20610 /* [temp.param] Check that template non-type parm TYPE is of an allowable
20611 type. Return zero for ok, nonzero for disallowed. Issue error and
20612 warning messages under control of COMPLAIN. */
20615 invalid_nontype_parm_type_p (tree type
, tsubst_flags_t complain
)
20617 if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
20619 else if (POINTER_TYPE_P (type
))
20621 else if (TYPE_PTRMEM_P (type
))
20623 else if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
)
20625 else if (TREE_CODE (type
) == TYPENAME_TYPE
)
20627 else if (TREE_CODE (type
) == DECLTYPE_TYPE
)
20629 else if (TREE_CODE (type
) == NULLPTR_TYPE
)
20632 if (complain
& tf_error
)
20634 if (type
== error_mark_node
)
20635 inform (input_location
, "invalid template non-type parameter");
20637 error ("%q#T is not a valid type for a template non-type parameter",
20643 /* Returns TRUE if TYPE is dependent, in the sense of [temp.dep.type].
20644 Assumes that TYPE really is a type, and not the ERROR_MARK_NODE.*/
20647 dependent_type_p_r (tree type
)
20653 A type is dependent if it is:
20655 -- a template parameter. Template template parameters are types
20656 for us (since TYPE_P holds true for them) so we handle
20658 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
20659 || TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
)
20661 /* -- a qualified-id with a nested-name-specifier which contains a
20662 class-name that names a dependent type or whose unqualified-id
20663 names a dependent type. */
20664 if (TREE_CODE (type
) == TYPENAME_TYPE
)
20666 /* -- a cv-qualified type where the cv-unqualified type is
20668 type
= TYPE_MAIN_VARIANT (type
);
20669 /* -- a compound type constructed from any dependent type. */
20670 if (TYPE_PTRMEM_P (type
))
20671 return (dependent_type_p (TYPE_PTRMEM_CLASS_TYPE (type
))
20672 || dependent_type_p (TYPE_PTRMEM_POINTED_TO_TYPE
20674 else if (TYPE_PTR_P (type
)
20675 || TREE_CODE (type
) == REFERENCE_TYPE
)
20676 return dependent_type_p (TREE_TYPE (type
));
20677 else if (TREE_CODE (type
) == FUNCTION_TYPE
20678 || TREE_CODE (type
) == METHOD_TYPE
)
20682 if (dependent_type_p (TREE_TYPE (type
)))
20684 for (arg_type
= TYPE_ARG_TYPES (type
);
20686 arg_type
= TREE_CHAIN (arg_type
))
20687 if (dependent_type_p (TREE_VALUE (arg_type
)))
20691 /* -- an array type constructed from any dependent type or whose
20692 size is specified by a constant expression that is
20695 We checked for type- and value-dependence of the bounds in
20696 compute_array_index_type, so TYPE_DEPENDENT_P is already set. */
20697 if (TREE_CODE (type
) == ARRAY_TYPE
)
20699 if (TYPE_DOMAIN (type
)
20700 && dependent_type_p (TYPE_DOMAIN (type
)))
20702 return dependent_type_p (TREE_TYPE (type
));
20705 /* -- a template-id in which either the template name is a template
20707 if (TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
20709 /* ... or any of the template arguments is a dependent type or
20710 an expression that is type-dependent or value-dependent. */
20711 else if (CLASS_TYPE_P (type
) && CLASSTYPE_TEMPLATE_INFO (type
)
20712 && (any_dependent_template_arguments_p
20713 (INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type
)))))
20716 /* All TYPEOF_TYPEs, DECLTYPE_TYPEs, and UNDERLYING_TYPEs are
20717 dependent; if the argument of the `typeof' expression is not
20718 type-dependent, then it should already been have resolved. */
20719 if (TREE_CODE (type
) == TYPEOF_TYPE
20720 || TREE_CODE (type
) == DECLTYPE_TYPE
20721 || TREE_CODE (type
) == UNDERLYING_TYPE
)
20724 /* A template argument pack is dependent if any of its packed
20726 if (TREE_CODE (type
) == TYPE_ARGUMENT_PACK
)
20728 tree args
= ARGUMENT_PACK_ARGS (type
);
20729 int i
, len
= TREE_VEC_LENGTH (args
);
20730 for (i
= 0; i
< len
; ++i
)
20731 if (dependent_template_arg_p (TREE_VEC_ELT (args
, i
)))
20735 /* All TYPE_PACK_EXPANSIONs are dependent, because parameter packs must
20736 be template parameters. */
20737 if (TREE_CODE (type
) == TYPE_PACK_EXPANSION
)
20740 /* The standard does not specifically mention types that are local
20741 to template functions or local classes, but they should be
20742 considered dependent too. For example:
20744 template <int I> void f() {
20749 The size of `E' cannot be known until the value of `I' has been
20750 determined. Therefore, `E' must be considered dependent. */
20751 scope
= TYPE_CONTEXT (type
);
20752 if (scope
&& TYPE_P (scope
))
20753 return dependent_type_p (scope
);
20754 /* Don't use type_dependent_expression_p here, as it can lead
20755 to infinite recursion trying to determine whether a lambda
20756 nested in a lambda is dependent (c++/47687). */
20757 else if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
20758 && DECL_LANG_SPECIFIC (scope
)
20759 && DECL_TEMPLATE_INFO (scope
)
20760 && (any_dependent_template_arguments_p
20761 (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (scope
)))))
20764 /* Other types are non-dependent. */
20768 /* Returns TRUE if TYPE is dependent, in the sense of
20769 [temp.dep.type]. Note that a NULL type is considered dependent. */
20772 dependent_type_p (tree type
)
20774 /* If there are no template parameters in scope, then there can't be
20775 any dependent types. */
20776 if (!processing_template_decl
)
20778 /* If we are not processing a template, then nobody should be
20779 providing us with a dependent type. */
20781 gcc_assert (TREE_CODE (type
) != TEMPLATE_TYPE_PARM
|| is_auto (type
));
20785 /* If the type is NULL, we have not computed a type for the entity
20786 in question; in that case, the type is dependent. */
20790 /* Erroneous types can be considered non-dependent. */
20791 if (type
== error_mark_node
)
20794 /* If we have not already computed the appropriate value for TYPE,
20796 if (!TYPE_DEPENDENT_P_VALID (type
))
20798 TYPE_DEPENDENT_P (type
) = dependent_type_p_r (type
);
20799 TYPE_DEPENDENT_P_VALID (type
) = 1;
20802 return TYPE_DEPENDENT_P (type
);
20805 /* Returns TRUE if SCOPE is a dependent scope, in which we can't do any
20806 lookup. In other words, a dependent type that is not the current
20810 dependent_scope_p (tree scope
)
20812 return (scope
&& TYPE_P (scope
) && dependent_type_p (scope
)
20813 && !currently_open_class (scope
));
20816 /* T is a SCOPE_REF; return whether we need to consider it
20817 instantiation-dependent so that we can check access at instantiation
20818 time even though we know which member it resolves to. */
20821 instantiation_dependent_scope_ref_p (tree t
)
20823 if (DECL_P (TREE_OPERAND (t
, 1))
20824 && CLASS_TYPE_P (TREE_OPERAND (t
, 0))
20825 && accessible_in_template_p (TREE_OPERAND (t
, 0),
20826 TREE_OPERAND (t
, 1)))
20832 /* Returns TRUE if the EXPRESSION is value-dependent, in the sense of
20833 [temp.dep.constexpr]. EXPRESSION is already known to be a constant
20836 /* Note that this predicate is not appropriate for general expressions;
20837 only constant expressions (that satisfy potential_constant_expression)
20838 can be tested for value dependence. */
20841 value_dependent_expression_p (tree expression
)
20843 if (!processing_template_decl
)
20846 /* A name declared with a dependent type. */
20847 if (DECL_P (expression
) && type_dependent_expression_p (expression
))
20850 switch (TREE_CODE (expression
))
20852 case IDENTIFIER_NODE
:
20853 /* A name that has not been looked up -- must be dependent. */
20856 case TEMPLATE_PARM_INDEX
:
20857 /* A non-type template parm. */
20861 /* A non-type template parm. */
20862 if (DECL_TEMPLATE_PARM_P (expression
))
20864 return value_dependent_expression_p (DECL_INITIAL (expression
));
20867 /* A constant with literal type and is initialized
20868 with an expression that is value-dependent.
20870 Note that a non-dependent parenthesized initializer will have
20871 already been replaced with its constant value, so if we see
20872 a TREE_LIST it must be dependent. */
20873 if (DECL_INITIAL (expression
)
20874 && decl_constant_var_p (expression
)
20875 && (TREE_CODE (DECL_INITIAL (expression
)) == TREE_LIST
20876 || value_dependent_expression_p (DECL_INITIAL (expression
))))
20880 case DYNAMIC_CAST_EXPR
:
20881 case STATIC_CAST_EXPR
:
20882 case CONST_CAST_EXPR
:
20883 case REINTERPRET_CAST_EXPR
:
20885 /* These expressions are value-dependent if the type to which
20886 the cast occurs is dependent or the expression being casted
20887 is value-dependent. */
20889 tree type
= TREE_TYPE (expression
);
20891 if (dependent_type_p (type
))
20894 /* A functional cast has a list of operands. */
20895 expression
= TREE_OPERAND (expression
, 0);
20898 /* If there are no operands, it must be an expression such
20899 as "int()". This should not happen for aggregate types
20900 because it would form non-constant expressions. */
20901 gcc_assert (cxx_dialect
>= cxx11
20902 || INTEGRAL_OR_ENUMERATION_TYPE_P (type
));
20907 if (TREE_CODE (expression
) == TREE_LIST
)
20908 return any_value_dependent_elements_p (expression
);
20910 return value_dependent_expression_p (expression
);
20914 if (SIZEOF_EXPR_TYPE_P (expression
))
20915 return dependent_type_p (TREE_TYPE (TREE_OPERAND (expression
, 0)));
20919 /* A `sizeof' expression is value-dependent if the operand is
20920 type-dependent or is a pack expansion. */
20921 expression
= TREE_OPERAND (expression
, 0);
20922 if (PACK_EXPANSION_P (expression
))
20924 else if (TYPE_P (expression
))
20925 return dependent_type_p (expression
);
20926 return instantiation_dependent_expression_p (expression
);
20928 case AT_ENCODE_EXPR
:
20929 /* An 'encode' expression is value-dependent if the operand is
20931 expression
= TREE_OPERAND (expression
, 0);
20932 return dependent_type_p (expression
);
20934 case NOEXCEPT_EXPR
:
20935 expression
= TREE_OPERAND (expression
, 0);
20936 return instantiation_dependent_expression_p (expression
);
20939 /* All instantiation-dependent expressions should also be considered
20940 value-dependent. */
20941 return instantiation_dependent_scope_ref_p (expression
);
20943 case COMPONENT_REF
:
20944 return (value_dependent_expression_p (TREE_OPERAND (expression
, 0))
20945 || value_dependent_expression_p (TREE_OPERAND (expression
, 1)));
20947 case NONTYPE_ARGUMENT_PACK
:
20948 /* A NONTYPE_ARGUMENT_PACK is value-dependent if any packed argument
20949 is value-dependent. */
20951 tree values
= ARGUMENT_PACK_ARGS (expression
);
20952 int i
, len
= TREE_VEC_LENGTH (values
);
20954 for (i
= 0; i
< len
; ++i
)
20955 if (value_dependent_expression_p (TREE_VEC_ELT (values
, i
)))
20963 tree type2
= TRAIT_EXPR_TYPE2 (expression
);
20964 return (dependent_type_p (TRAIT_EXPR_TYPE1 (expression
))
20965 || (type2
? dependent_type_p (type2
) : false));
20969 return ((value_dependent_expression_p (TREE_OPERAND (expression
, 0)))
20970 || (value_dependent_expression_p (TREE_OPERAND (expression
, 2))));
20973 return ((value_dependent_expression_p (TREE_OPERAND (expression
, 0)))
20974 || (value_dependent_expression_p (TREE_OPERAND (expression
, 1))));
20978 tree op
= TREE_OPERAND (expression
, 0);
20979 return (value_dependent_expression_p (op
)
20980 || has_value_dependent_address (op
));
20985 tree fn
= get_callee_fndecl (expression
);
20987 if (!fn
&& value_dependent_expression_p (CALL_EXPR_FN (expression
)))
20989 nargs
= call_expr_nargs (expression
);
20990 for (i
= 0; i
< nargs
; ++i
)
20992 tree op
= CALL_EXPR_ARG (expression
, i
);
20993 /* In a call to a constexpr member function, look through the
20994 implicit ADDR_EXPR on the object argument so that it doesn't
20995 cause the call to be considered value-dependent. We also
20996 look through it in potential_constant_expression. */
20997 if (i
== 0 && fn
&& DECL_DECLARED_CONSTEXPR_P (fn
)
20998 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
20999 && TREE_CODE (op
) == ADDR_EXPR
)
21000 op
= TREE_OPERAND (op
, 0);
21001 if (value_dependent_expression_p (op
))
21007 case TEMPLATE_ID_EXPR
:
21008 /* If a TEMPLATE_ID_EXPR involves a dependent name, it will be
21010 return type_dependent_expression_p (expression
);
21016 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expression
), ix
, val
)
21017 if (value_dependent_expression_p (val
))
21023 /* Treat a GNU statement expression as dependent to avoid crashing
21024 under fold_non_dependent_expr; it can't be constant. */
21028 /* A constant expression is value-dependent if any subexpression is
21029 value-dependent. */
21030 switch (TREE_CODE_CLASS (TREE_CODE (expression
)))
21032 case tcc_reference
:
21034 case tcc_comparison
:
21036 case tcc_expression
:
21039 int i
, len
= cp_tree_operand_length (expression
);
21041 for (i
= 0; i
< len
; i
++)
21043 tree t
= TREE_OPERAND (expression
, i
);
21045 /* In some cases, some of the operands may be missing.l
21046 (For example, in the case of PREDECREMENT_EXPR, the
21047 amount to increment by may be missing.) That doesn't
21048 make the expression dependent. */
21049 if (t
&& value_dependent_expression_p (t
))
21060 /* The expression is not value-dependent. */
21064 /* Returns TRUE if the EXPRESSION is type-dependent, in the sense of
21065 [temp.dep.expr]. Note that an expression with no type is
21066 considered dependent. Other parts of the compiler arrange for an
21067 expression with type-dependent subexpressions to have no type, so
21068 this function doesn't have to be fully recursive. */
21071 type_dependent_expression_p (tree expression
)
21073 if (!processing_template_decl
)
21076 if (expression
== NULL_TREE
|| expression
== error_mark_node
)
21079 /* An unresolved name is always dependent. */
21080 if (identifier_p (expression
) || TREE_CODE (expression
) == USING_DECL
)
21083 /* Some expression forms are never type-dependent. */
21084 if (TREE_CODE (expression
) == PSEUDO_DTOR_EXPR
21085 || TREE_CODE (expression
) == SIZEOF_EXPR
21086 || TREE_CODE (expression
) == ALIGNOF_EXPR
21087 || TREE_CODE (expression
) == AT_ENCODE_EXPR
21088 || TREE_CODE (expression
) == NOEXCEPT_EXPR
21089 || TREE_CODE (expression
) == TRAIT_EXPR
21090 || TREE_CODE (expression
) == TYPEID_EXPR
21091 || TREE_CODE (expression
) == DELETE_EXPR
21092 || TREE_CODE (expression
) == VEC_DELETE_EXPR
21093 || TREE_CODE (expression
) == THROW_EXPR
)
21096 /* The types of these expressions depends only on the type to which
21097 the cast occurs. */
21098 if (TREE_CODE (expression
) == DYNAMIC_CAST_EXPR
21099 || TREE_CODE (expression
) == STATIC_CAST_EXPR
21100 || TREE_CODE (expression
) == CONST_CAST_EXPR
21101 || TREE_CODE (expression
) == REINTERPRET_CAST_EXPR
21102 || TREE_CODE (expression
) == IMPLICIT_CONV_EXPR
21103 || TREE_CODE (expression
) == CAST_EXPR
)
21104 return dependent_type_p (TREE_TYPE (expression
));
21106 /* The types of these expressions depends only on the type created
21107 by the expression. */
21108 if (TREE_CODE (expression
) == NEW_EXPR
21109 || TREE_CODE (expression
) == VEC_NEW_EXPR
)
21111 /* For NEW_EXPR tree nodes created inside a template, either
21112 the object type itself or a TREE_LIST may appear as the
21114 tree type
= TREE_OPERAND (expression
, 1);
21115 if (TREE_CODE (type
) == TREE_LIST
)
21116 /* This is an array type. We need to check array dimensions
21118 return dependent_type_p (TREE_VALUE (TREE_PURPOSE (type
)))
21119 || value_dependent_expression_p
21120 (TREE_OPERAND (TREE_VALUE (type
), 1));
21122 return dependent_type_p (type
);
21125 if (TREE_CODE (expression
) == SCOPE_REF
)
21127 tree scope
= TREE_OPERAND (expression
, 0);
21128 tree name
= TREE_OPERAND (expression
, 1);
21130 /* 14.6.2.2 [temp.dep.expr]: An id-expression is type-dependent if it
21131 contains an identifier associated by name lookup with one or more
21132 declarations declared with a dependent type, or...a
21133 nested-name-specifier or qualified-id that names a member of an
21134 unknown specialization. */
21135 return (type_dependent_expression_p (name
)
21136 || dependent_scope_p (scope
));
21139 if (TREE_CODE (expression
) == FUNCTION_DECL
21140 && DECL_LANG_SPECIFIC (expression
)
21141 && DECL_TEMPLATE_INFO (expression
)
21142 && (any_dependent_template_arguments_p
21143 (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (expression
)))))
21146 if (TREE_CODE (expression
) == TEMPLATE_DECL
21147 && !DECL_TEMPLATE_TEMPLATE_PARM_P (expression
))
21150 if (TREE_CODE (expression
) == STMT_EXPR
)
21151 expression
= stmt_expr_value_expr (expression
);
21153 if (BRACE_ENCLOSED_INITIALIZER_P (expression
))
21158 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expression
), i
, elt
)
21160 if (type_dependent_expression_p (elt
))
21166 /* A static data member of the current instantiation with incomplete
21167 array type is type-dependent, as the definition and specializations
21168 can have different bounds. */
21169 if (VAR_P (expression
)
21170 && DECL_CLASS_SCOPE_P (expression
)
21171 && dependent_type_p (DECL_CONTEXT (expression
))
21172 && VAR_HAD_UNKNOWN_BOUND (expression
))
21175 /* An array of unknown bound depending on a variadic parameter, eg:
21177 template<typename... Args>
21178 void foo (Args... args)
21180 int arr[] = { args... };
21183 template<int... vals>
21186 int arr[] = { vals... };
21189 If the array has no length and has an initializer, it must be that
21190 we couldn't determine its length in cp_complete_array_type because
21191 it is dependent. */
21192 if (VAR_P (expression
)
21193 && TREE_CODE (TREE_TYPE (expression
)) == ARRAY_TYPE
21194 && !TYPE_DOMAIN (TREE_TYPE (expression
))
21195 && DECL_INITIAL (expression
))
21198 if (TREE_TYPE (expression
) == unknown_type_node
)
21200 if (TREE_CODE (expression
) == ADDR_EXPR
)
21201 return type_dependent_expression_p (TREE_OPERAND (expression
, 0));
21202 if (TREE_CODE (expression
) == COMPONENT_REF
21203 || TREE_CODE (expression
) == OFFSET_REF
)
21205 if (type_dependent_expression_p (TREE_OPERAND (expression
, 0)))
21207 expression
= TREE_OPERAND (expression
, 1);
21208 if (identifier_p (expression
))
21211 /* SCOPE_REF with non-null TREE_TYPE is always non-dependent. */
21212 if (TREE_CODE (expression
) == SCOPE_REF
)
21215 /* Always dependent, on the number of arguments if nothing else. */
21216 if (TREE_CODE (expression
) == EXPR_PACK_EXPANSION
)
21219 if (BASELINK_P (expression
))
21221 if (BASELINK_OPTYPE (expression
)
21222 && dependent_type_p (BASELINK_OPTYPE (expression
)))
21224 expression
= BASELINK_FUNCTIONS (expression
);
21227 if (TREE_CODE (expression
) == TEMPLATE_ID_EXPR
)
21229 if (any_dependent_template_arguments_p
21230 (TREE_OPERAND (expression
, 1)))
21232 expression
= TREE_OPERAND (expression
, 0);
21234 gcc_assert (TREE_CODE (expression
) == OVERLOAD
21235 || TREE_CODE (expression
) == FUNCTION_DECL
);
21239 if (type_dependent_expression_p (OVL_CURRENT (expression
)))
21241 expression
= OVL_NEXT (expression
);
21246 gcc_assert (TREE_CODE (expression
) != TYPE_DECL
);
21248 return (dependent_type_p (TREE_TYPE (expression
)));
21251 /* walk_tree callback function for instantiation_dependent_expression_p,
21252 below. Returns non-zero if a dependent subexpression is found. */
21255 instantiation_dependent_r (tree
*tp
, int *walk_subtrees
,
21260 /* We don't have to worry about decltype currently because decltype
21261 of an instantiation-dependent expr is a dependent type. This
21262 might change depending on the resolution of DR 1172. */
21263 *walk_subtrees
= false;
21266 enum tree_code code
= TREE_CODE (*tp
);
21269 /* Don't treat an argument list as dependent just because it has no
21277 /* A constant with a dependent initializer is dependent. */
21278 if (value_dependent_expression_p (*tp
))
21282 case TEMPLATE_PARM_INDEX
:
21285 /* Handle expressions with type operands. */
21289 case AT_ENCODE_EXPR
:
21291 tree op
= TREE_OPERAND (*tp
, 0);
21292 if (code
== SIZEOF_EXPR
&& SIZEOF_EXPR_TYPE_P (*tp
))
21293 op
= TREE_TYPE (op
);
21296 if (dependent_type_p (op
))
21300 *walk_subtrees
= false;
21308 if (dependent_type_p (TRAIT_EXPR_TYPE1 (*tp
))
21309 || (TRAIT_EXPR_TYPE2 (*tp
)
21310 && dependent_type_p (TRAIT_EXPR_TYPE2 (*tp
))))
21312 *walk_subtrees
= false;
21315 case COMPONENT_REF
:
21316 if (identifier_p (TREE_OPERAND (*tp
, 1)))
21317 /* In a template, finish_class_member_access_expr creates a
21318 COMPONENT_REF with an IDENTIFIER_NODE for op1 even if it isn't
21319 type-dependent, so that we can check access control at
21320 instantiation time (PR 42277). See also Core issue 1273. */
21325 if (instantiation_dependent_scope_ref_p (*tp
))
21330 /* Treat statement-expressions as dependent. */
21338 if (type_dependent_expression_p (*tp
))
21344 /* Returns TRUE if the EXPRESSION is instantiation-dependent, in the
21345 sense defined by the ABI:
21347 "An expression is instantiation-dependent if it is type-dependent
21348 or value-dependent, or it has a subexpression that is type-dependent
21349 or value-dependent." */
21352 instantiation_dependent_expression_p (tree expression
)
21356 if (!processing_template_decl
)
21359 if (expression
== error_mark_node
)
21362 result
= cp_walk_tree_without_duplicates (&expression
,
21363 instantiation_dependent_r
, NULL
);
21364 return result
!= NULL_TREE
;
21367 /* Like type_dependent_expression_p, but it also works while not processing
21368 a template definition, i.e. during substitution or mangling. */
21371 type_dependent_expression_p_push (tree expr
)
21374 ++processing_template_decl
;
21375 b
= type_dependent_expression_p (expr
);
21376 --processing_template_decl
;
21380 /* Returns TRUE if ARGS contains a type-dependent expression. */
21383 any_type_dependent_arguments_p (const vec
<tree
, va_gc
> *args
)
21388 FOR_EACH_VEC_SAFE_ELT (args
, i
, arg
)
21390 if (type_dependent_expression_p (arg
))
21396 /* Returns TRUE if LIST (a TREE_LIST whose TREE_VALUEs are
21397 expressions) contains any type-dependent expressions. */
21400 any_type_dependent_elements_p (const_tree list
)
21402 for (; list
; list
= TREE_CHAIN (list
))
21403 if (type_dependent_expression_p (TREE_VALUE (list
)))
21409 /* Returns TRUE if LIST (a TREE_LIST whose TREE_VALUEs are
21410 expressions) contains any value-dependent expressions. */
21413 any_value_dependent_elements_p (const_tree list
)
21415 for (; list
; list
= TREE_CHAIN (list
))
21416 if (value_dependent_expression_p (TREE_VALUE (list
)))
21422 /* Returns TRUE if the ARG (a template argument) is dependent. */
21425 dependent_template_arg_p (tree arg
)
21427 if (!processing_template_decl
)
21430 /* Assume a template argument that was wrongly written by the user
21431 is dependent. This is consistent with what
21432 any_dependent_template_arguments_p [that calls this function]
21434 if (!arg
|| arg
== error_mark_node
)
21437 if (TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
21438 arg
= ARGUMENT_PACK_SELECT_ARG (arg
);
21440 if (TREE_CODE (arg
) == TEMPLATE_DECL
21441 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
21442 return dependent_template_p (arg
);
21443 else if (ARGUMENT_PACK_P (arg
))
21445 tree args
= ARGUMENT_PACK_ARGS (arg
);
21446 int i
, len
= TREE_VEC_LENGTH (args
);
21447 for (i
= 0; i
< len
; ++i
)
21449 if (dependent_template_arg_p (TREE_VEC_ELT (args
, i
)))
21455 else if (TYPE_P (arg
))
21456 return dependent_type_p (arg
);
21458 return (type_dependent_expression_p (arg
)
21459 || value_dependent_expression_p (arg
));
21462 /* Returns true if ARGS (a collection of template arguments) contains
21463 any types that require structural equality testing. */
21466 any_template_arguments_need_structural_equality_p (tree args
)
21473 if (args
== error_mark_node
)
21476 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
21478 tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
21479 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
21481 tree arg
= TREE_VEC_ELT (level
, j
);
21482 tree packed_args
= NULL_TREE
;
21485 if (ARGUMENT_PACK_P (arg
))
21487 /* Look inside the argument pack. */
21488 packed_args
= ARGUMENT_PACK_ARGS (arg
);
21489 len
= TREE_VEC_LENGTH (packed_args
);
21492 for (k
= 0; k
< len
; ++k
)
21495 arg
= TREE_VEC_ELT (packed_args
, k
);
21497 if (error_operand_p (arg
))
21499 else if (TREE_CODE (arg
) == TEMPLATE_DECL
)
21501 else if (TYPE_P (arg
) && TYPE_STRUCTURAL_EQUALITY_P (arg
))
21503 else if (!TYPE_P (arg
) && TREE_TYPE (arg
)
21504 && TYPE_STRUCTURAL_EQUALITY_P (TREE_TYPE (arg
)))
21513 /* Returns true if ARGS (a collection of template arguments) contains
21514 any dependent arguments. */
21517 any_dependent_template_arguments_p (const_tree args
)
21524 if (args
== error_mark_node
)
21527 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
21529 const_tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
21530 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
21531 if (dependent_template_arg_p (TREE_VEC_ELT (level
, j
)))
21538 /* Returns TRUE if the template TMPL is dependent. */
21541 dependent_template_p (tree tmpl
)
21543 if (TREE_CODE (tmpl
) == OVERLOAD
)
21547 if (dependent_template_p (OVL_CURRENT (tmpl
)))
21549 tmpl
= OVL_NEXT (tmpl
);
21554 /* Template template parameters are dependent. */
21555 if (DECL_TEMPLATE_TEMPLATE_PARM_P (tmpl
)
21556 || TREE_CODE (tmpl
) == TEMPLATE_TEMPLATE_PARM
)
21558 /* So are names that have not been looked up. */
21559 if (TREE_CODE (tmpl
) == SCOPE_REF
|| identifier_p (tmpl
))
21561 /* So are member templates of dependent classes. */
21562 if (TYPE_P (CP_DECL_CONTEXT (tmpl
)))
21563 return dependent_type_p (DECL_CONTEXT (tmpl
));
21567 /* Returns TRUE if the specialization TMPL<ARGS> is dependent. */
21570 dependent_template_id_p (tree tmpl
, tree args
)
21572 return (dependent_template_p (tmpl
)
21573 || any_dependent_template_arguments_p (args
));
21576 /* Returns TRUE if OMP_FOR with DECLV, INITV, CONDV and INCRV vectors
21580 dependent_omp_for_p (tree declv
, tree initv
, tree condv
, tree incrv
)
21584 if (!processing_template_decl
)
21587 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
21589 tree decl
= TREE_VEC_ELT (declv
, i
);
21590 tree init
= TREE_VEC_ELT (initv
, i
);
21591 tree cond
= TREE_VEC_ELT (condv
, i
);
21592 tree incr
= TREE_VEC_ELT (incrv
, i
);
21594 if (type_dependent_expression_p (decl
))
21597 if (init
&& type_dependent_expression_p (init
))
21600 if (type_dependent_expression_p (cond
))
21603 if (COMPARISON_CLASS_P (cond
)
21604 && (type_dependent_expression_p (TREE_OPERAND (cond
, 0))
21605 || type_dependent_expression_p (TREE_OPERAND (cond
, 1))))
21608 if (TREE_CODE (incr
) == MODOP_EXPR
)
21610 if (type_dependent_expression_p (TREE_OPERAND (incr
, 0))
21611 || type_dependent_expression_p (TREE_OPERAND (incr
, 2)))
21614 else if (type_dependent_expression_p (incr
))
21616 else if (TREE_CODE (incr
) == MODIFY_EXPR
)
21618 if (type_dependent_expression_p (TREE_OPERAND (incr
, 0)))
21620 else if (BINARY_CLASS_P (TREE_OPERAND (incr
, 1)))
21622 tree t
= TREE_OPERAND (incr
, 1);
21623 if (type_dependent_expression_p (TREE_OPERAND (t
, 0))
21624 || type_dependent_expression_p (TREE_OPERAND (t
, 1)))
21633 /* TYPE is a TYPENAME_TYPE. Returns the ordinary TYPE to which the
21634 TYPENAME_TYPE corresponds. Returns the original TYPENAME_TYPE if
21635 no such TYPE can be found. Note that this function peers inside
21636 uninstantiated templates and therefore should be used only in
21637 extremely limited situations. ONLY_CURRENT_P restricts this
21638 peering to the currently open classes hierarchy (which is required
21639 when comparing types). */
21642 resolve_typename_type (tree type
, bool only_current_p
)
21651 gcc_assert (TREE_CODE (type
) == TYPENAME_TYPE
);
21653 scope
= TYPE_CONTEXT (type
);
21654 /* Usually the non-qualified identifier of a TYPENAME_TYPE is
21655 TYPE_IDENTIFIER (type). But when 'type' is a typedef variant of
21656 a TYPENAME_TYPE node, then TYPE_NAME (type) is set to the TYPE_DECL representing
21657 the typedef. In that case TYPE_IDENTIFIER (type) is not the non-qualified
21658 identifier of the TYPENAME_TYPE anymore.
21659 So by getting the TYPE_IDENTIFIER of the _main declaration_ of the
21660 TYPENAME_TYPE instead, we avoid messing up with a possible
21661 typedef variant case. */
21662 name
= TYPE_IDENTIFIER (TYPE_MAIN_VARIANT (type
));
21664 /* If the SCOPE is itself a TYPENAME_TYPE, then we need to resolve
21665 it first before we can figure out what NAME refers to. */
21666 if (TREE_CODE (scope
) == TYPENAME_TYPE
)
21668 if (TYPENAME_IS_RESOLVING_P (scope
))
21669 /* Given a class template A with a dependent base with nested type C,
21670 typedef typename A::C::C C will land us here, as trying to resolve
21671 the initial A::C leads to the local C typedef, which leads back to
21672 A::C::C. So we break the recursion now. */
21675 scope
= resolve_typename_type (scope
, only_current_p
);
21677 /* If we don't know what SCOPE refers to, then we cannot resolve the
21679 if (TREE_CODE (scope
) == TYPENAME_TYPE
)
21681 /* If the SCOPE is a template type parameter, we have no way of
21682 resolving the name. */
21683 if (TREE_CODE (scope
) == TEMPLATE_TYPE_PARM
)
21685 /* If the SCOPE is not the current instantiation, there's no reason
21686 to look inside it. */
21687 if (only_current_p
&& !currently_open_class (scope
))
21689 /* If this is a typedef, we don't want to look inside (c++/11987). */
21690 if (typedef_variant_p (type
))
21692 /* If SCOPE isn't the template itself, it will not have a valid
21693 TYPE_FIELDS list. */
21694 if (same_type_p (scope
, CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope
)))
21695 /* scope is either the template itself or a compatible instantiation
21696 like X<T>, so look up the name in the original template. */
21697 scope
= CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope
);
21699 /* scope is a partial instantiation, so we can't do the lookup or we
21700 will lose the template arguments. */
21702 /* Enter the SCOPE so that name lookup will be resolved as if we
21703 were in the class definition. In particular, SCOPE will no
21704 longer be considered a dependent type. */
21705 pushed_scope
= push_scope (scope
);
21706 /* Look up the declaration. */
21707 decl
= lookup_member (scope
, name
, /*protect=*/0, /*want_type=*/true,
21708 tf_warning_or_error
);
21710 result
= NULL_TREE
;
21712 /* For a TYPENAME_TYPE like "typename X::template Y<T>", we want to
21713 find a TEMPLATE_DECL. Otherwise, we want to find a TYPE_DECL. */
21716 else if (identifier_p (TYPENAME_TYPE_FULLNAME (type
))
21717 && TREE_CODE (decl
) == TYPE_DECL
)
21719 result
= TREE_TYPE (decl
);
21720 if (result
== error_mark_node
)
21721 result
= NULL_TREE
;
21723 else if (TREE_CODE (TYPENAME_TYPE_FULLNAME (type
)) == TEMPLATE_ID_EXPR
21724 && DECL_CLASS_TEMPLATE_P (decl
))
21728 /* Obtain the template and the arguments. */
21729 tmpl
= TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type
), 0);
21730 args
= TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type
), 1);
21731 /* Instantiate the template. */
21732 result
= lookup_template_class (tmpl
, args
, NULL_TREE
, NULL_TREE
,
21733 /*entering_scope=*/0,
21734 tf_error
| tf_user
);
21735 if (result
== error_mark_node
)
21736 result
= NULL_TREE
;
21739 /* Leave the SCOPE. */
21741 pop_scope (pushed_scope
);
21743 /* If we failed to resolve it, return the original typename. */
21747 /* If lookup found a typename type, resolve that too. */
21748 if (TREE_CODE (result
) == TYPENAME_TYPE
&& !TYPENAME_IS_RESOLVING_P (result
))
21750 /* Ill-formed programs can cause infinite recursion here, so we
21751 must catch that. */
21752 TYPENAME_IS_RESOLVING_P (type
) = 1;
21753 result
= resolve_typename_type (result
, only_current_p
);
21754 TYPENAME_IS_RESOLVING_P (type
) = 0;
21757 /* Qualify the resulting type. */
21758 quals
= cp_type_quals (type
);
21760 result
= cp_build_qualified_type (result
, cp_type_quals (result
) | quals
);
21765 /* EXPR is an expression which is not type-dependent. Return a proxy
21766 for EXPR that can be used to compute the types of larger
21767 expressions containing EXPR. */
21770 build_non_dependent_expr (tree expr
)
21774 #ifdef ENABLE_CHECKING
21775 /* Try to get a constant value for all non-dependent expressions in
21776 order to expose bugs in *_dependent_expression_p and constexpr. */
21777 if (cxx_dialect
>= cxx11
)
21778 maybe_constant_value (fold_non_dependent_expr_sfinae (expr
, tf_none
));
21781 /* Preserve OVERLOADs; the functions must be available to resolve
21784 if (TREE_CODE (inner_expr
) == STMT_EXPR
)
21785 inner_expr
= stmt_expr_value_expr (inner_expr
);
21786 if (TREE_CODE (inner_expr
) == ADDR_EXPR
)
21787 inner_expr
= TREE_OPERAND (inner_expr
, 0);
21788 if (TREE_CODE (inner_expr
) == COMPONENT_REF
)
21789 inner_expr
= TREE_OPERAND (inner_expr
, 1);
21790 if (is_overloaded_fn (inner_expr
)
21791 || TREE_CODE (inner_expr
) == OFFSET_REF
)
21793 /* There is no need to return a proxy for a variable. */
21796 /* Preserve string constants; conversions from string constants to
21797 "char *" are allowed, even though normally a "const char *"
21798 cannot be used to initialize a "char *". */
21799 if (TREE_CODE (expr
) == STRING_CST
)
21801 /* Preserve void and arithmetic constants, as an optimization -- there is no
21802 reason to create a new node. */
21803 if (TREE_CODE (expr
) == VOID_CST
21804 || TREE_CODE (expr
) == INTEGER_CST
21805 || TREE_CODE (expr
) == REAL_CST
)
21807 /* Preserve THROW_EXPRs -- all throw-expressions have type "void".
21808 There is at least one place where we want to know that a
21809 particular expression is a throw-expression: when checking a ?:
21810 expression, there are special rules if the second or third
21811 argument is a throw-expression. */
21812 if (TREE_CODE (expr
) == THROW_EXPR
)
21815 /* Don't wrap an initializer list, we need to be able to look inside. */
21816 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
21819 /* Don't wrap a dummy object, we need to be able to test for it. */
21820 if (is_dummy_object (expr
))
21823 if (TREE_CODE (expr
) == COND_EXPR
)
21824 return build3 (COND_EXPR
,
21826 TREE_OPERAND (expr
, 0),
21827 (TREE_OPERAND (expr
, 1)
21828 ? build_non_dependent_expr (TREE_OPERAND (expr
, 1))
21829 : build_non_dependent_expr (TREE_OPERAND (expr
, 0))),
21830 build_non_dependent_expr (TREE_OPERAND (expr
, 2)));
21831 if (TREE_CODE (expr
) == COMPOUND_EXPR
21832 && !COMPOUND_EXPR_OVERLOADED (expr
))
21833 return build2 (COMPOUND_EXPR
,
21835 TREE_OPERAND (expr
, 0),
21836 build_non_dependent_expr (TREE_OPERAND (expr
, 1)));
21838 /* If the type is unknown, it can't really be non-dependent */
21839 gcc_assert (TREE_TYPE (expr
) != unknown_type_node
);
21841 /* Otherwise, build a NON_DEPENDENT_EXPR. */
21842 return build1 (NON_DEPENDENT_EXPR
, TREE_TYPE (expr
), expr
);
21845 /* ARGS is a vector of expressions as arguments to a function call.
21846 Replace the arguments with equivalent non-dependent expressions.
21847 This modifies ARGS in place. */
21850 make_args_non_dependent (vec
<tree
, va_gc
> *args
)
21855 FOR_EACH_VEC_SAFE_ELT (args
, ix
, arg
)
21857 tree newarg
= build_non_dependent_expr (arg
);
21859 (*args
)[ix
] = newarg
;
21863 /* Returns a type which represents 'auto' or 'decltype(auto)'. We use a
21864 TEMPLATE_TYPE_PARM with a level one deeper than the actual template
21868 make_auto_1 (tree name
)
21870 tree au
= cxx_make_type (TEMPLATE_TYPE_PARM
);
21871 TYPE_NAME (au
) = build_decl (input_location
,
21872 TYPE_DECL
, name
, au
);
21873 TYPE_STUB_DECL (au
) = TYPE_NAME (au
);
21874 TEMPLATE_TYPE_PARM_INDEX (au
) = build_template_parm_index
21875 (0, processing_template_decl
+ 1, processing_template_decl
+ 1,
21876 TYPE_NAME (au
), NULL_TREE
);
21877 TYPE_CANONICAL (au
) = canonical_type_parameter (au
);
21878 DECL_ARTIFICIAL (TYPE_NAME (au
)) = 1;
21879 SET_DECL_TEMPLATE_PARM_P (TYPE_NAME (au
));
21885 make_decltype_auto (void)
21887 return make_auto_1 (get_identifier ("decltype(auto)"));
21893 return make_auto_1 (get_identifier ("auto"));
21896 /* Given type ARG, return std::initializer_list<ARG>. */
21901 tree std_init_list
= namespace_binding
21902 (get_identifier ("initializer_list"), std_node
);
21904 if (!std_init_list
|| !DECL_CLASS_TEMPLATE_P (std_init_list
))
21906 error ("deducing from brace-enclosed initializer list requires "
21907 "#include <initializer_list>");
21908 return error_mark_node
;
21910 argvec
= make_tree_vec (1);
21911 TREE_VEC_ELT (argvec
, 0) = arg
;
21912 return lookup_template_class (std_init_list
, argvec
, NULL_TREE
,
21913 NULL_TREE
, 0, tf_warning_or_error
);
21916 /* Replace auto in TYPE with std::initializer_list<auto>. */
21919 listify_autos (tree type
, tree auto_node
)
21921 tree init_auto
= listify (auto_node
);
21922 tree argvec
= make_tree_vec (1);
21923 TREE_VEC_ELT (argvec
, 0) = init_auto
;
21924 if (processing_template_decl
)
21925 argvec
= add_to_template_args (current_template_args (), argvec
);
21926 return tsubst (type
, argvec
, tf_warning_or_error
, NULL_TREE
);
21929 /* Replace occurrences of 'auto' in TYPE with the appropriate type deduced
21930 from INIT. AUTO_NODE is the TEMPLATE_TYPE_PARM used for 'auto' in TYPE. */
21933 do_auto_deduction (tree type
, tree init
, tree auto_node
)
21937 if (init
== error_mark_node
)
21938 return error_mark_node
;
21940 if (type_dependent_expression_p (init
))
21941 /* Defining a subset of type-dependent expressions that we can deduce
21942 from ahead of time isn't worth the trouble. */
21945 /* [dcl.spec.auto]: Obtain P from T by replacing the occurrences of auto
21946 with either a new invented type template parameter U or, if the
21947 initializer is a braced-init-list (8.5.4), with
21948 std::initializer_list<U>. */
21949 if (BRACE_ENCLOSED_INITIALIZER_P (init
))
21950 type
= listify_autos (type
, auto_node
);
21952 init
= resolve_nondeduced_context (init
);
21954 targs
= make_tree_vec (1);
21955 if (AUTO_IS_DECLTYPE (auto_node
))
21957 bool id
= (DECL_P (init
) || (TREE_CODE (init
) == COMPONENT_REF
21958 && !REF_PARENTHESIZED_P (init
)));
21959 TREE_VEC_ELT (targs
, 0)
21960 = finish_decltype_type (init
, id
, tf_warning_or_error
);
21961 if (type
!= auto_node
)
21963 error ("%qT as type rather than plain %<decltype(auto)%>", type
);
21964 return error_mark_node
;
21969 tree parms
= build_tree_list (NULL_TREE
, type
);
21970 tree tparms
= make_tree_vec (1);
21973 TREE_VEC_ELT (tparms
, 0)
21974 = build_tree_list (NULL_TREE
, TYPE_NAME (auto_node
));
21975 val
= type_unification_real (tparms
, targs
, parms
, &init
, 1, 0,
21976 DEDUCE_CALL
, LOOKUP_NORMAL
,
21977 NULL
, /*explain_p=*/false);
21980 if (processing_template_decl
)
21981 /* Try again at instantiation time. */
21983 if (type
&& type
!= error_mark_node
)
21984 /* If type is error_mark_node a diagnostic must have been
21985 emitted by now. Also, having a mention to '<type error>'
21986 in the diagnostic is not really useful to the user. */
21988 if (cfun
&& auto_node
== current_function_auto_return_pattern
21989 && LAMBDA_FUNCTION_P (current_function_decl
))
21990 error ("unable to deduce lambda return type from %qE", init
);
21992 error ("unable to deduce %qT from %qE", type
, init
);
21994 return error_mark_node
;
21998 /* If the list of declarators contains more than one declarator, the type
21999 of each declared variable is determined as described above. If the
22000 type deduced for the template parameter U is not the same in each
22001 deduction, the program is ill-formed. */
22002 if (TREE_TYPE (auto_node
)
22003 && !same_type_p (TREE_TYPE (auto_node
), TREE_VEC_ELT (targs
, 0)))
22005 if (cfun
&& auto_node
== current_function_auto_return_pattern
22006 && LAMBDA_FUNCTION_P (current_function_decl
))
22007 error ("inconsistent types %qT and %qT deduced for "
22008 "lambda return type", TREE_TYPE (auto_node
),
22009 TREE_VEC_ELT (targs
, 0));
22011 error ("inconsistent deduction for %qT: %qT and then %qT",
22012 auto_node
, TREE_TYPE (auto_node
), TREE_VEC_ELT (targs
, 0));
22013 return error_mark_node
;
22015 TREE_TYPE (auto_node
) = TREE_VEC_ELT (targs
, 0);
22017 if (processing_template_decl
)
22018 targs
= add_to_template_args (current_template_args (), targs
);
22019 return tsubst (type
, targs
, tf_warning_or_error
, NULL_TREE
);
22022 /* Substitutes LATE_RETURN_TYPE for 'auto' in TYPE and returns the
22026 splice_late_return_type (tree type
, tree late_return_type
)
22030 if (late_return_type
== NULL_TREE
)
22032 argvec
= make_tree_vec (1);
22033 TREE_VEC_ELT (argvec
, 0) = late_return_type
;
22034 if (processing_template_parmlist
)
22035 /* For a late-specified return type in a template type-parameter, we
22036 need to add a dummy argument level for its parmlist. */
22037 argvec
= add_to_template_args
22038 (make_tree_vec (processing_template_parmlist
), argvec
);
22039 if (current_template_parms
)
22040 argvec
= add_to_template_args (current_template_args (), argvec
);
22041 return tsubst (type
, argvec
, tf_warning_or_error
, NULL_TREE
);
22044 /* Returns true iff TYPE is a TEMPLATE_TYPE_PARM representing 'auto' or
22045 'decltype(auto)'. */
22048 is_auto (const_tree type
)
22050 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
22051 && (TYPE_IDENTIFIER (type
) == get_identifier ("auto")
22052 || TYPE_IDENTIFIER (type
) == get_identifier ("decltype(auto)")))
22058 /* Returns the TEMPLATE_TYPE_PARM in TYPE representing `auto' iff TYPE contains
22059 a use of `auto'. Returns NULL_TREE otherwise. */
22062 type_uses_auto (tree type
)
22064 return find_type_usage (type
, is_auto
);
22067 /* Returns true iff TYPE is a TEMPLATE_TYPE_PARM representing 'auto',
22068 'decltype(auto)' or a concept. */
22071 is_auto_or_concept (const_tree type
)
22073 return is_auto (type
); // or concept
22076 /* Returns the TEMPLATE_TYPE_PARM in TYPE representing a generic type (`auto' or
22077 a concept identifier) iff TYPE contains a use of a generic type. Returns
22078 NULL_TREE otherwise. */
22081 type_uses_auto_or_concept (tree type
)
22083 return find_type_usage (type
, is_auto_or_concept
);
22087 /* For a given template T, return the vector of typedefs referenced
22088 in T for which access check is needed at T instantiation time.
22089 T is either a FUNCTION_DECL or a RECORD_TYPE.
22090 Those typedefs were added to T by the function
22091 append_type_to_template_for_access_check. */
22093 vec
<qualified_typedef_usage_t
, va_gc
> *
22094 get_types_needing_access_check (tree t
)
22097 vec
<qualified_typedef_usage_t
, va_gc
> *result
= NULL
;
22099 if (!t
|| t
== error_mark_node
)
22102 if (!(ti
= get_template_info (t
)))
22105 if (CLASS_TYPE_P (t
)
22106 || TREE_CODE (t
) == FUNCTION_DECL
)
22108 if (!TI_TEMPLATE (ti
))
22111 result
= TI_TYPEDEFS_NEEDING_ACCESS_CHECKING (ti
);
22117 /* Append the typedef TYPE_DECL used in template T to a list of typedefs
22118 tied to T. That list of typedefs will be access checked at
22119 T instantiation time.
22120 T is either a FUNCTION_DECL or a RECORD_TYPE.
22121 TYPE_DECL is a TYPE_DECL node representing a typedef.
22122 SCOPE is the scope through which TYPE_DECL is accessed.
22123 LOCATION is the location of the usage point of TYPE_DECL.
22125 This function is a subroutine of
22126 append_type_to_template_for_access_check. */
22129 append_type_to_template_for_access_check_1 (tree t
,
22132 location_t location
)
22134 qualified_typedef_usage_t typedef_usage
;
22137 if (!t
|| t
== error_mark_node
)
22140 gcc_assert ((TREE_CODE (t
) == FUNCTION_DECL
22141 || CLASS_TYPE_P (t
))
22143 && TREE_CODE (type_decl
) == TYPE_DECL
22146 if (!(ti
= get_template_info (t
)))
22149 gcc_assert (TI_TEMPLATE (ti
));
22151 typedef_usage
.typedef_decl
= type_decl
;
22152 typedef_usage
.context
= scope
;
22153 typedef_usage
.locus
= location
;
22155 vec_safe_push (TI_TYPEDEFS_NEEDING_ACCESS_CHECKING (ti
), typedef_usage
);
22158 /* Append TYPE_DECL to the template TEMPL.
22159 TEMPL is either a class type, a FUNCTION_DECL or a a TEMPLATE_DECL.
22160 At TEMPL instanciation time, TYPE_DECL will be checked to see
22161 if it can be accessed through SCOPE.
22162 LOCATION is the location of the usage point of TYPE_DECL.
22164 e.g. consider the following code snippet:
22171 template<class U> struct S
22173 C::myint mi; // <-- usage point of the typedef C::myint
22178 At S<char> instantiation time, we need to check the access of C::myint
22179 In other words, we need to check the access of the myint typedef through
22180 the C scope. For that purpose, this function will add the myint typedef
22181 and the scope C through which its being accessed to a list of typedefs
22182 tied to the template S. That list will be walked at template instantiation
22183 time and access check performed on each typedefs it contains.
22184 Note that this particular code snippet should yield an error because
22185 myint is private to C. */
22188 append_type_to_template_for_access_check (tree templ
,
22191 location_t location
)
22193 qualified_typedef_usage_t
*iter
;
22196 gcc_assert (type_decl
&& (TREE_CODE (type_decl
) == TYPE_DECL
));
22198 /* Make sure we don't append the type to the template twice. */
22199 FOR_EACH_VEC_SAFE_ELT (get_types_needing_access_check (templ
), i
, iter
)
22200 if (iter
->typedef_decl
== type_decl
&& scope
== iter
->context
)
22203 append_type_to_template_for_access_check_1 (templ
, type_decl
,
22207 /* Convert the generic type parameters in PARM that match the types given in the
22208 range [START_IDX, END_IDX) from the current_template_parms into generic type
22212 convert_generic_types_to_packs (tree parm
, int start_idx
, int end_idx
)
22214 tree current
= current_template_parms
;
22215 int depth
= TMPL_PARMS_DEPTH (current
);
22216 current
= INNERMOST_TEMPLATE_PARMS (current
);
22217 tree replacement
= make_tree_vec (TREE_VEC_LENGTH (current
));
22219 for (int i
= 0; i
< start_idx
; ++i
)
22220 TREE_VEC_ELT (replacement
, i
)
22221 = TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (current
, i
)));
22223 for (int i
= start_idx
; i
< end_idx
; ++i
)
22225 /* Create a distinct parameter pack type from the current parm and add it
22226 to the replacement args to tsubst below into the generic function
22229 tree o
= TREE_TYPE (TREE_VALUE
22230 (TREE_VEC_ELT (current
, i
)));
22231 tree t
= copy_type (o
);
22232 TEMPLATE_TYPE_PARM_INDEX (t
)
22233 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (o
),
22235 TREE_TYPE (TEMPLATE_TYPE_DECL (t
)) = t
;
22236 TYPE_STUB_DECL (t
) = TYPE_NAME (t
) = TEMPLATE_TYPE_DECL (t
);
22237 TYPE_MAIN_VARIANT (t
) = t
;
22238 TEMPLATE_TYPE_PARAMETER_PACK (t
) = true;
22239 TYPE_CANONICAL (t
) = canonical_type_parameter (t
);
22240 TREE_VEC_ELT (replacement
, i
) = t
;
22241 TREE_VALUE (TREE_VEC_ELT (current
, i
)) = TREE_CHAIN (t
);
22244 for (int i
= end_idx
, e
= TREE_VEC_LENGTH (current
); i
< e
; ++i
)
22245 TREE_VEC_ELT (replacement
, i
)
22246 = TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (current
, i
)));
22248 /* If there are more levels then build up the replacement with the outer
22251 replacement
= add_to_template_args (template_parms_to_args
22252 (TREE_CHAIN (current_template_parms
)),
22255 return tsubst (parm
, replacement
, tf_none
, NULL_TREE
);
22259 /* Set up the hash tables for template instantiations. */
22262 init_template_processing (void)
22264 decl_specializations
= htab_create_ggc (37,
22265 hash_specialization
,
22266 eq_specializations
,
22268 type_specializations
= htab_create_ggc (37,
22269 hash_specialization
,
22270 eq_specializations
,
22274 /* Print stats about the template hash tables for -fstats. */
22277 print_template_statistics (void)
22279 fprintf (stderr
, "decl_specializations: size %ld, %ld elements, "
22280 "%f collisions\n", (long) htab_size (decl_specializations
),
22281 (long) htab_elements (decl_specializations
),
22282 htab_collisions (decl_specializations
));
22283 fprintf (stderr
, "type_specializations: size %ld, %ld elements, "
22284 "%f collisions\n", (long) htab_size (type_specializations
),
22285 (long) htab_elements (type_specializations
),
22286 htab_collisions (type_specializations
));
22289 #include "gt-cp-pt.h"