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 int 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
= DECL_UID (tmpl
);
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
;
3412 /* Identifies all of the argument packs that occur in a template
3413 argument and appends them to the TREE_LIST inside DATA, which is a
3414 find_parameter_pack_data structure. This is a subroutine of
3415 make_pack_expansion and uses_parameter_packs. */
3417 find_parameter_packs_r (tree
*tp
, int *walk_subtrees
, void* data
)
3420 struct find_parameter_pack_data
* ppd
=
3421 (struct find_parameter_pack_data
*)data
;
3422 bool parameter_pack_p
= false;
3424 /* Handle type aliases/typedefs. */
3425 if (TYPE_ALIAS_P (t
))
3427 if (TYPE_TEMPLATE_INFO (t
))
3428 cp_walk_tree (&TYPE_TI_ARGS (t
),
3429 &find_parameter_packs_r
,
3435 /* Identify whether this is a parameter pack or not. */
3436 switch (TREE_CODE (t
))
3438 case TEMPLATE_PARM_INDEX
:
3439 if (TEMPLATE_PARM_PARAMETER_PACK (t
))
3440 parameter_pack_p
= true;
3443 case TEMPLATE_TYPE_PARM
:
3444 t
= TYPE_MAIN_VARIANT (t
);
3445 case TEMPLATE_TEMPLATE_PARM
:
3446 if (TEMPLATE_TYPE_PARAMETER_PACK (t
))
3447 parameter_pack_p
= true;
3452 if (DECL_PACK_P (t
))
3454 /* We don't want to walk into the type of a PARM_DECL,
3455 because we don't want to see the type parameter pack. */
3457 parameter_pack_p
= true;
3461 /* Look through a lambda capture proxy to the field pack. */
3463 if (DECL_HAS_VALUE_EXPR_P (t
))
3465 tree v
= DECL_VALUE_EXPR (t
);
3467 &find_parameter_packs_r
,
3471 else if (variable_template_specialization_p (t
))
3473 cp_walk_tree (&DECL_TI_ARGS (t
),
3474 find_parameter_packs_r
,
3481 parameter_pack_p
= true;
3484 /* Not a parameter pack. */
3488 if (parameter_pack_p
)
3490 /* Add this parameter pack to the list. */
3491 *ppd
->parameter_packs
= tree_cons (NULL_TREE
, t
, *ppd
->parameter_packs
);
3495 cp_walk_tree (&TYPE_CONTEXT (t
),
3496 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3498 /* This switch statement will return immediately if we don't find a
3500 switch (TREE_CODE (t
))
3502 case TEMPLATE_PARM_INDEX
:
3505 case BOUND_TEMPLATE_TEMPLATE_PARM
:
3506 /* Check the template itself. */
3507 cp_walk_tree (&TREE_TYPE (TYPE_TI_TEMPLATE (t
)),
3508 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3509 /* Check the template arguments. */
3510 cp_walk_tree (&TYPE_TI_ARGS (t
), &find_parameter_packs_r
, ppd
,
3515 case TEMPLATE_TYPE_PARM
:
3516 case TEMPLATE_TEMPLATE_PARM
:
3523 if (TYPE_PTRMEMFUNC_P (t
))
3529 if (TYPE_TEMPLATE_INFO (t
))
3530 cp_walk_tree (&TYPE_TI_ARGS (t
),
3531 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3538 cp_walk_tree (&TREE_TYPE (t
),
3539 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3543 cp_walk_tree (&TYPENAME_TYPE_FULLNAME (t
), &find_parameter_packs_r
,
3548 case TYPE_PACK_EXPANSION
:
3549 case EXPR_PACK_EXPANSION
:
3554 cp_walk_tree (&TYPE_MAX_VALUE (t
), &find_parameter_packs_r
,
3559 case IDENTIFIER_NODE
:
3560 cp_walk_tree (&TREE_TYPE (t
), &find_parameter_packs_r
, ppd
,
3572 /* Determines if the expression or type T uses any parameter packs. */
3574 uses_parameter_packs (tree t
)
3576 tree parameter_packs
= NULL_TREE
;
3577 struct find_parameter_pack_data ppd
;
3578 ppd
.parameter_packs
= ¶meter_packs
;
3579 ppd
.visited
= new hash_set
<tree
>;
3580 cp_walk_tree (&t
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
3582 return parameter_packs
!= NULL_TREE
;
3585 /* Turn ARG, which may be an expression, type, or a TREE_LIST
3586 representation a base-class initializer into a parameter pack
3587 expansion. If all goes well, the resulting node will be an
3588 EXPR_PACK_EXPANSION, TYPE_PACK_EXPANSION, or TREE_LIST,
3591 make_pack_expansion (tree arg
)
3594 tree parameter_packs
= NULL_TREE
;
3595 bool for_types
= false;
3596 struct find_parameter_pack_data ppd
;
3598 if (!arg
|| arg
== error_mark_node
)
3601 if (TREE_CODE (arg
) == TREE_LIST
&& TREE_PURPOSE (arg
))
3603 /* A TREE_LIST with a non-null TREE_PURPOSE is for a base
3604 class initializer. In this case, the TREE_PURPOSE will be a
3605 _TYPE node (representing the base class expansion we're
3606 initializing) and the TREE_VALUE will be a TREE_LIST
3607 containing the initialization arguments.
3609 The resulting expansion looks somewhat different from most
3610 expansions. Rather than returning just one _EXPANSION, we
3611 return a TREE_LIST whose TREE_PURPOSE is a
3612 TYPE_PACK_EXPANSION containing the bases that will be
3613 initialized. The TREE_VALUE will be identical to the
3614 original TREE_VALUE, which is a list of arguments that will
3615 be passed to each base. We do not introduce any new pack
3616 expansion nodes into the TREE_VALUE (although it is possible
3617 that some already exist), because the TREE_PURPOSE and
3618 TREE_VALUE all need to be expanded together with the same
3619 _EXPANSION node. Note that the TYPE_PACK_EXPANSION in the
3620 resulting TREE_PURPOSE will mention the parameter packs in
3621 both the bases and the arguments to the bases. */
3624 tree parameter_packs
= NULL_TREE
;
3626 /* Determine which parameter packs will be used by the base
3628 ppd
.visited
= new hash_set
<tree
>;
3629 ppd
.parameter_packs
= ¶meter_packs
;
3630 cp_walk_tree (&TREE_PURPOSE (arg
), &find_parameter_packs_r
,
3633 if (parameter_packs
== NULL_TREE
)
3635 error ("base initializer expansion %<%T%> contains no parameter packs", arg
);
3637 return error_mark_node
;
3640 if (TREE_VALUE (arg
) != void_type_node
)
3642 /* Collect the sets of parameter packs used in each of the
3643 initialization arguments. */
3644 for (value
= TREE_VALUE (arg
); value
; value
= TREE_CHAIN (value
))
3646 /* Determine which parameter packs will be expanded in this
3648 cp_walk_tree (&TREE_VALUE (value
), &find_parameter_packs_r
,
3655 /* Create the pack expansion type for the base type. */
3656 purpose
= cxx_make_type (TYPE_PACK_EXPANSION
);
3657 SET_PACK_EXPANSION_PATTERN (purpose
, TREE_PURPOSE (arg
));
3658 PACK_EXPANSION_PARAMETER_PACKS (purpose
) = parameter_packs
;
3660 /* Just use structural equality for these TYPE_PACK_EXPANSIONS;
3661 they will rarely be compared to anything. */
3662 SET_TYPE_STRUCTURAL_EQUALITY (purpose
);
3664 return tree_cons (purpose
, TREE_VALUE (arg
), NULL_TREE
);
3667 if (TYPE_P (arg
) || TREE_CODE (arg
) == TEMPLATE_DECL
)
3670 /* Build the PACK_EXPANSION_* node. */
3672 ? cxx_make_type (TYPE_PACK_EXPANSION
)
3673 : make_node (EXPR_PACK_EXPANSION
);
3674 SET_PACK_EXPANSION_PATTERN (result
, arg
);
3675 if (TREE_CODE (result
) == EXPR_PACK_EXPANSION
)
3677 /* Propagate type and const-expression information. */
3678 TREE_TYPE (result
) = TREE_TYPE (arg
);
3679 TREE_CONSTANT (result
) = TREE_CONSTANT (arg
);
3682 /* Just use structural equality for these TYPE_PACK_EXPANSIONS;
3683 they will rarely be compared to anything. */
3684 SET_TYPE_STRUCTURAL_EQUALITY (result
);
3686 /* Determine which parameter packs will be expanded. */
3687 ppd
.parameter_packs
= ¶meter_packs
;
3688 ppd
.visited
= new hash_set
<tree
>;
3689 cp_walk_tree (&arg
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
3692 /* Make sure we found some parameter packs. */
3693 if (parameter_packs
== NULL_TREE
)
3696 error ("expansion pattern %<%T%> contains no argument packs", arg
);
3698 error ("expansion pattern %<%E%> contains no argument packs", arg
);
3699 return error_mark_node
;
3701 PACK_EXPANSION_PARAMETER_PACKS (result
) = parameter_packs
;
3703 PACK_EXPANSION_LOCAL_P (result
) = at_function_scope_p ();
3708 /* Checks T for any "bare" parameter packs, which have not yet been
3709 expanded, and issues an error if any are found. This operation can
3710 only be done on full expressions or types (e.g., an expression
3711 statement, "if" condition, etc.), because we could have expressions like:
3713 foo(f(g(h(args)))...)
3715 where "args" is a parameter pack. check_for_bare_parameter_packs
3716 should not be called for the subexpressions args, h(args),
3717 g(h(args)), or f(g(h(args))), because we would produce erroneous
3720 Returns TRUE and emits an error if there were bare parameter packs,
3721 returns FALSE otherwise. */
3723 check_for_bare_parameter_packs (tree t
)
3725 tree parameter_packs
= NULL_TREE
;
3726 struct find_parameter_pack_data ppd
;
3728 if (!processing_template_decl
|| !t
|| t
== error_mark_node
)
3731 if (TREE_CODE (t
) == TYPE_DECL
)
3734 ppd
.parameter_packs
= ¶meter_packs
;
3735 ppd
.visited
= new hash_set
<tree
>;
3736 cp_walk_tree (&t
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
3739 if (parameter_packs
)
3741 error ("parameter packs not expanded with %<...%>:");
3742 while (parameter_packs
)
3744 tree pack
= TREE_VALUE (parameter_packs
);
3745 tree name
= NULL_TREE
;
3747 if (TREE_CODE (pack
) == TEMPLATE_TYPE_PARM
3748 || TREE_CODE (pack
) == TEMPLATE_TEMPLATE_PARM
)
3749 name
= TYPE_NAME (pack
);
3750 else if (TREE_CODE (pack
) == TEMPLATE_PARM_INDEX
)
3751 name
= DECL_NAME (TEMPLATE_PARM_DECL (pack
));
3753 name
= DECL_NAME (pack
);
3756 inform (input_location
, " %qD", name
);
3758 inform (input_location
, " <anonymous>");
3760 parameter_packs
= TREE_CHAIN (parameter_packs
);
3769 /* Expand any parameter packs that occur in the template arguments in
3772 expand_template_argument_pack (tree args
)
3774 tree result_args
= NULL_TREE
;
3775 int in_arg
, out_arg
= 0, nargs
= args
? TREE_VEC_LENGTH (args
) : 0;
3776 int num_result_args
= -1;
3777 int non_default_args_count
= -1;
3779 /* First, determine if we need to expand anything, and the number of
3780 slots we'll need. */
3781 for (in_arg
= 0; in_arg
< nargs
; ++in_arg
)
3783 tree arg
= TREE_VEC_ELT (args
, in_arg
);
3784 if (arg
== NULL_TREE
)
3786 if (ARGUMENT_PACK_P (arg
))
3788 int num_packed
= TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg
));
3789 if (num_result_args
< 0)
3790 num_result_args
= in_arg
+ num_packed
;
3792 num_result_args
+= num_packed
;
3796 if (num_result_args
>= 0)
3801 /* If no expansion is necessary, we're done. */
3802 if (num_result_args
< 0)
3805 /* Expand arguments. */
3806 result_args
= make_tree_vec (num_result_args
);
3807 if (NON_DEFAULT_TEMPLATE_ARGS_COUNT (args
))
3808 non_default_args_count
=
3809 GET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (args
);
3810 for (in_arg
= 0; in_arg
< nargs
; ++in_arg
)
3812 tree arg
= TREE_VEC_ELT (args
, in_arg
);
3813 if (ARGUMENT_PACK_P (arg
))
3815 tree packed
= ARGUMENT_PACK_ARGS (arg
);
3816 int i
, num_packed
= TREE_VEC_LENGTH (packed
);
3817 for (i
= 0; i
< num_packed
; ++i
, ++out_arg
)
3818 TREE_VEC_ELT (result_args
, out_arg
) = TREE_VEC_ELT(packed
, i
);
3819 if (non_default_args_count
> 0)
3820 non_default_args_count
+= num_packed
- 1;
3824 TREE_VEC_ELT (result_args
, out_arg
) = arg
;
3828 if (non_default_args_count
>= 0)
3829 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (result_args
, non_default_args_count
);
3833 /* Checks if DECL shadows a template parameter.
3835 [temp.local]: A template-parameter shall not be redeclared within its
3836 scope (including nested scopes).
3838 Emits an error and returns TRUE if the DECL shadows a parameter,
3839 returns FALSE otherwise. */
3842 check_template_shadow (tree decl
)
3846 /* If we're not in a template, we can't possibly shadow a template
3848 if (!current_template_parms
)
3851 /* Figure out what we're shadowing. */
3852 if (TREE_CODE (decl
) == OVERLOAD
)
3853 decl
= OVL_CURRENT (decl
);
3854 olddecl
= innermost_non_namespace_value (DECL_NAME (decl
));
3856 /* If there's no previous binding for this name, we're not shadowing
3857 anything, let alone a template parameter. */
3861 /* If we're not shadowing a template parameter, we're done. Note
3862 that OLDDECL might be an OVERLOAD (or perhaps even an
3863 ERROR_MARK), so we can't just blithely assume it to be a _DECL
3865 if (!DECL_P (olddecl
) || !DECL_TEMPLATE_PARM_P (olddecl
))
3868 /* We check for decl != olddecl to avoid bogus errors for using a
3869 name inside a class. We check TPFI to avoid duplicate errors for
3870 inline member templates. */
3872 || (DECL_TEMPLATE_PARM_P (decl
)
3873 && TEMPLATE_PARMS_FOR_INLINE (current_template_parms
)))
3876 /* Don't complain about the injected class name, as we've already
3877 complained about the class itself. */
3878 if (DECL_SELF_REFERENCE_P (decl
))
3881 if (DECL_TEMPLATE_PARM_P (decl
))
3882 error ("declaration of template parameter %q+D shadows "
3883 "template parameter", decl
);
3885 error ("declaration of %q+#D shadows template parameter", decl
);
3886 inform (DECL_SOURCE_LOCATION (olddecl
),
3887 "template parameter %qD declared here", olddecl
);
3891 /* Return a new TEMPLATE_PARM_INDEX with the indicated INDEX, LEVEL,
3892 ORIG_LEVEL, DECL, and TYPE. */
3895 build_template_parm_index (int index
,
3901 tree t
= make_node (TEMPLATE_PARM_INDEX
);
3902 TEMPLATE_PARM_IDX (t
) = index
;
3903 TEMPLATE_PARM_LEVEL (t
) = level
;
3904 TEMPLATE_PARM_ORIG_LEVEL (t
) = orig_level
;
3905 TEMPLATE_PARM_DECL (t
) = decl
;
3906 TREE_TYPE (t
) = type
;
3907 TREE_CONSTANT (t
) = TREE_CONSTANT (decl
);
3908 TREE_READONLY (t
) = TREE_READONLY (decl
);
3913 /* Find the canonical type parameter for the given template type
3914 parameter. Returns the canonical type parameter, which may be TYPE
3915 if no such parameter existed. */
3918 canonical_type_parameter (tree type
)
3921 int idx
= TEMPLATE_TYPE_IDX (type
);
3922 if (!canonical_template_parms
)
3923 vec_alloc (canonical_template_parms
, idx
+1);
3925 while (canonical_template_parms
->length () <= (unsigned)idx
)
3926 vec_safe_push (canonical_template_parms
, NULL_TREE
);
3928 list
= (*canonical_template_parms
)[idx
];
3929 while (list
&& !comptypes (type
, TREE_VALUE (list
), COMPARE_STRUCTURAL
))
3930 list
= TREE_CHAIN (list
);
3933 return TREE_VALUE (list
);
3936 (*canonical_template_parms
)[idx
]
3937 = tree_cons (NULL_TREE
, type
,
3938 (*canonical_template_parms
)[idx
]);
3943 /* Return a TEMPLATE_PARM_INDEX, similar to INDEX, but whose
3944 TEMPLATE_PARM_LEVEL has been decreased by LEVELS. If such a
3945 TEMPLATE_PARM_INDEX already exists, it is returned; otherwise, a
3946 new one is created. */
3949 reduce_template_parm_level (tree index
, tree type
, int levels
, tree args
,
3950 tsubst_flags_t complain
)
3952 if (TEMPLATE_PARM_DESCENDANTS (index
) == NULL_TREE
3953 || (TEMPLATE_PARM_LEVEL (TEMPLATE_PARM_DESCENDANTS (index
))
3954 != TEMPLATE_PARM_LEVEL (index
) - levels
)
3955 || !same_type_p (type
, TREE_TYPE (TEMPLATE_PARM_DESCENDANTS (index
))))
3957 tree orig_decl
= TEMPLATE_PARM_DECL (index
);
3960 decl
= build_decl (DECL_SOURCE_LOCATION (orig_decl
),
3961 TREE_CODE (orig_decl
), DECL_NAME (orig_decl
), type
);
3962 TREE_CONSTANT (decl
) = TREE_CONSTANT (orig_decl
);
3963 TREE_READONLY (decl
) = TREE_READONLY (orig_decl
);
3964 DECL_ARTIFICIAL (decl
) = 1;
3965 SET_DECL_TEMPLATE_PARM_P (decl
);
3967 t
= build_template_parm_index (TEMPLATE_PARM_IDX (index
),
3968 TEMPLATE_PARM_LEVEL (index
) - levels
,
3969 TEMPLATE_PARM_ORIG_LEVEL (index
),
3971 TEMPLATE_PARM_DESCENDANTS (index
) = t
;
3972 TEMPLATE_PARM_PARAMETER_PACK (t
)
3973 = TEMPLATE_PARM_PARAMETER_PACK (index
);
3975 /* Template template parameters need this. */
3976 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
3978 DECL_TEMPLATE_RESULT (decl
)
3979 = build_decl (DECL_SOURCE_LOCATION (decl
),
3980 TYPE_DECL
, DECL_NAME (decl
), type
);
3981 DECL_ARTIFICIAL (DECL_TEMPLATE_RESULT (decl
)) = true;
3982 DECL_TEMPLATE_PARMS (decl
) = tsubst_template_parms
3983 (DECL_TEMPLATE_PARMS (orig_decl
), args
, complain
);
3987 return TEMPLATE_PARM_DESCENDANTS (index
);
3990 /* Process information from new template parameter PARM and append it
3991 to the LIST being built. This new parameter is a non-type
3992 parameter iff IS_NON_TYPE is true. This new parameter is a
3993 parameter pack iff IS_PARAMETER_PACK is true. The location of PARM
3997 process_template_parm (tree list
, location_t parm_loc
, tree parm
,
3998 bool is_non_type
, bool is_parameter_pack
)
4003 gcc_assert (TREE_CODE (parm
) == TREE_LIST
);
4004 tree defval
= TREE_PURPOSE (parm
);
4005 tree constr
= TREE_TYPE (parm
);
4009 tree p
= tree_last (list
);
4011 if (p
&& TREE_VALUE (p
) != error_mark_node
)
4014 if (TREE_CODE (p
) == TYPE_DECL
|| TREE_CODE (p
) == TEMPLATE_DECL
)
4015 idx
= TEMPLATE_TYPE_IDX (TREE_TYPE (p
));
4017 idx
= TEMPLATE_PARM_IDX (DECL_INITIAL (p
));
4025 parm
= TREE_VALUE (parm
);
4027 SET_DECL_TEMPLATE_PARM_P (parm
);
4029 if (TREE_TYPE (parm
) != error_mark_node
)
4033 The top-level cv-qualifiers on the template-parameter are
4034 ignored when determining its type. */
4035 TREE_TYPE (parm
) = TYPE_MAIN_VARIANT (TREE_TYPE (parm
));
4036 if (invalid_nontype_parm_type_p (TREE_TYPE (parm
), 1))
4037 TREE_TYPE (parm
) = error_mark_node
;
4038 else if (uses_parameter_packs (TREE_TYPE (parm
))
4039 && !is_parameter_pack
4040 /* If we're in a nested template parameter list, the template
4041 template parameter could be a parameter pack. */
4042 && processing_template_parmlist
== 1)
4044 /* This template parameter is not a parameter pack, but it
4045 should be. Complain about "bare" parameter packs. */
4046 check_for_bare_parameter_packs (TREE_TYPE (parm
));
4048 /* Recover by calling this a parameter pack. */
4049 is_parameter_pack
= true;
4053 /* A template parameter is not modifiable. */
4054 TREE_CONSTANT (parm
) = 1;
4055 TREE_READONLY (parm
) = 1;
4056 decl
= build_decl (parm_loc
,
4057 CONST_DECL
, DECL_NAME (parm
), TREE_TYPE (parm
));
4058 TREE_CONSTANT (decl
) = 1;
4059 TREE_READONLY (decl
) = 1;
4060 DECL_INITIAL (parm
) = DECL_INITIAL (decl
)
4061 = build_template_parm_index (idx
, processing_template_decl
,
4062 processing_template_decl
,
4063 decl
, TREE_TYPE (parm
));
4065 TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
))
4066 = is_parameter_pack
;
4071 parm
= TREE_VALUE (TREE_VALUE (parm
));
4073 if (parm
&& TREE_CODE (parm
) == TEMPLATE_DECL
)
4075 t
= cxx_make_type (TEMPLATE_TEMPLATE_PARM
);
4076 /* This is for distinguishing between real templates and template
4077 template parameters */
4078 TREE_TYPE (parm
) = t
;
4079 TREE_TYPE (DECL_TEMPLATE_RESULT (parm
)) = t
;
4084 t
= cxx_make_type (TEMPLATE_TYPE_PARM
);
4085 /* parm is either IDENTIFIER_NODE or NULL_TREE. */
4086 decl
= build_decl (parm_loc
,
4087 TYPE_DECL
, parm
, t
);
4090 TYPE_NAME (t
) = decl
;
4091 TYPE_STUB_DECL (t
) = decl
;
4093 TEMPLATE_TYPE_PARM_INDEX (t
)
4094 = build_template_parm_index (idx
, processing_template_decl
,
4095 processing_template_decl
,
4096 decl
, TREE_TYPE (parm
));
4097 TEMPLATE_TYPE_PARAMETER_PACK (t
) = is_parameter_pack
;
4098 TYPE_CANONICAL (t
) = canonical_type_parameter (t
);
4100 DECL_ARTIFICIAL (decl
) = 1;
4101 SET_DECL_TEMPLATE_PARM_P (decl
);
4103 /* Build requirements for the type/template parameter.
4104 This must be done after SET_DECL_TEMPLATE_PARM_P or
4105 process_template_parm could fail. */
4106 tree reqs
= finish_shorthand_constraint (parm
, constr
);
4110 /* Build the parameter node linking the parameter declaration,
4111 its default argument (if any), and its constraints (if any). */
4112 parm
= build_tree_list (defval
, parm
);
4113 TEMPLATE_PARM_CONSTRAINTS (parm
) = reqs
;
4115 return chainon (list
, parm
);
4118 /* The end of a template parameter list has been reached. Process the
4119 tree list into a parameter vector, converting each parameter into a more
4120 useful form. Type parameters are saved as IDENTIFIER_NODEs, and others
4124 end_template_parm_list (tree parms
)
4128 tree saved_parmlist
= make_tree_vec (list_length (parms
));
4130 /* Pop the dummy parameter level and add the real one. */
4131 current_template_parms
= TREE_CHAIN (current_template_parms
);
4133 current_template_parms
4134 = tree_cons (size_int (processing_template_decl
),
4135 saved_parmlist
, current_template_parms
);
4137 for (parm
= parms
, nparms
= 0; parm
; parm
= next
, nparms
++)
4139 next
= TREE_CHAIN (parm
);
4140 TREE_VEC_ELT (saved_parmlist
, nparms
) = parm
;
4141 TREE_CHAIN (parm
) = NULL_TREE
;
4144 --processing_template_parmlist
;
4146 return saved_parmlist
;
4149 // Explicitly indicate the end of the template parameter list. We assume
4150 // that the current template parameters have been constructed and/or
4151 // managed explicitly, as when creating new template template parameters
4152 // from a shorthand constraint.
4154 end_template_parm_list ()
4156 --processing_template_parmlist
;
4159 /* end_template_decl is called after a template declaration is seen. */
4162 end_template_decl (void)
4164 reset_specialization ();
4166 if (! processing_template_decl
)
4169 /* This matches the pushlevel in begin_template_parm_list. */
4172 --processing_template_decl
;
4173 current_template_parms
= TREE_CHAIN (current_template_parms
);
4176 /* Takes a TREE_LIST representing a template parameter and convert it
4177 into an argument suitable to be passed to the type substitution
4178 functions. Note that If the TREE_LIST contains an error_mark
4179 node, the returned argument is error_mark_node. */
4182 template_parm_to_arg (tree t
)
4186 || TREE_CODE (t
) != TREE_LIST
)
4189 if (error_operand_p (TREE_VALUE (t
)))
4190 return error_mark_node
;
4194 if (TREE_CODE (t
) == TYPE_DECL
4195 || TREE_CODE (t
) == TEMPLATE_DECL
)
4199 if (TEMPLATE_TYPE_PARAMETER_PACK (t
))
4201 /* Turn this argument into a TYPE_ARGUMENT_PACK
4202 with a single element, which expands T. */
4203 tree vec
= make_tree_vec (1);
4204 #ifdef ENABLE_CHECKING
4205 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT
4206 (vec
, TREE_VEC_LENGTH (vec
));
4208 TREE_VEC_ELT (vec
, 0) = make_pack_expansion (t
);
4210 t
= cxx_make_type (TYPE_ARGUMENT_PACK
);
4211 SET_ARGUMENT_PACK_ARGS (t
, vec
);
4216 t
= DECL_INITIAL (t
);
4218 if (TEMPLATE_PARM_PARAMETER_PACK (t
))
4220 /* Turn this argument into a NONTYPE_ARGUMENT_PACK
4221 with a single element, which expands T. */
4222 tree vec
= make_tree_vec (1);
4223 tree type
= TREE_TYPE (TEMPLATE_PARM_DECL (t
));
4224 #ifdef ENABLE_CHECKING
4225 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT
4226 (vec
, TREE_VEC_LENGTH (vec
));
4228 t
= convert_from_reference (t
);
4229 TREE_VEC_ELT (vec
, 0) = make_pack_expansion (t
);
4231 t
= make_node (NONTYPE_ARGUMENT_PACK
);
4232 SET_ARGUMENT_PACK_ARGS (t
, vec
);
4233 TREE_TYPE (t
) = type
;
4236 t
= convert_from_reference (t
);
4241 /* Given a set of template parameters, return them as a set of template
4242 arguments. The template parameters are represented as a TREE_VEC, in
4243 the form documented in cp-tree.h for template arguments. */
4246 template_parms_to_args (tree parms
)
4249 tree args
= NULL_TREE
;
4250 int length
= TMPL_PARMS_DEPTH (parms
);
4253 /* If there is only one level of template parameters, we do not
4254 create a TREE_VEC of TREE_VECs. Instead, we return a single
4255 TREE_VEC containing the arguments. */
4257 args
= make_tree_vec (length
);
4259 for (header
= parms
; header
; header
= TREE_CHAIN (header
))
4261 tree a
= copy_node (TREE_VALUE (header
));
4264 TREE_TYPE (a
) = NULL_TREE
;
4265 for (i
= TREE_VEC_LENGTH (a
) - 1; i
>= 0; --i
)
4266 TREE_VEC_ELT (a
, i
) = template_parm_to_arg (TREE_VEC_ELT (a
, i
));
4268 #ifdef ENABLE_CHECKING
4269 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (a
, TREE_VEC_LENGTH (a
));
4273 TREE_VEC_ELT (args
, --l
) = a
;
4281 /* Within the declaration of a template, return the currently active
4282 template parameters as an argument TREE_VEC. */
4285 current_template_args (void)
4287 return template_parms_to_args (current_template_parms
);
4290 /* Update the declared TYPE by doing any lookups which were thought to be
4291 dependent, but are not now that we know the SCOPE of the declarator. */
4294 maybe_update_decl_type (tree orig_type
, tree scope
)
4296 tree type
= orig_type
;
4298 if (type
== NULL_TREE
)
4301 if (TREE_CODE (orig_type
) == TYPE_DECL
)
4302 type
= TREE_TYPE (type
);
4304 if (scope
&& TYPE_P (scope
) && dependent_type_p (scope
)
4305 && dependent_type_p (type
)
4306 /* Don't bother building up the args in this case. */
4307 && TREE_CODE (type
) != TEMPLATE_TYPE_PARM
)
4309 /* tsubst in the args corresponding to the template parameters,
4310 including auto if present. Most things will be unchanged, but
4311 make_typename_type and tsubst_qualified_id will resolve
4312 TYPENAME_TYPEs and SCOPE_REFs that were previously dependent. */
4313 tree args
= current_template_args ();
4314 tree auto_node
= type_uses_auto (type
);
4318 tree auto_vec
= make_tree_vec (1);
4319 TREE_VEC_ELT (auto_vec
, 0) = auto_node
;
4320 args
= add_to_template_args (args
, auto_vec
);
4322 pushed
= push_scope (scope
);
4323 type
= tsubst (type
, args
, tf_warning_or_error
, NULL_TREE
);
4328 if (type
== error_mark_node
)
4331 if (TREE_CODE (orig_type
) == TYPE_DECL
)
4333 if (same_type_p (type
, TREE_TYPE (orig_type
)))
4336 type
= TYPE_NAME (type
);
4341 /* Return a TEMPLATE_DECL corresponding to DECL, using the indicated
4342 template PARMS and constraints, CONSTR. If MEMBER_TEMPLATE_P is true,
4343 the new template is a member template. */
4346 build_template_decl (tree decl
, tree parms
, bool member_template_p
)
4348 tree tmpl
= build_lang_decl (TEMPLATE_DECL
, DECL_NAME (decl
), NULL_TREE
);
4349 DECL_TEMPLATE_PARMS (tmpl
) = parms
;
4350 DECL_CONTEXT (tmpl
) = DECL_CONTEXT (decl
);
4351 DECL_SOURCE_LOCATION (tmpl
) = DECL_SOURCE_LOCATION (decl
);
4352 DECL_MEMBER_TEMPLATE_P (tmpl
) = member_template_p
;
4357 struct template_parm_data
4359 /* The level of the template parameters we are currently
4363 /* The index of the specialization argument we are currently
4367 /* An array whose size is the number of template parameters. The
4368 elements are nonzero if the parameter has been used in any one
4369 of the arguments processed so far. */
4372 /* An array whose size is the number of template arguments. The
4373 elements are nonzero if the argument makes use of template
4374 parameters of this level. */
4375 int* arg_uses_template_parms
;
4378 /* Subroutine of push_template_decl used to see if each template
4379 parameter in a partial specialization is used in the explicit
4380 argument list. If T is of the LEVEL given in DATA (which is
4381 treated as a template_parm_data*), then DATA->PARMS is marked
4385 mark_template_parm (tree t
, void* data
)
4389 struct template_parm_data
* tpd
= (struct template_parm_data
*) data
;
4391 template_parm_level_and_index (t
, &level
, &idx
);
4393 if (level
== tpd
->level
)
4395 tpd
->parms
[idx
] = 1;
4396 tpd
->arg_uses_template_parms
[tpd
->current_arg
] = 1;
4399 /* Return zero so that for_each_template_parm will continue the
4400 traversal of the tree; we want to mark *every* template parm. */
4404 /* Process the partial specialization DECL. */
4407 process_partial_specialization (tree decl
)
4409 tree type
= TREE_TYPE (decl
);
4410 tree tinfo
= get_template_info (decl
);
4411 tree maintmpl
= TI_TEMPLATE (tinfo
);
4412 tree specargs
= TI_ARGS (tinfo
);
4413 tree inner_args
= INNERMOST_TEMPLATE_ARGS (specargs
);
4414 tree main_inner_parms
= DECL_INNERMOST_TEMPLATE_PARMS (maintmpl
);
4417 int nargs
= TREE_VEC_LENGTH (inner_args
);
4420 bool did_error_intro
= false;
4421 struct template_parm_data tpd
;
4422 struct template_parm_data tpd2
;
4424 gcc_assert (current_template_parms
);
4426 /* A concept cannot be specialized. */
4427 if (flag_concepts
&& variable_concept_p (maintmpl
))
4429 error ("specialization of variable concept %q#D", maintmpl
);
4430 return error_mark_node
;
4433 inner_parms
= INNERMOST_TEMPLATE_PARMS (current_template_parms
);
4434 ntparms
= TREE_VEC_LENGTH (inner_parms
);
4436 /* We check that each of the template parameters given in the
4437 partial specialization is used in the argument list to the
4438 specialization. For example:
4440 template <class T> struct S;
4441 template <class T> struct S<T*>;
4443 The second declaration is OK because `T*' uses the template
4444 parameter T, whereas
4446 template <class T> struct S<int>;
4448 is no good. Even trickier is:
4459 The S2<T> declaration is actually invalid; it is a
4460 full-specialization. Of course,
4463 struct S2<T (*)(U)>;
4465 or some such would have been OK. */
4466 tpd
.level
= TMPL_PARMS_DEPTH (current_template_parms
);
4467 tpd
.parms
= XALLOCAVEC (int, ntparms
);
4468 memset (tpd
.parms
, 0, sizeof (int) * ntparms
);
4470 tpd
.arg_uses_template_parms
= XALLOCAVEC (int, nargs
);
4471 memset (tpd
.arg_uses_template_parms
, 0, sizeof (int) * nargs
);
4472 for (i
= 0; i
< nargs
; ++i
)
4474 tpd
.current_arg
= i
;
4475 for_each_template_parm (TREE_VEC_ELT (inner_args
, i
),
4476 &mark_template_parm
,
4479 /*include_nondeduced_p=*/false);
4481 for (i
= 0; i
< ntparms
; ++i
)
4482 if (tpd
.parms
[i
] == 0)
4484 /* One of the template parms was not used in a deduced context in the
4486 if (!did_error_intro
)
4488 error ("template parameters not deducible in "
4489 "partial specialization:");
4490 did_error_intro
= true;
4493 inform (input_location
, " %qD",
4494 TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
)));
4497 if (did_error_intro
)
4498 return error_mark_node
;
4500 /* [temp.class.spec]
4502 The argument list of the specialization shall not be identical to
4503 the implicit argument list of the primary template. */
4505 = TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (maintmpl
)));
4506 if (comp_template_args (inner_args
, INNERMOST_TEMPLATE_ARGS (main_args
))
4508 || !subsumes_constraints (current_template_constraints (),
4509 get_constraints (maintmpl
))))
4512 error ("partial specialization %q+D does not specialize "
4513 "any template arguments", decl
);
4515 error ("partial specialization %q+D does not specialize any "
4516 "template arguments and is not more constrained than", decl
);
4517 inform (DECL_SOURCE_LOCATION (maintmpl
), "primary template here");
4520 /* A partial specialization that replaces multiple parameters of the
4521 primary template with a pack expansion is less specialized for those
4523 if (nargs
< DECL_NTPARMS (maintmpl
))
4525 error ("partial specialization is not more specialized than the "
4526 "primary template because it replaces multiple parameters "
4527 "with a pack expansion");
4528 inform (DECL_SOURCE_LOCATION (maintmpl
), "primary template here");
4532 /* [temp.class.spec]
4534 A partially specialized non-type argument expression shall not
4535 involve template parameters of the partial specialization except
4536 when the argument expression is a simple identifier.
4538 The type of a template parameter corresponding to a specialized
4539 non-type argument shall not be dependent on a parameter of the
4542 Also, we verify that pack expansions only occur at the
4543 end of the argument list. */
4544 gcc_assert (nargs
== DECL_NTPARMS (maintmpl
));
4546 for (i
= 0; i
< nargs
; ++i
)
4548 tree parm
= TREE_VALUE (TREE_VEC_ELT (main_inner_parms
, i
));
4549 tree arg
= TREE_VEC_ELT (inner_args
, i
);
4550 tree packed_args
= NULL_TREE
;
4553 if (ARGUMENT_PACK_P (arg
))
4555 /* Extract the arguments from the argument pack. We'll be
4556 iterating over these in the following loop. */
4557 packed_args
= ARGUMENT_PACK_ARGS (arg
);
4558 len
= TREE_VEC_LENGTH (packed_args
);
4561 for (j
= 0; j
< len
; j
++)
4564 /* Get the Jth argument in the parameter pack. */
4565 arg
= TREE_VEC_ELT (packed_args
, j
);
4567 if (PACK_EXPANSION_P (arg
))
4569 /* Pack expansions must come at the end of the
4571 if ((packed_args
&& j
< len
- 1)
4572 || (!packed_args
&& i
< nargs
- 1))
4574 if (TREE_CODE (arg
) == EXPR_PACK_EXPANSION
)
4575 error ("parameter pack argument %qE must be at the "
4576 "end of the template argument list", arg
);
4578 error ("parameter pack argument %qT must be at the "
4579 "end of the template argument list", arg
);
4583 if (TREE_CODE (arg
) == EXPR_PACK_EXPANSION
)
4584 /* We only care about the pattern. */
4585 arg
= PACK_EXPANSION_PATTERN (arg
);
4587 if (/* These first two lines are the `non-type' bit. */
4589 && TREE_CODE (arg
) != TEMPLATE_DECL
4590 /* This next two lines are the `argument expression is not just a
4591 simple identifier' condition and also the `specialized
4592 non-type argument' bit. */
4593 && TREE_CODE (arg
) != TEMPLATE_PARM_INDEX
4594 && !(REFERENCE_REF_P (arg
)
4595 && TREE_CODE (TREE_OPERAND (arg
, 0)) == TEMPLATE_PARM_INDEX
))
4597 if ((!packed_args
&& tpd
.arg_uses_template_parms
[i
])
4598 || (packed_args
&& uses_template_parms (arg
)))
4599 error ("template argument %qE involves template parameter(s)",
4603 /* Look at the corresponding template parameter,
4604 marking which template parameters its type depends
4606 tree type
= TREE_TYPE (parm
);
4610 /* We haven't yet initialized TPD2. Do so now. */
4611 tpd2
.arg_uses_template_parms
= XALLOCAVEC (int, nargs
);
4612 /* The number of parameters here is the number in the
4613 main template, which, as checked in the assertion
4615 tpd2
.parms
= XALLOCAVEC (int, nargs
);
4617 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (maintmpl
));
4620 /* Mark the template parameters. But this time, we're
4621 looking for the template parameters of the main
4622 template, not in the specialization. */
4623 tpd2
.current_arg
= i
;
4624 tpd2
.arg_uses_template_parms
[i
] = 0;
4625 memset (tpd2
.parms
, 0, sizeof (int) * nargs
);
4626 for_each_template_parm (type
,
4627 &mark_template_parm
,
4630 /*include_nondeduced_p=*/false);
4632 if (tpd2
.arg_uses_template_parms
[i
])
4634 /* The type depended on some template parameters.
4635 If they are fully specialized in the
4636 specialization, that's OK. */
4639 for (j
= 0; j
< nargs
; ++j
)
4640 if (tpd2
.parms
[j
] != 0
4641 && tpd
.arg_uses_template_parms
[j
])
4644 error_n (input_location
, count
,
4645 "type %qT of template argument %qE depends "
4646 "on a template parameter",
4647 "type %qT of template argument %qE depends "
4648 "on template parameters",
4657 /* We should only get here once. */
4658 if (TREE_CODE (decl
) == TYPE_DECL
)
4659 gcc_assert (!COMPLETE_TYPE_P (type
));
4661 // Build the template decl.
4662 tree tmpl
= build_template_decl (decl
, current_template_parms
,
4663 DECL_MEMBER_TEMPLATE_P (maintmpl
));
4664 TREE_TYPE (tmpl
) = type
;
4665 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
4666 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
4667 DECL_TEMPLATE_INFO (tmpl
) = build_template_info (maintmpl
, specargs
);
4668 DECL_PRIMARY_TEMPLATE (tmpl
) = maintmpl
;
4671 /* We didn't register this in check_explicit_specialization so we could
4672 wait until the constraints were set. */
4673 decl
= register_specialization (decl
, maintmpl
, specargs
, false, 0);
4675 associate_classtype_constraints (type
);
4677 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)
4678 = tree_cons (specargs
, tmpl
,
4679 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
));
4680 TREE_TYPE (DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)) = type
;
4682 for (inst
= DECL_TEMPLATE_INSTANTIATIONS (maintmpl
); inst
;
4683 inst
= TREE_CHAIN (inst
))
4685 tree instance
= TREE_VALUE (inst
);
4686 if (TYPE_P (instance
)
4687 ? (COMPLETE_TYPE_P (instance
)
4688 && CLASSTYPE_IMPLICIT_INSTANTIATION (instance
))
4689 : DECL_TEMPLATE_INSTANTIATION (instance
))
4691 tree spec
= most_specialized_partial_spec (instance
, tf_none
);
4692 tree inst_decl
= (DECL_P (instance
)
4693 ? instance
: TYPE_NAME (instance
));
4696 else if (spec
== error_mark_node
)
4697 permerror (input_location
,
4698 "declaration of %qD ambiguates earlier template "
4699 "instantiation for %qD", decl
, inst_decl
);
4700 else if (TREE_VALUE (spec
) == tmpl
)
4701 permerror (input_location
,
4702 "partial specialization of %qD after instantiation "
4703 "of %qD", decl
, inst_decl
);
4710 /* PARM is a template parameter of some form; return the corresponding
4711 TEMPLATE_PARM_INDEX. */
4714 get_template_parm_index (tree parm
)
4716 if (TREE_CODE (parm
) == PARM_DECL
4717 || TREE_CODE (parm
) == CONST_DECL
)
4718 parm
= DECL_INITIAL (parm
);
4719 else if (TREE_CODE (parm
) == TYPE_DECL
4720 || TREE_CODE (parm
) == TEMPLATE_DECL
)
4721 parm
= TREE_TYPE (parm
);
4722 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
4723 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
4724 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
)
4725 parm
= TEMPLATE_TYPE_PARM_INDEX (parm
);
4726 gcc_assert (TREE_CODE (parm
) == TEMPLATE_PARM_INDEX
);
4730 /* Subroutine of fixed_parameter_pack_p below. Look for any template
4731 parameter packs used by the template parameter PARM. */
4734 fixed_parameter_pack_p_1 (tree parm
, struct find_parameter_pack_data
*ppd
)
4736 /* A type parm can't refer to another parm. */
4737 if (TREE_CODE (parm
) == TYPE_DECL
)
4739 else if (TREE_CODE (parm
) == PARM_DECL
)
4741 cp_walk_tree (&TREE_TYPE (parm
), &find_parameter_packs_r
,
4746 gcc_assert (TREE_CODE (parm
) == TEMPLATE_DECL
);
4748 tree vec
= INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (parm
));
4749 for (int i
= 0; i
< TREE_VEC_LENGTH (vec
); ++i
)
4750 fixed_parameter_pack_p_1 (TREE_VALUE (TREE_VEC_ELT (vec
, i
)), ppd
);
4753 /* PARM is a template parameter pack. Return any parameter packs used in
4754 its type or the type of any of its template parameters. If there are
4755 any such packs, it will be instantiated into a fixed template parameter
4756 list by partial instantiation rather than be fully deduced. */
4759 fixed_parameter_pack_p (tree parm
)
4761 /* This can only be true in a member template. */
4762 if (TEMPLATE_PARM_ORIG_LEVEL (get_template_parm_index (parm
)) < 2)
4764 /* This can only be true for a parameter pack. */
4765 if (!template_parameter_pack_p (parm
))
4767 /* A type parm can't refer to another parm. */
4768 if (TREE_CODE (parm
) == TYPE_DECL
)
4771 tree parameter_packs
= NULL_TREE
;
4772 struct find_parameter_pack_data ppd
;
4773 ppd
.parameter_packs
= ¶meter_packs
;
4774 ppd
.visited
= new hash_set
<tree
>;
4776 fixed_parameter_pack_p_1 (parm
, &ppd
);
4779 return parameter_packs
;
4782 /* Check that a template declaration's use of default arguments and
4783 parameter packs is not invalid. Here, PARMS are the template
4784 parameters. IS_PRIMARY is true if DECL is the thing declared by
4785 a primary template. IS_PARTIAL is true if DECL is a partial
4788 IS_FRIEND_DECL is nonzero if DECL is a friend function template
4789 declaration (but not a definition); 1 indicates a declaration, 2
4790 indicates a redeclaration. When IS_FRIEND_DECL=2, no errors are
4791 emitted for extraneous default arguments.
4793 Returns TRUE if there were no errors found, FALSE otherwise. */
4796 check_default_tmpl_args (tree decl
, tree parms
, bool is_primary
,
4797 bool is_partial
, int is_friend_decl
)
4800 int last_level_to_check
;
4802 bool no_errors
= true;
4806 A default template-argument shall not be specified in a
4807 function template declaration or a function template definition, nor
4808 in the template-parameter-list of the definition of a member of a
4811 if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == FUNCTION_DECL
4812 || (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_LOCAL_FUNCTION_P (decl
)))
4813 /* You can't have a function template declaration in a local
4814 scope, nor you can you define a member of a class template in a
4818 if ((TREE_CODE (decl
) == TYPE_DECL
4820 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
4821 || (TREE_CODE (decl
) == FUNCTION_DECL
4822 && LAMBDA_FUNCTION_P (decl
)))
4823 /* A lambda doesn't have an explicit declaration; don't complain
4824 about the parms of the enclosing class. */
4827 if (current_class_type
4828 && !TYPE_BEING_DEFINED (current_class_type
)
4829 && DECL_LANG_SPECIFIC (decl
)
4830 && DECL_DECLARES_FUNCTION_P (decl
)
4831 /* If this is either a friend defined in the scope of the class
4832 or a member function. */
4833 && (DECL_FUNCTION_MEMBER_P (decl
)
4834 ? same_type_p (DECL_CONTEXT (decl
), current_class_type
)
4835 : DECL_FRIEND_CONTEXT (decl
)
4836 ? same_type_p (DECL_FRIEND_CONTEXT (decl
), current_class_type
)
4838 /* And, if it was a member function, it really was defined in
4839 the scope of the class. */
4840 && (!DECL_FUNCTION_MEMBER_P (decl
)
4841 || DECL_INITIALIZED_IN_CLASS_P (decl
)))
4842 /* We already checked these parameters when the template was
4843 declared, so there's no need to do it again now. This function
4844 was defined in class scope, but we're processing its body now
4845 that the class is complete. */
4848 /* Core issue 226 (C++0x only): the following only applies to class
4851 && ((cxx_dialect
== cxx98
) || TREE_CODE (decl
) != FUNCTION_DECL
))
4855 If a template-parameter has a default template-argument, all
4856 subsequent template-parameters shall have a default
4857 template-argument supplied. */
4858 for (parm_level
= parms
; parm_level
; parm_level
= TREE_CHAIN (parm_level
))
4860 tree inner_parms
= TREE_VALUE (parm_level
);
4861 int ntparms
= TREE_VEC_LENGTH (inner_parms
);
4862 int seen_def_arg_p
= 0;
4865 for (i
= 0; i
< ntparms
; ++i
)
4867 tree parm
= TREE_VEC_ELT (inner_parms
, i
);
4869 if (parm
== error_mark_node
)
4872 if (TREE_PURPOSE (parm
))
4874 else if (seen_def_arg_p
4875 && !template_parameter_pack_p (TREE_VALUE (parm
)))
4877 error ("no default argument for %qD", TREE_VALUE (parm
));
4878 /* For better subsequent error-recovery, we indicate that
4879 there should have been a default argument. */
4880 TREE_PURPOSE (parm
) = error_mark_node
;
4883 else if (!is_partial
4885 /* Don't complain about an enclosing partial
4887 && parm_level
== parms
4888 && TREE_CODE (decl
) == TYPE_DECL
4890 && template_parameter_pack_p (TREE_VALUE (parm
))
4891 /* A fixed parameter pack will be partially
4892 instantiated into a fixed length list. */
4893 && !fixed_parameter_pack_p (TREE_VALUE (parm
)))
4895 /* A primary class template can only have one
4896 parameter pack, at the end of the template
4899 error ("parameter pack %q+D must be at the end of the"
4900 " template parameter list", TREE_VALUE (parm
));
4902 TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
))
4910 if (((cxx_dialect
== cxx98
) && TREE_CODE (decl
) != TYPE_DECL
)
4914 /* For an ordinary class template, default template arguments are
4915 allowed at the innermost level, e.g.:
4916 template <class T = int>
4918 but, in a partial specialization, they're not allowed even
4919 there, as we have in [temp.class.spec]:
4921 The template parameter list of a specialization shall not
4922 contain default template argument values.
4924 So, for a partial specialization, or for a function template
4925 (in C++98/C++03), we look at all of them. */
4928 /* But, for a primary class template that is not a partial
4929 specialization we look at all template parameters except the
4931 parms
= TREE_CHAIN (parms
);
4933 /* Figure out what error message to issue. */
4934 if (is_friend_decl
== 2)
4935 msg
= G_("default template arguments may not be used in function template "
4936 "friend re-declaration");
4937 else if (is_friend_decl
)
4938 msg
= G_("default template arguments may not be used in function template "
4939 "friend declarations");
4940 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& (cxx_dialect
== cxx98
))
4941 msg
= G_("default template arguments may not be used in function templates "
4942 "without -std=c++11 or -std=gnu++11");
4943 else if (is_partial
)
4944 msg
= G_("default template arguments may not be used in "
4945 "partial specializations");
4946 else if (current_class_type
&& CLASSTYPE_IS_TEMPLATE (current_class_type
))
4947 msg
= G_("default argument for template parameter for class enclosing %qD");
4949 /* Per [temp.param]/9, "A default template-argument shall not be
4950 specified in the template-parameter-lists of the definition of
4951 a member of a class template that appears outside of the member's
4952 class.", thus if we aren't handling a member of a class template
4953 there is no need to examine the parameters. */
4956 if (current_class_type
&& TYPE_BEING_DEFINED (current_class_type
))
4957 /* If we're inside a class definition, there's no need to
4958 examine the parameters to the class itself. On the one
4959 hand, they will be checked when the class is defined, and,
4960 on the other, default arguments are valid in things like:
4961 template <class T = double>
4962 struct S { template <class U> void f(U); };
4963 Here the default argument for `S' has no bearing on the
4964 declaration of `f'. */
4965 last_level_to_check
= template_class_depth (current_class_type
) + 1;
4967 /* Check everything. */
4968 last_level_to_check
= 0;
4970 for (parm_level
= parms
;
4971 parm_level
&& TMPL_PARMS_DEPTH (parm_level
) >= last_level_to_check
;
4972 parm_level
= TREE_CHAIN (parm_level
))
4974 tree inner_parms
= TREE_VALUE (parm_level
);
4978 ntparms
= TREE_VEC_LENGTH (inner_parms
);
4979 for (i
= 0; i
< ntparms
; ++i
)
4981 if (TREE_VEC_ELT (inner_parms
, i
) == error_mark_node
)
4984 if (TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)))
4989 if (is_friend_decl
== 2)
4996 /* Clear out the default argument so that we are not
4998 TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)) = NULL_TREE
;
5002 /* At this point, if we're still interested in issuing messages,
5003 they must apply to classes surrounding the object declared. */
5005 msg
= G_("default argument for template parameter for class "
5012 /* Worker for push_template_decl_real, called via
5013 for_each_template_parm. DATA is really an int, indicating the
5014 level of the parameters we are interested in. If T is a template
5015 parameter of that level, return nonzero. */
5018 template_parm_this_level_p (tree t
, void* data
)
5020 int this_level
= *(int *)data
;
5023 if (TREE_CODE (t
) == TEMPLATE_PARM_INDEX
)
5024 level
= TEMPLATE_PARM_LEVEL (t
);
5026 level
= TEMPLATE_TYPE_LEVEL (t
);
5027 return level
== this_level
;
5030 /* Creates a TEMPLATE_DECL for the indicated DECL using the template
5031 parameters given by current_template_args, or reuses a
5032 previously existing one, if appropriate. Returns the DECL, or an
5033 equivalent one, if it is replaced via a call to duplicate_decls.
5035 If IS_FRIEND is true, DECL is a friend declaration. */
5038 push_template_decl_real (tree decl
, bool is_friend
)
5046 int new_template_p
= 0;
5047 /* True if the template is a member template, in the sense of
5049 bool member_template_p
= false;
5051 if (decl
== error_mark_node
|| !current_template_parms
)
5052 return error_mark_node
;
5054 /* See if this is a partial specialization. */
5055 is_partial
= ((DECL_IMPLICIT_TYPEDEF_P (decl
)
5056 && TREE_CODE (TREE_TYPE (decl
)) != ENUMERAL_TYPE
5057 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)))
5059 && DECL_LANG_SPECIFIC (decl
)
5060 && DECL_TEMPLATE_SPECIALIZATION (decl
)
5061 && TINFO_USED_TEMPLATE_ID (DECL_TEMPLATE_INFO (decl
))));
5063 if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_FRIEND_P (decl
))
5067 /* For a friend, we want the context of the friend function, not
5068 the type of which it is a friend. */
5069 ctx
= CP_DECL_CONTEXT (decl
);
5070 else if (CP_DECL_CONTEXT (decl
)
5071 && TREE_CODE (CP_DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
5072 /* In the case of a virtual function, we want the class in which
5074 ctx
= CP_DECL_CONTEXT (decl
);
5076 /* Otherwise, if we're currently defining some class, the DECL
5077 is assumed to be a member of the class. */
5078 ctx
= current_scope ();
5080 if (ctx
&& TREE_CODE (ctx
) == NAMESPACE_DECL
)
5083 if (!DECL_CONTEXT (decl
))
5084 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
5086 /* See if this is a primary template. */
5087 if (is_friend
&& ctx
5088 && uses_template_parms_level (ctx
, processing_template_decl
))
5089 /* A friend template that specifies a class context, i.e.
5090 template <typename T> friend void A<T>::f();
5093 else if (TREE_CODE (decl
) == TYPE_DECL
5094 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
5097 is_primary
= template_parm_scope_p ();
5101 warning (OPT_Wtemplates
, "template %qD declared", decl
);
5103 if (DECL_CLASS_SCOPE_P (decl
))
5104 member_template_p
= true;
5105 if (TREE_CODE (decl
) == TYPE_DECL
5106 && anon_aggrname_p (DECL_NAME (decl
)))
5108 error ("template class without a name");
5109 return error_mark_node
;
5111 else if (TREE_CODE (decl
) == FUNCTION_DECL
)
5113 if (member_template_p
)
5115 if (DECL_OVERRIDE_P (decl
) || DECL_FINAL_P (decl
))
5116 error ("member template %qD may not have virt-specifiers", decl
);
5118 if (DECL_DESTRUCTOR_P (decl
))
5122 A destructor shall not be a member template. */
5123 error ("destructor %qD declared as member template", decl
);
5124 return error_mark_node
;
5126 if (NEW_DELETE_OPNAME_P (DECL_NAME (decl
))
5127 && (!prototype_p (TREE_TYPE (decl
))
5128 || TYPE_ARG_TYPES (TREE_TYPE (decl
)) == void_list_node
5129 || !TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)))
5130 || (TREE_CHAIN (TYPE_ARG_TYPES ((TREE_TYPE (decl
))))
5131 == void_list_node
)))
5133 /* [basic.stc.dynamic.allocation]
5135 An allocation function can be a function
5136 template. ... Template allocation functions shall
5137 have two or more parameters. */
5138 error ("invalid template declaration of %qD", decl
);
5139 return error_mark_node
;
5142 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
5143 && CLASS_TYPE_P (TREE_TYPE (decl
)))
5145 else if (TREE_CODE (decl
) == TYPE_DECL
5146 && TYPE_DECL_ALIAS_P (decl
))
5147 /* alias-declaration */
5148 gcc_assert (!DECL_ARTIFICIAL (decl
));
5149 else if (VAR_P (decl
))
5150 /* C++14 variable template. */;
5153 error ("template declaration of %q#D", decl
);
5154 return error_mark_node
;
5158 /* Check to see that the rules regarding the use of default
5159 arguments are not being violated. */
5160 check_default_tmpl_args (decl
, current_template_parms
,
5161 is_primary
, is_partial
, /*is_friend_decl=*/0);
5163 /* Ensure that there are no parameter packs in the type of this
5164 declaration that have not been expanded. */
5165 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5167 /* Check each of the arguments individually to see if there are
5168 any bare parameter packs. */
5169 tree type
= TREE_TYPE (decl
);
5170 tree arg
= DECL_ARGUMENTS (decl
);
5171 tree argtype
= TYPE_ARG_TYPES (type
);
5173 while (arg
&& argtype
)
5175 if (!DECL_PACK_P (arg
)
5176 && check_for_bare_parameter_packs (TREE_TYPE (arg
)))
5178 /* This is a PARM_DECL that contains unexpanded parameter
5179 packs. We have already complained about this in the
5180 check_for_bare_parameter_packs call, so just replace
5181 these types with ERROR_MARK_NODE. */
5182 TREE_TYPE (arg
) = error_mark_node
;
5183 TREE_VALUE (argtype
) = error_mark_node
;
5186 arg
= DECL_CHAIN (arg
);
5187 argtype
= TREE_CHAIN (argtype
);
5190 /* Check for bare parameter packs in the return type and the
5191 exception specifiers. */
5192 if (check_for_bare_parameter_packs (TREE_TYPE (type
)))
5193 /* Errors were already issued, set return type to int
5194 as the frontend doesn't expect error_mark_node as
5196 TREE_TYPE (type
) = integer_type_node
;
5197 if (check_for_bare_parameter_packs (TYPE_RAISES_EXCEPTIONS (type
)))
5198 TYPE_RAISES_EXCEPTIONS (type
) = NULL_TREE
;
5200 else if (check_for_bare_parameter_packs ((TREE_CODE (decl
) == TYPE_DECL
5201 && TYPE_DECL_ALIAS_P (decl
))
5202 ? DECL_ORIGINAL_TYPE (decl
)
5203 : TREE_TYPE (decl
)))
5205 TREE_TYPE (decl
) = error_mark_node
;
5206 return error_mark_node
;
5210 return process_partial_specialization (decl
);
5212 args
= current_template_args ();
5215 || TREE_CODE (ctx
) == FUNCTION_DECL
5216 || (CLASS_TYPE_P (ctx
) && TYPE_BEING_DEFINED (ctx
))
5217 || (TREE_CODE (decl
) == TYPE_DECL
5218 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
5219 || (is_friend
&& !DECL_TEMPLATE_INFO (decl
)))
5221 if (DECL_LANG_SPECIFIC (decl
)
5222 && DECL_TEMPLATE_INFO (decl
)
5223 && DECL_TI_TEMPLATE (decl
))
5224 tmpl
= DECL_TI_TEMPLATE (decl
);
5225 /* If DECL is a TYPE_DECL for a class-template, then there won't
5226 be DECL_LANG_SPECIFIC. The information equivalent to
5227 DECL_TEMPLATE_INFO is found in TYPE_TEMPLATE_INFO instead. */
5228 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
5229 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl
))
5230 && TYPE_TI_TEMPLATE (TREE_TYPE (decl
)))
5232 /* Since a template declaration already existed for this
5233 class-type, we must be redeclaring it here. Make sure
5234 that the redeclaration is valid. */
5235 redeclare_class_template (TREE_TYPE (decl
),
5236 current_template_parms
,
5237 current_template_constraints ());
5238 /* We don't need to create a new TEMPLATE_DECL; just use the
5239 one we already had. */
5240 tmpl
= TYPE_TI_TEMPLATE (TREE_TYPE (decl
));
5244 tmpl
= build_template_decl (decl
, current_template_parms
,
5248 if (DECL_LANG_SPECIFIC (decl
)
5249 && DECL_TEMPLATE_SPECIALIZATION (decl
))
5251 /* A specialization of a member template of a template
5253 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
5254 DECL_TEMPLATE_INFO (tmpl
) = DECL_TEMPLATE_INFO (decl
);
5255 DECL_TEMPLATE_INFO (decl
) = NULL_TREE
;
5261 tree a
, t
, current
, parms
;
5263 tree tinfo
= get_template_info (decl
);
5267 error ("template definition of non-template %q#D", decl
);
5268 return error_mark_node
;
5271 tmpl
= TI_TEMPLATE (tinfo
);
5273 if (DECL_FUNCTION_TEMPLATE_P (tmpl
)
5274 && DECL_TEMPLATE_INFO (decl
) && DECL_TI_ARGS (decl
)
5275 && DECL_TEMPLATE_SPECIALIZATION (decl
)
5276 && DECL_MEMBER_TEMPLATE_P (tmpl
))
5280 /* The declaration is a specialization of a member
5281 template, declared outside the class. Therefore, the
5282 innermost template arguments will be NULL, so we
5283 replace them with the arguments determined by the
5284 earlier call to check_explicit_specialization. */
5285 args
= DECL_TI_ARGS (decl
);
5288 = build_template_decl (decl
, current_template_parms
,
5290 DECL_TEMPLATE_RESULT (new_tmpl
) = decl
;
5291 TREE_TYPE (new_tmpl
) = TREE_TYPE (decl
);
5292 DECL_TI_TEMPLATE (decl
) = new_tmpl
;
5293 SET_DECL_TEMPLATE_SPECIALIZATION (new_tmpl
);
5294 DECL_TEMPLATE_INFO (new_tmpl
)
5295 = build_template_info (tmpl
, args
);
5297 register_specialization (new_tmpl
,
5298 most_general_template (tmpl
),
5304 /* Make sure the template headers we got make sense. */
5306 parms
= DECL_TEMPLATE_PARMS (tmpl
);
5307 i
= TMPL_PARMS_DEPTH (parms
);
5308 if (TMPL_ARGS_DEPTH (args
) != i
)
5310 error ("expected %d levels of template parms for %q#D, got %d",
5311 i
, decl
, TMPL_ARGS_DEPTH (args
));
5312 DECL_INTERFACE_KNOWN (decl
) = 1;
5313 return error_mark_node
;
5316 for (current
= decl
; i
> 0; --i
, parms
= TREE_CHAIN (parms
))
5318 a
= TMPL_ARGS_LEVEL (args
, i
);
5319 t
= INNERMOST_TEMPLATE_PARMS (parms
);
5321 if (TREE_VEC_LENGTH (t
) != TREE_VEC_LENGTH (a
))
5323 if (current
== decl
)
5324 error ("got %d template parameters for %q#D",
5325 TREE_VEC_LENGTH (a
), decl
);
5327 error ("got %d template parameters for %q#T",
5328 TREE_VEC_LENGTH (a
), current
);
5329 error (" but %d required", TREE_VEC_LENGTH (t
));
5330 /* Avoid crash in import_export_decl. */
5331 DECL_INTERFACE_KNOWN (decl
) = 1;
5332 return error_mark_node
;
5335 if (current
== decl
)
5337 else if (current
== NULL_TREE
)
5338 /* Can happen in erroneous input. */
5341 current
= get_containing_scope (current
);
5344 /* Check that the parms are used in the appropriate qualifying scopes
5345 in the declarator. */
5346 if (!comp_template_args
5348 TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (tmpl
)))))
5351 template arguments to %qD do not match original template %qD",
5352 decl
, DECL_TEMPLATE_RESULT (tmpl
));
5353 if (!uses_template_parms (TI_ARGS (tinfo
)))
5354 inform (input_location
, "use template<> for an explicit specialization");
5355 /* Avoid crash in import_export_decl. */
5356 DECL_INTERFACE_KNOWN (decl
) = 1;
5357 return error_mark_node
;
5361 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
5362 TREE_TYPE (tmpl
) = TREE_TYPE (decl
);
5364 /* Push template declarations for global functions and types. Note
5365 that we do not try to push a global template friend declared in a
5366 template class; such a thing may well depend on the template
5367 parameters of the class. */
5368 if (new_template_p
&& !ctx
5369 && !(is_friend
&& template_class_depth (current_class_type
) > 0))
5371 tmpl
= pushdecl_namespace_level (tmpl
, is_friend
);
5372 if (tmpl
== error_mark_node
)
5373 return error_mark_node
;
5375 /* Hide template friend classes that haven't been declared yet. */
5376 if (is_friend
&& TREE_CODE (decl
) == TYPE_DECL
)
5378 DECL_ANTICIPATED (tmpl
) = 1;
5379 DECL_FRIEND_P (tmpl
) = 1;
5385 tree parms
= DECL_TEMPLATE_PARMS (tmpl
);
5388 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
5389 if (DECL_CONV_FN_P (tmpl
))
5391 int depth
= TMPL_PARMS_DEPTH (parms
);
5393 /* It is a conversion operator. See if the type converted to
5394 depends on innermost template operands. */
5396 if (uses_template_parms_level (TREE_TYPE (TREE_TYPE (tmpl
)),
5398 DECL_TEMPLATE_CONV_FN_P (tmpl
) = 1;
5401 /* Give template template parms a DECL_CONTEXT of the template
5402 for which they are a parameter. */
5403 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
5404 for (i
= TREE_VEC_LENGTH (parms
) - 1; i
>= 0; --i
)
5406 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
5407 if (TREE_CODE (parm
) == TEMPLATE_DECL
)
5408 DECL_CONTEXT (parm
) = tmpl
;
5411 if (TREE_CODE (decl
) == TYPE_DECL
5412 && TYPE_DECL_ALIAS_P (decl
)
5413 && complex_alias_template_p (tmpl
))
5414 TEMPLATE_DECL_COMPLEX_ALIAS_P (tmpl
) = true;
5417 /* The DECL_TI_ARGS of DECL contains full set of arguments referring
5418 back to its most general template. If TMPL is a specialization,
5419 ARGS may only have the innermost set of arguments. Add the missing
5420 argument levels if necessary. */
5421 if (DECL_TEMPLATE_INFO (tmpl
))
5422 args
= add_outermost_template_args (DECL_TI_ARGS (tmpl
), args
);
5424 info
= build_template_info (tmpl
, args
);
5426 if (DECL_IMPLICIT_TYPEDEF_P (decl
))
5427 SET_TYPE_TEMPLATE_INFO (TREE_TYPE (tmpl
), info
);
5430 if (is_primary
&& !DECL_LANG_SPECIFIC (decl
))
5431 retrofit_lang_decl (decl
);
5432 if (DECL_LANG_SPECIFIC (decl
))
5433 DECL_TEMPLATE_INFO (decl
) = info
;
5436 if (flag_implicit_templates
5438 && TREE_PUBLIC (decl
)
5439 && VAR_OR_FUNCTION_DECL_P (decl
))
5440 /* Set DECL_COMDAT on template instantiations; if we force
5441 them to be emitted by explicit instantiation or -frepo,
5442 mark_needed will tell cgraph to do the right thing. */
5443 DECL_COMDAT (decl
) = true;
5445 return DECL_TEMPLATE_RESULT (tmpl
);
5449 push_template_decl (tree decl
)
5451 return push_template_decl_real (decl
, false);
5454 /* FN is an inheriting constructor that inherits from the constructor
5455 template INHERITED; turn FN into a constructor template with a matching
5459 add_inherited_template_parms (tree fn
, tree inherited
)
5462 = INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (inherited
));
5463 inner_parms
= copy_node (inner_parms
);
5465 = tree_cons (size_int (processing_template_decl
+ 1),
5466 inner_parms
, current_template_parms
);
5467 tree tmpl
= build_template_decl (fn
, parms
, /*member*/true);
5468 tree args
= template_parms_to_args (parms
);
5469 DECL_TEMPLATE_INFO (fn
) = build_template_info (tmpl
, args
);
5470 TREE_TYPE (tmpl
) = TREE_TYPE (fn
);
5471 DECL_TEMPLATE_RESULT (tmpl
) = fn
;
5472 DECL_ARTIFICIAL (tmpl
) = true;
5473 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
5477 /* Called when a class template TYPE is redeclared with the indicated
5478 template PARMS, e.g.:
5480 template <class T> struct S;
5481 template <class T> struct S {}; */
5484 redeclare_class_template (tree type
, tree parms
, tree cons
)
5490 if (!TYPE_TEMPLATE_INFO (type
))
5492 error ("%qT is not a template type", type
);
5496 tmpl
= TYPE_TI_TEMPLATE (type
);
5497 if (!PRIMARY_TEMPLATE_P (tmpl
))
5498 /* The type is nested in some template class. Nothing to worry
5499 about here; there are no new template parameters for the nested
5505 error ("template specifiers not specified in declaration of %qD",
5510 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
5511 tmpl_parms
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl
);
5513 if (TREE_VEC_LENGTH (parms
) != TREE_VEC_LENGTH (tmpl_parms
))
5515 error_n (input_location
, TREE_VEC_LENGTH (parms
),
5516 "redeclared with %d template parameter",
5517 "redeclared with %d template parameters",
5518 TREE_VEC_LENGTH (parms
));
5519 inform_n (DECL_SOURCE_LOCATION (tmpl
), TREE_VEC_LENGTH (tmpl_parms
),
5520 "previous declaration %qD used %d template parameter",
5521 "previous declaration %qD used %d template parameters",
5522 tmpl
, TREE_VEC_LENGTH (tmpl_parms
));
5526 for (i
= 0; i
< TREE_VEC_LENGTH (tmpl_parms
); ++i
)
5533 if (TREE_VEC_ELT (tmpl_parms
, i
) == error_mark_node
5534 || TREE_VEC_ELT (parms
, i
) == error_mark_node
)
5537 tmpl_parm
= TREE_VALUE (TREE_VEC_ELT (tmpl_parms
, i
));
5538 if (error_operand_p (tmpl_parm
))
5541 parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
5542 tmpl_default
= TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
));
5543 parm_default
= TREE_PURPOSE (TREE_VEC_ELT (parms
, i
));
5545 /* TMPL_PARM and PARM can be either TYPE_DECL, PARM_DECL, or
5547 if (TREE_CODE (tmpl_parm
) != TREE_CODE (parm
)
5548 || (TREE_CODE (tmpl_parm
) != TYPE_DECL
5549 && !same_type_p (TREE_TYPE (tmpl_parm
), TREE_TYPE (parm
)))
5550 || (TREE_CODE (tmpl_parm
) != PARM_DECL
5551 && (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (tmpl_parm
))
5552 != TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
))))
5553 || (TREE_CODE (tmpl_parm
) == PARM_DECL
5554 && (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (tmpl_parm
))
5555 != TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))))
5557 error ("template parameter %q+#D", tmpl_parm
);
5558 error ("redeclared here as %q#D", parm
);
5562 if (tmpl_default
!= NULL_TREE
&& parm_default
!= NULL_TREE
)
5564 /* We have in [temp.param]:
5566 A template-parameter may not be given default arguments
5567 by two different declarations in the same scope. */
5568 error_at (input_location
, "redefinition of default argument for %q#D", parm
);
5569 inform (DECL_SOURCE_LOCATION (tmpl_parm
),
5570 "original definition appeared here");
5574 if (parm_default
!= NULL_TREE
)
5575 /* Update the previous template parameters (which are the ones
5576 that will really count) with the new default value. */
5577 TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
)) = parm_default
;
5578 else if (tmpl_default
!= NULL_TREE
)
5579 /* Update the new parameters, too; they'll be used as the
5580 parameters for any members. */
5581 TREE_PURPOSE (TREE_VEC_ELT (parms
, i
)) = tmpl_default
;
5583 /* Give each template template parm in this redeclaration a
5584 DECL_CONTEXT of the template for which they are a parameter. */
5585 if (TREE_CODE (parm
) == TEMPLATE_DECL
)
5587 gcc_assert (DECL_CONTEXT (parm
) == NULL_TREE
);
5588 DECL_CONTEXT (parm
) = tmpl
;
5592 // Cannot redeclare a class template with a different set of constraints.
5593 if (!equivalent_constraints (get_constraints (tmpl
), cons
))
5595 error_at (input_location
, "redeclaration %q#D with different "
5596 "constraints", tmpl
);
5597 inform (DECL_SOURCE_LOCATION (tmpl
),
5598 "original declaration appeared here");
5604 /* The actual substitution part of instantiate_non_dependent_expr_sfinae,
5605 to be used when the caller has already checked
5606 (processing_template_decl
5607 && !instantiation_dependent_expression_p (expr)
5608 && potential_constant_expression (expr))
5609 and cleared processing_template_decl. */
5612 instantiate_non_dependent_expr_internal (tree expr
, tsubst_flags_t complain
)
5614 return tsubst_copy_and_build (expr
,
5617 /*in_decl=*/NULL_TREE
,
5618 /*function_p=*/false,
5619 /*integral_constant_expression_p=*/true);
5622 /* Simplify EXPR if it is a non-dependent expression. Returns the
5623 (possibly simplified) expression. */
5626 instantiate_non_dependent_expr_sfinae (tree expr
, tsubst_flags_t complain
)
5628 if (expr
== NULL_TREE
)
5631 /* If we're in a template, but EXPR isn't value dependent, simplify
5632 it. We're supposed to treat:
5634 template <typename T> void f(T[1 + 1]);
5635 template <typename T> void f(T[2]);
5637 as two declarations of the same function, for example. */
5638 if (processing_template_decl
5639 && !instantiation_dependent_expression_p (expr
)
5640 && potential_constant_expression (expr
))
5642 processing_template_decl_sentinel s
;
5643 expr
= instantiate_non_dependent_expr_internal (expr
, complain
);
5649 instantiate_non_dependent_expr (tree expr
)
5651 return instantiate_non_dependent_expr_sfinae (expr
, tf_error
);
5654 /* True iff T is a specialization of a variable template. */
5657 variable_template_specialization_p (tree t
)
5659 if (!VAR_P (t
) || !DECL_LANG_SPECIFIC (t
) || !DECL_TEMPLATE_INFO (t
))
5661 tree tmpl
= DECL_TI_TEMPLATE (t
);
5662 return variable_template_p (tmpl
);
5665 /* Return TRUE iff T is a type alias, a TEMPLATE_DECL for an alias
5666 template declaration, or a TYPE_DECL for an alias declaration. */
5669 alias_type_or_template_p (tree t
)
5673 return ((TREE_CODE (t
) == TYPE_DECL
&& TYPE_DECL_ALIAS_P (t
))
5676 && TYPE_DECL_ALIAS_P (TYPE_NAME (t
)))
5677 || DECL_ALIAS_TEMPLATE_P (t
));
5680 /* Return TRUE iff T is a specialization of an alias template. */
5683 alias_template_specialization_p (const_tree t
)
5685 /* It's an alias template specialization if it's an alias and its
5686 TYPE_NAME is a specialization of a primary template. */
5687 if (TYPE_ALIAS_P (t
))
5689 tree name
= TYPE_NAME (t
);
5690 if (DECL_LANG_SPECIFIC (name
))
5691 if (tree ti
= DECL_TEMPLATE_INFO (name
))
5693 tree tmpl
= TI_TEMPLATE (ti
);
5694 return PRIMARY_TEMPLATE_P (tmpl
);
5700 /* An alias template is complex from a SFINAE perspective if a template-id
5701 using that alias can be ill-formed when the expansion is not, as with
5702 the void_t template. We determine this by checking whether the
5703 expansion for the alias template uses all its template parameters. */
5705 struct uses_all_template_parms_data
5712 uses_all_template_parms_r (tree t
, void *data_
)
5714 struct uses_all_template_parms_data
&data
5715 = *(struct uses_all_template_parms_data
*)data_
;
5716 tree idx
= get_template_parm_index (t
);
5718 if (TEMPLATE_PARM_LEVEL (idx
) == data
.level
)
5719 data
.seen
[TEMPLATE_PARM_IDX (idx
)] = true;
5724 complex_alias_template_p (const_tree tmpl
)
5726 struct uses_all_template_parms_data data
;
5727 tree pat
= DECL_ORIGINAL_TYPE (DECL_TEMPLATE_RESULT (tmpl
));
5728 tree parms
= DECL_TEMPLATE_PARMS (tmpl
);
5729 data
.level
= TMPL_PARMS_DEPTH (parms
);
5730 int len
= TREE_VEC_LENGTH (INNERMOST_TEMPLATE_PARMS (parms
));
5731 data
.seen
= XALLOCAVEC (bool, len
);
5732 for (int i
= 0; i
< len
; ++i
)
5733 data
.seen
[i
] = false;
5735 for_each_template_parm (pat
, uses_all_template_parms_r
, &data
, NULL
, true);
5736 for (int i
= 0; i
< len
; ++i
)
5742 /* Return TRUE iff T is a specialization of a complex alias template with
5743 dependent template-arguments. */
5746 dependent_alias_template_spec_p (const_tree t
)
5748 return (alias_template_specialization_p (t
)
5749 && TEMPLATE_DECL_COMPLEX_ALIAS_P (DECL_TI_TEMPLATE (TYPE_NAME (t
)))
5750 && (any_dependent_template_arguments_p
5751 (INNERMOST_TEMPLATE_ARGS (TYPE_TI_ARGS (t
)))));
5754 /* Return the number of innermost template parameters in TMPL. */
5757 num_innermost_template_parms (tree tmpl
)
5759 tree parms
= INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (tmpl
));
5760 return TREE_VEC_LENGTH (parms
);
5763 /* Return either TMPL or another template that it is equivalent to under DR
5764 1286: An alias that just changes the name of a template is equivalent to
5765 the other template. */
5768 get_underlying_template (tree tmpl
)
5770 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
);
5771 while (DECL_ALIAS_TEMPLATE_P (tmpl
))
5773 tree result
= DECL_ORIGINAL_TYPE (DECL_TEMPLATE_RESULT (tmpl
));
5774 if (TYPE_TEMPLATE_INFO (result
))
5776 tree sub
= TYPE_TI_TEMPLATE (result
);
5777 if (PRIMARY_TEMPLATE_P (sub
)
5778 && (num_innermost_template_parms (tmpl
)
5779 == num_innermost_template_parms (sub
)))
5781 tree alias_args
= INNERMOST_TEMPLATE_ARGS
5782 (template_parms_to_args (DECL_TEMPLATE_PARMS (tmpl
)));
5783 if (!comp_template_args (TYPE_TI_ARGS (result
), alias_args
))
5785 /* The alias type is equivalent to the pattern of the
5786 underlying template, so strip the alias. */
5796 /* Subroutine of convert_nontype_argument. Converts EXPR to TYPE, which
5797 must be a function or a pointer-to-function type, as specified
5798 in [temp.arg.nontype]: disambiguate EXPR if it is an overload set,
5799 and check that the resulting function has external linkage. */
5802 convert_nontype_argument_function (tree type
, tree expr
,
5803 tsubst_flags_t complain
)
5807 linkage_kind linkage
;
5809 fn
= instantiate_type (type
, fns
, tf_none
);
5810 if (fn
== error_mark_node
)
5811 return error_mark_node
;
5814 if (TREE_CODE (fn_no_ptr
) == ADDR_EXPR
)
5815 fn_no_ptr
= TREE_OPERAND (fn_no_ptr
, 0);
5816 if (BASELINK_P (fn_no_ptr
))
5817 fn_no_ptr
= BASELINK_FUNCTIONS (fn_no_ptr
);
5819 /* [temp.arg.nontype]/1
5821 A template-argument for a non-type, non-template template-parameter
5824 -- the address of an object or function with external [C++11: or
5825 internal] linkage. */
5827 if (TREE_CODE (fn_no_ptr
) != FUNCTION_DECL
)
5829 if (complain
& tf_error
)
5831 error ("%qE is not a valid template argument for type %qT",
5833 if (TYPE_PTR_P (type
))
5834 error ("it must be the address of a function with "
5835 "external linkage");
5837 error ("it must be the name of a function with "
5838 "external linkage");
5843 linkage
= decl_linkage (fn_no_ptr
);
5844 if (cxx_dialect
>= cxx11
? linkage
== lk_none
: linkage
!= lk_external
)
5846 if (complain
& tf_error
)
5848 if (cxx_dialect
>= cxx11
)
5849 error ("%qE is not a valid template argument for type %qT "
5850 "because %qD has no linkage",
5851 expr
, type
, fn_no_ptr
);
5853 error ("%qE is not a valid template argument for type %qT "
5854 "because %qD does not have external linkage",
5855 expr
, type
, fn_no_ptr
);
5863 /* Subroutine of convert_nontype_argument.
5864 Check if EXPR of type TYPE is a valid pointer-to-member constant.
5865 Emit an error otherwise. */
5868 check_valid_ptrmem_cst_expr (tree type
, tree expr
,
5869 tsubst_flags_t complain
)
5872 if (expr
&& (null_ptr_cst_p (expr
) || TREE_CODE (expr
) == PTRMEM_CST
))
5874 if (cxx_dialect
>= cxx11
&& null_member_pointer_value_p (expr
))
5876 if (processing_template_decl
5877 && TREE_CODE (expr
) == ADDR_EXPR
5878 && TREE_CODE (TREE_OPERAND (expr
, 0)) == OFFSET_REF
)
5880 if (complain
& tf_error
)
5882 error ("%qE is not a valid template argument for type %qT",
5884 error ("it must be a pointer-to-member of the form %<&X::Y%>");
5889 /* Returns TRUE iff the address of OP is value-dependent.
5891 14.6.2.4 [temp.dep.temp]:
5892 A non-integral non-type template-argument is dependent if its type is
5893 dependent or it has either of the following forms
5896 and contains a nested-name-specifier which specifies a class-name that
5897 names a dependent type.
5899 We generalize this to just say that the address of a member of a
5900 dependent class is value-dependent; the above doesn't cover the
5901 address of a static data member named with an unqualified-id. */
5904 has_value_dependent_address (tree op
)
5906 /* We could use get_inner_reference here, but there's no need;
5907 this is only relevant for template non-type arguments, which
5908 can only be expressed as &id-expression. */
5911 tree ctx
= CP_DECL_CONTEXT (op
);
5912 if (TYPE_P (ctx
) && dependent_type_p (ctx
))
5919 /* The next set of functions are used for providing helpful explanatory
5920 diagnostics for failed overload resolution. Their messages should be
5921 indented by two spaces for consistency with the messages in
5925 unify_success (bool /*explain_p*/)
5931 unify_parameter_deduction_failure (bool explain_p
, tree parm
)
5934 inform (input_location
,
5935 " couldn't deduce template parameter %qD", parm
);
5940 unify_invalid (bool /*explain_p*/)
5946 unify_cv_qual_mismatch (bool explain_p
, tree parm
, tree arg
)
5949 inform (input_location
,
5950 " types %qT and %qT have incompatible cv-qualifiers",
5956 unify_type_mismatch (bool explain_p
, tree parm
, tree arg
)
5959 inform (input_location
, " mismatched types %qT and %qT", parm
, arg
);
5964 unify_parameter_pack_mismatch (bool explain_p
, tree parm
, tree arg
)
5967 inform (input_location
,
5968 " template parameter %qD is not a parameter pack, but "
5975 unify_ptrmem_cst_mismatch (bool explain_p
, tree parm
, tree arg
)
5978 inform (input_location
,
5979 " template argument %qE does not match "
5980 "pointer-to-member constant %qE",
5986 unify_expression_unequal (bool explain_p
, tree parm
, tree arg
)
5989 inform (input_location
, " %qE is not equivalent to %qE", parm
, arg
);
5994 unify_parameter_pack_inconsistent (bool explain_p
, tree old_arg
, tree new_arg
)
5997 inform (input_location
,
5998 " inconsistent parameter pack deduction with %qT and %qT",
6004 unify_inconsistency (bool explain_p
, tree parm
, tree first
, tree second
)
6009 inform (input_location
,
6010 " deduced conflicting types for parameter %qT (%qT and %qT)",
6011 parm
, first
, second
);
6013 inform (input_location
,
6014 " deduced conflicting values for non-type parameter "
6015 "%qE (%qE and %qE)", parm
, first
, second
);
6021 unify_vla_arg (bool explain_p
, tree arg
)
6024 inform (input_location
,
6025 " variable-sized array type %qT is not "
6026 "a valid template argument",
6032 unify_method_type_error (bool explain_p
, tree arg
)
6035 inform (input_location
,
6036 " member function type %qT is not a valid template argument",
6042 unify_arity (bool explain_p
, int have
, int wanted
, bool least_p
= false)
6047 inform_n (input_location
, wanted
,
6048 " candidate expects at least %d argument, %d provided",
6049 " candidate expects at least %d arguments, %d provided",
6052 inform_n (input_location
, wanted
,
6053 " candidate expects %d argument, %d provided",
6054 " candidate expects %d arguments, %d provided",
6061 unify_too_many_arguments (bool explain_p
, int have
, int wanted
)
6063 return unify_arity (explain_p
, have
, wanted
);
6067 unify_too_few_arguments (bool explain_p
, int have
, int wanted
,
6068 bool least_p
= false)
6070 return unify_arity (explain_p
, have
, wanted
, least_p
);
6074 unify_arg_conversion (bool explain_p
, tree to_type
,
6075 tree from_type
, tree arg
)
6078 inform (EXPR_LOC_OR_LOC (arg
, input_location
),
6079 " cannot convert %qE (type %qT) to type %qT",
6080 arg
, from_type
, to_type
);
6085 unify_no_common_base (bool explain_p
, enum template_base_result r
,
6086 tree parm
, tree arg
)
6091 case tbr_ambiguous_baseclass
:
6092 inform (input_location
, " %qT is an ambiguous base class of %qT",
6096 inform (input_location
, " %qT is not derived from %qT", arg
, parm
);
6103 unify_inconsistent_template_template_parameters (bool explain_p
)
6106 inform (input_location
,
6107 " template parameters of a template template argument are "
6108 "inconsistent with other deduced template arguments");
6113 unify_template_deduction_failure (bool explain_p
, tree parm
, tree arg
)
6116 inform (input_location
,
6117 " can't deduce a template for %qT from non-template type %qT",
6123 unify_template_argument_mismatch (bool explain_p
, tree parm
, tree arg
)
6126 inform (input_location
,
6127 " template argument %qE does not match %qD", arg
, parm
);
6132 unify_overload_resolution_failure (bool explain_p
, tree arg
)
6135 inform (input_location
,
6136 " could not resolve address from overloaded function %qE",
6141 /* Attempt to convert the non-type template parameter EXPR to the
6142 indicated TYPE. If the conversion is successful, return the
6143 converted value. If the conversion is unsuccessful, return
6144 NULL_TREE if we issued an error message, or error_mark_node if we
6145 did not. We issue error messages for out-and-out bad template
6146 parameters, but not simply because the conversion failed, since we
6147 might be just trying to do argument deduction. Both TYPE and EXPR
6148 must be non-dependent.
6150 The conversion follows the special rules described in
6151 [temp.arg.nontype], and it is much more strict than an implicit
6154 This function is called twice for each template argument (see
6155 lookup_template_class for a more accurate description of this
6156 problem). This means that we need to handle expressions which
6157 are not valid in a C++ source, but can be created from the
6158 first call (for instance, casts to perform conversions). These
6159 hacks can go away after we fix the double coercion problem. */
6162 convert_nontype_argument (tree type
, tree expr
, tsubst_flags_t complain
)
6166 /* Detect immediately string literals as invalid non-type argument.
6167 This special-case is not needed for correctness (we would easily
6168 catch this later), but only to provide better diagnostic for this
6169 common user mistake. As suggested by DR 100, we do not mention
6170 linkage issues in the diagnostic as this is not the point. */
6171 /* FIXME we're making this OK. */
6172 if (TREE_CODE (expr
) == STRING_CST
)
6174 if (complain
& tf_error
)
6175 error ("%qE is not a valid template argument for type %qT "
6176 "because string literals can never be used in this context",
6181 /* Add the ADDR_EXPR now for the benefit of
6182 value_dependent_expression_p. */
6183 if (TYPE_PTROBV_P (type
)
6184 && TREE_CODE (TREE_TYPE (expr
)) == ARRAY_TYPE
)
6186 expr
= decay_conversion (expr
, complain
);
6187 if (expr
== error_mark_node
)
6188 return error_mark_node
;
6191 /* If we are in a template, EXPR may be non-dependent, but still
6192 have a syntactic, rather than semantic, form. For example, EXPR
6193 might be a SCOPE_REF, rather than the VAR_DECL to which the
6194 SCOPE_REF refers. Preserving the qualifying scope is necessary
6195 so that access checking can be performed when the template is
6196 instantiated -- but here we need the resolved form so that we can
6197 convert the argument. */
6198 bool non_dep
= false;
6199 if (TYPE_REF_OBJ_P (type
)
6200 && has_value_dependent_address (expr
))
6201 /* If we want the address and it's value-dependent, don't fold. */;
6202 else if (!type_unknown_p (expr
)
6203 && processing_template_decl
6204 && !instantiation_dependent_expression_p (expr
)
6205 && potential_constant_expression (expr
))
6207 if (error_operand_p (expr
))
6208 return error_mark_node
;
6209 expr_type
= TREE_TYPE (expr
);
6210 if (TREE_CODE (type
) == REFERENCE_TYPE
)
6211 expr
= mark_lvalue_use (expr
);
6213 expr
= mark_rvalue_use (expr
);
6215 /* If the argument is non-dependent, perform any conversions in
6216 non-dependent context as well. */
6217 processing_template_decl_sentinel
s (non_dep
);
6219 expr
= instantiate_non_dependent_expr_internal (expr
, complain
);
6221 /* 14.3.2/5: The null pointer{,-to-member} conversion is applied
6222 to a non-type argument of "nullptr". */
6223 if (expr
== nullptr_node
&& TYPE_PTR_OR_PTRMEM_P (type
))
6224 expr
= convert (type
, expr
);
6226 /* In C++11, integral or enumeration non-type template arguments can be
6227 arbitrary constant expressions. Pointer and pointer to
6228 member arguments can be general constant expressions that evaluate
6229 to a null value, but otherwise still need to be of a specific form. */
6230 if (cxx_dialect
>= cxx11
)
6232 if (TREE_CODE (expr
) == PTRMEM_CST
)
6233 /* A PTRMEM_CST is already constant, and a valid template
6234 argument for a parameter of pointer to member type, we just want
6235 to leave it in that form rather than lower it to a
6237 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
6238 expr
= maybe_constant_value (expr
);
6239 else if (cxx_dialect
>= cxx1z
)
6241 if (TREE_CODE (type
) != REFERENCE_TYPE
)
6242 expr
= maybe_constant_value (expr
);
6243 else if (REFERENCE_REF_P (expr
))
6245 expr
= TREE_OPERAND (expr
, 0);
6246 expr
= maybe_constant_value (expr
);
6247 expr
= convert_from_reference (expr
);
6250 else if (TYPE_PTR_OR_PTRMEM_P (type
))
6252 tree folded
= maybe_constant_value (expr
);
6253 if (TYPE_PTR_P (type
) ? integer_zerop (folded
)
6254 : null_member_pointer_value_p (folded
))
6259 /* HACK: Due to double coercion, we can get a
6260 NOP_EXPR<REFERENCE_TYPE>(ADDR_EXPR<POINTER_TYPE> (arg)) here,
6261 which is the tree that we built on the first call (see
6262 below when coercing to reference to object or to reference to
6263 function). We just strip everything and get to the arg.
6264 See g++.old-deja/g++.oliva/template4.C and g++.dg/template/nontype9.C
6266 if (TYPE_REF_OBJ_P (type
) || TYPE_REFFN_P (type
))
6268 tree probe_type
, probe
= expr
;
6269 if (REFERENCE_REF_P (probe
))
6270 probe
= TREE_OPERAND (probe
, 0);
6271 probe_type
= TREE_TYPE (probe
);
6272 if (TREE_CODE (probe
) == NOP_EXPR
)
6274 /* ??? Maybe we could use convert_from_reference here, but we
6275 would need to relax its constraints because the NOP_EXPR
6276 could actually change the type to something more cv-qualified,
6277 and this is not folded by convert_from_reference. */
6278 tree addr
= TREE_OPERAND (probe
, 0);
6279 if (TREE_CODE (probe_type
) == REFERENCE_TYPE
6280 && TREE_CODE (addr
) == ADDR_EXPR
6281 && TYPE_PTR_P (TREE_TYPE (addr
))
6282 && (same_type_ignoring_top_level_qualifiers_p
6283 (TREE_TYPE (probe_type
),
6284 TREE_TYPE (TREE_TYPE (addr
)))))
6286 expr
= TREE_OPERAND (addr
, 0);
6287 expr_type
= TREE_TYPE (probe_type
);
6292 /* We could also generate a NOP_EXPR(ADDR_EXPR()) when the
6293 parameter is a pointer to object, through decay and
6294 qualification conversion. Let's strip everything. */
6295 else if (TREE_CODE (expr
) == NOP_EXPR
&& TYPE_PTROBV_P (type
))
6299 if (TREE_CODE (probe
) == ADDR_EXPR
6300 && TYPE_PTR_P (TREE_TYPE (probe
)))
6302 /* Skip the ADDR_EXPR only if it is part of the decay for
6303 an array. Otherwise, it is part of the original argument
6304 in the source code. */
6305 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (probe
, 0))) == ARRAY_TYPE
)
6306 probe
= TREE_OPERAND (probe
, 0);
6308 expr_type
= TREE_TYPE (expr
);
6312 /* [temp.arg.nontype]/5, bullet 1
6314 For a non-type template-parameter of integral or enumeration type,
6315 integral promotions (_conv.prom_) and integral conversions
6316 (_conv.integral_) are applied. */
6317 if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
6319 tree t
= build_integral_nontype_arg_conv (type
, expr
, complain
);
6320 t
= maybe_constant_value (t
);
6321 if (t
!= error_mark_node
)
6324 if (!same_type_ignoring_top_level_qualifiers_p (type
, TREE_TYPE (expr
)))
6325 return error_mark_node
;
6327 /* Notice that there are constant expressions like '4 % 0' which
6328 do not fold into integer constants. */
6329 if (TREE_CODE (expr
) != INTEGER_CST
)
6331 if (complain
& tf_error
)
6333 int errs
= errorcount
, warns
= warningcount
+ werrorcount
;
6334 if (processing_template_decl
6335 && !require_potential_constant_expression (expr
))
6337 expr
= cxx_constant_value (expr
);
6338 if (errorcount
> errs
|| warningcount
+ werrorcount
> warns
)
6339 inform (EXPR_LOC_OR_LOC (expr
, input_location
),
6340 "in template argument for type %qT ", type
);
6341 if (expr
== error_mark_node
)
6343 /* else cxx_constant_value complained but gave us
6344 a real constant, so go ahead. */
6345 gcc_assert (TREE_CODE (expr
) == INTEGER_CST
);
6351 /* Avoid typedef problems. */
6352 if (TREE_TYPE (expr
) != type
)
6353 expr
= fold_convert (type
, expr
);
6355 /* [temp.arg.nontype]/5, bullet 2
6357 For a non-type template-parameter of type pointer to object,
6358 qualification conversions (_conv.qual_) and the array-to-pointer
6359 conversion (_conv.array_) are applied. */
6360 else if (TYPE_PTROBV_P (type
))
6362 /* [temp.arg.nontype]/1 (TC1 version, DR 49):
6364 A template-argument for a non-type, non-template template-parameter
6365 shall be one of: [...]
6367 -- the name of a non-type template-parameter;
6368 -- the address of an object or function with external linkage, [...]
6369 expressed as "& id-expression" where the & is optional if the name
6370 refers to a function or array, or if the corresponding
6371 template-parameter is a reference.
6373 Here, we do not care about functions, as they are invalid anyway
6374 for a parameter of type pointer-to-object. */
6376 if (DECL_P (expr
) && DECL_TEMPLATE_PARM_P (expr
))
6377 /* Non-type template parameters are OK. */
6379 else if (cxx_dialect
>= cxx11
&& integer_zerop (expr
))
6380 /* Null pointer values are OK in C++11. */;
6381 else if (TREE_CODE (expr
) != ADDR_EXPR
6382 && TREE_CODE (expr_type
) != ARRAY_TYPE
)
6386 if (complain
& tf_error
)
6387 error ("%qD is not a valid template argument "
6388 "because %qD is a variable, not the address of "
6389 "a variable", expr
, expr
);
6392 if (POINTER_TYPE_P (expr_type
))
6394 if (complain
& tf_error
)
6395 error ("%qE is not a valid template argument for %qT "
6396 "because it is not the address of a variable",
6400 /* Other values, like integer constants, might be valid
6401 non-type arguments of some other type. */
6402 return error_mark_node
;
6408 decl
= ((TREE_CODE (expr
) == ADDR_EXPR
)
6409 ? TREE_OPERAND (expr
, 0) : expr
);
6412 if (complain
& tf_error
)
6413 error ("%qE is not a valid template argument of type %qT "
6414 "because %qE is not a variable", expr
, type
, decl
);
6417 else if (cxx_dialect
< cxx11
&& !DECL_EXTERNAL_LINKAGE_P (decl
))
6419 if (complain
& tf_error
)
6420 error ("%qE is not a valid template argument of type %qT "
6421 "because %qD does not have external linkage",
6425 else if (cxx_dialect
>= cxx11
&& decl_linkage (decl
) == lk_none
)
6427 if (complain
& tf_error
)
6428 error ("%qE is not a valid template argument of type %qT "
6429 "because %qD has no linkage", expr
, type
, decl
);
6434 expr
= decay_conversion (expr
, complain
);
6435 if (expr
== error_mark_node
)
6436 return error_mark_node
;
6438 expr
= perform_qualification_conversions (type
, expr
);
6439 if (expr
== error_mark_node
)
6440 return error_mark_node
;
6442 /* [temp.arg.nontype]/5, bullet 3
6444 For a non-type template-parameter of type reference to object, no
6445 conversions apply. The type referred to by the reference may be more
6446 cv-qualified than the (otherwise identical) type of the
6447 template-argument. The template-parameter is bound directly to the
6448 template-argument, which must be an lvalue. */
6449 else if (TYPE_REF_OBJ_P (type
))
6451 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type
),
6453 return error_mark_node
;
6455 if (!at_least_as_qualified_p (TREE_TYPE (type
), expr_type
))
6457 if (complain
& tf_error
)
6458 error ("%qE is not a valid template argument for type %qT "
6459 "because of conflicts in cv-qualification", expr
, type
);
6463 if (!real_lvalue_p (expr
))
6465 if (complain
& tf_error
)
6466 error ("%qE is not a valid template argument for type %qT "
6467 "because it is not an lvalue", expr
, type
);
6471 /* [temp.arg.nontype]/1
6473 A template-argument for a non-type, non-template template-parameter
6474 shall be one of: [...]
6476 -- the address of an object or function with external linkage. */
6477 if (INDIRECT_REF_P (expr
)
6478 && TYPE_REF_OBJ_P (TREE_TYPE (TREE_OPERAND (expr
, 0))))
6480 expr
= TREE_OPERAND (expr
, 0);
6483 if (complain
& tf_error
)
6484 error ("%q#D is not a valid template argument for type %qT "
6485 "because a reference variable does not have a constant "
6486 "address", expr
, type
);
6493 if (complain
& tf_error
)
6494 error ("%qE is not a valid template argument for type %qT "
6495 "because it is not an object with linkage",
6500 /* DR 1155 allows internal linkage in C++11 and up. */
6501 linkage_kind linkage
= decl_linkage (expr
);
6502 if (linkage
< (cxx_dialect
>= cxx11
? lk_internal
: lk_external
))
6504 if (complain
& tf_error
)
6505 error ("%qE is not a valid template argument for type %qT "
6506 "because object %qD does not have linkage",
6511 expr
= build_nop (type
, build_address (expr
));
6513 /* [temp.arg.nontype]/5, bullet 4
6515 For a non-type template-parameter of type pointer to function, only
6516 the function-to-pointer conversion (_conv.func_) is applied. If the
6517 template-argument represents a set of overloaded functions (or a
6518 pointer to such), the matching function is selected from the set
6520 else if (TYPE_PTRFN_P (type
))
6522 /* If the argument is a template-id, we might not have enough
6523 context information to decay the pointer. */
6524 if (!type_unknown_p (expr_type
))
6526 expr
= decay_conversion (expr
, complain
);
6527 if (expr
== error_mark_node
)
6528 return error_mark_node
;
6531 if (cxx_dialect
>= cxx11
&& integer_zerop (expr
))
6532 /* Null pointer values are OK in C++11. */
6533 return perform_qualification_conversions (type
, expr
);
6535 expr
= convert_nontype_argument_function (type
, expr
, complain
);
6536 if (!expr
|| expr
== error_mark_node
)
6539 /* [temp.arg.nontype]/5, bullet 5
6541 For a non-type template-parameter of type reference to function, no
6542 conversions apply. If the template-argument represents a set of
6543 overloaded functions, the matching function is selected from the set
6545 else if (TYPE_REFFN_P (type
))
6547 if (TREE_CODE (expr
) == ADDR_EXPR
)
6549 if (complain
& tf_error
)
6551 error ("%qE is not a valid template argument for type %qT "
6552 "because it is a pointer", expr
, type
);
6553 inform (input_location
, "try using %qE instead",
6554 TREE_OPERAND (expr
, 0));
6559 expr
= convert_nontype_argument_function (type
, expr
, complain
);
6560 if (!expr
|| expr
== error_mark_node
)
6563 expr
= build_nop (type
, build_address (expr
));
6565 /* [temp.arg.nontype]/5, bullet 6
6567 For a non-type template-parameter of type pointer to member function,
6568 no conversions apply. If the template-argument represents a set of
6569 overloaded member functions, the matching member function is selected
6570 from the set (_over.over_). */
6571 else if (TYPE_PTRMEMFUNC_P (type
))
6573 expr
= instantiate_type (type
, expr
, tf_none
);
6574 if (expr
== error_mark_node
)
6575 return error_mark_node
;
6577 /* [temp.arg.nontype] bullet 1 says the pointer to member
6578 expression must be a pointer-to-member constant. */
6579 if (!check_valid_ptrmem_cst_expr (type
, expr
, complain
))
6580 return error_mark_node
;
6582 /* There is no way to disable standard conversions in
6583 resolve_address_of_overloaded_function (called by
6584 instantiate_type). It is possible that the call succeeded by
6585 converting &B::I to &D::I (where B is a base of D), so we need
6586 to reject this conversion here.
6588 Actually, even if there was a way to disable standard conversions,
6589 it would still be better to reject them here so that we can
6590 provide a superior diagnostic. */
6591 if (!same_type_p (TREE_TYPE (expr
), type
))
6593 if (complain
& tf_error
)
6595 error ("%qE is not a valid template argument for type %qT "
6596 "because it is of type %qT", expr
, type
,
6598 /* If we are just one standard conversion off, explain. */
6599 if (can_convert_standard (type
, TREE_TYPE (expr
), complain
))
6600 inform (input_location
,
6601 "standard conversions are not allowed in this context");
6606 /* [temp.arg.nontype]/5, bullet 7
6608 For a non-type template-parameter of type pointer to data member,
6609 qualification conversions (_conv.qual_) are applied. */
6610 else if (TYPE_PTRDATAMEM_P (type
))
6612 /* [temp.arg.nontype] bullet 1 says the pointer to member
6613 expression must be a pointer-to-member constant. */
6614 if (!check_valid_ptrmem_cst_expr (type
, expr
, complain
))
6615 return error_mark_node
;
6617 expr
= perform_qualification_conversions (type
, expr
);
6618 if (expr
== error_mark_node
)
6621 else if (NULLPTR_TYPE_P (type
))
6623 if (expr
!= nullptr_node
)
6625 if (complain
& tf_error
)
6626 error ("%qE is not a valid template argument for type %qT "
6627 "because it is of type %qT", expr
, type
, TREE_TYPE (expr
));
6632 /* A template non-type parameter must be one of the above. */
6636 /* Sanity check: did we actually convert the argument to the
6638 gcc_assert (same_type_ignoring_top_level_qualifiers_p
6639 (type
, TREE_TYPE (expr
)));
6640 return convert_from_reference (expr
);
6643 /* Subroutine of coerce_template_template_parms, which returns 1 if
6644 PARM_PARM and ARG_PARM match using the rule for the template
6645 parameters of template template parameters. Both PARM and ARG are
6646 template parameters; the rest of the arguments are the same as for
6647 coerce_template_template_parms.
6650 coerce_template_template_parm (tree parm
,
6652 tsubst_flags_t complain
,
6656 if (arg
== NULL_TREE
|| error_operand_p (arg
)
6657 || parm
== NULL_TREE
|| error_operand_p (parm
))
6660 if (TREE_CODE (arg
) != TREE_CODE (parm
))
6663 switch (TREE_CODE (parm
))
6666 /* We encounter instantiations of templates like
6667 template <template <template <class> class> class TT>
6670 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
6671 tree argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
6673 if (!coerce_template_template_parms
6674 (parmparm
, argparm
, complain
, in_decl
, outer_args
))
6680 if (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (arg
))
6681 && !TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
)))
6682 /* Argument is a parameter pack but parameter is not. */
6687 /* The tsubst call is used to handle cases such as
6689 template <int> class C {};
6690 template <class T, template <T> class TT> class D {};
6693 i.e. the parameter list of TT depends on earlier parameters. */
6694 if (!uses_template_parms (TREE_TYPE (arg
)))
6696 tree t
= tsubst (TREE_TYPE (parm
), outer_args
, complain
, in_decl
);
6697 if (!uses_template_parms (t
)
6698 && !same_type_p (t
, TREE_TYPE (arg
)))
6702 if (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (arg
))
6703 && !TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))
6704 /* Argument is a parameter pack but parameter is not. */
6717 /* Return 1 if PARM_PARMS and ARG_PARMS matches using rule for
6718 template template parameters. Both PARM_PARMS and ARG_PARMS are
6719 vectors of TREE_LIST nodes containing TYPE_DECL, TEMPLATE_DECL
6722 Consider the example:
6723 template <class T> class A;
6724 template<template <class U> class TT> class B;
6726 For B<A>, PARM_PARMS are the parameters to TT, while ARG_PARMS are
6727 the parameters to A, and OUTER_ARGS contains A. */
6730 coerce_template_template_parms (tree parm_parms
,
6732 tsubst_flags_t complain
,
6736 int nparms
, nargs
, i
;
6740 gcc_assert (TREE_CODE (parm_parms
) == TREE_VEC
);
6741 gcc_assert (TREE_CODE (arg_parms
) == TREE_VEC
);
6743 nparms
= TREE_VEC_LENGTH (parm_parms
);
6744 nargs
= TREE_VEC_LENGTH (arg_parms
);
6746 /* Determine whether we have a parameter pack at the end of the
6747 template template parameter's template parameter list. */
6748 if (TREE_VEC_ELT (parm_parms
, nparms
- 1) != error_mark_node
)
6750 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, nparms
- 1));
6752 if (error_operand_p (parm
))
6755 switch (TREE_CODE (parm
))
6759 if (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
)))
6764 if (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))
6774 && !(variadic_p
&& nargs
>= nparms
- 1))
6777 /* Check all of the template parameters except the parameter pack at
6778 the end (if any). */
6779 for (i
= 0; i
< nparms
- variadic_p
; ++i
)
6781 if (TREE_VEC_ELT (parm_parms
, i
) == error_mark_node
6782 || TREE_VEC_ELT (arg_parms
, i
) == error_mark_node
)
6785 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
6786 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
6788 if (!coerce_template_template_parm (parm
, arg
, complain
, in_decl
,
6796 /* Check each of the template parameters in the template
6797 argument against the template parameter pack at the end of
6798 the template template parameter. */
6799 if (TREE_VEC_ELT (parm_parms
, i
) == error_mark_node
)
6802 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
6804 for (; i
< nargs
; ++i
)
6806 if (TREE_VEC_ELT (arg_parms
, i
) == error_mark_node
)
6809 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
6811 if (!coerce_template_template_parm (parm
, arg
, complain
, in_decl
,
6820 /* Verifies that the deduced template arguments (in TARGS) for the
6821 template template parameters (in TPARMS) represent valid bindings,
6822 by comparing the template parameter list of each template argument
6823 to the template parameter list of its corresponding template
6824 template parameter, in accordance with DR150. This
6825 routine can only be called after all template arguments have been
6826 deduced. It will return TRUE if all of the template template
6827 parameter bindings are okay, FALSE otherwise. */
6829 template_template_parm_bindings_ok_p (tree tparms
, tree targs
)
6831 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
6834 /* We're dealing with template parms in this process. */
6835 ++processing_template_decl
;
6837 targs
= INNERMOST_TEMPLATE_ARGS (targs
);
6839 for (i
= 0; i
< ntparms
; ++i
)
6841 tree tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
6842 tree targ
= TREE_VEC_ELT (targs
, i
);
6844 if (TREE_CODE (tparm
) == TEMPLATE_DECL
&& targ
)
6846 tree packed_args
= NULL_TREE
;
6849 if (ARGUMENT_PACK_P (targ
))
6851 /* Look inside the argument pack. */
6852 packed_args
= ARGUMENT_PACK_ARGS (targ
);
6853 len
= TREE_VEC_LENGTH (packed_args
);
6856 for (idx
= 0; idx
< len
; ++idx
)
6858 tree targ_parms
= NULL_TREE
;
6861 /* Extract the next argument from the argument
6863 targ
= TREE_VEC_ELT (packed_args
, idx
);
6865 if (PACK_EXPANSION_P (targ
))
6866 /* Look at the pattern of the pack expansion. */
6867 targ
= PACK_EXPANSION_PATTERN (targ
);
6869 /* Extract the template parameters from the template
6871 if (TREE_CODE (targ
) == TEMPLATE_DECL
)
6872 targ_parms
= DECL_INNERMOST_TEMPLATE_PARMS (targ
);
6873 else if (TREE_CODE (targ
) == TEMPLATE_TEMPLATE_PARM
)
6874 targ_parms
= DECL_INNERMOST_TEMPLATE_PARMS (TYPE_NAME (targ
));
6876 /* Verify that we can coerce the template template
6877 parameters from the template argument to the template
6878 parameter. This requires an exact match. */
6880 && !coerce_template_template_parms
6881 (DECL_INNERMOST_TEMPLATE_PARMS (tparm
),
6896 --processing_template_decl
;
6900 /* Since type attributes aren't mangled, we need to strip them from
6901 template type arguments. */
6904 canonicalize_type_argument (tree arg
, tsubst_flags_t complain
)
6906 if (!arg
|| arg
== error_mark_node
|| arg
== TYPE_CANONICAL (arg
))
6908 bool removed_attributes
= false;
6909 tree canon
= strip_typedefs (arg
, &removed_attributes
);
6910 if (removed_attributes
6911 && (complain
& tf_warning
))
6912 warning (0, "ignoring attributes on template argument %qT", arg
);
6916 // A template declaration can be substituted for a constrained
6917 // template template parameter only when the argument is more
6918 // constrained than the parameter.
6920 is_compatible_template_arg (tree parm
, tree arg
)
6922 tree parm_cons
= get_constraints (parm
);
6924 /* For now, allow constrained template template arguments
6925 and unconstrained template template parameters. */
6926 if (parm_cons
== NULL_TREE
)
6929 tree arg_cons
= get_constraints (arg
);
6931 // If the template parameter is constrained, we need to rewrite its
6932 // constraints in terms of the ARG's template parameters. This ensures
6933 // that all of the template parameter types will have the same depth.
6935 // Note that this is only valid when coerce_template_template_parm is
6936 // true for the innermost template parameters of PARM and ARG. In other
6937 // words, because coercion is successful, this conversion will be valid.
6940 tree args
= template_parms_to_args (DECL_TEMPLATE_PARMS (arg
));
6941 parm_cons
= tsubst_constraint_info (parm_cons
,
6942 INNERMOST_TEMPLATE_ARGS (args
),
6943 tf_none
, NULL_TREE
);
6944 if (parm_cons
== error_mark_node
)
6948 return subsumes (parm_cons
, arg_cons
);
6951 // Convert a placeholder argument into a binding to the original
6952 // parameter. The original parameter is saved as the TREE_TYPE of
6955 convert_wildcard_argument (tree parm
, tree arg
)
6957 TREE_TYPE (arg
) = parm
;
6961 /* Convert the indicated template ARG as necessary to match the
6962 indicated template PARM. Returns the converted ARG, or
6963 error_mark_node if the conversion was unsuccessful. Error and
6964 warning messages are issued under control of COMPLAIN. This
6965 conversion is for the Ith parameter in the parameter list. ARGS is
6966 the full set of template arguments deduced so far. */
6969 convert_template_argument (tree parm
,
6972 tsubst_flags_t complain
,
6978 int is_type
, requires_type
, is_tmpl_type
, requires_tmpl_type
;
6980 if (parm
== error_mark_node
)
6981 return error_mark_node
;
6983 /* Trivially convert placeholders. */
6984 if (TREE_CODE (arg
) == WILDCARD_DECL
)
6985 return convert_wildcard_argument (parm
, arg
);
6987 if (TREE_CODE (arg
) == TREE_LIST
6988 && TREE_CODE (TREE_VALUE (arg
)) == OFFSET_REF
)
6990 /* The template argument was the name of some
6991 member function. That's usually
6992 invalid, but static members are OK. In any
6993 case, grab the underlying fields/functions
6994 and issue an error later if required. */
6995 orig_arg
= TREE_VALUE (arg
);
6996 TREE_TYPE (arg
) = unknown_type_node
;
7001 requires_tmpl_type
= TREE_CODE (parm
) == TEMPLATE_DECL
;
7002 requires_type
= (TREE_CODE (parm
) == TYPE_DECL
7003 || requires_tmpl_type
);
7005 /* When determining whether an argument pack expansion is a template,
7006 look at the pattern. */
7007 if (TREE_CODE (arg
) == TYPE_PACK_EXPANSION
)
7008 arg
= PACK_EXPANSION_PATTERN (arg
);
7010 /* Deal with an injected-class-name used as a template template arg. */
7011 if (requires_tmpl_type
&& CLASS_TYPE_P (arg
))
7013 tree t
= maybe_get_template_decl_from_type_decl (TYPE_NAME (arg
));
7014 if (TREE_CODE (t
) == TEMPLATE_DECL
)
7016 if (cxx_dialect
>= cxx11
)
7017 /* OK under DR 1004. */;
7018 else if (complain
& tf_warning_or_error
)
7019 pedwarn (input_location
, OPT_Wpedantic
, "injected-class-name %qD"
7020 " used as template template argument", TYPE_NAME (arg
));
7021 else if (flag_pedantic_errors
)
7029 ((TREE_CODE (arg
) == TEMPLATE_DECL
7030 && TREE_CODE (DECL_TEMPLATE_RESULT (arg
)) == TYPE_DECL
)
7031 || (requires_tmpl_type
&& TREE_CODE (arg
) == TYPE_ARGUMENT_PACK
)
7032 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
7033 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
);
7036 && (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
7037 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
))
7038 arg
= TYPE_STUB_DECL (arg
);
7040 is_type
= TYPE_P (arg
) || is_tmpl_type
;
7042 if (requires_type
&& ! is_type
&& TREE_CODE (arg
) == SCOPE_REF
7043 && TREE_CODE (TREE_OPERAND (arg
, 0)) == TEMPLATE_TYPE_PARM
)
7045 if (TREE_CODE (TREE_OPERAND (arg
, 1)) == BIT_NOT_EXPR
)
7047 if (complain
& tf_error
)
7048 error ("invalid use of destructor %qE as a type", orig_arg
);
7049 return error_mark_node
;
7052 permerror (input_location
,
7053 "to refer to a type member of a template parameter, "
7054 "use %<typename %E%>", orig_arg
);
7056 orig_arg
= make_typename_type (TREE_OPERAND (arg
, 0),
7057 TREE_OPERAND (arg
, 1),
7063 if (is_type
!= requires_type
)
7067 if (complain
& tf_error
)
7069 error ("type/value mismatch at argument %d in template "
7070 "parameter list for %qD",
7073 inform (input_location
,
7074 " expected a constant of type %qT, got %qT",
7076 (DECL_P (arg
) ? DECL_NAME (arg
) : orig_arg
));
7077 else if (requires_tmpl_type
)
7078 inform (input_location
,
7079 " expected a class template, got %qE", orig_arg
);
7081 inform (input_location
,
7082 " expected a type, got %qE", orig_arg
);
7085 return error_mark_node
;
7087 if (is_tmpl_type
^ requires_tmpl_type
)
7089 if (in_decl
&& (complain
& tf_error
))
7091 error ("type/value mismatch at argument %d in template "
7092 "parameter list for %qD",
7095 inform (input_location
,
7096 " expected a type, got %qT", DECL_NAME (arg
));
7098 inform (input_location
,
7099 " expected a class template, got %qT", orig_arg
);
7101 return error_mark_node
;
7106 if (requires_tmpl_type
)
7108 if (template_parameter_pack_p (parm
) && ARGUMENT_PACK_P (orig_arg
))
7110 else if (TREE_CODE (TREE_TYPE (arg
)) == UNBOUND_CLASS_TEMPLATE
)
7111 /* The number of argument required is not known yet.
7112 Just accept it for now. */
7113 val
= TREE_TYPE (arg
);
7116 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
7119 /* Strip alias templates that are equivalent to another
7121 arg
= get_underlying_template (arg
);
7122 argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
7124 if (coerce_template_template_parms (parmparm
, argparm
,
7130 /* TEMPLATE_TEMPLATE_PARM node is preferred over
7132 if (val
!= error_mark_node
)
7134 if (DECL_TEMPLATE_TEMPLATE_PARM_P (val
))
7135 val
= TREE_TYPE (val
);
7136 if (TREE_CODE (orig_arg
) == TYPE_PACK_EXPANSION
)
7137 val
= make_pack_expansion (val
);
7142 if (in_decl
&& (complain
& tf_error
))
7144 error ("type/value mismatch at argument %d in "
7145 "template parameter list for %qD",
7147 inform (input_location
,
7148 " expected a template of type %qD, got %qT",
7152 val
= error_mark_node
;
7155 // Check that the constraints are compatible before allowing the
7157 if (val
!= error_mark_node
)
7158 if (!is_compatible_template_arg (parm
, arg
))
7160 if (in_decl
&& (complain
& tf_error
))
7162 error ("constraint mismatch at argument %d in "
7163 "template parameter list for %qD",
7165 inform (input_location
, " expected %qD but got %qD",
7168 val
= error_mark_node
;
7174 /* We only form one instance of each template specialization.
7175 Therefore, if we use a non-canonical variant (i.e., a
7176 typedef), any future messages referring to the type will use
7177 the typedef, which is confusing if those future uses do not
7178 themselves also use the typedef. */
7180 val
= canonicalize_type_argument (val
, complain
);
7184 tree t
= tsubst (TREE_TYPE (parm
), args
, complain
, in_decl
);
7186 if (invalid_nontype_parm_type_p (t
, complain
))
7187 return error_mark_node
;
7189 if (template_parameter_pack_p (parm
) && ARGUMENT_PACK_P (orig_arg
))
7191 if (same_type_p (t
, TREE_TYPE (orig_arg
)))
7195 /* Not sure if this is reachable, but it doesn't hurt
7197 error ("type mismatch in nontype parameter pack");
7198 val
= error_mark_node
;
7201 else if (!dependent_template_arg_p (orig_arg
)
7202 && !uses_template_parms (t
))
7203 /* We used to call digest_init here. However, digest_init
7204 will report errors, which we don't want when complain
7205 is zero. More importantly, digest_init will try too
7206 hard to convert things: for example, `0' should not be
7207 converted to pointer type at this point according to
7208 the standard. Accepting this is not merely an
7209 extension, since deciding whether or not these
7210 conversions can occur is part of determining which
7211 function template to call, or whether a given explicit
7212 argument specification is valid. */
7213 val
= convert_nontype_argument (t
, orig_arg
, complain
);
7216 bool removed_attr
= false;
7217 val
= strip_typedefs_expr (orig_arg
, &removed_attr
);
7220 if (val
== NULL_TREE
)
7221 val
= error_mark_node
;
7222 else if (val
== error_mark_node
&& (complain
& tf_error
))
7223 error ("could not convert template argument %qE to %qT", orig_arg
, t
);
7225 if (INDIRECT_REF_P (val
))
7227 /* Reject template arguments that are references to built-in
7228 functions with no library fallbacks. */
7229 const_tree inner
= TREE_OPERAND (val
, 0);
7230 if (TREE_CODE (TREE_TYPE (inner
)) == REFERENCE_TYPE
7231 && TREE_CODE (TREE_TYPE (TREE_TYPE (inner
))) == FUNCTION_TYPE
7232 && TREE_CODE (TREE_TYPE (inner
)) == REFERENCE_TYPE
7233 && reject_gcc_builtin (TREE_OPERAND (inner
, 0)))
7234 return error_mark_node
;
7237 if (TREE_CODE (val
) == SCOPE_REF
)
7239 /* Strip typedefs from the SCOPE_REF. */
7240 tree type
= canonicalize_type_argument (TREE_TYPE (val
), complain
);
7241 tree scope
= canonicalize_type_argument (TREE_OPERAND (val
, 0),
7243 val
= build_qualified_name (type
, scope
, TREE_OPERAND (val
, 1),
7244 QUALIFIED_NAME_IS_TEMPLATE (val
));
7251 /* Coerces the remaining template arguments in INNER_ARGS (from
7252 ARG_IDX to the end) into the parameter pack at PARM_IDX in PARMS.
7253 Returns the coerced argument pack. PARM_IDX is the position of this
7254 parameter in the template parameter list. ARGS is the original
7255 template argument list. */
7257 coerce_template_parameter_pack (tree parms
,
7265 tsubst_flags_t complain
)
7267 tree parm
= TREE_VEC_ELT (parms
, parm_idx
);
7268 int nargs
= inner_args
? NUM_TMPL_ARGS (inner_args
) : 0;
7271 tree packed_parms
= NULL_TREE
;
7273 if (arg_idx
> nargs
)
7276 if (tree packs
= fixed_parameter_pack_p (TREE_VALUE (parm
)))
7278 /* When the template parameter is a non-type template parameter pack
7279 or template template parameter pack whose type or template
7280 parameters use parameter packs, we know exactly how many arguments
7281 we are looking for. Build a vector of the instantiated decls for
7282 these template parameters in PACKED_PARMS. */
7283 /* We can't use make_pack_expansion here because it would interpret a
7284 _DECL as a use rather than a declaration. */
7285 tree decl
= TREE_VALUE (parm
);
7286 tree exp
= cxx_make_type (TYPE_PACK_EXPANSION
);
7287 SET_PACK_EXPANSION_PATTERN (exp
, decl
);
7288 PACK_EXPANSION_PARAMETER_PACKS (exp
) = packs
;
7289 SET_TYPE_STRUCTURAL_EQUALITY (exp
);
7291 TREE_VEC_LENGTH (args
)--;
7292 packed_parms
= tsubst_pack_expansion (exp
, args
, complain
, decl
);
7293 TREE_VEC_LENGTH (args
)++;
7295 if (packed_parms
== error_mark_node
)
7296 return error_mark_node
;
7298 /* If we're doing a partial instantiation of a member template,
7299 verify that all of the types used for the non-type
7300 template parameter pack are, in fact, valid for non-type
7301 template parameters. */
7303 && PACK_EXPANSION_P (TREE_VEC_ELT (inner_args
, arg_idx
)))
7305 int j
, len
= TREE_VEC_LENGTH (packed_parms
);
7306 for (j
= 0; j
< len
; ++j
)
7308 tree t
= TREE_TYPE (TREE_VEC_ELT (packed_parms
, j
));
7309 if (invalid_nontype_parm_type_p (t
, complain
))
7310 return error_mark_node
;
7312 /* We don't know how many args we have yet, just
7313 use the unconverted ones for now. */
7317 packed_args
= make_tree_vec (TREE_VEC_LENGTH (packed_parms
));
7319 /* Check if we have a placeholder pack, which indicates we're
7320 in the context of a introduction list. In that case we want
7321 to match this pack to the single placeholder. */
7322 else if (arg_idx
< nargs
7323 && TREE_CODE (TREE_VEC_ELT (inner_args
, arg_idx
)) == WILDCARD_DECL
7324 && WILDCARD_PACK_P (TREE_VEC_ELT (inner_args
, arg_idx
)))
7326 nargs
= arg_idx
+ 1;
7327 packed_args
= make_tree_vec (1);
7330 packed_args
= make_tree_vec (nargs
- arg_idx
);
7332 /* Convert the remaining arguments, which will be a part of the
7333 parameter pack "parm". */
7334 for (; arg_idx
< nargs
; ++arg_idx
)
7336 tree arg
= TREE_VEC_ELT (inner_args
, arg_idx
);
7337 tree actual_parm
= TREE_VALUE (parm
);
7338 int pack_idx
= arg_idx
- parm_idx
;
7342 /* Once we've packed as many args as we have types, stop. */
7343 if (pack_idx
>= TREE_VEC_LENGTH (packed_parms
))
7345 else if (PACK_EXPANSION_P (arg
))
7346 /* We don't know how many args we have yet, just
7347 use the unconverted ones for now. */
7350 actual_parm
= TREE_VEC_ELT (packed_parms
, pack_idx
);
7353 if (arg
== error_mark_node
)
7355 if (complain
& tf_error
)
7356 error ("template argument %d is invalid", arg_idx
+ 1);
7359 arg
= convert_template_argument (actual_parm
,
7360 arg
, new_args
, complain
, parm_idx
,
7362 if (arg
== error_mark_node
)
7364 TREE_VEC_ELT (packed_args
, pack_idx
) = arg
;
7367 if (arg_idx
- parm_idx
< TREE_VEC_LENGTH (packed_args
)
7368 && TREE_VEC_LENGTH (packed_args
) > 0)
7370 if (complain
& tf_error
)
7371 error ("wrong number of template arguments (%d, should be %d)",
7372 arg_idx
- parm_idx
, TREE_VEC_LENGTH (packed_args
));
7373 return error_mark_node
;
7376 if (TREE_CODE (TREE_VALUE (parm
)) == TYPE_DECL
7377 || TREE_CODE (TREE_VALUE (parm
)) == TEMPLATE_DECL
)
7378 argument_pack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
7381 argument_pack
= make_node (NONTYPE_ARGUMENT_PACK
);
7382 TREE_TYPE (argument_pack
)
7383 = tsubst (TREE_TYPE (TREE_VALUE (parm
)), new_args
, complain
, in_decl
);
7384 TREE_CONSTANT (argument_pack
) = 1;
7387 SET_ARGUMENT_PACK_ARGS (argument_pack
, packed_args
);
7388 #ifdef ENABLE_CHECKING
7389 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (packed_args
,
7390 TREE_VEC_LENGTH (packed_args
));
7392 return argument_pack
;
7395 /* Returns the number of pack expansions in the template argument vector
7399 pack_expansion_args_count (tree args
)
7404 for (i
= 0; i
< TREE_VEC_LENGTH (args
); ++i
)
7406 tree elt
= TREE_VEC_ELT (args
, i
);
7407 if (elt
&& PACK_EXPANSION_P (elt
))
7413 /* Convert all template arguments to their appropriate types, and
7414 return a vector containing the innermost resulting template
7415 arguments. If any error occurs, return error_mark_node. Error and
7416 warning messages are issued under control of COMPLAIN.
7418 If REQUIRE_ALL_ARGS is false, argument deduction will be performed
7419 for arguments not specified in ARGS. Otherwise, if
7420 USE_DEFAULT_ARGS is true, default arguments will be used to fill in
7421 unspecified arguments. If REQUIRE_ALL_ARGS is true, but
7422 USE_DEFAULT_ARGS is false, then all arguments must be specified in
7426 coerce_template_parms (tree parms
,
7429 tsubst_flags_t complain
,
7430 bool require_all_args
,
7431 bool use_default_args
)
7433 int nparms
, nargs
, parm_idx
, arg_idx
, lost
= 0;
7434 tree orig_inner_args
;
7437 tree new_inner_args
;
7438 int saved_unevaluated_operand
;
7439 int saved_inhibit_evaluation_warnings
;
7441 /* When used as a boolean value, indicates whether this is a
7442 variadic template parameter list. Since it's an int, we can also
7443 subtract it from nparms to get the number of non-variadic
7446 int variadic_args_p
= 0;
7447 int post_variadic_parms
= 0;
7449 /* Likewise for parameters with default arguments. */
7452 if (args
== error_mark_node
)
7453 return error_mark_node
;
7455 nparms
= TREE_VEC_LENGTH (parms
);
7457 /* Determine if there are any parameter packs or default arguments. */
7458 for (parm_idx
= 0; parm_idx
< nparms
; ++parm_idx
)
7460 tree parm
= TREE_VEC_ELT (parms
, parm_idx
);
7462 ++post_variadic_parms
;
7463 if (template_parameter_pack_p (TREE_VALUE (parm
)))
7465 if (TREE_PURPOSE (parm
))
7469 inner_args
= orig_inner_args
= INNERMOST_TEMPLATE_ARGS (args
);
7470 /* If there are no parameters that follow a parameter pack, we need to
7471 expand any argument packs so that we can deduce a parameter pack from
7472 some non-packed args followed by an argument pack, as in variadic85.C.
7473 If there are such parameters, we need to leave argument packs intact
7474 so the arguments are assigned properly. This can happen when dealing
7475 with a nested class inside a partial specialization of a class
7476 template, as in variadic92.C, or when deducing a template parameter pack
7477 from a sub-declarator, as in variadic114.C. */
7478 if (!post_variadic_parms
)
7479 inner_args
= expand_template_argument_pack (inner_args
);
7481 /* Count any pack expansion args. */
7482 variadic_args_p
= pack_expansion_args_count (inner_args
);
7484 nargs
= inner_args
? NUM_TMPL_ARGS (inner_args
) : 0;
7485 if ((nargs
> nparms
&& !variadic_p
)
7486 || (nargs
< nparms
- variadic_p
7489 && (!use_default_args
7490 || (TREE_VEC_ELT (parms
, nargs
) != error_mark_node
7491 && !TREE_PURPOSE (TREE_VEC_ELT (parms
, nargs
))))))
7493 if (complain
& tf_error
)
7495 if (variadic_p
|| default_p
)
7497 nparms
-= variadic_p
+ default_p
;
7498 error ("wrong number of template arguments "
7499 "(%d, should be at least %d)", nargs
, nparms
);
7502 error ("wrong number of template arguments "
7503 "(%d, should be %d)", nargs
, nparms
);
7506 inform (DECL_SOURCE_LOCATION (in_decl
),
7507 "provided for %qD", in_decl
);
7510 return error_mark_node
;
7512 /* We can't pass a pack expansion to a non-pack parameter of an alias
7513 template (DR 1430). */
7515 && (DECL_ALIAS_TEMPLATE_P (in_decl
)
7516 || concept_template_p (in_decl
))
7518 && nargs
- variadic_args_p
< nparms
- variadic_p
)
7520 if (complain
& tf_error
)
7522 for (int i
= 0; i
< TREE_VEC_LENGTH (inner_args
); ++i
)
7524 tree arg
= TREE_VEC_ELT (inner_args
, i
);
7525 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
7527 if (PACK_EXPANSION_P (arg
)
7528 && !template_parameter_pack_p (parm
))
7530 if (DECL_ALIAS_TEMPLATE_P (in_decl
))
7531 error_at (location_of (arg
),
7532 "pack expansion argument for non-pack parameter "
7533 "%qD of alias template %qD", parm
, in_decl
);
7535 error_at (location_of (arg
),
7536 "pack expansion argument for non-pack parameter "
7537 "%qD of concept %qD", parm
, in_decl
);
7538 inform (DECL_SOURCE_LOCATION (parm
), "declared here");
7545 return error_mark_node
;
7548 /* We need to evaluate the template arguments, even though this
7549 template-id may be nested within a "sizeof". */
7550 saved_unevaluated_operand
= cp_unevaluated_operand
;
7551 cp_unevaluated_operand
= 0;
7552 saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
7553 c_inhibit_evaluation_warnings
= 0;
7554 new_inner_args
= make_tree_vec (nparms
);
7555 new_args
= add_outermost_template_args (args
, new_inner_args
);
7556 int pack_adjust
= 0;
7557 for (parm_idx
= 0, arg_idx
= 0; parm_idx
< nparms
; parm_idx
++, arg_idx
++)
7562 /* Get the Ith template parameter. */
7563 parm
= TREE_VEC_ELT (parms
, parm_idx
);
7565 if (parm
== error_mark_node
)
7567 TREE_VEC_ELT (new_inner_args
, arg_idx
) = error_mark_node
;
7571 /* Calculate the next argument. */
7572 if (arg_idx
< nargs
)
7573 arg
= TREE_VEC_ELT (inner_args
, arg_idx
);
7577 if (template_parameter_pack_p (TREE_VALUE (parm
))
7578 && !(arg
&& ARGUMENT_PACK_P (arg
)))
7580 /* Some arguments will be placed in the
7581 template parameter pack PARM. */
7582 arg
= coerce_template_parameter_pack (parms
, parm_idx
, args
,
7583 inner_args
, arg_idx
,
7587 if (arg
== NULL_TREE
)
7589 /* We don't know how many args we have yet, just use the
7590 unconverted (and still packed) ones for now. */
7591 new_inner_args
= orig_inner_args
;
7596 TREE_VEC_ELT (new_inner_args
, parm_idx
) = arg
;
7598 /* Store this argument. */
7599 if (arg
== error_mark_node
)
7602 /* We are done with all of the arguments. */
7607 pack_adjust
= TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg
)) - 1;
7608 arg_idx
+= pack_adjust
;
7615 if (PACK_EXPANSION_P (arg
))
7617 /* "If every valid specialization of a variadic template
7618 requires an empty template parameter pack, the template is
7619 ill-formed, no diagnostic required." So check that the
7620 pattern works with this parameter. */
7621 tree pattern
= PACK_EXPANSION_PATTERN (arg
);
7622 tree conv
= convert_template_argument (TREE_VALUE (parm
),
7626 if (conv
== error_mark_node
)
7628 inform (input_location
, "so any instantiation with a "
7629 "non-empty parameter pack would be ill-formed");
7632 else if (TYPE_P (conv
) && !TYPE_P (pattern
))
7633 /* Recover from missing typename. */
7634 TREE_VEC_ELT (inner_args
, arg_idx
)
7635 = make_pack_expansion (conv
);
7637 /* We don't know how many args we have yet, just
7638 use the unconverted ones for now. */
7639 new_inner_args
= inner_args
;
7644 else if (require_all_args
)
7646 /* There must be a default arg in this case. */
7647 arg
= tsubst_template_arg (TREE_PURPOSE (parm
), new_args
,
7649 /* The position of the first default template argument,
7650 is also the number of non-defaulted arguments in NEW_INNER_ARGS.
7652 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
))
7653 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
,
7654 arg_idx
- pack_adjust
);
7659 if (arg
== error_mark_node
)
7661 if (complain
& tf_error
)
7662 error ("template argument %d is invalid", arg_idx
+ 1);
7665 /* This only occurs if there was an error in the template
7666 parameter list itself (which we would already have
7667 reported) that we are trying to recover from, e.g., a class
7668 template with a parameter list such as
7669 template<typename..., typename>. */
7672 arg
= convert_template_argument (TREE_VALUE (parm
),
7673 arg
, new_args
, complain
,
7676 if (arg
== error_mark_node
)
7678 TREE_VEC_ELT (new_inner_args
, arg_idx
- pack_adjust
) = arg
;
7680 cp_unevaluated_operand
= saved_unevaluated_operand
;
7681 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
7683 if (variadic_p
&& arg_idx
< nargs
)
7685 if (complain
& tf_error
)
7687 error ("wrong number of template arguments "
7688 "(%d, should be %d)", nargs
, arg_idx
);
7690 error ("provided for %q+D", in_decl
);
7692 return error_mark_node
;
7696 return error_mark_node
;
7698 #ifdef ENABLE_CHECKING
7699 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
))
7700 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
,
7701 TREE_VEC_LENGTH (new_inner_args
));
7704 return new_inner_args
;
7707 /* Convert all template arguments to their appropriate types, and
7708 return a vector containing the innermost resulting template
7709 arguments. If any error occurs, return error_mark_node. Error and
7710 warning messages are not issued.
7712 Note that no function argument deduction is performed, and default
7713 arguments are used to fill in unspecified arguments. */
7715 coerce_template_parms (tree parms
, tree args
, tree in_decl
)
7717 return coerce_template_parms (parms
, args
, in_decl
, tf_none
, true, true);
7720 /* Convert all template arguments to their appropriate type, and
7721 instantiate default arguments as needed. This returns a vector
7722 containing the innermost resulting template arguments, or
7723 error_mark_node if unsuccessful. */
7725 coerce_template_parms (tree parms
, tree args
, tree in_decl
,
7726 tsubst_flags_t complain
)
7728 return coerce_template_parms (parms
, args
, in_decl
, complain
, true, true);
7731 /* Like coerce_template_parms. If PARMS represents all template
7732 parameters levels, this function returns a vector of vectors
7733 representing all the resulting argument levels. Note that in this
7734 case, only the innermost arguments are coerced because the
7735 outermost ones are supposed to have been coerced already.
7737 Otherwise, if PARMS represents only (the innermost) vector of
7738 parameters, this function returns a vector containing just the
7739 innermost resulting arguments. */
7742 coerce_innermost_template_parms (tree parms
,
7745 tsubst_flags_t complain
,
7746 bool require_all_args
,
7747 bool use_default_args
)
7749 int parms_depth
= TMPL_PARMS_DEPTH (parms
);
7750 int args_depth
= TMPL_ARGS_DEPTH (args
);
7753 if (parms_depth
> 1)
7755 coerced_args
= make_tree_vec (parms_depth
);
7759 for (level
= parms
, cur_depth
= parms_depth
;
7760 parms_depth
> 0 && level
!= NULL_TREE
;
7761 level
= TREE_CHAIN (level
), --cur_depth
)
7764 if (cur_depth
== args_depth
)
7765 l
= coerce_template_parms (TREE_VALUE (level
),
7766 args
, in_decl
, complain
,
7770 l
= TMPL_ARGS_LEVEL (args
, cur_depth
);
7772 if (l
== error_mark_node
)
7773 return error_mark_node
;
7775 SET_TMPL_ARGS_LEVEL (coerced_args
, cur_depth
, l
);
7779 coerced_args
= coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parms
),
7780 args
, in_decl
, complain
,
7783 return coerced_args
;
7786 /* Returns 1 if template args OT and NT are equivalent. */
7789 template_args_equal (tree ot
, tree nt
)
7793 if (nt
== NULL_TREE
|| ot
== NULL_TREE
)
7796 if (TREE_CODE (nt
) == TREE_VEC
)
7797 /* For member templates */
7798 return TREE_CODE (ot
) == TREE_VEC
&& comp_template_args (ot
, nt
);
7799 else if (PACK_EXPANSION_P (ot
))
7800 return (PACK_EXPANSION_P (nt
)
7801 && template_args_equal (PACK_EXPANSION_PATTERN (ot
),
7802 PACK_EXPANSION_PATTERN (nt
))
7803 && template_args_equal (PACK_EXPANSION_EXTRA_ARGS (ot
),
7804 PACK_EXPANSION_EXTRA_ARGS (nt
)));
7805 else if (ARGUMENT_PACK_P (ot
))
7810 if (!ARGUMENT_PACK_P (nt
))
7813 opack
= ARGUMENT_PACK_ARGS (ot
);
7814 npack
= ARGUMENT_PACK_ARGS (nt
);
7815 len
= TREE_VEC_LENGTH (opack
);
7816 if (TREE_VEC_LENGTH (npack
) != len
)
7818 for (i
= 0; i
< len
; ++i
)
7819 if (!template_args_equal (TREE_VEC_ELT (opack
, i
),
7820 TREE_VEC_ELT (npack
, i
)))
7824 else if (ot
&& TREE_CODE (ot
) == ARGUMENT_PACK_SELECT
)
7826 /* We get here probably because we are in the middle of substituting
7827 into the pattern of a pack expansion. In that case the
7828 ARGUMENT_PACK_SELECT temporarily replaces the pack argument we are
7829 interested in. So we want to use the initial pack argument for
7831 ot
= ARGUMENT_PACK_SELECT_FROM_PACK (ot
);
7832 if (nt
&& TREE_CODE (nt
) == ARGUMENT_PACK_SELECT
)
7833 nt
= ARGUMENT_PACK_SELECT_FROM_PACK (nt
);
7834 return template_args_equal (ot
, nt
);
7836 else if (TYPE_P (nt
))
7840 /* Don't treat an alias template specialization with dependent
7841 arguments as equivalent to its underlying type when used as a
7842 template argument; we need them to be distinct so that we
7843 substitute into the specialization arguments at instantiation
7844 time. And aliases can't be equivalent without being ==, so
7845 we don't need to look any deeper. */
7846 if (TYPE_ALIAS_P (nt
) || TYPE_ALIAS_P (ot
))
7849 return same_type_p (ot
, nt
);
7851 else if (TREE_CODE (ot
) == TREE_VEC
|| TYPE_P (ot
))
7855 /* Try to treat a template non-type argument that has been converted
7856 to the parameter type as equivalent to one that hasn't yet. */
7857 for (enum tree_code code1
= TREE_CODE (ot
);
7858 CONVERT_EXPR_CODE_P (code1
)
7859 || code1
== NON_LVALUE_EXPR
;
7860 code1
= TREE_CODE (ot
))
7861 ot
= TREE_OPERAND (ot
, 0);
7862 for (enum tree_code code2
= TREE_CODE (nt
);
7863 CONVERT_EXPR_CODE_P (code2
)
7864 || code2
== NON_LVALUE_EXPR
;
7865 code2
= TREE_CODE (nt
))
7866 nt
= TREE_OPERAND (nt
, 0);
7868 return cp_tree_equal (ot
, nt
);
7872 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets of
7873 template arguments. Returns 0 otherwise, and updates OLDARG_PTR and
7874 NEWARG_PTR with the offending arguments if they are non-NULL. */
7877 comp_template_args_with_info (tree oldargs
, tree newargs
,
7878 tree
*oldarg_ptr
, tree
*newarg_ptr
)
7882 if (oldargs
== newargs
)
7885 if (!oldargs
|| !newargs
)
7888 if (TREE_VEC_LENGTH (oldargs
) != TREE_VEC_LENGTH (newargs
))
7891 for (i
= 0; i
< TREE_VEC_LENGTH (oldargs
); ++i
)
7893 tree nt
= TREE_VEC_ELT (newargs
, i
);
7894 tree ot
= TREE_VEC_ELT (oldargs
, i
);
7896 if (! template_args_equal (ot
, nt
))
7898 if (oldarg_ptr
!= NULL
)
7900 if (newarg_ptr
!= NULL
)
7908 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets
7909 of template arguments. Returns 0 otherwise. */
7912 comp_template_args (tree oldargs
, tree newargs
)
7914 return comp_template_args_with_info (oldargs
, newargs
, NULL
, NULL
);
7918 add_pending_template (tree d
)
7920 tree ti
= (TYPE_P (d
)
7921 ? CLASSTYPE_TEMPLATE_INFO (d
)
7922 : DECL_TEMPLATE_INFO (d
));
7923 struct pending_template
*pt
;
7926 if (TI_PENDING_TEMPLATE_FLAG (ti
))
7929 /* We are called both from instantiate_decl, where we've already had a
7930 tinst_level pushed, and instantiate_template, where we haven't.
7932 level
= !current_tinst_level
|| current_tinst_level
->decl
!= d
;
7935 push_tinst_level (d
);
7937 pt
= ggc_alloc
<pending_template
> ();
7939 pt
->tinst
= current_tinst_level
;
7940 if (last_pending_template
)
7941 last_pending_template
->next
= pt
;
7943 pending_templates
= pt
;
7945 last_pending_template
= pt
;
7947 TI_PENDING_TEMPLATE_FLAG (ti
) = 1;
7954 /* Return a TEMPLATE_ID_EXPR corresponding to the indicated FNS and
7955 ARGLIST. Valid choices for FNS are given in the cp-tree.def
7956 documentation for TEMPLATE_ID_EXPR. */
7959 lookup_template_function (tree fns
, tree arglist
)
7963 if (fns
== error_mark_node
|| arglist
== error_mark_node
)
7964 return error_mark_node
;
7966 gcc_assert (!arglist
|| TREE_CODE (arglist
) == TREE_VEC
);
7968 if (!is_overloaded_fn (fns
) && !identifier_p (fns
))
7970 error ("%q#D is not a function template", fns
);
7971 return error_mark_node
;
7974 if (BASELINK_P (fns
))
7976 BASELINK_FUNCTIONS (fns
) = build2 (TEMPLATE_ID_EXPR
,
7978 BASELINK_FUNCTIONS (fns
),
7983 type
= TREE_TYPE (fns
);
7984 if (TREE_CODE (fns
) == OVERLOAD
|| !type
)
7985 type
= unknown_type_node
;
7987 return build2 (TEMPLATE_ID_EXPR
, type
, fns
, arglist
);
7990 /* Within the scope of a template class S<T>, the name S gets bound
7991 (in build_self_reference) to a TYPE_DECL for the class, not a
7992 TEMPLATE_DECL. If DECL is a TYPE_DECL for current_class_type,
7993 or one of its enclosing classes, and that type is a template,
7994 return the associated TEMPLATE_DECL. Otherwise, the original
7997 Also handle the case when DECL is a TREE_LIST of ambiguous
7998 injected-class-names from different bases. */
8001 maybe_get_template_decl_from_type_decl (tree decl
)
8003 if (decl
== NULL_TREE
)
8006 /* DR 176: A lookup that finds an injected-class-name (10.2
8007 [class.member.lookup]) can result in an ambiguity in certain cases
8008 (for example, if it is found in more than one base class). If all of
8009 the injected-class-names that are found refer to specializations of
8010 the same class template, and if the name is followed by a
8011 template-argument-list, the reference refers to the class template
8012 itself and not a specialization thereof, and is not ambiguous. */
8013 if (TREE_CODE (decl
) == TREE_LIST
)
8015 tree t
, tmpl
= NULL_TREE
;
8016 for (t
= decl
; t
; t
= TREE_CHAIN (t
))
8018 tree elt
= maybe_get_template_decl_from_type_decl (TREE_VALUE (t
));
8021 else if (tmpl
!= elt
)
8024 if (tmpl
&& t
== NULL_TREE
)
8030 return (decl
!= NULL_TREE
8031 && DECL_SELF_REFERENCE_P (decl
)
8032 && CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (decl
)))
8033 ? CLASSTYPE_TI_TEMPLATE (TREE_TYPE (decl
)) : decl
;
8036 /* Given an IDENTIFIER_NODE (or type TEMPLATE_DECL) and a chain of
8037 parameters, find the desired type.
8039 D1 is the PTYPENAME terminal, and ARGLIST is the list of arguments.
8041 IN_DECL, if non-NULL, is the template declaration we are trying to
8044 If ENTERING_SCOPE is nonzero, we are about to enter the scope of
8045 the class we are looking up.
8047 Issue error and warning messages under control of COMPLAIN.
8049 If the template class is really a local class in a template
8050 function, then the FUNCTION_CONTEXT is the function in which it is
8053 ??? Note that this function is currently called *twice* for each
8054 template-id: the first time from the parser, while creating the
8055 incomplete type (finish_template_type), and the second type during the
8056 real instantiation (instantiate_template_class). This is surely something
8057 that we want to avoid. It also causes some problems with argument
8058 coercion (see convert_nontype_argument for more information on this). */
8061 lookup_template_class_1 (tree d1
, tree arglist
, tree in_decl
, tree context
,
8062 int entering_scope
, tsubst_flags_t complain
)
8064 tree templ
= NULL_TREE
, parmlist
;
8071 if (identifier_p (d1
))
8073 tree value
= innermost_non_namespace_value (d1
);
8074 if (value
&& DECL_TEMPLATE_TEMPLATE_PARM_P (value
))
8079 push_decl_namespace (context
);
8080 templ
= lookup_name (d1
);
8081 templ
= maybe_get_template_decl_from_type_decl (templ
);
8083 pop_decl_namespace ();
8086 context
= DECL_CONTEXT (templ
);
8088 else if (TREE_CODE (d1
) == TYPE_DECL
&& MAYBE_CLASS_TYPE_P (TREE_TYPE (d1
)))
8090 tree type
= TREE_TYPE (d1
);
8092 /* If we are declaring a constructor, say A<T>::A<T>, we will get
8093 an implicit typename for the second A. Deal with it. */
8094 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
8095 type
= TREE_TYPE (type
);
8097 if (CLASSTYPE_TEMPLATE_INFO (type
))
8099 templ
= CLASSTYPE_TI_TEMPLATE (type
);
8100 d1
= DECL_NAME (templ
);
8103 else if (TREE_CODE (d1
) == ENUMERAL_TYPE
8104 || (TYPE_P (d1
) && MAYBE_CLASS_TYPE_P (d1
)))
8106 templ
= TYPE_TI_TEMPLATE (d1
);
8107 d1
= DECL_NAME (templ
);
8109 else if (DECL_TYPE_TEMPLATE_P (d1
))
8112 d1
= DECL_NAME (templ
);
8113 context
= DECL_CONTEXT (templ
);
8115 else if (DECL_TEMPLATE_TEMPLATE_PARM_P (d1
))
8118 d1
= DECL_NAME (templ
);
8121 /* Issue an error message if we didn't find a template. */
8124 if (complain
& tf_error
)
8125 error ("%qT is not a template", d1
);
8126 return error_mark_node
;
8129 if (TREE_CODE (templ
) != TEMPLATE_DECL
8130 /* Make sure it's a user visible template, if it was named by
8132 || ((complain
& tf_user
) && !DECL_TEMPLATE_PARM_P (templ
)
8133 && !PRIMARY_TEMPLATE_P (templ
)))
8135 if (complain
& tf_error
)
8137 error ("non-template type %qT used as a template", d1
);
8139 error ("for template declaration %q+D", in_decl
);
8141 return error_mark_node
;
8144 complain
&= ~tf_user
;
8146 /* An alias that just changes the name of a template is equivalent to the
8147 other template, so if any of the arguments are pack expansions, strip
8148 the alias to avoid problems with a pack expansion passed to a non-pack
8149 alias template parameter (DR 1430). */
8150 if (pack_expansion_args_count (INNERMOST_TEMPLATE_ARGS (arglist
)))
8151 templ
= get_underlying_template (templ
);
8153 if (DECL_TEMPLATE_TEMPLATE_PARM_P (templ
))
8155 /* Create a new TEMPLATE_DECL and TEMPLATE_TEMPLATE_PARM node to store
8156 template arguments */
8162 parmlist
= DECL_INNERMOST_TEMPLATE_PARMS (templ
);
8164 /* Consider an example where a template template parameter declared as
8166 template <class T, class U = std::allocator<T> > class TT
8168 The template parameter level of T and U are one level larger than
8169 of TT. To proper process the default argument of U, say when an
8170 instantiation `TT<int>' is seen, we need to build the full
8171 arguments containing {int} as the innermost level. Outer levels,
8172 available when not appearing as default template argument, can be
8173 obtained from the arguments of the enclosing template.
8175 Suppose that TT is later substituted with std::vector. The above
8176 instantiation is `TT<int, std::allocator<T> >' with TT at
8177 level 1, and T at level 2, while the template arguments at level 1
8178 becomes {std::vector} and the inner level 2 is {int}. */
8180 outer
= DECL_CONTEXT (templ
);
8182 outer
= TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (outer
)));
8183 else if (current_template_parms
)
8185 /* This is an argument of the current template, so we haven't set
8186 DECL_CONTEXT yet. */
8187 tree relevant_template_parms
;
8189 /* Parameter levels that are greater than the level of the given
8190 template template parm are irrelevant. */
8191 relevant_template_parms
= current_template_parms
;
8192 while (TMPL_PARMS_DEPTH (relevant_template_parms
)
8193 != TEMPLATE_TYPE_LEVEL (TREE_TYPE (templ
)))
8194 relevant_template_parms
= TREE_CHAIN (relevant_template_parms
);
8196 outer
= template_parms_to_args (relevant_template_parms
);
8200 arglist
= add_to_template_args (outer
, arglist
);
8202 arglist2
= coerce_template_parms (parmlist
, arglist
, templ
,
8204 /*require_all_args=*/true,
8205 /*use_default_args=*/true);
8206 if (arglist2
== error_mark_node
8207 || (!uses_template_parms (arglist2
)
8208 && check_instantiated_args (templ
, arglist2
, complain
)))
8209 return error_mark_node
;
8211 parm
= bind_template_template_parm (TREE_TYPE (templ
), arglist2
);
8216 tree template_type
= TREE_TYPE (templ
);
8219 tree found
= NULL_TREE
;
8222 int is_dependent_type
;
8223 int use_partial_inst_tmpl
= false;
8225 if (template_type
== error_mark_node
)
8226 /* An error occurred while building the template TEMPL, and a
8227 diagnostic has most certainly been emitted for that
8228 already. Let's propagate that error. */
8229 return error_mark_node
;
8231 gen_tmpl
= most_general_template (templ
);
8232 parmlist
= DECL_TEMPLATE_PARMS (gen_tmpl
);
8233 parm_depth
= TMPL_PARMS_DEPTH (parmlist
);
8234 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
8236 if (arg_depth
== 1 && parm_depth
> 1)
8238 /* We've been given an incomplete set of template arguments.
8241 template <class T> struct S1 {
8242 template <class U> struct S2 {};
8243 template <class U> struct S2<U*> {};
8246 we will be called with an ARGLIST of `U*', but the
8247 TEMPLATE will be `template <class T> template
8248 <class U> struct S1<T>::S2'. We must fill in the missing
8251 = add_outermost_template_args (TYPE_TI_ARGS (TREE_TYPE (templ
)),
8253 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
8256 /* Now we should have enough arguments. */
8257 gcc_assert (parm_depth
== arg_depth
);
8259 /* From here on, we're only interested in the most general
8262 /* Calculate the BOUND_ARGS. These will be the args that are
8263 actually tsubst'd into the definition to create the
8265 arglist
= coerce_innermost_template_parms (parmlist
, arglist
, gen_tmpl
,
8267 /*require_all_args=*/true,
8268 /*use_default_args=*/true);
8270 if (arglist
== error_mark_node
)
8271 /* We were unable to bind the arguments. */
8272 return error_mark_node
;
8274 /* In the scope of a template class, explicit references to the
8275 template class refer to the type of the template, not any
8276 instantiation of it. For example, in:
8278 template <class T> class C { void f(C<T>); }
8280 the `C<T>' is just the same as `C'. Outside of the
8281 class, however, such a reference is an instantiation. */
8283 || !PRIMARY_TEMPLATE_P (gen_tmpl
)
8284 || currently_open_class (template_type
))
8285 /* comp_template_args is expensive, check it last. */
8286 && comp_template_args (TYPE_TI_ARGS (template_type
),
8288 return template_type
;
8290 /* If we already have this specialization, return it. */
8291 elt
.tmpl
= gen_tmpl
;
8293 elt
.spec
= NULL_TREE
;
8294 hash
= spec_hasher::hash (&elt
);
8295 entry
= type_specializations
->find_with_hash (&elt
, hash
);
8300 /* If the the template's constraints are not satisfied,
8301 then we cannot form a valid type.
8303 Note that the check is deferred until after the hash
8304 lookup. This prevents redundant checks on previously
8305 instantiated specializations. */
8306 if (flag_concepts
&& !constraints_satisfied_p (gen_tmpl
, arglist
))
8308 if (complain
& tf_error
)
8310 error ("template constraint failure");
8311 diagnose_constraints (input_location
, gen_tmpl
, arglist
);
8313 return error_mark_node
;
8316 is_dependent_type
= uses_template_parms (arglist
);
8318 /* If the deduced arguments are invalid, then the binding
8320 if (!is_dependent_type
8321 && check_instantiated_args (gen_tmpl
,
8322 INNERMOST_TEMPLATE_ARGS (arglist
),
8324 return error_mark_node
;
8326 if (!is_dependent_type
8327 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
8328 && !LAMBDA_TYPE_P (TREE_TYPE (gen_tmpl
))
8329 && TREE_CODE (CP_DECL_CONTEXT (gen_tmpl
)) == NAMESPACE_DECL
)
8331 found
= xref_tag_from_type (TREE_TYPE (gen_tmpl
),
8332 DECL_NAME (gen_tmpl
),
8333 /*tag_scope=*/ts_global
);
8337 context
= tsubst (DECL_CONTEXT (gen_tmpl
), arglist
,
8339 if (context
== error_mark_node
)
8340 return error_mark_node
;
8343 context
= global_namespace
;
8345 /* Create the type. */
8346 if (DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
8348 /* The user referred to a specialization of an alias
8349 template represented by GEN_TMPL.
8351 [temp.alias]/2 says:
8353 When a template-id refers to the specialization of an
8354 alias template, it is equivalent to the associated
8355 type obtained by substitution of its
8356 template-arguments for the template-parameters in the
8357 type-id of the alias template. */
8359 t
= tsubst (TREE_TYPE (gen_tmpl
), arglist
, complain
, in_decl
);
8360 /* Note that the call above (by indirectly calling
8361 register_specialization in tsubst_decl) registers the
8362 TYPE_DECL representing the specialization of the alias
8363 template. So next time someone substitutes ARGLIST for
8364 the template parms into the alias template (GEN_TMPL),
8365 she'll get that TYPE_DECL back. */
8367 if (t
== error_mark_node
)
8370 else if (TREE_CODE (template_type
) == ENUMERAL_TYPE
)
8372 if (!is_dependent_type
)
8374 set_current_access_from_decl (TYPE_NAME (template_type
));
8375 t
= start_enum (TYPE_IDENTIFIER (template_type
), NULL_TREE
,
8376 tsubst (ENUM_UNDERLYING_TYPE (template_type
),
8377 arglist
, complain
, in_decl
),
8378 SCOPED_ENUM_P (template_type
), NULL
);
8380 if (t
== error_mark_node
)
8385 /* We don't want to call start_enum for this type, since
8386 the values for the enumeration constants may involve
8387 template parameters. And, no one should be interested
8388 in the enumeration constants for such a type. */
8389 t
= cxx_make_type (ENUMERAL_TYPE
);
8390 SET_SCOPED_ENUM_P (t
, SCOPED_ENUM_P (template_type
));
8392 SET_OPAQUE_ENUM_P (t
, OPAQUE_ENUM_P (template_type
));
8393 ENUM_FIXED_UNDERLYING_TYPE_P (t
)
8394 = ENUM_FIXED_UNDERLYING_TYPE_P (template_type
);
8396 else if (CLASS_TYPE_P (template_type
))
8398 t
= make_class_type (TREE_CODE (template_type
));
8399 CLASSTYPE_DECLARED_CLASS (t
)
8400 = CLASSTYPE_DECLARED_CLASS (template_type
);
8401 SET_CLASSTYPE_IMPLICIT_INSTANTIATION (t
);
8402 TYPE_FOR_JAVA (t
) = TYPE_FOR_JAVA (template_type
);
8404 /* A local class. Make sure the decl gets registered properly. */
8405 if (context
== current_function_decl
)
8406 pushtag (DECL_NAME (gen_tmpl
), t
, /*tag_scope=*/ts_current
);
8408 if (comp_template_args (CLASSTYPE_TI_ARGS (template_type
), arglist
))
8409 /* This instantiation is another name for the primary
8410 template type. Set the TYPE_CANONICAL field
8412 TYPE_CANONICAL (t
) = template_type
;
8413 else if (any_template_arguments_need_structural_equality_p (arglist
))
8414 /* Some of the template arguments require structural
8415 equality testing, so this template class requires
8416 structural equality testing. */
8417 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8422 /* If we called start_enum or pushtag above, this information
8423 will already be set up. */
8426 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
8428 type_decl
= create_implicit_typedef (DECL_NAME (gen_tmpl
), t
);
8429 DECL_CONTEXT (type_decl
) = TYPE_CONTEXT (t
);
8430 DECL_SOURCE_LOCATION (type_decl
)
8431 = DECL_SOURCE_LOCATION (TYPE_STUB_DECL (template_type
));
8434 type_decl
= TYPE_NAME (t
);
8436 if (CLASS_TYPE_P (template_type
))
8438 TREE_PRIVATE (type_decl
)
8439 = TREE_PRIVATE (TYPE_MAIN_DECL (template_type
));
8440 TREE_PROTECTED (type_decl
)
8441 = TREE_PROTECTED (TYPE_MAIN_DECL (template_type
));
8442 if (CLASSTYPE_VISIBILITY_SPECIFIED (template_type
))
8444 DECL_VISIBILITY_SPECIFIED (type_decl
) = 1;
8445 DECL_VISIBILITY (type_decl
) = CLASSTYPE_VISIBILITY (template_type
);
8449 if (OVERLOAD_TYPE_P (t
)
8450 && !DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
8452 static const char *tags
[] = {"abi_tag", "may_alias"};
8454 for (unsigned ix
= 0; ix
!= 2; ix
++)
8457 = lookup_attribute (tags
[ix
], TYPE_ATTRIBUTES (template_type
));
8461 else if (!TREE_CHAIN (attributes
) && !TYPE_ATTRIBUTES (t
))
8462 TYPE_ATTRIBUTES (t
) = attributes
;
8465 = tree_cons (TREE_PURPOSE (attributes
),
8466 TREE_VALUE (attributes
),
8467 TYPE_ATTRIBUTES (t
));
8471 /* Let's consider the explicit specialization of a member
8472 of a class template specialization that is implicitly instantiated,
8477 template<class U> struct M {}; //#0
8482 struct S<int>::M<char> //#1
8486 [temp.expl.spec]/4 says this is valid.
8488 In this case, when we write:
8491 M is instantiated from the CLASSTYPE_TI_TEMPLATE of #1, not from
8494 When we encounter #1, we want to store the partial instantiation
8495 of M (template<class T> S<int>::M<T>) in its CLASSTYPE_TI_TEMPLATE.
8497 For all cases other than this "explicit specialization of member of a
8498 class template", we just want to store the most general template into
8499 the CLASSTYPE_TI_TEMPLATE of M.
8501 This case of "explicit specialization of member of a class template"
8503 1/ the enclosing class is an instantiation of, and therefore not
8504 the same as, the context of the most general template, and
8505 2/ we aren't looking at the partial instantiation itself, i.e.
8506 the innermost arguments are not the same as the innermost parms of
8507 the most general template.
8509 So it's only when 1/ and 2/ happens that we want to use the partial
8510 instantiation of the member template in lieu of its most general
8513 if (PRIMARY_TEMPLATE_P (gen_tmpl
)
8514 && TMPL_ARGS_HAVE_MULTIPLE_LEVELS (arglist
)
8515 /* the enclosing class must be an instantiation... */
8516 && CLASS_TYPE_P (context
)
8517 && !same_type_p (context
, DECL_CONTEXT (gen_tmpl
)))
8519 tree partial_inst_args
;
8520 TREE_VEC_LENGTH (arglist
)--;
8521 ++processing_template_decl
;
8523 tsubst (INNERMOST_TEMPLATE_ARGS
8524 (TYPE_TI_ARGS (TREE_TYPE (gen_tmpl
))),
8525 arglist
, complain
, NULL_TREE
);
8526 --processing_template_decl
;
8527 TREE_VEC_LENGTH (arglist
)++;
8528 use_partial_inst_tmpl
=
8529 /*...and we must not be looking at the partial instantiation
8531 !comp_template_args (INNERMOST_TEMPLATE_ARGS (arglist
),
8535 if (!use_partial_inst_tmpl
)
8536 /* This case is easy; there are no member templates involved. */
8540 /* This is a full instantiation of a member template. Find
8541 the partial instantiation of which this is an instance. */
8543 /* Temporarily reduce by one the number of levels in the ARGLIST
8544 so as to avoid comparing the last set of arguments. */
8545 TREE_VEC_LENGTH (arglist
)--;
8546 found
= tsubst (gen_tmpl
, arglist
, complain
, NULL_TREE
);
8547 TREE_VEC_LENGTH (arglist
)++;
8548 /* FOUND is either a proper class type, or an alias
8549 template specialization. In the later case, it's a
8550 TYPE_DECL, resulting from the substituting of arguments
8551 for parameters in the TYPE_DECL of the alias template
8552 done earlier. So be careful while getting the template
8554 found
= TREE_CODE (found
) == TYPE_DECL
8555 ? TYPE_TI_TEMPLATE (TREE_TYPE (found
))
8556 : CLASSTYPE_TI_TEMPLATE (found
);
8559 // Build template info for the new specialization.
8560 SET_TYPE_TEMPLATE_INFO (t
, build_template_info (found
, arglist
));
8563 slot
= type_specializations
->find_slot_with_hash (&elt
, hash
, INSERT
);
8564 entry
= ggc_alloc
<spec_entry
> ();
8568 /* Note this use of the partial instantiation so we can check it
8569 later in maybe_process_partial_specialization. */
8570 DECL_TEMPLATE_INSTANTIATIONS (found
)
8571 = tree_cons (arglist
, t
,
8572 DECL_TEMPLATE_INSTANTIATIONS (found
));
8574 if (TREE_CODE (template_type
) == ENUMERAL_TYPE
&& !is_dependent_type
8575 && !DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
8576 /* Now that the type has been registered on the instantiations
8577 list, we set up the enumerators. Because the enumeration
8578 constants may involve the enumeration type itself, we make
8579 sure to register the type first, and then create the
8580 constants. That way, doing tsubst_expr for the enumeration
8581 constants won't result in recursive calls here; we'll find
8582 the instantiation and exit above. */
8583 tsubst_enum (template_type
, t
, arglist
);
8585 if (CLASS_TYPE_P (template_type
) && is_dependent_type
)
8586 /* If the type makes use of template parameters, the
8587 code that generates debugging information will crash. */
8588 DECL_IGNORED_P (TYPE_MAIN_DECL (t
)) = 1;
8590 /* Possibly limit visibility based on template args. */
8591 TREE_PUBLIC (type_decl
) = 1;
8592 determine_visibility (type_decl
);
8594 inherit_targ_abi_tags (t
);
8600 /* Wrapper for lookup_template_class_1. */
8603 lookup_template_class (tree d1
, tree arglist
, tree in_decl
, tree context
,
8604 int entering_scope
, tsubst_flags_t complain
)
8607 timevar_push (TV_TEMPLATE_INST
);
8608 ret
= lookup_template_class_1 (d1
, arglist
, in_decl
, context
,
8609 entering_scope
, complain
);
8610 timevar_pop (TV_TEMPLATE_INST
);
8614 /* Return a TEMPLATE_ID_EXPR for the given variable template and ARGLIST. */
8617 lookup_template_variable (tree templ
, tree arglist
)
8619 /* The type of the expression is NULL_TREE since the template-id could refer
8620 to an explicit or partial specialization. */
8621 tree type
= NULL_TREE
;
8622 if (flag_concepts
&& variable_concept_p (templ
))
8623 /* Except that concepts are always bool. */
8624 type
= boolean_type_node
;
8625 return build2 (TEMPLATE_ID_EXPR
, type
, templ
, arglist
);
8628 /* Instantiate a variable declaration from a TEMPLATE_ID_EXPR for use. */
8631 finish_template_variable (tree var
, tsubst_flags_t complain
)
8633 tree templ
= TREE_OPERAND (var
, 0);
8634 tree arglist
= TREE_OPERAND (var
, 1);
8636 /* We never want to return a VAR_DECL for a variable concept, since they
8637 aren't instantiated. In a template, leave the TEMPLATE_ID_EXPR alone. */
8638 bool concept_p
= flag_concepts
&& variable_concept_p (templ
);
8639 if (concept_p
&& processing_template_decl
)
8642 tree tmpl_args
= DECL_TI_ARGS (DECL_TEMPLATE_RESULT (templ
));
8643 arglist
= add_outermost_template_args (tmpl_args
, arglist
);
8645 tree parms
= DECL_TEMPLATE_PARMS (templ
);
8646 arglist
= coerce_innermost_template_parms (parms
, arglist
, templ
, complain
,
8648 /*use_default*/true);
8650 if (flag_concepts
&& !constraints_satisfied_p (templ
, arglist
))
8652 if (complain
& tf_error
)
8654 error ("constraints for %qD not satisfied", templ
);
8655 diagnose_constraints (location_of (var
), templ
, arglist
);
8657 return error_mark_node
;
8660 /* If a template-id refers to a specialization of a variable
8661 concept, then the expression is true if and only if the
8662 concept's constraints are satisfied by the given template
8665 NOTE: This is an extension of Concepts Lite TS that
8666 allows constraints to be used in expressions. */
8669 tree decl
= DECL_TEMPLATE_RESULT (templ
);
8670 return evaluate_variable_concept (decl
, arglist
);
8673 return instantiate_template (templ
, arglist
, complain
);
8680 /* True when we should also visit template parameters that occur in
8681 non-deduced contexts. */
8682 bool include_nondeduced_p
;
8683 hash_set
<tree
> *visited
;
8686 /* Called from for_each_template_parm via walk_tree. */
8689 for_each_template_parm_r (tree
*tp
, int *walk_subtrees
, void *d
)
8692 struct pair_fn_data
*pfd
= (struct pair_fn_data
*) d
;
8693 tree_fn_t fn
= pfd
->fn
;
8694 void *data
= pfd
->data
;
8697 && (pfd
->include_nondeduced_p
|| TREE_CODE (t
) != TYPENAME_TYPE
)
8698 && for_each_template_parm (TYPE_CONTEXT (t
), fn
, data
, pfd
->visited
,
8699 pfd
->include_nondeduced_p
))
8700 return error_mark_node
;
8702 switch (TREE_CODE (t
))
8705 if (TYPE_PTRMEMFUNC_P (t
))
8711 if (!TYPE_TEMPLATE_INFO (t
))
8713 else if (for_each_template_parm (TYPE_TI_ARGS (t
),
8714 fn
, data
, pfd
->visited
,
8715 pfd
->include_nondeduced_p
))
8716 return error_mark_node
;
8720 if (for_each_template_parm (TYPE_MIN_VALUE (t
),
8721 fn
, data
, pfd
->visited
,
8722 pfd
->include_nondeduced_p
)
8723 || for_each_template_parm (TYPE_MAX_VALUE (t
),
8724 fn
, data
, pfd
->visited
,
8725 pfd
->include_nondeduced_p
))
8726 return error_mark_node
;
8730 /* Since we're not going to walk subtrees, we have to do this
8732 if (for_each_template_parm (TYPE_METHOD_BASETYPE (t
), fn
, data
,
8733 pfd
->visited
, pfd
->include_nondeduced_p
))
8734 return error_mark_node
;
8738 /* Check the return type. */
8739 if (for_each_template_parm (TREE_TYPE (t
), fn
, data
, pfd
->visited
,
8740 pfd
->include_nondeduced_p
))
8741 return error_mark_node
;
8743 /* Check the parameter types. Since default arguments are not
8744 instantiated until they are needed, the TYPE_ARG_TYPES may
8745 contain expressions that involve template parameters. But,
8746 no-one should be looking at them yet. And, once they're
8747 instantiated, they don't contain template parameters, so
8748 there's no point in looking at them then, either. */
8752 for (parm
= TYPE_ARG_TYPES (t
); parm
; parm
= TREE_CHAIN (parm
))
8753 if (for_each_template_parm (TREE_VALUE (parm
), fn
, data
,
8754 pfd
->visited
, pfd
->include_nondeduced_p
))
8755 return error_mark_node
;
8757 /* Since we've already handled the TYPE_ARG_TYPES, we don't
8758 want walk_tree walking into them itself. */
8764 case UNDERLYING_TYPE
:
8765 if (pfd
->include_nondeduced_p
8766 && for_each_template_parm (TYPE_VALUES_RAW (t
), fn
, data
,
8768 pfd
->include_nondeduced_p
))
8769 return error_mark_node
;
8774 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
)
8775 && for_each_template_parm (DECL_TI_ARGS (t
), fn
, data
,
8776 pfd
->visited
, pfd
->include_nondeduced_p
))
8777 return error_mark_node
;
8782 if (TREE_CODE (t
) == CONST_DECL
&& DECL_TEMPLATE_PARM_P (t
)
8783 && for_each_template_parm (DECL_INITIAL (t
), fn
, data
,
8784 pfd
->visited
, pfd
->include_nondeduced_p
))
8785 return error_mark_node
;
8786 if (DECL_CONTEXT (t
)
8787 && pfd
->include_nondeduced_p
8788 && for_each_template_parm (DECL_CONTEXT (t
), fn
, data
,
8789 pfd
->visited
, pfd
->include_nondeduced_p
))
8790 return error_mark_node
;
8793 case BOUND_TEMPLATE_TEMPLATE_PARM
:
8794 /* Record template parameters such as `T' inside `TT<T>'. */
8795 if (for_each_template_parm (TYPE_TI_ARGS (t
), fn
, data
, pfd
->visited
,
8796 pfd
->include_nondeduced_p
))
8797 return error_mark_node
;
8800 case TEMPLATE_TEMPLATE_PARM
:
8801 case TEMPLATE_TYPE_PARM
:
8802 case TEMPLATE_PARM_INDEX
:
8803 if (fn
&& (*fn
)(t
, data
))
8804 return error_mark_node
;
8806 return error_mark_node
;
8810 /* A template template parameter is encountered. */
8811 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
)
8812 && for_each_template_parm (TREE_TYPE (t
), fn
, data
, pfd
->visited
,
8813 pfd
->include_nondeduced_p
))
8814 return error_mark_node
;
8816 /* Already substituted template template parameter */
8822 || for_each_template_parm (TYPENAME_TYPE_FULLNAME (t
), fn
,
8824 pfd
->include_nondeduced_p
))
8825 return error_mark_node
;
8829 if (TREE_TYPE (t
) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t
))
8830 && pfd
->include_nondeduced_p
8831 && for_each_template_parm (TYPE_PTRMEMFUNC_FN_TYPE
8832 (TREE_TYPE (t
)), fn
, data
,
8833 pfd
->visited
, pfd
->include_nondeduced_p
))
8834 return error_mark_node
;
8839 /* If there's no type, then this thing must be some expression
8840 involving template parameters. */
8841 if (!fn
&& !TREE_TYPE (t
))
8842 return error_mark_node
;
8847 case IMPLICIT_CONV_EXPR
:
8848 case REINTERPRET_CAST_EXPR
:
8849 case CONST_CAST_EXPR
:
8850 case STATIC_CAST_EXPR
:
8851 case DYNAMIC_CAST_EXPR
:
8855 case PSEUDO_DTOR_EXPR
:
8857 return error_mark_node
;
8864 /* We didn't find any template parameters we liked. */
8868 /* For each TEMPLATE_TYPE_PARM, TEMPLATE_TEMPLATE_PARM,
8869 BOUND_TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX in T,
8870 call FN with the parameter and the DATA.
8871 If FN returns nonzero, the iteration is terminated, and
8872 for_each_template_parm returns 1. Otherwise, the iteration
8873 continues. If FN never returns a nonzero value, the value
8874 returned by for_each_template_parm is 0. If FN is NULL, it is
8875 considered to be the function which always returns 1.
8877 If INCLUDE_NONDEDUCED_P, then this routine will also visit template
8878 parameters that occur in non-deduced contexts. When false, only
8879 visits those template parameters that can be deduced. */
8882 for_each_template_parm (tree t
, tree_fn_t fn
, void* data
,
8883 hash_set
<tree
> *visited
,
8884 bool include_nondeduced_p
)
8886 struct pair_fn_data pfd
;
8892 pfd
.include_nondeduced_p
= include_nondeduced_p
;
8894 /* Walk the tree. (Conceptually, we would like to walk without
8895 duplicates, but for_each_template_parm_r recursively calls
8896 for_each_template_parm, so we would need to reorganize a fair
8897 bit to use walk_tree_without_duplicates, so we keep our own
8900 pfd
.visited
= visited
;
8902 pfd
.visited
= new hash_set
<tree
>;
8903 result
= cp_walk_tree (&t
,
8904 for_each_template_parm_r
,
8906 pfd
.visited
) != NULL_TREE
;
8918 /* Returns true if T depends on any template parameter. */
8921 uses_template_parms (tree t
)
8927 int saved_processing_template_decl
;
8929 saved_processing_template_decl
= processing_template_decl
;
8930 if (!saved_processing_template_decl
)
8931 processing_template_decl
= 1;
8933 dependent_p
= dependent_type_p (t
);
8934 else if (TREE_CODE (t
) == TREE_VEC
)
8935 dependent_p
= any_dependent_template_arguments_p (t
);
8936 else if (TREE_CODE (t
) == TREE_LIST
)
8937 dependent_p
= (uses_template_parms (TREE_VALUE (t
))
8938 || uses_template_parms (TREE_CHAIN (t
)));
8939 else if (TREE_CODE (t
) == TYPE_DECL
)
8940 dependent_p
= dependent_type_p (TREE_TYPE (t
));
8943 || TREE_CODE (t
) == TEMPLATE_PARM_INDEX
8944 || TREE_CODE (t
) == OVERLOAD
8947 || TREE_CODE (t
) == TRAIT_EXPR
8948 || TREE_CODE (t
) == CONSTRUCTOR
8949 || CONSTANT_CLASS_P (t
))
8950 dependent_p
= (type_dependent_expression_p (t
)
8951 || value_dependent_expression_p (t
));
8954 gcc_assert (t
== error_mark_node
);
8955 dependent_p
= false;
8958 processing_template_decl
= saved_processing_template_decl
;
8963 /* Returns true iff current_function_decl is an incompletely instantiated
8964 template. Useful instead of processing_template_decl because the latter
8965 is set to 0 during instantiate_non_dependent_expr. */
8968 in_template_function (void)
8970 tree fn
= current_function_decl
;
8972 ++processing_template_decl
;
8973 ret
= (fn
&& DECL_LANG_SPECIFIC (fn
)
8974 && DECL_TEMPLATE_INFO (fn
)
8975 && any_dependent_template_arguments_p (DECL_TI_ARGS (fn
)));
8976 --processing_template_decl
;
8980 /* Returns true if T depends on any template parameter with level LEVEL. */
8983 uses_template_parms_level (tree t
, int level
)
8985 return for_each_template_parm (t
, template_parm_this_level_p
, &level
, NULL
,
8986 /*include_nondeduced_p=*/true);
8989 /* Returns TRUE iff INST is an instantiation we don't need to do in an
8990 ill-formed translation unit, i.e. a variable or function that isn't
8991 usable in a constant expression. */
8994 neglectable_inst_p (tree d
)
8997 && !(TREE_CODE (d
) == FUNCTION_DECL
? DECL_DECLARED_CONSTEXPR_P (d
)
8998 : decl_maybe_constant_var_p (d
)));
9001 /* Returns TRUE iff we should refuse to instantiate DECL because it's
9002 neglectable and instantiated from within an erroneous instantiation. */
9005 limit_bad_template_recursion (tree decl
)
9007 struct tinst_level
*lev
= current_tinst_level
;
9008 int errs
= errorcount
+ sorrycount
;
9009 if (lev
== NULL
|| errs
== 0 || !neglectable_inst_p (decl
))
9012 for (; lev
; lev
= lev
->next
)
9013 if (neglectable_inst_p (lev
->decl
))
9016 return (lev
&& errs
> lev
->errors
);
9019 static int tinst_depth
;
9020 extern int max_tinst_depth
;
9023 static GTY(()) struct tinst_level
*last_error_tinst_level
;
9025 /* We're starting to instantiate D; record the template instantiation context
9026 for diagnostics and to restore it later. */
9029 push_tinst_level (tree d
)
9031 return push_tinst_level_loc (d
, input_location
);
9034 /* We're starting to instantiate D; record the template instantiation context
9035 at LOC for diagnostics and to restore it later. */
9038 push_tinst_level_loc (tree d
, location_t loc
)
9040 struct tinst_level
*new_level
;
9042 if (tinst_depth
>= max_tinst_depth
)
9044 fatal_error (input_location
,
9045 "template instantiation depth exceeds maximum of %d"
9046 " (use -ftemplate-depth= to increase the maximum)",
9051 /* If the current instantiation caused problems, don't let it instantiate
9052 anything else. Do allow deduction substitution and decls usable in
9053 constant expressions. */
9054 if (limit_bad_template_recursion (d
))
9057 new_level
= ggc_alloc
<tinst_level
> ();
9058 new_level
->decl
= d
;
9059 new_level
->locus
= loc
;
9060 new_level
->errors
= errorcount
+sorrycount
;
9061 new_level
->in_system_header_p
= in_system_header_at (input_location
);
9062 new_level
->next
= current_tinst_level
;
9063 current_tinst_level
= new_level
;
9066 if (GATHER_STATISTICS
&& (tinst_depth
> depth_reached
))
9067 depth_reached
= tinst_depth
;
9072 /* We're done instantiating this template; return to the instantiation
9076 pop_tinst_level (void)
9078 /* Restore the filename and line number stashed away when we started
9079 this instantiation. */
9080 input_location
= current_tinst_level
->locus
;
9081 current_tinst_level
= current_tinst_level
->next
;
9085 /* We're instantiating a deferred template; restore the template
9086 instantiation context in which the instantiation was requested, which
9087 is one step out from LEVEL. Return the corresponding DECL or TYPE. */
9090 reopen_tinst_level (struct tinst_level
*level
)
9092 struct tinst_level
*t
;
9095 for (t
= level
; t
; t
= t
->next
)
9098 current_tinst_level
= level
;
9100 if (current_tinst_level
)
9101 current_tinst_level
->errors
= errorcount
+sorrycount
;
9105 /* Returns the TINST_LEVEL which gives the original instantiation
9108 struct tinst_level
*
9109 outermost_tinst_level (void)
9111 struct tinst_level
*level
= current_tinst_level
;
9114 level
= level
->next
;
9118 /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the
9119 vector of template arguments, as for tsubst.
9121 Returns an appropriate tsubst'd friend declaration. */
9124 tsubst_friend_function (tree decl
, tree args
)
9128 if (TREE_CODE (decl
) == FUNCTION_DECL
9129 && DECL_TEMPLATE_INSTANTIATION (decl
)
9130 && TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
9131 /* This was a friend declared with an explicit template
9132 argument list, e.g.:
9136 to indicate that f was a template instantiation, not a new
9137 function declaration. Now, we have to figure out what
9138 instantiation of what template. */
9140 tree template_id
, arglist
, fns
;
9143 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (current_class_type
));
9145 /* Friend functions are looked up in the containing namespace scope.
9146 We must enter that scope, to avoid finding member functions of the
9147 current class with same name. */
9148 push_nested_namespace (ns
);
9149 fns
= tsubst_expr (DECL_TI_TEMPLATE (decl
), args
,
9150 tf_warning_or_error
, NULL_TREE
,
9151 /*integral_constant_expression_p=*/false);
9152 pop_nested_namespace (ns
);
9153 arglist
= tsubst (DECL_TI_ARGS (decl
), args
,
9154 tf_warning_or_error
, NULL_TREE
);
9155 template_id
= lookup_template_function (fns
, arglist
);
9157 new_friend
= tsubst (decl
, args
, tf_warning_or_error
, NULL_TREE
);
9158 tmpl
= determine_specialization (template_id
, new_friend
,
9160 /*need_member_template=*/0,
9161 TREE_VEC_LENGTH (args
),
9163 return instantiate_template (tmpl
, new_args
, tf_error
);
9166 new_friend
= tsubst (decl
, args
, tf_warning_or_error
, NULL_TREE
);
9168 /* The NEW_FRIEND will look like an instantiation, to the
9169 compiler, but is not an instantiation from the point of view of
9170 the language. For example, we might have had:
9172 template <class T> struct S {
9173 template <class U> friend void f(T, U);
9176 Then, in S<int>, template <class U> void f(int, U) is not an
9177 instantiation of anything. */
9178 if (new_friend
== error_mark_node
)
9179 return error_mark_node
;
9181 DECL_USE_TEMPLATE (new_friend
) = 0;
9182 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
9184 DECL_USE_TEMPLATE (DECL_TEMPLATE_RESULT (new_friend
)) = 0;
9185 DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (new_friend
))
9186 = DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (decl
));
9189 /* The mangled name for the NEW_FRIEND is incorrect. The function
9190 is not a template instantiation and should not be mangled like
9191 one. Therefore, we forget the mangling here; we'll recompute it
9192 later if we need it. */
9193 if (TREE_CODE (new_friend
) != TEMPLATE_DECL
)
9195 SET_DECL_RTL (new_friend
, NULL
);
9196 SET_DECL_ASSEMBLER_NAME (new_friend
, NULL_TREE
);
9199 if (DECL_NAMESPACE_SCOPE_P (new_friend
))
9202 tree new_friend_template_info
;
9203 tree new_friend_result_template_info
;
9205 int new_friend_is_defn
;
9207 /* We must save some information from NEW_FRIEND before calling
9208 duplicate decls since that function will free NEW_FRIEND if
9210 new_friend_template_info
= DECL_TEMPLATE_INFO (new_friend
);
9211 new_friend_is_defn
=
9212 (DECL_INITIAL (DECL_TEMPLATE_RESULT
9213 (template_for_substitution (new_friend
)))
9215 if (TREE_CODE (new_friend
) == TEMPLATE_DECL
)
9217 /* This declaration is a `primary' template. */
9218 DECL_PRIMARY_TEMPLATE (new_friend
) = new_friend
;
9220 new_friend_result_template_info
9221 = DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (new_friend
));
9224 new_friend_result_template_info
= NULL_TREE
;
9226 /* Make the init_value nonzero so pushdecl knows this is a defn. */
9227 if (new_friend_is_defn
)
9228 DECL_INITIAL (new_friend
) = error_mark_node
;
9230 /* Inside pushdecl_namespace_level, we will push into the
9231 current namespace. However, the friend function should go
9232 into the namespace of the template. */
9233 ns
= decl_namespace_context (new_friend
);
9234 push_nested_namespace (ns
);
9235 old_decl
= pushdecl_namespace_level (new_friend
, /*is_friend=*/true);
9236 pop_nested_namespace (ns
);
9238 if (old_decl
== error_mark_node
)
9239 return error_mark_node
;
9241 if (old_decl
!= new_friend
)
9243 /* This new friend declaration matched an existing
9244 declaration. For example, given:
9246 template <class T> void f(T);
9247 template <class U> class C {
9248 template <class T> friend void f(T) {}
9251 the friend declaration actually provides the definition
9252 of `f', once C has been instantiated for some type. So,
9253 old_decl will be the out-of-class template declaration,
9254 while new_friend is the in-class definition.
9256 But, if `f' was called before this point, the
9257 instantiation of `f' will have DECL_TI_ARGS corresponding
9258 to `T' but not to `U', references to which might appear
9259 in the definition of `f'. Previously, the most general
9260 template for an instantiation of `f' was the out-of-class
9261 version; now it is the in-class version. Therefore, we
9262 run through all specialization of `f', adding to their
9263 DECL_TI_ARGS appropriately. In particular, they need a
9264 new set of outer arguments, corresponding to the
9265 arguments for this class instantiation.
9267 The same situation can arise with something like this:
9270 template <class T> class C {
9274 when `C<int>' is instantiated. Now, `f(int)' is defined
9277 if (!new_friend_is_defn
)
9278 /* On the other hand, if the in-class declaration does
9279 *not* provide a definition, then we don't want to alter
9280 existing definitions. We can just leave everything
9285 tree new_template
= TI_TEMPLATE (new_friend_template_info
);
9286 tree new_args
= TI_ARGS (new_friend_template_info
);
9288 /* Overwrite whatever template info was there before, if
9289 any, with the new template information pertaining to
9291 DECL_TEMPLATE_INFO (old_decl
) = new_friend_template_info
;
9293 if (TREE_CODE (old_decl
) != TEMPLATE_DECL
)
9295 /* We should have called reregister_specialization in
9297 gcc_assert (retrieve_specialization (new_template
,
9301 /* Instantiate it if the global has already been used. */
9302 if (DECL_ODR_USED (old_decl
))
9303 instantiate_decl (old_decl
, /*defer_ok=*/true,
9304 /*expl_inst_class_mem_p=*/false);
9310 /* Indicate that the old function template is a partial
9312 DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (old_decl
))
9313 = new_friend_result_template_info
;
9315 gcc_assert (new_template
9316 == most_general_template (new_template
));
9317 gcc_assert (new_template
!= old_decl
);
9319 /* Reassign any specializations already in the hash table
9320 to the new more general template, and add the
9321 additional template args. */
9322 for (t
= DECL_TEMPLATE_INSTANTIATIONS (old_decl
);
9326 tree spec
= TREE_VALUE (t
);
9329 elt
.tmpl
= old_decl
;
9330 elt
.args
= DECL_TI_ARGS (spec
);
9331 elt
.spec
= NULL_TREE
;
9333 decl_specializations
->remove_elt (&elt
);
9336 = add_outermost_template_args (new_args
,
9337 DECL_TI_ARGS (spec
));
9339 register_specialization
9340 (spec
, new_template
, DECL_TI_ARGS (spec
), true, 0);
9343 DECL_TEMPLATE_INSTANTIATIONS (old_decl
) = NULL_TREE
;
9347 /* The information from NEW_FRIEND has been merged into OLD_DECL
9348 by duplicate_decls. */
9349 new_friend
= old_decl
;
9354 tree context
= DECL_CONTEXT (new_friend
);
9358 template <class T> class C {
9359 template <class U> friend void C1<U>::f (); // case 1
9360 friend void C2<T>::f (); // case 2
9362 we only need to make sure CONTEXT is a complete type for
9363 case 2. To distinguish between the two cases, we note that
9364 CONTEXT of case 1 remains dependent type after tsubst while
9365 this isn't true for case 2. */
9366 ++processing_template_decl
;
9367 dependent_p
= dependent_type_p (context
);
9368 --processing_template_decl
;
9371 && !complete_type_or_else (context
, NULL_TREE
))
9372 return error_mark_node
;
9374 if (COMPLETE_TYPE_P (context
))
9376 tree fn
= new_friend
;
9377 /* do_friend adds the TEMPLATE_DECL for any member friend
9378 template even if it isn't a member template, i.e.
9379 template <class T> friend A<T>::f();
9380 Look through it in that case. */
9381 if (TREE_CODE (fn
) == TEMPLATE_DECL
9382 && !PRIMARY_TEMPLATE_P (fn
))
9383 fn
= DECL_TEMPLATE_RESULT (fn
);
9384 /* Check to see that the declaration is really present, and,
9385 possibly obtain an improved declaration. */
9386 fn
= check_classfn (context
, fn
, NULL_TREE
);
9396 /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of
9397 template arguments, as for tsubst.
9399 Returns an appropriate tsubst'd friend type or error_mark_node on
9403 tsubst_friend_class (tree friend_tmpl
, tree args
)
9409 if (DECL_TEMPLATE_TEMPLATE_PARM_P (friend_tmpl
))
9411 tree t
= tsubst (TREE_TYPE (friend_tmpl
), args
, tf_none
, NULL_TREE
);
9412 return TREE_TYPE (t
);
9415 context
= CP_DECL_CONTEXT (friend_tmpl
);
9417 if (context
!= global_namespace
)
9419 if (TREE_CODE (context
) == NAMESPACE_DECL
)
9420 push_nested_namespace (context
);
9422 push_nested_class (tsubst (context
, args
, tf_none
, NULL_TREE
));
9425 /* Look for a class template declaration. We look for hidden names
9426 because two friend declarations of the same template are the
9427 same. For example, in:
9430 template <typename> friend class F;
9432 template <typename> struct B {
9433 template <typename> friend class F;
9436 both F templates are the same. */
9437 tmpl
= lookup_name_real (DECL_NAME (friend_tmpl
), 0, 0,
9438 /*block_p=*/true, 0, LOOKUP_HIDDEN
);
9440 /* But, if we don't find one, it might be because we're in a
9441 situation like this:
9449 Here, in the scope of (say) S<int>, `S' is bound to a TYPE_DECL
9450 for `S<int>', not the TEMPLATE_DECL. */
9451 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
9453 tmpl
= lookup_name_prefer_type (DECL_NAME (friend_tmpl
), 1);
9454 tmpl
= maybe_get_template_decl_from_type_decl (tmpl
);
9457 if (tmpl
&& DECL_CLASS_TEMPLATE_P (tmpl
))
9459 /* The friend template has already been declared. Just
9460 check to see that the declarations match, and install any new
9461 default parameters. We must tsubst the default parameters,
9462 of course. We only need the innermost template parameters
9463 because that is all that redeclare_class_template will look
9465 if (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (friend_tmpl
))
9466 > TMPL_ARGS_DEPTH (args
))
9469 location_t saved_input_location
;
9470 parms
= tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_tmpl
),
9471 args
, tf_warning_or_error
);
9473 saved_input_location
= input_location
;
9474 input_location
= DECL_SOURCE_LOCATION (friend_tmpl
);
9475 tree cons
= get_constraints (tmpl
);
9476 redeclare_class_template (TREE_TYPE (tmpl
), parms
, cons
);
9477 input_location
= saved_input_location
;
9481 friend_type
= TREE_TYPE (tmpl
);
9485 /* The friend template has not already been declared. In this
9486 case, the instantiation of the template class will cause the
9487 injection of this template into the global scope. */
9488 tmpl
= tsubst (friend_tmpl
, args
, tf_warning_or_error
, NULL_TREE
);
9489 if (tmpl
== error_mark_node
)
9490 return error_mark_node
;
9492 /* The new TMPL is not an instantiation of anything, so we
9493 forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE for
9494 the new type because that is supposed to be the corresponding
9495 template decl, i.e., TMPL. */
9496 DECL_USE_TEMPLATE (tmpl
) = 0;
9497 DECL_TEMPLATE_INFO (tmpl
) = NULL_TREE
;
9498 CLASSTYPE_USE_TEMPLATE (TREE_TYPE (tmpl
)) = 0;
9499 CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl
))
9500 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl
)));
9502 /* Inject this template into the global scope. */
9503 friend_type
= TREE_TYPE (pushdecl_top_level_maybe_friend (tmpl
, true));
9506 if (context
!= global_namespace
)
9508 if (TREE_CODE (context
) == NAMESPACE_DECL
)
9509 pop_nested_namespace (context
);
9511 pop_nested_class ();
9517 /* Returns zero if TYPE cannot be completed later due to circularity.
9518 Otherwise returns one. */
9521 can_complete_type_without_circularity (tree type
)
9523 if (type
== NULL_TREE
|| type
== error_mark_node
)
9525 else if (COMPLETE_TYPE_P (type
))
9527 else if (TREE_CODE (type
) == ARRAY_TYPE
&& TYPE_DOMAIN (type
))
9528 return can_complete_type_without_circularity (TREE_TYPE (type
));
9529 else if (CLASS_TYPE_P (type
)
9530 && TYPE_BEING_DEFINED (TYPE_MAIN_VARIANT (type
)))
9536 static tree
tsubst_omp_clauses (tree
, bool, bool, tree
, tsubst_flags_t
, tree
);
9538 /* Apply any attributes which had to be deferred until instantiation
9539 time. DECL_P, ATTRIBUTES and ATTR_FLAGS are as cplus_decl_attributes;
9540 ARGS, COMPLAIN, IN_DECL are as tsubst. */
9543 apply_late_template_attributes (tree
*decl_p
, tree attributes
, int attr_flags
,
9544 tree args
, tsubst_flags_t complain
, tree in_decl
)
9546 tree last_dep
= NULL_TREE
;
9550 for (t
= attributes
; t
; t
= TREE_CHAIN (t
))
9551 if (ATTR_IS_DEPENDENT (t
))
9554 attributes
= copy_list (attributes
);
9558 if (DECL_P (*decl_p
))
9560 if (TREE_TYPE (*decl_p
) == error_mark_node
)
9562 p
= &DECL_ATTRIBUTES (*decl_p
);
9565 p
= &TYPE_ATTRIBUTES (*decl_p
);
9569 tree late_attrs
= NULL_TREE
;
9570 tree
*q
= &late_attrs
;
9572 for (*p
= attributes
; *p
; )
9575 if (ATTR_IS_DEPENDENT (t
))
9577 *p
= TREE_CHAIN (t
);
9578 TREE_CHAIN (t
) = NULL_TREE
;
9579 if ((flag_openmp
|| flag_openmp_simd
|| flag_cilkplus
)
9580 && is_attribute_p ("omp declare simd",
9581 get_attribute_name (t
))
9584 tree clauses
= TREE_VALUE (TREE_VALUE (t
));
9585 clauses
= tsubst_omp_clauses (clauses
, true, false, args
,
9587 c_omp_declare_simd_clauses_to_decls (*decl_p
, clauses
);
9588 clauses
= finish_omp_clauses (clauses
, false, true);
9589 tree parms
= DECL_ARGUMENTS (*decl_p
);
9591 = c_omp_declare_simd_clauses_to_numbers (parms
, clauses
);
9593 TREE_VALUE (TREE_VALUE (t
)) = clauses
;
9595 TREE_VALUE (t
) = NULL_TREE
;
9597 /* If the first attribute argument is an identifier, don't
9598 pass it through tsubst. Attributes like mode, format,
9599 cleanup and several target specific attributes expect it
9601 else if (attribute_takes_identifier_p (get_attribute_name (t
))
9605 = tsubst_expr (TREE_CHAIN (TREE_VALUE (t
)), args
, complain
,
9607 /*integral_constant_expression_p=*/false);
9608 if (chain
!= TREE_CHAIN (TREE_VALUE (t
)))
9610 = tree_cons (NULL_TREE
, TREE_VALUE (TREE_VALUE (t
)),
9613 else if (TREE_VALUE (t
) && PACK_EXPANSION_P (TREE_VALUE (t
)))
9615 /* An attribute pack expansion. */
9616 tree purp
= TREE_PURPOSE (t
);
9617 tree pack
= (tsubst_pack_expansion
9618 (TREE_VALUE (t
), args
, complain
, in_decl
));
9619 int len
= TREE_VEC_LENGTH (pack
);
9620 for (int i
= 0; i
< len
; ++i
)
9622 tree elt
= TREE_VEC_ELT (pack
, i
);
9623 *q
= build_tree_list (purp
, elt
);
9624 q
= &TREE_CHAIN (*q
);
9630 = tsubst_expr (TREE_VALUE (t
), args
, complain
, in_decl
,
9631 /*integral_constant_expression_p=*/false);
9633 q
= &TREE_CHAIN (t
);
9636 p
= &TREE_CHAIN (t
);
9639 cplus_decl_attributes (decl_p
, late_attrs
, attr_flags
);
9643 /* Perform (or defer) access check for typedefs that were referenced
9644 from within the template TMPL code.
9645 This is a subroutine of instantiate_decl and instantiate_class_template.
9646 TMPL is the template to consider and TARGS is the list of arguments of
9650 perform_typedefs_access_check (tree tmpl
, tree targs
)
9652 location_t saved_location
;
9654 qualified_typedef_usage_t
*iter
;
9657 || (!CLASS_TYPE_P (tmpl
)
9658 && TREE_CODE (tmpl
) != FUNCTION_DECL
))
9661 saved_location
= input_location
;
9662 FOR_EACH_VEC_SAFE_ELT (get_types_needing_access_check (tmpl
), i
, iter
)
9664 tree type_decl
= iter
->typedef_decl
;
9665 tree type_scope
= iter
->context
;
9667 if (!type_decl
|| !type_scope
|| !CLASS_TYPE_P (type_scope
))
9670 if (uses_template_parms (type_decl
))
9671 type_decl
= tsubst (type_decl
, targs
, tf_error
, NULL_TREE
);
9672 if (uses_template_parms (type_scope
))
9673 type_scope
= tsubst (type_scope
, targs
, tf_error
, NULL_TREE
);
9675 /* Make access check error messages point to the location
9676 of the use of the typedef. */
9677 input_location
= iter
->locus
;
9678 perform_or_defer_access_check (TYPE_BINFO (type_scope
),
9679 type_decl
, type_decl
,
9680 tf_warning_or_error
);
9682 input_location
= saved_location
;
9686 instantiate_class_template_1 (tree type
)
9688 tree templ
, args
, pattern
, t
, member
;
9692 unsigned int saved_maximum_field_alignment
;
9695 if (type
== error_mark_node
)
9696 return error_mark_node
;
9698 if (COMPLETE_OR_OPEN_TYPE_P (type
)
9699 || uses_template_parms (type
))
9702 /* Figure out which template is being instantiated. */
9703 templ
= most_general_template (CLASSTYPE_TI_TEMPLATE (type
));
9704 gcc_assert (TREE_CODE (templ
) == TEMPLATE_DECL
);
9706 /* Determine what specialization of the original template to
9708 t
= most_specialized_partial_spec (type
, tf_warning_or_error
);
9709 if (t
== error_mark_node
)
9711 TYPE_BEING_DEFINED (type
) = 1;
9712 return error_mark_node
;
9716 /* This TYPE is actually an instantiation of a partial
9717 specialization. We replace the innermost set of ARGS with
9718 the arguments appropriate for substitution. For example,
9721 template <class T> struct S {};
9722 template <class T> struct S<T*> {};
9724 and supposing that we are instantiating S<int*>, ARGS will
9725 presently be {int*} -- but we need {int}. */
9726 pattern
= TREE_TYPE (t
);
9727 args
= TREE_PURPOSE (t
);
9731 pattern
= TREE_TYPE (templ
);
9732 args
= CLASSTYPE_TI_ARGS (type
);
9735 /* If the template we're instantiating is incomplete, then clearly
9736 there's nothing we can do. */
9737 if (!COMPLETE_TYPE_P (pattern
))
9740 /* If we've recursively instantiated too many templates, stop. */
9741 if (! push_tinst_level (type
))
9744 /* Now we're really doing the instantiation. Mark the type as in
9745 the process of being defined. */
9746 TYPE_BEING_DEFINED (type
) = 1;
9748 /* We may be in the middle of deferred access check. Disable
9750 push_deferring_access_checks (dk_no_deferred
);
9752 int saved_unevaluated_operand
= cp_unevaluated_operand
;
9753 int saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
9755 fn_context
= decl_function_context (TYPE_MAIN_DECL (type
));
9756 /* Also avoid push_to_top_level for a lambda in an NSDMI. */
9757 if (!fn_context
&& LAMBDA_TYPE_P (type
) && TYPE_CLASS_SCOPE_P (type
))
9758 fn_context
= error_mark_node
;
9760 push_to_top_level ();
9763 cp_unevaluated_operand
= 0;
9764 c_inhibit_evaluation_warnings
= 0;
9766 /* Use #pragma pack from the template context. */
9767 saved_maximum_field_alignment
= maximum_field_alignment
;
9768 maximum_field_alignment
= TYPE_PRECISION (pattern
);
9770 SET_CLASSTYPE_INTERFACE_UNKNOWN (type
);
9772 /* Set the input location to the most specialized template definition.
9773 This is needed if tsubsting causes an error. */
9774 typedecl
= TYPE_MAIN_DECL (pattern
);
9775 input_location
= DECL_SOURCE_LOCATION (TYPE_NAME (type
)) =
9776 DECL_SOURCE_LOCATION (typedecl
);
9778 TYPE_PACKED (type
) = TYPE_PACKED (pattern
);
9779 TYPE_ALIGN (type
) = TYPE_ALIGN (pattern
);
9780 TYPE_USER_ALIGN (type
) = TYPE_USER_ALIGN (pattern
);
9781 TYPE_FOR_JAVA (type
) = TYPE_FOR_JAVA (pattern
); /* For libjava's JArray<T> */
9782 if (ANON_AGGR_TYPE_P (pattern
))
9783 SET_ANON_AGGR_TYPE_P (type
);
9784 if (CLASSTYPE_VISIBILITY_SPECIFIED (pattern
))
9786 CLASSTYPE_VISIBILITY_SPECIFIED (type
) = 1;
9787 CLASSTYPE_VISIBILITY (type
) = CLASSTYPE_VISIBILITY (pattern
);
9788 /* Adjust visibility for template arguments. */
9789 determine_visibility (TYPE_MAIN_DECL (type
));
9791 if (CLASS_TYPE_P (type
))
9792 CLASSTYPE_FINAL (type
) = CLASSTYPE_FINAL (pattern
);
9794 pbinfo
= TYPE_BINFO (pattern
);
9796 /* We should never instantiate a nested class before its enclosing
9797 class; we need to look up the nested class by name before we can
9798 instantiate it, and that lookup should instantiate the enclosing
9800 gcc_assert (!DECL_CLASS_SCOPE_P (TYPE_MAIN_DECL (pattern
))
9801 || COMPLETE_OR_OPEN_TYPE_P (TYPE_CONTEXT (type
)));
9803 base_list
= NULL_TREE
;
9804 if (BINFO_N_BASE_BINFOS (pbinfo
))
9810 /* We must enter the scope containing the type, as that is where
9811 the accessibility of types named in dependent bases are
9813 pushed_scope
= push_scope (CP_TYPE_CONTEXT (type
));
9815 /* Substitute into each of the bases to determine the actual
9817 for (i
= 0; BINFO_BASE_ITERATE (pbinfo
, i
, pbase_binfo
); i
++)
9820 tree access
= BINFO_BASE_ACCESS (pbinfo
, i
);
9821 tree expanded_bases
= NULL_TREE
;
9824 if (PACK_EXPANSION_P (BINFO_TYPE (pbase_binfo
)))
9827 tsubst_pack_expansion (BINFO_TYPE (pbase_binfo
),
9828 args
, tf_error
, NULL_TREE
);
9829 if (expanded_bases
== error_mark_node
)
9832 len
= TREE_VEC_LENGTH (expanded_bases
);
9835 for (idx
= 0; idx
< len
; idx
++)
9838 /* Extract the already-expanded base class. */
9839 base
= TREE_VEC_ELT (expanded_bases
, idx
);
9841 /* Substitute to figure out the base class. */
9842 base
= tsubst (BINFO_TYPE (pbase_binfo
), args
, tf_error
,
9845 if (base
== error_mark_node
)
9848 base_list
= tree_cons (access
, base
, base_list
);
9849 if (BINFO_VIRTUAL_P (pbase_binfo
))
9850 TREE_TYPE (base_list
) = integer_type_node
;
9854 /* The list is now in reverse order; correct that. */
9855 base_list
= nreverse (base_list
);
9858 pop_scope (pushed_scope
);
9860 /* Now call xref_basetypes to set up all the base-class
9862 xref_basetypes (type
, base_list
);
9864 apply_late_template_attributes (&type
, TYPE_ATTRIBUTES (pattern
),
9865 (int) ATTR_FLAG_TYPE_IN_PLACE
,
9866 args
, tf_error
, NULL_TREE
);
9867 fixup_attribute_variants (type
);
9869 /* Now that our base classes are set up, enter the scope of the
9870 class, so that name lookups into base classes, etc. will work
9871 correctly. This is precisely analogous to what we do in
9872 begin_class_definition when defining an ordinary non-template
9873 class, except we also need to push the enclosing classes. */
9874 push_nested_class (type
);
9876 /* Now members are processed in the order of declaration. */
9877 for (member
= CLASSTYPE_DECL_LIST (pattern
);
9878 member
; member
= TREE_CHAIN (member
))
9880 tree t
= TREE_VALUE (member
);
9882 if (TREE_PURPOSE (member
))
9886 /* Build new CLASSTYPE_NESTED_UTDS. */
9889 bool class_template_p
;
9891 class_template_p
= (TREE_CODE (t
) != ENUMERAL_TYPE
9892 && TYPE_LANG_SPECIFIC (t
)
9893 && CLASSTYPE_IS_TEMPLATE (t
));
9894 /* If the member is a class template, then -- even after
9895 substitution -- there may be dependent types in the
9896 template argument list for the class. We increment
9897 PROCESSING_TEMPLATE_DECL so that dependent_type_p, as
9898 that function will assume that no types are dependent
9899 when outside of a template. */
9900 if (class_template_p
)
9901 ++processing_template_decl
;
9902 newtag
= tsubst (t
, args
, tf_error
, NULL_TREE
);
9903 if (class_template_p
)
9904 --processing_template_decl
;
9905 if (newtag
== error_mark_node
)
9908 if (TREE_CODE (newtag
) != ENUMERAL_TYPE
)
9910 tree name
= TYPE_IDENTIFIER (t
);
9912 if (class_template_p
)
9913 /* Unfortunately, lookup_template_class sets
9914 CLASSTYPE_IMPLICIT_INSTANTIATION for a partial
9915 instantiation (i.e., for the type of a member
9916 template class nested within a template class.)
9917 This behavior is required for
9918 maybe_process_partial_specialization to work
9919 correctly, but is not accurate in this case;
9920 the TAG is not an instantiation of anything.
9921 (The corresponding TEMPLATE_DECL is an
9922 instantiation, but the TYPE is not.) */
9923 CLASSTYPE_USE_TEMPLATE (newtag
) = 0;
9925 /* Now, we call pushtag to put this NEWTAG into the scope of
9926 TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid
9927 pushtag calling push_template_decl. We don't have to do
9928 this for enums because it will already have been done in
9931 SET_IDENTIFIER_TYPE_VALUE (name
, newtag
);
9932 pushtag (name
, newtag
, /*tag_scope=*/ts_current
);
9935 else if (DECL_DECLARES_FUNCTION_P (t
))
9937 /* Build new TYPE_METHODS. */
9940 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9941 ++processing_template_decl
;
9942 r
= tsubst (t
, args
, tf_error
, NULL_TREE
);
9943 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9944 --processing_template_decl
;
9945 set_current_access_from_decl (r
);
9946 finish_member_declaration (r
);
9947 /* Instantiate members marked with attribute used. */
9948 if (r
!= error_mark_node
&& DECL_PRESERVE_P (r
))
9950 if (TREE_CODE (r
) == FUNCTION_DECL
9951 && DECL_OMP_DECLARE_REDUCTION_P (r
))
9952 cp_check_omp_declare_reduction (r
);
9954 else if (DECL_CLASS_TEMPLATE_P (t
)
9955 && LAMBDA_TYPE_P (TREE_TYPE (t
)))
9956 /* A closure type for a lambda in a default argument for a
9957 member template. Ignore it; it will be instantiated with
9958 the default argument. */;
9961 /* Build new TYPE_FIELDS. */
9962 if (TREE_CODE (t
) == STATIC_ASSERT
)
9966 ++c_inhibit_evaluation_warnings
;
9968 tsubst_expr (STATIC_ASSERT_CONDITION (t
), args
,
9969 tf_warning_or_error
, NULL_TREE
,
9970 /*integral_constant_expression_p=*/true);
9971 --c_inhibit_evaluation_warnings
;
9973 finish_static_assert (condition
,
9974 STATIC_ASSERT_MESSAGE (t
),
9975 STATIC_ASSERT_SOURCE_LOCATION (t
),
9978 else if (TREE_CODE (t
) != CONST_DECL
)
9981 tree vec
= NULL_TREE
;
9984 /* The file and line for this declaration, to
9985 assist in error message reporting. Since we
9986 called push_tinst_level above, we don't need to
9988 input_location
= DECL_SOURCE_LOCATION (t
);
9990 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9991 ++processing_template_decl
;
9992 r
= tsubst (t
, args
, tf_warning_or_error
, NULL_TREE
);
9993 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9994 --processing_template_decl
;
9996 if (TREE_CODE (r
) == TREE_VEC
)
9998 /* A capture pack became multiple fields. */
10000 len
= TREE_VEC_LENGTH (vec
);
10003 for (int i
= 0; i
< len
; ++i
)
10006 r
= TREE_VEC_ELT (vec
, i
);
10011 [t]he initialization (and any associated
10012 side-effects) of a static data member does
10013 not occur unless the static data member is
10014 itself used in a way that requires the
10015 definition of the static data member to
10018 Therefore, we do not substitute into the
10019 initialized for the static data member here. */
10020 finish_static_data_member_decl
10022 /*init=*/NULL_TREE
,
10023 /*init_const_expr_p=*/false,
10024 /*asmspec_tree=*/NULL_TREE
,
10026 /* Instantiate members marked with attribute used. */
10027 if (r
!= error_mark_node
&& DECL_PRESERVE_P (r
))
10030 else if (TREE_CODE (r
) == FIELD_DECL
)
10032 /* Determine whether R has a valid type and can be
10033 completed later. If R is invalid, then its type
10034 is replaced by error_mark_node. */
10035 tree rtype
= TREE_TYPE (r
);
10036 if (can_complete_type_without_circularity (rtype
))
10037 complete_type (rtype
);
10039 if (!COMPLETE_TYPE_P (rtype
))
10041 cxx_incomplete_type_error (r
, rtype
);
10042 TREE_TYPE (r
) = error_mark_node
;
10046 /* If it is a TYPE_DECL for a class-scoped ENUMERAL_TYPE,
10047 such a thing will already have been added to the field
10048 list by tsubst_enum in finish_member_declaration in the
10049 CLASSTYPE_NESTED_UTDS case above. */
10050 if (!(TREE_CODE (r
) == TYPE_DECL
10051 && TREE_CODE (TREE_TYPE (r
)) == ENUMERAL_TYPE
10052 && DECL_ARTIFICIAL (r
)))
10054 set_current_access_from_decl (r
);
10055 finish_member_declaration (r
);
10063 if (TYPE_P (t
) || DECL_CLASS_TEMPLATE_P (t
)
10064 || DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
10066 /* Build new CLASSTYPE_FRIEND_CLASSES. */
10068 tree friend_type
= t
;
10069 bool adjust_processing_template_decl
= false;
10071 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
10073 /* template <class T> friend class C; */
10074 friend_type
= tsubst_friend_class (friend_type
, args
);
10075 adjust_processing_template_decl
= true;
10077 else if (TREE_CODE (friend_type
) == UNBOUND_CLASS_TEMPLATE
)
10079 /* template <class T> friend class C::D; */
10080 friend_type
= tsubst (friend_type
, args
,
10081 tf_warning_or_error
, NULL_TREE
);
10082 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
10083 friend_type
= TREE_TYPE (friend_type
);
10084 adjust_processing_template_decl
= true;
10086 else if (TREE_CODE (friend_type
) == TYPENAME_TYPE
10087 || TREE_CODE (friend_type
) == TEMPLATE_TYPE_PARM
)
10089 /* This could be either
10093 when dependent_type_p is false or
10095 template <class U> friend class T::C;
10098 friend_type
= tsubst (friend_type
, args
,
10099 tf_warning_or_error
, NULL_TREE
);
10100 /* Bump processing_template_decl for correct
10101 dependent_type_p calculation. */
10102 ++processing_template_decl
;
10103 if (dependent_type_p (friend_type
))
10104 adjust_processing_template_decl
= true;
10105 --processing_template_decl
;
10107 else if (!CLASSTYPE_USE_TEMPLATE (friend_type
)
10108 && hidden_name_p (TYPE_NAME (friend_type
)))
10112 where C hasn't been declared yet. Let's lookup name
10113 from namespace scope directly, bypassing any name that
10114 come from dependent base class. */
10115 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (friend_type
));
10117 /* The call to xref_tag_from_type does injection for friend
10119 push_nested_namespace (ns
);
10121 xref_tag_from_type (friend_type
, NULL_TREE
,
10122 /*tag_scope=*/ts_current
);
10123 pop_nested_namespace (ns
);
10125 else if (uses_template_parms (friend_type
))
10126 /* friend class C<T>; */
10127 friend_type
= tsubst (friend_type
, args
,
10128 tf_warning_or_error
, NULL_TREE
);
10133 where C is already declared or
10135 friend class C<int>;
10137 We don't have to do anything in these cases. */
10139 if (adjust_processing_template_decl
)
10140 /* Trick make_friend_class into realizing that the friend
10141 we're adding is a template, not an ordinary class. It's
10142 important that we use make_friend_class since it will
10143 perform some error-checking and output cross-reference
10145 ++processing_template_decl
;
10147 if (friend_type
!= error_mark_node
)
10148 make_friend_class (type
, friend_type
, /*complain=*/false);
10150 if (adjust_processing_template_decl
)
10151 --processing_template_decl
;
10155 /* Build new DECL_FRIENDLIST. */
10158 /* The file and line for this declaration, to
10159 assist in error message reporting. Since we
10160 called push_tinst_level above, we don't need to
10162 input_location
= DECL_SOURCE_LOCATION (t
);
10164 if (TREE_CODE (t
) == TEMPLATE_DECL
)
10166 ++processing_template_decl
;
10167 push_deferring_access_checks (dk_no_check
);
10170 r
= tsubst_friend_function (t
, args
);
10171 add_friend (type
, r
, /*complain=*/false);
10172 if (TREE_CODE (t
) == TEMPLATE_DECL
)
10174 pop_deferring_access_checks ();
10175 --processing_template_decl
;
10183 /* Restore these before substituting into the lambda capture
10185 cp_unevaluated_operand
= saved_unevaluated_operand
;
10186 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
10189 if (tree expr
= CLASSTYPE_LAMBDA_EXPR (type
))
10191 tree decl
= lambda_function (type
);
10194 if (!DECL_TEMPLATE_INFO (decl
)
10195 || DECL_TEMPLATE_RESULT (DECL_TI_TEMPLATE (decl
)) != decl
)
10196 instantiate_decl (decl
, false, false);
10198 /* We need to instantiate the capture list from the template
10199 after we've instantiated the closure members, but before we
10200 consider adding the conversion op. Also keep any captures
10201 that may have been added during instantiation of the op(). */
10202 tree tmpl_expr
= CLASSTYPE_LAMBDA_EXPR (pattern
);
10204 = tsubst_copy_and_build (LAMBDA_EXPR_CAPTURE_LIST (tmpl_expr
),
10205 args
, tf_warning_or_error
, NULL_TREE
,
10208 LAMBDA_EXPR_CAPTURE_LIST (expr
)
10209 = chainon (tmpl_cap
, nreverse (LAMBDA_EXPR_CAPTURE_LIST (expr
)));
10211 maybe_add_lambda_conv_op (type
);
10214 gcc_assert (errorcount
);
10217 /* Set the file and line number information to whatever is given for
10218 the class itself. This puts error messages involving generated
10219 implicit functions at a predictable point, and the same point
10220 that would be used for non-template classes. */
10221 input_location
= DECL_SOURCE_LOCATION (typedecl
);
10223 unreverse_member_declarations (type
);
10224 finish_struct_1 (type
);
10225 TYPE_BEING_DEFINED (type
) = 0;
10227 /* We don't instantiate default arguments for member functions. 14.7.1:
10229 The implicit instantiation of a class template specialization causes
10230 the implicit instantiation of the declarations, but not of the
10231 definitions or default arguments, of the class member functions,
10232 member classes, static data members and member templates.... */
10234 /* Some typedefs referenced from within the template code need to be access
10235 checked at template instantiation time, i.e now. These types were
10236 added to the template at parsing time. Let's get those and perform
10237 the access checks then. */
10238 perform_typedefs_access_check (pattern
, args
);
10239 perform_deferred_access_checks (tf_warning_or_error
);
10240 pop_nested_class ();
10241 maximum_field_alignment
= saved_maximum_field_alignment
;
10243 pop_from_top_level ();
10244 pop_deferring_access_checks ();
10245 pop_tinst_level ();
10247 /* The vtable for a template class can be emitted in any translation
10248 unit in which the class is instantiated. When there is no key
10249 method, however, finish_struct_1 will already have added TYPE to
10250 the keyed_classes list. */
10251 if (TYPE_CONTAINS_VPTR_P (type
) && CLASSTYPE_KEY_METHOD (type
))
10252 keyed_classes
= tree_cons (NULL_TREE
, type
, keyed_classes
);
10257 /* Wrapper for instantiate_class_template_1. */
10260 instantiate_class_template (tree type
)
10263 timevar_push (TV_TEMPLATE_INST
);
10264 ret
= instantiate_class_template_1 (type
);
10265 timevar_pop (TV_TEMPLATE_INST
);
10270 tsubst_template_arg (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
10276 else if (TYPE_P (t
))
10277 r
= tsubst (t
, args
, complain
, in_decl
);
10280 if (!(complain
& tf_warning
))
10281 ++c_inhibit_evaluation_warnings
;
10282 r
= tsubst_expr (t
, args
, complain
, in_decl
,
10283 /*integral_constant_expression_p=*/true);
10284 if (!(complain
& tf_warning
))
10285 --c_inhibit_evaluation_warnings
;
10290 /* Given a function parameter pack TMPL_PARM and some function parameters
10291 instantiated from it at *SPEC_P, return a NONTYPE_ARGUMENT_PACK of them
10292 and set *SPEC_P to point at the next point in the list. */
10295 extract_fnparm_pack (tree tmpl_parm
, tree
*spec_p
)
10297 /* Collect all of the extra "packed" parameters into an
10301 tree argpack
= make_node (NONTYPE_ARGUMENT_PACK
);
10302 tree argtypepack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
10303 tree spec_parm
= *spec_p
;
10306 for (len
= 0; spec_parm
; ++len
, spec_parm
= TREE_CHAIN (spec_parm
))
10308 && !function_parameter_expanded_from_pack_p (spec_parm
, tmpl_parm
))
10311 /* Fill in PARMVEC and PARMTYPEVEC with all of the parameters. */
10312 parmvec
= make_tree_vec (len
);
10313 parmtypevec
= make_tree_vec (len
);
10314 spec_parm
= *spec_p
;
10315 for (i
= 0; i
< len
; i
++, spec_parm
= DECL_CHAIN (spec_parm
))
10317 TREE_VEC_ELT (parmvec
, i
) = spec_parm
;
10318 TREE_VEC_ELT (parmtypevec
, i
) = TREE_TYPE (spec_parm
);
10321 /* Build the argument packs. */
10322 SET_ARGUMENT_PACK_ARGS (argpack
, parmvec
);
10323 SET_ARGUMENT_PACK_ARGS (argtypepack
, parmtypevec
);
10324 TREE_TYPE (argpack
) = argtypepack
;
10325 *spec_p
= spec_parm
;
10330 /* Give a chain SPEC_PARM of PARM_DECLs, pack them into a
10331 NONTYPE_ARGUMENT_PACK. */
10334 make_fnparm_pack (tree spec_parm
)
10336 return extract_fnparm_pack (NULL_TREE
, &spec_parm
);
10339 /* Return 1 if the Ith element of the argument pack ARG_PACK is a
10340 pack expansion with no extra args, 2 if it has extra args, or 0
10341 if it is not a pack expansion. */
10344 argument_pack_element_is_expansion_p (tree arg_pack
, int i
)
10346 tree vec
= ARGUMENT_PACK_ARGS (arg_pack
);
10347 if (i
>= TREE_VEC_LENGTH (vec
))
10349 tree elt
= TREE_VEC_ELT (vec
, i
);
10351 /* A decl pack is itself an expansion. */
10352 elt
= TREE_TYPE (elt
);
10353 if (!PACK_EXPANSION_P (elt
))
10355 if (PACK_EXPANSION_EXTRA_ARGS (elt
))
10361 /* Creates and return an ARGUMENT_PACK_SELECT tree node. */
10364 make_argument_pack_select (tree arg_pack
, unsigned index
)
10366 tree aps
= make_node (ARGUMENT_PACK_SELECT
);
10368 ARGUMENT_PACK_SELECT_FROM_PACK (aps
) = arg_pack
;
10369 ARGUMENT_PACK_SELECT_INDEX (aps
) = index
;
10374 /* This is a subroutine of tsubst_pack_expansion.
10376 It returns TRUE if we need to use the PACK_EXPANSION_EXTRA_ARGS
10377 mechanism to store the (non complete list of) arguments of the
10378 substitution and return a non substituted pack expansion, in order
10379 to wait for when we have enough arguments to really perform the
10383 use_pack_expansion_extra_args_p (tree parm_packs
,
10385 bool has_empty_arg
)
10387 /* If one pack has an expansion and another pack has a normal
10388 argument or if one pack has an empty argument and an another
10389 one hasn't then tsubst_pack_expansion cannot perform the
10390 substitution and need to fall back on the
10391 PACK_EXPANSION_EXTRA mechanism. */
10392 if (parm_packs
== NULL_TREE
)
10394 else if (has_empty_arg
)
10397 bool has_expansion_arg
= false;
10398 for (int i
= 0 ; i
< arg_pack_len
; ++i
)
10400 bool has_non_expansion_arg
= false;
10401 for (tree parm_pack
= parm_packs
;
10403 parm_pack
= TREE_CHAIN (parm_pack
))
10405 tree arg
= TREE_VALUE (parm_pack
);
10407 int exp
= argument_pack_element_is_expansion_p (arg
, i
);
10409 /* We can't substitute a pack expansion with extra args into
10413 has_expansion_arg
= true;
10415 has_non_expansion_arg
= true;
10418 if (has_expansion_arg
&& has_non_expansion_arg
)
10424 /* [temp.variadic]/6 says that:
10426 The instantiation of a pack expansion [...]
10427 produces a list E1,E2, ..., En, where N is the number of elements
10428 in the pack expansion parameters.
10430 This subroutine of tsubst_pack_expansion produces one of these Ei.
10432 PATTERN is the pattern of the pack expansion. PARM_PACKS is a
10433 TREE_LIST in which each TREE_PURPOSE is a parameter pack of
10434 PATTERN, and each TREE_VALUE is its corresponding argument pack.
10435 INDEX is the index 'i' of the element Ei to produce. ARGS,
10436 COMPLAIN, and IN_DECL are the same parameters as for the
10437 tsubst_pack_expansion function.
10439 The function returns the resulting Ei upon successful completion,
10440 or error_mark_node.
10442 Note that this function possibly modifies the ARGS parameter, so
10443 it's the responsibility of the caller to restore it. */
10446 gen_elem_of_pack_expansion_instantiation (tree pattern
,
10449 tree args
/* This parm gets
10451 tsubst_flags_t complain
,
10455 bool ith_elem_is_expansion
= false;
10457 /* For each parameter pack, change the substitution of the parameter
10458 pack to the ith argument in its argument pack, then expand the
10460 for (tree pack
= parm_packs
; pack
; pack
= TREE_CHAIN (pack
))
10462 tree parm
= TREE_PURPOSE (pack
);
10463 tree arg_pack
= TREE_VALUE (pack
);
10464 tree aps
; /* instance of ARGUMENT_PACK_SELECT. */
10466 ith_elem_is_expansion
|=
10467 argument_pack_element_is_expansion_p (arg_pack
, index
);
10469 /* Select the Ith argument from the pack. */
10470 if (TREE_CODE (parm
) == PARM_DECL
10471 || TREE_CODE (parm
) == FIELD_DECL
)
10475 aps
= make_argument_pack_select (arg_pack
, index
);
10476 if (!mark_used (parm
, complain
) && !(complain
& tf_error
))
10477 return error_mark_node
;
10478 register_local_specialization (aps
, parm
);
10481 aps
= retrieve_local_specialization (parm
);
10486 template_parm_level_and_index (parm
, &level
, &idx
);
10490 aps
= make_argument_pack_select (arg_pack
, index
);
10491 /* Update the corresponding argument. */
10492 TMPL_ARG (args
, level
, idx
) = aps
;
10495 /* Re-use the ARGUMENT_PACK_SELECT. */
10496 aps
= TMPL_ARG (args
, level
, idx
);
10498 ARGUMENT_PACK_SELECT_INDEX (aps
) = index
;
10501 /* Substitute into the PATTERN with the (possibly altered)
10503 if (pattern
== in_decl
)
10504 /* Expanding a fixed parameter pack from
10505 coerce_template_parameter_pack. */
10506 t
= tsubst_decl (pattern
, args
, complain
);
10507 else if (pattern
== error_mark_node
)
10508 t
= error_mark_node
;
10509 else if (constraint_p (pattern
))
10511 if (processing_template_decl
)
10512 t
= tsubst_constraint (pattern
, args
, complain
, in_decl
);
10514 t
= (constraints_satisfied_p (pattern
, args
)
10515 ? boolean_true_node
: boolean_false_node
);
10517 else if (!TYPE_P (pattern
))
10518 t
= tsubst_expr (pattern
, args
, complain
, in_decl
,
10519 /*integral_constant_expression_p=*/false);
10521 t
= tsubst (pattern
, args
, complain
, in_decl
);
10523 /* If the Ith argument pack element is a pack expansion, then
10524 the Ith element resulting from the substituting is going to
10525 be a pack expansion as well. */
10526 if (ith_elem_is_expansion
)
10527 t
= make_pack_expansion (t
);
10532 /* When the unexpanded parameter pack in a fold expression expands to an empty
10533 sequence, the value of the expression is as follows; the program is
10534 ill-formed if the operator is not listed in this table.
10545 expand_empty_fold (tree t
, tsubst_flags_t complain
)
10547 tree_code code
= (tree_code
)TREE_INT_CST_LOW (TREE_OPERAND (t
, 0));
10548 if (!FOLD_EXPR_MODIFY_P (t
))
10552 return integer_one_node
;
10554 return integer_zero_node
;
10556 return integer_minus_one_node
;
10558 return integer_zero_node
;
10559 case TRUTH_ANDIF_EXPR
:
10560 return boolean_true_node
;
10561 case TRUTH_ORIF_EXPR
:
10562 return boolean_false_node
;
10563 case COMPOUND_EXPR
:
10569 if (complain
& tf_error
)
10570 error_at (location_of (t
),
10571 "fold of empty expansion over %O", code
);
10572 return error_mark_node
;
10575 /* Given a fold-expression T and a current LEFT and RIGHT operand,
10576 form an expression that combines the two terms using the
10580 fold_expression (tree t
, tree left
, tree right
, tsubst_flags_t complain
)
10582 tree op
= FOLD_EXPR_OP (t
);
10583 tree_code code
= (tree_code
)TREE_INT_CST_LOW (op
);
10585 // Handle compound assignment operators.
10586 if (FOLD_EXPR_MODIFY_P (t
))
10587 return build_x_modify_expr (input_location
, left
, code
, right
, complain
);
10591 case COMPOUND_EXPR
:
10592 return build_x_compound_expr (input_location
, left
, right
, complain
);
10594 return build_m_component_ref (left
, right
, complain
);
10596 return build_x_binary_op (input_location
, code
,
10597 left
, TREE_CODE (left
),
10598 right
, TREE_CODE (right
),
10604 /* Substitute ARGS into the pack of a fold expression T. */
10607 tsubst_fold_expr_pack (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
10609 return tsubst_pack_expansion (FOLD_EXPR_PACK (t
), args
, complain
, in_decl
);
10612 /* Substitute ARGS into the pack of a fold expression T. */
10615 tsubst_fold_expr_init (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
10617 return tsubst_expr (FOLD_EXPR_INIT (t
), args
, complain
, in_decl
, false);
10620 /* Expand a PACK of arguments into a grouped as left fold.
10621 Given a pack containing elements A0, A1, ..., An and an
10622 operator @, this builds the expression:
10624 ((A0 @ A1) @ A2) ... @ An
10626 Note that PACK must not be empty.
10628 The operator is defined by the original fold expression T. */
10631 expand_left_fold (tree t
, tree pack
, tsubst_flags_t complain
)
10633 tree left
= TREE_VEC_ELT (pack
, 0);
10634 for (int i
= 1; i
< TREE_VEC_LENGTH (pack
); ++i
)
10636 tree right
= TREE_VEC_ELT (pack
, i
);
10637 left
= fold_expression (t
, left
, right
, complain
);
10642 /* Substitute into a unary left fold expression. */
10645 tsubst_unary_left_fold (tree t
, tree args
, tsubst_flags_t complain
,
10648 tree pack
= tsubst_fold_expr_pack (t
, args
, complain
, in_decl
);
10649 if (pack
== error_mark_node
)
10650 return error_mark_node
;
10651 if (TREE_VEC_LENGTH (pack
) == 0)
10652 return expand_empty_fold (t
, complain
);
10654 return expand_left_fold (t
, pack
, complain
);
10657 /* Substitute into a binary left fold expression.
10659 Do ths by building a single (non-empty) vector of argumnts and
10660 building the expression from those elements. */
10663 tsubst_binary_left_fold (tree t
, tree args
, tsubst_flags_t complain
,
10666 tree pack
= tsubst_fold_expr_pack (t
, args
, complain
, in_decl
);
10667 if (pack
== error_mark_node
)
10668 return error_mark_node
;
10669 tree init
= tsubst_fold_expr_init (t
, args
, complain
, in_decl
);
10670 if (init
== error_mark_node
)
10671 return error_mark_node
;
10673 tree vec
= make_tree_vec (TREE_VEC_LENGTH (pack
) + 1);
10674 TREE_VEC_ELT (vec
, 0) = init
;
10675 for (int i
= 0; i
< TREE_VEC_LENGTH (pack
); ++i
)
10676 TREE_VEC_ELT (vec
, i
+ 1) = TREE_VEC_ELT (pack
, i
);
10678 return expand_left_fold (t
, vec
, complain
);
10681 /* Expand a PACK of arguments into a grouped as right fold.
10682 Given a pack containing elementns A0, A1, ..., and an
10683 operator @, this builds the expression:
10685 A0@ ... (An-2 @ (An-1 @ An))
10687 Note that PACK must not be empty.
10689 The operator is defined by the original fold expression T. */
10692 expand_right_fold (tree t
, tree pack
, tsubst_flags_t complain
)
10694 // Build the expression.
10695 int n
= TREE_VEC_LENGTH (pack
);
10696 tree right
= TREE_VEC_ELT (pack
, n
- 1);
10697 for (--n
; n
!= 0; --n
)
10699 tree left
= TREE_VEC_ELT (pack
, n
- 1);
10700 right
= fold_expression (t
, left
, right
, complain
);
10705 /* Substitute into a unary right fold expression. */
10708 tsubst_unary_right_fold (tree t
, tree args
, tsubst_flags_t complain
,
10711 tree pack
= tsubst_fold_expr_pack (t
, args
, complain
, in_decl
);
10712 if (pack
== error_mark_node
)
10713 return error_mark_node
;
10714 if (TREE_VEC_LENGTH (pack
) == 0)
10715 return expand_empty_fold (t
, complain
);
10717 return expand_right_fold (t
, pack
, complain
);
10720 /* Substitute into a binary right fold expression.
10722 Do ths by building a single (non-empty) vector of arguments and
10723 building the expression from those elements. */
10726 tsubst_binary_right_fold (tree t
, tree args
, tsubst_flags_t complain
,
10729 tree pack
= tsubst_fold_expr_pack (t
, args
, complain
, in_decl
);
10730 if (pack
== error_mark_node
)
10731 return error_mark_node
;
10732 tree init
= tsubst_fold_expr_init (t
, args
, complain
, in_decl
);
10733 if (init
== error_mark_node
)
10734 return error_mark_node
;
10736 int n
= TREE_VEC_LENGTH (pack
);
10737 tree vec
= make_tree_vec (n
+ 1);
10738 for (int i
= 0; i
< n
; ++i
)
10739 TREE_VEC_ELT (vec
, i
) = TREE_VEC_ELT (pack
, i
);
10740 TREE_VEC_ELT (vec
, n
) = init
;
10742 return expand_right_fold (t
, vec
, complain
);
10746 /* Substitute ARGS into T, which is an pack expansion
10747 (i.e. TYPE_PACK_EXPANSION or EXPR_PACK_EXPANSION). Returns a
10748 TREE_VEC with the substituted arguments, a PACK_EXPANSION_* node
10749 (if only a partial substitution could be performed) or
10750 ERROR_MARK_NODE if there was an error. */
10752 tsubst_pack_expansion (tree t
, tree args
, tsubst_flags_t complain
,
10756 tree pack
, packs
= NULL_TREE
;
10757 bool unsubstituted_packs
= false;
10760 hash_map
<tree
, tree
> *saved_local_specializations
= NULL
;
10761 bool need_local_specializations
= false;
10764 gcc_assert (PACK_EXPANSION_P (t
));
10765 pattern
= PACK_EXPANSION_PATTERN (t
);
10767 /* Add in any args remembered from an earlier partial instantiation. */
10768 args
= add_to_template_args (PACK_EXPANSION_EXTRA_ARGS (t
), args
);
10770 levels
= TMPL_ARGS_DEPTH (args
);
10772 /* Determine the argument packs that will instantiate the parameter
10773 packs used in the expansion expression. While we're at it,
10774 compute the number of arguments to be expanded and make sure it
10776 for (pack
= PACK_EXPANSION_PARAMETER_PACKS (t
); pack
;
10777 pack
= TREE_CHAIN (pack
))
10779 tree parm_pack
= TREE_VALUE (pack
);
10780 tree arg_pack
= NULL_TREE
;
10781 tree orig_arg
= NULL_TREE
;
10784 if (TREE_CODE (parm_pack
) == BASES
)
10786 if (BASES_DIRECT (parm_pack
))
10787 return calculate_direct_bases (tsubst_expr (BASES_TYPE (parm_pack
),
10788 args
, complain
, in_decl
, false));
10790 return calculate_bases (tsubst_expr (BASES_TYPE (parm_pack
),
10791 args
, complain
, in_decl
, false));
10793 if (TREE_CODE (parm_pack
) == PARM_DECL
)
10795 /* We know we have correct local_specializations if this
10796 expansion is at function scope, or if we're dealing with a
10797 local parameter in a requires expression; for the latter,
10798 tsubst_requires_expr set it up appropriately. */
10799 if (PACK_EXPANSION_LOCAL_P (t
) || CONSTRAINT_VAR_P (parm_pack
))
10800 arg_pack
= retrieve_local_specialization (parm_pack
);
10803 /* We can't rely on local_specializations for a parameter
10804 name used later in a function declaration (such as in a
10805 late-specified return type). Even if it exists, it might
10806 have the wrong value for a recursive call. Just make a
10807 dummy decl, since it's only used for its type. */
10808 arg_pack
= tsubst_decl (parm_pack
, args
, complain
);
10809 if (arg_pack
&& DECL_PACK_P (arg_pack
))
10810 /* Partial instantiation of the parm_pack, we can't build
10811 up an argument pack yet. */
10812 arg_pack
= NULL_TREE
;
10814 arg_pack
= make_fnparm_pack (arg_pack
);
10815 need_local_specializations
= true;
10818 else if (TREE_CODE (parm_pack
) == FIELD_DECL
)
10819 arg_pack
= tsubst_copy (parm_pack
, args
, complain
, in_decl
);
10823 template_parm_level_and_index (parm_pack
, &level
, &idx
);
10825 if (level
<= levels
)
10826 arg_pack
= TMPL_ARG (args
, level
, idx
);
10829 orig_arg
= arg_pack
;
10830 if (arg_pack
&& TREE_CODE (arg_pack
) == ARGUMENT_PACK_SELECT
)
10831 arg_pack
= ARGUMENT_PACK_SELECT_FROM_PACK (arg_pack
);
10833 if (arg_pack
&& !ARGUMENT_PACK_P (arg_pack
))
10834 /* This can only happen if we forget to expand an argument
10835 pack somewhere else. Just return an error, silently. */
10837 result
= make_tree_vec (1);
10838 TREE_VEC_ELT (result
, 0) = error_mark_node
;
10845 TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg_pack
));
10847 /* Don't bother trying to do a partial substitution with
10848 incomplete packs; we'll try again after deduction. */
10849 if (ARGUMENT_PACK_INCOMPLETE_P (arg_pack
))
10854 else if (len
!= my_len
)
10856 if (!(complain
& tf_error
))
10857 /* Fail quietly. */;
10858 else if (TREE_CODE (t
) == TYPE_PACK_EXPANSION
)
10859 error ("mismatched argument pack lengths while expanding "
10863 error ("mismatched argument pack lengths while expanding "
10866 return error_mark_node
;
10869 /* Keep track of the parameter packs and their corresponding
10871 packs
= tree_cons (parm_pack
, arg_pack
, packs
);
10872 TREE_TYPE (packs
) = orig_arg
;
10876 /* We can't substitute for this parameter pack. We use a flag as
10877 well as the missing_level counter because function parameter
10878 packs don't have a level. */
10879 unsubstituted_packs
= true;
10883 /* If the expansion is just T..., return the matching argument pack. */
10884 if (!unsubstituted_packs
10885 && TREE_PURPOSE (packs
) == pattern
)
10887 tree args
= ARGUMENT_PACK_ARGS (TREE_VALUE (packs
));
10888 if (TREE_CODE (t
) == TYPE_PACK_EXPANSION
10889 || pack_expansion_args_count (args
))
10891 /* Otherwise use the normal path so we get convert_from_reference. */
10894 /* We cannot expand this expansion expression, because we don't have
10895 all of the argument packs we need. */
10896 if (use_pack_expansion_extra_args_p (packs
, len
, unsubstituted_packs
))
10898 /* We got some full packs, but we can't substitute them in until we
10899 have values for all the packs. So remember these until then. */
10901 t
= make_pack_expansion (pattern
);
10902 PACK_EXPANSION_EXTRA_ARGS (t
) = args
;
10905 else if (unsubstituted_packs
)
10907 /* There were no real arguments, we're just replacing a parameter
10908 pack with another version of itself. Substitute into the
10909 pattern and return a PACK_EXPANSION_*. The caller will need to
10911 if (TREE_CODE (t
) == EXPR_PACK_EXPANSION
)
10912 t
= tsubst_expr (pattern
, args
, complain
, in_decl
,
10913 /*integral_constant_expression_p=*/false);
10915 t
= tsubst (pattern
, args
, complain
, in_decl
);
10916 t
= make_pack_expansion (t
);
10920 gcc_assert (len
>= 0);
10922 if (need_local_specializations
)
10924 /* We're in a late-specified return type, so create our own local
10925 specializations map; the current map is either NULL or (in the
10926 case of recursive unification) might have bindings that we don't
10927 want to use or alter. */
10928 saved_local_specializations
= local_specializations
;
10929 local_specializations
= new hash_map
<tree
, tree
>;
10932 /* For each argument in each argument pack, substitute into the
10934 result
= make_tree_vec (len
);
10935 for (i
= 0; i
< len
; ++i
)
10937 t
= gen_elem_of_pack_expansion_instantiation (pattern
, packs
,
10941 TREE_VEC_ELT (result
, i
) = t
;
10942 if (t
== error_mark_node
)
10944 result
= error_mark_node
;
10949 /* Update ARGS to restore the substitution from parameter packs to
10950 their argument packs. */
10951 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
10953 tree parm
= TREE_PURPOSE (pack
);
10955 if (TREE_CODE (parm
) == PARM_DECL
10956 || TREE_CODE (parm
) == FIELD_DECL
)
10957 register_local_specialization (TREE_TYPE (pack
), parm
);
10962 if (TREE_VALUE (pack
) == NULL_TREE
)
10965 template_parm_level_and_index (parm
, &level
, &idx
);
10967 /* Update the corresponding argument. */
10968 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
10969 TREE_VEC_ELT (TREE_VEC_ELT (args
, level
-1 ), idx
) =
10972 TREE_VEC_ELT (args
, idx
) = TREE_TYPE (pack
);
10976 if (need_local_specializations
)
10978 delete local_specializations
;
10979 local_specializations
= saved_local_specializations
;
10985 /* Given PARM_DECL PARM, find the corresponding PARM_DECL in the template
10986 TMPL. We do this using DECL_PARM_INDEX, which should work even with
10987 parameter packs; all parms generated from a function parameter pack will
10988 have the same DECL_PARM_INDEX. */
10991 get_pattern_parm (tree parm
, tree tmpl
)
10993 tree pattern
= DECL_TEMPLATE_RESULT (tmpl
);
10996 if (DECL_ARTIFICIAL (parm
))
10998 for (patparm
= DECL_ARGUMENTS (pattern
);
10999 patparm
; patparm
= DECL_CHAIN (patparm
))
11000 if (DECL_ARTIFICIAL (patparm
)
11001 && DECL_NAME (parm
) == DECL_NAME (patparm
))
11006 patparm
= FUNCTION_FIRST_USER_PARM (DECL_TEMPLATE_RESULT (tmpl
));
11007 patparm
= chain_index (DECL_PARM_INDEX (parm
)-1, patparm
);
11008 gcc_assert (DECL_PARM_INDEX (patparm
)
11009 == DECL_PARM_INDEX (parm
));
11015 /* Substitute ARGS into the vector or list of template arguments T. */
11018 tsubst_template_args (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
11021 int len
, need_new
= 0, i
, expanded_len_adjust
= 0, out
;
11024 if (t
== error_mark_node
)
11025 return error_mark_node
;
11027 len
= TREE_VEC_LENGTH (t
);
11028 elts
= XALLOCAVEC (tree
, len
);
11030 for (i
= 0; i
< len
; i
++)
11032 tree orig_arg
= TREE_VEC_ELT (t
, i
);
11035 if (TREE_CODE (orig_arg
) == TREE_VEC
)
11036 new_arg
= tsubst_template_args (orig_arg
, args
, complain
, in_decl
);
11037 else if (PACK_EXPANSION_P (orig_arg
))
11039 /* Substitute into an expansion expression. */
11040 new_arg
= tsubst_pack_expansion (orig_arg
, args
, complain
, in_decl
);
11042 if (TREE_CODE (new_arg
) == TREE_VEC
)
11043 /* Add to the expanded length adjustment the number of
11044 expanded arguments. We subtract one from this
11045 measurement, because the argument pack expression
11046 itself is already counted as 1 in
11047 LEN. EXPANDED_LEN_ADJUST can actually be negative, if
11048 the argument pack is empty. */
11049 expanded_len_adjust
+= TREE_VEC_LENGTH (new_arg
) - 1;
11051 else if (ARGUMENT_PACK_P (orig_arg
))
11053 /* Substitute into each of the arguments. */
11054 new_arg
= TYPE_P (orig_arg
)
11055 ? cxx_make_type (TREE_CODE (orig_arg
))
11056 : make_node (TREE_CODE (orig_arg
));
11058 SET_ARGUMENT_PACK_ARGS (
11060 tsubst_template_args (ARGUMENT_PACK_ARGS (orig_arg
),
11061 args
, complain
, in_decl
));
11063 if (ARGUMENT_PACK_ARGS (new_arg
) == error_mark_node
)
11064 new_arg
= error_mark_node
;
11066 if (TREE_CODE (new_arg
) == NONTYPE_ARGUMENT_PACK
) {
11067 TREE_TYPE (new_arg
) = tsubst (TREE_TYPE (orig_arg
), args
,
11068 complain
, in_decl
);
11069 TREE_CONSTANT (new_arg
) = TREE_CONSTANT (orig_arg
);
11071 if (TREE_TYPE (new_arg
) == error_mark_node
)
11072 new_arg
= error_mark_node
;
11076 new_arg
= tsubst_template_arg (orig_arg
, args
, complain
, in_decl
);
11078 if (new_arg
== error_mark_node
)
11079 return error_mark_node
;
11082 if (new_arg
!= orig_arg
)
11089 /* Make space for the expanded arguments coming from template
11091 t
= make_tree_vec (len
+ expanded_len_adjust
);
11092 /* ORIG_T can contain TREE_VECs. That happens if ORIG_T contains the
11093 arguments for a member template.
11094 In that case each TREE_VEC in ORIG_T represents a level of template
11095 arguments, and ORIG_T won't carry any non defaulted argument count.
11096 It will rather be the nested TREE_VECs that will carry one.
11097 In other words, ORIG_T carries a non defaulted argument count only
11098 if it doesn't contain any nested TREE_VEC. */
11099 if (NON_DEFAULT_TEMPLATE_ARGS_COUNT (orig_t
))
11101 int count
= GET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (orig_t
);
11102 count
+= expanded_len_adjust
;
11103 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (t
, count
);
11105 for (i
= 0, out
= 0; i
< len
; i
++)
11107 if ((PACK_EXPANSION_P (TREE_VEC_ELT (orig_t
, i
))
11108 || ARGUMENT_PACK_P (TREE_VEC_ELT (orig_t
, i
)))
11109 && TREE_CODE (elts
[i
]) == TREE_VEC
)
11113 /* Now expand the template argument pack "in place". */
11114 for (idx
= 0; idx
< TREE_VEC_LENGTH (elts
[i
]); idx
++, out
++)
11115 TREE_VEC_ELT (t
, out
) = TREE_VEC_ELT (elts
[i
], idx
);
11119 TREE_VEC_ELT (t
, out
) = elts
[i
];
11127 /* Return the result of substituting ARGS into the template parameters
11128 given by PARMS. If there are m levels of ARGS and m + n levels of
11129 PARMS, then the result will contain n levels of PARMS. For
11130 example, if PARMS is `template <class T> template <class U>
11131 template <T*, U, class V>' and ARGS is {{int}, {double}} then the
11132 result will be `template <int*, double, class V>'. */
11135 tsubst_template_parms (tree parms
, tree args
, tsubst_flags_t complain
)
11137 tree r
= NULL_TREE
;
11140 /* When substituting into a template, we must set
11141 PROCESSING_TEMPLATE_DECL as the template parameters may be
11142 dependent if they are based on one-another, and the dependency
11143 predicates are short-circuit outside of templates. */
11144 ++processing_template_decl
;
11146 for (new_parms
= &r
;
11147 parms
&& TMPL_PARMS_DEPTH (parms
) > TMPL_ARGS_DEPTH (args
);
11148 new_parms
= &(TREE_CHAIN (*new_parms
)),
11149 parms
= TREE_CHAIN (parms
))
11152 make_tree_vec (TREE_VEC_LENGTH (TREE_VALUE (parms
)));
11155 for (i
= 0; i
< TREE_VEC_LENGTH (new_vec
); ++i
)
11159 if (parms
== error_mark_node
)
11162 tuple
= TREE_VEC_ELT (TREE_VALUE (parms
), i
);
11164 if (tuple
== error_mark_node
)
11167 TREE_VEC_ELT (new_vec
, i
) =
11168 tsubst_template_parm (tuple
, args
, complain
);
11172 tree_cons (size_int (TMPL_PARMS_DEPTH (parms
)
11173 - TMPL_ARGS_DEPTH (args
)),
11174 new_vec
, NULL_TREE
);
11177 --processing_template_decl
;
11182 /* Return the result of substituting ARGS into one template parameter
11183 given by T. T Must be a TREE_LIST which TREE_VALUE is the template
11184 parameter and which TREE_PURPOSE is the default argument of the
11185 template parameter. */
11188 tsubst_template_parm (tree t
, tree args
, tsubst_flags_t complain
)
11190 tree default_value
, parm_decl
;
11192 if (args
== NULL_TREE
11194 || t
== error_mark_node
)
11197 gcc_assert (TREE_CODE (t
) == TREE_LIST
);
11199 default_value
= TREE_PURPOSE (t
);
11200 parm_decl
= TREE_VALUE (t
);
11202 parm_decl
= tsubst (parm_decl
, args
, complain
, NULL_TREE
);
11203 if (TREE_CODE (parm_decl
) == PARM_DECL
11204 && invalid_nontype_parm_type_p (TREE_TYPE (parm_decl
), complain
))
11205 parm_decl
= error_mark_node
;
11206 default_value
= tsubst_template_arg (default_value
, args
,
11207 complain
, NULL_TREE
);
11209 return build_tree_list (default_value
, parm_decl
);
11212 /* Substitute the ARGS into the indicated aggregate (or enumeration)
11213 type T. If T is not an aggregate or enumeration type, it is
11214 handled as if by tsubst. IN_DECL is as for tsubst. If
11215 ENTERING_SCOPE is nonzero, T is the context for a template which
11216 we are presently tsubst'ing. Return the substituted value. */
11219 tsubst_aggr_type (tree t
,
11221 tsubst_flags_t complain
,
11223 int entering_scope
)
11225 if (t
== NULL_TREE
)
11228 switch (TREE_CODE (t
))
11231 if (TYPE_PTRMEMFUNC_P (t
))
11232 return tsubst (TYPE_PTRMEMFUNC_FN_TYPE (t
), args
, complain
, in_decl
);
11234 /* Else fall through. */
11235 case ENUMERAL_TYPE
:
11237 if (TYPE_TEMPLATE_INFO (t
) && uses_template_parms (t
))
11242 int saved_unevaluated_operand
;
11243 int saved_inhibit_evaluation_warnings
;
11245 /* In "sizeof(X<I>)" we need to evaluate "I". */
11246 saved_unevaluated_operand
= cp_unevaluated_operand
;
11247 cp_unevaluated_operand
= 0;
11248 saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
11249 c_inhibit_evaluation_warnings
= 0;
11251 /* First, determine the context for the type we are looking
11253 context
= TYPE_CONTEXT (t
);
11254 if (context
&& TYPE_P (context
))
11256 context
= tsubst_aggr_type (context
, args
, complain
,
11257 in_decl
, /*entering_scope=*/1);
11258 /* If context is a nested class inside a class template,
11259 it may still need to be instantiated (c++/33959). */
11260 context
= complete_type (context
);
11263 /* Then, figure out what arguments are appropriate for the
11264 type we are trying to find. For example, given:
11266 template <class T> struct S;
11267 template <class T, class U> void f(T, U) { S<U> su; }
11269 and supposing that we are instantiating f<int, double>,
11270 then our ARGS will be {int, double}, but, when looking up
11271 S we only want {double}. */
11272 argvec
= tsubst_template_args (TYPE_TI_ARGS (t
), args
,
11273 complain
, in_decl
);
11274 if (argvec
== error_mark_node
)
11275 r
= error_mark_node
;
11278 r
= lookup_template_class (t
, argvec
, in_decl
, context
,
11279 entering_scope
, complain
);
11280 r
= cp_build_qualified_type_real (r
, cp_type_quals (t
), complain
);
11283 cp_unevaluated_operand
= saved_unevaluated_operand
;
11284 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
11289 /* This is not a template type, so there's nothing to do. */
11293 return tsubst (t
, args
, complain
, in_decl
);
11297 /* Substitute into the default argument ARG (a default argument for
11298 FN), which has the indicated TYPE. */
11301 tsubst_default_argument (tree fn
, tree type
, tree arg
, tsubst_flags_t complain
)
11303 tree saved_class_ptr
= NULL_TREE
;
11304 tree saved_class_ref
= NULL_TREE
;
11305 int errs
= errorcount
+ sorrycount
;
11307 /* This can happen in invalid code. */
11308 if (TREE_CODE (arg
) == DEFAULT_ARG
)
11311 /* This default argument came from a template. Instantiate the
11312 default argument here, not in tsubst. In the case of
11321 we must be careful to do name lookup in the scope of S<T>,
11322 rather than in the current class. */
11323 push_access_scope (fn
);
11324 /* The "this" pointer is not valid in a default argument. */
11327 saved_class_ptr
= current_class_ptr
;
11328 cp_function_chain
->x_current_class_ptr
= NULL_TREE
;
11329 saved_class_ref
= current_class_ref
;
11330 cp_function_chain
->x_current_class_ref
= NULL_TREE
;
11333 push_deferring_access_checks(dk_no_deferred
);
11334 /* The default argument expression may cause implicitly defined
11335 member functions to be synthesized, which will result in garbage
11336 collection. We must treat this situation as if we were within
11337 the body of function so as to avoid collecting live data on the
11340 arg
= tsubst_expr (arg
, DECL_TI_ARGS (fn
),
11341 complain
, NULL_TREE
,
11342 /*integral_constant_expression_p=*/false);
11344 pop_deferring_access_checks();
11346 /* Restore the "this" pointer. */
11349 cp_function_chain
->x_current_class_ptr
= saved_class_ptr
;
11350 cp_function_chain
->x_current_class_ref
= saved_class_ref
;
11353 if (errorcount
+sorrycount
> errs
11354 && (complain
& tf_warning_or_error
))
11355 inform (input_location
,
11356 " when instantiating default argument for call to %D", fn
);
11358 /* Make sure the default argument is reasonable. */
11359 arg
= check_default_argument (type
, arg
, complain
);
11361 pop_access_scope (fn
);
11366 /* Substitute into all the default arguments for FN. */
11369 tsubst_default_arguments (tree fn
, tsubst_flags_t complain
)
11374 tmpl_args
= DECL_TI_ARGS (fn
);
11376 /* If this function is not yet instantiated, we certainly don't need
11377 its default arguments. */
11378 if (uses_template_parms (tmpl_args
))
11380 /* Don't do this again for clones. */
11381 if (DECL_CLONED_FUNCTION_P (fn
))
11384 for (arg
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
11386 arg
= TREE_CHAIN (arg
))
11387 if (TREE_PURPOSE (arg
))
11388 TREE_PURPOSE (arg
) = tsubst_default_argument (fn
,
11390 TREE_PURPOSE (arg
),
11394 /* Substitute the ARGS into the T, which is a _DECL. Return the
11395 result of the substitution. Issue error and warning messages under
11396 control of COMPLAIN. */
11399 tsubst_decl (tree t
, tree args
, tsubst_flags_t complain
)
11401 #define RETURN(EXP) do { r = (EXP); goto out; } while(0)
11402 location_t saved_loc
;
11403 tree r
= NULL_TREE
;
11405 hashval_t hash
= 0;
11407 /* Set the filename and linenumber to improve error-reporting. */
11408 saved_loc
= input_location
;
11409 input_location
= DECL_SOURCE_LOCATION (t
);
11411 switch (TREE_CODE (t
))
11413 case TEMPLATE_DECL
:
11415 /* We can get here when processing a member function template,
11416 member class template, or template template parameter. */
11417 tree decl
= DECL_TEMPLATE_RESULT (t
);
11422 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
11424 /* Template template parameter is treated here. */
11425 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11426 if (new_type
== error_mark_node
)
11427 r
= error_mark_node
;
11428 /* If we get a real template back, return it. This can happen in
11429 the context of most_specialized_partial_spec. */
11430 else if (TREE_CODE (new_type
) == TEMPLATE_DECL
)
11433 /* The new TEMPLATE_DECL was built in
11434 reduce_template_parm_level. */
11435 r
= TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (new_type
);
11439 /* We might already have an instance of this template.
11440 The ARGS are for the surrounding class type, so the
11441 full args contain the tsubst'd args for the context,
11442 plus the innermost args from the template decl. */
11443 tmpl_args
= DECL_CLASS_TEMPLATE_P (t
)
11444 ? CLASSTYPE_TI_ARGS (TREE_TYPE (t
))
11445 : DECL_TI_ARGS (DECL_TEMPLATE_RESULT (t
));
11446 /* Because this is a template, the arguments will still be
11447 dependent, even after substitution. If
11448 PROCESSING_TEMPLATE_DECL is not set, the dependency
11449 predicates will short-circuit. */
11450 ++processing_template_decl
;
11451 full_args
= tsubst_template_args (tmpl_args
, args
,
11452 complain
, in_decl
);
11453 --processing_template_decl
;
11454 if (full_args
== error_mark_node
)
11455 RETURN (error_mark_node
);
11457 /* If this is a default template template argument,
11458 tsubst might not have changed anything. */
11459 if (full_args
== tmpl_args
)
11462 hash
= hash_tmpl_and_args (t
, full_args
);
11463 spec
= retrieve_specialization (t
, full_args
, hash
);
11464 if (spec
!= NULL_TREE
)
11470 /* Make a new template decl. It will be similar to the
11471 original, but will record the current template arguments.
11472 We also create a new function declaration, which is just
11473 like the old one, but points to this new template, rather
11474 than the old one. */
11476 gcc_assert (DECL_LANG_SPECIFIC (r
) != 0);
11477 DECL_CHAIN (r
) = NULL_TREE
;
11479 // Build new template info linking to the original template decl.
11480 DECL_TEMPLATE_INFO (r
) = build_template_info (t
, args
);
11482 if (TREE_CODE (decl
) == TYPE_DECL
11483 && !TYPE_DECL_ALIAS_P (decl
))
11486 ++processing_template_decl
;
11487 new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11488 --processing_template_decl
;
11489 if (new_type
== error_mark_node
)
11490 RETURN (error_mark_node
);
11492 TREE_TYPE (r
) = new_type
;
11493 /* For a partial specialization, we need to keep pointing to
11494 the primary template. */
11495 if (!DECL_TEMPLATE_SPECIALIZATION (t
))
11496 CLASSTYPE_TI_TEMPLATE (new_type
) = r
;
11497 DECL_TEMPLATE_RESULT (r
) = TYPE_MAIN_DECL (new_type
);
11498 DECL_TI_ARGS (r
) = CLASSTYPE_TI_ARGS (new_type
);
11499 DECL_CONTEXT (r
) = TYPE_CONTEXT (new_type
);
11504 ++processing_template_decl
;
11505 new_decl
= tsubst (decl
, args
, complain
, in_decl
);
11506 --processing_template_decl
;
11507 if (new_decl
== error_mark_node
)
11508 RETURN (error_mark_node
);
11510 DECL_TEMPLATE_RESULT (r
) = new_decl
;
11511 DECL_TI_TEMPLATE (new_decl
) = r
;
11512 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
11513 DECL_TI_ARGS (r
) = DECL_TI_ARGS (new_decl
);
11514 DECL_CONTEXT (r
) = DECL_CONTEXT (new_decl
);
11517 SET_DECL_IMPLICIT_INSTANTIATION (r
);
11518 DECL_TEMPLATE_INSTANTIATIONS (r
) = NULL_TREE
;
11519 DECL_TEMPLATE_SPECIALIZATIONS (r
) = NULL_TREE
;
11521 /* The template parameters for this new template are all the
11522 template parameters for the old template, except the
11523 outermost level of parameters. */
11524 DECL_TEMPLATE_PARMS (r
)
11525 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
,
11528 if (PRIMARY_TEMPLATE_P (t
))
11529 DECL_PRIMARY_TEMPLATE (r
) = r
;
11531 if (TREE_CODE (decl
) != TYPE_DECL
&& !VAR_P (decl
))
11532 /* Record this non-type partial instantiation. */
11533 register_specialization (r
, t
,
11534 DECL_TI_ARGS (DECL_TEMPLATE_RESULT (r
)),
11539 case FUNCTION_DECL
:
11542 tree argvec
= NULL_TREE
;
11550 /* Nobody should be tsubst'ing into non-template functions. */
11551 gcc_assert (DECL_TEMPLATE_INFO (t
) != NULL_TREE
);
11553 if (TREE_CODE (DECL_TI_TEMPLATE (t
)) == TEMPLATE_DECL
)
11558 /* If T is not dependent, just return it. We have to
11559 increment PROCESSING_TEMPLATE_DECL because
11560 value_dependent_expression_p assumes that nothing is
11561 dependent when PROCESSING_TEMPLATE_DECL is zero. */
11562 ++processing_template_decl
;
11563 dependent_p
= value_dependent_expression_p (t
);
11564 --processing_template_decl
;
11568 /* Calculate the most general template of which R is a
11569 specialization, and the complete set of arguments used to
11571 gen_tmpl
= most_general_template (DECL_TI_TEMPLATE (t
));
11572 argvec
= tsubst_template_args (DECL_TI_ARGS
11573 (DECL_TEMPLATE_RESULT
11574 (DECL_TI_TEMPLATE (t
))),
11575 args
, complain
, in_decl
);
11576 if (argvec
== error_mark_node
)
11577 RETURN (error_mark_node
);
11579 /* Check to see if we already have this specialization. */
11580 hash
= hash_tmpl_and_args (gen_tmpl
, argvec
);
11581 spec
= retrieve_specialization (gen_tmpl
, argvec
, hash
);
11589 /* We can see more levels of arguments than parameters if
11590 there was a specialization of a member template, like
11593 template <class T> struct S { template <class U> void f(); }
11594 template <> template <class U> void S<int>::f(U);
11596 Here, we'll be substituting into the specialization,
11597 because that's where we can find the code we actually
11598 want to generate, but we'll have enough arguments for
11599 the most general template.
11601 We also deal with the peculiar case:
11603 template <class T> struct S {
11604 template <class U> friend void f();
11606 template <class U> void f() {}
11608 template void f<double>();
11610 Here, the ARGS for the instantiation of will be {int,
11611 double}. But, we only need as many ARGS as there are
11612 levels of template parameters in CODE_PATTERN. We are
11613 careful not to get fooled into reducing the ARGS in
11616 template <class T> struct S { template <class U> void f(U); }
11617 template <class T> template <> void S<T>::f(int) {}
11619 which we can spot because the pattern will be a
11620 specialization in this case. */
11621 args_depth
= TMPL_ARGS_DEPTH (args
);
11623 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (t
)));
11624 if (args_depth
> parms_depth
11625 && !DECL_TEMPLATE_SPECIALIZATION (t
))
11626 args
= get_innermost_template_args (args
, parms_depth
);
11630 /* This special case arises when we have something like this:
11632 template <class T> struct S {
11633 friend void f<int>(int, double);
11636 Here, the DECL_TI_TEMPLATE for the friend declaration
11637 will be an IDENTIFIER_NODE. We are being called from
11638 tsubst_friend_function, and we want only to create a
11639 new decl (R) with appropriate types so that we can call
11640 determine_specialization. */
11641 gen_tmpl
= NULL_TREE
;
11644 if (DECL_CLASS_SCOPE_P (t
))
11646 if (DECL_NAME (t
) == constructor_name (DECL_CONTEXT (t
)))
11650 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
,
11651 complain
, t
, /*entering_scope=*/1);
11656 ctx
= DECL_CONTEXT (t
);
11658 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11659 if (type
== error_mark_node
)
11660 RETURN (error_mark_node
);
11662 /* If we hit excessive deduction depth, the type is bogus even if
11663 it isn't error_mark_node, so don't build a decl. */
11664 if (excessive_deduction_depth
)
11665 RETURN (error_mark_node
);
11667 /* We do NOT check for matching decls pushed separately at this
11668 point, as they may not represent instantiations of this
11669 template, and in any case are considered separate under the
11672 DECL_USE_TEMPLATE (r
) = 0;
11673 TREE_TYPE (r
) = type
;
11674 /* Clear out the mangled name and RTL for the instantiation. */
11675 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
11676 SET_DECL_RTL (r
, NULL
);
11677 /* Leave DECL_INITIAL set on deleted instantiations. */
11678 if (!DECL_DELETED_FN (r
))
11679 DECL_INITIAL (r
) = NULL_TREE
;
11680 DECL_CONTEXT (r
) = ctx
;
11682 /* OpenMP UDRs have the only argument a reference to the declared
11683 type. We want to diagnose if the declared type is a reference,
11684 which is invalid, but as references to references are usually
11685 quietly merged, diagnose it here. */
11686 if (DECL_OMP_DECLARE_REDUCTION_P (t
))
11689 = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (t
))));
11690 argtype
= tsubst (argtype
, args
, complain
, in_decl
);
11691 if (TREE_CODE (argtype
) == REFERENCE_TYPE
)
11692 error_at (DECL_SOURCE_LOCATION (t
),
11693 "reference type %qT in "
11694 "%<#pragma omp declare reduction%>", argtype
);
11695 if (strchr (IDENTIFIER_POINTER (DECL_NAME (t
)), '~') == NULL
)
11696 DECL_NAME (r
) = omp_reduction_id (ERROR_MARK
, DECL_NAME (t
),
11700 if (member
&& DECL_CONV_FN_P (r
))
11701 /* Type-conversion operator. Reconstruct the name, in
11702 case it's the name of one of the template's parameters. */
11703 DECL_NAME (r
) = mangle_conv_op_name_for_type (TREE_TYPE (type
));
11705 DECL_ARGUMENTS (r
) = tsubst (DECL_ARGUMENTS (t
), args
,
11707 DECL_RESULT (r
) = NULL_TREE
;
11709 TREE_STATIC (r
) = 0;
11710 TREE_PUBLIC (r
) = TREE_PUBLIC (t
);
11711 DECL_EXTERNAL (r
) = 1;
11712 /* If this is an instantiation of a function with internal
11713 linkage, we already know what object file linkage will be
11714 assigned to the instantiation. */
11715 DECL_INTERFACE_KNOWN (r
) = !TREE_PUBLIC (r
);
11716 DECL_DEFER_OUTPUT (r
) = 0;
11717 DECL_CHAIN (r
) = NULL_TREE
;
11718 DECL_PENDING_INLINE_INFO (r
) = 0;
11719 DECL_PENDING_INLINE_P (r
) = 0;
11720 DECL_SAVED_TREE (r
) = NULL_TREE
;
11721 DECL_STRUCT_FUNCTION (r
) = NULL
;
11723 /* We'll re-clone as appropriate in instantiate_template. */
11724 DECL_CLONED_FUNCTION (r
) = NULL_TREE
;
11726 /* If we aren't complaining now, return on error before we register
11727 the specialization so that we'll complain eventually. */
11728 if ((complain
& tf_error
) == 0
11729 && IDENTIFIER_OPNAME_P (DECL_NAME (r
))
11730 && !grok_op_properties (r
, /*complain=*/false))
11731 RETURN (error_mark_node
);
11733 /* When instantiating a constrained member, substitute
11734 into the constraints to create a new constraint. */
11735 if (tree ci
= get_constraints (t
))
11738 ci
= tsubst_constraint_info (ci
, argvec
, complain
, NULL_TREE
);
11739 set_constraints (r
, ci
);
11742 /* Set up the DECL_TEMPLATE_INFO for R. There's no need to do
11743 this in the special friend case mentioned above where
11744 GEN_TMPL is NULL. */
11747 DECL_TEMPLATE_INFO (r
)
11748 = build_template_info (gen_tmpl
, argvec
);
11749 SET_DECL_IMPLICIT_INSTANTIATION (r
);
11752 = register_specialization (r
, gen_tmpl
, argvec
, false, hash
);
11754 /* We instantiated this while substituting into
11755 the type earlier (template/friend54.C). */
11758 /* We're not supposed to instantiate default arguments
11759 until they are called, for a template. But, for a
11762 template <class T> void f ()
11763 { extern void g(int i = T()); }
11765 we should do the substitution when the template is
11766 instantiated. We handle the member function case in
11767 instantiate_class_template since the default arguments
11768 might refer to other members of the class. */
11770 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
11771 && !uses_template_parms (argvec
))
11772 tsubst_default_arguments (r
, complain
);
11775 DECL_TEMPLATE_INFO (r
) = NULL_TREE
;
11777 /* Copy the list of befriending classes. */
11778 for (friends
= &DECL_BEFRIENDING_CLASSES (r
);
11780 friends
= &TREE_CHAIN (*friends
))
11782 *friends
= copy_node (*friends
);
11783 TREE_VALUE (*friends
) = tsubst (TREE_VALUE (*friends
),
11788 if (DECL_CONSTRUCTOR_P (r
) || DECL_DESTRUCTOR_P (r
))
11790 maybe_retrofit_in_chrg (r
);
11791 if (DECL_CONSTRUCTOR_P (r
))
11792 grok_ctor_properties (ctx
, r
);
11793 if (DECL_INHERITED_CTOR_BASE (r
))
11794 deduce_inheriting_ctor (r
);
11795 /* If this is an instantiation of a member template, clone it.
11796 If it isn't, that'll be handled by
11797 clone_constructors_and_destructors. */
11798 if (PRIMARY_TEMPLATE_P (gen_tmpl
))
11799 clone_function_decl (r
, /*update_method_vec_p=*/0);
11801 else if ((complain
& tf_error
) != 0
11802 && IDENTIFIER_OPNAME_P (DECL_NAME (r
))
11803 && !grok_op_properties (r
, /*complain=*/true))
11804 RETURN (error_mark_node
);
11806 if (DECL_FRIEND_P (t
) && DECL_FRIEND_CONTEXT (t
))
11807 SET_DECL_FRIEND_CONTEXT (r
,
11808 tsubst (DECL_FRIEND_CONTEXT (t
),
11809 args
, complain
, in_decl
));
11811 /* Possibly limit visibility based on template args. */
11812 DECL_VISIBILITY (r
) = VISIBILITY_DEFAULT
;
11813 if (DECL_VISIBILITY_SPECIFIED (t
))
11815 DECL_VISIBILITY_SPECIFIED (r
) = 0;
11816 DECL_ATTRIBUTES (r
)
11817 = remove_attribute ("visibility", DECL_ATTRIBUTES (r
));
11819 determine_visibility (r
);
11820 if (DECL_DEFAULTED_OUTSIDE_CLASS_P (r
)
11821 && !processing_template_decl
)
11822 defaulted_late_check (r
);
11824 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
11825 args
, complain
, in_decl
);
11831 tree type
= NULL_TREE
;
11833 tree expanded_types
= NULL_TREE
;
11834 tree prev_r
= NULL_TREE
;
11835 tree first_r
= NULL_TREE
;
11837 if (DECL_PACK_P (t
))
11839 /* If there is a local specialization that isn't a
11840 parameter pack, it means that we're doing a "simple"
11841 substitution from inside tsubst_pack_expansion. Just
11842 return the local specialization (which will be a single
11844 tree spec
= retrieve_local_specialization (t
);
11846 && TREE_CODE (spec
) == PARM_DECL
11847 && TREE_CODE (TREE_TYPE (spec
)) != TYPE_PACK_EXPANSION
)
11850 /* Expand the TYPE_PACK_EXPANSION that provides the types for
11851 the parameters in this function parameter pack. */
11852 expanded_types
= tsubst_pack_expansion (TREE_TYPE (t
), args
,
11853 complain
, in_decl
);
11854 if (TREE_CODE (expanded_types
) == TREE_VEC
)
11856 len
= TREE_VEC_LENGTH (expanded_types
);
11858 /* Zero-length parameter packs are boring. Just substitute
11861 RETURN (tsubst (TREE_CHAIN (t
), args
, complain
,
11866 /* All we did was update the type. Make a note of that. */
11867 type
= expanded_types
;
11868 expanded_types
= NULL_TREE
;
11872 /* Loop through all of the parameters we'll build. When T is
11873 a function parameter pack, LEN is the number of expanded
11874 types in EXPANDED_TYPES; otherwise, LEN is 1. */
11876 for (i
= 0; i
< len
; ++i
)
11880 if (DECL_TEMPLATE_PARM_P (t
))
11881 SET_DECL_TEMPLATE_PARM_P (r
);
11883 if (expanded_types
)
11884 /* We're on the Ith parameter of the function parameter
11887 /* Get the Ith type. */
11888 type
= TREE_VEC_ELT (expanded_types
, i
);
11890 /* Rename the parameter to include the index. */
11892 = make_ith_pack_parameter_name (DECL_NAME (r
), i
);
11895 /* We're dealing with a normal parameter. */
11896 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11898 type
= type_decays_to (type
);
11899 TREE_TYPE (r
) = type
;
11900 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
11902 if (DECL_INITIAL (r
))
11904 if (TREE_CODE (DECL_INITIAL (r
)) != TEMPLATE_PARM_INDEX
)
11905 DECL_INITIAL (r
) = TREE_TYPE (r
);
11907 DECL_INITIAL (r
) = tsubst (DECL_INITIAL (r
), args
,
11908 complain
, in_decl
);
11911 DECL_CONTEXT (r
) = NULL_TREE
;
11913 if (!DECL_TEMPLATE_PARM_P (r
))
11914 DECL_ARG_TYPE (r
) = type_passed_as (type
);
11916 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
11917 args
, complain
, in_decl
);
11919 /* Keep track of the first new parameter we
11920 generate. That's what will be returned to the
11925 /* Build a proper chain of parameters when substituting
11926 into a function parameter pack. */
11928 DECL_CHAIN (prev_r
) = r
;
11931 /* If cp_unevaluated_operand is set, we're just looking for a
11932 single dummy parameter, so don't keep going. */
11933 if (DECL_CHAIN (t
) && !cp_unevaluated_operand
)
11934 DECL_CHAIN (r
) = tsubst (DECL_CHAIN (t
), args
,
11935 complain
, DECL_CHAIN (t
));
11937 /* FIRST_R contains the start of the chain we've built. */
11944 tree type
= NULL_TREE
;
11945 tree vec
= NULL_TREE
;
11946 tree expanded_types
= NULL_TREE
;
11949 if (PACK_EXPANSION_P (TREE_TYPE (t
)))
11951 /* This field is a lambda capture pack. Return a TREE_VEC of
11952 the expanded fields to instantiate_class_template_1 and
11953 store them in the specializations hash table as a
11954 NONTYPE_ARGUMENT_PACK so that tsubst_copy can find them. */
11955 expanded_types
= tsubst_pack_expansion (TREE_TYPE (t
), args
,
11956 complain
, in_decl
);
11957 if (TREE_CODE (expanded_types
) == TREE_VEC
)
11959 len
= TREE_VEC_LENGTH (expanded_types
);
11960 vec
= make_tree_vec (len
);
11964 /* All we did was update the type. Make a note of that. */
11965 type
= expanded_types
;
11966 expanded_types
= NULL_TREE
;
11970 for (int i
= 0; i
< len
; ++i
)
11973 if (expanded_types
)
11975 type
= TREE_VEC_ELT (expanded_types
, i
);
11977 = make_ith_pack_parameter_name (DECL_NAME (r
), i
);
11980 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11982 if (type
== error_mark_node
)
11983 RETURN (error_mark_node
);
11984 TREE_TYPE (r
) = type
;
11985 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
11987 if (DECL_C_BIT_FIELD (r
))
11988 /* For bit-fields, DECL_INITIAL gives the number of bits. For
11989 non-bit-fields DECL_INITIAL is a non-static data member
11990 initializer, which gets deferred instantiation. */
11992 = tsubst_expr (DECL_INITIAL (t
), args
,
11994 /*integral_constant_expression_p=*/true);
11995 else if (DECL_INITIAL (t
))
11997 /* Set up DECL_TEMPLATE_INFO so that we can get at the
11998 NSDMI in perform_member_init. Still set DECL_INITIAL
11999 so that we know there is one. */
12000 DECL_INITIAL (r
) = void_node
;
12001 gcc_assert (DECL_LANG_SPECIFIC (r
) == NULL
);
12002 retrofit_lang_decl (r
);
12003 DECL_TEMPLATE_INFO (r
) = build_template_info (t
, args
);
12005 /* We don't have to set DECL_CONTEXT here; it is set by
12006 finish_member_declaration. */
12007 DECL_CHAIN (r
) = NULL_TREE
;
12009 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
12010 args
, complain
, in_decl
);
12013 TREE_VEC_ELT (vec
, i
) = r
;
12019 tree pack
= make_node (NONTYPE_ARGUMENT_PACK
);
12020 tree tpack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
12021 SET_ARGUMENT_PACK_ARGS (pack
, vec
);
12022 SET_ARGUMENT_PACK_ARGS (tpack
, expanded_types
);
12023 TREE_TYPE (pack
) = tpack
;
12024 register_specialization (pack
, t
, args
, false, 0);
12030 /* We reach here only for member using decls. We also need to check
12031 uses_template_parms because DECL_DEPENDENT_P is not set for a
12032 using-declaration that designates a member of the current
12033 instantiation (c++/53549). */
12034 if (DECL_DEPENDENT_P (t
)
12035 || uses_template_parms (USING_DECL_SCOPE (t
)))
12037 tree inst_scope
= tsubst_copy (USING_DECL_SCOPE (t
), args
,
12038 complain
, in_decl
);
12039 tree name
= tsubst_copy (DECL_NAME (t
), args
, complain
, in_decl
);
12040 r
= do_class_using_decl (inst_scope
, name
);
12042 r
= error_mark_node
;
12045 TREE_PROTECTED (r
) = TREE_PROTECTED (t
);
12046 TREE_PRIVATE (r
) = TREE_PRIVATE (t
);
12052 DECL_CHAIN (r
) = NULL_TREE
;
12059 tree argvec
= NULL_TREE
;
12060 tree gen_tmpl
= NULL_TREE
;
12062 tree tmpl
= NULL_TREE
;
12064 tree type
= NULL_TREE
;
12067 if (TREE_TYPE (t
) == error_mark_node
)
12068 RETURN (error_mark_node
);
12070 if (TREE_CODE (t
) == TYPE_DECL
12071 && t
== TYPE_MAIN_DECL (TREE_TYPE (t
)))
12073 /* If this is the canonical decl, we don't have to
12074 mess with instantiations, and often we can't (for
12075 typename, template type parms and such). Note that
12076 TYPE_NAME is not correct for the above test if
12077 we've copied the type for a typedef. */
12078 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12079 if (type
== error_mark_node
)
12080 RETURN (error_mark_node
);
12081 r
= TYPE_NAME (type
);
12085 /* Check to see if we already have the specialization we
12088 if (DECL_CLASS_SCOPE_P (t
) || DECL_NAMESPACE_SCOPE_P (t
))
12090 /* T is a static data member or namespace-scope entity.
12091 We have to substitute into namespace-scope variables
12092 (not just variable templates) because of cases like:
12094 template <class T> void f() { extern T t; }
12096 where the entity referenced is not known until
12097 instantiation time. */
12099 ctx
= DECL_CONTEXT (t
);
12100 if (DECL_CLASS_SCOPE_P (t
))
12102 ctx
= tsubst_aggr_type (ctx
, args
,
12104 in_decl
, /*entering_scope=*/1);
12105 /* If CTX is unchanged, then T is in fact the
12106 specialization we want. That situation occurs when
12107 referencing a static data member within in its own
12108 class. We can use pointer equality, rather than
12109 same_type_p, because DECL_CONTEXT is always
12111 if (ctx
== DECL_CONTEXT (t
)
12112 /* ... unless T is a member template; in which
12113 case our caller can be willing to create a
12114 specialization of that template represented
12116 && !(DECL_TI_TEMPLATE (t
)
12117 && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (t
))))
12123 tmpl
= DECL_TI_TEMPLATE (t
);
12124 gen_tmpl
= most_general_template (tmpl
);
12125 argvec
= tsubst (DECL_TI_ARGS (t
), args
, complain
, in_decl
);
12126 if (argvec
!= error_mark_node
)
12127 argvec
= (coerce_innermost_template_parms
12128 (DECL_TEMPLATE_PARMS (gen_tmpl
),
12129 argvec
, t
, complain
,
12130 /*all*/true, /*defarg*/true));
12131 if (argvec
== error_mark_node
)
12132 RETURN (error_mark_node
);
12133 hash
= hash_tmpl_and_args (gen_tmpl
, argvec
);
12134 spec
= retrieve_specialization (gen_tmpl
, argvec
, hash
);
12139 /* A local variable. */
12141 /* Subsequent calls to pushdecl will fill this in. */
12143 spec
= retrieve_local_specialization (t
);
12145 /* If we already have the specialization we need, there is
12146 nothing more to do. */
12153 /* Create a new node for the specialization we need. */
12155 if (type
== NULL_TREE
)
12157 if (is_typedef_decl (t
))
12158 type
= DECL_ORIGINAL_TYPE (t
);
12160 type
= TREE_TYPE (t
);
12162 && VAR_HAD_UNKNOWN_BOUND (t
)
12163 && type
!= error_mark_node
)
12164 type
= strip_array_domain (type
);
12165 type
= tsubst (type
, args
, complain
, in_decl
);
12169 /* Even if the original location is out of scope, the
12170 newly substituted one is not. */
12171 DECL_DEAD_FOR_LOCAL (r
) = 0;
12172 DECL_INITIALIZED_P (r
) = 0;
12173 DECL_TEMPLATE_INSTANTIATED (r
) = 0;
12174 if (type
== error_mark_node
)
12175 RETURN (error_mark_node
);
12176 if (TREE_CODE (type
) == FUNCTION_TYPE
)
12178 /* It may seem that this case cannot occur, since:
12183 declares a function, not a variable. However:
12186 template <typename T> void g() { T t; }
12187 template void g<f>();
12189 is an attempt to declare a variable with function
12191 error ("variable %qD has function type",
12192 /* R is not yet sufficiently initialized, so we
12193 just use its name. */
12195 RETURN (error_mark_node
);
12197 type
= complete_type (type
);
12198 /* Wait until cp_finish_decl to set this again, to handle
12199 circular dependency (template/instantiate6.C). */
12200 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r
) = 0;
12201 type
= check_var_type (DECL_NAME (r
), type
);
12203 if (DECL_HAS_VALUE_EXPR_P (t
))
12205 tree ve
= DECL_VALUE_EXPR (t
);
12206 ve
= tsubst_expr (ve
, args
, complain
, in_decl
,
12207 /*constant_expression_p=*/false);
12208 if (REFERENCE_REF_P (ve
))
12210 gcc_assert (TREE_CODE (type
) == REFERENCE_TYPE
);
12211 ve
= TREE_OPERAND (ve
, 0);
12213 SET_DECL_VALUE_EXPR (r
, ve
);
12215 if (CP_DECL_THREAD_LOCAL_P (r
)
12216 && !processing_template_decl
)
12217 set_decl_tls_model (r
, decl_default_tls_model (r
));
12219 else if (DECL_SELF_REFERENCE_P (t
))
12220 SET_DECL_SELF_REFERENCE_P (r
);
12221 TREE_TYPE (r
) = type
;
12222 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
12223 DECL_CONTEXT (r
) = ctx
;
12224 /* Clear out the mangled name and RTL for the instantiation. */
12225 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
12226 if (CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_DECL_WRTL
))
12227 SET_DECL_RTL (r
, NULL
);
12228 /* The initializer must not be expanded until it is required;
12229 see [temp.inst]. */
12230 DECL_INITIAL (r
) = NULL_TREE
;
12231 if (CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_DECL_WRTL
))
12232 SET_DECL_RTL (r
, NULL
);
12233 DECL_SIZE (r
) = DECL_SIZE_UNIT (r
) = 0;
12236 /* Possibly limit visibility based on template args. */
12237 DECL_VISIBILITY (r
) = VISIBILITY_DEFAULT
;
12238 if (DECL_VISIBILITY_SPECIFIED (t
))
12240 DECL_VISIBILITY_SPECIFIED (r
) = 0;
12241 DECL_ATTRIBUTES (r
)
12242 = remove_attribute ("visibility", DECL_ATTRIBUTES (r
));
12244 determine_visibility (r
);
12249 /* A static data member declaration is always marked
12250 external when it is declared in-class, even if an
12251 initializer is present. We mimic the non-template
12252 processing here. */
12253 DECL_EXTERNAL (r
) = 1;
12254 if (DECL_NAMESPACE_SCOPE_P (t
))
12255 DECL_NOT_REALLY_EXTERN (r
) = 1;
12257 DECL_TEMPLATE_INFO (r
) = build_template_info (tmpl
, argvec
);
12258 SET_DECL_IMPLICIT_INSTANTIATION (r
);
12259 register_specialization (r
, gen_tmpl
, argvec
, false, hash
);
12261 else if (!cp_unevaluated_operand
)
12262 register_local_specialization (r
, t
);
12264 DECL_CHAIN (r
) = NULL_TREE
;
12266 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
),
12268 args
, complain
, in_decl
);
12270 /* Preserve a typedef that names a type. */
12271 if (is_typedef_decl (r
))
12273 DECL_ORIGINAL_TYPE (r
) = NULL_TREE
;
12274 set_underlying_type (r
);
12275 if (TYPE_DECL_ALIAS_P (r
) && type
!= error_mark_node
)
12276 /* An alias template specialization can be dependent
12277 even if its underlying type is not. */
12278 TYPE_DEPENDENT_P_VALID (TREE_TYPE (r
)) = false;
12281 layout_decl (r
, 0);
12286 gcc_unreachable ();
12291 /* Restore the file and line information. */
12292 input_location
= saved_loc
;
12297 /* Substitute into the ARG_TYPES of a function type.
12298 If END is a TREE_CHAIN, leave it and any following types
12302 tsubst_arg_types (tree arg_types
,
12305 tsubst_flags_t complain
,
12308 tree remaining_arg_types
;
12309 tree type
= NULL_TREE
;
12311 tree expanded_args
= NULL_TREE
;
12314 if (!arg_types
|| arg_types
== void_list_node
|| arg_types
== end
)
12317 remaining_arg_types
= tsubst_arg_types (TREE_CHAIN (arg_types
),
12318 args
, end
, complain
, in_decl
);
12319 if (remaining_arg_types
== error_mark_node
)
12320 return error_mark_node
;
12322 if (PACK_EXPANSION_P (TREE_VALUE (arg_types
)))
12324 /* For a pack expansion, perform substitution on the
12325 entire expression. Later on, we'll handle the arguments
12327 expanded_args
= tsubst_pack_expansion (TREE_VALUE (arg_types
),
12328 args
, complain
, in_decl
);
12330 if (TREE_CODE (expanded_args
) == TREE_VEC
)
12331 /* So that we'll spin through the parameters, one by one. */
12332 i
= TREE_VEC_LENGTH (expanded_args
);
12335 /* We only partially substituted into the parameter
12336 pack. Our type is TYPE_PACK_EXPANSION. */
12337 type
= expanded_args
;
12338 expanded_args
= NULL_TREE
;
12346 type
= TREE_VEC_ELT (expanded_args
, i
);
12348 type
= tsubst (TREE_VALUE (arg_types
), args
, complain
, in_decl
);
12350 if (type
== error_mark_node
)
12351 return error_mark_node
;
12352 if (VOID_TYPE_P (type
))
12354 if (complain
& tf_error
)
12356 error ("invalid parameter type %qT", type
);
12358 error ("in declaration %q+D", in_decl
);
12360 return error_mark_node
;
12363 if (abstract_virtuals_error_sfinae (ACU_PARM
, type
, complain
))
12364 return error_mark_node
;
12366 /* Do array-to-pointer, function-to-pointer conversion, and ignore
12367 top-level qualifiers as required. */
12368 type
= cv_unqualified (type_decays_to (type
));
12370 /* We do not substitute into default arguments here. The standard
12371 mandates that they be instantiated only when needed, which is
12372 done in build_over_call. */
12373 default_arg
= TREE_PURPOSE (arg_types
);
12375 if (default_arg
&& TREE_CODE (default_arg
) == DEFAULT_ARG
)
12377 /* We've instantiated a template before its default arguments
12378 have been parsed. This can happen for a nested template
12379 class, and is not an error unless we require the default
12380 argument in a call of this function. */
12381 remaining_arg_types
=
12382 tree_cons (default_arg
, type
, remaining_arg_types
);
12383 vec_safe_push (DEFARG_INSTANTIATIONS(default_arg
), remaining_arg_types
);
12386 remaining_arg_types
=
12387 hash_tree_cons (default_arg
, type
, remaining_arg_types
);
12390 return remaining_arg_types
;
12393 /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does
12394 *not* handle the exception-specification for FNTYPE, because the
12395 initial substitution of explicitly provided template parameters
12396 during argument deduction forbids substitution into the
12397 exception-specification:
12401 All references in the function type of the function template to the
12402 corresponding template parameters are replaced by the specified tem-
12403 plate argument values. If a substitution in a template parameter or
12404 in the function type of the function template results in an invalid
12405 type, type deduction fails. [Note: The equivalent substitution in
12406 exception specifications is done only when the function is instanti-
12407 ated, at which point a program is ill-formed if the substitution
12408 results in an invalid type.] */
12411 tsubst_function_type (tree t
,
12413 tsubst_flags_t complain
,
12417 tree arg_types
= NULL_TREE
;
12420 /* The TYPE_CONTEXT is not used for function/method types. */
12421 gcc_assert (TYPE_CONTEXT (t
) == NULL_TREE
);
12423 /* DR 1227: Mixing immediate and non-immediate contexts in deduction
12425 bool late_return_type_p
= TYPE_HAS_LATE_RETURN_TYPE (t
);
12427 if (late_return_type_p
)
12429 /* Substitute the argument types. */
12430 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
, NULL_TREE
,
12431 complain
, in_decl
);
12432 if (arg_types
== error_mark_node
)
12433 return error_mark_node
;
12435 tree save_ccp
= current_class_ptr
;
12436 tree save_ccr
= current_class_ref
;
12437 tree this_type
= (TREE_CODE (t
) == METHOD_TYPE
12438 ? TREE_TYPE (TREE_VALUE (arg_types
)) : NULL_TREE
);
12439 bool do_inject
= this_type
&& CLASS_TYPE_P (this_type
);
12442 /* DR 1207: 'this' is in scope in the trailing return type. */
12443 inject_this_parameter (this_type
, cp_type_quals (this_type
));
12446 /* Substitute the return type. */
12447 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12451 current_class_ptr
= save_ccp
;
12452 current_class_ref
= save_ccr
;
12456 /* Substitute the return type. */
12457 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12459 if (return_type
== error_mark_node
)
12460 return error_mark_node
;
12461 /* DR 486 clarifies that creation of a function type with an
12462 invalid return type is a deduction failure. */
12463 if (TREE_CODE (return_type
) == ARRAY_TYPE
12464 || TREE_CODE (return_type
) == FUNCTION_TYPE
)
12466 if (complain
& tf_error
)
12468 if (TREE_CODE (return_type
) == ARRAY_TYPE
)
12469 error ("function returning an array");
12471 error ("function returning a function");
12473 return error_mark_node
;
12476 if (abstract_virtuals_error_sfinae (ACU_RETURN
, return_type
, complain
))
12477 return error_mark_node
;
12479 if (!late_return_type_p
)
12481 /* Substitute the argument types. */
12482 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
, NULL_TREE
,
12483 complain
, in_decl
);
12484 if (arg_types
== error_mark_node
)
12485 return error_mark_node
;
12488 /* Construct a new type node and return it. */
12489 if (TREE_CODE (t
) == FUNCTION_TYPE
)
12491 fntype
= build_function_type (return_type
, arg_types
);
12492 fntype
= apply_memfn_quals (fntype
,
12493 type_memfn_quals (t
),
12494 type_memfn_rqual (t
));
12498 tree r
= TREE_TYPE (TREE_VALUE (arg_types
));
12499 /* Don't pick up extra function qualifiers from the basetype. */
12500 r
= cp_build_qualified_type_real (r
, type_memfn_quals (t
), complain
);
12501 if (! MAYBE_CLASS_TYPE_P (r
))
12505 Type deduction may fail for any of the following
12508 -- Attempting to create "pointer to member of T" when T
12509 is not a class type. */
12510 if (complain
& tf_error
)
12511 error ("creating pointer to member function of non-class type %qT",
12513 return error_mark_node
;
12516 fntype
= build_method_type_directly (r
, return_type
,
12517 TREE_CHAIN (arg_types
));
12518 fntype
= build_ref_qualified_type (fntype
, type_memfn_rqual (t
));
12520 fntype
= cp_build_type_attribute_variant (fntype
, TYPE_ATTRIBUTES (t
));
12522 if (late_return_type_p
)
12523 TYPE_HAS_LATE_RETURN_TYPE (fntype
) = 1;
12528 /* FNTYPE is a FUNCTION_TYPE or METHOD_TYPE. Substitute the template
12529 ARGS into that specification, and return the substituted
12530 specification. If there is no specification, return NULL_TREE. */
12533 tsubst_exception_specification (tree fntype
,
12535 tsubst_flags_t complain
,
12542 specs
= TYPE_RAISES_EXCEPTIONS (fntype
);
12543 new_specs
= NULL_TREE
;
12544 if (specs
&& TREE_PURPOSE (specs
))
12546 /* A noexcept-specifier. */
12547 tree expr
= TREE_PURPOSE (specs
);
12548 if (TREE_CODE (expr
) == INTEGER_CST
)
12552 /* Defer instantiation of noexcept-specifiers to avoid
12553 excessive instantiations (c++/49107). */
12554 new_specs
= make_node (DEFERRED_NOEXCEPT
);
12555 if (DEFERRED_NOEXCEPT_SPEC_P (specs
))
12557 /* We already partially instantiated this member template,
12558 so combine the new args with the old. */
12559 DEFERRED_NOEXCEPT_PATTERN (new_specs
)
12560 = DEFERRED_NOEXCEPT_PATTERN (expr
);
12561 DEFERRED_NOEXCEPT_ARGS (new_specs
)
12562 = add_to_template_args (DEFERRED_NOEXCEPT_ARGS (expr
), args
);
12566 DEFERRED_NOEXCEPT_PATTERN (new_specs
) = expr
;
12567 DEFERRED_NOEXCEPT_ARGS (new_specs
) = args
;
12571 new_specs
= tsubst_copy_and_build
12572 (expr
, args
, complain
, in_decl
, /*function_p=*/false,
12573 /*integral_constant_expression_p=*/true);
12574 new_specs
= build_noexcept_spec (new_specs
, complain
);
12578 if (! TREE_VALUE (specs
))
12585 tree expanded_specs
= NULL_TREE
;
12587 if (PACK_EXPANSION_P (TREE_VALUE (specs
)))
12589 /* Expand the pack expansion type. */
12590 expanded_specs
= tsubst_pack_expansion (TREE_VALUE (specs
),
12594 if (expanded_specs
== error_mark_node
)
12595 return error_mark_node
;
12596 else if (TREE_CODE (expanded_specs
) == TREE_VEC
)
12597 len
= TREE_VEC_LENGTH (expanded_specs
);
12600 /* We're substituting into a member template, so
12601 we got a TYPE_PACK_EXPANSION back. Add that
12602 expansion and move on. */
12603 gcc_assert (TREE_CODE (expanded_specs
)
12604 == TYPE_PACK_EXPANSION
);
12605 new_specs
= add_exception_specifier (new_specs
,
12608 specs
= TREE_CHAIN (specs
);
12613 for (i
= 0; i
< len
; ++i
)
12615 if (expanded_specs
)
12616 spec
= TREE_VEC_ELT (expanded_specs
, i
);
12618 spec
= tsubst (TREE_VALUE (specs
), args
, complain
, in_decl
);
12619 if (spec
== error_mark_node
)
12621 new_specs
= add_exception_specifier (new_specs
, spec
,
12625 specs
= TREE_CHAIN (specs
);
12631 /* Take the tree structure T and replace template parameters used
12632 therein with the argument vector ARGS. IN_DECL is an associated
12633 decl for diagnostics. If an error occurs, returns ERROR_MARK_NODE.
12634 Issue error and warning messages under control of COMPLAIN. Note
12635 that we must be relatively non-tolerant of extensions here, in
12636 order to preserve conformance; if we allow substitutions that
12637 should not be allowed, we may allow argument deductions that should
12638 not succeed, and therefore report ambiguous overload situations
12639 where there are none. In theory, we could allow the substitution,
12640 but indicate that it should have failed, and allow our caller to
12641 make sure that the right thing happens, but we don't try to do this
12644 This function is used for dealing with types, decls and the like;
12645 for expressions, use tsubst_expr or tsubst_copy. */
12648 tsubst (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
12650 enum tree_code code
;
12651 tree type
, r
= NULL_TREE
;
12653 if (t
== NULL_TREE
|| t
== error_mark_node
12654 || t
== integer_type_node
12655 || t
== void_type_node
12656 || t
== char_type_node
12657 || t
== unknown_type_node
12658 || TREE_CODE (t
) == NAMESPACE_DECL
12659 || TREE_CODE (t
) == TRANSLATION_UNIT_DECL
)
12663 return tsubst_decl (t
, args
, complain
);
12665 if (args
== NULL_TREE
)
12668 code
= TREE_CODE (t
);
12670 if (code
== IDENTIFIER_NODE
)
12671 type
= IDENTIFIER_TYPE_VALUE (t
);
12673 type
= TREE_TYPE (t
);
12675 gcc_assert (type
!= unknown_type_node
);
12677 /* Reuse typedefs. We need to do this to handle dependent attributes,
12678 such as attribute aligned. */
12680 && typedef_variant_p (t
))
12682 tree decl
= TYPE_NAME (t
);
12684 if (alias_template_specialization_p (t
))
12686 /* DECL represents an alias template and we want to
12688 tree tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
12689 tree gen_args
= tsubst (DECL_TI_ARGS (decl
), args
, complain
, in_decl
);
12690 r
= instantiate_alias_template (tmpl
, gen_args
, complain
);
12692 else if (DECL_CLASS_SCOPE_P (decl
)
12693 && CLASSTYPE_TEMPLATE_INFO (DECL_CONTEXT (decl
))
12694 && uses_template_parms (DECL_CONTEXT (decl
)))
12696 tree tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
12697 tree gen_args
= tsubst (DECL_TI_ARGS (decl
), args
, complain
, in_decl
);
12698 r
= retrieve_specialization (tmpl
, gen_args
, 0);
12700 else if (DECL_FUNCTION_SCOPE_P (decl
)
12701 && DECL_TEMPLATE_INFO (DECL_CONTEXT (decl
))
12702 && uses_template_parms (DECL_TI_ARGS (DECL_CONTEXT (decl
))))
12703 r
= retrieve_local_specialization (decl
);
12705 /* The typedef is from a non-template context. */
12711 r
= cp_build_qualified_type_real
12712 (r
, cp_type_quals (t
) | cp_type_quals (r
),
12713 complain
| tf_ignore_bad_quals
);
12718 /* We don't have an instantiation yet, so drop the typedef. */
12719 int quals
= cp_type_quals (t
);
12720 t
= DECL_ORIGINAL_TYPE (decl
);
12721 t
= cp_build_qualified_type_real (t
, quals
,
12722 complain
| tf_ignore_bad_quals
);
12727 && code
!= TYPENAME_TYPE
12728 && code
!= TEMPLATE_TYPE_PARM
12729 && code
!= IDENTIFIER_NODE
12730 && code
!= FUNCTION_TYPE
12731 && code
!= METHOD_TYPE
)
12732 type
= tsubst (type
, args
, complain
, in_decl
);
12733 if (type
== error_mark_node
)
12734 return error_mark_node
;
12740 case ENUMERAL_TYPE
:
12741 return tsubst_aggr_type (t
, args
, complain
, in_decl
,
12742 /*entering_scope=*/0);
12745 case IDENTIFIER_NODE
:
12756 if (t
== integer_type_node
)
12759 if (TREE_CODE (TYPE_MIN_VALUE (t
)) == INTEGER_CST
12760 && TREE_CODE (TYPE_MAX_VALUE (t
)) == INTEGER_CST
)
12764 tree max
, omax
= TREE_OPERAND (TYPE_MAX_VALUE (t
), 0);
12766 max
= tsubst_expr (omax
, args
, complain
, in_decl
,
12767 /*integral_constant_expression_p=*/false);
12769 /* Fix up type of the magic NOP_EXPR with TREE_SIDE_EFFECTS if
12771 if (TREE_CODE (max
) == NOP_EXPR
12772 && TREE_SIDE_EFFECTS (omax
)
12773 && !TREE_TYPE (max
))
12774 TREE_TYPE (max
) = TREE_TYPE (TREE_OPERAND (max
, 0));
12776 /* If we're in a partial instantiation, preserve the magic NOP_EXPR
12777 with TREE_SIDE_EFFECTS that indicates this is not an integral
12778 constant expression. */
12779 if (processing_template_decl
12780 && TREE_SIDE_EFFECTS (omax
) && TREE_CODE (omax
) == NOP_EXPR
)
12782 gcc_assert (TREE_CODE (max
) == NOP_EXPR
);
12783 TREE_SIDE_EFFECTS (max
) = 1;
12786 return compute_array_index_type (NULL_TREE
, max
, complain
);
12789 case TEMPLATE_TYPE_PARM
:
12790 case TEMPLATE_TEMPLATE_PARM
:
12791 case BOUND_TEMPLATE_TEMPLATE_PARM
:
12792 case TEMPLATE_PARM_INDEX
:
12797 tree arg
= NULL_TREE
;
12799 /* Early in template argument deduction substitution, we don't
12800 want to reduce the level of 'auto', or it will be confused
12801 with a normal template parm in subsequent deduction. */
12802 if (is_auto (t
) && (complain
& tf_partial
))
12807 gcc_assert (TREE_VEC_LENGTH (args
) > 0);
12808 template_parm_level_and_index (t
, &level
, &idx
);
12810 levels
= TMPL_ARGS_DEPTH (args
);
12811 if (level
<= levels
12812 && TREE_VEC_LENGTH (TMPL_ARGS_LEVEL (args
, level
)) > 0)
12814 arg
= TMPL_ARG (args
, level
, idx
);
12816 if (arg
&& TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
12818 /* See through ARGUMENT_PACK_SELECT arguments. */
12819 arg
= ARGUMENT_PACK_SELECT_ARG (arg
);
12820 /* If the selected argument is an expansion E, that most
12821 likely means we were called from
12822 gen_elem_of_pack_expansion_instantiation during the
12823 substituting of pack an argument pack (which Ith
12824 element is a pack expansion, where I is
12825 ARGUMENT_PACK_SELECT_INDEX) into a pack expansion.
12826 In this case, the Ith element resulting from this
12827 substituting is going to be a pack expansion, which
12828 pattern is the pattern of E. Let's return the
12830 gen_elem_of_pack_expansion_instantiation will
12831 build the resulting pack expansion from it. */
12832 if (PACK_EXPANSION_P (arg
))
12834 /* Make sure we aren't throwing away arg info. */
12835 gcc_assert (!PACK_EXPANSION_EXTRA_ARGS (arg
));
12836 arg
= PACK_EXPANSION_PATTERN (arg
);
12841 if (arg
== error_mark_node
)
12842 return error_mark_node
;
12843 else if (arg
!= NULL_TREE
)
12845 if (ARGUMENT_PACK_P (arg
))
12846 /* If ARG is an argument pack, we don't actually want to
12847 perform a substitution here, because substitutions
12848 for argument packs are only done
12849 element-by-element. We can get to this point when
12850 substituting the type of a non-type template
12851 parameter pack, when that type actually contains
12852 template parameter packs from an outer template, e.g.,
12854 template<typename... Types> struct A {
12855 template<Types... Values> struct B { };
12859 if (code
== TEMPLATE_TYPE_PARM
)
12862 gcc_assert (TYPE_P (arg
));
12864 quals
= cp_type_quals (arg
) | cp_type_quals (t
);
12866 return cp_build_qualified_type_real
12867 (arg
, quals
, complain
| tf_ignore_bad_quals
);
12869 else if (code
== BOUND_TEMPLATE_TEMPLATE_PARM
)
12871 /* We are processing a type constructed from a
12872 template template parameter. */
12873 tree argvec
= tsubst (TYPE_TI_ARGS (t
),
12874 args
, complain
, in_decl
);
12875 if (argvec
== error_mark_node
)
12876 return error_mark_node
;
12878 gcc_assert (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
12879 || TREE_CODE (arg
) == TEMPLATE_DECL
12880 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
);
12882 if (TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
)
12883 /* Consider this code:
12885 template <template <class> class Template>
12887 template <class Arg> using Bind = Template<Arg>;
12890 template <template <class> class Template, class Arg>
12891 using Instantiate = Template<Arg>; //#0
12893 template <template <class> class Template,
12896 Instantiate<Internal<Template>::template Bind,
12899 When #1 is parsed, the
12900 BOUND_TEMPLATE_TEMPLATE_PARM representing the
12901 parameter `Template' in #0 matches the
12902 UNBOUND_CLASS_TEMPLATE representing the argument
12903 `Internal<Template>::template Bind'; We then want
12904 to assemble the type `Bind<Argument>' that can't
12905 be fully created right now, because
12906 `Internal<Template>' not being complete, the Bind
12907 template cannot be looked up in that context. So
12908 we need to "store" `Bind<Argument>' for later
12909 when the context of Bind becomes complete. Let's
12910 store that in a TYPENAME_TYPE. */
12911 return make_typename_type (TYPE_CONTEXT (arg
),
12912 build_nt (TEMPLATE_ID_EXPR
,
12913 TYPE_IDENTIFIER (arg
),
12918 /* We can get a TEMPLATE_TEMPLATE_PARM here when we
12919 are resolving nested-types in the signature of a
12920 member function templates. Otherwise ARG is a
12921 TEMPLATE_DECL and is the real template to be
12923 if (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
12924 arg
= TYPE_NAME (arg
);
12926 r
= lookup_template_class (arg
,
12928 DECL_CONTEXT (arg
),
12929 /*entering_scope=*/0,
12931 return cp_build_qualified_type_real
12932 (r
, cp_type_quals (t
) | cp_type_quals (r
), complain
);
12935 /* TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX. */
12936 return convert_from_reference (unshare_expr (arg
));
12940 /* This can happen during the attempted tsubst'ing in
12941 unify. This means that we don't yet have any information
12942 about the template parameter in question. */
12945 /* If we get here, we must have been looking at a parm for a
12946 more deeply nested template. Make a new version of this
12947 template parameter, but with a lower level. */
12950 case TEMPLATE_TYPE_PARM
:
12951 case TEMPLATE_TEMPLATE_PARM
:
12952 case BOUND_TEMPLATE_TEMPLATE_PARM
:
12953 if (cp_type_quals (t
))
12955 r
= tsubst (TYPE_MAIN_VARIANT (t
), args
, complain
, in_decl
);
12956 r
= cp_build_qualified_type_real
12957 (r
, cp_type_quals (t
),
12958 complain
| (code
== TEMPLATE_TYPE_PARM
12959 ? tf_ignore_bad_quals
: 0));
12961 else if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
12962 && PLACEHOLDER_TYPE_CONSTRAINTS (t
)
12963 && (r
= (TEMPLATE_PARM_DESCENDANTS
12964 (TEMPLATE_TYPE_PARM_INDEX (t
))))
12965 && (r
= TREE_TYPE (r
))
12966 && !PLACEHOLDER_TYPE_CONSTRAINTS (r
))
12967 /* Break infinite recursion when substituting the constraints
12968 of a constrained placeholder. */;
12972 TEMPLATE_TYPE_PARM_INDEX (r
)
12973 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (t
),
12974 r
, levels
, args
, complain
);
12975 TYPE_STUB_DECL (r
) = TYPE_NAME (r
) = TEMPLATE_TYPE_DECL (r
);
12976 TYPE_MAIN_VARIANT (r
) = r
;
12977 TYPE_POINTER_TO (r
) = NULL_TREE
;
12978 TYPE_REFERENCE_TO (r
) = NULL_TREE
;
12980 if (TREE_CODE (r
) == TEMPLATE_TEMPLATE_PARM
)
12981 /* We have reduced the level of the template
12982 template parameter, but not the levels of its
12983 template parameters, so canonical_type_parameter
12984 will not be able to find the canonical template
12985 template parameter for this level. Thus, we
12986 require structural equality checking to compare
12987 TEMPLATE_TEMPLATE_PARMs. */
12988 SET_TYPE_STRUCTURAL_EQUALITY (r
);
12989 else if (TYPE_STRUCTURAL_EQUALITY_P (t
))
12990 SET_TYPE_STRUCTURAL_EQUALITY (r
);
12992 TYPE_CANONICAL (r
) = canonical_type_parameter (r
);
12994 /* Propagate constraints on placeholders. */
12995 if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
12996 if (tree constr
= PLACEHOLDER_TYPE_CONSTRAINTS (t
))
12997 PLACEHOLDER_TYPE_CONSTRAINTS (r
)
12998 = tsubst_constraint (constr
, args
, complain
, in_decl
);
13000 if (code
== BOUND_TEMPLATE_TEMPLATE_PARM
)
13002 tree argvec
= tsubst (TYPE_TI_ARGS (t
), args
,
13003 complain
, in_decl
);
13004 if (argvec
== error_mark_node
)
13005 return error_mark_node
;
13007 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (r
)
13008 = build_template_info (TYPE_TI_TEMPLATE (t
), argvec
);
13013 case TEMPLATE_PARM_INDEX
:
13014 r
= reduce_template_parm_level (t
, type
, levels
, args
, complain
);
13018 gcc_unreachable ();
13026 tree purpose
, value
, chain
;
13028 if (t
== void_list_node
)
13031 purpose
= TREE_PURPOSE (t
);
13034 purpose
= tsubst (purpose
, args
, complain
, in_decl
);
13035 if (purpose
== error_mark_node
)
13036 return error_mark_node
;
13038 value
= TREE_VALUE (t
);
13041 value
= tsubst (value
, args
, complain
, in_decl
);
13042 if (value
== error_mark_node
)
13043 return error_mark_node
;
13045 chain
= TREE_CHAIN (t
);
13046 if (chain
&& chain
!= void_type_node
)
13048 chain
= tsubst (chain
, args
, complain
, in_decl
);
13049 if (chain
== error_mark_node
)
13050 return error_mark_node
;
13052 if (purpose
== TREE_PURPOSE (t
)
13053 && value
== TREE_VALUE (t
)
13054 && chain
== TREE_CHAIN (t
))
13056 return hash_tree_cons (purpose
, value
, chain
);
13060 /* We should never be tsubsting a binfo. */
13061 gcc_unreachable ();
13064 /* A vector of template arguments. */
13065 gcc_assert (!type
);
13066 return tsubst_template_args (t
, args
, complain
, in_decl
);
13069 case REFERENCE_TYPE
:
13071 if (type
== TREE_TYPE (t
) && TREE_CODE (type
) != METHOD_TYPE
)
13076 Type deduction may fail for any of the following
13079 -- Attempting to create a pointer to reference type.
13080 -- Attempting to create a reference to a reference type or
13081 a reference to void.
13083 Core issue 106 says that creating a reference to a reference
13084 during instantiation is no longer a cause for failure. We
13085 only enforce this check in strict C++98 mode. */
13086 if ((TREE_CODE (type
) == REFERENCE_TYPE
13087 && (((cxx_dialect
== cxx98
) && flag_iso
) || code
!= REFERENCE_TYPE
))
13088 || (code
== REFERENCE_TYPE
&& VOID_TYPE_P (type
)))
13090 static location_t last_loc
;
13092 /* We keep track of the last time we issued this error
13093 message to avoid spewing a ton of messages during a
13094 single bad template instantiation. */
13095 if (complain
& tf_error
13096 && last_loc
!= input_location
)
13098 if (VOID_TYPE_P (type
))
13099 error ("forming reference to void");
13100 else if (code
== POINTER_TYPE
)
13101 error ("forming pointer to reference type %qT", type
);
13103 error ("forming reference to reference type %qT", type
);
13104 last_loc
= input_location
;
13107 return error_mark_node
;
13109 else if (TREE_CODE (type
) == FUNCTION_TYPE
13110 && (type_memfn_quals (type
) != TYPE_UNQUALIFIED
13111 || type_memfn_rqual (type
) != REF_QUAL_NONE
))
13113 if (complain
& tf_error
)
13115 if (code
== POINTER_TYPE
)
13116 error ("forming pointer to qualified function type %qT",
13119 error ("forming reference to qualified function type %qT",
13122 return error_mark_node
;
13124 else if (code
== POINTER_TYPE
)
13126 r
= build_pointer_type (type
);
13127 if (TREE_CODE (type
) == METHOD_TYPE
)
13128 r
= build_ptrmemfunc_type (r
);
13130 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
13131 /* In C++0x, during template argument substitution, when there is an
13132 attempt to create a reference to a reference type, reference
13133 collapsing is applied as described in [14.3.1/4 temp.arg.type]:
13135 "If a template-argument for a template-parameter T names a type
13136 that is a reference to a type A, an attempt to create the type
13137 'lvalue reference to cv T' creates the type 'lvalue reference to
13138 A,' while an attempt to create the type type rvalue reference to
13139 cv T' creates the type T"
13141 r
= cp_build_reference_type
13143 TYPE_REF_IS_RVALUE (t
) && TYPE_REF_IS_RVALUE (type
));
13145 r
= cp_build_reference_type (type
, TYPE_REF_IS_RVALUE (t
));
13146 r
= cp_build_qualified_type_real (r
, cp_type_quals (t
), complain
);
13148 if (r
!= error_mark_node
)
13149 /* Will this ever be needed for TYPE_..._TO values? */
13156 r
= tsubst (TYPE_OFFSET_BASETYPE (t
), args
, complain
, in_decl
);
13157 if (r
== error_mark_node
|| !MAYBE_CLASS_TYPE_P (r
))
13161 Type deduction may fail for any of the following
13164 -- Attempting to create "pointer to member of T" when T
13165 is not a class type. */
13166 if (complain
& tf_error
)
13167 error ("creating pointer to member of non-class type %qT", r
);
13168 return error_mark_node
;
13170 if (TREE_CODE (type
) == REFERENCE_TYPE
)
13172 if (complain
& tf_error
)
13173 error ("creating pointer to member reference type %qT", type
);
13174 return error_mark_node
;
13176 if (VOID_TYPE_P (type
))
13178 if (complain
& tf_error
)
13179 error ("creating pointer to member of type void");
13180 return error_mark_node
;
13182 gcc_assert (TREE_CODE (type
) != METHOD_TYPE
);
13183 if (TREE_CODE (type
) == FUNCTION_TYPE
)
13185 /* The type of the implicit object parameter gets its
13186 cv-qualifiers from the FUNCTION_TYPE. */
13189 = build_memfn_type (type
, r
, type_memfn_quals (type
),
13190 type_memfn_rqual (type
));
13191 memptr
= build_ptrmemfunc_type (build_pointer_type (method_type
));
13192 return cp_build_qualified_type_real (memptr
, cp_type_quals (t
),
13196 return cp_build_qualified_type_real (build_ptrmem_type (r
, type
),
13200 case FUNCTION_TYPE
:
13205 fntype
= tsubst_function_type (t
, args
, complain
, in_decl
);
13206 if (fntype
== error_mark_node
)
13207 return error_mark_node
;
13209 /* Substitute the exception specification. */
13210 specs
= tsubst_exception_specification (t
, args
, complain
,
13211 in_decl
, /*defer_ok*/true);
13212 if (specs
== error_mark_node
)
13213 return error_mark_node
;
13215 fntype
= build_exception_variant (fntype
, specs
);
13220 tree domain
= tsubst (TYPE_DOMAIN (t
), args
, complain
, in_decl
);
13221 if (domain
== error_mark_node
)
13222 return error_mark_node
;
13224 /* As an optimization, we avoid regenerating the array type if
13225 it will obviously be the same as T. */
13226 if (type
== TREE_TYPE (t
) && domain
== TYPE_DOMAIN (t
))
13229 /* These checks should match the ones in create_array_type_for_decl.
13233 The deduction may fail for any of the following reasons:
13235 -- Attempting to create an array with an element type that
13236 is void, a function type, or a reference type, or [DR337]
13237 an abstract class type. */
13238 if (VOID_TYPE_P (type
)
13239 || TREE_CODE (type
) == FUNCTION_TYPE
13240 || (TREE_CODE (type
) == ARRAY_TYPE
13241 && TYPE_DOMAIN (type
) == NULL_TREE
)
13242 || TREE_CODE (type
) == REFERENCE_TYPE
)
13244 if (complain
& tf_error
)
13245 error ("creating array of %qT", type
);
13246 return error_mark_node
;
13249 if (abstract_virtuals_error_sfinae (ACU_ARRAY
, type
, complain
))
13250 return error_mark_node
;
13252 r
= build_cplus_array_type (type
, domain
);
13254 if (TYPE_USER_ALIGN (t
))
13256 TYPE_ALIGN (r
) = TYPE_ALIGN (t
);
13257 TYPE_USER_ALIGN (r
) = 1;
13263 case TYPENAME_TYPE
:
13265 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
13266 in_decl
, /*entering_scope=*/1);
13267 tree f
= tsubst_copy (TYPENAME_TYPE_FULLNAME (t
), args
,
13268 complain
, in_decl
);
13270 if (ctx
== error_mark_node
|| f
== error_mark_node
)
13271 return error_mark_node
;
13273 if (!MAYBE_CLASS_TYPE_P (ctx
))
13275 if (complain
& tf_error
)
13276 error ("%qT is not a class, struct, or union type", ctx
);
13277 return error_mark_node
;
13279 else if (!uses_template_parms (ctx
) && !TYPE_BEING_DEFINED (ctx
))
13281 /* Normally, make_typename_type does not require that the CTX
13282 have complete type in order to allow things like:
13284 template <class T> struct S { typename S<T>::X Y; };
13286 But, such constructs have already been resolved by this
13287 point, so here CTX really should have complete type, unless
13288 it's a partial instantiation. */
13289 ctx
= complete_type (ctx
);
13290 if (!COMPLETE_TYPE_P (ctx
))
13292 if (complain
& tf_error
)
13293 cxx_incomplete_type_error (NULL_TREE
, ctx
);
13294 return error_mark_node
;
13298 f
= make_typename_type (ctx
, f
, typename_type
,
13299 complain
| tf_keep_type_decl
);
13300 if (f
== error_mark_node
)
13302 if (TREE_CODE (f
) == TYPE_DECL
)
13304 complain
|= tf_ignore_bad_quals
;
13308 if (TREE_CODE (f
) != TYPENAME_TYPE
)
13310 if (TYPENAME_IS_ENUM_P (t
) && TREE_CODE (f
) != ENUMERAL_TYPE
)
13312 if (complain
& tf_error
)
13313 error ("%qT resolves to %qT, which is not an enumeration type",
13316 return error_mark_node
;
13318 else if (TYPENAME_IS_CLASS_P (t
) && !CLASS_TYPE_P (f
))
13320 if (complain
& tf_error
)
13321 error ("%qT resolves to %qT, which is is not a class type",
13324 return error_mark_node
;
13328 return cp_build_qualified_type_real
13329 (f
, cp_type_quals (f
) | cp_type_quals (t
), complain
);
13332 case UNBOUND_CLASS_TEMPLATE
:
13334 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
13335 in_decl
, /*entering_scope=*/1);
13336 tree name
= TYPE_IDENTIFIER (t
);
13337 tree parm_list
= DECL_TEMPLATE_PARMS (TYPE_NAME (t
));
13339 if (ctx
== error_mark_node
|| name
== error_mark_node
)
13340 return error_mark_node
;
13343 parm_list
= tsubst_template_parms (parm_list
, args
, complain
);
13344 return make_unbound_class_template (ctx
, name
, parm_list
, complain
);
13351 ++cp_unevaluated_operand
;
13352 ++c_inhibit_evaluation_warnings
;
13354 type
= tsubst_expr (TYPEOF_TYPE_EXPR (t
), args
,
13356 /*integral_constant_expression_p=*/false);
13358 --cp_unevaluated_operand
;
13359 --c_inhibit_evaluation_warnings
;
13361 type
= finish_typeof (type
);
13362 return cp_build_qualified_type_real (type
,
13364 | cp_type_quals (type
),
13368 case DECLTYPE_TYPE
:
13372 ++cp_unevaluated_operand
;
13373 ++c_inhibit_evaluation_warnings
;
13375 type
= tsubst_copy_and_build (DECLTYPE_TYPE_EXPR (t
), args
,
13376 complain
|tf_decltype
, in_decl
,
13377 /*function_p*/false,
13378 /*integral_constant_expression*/false);
13380 --cp_unevaluated_operand
;
13381 --c_inhibit_evaluation_warnings
;
13383 if (DECLTYPE_FOR_LAMBDA_CAPTURE (t
))
13384 type
= lambda_capture_field_type (type
,
13385 DECLTYPE_FOR_INIT_CAPTURE (t
));
13386 else if (DECLTYPE_FOR_LAMBDA_PROXY (t
))
13387 type
= lambda_proxy_type (type
);
13390 bool id
= DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t
);
13391 if (id
&& TREE_CODE (DECLTYPE_TYPE_EXPR (t
)) == BIT_NOT_EXPR
13393 /* In a template ~id could be either a complement expression
13394 or an unqualified-id naming a destructor; if instantiating
13395 it produces an expression, it's not an id-expression or
13398 type
= finish_decltype_type (type
, id
, complain
);
13400 return cp_build_qualified_type_real (type
,
13402 | cp_type_quals (type
),
13403 complain
| tf_ignore_bad_quals
);
13406 case UNDERLYING_TYPE
:
13408 tree type
= tsubst (UNDERLYING_TYPE_TYPE (t
), args
,
13409 complain
, in_decl
);
13410 return finish_underlying_type (type
);
13413 case TYPE_ARGUMENT_PACK
:
13414 case NONTYPE_ARGUMENT_PACK
:
13416 tree r
= TYPE_P (t
) ? cxx_make_type (code
) : make_node (code
);
13418 tsubst_template_args (ARGUMENT_PACK_ARGS (t
),
13422 SET_ARGUMENT_PACK_ARGS (r
, packed_out
);
13424 /* For template nontype argument packs, also substitute into
13426 if (code
== NONTYPE_ARGUMENT_PACK
)
13427 TREE_TYPE (r
) = tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13446 /* We should use one of the expression tsubsts for these codes. */
13447 gcc_unreachable ();
13450 sorry ("use of %qs in template", get_tree_code_name (code
));
13451 return error_mark_node
;
13455 /* Like tsubst_expr for a BASELINK. OBJECT_TYPE, if non-NULL, is the
13456 type of the expression on the left-hand side of the "." or "->"
13460 tsubst_baselink (tree baselink
, tree object_type
,
13461 tree args
, tsubst_flags_t complain
, tree in_decl
)
13464 tree qualifying_scope
;
13467 tree template_args
= 0;
13468 bool template_id_p
= false;
13469 bool qualified
= BASELINK_QUALIFIED_P (baselink
);
13471 /* A baselink indicates a function from a base class. Both the
13472 BASELINK_ACCESS_BINFO and the base class referenced may
13473 indicate bases of the template class, rather than the
13474 instantiated class. In addition, lookups that were not
13475 ambiguous before may be ambiguous now. Therefore, we perform
13476 the lookup again. */
13477 qualifying_scope
= BINFO_TYPE (BASELINK_ACCESS_BINFO (baselink
));
13478 qualifying_scope
= tsubst (qualifying_scope
, args
,
13479 complain
, in_decl
);
13480 fns
= BASELINK_FUNCTIONS (baselink
);
13481 optype
= tsubst (BASELINK_OPTYPE (baselink
), args
, complain
, in_decl
);
13482 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
13484 template_id_p
= true;
13485 template_args
= TREE_OPERAND (fns
, 1);
13486 fns
= TREE_OPERAND (fns
, 0);
13488 template_args
= tsubst_template_args (template_args
, args
,
13489 complain
, in_decl
);
13491 name
= DECL_NAME (get_first_fn (fns
));
13492 if (IDENTIFIER_TYPENAME_P (name
))
13493 name
= mangle_conv_op_name_for_type (optype
);
13494 baselink
= lookup_fnfields (qualifying_scope
, name
, /*protect=*/1);
13496 return error_mark_node
;
13498 /* If lookup found a single function, mark it as used at this
13499 point. (If it lookup found multiple functions the one selected
13500 later by overload resolution will be marked as used at that
13502 if (BASELINK_P (baselink
))
13503 fns
= BASELINK_FUNCTIONS (baselink
);
13504 if (!template_id_p
&& !really_overloaded_fn (fns
)
13505 && !mark_used (OVL_CURRENT (fns
), complain
) && !(complain
& tf_error
))
13506 return error_mark_node
;
13508 /* Add back the template arguments, if present. */
13509 if (BASELINK_P (baselink
) && template_id_p
)
13510 BASELINK_FUNCTIONS (baselink
)
13511 = build_nt (TEMPLATE_ID_EXPR
,
13512 BASELINK_FUNCTIONS (baselink
),
13514 /* Update the conversion operator type. */
13515 BASELINK_OPTYPE (baselink
) = optype
;
13518 object_type
= current_class_type
;
13521 baselink
= adjust_result_of_qualified_name_lookup (baselink
,
13527 /* Like tsubst_expr for a SCOPE_REF, given by QUALIFIED_ID. DONE is
13528 true if the qualified-id will be a postfix-expression in-and-of
13529 itself; false if more of the postfix-expression follows the
13530 QUALIFIED_ID. ADDRESS_P is true if the qualified-id is the operand
13534 tsubst_qualified_id (tree qualified_id
, tree args
,
13535 tsubst_flags_t complain
, tree in_decl
,
13536 bool done
, bool address_p
)
13542 tree template_args
;
13543 location_t loc
= UNKNOWN_LOCATION
;
13545 gcc_assert (TREE_CODE (qualified_id
) == SCOPE_REF
);
13547 /* Figure out what name to look up. */
13548 name
= TREE_OPERAND (qualified_id
, 1);
13549 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
13551 is_template
= true;
13552 loc
= EXPR_LOCATION (name
);
13553 template_args
= TREE_OPERAND (name
, 1);
13555 template_args
= tsubst_template_args (template_args
, args
,
13556 complain
, in_decl
);
13557 name
= TREE_OPERAND (name
, 0);
13561 is_template
= false;
13562 template_args
= NULL_TREE
;
13565 /* Substitute into the qualifying scope. When there are no ARGS, we
13566 are just trying to simplify a non-dependent expression. In that
13567 case the qualifying scope may be dependent, and, in any case,
13568 substituting will not help. */
13569 scope
= TREE_OPERAND (qualified_id
, 0);
13572 scope
= tsubst (scope
, args
, complain
, in_decl
);
13573 expr
= tsubst_copy (name
, args
, complain
, in_decl
);
13578 if (dependent_scope_p (scope
))
13581 expr
= build_min_nt_loc (loc
, TEMPLATE_ID_EXPR
, expr
, template_args
);
13582 return build_qualified_name (NULL_TREE
, scope
, expr
,
13583 QUALIFIED_NAME_IS_TEMPLATE (qualified_id
));
13586 if (!BASELINK_P (name
) && !DECL_P (expr
))
13588 if (TREE_CODE (expr
) == BIT_NOT_EXPR
)
13590 /* A BIT_NOT_EXPR is used to represent a destructor. */
13591 if (!check_dtor_name (scope
, TREE_OPERAND (expr
, 0)))
13593 error ("qualifying type %qT does not match destructor name ~%qT",
13594 scope
, TREE_OPERAND (expr
, 0));
13595 expr
= error_mark_node
;
13598 expr
= lookup_qualified_name (scope
, complete_dtor_identifier
,
13599 /*is_type_p=*/0, false);
13602 expr
= lookup_qualified_name (scope
, expr
, /*is_type_p=*/0, false);
13603 if (TREE_CODE (TREE_CODE (expr
) == TEMPLATE_DECL
13604 ? DECL_TEMPLATE_RESULT (expr
) : expr
) == TYPE_DECL
)
13606 if (complain
& tf_error
)
13608 error ("dependent-name %qE is parsed as a non-type, but "
13609 "instantiation yields a type", qualified_id
);
13610 inform (input_location
, "say %<typename %E%> if a type is meant", qualified_id
);
13612 return error_mark_node
;
13618 check_accessibility_of_qualified_id (expr
, /*object_type=*/NULL_TREE
,
13620 /* Remember that there was a reference to this entity. */
13621 if (!mark_used (expr
, complain
) && !(complain
& tf_error
))
13622 return error_mark_node
;
13625 if (expr
== error_mark_node
|| TREE_CODE (expr
) == TREE_LIST
)
13627 if (complain
& tf_error
)
13628 qualified_name_lookup_error (scope
,
13629 TREE_OPERAND (qualified_id
, 1),
13630 expr
, input_location
);
13631 return error_mark_node
;
13635 expr
= lookup_template_function (expr
, template_args
);
13637 if (expr
== error_mark_node
&& complain
& tf_error
)
13638 qualified_name_lookup_error (scope
, TREE_OPERAND (qualified_id
, 1),
13639 expr
, input_location
);
13640 else if (TYPE_P (scope
))
13642 expr
= (adjust_result_of_qualified_name_lookup
13643 (expr
, scope
, current_nonlambda_class_type ()));
13644 expr
= (finish_qualified_id_expr
13645 (scope
, expr
, done
, address_p
&& PTRMEM_OK_P (qualified_id
),
13646 QUALIFIED_NAME_IS_TEMPLATE (qualified_id
),
13647 /*template_arg_p=*/false, complain
));
13650 /* Expressions do not generally have reference type. */
13651 if (TREE_CODE (expr
) != SCOPE_REF
13652 /* However, if we're about to form a pointer-to-member, we just
13653 want the referenced member referenced. */
13654 && TREE_CODE (expr
) != OFFSET_REF
)
13655 expr
= convert_from_reference (expr
);
13660 /* tsubst the initializer for a VAR_DECL. INIT is the unsubstituted
13661 initializer, DECL is the substituted VAR_DECL. Other arguments are as
13665 tsubst_init (tree init
, tree decl
, tree args
,
13666 tsubst_flags_t complain
, tree in_decl
)
13671 init
= tsubst_expr (init
, args
, complain
, in_decl
, false);
13675 /* If we had an initializer but it
13676 instantiated to nothing,
13677 value-initialize the object. This will
13678 only occur when the initializer was a
13679 pack expansion where the parameter packs
13680 used in that expansion were of length
13682 init
= build_value_init (TREE_TYPE (decl
),
13684 if (TREE_CODE (init
) == AGGR_INIT_EXPR
)
13685 init
= get_target_expr_sfinae (init
, complain
);
13691 /* Like tsubst, but deals with expressions. This function just replaces
13692 template parms; to finish processing the resultant expression, use
13693 tsubst_copy_and_build or tsubst_expr. */
13696 tsubst_copy (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
13698 enum tree_code code
;
13701 if (t
== NULL_TREE
|| t
== error_mark_node
|| args
== NULL_TREE
)
13704 code
= TREE_CODE (t
);
13709 r
= retrieve_local_specialization (t
);
13711 if (r
== NULL_TREE
)
13713 /* We get here for a use of 'this' in an NSDMI. */
13714 if (DECL_NAME (t
) == this_identifier
13715 && current_function_decl
13716 && DECL_CONSTRUCTOR_P (current_function_decl
))
13717 return current_class_ptr
;
13719 /* This can happen for a parameter name used later in a function
13720 declaration (such as in a late-specified return type). Just
13721 make a dummy decl, since it's only used for its type. */
13722 gcc_assert (cp_unevaluated_operand
!= 0);
13723 r
= tsubst_decl (t
, args
, complain
);
13724 /* Give it the template pattern as its context; its true context
13725 hasn't been instantiated yet and this is good enough for
13727 DECL_CONTEXT (r
) = DECL_CONTEXT (t
);
13730 if (TREE_CODE (r
) == ARGUMENT_PACK_SELECT
)
13731 r
= ARGUMENT_PACK_SELECT_ARG (r
);
13732 if (!mark_used (r
, complain
) && !(complain
& tf_error
))
13733 return error_mark_node
;
13741 if (DECL_TEMPLATE_PARM_P (t
))
13742 return tsubst_copy (DECL_INITIAL (t
), args
, complain
, in_decl
);
13743 /* There is no need to substitute into namespace-scope
13745 if (DECL_NAMESPACE_SCOPE_P (t
))
13747 /* If ARGS is NULL, then T is known to be non-dependent. */
13748 if (args
== NULL_TREE
)
13749 return scalar_constant_value (t
);
13751 /* Unfortunately, we cannot just call lookup_name here.
13754 template <int I> int f() {
13756 struct S { void g() { E e = a; } };
13759 When we instantiate f<7>::S::g(), say, lookup_name is not
13760 clever enough to find f<7>::a. */
13762 = tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
13763 /*entering_scope=*/0);
13765 for (v
= TYPE_VALUES (enum_type
);
13767 v
= TREE_CHAIN (v
))
13768 if (TREE_PURPOSE (v
) == DECL_NAME (t
))
13769 return TREE_VALUE (v
);
13771 /* We didn't find the name. That should never happen; if
13772 name-lookup found it during preliminary parsing, we
13773 should find it again here during instantiation. */
13774 gcc_unreachable ();
13779 if (PACK_EXPANSION_P (TREE_TYPE (t
)))
13781 /* Check for a local specialization set up by
13782 tsubst_pack_expansion. */
13783 if (tree r
= retrieve_local_specialization (t
))
13785 if (TREE_CODE (r
) == ARGUMENT_PACK_SELECT
)
13786 r
= ARGUMENT_PACK_SELECT_ARG (r
);
13790 /* When retrieving a capture pack from a generic lambda, remove the
13791 lambda call op's own template argument list from ARGS. Only the
13792 template arguments active for the closure type should be used to
13793 retrieve the pack specialization. */
13794 if (LAMBDA_FUNCTION_P (current_function_decl
)
13795 && (template_class_depth (DECL_CONTEXT (t
))
13796 != TMPL_ARGS_DEPTH (args
)))
13797 args
= strip_innermost_template_args (args
, 1);
13799 /* Otherwise return the full NONTYPE_ARGUMENT_PACK that
13800 tsubst_decl put in the hash table. */
13801 return retrieve_specialization (t
, args
, 0);
13804 if (DECL_CONTEXT (t
))
13808 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
13809 /*entering_scope=*/1);
13810 if (ctx
!= DECL_CONTEXT (t
))
13812 tree r
= lookup_field (ctx
, DECL_NAME (t
), 0, false);
13815 if (complain
& tf_error
)
13816 error ("using invalid field %qD", t
);
13817 return error_mark_node
;
13826 case FUNCTION_DECL
:
13827 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
))
13828 r
= tsubst (t
, args
, complain
, in_decl
);
13829 else if (local_variable_p (t
))
13831 r
= retrieve_local_specialization (t
);
13832 if (r
== NULL_TREE
)
13834 /* First try name lookup to find the instantiation. */
13835 r
= lookup_name (DECL_NAME (t
));
13838 /* Make sure that the one we found is the one we want. */
13839 tree ctx
= DECL_CONTEXT (t
);
13840 if (DECL_LANG_SPECIFIC (ctx
) && DECL_TEMPLATE_INFO (ctx
))
13841 ctx
= tsubst (ctx
, args
, complain
, in_decl
);
13842 if (ctx
!= DECL_CONTEXT (r
))
13850 /* This can happen for a variable used in a
13851 late-specified return type of a local lambda, or for a
13852 local static or constant. Building a new VAR_DECL
13853 should be OK in all those cases. */
13854 r
= tsubst_decl (t
, args
, complain
);
13855 if (decl_maybe_constant_var_p (r
))
13857 /* We can't call cp_finish_decl, so handle the
13858 initializer by hand. */
13859 tree init
= tsubst_init (DECL_INITIAL (t
), r
, args
,
13860 complain
, in_decl
);
13861 if (!processing_template_decl
)
13862 init
= maybe_constant_init (init
);
13863 if (processing_template_decl
13864 ? potential_constant_expression (init
)
13865 : reduced_constant_expression_p (init
))
13866 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r
)
13867 = TREE_CONSTANT (r
) = true;
13868 DECL_INITIAL (r
) = init
;
13870 gcc_assert (cp_unevaluated_operand
|| TREE_STATIC (r
)
13871 || decl_constant_var_p (r
)
13872 || errorcount
|| sorrycount
);
13873 if (!processing_template_decl
)
13875 if (TREE_STATIC (r
))
13876 rest_of_decl_compilation (r
, toplevel_bindings_p (),
13879 r
= process_outer_var_ref (r
, complain
);
13882 /* Remember this for subsequent uses. */
13883 if (local_specializations
)
13884 register_local_specialization (r
, t
);
13889 if (!mark_used (r
, complain
) && !(complain
& tf_error
))
13890 return error_mark_node
;
13893 case NAMESPACE_DECL
:
13897 /* An OVERLOAD will always be a non-dependent overload set; an
13898 overload set from function scope will just be represented with an
13899 IDENTIFIER_NODE, and from class scope with a BASELINK. */
13900 gcc_assert (!uses_template_parms (t
));
13904 return tsubst_baselink (t
, current_nonlambda_class_type (),
13905 args
, complain
, in_decl
);
13907 case TEMPLATE_DECL
:
13908 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
13909 return tsubst (TREE_TYPE (DECL_TEMPLATE_RESULT (t
)),
13910 args
, complain
, in_decl
);
13911 else if (DECL_FUNCTION_TEMPLATE_P (t
) && DECL_MEMBER_TEMPLATE_P (t
))
13912 return tsubst (t
, args
, complain
, in_decl
);
13913 else if (DECL_CLASS_SCOPE_P (t
)
13914 && uses_template_parms (DECL_CONTEXT (t
)))
13916 /* Template template argument like the following example need
13919 template <template <class> class TT> struct C {};
13920 template <class T> struct D {
13921 template <class U> struct E {};
13926 We are processing the template argument `E' in #1 for
13927 the template instantiation #2. Originally, `E' is a
13928 TEMPLATE_DECL with `D<T>' as its DECL_CONTEXT. Now we
13929 have to substitute this with one having context `D<int>'. */
13931 tree context
= tsubst (DECL_CONTEXT (t
), args
, complain
, in_decl
);
13932 return lookup_field (context
, DECL_NAME(t
), 0, false);
13935 /* Ordinary template template argument. */
13939 case REINTERPRET_CAST_EXPR
:
13940 case CONST_CAST_EXPR
:
13941 case STATIC_CAST_EXPR
:
13942 case DYNAMIC_CAST_EXPR
:
13943 case IMPLICIT_CONV_EXPR
:
13947 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13948 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13949 return build1 (code
, type
, op0
);
13953 if (PACK_EXPANSION_P (TREE_OPERAND (t
, 0)))
13956 tree expanded
, op
= TREE_OPERAND (t
, 0);
13959 if (SIZEOF_EXPR_TYPE_P (t
))
13960 op
= TREE_TYPE (op
);
13962 ++cp_unevaluated_operand
;
13963 ++c_inhibit_evaluation_warnings
;
13964 /* We only want to compute the number of arguments. */
13965 expanded
= tsubst_pack_expansion (op
, args
, complain
, in_decl
);
13966 --cp_unevaluated_operand
;
13967 --c_inhibit_evaluation_warnings
;
13969 if (TREE_CODE (expanded
) == TREE_VEC
)
13970 len
= TREE_VEC_LENGTH (expanded
);
13972 if (expanded
== error_mark_node
)
13973 return error_mark_node
;
13974 else if (PACK_EXPANSION_P (expanded
)
13975 || (TREE_CODE (expanded
) == TREE_VEC
13977 && PACK_EXPANSION_P (TREE_VEC_ELT (expanded
, len
-1))))
13979 if (TREE_CODE (expanded
) == TREE_VEC
)
13980 expanded
= TREE_VEC_ELT (expanded
, len
- 1);
13982 if (TYPE_P (expanded
))
13983 return cxx_sizeof_or_alignof_type (expanded
, SIZEOF_EXPR
,
13984 complain
& tf_error
);
13986 return cxx_sizeof_or_alignof_expr (expanded
, SIZEOF_EXPR
,
13987 complain
& tf_error
);
13990 return build_int_cst (size_type_node
, len
);
13992 if (SIZEOF_EXPR_TYPE_P (t
))
13994 r
= tsubst (TREE_TYPE (TREE_OPERAND (t
, 0)),
13995 args
, complain
, in_decl
);
13996 r
= build1 (NOP_EXPR
, r
, error_mark_node
);
13997 r
= build1 (SIZEOF_EXPR
,
13998 tsubst (TREE_TYPE (t
), args
, complain
, in_decl
), r
);
13999 SIZEOF_EXPR_TYPE_P (r
) = 1;
14006 case TRUTH_NOT_EXPR
:
14009 case UNARY_PLUS_EXPR
: /* Unary + */
14011 case AT_ENCODE_EXPR
:
14015 case REALPART_EXPR
:
14016 case IMAGPART_EXPR
:
14019 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14020 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14021 return build1 (code
, type
, op0
);
14024 case COMPONENT_REF
:
14029 object
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14030 name
= TREE_OPERAND (t
, 1);
14031 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
14033 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
14034 complain
, in_decl
);
14035 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
14037 else if (TREE_CODE (name
) == SCOPE_REF
14038 && TREE_CODE (TREE_OPERAND (name
, 1)) == BIT_NOT_EXPR
)
14040 tree base
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
14041 complain
, in_decl
);
14042 name
= TREE_OPERAND (name
, 1);
14043 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
14044 complain
, in_decl
);
14045 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
14046 name
= build_qualified_name (/*type=*/NULL_TREE
,
14048 /*template_p=*/false);
14050 else if (BASELINK_P (name
))
14051 name
= tsubst_baselink (name
,
14052 non_reference (TREE_TYPE (object
)),
14056 name
= tsubst_copy (name
, args
, complain
, in_decl
);
14057 return build_nt (COMPONENT_REF
, object
, name
, NULL_TREE
);
14063 case TRUNC_DIV_EXPR
:
14064 case CEIL_DIV_EXPR
:
14065 case FLOOR_DIV_EXPR
:
14066 case ROUND_DIV_EXPR
:
14067 case EXACT_DIV_EXPR
:
14071 case TRUNC_MOD_EXPR
:
14072 case FLOOR_MOD_EXPR
:
14073 case TRUTH_ANDIF_EXPR
:
14074 case TRUTH_ORIF_EXPR
:
14075 case TRUTH_AND_EXPR
:
14076 case TRUTH_OR_EXPR
:
14089 case COMPOUND_EXPR
:
14092 case PREDECREMENT_EXPR
:
14093 case PREINCREMENT_EXPR
:
14094 case POSTDECREMENT_EXPR
:
14095 case POSTINCREMENT_EXPR
:
14097 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14098 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14099 return build_nt (code
, op0
, op1
);
14104 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14105 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14106 return build_qualified_name (/*type=*/NULL_TREE
, op0
, op1
,
14107 QUALIFIED_NAME_IS_TEMPLATE (t
));
14112 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14113 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14114 return build_nt (ARRAY_REF
, op0
, op1
, NULL_TREE
, NULL_TREE
);
14119 int n
= VL_EXP_OPERAND_LENGTH (t
);
14120 tree result
= build_vl_exp (CALL_EXPR
, n
);
14122 for (i
= 0; i
< n
; i
++)
14123 TREE_OPERAND (t
, i
) = tsubst_copy (TREE_OPERAND (t
, i
), args
,
14124 complain
, in_decl
);
14130 case PSEUDO_DTOR_EXPR
:
14131 case VEC_PERM_EXPR
:
14133 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14134 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14135 tree op2
= tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
14136 r
= build_nt (code
, op0
, op1
, op2
);
14137 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
14143 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14144 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14145 tree op2
= tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
14146 r
= build_nt (code
, op0
, op1
, op2
);
14147 NEW_EXPR_USE_GLOBAL (r
) = NEW_EXPR_USE_GLOBAL (t
);
14153 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14154 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14155 r
= build_nt (code
, op0
, op1
);
14156 DELETE_EXPR_USE_GLOBAL (r
) = DELETE_EXPR_USE_GLOBAL (t
);
14157 DELETE_EXPR_USE_VEC (r
) = DELETE_EXPR_USE_VEC (t
);
14161 case TEMPLATE_ID_EXPR
:
14163 /* Substituted template arguments */
14164 tree fn
= TREE_OPERAND (t
, 0);
14165 tree targs
= TREE_OPERAND (t
, 1);
14167 fn
= tsubst_copy (fn
, args
, complain
, in_decl
);
14169 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
14171 return lookup_template_function (fn
, targs
);
14176 tree purpose
, value
, chain
;
14178 if (t
== void_list_node
)
14181 purpose
= TREE_PURPOSE (t
);
14183 purpose
= tsubst_copy (purpose
, args
, complain
, in_decl
);
14184 value
= TREE_VALUE (t
);
14186 value
= tsubst_copy (value
, args
, complain
, in_decl
);
14187 chain
= TREE_CHAIN (t
);
14188 if (chain
&& chain
!= void_type_node
)
14189 chain
= tsubst_copy (chain
, args
, complain
, in_decl
);
14190 if (purpose
== TREE_PURPOSE (t
)
14191 && value
== TREE_VALUE (t
)
14192 && chain
== TREE_CHAIN (t
))
14194 return tree_cons (purpose
, value
, chain
);
14199 case ENUMERAL_TYPE
:
14201 case TEMPLATE_TYPE_PARM
:
14202 case TEMPLATE_TEMPLATE_PARM
:
14203 case BOUND_TEMPLATE_TEMPLATE_PARM
:
14204 case TEMPLATE_PARM_INDEX
:
14206 case REFERENCE_TYPE
:
14208 case FUNCTION_TYPE
:
14211 case TYPENAME_TYPE
:
14212 case UNBOUND_CLASS_TEMPLATE
:
14214 case DECLTYPE_TYPE
:
14216 return tsubst (t
, args
, complain
, in_decl
);
14220 /* Fall through. */
14221 case IDENTIFIER_NODE
:
14222 if (IDENTIFIER_TYPENAME_P (t
))
14224 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14225 return mangle_conv_op_name_for_type (new_type
);
14231 /* This is handled by tsubst_copy_and_build. */
14232 gcc_unreachable ();
14236 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14237 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14238 return build_x_va_arg (EXPR_LOCATION (t
), op0
, type
);
14241 case CLEANUP_POINT_EXPR
:
14242 /* We shouldn't have built any of these during initial template
14243 generation. Instead, they should be built during instantiation
14244 in response to the saved STMT_IS_FULL_EXPR_P setting. */
14245 gcc_unreachable ();
14249 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14250 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14251 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14252 r
= build2 (code
, type
, op0
, op1
);
14253 PTRMEM_OK_P (r
) = PTRMEM_OK_P (t
);
14254 if (!mark_used (TREE_OPERAND (r
, 1), complain
)
14255 && !(complain
& tf_error
))
14256 return error_mark_node
;
14260 case EXPR_PACK_EXPANSION
:
14261 error ("invalid use of pack expansion expression");
14262 return error_mark_node
;
14264 case NONTYPE_ARGUMENT_PACK
:
14265 error ("use %<...%> to expand argument pack");
14266 return error_mark_node
;
14269 gcc_checking_assert (t
== void_node
&& VOID_TYPE_P (TREE_TYPE (t
)));
14277 /* Instantiate any typedefs in the type. */
14278 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14279 r
= fold_convert (type
, t
);
14280 gcc_assert (TREE_CODE (r
) == code
);
14285 /* These can sometimes show up in a partial instantiation, but never
14286 involve template parms. */
14287 gcc_assert (!uses_template_parms (t
));
14290 case UNARY_LEFT_FOLD_EXPR
:
14291 return tsubst_unary_left_fold (t
, args
, complain
, in_decl
);
14292 case UNARY_RIGHT_FOLD_EXPR
:
14293 return tsubst_unary_right_fold (t
, args
, complain
, in_decl
);
14294 case BINARY_LEFT_FOLD_EXPR
:
14295 return tsubst_binary_left_fold (t
, args
, complain
, in_decl
);
14296 case BINARY_RIGHT_FOLD_EXPR
:
14297 return tsubst_binary_right_fold (t
, args
, complain
, in_decl
);
14300 /* We shouldn't get here, but keep going if !ENABLE_CHECKING. */
14301 gcc_checking_assert (false);
14306 /* Helper function for tsubst_omp_clauses, used for instantiation of
14307 OMP_CLAUSE_DECL of clauses. */
14310 tsubst_omp_clause_decl (tree decl
, tree args
, tsubst_flags_t complain
,
14313 if (decl
== NULL_TREE
)
14316 /* Handle an OpenMP array section represented as a TREE_LIST (or
14317 OMP_CLAUSE_DEPEND_KIND). An OMP_CLAUSE_DEPEND (with a depend
14318 kind of OMP_CLAUSE_DEPEND_SINK) can also be represented as a
14319 TREE_LIST. We can handle it exactly the same as an array section
14320 (purpose, value, and a chain), even though the nomenclature
14321 (low_bound, length, etc) is different. */
14322 if (TREE_CODE (decl
) == TREE_LIST
)
14325 = tsubst_expr (TREE_PURPOSE (decl
), args
, complain
, in_decl
,
14326 /*integral_constant_expression_p=*/false);
14327 tree length
= tsubst_expr (TREE_VALUE (decl
), args
, complain
, in_decl
,
14328 /*integral_constant_expression_p=*/false);
14329 tree chain
= tsubst_omp_clause_decl (TREE_CHAIN (decl
), args
, complain
,
14331 if (TREE_PURPOSE (decl
) == low_bound
14332 && TREE_VALUE (decl
) == length
14333 && TREE_CHAIN (decl
) == chain
)
14335 tree ret
= tree_cons (low_bound
, length
, chain
);
14336 OMP_CLAUSE_DEPEND_SINK_NEGATIVE (ret
)
14337 = OMP_CLAUSE_DEPEND_SINK_NEGATIVE (decl
);
14340 tree ret
= tsubst_expr (decl
, args
, complain
, in_decl
,
14341 /*integral_constant_expression_p=*/false);
14342 /* Undo convert_from_reference tsubst_expr could have called. */
14344 && REFERENCE_REF_P (ret
)
14345 && !REFERENCE_REF_P (decl
))
14346 ret
= TREE_OPERAND (ret
, 0);
14350 /* Like tsubst_copy, but specifically for OpenMP clauses. */
14353 tsubst_omp_clauses (tree clauses
, bool declare_simd
, bool allow_fields
,
14354 tree args
, tsubst_flags_t complain
, tree in_decl
)
14356 tree new_clauses
= NULL_TREE
, nc
, oc
;
14357 tree linear_no_step
= NULL_TREE
;
14359 for (oc
= clauses
; oc
; oc
= OMP_CLAUSE_CHAIN (oc
))
14361 nc
= copy_node (oc
);
14362 OMP_CLAUSE_CHAIN (nc
) = new_clauses
;
14365 switch (OMP_CLAUSE_CODE (nc
))
14367 case OMP_CLAUSE_LASTPRIVATE
:
14368 if (OMP_CLAUSE_LASTPRIVATE_STMT (oc
))
14370 OMP_CLAUSE_LASTPRIVATE_STMT (nc
) = push_stmt_list ();
14371 tsubst_expr (OMP_CLAUSE_LASTPRIVATE_STMT (oc
), args
, complain
,
14372 in_decl
, /*integral_constant_expression_p=*/false);
14373 OMP_CLAUSE_LASTPRIVATE_STMT (nc
)
14374 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (nc
));
14377 case OMP_CLAUSE_PRIVATE
:
14378 case OMP_CLAUSE_SHARED
:
14379 case OMP_CLAUSE_FIRSTPRIVATE
:
14380 case OMP_CLAUSE_COPYIN
:
14381 case OMP_CLAUSE_COPYPRIVATE
:
14382 case OMP_CLAUSE_UNIFORM
:
14383 case OMP_CLAUSE_DEPEND
:
14384 case OMP_CLAUSE_FROM
:
14385 case OMP_CLAUSE_TO
:
14386 case OMP_CLAUSE_MAP
:
14387 case OMP_CLAUSE_USE_DEVICE_PTR
:
14388 case OMP_CLAUSE_IS_DEVICE_PTR
:
14389 OMP_CLAUSE_DECL (nc
)
14390 = tsubst_omp_clause_decl (OMP_CLAUSE_DECL (oc
), args
, complain
,
14393 case OMP_CLAUSE_IF
:
14394 case OMP_CLAUSE_NUM_THREADS
:
14395 case OMP_CLAUSE_SCHEDULE
:
14396 case OMP_CLAUSE_COLLAPSE
:
14397 case OMP_CLAUSE_FINAL
:
14398 case OMP_CLAUSE_DEVICE
:
14399 case OMP_CLAUSE_DIST_SCHEDULE
:
14400 case OMP_CLAUSE_NUM_TEAMS
:
14401 case OMP_CLAUSE_THREAD_LIMIT
:
14402 case OMP_CLAUSE_SAFELEN
:
14403 case OMP_CLAUSE_SIMDLEN
:
14404 case OMP_CLAUSE_NUM_TASKS
:
14405 case OMP_CLAUSE_GRAINSIZE
:
14406 case OMP_CLAUSE_PRIORITY
:
14407 case OMP_CLAUSE_ORDERED
:
14408 case OMP_CLAUSE_HINT
:
14409 OMP_CLAUSE_OPERAND (nc
, 0)
14410 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 0), args
, complain
,
14411 in_decl
, /*integral_constant_expression_p=*/false);
14413 case OMP_CLAUSE_REDUCTION
:
14414 if (OMP_CLAUSE_REDUCTION_PLACEHOLDER (oc
))
14416 tree placeholder
= OMP_CLAUSE_REDUCTION_PLACEHOLDER (oc
);
14417 if (TREE_CODE (placeholder
) == SCOPE_REF
)
14419 tree scope
= tsubst (TREE_OPERAND (placeholder
, 0), args
,
14420 complain
, in_decl
);
14421 OMP_CLAUSE_REDUCTION_PLACEHOLDER (nc
)
14422 = build_qualified_name (NULL_TREE
, scope
,
14423 TREE_OPERAND (placeholder
, 1),
14427 gcc_assert (identifier_p (placeholder
));
14429 OMP_CLAUSE_DECL (nc
)
14430 = tsubst_omp_clause_decl (OMP_CLAUSE_DECL (oc
), args
, complain
,
14433 case OMP_CLAUSE_LINEAR
:
14434 case OMP_CLAUSE_ALIGNED
:
14435 OMP_CLAUSE_DECL (nc
)
14436 = tsubst_omp_clause_decl (OMP_CLAUSE_DECL (oc
), args
, complain
,
14438 OMP_CLAUSE_OPERAND (nc
, 1)
14439 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 1), args
, complain
,
14440 in_decl
, /*integral_constant_expression_p=*/false);
14441 if (OMP_CLAUSE_CODE (oc
) == OMP_CLAUSE_LINEAR
14442 && OMP_CLAUSE_LINEAR_STEP (oc
) == NULL_TREE
)
14444 gcc_assert (!linear_no_step
);
14445 linear_no_step
= nc
;
14448 case OMP_CLAUSE_NOWAIT
:
14449 case OMP_CLAUSE_DEFAULT
:
14450 case OMP_CLAUSE_UNTIED
:
14451 case OMP_CLAUSE_MERGEABLE
:
14452 case OMP_CLAUSE_INBRANCH
:
14453 case OMP_CLAUSE_NOTINBRANCH
:
14454 case OMP_CLAUSE_PROC_BIND
:
14455 case OMP_CLAUSE_FOR
:
14456 case OMP_CLAUSE_PARALLEL
:
14457 case OMP_CLAUSE_SECTIONS
:
14458 case OMP_CLAUSE_TASKGROUP
:
14459 case OMP_CLAUSE_NOGROUP
:
14460 case OMP_CLAUSE_THREADS
:
14461 case OMP_CLAUSE_SIMD
:
14462 case OMP_CLAUSE_DEFAULTMAP
:
14465 gcc_unreachable ();
14468 switch (OMP_CLAUSE_CODE (nc
))
14470 case OMP_CLAUSE_PRIVATE
:
14471 case OMP_CLAUSE_FIRSTPRIVATE
:
14472 case OMP_CLAUSE_LASTPRIVATE
:
14473 case OMP_CLAUSE_COPYPRIVATE
:
14474 case OMP_CLAUSE_LINEAR
:
14475 case OMP_CLAUSE_REDUCTION
:
14476 case OMP_CLAUSE_USE_DEVICE_PTR
:
14477 case OMP_CLAUSE_IS_DEVICE_PTR
:
14478 /* tsubst_expr on SCOPE_REF results in returning
14479 finish_non_static_data_member result. Undo that here. */
14480 if (TREE_CODE (OMP_CLAUSE_DECL (oc
)) == SCOPE_REF
14481 && (TREE_CODE (TREE_OPERAND (OMP_CLAUSE_DECL (oc
), 1))
14482 == IDENTIFIER_NODE
))
14484 tree t
= OMP_CLAUSE_DECL (nc
);
14487 switch (TREE_CODE (v
))
14489 case COMPONENT_REF
:
14493 case POINTER_PLUS_EXPR
:
14494 v
= TREE_OPERAND (v
, 0);
14497 if (DECL_CONTEXT (v
) == current_function_decl
14498 && DECL_ARTIFICIAL (v
)
14499 && DECL_NAME (v
) == this_identifier
)
14500 OMP_CLAUSE_DECL (nc
) = TREE_OPERAND (t
, 1);
14507 else if (VAR_P (OMP_CLAUSE_DECL (oc
))
14508 && DECL_HAS_VALUE_EXPR_P (OMP_CLAUSE_DECL (oc
))
14509 && DECL_ARTIFICIAL (OMP_CLAUSE_DECL (oc
))
14510 && DECL_LANG_SPECIFIC (OMP_CLAUSE_DECL (oc
))
14511 && DECL_OMP_PRIVATIZED_MEMBER (OMP_CLAUSE_DECL (oc
)))
14513 tree decl
= OMP_CLAUSE_DECL (nc
);
14516 if (!DECL_LANG_SPECIFIC (decl
))
14517 retrofit_lang_decl (decl
);
14518 DECL_OMP_PRIVATIZED_MEMBER (decl
) = 1;
14527 new_clauses
= nreverse (new_clauses
);
14530 new_clauses
= finish_omp_clauses (new_clauses
, allow_fields
);
14531 if (linear_no_step
)
14532 for (nc
= new_clauses
; nc
; nc
= OMP_CLAUSE_CHAIN (nc
))
14533 if (nc
== linear_no_step
)
14535 OMP_CLAUSE_LINEAR_STEP (nc
) = NULL_TREE
;
14539 return new_clauses
;
14542 /* Like tsubst_copy_and_build, but unshare TREE_LIST nodes. */
14545 tsubst_copy_asm_operands (tree t
, tree args
, tsubst_flags_t complain
,
14548 #define RECUR(t) tsubst_copy_asm_operands (t, args, complain, in_decl)
14550 tree purpose
, value
, chain
;
14555 if (TREE_CODE (t
) != TREE_LIST
)
14556 return tsubst_copy_and_build (t
, args
, complain
, in_decl
,
14557 /*function_p=*/false,
14558 /*integral_constant_expression_p=*/false);
14560 if (t
== void_list_node
)
14563 purpose
= TREE_PURPOSE (t
);
14565 purpose
= RECUR (purpose
);
14566 value
= TREE_VALUE (t
);
14569 if (TREE_CODE (value
) != LABEL_DECL
)
14570 value
= RECUR (value
);
14573 value
= lookup_label (DECL_NAME (value
));
14574 gcc_assert (TREE_CODE (value
) == LABEL_DECL
);
14575 TREE_USED (value
) = 1;
14578 chain
= TREE_CHAIN (t
);
14579 if (chain
&& chain
!= void_type_node
)
14580 chain
= RECUR (chain
);
14581 return tree_cons (purpose
, value
, chain
);
14585 /* Used to temporarily communicate the list of #pragma omp parallel
14586 clauses to #pragma omp for instantiation if they are combined
14589 static tree
*omp_parallel_combined_clauses
;
14591 /* Substitute one OMP_FOR iterator. */
14594 tsubst_omp_for_iterator (tree t
, int i
, tree declv
, tree orig_declv
,
14595 tree initv
, tree condv
, tree incrv
, tree
*clauses
,
14596 tree args
, tsubst_flags_t complain
, tree in_decl
,
14597 bool integral_constant_expression_p
)
14599 #define RECUR(NODE) \
14600 tsubst_expr ((NODE), args, complain, in_decl, \
14601 integral_constant_expression_p)
14602 tree decl
, init
, cond
, incr
;
14604 init
= TREE_VEC_ELT (OMP_FOR_INIT (t
), i
);
14605 gcc_assert (TREE_CODE (init
) == MODIFY_EXPR
);
14607 if (orig_declv
&& OMP_FOR_ORIG_DECLS (t
))
14609 tree o
= TREE_VEC_ELT (OMP_FOR_ORIG_DECLS (t
), i
);
14610 TREE_VEC_ELT (orig_declv
, i
) = RECUR (o
);
14613 decl
= TREE_OPERAND (init
, 0);
14614 init
= TREE_OPERAND (init
, 1);
14615 tree decl_expr
= NULL_TREE
;
14616 if (init
&& TREE_CODE (init
) == DECL_EXPR
)
14618 /* We need to jump through some hoops to handle declarations in the
14619 for-init-statement, since we might need to handle auto deduction,
14620 but we need to keep control of initialization. */
14622 init
= DECL_INITIAL (DECL_EXPR_DECL (init
));
14623 decl
= tsubst_decl (decl
, args
, complain
);
14627 if (TREE_CODE (decl
) == SCOPE_REF
)
14629 decl
= RECUR (decl
);
14630 if (TREE_CODE (decl
) == COMPONENT_REF
)
14634 switch (TREE_CODE (v
))
14636 case COMPONENT_REF
:
14640 case POINTER_PLUS_EXPR
:
14641 v
= TREE_OPERAND (v
, 0);
14644 if (DECL_CONTEXT (v
) == current_function_decl
14645 && DECL_ARTIFICIAL (v
)
14646 && DECL_NAME (v
) == this_identifier
)
14648 decl
= TREE_OPERAND (decl
, 1);
14649 decl
= omp_privatize_field (decl
);
14659 decl
= RECUR (decl
);
14661 init
= RECUR (init
);
14663 tree auto_node
= type_uses_auto (TREE_TYPE (decl
));
14664 if (auto_node
&& init
)
14666 = do_auto_deduction (TREE_TYPE (decl
), init
, auto_node
);
14668 gcc_assert (!type_dependent_expression_p (decl
));
14670 if (!CLASS_TYPE_P (TREE_TYPE (decl
)))
14674 /* Declare the variable, but don't let that initialize it. */
14675 tree init_sav
= DECL_INITIAL (DECL_EXPR_DECL (decl_expr
));
14676 DECL_INITIAL (DECL_EXPR_DECL (decl_expr
)) = NULL_TREE
;
14678 DECL_INITIAL (DECL_EXPR_DECL (decl_expr
)) = init_sav
;
14681 cond
= RECUR (TREE_VEC_ELT (OMP_FOR_COND (t
), i
));
14682 incr
= TREE_VEC_ELT (OMP_FOR_INCR (t
), i
);
14683 if (TREE_CODE (incr
) == MODIFY_EXPR
)
14685 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
14686 tree rhs
= RECUR (TREE_OPERAND (incr
, 1));
14687 incr
= build_x_modify_expr (EXPR_LOCATION (incr
), lhs
,
14688 NOP_EXPR
, rhs
, complain
);
14691 incr
= RECUR (incr
);
14692 TREE_VEC_ELT (declv
, i
) = decl
;
14693 TREE_VEC_ELT (initv
, i
) = init
;
14694 TREE_VEC_ELT (condv
, i
) = cond
;
14695 TREE_VEC_ELT (incrv
, i
) = incr
;
14701 /* Declare and initialize the variable. */
14709 for (j
= (omp_parallel_combined_clauses
== NULL
? 1 : 0); j
< 2; j
++)
14711 for (pc
= j
? clauses
: omp_parallel_combined_clauses
; *pc
; )
14713 if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_PRIVATE
14714 && OMP_CLAUSE_DECL (*pc
) == decl
)
14716 else if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_LASTPRIVATE
14717 && OMP_CLAUSE_DECL (*pc
) == decl
)
14721 /* Move lastprivate (decl) clause to OMP_FOR_CLAUSES. */
14723 *pc
= OMP_CLAUSE_CHAIN (c
);
14724 OMP_CLAUSE_CHAIN (c
) = *clauses
;
14727 else if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_FIRSTPRIVATE
14728 && OMP_CLAUSE_DECL (*pc
) == decl
)
14730 error ("iteration variable %qD should not be firstprivate",
14732 *pc
= OMP_CLAUSE_CHAIN (*pc
);
14734 else if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_REDUCTION
14735 && OMP_CLAUSE_DECL (*pc
) == decl
)
14737 error ("iteration variable %qD should not be reduction",
14739 *pc
= OMP_CLAUSE_CHAIN (*pc
);
14742 pc
= &OMP_CLAUSE_CHAIN (*pc
);
14747 if (*pc
== NULL_TREE
)
14749 tree c
= build_omp_clause (input_location
, OMP_CLAUSE_PRIVATE
);
14750 OMP_CLAUSE_DECL (c
) = decl
;
14751 c
= finish_omp_clauses (c
, true);
14754 OMP_CLAUSE_CHAIN (c
) = *clauses
;
14759 cond
= TREE_VEC_ELT (OMP_FOR_COND (t
), i
);
14760 if (COMPARISON_CLASS_P (cond
))
14762 tree op0
= RECUR (TREE_OPERAND (cond
, 0));
14763 tree op1
= RECUR (TREE_OPERAND (cond
, 1));
14764 cond
= build2 (TREE_CODE (cond
), boolean_type_node
, op0
, op1
);
14767 cond
= RECUR (cond
);
14768 incr
= TREE_VEC_ELT (OMP_FOR_INCR (t
), i
);
14769 switch (TREE_CODE (incr
))
14771 case PREINCREMENT_EXPR
:
14772 case PREDECREMENT_EXPR
:
14773 case POSTINCREMENT_EXPR
:
14774 case POSTDECREMENT_EXPR
:
14775 incr
= build2 (TREE_CODE (incr
), TREE_TYPE (decl
),
14776 RECUR (TREE_OPERAND (incr
, 0)), NULL_TREE
);
14779 if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
14780 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
14782 tree rhs
= TREE_OPERAND (incr
, 1);
14783 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
14784 tree rhs0
= RECUR (TREE_OPERAND (rhs
, 0));
14785 tree rhs1
= RECUR (TREE_OPERAND (rhs
, 1));
14786 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
14787 build2 (TREE_CODE (rhs
), TREE_TYPE (decl
),
14791 incr
= RECUR (incr
);
14794 if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
14795 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
14797 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
14798 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
14799 build2 (TREE_CODE (TREE_OPERAND (incr
, 1)),
14800 TREE_TYPE (decl
), lhs
,
14801 RECUR (TREE_OPERAND (incr
, 2))));
14803 else if (TREE_CODE (TREE_OPERAND (incr
, 1)) == NOP_EXPR
14804 && (TREE_CODE (TREE_OPERAND (incr
, 2)) == PLUS_EXPR
14805 || (TREE_CODE (TREE_OPERAND (incr
, 2)) == MINUS_EXPR
)))
14807 tree rhs
= TREE_OPERAND (incr
, 2);
14808 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
14809 tree rhs0
= RECUR (TREE_OPERAND (rhs
, 0));
14810 tree rhs1
= RECUR (TREE_OPERAND (rhs
, 1));
14811 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
14812 build2 (TREE_CODE (rhs
), TREE_TYPE (decl
),
14816 incr
= RECUR (incr
);
14819 incr
= RECUR (incr
);
14823 TREE_VEC_ELT (declv
, i
) = decl
;
14824 TREE_VEC_ELT (initv
, i
) = init
;
14825 TREE_VEC_ELT (condv
, i
) = cond
;
14826 TREE_VEC_ELT (incrv
, i
) = incr
;
14830 /* Like tsubst_copy for expressions, etc. but also does semantic
14834 tsubst_expr (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
,
14835 bool integral_constant_expression_p
)
14837 #define RETURN(EXP) do { r = (EXP); goto out; } while(0)
14838 #define RECUR(NODE) \
14839 tsubst_expr ((NODE), args, complain, in_decl, \
14840 integral_constant_expression_p)
14846 if (t
== NULL_TREE
|| t
== error_mark_node
)
14849 loc
= input_location
;
14850 if (EXPR_HAS_LOCATION (t
))
14851 input_location
= EXPR_LOCATION (t
);
14852 if (STATEMENT_CODE_P (TREE_CODE (t
)))
14853 current_stmt_tree ()->stmts_are_full_exprs_p
= STMT_IS_FULL_EXPR_P (t
);
14855 switch (TREE_CODE (t
))
14857 case STATEMENT_LIST
:
14859 tree_stmt_iterator i
;
14860 for (i
= tsi_start (t
); !tsi_end_p (i
); tsi_next (&i
))
14861 RECUR (tsi_stmt (i
));
14865 case CTOR_INITIALIZER
:
14866 finish_mem_initializers (tsubst_initializer_list
14867 (TREE_OPERAND (t
, 0), args
));
14871 finish_return_stmt (RECUR (TREE_OPERAND (t
, 0)));
14875 tmp
= RECUR (EXPR_STMT_EXPR (t
));
14876 if (EXPR_STMT_STMT_EXPR_RESULT (t
))
14877 finish_stmt_expr_expr (tmp
, cur_stmt_expr
);
14879 finish_expr_stmt (tmp
);
14883 do_using_directive (USING_STMT_NAMESPACE (t
));
14888 tree decl
, pattern_decl
;
14891 pattern_decl
= decl
= DECL_EXPR_DECL (t
);
14892 if (TREE_CODE (decl
) == LABEL_DECL
)
14893 finish_label_decl (DECL_NAME (decl
));
14894 else if (TREE_CODE (decl
) == USING_DECL
)
14896 tree scope
= USING_DECL_SCOPE (decl
);
14897 tree name
= DECL_NAME (decl
);
14900 scope
= tsubst (scope
, args
, complain
, in_decl
);
14901 decl
= lookup_qualified_name (scope
, name
,
14902 /*is_type_p=*/false,
14903 /*complain=*/false);
14904 if (decl
== error_mark_node
|| TREE_CODE (decl
) == TREE_LIST
)
14905 qualified_name_lookup_error (scope
, name
, decl
, input_location
);
14907 do_local_using_decl (decl
, scope
, name
);
14909 else if (DECL_PACK_P (decl
))
14911 /* Don't build up decls for a variadic capture proxy, we'll
14912 instantiate the elements directly as needed. */
14917 init
= DECL_INITIAL (decl
);
14918 decl
= tsubst (decl
, args
, complain
, in_decl
);
14919 if (decl
!= error_mark_node
)
14921 /* By marking the declaration as instantiated, we avoid
14922 trying to instantiate it. Since instantiate_decl can't
14923 handle local variables, and since we've already done
14924 all that needs to be done, that's the right thing to
14927 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
14929 && ANON_AGGR_TYPE_P (TREE_TYPE (decl
)))
14930 /* Anonymous aggregates are a special case. */
14931 finish_anon_union (decl
);
14932 else if (is_capture_proxy (DECL_EXPR_DECL (t
)))
14934 DECL_CONTEXT (decl
) = current_function_decl
;
14935 if (DECL_NAME (decl
) == this_identifier
)
14937 tree lam
= DECL_CONTEXT (current_function_decl
);
14938 lam
= CLASSTYPE_LAMBDA_EXPR (lam
);
14939 LAMBDA_EXPR_THIS_CAPTURE (lam
) = decl
;
14941 insert_capture_proxy (decl
);
14943 else if (DECL_IMPLICIT_TYPEDEF_P (t
))
14944 /* We already did a pushtag. */;
14945 else if (TREE_CODE (decl
) == FUNCTION_DECL
14946 && DECL_OMP_DECLARE_REDUCTION_P (decl
)
14947 && DECL_FUNCTION_SCOPE_P (pattern_decl
))
14949 DECL_CONTEXT (decl
) = NULL_TREE
;
14951 DECL_CONTEXT (decl
) = current_function_decl
;
14952 cp_check_omp_declare_reduction (decl
);
14956 int const_init
= false;
14957 maybe_push_decl (decl
);
14959 && DECL_PRETTY_FUNCTION_P (decl
))
14961 /* For __PRETTY_FUNCTION__ we have to adjust the
14963 const char *const name
14964 = cxx_printable_name (current_function_decl
, 2);
14965 init
= cp_fname_init (name
, &TREE_TYPE (decl
));
14968 init
= tsubst_init (init
, decl
, args
, complain
, in_decl
);
14971 const_init
= (DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P
14973 cp_finish_decl (decl
, init
, const_init
, NULL_TREE
, 0);
14982 stmt
= begin_for_stmt (NULL_TREE
, NULL_TREE
);
14983 RECUR (FOR_INIT_STMT (t
));
14984 finish_for_init_stmt (stmt
);
14985 tmp
= RECUR (FOR_COND (t
));
14986 finish_for_cond (tmp
, stmt
, false);
14987 tmp
= RECUR (FOR_EXPR (t
));
14988 finish_for_expr (tmp
, stmt
);
14989 RECUR (FOR_BODY (t
));
14990 finish_for_stmt (stmt
);
14993 case RANGE_FOR_STMT
:
14996 stmt
= begin_for_stmt (NULL_TREE
, NULL_TREE
);
14997 decl
= RANGE_FOR_DECL (t
);
14998 decl
= tsubst (decl
, args
, complain
, in_decl
);
14999 maybe_push_decl (decl
);
15000 expr
= RECUR (RANGE_FOR_EXPR (t
));
15001 stmt
= cp_convert_range_for (stmt
, decl
, expr
, RANGE_FOR_IVDEP (t
));
15002 RECUR (RANGE_FOR_BODY (t
));
15003 finish_for_stmt (stmt
);
15008 stmt
= begin_while_stmt ();
15009 tmp
= RECUR (WHILE_COND (t
));
15010 finish_while_stmt_cond (tmp
, stmt
, false);
15011 RECUR (WHILE_BODY (t
));
15012 finish_while_stmt (stmt
);
15016 stmt
= begin_do_stmt ();
15017 RECUR (DO_BODY (t
));
15018 finish_do_body (stmt
);
15019 tmp
= RECUR (DO_COND (t
));
15020 finish_do_stmt (tmp
, stmt
, false);
15024 stmt
= begin_if_stmt ();
15025 tmp
= RECUR (IF_COND (t
));
15026 finish_if_stmt_cond (tmp
, stmt
);
15027 RECUR (THEN_CLAUSE (t
));
15028 finish_then_clause (stmt
);
15030 if (ELSE_CLAUSE (t
))
15032 begin_else_clause (stmt
);
15033 RECUR (ELSE_CLAUSE (t
));
15034 finish_else_clause (stmt
);
15037 finish_if_stmt (stmt
);
15041 if (BIND_EXPR_BODY_BLOCK (t
))
15042 stmt
= begin_function_body ();
15044 stmt
= begin_compound_stmt (BIND_EXPR_TRY_BLOCK (t
)
15045 ? BCS_TRY_BLOCK
: 0);
15047 RECUR (BIND_EXPR_BODY (t
));
15049 if (BIND_EXPR_BODY_BLOCK (t
))
15050 finish_function_body (stmt
);
15052 finish_compound_stmt (stmt
);
15056 finish_break_stmt ();
15059 case CONTINUE_STMT
:
15060 finish_continue_stmt ();
15064 stmt
= begin_switch_stmt ();
15065 tmp
= RECUR (SWITCH_STMT_COND (t
));
15066 finish_switch_cond (tmp
, stmt
);
15067 RECUR (SWITCH_STMT_BODY (t
));
15068 finish_switch_stmt (stmt
);
15071 case CASE_LABEL_EXPR
:
15073 tree low
= RECUR (CASE_LOW (t
));
15074 tree high
= RECUR (CASE_HIGH (t
));
15075 finish_case_label (EXPR_LOCATION (t
), low
, high
);
15081 tree decl
= LABEL_EXPR_LABEL (t
);
15084 label
= finish_label_stmt (DECL_NAME (decl
));
15085 if (DECL_ATTRIBUTES (decl
) != NULL_TREE
)
15086 cplus_decl_attributes (&label
, DECL_ATTRIBUTES (decl
), 0);
15091 tmp
= GOTO_DESTINATION (t
);
15092 if (TREE_CODE (tmp
) != LABEL_DECL
)
15093 /* Computed goto's must be tsubst'd into. On the other hand,
15094 non-computed gotos must not be; the identifier in question
15095 will have no binding. */
15098 tmp
= DECL_NAME (tmp
);
15099 finish_goto_stmt (tmp
);
15104 tree string
= RECUR (ASM_STRING (t
));
15105 tree outputs
= tsubst_copy_asm_operands (ASM_OUTPUTS (t
), args
,
15106 complain
, in_decl
);
15107 tree inputs
= tsubst_copy_asm_operands (ASM_INPUTS (t
), args
,
15108 complain
, in_decl
);
15109 tree clobbers
= tsubst_copy_asm_operands (ASM_CLOBBERS (t
), args
,
15110 complain
, in_decl
);
15111 tree labels
= tsubst_copy_asm_operands (ASM_LABELS (t
), args
,
15112 complain
, in_decl
);
15113 tmp
= finish_asm_stmt (ASM_VOLATILE_P (t
), string
, outputs
, inputs
,
15115 tree asm_expr
= tmp
;
15116 if (TREE_CODE (asm_expr
) == CLEANUP_POINT_EXPR
)
15117 asm_expr
= TREE_OPERAND (asm_expr
, 0);
15118 ASM_INPUT_P (asm_expr
) = ASM_INPUT_P (t
);
15125 stmt
= begin_try_block ();
15126 RECUR (TRY_STMTS (t
));
15127 finish_cleanup_try_block (stmt
);
15128 finish_cleanup (RECUR (TRY_HANDLERS (t
)), stmt
);
15132 tree compound_stmt
= NULL_TREE
;
15134 if (FN_TRY_BLOCK_P (t
))
15135 stmt
= begin_function_try_block (&compound_stmt
);
15137 stmt
= begin_try_block ();
15139 RECUR (TRY_STMTS (t
));
15141 if (FN_TRY_BLOCK_P (t
))
15142 finish_function_try_block (stmt
);
15144 finish_try_block (stmt
);
15146 RECUR (TRY_HANDLERS (t
));
15147 if (FN_TRY_BLOCK_P (t
))
15148 finish_function_handler_sequence (stmt
, compound_stmt
);
15150 finish_handler_sequence (stmt
);
15156 tree decl
= HANDLER_PARMS (t
);
15160 decl
= tsubst (decl
, args
, complain
, in_decl
);
15161 /* Prevent instantiate_decl from trying to instantiate
15162 this variable. We've already done all that needs to be
15164 if (decl
!= error_mark_node
)
15165 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
15167 stmt
= begin_handler ();
15168 finish_handler_parms (decl
, stmt
);
15169 RECUR (HANDLER_BODY (t
));
15170 finish_handler (stmt
);
15175 tmp
= tsubst (TREE_TYPE (t
), args
, complain
, NULL_TREE
);
15176 if (CLASS_TYPE_P (tmp
))
15178 /* Local classes are not independent templates; they are
15179 instantiated along with their containing function. And this
15180 way we don't have to deal with pushing out of one local class
15181 to instantiate a member of another local class. */
15183 /* Closures are handled by the LAMBDA_EXPR. */
15184 gcc_assert (!LAMBDA_TYPE_P (TREE_TYPE (t
)));
15185 complete_type (tmp
);
15186 for (fn
= TYPE_METHODS (tmp
); fn
; fn
= DECL_CHAIN (fn
))
15187 if (!DECL_ARTIFICIAL (fn
))
15188 instantiate_decl (fn
, /*defer_ok*/0, /*expl_inst_class*/false);
15192 case STATIC_ASSERT
:
15196 ++c_inhibit_evaluation_warnings
;
15198 tsubst_expr (STATIC_ASSERT_CONDITION (t
),
15201 /*integral_constant_expression_p=*/true);
15202 --c_inhibit_evaluation_warnings
;
15204 finish_static_assert (condition
,
15205 STATIC_ASSERT_MESSAGE (t
),
15206 STATIC_ASSERT_SOURCE_LOCATION (t
),
15207 /*member_p=*/false);
15212 r
= push_omp_privatization_clauses (OMP_PARALLEL_COMBINED (t
));
15213 tmp
= tsubst_omp_clauses (OMP_PARALLEL_CLAUSES (t
), false, true,
15214 args
, complain
, in_decl
);
15215 if (OMP_PARALLEL_COMBINED (t
))
15216 omp_parallel_combined_clauses
= &tmp
;
15217 stmt
= begin_omp_parallel ();
15218 RECUR (OMP_PARALLEL_BODY (t
));
15219 gcc_assert (omp_parallel_combined_clauses
== NULL
);
15220 OMP_PARALLEL_COMBINED (finish_omp_parallel (tmp
, stmt
))
15221 = OMP_PARALLEL_COMBINED (t
);
15222 pop_omp_privatization_clauses (r
);
15226 r
= push_omp_privatization_clauses (false);
15227 tmp
= tsubst_omp_clauses (OMP_TASK_CLAUSES (t
), false, true,
15228 args
, complain
, in_decl
);
15229 stmt
= begin_omp_task ();
15230 RECUR (OMP_TASK_BODY (t
));
15231 finish_omp_task (tmp
, stmt
);
15232 pop_omp_privatization_clauses (r
);
15239 case OMP_DISTRIBUTE
:
15242 tree clauses
, body
, pre_body
;
15243 tree declv
= NULL_TREE
, initv
= NULL_TREE
, condv
= NULL_TREE
;
15244 tree orig_declv
= NULL_TREE
;
15245 tree incrv
= NULL_TREE
;
15248 r
= push_omp_privatization_clauses (OMP_FOR_INIT (t
) == NULL_TREE
);
15249 clauses
= tsubst_omp_clauses (OMP_FOR_CLAUSES (t
), false, true,
15250 args
, complain
, in_decl
);
15251 if (OMP_FOR_INIT (t
) != NULL_TREE
)
15253 declv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
15254 if (TREE_CODE (t
) == OMP_FOR
&& OMP_FOR_ORIG_DECLS (t
))
15255 orig_declv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
15256 initv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
15257 condv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
15258 incrv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
15261 stmt
= begin_omp_structured_block ();
15263 pre_body
= push_stmt_list ();
15264 RECUR (OMP_FOR_PRE_BODY (t
));
15265 pre_body
= pop_stmt_list (pre_body
);
15267 if (OMP_FOR_INIT (t
) != NULL_TREE
)
15268 for (i
= 0; i
< TREE_VEC_LENGTH (OMP_FOR_INIT (t
)); i
++)
15269 tsubst_omp_for_iterator (t
, i
, declv
, orig_declv
, initv
, condv
,
15270 incrv
, &clauses
, args
, complain
, in_decl
,
15271 integral_constant_expression_p
);
15272 omp_parallel_combined_clauses
= NULL
;
15274 body
= push_stmt_list ();
15275 RECUR (OMP_FOR_BODY (t
));
15276 body
= pop_stmt_list (body
);
15278 if (OMP_FOR_INIT (t
) != NULL_TREE
)
15279 t
= finish_omp_for (EXPR_LOCATION (t
), TREE_CODE (t
), declv
,
15280 orig_declv
, initv
, condv
, incrv
, body
, pre_body
,
15284 t
= make_node (TREE_CODE (t
));
15285 TREE_TYPE (t
) = void_type_node
;
15286 OMP_FOR_BODY (t
) = body
;
15287 OMP_FOR_PRE_BODY (t
) = pre_body
;
15288 OMP_FOR_CLAUSES (t
) = clauses
;
15289 SET_EXPR_LOCATION (t
, EXPR_LOCATION (t
));
15293 add_stmt (finish_omp_structured_block (stmt
));
15294 pop_omp_privatization_clauses (r
);
15299 omp_parallel_combined_clauses
= NULL
;
15304 r
= push_omp_privatization_clauses (TREE_CODE (t
) == OMP_TEAMS
15305 && OMP_TEAMS_COMBINED (t
));
15306 tmp
= tsubst_omp_clauses (OMP_CLAUSES (t
), false, true,
15307 args
, complain
, in_decl
);
15308 stmt
= push_stmt_list ();
15309 RECUR (OMP_BODY (t
));
15310 stmt
= pop_stmt_list (stmt
);
15313 OMP_BODY (t
) = stmt
;
15314 OMP_CLAUSES (t
) = tmp
;
15316 pop_omp_privatization_clauses (r
);
15319 case OMP_TARGET_DATA
:
15321 tmp
= tsubst_omp_clauses (OMP_CLAUSES (t
), false, true,
15322 args
, complain
, in_decl
);
15323 keep_next_level (true);
15324 stmt
= begin_omp_structured_block ();
15326 RECUR (OMP_BODY (t
));
15327 stmt
= finish_omp_structured_block (stmt
);
15330 OMP_BODY (t
) = stmt
;
15331 OMP_CLAUSES (t
) = tmp
;
15335 case OMP_TARGET_UPDATE
:
15336 case OMP_TARGET_ENTER_DATA
:
15337 case OMP_TARGET_EXIT_DATA
:
15338 tmp
= tsubst_omp_clauses (OMP_STANDALONE_CLAUSES (t
), false, true,
15339 args
, complain
, in_decl
);
15341 OMP_STANDALONE_CLAUSES (t
) = tmp
;
15346 tmp
= tsubst_omp_clauses (OMP_ORDERED_CLAUSES (t
), false, true,
15347 args
, complain
, in_decl
);
15348 stmt
= push_stmt_list ();
15349 RECUR (OMP_BODY (t
));
15350 stmt
= pop_stmt_list (stmt
);
15353 OMP_BODY (t
) = stmt
;
15354 OMP_ORDERED_CLAUSES (t
) = tmp
;
15360 case OMP_TASKGROUP
:
15361 stmt
= push_stmt_list ();
15362 RECUR (OMP_BODY (t
));
15363 stmt
= pop_stmt_list (stmt
);
15366 OMP_BODY (t
) = stmt
;
15371 gcc_assert (OMP_ATOMIC_DEPENDENT_P (t
));
15372 if (TREE_CODE (TREE_OPERAND (t
, 1)) != MODIFY_EXPR
)
15374 tree op1
= TREE_OPERAND (t
, 1);
15375 tree rhs1
= NULL_TREE
;
15377 if (TREE_CODE (op1
) == COMPOUND_EXPR
)
15379 rhs1
= RECUR (TREE_OPERAND (op1
, 0));
15380 op1
= TREE_OPERAND (op1
, 1);
15382 lhs
= RECUR (TREE_OPERAND (op1
, 0));
15383 rhs
= RECUR (TREE_OPERAND (op1
, 1));
15384 finish_omp_atomic (OMP_ATOMIC
, TREE_CODE (op1
), lhs
, rhs
,
15385 NULL_TREE
, NULL_TREE
, rhs1
,
15386 OMP_ATOMIC_SEQ_CST (t
));
15390 tree op1
= TREE_OPERAND (t
, 1);
15391 tree v
= NULL_TREE
, lhs
, rhs
= NULL_TREE
, lhs1
= NULL_TREE
;
15392 tree rhs1
= NULL_TREE
;
15393 enum tree_code code
= TREE_CODE (TREE_OPERAND (op1
, 1));
15394 enum tree_code opcode
= NOP_EXPR
;
15395 if (code
== OMP_ATOMIC_READ
)
15397 v
= RECUR (TREE_OPERAND (op1
, 0));
15398 lhs
= RECUR (TREE_OPERAND (TREE_OPERAND (op1
, 1), 0));
15400 else if (code
== OMP_ATOMIC_CAPTURE_OLD
15401 || code
== OMP_ATOMIC_CAPTURE_NEW
)
15403 tree op11
= TREE_OPERAND (TREE_OPERAND (op1
, 1), 1);
15404 v
= RECUR (TREE_OPERAND (op1
, 0));
15405 lhs1
= RECUR (TREE_OPERAND (TREE_OPERAND (op1
, 1), 0));
15406 if (TREE_CODE (op11
) == COMPOUND_EXPR
)
15408 rhs1
= RECUR (TREE_OPERAND (op11
, 0));
15409 op11
= TREE_OPERAND (op11
, 1);
15411 lhs
= RECUR (TREE_OPERAND (op11
, 0));
15412 rhs
= RECUR (TREE_OPERAND (op11
, 1));
15413 opcode
= TREE_CODE (op11
);
15414 if (opcode
== MODIFY_EXPR
)
15420 lhs
= RECUR (TREE_OPERAND (op1
, 0));
15421 rhs
= RECUR (TREE_OPERAND (op1
, 1));
15423 finish_omp_atomic (code
, opcode
, lhs
, rhs
, v
, lhs1
, rhs1
,
15424 OMP_ATOMIC_SEQ_CST (t
));
15428 case TRANSACTION_EXPR
:
15431 flags
|= (TRANSACTION_EXPR_OUTER (t
) ? TM_STMT_ATTR_OUTER
: 0);
15432 flags
|= (TRANSACTION_EXPR_RELAXED (t
) ? TM_STMT_ATTR_RELAXED
: 0);
15434 if (TRANSACTION_EXPR_IS_STMT (t
))
15436 tree body
= TRANSACTION_EXPR_BODY (t
);
15437 tree noex
= NULL_TREE
;
15438 if (TREE_CODE (body
) == MUST_NOT_THROW_EXPR
)
15440 noex
= MUST_NOT_THROW_COND (body
);
15441 if (noex
== NULL_TREE
)
15442 noex
= boolean_true_node
;
15443 body
= TREE_OPERAND (body
, 0);
15445 stmt
= begin_transaction_stmt (input_location
, NULL
, flags
);
15447 finish_transaction_stmt (stmt
, NULL
, flags
, RECUR (noex
));
15451 stmt
= build_transaction_expr (EXPR_LOCATION (t
),
15452 RECUR (TRANSACTION_EXPR_BODY (t
)),
15459 case MUST_NOT_THROW_EXPR
:
15461 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15462 tree cond
= RECUR (MUST_NOT_THROW_COND (t
));
15463 RETURN (build_must_not_throw_expr (op0
, cond
));
15466 case EXPR_PACK_EXPANSION
:
15467 error ("invalid use of pack expansion expression");
15468 RETURN (error_mark_node
);
15470 case NONTYPE_ARGUMENT_PACK
:
15471 error ("use %<...%> to expand argument pack");
15472 RETURN (error_mark_node
);
15474 case CILK_SPAWN_STMT
:
15475 cfun
->calls_cilk_spawn
= 1;
15476 RETURN (build_cilk_spawn (EXPR_LOCATION (t
), RECUR (CILK_SPAWN_FN (t
))));
15478 case CILK_SYNC_STMT
:
15479 RETURN (build_cilk_sync ());
15481 case COMPOUND_EXPR
:
15482 tmp
= RECUR (TREE_OPERAND (t
, 0));
15483 if (tmp
== NULL_TREE
)
15484 /* If the first operand was a statement, we're done with it. */
15485 RETURN (RECUR (TREE_OPERAND (t
, 1)));
15486 RETURN (build_x_compound_expr (EXPR_LOCATION (t
), tmp
,
15487 RECUR (TREE_OPERAND (t
, 1)),
15490 case ANNOTATE_EXPR
:
15491 tmp
= RECUR (TREE_OPERAND (t
, 0));
15492 RETURN (build2_loc (EXPR_LOCATION (t
), ANNOTATE_EXPR
,
15493 TREE_TYPE (tmp
), tmp
, RECUR (TREE_OPERAND (t
, 1))));
15496 gcc_assert (!STATEMENT_CODE_P (TREE_CODE (t
)));
15498 RETURN (tsubst_copy_and_build (t
, args
, complain
, in_decl
,
15499 /*function_p=*/false,
15500 integral_constant_expression_p
));
15503 RETURN (NULL_TREE
);
15505 input_location
= loc
;
15511 /* Instantiate the special body of the artificial DECL_OMP_DECLARE_REDUCTION
15512 function. For description of the body see comment above
15513 cp_parser_omp_declare_reduction_exprs. */
15516 tsubst_omp_udr (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
15518 if (t
== NULL_TREE
|| t
== error_mark_node
)
15521 gcc_assert (TREE_CODE (t
) == STATEMENT_LIST
);
15523 tree_stmt_iterator tsi
;
15526 memset (stmts
, 0, sizeof stmts
);
15527 for (i
= 0, tsi
= tsi_start (t
);
15528 i
< 7 && !tsi_end_p (tsi
);
15529 i
++, tsi_next (&tsi
))
15530 stmts
[i
] = tsi_stmt (tsi
);
15531 gcc_assert (tsi_end_p (tsi
));
15535 gcc_assert (TREE_CODE (stmts
[0]) == DECL_EXPR
15536 && TREE_CODE (stmts
[1]) == DECL_EXPR
);
15537 tree omp_out
= tsubst (DECL_EXPR_DECL (stmts
[0]),
15538 args
, complain
, in_decl
);
15539 tree omp_in
= tsubst (DECL_EXPR_DECL (stmts
[1]),
15540 args
, complain
, in_decl
);
15541 DECL_CONTEXT (omp_out
) = current_function_decl
;
15542 DECL_CONTEXT (omp_in
) = current_function_decl
;
15543 keep_next_level (true);
15544 tree block
= begin_omp_structured_block ();
15545 tsubst_expr (stmts
[2], args
, complain
, in_decl
, false);
15546 block
= finish_omp_structured_block (block
);
15547 block
= maybe_cleanup_point_expr_void (block
);
15548 add_decl_expr (omp_out
);
15549 if (TREE_NO_WARNING (DECL_EXPR_DECL (stmts
[0])))
15550 TREE_NO_WARNING (omp_out
) = 1;
15551 add_decl_expr (omp_in
);
15552 finish_expr_stmt (block
);
15556 gcc_assert (TREE_CODE (stmts
[3]) == DECL_EXPR
15557 && TREE_CODE (stmts
[4]) == DECL_EXPR
);
15558 tree omp_priv
= tsubst (DECL_EXPR_DECL (stmts
[3]),
15559 args
, complain
, in_decl
);
15560 tree omp_orig
= tsubst (DECL_EXPR_DECL (stmts
[4]),
15561 args
, complain
, in_decl
);
15562 DECL_CONTEXT (omp_priv
) = current_function_decl
;
15563 DECL_CONTEXT (omp_orig
) = current_function_decl
;
15564 keep_next_level (true);
15565 tree block
= begin_omp_structured_block ();
15566 tsubst_expr (stmts
[5], args
, complain
, in_decl
, false);
15567 block
= finish_omp_structured_block (block
);
15568 block
= maybe_cleanup_point_expr_void (block
);
15569 cp_walk_tree (&block
, cp_remove_omp_priv_cleanup_stmt
, omp_priv
, NULL
);
15570 add_decl_expr (omp_priv
);
15571 add_decl_expr (omp_orig
);
15572 finish_expr_stmt (block
);
15574 add_decl_expr (omp_orig
);
15578 /* T is a postfix-expression that is not being used in a function
15579 call. Return the substituted version of T. */
15582 tsubst_non_call_postfix_expression (tree t
, tree args
,
15583 tsubst_flags_t complain
,
15586 if (TREE_CODE (t
) == SCOPE_REF
)
15587 t
= tsubst_qualified_id (t
, args
, complain
, in_decl
,
15588 /*done=*/false, /*address_p=*/false);
15590 t
= tsubst_copy_and_build (t
, args
, complain
, in_decl
,
15591 /*function_p=*/false,
15592 /*integral_constant_expression_p=*/false);
15597 /* Like tsubst but deals with expressions and performs semantic
15598 analysis. FUNCTION_P is true if T is the "F" in "F (ARGS)". */
15601 tsubst_copy_and_build (tree t
,
15603 tsubst_flags_t complain
,
15606 bool integral_constant_expression_p
)
15608 #define RETURN(EXP) do { retval = (EXP); goto out; } while(0)
15609 #define RECUR(NODE) \
15610 tsubst_copy_and_build (NODE, args, complain, in_decl, \
15611 /*function_p=*/false, \
15612 integral_constant_expression_p)
15617 if (t
== NULL_TREE
|| t
== error_mark_node
)
15620 loc
= input_location
;
15621 if (EXPR_HAS_LOCATION (t
))
15622 input_location
= EXPR_LOCATION (t
);
15624 /* N3276 decltype magic only applies to calls at the top level or on the
15625 right side of a comma. */
15626 tsubst_flags_t decltype_flag
= (complain
& tf_decltype
);
15627 complain
&= ~tf_decltype
;
15629 switch (TREE_CODE (t
))
15633 /* Fall through. */
15634 case IDENTIFIER_NODE
:
15638 bool non_integral_constant_expression_p
;
15639 const char *error_msg
;
15641 if (IDENTIFIER_TYPENAME_P (t
))
15643 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15644 t
= mangle_conv_op_name_for_type (new_type
);
15647 /* Look up the name. */
15648 decl
= lookup_name (t
);
15650 /* By convention, expressions use ERROR_MARK_NODE to indicate
15651 failure, not NULL_TREE. */
15652 if (decl
== NULL_TREE
)
15653 decl
= error_mark_node
;
15655 decl
= finish_id_expression (t
, decl
, NULL_TREE
,
15657 integral_constant_expression_p
,
15658 /*allow_non_integral_constant_expression_p=*/(cxx_dialect
>= cxx11
),
15659 &non_integral_constant_expression_p
,
15660 /*template_p=*/false,
15662 /*address_p=*/false,
15663 /*template_arg_p=*/false,
15668 if (!function_p
&& identifier_p (decl
))
15670 if (complain
& tf_error
)
15671 unqualified_name_lookup_error (decl
);
15672 decl
= error_mark_node
;
15677 case TEMPLATE_ID_EXPR
:
15680 tree templ
= RECUR (TREE_OPERAND (t
, 0));
15681 tree targs
= TREE_OPERAND (t
, 1);
15684 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
15685 if (targs
== error_mark_node
)
15686 return error_mark_node
;
15688 if (variable_template_p (templ
))
15690 templ
= lookup_template_variable (templ
, targs
);
15691 if (!any_dependent_template_arguments_p (targs
))
15693 templ
= finish_template_variable (templ
, complain
);
15696 RETURN (convert_from_reference (templ
));
15699 if (TREE_CODE (templ
) == COMPONENT_REF
)
15701 object
= TREE_OPERAND (templ
, 0);
15702 templ
= TREE_OPERAND (templ
, 1);
15705 object
= NULL_TREE
;
15706 templ
= lookup_template_function (templ
, targs
);
15709 RETURN (build3 (COMPONENT_REF
, TREE_TYPE (templ
),
15710 object
, templ
, NULL_TREE
));
15712 RETURN (baselink_for_fns (templ
));
15717 tree r
= RECUR (TREE_OPERAND (t
, 0));
15719 if (REFERENCE_REF_P (t
))
15721 /* A type conversion to reference type will be enclosed in
15722 such an indirect ref, but the substitution of the cast
15723 will have also added such an indirect ref. */
15724 if (TREE_CODE (TREE_TYPE (r
)) == REFERENCE_TYPE
)
15725 r
= convert_from_reference (r
);
15728 r
= build_x_indirect_ref (input_location
, r
, RO_UNARY_STAR
,
15729 complain
|decltype_flag
);
15735 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15736 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15737 RETURN (build_nop (type
, op0
));
15740 case IMPLICIT_CONV_EXPR
:
15742 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15743 tree expr
= RECUR (TREE_OPERAND (t
, 0));
15744 int flags
= LOOKUP_IMPLICIT
;
15745 if (IMPLICIT_CONV_EXPR_DIRECT_INIT (t
))
15746 flags
= LOOKUP_NORMAL
;
15747 RETURN (perform_implicit_conversion_flags (type
, expr
, complain
,
15753 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15754 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15755 RETURN (build1 (CONVERT_EXPR
, type
, op0
));
15759 case REINTERPRET_CAST_EXPR
:
15760 case CONST_CAST_EXPR
:
15761 case DYNAMIC_CAST_EXPR
:
15762 case STATIC_CAST_EXPR
:
15765 tree op
, r
= NULL_TREE
;
15767 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15768 if (integral_constant_expression_p
15769 && !cast_valid_in_integral_constant_expression_p (type
))
15771 if (complain
& tf_error
)
15772 error ("a cast to a type other than an integral or "
15773 "enumeration type cannot appear in a constant-expression");
15774 RETURN (error_mark_node
);
15777 op
= RECUR (TREE_OPERAND (t
, 0));
15779 warning_sentinel
s(warn_useless_cast
);
15780 switch (TREE_CODE (t
))
15783 r
= build_functional_cast (type
, op
, complain
);
15785 case REINTERPRET_CAST_EXPR
:
15786 r
= build_reinterpret_cast (type
, op
, complain
);
15788 case CONST_CAST_EXPR
:
15789 r
= build_const_cast (type
, op
, complain
);
15791 case DYNAMIC_CAST_EXPR
:
15792 r
= build_dynamic_cast (type
, op
, complain
);
15794 case STATIC_CAST_EXPR
:
15795 r
= build_static_cast (type
, op
, complain
);
15798 gcc_unreachable ();
15804 case POSTDECREMENT_EXPR
:
15805 case POSTINCREMENT_EXPR
:
15806 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
15807 args
, complain
, in_decl
);
15808 RETURN (build_x_unary_op (input_location
, TREE_CODE (t
), op1
,
15809 complain
|decltype_flag
));
15811 case PREDECREMENT_EXPR
:
15812 case PREINCREMENT_EXPR
:
15816 case TRUTH_NOT_EXPR
:
15817 case UNARY_PLUS_EXPR
: /* Unary + */
15818 case REALPART_EXPR
:
15819 case IMAGPART_EXPR
:
15820 RETURN (build_x_unary_op (input_location
, TREE_CODE (t
),
15821 RECUR (TREE_OPERAND (t
, 0)),
15822 complain
|decltype_flag
));
15824 case FIX_TRUNC_EXPR
:
15825 RETURN (cp_build_unary_op (FIX_TRUNC_EXPR
, RECUR (TREE_OPERAND (t
, 0)),
15829 op1
= TREE_OPERAND (t
, 0);
15830 if (TREE_CODE (op1
) == LABEL_DECL
)
15831 RETURN (finish_label_address_expr (DECL_NAME (op1
),
15832 EXPR_LOCATION (op1
)));
15833 if (TREE_CODE (op1
) == SCOPE_REF
)
15834 op1
= tsubst_qualified_id (op1
, args
, complain
, in_decl
,
15835 /*done=*/true, /*address_p=*/true);
15837 op1
= tsubst_non_call_postfix_expression (op1
, args
, complain
,
15839 RETURN (build_x_unary_op (input_location
, ADDR_EXPR
, op1
,
15840 complain
|decltype_flag
));
15845 case TRUNC_DIV_EXPR
:
15846 case CEIL_DIV_EXPR
:
15847 case FLOOR_DIV_EXPR
:
15848 case ROUND_DIV_EXPR
:
15849 case EXACT_DIV_EXPR
:
15853 case TRUNC_MOD_EXPR
:
15854 case FLOOR_MOD_EXPR
:
15855 case TRUTH_ANDIF_EXPR
:
15856 case TRUTH_ORIF_EXPR
:
15857 case TRUTH_AND_EXPR
:
15858 case TRUTH_OR_EXPR
:
15874 warning_sentinel
s1(warn_type_limits
);
15875 warning_sentinel
s2(warn_div_by_zero
);
15876 warning_sentinel
s3(warn_logical_op
);
15877 warning_sentinel
s4(warn_tautological_compare
);
15878 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15879 tree op1
= RECUR (TREE_OPERAND (t
, 1));
15880 tree r
= build_x_binary_op
15881 (input_location
, TREE_CODE (t
),
15883 (TREE_NO_WARNING (TREE_OPERAND (t
, 0))
15885 : TREE_CODE (TREE_OPERAND (t
, 0))),
15887 (TREE_NO_WARNING (TREE_OPERAND (t
, 1))
15889 : TREE_CODE (TREE_OPERAND (t
, 1))),
15891 complain
|decltype_flag
);
15892 if (EXPR_P (r
) && TREE_NO_WARNING (t
))
15893 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
15898 case POINTER_PLUS_EXPR
:
15900 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15901 tree op1
= RECUR (TREE_OPERAND (t
, 1));
15902 return fold_build_pointer_plus (op0
, op1
);
15906 RETURN (tsubst_qualified_id (t
, args
, complain
, in_decl
, /*done=*/true,
15907 /*address_p=*/false));
15909 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
15910 args
, complain
, in_decl
);
15911 RETURN (build_x_array_ref (EXPR_LOCATION (t
), op1
,
15912 RECUR (TREE_OPERAND (t
, 1)),
15913 complain
|decltype_flag
));
15915 case ARRAY_NOTATION_REF
:
15917 tree start_index
, length
, stride
;
15918 op1
= tsubst_non_call_postfix_expression (ARRAY_NOTATION_ARRAY (t
),
15919 args
, complain
, in_decl
);
15920 start_index
= RECUR (ARRAY_NOTATION_START (t
));
15921 length
= RECUR (ARRAY_NOTATION_LENGTH (t
));
15922 stride
= RECUR (ARRAY_NOTATION_STRIDE (t
));
15923 RETURN (build_array_notation_ref (EXPR_LOCATION (t
), op1
, start_index
,
15924 length
, stride
, TREE_TYPE (op1
)));
15927 if (PACK_EXPANSION_P (TREE_OPERAND (t
, 0)))
15928 RETURN (tsubst_copy (t
, args
, complain
, in_decl
));
15935 op1
= TREE_OPERAND (t
, 0);
15936 if (TREE_CODE (t
) == SIZEOF_EXPR
&& SIZEOF_EXPR_TYPE_P (t
))
15937 op1
= TREE_TYPE (op1
);
15940 /* When there are no ARGS, we are trying to evaluate a
15941 non-dependent expression from the parser. Trying to do
15942 the substitutions may not work. */
15944 op1
= TREE_TYPE (op1
);
15948 ++cp_unevaluated_operand
;
15949 ++c_inhibit_evaluation_warnings
;
15951 op1
= tsubst (op1
, args
, complain
, in_decl
);
15953 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
15954 /*function_p=*/false,
15955 /*integral_constant_expression_p=*/
15957 --cp_unevaluated_operand
;
15958 --c_inhibit_evaluation_warnings
;
15961 r
= cxx_sizeof_or_alignof_type (op1
, TREE_CODE (t
),
15962 complain
& tf_error
);
15964 r
= cxx_sizeof_or_alignof_expr (op1
, TREE_CODE (t
),
15965 complain
& tf_error
);
15966 if (TREE_CODE (t
) == SIZEOF_EXPR
&& r
!= error_mark_node
)
15968 if (TREE_CODE (r
) != SIZEOF_EXPR
|| TYPE_P (op1
))
15970 if (!processing_template_decl
&& TYPE_P (op1
))
15972 r
= build_min (SIZEOF_EXPR
, size_type_node
,
15973 build1 (NOP_EXPR
, op1
, error_mark_node
));
15974 SIZEOF_EXPR_TYPE_P (r
) = 1;
15977 r
= build_min (SIZEOF_EXPR
, size_type_node
, op1
);
15978 TREE_SIDE_EFFECTS (r
) = 0;
15979 TREE_READONLY (r
) = 1;
15981 SET_EXPR_LOCATION (r
, EXPR_LOCATION (t
));
15986 case AT_ENCODE_EXPR
:
15988 op1
= TREE_OPERAND (t
, 0);
15989 ++cp_unevaluated_operand
;
15990 ++c_inhibit_evaluation_warnings
;
15991 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
15992 /*function_p=*/false,
15993 /*integral_constant_expression_p=*/false);
15994 --cp_unevaluated_operand
;
15995 --c_inhibit_evaluation_warnings
;
15996 RETURN (objc_build_encode_expr (op1
));
15999 case NOEXCEPT_EXPR
:
16000 op1
= TREE_OPERAND (t
, 0);
16001 ++cp_unevaluated_operand
;
16002 ++c_inhibit_evaluation_warnings
;
16003 ++cp_noexcept_operand
;
16004 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
16005 /*function_p=*/false,
16006 /*integral_constant_expression_p=*/false);
16007 --cp_unevaluated_operand
;
16008 --c_inhibit_evaluation_warnings
;
16009 --cp_noexcept_operand
;
16010 RETURN (finish_noexcept_expr (op1
, complain
));
16014 warning_sentinel
s(warn_div_by_zero
);
16015 tree lhs
= RECUR (TREE_OPERAND (t
, 0));
16016 tree rhs
= RECUR (TREE_OPERAND (t
, 2));
16017 tree r
= build_x_modify_expr
16018 (EXPR_LOCATION (t
), lhs
, TREE_CODE (TREE_OPERAND (t
, 1)), rhs
,
16019 complain
|decltype_flag
);
16020 /* TREE_NO_WARNING must be set if either the expression was
16021 parenthesized or it uses an operator such as >>= rather
16022 than plain assignment. In the former case, it was already
16023 set and must be copied. In the latter case,
16024 build_x_modify_expr sets it and it must not be reset
16026 if (TREE_NO_WARNING (t
))
16027 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
16033 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
16034 args
, complain
, in_decl
);
16035 /* Remember that there was a reference to this entity. */
16037 && !mark_used (op1
, complain
) && !(complain
& tf_error
))
16038 RETURN (error_mark_node
);
16039 RETURN (build_x_arrow (input_location
, op1
, complain
));
16043 tree placement
= RECUR (TREE_OPERAND (t
, 0));
16044 tree init
= RECUR (TREE_OPERAND (t
, 3));
16045 vec
<tree
, va_gc
> *placement_vec
;
16046 vec
<tree
, va_gc
> *init_vec
;
16049 if (placement
== NULL_TREE
)
16050 placement_vec
= NULL
;
16053 placement_vec
= make_tree_vector ();
16054 for (; placement
!= NULL_TREE
; placement
= TREE_CHAIN (placement
))
16055 vec_safe_push (placement_vec
, TREE_VALUE (placement
));
16058 /* If there was an initializer in the original tree, but it
16059 instantiated to an empty list, then we should pass a
16060 non-NULL empty vector to tell build_new that it was an
16061 empty initializer() rather than no initializer. This can
16062 only happen when the initializer is a pack expansion whose
16063 parameter packs are of length zero. */
16064 if (init
== NULL_TREE
&& TREE_OPERAND (t
, 3) == NULL_TREE
)
16068 init_vec
= make_tree_vector ();
16069 if (init
== void_node
)
16070 gcc_assert (init_vec
!= NULL
);
16073 for (; init
!= NULL_TREE
; init
= TREE_CHAIN (init
))
16074 vec_safe_push (init_vec
, TREE_VALUE (init
));
16078 tree op1
= tsubst (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
16079 tree op2
= RECUR (TREE_OPERAND (t
, 2));
16080 ret
= build_new (&placement_vec
, op1
, op2
, &init_vec
,
16081 NEW_EXPR_USE_GLOBAL (t
),
16084 if (placement_vec
!= NULL
)
16085 release_tree_vector (placement_vec
);
16086 if (init_vec
!= NULL
)
16087 release_tree_vector (init_vec
);
16094 tree op0
= RECUR (TREE_OPERAND (t
, 0));
16095 tree op1
= RECUR (TREE_OPERAND (t
, 1));
16096 RETURN (delete_sanity (op0
, op1
,
16097 DELETE_EXPR_USE_VEC (t
),
16098 DELETE_EXPR_USE_GLOBAL (t
),
16102 case COMPOUND_EXPR
:
16104 tree op0
= tsubst_copy_and_build (TREE_OPERAND (t
, 0), args
,
16105 complain
& ~tf_decltype
, in_decl
,
16106 /*function_p=*/false,
16107 integral_constant_expression_p
);
16108 RETURN (build_x_compound_expr (EXPR_LOCATION (t
),
16110 RECUR (TREE_OPERAND (t
, 1)),
16111 complain
|decltype_flag
));
16117 vec
<tree
, va_gc
> *call_args
;
16118 unsigned int nargs
, i
;
16123 function
= CALL_EXPR_FN (t
);
16124 /* When we parsed the expression, we determined whether or
16125 not Koenig lookup should be performed. */
16126 koenig_p
= KOENIG_LOOKUP_P (t
);
16127 if (TREE_CODE (function
) == SCOPE_REF
)
16129 qualified_p
= true;
16130 function
= tsubst_qualified_id (function
, args
, complain
, in_decl
,
16132 /*address_p=*/false);
16134 else if (koenig_p
&& identifier_p (function
))
16136 /* Do nothing; calling tsubst_copy_and_build on an identifier
16137 would incorrectly perform unqualified lookup again.
16139 Note that we can also have an IDENTIFIER_NODE if the earlier
16140 unqualified lookup found a member function; in that case
16141 koenig_p will be false and we do want to do the lookup
16142 again to find the instantiated member function.
16144 FIXME but doing that causes c++/15272, so we need to stop
16145 using IDENTIFIER_NODE in that situation. */
16146 qualified_p
= false;
16150 if (TREE_CODE (function
) == COMPONENT_REF
)
16152 tree op
= TREE_OPERAND (function
, 1);
16154 qualified_p
= (TREE_CODE (op
) == SCOPE_REF
16155 || (BASELINK_P (op
)
16156 && BASELINK_QUALIFIED_P (op
)));
16159 qualified_p
= false;
16161 if (TREE_CODE (function
) == ADDR_EXPR
16162 && TREE_CODE (TREE_OPERAND (function
, 0)) == FUNCTION_DECL
)
16163 /* Avoid error about taking the address of a constructor. */
16164 function
= TREE_OPERAND (function
, 0);
16166 function
= tsubst_copy_and_build (function
, args
, complain
,
16169 integral_constant_expression_p
);
16171 if (BASELINK_P (function
))
16172 qualified_p
= true;
16175 nargs
= call_expr_nargs (t
);
16176 call_args
= make_tree_vector ();
16177 for (i
= 0; i
< nargs
; ++i
)
16179 tree arg
= CALL_EXPR_ARG (t
, i
);
16181 if (!PACK_EXPANSION_P (arg
))
16182 vec_safe_push (call_args
, RECUR (CALL_EXPR_ARG (t
, i
)));
16185 /* Expand the pack expansion and push each entry onto
16187 arg
= tsubst_pack_expansion (arg
, args
, complain
, in_decl
);
16188 if (TREE_CODE (arg
) == TREE_VEC
)
16190 unsigned int len
, j
;
16192 len
= TREE_VEC_LENGTH (arg
);
16193 for (j
= 0; j
< len
; ++j
)
16195 tree value
= TREE_VEC_ELT (arg
, j
);
16196 if (value
!= NULL_TREE
)
16197 value
= convert_from_reference (value
);
16198 vec_safe_push (call_args
, value
);
16203 /* A partial substitution. Add one entry. */
16204 vec_safe_push (call_args
, arg
);
16209 /* We do not perform argument-dependent lookup if normal
16210 lookup finds a non-function, in accordance with the
16211 expected resolution of DR 218. */
16213 && ((is_overloaded_fn (function
)
16214 /* If lookup found a member function, the Koenig lookup is
16215 not appropriate, even if an unqualified-name was used
16216 to denote the function. */
16217 && !DECL_FUNCTION_MEMBER_P (get_first_fn (function
)))
16218 || identifier_p (function
))
16219 /* Only do this when substitution turns a dependent call
16220 into a non-dependent call. */
16221 && type_dependent_expression_p_push (t
)
16222 && !any_type_dependent_arguments_p (call_args
))
16223 function
= perform_koenig_lookup (function
, call_args
, tf_none
);
16225 if (identifier_p (function
)
16226 && !any_type_dependent_arguments_p (call_args
))
16228 if (koenig_p
&& (complain
& tf_warning_or_error
))
16230 /* For backwards compatibility and good diagnostics, try
16231 the unqualified lookup again if we aren't in SFINAE
16233 tree unq
= (tsubst_copy_and_build
16234 (function
, args
, complain
, in_decl
, true,
16235 integral_constant_expression_p
));
16236 if (unq
== error_mark_node
)
16237 RETURN (error_mark_node
);
16239 if (unq
!= function
)
16242 if (INDIRECT_REF_P (fn
))
16243 fn
= TREE_OPERAND (fn
, 0);
16244 if (TREE_CODE (fn
) == COMPONENT_REF
)
16245 fn
= TREE_OPERAND (fn
, 1);
16246 if (is_overloaded_fn (fn
))
16247 fn
= get_first_fn (fn
);
16248 if (permerror (EXPR_LOC_OR_LOC (t
, input_location
),
16249 "%qD was not declared in this scope, "
16250 "and no declarations were found by "
16251 "argument-dependent lookup at the point "
16252 "of instantiation", function
))
16255 /* Can't say anything more. */;
16256 else if (DECL_CLASS_SCOPE_P (fn
))
16258 location_t loc
= EXPR_LOC_OR_LOC (t
,
16261 "declarations in dependent base %qT are "
16262 "not found by unqualified lookup",
16263 DECL_CLASS_CONTEXT (fn
));
16264 if (current_class_ptr
)
16266 "use %<this->%D%> instead", function
);
16269 "use %<%T::%D%> instead",
16270 current_class_name
, function
);
16273 inform (DECL_SOURCE_LOCATION (fn
),
16274 "%qD declared here, later in the "
16275 "translation unit", fn
);
16280 if (identifier_p (function
))
16282 if (complain
& tf_error
)
16283 unqualified_name_lookup_error (function
);
16284 release_tree_vector (call_args
);
16285 RETURN (error_mark_node
);
16289 /* Remember that there was a reference to this entity. */
16290 if (DECL_P (function
)
16291 && !mark_used (function
, complain
) && !(complain
& tf_error
))
16292 RETURN (error_mark_node
);
16294 /* Put back tf_decltype for the actual call. */
16295 complain
|= decltype_flag
;
16297 if (TREE_CODE (function
) == OFFSET_REF
)
16298 ret
= build_offset_ref_call_from_tree (function
, &call_args
,
16300 else if (TREE_CODE (function
) == COMPONENT_REF
)
16302 tree instance
= TREE_OPERAND (function
, 0);
16303 tree fn
= TREE_OPERAND (function
, 1);
16305 if (processing_template_decl
16306 && (type_dependent_expression_p (instance
)
16307 || (!BASELINK_P (fn
)
16308 && TREE_CODE (fn
) != FIELD_DECL
)
16309 || type_dependent_expression_p (fn
)
16310 || any_type_dependent_arguments_p (call_args
)))
16311 ret
= build_nt_call_vec (function
, call_args
);
16312 else if (!BASELINK_P (fn
))
16313 ret
= finish_call_expr (function
, &call_args
,
16314 /*disallow_virtual=*/false,
16315 /*koenig_p=*/false,
16318 ret
= (build_new_method_call
16320 &call_args
, NULL_TREE
,
16321 qualified_p
? LOOKUP_NONVIRTUAL
: LOOKUP_NORMAL
,
16326 ret
= finish_call_expr (function
, &call_args
,
16327 /*disallow_virtual=*/qualified_p
,
16331 release_tree_vector (call_args
);
16338 tree cond
= RECUR (TREE_OPERAND (t
, 0));
16339 tree folded_cond
= fold_non_dependent_expr (cond
);
16342 if (TREE_CODE (folded_cond
) == INTEGER_CST
)
16344 if (integer_zerop (folded_cond
))
16346 ++c_inhibit_evaluation_warnings
;
16347 exp1
= RECUR (TREE_OPERAND (t
, 1));
16348 --c_inhibit_evaluation_warnings
;
16349 exp2
= RECUR (TREE_OPERAND (t
, 2));
16353 exp1
= RECUR (TREE_OPERAND (t
, 1));
16354 ++c_inhibit_evaluation_warnings
;
16355 exp2
= RECUR (TREE_OPERAND (t
, 2));
16356 --c_inhibit_evaluation_warnings
;
16358 cond
= folded_cond
;
16362 exp1
= RECUR (TREE_OPERAND (t
, 1));
16363 exp2
= RECUR (TREE_OPERAND (t
, 2));
16366 RETURN (build_x_conditional_expr (EXPR_LOCATION (t
),
16367 cond
, exp1
, exp2
, complain
));
16370 case PSEUDO_DTOR_EXPR
:
16372 tree op0
= RECUR (TREE_OPERAND (t
, 0));
16373 tree op1
= RECUR (TREE_OPERAND (t
, 1));
16374 tree op2
= tsubst (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
16375 RETURN (finish_pseudo_destructor_expr (op0
, op1
, op2
,
16381 tree purpose
, value
, chain
;
16383 if (t
== void_list_node
)
16386 if ((TREE_PURPOSE (t
) && PACK_EXPANSION_P (TREE_PURPOSE (t
)))
16387 || (TREE_VALUE (t
) && PACK_EXPANSION_P (TREE_VALUE (t
))))
16389 /* We have pack expansions, so expand those and
16390 create a new list out of it. */
16391 tree purposevec
= NULL_TREE
;
16392 tree valuevec
= NULL_TREE
;
16396 /* Expand the argument expressions. */
16397 if (TREE_PURPOSE (t
))
16398 purposevec
= tsubst_pack_expansion (TREE_PURPOSE (t
), args
,
16399 complain
, in_decl
);
16400 if (TREE_VALUE (t
))
16401 valuevec
= tsubst_pack_expansion (TREE_VALUE (t
), args
,
16402 complain
, in_decl
);
16404 /* Build the rest of the list. */
16405 chain
= TREE_CHAIN (t
);
16406 if (chain
&& chain
!= void_type_node
)
16407 chain
= RECUR (chain
);
16409 /* Determine the number of arguments. */
16410 if (purposevec
&& TREE_CODE (purposevec
) == TREE_VEC
)
16412 len
= TREE_VEC_LENGTH (purposevec
);
16413 gcc_assert (!valuevec
|| len
== TREE_VEC_LENGTH (valuevec
));
16415 else if (TREE_CODE (valuevec
) == TREE_VEC
)
16416 len
= TREE_VEC_LENGTH (valuevec
);
16419 /* Since we only performed a partial substitution into
16420 the argument pack, we only RETURN (a single list
16422 if (purposevec
== TREE_PURPOSE (t
)
16423 && valuevec
== TREE_VALUE (t
)
16424 && chain
== TREE_CHAIN (t
))
16427 RETURN (tree_cons (purposevec
, valuevec
, chain
));
16430 /* Convert the argument vectors into a TREE_LIST */
16434 /* Grab the Ith values. */
16436 purpose
= purposevec
? TREE_VEC_ELT (purposevec
, i
)
16439 = valuevec
? convert_from_reference (TREE_VEC_ELT (valuevec
, i
))
16442 /* Build the list (backwards). */
16443 chain
= tree_cons (purpose
, value
, chain
);
16449 purpose
= TREE_PURPOSE (t
);
16451 purpose
= RECUR (purpose
);
16452 value
= TREE_VALUE (t
);
16454 value
= RECUR (value
);
16455 chain
= TREE_CHAIN (t
);
16456 if (chain
&& chain
!= void_type_node
)
16457 chain
= RECUR (chain
);
16458 if (purpose
== TREE_PURPOSE (t
)
16459 && value
== TREE_VALUE (t
)
16460 && chain
== TREE_CHAIN (t
))
16462 RETURN (tree_cons (purpose
, value
, chain
));
16465 case COMPONENT_REF
:
16472 object
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
16473 args
, complain
, in_decl
);
16474 /* Remember that there was a reference to this entity. */
16475 if (DECL_P (object
)
16476 && !mark_used (object
, complain
) && !(complain
& tf_error
))
16477 RETURN (error_mark_node
);
16478 object_type
= TREE_TYPE (object
);
16480 member
= TREE_OPERAND (t
, 1);
16481 if (BASELINK_P (member
))
16482 member
= tsubst_baselink (member
,
16483 non_reference (TREE_TYPE (object
)),
16484 args
, complain
, in_decl
);
16486 member
= tsubst_copy (member
, args
, complain
, in_decl
);
16487 if (member
== error_mark_node
)
16488 RETURN (error_mark_node
);
16490 if (type_dependent_expression_p (object
))
16491 /* We can't do much here. */;
16492 else if (!CLASS_TYPE_P (object_type
))
16494 if (scalarish_type_p (object_type
))
16496 tree s
= NULL_TREE
;
16497 tree dtor
= member
;
16499 if (TREE_CODE (dtor
) == SCOPE_REF
)
16501 s
= TREE_OPERAND (dtor
, 0);
16502 dtor
= TREE_OPERAND (dtor
, 1);
16504 if (TREE_CODE (dtor
) == BIT_NOT_EXPR
)
16506 dtor
= TREE_OPERAND (dtor
, 0);
16508 RETURN (finish_pseudo_destructor_expr
16509 (object
, s
, dtor
, input_location
));
16513 else if (TREE_CODE (member
) == SCOPE_REF
16514 && TREE_CODE (TREE_OPERAND (member
, 1)) == TEMPLATE_ID_EXPR
)
16516 /* Lookup the template functions now that we know what the
16518 tree scope
= TREE_OPERAND (member
, 0);
16519 tree tmpl
= TREE_OPERAND (TREE_OPERAND (member
, 1), 0);
16520 tree args
= TREE_OPERAND (TREE_OPERAND (member
, 1), 1);
16521 member
= lookup_qualified_name (scope
, tmpl
,
16522 /*is_type_p=*/false,
16523 /*complain=*/false);
16524 if (BASELINK_P (member
))
16526 BASELINK_FUNCTIONS (member
)
16527 = build_nt (TEMPLATE_ID_EXPR
, BASELINK_FUNCTIONS (member
),
16529 member
= (adjust_result_of_qualified_name_lookup
16530 (member
, BINFO_TYPE (BASELINK_BINFO (member
)),
16535 qualified_name_lookup_error (scope
, tmpl
, member
,
16537 RETURN (error_mark_node
);
16540 else if (TREE_CODE (member
) == SCOPE_REF
16541 && !CLASS_TYPE_P (TREE_OPERAND (member
, 0))
16542 && TREE_CODE (TREE_OPERAND (member
, 0)) != NAMESPACE_DECL
)
16544 if (complain
& tf_error
)
16546 if (TYPE_P (TREE_OPERAND (member
, 0)))
16547 error ("%qT is not a class or namespace",
16548 TREE_OPERAND (member
, 0));
16550 error ("%qD is not a class or namespace",
16551 TREE_OPERAND (member
, 0));
16553 RETURN (error_mark_node
);
16555 else if (TREE_CODE (member
) == FIELD_DECL
)
16557 r
= finish_non_static_data_member (member
, object
, NULL_TREE
);
16558 if (TREE_CODE (r
) == COMPONENT_REF
)
16559 REF_PARENTHESIZED_P (r
) = REF_PARENTHESIZED_P (t
);
16563 r
= finish_class_member_access_expr (object
, member
,
16564 /*template_p=*/false,
16566 if (TREE_CODE (r
) == COMPONENT_REF
)
16567 REF_PARENTHESIZED_P (r
) = REF_PARENTHESIZED_P (t
);
16572 RETURN (build_throw
16573 (RECUR (TREE_OPERAND (t
, 0))));
16577 vec
<constructor_elt
, va_gc
> *n
;
16578 constructor_elt
*ce
;
16579 unsigned HOST_WIDE_INT idx
;
16580 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
16581 bool process_index_p
;
16583 bool need_copy_p
= false;
16586 if (type
== error_mark_node
)
16587 RETURN (error_mark_node
);
16589 /* digest_init will do the wrong thing if we let it. */
16590 if (type
&& TYPE_PTRMEMFUNC_P (type
))
16593 /* We do not want to process the index of aggregate
16594 initializers as they are identifier nodes which will be
16595 looked up by digest_init. */
16596 process_index_p
= !(type
&& MAYBE_CLASS_TYPE_P (type
));
16598 n
= vec_safe_copy (CONSTRUCTOR_ELTS (t
));
16599 newlen
= vec_safe_length (n
);
16600 FOR_EACH_VEC_SAFE_ELT (n
, idx
, ce
)
16602 if (ce
->index
&& process_index_p
16603 /* An identifier index is looked up in the type
16604 being initialized, not the current scope. */
16605 && TREE_CODE (ce
->index
) != IDENTIFIER_NODE
)
16606 ce
->index
= RECUR (ce
->index
);
16608 if (PACK_EXPANSION_P (ce
->value
))
16610 /* Substitute into the pack expansion. */
16611 ce
->value
= tsubst_pack_expansion (ce
->value
, args
, complain
,
16614 if (ce
->value
== error_mark_node
16615 || PACK_EXPANSION_P (ce
->value
))
16617 else if (TREE_VEC_LENGTH (ce
->value
) == 1)
16618 /* Just move the argument into place. */
16619 ce
->value
= TREE_VEC_ELT (ce
->value
, 0);
16622 /* Update the length of the final CONSTRUCTOR
16623 arguments vector, and note that we will need to
16625 newlen
= newlen
+ TREE_VEC_LENGTH (ce
->value
) - 1;
16626 need_copy_p
= true;
16630 ce
->value
= RECUR (ce
->value
);
16635 vec
<constructor_elt
, va_gc
> *old_n
= n
;
16637 vec_alloc (n
, newlen
);
16638 FOR_EACH_VEC_ELT (*old_n
, idx
, ce
)
16640 if (TREE_CODE (ce
->value
) == TREE_VEC
)
16642 int i
, len
= TREE_VEC_LENGTH (ce
->value
);
16643 for (i
= 0; i
< len
; ++i
)
16644 CONSTRUCTOR_APPEND_ELT (n
, 0,
16645 TREE_VEC_ELT (ce
->value
, i
));
16648 CONSTRUCTOR_APPEND_ELT (n
, 0, ce
->value
);
16652 r
= build_constructor (init_list_type_node
, n
);
16653 CONSTRUCTOR_IS_DIRECT_INIT (r
) = CONSTRUCTOR_IS_DIRECT_INIT (t
);
16655 if (TREE_HAS_CONSTRUCTOR (t
))
16656 RETURN (finish_compound_literal (type
, r
, complain
));
16658 TREE_TYPE (r
) = type
;
16664 tree operand_0
= TREE_OPERAND (t
, 0);
16665 if (TYPE_P (operand_0
))
16667 operand_0
= tsubst (operand_0
, args
, complain
, in_decl
);
16668 RETURN (get_typeid (operand_0
, complain
));
16672 operand_0
= RECUR (operand_0
);
16673 RETURN (build_typeid (operand_0
, complain
));
16680 else if (DECL_PACK_P (t
))
16682 /* We don't build decls for an instantiation of a
16683 variadic capture proxy, we instantiate the elements
16685 gcc_assert (DECL_HAS_VALUE_EXPR_P (t
));
16686 return RECUR (DECL_VALUE_EXPR (t
));
16692 tree r
= tsubst_copy (t
, args
, complain
, in_decl
);
16693 /* ??? We're doing a subset of finish_id_expression here. */
16695 && !processing_template_decl
16696 && !cp_unevaluated_operand
16697 && (TREE_STATIC (r
) || DECL_EXTERNAL (r
))
16698 && CP_DECL_THREAD_LOCAL_P (r
))
16700 if (tree wrap
= get_tls_wrapper_fn (r
))
16701 /* Replace an evaluated use of the thread_local variable with
16702 a call to its wrapper. */
16703 r
= build_cxx_call (wrap
, 0, NULL
, tf_warning_or_error
);
16705 else if (outer_automatic_var_p (r
))
16707 r
= process_outer_var_ref (r
, complain
);
16708 if (is_capture_proxy (r
))
16709 register_local_specialization (r
, t
);
16712 if (TREE_CODE (TREE_TYPE (t
)) != REFERENCE_TYPE
)
16713 /* If the original type was a reference, we'll be wrapped in
16714 the appropriate INDIRECT_REF. */
16715 r
= convert_from_reference (r
);
16721 tree op0
= RECUR (TREE_OPERAND (t
, 0));
16722 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
16723 RETURN (build_x_va_arg (EXPR_LOCATION (t
), op0
, type
));
16726 case OFFSETOF_EXPR
:
16727 RETURN (finish_offsetof (RECUR (TREE_OPERAND (t
, 0)),
16728 EXPR_LOCATION (t
)));
16732 tree type1
= tsubst (TRAIT_EXPR_TYPE1 (t
), args
,
16733 complain
, in_decl
);
16735 tree type2
= TRAIT_EXPR_TYPE2 (t
);
16736 if (type2
&& TREE_CODE (type2
) == TREE_LIST
)
16737 type2
= RECUR (type2
);
16739 type2
= tsubst (type2
, args
, complain
, in_decl
);
16741 RETURN (finish_trait_expr (TRAIT_EXPR_KIND (t
), type1
, type2
));
16746 tree old_stmt_expr
= cur_stmt_expr
;
16747 tree stmt_expr
= begin_stmt_expr ();
16749 cur_stmt_expr
= stmt_expr
;
16750 tsubst_expr (STMT_EXPR_STMT (t
), args
, complain
, in_decl
,
16751 integral_constant_expression_p
);
16752 stmt_expr
= finish_stmt_expr (stmt_expr
, false);
16753 cur_stmt_expr
= old_stmt_expr
;
16755 /* If the resulting list of expression statement is empty,
16756 fold it further into void_node. */
16757 if (empty_expr_stmt_p (stmt_expr
))
16758 stmt_expr
= void_node
;
16760 RETURN (stmt_expr
);
16765 tree r
= build_lambda_expr ();
16767 tree type
= tsubst (LAMBDA_EXPR_CLOSURE (t
), args
, complain
, NULL_TREE
);
16768 LAMBDA_EXPR_CLOSURE (r
) = type
;
16769 CLASSTYPE_LAMBDA_EXPR (type
) = r
;
16771 LAMBDA_EXPR_LOCATION (r
)
16772 = LAMBDA_EXPR_LOCATION (t
);
16773 LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (r
)
16774 = LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (t
);
16775 LAMBDA_EXPR_MUTABLE_P (r
) = LAMBDA_EXPR_MUTABLE_P (t
);
16776 LAMBDA_EXPR_DISCRIMINATOR (r
)
16777 = (LAMBDA_EXPR_DISCRIMINATOR (t
));
16778 tree scope
= LAMBDA_EXPR_EXTRA_SCOPE (t
);
16780 /* No substitution needed. */;
16781 else if (VAR_OR_FUNCTION_DECL_P (scope
))
16782 /* For a function or variable scope, we want to use tsubst so that we
16783 don't complain about referring to an auto before deduction. */
16784 scope
= tsubst (scope
, args
, complain
, in_decl
);
16785 else if (TREE_CODE (scope
) == PARM_DECL
)
16787 /* Look up the parameter we want directly, as tsubst_copy
16788 doesn't do what we need. */
16789 tree fn
= tsubst (DECL_CONTEXT (scope
), args
, complain
, in_decl
);
16790 tree parm
= FUNCTION_FIRST_USER_PARM (fn
);
16791 while (DECL_PARM_INDEX (parm
) != DECL_PARM_INDEX (scope
))
16792 parm
= DECL_CHAIN (parm
);
16794 /* FIXME Work around the parm not having DECL_CONTEXT set. */
16795 if (DECL_CONTEXT (scope
) == NULL_TREE
)
16796 DECL_CONTEXT (scope
) = fn
;
16798 else if (TREE_CODE (scope
) == FIELD_DECL
)
16799 /* For a field, use tsubst_copy so that we look up the existing field
16800 rather than build a new one. */
16801 scope
= RECUR (scope
);
16803 gcc_unreachable ();
16804 LAMBDA_EXPR_EXTRA_SCOPE (r
) = scope
;
16805 LAMBDA_EXPR_RETURN_TYPE (r
)
16806 = tsubst (LAMBDA_EXPR_RETURN_TYPE (t
), args
, complain
, in_decl
);
16808 gcc_assert (LAMBDA_EXPR_THIS_CAPTURE (t
) == NULL_TREE
16809 && LAMBDA_EXPR_PENDING_PROXIES (t
) == NULL
);
16811 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
16812 determine_visibility (TYPE_NAME (type
));
16813 /* Now that we know visibility, instantiate the type so we have a
16814 declaration of the op() for later calls to lambda_function. */
16815 complete_type (type
);
16817 LAMBDA_EXPR_THIS_CAPTURE (r
) = NULL_TREE
;
16819 insert_pending_capture_proxies ();
16821 RETURN (build_lambda_object (r
));
16825 /* We can get here for a constant initializer of non-dependent type.
16826 FIXME stop folding in cp_parser_initializer_clause. */
16828 tree r
= get_target_expr_sfinae (RECUR (TARGET_EXPR_INITIAL (t
)),
16833 case TRANSACTION_EXPR
:
16834 RETURN (tsubst_expr(t
, args
, complain
, in_decl
,
16835 integral_constant_expression_p
));
16838 RETURN (finish_parenthesized_expr (RECUR (TREE_OPERAND (t
, 0))));
16840 case VEC_PERM_EXPR
:
16842 tree op0
= RECUR (TREE_OPERAND (t
, 0));
16843 tree op1
= RECUR (TREE_OPERAND (t
, 1));
16844 tree op2
= RECUR (TREE_OPERAND (t
, 2));
16845 RETURN (build_x_vec_perm_expr (input_location
, op0
, op1
, op2
,
16849 case REQUIRES_EXPR
:
16850 RETURN (tsubst_requires_expr (t
, args
, complain
, in_decl
));
16853 /* Handle Objective-C++ constructs, if appropriate. */
16856 = objcp_tsubst_copy_and_build (t
, args
, complain
,
16857 in_decl
, /*function_p=*/false);
16861 RETURN (tsubst_copy (t
, args
, complain
, in_decl
));
16867 input_location
= loc
;
16871 /* Verify that the instantiated ARGS are valid. For type arguments,
16872 make sure that the type's linkage is ok. For non-type arguments,
16873 make sure they are constants if they are integral or enumerations.
16874 Emit an error under control of COMPLAIN, and return TRUE on error. */
16877 check_instantiated_arg (tree tmpl
, tree t
, tsubst_flags_t complain
)
16879 if (dependent_template_arg_p (t
))
16881 if (ARGUMENT_PACK_P (t
))
16883 tree vec
= ARGUMENT_PACK_ARGS (t
);
16884 int len
= TREE_VEC_LENGTH (vec
);
16885 bool result
= false;
16888 for (i
= 0; i
< len
; ++i
)
16889 if (check_instantiated_arg (tmpl
, TREE_VEC_ELT (vec
, i
), complain
))
16893 else if (TYPE_P (t
))
16895 /* [basic.link]: A name with no linkage (notably, the name
16896 of a class or enumeration declared in a local scope)
16897 shall not be used to declare an entity with linkage.
16898 This implies that names with no linkage cannot be used as
16901 DR 757 relaxes this restriction for C++0x. */
16902 tree nt
= (cxx_dialect
> cxx98
? NULL_TREE
16903 : no_linkage_check (t
, /*relaxed_p=*/false));
16907 /* DR 488 makes use of a type with no linkage cause
16908 type deduction to fail. */
16909 if (complain
& tf_error
)
16911 if (TYPE_ANONYMOUS_P (nt
))
16912 error ("%qT is/uses anonymous type", t
);
16914 error ("template argument for %qD uses local type %qT",
16919 /* In order to avoid all sorts of complications, we do not
16920 allow variably-modified types as template arguments. */
16921 else if (variably_modified_type_p (t
, NULL_TREE
))
16923 if (complain
& tf_error
)
16924 error ("%qT is a variably modified type", t
);
16928 /* Class template and alias template arguments should be OK. */
16929 else if (DECL_TYPE_TEMPLATE_P (t
))
16931 /* A non-type argument of integral or enumerated type must be a
16933 else if (TREE_TYPE (t
)
16934 && INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (t
))
16935 && !REFERENCE_REF_P (t
)
16936 && !TREE_CONSTANT (t
))
16938 if (complain
& tf_error
)
16939 error ("integral expression %qE is not constant", t
);
16946 check_instantiated_args (tree tmpl
, tree args
, tsubst_flags_t complain
)
16948 int ix
, len
= DECL_NTPARMS (tmpl
);
16949 bool result
= false;
16951 for (ix
= 0; ix
!= len
; ix
++)
16953 if (check_instantiated_arg (tmpl
, TREE_VEC_ELT (args
, ix
), complain
))
16956 if (result
&& (complain
& tf_error
))
16957 error (" trying to instantiate %qD", tmpl
);
16961 /* We're out of SFINAE context now, so generate diagnostics for the access
16962 errors we saw earlier when instantiating D from TMPL and ARGS. */
16965 recheck_decl_substitution (tree d
, tree tmpl
, tree args
)
16967 tree pattern
= DECL_TEMPLATE_RESULT (tmpl
);
16968 tree type
= TREE_TYPE (pattern
);
16969 location_t loc
= input_location
;
16971 push_access_scope (d
);
16972 push_deferring_access_checks (dk_no_deferred
);
16973 input_location
= DECL_SOURCE_LOCATION (pattern
);
16974 tsubst (type
, args
, tf_warning_or_error
, d
);
16975 input_location
= loc
;
16976 pop_deferring_access_checks ();
16977 pop_access_scope (d
);
16980 /* Instantiate the indicated variable, function, or alias template TMPL with
16981 the template arguments in TARG_PTR. */
16984 instantiate_template_1 (tree tmpl
, tree orig_args
, tsubst_flags_t complain
)
16986 tree targ_ptr
= orig_args
;
16990 bool access_ok
= true;
16992 if (tmpl
== error_mark_node
)
16993 return error_mark_node
;
16995 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
);
16997 /* If this function is a clone, handle it specially. */
16998 if (DECL_CLONED_FUNCTION_P (tmpl
))
17003 /* Use DECL_ABSTRACT_ORIGIN because only FUNCTION_DECLs have
17004 DECL_CLONED_FUNCTION. */
17005 spec
= instantiate_template (DECL_ABSTRACT_ORIGIN (tmpl
),
17006 targ_ptr
, complain
);
17007 if (spec
== error_mark_node
)
17008 return error_mark_node
;
17010 /* Look for the clone. */
17011 FOR_EACH_CLONE (clone
, spec
)
17012 if (DECL_NAME (clone
) == DECL_NAME (tmpl
))
17014 /* We should always have found the clone by now. */
17015 gcc_unreachable ();
17019 if (targ_ptr
== error_mark_node
)
17020 return error_mark_node
;
17022 /* Check to see if we already have this specialization. */
17023 gen_tmpl
= most_general_template (tmpl
);
17024 if (tmpl
!= gen_tmpl
)
17025 /* The TMPL is a partial instantiation. To get a full set of
17026 arguments we must add the arguments used to perform the
17027 partial instantiation. */
17028 targ_ptr
= add_outermost_template_args (DECL_TI_ARGS (tmpl
),
17031 /* It would be nice to avoid hashing here and then again in tsubst_decl,
17032 but it doesn't seem to be on the hot path. */
17033 spec
= retrieve_specialization (gen_tmpl
, targ_ptr
, 0);
17035 gcc_assert (tmpl
== gen_tmpl
17036 || ((fndecl
= retrieve_specialization (tmpl
, orig_args
, 0))
17038 || fndecl
== NULL_TREE
);
17040 if (spec
!= NULL_TREE
)
17042 if (FNDECL_HAS_ACCESS_ERRORS (spec
))
17044 if (complain
& tf_error
)
17045 recheck_decl_substitution (spec
, gen_tmpl
, targ_ptr
);
17046 return error_mark_node
;
17051 if (check_instantiated_args (gen_tmpl
, INNERMOST_TEMPLATE_ARGS (targ_ptr
),
17053 return error_mark_node
;
17055 /* We are building a FUNCTION_DECL, during which the access of its
17056 parameters and return types have to be checked. However this
17057 FUNCTION_DECL which is the desired context for access checking
17058 is not built yet. We solve this chicken-and-egg problem by
17059 deferring all checks until we have the FUNCTION_DECL. */
17060 push_deferring_access_checks (dk_deferred
);
17062 /* Instantiation of the function happens in the context of the function
17063 template, not the context of the overload resolution we're doing. */
17064 push_to_top_level ();
17065 /* If there are dependent arguments, e.g. because we're doing partial
17066 ordering, make sure processing_template_decl stays set. */
17067 if (uses_template_parms (targ_ptr
))
17068 ++processing_template_decl
;
17069 if (DECL_CLASS_SCOPE_P (gen_tmpl
))
17071 tree ctx
= tsubst_aggr_type (DECL_CONTEXT (gen_tmpl
), targ_ptr
,
17072 complain
, gen_tmpl
, true);
17073 push_nested_class (ctx
);
17076 tree pattern
= DECL_TEMPLATE_RESULT (gen_tmpl
);
17078 if (VAR_P (pattern
))
17080 /* We need to determine if we're using a partial or explicit
17081 specialization now, because the type of the variable could be
17083 tree tid
= lookup_template_variable (gen_tmpl
, targ_ptr
);
17084 tree elt
= most_specialized_partial_spec (tid
, complain
);
17085 if (elt
== error_mark_node
)
17086 pattern
= error_mark_node
;
17089 tmpl
= TREE_VALUE (elt
);
17090 pattern
= DECL_TEMPLATE_RESULT (tmpl
);
17091 targ_ptr
= TREE_PURPOSE (elt
);
17095 /* Substitute template parameters to obtain the specialization. */
17096 fndecl
= tsubst (pattern
, targ_ptr
, complain
, gen_tmpl
);
17097 if (DECL_CLASS_SCOPE_P (gen_tmpl
))
17098 pop_nested_class ();
17099 pop_from_top_level ();
17101 if (fndecl
== error_mark_node
)
17103 pop_deferring_access_checks ();
17104 return error_mark_node
;
17107 /* The DECL_TI_TEMPLATE should always be the immediate parent
17108 template, not the most general template. */
17109 DECL_TI_TEMPLATE (fndecl
) = tmpl
;
17110 DECL_TI_ARGS (fndecl
) = targ_ptr
;
17112 /* Now we know the specialization, compute access previously
17114 push_access_scope (fndecl
);
17115 if (!perform_deferred_access_checks (complain
))
17117 pop_access_scope (fndecl
);
17118 pop_deferring_access_checks ();
17120 /* If we've just instantiated the main entry point for a function,
17121 instantiate all the alternate entry points as well. We do this
17122 by cloning the instantiation of the main entry point, not by
17123 instantiating the template clones. */
17124 if (DECL_CHAIN (gen_tmpl
) && DECL_CLONED_FUNCTION_P (DECL_CHAIN (gen_tmpl
)))
17125 clone_function_decl (fndecl
, /*update_method_vec_p=*/0);
17129 if (!(complain
& tf_error
))
17131 /* Remember to reinstantiate when we're out of SFINAE so the user
17132 can see the errors. */
17133 FNDECL_HAS_ACCESS_ERRORS (fndecl
) = true;
17135 return error_mark_node
;
17140 /* Wrapper for instantiate_template_1. */
17143 instantiate_template (tree tmpl
, tree orig_args
, tsubst_flags_t complain
)
17146 timevar_push (TV_TEMPLATE_INST
);
17147 ret
= instantiate_template_1 (tmpl
, orig_args
, complain
);
17148 timevar_pop (TV_TEMPLATE_INST
);
17152 /* Instantiate the alias template TMPL with ARGS. Also push a template
17153 instantiation level, which instantiate_template doesn't do because
17154 functions and variables have sufficient context established by the
17158 instantiate_alias_template (tree tmpl
, tree args
, tsubst_flags_t complain
)
17160 struct pending_template
*old_last_pend
= last_pending_template
;
17161 struct tinst_level
*old_error_tinst
= last_error_tinst_level
;
17162 if (tmpl
== error_mark_node
|| args
== error_mark_node
)
17163 return error_mark_node
;
17164 tree tinst
= build_tree_list (tmpl
, args
);
17165 if (!push_tinst_level (tinst
))
17168 return error_mark_node
;
17172 coerce_innermost_template_parms (DECL_TEMPLATE_PARMS (tmpl
),
17173 args
, tmpl
, complain
,
17174 /*require_all_args=*/true,
17175 /*use_default_args=*/true);
17177 tree r
= instantiate_template (tmpl
, args
, complain
);
17178 pop_tinst_level ();
17179 /* We can't free this if a pending_template entry or last_error_tinst_level
17180 is pointing at it. */
17181 if (last_pending_template
== old_last_pend
17182 && last_error_tinst_level
== old_error_tinst
)
17188 /* PARM is a template parameter pack for FN. Returns true iff
17189 PARM is used in a deducible way in the argument list of FN. */
17192 pack_deducible_p (tree parm
, tree fn
)
17194 tree t
= FUNCTION_FIRST_USER_PARMTYPE (fn
);
17195 for (; t
; t
= TREE_CHAIN (t
))
17197 tree type
= TREE_VALUE (t
);
17199 if (!PACK_EXPANSION_P (type
))
17201 for (packs
= PACK_EXPANSION_PARAMETER_PACKS (type
);
17202 packs
; packs
= TREE_CHAIN (packs
))
17203 if (template_args_equal (TREE_VALUE (packs
), parm
))
17205 /* The template parameter pack is used in a function parameter
17206 pack. If this is the end of the parameter list, the
17207 template parameter pack is deducible. */
17208 if (TREE_CHAIN (t
) == void_list_node
)
17211 /* Otherwise, not. Well, it could be deduced from
17212 a non-pack parameter, but doing so would end up with
17213 a deduction mismatch, so don't bother. */
17217 /* The template parameter pack isn't used in any function parameter
17218 packs, but it might be used deeper, e.g. tuple<Args...>. */
17222 /* The FN is a TEMPLATE_DECL for a function. ARGS is an array with
17223 NARGS elements of the arguments that are being used when calling
17224 it. TARGS is a vector into which the deduced template arguments
17227 Returns either a FUNCTION_DECL for the matching specialization of FN or
17228 NULL_TREE if no suitable specialization can be found. If EXPLAIN_P is
17229 true, diagnostics will be printed to explain why it failed.
17231 If FN is a conversion operator, or we are trying to produce a specific
17232 specialization, RETURN_TYPE is the return type desired.
17234 The EXPLICIT_TARGS are explicit template arguments provided via a
17237 The parameter STRICT is one of:
17240 We are deducing arguments for a function call, as in
17241 [temp.deduct.call]. If RETURN_TYPE is non-null, we are
17242 deducing arguments for a call to the result of a conversion
17243 function template, as in [over.call.object].
17246 We are deducing arguments for a conversion function, as in
17247 [temp.deduct.conv].
17250 We are deducing arguments when doing an explicit instantiation
17251 as in [temp.explicit], when determining an explicit specialization
17252 as in [temp.expl.spec], or when taking the address of a function
17253 template, as in [temp.deduct.funcaddr]. */
17256 fn_type_unification (tree fn
,
17257 tree explicit_targs
,
17260 unsigned int nargs
,
17262 unification_kind_t strict
,
17269 tree decl
= NULL_TREE
;
17270 tsubst_flags_t complain
= (explain_p
? tf_warning_or_error
: tf_none
);
17272 static int deduction_depth
;
17273 struct pending_template
*old_last_pend
= last_pending_template
;
17274 struct tinst_level
*old_error_tinst
= last_error_tinst_level
;
17275 tree tparms
= DECL_INNERMOST_TEMPLATE_PARMS (fn
);
17277 tree r
= error_mark_node
;
17280 complain
|= tf_decltype
;
17282 /* In C++0x, it's possible to have a function template whose type depends
17283 on itself recursively. This is most obvious with decltype, but can also
17284 occur with enumeration scope (c++/48969). So we need to catch infinite
17285 recursion and reject the substitution at deduction time; this function
17286 will return error_mark_node for any repeated substitution.
17288 This also catches excessive recursion such as when f<N> depends on
17289 f<N-1> across all integers, and returns error_mark_node for all the
17290 substitutions back up to the initial one.
17292 This is, of course, not reentrant. */
17293 if (excessive_deduction_depth
)
17294 return error_mark_node
;
17295 tinst
= build_tree_list (fn
, NULL_TREE
);
17298 gcc_assert (TREE_CODE (fn
) == TEMPLATE_DECL
);
17300 fntype
= TREE_TYPE (fn
);
17301 if (explicit_targs
)
17305 The specified template arguments must match the template
17306 parameters in kind (i.e., type, nontype, template), and there
17307 must not be more arguments than there are parameters;
17308 otherwise type deduction fails.
17310 Nontype arguments must match the types of the corresponding
17311 nontype template parameters, or must be convertible to the
17312 types of the corresponding nontype parameters as specified in
17313 _temp.arg.nontype_, otherwise type deduction fails.
17315 All references in the function type of the function template
17316 to the corresponding template parameters are replaced by the
17317 specified template argument values. If a substitution in a
17318 template parameter or in the function type of the function
17319 template results in an invalid type, type deduction fails. */
17320 int i
, len
= TREE_VEC_LENGTH (tparms
);
17321 location_t loc
= input_location
;
17322 bool incomplete
= false;
17324 /* Adjust any explicit template arguments before entering the
17325 substitution context. */
17327 = (coerce_template_parms (tparms
, explicit_targs
, NULL_TREE
,
17329 /*require_all_args=*/false,
17330 /*use_default_args=*/false));
17331 if (explicit_targs
== error_mark_node
)
17334 /* Substitute the explicit args into the function type. This is
17335 necessary so that, for instance, explicitly declared function
17336 arguments can match null pointed constants. If we were given
17337 an incomplete set of explicit args, we must not do semantic
17338 processing during substitution as we could create partial
17340 for (i
= 0; i
< len
; i
++)
17342 tree parm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
17343 bool parameter_pack
= false;
17344 tree targ
= TREE_VEC_ELT (explicit_targs
, i
);
17346 /* Dig out the actual parm. */
17347 if (TREE_CODE (parm
) == TYPE_DECL
17348 || TREE_CODE (parm
) == TEMPLATE_DECL
)
17350 parm
= TREE_TYPE (parm
);
17351 parameter_pack
= TEMPLATE_TYPE_PARAMETER_PACK (parm
);
17353 else if (TREE_CODE (parm
) == PARM_DECL
)
17355 parm
= DECL_INITIAL (parm
);
17356 parameter_pack
= TEMPLATE_PARM_PARAMETER_PACK (parm
);
17359 if (!parameter_pack
&& targ
== NULL_TREE
)
17360 /* No explicit argument for this template parameter. */
17363 if (parameter_pack
&& pack_deducible_p (parm
, fn
))
17365 /* Mark the argument pack as "incomplete". We could
17366 still deduce more arguments during unification.
17367 We remove this mark in type_unification_real. */
17370 ARGUMENT_PACK_INCOMPLETE_P(targ
) = 1;
17371 ARGUMENT_PACK_EXPLICIT_ARGS (targ
)
17372 = ARGUMENT_PACK_ARGS (targ
);
17375 /* We have some incomplete argument packs. */
17380 TREE_VALUE (tinst
) = explicit_targs
;
17381 if (!push_tinst_level (tinst
))
17383 excessive_deduction_depth
= true;
17386 processing_template_decl
+= incomplete
;
17387 input_location
= DECL_SOURCE_LOCATION (fn
);
17388 /* Ignore any access checks; we'll see them again in
17389 instantiate_template and they might have the wrong
17390 access path at this point. */
17391 push_deferring_access_checks (dk_deferred
);
17392 fntype
= tsubst (TREE_TYPE (fn
), explicit_targs
,
17393 complain
| tf_partial
, NULL_TREE
);
17394 pop_deferring_access_checks ();
17395 input_location
= loc
;
17396 processing_template_decl
-= incomplete
;
17397 pop_tinst_level ();
17399 if (fntype
== error_mark_node
)
17402 /* Place the explicitly specified arguments in TARGS. */
17403 for (i
= NUM_TMPL_ARGS (explicit_targs
); i
--;)
17404 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (explicit_targs
, i
);
17407 /* Never do unification on the 'this' parameter. */
17408 parms
= skip_artificial_parms_for (fn
, TYPE_ARG_TYPES (fntype
));
17410 if (return_type
&& strict
== DEDUCE_CALL
)
17412 /* We're deducing for a call to the result of a template conversion
17413 function. The parms we really want are in return_type. */
17414 if (POINTER_TYPE_P (return_type
))
17415 return_type
= TREE_TYPE (return_type
);
17416 parms
= TYPE_ARG_TYPES (return_type
);
17418 else if (return_type
)
17422 parms
= tree_cons (NULL_TREE
, TREE_TYPE (fntype
), parms
);
17423 new_args
= XALLOCAVEC (tree
, nargs
+ 1);
17424 new_args
[0] = return_type
;
17425 memcpy (new_args
+ 1, args
, nargs
* sizeof (tree
));
17430 /* We allow incomplete unification without an error message here
17431 because the standard doesn't seem to explicitly prohibit it. Our
17432 callers must be ready to deal with unification failures in any
17435 TREE_VALUE (tinst
) = targs
;
17436 /* If we aren't explaining yet, push tinst context so we can see where
17437 any errors (e.g. from class instantiations triggered by instantiation
17438 of default template arguments) come from. If we are explaining, this
17439 context is redundant. */
17440 if (!explain_p
&& !push_tinst_level (tinst
))
17442 excessive_deduction_depth
= true;
17446 /* type_unification_real will pass back any access checks from default
17447 template argument substitution. */
17448 vec
<deferred_access_check
, va_gc
> *checks
;
17451 ok
= !type_unification_real (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
17452 targs
, parms
, args
, nargs
, /*subr=*/0,
17453 strict
, flags
, &checks
, explain_p
);
17455 pop_tinst_level ();
17459 /* Now that we have bindings for all of the template arguments,
17460 ensure that the arguments deduced for the template template
17461 parameters have compatible template parameter lists. We cannot
17462 check this property before we have deduced all template
17463 arguments, because the template parameter types of a template
17464 template parameter might depend on prior template parameters
17465 deduced after the template template parameter. The following
17466 ill-formed example illustrates this issue:
17468 template<typename T, template<T> class C> void f(C<5>, T);
17470 template<int N> struct X {};
17473 f(X<5>(), 5l); // error: template argument deduction fails
17476 The template parameter list of 'C' depends on the template type
17477 parameter 'T', but 'C' is deduced to 'X' before 'T' is deduced to
17478 'long'. Thus, we can't check that 'C' cannot bind to 'X' at the
17479 time that we deduce 'C'. */
17480 if (!template_template_parm_bindings_ok_p
17481 (DECL_INNERMOST_TEMPLATE_PARMS (fn
), targs
))
17483 unify_inconsistent_template_template_parameters (explain_p
);
17487 /* All is well so far. Now, check:
17491 When all template arguments have been deduced, all uses of
17492 template parameters in nondeduced contexts are replaced with
17493 the corresponding deduced argument values. If the
17494 substitution results in an invalid type, as described above,
17495 type deduction fails. */
17496 TREE_VALUE (tinst
) = targs
;
17497 if (!push_tinst_level (tinst
))
17499 excessive_deduction_depth
= true;
17503 /* Also collect access checks from the instantiation. */
17504 reopen_deferring_access_checks (checks
);
17506 decl
= instantiate_template (fn
, targs
, complain
);
17508 checks
= get_deferred_access_checks ();
17509 pop_deferring_access_checks ();
17511 pop_tinst_level ();
17513 if (decl
== error_mark_node
)
17516 /* Now perform any access checks encountered during substitution. */
17517 push_access_scope (decl
);
17518 ok
= perform_access_checks (checks
, complain
);
17519 pop_access_scope (decl
);
17523 /* If we're looking for an exact match, check that what we got
17524 is indeed an exact match. It might not be if some template
17525 parameters are used in non-deduced contexts. But don't check
17526 for an exact match if we have dependent template arguments;
17527 in that case we're doing partial ordering, and we already know
17528 that we have two candidates that will provide the actual type. */
17529 if (strict
== DEDUCE_EXACT
&& !any_dependent_template_arguments_p (targs
))
17531 tree substed
= TREE_TYPE (decl
);
17535 = skip_artificial_parms_for (decl
, TYPE_ARG_TYPES (substed
));
17537 sarg
= tree_cons (NULL_TREE
, TREE_TYPE (substed
), sarg
);
17538 for (i
= 0; i
< nargs
&& sarg
; ++i
, sarg
= TREE_CHAIN (sarg
))
17539 if (!same_type_p (args
[i
], TREE_VALUE (sarg
)))
17541 unify_type_mismatch (explain_p
, args
[i
],
17542 TREE_VALUE (sarg
));
17551 if (excessive_deduction_depth
)
17553 if (deduction_depth
== 0)
17554 /* Reset once we're all the way out. */
17555 excessive_deduction_depth
= false;
17558 /* We can't free this if a pending_template entry or last_error_tinst_level
17559 is pointing at it. */
17560 if (last_pending_template
== old_last_pend
17561 && last_error_tinst_level
== old_error_tinst
)
17567 /* Adjust types before performing type deduction, as described in
17568 [temp.deduct.call] and [temp.deduct.conv]. The rules in these two
17569 sections are symmetric. PARM is the type of a function parameter
17570 or the return type of the conversion function. ARG is the type of
17571 the argument passed to the call, or the type of the value
17572 initialized with the result of the conversion function.
17573 ARG_EXPR is the original argument expression, which may be null. */
17576 maybe_adjust_types_for_deduction (unification_kind_t strict
,
17589 /* Swap PARM and ARG throughout the remainder of this
17590 function; the handling is precisely symmetric since PARM
17591 will initialize ARG rather than vice versa. */
17592 std::swap (parm
, arg
);
17596 /* Core issue #873: Do the DR606 thing (see below) for these cases,
17597 too, but here handle it by stripping the reference from PARM
17598 rather than by adding it to ARG. */
17599 if (TREE_CODE (*parm
) == REFERENCE_TYPE
17600 && TYPE_REF_IS_RVALUE (*parm
)
17601 && TREE_CODE (TREE_TYPE (*parm
)) == TEMPLATE_TYPE_PARM
17602 && cp_type_quals (TREE_TYPE (*parm
)) == TYPE_UNQUALIFIED
17603 && TREE_CODE (*arg
) == REFERENCE_TYPE
17604 && !TYPE_REF_IS_RVALUE (*arg
))
17605 *parm
= TREE_TYPE (*parm
);
17606 /* Nothing else to do in this case. */
17610 gcc_unreachable ();
17613 if (TREE_CODE (*parm
) != REFERENCE_TYPE
)
17615 /* [temp.deduct.call]
17617 If P is not a reference type:
17619 --If A is an array type, the pointer type produced by the
17620 array-to-pointer standard conversion (_conv.array_) is
17621 used in place of A for type deduction; otherwise,
17623 --If A is a function type, the pointer type produced by
17624 the function-to-pointer standard conversion
17625 (_conv.func_) is used in place of A for type deduction;
17628 --If A is a cv-qualified type, the top level
17629 cv-qualifiers of A's type are ignored for type
17631 if (TREE_CODE (*arg
) == ARRAY_TYPE
)
17632 *arg
= build_pointer_type (TREE_TYPE (*arg
));
17633 else if (TREE_CODE (*arg
) == FUNCTION_TYPE
)
17634 *arg
= build_pointer_type (*arg
);
17636 *arg
= TYPE_MAIN_VARIANT (*arg
);
17639 /* From C++0x [14.8.2.1/3 temp.deduct.call] (after DR606), "If P is
17640 of the form T&&, where T is a template parameter, and the argument
17641 is an lvalue, T is deduced as A& */
17642 if (TREE_CODE (*parm
) == REFERENCE_TYPE
17643 && TYPE_REF_IS_RVALUE (*parm
)
17644 && TREE_CODE (TREE_TYPE (*parm
)) == TEMPLATE_TYPE_PARM
17645 && cp_type_quals (TREE_TYPE (*parm
)) == TYPE_UNQUALIFIED
17646 && (arg_expr
? real_lvalue_p (arg_expr
)
17647 /* try_one_overload doesn't provide an arg_expr, but
17648 functions are always lvalues. */
17649 : TREE_CODE (*arg
) == FUNCTION_TYPE
))
17650 *arg
= build_reference_type (*arg
);
17652 /* [temp.deduct.call]
17654 If P is a cv-qualified type, the top level cv-qualifiers
17655 of P's type are ignored for type deduction. If P is a
17656 reference type, the type referred to by P is used for
17658 *parm
= TYPE_MAIN_VARIANT (*parm
);
17659 if (TREE_CODE (*parm
) == REFERENCE_TYPE
)
17661 *parm
= TREE_TYPE (*parm
);
17662 result
|= UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
17665 /* DR 322. For conversion deduction, remove a reference type on parm
17666 too (which has been swapped into ARG). */
17667 if (strict
== DEDUCE_CONV
&& TREE_CODE (*arg
) == REFERENCE_TYPE
)
17668 *arg
= TREE_TYPE (*arg
);
17673 /* Subroutine of unify_one_argument. PARM is a function parameter of a
17674 template which does contain any deducible template parameters; check if
17675 ARG is a suitable match for it. STRICT, FLAGS and EXPLAIN_P are as in
17676 unify_one_argument. */
17679 check_non_deducible_conversion (tree parm
, tree arg
, int strict
,
17680 int flags
, bool explain_p
)
17685 type
= TREE_TYPE (arg
);
17689 if (same_type_p (parm
, type
))
17690 return unify_success (explain_p
);
17692 if (strict
== DEDUCE_CONV
)
17694 if (can_convert_arg (type
, parm
, NULL_TREE
, flags
,
17695 explain_p
? tf_warning_or_error
: tf_none
))
17696 return unify_success (explain_p
);
17698 else if (strict
!= DEDUCE_EXACT
)
17700 if (can_convert_arg (parm
, type
,
17701 TYPE_P (arg
) ? NULL_TREE
: arg
,
17702 flags
, explain_p
? tf_warning_or_error
: tf_none
))
17703 return unify_success (explain_p
);
17706 if (strict
== DEDUCE_EXACT
)
17707 return unify_type_mismatch (explain_p
, parm
, arg
);
17709 return unify_arg_conversion (explain_p
, parm
, type
, arg
);
17712 static bool uses_deducible_template_parms (tree type
);
17714 /* Returns true iff the expression EXPR is one from which a template
17715 argument can be deduced. In other words, if it's an undecorated
17716 use of a template non-type parameter. */
17719 deducible_expression (tree expr
)
17721 return (TREE_CODE (expr
) == TEMPLATE_PARM_INDEX
);
17724 /* Returns true iff the array domain DOMAIN uses a template parameter in a
17725 deducible way; that is, if it has a max value of <PARM> - 1. */
17728 deducible_array_bound (tree domain
)
17730 if (domain
== NULL_TREE
)
17733 tree max
= TYPE_MAX_VALUE (domain
);
17734 if (TREE_CODE (max
) != MINUS_EXPR
)
17737 return deducible_expression (TREE_OPERAND (max
, 0));
17740 /* Returns true iff the template arguments ARGS use a template parameter
17741 in a deducible way. */
17744 deducible_template_args (tree args
)
17746 for (int i
= 0; i
< TREE_VEC_LENGTH (args
); ++i
)
17749 tree elt
= TREE_VEC_ELT (args
, i
);
17750 if (ARGUMENT_PACK_P (elt
))
17751 deducible
= deducible_template_args (ARGUMENT_PACK_ARGS (elt
));
17754 if (PACK_EXPANSION_P (elt
))
17755 elt
= PACK_EXPANSION_PATTERN (elt
);
17756 if (TREE_CODE (elt
) == TEMPLATE_TEMPLATE_PARM
)
17758 else if (TYPE_P (elt
))
17759 deducible
= uses_deducible_template_parms (elt
);
17761 deducible
= deducible_expression (elt
);
17769 /* Returns true iff TYPE contains any deducible references to template
17770 parameters, as per 14.8.2.5. */
17773 uses_deducible_template_parms (tree type
)
17775 if (PACK_EXPANSION_P (type
))
17776 type
= PACK_EXPANSION_PATTERN (type
);
17783 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
17784 || TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
17790 if (POINTER_TYPE_P (type
))
17791 return uses_deducible_template_parms (TREE_TYPE (type
));
17793 /* T[integer-constant ]
17795 if (TREE_CODE (type
) == ARRAY_TYPE
)
17796 return (uses_deducible_template_parms (TREE_TYPE (type
))
17797 || deducible_array_bound (TYPE_DOMAIN (type
)));
17809 if (TYPE_PTRMEM_P (type
))
17810 return (uses_deducible_template_parms (TYPE_PTRMEM_CLASS_TYPE (type
))
17811 || (uses_deducible_template_parms
17812 (TYPE_PTRMEM_POINTED_TO_TYPE (type
))));
17814 /* template-name <T> (where template-name refers to a class template)
17815 template-name <i> (where template-name refers to a class template) */
17816 if (CLASS_TYPE_P (type
)
17817 && CLASSTYPE_TEMPLATE_INFO (type
)
17818 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (type
)))
17819 return deducible_template_args (INNERMOST_TEMPLATE_ARGS
17820 (CLASSTYPE_TI_ARGS (type
)));
17825 if (TREE_CODE (type
) == FUNCTION_TYPE
17826 || TREE_CODE (type
) == METHOD_TYPE
)
17828 if (uses_deducible_template_parms (TREE_TYPE (type
)))
17830 tree parm
= TYPE_ARG_TYPES (type
);
17831 if (TREE_CODE (type
) == METHOD_TYPE
)
17832 parm
= TREE_CHAIN (parm
);
17833 for (; parm
; parm
= TREE_CHAIN (parm
))
17834 if (uses_deducible_template_parms (TREE_VALUE (parm
)))
17841 /* Subroutine of type_unification_real and unify_pack_expansion to
17842 handle unification of a single P/A pair. Parameters are as
17843 for those functions. */
17846 unify_one_argument (tree tparms
, tree targs
, tree parm
, tree arg
,
17847 int subr
, unification_kind_t strict
,
17850 tree arg_expr
= NULL_TREE
;
17853 if (arg
== error_mark_node
|| parm
== error_mark_node
)
17854 return unify_invalid (explain_p
);
17855 if (arg
== unknown_type_node
)
17856 /* We can't deduce anything from this, but we might get all the
17857 template args from other function args. */
17858 return unify_success (explain_p
);
17860 /* Implicit conversions (Clause 4) will be performed on a function
17861 argument to convert it to the type of the corresponding function
17862 parameter if the parameter type contains no template-parameters that
17863 participate in template argument deduction. */
17864 if (strict
!= DEDUCE_EXACT
17865 && TYPE_P (parm
) && !uses_deducible_template_parms (parm
))
17866 /* For function parameters with no deducible template parameters,
17867 just return. We'll check non-dependent conversions later. */
17868 return unify_success (explain_p
);
17873 arg_strict
= (UNIFY_ALLOW_OUTER_LEVEL
17874 | UNIFY_ALLOW_MORE_CV_QUAL
17875 | UNIFY_ALLOW_DERIVED
);
17879 arg_strict
= UNIFY_ALLOW_LESS_CV_QUAL
;
17883 arg_strict
= UNIFY_ALLOW_NONE
;
17887 gcc_unreachable ();
17890 /* We only do these transformations if this is the top-level
17891 parameter_type_list in a call or declaration matching; in other
17892 situations (nested function declarators, template argument lists) we
17893 won't be comparing a type to an expression, and we don't do any type
17899 gcc_assert (TREE_TYPE (arg
) != NULL_TREE
);
17900 if (type_unknown_p (arg
))
17902 /* [temp.deduct.type] A template-argument can be
17903 deduced from a pointer to function or pointer
17904 to member function argument if the set of
17905 overloaded functions does not contain function
17906 templates and at most one of a set of
17907 overloaded functions provides a unique
17910 if (resolve_overloaded_unification
17911 (tparms
, targs
, parm
, arg
, strict
,
17912 arg_strict
, explain_p
))
17913 return unify_success (explain_p
);
17914 return unify_overload_resolution_failure (explain_p
, arg
);
17918 arg
= unlowered_expr_type (arg
);
17919 if (arg
== error_mark_node
)
17920 return unify_invalid (explain_p
);
17924 maybe_adjust_types_for_deduction (strict
, &parm
, &arg
, arg_expr
);
17927 if ((TYPE_P (parm
) || TREE_CODE (parm
) == TEMPLATE_DECL
)
17928 != (TYPE_P (arg
) || TREE_CODE (arg
) == TEMPLATE_DECL
))
17929 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
17931 /* For deduction from an init-list we need the actual list. */
17932 if (arg_expr
&& BRACE_ENCLOSED_INITIALIZER_P (arg_expr
))
17934 return unify (tparms
, targs
, parm
, arg
, arg_strict
, explain_p
);
17937 /* Most parms like fn_type_unification.
17939 If SUBR is 1, we're being called recursively (to unify the
17940 arguments of a function or method parameter of a function
17943 CHECKS is a pointer to a vector of access checks encountered while
17944 substituting default template arguments. */
17947 type_unification_real (tree tparms
,
17951 unsigned int xnargs
,
17953 unification_kind_t strict
,
17955 vec
<deferred_access_check
, va_gc
> **checks
,
17960 int ntparms
= TREE_VEC_LENGTH (tparms
);
17961 int saw_undeduced
= 0;
17964 unsigned int nargs
;
17967 gcc_assert (TREE_CODE (tparms
) == TREE_VEC
);
17968 gcc_assert (xparms
== NULL_TREE
|| TREE_CODE (xparms
) == TREE_LIST
);
17969 gcc_assert (ntparms
> 0);
17971 /* Reset the number of non-defaulted template arguments contained
17973 NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
) = NULL_TREE
;
17981 while (parms
&& parms
!= void_list_node
17984 parm
= TREE_VALUE (parms
);
17986 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
17987 && (!TREE_CHAIN (parms
) || TREE_CHAIN (parms
) == void_list_node
))
17988 /* For a function parameter pack that occurs at the end of the
17989 parameter-declaration-list, the type A of each remaining
17990 argument of the call is compared with the type P of the
17991 declarator-id of the function parameter pack. */
17994 parms
= TREE_CHAIN (parms
);
17996 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
)
17997 /* For a function parameter pack that does not occur at the
17998 end of the parameter-declaration-list, the type of the
17999 parameter pack is a non-deduced context. */
18005 if (unify_one_argument (tparms
, targs
, parm
, arg
, subr
, strict
,
18011 && parms
!= void_list_node
18012 && TREE_CODE (TREE_VALUE (parms
)) == TYPE_PACK_EXPANSION
)
18014 /* Unify the remaining arguments with the pack expansion type. */
18016 tree parmvec
= make_tree_vec (1);
18018 /* Allocate a TREE_VEC and copy in all of the arguments */
18019 argvec
= make_tree_vec (nargs
- ia
);
18020 for (i
= 0; ia
< nargs
; ++ia
, ++i
)
18021 TREE_VEC_ELT (argvec
, i
) = args
[ia
];
18023 /* Copy the parameter into parmvec. */
18024 TREE_VEC_ELT (parmvec
, 0) = TREE_VALUE (parms
);
18025 if (unify_pack_expansion (tparms
, targs
, parmvec
, argvec
, strict
,
18026 /*subr=*/subr
, explain_p
))
18029 /* Advance to the end of the list of parameters. */
18030 parms
= TREE_CHAIN (parms
);
18033 /* Fail if we've reached the end of the parm list, and more args
18034 are present, and the parm list isn't variadic. */
18035 if (ia
< nargs
&& parms
== void_list_node
)
18036 return unify_too_many_arguments (explain_p
, nargs
, ia
);
18037 /* Fail if parms are left and they don't have default values and
18038 they aren't all deduced as empty packs (c++/57397). This is
18039 consistent with sufficient_parms_p. */
18040 if (parms
&& parms
!= void_list_node
18041 && TREE_PURPOSE (parms
) == NULL_TREE
)
18043 unsigned int count
= nargs
;
18048 type_pack_p
= TREE_CODE (TREE_VALUE (p
)) == TYPE_PACK_EXPANSION
;
18051 p
= TREE_CHAIN (p
);
18053 while (p
&& p
!= void_list_node
);
18054 if (count
!= nargs
)
18055 return unify_too_few_arguments (explain_p
, ia
, count
,
18061 tsubst_flags_t complain
= (explain_p
18062 ? tf_warning_or_error
18065 for (i
= 0; i
< ntparms
; i
++)
18067 tree targ
= TREE_VEC_ELT (targs
, i
);
18068 tree tparm
= TREE_VEC_ELT (tparms
, i
);
18070 /* Clear the "incomplete" flags on all argument packs now so that
18071 substituting them into later default arguments works. */
18072 if (targ
&& ARGUMENT_PACK_P (targ
))
18074 ARGUMENT_PACK_INCOMPLETE_P (targ
) = 0;
18075 ARGUMENT_PACK_EXPLICIT_ARGS (targ
) = NULL_TREE
;
18078 if (targ
|| tparm
== error_mark_node
)
18080 tparm
= TREE_VALUE (tparm
);
18082 /* If this is an undeduced nontype parameter that depends on
18083 a type parameter, try another pass; its type may have been
18084 deduced from a later argument than the one from which
18085 this parameter can be deduced. */
18086 if (TREE_CODE (tparm
) == PARM_DECL
18087 && uses_template_parms (TREE_TYPE (tparm
))
18088 && saw_undeduced
< 2)
18094 /* Core issue #226 (C++0x) [temp.deduct]:
18096 If a template argument has not been deduced, its
18097 default template argument, if any, is used.
18099 When we are in C++98 mode, TREE_PURPOSE will either
18100 be NULL_TREE or ERROR_MARK_NODE, so we do not need
18101 to explicitly check cxx_dialect here. */
18102 if (TREE_PURPOSE (TREE_VEC_ELT (tparms
, i
)))
18103 /* OK, there is a default argument. Wait until after the
18104 conversion check to do substitution. */
18107 /* If the type parameter is a parameter pack, then it will
18108 be deduced to an empty parameter pack. */
18109 if (template_parameter_pack_p (tparm
))
18113 if (TREE_CODE (tparm
) == TEMPLATE_PARM_INDEX
)
18115 arg
= make_node (NONTYPE_ARGUMENT_PACK
);
18116 TREE_TYPE (arg
) = TREE_TYPE (TEMPLATE_PARM_DECL (tparm
));
18117 TREE_CONSTANT (arg
) = 1;
18120 arg
= cxx_make_type (TYPE_ARGUMENT_PACK
);
18122 SET_ARGUMENT_PACK_ARGS (arg
, make_tree_vec (0));
18124 TREE_VEC_ELT (targs
, i
) = arg
;
18128 return unify_parameter_deduction_failure (explain_p
, tparm
);
18131 /* DR 1391: All parameters have args, now check non-dependent parms for
18133 if (saw_undeduced
< 2)
18134 for (ia
= 0, parms
= xparms
, args
= xargs
, nargs
= xnargs
;
18135 parms
&& parms
!= void_list_node
&& ia
< nargs
; )
18137 parm
= TREE_VALUE (parms
);
18139 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
18140 && (!TREE_CHAIN (parms
)
18141 || TREE_CHAIN (parms
) == void_list_node
))
18142 /* For a function parameter pack that occurs at the end of the
18143 parameter-declaration-list, the type A of each remaining
18144 argument of the call is compared with the type P of the
18145 declarator-id of the function parameter pack. */
18148 parms
= TREE_CHAIN (parms
);
18150 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
)
18151 /* For a function parameter pack that does not occur at the
18152 end of the parameter-declaration-list, the type of the
18153 parameter pack is a non-deduced context. */
18159 if (uses_template_parms (parm
))
18161 if (check_non_deducible_conversion (parm
, arg
, strict
, flags
,
18166 /* Now substitute into the default template arguments. */
18167 for (i
= 0; i
< ntparms
; i
++)
18169 tree targ
= TREE_VEC_ELT (targs
, i
);
18170 tree tparm
= TREE_VEC_ELT (tparms
, i
);
18172 if (targ
|| tparm
== error_mark_node
)
18174 tree parm
= TREE_VALUE (tparm
);
18176 if (TREE_CODE (parm
) == PARM_DECL
18177 && uses_template_parms (TREE_TYPE (parm
))
18178 && saw_undeduced
< 2)
18181 tree arg
= TREE_PURPOSE (tparm
);
18182 reopen_deferring_access_checks (*checks
);
18183 location_t save_loc
= input_location
;
18185 input_location
= DECL_SOURCE_LOCATION (parm
);
18186 arg
= tsubst_template_arg (arg
, targs
, complain
, NULL_TREE
);
18187 arg
= convert_template_argument (parm
, arg
, targs
, complain
,
18189 input_location
= save_loc
;
18190 *checks
= get_deferred_access_checks ();
18191 pop_deferring_access_checks ();
18192 if (arg
== error_mark_node
)
18196 TREE_VEC_ELT (targs
, i
) = arg
;
18197 /* The position of the first default template argument,
18198 is also the number of non-defaulted arguments in TARGS.
18200 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
))
18201 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
, i
);
18206 if (saw_undeduced
++ == 1)
18209 #ifdef ENABLE_CHECKING
18210 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
))
18211 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
, TREE_VEC_LENGTH (targs
));
18214 return unify_success (explain_p
);
18217 /* Subroutine of type_unification_real. Args are like the variables
18218 at the call site. ARG is an overloaded function (or template-id);
18219 we try deducing template args from each of the overloads, and if
18220 only one succeeds, we go with that. Modifies TARGS and returns
18221 true on success. */
18224 resolve_overloaded_unification (tree tparms
,
18228 unification_kind_t strict
,
18232 tree tempargs
= copy_node (targs
);
18234 tree goodfn
= NULL_TREE
;
18237 if (TREE_CODE (arg
) == ADDR_EXPR
)
18239 arg
= TREE_OPERAND (arg
, 0);
18245 if (TREE_CODE (arg
) == COMPONENT_REF
)
18246 /* Handle `&x' where `x' is some static or non-static member
18248 arg
= TREE_OPERAND (arg
, 1);
18250 if (TREE_CODE (arg
) == OFFSET_REF
)
18251 arg
= TREE_OPERAND (arg
, 1);
18253 /* Strip baselink information. */
18254 if (BASELINK_P (arg
))
18255 arg
= BASELINK_FUNCTIONS (arg
);
18257 if (TREE_CODE (arg
) == TEMPLATE_ID_EXPR
)
18259 /* If we got some explicit template args, we need to plug them into
18260 the affected templates before we try to unify, in case the
18261 explicit args will completely resolve the templates in question. */
18264 tree expl_subargs
= TREE_OPERAND (arg
, 1);
18265 arg
= TREE_OPERAND (arg
, 0);
18267 for (; arg
; arg
= OVL_NEXT (arg
))
18269 tree fn
= OVL_CURRENT (arg
);
18270 tree subargs
, elem
;
18272 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
18275 subargs
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
18276 expl_subargs
, NULL_TREE
, tf_none
,
18277 /*require_all_args=*/true,
18278 /*use_default_args=*/true);
18279 if (subargs
!= error_mark_node
18280 && !any_dependent_template_arguments_p (subargs
))
18282 elem
= TREE_TYPE (instantiate_template (fn
, subargs
, tf_none
));
18283 if (try_one_overload (tparms
, targs
, tempargs
, parm
,
18284 elem
, strict
, sub_strict
, addr_p
, explain_p
)
18285 && (!goodfn
|| !same_type_p (goodfn
, elem
)))
18294 /* If no templates (or more than one) are fully resolved by the
18295 explicit arguments, this template-id is a non-deduced context; it
18296 could still be OK if we deduce all template arguments for the
18297 enclosing call through other arguments. */
18301 else if (TREE_CODE (arg
) != OVERLOAD
18302 && TREE_CODE (arg
) != FUNCTION_DECL
)
18303 /* If ARG is, for example, "(0, &f)" then its type will be unknown
18304 -- but the deduction does not succeed because the expression is
18305 not just the function on its own. */
18308 for (; arg
; arg
= OVL_NEXT (arg
))
18309 if (try_one_overload (tparms
, targs
, tempargs
, parm
,
18310 TREE_TYPE (OVL_CURRENT (arg
)),
18311 strict
, sub_strict
, addr_p
, explain_p
)
18312 && (!goodfn
|| !decls_match (goodfn
, OVL_CURRENT (arg
))))
18314 goodfn
= OVL_CURRENT (arg
);
18318 /* [temp.deduct.type] A template-argument can be deduced from a pointer
18319 to function or pointer to member function argument if the set of
18320 overloaded functions does not contain function templates and at most
18321 one of a set of overloaded functions provides a unique match.
18323 So if we found multiple possibilities, we return success but don't
18324 deduce anything. */
18328 int i
= TREE_VEC_LENGTH (targs
);
18330 if (TREE_VEC_ELT (tempargs
, i
))
18332 tree old
= TREE_VEC_ELT (targs
, i
);
18333 tree new_
= TREE_VEC_ELT (tempargs
, i
);
18334 if (new_
&& old
&& ARGUMENT_PACK_P (old
)
18335 && ARGUMENT_PACK_EXPLICIT_ARGS (old
))
18336 /* Don't forget explicit template arguments in a pack. */
18337 ARGUMENT_PACK_EXPLICIT_ARGS (new_
)
18338 = ARGUMENT_PACK_EXPLICIT_ARGS (old
);
18339 TREE_VEC_ELT (targs
, i
) = new_
;
18348 /* Core DR 115: In contexts where deduction is done and fails, or in
18349 contexts where deduction is not done, if a template argument list is
18350 specified and it, along with any default template arguments, identifies
18351 a single function template specialization, then the template-id is an
18352 lvalue for the function template specialization. */
18355 resolve_nondeduced_context (tree orig_expr
)
18357 tree expr
, offset
, baselink
;
18360 if (!type_unknown_p (orig_expr
))
18365 offset
= NULL_TREE
;
18366 baselink
= NULL_TREE
;
18368 if (TREE_CODE (expr
) == ADDR_EXPR
)
18370 expr
= TREE_OPERAND (expr
, 0);
18373 if (TREE_CODE (expr
) == OFFSET_REF
)
18376 expr
= TREE_OPERAND (expr
, 1);
18378 if (BASELINK_P (expr
))
18381 expr
= BASELINK_FUNCTIONS (expr
);
18384 if (TREE_CODE (expr
) == TEMPLATE_ID_EXPR
)
18387 tree goodfn
= NULL_TREE
;
18389 /* If we got some explicit template args, we need to plug them into
18390 the affected templates before we try to unify, in case the
18391 explicit args will completely resolve the templates in question. */
18393 tree expl_subargs
= TREE_OPERAND (expr
, 1);
18394 tree arg
= TREE_OPERAND (expr
, 0);
18395 tree badfn
= NULL_TREE
;
18396 tree badargs
= NULL_TREE
;
18398 for (; arg
; arg
= OVL_NEXT (arg
))
18400 tree fn
= OVL_CURRENT (arg
);
18401 tree subargs
, elem
;
18403 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
18406 subargs
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
18407 expl_subargs
, NULL_TREE
, tf_none
,
18408 /*require_all_args=*/true,
18409 /*use_default_args=*/true);
18410 if (subargs
!= error_mark_node
18411 && !any_dependent_template_arguments_p (subargs
))
18413 elem
= instantiate_template (fn
, subargs
, tf_none
);
18414 if (elem
== error_mark_node
)
18419 else if (elem
&& (!goodfn
|| !decls_match (goodfn
, elem
)))
18428 mark_used (goodfn
);
18431 expr
= build_baselink (BASELINK_BINFO (baselink
),
18432 BASELINK_ACCESS_BINFO (baselink
),
18433 expr
, BASELINK_OPTYPE (baselink
));
18437 = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (offset
, 0)));
18438 expr
= build_offset_ref (base
, expr
, addr
, tf_warning_or_error
);
18441 expr
= cp_build_addr_expr (expr
, tf_warning_or_error
);
18444 else if (good
== 0 && badargs
)
18445 /* There were no good options and at least one bad one, so let the
18446 user know what the problem is. */
18447 instantiate_template (badfn
, badargs
, tf_warning_or_error
);
18452 /* Subroutine of resolve_overloaded_unification; does deduction for a single
18453 overload. Fills TARGS with any deduced arguments, or error_mark_node if
18454 different overloads deduce different arguments for a given parm.
18455 ADDR_P is true if the expression for which deduction is being
18456 performed was of the form "& fn" rather than simply "fn".
18458 Returns 1 on success. */
18461 try_one_overload (tree tparms
,
18466 unification_kind_t strict
,
18475 if (arg
== error_mark_node
)
18478 /* [temp.deduct.type] A template-argument can be deduced from a pointer
18479 to function or pointer to member function argument if the set of
18480 overloaded functions does not contain function templates and at most
18481 one of a set of overloaded functions provides a unique match.
18483 So if this is a template, just return success. */
18485 if (uses_template_parms (arg
))
18488 if (TREE_CODE (arg
) == METHOD_TYPE
)
18489 arg
= build_ptrmemfunc_type (build_pointer_type (arg
));
18491 arg
= build_pointer_type (arg
);
18493 sub_strict
|= maybe_adjust_types_for_deduction (strict
, &parm
, &arg
, NULL
);
18495 /* We don't copy orig_targs for this because if we have already deduced
18496 some template args from previous args, unify would complain when we
18497 try to deduce a template parameter for the same argument, even though
18498 there isn't really a conflict. */
18499 nargs
= TREE_VEC_LENGTH (targs
);
18500 tempargs
= make_tree_vec (nargs
);
18502 if (unify (tparms
, tempargs
, parm
, arg
, sub_strict
, explain_p
))
18505 /* First make sure we didn't deduce anything that conflicts with
18506 explicitly specified args. */
18507 for (i
= nargs
; i
--; )
18509 tree elt
= TREE_VEC_ELT (tempargs
, i
);
18510 tree oldelt
= TREE_VEC_ELT (orig_targs
, i
);
18514 else if (uses_template_parms (elt
))
18515 /* Since we're unifying against ourselves, we will fill in
18516 template args used in the function parm list with our own
18517 template parms. Discard them. */
18518 TREE_VEC_ELT (tempargs
, i
) = NULL_TREE
;
18519 else if (oldelt
&& !template_args_equal (oldelt
, elt
))
18523 for (i
= nargs
; i
--; )
18525 tree elt
= TREE_VEC_ELT (tempargs
, i
);
18528 TREE_VEC_ELT (targs
, i
) = elt
;
18534 /* PARM is a template class (perhaps with unbound template
18535 parameters). ARG is a fully instantiated type. If ARG can be
18536 bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and
18537 TARGS are as for unify. */
18540 try_class_unification (tree tparms
, tree targs
, tree parm
, tree arg
,
18543 tree copy_of_targs
;
18545 if (!CLASSTYPE_TEMPLATE_INFO (arg
)
18546 || (most_general_template (CLASSTYPE_TI_TEMPLATE (arg
))
18547 != most_general_template (CLASSTYPE_TI_TEMPLATE (parm
))))
18550 /* We need to make a new template argument vector for the call to
18551 unify. If we used TARGS, we'd clutter it up with the result of
18552 the attempted unification, even if this class didn't work out.
18553 We also don't want to commit ourselves to all the unifications
18554 we've already done, since unification is supposed to be done on
18555 an argument-by-argument basis. In other words, consider the
18556 following pathological case:
18558 template <int I, int J, int K>
18561 template <int I, int J>
18562 struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {};
18564 template <int I, int J, int K>
18565 void f(S<I, J, K>, S<I, I, I>);
18574 Now, by the time we consider the unification involving `s2', we
18575 already know that we must have `f<0, 0, 0>'. But, even though
18576 `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is invalid
18577 because there are two ways to unify base classes of S<0, 1, 2>
18578 with S<I, I, I>. If we kept the already deduced knowledge, we
18579 would reject the possibility I=1. */
18580 copy_of_targs
= make_tree_vec (TREE_VEC_LENGTH (targs
));
18582 /* If unification failed, we're done. */
18583 if (unify (tparms
, copy_of_targs
, CLASSTYPE_TI_ARGS (parm
),
18584 CLASSTYPE_TI_ARGS (arg
), UNIFY_ALLOW_NONE
, explain_p
))
18590 /* Given a template type PARM and a class type ARG, find the unique
18591 base type in ARG that is an instance of PARM. We do not examine
18592 ARG itself; only its base-classes. If there is not exactly one
18593 appropriate base class, return NULL_TREE. PARM may be the type of
18594 a partial specialization, as well as a plain template type. Used
18597 static enum template_base_result
18598 get_template_base (tree tparms
, tree targs
, tree parm
, tree arg
,
18599 bool explain_p
, tree
*result
)
18601 tree rval
= NULL_TREE
;
18604 gcc_assert (RECORD_OR_UNION_CODE_P (TREE_CODE (arg
)));
18606 binfo
= TYPE_BINFO (complete_type (arg
));
18609 /* The type could not be completed. */
18610 *result
= NULL_TREE
;
18611 return tbr_incomplete_type
;
18614 /* Walk in inheritance graph order. The search order is not
18615 important, and this avoids multiple walks of virtual bases. */
18616 for (binfo
= TREE_CHAIN (binfo
); binfo
; binfo
= TREE_CHAIN (binfo
))
18618 tree r
= try_class_unification (tparms
, targs
, parm
,
18619 BINFO_TYPE (binfo
), explain_p
);
18623 /* If there is more than one satisfactory baseclass, then:
18627 If they yield more than one possible deduced A, the type
18631 if (rval
&& !same_type_p (r
, rval
))
18633 *result
= NULL_TREE
;
18634 return tbr_ambiguous_baseclass
;
18642 return tbr_success
;
18645 /* Returns the level of DECL, which declares a template parameter. */
18648 template_decl_level (tree decl
)
18650 switch (TREE_CODE (decl
))
18653 case TEMPLATE_DECL
:
18654 return TEMPLATE_TYPE_LEVEL (TREE_TYPE (decl
));
18657 return TEMPLATE_PARM_LEVEL (DECL_INITIAL (decl
));
18660 gcc_unreachable ();
18665 /* Decide whether ARG can be unified with PARM, considering only the
18666 cv-qualifiers of each type, given STRICT as documented for unify.
18667 Returns nonzero iff the unification is OK on that basis. */
18670 check_cv_quals_for_unify (int strict
, tree arg
, tree parm
)
18672 int arg_quals
= cp_type_quals (arg
);
18673 int parm_quals
= cp_type_quals (parm
);
18675 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
18676 && !(strict
& UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
18678 /* Although a CVR qualifier is ignored when being applied to a
18679 substituted template parameter ([8.3.2]/1 for example), that
18680 does not allow us to unify "const T" with "int&" because both
18681 types are not of the form "cv-list T" [14.8.2.5 temp.deduct.type].
18682 It is ok when we're allowing additional CV qualifiers
18683 at the outer level [14.8.2.1]/3,1st bullet. */
18684 if ((TREE_CODE (arg
) == REFERENCE_TYPE
18685 || TREE_CODE (arg
) == FUNCTION_TYPE
18686 || TREE_CODE (arg
) == METHOD_TYPE
)
18687 && (parm_quals
& (TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
)))
18690 if ((!POINTER_TYPE_P (arg
) && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
)
18691 && (parm_quals
& TYPE_QUAL_RESTRICT
))
18695 if (!(strict
& (UNIFY_ALLOW_MORE_CV_QUAL
| UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
18696 && (arg_quals
& parm_quals
) != parm_quals
)
18699 if (!(strict
& (UNIFY_ALLOW_LESS_CV_QUAL
| UNIFY_ALLOW_OUTER_LESS_CV_QUAL
))
18700 && (parm_quals
& arg_quals
) != arg_quals
)
18706 /* Determines the LEVEL and INDEX for the template parameter PARM. */
18708 template_parm_level_and_index (tree parm
, int* level
, int* index
)
18710 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
18711 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
18712 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
18714 *index
= TEMPLATE_TYPE_IDX (parm
);
18715 *level
= TEMPLATE_TYPE_LEVEL (parm
);
18719 *index
= TEMPLATE_PARM_IDX (parm
);
18720 *level
= TEMPLATE_PARM_LEVEL (parm
);
18724 #define RECUR_AND_CHECK_FAILURE(TP, TA, P, A, S, EP) \
18726 if (unify (TP, TA, P, A, S, EP)) \
18730 /* Unifies the remaining arguments in PACKED_ARGS with the pack
18731 expansion at the end of PACKED_PARMS. Returns 0 if the type
18732 deduction succeeds, 1 otherwise. STRICT is the same as in
18733 unify. CALL_ARGS_P is true iff PACKED_ARGS is actually a function
18734 call argument list. We'll need to adjust the arguments to make them
18735 types. SUBR tells us if this is from a recursive call to
18736 type_unification_real, or for comparing two template argument
18740 unify_pack_expansion (tree tparms
, tree targs
, tree packed_parms
,
18741 tree packed_args
, unification_kind_t strict
,
18742 bool subr
, bool explain_p
)
18745 = TREE_VEC_ELT (packed_parms
, TREE_VEC_LENGTH (packed_parms
) - 1);
18746 tree pattern
= PACK_EXPANSION_PATTERN (parm
);
18747 tree pack
, packs
= NULL_TREE
;
18748 int i
, start
= TREE_VEC_LENGTH (packed_parms
) - 1;
18750 packed_args
= expand_template_argument_pack (packed_args
);
18752 int len
= TREE_VEC_LENGTH (packed_args
);
18754 /* Determine the parameter packs we will be deducing from the
18755 pattern, and record their current deductions. */
18756 for (pack
= PACK_EXPANSION_PARAMETER_PACKS (parm
);
18757 pack
; pack
= TREE_CHAIN (pack
))
18759 tree parm_pack
= TREE_VALUE (pack
);
18762 /* Determine the index and level of this parameter pack. */
18763 template_parm_level_and_index (parm_pack
, &level
, &idx
);
18765 /* Keep track of the parameter packs and their corresponding
18767 packs
= tree_cons (parm_pack
, TMPL_ARG (targs
, level
, idx
), packs
);
18768 TREE_TYPE (packs
) = make_tree_vec (len
- start
);
18771 /* Loop through all of the arguments that have not yet been
18772 unified and unify each with the pattern. */
18773 for (i
= start
; i
< len
; i
++)
18776 bool any_explicit
= false;
18777 tree arg
= TREE_VEC_ELT (packed_args
, i
);
18779 /* For each parameter pack, set its TMPL_ARG to either NULL_TREE
18780 or the element of its argument pack at the current index if
18781 this argument was explicitly specified. */
18782 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
18786 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
18789 if (TREE_VALUE (pack
)
18790 && (pargs
= ARGUMENT_PACK_EXPLICIT_ARGS (TREE_VALUE (pack
)))
18791 && (i
- start
< TREE_VEC_LENGTH (pargs
)))
18793 any_explicit
= true;
18794 arg
= TREE_VEC_ELT (pargs
, i
- start
);
18796 TMPL_ARG (targs
, level
, idx
) = arg
;
18799 /* If we had explicit template arguments, substitute them into the
18800 pattern before deduction. */
18803 /* Some arguments might still be unspecified or dependent. */
18805 ++processing_template_decl
;
18806 dependent
= any_dependent_template_arguments_p (targs
);
18808 --processing_template_decl
;
18809 parm
= tsubst (pattern
, targs
,
18810 explain_p
? tf_warning_or_error
: tf_none
,
18813 --processing_template_decl
;
18814 if (parm
== error_mark_node
)
18820 /* Unify the pattern with the current argument. */
18821 if (unify_one_argument (tparms
, targs
, parm
, arg
, subr
, strict
,
18825 /* For each parameter pack, collect the deduced value. */
18826 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
18829 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
18831 TREE_VEC_ELT (TREE_TYPE (pack
), i
- start
) =
18832 TMPL_ARG (targs
, level
, idx
);
18836 /* Verify that the results of unification with the parameter packs
18837 produce results consistent with what we've seen before, and make
18838 the deduced argument packs available. */
18839 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
18841 tree old_pack
= TREE_VALUE (pack
);
18842 tree new_args
= TREE_TYPE (pack
);
18843 int i
, len
= TREE_VEC_LENGTH (new_args
);
18845 bool nondeduced_p
= false;
18847 /* By default keep the original deduced argument pack.
18848 If necessary, more specific code is going to update the
18849 resulting deduced argument later down in this function. */
18850 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
18851 TMPL_ARG (targs
, level
, idx
) = old_pack
;
18853 /* If NEW_ARGS contains any NULL_TREE entries, we didn't
18854 actually deduce anything. */
18855 for (i
= 0; i
< len
&& !nondeduced_p
; ++i
)
18856 if (TREE_VEC_ELT (new_args
, i
) == NULL_TREE
)
18857 nondeduced_p
= true;
18861 if (old_pack
&& ARGUMENT_PACK_INCOMPLETE_P (old_pack
))
18863 /* If we had fewer function args than explicit template args,
18864 just use the explicits. */
18865 tree explicit_args
= ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
);
18866 int explicit_len
= TREE_VEC_LENGTH (explicit_args
);
18867 if (len
< explicit_len
)
18868 new_args
= explicit_args
;
18874 /* Build the deduced *_ARGUMENT_PACK. */
18875 if (TREE_CODE (TREE_PURPOSE (pack
)) == TEMPLATE_PARM_INDEX
)
18877 result
= make_node (NONTYPE_ARGUMENT_PACK
);
18878 TREE_TYPE (result
) =
18879 TREE_TYPE (TEMPLATE_PARM_DECL (TREE_PURPOSE (pack
)));
18880 TREE_CONSTANT (result
) = 1;
18883 result
= cxx_make_type (TYPE_ARGUMENT_PACK
);
18885 SET_ARGUMENT_PACK_ARGS (result
, new_args
);
18887 /* Note the deduced argument packs for this parameter
18889 TMPL_ARG (targs
, level
, idx
) = result
;
18891 else if (ARGUMENT_PACK_INCOMPLETE_P (old_pack
)
18892 && (ARGUMENT_PACK_ARGS (old_pack
)
18893 == ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
)))
18895 /* We only had the explicitly-provided arguments before, but
18896 now we have a complete set of arguments. */
18897 tree explicit_args
= ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
);
18899 SET_ARGUMENT_PACK_ARGS (old_pack
, new_args
);
18900 ARGUMENT_PACK_INCOMPLETE_P (old_pack
) = 1;
18901 ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
) = explicit_args
;
18905 tree bad_old_arg
= NULL_TREE
, bad_new_arg
= NULL_TREE
;
18906 tree old_args
= ARGUMENT_PACK_ARGS (old_pack
);
18908 if (!comp_template_args_with_info (old_args
, new_args
,
18909 &bad_old_arg
, &bad_new_arg
))
18910 /* Inconsistent unification of this parameter pack. */
18911 return unify_parameter_pack_inconsistent (explain_p
,
18917 return unify_success (explain_p
);
18920 /* Handle unification of the domain of an array. PARM_DOM and ARG_DOM are
18921 INTEGER_TYPEs representing the TYPE_DOMAIN of ARRAY_TYPEs. The other
18922 parameters and return value are as for unify. */
18925 unify_array_domain (tree tparms
, tree targs
,
18926 tree parm_dom
, tree arg_dom
,
18934 /* Our representation of array types uses "N - 1" as the
18935 TYPE_MAX_VALUE for an array with "N" elements, if "N" is
18936 not an integer constant. We cannot unify arbitrarily
18937 complex expressions, so we eliminate the MINUS_EXPRs
18939 parm_max
= TYPE_MAX_VALUE (parm_dom
);
18940 parm_cst
= TREE_CODE (parm_max
) == INTEGER_CST
;
18943 gcc_assert (TREE_CODE (parm_max
) == MINUS_EXPR
);
18944 parm_max
= TREE_OPERAND (parm_max
, 0);
18946 arg_max
= TYPE_MAX_VALUE (arg_dom
);
18947 arg_cst
= TREE_CODE (arg_max
) == INTEGER_CST
;
18950 /* The ARG_MAX may not be a simple MINUS_EXPR, if we are
18951 trying to unify the type of a variable with the type
18952 of a template parameter. For example:
18954 template <unsigned int N>
18955 void f (char (&) [N]);
18962 Here, the type of the ARG will be "int [g(i)]", and
18963 may be a SAVE_EXPR, etc. */
18964 if (TREE_CODE (arg_max
) != MINUS_EXPR
)
18965 return unify_vla_arg (explain_p
, arg_dom
);
18966 arg_max
= TREE_OPERAND (arg_max
, 0);
18969 /* If only one of the bounds used a MINUS_EXPR, compensate
18970 by adding one to the other bound. */
18971 if (parm_cst
&& !arg_cst
)
18972 parm_max
= fold_build2_loc (input_location
, PLUS_EXPR
,
18976 else if (arg_cst
&& !parm_cst
)
18977 arg_max
= fold_build2_loc (input_location
, PLUS_EXPR
,
18982 return unify (tparms
, targs
, parm_max
, arg_max
,
18983 UNIFY_ALLOW_INTEGER
, explain_p
);
18986 /* Deduce the value of template parameters. TPARMS is the (innermost)
18987 set of template parameters to a template. TARGS is the bindings
18988 for those template parameters, as determined thus far; TARGS may
18989 include template arguments for outer levels of template parameters
18990 as well. PARM is a parameter to a template function, or a
18991 subcomponent of that parameter; ARG is the corresponding argument.
18992 This function attempts to match PARM with ARG in a manner
18993 consistent with the existing assignments in TARGS. If more values
18994 are deduced, then TARGS is updated.
18996 Returns 0 if the type deduction succeeds, 1 otherwise. The
18997 parameter STRICT is a bitwise or of the following flags:
19000 Require an exact match between PARM and ARG.
19001 UNIFY_ALLOW_MORE_CV_QUAL:
19002 Allow the deduced ARG to be more cv-qualified (by qualification
19003 conversion) than ARG.
19004 UNIFY_ALLOW_LESS_CV_QUAL:
19005 Allow the deduced ARG to be less cv-qualified than ARG.
19006 UNIFY_ALLOW_DERIVED:
19007 Allow the deduced ARG to be a template base class of ARG,
19008 or a pointer to a template base class of the type pointed to by
19010 UNIFY_ALLOW_INTEGER:
19011 Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX
19012 case for more information.
19013 UNIFY_ALLOW_OUTER_LEVEL:
19014 This is the outermost level of a deduction. Used to determine validity
19015 of qualification conversions. A valid qualification conversion must
19016 have const qualified pointers leading up to the inner type which
19017 requires additional CV quals, except at the outer level, where const
19018 is not required [conv.qual]. It would be normal to set this flag in
19019 addition to setting UNIFY_ALLOW_MORE_CV_QUAL.
19020 UNIFY_ALLOW_OUTER_MORE_CV_QUAL:
19021 This is the outermost level of a deduction, and PARM can be more CV
19022 qualified at this point.
19023 UNIFY_ALLOW_OUTER_LESS_CV_QUAL:
19024 This is the outermost level of a deduction, and PARM can be less CV
19025 qualified at this point. */
19028 unify (tree tparms
, tree targs
, tree parm
, tree arg
, int strict
,
19034 int strict_in
= strict
;
19036 /* I don't think this will do the right thing with respect to types.
19037 But the only case I've seen it in so far has been array bounds, where
19038 signedness is the only information lost, and I think that will be
19040 while (TREE_CODE (parm
) == NOP_EXPR
)
19041 parm
= TREE_OPERAND (parm
, 0);
19043 if (arg
== error_mark_node
)
19044 return unify_invalid (explain_p
);
19045 if (arg
== unknown_type_node
19046 || arg
== init_list_type_node
)
19047 /* We can't deduce anything from this, but we might get all the
19048 template args from other function args. */
19049 return unify_success (explain_p
);
19051 /* If PARM uses template parameters, then we can't bail out here,
19052 even if ARG == PARM, since we won't record unifications for the
19053 template parameters. We might need them if we're trying to
19054 figure out which of two things is more specialized. */
19055 if (arg
== parm
&& !uses_template_parms (parm
))
19056 return unify_success (explain_p
);
19058 /* Handle init lists early, so the rest of the function can assume
19059 we're dealing with a type. */
19060 if (BRACE_ENCLOSED_INITIALIZER_P (arg
))
19064 tree orig_parm
= parm
;
19066 /* Replace T with std::initializer_list<T> for deduction. */
19067 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
19068 && flag_deduce_init_list
)
19069 parm
= listify (parm
);
19071 if (!is_std_init_list (parm
)
19072 && TREE_CODE (parm
) != ARRAY_TYPE
)
19073 /* We can only deduce from an initializer list argument if the
19074 parameter is std::initializer_list or an array; otherwise this
19075 is a non-deduced context. */
19076 return unify_success (explain_p
);
19078 if (TREE_CODE (parm
) == ARRAY_TYPE
)
19079 elttype
= TREE_TYPE (parm
);
19082 elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (parm
), 0);
19083 /* Deduction is defined in terms of a single type, so just punt
19084 on the (bizarre) std::initializer_list<T...>. */
19085 if (PACK_EXPANSION_P (elttype
))
19086 return unify_success (explain_p
);
19089 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (arg
), i
, elt
)
19091 int elt_strict
= strict
;
19093 if (elt
== error_mark_node
)
19094 return unify_invalid (explain_p
);
19096 if (!BRACE_ENCLOSED_INITIALIZER_P (elt
))
19098 tree type
= TREE_TYPE (elt
);
19099 if (type
== error_mark_node
)
19100 return unify_invalid (explain_p
);
19101 /* It should only be possible to get here for a call. */
19102 gcc_assert (elt_strict
& UNIFY_ALLOW_OUTER_LEVEL
);
19103 elt_strict
|= maybe_adjust_types_for_deduction
19104 (DEDUCE_CALL
, &elttype
, &type
, elt
);
19108 RECUR_AND_CHECK_FAILURE (tparms
, targs
, elttype
, elt
, elt_strict
,
19112 if (TREE_CODE (parm
) == ARRAY_TYPE
19113 && deducible_array_bound (TYPE_DOMAIN (parm
)))
19115 /* Also deduce from the length of the initializer list. */
19116 tree max
= size_int (CONSTRUCTOR_NELTS (arg
));
19117 tree idx
= compute_array_index_type (NULL_TREE
, max
, tf_none
);
19118 if (idx
== error_mark_node
)
19119 return unify_invalid (explain_p
);
19120 return unify_array_domain (tparms
, targs
, TYPE_DOMAIN (parm
),
19124 /* If the std::initializer_list<T> deduction worked, replace the
19125 deduced A with std::initializer_list<A>. */
19126 if (orig_parm
!= parm
)
19128 idx
= TEMPLATE_TYPE_IDX (orig_parm
);
19129 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
19130 targ
= listify (targ
);
19131 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = targ
;
19133 return unify_success (explain_p
);
19136 /* Immediately reject some pairs that won't unify because of
19137 cv-qualification mismatches. */
19138 if (TREE_CODE (arg
) == TREE_CODE (parm
)
19140 /* It is the elements of the array which hold the cv quals of an array
19141 type, and the elements might be template type parms. We'll check
19142 when we recurse. */
19143 && TREE_CODE (arg
) != ARRAY_TYPE
19144 /* We check the cv-qualifiers when unifying with template type
19145 parameters below. We want to allow ARG `const T' to unify with
19146 PARM `T' for example, when computing which of two templates
19147 is more specialized, for example. */
19148 && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
19149 && !check_cv_quals_for_unify (strict_in
, arg
, parm
))
19150 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
19152 if (!(strict
& UNIFY_ALLOW_OUTER_LEVEL
)
19153 && TYPE_P (parm
) && !CP_TYPE_CONST_P (parm
))
19154 strict
&= ~UNIFY_ALLOW_MORE_CV_QUAL
;
19155 strict
&= ~UNIFY_ALLOW_OUTER_LEVEL
;
19156 strict
&= ~UNIFY_ALLOW_DERIVED
;
19157 strict
&= ~UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
19158 strict
&= ~UNIFY_ALLOW_OUTER_LESS_CV_QUAL
;
19160 switch (TREE_CODE (parm
))
19162 case TYPENAME_TYPE
:
19164 case UNBOUND_CLASS_TEMPLATE
:
19165 /* In a type which contains a nested-name-specifier, template
19166 argument values cannot be deduced for template parameters used
19167 within the nested-name-specifier. */
19168 return unify_success (explain_p
);
19170 case TEMPLATE_TYPE_PARM
:
19171 case TEMPLATE_TEMPLATE_PARM
:
19172 case BOUND_TEMPLATE_TEMPLATE_PARM
:
19173 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
19174 if (error_operand_p (tparm
))
19175 return unify_invalid (explain_p
);
19177 if (TEMPLATE_TYPE_LEVEL (parm
)
19178 != template_decl_level (tparm
))
19179 /* The PARM is not one we're trying to unify. Just check
19180 to see if it matches ARG. */
19182 if (TREE_CODE (arg
) == TREE_CODE (parm
)
19183 && (is_auto (parm
) ? is_auto (arg
)
19184 : same_type_p (parm
, arg
)))
19185 return unify_success (explain_p
);
19187 return unify_type_mismatch (explain_p
, parm
, arg
);
19189 idx
= TEMPLATE_TYPE_IDX (parm
);
19190 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
19191 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, idx
));
19192 if (error_operand_p (tparm
))
19193 return unify_invalid (explain_p
);
19195 /* Check for mixed types and values. */
19196 if ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
19197 && TREE_CODE (tparm
) != TYPE_DECL
)
19198 || (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
19199 && TREE_CODE (tparm
) != TEMPLATE_DECL
))
19200 gcc_unreachable ();
19202 if (TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
19204 /* ARG must be constructed from a template class or a template
19205 template parameter. */
19206 if (TREE_CODE (arg
) != BOUND_TEMPLATE_TEMPLATE_PARM
19207 && !CLASSTYPE_SPECIALIZATION_OF_PRIMARY_TEMPLATE_P (arg
))
19208 return unify_template_deduction_failure (explain_p
, parm
, arg
);
19210 tree parmvec
= TYPE_TI_ARGS (parm
);
19211 /* An alias template name is never deduced. */
19212 if (TYPE_ALIAS_P (arg
))
19213 arg
= strip_typedefs (arg
);
19214 tree argvec
= INNERMOST_TEMPLATE_ARGS (TYPE_TI_ARGS (arg
));
19215 tree full_argvec
= add_to_template_args (targs
, argvec
);
19217 = DECL_INNERMOST_TEMPLATE_PARMS
19218 (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (parm
));
19220 int parm_variadic_p
= 0;
19222 /* The resolution to DR150 makes clear that default
19223 arguments for an N-argument may not be used to bind T
19224 to a template template parameter with fewer than N
19225 parameters. It is not safe to permit the binding of
19226 default arguments as an extension, as that may change
19227 the meaning of a conforming program. Consider:
19229 struct Dense { static const unsigned int dim = 1; };
19231 template <template <typename> class View,
19233 void operator+(float, View<Block> const&);
19235 template <typename Block,
19236 unsigned int Dim = Block::dim>
19237 struct Lvalue_proxy { operator float() const; };
19241 Lvalue_proxy<Dense> p;
19246 Here, if Lvalue_proxy is permitted to bind to View, then
19247 the global operator+ will be used; if they are not, the
19248 Lvalue_proxy will be converted to float. */
19249 if (coerce_template_parms (parm_parms
,
19251 TYPE_TI_TEMPLATE (parm
),
19253 ? tf_warning_or_error
19255 /*require_all_args=*/true,
19256 /*use_default_args=*/false)
19257 == error_mark_node
)
19260 /* Deduce arguments T, i from TT<T> or TT<i>.
19261 We check each element of PARMVEC and ARGVEC individually
19262 rather than the whole TREE_VEC since they can have
19263 different number of elements. */
19265 parmvec
= expand_template_argument_pack (parmvec
);
19266 argvec
= expand_template_argument_pack (argvec
);
19268 len
= TREE_VEC_LENGTH (parmvec
);
19270 /* Check if the parameters end in a pack, making them
19273 && PACK_EXPANSION_P (TREE_VEC_ELT (parmvec
, len
- 1)))
19274 parm_variadic_p
= 1;
19276 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
19277 /* If the template argument list of P contains a pack
19278 expansion that is not the last template argument, the
19279 entire template argument list is a non-deduced
19281 if (PACK_EXPANSION_P (TREE_VEC_ELT (parmvec
, i
)))
19282 return unify_success (explain_p
);
19284 if (TREE_VEC_LENGTH (argvec
) < len
- parm_variadic_p
)
19285 return unify_too_few_arguments (explain_p
,
19286 TREE_VEC_LENGTH (argvec
), len
);
19288 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
19290 RECUR_AND_CHECK_FAILURE (tparms
, targs
,
19291 TREE_VEC_ELT (parmvec
, i
),
19292 TREE_VEC_ELT (argvec
, i
),
19293 UNIFY_ALLOW_NONE
, explain_p
);
19296 if (parm_variadic_p
19297 && unify_pack_expansion (tparms
, targs
,
19300 /*subr=*/true, explain_p
))
19303 arg
= TYPE_TI_TEMPLATE (arg
);
19305 /* Fall through to deduce template name. */
19308 if (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
19309 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
19311 /* Deduce template name TT from TT, TT<>, TT<T> and TT<i>. */
19313 /* Simple cases: Value already set, does match or doesn't. */
19314 if (targ
!= NULL_TREE
&& template_args_equal (targ
, arg
))
19315 return unify_success (explain_p
);
19317 return unify_inconsistency (explain_p
, parm
, targ
, arg
);
19321 /* If PARM is `const T' and ARG is only `int', we don't have
19322 a match unless we are allowing additional qualification.
19323 If ARG is `const int' and PARM is just `T' that's OK;
19324 that binds `const int' to `T'. */
19325 if (!check_cv_quals_for_unify (strict_in
| UNIFY_ALLOW_LESS_CV_QUAL
,
19327 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
19329 /* Consider the case where ARG is `const volatile int' and
19330 PARM is `const T'. Then, T should be `volatile int'. */
19331 arg
= cp_build_qualified_type_real
19332 (arg
, cp_type_quals (arg
) & ~cp_type_quals (parm
), tf_none
);
19333 if (arg
== error_mark_node
)
19334 return unify_invalid (explain_p
);
19336 /* Simple cases: Value already set, does match or doesn't. */
19337 if (targ
!= NULL_TREE
&& same_type_p (targ
, arg
))
19338 return unify_success (explain_p
);
19340 return unify_inconsistency (explain_p
, parm
, targ
, arg
);
19342 /* Make sure that ARG is not a variable-sized array. (Note
19343 that were talking about variable-sized arrays (like
19344 `int[n]'), rather than arrays of unknown size (like
19345 `int[]').) We'll get very confused by such a type since
19346 the bound of the array is not constant, and therefore
19347 not mangleable. Besides, such types are not allowed in
19348 ISO C++, so we can do as we please here. We do allow
19349 them for 'auto' deduction, since that isn't ABI-exposed. */
19350 if (!is_auto (parm
) && variably_modified_type_p (arg
, NULL_TREE
))
19351 return unify_vla_arg (explain_p
, arg
);
19353 /* Strip typedefs as in convert_template_argument. */
19354 arg
= canonicalize_type_argument (arg
, tf_none
);
19357 /* If ARG is a parameter pack or an expansion, we cannot unify
19358 against it unless PARM is also a parameter pack. */
19359 if ((template_parameter_pack_p (arg
) || PACK_EXPANSION_P (arg
))
19360 && !template_parameter_pack_p (parm
))
19361 return unify_parameter_pack_mismatch (explain_p
, parm
, arg
);
19363 /* If the argument deduction results is a METHOD_TYPE,
19364 then there is a problem.
19365 METHOD_TYPE doesn't map to any real C++ type the result of
19366 the deduction can not be of that type. */
19367 if (TREE_CODE (arg
) == METHOD_TYPE
)
19368 return unify_method_type_error (explain_p
, arg
);
19370 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = arg
;
19371 return unify_success (explain_p
);
19373 case TEMPLATE_PARM_INDEX
:
19374 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
19375 if (error_operand_p (tparm
))
19376 return unify_invalid (explain_p
);
19378 if (TEMPLATE_PARM_LEVEL (parm
)
19379 != template_decl_level (tparm
))
19381 /* The PARM is not one we're trying to unify. Just check
19382 to see if it matches ARG. */
19383 int result
= !(TREE_CODE (arg
) == TREE_CODE (parm
)
19384 && cp_tree_equal (parm
, arg
));
19386 unify_expression_unequal (explain_p
, parm
, arg
);
19390 idx
= TEMPLATE_PARM_IDX (parm
);
19391 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
19395 int x
= !cp_tree_equal (targ
, arg
);
19397 unify_inconsistency (explain_p
, parm
, targ
, arg
);
19401 /* [temp.deduct.type] If, in the declaration of a function template
19402 with a non-type template-parameter, the non-type
19403 template-parameter is used in an expression in the function
19404 parameter-list and, if the corresponding template-argument is
19405 deduced, the template-argument type shall match the type of the
19406 template-parameter exactly, except that a template-argument
19407 deduced from an array bound may be of any integral type.
19408 The non-type parameter might use already deduced type parameters. */
19409 tparm
= tsubst (TREE_TYPE (parm
), targs
, 0, NULL_TREE
);
19410 if (!TREE_TYPE (arg
))
19411 /* Template-parameter dependent expression. Just accept it for now.
19412 It will later be processed in convert_template_argument. */
19414 else if (same_type_p (TREE_TYPE (arg
), tparm
))
19416 else if ((strict
& UNIFY_ALLOW_INTEGER
)
19417 && CP_INTEGRAL_TYPE_P (tparm
))
19418 /* Convert the ARG to the type of PARM; the deduced non-type
19419 template argument must exactly match the types of the
19420 corresponding parameter. */
19421 arg
= fold (build_nop (tparm
, arg
));
19422 else if (uses_template_parms (tparm
))
19423 /* We haven't deduced the type of this parameter yet. Try again
19425 return unify_success (explain_p
);
19427 return unify_type_mismatch (explain_p
, tparm
, TREE_TYPE (arg
));
19429 /* If ARG is a parameter pack or an expansion, we cannot unify
19430 against it unless PARM is also a parameter pack. */
19431 if ((template_parameter_pack_p (arg
) || PACK_EXPANSION_P (arg
))
19432 && !TEMPLATE_PARM_PARAMETER_PACK (parm
))
19433 return unify_parameter_pack_mismatch (explain_p
, parm
, arg
);
19436 bool removed_attr
= false;
19437 arg
= strip_typedefs_expr (arg
, &removed_attr
);
19439 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = arg
;
19440 return unify_success (explain_p
);
19444 /* A pointer-to-member constant can be unified only with
19445 another constant. */
19446 if (TREE_CODE (arg
) != PTRMEM_CST
)
19447 return unify_ptrmem_cst_mismatch (explain_p
, parm
, arg
);
19449 /* Just unify the class member. It would be useless (and possibly
19450 wrong, depending on the strict flags) to unify also
19451 PTRMEM_CST_CLASS, because we want to be sure that both parm and
19452 arg refer to the same variable, even if through different
19453 classes. For instance:
19455 struct A { int x; };
19458 Unification of &A::x and &B::x must succeed. */
19459 return unify (tparms
, targs
, PTRMEM_CST_MEMBER (parm
),
19460 PTRMEM_CST_MEMBER (arg
), strict
, explain_p
);
19465 if (!TYPE_PTR_P (arg
))
19466 return unify_type_mismatch (explain_p
, parm
, arg
);
19468 /* [temp.deduct.call]
19470 A can be another pointer or pointer to member type that can
19471 be converted to the deduced A via a qualification
19472 conversion (_conv.qual_).
19474 We pass down STRICT here rather than UNIFY_ALLOW_NONE.
19475 This will allow for additional cv-qualification of the
19476 pointed-to types if appropriate. */
19478 if (TREE_CODE (TREE_TYPE (arg
)) == RECORD_TYPE
)
19479 /* The derived-to-base conversion only persists through one
19480 level of pointers. */
19481 strict
|= (strict_in
& UNIFY_ALLOW_DERIVED
);
19483 return unify (tparms
, targs
, TREE_TYPE (parm
),
19484 TREE_TYPE (arg
), strict
, explain_p
);
19487 case REFERENCE_TYPE
:
19488 if (TREE_CODE (arg
) != REFERENCE_TYPE
)
19489 return unify_type_mismatch (explain_p
, parm
, arg
);
19490 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
19491 strict
& UNIFY_ALLOW_MORE_CV_QUAL
, explain_p
);
19494 if (TREE_CODE (arg
) != ARRAY_TYPE
)
19495 return unify_type_mismatch (explain_p
, parm
, arg
);
19496 if ((TYPE_DOMAIN (parm
) == NULL_TREE
)
19497 != (TYPE_DOMAIN (arg
) == NULL_TREE
))
19498 return unify_type_mismatch (explain_p
, parm
, arg
);
19499 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
19500 strict
& UNIFY_ALLOW_MORE_CV_QUAL
, explain_p
);
19501 if (TYPE_DOMAIN (parm
) != NULL_TREE
)
19502 return unify_array_domain (tparms
, targs
, TYPE_DOMAIN (parm
),
19503 TYPE_DOMAIN (arg
), explain_p
);
19504 return unify_success (explain_p
);
19511 case ENUMERAL_TYPE
:
19514 if (TREE_CODE (arg
) != TREE_CODE (parm
))
19515 return unify_type_mismatch (explain_p
, parm
, arg
);
19517 /* We have already checked cv-qualification at the top of the
19519 if (!same_type_ignoring_top_level_qualifiers_p (arg
, parm
))
19520 return unify_type_mismatch (explain_p
, parm
, arg
);
19522 /* As far as unification is concerned, this wins. Later checks
19523 will invalidate it if necessary. */
19524 return unify_success (explain_p
);
19526 /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */
19527 /* Type INTEGER_CST can come from ordinary constant template args. */
19529 while (TREE_CODE (arg
) == NOP_EXPR
)
19530 arg
= TREE_OPERAND (arg
, 0);
19532 if (TREE_CODE (arg
) != INTEGER_CST
)
19533 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
19534 return (tree_int_cst_equal (parm
, arg
)
19535 ? unify_success (explain_p
)
19536 : unify_template_argument_mismatch (explain_p
, parm
, arg
));
19540 int i
, len
, argslen
;
19541 int parm_variadic_p
= 0;
19543 if (TREE_CODE (arg
) != TREE_VEC
)
19544 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
19546 len
= TREE_VEC_LENGTH (parm
);
19547 argslen
= TREE_VEC_LENGTH (arg
);
19549 /* Check for pack expansions in the parameters. */
19550 for (i
= 0; i
< len
; ++i
)
19552 if (PACK_EXPANSION_P (TREE_VEC_ELT (parm
, i
)))
19555 /* We can unify against something with a trailing
19557 parm_variadic_p
= 1;
19559 /* [temp.deduct.type]/9: If the template argument list of
19560 P contains a pack expansion that is not the last
19561 template argument, the entire template argument list
19562 is a non-deduced context. */
19563 return unify_success (explain_p
);
19567 /* If we don't have enough arguments to satisfy the parameters
19568 (not counting the pack expression at the end), or we have
19569 too many arguments for a parameter list that doesn't end in
19570 a pack expression, we can't unify. */
19571 if (parm_variadic_p
19572 ? argslen
< len
- parm_variadic_p
19574 return unify_arity (explain_p
, TREE_VEC_LENGTH (arg
), len
);
19576 /* Unify all of the parameters that precede the (optional)
19577 pack expression. */
19578 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
19580 RECUR_AND_CHECK_FAILURE (tparms
, targs
,
19581 TREE_VEC_ELT (parm
, i
),
19582 TREE_VEC_ELT (arg
, i
),
19583 UNIFY_ALLOW_NONE
, explain_p
);
19585 if (parm_variadic_p
)
19586 return unify_pack_expansion (tparms
, targs
, parm
, arg
,
19588 /*subr=*/true, explain_p
);
19589 return unify_success (explain_p
);
19594 if (TREE_CODE (arg
) != TREE_CODE (parm
))
19595 return unify_type_mismatch (explain_p
, parm
, arg
);
19597 if (TYPE_PTRMEMFUNC_P (parm
))
19599 if (!TYPE_PTRMEMFUNC_P (arg
))
19600 return unify_type_mismatch (explain_p
, parm
, arg
);
19602 return unify (tparms
, targs
,
19603 TYPE_PTRMEMFUNC_FN_TYPE (parm
),
19604 TYPE_PTRMEMFUNC_FN_TYPE (arg
),
19605 strict
, explain_p
);
19607 else if (TYPE_PTRMEMFUNC_P (arg
))
19608 return unify_type_mismatch (explain_p
, parm
, arg
);
19610 if (CLASSTYPE_TEMPLATE_INFO (parm
))
19612 tree t
= NULL_TREE
;
19614 if (strict_in
& UNIFY_ALLOW_DERIVED
)
19616 /* First, we try to unify the PARM and ARG directly. */
19617 t
= try_class_unification (tparms
, targs
,
19618 parm
, arg
, explain_p
);
19622 /* Fallback to the special case allowed in
19623 [temp.deduct.call]:
19625 If P is a class, and P has the form
19626 template-id, then A can be a derived class of
19627 the deduced A. Likewise, if P is a pointer to
19628 a class of the form template-id, A can be a
19629 pointer to a derived class pointed to by the
19631 enum template_base_result r
;
19632 r
= get_template_base (tparms
, targs
, parm
, arg
,
19636 return unify_no_common_base (explain_p
, r
, parm
, arg
);
19639 else if (CLASSTYPE_TEMPLATE_INFO (arg
)
19640 && (CLASSTYPE_TI_TEMPLATE (parm
)
19641 == CLASSTYPE_TI_TEMPLATE (arg
)))
19642 /* Perhaps PARM is something like S<U> and ARG is S<int>.
19643 Then, we should unify `int' and `U'. */
19646 /* There's no chance of unification succeeding. */
19647 return unify_type_mismatch (explain_p
, parm
, arg
);
19649 return unify (tparms
, targs
, CLASSTYPE_TI_ARGS (parm
),
19650 CLASSTYPE_TI_ARGS (t
), UNIFY_ALLOW_NONE
, explain_p
);
19652 else if (!same_type_ignoring_top_level_qualifiers_p (parm
, arg
))
19653 return unify_type_mismatch (explain_p
, parm
, arg
);
19654 return unify_success (explain_p
);
19657 case FUNCTION_TYPE
:
19659 unsigned int nargs
;
19664 if (TREE_CODE (arg
) != TREE_CODE (parm
))
19665 return unify_type_mismatch (explain_p
, parm
, arg
);
19667 /* CV qualifications for methods can never be deduced, they must
19668 match exactly. We need to check them explicitly here,
19669 because type_unification_real treats them as any other
19670 cv-qualified parameter. */
19671 if (TREE_CODE (parm
) == METHOD_TYPE
19672 && (!check_cv_quals_for_unify
19674 class_of_this_parm (arg
),
19675 class_of_this_parm (parm
))))
19676 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
19678 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TREE_TYPE (parm
),
19679 TREE_TYPE (arg
), UNIFY_ALLOW_NONE
, explain_p
);
19681 nargs
= list_length (TYPE_ARG_TYPES (arg
));
19682 args
= XALLOCAVEC (tree
, nargs
);
19683 for (a
= TYPE_ARG_TYPES (arg
), i
= 0;
19684 a
!= NULL_TREE
&& a
!= void_list_node
;
19685 a
= TREE_CHAIN (a
), ++i
)
19686 args
[i
] = TREE_VALUE (a
);
19689 return type_unification_real (tparms
, targs
, TYPE_ARG_TYPES (parm
),
19690 args
, nargs
, 1, DEDUCE_EXACT
,
19691 LOOKUP_NORMAL
, NULL
, explain_p
);
19695 /* Unify a pointer to member with a pointer to member function, which
19696 deduces the type of the member as a function type. */
19697 if (TYPE_PTRMEMFUNC_P (arg
))
19699 /* Check top-level cv qualifiers */
19700 if (!check_cv_quals_for_unify (UNIFY_ALLOW_NONE
, arg
, parm
))
19701 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
19703 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
19704 TYPE_PTRMEMFUNC_OBJECT_TYPE (arg
),
19705 UNIFY_ALLOW_NONE
, explain_p
);
19707 /* Determine the type of the function we are unifying against. */
19708 tree fntype
= static_fn_type (arg
);
19710 return unify (tparms
, targs
, TREE_TYPE (parm
), fntype
, strict
, explain_p
);
19713 if (TREE_CODE (arg
) != OFFSET_TYPE
)
19714 return unify_type_mismatch (explain_p
, parm
, arg
);
19715 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
19716 TYPE_OFFSET_BASETYPE (arg
),
19717 UNIFY_ALLOW_NONE
, explain_p
);
19718 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
19719 strict
, explain_p
);
19722 if (DECL_TEMPLATE_PARM_P (parm
))
19723 return unify (tparms
, targs
, DECL_INITIAL (parm
), arg
, strict
, explain_p
);
19724 if (arg
!= scalar_constant_value (parm
))
19725 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
19726 return unify_success (explain_p
);
19729 case TEMPLATE_DECL
:
19730 /* Matched cases are handled by the ARG == PARM test above. */
19731 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
19734 /* A non-type template parameter that is a variable should be a
19735 an integral constant, in which case, it whould have been
19736 folded into its (constant) value. So we should not be getting
19737 a variable here. */
19738 gcc_unreachable ();
19740 case TYPE_ARGUMENT_PACK
:
19741 case NONTYPE_ARGUMENT_PACK
:
19742 return unify (tparms
, targs
, ARGUMENT_PACK_ARGS (parm
),
19743 ARGUMENT_PACK_ARGS (arg
), strict
, explain_p
);
19746 case DECLTYPE_TYPE
:
19747 case UNDERLYING_TYPE
:
19748 /* Cannot deduce anything from TYPEOF_TYPE, DECLTYPE_TYPE,
19749 or UNDERLYING_TYPE nodes. */
19750 return unify_success (explain_p
);
19753 /* Unification fails if we hit an error node. */
19754 return unify_invalid (explain_p
);
19757 if (REFERENCE_REF_P (parm
))
19759 if (REFERENCE_REF_P (arg
))
19760 arg
= TREE_OPERAND (arg
, 0);
19761 return unify (tparms
, targs
, TREE_OPERAND (parm
, 0), arg
,
19762 strict
, explain_p
);
19767 /* An unresolved overload is a nondeduced context. */
19768 if (is_overloaded_fn (parm
) || type_unknown_p (parm
))
19769 return unify_success (explain_p
);
19770 gcc_assert (EXPR_P (parm
));
19772 /* We must be looking at an expression. This can happen with
19776 void foo(S<I>, S<I + 2>);
19778 This is a "nondeduced context":
19782 The nondeduced contexts are:
19784 --A type that is a template-id in which one or more of
19785 the template-arguments is an expression that references
19786 a template-parameter.
19788 In these cases, we assume deduction succeeded, but don't
19789 actually infer any unifications. */
19791 if (!uses_template_parms (parm
)
19792 && !template_args_equal (parm
, arg
))
19793 return unify_expression_unequal (explain_p
, parm
, arg
);
19795 return unify_success (explain_p
);
19798 #undef RECUR_AND_CHECK_FAILURE
19800 /* Note that DECL can be defined in this translation unit, if
19804 mark_definable (tree decl
)
19807 DECL_NOT_REALLY_EXTERN (decl
) = 1;
19808 FOR_EACH_CLONE (clone
, decl
)
19809 DECL_NOT_REALLY_EXTERN (clone
) = 1;
19812 /* Called if RESULT is explicitly instantiated, or is a member of an
19813 explicitly instantiated class. */
19816 mark_decl_instantiated (tree result
, int extern_p
)
19818 SET_DECL_EXPLICIT_INSTANTIATION (result
);
19820 /* If this entity has already been written out, it's too late to
19821 make any modifications. */
19822 if (TREE_ASM_WRITTEN (result
))
19825 /* For anonymous namespace we don't need to do anything. */
19826 if (decl_anon_ns_mem_p (result
))
19828 gcc_assert (!TREE_PUBLIC (result
));
19832 if (TREE_CODE (result
) != FUNCTION_DECL
)
19833 /* The TREE_PUBLIC flag for function declarations will have been
19834 set correctly by tsubst. */
19835 TREE_PUBLIC (result
) = 1;
19837 /* This might have been set by an earlier implicit instantiation. */
19838 DECL_COMDAT (result
) = 0;
19841 DECL_NOT_REALLY_EXTERN (result
) = 0;
19844 mark_definable (result
);
19845 mark_needed (result
);
19846 /* Always make artificials weak. */
19847 if (DECL_ARTIFICIAL (result
) && flag_weak
)
19848 comdat_linkage (result
);
19849 /* For WIN32 we also want to put explicit instantiations in
19850 linkonce sections. */
19851 else if (TREE_PUBLIC (result
))
19852 maybe_make_one_only (result
);
19855 /* If EXTERN_P, then this function will not be emitted -- unless
19856 followed by an explicit instantiation, at which point its linkage
19857 will be adjusted. If !EXTERN_P, then this function will be
19858 emitted here. In neither circumstance do we want
19859 import_export_decl to adjust the linkage. */
19860 DECL_INTERFACE_KNOWN (result
) = 1;
19863 /* Subroutine of more_specialized_fn: check whether TARGS is missing any
19864 important template arguments. If any are missing, we check whether
19865 they're important by using error_mark_node for substituting into any
19866 args that were used for partial ordering (the ones between ARGS and END)
19867 and seeing if it bubbles up. */
19870 check_undeduced_parms (tree targs
, tree args
, tree end
)
19872 bool found
= false;
19874 for (i
= TREE_VEC_LENGTH (targs
) - 1; i
>= 0; --i
)
19875 if (TREE_VEC_ELT (targs
, i
) == NULL_TREE
)
19878 TREE_VEC_ELT (targs
, i
) = error_mark_node
;
19882 tree substed
= tsubst_arg_types (args
, targs
, end
, tf_none
, NULL_TREE
);
19883 if (substed
== error_mark_node
)
19889 /* Given two function templates PAT1 and PAT2, return:
19891 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order].
19892 -1 if PAT2 is more specialized than PAT1.
19893 0 if neither is more specialized.
19895 LEN indicates the number of parameters we should consider
19896 (defaulted parameters should not be considered).
19898 The 1998 std underspecified function template partial ordering, and
19899 DR214 addresses the issue. We take pairs of arguments, one from
19900 each of the templates, and deduce them against each other. One of
19901 the templates will be more specialized if all the *other*
19902 template's arguments deduce against its arguments and at least one
19903 of its arguments *does* *not* deduce against the other template's
19904 corresponding argument. Deduction is done as for class templates.
19905 The arguments used in deduction have reference and top level cv
19906 qualifiers removed. Iff both arguments were originally reference
19907 types *and* deduction succeeds in both directions, an lvalue reference
19908 wins against an rvalue reference and otherwise the template
19909 with the more cv-qualified argument wins for that pairing (if
19910 neither is more cv-qualified, they both are equal). Unlike regular
19911 deduction, after all the arguments have been deduced in this way,
19912 we do *not* verify the deduced template argument values can be
19913 substituted into non-deduced contexts.
19915 The logic can be a bit confusing here, because we look at deduce1 and
19916 targs1 to see if pat2 is at least as specialized, and vice versa; if we
19917 can find template arguments for pat1 to make arg1 look like arg2, that
19918 means that arg2 is at least as specialized as arg1. */
19921 more_specialized_fn (tree pat1
, tree pat2
, int len
)
19923 tree decl1
= DECL_TEMPLATE_RESULT (pat1
);
19924 tree decl2
= DECL_TEMPLATE_RESULT (pat2
);
19925 tree targs1
= make_tree_vec (DECL_NTPARMS (pat1
));
19926 tree targs2
= make_tree_vec (DECL_NTPARMS (pat2
));
19927 tree tparms1
= DECL_INNERMOST_TEMPLATE_PARMS (pat1
);
19928 tree tparms2
= DECL_INNERMOST_TEMPLATE_PARMS (pat2
);
19929 tree args1
= TYPE_ARG_TYPES (TREE_TYPE (decl1
));
19930 tree args2
= TYPE_ARG_TYPES (TREE_TYPE (decl2
));
19931 tree origs1
, origs2
;
19932 bool lose1
= false;
19933 bool lose2
= false;
19935 /* Remove the this parameter from non-static member functions. If
19936 one is a non-static member function and the other is not a static
19937 member function, remove the first parameter from that function
19938 also. This situation occurs for operator functions where we
19939 locate both a member function (with this pointer) and non-member
19940 operator (with explicit first operand). */
19941 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl1
))
19943 len
--; /* LEN is the number of significant arguments for DECL1 */
19944 args1
= TREE_CHAIN (args1
);
19945 if (!DECL_STATIC_FUNCTION_P (decl2
))
19946 args2
= TREE_CHAIN (args2
);
19948 else if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl2
))
19950 args2
= TREE_CHAIN (args2
);
19951 if (!DECL_STATIC_FUNCTION_P (decl1
))
19954 args1
= TREE_CHAIN (args1
);
19958 /* If only one is a conversion operator, they are unordered. */
19959 if (DECL_CONV_FN_P (decl1
) != DECL_CONV_FN_P (decl2
))
19962 /* Consider the return type for a conversion function */
19963 if (DECL_CONV_FN_P (decl1
))
19965 args1
= tree_cons (NULL_TREE
, TREE_TYPE (TREE_TYPE (decl1
)), args1
);
19966 args2
= tree_cons (NULL_TREE
, TREE_TYPE (TREE_TYPE (decl2
)), args2
);
19970 processing_template_decl
++;
19976 /* Stop when an ellipsis is seen. */
19977 && args1
!= NULL_TREE
&& args2
!= NULL_TREE
)
19979 tree arg1
= TREE_VALUE (args1
);
19980 tree arg2
= TREE_VALUE (args2
);
19981 int deduce1
, deduce2
;
19987 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
19988 && TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
19990 /* When both arguments are pack expansions, we need only
19991 unify the patterns themselves. */
19992 arg1
= PACK_EXPANSION_PATTERN (arg1
);
19993 arg2
= PACK_EXPANSION_PATTERN (arg2
);
19995 /* This is the last comparison we need to do. */
19999 if (TREE_CODE (arg1
) == REFERENCE_TYPE
)
20001 ref1
= TYPE_REF_IS_RVALUE (arg1
) + 1;
20002 arg1
= TREE_TYPE (arg1
);
20003 quals1
= cp_type_quals (arg1
);
20006 if (TREE_CODE (arg2
) == REFERENCE_TYPE
)
20008 ref2
= TYPE_REF_IS_RVALUE (arg2
) + 1;
20009 arg2
= TREE_TYPE (arg2
);
20010 quals2
= cp_type_quals (arg2
);
20013 arg1
= TYPE_MAIN_VARIANT (arg1
);
20014 arg2
= TYPE_MAIN_VARIANT (arg2
);
20016 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
)
20018 int i
, len2
= list_length (args2
);
20019 tree parmvec
= make_tree_vec (1);
20020 tree argvec
= make_tree_vec (len2
);
20023 /* Setup the parameter vector, which contains only ARG1. */
20024 TREE_VEC_ELT (parmvec
, 0) = arg1
;
20026 /* Setup the argument vector, which contains the remaining
20028 for (i
= 0; i
< len2
; i
++, ta
= TREE_CHAIN (ta
))
20029 TREE_VEC_ELT (argvec
, i
) = TREE_VALUE (ta
);
20031 deduce1
= (unify_pack_expansion (tparms1
, targs1
, parmvec
,
20032 argvec
, DEDUCE_EXACT
,
20033 /*subr=*/true, /*explain_p=*/false)
20036 /* We cannot deduce in the other direction, because ARG1 is
20037 a pack expansion but ARG2 is not. */
20040 else if (TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
20042 int i
, len1
= list_length (args1
);
20043 tree parmvec
= make_tree_vec (1);
20044 tree argvec
= make_tree_vec (len1
);
20047 /* Setup the parameter vector, which contains only ARG1. */
20048 TREE_VEC_ELT (parmvec
, 0) = arg2
;
20050 /* Setup the argument vector, which contains the remaining
20052 for (i
= 0; i
< len1
; i
++, ta
= TREE_CHAIN (ta
))
20053 TREE_VEC_ELT (argvec
, i
) = TREE_VALUE (ta
);
20055 deduce2
= (unify_pack_expansion (tparms2
, targs2
, parmvec
,
20056 argvec
, DEDUCE_EXACT
,
20057 /*subr=*/true, /*explain_p=*/false)
20060 /* We cannot deduce in the other direction, because ARG2 is
20061 a pack expansion but ARG1 is not.*/
20067 /* The normal case, where neither argument is a pack
20069 deduce1
= (unify (tparms1
, targs1
, arg1
, arg2
,
20070 UNIFY_ALLOW_NONE
, /*explain_p=*/false)
20072 deduce2
= (unify (tparms2
, targs2
, arg2
, arg1
,
20073 UNIFY_ALLOW_NONE
, /*explain_p=*/false)
20077 /* If we couldn't deduce arguments for tparms1 to make arg1 match
20078 arg2, then arg2 is not as specialized as arg1. */
20084 /* "If, for a given type, deduction succeeds in both directions
20085 (i.e., the types are identical after the transformations above)
20086 and both P and A were reference types (before being replaced with
20087 the type referred to above):
20088 - if the type from the argument template was an lvalue reference and
20089 the type from the parameter template was not, the argument type is
20090 considered to be more specialized than the other; otherwise,
20091 - if the type from the argument template is more cv-qualified
20092 than the type from the parameter template (as described above),
20093 the argument type is considered to be more specialized than the other;
20095 - neither type is more specialized than the other." */
20097 if (deduce1
&& deduce2
)
20099 if (ref1
&& ref2
&& ref1
!= ref2
)
20106 else if (quals1
!= quals2
&& quals1
>= 0 && quals2
>= 0)
20108 if ((quals1
& quals2
) == quals2
)
20110 if ((quals1
& quals2
) == quals1
)
20115 if (lose1
&& lose2
)
20116 /* We've failed to deduce something in either direction.
20117 These must be unordered. */
20120 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
20121 || TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
20122 /* We have already processed all of the arguments in our
20123 handing of the pack expansion type. */
20126 args1
= TREE_CHAIN (args1
);
20127 args2
= TREE_CHAIN (args2
);
20130 /* "In most cases, all template parameters must have values in order for
20131 deduction to succeed, but for partial ordering purposes a template
20132 parameter may remain without a value provided it is not used in the
20133 types being used for partial ordering."
20135 Thus, if we are missing any of the targs1 we need to substitute into
20136 origs1, then pat2 is not as specialized as pat1. This can happen when
20137 there is a nondeduced context. */
20138 if (!lose2
&& check_undeduced_parms (targs1
, origs1
, args1
))
20140 if (!lose1
&& check_undeduced_parms (targs2
, origs2
, args2
))
20143 processing_template_decl
--;
20145 /* If both deductions succeed, the partial ordering selects the more
20146 constrained template. */
20147 if (!lose1
&& !lose2
)
20149 tree c1
= get_constraints (DECL_TEMPLATE_RESULT (pat1
));
20150 tree c2
= get_constraints (DECL_TEMPLATE_RESULT (pat2
));
20151 lose1
= !subsumes_constraints (c1
, c2
);
20152 lose2
= !subsumes_constraints (c2
, c1
);
20155 /* All things being equal, if the next argument is a pack expansion
20156 for one function but not for the other, prefer the
20157 non-variadic function. FIXME this is bogus; see c++/41958. */
20159 && args1
&& TREE_VALUE (args1
)
20160 && args2
&& TREE_VALUE (args2
))
20162 lose1
= TREE_CODE (TREE_VALUE (args1
)) == TYPE_PACK_EXPANSION
;
20163 lose2
= TREE_CODE (TREE_VALUE (args2
)) == TYPE_PACK_EXPANSION
;
20166 if (lose1
== lose2
)
20174 /* Determine which of two partial specializations of TMPL is more
20177 PAT1 is a TREE_LIST whose TREE_VALUE is the TEMPLATE_DECL corresponding
20178 to the first partial specialization. The TREE_PURPOSE is the
20179 innermost set of template parameters for the partial
20180 specialization. PAT2 is similar, but for the second template.
20182 Return 1 if the first partial specialization is more specialized;
20183 -1 if the second is more specialized; 0 if neither is more
20186 See [temp.class.order] for information about determining which of
20187 two templates is more specialized. */
20190 more_specialized_partial_spec (tree tmpl
, tree pat1
, tree pat2
)
20194 bool any_deductions
= false;
20196 tree tmpl1
= TREE_VALUE (pat1
);
20197 tree tmpl2
= TREE_VALUE (pat2
);
20198 tree parms1
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl1
);
20199 tree parms2
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl2
);
20200 tree specargs1
= TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (tmpl1
)));
20201 tree specargs2
= TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (tmpl2
)));
20203 /* Just like what happens for functions, if we are ordering between
20204 different template specializations, we may encounter dependent
20205 types in the arguments, and we need our dependency check functions
20206 to behave correctly. */
20207 ++processing_template_decl
;
20208 targs
= get_partial_spec_bindings (tmpl
, parms1
, specargs1
, specargs2
);
20212 any_deductions
= true;
20215 targs
= get_partial_spec_bindings (tmpl
, parms2
, specargs2
, specargs1
);
20219 any_deductions
= true;
20221 --processing_template_decl
;
20223 /* If both deductions succeed, the partial ordering selects the more
20224 constrained template. */
20225 if (!winner
&& any_deductions
)
20226 return more_constrained (tmpl1
, tmpl2
);
20228 /* In the case of a tie where at least one of the templates
20229 has a parameter pack at the end, the template with the most
20230 non-packed parameters wins. */
20233 && (template_args_variadic_p (TREE_PURPOSE (pat1
))
20234 || template_args_variadic_p (TREE_PURPOSE (pat2
))))
20236 tree args1
= INNERMOST_TEMPLATE_ARGS (TREE_PURPOSE (pat1
));
20237 tree args2
= INNERMOST_TEMPLATE_ARGS (TREE_PURPOSE (pat2
));
20238 int len1
= TREE_VEC_LENGTH (args1
);
20239 int len2
= TREE_VEC_LENGTH (args2
);
20241 /* We don't count the pack expansion at the end. */
20242 if (template_args_variadic_p (TREE_PURPOSE (pat1
)))
20244 if (template_args_variadic_p (TREE_PURPOSE (pat2
)))
20249 else if (len1
< len2
)
20256 /* Return the template arguments that will produce the function signature
20257 DECL from the function template FN, with the explicit template
20258 arguments EXPLICIT_ARGS. If CHECK_RETTYPE is true, the return type must
20259 also match. Return NULL_TREE if no satisfactory arguments could be
20263 get_bindings (tree fn
, tree decl
, tree explicit_args
, bool check_rettype
)
20265 int ntparms
= DECL_NTPARMS (fn
);
20266 tree targs
= make_tree_vec (ntparms
);
20267 tree decl_type
= TREE_TYPE (decl
);
20268 tree decl_arg_types
;
20270 unsigned int nargs
, ix
;
20273 gcc_assert (decl
!= DECL_TEMPLATE_RESULT (fn
));
20275 /* Never do unification on the 'this' parameter. */
20276 decl_arg_types
= skip_artificial_parms_for (decl
,
20277 TYPE_ARG_TYPES (decl_type
));
20279 nargs
= list_length (decl_arg_types
);
20280 args
= XALLOCAVEC (tree
, nargs
);
20281 for (arg
= decl_arg_types
, ix
= 0;
20282 arg
!= NULL_TREE
&& arg
!= void_list_node
;
20283 arg
= TREE_CHAIN (arg
), ++ix
)
20284 args
[ix
] = TREE_VALUE (arg
);
20286 if (fn_type_unification (fn
, explicit_args
, targs
,
20288 (check_rettype
|| DECL_CONV_FN_P (fn
)
20289 ? TREE_TYPE (decl_type
) : NULL_TREE
),
20290 DEDUCE_EXACT
, LOOKUP_NORMAL
, /*explain_p=*/false,
20292 == error_mark_node
)
20298 /* Return the innermost template arguments that, when applied to a partial
20299 specialization of TMPL whose innermost template parameters are
20300 TPARMS, and whose specialization arguments are SPEC_ARGS, yield the
20303 For example, suppose we have:
20305 template <class T, class U> struct S {};
20306 template <class T> struct S<T*, int> {};
20308 Then, suppose we want to get `S<double*, int>'. The TPARMS will be
20309 {T}, the SPEC_ARGS will be {T*, int} and the ARGS will be {double*,
20310 int}. The resulting vector will be {double}, indicating that `T'
20311 is bound to `double'. */
20314 get_partial_spec_bindings (tree tmpl
, tree tparms
, tree spec_args
, tree args
)
20316 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
20318 tree innermost_deduced_args
;
20320 innermost_deduced_args
= make_tree_vec (ntparms
);
20321 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
20323 deduced_args
= copy_node (args
);
20324 SET_TMPL_ARGS_LEVEL (deduced_args
,
20325 TMPL_ARGS_DEPTH (deduced_args
),
20326 innermost_deduced_args
);
20329 deduced_args
= innermost_deduced_args
;
20331 if (unify (tparms
, deduced_args
,
20332 INNERMOST_TEMPLATE_ARGS (spec_args
),
20333 INNERMOST_TEMPLATE_ARGS (args
),
20334 UNIFY_ALLOW_NONE
, /*explain_p=*/false))
20337 for (i
= 0; i
< ntparms
; ++i
)
20338 if (! TREE_VEC_ELT (innermost_deduced_args
, i
))
20341 /* Verify that nondeduced template arguments agree with the type
20342 obtained from argument deduction.
20346 struct A { typedef int X; };
20347 template <class T, class U> struct C {};
20348 template <class T> struct C<T, typename T::X> {};
20350 Then with the instantiation `C<A, int>', we can deduce that
20351 `T' is `A' but unify () does not check whether `typename T::X'
20353 spec_args
= tsubst (spec_args
, deduced_args
, tf_none
, NULL_TREE
);
20354 spec_args
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
20356 tf_none
, false, false);
20357 if (spec_args
== error_mark_node
20358 /* We only need to check the innermost arguments; the other
20359 arguments will always agree. */
20360 || !comp_template_args (INNERMOST_TEMPLATE_ARGS (spec_args
),
20361 INNERMOST_TEMPLATE_ARGS (args
)))
20364 /* Now that we have bindings for all of the template arguments,
20365 ensure that the arguments deduced for the template template
20366 parameters have compatible template parameter lists. See the use
20367 of template_template_parm_bindings_ok_p in fn_type_unification
20368 for more information. */
20369 if (!template_template_parm_bindings_ok_p (tparms
, deduced_args
))
20372 return deduced_args
;
20375 // Compare two function templates T1 and T2 by deducing bindings
20376 // from one against the other. If both deductions succeed, compare
20377 // constraints to see which is more constrained.
20379 more_specialized_inst (tree t1
, tree t2
)
20384 if (get_bindings (t1
, DECL_TEMPLATE_RESULT (t2
), NULL_TREE
, true))
20390 if (get_bindings (t2
, DECL_TEMPLATE_RESULT (t1
), NULL_TREE
, true))
20396 // If both deductions succeed, then one may be more constrained.
20397 if (count
== 2 && fate
== 0)
20398 fate
= more_constrained (t1
, t2
);
20403 /* TEMPLATES is a TREE_LIST. Each TREE_VALUE is a TEMPLATE_DECL.
20404 Return the TREE_LIST node with the most specialized template, if
20405 any. If there is no most specialized template, the error_mark_node
20408 Note that this function does not look at, or modify, the
20409 TREE_PURPOSE or TREE_TYPE of any of the nodes. Since the node
20410 returned is one of the elements of INSTANTIATIONS, callers may
20411 store information in the TREE_PURPOSE or TREE_TYPE of the nodes,
20412 and retrieve it from the value returned. */
20415 most_specialized_instantiation (tree templates
)
20419 ++processing_template_decl
;
20422 for (fn
= TREE_CHAIN (templates
); fn
; fn
= TREE_CHAIN (fn
))
20424 int fate
= more_specialized_inst (TREE_VALUE (champ
), TREE_VALUE (fn
));
20429 /* Equally specialized, move to next function. If there
20430 is no next function, nothing's most specialized. */
20431 fn
= TREE_CHAIN (fn
);
20439 /* Now verify that champ is better than everything earlier in the
20440 instantiation list. */
20441 for (fn
= templates
; fn
!= champ
; fn
= TREE_CHAIN (fn
)) {
20442 if (more_specialized_inst (TREE_VALUE (champ
), TREE_VALUE (fn
)) != 1)
20449 processing_template_decl
--;
20452 return error_mark_node
;
20457 /* If DECL is a specialization of some template, return the most
20458 general such template. Otherwise, returns NULL_TREE.
20460 For example, given:
20462 template <class T> struct S { template <class U> void f(U); };
20464 if TMPL is `template <class U> void S<int>::f(U)' this will return
20465 the full template. This function will not trace past partial
20466 specializations, however. For example, given in addition:
20468 template <class T> struct S<T*> { template <class U> void f(U); };
20470 if TMPL is `template <class U> void S<int*>::f(U)' this will return
20471 `template <class T> template <class U> S<T*>::f(U)'. */
20474 most_general_template (tree decl
)
20476 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
20478 if (tree tinfo
= get_template_info (decl
))
20479 decl
= TI_TEMPLATE (tinfo
);
20480 /* The TI_TEMPLATE can be an IDENTIFIER_NODE for a
20481 template friend, or a FIELD_DECL for a capture pack. */
20482 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
20486 /* Look for more and more general templates. */
20487 while (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
))
20489 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE in some cases.
20490 (See cp-tree.h for details.) */
20491 if (TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
20494 if (CLASS_TYPE_P (TREE_TYPE (decl
))
20495 && !TYPE_DECL_ALIAS_P (TYPE_NAME (TREE_TYPE (decl
)))
20496 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)))
20499 /* Stop if we run into an explicitly specialized class template. */
20500 if (!DECL_NAMESPACE_SCOPE_P (decl
)
20501 && DECL_CONTEXT (decl
)
20502 && CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (decl
)))
20505 decl
= DECL_TI_TEMPLATE (decl
);
20511 /* Return the most specialized of the template partial specializations
20512 which can produce TARGET, a specialization of some class or variable
20513 template. The value returned is actually a TREE_LIST; the TREE_VALUE is
20514 a TEMPLATE_DECL node corresponding to the partial specialization, while
20515 the TREE_PURPOSE is the set of template arguments that must be
20516 substituted into the template pattern in order to generate TARGET.
20518 If the choice of partial specialization is ambiguous, a diagnostic
20519 is issued, and the error_mark_node is returned. If there are no
20520 partial specializations matching TARGET, then NULL_TREE is
20521 returned, indicating that the primary template should be used. */
20524 most_specialized_partial_spec (tree target
, tsubst_flags_t complain
)
20526 tree list
= NULL_TREE
;
20531 tree outer_args
= NULL_TREE
;
20534 if (TYPE_P (target
))
20536 tree tinfo
= CLASSTYPE_TEMPLATE_INFO (target
);
20537 tmpl
= TI_TEMPLATE (tinfo
);
20538 args
= TI_ARGS (tinfo
);
20540 else if (TREE_CODE (target
) == TEMPLATE_ID_EXPR
)
20542 tmpl
= TREE_OPERAND (target
, 0);
20543 args
= TREE_OPERAND (target
, 1);
20545 else if (VAR_P (target
))
20547 tree tinfo
= DECL_TEMPLATE_INFO (target
);
20548 tmpl
= TI_TEMPLATE (tinfo
);
20549 args
= TI_ARGS (tinfo
);
20552 gcc_unreachable ();
20554 tree main_tmpl
= most_general_template (tmpl
);
20556 /* For determining which partial specialization to use, only the
20557 innermost args are interesting. */
20558 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
20560 outer_args
= strip_innermost_template_args (args
, 1);
20561 args
= INNERMOST_TEMPLATE_ARGS (args
);
20564 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (main_tmpl
); t
; t
= TREE_CHAIN (t
))
20566 tree partial_spec_args
;
20568 tree spec_tmpl
= TREE_VALUE (t
);
20570 partial_spec_args
= TREE_PURPOSE (t
);
20572 ++processing_template_decl
;
20576 /* Discard the outer levels of args, and then substitute in the
20577 template args from the enclosing class. */
20578 partial_spec_args
= INNERMOST_TEMPLATE_ARGS (partial_spec_args
);
20579 partial_spec_args
= tsubst_template_args
20580 (partial_spec_args
, outer_args
, tf_none
, NULL_TREE
);
20582 /* And the same for the partial specialization TEMPLATE_DECL. */
20583 spec_tmpl
= tsubst (spec_tmpl
, outer_args
, tf_none
, NULL_TREE
);
20586 partial_spec_args
=
20587 coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
20590 /*require_all_args=*/true,
20591 /*use_default_args=*/true);
20593 --processing_template_decl
;
20595 if (partial_spec_args
== error_mark_node
)
20596 return error_mark_node
;
20597 if (spec_tmpl
== error_mark_node
)
20598 return error_mark_node
;
20600 tree parms
= DECL_INNERMOST_TEMPLATE_PARMS (spec_tmpl
);
20601 spec_args
= get_partial_spec_bindings (tmpl
, parms
,
20607 spec_args
= add_to_template_args (outer_args
, spec_args
);
20609 /* Keep the candidate only if the constraints are satisfied,
20610 or if we're not compiling with concepts. */
20612 || constraints_satisfied_p (spec_tmpl
, spec_args
))
20614 list
= tree_cons (spec_args
, TREE_VALUE (t
), list
);
20615 TREE_TYPE (list
) = TREE_TYPE (t
);
20623 ambiguous_p
= false;
20626 t
= TREE_CHAIN (t
);
20627 for (; t
; t
= TREE_CHAIN (t
))
20629 fate
= more_specialized_partial_spec (tmpl
, champ
, t
);
20636 t
= TREE_CHAIN (t
);
20639 ambiguous_p
= true;
20648 for (t
= list
; t
&& t
!= champ
; t
= TREE_CHAIN (t
))
20650 fate
= more_specialized_partial_spec (tmpl
, champ
, t
);
20653 ambiguous_p
= true;
20661 char *spaces
= NULL
;
20662 if (!(complain
& tf_error
))
20663 return error_mark_node
;
20664 if (TYPE_P (target
))
20665 error ("ambiguous template instantiation for %q#T", target
);
20667 error ("ambiguous template instantiation for %q#D", target
);
20668 str
= ngettext ("candidate is:", "candidates are:", list_length (list
));
20669 for (t
= list
; t
; t
= TREE_CHAIN (t
))
20671 tree subst
= build_tree_list (TREE_VALUE (t
), TREE_PURPOSE (t
));
20672 inform (DECL_SOURCE_LOCATION (TREE_VALUE (t
)),
20673 "%s %#S", spaces
? spaces
: str
, subst
);
20674 spaces
= spaces
? spaces
: get_spaces (str
);
20677 return error_mark_node
;
20683 /* Explicitly instantiate DECL. */
20686 do_decl_instantiation (tree decl
, tree storage
)
20688 tree result
= NULL_TREE
;
20691 if (!decl
|| decl
== error_mark_node
)
20692 /* An error occurred, for which grokdeclarator has already issued
20693 an appropriate message. */
20695 else if (! DECL_LANG_SPECIFIC (decl
))
20697 error ("explicit instantiation of non-template %q#D", decl
);
20701 bool var_templ
= (DECL_TEMPLATE_INFO (decl
)
20702 && variable_template_p (DECL_TI_TEMPLATE (decl
)));
20704 if (VAR_P (decl
) && !var_templ
)
20706 /* There is an asymmetry here in the way VAR_DECLs and
20707 FUNCTION_DECLs are handled by grokdeclarator. In the case of
20708 the latter, the DECL we get back will be marked as a
20709 template instantiation, and the appropriate
20710 DECL_TEMPLATE_INFO will be set up. This does not happen for
20711 VAR_DECLs so we do the lookup here. Probably, grokdeclarator
20712 should handle VAR_DECLs as it currently handles
20714 if (!DECL_CLASS_SCOPE_P (decl
))
20716 error ("%qD is not a static data member of a class template", decl
);
20719 result
= lookup_field (DECL_CONTEXT (decl
), DECL_NAME (decl
), 0, false);
20720 if (!result
|| !VAR_P (result
))
20722 error ("no matching template for %qD found", decl
);
20725 if (!same_type_p (TREE_TYPE (result
), TREE_TYPE (decl
)))
20727 error ("type %qT for explicit instantiation %qD does not match "
20728 "declared type %qT", TREE_TYPE (result
), decl
,
20733 else if (TREE_CODE (decl
) != FUNCTION_DECL
&& !var_templ
)
20735 error ("explicit instantiation of %q#D", decl
);
20741 /* Check for various error cases. Note that if the explicit
20742 instantiation is valid the RESULT will currently be marked as an
20743 *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set
20744 until we get here. */
20746 if (DECL_TEMPLATE_SPECIALIZATION (result
))
20748 /* DR 259 [temp.spec].
20750 Both an explicit instantiation and a declaration of an explicit
20751 specialization shall not appear in a program unless the explicit
20752 instantiation follows a declaration of the explicit specialization.
20754 For a given set of template parameters, if an explicit
20755 instantiation of a template appears after a declaration of an
20756 explicit specialization for that template, the explicit
20757 instantiation has no effect. */
20760 else if (DECL_EXPLICIT_INSTANTIATION (result
))
20764 No program shall explicitly instantiate any template more
20767 We check DECL_NOT_REALLY_EXTERN so as not to complain when
20768 the first instantiation was `extern' and the second is not,
20769 and EXTERN_P for the opposite case. */
20770 if (DECL_NOT_REALLY_EXTERN (result
) && !extern_p
)
20771 permerror (input_location
, "duplicate explicit instantiation of %q#D", result
);
20772 /* If an "extern" explicit instantiation follows an ordinary
20773 explicit instantiation, the template is instantiated. */
20777 else if (!DECL_IMPLICIT_INSTANTIATION (result
))
20779 error ("no matching template for %qD found", result
);
20782 else if (!DECL_TEMPLATE_INFO (result
))
20784 permerror (input_location
, "explicit instantiation of non-template %q#D", result
);
20788 if (storage
== NULL_TREE
)
20790 else if (storage
== ridpointers
[(int) RID_EXTERN
])
20792 if (!in_system_header_at (input_location
) && (cxx_dialect
== cxx98
))
20793 pedwarn (input_location
, OPT_Wpedantic
,
20794 "ISO C++ 1998 forbids the use of %<extern%> on explicit "
20799 error ("storage class %qD applied to template instantiation", storage
);
20801 check_explicit_instantiation_namespace (result
);
20802 mark_decl_instantiated (result
, extern_p
);
20804 instantiate_decl (result
, /*defer_ok=*/1,
20805 /*expl_inst_class_mem_p=*/false);
20809 mark_class_instantiated (tree t
, int extern_p
)
20811 SET_CLASSTYPE_EXPLICIT_INSTANTIATION (t
);
20812 SET_CLASSTYPE_INTERFACE_KNOWN (t
);
20813 CLASSTYPE_INTERFACE_ONLY (t
) = extern_p
;
20814 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (t
)) = extern_p
;
20817 CLASSTYPE_DEBUG_REQUESTED (t
) = 1;
20818 rest_of_type_compilation (t
, 1);
20822 /* Called from do_type_instantiation through binding_table_foreach to
20823 do recursive instantiation for the type bound in ENTRY. */
20825 bt_instantiate_type_proc (binding_entry entry
, void *data
)
20827 tree storage
= *(tree
*) data
;
20829 if (MAYBE_CLASS_TYPE_P (entry
->type
)
20830 && !uses_template_parms (CLASSTYPE_TI_ARGS (entry
->type
)))
20831 do_type_instantiation (TYPE_MAIN_DECL (entry
->type
), storage
, 0);
20834 /* Called from do_type_instantiation to instantiate a member
20835 (a member function or a static member variable) of an
20836 explicitly instantiated class template. */
20838 instantiate_class_member (tree decl
, int extern_p
)
20840 mark_decl_instantiated (decl
, extern_p
);
20842 instantiate_decl (decl
, /*defer_ok=*/1,
20843 /*expl_inst_class_mem_p=*/true);
20846 /* Perform an explicit instantiation of template class T. STORAGE, if
20847 non-null, is the RID for extern, inline or static. COMPLAIN is
20848 nonzero if this is called from the parser, zero if called recursively,
20849 since the standard is unclear (as detailed below). */
20852 do_type_instantiation (tree t
, tree storage
, tsubst_flags_t complain
)
20857 int previous_instantiation_extern_p
= 0;
20859 if (TREE_CODE (t
) == TYPE_DECL
)
20862 if (! CLASS_TYPE_P (t
) || ! CLASSTYPE_TEMPLATE_INFO (t
))
20865 (TYPE_TEMPLATE_INFO (t
)) ? TYPE_TI_TEMPLATE (t
) : NULL
;
20867 error ("explicit instantiation of non-class template %qD", tmpl
);
20869 error ("explicit instantiation of non-template type %qT", t
);
20875 if (!COMPLETE_TYPE_P (t
))
20877 if (complain
& tf_error
)
20878 error ("explicit instantiation of %q#T before definition of template",
20883 if (storage
!= NULL_TREE
)
20885 if (!in_system_header_at (input_location
))
20887 if (storage
== ridpointers
[(int) RID_EXTERN
])
20889 if (cxx_dialect
== cxx98
)
20890 pedwarn (input_location
, OPT_Wpedantic
,
20891 "ISO C++ 1998 forbids the use of %<extern%> on "
20892 "explicit instantiations");
20895 pedwarn (input_location
, OPT_Wpedantic
,
20896 "ISO C++ forbids the use of %qE"
20897 " on explicit instantiations", storage
);
20900 if (storage
== ridpointers
[(int) RID_INLINE
])
20902 else if (storage
== ridpointers
[(int) RID_EXTERN
])
20904 else if (storage
== ridpointers
[(int) RID_STATIC
])
20908 error ("storage class %qD applied to template instantiation",
20914 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
20916 /* DR 259 [temp.spec].
20918 Both an explicit instantiation and a declaration of an explicit
20919 specialization shall not appear in a program unless the explicit
20920 instantiation follows a declaration of the explicit specialization.
20922 For a given set of template parameters, if an explicit
20923 instantiation of a template appears after a declaration of an
20924 explicit specialization for that template, the explicit
20925 instantiation has no effect. */
20928 else if (CLASSTYPE_EXPLICIT_INSTANTIATION (t
))
20932 No program shall explicitly instantiate any template more
20935 If PREVIOUS_INSTANTIATION_EXTERN_P, then the first explicit
20936 instantiation was `extern'. If EXTERN_P then the second is.
20937 These cases are OK. */
20938 previous_instantiation_extern_p
= CLASSTYPE_INTERFACE_ONLY (t
);
20940 if (!previous_instantiation_extern_p
&& !extern_p
20941 && (complain
& tf_error
))
20942 permerror (input_location
, "duplicate explicit instantiation of %q#T", t
);
20944 /* If we've already instantiated the template, just return now. */
20945 if (!CLASSTYPE_INTERFACE_ONLY (t
))
20949 check_explicit_instantiation_namespace (TYPE_NAME (t
));
20950 mark_class_instantiated (t
, extern_p
);
20958 /* In contrast to implicit instantiation, where only the
20959 declarations, and not the definitions, of members are
20960 instantiated, we have here:
20964 The explicit instantiation of a class template specialization
20965 implies the instantiation of all of its members not
20966 previously explicitly specialized in the translation unit
20967 containing the explicit instantiation.
20969 Of course, we can't instantiate member template classes, since
20970 we don't have any arguments for them. Note that the standard
20971 is unclear on whether the instantiation of the members are
20972 *explicit* instantiations or not. However, the most natural
20973 interpretation is that it should be an explicit instantiation. */
20976 for (tmp
= TYPE_METHODS (t
); tmp
; tmp
= DECL_CHAIN (tmp
))
20977 if (TREE_CODE (tmp
) == FUNCTION_DECL
20978 && DECL_TEMPLATE_INSTANTIATION (tmp
))
20979 instantiate_class_member (tmp
, extern_p
);
20981 for (tmp
= TYPE_FIELDS (t
); tmp
; tmp
= DECL_CHAIN (tmp
))
20982 if (VAR_P (tmp
) && DECL_TEMPLATE_INSTANTIATION (tmp
))
20983 instantiate_class_member (tmp
, extern_p
);
20985 if (CLASSTYPE_NESTED_UTDS (t
))
20986 binding_table_foreach (CLASSTYPE_NESTED_UTDS (t
),
20987 bt_instantiate_type_proc
, &storage
);
20991 /* Given a function DECL, which is a specialization of TMPL, modify
20992 DECL to be a re-instantiation of TMPL with the same template
20993 arguments. TMPL should be the template into which tsubst'ing
20994 should occur for DECL, not the most general template.
20996 One reason for doing this is a scenario like this:
20999 void f(const T&, int i);
21001 void g() { f(3, 7); }
21004 void f(const T& t, const int i) { }
21006 Note that when the template is first instantiated, with
21007 instantiate_template, the resulting DECL will have no name for the
21008 first parameter, and the wrong type for the second. So, when we go
21009 to instantiate the DECL, we regenerate it. */
21012 regenerate_decl_from_template (tree decl
, tree tmpl
)
21014 /* The arguments used to instantiate DECL, from the most general
21019 args
= DECL_TI_ARGS (decl
);
21020 code_pattern
= DECL_TEMPLATE_RESULT (tmpl
);
21022 /* Make sure that we can see identifiers, and compute access
21024 push_access_scope (decl
);
21026 if (TREE_CODE (decl
) == FUNCTION_DECL
)
21034 args_depth
= TMPL_ARGS_DEPTH (args
);
21035 parms_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
21036 if (args_depth
> parms_depth
)
21037 args
= get_innermost_template_args (args
, parms_depth
);
21039 specs
= tsubst_exception_specification (TREE_TYPE (code_pattern
),
21040 args
, tf_error
, NULL_TREE
,
21041 /*defer_ok*/false);
21042 if (specs
&& specs
!= error_mark_node
)
21043 TREE_TYPE (decl
) = build_exception_variant (TREE_TYPE (decl
),
21046 /* Merge parameter declarations. */
21047 decl_parm
= skip_artificial_parms_for (decl
,
21048 DECL_ARGUMENTS (decl
));
21050 = skip_artificial_parms_for (code_pattern
,
21051 DECL_ARGUMENTS (code_pattern
));
21052 while (decl_parm
&& !DECL_PACK_P (pattern_parm
))
21057 if (DECL_NAME (decl_parm
) != DECL_NAME (pattern_parm
))
21058 DECL_NAME (decl_parm
) = DECL_NAME (pattern_parm
);
21059 parm_type
= tsubst (TREE_TYPE (pattern_parm
), args
, tf_error
,
21061 parm_type
= type_decays_to (parm_type
);
21062 if (!same_type_p (TREE_TYPE (decl_parm
), parm_type
))
21063 TREE_TYPE (decl_parm
) = parm_type
;
21064 attributes
= DECL_ATTRIBUTES (pattern_parm
);
21065 if (DECL_ATTRIBUTES (decl_parm
) != attributes
)
21067 DECL_ATTRIBUTES (decl_parm
) = attributes
;
21068 cplus_decl_attributes (&decl_parm
, attributes
, /*flags=*/0);
21070 decl_parm
= DECL_CHAIN (decl_parm
);
21071 pattern_parm
= DECL_CHAIN (pattern_parm
);
21073 /* Merge any parameters that match with the function parameter
21075 if (pattern_parm
&& DECL_PACK_P (pattern_parm
))
21078 tree expanded_types
;
21079 /* Expand the TYPE_PACK_EXPANSION that provides the types for
21080 the parameters in this function parameter pack. */
21081 expanded_types
= tsubst_pack_expansion (TREE_TYPE (pattern_parm
),
21082 args
, tf_error
, NULL_TREE
);
21083 len
= TREE_VEC_LENGTH (expanded_types
);
21084 for (i
= 0; i
< len
; i
++)
21089 if (DECL_NAME (decl_parm
) != DECL_NAME (pattern_parm
))
21090 /* Rename the parameter to include the index. */
21091 DECL_NAME (decl_parm
) =
21092 make_ith_pack_parameter_name (DECL_NAME (pattern_parm
), i
);
21093 parm_type
= TREE_VEC_ELT (expanded_types
, i
);
21094 parm_type
= type_decays_to (parm_type
);
21095 if (!same_type_p (TREE_TYPE (decl_parm
), parm_type
))
21096 TREE_TYPE (decl_parm
) = parm_type
;
21097 attributes
= DECL_ATTRIBUTES (pattern_parm
);
21098 if (DECL_ATTRIBUTES (decl_parm
) != attributes
)
21100 DECL_ATTRIBUTES (decl_parm
) = attributes
;
21101 cplus_decl_attributes (&decl_parm
, attributes
, /*flags=*/0);
21103 decl_parm
= DECL_CHAIN (decl_parm
);
21106 /* Merge additional specifiers from the CODE_PATTERN. */
21107 if (DECL_DECLARED_INLINE_P (code_pattern
)
21108 && !DECL_DECLARED_INLINE_P (decl
))
21109 DECL_DECLARED_INLINE_P (decl
) = 1;
21111 else if (VAR_P (decl
))
21113 DECL_INITIAL (decl
) =
21114 tsubst_expr (DECL_INITIAL (code_pattern
), args
,
21115 tf_error
, DECL_TI_TEMPLATE (decl
),
21116 /*integral_constant_expression_p=*/false);
21117 if (VAR_HAD_UNKNOWN_BOUND (decl
))
21118 TREE_TYPE (decl
) = tsubst (TREE_TYPE (code_pattern
), args
,
21119 tf_error
, DECL_TI_TEMPLATE (decl
));
21122 gcc_unreachable ();
21124 pop_access_scope (decl
);
21127 /* Return the TEMPLATE_DECL into which DECL_TI_ARGS(DECL) should be
21128 substituted to get DECL. */
21131 template_for_substitution (tree decl
)
21133 tree tmpl
= DECL_TI_TEMPLATE (decl
);
21135 /* Set TMPL to the template whose DECL_TEMPLATE_RESULT is the pattern
21136 for the instantiation. This is not always the most general
21137 template. Consider, for example:
21140 struct S { template <class U> void f();
21141 template <> void f<int>(); };
21143 and an instantiation of S<double>::f<int>. We want TD to be the
21144 specialization S<T>::f<int>, not the more general S<T>::f<U>. */
21145 while (/* An instantiation cannot have a definition, so we need a
21146 more general template. */
21147 DECL_TEMPLATE_INSTANTIATION (tmpl
)
21148 /* We must also deal with friend templates. Given:
21150 template <class T> struct S {
21151 template <class U> friend void f() {};
21154 S<int>::f<U> say, is not an instantiation of S<T>::f<U>,
21155 so far as the language is concerned, but that's still
21156 where we get the pattern for the instantiation from. On
21157 other hand, if the definition comes outside the class, say:
21159 template <class T> struct S {
21160 template <class U> friend void f();
21162 template <class U> friend void f() {}
21164 we don't need to look any further. That's what the check for
21165 DECL_INITIAL is for. */
21166 || (TREE_CODE (decl
) == FUNCTION_DECL
21167 && DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (tmpl
)
21168 && !DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl
))))
21170 /* The present template, TD, should not be a definition. If it
21171 were a definition, we should be using it! Note that we
21172 cannot restructure the loop to just keep going until we find
21173 a template with a definition, since that might go too far if
21174 a specialization was declared, but not defined. */
21176 /* Fetch the more general template. */
21177 tmpl
= DECL_TI_TEMPLATE (tmpl
);
21183 /* Returns true if we need to instantiate this template instance even if we
21184 know we aren't going to emit it. */
21187 always_instantiate_p (tree decl
)
21189 /* We always instantiate inline functions so that we can inline them. An
21190 explicit instantiation declaration prohibits implicit instantiation of
21191 non-inline functions. With high levels of optimization, we would
21192 normally inline non-inline functions -- but we're not allowed to do
21193 that for "extern template" functions. Therefore, we check
21194 DECL_DECLARED_INLINE_P, rather than possibly_inlined_p. */
21195 return ((TREE_CODE (decl
) == FUNCTION_DECL
21196 && (DECL_DECLARED_INLINE_P (decl
)
21197 || type_uses_auto (TREE_TYPE (TREE_TYPE (decl
)))))
21198 /* And we need to instantiate static data members so that
21199 their initializers are available in integral constant
21202 && decl_maybe_constant_var_p (decl
)));
21205 /* If FN has a noexcept-specifier that hasn't been instantiated yet,
21206 instantiate it now, modifying TREE_TYPE (fn). */
21209 maybe_instantiate_noexcept (tree fn
)
21211 tree fntype
, spec
, noex
, clone
;
21213 /* Don't instantiate a noexcept-specification from template context. */
21214 if (processing_template_decl
)
21217 if (DECL_CLONED_FUNCTION_P (fn
))
21218 fn
= DECL_CLONED_FUNCTION (fn
);
21219 fntype
= TREE_TYPE (fn
);
21220 spec
= TYPE_RAISES_EXCEPTIONS (fntype
);
21222 if (!spec
|| !TREE_PURPOSE (spec
))
21225 noex
= TREE_PURPOSE (spec
);
21227 if (TREE_CODE (noex
) == DEFERRED_NOEXCEPT
)
21229 if (DEFERRED_NOEXCEPT_PATTERN (noex
) == NULL_TREE
)
21230 spec
= get_defaulted_eh_spec (fn
);
21231 else if (push_tinst_level (fn
))
21233 push_access_scope (fn
);
21234 push_deferring_access_checks (dk_no_deferred
);
21235 input_location
= DECL_SOURCE_LOCATION (fn
);
21236 noex
= tsubst_copy_and_build (DEFERRED_NOEXCEPT_PATTERN (noex
),
21237 DEFERRED_NOEXCEPT_ARGS (noex
),
21238 tf_warning_or_error
, fn
,
21239 /*function_p=*/false,
21240 /*integral_constant_expression_p=*/true);
21241 pop_deferring_access_checks ();
21242 pop_access_scope (fn
);
21243 pop_tinst_level ();
21244 spec
= build_noexcept_spec (noex
, tf_warning_or_error
);
21245 if (spec
== error_mark_node
)
21246 spec
= noexcept_false_spec
;
21249 spec
= noexcept_false_spec
;
21251 TREE_TYPE (fn
) = build_exception_variant (fntype
, spec
);
21254 FOR_EACH_CLONE (clone
, fn
)
21256 if (TREE_TYPE (clone
) == fntype
)
21257 TREE_TYPE (clone
) = TREE_TYPE (fn
);
21259 TREE_TYPE (clone
) = build_exception_variant (TREE_TYPE (clone
), spec
);
21263 /* Produce the definition of D, a _DECL generated from a template. If
21264 DEFER_OK is nonzero, then we don't have to actually do the
21265 instantiation now; we just have to do it sometime. Normally it is
21266 an error if this is an explicit instantiation but D is undefined.
21267 EXPL_INST_CLASS_MEM_P is true iff D is a member of an
21268 explicitly instantiated class template. */
21271 instantiate_decl (tree d
, int defer_ok
,
21272 bool expl_inst_class_mem_p
)
21274 tree tmpl
= DECL_TI_TEMPLATE (d
);
21281 bool pattern_defined
;
21282 location_t saved_loc
= input_location
;
21283 int saved_unevaluated_operand
= cp_unevaluated_operand
;
21284 int saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
21288 bool nested
= false;
21290 /* This function should only be used to instantiate templates for
21291 functions and static member variables. */
21292 gcc_assert (VAR_OR_FUNCTION_DECL_P (d
));
21294 /* A concept is never instantiated. */
21295 gcc_assert (!DECL_DECLARED_CONCEPT_P (d
));
21297 /* Variables are never deferred; if instantiation is required, they
21298 are instantiated right away. That allows for better code in the
21299 case that an expression refers to the value of the variable --
21300 if the variable has a constant value the referring expression can
21301 take advantage of that fact. */
21303 || DECL_DECLARED_CONSTEXPR_P (d
))
21306 /* Don't instantiate cloned functions. Instead, instantiate the
21307 functions they cloned. */
21308 if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_CLONED_FUNCTION_P (d
))
21309 d
= DECL_CLONED_FUNCTION (d
);
21311 if (DECL_TEMPLATE_INSTANTIATED (d
)
21312 || (TREE_CODE (d
) == FUNCTION_DECL
21313 && DECL_DEFAULTED_FN (d
) && DECL_INITIAL (d
))
21314 || DECL_TEMPLATE_SPECIALIZATION (d
))
21315 /* D has already been instantiated or explicitly specialized, so
21316 there's nothing for us to do here.
21318 It might seem reasonable to check whether or not D is an explicit
21319 instantiation, and, if so, stop here. But when an explicit
21320 instantiation is deferred until the end of the compilation,
21321 DECL_EXPLICIT_INSTANTIATION is set, even though we still need to do
21322 the instantiation. */
21325 /* Check to see whether we know that this template will be
21326 instantiated in some other file, as with "extern template"
21328 external_p
= (DECL_INTERFACE_KNOWN (d
) && DECL_REALLY_EXTERN (d
));
21330 /* In general, we do not instantiate such templates. */
21331 if (external_p
&& !always_instantiate_p (d
))
21334 gen_tmpl
= most_general_template (tmpl
);
21335 gen_args
= DECL_TI_ARGS (d
);
21337 if (tmpl
!= gen_tmpl
)
21338 /* We should already have the extra args. */
21339 gcc_assert (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (gen_tmpl
))
21340 == TMPL_ARGS_DEPTH (gen_args
));
21341 /* And what's in the hash table should match D. */
21342 gcc_assert ((spec
= retrieve_specialization (gen_tmpl
, gen_args
, 0)) == d
21343 || spec
== NULL_TREE
);
21345 /* This needs to happen before any tsubsting. */
21346 if (! push_tinst_level (d
))
21349 timevar_push (TV_TEMPLATE_INST
);
21351 /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern
21352 for the instantiation. */
21353 td
= template_for_substitution (d
);
21354 code_pattern
= DECL_TEMPLATE_RESULT (td
);
21356 /* We should never be trying to instantiate a member of a class
21357 template or partial specialization. */
21358 gcc_assert (d
!= code_pattern
);
21360 if ((DECL_NAMESPACE_SCOPE_P (d
) && !DECL_INITIALIZED_IN_CLASS_P (d
))
21361 || DECL_TEMPLATE_SPECIALIZATION (td
))
21362 /* In the case of a friend template whose definition is provided
21363 outside the class, we may have too many arguments. Drop the
21364 ones we don't need. The same is true for specializations. */
21365 args
= get_innermost_template_args
21366 (gen_args
, TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (td
)));
21370 if (TREE_CODE (d
) == FUNCTION_DECL
)
21372 deleted_p
= DECL_DELETED_FN (code_pattern
);
21373 pattern_defined
= (DECL_SAVED_TREE (code_pattern
) != NULL_TREE
21374 || DECL_DEFAULTED_OUTSIDE_CLASS_P (code_pattern
)
21380 pattern_defined
= ! DECL_IN_AGGR_P (code_pattern
);
21383 /* We may be in the middle of deferred access check. Disable it now. */
21384 push_deferring_access_checks (dk_no_deferred
);
21386 /* Unless an explicit instantiation directive has already determined
21387 the linkage of D, remember that a definition is available for
21389 if (pattern_defined
21390 && !DECL_INTERFACE_KNOWN (d
)
21391 && !DECL_NOT_REALLY_EXTERN (d
))
21392 mark_definable (d
);
21394 DECL_SOURCE_LOCATION (td
) = DECL_SOURCE_LOCATION (code_pattern
);
21395 DECL_SOURCE_LOCATION (d
) = DECL_SOURCE_LOCATION (code_pattern
);
21396 input_location
= DECL_SOURCE_LOCATION (d
);
21398 /* If D is a member of an explicitly instantiated class template,
21399 and no definition is available, treat it like an implicit
21401 if (!pattern_defined
&& expl_inst_class_mem_p
21402 && DECL_EXPLICIT_INSTANTIATION (d
))
21404 /* Leave linkage flags alone on instantiations with anonymous
21406 if (TREE_PUBLIC (d
))
21408 DECL_NOT_REALLY_EXTERN (d
) = 0;
21409 DECL_INTERFACE_KNOWN (d
) = 0;
21411 SET_DECL_IMPLICIT_INSTANTIATION (d
);
21414 /* Defer all other templates, unless we have been explicitly
21415 forbidden from doing so. */
21416 if (/* If there is no definition, we cannot instantiate the
21419 /* If it's OK to postpone instantiation, do so. */
21421 /* If this is a static data member that will be defined
21422 elsewhere, we don't want to instantiate the entire data
21423 member, but we do want to instantiate the initializer so that
21424 we can substitute that elsewhere. */
21425 || (external_p
&& VAR_P (d
))
21426 /* Handle here a deleted function too, avoid generating
21427 its body (c++/61080). */
21430 /* The definition of the static data member is now required so
21431 we must substitute the initializer. */
21433 && !DECL_INITIAL (d
)
21434 && DECL_INITIAL (code_pattern
))
21438 bool const_init
= false;
21439 bool enter_context
= DECL_CLASS_SCOPE_P (d
);
21441 ns
= decl_namespace_context (d
);
21442 push_nested_namespace (ns
);
21444 push_nested_class (DECL_CONTEXT (d
));
21445 init
= tsubst_expr (DECL_INITIAL (code_pattern
),
21447 tf_warning_or_error
, NULL_TREE
,
21448 /*integral_constant_expression_p=*/false);
21449 /* If instantiating the initializer involved instantiating this
21450 again, don't call cp_finish_decl twice. */
21451 if (!DECL_INITIAL (d
))
21453 /* Make sure the initializer is still constant, in case of
21454 circular dependency (template/instantiate6.C). */
21456 = DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (code_pattern
);
21457 cp_finish_decl (d
, init
, /*init_const_expr_p=*/const_init
,
21458 /*asmspec_tree=*/NULL_TREE
,
21459 LOOKUP_ONLYCONVERTING
);
21462 pop_nested_class ();
21463 pop_nested_namespace (ns
);
21466 /* We restore the source position here because it's used by
21467 add_pending_template. */
21468 input_location
= saved_loc
;
21470 if (at_eof
&& !pattern_defined
21471 && DECL_EXPLICIT_INSTANTIATION (d
)
21472 && DECL_NOT_REALLY_EXTERN (d
))
21475 The definition of a non-exported function template, a
21476 non-exported member function template, or a non-exported
21477 member function or static data member of a class template
21478 shall be present in every translation unit in which it is
21479 explicitly instantiated. */
21480 permerror (input_location
, "explicit instantiation of %qD "
21481 "but no definition available", d
);
21483 /* If we're in unevaluated context, we just wanted to get the
21484 constant value; this isn't an odr use, so don't queue
21485 a full instantiation. */
21486 if (cp_unevaluated_operand
!= 0)
21488 /* ??? Historically, we have instantiated inline functions, even
21489 when marked as "extern template". */
21490 if (!(external_p
&& VAR_P (d
)))
21491 add_pending_template (d
);
21494 /* Tell the repository that D is available in this translation unit
21495 -- and see if it is supposed to be instantiated here. */
21496 if (TREE_PUBLIC (d
) && !DECL_REALLY_EXTERN (d
) && !repo_emit_p (d
))
21498 /* In a PCH file, despite the fact that the repository hasn't
21499 requested instantiation in the PCH it is still possible that
21500 an instantiation will be required in a file that includes the
21503 add_pending_template (d
);
21504 /* Instantiate inline functions so that the inliner can do its
21505 job, even though we'll not be emitting a copy of this
21507 if (!(TREE_CODE (d
) == FUNCTION_DECL
&& possibly_inlined_p (d
)))
21511 fn_context
= decl_function_context (d
);
21512 nested
= (current_function_decl
!= NULL_TREE
);
21513 vec
<tree
> omp_privatization_save
;
21515 save_omp_privatization_clauses (omp_privatization_save
);
21518 push_to_top_level ();
21522 push_function_context ();
21523 cp_unevaluated_operand
= 0;
21524 c_inhibit_evaluation_warnings
= 0;
21527 /* Mark D as instantiated so that recursive calls to
21528 instantiate_decl do not try to instantiate it again. */
21529 DECL_TEMPLATE_INSTANTIATED (d
) = 1;
21531 /* Regenerate the declaration in case the template has been modified
21532 by a subsequent redeclaration. */
21533 regenerate_decl_from_template (d
, td
);
21535 /* We already set the file and line above. Reset them now in case
21536 they changed as a result of calling regenerate_decl_from_template. */
21537 input_location
= DECL_SOURCE_LOCATION (d
);
21542 bool const_init
= false;
21544 /* Clear out DECL_RTL; whatever was there before may not be right
21545 since we've reset the type of the declaration. */
21546 SET_DECL_RTL (d
, NULL
);
21547 DECL_IN_AGGR_P (d
) = 0;
21549 /* The initializer is placed in DECL_INITIAL by
21550 regenerate_decl_from_template so we don't need to
21551 push/pop_access_scope again here. Pull it out so that
21552 cp_finish_decl can process it. */
21553 init
= DECL_INITIAL (d
);
21554 DECL_INITIAL (d
) = NULL_TREE
;
21555 DECL_INITIALIZED_P (d
) = 0;
21557 /* Clear DECL_EXTERNAL so that cp_finish_decl will process the
21558 initializer. That function will defer actual emission until
21559 we have a chance to determine linkage. */
21560 DECL_EXTERNAL (d
) = 0;
21562 /* Enter the scope of D so that access-checking works correctly. */
21563 bool enter_context
= DECL_CLASS_SCOPE_P (d
);
21565 push_nested_class (DECL_CONTEXT (d
));
21567 const_init
= DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (code_pattern
);
21568 cp_finish_decl (d
, init
, const_init
, NULL_TREE
, 0);
21571 pop_nested_class ();
21573 if (variable_template_p (td
))
21574 note_variable_template_instantiation (d
);
21576 else if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_DEFAULTED_FN (code_pattern
))
21577 synthesize_method (d
);
21578 else if (TREE_CODE (d
) == FUNCTION_DECL
)
21580 hash_map
<tree
, tree
> *saved_local_specializations
;
21584 tree block
= NULL_TREE
;
21586 /* Save away the current list, in case we are instantiating one
21587 template from within the body of another. */
21588 saved_local_specializations
= local_specializations
;
21590 /* Set up the list of local specializations. */
21591 local_specializations
= new hash_map
<tree
, tree
>;
21593 /* Set up context. */
21594 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
)
21595 && TREE_CODE (DECL_CONTEXT (code_pattern
)) == FUNCTION_DECL
)
21596 block
= push_stmt_list ();
21598 start_preparsed_function (d
, NULL_TREE
, SF_PRE_PARSED
);
21600 /* Some typedefs referenced from within the template code need to be
21601 access checked at template instantiation time, i.e now. These
21602 types were added to the template at parsing time. Let's get those
21603 and perform the access checks then. */
21604 perform_typedefs_access_check (DECL_TEMPLATE_RESULT (gen_tmpl
),
21607 /* Create substitution entries for the parameters. */
21608 subst_decl
= DECL_TEMPLATE_RESULT (template_for_substitution (d
));
21609 tmpl_parm
= DECL_ARGUMENTS (subst_decl
);
21610 spec_parm
= DECL_ARGUMENTS (d
);
21611 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (d
))
21613 register_local_specialization (spec_parm
, tmpl_parm
);
21614 spec_parm
= skip_artificial_parms_for (d
, spec_parm
);
21615 tmpl_parm
= skip_artificial_parms_for (subst_decl
, tmpl_parm
);
21617 for (; tmpl_parm
; tmpl_parm
= DECL_CHAIN (tmpl_parm
))
21619 if (!DECL_PACK_P (tmpl_parm
))
21621 register_local_specialization (spec_parm
, tmpl_parm
);
21622 spec_parm
= DECL_CHAIN (spec_parm
);
21626 /* Register the (value) argument pack as a specialization of
21627 TMPL_PARM, then move on. */
21628 tree argpack
= extract_fnparm_pack (tmpl_parm
, &spec_parm
);
21629 register_local_specialization (argpack
, tmpl_parm
);
21632 gcc_assert (!spec_parm
);
21634 /* Substitute into the body of the function. */
21635 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
))
21636 tsubst_omp_udr (DECL_SAVED_TREE (code_pattern
), args
,
21637 tf_warning_or_error
, tmpl
);
21640 tsubst_expr (DECL_SAVED_TREE (code_pattern
), args
,
21641 tf_warning_or_error
, tmpl
,
21642 /*integral_constant_expression_p=*/false);
21644 /* Set the current input_location to the end of the function
21645 so that finish_function knows where we are. */
21647 = DECL_STRUCT_FUNCTION (code_pattern
)->function_end_locus
;
21649 /* Remember if we saw an infinite loop in the template. */
21650 current_function_infinite_loop
21651 = DECL_STRUCT_FUNCTION (code_pattern
)->language
->infinite_loop
;
21654 /* We don't need the local specializations any more. */
21655 delete local_specializations
;
21656 local_specializations
= saved_local_specializations
;
21658 /* Finish the function. */
21659 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
)
21660 && TREE_CODE (DECL_CONTEXT (code_pattern
)) == FUNCTION_DECL
)
21661 DECL_SAVED_TREE (d
) = pop_stmt_list (block
);
21664 d
= finish_function (0);
21665 expand_or_defer_fn (d
);
21668 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
))
21669 cp_check_omp_declare_reduction (d
);
21672 /* We're not deferring instantiation any more. */
21673 TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (d
)) = 0;
21676 pop_from_top_level ();
21678 pop_function_context ();
21681 input_location
= saved_loc
;
21682 cp_unevaluated_operand
= saved_unevaluated_operand
;
21683 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
21684 pop_deferring_access_checks ();
21685 pop_tinst_level ();
21687 restore_omp_privatization_clauses (omp_privatization_save
);
21689 timevar_pop (TV_TEMPLATE_INST
);
21694 /* Run through the list of templates that we wish we could
21695 instantiate, and instantiate any we can. RETRIES is the
21696 number of times we retry pending template instantiation. */
21699 instantiate_pending_templates (int retries
)
21702 location_t saved_loc
= input_location
;
21704 /* Instantiating templates may trigger vtable generation. This in turn
21705 may require further template instantiations. We place a limit here
21706 to avoid infinite loop. */
21707 if (pending_templates
&& retries
>= max_tinst_depth
)
21709 tree decl
= pending_templates
->tinst
->decl
;
21711 fatal_error (input_location
,
21712 "template instantiation depth exceeds maximum of %d"
21713 " instantiating %q+D, possibly from virtual table generation"
21714 " (use -ftemplate-depth= to increase the maximum)",
21715 max_tinst_depth
, decl
);
21716 if (TREE_CODE (decl
) == FUNCTION_DECL
)
21717 /* Pretend that we defined it. */
21718 DECL_INITIAL (decl
) = error_mark_node
;
21724 struct pending_template
**t
= &pending_templates
;
21725 struct pending_template
*last
= NULL
;
21729 tree instantiation
= reopen_tinst_level ((*t
)->tinst
);
21730 bool complete
= false;
21732 if (TYPE_P (instantiation
))
21736 if (!COMPLETE_TYPE_P (instantiation
))
21738 instantiate_class_template (instantiation
);
21739 if (CLASSTYPE_TEMPLATE_INSTANTIATION (instantiation
))
21740 for (fn
= TYPE_METHODS (instantiation
);
21742 fn
= TREE_CHAIN (fn
))
21743 if (! DECL_ARTIFICIAL (fn
))
21744 instantiate_decl (fn
,
21746 /*expl_inst_class_mem_p=*/false);
21747 if (COMPLETE_TYPE_P (instantiation
))
21751 complete
= COMPLETE_TYPE_P (instantiation
);
21755 if (!DECL_TEMPLATE_SPECIALIZATION (instantiation
)
21756 && !DECL_TEMPLATE_INSTANTIATED (instantiation
))
21759 = instantiate_decl (instantiation
,
21761 /*expl_inst_class_mem_p=*/false);
21762 if (DECL_TEMPLATE_INSTANTIATED (instantiation
))
21766 complete
= (DECL_TEMPLATE_SPECIALIZATION (instantiation
)
21767 || DECL_TEMPLATE_INSTANTIATED (instantiation
));
21771 /* If INSTANTIATION has been instantiated, then we don't
21772 need to consider it again in the future. */
21780 current_tinst_level
= NULL
;
21782 last_pending_template
= last
;
21784 while (reconsider
);
21786 input_location
= saved_loc
;
21789 /* Substitute ARGVEC into T, which is a list of initializers for
21790 either base class or a non-static data member. The TREE_PURPOSEs
21791 are DECLs, and the TREE_VALUEs are the initializer values. Used by
21792 instantiate_decl. */
21795 tsubst_initializer_list (tree t
, tree argvec
)
21797 tree inits
= NULL_TREE
;
21799 for (; t
; t
= TREE_CHAIN (t
))
21803 tree expanded_bases
= NULL_TREE
;
21804 tree expanded_arguments
= NULL_TREE
;
21807 if (TREE_CODE (TREE_PURPOSE (t
)) == TYPE_PACK_EXPANSION
)
21812 /* Expand the base class expansion type into separate base
21814 expanded_bases
= tsubst_pack_expansion (TREE_PURPOSE (t
), argvec
,
21815 tf_warning_or_error
,
21817 if (expanded_bases
== error_mark_node
)
21820 /* We'll be building separate TREE_LISTs of arguments for
21822 len
= TREE_VEC_LENGTH (expanded_bases
);
21823 expanded_arguments
= make_tree_vec (len
);
21824 for (i
= 0; i
< len
; i
++)
21825 TREE_VEC_ELT (expanded_arguments
, i
) = NULL_TREE
;
21827 /* Build a dummy EXPR_PACK_EXPANSION that will be used to
21828 expand each argument in the TREE_VALUE of t. */
21829 expr
= make_node (EXPR_PACK_EXPANSION
);
21830 PACK_EXPANSION_LOCAL_P (expr
) = true;
21831 PACK_EXPANSION_PARAMETER_PACKS (expr
) =
21832 PACK_EXPANSION_PARAMETER_PACKS (TREE_PURPOSE (t
));
21834 if (TREE_VALUE (t
) == void_type_node
)
21835 /* VOID_TYPE_NODE is used to indicate
21836 value-initialization. */
21838 for (i
= 0; i
< len
; i
++)
21839 TREE_VEC_ELT (expanded_arguments
, i
) = void_type_node
;
21843 /* Substitute parameter packs into each argument in the
21845 in_base_initializer
= 1;
21846 for (arg
= TREE_VALUE (t
); arg
; arg
= TREE_CHAIN (arg
))
21848 tree expanded_exprs
;
21850 /* Expand the argument. */
21851 SET_PACK_EXPANSION_PATTERN (expr
, TREE_VALUE (arg
));
21853 = tsubst_pack_expansion (expr
, argvec
,
21854 tf_warning_or_error
,
21856 if (expanded_exprs
== error_mark_node
)
21859 /* Prepend each of the expanded expressions to the
21860 corresponding TREE_LIST in EXPANDED_ARGUMENTS. */
21861 for (i
= 0; i
< len
; i
++)
21863 TREE_VEC_ELT (expanded_arguments
, i
) =
21864 tree_cons (NULL_TREE
,
21865 TREE_VEC_ELT (expanded_exprs
, i
),
21866 TREE_VEC_ELT (expanded_arguments
, i
));
21869 in_base_initializer
= 0;
21871 /* Reverse all of the TREE_LISTs in EXPANDED_ARGUMENTS,
21872 since we built them backwards. */
21873 for (i
= 0; i
< len
; i
++)
21875 TREE_VEC_ELT (expanded_arguments
, i
) =
21876 nreverse (TREE_VEC_ELT (expanded_arguments
, i
));
21881 for (i
= 0; i
< len
; ++i
)
21883 if (expanded_bases
)
21885 decl
= TREE_VEC_ELT (expanded_bases
, i
);
21886 decl
= expand_member_init (decl
);
21887 init
= TREE_VEC_ELT (expanded_arguments
, i
);
21892 decl
= tsubst_copy (TREE_PURPOSE (t
), argvec
,
21893 tf_warning_or_error
, NULL_TREE
);
21895 decl
= expand_member_init (decl
);
21896 if (decl
&& !DECL_P (decl
))
21897 in_base_initializer
= 1;
21899 init
= TREE_VALUE (t
);
21901 if (init
!= void_type_node
)
21902 init
= tsubst_expr (init
, argvec
,
21903 tf_warning_or_error
, NULL_TREE
,
21904 /*integral_constant_expression_p=*/false);
21905 if (init
== NULL_TREE
&& tmp
!= NULL_TREE
)
21906 /* If we had an initializer but it instantiated to nothing,
21907 value-initialize the object. This will only occur when
21908 the initializer was a pack expansion where the parameter
21909 packs used in that expansion were of length zero. */
21910 init
= void_type_node
;
21911 in_base_initializer
= 0;
21916 init
= build_tree_list (decl
, init
);
21917 TREE_CHAIN (init
) = inits
;
21925 /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */
21928 set_current_access_from_decl (tree decl
)
21930 if (TREE_PRIVATE (decl
))
21931 current_access_specifier
= access_private_node
;
21932 else if (TREE_PROTECTED (decl
))
21933 current_access_specifier
= access_protected_node
;
21935 current_access_specifier
= access_public_node
;
21938 /* Instantiate an enumerated type. TAG is the template type, NEWTAG
21939 is the instantiation (which should have been created with
21940 start_enum) and ARGS are the template arguments to use. */
21943 tsubst_enum (tree tag
, tree newtag
, tree args
)
21947 if (SCOPED_ENUM_P (newtag
))
21948 begin_scope (sk_scoped_enum
, newtag
);
21950 for (e
= TYPE_VALUES (tag
); e
; e
= TREE_CHAIN (e
))
21955 decl
= TREE_VALUE (e
);
21956 /* Note that in a template enum, the TREE_VALUE is the
21957 CONST_DECL, not the corresponding INTEGER_CST. */
21958 value
= tsubst_expr (DECL_INITIAL (decl
),
21959 args
, tf_warning_or_error
, NULL_TREE
,
21960 /*integral_constant_expression_p=*/true);
21962 /* Give this enumeration constant the correct access. */
21963 set_current_access_from_decl (decl
);
21965 /* Actually build the enumerator itself. Here we're assuming that
21966 enumerators can't have dependent attributes. */
21967 build_enumerator (DECL_NAME (decl
), value
, newtag
,
21968 DECL_ATTRIBUTES (decl
), DECL_SOURCE_LOCATION (decl
));
21971 if (SCOPED_ENUM_P (newtag
))
21974 finish_enum_value_list (newtag
);
21975 finish_enum (newtag
);
21977 DECL_SOURCE_LOCATION (TYPE_NAME (newtag
))
21978 = DECL_SOURCE_LOCATION (TYPE_NAME (tag
));
21981 /* DECL is a FUNCTION_DECL that is a template specialization. Return
21982 its type -- but without substituting the innermost set of template
21983 arguments. So, innermost set of template parameters will appear in
21987 get_mostly_instantiated_function_type (tree decl
)
21989 /* For a function, DECL_TI_TEMPLATE is partially instantiated. */
21990 return TREE_TYPE (DECL_TI_TEMPLATE (decl
));
21993 /* Return truthvalue if we're processing a template different from
21994 the last one involved in diagnostics. */
21996 problematic_instantiation_changed (void)
21998 return current_tinst_level
!= last_error_tinst_level
;
22001 /* Remember current template involved in diagnostics. */
22003 record_last_problematic_instantiation (void)
22005 last_error_tinst_level
= current_tinst_level
;
22008 struct tinst_level
*
22009 current_instantiation (void)
22011 return current_tinst_level
;
22014 /* Return TRUE if current_function_decl is being instantiated, false
22018 instantiating_current_function_p (void)
22020 return (current_instantiation ()
22021 && current_instantiation ()->decl
== current_function_decl
);
22024 /* [temp.param] Check that template non-type parm TYPE is of an allowable
22025 type. Return zero for ok, nonzero for disallowed. Issue error and
22026 warning messages under control of COMPLAIN. */
22029 invalid_nontype_parm_type_p (tree type
, tsubst_flags_t complain
)
22031 if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
22033 else if (POINTER_TYPE_P (type
))
22035 else if (TYPE_PTRMEM_P (type
))
22037 else if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
)
22039 else if (TREE_CODE (type
) == TYPENAME_TYPE
)
22041 else if (TREE_CODE (type
) == DECLTYPE_TYPE
)
22043 else if (TREE_CODE (type
) == NULLPTR_TYPE
)
22045 /* A bound template template parm could later be instantiated to have a valid
22046 nontype parm type via an alias template. */
22047 else if (cxx_dialect
>= cxx11
22048 && TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
22051 if (complain
& tf_error
)
22053 if (type
== error_mark_node
)
22054 inform (input_location
, "invalid template non-type parameter");
22056 error ("%q#T is not a valid type for a template non-type parameter",
22062 /* Returns TRUE if TYPE is dependent, in the sense of [temp.dep.type].
22063 Assumes that TYPE really is a type, and not the ERROR_MARK_NODE.*/
22066 dependent_type_p_r (tree type
)
22072 A type is dependent if it is:
22074 -- a template parameter. Template template parameters are types
22075 for us (since TYPE_P holds true for them) so we handle
22077 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
22078 || TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
)
22080 /* -- a qualified-id with a nested-name-specifier which contains a
22081 class-name that names a dependent type or whose unqualified-id
22082 names a dependent type. */
22083 if (TREE_CODE (type
) == TYPENAME_TYPE
)
22086 /* An alias template specialization can be dependent even if the
22087 resulting type is not. */
22088 if (dependent_alias_template_spec_p (type
))
22091 /* -- a cv-qualified type where the cv-unqualified type is
22093 No code is necessary for this bullet; the code below handles
22094 cv-qualified types, and we don't want to strip aliases with
22095 TYPE_MAIN_VARIANT because of DR 1558. */
22096 /* -- a compound type constructed from any dependent type. */
22097 if (TYPE_PTRMEM_P (type
))
22098 return (dependent_type_p (TYPE_PTRMEM_CLASS_TYPE (type
))
22099 || dependent_type_p (TYPE_PTRMEM_POINTED_TO_TYPE
22101 else if (TYPE_PTR_P (type
)
22102 || TREE_CODE (type
) == REFERENCE_TYPE
)
22103 return dependent_type_p (TREE_TYPE (type
));
22104 else if (TREE_CODE (type
) == FUNCTION_TYPE
22105 || TREE_CODE (type
) == METHOD_TYPE
)
22109 if (dependent_type_p (TREE_TYPE (type
)))
22111 for (arg_type
= TYPE_ARG_TYPES (type
);
22113 arg_type
= TREE_CHAIN (arg_type
))
22114 if (dependent_type_p (TREE_VALUE (arg_type
)))
22118 /* -- an array type constructed from any dependent type or whose
22119 size is specified by a constant expression that is
22122 We checked for type- and value-dependence of the bounds in
22123 compute_array_index_type, so TYPE_DEPENDENT_P is already set. */
22124 if (TREE_CODE (type
) == ARRAY_TYPE
)
22126 if (TYPE_DOMAIN (type
)
22127 && dependent_type_p (TYPE_DOMAIN (type
)))
22129 return dependent_type_p (TREE_TYPE (type
));
22132 /* -- a template-id in which either the template name is a template
22134 if (TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
22136 /* ... or any of the template arguments is a dependent type or
22137 an expression that is type-dependent or value-dependent. */
22138 else if (CLASS_TYPE_P (type
) && CLASSTYPE_TEMPLATE_INFO (type
)
22139 && (any_dependent_template_arguments_p
22140 (INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type
)))))
22143 /* All TYPEOF_TYPEs, DECLTYPE_TYPEs, and UNDERLYING_TYPEs are
22144 dependent; if the argument of the `typeof' expression is not
22145 type-dependent, then it should already been have resolved. */
22146 if (TREE_CODE (type
) == TYPEOF_TYPE
22147 || TREE_CODE (type
) == DECLTYPE_TYPE
22148 || TREE_CODE (type
) == UNDERLYING_TYPE
)
22151 /* A template argument pack is dependent if any of its packed
22153 if (TREE_CODE (type
) == TYPE_ARGUMENT_PACK
)
22155 tree args
= ARGUMENT_PACK_ARGS (type
);
22156 int i
, len
= TREE_VEC_LENGTH (args
);
22157 for (i
= 0; i
< len
; ++i
)
22158 if (dependent_template_arg_p (TREE_VEC_ELT (args
, i
)))
22162 /* All TYPE_PACK_EXPANSIONs are dependent, because parameter packs must
22163 be template parameters. */
22164 if (TREE_CODE (type
) == TYPE_PACK_EXPANSION
)
22167 /* The standard does not specifically mention types that are local
22168 to template functions or local classes, but they should be
22169 considered dependent too. For example:
22171 template <int I> void f() {
22176 The size of `E' cannot be known until the value of `I' has been
22177 determined. Therefore, `E' must be considered dependent. */
22178 scope
= TYPE_CONTEXT (type
);
22179 if (scope
&& TYPE_P (scope
))
22180 return dependent_type_p (scope
);
22181 /* Don't use type_dependent_expression_p here, as it can lead
22182 to infinite recursion trying to determine whether a lambda
22183 nested in a lambda is dependent (c++/47687). */
22184 else if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
22185 && DECL_LANG_SPECIFIC (scope
)
22186 && DECL_TEMPLATE_INFO (scope
)
22187 && (any_dependent_template_arguments_p
22188 (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (scope
)))))
22191 /* Other types are non-dependent. */
22195 /* Returns TRUE if TYPE is dependent, in the sense of
22196 [temp.dep.type]. Note that a NULL type is considered dependent. */
22199 dependent_type_p (tree type
)
22201 /* If there are no template parameters in scope, then there can't be
22202 any dependent types. */
22203 if (!processing_template_decl
)
22205 /* If we are not processing a template, then nobody should be
22206 providing us with a dependent type. */
22208 gcc_assert (TREE_CODE (type
) != TEMPLATE_TYPE_PARM
|| is_auto (type
));
22212 /* If the type is NULL, we have not computed a type for the entity
22213 in question; in that case, the type is dependent. */
22217 /* Erroneous types can be considered non-dependent. */
22218 if (type
== error_mark_node
)
22221 /* If we have not already computed the appropriate value for TYPE,
22223 if (!TYPE_DEPENDENT_P_VALID (type
))
22225 TYPE_DEPENDENT_P (type
) = dependent_type_p_r (type
);
22226 TYPE_DEPENDENT_P_VALID (type
) = 1;
22229 return TYPE_DEPENDENT_P (type
);
22232 /* Returns TRUE if SCOPE is a dependent scope, in which we can't do any
22233 lookup. In other words, a dependent type that is not the current
22237 dependent_scope_p (tree scope
)
22239 return (scope
&& TYPE_P (scope
) && dependent_type_p (scope
)
22240 && !currently_open_class (scope
));
22243 /* T is a SCOPE_REF; return whether we need to consider it
22244 instantiation-dependent so that we can check access at instantiation
22245 time even though we know which member it resolves to. */
22248 instantiation_dependent_scope_ref_p (tree t
)
22250 if (DECL_P (TREE_OPERAND (t
, 1))
22251 && CLASS_TYPE_P (TREE_OPERAND (t
, 0))
22252 && accessible_in_template_p (TREE_OPERAND (t
, 0),
22253 TREE_OPERAND (t
, 1)))
22259 /* Returns TRUE if the EXPRESSION is value-dependent, in the sense of
22260 [temp.dep.constexpr]. EXPRESSION is already known to be a constant
22263 /* Note that this predicate is not appropriate for general expressions;
22264 only constant expressions (that satisfy potential_constant_expression)
22265 can be tested for value dependence. */
22268 value_dependent_expression_p (tree expression
)
22270 if (!processing_template_decl
)
22273 /* A name declared with a dependent type. */
22274 if (DECL_P (expression
) && type_dependent_expression_p (expression
))
22277 switch (TREE_CODE (expression
))
22279 case IDENTIFIER_NODE
:
22280 /* A name that has not been looked up -- must be dependent. */
22283 case TEMPLATE_PARM_INDEX
:
22284 /* A non-type template parm. */
22288 /* A non-type template parm. */
22289 if (DECL_TEMPLATE_PARM_P (expression
))
22291 return value_dependent_expression_p (DECL_INITIAL (expression
));
22294 /* A constant with literal type and is initialized
22295 with an expression that is value-dependent.
22297 Note that a non-dependent parenthesized initializer will have
22298 already been replaced with its constant value, so if we see
22299 a TREE_LIST it must be dependent. */
22300 if (DECL_INITIAL (expression
)
22301 && decl_constant_var_p (expression
)
22302 && (TREE_CODE (DECL_INITIAL (expression
)) == TREE_LIST
22303 /* cp_finish_decl doesn't fold reference initializers. */
22304 || TREE_CODE (TREE_TYPE (expression
)) == REFERENCE_TYPE
22305 || value_dependent_expression_p (DECL_INITIAL (expression
))))
22309 case DYNAMIC_CAST_EXPR
:
22310 case STATIC_CAST_EXPR
:
22311 case CONST_CAST_EXPR
:
22312 case REINTERPRET_CAST_EXPR
:
22314 /* These expressions are value-dependent if the type to which
22315 the cast occurs is dependent or the expression being casted
22316 is value-dependent. */
22318 tree type
= TREE_TYPE (expression
);
22320 if (dependent_type_p (type
))
22323 /* A functional cast has a list of operands. */
22324 expression
= TREE_OPERAND (expression
, 0);
22327 /* If there are no operands, it must be an expression such
22328 as "int()". This should not happen for aggregate types
22329 because it would form non-constant expressions. */
22330 gcc_assert (cxx_dialect
>= cxx11
22331 || INTEGRAL_OR_ENUMERATION_TYPE_P (type
));
22336 if (TREE_CODE (expression
) == TREE_LIST
)
22337 return any_value_dependent_elements_p (expression
);
22339 return value_dependent_expression_p (expression
);
22343 if (SIZEOF_EXPR_TYPE_P (expression
))
22344 return dependent_type_p (TREE_TYPE (TREE_OPERAND (expression
, 0)));
22348 /* A `sizeof' expression is value-dependent if the operand is
22349 type-dependent or is a pack expansion. */
22350 expression
= TREE_OPERAND (expression
, 0);
22351 if (PACK_EXPANSION_P (expression
))
22353 else if (TYPE_P (expression
))
22354 return dependent_type_p (expression
);
22355 return instantiation_dependent_expression_p (expression
);
22357 case AT_ENCODE_EXPR
:
22358 /* An 'encode' expression is value-dependent if the operand is
22360 expression
= TREE_OPERAND (expression
, 0);
22361 return dependent_type_p (expression
);
22363 case NOEXCEPT_EXPR
:
22364 expression
= TREE_OPERAND (expression
, 0);
22365 return instantiation_dependent_expression_p (expression
);
22368 /* All instantiation-dependent expressions should also be considered
22369 value-dependent. */
22370 return instantiation_dependent_scope_ref_p (expression
);
22372 case COMPONENT_REF
:
22373 return (value_dependent_expression_p (TREE_OPERAND (expression
, 0))
22374 || value_dependent_expression_p (TREE_OPERAND (expression
, 1)));
22376 case NONTYPE_ARGUMENT_PACK
:
22377 /* A NONTYPE_ARGUMENT_PACK is value-dependent if any packed argument
22378 is value-dependent. */
22380 tree values
= ARGUMENT_PACK_ARGS (expression
);
22381 int i
, len
= TREE_VEC_LENGTH (values
);
22383 for (i
= 0; i
< len
; ++i
)
22384 if (value_dependent_expression_p (TREE_VEC_ELT (values
, i
)))
22392 tree type2
= TRAIT_EXPR_TYPE2 (expression
);
22393 return (dependent_type_p (TRAIT_EXPR_TYPE1 (expression
))
22394 || (type2
? dependent_type_p (type2
) : false));
22398 return ((value_dependent_expression_p (TREE_OPERAND (expression
, 0)))
22399 || (value_dependent_expression_p (TREE_OPERAND (expression
, 2))));
22402 return ((value_dependent_expression_p (TREE_OPERAND (expression
, 0)))
22403 || (value_dependent_expression_p (TREE_OPERAND (expression
, 1))));
22407 tree op
= TREE_OPERAND (expression
, 0);
22408 return (value_dependent_expression_p (op
)
22409 || has_value_dependent_address (op
));
22412 case REQUIRES_EXPR
:
22413 /* Treat all requires-expressions as value-dependent so
22414 we don't try to fold them. */
22418 return dependent_type_p (TREE_OPERAND (expression
, 0));
22422 tree fn
= get_callee_fndecl (expression
);
22424 if (!fn
&& value_dependent_expression_p (CALL_EXPR_FN (expression
)))
22426 nargs
= call_expr_nargs (expression
);
22427 for (i
= 0; i
< nargs
; ++i
)
22429 tree op
= CALL_EXPR_ARG (expression
, i
);
22430 /* In a call to a constexpr member function, look through the
22431 implicit ADDR_EXPR on the object argument so that it doesn't
22432 cause the call to be considered value-dependent. We also
22433 look through it in potential_constant_expression. */
22434 if (i
== 0 && fn
&& DECL_DECLARED_CONSTEXPR_P (fn
)
22435 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
22436 && TREE_CODE (op
) == ADDR_EXPR
)
22437 op
= TREE_OPERAND (op
, 0);
22438 if (value_dependent_expression_p (op
))
22444 case TEMPLATE_ID_EXPR
:
22445 /* If a TEMPLATE_ID_EXPR involves a dependent name, it will be
22447 return type_dependent_expression_p (expression
)
22448 || variable_concept_p (TREE_OPERAND (expression
, 0));
22454 if (dependent_type_p (TREE_TYPE (expression
)))
22456 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expression
), ix
, val
)
22457 if (value_dependent_expression_p (val
))
22463 /* Treat a GNU statement expression as dependent to avoid crashing
22464 under instantiate_non_dependent_expr; it can't be constant. */
22468 /* A constant expression is value-dependent if any subexpression is
22469 value-dependent. */
22470 switch (TREE_CODE_CLASS (TREE_CODE (expression
)))
22472 case tcc_reference
:
22474 case tcc_comparison
:
22476 case tcc_expression
:
22479 int i
, len
= cp_tree_operand_length (expression
);
22481 for (i
= 0; i
< len
; i
++)
22483 tree t
= TREE_OPERAND (expression
, i
);
22485 /* In some cases, some of the operands may be missing.l
22486 (For example, in the case of PREDECREMENT_EXPR, the
22487 amount to increment by may be missing.) That doesn't
22488 make the expression dependent. */
22489 if (t
&& value_dependent_expression_p (t
))
22500 /* The expression is not value-dependent. */
22504 /* Returns TRUE if the EXPRESSION is type-dependent, in the sense of
22505 [temp.dep.expr]. Note that an expression with no type is
22506 considered dependent. Other parts of the compiler arrange for an
22507 expression with type-dependent subexpressions to have no type, so
22508 this function doesn't have to be fully recursive. */
22511 type_dependent_expression_p (tree expression
)
22513 if (!processing_template_decl
)
22516 if (expression
== NULL_TREE
|| expression
== error_mark_node
)
22519 /* An unresolved name is always dependent. */
22520 if (identifier_p (expression
)
22521 || TREE_CODE (expression
) == USING_DECL
22522 || TREE_CODE (expression
) == WILDCARD_DECL
)
22525 /* A fold expression is type-dependent. */
22526 if (TREE_CODE (expression
) == UNARY_LEFT_FOLD_EXPR
22527 || TREE_CODE (expression
) == UNARY_RIGHT_FOLD_EXPR
22528 || TREE_CODE (expression
) == BINARY_LEFT_FOLD_EXPR
22529 || TREE_CODE (expression
) == BINARY_RIGHT_FOLD_EXPR
)
22532 /* Some expression forms are never type-dependent. */
22533 if (TREE_CODE (expression
) == PSEUDO_DTOR_EXPR
22534 || TREE_CODE (expression
) == SIZEOF_EXPR
22535 || TREE_CODE (expression
) == ALIGNOF_EXPR
22536 || TREE_CODE (expression
) == AT_ENCODE_EXPR
22537 || TREE_CODE (expression
) == NOEXCEPT_EXPR
22538 || TREE_CODE (expression
) == TRAIT_EXPR
22539 || TREE_CODE (expression
) == TYPEID_EXPR
22540 || TREE_CODE (expression
) == DELETE_EXPR
22541 || TREE_CODE (expression
) == VEC_DELETE_EXPR
22542 || TREE_CODE (expression
) == THROW_EXPR
22543 || TREE_CODE (expression
) == REQUIRES_EXPR
)
22546 /* The types of these expressions depends only on the type to which
22547 the cast occurs. */
22548 if (TREE_CODE (expression
) == DYNAMIC_CAST_EXPR
22549 || TREE_CODE (expression
) == STATIC_CAST_EXPR
22550 || TREE_CODE (expression
) == CONST_CAST_EXPR
22551 || TREE_CODE (expression
) == REINTERPRET_CAST_EXPR
22552 || TREE_CODE (expression
) == IMPLICIT_CONV_EXPR
22553 || TREE_CODE (expression
) == CAST_EXPR
)
22554 return dependent_type_p (TREE_TYPE (expression
));
22556 /* The types of these expressions depends only on the type created
22557 by the expression. */
22558 if (TREE_CODE (expression
) == NEW_EXPR
22559 || TREE_CODE (expression
) == VEC_NEW_EXPR
)
22561 /* For NEW_EXPR tree nodes created inside a template, either
22562 the object type itself or a TREE_LIST may appear as the
22564 tree type
= TREE_OPERAND (expression
, 1);
22565 if (TREE_CODE (type
) == TREE_LIST
)
22566 /* This is an array type. We need to check array dimensions
22568 return dependent_type_p (TREE_VALUE (TREE_PURPOSE (type
)))
22569 || value_dependent_expression_p
22570 (TREE_OPERAND (TREE_VALUE (type
), 1));
22572 return dependent_type_p (type
);
22575 if (TREE_CODE (expression
) == SCOPE_REF
)
22577 tree scope
= TREE_OPERAND (expression
, 0);
22578 tree name
= TREE_OPERAND (expression
, 1);
22580 /* 14.6.2.2 [temp.dep.expr]: An id-expression is type-dependent if it
22581 contains an identifier associated by name lookup with one or more
22582 declarations declared with a dependent type, or...a
22583 nested-name-specifier or qualified-id that names a member of an
22584 unknown specialization. */
22585 return (type_dependent_expression_p (name
)
22586 || dependent_scope_p (scope
));
22589 if (TREE_CODE (expression
) == FUNCTION_DECL
22590 && DECL_LANG_SPECIFIC (expression
)
22591 && DECL_TEMPLATE_INFO (expression
)
22592 && (any_dependent_template_arguments_p
22593 (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (expression
)))))
22596 if (TREE_CODE (expression
) == TEMPLATE_DECL
22597 && !DECL_TEMPLATE_TEMPLATE_PARM_P (expression
))
22600 if (TREE_CODE (expression
) == STMT_EXPR
)
22601 expression
= stmt_expr_value_expr (expression
);
22603 if (BRACE_ENCLOSED_INITIALIZER_P (expression
))
22608 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expression
), i
, elt
)
22610 if (type_dependent_expression_p (elt
))
22616 /* A static data member of the current instantiation with incomplete
22617 array type is type-dependent, as the definition and specializations
22618 can have different bounds. */
22619 if (VAR_P (expression
)
22620 && DECL_CLASS_SCOPE_P (expression
)
22621 && dependent_type_p (DECL_CONTEXT (expression
))
22622 && VAR_HAD_UNKNOWN_BOUND (expression
))
22625 /* An array of unknown bound depending on a variadic parameter, eg:
22627 template<typename... Args>
22628 void foo (Args... args)
22630 int arr[] = { args... };
22633 template<int... vals>
22636 int arr[] = { vals... };
22639 If the array has no length and has an initializer, it must be that
22640 we couldn't determine its length in cp_complete_array_type because
22641 it is dependent. */
22642 if (VAR_P (expression
)
22643 && TREE_CODE (TREE_TYPE (expression
)) == ARRAY_TYPE
22644 && !TYPE_DOMAIN (TREE_TYPE (expression
))
22645 && DECL_INITIAL (expression
))
22648 /* A variable template specialization is type-dependent if it has any
22649 dependent template arguments. */
22650 if (VAR_P (expression
)
22651 && DECL_LANG_SPECIFIC (expression
)
22652 && DECL_TEMPLATE_INFO (expression
)
22653 && variable_template_p (DECL_TI_TEMPLATE (expression
)))
22654 return any_dependent_template_arguments_p (DECL_TI_ARGS (expression
));
22656 /* Always dependent, on the number of arguments if nothing else. */
22657 if (TREE_CODE (expression
) == EXPR_PACK_EXPANSION
)
22660 if (TREE_TYPE (expression
) == unknown_type_node
)
22662 if (TREE_CODE (expression
) == ADDR_EXPR
)
22663 return type_dependent_expression_p (TREE_OPERAND (expression
, 0));
22664 if (TREE_CODE (expression
) == COMPONENT_REF
22665 || TREE_CODE (expression
) == OFFSET_REF
)
22667 if (type_dependent_expression_p (TREE_OPERAND (expression
, 0)))
22669 expression
= TREE_OPERAND (expression
, 1);
22670 if (identifier_p (expression
))
22673 /* SCOPE_REF with non-null TREE_TYPE is always non-dependent. */
22674 if (TREE_CODE (expression
) == SCOPE_REF
)
22677 if (BASELINK_P (expression
))
22679 if (BASELINK_OPTYPE (expression
)
22680 && dependent_type_p (BASELINK_OPTYPE (expression
)))
22682 expression
= BASELINK_FUNCTIONS (expression
);
22685 if (TREE_CODE (expression
) == TEMPLATE_ID_EXPR
)
22687 if (any_dependent_template_arguments_p
22688 (TREE_OPERAND (expression
, 1)))
22690 expression
= TREE_OPERAND (expression
, 0);
22691 if (identifier_p (expression
))
22695 gcc_assert (TREE_CODE (expression
) == OVERLOAD
22696 || TREE_CODE (expression
) == FUNCTION_DECL
);
22700 if (type_dependent_expression_p (OVL_CURRENT (expression
)))
22702 expression
= OVL_NEXT (expression
);
22707 gcc_assert (TREE_CODE (expression
) != TYPE_DECL
);
22709 return (dependent_type_p (TREE_TYPE (expression
)));
22712 /* walk_tree callback function for instantiation_dependent_expression_p,
22713 below. Returns non-zero if a dependent subexpression is found. */
22716 instantiation_dependent_r (tree
*tp
, int *walk_subtrees
,
22721 /* We don't have to worry about decltype currently because decltype
22722 of an instantiation-dependent expr is a dependent type. This
22723 might change depending on the resolution of DR 1172. */
22724 *walk_subtrees
= false;
22727 enum tree_code code
= TREE_CODE (*tp
);
22730 /* Don't treat an argument list as dependent just because it has no
22738 /* A constant with a dependent initializer is dependent. */
22739 if (value_dependent_expression_p (*tp
))
22743 case TEMPLATE_PARM_INDEX
:
22746 /* Handle expressions with type operands. */
22750 case AT_ENCODE_EXPR
:
22752 tree op
= TREE_OPERAND (*tp
, 0);
22753 if (code
== SIZEOF_EXPR
&& SIZEOF_EXPR_TYPE_P (*tp
))
22754 op
= TREE_TYPE (op
);
22757 if (dependent_type_p (op
))
22761 *walk_subtrees
= false;
22769 if (value_dependent_expression_p (*tp
))
22771 *walk_subtrees
= false;
22774 case COMPONENT_REF
:
22775 if (identifier_p (TREE_OPERAND (*tp
, 1)))
22776 /* In a template, finish_class_member_access_expr creates a
22777 COMPONENT_REF with an IDENTIFIER_NODE for op1 even if it isn't
22778 type-dependent, so that we can check access control at
22779 instantiation time (PR 42277). See also Core issue 1273. */
22784 if (instantiation_dependent_scope_ref_p (*tp
))
22789 /* Treat statement-expressions as dependent. */
22793 /* Treat requires-expressions as dependent. */
22794 case REQUIRES_EXPR
:
22798 /* Treat calls to function concepts as dependent. */
22799 if (function_concept_check_p (*tp
))
22803 case TEMPLATE_ID_EXPR
:
22804 /* And variable concepts. */
22805 if (variable_concept_p (TREE_OPERAND (*tp
, 0)))
22813 if (type_dependent_expression_p (*tp
))
22819 /* Returns TRUE if the EXPRESSION is instantiation-dependent, in the
22820 sense defined by the ABI:
22822 "An expression is instantiation-dependent if it is type-dependent
22823 or value-dependent, or it has a subexpression that is type-dependent
22824 or value-dependent." */
22827 instantiation_dependent_expression_p (tree expression
)
22831 if (!processing_template_decl
)
22834 if (expression
== error_mark_node
)
22837 result
= cp_walk_tree_without_duplicates (&expression
,
22838 instantiation_dependent_r
, NULL
);
22839 return result
!= NULL_TREE
;
22842 /* Like type_dependent_expression_p, but it also works while not processing
22843 a template definition, i.e. during substitution or mangling. */
22846 type_dependent_expression_p_push (tree expr
)
22849 ++processing_template_decl
;
22850 b
= type_dependent_expression_p (expr
);
22851 --processing_template_decl
;
22855 /* Returns TRUE if ARGS contains a type-dependent expression. */
22858 any_type_dependent_arguments_p (const vec
<tree
, va_gc
> *args
)
22863 FOR_EACH_VEC_SAFE_ELT (args
, i
, arg
)
22865 if (type_dependent_expression_p (arg
))
22871 /* Returns TRUE if LIST (a TREE_LIST whose TREE_VALUEs are
22872 expressions) contains any type-dependent expressions. */
22875 any_type_dependent_elements_p (const_tree list
)
22877 for (; list
; list
= TREE_CHAIN (list
))
22878 if (type_dependent_expression_p (TREE_VALUE (list
)))
22884 /* Returns TRUE if LIST (a TREE_LIST whose TREE_VALUEs are
22885 expressions) contains any value-dependent expressions. */
22888 any_value_dependent_elements_p (const_tree list
)
22890 for (; list
; list
= TREE_CHAIN (list
))
22891 if (value_dependent_expression_p (TREE_VALUE (list
)))
22897 /* Returns TRUE if the ARG (a template argument) is dependent. */
22900 dependent_template_arg_p (tree arg
)
22902 if (!processing_template_decl
)
22905 /* Assume a template argument that was wrongly written by the user
22906 is dependent. This is consistent with what
22907 any_dependent_template_arguments_p [that calls this function]
22909 if (!arg
|| arg
== error_mark_node
)
22912 if (TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
22913 arg
= ARGUMENT_PACK_SELECT_ARG (arg
);
22915 if (TREE_CODE (arg
) == TEMPLATE_DECL
22916 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
22917 return dependent_template_p (arg
);
22918 else if (ARGUMENT_PACK_P (arg
))
22920 tree args
= ARGUMENT_PACK_ARGS (arg
);
22921 int i
, len
= TREE_VEC_LENGTH (args
);
22922 for (i
= 0; i
< len
; ++i
)
22924 if (dependent_template_arg_p (TREE_VEC_ELT (args
, i
)))
22930 else if (TYPE_P (arg
))
22931 return dependent_type_p (arg
);
22933 return (type_dependent_expression_p (arg
)
22934 || value_dependent_expression_p (arg
));
22937 /* Returns true if ARGS (a collection of template arguments) contains
22938 any types that require structural equality testing. */
22941 any_template_arguments_need_structural_equality_p (tree args
)
22948 if (args
== error_mark_node
)
22951 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
22953 tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
22954 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
22956 tree arg
= TREE_VEC_ELT (level
, j
);
22957 tree packed_args
= NULL_TREE
;
22960 if (ARGUMENT_PACK_P (arg
))
22962 /* Look inside the argument pack. */
22963 packed_args
= ARGUMENT_PACK_ARGS (arg
);
22964 len
= TREE_VEC_LENGTH (packed_args
);
22967 for (k
= 0; k
< len
; ++k
)
22970 arg
= TREE_VEC_ELT (packed_args
, k
);
22972 if (error_operand_p (arg
))
22974 else if (TREE_CODE (arg
) == TEMPLATE_DECL
)
22976 else if (TYPE_P (arg
) && TYPE_STRUCTURAL_EQUALITY_P (arg
))
22978 else if (!TYPE_P (arg
) && TREE_TYPE (arg
)
22979 && TYPE_STRUCTURAL_EQUALITY_P (TREE_TYPE (arg
)))
22988 /* Returns true if ARGS (a collection of template arguments) contains
22989 any dependent arguments. */
22992 any_dependent_template_arguments_p (const_tree args
)
22999 if (args
== error_mark_node
)
23002 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
23004 const_tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
23005 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
23006 if (dependent_template_arg_p (TREE_VEC_ELT (level
, j
)))
23013 /* Returns TRUE if the template TMPL is dependent. */
23016 dependent_template_p (tree tmpl
)
23018 if (TREE_CODE (tmpl
) == OVERLOAD
)
23022 if (dependent_template_p (OVL_CURRENT (tmpl
)))
23024 tmpl
= OVL_NEXT (tmpl
);
23029 /* Template template parameters are dependent. */
23030 if (DECL_TEMPLATE_TEMPLATE_PARM_P (tmpl
)
23031 || TREE_CODE (tmpl
) == TEMPLATE_TEMPLATE_PARM
)
23033 /* So are names that have not been looked up. */
23034 if (TREE_CODE (tmpl
) == SCOPE_REF
|| identifier_p (tmpl
))
23036 /* So are member templates of dependent classes. */
23037 if (TYPE_P (CP_DECL_CONTEXT (tmpl
)))
23038 return dependent_type_p (DECL_CONTEXT (tmpl
));
23042 /* Returns TRUE if the specialization TMPL<ARGS> is dependent. */
23045 dependent_template_id_p (tree tmpl
, tree args
)
23047 return (dependent_template_p (tmpl
)
23048 || any_dependent_template_arguments_p (args
));
23051 /* Returns TRUE if OMP_FOR with DECLV, INITV, CONDV and INCRV vectors
23055 dependent_omp_for_p (tree declv
, tree initv
, tree condv
, tree incrv
)
23059 if (!processing_template_decl
)
23062 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
23064 tree decl
= TREE_VEC_ELT (declv
, i
);
23065 tree init
= TREE_VEC_ELT (initv
, i
);
23066 tree cond
= TREE_VEC_ELT (condv
, i
);
23067 tree incr
= TREE_VEC_ELT (incrv
, i
);
23069 if (type_dependent_expression_p (decl
)
23070 || TREE_CODE (decl
) == SCOPE_REF
)
23073 if (init
&& type_dependent_expression_p (init
))
23076 if (type_dependent_expression_p (cond
))
23079 if (COMPARISON_CLASS_P (cond
)
23080 && (type_dependent_expression_p (TREE_OPERAND (cond
, 0))
23081 || type_dependent_expression_p (TREE_OPERAND (cond
, 1))))
23084 if (TREE_CODE (incr
) == MODOP_EXPR
)
23086 if (type_dependent_expression_p (TREE_OPERAND (incr
, 0))
23087 || type_dependent_expression_p (TREE_OPERAND (incr
, 2)))
23090 else if (type_dependent_expression_p (incr
))
23092 else if (TREE_CODE (incr
) == MODIFY_EXPR
)
23094 if (type_dependent_expression_p (TREE_OPERAND (incr
, 0)))
23096 else if (BINARY_CLASS_P (TREE_OPERAND (incr
, 1)))
23098 tree t
= TREE_OPERAND (incr
, 1);
23099 if (type_dependent_expression_p (TREE_OPERAND (t
, 0))
23100 || type_dependent_expression_p (TREE_OPERAND (t
, 1)))
23109 /* TYPE is a TYPENAME_TYPE. Returns the ordinary TYPE to which the
23110 TYPENAME_TYPE corresponds. Returns the original TYPENAME_TYPE if
23111 no such TYPE can be found. Note that this function peers inside
23112 uninstantiated templates and therefore should be used only in
23113 extremely limited situations. ONLY_CURRENT_P restricts this
23114 peering to the currently open classes hierarchy (which is required
23115 when comparing types). */
23118 resolve_typename_type (tree type
, bool only_current_p
)
23127 gcc_assert (TREE_CODE (type
) == TYPENAME_TYPE
);
23129 scope
= TYPE_CONTEXT (type
);
23130 /* Usually the non-qualified identifier of a TYPENAME_TYPE is
23131 TYPE_IDENTIFIER (type). But when 'type' is a typedef variant of
23132 a TYPENAME_TYPE node, then TYPE_NAME (type) is set to the TYPE_DECL representing
23133 the typedef. In that case TYPE_IDENTIFIER (type) is not the non-qualified
23134 identifier of the TYPENAME_TYPE anymore.
23135 So by getting the TYPE_IDENTIFIER of the _main declaration_ of the
23136 TYPENAME_TYPE instead, we avoid messing up with a possible
23137 typedef variant case. */
23138 name
= TYPE_IDENTIFIER (TYPE_MAIN_VARIANT (type
));
23140 /* If the SCOPE is itself a TYPENAME_TYPE, then we need to resolve
23141 it first before we can figure out what NAME refers to. */
23142 if (TREE_CODE (scope
) == TYPENAME_TYPE
)
23144 if (TYPENAME_IS_RESOLVING_P (scope
))
23145 /* Given a class template A with a dependent base with nested type C,
23146 typedef typename A::C::C C will land us here, as trying to resolve
23147 the initial A::C leads to the local C typedef, which leads back to
23148 A::C::C. So we break the recursion now. */
23151 scope
= resolve_typename_type (scope
, only_current_p
);
23153 /* If we don't know what SCOPE refers to, then we cannot resolve the
23155 if (TREE_CODE (scope
) == TYPENAME_TYPE
)
23157 /* If the SCOPE is a template type parameter, we have no way of
23158 resolving the name. */
23159 if (TREE_CODE (scope
) == TEMPLATE_TYPE_PARM
)
23161 /* If the SCOPE is not the current instantiation, there's no reason
23162 to look inside it. */
23163 if (only_current_p
&& !currently_open_class (scope
))
23165 /* If this is a typedef, we don't want to look inside (c++/11987). */
23166 if (typedef_variant_p (type
))
23168 /* If SCOPE isn't the template itself, it will not have a valid
23169 TYPE_FIELDS list. */
23170 if (CLASS_TYPE_P (scope
)
23171 && same_type_p (scope
, CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope
)))
23172 /* scope is either the template itself or a compatible instantiation
23173 like X<T>, so look up the name in the original template. */
23174 scope
= CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope
);
23176 /* scope is a partial instantiation, so we can't do the lookup or we
23177 will lose the template arguments. */
23179 /* Enter the SCOPE so that name lookup will be resolved as if we
23180 were in the class definition. In particular, SCOPE will no
23181 longer be considered a dependent type. */
23182 pushed_scope
= push_scope (scope
);
23183 /* Look up the declaration. */
23184 decl
= lookup_member (scope
, name
, /*protect=*/0, /*want_type=*/true,
23185 tf_warning_or_error
);
23187 result
= NULL_TREE
;
23189 /* For a TYPENAME_TYPE like "typename X::template Y<T>", we want to
23190 find a TEMPLATE_DECL. Otherwise, we want to find a TYPE_DECL. */
23193 else if (identifier_p (TYPENAME_TYPE_FULLNAME (type
))
23194 && TREE_CODE (decl
) == TYPE_DECL
)
23196 result
= TREE_TYPE (decl
);
23197 if (result
== error_mark_node
)
23198 result
= NULL_TREE
;
23200 else if (TREE_CODE (TYPENAME_TYPE_FULLNAME (type
)) == TEMPLATE_ID_EXPR
23201 && DECL_CLASS_TEMPLATE_P (decl
))
23205 /* Obtain the template and the arguments. */
23206 tmpl
= TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type
), 0);
23207 args
= TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type
), 1);
23208 /* Instantiate the template. */
23209 result
= lookup_template_class (tmpl
, args
, NULL_TREE
, NULL_TREE
,
23210 /*entering_scope=*/0,
23211 tf_error
| tf_user
);
23212 if (result
== error_mark_node
)
23213 result
= NULL_TREE
;
23216 /* Leave the SCOPE. */
23218 pop_scope (pushed_scope
);
23220 /* If we failed to resolve it, return the original typename. */
23224 /* If lookup found a typename type, resolve that too. */
23225 if (TREE_CODE (result
) == TYPENAME_TYPE
&& !TYPENAME_IS_RESOLVING_P (result
))
23227 /* Ill-formed programs can cause infinite recursion here, so we
23228 must catch that. */
23229 TYPENAME_IS_RESOLVING_P (type
) = 1;
23230 result
= resolve_typename_type (result
, only_current_p
);
23231 TYPENAME_IS_RESOLVING_P (type
) = 0;
23234 /* Qualify the resulting type. */
23235 quals
= cp_type_quals (type
);
23237 result
= cp_build_qualified_type (result
, cp_type_quals (result
) | quals
);
23242 /* EXPR is an expression which is not type-dependent. Return a proxy
23243 for EXPR that can be used to compute the types of larger
23244 expressions containing EXPR. */
23247 build_non_dependent_expr (tree expr
)
23251 #ifdef ENABLE_CHECKING
23252 /* Try to get a constant value for all non-dependent expressions in
23253 order to expose bugs in *_dependent_expression_p and constexpr. */
23254 if (cxx_dialect
>= cxx11
)
23255 fold_non_dependent_expr (expr
);
23258 /* Preserve OVERLOADs; the functions must be available to resolve
23261 if (TREE_CODE (inner_expr
) == STMT_EXPR
)
23262 inner_expr
= stmt_expr_value_expr (inner_expr
);
23263 if (TREE_CODE (inner_expr
) == ADDR_EXPR
)
23264 inner_expr
= TREE_OPERAND (inner_expr
, 0);
23265 if (TREE_CODE (inner_expr
) == COMPONENT_REF
)
23266 inner_expr
= TREE_OPERAND (inner_expr
, 1);
23267 if (is_overloaded_fn (inner_expr
)
23268 || TREE_CODE (inner_expr
) == OFFSET_REF
)
23270 /* There is no need to return a proxy for a variable. */
23273 /* Preserve string constants; conversions from string constants to
23274 "char *" are allowed, even though normally a "const char *"
23275 cannot be used to initialize a "char *". */
23276 if (TREE_CODE (expr
) == STRING_CST
)
23278 /* Preserve void and arithmetic constants, as an optimization -- there is no
23279 reason to create a new node. */
23280 if (TREE_CODE (expr
) == VOID_CST
23281 || TREE_CODE (expr
) == INTEGER_CST
23282 || TREE_CODE (expr
) == REAL_CST
)
23284 /* Preserve THROW_EXPRs -- all throw-expressions have type "void".
23285 There is at least one place where we want to know that a
23286 particular expression is a throw-expression: when checking a ?:
23287 expression, there are special rules if the second or third
23288 argument is a throw-expression. */
23289 if (TREE_CODE (expr
) == THROW_EXPR
)
23292 /* Don't wrap an initializer list, we need to be able to look inside. */
23293 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
23296 /* Don't wrap a dummy object, we need to be able to test for it. */
23297 if (is_dummy_object (expr
))
23300 if (TREE_CODE (expr
) == COND_EXPR
)
23301 return build3 (COND_EXPR
,
23303 TREE_OPERAND (expr
, 0),
23304 (TREE_OPERAND (expr
, 1)
23305 ? build_non_dependent_expr (TREE_OPERAND (expr
, 1))
23306 : build_non_dependent_expr (TREE_OPERAND (expr
, 0))),
23307 build_non_dependent_expr (TREE_OPERAND (expr
, 2)));
23308 if (TREE_CODE (expr
) == COMPOUND_EXPR
23309 && !COMPOUND_EXPR_OVERLOADED (expr
))
23310 return build2 (COMPOUND_EXPR
,
23312 TREE_OPERAND (expr
, 0),
23313 build_non_dependent_expr (TREE_OPERAND (expr
, 1)));
23315 /* If the type is unknown, it can't really be non-dependent */
23316 gcc_assert (TREE_TYPE (expr
) != unknown_type_node
);
23318 /* Otherwise, build a NON_DEPENDENT_EXPR. */
23319 return build1 (NON_DEPENDENT_EXPR
, TREE_TYPE (expr
), expr
);
23322 /* ARGS is a vector of expressions as arguments to a function call.
23323 Replace the arguments with equivalent non-dependent expressions.
23324 This modifies ARGS in place. */
23327 make_args_non_dependent (vec
<tree
, va_gc
> *args
)
23332 FOR_EACH_VEC_SAFE_ELT (args
, ix
, arg
)
23334 tree newarg
= build_non_dependent_expr (arg
);
23336 (*args
)[ix
] = newarg
;
23340 /* Returns a type which represents 'auto' or 'decltype(auto)'. We use a
23341 TEMPLATE_TYPE_PARM with a level one deeper than the actual template
23345 make_auto_1 (tree name
)
23347 tree au
= cxx_make_type (TEMPLATE_TYPE_PARM
);
23348 TYPE_NAME (au
) = build_decl (input_location
,
23349 TYPE_DECL
, name
, au
);
23350 TYPE_STUB_DECL (au
) = TYPE_NAME (au
);
23351 TEMPLATE_TYPE_PARM_INDEX (au
) = build_template_parm_index
23352 (0, processing_template_decl
+ 1, processing_template_decl
+ 1,
23353 TYPE_NAME (au
), NULL_TREE
);
23354 TYPE_CANONICAL (au
) = canonical_type_parameter (au
);
23355 DECL_ARTIFICIAL (TYPE_NAME (au
)) = 1;
23356 SET_DECL_TEMPLATE_PARM_P (TYPE_NAME (au
));
23362 make_decltype_auto (void)
23364 return make_auto_1 (get_identifier ("decltype(auto)"));
23370 return make_auto_1 (get_identifier ("auto"));
23373 /* Given type ARG, return std::initializer_list<ARG>. */
23378 tree std_init_list
= namespace_binding
23379 (get_identifier ("initializer_list"), std_node
);
23381 if (!std_init_list
|| !DECL_CLASS_TEMPLATE_P (std_init_list
))
23383 error ("deducing from brace-enclosed initializer list requires "
23384 "#include <initializer_list>");
23385 return error_mark_node
;
23387 argvec
= make_tree_vec (1);
23388 TREE_VEC_ELT (argvec
, 0) = arg
;
23389 return lookup_template_class (std_init_list
, argvec
, NULL_TREE
,
23390 NULL_TREE
, 0, tf_warning_or_error
);
23393 /* Replace auto in TYPE with std::initializer_list<auto>. */
23396 listify_autos (tree type
, tree auto_node
)
23398 tree init_auto
= listify (auto_node
);
23399 tree argvec
= make_tree_vec (1);
23400 TREE_VEC_ELT (argvec
, 0) = init_auto
;
23401 if (processing_template_decl
)
23402 argvec
= add_to_template_args (current_template_args (), argvec
);
23403 return tsubst (type
, argvec
, tf_warning_or_error
, NULL_TREE
);
23406 /* Replace occurrences of 'auto' in TYPE with the appropriate type deduced
23407 from INIT. AUTO_NODE is the TEMPLATE_TYPE_PARM used for 'auto' in TYPE. */
23410 do_auto_deduction (tree type
, tree init
, tree auto_node
)
23412 return do_auto_deduction (type
, init
, auto_node
,
23413 tf_warning_or_error
,
23417 /* Replace occurrences of 'auto' in TYPE with the appropriate type deduced
23418 from INIT. AUTO_NODE is the TEMPLATE_TYPE_PARM used for 'auto' in TYPE.
23419 The CONTEXT determines the context in which auto deduction is performed
23420 and is used to control error diagnostics. */
23423 do_auto_deduction (tree type
, tree init
, tree auto_node
,
23424 tsubst_flags_t complain
, auto_deduction_context context
)
23428 if (init
== error_mark_node
)
23429 return error_mark_node
;
23431 if (type_dependent_expression_p (init
))
23432 /* Defining a subset of type-dependent expressions that we can deduce
23433 from ahead of time isn't worth the trouble. */
23436 /* [dcl.spec.auto]: Obtain P from T by replacing the occurrences of auto
23437 with either a new invented type template parameter U or, if the
23438 initializer is a braced-init-list (8.5.4), with
23439 std::initializer_list<U>. */
23440 if (BRACE_ENCLOSED_INITIALIZER_P (init
))
23442 if (!DIRECT_LIST_INIT_P (init
))
23443 type
= listify_autos (type
, auto_node
);
23444 else if (CONSTRUCTOR_NELTS (init
) == 1)
23445 init
= CONSTRUCTOR_ELT (init
, 0)->value
;
23448 if (complain
& tf_warning_or_error
)
23450 if (permerror (input_location
, "direct-list-initialization of "
23451 "%<auto%> requires exactly one element"))
23452 inform (input_location
,
23453 "for deduction to %<std::initializer_list%>, use copy-"
23454 "list-initialization (i.e. add %<=%> before the %<{%>)");
23456 type
= listify_autos (type
, auto_node
);
23460 init
= resolve_nondeduced_context (init
);
23462 targs
= make_tree_vec (1);
23463 if (AUTO_IS_DECLTYPE (auto_node
))
23465 bool id
= (DECL_P (init
) || (TREE_CODE (init
) == COMPONENT_REF
23466 && !REF_PARENTHESIZED_P (init
)));
23467 TREE_VEC_ELT (targs
, 0)
23468 = finish_decltype_type (init
, id
, tf_warning_or_error
);
23469 if (type
!= auto_node
)
23471 if (complain
& tf_error
)
23472 error ("%qT as type rather than plain %<decltype(auto)%>", type
);
23473 return error_mark_node
;
23478 tree parms
= build_tree_list (NULL_TREE
, type
);
23479 tree tparms
= make_tree_vec (1);
23482 TREE_VEC_ELT (tparms
, 0)
23483 = build_tree_list (NULL_TREE
, TYPE_NAME (auto_node
));
23484 val
= type_unification_real (tparms
, targs
, parms
, &init
, 1, 0,
23485 DEDUCE_CALL
, LOOKUP_NORMAL
,
23486 NULL
, /*explain_p=*/false);
23489 if (processing_template_decl
)
23490 /* Try again at instantiation time. */
23492 if (type
&& type
!= error_mark_node
23493 && (complain
& tf_error
))
23494 /* If type is error_mark_node a diagnostic must have been
23495 emitted by now. Also, having a mention to '<type error>'
23496 in the diagnostic is not really useful to the user. */
23498 if (cfun
&& auto_node
== current_function_auto_return_pattern
23499 && LAMBDA_FUNCTION_P (current_function_decl
))
23500 error ("unable to deduce lambda return type from %qE", init
);
23502 error ("unable to deduce %qT from %qE", type
, init
);
23504 return error_mark_node
;
23508 /* If the list of declarators contains more than one declarator, the type
23509 of each declared variable is determined as described above. If the
23510 type deduced for the template parameter U is not the same in each
23511 deduction, the program is ill-formed. */
23512 if (TREE_TYPE (auto_node
)
23513 && !same_type_p (TREE_TYPE (auto_node
), TREE_VEC_ELT (targs
, 0)))
23515 if (cfun
&& auto_node
== current_function_auto_return_pattern
23516 && LAMBDA_FUNCTION_P (current_function_decl
))
23517 error ("inconsistent types %qT and %qT deduced for "
23518 "lambda return type", TREE_TYPE (auto_node
),
23519 TREE_VEC_ELT (targs
, 0));
23521 error ("inconsistent deduction for %qT: %qT and then %qT",
23522 auto_node
, TREE_TYPE (auto_node
), TREE_VEC_ELT (targs
, 0));
23523 return error_mark_node
;
23525 if (context
!= adc_requirement
)
23526 TREE_TYPE (auto_node
) = TREE_VEC_ELT (targs
, 0);
23528 /* Check any placeholder constraints against the deduced type. */
23529 if (flag_concepts
&& !processing_template_decl
)
23530 if (tree constr
= PLACEHOLDER_TYPE_CONSTRAINTS (auto_node
))
23532 /* Use the deduced type to check the associated constraints. */
23533 if (!constraints_satisfied_p (constr
, targs
))
23535 if (complain
& tf_warning_or_error
)
23539 case adc_unspecified
:
23540 error("placeholder constraints not satisfied");
23542 case adc_variable_type
:
23543 error ("deduced initializer does not satisfy "
23544 "placeholder constraints");
23546 case adc_return_type
:
23547 error ("deduced return type does not satisfy "
23548 "placeholder constraints");
23550 case adc_requirement
:
23551 error ("deduced expression type does not saatisy "
23552 "placeholder constraints");
23555 diagnose_constraints (input_location
, constr
, targs
);
23557 return error_mark_node
;
23561 if (processing_template_decl
)
23562 targs
= add_to_template_args (current_template_args (), targs
);
23563 return tsubst (type
, targs
, complain
, NULL_TREE
);
23566 /* Substitutes LATE_RETURN_TYPE for 'auto' in TYPE and returns the
23570 splice_late_return_type (tree type
, tree late_return_type
)
23572 if (is_auto (type
))
23574 if (late_return_type
)
23575 return late_return_type
;
23577 tree idx
= get_template_parm_index (type
);
23578 if (TEMPLATE_PARM_LEVEL (idx
) <= processing_template_decl
)
23579 /* In an abbreviated function template we didn't know we were dealing
23580 with a function template when we saw the auto return type, so update
23581 it to have the correct level. */
23582 return make_auto_1 (TYPE_IDENTIFIER (type
));
23587 /* Returns true iff TYPE is a TEMPLATE_TYPE_PARM representing 'auto' or
23588 'decltype(auto)'. */
23591 is_auto (const_tree type
)
23593 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
23594 && (TYPE_IDENTIFIER (type
) == get_identifier ("auto")
23595 || TYPE_IDENTIFIER (type
) == get_identifier ("decltype(auto)")))
23601 /* Returns the TEMPLATE_TYPE_PARM in TYPE representing `auto' iff TYPE contains
23602 a use of `auto'. Returns NULL_TREE otherwise. */
23605 type_uses_auto (tree type
)
23607 return find_type_usage (type
, is_auto
);
23610 /* Returns true iff TYPE is a TEMPLATE_TYPE_PARM representing 'auto',
23611 'decltype(auto)' or a concept. */
23614 is_auto_or_concept (const_tree type
)
23616 return is_auto (type
); // or concept
23619 /* Returns the TEMPLATE_TYPE_PARM in TYPE representing a generic type (`auto' or
23620 a concept identifier) iff TYPE contains a use of a generic type. Returns
23621 NULL_TREE otherwise. */
23624 type_uses_auto_or_concept (tree type
)
23626 return find_type_usage (type
, is_auto_or_concept
);
23630 /* For a given template T, return the vector of typedefs referenced
23631 in T for which access check is needed at T instantiation time.
23632 T is either a FUNCTION_DECL or a RECORD_TYPE.
23633 Those typedefs were added to T by the function
23634 append_type_to_template_for_access_check. */
23636 vec
<qualified_typedef_usage_t
, va_gc
> *
23637 get_types_needing_access_check (tree t
)
23640 vec
<qualified_typedef_usage_t
, va_gc
> *result
= NULL
;
23642 if (!t
|| t
== error_mark_node
)
23645 if (!(ti
= get_template_info (t
)))
23648 if (CLASS_TYPE_P (t
)
23649 || TREE_CODE (t
) == FUNCTION_DECL
)
23651 if (!TI_TEMPLATE (ti
))
23654 result
= TI_TYPEDEFS_NEEDING_ACCESS_CHECKING (ti
);
23660 /* Append the typedef TYPE_DECL used in template T to a list of typedefs
23661 tied to T. That list of typedefs will be access checked at
23662 T instantiation time.
23663 T is either a FUNCTION_DECL or a RECORD_TYPE.
23664 TYPE_DECL is a TYPE_DECL node representing a typedef.
23665 SCOPE is the scope through which TYPE_DECL is accessed.
23666 LOCATION is the location of the usage point of TYPE_DECL.
23668 This function is a subroutine of
23669 append_type_to_template_for_access_check. */
23672 append_type_to_template_for_access_check_1 (tree t
,
23675 location_t location
)
23677 qualified_typedef_usage_t typedef_usage
;
23680 if (!t
|| t
== error_mark_node
)
23683 gcc_assert ((TREE_CODE (t
) == FUNCTION_DECL
23684 || CLASS_TYPE_P (t
))
23686 && TREE_CODE (type_decl
) == TYPE_DECL
23689 if (!(ti
= get_template_info (t
)))
23692 gcc_assert (TI_TEMPLATE (ti
));
23694 typedef_usage
.typedef_decl
= type_decl
;
23695 typedef_usage
.context
= scope
;
23696 typedef_usage
.locus
= location
;
23698 vec_safe_push (TI_TYPEDEFS_NEEDING_ACCESS_CHECKING (ti
), typedef_usage
);
23701 /* Append TYPE_DECL to the template TEMPL.
23702 TEMPL is either a class type, a FUNCTION_DECL or a a TEMPLATE_DECL.
23703 At TEMPL instanciation time, TYPE_DECL will be checked to see
23704 if it can be accessed through SCOPE.
23705 LOCATION is the location of the usage point of TYPE_DECL.
23707 e.g. consider the following code snippet:
23714 template<class U> struct S
23716 C::myint mi; // <-- usage point of the typedef C::myint
23721 At S<char> instantiation time, we need to check the access of C::myint
23722 In other words, we need to check the access of the myint typedef through
23723 the C scope. For that purpose, this function will add the myint typedef
23724 and the scope C through which its being accessed to a list of typedefs
23725 tied to the template S. That list will be walked at template instantiation
23726 time and access check performed on each typedefs it contains.
23727 Note that this particular code snippet should yield an error because
23728 myint is private to C. */
23731 append_type_to_template_for_access_check (tree templ
,
23734 location_t location
)
23736 qualified_typedef_usage_t
*iter
;
23739 gcc_assert (type_decl
&& (TREE_CODE (type_decl
) == TYPE_DECL
));
23741 /* Make sure we don't append the type to the template twice. */
23742 FOR_EACH_VEC_SAFE_ELT (get_types_needing_access_check (templ
), i
, iter
)
23743 if (iter
->typedef_decl
== type_decl
&& scope
== iter
->context
)
23746 append_type_to_template_for_access_check_1 (templ
, type_decl
,
23750 /* Convert the generic type parameters in PARM that match the types given in the
23751 range [START_IDX, END_IDX) from the current_template_parms into generic type
23755 convert_generic_types_to_packs (tree parm
, int start_idx
, int end_idx
)
23757 tree current
= current_template_parms
;
23758 int depth
= TMPL_PARMS_DEPTH (current
);
23759 current
= INNERMOST_TEMPLATE_PARMS (current
);
23760 tree replacement
= make_tree_vec (TREE_VEC_LENGTH (current
));
23762 for (int i
= 0; i
< start_idx
; ++i
)
23763 TREE_VEC_ELT (replacement
, i
)
23764 = TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (current
, i
)));
23766 for (int i
= start_idx
; i
< end_idx
; ++i
)
23768 /* Create a distinct parameter pack type from the current parm and add it
23769 to the replacement args to tsubst below into the generic function
23772 tree o
= TREE_TYPE (TREE_VALUE
23773 (TREE_VEC_ELT (current
, i
)));
23774 tree t
= copy_type (o
);
23775 TEMPLATE_TYPE_PARM_INDEX (t
)
23776 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (o
),
23778 TREE_TYPE (TEMPLATE_TYPE_DECL (t
)) = t
;
23779 TYPE_STUB_DECL (t
) = TYPE_NAME (t
) = TEMPLATE_TYPE_DECL (t
);
23780 TYPE_MAIN_VARIANT (t
) = t
;
23781 TEMPLATE_TYPE_PARAMETER_PACK (t
) = true;
23782 TYPE_CANONICAL (t
) = canonical_type_parameter (t
);
23783 TREE_VEC_ELT (replacement
, i
) = t
;
23784 TREE_VALUE (TREE_VEC_ELT (current
, i
)) = TREE_CHAIN (t
);
23787 for (int i
= end_idx
, e
= TREE_VEC_LENGTH (current
); i
< e
; ++i
)
23788 TREE_VEC_ELT (replacement
, i
)
23789 = TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (current
, i
)));
23791 /* If there are more levels then build up the replacement with the outer
23794 replacement
= add_to_template_args (template_parms_to_args
23795 (TREE_CHAIN (current_template_parms
)),
23798 return tsubst (parm
, replacement
, tf_none
, NULL_TREE
);
23801 /* Entries in the decl_constraint hash table. */
23802 struct GTY((for_user
)) constr_entry
23808 /* Hashing function and equality for constraint entries. */
23809 struct constr_hasher
: ggc_ptr_hash
<constr_entry
>
23811 static hashval_t
hash (constr_entry
*e
)
23813 return (hashval_t
)DECL_UID (e
->decl
);
23816 static bool equal (constr_entry
*e1
, constr_entry
*e2
)
23818 return e1
->decl
== e2
->decl
;
23822 /* A mapping from declarations to constraint information. Note that
23823 both templates and their underlying declarations are mapped to the
23824 same constraint information.
23826 FIXME: This is defined in pt.c because garbage collection
23827 code is not being generated for constraint.cc. */
23829 static GTY (()) hash_table
<constr_hasher
> *decl_constraints
;
23831 /* Returns true iff cinfo contains a valid set of constraints.
23832 This is the case when the associated requirements have been
23833 successfully decomposed into lists of atomic constraints.
23834 That is, when the saved assumptions are not error_mark_node. */
23837 valid_constraints_p (tree cinfo
)
23839 gcc_assert (cinfo
);
23840 return CI_ASSUMPTIONS (cinfo
) != error_mark_node
;
23843 /* Returns the template constraints of declaration T. If T is not
23844 constrained, return NULL_TREE. Note that T must be non-null. */
23847 get_constraints (tree t
)
23849 gcc_assert (DECL_P (t
));
23850 if (TREE_CODE (t
) == TEMPLATE_DECL
)
23851 t
= DECL_TEMPLATE_RESULT (t
);
23852 constr_entry elt
= { t
, NULL_TREE
};
23853 constr_entry
* found
= decl_constraints
->find (&elt
);
23860 /* Associate the given constraint information CI with the declaration
23861 T. If T is a template, then the constraints are associated with
23862 its underlying declaration. Don't build associations if CI is
23866 set_constraints (tree t
, tree ci
)
23871 if (TREE_CODE (t
) == TEMPLATE_DECL
)
23872 t
= DECL_TEMPLATE_RESULT (t
);
23873 gcc_assert (!get_constraints (t
));
23874 constr_entry elt
= {t
, ci
};
23875 constr_entry
** slot
= decl_constraints
->find_slot (&elt
, INSERT
);
23876 constr_entry
* entry
= ggc_alloc
<constr_entry
> ();
23881 /* Remove the associated constraints of the declaration T. */
23884 remove_constraints (tree t
)
23886 gcc_assert (DECL_P (t
));
23887 if (TREE_CODE (t
) == TEMPLATE_DECL
)
23888 t
= DECL_TEMPLATE_RESULT (t
);
23890 constr_entry elt
= {t
, NULL_TREE
};
23891 constr_entry
** slot
= decl_constraints
->find_slot (&elt
, NO_INSERT
);
23893 decl_constraints
->clear_slot (slot
);
23896 /* Set up the hash table for constraint association. */
23899 init_constraint_processing (void)
23901 decl_constraints
= hash_table
<constr_hasher
>::create_ggc(37);
23904 /* Set up the hash tables for template instantiations. */
23907 init_template_processing (void)
23909 decl_specializations
= hash_table
<spec_hasher
>::create_ggc (37);
23910 type_specializations
= hash_table
<spec_hasher
>::create_ggc (37);
23913 /* Print stats about the template hash tables for -fstats. */
23916 print_template_statistics (void)
23918 fprintf (stderr
, "decl_specializations: size %ld, %ld elements, "
23919 "%f collisions\n", (long) decl_specializations
->size (),
23920 (long) decl_specializations
->elements (),
23921 decl_specializations
->collisions ());
23922 fprintf (stderr
, "type_specializations: size %ld, %ld elements, "
23923 "%f collisions\n", (long) type_specializations
->size (),
23924 (long) type_specializations
->elements (),
23925 type_specializations
->collisions ());
23928 #include "gt-cp-pt.h"