1 /* Handle parameterized types (templates) for GNU -*- C++ -*-.
2 Copyright (C) 1992-2015 Free Software Foundation, Inc.
3 Written by Ken Raeburn (raeburn@cygnus.com) while at Watchmaker Computing.
4 Rewritten by Jason Merrill (jason@cygnus.com).
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3, or (at your option)
13 GCC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
22 /* Known bugs or deficiencies include:
24 all methods must be provided in header files; can't use a source
25 file that contains only the method templates and "just win". */
29 #include "coretypes.h"
33 #include "c-family/c-common.h"
35 #include "stringpool.h"
38 #include "stor-layout.h"
41 #include "c-family/c-objc.h"
42 #include "cp-objcp-common.h"
43 #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 // -------------------------------------------------------------------------- //
81 // Local Specialization Stack
83 // Implementation of the RAII helper for creating new local
85 local_specialization_stack::local_specialization_stack ()
86 : saved (local_specializations
)
88 local_specializations
= new hash_map
<tree
, tree
>;
91 local_specialization_stack::~local_specialization_stack ()
93 delete local_specializations
;
94 local_specializations
= saved
;
97 /* True if we've recursed into fn_type_unification too many times. */
98 static bool excessive_deduction_depth
;
100 struct GTY((for_user
)) spec_entry
107 struct spec_hasher
: ggc_ptr_hash
<spec_entry
>
109 static hashval_t
hash (spec_entry
*);
110 static bool equal (spec_entry
*, spec_entry
*);
113 static GTY (()) hash_table
<spec_hasher
> *decl_specializations
;
115 static GTY (()) hash_table
<spec_hasher
> *type_specializations
;
117 /* Contains canonical template parameter types. The vector is indexed by
118 the TEMPLATE_TYPE_IDX of the template parameter. Each element is a
119 TREE_LIST, whose TREE_VALUEs contain the canonical template
120 parameters of various types and levels. */
121 static GTY(()) vec
<tree
, va_gc
> *canonical_template_parms
;
123 #define UNIFY_ALLOW_NONE 0
124 #define UNIFY_ALLOW_MORE_CV_QUAL 1
125 #define UNIFY_ALLOW_LESS_CV_QUAL 2
126 #define UNIFY_ALLOW_DERIVED 4
127 #define UNIFY_ALLOW_INTEGER 8
128 #define UNIFY_ALLOW_OUTER_LEVEL 16
129 #define UNIFY_ALLOW_OUTER_MORE_CV_QUAL 32
130 #define UNIFY_ALLOW_OUTER_LESS_CV_QUAL 64
132 enum template_base_result
{
134 tbr_ambiguous_baseclass
,
138 static void push_access_scope (tree
);
139 static void pop_access_scope (tree
);
140 static bool resolve_overloaded_unification (tree
, tree
, tree
, tree
,
141 unification_kind_t
, int,
143 static int try_one_overload (tree
, tree
, tree
, tree
, tree
,
144 unification_kind_t
, int, bool, bool);
145 static int unify (tree
, tree
, tree
, tree
, int, bool);
146 static void add_pending_template (tree
);
147 static tree
reopen_tinst_level (struct tinst_level
*);
148 static tree
tsubst_initializer_list (tree
, tree
);
149 static tree
get_partial_spec_bindings (tree
, tree
, tree
, tree
);
150 static tree
coerce_template_parms (tree
, tree
, tree
, tsubst_flags_t
,
152 static tree
coerce_innermost_template_parms (tree
, tree
, tree
, tsubst_flags_t
,
154 static void tsubst_enum (tree
, tree
, tree
);
155 static tree
add_to_template_args (tree
, tree
);
156 static tree
add_outermost_template_args (tree
, tree
);
157 static bool check_instantiated_args (tree
, tree
, tsubst_flags_t
);
158 static int maybe_adjust_types_for_deduction (unification_kind_t
, tree
*, tree
*,
160 static int type_unification_real (tree
, tree
, tree
, const tree
*,
161 unsigned int, int, unification_kind_t
, int,
162 vec
<deferred_access_check
, va_gc
> **,
164 static void note_template_header (int);
165 static tree
convert_nontype_argument_function (tree
, tree
, tsubst_flags_t
);
166 static tree
convert_nontype_argument (tree
, tree
, tsubst_flags_t
);
167 static tree
convert_template_argument (tree
, tree
, tree
,
168 tsubst_flags_t
, int, tree
);
169 static tree
for_each_template_parm (tree
, tree_fn_t
, void*,
170 hash_set
<tree
> *, bool);
171 static tree
expand_template_argument_pack (tree
);
172 static tree
build_template_parm_index (int, int, int, tree
, tree
);
173 static bool inline_needs_template_parms (tree
, bool);
174 static void push_inline_template_parms_recursive (tree
, int);
175 static tree
reduce_template_parm_level (tree
, tree
, int, tree
, tsubst_flags_t
);
176 static int mark_template_parm (tree
, void *);
177 static int template_parm_this_level_p (tree
, void *);
178 static tree
tsubst_friend_function (tree
, tree
);
179 static tree
tsubst_friend_class (tree
, tree
);
180 static int can_complete_type_without_circularity (tree
);
181 static tree
get_bindings (tree
, tree
, tree
, bool);
182 static int template_decl_level (tree
);
183 static int check_cv_quals_for_unify (int, tree
, tree
);
184 static void template_parm_level_and_index (tree
, int*, int*);
185 static int unify_pack_expansion (tree
, tree
, tree
,
186 tree
, unification_kind_t
, bool, bool);
187 static tree
tsubst_template_arg (tree
, tree
, tsubst_flags_t
, tree
);
188 static tree
tsubst_template_args (tree
, tree
, tsubst_flags_t
, tree
);
189 static tree
tsubst_template_parms (tree
, tree
, tsubst_flags_t
);
190 static void regenerate_decl_from_template (tree
, tree
);
191 static tree
most_specialized_partial_spec (tree
, tsubst_flags_t
);
192 static tree
tsubst_aggr_type (tree
, tree
, tsubst_flags_t
, tree
, int);
193 static tree
tsubst_arg_types (tree
, tree
, tree
, tsubst_flags_t
, tree
);
194 static tree
tsubst_function_type (tree
, tree
, tsubst_flags_t
, tree
);
195 static bool check_specialization_scope (void);
196 static tree
process_partial_specialization (tree
);
197 static void set_current_access_from_decl (tree
);
198 static enum template_base_result
get_template_base (tree
, tree
, tree
, tree
,
200 static tree
try_class_unification (tree
, tree
, tree
, tree
, bool);
201 static int coerce_template_template_parms (tree
, tree
, tsubst_flags_t
,
203 static bool template_template_parm_bindings_ok_p (tree
, tree
);
204 static int template_args_equal (tree
, tree
);
205 static void tsubst_default_arguments (tree
, tsubst_flags_t
);
206 static tree
for_each_template_parm_r (tree
*, int *, void *);
207 static tree
copy_default_args_to_explicit_spec_1 (tree
, tree
);
208 static void copy_default_args_to_explicit_spec (tree
);
209 static int invalid_nontype_parm_type_p (tree
, tsubst_flags_t
);
210 static bool dependent_template_arg_p (tree
);
211 static bool any_template_arguments_need_structural_equality_p (tree
);
212 static bool dependent_type_p_r (tree
);
213 static tree
tsubst_copy (tree
, tree
, tsubst_flags_t
, tree
);
214 static tree
tsubst_decl (tree
, tree
, tsubst_flags_t
);
215 static void perform_typedefs_access_check (tree tmpl
, tree targs
);
216 static void append_type_to_template_for_access_check_1 (tree
, tree
, tree
,
218 static tree
listify (tree
);
219 static tree
listify_autos (tree
, tree
);
220 static tree
tsubst_template_parm (tree
, tree
, tsubst_flags_t
);
221 static tree
instantiate_alias_template (tree
, tree
, tsubst_flags_t
);
222 static bool complex_alias_template_p (const_tree tmpl
);
224 /* Make the current scope suitable for access checking when we are
225 processing T. T can be FUNCTION_DECL for instantiated function
226 template, VAR_DECL for static member variable, or TYPE_DECL for
227 alias template (needed by instantiate_decl). */
230 push_access_scope (tree t
)
232 gcc_assert (VAR_OR_FUNCTION_DECL_P (t
)
233 || TREE_CODE (t
) == TYPE_DECL
);
235 if (DECL_FRIEND_CONTEXT (t
))
236 push_nested_class (DECL_FRIEND_CONTEXT (t
));
237 else if (DECL_CLASS_SCOPE_P (t
))
238 push_nested_class (DECL_CONTEXT (t
));
240 push_to_top_level ();
242 if (TREE_CODE (t
) == FUNCTION_DECL
)
244 saved_access_scope
= tree_cons
245 (NULL_TREE
, current_function_decl
, saved_access_scope
);
246 current_function_decl
= t
;
250 /* Restore the scope set up by push_access_scope. T is the node we
254 pop_access_scope (tree t
)
256 if (TREE_CODE (t
) == FUNCTION_DECL
)
258 current_function_decl
= TREE_VALUE (saved_access_scope
);
259 saved_access_scope
= TREE_CHAIN (saved_access_scope
);
262 if (DECL_FRIEND_CONTEXT (t
) || DECL_CLASS_SCOPE_P (t
))
265 pop_from_top_level ();
268 /* Do any processing required when DECL (a member template
269 declaration) is finished. Returns the TEMPLATE_DECL corresponding
270 to DECL, unless it is a specialization, in which case the DECL
271 itself is returned. */
274 finish_member_template_decl (tree decl
)
276 if (decl
== error_mark_node
)
277 return error_mark_node
;
279 gcc_assert (DECL_P (decl
));
281 if (TREE_CODE (decl
) == TYPE_DECL
)
285 type
= TREE_TYPE (decl
);
286 if (type
== error_mark_node
)
287 return error_mark_node
;
288 if (MAYBE_CLASS_TYPE_P (type
)
289 && CLASSTYPE_TEMPLATE_INFO (type
)
290 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
292 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
293 check_member_template (tmpl
);
298 else if (TREE_CODE (decl
) == FIELD_DECL
)
299 error ("data member %qD cannot be a member template", decl
);
300 else if (DECL_TEMPLATE_INFO (decl
))
302 if (!DECL_TEMPLATE_SPECIALIZATION (decl
))
304 check_member_template (DECL_TI_TEMPLATE (decl
));
305 return DECL_TI_TEMPLATE (decl
);
311 error ("invalid member template declaration %qD", decl
);
313 return error_mark_node
;
316 /* Create a template info node. */
319 build_template_info (tree template_decl
, tree template_args
)
321 tree result
= make_node (TEMPLATE_INFO
);
322 TI_TEMPLATE (result
) = template_decl
;
323 TI_ARGS (result
) = template_args
;
327 /* Return the template info node corresponding to T, whatever T is. */
330 get_template_info (const_tree t
)
332 tree tinfo
= NULL_TREE
;
334 if (!t
|| t
== error_mark_node
)
337 if (TREE_CODE (t
) == NAMESPACE_DECL
)
340 if (DECL_P (t
) && DECL_LANG_SPECIFIC (t
))
341 tinfo
= DECL_TEMPLATE_INFO (t
);
343 if (!tinfo
&& DECL_IMPLICIT_TYPEDEF_P (t
))
346 if (OVERLOAD_TYPE_P (t
))
347 tinfo
= TYPE_TEMPLATE_INFO (t
);
348 else if (TREE_CODE (t
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
349 tinfo
= TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t
);
354 /* Returns the template nesting level of the indicated class TYPE.
364 A<T>::B<U> has depth two, while A<T> has depth one.
365 Both A<T>::B<int> and A<int>::B<U> have depth one, if
366 they are instantiations, not specializations.
368 This function is guaranteed to return 0 if passed NULL_TREE so
369 that, for example, `template_class_depth (current_class_type)' is
373 template_class_depth (tree type
)
378 type
&& TREE_CODE (type
) != NAMESPACE_DECL
;
379 type
= (TREE_CODE (type
) == FUNCTION_DECL
)
380 ? CP_DECL_CONTEXT (type
) : CP_TYPE_CONTEXT (type
))
382 tree tinfo
= get_template_info (type
);
384 if (tinfo
&& PRIMARY_TEMPLATE_P (TI_TEMPLATE (tinfo
))
385 && uses_template_parms (INNERMOST_TEMPLATE_ARGS (TI_ARGS (tinfo
))))
392 /* Subroutine of maybe_begin_member_template_processing.
393 Returns true if processing DECL needs us to push template parms. */
396 inline_needs_template_parms (tree decl
, bool nsdmi
)
398 if (!decl
|| (!nsdmi
&& ! DECL_TEMPLATE_INFO (decl
)))
401 return (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (most_general_template (decl
)))
402 > (processing_template_decl
+ DECL_TEMPLATE_SPECIALIZATION (decl
)));
405 /* Subroutine of maybe_begin_member_template_processing.
406 Push the template parms in PARMS, starting from LEVELS steps into the
407 chain, and ending at the beginning, since template parms are listed
411 push_inline_template_parms_recursive (tree parmlist
, int levels
)
413 tree parms
= TREE_VALUE (parmlist
);
417 push_inline_template_parms_recursive (TREE_CHAIN (parmlist
), levels
- 1);
419 ++processing_template_decl
;
420 current_template_parms
421 = tree_cons (size_int (processing_template_decl
),
422 parms
, current_template_parms
);
423 TEMPLATE_PARMS_FOR_INLINE (current_template_parms
) = 1;
425 begin_scope (TREE_VEC_LENGTH (parms
) ? sk_template_parms
: sk_template_spec
,
427 for (i
= 0; i
< TREE_VEC_LENGTH (parms
); ++i
)
429 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
431 if (error_operand_p (parm
))
434 gcc_assert (DECL_P (parm
));
436 switch (TREE_CODE (parm
))
445 /* Make a CONST_DECL as is done in process_template_parm.
446 It is ugly that we recreate this here; the original
447 version built in process_template_parm is no longer
449 tree decl
= build_decl (DECL_SOURCE_LOCATION (parm
),
450 CONST_DECL
, DECL_NAME (parm
),
452 DECL_ARTIFICIAL (decl
) = 1;
453 TREE_CONSTANT (decl
) = 1;
454 TREE_READONLY (decl
) = 1;
455 DECL_INITIAL (decl
) = DECL_INITIAL (parm
);
456 SET_DECL_TEMPLATE_PARM_P (decl
);
467 /* Restore the template parameter context for a member template, a
468 friend template defined in a class definition, or a non-template
469 member of template class. */
472 maybe_begin_member_template_processing (tree decl
)
476 bool nsdmi
= TREE_CODE (decl
) == FIELD_DECL
;
480 tree ctx
= DECL_CONTEXT (decl
);
481 decl
= (CLASSTYPE_TEMPLATE_INFO (ctx
)
482 /* Disregard full specializations (c++/60999). */
483 && uses_template_parms (ctx
)
484 ? CLASSTYPE_TI_TEMPLATE (ctx
) : NULL_TREE
);
487 if (inline_needs_template_parms (decl
, nsdmi
))
489 parms
= DECL_TEMPLATE_PARMS (most_general_template (decl
));
490 levels
= TMPL_PARMS_DEPTH (parms
) - processing_template_decl
;
492 if (DECL_TEMPLATE_SPECIALIZATION (decl
))
495 parms
= TREE_CHAIN (parms
);
498 push_inline_template_parms_recursive (parms
, levels
);
501 /* Remember how many levels of template parameters we pushed so that
502 we can pop them later. */
503 inline_parm_levels
.safe_push (levels
);
506 /* Undo the effects of maybe_begin_member_template_processing. */
509 maybe_end_member_template_processing (void)
514 if (inline_parm_levels
.length () == 0)
517 last
= inline_parm_levels
.pop ();
518 for (i
= 0; i
< last
; ++i
)
520 --processing_template_decl
;
521 current_template_parms
= TREE_CHAIN (current_template_parms
);
526 /* Return a new template argument vector which contains all of ARGS,
527 but has as its innermost set of arguments the EXTRA_ARGS. */
530 add_to_template_args (tree args
, tree extra_args
)
537 if (args
== NULL_TREE
|| extra_args
== error_mark_node
)
540 extra_depth
= TMPL_ARGS_DEPTH (extra_args
);
541 new_args
= make_tree_vec (TMPL_ARGS_DEPTH (args
) + extra_depth
);
543 for (i
= 1; i
<= TMPL_ARGS_DEPTH (args
); ++i
)
544 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (args
, i
));
546 for (j
= 1; j
<= extra_depth
; ++j
, ++i
)
547 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (extra_args
, j
));
552 /* Like add_to_template_args, but only the outermost ARGS are added to
553 the EXTRA_ARGS. In particular, all but TMPL_ARGS_DEPTH
554 (EXTRA_ARGS) levels are added. This function is used to combine
555 the template arguments from a partial instantiation with the
556 template arguments used to attain the full instantiation from the
557 partial instantiation. */
560 add_outermost_template_args (tree args
, tree extra_args
)
564 /* If there are more levels of EXTRA_ARGS than there are ARGS,
565 something very fishy is going on. */
566 gcc_assert (TMPL_ARGS_DEPTH (args
) >= TMPL_ARGS_DEPTH (extra_args
));
568 /* If *all* the new arguments will be the EXTRA_ARGS, just return
570 if (TMPL_ARGS_DEPTH (args
) == TMPL_ARGS_DEPTH (extra_args
))
573 /* For the moment, we make ARGS look like it contains fewer levels. */
574 TREE_VEC_LENGTH (args
) -= TMPL_ARGS_DEPTH (extra_args
);
576 new_args
= add_to_template_args (args
, extra_args
);
578 /* Now, we restore ARGS to its full dimensions. */
579 TREE_VEC_LENGTH (args
) += TMPL_ARGS_DEPTH (extra_args
);
584 /* Return the N levels of innermost template arguments from the ARGS. */
587 get_innermost_template_args (tree args
, int n
)
595 /* If N is 1, just return the innermost set of template arguments. */
597 return TMPL_ARGS_LEVEL (args
, TMPL_ARGS_DEPTH (args
));
599 /* If we're not removing anything, just return the arguments we were
601 extra_levels
= TMPL_ARGS_DEPTH (args
) - n
;
602 gcc_assert (extra_levels
>= 0);
603 if (extra_levels
== 0)
606 /* Make a new set of arguments, not containing the outer arguments. */
607 new_args
= make_tree_vec (n
);
608 for (i
= 1; i
<= n
; ++i
)
609 SET_TMPL_ARGS_LEVEL (new_args
, i
,
610 TMPL_ARGS_LEVEL (args
, i
+ extra_levels
));
615 /* The inverse of get_innermost_template_args: Return all but the innermost
616 EXTRA_LEVELS levels of template arguments from the ARGS. */
619 strip_innermost_template_args (tree args
, int extra_levels
)
622 int n
= TMPL_ARGS_DEPTH (args
) - extra_levels
;
627 /* If N is 1, just return the outermost set of template arguments. */
629 return TMPL_ARGS_LEVEL (args
, 1);
631 /* If we're not removing anything, just return the arguments we were
633 gcc_assert (extra_levels
>= 0);
634 if (extra_levels
== 0)
637 /* Make a new set of arguments, not containing the inner arguments. */
638 new_args
= make_tree_vec (n
);
639 for (i
= 1; i
<= n
; ++i
)
640 SET_TMPL_ARGS_LEVEL (new_args
, i
,
641 TMPL_ARGS_LEVEL (args
, i
));
646 /* We've got a template header coming up; push to a new level for storing
650 begin_template_parm_list (void)
652 /* We use a non-tag-transparent scope here, which causes pushtag to
653 put tags in this scope, rather than in the enclosing class or
654 namespace scope. This is the right thing, since we want
655 TEMPLATE_DECLS, and not TYPE_DECLS for template classes. For a
656 global template class, push_template_decl handles putting the
657 TEMPLATE_DECL into top-level scope. For a nested template class,
660 template <class T> struct S1 {
661 template <class T> struct S2 {};
664 pushtag contains special code to call pushdecl_with_scope on the
665 TEMPLATE_DECL for S2. */
666 begin_scope (sk_template_parms
, NULL
);
667 ++processing_template_decl
;
668 ++processing_template_parmlist
;
669 note_template_header (0);
671 /* Add a dummy parameter level while we process the parameter list. */
672 current_template_parms
673 = tree_cons (size_int (processing_template_decl
),
675 current_template_parms
);
678 /* This routine is called when a specialization is declared. If it is
679 invalid to declare a specialization here, an error is reported and
680 false is returned, otherwise this routine will return true. */
683 check_specialization_scope (void)
685 tree scope
= current_scope ();
689 An explicit specialization shall be declared in the namespace of
690 which the template is a member, or, for member templates, in the
691 namespace of which the enclosing class or enclosing class
692 template is a member. An explicit specialization of a member
693 function, member class or static data member of a class template
694 shall be declared in the namespace of which the class template
696 if (scope
&& TREE_CODE (scope
) != NAMESPACE_DECL
)
698 error ("explicit specialization in non-namespace scope %qD", scope
);
704 In an explicit specialization declaration for a member of a class
705 template or a member template that appears in namespace scope,
706 the member template and some of its enclosing class templates may
707 remain unspecialized, except that the declaration shall not
708 explicitly specialize a class member template if its enclosing
709 class templates are not explicitly specialized as well. */
710 if (current_template_parms
)
712 error ("enclosing class templates are not explicitly specialized");
719 /* We've just seen template <>. */
722 begin_specialization (void)
724 begin_scope (sk_template_spec
, NULL
);
725 note_template_header (1);
726 return check_specialization_scope ();
729 /* Called at then end of processing a declaration preceded by
733 end_specialization (void)
736 reset_specialization ();
739 /* Any template <>'s that we have seen thus far are not referring to a
740 function specialization. */
743 reset_specialization (void)
745 processing_specialization
= 0;
746 template_header_count
= 0;
749 /* We've just seen a template header. If SPECIALIZATION is nonzero,
750 it was of the form template <>. */
753 note_template_header (int specialization
)
755 processing_specialization
= specialization
;
756 template_header_count
++;
759 /* We're beginning an explicit instantiation. */
762 begin_explicit_instantiation (void)
764 gcc_assert (!processing_explicit_instantiation
);
765 processing_explicit_instantiation
= true;
770 end_explicit_instantiation (void)
772 gcc_assert (processing_explicit_instantiation
);
773 processing_explicit_instantiation
= false;
776 /* An explicit specialization or partial specialization of TMPL is being
777 declared. Check that the namespace in which the specialization is
778 occurring is permissible. Returns false iff it is invalid to
779 specialize TMPL in the current namespace. */
782 check_specialization_namespace (tree tmpl
)
784 tree tpl_ns
= decl_namespace_context (tmpl
);
788 An explicit specialization shall be declared in the namespace of
789 which the template is a member, or, for member templates, in the
790 namespace of which the enclosing class or enclosing class
791 template is a member. An explicit specialization of a member
792 function, member class or static data member of a class template
793 shall be declared in the namespace of which the class template is
795 if (current_scope() != DECL_CONTEXT (tmpl
)
796 && !at_namespace_scope_p ())
798 error ("specialization of %qD must appear at namespace scope", tmpl
);
801 if (is_associated_namespace (current_namespace
, tpl_ns
))
802 /* Same or super-using namespace. */
806 permerror (input_location
,
807 "specialization of %qD in different namespace", tmpl
);
808 permerror (DECL_SOURCE_LOCATION (tmpl
),
809 " from definition of %q#D", tmpl
);
814 /* SPEC is an explicit instantiation. Check that it is valid to
815 perform this explicit instantiation in the current namespace. */
818 check_explicit_instantiation_namespace (tree spec
)
822 /* DR 275: An explicit instantiation shall appear in an enclosing
823 namespace of its template. */
824 ns
= decl_namespace_context (spec
);
825 if (!is_ancestor (current_namespace
, ns
))
826 permerror (input_location
, "explicit instantiation of %qD in namespace %qD "
827 "(which does not enclose namespace %qD)",
828 spec
, current_namespace
, ns
);
831 // Returns the type of a template specialization only if that
832 // specialization needs to be defined. Otherwise (e.g., if the type has
833 // already been defined), the function returns NULL_TREE.
835 maybe_new_partial_specialization (tree type
)
837 // An implicit instantiation of an incomplete type implies
838 // the definition of a new class template.
840 // template<typename T>
843 // template<typename T>
846 // Here, S<T*> is an implicit instantiation of S whose type
848 if (CLASSTYPE_IMPLICIT_INSTANTIATION (type
) && !COMPLETE_TYPE_P (type
))
851 // It can also be the case that TYPE is a completed specialization.
852 // Continuing the previous example, suppose we also declare:
854 // template<typename T>
855 // requires Integral<T>
858 // Here, S<T*> refers to the specialization S<T*> defined
859 // above. However, we need to differentiate definitions because
860 // we intend to define a new partial specialization. In this case,
861 // we rely on the fact that the constraints are different for
862 // this declaration than that above.
864 // Note that we also get here for injected class names and
865 // late-parsed template definitions. We must ensure that we
866 // do not create new type declarations for those cases.
867 if (flag_concepts
&& CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
869 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
870 tree args
= CLASSTYPE_TI_ARGS (type
);
872 // If there are no template parameters, this cannot be a new
873 // partial template specializtion?
874 if (!current_template_parms
)
877 // If the constraints are not the same as those of the primary
878 // then, we can probably create a new specialization.
879 tree type_constr
= current_template_constraints ();
881 if (type
== TREE_TYPE (tmpl
))
882 if (tree main_constr
= get_constraints (tmpl
))
883 if (equivalent_constraints (type_constr
, main_constr
))
886 // Also, if there's a pre-existing specialization with matching
887 // constraints, then this also isn't new.
888 tree specs
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
891 tree spec_tmpl
= TREE_VALUE (specs
);
892 tree spec_args
= TREE_PURPOSE (specs
);
893 tree spec_constr
= get_constraints (spec_tmpl
);
894 if (comp_template_args (args
, spec_args
)
895 && equivalent_constraints (type_constr
, spec_constr
))
897 specs
= TREE_CHAIN (specs
);
900 // Create a new type node (and corresponding type decl)
901 // for the newly declared specialization.
902 tree t
= make_class_type (TREE_CODE (type
));
903 CLASSTYPE_DECLARED_CLASS (t
) = CLASSTYPE_DECLARED_CLASS (type
);
904 TYPE_FOR_JAVA (t
) = TYPE_FOR_JAVA (type
);
905 SET_TYPE_TEMPLATE_INFO (t
, build_template_info (tmpl
, args
));
907 /* We only need a separate type node for storing the definition of this
908 partial specialization; uses of S<T*> are unconstrained, so all are
909 equivalent. So keep TYPE_CANONICAL the same. */
910 TYPE_CANONICAL (t
) = TYPE_CANONICAL (type
);
912 // Build the corresponding type decl.
913 tree d
= create_implicit_typedef (DECL_NAME (tmpl
), t
);
914 DECL_CONTEXT (d
) = TYPE_CONTEXT (t
);
915 DECL_SOURCE_LOCATION (d
) = input_location
;
923 /* The TYPE is being declared. If it is a template type, that means it
924 is a partial specialization. Do appropriate error-checking. */
927 maybe_process_partial_specialization (tree type
)
931 if (type
== error_mark_node
)
932 return error_mark_node
;
934 /* A lambda that appears in specialization context is not itself a
936 if (CLASS_TYPE_P (type
) && CLASSTYPE_LAMBDA_EXPR (type
))
939 if (TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
941 error ("name of class shadows template template parameter %qD",
943 return error_mark_node
;
946 context
= TYPE_CONTEXT (type
);
948 if (TYPE_ALIAS_P (type
))
950 if (TYPE_TEMPLATE_INFO (type
)
951 && DECL_ALIAS_TEMPLATE_P (TYPE_TI_TEMPLATE (type
)))
952 error ("specialization of alias template %qD",
953 TYPE_TI_TEMPLATE (type
));
955 error ("explicit specialization of non-template %qT", type
);
956 return error_mark_node
;
958 else if (CLASS_TYPE_P (type
) && CLASSTYPE_USE_TEMPLATE (type
))
960 /* This is for ordinary explicit specialization and partial
961 specialization of a template class such as:
963 template <> class C<int>;
967 template <class T> class C<T*>;
969 Make sure that `C<int>' and `C<T*>' are implicit instantiations. */
971 if (tree t
= maybe_new_partial_specialization (type
))
973 if (!check_specialization_namespace (CLASSTYPE_TI_TEMPLATE (t
))
974 && !at_namespace_scope_p ())
975 return error_mark_node
;
976 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (t
);
977 DECL_SOURCE_LOCATION (TYPE_MAIN_DECL (t
)) = input_location
;
978 if (processing_template_decl
)
980 tree decl
= push_template_decl (TYPE_MAIN_DECL (t
));
981 if (decl
== error_mark_node
)
982 return error_mark_node
;
983 return TREE_TYPE (decl
);
986 else if (CLASSTYPE_TEMPLATE_INSTANTIATION (type
))
987 error ("specialization of %qT after instantiation", type
);
988 else if (errorcount
&& !processing_specialization
989 && CLASSTYPE_TEMPLATE_SPECIALIZATION (type
)
990 && !uses_template_parms (CLASSTYPE_TI_ARGS (type
)))
991 /* Trying to define a specialization either without a template<> header
992 or in an inappropriate place. We've already given an error, so just
993 bail now so we don't actually define the specialization. */
994 return error_mark_node
;
996 else if (CLASS_TYPE_P (type
)
997 && !CLASSTYPE_USE_TEMPLATE (type
)
998 && CLASSTYPE_TEMPLATE_INFO (type
)
999 && context
&& CLASS_TYPE_P (context
)
1000 && CLASSTYPE_TEMPLATE_INFO (context
))
1002 /* This is for an explicit specialization of member class
1003 template according to [temp.expl.spec/18]:
1005 template <> template <class U> class C<int>::D;
1007 The context `C<int>' must be an implicit instantiation.
1008 Otherwise this is just a member class template declared
1011 template <> class C<int> { template <class U> class D; };
1012 template <> template <class U> class C<int>::D;
1014 In the first case, `C<int>::D' is a specialization of `C<T>::D'
1015 while in the second case, `C<int>::D' is a primary template
1016 and `C<T>::D' may not exist. */
1018 if (CLASSTYPE_IMPLICIT_INSTANTIATION (context
)
1019 && !COMPLETE_TYPE_P (type
))
1022 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
1024 if (current_namespace
1025 != decl_namespace_context (tmpl
))
1027 permerror (input_location
,
1028 "specializing %q#T in different namespace", type
);
1029 permerror (DECL_SOURCE_LOCATION (tmpl
),
1030 " from definition of %q#D", tmpl
);
1033 /* Check for invalid specialization after instantiation:
1035 template <> template <> class C<int>::D<int>;
1036 template <> template <class U> class C<int>::D; */
1038 for (t
= DECL_TEMPLATE_INSTANTIATIONS (tmpl
);
1039 t
; t
= TREE_CHAIN (t
))
1041 tree inst
= TREE_VALUE (t
);
1042 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (inst
)
1043 || !COMPLETE_OR_OPEN_TYPE_P (inst
))
1045 /* We already have a full specialization of this partial
1046 instantiation, or a full specialization has been
1047 looked up but not instantiated. Reassign it to the
1048 new member specialization template. */
1052 elt
.tmpl
= most_general_template (tmpl
);
1053 elt
.args
= CLASSTYPE_TI_ARGS (inst
);
1056 type_specializations
->remove_elt (&elt
);
1059 elt
.args
= INNERMOST_TEMPLATE_ARGS (elt
.args
);
1062 = type_specializations
->find_slot (&elt
, INSERT
);
1063 entry
= ggc_alloc
<spec_entry
> ();
1068 /* But if we've had an implicit instantiation, that's a
1069 problem ([temp.expl.spec]/6). */
1070 error ("specialization %qT after instantiation %qT",
1074 /* Mark TYPE as a specialization. And as a result, we only
1075 have one level of template argument for the innermost
1077 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type
);
1078 DECL_SOURCE_LOCATION (TYPE_MAIN_DECL (type
)) = input_location
;
1079 CLASSTYPE_TI_ARGS (type
)
1080 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type
));
1083 else if (processing_specialization
)
1085 /* Someday C++0x may allow for enum template specialization. */
1086 if (cxx_dialect
> cxx98
&& TREE_CODE (type
) == ENUMERAL_TYPE
1087 && CLASS_TYPE_P (context
) && CLASSTYPE_USE_TEMPLATE (context
))
1088 pedwarn (input_location
, OPT_Wpedantic
, "template specialization "
1089 "of %qD not allowed by ISO C++", type
);
1092 error ("explicit specialization of non-template %qT", type
);
1093 return error_mark_node
;
1100 /* Returns nonzero if we can optimize the retrieval of specializations
1101 for TMPL, a TEMPLATE_DECL. In particular, for such a template, we
1102 do not use DECL_TEMPLATE_SPECIALIZATIONS at all. */
1105 optimize_specialization_lookup_p (tree tmpl
)
1107 return (DECL_FUNCTION_TEMPLATE_P (tmpl
)
1108 && DECL_CLASS_SCOPE_P (tmpl
)
1109 /* DECL_CLASS_SCOPE_P holds of T::f even if T is a template
1111 && CLASS_TYPE_P (DECL_CONTEXT (tmpl
))
1112 /* The optimized lookup depends on the fact that the
1113 template arguments for the member function template apply
1114 purely to the containing class, which is not true if the
1115 containing class is an explicit or partial
1117 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (tmpl
))
1118 && !DECL_MEMBER_TEMPLATE_P (tmpl
)
1119 && !DECL_CONV_FN_P (tmpl
)
1120 /* It is possible to have a template that is not a member
1121 template and is not a member of a template class:
1123 template <typename T>
1124 struct S { friend A::f(); };
1126 Here, the friend function is a template, but the context does
1127 not have template information. The optimized lookup relies
1128 on having ARGS be the template arguments for both the class
1129 and the function template. */
1130 && !DECL_FRIEND_P (DECL_TEMPLATE_RESULT (tmpl
)));
1133 /* Make sure ARGS doesn't use any inappropriate typedefs; we should have
1134 gone through coerce_template_parms by now. */
1137 check_unstripped_args (tree args ATTRIBUTE_UNUSED
)
1139 #ifdef ENABLE_CHECKING
1140 ++processing_template_decl
;
1141 if (!any_dependent_template_arguments_p (args
))
1143 tree inner
= INNERMOST_TEMPLATE_ARGS (args
);
1144 for (int i
= 0; i
< TREE_VEC_LENGTH (inner
); ++i
)
1146 tree arg
= TREE_VEC_ELT (inner
, i
);
1147 if (TREE_CODE (arg
) == TEMPLATE_DECL
)
1149 else if (TYPE_P (arg
))
1150 gcc_assert (strip_typedefs (arg
, NULL
) == arg
);
1151 else if (strip_typedefs (TREE_TYPE (arg
), NULL
) != TREE_TYPE (arg
))
1152 /* Allow typedefs on the type of a non-type argument, since a
1153 parameter can have them. */;
1155 gcc_assert (strip_typedefs_expr (arg
, NULL
) == arg
);
1158 --processing_template_decl
;
1162 /* Retrieve the specialization (in the sense of [temp.spec] - a
1163 specialization is either an instantiation or an explicit
1164 specialization) of TMPL for the given template ARGS. If there is
1165 no such specialization, return NULL_TREE. The ARGS are a vector of
1166 arguments, or a vector of vectors of arguments, in the case of
1167 templates with more than one level of parameters.
1169 If TMPL is a type template and CLASS_SPECIALIZATIONS_P is true,
1170 then we search for a partial specialization matching ARGS. This
1171 parameter is ignored if TMPL is not a class template.
1173 We can also look up a FIELD_DECL, if it is a lambda capture pack; the
1174 result is a NONTYPE_ARGUMENT_PACK. */
1177 retrieve_specialization (tree tmpl
, tree args
, hashval_t hash
)
1179 if (tmpl
== NULL_TREE
)
1182 if (args
== error_mark_node
)
1185 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
1186 || TREE_CODE (tmpl
) == FIELD_DECL
);
1188 /* There should be as many levels of arguments as there are
1189 levels of parameters. */
1190 gcc_assert (TMPL_ARGS_DEPTH (args
)
1191 == (TREE_CODE (tmpl
) == TEMPLATE_DECL
1192 ? TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
))
1193 : template_class_depth (DECL_CONTEXT (tmpl
))));
1195 check_unstripped_args (args
);
1197 if (optimize_specialization_lookup_p (tmpl
))
1199 tree class_template
;
1200 tree class_specialization
;
1201 vec
<tree
, va_gc
> *methods
;
1205 /* The template arguments actually apply to the containing
1206 class. Find the class specialization with those
1208 class_template
= CLASSTYPE_TI_TEMPLATE (DECL_CONTEXT (tmpl
));
1209 class_specialization
1210 = retrieve_specialization (class_template
, args
, 0);
1211 if (!class_specialization
)
1213 /* Now, find the appropriate entry in the CLASSTYPE_METHOD_VEC
1214 for the specialization. */
1215 idx
= class_method_index_for_fn (class_specialization
, tmpl
);
1218 /* Iterate through the methods with the indicated name, looking
1219 for the one that has an instance of TMPL. */
1220 methods
= CLASSTYPE_METHOD_VEC (class_specialization
);
1221 for (fns
= (*methods
)[idx
]; fns
; fns
= OVL_NEXT (fns
))
1223 tree fn
= OVL_CURRENT (fns
);
1224 if (DECL_TEMPLATE_INFO (fn
) && DECL_TI_TEMPLATE (fn
) == tmpl
1225 /* using-declarations can add base methods to the method vec,
1226 and we don't want those here. */
1227 && DECL_CONTEXT (fn
) == class_specialization
)
1236 hash_table
<spec_hasher
> *specializations
;
1240 elt
.spec
= NULL_TREE
;
1242 if (DECL_CLASS_TEMPLATE_P (tmpl
))
1243 specializations
= type_specializations
;
1245 specializations
= decl_specializations
;
1248 hash
= spec_hasher::hash (&elt
);
1249 found
= specializations
->find_with_hash (&elt
, hash
);
1257 /* Like retrieve_specialization, but for local declarations. */
1260 retrieve_local_specialization (tree tmpl
)
1262 if (local_specializations
== NULL
)
1265 tree
*slot
= local_specializations
->get (tmpl
);
1266 return slot
? *slot
: NULL_TREE
;
1269 /* Returns nonzero iff DECL is a specialization of TMPL. */
1272 is_specialization_of (tree decl
, tree tmpl
)
1276 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1280 t
= DECL_TEMPLATE_INFO (t
) ? DECL_TI_TEMPLATE (t
) : NULL_TREE
)
1286 gcc_assert (TREE_CODE (decl
) == TYPE_DECL
);
1288 for (t
= TREE_TYPE (decl
);
1290 t
= CLASSTYPE_USE_TEMPLATE (t
)
1291 ? TREE_TYPE (CLASSTYPE_TI_TEMPLATE (t
)) : NULL_TREE
)
1292 if (same_type_ignoring_top_level_qualifiers_p (t
, TREE_TYPE (tmpl
)))
1299 /* Returns nonzero iff DECL is a specialization of friend declaration
1300 FRIEND_DECL according to [temp.friend]. */
1303 is_specialization_of_friend (tree decl
, tree friend_decl
)
1305 bool need_template
= true;
1308 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
1309 || TREE_CODE (decl
) == TYPE_DECL
);
1311 /* For [temp.friend/6] when FRIEND_DECL is an ordinary member function
1312 of a template class, we want to check if DECL is a specialization
1314 if (TREE_CODE (friend_decl
) == FUNCTION_DECL
1315 && DECL_TEMPLATE_INFO (friend_decl
)
1316 && !DECL_USE_TEMPLATE (friend_decl
))
1318 /* We want a TEMPLATE_DECL for `is_specialization_of'. */
1319 friend_decl
= DECL_TI_TEMPLATE (friend_decl
);
1320 need_template
= false;
1322 else if (TREE_CODE (friend_decl
) == TEMPLATE_DECL
1323 && !PRIMARY_TEMPLATE_P (friend_decl
))
1324 need_template
= false;
1326 /* There is nothing to do if this is not a template friend. */
1327 if (TREE_CODE (friend_decl
) != TEMPLATE_DECL
)
1330 if (is_specialization_of (decl
, friend_decl
))
1334 A member of a class template may be declared to be a friend of a
1335 non-template class. In this case, the corresponding member of
1336 every specialization of the class template is a friend of the
1337 class granting friendship.
1339 For example, given a template friend declaration
1341 template <class T> friend void A<T>::f();
1343 the member function below is considered a friend
1345 template <> struct A<int> {
1349 For this type of template friend, TEMPLATE_DEPTH below will be
1350 nonzero. To determine if DECL is a friend of FRIEND, we first
1351 check if the enclosing class is a specialization of another. */
1353 template_depth
= template_class_depth (CP_DECL_CONTEXT (friend_decl
));
1355 && DECL_CLASS_SCOPE_P (decl
)
1356 && is_specialization_of (TYPE_NAME (DECL_CONTEXT (decl
)),
1357 CLASSTYPE_TI_TEMPLATE (DECL_CONTEXT (friend_decl
))))
1359 /* Next, we check the members themselves. In order to handle
1360 a few tricky cases, such as when FRIEND_DECL's are
1362 template <class T> friend void A<T>::g(T t);
1363 template <class T> template <T t> friend void A<T>::h();
1367 void A<int>::g(int);
1368 template <int> void A<int>::h();
1370 we need to figure out ARGS, the template arguments from
1371 the context of DECL. This is required for template substitution
1372 of `T' in the function parameter of `g' and template parameter
1373 of `h' in the above examples. Here ARGS corresponds to `int'. */
1375 tree context
= DECL_CONTEXT (decl
);
1376 tree args
= NULL_TREE
;
1377 int current_depth
= 0;
1379 while (current_depth
< template_depth
)
1381 if (CLASSTYPE_TEMPLATE_INFO (context
))
1383 if (current_depth
== 0)
1384 args
= TYPE_TI_ARGS (context
);
1386 args
= add_to_template_args (TYPE_TI_ARGS (context
), args
);
1389 context
= TYPE_CONTEXT (context
);
1392 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1397 tree friend_args_type
;
1398 tree decl_args_type
;
1400 /* Make sure that both DECL and FRIEND_DECL are templates or
1402 is_template
= DECL_TEMPLATE_INFO (decl
)
1403 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl
));
1404 if (need_template
^ is_template
)
1406 else if (is_template
)
1408 /* If both are templates, check template parameter list. */
1410 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_decl
),
1412 if (!comp_template_parms
1413 (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (decl
)),
1417 decl_type
= TREE_TYPE (DECL_TI_TEMPLATE (decl
));
1420 decl_type
= TREE_TYPE (decl
);
1422 friend_type
= tsubst_function_type (TREE_TYPE (friend_decl
), args
,
1423 tf_none
, NULL_TREE
);
1424 if (friend_type
== error_mark_node
)
1427 /* Check if return types match. */
1428 if (!same_type_p (TREE_TYPE (decl_type
), TREE_TYPE (friend_type
)))
1431 /* Check if function parameter types match, ignoring the
1432 `this' parameter. */
1433 friend_args_type
= TYPE_ARG_TYPES (friend_type
);
1434 decl_args_type
= TYPE_ARG_TYPES (decl_type
);
1435 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (friend_decl
))
1436 friend_args_type
= TREE_CHAIN (friend_args_type
);
1437 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1438 decl_args_type
= TREE_CHAIN (decl_args_type
);
1440 return compparms (decl_args_type
, friend_args_type
);
1444 /* DECL is a TYPE_DECL */
1446 tree decl_type
= TREE_TYPE (decl
);
1448 /* Make sure that both DECL and FRIEND_DECL are templates or
1451 = CLASSTYPE_TEMPLATE_INFO (decl_type
)
1452 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (decl_type
));
1454 if (need_template
^ is_template
)
1456 else if (is_template
)
1459 /* If both are templates, check the name of the two
1460 TEMPLATE_DECL's first because is_friend didn't. */
1461 if (DECL_NAME (CLASSTYPE_TI_TEMPLATE (decl_type
))
1462 != DECL_NAME (friend_decl
))
1465 /* Now check template parameter list. */
1467 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_decl
),
1469 return comp_template_parms
1470 (DECL_TEMPLATE_PARMS (CLASSTYPE_TI_TEMPLATE (decl_type
)),
1474 return (DECL_NAME (decl
)
1475 == DECL_NAME (friend_decl
));
1481 /* Register the specialization SPEC as a specialization of TMPL with
1482 the indicated ARGS. IS_FRIEND indicates whether the specialization
1483 is actually just a friend declaration. Returns SPEC, or an
1484 equivalent prior declaration, if available.
1486 We also store instantiations of field packs in the hash table, even
1487 though they are not themselves templates, to make lookup easier. */
1490 register_specialization (tree spec
, tree tmpl
, tree args
, bool is_friend
,
1494 spec_entry
**slot
= NULL
;
1497 gcc_assert ((TREE_CODE (tmpl
) == TEMPLATE_DECL
&& DECL_P (spec
))
1498 || (TREE_CODE (tmpl
) == FIELD_DECL
1499 && TREE_CODE (spec
) == NONTYPE_ARGUMENT_PACK
));
1501 if (TREE_CODE (spec
) == FUNCTION_DECL
1502 && uses_template_parms (DECL_TI_ARGS (spec
)))
1503 /* This is the FUNCTION_DECL for a partial instantiation. Don't
1504 register it; we want the corresponding TEMPLATE_DECL instead.
1505 We use `uses_template_parms (DECL_TI_ARGS (spec))' rather than
1506 the more obvious `uses_template_parms (spec)' to avoid problems
1507 with default function arguments. In particular, given
1508 something like this:
1510 template <class T> void f(T t1, T t = T())
1512 the default argument expression is not substituted for in an
1513 instantiation unless and until it is actually needed. */
1516 if (optimize_specialization_lookup_p (tmpl
))
1517 /* We don't put these specializations in the hash table, but we might
1518 want to give an error about a mismatch. */
1519 fn
= retrieve_specialization (tmpl
, args
, 0);
1527 hash
= spec_hasher::hash (&elt
);
1530 decl_specializations
->find_slot_with_hash (&elt
, hash
, INSERT
);
1532 fn
= ((spec_entry
*) *slot
)->spec
;
1537 /* We can sometimes try to re-register a specialization that we've
1538 already got. In particular, regenerate_decl_from_template calls
1539 duplicate_decls which will update the specialization list. But,
1540 we'll still get called again here anyhow. It's more convenient
1541 to simply allow this than to try to prevent it. */
1544 else if (fn
&& DECL_TEMPLATE_SPECIALIZATION (spec
))
1546 if (DECL_TEMPLATE_INSTANTIATION (fn
))
1548 if (DECL_ODR_USED (fn
)
1549 || DECL_EXPLICIT_INSTANTIATION (fn
))
1551 error ("specialization of %qD after instantiation",
1553 return error_mark_node
;
1558 /* This situation should occur only if the first
1559 specialization is an implicit instantiation, the
1560 second is an explicit specialization, and the
1561 implicit instantiation has not yet been used. That
1562 situation can occur if we have implicitly
1563 instantiated a member function and then specialized
1566 We can also wind up here if a friend declaration that
1567 looked like an instantiation turns out to be a
1570 template <class T> void foo(T);
1571 class S { friend void foo<>(int) };
1572 template <> void foo(int);
1574 We transform the existing DECL in place so that any
1575 pointers to it become pointers to the updated
1578 If there was a definition for the template, but not
1579 for the specialization, we want this to look as if
1580 there were no definition, and vice versa. */
1581 DECL_INITIAL (fn
) = NULL_TREE
;
1582 duplicate_decls (spec
, fn
, is_friend
);
1583 /* The call to duplicate_decls will have applied
1586 An explicit specialization of a function template
1587 is inline only if it is explicitly declared to be,
1588 and independently of whether its function template
1591 to the primary function; now copy the inline bits to
1592 the various clones. */
1593 FOR_EACH_CLONE (clone
, fn
)
1595 DECL_DECLARED_INLINE_P (clone
)
1596 = DECL_DECLARED_INLINE_P (fn
);
1597 DECL_SOURCE_LOCATION (clone
)
1598 = DECL_SOURCE_LOCATION (fn
);
1599 DECL_DELETED_FN (clone
)
1600 = DECL_DELETED_FN (fn
);
1602 check_specialization_namespace (tmpl
);
1607 else if (DECL_TEMPLATE_SPECIALIZATION (fn
))
1609 if (!duplicate_decls (spec
, fn
, is_friend
) && DECL_INITIAL (spec
))
1610 /* Dup decl failed, but this is a new definition. Set the
1611 line number so any errors match this new
1613 DECL_SOURCE_LOCATION (fn
) = DECL_SOURCE_LOCATION (spec
);
1619 return duplicate_decls (spec
, fn
, is_friend
);
1621 /* A specialization must be declared in the same namespace as the
1622 template it is specializing. */
1623 if (DECL_P (spec
) && DECL_TEMPLATE_SPECIALIZATION (spec
)
1624 && !check_specialization_namespace (tmpl
))
1625 DECL_CONTEXT (spec
) = DECL_CONTEXT (tmpl
);
1627 if (slot
!= NULL
/* !optimize_specialization_lookup_p (tmpl) */)
1629 spec_entry
*entry
= ggc_alloc
<spec_entry
> ();
1630 gcc_assert (tmpl
&& args
&& spec
);
1633 if ((TREE_CODE (spec
) == FUNCTION_DECL
&& DECL_NAMESPACE_SCOPE_P (spec
)
1634 && PRIMARY_TEMPLATE_P (tmpl
)
1635 && DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (tmpl
)) == NULL_TREE
)
1636 || variable_template_p (tmpl
))
1637 /* If TMPL is a forward declaration of a template function, keep a list
1638 of all specializations in case we need to reassign them to a friend
1639 template later in tsubst_friend_function.
1641 Also keep a list of all variable template instantiations so that
1642 process_partial_specialization can check whether a later partial
1643 specialization would have used it. */
1644 DECL_TEMPLATE_INSTANTIATIONS (tmpl
)
1645 = tree_cons (args
, spec
, DECL_TEMPLATE_INSTANTIATIONS (tmpl
));
1651 /* Returns true iff two spec_entry nodes are equivalent. */
1653 int comparing_specializations
;
1656 spec_hasher::equal (spec_entry
*e1
, spec_entry
*e2
)
1660 ++comparing_specializations
;
1661 equal
= (e1
->tmpl
== e2
->tmpl
1662 && comp_template_args (e1
->args
, e2
->args
));
1663 if (equal
&& flag_concepts
1664 /* tmpl could be a FIELD_DECL for a capture pack. */
1665 && TREE_CODE (e1
->tmpl
) == TEMPLATE_DECL
1666 && VAR_P (DECL_TEMPLATE_RESULT (e1
->tmpl
))
1667 && uses_template_parms (e1
->args
))
1669 /* Partial specializations of a variable template can be distinguished by
1671 tree c1
= e1
->spec
? get_constraints (e1
->spec
) : NULL_TREE
;
1672 tree c2
= e2
->spec
? get_constraints (e2
->spec
) : NULL_TREE
;
1673 equal
= equivalent_constraints (c1
, c2
);
1675 --comparing_specializations
;
1680 /* Returns a hash for a template TMPL and template arguments ARGS. */
1683 hash_tmpl_and_args (tree tmpl
, tree args
)
1685 hashval_t val
= iterative_hash_object (DECL_UID (tmpl
), 0);
1686 return iterative_hash_template_arg (args
, val
);
1689 /* Returns a hash for a spec_entry node based on the TMPL and ARGS members,
1693 spec_hasher::hash (spec_entry
*e
)
1695 return hash_tmpl_and_args (e
->tmpl
, e
->args
);
1698 /* Recursively calculate a hash value for a template argument ARG, for use
1699 in the hash tables of template specializations. */
1702 iterative_hash_template_arg (tree arg
, hashval_t val
)
1704 unsigned HOST_WIDE_INT i
;
1705 enum tree_code code
;
1708 if (arg
== NULL_TREE
)
1709 return iterative_hash_object (arg
, val
);
1714 if (TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
1715 /* We can get one of these when re-hashing a previous entry in the middle
1716 of substituting into a pack expansion. Just look through it. */
1717 arg
= ARGUMENT_PACK_SELECT_FROM_PACK (arg
);
1719 code
= TREE_CODE (arg
);
1720 tclass
= TREE_CODE_CLASS (code
);
1722 val
= iterative_hash_object (code
, val
);
1729 case IDENTIFIER_NODE
:
1730 return iterative_hash_object (IDENTIFIER_HASH_VALUE (arg
), val
);
1734 int i
, len
= TREE_VEC_LENGTH (arg
);
1735 for (i
= 0; i
< len
; ++i
)
1736 val
= iterative_hash_template_arg (TREE_VEC_ELT (arg
, i
), val
);
1740 case TYPE_PACK_EXPANSION
:
1741 case EXPR_PACK_EXPANSION
:
1742 val
= iterative_hash_template_arg (PACK_EXPANSION_PATTERN (arg
), val
);
1743 return iterative_hash_template_arg (PACK_EXPANSION_EXTRA_ARGS (arg
), val
);
1745 case TYPE_ARGUMENT_PACK
:
1746 case NONTYPE_ARGUMENT_PACK
:
1747 return iterative_hash_template_arg (ARGUMENT_PACK_ARGS (arg
), val
);
1750 for (; arg
; arg
= TREE_CHAIN (arg
))
1751 val
= iterative_hash_template_arg (TREE_VALUE (arg
), val
);
1755 for (; arg
; arg
= OVL_NEXT (arg
))
1756 val
= iterative_hash_template_arg (OVL_CURRENT (arg
), val
);
1762 iterative_hash_template_arg (TREE_TYPE (arg
), val
);
1763 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (arg
), i
, field
, value
)
1765 val
= iterative_hash_template_arg (field
, val
);
1766 val
= iterative_hash_template_arg (value
, val
);
1772 if (!DECL_ARTIFICIAL (arg
))
1774 val
= iterative_hash_object (DECL_PARM_INDEX (arg
), val
);
1775 val
= iterative_hash_object (DECL_PARM_LEVEL (arg
), val
);
1777 return iterative_hash_template_arg (TREE_TYPE (arg
), val
);
1780 return iterative_hash_template_arg (TARGET_EXPR_INITIAL (arg
), val
);
1783 val
= iterative_hash_template_arg (PTRMEM_CST_CLASS (arg
), val
);
1784 return iterative_hash_template_arg (PTRMEM_CST_MEMBER (arg
), val
);
1786 case TEMPLATE_PARM_INDEX
:
1787 val
= iterative_hash_template_arg
1788 (TREE_TYPE (TEMPLATE_PARM_DECL (arg
)), val
);
1789 val
= iterative_hash_object (TEMPLATE_PARM_LEVEL (arg
), val
);
1790 return iterative_hash_object (TEMPLATE_PARM_IDX (arg
), val
);
1793 val
= iterative_hash_object (TRAIT_EXPR_KIND (arg
), val
);
1794 val
= iterative_hash_template_arg (TRAIT_EXPR_TYPE1 (arg
), val
);
1795 return iterative_hash_template_arg (TRAIT_EXPR_TYPE2 (arg
), val
);
1798 val
= iterative_hash_template_arg (BINFO_TYPE (BASELINK_BINFO (arg
)),
1800 return iterative_hash_template_arg (DECL_NAME (get_first_fn (arg
)),
1804 val
= iterative_hash_template_arg (TREE_OPERAND (arg
, 0), val
);
1805 code
= TREE_CODE (TREE_OPERAND (arg
, 1));
1806 val
= iterative_hash_object (code
, val
);
1807 return iterative_hash_template_arg (TREE_OPERAND (arg
, 2), val
);
1810 /* A lambda can't appear in a template arg, but don't crash on
1812 gcc_assert (seen_error ());
1816 case IMPLICIT_CONV_EXPR
:
1817 case STATIC_CAST_EXPR
:
1818 case REINTERPRET_CAST_EXPR
:
1819 case CONST_CAST_EXPR
:
1820 case DYNAMIC_CAST_EXPR
:
1822 val
= iterative_hash_template_arg (TREE_TYPE (arg
), val
);
1823 /* Now hash operands as usual. */
1833 if (alias_template_specialization_p (arg
))
1835 // We want an alias specialization that survived strip_typedefs
1836 // to hash differently from its TYPE_CANONICAL, to avoid hash
1837 // collisions that compare as different in template_args_equal.
1838 // These could be dependent specializations that strip_typedefs
1839 // left alone, or untouched specializations because
1840 // coerce_template_parms returns the unconverted template
1841 // arguments if it sees incomplete argument packs.
1842 tree ti
= TYPE_TEMPLATE_INFO (arg
);
1843 return hash_tmpl_and_args (TI_TEMPLATE (ti
), TI_ARGS (ti
));
1845 if (TYPE_CANONICAL (arg
))
1846 return iterative_hash_object (TYPE_HASH (TYPE_CANONICAL (arg
)),
1848 else if (TREE_CODE (arg
) == DECLTYPE_TYPE
)
1849 return iterative_hash_template_arg (DECLTYPE_TYPE_EXPR (arg
), val
);
1850 /* Otherwise just compare the types during lookup. */
1853 case tcc_declaration
:
1855 return iterative_hash_expr (arg
, val
);
1858 gcc_assert (IS_EXPR_CODE_CLASS (tclass
));
1860 unsigned n
= cp_tree_operand_length (arg
);
1861 for (i
= 0; i
< n
; ++i
)
1862 val
= iterative_hash_template_arg (TREE_OPERAND (arg
, i
), val
);
1870 /* Unregister the specialization SPEC as a specialization of TMPL.
1871 Replace it with NEW_SPEC, if NEW_SPEC is non-NULL. Returns true
1872 if the SPEC was listed as a specialization of TMPL.
1874 Note that SPEC has been ggc_freed, so we can't look inside it. */
1877 reregister_specialization (tree spec
, tree tinfo
, tree new_spec
)
1882 elt
.tmpl
= most_general_template (TI_TEMPLATE (tinfo
));
1883 elt
.args
= TI_ARGS (tinfo
);
1884 elt
.spec
= NULL_TREE
;
1886 entry
= decl_specializations
->find (&elt
);
1889 gcc_assert (entry
->spec
== spec
|| entry
->spec
== new_spec
);
1890 gcc_assert (new_spec
!= NULL_TREE
);
1891 entry
->spec
= new_spec
;
1898 /* Like register_specialization, but for local declarations. We are
1899 registering SPEC, an instantiation of TMPL. */
1902 register_local_specialization (tree spec
, tree tmpl
)
1904 local_specializations
->put (tmpl
, spec
);
1907 /* TYPE is a class type. Returns true if TYPE is an explicitly
1908 specialized class. */
1911 explicit_class_specialization_p (tree type
)
1913 if (!CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
1915 return !uses_template_parms (CLASSTYPE_TI_ARGS (type
));
1918 /* Print the list of functions at FNS, going through all the overloads
1919 for each element of the list. Alternatively, FNS can not be a
1920 TREE_LIST, in which case it will be printed together with all the
1923 MORE and *STR should respectively be FALSE and NULL when the function
1924 is called from the outside. They are used internally on recursive
1925 calls. print_candidates manages the two parameters and leaves NULL
1926 in *STR when it ends. */
1929 print_candidates_1 (tree fns
, bool more
, const char **str
)
1932 char *spaces
= NULL
;
1934 for (fn
= fns
; fn
; fn
= OVL_NEXT (fn
))
1935 if (TREE_CODE (fn
) == TREE_LIST
)
1937 for (fn2
= fn
; fn2
!= NULL_TREE
; fn2
= TREE_CHAIN (fn2
))
1938 print_candidates_1 (TREE_VALUE (fn2
),
1939 TREE_CHAIN (fn2
) || more
, str
);
1943 tree cand
= OVL_CURRENT (fn
);
1946 /* Pick the prefix string. */
1947 if (!more
&& !OVL_NEXT (fns
))
1949 inform (DECL_SOURCE_LOCATION (cand
),
1950 "candidate is: %#D", cand
);
1954 *str
= _("candidates are:");
1955 spaces
= get_spaces (*str
);
1957 inform (DECL_SOURCE_LOCATION (cand
), "%s %#D", *str
, cand
);
1958 *str
= spaces
? spaces
: *str
;
1968 /* Print the list of candidate FNS in an error message. FNS can also
1969 be a TREE_LIST of non-functions in the case of an ambiguous lookup. */
1972 print_candidates (tree fns
)
1974 const char *str
= NULL
;
1975 print_candidates_1 (fns
, false, &str
);
1976 gcc_assert (str
== NULL
);
1979 /* Get a (possibly) constrained template declaration for the
1980 purpose of ordering candidates. */
1982 get_template_for_ordering (tree list
)
1984 gcc_assert (TREE_CODE (list
) == TREE_LIST
);
1985 tree f
= TREE_VALUE (list
);
1986 if (tree ti
= DECL_TEMPLATE_INFO (f
))
1987 return TI_TEMPLATE (ti
);
1991 /* Among candidates having the same signature, return the
1992 most constrained or NULL_TREE if there is no best candidate.
1993 If the signatures of candidates vary (e.g., template
1994 specialization vs. member function), then there can be no
1997 Note that we don't compare constraints on the functions
1998 themselves, but rather those of their templates. */
2000 most_constrained_function (tree candidates
)
2002 // Try to find the best candidate in a first pass.
2003 tree champ
= candidates
;
2004 for (tree c
= TREE_CHAIN (champ
); c
; c
= TREE_CHAIN (c
))
2006 int winner
= more_constrained (get_template_for_ordering (champ
),
2007 get_template_for_ordering (c
));
2009 champ
= c
; // The candidate is more constrained
2010 else if (winner
== 0)
2011 return NULL_TREE
; // Neither is more constrained
2014 // Verify that the champ is better than previous candidates.
2015 for (tree c
= candidates
; c
!= champ
; c
= TREE_CHAIN (c
)) {
2016 if (!more_constrained (get_template_for_ordering (champ
),
2017 get_template_for_ordering (c
)))
2025 /* Returns the template (one of the functions given by TEMPLATE_ID)
2026 which can be specialized to match the indicated DECL with the
2027 explicit template args given in TEMPLATE_ID. The DECL may be
2028 NULL_TREE if none is available. In that case, the functions in
2029 TEMPLATE_ID are non-members.
2031 If NEED_MEMBER_TEMPLATE is nonzero the function is known to be a
2032 specialization of a member template.
2034 The TEMPLATE_COUNT is the number of references to qualifying
2035 template classes that appeared in the name of the function. See
2036 check_explicit_specialization for a more accurate description.
2038 TSK indicates what kind of template declaration (if any) is being
2039 declared. TSK_TEMPLATE indicates that the declaration given by
2040 DECL, though a FUNCTION_DECL, has template parameters, and is
2041 therefore a template function.
2043 The template args (those explicitly specified and those deduced)
2044 are output in a newly created vector *TARGS_OUT.
2046 If it is impossible to determine the result, an error message is
2047 issued. The error_mark_node is returned to indicate failure. */
2050 determine_specialization (tree template_id
,
2053 int need_member_template
,
2059 tree explicit_targs
;
2060 tree candidates
= NULL_TREE
;
2062 /* A TREE_LIST of templates of which DECL may be a specialization.
2063 The TREE_VALUE of each node is a TEMPLATE_DECL. The
2064 corresponding TREE_PURPOSE is the set of template arguments that,
2065 when used to instantiate the template, would produce a function
2066 with the signature of DECL. */
2067 tree templates
= NULL_TREE
;
2069 cp_binding_level
*b
;
2071 *targs_out
= NULL_TREE
;
2073 if (template_id
== error_mark_node
|| decl
== error_mark_node
)
2074 return error_mark_node
;
2076 /* We shouldn't be specializing a member template of an
2077 unspecialized class template; we already gave an error in
2078 check_specialization_scope, now avoid crashing. */
2079 if (template_count
&& DECL_CLASS_SCOPE_P (decl
)
2080 && template_class_depth (DECL_CONTEXT (decl
)) > 0)
2082 gcc_assert (errorcount
);
2083 return error_mark_node
;
2086 fns
= TREE_OPERAND (template_id
, 0);
2087 explicit_targs
= TREE_OPERAND (template_id
, 1);
2089 if (fns
== error_mark_node
)
2090 return error_mark_node
;
2092 /* Check for baselinks. */
2093 if (BASELINK_P (fns
))
2094 fns
= BASELINK_FUNCTIONS (fns
);
2096 if (TREE_CODE (decl
) == FUNCTION_DECL
&& !is_overloaded_fn (fns
))
2098 error ("%qD is not a function template", fns
);
2099 return error_mark_node
;
2101 else if (VAR_P (decl
) && !variable_template_p (fns
))
2103 error ("%qD is not a variable template", fns
);
2104 return error_mark_node
;
2107 /* Count the number of template headers specified for this
2110 for (b
= current_binding_level
;
2111 b
->kind
== sk_template_parms
;
2115 tree orig_fns
= fns
;
2117 if (variable_template_p (fns
))
2119 tree parms
= INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (fns
));
2120 targs
= coerce_template_parms (parms
, explicit_targs
, fns
,
2121 tf_warning_or_error
,
2122 /*req_all*/true, /*use_defarg*/true);
2123 if (targs
!= error_mark_node
)
2124 templates
= tree_cons (targs
, fns
, templates
);
2126 else for (; fns
; fns
= OVL_NEXT (fns
))
2128 tree fn
= OVL_CURRENT (fns
);
2130 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
2132 tree decl_arg_types
;
2136 /* In case of explicit specialization, we need to check if
2137 the number of template headers appearing in the specialization
2138 is correct. This is usually done in check_explicit_specialization,
2139 but the check done there cannot be exhaustive when specializing
2140 member functions. Consider the following code:
2142 template <> void A<int>::f(int);
2143 template <> template <> void A<int>::f(int);
2145 Assuming that A<int> is not itself an explicit specialization
2146 already, the first line specializes "f" which is a non-template
2147 member function, whilst the second line specializes "f" which
2148 is a template member function. So both lines are syntactically
2149 correct, and check_explicit_specialization does not reject
2152 Here, we can do better, as we are matching the specialization
2153 against the declarations. We count the number of template
2154 headers, and we check if they match TEMPLATE_COUNT + 1
2155 (TEMPLATE_COUNT is the number of qualifying template classes,
2156 plus there must be another header for the member template
2159 Notice that if header_count is zero, this is not a
2160 specialization but rather a template instantiation, so there
2161 is no check we can perform here. */
2162 if (header_count
&& header_count
!= template_count
+ 1)
2165 /* Check that the number of template arguments at the
2166 innermost level for DECL is the same as for FN. */
2167 if (current_binding_level
->kind
== sk_template_parms
2168 && !current_binding_level
->explicit_spec_p
2169 && (TREE_VEC_LENGTH (DECL_INNERMOST_TEMPLATE_PARMS (fn
))
2170 != TREE_VEC_LENGTH (INNERMOST_TEMPLATE_PARMS
2171 (current_template_parms
))))
2174 /* DECL might be a specialization of FN. */
2175 decl_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
2176 fn_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
2178 /* For a non-static member function, we need to make sure
2179 that the const qualification is the same. Since
2180 get_bindings does not try to merge the "this" parameter,
2181 we must do the comparison explicitly. */
2182 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
2183 && !same_type_p (TREE_VALUE (fn_arg_types
),
2184 TREE_VALUE (decl_arg_types
)))
2187 /* Skip the "this" parameter and, for constructors of
2188 classes with virtual bases, the VTT parameter. A
2189 full specialization of a constructor will have a VTT
2190 parameter, but a template never will. */
2192 = skip_artificial_parms_for (decl
, decl_arg_types
);
2194 = skip_artificial_parms_for (fn
, fn_arg_types
);
2196 /* Function templates cannot be specializations; there are
2197 no partial specializations of functions. Therefore, if
2198 the type of DECL does not match FN, there is no
2201 Note that it should never be the case that we have both
2202 candidates added here, and for regular member functions
2204 if (tsk
== tsk_template
)
2206 if (compparms (fn_arg_types
, decl_arg_types
))
2207 candidates
= tree_cons (NULL_TREE
, fn
, candidates
);
2211 /* See whether this function might be a specialization of this
2212 template. Suppress access control because we might be trying
2213 to make this specialization a friend, and we have already done
2214 access control for the declaration of the specialization. */
2215 push_deferring_access_checks (dk_no_check
);
2216 targs
= get_bindings (fn
, decl
, explicit_targs
, /*check_ret=*/true);
2217 pop_deferring_access_checks ();
2220 /* We cannot deduce template arguments that when used to
2221 specialize TMPL will produce DECL. */
2224 /* Remove, from the set of candidates, all those functions
2225 whose constraints are not satisfied. */
2226 if (flag_concepts
&& !constraints_satisfied_p (fn
, targs
))
2229 // Then, try to form the new function type.
2230 insttype
= tsubst (TREE_TYPE (fn
), targs
, tf_none
, NULL_TREE
);
2231 if (insttype
== error_mark_node
)
2234 = skip_artificial_parms_for (fn
, TYPE_ARG_TYPES (insttype
));
2235 if (!compparms (fn_arg_types
, decl_arg_types
))
2238 /* Save this template, and the arguments deduced. */
2239 templates
= tree_cons (targs
, fn
, templates
);
2241 else if (need_member_template
)
2242 /* FN is an ordinary member function, and we need a
2243 specialization of a member template. */
2245 else if (TREE_CODE (fn
) != FUNCTION_DECL
)
2246 /* We can get IDENTIFIER_NODEs here in certain erroneous
2249 else if (!DECL_FUNCTION_MEMBER_P (fn
))
2250 /* This is just an ordinary non-member function. Nothing can
2251 be a specialization of that. */
2253 else if (DECL_ARTIFICIAL (fn
))
2254 /* Cannot specialize functions that are created implicitly. */
2258 tree decl_arg_types
;
2260 /* This is an ordinary member function. However, since
2261 we're here, we can assume its enclosing class is a
2262 template class. For example,
2264 template <typename T> struct S { void f(); };
2265 template <> void S<int>::f() {}
2267 Here, S<int>::f is a non-template, but S<int> is a
2268 template class. If FN has the same type as DECL, we
2269 might be in business. */
2271 if (!DECL_TEMPLATE_INFO (fn
))
2272 /* Its enclosing class is an explicit specialization
2273 of a template class. This is not a candidate. */
2276 if (!same_type_p (TREE_TYPE (TREE_TYPE (decl
)),
2277 TREE_TYPE (TREE_TYPE (fn
))))
2278 /* The return types differ. */
2281 /* Adjust the type of DECL in case FN is a static member. */
2282 decl_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
2283 if (DECL_STATIC_FUNCTION_P (fn
)
2284 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
2285 decl_arg_types
= TREE_CHAIN (decl_arg_types
);
2287 if (!compparms (TYPE_ARG_TYPES (TREE_TYPE (fn
)),
2291 // If the deduced arguments do not satisfy the constraints,
2292 // this is not a candidate.
2293 if (flag_concepts
&& !constraints_satisfied_p (fn
))
2296 // Add the candidate.
2297 candidates
= tree_cons (NULL_TREE
, fn
, candidates
);
2301 if (templates
&& TREE_CHAIN (templates
))
2307 It is possible for a specialization with a given function
2308 signature to be instantiated from more than one function
2309 template. In such cases, explicit specification of the
2310 template arguments must be used to uniquely identify the
2311 function template specialization being specialized.
2313 Note that here, there's no suggestion that we're supposed to
2314 determine which of the candidate templates is most
2315 specialized. However, we, also have:
2319 Partial ordering of overloaded function template
2320 declarations is used in the following contexts to select
2321 the function template to which a function template
2322 specialization refers:
2324 -- when an explicit specialization refers to a function
2327 So, we do use the partial ordering rules, at least for now.
2328 This extension can only serve to make invalid programs valid,
2329 so it's safe. And, there is strong anecdotal evidence that
2330 the committee intended the partial ordering rules to apply;
2331 the EDG front end has that behavior, and John Spicer claims
2332 that the committee simply forgot to delete the wording in
2333 [temp.expl.spec]. */
2334 tree tmpl
= most_specialized_instantiation (templates
);
2335 if (tmpl
!= error_mark_node
)
2338 TREE_CHAIN (templates
) = NULL_TREE
;
2342 // Concepts allows multiple declarations of member functions
2343 // with the same signature. Like above, we need to rely on
2344 // on the partial ordering of those candidates to determine which
2346 if (flag_concepts
&& candidates
&& TREE_CHAIN (candidates
))
2348 if (tree cand
= most_constrained_function (candidates
))
2351 TREE_CHAIN (cand
) = NULL_TREE
;
2355 if (templates
== NULL_TREE
&& candidates
== NULL_TREE
)
2357 error ("template-id %qD for %q+D does not match any template "
2358 "declaration", template_id
, decl
);
2359 if (header_count
&& header_count
!= template_count
+ 1)
2360 inform (input_location
, "saw %d %<template<>%>, need %d for "
2361 "specializing a member function template",
2362 header_count
, template_count
+ 1);
2364 print_candidates (orig_fns
);
2365 return error_mark_node
;
2367 else if ((templates
&& TREE_CHAIN (templates
))
2368 || (candidates
&& TREE_CHAIN (candidates
))
2369 || (templates
&& candidates
))
2371 error ("ambiguous template specialization %qD for %q+D",
2373 candidates
= chainon (candidates
, templates
);
2374 print_candidates (candidates
);
2375 return error_mark_node
;
2378 /* We have one, and exactly one, match. */
2381 tree fn
= TREE_VALUE (candidates
);
2382 *targs_out
= copy_node (DECL_TI_ARGS (fn
));
2384 // Propagate the candidate's constraints to the declaration.
2385 set_constraints (decl
, get_constraints (fn
));
2387 /* DECL is a re-declaration or partial instantiation of a template
2389 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
2391 /* It was a specialization of an ordinary member function in a
2393 return DECL_TI_TEMPLATE (fn
);
2396 /* It was a specialization of a template. */
2397 targs
= DECL_TI_ARGS (DECL_TEMPLATE_RESULT (TREE_VALUE (templates
)));
2398 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (targs
))
2400 *targs_out
= copy_node (targs
);
2401 SET_TMPL_ARGS_LEVEL (*targs_out
,
2402 TMPL_ARGS_DEPTH (*targs_out
),
2403 TREE_PURPOSE (templates
));
2406 *targs_out
= TREE_PURPOSE (templates
);
2407 return TREE_VALUE (templates
);
2410 /* Returns a chain of parameter types, exactly like the SPEC_TYPES,
2411 but with the default argument values filled in from those in the
2415 copy_default_args_to_explicit_spec_1 (tree spec_types
,
2418 tree new_spec_types
;
2423 if (spec_types
== void_list_node
)
2424 return void_list_node
;
2426 /* Substitute into the rest of the list. */
2428 copy_default_args_to_explicit_spec_1 (TREE_CHAIN (spec_types
),
2429 TREE_CHAIN (tmpl_types
));
2431 /* Add the default argument for this parameter. */
2432 return hash_tree_cons (TREE_PURPOSE (tmpl_types
),
2433 TREE_VALUE (spec_types
),
2437 /* DECL is an explicit specialization. Replicate default arguments
2438 from the template it specializes. (That way, code like:
2440 template <class T> void f(T = 3);
2441 template <> void f(double);
2444 works, as required.) An alternative approach would be to look up
2445 the correct default arguments at the call-site, but this approach
2446 is consistent with how implicit instantiations are handled. */
2449 copy_default_args_to_explicit_spec (tree decl
)
2454 tree new_spec_types
;
2458 tree object_type
= NULL_TREE
;
2459 tree in_charge
= NULL_TREE
;
2460 tree vtt
= NULL_TREE
;
2462 /* See if there's anything we need to do. */
2463 tmpl
= DECL_TI_TEMPLATE (decl
);
2464 tmpl_types
= TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (tmpl
)));
2465 for (t
= tmpl_types
; t
; t
= TREE_CHAIN (t
))
2466 if (TREE_PURPOSE (t
))
2471 old_type
= TREE_TYPE (decl
);
2472 spec_types
= TYPE_ARG_TYPES (old_type
);
2474 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
2476 /* Remove the this pointer, but remember the object's type for
2478 object_type
= TREE_TYPE (TREE_VALUE (spec_types
));
2479 spec_types
= TREE_CHAIN (spec_types
);
2480 tmpl_types
= TREE_CHAIN (tmpl_types
);
2482 if (DECL_HAS_IN_CHARGE_PARM_P (decl
))
2484 /* DECL may contain more parameters than TMPL due to the extra
2485 in-charge parameter in constructors and destructors. */
2486 in_charge
= spec_types
;
2487 spec_types
= TREE_CHAIN (spec_types
);
2489 if (DECL_HAS_VTT_PARM_P (decl
))
2492 spec_types
= TREE_CHAIN (spec_types
);
2496 /* Compute the merged default arguments. */
2498 copy_default_args_to_explicit_spec_1 (spec_types
, tmpl_types
);
2500 /* Compute the new FUNCTION_TYPE. */
2504 new_spec_types
= hash_tree_cons (TREE_PURPOSE (vtt
),
2509 /* Put the in-charge parameter back. */
2510 new_spec_types
= hash_tree_cons (TREE_PURPOSE (in_charge
),
2511 TREE_VALUE (in_charge
),
2514 new_type
= build_method_type_directly (object_type
,
2515 TREE_TYPE (old_type
),
2519 new_type
= build_function_type (TREE_TYPE (old_type
),
2521 new_type
= cp_build_type_attribute_variant (new_type
,
2522 TYPE_ATTRIBUTES (old_type
));
2523 new_type
= build_exception_variant (new_type
,
2524 TYPE_RAISES_EXCEPTIONS (old_type
));
2526 if (TYPE_HAS_LATE_RETURN_TYPE (old_type
))
2527 TYPE_HAS_LATE_RETURN_TYPE (new_type
) = 1;
2529 TREE_TYPE (decl
) = new_type
;
2532 /* Return the number of template headers we expect to see for a definition
2533 or specialization of CTYPE or one of its non-template members. */
2536 num_template_headers_for_class (tree ctype
)
2538 int num_templates
= 0;
2540 while (ctype
&& CLASS_TYPE_P (ctype
))
2542 /* You're supposed to have one `template <...>' for every
2543 template class, but you don't need one for a full
2544 specialization. For example:
2546 template <class T> struct S{};
2547 template <> struct S<int> { void f(); };
2548 void S<int>::f () {}
2550 is correct; there shouldn't be a `template <>' for the
2551 definition of `S<int>::f'. */
2552 if (!CLASSTYPE_TEMPLATE_INFO (ctype
))
2553 /* If CTYPE does not have template information of any
2554 kind, then it is not a template, nor is it nested
2555 within a template. */
2557 if (explicit_class_specialization_p (ctype
))
2559 if (PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (ctype
)))
2562 ctype
= TYPE_CONTEXT (ctype
);
2565 return num_templates
;
2568 /* Do a simple sanity check on the template headers that precede the
2569 variable declaration DECL. */
2572 check_template_variable (tree decl
)
2574 tree ctx
= CP_DECL_CONTEXT (decl
);
2575 int wanted
= num_template_headers_for_class (ctx
);
2576 if (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
)
2577 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl
)))
2579 if (cxx_dialect
< cxx14
)
2580 pedwarn (DECL_SOURCE_LOCATION (decl
), 0,
2581 "variable templates only available with "
2582 "-std=c++14 or -std=gnu++14");
2584 // Namespace-scope variable templates should have a template header.
2587 if (template_header_count
> wanted
)
2589 bool warned
= pedwarn (DECL_SOURCE_LOCATION (decl
), 0,
2590 "too many template headers for %D (should be %d)",
2592 if (warned
&& CLASS_TYPE_P (ctx
)
2593 && CLASSTYPE_TEMPLATE_SPECIALIZATION (ctx
))
2594 inform (DECL_SOURCE_LOCATION (decl
),
2595 "members of an explicitly specialized class are defined "
2596 "without a template header");
2600 /* Check to see if the function just declared, as indicated in
2601 DECLARATOR, and in DECL, is a specialization of a function
2602 template. We may also discover that the declaration is an explicit
2603 instantiation at this point.
2605 Returns DECL, or an equivalent declaration that should be used
2606 instead if all goes well. Issues an error message if something is
2607 amiss. Returns error_mark_node if the error is not easily
2610 FLAGS is a bitmask consisting of the following flags:
2612 2: The function has a definition.
2613 4: The function is a friend.
2615 The TEMPLATE_COUNT is the number of references to qualifying
2616 template classes that appeared in the name of the function. For
2619 template <class T> struct S { void f(); };
2622 the TEMPLATE_COUNT would be 1. However, explicitly specialized
2623 classes are not counted in the TEMPLATE_COUNT, so that in
2625 template <class T> struct S {};
2626 template <> struct S<int> { void f(); }
2627 template <> void S<int>::f();
2629 the TEMPLATE_COUNT would be 0. (Note that this declaration is
2630 invalid; there should be no template <>.)
2632 If the function is a specialization, it is marked as such via
2633 DECL_TEMPLATE_SPECIALIZATION. Furthermore, its DECL_TEMPLATE_INFO
2634 is set up correctly, and it is added to the list of specializations
2635 for that template. */
2638 check_explicit_specialization (tree declarator
,
2643 int have_def
= flags
& 2;
2644 int is_friend
= flags
& 4;
2645 bool is_concept
= flags
& 8;
2646 int specialization
= 0;
2647 int explicit_instantiation
= 0;
2648 int member_specialization
= 0;
2649 tree ctype
= DECL_CLASS_CONTEXT (decl
);
2650 tree dname
= DECL_NAME (decl
);
2655 if (!processing_specialization
)
2658 tsk
= tsk_excessive_parms
;
2661 tsk
= current_tmpl_spec_kind (template_count
);
2666 if (processing_specialization
&& !VAR_P (decl
))
2669 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
2671 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
2674 /* This could be something like:
2676 template <class T> void f(T);
2677 class S { friend void f<>(int); } */
2681 /* This case handles bogus declarations like template <>
2682 template <class T> void f<int>(); */
2684 error ("template-id %qD in declaration of primary template",
2691 case tsk_invalid_member_spec
:
2692 /* The error has already been reported in
2693 check_specialization_scope. */
2694 return error_mark_node
;
2696 case tsk_invalid_expl_inst
:
2697 error ("template parameter list used in explicit instantiation");
2703 error ("definition provided for explicit instantiation");
2705 explicit_instantiation
= 1;
2708 case tsk_excessive_parms
:
2709 case tsk_insufficient_parms
:
2710 if (tsk
== tsk_excessive_parms
)
2711 error ("too many template parameter lists in declaration of %qD",
2713 else if (template_header_count
)
2714 error("too few template parameter lists in declaration of %qD", decl
);
2716 error("explicit specialization of %qD must be introduced by "
2717 "%<template <>%>", decl
);
2722 error ("explicit specialization declared %<concept%>");
2724 if (VAR_P (decl
) && TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
2725 /* In cases like template<> constexpr bool v = true;
2726 We'll give an error in check_template_variable. */
2729 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
2731 member_specialization
= 1;
2737 if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
2739 /* This case handles bogus declarations like template <>
2740 template <class T> void f<int>(); */
2742 if (!uses_template_parms (declarator
))
2743 error ("template-id %qD in declaration of primary template",
2745 else if (variable_template_p (TREE_OPERAND (declarator
, 0)))
2747 /* Partial specialization of variable template. */
2748 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
2752 else if (cxx_dialect
< cxx14
)
2753 error ("non-type partial specialization %qD "
2754 "is not allowed", declarator
);
2756 error ("non-class, non-variable partial specialization %qD "
2757 "is not allowed", declarator
);
2762 if (ctype
&& CLASSTYPE_TEMPLATE_INSTANTIATION (ctype
))
2763 /* This is a specialization of a member template, without
2764 specialization the containing class. Something like:
2766 template <class T> struct S {
2767 template <class U> void f (U);
2769 template <> template <class U> void S<int>::f(U) {}
2771 That's a specialization -- but of the entire template. */
2779 if ((specialization
|| member_specialization
)
2780 /* This doesn't apply to variable templates. */
2781 && (TREE_CODE (TREE_TYPE (decl
)) == FUNCTION_TYPE
2782 || TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
))
2784 tree t
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
2785 for (; t
; t
= TREE_CHAIN (t
))
2786 if (TREE_PURPOSE (t
))
2788 permerror (input_location
,
2789 "default argument specified in explicit specialization");
2794 if (specialization
|| member_specialization
|| explicit_instantiation
)
2796 tree tmpl
= NULL_TREE
;
2797 tree targs
= NULL_TREE
;
2798 bool was_template_id
= (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
);
2800 /* Make sure that the declarator is a TEMPLATE_ID_EXPR. */
2801 if (!was_template_id
)
2805 gcc_assert (identifier_p (declarator
));
2810 /* If there is no class context, the explicit instantiation
2811 must be at namespace scope. */
2812 gcc_assert (DECL_NAMESPACE_SCOPE_P (decl
));
2814 /* Find the namespace binding, using the declaration
2816 fns
= lookup_qualified_name (CP_DECL_CONTEXT (decl
), dname
,
2818 if (fns
== error_mark_node
|| !is_overloaded_fn (fns
))
2820 error ("%qD is not a template function", dname
);
2821 fns
= error_mark_node
;
2825 tree fn
= OVL_CURRENT (fns
);
2826 if (!is_associated_namespace (CP_DECL_CONTEXT (decl
),
2827 CP_DECL_CONTEXT (fn
)))
2828 error ("%qD is not declared in %qD",
2829 decl
, current_namespace
);
2833 declarator
= lookup_template_function (fns
, NULL_TREE
);
2836 if (declarator
== error_mark_node
)
2837 return error_mark_node
;
2839 if (ctype
!= NULL_TREE
&& TYPE_BEING_DEFINED (ctype
))
2841 if (!explicit_instantiation
)
2842 /* A specialization in class scope. This is invalid,
2843 but the error will already have been flagged by
2844 check_specialization_scope. */
2845 return error_mark_node
;
2848 /* It's not valid to write an explicit instantiation in
2851 class C { template void f(); }
2853 This case is caught by the parser. However, on
2856 template class C { void f(); };
2858 (which is invalid) we can get here. The error will be
2865 else if (ctype
!= NULL_TREE
2866 && (identifier_p (TREE_OPERAND (declarator
, 0))))
2868 // We'll match variable templates in start_decl.
2872 /* Find the list of functions in ctype that have the same
2873 name as the declared function. */
2874 tree name
= TREE_OPERAND (declarator
, 0);
2875 tree fns
= NULL_TREE
;
2878 if (constructor_name_p (name
, ctype
))
2880 int is_constructor
= DECL_CONSTRUCTOR_P (decl
);
2882 if (is_constructor
? !TYPE_HAS_USER_CONSTRUCTOR (ctype
)
2883 : !CLASSTYPE_DESTRUCTORS (ctype
))
2885 /* From [temp.expl.spec]:
2887 If such an explicit specialization for the member
2888 of a class template names an implicitly-declared
2889 special member function (clause _special_), the
2890 program is ill-formed.
2892 Similar language is found in [temp.explicit]. */
2893 error ("specialization of implicitly-declared special member function");
2894 return error_mark_node
;
2897 name
= is_constructor
? ctor_identifier
: dtor_identifier
;
2900 if (!DECL_CONV_FN_P (decl
))
2902 idx
= lookup_fnfields_1 (ctype
, name
);
2904 fns
= (*CLASSTYPE_METHOD_VEC (ctype
))[idx
];
2908 vec
<tree
, va_gc
> *methods
;
2911 /* For a type-conversion operator, we cannot do a
2912 name-based lookup. We might be looking for `operator
2913 int' which will be a specialization of `operator T'.
2914 So, we find *all* the conversion operators, and then
2915 select from them. */
2918 methods
= CLASSTYPE_METHOD_VEC (ctype
);
2920 for (idx
= CLASSTYPE_FIRST_CONVERSION_SLOT
;
2921 methods
->iterate (idx
, &ovl
);
2924 if (!DECL_CONV_FN_P (OVL_CURRENT (ovl
)))
2925 /* There are no more conversion functions. */
2928 /* Glue all these conversion functions together
2929 with those we already have. */
2930 for (; ovl
; ovl
= OVL_NEXT (ovl
))
2931 fns
= ovl_cons (OVL_CURRENT (ovl
), fns
);
2935 if (fns
== NULL_TREE
)
2937 error ("no member function %qD declared in %qT", name
, ctype
);
2938 return error_mark_node
;
2941 TREE_OPERAND (declarator
, 0) = fns
;
2944 /* Figure out what exactly is being specialized at this point.
2945 Note that for an explicit instantiation, even one for a
2946 member function, we cannot tell apriori whether the
2947 instantiation is for a member template, or just a member
2948 function of a template class. Even if a member template is
2949 being instantiated, the member template arguments may be
2950 elided if they can be deduced from the rest of the
2952 tmpl
= determine_specialization (declarator
, decl
,
2954 member_specialization
,
2958 if (!tmpl
|| tmpl
== error_mark_node
)
2959 /* We couldn't figure out what this declaration was
2961 return error_mark_node
;
2964 tree gen_tmpl
= most_general_template (tmpl
);
2966 if (explicit_instantiation
)
2968 /* We don't set DECL_EXPLICIT_INSTANTIATION here; that
2969 is done by do_decl_instantiation later. */
2971 int arg_depth
= TMPL_ARGS_DEPTH (targs
);
2972 int parm_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
2974 if (arg_depth
> parm_depth
)
2976 /* If TMPL is not the most general template (for
2977 example, if TMPL is a friend template that is
2978 injected into namespace scope), then there will
2979 be too many levels of TARGS. Remove some of them
2984 new_targs
= make_tree_vec (parm_depth
);
2985 for (i
= arg_depth
- parm_depth
; i
< arg_depth
; ++i
)
2986 TREE_VEC_ELT (new_targs
, i
- (arg_depth
- parm_depth
))
2987 = TREE_VEC_ELT (targs
, i
);
2991 return instantiate_template (tmpl
, targs
, tf_error
);
2994 /* If we thought that the DECL was a member function, but it
2995 turns out to be specializing a static member function,
2996 make DECL a static member function as well. */
2997 if (DECL_FUNCTION_TEMPLATE_P (tmpl
)
2998 && DECL_STATIC_FUNCTION_P (tmpl
)
2999 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
3000 revert_static_member_fn (decl
);
3002 /* If this is a specialization of a member template of a
3003 template class, we want to return the TEMPLATE_DECL, not
3004 the specialization of it. */
3005 if (tsk
== tsk_template
&& !was_template_id
)
3007 tree result
= DECL_TEMPLATE_RESULT (tmpl
);
3008 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
3009 DECL_INITIAL (result
) = NULL_TREE
;
3013 DECL_SOURCE_LOCATION (tmpl
) = DECL_SOURCE_LOCATION (decl
);
3014 DECL_SOURCE_LOCATION (result
)
3015 = DECL_SOURCE_LOCATION (decl
);
3016 /* We want to use the argument list specified in the
3017 definition, not in the original declaration. */
3018 DECL_ARGUMENTS (result
) = DECL_ARGUMENTS (decl
);
3019 for (parm
= DECL_ARGUMENTS (result
); parm
;
3020 parm
= DECL_CHAIN (parm
))
3021 DECL_CONTEXT (parm
) = result
;
3023 return register_specialization (tmpl
, gen_tmpl
, targs
,
3027 /* Set up the DECL_TEMPLATE_INFO for DECL. */
3028 DECL_TEMPLATE_INFO (decl
) = build_template_info (tmpl
, targs
);
3030 if (was_template_id
)
3031 TINFO_USED_TEMPLATE_ID (DECL_TEMPLATE_INFO (decl
)) = true;
3033 /* Inherit default function arguments from the template
3034 DECL is specializing. */
3035 if (DECL_FUNCTION_TEMPLATE_P (tmpl
))
3036 copy_default_args_to_explicit_spec (decl
);
3038 /* This specialization has the same protection as the
3039 template it specializes. */
3040 TREE_PRIVATE (decl
) = TREE_PRIVATE (gen_tmpl
);
3041 TREE_PROTECTED (decl
) = TREE_PROTECTED (gen_tmpl
);
3043 /* 7.1.1-1 [dcl.stc]
3045 A storage-class-specifier shall not be specified in an
3046 explicit specialization...
3048 The parser rejects these, so unless action is taken here,
3049 explicit function specializations will always appear with
3052 The action recommended by the C++ CWG in response to C++
3053 defect report 605 is to make the storage class and linkage
3054 of the explicit specialization match the templated function:
3056 http://www.open-std.org/jtc1/sc22/wg21/docs/cwg_active.html#605
3058 if (tsk
== tsk_expl_spec
&& DECL_FUNCTION_TEMPLATE_P (gen_tmpl
))
3060 tree tmpl_func
= DECL_TEMPLATE_RESULT (gen_tmpl
);
3061 gcc_assert (TREE_CODE (tmpl_func
) == FUNCTION_DECL
);
3063 /* A concept cannot be specialized. */
3064 if (DECL_DECLARED_CONCEPT_P (tmpl_func
))
3066 error ("explicit specialization of function concept %qD",
3068 return error_mark_node
;
3071 /* This specialization has the same linkage and visibility as
3072 the function template it specializes. */
3073 TREE_PUBLIC (decl
) = TREE_PUBLIC (tmpl_func
);
3074 if (! TREE_PUBLIC (decl
))
3076 DECL_INTERFACE_KNOWN (decl
) = 1;
3077 DECL_NOT_REALLY_EXTERN (decl
) = 1;
3079 DECL_THIS_STATIC (decl
) = DECL_THIS_STATIC (tmpl_func
);
3080 if (DECL_VISIBILITY_SPECIFIED (tmpl_func
))
3082 DECL_VISIBILITY_SPECIFIED (decl
) = 1;
3083 DECL_VISIBILITY (decl
) = DECL_VISIBILITY (tmpl_func
);
3087 /* If DECL is a friend declaration, declared using an
3088 unqualified name, the namespace associated with DECL may
3089 have been set incorrectly. For example, in:
3091 template <typename T> void f(T);
3093 struct S { friend void f<int>(int); }
3096 we will have set the DECL_CONTEXT for the friend
3097 declaration to N, rather than to the global namespace. */
3098 if (DECL_NAMESPACE_SCOPE_P (decl
))
3099 DECL_CONTEXT (decl
) = DECL_CONTEXT (tmpl
);
3101 if (is_friend
&& !have_def
)
3102 /* This is not really a declaration of a specialization.
3103 It's just the name of an instantiation. But, it's not
3104 a request for an instantiation, either. */
3105 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
3106 else if (TREE_CODE (decl
) == FUNCTION_DECL
)
3107 /* A specialization is not necessarily COMDAT. */
3108 DECL_COMDAT (decl
) = (TREE_PUBLIC (decl
)
3109 && DECL_DECLARED_INLINE_P (decl
));
3110 else if (VAR_P (decl
))
3111 DECL_COMDAT (decl
) = false;
3113 /* If this is a full specialization, register it so that we can find
3114 it again. Partial specializations will be registered in
3115 process_partial_specialization. */
3116 if (!processing_template_decl
)
3117 decl
= register_specialization (decl
, gen_tmpl
, targs
,
3120 /* A 'structor should already have clones. */
3121 gcc_assert (decl
== error_mark_node
3122 || variable_template_p (tmpl
)
3123 || !(DECL_CONSTRUCTOR_P (decl
)
3124 || DECL_DESTRUCTOR_P (decl
))
3125 || DECL_CLONED_FUNCTION_P (DECL_CHAIN (decl
)));
3132 /* Returns 1 iff PARMS1 and PARMS2 are identical sets of template
3133 parameters. These are represented in the same format used for
3134 DECL_TEMPLATE_PARMS. */
3137 comp_template_parms (const_tree parms1
, const_tree parms2
)
3142 if (parms1
== parms2
)
3145 for (p1
= parms1
, p2
= parms2
;
3146 p1
!= NULL_TREE
&& p2
!= NULL_TREE
;
3147 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
))
3149 tree t1
= TREE_VALUE (p1
);
3150 tree t2
= TREE_VALUE (p2
);
3153 gcc_assert (TREE_CODE (t1
) == TREE_VEC
);
3154 gcc_assert (TREE_CODE (t2
) == TREE_VEC
);
3156 if (TREE_VEC_LENGTH (t1
) != TREE_VEC_LENGTH (t2
))
3159 for (i
= 0; i
< TREE_VEC_LENGTH (t2
); ++i
)
3161 tree parm1
= TREE_VALUE (TREE_VEC_ELT (t1
, i
));
3162 tree parm2
= TREE_VALUE (TREE_VEC_ELT (t2
, i
));
3164 /* If either of the template parameters are invalid, assume
3165 they match for the sake of error recovery. */
3166 if (error_operand_p (parm1
) || error_operand_p (parm2
))
3169 if (TREE_CODE (parm1
) != TREE_CODE (parm2
))
3172 if (TREE_CODE (parm1
) == TEMPLATE_TYPE_PARM
3173 && (TEMPLATE_TYPE_PARAMETER_PACK (parm1
)
3174 == TEMPLATE_TYPE_PARAMETER_PACK (parm2
)))
3176 else if (!same_type_p (TREE_TYPE (parm1
), TREE_TYPE (parm2
)))
3181 if ((p1
!= NULL_TREE
) != (p2
!= NULL_TREE
))
3182 /* One set of parameters has more parameters lists than the
3189 /* Determine whether PARM is a parameter pack. */
3192 template_parameter_pack_p (const_tree parm
)
3194 /* Determine if we have a non-type template parameter pack. */
3195 if (TREE_CODE (parm
) == PARM_DECL
)
3196 return (DECL_TEMPLATE_PARM_P (parm
)
3197 && TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)));
3198 if (TREE_CODE (parm
) == TEMPLATE_PARM_INDEX
)
3199 return TEMPLATE_PARM_PARAMETER_PACK (parm
);
3201 /* If this is a list of template parameters, we could get a
3202 TYPE_DECL or a TEMPLATE_DECL. */
3203 if (TREE_CODE (parm
) == TYPE_DECL
|| TREE_CODE (parm
) == TEMPLATE_DECL
)
3204 parm
= TREE_TYPE (parm
);
3206 /* Otherwise it must be a type template parameter. */
3207 return ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
3208 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
)
3209 && TEMPLATE_TYPE_PARAMETER_PACK (parm
));
3212 /* Determine if T is a function parameter pack. */
3215 function_parameter_pack_p (const_tree t
)
3217 if (t
&& TREE_CODE (t
) == PARM_DECL
)
3218 return DECL_PACK_P (t
);
3222 /* Return the function template declaration of PRIMARY_FUNC_TMPL_INST.
3223 PRIMARY_FUNC_TMPL_INST is a primary function template instantiation. */
3226 get_function_template_decl (const_tree primary_func_tmpl_inst
)
3228 if (! primary_func_tmpl_inst
3229 || TREE_CODE (primary_func_tmpl_inst
) != FUNCTION_DECL
3230 || ! primary_template_instantiation_p (primary_func_tmpl_inst
))
3233 return DECL_TEMPLATE_RESULT (DECL_TI_TEMPLATE (primary_func_tmpl_inst
));
3236 /* Return true iff the function parameter PARAM_DECL was expanded
3237 from the function parameter pack PACK. */
3240 function_parameter_expanded_from_pack_p (tree param_decl
, tree pack
)
3242 if (DECL_ARTIFICIAL (param_decl
)
3243 || !function_parameter_pack_p (pack
))
3246 /* The parameter pack and its pack arguments have the same
3248 return DECL_PARM_INDEX (pack
) == DECL_PARM_INDEX (param_decl
);
3251 /* Determine whether ARGS describes a variadic template args list,
3252 i.e., one that is terminated by a template argument pack. */
3255 template_args_variadic_p (tree args
)
3260 if (args
== NULL_TREE
)
3263 args
= INNERMOST_TEMPLATE_ARGS (args
);
3264 nargs
= TREE_VEC_LENGTH (args
);
3269 last_parm
= TREE_VEC_ELT (args
, nargs
- 1);
3271 return ARGUMENT_PACK_P (last_parm
);
3274 /* Generate a new name for the parameter pack name NAME (an
3275 IDENTIFIER_NODE) that incorporates its */
3278 make_ith_pack_parameter_name (tree name
, int i
)
3280 /* Munge the name to include the parameter index. */
3281 #define NUMBUF_LEN 128
3282 char numbuf
[NUMBUF_LEN
];
3286 if (name
== NULL_TREE
)
3288 snprintf (numbuf
, NUMBUF_LEN
, "%i", i
);
3289 newname_len
= IDENTIFIER_LENGTH (name
)
3290 + strlen (numbuf
) + 2;
3291 newname
= (char*)alloca (newname_len
);
3292 snprintf (newname
, newname_len
,
3293 "%s#%i", IDENTIFIER_POINTER (name
), i
);
3294 return get_identifier (newname
);
3297 /* Return true if T is a primary function, class or alias template
3301 primary_template_instantiation_p (const_tree t
)
3306 if (TREE_CODE (t
) == FUNCTION_DECL
)
3307 return DECL_LANG_SPECIFIC (t
)
3308 && DECL_TEMPLATE_INSTANTIATION (t
)
3309 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (t
));
3310 else if (CLASS_TYPE_P (t
) && !TYPE_DECL_ALIAS_P (TYPE_NAME (t
)))
3311 return CLASSTYPE_TEMPLATE_INSTANTIATION (t
)
3312 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (t
));
3313 else if (alias_template_specialization_p (t
))
3318 /* Return true if PARM is a template template parameter. */
3321 template_template_parameter_p (const_tree parm
)
3323 return DECL_TEMPLATE_TEMPLATE_PARM_P (parm
);
3326 /* Return true iff PARM is a DECL representing a type template
3330 template_type_parameter_p (const_tree parm
)
3333 && (TREE_CODE (parm
) == TYPE_DECL
3334 || TREE_CODE (parm
) == TEMPLATE_DECL
)
3335 && DECL_TEMPLATE_PARM_P (parm
));
3338 /* Return the template parameters of T if T is a
3339 primary template instantiation, NULL otherwise. */
3342 get_primary_template_innermost_parameters (const_tree t
)
3344 tree parms
= NULL
, template_info
= NULL
;
3346 if ((template_info
= get_template_info (t
))
3347 && primary_template_instantiation_p (t
))
3348 parms
= INNERMOST_TEMPLATE_PARMS
3349 (DECL_TEMPLATE_PARMS (TI_TEMPLATE (template_info
)));
3354 /* Return the template parameters of the LEVELth level from the full list
3355 of template parameters PARMS. */
3358 get_template_parms_at_level (tree parms
, int level
)
3362 || TREE_CODE (parms
) != TREE_LIST
3363 || level
> TMPL_PARMS_DEPTH (parms
))
3366 for (p
= parms
; p
; p
= TREE_CHAIN (p
))
3367 if (TMPL_PARMS_DEPTH (p
) == level
)
3373 /* Returns the template arguments of T if T is a template instantiation,
3377 get_template_innermost_arguments (const_tree t
)
3379 tree args
= NULL
, template_info
= NULL
;
3381 if ((template_info
= get_template_info (t
))
3382 && TI_ARGS (template_info
))
3383 args
= INNERMOST_TEMPLATE_ARGS (TI_ARGS (template_info
));
3388 /* Return the argument pack elements of T if T is a template argument pack,
3392 get_template_argument_pack_elems (const_tree t
)
3394 if (TREE_CODE (t
) != TYPE_ARGUMENT_PACK
3395 && TREE_CODE (t
) != NONTYPE_ARGUMENT_PACK
)
3398 return ARGUMENT_PACK_ARGS (t
);
3401 /* Structure used to track the progress of find_parameter_packs_r. */
3402 struct find_parameter_pack_data
3404 /* TREE_LIST that will contain all of the parameter packs found by
3406 tree
* parameter_packs
;
3408 /* Set of AST nodes that have been visited by the traversal. */
3409 hash_set
<tree
> *visited
;
3411 /* True iff we're making a type pack expansion. */
3412 bool type_pack_expansion_p
;
3415 /* Identifies all of the argument packs that occur in a template
3416 argument and appends them to the TREE_LIST inside DATA, which is a
3417 find_parameter_pack_data structure. This is a subroutine of
3418 make_pack_expansion and uses_parameter_packs. */
3420 find_parameter_packs_r (tree
*tp
, int *walk_subtrees
, void* data
)
3423 struct find_parameter_pack_data
* ppd
=
3424 (struct find_parameter_pack_data
*)data
;
3425 bool parameter_pack_p
= false;
3427 /* Handle type aliases/typedefs. */
3428 if (TYPE_ALIAS_P (t
))
3430 if (TYPE_TEMPLATE_INFO (t
))
3431 cp_walk_tree (&TYPE_TI_ARGS (t
),
3432 &find_parameter_packs_r
,
3438 /* Identify whether this is a parameter pack or not. */
3439 switch (TREE_CODE (t
))
3441 case TEMPLATE_PARM_INDEX
:
3442 if (TEMPLATE_PARM_PARAMETER_PACK (t
))
3443 parameter_pack_p
= true;
3446 case TEMPLATE_TYPE_PARM
:
3447 t
= TYPE_MAIN_VARIANT (t
);
3448 case TEMPLATE_TEMPLATE_PARM
:
3449 /* If the placeholder appears in the decl-specifier-seq of a function
3450 parameter pack (14.6.3), or the type-specifier-seq of a type-id that
3451 is a pack expansion, the invented template parameter is a template
3453 if (ppd
->type_pack_expansion_p
&& is_auto_or_concept (t
))
3454 TEMPLATE_TYPE_PARAMETER_PACK (t
) = true;
3455 if (TEMPLATE_TYPE_PARAMETER_PACK (t
))
3456 parameter_pack_p
= true;
3461 if (DECL_PACK_P (t
))
3463 /* We don't want to walk into the type of a PARM_DECL,
3464 because we don't want to see the type parameter pack. */
3466 parameter_pack_p
= true;
3470 /* Look through a lambda capture proxy to the field pack. */
3472 if (DECL_HAS_VALUE_EXPR_P (t
))
3474 tree v
= DECL_VALUE_EXPR (t
);
3476 &find_parameter_packs_r
,
3480 else if (variable_template_specialization_p (t
))
3482 cp_walk_tree (&DECL_TI_ARGS (t
),
3483 find_parameter_packs_r
,
3490 parameter_pack_p
= true;
3493 /* Not a parameter pack. */
3497 if (parameter_pack_p
)
3499 /* Add this parameter pack to the list. */
3500 *ppd
->parameter_packs
= tree_cons (NULL_TREE
, t
, *ppd
->parameter_packs
);
3504 cp_walk_tree (&TYPE_CONTEXT (t
),
3505 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3507 /* This switch statement will return immediately if we don't find a
3509 switch (TREE_CODE (t
))
3511 case TEMPLATE_PARM_INDEX
:
3514 case BOUND_TEMPLATE_TEMPLATE_PARM
:
3515 /* Check the template itself. */
3516 cp_walk_tree (&TREE_TYPE (TYPE_TI_TEMPLATE (t
)),
3517 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3518 /* Check the template arguments. */
3519 cp_walk_tree (&TYPE_TI_ARGS (t
), &find_parameter_packs_r
, ppd
,
3524 case TEMPLATE_TYPE_PARM
:
3525 case TEMPLATE_TEMPLATE_PARM
:
3532 if (TYPE_PTRMEMFUNC_P (t
))
3538 if (TYPE_TEMPLATE_INFO (t
))
3539 cp_walk_tree (&TYPE_TI_ARGS (t
),
3540 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3547 cp_walk_tree (&TREE_TYPE (t
),
3548 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3552 cp_walk_tree (&TYPENAME_TYPE_FULLNAME (t
), &find_parameter_packs_r
,
3557 case TYPE_PACK_EXPANSION
:
3558 case EXPR_PACK_EXPANSION
:
3563 cp_walk_tree (&TYPE_MAX_VALUE (t
), &find_parameter_packs_r
,
3568 case IDENTIFIER_NODE
:
3569 cp_walk_tree (&TREE_TYPE (t
), &find_parameter_packs_r
, ppd
,
3581 /* Determines if the expression or type T uses any parameter packs. */
3583 uses_parameter_packs (tree t
)
3585 tree parameter_packs
= NULL_TREE
;
3586 struct find_parameter_pack_data ppd
;
3587 ppd
.parameter_packs
= ¶meter_packs
;
3588 ppd
.visited
= new hash_set
<tree
>;
3589 ppd
.type_pack_expansion_p
= false;
3590 cp_walk_tree (&t
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
3592 return parameter_packs
!= NULL_TREE
;
3595 /* Turn ARG, which may be an expression, type, or a TREE_LIST
3596 representation a base-class initializer into a parameter pack
3597 expansion. If all goes well, the resulting node will be an
3598 EXPR_PACK_EXPANSION, TYPE_PACK_EXPANSION, or TREE_LIST,
3601 make_pack_expansion (tree arg
)
3604 tree parameter_packs
= NULL_TREE
;
3605 bool for_types
= false;
3606 struct find_parameter_pack_data ppd
;
3608 if (!arg
|| arg
== error_mark_node
)
3611 if (TREE_CODE (arg
) == TREE_LIST
&& TREE_PURPOSE (arg
))
3613 /* A TREE_LIST with a non-null TREE_PURPOSE is for a base
3614 class initializer. In this case, the TREE_PURPOSE will be a
3615 _TYPE node (representing the base class expansion we're
3616 initializing) and the TREE_VALUE will be a TREE_LIST
3617 containing the initialization arguments.
3619 The resulting expansion looks somewhat different from most
3620 expansions. Rather than returning just one _EXPANSION, we
3621 return a TREE_LIST whose TREE_PURPOSE is a
3622 TYPE_PACK_EXPANSION containing the bases that will be
3623 initialized. The TREE_VALUE will be identical to the
3624 original TREE_VALUE, which is a list of arguments that will
3625 be passed to each base. We do not introduce any new pack
3626 expansion nodes into the TREE_VALUE (although it is possible
3627 that some already exist), because the TREE_PURPOSE and
3628 TREE_VALUE all need to be expanded together with the same
3629 _EXPANSION node. Note that the TYPE_PACK_EXPANSION in the
3630 resulting TREE_PURPOSE will mention the parameter packs in
3631 both the bases and the arguments to the bases. */
3634 tree parameter_packs
= NULL_TREE
;
3636 /* Determine which parameter packs will be used by the base
3638 ppd
.visited
= new hash_set
<tree
>;
3639 ppd
.parameter_packs
= ¶meter_packs
;
3640 cp_walk_tree (&TREE_PURPOSE (arg
), &find_parameter_packs_r
,
3643 if (parameter_packs
== NULL_TREE
)
3645 error ("base initializer expansion %<%T%> contains no parameter packs", arg
);
3647 return error_mark_node
;
3650 if (TREE_VALUE (arg
) != void_type_node
)
3652 /* Collect the sets of parameter packs used in each of the
3653 initialization arguments. */
3654 for (value
= TREE_VALUE (arg
); value
; value
= TREE_CHAIN (value
))
3656 /* Determine which parameter packs will be expanded in this
3658 cp_walk_tree (&TREE_VALUE (value
), &find_parameter_packs_r
,
3665 /* Create the pack expansion type for the base type. */
3666 purpose
= cxx_make_type (TYPE_PACK_EXPANSION
);
3667 SET_PACK_EXPANSION_PATTERN (purpose
, TREE_PURPOSE (arg
));
3668 PACK_EXPANSION_PARAMETER_PACKS (purpose
) = parameter_packs
;
3670 /* Just use structural equality for these TYPE_PACK_EXPANSIONS;
3671 they will rarely be compared to anything. */
3672 SET_TYPE_STRUCTURAL_EQUALITY (purpose
);
3674 return tree_cons (purpose
, TREE_VALUE (arg
), NULL_TREE
);
3677 if (TYPE_P (arg
) || TREE_CODE (arg
) == TEMPLATE_DECL
)
3680 /* Build the PACK_EXPANSION_* node. */
3682 ? cxx_make_type (TYPE_PACK_EXPANSION
)
3683 : make_node (EXPR_PACK_EXPANSION
);
3684 SET_PACK_EXPANSION_PATTERN (result
, arg
);
3685 if (TREE_CODE (result
) == EXPR_PACK_EXPANSION
)
3687 /* Propagate type and const-expression information. */
3688 TREE_TYPE (result
) = TREE_TYPE (arg
);
3689 TREE_CONSTANT (result
) = TREE_CONSTANT (arg
);
3692 /* Just use structural equality for these TYPE_PACK_EXPANSIONS;
3693 they will rarely be compared to anything. */
3694 SET_TYPE_STRUCTURAL_EQUALITY (result
);
3696 /* Determine which parameter packs will be expanded. */
3697 ppd
.parameter_packs
= ¶meter_packs
;
3698 ppd
.visited
= new hash_set
<tree
>;
3699 ppd
.type_pack_expansion_p
= TYPE_P (arg
);
3700 cp_walk_tree (&arg
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
3703 /* Make sure we found some parameter packs. */
3704 if (parameter_packs
== NULL_TREE
)
3707 error ("expansion pattern %<%T%> contains no argument packs", arg
);
3709 error ("expansion pattern %<%E%> contains no argument packs", arg
);
3710 return error_mark_node
;
3712 PACK_EXPANSION_PARAMETER_PACKS (result
) = parameter_packs
;
3714 PACK_EXPANSION_LOCAL_P (result
) = at_function_scope_p ();
3719 /* Checks T for any "bare" parameter packs, which have not yet been
3720 expanded, and issues an error if any are found. This operation can
3721 only be done on full expressions or types (e.g., an expression
3722 statement, "if" condition, etc.), because we could have expressions like:
3724 foo(f(g(h(args)))...)
3726 where "args" is a parameter pack. check_for_bare_parameter_packs
3727 should not be called for the subexpressions args, h(args),
3728 g(h(args)), or f(g(h(args))), because we would produce erroneous
3731 Returns TRUE and emits an error if there were bare parameter packs,
3732 returns FALSE otherwise. */
3734 check_for_bare_parameter_packs (tree t
)
3736 tree parameter_packs
= NULL_TREE
;
3737 struct find_parameter_pack_data ppd
;
3739 if (!processing_template_decl
|| !t
|| t
== error_mark_node
)
3742 if (TREE_CODE (t
) == TYPE_DECL
)
3745 ppd
.parameter_packs
= ¶meter_packs
;
3746 ppd
.visited
= new hash_set
<tree
>;
3747 ppd
.type_pack_expansion_p
= false;
3748 cp_walk_tree (&t
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
3751 if (parameter_packs
)
3753 error ("parameter packs not expanded with %<...%>:");
3754 while (parameter_packs
)
3756 tree pack
= TREE_VALUE (parameter_packs
);
3757 tree name
= NULL_TREE
;
3759 if (TREE_CODE (pack
) == TEMPLATE_TYPE_PARM
3760 || TREE_CODE (pack
) == TEMPLATE_TEMPLATE_PARM
)
3761 name
= TYPE_NAME (pack
);
3762 else if (TREE_CODE (pack
) == TEMPLATE_PARM_INDEX
)
3763 name
= DECL_NAME (TEMPLATE_PARM_DECL (pack
));
3765 name
= DECL_NAME (pack
);
3768 inform (input_location
, " %qD", name
);
3770 inform (input_location
, " <anonymous>");
3772 parameter_packs
= TREE_CHAIN (parameter_packs
);
3781 /* Expand any parameter packs that occur in the template arguments in
3784 expand_template_argument_pack (tree args
)
3786 tree result_args
= NULL_TREE
;
3787 int in_arg
, out_arg
= 0, nargs
= args
? TREE_VEC_LENGTH (args
) : 0;
3788 int num_result_args
= -1;
3789 int non_default_args_count
= -1;
3791 /* First, determine if we need to expand anything, and the number of
3792 slots we'll need. */
3793 for (in_arg
= 0; in_arg
< nargs
; ++in_arg
)
3795 tree arg
= TREE_VEC_ELT (args
, in_arg
);
3796 if (arg
== NULL_TREE
)
3798 if (ARGUMENT_PACK_P (arg
))
3800 int num_packed
= TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg
));
3801 if (num_result_args
< 0)
3802 num_result_args
= in_arg
+ num_packed
;
3804 num_result_args
+= num_packed
;
3808 if (num_result_args
>= 0)
3813 /* If no expansion is necessary, we're done. */
3814 if (num_result_args
< 0)
3817 /* Expand arguments. */
3818 result_args
= make_tree_vec (num_result_args
);
3819 if (NON_DEFAULT_TEMPLATE_ARGS_COUNT (args
))
3820 non_default_args_count
=
3821 GET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (args
);
3822 for (in_arg
= 0; in_arg
< nargs
; ++in_arg
)
3824 tree arg
= TREE_VEC_ELT (args
, in_arg
);
3825 if (ARGUMENT_PACK_P (arg
))
3827 tree packed
= ARGUMENT_PACK_ARGS (arg
);
3828 int i
, num_packed
= TREE_VEC_LENGTH (packed
);
3829 for (i
= 0; i
< num_packed
; ++i
, ++out_arg
)
3830 TREE_VEC_ELT (result_args
, out_arg
) = TREE_VEC_ELT(packed
, i
);
3831 if (non_default_args_count
> 0)
3832 non_default_args_count
+= num_packed
- 1;
3836 TREE_VEC_ELT (result_args
, out_arg
) = arg
;
3840 if (non_default_args_count
>= 0)
3841 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (result_args
, non_default_args_count
);
3845 /* Checks if DECL shadows a template parameter.
3847 [temp.local]: A template-parameter shall not be redeclared within its
3848 scope (including nested scopes).
3850 Emits an error and returns TRUE if the DECL shadows a parameter,
3851 returns FALSE otherwise. */
3854 check_template_shadow (tree decl
)
3858 /* If we're not in a template, we can't possibly shadow a template
3860 if (!current_template_parms
)
3863 /* Figure out what we're shadowing. */
3864 if (TREE_CODE (decl
) == OVERLOAD
)
3865 decl
= OVL_CURRENT (decl
);
3866 olddecl
= innermost_non_namespace_value (DECL_NAME (decl
));
3868 /* If there's no previous binding for this name, we're not shadowing
3869 anything, let alone a template parameter. */
3873 /* If we're not shadowing a template parameter, we're done. Note
3874 that OLDDECL might be an OVERLOAD (or perhaps even an
3875 ERROR_MARK), so we can't just blithely assume it to be a _DECL
3877 if (!DECL_P (olddecl
) || !DECL_TEMPLATE_PARM_P (olddecl
))
3880 /* We check for decl != olddecl to avoid bogus errors for using a
3881 name inside a class. We check TPFI to avoid duplicate errors for
3882 inline member templates. */
3884 || (DECL_TEMPLATE_PARM_P (decl
)
3885 && TEMPLATE_PARMS_FOR_INLINE (current_template_parms
)))
3888 /* Don't complain about the injected class name, as we've already
3889 complained about the class itself. */
3890 if (DECL_SELF_REFERENCE_P (decl
))
3893 if (DECL_TEMPLATE_PARM_P (decl
))
3894 error ("declaration of template parameter %q+D shadows "
3895 "template parameter", decl
);
3897 error ("declaration of %q+#D shadows template parameter", decl
);
3898 inform (DECL_SOURCE_LOCATION (olddecl
),
3899 "template parameter %qD declared here", olddecl
);
3903 /* Return a new TEMPLATE_PARM_INDEX with the indicated INDEX, LEVEL,
3904 ORIG_LEVEL, DECL, and TYPE. */
3907 build_template_parm_index (int index
,
3913 tree t
= make_node (TEMPLATE_PARM_INDEX
);
3914 TEMPLATE_PARM_IDX (t
) = index
;
3915 TEMPLATE_PARM_LEVEL (t
) = level
;
3916 TEMPLATE_PARM_ORIG_LEVEL (t
) = orig_level
;
3917 TEMPLATE_PARM_DECL (t
) = decl
;
3918 TREE_TYPE (t
) = type
;
3919 TREE_CONSTANT (t
) = TREE_CONSTANT (decl
);
3920 TREE_READONLY (t
) = TREE_READONLY (decl
);
3925 /* Find the canonical type parameter for the given template type
3926 parameter. Returns the canonical type parameter, which may be TYPE
3927 if no such parameter existed. */
3930 canonical_type_parameter (tree type
)
3933 int idx
= TEMPLATE_TYPE_IDX (type
);
3934 if (!canonical_template_parms
)
3935 vec_alloc (canonical_template_parms
, idx
+1);
3937 while (canonical_template_parms
->length () <= (unsigned)idx
)
3938 vec_safe_push (canonical_template_parms
, NULL_TREE
);
3940 list
= (*canonical_template_parms
)[idx
];
3941 while (list
&& !comptypes (type
, TREE_VALUE (list
), COMPARE_STRUCTURAL
))
3942 list
= TREE_CHAIN (list
);
3945 return TREE_VALUE (list
);
3948 (*canonical_template_parms
)[idx
]
3949 = tree_cons (NULL_TREE
, type
,
3950 (*canonical_template_parms
)[idx
]);
3955 /* Return a TEMPLATE_PARM_INDEX, similar to INDEX, but whose
3956 TEMPLATE_PARM_LEVEL has been decreased by LEVELS. If such a
3957 TEMPLATE_PARM_INDEX already exists, it is returned; otherwise, a
3958 new one is created. */
3961 reduce_template_parm_level (tree index
, tree type
, int levels
, tree args
,
3962 tsubst_flags_t complain
)
3964 if (TEMPLATE_PARM_DESCENDANTS (index
) == NULL_TREE
3965 || (TEMPLATE_PARM_LEVEL (TEMPLATE_PARM_DESCENDANTS (index
))
3966 != TEMPLATE_PARM_LEVEL (index
) - levels
)
3967 || !same_type_p (type
, TREE_TYPE (TEMPLATE_PARM_DESCENDANTS (index
))))
3969 tree orig_decl
= TEMPLATE_PARM_DECL (index
);
3972 decl
= build_decl (DECL_SOURCE_LOCATION (orig_decl
),
3973 TREE_CODE (orig_decl
), DECL_NAME (orig_decl
), type
);
3974 TREE_CONSTANT (decl
) = TREE_CONSTANT (orig_decl
);
3975 TREE_READONLY (decl
) = TREE_READONLY (orig_decl
);
3976 DECL_ARTIFICIAL (decl
) = 1;
3977 SET_DECL_TEMPLATE_PARM_P (decl
);
3979 t
= build_template_parm_index (TEMPLATE_PARM_IDX (index
),
3980 TEMPLATE_PARM_LEVEL (index
) - levels
,
3981 TEMPLATE_PARM_ORIG_LEVEL (index
),
3983 TEMPLATE_PARM_DESCENDANTS (index
) = t
;
3984 TEMPLATE_PARM_PARAMETER_PACK (t
)
3985 = TEMPLATE_PARM_PARAMETER_PACK (index
);
3987 /* Template template parameters need this. */
3988 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
3990 DECL_TEMPLATE_RESULT (decl
)
3991 = build_decl (DECL_SOURCE_LOCATION (decl
),
3992 TYPE_DECL
, DECL_NAME (decl
), type
);
3993 DECL_ARTIFICIAL (DECL_TEMPLATE_RESULT (decl
)) = true;
3994 DECL_TEMPLATE_PARMS (decl
) = tsubst_template_parms
3995 (DECL_TEMPLATE_PARMS (orig_decl
), args
, complain
);
3999 return TEMPLATE_PARM_DESCENDANTS (index
);
4002 /* Process information from new template parameter PARM and append it
4003 to the LIST being built. This new parameter is a non-type
4004 parameter iff IS_NON_TYPE is true. This new parameter is a
4005 parameter pack iff IS_PARAMETER_PACK is true. The location of PARM
4009 process_template_parm (tree list
, location_t parm_loc
, tree parm
,
4010 bool is_non_type
, bool is_parameter_pack
)
4015 gcc_assert (TREE_CODE (parm
) == TREE_LIST
);
4016 tree defval
= TREE_PURPOSE (parm
);
4017 tree constr
= TREE_TYPE (parm
);
4021 tree p
= tree_last (list
);
4023 if (p
&& TREE_VALUE (p
) != error_mark_node
)
4026 if (TREE_CODE (p
) == TYPE_DECL
|| TREE_CODE (p
) == TEMPLATE_DECL
)
4027 idx
= TEMPLATE_TYPE_IDX (TREE_TYPE (p
));
4029 idx
= TEMPLATE_PARM_IDX (DECL_INITIAL (p
));
4037 parm
= TREE_VALUE (parm
);
4039 SET_DECL_TEMPLATE_PARM_P (parm
);
4041 if (TREE_TYPE (parm
) != error_mark_node
)
4045 The top-level cv-qualifiers on the template-parameter are
4046 ignored when determining its type. */
4047 TREE_TYPE (parm
) = TYPE_MAIN_VARIANT (TREE_TYPE (parm
));
4048 if (invalid_nontype_parm_type_p (TREE_TYPE (parm
), 1))
4049 TREE_TYPE (parm
) = error_mark_node
;
4050 else if (uses_parameter_packs (TREE_TYPE (parm
))
4051 && !is_parameter_pack
4052 /* If we're in a nested template parameter list, the template
4053 template parameter could be a parameter pack. */
4054 && processing_template_parmlist
== 1)
4056 /* This template parameter is not a parameter pack, but it
4057 should be. Complain about "bare" parameter packs. */
4058 check_for_bare_parameter_packs (TREE_TYPE (parm
));
4060 /* Recover by calling this a parameter pack. */
4061 is_parameter_pack
= true;
4065 /* A template parameter is not modifiable. */
4066 TREE_CONSTANT (parm
) = 1;
4067 TREE_READONLY (parm
) = 1;
4068 decl
= build_decl (parm_loc
,
4069 CONST_DECL
, DECL_NAME (parm
), TREE_TYPE (parm
));
4070 TREE_CONSTANT (decl
) = 1;
4071 TREE_READONLY (decl
) = 1;
4072 DECL_INITIAL (parm
) = DECL_INITIAL (decl
)
4073 = build_template_parm_index (idx
, processing_template_decl
,
4074 processing_template_decl
,
4075 decl
, TREE_TYPE (parm
));
4077 TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
))
4078 = is_parameter_pack
;
4083 parm
= TREE_VALUE (TREE_VALUE (parm
));
4085 if (parm
&& TREE_CODE (parm
) == TEMPLATE_DECL
)
4087 t
= cxx_make_type (TEMPLATE_TEMPLATE_PARM
);
4088 /* This is for distinguishing between real templates and template
4089 template parameters */
4090 TREE_TYPE (parm
) = t
;
4091 TREE_TYPE (DECL_TEMPLATE_RESULT (parm
)) = t
;
4096 t
= cxx_make_type (TEMPLATE_TYPE_PARM
);
4097 /* parm is either IDENTIFIER_NODE or NULL_TREE. */
4098 decl
= build_decl (parm_loc
,
4099 TYPE_DECL
, parm
, t
);
4102 TYPE_NAME (t
) = decl
;
4103 TYPE_STUB_DECL (t
) = decl
;
4105 TEMPLATE_TYPE_PARM_INDEX (t
)
4106 = build_template_parm_index (idx
, processing_template_decl
,
4107 processing_template_decl
,
4108 decl
, TREE_TYPE (parm
));
4109 TEMPLATE_TYPE_PARAMETER_PACK (t
) = is_parameter_pack
;
4110 TYPE_CANONICAL (t
) = canonical_type_parameter (t
);
4112 DECL_ARTIFICIAL (decl
) = 1;
4113 SET_DECL_TEMPLATE_PARM_P (decl
);
4115 /* Build requirements for the type/template parameter.
4116 This must be done after SET_DECL_TEMPLATE_PARM_P or
4117 process_template_parm could fail. */
4118 tree reqs
= finish_shorthand_constraint (parm
, constr
);
4122 /* Build the parameter node linking the parameter declaration,
4123 its default argument (if any), and its constraints (if any). */
4124 parm
= build_tree_list (defval
, parm
);
4125 TEMPLATE_PARM_CONSTRAINTS (parm
) = reqs
;
4127 return chainon (list
, parm
);
4130 /* The end of a template parameter list has been reached. Process the
4131 tree list into a parameter vector, converting each parameter into a more
4132 useful form. Type parameters are saved as IDENTIFIER_NODEs, and others
4136 end_template_parm_list (tree parms
)
4140 tree saved_parmlist
= make_tree_vec (list_length (parms
));
4142 /* Pop the dummy parameter level and add the real one. */
4143 current_template_parms
= TREE_CHAIN (current_template_parms
);
4145 current_template_parms
4146 = tree_cons (size_int (processing_template_decl
),
4147 saved_parmlist
, current_template_parms
);
4149 for (parm
= parms
, nparms
= 0; parm
; parm
= next
, nparms
++)
4151 next
= TREE_CHAIN (parm
);
4152 TREE_VEC_ELT (saved_parmlist
, nparms
) = parm
;
4153 TREE_CHAIN (parm
) = NULL_TREE
;
4156 --processing_template_parmlist
;
4158 return saved_parmlist
;
4161 // Explicitly indicate the end of the template parameter list. We assume
4162 // that the current template parameters have been constructed and/or
4163 // managed explicitly, as when creating new template template parameters
4164 // from a shorthand constraint.
4166 end_template_parm_list ()
4168 --processing_template_parmlist
;
4171 /* end_template_decl is called after a template declaration is seen. */
4174 end_template_decl (void)
4176 reset_specialization ();
4178 if (! processing_template_decl
)
4181 /* This matches the pushlevel in begin_template_parm_list. */
4184 --processing_template_decl
;
4185 current_template_parms
= TREE_CHAIN (current_template_parms
);
4188 /* Takes a TREE_LIST representing a template parameter and convert it
4189 into an argument suitable to be passed to the type substitution
4190 functions. Note that If the TREE_LIST contains an error_mark
4191 node, the returned argument is error_mark_node. */
4194 template_parm_to_arg (tree t
)
4198 || TREE_CODE (t
) != TREE_LIST
)
4201 if (error_operand_p (TREE_VALUE (t
)))
4202 return error_mark_node
;
4206 if (TREE_CODE (t
) == TYPE_DECL
4207 || TREE_CODE (t
) == TEMPLATE_DECL
)
4211 if (TEMPLATE_TYPE_PARAMETER_PACK (t
))
4213 /* Turn this argument into a TYPE_ARGUMENT_PACK
4214 with a single element, which expands T. */
4215 tree vec
= make_tree_vec (1);
4216 #ifdef ENABLE_CHECKING
4217 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT
4218 (vec
, TREE_VEC_LENGTH (vec
));
4220 TREE_VEC_ELT (vec
, 0) = make_pack_expansion (t
);
4222 t
= cxx_make_type (TYPE_ARGUMENT_PACK
);
4223 SET_ARGUMENT_PACK_ARGS (t
, vec
);
4228 t
= DECL_INITIAL (t
);
4230 if (TEMPLATE_PARM_PARAMETER_PACK (t
))
4232 /* Turn this argument into a NONTYPE_ARGUMENT_PACK
4233 with a single element, which expands T. */
4234 tree vec
= make_tree_vec (1);
4235 tree type
= TREE_TYPE (TEMPLATE_PARM_DECL (t
));
4236 #ifdef ENABLE_CHECKING
4237 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT
4238 (vec
, TREE_VEC_LENGTH (vec
));
4240 t
= convert_from_reference (t
);
4241 TREE_VEC_ELT (vec
, 0) = make_pack_expansion (t
);
4243 t
= make_node (NONTYPE_ARGUMENT_PACK
);
4244 SET_ARGUMENT_PACK_ARGS (t
, vec
);
4245 TREE_TYPE (t
) = type
;
4248 t
= convert_from_reference (t
);
4253 /* Given a set of template parameters, return them as a set of template
4254 arguments. The template parameters are represented as a TREE_VEC, in
4255 the form documented in cp-tree.h for template arguments. */
4258 template_parms_to_args (tree parms
)
4261 tree args
= NULL_TREE
;
4262 int length
= TMPL_PARMS_DEPTH (parms
);
4265 /* If there is only one level of template parameters, we do not
4266 create a TREE_VEC of TREE_VECs. Instead, we return a single
4267 TREE_VEC containing the arguments. */
4269 args
= make_tree_vec (length
);
4271 for (header
= parms
; header
; header
= TREE_CHAIN (header
))
4273 tree a
= copy_node (TREE_VALUE (header
));
4276 TREE_TYPE (a
) = NULL_TREE
;
4277 for (i
= TREE_VEC_LENGTH (a
) - 1; i
>= 0; --i
)
4278 TREE_VEC_ELT (a
, i
) = template_parm_to_arg (TREE_VEC_ELT (a
, i
));
4280 #ifdef ENABLE_CHECKING
4281 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (a
, TREE_VEC_LENGTH (a
));
4285 TREE_VEC_ELT (args
, --l
) = a
;
4293 /* Within the declaration of a template, return the currently active
4294 template parameters as an argument TREE_VEC. */
4297 current_template_args (void)
4299 return template_parms_to_args (current_template_parms
);
4302 /* Update the declared TYPE by doing any lookups which were thought to be
4303 dependent, but are not now that we know the SCOPE of the declarator. */
4306 maybe_update_decl_type (tree orig_type
, tree scope
)
4308 tree type
= orig_type
;
4310 if (type
== NULL_TREE
)
4313 if (TREE_CODE (orig_type
) == TYPE_DECL
)
4314 type
= TREE_TYPE (type
);
4316 if (scope
&& TYPE_P (scope
) && dependent_type_p (scope
)
4317 && dependent_type_p (type
)
4318 /* Don't bother building up the args in this case. */
4319 && TREE_CODE (type
) != TEMPLATE_TYPE_PARM
)
4321 /* tsubst in the args corresponding to the template parameters,
4322 including auto if present. Most things will be unchanged, but
4323 make_typename_type and tsubst_qualified_id will resolve
4324 TYPENAME_TYPEs and SCOPE_REFs that were previously dependent. */
4325 tree args
= current_template_args ();
4326 tree auto_node
= type_uses_auto (type
);
4330 tree auto_vec
= make_tree_vec (1);
4331 TREE_VEC_ELT (auto_vec
, 0) = auto_node
;
4332 args
= add_to_template_args (args
, auto_vec
);
4334 pushed
= push_scope (scope
);
4335 type
= tsubst (type
, args
, tf_warning_or_error
, NULL_TREE
);
4340 if (type
== error_mark_node
)
4343 if (TREE_CODE (orig_type
) == TYPE_DECL
)
4345 if (same_type_p (type
, TREE_TYPE (orig_type
)))
4348 type
= TYPE_NAME (type
);
4353 /* Return a TEMPLATE_DECL corresponding to DECL, using the indicated
4354 template PARMS and constraints, CONSTR. If MEMBER_TEMPLATE_P is true,
4355 the new template is a member template. */
4358 build_template_decl (tree decl
, tree parms
, bool member_template_p
)
4360 tree tmpl
= build_lang_decl (TEMPLATE_DECL
, DECL_NAME (decl
), NULL_TREE
);
4361 DECL_TEMPLATE_PARMS (tmpl
) = parms
;
4362 DECL_CONTEXT (tmpl
) = DECL_CONTEXT (decl
);
4363 DECL_SOURCE_LOCATION (tmpl
) = DECL_SOURCE_LOCATION (decl
);
4364 DECL_MEMBER_TEMPLATE_P (tmpl
) = member_template_p
;
4369 struct template_parm_data
4371 /* The level of the template parameters we are currently
4375 /* The index of the specialization argument we are currently
4379 /* An array whose size is the number of template parameters. The
4380 elements are nonzero if the parameter has been used in any one
4381 of the arguments processed so far. */
4384 /* An array whose size is the number of template arguments. The
4385 elements are nonzero if the argument makes use of template
4386 parameters of this level. */
4387 int* arg_uses_template_parms
;
4390 /* Subroutine of push_template_decl used to see if each template
4391 parameter in a partial specialization is used in the explicit
4392 argument list. If T is of the LEVEL given in DATA (which is
4393 treated as a template_parm_data*), then DATA->PARMS is marked
4397 mark_template_parm (tree t
, void* data
)
4401 struct template_parm_data
* tpd
= (struct template_parm_data
*) data
;
4403 template_parm_level_and_index (t
, &level
, &idx
);
4405 if (level
== tpd
->level
)
4407 tpd
->parms
[idx
] = 1;
4408 tpd
->arg_uses_template_parms
[tpd
->current_arg
] = 1;
4411 /* Return zero so that for_each_template_parm will continue the
4412 traversal of the tree; we want to mark *every* template parm. */
4416 /* Process the partial specialization DECL. */
4419 process_partial_specialization (tree decl
)
4421 tree type
= TREE_TYPE (decl
);
4422 tree tinfo
= get_template_info (decl
);
4423 tree maintmpl
= TI_TEMPLATE (tinfo
);
4424 tree specargs
= TI_ARGS (tinfo
);
4425 tree inner_args
= INNERMOST_TEMPLATE_ARGS (specargs
);
4426 tree main_inner_parms
= DECL_INNERMOST_TEMPLATE_PARMS (maintmpl
);
4429 int nargs
= TREE_VEC_LENGTH (inner_args
);
4432 bool did_error_intro
= false;
4433 struct template_parm_data tpd
;
4434 struct template_parm_data tpd2
;
4436 gcc_assert (current_template_parms
);
4438 /* A concept cannot be specialized. */
4439 if (flag_concepts
&& variable_concept_p (maintmpl
))
4441 error ("specialization of variable concept %q#D", maintmpl
);
4442 return error_mark_node
;
4445 inner_parms
= INNERMOST_TEMPLATE_PARMS (current_template_parms
);
4446 ntparms
= TREE_VEC_LENGTH (inner_parms
);
4448 /* We check that each of the template parameters given in the
4449 partial specialization is used in the argument list to the
4450 specialization. For example:
4452 template <class T> struct S;
4453 template <class T> struct S<T*>;
4455 The second declaration is OK because `T*' uses the template
4456 parameter T, whereas
4458 template <class T> struct S<int>;
4460 is no good. Even trickier is:
4471 The S2<T> declaration is actually invalid; it is a
4472 full-specialization. Of course,
4475 struct S2<T (*)(U)>;
4477 or some such would have been OK. */
4478 tpd
.level
= TMPL_PARMS_DEPTH (current_template_parms
);
4479 tpd
.parms
= XALLOCAVEC (int, ntparms
);
4480 memset (tpd
.parms
, 0, sizeof (int) * ntparms
);
4482 tpd
.arg_uses_template_parms
= XALLOCAVEC (int, nargs
);
4483 memset (tpd
.arg_uses_template_parms
, 0, sizeof (int) * nargs
);
4484 for (i
= 0; i
< nargs
; ++i
)
4486 tpd
.current_arg
= i
;
4487 for_each_template_parm (TREE_VEC_ELT (inner_args
, i
),
4488 &mark_template_parm
,
4491 /*include_nondeduced_p=*/false);
4493 for (i
= 0; i
< ntparms
; ++i
)
4494 if (tpd
.parms
[i
] == 0)
4496 /* One of the template parms was not used in a deduced context in the
4498 if (!did_error_intro
)
4500 error ("template parameters not deducible in "
4501 "partial specialization:");
4502 did_error_intro
= true;
4505 inform (input_location
, " %qD",
4506 TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
)));
4509 if (did_error_intro
)
4510 return error_mark_node
;
4512 /* [temp.class.spec]
4514 The argument list of the specialization shall not be identical to
4515 the implicit argument list of the primary template. */
4517 = TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (maintmpl
)));
4518 if (comp_template_args (inner_args
, INNERMOST_TEMPLATE_ARGS (main_args
))
4520 || !subsumes_constraints (current_template_constraints (),
4521 get_constraints (maintmpl
))))
4524 error ("partial specialization %q+D does not specialize "
4525 "any template arguments", decl
);
4527 error ("partial specialization %q+D does not specialize any "
4528 "template arguments and is not more constrained than", decl
);
4529 inform (DECL_SOURCE_LOCATION (maintmpl
), "primary template here");
4532 /* A partial specialization that replaces multiple parameters of the
4533 primary template with a pack expansion is less specialized for those
4535 if (nargs
< DECL_NTPARMS (maintmpl
))
4537 error ("partial specialization is not more specialized than the "
4538 "primary template because it replaces multiple parameters "
4539 "with a pack expansion");
4540 inform (DECL_SOURCE_LOCATION (maintmpl
), "primary template here");
4544 /* [temp.class.spec]
4546 A partially specialized non-type argument expression shall not
4547 involve template parameters of the partial specialization except
4548 when the argument expression is a simple identifier.
4550 The type of a template parameter corresponding to a specialized
4551 non-type argument shall not be dependent on a parameter of the
4554 Also, we verify that pack expansions only occur at the
4555 end of the argument list. */
4556 gcc_assert (nargs
== DECL_NTPARMS (maintmpl
));
4558 for (i
= 0; i
< nargs
; ++i
)
4560 tree parm
= TREE_VALUE (TREE_VEC_ELT (main_inner_parms
, i
));
4561 tree arg
= TREE_VEC_ELT (inner_args
, i
);
4562 tree packed_args
= NULL_TREE
;
4565 if (ARGUMENT_PACK_P (arg
))
4567 /* Extract the arguments from the argument pack. We'll be
4568 iterating over these in the following loop. */
4569 packed_args
= ARGUMENT_PACK_ARGS (arg
);
4570 len
= TREE_VEC_LENGTH (packed_args
);
4573 for (j
= 0; j
< len
; j
++)
4576 /* Get the Jth argument in the parameter pack. */
4577 arg
= TREE_VEC_ELT (packed_args
, j
);
4579 if (PACK_EXPANSION_P (arg
))
4581 /* Pack expansions must come at the end of the
4583 if ((packed_args
&& j
< len
- 1)
4584 || (!packed_args
&& i
< nargs
- 1))
4586 if (TREE_CODE (arg
) == EXPR_PACK_EXPANSION
)
4587 error ("parameter pack argument %qE must be at the "
4588 "end of the template argument list", arg
);
4590 error ("parameter pack argument %qT must be at the "
4591 "end of the template argument list", arg
);
4595 if (TREE_CODE (arg
) == EXPR_PACK_EXPANSION
)
4596 /* We only care about the pattern. */
4597 arg
= PACK_EXPANSION_PATTERN (arg
);
4599 if (/* These first two lines are the `non-type' bit. */
4601 && TREE_CODE (arg
) != TEMPLATE_DECL
4602 /* This next two lines are the `argument expression is not just a
4603 simple identifier' condition and also the `specialized
4604 non-type argument' bit. */
4605 && TREE_CODE (arg
) != TEMPLATE_PARM_INDEX
4606 && !(REFERENCE_REF_P (arg
)
4607 && TREE_CODE (TREE_OPERAND (arg
, 0)) == TEMPLATE_PARM_INDEX
))
4609 if ((!packed_args
&& tpd
.arg_uses_template_parms
[i
])
4610 || (packed_args
&& uses_template_parms (arg
)))
4611 error ("template argument %qE involves template parameter(s)",
4615 /* Look at the corresponding template parameter,
4616 marking which template parameters its type depends
4618 tree type
= TREE_TYPE (parm
);
4622 /* We haven't yet initialized TPD2. Do so now. */
4623 tpd2
.arg_uses_template_parms
= XALLOCAVEC (int, nargs
);
4624 /* The number of parameters here is the number in the
4625 main template, which, as checked in the assertion
4627 tpd2
.parms
= XALLOCAVEC (int, nargs
);
4629 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (maintmpl
));
4632 /* Mark the template parameters. But this time, we're
4633 looking for the template parameters of the main
4634 template, not in the specialization. */
4635 tpd2
.current_arg
= i
;
4636 tpd2
.arg_uses_template_parms
[i
] = 0;
4637 memset (tpd2
.parms
, 0, sizeof (int) * nargs
);
4638 for_each_template_parm (type
,
4639 &mark_template_parm
,
4642 /*include_nondeduced_p=*/false);
4644 if (tpd2
.arg_uses_template_parms
[i
])
4646 /* The type depended on some template parameters.
4647 If they are fully specialized in the
4648 specialization, that's OK. */
4651 for (j
= 0; j
< nargs
; ++j
)
4652 if (tpd2
.parms
[j
] != 0
4653 && tpd
.arg_uses_template_parms
[j
])
4656 error_n (input_location
, count
,
4657 "type %qT of template argument %qE depends "
4658 "on a template parameter",
4659 "type %qT of template argument %qE depends "
4660 "on template parameters",
4669 /* We should only get here once. */
4670 if (TREE_CODE (decl
) == TYPE_DECL
)
4671 gcc_assert (!COMPLETE_TYPE_P (type
));
4673 // Build the template decl.
4674 tree tmpl
= build_template_decl (decl
, current_template_parms
,
4675 DECL_MEMBER_TEMPLATE_P (maintmpl
));
4676 TREE_TYPE (tmpl
) = type
;
4677 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
4678 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
4679 DECL_TEMPLATE_INFO (tmpl
) = build_template_info (maintmpl
, specargs
);
4680 DECL_PRIMARY_TEMPLATE (tmpl
) = maintmpl
;
4683 /* We didn't register this in check_explicit_specialization so we could
4684 wait until the constraints were set. */
4685 decl
= register_specialization (decl
, maintmpl
, specargs
, false, 0);
4687 associate_classtype_constraints (type
);
4689 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)
4690 = tree_cons (specargs
, tmpl
,
4691 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
));
4692 TREE_TYPE (DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)) = type
;
4694 for (inst
= DECL_TEMPLATE_INSTANTIATIONS (maintmpl
); inst
;
4695 inst
= TREE_CHAIN (inst
))
4697 tree instance
= TREE_VALUE (inst
);
4698 if (TYPE_P (instance
)
4699 ? (COMPLETE_TYPE_P (instance
)
4700 && CLASSTYPE_IMPLICIT_INSTANTIATION (instance
))
4701 : DECL_TEMPLATE_INSTANTIATION (instance
))
4703 tree spec
= most_specialized_partial_spec (instance
, tf_none
);
4704 tree inst_decl
= (DECL_P (instance
)
4705 ? instance
: TYPE_NAME (instance
));
4708 else if (spec
== error_mark_node
)
4709 permerror (input_location
,
4710 "declaration of %qD ambiguates earlier template "
4711 "instantiation for %qD", decl
, inst_decl
);
4712 else if (TREE_VALUE (spec
) == tmpl
)
4713 permerror (input_location
,
4714 "partial specialization of %qD after instantiation "
4715 "of %qD", decl
, inst_decl
);
4722 /* PARM is a template parameter of some form; return the corresponding
4723 TEMPLATE_PARM_INDEX. */
4726 get_template_parm_index (tree parm
)
4728 if (TREE_CODE (parm
) == PARM_DECL
4729 || TREE_CODE (parm
) == CONST_DECL
)
4730 parm
= DECL_INITIAL (parm
);
4731 else if (TREE_CODE (parm
) == TYPE_DECL
4732 || TREE_CODE (parm
) == TEMPLATE_DECL
)
4733 parm
= TREE_TYPE (parm
);
4734 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
4735 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
4736 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
)
4737 parm
= TEMPLATE_TYPE_PARM_INDEX (parm
);
4738 gcc_assert (TREE_CODE (parm
) == TEMPLATE_PARM_INDEX
);
4742 /* Subroutine of fixed_parameter_pack_p below. Look for any template
4743 parameter packs used by the template parameter PARM. */
4746 fixed_parameter_pack_p_1 (tree parm
, struct find_parameter_pack_data
*ppd
)
4748 /* A type parm can't refer to another parm. */
4749 if (TREE_CODE (parm
) == TYPE_DECL
)
4751 else if (TREE_CODE (parm
) == PARM_DECL
)
4753 cp_walk_tree (&TREE_TYPE (parm
), &find_parameter_packs_r
,
4758 gcc_assert (TREE_CODE (parm
) == TEMPLATE_DECL
);
4760 tree vec
= INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (parm
));
4761 for (int i
= 0; i
< TREE_VEC_LENGTH (vec
); ++i
)
4762 fixed_parameter_pack_p_1 (TREE_VALUE (TREE_VEC_ELT (vec
, i
)), ppd
);
4765 /* PARM is a template parameter pack. Return any parameter packs used in
4766 its type or the type of any of its template parameters. If there are
4767 any such packs, it will be instantiated into a fixed template parameter
4768 list by partial instantiation rather than be fully deduced. */
4771 fixed_parameter_pack_p (tree parm
)
4773 /* This can only be true in a member template. */
4774 if (TEMPLATE_PARM_ORIG_LEVEL (get_template_parm_index (parm
)) < 2)
4776 /* This can only be true for a parameter pack. */
4777 if (!template_parameter_pack_p (parm
))
4779 /* A type parm can't refer to another parm. */
4780 if (TREE_CODE (parm
) == TYPE_DECL
)
4783 tree parameter_packs
= NULL_TREE
;
4784 struct find_parameter_pack_data ppd
;
4785 ppd
.parameter_packs
= ¶meter_packs
;
4786 ppd
.visited
= new hash_set
<tree
>;
4787 ppd
.type_pack_expansion_p
= false;
4789 fixed_parameter_pack_p_1 (parm
, &ppd
);
4792 return parameter_packs
;
4795 /* Check that a template declaration's use of default arguments and
4796 parameter packs is not invalid. Here, PARMS are the template
4797 parameters. IS_PRIMARY is true if DECL is the thing declared by
4798 a primary template. IS_PARTIAL is true if DECL is a partial
4801 IS_FRIEND_DECL is nonzero if DECL is a friend function template
4802 declaration (but not a definition); 1 indicates a declaration, 2
4803 indicates a redeclaration. When IS_FRIEND_DECL=2, no errors are
4804 emitted for extraneous default arguments.
4806 Returns TRUE if there were no errors found, FALSE otherwise. */
4809 check_default_tmpl_args (tree decl
, tree parms
, bool is_primary
,
4810 bool is_partial
, int is_friend_decl
)
4813 int last_level_to_check
;
4815 bool no_errors
= true;
4819 A default template-argument shall not be specified in a
4820 function template declaration or a function template definition, nor
4821 in the template-parameter-list of the definition of a member of a
4824 if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == FUNCTION_DECL
4825 || (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_LOCAL_FUNCTION_P (decl
)))
4826 /* You can't have a function template declaration in a local
4827 scope, nor you can you define a member of a class template in a
4831 if ((TREE_CODE (decl
) == TYPE_DECL
4833 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
4834 || (TREE_CODE (decl
) == FUNCTION_DECL
4835 && LAMBDA_FUNCTION_P (decl
)))
4836 /* A lambda doesn't have an explicit declaration; don't complain
4837 about the parms of the enclosing class. */
4840 if (current_class_type
4841 && !TYPE_BEING_DEFINED (current_class_type
)
4842 && DECL_LANG_SPECIFIC (decl
)
4843 && DECL_DECLARES_FUNCTION_P (decl
)
4844 /* If this is either a friend defined in the scope of the class
4845 or a member function. */
4846 && (DECL_FUNCTION_MEMBER_P (decl
)
4847 ? same_type_p (DECL_CONTEXT (decl
), current_class_type
)
4848 : DECL_FRIEND_CONTEXT (decl
)
4849 ? same_type_p (DECL_FRIEND_CONTEXT (decl
), current_class_type
)
4851 /* And, if it was a member function, it really was defined in
4852 the scope of the class. */
4853 && (!DECL_FUNCTION_MEMBER_P (decl
)
4854 || DECL_INITIALIZED_IN_CLASS_P (decl
)))
4855 /* We already checked these parameters when the template was
4856 declared, so there's no need to do it again now. This function
4857 was defined in class scope, but we're processing its body now
4858 that the class is complete. */
4861 /* Core issue 226 (C++0x only): the following only applies to class
4864 && ((cxx_dialect
== cxx98
) || TREE_CODE (decl
) != FUNCTION_DECL
))
4868 If a template-parameter has a default template-argument, all
4869 subsequent template-parameters shall have a default
4870 template-argument supplied. */
4871 for (parm_level
= parms
; parm_level
; parm_level
= TREE_CHAIN (parm_level
))
4873 tree inner_parms
= TREE_VALUE (parm_level
);
4874 int ntparms
= TREE_VEC_LENGTH (inner_parms
);
4875 int seen_def_arg_p
= 0;
4878 for (i
= 0; i
< ntparms
; ++i
)
4880 tree parm
= TREE_VEC_ELT (inner_parms
, i
);
4882 if (parm
== error_mark_node
)
4885 if (TREE_PURPOSE (parm
))
4887 else if (seen_def_arg_p
4888 && !template_parameter_pack_p (TREE_VALUE (parm
)))
4890 error ("no default argument for %qD", TREE_VALUE (parm
));
4891 /* For better subsequent error-recovery, we indicate that
4892 there should have been a default argument. */
4893 TREE_PURPOSE (parm
) = error_mark_node
;
4896 else if (!is_partial
4898 /* Don't complain about an enclosing partial
4900 && parm_level
== parms
4901 && TREE_CODE (decl
) == TYPE_DECL
4903 && template_parameter_pack_p (TREE_VALUE (parm
))
4904 /* A fixed parameter pack will be partially
4905 instantiated into a fixed length list. */
4906 && !fixed_parameter_pack_p (TREE_VALUE (parm
)))
4908 /* A primary class template can only have one
4909 parameter pack, at the end of the template
4912 error ("parameter pack %q+D must be at the end of the"
4913 " template parameter list", TREE_VALUE (parm
));
4915 TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
))
4923 if (((cxx_dialect
== cxx98
) && TREE_CODE (decl
) != TYPE_DECL
)
4927 /* For an ordinary class template, default template arguments are
4928 allowed at the innermost level, e.g.:
4929 template <class T = int>
4931 but, in a partial specialization, they're not allowed even
4932 there, as we have in [temp.class.spec]:
4934 The template parameter list of a specialization shall not
4935 contain default template argument values.
4937 So, for a partial specialization, or for a function template
4938 (in C++98/C++03), we look at all of them. */
4941 /* But, for a primary class template that is not a partial
4942 specialization we look at all template parameters except the
4944 parms
= TREE_CHAIN (parms
);
4946 /* Figure out what error message to issue. */
4947 if (is_friend_decl
== 2)
4948 msg
= G_("default template arguments may not be used in function template "
4949 "friend re-declaration");
4950 else if (is_friend_decl
)
4951 msg
= G_("default template arguments may not be used in function template "
4952 "friend declarations");
4953 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& (cxx_dialect
== cxx98
))
4954 msg
= G_("default template arguments may not be used in function templates "
4955 "without -std=c++11 or -std=gnu++11");
4956 else if (is_partial
)
4957 msg
= G_("default template arguments may not be used in "
4958 "partial specializations");
4959 else if (current_class_type
&& CLASSTYPE_IS_TEMPLATE (current_class_type
))
4960 msg
= G_("default argument for template parameter for class enclosing %qD");
4962 /* Per [temp.param]/9, "A default template-argument shall not be
4963 specified in the template-parameter-lists of the definition of
4964 a member of a class template that appears outside of the member's
4965 class.", thus if we aren't handling a member of a class template
4966 there is no need to examine the parameters. */
4969 if (current_class_type
&& TYPE_BEING_DEFINED (current_class_type
))
4970 /* If we're inside a class definition, there's no need to
4971 examine the parameters to the class itself. On the one
4972 hand, they will be checked when the class is defined, and,
4973 on the other, default arguments are valid in things like:
4974 template <class T = double>
4975 struct S { template <class U> void f(U); };
4976 Here the default argument for `S' has no bearing on the
4977 declaration of `f'. */
4978 last_level_to_check
= template_class_depth (current_class_type
) + 1;
4980 /* Check everything. */
4981 last_level_to_check
= 0;
4983 for (parm_level
= parms
;
4984 parm_level
&& TMPL_PARMS_DEPTH (parm_level
) >= last_level_to_check
;
4985 parm_level
= TREE_CHAIN (parm_level
))
4987 tree inner_parms
= TREE_VALUE (parm_level
);
4991 ntparms
= TREE_VEC_LENGTH (inner_parms
);
4992 for (i
= 0; i
< ntparms
; ++i
)
4994 if (TREE_VEC_ELT (inner_parms
, i
) == error_mark_node
)
4997 if (TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)))
5002 if (is_friend_decl
== 2)
5009 /* Clear out the default argument so that we are not
5011 TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)) = NULL_TREE
;
5015 /* At this point, if we're still interested in issuing messages,
5016 they must apply to classes surrounding the object declared. */
5018 msg
= G_("default argument for template parameter for class "
5025 /* Worker for push_template_decl_real, called via
5026 for_each_template_parm. DATA is really an int, indicating the
5027 level of the parameters we are interested in. If T is a template
5028 parameter of that level, return nonzero. */
5031 template_parm_this_level_p (tree t
, void* data
)
5033 int this_level
= *(int *)data
;
5036 if (TREE_CODE (t
) == TEMPLATE_PARM_INDEX
)
5037 level
= TEMPLATE_PARM_LEVEL (t
);
5039 level
= TEMPLATE_TYPE_LEVEL (t
);
5040 return level
== this_level
;
5043 /* Creates a TEMPLATE_DECL for the indicated DECL using the template
5044 parameters given by current_template_args, or reuses a
5045 previously existing one, if appropriate. Returns the DECL, or an
5046 equivalent one, if it is replaced via a call to duplicate_decls.
5048 If IS_FRIEND is true, DECL is a friend declaration. */
5051 push_template_decl_real (tree decl
, bool is_friend
)
5059 int new_template_p
= 0;
5060 /* True if the template is a member template, in the sense of
5062 bool member_template_p
= false;
5064 if (decl
== error_mark_node
|| !current_template_parms
)
5065 return error_mark_node
;
5067 /* See if this is a partial specialization. */
5068 is_partial
= ((DECL_IMPLICIT_TYPEDEF_P (decl
)
5069 && TREE_CODE (TREE_TYPE (decl
)) != ENUMERAL_TYPE
5070 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)))
5072 && DECL_LANG_SPECIFIC (decl
)
5073 && DECL_TEMPLATE_SPECIALIZATION (decl
)
5074 && TINFO_USED_TEMPLATE_ID (DECL_TEMPLATE_INFO (decl
))));
5076 if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_FRIEND_P (decl
))
5080 /* For a friend, we want the context of the friend function, not
5081 the type of which it is a friend. */
5082 ctx
= CP_DECL_CONTEXT (decl
);
5083 else if (CP_DECL_CONTEXT (decl
)
5084 && TREE_CODE (CP_DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
5085 /* In the case of a virtual function, we want the class in which
5087 ctx
= CP_DECL_CONTEXT (decl
);
5089 /* Otherwise, if we're currently defining some class, the DECL
5090 is assumed to be a member of the class. */
5091 ctx
= current_scope ();
5093 if (ctx
&& TREE_CODE (ctx
) == NAMESPACE_DECL
)
5096 if (!DECL_CONTEXT (decl
))
5097 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
5099 /* See if this is a primary template. */
5100 if (is_friend
&& ctx
5101 && uses_template_parms_level (ctx
, processing_template_decl
))
5102 /* A friend template that specifies a class context, i.e.
5103 template <typename T> friend void A<T>::f();
5106 else if (TREE_CODE (decl
) == TYPE_DECL
5107 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
5110 is_primary
= template_parm_scope_p ();
5114 warning (OPT_Wtemplates
, "template %qD declared", decl
);
5116 if (DECL_CLASS_SCOPE_P (decl
))
5117 member_template_p
= true;
5118 if (TREE_CODE (decl
) == TYPE_DECL
5119 && anon_aggrname_p (DECL_NAME (decl
)))
5121 error ("template class without a name");
5122 return error_mark_node
;
5124 else if (TREE_CODE (decl
) == FUNCTION_DECL
)
5126 if (member_template_p
)
5128 if (DECL_OVERRIDE_P (decl
) || DECL_FINAL_P (decl
))
5129 error ("member template %qD may not have virt-specifiers", decl
);
5131 if (DECL_DESTRUCTOR_P (decl
))
5135 A destructor shall not be a member template. */
5136 error ("destructor %qD declared as member template", decl
);
5137 return error_mark_node
;
5139 if (NEW_DELETE_OPNAME_P (DECL_NAME (decl
))
5140 && (!prototype_p (TREE_TYPE (decl
))
5141 || TYPE_ARG_TYPES (TREE_TYPE (decl
)) == void_list_node
5142 || !TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)))
5143 || (TREE_CHAIN (TYPE_ARG_TYPES ((TREE_TYPE (decl
))))
5144 == void_list_node
)))
5146 /* [basic.stc.dynamic.allocation]
5148 An allocation function can be a function
5149 template. ... Template allocation functions shall
5150 have two or more parameters. */
5151 error ("invalid template declaration of %qD", decl
);
5152 return error_mark_node
;
5155 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
5156 && CLASS_TYPE_P (TREE_TYPE (decl
)))
5158 else if (TREE_CODE (decl
) == TYPE_DECL
5159 && TYPE_DECL_ALIAS_P (decl
))
5160 /* alias-declaration */
5161 gcc_assert (!DECL_ARTIFICIAL (decl
));
5162 else if (VAR_P (decl
))
5163 /* C++14 variable template. */;
5166 error ("template declaration of %q#D", decl
);
5167 return error_mark_node
;
5171 /* Check to see that the rules regarding the use of default
5172 arguments are not being violated. */
5173 check_default_tmpl_args (decl
, current_template_parms
,
5174 is_primary
, is_partial
, /*is_friend_decl=*/0);
5176 /* Ensure that there are no parameter packs in the type of this
5177 declaration that have not been expanded. */
5178 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5180 /* Check each of the arguments individually to see if there are
5181 any bare parameter packs. */
5182 tree type
= TREE_TYPE (decl
);
5183 tree arg
= DECL_ARGUMENTS (decl
);
5184 tree argtype
= TYPE_ARG_TYPES (type
);
5186 while (arg
&& argtype
)
5188 if (!DECL_PACK_P (arg
)
5189 && check_for_bare_parameter_packs (TREE_TYPE (arg
)))
5191 /* This is a PARM_DECL that contains unexpanded parameter
5192 packs. We have already complained about this in the
5193 check_for_bare_parameter_packs call, so just replace
5194 these types with ERROR_MARK_NODE. */
5195 TREE_TYPE (arg
) = error_mark_node
;
5196 TREE_VALUE (argtype
) = error_mark_node
;
5199 arg
= DECL_CHAIN (arg
);
5200 argtype
= TREE_CHAIN (argtype
);
5203 /* Check for bare parameter packs in the return type and the
5204 exception specifiers. */
5205 if (check_for_bare_parameter_packs (TREE_TYPE (type
)))
5206 /* Errors were already issued, set return type to int
5207 as the frontend doesn't expect error_mark_node as
5209 TREE_TYPE (type
) = integer_type_node
;
5210 if (check_for_bare_parameter_packs (TYPE_RAISES_EXCEPTIONS (type
)))
5211 TYPE_RAISES_EXCEPTIONS (type
) = NULL_TREE
;
5213 else if (check_for_bare_parameter_packs ((TREE_CODE (decl
) == TYPE_DECL
5214 && TYPE_DECL_ALIAS_P (decl
))
5215 ? DECL_ORIGINAL_TYPE (decl
)
5216 : TREE_TYPE (decl
)))
5218 TREE_TYPE (decl
) = error_mark_node
;
5219 return error_mark_node
;
5223 return process_partial_specialization (decl
);
5225 args
= current_template_args ();
5228 || TREE_CODE (ctx
) == FUNCTION_DECL
5229 || (CLASS_TYPE_P (ctx
) && TYPE_BEING_DEFINED (ctx
))
5230 || (TREE_CODE (decl
) == TYPE_DECL
5231 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
5232 || (is_friend
&& !DECL_TEMPLATE_INFO (decl
)))
5234 if (DECL_LANG_SPECIFIC (decl
)
5235 && DECL_TEMPLATE_INFO (decl
)
5236 && DECL_TI_TEMPLATE (decl
))
5237 tmpl
= DECL_TI_TEMPLATE (decl
);
5238 /* If DECL is a TYPE_DECL for a class-template, then there won't
5239 be DECL_LANG_SPECIFIC. The information equivalent to
5240 DECL_TEMPLATE_INFO is found in TYPE_TEMPLATE_INFO instead. */
5241 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
5242 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl
))
5243 && TYPE_TI_TEMPLATE (TREE_TYPE (decl
)))
5245 /* Since a template declaration already existed for this
5246 class-type, we must be redeclaring it here. Make sure
5247 that the redeclaration is valid. */
5248 redeclare_class_template (TREE_TYPE (decl
),
5249 current_template_parms
,
5250 current_template_constraints ());
5251 /* We don't need to create a new TEMPLATE_DECL; just use the
5252 one we already had. */
5253 tmpl
= TYPE_TI_TEMPLATE (TREE_TYPE (decl
));
5257 tmpl
= build_template_decl (decl
, current_template_parms
,
5261 if (DECL_LANG_SPECIFIC (decl
)
5262 && DECL_TEMPLATE_SPECIALIZATION (decl
))
5264 /* A specialization of a member template of a template
5266 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
5267 DECL_TEMPLATE_INFO (tmpl
) = DECL_TEMPLATE_INFO (decl
);
5268 DECL_TEMPLATE_INFO (decl
) = NULL_TREE
;
5274 tree a
, t
, current
, parms
;
5276 tree tinfo
= get_template_info (decl
);
5280 error ("template definition of non-template %q#D", decl
);
5281 return error_mark_node
;
5284 tmpl
= TI_TEMPLATE (tinfo
);
5286 if (DECL_FUNCTION_TEMPLATE_P (tmpl
)
5287 && DECL_TEMPLATE_INFO (decl
) && DECL_TI_ARGS (decl
)
5288 && DECL_TEMPLATE_SPECIALIZATION (decl
)
5289 && DECL_MEMBER_TEMPLATE_P (tmpl
))
5293 /* The declaration is a specialization of a member
5294 template, declared outside the class. Therefore, the
5295 innermost template arguments will be NULL, so we
5296 replace them with the arguments determined by the
5297 earlier call to check_explicit_specialization. */
5298 args
= DECL_TI_ARGS (decl
);
5301 = build_template_decl (decl
, current_template_parms
,
5303 DECL_TEMPLATE_RESULT (new_tmpl
) = decl
;
5304 TREE_TYPE (new_tmpl
) = TREE_TYPE (decl
);
5305 DECL_TI_TEMPLATE (decl
) = new_tmpl
;
5306 SET_DECL_TEMPLATE_SPECIALIZATION (new_tmpl
);
5307 DECL_TEMPLATE_INFO (new_tmpl
)
5308 = build_template_info (tmpl
, args
);
5310 register_specialization (new_tmpl
,
5311 most_general_template (tmpl
),
5317 /* Make sure the template headers we got make sense. */
5319 parms
= DECL_TEMPLATE_PARMS (tmpl
);
5320 i
= TMPL_PARMS_DEPTH (parms
);
5321 if (TMPL_ARGS_DEPTH (args
) != i
)
5323 error ("expected %d levels of template parms for %q#D, got %d",
5324 i
, decl
, TMPL_ARGS_DEPTH (args
));
5325 DECL_INTERFACE_KNOWN (decl
) = 1;
5326 return error_mark_node
;
5329 for (current
= decl
; i
> 0; --i
, parms
= TREE_CHAIN (parms
))
5331 a
= TMPL_ARGS_LEVEL (args
, i
);
5332 t
= INNERMOST_TEMPLATE_PARMS (parms
);
5334 if (TREE_VEC_LENGTH (t
) != TREE_VEC_LENGTH (a
))
5336 if (current
== decl
)
5337 error ("got %d template parameters for %q#D",
5338 TREE_VEC_LENGTH (a
), decl
);
5340 error ("got %d template parameters for %q#T",
5341 TREE_VEC_LENGTH (a
), current
);
5342 error (" but %d required", TREE_VEC_LENGTH (t
));
5343 /* Avoid crash in import_export_decl. */
5344 DECL_INTERFACE_KNOWN (decl
) = 1;
5345 return error_mark_node
;
5348 if (current
== decl
)
5350 else if (current
== NULL_TREE
)
5351 /* Can happen in erroneous input. */
5354 current
= get_containing_scope (current
);
5357 /* Check that the parms are used in the appropriate qualifying scopes
5358 in the declarator. */
5359 if (!comp_template_args
5361 TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (tmpl
)))))
5364 template arguments to %qD do not match original template %qD",
5365 decl
, DECL_TEMPLATE_RESULT (tmpl
));
5366 if (!uses_template_parms (TI_ARGS (tinfo
)))
5367 inform (input_location
, "use template<> for an explicit specialization");
5368 /* Avoid crash in import_export_decl. */
5369 DECL_INTERFACE_KNOWN (decl
) = 1;
5370 return error_mark_node
;
5374 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
5375 TREE_TYPE (tmpl
) = TREE_TYPE (decl
);
5377 /* Push template declarations for global functions and types. Note
5378 that we do not try to push a global template friend declared in a
5379 template class; such a thing may well depend on the template
5380 parameters of the class. */
5381 if (new_template_p
&& !ctx
5382 && !(is_friend
&& template_class_depth (current_class_type
) > 0))
5384 tmpl
= pushdecl_namespace_level (tmpl
, is_friend
);
5385 if (tmpl
== error_mark_node
)
5386 return error_mark_node
;
5388 /* Hide template friend classes that haven't been declared yet. */
5389 if (is_friend
&& TREE_CODE (decl
) == TYPE_DECL
)
5391 DECL_ANTICIPATED (tmpl
) = 1;
5392 DECL_FRIEND_P (tmpl
) = 1;
5398 tree parms
= DECL_TEMPLATE_PARMS (tmpl
);
5401 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
5402 if (DECL_CONV_FN_P (tmpl
))
5404 int depth
= TMPL_PARMS_DEPTH (parms
);
5406 /* It is a conversion operator. See if the type converted to
5407 depends on innermost template operands. */
5409 if (uses_template_parms_level (TREE_TYPE (TREE_TYPE (tmpl
)),
5411 DECL_TEMPLATE_CONV_FN_P (tmpl
) = 1;
5414 /* Give template template parms a DECL_CONTEXT of the template
5415 for which they are a parameter. */
5416 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
5417 for (i
= TREE_VEC_LENGTH (parms
) - 1; i
>= 0; --i
)
5419 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
5420 if (TREE_CODE (parm
) == TEMPLATE_DECL
)
5421 DECL_CONTEXT (parm
) = tmpl
;
5424 if (TREE_CODE (decl
) == TYPE_DECL
5425 && TYPE_DECL_ALIAS_P (decl
)
5426 && complex_alias_template_p (tmpl
))
5427 TEMPLATE_DECL_COMPLEX_ALIAS_P (tmpl
) = true;
5430 /* The DECL_TI_ARGS of DECL contains full set of arguments referring
5431 back to its most general template. If TMPL is a specialization,
5432 ARGS may only have the innermost set of arguments. Add the missing
5433 argument levels if necessary. */
5434 if (DECL_TEMPLATE_INFO (tmpl
))
5435 args
= add_outermost_template_args (DECL_TI_ARGS (tmpl
), args
);
5437 info
= build_template_info (tmpl
, args
);
5439 if (DECL_IMPLICIT_TYPEDEF_P (decl
))
5440 SET_TYPE_TEMPLATE_INFO (TREE_TYPE (tmpl
), info
);
5443 if (is_primary
&& !DECL_LANG_SPECIFIC (decl
))
5444 retrofit_lang_decl (decl
);
5445 if (DECL_LANG_SPECIFIC (decl
))
5446 DECL_TEMPLATE_INFO (decl
) = info
;
5449 if (flag_implicit_templates
5451 && TREE_PUBLIC (decl
)
5452 && VAR_OR_FUNCTION_DECL_P (decl
))
5453 /* Set DECL_COMDAT on template instantiations; if we force
5454 them to be emitted by explicit instantiation or -frepo,
5455 mark_needed will tell cgraph to do the right thing. */
5456 DECL_COMDAT (decl
) = true;
5458 return DECL_TEMPLATE_RESULT (tmpl
);
5462 push_template_decl (tree decl
)
5464 return push_template_decl_real (decl
, false);
5467 /* FN is an inheriting constructor that inherits from the constructor
5468 template INHERITED; turn FN into a constructor template with a matching
5472 add_inherited_template_parms (tree fn
, tree inherited
)
5475 = INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (inherited
));
5476 inner_parms
= copy_node (inner_parms
);
5478 = tree_cons (size_int (processing_template_decl
+ 1),
5479 inner_parms
, current_template_parms
);
5480 tree tmpl
= build_template_decl (fn
, parms
, /*member*/true);
5481 tree args
= template_parms_to_args (parms
);
5482 DECL_TEMPLATE_INFO (fn
) = build_template_info (tmpl
, args
);
5483 TREE_TYPE (tmpl
) = TREE_TYPE (fn
);
5484 DECL_TEMPLATE_RESULT (tmpl
) = fn
;
5485 DECL_ARTIFICIAL (tmpl
) = true;
5486 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
5490 /* Called when a class template TYPE is redeclared with the indicated
5491 template PARMS, e.g.:
5493 template <class T> struct S;
5494 template <class T> struct S {}; */
5497 redeclare_class_template (tree type
, tree parms
, tree cons
)
5503 if (!TYPE_TEMPLATE_INFO (type
))
5505 error ("%qT is not a template type", type
);
5509 tmpl
= TYPE_TI_TEMPLATE (type
);
5510 if (!PRIMARY_TEMPLATE_P (tmpl
))
5511 /* The type is nested in some template class. Nothing to worry
5512 about here; there are no new template parameters for the nested
5518 error ("template specifiers not specified in declaration of %qD",
5523 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
5524 tmpl_parms
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl
);
5526 if (TREE_VEC_LENGTH (parms
) != TREE_VEC_LENGTH (tmpl_parms
))
5528 error_n (input_location
, TREE_VEC_LENGTH (parms
),
5529 "redeclared with %d template parameter",
5530 "redeclared with %d template parameters",
5531 TREE_VEC_LENGTH (parms
));
5532 inform_n (DECL_SOURCE_LOCATION (tmpl
), TREE_VEC_LENGTH (tmpl_parms
),
5533 "previous declaration %qD used %d template parameter",
5534 "previous declaration %qD used %d template parameters",
5535 tmpl
, TREE_VEC_LENGTH (tmpl_parms
));
5539 for (i
= 0; i
< TREE_VEC_LENGTH (tmpl_parms
); ++i
)
5546 if (TREE_VEC_ELT (tmpl_parms
, i
) == error_mark_node
5547 || TREE_VEC_ELT (parms
, i
) == error_mark_node
)
5550 tmpl_parm
= TREE_VALUE (TREE_VEC_ELT (tmpl_parms
, i
));
5551 if (error_operand_p (tmpl_parm
))
5554 parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
5555 tmpl_default
= TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
));
5556 parm_default
= TREE_PURPOSE (TREE_VEC_ELT (parms
, i
));
5558 /* TMPL_PARM and PARM can be either TYPE_DECL, PARM_DECL, or
5560 if (TREE_CODE (tmpl_parm
) != TREE_CODE (parm
)
5561 || (TREE_CODE (tmpl_parm
) != TYPE_DECL
5562 && !same_type_p (TREE_TYPE (tmpl_parm
), TREE_TYPE (parm
)))
5563 || (TREE_CODE (tmpl_parm
) != PARM_DECL
5564 && (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (tmpl_parm
))
5565 != TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
))))
5566 || (TREE_CODE (tmpl_parm
) == PARM_DECL
5567 && (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (tmpl_parm
))
5568 != TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))))
5570 error ("template parameter %q+#D", tmpl_parm
);
5571 error ("redeclared here as %q#D", parm
);
5575 if (tmpl_default
!= NULL_TREE
&& parm_default
!= NULL_TREE
)
5577 /* We have in [temp.param]:
5579 A template-parameter may not be given default arguments
5580 by two different declarations in the same scope. */
5581 error_at (input_location
, "redefinition of default argument for %q#D", parm
);
5582 inform (DECL_SOURCE_LOCATION (tmpl_parm
),
5583 "original definition appeared here");
5587 if (parm_default
!= NULL_TREE
)
5588 /* Update the previous template parameters (which are the ones
5589 that will really count) with the new default value. */
5590 TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
)) = parm_default
;
5591 else if (tmpl_default
!= NULL_TREE
)
5592 /* Update the new parameters, too; they'll be used as the
5593 parameters for any members. */
5594 TREE_PURPOSE (TREE_VEC_ELT (parms
, i
)) = tmpl_default
;
5596 /* Give each template template parm in this redeclaration a
5597 DECL_CONTEXT of the template for which they are a parameter. */
5598 if (TREE_CODE (parm
) == TEMPLATE_DECL
)
5600 gcc_assert (DECL_CONTEXT (parm
) == NULL_TREE
);
5601 DECL_CONTEXT (parm
) = tmpl
;
5605 // Cannot redeclare a class template with a different set of constraints.
5606 if (!equivalent_constraints (get_constraints (tmpl
), cons
))
5608 error_at (input_location
, "redeclaration %q#D with different "
5609 "constraints", tmpl
);
5610 inform (DECL_SOURCE_LOCATION (tmpl
),
5611 "original declaration appeared here");
5617 /* The actual substitution part of instantiate_non_dependent_expr_sfinae,
5618 to be used when the caller has already checked
5619 (processing_template_decl
5620 && !instantiation_dependent_expression_p (expr)
5621 && potential_constant_expression (expr))
5622 and cleared processing_template_decl. */
5625 instantiate_non_dependent_expr_internal (tree expr
, tsubst_flags_t complain
)
5627 return tsubst_copy_and_build (expr
,
5630 /*in_decl=*/NULL_TREE
,
5631 /*function_p=*/false,
5632 /*integral_constant_expression_p=*/true);
5635 /* Simplify EXPR if it is a non-dependent expression. Returns the
5636 (possibly simplified) expression. */
5639 instantiate_non_dependent_expr_sfinae (tree expr
, tsubst_flags_t complain
)
5641 if (expr
== NULL_TREE
)
5644 /* If we're in a template, but EXPR isn't value dependent, simplify
5645 it. We're supposed to treat:
5647 template <typename T> void f(T[1 + 1]);
5648 template <typename T> void f(T[2]);
5650 as two declarations of the same function, for example. */
5651 if (processing_template_decl
5652 && !instantiation_dependent_expression_p (expr
)
5653 && potential_constant_expression (expr
))
5655 processing_template_decl_sentinel s
;
5656 expr
= instantiate_non_dependent_expr_internal (expr
, complain
);
5662 instantiate_non_dependent_expr (tree expr
)
5664 return instantiate_non_dependent_expr_sfinae (expr
, tf_error
);
5667 /* True iff T is a specialization of a variable template. */
5670 variable_template_specialization_p (tree t
)
5672 if (!VAR_P (t
) || !DECL_LANG_SPECIFIC (t
) || !DECL_TEMPLATE_INFO (t
))
5674 tree tmpl
= DECL_TI_TEMPLATE (t
);
5675 return variable_template_p (tmpl
);
5678 /* Return TRUE iff T is a type alias, a TEMPLATE_DECL for an alias
5679 template declaration, or a TYPE_DECL for an alias declaration. */
5682 alias_type_or_template_p (tree t
)
5686 return ((TREE_CODE (t
) == TYPE_DECL
&& TYPE_DECL_ALIAS_P (t
))
5689 && TYPE_DECL_ALIAS_P (TYPE_NAME (t
)))
5690 || DECL_ALIAS_TEMPLATE_P (t
));
5693 /* Return TRUE iff T is a specialization of an alias template. */
5696 alias_template_specialization_p (const_tree t
)
5698 /* It's an alias template specialization if it's an alias and its
5699 TYPE_NAME is a specialization of a primary template. */
5700 if (TYPE_ALIAS_P (t
))
5702 tree name
= TYPE_NAME (t
);
5703 if (DECL_LANG_SPECIFIC (name
))
5704 if (tree ti
= DECL_TEMPLATE_INFO (name
))
5706 tree tmpl
= TI_TEMPLATE (ti
);
5707 return PRIMARY_TEMPLATE_P (tmpl
);
5713 /* An alias template is complex from a SFINAE perspective if a template-id
5714 using that alias can be ill-formed when the expansion is not, as with
5715 the void_t template. We determine this by checking whether the
5716 expansion for the alias template uses all its template parameters. */
5718 struct uses_all_template_parms_data
5725 uses_all_template_parms_r (tree t
, void *data_
)
5727 struct uses_all_template_parms_data
&data
5728 = *(struct uses_all_template_parms_data
*)data_
;
5729 tree idx
= get_template_parm_index (t
);
5731 if (TEMPLATE_PARM_LEVEL (idx
) == data
.level
)
5732 data
.seen
[TEMPLATE_PARM_IDX (idx
)] = true;
5737 complex_alias_template_p (const_tree tmpl
)
5739 struct uses_all_template_parms_data data
;
5740 tree pat
= DECL_ORIGINAL_TYPE (DECL_TEMPLATE_RESULT (tmpl
));
5741 tree parms
= DECL_TEMPLATE_PARMS (tmpl
);
5742 data
.level
= TMPL_PARMS_DEPTH (parms
);
5743 int len
= TREE_VEC_LENGTH (INNERMOST_TEMPLATE_PARMS (parms
));
5744 data
.seen
= XALLOCAVEC (bool, len
);
5745 for (int i
= 0; i
< len
; ++i
)
5746 data
.seen
[i
] = false;
5748 for_each_template_parm (pat
, uses_all_template_parms_r
, &data
, NULL
, true);
5749 for (int i
= 0; i
< len
; ++i
)
5755 /* Return TRUE iff T is a specialization of a complex alias template with
5756 dependent template-arguments. */
5759 dependent_alias_template_spec_p (const_tree t
)
5761 return (alias_template_specialization_p (t
)
5762 && TEMPLATE_DECL_COMPLEX_ALIAS_P (DECL_TI_TEMPLATE (TYPE_NAME (t
)))
5763 && (any_dependent_template_arguments_p
5764 (INNERMOST_TEMPLATE_ARGS (TYPE_TI_ARGS (t
)))));
5767 /* Return the number of innermost template parameters in TMPL. */
5770 num_innermost_template_parms (tree tmpl
)
5772 tree parms
= INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (tmpl
));
5773 return TREE_VEC_LENGTH (parms
);
5776 /* Return either TMPL or another template that it is equivalent to under DR
5777 1286: An alias that just changes the name of a template is equivalent to
5778 the other template. */
5781 get_underlying_template (tree tmpl
)
5783 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
);
5784 while (DECL_ALIAS_TEMPLATE_P (tmpl
))
5786 tree result
= DECL_ORIGINAL_TYPE (DECL_TEMPLATE_RESULT (tmpl
));
5787 if (TYPE_TEMPLATE_INFO (result
))
5789 tree sub
= TYPE_TI_TEMPLATE (result
);
5790 if (PRIMARY_TEMPLATE_P (sub
)
5791 && (num_innermost_template_parms (tmpl
)
5792 == num_innermost_template_parms (sub
)))
5794 tree alias_args
= INNERMOST_TEMPLATE_ARGS
5795 (template_parms_to_args (DECL_TEMPLATE_PARMS (tmpl
)));
5796 if (!comp_template_args (TYPE_TI_ARGS (result
), alias_args
))
5798 /* The alias type is equivalent to the pattern of the
5799 underlying template, so strip the alias. */
5809 /* Subroutine of convert_nontype_argument. Converts EXPR to TYPE, which
5810 must be a function or a pointer-to-function type, as specified
5811 in [temp.arg.nontype]: disambiguate EXPR if it is an overload set,
5812 and check that the resulting function has external linkage. */
5815 convert_nontype_argument_function (tree type
, tree expr
,
5816 tsubst_flags_t complain
)
5820 linkage_kind linkage
;
5822 fn
= instantiate_type (type
, fns
, tf_none
);
5823 if (fn
== error_mark_node
)
5824 return error_mark_node
;
5827 if (TREE_CODE (fn_no_ptr
) == ADDR_EXPR
)
5828 fn_no_ptr
= TREE_OPERAND (fn_no_ptr
, 0);
5829 if (BASELINK_P (fn_no_ptr
))
5830 fn_no_ptr
= BASELINK_FUNCTIONS (fn_no_ptr
);
5832 /* [temp.arg.nontype]/1
5834 A template-argument for a non-type, non-template template-parameter
5837 -- the address of an object or function with external [C++11: or
5838 internal] linkage. */
5840 if (TREE_CODE (fn_no_ptr
) != FUNCTION_DECL
)
5842 if (complain
& tf_error
)
5844 error ("%qE is not a valid template argument for type %qT",
5846 if (TYPE_PTR_P (type
))
5847 error ("it must be the address of a function with "
5848 "external linkage");
5850 error ("it must be the name of a function with "
5851 "external linkage");
5856 linkage
= decl_linkage (fn_no_ptr
);
5857 if (cxx_dialect
>= cxx11
? linkage
== lk_none
: linkage
!= lk_external
)
5859 if (complain
& tf_error
)
5861 if (cxx_dialect
>= cxx11
)
5862 error ("%qE is not a valid template argument for type %qT "
5863 "because %qD has no linkage",
5864 expr
, type
, fn_no_ptr
);
5866 error ("%qE is not a valid template argument for type %qT "
5867 "because %qD does not have external linkage",
5868 expr
, type
, fn_no_ptr
);
5876 /* Subroutine of convert_nontype_argument.
5877 Check if EXPR of type TYPE is a valid pointer-to-member constant.
5878 Emit an error otherwise. */
5881 check_valid_ptrmem_cst_expr (tree type
, tree expr
,
5882 tsubst_flags_t complain
)
5885 if (expr
&& (null_ptr_cst_p (expr
) || TREE_CODE (expr
) == PTRMEM_CST
))
5887 if (cxx_dialect
>= cxx11
&& null_member_pointer_value_p (expr
))
5889 if (processing_template_decl
5890 && TREE_CODE (expr
) == ADDR_EXPR
5891 && TREE_CODE (TREE_OPERAND (expr
, 0)) == OFFSET_REF
)
5893 if (complain
& tf_error
)
5895 error ("%qE is not a valid template argument for type %qT",
5897 error ("it must be a pointer-to-member of the form %<&X::Y%>");
5902 /* Returns TRUE iff the address of OP is value-dependent.
5904 14.6.2.4 [temp.dep.temp]:
5905 A non-integral non-type template-argument is dependent if its type is
5906 dependent or it has either of the following forms
5909 and contains a nested-name-specifier which specifies a class-name that
5910 names a dependent type.
5912 We generalize this to just say that the address of a member of a
5913 dependent class is value-dependent; the above doesn't cover the
5914 address of a static data member named with an unqualified-id. */
5917 has_value_dependent_address (tree op
)
5919 /* We could use get_inner_reference here, but there's no need;
5920 this is only relevant for template non-type arguments, which
5921 can only be expressed as &id-expression. */
5924 tree ctx
= CP_DECL_CONTEXT (op
);
5925 if (TYPE_P (ctx
) && dependent_type_p (ctx
))
5932 /* The next set of functions are used for providing helpful explanatory
5933 diagnostics for failed overload resolution. Their messages should be
5934 indented by two spaces for consistency with the messages in
5938 unify_success (bool /*explain_p*/)
5944 unify_parameter_deduction_failure (bool explain_p
, tree parm
)
5947 inform (input_location
,
5948 " couldn't deduce template parameter %qD", parm
);
5953 unify_invalid (bool /*explain_p*/)
5959 unify_cv_qual_mismatch (bool explain_p
, tree parm
, tree arg
)
5962 inform (input_location
,
5963 " types %qT and %qT have incompatible cv-qualifiers",
5969 unify_type_mismatch (bool explain_p
, tree parm
, tree arg
)
5972 inform (input_location
, " mismatched types %qT and %qT", parm
, arg
);
5977 unify_parameter_pack_mismatch (bool explain_p
, tree parm
, tree arg
)
5980 inform (input_location
,
5981 " template parameter %qD is not a parameter pack, but "
5988 unify_ptrmem_cst_mismatch (bool explain_p
, tree parm
, tree arg
)
5991 inform (input_location
,
5992 " template argument %qE does not match "
5993 "pointer-to-member constant %qE",
5999 unify_expression_unequal (bool explain_p
, tree parm
, tree arg
)
6002 inform (input_location
, " %qE is not equivalent to %qE", parm
, arg
);
6007 unify_parameter_pack_inconsistent (bool explain_p
, tree old_arg
, tree new_arg
)
6010 inform (input_location
,
6011 " inconsistent parameter pack deduction with %qT and %qT",
6017 unify_inconsistency (bool explain_p
, tree parm
, tree first
, tree second
)
6022 inform (input_location
,
6023 " deduced conflicting types for parameter %qT (%qT and %qT)",
6024 parm
, first
, second
);
6026 inform (input_location
,
6027 " deduced conflicting values for non-type parameter "
6028 "%qE (%qE and %qE)", parm
, first
, second
);
6034 unify_vla_arg (bool explain_p
, tree arg
)
6037 inform (input_location
,
6038 " variable-sized array type %qT is not "
6039 "a valid template argument",
6045 unify_method_type_error (bool explain_p
, tree arg
)
6048 inform (input_location
,
6049 " member function type %qT is not a valid template argument",
6055 unify_arity (bool explain_p
, int have
, int wanted
, bool least_p
= false)
6060 inform_n (input_location
, wanted
,
6061 " candidate expects at least %d argument, %d provided",
6062 " candidate expects at least %d arguments, %d provided",
6065 inform_n (input_location
, wanted
,
6066 " candidate expects %d argument, %d provided",
6067 " candidate expects %d arguments, %d provided",
6074 unify_too_many_arguments (bool explain_p
, int have
, int wanted
)
6076 return unify_arity (explain_p
, have
, wanted
);
6080 unify_too_few_arguments (bool explain_p
, int have
, int wanted
,
6081 bool least_p
= false)
6083 return unify_arity (explain_p
, have
, wanted
, least_p
);
6087 unify_arg_conversion (bool explain_p
, tree to_type
,
6088 tree from_type
, tree arg
)
6091 inform (EXPR_LOC_OR_LOC (arg
, input_location
),
6092 " cannot convert %qE (type %qT) to type %qT",
6093 arg
, from_type
, to_type
);
6098 unify_no_common_base (bool explain_p
, enum template_base_result r
,
6099 tree parm
, tree arg
)
6104 case tbr_ambiguous_baseclass
:
6105 inform (input_location
, " %qT is an ambiguous base class of %qT",
6109 inform (input_location
, " %qT is not derived from %qT", arg
, parm
);
6116 unify_inconsistent_template_template_parameters (bool explain_p
)
6119 inform (input_location
,
6120 " template parameters of a template template argument are "
6121 "inconsistent with other deduced template arguments");
6126 unify_template_deduction_failure (bool explain_p
, tree parm
, tree arg
)
6129 inform (input_location
,
6130 " can't deduce a template for %qT from non-template type %qT",
6136 unify_template_argument_mismatch (bool explain_p
, tree parm
, tree arg
)
6139 inform (input_location
,
6140 " template argument %qE does not match %qD", arg
, parm
);
6145 unify_overload_resolution_failure (bool explain_p
, tree arg
)
6148 inform (input_location
,
6149 " could not resolve address from overloaded function %qE",
6154 /* Attempt to convert the non-type template parameter EXPR to the
6155 indicated TYPE. If the conversion is successful, return the
6156 converted value. If the conversion is unsuccessful, return
6157 NULL_TREE if we issued an error message, or error_mark_node if we
6158 did not. We issue error messages for out-and-out bad template
6159 parameters, but not simply because the conversion failed, since we
6160 might be just trying to do argument deduction. Both TYPE and EXPR
6161 must be non-dependent.
6163 The conversion follows the special rules described in
6164 [temp.arg.nontype], and it is much more strict than an implicit
6167 This function is called twice for each template argument (see
6168 lookup_template_class for a more accurate description of this
6169 problem). This means that we need to handle expressions which
6170 are not valid in a C++ source, but can be created from the
6171 first call (for instance, casts to perform conversions). These
6172 hacks can go away after we fix the double coercion problem. */
6175 convert_nontype_argument (tree type
, tree expr
, tsubst_flags_t complain
)
6179 /* Detect immediately string literals as invalid non-type argument.
6180 This special-case is not needed for correctness (we would easily
6181 catch this later), but only to provide better diagnostic for this
6182 common user mistake. As suggested by DR 100, we do not mention
6183 linkage issues in the diagnostic as this is not the point. */
6184 /* FIXME we're making this OK. */
6185 if (TREE_CODE (expr
) == STRING_CST
)
6187 if (complain
& tf_error
)
6188 error ("%qE is not a valid template argument for type %qT "
6189 "because string literals can never be used in this context",
6194 /* Add the ADDR_EXPR now for the benefit of
6195 value_dependent_expression_p. */
6196 if (TYPE_PTROBV_P (type
)
6197 && TREE_CODE (TREE_TYPE (expr
)) == ARRAY_TYPE
)
6199 expr
= decay_conversion (expr
, complain
);
6200 if (expr
== error_mark_node
)
6201 return error_mark_node
;
6204 /* If we are in a template, EXPR may be non-dependent, but still
6205 have a syntactic, rather than semantic, form. For example, EXPR
6206 might be a SCOPE_REF, rather than the VAR_DECL to which the
6207 SCOPE_REF refers. Preserving the qualifying scope is necessary
6208 so that access checking can be performed when the template is
6209 instantiated -- but here we need the resolved form so that we can
6210 convert the argument. */
6211 bool non_dep
= false;
6212 if (TYPE_REF_OBJ_P (type
)
6213 && has_value_dependent_address (expr
))
6214 /* If we want the address and it's value-dependent, don't fold. */;
6215 else if (!type_unknown_p (expr
)
6216 && processing_template_decl
6217 && !instantiation_dependent_expression_p (expr
)
6218 && potential_constant_expression (expr
))
6220 if (error_operand_p (expr
))
6221 return error_mark_node
;
6222 expr_type
= TREE_TYPE (expr
);
6223 if (TREE_CODE (type
) == REFERENCE_TYPE
)
6224 expr
= mark_lvalue_use (expr
);
6226 expr
= mark_rvalue_use (expr
);
6228 /* If the argument is non-dependent, perform any conversions in
6229 non-dependent context as well. */
6230 processing_template_decl_sentinel
s (non_dep
);
6232 expr
= instantiate_non_dependent_expr_internal (expr
, complain
);
6234 /* 14.3.2/5: The null pointer{,-to-member} conversion is applied
6235 to a non-type argument of "nullptr". */
6236 if (expr
== nullptr_node
&& TYPE_PTR_OR_PTRMEM_P (type
))
6237 expr
= convert (type
, expr
);
6239 /* In C++11, integral or enumeration non-type template arguments can be
6240 arbitrary constant expressions. Pointer and pointer to
6241 member arguments can be general constant expressions that evaluate
6242 to a null value, but otherwise still need to be of a specific form. */
6243 if (cxx_dialect
>= cxx11
)
6245 if (TREE_CODE (expr
) == PTRMEM_CST
)
6246 /* A PTRMEM_CST is already constant, and a valid template
6247 argument for a parameter of pointer to member type, we just want
6248 to leave it in that form rather than lower it to a
6250 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
6251 expr
= maybe_constant_value (expr
);
6252 else if (cxx_dialect
>= cxx1z
)
6254 if (TREE_CODE (type
) != REFERENCE_TYPE
)
6255 expr
= maybe_constant_value (expr
);
6256 else if (REFERENCE_REF_P (expr
))
6258 expr
= TREE_OPERAND (expr
, 0);
6259 expr
= maybe_constant_value (expr
);
6260 expr
= convert_from_reference (expr
);
6263 else if (TYPE_PTR_OR_PTRMEM_P (type
))
6265 tree folded
= maybe_constant_value (expr
);
6266 if (TYPE_PTR_P (type
) ? integer_zerop (folded
)
6267 : null_member_pointer_value_p (folded
))
6272 /* HACK: Due to double coercion, we can get a
6273 NOP_EXPR<REFERENCE_TYPE>(ADDR_EXPR<POINTER_TYPE> (arg)) here,
6274 which is the tree that we built on the first call (see
6275 below when coercing to reference to object or to reference to
6276 function). We just strip everything and get to the arg.
6277 See g++.old-deja/g++.oliva/template4.C and g++.dg/template/nontype9.C
6279 if (TYPE_REF_OBJ_P (type
) || TYPE_REFFN_P (type
))
6281 tree probe_type
, probe
= expr
;
6282 if (REFERENCE_REF_P (probe
))
6283 probe
= TREE_OPERAND (probe
, 0);
6284 probe_type
= TREE_TYPE (probe
);
6285 if (TREE_CODE (probe
) == NOP_EXPR
)
6287 /* ??? Maybe we could use convert_from_reference here, but we
6288 would need to relax its constraints because the NOP_EXPR
6289 could actually change the type to something more cv-qualified,
6290 and this is not folded by convert_from_reference. */
6291 tree addr
= TREE_OPERAND (probe
, 0);
6292 if (TREE_CODE (probe_type
) == REFERENCE_TYPE
6293 && TREE_CODE (addr
) == ADDR_EXPR
6294 && TYPE_PTR_P (TREE_TYPE (addr
))
6295 && (same_type_ignoring_top_level_qualifiers_p
6296 (TREE_TYPE (probe_type
),
6297 TREE_TYPE (TREE_TYPE (addr
)))))
6299 expr
= TREE_OPERAND (addr
, 0);
6300 expr_type
= TREE_TYPE (probe_type
);
6305 /* We could also generate a NOP_EXPR(ADDR_EXPR()) when the
6306 parameter is a pointer to object, through decay and
6307 qualification conversion. Let's strip everything. */
6308 else if (TREE_CODE (expr
) == NOP_EXPR
&& TYPE_PTROBV_P (type
))
6312 if (TREE_CODE (probe
) == ADDR_EXPR
6313 && TYPE_PTR_P (TREE_TYPE (probe
)))
6315 /* Skip the ADDR_EXPR only if it is part of the decay for
6316 an array. Otherwise, it is part of the original argument
6317 in the source code. */
6318 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (probe
, 0))) == ARRAY_TYPE
)
6319 probe
= TREE_OPERAND (probe
, 0);
6321 expr_type
= TREE_TYPE (expr
);
6325 /* [temp.arg.nontype]/5, bullet 1
6327 For a non-type template-parameter of integral or enumeration type,
6328 integral promotions (_conv.prom_) and integral conversions
6329 (_conv.integral_) are applied. */
6330 if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
6332 tree t
= build_integral_nontype_arg_conv (type
, expr
, complain
);
6333 t
= maybe_constant_value (t
);
6334 if (t
!= error_mark_node
)
6337 if (!same_type_ignoring_top_level_qualifiers_p (type
, TREE_TYPE (expr
)))
6338 return error_mark_node
;
6340 /* Notice that there are constant expressions like '4 % 0' which
6341 do not fold into integer constants. */
6342 if (TREE_CODE (expr
) != INTEGER_CST
)
6344 if (complain
& tf_error
)
6346 int errs
= errorcount
, warns
= warningcount
+ werrorcount
;
6347 if (processing_template_decl
6348 && !require_potential_constant_expression (expr
))
6350 expr
= cxx_constant_value (expr
);
6351 if (errorcount
> errs
|| warningcount
+ werrorcount
> warns
)
6352 inform (EXPR_LOC_OR_LOC (expr
, input_location
),
6353 "in template argument for type %qT ", type
);
6354 if (expr
== error_mark_node
)
6356 /* else cxx_constant_value complained but gave us
6357 a real constant, so go ahead. */
6358 gcc_assert (TREE_CODE (expr
) == INTEGER_CST
);
6364 /* Avoid typedef problems. */
6365 if (TREE_TYPE (expr
) != type
)
6366 expr
= fold_convert (type
, expr
);
6368 /* [temp.arg.nontype]/5, bullet 2
6370 For a non-type template-parameter of type pointer to object,
6371 qualification conversions (_conv.qual_) and the array-to-pointer
6372 conversion (_conv.array_) are applied. */
6373 else if (TYPE_PTROBV_P (type
))
6375 /* [temp.arg.nontype]/1 (TC1 version, DR 49):
6377 A template-argument for a non-type, non-template template-parameter
6378 shall be one of: [...]
6380 -- the name of a non-type template-parameter;
6381 -- the address of an object or function with external linkage, [...]
6382 expressed as "& id-expression" where the & is optional if the name
6383 refers to a function or array, or if the corresponding
6384 template-parameter is a reference.
6386 Here, we do not care about functions, as they are invalid anyway
6387 for a parameter of type pointer-to-object. */
6389 if (DECL_P (expr
) && DECL_TEMPLATE_PARM_P (expr
))
6390 /* Non-type template parameters are OK. */
6392 else if (cxx_dialect
>= cxx11
&& integer_zerop (expr
))
6393 /* Null pointer values are OK in C++11. */;
6394 else if (TREE_CODE (expr
) != ADDR_EXPR
6395 && TREE_CODE (expr_type
) != ARRAY_TYPE
)
6399 if (complain
& tf_error
)
6400 error ("%qD is not a valid template argument "
6401 "because %qD is a variable, not the address of "
6402 "a variable", expr
, expr
);
6405 if (POINTER_TYPE_P (expr_type
))
6407 if (complain
& tf_error
)
6408 error ("%qE is not a valid template argument for %qT "
6409 "because it is not the address of a variable",
6413 /* Other values, like integer constants, might be valid
6414 non-type arguments of some other type. */
6415 return error_mark_node
;
6421 decl
= ((TREE_CODE (expr
) == ADDR_EXPR
)
6422 ? TREE_OPERAND (expr
, 0) : expr
);
6425 if (complain
& tf_error
)
6426 error ("%qE is not a valid template argument of type %qT "
6427 "because %qE is not a variable", expr
, type
, decl
);
6430 else if (cxx_dialect
< cxx11
&& !DECL_EXTERNAL_LINKAGE_P (decl
))
6432 if (complain
& tf_error
)
6433 error ("%qE is not a valid template argument of type %qT "
6434 "because %qD does not have external linkage",
6438 else if (cxx_dialect
>= cxx11
&& decl_linkage (decl
) == lk_none
)
6440 if (complain
& tf_error
)
6441 error ("%qE is not a valid template argument of type %qT "
6442 "because %qD has no linkage", expr
, type
, decl
);
6447 expr
= decay_conversion (expr
, complain
);
6448 if (expr
== error_mark_node
)
6449 return error_mark_node
;
6451 expr
= perform_qualification_conversions (type
, expr
);
6452 if (expr
== error_mark_node
)
6453 return error_mark_node
;
6455 /* [temp.arg.nontype]/5, bullet 3
6457 For a non-type template-parameter of type reference to object, no
6458 conversions apply. The type referred to by the reference may be more
6459 cv-qualified than the (otherwise identical) type of the
6460 template-argument. The template-parameter is bound directly to the
6461 template-argument, which must be an lvalue. */
6462 else if (TYPE_REF_OBJ_P (type
))
6464 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type
),
6466 return error_mark_node
;
6468 if (!at_least_as_qualified_p (TREE_TYPE (type
), expr_type
))
6470 if (complain
& tf_error
)
6471 error ("%qE is not a valid template argument for type %qT "
6472 "because of conflicts in cv-qualification", expr
, type
);
6476 if (!real_lvalue_p (expr
))
6478 if (complain
& tf_error
)
6479 error ("%qE is not a valid template argument for type %qT "
6480 "because it is not an lvalue", expr
, type
);
6484 /* [temp.arg.nontype]/1
6486 A template-argument for a non-type, non-template template-parameter
6487 shall be one of: [...]
6489 -- the address of an object or function with external linkage. */
6490 if (INDIRECT_REF_P (expr
)
6491 && TYPE_REF_OBJ_P (TREE_TYPE (TREE_OPERAND (expr
, 0))))
6493 expr
= TREE_OPERAND (expr
, 0);
6496 if (complain
& tf_error
)
6497 error ("%q#D is not a valid template argument for type %qT "
6498 "because a reference variable does not have a constant "
6499 "address", expr
, type
);
6506 if (complain
& tf_error
)
6507 error ("%qE is not a valid template argument for type %qT "
6508 "because it is not an object with linkage",
6513 /* DR 1155 allows internal linkage in C++11 and up. */
6514 linkage_kind linkage
= decl_linkage (expr
);
6515 if (linkage
< (cxx_dialect
>= cxx11
? lk_internal
: lk_external
))
6517 if (complain
& tf_error
)
6518 error ("%qE is not a valid template argument for type %qT "
6519 "because object %qD does not have linkage",
6524 expr
= build_nop (type
, build_address (expr
));
6526 /* [temp.arg.nontype]/5, bullet 4
6528 For a non-type template-parameter of type pointer to function, only
6529 the function-to-pointer conversion (_conv.func_) is applied. If the
6530 template-argument represents a set of overloaded functions (or a
6531 pointer to such), the matching function is selected from the set
6533 else if (TYPE_PTRFN_P (type
))
6535 /* If the argument is a template-id, we might not have enough
6536 context information to decay the pointer. */
6537 if (!type_unknown_p (expr_type
))
6539 expr
= decay_conversion (expr
, complain
);
6540 if (expr
== error_mark_node
)
6541 return error_mark_node
;
6544 if (cxx_dialect
>= cxx11
&& integer_zerop (expr
))
6545 /* Null pointer values are OK in C++11. */
6546 return perform_qualification_conversions (type
, expr
);
6548 expr
= convert_nontype_argument_function (type
, expr
, complain
);
6549 if (!expr
|| expr
== error_mark_node
)
6552 /* [temp.arg.nontype]/5, bullet 5
6554 For a non-type template-parameter of type reference to function, no
6555 conversions apply. If the template-argument represents a set of
6556 overloaded functions, the matching function is selected from the set
6558 else if (TYPE_REFFN_P (type
))
6560 if (TREE_CODE (expr
) == ADDR_EXPR
)
6562 if (complain
& tf_error
)
6564 error ("%qE is not a valid template argument for type %qT "
6565 "because it is a pointer", expr
, type
);
6566 inform (input_location
, "try using %qE instead",
6567 TREE_OPERAND (expr
, 0));
6572 expr
= convert_nontype_argument_function (type
, expr
, complain
);
6573 if (!expr
|| expr
== error_mark_node
)
6576 expr
= build_nop (type
, build_address (expr
));
6578 /* [temp.arg.nontype]/5, bullet 6
6580 For a non-type template-parameter of type pointer to member function,
6581 no conversions apply. If the template-argument represents a set of
6582 overloaded member functions, the matching member function is selected
6583 from the set (_over.over_). */
6584 else if (TYPE_PTRMEMFUNC_P (type
))
6586 expr
= instantiate_type (type
, expr
, tf_none
);
6587 if (expr
== error_mark_node
)
6588 return error_mark_node
;
6590 /* [temp.arg.nontype] bullet 1 says the pointer to member
6591 expression must be a pointer-to-member constant. */
6592 if (!check_valid_ptrmem_cst_expr (type
, expr
, complain
))
6593 return error_mark_node
;
6595 /* There is no way to disable standard conversions in
6596 resolve_address_of_overloaded_function (called by
6597 instantiate_type). It is possible that the call succeeded by
6598 converting &B::I to &D::I (where B is a base of D), so we need
6599 to reject this conversion here.
6601 Actually, even if there was a way to disable standard conversions,
6602 it would still be better to reject them here so that we can
6603 provide a superior diagnostic. */
6604 if (!same_type_p (TREE_TYPE (expr
), type
))
6606 if (complain
& tf_error
)
6608 error ("%qE is not a valid template argument for type %qT "
6609 "because it is of type %qT", expr
, type
,
6611 /* If we are just one standard conversion off, explain. */
6612 if (can_convert_standard (type
, TREE_TYPE (expr
), complain
))
6613 inform (input_location
,
6614 "standard conversions are not allowed in this context");
6619 /* [temp.arg.nontype]/5, bullet 7
6621 For a non-type template-parameter of type pointer to data member,
6622 qualification conversions (_conv.qual_) are applied. */
6623 else if (TYPE_PTRDATAMEM_P (type
))
6625 /* [temp.arg.nontype] bullet 1 says the pointer to member
6626 expression must be a pointer-to-member constant. */
6627 if (!check_valid_ptrmem_cst_expr (type
, expr
, complain
))
6628 return error_mark_node
;
6630 expr
= perform_qualification_conversions (type
, expr
);
6631 if (expr
== error_mark_node
)
6634 else if (NULLPTR_TYPE_P (type
))
6636 if (expr
!= nullptr_node
)
6638 if (complain
& tf_error
)
6639 error ("%qE is not a valid template argument for type %qT "
6640 "because it is of type %qT", expr
, type
, TREE_TYPE (expr
));
6645 /* A template non-type parameter must be one of the above. */
6649 /* Sanity check: did we actually convert the argument to the
6651 gcc_assert (same_type_ignoring_top_level_qualifiers_p
6652 (type
, TREE_TYPE (expr
)));
6653 return convert_from_reference (expr
);
6656 /* Subroutine of coerce_template_template_parms, which returns 1 if
6657 PARM_PARM and ARG_PARM match using the rule for the template
6658 parameters of template template parameters. Both PARM and ARG are
6659 template parameters; the rest of the arguments are the same as for
6660 coerce_template_template_parms.
6663 coerce_template_template_parm (tree parm
,
6665 tsubst_flags_t complain
,
6669 if (arg
== NULL_TREE
|| error_operand_p (arg
)
6670 || parm
== NULL_TREE
|| error_operand_p (parm
))
6673 if (TREE_CODE (arg
) != TREE_CODE (parm
))
6676 switch (TREE_CODE (parm
))
6679 /* We encounter instantiations of templates like
6680 template <template <template <class> class> class TT>
6683 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
6684 tree argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
6686 if (!coerce_template_template_parms
6687 (parmparm
, argparm
, complain
, in_decl
, outer_args
))
6693 if (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (arg
))
6694 && !TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
)))
6695 /* Argument is a parameter pack but parameter is not. */
6700 /* The tsubst call is used to handle cases such as
6702 template <int> class C {};
6703 template <class T, template <T> class TT> class D {};
6706 i.e. the parameter list of TT depends on earlier parameters. */
6707 if (!uses_template_parms (TREE_TYPE (arg
)))
6709 tree t
= tsubst (TREE_TYPE (parm
), outer_args
, complain
, in_decl
);
6710 if (!uses_template_parms (t
)
6711 && !same_type_p (t
, TREE_TYPE (arg
)))
6715 if (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (arg
))
6716 && !TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))
6717 /* Argument is a parameter pack but parameter is not. */
6730 /* Return 1 if PARM_PARMS and ARG_PARMS matches using rule for
6731 template template parameters. Both PARM_PARMS and ARG_PARMS are
6732 vectors of TREE_LIST nodes containing TYPE_DECL, TEMPLATE_DECL
6735 Consider the example:
6736 template <class T> class A;
6737 template<template <class U> class TT> class B;
6739 For B<A>, PARM_PARMS are the parameters to TT, while ARG_PARMS are
6740 the parameters to A, and OUTER_ARGS contains A. */
6743 coerce_template_template_parms (tree parm_parms
,
6745 tsubst_flags_t complain
,
6749 int nparms
, nargs
, i
;
6753 gcc_assert (TREE_CODE (parm_parms
) == TREE_VEC
);
6754 gcc_assert (TREE_CODE (arg_parms
) == TREE_VEC
);
6756 nparms
= TREE_VEC_LENGTH (parm_parms
);
6757 nargs
= TREE_VEC_LENGTH (arg_parms
);
6759 /* Determine whether we have a parameter pack at the end of the
6760 template template parameter's template parameter list. */
6761 if (TREE_VEC_ELT (parm_parms
, nparms
- 1) != error_mark_node
)
6763 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, nparms
- 1));
6765 if (error_operand_p (parm
))
6768 switch (TREE_CODE (parm
))
6772 if (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
)))
6777 if (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))
6787 && !(variadic_p
&& nargs
>= nparms
- 1))
6790 /* Check all of the template parameters except the parameter pack at
6791 the end (if any). */
6792 for (i
= 0; i
< nparms
- variadic_p
; ++i
)
6794 if (TREE_VEC_ELT (parm_parms
, i
) == error_mark_node
6795 || TREE_VEC_ELT (arg_parms
, i
) == error_mark_node
)
6798 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
6799 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
6801 if (!coerce_template_template_parm (parm
, arg
, complain
, in_decl
,
6809 /* Check each of the template parameters in the template
6810 argument against the template parameter pack at the end of
6811 the template template parameter. */
6812 if (TREE_VEC_ELT (parm_parms
, i
) == error_mark_node
)
6815 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
6817 for (; i
< nargs
; ++i
)
6819 if (TREE_VEC_ELT (arg_parms
, i
) == error_mark_node
)
6822 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
6824 if (!coerce_template_template_parm (parm
, arg
, complain
, in_decl
,
6833 /* Verifies that the deduced template arguments (in TARGS) for the
6834 template template parameters (in TPARMS) represent valid bindings,
6835 by comparing the template parameter list of each template argument
6836 to the template parameter list of its corresponding template
6837 template parameter, in accordance with DR150. This
6838 routine can only be called after all template arguments have been
6839 deduced. It will return TRUE if all of the template template
6840 parameter bindings are okay, FALSE otherwise. */
6842 template_template_parm_bindings_ok_p (tree tparms
, tree targs
)
6844 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
6847 /* We're dealing with template parms in this process. */
6848 ++processing_template_decl
;
6850 targs
= INNERMOST_TEMPLATE_ARGS (targs
);
6852 for (i
= 0; i
< ntparms
; ++i
)
6854 tree tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
6855 tree targ
= TREE_VEC_ELT (targs
, i
);
6857 if (TREE_CODE (tparm
) == TEMPLATE_DECL
&& targ
)
6859 tree packed_args
= NULL_TREE
;
6862 if (ARGUMENT_PACK_P (targ
))
6864 /* Look inside the argument pack. */
6865 packed_args
= ARGUMENT_PACK_ARGS (targ
);
6866 len
= TREE_VEC_LENGTH (packed_args
);
6869 for (idx
= 0; idx
< len
; ++idx
)
6871 tree targ_parms
= NULL_TREE
;
6874 /* Extract the next argument from the argument
6876 targ
= TREE_VEC_ELT (packed_args
, idx
);
6878 if (PACK_EXPANSION_P (targ
))
6879 /* Look at the pattern of the pack expansion. */
6880 targ
= PACK_EXPANSION_PATTERN (targ
);
6882 /* Extract the template parameters from the template
6884 if (TREE_CODE (targ
) == TEMPLATE_DECL
)
6885 targ_parms
= DECL_INNERMOST_TEMPLATE_PARMS (targ
);
6886 else if (TREE_CODE (targ
) == TEMPLATE_TEMPLATE_PARM
)
6887 targ_parms
= DECL_INNERMOST_TEMPLATE_PARMS (TYPE_NAME (targ
));
6889 /* Verify that we can coerce the template template
6890 parameters from the template argument to the template
6891 parameter. This requires an exact match. */
6893 && !coerce_template_template_parms
6894 (DECL_INNERMOST_TEMPLATE_PARMS (tparm
),
6909 --processing_template_decl
;
6913 /* Since type attributes aren't mangled, we need to strip them from
6914 template type arguments. */
6917 canonicalize_type_argument (tree arg
, tsubst_flags_t complain
)
6919 if (!arg
|| arg
== error_mark_node
|| arg
== TYPE_CANONICAL (arg
))
6921 bool removed_attributes
= false;
6922 tree canon
= strip_typedefs (arg
, &removed_attributes
);
6923 if (removed_attributes
6924 && (complain
& tf_warning
))
6925 warning (0, "ignoring attributes on template argument %qT", arg
);
6929 // A template declaration can be substituted for a constrained
6930 // template template parameter only when the argument is more
6931 // constrained than the parameter.
6933 is_compatible_template_arg (tree parm
, tree arg
)
6935 tree parm_cons
= get_constraints (parm
);
6937 /* For now, allow constrained template template arguments
6938 and unconstrained template template parameters. */
6939 if (parm_cons
== NULL_TREE
)
6942 tree arg_cons
= get_constraints (arg
);
6944 // If the template parameter is constrained, we need to rewrite its
6945 // constraints in terms of the ARG's template parameters. This ensures
6946 // that all of the template parameter types will have the same depth.
6948 // Note that this is only valid when coerce_template_template_parm is
6949 // true for the innermost template parameters of PARM and ARG. In other
6950 // words, because coercion is successful, this conversion will be valid.
6953 tree args
= template_parms_to_args (DECL_TEMPLATE_PARMS (arg
));
6954 parm_cons
= tsubst_constraint_info (parm_cons
,
6955 INNERMOST_TEMPLATE_ARGS (args
),
6956 tf_none
, NULL_TREE
);
6957 if (parm_cons
== error_mark_node
)
6961 return subsumes (parm_cons
, arg_cons
);
6964 // Convert a placeholder argument into a binding to the original
6965 // parameter. The original parameter is saved as the TREE_TYPE of
6968 convert_wildcard_argument (tree parm
, tree arg
)
6970 TREE_TYPE (arg
) = parm
;
6974 /* Convert the indicated template ARG as necessary to match the
6975 indicated template PARM. Returns the converted ARG, or
6976 error_mark_node if the conversion was unsuccessful. Error and
6977 warning messages are issued under control of COMPLAIN. This
6978 conversion is for the Ith parameter in the parameter list. ARGS is
6979 the full set of template arguments deduced so far. */
6982 convert_template_argument (tree parm
,
6985 tsubst_flags_t complain
,
6991 int is_type
, requires_type
, is_tmpl_type
, requires_tmpl_type
;
6993 if (parm
== error_mark_node
)
6994 return error_mark_node
;
6996 /* Trivially convert placeholders. */
6997 if (TREE_CODE (arg
) == WILDCARD_DECL
)
6998 return convert_wildcard_argument (parm
, arg
);
7000 if (TREE_CODE (arg
) == TREE_LIST
7001 && TREE_CODE (TREE_VALUE (arg
)) == OFFSET_REF
)
7003 /* The template argument was the name of some
7004 member function. That's usually
7005 invalid, but static members are OK. In any
7006 case, grab the underlying fields/functions
7007 and issue an error later if required. */
7008 orig_arg
= TREE_VALUE (arg
);
7009 TREE_TYPE (arg
) = unknown_type_node
;
7014 requires_tmpl_type
= TREE_CODE (parm
) == TEMPLATE_DECL
;
7015 requires_type
= (TREE_CODE (parm
) == TYPE_DECL
7016 || requires_tmpl_type
);
7018 /* When determining whether an argument pack expansion is a template,
7019 look at the pattern. */
7020 if (TREE_CODE (arg
) == TYPE_PACK_EXPANSION
)
7021 arg
= PACK_EXPANSION_PATTERN (arg
);
7023 /* Deal with an injected-class-name used as a template template arg. */
7024 if (requires_tmpl_type
&& CLASS_TYPE_P (arg
))
7026 tree t
= maybe_get_template_decl_from_type_decl (TYPE_NAME (arg
));
7027 if (TREE_CODE (t
) == TEMPLATE_DECL
)
7029 if (cxx_dialect
>= cxx11
)
7030 /* OK under DR 1004. */;
7031 else if (complain
& tf_warning_or_error
)
7032 pedwarn (input_location
, OPT_Wpedantic
, "injected-class-name %qD"
7033 " used as template template argument", TYPE_NAME (arg
));
7034 else if (flag_pedantic_errors
)
7042 ((TREE_CODE (arg
) == TEMPLATE_DECL
7043 && TREE_CODE (DECL_TEMPLATE_RESULT (arg
)) == TYPE_DECL
)
7044 || (requires_tmpl_type
&& TREE_CODE (arg
) == TYPE_ARGUMENT_PACK
)
7045 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
7046 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
);
7049 && (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
7050 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
))
7051 arg
= TYPE_STUB_DECL (arg
);
7053 is_type
= TYPE_P (arg
) || is_tmpl_type
;
7055 if (requires_type
&& ! is_type
&& TREE_CODE (arg
) == SCOPE_REF
7056 && TREE_CODE (TREE_OPERAND (arg
, 0)) == TEMPLATE_TYPE_PARM
)
7058 if (TREE_CODE (TREE_OPERAND (arg
, 1)) == BIT_NOT_EXPR
)
7060 if (complain
& tf_error
)
7061 error ("invalid use of destructor %qE as a type", orig_arg
);
7062 return error_mark_node
;
7065 permerror (input_location
,
7066 "to refer to a type member of a template parameter, "
7067 "use %<typename %E%>", orig_arg
);
7069 orig_arg
= make_typename_type (TREE_OPERAND (arg
, 0),
7070 TREE_OPERAND (arg
, 1),
7076 if (is_type
!= requires_type
)
7080 if (complain
& tf_error
)
7082 error ("type/value mismatch at argument %d in template "
7083 "parameter list for %qD",
7086 inform (input_location
,
7087 " expected a constant of type %qT, got %qT",
7089 (DECL_P (arg
) ? DECL_NAME (arg
) : orig_arg
));
7090 else if (requires_tmpl_type
)
7091 inform (input_location
,
7092 " expected a class template, got %qE", orig_arg
);
7094 inform (input_location
,
7095 " expected a type, got %qE", orig_arg
);
7098 return error_mark_node
;
7100 if (is_tmpl_type
^ requires_tmpl_type
)
7102 if (in_decl
&& (complain
& tf_error
))
7104 error ("type/value mismatch at argument %d in template "
7105 "parameter list for %qD",
7108 inform (input_location
,
7109 " expected a type, got %qT", DECL_NAME (arg
));
7111 inform (input_location
,
7112 " expected a class template, got %qT", orig_arg
);
7114 return error_mark_node
;
7119 if (requires_tmpl_type
)
7121 if (template_parameter_pack_p (parm
) && ARGUMENT_PACK_P (orig_arg
))
7123 else if (TREE_CODE (TREE_TYPE (arg
)) == UNBOUND_CLASS_TEMPLATE
)
7124 /* The number of argument required is not known yet.
7125 Just accept it for now. */
7126 val
= TREE_TYPE (arg
);
7129 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
7132 /* Strip alias templates that are equivalent to another
7134 arg
= get_underlying_template (arg
);
7135 argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
7137 if (coerce_template_template_parms (parmparm
, argparm
,
7143 /* TEMPLATE_TEMPLATE_PARM node is preferred over
7145 if (val
!= error_mark_node
)
7147 if (DECL_TEMPLATE_TEMPLATE_PARM_P (val
))
7148 val
= TREE_TYPE (val
);
7149 if (TREE_CODE (orig_arg
) == TYPE_PACK_EXPANSION
)
7150 val
= make_pack_expansion (val
);
7155 if (in_decl
&& (complain
& tf_error
))
7157 error ("type/value mismatch at argument %d in "
7158 "template parameter list for %qD",
7160 inform (input_location
,
7161 " expected a template of type %qD, got %qT",
7165 val
= error_mark_node
;
7168 // Check that the constraints are compatible before allowing the
7170 if (val
!= error_mark_node
)
7171 if (!is_compatible_template_arg (parm
, arg
))
7173 if (in_decl
&& (complain
& tf_error
))
7175 error ("constraint mismatch at argument %d in "
7176 "template parameter list for %qD",
7178 inform (input_location
, " expected %qD but got %qD",
7181 val
= error_mark_node
;
7187 /* We only form one instance of each template specialization.
7188 Therefore, if we use a non-canonical variant (i.e., a
7189 typedef), any future messages referring to the type will use
7190 the typedef, which is confusing if those future uses do not
7191 themselves also use the typedef. */
7193 val
= canonicalize_type_argument (val
, complain
);
7197 tree t
= tsubst (TREE_TYPE (parm
), args
, complain
, in_decl
);
7199 if (invalid_nontype_parm_type_p (t
, complain
))
7200 return error_mark_node
;
7202 if (template_parameter_pack_p (parm
) && ARGUMENT_PACK_P (orig_arg
))
7204 if (same_type_p (t
, TREE_TYPE (orig_arg
)))
7208 /* Not sure if this is reachable, but it doesn't hurt
7210 error ("type mismatch in nontype parameter pack");
7211 val
= error_mark_node
;
7214 else if (!dependent_template_arg_p (orig_arg
)
7215 && !uses_template_parms (t
))
7216 /* We used to call digest_init here. However, digest_init
7217 will report errors, which we don't want when complain
7218 is zero. More importantly, digest_init will try too
7219 hard to convert things: for example, `0' should not be
7220 converted to pointer type at this point according to
7221 the standard. Accepting this is not merely an
7222 extension, since deciding whether or not these
7223 conversions can occur is part of determining which
7224 function template to call, or whether a given explicit
7225 argument specification is valid. */
7226 val
= convert_nontype_argument (t
, orig_arg
, complain
);
7229 bool removed_attr
= false;
7230 val
= strip_typedefs_expr (orig_arg
, &removed_attr
);
7233 if (val
== NULL_TREE
)
7234 val
= error_mark_node
;
7235 else if (val
== error_mark_node
&& (complain
& tf_error
))
7236 error ("could not convert template argument %qE to %qT", orig_arg
, t
);
7238 if (INDIRECT_REF_P (val
))
7240 /* Reject template arguments that are references to built-in
7241 functions with no library fallbacks. */
7242 const_tree inner
= TREE_OPERAND (val
, 0);
7243 if (TREE_CODE (TREE_TYPE (inner
)) == REFERENCE_TYPE
7244 && TREE_CODE (TREE_TYPE (TREE_TYPE (inner
))) == FUNCTION_TYPE
7245 && TREE_CODE (TREE_TYPE (inner
)) == REFERENCE_TYPE
7246 && reject_gcc_builtin (TREE_OPERAND (inner
, 0)))
7247 return error_mark_node
;
7250 if (TREE_CODE (val
) == SCOPE_REF
)
7252 /* Strip typedefs from the SCOPE_REF. */
7253 tree type
= canonicalize_type_argument (TREE_TYPE (val
), complain
);
7254 tree scope
= canonicalize_type_argument (TREE_OPERAND (val
, 0),
7256 val
= build_qualified_name (type
, scope
, TREE_OPERAND (val
, 1),
7257 QUALIFIED_NAME_IS_TEMPLATE (val
));
7264 /* Coerces the remaining template arguments in INNER_ARGS (from
7265 ARG_IDX to the end) into the parameter pack at PARM_IDX in PARMS.
7266 Returns the coerced argument pack. PARM_IDX is the position of this
7267 parameter in the template parameter list. ARGS is the original
7268 template argument list. */
7270 coerce_template_parameter_pack (tree parms
,
7278 tsubst_flags_t complain
)
7280 tree parm
= TREE_VEC_ELT (parms
, parm_idx
);
7281 int nargs
= inner_args
? NUM_TMPL_ARGS (inner_args
) : 0;
7284 tree packed_parms
= NULL_TREE
;
7286 if (arg_idx
> nargs
)
7289 if (tree packs
= fixed_parameter_pack_p (TREE_VALUE (parm
)))
7291 /* When the template parameter is a non-type template parameter pack
7292 or template template parameter pack whose type or template
7293 parameters use parameter packs, we know exactly how many arguments
7294 we are looking for. Build a vector of the instantiated decls for
7295 these template parameters in PACKED_PARMS. */
7296 /* We can't use make_pack_expansion here because it would interpret a
7297 _DECL as a use rather than a declaration. */
7298 tree decl
= TREE_VALUE (parm
);
7299 tree exp
= cxx_make_type (TYPE_PACK_EXPANSION
);
7300 SET_PACK_EXPANSION_PATTERN (exp
, decl
);
7301 PACK_EXPANSION_PARAMETER_PACKS (exp
) = packs
;
7302 SET_TYPE_STRUCTURAL_EQUALITY (exp
);
7304 TREE_VEC_LENGTH (args
)--;
7305 packed_parms
= tsubst_pack_expansion (exp
, args
, complain
, decl
);
7306 TREE_VEC_LENGTH (args
)++;
7308 if (packed_parms
== error_mark_node
)
7309 return error_mark_node
;
7311 /* If we're doing a partial instantiation of a member template,
7312 verify that all of the types used for the non-type
7313 template parameter pack are, in fact, valid for non-type
7314 template parameters. */
7316 && PACK_EXPANSION_P (TREE_VEC_ELT (inner_args
, arg_idx
)))
7318 int j
, len
= TREE_VEC_LENGTH (packed_parms
);
7319 for (j
= 0; j
< len
; ++j
)
7321 tree t
= TREE_TYPE (TREE_VEC_ELT (packed_parms
, j
));
7322 if (invalid_nontype_parm_type_p (t
, complain
))
7323 return error_mark_node
;
7325 /* We don't know how many args we have yet, just
7326 use the unconverted ones for now. */
7330 packed_args
= make_tree_vec (TREE_VEC_LENGTH (packed_parms
));
7332 /* Check if we have a placeholder pack, which indicates we're
7333 in the context of a introduction list. In that case we want
7334 to match this pack to the single placeholder. */
7335 else if (arg_idx
< nargs
7336 && TREE_CODE (TREE_VEC_ELT (inner_args
, arg_idx
)) == WILDCARD_DECL
7337 && WILDCARD_PACK_P (TREE_VEC_ELT (inner_args
, arg_idx
)))
7339 nargs
= arg_idx
+ 1;
7340 packed_args
= make_tree_vec (1);
7343 packed_args
= make_tree_vec (nargs
- arg_idx
);
7345 /* Convert the remaining arguments, which will be a part of the
7346 parameter pack "parm". */
7347 for (; arg_idx
< nargs
; ++arg_idx
)
7349 tree arg
= TREE_VEC_ELT (inner_args
, arg_idx
);
7350 tree actual_parm
= TREE_VALUE (parm
);
7351 int pack_idx
= arg_idx
- parm_idx
;
7355 /* Once we've packed as many args as we have types, stop. */
7356 if (pack_idx
>= TREE_VEC_LENGTH (packed_parms
))
7358 else if (PACK_EXPANSION_P (arg
))
7359 /* We don't know how many args we have yet, just
7360 use the unconverted ones for now. */
7363 actual_parm
= TREE_VEC_ELT (packed_parms
, pack_idx
);
7366 if (arg
== error_mark_node
)
7368 if (complain
& tf_error
)
7369 error ("template argument %d is invalid", arg_idx
+ 1);
7372 arg
= convert_template_argument (actual_parm
,
7373 arg
, new_args
, complain
, parm_idx
,
7375 if (arg
== error_mark_node
)
7377 TREE_VEC_ELT (packed_args
, pack_idx
) = arg
;
7380 if (arg_idx
- parm_idx
< TREE_VEC_LENGTH (packed_args
)
7381 && TREE_VEC_LENGTH (packed_args
) > 0)
7383 if (complain
& tf_error
)
7384 error ("wrong number of template arguments (%d, should be %d)",
7385 arg_idx
- parm_idx
, TREE_VEC_LENGTH (packed_args
));
7386 return error_mark_node
;
7389 if (TREE_CODE (TREE_VALUE (parm
)) == TYPE_DECL
7390 || TREE_CODE (TREE_VALUE (parm
)) == TEMPLATE_DECL
)
7391 argument_pack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
7394 argument_pack
= make_node (NONTYPE_ARGUMENT_PACK
);
7395 TREE_TYPE (argument_pack
)
7396 = tsubst (TREE_TYPE (TREE_VALUE (parm
)), new_args
, complain
, in_decl
);
7397 TREE_CONSTANT (argument_pack
) = 1;
7400 SET_ARGUMENT_PACK_ARGS (argument_pack
, packed_args
);
7401 #ifdef ENABLE_CHECKING
7402 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (packed_args
,
7403 TREE_VEC_LENGTH (packed_args
));
7405 return argument_pack
;
7408 /* Returns the number of pack expansions in the template argument vector
7412 pack_expansion_args_count (tree args
)
7417 for (i
= 0; i
< TREE_VEC_LENGTH (args
); ++i
)
7419 tree elt
= TREE_VEC_ELT (args
, i
);
7420 if (elt
&& PACK_EXPANSION_P (elt
))
7426 /* Convert all template arguments to their appropriate types, and
7427 return a vector containing the innermost resulting template
7428 arguments. If any error occurs, return error_mark_node. Error and
7429 warning messages are issued under control of COMPLAIN.
7431 If REQUIRE_ALL_ARGS is false, argument deduction will be performed
7432 for arguments not specified in ARGS. Otherwise, if
7433 USE_DEFAULT_ARGS is true, default arguments will be used to fill in
7434 unspecified arguments. If REQUIRE_ALL_ARGS is true, but
7435 USE_DEFAULT_ARGS is false, then all arguments must be specified in
7439 coerce_template_parms (tree parms
,
7442 tsubst_flags_t complain
,
7443 bool require_all_args
,
7444 bool use_default_args
)
7446 int nparms
, nargs
, parm_idx
, arg_idx
, lost
= 0;
7447 tree orig_inner_args
;
7450 tree new_inner_args
;
7451 int saved_unevaluated_operand
;
7452 int saved_inhibit_evaluation_warnings
;
7454 /* When used as a boolean value, indicates whether this is a
7455 variadic template parameter list. Since it's an int, we can also
7456 subtract it from nparms to get the number of non-variadic
7459 int variadic_args_p
= 0;
7460 int post_variadic_parms
= 0;
7462 /* Likewise for parameters with default arguments. */
7465 if (args
== error_mark_node
)
7466 return error_mark_node
;
7468 nparms
= TREE_VEC_LENGTH (parms
);
7470 /* Determine if there are any parameter packs or default arguments. */
7471 for (parm_idx
= 0; parm_idx
< nparms
; ++parm_idx
)
7473 tree parm
= TREE_VEC_ELT (parms
, parm_idx
);
7475 ++post_variadic_parms
;
7476 if (template_parameter_pack_p (TREE_VALUE (parm
)))
7478 if (TREE_PURPOSE (parm
))
7482 inner_args
= orig_inner_args
= INNERMOST_TEMPLATE_ARGS (args
);
7483 /* If there are no parameters that follow a parameter pack, we need to
7484 expand any argument packs so that we can deduce a parameter pack from
7485 some non-packed args followed by an argument pack, as in variadic85.C.
7486 If there are such parameters, we need to leave argument packs intact
7487 so the arguments are assigned properly. This can happen when dealing
7488 with a nested class inside a partial specialization of a class
7489 template, as in variadic92.C, or when deducing a template parameter pack
7490 from a sub-declarator, as in variadic114.C. */
7491 if (!post_variadic_parms
)
7492 inner_args
= expand_template_argument_pack (inner_args
);
7494 /* Count any pack expansion args. */
7495 variadic_args_p
= pack_expansion_args_count (inner_args
);
7497 nargs
= inner_args
? NUM_TMPL_ARGS (inner_args
) : 0;
7498 if ((nargs
> nparms
&& !variadic_p
)
7499 || (nargs
< nparms
- variadic_p
7502 && (!use_default_args
7503 || (TREE_VEC_ELT (parms
, nargs
) != error_mark_node
7504 && !TREE_PURPOSE (TREE_VEC_ELT (parms
, nargs
))))))
7506 if (complain
& tf_error
)
7508 if (variadic_p
|| default_p
)
7510 nparms
-= variadic_p
+ default_p
;
7511 error ("wrong number of template arguments "
7512 "(%d, should be at least %d)", nargs
, nparms
);
7515 error ("wrong number of template arguments "
7516 "(%d, should be %d)", nargs
, nparms
);
7519 inform (DECL_SOURCE_LOCATION (in_decl
),
7520 "provided for %qD", in_decl
);
7523 return error_mark_node
;
7525 /* We can't pass a pack expansion to a non-pack parameter of an alias
7526 template (DR 1430). */
7528 && (DECL_ALIAS_TEMPLATE_P (in_decl
)
7529 || concept_template_p (in_decl
))
7531 && nargs
- variadic_args_p
< nparms
- variadic_p
)
7533 if (complain
& tf_error
)
7535 for (int i
= 0; i
< TREE_VEC_LENGTH (inner_args
); ++i
)
7537 tree arg
= TREE_VEC_ELT (inner_args
, i
);
7538 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
7540 if (PACK_EXPANSION_P (arg
)
7541 && !template_parameter_pack_p (parm
))
7543 if (DECL_ALIAS_TEMPLATE_P (in_decl
))
7544 error_at (location_of (arg
),
7545 "pack expansion argument for non-pack parameter "
7546 "%qD of alias template %qD", parm
, in_decl
);
7548 error_at (location_of (arg
),
7549 "pack expansion argument for non-pack parameter "
7550 "%qD of concept %qD", parm
, in_decl
);
7551 inform (DECL_SOURCE_LOCATION (parm
), "declared here");
7558 return error_mark_node
;
7561 /* We need to evaluate the template arguments, even though this
7562 template-id may be nested within a "sizeof". */
7563 saved_unevaluated_operand
= cp_unevaluated_operand
;
7564 cp_unevaluated_operand
= 0;
7565 saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
7566 c_inhibit_evaluation_warnings
= 0;
7567 new_inner_args
= make_tree_vec (nparms
);
7568 new_args
= add_outermost_template_args (args
, new_inner_args
);
7569 int pack_adjust
= 0;
7570 for (parm_idx
= 0, arg_idx
= 0; parm_idx
< nparms
; parm_idx
++, arg_idx
++)
7575 /* Get the Ith template parameter. */
7576 parm
= TREE_VEC_ELT (parms
, parm_idx
);
7578 if (parm
== error_mark_node
)
7580 TREE_VEC_ELT (new_inner_args
, arg_idx
) = error_mark_node
;
7584 /* Calculate the next argument. */
7585 if (arg_idx
< nargs
)
7586 arg
= TREE_VEC_ELT (inner_args
, arg_idx
);
7590 if (template_parameter_pack_p (TREE_VALUE (parm
))
7591 && !(arg
&& ARGUMENT_PACK_P (arg
)))
7593 /* Some arguments will be placed in the
7594 template parameter pack PARM. */
7595 arg
= coerce_template_parameter_pack (parms
, parm_idx
, args
,
7596 inner_args
, arg_idx
,
7600 if (arg
== NULL_TREE
)
7602 /* We don't know how many args we have yet, just use the
7603 unconverted (and still packed) ones for now. */
7604 new_inner_args
= orig_inner_args
;
7609 TREE_VEC_ELT (new_inner_args
, parm_idx
) = arg
;
7611 /* Store this argument. */
7612 if (arg
== error_mark_node
)
7615 /* We are done with all of the arguments. */
7620 pack_adjust
= TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg
)) - 1;
7621 arg_idx
+= pack_adjust
;
7628 if (PACK_EXPANSION_P (arg
))
7630 /* "If every valid specialization of a variadic template
7631 requires an empty template parameter pack, the template is
7632 ill-formed, no diagnostic required." So check that the
7633 pattern works with this parameter. */
7634 tree pattern
= PACK_EXPANSION_PATTERN (arg
);
7635 tree conv
= convert_template_argument (TREE_VALUE (parm
),
7639 if (conv
== error_mark_node
)
7641 inform (input_location
, "so any instantiation with a "
7642 "non-empty parameter pack would be ill-formed");
7645 else if (TYPE_P (conv
) && !TYPE_P (pattern
))
7646 /* Recover from missing typename. */
7647 TREE_VEC_ELT (inner_args
, arg_idx
)
7648 = make_pack_expansion (conv
);
7650 /* We don't know how many args we have yet, just
7651 use the unconverted ones for now. */
7652 new_inner_args
= inner_args
;
7657 else if (require_all_args
)
7659 /* There must be a default arg in this case. */
7660 arg
= tsubst_template_arg (TREE_PURPOSE (parm
), new_args
,
7662 /* The position of the first default template argument,
7663 is also the number of non-defaulted arguments in NEW_INNER_ARGS.
7665 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
))
7666 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
,
7667 arg_idx
- pack_adjust
);
7672 if (arg
== error_mark_node
)
7674 if (complain
& tf_error
)
7675 error ("template argument %d is invalid", arg_idx
+ 1);
7678 /* This only occurs if there was an error in the template
7679 parameter list itself (which we would already have
7680 reported) that we are trying to recover from, e.g., a class
7681 template with a parameter list such as
7682 template<typename..., typename>. */
7685 arg
= convert_template_argument (TREE_VALUE (parm
),
7686 arg
, new_args
, complain
,
7689 if (arg
== error_mark_node
)
7691 TREE_VEC_ELT (new_inner_args
, arg_idx
- pack_adjust
) = arg
;
7693 cp_unevaluated_operand
= saved_unevaluated_operand
;
7694 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
7696 if (variadic_p
&& arg_idx
< nargs
)
7698 if (complain
& tf_error
)
7700 error ("wrong number of template arguments "
7701 "(%d, should be %d)", nargs
, arg_idx
);
7703 error ("provided for %q+D", in_decl
);
7705 return error_mark_node
;
7709 return error_mark_node
;
7711 #ifdef ENABLE_CHECKING
7712 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
))
7713 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
,
7714 TREE_VEC_LENGTH (new_inner_args
));
7717 return new_inner_args
;
7720 /* Convert all template arguments to their appropriate types, and
7721 return a vector containing the innermost resulting template
7722 arguments. If any error occurs, return error_mark_node. Error and
7723 warning messages are not issued.
7725 Note that no function argument deduction is performed, and default
7726 arguments are used to fill in unspecified arguments. */
7728 coerce_template_parms (tree parms
, tree args
, tree in_decl
)
7730 return coerce_template_parms (parms
, args
, in_decl
, tf_none
, true, true);
7733 /* Convert all template arguments to their appropriate type, and
7734 instantiate default arguments as needed. This returns a vector
7735 containing the innermost resulting template arguments, or
7736 error_mark_node if unsuccessful. */
7738 coerce_template_parms (tree parms
, tree args
, tree in_decl
,
7739 tsubst_flags_t complain
)
7741 return coerce_template_parms (parms
, args
, in_decl
, complain
, true, true);
7744 /* Like coerce_template_parms. If PARMS represents all template
7745 parameters levels, this function returns a vector of vectors
7746 representing all the resulting argument levels. Note that in this
7747 case, only the innermost arguments are coerced because the
7748 outermost ones are supposed to have been coerced already.
7750 Otherwise, if PARMS represents only (the innermost) vector of
7751 parameters, this function returns a vector containing just the
7752 innermost resulting arguments. */
7755 coerce_innermost_template_parms (tree parms
,
7758 tsubst_flags_t complain
,
7759 bool require_all_args
,
7760 bool use_default_args
)
7762 int parms_depth
= TMPL_PARMS_DEPTH (parms
);
7763 int args_depth
= TMPL_ARGS_DEPTH (args
);
7766 if (parms_depth
> 1)
7768 coerced_args
= make_tree_vec (parms_depth
);
7772 for (level
= parms
, cur_depth
= parms_depth
;
7773 parms_depth
> 0 && level
!= NULL_TREE
;
7774 level
= TREE_CHAIN (level
), --cur_depth
)
7777 if (cur_depth
== args_depth
)
7778 l
= coerce_template_parms (TREE_VALUE (level
),
7779 args
, in_decl
, complain
,
7783 l
= TMPL_ARGS_LEVEL (args
, cur_depth
);
7785 if (l
== error_mark_node
)
7786 return error_mark_node
;
7788 SET_TMPL_ARGS_LEVEL (coerced_args
, cur_depth
, l
);
7792 coerced_args
= coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parms
),
7793 args
, in_decl
, complain
,
7796 return coerced_args
;
7799 /* Returns 1 if template args OT and NT are equivalent. */
7802 template_args_equal (tree ot
, tree nt
)
7806 if (nt
== NULL_TREE
|| ot
== NULL_TREE
)
7809 if (TREE_CODE (nt
) == TREE_VEC
)
7810 /* For member templates */
7811 return TREE_CODE (ot
) == TREE_VEC
&& comp_template_args (ot
, nt
);
7812 else if (PACK_EXPANSION_P (ot
))
7813 return (PACK_EXPANSION_P (nt
)
7814 && template_args_equal (PACK_EXPANSION_PATTERN (ot
),
7815 PACK_EXPANSION_PATTERN (nt
))
7816 && template_args_equal (PACK_EXPANSION_EXTRA_ARGS (ot
),
7817 PACK_EXPANSION_EXTRA_ARGS (nt
)));
7818 else if (ARGUMENT_PACK_P (ot
))
7823 if (!ARGUMENT_PACK_P (nt
))
7826 opack
= ARGUMENT_PACK_ARGS (ot
);
7827 npack
= ARGUMENT_PACK_ARGS (nt
);
7828 len
= TREE_VEC_LENGTH (opack
);
7829 if (TREE_VEC_LENGTH (npack
) != len
)
7831 for (i
= 0; i
< len
; ++i
)
7832 if (!template_args_equal (TREE_VEC_ELT (opack
, i
),
7833 TREE_VEC_ELT (npack
, i
)))
7837 else if (ot
&& TREE_CODE (ot
) == ARGUMENT_PACK_SELECT
)
7839 /* We get here probably because we are in the middle of substituting
7840 into the pattern of a pack expansion. In that case the
7841 ARGUMENT_PACK_SELECT temporarily replaces the pack argument we are
7842 interested in. So we want to use the initial pack argument for
7844 ot
= ARGUMENT_PACK_SELECT_FROM_PACK (ot
);
7845 if (nt
&& TREE_CODE (nt
) == ARGUMENT_PACK_SELECT
)
7846 nt
= ARGUMENT_PACK_SELECT_FROM_PACK (nt
);
7847 return template_args_equal (ot
, nt
);
7849 else if (TYPE_P (nt
))
7853 /* Don't treat an alias template specialization with dependent
7854 arguments as equivalent to its underlying type when used as a
7855 template argument; we need them to be distinct so that we
7856 substitute into the specialization arguments at instantiation
7857 time. And aliases can't be equivalent without being ==, so
7858 we don't need to look any deeper. */
7859 if (TYPE_ALIAS_P (nt
) || TYPE_ALIAS_P (ot
))
7862 return same_type_p (ot
, nt
);
7864 else if (TREE_CODE (ot
) == TREE_VEC
|| TYPE_P (ot
))
7868 /* Try to treat a template non-type argument that has been converted
7869 to the parameter type as equivalent to one that hasn't yet. */
7870 for (enum tree_code code1
= TREE_CODE (ot
);
7871 CONVERT_EXPR_CODE_P (code1
)
7872 || code1
== NON_LVALUE_EXPR
;
7873 code1
= TREE_CODE (ot
))
7874 ot
= TREE_OPERAND (ot
, 0);
7875 for (enum tree_code code2
= TREE_CODE (nt
);
7876 CONVERT_EXPR_CODE_P (code2
)
7877 || code2
== NON_LVALUE_EXPR
;
7878 code2
= TREE_CODE (nt
))
7879 nt
= TREE_OPERAND (nt
, 0);
7881 return cp_tree_equal (ot
, nt
);
7885 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets of
7886 template arguments. Returns 0 otherwise, and updates OLDARG_PTR and
7887 NEWARG_PTR with the offending arguments if they are non-NULL. */
7890 comp_template_args_with_info (tree oldargs
, tree newargs
,
7891 tree
*oldarg_ptr
, tree
*newarg_ptr
)
7895 if (oldargs
== newargs
)
7898 if (!oldargs
|| !newargs
)
7901 if (TREE_VEC_LENGTH (oldargs
) != TREE_VEC_LENGTH (newargs
))
7904 for (i
= 0; i
< TREE_VEC_LENGTH (oldargs
); ++i
)
7906 tree nt
= TREE_VEC_ELT (newargs
, i
);
7907 tree ot
= TREE_VEC_ELT (oldargs
, i
);
7909 if (! template_args_equal (ot
, nt
))
7911 if (oldarg_ptr
!= NULL
)
7913 if (newarg_ptr
!= NULL
)
7921 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets
7922 of template arguments. Returns 0 otherwise. */
7925 comp_template_args (tree oldargs
, tree newargs
)
7927 return comp_template_args_with_info (oldargs
, newargs
, NULL
, NULL
);
7931 add_pending_template (tree d
)
7933 tree ti
= (TYPE_P (d
)
7934 ? CLASSTYPE_TEMPLATE_INFO (d
)
7935 : DECL_TEMPLATE_INFO (d
));
7936 struct pending_template
*pt
;
7939 if (TI_PENDING_TEMPLATE_FLAG (ti
))
7942 /* We are called both from instantiate_decl, where we've already had a
7943 tinst_level pushed, and instantiate_template, where we haven't.
7945 level
= !current_tinst_level
|| current_tinst_level
->decl
!= d
;
7948 push_tinst_level (d
);
7950 pt
= ggc_alloc
<pending_template
> ();
7952 pt
->tinst
= current_tinst_level
;
7953 if (last_pending_template
)
7954 last_pending_template
->next
= pt
;
7956 pending_templates
= pt
;
7958 last_pending_template
= pt
;
7960 TI_PENDING_TEMPLATE_FLAG (ti
) = 1;
7967 /* Return a TEMPLATE_ID_EXPR corresponding to the indicated FNS and
7968 ARGLIST. Valid choices for FNS are given in the cp-tree.def
7969 documentation for TEMPLATE_ID_EXPR. */
7972 lookup_template_function (tree fns
, tree arglist
)
7976 if (fns
== error_mark_node
|| arglist
== error_mark_node
)
7977 return error_mark_node
;
7979 gcc_assert (!arglist
|| TREE_CODE (arglist
) == TREE_VEC
);
7981 if (!is_overloaded_fn (fns
) && !identifier_p (fns
))
7983 error ("%q#D is not a function template", fns
);
7984 return error_mark_node
;
7987 if (BASELINK_P (fns
))
7989 BASELINK_FUNCTIONS (fns
) = build2 (TEMPLATE_ID_EXPR
,
7991 BASELINK_FUNCTIONS (fns
),
7996 type
= TREE_TYPE (fns
);
7997 if (TREE_CODE (fns
) == OVERLOAD
|| !type
)
7998 type
= unknown_type_node
;
8000 return build2 (TEMPLATE_ID_EXPR
, type
, fns
, arglist
);
8003 /* Within the scope of a template class S<T>, the name S gets bound
8004 (in build_self_reference) to a TYPE_DECL for the class, not a
8005 TEMPLATE_DECL. If DECL is a TYPE_DECL for current_class_type,
8006 or one of its enclosing classes, and that type is a template,
8007 return the associated TEMPLATE_DECL. Otherwise, the original
8010 Also handle the case when DECL is a TREE_LIST of ambiguous
8011 injected-class-names from different bases. */
8014 maybe_get_template_decl_from_type_decl (tree decl
)
8016 if (decl
== NULL_TREE
)
8019 /* DR 176: A lookup that finds an injected-class-name (10.2
8020 [class.member.lookup]) can result in an ambiguity in certain cases
8021 (for example, if it is found in more than one base class). If all of
8022 the injected-class-names that are found refer to specializations of
8023 the same class template, and if the name is followed by a
8024 template-argument-list, the reference refers to the class template
8025 itself and not a specialization thereof, and is not ambiguous. */
8026 if (TREE_CODE (decl
) == TREE_LIST
)
8028 tree t
, tmpl
= NULL_TREE
;
8029 for (t
= decl
; t
; t
= TREE_CHAIN (t
))
8031 tree elt
= maybe_get_template_decl_from_type_decl (TREE_VALUE (t
));
8034 else if (tmpl
!= elt
)
8037 if (tmpl
&& t
== NULL_TREE
)
8043 return (decl
!= NULL_TREE
8044 && DECL_SELF_REFERENCE_P (decl
)
8045 && CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (decl
)))
8046 ? CLASSTYPE_TI_TEMPLATE (TREE_TYPE (decl
)) : decl
;
8049 /* Given an IDENTIFIER_NODE (or type TEMPLATE_DECL) and a chain of
8050 parameters, find the desired type.
8052 D1 is the PTYPENAME terminal, and ARGLIST is the list of arguments.
8054 IN_DECL, if non-NULL, is the template declaration we are trying to
8057 If ENTERING_SCOPE is nonzero, we are about to enter the scope of
8058 the class we are looking up.
8060 Issue error and warning messages under control of COMPLAIN.
8062 If the template class is really a local class in a template
8063 function, then the FUNCTION_CONTEXT is the function in which it is
8066 ??? Note that this function is currently called *twice* for each
8067 template-id: the first time from the parser, while creating the
8068 incomplete type (finish_template_type), and the second type during the
8069 real instantiation (instantiate_template_class). This is surely something
8070 that we want to avoid. It also causes some problems with argument
8071 coercion (see convert_nontype_argument for more information on this). */
8074 lookup_template_class_1 (tree d1
, tree arglist
, tree in_decl
, tree context
,
8075 int entering_scope
, tsubst_flags_t complain
)
8077 tree templ
= NULL_TREE
, parmlist
;
8084 if (identifier_p (d1
))
8086 tree value
= innermost_non_namespace_value (d1
);
8087 if (value
&& DECL_TEMPLATE_TEMPLATE_PARM_P (value
))
8092 push_decl_namespace (context
);
8093 templ
= lookup_name (d1
);
8094 templ
= maybe_get_template_decl_from_type_decl (templ
);
8096 pop_decl_namespace ();
8099 context
= DECL_CONTEXT (templ
);
8101 else if (TREE_CODE (d1
) == TYPE_DECL
&& MAYBE_CLASS_TYPE_P (TREE_TYPE (d1
)))
8103 tree type
= TREE_TYPE (d1
);
8105 /* If we are declaring a constructor, say A<T>::A<T>, we will get
8106 an implicit typename for the second A. Deal with it. */
8107 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
8108 type
= TREE_TYPE (type
);
8110 if (CLASSTYPE_TEMPLATE_INFO (type
))
8112 templ
= CLASSTYPE_TI_TEMPLATE (type
);
8113 d1
= DECL_NAME (templ
);
8116 else if (TREE_CODE (d1
) == ENUMERAL_TYPE
8117 || (TYPE_P (d1
) && MAYBE_CLASS_TYPE_P (d1
)))
8119 templ
= TYPE_TI_TEMPLATE (d1
);
8120 d1
= DECL_NAME (templ
);
8122 else if (DECL_TYPE_TEMPLATE_P (d1
))
8125 d1
= DECL_NAME (templ
);
8126 context
= DECL_CONTEXT (templ
);
8128 else if (DECL_TEMPLATE_TEMPLATE_PARM_P (d1
))
8131 d1
= DECL_NAME (templ
);
8134 /* Issue an error message if we didn't find a template. */
8137 if (complain
& tf_error
)
8138 error ("%qT is not a template", d1
);
8139 return error_mark_node
;
8142 if (TREE_CODE (templ
) != TEMPLATE_DECL
8143 /* Make sure it's a user visible template, if it was named by
8145 || ((complain
& tf_user
) && !DECL_TEMPLATE_PARM_P (templ
)
8146 && !PRIMARY_TEMPLATE_P (templ
)))
8148 if (complain
& tf_error
)
8150 error ("non-template type %qT used as a template", d1
);
8152 error ("for template declaration %q+D", in_decl
);
8154 return error_mark_node
;
8157 complain
&= ~tf_user
;
8159 /* An alias that just changes the name of a template is equivalent to the
8160 other template, so if any of the arguments are pack expansions, strip
8161 the alias to avoid problems with a pack expansion passed to a non-pack
8162 alias template parameter (DR 1430). */
8163 if (pack_expansion_args_count (INNERMOST_TEMPLATE_ARGS (arglist
)))
8164 templ
= get_underlying_template (templ
);
8166 if (DECL_TEMPLATE_TEMPLATE_PARM_P (templ
))
8168 /* Create a new TEMPLATE_DECL and TEMPLATE_TEMPLATE_PARM node to store
8169 template arguments */
8175 parmlist
= DECL_INNERMOST_TEMPLATE_PARMS (templ
);
8177 /* Consider an example where a template template parameter declared as
8179 template <class T, class U = std::allocator<T> > class TT
8181 The template parameter level of T and U are one level larger than
8182 of TT. To proper process the default argument of U, say when an
8183 instantiation `TT<int>' is seen, we need to build the full
8184 arguments containing {int} as the innermost level. Outer levels,
8185 available when not appearing as default template argument, can be
8186 obtained from the arguments of the enclosing template.
8188 Suppose that TT is later substituted with std::vector. The above
8189 instantiation is `TT<int, std::allocator<T> >' with TT at
8190 level 1, and T at level 2, while the template arguments at level 1
8191 becomes {std::vector} and the inner level 2 is {int}. */
8193 outer
= DECL_CONTEXT (templ
);
8195 outer
= TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (outer
)));
8196 else if (current_template_parms
)
8198 /* This is an argument of the current template, so we haven't set
8199 DECL_CONTEXT yet. */
8200 tree relevant_template_parms
;
8202 /* Parameter levels that are greater than the level of the given
8203 template template parm are irrelevant. */
8204 relevant_template_parms
= current_template_parms
;
8205 while (TMPL_PARMS_DEPTH (relevant_template_parms
)
8206 != TEMPLATE_TYPE_LEVEL (TREE_TYPE (templ
)))
8207 relevant_template_parms
= TREE_CHAIN (relevant_template_parms
);
8209 outer
= template_parms_to_args (relevant_template_parms
);
8213 arglist
= add_to_template_args (outer
, arglist
);
8215 arglist2
= coerce_template_parms (parmlist
, arglist
, templ
,
8217 /*require_all_args=*/true,
8218 /*use_default_args=*/true);
8219 if (arglist2
== error_mark_node
8220 || (!uses_template_parms (arglist2
)
8221 && check_instantiated_args (templ
, arglist2
, complain
)))
8222 return error_mark_node
;
8224 parm
= bind_template_template_parm (TREE_TYPE (templ
), arglist2
);
8229 tree template_type
= TREE_TYPE (templ
);
8232 tree found
= NULL_TREE
;
8235 int is_dependent_type
;
8236 int use_partial_inst_tmpl
= false;
8238 if (template_type
== error_mark_node
)
8239 /* An error occurred while building the template TEMPL, and a
8240 diagnostic has most certainly been emitted for that
8241 already. Let's propagate that error. */
8242 return error_mark_node
;
8244 gen_tmpl
= most_general_template (templ
);
8245 parmlist
= DECL_TEMPLATE_PARMS (gen_tmpl
);
8246 parm_depth
= TMPL_PARMS_DEPTH (parmlist
);
8247 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
8249 if (arg_depth
== 1 && parm_depth
> 1)
8251 /* We've been given an incomplete set of template arguments.
8254 template <class T> struct S1 {
8255 template <class U> struct S2 {};
8256 template <class U> struct S2<U*> {};
8259 we will be called with an ARGLIST of `U*', but the
8260 TEMPLATE will be `template <class T> template
8261 <class U> struct S1<T>::S2'. We must fill in the missing
8264 = add_outermost_template_args (TYPE_TI_ARGS (TREE_TYPE (templ
)),
8266 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
8269 /* Now we should have enough arguments. */
8270 gcc_assert (parm_depth
== arg_depth
);
8272 /* From here on, we're only interested in the most general
8275 /* Calculate the BOUND_ARGS. These will be the args that are
8276 actually tsubst'd into the definition to create the
8278 arglist
= coerce_innermost_template_parms (parmlist
, arglist
, gen_tmpl
,
8280 /*require_all_args=*/true,
8281 /*use_default_args=*/true);
8283 if (arglist
== error_mark_node
)
8284 /* We were unable to bind the arguments. */
8285 return error_mark_node
;
8287 /* In the scope of a template class, explicit references to the
8288 template class refer to the type of the template, not any
8289 instantiation of it. For example, in:
8291 template <class T> class C { void f(C<T>); }
8293 the `C<T>' is just the same as `C'. Outside of the
8294 class, however, such a reference is an instantiation. */
8296 || !PRIMARY_TEMPLATE_P (gen_tmpl
)
8297 || currently_open_class (template_type
))
8298 /* comp_template_args is expensive, check it last. */
8299 && comp_template_args (TYPE_TI_ARGS (template_type
),
8301 return template_type
;
8303 /* If we already have this specialization, return it. */
8304 elt
.tmpl
= gen_tmpl
;
8306 elt
.spec
= NULL_TREE
;
8307 hash
= spec_hasher::hash (&elt
);
8308 entry
= type_specializations
->find_with_hash (&elt
, hash
);
8313 /* If the the template's constraints are not satisfied,
8314 then we cannot form a valid type.
8316 Note that the check is deferred until after the hash
8317 lookup. This prevents redundant checks on previously
8318 instantiated specializations. */
8319 if (flag_concepts
&& !constraints_satisfied_p (gen_tmpl
, arglist
))
8321 if (complain
& tf_error
)
8323 error ("template constraint failure");
8324 diagnose_constraints (input_location
, gen_tmpl
, arglist
);
8326 return error_mark_node
;
8329 is_dependent_type
= uses_template_parms (arglist
);
8331 /* If the deduced arguments are invalid, then the binding
8333 if (!is_dependent_type
8334 && check_instantiated_args (gen_tmpl
,
8335 INNERMOST_TEMPLATE_ARGS (arglist
),
8337 return error_mark_node
;
8339 if (!is_dependent_type
8340 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
8341 && !LAMBDA_TYPE_P (TREE_TYPE (gen_tmpl
))
8342 && TREE_CODE (CP_DECL_CONTEXT (gen_tmpl
)) == NAMESPACE_DECL
)
8344 found
= xref_tag_from_type (TREE_TYPE (gen_tmpl
),
8345 DECL_NAME (gen_tmpl
),
8346 /*tag_scope=*/ts_global
);
8350 context
= tsubst (DECL_CONTEXT (gen_tmpl
), arglist
,
8352 if (context
== error_mark_node
)
8353 return error_mark_node
;
8356 context
= global_namespace
;
8358 /* Create the type. */
8359 if (DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
8361 /* The user referred to a specialization of an alias
8362 template represented by GEN_TMPL.
8364 [temp.alias]/2 says:
8366 When a template-id refers to the specialization of an
8367 alias template, it is equivalent to the associated
8368 type obtained by substitution of its
8369 template-arguments for the template-parameters in the
8370 type-id of the alias template. */
8372 t
= tsubst (TREE_TYPE (gen_tmpl
), arglist
, complain
, in_decl
);
8373 /* Note that the call above (by indirectly calling
8374 register_specialization in tsubst_decl) registers the
8375 TYPE_DECL representing the specialization of the alias
8376 template. So next time someone substitutes ARGLIST for
8377 the template parms into the alias template (GEN_TMPL),
8378 she'll get that TYPE_DECL back. */
8380 if (t
== error_mark_node
)
8383 else if (TREE_CODE (template_type
) == ENUMERAL_TYPE
)
8385 if (!is_dependent_type
)
8387 set_current_access_from_decl (TYPE_NAME (template_type
));
8388 t
= start_enum (TYPE_IDENTIFIER (template_type
), NULL_TREE
,
8389 tsubst (ENUM_UNDERLYING_TYPE (template_type
),
8390 arglist
, complain
, in_decl
),
8391 SCOPED_ENUM_P (template_type
), NULL
);
8393 if (t
== error_mark_node
)
8398 /* We don't want to call start_enum for this type, since
8399 the values for the enumeration constants may involve
8400 template parameters. And, no one should be interested
8401 in the enumeration constants for such a type. */
8402 t
= cxx_make_type (ENUMERAL_TYPE
);
8403 SET_SCOPED_ENUM_P (t
, SCOPED_ENUM_P (template_type
));
8405 SET_OPAQUE_ENUM_P (t
, OPAQUE_ENUM_P (template_type
));
8406 ENUM_FIXED_UNDERLYING_TYPE_P (t
)
8407 = ENUM_FIXED_UNDERLYING_TYPE_P (template_type
);
8409 else if (CLASS_TYPE_P (template_type
))
8411 t
= make_class_type (TREE_CODE (template_type
));
8412 CLASSTYPE_DECLARED_CLASS (t
)
8413 = CLASSTYPE_DECLARED_CLASS (template_type
);
8414 SET_CLASSTYPE_IMPLICIT_INSTANTIATION (t
);
8415 TYPE_FOR_JAVA (t
) = TYPE_FOR_JAVA (template_type
);
8417 /* A local class. Make sure the decl gets registered properly. */
8418 if (context
== current_function_decl
)
8419 pushtag (DECL_NAME (gen_tmpl
), t
, /*tag_scope=*/ts_current
);
8421 if (comp_template_args (CLASSTYPE_TI_ARGS (template_type
), arglist
))
8422 /* This instantiation is another name for the primary
8423 template type. Set the TYPE_CANONICAL field
8425 TYPE_CANONICAL (t
) = template_type
;
8426 else if (any_template_arguments_need_structural_equality_p (arglist
))
8427 /* Some of the template arguments require structural
8428 equality testing, so this template class requires
8429 structural equality testing. */
8430 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8435 /* If we called start_enum or pushtag above, this information
8436 will already be set up. */
8439 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
8441 type_decl
= create_implicit_typedef (DECL_NAME (gen_tmpl
), t
);
8442 DECL_CONTEXT (type_decl
) = TYPE_CONTEXT (t
);
8443 DECL_SOURCE_LOCATION (type_decl
)
8444 = DECL_SOURCE_LOCATION (TYPE_STUB_DECL (template_type
));
8447 type_decl
= TYPE_NAME (t
);
8449 if (CLASS_TYPE_P (template_type
))
8451 TREE_PRIVATE (type_decl
)
8452 = TREE_PRIVATE (TYPE_MAIN_DECL (template_type
));
8453 TREE_PROTECTED (type_decl
)
8454 = TREE_PROTECTED (TYPE_MAIN_DECL (template_type
));
8455 if (CLASSTYPE_VISIBILITY_SPECIFIED (template_type
))
8457 DECL_VISIBILITY_SPECIFIED (type_decl
) = 1;
8458 DECL_VISIBILITY (type_decl
) = CLASSTYPE_VISIBILITY (template_type
);
8462 if (OVERLOAD_TYPE_P (t
)
8463 && !DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
8465 static const char *tags
[] = {"abi_tag", "may_alias"};
8467 for (unsigned ix
= 0; ix
!= 2; ix
++)
8470 = lookup_attribute (tags
[ix
], TYPE_ATTRIBUTES (template_type
));
8474 else if (!TREE_CHAIN (attributes
) && !TYPE_ATTRIBUTES (t
))
8475 TYPE_ATTRIBUTES (t
) = attributes
;
8478 = tree_cons (TREE_PURPOSE (attributes
),
8479 TREE_VALUE (attributes
),
8480 TYPE_ATTRIBUTES (t
));
8484 /* Let's consider the explicit specialization of a member
8485 of a class template specialization that is implicitly instantiated,
8490 template<class U> struct M {}; //#0
8495 struct S<int>::M<char> //#1
8499 [temp.expl.spec]/4 says this is valid.
8501 In this case, when we write:
8504 M is instantiated from the CLASSTYPE_TI_TEMPLATE of #1, not from
8507 When we encounter #1, we want to store the partial instantiation
8508 of M (template<class T> S<int>::M<T>) in its CLASSTYPE_TI_TEMPLATE.
8510 For all cases other than this "explicit specialization of member of a
8511 class template", we just want to store the most general template into
8512 the CLASSTYPE_TI_TEMPLATE of M.
8514 This case of "explicit specialization of member of a class template"
8516 1/ the enclosing class is an instantiation of, and therefore not
8517 the same as, the context of the most general template, and
8518 2/ we aren't looking at the partial instantiation itself, i.e.
8519 the innermost arguments are not the same as the innermost parms of
8520 the most general template.
8522 So it's only when 1/ and 2/ happens that we want to use the partial
8523 instantiation of the member template in lieu of its most general
8526 if (PRIMARY_TEMPLATE_P (gen_tmpl
)
8527 && TMPL_ARGS_HAVE_MULTIPLE_LEVELS (arglist
)
8528 /* the enclosing class must be an instantiation... */
8529 && CLASS_TYPE_P (context
)
8530 && !same_type_p (context
, DECL_CONTEXT (gen_tmpl
)))
8532 tree partial_inst_args
;
8533 TREE_VEC_LENGTH (arglist
)--;
8534 ++processing_template_decl
;
8536 tsubst (INNERMOST_TEMPLATE_ARGS
8537 (TYPE_TI_ARGS (TREE_TYPE (gen_tmpl
))),
8538 arglist
, complain
, NULL_TREE
);
8539 --processing_template_decl
;
8540 TREE_VEC_LENGTH (arglist
)++;
8541 use_partial_inst_tmpl
=
8542 /*...and we must not be looking at the partial instantiation
8544 !comp_template_args (INNERMOST_TEMPLATE_ARGS (arglist
),
8548 if (!use_partial_inst_tmpl
)
8549 /* This case is easy; there are no member templates involved. */
8553 /* This is a full instantiation of a member template. Find
8554 the partial instantiation of which this is an instance. */
8556 /* Temporarily reduce by one the number of levels in the ARGLIST
8557 so as to avoid comparing the last set of arguments. */
8558 TREE_VEC_LENGTH (arglist
)--;
8559 found
= tsubst (gen_tmpl
, arglist
, complain
, NULL_TREE
);
8560 TREE_VEC_LENGTH (arglist
)++;
8561 /* FOUND is either a proper class type, or an alias
8562 template specialization. In the later case, it's a
8563 TYPE_DECL, resulting from the substituting of arguments
8564 for parameters in the TYPE_DECL of the alias template
8565 done earlier. So be careful while getting the template
8567 found
= TREE_CODE (found
) == TYPE_DECL
8568 ? TYPE_TI_TEMPLATE (TREE_TYPE (found
))
8569 : CLASSTYPE_TI_TEMPLATE (found
);
8572 // Build template info for the new specialization.
8573 SET_TYPE_TEMPLATE_INFO (t
, build_template_info (found
, arglist
));
8576 slot
= type_specializations
->find_slot_with_hash (&elt
, hash
, INSERT
);
8577 entry
= ggc_alloc
<spec_entry
> ();
8581 /* Note this use of the partial instantiation so we can check it
8582 later in maybe_process_partial_specialization. */
8583 DECL_TEMPLATE_INSTANTIATIONS (found
)
8584 = tree_cons (arglist
, t
,
8585 DECL_TEMPLATE_INSTANTIATIONS (found
));
8587 if (TREE_CODE (template_type
) == ENUMERAL_TYPE
&& !is_dependent_type
8588 && !DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
8589 /* Now that the type has been registered on the instantiations
8590 list, we set up the enumerators. Because the enumeration
8591 constants may involve the enumeration type itself, we make
8592 sure to register the type first, and then create the
8593 constants. That way, doing tsubst_expr for the enumeration
8594 constants won't result in recursive calls here; we'll find
8595 the instantiation and exit above. */
8596 tsubst_enum (template_type
, t
, arglist
);
8598 if (CLASS_TYPE_P (template_type
) && is_dependent_type
)
8599 /* If the type makes use of template parameters, the
8600 code that generates debugging information will crash. */
8601 DECL_IGNORED_P (TYPE_MAIN_DECL (t
)) = 1;
8603 /* Possibly limit visibility based on template args. */
8604 TREE_PUBLIC (type_decl
) = 1;
8605 determine_visibility (type_decl
);
8607 inherit_targ_abi_tags (t
);
8613 /* Wrapper for lookup_template_class_1. */
8616 lookup_template_class (tree d1
, tree arglist
, tree in_decl
, tree context
,
8617 int entering_scope
, tsubst_flags_t complain
)
8620 timevar_push (TV_TEMPLATE_INST
);
8621 ret
= lookup_template_class_1 (d1
, arglist
, in_decl
, context
,
8622 entering_scope
, complain
);
8623 timevar_pop (TV_TEMPLATE_INST
);
8627 /* Return a TEMPLATE_ID_EXPR for the given variable template and ARGLIST. */
8630 lookup_template_variable (tree templ
, tree arglist
)
8632 /* The type of the expression is NULL_TREE since the template-id could refer
8633 to an explicit or partial specialization. */
8634 tree type
= NULL_TREE
;
8635 if (flag_concepts
&& variable_concept_p (templ
))
8636 /* Except that concepts are always bool. */
8637 type
= boolean_type_node
;
8638 return build2 (TEMPLATE_ID_EXPR
, type
, templ
, arglist
);
8641 /* Instantiate a variable declaration from a TEMPLATE_ID_EXPR for use. */
8644 finish_template_variable (tree var
, tsubst_flags_t complain
)
8646 tree templ
= TREE_OPERAND (var
, 0);
8647 tree arglist
= TREE_OPERAND (var
, 1);
8649 /* We never want to return a VAR_DECL for a variable concept, since they
8650 aren't instantiated. In a template, leave the TEMPLATE_ID_EXPR alone. */
8651 bool concept_p
= flag_concepts
&& variable_concept_p (templ
);
8652 if (concept_p
&& processing_template_decl
)
8655 tree tmpl_args
= DECL_TI_ARGS (DECL_TEMPLATE_RESULT (templ
));
8656 arglist
= add_outermost_template_args (tmpl_args
, arglist
);
8658 tree parms
= DECL_TEMPLATE_PARMS (templ
);
8659 arglist
= coerce_innermost_template_parms (parms
, arglist
, templ
, complain
,
8661 /*use_default*/true);
8663 if (flag_concepts
&& !constraints_satisfied_p (templ
, arglist
))
8665 if (complain
& tf_error
)
8667 error ("constraints for %qD not satisfied", templ
);
8668 diagnose_constraints (location_of (var
), templ
, arglist
);
8670 return error_mark_node
;
8673 /* If a template-id refers to a specialization of a variable
8674 concept, then the expression is true if and only if the
8675 concept's constraints are satisfied by the given template
8678 NOTE: This is an extension of Concepts Lite TS that
8679 allows constraints to be used in expressions. */
8682 tree decl
= DECL_TEMPLATE_RESULT (templ
);
8683 return evaluate_variable_concept (decl
, arglist
);
8686 return instantiate_template (templ
, arglist
, complain
);
8693 /* True when we should also visit template parameters that occur in
8694 non-deduced contexts. */
8695 bool include_nondeduced_p
;
8696 hash_set
<tree
> *visited
;
8699 /* Called from for_each_template_parm via walk_tree. */
8702 for_each_template_parm_r (tree
*tp
, int *walk_subtrees
, void *d
)
8705 struct pair_fn_data
*pfd
= (struct pair_fn_data
*) d
;
8706 tree_fn_t fn
= pfd
->fn
;
8707 void *data
= pfd
->data
;
8708 tree result
= NULL_TREE
;
8710 #define WALK_SUBTREE(NODE) \
8713 result = for_each_template_parm (NODE, fn, data, pfd->visited, \
8714 pfd->include_nondeduced_p); \
8715 if (result) goto out; \
8720 && (pfd
->include_nondeduced_p
|| TREE_CODE (t
) != TYPENAME_TYPE
))
8721 WALK_SUBTREE (TYPE_CONTEXT (t
));
8723 switch (TREE_CODE (t
))
8726 if (TYPE_PTRMEMFUNC_P (t
))
8732 if (!TYPE_TEMPLATE_INFO (t
))
8735 WALK_SUBTREE (TYPE_TI_ARGS (t
));
8739 WALK_SUBTREE (TYPE_MIN_VALUE (t
));
8740 WALK_SUBTREE (TYPE_MAX_VALUE (t
));
8744 /* Since we're not going to walk subtrees, we have to do this
8746 WALK_SUBTREE (TYPE_METHOD_BASETYPE (t
));
8750 /* Check the return type. */
8751 WALK_SUBTREE (TREE_TYPE (t
));
8753 /* Check the parameter types. Since default arguments are not
8754 instantiated until they are needed, the TYPE_ARG_TYPES may
8755 contain expressions that involve template parameters. But,
8756 no-one should be looking at them yet. And, once they're
8757 instantiated, they don't contain template parameters, so
8758 there's no point in looking at them then, either. */
8762 for (parm
= TYPE_ARG_TYPES (t
); parm
; parm
= TREE_CHAIN (parm
))
8763 WALK_SUBTREE (TREE_VALUE (parm
));
8765 /* Since we've already handled the TYPE_ARG_TYPES, we don't
8766 want walk_tree walking into them itself. */
8772 case UNDERLYING_TYPE
:
8773 if (pfd
->include_nondeduced_p
8774 && for_each_template_parm (TYPE_VALUES_RAW (t
), fn
, data
,
8776 pfd
->include_nondeduced_p
))
8777 return error_mark_node
;
8782 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
))
8783 WALK_SUBTREE (DECL_TI_ARGS (t
));
8788 if (TREE_CODE (t
) == CONST_DECL
&& DECL_TEMPLATE_PARM_P (t
))
8789 WALK_SUBTREE (DECL_INITIAL (t
));
8790 if (DECL_CONTEXT (t
)
8791 && pfd
->include_nondeduced_p
)
8792 WALK_SUBTREE (DECL_CONTEXT (t
));
8795 case BOUND_TEMPLATE_TEMPLATE_PARM
:
8796 /* Record template parameters such as `T' inside `TT<T>'. */
8797 WALK_SUBTREE (TYPE_TI_ARGS (t
));
8800 case TEMPLATE_TEMPLATE_PARM
:
8801 case TEMPLATE_TYPE_PARM
:
8802 case TEMPLATE_PARM_INDEX
:
8803 if (fn
&& (*fn
)(t
, data
))
8810 /* A template template parameter is encountered. */
8811 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
8812 WALK_SUBTREE (TREE_TYPE (t
));
8814 /* Already substituted template template parameter */
8820 WALK_SUBTREE (TYPENAME_TYPE_FULLNAME (t
));
8824 if (TREE_TYPE (t
) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t
))
8825 && pfd
->include_nondeduced_p
)
8826 WALK_SUBTREE (TYPE_PTRMEMFUNC_FN_TYPE (TREE_TYPE (t
)));
8831 /* If there's no type, then this thing must be some expression
8832 involving template parameters. */
8833 if (!fn
&& !TREE_TYPE (t
))
8834 return error_mark_node
;
8839 case IMPLICIT_CONV_EXPR
:
8840 case REINTERPRET_CAST_EXPR
:
8841 case CONST_CAST_EXPR
:
8842 case STATIC_CAST_EXPR
:
8843 case DYNAMIC_CAST_EXPR
:
8847 case PSEUDO_DTOR_EXPR
:
8849 return error_mark_node
;
8858 /* We didn't find any template parameters we liked. */
8863 /* For each TEMPLATE_TYPE_PARM, TEMPLATE_TEMPLATE_PARM,
8864 BOUND_TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX in T,
8865 call FN with the parameter and the DATA.
8866 If FN returns nonzero, the iteration is terminated, and
8867 for_each_template_parm returns 1. Otherwise, the iteration
8868 continues. If FN never returns a nonzero value, the value
8869 returned by for_each_template_parm is 0. If FN is NULL, it is
8870 considered to be the function which always returns 1.
8872 If INCLUDE_NONDEDUCED_P, then this routine will also visit template
8873 parameters that occur in non-deduced contexts. When false, only
8874 visits those template parameters that can be deduced. */
8877 for_each_template_parm (tree t
, tree_fn_t fn
, void* data
,
8878 hash_set
<tree
> *visited
,
8879 bool include_nondeduced_p
)
8881 struct pair_fn_data pfd
;
8887 pfd
.include_nondeduced_p
= include_nondeduced_p
;
8889 /* Walk the tree. (Conceptually, we would like to walk without
8890 duplicates, but for_each_template_parm_r recursively calls
8891 for_each_template_parm, so we would need to reorganize a fair
8892 bit to use walk_tree_without_duplicates, so we keep our own
8895 pfd
.visited
= visited
;
8897 pfd
.visited
= new hash_set
<tree
>;
8898 result
= cp_walk_tree (&t
,
8899 for_each_template_parm_r
,
8913 /* Returns true if T depends on any template parameter. */
8916 uses_template_parms (tree t
)
8922 int saved_processing_template_decl
;
8924 saved_processing_template_decl
= processing_template_decl
;
8925 if (!saved_processing_template_decl
)
8926 processing_template_decl
= 1;
8928 dependent_p
= dependent_type_p (t
);
8929 else if (TREE_CODE (t
) == TREE_VEC
)
8930 dependent_p
= any_dependent_template_arguments_p (t
);
8931 else if (TREE_CODE (t
) == TREE_LIST
)
8932 dependent_p
= (uses_template_parms (TREE_VALUE (t
))
8933 || uses_template_parms (TREE_CHAIN (t
)));
8934 else if (TREE_CODE (t
) == TYPE_DECL
)
8935 dependent_p
= dependent_type_p (TREE_TYPE (t
));
8938 || TREE_CODE (t
) == TEMPLATE_PARM_INDEX
8939 || TREE_CODE (t
) == OVERLOAD
8942 || TREE_CODE (t
) == TRAIT_EXPR
8943 || TREE_CODE (t
) == CONSTRUCTOR
8944 || CONSTANT_CLASS_P (t
))
8945 dependent_p
= (type_dependent_expression_p (t
)
8946 || value_dependent_expression_p (t
));
8949 gcc_assert (t
== error_mark_node
);
8950 dependent_p
= false;
8953 processing_template_decl
= saved_processing_template_decl
;
8958 /* Returns true iff current_function_decl is an incompletely instantiated
8959 template. Useful instead of processing_template_decl because the latter
8960 is set to 0 during instantiate_non_dependent_expr. */
8963 in_template_function (void)
8965 tree fn
= current_function_decl
;
8967 ++processing_template_decl
;
8968 ret
= (fn
&& DECL_LANG_SPECIFIC (fn
)
8969 && DECL_TEMPLATE_INFO (fn
)
8970 && any_dependent_template_arguments_p (DECL_TI_ARGS (fn
)));
8971 --processing_template_decl
;
8975 /* Returns true if T depends on any template parameter with level LEVEL. */
8978 uses_template_parms_level (tree t
, int level
)
8980 return for_each_template_parm (t
, template_parm_this_level_p
, &level
, NULL
,
8981 /*include_nondeduced_p=*/true);
8984 /* Returns TRUE iff INST is an instantiation we don't need to do in an
8985 ill-formed translation unit, i.e. a variable or function that isn't
8986 usable in a constant expression. */
8989 neglectable_inst_p (tree d
)
8992 && !(TREE_CODE (d
) == FUNCTION_DECL
? DECL_DECLARED_CONSTEXPR_P (d
)
8993 : decl_maybe_constant_var_p (d
)));
8996 /* Returns TRUE iff we should refuse to instantiate DECL because it's
8997 neglectable and instantiated from within an erroneous instantiation. */
9000 limit_bad_template_recursion (tree decl
)
9002 struct tinst_level
*lev
= current_tinst_level
;
9003 int errs
= errorcount
+ sorrycount
;
9004 if (lev
== NULL
|| errs
== 0 || !neglectable_inst_p (decl
))
9007 for (; lev
; lev
= lev
->next
)
9008 if (neglectable_inst_p (lev
->decl
))
9011 return (lev
&& errs
> lev
->errors
);
9014 static int tinst_depth
;
9015 extern int max_tinst_depth
;
9018 static GTY(()) struct tinst_level
*last_error_tinst_level
;
9020 /* We're starting to instantiate D; record the template instantiation context
9021 for diagnostics and to restore it later. */
9024 push_tinst_level (tree d
)
9026 return push_tinst_level_loc (d
, input_location
);
9029 /* We're starting to instantiate D; record the template instantiation context
9030 at LOC for diagnostics and to restore it later. */
9033 push_tinst_level_loc (tree d
, location_t loc
)
9035 struct tinst_level
*new_level
;
9037 if (tinst_depth
>= max_tinst_depth
)
9039 fatal_error (input_location
,
9040 "template instantiation depth exceeds maximum of %d"
9041 " (use -ftemplate-depth= to increase the maximum)",
9046 /* If the current instantiation caused problems, don't let it instantiate
9047 anything else. Do allow deduction substitution and decls usable in
9048 constant expressions. */
9049 if (limit_bad_template_recursion (d
))
9052 new_level
= ggc_alloc
<tinst_level
> ();
9053 new_level
->decl
= d
;
9054 new_level
->locus
= loc
;
9055 new_level
->errors
= errorcount
+sorrycount
;
9056 new_level
->in_system_header_p
= in_system_header_at (input_location
);
9057 new_level
->next
= current_tinst_level
;
9058 current_tinst_level
= new_level
;
9061 if (GATHER_STATISTICS
&& (tinst_depth
> depth_reached
))
9062 depth_reached
= tinst_depth
;
9067 /* We're done instantiating this template; return to the instantiation
9071 pop_tinst_level (void)
9073 /* Restore the filename and line number stashed away when we started
9074 this instantiation. */
9075 input_location
= current_tinst_level
->locus
;
9076 current_tinst_level
= current_tinst_level
->next
;
9080 /* We're instantiating a deferred template; restore the template
9081 instantiation context in which the instantiation was requested, which
9082 is one step out from LEVEL. Return the corresponding DECL or TYPE. */
9085 reopen_tinst_level (struct tinst_level
*level
)
9087 struct tinst_level
*t
;
9090 for (t
= level
; t
; t
= t
->next
)
9093 current_tinst_level
= level
;
9095 if (current_tinst_level
)
9096 current_tinst_level
->errors
= errorcount
+sorrycount
;
9100 /* Returns the TINST_LEVEL which gives the original instantiation
9103 struct tinst_level
*
9104 outermost_tinst_level (void)
9106 struct tinst_level
*level
= current_tinst_level
;
9109 level
= level
->next
;
9113 /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the
9114 vector of template arguments, as for tsubst.
9116 Returns an appropriate tsubst'd friend declaration. */
9119 tsubst_friend_function (tree decl
, tree args
)
9123 if (TREE_CODE (decl
) == FUNCTION_DECL
9124 && DECL_TEMPLATE_INSTANTIATION (decl
)
9125 && TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
9126 /* This was a friend declared with an explicit template
9127 argument list, e.g.:
9131 to indicate that f was a template instantiation, not a new
9132 function declaration. Now, we have to figure out what
9133 instantiation of what template. */
9135 tree template_id
, arglist
, fns
;
9138 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (current_class_type
));
9140 /* Friend functions are looked up in the containing namespace scope.
9141 We must enter that scope, to avoid finding member functions of the
9142 current class with same name. */
9143 push_nested_namespace (ns
);
9144 fns
= tsubst_expr (DECL_TI_TEMPLATE (decl
), args
,
9145 tf_warning_or_error
, NULL_TREE
,
9146 /*integral_constant_expression_p=*/false);
9147 pop_nested_namespace (ns
);
9148 arglist
= tsubst (DECL_TI_ARGS (decl
), args
,
9149 tf_warning_or_error
, NULL_TREE
);
9150 template_id
= lookup_template_function (fns
, arglist
);
9152 new_friend
= tsubst (decl
, args
, tf_warning_or_error
, NULL_TREE
);
9153 tmpl
= determine_specialization (template_id
, new_friend
,
9155 /*need_member_template=*/0,
9156 TREE_VEC_LENGTH (args
),
9158 return instantiate_template (tmpl
, new_args
, tf_error
);
9161 new_friend
= tsubst (decl
, args
, tf_warning_or_error
, NULL_TREE
);
9163 /* The NEW_FRIEND will look like an instantiation, to the
9164 compiler, but is not an instantiation from the point of view of
9165 the language. For example, we might have had:
9167 template <class T> struct S {
9168 template <class U> friend void f(T, U);
9171 Then, in S<int>, template <class U> void f(int, U) is not an
9172 instantiation of anything. */
9173 if (new_friend
== error_mark_node
)
9174 return error_mark_node
;
9176 DECL_USE_TEMPLATE (new_friend
) = 0;
9177 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
9179 DECL_USE_TEMPLATE (DECL_TEMPLATE_RESULT (new_friend
)) = 0;
9180 DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (new_friend
))
9181 = DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (decl
));
9184 /* The mangled name for the NEW_FRIEND is incorrect. The function
9185 is not a template instantiation and should not be mangled like
9186 one. Therefore, we forget the mangling here; we'll recompute it
9187 later if we need it. */
9188 if (TREE_CODE (new_friend
) != TEMPLATE_DECL
)
9190 SET_DECL_RTL (new_friend
, NULL
);
9191 SET_DECL_ASSEMBLER_NAME (new_friend
, NULL_TREE
);
9194 if (DECL_NAMESPACE_SCOPE_P (new_friend
))
9197 tree new_friend_template_info
;
9198 tree new_friend_result_template_info
;
9200 int new_friend_is_defn
;
9202 /* We must save some information from NEW_FRIEND before calling
9203 duplicate decls since that function will free NEW_FRIEND if
9205 new_friend_template_info
= DECL_TEMPLATE_INFO (new_friend
);
9206 new_friend_is_defn
=
9207 (DECL_INITIAL (DECL_TEMPLATE_RESULT
9208 (template_for_substitution (new_friend
)))
9210 if (TREE_CODE (new_friend
) == TEMPLATE_DECL
)
9212 /* This declaration is a `primary' template. */
9213 DECL_PRIMARY_TEMPLATE (new_friend
) = new_friend
;
9215 new_friend_result_template_info
9216 = DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (new_friend
));
9219 new_friend_result_template_info
= NULL_TREE
;
9221 /* Make the init_value nonzero so pushdecl knows this is a defn. */
9222 if (new_friend_is_defn
)
9223 DECL_INITIAL (new_friend
) = error_mark_node
;
9225 /* Inside pushdecl_namespace_level, we will push into the
9226 current namespace. However, the friend function should go
9227 into the namespace of the template. */
9228 ns
= decl_namespace_context (new_friend
);
9229 push_nested_namespace (ns
);
9230 old_decl
= pushdecl_namespace_level (new_friend
, /*is_friend=*/true);
9231 pop_nested_namespace (ns
);
9233 if (old_decl
== error_mark_node
)
9234 return error_mark_node
;
9236 if (old_decl
!= new_friend
)
9238 /* This new friend declaration matched an existing
9239 declaration. For example, given:
9241 template <class T> void f(T);
9242 template <class U> class C {
9243 template <class T> friend void f(T) {}
9246 the friend declaration actually provides the definition
9247 of `f', once C has been instantiated for some type. So,
9248 old_decl will be the out-of-class template declaration,
9249 while new_friend is the in-class definition.
9251 But, if `f' was called before this point, the
9252 instantiation of `f' will have DECL_TI_ARGS corresponding
9253 to `T' but not to `U', references to which might appear
9254 in the definition of `f'. Previously, the most general
9255 template for an instantiation of `f' was the out-of-class
9256 version; now it is the in-class version. Therefore, we
9257 run through all specialization of `f', adding to their
9258 DECL_TI_ARGS appropriately. In particular, they need a
9259 new set of outer arguments, corresponding to the
9260 arguments for this class instantiation.
9262 The same situation can arise with something like this:
9265 template <class T> class C {
9269 when `C<int>' is instantiated. Now, `f(int)' is defined
9272 if (!new_friend_is_defn
)
9273 /* On the other hand, if the in-class declaration does
9274 *not* provide a definition, then we don't want to alter
9275 existing definitions. We can just leave everything
9280 tree new_template
= TI_TEMPLATE (new_friend_template_info
);
9281 tree new_args
= TI_ARGS (new_friend_template_info
);
9283 /* Overwrite whatever template info was there before, if
9284 any, with the new template information pertaining to
9286 DECL_TEMPLATE_INFO (old_decl
) = new_friend_template_info
;
9288 if (TREE_CODE (old_decl
) != TEMPLATE_DECL
)
9290 /* We should have called reregister_specialization in
9292 gcc_assert (retrieve_specialization (new_template
,
9296 /* Instantiate it if the global has already been used. */
9297 if (DECL_ODR_USED (old_decl
))
9298 instantiate_decl (old_decl
, /*defer_ok=*/true,
9299 /*expl_inst_class_mem_p=*/false);
9305 /* Indicate that the old function template is a partial
9307 DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (old_decl
))
9308 = new_friend_result_template_info
;
9310 gcc_assert (new_template
9311 == most_general_template (new_template
));
9312 gcc_assert (new_template
!= old_decl
);
9314 /* Reassign any specializations already in the hash table
9315 to the new more general template, and add the
9316 additional template args. */
9317 for (t
= DECL_TEMPLATE_INSTANTIATIONS (old_decl
);
9321 tree spec
= TREE_VALUE (t
);
9324 elt
.tmpl
= old_decl
;
9325 elt
.args
= DECL_TI_ARGS (spec
);
9326 elt
.spec
= NULL_TREE
;
9328 decl_specializations
->remove_elt (&elt
);
9331 = add_outermost_template_args (new_args
,
9332 DECL_TI_ARGS (spec
));
9334 register_specialization
9335 (spec
, new_template
, DECL_TI_ARGS (spec
), true, 0);
9338 DECL_TEMPLATE_INSTANTIATIONS (old_decl
) = NULL_TREE
;
9342 /* The information from NEW_FRIEND has been merged into OLD_DECL
9343 by duplicate_decls. */
9344 new_friend
= old_decl
;
9349 tree context
= DECL_CONTEXT (new_friend
);
9353 template <class T> class C {
9354 template <class U> friend void C1<U>::f (); // case 1
9355 friend void C2<T>::f (); // case 2
9357 we only need to make sure CONTEXT is a complete type for
9358 case 2. To distinguish between the two cases, we note that
9359 CONTEXT of case 1 remains dependent type after tsubst while
9360 this isn't true for case 2. */
9361 ++processing_template_decl
;
9362 dependent_p
= dependent_type_p (context
);
9363 --processing_template_decl
;
9366 && !complete_type_or_else (context
, NULL_TREE
))
9367 return error_mark_node
;
9369 if (COMPLETE_TYPE_P (context
))
9371 tree fn
= new_friend
;
9372 /* do_friend adds the TEMPLATE_DECL for any member friend
9373 template even if it isn't a member template, i.e.
9374 template <class T> friend A<T>::f();
9375 Look through it in that case. */
9376 if (TREE_CODE (fn
) == TEMPLATE_DECL
9377 && !PRIMARY_TEMPLATE_P (fn
))
9378 fn
= DECL_TEMPLATE_RESULT (fn
);
9379 /* Check to see that the declaration is really present, and,
9380 possibly obtain an improved declaration. */
9381 fn
= check_classfn (context
, fn
, NULL_TREE
);
9391 /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of
9392 template arguments, as for tsubst.
9394 Returns an appropriate tsubst'd friend type or error_mark_node on
9398 tsubst_friend_class (tree friend_tmpl
, tree args
)
9404 if (DECL_TEMPLATE_TEMPLATE_PARM_P (friend_tmpl
))
9406 tree t
= tsubst (TREE_TYPE (friend_tmpl
), args
, tf_none
, NULL_TREE
);
9407 return TREE_TYPE (t
);
9410 context
= CP_DECL_CONTEXT (friend_tmpl
);
9412 if (context
!= global_namespace
)
9414 if (TREE_CODE (context
) == NAMESPACE_DECL
)
9415 push_nested_namespace (context
);
9417 push_nested_class (tsubst (context
, args
, tf_none
, NULL_TREE
));
9420 /* Look for a class template declaration. We look for hidden names
9421 because two friend declarations of the same template are the
9422 same. For example, in:
9425 template <typename> friend class F;
9427 template <typename> struct B {
9428 template <typename> friend class F;
9431 both F templates are the same. */
9432 tmpl
= lookup_name_real (DECL_NAME (friend_tmpl
), 0, 0,
9433 /*block_p=*/true, 0, LOOKUP_HIDDEN
);
9435 /* But, if we don't find one, it might be because we're in a
9436 situation like this:
9444 Here, in the scope of (say) S<int>, `S' is bound to a TYPE_DECL
9445 for `S<int>', not the TEMPLATE_DECL. */
9446 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
9448 tmpl
= lookup_name_prefer_type (DECL_NAME (friend_tmpl
), 1);
9449 tmpl
= maybe_get_template_decl_from_type_decl (tmpl
);
9452 if (tmpl
&& DECL_CLASS_TEMPLATE_P (tmpl
))
9454 /* The friend template has already been declared. Just
9455 check to see that the declarations match, and install any new
9456 default parameters. We must tsubst the default parameters,
9457 of course. We only need the innermost template parameters
9458 because that is all that redeclare_class_template will look
9460 if (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (friend_tmpl
))
9461 > TMPL_ARGS_DEPTH (args
))
9464 location_t saved_input_location
;
9465 parms
= tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_tmpl
),
9466 args
, tf_warning_or_error
);
9468 saved_input_location
= input_location
;
9469 input_location
= DECL_SOURCE_LOCATION (friend_tmpl
);
9470 tree cons
= get_constraints (tmpl
);
9471 redeclare_class_template (TREE_TYPE (tmpl
), parms
, cons
);
9472 input_location
= saved_input_location
;
9476 friend_type
= TREE_TYPE (tmpl
);
9480 /* The friend template has not already been declared. In this
9481 case, the instantiation of the template class will cause the
9482 injection of this template into the global scope. */
9483 tmpl
= tsubst (friend_tmpl
, args
, tf_warning_or_error
, NULL_TREE
);
9484 if (tmpl
== error_mark_node
)
9485 return error_mark_node
;
9487 /* The new TMPL is not an instantiation of anything, so we
9488 forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE for
9489 the new type because that is supposed to be the corresponding
9490 template decl, i.e., TMPL. */
9491 DECL_USE_TEMPLATE (tmpl
) = 0;
9492 DECL_TEMPLATE_INFO (tmpl
) = NULL_TREE
;
9493 CLASSTYPE_USE_TEMPLATE (TREE_TYPE (tmpl
)) = 0;
9494 CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl
))
9495 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl
)));
9497 /* Inject this template into the global scope. */
9498 friend_type
= TREE_TYPE (pushdecl_top_level_maybe_friend (tmpl
, true));
9501 if (context
!= global_namespace
)
9503 if (TREE_CODE (context
) == NAMESPACE_DECL
)
9504 pop_nested_namespace (context
);
9506 pop_nested_class ();
9512 /* Returns zero if TYPE cannot be completed later due to circularity.
9513 Otherwise returns one. */
9516 can_complete_type_without_circularity (tree type
)
9518 if (type
== NULL_TREE
|| type
== error_mark_node
)
9520 else if (COMPLETE_TYPE_P (type
))
9522 else if (TREE_CODE (type
) == ARRAY_TYPE
&& TYPE_DOMAIN (type
))
9523 return can_complete_type_without_circularity (TREE_TYPE (type
));
9524 else if (CLASS_TYPE_P (type
)
9525 && TYPE_BEING_DEFINED (TYPE_MAIN_VARIANT (type
)))
9531 static tree
tsubst_omp_clauses (tree
, bool, bool, tree
, tsubst_flags_t
, tree
);
9533 /* Apply any attributes which had to be deferred until instantiation
9534 time. DECL_P, ATTRIBUTES and ATTR_FLAGS are as cplus_decl_attributes;
9535 ARGS, COMPLAIN, IN_DECL are as tsubst. */
9538 apply_late_template_attributes (tree
*decl_p
, tree attributes
, int attr_flags
,
9539 tree args
, tsubst_flags_t complain
, tree in_decl
)
9541 tree last_dep
= NULL_TREE
;
9545 for (t
= attributes
; t
; t
= TREE_CHAIN (t
))
9546 if (ATTR_IS_DEPENDENT (t
))
9549 attributes
= copy_list (attributes
);
9553 if (DECL_P (*decl_p
))
9555 if (TREE_TYPE (*decl_p
) == error_mark_node
)
9557 p
= &DECL_ATTRIBUTES (*decl_p
);
9560 p
= &TYPE_ATTRIBUTES (*decl_p
);
9564 tree late_attrs
= NULL_TREE
;
9565 tree
*q
= &late_attrs
;
9567 for (*p
= attributes
; *p
; )
9570 if (ATTR_IS_DEPENDENT (t
))
9572 *p
= TREE_CHAIN (t
);
9573 TREE_CHAIN (t
) = NULL_TREE
;
9574 if ((flag_openmp
|| flag_openmp_simd
|| flag_cilkplus
)
9575 && is_attribute_p ("omp declare simd",
9576 get_attribute_name (t
))
9579 tree clauses
= TREE_VALUE (TREE_VALUE (t
));
9580 clauses
= tsubst_omp_clauses (clauses
, true, false, args
,
9582 c_omp_declare_simd_clauses_to_decls (*decl_p
, clauses
);
9583 clauses
= finish_omp_clauses (clauses
, false, true);
9584 tree parms
= DECL_ARGUMENTS (*decl_p
);
9586 = c_omp_declare_simd_clauses_to_numbers (parms
, clauses
);
9588 TREE_VALUE (TREE_VALUE (t
)) = clauses
;
9590 TREE_VALUE (t
) = NULL_TREE
;
9592 /* If the first attribute argument is an identifier, don't
9593 pass it through tsubst. Attributes like mode, format,
9594 cleanup and several target specific attributes expect it
9596 else if (attribute_takes_identifier_p (get_attribute_name (t
))
9600 = tsubst_expr (TREE_CHAIN (TREE_VALUE (t
)), args
, complain
,
9602 /*integral_constant_expression_p=*/false);
9603 if (chain
!= TREE_CHAIN (TREE_VALUE (t
)))
9605 = tree_cons (NULL_TREE
, TREE_VALUE (TREE_VALUE (t
)),
9608 else if (TREE_VALUE (t
) && PACK_EXPANSION_P (TREE_VALUE (t
)))
9610 /* An attribute pack expansion. */
9611 tree purp
= TREE_PURPOSE (t
);
9612 tree pack
= (tsubst_pack_expansion
9613 (TREE_VALUE (t
), args
, complain
, in_decl
));
9614 int len
= TREE_VEC_LENGTH (pack
);
9615 for (int i
= 0; i
< len
; ++i
)
9617 tree elt
= TREE_VEC_ELT (pack
, i
);
9618 *q
= build_tree_list (purp
, elt
);
9619 q
= &TREE_CHAIN (*q
);
9625 = tsubst_expr (TREE_VALUE (t
), args
, complain
, in_decl
,
9626 /*integral_constant_expression_p=*/false);
9628 q
= &TREE_CHAIN (t
);
9631 p
= &TREE_CHAIN (t
);
9634 cplus_decl_attributes (decl_p
, late_attrs
, attr_flags
);
9638 /* Perform (or defer) access check for typedefs that were referenced
9639 from within the template TMPL code.
9640 This is a subroutine of instantiate_decl and instantiate_class_template.
9641 TMPL is the template to consider and TARGS is the list of arguments of
9645 perform_typedefs_access_check (tree tmpl
, tree targs
)
9647 location_t saved_location
;
9649 qualified_typedef_usage_t
*iter
;
9652 || (!CLASS_TYPE_P (tmpl
)
9653 && TREE_CODE (tmpl
) != FUNCTION_DECL
))
9656 saved_location
= input_location
;
9657 FOR_EACH_VEC_SAFE_ELT (get_types_needing_access_check (tmpl
), i
, iter
)
9659 tree type_decl
= iter
->typedef_decl
;
9660 tree type_scope
= iter
->context
;
9662 if (!type_decl
|| !type_scope
|| !CLASS_TYPE_P (type_scope
))
9665 if (uses_template_parms (type_decl
))
9666 type_decl
= tsubst (type_decl
, targs
, tf_error
, NULL_TREE
);
9667 if (uses_template_parms (type_scope
))
9668 type_scope
= tsubst (type_scope
, targs
, tf_error
, NULL_TREE
);
9670 /* Make access check error messages point to the location
9671 of the use of the typedef. */
9672 input_location
= iter
->locus
;
9673 perform_or_defer_access_check (TYPE_BINFO (type_scope
),
9674 type_decl
, type_decl
,
9675 tf_warning_or_error
);
9677 input_location
= saved_location
;
9681 instantiate_class_template_1 (tree type
)
9683 tree templ
, args
, pattern
, t
, member
;
9687 unsigned int saved_maximum_field_alignment
;
9690 if (type
== error_mark_node
)
9691 return error_mark_node
;
9693 if (COMPLETE_OR_OPEN_TYPE_P (type
)
9694 || uses_template_parms (type
))
9697 /* Figure out which template is being instantiated. */
9698 templ
= most_general_template (CLASSTYPE_TI_TEMPLATE (type
));
9699 gcc_assert (TREE_CODE (templ
) == TEMPLATE_DECL
);
9701 /* Determine what specialization of the original template to
9703 t
= most_specialized_partial_spec (type
, tf_warning_or_error
);
9704 if (t
== error_mark_node
)
9706 TYPE_BEING_DEFINED (type
) = 1;
9707 return error_mark_node
;
9711 /* This TYPE is actually an instantiation of a partial
9712 specialization. We replace the innermost set of ARGS with
9713 the arguments appropriate for substitution. For example,
9716 template <class T> struct S {};
9717 template <class T> struct S<T*> {};
9719 and supposing that we are instantiating S<int*>, ARGS will
9720 presently be {int*} -- but we need {int}. */
9721 pattern
= TREE_TYPE (t
);
9722 args
= TREE_PURPOSE (t
);
9726 pattern
= TREE_TYPE (templ
);
9727 args
= CLASSTYPE_TI_ARGS (type
);
9730 /* If the template we're instantiating is incomplete, then clearly
9731 there's nothing we can do. */
9732 if (!COMPLETE_TYPE_P (pattern
))
9735 /* If we've recursively instantiated too many templates, stop. */
9736 if (! push_tinst_level (type
))
9739 /* Now we're really doing the instantiation. Mark the type as in
9740 the process of being defined. */
9741 TYPE_BEING_DEFINED (type
) = 1;
9743 /* We may be in the middle of deferred access check. Disable
9745 push_deferring_access_checks (dk_no_deferred
);
9747 int saved_unevaluated_operand
= cp_unevaluated_operand
;
9748 int saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
9750 fn_context
= decl_function_context (TYPE_MAIN_DECL (type
));
9751 /* Also avoid push_to_top_level for a lambda in an NSDMI. */
9752 if (!fn_context
&& LAMBDA_TYPE_P (type
) && TYPE_CLASS_SCOPE_P (type
))
9753 fn_context
= error_mark_node
;
9755 push_to_top_level ();
9758 cp_unevaluated_operand
= 0;
9759 c_inhibit_evaluation_warnings
= 0;
9761 /* Use #pragma pack from the template context. */
9762 saved_maximum_field_alignment
= maximum_field_alignment
;
9763 maximum_field_alignment
= TYPE_PRECISION (pattern
);
9765 SET_CLASSTYPE_INTERFACE_UNKNOWN (type
);
9767 /* Set the input location to the most specialized template definition.
9768 This is needed if tsubsting causes an error. */
9769 typedecl
= TYPE_MAIN_DECL (pattern
);
9770 input_location
= DECL_SOURCE_LOCATION (TYPE_NAME (type
)) =
9771 DECL_SOURCE_LOCATION (typedecl
);
9773 TYPE_PACKED (type
) = TYPE_PACKED (pattern
);
9774 TYPE_ALIGN (type
) = TYPE_ALIGN (pattern
);
9775 TYPE_USER_ALIGN (type
) = TYPE_USER_ALIGN (pattern
);
9776 TYPE_FOR_JAVA (type
) = TYPE_FOR_JAVA (pattern
); /* For libjava's JArray<T> */
9777 if (ANON_AGGR_TYPE_P (pattern
))
9778 SET_ANON_AGGR_TYPE_P (type
);
9779 if (CLASSTYPE_VISIBILITY_SPECIFIED (pattern
))
9781 CLASSTYPE_VISIBILITY_SPECIFIED (type
) = 1;
9782 CLASSTYPE_VISIBILITY (type
) = CLASSTYPE_VISIBILITY (pattern
);
9783 /* Adjust visibility for template arguments. */
9784 determine_visibility (TYPE_MAIN_DECL (type
));
9786 if (CLASS_TYPE_P (type
))
9787 CLASSTYPE_FINAL (type
) = CLASSTYPE_FINAL (pattern
);
9789 pbinfo
= TYPE_BINFO (pattern
);
9791 /* We should never instantiate a nested class before its enclosing
9792 class; we need to look up the nested class by name before we can
9793 instantiate it, and that lookup should instantiate the enclosing
9795 gcc_assert (!DECL_CLASS_SCOPE_P (TYPE_MAIN_DECL (pattern
))
9796 || COMPLETE_OR_OPEN_TYPE_P (TYPE_CONTEXT (type
)));
9798 base_list
= NULL_TREE
;
9799 if (BINFO_N_BASE_BINFOS (pbinfo
))
9805 /* We must enter the scope containing the type, as that is where
9806 the accessibility of types named in dependent bases are
9808 pushed_scope
= push_scope (CP_TYPE_CONTEXT (type
));
9810 /* Substitute into each of the bases to determine the actual
9812 for (i
= 0; BINFO_BASE_ITERATE (pbinfo
, i
, pbase_binfo
); i
++)
9815 tree access
= BINFO_BASE_ACCESS (pbinfo
, i
);
9816 tree expanded_bases
= NULL_TREE
;
9819 if (PACK_EXPANSION_P (BINFO_TYPE (pbase_binfo
)))
9822 tsubst_pack_expansion (BINFO_TYPE (pbase_binfo
),
9823 args
, tf_error
, NULL_TREE
);
9824 if (expanded_bases
== error_mark_node
)
9827 len
= TREE_VEC_LENGTH (expanded_bases
);
9830 for (idx
= 0; idx
< len
; idx
++)
9833 /* Extract the already-expanded base class. */
9834 base
= TREE_VEC_ELT (expanded_bases
, idx
);
9836 /* Substitute to figure out the base class. */
9837 base
= tsubst (BINFO_TYPE (pbase_binfo
), args
, tf_error
,
9840 if (base
== error_mark_node
)
9843 base_list
= tree_cons (access
, base
, base_list
);
9844 if (BINFO_VIRTUAL_P (pbase_binfo
))
9845 TREE_TYPE (base_list
) = integer_type_node
;
9849 /* The list is now in reverse order; correct that. */
9850 base_list
= nreverse (base_list
);
9853 pop_scope (pushed_scope
);
9855 /* Now call xref_basetypes to set up all the base-class
9857 xref_basetypes (type
, base_list
);
9859 apply_late_template_attributes (&type
, TYPE_ATTRIBUTES (pattern
),
9860 (int) ATTR_FLAG_TYPE_IN_PLACE
,
9861 args
, tf_error
, NULL_TREE
);
9862 fixup_attribute_variants (type
);
9864 /* Now that our base classes are set up, enter the scope of the
9865 class, so that name lookups into base classes, etc. will work
9866 correctly. This is precisely analogous to what we do in
9867 begin_class_definition when defining an ordinary non-template
9868 class, except we also need to push the enclosing classes. */
9869 push_nested_class (type
);
9871 /* Now members are processed in the order of declaration. */
9872 for (member
= CLASSTYPE_DECL_LIST (pattern
);
9873 member
; member
= TREE_CHAIN (member
))
9875 tree t
= TREE_VALUE (member
);
9877 if (TREE_PURPOSE (member
))
9881 /* Build new CLASSTYPE_NESTED_UTDS. */
9884 bool class_template_p
;
9886 class_template_p
= (TREE_CODE (t
) != ENUMERAL_TYPE
9887 && TYPE_LANG_SPECIFIC (t
)
9888 && CLASSTYPE_IS_TEMPLATE (t
));
9889 /* If the member is a class template, then -- even after
9890 substitution -- there may be dependent types in the
9891 template argument list for the class. We increment
9892 PROCESSING_TEMPLATE_DECL so that dependent_type_p, as
9893 that function will assume that no types are dependent
9894 when outside of a template. */
9895 if (class_template_p
)
9896 ++processing_template_decl
;
9897 newtag
= tsubst (t
, args
, tf_error
, NULL_TREE
);
9898 if (class_template_p
)
9899 --processing_template_decl
;
9900 if (newtag
== error_mark_node
)
9903 if (TREE_CODE (newtag
) != ENUMERAL_TYPE
)
9905 tree name
= TYPE_IDENTIFIER (t
);
9907 if (class_template_p
)
9908 /* Unfortunately, lookup_template_class sets
9909 CLASSTYPE_IMPLICIT_INSTANTIATION for a partial
9910 instantiation (i.e., for the type of a member
9911 template class nested within a template class.)
9912 This behavior is required for
9913 maybe_process_partial_specialization to work
9914 correctly, but is not accurate in this case;
9915 the TAG is not an instantiation of anything.
9916 (The corresponding TEMPLATE_DECL is an
9917 instantiation, but the TYPE is not.) */
9918 CLASSTYPE_USE_TEMPLATE (newtag
) = 0;
9920 /* Now, we call pushtag to put this NEWTAG into the scope of
9921 TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid
9922 pushtag calling push_template_decl. We don't have to do
9923 this for enums because it will already have been done in
9926 SET_IDENTIFIER_TYPE_VALUE (name
, newtag
);
9927 pushtag (name
, newtag
, /*tag_scope=*/ts_current
);
9930 else if (DECL_DECLARES_FUNCTION_P (t
))
9932 /* Build new TYPE_METHODS. */
9935 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9936 ++processing_template_decl
;
9937 r
= tsubst (t
, args
, tf_error
, NULL_TREE
);
9938 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9939 --processing_template_decl
;
9940 set_current_access_from_decl (r
);
9941 finish_member_declaration (r
);
9942 /* Instantiate members marked with attribute used. */
9943 if (r
!= error_mark_node
&& DECL_PRESERVE_P (r
))
9945 if (TREE_CODE (r
) == FUNCTION_DECL
9946 && DECL_OMP_DECLARE_REDUCTION_P (r
))
9947 cp_check_omp_declare_reduction (r
);
9949 else if (DECL_CLASS_TEMPLATE_P (t
)
9950 && LAMBDA_TYPE_P (TREE_TYPE (t
)))
9951 /* A closure type for a lambda in a default argument for a
9952 member template. Ignore it; it will be instantiated with
9953 the default argument. */;
9956 /* Build new TYPE_FIELDS. */
9957 if (TREE_CODE (t
) == STATIC_ASSERT
)
9961 ++c_inhibit_evaluation_warnings
;
9963 tsubst_expr (STATIC_ASSERT_CONDITION (t
), args
,
9964 tf_warning_or_error
, NULL_TREE
,
9965 /*integral_constant_expression_p=*/true);
9966 --c_inhibit_evaluation_warnings
;
9968 finish_static_assert (condition
,
9969 STATIC_ASSERT_MESSAGE (t
),
9970 STATIC_ASSERT_SOURCE_LOCATION (t
),
9973 else if (TREE_CODE (t
) != CONST_DECL
)
9976 tree vec
= NULL_TREE
;
9979 /* The file and line for this declaration, to
9980 assist in error message reporting. Since we
9981 called push_tinst_level above, we don't need to
9983 input_location
= DECL_SOURCE_LOCATION (t
);
9985 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9986 ++processing_template_decl
;
9987 r
= tsubst (t
, args
, tf_warning_or_error
, NULL_TREE
);
9988 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9989 --processing_template_decl
;
9991 if (TREE_CODE (r
) == TREE_VEC
)
9993 /* A capture pack became multiple fields. */
9995 len
= TREE_VEC_LENGTH (vec
);
9998 for (int i
= 0; i
< len
; ++i
)
10001 r
= TREE_VEC_ELT (vec
, i
);
10006 [t]he initialization (and any associated
10007 side-effects) of a static data member does
10008 not occur unless the static data member is
10009 itself used in a way that requires the
10010 definition of the static data member to
10013 Therefore, we do not substitute into the
10014 initialized for the static data member here. */
10015 finish_static_data_member_decl
10017 /*init=*/NULL_TREE
,
10018 /*init_const_expr_p=*/false,
10019 /*asmspec_tree=*/NULL_TREE
,
10021 /* Instantiate members marked with attribute used. */
10022 if (r
!= error_mark_node
&& DECL_PRESERVE_P (r
))
10025 else if (TREE_CODE (r
) == FIELD_DECL
)
10027 /* Determine whether R has a valid type and can be
10028 completed later. If R is invalid, then its type
10029 is replaced by error_mark_node. */
10030 tree rtype
= TREE_TYPE (r
);
10031 if (can_complete_type_without_circularity (rtype
))
10032 complete_type (rtype
);
10034 if (!COMPLETE_TYPE_P (rtype
))
10036 cxx_incomplete_type_error (r
, rtype
);
10037 TREE_TYPE (r
) = error_mark_node
;
10041 /* If it is a TYPE_DECL for a class-scoped ENUMERAL_TYPE,
10042 such a thing will already have been added to the field
10043 list by tsubst_enum in finish_member_declaration in the
10044 CLASSTYPE_NESTED_UTDS case above. */
10045 if (!(TREE_CODE (r
) == TYPE_DECL
10046 && TREE_CODE (TREE_TYPE (r
)) == ENUMERAL_TYPE
10047 && DECL_ARTIFICIAL (r
)))
10049 set_current_access_from_decl (r
);
10050 finish_member_declaration (r
);
10058 if (TYPE_P (t
) || DECL_CLASS_TEMPLATE_P (t
)
10059 || DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
10061 /* Build new CLASSTYPE_FRIEND_CLASSES. */
10063 tree friend_type
= t
;
10064 bool adjust_processing_template_decl
= false;
10066 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
10068 /* template <class T> friend class C; */
10069 friend_type
= tsubst_friend_class (friend_type
, args
);
10070 adjust_processing_template_decl
= true;
10072 else if (TREE_CODE (friend_type
) == UNBOUND_CLASS_TEMPLATE
)
10074 /* template <class T> friend class C::D; */
10075 friend_type
= tsubst (friend_type
, args
,
10076 tf_warning_or_error
, NULL_TREE
);
10077 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
10078 friend_type
= TREE_TYPE (friend_type
);
10079 adjust_processing_template_decl
= true;
10081 else if (TREE_CODE (friend_type
) == TYPENAME_TYPE
10082 || TREE_CODE (friend_type
) == TEMPLATE_TYPE_PARM
)
10084 /* This could be either
10088 when dependent_type_p is false or
10090 template <class U> friend class T::C;
10093 friend_type
= tsubst (friend_type
, args
,
10094 tf_warning_or_error
, NULL_TREE
);
10095 /* Bump processing_template_decl for correct
10096 dependent_type_p calculation. */
10097 ++processing_template_decl
;
10098 if (dependent_type_p (friend_type
))
10099 adjust_processing_template_decl
= true;
10100 --processing_template_decl
;
10102 else if (!CLASSTYPE_USE_TEMPLATE (friend_type
)
10103 && hidden_name_p (TYPE_NAME (friend_type
)))
10107 where C hasn't been declared yet. Let's lookup name
10108 from namespace scope directly, bypassing any name that
10109 come from dependent base class. */
10110 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (friend_type
));
10112 /* The call to xref_tag_from_type does injection for friend
10114 push_nested_namespace (ns
);
10116 xref_tag_from_type (friend_type
, NULL_TREE
,
10117 /*tag_scope=*/ts_current
);
10118 pop_nested_namespace (ns
);
10120 else if (uses_template_parms (friend_type
))
10121 /* friend class C<T>; */
10122 friend_type
= tsubst (friend_type
, args
,
10123 tf_warning_or_error
, NULL_TREE
);
10128 where C is already declared or
10130 friend class C<int>;
10132 We don't have to do anything in these cases. */
10134 if (adjust_processing_template_decl
)
10135 /* Trick make_friend_class into realizing that the friend
10136 we're adding is a template, not an ordinary class. It's
10137 important that we use make_friend_class since it will
10138 perform some error-checking and output cross-reference
10140 ++processing_template_decl
;
10142 if (friend_type
!= error_mark_node
)
10143 make_friend_class (type
, friend_type
, /*complain=*/false);
10145 if (adjust_processing_template_decl
)
10146 --processing_template_decl
;
10150 /* Build new DECL_FRIENDLIST. */
10153 /* The file and line for this declaration, to
10154 assist in error message reporting. Since we
10155 called push_tinst_level above, we don't need to
10157 input_location
= DECL_SOURCE_LOCATION (t
);
10159 if (TREE_CODE (t
) == TEMPLATE_DECL
)
10161 ++processing_template_decl
;
10162 push_deferring_access_checks (dk_no_check
);
10165 r
= tsubst_friend_function (t
, args
);
10166 add_friend (type
, r
, /*complain=*/false);
10167 if (TREE_CODE (t
) == TEMPLATE_DECL
)
10169 pop_deferring_access_checks ();
10170 --processing_template_decl
;
10178 /* Restore these before substituting into the lambda capture
10180 cp_unevaluated_operand
= saved_unevaluated_operand
;
10181 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
10184 if (tree expr
= CLASSTYPE_LAMBDA_EXPR (type
))
10186 tree decl
= lambda_function (type
);
10189 if (!DECL_TEMPLATE_INFO (decl
)
10190 || DECL_TEMPLATE_RESULT (DECL_TI_TEMPLATE (decl
)) != decl
)
10191 instantiate_decl (decl
, false, false);
10193 /* We need to instantiate the capture list from the template
10194 after we've instantiated the closure members, but before we
10195 consider adding the conversion op. Also keep any captures
10196 that may have been added during instantiation of the op(). */
10197 tree tmpl_expr
= CLASSTYPE_LAMBDA_EXPR (pattern
);
10199 = tsubst_copy_and_build (LAMBDA_EXPR_CAPTURE_LIST (tmpl_expr
),
10200 args
, tf_warning_or_error
, NULL_TREE
,
10203 LAMBDA_EXPR_CAPTURE_LIST (expr
)
10204 = chainon (tmpl_cap
, nreverse (LAMBDA_EXPR_CAPTURE_LIST (expr
)));
10206 maybe_add_lambda_conv_op (type
);
10209 gcc_assert (errorcount
);
10212 /* Set the file and line number information to whatever is given for
10213 the class itself. This puts error messages involving generated
10214 implicit functions at a predictable point, and the same point
10215 that would be used for non-template classes. */
10216 input_location
= DECL_SOURCE_LOCATION (typedecl
);
10218 unreverse_member_declarations (type
);
10219 finish_struct_1 (type
);
10220 TYPE_BEING_DEFINED (type
) = 0;
10222 /* We don't instantiate default arguments for member functions. 14.7.1:
10224 The implicit instantiation of a class template specialization causes
10225 the implicit instantiation of the declarations, but not of the
10226 definitions or default arguments, of the class member functions,
10227 member classes, static data members and member templates.... */
10229 /* Some typedefs referenced from within the template code need to be access
10230 checked at template instantiation time, i.e now. These types were
10231 added to the template at parsing time. Let's get those and perform
10232 the access checks then. */
10233 perform_typedefs_access_check (pattern
, args
);
10234 perform_deferred_access_checks (tf_warning_or_error
);
10235 pop_nested_class ();
10236 maximum_field_alignment
= saved_maximum_field_alignment
;
10238 pop_from_top_level ();
10239 pop_deferring_access_checks ();
10240 pop_tinst_level ();
10242 /* The vtable for a template class can be emitted in any translation
10243 unit in which the class is instantiated. When there is no key
10244 method, however, finish_struct_1 will already have added TYPE to
10245 the keyed_classes list. */
10246 if (TYPE_CONTAINS_VPTR_P (type
) && CLASSTYPE_KEY_METHOD (type
))
10247 keyed_classes
= tree_cons (NULL_TREE
, type
, keyed_classes
);
10252 /* Wrapper for instantiate_class_template_1. */
10255 instantiate_class_template (tree type
)
10258 timevar_push (TV_TEMPLATE_INST
);
10259 ret
= instantiate_class_template_1 (type
);
10260 timevar_pop (TV_TEMPLATE_INST
);
10265 tsubst_template_arg (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
10271 else if (TYPE_P (t
))
10272 r
= tsubst (t
, args
, complain
, in_decl
);
10275 if (!(complain
& tf_warning
))
10276 ++c_inhibit_evaluation_warnings
;
10277 r
= tsubst_expr (t
, args
, complain
, in_decl
,
10278 /*integral_constant_expression_p=*/true);
10279 if (!(complain
& tf_warning
))
10280 --c_inhibit_evaluation_warnings
;
10285 /* Given a function parameter pack TMPL_PARM and some function parameters
10286 instantiated from it at *SPEC_P, return a NONTYPE_ARGUMENT_PACK of them
10287 and set *SPEC_P to point at the next point in the list. */
10290 extract_fnparm_pack (tree tmpl_parm
, tree
*spec_p
)
10292 /* Collect all of the extra "packed" parameters into an
10296 tree argpack
= make_node (NONTYPE_ARGUMENT_PACK
);
10297 tree argtypepack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
10298 tree spec_parm
= *spec_p
;
10301 for (len
= 0; spec_parm
; ++len
, spec_parm
= TREE_CHAIN (spec_parm
))
10303 && !function_parameter_expanded_from_pack_p (spec_parm
, tmpl_parm
))
10306 /* Fill in PARMVEC and PARMTYPEVEC with all of the parameters. */
10307 parmvec
= make_tree_vec (len
);
10308 parmtypevec
= make_tree_vec (len
);
10309 spec_parm
= *spec_p
;
10310 for (i
= 0; i
< len
; i
++, spec_parm
= DECL_CHAIN (spec_parm
))
10312 TREE_VEC_ELT (parmvec
, i
) = spec_parm
;
10313 TREE_VEC_ELT (parmtypevec
, i
) = TREE_TYPE (spec_parm
);
10316 /* Build the argument packs. */
10317 SET_ARGUMENT_PACK_ARGS (argpack
, parmvec
);
10318 SET_ARGUMENT_PACK_ARGS (argtypepack
, parmtypevec
);
10319 TREE_TYPE (argpack
) = argtypepack
;
10320 *spec_p
= spec_parm
;
10325 /* Give a chain SPEC_PARM of PARM_DECLs, pack them into a
10326 NONTYPE_ARGUMENT_PACK. */
10329 make_fnparm_pack (tree spec_parm
)
10331 return extract_fnparm_pack (NULL_TREE
, &spec_parm
);
10334 /* Return 1 if the Ith element of the argument pack ARG_PACK is a
10335 pack expansion with no extra args, 2 if it has extra args, or 0
10336 if it is not a pack expansion. */
10339 argument_pack_element_is_expansion_p (tree arg_pack
, int i
)
10341 tree vec
= ARGUMENT_PACK_ARGS (arg_pack
);
10342 if (i
>= TREE_VEC_LENGTH (vec
))
10344 tree elt
= TREE_VEC_ELT (vec
, i
);
10346 /* A decl pack is itself an expansion. */
10347 elt
= TREE_TYPE (elt
);
10348 if (!PACK_EXPANSION_P (elt
))
10350 if (PACK_EXPANSION_EXTRA_ARGS (elt
))
10356 /* Creates and return an ARGUMENT_PACK_SELECT tree node. */
10359 make_argument_pack_select (tree arg_pack
, unsigned index
)
10361 tree aps
= make_node (ARGUMENT_PACK_SELECT
);
10363 ARGUMENT_PACK_SELECT_FROM_PACK (aps
) = arg_pack
;
10364 ARGUMENT_PACK_SELECT_INDEX (aps
) = index
;
10369 /* This is a subroutine of tsubst_pack_expansion.
10371 It returns TRUE if we need to use the PACK_EXPANSION_EXTRA_ARGS
10372 mechanism to store the (non complete list of) arguments of the
10373 substitution and return a non substituted pack expansion, in order
10374 to wait for when we have enough arguments to really perform the
10378 use_pack_expansion_extra_args_p (tree parm_packs
,
10380 bool has_empty_arg
)
10382 /* If one pack has an expansion and another pack has a normal
10383 argument or if one pack has an empty argument and an another
10384 one hasn't then tsubst_pack_expansion cannot perform the
10385 substitution and need to fall back on the
10386 PACK_EXPANSION_EXTRA mechanism. */
10387 if (parm_packs
== NULL_TREE
)
10389 else if (has_empty_arg
)
10392 bool has_expansion_arg
= false;
10393 for (int i
= 0 ; i
< arg_pack_len
; ++i
)
10395 bool has_non_expansion_arg
= false;
10396 for (tree parm_pack
= parm_packs
;
10398 parm_pack
= TREE_CHAIN (parm_pack
))
10400 tree arg
= TREE_VALUE (parm_pack
);
10402 int exp
= argument_pack_element_is_expansion_p (arg
, i
);
10404 /* We can't substitute a pack expansion with extra args into
10408 has_expansion_arg
= true;
10410 has_non_expansion_arg
= true;
10413 if (has_expansion_arg
&& has_non_expansion_arg
)
10419 /* [temp.variadic]/6 says that:
10421 The instantiation of a pack expansion [...]
10422 produces a list E1,E2, ..., En, where N is the number of elements
10423 in the pack expansion parameters.
10425 This subroutine of tsubst_pack_expansion produces one of these Ei.
10427 PATTERN is the pattern of the pack expansion. PARM_PACKS is a
10428 TREE_LIST in which each TREE_PURPOSE is a parameter pack of
10429 PATTERN, and each TREE_VALUE is its corresponding argument pack.
10430 INDEX is the index 'i' of the element Ei to produce. ARGS,
10431 COMPLAIN, and IN_DECL are the same parameters as for the
10432 tsubst_pack_expansion function.
10434 The function returns the resulting Ei upon successful completion,
10435 or error_mark_node.
10437 Note that this function possibly modifies the ARGS parameter, so
10438 it's the responsibility of the caller to restore it. */
10441 gen_elem_of_pack_expansion_instantiation (tree pattern
,
10444 tree args
/* This parm gets
10446 tsubst_flags_t complain
,
10450 bool ith_elem_is_expansion
= false;
10452 /* For each parameter pack, change the substitution of the parameter
10453 pack to the ith argument in its argument pack, then expand the
10455 for (tree pack
= parm_packs
; pack
; pack
= TREE_CHAIN (pack
))
10457 tree parm
= TREE_PURPOSE (pack
);
10458 tree arg_pack
= TREE_VALUE (pack
);
10459 tree aps
; /* instance of ARGUMENT_PACK_SELECT. */
10461 ith_elem_is_expansion
|=
10462 argument_pack_element_is_expansion_p (arg_pack
, index
);
10464 /* Select the Ith argument from the pack. */
10465 if (TREE_CODE (parm
) == PARM_DECL
10466 || TREE_CODE (parm
) == FIELD_DECL
)
10470 aps
= make_argument_pack_select (arg_pack
, index
);
10471 if (!mark_used (parm
, complain
) && !(complain
& tf_error
))
10472 return error_mark_node
;
10473 register_local_specialization (aps
, parm
);
10476 aps
= retrieve_local_specialization (parm
);
10481 template_parm_level_and_index (parm
, &level
, &idx
);
10485 aps
= make_argument_pack_select (arg_pack
, index
);
10486 /* Update the corresponding argument. */
10487 TMPL_ARG (args
, level
, idx
) = aps
;
10490 /* Re-use the ARGUMENT_PACK_SELECT. */
10491 aps
= TMPL_ARG (args
, level
, idx
);
10493 ARGUMENT_PACK_SELECT_INDEX (aps
) = index
;
10496 /* Substitute into the PATTERN with the (possibly altered)
10498 if (pattern
== in_decl
)
10499 /* Expanding a fixed parameter pack from
10500 coerce_template_parameter_pack. */
10501 t
= tsubst_decl (pattern
, args
, complain
);
10502 else if (pattern
== error_mark_node
)
10503 t
= error_mark_node
;
10504 else if (constraint_p (pattern
))
10506 if (processing_template_decl
)
10507 t
= tsubst_constraint (pattern
, args
, complain
, in_decl
);
10509 t
= (constraints_satisfied_p (pattern
, args
)
10510 ? boolean_true_node
: boolean_false_node
);
10512 else if (!TYPE_P (pattern
))
10513 t
= tsubst_expr (pattern
, args
, complain
, in_decl
,
10514 /*integral_constant_expression_p=*/false);
10516 t
= tsubst (pattern
, args
, complain
, in_decl
);
10518 /* If the Ith argument pack element is a pack expansion, then
10519 the Ith element resulting from the substituting is going to
10520 be a pack expansion as well. */
10521 if (ith_elem_is_expansion
)
10522 t
= make_pack_expansion (t
);
10527 /* When the unexpanded parameter pack in a fold expression expands to an empty
10528 sequence, the value of the expression is as follows; the program is
10529 ill-formed if the operator is not listed in this table.
10540 expand_empty_fold (tree t
, tsubst_flags_t complain
)
10542 tree_code code
= (tree_code
)TREE_INT_CST_LOW (TREE_OPERAND (t
, 0));
10543 if (!FOLD_EXPR_MODIFY_P (t
))
10547 return integer_one_node
;
10549 return integer_zero_node
;
10551 return integer_minus_one_node
;
10553 return integer_zero_node
;
10554 case TRUTH_ANDIF_EXPR
:
10555 return boolean_true_node
;
10556 case TRUTH_ORIF_EXPR
:
10557 return boolean_false_node
;
10558 case COMPOUND_EXPR
:
10564 if (complain
& tf_error
)
10565 error_at (location_of (t
),
10566 "fold of empty expansion over %O", code
);
10567 return error_mark_node
;
10570 /* Given a fold-expression T and a current LEFT and RIGHT operand,
10571 form an expression that combines the two terms using the
10575 fold_expression (tree t
, tree left
, tree right
, tsubst_flags_t complain
)
10577 tree op
= FOLD_EXPR_OP (t
);
10578 tree_code code
= (tree_code
)TREE_INT_CST_LOW (op
);
10580 // Handle compound assignment operators.
10581 if (FOLD_EXPR_MODIFY_P (t
))
10582 return build_x_modify_expr (input_location
, left
, code
, right
, complain
);
10586 case COMPOUND_EXPR
:
10587 return build_x_compound_expr (input_location
, left
, right
, complain
);
10589 return build_m_component_ref (left
, right
, complain
);
10591 return build_x_binary_op (input_location
, code
,
10592 left
, TREE_CODE (left
),
10593 right
, TREE_CODE (right
),
10599 /* Substitute ARGS into the pack of a fold expression T. */
10602 tsubst_fold_expr_pack (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
10604 return tsubst_pack_expansion (FOLD_EXPR_PACK (t
), args
, complain
, in_decl
);
10607 /* Substitute ARGS into the pack of a fold expression T. */
10610 tsubst_fold_expr_init (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
10612 return tsubst_expr (FOLD_EXPR_INIT (t
), args
, complain
, in_decl
, false);
10615 /* Expand a PACK of arguments into a grouped as left fold.
10616 Given a pack containing elements A0, A1, ..., An and an
10617 operator @, this builds the expression:
10619 ((A0 @ A1) @ A2) ... @ An
10621 Note that PACK must not be empty.
10623 The operator is defined by the original fold expression T. */
10626 expand_left_fold (tree t
, tree pack
, tsubst_flags_t complain
)
10628 tree left
= TREE_VEC_ELT (pack
, 0);
10629 for (int i
= 1; i
< TREE_VEC_LENGTH (pack
); ++i
)
10631 tree right
= TREE_VEC_ELT (pack
, i
);
10632 left
= fold_expression (t
, left
, right
, complain
);
10637 /* Substitute into a unary left fold expression. */
10640 tsubst_unary_left_fold (tree t
, tree args
, tsubst_flags_t complain
,
10643 tree pack
= tsubst_fold_expr_pack (t
, args
, complain
, in_decl
);
10644 if (pack
== error_mark_node
)
10645 return error_mark_node
;
10646 if (TREE_VEC_LENGTH (pack
) == 0)
10647 return expand_empty_fold (t
, complain
);
10649 return expand_left_fold (t
, pack
, complain
);
10652 /* Substitute into a binary left fold expression.
10654 Do ths by building a single (non-empty) vector of argumnts and
10655 building the expression from those elements. */
10658 tsubst_binary_left_fold (tree t
, tree args
, tsubst_flags_t complain
,
10661 tree pack
= tsubst_fold_expr_pack (t
, args
, complain
, in_decl
);
10662 if (pack
== error_mark_node
)
10663 return error_mark_node
;
10664 tree init
= tsubst_fold_expr_init (t
, args
, complain
, in_decl
);
10665 if (init
== error_mark_node
)
10666 return error_mark_node
;
10668 tree vec
= make_tree_vec (TREE_VEC_LENGTH (pack
) + 1);
10669 TREE_VEC_ELT (vec
, 0) = init
;
10670 for (int i
= 0; i
< TREE_VEC_LENGTH (pack
); ++i
)
10671 TREE_VEC_ELT (vec
, i
+ 1) = TREE_VEC_ELT (pack
, i
);
10673 return expand_left_fold (t
, vec
, complain
);
10676 /* Expand a PACK of arguments into a grouped as right fold.
10677 Given a pack containing elementns A0, A1, ..., and an
10678 operator @, this builds the expression:
10680 A0@ ... (An-2 @ (An-1 @ An))
10682 Note that PACK must not be empty.
10684 The operator is defined by the original fold expression T. */
10687 expand_right_fold (tree t
, tree pack
, tsubst_flags_t complain
)
10689 // Build the expression.
10690 int n
= TREE_VEC_LENGTH (pack
);
10691 tree right
= TREE_VEC_ELT (pack
, n
- 1);
10692 for (--n
; n
!= 0; --n
)
10694 tree left
= TREE_VEC_ELT (pack
, n
- 1);
10695 right
= fold_expression (t
, left
, right
, complain
);
10700 /* Substitute into a unary right fold expression. */
10703 tsubst_unary_right_fold (tree t
, tree args
, tsubst_flags_t complain
,
10706 tree pack
= tsubst_fold_expr_pack (t
, args
, complain
, in_decl
);
10707 if (pack
== error_mark_node
)
10708 return error_mark_node
;
10709 if (TREE_VEC_LENGTH (pack
) == 0)
10710 return expand_empty_fold (t
, complain
);
10712 return expand_right_fold (t
, pack
, complain
);
10715 /* Substitute into a binary right fold expression.
10717 Do ths by building a single (non-empty) vector of arguments and
10718 building the expression from those elements. */
10721 tsubst_binary_right_fold (tree t
, tree args
, tsubst_flags_t complain
,
10724 tree pack
= tsubst_fold_expr_pack (t
, args
, complain
, in_decl
);
10725 if (pack
== error_mark_node
)
10726 return error_mark_node
;
10727 tree init
= tsubst_fold_expr_init (t
, args
, complain
, in_decl
);
10728 if (init
== error_mark_node
)
10729 return error_mark_node
;
10731 int n
= TREE_VEC_LENGTH (pack
);
10732 tree vec
= make_tree_vec (n
+ 1);
10733 for (int i
= 0; i
< n
; ++i
)
10734 TREE_VEC_ELT (vec
, i
) = TREE_VEC_ELT (pack
, i
);
10735 TREE_VEC_ELT (vec
, n
) = init
;
10737 return expand_right_fold (t
, vec
, complain
);
10741 /* Substitute ARGS into T, which is an pack expansion
10742 (i.e. TYPE_PACK_EXPANSION or EXPR_PACK_EXPANSION). Returns a
10743 TREE_VEC with the substituted arguments, a PACK_EXPANSION_* node
10744 (if only a partial substitution could be performed) or
10745 ERROR_MARK_NODE if there was an error. */
10747 tsubst_pack_expansion (tree t
, tree args
, tsubst_flags_t complain
,
10751 tree pack
, packs
= NULL_TREE
;
10752 bool unsubstituted_packs
= false;
10755 hash_map
<tree
, tree
> *saved_local_specializations
= NULL
;
10756 bool need_local_specializations
= false;
10759 gcc_assert (PACK_EXPANSION_P (t
));
10760 pattern
= PACK_EXPANSION_PATTERN (t
);
10762 /* Add in any args remembered from an earlier partial instantiation. */
10763 args
= add_to_template_args (PACK_EXPANSION_EXTRA_ARGS (t
), args
);
10765 levels
= TMPL_ARGS_DEPTH (args
);
10767 /* Determine the argument packs that will instantiate the parameter
10768 packs used in the expansion expression. While we're at it,
10769 compute the number of arguments to be expanded and make sure it
10771 for (pack
= PACK_EXPANSION_PARAMETER_PACKS (t
); pack
;
10772 pack
= TREE_CHAIN (pack
))
10774 tree parm_pack
= TREE_VALUE (pack
);
10775 tree arg_pack
= NULL_TREE
;
10776 tree orig_arg
= NULL_TREE
;
10779 if (TREE_CODE (parm_pack
) == BASES
)
10781 if (BASES_DIRECT (parm_pack
))
10782 return calculate_direct_bases (tsubst_expr (BASES_TYPE (parm_pack
),
10783 args
, complain
, in_decl
, false));
10785 return calculate_bases (tsubst_expr (BASES_TYPE (parm_pack
),
10786 args
, complain
, in_decl
, false));
10788 if (TREE_CODE (parm_pack
) == PARM_DECL
)
10790 /* We know we have correct local_specializations if this
10791 expansion is at function scope, or if we're dealing with a
10792 local parameter in a requires expression; for the latter,
10793 tsubst_requires_expr set it up appropriately. */
10794 if (PACK_EXPANSION_LOCAL_P (t
) || CONSTRAINT_VAR_P (parm_pack
))
10795 arg_pack
= retrieve_local_specialization (parm_pack
);
10798 /* We can't rely on local_specializations for a parameter
10799 name used later in a function declaration (such as in a
10800 late-specified return type). Even if it exists, it might
10801 have the wrong value for a recursive call. Just make a
10802 dummy decl, since it's only used for its type. */
10803 arg_pack
= tsubst_decl (parm_pack
, args
, complain
);
10804 if (arg_pack
&& DECL_PACK_P (arg_pack
))
10805 /* Partial instantiation of the parm_pack, we can't build
10806 up an argument pack yet. */
10807 arg_pack
= NULL_TREE
;
10809 arg_pack
= make_fnparm_pack (arg_pack
);
10810 need_local_specializations
= true;
10813 else if (TREE_CODE (parm_pack
) == FIELD_DECL
)
10814 arg_pack
= tsubst_copy (parm_pack
, args
, complain
, in_decl
);
10818 template_parm_level_and_index (parm_pack
, &level
, &idx
);
10820 if (level
<= levels
)
10821 arg_pack
= TMPL_ARG (args
, level
, idx
);
10824 orig_arg
= arg_pack
;
10825 if (arg_pack
&& TREE_CODE (arg_pack
) == ARGUMENT_PACK_SELECT
)
10826 arg_pack
= ARGUMENT_PACK_SELECT_FROM_PACK (arg_pack
);
10828 if (arg_pack
&& !ARGUMENT_PACK_P (arg_pack
))
10829 /* This can only happen if we forget to expand an argument
10830 pack somewhere else. Just return an error, silently. */
10832 result
= make_tree_vec (1);
10833 TREE_VEC_ELT (result
, 0) = error_mark_node
;
10840 TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg_pack
));
10842 /* Don't bother trying to do a partial substitution with
10843 incomplete packs; we'll try again after deduction. */
10844 if (ARGUMENT_PACK_INCOMPLETE_P (arg_pack
))
10849 else if (len
!= my_len
)
10851 if (!(complain
& tf_error
))
10852 /* Fail quietly. */;
10853 else if (TREE_CODE (t
) == TYPE_PACK_EXPANSION
)
10854 error ("mismatched argument pack lengths while expanding "
10858 error ("mismatched argument pack lengths while expanding "
10861 return error_mark_node
;
10864 /* Keep track of the parameter packs and their corresponding
10866 packs
= tree_cons (parm_pack
, arg_pack
, packs
);
10867 TREE_TYPE (packs
) = orig_arg
;
10871 /* We can't substitute for this parameter pack. We use a flag as
10872 well as the missing_level counter because function parameter
10873 packs don't have a level. */
10874 unsubstituted_packs
= true;
10878 /* If the expansion is just T..., return the matching argument pack. */
10879 if (!unsubstituted_packs
10880 && TREE_PURPOSE (packs
) == pattern
)
10882 tree args
= ARGUMENT_PACK_ARGS (TREE_VALUE (packs
));
10883 if (TREE_CODE (t
) == TYPE_PACK_EXPANSION
10884 || pack_expansion_args_count (args
))
10886 /* Otherwise use the normal path so we get convert_from_reference. */
10889 /* We cannot expand this expansion expression, because we don't have
10890 all of the argument packs we need. */
10891 if (use_pack_expansion_extra_args_p (packs
, len
, unsubstituted_packs
))
10893 /* We got some full packs, but we can't substitute them in until we
10894 have values for all the packs. So remember these until then. */
10896 t
= make_pack_expansion (pattern
);
10897 PACK_EXPANSION_EXTRA_ARGS (t
) = args
;
10900 else if (unsubstituted_packs
)
10902 /* There were no real arguments, we're just replacing a parameter
10903 pack with another version of itself. Substitute into the
10904 pattern and return a PACK_EXPANSION_*. The caller will need to
10906 if (TREE_CODE (t
) == EXPR_PACK_EXPANSION
)
10907 t
= tsubst_expr (pattern
, args
, complain
, in_decl
,
10908 /*integral_constant_expression_p=*/false);
10910 t
= tsubst (pattern
, args
, complain
, in_decl
);
10911 t
= make_pack_expansion (t
);
10915 gcc_assert (len
>= 0);
10917 if (need_local_specializations
)
10919 /* We're in a late-specified return type, so create our own local
10920 specializations map; the current map is either NULL or (in the
10921 case of recursive unification) might have bindings that we don't
10922 want to use or alter. */
10923 saved_local_specializations
= local_specializations
;
10924 local_specializations
= new hash_map
<tree
, tree
>;
10927 /* For each argument in each argument pack, substitute into the
10929 result
= make_tree_vec (len
);
10930 for (i
= 0; i
< len
; ++i
)
10932 t
= gen_elem_of_pack_expansion_instantiation (pattern
, packs
,
10936 TREE_VEC_ELT (result
, i
) = t
;
10937 if (t
== error_mark_node
)
10939 result
= error_mark_node
;
10944 /* Update ARGS to restore the substitution from parameter packs to
10945 their argument packs. */
10946 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
10948 tree parm
= TREE_PURPOSE (pack
);
10950 if (TREE_CODE (parm
) == PARM_DECL
10951 || TREE_CODE (parm
) == FIELD_DECL
)
10952 register_local_specialization (TREE_TYPE (pack
), parm
);
10957 if (TREE_VALUE (pack
) == NULL_TREE
)
10960 template_parm_level_and_index (parm
, &level
, &idx
);
10962 /* Update the corresponding argument. */
10963 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
10964 TREE_VEC_ELT (TREE_VEC_ELT (args
, level
-1 ), idx
) =
10967 TREE_VEC_ELT (args
, idx
) = TREE_TYPE (pack
);
10971 if (need_local_specializations
)
10973 delete local_specializations
;
10974 local_specializations
= saved_local_specializations
;
10980 /* Given PARM_DECL PARM, find the corresponding PARM_DECL in the template
10981 TMPL. We do this using DECL_PARM_INDEX, which should work even with
10982 parameter packs; all parms generated from a function parameter pack will
10983 have the same DECL_PARM_INDEX. */
10986 get_pattern_parm (tree parm
, tree tmpl
)
10988 tree pattern
= DECL_TEMPLATE_RESULT (tmpl
);
10991 if (DECL_ARTIFICIAL (parm
))
10993 for (patparm
= DECL_ARGUMENTS (pattern
);
10994 patparm
; patparm
= DECL_CHAIN (patparm
))
10995 if (DECL_ARTIFICIAL (patparm
)
10996 && DECL_NAME (parm
) == DECL_NAME (patparm
))
11001 patparm
= FUNCTION_FIRST_USER_PARM (DECL_TEMPLATE_RESULT (tmpl
));
11002 patparm
= chain_index (DECL_PARM_INDEX (parm
)-1, patparm
);
11003 gcc_assert (DECL_PARM_INDEX (patparm
)
11004 == DECL_PARM_INDEX (parm
));
11010 /* Substitute ARGS into the vector or list of template arguments T. */
11013 tsubst_template_args (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
11016 int len
, need_new
= 0, i
, expanded_len_adjust
= 0, out
;
11019 if (t
== error_mark_node
)
11020 return error_mark_node
;
11022 len
= TREE_VEC_LENGTH (t
);
11023 elts
= XALLOCAVEC (tree
, len
);
11025 for (i
= 0; i
< len
; i
++)
11027 tree orig_arg
= TREE_VEC_ELT (t
, i
);
11030 if (TREE_CODE (orig_arg
) == TREE_VEC
)
11031 new_arg
= tsubst_template_args (orig_arg
, args
, complain
, in_decl
);
11032 else if (PACK_EXPANSION_P (orig_arg
))
11034 /* Substitute into an expansion expression. */
11035 new_arg
= tsubst_pack_expansion (orig_arg
, args
, complain
, in_decl
);
11037 if (TREE_CODE (new_arg
) == TREE_VEC
)
11038 /* Add to the expanded length adjustment the number of
11039 expanded arguments. We subtract one from this
11040 measurement, because the argument pack expression
11041 itself is already counted as 1 in
11042 LEN. EXPANDED_LEN_ADJUST can actually be negative, if
11043 the argument pack is empty. */
11044 expanded_len_adjust
+= TREE_VEC_LENGTH (new_arg
) - 1;
11046 else if (ARGUMENT_PACK_P (orig_arg
))
11048 /* Substitute into each of the arguments. */
11049 new_arg
= TYPE_P (orig_arg
)
11050 ? cxx_make_type (TREE_CODE (orig_arg
))
11051 : make_node (TREE_CODE (orig_arg
));
11053 SET_ARGUMENT_PACK_ARGS (
11055 tsubst_template_args (ARGUMENT_PACK_ARGS (orig_arg
),
11056 args
, complain
, in_decl
));
11058 if (ARGUMENT_PACK_ARGS (new_arg
) == error_mark_node
)
11059 new_arg
= error_mark_node
;
11061 if (TREE_CODE (new_arg
) == NONTYPE_ARGUMENT_PACK
) {
11062 TREE_TYPE (new_arg
) = tsubst (TREE_TYPE (orig_arg
), args
,
11063 complain
, in_decl
);
11064 TREE_CONSTANT (new_arg
) = TREE_CONSTANT (orig_arg
);
11066 if (TREE_TYPE (new_arg
) == error_mark_node
)
11067 new_arg
= error_mark_node
;
11071 new_arg
= tsubst_template_arg (orig_arg
, args
, complain
, in_decl
);
11073 if (new_arg
== error_mark_node
)
11074 return error_mark_node
;
11077 if (new_arg
!= orig_arg
)
11084 /* Make space for the expanded arguments coming from template
11086 t
= make_tree_vec (len
+ expanded_len_adjust
);
11087 /* ORIG_T can contain TREE_VECs. That happens if ORIG_T contains the
11088 arguments for a member template.
11089 In that case each TREE_VEC in ORIG_T represents a level of template
11090 arguments, and ORIG_T won't carry any non defaulted argument count.
11091 It will rather be the nested TREE_VECs that will carry one.
11092 In other words, ORIG_T carries a non defaulted argument count only
11093 if it doesn't contain any nested TREE_VEC. */
11094 if (NON_DEFAULT_TEMPLATE_ARGS_COUNT (orig_t
))
11096 int count
= GET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (orig_t
);
11097 count
+= expanded_len_adjust
;
11098 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (t
, count
);
11100 for (i
= 0, out
= 0; i
< len
; i
++)
11102 if ((PACK_EXPANSION_P (TREE_VEC_ELT (orig_t
, i
))
11103 || ARGUMENT_PACK_P (TREE_VEC_ELT (orig_t
, i
)))
11104 && TREE_CODE (elts
[i
]) == TREE_VEC
)
11108 /* Now expand the template argument pack "in place". */
11109 for (idx
= 0; idx
< TREE_VEC_LENGTH (elts
[i
]); idx
++, out
++)
11110 TREE_VEC_ELT (t
, out
) = TREE_VEC_ELT (elts
[i
], idx
);
11114 TREE_VEC_ELT (t
, out
) = elts
[i
];
11122 /* Return the result of substituting ARGS into the template parameters
11123 given by PARMS. If there are m levels of ARGS and m + n levels of
11124 PARMS, then the result will contain n levels of PARMS. For
11125 example, if PARMS is `template <class T> template <class U>
11126 template <T*, U, class V>' and ARGS is {{int}, {double}} then the
11127 result will be `template <int*, double, class V>'. */
11130 tsubst_template_parms (tree parms
, tree args
, tsubst_flags_t complain
)
11132 tree r
= NULL_TREE
;
11135 /* When substituting into a template, we must set
11136 PROCESSING_TEMPLATE_DECL as the template parameters may be
11137 dependent if they are based on one-another, and the dependency
11138 predicates are short-circuit outside of templates. */
11139 ++processing_template_decl
;
11141 for (new_parms
= &r
;
11142 parms
&& TMPL_PARMS_DEPTH (parms
) > TMPL_ARGS_DEPTH (args
);
11143 new_parms
= &(TREE_CHAIN (*new_parms
)),
11144 parms
= TREE_CHAIN (parms
))
11147 make_tree_vec (TREE_VEC_LENGTH (TREE_VALUE (parms
)));
11150 for (i
= 0; i
< TREE_VEC_LENGTH (new_vec
); ++i
)
11154 if (parms
== error_mark_node
)
11157 tuple
= TREE_VEC_ELT (TREE_VALUE (parms
), i
);
11159 if (tuple
== error_mark_node
)
11162 TREE_VEC_ELT (new_vec
, i
) =
11163 tsubst_template_parm (tuple
, args
, complain
);
11167 tree_cons (size_int (TMPL_PARMS_DEPTH (parms
)
11168 - TMPL_ARGS_DEPTH (args
)),
11169 new_vec
, NULL_TREE
);
11172 --processing_template_decl
;
11177 /* Return the result of substituting ARGS into one template parameter
11178 given by T. T Must be a TREE_LIST which TREE_VALUE is the template
11179 parameter and which TREE_PURPOSE is the default argument of the
11180 template parameter. */
11183 tsubst_template_parm (tree t
, tree args
, tsubst_flags_t complain
)
11185 tree default_value
, parm_decl
;
11187 if (args
== NULL_TREE
11189 || t
== error_mark_node
)
11192 gcc_assert (TREE_CODE (t
) == TREE_LIST
);
11194 default_value
= TREE_PURPOSE (t
);
11195 parm_decl
= TREE_VALUE (t
);
11197 parm_decl
= tsubst (parm_decl
, args
, complain
, NULL_TREE
);
11198 if (TREE_CODE (parm_decl
) == PARM_DECL
11199 && invalid_nontype_parm_type_p (TREE_TYPE (parm_decl
), complain
))
11200 parm_decl
= error_mark_node
;
11201 default_value
= tsubst_template_arg (default_value
, args
,
11202 complain
, NULL_TREE
);
11204 return build_tree_list (default_value
, parm_decl
);
11207 /* Substitute the ARGS into the indicated aggregate (or enumeration)
11208 type T. If T is not an aggregate or enumeration type, it is
11209 handled as if by tsubst. IN_DECL is as for tsubst. If
11210 ENTERING_SCOPE is nonzero, T is the context for a template which
11211 we are presently tsubst'ing. Return the substituted value. */
11214 tsubst_aggr_type (tree t
,
11216 tsubst_flags_t complain
,
11218 int entering_scope
)
11220 if (t
== NULL_TREE
)
11223 switch (TREE_CODE (t
))
11226 if (TYPE_PTRMEMFUNC_P (t
))
11227 return tsubst (TYPE_PTRMEMFUNC_FN_TYPE (t
), args
, complain
, in_decl
);
11229 /* Else fall through. */
11230 case ENUMERAL_TYPE
:
11232 if (TYPE_TEMPLATE_INFO (t
) && uses_template_parms (t
))
11237 int saved_unevaluated_operand
;
11238 int saved_inhibit_evaluation_warnings
;
11240 /* In "sizeof(X<I>)" we need to evaluate "I". */
11241 saved_unevaluated_operand
= cp_unevaluated_operand
;
11242 cp_unevaluated_operand
= 0;
11243 saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
11244 c_inhibit_evaluation_warnings
= 0;
11246 /* First, determine the context for the type we are looking
11248 context
= TYPE_CONTEXT (t
);
11249 if (context
&& TYPE_P (context
))
11251 context
= tsubst_aggr_type (context
, args
, complain
,
11252 in_decl
, /*entering_scope=*/1);
11253 /* If context is a nested class inside a class template,
11254 it may still need to be instantiated (c++/33959). */
11255 context
= complete_type (context
);
11258 /* Then, figure out what arguments are appropriate for the
11259 type we are trying to find. For example, given:
11261 template <class T> struct S;
11262 template <class T, class U> void f(T, U) { S<U> su; }
11264 and supposing that we are instantiating f<int, double>,
11265 then our ARGS will be {int, double}, but, when looking up
11266 S we only want {double}. */
11267 argvec
= tsubst_template_args (TYPE_TI_ARGS (t
), args
,
11268 complain
, in_decl
);
11269 if (argvec
== error_mark_node
)
11270 r
= error_mark_node
;
11273 r
= lookup_template_class (t
, argvec
, in_decl
, context
,
11274 entering_scope
, complain
);
11275 r
= cp_build_qualified_type_real (r
, cp_type_quals (t
), complain
);
11278 cp_unevaluated_operand
= saved_unevaluated_operand
;
11279 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
11284 /* This is not a template type, so there's nothing to do. */
11288 return tsubst (t
, args
, complain
, in_decl
);
11292 /* Substitute into the default argument ARG (a default argument for
11293 FN), which has the indicated TYPE. */
11296 tsubst_default_argument (tree fn
, tree type
, tree arg
, tsubst_flags_t complain
)
11298 tree saved_class_ptr
= NULL_TREE
;
11299 tree saved_class_ref
= NULL_TREE
;
11300 int errs
= errorcount
+ sorrycount
;
11302 /* This can happen in invalid code. */
11303 if (TREE_CODE (arg
) == DEFAULT_ARG
)
11306 /* This default argument came from a template. Instantiate the
11307 default argument here, not in tsubst. In the case of
11316 we must be careful to do name lookup in the scope of S<T>,
11317 rather than in the current class. */
11318 push_access_scope (fn
);
11319 /* The "this" pointer is not valid in a default argument. */
11322 saved_class_ptr
= current_class_ptr
;
11323 cp_function_chain
->x_current_class_ptr
= NULL_TREE
;
11324 saved_class_ref
= current_class_ref
;
11325 cp_function_chain
->x_current_class_ref
= NULL_TREE
;
11328 push_deferring_access_checks(dk_no_deferred
);
11329 /* The default argument expression may cause implicitly defined
11330 member functions to be synthesized, which will result in garbage
11331 collection. We must treat this situation as if we were within
11332 the body of function so as to avoid collecting live data on the
11335 arg
= tsubst_expr (arg
, DECL_TI_ARGS (fn
),
11336 complain
, NULL_TREE
,
11337 /*integral_constant_expression_p=*/false);
11339 pop_deferring_access_checks();
11341 /* Restore the "this" pointer. */
11344 cp_function_chain
->x_current_class_ptr
= saved_class_ptr
;
11345 cp_function_chain
->x_current_class_ref
= saved_class_ref
;
11348 if (errorcount
+sorrycount
> errs
11349 && (complain
& tf_warning_or_error
))
11350 inform (input_location
,
11351 " when instantiating default argument for call to %D", fn
);
11353 /* Make sure the default argument is reasonable. */
11354 arg
= check_default_argument (type
, arg
, complain
);
11356 pop_access_scope (fn
);
11361 /* Substitute into all the default arguments for FN. */
11364 tsubst_default_arguments (tree fn
, tsubst_flags_t complain
)
11369 tmpl_args
= DECL_TI_ARGS (fn
);
11371 /* If this function is not yet instantiated, we certainly don't need
11372 its default arguments. */
11373 if (uses_template_parms (tmpl_args
))
11375 /* Don't do this again for clones. */
11376 if (DECL_CLONED_FUNCTION_P (fn
))
11379 for (arg
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
11381 arg
= TREE_CHAIN (arg
))
11382 if (TREE_PURPOSE (arg
))
11383 TREE_PURPOSE (arg
) = tsubst_default_argument (fn
,
11385 TREE_PURPOSE (arg
),
11389 /* Substitute the ARGS into the T, which is a _DECL. Return the
11390 result of the substitution. Issue error and warning messages under
11391 control of COMPLAIN. */
11394 tsubst_decl (tree t
, tree args
, tsubst_flags_t complain
)
11396 #define RETURN(EXP) do { r = (EXP); goto out; } while(0)
11397 location_t saved_loc
;
11398 tree r
= NULL_TREE
;
11400 hashval_t hash
= 0;
11402 /* Set the filename and linenumber to improve error-reporting. */
11403 saved_loc
= input_location
;
11404 input_location
= DECL_SOURCE_LOCATION (t
);
11406 switch (TREE_CODE (t
))
11408 case TEMPLATE_DECL
:
11410 /* We can get here when processing a member function template,
11411 member class template, or template template parameter. */
11412 tree decl
= DECL_TEMPLATE_RESULT (t
);
11417 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
11419 /* Template template parameter is treated here. */
11420 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11421 if (new_type
== error_mark_node
)
11422 r
= error_mark_node
;
11423 /* If we get a real template back, return it. This can happen in
11424 the context of most_specialized_partial_spec. */
11425 else if (TREE_CODE (new_type
) == TEMPLATE_DECL
)
11428 /* The new TEMPLATE_DECL was built in
11429 reduce_template_parm_level. */
11430 r
= TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (new_type
);
11434 /* We might already have an instance of this template.
11435 The ARGS are for the surrounding class type, so the
11436 full args contain the tsubst'd args for the context,
11437 plus the innermost args from the template decl. */
11438 tmpl_args
= DECL_CLASS_TEMPLATE_P (t
)
11439 ? CLASSTYPE_TI_ARGS (TREE_TYPE (t
))
11440 : DECL_TI_ARGS (DECL_TEMPLATE_RESULT (t
));
11441 /* Because this is a template, the arguments will still be
11442 dependent, even after substitution. If
11443 PROCESSING_TEMPLATE_DECL is not set, the dependency
11444 predicates will short-circuit. */
11445 ++processing_template_decl
;
11446 full_args
= tsubst_template_args (tmpl_args
, args
,
11447 complain
, in_decl
);
11448 --processing_template_decl
;
11449 if (full_args
== error_mark_node
)
11450 RETURN (error_mark_node
);
11452 /* If this is a default template template argument,
11453 tsubst might not have changed anything. */
11454 if (full_args
== tmpl_args
)
11457 hash
= hash_tmpl_and_args (t
, full_args
);
11458 spec
= retrieve_specialization (t
, full_args
, hash
);
11459 if (spec
!= NULL_TREE
)
11465 /* Make a new template decl. It will be similar to the
11466 original, but will record the current template arguments.
11467 We also create a new function declaration, which is just
11468 like the old one, but points to this new template, rather
11469 than the old one. */
11471 gcc_assert (DECL_LANG_SPECIFIC (r
) != 0);
11472 DECL_CHAIN (r
) = NULL_TREE
;
11474 // Build new template info linking to the original template decl.
11475 DECL_TEMPLATE_INFO (r
) = build_template_info (t
, args
);
11477 if (TREE_CODE (decl
) == TYPE_DECL
11478 && !TYPE_DECL_ALIAS_P (decl
))
11481 ++processing_template_decl
;
11482 new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11483 --processing_template_decl
;
11484 if (new_type
== error_mark_node
)
11485 RETURN (error_mark_node
);
11487 TREE_TYPE (r
) = new_type
;
11488 /* For a partial specialization, we need to keep pointing to
11489 the primary template. */
11490 if (!DECL_TEMPLATE_SPECIALIZATION (t
))
11491 CLASSTYPE_TI_TEMPLATE (new_type
) = r
;
11492 DECL_TEMPLATE_RESULT (r
) = TYPE_MAIN_DECL (new_type
);
11493 DECL_TI_ARGS (r
) = CLASSTYPE_TI_ARGS (new_type
);
11494 DECL_CONTEXT (r
) = TYPE_CONTEXT (new_type
);
11499 ++processing_template_decl
;
11500 new_decl
= tsubst (decl
, args
, complain
, in_decl
);
11501 --processing_template_decl
;
11502 if (new_decl
== error_mark_node
)
11503 RETURN (error_mark_node
);
11505 DECL_TEMPLATE_RESULT (r
) = new_decl
;
11506 DECL_TI_TEMPLATE (new_decl
) = r
;
11507 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
11508 DECL_TI_ARGS (r
) = DECL_TI_ARGS (new_decl
);
11509 DECL_CONTEXT (r
) = DECL_CONTEXT (new_decl
);
11512 SET_DECL_IMPLICIT_INSTANTIATION (r
);
11513 DECL_TEMPLATE_INSTANTIATIONS (r
) = NULL_TREE
;
11514 DECL_TEMPLATE_SPECIALIZATIONS (r
) = NULL_TREE
;
11516 /* The template parameters for this new template are all the
11517 template parameters for the old template, except the
11518 outermost level of parameters. */
11519 DECL_TEMPLATE_PARMS (r
)
11520 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
,
11523 if (PRIMARY_TEMPLATE_P (t
))
11524 DECL_PRIMARY_TEMPLATE (r
) = r
;
11526 if (TREE_CODE (decl
) != TYPE_DECL
&& !VAR_P (decl
))
11527 /* Record this non-type partial instantiation. */
11528 register_specialization (r
, t
,
11529 DECL_TI_ARGS (DECL_TEMPLATE_RESULT (r
)),
11534 case FUNCTION_DECL
:
11537 tree argvec
= NULL_TREE
;
11545 /* Nobody should be tsubst'ing into non-template functions. */
11546 gcc_assert (DECL_TEMPLATE_INFO (t
) != NULL_TREE
);
11548 if (TREE_CODE (DECL_TI_TEMPLATE (t
)) == TEMPLATE_DECL
)
11553 /* If T is not dependent, just return it. We have to
11554 increment PROCESSING_TEMPLATE_DECL because
11555 value_dependent_expression_p assumes that nothing is
11556 dependent when PROCESSING_TEMPLATE_DECL is zero. */
11557 ++processing_template_decl
;
11558 dependent_p
= value_dependent_expression_p (t
);
11559 --processing_template_decl
;
11563 /* Calculate the most general template of which R is a
11564 specialization, and the complete set of arguments used to
11566 gen_tmpl
= most_general_template (DECL_TI_TEMPLATE (t
));
11567 argvec
= tsubst_template_args (DECL_TI_ARGS
11568 (DECL_TEMPLATE_RESULT
11569 (DECL_TI_TEMPLATE (t
))),
11570 args
, complain
, in_decl
);
11571 if (argvec
== error_mark_node
)
11572 RETURN (error_mark_node
);
11574 /* Check to see if we already have this specialization. */
11575 hash
= hash_tmpl_and_args (gen_tmpl
, argvec
);
11576 spec
= retrieve_specialization (gen_tmpl
, argvec
, hash
);
11584 /* We can see more levels of arguments than parameters if
11585 there was a specialization of a member template, like
11588 template <class T> struct S { template <class U> void f(); }
11589 template <> template <class U> void S<int>::f(U);
11591 Here, we'll be substituting into the specialization,
11592 because that's where we can find the code we actually
11593 want to generate, but we'll have enough arguments for
11594 the most general template.
11596 We also deal with the peculiar case:
11598 template <class T> struct S {
11599 template <class U> friend void f();
11601 template <class U> void f() {}
11603 template void f<double>();
11605 Here, the ARGS for the instantiation of will be {int,
11606 double}. But, we only need as many ARGS as there are
11607 levels of template parameters in CODE_PATTERN. We are
11608 careful not to get fooled into reducing the ARGS in
11611 template <class T> struct S { template <class U> void f(U); }
11612 template <class T> template <> void S<T>::f(int) {}
11614 which we can spot because the pattern will be a
11615 specialization in this case. */
11616 args_depth
= TMPL_ARGS_DEPTH (args
);
11618 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (t
)));
11619 if (args_depth
> parms_depth
11620 && !DECL_TEMPLATE_SPECIALIZATION (t
))
11621 args
= get_innermost_template_args (args
, parms_depth
);
11625 /* This special case arises when we have something like this:
11627 template <class T> struct S {
11628 friend void f<int>(int, double);
11631 Here, the DECL_TI_TEMPLATE for the friend declaration
11632 will be an IDENTIFIER_NODE. We are being called from
11633 tsubst_friend_function, and we want only to create a
11634 new decl (R) with appropriate types so that we can call
11635 determine_specialization. */
11636 gen_tmpl
= NULL_TREE
;
11639 if (DECL_CLASS_SCOPE_P (t
))
11641 if (DECL_NAME (t
) == constructor_name (DECL_CONTEXT (t
)))
11645 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
,
11646 complain
, t
, /*entering_scope=*/1);
11651 ctx
= DECL_CONTEXT (t
);
11653 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11654 if (type
== error_mark_node
)
11655 RETURN (error_mark_node
);
11657 /* If we hit excessive deduction depth, the type is bogus even if
11658 it isn't error_mark_node, so don't build a decl. */
11659 if (excessive_deduction_depth
)
11660 RETURN (error_mark_node
);
11662 /* We do NOT check for matching decls pushed separately at this
11663 point, as they may not represent instantiations of this
11664 template, and in any case are considered separate under the
11667 DECL_USE_TEMPLATE (r
) = 0;
11668 TREE_TYPE (r
) = type
;
11669 /* Clear out the mangled name and RTL for the instantiation. */
11670 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
11671 SET_DECL_RTL (r
, NULL
);
11672 /* Leave DECL_INITIAL set on deleted instantiations. */
11673 if (!DECL_DELETED_FN (r
))
11674 DECL_INITIAL (r
) = NULL_TREE
;
11675 DECL_CONTEXT (r
) = ctx
;
11677 /* OpenMP UDRs have the only argument a reference to the declared
11678 type. We want to diagnose if the declared type is a reference,
11679 which is invalid, but as references to references are usually
11680 quietly merged, diagnose it here. */
11681 if (DECL_OMP_DECLARE_REDUCTION_P (t
))
11684 = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (t
))));
11685 argtype
= tsubst (argtype
, args
, complain
, in_decl
);
11686 if (TREE_CODE (argtype
) == REFERENCE_TYPE
)
11687 error_at (DECL_SOURCE_LOCATION (t
),
11688 "reference type %qT in "
11689 "%<#pragma omp declare reduction%>", argtype
);
11690 if (strchr (IDENTIFIER_POINTER (DECL_NAME (t
)), '~') == NULL
)
11691 DECL_NAME (r
) = omp_reduction_id (ERROR_MARK
, DECL_NAME (t
),
11695 if (member
&& DECL_CONV_FN_P (r
))
11696 /* Type-conversion operator. Reconstruct the name, in
11697 case it's the name of one of the template's parameters. */
11698 DECL_NAME (r
) = mangle_conv_op_name_for_type (TREE_TYPE (type
));
11700 DECL_ARGUMENTS (r
) = tsubst (DECL_ARGUMENTS (t
), args
,
11702 DECL_RESULT (r
) = NULL_TREE
;
11704 TREE_STATIC (r
) = 0;
11705 TREE_PUBLIC (r
) = TREE_PUBLIC (t
);
11706 DECL_EXTERNAL (r
) = 1;
11707 /* If this is an instantiation of a function with internal
11708 linkage, we already know what object file linkage will be
11709 assigned to the instantiation. */
11710 DECL_INTERFACE_KNOWN (r
) = !TREE_PUBLIC (r
);
11711 DECL_DEFER_OUTPUT (r
) = 0;
11712 DECL_CHAIN (r
) = NULL_TREE
;
11713 DECL_PENDING_INLINE_INFO (r
) = 0;
11714 DECL_PENDING_INLINE_P (r
) = 0;
11715 DECL_SAVED_TREE (r
) = NULL_TREE
;
11716 DECL_STRUCT_FUNCTION (r
) = NULL
;
11718 /* We'll re-clone as appropriate in instantiate_template. */
11719 DECL_CLONED_FUNCTION (r
) = NULL_TREE
;
11721 /* If we aren't complaining now, return on error before we register
11722 the specialization so that we'll complain eventually. */
11723 if ((complain
& tf_error
) == 0
11724 && IDENTIFIER_OPNAME_P (DECL_NAME (r
))
11725 && !grok_op_properties (r
, /*complain=*/false))
11726 RETURN (error_mark_node
);
11728 /* When instantiating a constrained member, substitute
11729 into the constraints to create a new constraint. */
11730 if (tree ci
= get_constraints (t
))
11733 ci
= tsubst_constraint_info (ci
, argvec
, complain
, NULL_TREE
);
11734 set_constraints (r
, ci
);
11737 /* Set up the DECL_TEMPLATE_INFO for R. There's no need to do
11738 this in the special friend case mentioned above where
11739 GEN_TMPL is NULL. */
11742 DECL_TEMPLATE_INFO (r
)
11743 = build_template_info (gen_tmpl
, argvec
);
11744 SET_DECL_IMPLICIT_INSTANTIATION (r
);
11747 = register_specialization (r
, gen_tmpl
, argvec
, false, hash
);
11749 /* We instantiated this while substituting into
11750 the type earlier (template/friend54.C). */
11753 /* We're not supposed to instantiate default arguments
11754 until they are called, for a template. But, for a
11757 template <class T> void f ()
11758 { extern void g(int i = T()); }
11760 we should do the substitution when the template is
11761 instantiated. We handle the member function case in
11762 instantiate_class_template since the default arguments
11763 might refer to other members of the class. */
11765 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
11766 && !uses_template_parms (argvec
))
11767 tsubst_default_arguments (r
, complain
);
11770 DECL_TEMPLATE_INFO (r
) = NULL_TREE
;
11772 /* Copy the list of befriending classes. */
11773 for (friends
= &DECL_BEFRIENDING_CLASSES (r
);
11775 friends
= &TREE_CHAIN (*friends
))
11777 *friends
= copy_node (*friends
);
11778 TREE_VALUE (*friends
) = tsubst (TREE_VALUE (*friends
),
11783 if (DECL_CONSTRUCTOR_P (r
) || DECL_DESTRUCTOR_P (r
))
11785 maybe_retrofit_in_chrg (r
);
11786 if (DECL_CONSTRUCTOR_P (r
))
11787 grok_ctor_properties (ctx
, r
);
11788 if (DECL_INHERITED_CTOR_BASE (r
))
11789 deduce_inheriting_ctor (r
);
11790 /* If this is an instantiation of a member template, clone it.
11791 If it isn't, that'll be handled by
11792 clone_constructors_and_destructors. */
11793 if (PRIMARY_TEMPLATE_P (gen_tmpl
))
11794 clone_function_decl (r
, /*update_method_vec_p=*/0);
11796 else if ((complain
& tf_error
) != 0
11797 && IDENTIFIER_OPNAME_P (DECL_NAME (r
))
11798 && !grok_op_properties (r
, /*complain=*/true))
11799 RETURN (error_mark_node
);
11801 if (DECL_FRIEND_P (t
) && DECL_FRIEND_CONTEXT (t
))
11802 SET_DECL_FRIEND_CONTEXT (r
,
11803 tsubst (DECL_FRIEND_CONTEXT (t
),
11804 args
, complain
, in_decl
));
11806 /* Possibly limit visibility based on template args. */
11807 DECL_VISIBILITY (r
) = VISIBILITY_DEFAULT
;
11808 if (DECL_VISIBILITY_SPECIFIED (t
))
11810 DECL_VISIBILITY_SPECIFIED (r
) = 0;
11811 DECL_ATTRIBUTES (r
)
11812 = remove_attribute ("visibility", DECL_ATTRIBUTES (r
));
11814 determine_visibility (r
);
11815 if (DECL_DEFAULTED_OUTSIDE_CLASS_P (r
)
11816 && !processing_template_decl
)
11817 defaulted_late_check (r
);
11819 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
11820 args
, complain
, in_decl
);
11826 tree type
= NULL_TREE
;
11828 tree expanded_types
= NULL_TREE
;
11829 tree prev_r
= NULL_TREE
;
11830 tree first_r
= NULL_TREE
;
11832 if (DECL_PACK_P (t
))
11834 /* If there is a local specialization that isn't a
11835 parameter pack, it means that we're doing a "simple"
11836 substitution from inside tsubst_pack_expansion. Just
11837 return the local specialization (which will be a single
11839 tree spec
= retrieve_local_specialization (t
);
11841 && TREE_CODE (spec
) == PARM_DECL
11842 && TREE_CODE (TREE_TYPE (spec
)) != TYPE_PACK_EXPANSION
)
11845 /* Expand the TYPE_PACK_EXPANSION that provides the types for
11846 the parameters in this function parameter pack. */
11847 expanded_types
= tsubst_pack_expansion (TREE_TYPE (t
), args
,
11848 complain
, in_decl
);
11849 if (TREE_CODE (expanded_types
) == TREE_VEC
)
11851 len
= TREE_VEC_LENGTH (expanded_types
);
11853 /* Zero-length parameter packs are boring. Just substitute
11856 RETURN (tsubst (TREE_CHAIN (t
), args
, complain
,
11861 /* All we did was update the type. Make a note of that. */
11862 type
= expanded_types
;
11863 expanded_types
= NULL_TREE
;
11867 /* Loop through all of the parameters we'll build. When T is
11868 a function parameter pack, LEN is the number of expanded
11869 types in EXPANDED_TYPES; otherwise, LEN is 1. */
11871 for (i
= 0; i
< len
; ++i
)
11875 if (DECL_TEMPLATE_PARM_P (t
))
11876 SET_DECL_TEMPLATE_PARM_P (r
);
11878 if (expanded_types
)
11879 /* We're on the Ith parameter of the function parameter
11882 /* Get the Ith type. */
11883 type
= TREE_VEC_ELT (expanded_types
, i
);
11885 /* Rename the parameter to include the index. */
11887 = make_ith_pack_parameter_name (DECL_NAME (r
), i
);
11890 /* We're dealing with a normal parameter. */
11891 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11893 type
= type_decays_to (type
);
11894 TREE_TYPE (r
) = type
;
11895 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
11897 if (DECL_INITIAL (r
))
11899 if (TREE_CODE (DECL_INITIAL (r
)) != TEMPLATE_PARM_INDEX
)
11900 DECL_INITIAL (r
) = TREE_TYPE (r
);
11902 DECL_INITIAL (r
) = tsubst (DECL_INITIAL (r
), args
,
11903 complain
, in_decl
);
11906 DECL_CONTEXT (r
) = NULL_TREE
;
11908 if (!DECL_TEMPLATE_PARM_P (r
))
11909 DECL_ARG_TYPE (r
) = type_passed_as (type
);
11911 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
11912 args
, complain
, in_decl
);
11914 /* Keep track of the first new parameter we
11915 generate. That's what will be returned to the
11920 /* Build a proper chain of parameters when substituting
11921 into a function parameter pack. */
11923 DECL_CHAIN (prev_r
) = r
;
11926 /* If cp_unevaluated_operand is set, we're just looking for a
11927 single dummy parameter, so don't keep going. */
11928 if (DECL_CHAIN (t
) && !cp_unevaluated_operand
)
11929 DECL_CHAIN (r
) = tsubst (DECL_CHAIN (t
), args
,
11930 complain
, DECL_CHAIN (t
));
11932 /* FIRST_R contains the start of the chain we've built. */
11939 tree type
= NULL_TREE
;
11940 tree vec
= NULL_TREE
;
11941 tree expanded_types
= NULL_TREE
;
11944 if (PACK_EXPANSION_P (TREE_TYPE (t
)))
11946 /* This field is a lambda capture pack. Return a TREE_VEC of
11947 the expanded fields to instantiate_class_template_1 and
11948 store them in the specializations hash table as a
11949 NONTYPE_ARGUMENT_PACK so that tsubst_copy can find them. */
11950 expanded_types
= tsubst_pack_expansion (TREE_TYPE (t
), args
,
11951 complain
, in_decl
);
11952 if (TREE_CODE (expanded_types
) == TREE_VEC
)
11954 len
= TREE_VEC_LENGTH (expanded_types
);
11955 vec
= make_tree_vec (len
);
11959 /* All we did was update the type. Make a note of that. */
11960 type
= expanded_types
;
11961 expanded_types
= NULL_TREE
;
11965 for (int i
= 0; i
< len
; ++i
)
11968 if (expanded_types
)
11970 type
= TREE_VEC_ELT (expanded_types
, i
);
11972 = make_ith_pack_parameter_name (DECL_NAME (r
), i
);
11975 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11977 if (type
== error_mark_node
)
11978 RETURN (error_mark_node
);
11979 TREE_TYPE (r
) = type
;
11980 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
11982 if (DECL_C_BIT_FIELD (r
))
11983 /* For bit-fields, DECL_INITIAL gives the number of bits. For
11984 non-bit-fields DECL_INITIAL is a non-static data member
11985 initializer, which gets deferred instantiation. */
11987 = tsubst_expr (DECL_INITIAL (t
), args
,
11989 /*integral_constant_expression_p=*/true);
11990 else if (DECL_INITIAL (t
))
11992 /* Set up DECL_TEMPLATE_INFO so that we can get at the
11993 NSDMI in perform_member_init. Still set DECL_INITIAL
11994 so that we know there is one. */
11995 DECL_INITIAL (r
) = void_node
;
11996 gcc_assert (DECL_LANG_SPECIFIC (r
) == NULL
);
11997 retrofit_lang_decl (r
);
11998 DECL_TEMPLATE_INFO (r
) = build_template_info (t
, args
);
12000 /* We don't have to set DECL_CONTEXT here; it is set by
12001 finish_member_declaration. */
12002 DECL_CHAIN (r
) = NULL_TREE
;
12004 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
12005 args
, complain
, in_decl
);
12008 TREE_VEC_ELT (vec
, i
) = r
;
12014 tree pack
= make_node (NONTYPE_ARGUMENT_PACK
);
12015 tree tpack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
12016 SET_ARGUMENT_PACK_ARGS (pack
, vec
);
12017 SET_ARGUMENT_PACK_ARGS (tpack
, expanded_types
);
12018 TREE_TYPE (pack
) = tpack
;
12019 register_specialization (pack
, t
, args
, false, 0);
12025 /* We reach here only for member using decls. We also need to check
12026 uses_template_parms because DECL_DEPENDENT_P is not set for a
12027 using-declaration that designates a member of the current
12028 instantiation (c++/53549). */
12029 if (DECL_DEPENDENT_P (t
)
12030 || uses_template_parms (USING_DECL_SCOPE (t
)))
12032 tree inst_scope
= tsubst_copy (USING_DECL_SCOPE (t
), args
,
12033 complain
, in_decl
);
12034 tree name
= tsubst_copy (DECL_NAME (t
), args
, complain
, in_decl
);
12035 r
= do_class_using_decl (inst_scope
, name
);
12037 r
= error_mark_node
;
12040 TREE_PROTECTED (r
) = TREE_PROTECTED (t
);
12041 TREE_PRIVATE (r
) = TREE_PRIVATE (t
);
12047 DECL_CHAIN (r
) = NULL_TREE
;
12054 tree argvec
= NULL_TREE
;
12055 tree gen_tmpl
= NULL_TREE
;
12057 tree tmpl
= NULL_TREE
;
12059 tree type
= NULL_TREE
;
12062 if (TREE_TYPE (t
) == error_mark_node
)
12063 RETURN (error_mark_node
);
12065 if (TREE_CODE (t
) == TYPE_DECL
12066 && t
== TYPE_MAIN_DECL (TREE_TYPE (t
)))
12068 /* If this is the canonical decl, we don't have to
12069 mess with instantiations, and often we can't (for
12070 typename, template type parms and such). Note that
12071 TYPE_NAME is not correct for the above test if
12072 we've copied the type for a typedef. */
12073 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12074 if (type
== error_mark_node
)
12075 RETURN (error_mark_node
);
12076 r
= TYPE_NAME (type
);
12080 /* Check to see if we already have the specialization we
12083 if (DECL_CLASS_SCOPE_P (t
) || DECL_NAMESPACE_SCOPE_P (t
))
12085 /* T is a static data member or namespace-scope entity.
12086 We have to substitute into namespace-scope variables
12087 (not just variable templates) because of cases like:
12089 template <class T> void f() { extern T t; }
12091 where the entity referenced is not known until
12092 instantiation time. */
12094 ctx
= DECL_CONTEXT (t
);
12095 if (DECL_CLASS_SCOPE_P (t
))
12097 ctx
= tsubst_aggr_type (ctx
, args
,
12099 in_decl
, /*entering_scope=*/1);
12100 /* If CTX is unchanged, then T is in fact the
12101 specialization we want. That situation occurs when
12102 referencing a static data member within in its own
12103 class. We can use pointer equality, rather than
12104 same_type_p, because DECL_CONTEXT is always
12106 if (ctx
== DECL_CONTEXT (t
)
12107 /* ... unless T is a member template; in which
12108 case our caller can be willing to create a
12109 specialization of that template represented
12111 && !(DECL_TI_TEMPLATE (t
)
12112 && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (t
))))
12118 tmpl
= DECL_TI_TEMPLATE (t
);
12119 gen_tmpl
= most_general_template (tmpl
);
12120 argvec
= tsubst (DECL_TI_ARGS (t
), args
, complain
, in_decl
);
12121 if (argvec
!= error_mark_node
)
12122 argvec
= (coerce_innermost_template_parms
12123 (DECL_TEMPLATE_PARMS (gen_tmpl
),
12124 argvec
, t
, complain
,
12125 /*all*/true, /*defarg*/true));
12126 if (argvec
== error_mark_node
)
12127 RETURN (error_mark_node
);
12128 hash
= hash_tmpl_and_args (gen_tmpl
, argvec
);
12129 spec
= retrieve_specialization (gen_tmpl
, argvec
, hash
);
12134 /* A local variable. */
12136 /* Subsequent calls to pushdecl will fill this in. */
12138 spec
= retrieve_local_specialization (t
);
12140 /* If we already have the specialization we need, there is
12141 nothing more to do. */
12148 /* Create a new node for the specialization we need. */
12150 if (type
== NULL_TREE
)
12152 if (is_typedef_decl (t
))
12153 type
= DECL_ORIGINAL_TYPE (t
);
12155 type
= TREE_TYPE (t
);
12157 && VAR_HAD_UNKNOWN_BOUND (t
)
12158 && type
!= error_mark_node
)
12159 type
= strip_array_domain (type
);
12160 type
= tsubst (type
, args
, complain
, in_decl
);
12164 /* Even if the original location is out of scope, the
12165 newly substituted one is not. */
12166 DECL_DEAD_FOR_LOCAL (r
) = 0;
12167 DECL_INITIALIZED_P (r
) = 0;
12168 DECL_TEMPLATE_INSTANTIATED (r
) = 0;
12169 if (type
== error_mark_node
)
12170 RETURN (error_mark_node
);
12171 if (TREE_CODE (type
) == FUNCTION_TYPE
)
12173 /* It may seem that this case cannot occur, since:
12178 declares a function, not a variable. However:
12181 template <typename T> void g() { T t; }
12182 template void g<f>();
12184 is an attempt to declare a variable with function
12186 error ("variable %qD has function type",
12187 /* R is not yet sufficiently initialized, so we
12188 just use its name. */
12190 RETURN (error_mark_node
);
12192 type
= complete_type (type
);
12193 /* Wait until cp_finish_decl to set this again, to handle
12194 circular dependency (template/instantiate6.C). */
12195 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r
) = 0;
12196 type
= check_var_type (DECL_NAME (r
), type
);
12198 if (DECL_HAS_VALUE_EXPR_P (t
))
12200 tree ve
= DECL_VALUE_EXPR (t
);
12201 ve
= tsubst_expr (ve
, args
, complain
, in_decl
,
12202 /*constant_expression_p=*/false);
12203 if (REFERENCE_REF_P (ve
))
12205 gcc_assert (TREE_CODE (type
) == REFERENCE_TYPE
);
12206 ve
= TREE_OPERAND (ve
, 0);
12208 SET_DECL_VALUE_EXPR (r
, ve
);
12210 if (CP_DECL_THREAD_LOCAL_P (r
)
12211 && !processing_template_decl
)
12212 set_decl_tls_model (r
, decl_default_tls_model (r
));
12214 else if (DECL_SELF_REFERENCE_P (t
))
12215 SET_DECL_SELF_REFERENCE_P (r
);
12216 TREE_TYPE (r
) = type
;
12217 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
12218 DECL_CONTEXT (r
) = ctx
;
12219 /* Clear out the mangled name and RTL for the instantiation. */
12220 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
12221 if (CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_DECL_WRTL
))
12222 SET_DECL_RTL (r
, NULL
);
12223 /* The initializer must not be expanded until it is required;
12224 see [temp.inst]. */
12225 DECL_INITIAL (r
) = NULL_TREE
;
12226 if (CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_DECL_WRTL
))
12227 SET_DECL_RTL (r
, NULL
);
12228 DECL_SIZE (r
) = DECL_SIZE_UNIT (r
) = 0;
12231 /* Possibly limit visibility based on template args. */
12232 DECL_VISIBILITY (r
) = VISIBILITY_DEFAULT
;
12233 if (DECL_VISIBILITY_SPECIFIED (t
))
12235 DECL_VISIBILITY_SPECIFIED (r
) = 0;
12236 DECL_ATTRIBUTES (r
)
12237 = remove_attribute ("visibility", DECL_ATTRIBUTES (r
));
12239 determine_visibility (r
);
12244 /* A static data member declaration is always marked
12245 external when it is declared in-class, even if an
12246 initializer is present. We mimic the non-template
12247 processing here. */
12248 DECL_EXTERNAL (r
) = 1;
12249 if (DECL_NAMESPACE_SCOPE_P (t
))
12250 DECL_NOT_REALLY_EXTERN (r
) = 1;
12252 DECL_TEMPLATE_INFO (r
) = build_template_info (tmpl
, argvec
);
12253 SET_DECL_IMPLICIT_INSTANTIATION (r
);
12254 register_specialization (r
, gen_tmpl
, argvec
, false, hash
);
12256 else if (!cp_unevaluated_operand
)
12257 register_local_specialization (r
, t
);
12259 DECL_CHAIN (r
) = NULL_TREE
;
12261 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
),
12263 args
, complain
, in_decl
);
12265 /* Preserve a typedef that names a type. */
12266 if (is_typedef_decl (r
))
12268 DECL_ORIGINAL_TYPE (r
) = NULL_TREE
;
12269 set_underlying_type (r
);
12270 if (TYPE_DECL_ALIAS_P (r
) && type
!= error_mark_node
)
12271 /* An alias template specialization can be dependent
12272 even if its underlying type is not. */
12273 TYPE_DEPENDENT_P_VALID (TREE_TYPE (r
)) = false;
12276 layout_decl (r
, 0);
12281 gcc_unreachable ();
12286 /* Restore the file and line information. */
12287 input_location
= saved_loc
;
12292 /* Substitute into the ARG_TYPES of a function type.
12293 If END is a TREE_CHAIN, leave it and any following types
12297 tsubst_arg_types (tree arg_types
,
12300 tsubst_flags_t complain
,
12303 tree remaining_arg_types
;
12304 tree type
= NULL_TREE
;
12306 tree expanded_args
= NULL_TREE
;
12309 if (!arg_types
|| arg_types
== void_list_node
|| arg_types
== end
)
12312 remaining_arg_types
= tsubst_arg_types (TREE_CHAIN (arg_types
),
12313 args
, end
, complain
, in_decl
);
12314 if (remaining_arg_types
== error_mark_node
)
12315 return error_mark_node
;
12317 if (PACK_EXPANSION_P (TREE_VALUE (arg_types
)))
12319 /* For a pack expansion, perform substitution on the
12320 entire expression. Later on, we'll handle the arguments
12322 expanded_args
= tsubst_pack_expansion (TREE_VALUE (arg_types
),
12323 args
, complain
, in_decl
);
12325 if (TREE_CODE (expanded_args
) == TREE_VEC
)
12326 /* So that we'll spin through the parameters, one by one. */
12327 i
= TREE_VEC_LENGTH (expanded_args
);
12330 /* We only partially substituted into the parameter
12331 pack. Our type is TYPE_PACK_EXPANSION. */
12332 type
= expanded_args
;
12333 expanded_args
= NULL_TREE
;
12341 type
= TREE_VEC_ELT (expanded_args
, i
);
12343 type
= tsubst (TREE_VALUE (arg_types
), args
, complain
, in_decl
);
12345 if (type
== error_mark_node
)
12346 return error_mark_node
;
12347 if (VOID_TYPE_P (type
))
12349 if (complain
& tf_error
)
12351 error ("invalid parameter type %qT", type
);
12353 error ("in declaration %q+D", in_decl
);
12355 return error_mark_node
;
12358 if (abstract_virtuals_error_sfinae (ACU_PARM
, type
, complain
))
12359 return error_mark_node
;
12361 /* Do array-to-pointer, function-to-pointer conversion, and ignore
12362 top-level qualifiers as required. */
12363 type
= cv_unqualified (type_decays_to (type
));
12365 /* We do not substitute into default arguments here. The standard
12366 mandates that they be instantiated only when needed, which is
12367 done in build_over_call. */
12368 default_arg
= TREE_PURPOSE (arg_types
);
12370 if (default_arg
&& TREE_CODE (default_arg
) == DEFAULT_ARG
)
12372 /* We've instantiated a template before its default arguments
12373 have been parsed. This can happen for a nested template
12374 class, and is not an error unless we require the default
12375 argument in a call of this function. */
12376 remaining_arg_types
=
12377 tree_cons (default_arg
, type
, remaining_arg_types
);
12378 vec_safe_push (DEFARG_INSTANTIATIONS(default_arg
), remaining_arg_types
);
12381 remaining_arg_types
=
12382 hash_tree_cons (default_arg
, type
, remaining_arg_types
);
12385 return remaining_arg_types
;
12388 /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does
12389 *not* handle the exception-specification for FNTYPE, because the
12390 initial substitution of explicitly provided template parameters
12391 during argument deduction forbids substitution into the
12392 exception-specification:
12396 All references in the function type of the function template to the
12397 corresponding template parameters are replaced by the specified tem-
12398 plate argument values. If a substitution in a template parameter or
12399 in the function type of the function template results in an invalid
12400 type, type deduction fails. [Note: The equivalent substitution in
12401 exception specifications is done only when the function is instanti-
12402 ated, at which point a program is ill-formed if the substitution
12403 results in an invalid type.] */
12406 tsubst_function_type (tree t
,
12408 tsubst_flags_t complain
,
12412 tree arg_types
= NULL_TREE
;
12415 /* The TYPE_CONTEXT is not used for function/method types. */
12416 gcc_assert (TYPE_CONTEXT (t
) == NULL_TREE
);
12418 /* DR 1227: Mixing immediate and non-immediate contexts in deduction
12420 bool late_return_type_p
= TYPE_HAS_LATE_RETURN_TYPE (t
);
12422 if (late_return_type_p
)
12424 /* Substitute the argument types. */
12425 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
, NULL_TREE
,
12426 complain
, in_decl
);
12427 if (arg_types
== error_mark_node
)
12428 return error_mark_node
;
12430 tree save_ccp
= current_class_ptr
;
12431 tree save_ccr
= current_class_ref
;
12432 tree this_type
= (TREE_CODE (t
) == METHOD_TYPE
12433 ? TREE_TYPE (TREE_VALUE (arg_types
)) : NULL_TREE
);
12434 bool do_inject
= this_type
&& CLASS_TYPE_P (this_type
);
12437 /* DR 1207: 'this' is in scope in the trailing return type. */
12438 inject_this_parameter (this_type
, cp_type_quals (this_type
));
12441 /* Substitute the return type. */
12442 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12446 current_class_ptr
= save_ccp
;
12447 current_class_ref
= save_ccr
;
12451 /* Substitute the return type. */
12452 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12454 if (return_type
== error_mark_node
)
12455 return error_mark_node
;
12456 /* DR 486 clarifies that creation of a function type with an
12457 invalid return type is a deduction failure. */
12458 if (TREE_CODE (return_type
) == ARRAY_TYPE
12459 || TREE_CODE (return_type
) == FUNCTION_TYPE
)
12461 if (complain
& tf_error
)
12463 if (TREE_CODE (return_type
) == ARRAY_TYPE
)
12464 error ("function returning an array");
12466 error ("function returning a function");
12468 return error_mark_node
;
12471 if (abstract_virtuals_error_sfinae (ACU_RETURN
, return_type
, complain
))
12472 return error_mark_node
;
12474 if (!late_return_type_p
)
12476 /* Substitute the argument types. */
12477 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
, NULL_TREE
,
12478 complain
, in_decl
);
12479 if (arg_types
== error_mark_node
)
12480 return error_mark_node
;
12483 /* Construct a new type node and return it. */
12484 if (TREE_CODE (t
) == FUNCTION_TYPE
)
12486 fntype
= build_function_type (return_type
, arg_types
);
12487 fntype
= apply_memfn_quals (fntype
,
12488 type_memfn_quals (t
),
12489 type_memfn_rqual (t
));
12493 tree r
= TREE_TYPE (TREE_VALUE (arg_types
));
12494 /* Don't pick up extra function qualifiers from the basetype. */
12495 r
= cp_build_qualified_type_real (r
, type_memfn_quals (t
), complain
);
12496 if (! MAYBE_CLASS_TYPE_P (r
))
12500 Type deduction may fail for any of the following
12503 -- Attempting to create "pointer to member of T" when T
12504 is not a class type. */
12505 if (complain
& tf_error
)
12506 error ("creating pointer to member function of non-class type %qT",
12508 return error_mark_node
;
12511 fntype
= build_method_type_directly (r
, return_type
,
12512 TREE_CHAIN (arg_types
));
12513 fntype
= build_ref_qualified_type (fntype
, type_memfn_rqual (t
));
12515 fntype
= cp_build_type_attribute_variant (fntype
, TYPE_ATTRIBUTES (t
));
12517 if (late_return_type_p
)
12518 TYPE_HAS_LATE_RETURN_TYPE (fntype
) = 1;
12523 /* FNTYPE is a FUNCTION_TYPE or METHOD_TYPE. Substitute the template
12524 ARGS into that specification, and return the substituted
12525 specification. If there is no specification, return NULL_TREE. */
12528 tsubst_exception_specification (tree fntype
,
12530 tsubst_flags_t complain
,
12537 specs
= TYPE_RAISES_EXCEPTIONS (fntype
);
12538 new_specs
= NULL_TREE
;
12539 if (specs
&& TREE_PURPOSE (specs
))
12541 /* A noexcept-specifier. */
12542 tree expr
= TREE_PURPOSE (specs
);
12543 if (TREE_CODE (expr
) == INTEGER_CST
)
12547 /* Defer instantiation of noexcept-specifiers to avoid
12548 excessive instantiations (c++/49107). */
12549 new_specs
= make_node (DEFERRED_NOEXCEPT
);
12550 if (DEFERRED_NOEXCEPT_SPEC_P (specs
))
12552 /* We already partially instantiated this member template,
12553 so combine the new args with the old. */
12554 DEFERRED_NOEXCEPT_PATTERN (new_specs
)
12555 = DEFERRED_NOEXCEPT_PATTERN (expr
);
12556 DEFERRED_NOEXCEPT_ARGS (new_specs
)
12557 = add_to_template_args (DEFERRED_NOEXCEPT_ARGS (expr
), args
);
12561 DEFERRED_NOEXCEPT_PATTERN (new_specs
) = expr
;
12562 DEFERRED_NOEXCEPT_ARGS (new_specs
) = args
;
12566 new_specs
= tsubst_copy_and_build
12567 (expr
, args
, complain
, in_decl
, /*function_p=*/false,
12568 /*integral_constant_expression_p=*/true);
12569 new_specs
= build_noexcept_spec (new_specs
, complain
);
12573 if (! TREE_VALUE (specs
))
12580 tree expanded_specs
= NULL_TREE
;
12582 if (PACK_EXPANSION_P (TREE_VALUE (specs
)))
12584 /* Expand the pack expansion type. */
12585 expanded_specs
= tsubst_pack_expansion (TREE_VALUE (specs
),
12589 if (expanded_specs
== error_mark_node
)
12590 return error_mark_node
;
12591 else if (TREE_CODE (expanded_specs
) == TREE_VEC
)
12592 len
= TREE_VEC_LENGTH (expanded_specs
);
12595 /* We're substituting into a member template, so
12596 we got a TYPE_PACK_EXPANSION back. Add that
12597 expansion and move on. */
12598 gcc_assert (TREE_CODE (expanded_specs
)
12599 == TYPE_PACK_EXPANSION
);
12600 new_specs
= add_exception_specifier (new_specs
,
12603 specs
= TREE_CHAIN (specs
);
12608 for (i
= 0; i
< len
; ++i
)
12610 if (expanded_specs
)
12611 spec
= TREE_VEC_ELT (expanded_specs
, i
);
12613 spec
= tsubst (TREE_VALUE (specs
), args
, complain
, in_decl
);
12614 if (spec
== error_mark_node
)
12616 new_specs
= add_exception_specifier (new_specs
, spec
,
12620 specs
= TREE_CHAIN (specs
);
12626 /* Take the tree structure T and replace template parameters used
12627 therein with the argument vector ARGS. IN_DECL is an associated
12628 decl for diagnostics. If an error occurs, returns ERROR_MARK_NODE.
12629 Issue error and warning messages under control of COMPLAIN. Note
12630 that we must be relatively non-tolerant of extensions here, in
12631 order to preserve conformance; if we allow substitutions that
12632 should not be allowed, we may allow argument deductions that should
12633 not succeed, and therefore report ambiguous overload situations
12634 where there are none. In theory, we could allow the substitution,
12635 but indicate that it should have failed, and allow our caller to
12636 make sure that the right thing happens, but we don't try to do this
12639 This function is used for dealing with types, decls and the like;
12640 for expressions, use tsubst_expr or tsubst_copy. */
12643 tsubst (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
12645 enum tree_code code
;
12646 tree type
, r
= NULL_TREE
;
12648 if (t
== NULL_TREE
|| t
== error_mark_node
12649 || t
== integer_type_node
12650 || t
== void_type_node
12651 || t
== char_type_node
12652 || t
== unknown_type_node
12653 || TREE_CODE (t
) == NAMESPACE_DECL
12654 || TREE_CODE (t
) == TRANSLATION_UNIT_DECL
)
12658 return tsubst_decl (t
, args
, complain
);
12660 if (args
== NULL_TREE
)
12663 code
= TREE_CODE (t
);
12665 if (code
== IDENTIFIER_NODE
)
12666 type
= IDENTIFIER_TYPE_VALUE (t
);
12668 type
= TREE_TYPE (t
);
12670 gcc_assert (type
!= unknown_type_node
);
12672 /* Reuse typedefs. We need to do this to handle dependent attributes,
12673 such as attribute aligned. */
12675 && typedef_variant_p (t
))
12677 tree decl
= TYPE_NAME (t
);
12679 if (alias_template_specialization_p (t
))
12681 /* DECL represents an alias template and we want to
12683 tree tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
12684 tree gen_args
= tsubst (DECL_TI_ARGS (decl
), args
, complain
, in_decl
);
12685 r
= instantiate_alias_template (tmpl
, gen_args
, complain
);
12687 else if (DECL_CLASS_SCOPE_P (decl
)
12688 && CLASSTYPE_TEMPLATE_INFO (DECL_CONTEXT (decl
))
12689 && uses_template_parms (DECL_CONTEXT (decl
)))
12691 tree tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
12692 tree gen_args
= tsubst (DECL_TI_ARGS (decl
), args
, complain
, in_decl
);
12693 r
= retrieve_specialization (tmpl
, gen_args
, 0);
12695 else if (DECL_FUNCTION_SCOPE_P (decl
)
12696 && DECL_TEMPLATE_INFO (DECL_CONTEXT (decl
))
12697 && uses_template_parms (DECL_TI_ARGS (DECL_CONTEXT (decl
))))
12698 r
= retrieve_local_specialization (decl
);
12700 /* The typedef is from a non-template context. */
12706 r
= cp_build_qualified_type_real
12707 (r
, cp_type_quals (t
) | cp_type_quals (r
),
12708 complain
| tf_ignore_bad_quals
);
12713 /* We don't have an instantiation yet, so drop the typedef. */
12714 int quals
= cp_type_quals (t
);
12715 t
= DECL_ORIGINAL_TYPE (decl
);
12716 t
= cp_build_qualified_type_real (t
, quals
,
12717 complain
| tf_ignore_bad_quals
);
12722 && code
!= TYPENAME_TYPE
12723 && code
!= TEMPLATE_TYPE_PARM
12724 && code
!= IDENTIFIER_NODE
12725 && code
!= FUNCTION_TYPE
12726 && code
!= METHOD_TYPE
)
12727 type
= tsubst (type
, args
, complain
, in_decl
);
12728 if (type
== error_mark_node
)
12729 return error_mark_node
;
12735 case ENUMERAL_TYPE
:
12736 return tsubst_aggr_type (t
, args
, complain
, in_decl
,
12737 /*entering_scope=*/0);
12740 case IDENTIFIER_NODE
:
12751 if (t
== integer_type_node
)
12754 if (TREE_CODE (TYPE_MIN_VALUE (t
)) == INTEGER_CST
12755 && TREE_CODE (TYPE_MAX_VALUE (t
)) == INTEGER_CST
)
12759 tree max
, omax
= TREE_OPERAND (TYPE_MAX_VALUE (t
), 0);
12761 max
= tsubst_expr (omax
, args
, complain
, in_decl
,
12762 /*integral_constant_expression_p=*/false);
12764 /* Fix up type of the magic NOP_EXPR with TREE_SIDE_EFFECTS if
12766 if (TREE_CODE (max
) == NOP_EXPR
12767 && TREE_SIDE_EFFECTS (omax
)
12768 && !TREE_TYPE (max
))
12769 TREE_TYPE (max
) = TREE_TYPE (TREE_OPERAND (max
, 0));
12771 /* If we're in a partial instantiation, preserve the magic NOP_EXPR
12772 with TREE_SIDE_EFFECTS that indicates this is not an integral
12773 constant expression. */
12774 if (processing_template_decl
12775 && TREE_SIDE_EFFECTS (omax
) && TREE_CODE (omax
) == NOP_EXPR
)
12777 gcc_assert (TREE_CODE (max
) == NOP_EXPR
);
12778 TREE_SIDE_EFFECTS (max
) = 1;
12781 return compute_array_index_type (NULL_TREE
, max
, complain
);
12784 case TEMPLATE_TYPE_PARM
:
12785 case TEMPLATE_TEMPLATE_PARM
:
12786 case BOUND_TEMPLATE_TEMPLATE_PARM
:
12787 case TEMPLATE_PARM_INDEX
:
12792 tree arg
= NULL_TREE
;
12794 /* Early in template argument deduction substitution, we don't
12795 want to reduce the level of 'auto', or it will be confused
12796 with a normal template parm in subsequent deduction. */
12797 if (is_auto (t
) && (complain
& tf_partial
))
12802 gcc_assert (TREE_VEC_LENGTH (args
) > 0);
12803 template_parm_level_and_index (t
, &level
, &idx
);
12805 levels
= TMPL_ARGS_DEPTH (args
);
12806 if (level
<= levels
12807 && TREE_VEC_LENGTH (TMPL_ARGS_LEVEL (args
, level
)) > 0)
12809 arg
= TMPL_ARG (args
, level
, idx
);
12811 if (arg
&& TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
12813 /* See through ARGUMENT_PACK_SELECT arguments. */
12814 arg
= ARGUMENT_PACK_SELECT_ARG (arg
);
12815 /* If the selected argument is an expansion E, that most
12816 likely means we were called from
12817 gen_elem_of_pack_expansion_instantiation during the
12818 substituting of pack an argument pack (which Ith
12819 element is a pack expansion, where I is
12820 ARGUMENT_PACK_SELECT_INDEX) into a pack expansion.
12821 In this case, the Ith element resulting from this
12822 substituting is going to be a pack expansion, which
12823 pattern is the pattern of E. Let's return the
12825 gen_elem_of_pack_expansion_instantiation will
12826 build the resulting pack expansion from it. */
12827 if (PACK_EXPANSION_P (arg
))
12829 /* Make sure we aren't throwing away arg info. */
12830 gcc_assert (!PACK_EXPANSION_EXTRA_ARGS (arg
));
12831 arg
= PACK_EXPANSION_PATTERN (arg
);
12836 if (arg
== error_mark_node
)
12837 return error_mark_node
;
12838 else if (arg
!= NULL_TREE
)
12840 if (ARGUMENT_PACK_P (arg
))
12841 /* If ARG is an argument pack, we don't actually want to
12842 perform a substitution here, because substitutions
12843 for argument packs are only done
12844 element-by-element. We can get to this point when
12845 substituting the type of a non-type template
12846 parameter pack, when that type actually contains
12847 template parameter packs from an outer template, e.g.,
12849 template<typename... Types> struct A {
12850 template<Types... Values> struct B { };
12854 if (code
== TEMPLATE_TYPE_PARM
)
12857 gcc_assert (TYPE_P (arg
));
12859 quals
= cp_type_quals (arg
) | cp_type_quals (t
);
12861 return cp_build_qualified_type_real
12862 (arg
, quals
, complain
| tf_ignore_bad_quals
);
12864 else if (code
== BOUND_TEMPLATE_TEMPLATE_PARM
)
12866 /* We are processing a type constructed from a
12867 template template parameter. */
12868 tree argvec
= tsubst (TYPE_TI_ARGS (t
),
12869 args
, complain
, in_decl
);
12870 if (argvec
== error_mark_node
)
12871 return error_mark_node
;
12873 gcc_assert (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
12874 || TREE_CODE (arg
) == TEMPLATE_DECL
12875 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
);
12877 if (TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
)
12878 /* Consider this code:
12880 template <template <class> class Template>
12882 template <class Arg> using Bind = Template<Arg>;
12885 template <template <class> class Template, class Arg>
12886 using Instantiate = Template<Arg>; //#0
12888 template <template <class> class Template,
12891 Instantiate<Internal<Template>::template Bind,
12894 When #1 is parsed, the
12895 BOUND_TEMPLATE_TEMPLATE_PARM representing the
12896 parameter `Template' in #0 matches the
12897 UNBOUND_CLASS_TEMPLATE representing the argument
12898 `Internal<Template>::template Bind'; We then want
12899 to assemble the type `Bind<Argument>' that can't
12900 be fully created right now, because
12901 `Internal<Template>' not being complete, the Bind
12902 template cannot be looked up in that context. So
12903 we need to "store" `Bind<Argument>' for later
12904 when the context of Bind becomes complete. Let's
12905 store that in a TYPENAME_TYPE. */
12906 return make_typename_type (TYPE_CONTEXT (arg
),
12907 build_nt (TEMPLATE_ID_EXPR
,
12908 TYPE_IDENTIFIER (arg
),
12913 /* We can get a TEMPLATE_TEMPLATE_PARM here when we
12914 are resolving nested-types in the signature of a
12915 member function templates. Otherwise ARG is a
12916 TEMPLATE_DECL and is the real template to be
12918 if (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
12919 arg
= TYPE_NAME (arg
);
12921 r
= lookup_template_class (arg
,
12923 DECL_CONTEXT (arg
),
12924 /*entering_scope=*/0,
12926 return cp_build_qualified_type_real
12927 (r
, cp_type_quals (t
) | cp_type_quals (r
), complain
);
12930 /* TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX. */
12931 return convert_from_reference (unshare_expr (arg
));
12935 /* This can happen during the attempted tsubst'ing in
12936 unify. This means that we don't yet have any information
12937 about the template parameter in question. */
12940 /* If we get here, we must have been looking at a parm for a
12941 more deeply nested template. Make a new version of this
12942 template parameter, but with a lower level. */
12945 case TEMPLATE_TYPE_PARM
:
12946 case TEMPLATE_TEMPLATE_PARM
:
12947 case BOUND_TEMPLATE_TEMPLATE_PARM
:
12948 if (cp_type_quals (t
))
12950 r
= tsubst (TYPE_MAIN_VARIANT (t
), args
, complain
, in_decl
);
12951 r
= cp_build_qualified_type_real
12952 (r
, cp_type_quals (t
),
12953 complain
| (code
== TEMPLATE_TYPE_PARM
12954 ? tf_ignore_bad_quals
: 0));
12956 else if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
12957 && PLACEHOLDER_TYPE_CONSTRAINTS (t
)
12958 && (r
= (TEMPLATE_PARM_DESCENDANTS
12959 (TEMPLATE_TYPE_PARM_INDEX (t
))))
12960 && (r
= TREE_TYPE (r
))
12961 && !PLACEHOLDER_TYPE_CONSTRAINTS (r
))
12962 /* Break infinite recursion when substituting the constraints
12963 of a constrained placeholder. */;
12967 TEMPLATE_TYPE_PARM_INDEX (r
)
12968 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (t
),
12969 r
, levels
, args
, complain
);
12970 TYPE_STUB_DECL (r
) = TYPE_NAME (r
) = TEMPLATE_TYPE_DECL (r
);
12971 TYPE_MAIN_VARIANT (r
) = r
;
12972 TYPE_POINTER_TO (r
) = NULL_TREE
;
12973 TYPE_REFERENCE_TO (r
) = NULL_TREE
;
12975 if (TREE_CODE (r
) == TEMPLATE_TEMPLATE_PARM
)
12976 /* We have reduced the level of the template
12977 template parameter, but not the levels of its
12978 template parameters, so canonical_type_parameter
12979 will not be able to find the canonical template
12980 template parameter for this level. Thus, we
12981 require structural equality checking to compare
12982 TEMPLATE_TEMPLATE_PARMs. */
12983 SET_TYPE_STRUCTURAL_EQUALITY (r
);
12984 else if (TYPE_STRUCTURAL_EQUALITY_P (t
))
12985 SET_TYPE_STRUCTURAL_EQUALITY (r
);
12987 TYPE_CANONICAL (r
) = canonical_type_parameter (r
);
12989 /* Propagate constraints on placeholders. */
12990 if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
12991 if (tree constr
= PLACEHOLDER_TYPE_CONSTRAINTS (t
))
12992 PLACEHOLDER_TYPE_CONSTRAINTS (r
)
12993 = tsubst_constraint (constr
, args
, complain
, in_decl
);
12995 if (code
== BOUND_TEMPLATE_TEMPLATE_PARM
)
12997 tree argvec
= tsubst (TYPE_TI_ARGS (t
), args
,
12998 complain
, in_decl
);
12999 if (argvec
== error_mark_node
)
13000 return error_mark_node
;
13002 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (r
)
13003 = build_template_info (TYPE_TI_TEMPLATE (t
), argvec
);
13008 case TEMPLATE_PARM_INDEX
:
13009 r
= reduce_template_parm_level (t
, type
, levels
, args
, complain
);
13013 gcc_unreachable ();
13021 tree purpose
, value
, chain
;
13023 if (t
== void_list_node
)
13026 purpose
= TREE_PURPOSE (t
);
13029 purpose
= tsubst (purpose
, args
, complain
, in_decl
);
13030 if (purpose
== error_mark_node
)
13031 return error_mark_node
;
13033 value
= TREE_VALUE (t
);
13036 value
= tsubst (value
, args
, complain
, in_decl
);
13037 if (value
== error_mark_node
)
13038 return error_mark_node
;
13040 chain
= TREE_CHAIN (t
);
13041 if (chain
&& chain
!= void_type_node
)
13043 chain
= tsubst (chain
, args
, complain
, in_decl
);
13044 if (chain
== error_mark_node
)
13045 return error_mark_node
;
13047 if (purpose
== TREE_PURPOSE (t
)
13048 && value
== TREE_VALUE (t
)
13049 && chain
== TREE_CHAIN (t
))
13051 return hash_tree_cons (purpose
, value
, chain
);
13055 /* We should never be tsubsting a binfo. */
13056 gcc_unreachable ();
13059 /* A vector of template arguments. */
13060 gcc_assert (!type
);
13061 return tsubst_template_args (t
, args
, complain
, in_decl
);
13064 case REFERENCE_TYPE
:
13066 if (type
== TREE_TYPE (t
) && TREE_CODE (type
) != METHOD_TYPE
)
13071 Type deduction may fail for any of the following
13074 -- Attempting to create a pointer to reference type.
13075 -- Attempting to create a reference to a reference type or
13076 a reference to void.
13078 Core issue 106 says that creating a reference to a reference
13079 during instantiation is no longer a cause for failure. We
13080 only enforce this check in strict C++98 mode. */
13081 if ((TREE_CODE (type
) == REFERENCE_TYPE
13082 && (((cxx_dialect
== cxx98
) && flag_iso
) || code
!= REFERENCE_TYPE
))
13083 || (code
== REFERENCE_TYPE
&& VOID_TYPE_P (type
)))
13085 static location_t last_loc
;
13087 /* We keep track of the last time we issued this error
13088 message to avoid spewing a ton of messages during a
13089 single bad template instantiation. */
13090 if (complain
& tf_error
13091 && last_loc
!= input_location
)
13093 if (VOID_TYPE_P (type
))
13094 error ("forming reference to void");
13095 else if (code
== POINTER_TYPE
)
13096 error ("forming pointer to reference type %qT", type
);
13098 error ("forming reference to reference type %qT", type
);
13099 last_loc
= input_location
;
13102 return error_mark_node
;
13104 else if (TREE_CODE (type
) == FUNCTION_TYPE
13105 && (type_memfn_quals (type
) != TYPE_UNQUALIFIED
13106 || type_memfn_rqual (type
) != REF_QUAL_NONE
))
13108 if (complain
& tf_error
)
13110 if (code
== POINTER_TYPE
)
13111 error ("forming pointer to qualified function type %qT",
13114 error ("forming reference to qualified function type %qT",
13117 return error_mark_node
;
13119 else if (code
== POINTER_TYPE
)
13121 r
= build_pointer_type (type
);
13122 if (TREE_CODE (type
) == METHOD_TYPE
)
13123 r
= build_ptrmemfunc_type (r
);
13125 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
13126 /* In C++0x, during template argument substitution, when there is an
13127 attempt to create a reference to a reference type, reference
13128 collapsing is applied as described in [14.3.1/4 temp.arg.type]:
13130 "If a template-argument for a template-parameter T names a type
13131 that is a reference to a type A, an attempt to create the type
13132 'lvalue reference to cv T' creates the type 'lvalue reference to
13133 A,' while an attempt to create the type type rvalue reference to
13134 cv T' creates the type T"
13136 r
= cp_build_reference_type
13138 TYPE_REF_IS_RVALUE (t
) && TYPE_REF_IS_RVALUE (type
));
13140 r
= cp_build_reference_type (type
, TYPE_REF_IS_RVALUE (t
));
13141 r
= cp_build_qualified_type_real (r
, cp_type_quals (t
), complain
);
13143 if (r
!= error_mark_node
)
13144 /* Will this ever be needed for TYPE_..._TO values? */
13151 r
= tsubst (TYPE_OFFSET_BASETYPE (t
), args
, complain
, in_decl
);
13152 if (r
== error_mark_node
|| !MAYBE_CLASS_TYPE_P (r
))
13156 Type deduction may fail for any of the following
13159 -- Attempting to create "pointer to member of T" when T
13160 is not a class type. */
13161 if (complain
& tf_error
)
13162 error ("creating pointer to member of non-class type %qT", r
);
13163 return error_mark_node
;
13165 if (TREE_CODE (type
) == REFERENCE_TYPE
)
13167 if (complain
& tf_error
)
13168 error ("creating pointer to member reference type %qT", type
);
13169 return error_mark_node
;
13171 if (VOID_TYPE_P (type
))
13173 if (complain
& tf_error
)
13174 error ("creating pointer to member of type void");
13175 return error_mark_node
;
13177 gcc_assert (TREE_CODE (type
) != METHOD_TYPE
);
13178 if (TREE_CODE (type
) == FUNCTION_TYPE
)
13180 /* The type of the implicit object parameter gets its
13181 cv-qualifiers from the FUNCTION_TYPE. */
13184 = build_memfn_type (type
, r
, type_memfn_quals (type
),
13185 type_memfn_rqual (type
));
13186 memptr
= build_ptrmemfunc_type (build_pointer_type (method_type
));
13187 return cp_build_qualified_type_real (memptr
, cp_type_quals (t
),
13191 return cp_build_qualified_type_real (build_ptrmem_type (r
, type
),
13195 case FUNCTION_TYPE
:
13200 fntype
= tsubst_function_type (t
, args
, complain
, in_decl
);
13201 if (fntype
== error_mark_node
)
13202 return error_mark_node
;
13204 /* Substitute the exception specification. */
13205 specs
= tsubst_exception_specification (t
, args
, complain
,
13206 in_decl
, /*defer_ok*/true);
13207 if (specs
== error_mark_node
)
13208 return error_mark_node
;
13210 fntype
= build_exception_variant (fntype
, specs
);
13215 tree domain
= tsubst (TYPE_DOMAIN (t
), args
, complain
, in_decl
);
13216 if (domain
== error_mark_node
)
13217 return error_mark_node
;
13219 /* As an optimization, we avoid regenerating the array type if
13220 it will obviously be the same as T. */
13221 if (type
== TREE_TYPE (t
) && domain
== TYPE_DOMAIN (t
))
13224 /* These checks should match the ones in create_array_type_for_decl.
13228 The deduction may fail for any of the following reasons:
13230 -- Attempting to create an array with an element type that
13231 is void, a function type, or a reference type, or [DR337]
13232 an abstract class type. */
13233 if (VOID_TYPE_P (type
)
13234 || TREE_CODE (type
) == FUNCTION_TYPE
13235 || (TREE_CODE (type
) == ARRAY_TYPE
13236 && TYPE_DOMAIN (type
) == NULL_TREE
)
13237 || TREE_CODE (type
) == REFERENCE_TYPE
)
13239 if (complain
& tf_error
)
13240 error ("creating array of %qT", type
);
13241 return error_mark_node
;
13244 if (abstract_virtuals_error_sfinae (ACU_ARRAY
, type
, complain
))
13245 return error_mark_node
;
13247 r
= build_cplus_array_type (type
, domain
);
13249 if (TYPE_USER_ALIGN (t
))
13251 TYPE_ALIGN (r
) = TYPE_ALIGN (t
);
13252 TYPE_USER_ALIGN (r
) = 1;
13258 case TYPENAME_TYPE
:
13260 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
13261 in_decl
, /*entering_scope=*/1);
13262 tree f
= tsubst_copy (TYPENAME_TYPE_FULLNAME (t
), args
,
13263 complain
, in_decl
);
13265 if (ctx
== error_mark_node
|| f
== error_mark_node
)
13266 return error_mark_node
;
13268 if (!MAYBE_CLASS_TYPE_P (ctx
))
13270 if (complain
& tf_error
)
13271 error ("%qT is not a class, struct, or union type", ctx
);
13272 return error_mark_node
;
13274 else if (!uses_template_parms (ctx
) && !TYPE_BEING_DEFINED (ctx
))
13276 /* Normally, make_typename_type does not require that the CTX
13277 have complete type in order to allow things like:
13279 template <class T> struct S { typename S<T>::X Y; };
13281 But, such constructs have already been resolved by this
13282 point, so here CTX really should have complete type, unless
13283 it's a partial instantiation. */
13284 ctx
= complete_type (ctx
);
13285 if (!COMPLETE_TYPE_P (ctx
))
13287 if (complain
& tf_error
)
13288 cxx_incomplete_type_error (NULL_TREE
, ctx
);
13289 return error_mark_node
;
13293 f
= make_typename_type (ctx
, f
, typename_type
,
13294 complain
| tf_keep_type_decl
);
13295 if (f
== error_mark_node
)
13297 if (TREE_CODE (f
) == TYPE_DECL
)
13299 complain
|= tf_ignore_bad_quals
;
13303 if (TREE_CODE (f
) != TYPENAME_TYPE
)
13305 if (TYPENAME_IS_ENUM_P (t
) && TREE_CODE (f
) != ENUMERAL_TYPE
)
13307 if (complain
& tf_error
)
13308 error ("%qT resolves to %qT, which is not an enumeration type",
13311 return error_mark_node
;
13313 else if (TYPENAME_IS_CLASS_P (t
) && !CLASS_TYPE_P (f
))
13315 if (complain
& tf_error
)
13316 error ("%qT resolves to %qT, which is is not a class type",
13319 return error_mark_node
;
13323 return cp_build_qualified_type_real
13324 (f
, cp_type_quals (f
) | cp_type_quals (t
), complain
);
13327 case UNBOUND_CLASS_TEMPLATE
:
13329 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
13330 in_decl
, /*entering_scope=*/1);
13331 tree name
= TYPE_IDENTIFIER (t
);
13332 tree parm_list
= DECL_TEMPLATE_PARMS (TYPE_NAME (t
));
13334 if (ctx
== error_mark_node
|| name
== error_mark_node
)
13335 return error_mark_node
;
13338 parm_list
= tsubst_template_parms (parm_list
, args
, complain
);
13339 return make_unbound_class_template (ctx
, name
, parm_list
, complain
);
13346 ++cp_unevaluated_operand
;
13347 ++c_inhibit_evaluation_warnings
;
13349 type
= tsubst_expr (TYPEOF_TYPE_EXPR (t
), args
,
13351 /*integral_constant_expression_p=*/false);
13353 --cp_unevaluated_operand
;
13354 --c_inhibit_evaluation_warnings
;
13356 type
= finish_typeof (type
);
13357 return cp_build_qualified_type_real (type
,
13359 | cp_type_quals (type
),
13363 case DECLTYPE_TYPE
:
13367 ++cp_unevaluated_operand
;
13368 ++c_inhibit_evaluation_warnings
;
13370 type
= tsubst_copy_and_build (DECLTYPE_TYPE_EXPR (t
), args
,
13371 complain
|tf_decltype
, in_decl
,
13372 /*function_p*/false,
13373 /*integral_constant_expression*/false);
13375 --cp_unevaluated_operand
;
13376 --c_inhibit_evaluation_warnings
;
13378 if (DECLTYPE_FOR_LAMBDA_CAPTURE (t
))
13379 type
= lambda_capture_field_type (type
,
13380 DECLTYPE_FOR_INIT_CAPTURE (t
));
13381 else if (DECLTYPE_FOR_LAMBDA_PROXY (t
))
13382 type
= lambda_proxy_type (type
);
13385 bool id
= DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t
);
13386 if (id
&& TREE_CODE (DECLTYPE_TYPE_EXPR (t
)) == BIT_NOT_EXPR
13388 /* In a template ~id could be either a complement expression
13389 or an unqualified-id naming a destructor; if instantiating
13390 it produces an expression, it's not an id-expression or
13393 type
= finish_decltype_type (type
, id
, complain
);
13395 return cp_build_qualified_type_real (type
,
13397 | cp_type_quals (type
),
13398 complain
| tf_ignore_bad_quals
);
13401 case UNDERLYING_TYPE
:
13403 tree type
= tsubst (UNDERLYING_TYPE_TYPE (t
), args
,
13404 complain
, in_decl
);
13405 return finish_underlying_type (type
);
13408 case TYPE_ARGUMENT_PACK
:
13409 case NONTYPE_ARGUMENT_PACK
:
13411 tree r
= TYPE_P (t
) ? cxx_make_type (code
) : make_node (code
);
13413 tsubst_template_args (ARGUMENT_PACK_ARGS (t
),
13417 SET_ARGUMENT_PACK_ARGS (r
, packed_out
);
13419 /* For template nontype argument packs, also substitute into
13421 if (code
== NONTYPE_ARGUMENT_PACK
)
13422 TREE_TYPE (r
) = tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13441 /* We should use one of the expression tsubsts for these codes. */
13442 gcc_unreachable ();
13445 sorry ("use of %qs in template", get_tree_code_name (code
));
13446 return error_mark_node
;
13450 /* Like tsubst_expr for a BASELINK. OBJECT_TYPE, if non-NULL, is the
13451 type of the expression on the left-hand side of the "." or "->"
13455 tsubst_baselink (tree baselink
, tree object_type
,
13456 tree args
, tsubst_flags_t complain
, tree in_decl
)
13459 tree qualifying_scope
;
13462 tree template_args
= 0;
13463 bool template_id_p
= false;
13464 bool qualified
= BASELINK_QUALIFIED_P (baselink
);
13466 /* A baselink indicates a function from a base class. Both the
13467 BASELINK_ACCESS_BINFO and the base class referenced may
13468 indicate bases of the template class, rather than the
13469 instantiated class. In addition, lookups that were not
13470 ambiguous before may be ambiguous now. Therefore, we perform
13471 the lookup again. */
13472 qualifying_scope
= BINFO_TYPE (BASELINK_ACCESS_BINFO (baselink
));
13473 qualifying_scope
= tsubst (qualifying_scope
, args
,
13474 complain
, in_decl
);
13475 fns
= BASELINK_FUNCTIONS (baselink
);
13476 optype
= tsubst (BASELINK_OPTYPE (baselink
), args
, complain
, in_decl
);
13477 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
13479 template_id_p
= true;
13480 template_args
= TREE_OPERAND (fns
, 1);
13481 fns
= TREE_OPERAND (fns
, 0);
13483 template_args
= tsubst_template_args (template_args
, args
,
13484 complain
, in_decl
);
13486 name
= DECL_NAME (get_first_fn (fns
));
13487 if (IDENTIFIER_TYPENAME_P (name
))
13488 name
= mangle_conv_op_name_for_type (optype
);
13489 baselink
= lookup_fnfields (qualifying_scope
, name
, /*protect=*/1);
13491 return error_mark_node
;
13493 /* If lookup found a single function, mark it as used at this
13494 point. (If it lookup found multiple functions the one selected
13495 later by overload resolution will be marked as used at that
13497 if (BASELINK_P (baselink
))
13498 fns
= BASELINK_FUNCTIONS (baselink
);
13499 if (!template_id_p
&& !really_overloaded_fn (fns
)
13500 && !mark_used (OVL_CURRENT (fns
), complain
) && !(complain
& tf_error
))
13501 return error_mark_node
;
13503 /* Add back the template arguments, if present. */
13504 if (BASELINK_P (baselink
) && template_id_p
)
13505 BASELINK_FUNCTIONS (baselink
)
13506 = build_nt (TEMPLATE_ID_EXPR
,
13507 BASELINK_FUNCTIONS (baselink
),
13509 /* Update the conversion operator type. */
13510 BASELINK_OPTYPE (baselink
) = optype
;
13513 object_type
= current_class_type
;
13516 baselink
= adjust_result_of_qualified_name_lookup (baselink
,
13522 /* Like tsubst_expr for a SCOPE_REF, given by QUALIFIED_ID. DONE is
13523 true if the qualified-id will be a postfix-expression in-and-of
13524 itself; false if more of the postfix-expression follows the
13525 QUALIFIED_ID. ADDRESS_P is true if the qualified-id is the operand
13529 tsubst_qualified_id (tree qualified_id
, tree args
,
13530 tsubst_flags_t complain
, tree in_decl
,
13531 bool done
, bool address_p
)
13537 tree template_args
;
13538 location_t loc
= UNKNOWN_LOCATION
;
13540 gcc_assert (TREE_CODE (qualified_id
) == SCOPE_REF
);
13542 /* Figure out what name to look up. */
13543 name
= TREE_OPERAND (qualified_id
, 1);
13544 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
13546 is_template
= true;
13547 loc
= EXPR_LOCATION (name
);
13548 template_args
= TREE_OPERAND (name
, 1);
13550 template_args
= tsubst_template_args (template_args
, args
,
13551 complain
, in_decl
);
13552 name
= TREE_OPERAND (name
, 0);
13556 is_template
= false;
13557 template_args
= NULL_TREE
;
13560 /* Substitute into the qualifying scope. When there are no ARGS, we
13561 are just trying to simplify a non-dependent expression. In that
13562 case the qualifying scope may be dependent, and, in any case,
13563 substituting will not help. */
13564 scope
= TREE_OPERAND (qualified_id
, 0);
13567 scope
= tsubst (scope
, args
, complain
, in_decl
);
13568 expr
= tsubst_copy (name
, args
, complain
, in_decl
);
13573 if (dependent_scope_p (scope
))
13576 expr
= build_min_nt_loc (loc
, TEMPLATE_ID_EXPR
, expr
, template_args
);
13577 return build_qualified_name (NULL_TREE
, scope
, expr
,
13578 QUALIFIED_NAME_IS_TEMPLATE (qualified_id
));
13581 if (!BASELINK_P (name
) && !DECL_P (expr
))
13583 if (TREE_CODE (expr
) == BIT_NOT_EXPR
)
13585 /* A BIT_NOT_EXPR is used to represent a destructor. */
13586 if (!check_dtor_name (scope
, TREE_OPERAND (expr
, 0)))
13588 error ("qualifying type %qT does not match destructor name ~%qT",
13589 scope
, TREE_OPERAND (expr
, 0));
13590 expr
= error_mark_node
;
13593 expr
= lookup_qualified_name (scope
, complete_dtor_identifier
,
13594 /*is_type_p=*/0, false);
13597 expr
= lookup_qualified_name (scope
, expr
, /*is_type_p=*/0, false);
13598 if (TREE_CODE (TREE_CODE (expr
) == TEMPLATE_DECL
13599 ? DECL_TEMPLATE_RESULT (expr
) : expr
) == TYPE_DECL
)
13601 if (complain
& tf_error
)
13603 error ("dependent-name %qE is parsed as a non-type, but "
13604 "instantiation yields a type", qualified_id
);
13605 inform (input_location
, "say %<typename %E%> if a type is meant", qualified_id
);
13607 return error_mark_node
;
13613 check_accessibility_of_qualified_id (expr
, /*object_type=*/NULL_TREE
,
13615 /* Remember that there was a reference to this entity. */
13616 if (!mark_used (expr
, complain
) && !(complain
& tf_error
))
13617 return error_mark_node
;
13620 if (expr
== error_mark_node
|| TREE_CODE (expr
) == TREE_LIST
)
13622 if (complain
& tf_error
)
13623 qualified_name_lookup_error (scope
,
13624 TREE_OPERAND (qualified_id
, 1),
13625 expr
, input_location
);
13626 return error_mark_node
;
13630 expr
= lookup_template_function (expr
, template_args
);
13632 if (expr
== error_mark_node
&& complain
& tf_error
)
13633 qualified_name_lookup_error (scope
, TREE_OPERAND (qualified_id
, 1),
13634 expr
, input_location
);
13635 else if (TYPE_P (scope
))
13637 expr
= (adjust_result_of_qualified_name_lookup
13638 (expr
, scope
, current_nonlambda_class_type ()));
13639 expr
= (finish_qualified_id_expr
13640 (scope
, expr
, done
, address_p
&& PTRMEM_OK_P (qualified_id
),
13641 QUALIFIED_NAME_IS_TEMPLATE (qualified_id
),
13642 /*template_arg_p=*/false, complain
));
13645 /* Expressions do not generally have reference type. */
13646 if (TREE_CODE (expr
) != SCOPE_REF
13647 /* However, if we're about to form a pointer-to-member, we just
13648 want the referenced member referenced. */
13649 && TREE_CODE (expr
) != OFFSET_REF
)
13650 expr
= convert_from_reference (expr
);
13655 /* tsubst the initializer for a VAR_DECL. INIT is the unsubstituted
13656 initializer, DECL is the substituted VAR_DECL. Other arguments are as
13660 tsubst_init (tree init
, tree decl
, tree args
,
13661 tsubst_flags_t complain
, tree in_decl
)
13666 init
= tsubst_expr (init
, args
, complain
, in_decl
, false);
13670 /* If we had an initializer but it
13671 instantiated to nothing,
13672 value-initialize the object. This will
13673 only occur when the initializer was a
13674 pack expansion where the parameter packs
13675 used in that expansion were of length
13677 init
= build_value_init (TREE_TYPE (decl
),
13679 if (TREE_CODE (init
) == AGGR_INIT_EXPR
)
13680 init
= get_target_expr_sfinae (init
, complain
);
13686 /* Like tsubst, but deals with expressions. This function just replaces
13687 template parms; to finish processing the resultant expression, use
13688 tsubst_copy_and_build or tsubst_expr. */
13691 tsubst_copy (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
13693 enum tree_code code
;
13696 if (t
== NULL_TREE
|| t
== error_mark_node
|| args
== NULL_TREE
)
13699 code
= TREE_CODE (t
);
13704 r
= retrieve_local_specialization (t
);
13706 if (r
== NULL_TREE
)
13708 /* We get here for a use of 'this' in an NSDMI. */
13709 if (DECL_NAME (t
) == this_identifier
13710 && current_function_decl
13711 && DECL_CONSTRUCTOR_P (current_function_decl
))
13712 return current_class_ptr
;
13714 /* This can happen for a parameter name used later in a function
13715 declaration (such as in a late-specified return type). Just
13716 make a dummy decl, since it's only used for its type. */
13717 gcc_assert (cp_unevaluated_operand
!= 0);
13718 r
= tsubst_decl (t
, args
, complain
);
13719 /* Give it the template pattern as its context; its true context
13720 hasn't been instantiated yet and this is good enough for
13722 DECL_CONTEXT (r
) = DECL_CONTEXT (t
);
13725 if (TREE_CODE (r
) == ARGUMENT_PACK_SELECT
)
13726 r
= ARGUMENT_PACK_SELECT_ARG (r
);
13727 if (!mark_used (r
, complain
) && !(complain
& tf_error
))
13728 return error_mark_node
;
13736 if (DECL_TEMPLATE_PARM_P (t
))
13737 return tsubst_copy (DECL_INITIAL (t
), args
, complain
, in_decl
);
13738 /* There is no need to substitute into namespace-scope
13740 if (DECL_NAMESPACE_SCOPE_P (t
))
13742 /* If ARGS is NULL, then T is known to be non-dependent. */
13743 if (args
== NULL_TREE
)
13744 return scalar_constant_value (t
);
13746 /* Unfortunately, we cannot just call lookup_name here.
13749 template <int I> int f() {
13751 struct S { void g() { E e = a; } };
13754 When we instantiate f<7>::S::g(), say, lookup_name is not
13755 clever enough to find f<7>::a. */
13757 = tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
13758 /*entering_scope=*/0);
13760 for (v
= TYPE_VALUES (enum_type
);
13762 v
= TREE_CHAIN (v
))
13763 if (TREE_PURPOSE (v
) == DECL_NAME (t
))
13764 return TREE_VALUE (v
);
13766 /* We didn't find the name. That should never happen; if
13767 name-lookup found it during preliminary parsing, we
13768 should find it again here during instantiation. */
13769 gcc_unreachable ();
13774 if (PACK_EXPANSION_P (TREE_TYPE (t
)))
13776 /* Check for a local specialization set up by
13777 tsubst_pack_expansion. */
13778 if (tree r
= retrieve_local_specialization (t
))
13780 if (TREE_CODE (r
) == ARGUMENT_PACK_SELECT
)
13781 r
= ARGUMENT_PACK_SELECT_ARG (r
);
13785 /* When retrieving a capture pack from a generic lambda, remove the
13786 lambda call op's own template argument list from ARGS. Only the
13787 template arguments active for the closure type should be used to
13788 retrieve the pack specialization. */
13789 if (LAMBDA_FUNCTION_P (current_function_decl
)
13790 && (template_class_depth (DECL_CONTEXT (t
))
13791 != TMPL_ARGS_DEPTH (args
)))
13792 args
= strip_innermost_template_args (args
, 1);
13794 /* Otherwise return the full NONTYPE_ARGUMENT_PACK that
13795 tsubst_decl put in the hash table. */
13796 return retrieve_specialization (t
, args
, 0);
13799 if (DECL_CONTEXT (t
))
13803 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
13804 /*entering_scope=*/1);
13805 if (ctx
!= DECL_CONTEXT (t
))
13807 tree r
= lookup_field (ctx
, DECL_NAME (t
), 0, false);
13810 if (complain
& tf_error
)
13811 error ("using invalid field %qD", t
);
13812 return error_mark_node
;
13821 case FUNCTION_DECL
:
13822 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
))
13823 r
= tsubst (t
, args
, complain
, in_decl
);
13824 else if (local_variable_p (t
))
13826 r
= retrieve_local_specialization (t
);
13827 if (r
== NULL_TREE
)
13829 /* First try name lookup to find the instantiation. */
13830 r
= lookup_name (DECL_NAME (t
));
13833 /* Make sure that the one we found is the one we want. */
13834 tree ctx
= DECL_CONTEXT (t
);
13835 if (DECL_LANG_SPECIFIC (ctx
) && DECL_TEMPLATE_INFO (ctx
))
13836 ctx
= tsubst (ctx
, args
, complain
, in_decl
);
13837 if (ctx
!= DECL_CONTEXT (r
))
13845 /* This can happen for a variable used in a
13846 late-specified return type of a local lambda, or for a
13847 local static or constant. Building a new VAR_DECL
13848 should be OK in all those cases. */
13849 r
= tsubst_decl (t
, args
, complain
);
13850 if (decl_maybe_constant_var_p (r
))
13852 /* We can't call cp_finish_decl, so handle the
13853 initializer by hand. */
13854 tree init
= tsubst_init (DECL_INITIAL (t
), r
, args
,
13855 complain
, in_decl
);
13856 if (!processing_template_decl
)
13857 init
= maybe_constant_init (init
);
13858 if (processing_template_decl
13859 ? potential_constant_expression (init
)
13860 : reduced_constant_expression_p (init
))
13861 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r
)
13862 = TREE_CONSTANT (r
) = true;
13863 DECL_INITIAL (r
) = init
;
13865 gcc_assert (cp_unevaluated_operand
|| TREE_STATIC (r
)
13866 || decl_constant_var_p (r
)
13867 || errorcount
|| sorrycount
);
13868 if (!processing_template_decl
)
13870 if (TREE_STATIC (r
))
13871 rest_of_decl_compilation (r
, toplevel_bindings_p (),
13874 r
= process_outer_var_ref (r
, complain
);
13877 /* Remember this for subsequent uses. */
13878 if (local_specializations
)
13879 register_local_specialization (r
, t
);
13884 if (!mark_used (r
, complain
) && !(complain
& tf_error
))
13885 return error_mark_node
;
13888 case NAMESPACE_DECL
:
13892 /* An OVERLOAD will always be a non-dependent overload set; an
13893 overload set from function scope will just be represented with an
13894 IDENTIFIER_NODE, and from class scope with a BASELINK. */
13895 gcc_assert (!uses_template_parms (t
));
13899 return tsubst_baselink (t
, current_nonlambda_class_type (),
13900 args
, complain
, in_decl
);
13902 case TEMPLATE_DECL
:
13903 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
13904 return tsubst (TREE_TYPE (DECL_TEMPLATE_RESULT (t
)),
13905 args
, complain
, in_decl
);
13906 else if (DECL_FUNCTION_TEMPLATE_P (t
) && DECL_MEMBER_TEMPLATE_P (t
))
13907 return tsubst (t
, args
, complain
, in_decl
);
13908 else if (DECL_CLASS_SCOPE_P (t
)
13909 && uses_template_parms (DECL_CONTEXT (t
)))
13911 /* Template template argument like the following example need
13914 template <template <class> class TT> struct C {};
13915 template <class T> struct D {
13916 template <class U> struct E {};
13921 We are processing the template argument `E' in #1 for
13922 the template instantiation #2. Originally, `E' is a
13923 TEMPLATE_DECL with `D<T>' as its DECL_CONTEXT. Now we
13924 have to substitute this with one having context `D<int>'. */
13926 tree context
= tsubst (DECL_CONTEXT (t
), args
, complain
, in_decl
);
13927 return lookup_field (context
, DECL_NAME(t
), 0, false);
13930 /* Ordinary template template argument. */
13934 case REINTERPRET_CAST_EXPR
:
13935 case CONST_CAST_EXPR
:
13936 case STATIC_CAST_EXPR
:
13937 case DYNAMIC_CAST_EXPR
:
13938 case IMPLICIT_CONV_EXPR
:
13942 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13943 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13944 return build1 (code
, type
, op0
);
13948 if (PACK_EXPANSION_P (TREE_OPERAND (t
, 0)))
13951 tree expanded
, op
= TREE_OPERAND (t
, 0);
13954 if (SIZEOF_EXPR_TYPE_P (t
))
13955 op
= TREE_TYPE (op
);
13957 ++cp_unevaluated_operand
;
13958 ++c_inhibit_evaluation_warnings
;
13959 /* We only want to compute the number of arguments. */
13960 expanded
= tsubst_pack_expansion (op
, args
, complain
, in_decl
);
13961 --cp_unevaluated_operand
;
13962 --c_inhibit_evaluation_warnings
;
13964 if (TREE_CODE (expanded
) == TREE_VEC
)
13965 len
= TREE_VEC_LENGTH (expanded
);
13967 if (expanded
== error_mark_node
)
13968 return error_mark_node
;
13969 else if (PACK_EXPANSION_P (expanded
)
13970 || (TREE_CODE (expanded
) == TREE_VEC
13972 && PACK_EXPANSION_P (TREE_VEC_ELT (expanded
, len
-1))))
13974 if (TREE_CODE (expanded
) == TREE_VEC
)
13975 expanded
= TREE_VEC_ELT (expanded
, len
- 1);
13977 if (TYPE_P (expanded
))
13978 return cxx_sizeof_or_alignof_type (expanded
, SIZEOF_EXPR
,
13979 complain
& tf_error
);
13981 return cxx_sizeof_or_alignof_expr (expanded
, SIZEOF_EXPR
,
13982 complain
& tf_error
);
13985 return build_int_cst (size_type_node
, len
);
13987 if (SIZEOF_EXPR_TYPE_P (t
))
13989 r
= tsubst (TREE_TYPE (TREE_OPERAND (t
, 0)),
13990 args
, complain
, in_decl
);
13991 r
= build1 (NOP_EXPR
, r
, error_mark_node
);
13992 r
= build1 (SIZEOF_EXPR
,
13993 tsubst (TREE_TYPE (t
), args
, complain
, in_decl
), r
);
13994 SIZEOF_EXPR_TYPE_P (r
) = 1;
14001 case TRUTH_NOT_EXPR
:
14004 case UNARY_PLUS_EXPR
: /* Unary + */
14006 case AT_ENCODE_EXPR
:
14010 case REALPART_EXPR
:
14011 case IMAGPART_EXPR
:
14014 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14015 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14016 return build1 (code
, type
, op0
);
14019 case COMPONENT_REF
:
14024 object
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14025 name
= TREE_OPERAND (t
, 1);
14026 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
14028 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
14029 complain
, in_decl
);
14030 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
14032 else if (TREE_CODE (name
) == SCOPE_REF
14033 && TREE_CODE (TREE_OPERAND (name
, 1)) == BIT_NOT_EXPR
)
14035 tree base
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
14036 complain
, in_decl
);
14037 name
= TREE_OPERAND (name
, 1);
14038 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
14039 complain
, in_decl
);
14040 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
14041 name
= build_qualified_name (/*type=*/NULL_TREE
,
14043 /*template_p=*/false);
14045 else if (BASELINK_P (name
))
14046 name
= tsubst_baselink (name
,
14047 non_reference (TREE_TYPE (object
)),
14051 name
= tsubst_copy (name
, args
, complain
, in_decl
);
14052 return build_nt (COMPONENT_REF
, object
, name
, NULL_TREE
);
14058 case TRUNC_DIV_EXPR
:
14059 case CEIL_DIV_EXPR
:
14060 case FLOOR_DIV_EXPR
:
14061 case ROUND_DIV_EXPR
:
14062 case EXACT_DIV_EXPR
:
14066 case TRUNC_MOD_EXPR
:
14067 case FLOOR_MOD_EXPR
:
14068 case TRUTH_ANDIF_EXPR
:
14069 case TRUTH_ORIF_EXPR
:
14070 case TRUTH_AND_EXPR
:
14071 case TRUTH_OR_EXPR
:
14084 case COMPOUND_EXPR
:
14087 case PREDECREMENT_EXPR
:
14088 case PREINCREMENT_EXPR
:
14089 case POSTDECREMENT_EXPR
:
14090 case POSTINCREMENT_EXPR
:
14092 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14093 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14094 return build_nt (code
, op0
, op1
);
14099 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14100 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14101 return build_qualified_name (/*type=*/NULL_TREE
, op0
, op1
,
14102 QUALIFIED_NAME_IS_TEMPLATE (t
));
14107 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14108 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14109 return build_nt (ARRAY_REF
, op0
, op1
, NULL_TREE
, NULL_TREE
);
14114 int n
= VL_EXP_OPERAND_LENGTH (t
);
14115 tree result
= build_vl_exp (CALL_EXPR
, n
);
14117 for (i
= 0; i
< n
; i
++)
14118 TREE_OPERAND (t
, i
) = tsubst_copy (TREE_OPERAND (t
, i
), args
,
14119 complain
, in_decl
);
14125 case PSEUDO_DTOR_EXPR
:
14126 case VEC_PERM_EXPR
:
14128 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14129 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14130 tree op2
= tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
14131 r
= build_nt (code
, op0
, op1
, op2
);
14132 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
14138 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14139 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14140 tree op2
= tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
14141 r
= build_nt (code
, op0
, op1
, op2
);
14142 NEW_EXPR_USE_GLOBAL (r
) = NEW_EXPR_USE_GLOBAL (t
);
14148 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14149 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14150 r
= build_nt (code
, op0
, op1
);
14151 DELETE_EXPR_USE_GLOBAL (r
) = DELETE_EXPR_USE_GLOBAL (t
);
14152 DELETE_EXPR_USE_VEC (r
) = DELETE_EXPR_USE_VEC (t
);
14156 case TEMPLATE_ID_EXPR
:
14158 /* Substituted template arguments */
14159 tree fn
= TREE_OPERAND (t
, 0);
14160 tree targs
= TREE_OPERAND (t
, 1);
14162 fn
= tsubst_copy (fn
, args
, complain
, in_decl
);
14164 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
14166 return lookup_template_function (fn
, targs
);
14171 tree purpose
, value
, chain
;
14173 if (t
== void_list_node
)
14176 purpose
= TREE_PURPOSE (t
);
14178 purpose
= tsubst_copy (purpose
, args
, complain
, in_decl
);
14179 value
= TREE_VALUE (t
);
14181 value
= tsubst_copy (value
, args
, complain
, in_decl
);
14182 chain
= TREE_CHAIN (t
);
14183 if (chain
&& chain
!= void_type_node
)
14184 chain
= tsubst_copy (chain
, args
, complain
, in_decl
);
14185 if (purpose
== TREE_PURPOSE (t
)
14186 && value
== TREE_VALUE (t
)
14187 && chain
== TREE_CHAIN (t
))
14189 return tree_cons (purpose
, value
, chain
);
14194 case ENUMERAL_TYPE
:
14196 case TEMPLATE_TYPE_PARM
:
14197 case TEMPLATE_TEMPLATE_PARM
:
14198 case BOUND_TEMPLATE_TEMPLATE_PARM
:
14199 case TEMPLATE_PARM_INDEX
:
14201 case REFERENCE_TYPE
:
14203 case FUNCTION_TYPE
:
14206 case TYPENAME_TYPE
:
14207 case UNBOUND_CLASS_TEMPLATE
:
14209 case DECLTYPE_TYPE
:
14211 return tsubst (t
, args
, complain
, in_decl
);
14215 /* Fall through. */
14216 case IDENTIFIER_NODE
:
14217 if (IDENTIFIER_TYPENAME_P (t
))
14219 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14220 return mangle_conv_op_name_for_type (new_type
);
14226 /* This is handled by tsubst_copy_and_build. */
14227 gcc_unreachable ();
14231 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14232 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14233 return build_x_va_arg (EXPR_LOCATION (t
), op0
, type
);
14236 case CLEANUP_POINT_EXPR
:
14237 /* We shouldn't have built any of these during initial template
14238 generation. Instead, they should be built during instantiation
14239 in response to the saved STMT_IS_FULL_EXPR_P setting. */
14240 gcc_unreachable ();
14244 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14245 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14246 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14247 r
= build2 (code
, type
, op0
, op1
);
14248 PTRMEM_OK_P (r
) = PTRMEM_OK_P (t
);
14249 if (!mark_used (TREE_OPERAND (r
, 1), complain
)
14250 && !(complain
& tf_error
))
14251 return error_mark_node
;
14255 case EXPR_PACK_EXPANSION
:
14256 error ("invalid use of pack expansion expression");
14257 return error_mark_node
;
14259 case NONTYPE_ARGUMENT_PACK
:
14260 error ("use %<...%> to expand argument pack");
14261 return error_mark_node
;
14264 gcc_checking_assert (t
== void_node
&& VOID_TYPE_P (TREE_TYPE (t
)));
14272 /* Instantiate any typedefs in the type. */
14273 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14274 r
= fold_convert (type
, t
);
14275 gcc_assert (TREE_CODE (r
) == code
);
14280 /* These can sometimes show up in a partial instantiation, but never
14281 involve template parms. */
14282 gcc_assert (!uses_template_parms (t
));
14285 case UNARY_LEFT_FOLD_EXPR
:
14286 return tsubst_unary_left_fold (t
, args
, complain
, in_decl
);
14287 case UNARY_RIGHT_FOLD_EXPR
:
14288 return tsubst_unary_right_fold (t
, args
, complain
, in_decl
);
14289 case BINARY_LEFT_FOLD_EXPR
:
14290 return tsubst_binary_left_fold (t
, args
, complain
, in_decl
);
14291 case BINARY_RIGHT_FOLD_EXPR
:
14292 return tsubst_binary_right_fold (t
, args
, complain
, in_decl
);
14295 /* We shouldn't get here, but keep going if !ENABLE_CHECKING. */
14296 gcc_checking_assert (false);
14301 /* Helper function for tsubst_omp_clauses, used for instantiation of
14302 OMP_CLAUSE_DECL of clauses. */
14305 tsubst_omp_clause_decl (tree decl
, tree args
, tsubst_flags_t complain
,
14308 if (decl
== NULL_TREE
)
14311 /* Handle an OpenMP array section represented as a TREE_LIST (or
14312 OMP_CLAUSE_DEPEND_KIND). An OMP_CLAUSE_DEPEND (with a depend
14313 kind of OMP_CLAUSE_DEPEND_SINK) can also be represented as a
14314 TREE_LIST. We can handle it exactly the same as an array section
14315 (purpose, value, and a chain), even though the nomenclature
14316 (low_bound, length, etc) is different. */
14317 if (TREE_CODE (decl
) == TREE_LIST
)
14320 = tsubst_expr (TREE_PURPOSE (decl
), args
, complain
, in_decl
,
14321 /*integral_constant_expression_p=*/false);
14322 tree length
= tsubst_expr (TREE_VALUE (decl
), args
, complain
, in_decl
,
14323 /*integral_constant_expression_p=*/false);
14324 tree chain
= tsubst_omp_clause_decl (TREE_CHAIN (decl
), args
, complain
,
14326 if (TREE_PURPOSE (decl
) == low_bound
14327 && TREE_VALUE (decl
) == length
14328 && TREE_CHAIN (decl
) == chain
)
14330 tree ret
= tree_cons (low_bound
, length
, chain
);
14331 OMP_CLAUSE_DEPEND_SINK_NEGATIVE (ret
)
14332 = OMP_CLAUSE_DEPEND_SINK_NEGATIVE (decl
);
14335 tree ret
= tsubst_expr (decl
, args
, complain
, in_decl
,
14336 /*integral_constant_expression_p=*/false);
14337 /* Undo convert_from_reference tsubst_expr could have called. */
14339 && REFERENCE_REF_P (ret
)
14340 && !REFERENCE_REF_P (decl
))
14341 ret
= TREE_OPERAND (ret
, 0);
14345 /* Like tsubst_copy, but specifically for OpenMP clauses. */
14348 tsubst_omp_clauses (tree clauses
, bool declare_simd
, bool allow_fields
,
14349 tree args
, tsubst_flags_t complain
, tree in_decl
)
14351 tree new_clauses
= NULL_TREE
, nc
, oc
;
14352 tree linear_no_step
= NULL_TREE
;
14354 for (oc
= clauses
; oc
; oc
= OMP_CLAUSE_CHAIN (oc
))
14356 nc
= copy_node (oc
);
14357 OMP_CLAUSE_CHAIN (nc
) = new_clauses
;
14360 switch (OMP_CLAUSE_CODE (nc
))
14362 case OMP_CLAUSE_LASTPRIVATE
:
14363 if (OMP_CLAUSE_LASTPRIVATE_STMT (oc
))
14365 OMP_CLAUSE_LASTPRIVATE_STMT (nc
) = push_stmt_list ();
14366 tsubst_expr (OMP_CLAUSE_LASTPRIVATE_STMT (oc
), args
, complain
,
14367 in_decl
, /*integral_constant_expression_p=*/false);
14368 OMP_CLAUSE_LASTPRIVATE_STMT (nc
)
14369 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (nc
));
14372 case OMP_CLAUSE_PRIVATE
:
14373 case OMP_CLAUSE_SHARED
:
14374 case OMP_CLAUSE_FIRSTPRIVATE
:
14375 case OMP_CLAUSE_COPYIN
:
14376 case OMP_CLAUSE_COPYPRIVATE
:
14377 case OMP_CLAUSE_UNIFORM
:
14378 case OMP_CLAUSE_DEPEND
:
14379 case OMP_CLAUSE_FROM
:
14380 case OMP_CLAUSE_TO
:
14381 case OMP_CLAUSE_MAP
:
14382 case OMP_CLAUSE_USE_DEVICE_PTR
:
14383 case OMP_CLAUSE_IS_DEVICE_PTR
:
14384 OMP_CLAUSE_DECL (nc
)
14385 = tsubst_omp_clause_decl (OMP_CLAUSE_DECL (oc
), args
, complain
,
14388 case OMP_CLAUSE_IF
:
14389 case OMP_CLAUSE_NUM_THREADS
:
14390 case OMP_CLAUSE_SCHEDULE
:
14391 case OMP_CLAUSE_COLLAPSE
:
14392 case OMP_CLAUSE_FINAL
:
14393 case OMP_CLAUSE_DEVICE
:
14394 case OMP_CLAUSE_DIST_SCHEDULE
:
14395 case OMP_CLAUSE_NUM_TEAMS
:
14396 case OMP_CLAUSE_THREAD_LIMIT
:
14397 case OMP_CLAUSE_SAFELEN
:
14398 case OMP_CLAUSE_SIMDLEN
:
14399 case OMP_CLAUSE_NUM_TASKS
:
14400 case OMP_CLAUSE_GRAINSIZE
:
14401 case OMP_CLAUSE_PRIORITY
:
14402 case OMP_CLAUSE_ORDERED
:
14403 case OMP_CLAUSE_HINT
:
14404 OMP_CLAUSE_OPERAND (nc
, 0)
14405 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 0), args
, complain
,
14406 in_decl
, /*integral_constant_expression_p=*/false);
14408 case OMP_CLAUSE_REDUCTION
:
14409 if (OMP_CLAUSE_REDUCTION_PLACEHOLDER (oc
))
14411 tree placeholder
= OMP_CLAUSE_REDUCTION_PLACEHOLDER (oc
);
14412 if (TREE_CODE (placeholder
) == SCOPE_REF
)
14414 tree scope
= tsubst (TREE_OPERAND (placeholder
, 0), args
,
14415 complain
, in_decl
);
14416 OMP_CLAUSE_REDUCTION_PLACEHOLDER (nc
)
14417 = build_qualified_name (NULL_TREE
, scope
,
14418 TREE_OPERAND (placeholder
, 1),
14422 gcc_assert (identifier_p (placeholder
));
14424 OMP_CLAUSE_DECL (nc
)
14425 = tsubst_omp_clause_decl (OMP_CLAUSE_DECL (oc
), args
, complain
,
14428 case OMP_CLAUSE_LINEAR
:
14429 case OMP_CLAUSE_ALIGNED
:
14430 OMP_CLAUSE_DECL (nc
)
14431 = tsubst_omp_clause_decl (OMP_CLAUSE_DECL (oc
), args
, complain
,
14433 OMP_CLAUSE_OPERAND (nc
, 1)
14434 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 1), args
, complain
,
14435 in_decl
, /*integral_constant_expression_p=*/false);
14436 if (OMP_CLAUSE_CODE (oc
) == OMP_CLAUSE_LINEAR
14437 && OMP_CLAUSE_LINEAR_STEP (oc
) == NULL_TREE
)
14439 gcc_assert (!linear_no_step
);
14440 linear_no_step
= nc
;
14443 case OMP_CLAUSE_NOWAIT
:
14444 case OMP_CLAUSE_DEFAULT
:
14445 case OMP_CLAUSE_UNTIED
:
14446 case OMP_CLAUSE_MERGEABLE
:
14447 case OMP_CLAUSE_INBRANCH
:
14448 case OMP_CLAUSE_NOTINBRANCH
:
14449 case OMP_CLAUSE_PROC_BIND
:
14450 case OMP_CLAUSE_FOR
:
14451 case OMP_CLAUSE_PARALLEL
:
14452 case OMP_CLAUSE_SECTIONS
:
14453 case OMP_CLAUSE_TASKGROUP
:
14454 case OMP_CLAUSE_NOGROUP
:
14455 case OMP_CLAUSE_THREADS
:
14456 case OMP_CLAUSE_SIMD
:
14457 case OMP_CLAUSE_DEFAULTMAP
:
14460 gcc_unreachable ();
14463 switch (OMP_CLAUSE_CODE (nc
))
14465 case OMP_CLAUSE_PRIVATE
:
14466 case OMP_CLAUSE_FIRSTPRIVATE
:
14467 case OMP_CLAUSE_LASTPRIVATE
:
14468 case OMP_CLAUSE_COPYPRIVATE
:
14469 case OMP_CLAUSE_LINEAR
:
14470 case OMP_CLAUSE_REDUCTION
:
14471 case OMP_CLAUSE_USE_DEVICE_PTR
:
14472 case OMP_CLAUSE_IS_DEVICE_PTR
:
14473 /* tsubst_expr on SCOPE_REF results in returning
14474 finish_non_static_data_member result. Undo that here. */
14475 if (TREE_CODE (OMP_CLAUSE_DECL (oc
)) == SCOPE_REF
14476 && (TREE_CODE (TREE_OPERAND (OMP_CLAUSE_DECL (oc
), 1))
14477 == IDENTIFIER_NODE
))
14479 tree t
= OMP_CLAUSE_DECL (nc
);
14482 switch (TREE_CODE (v
))
14484 case COMPONENT_REF
:
14488 case POINTER_PLUS_EXPR
:
14489 v
= TREE_OPERAND (v
, 0);
14492 if (DECL_CONTEXT (v
) == current_function_decl
14493 && DECL_ARTIFICIAL (v
)
14494 && DECL_NAME (v
) == this_identifier
)
14495 OMP_CLAUSE_DECL (nc
) = TREE_OPERAND (t
, 1);
14502 else if (VAR_P (OMP_CLAUSE_DECL (oc
))
14503 && DECL_HAS_VALUE_EXPR_P (OMP_CLAUSE_DECL (oc
))
14504 && DECL_ARTIFICIAL (OMP_CLAUSE_DECL (oc
))
14505 && DECL_LANG_SPECIFIC (OMP_CLAUSE_DECL (oc
))
14506 && DECL_OMP_PRIVATIZED_MEMBER (OMP_CLAUSE_DECL (oc
)))
14508 tree decl
= OMP_CLAUSE_DECL (nc
);
14511 if (!DECL_LANG_SPECIFIC (decl
))
14512 retrofit_lang_decl (decl
);
14513 DECL_OMP_PRIVATIZED_MEMBER (decl
) = 1;
14522 new_clauses
= nreverse (new_clauses
);
14525 new_clauses
= finish_omp_clauses (new_clauses
, allow_fields
);
14526 if (linear_no_step
)
14527 for (nc
= new_clauses
; nc
; nc
= OMP_CLAUSE_CHAIN (nc
))
14528 if (nc
== linear_no_step
)
14530 OMP_CLAUSE_LINEAR_STEP (nc
) = NULL_TREE
;
14534 return new_clauses
;
14537 /* Like tsubst_copy_and_build, but unshare TREE_LIST nodes. */
14540 tsubst_copy_asm_operands (tree t
, tree args
, tsubst_flags_t complain
,
14543 #define RECUR(t) tsubst_copy_asm_operands (t, args, complain, in_decl)
14545 tree purpose
, value
, chain
;
14550 if (TREE_CODE (t
) != TREE_LIST
)
14551 return tsubst_copy_and_build (t
, args
, complain
, in_decl
,
14552 /*function_p=*/false,
14553 /*integral_constant_expression_p=*/false);
14555 if (t
== void_list_node
)
14558 purpose
= TREE_PURPOSE (t
);
14560 purpose
= RECUR (purpose
);
14561 value
= TREE_VALUE (t
);
14564 if (TREE_CODE (value
) != LABEL_DECL
)
14565 value
= RECUR (value
);
14568 value
= lookup_label (DECL_NAME (value
));
14569 gcc_assert (TREE_CODE (value
) == LABEL_DECL
);
14570 TREE_USED (value
) = 1;
14573 chain
= TREE_CHAIN (t
);
14574 if (chain
&& chain
!= void_type_node
)
14575 chain
= RECUR (chain
);
14576 return tree_cons (purpose
, value
, chain
);
14580 /* Used to temporarily communicate the list of #pragma omp parallel
14581 clauses to #pragma omp for instantiation if they are combined
14584 static tree
*omp_parallel_combined_clauses
;
14586 /* Substitute one OMP_FOR iterator. */
14589 tsubst_omp_for_iterator (tree t
, int i
, tree declv
, tree orig_declv
,
14590 tree initv
, tree condv
, tree incrv
, tree
*clauses
,
14591 tree args
, tsubst_flags_t complain
, tree in_decl
,
14592 bool integral_constant_expression_p
)
14594 #define RECUR(NODE) \
14595 tsubst_expr ((NODE), args, complain, in_decl, \
14596 integral_constant_expression_p)
14597 tree decl
, init
, cond
, incr
;
14599 init
= TREE_VEC_ELT (OMP_FOR_INIT (t
), i
);
14600 gcc_assert (TREE_CODE (init
) == MODIFY_EXPR
);
14602 if (orig_declv
&& OMP_FOR_ORIG_DECLS (t
))
14604 tree o
= TREE_VEC_ELT (OMP_FOR_ORIG_DECLS (t
), i
);
14605 TREE_VEC_ELT (orig_declv
, i
) = RECUR (o
);
14608 decl
= TREE_OPERAND (init
, 0);
14609 init
= TREE_OPERAND (init
, 1);
14610 tree decl_expr
= NULL_TREE
;
14611 if (init
&& TREE_CODE (init
) == DECL_EXPR
)
14613 /* We need to jump through some hoops to handle declarations in the
14614 for-init-statement, since we might need to handle auto deduction,
14615 but we need to keep control of initialization. */
14617 init
= DECL_INITIAL (DECL_EXPR_DECL (init
));
14618 decl
= tsubst_decl (decl
, args
, complain
);
14622 if (TREE_CODE (decl
) == SCOPE_REF
)
14624 decl
= RECUR (decl
);
14625 if (TREE_CODE (decl
) == COMPONENT_REF
)
14629 switch (TREE_CODE (v
))
14631 case COMPONENT_REF
:
14635 case POINTER_PLUS_EXPR
:
14636 v
= TREE_OPERAND (v
, 0);
14639 if (DECL_CONTEXT (v
) == current_function_decl
14640 && DECL_ARTIFICIAL (v
)
14641 && DECL_NAME (v
) == this_identifier
)
14643 decl
= TREE_OPERAND (decl
, 1);
14644 decl
= omp_privatize_field (decl
);
14654 decl
= RECUR (decl
);
14656 init
= RECUR (init
);
14658 tree auto_node
= type_uses_auto (TREE_TYPE (decl
));
14659 if (auto_node
&& init
)
14661 = do_auto_deduction (TREE_TYPE (decl
), init
, auto_node
);
14663 gcc_assert (!type_dependent_expression_p (decl
));
14665 if (!CLASS_TYPE_P (TREE_TYPE (decl
)))
14669 /* Declare the variable, but don't let that initialize it. */
14670 tree init_sav
= DECL_INITIAL (DECL_EXPR_DECL (decl_expr
));
14671 DECL_INITIAL (DECL_EXPR_DECL (decl_expr
)) = NULL_TREE
;
14673 DECL_INITIAL (DECL_EXPR_DECL (decl_expr
)) = init_sav
;
14676 cond
= RECUR (TREE_VEC_ELT (OMP_FOR_COND (t
), i
));
14677 incr
= TREE_VEC_ELT (OMP_FOR_INCR (t
), i
);
14678 if (TREE_CODE (incr
) == MODIFY_EXPR
)
14680 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
14681 tree rhs
= RECUR (TREE_OPERAND (incr
, 1));
14682 incr
= build_x_modify_expr (EXPR_LOCATION (incr
), lhs
,
14683 NOP_EXPR
, rhs
, complain
);
14686 incr
= RECUR (incr
);
14687 TREE_VEC_ELT (declv
, i
) = decl
;
14688 TREE_VEC_ELT (initv
, i
) = init
;
14689 TREE_VEC_ELT (condv
, i
) = cond
;
14690 TREE_VEC_ELT (incrv
, i
) = incr
;
14696 /* Declare and initialize the variable. */
14704 for (j
= (omp_parallel_combined_clauses
== NULL
? 1 : 0); j
< 2; j
++)
14706 for (pc
= j
? clauses
: omp_parallel_combined_clauses
; *pc
; )
14708 if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_PRIVATE
14709 && OMP_CLAUSE_DECL (*pc
) == decl
)
14711 else if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_LASTPRIVATE
14712 && OMP_CLAUSE_DECL (*pc
) == decl
)
14716 /* Move lastprivate (decl) clause to OMP_FOR_CLAUSES. */
14718 *pc
= OMP_CLAUSE_CHAIN (c
);
14719 OMP_CLAUSE_CHAIN (c
) = *clauses
;
14722 else if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_FIRSTPRIVATE
14723 && OMP_CLAUSE_DECL (*pc
) == decl
)
14725 error ("iteration variable %qD should not be firstprivate",
14727 *pc
= OMP_CLAUSE_CHAIN (*pc
);
14729 else if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_REDUCTION
14730 && OMP_CLAUSE_DECL (*pc
) == decl
)
14732 error ("iteration variable %qD should not be reduction",
14734 *pc
= OMP_CLAUSE_CHAIN (*pc
);
14737 pc
= &OMP_CLAUSE_CHAIN (*pc
);
14742 if (*pc
== NULL_TREE
)
14744 tree c
= build_omp_clause (input_location
, OMP_CLAUSE_PRIVATE
);
14745 OMP_CLAUSE_DECL (c
) = decl
;
14746 c
= finish_omp_clauses (c
, true);
14749 OMP_CLAUSE_CHAIN (c
) = *clauses
;
14754 cond
= TREE_VEC_ELT (OMP_FOR_COND (t
), i
);
14755 if (COMPARISON_CLASS_P (cond
))
14757 tree op0
= RECUR (TREE_OPERAND (cond
, 0));
14758 tree op1
= RECUR (TREE_OPERAND (cond
, 1));
14759 cond
= build2 (TREE_CODE (cond
), boolean_type_node
, op0
, op1
);
14762 cond
= RECUR (cond
);
14763 incr
= TREE_VEC_ELT (OMP_FOR_INCR (t
), i
);
14764 switch (TREE_CODE (incr
))
14766 case PREINCREMENT_EXPR
:
14767 case PREDECREMENT_EXPR
:
14768 case POSTINCREMENT_EXPR
:
14769 case POSTDECREMENT_EXPR
:
14770 incr
= build2 (TREE_CODE (incr
), TREE_TYPE (decl
),
14771 RECUR (TREE_OPERAND (incr
, 0)), NULL_TREE
);
14774 if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
14775 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
14777 tree rhs
= TREE_OPERAND (incr
, 1);
14778 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
14779 tree rhs0
= RECUR (TREE_OPERAND (rhs
, 0));
14780 tree rhs1
= RECUR (TREE_OPERAND (rhs
, 1));
14781 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
14782 build2 (TREE_CODE (rhs
), TREE_TYPE (decl
),
14786 incr
= RECUR (incr
);
14789 if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
14790 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
14792 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
14793 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
14794 build2 (TREE_CODE (TREE_OPERAND (incr
, 1)),
14795 TREE_TYPE (decl
), lhs
,
14796 RECUR (TREE_OPERAND (incr
, 2))));
14798 else if (TREE_CODE (TREE_OPERAND (incr
, 1)) == NOP_EXPR
14799 && (TREE_CODE (TREE_OPERAND (incr
, 2)) == PLUS_EXPR
14800 || (TREE_CODE (TREE_OPERAND (incr
, 2)) == MINUS_EXPR
)))
14802 tree rhs
= TREE_OPERAND (incr
, 2);
14803 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
14804 tree rhs0
= RECUR (TREE_OPERAND (rhs
, 0));
14805 tree rhs1
= RECUR (TREE_OPERAND (rhs
, 1));
14806 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
14807 build2 (TREE_CODE (rhs
), TREE_TYPE (decl
),
14811 incr
= RECUR (incr
);
14814 incr
= RECUR (incr
);
14818 TREE_VEC_ELT (declv
, i
) = decl
;
14819 TREE_VEC_ELT (initv
, i
) = init
;
14820 TREE_VEC_ELT (condv
, i
) = cond
;
14821 TREE_VEC_ELT (incrv
, i
) = incr
;
14825 /* Like tsubst_copy for expressions, etc. but also does semantic
14829 tsubst_expr (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
,
14830 bool integral_constant_expression_p
)
14832 #define RETURN(EXP) do { r = (EXP); goto out; } while(0)
14833 #define RECUR(NODE) \
14834 tsubst_expr ((NODE), args, complain, in_decl, \
14835 integral_constant_expression_p)
14841 if (t
== NULL_TREE
|| t
== error_mark_node
)
14844 loc
= input_location
;
14845 if (EXPR_HAS_LOCATION (t
))
14846 input_location
= EXPR_LOCATION (t
);
14847 if (STATEMENT_CODE_P (TREE_CODE (t
)))
14848 current_stmt_tree ()->stmts_are_full_exprs_p
= STMT_IS_FULL_EXPR_P (t
);
14850 switch (TREE_CODE (t
))
14852 case STATEMENT_LIST
:
14854 tree_stmt_iterator i
;
14855 for (i
= tsi_start (t
); !tsi_end_p (i
); tsi_next (&i
))
14856 RECUR (tsi_stmt (i
));
14860 case CTOR_INITIALIZER
:
14861 finish_mem_initializers (tsubst_initializer_list
14862 (TREE_OPERAND (t
, 0), args
));
14866 finish_return_stmt (RECUR (TREE_OPERAND (t
, 0)));
14870 tmp
= RECUR (EXPR_STMT_EXPR (t
));
14871 if (EXPR_STMT_STMT_EXPR_RESULT (t
))
14872 finish_stmt_expr_expr (tmp
, cur_stmt_expr
);
14874 finish_expr_stmt (tmp
);
14878 do_using_directive (USING_STMT_NAMESPACE (t
));
14883 tree decl
, pattern_decl
;
14886 pattern_decl
= decl
= DECL_EXPR_DECL (t
);
14887 if (TREE_CODE (decl
) == LABEL_DECL
)
14888 finish_label_decl (DECL_NAME (decl
));
14889 else if (TREE_CODE (decl
) == USING_DECL
)
14891 tree scope
= USING_DECL_SCOPE (decl
);
14892 tree name
= DECL_NAME (decl
);
14895 scope
= tsubst (scope
, args
, complain
, in_decl
);
14896 decl
= lookup_qualified_name (scope
, name
,
14897 /*is_type_p=*/false,
14898 /*complain=*/false);
14899 if (decl
== error_mark_node
|| TREE_CODE (decl
) == TREE_LIST
)
14900 qualified_name_lookup_error (scope
, name
, decl
, input_location
);
14902 do_local_using_decl (decl
, scope
, name
);
14904 else if (DECL_PACK_P (decl
))
14906 /* Don't build up decls for a variadic capture proxy, we'll
14907 instantiate the elements directly as needed. */
14912 init
= DECL_INITIAL (decl
);
14913 decl
= tsubst (decl
, args
, complain
, in_decl
);
14914 if (decl
!= error_mark_node
)
14916 /* By marking the declaration as instantiated, we avoid
14917 trying to instantiate it. Since instantiate_decl can't
14918 handle local variables, and since we've already done
14919 all that needs to be done, that's the right thing to
14922 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
14924 && ANON_AGGR_TYPE_P (TREE_TYPE (decl
)))
14925 /* Anonymous aggregates are a special case. */
14926 finish_anon_union (decl
);
14927 else if (is_capture_proxy (DECL_EXPR_DECL (t
)))
14929 DECL_CONTEXT (decl
) = current_function_decl
;
14930 if (DECL_NAME (decl
) == this_identifier
)
14932 tree lam
= DECL_CONTEXT (current_function_decl
);
14933 lam
= CLASSTYPE_LAMBDA_EXPR (lam
);
14934 LAMBDA_EXPR_THIS_CAPTURE (lam
) = decl
;
14936 insert_capture_proxy (decl
);
14938 else if (DECL_IMPLICIT_TYPEDEF_P (t
))
14939 /* We already did a pushtag. */;
14940 else if (TREE_CODE (decl
) == FUNCTION_DECL
14941 && DECL_OMP_DECLARE_REDUCTION_P (decl
)
14942 && DECL_FUNCTION_SCOPE_P (pattern_decl
))
14944 DECL_CONTEXT (decl
) = NULL_TREE
;
14946 DECL_CONTEXT (decl
) = current_function_decl
;
14947 cp_check_omp_declare_reduction (decl
);
14951 int const_init
= false;
14952 maybe_push_decl (decl
);
14954 && DECL_PRETTY_FUNCTION_P (decl
))
14956 /* For __PRETTY_FUNCTION__ we have to adjust the
14958 const char *const name
14959 = cxx_printable_name (current_function_decl
, 2);
14960 init
= cp_fname_init (name
, &TREE_TYPE (decl
));
14963 init
= tsubst_init (init
, decl
, args
, complain
, in_decl
);
14966 const_init
= (DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P
14968 cp_finish_decl (decl
, init
, const_init
, NULL_TREE
, 0);
14977 stmt
= begin_for_stmt (NULL_TREE
, NULL_TREE
);
14978 RECUR (FOR_INIT_STMT (t
));
14979 finish_for_init_stmt (stmt
);
14980 tmp
= RECUR (FOR_COND (t
));
14981 finish_for_cond (tmp
, stmt
, false);
14982 tmp
= RECUR (FOR_EXPR (t
));
14983 finish_for_expr (tmp
, stmt
);
14984 RECUR (FOR_BODY (t
));
14985 finish_for_stmt (stmt
);
14988 case RANGE_FOR_STMT
:
14991 stmt
= begin_for_stmt (NULL_TREE
, NULL_TREE
);
14992 decl
= RANGE_FOR_DECL (t
);
14993 decl
= tsubst (decl
, args
, complain
, in_decl
);
14994 maybe_push_decl (decl
);
14995 expr
= RECUR (RANGE_FOR_EXPR (t
));
14996 stmt
= cp_convert_range_for (stmt
, decl
, expr
, RANGE_FOR_IVDEP (t
));
14997 RECUR (RANGE_FOR_BODY (t
));
14998 finish_for_stmt (stmt
);
15003 stmt
= begin_while_stmt ();
15004 tmp
= RECUR (WHILE_COND (t
));
15005 finish_while_stmt_cond (tmp
, stmt
, false);
15006 RECUR (WHILE_BODY (t
));
15007 finish_while_stmt (stmt
);
15011 stmt
= begin_do_stmt ();
15012 RECUR (DO_BODY (t
));
15013 finish_do_body (stmt
);
15014 tmp
= RECUR (DO_COND (t
));
15015 finish_do_stmt (tmp
, stmt
, false);
15019 stmt
= begin_if_stmt ();
15020 tmp
= RECUR (IF_COND (t
));
15021 finish_if_stmt_cond (tmp
, stmt
);
15022 RECUR (THEN_CLAUSE (t
));
15023 finish_then_clause (stmt
);
15025 if (ELSE_CLAUSE (t
))
15027 begin_else_clause (stmt
);
15028 RECUR (ELSE_CLAUSE (t
));
15029 finish_else_clause (stmt
);
15032 finish_if_stmt (stmt
);
15036 if (BIND_EXPR_BODY_BLOCK (t
))
15037 stmt
= begin_function_body ();
15039 stmt
= begin_compound_stmt (BIND_EXPR_TRY_BLOCK (t
)
15040 ? BCS_TRY_BLOCK
: 0);
15042 RECUR (BIND_EXPR_BODY (t
));
15044 if (BIND_EXPR_BODY_BLOCK (t
))
15045 finish_function_body (stmt
);
15047 finish_compound_stmt (stmt
);
15051 finish_break_stmt ();
15054 case CONTINUE_STMT
:
15055 finish_continue_stmt ();
15059 stmt
= begin_switch_stmt ();
15060 tmp
= RECUR (SWITCH_STMT_COND (t
));
15061 finish_switch_cond (tmp
, stmt
);
15062 RECUR (SWITCH_STMT_BODY (t
));
15063 finish_switch_stmt (stmt
);
15066 case CASE_LABEL_EXPR
:
15068 tree low
= RECUR (CASE_LOW (t
));
15069 tree high
= RECUR (CASE_HIGH (t
));
15070 finish_case_label (EXPR_LOCATION (t
), low
, high
);
15076 tree decl
= LABEL_EXPR_LABEL (t
);
15079 label
= finish_label_stmt (DECL_NAME (decl
));
15080 if (DECL_ATTRIBUTES (decl
) != NULL_TREE
)
15081 cplus_decl_attributes (&label
, DECL_ATTRIBUTES (decl
), 0);
15086 tmp
= GOTO_DESTINATION (t
);
15087 if (TREE_CODE (tmp
) != LABEL_DECL
)
15088 /* Computed goto's must be tsubst'd into. On the other hand,
15089 non-computed gotos must not be; the identifier in question
15090 will have no binding. */
15093 tmp
= DECL_NAME (tmp
);
15094 finish_goto_stmt (tmp
);
15099 tree string
= RECUR (ASM_STRING (t
));
15100 tree outputs
= tsubst_copy_asm_operands (ASM_OUTPUTS (t
), args
,
15101 complain
, in_decl
);
15102 tree inputs
= tsubst_copy_asm_operands (ASM_INPUTS (t
), args
,
15103 complain
, in_decl
);
15104 tree clobbers
= tsubst_copy_asm_operands (ASM_CLOBBERS (t
), args
,
15105 complain
, in_decl
);
15106 tree labels
= tsubst_copy_asm_operands (ASM_LABELS (t
), args
,
15107 complain
, in_decl
);
15108 tmp
= finish_asm_stmt (ASM_VOLATILE_P (t
), string
, outputs
, inputs
,
15110 tree asm_expr
= tmp
;
15111 if (TREE_CODE (asm_expr
) == CLEANUP_POINT_EXPR
)
15112 asm_expr
= TREE_OPERAND (asm_expr
, 0);
15113 ASM_INPUT_P (asm_expr
) = ASM_INPUT_P (t
);
15120 stmt
= begin_try_block ();
15121 RECUR (TRY_STMTS (t
));
15122 finish_cleanup_try_block (stmt
);
15123 finish_cleanup (RECUR (TRY_HANDLERS (t
)), stmt
);
15127 tree compound_stmt
= NULL_TREE
;
15129 if (FN_TRY_BLOCK_P (t
))
15130 stmt
= begin_function_try_block (&compound_stmt
);
15132 stmt
= begin_try_block ();
15134 RECUR (TRY_STMTS (t
));
15136 if (FN_TRY_BLOCK_P (t
))
15137 finish_function_try_block (stmt
);
15139 finish_try_block (stmt
);
15141 RECUR (TRY_HANDLERS (t
));
15142 if (FN_TRY_BLOCK_P (t
))
15143 finish_function_handler_sequence (stmt
, compound_stmt
);
15145 finish_handler_sequence (stmt
);
15151 tree decl
= HANDLER_PARMS (t
);
15155 decl
= tsubst (decl
, args
, complain
, in_decl
);
15156 /* Prevent instantiate_decl from trying to instantiate
15157 this variable. We've already done all that needs to be
15159 if (decl
!= error_mark_node
)
15160 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
15162 stmt
= begin_handler ();
15163 finish_handler_parms (decl
, stmt
);
15164 RECUR (HANDLER_BODY (t
));
15165 finish_handler (stmt
);
15170 tmp
= tsubst (TREE_TYPE (t
), args
, complain
, NULL_TREE
);
15171 if (CLASS_TYPE_P (tmp
))
15173 /* Local classes are not independent templates; they are
15174 instantiated along with their containing function. And this
15175 way we don't have to deal with pushing out of one local class
15176 to instantiate a member of another local class. */
15178 /* Closures are handled by the LAMBDA_EXPR. */
15179 gcc_assert (!LAMBDA_TYPE_P (TREE_TYPE (t
)));
15180 complete_type (tmp
);
15181 for (fn
= TYPE_METHODS (tmp
); fn
; fn
= DECL_CHAIN (fn
))
15182 if (!DECL_ARTIFICIAL (fn
))
15183 instantiate_decl (fn
, /*defer_ok*/0, /*expl_inst_class*/false);
15187 case STATIC_ASSERT
:
15191 ++c_inhibit_evaluation_warnings
;
15193 tsubst_expr (STATIC_ASSERT_CONDITION (t
),
15196 /*integral_constant_expression_p=*/true);
15197 --c_inhibit_evaluation_warnings
;
15199 finish_static_assert (condition
,
15200 STATIC_ASSERT_MESSAGE (t
),
15201 STATIC_ASSERT_SOURCE_LOCATION (t
),
15202 /*member_p=*/false);
15207 r
= push_omp_privatization_clauses (OMP_PARALLEL_COMBINED (t
));
15208 tmp
= tsubst_omp_clauses (OMP_PARALLEL_CLAUSES (t
), false, true,
15209 args
, complain
, in_decl
);
15210 if (OMP_PARALLEL_COMBINED (t
))
15211 omp_parallel_combined_clauses
= &tmp
;
15212 stmt
= begin_omp_parallel ();
15213 RECUR (OMP_PARALLEL_BODY (t
));
15214 gcc_assert (omp_parallel_combined_clauses
== NULL
);
15215 OMP_PARALLEL_COMBINED (finish_omp_parallel (tmp
, stmt
))
15216 = OMP_PARALLEL_COMBINED (t
);
15217 pop_omp_privatization_clauses (r
);
15221 r
= push_omp_privatization_clauses (false);
15222 tmp
= tsubst_omp_clauses (OMP_TASK_CLAUSES (t
), false, true,
15223 args
, complain
, in_decl
);
15224 stmt
= begin_omp_task ();
15225 RECUR (OMP_TASK_BODY (t
));
15226 finish_omp_task (tmp
, stmt
);
15227 pop_omp_privatization_clauses (r
);
15234 case OMP_DISTRIBUTE
:
15237 tree clauses
, body
, pre_body
;
15238 tree declv
= NULL_TREE
, initv
= NULL_TREE
, condv
= NULL_TREE
;
15239 tree orig_declv
= NULL_TREE
;
15240 tree incrv
= NULL_TREE
;
15243 r
= push_omp_privatization_clauses (OMP_FOR_INIT (t
) == NULL_TREE
);
15244 clauses
= tsubst_omp_clauses (OMP_FOR_CLAUSES (t
), false, true,
15245 args
, complain
, in_decl
);
15246 if (OMP_FOR_INIT (t
) != NULL_TREE
)
15248 declv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
15249 if (TREE_CODE (t
) == OMP_FOR
&& OMP_FOR_ORIG_DECLS (t
))
15250 orig_declv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
15251 initv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
15252 condv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
15253 incrv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
15256 stmt
= begin_omp_structured_block ();
15258 pre_body
= push_stmt_list ();
15259 RECUR (OMP_FOR_PRE_BODY (t
));
15260 pre_body
= pop_stmt_list (pre_body
);
15262 if (OMP_FOR_INIT (t
) != NULL_TREE
)
15263 for (i
= 0; i
< TREE_VEC_LENGTH (OMP_FOR_INIT (t
)); i
++)
15264 tsubst_omp_for_iterator (t
, i
, declv
, orig_declv
, initv
, condv
,
15265 incrv
, &clauses
, args
, complain
, in_decl
,
15266 integral_constant_expression_p
);
15267 omp_parallel_combined_clauses
= NULL
;
15269 body
= push_stmt_list ();
15270 RECUR (OMP_FOR_BODY (t
));
15271 body
= pop_stmt_list (body
);
15273 if (OMP_FOR_INIT (t
) != NULL_TREE
)
15274 t
= finish_omp_for (EXPR_LOCATION (t
), TREE_CODE (t
), declv
,
15275 orig_declv
, initv
, condv
, incrv
, body
, pre_body
,
15279 t
= make_node (TREE_CODE (t
));
15280 TREE_TYPE (t
) = void_type_node
;
15281 OMP_FOR_BODY (t
) = body
;
15282 OMP_FOR_PRE_BODY (t
) = pre_body
;
15283 OMP_FOR_CLAUSES (t
) = clauses
;
15284 SET_EXPR_LOCATION (t
, EXPR_LOCATION (t
));
15288 add_stmt (finish_omp_structured_block (stmt
));
15289 pop_omp_privatization_clauses (r
);
15294 omp_parallel_combined_clauses
= NULL
;
15299 r
= push_omp_privatization_clauses (TREE_CODE (t
) == OMP_TEAMS
15300 && OMP_TEAMS_COMBINED (t
));
15301 tmp
= tsubst_omp_clauses (OMP_CLAUSES (t
), false, true,
15302 args
, complain
, in_decl
);
15303 stmt
= push_stmt_list ();
15304 RECUR (OMP_BODY (t
));
15305 stmt
= pop_stmt_list (stmt
);
15308 OMP_BODY (t
) = stmt
;
15309 OMP_CLAUSES (t
) = tmp
;
15311 pop_omp_privatization_clauses (r
);
15314 case OMP_TARGET_DATA
:
15316 tmp
= tsubst_omp_clauses (OMP_CLAUSES (t
), false, true,
15317 args
, complain
, in_decl
);
15318 keep_next_level (true);
15319 stmt
= begin_omp_structured_block ();
15321 RECUR (OMP_BODY (t
));
15322 stmt
= finish_omp_structured_block (stmt
);
15325 OMP_BODY (t
) = stmt
;
15326 OMP_CLAUSES (t
) = tmp
;
15330 case OMP_TARGET_UPDATE
:
15331 case OMP_TARGET_ENTER_DATA
:
15332 case OMP_TARGET_EXIT_DATA
:
15333 tmp
= tsubst_omp_clauses (OMP_STANDALONE_CLAUSES (t
), false, true,
15334 args
, complain
, in_decl
);
15336 OMP_STANDALONE_CLAUSES (t
) = tmp
;
15341 tmp
= tsubst_omp_clauses (OMP_ORDERED_CLAUSES (t
), false, true,
15342 args
, complain
, in_decl
);
15343 stmt
= push_stmt_list ();
15344 RECUR (OMP_BODY (t
));
15345 stmt
= pop_stmt_list (stmt
);
15348 OMP_BODY (t
) = stmt
;
15349 OMP_ORDERED_CLAUSES (t
) = tmp
;
15355 case OMP_TASKGROUP
:
15356 stmt
= push_stmt_list ();
15357 RECUR (OMP_BODY (t
));
15358 stmt
= pop_stmt_list (stmt
);
15361 OMP_BODY (t
) = stmt
;
15366 gcc_assert (OMP_ATOMIC_DEPENDENT_P (t
));
15367 if (TREE_CODE (TREE_OPERAND (t
, 1)) != MODIFY_EXPR
)
15369 tree op1
= TREE_OPERAND (t
, 1);
15370 tree rhs1
= NULL_TREE
;
15372 if (TREE_CODE (op1
) == COMPOUND_EXPR
)
15374 rhs1
= RECUR (TREE_OPERAND (op1
, 0));
15375 op1
= TREE_OPERAND (op1
, 1);
15377 lhs
= RECUR (TREE_OPERAND (op1
, 0));
15378 rhs
= RECUR (TREE_OPERAND (op1
, 1));
15379 finish_omp_atomic (OMP_ATOMIC
, TREE_CODE (op1
), lhs
, rhs
,
15380 NULL_TREE
, NULL_TREE
, rhs1
,
15381 OMP_ATOMIC_SEQ_CST (t
));
15385 tree op1
= TREE_OPERAND (t
, 1);
15386 tree v
= NULL_TREE
, lhs
, rhs
= NULL_TREE
, lhs1
= NULL_TREE
;
15387 tree rhs1
= NULL_TREE
;
15388 enum tree_code code
= TREE_CODE (TREE_OPERAND (op1
, 1));
15389 enum tree_code opcode
= NOP_EXPR
;
15390 if (code
== OMP_ATOMIC_READ
)
15392 v
= RECUR (TREE_OPERAND (op1
, 0));
15393 lhs
= RECUR (TREE_OPERAND (TREE_OPERAND (op1
, 1), 0));
15395 else if (code
== OMP_ATOMIC_CAPTURE_OLD
15396 || code
== OMP_ATOMIC_CAPTURE_NEW
)
15398 tree op11
= TREE_OPERAND (TREE_OPERAND (op1
, 1), 1);
15399 v
= RECUR (TREE_OPERAND (op1
, 0));
15400 lhs1
= RECUR (TREE_OPERAND (TREE_OPERAND (op1
, 1), 0));
15401 if (TREE_CODE (op11
) == COMPOUND_EXPR
)
15403 rhs1
= RECUR (TREE_OPERAND (op11
, 0));
15404 op11
= TREE_OPERAND (op11
, 1);
15406 lhs
= RECUR (TREE_OPERAND (op11
, 0));
15407 rhs
= RECUR (TREE_OPERAND (op11
, 1));
15408 opcode
= TREE_CODE (op11
);
15409 if (opcode
== MODIFY_EXPR
)
15415 lhs
= RECUR (TREE_OPERAND (op1
, 0));
15416 rhs
= RECUR (TREE_OPERAND (op1
, 1));
15418 finish_omp_atomic (code
, opcode
, lhs
, rhs
, v
, lhs1
, rhs1
,
15419 OMP_ATOMIC_SEQ_CST (t
));
15423 case TRANSACTION_EXPR
:
15426 flags
|= (TRANSACTION_EXPR_OUTER (t
) ? TM_STMT_ATTR_OUTER
: 0);
15427 flags
|= (TRANSACTION_EXPR_RELAXED (t
) ? TM_STMT_ATTR_RELAXED
: 0);
15429 if (TRANSACTION_EXPR_IS_STMT (t
))
15431 tree body
= TRANSACTION_EXPR_BODY (t
);
15432 tree noex
= NULL_TREE
;
15433 if (TREE_CODE (body
) == MUST_NOT_THROW_EXPR
)
15435 noex
= MUST_NOT_THROW_COND (body
);
15436 if (noex
== NULL_TREE
)
15437 noex
= boolean_true_node
;
15438 body
= TREE_OPERAND (body
, 0);
15440 stmt
= begin_transaction_stmt (input_location
, NULL
, flags
);
15442 finish_transaction_stmt (stmt
, NULL
, flags
, RECUR (noex
));
15446 stmt
= build_transaction_expr (EXPR_LOCATION (t
),
15447 RECUR (TRANSACTION_EXPR_BODY (t
)),
15454 case MUST_NOT_THROW_EXPR
:
15456 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15457 tree cond
= RECUR (MUST_NOT_THROW_COND (t
));
15458 RETURN (build_must_not_throw_expr (op0
, cond
));
15461 case EXPR_PACK_EXPANSION
:
15462 error ("invalid use of pack expansion expression");
15463 RETURN (error_mark_node
);
15465 case NONTYPE_ARGUMENT_PACK
:
15466 error ("use %<...%> to expand argument pack");
15467 RETURN (error_mark_node
);
15469 case CILK_SPAWN_STMT
:
15470 cfun
->calls_cilk_spawn
= 1;
15471 RETURN (build_cilk_spawn (EXPR_LOCATION (t
), RECUR (CILK_SPAWN_FN (t
))));
15473 case CILK_SYNC_STMT
:
15474 RETURN (build_cilk_sync ());
15476 case COMPOUND_EXPR
:
15477 tmp
= RECUR (TREE_OPERAND (t
, 0));
15478 if (tmp
== NULL_TREE
)
15479 /* If the first operand was a statement, we're done with it. */
15480 RETURN (RECUR (TREE_OPERAND (t
, 1)));
15481 RETURN (build_x_compound_expr (EXPR_LOCATION (t
), tmp
,
15482 RECUR (TREE_OPERAND (t
, 1)),
15485 case ANNOTATE_EXPR
:
15486 tmp
= RECUR (TREE_OPERAND (t
, 0));
15487 RETURN (build2_loc (EXPR_LOCATION (t
), ANNOTATE_EXPR
,
15488 TREE_TYPE (tmp
), tmp
, RECUR (TREE_OPERAND (t
, 1))));
15491 gcc_assert (!STATEMENT_CODE_P (TREE_CODE (t
)));
15493 RETURN (tsubst_copy_and_build (t
, args
, complain
, in_decl
,
15494 /*function_p=*/false,
15495 integral_constant_expression_p
));
15498 RETURN (NULL_TREE
);
15500 input_location
= loc
;
15506 /* Instantiate the special body of the artificial DECL_OMP_DECLARE_REDUCTION
15507 function. For description of the body see comment above
15508 cp_parser_omp_declare_reduction_exprs. */
15511 tsubst_omp_udr (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
15513 if (t
== NULL_TREE
|| t
== error_mark_node
)
15516 gcc_assert (TREE_CODE (t
) == STATEMENT_LIST
);
15518 tree_stmt_iterator tsi
;
15521 memset (stmts
, 0, sizeof stmts
);
15522 for (i
= 0, tsi
= tsi_start (t
);
15523 i
< 7 && !tsi_end_p (tsi
);
15524 i
++, tsi_next (&tsi
))
15525 stmts
[i
] = tsi_stmt (tsi
);
15526 gcc_assert (tsi_end_p (tsi
));
15530 gcc_assert (TREE_CODE (stmts
[0]) == DECL_EXPR
15531 && TREE_CODE (stmts
[1]) == DECL_EXPR
);
15532 tree omp_out
= tsubst (DECL_EXPR_DECL (stmts
[0]),
15533 args
, complain
, in_decl
);
15534 tree omp_in
= tsubst (DECL_EXPR_DECL (stmts
[1]),
15535 args
, complain
, in_decl
);
15536 DECL_CONTEXT (omp_out
) = current_function_decl
;
15537 DECL_CONTEXT (omp_in
) = current_function_decl
;
15538 keep_next_level (true);
15539 tree block
= begin_omp_structured_block ();
15540 tsubst_expr (stmts
[2], args
, complain
, in_decl
, false);
15541 block
= finish_omp_structured_block (block
);
15542 block
= maybe_cleanup_point_expr_void (block
);
15543 add_decl_expr (omp_out
);
15544 if (TREE_NO_WARNING (DECL_EXPR_DECL (stmts
[0])))
15545 TREE_NO_WARNING (omp_out
) = 1;
15546 add_decl_expr (omp_in
);
15547 finish_expr_stmt (block
);
15551 gcc_assert (TREE_CODE (stmts
[3]) == DECL_EXPR
15552 && TREE_CODE (stmts
[4]) == DECL_EXPR
);
15553 tree omp_priv
= tsubst (DECL_EXPR_DECL (stmts
[3]),
15554 args
, complain
, in_decl
);
15555 tree omp_orig
= tsubst (DECL_EXPR_DECL (stmts
[4]),
15556 args
, complain
, in_decl
);
15557 DECL_CONTEXT (omp_priv
) = current_function_decl
;
15558 DECL_CONTEXT (omp_orig
) = current_function_decl
;
15559 keep_next_level (true);
15560 tree block
= begin_omp_structured_block ();
15561 tsubst_expr (stmts
[5], args
, complain
, in_decl
, false);
15562 block
= finish_omp_structured_block (block
);
15563 block
= maybe_cleanup_point_expr_void (block
);
15564 cp_walk_tree (&block
, cp_remove_omp_priv_cleanup_stmt
, omp_priv
, NULL
);
15565 add_decl_expr (omp_priv
);
15566 add_decl_expr (omp_orig
);
15567 finish_expr_stmt (block
);
15569 add_decl_expr (omp_orig
);
15573 /* T is a postfix-expression that is not being used in a function
15574 call. Return the substituted version of T. */
15577 tsubst_non_call_postfix_expression (tree t
, tree args
,
15578 tsubst_flags_t complain
,
15581 if (TREE_CODE (t
) == SCOPE_REF
)
15582 t
= tsubst_qualified_id (t
, args
, complain
, in_decl
,
15583 /*done=*/false, /*address_p=*/false);
15585 t
= tsubst_copy_and_build (t
, args
, complain
, in_decl
,
15586 /*function_p=*/false,
15587 /*integral_constant_expression_p=*/false);
15592 /* Like tsubst but deals with expressions and performs semantic
15593 analysis. FUNCTION_P is true if T is the "F" in "F (ARGS)". */
15596 tsubst_copy_and_build (tree t
,
15598 tsubst_flags_t complain
,
15601 bool integral_constant_expression_p
)
15603 #define RETURN(EXP) do { retval = (EXP); goto out; } while(0)
15604 #define RECUR(NODE) \
15605 tsubst_copy_and_build (NODE, args, complain, in_decl, \
15606 /*function_p=*/false, \
15607 integral_constant_expression_p)
15612 if (t
== NULL_TREE
|| t
== error_mark_node
)
15615 loc
= input_location
;
15616 if (EXPR_HAS_LOCATION (t
))
15617 input_location
= EXPR_LOCATION (t
);
15619 /* N3276 decltype magic only applies to calls at the top level or on the
15620 right side of a comma. */
15621 tsubst_flags_t decltype_flag
= (complain
& tf_decltype
);
15622 complain
&= ~tf_decltype
;
15624 switch (TREE_CODE (t
))
15628 /* Fall through. */
15629 case IDENTIFIER_NODE
:
15633 bool non_integral_constant_expression_p
;
15634 const char *error_msg
;
15636 if (IDENTIFIER_TYPENAME_P (t
))
15638 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15639 t
= mangle_conv_op_name_for_type (new_type
);
15642 /* Look up the name. */
15643 decl
= lookup_name (t
);
15645 /* By convention, expressions use ERROR_MARK_NODE to indicate
15646 failure, not NULL_TREE. */
15647 if (decl
== NULL_TREE
)
15648 decl
= error_mark_node
;
15650 decl
= finish_id_expression (t
, decl
, NULL_TREE
,
15652 integral_constant_expression_p
,
15653 /*allow_non_integral_constant_expression_p=*/(cxx_dialect
>= cxx11
),
15654 &non_integral_constant_expression_p
,
15655 /*template_p=*/false,
15657 /*address_p=*/false,
15658 /*template_arg_p=*/false,
15663 if (!function_p
&& identifier_p (decl
))
15665 if (complain
& tf_error
)
15666 unqualified_name_lookup_error (decl
);
15667 decl
= error_mark_node
;
15672 case TEMPLATE_ID_EXPR
:
15675 tree templ
= RECUR (TREE_OPERAND (t
, 0));
15676 tree targs
= TREE_OPERAND (t
, 1);
15679 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
15680 if (targs
== error_mark_node
)
15681 return error_mark_node
;
15683 if (variable_template_p (templ
))
15685 templ
= lookup_template_variable (templ
, targs
);
15686 if (!any_dependent_template_arguments_p (targs
))
15688 templ
= finish_template_variable (templ
, complain
);
15691 RETURN (convert_from_reference (templ
));
15694 if (TREE_CODE (templ
) == COMPONENT_REF
)
15696 object
= TREE_OPERAND (templ
, 0);
15697 templ
= TREE_OPERAND (templ
, 1);
15700 object
= NULL_TREE
;
15701 templ
= lookup_template_function (templ
, targs
);
15704 RETURN (build3 (COMPONENT_REF
, TREE_TYPE (templ
),
15705 object
, templ
, NULL_TREE
));
15707 RETURN (baselink_for_fns (templ
));
15712 tree r
= RECUR (TREE_OPERAND (t
, 0));
15714 if (REFERENCE_REF_P (t
))
15716 /* A type conversion to reference type will be enclosed in
15717 such an indirect ref, but the substitution of the cast
15718 will have also added such an indirect ref. */
15719 if (TREE_CODE (TREE_TYPE (r
)) == REFERENCE_TYPE
)
15720 r
= convert_from_reference (r
);
15723 r
= build_x_indirect_ref (input_location
, r
, RO_UNARY_STAR
,
15724 complain
|decltype_flag
);
15730 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15731 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15732 RETURN (build_nop (type
, op0
));
15735 case IMPLICIT_CONV_EXPR
:
15737 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15738 tree expr
= RECUR (TREE_OPERAND (t
, 0));
15739 int flags
= LOOKUP_IMPLICIT
;
15740 if (IMPLICIT_CONV_EXPR_DIRECT_INIT (t
))
15741 flags
= LOOKUP_NORMAL
;
15742 RETURN (perform_implicit_conversion_flags (type
, expr
, complain
,
15748 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15749 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15750 RETURN (build1 (CONVERT_EXPR
, type
, op0
));
15754 case REINTERPRET_CAST_EXPR
:
15755 case CONST_CAST_EXPR
:
15756 case DYNAMIC_CAST_EXPR
:
15757 case STATIC_CAST_EXPR
:
15760 tree op
, r
= NULL_TREE
;
15762 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15763 if (integral_constant_expression_p
15764 && !cast_valid_in_integral_constant_expression_p (type
))
15766 if (complain
& tf_error
)
15767 error ("a cast to a type other than an integral or "
15768 "enumeration type cannot appear in a constant-expression");
15769 RETURN (error_mark_node
);
15772 op
= RECUR (TREE_OPERAND (t
, 0));
15774 warning_sentinel
s(warn_useless_cast
);
15775 switch (TREE_CODE (t
))
15778 r
= build_functional_cast (type
, op
, complain
);
15780 case REINTERPRET_CAST_EXPR
:
15781 r
= build_reinterpret_cast (type
, op
, complain
);
15783 case CONST_CAST_EXPR
:
15784 r
= build_const_cast (type
, op
, complain
);
15786 case DYNAMIC_CAST_EXPR
:
15787 r
= build_dynamic_cast (type
, op
, complain
);
15789 case STATIC_CAST_EXPR
:
15790 r
= build_static_cast (type
, op
, complain
);
15793 gcc_unreachable ();
15799 case POSTDECREMENT_EXPR
:
15800 case POSTINCREMENT_EXPR
:
15801 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
15802 args
, complain
, in_decl
);
15803 RETURN (build_x_unary_op (input_location
, TREE_CODE (t
), op1
,
15804 complain
|decltype_flag
));
15806 case PREDECREMENT_EXPR
:
15807 case PREINCREMENT_EXPR
:
15811 case TRUTH_NOT_EXPR
:
15812 case UNARY_PLUS_EXPR
: /* Unary + */
15813 case REALPART_EXPR
:
15814 case IMAGPART_EXPR
:
15815 RETURN (build_x_unary_op (input_location
, TREE_CODE (t
),
15816 RECUR (TREE_OPERAND (t
, 0)),
15817 complain
|decltype_flag
));
15819 case FIX_TRUNC_EXPR
:
15820 RETURN (cp_build_unary_op (FIX_TRUNC_EXPR
, RECUR (TREE_OPERAND (t
, 0)),
15824 op1
= TREE_OPERAND (t
, 0);
15825 if (TREE_CODE (op1
) == LABEL_DECL
)
15826 RETURN (finish_label_address_expr (DECL_NAME (op1
),
15827 EXPR_LOCATION (op1
)));
15828 if (TREE_CODE (op1
) == SCOPE_REF
)
15829 op1
= tsubst_qualified_id (op1
, args
, complain
, in_decl
,
15830 /*done=*/true, /*address_p=*/true);
15832 op1
= tsubst_non_call_postfix_expression (op1
, args
, complain
,
15834 RETURN (build_x_unary_op (input_location
, ADDR_EXPR
, op1
,
15835 complain
|decltype_flag
));
15840 case TRUNC_DIV_EXPR
:
15841 case CEIL_DIV_EXPR
:
15842 case FLOOR_DIV_EXPR
:
15843 case ROUND_DIV_EXPR
:
15844 case EXACT_DIV_EXPR
:
15848 case TRUNC_MOD_EXPR
:
15849 case FLOOR_MOD_EXPR
:
15850 case TRUTH_ANDIF_EXPR
:
15851 case TRUTH_ORIF_EXPR
:
15852 case TRUTH_AND_EXPR
:
15853 case TRUTH_OR_EXPR
:
15869 warning_sentinel
s1(warn_type_limits
);
15870 warning_sentinel
s2(warn_div_by_zero
);
15871 warning_sentinel
s3(warn_logical_op
);
15872 warning_sentinel
s4(warn_tautological_compare
);
15873 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15874 tree op1
= RECUR (TREE_OPERAND (t
, 1));
15875 tree r
= build_x_binary_op
15876 (input_location
, TREE_CODE (t
),
15878 (TREE_NO_WARNING (TREE_OPERAND (t
, 0))
15880 : TREE_CODE (TREE_OPERAND (t
, 0))),
15882 (TREE_NO_WARNING (TREE_OPERAND (t
, 1))
15884 : TREE_CODE (TREE_OPERAND (t
, 1))),
15886 complain
|decltype_flag
);
15887 if (EXPR_P (r
) && TREE_NO_WARNING (t
))
15888 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
15893 case POINTER_PLUS_EXPR
:
15895 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15896 tree op1
= RECUR (TREE_OPERAND (t
, 1));
15897 return fold_build_pointer_plus (op0
, op1
);
15901 RETURN (tsubst_qualified_id (t
, args
, complain
, in_decl
, /*done=*/true,
15902 /*address_p=*/false));
15904 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
15905 args
, complain
, in_decl
);
15906 RETURN (build_x_array_ref (EXPR_LOCATION (t
), op1
,
15907 RECUR (TREE_OPERAND (t
, 1)),
15908 complain
|decltype_flag
));
15910 case ARRAY_NOTATION_REF
:
15912 tree start_index
, length
, stride
;
15913 op1
= tsubst_non_call_postfix_expression (ARRAY_NOTATION_ARRAY (t
),
15914 args
, complain
, in_decl
);
15915 start_index
= RECUR (ARRAY_NOTATION_START (t
));
15916 length
= RECUR (ARRAY_NOTATION_LENGTH (t
));
15917 stride
= RECUR (ARRAY_NOTATION_STRIDE (t
));
15918 RETURN (build_array_notation_ref (EXPR_LOCATION (t
), op1
, start_index
,
15919 length
, stride
, TREE_TYPE (op1
)));
15922 if (PACK_EXPANSION_P (TREE_OPERAND (t
, 0)))
15923 RETURN (tsubst_copy (t
, args
, complain
, in_decl
));
15930 op1
= TREE_OPERAND (t
, 0);
15931 if (TREE_CODE (t
) == SIZEOF_EXPR
&& SIZEOF_EXPR_TYPE_P (t
))
15932 op1
= TREE_TYPE (op1
);
15935 /* When there are no ARGS, we are trying to evaluate a
15936 non-dependent expression from the parser. Trying to do
15937 the substitutions may not work. */
15939 op1
= TREE_TYPE (op1
);
15943 ++cp_unevaluated_operand
;
15944 ++c_inhibit_evaluation_warnings
;
15946 op1
= tsubst (op1
, args
, complain
, in_decl
);
15948 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
15949 /*function_p=*/false,
15950 /*integral_constant_expression_p=*/
15952 --cp_unevaluated_operand
;
15953 --c_inhibit_evaluation_warnings
;
15956 r
= cxx_sizeof_or_alignof_type (op1
, TREE_CODE (t
),
15957 complain
& tf_error
);
15959 r
= cxx_sizeof_or_alignof_expr (op1
, TREE_CODE (t
),
15960 complain
& tf_error
);
15961 if (TREE_CODE (t
) == SIZEOF_EXPR
&& r
!= error_mark_node
)
15963 if (TREE_CODE (r
) != SIZEOF_EXPR
|| TYPE_P (op1
))
15965 if (!processing_template_decl
&& TYPE_P (op1
))
15967 r
= build_min (SIZEOF_EXPR
, size_type_node
,
15968 build1 (NOP_EXPR
, op1
, error_mark_node
));
15969 SIZEOF_EXPR_TYPE_P (r
) = 1;
15972 r
= build_min (SIZEOF_EXPR
, size_type_node
, op1
);
15973 TREE_SIDE_EFFECTS (r
) = 0;
15974 TREE_READONLY (r
) = 1;
15976 SET_EXPR_LOCATION (r
, EXPR_LOCATION (t
));
15981 case AT_ENCODE_EXPR
:
15983 op1
= TREE_OPERAND (t
, 0);
15984 ++cp_unevaluated_operand
;
15985 ++c_inhibit_evaluation_warnings
;
15986 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
15987 /*function_p=*/false,
15988 /*integral_constant_expression_p=*/false);
15989 --cp_unevaluated_operand
;
15990 --c_inhibit_evaluation_warnings
;
15991 RETURN (objc_build_encode_expr (op1
));
15994 case NOEXCEPT_EXPR
:
15995 op1
= TREE_OPERAND (t
, 0);
15996 ++cp_unevaluated_operand
;
15997 ++c_inhibit_evaluation_warnings
;
15998 ++cp_noexcept_operand
;
15999 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
16000 /*function_p=*/false,
16001 /*integral_constant_expression_p=*/false);
16002 --cp_unevaluated_operand
;
16003 --c_inhibit_evaluation_warnings
;
16004 --cp_noexcept_operand
;
16005 RETURN (finish_noexcept_expr (op1
, complain
));
16009 warning_sentinel
s(warn_div_by_zero
);
16010 tree lhs
= RECUR (TREE_OPERAND (t
, 0));
16011 tree rhs
= RECUR (TREE_OPERAND (t
, 2));
16012 tree r
= build_x_modify_expr
16013 (EXPR_LOCATION (t
), lhs
, TREE_CODE (TREE_OPERAND (t
, 1)), rhs
,
16014 complain
|decltype_flag
);
16015 /* TREE_NO_WARNING must be set if either the expression was
16016 parenthesized or it uses an operator such as >>= rather
16017 than plain assignment. In the former case, it was already
16018 set and must be copied. In the latter case,
16019 build_x_modify_expr sets it and it must not be reset
16021 if (TREE_NO_WARNING (t
))
16022 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
16028 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
16029 args
, complain
, in_decl
);
16030 /* Remember that there was a reference to this entity. */
16032 && !mark_used (op1
, complain
) && !(complain
& tf_error
))
16033 RETURN (error_mark_node
);
16034 RETURN (build_x_arrow (input_location
, op1
, complain
));
16038 tree placement
= RECUR (TREE_OPERAND (t
, 0));
16039 tree init
= RECUR (TREE_OPERAND (t
, 3));
16040 vec
<tree
, va_gc
> *placement_vec
;
16041 vec
<tree
, va_gc
> *init_vec
;
16044 if (placement
== NULL_TREE
)
16045 placement_vec
= NULL
;
16048 placement_vec
= make_tree_vector ();
16049 for (; placement
!= NULL_TREE
; placement
= TREE_CHAIN (placement
))
16050 vec_safe_push (placement_vec
, TREE_VALUE (placement
));
16053 /* If there was an initializer in the original tree, but it
16054 instantiated to an empty list, then we should pass a
16055 non-NULL empty vector to tell build_new that it was an
16056 empty initializer() rather than no initializer. This can
16057 only happen when the initializer is a pack expansion whose
16058 parameter packs are of length zero. */
16059 if (init
== NULL_TREE
&& TREE_OPERAND (t
, 3) == NULL_TREE
)
16063 init_vec
= make_tree_vector ();
16064 if (init
== void_node
)
16065 gcc_assert (init_vec
!= NULL
);
16068 for (; init
!= NULL_TREE
; init
= TREE_CHAIN (init
))
16069 vec_safe_push (init_vec
, TREE_VALUE (init
));
16073 tree op1
= tsubst (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
16074 tree op2
= RECUR (TREE_OPERAND (t
, 2));
16075 ret
= build_new (&placement_vec
, op1
, op2
, &init_vec
,
16076 NEW_EXPR_USE_GLOBAL (t
),
16079 if (placement_vec
!= NULL
)
16080 release_tree_vector (placement_vec
);
16081 if (init_vec
!= NULL
)
16082 release_tree_vector (init_vec
);
16089 tree op0
= RECUR (TREE_OPERAND (t
, 0));
16090 tree op1
= RECUR (TREE_OPERAND (t
, 1));
16091 RETURN (delete_sanity (op0
, op1
,
16092 DELETE_EXPR_USE_VEC (t
),
16093 DELETE_EXPR_USE_GLOBAL (t
),
16097 case COMPOUND_EXPR
:
16099 tree op0
= tsubst_copy_and_build (TREE_OPERAND (t
, 0), args
,
16100 complain
& ~tf_decltype
, in_decl
,
16101 /*function_p=*/false,
16102 integral_constant_expression_p
);
16103 RETURN (build_x_compound_expr (EXPR_LOCATION (t
),
16105 RECUR (TREE_OPERAND (t
, 1)),
16106 complain
|decltype_flag
));
16112 vec
<tree
, va_gc
> *call_args
;
16113 unsigned int nargs
, i
;
16118 function
= CALL_EXPR_FN (t
);
16119 /* When we parsed the expression, we determined whether or
16120 not Koenig lookup should be performed. */
16121 koenig_p
= KOENIG_LOOKUP_P (t
);
16122 if (TREE_CODE (function
) == SCOPE_REF
)
16124 qualified_p
= true;
16125 function
= tsubst_qualified_id (function
, args
, complain
, in_decl
,
16127 /*address_p=*/false);
16129 else if (koenig_p
&& identifier_p (function
))
16131 /* Do nothing; calling tsubst_copy_and_build on an identifier
16132 would incorrectly perform unqualified lookup again.
16134 Note that we can also have an IDENTIFIER_NODE if the earlier
16135 unqualified lookup found a member function; in that case
16136 koenig_p will be false and we do want to do the lookup
16137 again to find the instantiated member function.
16139 FIXME but doing that causes c++/15272, so we need to stop
16140 using IDENTIFIER_NODE in that situation. */
16141 qualified_p
= false;
16145 if (TREE_CODE (function
) == COMPONENT_REF
)
16147 tree op
= TREE_OPERAND (function
, 1);
16149 qualified_p
= (TREE_CODE (op
) == SCOPE_REF
16150 || (BASELINK_P (op
)
16151 && BASELINK_QUALIFIED_P (op
)));
16154 qualified_p
= false;
16156 if (TREE_CODE (function
) == ADDR_EXPR
16157 && TREE_CODE (TREE_OPERAND (function
, 0)) == FUNCTION_DECL
)
16158 /* Avoid error about taking the address of a constructor. */
16159 function
= TREE_OPERAND (function
, 0);
16161 function
= tsubst_copy_and_build (function
, args
, complain
,
16164 integral_constant_expression_p
);
16166 if (BASELINK_P (function
))
16167 qualified_p
= true;
16170 nargs
= call_expr_nargs (t
);
16171 call_args
= make_tree_vector ();
16172 for (i
= 0; i
< nargs
; ++i
)
16174 tree arg
= CALL_EXPR_ARG (t
, i
);
16176 if (!PACK_EXPANSION_P (arg
))
16177 vec_safe_push (call_args
, RECUR (CALL_EXPR_ARG (t
, i
)));
16180 /* Expand the pack expansion and push each entry onto
16182 arg
= tsubst_pack_expansion (arg
, args
, complain
, in_decl
);
16183 if (TREE_CODE (arg
) == TREE_VEC
)
16185 unsigned int len
, j
;
16187 len
= TREE_VEC_LENGTH (arg
);
16188 for (j
= 0; j
< len
; ++j
)
16190 tree value
= TREE_VEC_ELT (arg
, j
);
16191 if (value
!= NULL_TREE
)
16192 value
= convert_from_reference (value
);
16193 vec_safe_push (call_args
, value
);
16198 /* A partial substitution. Add one entry. */
16199 vec_safe_push (call_args
, arg
);
16204 /* We do not perform argument-dependent lookup if normal
16205 lookup finds a non-function, in accordance with the
16206 expected resolution of DR 218. */
16208 && ((is_overloaded_fn (function
)
16209 /* If lookup found a member function, the Koenig lookup is
16210 not appropriate, even if an unqualified-name was used
16211 to denote the function. */
16212 && !DECL_FUNCTION_MEMBER_P (get_first_fn (function
)))
16213 || identifier_p (function
))
16214 /* Only do this when substitution turns a dependent call
16215 into a non-dependent call. */
16216 && type_dependent_expression_p_push (t
)
16217 && !any_type_dependent_arguments_p (call_args
))
16218 function
= perform_koenig_lookup (function
, call_args
, tf_none
);
16220 if (identifier_p (function
)
16221 && !any_type_dependent_arguments_p (call_args
))
16223 if (koenig_p
&& (complain
& tf_warning_or_error
))
16225 /* For backwards compatibility and good diagnostics, try
16226 the unqualified lookup again if we aren't in SFINAE
16228 tree unq
= (tsubst_copy_and_build
16229 (function
, args
, complain
, in_decl
, true,
16230 integral_constant_expression_p
));
16231 if (unq
== error_mark_node
)
16232 RETURN (error_mark_node
);
16234 if (unq
!= function
)
16237 if (INDIRECT_REF_P (fn
))
16238 fn
= TREE_OPERAND (fn
, 0);
16239 if (TREE_CODE (fn
) == COMPONENT_REF
)
16240 fn
= TREE_OPERAND (fn
, 1);
16241 if (is_overloaded_fn (fn
))
16242 fn
= get_first_fn (fn
);
16243 if (permerror (EXPR_LOC_OR_LOC (t
, input_location
),
16244 "%qD was not declared in this scope, "
16245 "and no declarations were found by "
16246 "argument-dependent lookup at the point "
16247 "of instantiation", function
))
16250 /* Can't say anything more. */;
16251 else if (DECL_CLASS_SCOPE_P (fn
))
16253 location_t loc
= EXPR_LOC_OR_LOC (t
,
16256 "declarations in dependent base %qT are "
16257 "not found by unqualified lookup",
16258 DECL_CLASS_CONTEXT (fn
));
16259 if (current_class_ptr
)
16261 "use %<this->%D%> instead", function
);
16264 "use %<%T::%D%> instead",
16265 current_class_name
, function
);
16268 inform (DECL_SOURCE_LOCATION (fn
),
16269 "%qD declared here, later in the "
16270 "translation unit", fn
);
16275 if (identifier_p (function
))
16277 if (complain
& tf_error
)
16278 unqualified_name_lookup_error (function
);
16279 release_tree_vector (call_args
);
16280 RETURN (error_mark_node
);
16284 /* Remember that there was a reference to this entity. */
16285 if (DECL_P (function
)
16286 && !mark_used (function
, complain
) && !(complain
& tf_error
))
16287 RETURN (error_mark_node
);
16289 /* Put back tf_decltype for the actual call. */
16290 complain
|= decltype_flag
;
16292 if (TREE_CODE (function
) == OFFSET_REF
)
16293 ret
= build_offset_ref_call_from_tree (function
, &call_args
,
16295 else if (TREE_CODE (function
) == COMPONENT_REF
)
16297 tree instance
= TREE_OPERAND (function
, 0);
16298 tree fn
= TREE_OPERAND (function
, 1);
16300 if (processing_template_decl
16301 && (type_dependent_expression_p (instance
)
16302 || (!BASELINK_P (fn
)
16303 && TREE_CODE (fn
) != FIELD_DECL
)
16304 || type_dependent_expression_p (fn
)
16305 || any_type_dependent_arguments_p (call_args
)))
16306 ret
= build_nt_call_vec (function
, call_args
);
16307 else if (!BASELINK_P (fn
))
16308 ret
= finish_call_expr (function
, &call_args
,
16309 /*disallow_virtual=*/false,
16310 /*koenig_p=*/false,
16313 ret
= (build_new_method_call
16315 &call_args
, NULL_TREE
,
16316 qualified_p
? LOOKUP_NONVIRTUAL
: LOOKUP_NORMAL
,
16321 ret
= finish_call_expr (function
, &call_args
,
16322 /*disallow_virtual=*/qualified_p
,
16326 release_tree_vector (call_args
);
16333 tree cond
= RECUR (TREE_OPERAND (t
, 0));
16334 tree folded_cond
= fold_non_dependent_expr (cond
);
16337 if (TREE_CODE (folded_cond
) == INTEGER_CST
)
16339 if (integer_zerop (folded_cond
))
16341 ++c_inhibit_evaluation_warnings
;
16342 exp1
= RECUR (TREE_OPERAND (t
, 1));
16343 --c_inhibit_evaluation_warnings
;
16344 exp2
= RECUR (TREE_OPERAND (t
, 2));
16348 exp1
= RECUR (TREE_OPERAND (t
, 1));
16349 ++c_inhibit_evaluation_warnings
;
16350 exp2
= RECUR (TREE_OPERAND (t
, 2));
16351 --c_inhibit_evaluation_warnings
;
16353 cond
= folded_cond
;
16357 exp1
= RECUR (TREE_OPERAND (t
, 1));
16358 exp2
= RECUR (TREE_OPERAND (t
, 2));
16361 RETURN (build_x_conditional_expr (EXPR_LOCATION (t
),
16362 cond
, exp1
, exp2
, complain
));
16365 case PSEUDO_DTOR_EXPR
:
16367 tree op0
= RECUR (TREE_OPERAND (t
, 0));
16368 tree op1
= RECUR (TREE_OPERAND (t
, 1));
16369 tree op2
= tsubst (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
16370 RETURN (finish_pseudo_destructor_expr (op0
, op1
, op2
,
16376 tree purpose
, value
, chain
;
16378 if (t
== void_list_node
)
16381 if ((TREE_PURPOSE (t
) && PACK_EXPANSION_P (TREE_PURPOSE (t
)))
16382 || (TREE_VALUE (t
) && PACK_EXPANSION_P (TREE_VALUE (t
))))
16384 /* We have pack expansions, so expand those and
16385 create a new list out of it. */
16386 tree purposevec
= NULL_TREE
;
16387 tree valuevec
= NULL_TREE
;
16391 /* Expand the argument expressions. */
16392 if (TREE_PURPOSE (t
))
16393 purposevec
= tsubst_pack_expansion (TREE_PURPOSE (t
), args
,
16394 complain
, in_decl
);
16395 if (TREE_VALUE (t
))
16396 valuevec
= tsubst_pack_expansion (TREE_VALUE (t
), args
,
16397 complain
, in_decl
);
16399 /* Build the rest of the list. */
16400 chain
= TREE_CHAIN (t
);
16401 if (chain
&& chain
!= void_type_node
)
16402 chain
= RECUR (chain
);
16404 /* Determine the number of arguments. */
16405 if (purposevec
&& TREE_CODE (purposevec
) == TREE_VEC
)
16407 len
= TREE_VEC_LENGTH (purposevec
);
16408 gcc_assert (!valuevec
|| len
== TREE_VEC_LENGTH (valuevec
));
16410 else if (TREE_CODE (valuevec
) == TREE_VEC
)
16411 len
= TREE_VEC_LENGTH (valuevec
);
16414 /* Since we only performed a partial substitution into
16415 the argument pack, we only RETURN (a single list
16417 if (purposevec
== TREE_PURPOSE (t
)
16418 && valuevec
== TREE_VALUE (t
)
16419 && chain
== TREE_CHAIN (t
))
16422 RETURN (tree_cons (purposevec
, valuevec
, chain
));
16425 /* Convert the argument vectors into a TREE_LIST */
16429 /* Grab the Ith values. */
16431 purpose
= purposevec
? TREE_VEC_ELT (purposevec
, i
)
16434 = valuevec
? convert_from_reference (TREE_VEC_ELT (valuevec
, i
))
16437 /* Build the list (backwards). */
16438 chain
= tree_cons (purpose
, value
, chain
);
16444 purpose
= TREE_PURPOSE (t
);
16446 purpose
= RECUR (purpose
);
16447 value
= TREE_VALUE (t
);
16449 value
= RECUR (value
);
16450 chain
= TREE_CHAIN (t
);
16451 if (chain
&& chain
!= void_type_node
)
16452 chain
= RECUR (chain
);
16453 if (purpose
== TREE_PURPOSE (t
)
16454 && value
== TREE_VALUE (t
)
16455 && chain
== TREE_CHAIN (t
))
16457 RETURN (tree_cons (purpose
, value
, chain
));
16460 case COMPONENT_REF
:
16467 object
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
16468 args
, complain
, in_decl
);
16469 /* Remember that there was a reference to this entity. */
16470 if (DECL_P (object
)
16471 && !mark_used (object
, complain
) && !(complain
& tf_error
))
16472 RETURN (error_mark_node
);
16473 object_type
= TREE_TYPE (object
);
16475 member
= TREE_OPERAND (t
, 1);
16476 if (BASELINK_P (member
))
16477 member
= tsubst_baselink (member
,
16478 non_reference (TREE_TYPE (object
)),
16479 args
, complain
, in_decl
);
16481 member
= tsubst_copy (member
, args
, complain
, in_decl
);
16482 if (member
== error_mark_node
)
16483 RETURN (error_mark_node
);
16485 if (type_dependent_expression_p (object
))
16486 /* We can't do much here. */;
16487 else if (!CLASS_TYPE_P (object_type
))
16489 if (scalarish_type_p (object_type
))
16491 tree s
= NULL_TREE
;
16492 tree dtor
= member
;
16494 if (TREE_CODE (dtor
) == SCOPE_REF
)
16496 s
= TREE_OPERAND (dtor
, 0);
16497 dtor
= TREE_OPERAND (dtor
, 1);
16499 if (TREE_CODE (dtor
) == BIT_NOT_EXPR
)
16501 dtor
= TREE_OPERAND (dtor
, 0);
16503 RETURN (finish_pseudo_destructor_expr
16504 (object
, s
, dtor
, input_location
));
16508 else if (TREE_CODE (member
) == SCOPE_REF
16509 && TREE_CODE (TREE_OPERAND (member
, 1)) == TEMPLATE_ID_EXPR
)
16511 /* Lookup the template functions now that we know what the
16513 tree scope
= TREE_OPERAND (member
, 0);
16514 tree tmpl
= TREE_OPERAND (TREE_OPERAND (member
, 1), 0);
16515 tree args
= TREE_OPERAND (TREE_OPERAND (member
, 1), 1);
16516 member
= lookup_qualified_name (scope
, tmpl
,
16517 /*is_type_p=*/false,
16518 /*complain=*/false);
16519 if (BASELINK_P (member
))
16521 BASELINK_FUNCTIONS (member
)
16522 = build_nt (TEMPLATE_ID_EXPR
, BASELINK_FUNCTIONS (member
),
16524 member
= (adjust_result_of_qualified_name_lookup
16525 (member
, BINFO_TYPE (BASELINK_BINFO (member
)),
16530 qualified_name_lookup_error (scope
, tmpl
, member
,
16532 RETURN (error_mark_node
);
16535 else if (TREE_CODE (member
) == SCOPE_REF
16536 && !CLASS_TYPE_P (TREE_OPERAND (member
, 0))
16537 && TREE_CODE (TREE_OPERAND (member
, 0)) != NAMESPACE_DECL
)
16539 if (complain
& tf_error
)
16541 if (TYPE_P (TREE_OPERAND (member
, 0)))
16542 error ("%qT is not a class or namespace",
16543 TREE_OPERAND (member
, 0));
16545 error ("%qD is not a class or namespace",
16546 TREE_OPERAND (member
, 0));
16548 RETURN (error_mark_node
);
16550 else if (TREE_CODE (member
) == FIELD_DECL
)
16552 r
= finish_non_static_data_member (member
, object
, NULL_TREE
);
16553 if (TREE_CODE (r
) == COMPONENT_REF
)
16554 REF_PARENTHESIZED_P (r
) = REF_PARENTHESIZED_P (t
);
16558 r
= finish_class_member_access_expr (object
, member
,
16559 /*template_p=*/false,
16561 if (TREE_CODE (r
) == COMPONENT_REF
)
16562 REF_PARENTHESIZED_P (r
) = REF_PARENTHESIZED_P (t
);
16567 RETURN (build_throw
16568 (RECUR (TREE_OPERAND (t
, 0))));
16572 vec
<constructor_elt
, va_gc
> *n
;
16573 constructor_elt
*ce
;
16574 unsigned HOST_WIDE_INT idx
;
16575 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
16576 bool process_index_p
;
16578 bool need_copy_p
= false;
16581 if (type
== error_mark_node
)
16582 RETURN (error_mark_node
);
16584 /* digest_init will do the wrong thing if we let it. */
16585 if (type
&& TYPE_PTRMEMFUNC_P (type
))
16588 /* We do not want to process the index of aggregate
16589 initializers as they are identifier nodes which will be
16590 looked up by digest_init. */
16591 process_index_p
= !(type
&& MAYBE_CLASS_TYPE_P (type
));
16593 n
= vec_safe_copy (CONSTRUCTOR_ELTS (t
));
16594 newlen
= vec_safe_length (n
);
16595 FOR_EACH_VEC_SAFE_ELT (n
, idx
, ce
)
16597 if (ce
->index
&& process_index_p
16598 /* An identifier index is looked up in the type
16599 being initialized, not the current scope. */
16600 && TREE_CODE (ce
->index
) != IDENTIFIER_NODE
)
16601 ce
->index
= RECUR (ce
->index
);
16603 if (PACK_EXPANSION_P (ce
->value
))
16605 /* Substitute into the pack expansion. */
16606 ce
->value
= tsubst_pack_expansion (ce
->value
, args
, complain
,
16609 if (ce
->value
== error_mark_node
16610 || PACK_EXPANSION_P (ce
->value
))
16612 else if (TREE_VEC_LENGTH (ce
->value
) == 1)
16613 /* Just move the argument into place. */
16614 ce
->value
= TREE_VEC_ELT (ce
->value
, 0);
16617 /* Update the length of the final CONSTRUCTOR
16618 arguments vector, and note that we will need to
16620 newlen
= newlen
+ TREE_VEC_LENGTH (ce
->value
) - 1;
16621 need_copy_p
= true;
16625 ce
->value
= RECUR (ce
->value
);
16630 vec
<constructor_elt
, va_gc
> *old_n
= n
;
16632 vec_alloc (n
, newlen
);
16633 FOR_EACH_VEC_ELT (*old_n
, idx
, ce
)
16635 if (TREE_CODE (ce
->value
) == TREE_VEC
)
16637 int i
, len
= TREE_VEC_LENGTH (ce
->value
);
16638 for (i
= 0; i
< len
; ++i
)
16639 CONSTRUCTOR_APPEND_ELT (n
, 0,
16640 TREE_VEC_ELT (ce
->value
, i
));
16643 CONSTRUCTOR_APPEND_ELT (n
, 0, ce
->value
);
16647 r
= build_constructor (init_list_type_node
, n
);
16648 CONSTRUCTOR_IS_DIRECT_INIT (r
) = CONSTRUCTOR_IS_DIRECT_INIT (t
);
16650 if (TREE_HAS_CONSTRUCTOR (t
))
16651 RETURN (finish_compound_literal (type
, r
, complain
));
16653 TREE_TYPE (r
) = type
;
16659 tree operand_0
= TREE_OPERAND (t
, 0);
16660 if (TYPE_P (operand_0
))
16662 operand_0
= tsubst (operand_0
, args
, complain
, in_decl
);
16663 RETURN (get_typeid (operand_0
, complain
));
16667 operand_0
= RECUR (operand_0
);
16668 RETURN (build_typeid (operand_0
, complain
));
16675 else if (DECL_PACK_P (t
))
16677 /* We don't build decls for an instantiation of a
16678 variadic capture proxy, we instantiate the elements
16680 gcc_assert (DECL_HAS_VALUE_EXPR_P (t
));
16681 return RECUR (DECL_VALUE_EXPR (t
));
16687 tree r
= tsubst_copy (t
, args
, complain
, in_decl
);
16688 /* ??? We're doing a subset of finish_id_expression here. */
16690 && !processing_template_decl
16691 && !cp_unevaluated_operand
16692 && (TREE_STATIC (r
) || DECL_EXTERNAL (r
))
16693 && CP_DECL_THREAD_LOCAL_P (r
))
16695 if (tree wrap
= get_tls_wrapper_fn (r
))
16696 /* Replace an evaluated use of the thread_local variable with
16697 a call to its wrapper. */
16698 r
= build_cxx_call (wrap
, 0, NULL
, tf_warning_or_error
);
16700 else if (outer_automatic_var_p (r
))
16702 r
= process_outer_var_ref (r
, complain
);
16703 if (is_capture_proxy (r
))
16704 register_local_specialization (r
, t
);
16707 if (TREE_CODE (TREE_TYPE (t
)) != REFERENCE_TYPE
)
16708 /* If the original type was a reference, we'll be wrapped in
16709 the appropriate INDIRECT_REF. */
16710 r
= convert_from_reference (r
);
16716 tree op0
= RECUR (TREE_OPERAND (t
, 0));
16717 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
16718 RETURN (build_x_va_arg (EXPR_LOCATION (t
), op0
, type
));
16721 case OFFSETOF_EXPR
:
16722 RETURN (finish_offsetof (RECUR (TREE_OPERAND (t
, 0)),
16723 EXPR_LOCATION (t
)));
16727 tree type1
= tsubst (TRAIT_EXPR_TYPE1 (t
), args
,
16728 complain
, in_decl
);
16730 tree type2
= TRAIT_EXPR_TYPE2 (t
);
16731 if (type2
&& TREE_CODE (type2
) == TREE_LIST
)
16732 type2
= RECUR (type2
);
16734 type2
= tsubst (type2
, args
, complain
, in_decl
);
16736 RETURN (finish_trait_expr (TRAIT_EXPR_KIND (t
), type1
, type2
));
16741 tree old_stmt_expr
= cur_stmt_expr
;
16742 tree stmt_expr
= begin_stmt_expr ();
16744 cur_stmt_expr
= stmt_expr
;
16745 tsubst_expr (STMT_EXPR_STMT (t
), args
, complain
, in_decl
,
16746 integral_constant_expression_p
);
16747 stmt_expr
= finish_stmt_expr (stmt_expr
, false);
16748 cur_stmt_expr
= old_stmt_expr
;
16750 /* If the resulting list of expression statement is empty,
16751 fold it further into void_node. */
16752 if (empty_expr_stmt_p (stmt_expr
))
16753 stmt_expr
= void_node
;
16755 RETURN (stmt_expr
);
16760 tree r
= build_lambda_expr ();
16762 tree type
= tsubst (LAMBDA_EXPR_CLOSURE (t
), args
, complain
, NULL_TREE
);
16763 LAMBDA_EXPR_CLOSURE (r
) = type
;
16764 CLASSTYPE_LAMBDA_EXPR (type
) = r
;
16766 LAMBDA_EXPR_LOCATION (r
)
16767 = LAMBDA_EXPR_LOCATION (t
);
16768 LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (r
)
16769 = LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (t
);
16770 LAMBDA_EXPR_MUTABLE_P (r
) = LAMBDA_EXPR_MUTABLE_P (t
);
16771 LAMBDA_EXPR_DISCRIMINATOR (r
)
16772 = (LAMBDA_EXPR_DISCRIMINATOR (t
));
16773 tree scope
= LAMBDA_EXPR_EXTRA_SCOPE (t
);
16775 /* No substitution needed. */;
16776 else if (VAR_OR_FUNCTION_DECL_P (scope
))
16777 /* For a function or variable scope, we want to use tsubst so that we
16778 don't complain about referring to an auto before deduction. */
16779 scope
= tsubst (scope
, args
, complain
, in_decl
);
16780 else if (TREE_CODE (scope
) == PARM_DECL
)
16782 /* Look up the parameter we want directly, as tsubst_copy
16783 doesn't do what we need. */
16784 tree fn
= tsubst (DECL_CONTEXT (scope
), args
, complain
, in_decl
);
16785 tree parm
= FUNCTION_FIRST_USER_PARM (fn
);
16786 while (DECL_PARM_INDEX (parm
) != DECL_PARM_INDEX (scope
))
16787 parm
= DECL_CHAIN (parm
);
16789 /* FIXME Work around the parm not having DECL_CONTEXT set. */
16790 if (DECL_CONTEXT (scope
) == NULL_TREE
)
16791 DECL_CONTEXT (scope
) = fn
;
16793 else if (TREE_CODE (scope
) == FIELD_DECL
)
16794 /* For a field, use tsubst_copy so that we look up the existing field
16795 rather than build a new one. */
16796 scope
= RECUR (scope
);
16798 gcc_unreachable ();
16799 LAMBDA_EXPR_EXTRA_SCOPE (r
) = scope
;
16800 LAMBDA_EXPR_RETURN_TYPE (r
)
16801 = tsubst (LAMBDA_EXPR_RETURN_TYPE (t
), args
, complain
, in_decl
);
16803 gcc_assert (LAMBDA_EXPR_THIS_CAPTURE (t
) == NULL_TREE
16804 && LAMBDA_EXPR_PENDING_PROXIES (t
) == NULL
);
16806 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
16807 determine_visibility (TYPE_NAME (type
));
16808 /* Now that we know visibility, instantiate the type so we have a
16809 declaration of the op() for later calls to lambda_function. */
16810 complete_type (type
);
16812 LAMBDA_EXPR_THIS_CAPTURE (r
) = NULL_TREE
;
16814 insert_pending_capture_proxies ();
16816 RETURN (build_lambda_object (r
));
16820 /* We can get here for a constant initializer of non-dependent type.
16821 FIXME stop folding in cp_parser_initializer_clause. */
16823 tree r
= get_target_expr_sfinae (RECUR (TARGET_EXPR_INITIAL (t
)),
16828 case TRANSACTION_EXPR
:
16829 RETURN (tsubst_expr(t
, args
, complain
, in_decl
,
16830 integral_constant_expression_p
));
16833 RETURN (finish_parenthesized_expr (RECUR (TREE_OPERAND (t
, 0))));
16835 case VEC_PERM_EXPR
:
16837 tree op0
= RECUR (TREE_OPERAND (t
, 0));
16838 tree op1
= RECUR (TREE_OPERAND (t
, 1));
16839 tree op2
= RECUR (TREE_OPERAND (t
, 2));
16840 RETURN (build_x_vec_perm_expr (input_location
, op0
, op1
, op2
,
16844 case REQUIRES_EXPR
:
16845 RETURN (tsubst_requires_expr (t
, args
, complain
, in_decl
));
16848 /* Handle Objective-C++ constructs, if appropriate. */
16851 = objcp_tsubst_copy_and_build (t
, args
, complain
,
16852 in_decl
, /*function_p=*/false);
16856 RETURN (tsubst_copy (t
, args
, complain
, in_decl
));
16862 input_location
= loc
;
16866 /* Verify that the instantiated ARGS are valid. For type arguments,
16867 make sure that the type's linkage is ok. For non-type arguments,
16868 make sure they are constants if they are integral or enumerations.
16869 Emit an error under control of COMPLAIN, and return TRUE on error. */
16872 check_instantiated_arg (tree tmpl
, tree t
, tsubst_flags_t complain
)
16874 if (dependent_template_arg_p (t
))
16876 if (ARGUMENT_PACK_P (t
))
16878 tree vec
= ARGUMENT_PACK_ARGS (t
);
16879 int len
= TREE_VEC_LENGTH (vec
);
16880 bool result
= false;
16883 for (i
= 0; i
< len
; ++i
)
16884 if (check_instantiated_arg (tmpl
, TREE_VEC_ELT (vec
, i
), complain
))
16888 else if (TYPE_P (t
))
16890 /* [basic.link]: A name with no linkage (notably, the name
16891 of a class or enumeration declared in a local scope)
16892 shall not be used to declare an entity with linkage.
16893 This implies that names with no linkage cannot be used as
16896 DR 757 relaxes this restriction for C++0x. */
16897 tree nt
= (cxx_dialect
> cxx98
? NULL_TREE
16898 : no_linkage_check (t
, /*relaxed_p=*/false));
16902 /* DR 488 makes use of a type with no linkage cause
16903 type deduction to fail. */
16904 if (complain
& tf_error
)
16906 if (TYPE_ANONYMOUS_P (nt
))
16907 error ("%qT is/uses anonymous type", t
);
16909 error ("template argument for %qD uses local type %qT",
16914 /* In order to avoid all sorts of complications, we do not
16915 allow variably-modified types as template arguments. */
16916 else if (variably_modified_type_p (t
, NULL_TREE
))
16918 if (complain
& tf_error
)
16919 error ("%qT is a variably modified type", t
);
16923 /* Class template and alias template arguments should be OK. */
16924 else if (DECL_TYPE_TEMPLATE_P (t
))
16926 /* A non-type argument of integral or enumerated type must be a
16928 else if (TREE_TYPE (t
)
16929 && INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (t
))
16930 && !REFERENCE_REF_P (t
)
16931 && !TREE_CONSTANT (t
))
16933 if (complain
& tf_error
)
16934 error ("integral expression %qE is not constant", t
);
16941 check_instantiated_args (tree tmpl
, tree args
, tsubst_flags_t complain
)
16943 int ix
, len
= DECL_NTPARMS (tmpl
);
16944 bool result
= false;
16946 for (ix
= 0; ix
!= len
; ix
++)
16948 if (check_instantiated_arg (tmpl
, TREE_VEC_ELT (args
, ix
), complain
))
16951 if (result
&& (complain
& tf_error
))
16952 error (" trying to instantiate %qD", tmpl
);
16956 /* We're out of SFINAE context now, so generate diagnostics for the access
16957 errors we saw earlier when instantiating D from TMPL and ARGS. */
16960 recheck_decl_substitution (tree d
, tree tmpl
, tree args
)
16962 tree pattern
= DECL_TEMPLATE_RESULT (tmpl
);
16963 tree type
= TREE_TYPE (pattern
);
16964 location_t loc
= input_location
;
16966 push_access_scope (d
);
16967 push_deferring_access_checks (dk_no_deferred
);
16968 input_location
= DECL_SOURCE_LOCATION (pattern
);
16969 tsubst (type
, args
, tf_warning_or_error
, d
);
16970 input_location
= loc
;
16971 pop_deferring_access_checks ();
16972 pop_access_scope (d
);
16975 /* Instantiate the indicated variable, function, or alias template TMPL with
16976 the template arguments in TARG_PTR. */
16979 instantiate_template_1 (tree tmpl
, tree orig_args
, tsubst_flags_t complain
)
16981 tree targ_ptr
= orig_args
;
16985 bool access_ok
= true;
16987 if (tmpl
== error_mark_node
)
16988 return error_mark_node
;
16990 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
);
16992 /* If this function is a clone, handle it specially. */
16993 if (DECL_CLONED_FUNCTION_P (tmpl
))
16998 /* Use DECL_ABSTRACT_ORIGIN because only FUNCTION_DECLs have
16999 DECL_CLONED_FUNCTION. */
17000 spec
= instantiate_template (DECL_ABSTRACT_ORIGIN (tmpl
),
17001 targ_ptr
, complain
);
17002 if (spec
== error_mark_node
)
17003 return error_mark_node
;
17005 /* Look for the clone. */
17006 FOR_EACH_CLONE (clone
, spec
)
17007 if (DECL_NAME (clone
) == DECL_NAME (tmpl
))
17009 /* We should always have found the clone by now. */
17010 gcc_unreachable ();
17014 if (targ_ptr
== error_mark_node
)
17015 return error_mark_node
;
17017 /* Check to see if we already have this specialization. */
17018 gen_tmpl
= most_general_template (tmpl
);
17019 if (tmpl
!= gen_tmpl
)
17020 /* The TMPL is a partial instantiation. To get a full set of
17021 arguments we must add the arguments used to perform the
17022 partial instantiation. */
17023 targ_ptr
= add_outermost_template_args (DECL_TI_ARGS (tmpl
),
17026 /* It would be nice to avoid hashing here and then again in tsubst_decl,
17027 but it doesn't seem to be on the hot path. */
17028 spec
= retrieve_specialization (gen_tmpl
, targ_ptr
, 0);
17030 gcc_assert (tmpl
== gen_tmpl
17031 || ((fndecl
= retrieve_specialization (tmpl
, orig_args
, 0))
17033 || fndecl
== NULL_TREE
);
17035 if (spec
!= NULL_TREE
)
17037 if (FNDECL_HAS_ACCESS_ERRORS (spec
))
17039 if (complain
& tf_error
)
17040 recheck_decl_substitution (spec
, gen_tmpl
, targ_ptr
);
17041 return error_mark_node
;
17046 if (check_instantiated_args (gen_tmpl
, INNERMOST_TEMPLATE_ARGS (targ_ptr
),
17048 return error_mark_node
;
17050 /* We are building a FUNCTION_DECL, during which the access of its
17051 parameters and return types have to be checked. However this
17052 FUNCTION_DECL which is the desired context for access checking
17053 is not built yet. We solve this chicken-and-egg problem by
17054 deferring all checks until we have the FUNCTION_DECL. */
17055 push_deferring_access_checks (dk_deferred
);
17057 /* Instantiation of the function happens in the context of the function
17058 template, not the context of the overload resolution we're doing. */
17059 push_to_top_level ();
17060 /* If there are dependent arguments, e.g. because we're doing partial
17061 ordering, make sure processing_template_decl stays set. */
17062 if (uses_template_parms (targ_ptr
))
17063 ++processing_template_decl
;
17064 if (DECL_CLASS_SCOPE_P (gen_tmpl
))
17066 tree ctx
= tsubst_aggr_type (DECL_CONTEXT (gen_tmpl
), targ_ptr
,
17067 complain
, gen_tmpl
, true);
17068 push_nested_class (ctx
);
17071 tree pattern
= DECL_TEMPLATE_RESULT (gen_tmpl
);
17073 if (VAR_P (pattern
))
17075 /* We need to determine if we're using a partial or explicit
17076 specialization now, because the type of the variable could be
17078 tree tid
= lookup_template_variable (gen_tmpl
, targ_ptr
);
17079 tree elt
= most_specialized_partial_spec (tid
, complain
);
17080 if (elt
== error_mark_node
)
17081 pattern
= error_mark_node
;
17084 tmpl
= TREE_VALUE (elt
);
17085 pattern
= DECL_TEMPLATE_RESULT (tmpl
);
17086 targ_ptr
= TREE_PURPOSE (elt
);
17090 /* Substitute template parameters to obtain the specialization. */
17091 fndecl
= tsubst (pattern
, targ_ptr
, complain
, gen_tmpl
);
17092 if (DECL_CLASS_SCOPE_P (gen_tmpl
))
17093 pop_nested_class ();
17094 pop_from_top_level ();
17096 if (fndecl
== error_mark_node
)
17098 pop_deferring_access_checks ();
17099 return error_mark_node
;
17102 /* The DECL_TI_TEMPLATE should always be the immediate parent
17103 template, not the most general template. */
17104 DECL_TI_TEMPLATE (fndecl
) = tmpl
;
17105 DECL_TI_ARGS (fndecl
) = targ_ptr
;
17107 /* Now we know the specialization, compute access previously
17109 push_access_scope (fndecl
);
17110 if (!perform_deferred_access_checks (complain
))
17112 pop_access_scope (fndecl
);
17113 pop_deferring_access_checks ();
17115 /* If we've just instantiated the main entry point for a function,
17116 instantiate all the alternate entry points as well. We do this
17117 by cloning the instantiation of the main entry point, not by
17118 instantiating the template clones. */
17119 if (DECL_CHAIN (gen_tmpl
) && DECL_CLONED_FUNCTION_P (DECL_CHAIN (gen_tmpl
)))
17120 clone_function_decl (fndecl
, /*update_method_vec_p=*/0);
17124 if (!(complain
& tf_error
))
17126 /* Remember to reinstantiate when we're out of SFINAE so the user
17127 can see the errors. */
17128 FNDECL_HAS_ACCESS_ERRORS (fndecl
) = true;
17130 return error_mark_node
;
17135 /* Wrapper for instantiate_template_1. */
17138 instantiate_template (tree tmpl
, tree orig_args
, tsubst_flags_t complain
)
17141 timevar_push (TV_TEMPLATE_INST
);
17142 ret
= instantiate_template_1 (tmpl
, orig_args
, complain
);
17143 timevar_pop (TV_TEMPLATE_INST
);
17147 /* Instantiate the alias template TMPL with ARGS. Also push a template
17148 instantiation level, which instantiate_template doesn't do because
17149 functions and variables have sufficient context established by the
17153 instantiate_alias_template (tree tmpl
, tree args
, tsubst_flags_t complain
)
17155 struct pending_template
*old_last_pend
= last_pending_template
;
17156 struct tinst_level
*old_error_tinst
= last_error_tinst_level
;
17157 if (tmpl
== error_mark_node
|| args
== error_mark_node
)
17158 return error_mark_node
;
17159 tree tinst
= build_tree_list (tmpl
, args
);
17160 if (!push_tinst_level (tinst
))
17163 return error_mark_node
;
17167 coerce_innermost_template_parms (DECL_TEMPLATE_PARMS (tmpl
),
17168 args
, tmpl
, complain
,
17169 /*require_all_args=*/true,
17170 /*use_default_args=*/true);
17172 tree r
= instantiate_template (tmpl
, args
, complain
);
17173 pop_tinst_level ();
17174 /* We can't free this if a pending_template entry or last_error_tinst_level
17175 is pointing at it. */
17176 if (last_pending_template
== old_last_pend
17177 && last_error_tinst_level
== old_error_tinst
)
17183 /* PARM is a template parameter pack for FN. Returns true iff
17184 PARM is used in a deducible way in the argument list of FN. */
17187 pack_deducible_p (tree parm
, tree fn
)
17189 tree t
= FUNCTION_FIRST_USER_PARMTYPE (fn
);
17190 for (; t
; t
= TREE_CHAIN (t
))
17192 tree type
= TREE_VALUE (t
);
17194 if (!PACK_EXPANSION_P (type
))
17196 for (packs
= PACK_EXPANSION_PARAMETER_PACKS (type
);
17197 packs
; packs
= TREE_CHAIN (packs
))
17198 if (template_args_equal (TREE_VALUE (packs
), parm
))
17200 /* The template parameter pack is used in a function parameter
17201 pack. If this is the end of the parameter list, the
17202 template parameter pack is deducible. */
17203 if (TREE_CHAIN (t
) == void_list_node
)
17206 /* Otherwise, not. Well, it could be deduced from
17207 a non-pack parameter, but doing so would end up with
17208 a deduction mismatch, so don't bother. */
17212 /* The template parameter pack isn't used in any function parameter
17213 packs, but it might be used deeper, e.g. tuple<Args...>. */
17217 /* The FN is a TEMPLATE_DECL for a function. ARGS is an array with
17218 NARGS elements of the arguments that are being used when calling
17219 it. TARGS is a vector into which the deduced template arguments
17222 Returns either a FUNCTION_DECL for the matching specialization of FN or
17223 NULL_TREE if no suitable specialization can be found. If EXPLAIN_P is
17224 true, diagnostics will be printed to explain why it failed.
17226 If FN is a conversion operator, or we are trying to produce a specific
17227 specialization, RETURN_TYPE is the return type desired.
17229 The EXPLICIT_TARGS are explicit template arguments provided via a
17232 The parameter STRICT is one of:
17235 We are deducing arguments for a function call, as in
17236 [temp.deduct.call]. If RETURN_TYPE is non-null, we are
17237 deducing arguments for a call to the result of a conversion
17238 function template, as in [over.call.object].
17241 We are deducing arguments for a conversion function, as in
17242 [temp.deduct.conv].
17245 We are deducing arguments when doing an explicit instantiation
17246 as in [temp.explicit], when determining an explicit specialization
17247 as in [temp.expl.spec], or when taking the address of a function
17248 template, as in [temp.deduct.funcaddr]. */
17251 fn_type_unification (tree fn
,
17252 tree explicit_targs
,
17255 unsigned int nargs
,
17257 unification_kind_t strict
,
17264 tree decl
= NULL_TREE
;
17265 tsubst_flags_t complain
= (explain_p
? tf_warning_or_error
: tf_none
);
17267 static int deduction_depth
;
17268 struct pending_template
*old_last_pend
= last_pending_template
;
17269 struct tinst_level
*old_error_tinst
= last_error_tinst_level
;
17270 tree tparms
= DECL_INNERMOST_TEMPLATE_PARMS (fn
);
17272 tree r
= error_mark_node
;
17275 complain
|= tf_decltype
;
17277 /* In C++0x, it's possible to have a function template whose type depends
17278 on itself recursively. This is most obvious with decltype, but can also
17279 occur with enumeration scope (c++/48969). So we need to catch infinite
17280 recursion and reject the substitution at deduction time; this function
17281 will return error_mark_node for any repeated substitution.
17283 This also catches excessive recursion such as when f<N> depends on
17284 f<N-1> across all integers, and returns error_mark_node for all the
17285 substitutions back up to the initial one.
17287 This is, of course, not reentrant. */
17288 if (excessive_deduction_depth
)
17289 return error_mark_node
;
17290 tinst
= build_tree_list (fn
, NULL_TREE
);
17293 gcc_assert (TREE_CODE (fn
) == TEMPLATE_DECL
);
17295 fntype
= TREE_TYPE (fn
);
17296 if (explicit_targs
)
17300 The specified template arguments must match the template
17301 parameters in kind (i.e., type, nontype, template), and there
17302 must not be more arguments than there are parameters;
17303 otherwise type deduction fails.
17305 Nontype arguments must match the types of the corresponding
17306 nontype template parameters, or must be convertible to the
17307 types of the corresponding nontype parameters as specified in
17308 _temp.arg.nontype_, otherwise type deduction fails.
17310 All references in the function type of the function template
17311 to the corresponding template parameters are replaced by the
17312 specified template argument values. If a substitution in a
17313 template parameter or in the function type of the function
17314 template results in an invalid type, type deduction fails. */
17315 int i
, len
= TREE_VEC_LENGTH (tparms
);
17316 location_t loc
= input_location
;
17317 bool incomplete
= false;
17319 /* Adjust any explicit template arguments before entering the
17320 substitution context. */
17322 = (coerce_template_parms (tparms
, explicit_targs
, NULL_TREE
,
17324 /*require_all_args=*/false,
17325 /*use_default_args=*/false));
17326 if (explicit_targs
== error_mark_node
)
17329 /* Substitute the explicit args into the function type. This is
17330 necessary so that, for instance, explicitly declared function
17331 arguments can match null pointed constants. If we were given
17332 an incomplete set of explicit args, we must not do semantic
17333 processing during substitution as we could create partial
17335 for (i
= 0; i
< len
; i
++)
17337 tree parm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
17338 bool parameter_pack
= false;
17339 tree targ
= TREE_VEC_ELT (explicit_targs
, i
);
17341 /* Dig out the actual parm. */
17342 if (TREE_CODE (parm
) == TYPE_DECL
17343 || TREE_CODE (parm
) == TEMPLATE_DECL
)
17345 parm
= TREE_TYPE (parm
);
17346 parameter_pack
= TEMPLATE_TYPE_PARAMETER_PACK (parm
);
17348 else if (TREE_CODE (parm
) == PARM_DECL
)
17350 parm
= DECL_INITIAL (parm
);
17351 parameter_pack
= TEMPLATE_PARM_PARAMETER_PACK (parm
);
17354 if (!parameter_pack
&& targ
== NULL_TREE
)
17355 /* No explicit argument for this template parameter. */
17358 if (parameter_pack
&& pack_deducible_p (parm
, fn
))
17360 /* Mark the argument pack as "incomplete". We could
17361 still deduce more arguments during unification.
17362 We remove this mark in type_unification_real. */
17365 ARGUMENT_PACK_INCOMPLETE_P(targ
) = 1;
17366 ARGUMENT_PACK_EXPLICIT_ARGS (targ
)
17367 = ARGUMENT_PACK_ARGS (targ
);
17370 /* We have some incomplete argument packs. */
17375 TREE_VALUE (tinst
) = explicit_targs
;
17376 if (!push_tinst_level (tinst
))
17378 excessive_deduction_depth
= true;
17381 processing_template_decl
+= incomplete
;
17382 input_location
= DECL_SOURCE_LOCATION (fn
);
17383 /* Ignore any access checks; we'll see them again in
17384 instantiate_template and they might have the wrong
17385 access path at this point. */
17386 push_deferring_access_checks (dk_deferred
);
17387 fntype
= tsubst (TREE_TYPE (fn
), explicit_targs
,
17388 complain
| tf_partial
, NULL_TREE
);
17389 pop_deferring_access_checks ();
17390 input_location
= loc
;
17391 processing_template_decl
-= incomplete
;
17392 pop_tinst_level ();
17394 if (fntype
== error_mark_node
)
17397 /* Place the explicitly specified arguments in TARGS. */
17398 for (i
= NUM_TMPL_ARGS (explicit_targs
); i
--;)
17399 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (explicit_targs
, i
);
17402 /* Never do unification on the 'this' parameter. */
17403 parms
= skip_artificial_parms_for (fn
, TYPE_ARG_TYPES (fntype
));
17405 if (return_type
&& strict
== DEDUCE_CALL
)
17407 /* We're deducing for a call to the result of a template conversion
17408 function. The parms we really want are in return_type. */
17409 if (POINTER_TYPE_P (return_type
))
17410 return_type
= TREE_TYPE (return_type
);
17411 parms
= TYPE_ARG_TYPES (return_type
);
17413 else if (return_type
)
17417 parms
= tree_cons (NULL_TREE
, TREE_TYPE (fntype
), parms
);
17418 new_args
= XALLOCAVEC (tree
, nargs
+ 1);
17419 new_args
[0] = return_type
;
17420 memcpy (new_args
+ 1, args
, nargs
* sizeof (tree
));
17425 /* We allow incomplete unification without an error message here
17426 because the standard doesn't seem to explicitly prohibit it. Our
17427 callers must be ready to deal with unification failures in any
17430 TREE_VALUE (tinst
) = targs
;
17431 /* If we aren't explaining yet, push tinst context so we can see where
17432 any errors (e.g. from class instantiations triggered by instantiation
17433 of default template arguments) come from. If we are explaining, this
17434 context is redundant. */
17435 if (!explain_p
&& !push_tinst_level (tinst
))
17437 excessive_deduction_depth
= true;
17441 /* type_unification_real will pass back any access checks from default
17442 template argument substitution. */
17443 vec
<deferred_access_check
, va_gc
> *checks
;
17446 ok
= !type_unification_real (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
17447 targs
, parms
, args
, nargs
, /*subr=*/0,
17448 strict
, flags
, &checks
, explain_p
);
17450 pop_tinst_level ();
17454 /* Now that we have bindings for all of the template arguments,
17455 ensure that the arguments deduced for the template template
17456 parameters have compatible template parameter lists. We cannot
17457 check this property before we have deduced all template
17458 arguments, because the template parameter types of a template
17459 template parameter might depend on prior template parameters
17460 deduced after the template template parameter. The following
17461 ill-formed example illustrates this issue:
17463 template<typename T, template<T> class C> void f(C<5>, T);
17465 template<int N> struct X {};
17468 f(X<5>(), 5l); // error: template argument deduction fails
17471 The template parameter list of 'C' depends on the template type
17472 parameter 'T', but 'C' is deduced to 'X' before 'T' is deduced to
17473 'long'. Thus, we can't check that 'C' cannot bind to 'X' at the
17474 time that we deduce 'C'. */
17475 if (!template_template_parm_bindings_ok_p
17476 (DECL_INNERMOST_TEMPLATE_PARMS (fn
), targs
))
17478 unify_inconsistent_template_template_parameters (explain_p
);
17482 /* All is well so far. Now, check:
17486 When all template arguments have been deduced, all uses of
17487 template parameters in nondeduced contexts are replaced with
17488 the corresponding deduced argument values. If the
17489 substitution results in an invalid type, as described above,
17490 type deduction fails. */
17491 TREE_VALUE (tinst
) = targs
;
17492 if (!push_tinst_level (tinst
))
17494 excessive_deduction_depth
= true;
17498 /* Also collect access checks from the instantiation. */
17499 reopen_deferring_access_checks (checks
);
17501 decl
= instantiate_template (fn
, targs
, complain
);
17503 checks
= get_deferred_access_checks ();
17504 pop_deferring_access_checks ();
17506 pop_tinst_level ();
17508 if (decl
== error_mark_node
)
17511 /* Now perform any access checks encountered during substitution. */
17512 push_access_scope (decl
);
17513 ok
= perform_access_checks (checks
, complain
);
17514 pop_access_scope (decl
);
17518 /* If we're looking for an exact match, check that what we got
17519 is indeed an exact match. It might not be if some template
17520 parameters are used in non-deduced contexts. But don't check
17521 for an exact match if we have dependent template arguments;
17522 in that case we're doing partial ordering, and we already know
17523 that we have two candidates that will provide the actual type. */
17524 if (strict
== DEDUCE_EXACT
&& !any_dependent_template_arguments_p (targs
))
17526 tree substed
= TREE_TYPE (decl
);
17530 = skip_artificial_parms_for (decl
, TYPE_ARG_TYPES (substed
));
17532 sarg
= tree_cons (NULL_TREE
, TREE_TYPE (substed
), sarg
);
17533 for (i
= 0; i
< nargs
&& sarg
; ++i
, sarg
= TREE_CHAIN (sarg
))
17534 if (!same_type_p (args
[i
], TREE_VALUE (sarg
)))
17536 unify_type_mismatch (explain_p
, args
[i
],
17537 TREE_VALUE (sarg
));
17546 if (excessive_deduction_depth
)
17548 if (deduction_depth
== 0)
17549 /* Reset once we're all the way out. */
17550 excessive_deduction_depth
= false;
17553 /* We can't free this if a pending_template entry or last_error_tinst_level
17554 is pointing at it. */
17555 if (last_pending_template
== old_last_pend
17556 && last_error_tinst_level
== old_error_tinst
)
17562 /* Adjust types before performing type deduction, as described in
17563 [temp.deduct.call] and [temp.deduct.conv]. The rules in these two
17564 sections are symmetric. PARM is the type of a function parameter
17565 or the return type of the conversion function. ARG is the type of
17566 the argument passed to the call, or the type of the value
17567 initialized with the result of the conversion function.
17568 ARG_EXPR is the original argument expression, which may be null. */
17571 maybe_adjust_types_for_deduction (unification_kind_t strict
,
17584 /* Swap PARM and ARG throughout the remainder of this
17585 function; the handling is precisely symmetric since PARM
17586 will initialize ARG rather than vice versa. */
17587 std::swap (parm
, arg
);
17591 /* Core issue #873: Do the DR606 thing (see below) for these cases,
17592 too, but here handle it by stripping the reference from PARM
17593 rather than by adding it to ARG. */
17594 if (TREE_CODE (*parm
) == REFERENCE_TYPE
17595 && TYPE_REF_IS_RVALUE (*parm
)
17596 && TREE_CODE (TREE_TYPE (*parm
)) == TEMPLATE_TYPE_PARM
17597 && cp_type_quals (TREE_TYPE (*parm
)) == TYPE_UNQUALIFIED
17598 && TREE_CODE (*arg
) == REFERENCE_TYPE
17599 && !TYPE_REF_IS_RVALUE (*arg
))
17600 *parm
= TREE_TYPE (*parm
);
17601 /* Nothing else to do in this case. */
17605 gcc_unreachable ();
17608 if (TREE_CODE (*parm
) != REFERENCE_TYPE
)
17610 /* [temp.deduct.call]
17612 If P is not a reference type:
17614 --If A is an array type, the pointer type produced by the
17615 array-to-pointer standard conversion (_conv.array_) is
17616 used in place of A for type deduction; otherwise,
17618 --If A is a function type, the pointer type produced by
17619 the function-to-pointer standard conversion
17620 (_conv.func_) is used in place of A for type deduction;
17623 --If A is a cv-qualified type, the top level
17624 cv-qualifiers of A's type are ignored for type
17626 if (TREE_CODE (*arg
) == ARRAY_TYPE
)
17627 *arg
= build_pointer_type (TREE_TYPE (*arg
));
17628 else if (TREE_CODE (*arg
) == FUNCTION_TYPE
)
17629 *arg
= build_pointer_type (*arg
);
17631 *arg
= TYPE_MAIN_VARIANT (*arg
);
17634 /* From C++0x [14.8.2.1/3 temp.deduct.call] (after DR606), "If P is
17635 of the form T&&, where T is a template parameter, and the argument
17636 is an lvalue, T is deduced as A& */
17637 if (TREE_CODE (*parm
) == REFERENCE_TYPE
17638 && TYPE_REF_IS_RVALUE (*parm
)
17639 && TREE_CODE (TREE_TYPE (*parm
)) == TEMPLATE_TYPE_PARM
17640 && cp_type_quals (TREE_TYPE (*parm
)) == TYPE_UNQUALIFIED
17641 && (arg_expr
? real_lvalue_p (arg_expr
)
17642 /* try_one_overload doesn't provide an arg_expr, but
17643 functions are always lvalues. */
17644 : TREE_CODE (*arg
) == FUNCTION_TYPE
))
17645 *arg
= build_reference_type (*arg
);
17647 /* [temp.deduct.call]
17649 If P is a cv-qualified type, the top level cv-qualifiers
17650 of P's type are ignored for type deduction. If P is a
17651 reference type, the type referred to by P is used for
17653 *parm
= TYPE_MAIN_VARIANT (*parm
);
17654 if (TREE_CODE (*parm
) == REFERENCE_TYPE
)
17656 *parm
= TREE_TYPE (*parm
);
17657 result
|= UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
17660 /* DR 322. For conversion deduction, remove a reference type on parm
17661 too (which has been swapped into ARG). */
17662 if (strict
== DEDUCE_CONV
&& TREE_CODE (*arg
) == REFERENCE_TYPE
)
17663 *arg
= TREE_TYPE (*arg
);
17668 /* Subroutine of unify_one_argument. PARM is a function parameter of a
17669 template which does contain any deducible template parameters; check if
17670 ARG is a suitable match for it. STRICT, FLAGS and EXPLAIN_P are as in
17671 unify_one_argument. */
17674 check_non_deducible_conversion (tree parm
, tree arg
, int strict
,
17675 int flags
, bool explain_p
)
17680 type
= TREE_TYPE (arg
);
17684 if (same_type_p (parm
, type
))
17685 return unify_success (explain_p
);
17687 if (strict
== DEDUCE_CONV
)
17689 if (can_convert_arg (type
, parm
, NULL_TREE
, flags
,
17690 explain_p
? tf_warning_or_error
: tf_none
))
17691 return unify_success (explain_p
);
17693 else if (strict
!= DEDUCE_EXACT
)
17695 if (can_convert_arg (parm
, type
,
17696 TYPE_P (arg
) ? NULL_TREE
: arg
,
17697 flags
, explain_p
? tf_warning_or_error
: tf_none
))
17698 return unify_success (explain_p
);
17701 if (strict
== DEDUCE_EXACT
)
17702 return unify_type_mismatch (explain_p
, parm
, arg
);
17704 return unify_arg_conversion (explain_p
, parm
, type
, arg
);
17707 static bool uses_deducible_template_parms (tree type
);
17709 /* Returns true iff the expression EXPR is one from which a template
17710 argument can be deduced. In other words, if it's an undecorated
17711 use of a template non-type parameter. */
17714 deducible_expression (tree expr
)
17716 return (TREE_CODE (expr
) == TEMPLATE_PARM_INDEX
);
17719 /* Returns true iff the array domain DOMAIN uses a template parameter in a
17720 deducible way; that is, if it has a max value of <PARM> - 1. */
17723 deducible_array_bound (tree domain
)
17725 if (domain
== NULL_TREE
)
17728 tree max
= TYPE_MAX_VALUE (domain
);
17729 if (TREE_CODE (max
) != MINUS_EXPR
)
17732 return deducible_expression (TREE_OPERAND (max
, 0));
17735 /* Returns true iff the template arguments ARGS use a template parameter
17736 in a deducible way. */
17739 deducible_template_args (tree args
)
17741 for (int i
= 0; i
< TREE_VEC_LENGTH (args
); ++i
)
17744 tree elt
= TREE_VEC_ELT (args
, i
);
17745 if (ARGUMENT_PACK_P (elt
))
17746 deducible
= deducible_template_args (ARGUMENT_PACK_ARGS (elt
));
17749 if (PACK_EXPANSION_P (elt
))
17750 elt
= PACK_EXPANSION_PATTERN (elt
);
17751 if (TREE_CODE (elt
) == TEMPLATE_TEMPLATE_PARM
)
17753 else if (TYPE_P (elt
))
17754 deducible
= uses_deducible_template_parms (elt
);
17756 deducible
= deducible_expression (elt
);
17764 /* Returns true iff TYPE contains any deducible references to template
17765 parameters, as per 14.8.2.5. */
17768 uses_deducible_template_parms (tree type
)
17770 if (PACK_EXPANSION_P (type
))
17771 type
= PACK_EXPANSION_PATTERN (type
);
17778 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
17779 || TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
17785 if (POINTER_TYPE_P (type
))
17786 return uses_deducible_template_parms (TREE_TYPE (type
));
17788 /* T[integer-constant ]
17790 if (TREE_CODE (type
) == ARRAY_TYPE
)
17791 return (uses_deducible_template_parms (TREE_TYPE (type
))
17792 || deducible_array_bound (TYPE_DOMAIN (type
)));
17804 if (TYPE_PTRMEM_P (type
))
17805 return (uses_deducible_template_parms (TYPE_PTRMEM_CLASS_TYPE (type
))
17806 || (uses_deducible_template_parms
17807 (TYPE_PTRMEM_POINTED_TO_TYPE (type
))));
17809 /* template-name <T> (where template-name refers to a class template)
17810 template-name <i> (where template-name refers to a class template) */
17811 if (CLASS_TYPE_P (type
)
17812 && CLASSTYPE_TEMPLATE_INFO (type
)
17813 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (type
)))
17814 return deducible_template_args (INNERMOST_TEMPLATE_ARGS
17815 (CLASSTYPE_TI_ARGS (type
)));
17820 if (TREE_CODE (type
) == FUNCTION_TYPE
17821 || TREE_CODE (type
) == METHOD_TYPE
)
17823 if (uses_deducible_template_parms (TREE_TYPE (type
)))
17825 tree parm
= TYPE_ARG_TYPES (type
);
17826 if (TREE_CODE (type
) == METHOD_TYPE
)
17827 parm
= TREE_CHAIN (parm
);
17828 for (; parm
; parm
= TREE_CHAIN (parm
))
17829 if (uses_deducible_template_parms (TREE_VALUE (parm
)))
17836 /* Subroutine of type_unification_real and unify_pack_expansion to
17837 handle unification of a single P/A pair. Parameters are as
17838 for those functions. */
17841 unify_one_argument (tree tparms
, tree targs
, tree parm
, tree arg
,
17842 int subr
, unification_kind_t strict
,
17845 tree arg_expr
= NULL_TREE
;
17848 if (arg
== error_mark_node
|| parm
== error_mark_node
)
17849 return unify_invalid (explain_p
);
17850 if (arg
== unknown_type_node
)
17851 /* We can't deduce anything from this, but we might get all the
17852 template args from other function args. */
17853 return unify_success (explain_p
);
17855 /* Implicit conversions (Clause 4) will be performed on a function
17856 argument to convert it to the type of the corresponding function
17857 parameter if the parameter type contains no template-parameters that
17858 participate in template argument deduction. */
17859 if (strict
!= DEDUCE_EXACT
17860 && TYPE_P (parm
) && !uses_deducible_template_parms (parm
))
17861 /* For function parameters with no deducible template parameters,
17862 just return. We'll check non-dependent conversions later. */
17863 return unify_success (explain_p
);
17868 arg_strict
= (UNIFY_ALLOW_OUTER_LEVEL
17869 | UNIFY_ALLOW_MORE_CV_QUAL
17870 | UNIFY_ALLOW_DERIVED
);
17874 arg_strict
= UNIFY_ALLOW_LESS_CV_QUAL
;
17878 arg_strict
= UNIFY_ALLOW_NONE
;
17882 gcc_unreachable ();
17885 /* We only do these transformations if this is the top-level
17886 parameter_type_list in a call or declaration matching; in other
17887 situations (nested function declarators, template argument lists) we
17888 won't be comparing a type to an expression, and we don't do any type
17894 gcc_assert (TREE_TYPE (arg
) != NULL_TREE
);
17895 if (type_unknown_p (arg
))
17897 /* [temp.deduct.type] A template-argument can be
17898 deduced from a pointer to function or pointer
17899 to member function argument if the set of
17900 overloaded functions does not contain function
17901 templates and at most one of a set of
17902 overloaded functions provides a unique
17905 if (resolve_overloaded_unification
17906 (tparms
, targs
, parm
, arg
, strict
,
17907 arg_strict
, explain_p
))
17908 return unify_success (explain_p
);
17909 return unify_overload_resolution_failure (explain_p
, arg
);
17913 arg
= unlowered_expr_type (arg
);
17914 if (arg
== error_mark_node
)
17915 return unify_invalid (explain_p
);
17919 maybe_adjust_types_for_deduction (strict
, &parm
, &arg
, arg_expr
);
17922 if ((TYPE_P (parm
) || TREE_CODE (parm
) == TEMPLATE_DECL
)
17923 != (TYPE_P (arg
) || TREE_CODE (arg
) == TEMPLATE_DECL
))
17924 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
17926 /* For deduction from an init-list we need the actual list. */
17927 if (arg_expr
&& BRACE_ENCLOSED_INITIALIZER_P (arg_expr
))
17929 return unify (tparms
, targs
, parm
, arg
, arg_strict
, explain_p
);
17932 /* Most parms like fn_type_unification.
17934 If SUBR is 1, we're being called recursively (to unify the
17935 arguments of a function or method parameter of a function
17938 CHECKS is a pointer to a vector of access checks encountered while
17939 substituting default template arguments. */
17942 type_unification_real (tree tparms
,
17946 unsigned int xnargs
,
17948 unification_kind_t strict
,
17950 vec
<deferred_access_check
, va_gc
> **checks
,
17955 int ntparms
= TREE_VEC_LENGTH (tparms
);
17956 int saw_undeduced
= 0;
17959 unsigned int nargs
;
17962 gcc_assert (TREE_CODE (tparms
) == TREE_VEC
);
17963 gcc_assert (xparms
== NULL_TREE
|| TREE_CODE (xparms
) == TREE_LIST
);
17964 gcc_assert (ntparms
> 0);
17966 /* Reset the number of non-defaulted template arguments contained
17968 NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
) = NULL_TREE
;
17976 while (parms
&& parms
!= void_list_node
17979 parm
= TREE_VALUE (parms
);
17981 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
17982 && (!TREE_CHAIN (parms
) || TREE_CHAIN (parms
) == void_list_node
))
17983 /* For a function parameter pack that occurs at the end of the
17984 parameter-declaration-list, the type A of each remaining
17985 argument of the call is compared with the type P of the
17986 declarator-id of the function parameter pack. */
17989 parms
= TREE_CHAIN (parms
);
17991 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
)
17992 /* For a function parameter pack that does not occur at the
17993 end of the parameter-declaration-list, the type of the
17994 parameter pack is a non-deduced context. */
18000 if (unify_one_argument (tparms
, targs
, parm
, arg
, subr
, strict
,
18006 && parms
!= void_list_node
18007 && TREE_CODE (TREE_VALUE (parms
)) == TYPE_PACK_EXPANSION
)
18009 /* Unify the remaining arguments with the pack expansion type. */
18011 tree parmvec
= make_tree_vec (1);
18013 /* Allocate a TREE_VEC and copy in all of the arguments */
18014 argvec
= make_tree_vec (nargs
- ia
);
18015 for (i
= 0; ia
< nargs
; ++ia
, ++i
)
18016 TREE_VEC_ELT (argvec
, i
) = args
[ia
];
18018 /* Copy the parameter into parmvec. */
18019 TREE_VEC_ELT (parmvec
, 0) = TREE_VALUE (parms
);
18020 if (unify_pack_expansion (tparms
, targs
, parmvec
, argvec
, strict
,
18021 /*subr=*/subr
, explain_p
))
18024 /* Advance to the end of the list of parameters. */
18025 parms
= TREE_CHAIN (parms
);
18028 /* Fail if we've reached the end of the parm list, and more args
18029 are present, and the parm list isn't variadic. */
18030 if (ia
< nargs
&& parms
== void_list_node
)
18031 return unify_too_many_arguments (explain_p
, nargs
, ia
);
18032 /* Fail if parms are left and they don't have default values and
18033 they aren't all deduced as empty packs (c++/57397). This is
18034 consistent with sufficient_parms_p. */
18035 if (parms
&& parms
!= void_list_node
18036 && TREE_PURPOSE (parms
) == NULL_TREE
)
18038 unsigned int count
= nargs
;
18043 type_pack_p
= TREE_CODE (TREE_VALUE (p
)) == TYPE_PACK_EXPANSION
;
18046 p
= TREE_CHAIN (p
);
18048 while (p
&& p
!= void_list_node
);
18049 if (count
!= nargs
)
18050 return unify_too_few_arguments (explain_p
, ia
, count
,
18056 tsubst_flags_t complain
= (explain_p
18057 ? tf_warning_or_error
18060 for (i
= 0; i
< ntparms
; i
++)
18062 tree targ
= TREE_VEC_ELT (targs
, i
);
18063 tree tparm
= TREE_VEC_ELT (tparms
, i
);
18065 /* Clear the "incomplete" flags on all argument packs now so that
18066 substituting them into later default arguments works. */
18067 if (targ
&& ARGUMENT_PACK_P (targ
))
18069 ARGUMENT_PACK_INCOMPLETE_P (targ
) = 0;
18070 ARGUMENT_PACK_EXPLICIT_ARGS (targ
) = NULL_TREE
;
18073 if (targ
|| tparm
== error_mark_node
)
18075 tparm
= TREE_VALUE (tparm
);
18077 /* If this is an undeduced nontype parameter that depends on
18078 a type parameter, try another pass; its type may have been
18079 deduced from a later argument than the one from which
18080 this parameter can be deduced. */
18081 if (TREE_CODE (tparm
) == PARM_DECL
18082 && uses_template_parms (TREE_TYPE (tparm
))
18083 && saw_undeduced
< 2)
18089 /* Core issue #226 (C++0x) [temp.deduct]:
18091 If a template argument has not been deduced, its
18092 default template argument, if any, is used.
18094 When we are in C++98 mode, TREE_PURPOSE will either
18095 be NULL_TREE or ERROR_MARK_NODE, so we do not need
18096 to explicitly check cxx_dialect here. */
18097 if (TREE_PURPOSE (TREE_VEC_ELT (tparms
, i
)))
18098 /* OK, there is a default argument. Wait until after the
18099 conversion check to do substitution. */
18102 /* If the type parameter is a parameter pack, then it will
18103 be deduced to an empty parameter pack. */
18104 if (template_parameter_pack_p (tparm
))
18108 if (TREE_CODE (tparm
) == TEMPLATE_PARM_INDEX
)
18110 arg
= make_node (NONTYPE_ARGUMENT_PACK
);
18111 TREE_TYPE (arg
) = TREE_TYPE (TEMPLATE_PARM_DECL (tparm
));
18112 TREE_CONSTANT (arg
) = 1;
18115 arg
= cxx_make_type (TYPE_ARGUMENT_PACK
);
18117 SET_ARGUMENT_PACK_ARGS (arg
, make_tree_vec (0));
18119 TREE_VEC_ELT (targs
, i
) = arg
;
18123 return unify_parameter_deduction_failure (explain_p
, tparm
);
18126 /* DR 1391: All parameters have args, now check non-dependent parms for
18128 if (saw_undeduced
< 2)
18129 for (ia
= 0, parms
= xparms
, args
= xargs
, nargs
= xnargs
;
18130 parms
&& parms
!= void_list_node
&& ia
< nargs
; )
18132 parm
= TREE_VALUE (parms
);
18134 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
18135 && (!TREE_CHAIN (parms
)
18136 || TREE_CHAIN (parms
) == void_list_node
))
18137 /* For a function parameter pack that occurs at the end of the
18138 parameter-declaration-list, the type A of each remaining
18139 argument of the call is compared with the type P of the
18140 declarator-id of the function parameter pack. */
18143 parms
= TREE_CHAIN (parms
);
18145 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
)
18146 /* For a function parameter pack that does not occur at the
18147 end of the parameter-declaration-list, the type of the
18148 parameter pack is a non-deduced context. */
18154 if (uses_template_parms (parm
))
18156 if (check_non_deducible_conversion (parm
, arg
, strict
, flags
,
18161 /* Now substitute into the default template arguments. */
18162 for (i
= 0; i
< ntparms
; i
++)
18164 tree targ
= TREE_VEC_ELT (targs
, i
);
18165 tree tparm
= TREE_VEC_ELT (tparms
, i
);
18167 if (targ
|| tparm
== error_mark_node
)
18169 tree parm
= TREE_VALUE (tparm
);
18171 if (TREE_CODE (parm
) == PARM_DECL
18172 && uses_template_parms (TREE_TYPE (parm
))
18173 && saw_undeduced
< 2)
18176 tree arg
= TREE_PURPOSE (tparm
);
18177 reopen_deferring_access_checks (*checks
);
18178 location_t save_loc
= input_location
;
18180 input_location
= DECL_SOURCE_LOCATION (parm
);
18181 arg
= tsubst_template_arg (arg
, targs
, complain
, NULL_TREE
);
18182 arg
= convert_template_argument (parm
, arg
, targs
, complain
,
18184 input_location
= save_loc
;
18185 *checks
= get_deferred_access_checks ();
18186 pop_deferring_access_checks ();
18187 if (arg
== error_mark_node
)
18191 TREE_VEC_ELT (targs
, i
) = arg
;
18192 /* The position of the first default template argument,
18193 is also the number of non-defaulted arguments in TARGS.
18195 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
))
18196 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
, i
);
18201 if (saw_undeduced
++ == 1)
18204 #ifdef ENABLE_CHECKING
18205 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
))
18206 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
, TREE_VEC_LENGTH (targs
));
18209 return unify_success (explain_p
);
18212 /* Subroutine of type_unification_real. Args are like the variables
18213 at the call site. ARG is an overloaded function (or template-id);
18214 we try deducing template args from each of the overloads, and if
18215 only one succeeds, we go with that. Modifies TARGS and returns
18216 true on success. */
18219 resolve_overloaded_unification (tree tparms
,
18223 unification_kind_t strict
,
18227 tree tempargs
= copy_node (targs
);
18229 tree goodfn
= NULL_TREE
;
18232 if (TREE_CODE (arg
) == ADDR_EXPR
)
18234 arg
= TREE_OPERAND (arg
, 0);
18240 if (TREE_CODE (arg
) == COMPONENT_REF
)
18241 /* Handle `&x' where `x' is some static or non-static member
18243 arg
= TREE_OPERAND (arg
, 1);
18245 if (TREE_CODE (arg
) == OFFSET_REF
)
18246 arg
= TREE_OPERAND (arg
, 1);
18248 /* Strip baselink information. */
18249 if (BASELINK_P (arg
))
18250 arg
= BASELINK_FUNCTIONS (arg
);
18252 if (TREE_CODE (arg
) == TEMPLATE_ID_EXPR
)
18254 /* If we got some explicit template args, we need to plug them into
18255 the affected templates before we try to unify, in case the
18256 explicit args will completely resolve the templates in question. */
18259 tree expl_subargs
= TREE_OPERAND (arg
, 1);
18260 arg
= TREE_OPERAND (arg
, 0);
18262 for (; arg
; arg
= OVL_NEXT (arg
))
18264 tree fn
= OVL_CURRENT (arg
);
18265 tree subargs
, elem
;
18267 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
18270 subargs
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
18271 expl_subargs
, NULL_TREE
, tf_none
,
18272 /*require_all_args=*/true,
18273 /*use_default_args=*/true);
18274 if (subargs
!= error_mark_node
18275 && !any_dependent_template_arguments_p (subargs
))
18277 elem
= TREE_TYPE (instantiate_template (fn
, subargs
, tf_none
));
18278 if (try_one_overload (tparms
, targs
, tempargs
, parm
,
18279 elem
, strict
, sub_strict
, addr_p
, explain_p
)
18280 && (!goodfn
|| !same_type_p (goodfn
, elem
)))
18289 /* If no templates (or more than one) are fully resolved by the
18290 explicit arguments, this template-id is a non-deduced context; it
18291 could still be OK if we deduce all template arguments for the
18292 enclosing call through other arguments. */
18296 else if (TREE_CODE (arg
) != OVERLOAD
18297 && TREE_CODE (arg
) != FUNCTION_DECL
)
18298 /* If ARG is, for example, "(0, &f)" then its type will be unknown
18299 -- but the deduction does not succeed because the expression is
18300 not just the function on its own. */
18303 for (; arg
; arg
= OVL_NEXT (arg
))
18304 if (try_one_overload (tparms
, targs
, tempargs
, parm
,
18305 TREE_TYPE (OVL_CURRENT (arg
)),
18306 strict
, sub_strict
, addr_p
, explain_p
)
18307 && (!goodfn
|| !decls_match (goodfn
, OVL_CURRENT (arg
))))
18309 goodfn
= OVL_CURRENT (arg
);
18313 /* [temp.deduct.type] A template-argument can be deduced from a pointer
18314 to function or pointer to member function argument if the set of
18315 overloaded functions does not contain function templates and at most
18316 one of a set of overloaded functions provides a unique match.
18318 So if we found multiple possibilities, we return success but don't
18319 deduce anything. */
18323 int i
= TREE_VEC_LENGTH (targs
);
18325 if (TREE_VEC_ELT (tempargs
, i
))
18327 tree old
= TREE_VEC_ELT (targs
, i
);
18328 tree new_
= TREE_VEC_ELT (tempargs
, i
);
18329 if (new_
&& old
&& ARGUMENT_PACK_P (old
)
18330 && ARGUMENT_PACK_EXPLICIT_ARGS (old
))
18331 /* Don't forget explicit template arguments in a pack. */
18332 ARGUMENT_PACK_EXPLICIT_ARGS (new_
)
18333 = ARGUMENT_PACK_EXPLICIT_ARGS (old
);
18334 TREE_VEC_ELT (targs
, i
) = new_
;
18343 /* Core DR 115: In contexts where deduction is done and fails, or in
18344 contexts where deduction is not done, if a template argument list is
18345 specified and it, along with any default template arguments, identifies
18346 a single function template specialization, then the template-id is an
18347 lvalue for the function template specialization. */
18350 resolve_nondeduced_context (tree orig_expr
)
18352 tree expr
, offset
, baselink
;
18355 if (!type_unknown_p (orig_expr
))
18360 offset
= NULL_TREE
;
18361 baselink
= NULL_TREE
;
18363 if (TREE_CODE (expr
) == ADDR_EXPR
)
18365 expr
= TREE_OPERAND (expr
, 0);
18368 if (TREE_CODE (expr
) == OFFSET_REF
)
18371 expr
= TREE_OPERAND (expr
, 1);
18373 if (BASELINK_P (expr
))
18376 expr
= BASELINK_FUNCTIONS (expr
);
18379 if (TREE_CODE (expr
) == TEMPLATE_ID_EXPR
)
18382 tree goodfn
= NULL_TREE
;
18384 /* If we got some explicit template args, we need to plug them into
18385 the affected templates before we try to unify, in case the
18386 explicit args will completely resolve the templates in question. */
18388 tree expl_subargs
= TREE_OPERAND (expr
, 1);
18389 tree arg
= TREE_OPERAND (expr
, 0);
18390 tree badfn
= NULL_TREE
;
18391 tree badargs
= NULL_TREE
;
18393 for (; arg
; arg
= OVL_NEXT (arg
))
18395 tree fn
= OVL_CURRENT (arg
);
18396 tree subargs
, elem
;
18398 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
18401 subargs
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
18402 expl_subargs
, NULL_TREE
, tf_none
,
18403 /*require_all_args=*/true,
18404 /*use_default_args=*/true);
18405 if (subargs
!= error_mark_node
18406 && !any_dependent_template_arguments_p (subargs
))
18408 elem
= instantiate_template (fn
, subargs
, tf_none
);
18409 if (elem
== error_mark_node
)
18414 else if (elem
&& (!goodfn
|| !decls_match (goodfn
, elem
)))
18423 mark_used (goodfn
);
18426 expr
= build_baselink (BASELINK_BINFO (baselink
),
18427 BASELINK_ACCESS_BINFO (baselink
),
18428 expr
, BASELINK_OPTYPE (baselink
));
18432 = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (offset
, 0)));
18433 expr
= build_offset_ref (base
, expr
, addr
, tf_warning_or_error
);
18436 expr
= cp_build_addr_expr (expr
, tf_warning_or_error
);
18439 else if (good
== 0 && badargs
)
18440 /* There were no good options and at least one bad one, so let the
18441 user know what the problem is. */
18442 instantiate_template (badfn
, badargs
, tf_warning_or_error
);
18447 /* Subroutine of resolve_overloaded_unification; does deduction for a single
18448 overload. Fills TARGS with any deduced arguments, or error_mark_node if
18449 different overloads deduce different arguments for a given parm.
18450 ADDR_P is true if the expression for which deduction is being
18451 performed was of the form "& fn" rather than simply "fn".
18453 Returns 1 on success. */
18456 try_one_overload (tree tparms
,
18461 unification_kind_t strict
,
18470 if (arg
== error_mark_node
)
18473 /* [temp.deduct.type] A template-argument can be deduced from a pointer
18474 to function or pointer to member function argument if the set of
18475 overloaded functions does not contain function templates and at most
18476 one of a set of overloaded functions provides a unique match.
18478 So if this is a template, just return success. */
18480 if (uses_template_parms (arg
))
18483 if (TREE_CODE (arg
) == METHOD_TYPE
)
18484 arg
= build_ptrmemfunc_type (build_pointer_type (arg
));
18486 arg
= build_pointer_type (arg
);
18488 sub_strict
|= maybe_adjust_types_for_deduction (strict
, &parm
, &arg
, NULL
);
18490 /* We don't copy orig_targs for this because if we have already deduced
18491 some template args from previous args, unify would complain when we
18492 try to deduce a template parameter for the same argument, even though
18493 there isn't really a conflict. */
18494 nargs
= TREE_VEC_LENGTH (targs
);
18495 tempargs
= make_tree_vec (nargs
);
18497 if (unify (tparms
, tempargs
, parm
, arg
, sub_strict
, explain_p
))
18500 /* First make sure we didn't deduce anything that conflicts with
18501 explicitly specified args. */
18502 for (i
= nargs
; i
--; )
18504 tree elt
= TREE_VEC_ELT (tempargs
, i
);
18505 tree oldelt
= TREE_VEC_ELT (orig_targs
, i
);
18509 else if (uses_template_parms (elt
))
18510 /* Since we're unifying against ourselves, we will fill in
18511 template args used in the function parm list with our own
18512 template parms. Discard them. */
18513 TREE_VEC_ELT (tempargs
, i
) = NULL_TREE
;
18514 else if (oldelt
&& !template_args_equal (oldelt
, elt
))
18518 for (i
= nargs
; i
--; )
18520 tree elt
= TREE_VEC_ELT (tempargs
, i
);
18523 TREE_VEC_ELT (targs
, i
) = elt
;
18529 /* PARM is a template class (perhaps with unbound template
18530 parameters). ARG is a fully instantiated type. If ARG can be
18531 bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and
18532 TARGS are as for unify. */
18535 try_class_unification (tree tparms
, tree targs
, tree parm
, tree arg
,
18538 tree copy_of_targs
;
18540 if (!CLASSTYPE_TEMPLATE_INFO (arg
)
18541 || (most_general_template (CLASSTYPE_TI_TEMPLATE (arg
))
18542 != most_general_template (CLASSTYPE_TI_TEMPLATE (parm
))))
18545 /* We need to make a new template argument vector for the call to
18546 unify. If we used TARGS, we'd clutter it up with the result of
18547 the attempted unification, even if this class didn't work out.
18548 We also don't want to commit ourselves to all the unifications
18549 we've already done, since unification is supposed to be done on
18550 an argument-by-argument basis. In other words, consider the
18551 following pathological case:
18553 template <int I, int J, int K>
18556 template <int I, int J>
18557 struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {};
18559 template <int I, int J, int K>
18560 void f(S<I, J, K>, S<I, I, I>);
18569 Now, by the time we consider the unification involving `s2', we
18570 already know that we must have `f<0, 0, 0>'. But, even though
18571 `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is invalid
18572 because there are two ways to unify base classes of S<0, 1, 2>
18573 with S<I, I, I>. If we kept the already deduced knowledge, we
18574 would reject the possibility I=1. */
18575 copy_of_targs
= make_tree_vec (TREE_VEC_LENGTH (targs
));
18577 /* If unification failed, we're done. */
18578 if (unify (tparms
, copy_of_targs
, CLASSTYPE_TI_ARGS (parm
),
18579 CLASSTYPE_TI_ARGS (arg
), UNIFY_ALLOW_NONE
, explain_p
))
18585 /* Given a template type PARM and a class type ARG, find the unique
18586 base type in ARG that is an instance of PARM. We do not examine
18587 ARG itself; only its base-classes. If there is not exactly one
18588 appropriate base class, return NULL_TREE. PARM may be the type of
18589 a partial specialization, as well as a plain template type. Used
18592 static enum template_base_result
18593 get_template_base (tree tparms
, tree targs
, tree parm
, tree arg
,
18594 bool explain_p
, tree
*result
)
18596 tree rval
= NULL_TREE
;
18599 gcc_assert (RECORD_OR_UNION_CODE_P (TREE_CODE (arg
)));
18601 binfo
= TYPE_BINFO (complete_type (arg
));
18604 /* The type could not be completed. */
18605 *result
= NULL_TREE
;
18606 return tbr_incomplete_type
;
18609 /* Walk in inheritance graph order. The search order is not
18610 important, and this avoids multiple walks of virtual bases. */
18611 for (binfo
= TREE_CHAIN (binfo
); binfo
; binfo
= TREE_CHAIN (binfo
))
18613 tree r
= try_class_unification (tparms
, targs
, parm
,
18614 BINFO_TYPE (binfo
), explain_p
);
18618 /* If there is more than one satisfactory baseclass, then:
18622 If they yield more than one possible deduced A, the type
18626 if (rval
&& !same_type_p (r
, rval
))
18628 *result
= NULL_TREE
;
18629 return tbr_ambiguous_baseclass
;
18637 return tbr_success
;
18640 /* Returns the level of DECL, which declares a template parameter. */
18643 template_decl_level (tree decl
)
18645 switch (TREE_CODE (decl
))
18648 case TEMPLATE_DECL
:
18649 return TEMPLATE_TYPE_LEVEL (TREE_TYPE (decl
));
18652 return TEMPLATE_PARM_LEVEL (DECL_INITIAL (decl
));
18655 gcc_unreachable ();
18660 /* Decide whether ARG can be unified with PARM, considering only the
18661 cv-qualifiers of each type, given STRICT as documented for unify.
18662 Returns nonzero iff the unification is OK on that basis. */
18665 check_cv_quals_for_unify (int strict
, tree arg
, tree parm
)
18667 int arg_quals
= cp_type_quals (arg
);
18668 int parm_quals
= cp_type_quals (parm
);
18670 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
18671 && !(strict
& UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
18673 /* Although a CVR qualifier is ignored when being applied to a
18674 substituted template parameter ([8.3.2]/1 for example), that
18675 does not allow us to unify "const T" with "int&" because both
18676 types are not of the form "cv-list T" [14.8.2.5 temp.deduct.type].
18677 It is ok when we're allowing additional CV qualifiers
18678 at the outer level [14.8.2.1]/3,1st bullet. */
18679 if ((TREE_CODE (arg
) == REFERENCE_TYPE
18680 || TREE_CODE (arg
) == FUNCTION_TYPE
18681 || TREE_CODE (arg
) == METHOD_TYPE
)
18682 && (parm_quals
& (TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
)))
18685 if ((!POINTER_TYPE_P (arg
) && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
)
18686 && (parm_quals
& TYPE_QUAL_RESTRICT
))
18690 if (!(strict
& (UNIFY_ALLOW_MORE_CV_QUAL
| UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
18691 && (arg_quals
& parm_quals
) != parm_quals
)
18694 if (!(strict
& (UNIFY_ALLOW_LESS_CV_QUAL
| UNIFY_ALLOW_OUTER_LESS_CV_QUAL
))
18695 && (parm_quals
& arg_quals
) != arg_quals
)
18701 /* Determines the LEVEL and INDEX for the template parameter PARM. */
18703 template_parm_level_and_index (tree parm
, int* level
, int* index
)
18705 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
18706 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
18707 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
18709 *index
= TEMPLATE_TYPE_IDX (parm
);
18710 *level
= TEMPLATE_TYPE_LEVEL (parm
);
18714 *index
= TEMPLATE_PARM_IDX (parm
);
18715 *level
= TEMPLATE_PARM_LEVEL (parm
);
18719 #define RECUR_AND_CHECK_FAILURE(TP, TA, P, A, S, EP) \
18721 if (unify (TP, TA, P, A, S, EP)) \
18725 /* Unifies the remaining arguments in PACKED_ARGS with the pack
18726 expansion at the end of PACKED_PARMS. Returns 0 if the type
18727 deduction succeeds, 1 otherwise. STRICT is the same as in
18728 unify. CALL_ARGS_P is true iff PACKED_ARGS is actually a function
18729 call argument list. We'll need to adjust the arguments to make them
18730 types. SUBR tells us if this is from a recursive call to
18731 type_unification_real, or for comparing two template argument
18735 unify_pack_expansion (tree tparms
, tree targs
, tree packed_parms
,
18736 tree packed_args
, unification_kind_t strict
,
18737 bool subr
, bool explain_p
)
18740 = TREE_VEC_ELT (packed_parms
, TREE_VEC_LENGTH (packed_parms
) - 1);
18741 tree pattern
= PACK_EXPANSION_PATTERN (parm
);
18742 tree pack
, packs
= NULL_TREE
;
18743 int i
, start
= TREE_VEC_LENGTH (packed_parms
) - 1;
18745 packed_args
= expand_template_argument_pack (packed_args
);
18747 int len
= TREE_VEC_LENGTH (packed_args
);
18749 /* Determine the parameter packs we will be deducing from the
18750 pattern, and record their current deductions. */
18751 for (pack
= PACK_EXPANSION_PARAMETER_PACKS (parm
);
18752 pack
; pack
= TREE_CHAIN (pack
))
18754 tree parm_pack
= TREE_VALUE (pack
);
18757 /* Determine the index and level of this parameter pack. */
18758 template_parm_level_and_index (parm_pack
, &level
, &idx
);
18760 /* Keep track of the parameter packs and their corresponding
18762 packs
= tree_cons (parm_pack
, TMPL_ARG (targs
, level
, idx
), packs
);
18763 TREE_TYPE (packs
) = make_tree_vec (len
- start
);
18766 /* Loop through all of the arguments that have not yet been
18767 unified and unify each with the pattern. */
18768 for (i
= start
; i
< len
; i
++)
18771 bool any_explicit
= false;
18772 tree arg
= TREE_VEC_ELT (packed_args
, i
);
18774 /* For each parameter pack, set its TMPL_ARG to either NULL_TREE
18775 or the element of its argument pack at the current index if
18776 this argument was explicitly specified. */
18777 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
18781 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
18784 if (TREE_VALUE (pack
)
18785 && (pargs
= ARGUMENT_PACK_EXPLICIT_ARGS (TREE_VALUE (pack
)))
18786 && (i
- start
< TREE_VEC_LENGTH (pargs
)))
18788 any_explicit
= true;
18789 arg
= TREE_VEC_ELT (pargs
, i
- start
);
18791 TMPL_ARG (targs
, level
, idx
) = arg
;
18794 /* If we had explicit template arguments, substitute them into the
18795 pattern before deduction. */
18798 /* Some arguments might still be unspecified or dependent. */
18800 ++processing_template_decl
;
18801 dependent
= any_dependent_template_arguments_p (targs
);
18803 --processing_template_decl
;
18804 parm
= tsubst (pattern
, targs
,
18805 explain_p
? tf_warning_or_error
: tf_none
,
18808 --processing_template_decl
;
18809 if (parm
== error_mark_node
)
18815 /* Unify the pattern with the current argument. */
18816 if (unify_one_argument (tparms
, targs
, parm
, arg
, subr
, strict
,
18820 /* For each parameter pack, collect the deduced value. */
18821 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
18824 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
18826 TREE_VEC_ELT (TREE_TYPE (pack
), i
- start
) =
18827 TMPL_ARG (targs
, level
, idx
);
18831 /* Verify that the results of unification with the parameter packs
18832 produce results consistent with what we've seen before, and make
18833 the deduced argument packs available. */
18834 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
18836 tree old_pack
= TREE_VALUE (pack
);
18837 tree new_args
= TREE_TYPE (pack
);
18838 int i
, len
= TREE_VEC_LENGTH (new_args
);
18840 bool nondeduced_p
= false;
18842 /* By default keep the original deduced argument pack.
18843 If necessary, more specific code is going to update the
18844 resulting deduced argument later down in this function. */
18845 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
18846 TMPL_ARG (targs
, level
, idx
) = old_pack
;
18848 /* If NEW_ARGS contains any NULL_TREE entries, we didn't
18849 actually deduce anything. */
18850 for (i
= 0; i
< len
&& !nondeduced_p
; ++i
)
18851 if (TREE_VEC_ELT (new_args
, i
) == NULL_TREE
)
18852 nondeduced_p
= true;
18856 if (old_pack
&& ARGUMENT_PACK_INCOMPLETE_P (old_pack
))
18858 /* If we had fewer function args than explicit template args,
18859 just use the explicits. */
18860 tree explicit_args
= ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
);
18861 int explicit_len
= TREE_VEC_LENGTH (explicit_args
);
18862 if (len
< explicit_len
)
18863 new_args
= explicit_args
;
18869 /* Build the deduced *_ARGUMENT_PACK. */
18870 if (TREE_CODE (TREE_PURPOSE (pack
)) == TEMPLATE_PARM_INDEX
)
18872 result
= make_node (NONTYPE_ARGUMENT_PACK
);
18873 TREE_TYPE (result
) =
18874 TREE_TYPE (TEMPLATE_PARM_DECL (TREE_PURPOSE (pack
)));
18875 TREE_CONSTANT (result
) = 1;
18878 result
= cxx_make_type (TYPE_ARGUMENT_PACK
);
18880 SET_ARGUMENT_PACK_ARGS (result
, new_args
);
18882 /* Note the deduced argument packs for this parameter
18884 TMPL_ARG (targs
, level
, idx
) = result
;
18886 else if (ARGUMENT_PACK_INCOMPLETE_P (old_pack
)
18887 && (ARGUMENT_PACK_ARGS (old_pack
)
18888 == ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
)))
18890 /* We only had the explicitly-provided arguments before, but
18891 now we have a complete set of arguments. */
18892 tree explicit_args
= ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
);
18894 SET_ARGUMENT_PACK_ARGS (old_pack
, new_args
);
18895 ARGUMENT_PACK_INCOMPLETE_P (old_pack
) = 1;
18896 ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
) = explicit_args
;
18900 tree bad_old_arg
= NULL_TREE
, bad_new_arg
= NULL_TREE
;
18901 tree old_args
= ARGUMENT_PACK_ARGS (old_pack
);
18903 if (!comp_template_args_with_info (old_args
, new_args
,
18904 &bad_old_arg
, &bad_new_arg
))
18905 /* Inconsistent unification of this parameter pack. */
18906 return unify_parameter_pack_inconsistent (explain_p
,
18912 return unify_success (explain_p
);
18915 /* Handle unification of the domain of an array. PARM_DOM and ARG_DOM are
18916 INTEGER_TYPEs representing the TYPE_DOMAIN of ARRAY_TYPEs. The other
18917 parameters and return value are as for unify. */
18920 unify_array_domain (tree tparms
, tree targs
,
18921 tree parm_dom
, tree arg_dom
,
18929 /* Our representation of array types uses "N - 1" as the
18930 TYPE_MAX_VALUE for an array with "N" elements, if "N" is
18931 not an integer constant. We cannot unify arbitrarily
18932 complex expressions, so we eliminate the MINUS_EXPRs
18934 parm_max
= TYPE_MAX_VALUE (parm_dom
);
18935 parm_cst
= TREE_CODE (parm_max
) == INTEGER_CST
;
18938 gcc_assert (TREE_CODE (parm_max
) == MINUS_EXPR
);
18939 parm_max
= TREE_OPERAND (parm_max
, 0);
18941 arg_max
= TYPE_MAX_VALUE (arg_dom
);
18942 arg_cst
= TREE_CODE (arg_max
) == INTEGER_CST
;
18945 /* The ARG_MAX may not be a simple MINUS_EXPR, if we are
18946 trying to unify the type of a variable with the type
18947 of a template parameter. For example:
18949 template <unsigned int N>
18950 void f (char (&) [N]);
18957 Here, the type of the ARG will be "int [g(i)]", and
18958 may be a SAVE_EXPR, etc. */
18959 if (TREE_CODE (arg_max
) != MINUS_EXPR
)
18960 return unify_vla_arg (explain_p
, arg_dom
);
18961 arg_max
= TREE_OPERAND (arg_max
, 0);
18964 /* If only one of the bounds used a MINUS_EXPR, compensate
18965 by adding one to the other bound. */
18966 if (parm_cst
&& !arg_cst
)
18967 parm_max
= fold_build2_loc (input_location
, PLUS_EXPR
,
18971 else if (arg_cst
&& !parm_cst
)
18972 arg_max
= fold_build2_loc (input_location
, PLUS_EXPR
,
18977 return unify (tparms
, targs
, parm_max
, arg_max
,
18978 UNIFY_ALLOW_INTEGER
, explain_p
);
18981 /* Deduce the value of template parameters. TPARMS is the (innermost)
18982 set of template parameters to a template. TARGS is the bindings
18983 for those template parameters, as determined thus far; TARGS may
18984 include template arguments for outer levels of template parameters
18985 as well. PARM is a parameter to a template function, or a
18986 subcomponent of that parameter; ARG is the corresponding argument.
18987 This function attempts to match PARM with ARG in a manner
18988 consistent with the existing assignments in TARGS. If more values
18989 are deduced, then TARGS is updated.
18991 Returns 0 if the type deduction succeeds, 1 otherwise. The
18992 parameter STRICT is a bitwise or of the following flags:
18995 Require an exact match between PARM and ARG.
18996 UNIFY_ALLOW_MORE_CV_QUAL:
18997 Allow the deduced ARG to be more cv-qualified (by qualification
18998 conversion) than ARG.
18999 UNIFY_ALLOW_LESS_CV_QUAL:
19000 Allow the deduced ARG to be less cv-qualified than ARG.
19001 UNIFY_ALLOW_DERIVED:
19002 Allow the deduced ARG to be a template base class of ARG,
19003 or a pointer to a template base class of the type pointed to by
19005 UNIFY_ALLOW_INTEGER:
19006 Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX
19007 case for more information.
19008 UNIFY_ALLOW_OUTER_LEVEL:
19009 This is the outermost level of a deduction. Used to determine validity
19010 of qualification conversions. A valid qualification conversion must
19011 have const qualified pointers leading up to the inner type which
19012 requires additional CV quals, except at the outer level, where const
19013 is not required [conv.qual]. It would be normal to set this flag in
19014 addition to setting UNIFY_ALLOW_MORE_CV_QUAL.
19015 UNIFY_ALLOW_OUTER_MORE_CV_QUAL:
19016 This is the outermost level of a deduction, and PARM can be more CV
19017 qualified at this point.
19018 UNIFY_ALLOW_OUTER_LESS_CV_QUAL:
19019 This is the outermost level of a deduction, and PARM can be less CV
19020 qualified at this point. */
19023 unify (tree tparms
, tree targs
, tree parm
, tree arg
, int strict
,
19029 int strict_in
= strict
;
19031 /* I don't think this will do the right thing with respect to types.
19032 But the only case I've seen it in so far has been array bounds, where
19033 signedness is the only information lost, and I think that will be
19035 while (TREE_CODE (parm
) == NOP_EXPR
)
19036 parm
= TREE_OPERAND (parm
, 0);
19038 if (arg
== error_mark_node
)
19039 return unify_invalid (explain_p
);
19040 if (arg
== unknown_type_node
19041 || arg
== init_list_type_node
)
19042 /* We can't deduce anything from this, but we might get all the
19043 template args from other function args. */
19044 return unify_success (explain_p
);
19046 /* If PARM uses template parameters, then we can't bail out here,
19047 even if ARG == PARM, since we won't record unifications for the
19048 template parameters. We might need them if we're trying to
19049 figure out which of two things is more specialized. */
19050 if (arg
== parm
&& !uses_template_parms (parm
))
19051 return unify_success (explain_p
);
19053 /* Handle init lists early, so the rest of the function can assume
19054 we're dealing with a type. */
19055 if (BRACE_ENCLOSED_INITIALIZER_P (arg
))
19059 tree orig_parm
= parm
;
19061 /* Replace T with std::initializer_list<T> for deduction. */
19062 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
19063 && flag_deduce_init_list
)
19064 parm
= listify (parm
);
19066 if (!is_std_init_list (parm
)
19067 && TREE_CODE (parm
) != ARRAY_TYPE
)
19068 /* We can only deduce from an initializer list argument if the
19069 parameter is std::initializer_list or an array; otherwise this
19070 is a non-deduced context. */
19071 return unify_success (explain_p
);
19073 if (TREE_CODE (parm
) == ARRAY_TYPE
)
19074 elttype
= TREE_TYPE (parm
);
19077 elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (parm
), 0);
19078 /* Deduction is defined in terms of a single type, so just punt
19079 on the (bizarre) std::initializer_list<T...>. */
19080 if (PACK_EXPANSION_P (elttype
))
19081 return unify_success (explain_p
);
19084 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (arg
), i
, elt
)
19086 int elt_strict
= strict
;
19088 if (elt
== error_mark_node
)
19089 return unify_invalid (explain_p
);
19091 if (!BRACE_ENCLOSED_INITIALIZER_P (elt
))
19093 tree type
= TREE_TYPE (elt
);
19094 if (type
== error_mark_node
)
19095 return unify_invalid (explain_p
);
19096 /* It should only be possible to get here for a call. */
19097 gcc_assert (elt_strict
& UNIFY_ALLOW_OUTER_LEVEL
);
19098 elt_strict
|= maybe_adjust_types_for_deduction
19099 (DEDUCE_CALL
, &elttype
, &type
, elt
);
19103 RECUR_AND_CHECK_FAILURE (tparms
, targs
, elttype
, elt
, elt_strict
,
19107 if (TREE_CODE (parm
) == ARRAY_TYPE
19108 && deducible_array_bound (TYPE_DOMAIN (parm
)))
19110 /* Also deduce from the length of the initializer list. */
19111 tree max
= size_int (CONSTRUCTOR_NELTS (arg
));
19112 tree idx
= compute_array_index_type (NULL_TREE
, max
, tf_none
);
19113 if (idx
== error_mark_node
)
19114 return unify_invalid (explain_p
);
19115 return unify_array_domain (tparms
, targs
, TYPE_DOMAIN (parm
),
19119 /* If the std::initializer_list<T> deduction worked, replace the
19120 deduced A with std::initializer_list<A>. */
19121 if (orig_parm
!= parm
)
19123 idx
= TEMPLATE_TYPE_IDX (orig_parm
);
19124 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
19125 targ
= listify (targ
);
19126 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = targ
;
19128 return unify_success (explain_p
);
19131 /* Immediately reject some pairs that won't unify because of
19132 cv-qualification mismatches. */
19133 if (TREE_CODE (arg
) == TREE_CODE (parm
)
19135 /* It is the elements of the array which hold the cv quals of an array
19136 type, and the elements might be template type parms. We'll check
19137 when we recurse. */
19138 && TREE_CODE (arg
) != ARRAY_TYPE
19139 /* We check the cv-qualifiers when unifying with template type
19140 parameters below. We want to allow ARG `const T' to unify with
19141 PARM `T' for example, when computing which of two templates
19142 is more specialized, for example. */
19143 && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
19144 && !check_cv_quals_for_unify (strict_in
, arg
, parm
))
19145 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
19147 if (!(strict
& UNIFY_ALLOW_OUTER_LEVEL
)
19148 && TYPE_P (parm
) && !CP_TYPE_CONST_P (parm
))
19149 strict
&= ~UNIFY_ALLOW_MORE_CV_QUAL
;
19150 strict
&= ~UNIFY_ALLOW_OUTER_LEVEL
;
19151 strict
&= ~UNIFY_ALLOW_DERIVED
;
19152 strict
&= ~UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
19153 strict
&= ~UNIFY_ALLOW_OUTER_LESS_CV_QUAL
;
19155 switch (TREE_CODE (parm
))
19157 case TYPENAME_TYPE
:
19159 case UNBOUND_CLASS_TEMPLATE
:
19160 /* In a type which contains a nested-name-specifier, template
19161 argument values cannot be deduced for template parameters used
19162 within the nested-name-specifier. */
19163 return unify_success (explain_p
);
19165 case TEMPLATE_TYPE_PARM
:
19166 case TEMPLATE_TEMPLATE_PARM
:
19167 case BOUND_TEMPLATE_TEMPLATE_PARM
:
19168 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
19169 if (error_operand_p (tparm
))
19170 return unify_invalid (explain_p
);
19172 if (TEMPLATE_TYPE_LEVEL (parm
)
19173 != template_decl_level (tparm
))
19174 /* The PARM is not one we're trying to unify. Just check
19175 to see if it matches ARG. */
19177 if (TREE_CODE (arg
) == TREE_CODE (parm
)
19178 && (is_auto (parm
) ? is_auto (arg
)
19179 : same_type_p (parm
, arg
)))
19180 return unify_success (explain_p
);
19182 return unify_type_mismatch (explain_p
, parm
, arg
);
19184 idx
= TEMPLATE_TYPE_IDX (parm
);
19185 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
19186 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, idx
));
19187 if (error_operand_p (tparm
))
19188 return unify_invalid (explain_p
);
19190 /* Check for mixed types and values. */
19191 if ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
19192 && TREE_CODE (tparm
) != TYPE_DECL
)
19193 || (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
19194 && TREE_CODE (tparm
) != TEMPLATE_DECL
))
19195 gcc_unreachable ();
19197 if (TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
19199 /* ARG must be constructed from a template class or a template
19200 template parameter. */
19201 if (TREE_CODE (arg
) != BOUND_TEMPLATE_TEMPLATE_PARM
19202 && !CLASSTYPE_SPECIALIZATION_OF_PRIMARY_TEMPLATE_P (arg
))
19203 return unify_template_deduction_failure (explain_p
, parm
, arg
);
19205 tree parmvec
= TYPE_TI_ARGS (parm
);
19206 /* An alias template name is never deduced. */
19207 if (TYPE_ALIAS_P (arg
))
19208 arg
= strip_typedefs (arg
);
19209 tree argvec
= INNERMOST_TEMPLATE_ARGS (TYPE_TI_ARGS (arg
));
19210 tree full_argvec
= add_to_template_args (targs
, argvec
);
19212 = DECL_INNERMOST_TEMPLATE_PARMS
19213 (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (parm
));
19215 int parm_variadic_p
= 0;
19217 /* The resolution to DR150 makes clear that default
19218 arguments for an N-argument may not be used to bind T
19219 to a template template parameter with fewer than N
19220 parameters. It is not safe to permit the binding of
19221 default arguments as an extension, as that may change
19222 the meaning of a conforming program. Consider:
19224 struct Dense { static const unsigned int dim = 1; };
19226 template <template <typename> class View,
19228 void operator+(float, View<Block> const&);
19230 template <typename Block,
19231 unsigned int Dim = Block::dim>
19232 struct Lvalue_proxy { operator float() const; };
19236 Lvalue_proxy<Dense> p;
19241 Here, if Lvalue_proxy is permitted to bind to View, then
19242 the global operator+ will be used; if they are not, the
19243 Lvalue_proxy will be converted to float. */
19244 if (coerce_template_parms (parm_parms
,
19246 TYPE_TI_TEMPLATE (parm
),
19248 ? tf_warning_or_error
19250 /*require_all_args=*/true,
19251 /*use_default_args=*/false)
19252 == error_mark_node
)
19255 /* Deduce arguments T, i from TT<T> or TT<i>.
19256 We check each element of PARMVEC and ARGVEC individually
19257 rather than the whole TREE_VEC since they can have
19258 different number of elements. */
19260 parmvec
= expand_template_argument_pack (parmvec
);
19261 argvec
= expand_template_argument_pack (argvec
);
19263 len
= TREE_VEC_LENGTH (parmvec
);
19265 /* Check if the parameters end in a pack, making them
19268 && PACK_EXPANSION_P (TREE_VEC_ELT (parmvec
, len
- 1)))
19269 parm_variadic_p
= 1;
19271 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
19272 /* If the template argument list of P contains a pack
19273 expansion that is not the last template argument, the
19274 entire template argument list is a non-deduced
19276 if (PACK_EXPANSION_P (TREE_VEC_ELT (parmvec
, i
)))
19277 return unify_success (explain_p
);
19279 if (TREE_VEC_LENGTH (argvec
) < len
- parm_variadic_p
)
19280 return unify_too_few_arguments (explain_p
,
19281 TREE_VEC_LENGTH (argvec
), len
);
19283 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
19285 RECUR_AND_CHECK_FAILURE (tparms
, targs
,
19286 TREE_VEC_ELT (parmvec
, i
),
19287 TREE_VEC_ELT (argvec
, i
),
19288 UNIFY_ALLOW_NONE
, explain_p
);
19291 if (parm_variadic_p
19292 && unify_pack_expansion (tparms
, targs
,
19295 /*subr=*/true, explain_p
))
19298 arg
= TYPE_TI_TEMPLATE (arg
);
19300 /* Fall through to deduce template name. */
19303 if (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
19304 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
19306 /* Deduce template name TT from TT, TT<>, TT<T> and TT<i>. */
19308 /* Simple cases: Value already set, does match or doesn't. */
19309 if (targ
!= NULL_TREE
&& template_args_equal (targ
, arg
))
19310 return unify_success (explain_p
);
19312 return unify_inconsistency (explain_p
, parm
, targ
, arg
);
19316 /* If PARM is `const T' and ARG is only `int', we don't have
19317 a match unless we are allowing additional qualification.
19318 If ARG is `const int' and PARM is just `T' that's OK;
19319 that binds `const int' to `T'. */
19320 if (!check_cv_quals_for_unify (strict_in
| UNIFY_ALLOW_LESS_CV_QUAL
,
19322 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
19324 /* Consider the case where ARG is `const volatile int' and
19325 PARM is `const T'. Then, T should be `volatile int'. */
19326 arg
= cp_build_qualified_type_real
19327 (arg
, cp_type_quals (arg
) & ~cp_type_quals (parm
), tf_none
);
19328 if (arg
== error_mark_node
)
19329 return unify_invalid (explain_p
);
19331 /* Simple cases: Value already set, does match or doesn't. */
19332 if (targ
!= NULL_TREE
&& same_type_p (targ
, arg
))
19333 return unify_success (explain_p
);
19335 return unify_inconsistency (explain_p
, parm
, targ
, arg
);
19337 /* Make sure that ARG is not a variable-sized array. (Note
19338 that were talking about variable-sized arrays (like
19339 `int[n]'), rather than arrays of unknown size (like
19340 `int[]').) We'll get very confused by such a type since
19341 the bound of the array is not constant, and therefore
19342 not mangleable. Besides, such types are not allowed in
19343 ISO C++, so we can do as we please here. We do allow
19344 them for 'auto' deduction, since that isn't ABI-exposed. */
19345 if (!is_auto (parm
) && variably_modified_type_p (arg
, NULL_TREE
))
19346 return unify_vla_arg (explain_p
, arg
);
19348 /* Strip typedefs as in convert_template_argument. */
19349 arg
= canonicalize_type_argument (arg
, tf_none
);
19352 /* If ARG is a parameter pack or an expansion, we cannot unify
19353 against it unless PARM is also a parameter pack. */
19354 if ((template_parameter_pack_p (arg
) || PACK_EXPANSION_P (arg
))
19355 && !template_parameter_pack_p (parm
))
19356 return unify_parameter_pack_mismatch (explain_p
, parm
, arg
);
19358 /* If the argument deduction results is a METHOD_TYPE,
19359 then there is a problem.
19360 METHOD_TYPE doesn't map to any real C++ type the result of
19361 the deduction can not be of that type. */
19362 if (TREE_CODE (arg
) == METHOD_TYPE
)
19363 return unify_method_type_error (explain_p
, arg
);
19365 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = arg
;
19366 return unify_success (explain_p
);
19368 case TEMPLATE_PARM_INDEX
:
19369 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
19370 if (error_operand_p (tparm
))
19371 return unify_invalid (explain_p
);
19373 if (TEMPLATE_PARM_LEVEL (parm
)
19374 != template_decl_level (tparm
))
19376 /* The PARM is not one we're trying to unify. Just check
19377 to see if it matches ARG. */
19378 int result
= !(TREE_CODE (arg
) == TREE_CODE (parm
)
19379 && cp_tree_equal (parm
, arg
));
19381 unify_expression_unequal (explain_p
, parm
, arg
);
19385 idx
= TEMPLATE_PARM_IDX (parm
);
19386 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
19390 int x
= !cp_tree_equal (targ
, arg
);
19392 unify_inconsistency (explain_p
, parm
, targ
, arg
);
19396 /* [temp.deduct.type] If, in the declaration of a function template
19397 with a non-type template-parameter, the non-type
19398 template-parameter is used in an expression in the function
19399 parameter-list and, if the corresponding template-argument is
19400 deduced, the template-argument type shall match the type of the
19401 template-parameter exactly, except that a template-argument
19402 deduced from an array bound may be of any integral type.
19403 The non-type parameter might use already deduced type parameters. */
19404 tparm
= tsubst (TREE_TYPE (parm
), targs
, 0, NULL_TREE
);
19405 if (!TREE_TYPE (arg
))
19406 /* Template-parameter dependent expression. Just accept it for now.
19407 It will later be processed in convert_template_argument. */
19409 else if (same_type_p (TREE_TYPE (arg
), tparm
))
19411 else if ((strict
& UNIFY_ALLOW_INTEGER
)
19412 && CP_INTEGRAL_TYPE_P (tparm
))
19413 /* Convert the ARG to the type of PARM; the deduced non-type
19414 template argument must exactly match the types of the
19415 corresponding parameter. */
19416 arg
= fold (build_nop (tparm
, arg
));
19417 else if (uses_template_parms (tparm
))
19418 /* We haven't deduced the type of this parameter yet. Try again
19420 return unify_success (explain_p
);
19422 return unify_type_mismatch (explain_p
, tparm
, TREE_TYPE (arg
));
19424 /* If ARG is a parameter pack or an expansion, we cannot unify
19425 against it unless PARM is also a parameter pack. */
19426 if ((template_parameter_pack_p (arg
) || PACK_EXPANSION_P (arg
))
19427 && !TEMPLATE_PARM_PARAMETER_PACK (parm
))
19428 return unify_parameter_pack_mismatch (explain_p
, parm
, arg
);
19431 bool removed_attr
= false;
19432 arg
= strip_typedefs_expr (arg
, &removed_attr
);
19434 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = arg
;
19435 return unify_success (explain_p
);
19439 /* A pointer-to-member constant can be unified only with
19440 another constant. */
19441 if (TREE_CODE (arg
) != PTRMEM_CST
)
19442 return unify_ptrmem_cst_mismatch (explain_p
, parm
, arg
);
19444 /* Just unify the class member. It would be useless (and possibly
19445 wrong, depending on the strict flags) to unify also
19446 PTRMEM_CST_CLASS, because we want to be sure that both parm and
19447 arg refer to the same variable, even if through different
19448 classes. For instance:
19450 struct A { int x; };
19453 Unification of &A::x and &B::x must succeed. */
19454 return unify (tparms
, targs
, PTRMEM_CST_MEMBER (parm
),
19455 PTRMEM_CST_MEMBER (arg
), strict
, explain_p
);
19460 if (!TYPE_PTR_P (arg
))
19461 return unify_type_mismatch (explain_p
, parm
, arg
);
19463 /* [temp.deduct.call]
19465 A can be another pointer or pointer to member type that can
19466 be converted to the deduced A via a qualification
19467 conversion (_conv.qual_).
19469 We pass down STRICT here rather than UNIFY_ALLOW_NONE.
19470 This will allow for additional cv-qualification of the
19471 pointed-to types if appropriate. */
19473 if (TREE_CODE (TREE_TYPE (arg
)) == RECORD_TYPE
)
19474 /* The derived-to-base conversion only persists through one
19475 level of pointers. */
19476 strict
|= (strict_in
& UNIFY_ALLOW_DERIVED
);
19478 return unify (tparms
, targs
, TREE_TYPE (parm
),
19479 TREE_TYPE (arg
), strict
, explain_p
);
19482 case REFERENCE_TYPE
:
19483 if (TREE_CODE (arg
) != REFERENCE_TYPE
)
19484 return unify_type_mismatch (explain_p
, parm
, arg
);
19485 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
19486 strict
& UNIFY_ALLOW_MORE_CV_QUAL
, explain_p
);
19489 if (TREE_CODE (arg
) != ARRAY_TYPE
)
19490 return unify_type_mismatch (explain_p
, parm
, arg
);
19491 if ((TYPE_DOMAIN (parm
) == NULL_TREE
)
19492 != (TYPE_DOMAIN (arg
) == NULL_TREE
))
19493 return unify_type_mismatch (explain_p
, parm
, arg
);
19494 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
19495 strict
& UNIFY_ALLOW_MORE_CV_QUAL
, explain_p
);
19496 if (TYPE_DOMAIN (parm
) != NULL_TREE
)
19497 return unify_array_domain (tparms
, targs
, TYPE_DOMAIN (parm
),
19498 TYPE_DOMAIN (arg
), explain_p
);
19499 return unify_success (explain_p
);
19506 case ENUMERAL_TYPE
:
19509 if (TREE_CODE (arg
) != TREE_CODE (parm
))
19510 return unify_type_mismatch (explain_p
, parm
, arg
);
19512 /* We have already checked cv-qualification at the top of the
19514 if (!same_type_ignoring_top_level_qualifiers_p (arg
, parm
))
19515 return unify_type_mismatch (explain_p
, parm
, arg
);
19517 /* As far as unification is concerned, this wins. Later checks
19518 will invalidate it if necessary. */
19519 return unify_success (explain_p
);
19521 /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */
19522 /* Type INTEGER_CST can come from ordinary constant template args. */
19524 while (TREE_CODE (arg
) == NOP_EXPR
)
19525 arg
= TREE_OPERAND (arg
, 0);
19527 if (TREE_CODE (arg
) != INTEGER_CST
)
19528 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
19529 return (tree_int_cst_equal (parm
, arg
)
19530 ? unify_success (explain_p
)
19531 : unify_template_argument_mismatch (explain_p
, parm
, arg
));
19535 int i
, len
, argslen
;
19536 int parm_variadic_p
= 0;
19538 if (TREE_CODE (arg
) != TREE_VEC
)
19539 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
19541 len
= TREE_VEC_LENGTH (parm
);
19542 argslen
= TREE_VEC_LENGTH (arg
);
19544 /* Check for pack expansions in the parameters. */
19545 for (i
= 0; i
< len
; ++i
)
19547 if (PACK_EXPANSION_P (TREE_VEC_ELT (parm
, i
)))
19550 /* We can unify against something with a trailing
19552 parm_variadic_p
= 1;
19554 /* [temp.deduct.type]/9: If the template argument list of
19555 P contains a pack expansion that is not the last
19556 template argument, the entire template argument list
19557 is a non-deduced context. */
19558 return unify_success (explain_p
);
19562 /* If we don't have enough arguments to satisfy the parameters
19563 (not counting the pack expression at the end), or we have
19564 too many arguments for a parameter list that doesn't end in
19565 a pack expression, we can't unify. */
19566 if (parm_variadic_p
19567 ? argslen
< len
- parm_variadic_p
19569 return unify_arity (explain_p
, TREE_VEC_LENGTH (arg
), len
);
19571 /* Unify all of the parameters that precede the (optional)
19572 pack expression. */
19573 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
19575 RECUR_AND_CHECK_FAILURE (tparms
, targs
,
19576 TREE_VEC_ELT (parm
, i
),
19577 TREE_VEC_ELT (arg
, i
),
19578 UNIFY_ALLOW_NONE
, explain_p
);
19580 if (parm_variadic_p
)
19581 return unify_pack_expansion (tparms
, targs
, parm
, arg
,
19583 /*subr=*/true, explain_p
);
19584 return unify_success (explain_p
);
19589 if (TREE_CODE (arg
) != TREE_CODE (parm
))
19590 return unify_type_mismatch (explain_p
, parm
, arg
);
19592 if (TYPE_PTRMEMFUNC_P (parm
))
19594 if (!TYPE_PTRMEMFUNC_P (arg
))
19595 return unify_type_mismatch (explain_p
, parm
, arg
);
19597 return unify (tparms
, targs
,
19598 TYPE_PTRMEMFUNC_FN_TYPE (parm
),
19599 TYPE_PTRMEMFUNC_FN_TYPE (arg
),
19600 strict
, explain_p
);
19602 else if (TYPE_PTRMEMFUNC_P (arg
))
19603 return unify_type_mismatch (explain_p
, parm
, arg
);
19605 if (CLASSTYPE_TEMPLATE_INFO (parm
))
19607 tree t
= NULL_TREE
;
19609 if (strict_in
& UNIFY_ALLOW_DERIVED
)
19611 /* First, we try to unify the PARM and ARG directly. */
19612 t
= try_class_unification (tparms
, targs
,
19613 parm
, arg
, explain_p
);
19617 /* Fallback to the special case allowed in
19618 [temp.deduct.call]:
19620 If P is a class, and P has the form
19621 template-id, then A can be a derived class of
19622 the deduced A. Likewise, if P is a pointer to
19623 a class of the form template-id, A can be a
19624 pointer to a derived class pointed to by the
19626 enum template_base_result r
;
19627 r
= get_template_base (tparms
, targs
, parm
, arg
,
19632 /* Don't give the derived diagnostic if we're
19633 already dealing with the same template. */
19635 = (CLASSTYPE_TEMPLATE_INFO (arg
)
19636 && (CLASSTYPE_TI_TEMPLATE (parm
)
19637 == CLASSTYPE_TI_TEMPLATE (arg
)));
19638 return unify_no_common_base (explain_p
&& !same_template
,
19643 else if (CLASSTYPE_TEMPLATE_INFO (arg
)
19644 && (CLASSTYPE_TI_TEMPLATE (parm
)
19645 == CLASSTYPE_TI_TEMPLATE (arg
)))
19646 /* Perhaps PARM is something like S<U> and ARG is S<int>.
19647 Then, we should unify `int' and `U'. */
19650 /* There's no chance of unification succeeding. */
19651 return unify_type_mismatch (explain_p
, parm
, arg
);
19653 return unify (tparms
, targs
, CLASSTYPE_TI_ARGS (parm
),
19654 CLASSTYPE_TI_ARGS (t
), UNIFY_ALLOW_NONE
, explain_p
);
19656 else if (!same_type_ignoring_top_level_qualifiers_p (parm
, arg
))
19657 return unify_type_mismatch (explain_p
, parm
, arg
);
19658 return unify_success (explain_p
);
19661 case FUNCTION_TYPE
:
19663 unsigned int nargs
;
19668 if (TREE_CODE (arg
) != TREE_CODE (parm
))
19669 return unify_type_mismatch (explain_p
, parm
, arg
);
19671 /* CV qualifications for methods can never be deduced, they must
19672 match exactly. We need to check them explicitly here,
19673 because type_unification_real treats them as any other
19674 cv-qualified parameter. */
19675 if (TREE_CODE (parm
) == METHOD_TYPE
19676 && (!check_cv_quals_for_unify
19678 class_of_this_parm (arg
),
19679 class_of_this_parm (parm
))))
19680 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
19682 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TREE_TYPE (parm
),
19683 TREE_TYPE (arg
), UNIFY_ALLOW_NONE
, explain_p
);
19685 nargs
= list_length (TYPE_ARG_TYPES (arg
));
19686 args
= XALLOCAVEC (tree
, nargs
);
19687 for (a
= TYPE_ARG_TYPES (arg
), i
= 0;
19688 a
!= NULL_TREE
&& a
!= void_list_node
;
19689 a
= TREE_CHAIN (a
), ++i
)
19690 args
[i
] = TREE_VALUE (a
);
19693 return type_unification_real (tparms
, targs
, TYPE_ARG_TYPES (parm
),
19694 args
, nargs
, 1, DEDUCE_EXACT
,
19695 LOOKUP_NORMAL
, NULL
, explain_p
);
19699 /* Unify a pointer to member with a pointer to member function, which
19700 deduces the type of the member as a function type. */
19701 if (TYPE_PTRMEMFUNC_P (arg
))
19703 /* Check top-level cv qualifiers */
19704 if (!check_cv_quals_for_unify (UNIFY_ALLOW_NONE
, arg
, parm
))
19705 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
19707 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
19708 TYPE_PTRMEMFUNC_OBJECT_TYPE (arg
),
19709 UNIFY_ALLOW_NONE
, explain_p
);
19711 /* Determine the type of the function we are unifying against. */
19712 tree fntype
= static_fn_type (arg
);
19714 return unify (tparms
, targs
, TREE_TYPE (parm
), fntype
, strict
, explain_p
);
19717 if (TREE_CODE (arg
) != OFFSET_TYPE
)
19718 return unify_type_mismatch (explain_p
, parm
, arg
);
19719 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
19720 TYPE_OFFSET_BASETYPE (arg
),
19721 UNIFY_ALLOW_NONE
, explain_p
);
19722 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
19723 strict
, explain_p
);
19726 if (DECL_TEMPLATE_PARM_P (parm
))
19727 return unify (tparms
, targs
, DECL_INITIAL (parm
), arg
, strict
, explain_p
);
19728 if (arg
!= scalar_constant_value (parm
))
19729 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
19730 return unify_success (explain_p
);
19733 case TEMPLATE_DECL
:
19734 /* Matched cases are handled by the ARG == PARM test above. */
19735 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
19738 /* A non-type template parameter that is a variable should be a
19739 an integral constant, in which case, it whould have been
19740 folded into its (constant) value. So we should not be getting
19741 a variable here. */
19742 gcc_unreachable ();
19744 case TYPE_ARGUMENT_PACK
:
19745 case NONTYPE_ARGUMENT_PACK
:
19746 return unify (tparms
, targs
, ARGUMENT_PACK_ARGS (parm
),
19747 ARGUMENT_PACK_ARGS (arg
), strict
, explain_p
);
19750 case DECLTYPE_TYPE
:
19751 case UNDERLYING_TYPE
:
19752 /* Cannot deduce anything from TYPEOF_TYPE, DECLTYPE_TYPE,
19753 or UNDERLYING_TYPE nodes. */
19754 return unify_success (explain_p
);
19757 /* Unification fails if we hit an error node. */
19758 return unify_invalid (explain_p
);
19761 if (REFERENCE_REF_P (parm
))
19763 if (REFERENCE_REF_P (arg
))
19764 arg
= TREE_OPERAND (arg
, 0);
19765 return unify (tparms
, targs
, TREE_OPERAND (parm
, 0), arg
,
19766 strict
, explain_p
);
19771 /* An unresolved overload is a nondeduced context. */
19772 if (is_overloaded_fn (parm
) || type_unknown_p (parm
))
19773 return unify_success (explain_p
);
19774 gcc_assert (EXPR_P (parm
));
19776 /* We must be looking at an expression. This can happen with
19780 void foo(S<I>, S<I + 2>);
19782 This is a "nondeduced context":
19786 The nondeduced contexts are:
19788 --A type that is a template-id in which one or more of
19789 the template-arguments is an expression that references
19790 a template-parameter.
19792 In these cases, we assume deduction succeeded, but don't
19793 actually infer any unifications. */
19795 if (!uses_template_parms (parm
)
19796 && !template_args_equal (parm
, arg
))
19797 return unify_expression_unequal (explain_p
, parm
, arg
);
19799 return unify_success (explain_p
);
19802 #undef RECUR_AND_CHECK_FAILURE
19804 /* Note that DECL can be defined in this translation unit, if
19808 mark_definable (tree decl
)
19811 DECL_NOT_REALLY_EXTERN (decl
) = 1;
19812 FOR_EACH_CLONE (clone
, decl
)
19813 DECL_NOT_REALLY_EXTERN (clone
) = 1;
19816 /* Called if RESULT is explicitly instantiated, or is a member of an
19817 explicitly instantiated class. */
19820 mark_decl_instantiated (tree result
, int extern_p
)
19822 SET_DECL_EXPLICIT_INSTANTIATION (result
);
19824 /* If this entity has already been written out, it's too late to
19825 make any modifications. */
19826 if (TREE_ASM_WRITTEN (result
))
19829 /* For anonymous namespace we don't need to do anything. */
19830 if (decl_anon_ns_mem_p (result
))
19832 gcc_assert (!TREE_PUBLIC (result
));
19836 if (TREE_CODE (result
) != FUNCTION_DECL
)
19837 /* The TREE_PUBLIC flag for function declarations will have been
19838 set correctly by tsubst. */
19839 TREE_PUBLIC (result
) = 1;
19841 /* This might have been set by an earlier implicit instantiation. */
19842 DECL_COMDAT (result
) = 0;
19845 DECL_NOT_REALLY_EXTERN (result
) = 0;
19848 mark_definable (result
);
19849 mark_needed (result
);
19850 /* Always make artificials weak. */
19851 if (DECL_ARTIFICIAL (result
) && flag_weak
)
19852 comdat_linkage (result
);
19853 /* For WIN32 we also want to put explicit instantiations in
19854 linkonce sections. */
19855 else if (TREE_PUBLIC (result
))
19856 maybe_make_one_only (result
);
19859 /* If EXTERN_P, then this function will not be emitted -- unless
19860 followed by an explicit instantiation, at which point its linkage
19861 will be adjusted. If !EXTERN_P, then this function will be
19862 emitted here. In neither circumstance do we want
19863 import_export_decl to adjust the linkage. */
19864 DECL_INTERFACE_KNOWN (result
) = 1;
19867 /* Subroutine of more_specialized_fn: check whether TARGS is missing any
19868 important template arguments. If any are missing, we check whether
19869 they're important by using error_mark_node for substituting into any
19870 args that were used for partial ordering (the ones between ARGS and END)
19871 and seeing if it bubbles up. */
19874 check_undeduced_parms (tree targs
, tree args
, tree end
)
19876 bool found
= false;
19878 for (i
= TREE_VEC_LENGTH (targs
) - 1; i
>= 0; --i
)
19879 if (TREE_VEC_ELT (targs
, i
) == NULL_TREE
)
19882 TREE_VEC_ELT (targs
, i
) = error_mark_node
;
19886 tree substed
= tsubst_arg_types (args
, targs
, end
, tf_none
, NULL_TREE
);
19887 if (substed
== error_mark_node
)
19893 /* Given two function templates PAT1 and PAT2, return:
19895 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order].
19896 -1 if PAT2 is more specialized than PAT1.
19897 0 if neither is more specialized.
19899 LEN indicates the number of parameters we should consider
19900 (defaulted parameters should not be considered).
19902 The 1998 std underspecified function template partial ordering, and
19903 DR214 addresses the issue. We take pairs of arguments, one from
19904 each of the templates, and deduce them against each other. One of
19905 the templates will be more specialized if all the *other*
19906 template's arguments deduce against its arguments and at least one
19907 of its arguments *does* *not* deduce against the other template's
19908 corresponding argument. Deduction is done as for class templates.
19909 The arguments used in deduction have reference and top level cv
19910 qualifiers removed. Iff both arguments were originally reference
19911 types *and* deduction succeeds in both directions, an lvalue reference
19912 wins against an rvalue reference and otherwise the template
19913 with the more cv-qualified argument wins for that pairing (if
19914 neither is more cv-qualified, they both are equal). Unlike regular
19915 deduction, after all the arguments have been deduced in this way,
19916 we do *not* verify the deduced template argument values can be
19917 substituted into non-deduced contexts.
19919 The logic can be a bit confusing here, because we look at deduce1 and
19920 targs1 to see if pat2 is at least as specialized, and vice versa; if we
19921 can find template arguments for pat1 to make arg1 look like arg2, that
19922 means that arg2 is at least as specialized as arg1. */
19925 more_specialized_fn (tree pat1
, tree pat2
, int len
)
19927 tree decl1
= DECL_TEMPLATE_RESULT (pat1
);
19928 tree decl2
= DECL_TEMPLATE_RESULT (pat2
);
19929 tree targs1
= make_tree_vec (DECL_NTPARMS (pat1
));
19930 tree targs2
= make_tree_vec (DECL_NTPARMS (pat2
));
19931 tree tparms1
= DECL_INNERMOST_TEMPLATE_PARMS (pat1
);
19932 tree tparms2
= DECL_INNERMOST_TEMPLATE_PARMS (pat2
);
19933 tree args1
= TYPE_ARG_TYPES (TREE_TYPE (decl1
));
19934 tree args2
= TYPE_ARG_TYPES (TREE_TYPE (decl2
));
19935 tree origs1
, origs2
;
19936 bool lose1
= false;
19937 bool lose2
= false;
19939 /* Remove the this parameter from non-static member functions. If
19940 one is a non-static member function and the other is not a static
19941 member function, remove the first parameter from that function
19942 also. This situation occurs for operator functions where we
19943 locate both a member function (with this pointer) and non-member
19944 operator (with explicit first operand). */
19945 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl1
))
19947 len
--; /* LEN is the number of significant arguments for DECL1 */
19948 args1
= TREE_CHAIN (args1
);
19949 if (!DECL_STATIC_FUNCTION_P (decl2
))
19950 args2
= TREE_CHAIN (args2
);
19952 else if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl2
))
19954 args2
= TREE_CHAIN (args2
);
19955 if (!DECL_STATIC_FUNCTION_P (decl1
))
19958 args1
= TREE_CHAIN (args1
);
19962 /* If only one is a conversion operator, they are unordered. */
19963 if (DECL_CONV_FN_P (decl1
) != DECL_CONV_FN_P (decl2
))
19966 /* Consider the return type for a conversion function */
19967 if (DECL_CONV_FN_P (decl1
))
19969 args1
= tree_cons (NULL_TREE
, TREE_TYPE (TREE_TYPE (decl1
)), args1
);
19970 args2
= tree_cons (NULL_TREE
, TREE_TYPE (TREE_TYPE (decl2
)), args2
);
19974 processing_template_decl
++;
19980 /* Stop when an ellipsis is seen. */
19981 && args1
!= NULL_TREE
&& args2
!= NULL_TREE
)
19983 tree arg1
= TREE_VALUE (args1
);
19984 tree arg2
= TREE_VALUE (args2
);
19985 int deduce1
, deduce2
;
19991 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
19992 && TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
19994 /* When both arguments are pack expansions, we need only
19995 unify the patterns themselves. */
19996 arg1
= PACK_EXPANSION_PATTERN (arg1
);
19997 arg2
= PACK_EXPANSION_PATTERN (arg2
);
19999 /* This is the last comparison we need to do. */
20003 if (TREE_CODE (arg1
) == REFERENCE_TYPE
)
20005 ref1
= TYPE_REF_IS_RVALUE (arg1
) + 1;
20006 arg1
= TREE_TYPE (arg1
);
20007 quals1
= cp_type_quals (arg1
);
20010 if (TREE_CODE (arg2
) == REFERENCE_TYPE
)
20012 ref2
= TYPE_REF_IS_RVALUE (arg2
) + 1;
20013 arg2
= TREE_TYPE (arg2
);
20014 quals2
= cp_type_quals (arg2
);
20017 arg1
= TYPE_MAIN_VARIANT (arg1
);
20018 arg2
= TYPE_MAIN_VARIANT (arg2
);
20020 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
)
20022 int i
, len2
= list_length (args2
);
20023 tree parmvec
= make_tree_vec (1);
20024 tree argvec
= make_tree_vec (len2
);
20027 /* Setup the parameter vector, which contains only ARG1. */
20028 TREE_VEC_ELT (parmvec
, 0) = arg1
;
20030 /* Setup the argument vector, which contains the remaining
20032 for (i
= 0; i
< len2
; i
++, ta
= TREE_CHAIN (ta
))
20033 TREE_VEC_ELT (argvec
, i
) = TREE_VALUE (ta
);
20035 deduce1
= (unify_pack_expansion (tparms1
, targs1
, parmvec
,
20036 argvec
, DEDUCE_EXACT
,
20037 /*subr=*/true, /*explain_p=*/false)
20040 /* We cannot deduce in the other direction, because ARG1 is
20041 a pack expansion but ARG2 is not. */
20044 else if (TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
20046 int i
, len1
= list_length (args1
);
20047 tree parmvec
= make_tree_vec (1);
20048 tree argvec
= make_tree_vec (len1
);
20051 /* Setup the parameter vector, which contains only ARG1. */
20052 TREE_VEC_ELT (parmvec
, 0) = arg2
;
20054 /* Setup the argument vector, which contains the remaining
20056 for (i
= 0; i
< len1
; i
++, ta
= TREE_CHAIN (ta
))
20057 TREE_VEC_ELT (argvec
, i
) = TREE_VALUE (ta
);
20059 deduce2
= (unify_pack_expansion (tparms2
, targs2
, parmvec
,
20060 argvec
, DEDUCE_EXACT
,
20061 /*subr=*/true, /*explain_p=*/false)
20064 /* We cannot deduce in the other direction, because ARG2 is
20065 a pack expansion but ARG1 is not.*/
20071 /* The normal case, where neither argument is a pack
20073 deduce1
= (unify (tparms1
, targs1
, arg1
, arg2
,
20074 UNIFY_ALLOW_NONE
, /*explain_p=*/false)
20076 deduce2
= (unify (tparms2
, targs2
, arg2
, arg1
,
20077 UNIFY_ALLOW_NONE
, /*explain_p=*/false)
20081 /* If we couldn't deduce arguments for tparms1 to make arg1 match
20082 arg2, then arg2 is not as specialized as arg1. */
20088 /* "If, for a given type, deduction succeeds in both directions
20089 (i.e., the types are identical after the transformations above)
20090 and both P and A were reference types (before being replaced with
20091 the type referred to above):
20092 - if the type from the argument template was an lvalue reference and
20093 the type from the parameter template was not, the argument type is
20094 considered to be more specialized than the other; otherwise,
20095 - if the type from the argument template is more cv-qualified
20096 than the type from the parameter template (as described above),
20097 the argument type is considered to be more specialized than the other;
20099 - neither type is more specialized than the other." */
20101 if (deduce1
&& deduce2
)
20103 if (ref1
&& ref2
&& ref1
!= ref2
)
20110 else if (quals1
!= quals2
&& quals1
>= 0 && quals2
>= 0)
20112 if ((quals1
& quals2
) == quals2
)
20114 if ((quals1
& quals2
) == quals1
)
20119 if (lose1
&& lose2
)
20120 /* We've failed to deduce something in either direction.
20121 These must be unordered. */
20124 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
20125 || TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
20126 /* We have already processed all of the arguments in our
20127 handing of the pack expansion type. */
20130 args1
= TREE_CHAIN (args1
);
20131 args2
= TREE_CHAIN (args2
);
20134 /* "In most cases, all template parameters must have values in order for
20135 deduction to succeed, but for partial ordering purposes a template
20136 parameter may remain without a value provided it is not used in the
20137 types being used for partial ordering."
20139 Thus, if we are missing any of the targs1 we need to substitute into
20140 origs1, then pat2 is not as specialized as pat1. This can happen when
20141 there is a nondeduced context. */
20142 if (!lose2
&& check_undeduced_parms (targs1
, origs1
, args1
))
20144 if (!lose1
&& check_undeduced_parms (targs2
, origs2
, args2
))
20147 processing_template_decl
--;
20149 /* If both deductions succeed, the partial ordering selects the more
20150 constrained template. */
20151 if (!lose1
&& !lose2
)
20153 tree c1
= get_constraints (DECL_TEMPLATE_RESULT (pat1
));
20154 tree c2
= get_constraints (DECL_TEMPLATE_RESULT (pat2
));
20155 lose1
= !subsumes_constraints (c1
, c2
);
20156 lose2
= !subsumes_constraints (c2
, c1
);
20159 /* All things being equal, if the next argument is a pack expansion
20160 for one function but not for the other, prefer the
20161 non-variadic function. FIXME this is bogus; see c++/41958. */
20163 && args1
&& TREE_VALUE (args1
)
20164 && args2
&& TREE_VALUE (args2
))
20166 lose1
= TREE_CODE (TREE_VALUE (args1
)) == TYPE_PACK_EXPANSION
;
20167 lose2
= TREE_CODE (TREE_VALUE (args2
)) == TYPE_PACK_EXPANSION
;
20170 if (lose1
== lose2
)
20178 /* Determine which of two partial specializations of TMPL is more
20181 PAT1 is a TREE_LIST whose TREE_VALUE is the TEMPLATE_DECL corresponding
20182 to the first partial specialization. The TREE_PURPOSE is the
20183 innermost set of template parameters for the partial
20184 specialization. PAT2 is similar, but for the second template.
20186 Return 1 if the first partial specialization is more specialized;
20187 -1 if the second is more specialized; 0 if neither is more
20190 See [temp.class.order] for information about determining which of
20191 two templates is more specialized. */
20194 more_specialized_partial_spec (tree tmpl
, tree pat1
, tree pat2
)
20198 bool any_deductions
= false;
20200 tree tmpl1
= TREE_VALUE (pat1
);
20201 tree tmpl2
= TREE_VALUE (pat2
);
20202 tree parms1
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl1
);
20203 tree parms2
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl2
);
20204 tree specargs1
= TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (tmpl1
)));
20205 tree specargs2
= TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (tmpl2
)));
20207 /* Just like what happens for functions, if we are ordering between
20208 different template specializations, we may encounter dependent
20209 types in the arguments, and we need our dependency check functions
20210 to behave correctly. */
20211 ++processing_template_decl
;
20212 targs
= get_partial_spec_bindings (tmpl
, parms1
, specargs1
, specargs2
);
20216 any_deductions
= true;
20219 targs
= get_partial_spec_bindings (tmpl
, parms2
, specargs2
, specargs1
);
20223 any_deductions
= true;
20225 --processing_template_decl
;
20227 /* If both deductions succeed, the partial ordering selects the more
20228 constrained template. */
20229 if (!winner
&& any_deductions
)
20230 return more_constrained (tmpl1
, tmpl2
);
20232 /* In the case of a tie where at least one of the templates
20233 has a parameter pack at the end, the template with the most
20234 non-packed parameters wins. */
20237 && (template_args_variadic_p (TREE_PURPOSE (pat1
))
20238 || template_args_variadic_p (TREE_PURPOSE (pat2
))))
20240 tree args1
= INNERMOST_TEMPLATE_ARGS (TREE_PURPOSE (pat1
));
20241 tree args2
= INNERMOST_TEMPLATE_ARGS (TREE_PURPOSE (pat2
));
20242 int len1
= TREE_VEC_LENGTH (args1
);
20243 int len2
= TREE_VEC_LENGTH (args2
);
20245 /* We don't count the pack expansion at the end. */
20246 if (template_args_variadic_p (TREE_PURPOSE (pat1
)))
20248 if (template_args_variadic_p (TREE_PURPOSE (pat2
)))
20253 else if (len1
< len2
)
20260 /* Return the template arguments that will produce the function signature
20261 DECL from the function template FN, with the explicit template
20262 arguments EXPLICIT_ARGS. If CHECK_RETTYPE is true, the return type must
20263 also match. Return NULL_TREE if no satisfactory arguments could be
20267 get_bindings (tree fn
, tree decl
, tree explicit_args
, bool check_rettype
)
20269 int ntparms
= DECL_NTPARMS (fn
);
20270 tree targs
= make_tree_vec (ntparms
);
20271 tree decl_type
= TREE_TYPE (decl
);
20272 tree decl_arg_types
;
20274 unsigned int nargs
, ix
;
20277 gcc_assert (decl
!= DECL_TEMPLATE_RESULT (fn
));
20279 /* Never do unification on the 'this' parameter. */
20280 decl_arg_types
= skip_artificial_parms_for (decl
,
20281 TYPE_ARG_TYPES (decl_type
));
20283 nargs
= list_length (decl_arg_types
);
20284 args
= XALLOCAVEC (tree
, nargs
);
20285 for (arg
= decl_arg_types
, ix
= 0;
20286 arg
!= NULL_TREE
&& arg
!= void_list_node
;
20287 arg
= TREE_CHAIN (arg
), ++ix
)
20288 args
[ix
] = TREE_VALUE (arg
);
20290 if (fn_type_unification (fn
, explicit_args
, targs
,
20292 (check_rettype
|| DECL_CONV_FN_P (fn
)
20293 ? TREE_TYPE (decl_type
) : NULL_TREE
),
20294 DEDUCE_EXACT
, LOOKUP_NORMAL
, /*explain_p=*/false,
20296 == error_mark_node
)
20302 /* Return the innermost template arguments that, when applied to a partial
20303 specialization of TMPL whose innermost template parameters are
20304 TPARMS, and whose specialization arguments are SPEC_ARGS, yield the
20307 For example, suppose we have:
20309 template <class T, class U> struct S {};
20310 template <class T> struct S<T*, int> {};
20312 Then, suppose we want to get `S<double*, int>'. The TPARMS will be
20313 {T}, the SPEC_ARGS will be {T*, int} and the ARGS will be {double*,
20314 int}. The resulting vector will be {double}, indicating that `T'
20315 is bound to `double'. */
20318 get_partial_spec_bindings (tree tmpl
, tree tparms
, tree spec_args
, tree args
)
20320 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
20322 tree innermost_deduced_args
;
20324 innermost_deduced_args
= make_tree_vec (ntparms
);
20325 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
20327 deduced_args
= copy_node (args
);
20328 SET_TMPL_ARGS_LEVEL (deduced_args
,
20329 TMPL_ARGS_DEPTH (deduced_args
),
20330 innermost_deduced_args
);
20333 deduced_args
= innermost_deduced_args
;
20335 if (unify (tparms
, deduced_args
,
20336 INNERMOST_TEMPLATE_ARGS (spec_args
),
20337 INNERMOST_TEMPLATE_ARGS (args
),
20338 UNIFY_ALLOW_NONE
, /*explain_p=*/false))
20341 for (i
= 0; i
< ntparms
; ++i
)
20342 if (! TREE_VEC_ELT (innermost_deduced_args
, i
))
20345 /* Verify that nondeduced template arguments agree with the type
20346 obtained from argument deduction.
20350 struct A { typedef int X; };
20351 template <class T, class U> struct C {};
20352 template <class T> struct C<T, typename T::X> {};
20354 Then with the instantiation `C<A, int>', we can deduce that
20355 `T' is `A' but unify () does not check whether `typename T::X'
20357 spec_args
= tsubst (spec_args
, deduced_args
, tf_none
, NULL_TREE
);
20358 spec_args
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
20360 tf_none
, false, false);
20361 if (spec_args
== error_mark_node
20362 /* We only need to check the innermost arguments; the other
20363 arguments will always agree. */
20364 || !comp_template_args (INNERMOST_TEMPLATE_ARGS (spec_args
),
20365 INNERMOST_TEMPLATE_ARGS (args
)))
20368 /* Now that we have bindings for all of the template arguments,
20369 ensure that the arguments deduced for the template template
20370 parameters have compatible template parameter lists. See the use
20371 of template_template_parm_bindings_ok_p in fn_type_unification
20372 for more information. */
20373 if (!template_template_parm_bindings_ok_p (tparms
, deduced_args
))
20376 return deduced_args
;
20379 // Compare two function templates T1 and T2 by deducing bindings
20380 // from one against the other. If both deductions succeed, compare
20381 // constraints to see which is more constrained.
20383 more_specialized_inst (tree t1
, tree t2
)
20388 if (get_bindings (t1
, DECL_TEMPLATE_RESULT (t2
), NULL_TREE
, true))
20394 if (get_bindings (t2
, DECL_TEMPLATE_RESULT (t1
), NULL_TREE
, true))
20400 // If both deductions succeed, then one may be more constrained.
20401 if (count
== 2 && fate
== 0)
20402 fate
= more_constrained (t1
, t2
);
20407 /* TEMPLATES is a TREE_LIST. Each TREE_VALUE is a TEMPLATE_DECL.
20408 Return the TREE_LIST node with the most specialized template, if
20409 any. If there is no most specialized template, the error_mark_node
20412 Note that this function does not look at, or modify, the
20413 TREE_PURPOSE or TREE_TYPE of any of the nodes. Since the node
20414 returned is one of the elements of INSTANTIATIONS, callers may
20415 store information in the TREE_PURPOSE or TREE_TYPE of the nodes,
20416 and retrieve it from the value returned. */
20419 most_specialized_instantiation (tree templates
)
20423 ++processing_template_decl
;
20426 for (fn
= TREE_CHAIN (templates
); fn
; fn
= TREE_CHAIN (fn
))
20428 int fate
= more_specialized_inst (TREE_VALUE (champ
), TREE_VALUE (fn
));
20433 /* Equally specialized, move to next function. If there
20434 is no next function, nothing's most specialized. */
20435 fn
= TREE_CHAIN (fn
);
20443 /* Now verify that champ is better than everything earlier in the
20444 instantiation list. */
20445 for (fn
= templates
; fn
!= champ
; fn
= TREE_CHAIN (fn
)) {
20446 if (more_specialized_inst (TREE_VALUE (champ
), TREE_VALUE (fn
)) != 1)
20453 processing_template_decl
--;
20456 return error_mark_node
;
20461 /* If DECL is a specialization of some template, return the most
20462 general such template. Otherwise, returns NULL_TREE.
20464 For example, given:
20466 template <class T> struct S { template <class U> void f(U); };
20468 if TMPL is `template <class U> void S<int>::f(U)' this will return
20469 the full template. This function will not trace past partial
20470 specializations, however. For example, given in addition:
20472 template <class T> struct S<T*> { template <class U> void f(U); };
20474 if TMPL is `template <class U> void S<int*>::f(U)' this will return
20475 `template <class T> template <class U> S<T*>::f(U)'. */
20478 most_general_template (tree decl
)
20480 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
20482 if (tree tinfo
= get_template_info (decl
))
20483 decl
= TI_TEMPLATE (tinfo
);
20484 /* The TI_TEMPLATE can be an IDENTIFIER_NODE for a
20485 template friend, or a FIELD_DECL for a capture pack. */
20486 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
20490 /* Look for more and more general templates. */
20491 while (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
))
20493 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE in some cases.
20494 (See cp-tree.h for details.) */
20495 if (TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
20498 if (CLASS_TYPE_P (TREE_TYPE (decl
))
20499 && !TYPE_DECL_ALIAS_P (TYPE_NAME (TREE_TYPE (decl
)))
20500 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)))
20503 /* Stop if we run into an explicitly specialized class template. */
20504 if (!DECL_NAMESPACE_SCOPE_P (decl
)
20505 && DECL_CONTEXT (decl
)
20506 && CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (decl
)))
20509 decl
= DECL_TI_TEMPLATE (decl
);
20515 /* Return the most specialized of the template partial specializations
20516 which can produce TARGET, a specialization of some class or variable
20517 template. The value returned is actually a TREE_LIST; the TREE_VALUE is
20518 a TEMPLATE_DECL node corresponding to the partial specialization, while
20519 the TREE_PURPOSE is the set of template arguments that must be
20520 substituted into the template pattern in order to generate TARGET.
20522 If the choice of partial specialization is ambiguous, a diagnostic
20523 is issued, and the error_mark_node is returned. If there are no
20524 partial specializations matching TARGET, then NULL_TREE is
20525 returned, indicating that the primary template should be used. */
20528 most_specialized_partial_spec (tree target
, tsubst_flags_t complain
)
20530 tree list
= NULL_TREE
;
20535 tree outer_args
= NULL_TREE
;
20538 if (TYPE_P (target
))
20540 tree tinfo
= CLASSTYPE_TEMPLATE_INFO (target
);
20541 tmpl
= TI_TEMPLATE (tinfo
);
20542 args
= TI_ARGS (tinfo
);
20544 else if (TREE_CODE (target
) == TEMPLATE_ID_EXPR
)
20546 tmpl
= TREE_OPERAND (target
, 0);
20547 args
= TREE_OPERAND (target
, 1);
20549 else if (VAR_P (target
))
20551 tree tinfo
= DECL_TEMPLATE_INFO (target
);
20552 tmpl
= TI_TEMPLATE (tinfo
);
20553 args
= TI_ARGS (tinfo
);
20556 gcc_unreachable ();
20558 tree main_tmpl
= most_general_template (tmpl
);
20560 /* For determining which partial specialization to use, only the
20561 innermost args are interesting. */
20562 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
20564 outer_args
= strip_innermost_template_args (args
, 1);
20565 args
= INNERMOST_TEMPLATE_ARGS (args
);
20568 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (main_tmpl
); t
; t
= TREE_CHAIN (t
))
20570 tree partial_spec_args
;
20572 tree spec_tmpl
= TREE_VALUE (t
);
20574 partial_spec_args
= TREE_PURPOSE (t
);
20576 ++processing_template_decl
;
20580 /* Discard the outer levels of args, and then substitute in the
20581 template args from the enclosing class. */
20582 partial_spec_args
= INNERMOST_TEMPLATE_ARGS (partial_spec_args
);
20583 partial_spec_args
= tsubst_template_args
20584 (partial_spec_args
, outer_args
, tf_none
, NULL_TREE
);
20586 /* And the same for the partial specialization TEMPLATE_DECL. */
20587 spec_tmpl
= tsubst (spec_tmpl
, outer_args
, tf_none
, NULL_TREE
);
20590 partial_spec_args
=
20591 coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
20594 /*require_all_args=*/true,
20595 /*use_default_args=*/true);
20597 --processing_template_decl
;
20599 if (partial_spec_args
== error_mark_node
)
20600 return error_mark_node
;
20601 if (spec_tmpl
== error_mark_node
)
20602 return error_mark_node
;
20604 tree parms
= DECL_INNERMOST_TEMPLATE_PARMS (spec_tmpl
);
20605 spec_args
= get_partial_spec_bindings (tmpl
, parms
,
20611 spec_args
= add_to_template_args (outer_args
, spec_args
);
20613 /* Keep the candidate only if the constraints are satisfied,
20614 or if we're not compiling with concepts. */
20616 || constraints_satisfied_p (spec_tmpl
, spec_args
))
20618 list
= tree_cons (spec_args
, TREE_VALUE (t
), list
);
20619 TREE_TYPE (list
) = TREE_TYPE (t
);
20627 ambiguous_p
= false;
20630 t
= TREE_CHAIN (t
);
20631 for (; t
; t
= TREE_CHAIN (t
))
20633 fate
= more_specialized_partial_spec (tmpl
, champ
, t
);
20640 t
= TREE_CHAIN (t
);
20643 ambiguous_p
= true;
20652 for (t
= list
; t
&& t
!= champ
; t
= TREE_CHAIN (t
))
20654 fate
= more_specialized_partial_spec (tmpl
, champ
, t
);
20657 ambiguous_p
= true;
20665 char *spaces
= NULL
;
20666 if (!(complain
& tf_error
))
20667 return error_mark_node
;
20668 if (TYPE_P (target
))
20669 error ("ambiguous template instantiation for %q#T", target
);
20671 error ("ambiguous template instantiation for %q#D", target
);
20672 str
= ngettext ("candidate is:", "candidates are:", list_length (list
));
20673 for (t
= list
; t
; t
= TREE_CHAIN (t
))
20675 tree subst
= build_tree_list (TREE_VALUE (t
), TREE_PURPOSE (t
));
20676 inform (DECL_SOURCE_LOCATION (TREE_VALUE (t
)),
20677 "%s %#S", spaces
? spaces
: str
, subst
);
20678 spaces
= spaces
? spaces
: get_spaces (str
);
20681 return error_mark_node
;
20687 /* Explicitly instantiate DECL. */
20690 do_decl_instantiation (tree decl
, tree storage
)
20692 tree result
= NULL_TREE
;
20695 if (!decl
|| decl
== error_mark_node
)
20696 /* An error occurred, for which grokdeclarator has already issued
20697 an appropriate message. */
20699 else if (! DECL_LANG_SPECIFIC (decl
))
20701 error ("explicit instantiation of non-template %q#D", decl
);
20705 bool var_templ
= (DECL_TEMPLATE_INFO (decl
)
20706 && variable_template_p (DECL_TI_TEMPLATE (decl
)));
20708 if (VAR_P (decl
) && !var_templ
)
20710 /* There is an asymmetry here in the way VAR_DECLs and
20711 FUNCTION_DECLs are handled by grokdeclarator. In the case of
20712 the latter, the DECL we get back will be marked as a
20713 template instantiation, and the appropriate
20714 DECL_TEMPLATE_INFO will be set up. This does not happen for
20715 VAR_DECLs so we do the lookup here. Probably, grokdeclarator
20716 should handle VAR_DECLs as it currently handles
20718 if (!DECL_CLASS_SCOPE_P (decl
))
20720 error ("%qD is not a static data member of a class template", decl
);
20723 result
= lookup_field (DECL_CONTEXT (decl
), DECL_NAME (decl
), 0, false);
20724 if (!result
|| !VAR_P (result
))
20726 error ("no matching template for %qD found", decl
);
20729 if (!same_type_p (TREE_TYPE (result
), TREE_TYPE (decl
)))
20731 error ("type %qT for explicit instantiation %qD does not match "
20732 "declared type %qT", TREE_TYPE (result
), decl
,
20737 else if (TREE_CODE (decl
) != FUNCTION_DECL
&& !var_templ
)
20739 error ("explicit instantiation of %q#D", decl
);
20745 /* Check for various error cases. Note that if the explicit
20746 instantiation is valid the RESULT will currently be marked as an
20747 *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set
20748 until we get here. */
20750 if (DECL_TEMPLATE_SPECIALIZATION (result
))
20752 /* DR 259 [temp.spec].
20754 Both an explicit instantiation and a declaration of an explicit
20755 specialization shall not appear in a program unless the explicit
20756 instantiation follows a declaration of the explicit specialization.
20758 For a given set of template parameters, if an explicit
20759 instantiation of a template appears after a declaration of an
20760 explicit specialization for that template, the explicit
20761 instantiation has no effect. */
20764 else if (DECL_EXPLICIT_INSTANTIATION (result
))
20768 No program shall explicitly instantiate any template more
20771 We check DECL_NOT_REALLY_EXTERN so as not to complain when
20772 the first instantiation was `extern' and the second is not,
20773 and EXTERN_P for the opposite case. */
20774 if (DECL_NOT_REALLY_EXTERN (result
) && !extern_p
)
20775 permerror (input_location
, "duplicate explicit instantiation of %q#D", result
);
20776 /* If an "extern" explicit instantiation follows an ordinary
20777 explicit instantiation, the template is instantiated. */
20781 else if (!DECL_IMPLICIT_INSTANTIATION (result
))
20783 error ("no matching template for %qD found", result
);
20786 else if (!DECL_TEMPLATE_INFO (result
))
20788 permerror (input_location
, "explicit instantiation of non-template %q#D", result
);
20792 if (storage
== NULL_TREE
)
20794 else if (storage
== ridpointers
[(int) RID_EXTERN
])
20796 if (!in_system_header_at (input_location
) && (cxx_dialect
== cxx98
))
20797 pedwarn (input_location
, OPT_Wpedantic
,
20798 "ISO C++ 1998 forbids the use of %<extern%> on explicit "
20803 error ("storage class %qD applied to template instantiation", storage
);
20805 check_explicit_instantiation_namespace (result
);
20806 mark_decl_instantiated (result
, extern_p
);
20808 instantiate_decl (result
, /*defer_ok=*/1,
20809 /*expl_inst_class_mem_p=*/false);
20813 mark_class_instantiated (tree t
, int extern_p
)
20815 SET_CLASSTYPE_EXPLICIT_INSTANTIATION (t
);
20816 SET_CLASSTYPE_INTERFACE_KNOWN (t
);
20817 CLASSTYPE_INTERFACE_ONLY (t
) = extern_p
;
20818 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (t
)) = extern_p
;
20821 CLASSTYPE_DEBUG_REQUESTED (t
) = 1;
20822 rest_of_type_compilation (t
, 1);
20826 /* Called from do_type_instantiation through binding_table_foreach to
20827 do recursive instantiation for the type bound in ENTRY. */
20829 bt_instantiate_type_proc (binding_entry entry
, void *data
)
20831 tree storage
= *(tree
*) data
;
20833 if (MAYBE_CLASS_TYPE_P (entry
->type
)
20834 && !uses_template_parms (CLASSTYPE_TI_ARGS (entry
->type
)))
20835 do_type_instantiation (TYPE_MAIN_DECL (entry
->type
), storage
, 0);
20838 /* Called from do_type_instantiation to instantiate a member
20839 (a member function or a static member variable) of an
20840 explicitly instantiated class template. */
20842 instantiate_class_member (tree decl
, int extern_p
)
20844 mark_decl_instantiated (decl
, extern_p
);
20846 instantiate_decl (decl
, /*defer_ok=*/1,
20847 /*expl_inst_class_mem_p=*/true);
20850 /* Perform an explicit instantiation of template class T. STORAGE, if
20851 non-null, is the RID for extern, inline or static. COMPLAIN is
20852 nonzero if this is called from the parser, zero if called recursively,
20853 since the standard is unclear (as detailed below). */
20856 do_type_instantiation (tree t
, tree storage
, tsubst_flags_t complain
)
20861 int previous_instantiation_extern_p
= 0;
20863 if (TREE_CODE (t
) == TYPE_DECL
)
20866 if (! CLASS_TYPE_P (t
) || ! CLASSTYPE_TEMPLATE_INFO (t
))
20869 (TYPE_TEMPLATE_INFO (t
)) ? TYPE_TI_TEMPLATE (t
) : NULL
;
20871 error ("explicit instantiation of non-class template %qD", tmpl
);
20873 error ("explicit instantiation of non-template type %qT", t
);
20879 if (!COMPLETE_TYPE_P (t
))
20881 if (complain
& tf_error
)
20882 error ("explicit instantiation of %q#T before definition of template",
20887 if (storage
!= NULL_TREE
)
20889 if (!in_system_header_at (input_location
))
20891 if (storage
== ridpointers
[(int) RID_EXTERN
])
20893 if (cxx_dialect
== cxx98
)
20894 pedwarn (input_location
, OPT_Wpedantic
,
20895 "ISO C++ 1998 forbids the use of %<extern%> on "
20896 "explicit instantiations");
20899 pedwarn (input_location
, OPT_Wpedantic
,
20900 "ISO C++ forbids the use of %qE"
20901 " on explicit instantiations", storage
);
20904 if (storage
== ridpointers
[(int) RID_INLINE
])
20906 else if (storage
== ridpointers
[(int) RID_EXTERN
])
20908 else if (storage
== ridpointers
[(int) RID_STATIC
])
20912 error ("storage class %qD applied to template instantiation",
20918 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
20920 /* DR 259 [temp.spec].
20922 Both an explicit instantiation and a declaration of an explicit
20923 specialization shall not appear in a program unless the explicit
20924 instantiation follows a declaration of the explicit specialization.
20926 For a given set of template parameters, if an explicit
20927 instantiation of a template appears after a declaration of an
20928 explicit specialization for that template, the explicit
20929 instantiation has no effect. */
20932 else if (CLASSTYPE_EXPLICIT_INSTANTIATION (t
))
20936 No program shall explicitly instantiate any template more
20939 If PREVIOUS_INSTANTIATION_EXTERN_P, then the first explicit
20940 instantiation was `extern'. If EXTERN_P then the second is.
20941 These cases are OK. */
20942 previous_instantiation_extern_p
= CLASSTYPE_INTERFACE_ONLY (t
);
20944 if (!previous_instantiation_extern_p
&& !extern_p
20945 && (complain
& tf_error
))
20946 permerror (input_location
, "duplicate explicit instantiation of %q#T", t
);
20948 /* If we've already instantiated the template, just return now. */
20949 if (!CLASSTYPE_INTERFACE_ONLY (t
))
20953 check_explicit_instantiation_namespace (TYPE_NAME (t
));
20954 mark_class_instantiated (t
, extern_p
);
20962 /* In contrast to implicit instantiation, where only the
20963 declarations, and not the definitions, of members are
20964 instantiated, we have here:
20968 The explicit instantiation of a class template specialization
20969 implies the instantiation of all of its members not
20970 previously explicitly specialized in the translation unit
20971 containing the explicit instantiation.
20973 Of course, we can't instantiate member template classes, since
20974 we don't have any arguments for them. Note that the standard
20975 is unclear on whether the instantiation of the members are
20976 *explicit* instantiations or not. However, the most natural
20977 interpretation is that it should be an explicit instantiation. */
20980 for (tmp
= TYPE_METHODS (t
); tmp
; tmp
= DECL_CHAIN (tmp
))
20981 if (TREE_CODE (tmp
) == FUNCTION_DECL
20982 && DECL_TEMPLATE_INSTANTIATION (tmp
))
20983 instantiate_class_member (tmp
, extern_p
);
20985 for (tmp
= TYPE_FIELDS (t
); tmp
; tmp
= DECL_CHAIN (tmp
))
20986 if (VAR_P (tmp
) && DECL_TEMPLATE_INSTANTIATION (tmp
))
20987 instantiate_class_member (tmp
, extern_p
);
20989 if (CLASSTYPE_NESTED_UTDS (t
))
20990 binding_table_foreach (CLASSTYPE_NESTED_UTDS (t
),
20991 bt_instantiate_type_proc
, &storage
);
20995 /* Given a function DECL, which is a specialization of TMPL, modify
20996 DECL to be a re-instantiation of TMPL with the same template
20997 arguments. TMPL should be the template into which tsubst'ing
20998 should occur for DECL, not the most general template.
21000 One reason for doing this is a scenario like this:
21003 void f(const T&, int i);
21005 void g() { f(3, 7); }
21008 void f(const T& t, const int i) { }
21010 Note that when the template is first instantiated, with
21011 instantiate_template, the resulting DECL will have no name for the
21012 first parameter, and the wrong type for the second. So, when we go
21013 to instantiate the DECL, we regenerate it. */
21016 regenerate_decl_from_template (tree decl
, tree tmpl
)
21018 /* The arguments used to instantiate DECL, from the most general
21023 args
= DECL_TI_ARGS (decl
);
21024 code_pattern
= DECL_TEMPLATE_RESULT (tmpl
);
21026 /* Make sure that we can see identifiers, and compute access
21028 push_access_scope (decl
);
21030 if (TREE_CODE (decl
) == FUNCTION_DECL
)
21038 args_depth
= TMPL_ARGS_DEPTH (args
);
21039 parms_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
21040 if (args_depth
> parms_depth
)
21041 args
= get_innermost_template_args (args
, parms_depth
);
21043 specs
= tsubst_exception_specification (TREE_TYPE (code_pattern
),
21044 args
, tf_error
, NULL_TREE
,
21045 /*defer_ok*/false);
21046 if (specs
&& specs
!= error_mark_node
)
21047 TREE_TYPE (decl
) = build_exception_variant (TREE_TYPE (decl
),
21050 /* Merge parameter declarations. */
21051 decl_parm
= skip_artificial_parms_for (decl
,
21052 DECL_ARGUMENTS (decl
));
21054 = skip_artificial_parms_for (code_pattern
,
21055 DECL_ARGUMENTS (code_pattern
));
21056 while (decl_parm
&& !DECL_PACK_P (pattern_parm
))
21061 if (DECL_NAME (decl_parm
) != DECL_NAME (pattern_parm
))
21062 DECL_NAME (decl_parm
) = DECL_NAME (pattern_parm
);
21063 parm_type
= tsubst (TREE_TYPE (pattern_parm
), args
, tf_error
,
21065 parm_type
= type_decays_to (parm_type
);
21066 if (!same_type_p (TREE_TYPE (decl_parm
), parm_type
))
21067 TREE_TYPE (decl_parm
) = parm_type
;
21068 attributes
= DECL_ATTRIBUTES (pattern_parm
);
21069 if (DECL_ATTRIBUTES (decl_parm
) != attributes
)
21071 DECL_ATTRIBUTES (decl_parm
) = attributes
;
21072 cplus_decl_attributes (&decl_parm
, attributes
, /*flags=*/0);
21074 decl_parm
= DECL_CHAIN (decl_parm
);
21075 pattern_parm
= DECL_CHAIN (pattern_parm
);
21077 /* Merge any parameters that match with the function parameter
21079 if (pattern_parm
&& DECL_PACK_P (pattern_parm
))
21082 tree expanded_types
;
21083 /* Expand the TYPE_PACK_EXPANSION that provides the types for
21084 the parameters in this function parameter pack. */
21085 expanded_types
= tsubst_pack_expansion (TREE_TYPE (pattern_parm
),
21086 args
, tf_error
, NULL_TREE
);
21087 len
= TREE_VEC_LENGTH (expanded_types
);
21088 for (i
= 0; i
< len
; i
++)
21093 if (DECL_NAME (decl_parm
) != DECL_NAME (pattern_parm
))
21094 /* Rename the parameter to include the index. */
21095 DECL_NAME (decl_parm
) =
21096 make_ith_pack_parameter_name (DECL_NAME (pattern_parm
), i
);
21097 parm_type
= TREE_VEC_ELT (expanded_types
, i
);
21098 parm_type
= type_decays_to (parm_type
);
21099 if (!same_type_p (TREE_TYPE (decl_parm
), parm_type
))
21100 TREE_TYPE (decl_parm
) = parm_type
;
21101 attributes
= DECL_ATTRIBUTES (pattern_parm
);
21102 if (DECL_ATTRIBUTES (decl_parm
) != attributes
)
21104 DECL_ATTRIBUTES (decl_parm
) = attributes
;
21105 cplus_decl_attributes (&decl_parm
, attributes
, /*flags=*/0);
21107 decl_parm
= DECL_CHAIN (decl_parm
);
21110 /* Merge additional specifiers from the CODE_PATTERN. */
21111 if (DECL_DECLARED_INLINE_P (code_pattern
)
21112 && !DECL_DECLARED_INLINE_P (decl
))
21113 DECL_DECLARED_INLINE_P (decl
) = 1;
21115 else if (VAR_P (decl
))
21117 DECL_INITIAL (decl
) =
21118 tsubst_expr (DECL_INITIAL (code_pattern
), args
,
21119 tf_error
, DECL_TI_TEMPLATE (decl
),
21120 /*integral_constant_expression_p=*/false);
21121 if (VAR_HAD_UNKNOWN_BOUND (decl
))
21122 TREE_TYPE (decl
) = tsubst (TREE_TYPE (code_pattern
), args
,
21123 tf_error
, DECL_TI_TEMPLATE (decl
));
21126 gcc_unreachable ();
21128 pop_access_scope (decl
);
21131 /* Return the TEMPLATE_DECL into which DECL_TI_ARGS(DECL) should be
21132 substituted to get DECL. */
21135 template_for_substitution (tree decl
)
21137 tree tmpl
= DECL_TI_TEMPLATE (decl
);
21139 /* Set TMPL to the template whose DECL_TEMPLATE_RESULT is the pattern
21140 for the instantiation. This is not always the most general
21141 template. Consider, for example:
21144 struct S { template <class U> void f();
21145 template <> void f<int>(); };
21147 and an instantiation of S<double>::f<int>. We want TD to be the
21148 specialization S<T>::f<int>, not the more general S<T>::f<U>. */
21149 while (/* An instantiation cannot have a definition, so we need a
21150 more general template. */
21151 DECL_TEMPLATE_INSTANTIATION (tmpl
)
21152 /* We must also deal with friend templates. Given:
21154 template <class T> struct S {
21155 template <class U> friend void f() {};
21158 S<int>::f<U> say, is not an instantiation of S<T>::f<U>,
21159 so far as the language is concerned, but that's still
21160 where we get the pattern for the instantiation from. On
21161 other hand, if the definition comes outside the class, say:
21163 template <class T> struct S {
21164 template <class U> friend void f();
21166 template <class U> friend void f() {}
21168 we don't need to look any further. That's what the check for
21169 DECL_INITIAL is for. */
21170 || (TREE_CODE (decl
) == FUNCTION_DECL
21171 && DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (tmpl
)
21172 && !DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl
))))
21174 /* The present template, TD, should not be a definition. If it
21175 were a definition, we should be using it! Note that we
21176 cannot restructure the loop to just keep going until we find
21177 a template with a definition, since that might go too far if
21178 a specialization was declared, but not defined. */
21180 /* Fetch the more general template. */
21181 tmpl
= DECL_TI_TEMPLATE (tmpl
);
21187 /* Returns true if we need to instantiate this template instance even if we
21188 know we aren't going to emit it. */
21191 always_instantiate_p (tree decl
)
21193 /* We always instantiate inline functions so that we can inline them. An
21194 explicit instantiation declaration prohibits implicit instantiation of
21195 non-inline functions. With high levels of optimization, we would
21196 normally inline non-inline functions -- but we're not allowed to do
21197 that for "extern template" functions. Therefore, we check
21198 DECL_DECLARED_INLINE_P, rather than possibly_inlined_p. */
21199 return ((TREE_CODE (decl
) == FUNCTION_DECL
21200 && (DECL_DECLARED_INLINE_P (decl
)
21201 || type_uses_auto (TREE_TYPE (TREE_TYPE (decl
)))))
21202 /* And we need to instantiate static data members so that
21203 their initializers are available in integral constant
21206 && decl_maybe_constant_var_p (decl
)));
21209 /* If FN has a noexcept-specifier that hasn't been instantiated yet,
21210 instantiate it now, modifying TREE_TYPE (fn). */
21213 maybe_instantiate_noexcept (tree fn
)
21215 tree fntype
, spec
, noex
, clone
;
21217 /* Don't instantiate a noexcept-specification from template context. */
21218 if (processing_template_decl
)
21221 if (DECL_CLONED_FUNCTION_P (fn
))
21222 fn
= DECL_CLONED_FUNCTION (fn
);
21223 fntype
= TREE_TYPE (fn
);
21224 spec
= TYPE_RAISES_EXCEPTIONS (fntype
);
21226 if (!spec
|| !TREE_PURPOSE (spec
))
21229 noex
= TREE_PURPOSE (spec
);
21231 if (TREE_CODE (noex
) == DEFERRED_NOEXCEPT
)
21233 if (DEFERRED_NOEXCEPT_PATTERN (noex
) == NULL_TREE
)
21234 spec
= get_defaulted_eh_spec (fn
);
21235 else if (push_tinst_level (fn
))
21237 push_access_scope (fn
);
21238 push_deferring_access_checks (dk_no_deferred
);
21239 input_location
= DECL_SOURCE_LOCATION (fn
);
21240 noex
= tsubst_copy_and_build (DEFERRED_NOEXCEPT_PATTERN (noex
),
21241 DEFERRED_NOEXCEPT_ARGS (noex
),
21242 tf_warning_or_error
, fn
,
21243 /*function_p=*/false,
21244 /*integral_constant_expression_p=*/true);
21245 pop_deferring_access_checks ();
21246 pop_access_scope (fn
);
21247 pop_tinst_level ();
21248 spec
= build_noexcept_spec (noex
, tf_warning_or_error
);
21249 if (spec
== error_mark_node
)
21250 spec
= noexcept_false_spec
;
21253 spec
= noexcept_false_spec
;
21255 TREE_TYPE (fn
) = build_exception_variant (fntype
, spec
);
21258 FOR_EACH_CLONE (clone
, fn
)
21260 if (TREE_TYPE (clone
) == fntype
)
21261 TREE_TYPE (clone
) = TREE_TYPE (fn
);
21263 TREE_TYPE (clone
) = build_exception_variant (TREE_TYPE (clone
), spec
);
21267 /* Produce the definition of D, a _DECL generated from a template. If
21268 DEFER_OK is nonzero, then we don't have to actually do the
21269 instantiation now; we just have to do it sometime. Normally it is
21270 an error if this is an explicit instantiation but D is undefined.
21271 EXPL_INST_CLASS_MEM_P is true iff D is a member of an
21272 explicitly instantiated class template. */
21275 instantiate_decl (tree d
, int defer_ok
,
21276 bool expl_inst_class_mem_p
)
21278 tree tmpl
= DECL_TI_TEMPLATE (d
);
21285 bool pattern_defined
;
21286 location_t saved_loc
= input_location
;
21287 int saved_unevaluated_operand
= cp_unevaluated_operand
;
21288 int saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
21292 bool nested
= false;
21294 /* This function should only be used to instantiate templates for
21295 functions and static member variables. */
21296 gcc_assert (VAR_OR_FUNCTION_DECL_P (d
));
21298 /* A concept is never instantiated. */
21299 gcc_assert (!DECL_DECLARED_CONCEPT_P (d
));
21301 /* Variables are never deferred; if instantiation is required, they
21302 are instantiated right away. That allows for better code in the
21303 case that an expression refers to the value of the variable --
21304 if the variable has a constant value the referring expression can
21305 take advantage of that fact. */
21307 || DECL_DECLARED_CONSTEXPR_P (d
))
21310 /* Don't instantiate cloned functions. Instead, instantiate the
21311 functions they cloned. */
21312 if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_CLONED_FUNCTION_P (d
))
21313 d
= DECL_CLONED_FUNCTION (d
);
21315 if (DECL_TEMPLATE_INSTANTIATED (d
)
21316 || (TREE_CODE (d
) == FUNCTION_DECL
21317 && DECL_DEFAULTED_FN (d
) && DECL_INITIAL (d
))
21318 || DECL_TEMPLATE_SPECIALIZATION (d
))
21319 /* D has already been instantiated or explicitly specialized, so
21320 there's nothing for us to do here.
21322 It might seem reasonable to check whether or not D is an explicit
21323 instantiation, and, if so, stop here. But when an explicit
21324 instantiation is deferred until the end of the compilation,
21325 DECL_EXPLICIT_INSTANTIATION is set, even though we still need to do
21326 the instantiation. */
21329 /* Check to see whether we know that this template will be
21330 instantiated in some other file, as with "extern template"
21332 external_p
= (DECL_INTERFACE_KNOWN (d
) && DECL_REALLY_EXTERN (d
));
21334 /* In general, we do not instantiate such templates. */
21335 if (external_p
&& !always_instantiate_p (d
))
21338 gen_tmpl
= most_general_template (tmpl
);
21339 gen_args
= DECL_TI_ARGS (d
);
21341 if (tmpl
!= gen_tmpl
)
21342 /* We should already have the extra args. */
21343 gcc_assert (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (gen_tmpl
))
21344 == TMPL_ARGS_DEPTH (gen_args
));
21345 /* And what's in the hash table should match D. */
21346 gcc_assert ((spec
= retrieve_specialization (gen_tmpl
, gen_args
, 0)) == d
21347 || spec
== NULL_TREE
);
21349 /* This needs to happen before any tsubsting. */
21350 if (! push_tinst_level (d
))
21353 timevar_push (TV_TEMPLATE_INST
);
21355 /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern
21356 for the instantiation. */
21357 td
= template_for_substitution (d
);
21358 code_pattern
= DECL_TEMPLATE_RESULT (td
);
21360 /* We should never be trying to instantiate a member of a class
21361 template or partial specialization. */
21362 gcc_assert (d
!= code_pattern
);
21364 if ((DECL_NAMESPACE_SCOPE_P (d
) && !DECL_INITIALIZED_IN_CLASS_P (d
))
21365 || DECL_TEMPLATE_SPECIALIZATION (td
))
21366 /* In the case of a friend template whose definition is provided
21367 outside the class, we may have too many arguments. Drop the
21368 ones we don't need. The same is true for specializations. */
21369 args
= get_innermost_template_args
21370 (gen_args
, TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (td
)));
21374 if (TREE_CODE (d
) == FUNCTION_DECL
)
21376 deleted_p
= DECL_DELETED_FN (code_pattern
);
21377 pattern_defined
= (DECL_SAVED_TREE (code_pattern
) != NULL_TREE
21378 || DECL_DEFAULTED_OUTSIDE_CLASS_P (code_pattern
)
21384 pattern_defined
= ! DECL_IN_AGGR_P (code_pattern
);
21387 /* We may be in the middle of deferred access check. Disable it now. */
21388 push_deferring_access_checks (dk_no_deferred
);
21390 /* Unless an explicit instantiation directive has already determined
21391 the linkage of D, remember that a definition is available for
21393 if (pattern_defined
21394 && !DECL_INTERFACE_KNOWN (d
)
21395 && !DECL_NOT_REALLY_EXTERN (d
))
21396 mark_definable (d
);
21398 DECL_SOURCE_LOCATION (td
) = DECL_SOURCE_LOCATION (code_pattern
);
21399 DECL_SOURCE_LOCATION (d
) = DECL_SOURCE_LOCATION (code_pattern
);
21400 input_location
= DECL_SOURCE_LOCATION (d
);
21402 /* If D is a member of an explicitly instantiated class template,
21403 and no definition is available, treat it like an implicit
21405 if (!pattern_defined
&& expl_inst_class_mem_p
21406 && DECL_EXPLICIT_INSTANTIATION (d
))
21408 /* Leave linkage flags alone on instantiations with anonymous
21410 if (TREE_PUBLIC (d
))
21412 DECL_NOT_REALLY_EXTERN (d
) = 0;
21413 DECL_INTERFACE_KNOWN (d
) = 0;
21415 SET_DECL_IMPLICIT_INSTANTIATION (d
);
21418 /* Defer all other templates, unless we have been explicitly
21419 forbidden from doing so. */
21420 if (/* If there is no definition, we cannot instantiate the
21423 /* If it's OK to postpone instantiation, do so. */
21425 /* If this is a static data member that will be defined
21426 elsewhere, we don't want to instantiate the entire data
21427 member, but we do want to instantiate the initializer so that
21428 we can substitute that elsewhere. */
21429 || (external_p
&& VAR_P (d
))
21430 /* Handle here a deleted function too, avoid generating
21431 its body (c++/61080). */
21434 /* The definition of the static data member is now required so
21435 we must substitute the initializer. */
21437 && !DECL_INITIAL (d
)
21438 && DECL_INITIAL (code_pattern
))
21442 bool const_init
= false;
21443 bool enter_context
= DECL_CLASS_SCOPE_P (d
);
21445 ns
= decl_namespace_context (d
);
21446 push_nested_namespace (ns
);
21448 push_nested_class (DECL_CONTEXT (d
));
21449 init
= tsubst_expr (DECL_INITIAL (code_pattern
),
21451 tf_warning_or_error
, NULL_TREE
,
21452 /*integral_constant_expression_p=*/false);
21453 /* If instantiating the initializer involved instantiating this
21454 again, don't call cp_finish_decl twice. */
21455 if (!DECL_INITIAL (d
))
21457 /* Make sure the initializer is still constant, in case of
21458 circular dependency (template/instantiate6.C). */
21460 = DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (code_pattern
);
21461 cp_finish_decl (d
, init
, /*init_const_expr_p=*/const_init
,
21462 /*asmspec_tree=*/NULL_TREE
,
21463 LOOKUP_ONLYCONVERTING
);
21466 pop_nested_class ();
21467 pop_nested_namespace (ns
);
21470 /* We restore the source position here because it's used by
21471 add_pending_template. */
21472 input_location
= saved_loc
;
21474 if (at_eof
&& !pattern_defined
21475 && DECL_EXPLICIT_INSTANTIATION (d
)
21476 && DECL_NOT_REALLY_EXTERN (d
))
21479 The definition of a non-exported function template, a
21480 non-exported member function template, or a non-exported
21481 member function or static data member of a class template
21482 shall be present in every translation unit in which it is
21483 explicitly instantiated. */
21484 permerror (input_location
, "explicit instantiation of %qD "
21485 "but no definition available", d
);
21487 /* If we're in unevaluated context, we just wanted to get the
21488 constant value; this isn't an odr use, so don't queue
21489 a full instantiation. */
21490 if (cp_unevaluated_operand
!= 0)
21492 /* ??? Historically, we have instantiated inline functions, even
21493 when marked as "extern template". */
21494 if (!(external_p
&& VAR_P (d
)))
21495 add_pending_template (d
);
21498 /* Tell the repository that D is available in this translation unit
21499 -- and see if it is supposed to be instantiated here. */
21500 if (TREE_PUBLIC (d
) && !DECL_REALLY_EXTERN (d
) && !repo_emit_p (d
))
21502 /* In a PCH file, despite the fact that the repository hasn't
21503 requested instantiation in the PCH it is still possible that
21504 an instantiation will be required in a file that includes the
21507 add_pending_template (d
);
21508 /* Instantiate inline functions so that the inliner can do its
21509 job, even though we'll not be emitting a copy of this
21511 if (!(TREE_CODE (d
) == FUNCTION_DECL
&& possibly_inlined_p (d
)))
21515 fn_context
= decl_function_context (d
);
21516 nested
= (current_function_decl
!= NULL_TREE
);
21517 vec
<tree
> omp_privatization_save
;
21519 save_omp_privatization_clauses (omp_privatization_save
);
21522 push_to_top_level ();
21526 push_function_context ();
21527 cp_unevaluated_operand
= 0;
21528 c_inhibit_evaluation_warnings
= 0;
21531 /* Mark D as instantiated so that recursive calls to
21532 instantiate_decl do not try to instantiate it again. */
21533 DECL_TEMPLATE_INSTANTIATED (d
) = 1;
21535 /* Regenerate the declaration in case the template has been modified
21536 by a subsequent redeclaration. */
21537 regenerate_decl_from_template (d
, td
);
21539 /* We already set the file and line above. Reset them now in case
21540 they changed as a result of calling regenerate_decl_from_template. */
21541 input_location
= DECL_SOURCE_LOCATION (d
);
21546 bool const_init
= false;
21548 /* Clear out DECL_RTL; whatever was there before may not be right
21549 since we've reset the type of the declaration. */
21550 SET_DECL_RTL (d
, NULL
);
21551 DECL_IN_AGGR_P (d
) = 0;
21553 /* The initializer is placed in DECL_INITIAL by
21554 regenerate_decl_from_template so we don't need to
21555 push/pop_access_scope again here. Pull it out so that
21556 cp_finish_decl can process it. */
21557 init
= DECL_INITIAL (d
);
21558 DECL_INITIAL (d
) = NULL_TREE
;
21559 DECL_INITIALIZED_P (d
) = 0;
21561 /* Clear DECL_EXTERNAL so that cp_finish_decl will process the
21562 initializer. That function will defer actual emission until
21563 we have a chance to determine linkage. */
21564 DECL_EXTERNAL (d
) = 0;
21566 /* Enter the scope of D so that access-checking works correctly. */
21567 bool enter_context
= DECL_CLASS_SCOPE_P (d
);
21569 push_nested_class (DECL_CONTEXT (d
));
21571 const_init
= DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (code_pattern
);
21572 cp_finish_decl (d
, init
, const_init
, NULL_TREE
, 0);
21575 pop_nested_class ();
21577 if (variable_template_p (td
))
21578 note_variable_template_instantiation (d
);
21580 else if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_DEFAULTED_FN (code_pattern
))
21581 synthesize_method (d
);
21582 else if (TREE_CODE (d
) == FUNCTION_DECL
)
21584 hash_map
<tree
, tree
> *saved_local_specializations
;
21588 tree block
= NULL_TREE
;
21590 /* Save away the current list, in case we are instantiating one
21591 template from within the body of another. */
21592 saved_local_specializations
= local_specializations
;
21594 /* Set up the list of local specializations. */
21595 local_specializations
= new hash_map
<tree
, tree
>;
21597 /* Set up context. */
21598 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
)
21599 && TREE_CODE (DECL_CONTEXT (code_pattern
)) == FUNCTION_DECL
)
21600 block
= push_stmt_list ();
21602 start_preparsed_function (d
, NULL_TREE
, SF_PRE_PARSED
);
21604 /* Some typedefs referenced from within the template code need to be
21605 access checked at template instantiation time, i.e now. These
21606 types were added to the template at parsing time. Let's get those
21607 and perform the access checks then. */
21608 perform_typedefs_access_check (DECL_TEMPLATE_RESULT (gen_tmpl
),
21611 /* Create substitution entries for the parameters. */
21612 subst_decl
= DECL_TEMPLATE_RESULT (template_for_substitution (d
));
21613 tmpl_parm
= DECL_ARGUMENTS (subst_decl
);
21614 spec_parm
= DECL_ARGUMENTS (d
);
21615 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (d
))
21617 register_local_specialization (spec_parm
, tmpl_parm
);
21618 spec_parm
= skip_artificial_parms_for (d
, spec_parm
);
21619 tmpl_parm
= skip_artificial_parms_for (subst_decl
, tmpl_parm
);
21621 for (; tmpl_parm
; tmpl_parm
= DECL_CHAIN (tmpl_parm
))
21623 if (!DECL_PACK_P (tmpl_parm
))
21625 register_local_specialization (spec_parm
, tmpl_parm
);
21626 spec_parm
= DECL_CHAIN (spec_parm
);
21630 /* Register the (value) argument pack as a specialization of
21631 TMPL_PARM, then move on. */
21632 tree argpack
= extract_fnparm_pack (tmpl_parm
, &spec_parm
);
21633 register_local_specialization (argpack
, tmpl_parm
);
21636 gcc_assert (!spec_parm
);
21638 /* Substitute into the body of the function. */
21639 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
))
21640 tsubst_omp_udr (DECL_SAVED_TREE (code_pattern
), args
,
21641 tf_warning_or_error
, tmpl
);
21644 tsubst_expr (DECL_SAVED_TREE (code_pattern
), args
,
21645 tf_warning_or_error
, tmpl
,
21646 /*integral_constant_expression_p=*/false);
21648 /* Set the current input_location to the end of the function
21649 so that finish_function knows where we are. */
21651 = DECL_STRUCT_FUNCTION (code_pattern
)->function_end_locus
;
21653 /* Remember if we saw an infinite loop in the template. */
21654 current_function_infinite_loop
21655 = DECL_STRUCT_FUNCTION (code_pattern
)->language
->infinite_loop
;
21658 /* We don't need the local specializations any more. */
21659 delete local_specializations
;
21660 local_specializations
= saved_local_specializations
;
21662 /* Finish the function. */
21663 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
)
21664 && TREE_CODE (DECL_CONTEXT (code_pattern
)) == FUNCTION_DECL
)
21665 DECL_SAVED_TREE (d
) = pop_stmt_list (block
);
21668 d
= finish_function (0);
21669 expand_or_defer_fn (d
);
21672 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
))
21673 cp_check_omp_declare_reduction (d
);
21676 /* We're not deferring instantiation any more. */
21677 TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (d
)) = 0;
21680 pop_from_top_level ();
21682 pop_function_context ();
21685 input_location
= saved_loc
;
21686 cp_unevaluated_operand
= saved_unevaluated_operand
;
21687 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
21688 pop_deferring_access_checks ();
21689 pop_tinst_level ();
21691 restore_omp_privatization_clauses (omp_privatization_save
);
21693 timevar_pop (TV_TEMPLATE_INST
);
21698 /* Run through the list of templates that we wish we could
21699 instantiate, and instantiate any we can. RETRIES is the
21700 number of times we retry pending template instantiation. */
21703 instantiate_pending_templates (int retries
)
21706 location_t saved_loc
= input_location
;
21708 /* Instantiating templates may trigger vtable generation. This in turn
21709 may require further template instantiations. We place a limit here
21710 to avoid infinite loop. */
21711 if (pending_templates
&& retries
>= max_tinst_depth
)
21713 tree decl
= pending_templates
->tinst
->decl
;
21715 fatal_error (input_location
,
21716 "template instantiation depth exceeds maximum of %d"
21717 " instantiating %q+D, possibly from virtual table generation"
21718 " (use -ftemplate-depth= to increase the maximum)",
21719 max_tinst_depth
, decl
);
21720 if (TREE_CODE (decl
) == FUNCTION_DECL
)
21721 /* Pretend that we defined it. */
21722 DECL_INITIAL (decl
) = error_mark_node
;
21728 struct pending_template
**t
= &pending_templates
;
21729 struct pending_template
*last
= NULL
;
21733 tree instantiation
= reopen_tinst_level ((*t
)->tinst
);
21734 bool complete
= false;
21736 if (TYPE_P (instantiation
))
21740 if (!COMPLETE_TYPE_P (instantiation
))
21742 instantiate_class_template (instantiation
);
21743 if (CLASSTYPE_TEMPLATE_INSTANTIATION (instantiation
))
21744 for (fn
= TYPE_METHODS (instantiation
);
21746 fn
= TREE_CHAIN (fn
))
21747 if (! DECL_ARTIFICIAL (fn
))
21748 instantiate_decl (fn
,
21750 /*expl_inst_class_mem_p=*/false);
21751 if (COMPLETE_TYPE_P (instantiation
))
21755 complete
= COMPLETE_TYPE_P (instantiation
);
21759 if (!DECL_TEMPLATE_SPECIALIZATION (instantiation
)
21760 && !DECL_TEMPLATE_INSTANTIATED (instantiation
))
21763 = instantiate_decl (instantiation
,
21765 /*expl_inst_class_mem_p=*/false);
21766 if (DECL_TEMPLATE_INSTANTIATED (instantiation
))
21770 complete
= (DECL_TEMPLATE_SPECIALIZATION (instantiation
)
21771 || DECL_TEMPLATE_INSTANTIATED (instantiation
));
21775 /* If INSTANTIATION has been instantiated, then we don't
21776 need to consider it again in the future. */
21784 current_tinst_level
= NULL
;
21786 last_pending_template
= last
;
21788 while (reconsider
);
21790 input_location
= saved_loc
;
21793 /* Substitute ARGVEC into T, which is a list of initializers for
21794 either base class or a non-static data member. The TREE_PURPOSEs
21795 are DECLs, and the TREE_VALUEs are the initializer values. Used by
21796 instantiate_decl. */
21799 tsubst_initializer_list (tree t
, tree argvec
)
21801 tree inits
= NULL_TREE
;
21803 for (; t
; t
= TREE_CHAIN (t
))
21807 tree expanded_bases
= NULL_TREE
;
21808 tree expanded_arguments
= NULL_TREE
;
21811 if (TREE_CODE (TREE_PURPOSE (t
)) == TYPE_PACK_EXPANSION
)
21816 /* Expand the base class expansion type into separate base
21818 expanded_bases
= tsubst_pack_expansion (TREE_PURPOSE (t
), argvec
,
21819 tf_warning_or_error
,
21821 if (expanded_bases
== error_mark_node
)
21824 /* We'll be building separate TREE_LISTs of arguments for
21826 len
= TREE_VEC_LENGTH (expanded_bases
);
21827 expanded_arguments
= make_tree_vec (len
);
21828 for (i
= 0; i
< len
; i
++)
21829 TREE_VEC_ELT (expanded_arguments
, i
) = NULL_TREE
;
21831 /* Build a dummy EXPR_PACK_EXPANSION that will be used to
21832 expand each argument in the TREE_VALUE of t. */
21833 expr
= make_node (EXPR_PACK_EXPANSION
);
21834 PACK_EXPANSION_LOCAL_P (expr
) = true;
21835 PACK_EXPANSION_PARAMETER_PACKS (expr
) =
21836 PACK_EXPANSION_PARAMETER_PACKS (TREE_PURPOSE (t
));
21838 if (TREE_VALUE (t
) == void_type_node
)
21839 /* VOID_TYPE_NODE is used to indicate
21840 value-initialization. */
21842 for (i
= 0; i
< len
; i
++)
21843 TREE_VEC_ELT (expanded_arguments
, i
) = void_type_node
;
21847 /* Substitute parameter packs into each argument in the
21849 in_base_initializer
= 1;
21850 for (arg
= TREE_VALUE (t
); arg
; arg
= TREE_CHAIN (arg
))
21852 tree expanded_exprs
;
21854 /* Expand the argument. */
21855 SET_PACK_EXPANSION_PATTERN (expr
, TREE_VALUE (arg
));
21857 = tsubst_pack_expansion (expr
, argvec
,
21858 tf_warning_or_error
,
21860 if (expanded_exprs
== error_mark_node
)
21863 /* Prepend each of the expanded expressions to the
21864 corresponding TREE_LIST in EXPANDED_ARGUMENTS. */
21865 for (i
= 0; i
< len
; i
++)
21867 TREE_VEC_ELT (expanded_arguments
, i
) =
21868 tree_cons (NULL_TREE
,
21869 TREE_VEC_ELT (expanded_exprs
, i
),
21870 TREE_VEC_ELT (expanded_arguments
, i
));
21873 in_base_initializer
= 0;
21875 /* Reverse all of the TREE_LISTs in EXPANDED_ARGUMENTS,
21876 since we built them backwards. */
21877 for (i
= 0; i
< len
; i
++)
21879 TREE_VEC_ELT (expanded_arguments
, i
) =
21880 nreverse (TREE_VEC_ELT (expanded_arguments
, i
));
21885 for (i
= 0; i
< len
; ++i
)
21887 if (expanded_bases
)
21889 decl
= TREE_VEC_ELT (expanded_bases
, i
);
21890 decl
= expand_member_init (decl
);
21891 init
= TREE_VEC_ELT (expanded_arguments
, i
);
21896 decl
= tsubst_copy (TREE_PURPOSE (t
), argvec
,
21897 tf_warning_or_error
, NULL_TREE
);
21899 decl
= expand_member_init (decl
);
21900 if (decl
&& !DECL_P (decl
))
21901 in_base_initializer
= 1;
21903 init
= TREE_VALUE (t
);
21905 if (init
!= void_type_node
)
21906 init
= tsubst_expr (init
, argvec
,
21907 tf_warning_or_error
, NULL_TREE
,
21908 /*integral_constant_expression_p=*/false);
21909 if (init
== NULL_TREE
&& tmp
!= NULL_TREE
)
21910 /* If we had an initializer but it instantiated to nothing,
21911 value-initialize the object. This will only occur when
21912 the initializer was a pack expansion where the parameter
21913 packs used in that expansion were of length zero. */
21914 init
= void_type_node
;
21915 in_base_initializer
= 0;
21920 init
= build_tree_list (decl
, init
);
21921 TREE_CHAIN (init
) = inits
;
21929 /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */
21932 set_current_access_from_decl (tree decl
)
21934 if (TREE_PRIVATE (decl
))
21935 current_access_specifier
= access_private_node
;
21936 else if (TREE_PROTECTED (decl
))
21937 current_access_specifier
= access_protected_node
;
21939 current_access_specifier
= access_public_node
;
21942 /* Instantiate an enumerated type. TAG is the template type, NEWTAG
21943 is the instantiation (which should have been created with
21944 start_enum) and ARGS are the template arguments to use. */
21947 tsubst_enum (tree tag
, tree newtag
, tree args
)
21951 if (SCOPED_ENUM_P (newtag
))
21952 begin_scope (sk_scoped_enum
, newtag
);
21954 for (e
= TYPE_VALUES (tag
); e
; e
= TREE_CHAIN (e
))
21959 decl
= TREE_VALUE (e
);
21960 /* Note that in a template enum, the TREE_VALUE is the
21961 CONST_DECL, not the corresponding INTEGER_CST. */
21962 value
= tsubst_expr (DECL_INITIAL (decl
),
21963 args
, tf_warning_or_error
, NULL_TREE
,
21964 /*integral_constant_expression_p=*/true);
21966 /* Give this enumeration constant the correct access. */
21967 set_current_access_from_decl (decl
);
21969 /* Actually build the enumerator itself. Here we're assuming that
21970 enumerators can't have dependent attributes. */
21971 build_enumerator (DECL_NAME (decl
), value
, newtag
,
21972 DECL_ATTRIBUTES (decl
), DECL_SOURCE_LOCATION (decl
));
21975 if (SCOPED_ENUM_P (newtag
))
21978 finish_enum_value_list (newtag
);
21979 finish_enum (newtag
);
21981 DECL_SOURCE_LOCATION (TYPE_NAME (newtag
))
21982 = DECL_SOURCE_LOCATION (TYPE_NAME (tag
));
21985 /* DECL is a FUNCTION_DECL that is a template specialization. Return
21986 its type -- but without substituting the innermost set of template
21987 arguments. So, innermost set of template parameters will appear in
21991 get_mostly_instantiated_function_type (tree decl
)
21993 /* For a function, DECL_TI_TEMPLATE is partially instantiated. */
21994 return TREE_TYPE (DECL_TI_TEMPLATE (decl
));
21997 /* Return truthvalue if we're processing a template different from
21998 the last one involved in diagnostics. */
22000 problematic_instantiation_changed (void)
22002 return current_tinst_level
!= last_error_tinst_level
;
22005 /* Remember current template involved in diagnostics. */
22007 record_last_problematic_instantiation (void)
22009 last_error_tinst_level
= current_tinst_level
;
22012 struct tinst_level
*
22013 current_instantiation (void)
22015 return current_tinst_level
;
22018 /* Return TRUE if current_function_decl is being instantiated, false
22022 instantiating_current_function_p (void)
22024 return (current_instantiation ()
22025 && current_instantiation ()->decl
== current_function_decl
);
22028 /* [temp.param] Check that template non-type parm TYPE is of an allowable
22029 type. Return zero for ok, nonzero for disallowed. Issue error and
22030 warning messages under control of COMPLAIN. */
22033 invalid_nontype_parm_type_p (tree type
, tsubst_flags_t complain
)
22035 if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
22037 else if (POINTER_TYPE_P (type
))
22039 else if (TYPE_PTRMEM_P (type
))
22041 else if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
)
22043 else if (TREE_CODE (type
) == TYPENAME_TYPE
)
22045 else if (TREE_CODE (type
) == DECLTYPE_TYPE
)
22047 else if (TREE_CODE (type
) == NULLPTR_TYPE
)
22049 /* A bound template template parm could later be instantiated to have a valid
22050 nontype parm type via an alias template. */
22051 else if (cxx_dialect
>= cxx11
22052 && TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
22055 if (complain
& tf_error
)
22057 if (type
== error_mark_node
)
22058 inform (input_location
, "invalid template non-type parameter");
22060 error ("%q#T is not a valid type for a template non-type parameter",
22066 /* Returns TRUE if TYPE is dependent, in the sense of [temp.dep.type].
22067 Assumes that TYPE really is a type, and not the ERROR_MARK_NODE.*/
22070 dependent_type_p_r (tree type
)
22076 A type is dependent if it is:
22078 -- a template parameter. Template template parameters are types
22079 for us (since TYPE_P holds true for them) so we handle
22081 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
22082 || TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
)
22084 /* -- a qualified-id with a nested-name-specifier which contains a
22085 class-name that names a dependent type or whose unqualified-id
22086 names a dependent type. */
22087 if (TREE_CODE (type
) == TYPENAME_TYPE
)
22090 /* An alias template specialization can be dependent even if the
22091 resulting type is not. */
22092 if (dependent_alias_template_spec_p (type
))
22095 /* -- a cv-qualified type where the cv-unqualified type is
22097 No code is necessary for this bullet; the code below handles
22098 cv-qualified types, and we don't want to strip aliases with
22099 TYPE_MAIN_VARIANT because of DR 1558. */
22100 /* -- a compound type constructed from any dependent type. */
22101 if (TYPE_PTRMEM_P (type
))
22102 return (dependent_type_p (TYPE_PTRMEM_CLASS_TYPE (type
))
22103 || dependent_type_p (TYPE_PTRMEM_POINTED_TO_TYPE
22105 else if (TYPE_PTR_P (type
)
22106 || TREE_CODE (type
) == REFERENCE_TYPE
)
22107 return dependent_type_p (TREE_TYPE (type
));
22108 else if (TREE_CODE (type
) == FUNCTION_TYPE
22109 || TREE_CODE (type
) == METHOD_TYPE
)
22113 if (dependent_type_p (TREE_TYPE (type
)))
22115 for (arg_type
= TYPE_ARG_TYPES (type
);
22117 arg_type
= TREE_CHAIN (arg_type
))
22118 if (dependent_type_p (TREE_VALUE (arg_type
)))
22122 /* -- an array type constructed from any dependent type or whose
22123 size is specified by a constant expression that is
22126 We checked for type- and value-dependence of the bounds in
22127 compute_array_index_type, so TYPE_DEPENDENT_P is already set. */
22128 if (TREE_CODE (type
) == ARRAY_TYPE
)
22130 if (TYPE_DOMAIN (type
)
22131 && dependent_type_p (TYPE_DOMAIN (type
)))
22133 return dependent_type_p (TREE_TYPE (type
));
22136 /* -- a template-id in which either the template name is a template
22138 if (TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
22140 /* ... or any of the template arguments is a dependent type or
22141 an expression that is type-dependent or value-dependent. */
22142 else if (CLASS_TYPE_P (type
) && CLASSTYPE_TEMPLATE_INFO (type
)
22143 && (any_dependent_template_arguments_p
22144 (INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type
)))))
22147 /* All TYPEOF_TYPEs, DECLTYPE_TYPEs, and UNDERLYING_TYPEs are
22148 dependent; if the argument of the `typeof' expression is not
22149 type-dependent, then it should already been have resolved. */
22150 if (TREE_CODE (type
) == TYPEOF_TYPE
22151 || TREE_CODE (type
) == DECLTYPE_TYPE
22152 || TREE_CODE (type
) == UNDERLYING_TYPE
)
22155 /* A template argument pack is dependent if any of its packed
22157 if (TREE_CODE (type
) == TYPE_ARGUMENT_PACK
)
22159 tree args
= ARGUMENT_PACK_ARGS (type
);
22160 int i
, len
= TREE_VEC_LENGTH (args
);
22161 for (i
= 0; i
< len
; ++i
)
22162 if (dependent_template_arg_p (TREE_VEC_ELT (args
, i
)))
22166 /* All TYPE_PACK_EXPANSIONs are dependent, because parameter packs must
22167 be template parameters. */
22168 if (TREE_CODE (type
) == TYPE_PACK_EXPANSION
)
22171 /* The standard does not specifically mention types that are local
22172 to template functions or local classes, but they should be
22173 considered dependent too. For example:
22175 template <int I> void f() {
22180 The size of `E' cannot be known until the value of `I' has been
22181 determined. Therefore, `E' must be considered dependent. */
22182 scope
= TYPE_CONTEXT (type
);
22183 if (scope
&& TYPE_P (scope
))
22184 return dependent_type_p (scope
);
22185 /* Don't use type_dependent_expression_p here, as it can lead
22186 to infinite recursion trying to determine whether a lambda
22187 nested in a lambda is dependent (c++/47687). */
22188 else if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
22189 && DECL_LANG_SPECIFIC (scope
)
22190 && DECL_TEMPLATE_INFO (scope
)
22191 && (any_dependent_template_arguments_p
22192 (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (scope
)))))
22195 /* Other types are non-dependent. */
22199 /* Returns TRUE if TYPE is dependent, in the sense of
22200 [temp.dep.type]. Note that a NULL type is considered dependent. */
22203 dependent_type_p (tree type
)
22205 /* If there are no template parameters in scope, then there can't be
22206 any dependent types. */
22207 if (!processing_template_decl
)
22209 /* If we are not processing a template, then nobody should be
22210 providing us with a dependent type. */
22212 gcc_assert (TREE_CODE (type
) != TEMPLATE_TYPE_PARM
|| is_auto (type
));
22216 /* If the type is NULL, we have not computed a type for the entity
22217 in question; in that case, the type is dependent. */
22221 /* Erroneous types can be considered non-dependent. */
22222 if (type
== error_mark_node
)
22225 /* If we have not already computed the appropriate value for TYPE,
22227 if (!TYPE_DEPENDENT_P_VALID (type
))
22229 TYPE_DEPENDENT_P (type
) = dependent_type_p_r (type
);
22230 TYPE_DEPENDENT_P_VALID (type
) = 1;
22233 return TYPE_DEPENDENT_P (type
);
22236 /* Returns TRUE if SCOPE is a dependent scope, in which we can't do any
22237 lookup. In other words, a dependent type that is not the current
22241 dependent_scope_p (tree scope
)
22243 return (scope
&& TYPE_P (scope
) && dependent_type_p (scope
)
22244 && !currently_open_class (scope
));
22247 /* T is a SCOPE_REF; return whether we need to consider it
22248 instantiation-dependent so that we can check access at instantiation
22249 time even though we know which member it resolves to. */
22252 instantiation_dependent_scope_ref_p (tree t
)
22254 if (DECL_P (TREE_OPERAND (t
, 1))
22255 && CLASS_TYPE_P (TREE_OPERAND (t
, 0))
22256 && accessible_in_template_p (TREE_OPERAND (t
, 0),
22257 TREE_OPERAND (t
, 1)))
22263 /* Returns TRUE if the EXPRESSION is value-dependent, in the sense of
22264 [temp.dep.constexpr]. EXPRESSION is already known to be a constant
22267 /* Note that this predicate is not appropriate for general expressions;
22268 only constant expressions (that satisfy potential_constant_expression)
22269 can be tested for value dependence. */
22272 value_dependent_expression_p (tree expression
)
22274 if (!processing_template_decl
)
22277 /* A name declared with a dependent type. */
22278 if (DECL_P (expression
) && type_dependent_expression_p (expression
))
22281 switch (TREE_CODE (expression
))
22283 case IDENTIFIER_NODE
:
22284 /* A name that has not been looked up -- must be dependent. */
22287 case TEMPLATE_PARM_INDEX
:
22288 /* A non-type template parm. */
22292 /* A non-type template parm. */
22293 if (DECL_TEMPLATE_PARM_P (expression
))
22295 return value_dependent_expression_p (DECL_INITIAL (expression
));
22298 /* A constant with literal type and is initialized
22299 with an expression that is value-dependent.
22301 Note that a non-dependent parenthesized initializer will have
22302 already been replaced with its constant value, so if we see
22303 a TREE_LIST it must be dependent. */
22304 if (DECL_INITIAL (expression
)
22305 && decl_constant_var_p (expression
)
22306 && (TREE_CODE (DECL_INITIAL (expression
)) == TREE_LIST
22307 /* cp_finish_decl doesn't fold reference initializers. */
22308 || TREE_CODE (TREE_TYPE (expression
)) == REFERENCE_TYPE
22309 || value_dependent_expression_p (DECL_INITIAL (expression
))))
22313 case DYNAMIC_CAST_EXPR
:
22314 case STATIC_CAST_EXPR
:
22315 case CONST_CAST_EXPR
:
22316 case REINTERPRET_CAST_EXPR
:
22318 /* These expressions are value-dependent if the type to which
22319 the cast occurs is dependent or the expression being casted
22320 is value-dependent. */
22322 tree type
= TREE_TYPE (expression
);
22324 if (dependent_type_p (type
))
22327 /* A functional cast has a list of operands. */
22328 expression
= TREE_OPERAND (expression
, 0);
22331 /* If there are no operands, it must be an expression such
22332 as "int()". This should not happen for aggregate types
22333 because it would form non-constant expressions. */
22334 gcc_assert (cxx_dialect
>= cxx11
22335 || INTEGRAL_OR_ENUMERATION_TYPE_P (type
));
22340 if (TREE_CODE (expression
) == TREE_LIST
)
22341 return any_value_dependent_elements_p (expression
);
22343 return value_dependent_expression_p (expression
);
22347 if (SIZEOF_EXPR_TYPE_P (expression
))
22348 return dependent_type_p (TREE_TYPE (TREE_OPERAND (expression
, 0)));
22352 /* A `sizeof' expression is value-dependent if the operand is
22353 type-dependent or is a pack expansion. */
22354 expression
= TREE_OPERAND (expression
, 0);
22355 if (PACK_EXPANSION_P (expression
))
22357 else if (TYPE_P (expression
))
22358 return dependent_type_p (expression
);
22359 return instantiation_dependent_expression_p (expression
);
22361 case AT_ENCODE_EXPR
:
22362 /* An 'encode' expression is value-dependent if the operand is
22364 expression
= TREE_OPERAND (expression
, 0);
22365 return dependent_type_p (expression
);
22367 case NOEXCEPT_EXPR
:
22368 expression
= TREE_OPERAND (expression
, 0);
22369 return instantiation_dependent_expression_p (expression
);
22372 /* All instantiation-dependent expressions should also be considered
22373 value-dependent. */
22374 return instantiation_dependent_scope_ref_p (expression
);
22376 case COMPONENT_REF
:
22377 return (value_dependent_expression_p (TREE_OPERAND (expression
, 0))
22378 || value_dependent_expression_p (TREE_OPERAND (expression
, 1)));
22380 case NONTYPE_ARGUMENT_PACK
:
22381 /* A NONTYPE_ARGUMENT_PACK is value-dependent if any packed argument
22382 is value-dependent. */
22384 tree values
= ARGUMENT_PACK_ARGS (expression
);
22385 int i
, len
= TREE_VEC_LENGTH (values
);
22387 for (i
= 0; i
< len
; ++i
)
22388 if (value_dependent_expression_p (TREE_VEC_ELT (values
, i
)))
22396 tree type2
= TRAIT_EXPR_TYPE2 (expression
);
22397 return (dependent_type_p (TRAIT_EXPR_TYPE1 (expression
))
22398 || (type2
? dependent_type_p (type2
) : false));
22402 return ((value_dependent_expression_p (TREE_OPERAND (expression
, 0)))
22403 || (value_dependent_expression_p (TREE_OPERAND (expression
, 2))));
22406 return ((value_dependent_expression_p (TREE_OPERAND (expression
, 0)))
22407 || (value_dependent_expression_p (TREE_OPERAND (expression
, 1))));
22411 tree op
= TREE_OPERAND (expression
, 0);
22412 return (value_dependent_expression_p (op
)
22413 || has_value_dependent_address (op
));
22416 case REQUIRES_EXPR
:
22417 /* Treat all requires-expressions as value-dependent so
22418 we don't try to fold them. */
22422 return dependent_type_p (TREE_OPERAND (expression
, 0));
22426 tree fn
= get_callee_fndecl (expression
);
22428 if (!fn
&& value_dependent_expression_p (CALL_EXPR_FN (expression
)))
22430 nargs
= call_expr_nargs (expression
);
22431 for (i
= 0; i
< nargs
; ++i
)
22433 tree op
= CALL_EXPR_ARG (expression
, i
);
22434 /* In a call to a constexpr member function, look through the
22435 implicit ADDR_EXPR on the object argument so that it doesn't
22436 cause the call to be considered value-dependent. We also
22437 look through it in potential_constant_expression. */
22438 if (i
== 0 && fn
&& DECL_DECLARED_CONSTEXPR_P (fn
)
22439 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
22440 && TREE_CODE (op
) == ADDR_EXPR
)
22441 op
= TREE_OPERAND (op
, 0);
22442 if (value_dependent_expression_p (op
))
22448 case TEMPLATE_ID_EXPR
:
22449 /* If a TEMPLATE_ID_EXPR involves a dependent name, it will be
22451 return type_dependent_expression_p (expression
)
22452 || variable_concept_p (TREE_OPERAND (expression
, 0));
22458 if (dependent_type_p (TREE_TYPE (expression
)))
22460 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expression
), ix
, val
)
22461 if (value_dependent_expression_p (val
))
22467 /* Treat a GNU statement expression as dependent to avoid crashing
22468 under instantiate_non_dependent_expr; it can't be constant. */
22472 /* A constant expression is value-dependent if any subexpression is
22473 value-dependent. */
22474 switch (TREE_CODE_CLASS (TREE_CODE (expression
)))
22476 case tcc_reference
:
22478 case tcc_comparison
:
22480 case tcc_expression
:
22483 int i
, len
= cp_tree_operand_length (expression
);
22485 for (i
= 0; i
< len
; i
++)
22487 tree t
= TREE_OPERAND (expression
, i
);
22489 /* In some cases, some of the operands may be missing.l
22490 (For example, in the case of PREDECREMENT_EXPR, the
22491 amount to increment by may be missing.) That doesn't
22492 make the expression dependent. */
22493 if (t
&& value_dependent_expression_p (t
))
22504 /* The expression is not value-dependent. */
22508 /* Returns TRUE if the EXPRESSION is type-dependent, in the sense of
22509 [temp.dep.expr]. Note that an expression with no type is
22510 considered dependent. Other parts of the compiler arrange for an
22511 expression with type-dependent subexpressions to have no type, so
22512 this function doesn't have to be fully recursive. */
22515 type_dependent_expression_p (tree expression
)
22517 if (!processing_template_decl
)
22520 if (expression
== NULL_TREE
|| expression
== error_mark_node
)
22523 /* An unresolved name is always dependent. */
22524 if (identifier_p (expression
)
22525 || TREE_CODE (expression
) == USING_DECL
22526 || TREE_CODE (expression
) == WILDCARD_DECL
)
22529 /* A fold expression is type-dependent. */
22530 if (TREE_CODE (expression
) == UNARY_LEFT_FOLD_EXPR
22531 || TREE_CODE (expression
) == UNARY_RIGHT_FOLD_EXPR
22532 || TREE_CODE (expression
) == BINARY_LEFT_FOLD_EXPR
22533 || TREE_CODE (expression
) == BINARY_RIGHT_FOLD_EXPR
)
22536 /* Some expression forms are never type-dependent. */
22537 if (TREE_CODE (expression
) == PSEUDO_DTOR_EXPR
22538 || TREE_CODE (expression
) == SIZEOF_EXPR
22539 || TREE_CODE (expression
) == ALIGNOF_EXPR
22540 || TREE_CODE (expression
) == AT_ENCODE_EXPR
22541 || TREE_CODE (expression
) == NOEXCEPT_EXPR
22542 || TREE_CODE (expression
) == TRAIT_EXPR
22543 || TREE_CODE (expression
) == TYPEID_EXPR
22544 || TREE_CODE (expression
) == DELETE_EXPR
22545 || TREE_CODE (expression
) == VEC_DELETE_EXPR
22546 || TREE_CODE (expression
) == THROW_EXPR
22547 || TREE_CODE (expression
) == REQUIRES_EXPR
)
22550 /* The types of these expressions depends only on the type to which
22551 the cast occurs. */
22552 if (TREE_CODE (expression
) == DYNAMIC_CAST_EXPR
22553 || TREE_CODE (expression
) == STATIC_CAST_EXPR
22554 || TREE_CODE (expression
) == CONST_CAST_EXPR
22555 || TREE_CODE (expression
) == REINTERPRET_CAST_EXPR
22556 || TREE_CODE (expression
) == IMPLICIT_CONV_EXPR
22557 || TREE_CODE (expression
) == CAST_EXPR
)
22558 return dependent_type_p (TREE_TYPE (expression
));
22560 /* The types of these expressions depends only on the type created
22561 by the expression. */
22562 if (TREE_CODE (expression
) == NEW_EXPR
22563 || TREE_CODE (expression
) == VEC_NEW_EXPR
)
22565 /* For NEW_EXPR tree nodes created inside a template, either
22566 the object type itself or a TREE_LIST may appear as the
22568 tree type
= TREE_OPERAND (expression
, 1);
22569 if (TREE_CODE (type
) == TREE_LIST
)
22570 /* This is an array type. We need to check array dimensions
22572 return dependent_type_p (TREE_VALUE (TREE_PURPOSE (type
)))
22573 || value_dependent_expression_p
22574 (TREE_OPERAND (TREE_VALUE (type
), 1));
22576 return dependent_type_p (type
);
22579 if (TREE_CODE (expression
) == SCOPE_REF
)
22581 tree scope
= TREE_OPERAND (expression
, 0);
22582 tree name
= TREE_OPERAND (expression
, 1);
22584 /* 14.6.2.2 [temp.dep.expr]: An id-expression is type-dependent if it
22585 contains an identifier associated by name lookup with one or more
22586 declarations declared with a dependent type, or...a
22587 nested-name-specifier or qualified-id that names a member of an
22588 unknown specialization. */
22589 return (type_dependent_expression_p (name
)
22590 || dependent_scope_p (scope
));
22593 if (TREE_CODE (expression
) == FUNCTION_DECL
22594 && DECL_LANG_SPECIFIC (expression
)
22595 && DECL_TEMPLATE_INFO (expression
)
22596 && (any_dependent_template_arguments_p
22597 (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (expression
)))))
22600 if (TREE_CODE (expression
) == TEMPLATE_DECL
22601 && !DECL_TEMPLATE_TEMPLATE_PARM_P (expression
))
22604 if (TREE_CODE (expression
) == STMT_EXPR
)
22605 expression
= stmt_expr_value_expr (expression
);
22607 if (BRACE_ENCLOSED_INITIALIZER_P (expression
))
22612 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expression
), i
, elt
)
22614 if (type_dependent_expression_p (elt
))
22620 /* A static data member of the current instantiation with incomplete
22621 array type is type-dependent, as the definition and specializations
22622 can have different bounds. */
22623 if (VAR_P (expression
)
22624 && DECL_CLASS_SCOPE_P (expression
)
22625 && dependent_type_p (DECL_CONTEXT (expression
))
22626 && VAR_HAD_UNKNOWN_BOUND (expression
))
22629 /* An array of unknown bound depending on a variadic parameter, eg:
22631 template<typename... Args>
22632 void foo (Args... args)
22634 int arr[] = { args... };
22637 template<int... vals>
22640 int arr[] = { vals... };
22643 If the array has no length and has an initializer, it must be that
22644 we couldn't determine its length in cp_complete_array_type because
22645 it is dependent. */
22646 if (VAR_P (expression
)
22647 && TREE_CODE (TREE_TYPE (expression
)) == ARRAY_TYPE
22648 && !TYPE_DOMAIN (TREE_TYPE (expression
))
22649 && DECL_INITIAL (expression
))
22652 /* A variable template specialization is type-dependent if it has any
22653 dependent template arguments. */
22654 if (VAR_P (expression
)
22655 && DECL_LANG_SPECIFIC (expression
)
22656 && DECL_TEMPLATE_INFO (expression
)
22657 && variable_template_p (DECL_TI_TEMPLATE (expression
)))
22658 return any_dependent_template_arguments_p (DECL_TI_ARGS (expression
));
22660 /* Always dependent, on the number of arguments if nothing else. */
22661 if (TREE_CODE (expression
) == EXPR_PACK_EXPANSION
)
22664 if (TREE_TYPE (expression
) == unknown_type_node
)
22666 if (TREE_CODE (expression
) == ADDR_EXPR
)
22667 return type_dependent_expression_p (TREE_OPERAND (expression
, 0));
22668 if (TREE_CODE (expression
) == COMPONENT_REF
22669 || TREE_CODE (expression
) == OFFSET_REF
)
22671 if (type_dependent_expression_p (TREE_OPERAND (expression
, 0)))
22673 expression
= TREE_OPERAND (expression
, 1);
22674 if (identifier_p (expression
))
22677 /* SCOPE_REF with non-null TREE_TYPE is always non-dependent. */
22678 if (TREE_CODE (expression
) == SCOPE_REF
)
22681 if (BASELINK_P (expression
))
22683 if (BASELINK_OPTYPE (expression
)
22684 && dependent_type_p (BASELINK_OPTYPE (expression
)))
22686 expression
= BASELINK_FUNCTIONS (expression
);
22689 if (TREE_CODE (expression
) == TEMPLATE_ID_EXPR
)
22691 if (any_dependent_template_arguments_p
22692 (TREE_OPERAND (expression
, 1)))
22694 expression
= TREE_OPERAND (expression
, 0);
22695 if (identifier_p (expression
))
22699 gcc_assert (TREE_CODE (expression
) == OVERLOAD
22700 || TREE_CODE (expression
) == FUNCTION_DECL
);
22704 if (type_dependent_expression_p (OVL_CURRENT (expression
)))
22706 expression
= OVL_NEXT (expression
);
22711 gcc_assert (TREE_CODE (expression
) != TYPE_DECL
);
22713 return (dependent_type_p (TREE_TYPE (expression
)));
22716 /* walk_tree callback function for instantiation_dependent_expression_p,
22717 below. Returns non-zero if a dependent subexpression is found. */
22720 instantiation_dependent_r (tree
*tp
, int *walk_subtrees
,
22725 /* We don't have to worry about decltype currently because decltype
22726 of an instantiation-dependent expr is a dependent type. This
22727 might change depending on the resolution of DR 1172. */
22728 *walk_subtrees
= false;
22731 enum tree_code code
= TREE_CODE (*tp
);
22734 /* Don't treat an argument list as dependent just because it has no
22742 /* A constant with a dependent initializer is dependent. */
22743 if (value_dependent_expression_p (*tp
))
22747 case TEMPLATE_PARM_INDEX
:
22750 /* Handle expressions with type operands. */
22754 case AT_ENCODE_EXPR
:
22756 tree op
= TREE_OPERAND (*tp
, 0);
22757 if (code
== SIZEOF_EXPR
&& SIZEOF_EXPR_TYPE_P (*tp
))
22758 op
= TREE_TYPE (op
);
22761 if (dependent_type_p (op
))
22765 *walk_subtrees
= false;
22773 if (value_dependent_expression_p (*tp
))
22775 *walk_subtrees
= false;
22778 case COMPONENT_REF
:
22779 if (identifier_p (TREE_OPERAND (*tp
, 1)))
22780 /* In a template, finish_class_member_access_expr creates a
22781 COMPONENT_REF with an IDENTIFIER_NODE for op1 even if it isn't
22782 type-dependent, so that we can check access control at
22783 instantiation time (PR 42277). See also Core issue 1273. */
22788 if (instantiation_dependent_scope_ref_p (*tp
))
22793 /* Treat statement-expressions as dependent. */
22797 /* Treat requires-expressions as dependent. */
22798 case REQUIRES_EXPR
:
22802 /* Treat calls to function concepts as dependent. */
22803 if (function_concept_check_p (*tp
))
22807 case TEMPLATE_ID_EXPR
:
22808 /* And variable concepts. */
22809 if (variable_concept_p (TREE_OPERAND (*tp
, 0)))
22817 if (type_dependent_expression_p (*tp
))
22823 /* Returns TRUE if the EXPRESSION is instantiation-dependent, in the
22824 sense defined by the ABI:
22826 "An expression is instantiation-dependent if it is type-dependent
22827 or value-dependent, or it has a subexpression that is type-dependent
22828 or value-dependent." */
22831 instantiation_dependent_expression_p (tree expression
)
22835 if (!processing_template_decl
)
22838 if (expression
== error_mark_node
)
22841 result
= cp_walk_tree_without_duplicates (&expression
,
22842 instantiation_dependent_r
, NULL
);
22843 return result
!= NULL_TREE
;
22846 /* Like type_dependent_expression_p, but it also works while not processing
22847 a template definition, i.e. during substitution or mangling. */
22850 type_dependent_expression_p_push (tree expr
)
22853 ++processing_template_decl
;
22854 b
= type_dependent_expression_p (expr
);
22855 --processing_template_decl
;
22859 /* Returns TRUE if ARGS contains a type-dependent expression. */
22862 any_type_dependent_arguments_p (const vec
<tree
, va_gc
> *args
)
22867 FOR_EACH_VEC_SAFE_ELT (args
, i
, arg
)
22869 if (type_dependent_expression_p (arg
))
22875 /* Returns TRUE if LIST (a TREE_LIST whose TREE_VALUEs are
22876 expressions) contains any type-dependent expressions. */
22879 any_type_dependent_elements_p (const_tree list
)
22881 for (; list
; list
= TREE_CHAIN (list
))
22882 if (type_dependent_expression_p (TREE_VALUE (list
)))
22888 /* Returns TRUE if LIST (a TREE_LIST whose TREE_VALUEs are
22889 expressions) contains any value-dependent expressions. */
22892 any_value_dependent_elements_p (const_tree list
)
22894 for (; list
; list
= TREE_CHAIN (list
))
22895 if (value_dependent_expression_p (TREE_VALUE (list
)))
22901 /* Returns TRUE if the ARG (a template argument) is dependent. */
22904 dependent_template_arg_p (tree arg
)
22906 if (!processing_template_decl
)
22909 /* Assume a template argument that was wrongly written by the user
22910 is dependent. This is consistent with what
22911 any_dependent_template_arguments_p [that calls this function]
22913 if (!arg
|| arg
== error_mark_node
)
22916 if (TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
22917 arg
= ARGUMENT_PACK_SELECT_ARG (arg
);
22919 if (TREE_CODE (arg
) == TEMPLATE_DECL
22920 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
22921 return dependent_template_p (arg
);
22922 else if (ARGUMENT_PACK_P (arg
))
22924 tree args
= ARGUMENT_PACK_ARGS (arg
);
22925 int i
, len
= TREE_VEC_LENGTH (args
);
22926 for (i
= 0; i
< len
; ++i
)
22928 if (dependent_template_arg_p (TREE_VEC_ELT (args
, i
)))
22934 else if (TYPE_P (arg
))
22935 return dependent_type_p (arg
);
22937 return (type_dependent_expression_p (arg
)
22938 || value_dependent_expression_p (arg
));
22941 /* Returns true if ARGS (a collection of template arguments) contains
22942 any types that require structural equality testing. */
22945 any_template_arguments_need_structural_equality_p (tree args
)
22952 if (args
== error_mark_node
)
22955 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
22957 tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
22958 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
22960 tree arg
= TREE_VEC_ELT (level
, j
);
22961 tree packed_args
= NULL_TREE
;
22964 if (ARGUMENT_PACK_P (arg
))
22966 /* Look inside the argument pack. */
22967 packed_args
= ARGUMENT_PACK_ARGS (arg
);
22968 len
= TREE_VEC_LENGTH (packed_args
);
22971 for (k
= 0; k
< len
; ++k
)
22974 arg
= TREE_VEC_ELT (packed_args
, k
);
22976 if (error_operand_p (arg
))
22978 else if (TREE_CODE (arg
) == TEMPLATE_DECL
)
22980 else if (TYPE_P (arg
) && TYPE_STRUCTURAL_EQUALITY_P (arg
))
22982 else if (!TYPE_P (arg
) && TREE_TYPE (arg
)
22983 && TYPE_STRUCTURAL_EQUALITY_P (TREE_TYPE (arg
)))
22992 /* Returns true if ARGS (a collection of template arguments) contains
22993 any dependent arguments. */
22996 any_dependent_template_arguments_p (const_tree args
)
23003 if (args
== error_mark_node
)
23006 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
23008 const_tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
23009 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
23010 if (dependent_template_arg_p (TREE_VEC_ELT (level
, j
)))
23017 /* Returns TRUE if the template TMPL is dependent. */
23020 dependent_template_p (tree tmpl
)
23022 if (TREE_CODE (tmpl
) == OVERLOAD
)
23026 if (dependent_template_p (OVL_CURRENT (tmpl
)))
23028 tmpl
= OVL_NEXT (tmpl
);
23033 /* Template template parameters are dependent. */
23034 if (DECL_TEMPLATE_TEMPLATE_PARM_P (tmpl
)
23035 || TREE_CODE (tmpl
) == TEMPLATE_TEMPLATE_PARM
)
23037 /* So are names that have not been looked up. */
23038 if (TREE_CODE (tmpl
) == SCOPE_REF
|| identifier_p (tmpl
))
23040 /* So are member templates of dependent classes. */
23041 if (TYPE_P (CP_DECL_CONTEXT (tmpl
)))
23042 return dependent_type_p (DECL_CONTEXT (tmpl
));
23046 /* Returns TRUE if the specialization TMPL<ARGS> is dependent. */
23049 dependent_template_id_p (tree tmpl
, tree args
)
23051 return (dependent_template_p (tmpl
)
23052 || any_dependent_template_arguments_p (args
));
23055 /* Returns TRUE if OMP_FOR with DECLV, INITV, CONDV and INCRV vectors
23059 dependent_omp_for_p (tree declv
, tree initv
, tree condv
, tree incrv
)
23063 if (!processing_template_decl
)
23066 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
23068 tree decl
= TREE_VEC_ELT (declv
, i
);
23069 tree init
= TREE_VEC_ELT (initv
, i
);
23070 tree cond
= TREE_VEC_ELT (condv
, i
);
23071 tree incr
= TREE_VEC_ELT (incrv
, i
);
23073 if (type_dependent_expression_p (decl
)
23074 || TREE_CODE (decl
) == SCOPE_REF
)
23077 if (init
&& type_dependent_expression_p (init
))
23080 if (type_dependent_expression_p (cond
))
23083 if (COMPARISON_CLASS_P (cond
)
23084 && (type_dependent_expression_p (TREE_OPERAND (cond
, 0))
23085 || type_dependent_expression_p (TREE_OPERAND (cond
, 1))))
23088 if (TREE_CODE (incr
) == MODOP_EXPR
)
23090 if (type_dependent_expression_p (TREE_OPERAND (incr
, 0))
23091 || type_dependent_expression_p (TREE_OPERAND (incr
, 2)))
23094 else if (type_dependent_expression_p (incr
))
23096 else if (TREE_CODE (incr
) == MODIFY_EXPR
)
23098 if (type_dependent_expression_p (TREE_OPERAND (incr
, 0)))
23100 else if (BINARY_CLASS_P (TREE_OPERAND (incr
, 1)))
23102 tree t
= TREE_OPERAND (incr
, 1);
23103 if (type_dependent_expression_p (TREE_OPERAND (t
, 0))
23104 || type_dependent_expression_p (TREE_OPERAND (t
, 1)))
23113 /* TYPE is a TYPENAME_TYPE. Returns the ordinary TYPE to which the
23114 TYPENAME_TYPE corresponds. Returns the original TYPENAME_TYPE if
23115 no such TYPE can be found. Note that this function peers inside
23116 uninstantiated templates and therefore should be used only in
23117 extremely limited situations. ONLY_CURRENT_P restricts this
23118 peering to the currently open classes hierarchy (which is required
23119 when comparing types). */
23122 resolve_typename_type (tree type
, bool only_current_p
)
23131 gcc_assert (TREE_CODE (type
) == TYPENAME_TYPE
);
23133 scope
= TYPE_CONTEXT (type
);
23134 /* Usually the non-qualified identifier of a TYPENAME_TYPE is
23135 TYPE_IDENTIFIER (type). But when 'type' is a typedef variant of
23136 a TYPENAME_TYPE node, then TYPE_NAME (type) is set to the TYPE_DECL representing
23137 the typedef. In that case TYPE_IDENTIFIER (type) is not the non-qualified
23138 identifier of the TYPENAME_TYPE anymore.
23139 So by getting the TYPE_IDENTIFIER of the _main declaration_ of the
23140 TYPENAME_TYPE instead, we avoid messing up with a possible
23141 typedef variant case. */
23142 name
= TYPE_IDENTIFIER (TYPE_MAIN_VARIANT (type
));
23144 /* If the SCOPE is itself a TYPENAME_TYPE, then we need to resolve
23145 it first before we can figure out what NAME refers to. */
23146 if (TREE_CODE (scope
) == TYPENAME_TYPE
)
23148 if (TYPENAME_IS_RESOLVING_P (scope
))
23149 /* Given a class template A with a dependent base with nested type C,
23150 typedef typename A::C::C C will land us here, as trying to resolve
23151 the initial A::C leads to the local C typedef, which leads back to
23152 A::C::C. So we break the recursion now. */
23155 scope
= resolve_typename_type (scope
, only_current_p
);
23157 /* If we don't know what SCOPE refers to, then we cannot resolve the
23159 if (TREE_CODE (scope
) == TYPENAME_TYPE
)
23161 /* If the SCOPE is a template type parameter, we have no way of
23162 resolving the name. */
23163 if (TREE_CODE (scope
) == TEMPLATE_TYPE_PARM
)
23165 /* If the SCOPE is not the current instantiation, there's no reason
23166 to look inside it. */
23167 if (only_current_p
&& !currently_open_class (scope
))
23169 /* If this is a typedef, we don't want to look inside (c++/11987). */
23170 if (typedef_variant_p (type
))
23172 /* If SCOPE isn't the template itself, it will not have a valid
23173 TYPE_FIELDS list. */
23174 if (CLASS_TYPE_P (scope
)
23175 && same_type_p (scope
, CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope
)))
23176 /* scope is either the template itself or a compatible instantiation
23177 like X<T>, so look up the name in the original template. */
23178 scope
= CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope
);
23180 /* scope is a partial instantiation, so we can't do the lookup or we
23181 will lose the template arguments. */
23183 /* Enter the SCOPE so that name lookup will be resolved as if we
23184 were in the class definition. In particular, SCOPE will no
23185 longer be considered a dependent type. */
23186 pushed_scope
= push_scope (scope
);
23187 /* Look up the declaration. */
23188 decl
= lookup_member (scope
, name
, /*protect=*/0, /*want_type=*/true,
23189 tf_warning_or_error
);
23191 result
= NULL_TREE
;
23193 /* For a TYPENAME_TYPE like "typename X::template Y<T>", we want to
23194 find a TEMPLATE_DECL. Otherwise, we want to find a TYPE_DECL. */
23197 else if (identifier_p (TYPENAME_TYPE_FULLNAME (type
))
23198 && TREE_CODE (decl
) == TYPE_DECL
)
23200 result
= TREE_TYPE (decl
);
23201 if (result
== error_mark_node
)
23202 result
= NULL_TREE
;
23204 else if (TREE_CODE (TYPENAME_TYPE_FULLNAME (type
)) == TEMPLATE_ID_EXPR
23205 && DECL_CLASS_TEMPLATE_P (decl
))
23209 /* Obtain the template and the arguments. */
23210 tmpl
= TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type
), 0);
23211 args
= TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type
), 1);
23212 /* Instantiate the template. */
23213 result
= lookup_template_class (tmpl
, args
, NULL_TREE
, NULL_TREE
,
23214 /*entering_scope=*/0,
23215 tf_error
| tf_user
);
23216 if (result
== error_mark_node
)
23217 result
= NULL_TREE
;
23220 /* Leave the SCOPE. */
23222 pop_scope (pushed_scope
);
23224 /* If we failed to resolve it, return the original typename. */
23228 /* If lookup found a typename type, resolve that too. */
23229 if (TREE_CODE (result
) == TYPENAME_TYPE
&& !TYPENAME_IS_RESOLVING_P (result
))
23231 /* Ill-formed programs can cause infinite recursion here, so we
23232 must catch that. */
23233 TYPENAME_IS_RESOLVING_P (type
) = 1;
23234 result
= resolve_typename_type (result
, only_current_p
);
23235 TYPENAME_IS_RESOLVING_P (type
) = 0;
23238 /* Qualify the resulting type. */
23239 quals
= cp_type_quals (type
);
23241 result
= cp_build_qualified_type (result
, cp_type_quals (result
) | quals
);
23246 /* EXPR is an expression which is not type-dependent. Return a proxy
23247 for EXPR that can be used to compute the types of larger
23248 expressions containing EXPR. */
23251 build_non_dependent_expr (tree expr
)
23255 #ifdef ENABLE_CHECKING
23256 /* Try to get a constant value for all non-dependent expressions in
23257 order to expose bugs in *_dependent_expression_p and constexpr. */
23258 if (cxx_dialect
>= cxx11
)
23259 fold_non_dependent_expr (expr
);
23262 /* Preserve OVERLOADs; the functions must be available to resolve
23265 if (TREE_CODE (inner_expr
) == STMT_EXPR
)
23266 inner_expr
= stmt_expr_value_expr (inner_expr
);
23267 if (TREE_CODE (inner_expr
) == ADDR_EXPR
)
23268 inner_expr
= TREE_OPERAND (inner_expr
, 0);
23269 if (TREE_CODE (inner_expr
) == COMPONENT_REF
)
23270 inner_expr
= TREE_OPERAND (inner_expr
, 1);
23271 if (is_overloaded_fn (inner_expr
)
23272 || TREE_CODE (inner_expr
) == OFFSET_REF
)
23274 /* There is no need to return a proxy for a variable. */
23277 /* Preserve string constants; conversions from string constants to
23278 "char *" are allowed, even though normally a "const char *"
23279 cannot be used to initialize a "char *". */
23280 if (TREE_CODE (expr
) == STRING_CST
)
23282 /* Preserve void and arithmetic constants, as an optimization -- there is no
23283 reason to create a new node. */
23284 if (TREE_CODE (expr
) == VOID_CST
23285 || TREE_CODE (expr
) == INTEGER_CST
23286 || TREE_CODE (expr
) == REAL_CST
)
23288 /* Preserve THROW_EXPRs -- all throw-expressions have type "void".
23289 There is at least one place where we want to know that a
23290 particular expression is a throw-expression: when checking a ?:
23291 expression, there are special rules if the second or third
23292 argument is a throw-expression. */
23293 if (TREE_CODE (expr
) == THROW_EXPR
)
23296 /* Don't wrap an initializer list, we need to be able to look inside. */
23297 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
23300 /* Don't wrap a dummy object, we need to be able to test for it. */
23301 if (is_dummy_object (expr
))
23304 if (TREE_CODE (expr
) == COND_EXPR
)
23305 return build3 (COND_EXPR
,
23307 TREE_OPERAND (expr
, 0),
23308 (TREE_OPERAND (expr
, 1)
23309 ? build_non_dependent_expr (TREE_OPERAND (expr
, 1))
23310 : build_non_dependent_expr (TREE_OPERAND (expr
, 0))),
23311 build_non_dependent_expr (TREE_OPERAND (expr
, 2)));
23312 if (TREE_CODE (expr
) == COMPOUND_EXPR
23313 && !COMPOUND_EXPR_OVERLOADED (expr
))
23314 return build2 (COMPOUND_EXPR
,
23316 TREE_OPERAND (expr
, 0),
23317 build_non_dependent_expr (TREE_OPERAND (expr
, 1)));
23319 /* If the type is unknown, it can't really be non-dependent */
23320 gcc_assert (TREE_TYPE (expr
) != unknown_type_node
);
23322 /* Otherwise, build a NON_DEPENDENT_EXPR. */
23323 return build1 (NON_DEPENDENT_EXPR
, TREE_TYPE (expr
), expr
);
23326 /* ARGS is a vector of expressions as arguments to a function call.
23327 Replace the arguments with equivalent non-dependent expressions.
23328 This modifies ARGS in place. */
23331 make_args_non_dependent (vec
<tree
, va_gc
> *args
)
23336 FOR_EACH_VEC_SAFE_ELT (args
, ix
, arg
)
23338 tree newarg
= build_non_dependent_expr (arg
);
23340 (*args
)[ix
] = newarg
;
23344 /* Returns a type which represents 'auto' or 'decltype(auto)'. We use a
23345 TEMPLATE_TYPE_PARM with a level one deeper than the actual template
23349 make_auto_1 (tree name
)
23351 tree au
= cxx_make_type (TEMPLATE_TYPE_PARM
);
23352 TYPE_NAME (au
) = build_decl (input_location
,
23353 TYPE_DECL
, name
, au
);
23354 TYPE_STUB_DECL (au
) = TYPE_NAME (au
);
23355 TEMPLATE_TYPE_PARM_INDEX (au
) = build_template_parm_index
23356 (0, processing_template_decl
+ 1, processing_template_decl
+ 1,
23357 TYPE_NAME (au
), NULL_TREE
);
23358 TYPE_CANONICAL (au
) = canonical_type_parameter (au
);
23359 DECL_ARTIFICIAL (TYPE_NAME (au
)) = 1;
23360 SET_DECL_TEMPLATE_PARM_P (TYPE_NAME (au
));
23366 make_decltype_auto (void)
23368 return make_auto_1 (get_identifier ("decltype(auto)"));
23374 return make_auto_1 (get_identifier ("auto"));
23377 /* Given type ARG, return std::initializer_list<ARG>. */
23382 tree std_init_list
= namespace_binding
23383 (get_identifier ("initializer_list"), std_node
);
23385 if (!std_init_list
|| !DECL_CLASS_TEMPLATE_P (std_init_list
))
23387 error ("deducing from brace-enclosed initializer list requires "
23388 "#include <initializer_list>");
23389 return error_mark_node
;
23391 argvec
= make_tree_vec (1);
23392 TREE_VEC_ELT (argvec
, 0) = arg
;
23393 return lookup_template_class (std_init_list
, argvec
, NULL_TREE
,
23394 NULL_TREE
, 0, tf_warning_or_error
);
23397 /* Replace auto in TYPE with std::initializer_list<auto>. */
23400 listify_autos (tree type
, tree auto_node
)
23402 tree init_auto
= listify (auto_node
);
23403 tree argvec
= make_tree_vec (1);
23404 TREE_VEC_ELT (argvec
, 0) = init_auto
;
23405 if (processing_template_decl
)
23406 argvec
= add_to_template_args (current_template_args (), argvec
);
23407 return tsubst (type
, argvec
, tf_warning_or_error
, NULL_TREE
);
23410 /* Hash traits for hashing possibly constrained 'auto'
23411 TEMPLATE_TYPE_PARMs for use by do_auto_deduction. */
23413 struct auto_hash
: default_hash_traits
<tree
>
23415 static inline hashval_t
hash (tree
);
23416 static inline bool equal (tree
, tree
);
23419 /* Hash the 'auto' T. */
23422 auto_hash::hash (tree t
)
23424 if (tree c
= PLACEHOLDER_TYPE_CONSTRAINTS (t
))
23425 /* Matching constrained-type-specifiers denote the same template
23426 parameter, so hash the constraint. */
23427 return hash_placeholder_constraint (c
);
23429 /* But unconstrained autos are all separate, so just hash the pointer. */
23430 return iterative_hash_object (t
, 0);
23433 /* Compare two 'auto's. */
23436 auto_hash::equal (tree t1
, tree t2
)
23441 tree c1
= PLACEHOLDER_TYPE_CONSTRAINTS (t1
);
23442 tree c2
= PLACEHOLDER_TYPE_CONSTRAINTS (t2
);
23444 /* Two unconstrained autos are distinct. */
23448 return equivalent_placeholder_constraints (c1
, c2
);
23451 /* for_each_template_parm callback for extract_autos: if t is a (possibly
23452 constrained) auto, add it to the vector. */
23455 extract_autos_r (tree t
, void *data
)
23457 hash_table
<auto_hash
> &hash
= *(hash_table
<auto_hash
>*)data
;
23458 if (is_auto_or_concept (t
))
23460 /* All the autos were built with index 0; fix that up now. */
23461 tree
*p
= hash
.find_slot (t
, INSERT
);
23464 /* If this is a repeated constrained-type-specifier, use the index we
23466 idx
= TEMPLATE_PARM_IDX (TEMPLATE_TYPE_PARM_INDEX (*p
));
23469 /* Otherwise this is new, so use the current count. */
23471 idx
= hash
.elements () - 1;
23473 TEMPLATE_PARM_IDX (TEMPLATE_TYPE_PARM_INDEX (t
)) = idx
;
23476 /* Always keep walking. */
23480 /* Return a TREE_VEC of the 'auto's used in type under the Concepts TS, which
23481 says they can appear anywhere in the type. */
23484 extract_autos (tree type
)
23486 hash_set
<tree
> visited
;
23487 hash_table
<auto_hash
> hash (2);
23489 for_each_template_parm (type
, extract_autos_r
, &hash
, &visited
, true);
23491 tree tree_vec
= make_tree_vec (hash
.elements());
23492 for (hash_table
<auto_hash
>::iterator iter
= hash
.begin();
23493 iter
!= hash
.end(); ++iter
)
23496 unsigned i
= TEMPLATE_PARM_IDX (TEMPLATE_TYPE_PARM_INDEX (elt
));
23497 TREE_VEC_ELT (tree_vec
, i
)
23498 = build_tree_list (NULL_TREE
, TYPE_NAME (elt
));
23504 /* Replace occurrences of 'auto' in TYPE with the appropriate type deduced
23505 from INIT. AUTO_NODE is the TEMPLATE_TYPE_PARM used for 'auto' in TYPE. */
23508 do_auto_deduction (tree type
, tree init
, tree auto_node
)
23510 return do_auto_deduction (type
, init
, auto_node
,
23511 tf_warning_or_error
,
23515 /* Replace occurrences of 'auto' in TYPE with the appropriate type deduced
23516 from INIT. AUTO_NODE is the TEMPLATE_TYPE_PARM used for 'auto' in TYPE.
23517 The CONTEXT determines the context in which auto deduction is performed
23518 and is used to control error diagnostics. */
23521 do_auto_deduction (tree type
, tree init
, tree auto_node
,
23522 tsubst_flags_t complain
, auto_deduction_context context
)
23526 if (init
== error_mark_node
)
23527 return error_mark_node
;
23529 if (type_dependent_expression_p (init
))
23530 /* Defining a subset of type-dependent expressions that we can deduce
23531 from ahead of time isn't worth the trouble. */
23534 /* [dcl.spec.auto]: Obtain P from T by replacing the occurrences of auto
23535 with either a new invented type template parameter U or, if the
23536 initializer is a braced-init-list (8.5.4), with
23537 std::initializer_list<U>. */
23538 if (BRACE_ENCLOSED_INITIALIZER_P (init
))
23540 if (!DIRECT_LIST_INIT_P (init
))
23541 type
= listify_autos (type
, auto_node
);
23542 else if (CONSTRUCTOR_NELTS (init
) == 1)
23543 init
= CONSTRUCTOR_ELT (init
, 0)->value
;
23546 if (complain
& tf_warning_or_error
)
23548 if (permerror (input_location
, "direct-list-initialization of "
23549 "%<auto%> requires exactly one element"))
23550 inform (input_location
,
23551 "for deduction to %<std::initializer_list%>, use copy-"
23552 "list-initialization (i.e. add %<=%> before the %<{%>)");
23554 type
= listify_autos (type
, auto_node
);
23558 init
= resolve_nondeduced_context (init
);
23560 if (AUTO_IS_DECLTYPE (auto_node
))
23562 bool id
= (DECL_P (init
) || (TREE_CODE (init
) == COMPONENT_REF
23563 && !REF_PARENTHESIZED_P (init
)));
23564 targs
= make_tree_vec (1);
23565 TREE_VEC_ELT (targs
, 0)
23566 = finish_decltype_type (init
, id
, tf_warning_or_error
);
23567 if (type
!= auto_node
)
23569 if (complain
& tf_error
)
23570 error ("%qT as type rather than plain %<decltype(auto)%>", type
);
23571 return error_mark_node
;
23576 tree parms
= build_tree_list (NULL_TREE
, type
);
23580 tparms
= extract_autos (type
);
23583 tparms
= make_tree_vec (1);
23584 TREE_VEC_ELT (tparms
, 0)
23585 = build_tree_list (NULL_TREE
, TYPE_NAME (auto_node
));
23588 targs
= make_tree_vec (TREE_VEC_LENGTH (tparms
));
23589 int val
= type_unification_real (tparms
, targs
, parms
, &init
, 1, 0,
23590 DEDUCE_CALL
, LOOKUP_NORMAL
,
23591 NULL
, /*explain_p=*/false);
23594 if (processing_template_decl
)
23595 /* Try again at instantiation time. */
23597 if (type
&& type
!= error_mark_node
23598 && (complain
& tf_error
))
23599 /* If type is error_mark_node a diagnostic must have been
23600 emitted by now. Also, having a mention to '<type error>'
23601 in the diagnostic is not really useful to the user. */
23603 if (cfun
&& auto_node
== current_function_auto_return_pattern
23604 && LAMBDA_FUNCTION_P (current_function_decl
))
23605 error ("unable to deduce lambda return type from %qE", init
);
23607 error ("unable to deduce %qT from %qE", type
, init
);
23608 type_unification_real (tparms
, targs
, parms
, &init
, 1, 0,
23609 DEDUCE_CALL
, LOOKUP_NORMAL
,
23610 NULL
, /*explain_p=*/true);
23612 return error_mark_node
;
23616 /* If the list of declarators contains more than one declarator, the type
23617 of each declared variable is determined as described above. If the
23618 type deduced for the template parameter U is not the same in each
23619 deduction, the program is ill-formed. */
23620 if (!flag_concepts
&& TREE_TYPE (auto_node
)
23621 && !same_type_p (TREE_TYPE (auto_node
), TREE_VEC_ELT (targs
, 0)))
23623 if (cfun
&& auto_node
== current_function_auto_return_pattern
23624 && LAMBDA_FUNCTION_P (current_function_decl
))
23625 error ("inconsistent types %qT and %qT deduced for "
23626 "lambda return type", TREE_TYPE (auto_node
),
23627 TREE_VEC_ELT (targs
, 0));
23629 error ("inconsistent deduction for %qT: %qT and then %qT",
23630 auto_node
, TREE_TYPE (auto_node
), TREE_VEC_ELT (targs
, 0));
23631 return error_mark_node
;
23633 if (!flag_concepts
)
23634 TREE_TYPE (auto_node
) = TREE_VEC_ELT (targs
, 0);
23636 /* Check any placeholder constraints against the deduced type. */
23637 if (flag_concepts
&& !processing_template_decl
)
23638 if (tree constr
= PLACEHOLDER_TYPE_CONSTRAINTS (auto_node
))
23640 /* Use the deduced type to check the associated constraints. */
23641 if (!constraints_satisfied_p (constr
, targs
))
23643 if (complain
& tf_warning_or_error
)
23647 case adc_unspecified
:
23648 error("placeholder constraints not satisfied");
23650 case adc_variable_type
:
23651 error ("deduced initializer does not satisfy "
23652 "placeholder constraints");
23654 case adc_return_type
:
23655 error ("deduced return type does not satisfy "
23656 "placeholder constraints");
23658 case adc_requirement
:
23659 error ("deduced expression type does not saatisy "
23660 "placeholder constraints");
23663 diagnose_constraints (input_location
, constr
, targs
);
23665 return error_mark_node
;
23669 if (processing_template_decl
)
23670 targs
= add_to_template_args (current_template_args (), targs
);
23671 return tsubst (type
, targs
, complain
, NULL_TREE
);
23674 /* Substitutes LATE_RETURN_TYPE for 'auto' in TYPE and returns the
23678 splice_late_return_type (tree type
, tree late_return_type
)
23680 if (is_auto (type
))
23682 if (late_return_type
)
23683 return late_return_type
;
23685 tree idx
= get_template_parm_index (type
);
23686 if (TEMPLATE_PARM_LEVEL (idx
) <= processing_template_decl
)
23687 /* In an abbreviated function template we didn't know we were dealing
23688 with a function template when we saw the auto return type, so update
23689 it to have the correct level. */
23690 return make_auto_1 (TYPE_IDENTIFIER (type
));
23695 /* Returns true iff TYPE is a TEMPLATE_TYPE_PARM representing 'auto' or
23696 'decltype(auto)'. */
23699 is_auto (const_tree type
)
23701 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
23702 && (TYPE_IDENTIFIER (type
) == get_identifier ("auto")
23703 || TYPE_IDENTIFIER (type
) == get_identifier ("decltype(auto)")))
23709 /* for_each_template_parm callback for type_uses_auto. */
23712 is_auto_r (tree tp
, void */
*data*/
)
23714 return is_auto_or_concept (tp
);
23717 /* Returns the TEMPLATE_TYPE_PARM in TYPE representing `auto' iff TYPE contains
23718 a use of `auto'. Returns NULL_TREE otherwise. */
23721 type_uses_auto (tree type
)
23725 /* The Concepts TS allows multiple autos in one type-specifier; just
23726 return the first one we find, do_auto_deduction will collect all of
23728 if (uses_template_parms (type
))
23729 return for_each_template_parm (type
, is_auto_r
, /*data*/NULL
,
23730 /*visited*/NULL
, /*nondeduced*/true);
23735 return find_type_usage (type
, is_auto
);
23738 /* Returns true iff TYPE is a TEMPLATE_TYPE_PARM representing 'auto',
23739 'decltype(auto)' or a concept. */
23742 is_auto_or_concept (const_tree type
)
23744 return is_auto (type
); // or concept
23747 /* Returns the TEMPLATE_TYPE_PARM in TYPE representing a generic type (`auto' or
23748 a concept identifier) iff TYPE contains a use of a generic type. Returns
23749 NULL_TREE otherwise. */
23752 type_uses_auto_or_concept (tree type
)
23754 return find_type_usage (type
, is_auto_or_concept
);
23758 /* For a given template T, return the vector of typedefs referenced
23759 in T for which access check is needed at T instantiation time.
23760 T is either a FUNCTION_DECL or a RECORD_TYPE.
23761 Those typedefs were added to T by the function
23762 append_type_to_template_for_access_check. */
23764 vec
<qualified_typedef_usage_t
, va_gc
> *
23765 get_types_needing_access_check (tree t
)
23768 vec
<qualified_typedef_usage_t
, va_gc
> *result
= NULL
;
23770 if (!t
|| t
== error_mark_node
)
23773 if (!(ti
= get_template_info (t
)))
23776 if (CLASS_TYPE_P (t
)
23777 || TREE_CODE (t
) == FUNCTION_DECL
)
23779 if (!TI_TEMPLATE (ti
))
23782 result
= TI_TYPEDEFS_NEEDING_ACCESS_CHECKING (ti
);
23788 /* Append the typedef TYPE_DECL used in template T to a list of typedefs
23789 tied to T. That list of typedefs will be access checked at
23790 T instantiation time.
23791 T is either a FUNCTION_DECL or a RECORD_TYPE.
23792 TYPE_DECL is a TYPE_DECL node representing a typedef.
23793 SCOPE is the scope through which TYPE_DECL is accessed.
23794 LOCATION is the location of the usage point of TYPE_DECL.
23796 This function is a subroutine of
23797 append_type_to_template_for_access_check. */
23800 append_type_to_template_for_access_check_1 (tree t
,
23803 location_t location
)
23805 qualified_typedef_usage_t typedef_usage
;
23808 if (!t
|| t
== error_mark_node
)
23811 gcc_assert ((TREE_CODE (t
) == FUNCTION_DECL
23812 || CLASS_TYPE_P (t
))
23814 && TREE_CODE (type_decl
) == TYPE_DECL
23817 if (!(ti
= get_template_info (t
)))
23820 gcc_assert (TI_TEMPLATE (ti
));
23822 typedef_usage
.typedef_decl
= type_decl
;
23823 typedef_usage
.context
= scope
;
23824 typedef_usage
.locus
= location
;
23826 vec_safe_push (TI_TYPEDEFS_NEEDING_ACCESS_CHECKING (ti
), typedef_usage
);
23829 /* Append TYPE_DECL to the template TEMPL.
23830 TEMPL is either a class type, a FUNCTION_DECL or a a TEMPLATE_DECL.
23831 At TEMPL instanciation time, TYPE_DECL will be checked to see
23832 if it can be accessed through SCOPE.
23833 LOCATION is the location of the usage point of TYPE_DECL.
23835 e.g. consider the following code snippet:
23842 template<class U> struct S
23844 C::myint mi; // <-- usage point of the typedef C::myint
23849 At S<char> instantiation time, we need to check the access of C::myint
23850 In other words, we need to check the access of the myint typedef through
23851 the C scope. For that purpose, this function will add the myint typedef
23852 and the scope C through which its being accessed to a list of typedefs
23853 tied to the template S. That list will be walked at template instantiation
23854 time and access check performed on each typedefs it contains.
23855 Note that this particular code snippet should yield an error because
23856 myint is private to C. */
23859 append_type_to_template_for_access_check (tree templ
,
23862 location_t location
)
23864 qualified_typedef_usage_t
*iter
;
23867 gcc_assert (type_decl
&& (TREE_CODE (type_decl
) == TYPE_DECL
));
23869 /* Make sure we don't append the type to the template twice. */
23870 FOR_EACH_VEC_SAFE_ELT (get_types_needing_access_check (templ
), i
, iter
)
23871 if (iter
->typedef_decl
== type_decl
&& scope
== iter
->context
)
23874 append_type_to_template_for_access_check_1 (templ
, type_decl
,
23878 /* Convert the generic type parameters in PARM that match the types given in the
23879 range [START_IDX, END_IDX) from the current_template_parms into generic type
23883 convert_generic_types_to_packs (tree parm
, int start_idx
, int end_idx
)
23885 tree current
= current_template_parms
;
23886 int depth
= TMPL_PARMS_DEPTH (current
);
23887 current
= INNERMOST_TEMPLATE_PARMS (current
);
23888 tree replacement
= make_tree_vec (TREE_VEC_LENGTH (current
));
23890 for (int i
= 0; i
< start_idx
; ++i
)
23891 TREE_VEC_ELT (replacement
, i
)
23892 = TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (current
, i
)));
23894 for (int i
= start_idx
; i
< end_idx
; ++i
)
23896 /* Create a distinct parameter pack type from the current parm and add it
23897 to the replacement args to tsubst below into the generic function
23900 tree o
= TREE_TYPE (TREE_VALUE
23901 (TREE_VEC_ELT (current
, i
)));
23902 tree t
= copy_type (o
);
23903 TEMPLATE_TYPE_PARM_INDEX (t
)
23904 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (o
),
23906 TREE_TYPE (TEMPLATE_TYPE_DECL (t
)) = t
;
23907 TYPE_STUB_DECL (t
) = TYPE_NAME (t
) = TEMPLATE_TYPE_DECL (t
);
23908 TYPE_MAIN_VARIANT (t
) = t
;
23909 TEMPLATE_TYPE_PARAMETER_PACK (t
) = true;
23910 TYPE_CANONICAL (t
) = canonical_type_parameter (t
);
23911 TREE_VEC_ELT (replacement
, i
) = t
;
23912 TREE_VALUE (TREE_VEC_ELT (current
, i
)) = TREE_CHAIN (t
);
23915 for (int i
= end_idx
, e
= TREE_VEC_LENGTH (current
); i
< e
; ++i
)
23916 TREE_VEC_ELT (replacement
, i
)
23917 = TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (current
, i
)));
23919 /* If there are more levels then build up the replacement with the outer
23922 replacement
= add_to_template_args (template_parms_to_args
23923 (TREE_CHAIN (current_template_parms
)),
23926 return tsubst (parm
, replacement
, tf_none
, NULL_TREE
);
23929 /* Entries in the decl_constraint hash table. */
23930 struct GTY((for_user
)) constr_entry
23936 /* Hashing function and equality for constraint entries. */
23937 struct constr_hasher
: ggc_ptr_hash
<constr_entry
>
23939 static hashval_t
hash (constr_entry
*e
)
23941 return (hashval_t
)DECL_UID (e
->decl
);
23944 static bool equal (constr_entry
*e1
, constr_entry
*e2
)
23946 return e1
->decl
== e2
->decl
;
23950 /* A mapping from declarations to constraint information. Note that
23951 both templates and their underlying declarations are mapped to the
23952 same constraint information.
23954 FIXME: This is defined in pt.c because garbage collection
23955 code is not being generated for constraint.cc. */
23957 static GTY (()) hash_table
<constr_hasher
> *decl_constraints
;
23959 /* Returns true iff cinfo contains a valid set of constraints.
23960 This is the case when the associated requirements have been
23961 successfully decomposed into lists of atomic constraints.
23962 That is, when the saved assumptions are not error_mark_node. */
23965 valid_constraints_p (tree cinfo
)
23967 gcc_assert (cinfo
);
23968 return CI_ASSUMPTIONS (cinfo
) != error_mark_node
;
23971 /* Returns the template constraints of declaration T. If T is not
23972 constrained, return NULL_TREE. Note that T must be non-null. */
23975 get_constraints (tree t
)
23977 gcc_assert (DECL_P (t
));
23978 if (TREE_CODE (t
) == TEMPLATE_DECL
)
23979 t
= DECL_TEMPLATE_RESULT (t
);
23980 constr_entry elt
= { t
, NULL_TREE
};
23981 constr_entry
* found
= decl_constraints
->find (&elt
);
23988 /* Associate the given constraint information CI with the declaration
23989 T. If T is a template, then the constraints are associated with
23990 its underlying declaration. Don't build associations if CI is
23994 set_constraints (tree t
, tree ci
)
23999 if (TREE_CODE (t
) == TEMPLATE_DECL
)
24000 t
= DECL_TEMPLATE_RESULT (t
);
24001 gcc_assert (!get_constraints (t
));
24002 constr_entry elt
= {t
, ci
};
24003 constr_entry
** slot
= decl_constraints
->find_slot (&elt
, INSERT
);
24004 constr_entry
* entry
= ggc_alloc
<constr_entry
> ();
24009 /* Remove the associated constraints of the declaration T. */
24012 remove_constraints (tree t
)
24014 gcc_assert (DECL_P (t
));
24015 if (TREE_CODE (t
) == TEMPLATE_DECL
)
24016 t
= DECL_TEMPLATE_RESULT (t
);
24018 constr_entry elt
= {t
, NULL_TREE
};
24019 constr_entry
** slot
= decl_constraints
->find_slot (&elt
, NO_INSERT
);
24021 decl_constraints
->clear_slot (slot
);
24024 /* Set up the hash table for constraint association. */
24027 init_constraint_processing (void)
24029 decl_constraints
= hash_table
<constr_hasher
>::create_ggc(37);
24032 /* Set up the hash tables for template instantiations. */
24035 init_template_processing (void)
24037 decl_specializations
= hash_table
<spec_hasher
>::create_ggc (37);
24038 type_specializations
= hash_table
<spec_hasher
>::create_ggc (37);
24041 /* Print stats about the template hash tables for -fstats. */
24044 print_template_statistics (void)
24046 fprintf (stderr
, "decl_specializations: size %ld, %ld elements, "
24047 "%f collisions\n", (long) decl_specializations
->size (),
24048 (long) decl_specializations
->elements (),
24049 decl_specializations
->collisions ());
24050 fprintf (stderr
, "type_specializations: size %ld, %ld elements, "
24051 "%f collisions\n", (long) type_specializations
->size (),
24052 (long) type_specializations
->elements (),
24053 type_specializations
->collisions ());
24056 #include "gt-cp-pt.h"