1 /* Handle parameterized types (templates) for GNU -*- C++ -*-.
2 Copyright (C) 1992-2015 Free Software Foundation, Inc.
3 Written by Ken Raeburn (raeburn@cygnus.com) while at Watchmaker Computing.
4 Rewritten by Jason Merrill (jason@cygnus.com).
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3, or (at your option)
13 GCC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
22 /* Known bugs or deficiencies include:
24 all methods must be provided in header files; can't use a source
25 file that contains only the method templates and "just win". */
29 #include "coretypes.h"
33 #include "c-family/c-common.h"
35 #include "stringpool.h"
38 #include "stor-layout.h"
41 #include "c-family/c-objc.h"
42 #include "cp-objcp-common.h"
43 #include "tree-inline.h"
46 #include "tree-iterator.h"
47 #include "type-utils.h"
50 /* The type of functions taking a tree, and some additional data, and
52 typedef int (*tree_fn_t
) (tree
, void*);
54 /* The PENDING_TEMPLATES is a TREE_LIST of templates whose
55 instantiations have been deferred, either because their definitions
56 were not yet available, or because we were putting off doing the work. */
57 struct GTY ((chain_next ("%h.next"))) pending_template
{
58 struct pending_template
*next
;
59 struct tinst_level
*tinst
;
62 static GTY(()) struct pending_template
*pending_templates
;
63 static GTY(()) struct pending_template
*last_pending_template
;
65 int processing_template_parmlist
;
66 static int template_header_count
;
68 static GTY(()) tree saved_trees
;
69 static vec
<int> inline_parm_levels
;
71 static GTY(()) struct tinst_level
*current_tinst_level
;
73 static GTY(()) tree saved_access_scope
;
75 /* Live only within one (recursive) call to tsubst_expr. We use
76 this to pass the statement expression node from the STMT_EXPR
77 to the EXPR_STMT that is its result. */
78 static tree cur_stmt_expr
;
80 // -------------------------------------------------------------------------- //
81 // Local Specialization Stack
83 // Implementation of the RAII helper for creating new local
85 local_specialization_stack::local_specialization_stack ()
86 : saved (local_specializations
)
88 local_specializations
= new hash_map
<tree
, tree
>;
91 local_specialization_stack::~local_specialization_stack ()
93 delete local_specializations
;
94 local_specializations
= saved
;
97 /* True if we've recursed into fn_type_unification too many times. */
98 static bool excessive_deduction_depth
;
100 struct GTY((for_user
)) spec_entry
107 struct spec_hasher
: ggc_ptr_hash
<spec_entry
>
109 static hashval_t
hash (spec_entry
*);
110 static bool equal (spec_entry
*, spec_entry
*);
113 static GTY (()) hash_table
<spec_hasher
> *decl_specializations
;
115 static GTY (()) hash_table
<spec_hasher
> *type_specializations
;
117 /* Contains canonical template parameter types. The vector is indexed by
118 the TEMPLATE_TYPE_IDX of the template parameter. Each element is a
119 TREE_LIST, whose TREE_VALUEs contain the canonical template
120 parameters of various types and levels. */
121 static GTY(()) vec
<tree
, va_gc
> *canonical_template_parms
;
123 #define UNIFY_ALLOW_NONE 0
124 #define UNIFY_ALLOW_MORE_CV_QUAL 1
125 #define UNIFY_ALLOW_LESS_CV_QUAL 2
126 #define UNIFY_ALLOW_DERIVED 4
127 #define UNIFY_ALLOW_INTEGER 8
128 #define UNIFY_ALLOW_OUTER_LEVEL 16
129 #define UNIFY_ALLOW_OUTER_MORE_CV_QUAL 32
130 #define UNIFY_ALLOW_OUTER_LESS_CV_QUAL 64
132 enum template_base_result
{
134 tbr_ambiguous_baseclass
,
138 static void push_access_scope (tree
);
139 static void pop_access_scope (tree
);
140 static bool resolve_overloaded_unification (tree
, tree
, tree
, tree
,
141 unification_kind_t
, int,
143 static int try_one_overload (tree
, tree
, tree
, tree
, tree
,
144 unification_kind_t
, int, bool, bool);
145 static int unify (tree
, tree
, tree
, tree
, int, bool);
146 static void add_pending_template (tree
);
147 static tree
reopen_tinst_level (struct tinst_level
*);
148 static tree
tsubst_initializer_list (tree
, tree
);
149 static tree
get_partial_spec_bindings (tree
, tree
, tree
, tree
);
150 static tree
coerce_template_parms (tree
, tree
, tree
, tsubst_flags_t
,
152 static tree
coerce_innermost_template_parms (tree
, tree
, tree
, tsubst_flags_t
,
154 static void tsubst_enum (tree
, tree
, tree
);
155 static tree
add_to_template_args (tree
, tree
);
156 static tree
add_outermost_template_args (tree
, tree
);
157 static bool check_instantiated_args (tree
, tree
, tsubst_flags_t
);
158 static int maybe_adjust_types_for_deduction (unification_kind_t
, tree
*, tree
*,
160 static int type_unification_real (tree
, tree
, tree
, const tree
*,
161 unsigned int, int, unification_kind_t
, int,
162 vec
<deferred_access_check
, va_gc
> **,
164 static void note_template_header (int);
165 static tree
convert_nontype_argument_function (tree
, tree
, tsubst_flags_t
);
166 static tree
convert_nontype_argument (tree
, tree
, tsubst_flags_t
);
167 static tree
convert_template_argument (tree
, tree
, tree
,
168 tsubst_flags_t
, int, tree
);
169 static tree
for_each_template_parm (tree
, tree_fn_t
, void*,
170 hash_set
<tree
> *, bool);
171 static tree
expand_template_argument_pack (tree
);
172 static tree
build_template_parm_index (int, int, int, tree
, tree
);
173 static bool inline_needs_template_parms (tree
, bool);
174 static void push_inline_template_parms_recursive (tree
, int);
175 static tree
reduce_template_parm_level (tree
, tree
, int, tree
, tsubst_flags_t
);
176 static int mark_template_parm (tree
, void *);
177 static int template_parm_this_level_p (tree
, void *);
178 static tree
tsubst_friend_function (tree
, tree
);
179 static tree
tsubst_friend_class (tree
, tree
);
180 static int can_complete_type_without_circularity (tree
);
181 static tree
get_bindings (tree
, tree
, tree
, bool);
182 static int template_decl_level (tree
);
183 static int check_cv_quals_for_unify (int, tree
, tree
);
184 static void template_parm_level_and_index (tree
, int*, int*);
185 static int unify_pack_expansion (tree
, tree
, tree
,
186 tree
, unification_kind_t
, bool, bool);
187 static tree
tsubst_template_arg (tree
, tree
, tsubst_flags_t
, tree
);
188 static tree
tsubst_template_args (tree
, tree
, tsubst_flags_t
, tree
);
189 static tree
tsubst_template_parms (tree
, tree
, tsubst_flags_t
);
190 static void regenerate_decl_from_template (tree
, tree
);
191 static tree
most_specialized_partial_spec (tree
, tsubst_flags_t
);
192 static tree
tsubst_aggr_type (tree
, tree
, tsubst_flags_t
, tree
, int);
193 static tree
tsubst_arg_types (tree
, tree
, tree
, tsubst_flags_t
, tree
);
194 static tree
tsubst_function_type (tree
, tree
, tsubst_flags_t
, tree
);
195 static bool check_specialization_scope (void);
196 static tree
process_partial_specialization (tree
);
197 static void set_current_access_from_decl (tree
);
198 static enum template_base_result
get_template_base (tree
, tree
, tree
, tree
,
200 static tree
try_class_unification (tree
, tree
, tree
, tree
, bool);
201 static int coerce_template_template_parms (tree
, tree
, tsubst_flags_t
,
203 static bool template_template_parm_bindings_ok_p (tree
, tree
);
204 static int template_args_equal (tree
, tree
);
205 static void tsubst_default_arguments (tree
, tsubst_flags_t
);
206 static tree
for_each_template_parm_r (tree
*, int *, void *);
207 static tree
copy_default_args_to_explicit_spec_1 (tree
, tree
);
208 static void copy_default_args_to_explicit_spec (tree
);
209 static int invalid_nontype_parm_type_p (tree
, tsubst_flags_t
);
210 static bool dependent_template_arg_p (tree
);
211 static bool any_template_arguments_need_structural_equality_p (tree
);
212 static bool dependent_type_p_r (tree
);
213 static tree
tsubst_copy (tree
, tree
, tsubst_flags_t
, tree
);
214 static tree
tsubst_decl (tree
, tree
, tsubst_flags_t
);
215 static void perform_typedefs_access_check (tree tmpl
, tree targs
);
216 static void append_type_to_template_for_access_check_1 (tree
, tree
, tree
,
218 static tree
listify (tree
);
219 static tree
listify_autos (tree
, tree
);
220 static tree
tsubst_template_parm (tree
, tree
, tsubst_flags_t
);
221 static tree
instantiate_alias_template (tree
, tree
, tsubst_flags_t
);
222 static bool complex_alias_template_p (const_tree tmpl
);
224 /* Make the current scope suitable for access checking when we are
225 processing T. T can be FUNCTION_DECL for instantiated function
226 template, VAR_DECL for static member variable, or TYPE_DECL for
227 alias template (needed by instantiate_decl). */
230 push_access_scope (tree t
)
232 gcc_assert (VAR_OR_FUNCTION_DECL_P (t
)
233 || TREE_CODE (t
) == TYPE_DECL
);
235 if (DECL_FRIEND_CONTEXT (t
))
236 push_nested_class (DECL_FRIEND_CONTEXT (t
));
237 else if (DECL_CLASS_SCOPE_P (t
))
238 push_nested_class (DECL_CONTEXT (t
));
240 push_to_top_level ();
242 if (TREE_CODE (t
) == FUNCTION_DECL
)
244 saved_access_scope
= tree_cons
245 (NULL_TREE
, current_function_decl
, saved_access_scope
);
246 current_function_decl
= t
;
250 /* Restore the scope set up by push_access_scope. T is the node we
254 pop_access_scope (tree t
)
256 if (TREE_CODE (t
) == FUNCTION_DECL
)
258 current_function_decl
= TREE_VALUE (saved_access_scope
);
259 saved_access_scope
= TREE_CHAIN (saved_access_scope
);
262 if (DECL_FRIEND_CONTEXT (t
) || DECL_CLASS_SCOPE_P (t
))
265 pop_from_top_level ();
268 /* Do any processing required when DECL (a member template
269 declaration) is finished. Returns the TEMPLATE_DECL corresponding
270 to DECL, unless it is a specialization, in which case the DECL
271 itself is returned. */
274 finish_member_template_decl (tree decl
)
276 if (decl
== error_mark_node
)
277 return error_mark_node
;
279 gcc_assert (DECL_P (decl
));
281 if (TREE_CODE (decl
) == TYPE_DECL
)
285 type
= TREE_TYPE (decl
);
286 if (type
== error_mark_node
)
287 return error_mark_node
;
288 if (MAYBE_CLASS_TYPE_P (type
)
289 && CLASSTYPE_TEMPLATE_INFO (type
)
290 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
292 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
293 check_member_template (tmpl
);
298 else if (TREE_CODE (decl
) == FIELD_DECL
)
299 error ("data member %qD cannot be a member template", decl
);
300 else if (DECL_TEMPLATE_INFO (decl
))
302 if (!DECL_TEMPLATE_SPECIALIZATION (decl
))
304 check_member_template (DECL_TI_TEMPLATE (decl
));
305 return DECL_TI_TEMPLATE (decl
);
311 error ("invalid member template declaration %qD", decl
);
313 return error_mark_node
;
316 /* Create a template info node. */
319 build_template_info (tree template_decl
, tree template_args
)
321 tree result
= make_node (TEMPLATE_INFO
);
322 TI_TEMPLATE (result
) = template_decl
;
323 TI_ARGS (result
) = template_args
;
327 /* Return the template info node corresponding to T, whatever T is. */
330 get_template_info (const_tree t
)
332 tree tinfo
= NULL_TREE
;
334 if (!t
|| t
== error_mark_node
)
337 if (TREE_CODE (t
) == NAMESPACE_DECL
)
340 if (DECL_P (t
) && DECL_LANG_SPECIFIC (t
))
341 tinfo
= DECL_TEMPLATE_INFO (t
);
343 if (!tinfo
&& DECL_IMPLICIT_TYPEDEF_P (t
))
346 if (OVERLOAD_TYPE_P (t
))
347 tinfo
= TYPE_TEMPLATE_INFO (t
);
348 else if (TREE_CODE (t
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
349 tinfo
= TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t
);
354 /* Returns the template nesting level of the indicated class TYPE.
364 A<T>::B<U> has depth two, while A<T> has depth one.
365 Both A<T>::B<int> and A<int>::B<U> have depth one, if
366 they are instantiations, not specializations.
368 This function is guaranteed to return 0 if passed NULL_TREE so
369 that, for example, `template_class_depth (current_class_type)' is
373 template_class_depth (tree type
)
378 type
&& TREE_CODE (type
) != NAMESPACE_DECL
;
379 type
= (TREE_CODE (type
) == FUNCTION_DECL
)
380 ? CP_DECL_CONTEXT (type
) : CP_TYPE_CONTEXT (type
))
382 tree tinfo
= get_template_info (type
);
384 if (tinfo
&& PRIMARY_TEMPLATE_P (TI_TEMPLATE (tinfo
))
385 && uses_template_parms (INNERMOST_TEMPLATE_ARGS (TI_ARGS (tinfo
))))
392 /* Subroutine of maybe_begin_member_template_processing.
393 Returns true if processing DECL needs us to push template parms. */
396 inline_needs_template_parms (tree decl
, bool nsdmi
)
398 if (!decl
|| (!nsdmi
&& ! DECL_TEMPLATE_INFO (decl
)))
401 return (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (most_general_template (decl
)))
402 > (processing_template_decl
+ DECL_TEMPLATE_SPECIALIZATION (decl
)));
405 /* Subroutine of maybe_begin_member_template_processing.
406 Push the template parms in PARMS, starting from LEVELS steps into the
407 chain, and ending at the beginning, since template parms are listed
411 push_inline_template_parms_recursive (tree parmlist
, int levels
)
413 tree parms
= TREE_VALUE (parmlist
);
417 push_inline_template_parms_recursive (TREE_CHAIN (parmlist
), levels
- 1);
419 ++processing_template_decl
;
420 current_template_parms
421 = tree_cons (size_int (processing_template_decl
),
422 parms
, current_template_parms
);
423 TEMPLATE_PARMS_FOR_INLINE (current_template_parms
) = 1;
425 begin_scope (TREE_VEC_LENGTH (parms
) ? sk_template_parms
: sk_template_spec
,
427 for (i
= 0; i
< TREE_VEC_LENGTH (parms
); ++i
)
429 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
431 if (error_operand_p (parm
))
434 gcc_assert (DECL_P (parm
));
436 switch (TREE_CODE (parm
))
445 /* Make a CONST_DECL as is done in process_template_parm.
446 It is ugly that we recreate this here; the original
447 version built in process_template_parm is no longer
449 tree decl
= build_decl (DECL_SOURCE_LOCATION (parm
),
450 CONST_DECL
, DECL_NAME (parm
),
452 DECL_ARTIFICIAL (decl
) = 1;
453 TREE_CONSTANT (decl
) = 1;
454 TREE_READONLY (decl
) = 1;
455 DECL_INITIAL (decl
) = DECL_INITIAL (parm
);
456 SET_DECL_TEMPLATE_PARM_P (decl
);
467 /* Restore the template parameter context for a member template, a
468 friend template defined in a class definition, or a non-template
469 member of template class. */
472 maybe_begin_member_template_processing (tree decl
)
476 bool nsdmi
= TREE_CODE (decl
) == FIELD_DECL
;
480 tree ctx
= DECL_CONTEXT (decl
);
481 decl
= (CLASSTYPE_TEMPLATE_INFO (ctx
)
482 /* Disregard full specializations (c++/60999). */
483 && uses_template_parms (ctx
)
484 ? CLASSTYPE_TI_TEMPLATE (ctx
) : NULL_TREE
);
487 if (inline_needs_template_parms (decl
, nsdmi
))
489 parms
= DECL_TEMPLATE_PARMS (most_general_template (decl
));
490 levels
= TMPL_PARMS_DEPTH (parms
) - processing_template_decl
;
492 if (DECL_TEMPLATE_SPECIALIZATION (decl
))
495 parms
= TREE_CHAIN (parms
);
498 push_inline_template_parms_recursive (parms
, levels
);
501 /* Remember how many levels of template parameters we pushed so that
502 we can pop them later. */
503 inline_parm_levels
.safe_push (levels
);
506 /* Undo the effects of maybe_begin_member_template_processing. */
509 maybe_end_member_template_processing (void)
514 if (inline_parm_levels
.length () == 0)
517 last
= inline_parm_levels
.pop ();
518 for (i
= 0; i
< last
; ++i
)
520 --processing_template_decl
;
521 current_template_parms
= TREE_CHAIN (current_template_parms
);
526 /* Return a new template argument vector which contains all of ARGS,
527 but has as its innermost set of arguments the EXTRA_ARGS. */
530 add_to_template_args (tree args
, tree extra_args
)
537 if (args
== NULL_TREE
|| extra_args
== error_mark_node
)
540 extra_depth
= TMPL_ARGS_DEPTH (extra_args
);
541 new_args
= make_tree_vec (TMPL_ARGS_DEPTH (args
) + extra_depth
);
543 for (i
= 1; i
<= TMPL_ARGS_DEPTH (args
); ++i
)
544 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (args
, i
));
546 for (j
= 1; j
<= extra_depth
; ++j
, ++i
)
547 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (extra_args
, j
));
552 /* Like add_to_template_args, but only the outermost ARGS are added to
553 the EXTRA_ARGS. In particular, all but TMPL_ARGS_DEPTH
554 (EXTRA_ARGS) levels are added. This function is used to combine
555 the template arguments from a partial instantiation with the
556 template arguments used to attain the full instantiation from the
557 partial instantiation. */
560 add_outermost_template_args (tree args
, tree extra_args
)
564 /* If there are more levels of EXTRA_ARGS than there are ARGS,
565 something very fishy is going on. */
566 gcc_assert (TMPL_ARGS_DEPTH (args
) >= TMPL_ARGS_DEPTH (extra_args
));
568 /* If *all* the new arguments will be the EXTRA_ARGS, just return
570 if (TMPL_ARGS_DEPTH (args
) == TMPL_ARGS_DEPTH (extra_args
))
573 /* For the moment, we make ARGS look like it contains fewer levels. */
574 TREE_VEC_LENGTH (args
) -= TMPL_ARGS_DEPTH (extra_args
);
576 new_args
= add_to_template_args (args
, extra_args
);
578 /* Now, we restore ARGS to its full dimensions. */
579 TREE_VEC_LENGTH (args
) += TMPL_ARGS_DEPTH (extra_args
);
584 /* Return the N levels of innermost template arguments from the ARGS. */
587 get_innermost_template_args (tree args
, int n
)
595 /* If N is 1, just return the innermost set of template arguments. */
597 return TMPL_ARGS_LEVEL (args
, TMPL_ARGS_DEPTH (args
));
599 /* If we're not removing anything, just return the arguments we were
601 extra_levels
= TMPL_ARGS_DEPTH (args
) - n
;
602 gcc_assert (extra_levels
>= 0);
603 if (extra_levels
== 0)
606 /* Make a new set of arguments, not containing the outer arguments. */
607 new_args
= make_tree_vec (n
);
608 for (i
= 1; i
<= n
; ++i
)
609 SET_TMPL_ARGS_LEVEL (new_args
, i
,
610 TMPL_ARGS_LEVEL (args
, i
+ extra_levels
));
615 /* The inverse of get_innermost_template_args: Return all but the innermost
616 EXTRA_LEVELS levels of template arguments from the ARGS. */
619 strip_innermost_template_args (tree args
, int extra_levels
)
622 int n
= TMPL_ARGS_DEPTH (args
) - extra_levels
;
627 /* If N is 1, just return the outermost set of template arguments. */
629 return TMPL_ARGS_LEVEL (args
, 1);
631 /* If we're not removing anything, just return the arguments we were
633 gcc_assert (extra_levels
>= 0);
634 if (extra_levels
== 0)
637 /* Make a new set of arguments, not containing the inner arguments. */
638 new_args
= make_tree_vec (n
);
639 for (i
= 1; i
<= n
; ++i
)
640 SET_TMPL_ARGS_LEVEL (new_args
, i
,
641 TMPL_ARGS_LEVEL (args
, i
));
646 /* We've got a template header coming up; push to a new level for storing
650 begin_template_parm_list (void)
652 /* We use a non-tag-transparent scope here, which causes pushtag to
653 put tags in this scope, rather than in the enclosing class or
654 namespace scope. This is the right thing, since we want
655 TEMPLATE_DECLS, and not TYPE_DECLS for template classes. For a
656 global template class, push_template_decl handles putting the
657 TEMPLATE_DECL into top-level scope. For a nested template class,
660 template <class T> struct S1 {
661 template <class T> struct S2 {};
664 pushtag contains special code to call pushdecl_with_scope on the
665 TEMPLATE_DECL for S2. */
666 begin_scope (sk_template_parms
, NULL
);
667 ++processing_template_decl
;
668 ++processing_template_parmlist
;
669 note_template_header (0);
671 /* Add a dummy parameter level while we process the parameter list. */
672 current_template_parms
673 = tree_cons (size_int (processing_template_decl
),
675 current_template_parms
);
678 /* This routine is called when a specialization is declared. If it is
679 invalid to declare a specialization here, an error is reported and
680 false is returned, otherwise this routine will return true. */
683 check_specialization_scope (void)
685 tree scope
= current_scope ();
689 An explicit specialization shall be declared in the namespace of
690 which the template is a member, or, for member templates, in the
691 namespace of which the enclosing class or enclosing class
692 template is a member. An explicit specialization of a member
693 function, member class or static data member of a class template
694 shall be declared in the namespace of which the class template
696 if (scope
&& TREE_CODE (scope
) != NAMESPACE_DECL
)
698 error ("explicit specialization in non-namespace scope %qD", scope
);
704 In an explicit specialization declaration for a member of a class
705 template or a member template that appears in namespace scope,
706 the member template and some of its enclosing class templates may
707 remain unspecialized, except that the declaration shall not
708 explicitly specialize a class member template if its enclosing
709 class templates are not explicitly specialized as well. */
710 if (current_template_parms
)
712 error ("enclosing class templates are not explicitly specialized");
719 /* We've just seen template <>. */
722 begin_specialization (void)
724 begin_scope (sk_template_spec
, NULL
);
725 note_template_header (1);
726 return check_specialization_scope ();
729 /* Called at then end of processing a declaration preceded by
733 end_specialization (void)
736 reset_specialization ();
739 /* Any template <>'s that we have seen thus far are not referring to a
740 function specialization. */
743 reset_specialization (void)
745 processing_specialization
= 0;
746 template_header_count
= 0;
749 /* We've just seen a template header. If SPECIALIZATION is nonzero,
750 it was of the form template <>. */
753 note_template_header (int specialization
)
755 processing_specialization
= specialization
;
756 template_header_count
++;
759 /* We're beginning an explicit instantiation. */
762 begin_explicit_instantiation (void)
764 gcc_assert (!processing_explicit_instantiation
);
765 processing_explicit_instantiation
= true;
770 end_explicit_instantiation (void)
772 gcc_assert (processing_explicit_instantiation
);
773 processing_explicit_instantiation
= false;
776 /* An explicit specialization or partial specialization of TMPL is being
777 declared. Check that the namespace in which the specialization is
778 occurring is permissible. Returns false iff it is invalid to
779 specialize TMPL in the current namespace. */
782 check_specialization_namespace (tree tmpl
)
784 tree tpl_ns
= decl_namespace_context (tmpl
);
788 An explicit specialization shall be declared in the namespace of
789 which the template is a member, or, for member templates, in the
790 namespace of which the enclosing class or enclosing class
791 template is a member. An explicit specialization of a member
792 function, member class or static data member of a class template
793 shall be declared in the namespace of which the class template is
795 if (current_scope() != DECL_CONTEXT (tmpl
)
796 && !at_namespace_scope_p ())
798 error ("specialization of %qD must appear at namespace scope", tmpl
);
801 if (is_associated_namespace (current_namespace
, tpl_ns
))
802 /* Same or super-using namespace. */
806 permerror (input_location
,
807 "specialization of %qD in different namespace", tmpl
);
808 permerror (DECL_SOURCE_LOCATION (tmpl
),
809 " from definition of %q#D", tmpl
);
814 /* SPEC is an explicit instantiation. Check that it is valid to
815 perform this explicit instantiation in the current namespace. */
818 check_explicit_instantiation_namespace (tree spec
)
822 /* DR 275: An explicit instantiation shall appear in an enclosing
823 namespace of its template. */
824 ns
= decl_namespace_context (spec
);
825 if (!is_ancestor (current_namespace
, ns
))
826 permerror (input_location
, "explicit instantiation of %qD in namespace %qD "
827 "(which does not enclose namespace %qD)",
828 spec
, current_namespace
, ns
);
831 // Returns the type of a template specialization only if that
832 // specialization needs to be defined. Otherwise (e.g., if the type has
833 // already been defined), the function returns NULL_TREE.
835 maybe_new_partial_specialization (tree type
)
837 // An implicit instantiation of an incomplete type implies
838 // the definition of a new class template.
840 // template<typename T>
843 // template<typename T>
846 // Here, S<T*> is an implicit instantiation of S whose type
848 if (CLASSTYPE_IMPLICIT_INSTANTIATION (type
) && !COMPLETE_TYPE_P (type
))
851 // It can also be the case that TYPE is a completed specialization.
852 // Continuing the previous example, suppose we also declare:
854 // template<typename T>
855 // requires Integral<T>
858 // Here, S<T*> refers to the specialization S<T*> defined
859 // above. However, we need to differentiate definitions because
860 // we intend to define a new partial specialization. In this case,
861 // we rely on the fact that the constraints are different for
862 // this declaration than that above.
864 // Note that we also get here for injected class names and
865 // late-parsed template definitions. We must ensure that we
866 // do not create new type declarations for those cases.
867 if (flag_concepts
&& CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
869 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
870 tree args
= CLASSTYPE_TI_ARGS (type
);
872 // If there are no template parameters, this cannot be a new
873 // partial template specializtion?
874 if (!current_template_parms
)
877 // If the constraints are not the same as those of the primary
878 // then, we can probably create a new specialization.
879 tree type_constr
= current_template_constraints ();
881 if (type
== TREE_TYPE (tmpl
))
882 if (tree main_constr
= get_constraints (tmpl
))
883 if (equivalent_constraints (type_constr
, main_constr
))
886 // Also, if there's a pre-existing specialization with matching
887 // constraints, then this also isn't new.
888 tree specs
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
891 tree spec_tmpl
= TREE_VALUE (specs
);
892 tree spec_args
= TREE_PURPOSE (specs
);
893 tree spec_constr
= get_constraints (spec_tmpl
);
894 if (comp_template_args (args
, spec_args
)
895 && equivalent_constraints (type_constr
, spec_constr
))
897 specs
= TREE_CHAIN (specs
);
900 // Create a new type node (and corresponding type decl)
901 // for the newly declared specialization.
902 tree t
= make_class_type (TREE_CODE (type
));
903 CLASSTYPE_DECLARED_CLASS (t
) = CLASSTYPE_DECLARED_CLASS (type
);
904 TYPE_FOR_JAVA (t
) = TYPE_FOR_JAVA (type
);
905 SET_TYPE_TEMPLATE_INFO (t
, build_template_info (tmpl
, args
));
907 /* We only need a separate type node for storing the definition of this
908 partial specialization; uses of S<T*> are unconstrained, so all are
909 equivalent. So keep TYPE_CANONICAL the same. */
910 TYPE_CANONICAL (t
) = TYPE_CANONICAL (type
);
912 // Build the corresponding type decl.
913 tree d
= create_implicit_typedef (DECL_NAME (tmpl
), t
);
914 DECL_CONTEXT (d
) = TYPE_CONTEXT (t
);
915 DECL_SOURCE_LOCATION (d
) = input_location
;
923 /* The TYPE is being declared. If it is a template type, that means it
924 is a partial specialization. Do appropriate error-checking. */
927 maybe_process_partial_specialization (tree type
)
931 if (type
== error_mark_node
)
932 return error_mark_node
;
934 /* A lambda that appears in specialization context is not itself a
936 if (CLASS_TYPE_P (type
) && CLASSTYPE_LAMBDA_EXPR (type
))
939 if (TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
941 error ("name of class shadows template template parameter %qD",
943 return error_mark_node
;
946 context
= TYPE_CONTEXT (type
);
948 if (TYPE_ALIAS_P (type
))
950 if (TYPE_TEMPLATE_INFO (type
)
951 && DECL_ALIAS_TEMPLATE_P (TYPE_TI_TEMPLATE (type
)))
952 error ("specialization of alias template %qD",
953 TYPE_TI_TEMPLATE (type
));
955 error ("explicit specialization of non-template %qT", type
);
956 return error_mark_node
;
958 else if (CLASS_TYPE_P (type
) && CLASSTYPE_USE_TEMPLATE (type
))
960 /* This is for ordinary explicit specialization and partial
961 specialization of a template class such as:
963 template <> class C<int>;
967 template <class T> class C<T*>;
969 Make sure that `C<int>' and `C<T*>' are implicit instantiations. */
971 if (tree t
= maybe_new_partial_specialization (type
))
973 if (!check_specialization_namespace (CLASSTYPE_TI_TEMPLATE (t
))
974 && !at_namespace_scope_p ())
975 return error_mark_node
;
976 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (t
);
977 DECL_SOURCE_LOCATION (TYPE_MAIN_DECL (t
)) = input_location
;
978 if (processing_template_decl
)
980 tree decl
= push_template_decl (TYPE_MAIN_DECL (t
));
981 if (decl
== error_mark_node
)
982 return error_mark_node
;
983 return TREE_TYPE (decl
);
986 else if (CLASSTYPE_TEMPLATE_INSTANTIATION (type
))
987 error ("specialization of %qT after instantiation", type
);
988 else if (errorcount
&& !processing_specialization
989 && CLASSTYPE_TEMPLATE_SPECIALIZATION (type
)
990 && !uses_template_parms (CLASSTYPE_TI_ARGS (type
)))
991 /* Trying to define a specialization either without a template<> header
992 or in an inappropriate place. We've already given an error, so just
993 bail now so we don't actually define the specialization. */
994 return error_mark_node
;
996 else if (CLASS_TYPE_P (type
)
997 && !CLASSTYPE_USE_TEMPLATE (type
)
998 && CLASSTYPE_TEMPLATE_INFO (type
)
999 && context
&& CLASS_TYPE_P (context
)
1000 && CLASSTYPE_TEMPLATE_INFO (context
))
1002 /* This is for an explicit specialization of member class
1003 template according to [temp.expl.spec/18]:
1005 template <> template <class U> class C<int>::D;
1007 The context `C<int>' must be an implicit instantiation.
1008 Otherwise this is just a member class template declared
1011 template <> class C<int> { template <class U> class D; };
1012 template <> template <class U> class C<int>::D;
1014 In the first case, `C<int>::D' is a specialization of `C<T>::D'
1015 while in the second case, `C<int>::D' is a primary template
1016 and `C<T>::D' may not exist. */
1018 if (CLASSTYPE_IMPLICIT_INSTANTIATION (context
)
1019 && !COMPLETE_TYPE_P (type
))
1022 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
1024 if (current_namespace
1025 != decl_namespace_context (tmpl
))
1027 permerror (input_location
,
1028 "specializing %q#T in different namespace", type
);
1029 permerror (DECL_SOURCE_LOCATION (tmpl
),
1030 " from definition of %q#D", tmpl
);
1033 /* Check for invalid specialization after instantiation:
1035 template <> template <> class C<int>::D<int>;
1036 template <> template <class U> class C<int>::D; */
1038 for (t
= DECL_TEMPLATE_INSTANTIATIONS (tmpl
);
1039 t
; t
= TREE_CHAIN (t
))
1041 tree inst
= TREE_VALUE (t
);
1042 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (inst
)
1043 || !COMPLETE_OR_OPEN_TYPE_P (inst
))
1045 /* We already have a full specialization of this partial
1046 instantiation, or a full specialization has been
1047 looked up but not instantiated. Reassign it to the
1048 new member specialization template. */
1052 elt
.tmpl
= most_general_template (tmpl
);
1053 elt
.args
= CLASSTYPE_TI_ARGS (inst
);
1056 type_specializations
->remove_elt (&elt
);
1059 elt
.args
= INNERMOST_TEMPLATE_ARGS (elt
.args
);
1062 = type_specializations
->find_slot (&elt
, INSERT
);
1063 entry
= ggc_alloc
<spec_entry
> ();
1068 /* But if we've had an implicit instantiation, that's a
1069 problem ([temp.expl.spec]/6). */
1070 error ("specialization %qT after instantiation %qT",
1074 /* Mark TYPE as a specialization. And as a result, we only
1075 have one level of template argument for the innermost
1077 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type
);
1078 DECL_SOURCE_LOCATION (TYPE_MAIN_DECL (type
)) = input_location
;
1079 CLASSTYPE_TI_ARGS (type
)
1080 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type
));
1083 else if (processing_specialization
)
1085 /* Someday C++0x may allow for enum template specialization. */
1086 if (cxx_dialect
> cxx98
&& TREE_CODE (type
) == ENUMERAL_TYPE
1087 && CLASS_TYPE_P (context
) && CLASSTYPE_USE_TEMPLATE (context
))
1088 pedwarn (input_location
, OPT_Wpedantic
, "template specialization "
1089 "of %qD not allowed by ISO C++", type
);
1092 error ("explicit specialization of non-template %qT", type
);
1093 return error_mark_node
;
1100 /* Returns nonzero if we can optimize the retrieval of specializations
1101 for TMPL, a TEMPLATE_DECL. In particular, for such a template, we
1102 do not use DECL_TEMPLATE_SPECIALIZATIONS at all. */
1105 optimize_specialization_lookup_p (tree tmpl
)
1107 return (DECL_FUNCTION_TEMPLATE_P (tmpl
)
1108 && DECL_CLASS_SCOPE_P (tmpl
)
1109 /* DECL_CLASS_SCOPE_P holds of T::f even if T is a template
1111 && CLASS_TYPE_P (DECL_CONTEXT (tmpl
))
1112 /* The optimized lookup depends on the fact that the
1113 template arguments for the member function template apply
1114 purely to the containing class, which is not true if the
1115 containing class is an explicit or partial
1117 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (tmpl
))
1118 && !DECL_MEMBER_TEMPLATE_P (tmpl
)
1119 && !DECL_CONV_FN_P (tmpl
)
1120 /* It is possible to have a template that is not a member
1121 template and is not a member of a template class:
1123 template <typename T>
1124 struct S { friend A::f(); };
1126 Here, the friend function is a template, but the context does
1127 not have template information. The optimized lookup relies
1128 on having ARGS be the template arguments for both the class
1129 and the function template. */
1130 && !DECL_FRIEND_P (DECL_TEMPLATE_RESULT (tmpl
)));
1133 /* Make sure ARGS doesn't use any inappropriate typedefs; we should have
1134 gone through coerce_template_parms by now. */
1137 verify_unstripped_args (tree args
)
1139 ++processing_template_decl
;
1140 if (!any_dependent_template_arguments_p (args
))
1142 tree inner
= INNERMOST_TEMPLATE_ARGS (args
);
1143 for (int i
= 0; i
< TREE_VEC_LENGTH (inner
); ++i
)
1145 tree arg
= TREE_VEC_ELT (inner
, i
);
1146 if (TREE_CODE (arg
) == TEMPLATE_DECL
)
1148 else if (TYPE_P (arg
))
1149 gcc_assert (strip_typedefs (arg
, NULL
) == arg
);
1150 else if (strip_typedefs (TREE_TYPE (arg
), NULL
) != TREE_TYPE (arg
))
1151 /* Allow typedefs on the type of a non-type argument, since a
1152 parameter can have them. */;
1154 gcc_assert (strip_typedefs_expr (arg
, NULL
) == arg
);
1157 --processing_template_decl
;
1160 /* Retrieve the specialization (in the sense of [temp.spec] - a
1161 specialization is either an instantiation or an explicit
1162 specialization) of TMPL for the given template ARGS. If there is
1163 no such specialization, return NULL_TREE. The ARGS are a vector of
1164 arguments, or a vector of vectors of arguments, in the case of
1165 templates with more than one level of parameters.
1167 If TMPL is a type template and CLASS_SPECIALIZATIONS_P is true,
1168 then we search for a partial specialization matching ARGS. This
1169 parameter is ignored if TMPL is not a class template.
1171 We can also look up a FIELD_DECL, if it is a lambda capture pack; the
1172 result is a NONTYPE_ARGUMENT_PACK. */
1175 retrieve_specialization (tree tmpl
, tree args
, hashval_t hash
)
1177 if (tmpl
== NULL_TREE
)
1180 if (args
== error_mark_node
)
1183 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
1184 || TREE_CODE (tmpl
) == FIELD_DECL
);
1186 /* There should be as many levels of arguments as there are
1187 levels of parameters. */
1188 gcc_assert (TMPL_ARGS_DEPTH (args
)
1189 == (TREE_CODE (tmpl
) == TEMPLATE_DECL
1190 ? TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
))
1191 : template_class_depth (DECL_CONTEXT (tmpl
))));
1194 verify_unstripped_args (args
);
1196 if (optimize_specialization_lookup_p (tmpl
))
1198 tree class_template
;
1199 tree class_specialization
;
1200 vec
<tree
, va_gc
> *methods
;
1204 /* The template arguments actually apply to the containing
1205 class. Find the class specialization with those
1207 class_template
= CLASSTYPE_TI_TEMPLATE (DECL_CONTEXT (tmpl
));
1208 class_specialization
1209 = retrieve_specialization (class_template
, args
, 0);
1210 if (!class_specialization
)
1212 /* Now, find the appropriate entry in the CLASSTYPE_METHOD_VEC
1213 for the specialization. */
1214 idx
= class_method_index_for_fn (class_specialization
, tmpl
);
1217 /* Iterate through the methods with the indicated name, looking
1218 for the one that has an instance of TMPL. */
1219 methods
= CLASSTYPE_METHOD_VEC (class_specialization
);
1220 for (fns
= (*methods
)[idx
]; fns
; fns
= OVL_NEXT (fns
))
1222 tree fn
= OVL_CURRENT (fns
);
1223 if (DECL_TEMPLATE_INFO (fn
) && DECL_TI_TEMPLATE (fn
) == tmpl
1224 /* using-declarations can add base methods to the method vec,
1225 and we don't want those here. */
1226 && DECL_CONTEXT (fn
) == class_specialization
)
1235 hash_table
<spec_hasher
> *specializations
;
1239 elt
.spec
= NULL_TREE
;
1241 if (DECL_CLASS_TEMPLATE_P (tmpl
))
1242 specializations
= type_specializations
;
1244 specializations
= decl_specializations
;
1247 hash
= spec_hasher::hash (&elt
);
1248 found
= specializations
->find_with_hash (&elt
, hash
);
1256 /* Like retrieve_specialization, but for local declarations. */
1259 retrieve_local_specialization (tree tmpl
)
1261 if (local_specializations
== NULL
)
1264 tree
*slot
= local_specializations
->get (tmpl
);
1265 return slot
? *slot
: NULL_TREE
;
1268 /* Returns nonzero iff DECL is a specialization of TMPL. */
1271 is_specialization_of (tree decl
, tree tmpl
)
1275 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1279 t
= DECL_TEMPLATE_INFO (t
) ? DECL_TI_TEMPLATE (t
) : NULL_TREE
)
1285 gcc_assert (TREE_CODE (decl
) == TYPE_DECL
);
1287 for (t
= TREE_TYPE (decl
);
1289 t
= CLASSTYPE_USE_TEMPLATE (t
)
1290 ? TREE_TYPE (CLASSTYPE_TI_TEMPLATE (t
)) : NULL_TREE
)
1291 if (same_type_ignoring_top_level_qualifiers_p (t
, TREE_TYPE (tmpl
)))
1298 /* Returns nonzero iff DECL is a specialization of friend declaration
1299 FRIEND_DECL according to [temp.friend]. */
1302 is_specialization_of_friend (tree decl
, tree friend_decl
)
1304 bool need_template
= true;
1307 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
1308 || TREE_CODE (decl
) == TYPE_DECL
);
1310 /* For [temp.friend/6] when FRIEND_DECL is an ordinary member function
1311 of a template class, we want to check if DECL is a specialization
1313 if (TREE_CODE (friend_decl
) == FUNCTION_DECL
1314 && DECL_TEMPLATE_INFO (friend_decl
)
1315 && !DECL_USE_TEMPLATE (friend_decl
))
1317 /* We want a TEMPLATE_DECL for `is_specialization_of'. */
1318 friend_decl
= DECL_TI_TEMPLATE (friend_decl
);
1319 need_template
= false;
1321 else if (TREE_CODE (friend_decl
) == TEMPLATE_DECL
1322 && !PRIMARY_TEMPLATE_P (friend_decl
))
1323 need_template
= false;
1325 /* There is nothing to do if this is not a template friend. */
1326 if (TREE_CODE (friend_decl
) != TEMPLATE_DECL
)
1329 if (is_specialization_of (decl
, friend_decl
))
1333 A member of a class template may be declared to be a friend of a
1334 non-template class. In this case, the corresponding member of
1335 every specialization of the class template is a friend of the
1336 class granting friendship.
1338 For example, given a template friend declaration
1340 template <class T> friend void A<T>::f();
1342 the member function below is considered a friend
1344 template <> struct A<int> {
1348 For this type of template friend, TEMPLATE_DEPTH below will be
1349 nonzero. To determine if DECL is a friend of FRIEND, we first
1350 check if the enclosing class is a specialization of another. */
1352 template_depth
= template_class_depth (CP_DECL_CONTEXT (friend_decl
));
1354 && DECL_CLASS_SCOPE_P (decl
)
1355 && is_specialization_of (TYPE_NAME (DECL_CONTEXT (decl
)),
1356 CLASSTYPE_TI_TEMPLATE (DECL_CONTEXT (friend_decl
))))
1358 /* Next, we check the members themselves. In order to handle
1359 a few tricky cases, such as when FRIEND_DECL's are
1361 template <class T> friend void A<T>::g(T t);
1362 template <class T> template <T t> friend void A<T>::h();
1366 void A<int>::g(int);
1367 template <int> void A<int>::h();
1369 we need to figure out ARGS, the template arguments from
1370 the context of DECL. This is required for template substitution
1371 of `T' in the function parameter of `g' and template parameter
1372 of `h' in the above examples. Here ARGS corresponds to `int'. */
1374 tree context
= DECL_CONTEXT (decl
);
1375 tree args
= NULL_TREE
;
1376 int current_depth
= 0;
1378 while (current_depth
< template_depth
)
1380 if (CLASSTYPE_TEMPLATE_INFO (context
))
1382 if (current_depth
== 0)
1383 args
= TYPE_TI_ARGS (context
);
1385 args
= add_to_template_args (TYPE_TI_ARGS (context
), args
);
1388 context
= TYPE_CONTEXT (context
);
1391 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1396 tree friend_args_type
;
1397 tree decl_args_type
;
1399 /* Make sure that both DECL and FRIEND_DECL are templates or
1401 is_template
= DECL_TEMPLATE_INFO (decl
)
1402 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl
));
1403 if (need_template
^ is_template
)
1405 else if (is_template
)
1407 /* If both are templates, check template parameter list. */
1409 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_decl
),
1411 if (!comp_template_parms
1412 (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (decl
)),
1416 decl_type
= TREE_TYPE (DECL_TI_TEMPLATE (decl
));
1419 decl_type
= TREE_TYPE (decl
);
1421 friend_type
= tsubst_function_type (TREE_TYPE (friend_decl
), args
,
1422 tf_none
, NULL_TREE
);
1423 if (friend_type
== error_mark_node
)
1426 /* Check if return types match. */
1427 if (!same_type_p (TREE_TYPE (decl_type
), TREE_TYPE (friend_type
)))
1430 /* Check if function parameter types match, ignoring the
1431 `this' parameter. */
1432 friend_args_type
= TYPE_ARG_TYPES (friend_type
);
1433 decl_args_type
= TYPE_ARG_TYPES (decl_type
);
1434 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (friend_decl
))
1435 friend_args_type
= TREE_CHAIN (friend_args_type
);
1436 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1437 decl_args_type
= TREE_CHAIN (decl_args_type
);
1439 return compparms (decl_args_type
, friend_args_type
);
1443 /* DECL is a TYPE_DECL */
1445 tree decl_type
= TREE_TYPE (decl
);
1447 /* Make sure that both DECL and FRIEND_DECL are templates or
1450 = CLASSTYPE_TEMPLATE_INFO (decl_type
)
1451 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (decl_type
));
1453 if (need_template
^ is_template
)
1455 else if (is_template
)
1458 /* If both are templates, check the name of the two
1459 TEMPLATE_DECL's first because is_friend didn't. */
1460 if (DECL_NAME (CLASSTYPE_TI_TEMPLATE (decl_type
))
1461 != DECL_NAME (friend_decl
))
1464 /* Now check template parameter list. */
1466 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_decl
),
1468 return comp_template_parms
1469 (DECL_TEMPLATE_PARMS (CLASSTYPE_TI_TEMPLATE (decl_type
)),
1473 return (DECL_NAME (decl
)
1474 == DECL_NAME (friend_decl
));
1480 /* Register the specialization SPEC as a specialization of TMPL with
1481 the indicated ARGS. IS_FRIEND indicates whether the specialization
1482 is actually just a friend declaration. Returns SPEC, or an
1483 equivalent prior declaration, if available.
1485 We also store instantiations of field packs in the hash table, even
1486 though they are not themselves templates, to make lookup easier. */
1489 register_specialization (tree spec
, tree tmpl
, tree args
, bool is_friend
,
1493 spec_entry
**slot
= NULL
;
1496 gcc_assert ((TREE_CODE (tmpl
) == TEMPLATE_DECL
&& DECL_P (spec
))
1497 || (TREE_CODE (tmpl
) == FIELD_DECL
1498 && TREE_CODE (spec
) == NONTYPE_ARGUMENT_PACK
));
1500 if (TREE_CODE (spec
) == FUNCTION_DECL
1501 && uses_template_parms (DECL_TI_ARGS (spec
)))
1502 /* This is the FUNCTION_DECL for a partial instantiation. Don't
1503 register it; we want the corresponding TEMPLATE_DECL instead.
1504 We use `uses_template_parms (DECL_TI_ARGS (spec))' rather than
1505 the more obvious `uses_template_parms (spec)' to avoid problems
1506 with default function arguments. In particular, given
1507 something like this:
1509 template <class T> void f(T t1, T t = T())
1511 the default argument expression is not substituted for in an
1512 instantiation unless and until it is actually needed. */
1515 if (optimize_specialization_lookup_p (tmpl
))
1516 /* We don't put these specializations in the hash table, but we might
1517 want to give an error about a mismatch. */
1518 fn
= retrieve_specialization (tmpl
, args
, 0);
1526 hash
= spec_hasher::hash (&elt
);
1529 decl_specializations
->find_slot_with_hash (&elt
, hash
, INSERT
);
1531 fn
= ((spec_entry
*) *slot
)->spec
;
1536 /* We can sometimes try to re-register a specialization that we've
1537 already got. In particular, regenerate_decl_from_template calls
1538 duplicate_decls which will update the specialization list. But,
1539 we'll still get called again here anyhow. It's more convenient
1540 to simply allow this than to try to prevent it. */
1543 else if (fn
&& DECL_TEMPLATE_SPECIALIZATION (spec
))
1545 if (DECL_TEMPLATE_INSTANTIATION (fn
))
1547 if (DECL_ODR_USED (fn
)
1548 || DECL_EXPLICIT_INSTANTIATION (fn
))
1550 error ("specialization of %qD after instantiation",
1552 return error_mark_node
;
1557 /* This situation should occur only if the first
1558 specialization is an implicit instantiation, the
1559 second is an explicit specialization, and the
1560 implicit instantiation has not yet been used. That
1561 situation can occur if we have implicitly
1562 instantiated a member function and then specialized
1565 We can also wind up here if a friend declaration that
1566 looked like an instantiation turns out to be a
1569 template <class T> void foo(T);
1570 class S { friend void foo<>(int) };
1571 template <> void foo(int);
1573 We transform the existing DECL in place so that any
1574 pointers to it become pointers to the updated
1577 If there was a definition for the template, but not
1578 for the specialization, we want this to look as if
1579 there were no definition, and vice versa. */
1580 DECL_INITIAL (fn
) = NULL_TREE
;
1581 duplicate_decls (spec
, fn
, is_friend
);
1582 /* The call to duplicate_decls will have applied
1585 An explicit specialization of a function template
1586 is inline only if it is explicitly declared to be,
1587 and independently of whether its function template
1590 to the primary function; now copy the inline bits to
1591 the various clones. */
1592 FOR_EACH_CLONE (clone
, fn
)
1594 DECL_DECLARED_INLINE_P (clone
)
1595 = DECL_DECLARED_INLINE_P (fn
);
1596 DECL_SOURCE_LOCATION (clone
)
1597 = DECL_SOURCE_LOCATION (fn
);
1598 DECL_DELETED_FN (clone
)
1599 = DECL_DELETED_FN (fn
);
1601 check_specialization_namespace (tmpl
);
1606 else if (DECL_TEMPLATE_SPECIALIZATION (fn
))
1608 if (!duplicate_decls (spec
, fn
, is_friend
) && DECL_INITIAL (spec
))
1609 /* Dup decl failed, but this is a new definition. Set the
1610 line number so any errors match this new
1612 DECL_SOURCE_LOCATION (fn
) = DECL_SOURCE_LOCATION (spec
);
1618 return duplicate_decls (spec
, fn
, is_friend
);
1620 /* A specialization must be declared in the same namespace as the
1621 template it is specializing. */
1622 if (DECL_P (spec
) && DECL_TEMPLATE_SPECIALIZATION (spec
)
1623 && !check_specialization_namespace (tmpl
))
1624 DECL_CONTEXT (spec
) = DECL_CONTEXT (tmpl
);
1626 if (slot
!= NULL
/* !optimize_specialization_lookup_p (tmpl) */)
1628 spec_entry
*entry
= ggc_alloc
<spec_entry
> ();
1629 gcc_assert (tmpl
&& args
&& spec
);
1632 if ((TREE_CODE (spec
) == FUNCTION_DECL
&& DECL_NAMESPACE_SCOPE_P (spec
)
1633 && PRIMARY_TEMPLATE_P (tmpl
)
1634 && DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (tmpl
)) == NULL_TREE
)
1635 || variable_template_p (tmpl
))
1636 /* If TMPL is a forward declaration of a template function, keep a list
1637 of all specializations in case we need to reassign them to a friend
1638 template later in tsubst_friend_function.
1640 Also keep a list of all variable template instantiations so that
1641 process_partial_specialization can check whether a later partial
1642 specialization would have used it. */
1643 DECL_TEMPLATE_INSTANTIATIONS (tmpl
)
1644 = tree_cons (args
, spec
, DECL_TEMPLATE_INSTANTIATIONS (tmpl
));
1650 /* Returns true iff two spec_entry nodes are equivalent. */
1652 int comparing_specializations
;
1655 spec_hasher::equal (spec_entry
*e1
, spec_entry
*e2
)
1659 ++comparing_specializations
;
1660 equal
= (e1
->tmpl
== e2
->tmpl
1661 && comp_template_args (e1
->args
, e2
->args
));
1662 if (equal
&& flag_concepts
1663 /* tmpl could be a FIELD_DECL for a capture pack. */
1664 && TREE_CODE (e1
->tmpl
) == TEMPLATE_DECL
1665 && VAR_P (DECL_TEMPLATE_RESULT (e1
->tmpl
))
1666 && uses_template_parms (e1
->args
))
1668 /* Partial specializations of a variable template can be distinguished by
1670 tree c1
= e1
->spec
? get_constraints (e1
->spec
) : NULL_TREE
;
1671 tree c2
= e2
->spec
? get_constraints (e2
->spec
) : NULL_TREE
;
1672 equal
= equivalent_constraints (c1
, c2
);
1674 --comparing_specializations
;
1679 /* Returns a hash for a template TMPL and template arguments ARGS. */
1682 hash_tmpl_and_args (tree tmpl
, tree args
)
1684 hashval_t val
= iterative_hash_object (DECL_UID (tmpl
), 0);
1685 return iterative_hash_template_arg (args
, val
);
1688 /* Returns a hash for a spec_entry node based on the TMPL and ARGS members,
1692 spec_hasher::hash (spec_entry
*e
)
1694 return hash_tmpl_and_args (e
->tmpl
, e
->args
);
1697 /* Recursively calculate a hash value for a template argument ARG, for use
1698 in the hash tables of template specializations. */
1701 iterative_hash_template_arg (tree arg
, hashval_t val
)
1703 unsigned HOST_WIDE_INT i
;
1704 enum tree_code code
;
1707 if (arg
== NULL_TREE
)
1708 return iterative_hash_object (arg
, val
);
1713 if (TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
1714 /* We can get one of these when re-hashing a previous entry in the middle
1715 of substituting into a pack expansion. Just look through it. */
1716 arg
= ARGUMENT_PACK_SELECT_FROM_PACK (arg
);
1718 code
= TREE_CODE (arg
);
1719 tclass
= TREE_CODE_CLASS (code
);
1721 val
= iterative_hash_object (code
, val
);
1728 case IDENTIFIER_NODE
:
1729 return iterative_hash_object (IDENTIFIER_HASH_VALUE (arg
), val
);
1733 int i
, len
= TREE_VEC_LENGTH (arg
);
1734 for (i
= 0; i
< len
; ++i
)
1735 val
= iterative_hash_template_arg (TREE_VEC_ELT (arg
, i
), val
);
1739 case TYPE_PACK_EXPANSION
:
1740 case EXPR_PACK_EXPANSION
:
1741 val
= iterative_hash_template_arg (PACK_EXPANSION_PATTERN (arg
), val
);
1742 return iterative_hash_template_arg (PACK_EXPANSION_EXTRA_ARGS (arg
), val
);
1744 case TYPE_ARGUMENT_PACK
:
1745 case NONTYPE_ARGUMENT_PACK
:
1746 return iterative_hash_template_arg (ARGUMENT_PACK_ARGS (arg
), val
);
1749 for (; arg
; arg
= TREE_CHAIN (arg
))
1750 val
= iterative_hash_template_arg (TREE_VALUE (arg
), val
);
1754 for (; arg
; arg
= OVL_NEXT (arg
))
1755 val
= iterative_hash_template_arg (OVL_CURRENT (arg
), val
);
1761 iterative_hash_template_arg (TREE_TYPE (arg
), val
);
1762 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (arg
), i
, field
, value
)
1764 val
= iterative_hash_template_arg (field
, val
);
1765 val
= iterative_hash_template_arg (value
, val
);
1771 if (!DECL_ARTIFICIAL (arg
))
1773 val
= iterative_hash_object (DECL_PARM_INDEX (arg
), val
);
1774 val
= iterative_hash_object (DECL_PARM_LEVEL (arg
), val
);
1776 return iterative_hash_template_arg (TREE_TYPE (arg
), val
);
1779 return iterative_hash_template_arg (TARGET_EXPR_INITIAL (arg
), val
);
1782 val
= iterative_hash_template_arg (PTRMEM_CST_CLASS (arg
), val
);
1783 return iterative_hash_template_arg (PTRMEM_CST_MEMBER (arg
), val
);
1785 case TEMPLATE_PARM_INDEX
:
1786 val
= iterative_hash_template_arg
1787 (TREE_TYPE (TEMPLATE_PARM_DECL (arg
)), val
);
1788 val
= iterative_hash_object (TEMPLATE_PARM_LEVEL (arg
), val
);
1789 return iterative_hash_object (TEMPLATE_PARM_IDX (arg
), val
);
1792 val
= iterative_hash_object (TRAIT_EXPR_KIND (arg
), val
);
1793 val
= iterative_hash_template_arg (TRAIT_EXPR_TYPE1 (arg
), val
);
1794 return iterative_hash_template_arg (TRAIT_EXPR_TYPE2 (arg
), val
);
1797 val
= iterative_hash_template_arg (BINFO_TYPE (BASELINK_BINFO (arg
)),
1799 return iterative_hash_template_arg (DECL_NAME (get_first_fn (arg
)),
1803 val
= iterative_hash_template_arg (TREE_OPERAND (arg
, 0), val
);
1804 code
= TREE_CODE (TREE_OPERAND (arg
, 1));
1805 val
= iterative_hash_object (code
, val
);
1806 return iterative_hash_template_arg (TREE_OPERAND (arg
, 2), val
);
1809 /* A lambda can't appear in a template arg, but don't crash on
1811 gcc_assert (seen_error ());
1815 case IMPLICIT_CONV_EXPR
:
1816 case STATIC_CAST_EXPR
:
1817 case REINTERPRET_CAST_EXPR
:
1818 case CONST_CAST_EXPR
:
1819 case DYNAMIC_CAST_EXPR
:
1821 val
= iterative_hash_template_arg (TREE_TYPE (arg
), val
);
1822 /* Now hash operands as usual. */
1832 if (alias_template_specialization_p (arg
))
1834 // We want an alias specialization that survived strip_typedefs
1835 // to hash differently from its TYPE_CANONICAL, to avoid hash
1836 // collisions that compare as different in template_args_equal.
1837 // These could be dependent specializations that strip_typedefs
1838 // left alone, or untouched specializations because
1839 // coerce_template_parms returns the unconverted template
1840 // arguments if it sees incomplete argument packs.
1841 tree ti
= TYPE_TEMPLATE_INFO (arg
);
1842 return hash_tmpl_and_args (TI_TEMPLATE (ti
), TI_ARGS (ti
));
1844 if (TYPE_CANONICAL (arg
))
1845 return iterative_hash_object (TYPE_HASH (TYPE_CANONICAL (arg
)),
1847 else if (TREE_CODE (arg
) == DECLTYPE_TYPE
)
1848 return iterative_hash_template_arg (DECLTYPE_TYPE_EXPR (arg
), val
);
1849 /* Otherwise just compare the types during lookup. */
1852 case tcc_declaration
:
1854 return iterative_hash_expr (arg
, val
);
1857 gcc_assert (IS_EXPR_CODE_CLASS (tclass
));
1859 unsigned n
= cp_tree_operand_length (arg
);
1860 for (i
= 0; i
< n
; ++i
)
1861 val
= iterative_hash_template_arg (TREE_OPERAND (arg
, i
), val
);
1869 /* Unregister the specialization SPEC as a specialization of TMPL.
1870 Replace it with NEW_SPEC, if NEW_SPEC is non-NULL. Returns true
1871 if the SPEC was listed as a specialization of TMPL.
1873 Note that SPEC has been ggc_freed, so we can't look inside it. */
1876 reregister_specialization (tree spec
, tree tinfo
, tree new_spec
)
1881 elt
.tmpl
= most_general_template (TI_TEMPLATE (tinfo
));
1882 elt
.args
= TI_ARGS (tinfo
);
1883 elt
.spec
= NULL_TREE
;
1885 entry
= decl_specializations
->find (&elt
);
1888 gcc_assert (entry
->spec
== spec
|| entry
->spec
== new_spec
);
1889 gcc_assert (new_spec
!= NULL_TREE
);
1890 entry
->spec
= new_spec
;
1897 /* Like register_specialization, but for local declarations. We are
1898 registering SPEC, an instantiation of TMPL. */
1901 register_local_specialization (tree spec
, tree tmpl
)
1903 local_specializations
->put (tmpl
, spec
);
1906 /* TYPE is a class type. Returns true if TYPE is an explicitly
1907 specialized class. */
1910 explicit_class_specialization_p (tree type
)
1912 if (!CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
1914 return !uses_template_parms (CLASSTYPE_TI_ARGS (type
));
1917 /* Print the list of functions at FNS, going through all the overloads
1918 for each element of the list. Alternatively, FNS can not be a
1919 TREE_LIST, in which case it will be printed together with all the
1922 MORE and *STR should respectively be FALSE and NULL when the function
1923 is called from the outside. They are used internally on recursive
1924 calls. print_candidates manages the two parameters and leaves NULL
1925 in *STR when it ends. */
1928 print_candidates_1 (tree fns
, bool more
, const char **str
)
1931 char *spaces
= NULL
;
1933 for (fn
= fns
; fn
; fn
= OVL_NEXT (fn
))
1934 if (TREE_CODE (fn
) == TREE_LIST
)
1936 for (fn2
= fn
; fn2
!= NULL_TREE
; fn2
= TREE_CHAIN (fn2
))
1937 print_candidates_1 (TREE_VALUE (fn2
),
1938 TREE_CHAIN (fn2
) || more
, str
);
1942 tree cand
= OVL_CURRENT (fn
);
1945 /* Pick the prefix string. */
1946 if (!more
&& !OVL_NEXT (fns
))
1948 inform (DECL_SOURCE_LOCATION (cand
),
1949 "candidate is: %#D", cand
);
1953 *str
= _("candidates are:");
1954 spaces
= get_spaces (*str
);
1956 inform (DECL_SOURCE_LOCATION (cand
), "%s %#D", *str
, cand
);
1957 *str
= spaces
? spaces
: *str
;
1967 /* Print the list of candidate FNS in an error message. FNS can also
1968 be a TREE_LIST of non-functions in the case of an ambiguous lookup. */
1971 print_candidates (tree fns
)
1973 const char *str
= NULL
;
1974 print_candidates_1 (fns
, false, &str
);
1975 gcc_assert (str
== NULL
);
1978 /* Get a (possibly) constrained template declaration for the
1979 purpose of ordering candidates. */
1981 get_template_for_ordering (tree list
)
1983 gcc_assert (TREE_CODE (list
) == TREE_LIST
);
1984 tree f
= TREE_VALUE (list
);
1985 if (tree ti
= DECL_TEMPLATE_INFO (f
))
1986 return TI_TEMPLATE (ti
);
1990 /* Among candidates having the same signature, return the
1991 most constrained or NULL_TREE if there is no best candidate.
1992 If the signatures of candidates vary (e.g., template
1993 specialization vs. member function), then there can be no
1996 Note that we don't compare constraints on the functions
1997 themselves, but rather those of their templates. */
1999 most_constrained_function (tree candidates
)
2001 // Try to find the best candidate in a first pass.
2002 tree champ
= candidates
;
2003 for (tree c
= TREE_CHAIN (champ
); c
; c
= TREE_CHAIN (c
))
2005 int winner
= more_constrained (get_template_for_ordering (champ
),
2006 get_template_for_ordering (c
));
2008 champ
= c
; // The candidate is more constrained
2009 else if (winner
== 0)
2010 return NULL_TREE
; // Neither is more constrained
2013 // Verify that the champ is better than previous candidates.
2014 for (tree c
= candidates
; c
!= champ
; c
= TREE_CHAIN (c
)) {
2015 if (!more_constrained (get_template_for_ordering (champ
),
2016 get_template_for_ordering (c
)))
2024 /* Returns the template (one of the functions given by TEMPLATE_ID)
2025 which can be specialized to match the indicated DECL with the
2026 explicit template args given in TEMPLATE_ID. The DECL may be
2027 NULL_TREE if none is available. In that case, the functions in
2028 TEMPLATE_ID are non-members.
2030 If NEED_MEMBER_TEMPLATE is nonzero the function is known to be a
2031 specialization of a member template.
2033 The TEMPLATE_COUNT is the number of references to qualifying
2034 template classes that appeared in the name of the function. See
2035 check_explicit_specialization for a more accurate description.
2037 TSK indicates what kind of template declaration (if any) is being
2038 declared. TSK_TEMPLATE indicates that the declaration given by
2039 DECL, though a FUNCTION_DECL, has template parameters, and is
2040 therefore a template function.
2042 The template args (those explicitly specified and those deduced)
2043 are output in a newly created vector *TARGS_OUT.
2045 If it is impossible to determine the result, an error message is
2046 issued. The error_mark_node is returned to indicate failure. */
2049 determine_specialization (tree template_id
,
2052 int need_member_template
,
2058 tree explicit_targs
;
2059 tree candidates
= NULL_TREE
;
2061 /* A TREE_LIST of templates of which DECL may be a specialization.
2062 The TREE_VALUE of each node is a TEMPLATE_DECL. The
2063 corresponding TREE_PURPOSE is the set of template arguments that,
2064 when used to instantiate the template, would produce a function
2065 with the signature of DECL. */
2066 tree templates
= NULL_TREE
;
2068 cp_binding_level
*b
;
2070 *targs_out
= NULL_TREE
;
2072 if (template_id
== error_mark_node
|| decl
== error_mark_node
)
2073 return error_mark_node
;
2075 /* We shouldn't be specializing a member template of an
2076 unspecialized class template; we already gave an error in
2077 check_specialization_scope, now avoid crashing. */
2078 if (template_count
&& DECL_CLASS_SCOPE_P (decl
)
2079 && template_class_depth (DECL_CONTEXT (decl
)) > 0)
2081 gcc_assert (errorcount
);
2082 return error_mark_node
;
2085 fns
= TREE_OPERAND (template_id
, 0);
2086 explicit_targs
= TREE_OPERAND (template_id
, 1);
2088 if (fns
== error_mark_node
)
2089 return error_mark_node
;
2091 /* Check for baselinks. */
2092 if (BASELINK_P (fns
))
2093 fns
= BASELINK_FUNCTIONS (fns
);
2095 if (TREE_CODE (decl
) == FUNCTION_DECL
&& !is_overloaded_fn (fns
))
2097 error ("%qD is not a function template", fns
);
2098 return error_mark_node
;
2100 else if (VAR_P (decl
) && !variable_template_p (fns
))
2102 error ("%qD is not a variable template", fns
);
2103 return error_mark_node
;
2106 /* Count the number of template headers specified for this
2109 for (b
= current_binding_level
;
2110 b
->kind
== sk_template_parms
;
2114 tree orig_fns
= fns
;
2116 if (variable_template_p (fns
))
2118 tree parms
= INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (fns
));
2119 targs
= coerce_template_parms (parms
, explicit_targs
, fns
,
2120 tf_warning_or_error
,
2121 /*req_all*/true, /*use_defarg*/true);
2122 if (targs
!= error_mark_node
)
2123 templates
= tree_cons (targs
, fns
, templates
);
2125 else for (; fns
; fns
= OVL_NEXT (fns
))
2127 tree fn
= OVL_CURRENT (fns
);
2129 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
2131 tree decl_arg_types
;
2135 /* In case of explicit specialization, we need to check if
2136 the number of template headers appearing in the specialization
2137 is correct. This is usually done in check_explicit_specialization,
2138 but the check done there cannot be exhaustive when specializing
2139 member functions. Consider the following code:
2141 template <> void A<int>::f(int);
2142 template <> template <> void A<int>::f(int);
2144 Assuming that A<int> is not itself an explicit specialization
2145 already, the first line specializes "f" which is a non-template
2146 member function, whilst the second line specializes "f" which
2147 is a template member function. So both lines are syntactically
2148 correct, and check_explicit_specialization does not reject
2151 Here, we can do better, as we are matching the specialization
2152 against the declarations. We count the number of template
2153 headers, and we check if they match TEMPLATE_COUNT + 1
2154 (TEMPLATE_COUNT is the number of qualifying template classes,
2155 plus there must be another header for the member template
2158 Notice that if header_count is zero, this is not a
2159 specialization but rather a template instantiation, so there
2160 is no check we can perform here. */
2161 if (header_count
&& header_count
!= template_count
+ 1)
2164 /* Check that the number of template arguments at the
2165 innermost level for DECL is the same as for FN. */
2166 if (current_binding_level
->kind
== sk_template_parms
2167 && !current_binding_level
->explicit_spec_p
2168 && (TREE_VEC_LENGTH (DECL_INNERMOST_TEMPLATE_PARMS (fn
))
2169 != TREE_VEC_LENGTH (INNERMOST_TEMPLATE_PARMS
2170 (current_template_parms
))))
2173 /* DECL might be a specialization of FN. */
2174 decl_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
2175 fn_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
2177 /* For a non-static member function, we need to make sure
2178 that the const qualification is the same. Since
2179 get_bindings does not try to merge the "this" parameter,
2180 we must do the comparison explicitly. */
2181 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
2182 && !same_type_p (TREE_VALUE (fn_arg_types
),
2183 TREE_VALUE (decl_arg_types
)))
2186 /* Skip the "this" parameter and, for constructors of
2187 classes with virtual bases, the VTT parameter. A
2188 full specialization of a constructor will have a VTT
2189 parameter, but a template never will. */
2191 = skip_artificial_parms_for (decl
, decl_arg_types
);
2193 = skip_artificial_parms_for (fn
, fn_arg_types
);
2195 /* Function templates cannot be specializations; there are
2196 no partial specializations of functions. Therefore, if
2197 the type of DECL does not match FN, there is no
2200 Note that it should never be the case that we have both
2201 candidates added here, and for regular member functions
2203 if (tsk
== tsk_template
)
2205 if (compparms (fn_arg_types
, decl_arg_types
))
2206 candidates
= tree_cons (NULL_TREE
, fn
, candidates
);
2210 /* See whether this function might be a specialization of this
2211 template. Suppress access control because we might be trying
2212 to make this specialization a friend, and we have already done
2213 access control for the declaration of the specialization. */
2214 push_deferring_access_checks (dk_no_check
);
2215 targs
= get_bindings (fn
, decl
, explicit_targs
, /*check_ret=*/true);
2216 pop_deferring_access_checks ();
2219 /* We cannot deduce template arguments that when used to
2220 specialize TMPL will produce DECL. */
2223 /* Remove, from the set of candidates, all those functions
2224 whose constraints are not satisfied. */
2225 if (flag_concepts
&& !constraints_satisfied_p (fn
, targs
))
2228 // Then, try to form the new function type.
2229 insttype
= tsubst (TREE_TYPE (fn
), targs
, tf_none
, NULL_TREE
);
2230 if (insttype
== error_mark_node
)
2233 = skip_artificial_parms_for (fn
, TYPE_ARG_TYPES (insttype
));
2234 if (!compparms (fn_arg_types
, decl_arg_types
))
2237 /* Save this template, and the arguments deduced. */
2238 templates
= tree_cons (targs
, fn
, templates
);
2240 else if (need_member_template
)
2241 /* FN is an ordinary member function, and we need a
2242 specialization of a member template. */
2244 else if (TREE_CODE (fn
) != FUNCTION_DECL
)
2245 /* We can get IDENTIFIER_NODEs here in certain erroneous
2248 else if (!DECL_FUNCTION_MEMBER_P (fn
))
2249 /* This is just an ordinary non-member function. Nothing can
2250 be a specialization of that. */
2252 else if (DECL_ARTIFICIAL (fn
))
2253 /* Cannot specialize functions that are created implicitly. */
2257 tree decl_arg_types
;
2259 /* This is an ordinary member function. However, since
2260 we're here, we can assume its enclosing class is a
2261 template class. For example,
2263 template <typename T> struct S { void f(); };
2264 template <> void S<int>::f() {}
2266 Here, S<int>::f is a non-template, but S<int> is a
2267 template class. If FN has the same type as DECL, we
2268 might be in business. */
2270 if (!DECL_TEMPLATE_INFO (fn
))
2271 /* Its enclosing class is an explicit specialization
2272 of a template class. This is not a candidate. */
2275 if (!same_type_p (TREE_TYPE (TREE_TYPE (decl
)),
2276 TREE_TYPE (TREE_TYPE (fn
))))
2277 /* The return types differ. */
2280 /* Adjust the type of DECL in case FN is a static member. */
2281 decl_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
2282 if (DECL_STATIC_FUNCTION_P (fn
)
2283 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
2284 decl_arg_types
= TREE_CHAIN (decl_arg_types
);
2286 if (!compparms (TYPE_ARG_TYPES (TREE_TYPE (fn
)),
2290 // If the deduced arguments do not satisfy the constraints,
2291 // this is not a candidate.
2292 if (flag_concepts
&& !constraints_satisfied_p (fn
))
2295 // Add the candidate.
2296 candidates
= tree_cons (NULL_TREE
, fn
, candidates
);
2300 if (templates
&& TREE_CHAIN (templates
))
2306 It is possible for a specialization with a given function
2307 signature to be instantiated from more than one function
2308 template. In such cases, explicit specification of the
2309 template arguments must be used to uniquely identify the
2310 function template specialization being specialized.
2312 Note that here, there's no suggestion that we're supposed to
2313 determine which of the candidate templates is most
2314 specialized. However, we, also have:
2318 Partial ordering of overloaded function template
2319 declarations is used in the following contexts to select
2320 the function template to which a function template
2321 specialization refers:
2323 -- when an explicit specialization refers to a function
2326 So, we do use the partial ordering rules, at least for now.
2327 This extension can only serve to make invalid programs valid,
2328 so it's safe. And, there is strong anecdotal evidence that
2329 the committee intended the partial ordering rules to apply;
2330 the EDG front end has that behavior, and John Spicer claims
2331 that the committee simply forgot to delete the wording in
2332 [temp.expl.spec]. */
2333 tree tmpl
= most_specialized_instantiation (templates
);
2334 if (tmpl
!= error_mark_node
)
2337 TREE_CHAIN (templates
) = NULL_TREE
;
2341 // Concepts allows multiple declarations of member functions
2342 // with the same signature. Like above, we need to rely on
2343 // on the partial ordering of those candidates to determine which
2345 if (flag_concepts
&& candidates
&& TREE_CHAIN (candidates
))
2347 if (tree cand
= most_constrained_function (candidates
))
2350 TREE_CHAIN (cand
) = NULL_TREE
;
2354 if (templates
== NULL_TREE
&& candidates
== NULL_TREE
)
2356 error ("template-id %qD for %q+D does not match any template "
2357 "declaration", template_id
, decl
);
2358 if (header_count
&& header_count
!= template_count
+ 1)
2359 inform (input_location
, "saw %d %<template<>%>, need %d for "
2360 "specializing a member function template",
2361 header_count
, template_count
+ 1);
2363 print_candidates (orig_fns
);
2364 return error_mark_node
;
2366 else if ((templates
&& TREE_CHAIN (templates
))
2367 || (candidates
&& TREE_CHAIN (candidates
))
2368 || (templates
&& candidates
))
2370 error ("ambiguous template specialization %qD for %q+D",
2372 candidates
= chainon (candidates
, templates
);
2373 print_candidates (candidates
);
2374 return error_mark_node
;
2377 /* We have one, and exactly one, match. */
2380 tree fn
= TREE_VALUE (candidates
);
2381 *targs_out
= copy_node (DECL_TI_ARGS (fn
));
2383 // Propagate the candidate's constraints to the declaration.
2384 set_constraints (decl
, get_constraints (fn
));
2386 /* DECL is a re-declaration or partial instantiation of a template
2388 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
2390 /* It was a specialization of an ordinary member function in a
2392 return DECL_TI_TEMPLATE (fn
);
2395 /* It was a specialization of a template. */
2396 targs
= DECL_TI_ARGS (DECL_TEMPLATE_RESULT (TREE_VALUE (templates
)));
2397 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (targs
))
2399 *targs_out
= copy_node (targs
);
2400 SET_TMPL_ARGS_LEVEL (*targs_out
,
2401 TMPL_ARGS_DEPTH (*targs_out
),
2402 TREE_PURPOSE (templates
));
2405 *targs_out
= TREE_PURPOSE (templates
);
2406 return TREE_VALUE (templates
);
2409 /* Returns a chain of parameter types, exactly like the SPEC_TYPES,
2410 but with the default argument values filled in from those in the
2414 copy_default_args_to_explicit_spec_1 (tree spec_types
,
2417 tree new_spec_types
;
2422 if (spec_types
== void_list_node
)
2423 return void_list_node
;
2425 /* Substitute into the rest of the list. */
2427 copy_default_args_to_explicit_spec_1 (TREE_CHAIN (spec_types
),
2428 TREE_CHAIN (tmpl_types
));
2430 /* Add the default argument for this parameter. */
2431 return hash_tree_cons (TREE_PURPOSE (tmpl_types
),
2432 TREE_VALUE (spec_types
),
2436 /* DECL is an explicit specialization. Replicate default arguments
2437 from the template it specializes. (That way, code like:
2439 template <class T> void f(T = 3);
2440 template <> void f(double);
2443 works, as required.) An alternative approach would be to look up
2444 the correct default arguments at the call-site, but this approach
2445 is consistent with how implicit instantiations are handled. */
2448 copy_default_args_to_explicit_spec (tree decl
)
2453 tree new_spec_types
;
2457 tree object_type
= NULL_TREE
;
2458 tree in_charge
= NULL_TREE
;
2459 tree vtt
= NULL_TREE
;
2461 /* See if there's anything we need to do. */
2462 tmpl
= DECL_TI_TEMPLATE (decl
);
2463 tmpl_types
= TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (tmpl
)));
2464 for (t
= tmpl_types
; t
; t
= TREE_CHAIN (t
))
2465 if (TREE_PURPOSE (t
))
2470 old_type
= TREE_TYPE (decl
);
2471 spec_types
= TYPE_ARG_TYPES (old_type
);
2473 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
2475 /* Remove the this pointer, but remember the object's type for
2477 object_type
= TREE_TYPE (TREE_VALUE (spec_types
));
2478 spec_types
= TREE_CHAIN (spec_types
);
2479 tmpl_types
= TREE_CHAIN (tmpl_types
);
2481 if (DECL_HAS_IN_CHARGE_PARM_P (decl
))
2483 /* DECL may contain more parameters than TMPL due to the extra
2484 in-charge parameter in constructors and destructors. */
2485 in_charge
= spec_types
;
2486 spec_types
= TREE_CHAIN (spec_types
);
2488 if (DECL_HAS_VTT_PARM_P (decl
))
2491 spec_types
= TREE_CHAIN (spec_types
);
2495 /* Compute the merged default arguments. */
2497 copy_default_args_to_explicit_spec_1 (spec_types
, tmpl_types
);
2499 /* Compute the new FUNCTION_TYPE. */
2503 new_spec_types
= hash_tree_cons (TREE_PURPOSE (vtt
),
2508 /* Put the in-charge parameter back. */
2509 new_spec_types
= hash_tree_cons (TREE_PURPOSE (in_charge
),
2510 TREE_VALUE (in_charge
),
2513 new_type
= build_method_type_directly (object_type
,
2514 TREE_TYPE (old_type
),
2518 new_type
= build_function_type (TREE_TYPE (old_type
),
2520 new_type
= cp_build_type_attribute_variant (new_type
,
2521 TYPE_ATTRIBUTES (old_type
));
2522 new_type
= build_exception_variant (new_type
,
2523 TYPE_RAISES_EXCEPTIONS (old_type
));
2525 if (TYPE_HAS_LATE_RETURN_TYPE (old_type
))
2526 TYPE_HAS_LATE_RETURN_TYPE (new_type
) = 1;
2528 TREE_TYPE (decl
) = new_type
;
2531 /* Return the number of template headers we expect to see for a definition
2532 or specialization of CTYPE or one of its non-template members. */
2535 num_template_headers_for_class (tree ctype
)
2537 int num_templates
= 0;
2539 while (ctype
&& CLASS_TYPE_P (ctype
))
2541 /* You're supposed to have one `template <...>' for every
2542 template class, but you don't need one for a full
2543 specialization. For example:
2545 template <class T> struct S{};
2546 template <> struct S<int> { void f(); };
2547 void S<int>::f () {}
2549 is correct; there shouldn't be a `template <>' for the
2550 definition of `S<int>::f'. */
2551 if (!CLASSTYPE_TEMPLATE_INFO (ctype
))
2552 /* If CTYPE does not have template information of any
2553 kind, then it is not a template, nor is it nested
2554 within a template. */
2556 if (explicit_class_specialization_p (ctype
))
2558 if (PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (ctype
)))
2561 ctype
= TYPE_CONTEXT (ctype
);
2564 return num_templates
;
2567 /* Do a simple sanity check on the template headers that precede the
2568 variable declaration DECL. */
2571 check_template_variable (tree decl
)
2573 tree ctx
= CP_DECL_CONTEXT (decl
);
2574 int wanted
= num_template_headers_for_class (ctx
);
2575 if (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
)
2576 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl
)))
2578 if (cxx_dialect
< cxx14
)
2579 pedwarn (DECL_SOURCE_LOCATION (decl
), 0,
2580 "variable templates only available with "
2581 "-std=c++14 or -std=gnu++14");
2583 // Namespace-scope variable templates should have a template header.
2586 if (template_header_count
> wanted
)
2588 bool warned
= pedwarn (DECL_SOURCE_LOCATION (decl
), 0,
2589 "too many template headers for %D (should be %d)",
2591 if (warned
&& CLASS_TYPE_P (ctx
)
2592 && CLASSTYPE_TEMPLATE_SPECIALIZATION (ctx
))
2593 inform (DECL_SOURCE_LOCATION (decl
),
2594 "members of an explicitly specialized class are defined "
2595 "without a template header");
2599 /* Check to see if the function just declared, as indicated in
2600 DECLARATOR, and in DECL, is a specialization of a function
2601 template. We may also discover that the declaration is an explicit
2602 instantiation at this point.
2604 Returns DECL, or an equivalent declaration that should be used
2605 instead if all goes well. Issues an error message if something is
2606 amiss. Returns error_mark_node if the error is not easily
2609 FLAGS is a bitmask consisting of the following flags:
2611 2: The function has a definition.
2612 4: The function is a friend.
2614 The TEMPLATE_COUNT is the number of references to qualifying
2615 template classes that appeared in the name of the function. For
2618 template <class T> struct S { void f(); };
2621 the TEMPLATE_COUNT would be 1. However, explicitly specialized
2622 classes are not counted in the TEMPLATE_COUNT, so that in
2624 template <class T> struct S {};
2625 template <> struct S<int> { void f(); }
2626 template <> void S<int>::f();
2628 the TEMPLATE_COUNT would be 0. (Note that this declaration is
2629 invalid; there should be no template <>.)
2631 If the function is a specialization, it is marked as such via
2632 DECL_TEMPLATE_SPECIALIZATION. Furthermore, its DECL_TEMPLATE_INFO
2633 is set up correctly, and it is added to the list of specializations
2634 for that template. */
2637 check_explicit_specialization (tree declarator
,
2642 int have_def
= flags
& 2;
2643 int is_friend
= flags
& 4;
2644 bool is_concept
= flags
& 8;
2645 int specialization
= 0;
2646 int explicit_instantiation
= 0;
2647 int member_specialization
= 0;
2648 tree ctype
= DECL_CLASS_CONTEXT (decl
);
2649 tree dname
= DECL_NAME (decl
);
2654 if (!processing_specialization
)
2657 tsk
= tsk_excessive_parms
;
2660 tsk
= current_tmpl_spec_kind (template_count
);
2665 if (processing_specialization
&& !VAR_P (decl
))
2668 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
2670 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
2673 /* This could be something like:
2675 template <class T> void f(T);
2676 class S { friend void f<>(int); } */
2680 /* This case handles bogus declarations like template <>
2681 template <class T> void f<int>(); */
2683 error ("template-id %qD in declaration of primary template",
2690 case tsk_invalid_member_spec
:
2691 /* The error has already been reported in
2692 check_specialization_scope. */
2693 return error_mark_node
;
2695 case tsk_invalid_expl_inst
:
2696 error ("template parameter list used in explicit instantiation");
2702 error ("definition provided for explicit instantiation");
2704 explicit_instantiation
= 1;
2707 case tsk_excessive_parms
:
2708 case tsk_insufficient_parms
:
2709 if (tsk
== tsk_excessive_parms
)
2710 error ("too many template parameter lists in declaration of %qD",
2712 else if (template_header_count
)
2713 error("too few template parameter lists in declaration of %qD", decl
);
2715 error("explicit specialization of %qD must be introduced by "
2716 "%<template <>%>", decl
);
2721 error ("explicit specialization declared %<concept%>");
2723 if (VAR_P (decl
) && TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
2724 /* In cases like template<> constexpr bool v = true;
2725 We'll give an error in check_template_variable. */
2728 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
2730 member_specialization
= 1;
2736 if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
2738 /* This case handles bogus declarations like template <>
2739 template <class T> void f<int>(); */
2741 if (!uses_template_parms (declarator
))
2742 error ("template-id %qD in declaration of primary template",
2744 else if (variable_template_p (TREE_OPERAND (declarator
, 0)))
2746 /* Partial specialization of variable template. */
2747 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
2751 else if (cxx_dialect
< cxx14
)
2752 error ("non-type partial specialization %qD "
2753 "is not allowed", declarator
);
2755 error ("non-class, non-variable partial specialization %qD "
2756 "is not allowed", declarator
);
2761 if (ctype
&& CLASSTYPE_TEMPLATE_INSTANTIATION (ctype
))
2762 /* This is a specialization of a member template, without
2763 specialization the containing class. Something like:
2765 template <class T> struct S {
2766 template <class U> void f (U);
2768 template <> template <class U> void S<int>::f(U) {}
2770 That's a specialization -- but of the entire template. */
2778 if ((specialization
|| member_specialization
)
2779 /* This doesn't apply to variable templates. */
2780 && (TREE_CODE (TREE_TYPE (decl
)) == FUNCTION_TYPE
2781 || TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
))
2783 tree t
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
2784 for (; t
; t
= TREE_CHAIN (t
))
2785 if (TREE_PURPOSE (t
))
2787 permerror (input_location
,
2788 "default argument specified in explicit specialization");
2793 if (specialization
|| member_specialization
|| explicit_instantiation
)
2795 tree tmpl
= NULL_TREE
;
2796 tree targs
= NULL_TREE
;
2797 bool was_template_id
= (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
);
2799 /* Make sure that the declarator is a TEMPLATE_ID_EXPR. */
2800 if (!was_template_id
)
2804 gcc_assert (identifier_p (declarator
));
2809 /* If there is no class context, the explicit instantiation
2810 must be at namespace scope. */
2811 gcc_assert (DECL_NAMESPACE_SCOPE_P (decl
));
2813 /* Find the namespace binding, using the declaration
2815 fns
= lookup_qualified_name (CP_DECL_CONTEXT (decl
), dname
,
2817 if (fns
== error_mark_node
|| !is_overloaded_fn (fns
))
2819 error ("%qD is not a template function", dname
);
2820 fns
= error_mark_node
;
2824 tree fn
= OVL_CURRENT (fns
);
2825 if (!is_associated_namespace (CP_DECL_CONTEXT (decl
),
2826 CP_DECL_CONTEXT (fn
)))
2827 error ("%qD is not declared in %qD",
2828 decl
, current_namespace
);
2832 declarator
= lookup_template_function (fns
, NULL_TREE
);
2835 if (declarator
== error_mark_node
)
2836 return error_mark_node
;
2838 if (ctype
!= NULL_TREE
&& TYPE_BEING_DEFINED (ctype
))
2840 if (!explicit_instantiation
)
2841 /* A specialization in class scope. This is invalid,
2842 but the error will already have been flagged by
2843 check_specialization_scope. */
2844 return error_mark_node
;
2847 /* It's not valid to write an explicit instantiation in
2850 class C { template void f(); }
2852 This case is caught by the parser. However, on
2855 template class C { void f(); };
2857 (which is invalid) we can get here. The error will be
2864 else if (ctype
!= NULL_TREE
2865 && (identifier_p (TREE_OPERAND (declarator
, 0))))
2867 // We'll match variable templates in start_decl.
2871 /* Find the list of functions in ctype that have the same
2872 name as the declared function. */
2873 tree name
= TREE_OPERAND (declarator
, 0);
2874 tree fns
= NULL_TREE
;
2877 if (constructor_name_p (name
, ctype
))
2879 int is_constructor
= DECL_CONSTRUCTOR_P (decl
);
2881 if (is_constructor
? !TYPE_HAS_USER_CONSTRUCTOR (ctype
)
2882 : !CLASSTYPE_DESTRUCTORS (ctype
))
2884 /* From [temp.expl.spec]:
2886 If such an explicit specialization for the member
2887 of a class template names an implicitly-declared
2888 special member function (clause _special_), the
2889 program is ill-formed.
2891 Similar language is found in [temp.explicit]. */
2892 error ("specialization of implicitly-declared special member function");
2893 return error_mark_node
;
2896 name
= is_constructor
? ctor_identifier
: dtor_identifier
;
2899 if (!DECL_CONV_FN_P (decl
))
2901 idx
= lookup_fnfields_1 (ctype
, name
);
2903 fns
= (*CLASSTYPE_METHOD_VEC (ctype
))[idx
];
2907 vec
<tree
, va_gc
> *methods
;
2910 /* For a type-conversion operator, we cannot do a
2911 name-based lookup. We might be looking for `operator
2912 int' which will be a specialization of `operator T'.
2913 So, we find *all* the conversion operators, and then
2914 select from them. */
2917 methods
= CLASSTYPE_METHOD_VEC (ctype
);
2919 for (idx
= CLASSTYPE_FIRST_CONVERSION_SLOT
;
2920 methods
->iterate (idx
, &ovl
);
2923 if (!DECL_CONV_FN_P (OVL_CURRENT (ovl
)))
2924 /* There are no more conversion functions. */
2927 /* Glue all these conversion functions together
2928 with those we already have. */
2929 for (; ovl
; ovl
= OVL_NEXT (ovl
))
2930 fns
= ovl_cons (OVL_CURRENT (ovl
), fns
);
2934 if (fns
== NULL_TREE
)
2936 error ("no member function %qD declared in %qT", name
, ctype
);
2937 return error_mark_node
;
2940 TREE_OPERAND (declarator
, 0) = fns
;
2943 /* Figure out what exactly is being specialized at this point.
2944 Note that for an explicit instantiation, even one for a
2945 member function, we cannot tell apriori whether the
2946 instantiation is for a member template, or just a member
2947 function of a template class. Even if a member template is
2948 being instantiated, the member template arguments may be
2949 elided if they can be deduced from the rest of the
2951 tmpl
= determine_specialization (declarator
, decl
,
2953 member_specialization
,
2957 if (!tmpl
|| tmpl
== error_mark_node
)
2958 /* We couldn't figure out what this declaration was
2960 return error_mark_node
;
2963 tree gen_tmpl
= most_general_template (tmpl
);
2965 if (explicit_instantiation
)
2967 /* We don't set DECL_EXPLICIT_INSTANTIATION here; that
2968 is done by do_decl_instantiation later. */
2970 int arg_depth
= TMPL_ARGS_DEPTH (targs
);
2971 int parm_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
2973 if (arg_depth
> parm_depth
)
2975 /* If TMPL is not the most general template (for
2976 example, if TMPL is a friend template that is
2977 injected into namespace scope), then there will
2978 be too many levels of TARGS. Remove some of them
2983 new_targs
= make_tree_vec (parm_depth
);
2984 for (i
= arg_depth
- parm_depth
; i
< arg_depth
; ++i
)
2985 TREE_VEC_ELT (new_targs
, i
- (arg_depth
- parm_depth
))
2986 = TREE_VEC_ELT (targs
, i
);
2990 return instantiate_template (tmpl
, targs
, tf_error
);
2993 /* If we thought that the DECL was a member function, but it
2994 turns out to be specializing a static member function,
2995 make DECL a static member function as well. */
2996 if (DECL_FUNCTION_TEMPLATE_P (tmpl
)
2997 && DECL_STATIC_FUNCTION_P (tmpl
)
2998 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
2999 revert_static_member_fn (decl
);
3001 /* If this is a specialization of a member template of a
3002 template class, we want to return the TEMPLATE_DECL, not
3003 the specialization of it. */
3004 if (tsk
== tsk_template
&& !was_template_id
)
3006 tree result
= DECL_TEMPLATE_RESULT (tmpl
);
3007 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
3008 DECL_INITIAL (result
) = NULL_TREE
;
3012 DECL_SOURCE_LOCATION (tmpl
) = DECL_SOURCE_LOCATION (decl
);
3013 DECL_SOURCE_LOCATION (result
)
3014 = DECL_SOURCE_LOCATION (decl
);
3015 /* We want to use the argument list specified in the
3016 definition, not in the original declaration. */
3017 DECL_ARGUMENTS (result
) = DECL_ARGUMENTS (decl
);
3018 for (parm
= DECL_ARGUMENTS (result
); parm
;
3019 parm
= DECL_CHAIN (parm
))
3020 DECL_CONTEXT (parm
) = result
;
3022 return register_specialization (tmpl
, gen_tmpl
, targs
,
3026 /* Set up the DECL_TEMPLATE_INFO for DECL. */
3027 DECL_TEMPLATE_INFO (decl
) = build_template_info (tmpl
, targs
);
3029 if (was_template_id
)
3030 TINFO_USED_TEMPLATE_ID (DECL_TEMPLATE_INFO (decl
)) = true;
3032 /* Inherit default function arguments from the template
3033 DECL is specializing. */
3034 if (DECL_FUNCTION_TEMPLATE_P (tmpl
))
3035 copy_default_args_to_explicit_spec (decl
);
3037 /* This specialization has the same protection as the
3038 template it specializes. */
3039 TREE_PRIVATE (decl
) = TREE_PRIVATE (gen_tmpl
);
3040 TREE_PROTECTED (decl
) = TREE_PROTECTED (gen_tmpl
);
3042 /* 7.1.1-1 [dcl.stc]
3044 A storage-class-specifier shall not be specified in an
3045 explicit specialization...
3047 The parser rejects these, so unless action is taken here,
3048 explicit function specializations will always appear with
3051 The action recommended by the C++ CWG in response to C++
3052 defect report 605 is to make the storage class and linkage
3053 of the explicit specialization match the templated function:
3055 http://www.open-std.org/jtc1/sc22/wg21/docs/cwg_active.html#605
3057 if (tsk
== tsk_expl_spec
&& DECL_FUNCTION_TEMPLATE_P (gen_tmpl
))
3059 tree tmpl_func
= DECL_TEMPLATE_RESULT (gen_tmpl
);
3060 gcc_assert (TREE_CODE (tmpl_func
) == FUNCTION_DECL
);
3062 /* A concept cannot be specialized. */
3063 if (DECL_DECLARED_CONCEPT_P (tmpl_func
))
3065 error ("explicit specialization of function concept %qD",
3067 return error_mark_node
;
3070 /* This specialization has the same linkage and visibility as
3071 the function template it specializes. */
3072 TREE_PUBLIC (decl
) = TREE_PUBLIC (tmpl_func
);
3073 if (! TREE_PUBLIC (decl
))
3075 DECL_INTERFACE_KNOWN (decl
) = 1;
3076 DECL_NOT_REALLY_EXTERN (decl
) = 1;
3078 DECL_THIS_STATIC (decl
) = DECL_THIS_STATIC (tmpl_func
);
3079 if (DECL_VISIBILITY_SPECIFIED (tmpl_func
))
3081 DECL_VISIBILITY_SPECIFIED (decl
) = 1;
3082 DECL_VISIBILITY (decl
) = DECL_VISIBILITY (tmpl_func
);
3086 /* If DECL is a friend declaration, declared using an
3087 unqualified name, the namespace associated with DECL may
3088 have been set incorrectly. For example, in:
3090 template <typename T> void f(T);
3092 struct S { friend void f<int>(int); }
3095 we will have set the DECL_CONTEXT for the friend
3096 declaration to N, rather than to the global namespace. */
3097 if (DECL_NAMESPACE_SCOPE_P (decl
))
3098 DECL_CONTEXT (decl
) = DECL_CONTEXT (tmpl
);
3100 if (is_friend
&& !have_def
)
3101 /* This is not really a declaration of a specialization.
3102 It's just the name of an instantiation. But, it's not
3103 a request for an instantiation, either. */
3104 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
3105 else if (TREE_CODE (decl
) == FUNCTION_DECL
)
3106 /* A specialization is not necessarily COMDAT. */
3107 DECL_COMDAT (decl
) = (TREE_PUBLIC (decl
)
3108 && DECL_DECLARED_INLINE_P (decl
));
3109 else if (VAR_P (decl
))
3110 DECL_COMDAT (decl
) = false;
3112 /* If this is a full specialization, register it so that we can find
3113 it again. Partial specializations will be registered in
3114 process_partial_specialization. */
3115 if (!processing_template_decl
)
3116 decl
= register_specialization (decl
, gen_tmpl
, targs
,
3119 /* A 'structor should already have clones. */
3120 gcc_assert (decl
== error_mark_node
3121 || variable_template_p (tmpl
)
3122 || !(DECL_CONSTRUCTOR_P (decl
)
3123 || DECL_DESTRUCTOR_P (decl
))
3124 || DECL_CLONED_FUNCTION_P (DECL_CHAIN (decl
)));
3131 /* Returns 1 iff PARMS1 and PARMS2 are identical sets of template
3132 parameters. These are represented in the same format used for
3133 DECL_TEMPLATE_PARMS. */
3136 comp_template_parms (const_tree parms1
, const_tree parms2
)
3141 if (parms1
== parms2
)
3144 for (p1
= parms1
, p2
= parms2
;
3145 p1
!= NULL_TREE
&& p2
!= NULL_TREE
;
3146 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
))
3148 tree t1
= TREE_VALUE (p1
);
3149 tree t2
= TREE_VALUE (p2
);
3152 gcc_assert (TREE_CODE (t1
) == TREE_VEC
);
3153 gcc_assert (TREE_CODE (t2
) == TREE_VEC
);
3155 if (TREE_VEC_LENGTH (t1
) != TREE_VEC_LENGTH (t2
))
3158 for (i
= 0; i
< TREE_VEC_LENGTH (t2
); ++i
)
3160 tree parm1
= TREE_VALUE (TREE_VEC_ELT (t1
, i
));
3161 tree parm2
= TREE_VALUE (TREE_VEC_ELT (t2
, i
));
3163 /* If either of the template parameters are invalid, assume
3164 they match for the sake of error recovery. */
3165 if (error_operand_p (parm1
) || error_operand_p (parm2
))
3168 if (TREE_CODE (parm1
) != TREE_CODE (parm2
))
3171 if (TREE_CODE (parm1
) == TEMPLATE_TYPE_PARM
3172 && (TEMPLATE_TYPE_PARAMETER_PACK (parm1
)
3173 == TEMPLATE_TYPE_PARAMETER_PACK (parm2
)))
3175 else if (!same_type_p (TREE_TYPE (parm1
), TREE_TYPE (parm2
)))
3180 if ((p1
!= NULL_TREE
) != (p2
!= NULL_TREE
))
3181 /* One set of parameters has more parameters lists than the
3188 /* Determine whether PARM is a parameter pack. */
3191 template_parameter_pack_p (const_tree parm
)
3193 /* Determine if we have a non-type template parameter pack. */
3194 if (TREE_CODE (parm
) == PARM_DECL
)
3195 return (DECL_TEMPLATE_PARM_P (parm
)
3196 && TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)));
3197 if (TREE_CODE (parm
) == TEMPLATE_PARM_INDEX
)
3198 return TEMPLATE_PARM_PARAMETER_PACK (parm
);
3200 /* If this is a list of template parameters, we could get a
3201 TYPE_DECL or a TEMPLATE_DECL. */
3202 if (TREE_CODE (parm
) == TYPE_DECL
|| TREE_CODE (parm
) == TEMPLATE_DECL
)
3203 parm
= TREE_TYPE (parm
);
3205 /* Otherwise it must be a type template parameter. */
3206 return ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
3207 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
)
3208 && TEMPLATE_TYPE_PARAMETER_PACK (parm
));
3211 /* Determine if T is a function parameter pack. */
3214 function_parameter_pack_p (const_tree t
)
3216 if (t
&& TREE_CODE (t
) == PARM_DECL
)
3217 return DECL_PACK_P (t
);
3221 /* Return the function template declaration of PRIMARY_FUNC_TMPL_INST.
3222 PRIMARY_FUNC_TMPL_INST is a primary function template instantiation. */
3225 get_function_template_decl (const_tree primary_func_tmpl_inst
)
3227 if (! primary_func_tmpl_inst
3228 || TREE_CODE (primary_func_tmpl_inst
) != FUNCTION_DECL
3229 || ! primary_template_instantiation_p (primary_func_tmpl_inst
))
3232 return DECL_TEMPLATE_RESULT (DECL_TI_TEMPLATE (primary_func_tmpl_inst
));
3235 /* Return true iff the function parameter PARAM_DECL was expanded
3236 from the function parameter pack PACK. */
3239 function_parameter_expanded_from_pack_p (tree param_decl
, tree pack
)
3241 if (DECL_ARTIFICIAL (param_decl
)
3242 || !function_parameter_pack_p (pack
))
3245 /* The parameter pack and its pack arguments have the same
3247 return DECL_PARM_INDEX (pack
) == DECL_PARM_INDEX (param_decl
);
3250 /* Determine whether ARGS describes a variadic template args list,
3251 i.e., one that is terminated by a template argument pack. */
3254 template_args_variadic_p (tree args
)
3259 if (args
== NULL_TREE
)
3262 args
= INNERMOST_TEMPLATE_ARGS (args
);
3263 nargs
= TREE_VEC_LENGTH (args
);
3268 last_parm
= TREE_VEC_ELT (args
, nargs
- 1);
3270 return ARGUMENT_PACK_P (last_parm
);
3273 /* Generate a new name for the parameter pack name NAME (an
3274 IDENTIFIER_NODE) that incorporates its */
3277 make_ith_pack_parameter_name (tree name
, int i
)
3279 /* Munge the name to include the parameter index. */
3280 #define NUMBUF_LEN 128
3281 char numbuf
[NUMBUF_LEN
];
3285 if (name
== NULL_TREE
)
3287 snprintf (numbuf
, NUMBUF_LEN
, "%i", i
);
3288 newname_len
= IDENTIFIER_LENGTH (name
)
3289 + strlen (numbuf
) + 2;
3290 newname
= (char*)alloca (newname_len
);
3291 snprintf (newname
, newname_len
,
3292 "%s#%i", IDENTIFIER_POINTER (name
), i
);
3293 return get_identifier (newname
);
3296 /* Return true if T is a primary function, class or alias template
3300 primary_template_instantiation_p (const_tree t
)
3305 if (TREE_CODE (t
) == FUNCTION_DECL
)
3306 return DECL_LANG_SPECIFIC (t
)
3307 && DECL_TEMPLATE_INSTANTIATION (t
)
3308 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (t
));
3309 else if (CLASS_TYPE_P (t
) && !TYPE_DECL_ALIAS_P (TYPE_NAME (t
)))
3310 return CLASSTYPE_TEMPLATE_INSTANTIATION (t
)
3311 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (t
));
3312 else if (alias_template_specialization_p (t
))
3317 /* Return true if PARM is a template template parameter. */
3320 template_template_parameter_p (const_tree parm
)
3322 return DECL_TEMPLATE_TEMPLATE_PARM_P (parm
);
3325 /* Return true iff PARM is a DECL representing a type template
3329 template_type_parameter_p (const_tree parm
)
3332 && (TREE_CODE (parm
) == TYPE_DECL
3333 || TREE_CODE (parm
) == TEMPLATE_DECL
)
3334 && DECL_TEMPLATE_PARM_P (parm
));
3337 /* Return the template parameters of T if T is a
3338 primary template instantiation, NULL otherwise. */
3341 get_primary_template_innermost_parameters (const_tree t
)
3343 tree parms
= NULL
, template_info
= NULL
;
3345 if ((template_info
= get_template_info (t
))
3346 && primary_template_instantiation_p (t
))
3347 parms
= INNERMOST_TEMPLATE_PARMS
3348 (DECL_TEMPLATE_PARMS (TI_TEMPLATE (template_info
)));
3353 /* Return the template parameters of the LEVELth level from the full list
3354 of template parameters PARMS. */
3357 get_template_parms_at_level (tree parms
, int level
)
3361 || TREE_CODE (parms
) != TREE_LIST
3362 || level
> TMPL_PARMS_DEPTH (parms
))
3365 for (p
= parms
; p
; p
= TREE_CHAIN (p
))
3366 if (TMPL_PARMS_DEPTH (p
) == level
)
3372 /* Returns the template arguments of T if T is a template instantiation,
3376 get_template_innermost_arguments (const_tree t
)
3378 tree args
= NULL
, template_info
= NULL
;
3380 if ((template_info
= get_template_info (t
))
3381 && TI_ARGS (template_info
))
3382 args
= INNERMOST_TEMPLATE_ARGS (TI_ARGS (template_info
));
3387 /* Return the argument pack elements of T if T is a template argument pack,
3391 get_template_argument_pack_elems (const_tree t
)
3393 if (TREE_CODE (t
) != TYPE_ARGUMENT_PACK
3394 && TREE_CODE (t
) != NONTYPE_ARGUMENT_PACK
)
3397 return ARGUMENT_PACK_ARGS (t
);
3400 /* Structure used to track the progress of find_parameter_packs_r. */
3401 struct find_parameter_pack_data
3403 /* TREE_LIST that will contain all of the parameter packs found by
3405 tree
* parameter_packs
;
3407 /* Set of AST nodes that have been visited by the traversal. */
3408 hash_set
<tree
> *visited
;
3410 /* True iff we're making a type pack expansion. */
3411 bool type_pack_expansion_p
;
3414 /* Identifies all of the argument packs that occur in a template
3415 argument and appends them to the TREE_LIST inside DATA, which is a
3416 find_parameter_pack_data structure. This is a subroutine of
3417 make_pack_expansion and uses_parameter_packs. */
3419 find_parameter_packs_r (tree
*tp
, int *walk_subtrees
, void* data
)
3422 struct find_parameter_pack_data
* ppd
=
3423 (struct find_parameter_pack_data
*)data
;
3424 bool parameter_pack_p
= false;
3426 /* Handle type aliases/typedefs. */
3427 if (TYPE_ALIAS_P (t
))
3429 if (TYPE_TEMPLATE_INFO (t
))
3430 cp_walk_tree (&TYPE_TI_ARGS (t
),
3431 &find_parameter_packs_r
,
3437 /* Identify whether this is a parameter pack or not. */
3438 switch (TREE_CODE (t
))
3440 case TEMPLATE_PARM_INDEX
:
3441 if (TEMPLATE_PARM_PARAMETER_PACK (t
))
3442 parameter_pack_p
= true;
3445 case TEMPLATE_TYPE_PARM
:
3446 t
= TYPE_MAIN_VARIANT (t
);
3447 case TEMPLATE_TEMPLATE_PARM
:
3448 /* If the placeholder appears in the decl-specifier-seq of a function
3449 parameter pack (14.6.3), or the type-specifier-seq of a type-id that
3450 is a pack expansion, the invented template parameter is a template
3452 if (ppd
->type_pack_expansion_p
&& is_auto_or_concept (t
))
3453 TEMPLATE_TYPE_PARAMETER_PACK (t
) = true;
3454 if (TEMPLATE_TYPE_PARAMETER_PACK (t
))
3455 parameter_pack_p
= true;
3460 if (DECL_PACK_P (t
))
3462 /* We don't want to walk into the type of a PARM_DECL,
3463 because we don't want to see the type parameter pack. */
3465 parameter_pack_p
= true;
3469 /* Look through a lambda capture proxy to the field pack. */
3471 if (DECL_HAS_VALUE_EXPR_P (t
))
3473 tree v
= DECL_VALUE_EXPR (t
);
3475 &find_parameter_packs_r
,
3479 else if (variable_template_specialization_p (t
))
3481 cp_walk_tree (&DECL_TI_ARGS (t
),
3482 find_parameter_packs_r
,
3489 parameter_pack_p
= true;
3492 /* Not a parameter pack. */
3496 if (parameter_pack_p
)
3498 /* Add this parameter pack to the list. */
3499 *ppd
->parameter_packs
= tree_cons (NULL_TREE
, t
, *ppd
->parameter_packs
);
3503 cp_walk_tree (&TYPE_CONTEXT (t
),
3504 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3506 /* This switch statement will return immediately if we don't find a
3508 switch (TREE_CODE (t
))
3510 case TEMPLATE_PARM_INDEX
:
3513 case BOUND_TEMPLATE_TEMPLATE_PARM
:
3514 /* Check the template itself. */
3515 cp_walk_tree (&TREE_TYPE (TYPE_TI_TEMPLATE (t
)),
3516 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3517 /* Check the template arguments. */
3518 cp_walk_tree (&TYPE_TI_ARGS (t
), &find_parameter_packs_r
, ppd
,
3523 case TEMPLATE_TYPE_PARM
:
3524 case TEMPLATE_TEMPLATE_PARM
:
3531 if (TYPE_PTRMEMFUNC_P (t
))
3537 if (TYPE_TEMPLATE_INFO (t
))
3538 cp_walk_tree (&TYPE_TI_ARGS (t
),
3539 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3546 cp_walk_tree (&TREE_TYPE (t
),
3547 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3551 cp_walk_tree (&TYPENAME_TYPE_FULLNAME (t
), &find_parameter_packs_r
,
3556 case TYPE_PACK_EXPANSION
:
3557 case EXPR_PACK_EXPANSION
:
3562 cp_walk_tree (&TYPE_MAX_VALUE (t
), &find_parameter_packs_r
,
3567 case IDENTIFIER_NODE
:
3568 cp_walk_tree (&TREE_TYPE (t
), &find_parameter_packs_r
, ppd
,
3580 /* Determines if the expression or type T uses any parameter packs. */
3582 uses_parameter_packs (tree t
)
3584 tree parameter_packs
= NULL_TREE
;
3585 struct find_parameter_pack_data ppd
;
3586 ppd
.parameter_packs
= ¶meter_packs
;
3587 ppd
.visited
= new hash_set
<tree
>;
3588 ppd
.type_pack_expansion_p
= false;
3589 cp_walk_tree (&t
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
3591 return parameter_packs
!= NULL_TREE
;
3594 /* Turn ARG, which may be an expression, type, or a TREE_LIST
3595 representation a base-class initializer into a parameter pack
3596 expansion. If all goes well, the resulting node will be an
3597 EXPR_PACK_EXPANSION, TYPE_PACK_EXPANSION, or TREE_LIST,
3600 make_pack_expansion (tree arg
)
3603 tree parameter_packs
= NULL_TREE
;
3604 bool for_types
= false;
3605 struct find_parameter_pack_data ppd
;
3607 if (!arg
|| arg
== error_mark_node
)
3610 if (TREE_CODE (arg
) == TREE_LIST
&& TREE_PURPOSE (arg
))
3612 /* A TREE_LIST with a non-null TREE_PURPOSE is for a base
3613 class initializer. In this case, the TREE_PURPOSE will be a
3614 _TYPE node (representing the base class expansion we're
3615 initializing) and the TREE_VALUE will be a TREE_LIST
3616 containing the initialization arguments.
3618 The resulting expansion looks somewhat different from most
3619 expansions. Rather than returning just one _EXPANSION, we
3620 return a TREE_LIST whose TREE_PURPOSE is a
3621 TYPE_PACK_EXPANSION containing the bases that will be
3622 initialized. The TREE_VALUE will be identical to the
3623 original TREE_VALUE, which is a list of arguments that will
3624 be passed to each base. We do not introduce any new pack
3625 expansion nodes into the TREE_VALUE (although it is possible
3626 that some already exist), because the TREE_PURPOSE and
3627 TREE_VALUE all need to be expanded together with the same
3628 _EXPANSION node. Note that the TYPE_PACK_EXPANSION in the
3629 resulting TREE_PURPOSE will mention the parameter packs in
3630 both the bases and the arguments to the bases. */
3633 tree parameter_packs
= NULL_TREE
;
3635 /* Determine which parameter packs will be used by the base
3637 ppd
.visited
= new hash_set
<tree
>;
3638 ppd
.parameter_packs
= ¶meter_packs
;
3639 cp_walk_tree (&TREE_PURPOSE (arg
), &find_parameter_packs_r
,
3642 if (parameter_packs
== NULL_TREE
)
3644 error ("base initializer expansion %<%T%> contains no parameter packs", arg
);
3646 return error_mark_node
;
3649 if (TREE_VALUE (arg
) != void_type_node
)
3651 /* Collect the sets of parameter packs used in each of the
3652 initialization arguments. */
3653 for (value
= TREE_VALUE (arg
); value
; value
= TREE_CHAIN (value
))
3655 /* Determine which parameter packs will be expanded in this
3657 cp_walk_tree (&TREE_VALUE (value
), &find_parameter_packs_r
,
3664 /* Create the pack expansion type for the base type. */
3665 purpose
= cxx_make_type (TYPE_PACK_EXPANSION
);
3666 SET_PACK_EXPANSION_PATTERN (purpose
, TREE_PURPOSE (arg
));
3667 PACK_EXPANSION_PARAMETER_PACKS (purpose
) = parameter_packs
;
3669 /* Just use structural equality for these TYPE_PACK_EXPANSIONS;
3670 they will rarely be compared to anything. */
3671 SET_TYPE_STRUCTURAL_EQUALITY (purpose
);
3673 return tree_cons (purpose
, TREE_VALUE (arg
), NULL_TREE
);
3676 if (TYPE_P (arg
) || TREE_CODE (arg
) == TEMPLATE_DECL
)
3679 /* Build the PACK_EXPANSION_* node. */
3681 ? cxx_make_type (TYPE_PACK_EXPANSION
)
3682 : make_node (EXPR_PACK_EXPANSION
);
3683 SET_PACK_EXPANSION_PATTERN (result
, arg
);
3684 if (TREE_CODE (result
) == EXPR_PACK_EXPANSION
)
3686 /* Propagate type and const-expression information. */
3687 TREE_TYPE (result
) = TREE_TYPE (arg
);
3688 TREE_CONSTANT (result
) = TREE_CONSTANT (arg
);
3691 /* Just use structural equality for these TYPE_PACK_EXPANSIONS;
3692 they will rarely be compared to anything. */
3693 SET_TYPE_STRUCTURAL_EQUALITY (result
);
3695 /* Determine which parameter packs will be expanded. */
3696 ppd
.parameter_packs
= ¶meter_packs
;
3697 ppd
.visited
= new hash_set
<tree
>;
3698 ppd
.type_pack_expansion_p
= TYPE_P (arg
);
3699 cp_walk_tree (&arg
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
3702 /* Make sure we found some parameter packs. */
3703 if (parameter_packs
== NULL_TREE
)
3706 error ("expansion pattern %<%T%> contains no argument packs", arg
);
3708 error ("expansion pattern %<%E%> contains no argument packs", arg
);
3709 return error_mark_node
;
3711 PACK_EXPANSION_PARAMETER_PACKS (result
) = parameter_packs
;
3713 PACK_EXPANSION_LOCAL_P (result
) = at_function_scope_p ();
3718 /* Checks T for any "bare" parameter packs, which have not yet been
3719 expanded, and issues an error if any are found. This operation can
3720 only be done on full expressions or types (e.g., an expression
3721 statement, "if" condition, etc.), because we could have expressions like:
3723 foo(f(g(h(args)))...)
3725 where "args" is a parameter pack. check_for_bare_parameter_packs
3726 should not be called for the subexpressions args, h(args),
3727 g(h(args)), or f(g(h(args))), because we would produce erroneous
3730 Returns TRUE and emits an error if there were bare parameter packs,
3731 returns FALSE otherwise. */
3733 check_for_bare_parameter_packs (tree t
)
3735 tree parameter_packs
= NULL_TREE
;
3736 struct find_parameter_pack_data ppd
;
3738 if (!processing_template_decl
|| !t
|| t
== error_mark_node
)
3741 if (TREE_CODE (t
) == TYPE_DECL
)
3744 ppd
.parameter_packs
= ¶meter_packs
;
3745 ppd
.visited
= new hash_set
<tree
>;
3746 ppd
.type_pack_expansion_p
= false;
3747 cp_walk_tree (&t
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
3750 if (parameter_packs
)
3752 error ("parameter packs not expanded with %<...%>:");
3753 while (parameter_packs
)
3755 tree pack
= TREE_VALUE (parameter_packs
);
3756 tree name
= NULL_TREE
;
3758 if (TREE_CODE (pack
) == TEMPLATE_TYPE_PARM
3759 || TREE_CODE (pack
) == TEMPLATE_TEMPLATE_PARM
)
3760 name
= TYPE_NAME (pack
);
3761 else if (TREE_CODE (pack
) == TEMPLATE_PARM_INDEX
)
3762 name
= DECL_NAME (TEMPLATE_PARM_DECL (pack
));
3764 name
= DECL_NAME (pack
);
3767 inform (input_location
, " %qD", name
);
3769 inform (input_location
, " <anonymous>");
3771 parameter_packs
= TREE_CHAIN (parameter_packs
);
3780 /* Expand any parameter packs that occur in the template arguments in
3783 expand_template_argument_pack (tree args
)
3785 tree result_args
= NULL_TREE
;
3786 int in_arg
, out_arg
= 0, nargs
= args
? TREE_VEC_LENGTH (args
) : 0;
3787 int num_result_args
= -1;
3788 int non_default_args_count
= -1;
3790 /* First, determine if we need to expand anything, and the number of
3791 slots we'll need. */
3792 for (in_arg
= 0; in_arg
< nargs
; ++in_arg
)
3794 tree arg
= TREE_VEC_ELT (args
, in_arg
);
3795 if (arg
== NULL_TREE
)
3797 if (ARGUMENT_PACK_P (arg
))
3799 int num_packed
= TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg
));
3800 if (num_result_args
< 0)
3801 num_result_args
= in_arg
+ num_packed
;
3803 num_result_args
+= num_packed
;
3807 if (num_result_args
>= 0)
3812 /* If no expansion is necessary, we're done. */
3813 if (num_result_args
< 0)
3816 /* Expand arguments. */
3817 result_args
= make_tree_vec (num_result_args
);
3818 if (NON_DEFAULT_TEMPLATE_ARGS_COUNT (args
))
3819 non_default_args_count
=
3820 GET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (args
);
3821 for (in_arg
= 0; in_arg
< nargs
; ++in_arg
)
3823 tree arg
= TREE_VEC_ELT (args
, in_arg
);
3824 if (ARGUMENT_PACK_P (arg
))
3826 tree packed
= ARGUMENT_PACK_ARGS (arg
);
3827 int i
, num_packed
= TREE_VEC_LENGTH (packed
);
3828 for (i
= 0; i
< num_packed
; ++i
, ++out_arg
)
3829 TREE_VEC_ELT (result_args
, out_arg
) = TREE_VEC_ELT(packed
, i
);
3830 if (non_default_args_count
> 0)
3831 non_default_args_count
+= num_packed
- 1;
3835 TREE_VEC_ELT (result_args
, out_arg
) = arg
;
3839 if (non_default_args_count
>= 0)
3840 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (result_args
, non_default_args_count
);
3844 /* Checks if DECL shadows a template parameter.
3846 [temp.local]: A template-parameter shall not be redeclared within its
3847 scope (including nested scopes).
3849 Emits an error and returns TRUE if the DECL shadows a parameter,
3850 returns FALSE otherwise. */
3853 check_template_shadow (tree decl
)
3857 /* If we're not in a template, we can't possibly shadow a template
3859 if (!current_template_parms
)
3862 /* Figure out what we're shadowing. */
3863 if (TREE_CODE (decl
) == OVERLOAD
)
3864 decl
= OVL_CURRENT (decl
);
3865 olddecl
= innermost_non_namespace_value (DECL_NAME (decl
));
3867 /* If there's no previous binding for this name, we're not shadowing
3868 anything, let alone a template parameter. */
3872 /* If we're not shadowing a template parameter, we're done. Note
3873 that OLDDECL might be an OVERLOAD (or perhaps even an
3874 ERROR_MARK), so we can't just blithely assume it to be a _DECL
3876 if (!DECL_P (olddecl
) || !DECL_TEMPLATE_PARM_P (olddecl
))
3879 /* We check for decl != olddecl to avoid bogus errors for using a
3880 name inside a class. We check TPFI to avoid duplicate errors for
3881 inline member templates. */
3883 || (DECL_TEMPLATE_PARM_P (decl
)
3884 && TEMPLATE_PARMS_FOR_INLINE (current_template_parms
)))
3887 /* Don't complain about the injected class name, as we've already
3888 complained about the class itself. */
3889 if (DECL_SELF_REFERENCE_P (decl
))
3892 if (DECL_TEMPLATE_PARM_P (decl
))
3893 error ("declaration of template parameter %q+D shadows "
3894 "template parameter", decl
);
3896 error ("declaration of %q+#D shadows template parameter", decl
);
3897 inform (DECL_SOURCE_LOCATION (olddecl
),
3898 "template parameter %qD declared here", olddecl
);
3902 /* Return a new TEMPLATE_PARM_INDEX with the indicated INDEX, LEVEL,
3903 ORIG_LEVEL, DECL, and TYPE. */
3906 build_template_parm_index (int index
,
3912 tree t
= make_node (TEMPLATE_PARM_INDEX
);
3913 TEMPLATE_PARM_IDX (t
) = index
;
3914 TEMPLATE_PARM_LEVEL (t
) = level
;
3915 TEMPLATE_PARM_ORIG_LEVEL (t
) = orig_level
;
3916 TEMPLATE_PARM_DECL (t
) = decl
;
3917 TREE_TYPE (t
) = type
;
3918 TREE_CONSTANT (t
) = TREE_CONSTANT (decl
);
3919 TREE_READONLY (t
) = TREE_READONLY (decl
);
3924 /* Find the canonical type parameter for the given template type
3925 parameter. Returns the canonical type parameter, which may be TYPE
3926 if no such parameter existed. */
3929 canonical_type_parameter (tree type
)
3932 int idx
= TEMPLATE_TYPE_IDX (type
);
3933 if (!canonical_template_parms
)
3934 vec_alloc (canonical_template_parms
, idx
+1);
3936 while (canonical_template_parms
->length () <= (unsigned)idx
)
3937 vec_safe_push (canonical_template_parms
, NULL_TREE
);
3939 list
= (*canonical_template_parms
)[idx
];
3940 while (list
&& !comptypes (type
, TREE_VALUE (list
), COMPARE_STRUCTURAL
))
3941 list
= TREE_CHAIN (list
);
3944 return TREE_VALUE (list
);
3947 (*canonical_template_parms
)[idx
]
3948 = tree_cons (NULL_TREE
, type
,
3949 (*canonical_template_parms
)[idx
]);
3954 /* Return a TEMPLATE_PARM_INDEX, similar to INDEX, but whose
3955 TEMPLATE_PARM_LEVEL has been decreased by LEVELS. If such a
3956 TEMPLATE_PARM_INDEX already exists, it is returned; otherwise, a
3957 new one is created. */
3960 reduce_template_parm_level (tree index
, tree type
, int levels
, tree args
,
3961 tsubst_flags_t complain
)
3963 if (TEMPLATE_PARM_DESCENDANTS (index
) == NULL_TREE
3964 || (TEMPLATE_PARM_LEVEL (TEMPLATE_PARM_DESCENDANTS (index
))
3965 != TEMPLATE_PARM_LEVEL (index
) - levels
)
3966 || !same_type_p (type
, TREE_TYPE (TEMPLATE_PARM_DESCENDANTS (index
))))
3968 tree orig_decl
= TEMPLATE_PARM_DECL (index
);
3971 decl
= build_decl (DECL_SOURCE_LOCATION (orig_decl
),
3972 TREE_CODE (orig_decl
), DECL_NAME (orig_decl
), type
);
3973 TREE_CONSTANT (decl
) = TREE_CONSTANT (orig_decl
);
3974 TREE_READONLY (decl
) = TREE_READONLY (orig_decl
);
3975 DECL_ARTIFICIAL (decl
) = 1;
3976 SET_DECL_TEMPLATE_PARM_P (decl
);
3978 t
= build_template_parm_index (TEMPLATE_PARM_IDX (index
),
3979 TEMPLATE_PARM_LEVEL (index
) - levels
,
3980 TEMPLATE_PARM_ORIG_LEVEL (index
),
3982 TEMPLATE_PARM_DESCENDANTS (index
) = t
;
3983 TEMPLATE_PARM_PARAMETER_PACK (t
)
3984 = TEMPLATE_PARM_PARAMETER_PACK (index
);
3986 /* Template template parameters need this. */
3987 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
3989 DECL_TEMPLATE_RESULT (decl
)
3990 = build_decl (DECL_SOURCE_LOCATION (decl
),
3991 TYPE_DECL
, DECL_NAME (decl
), type
);
3992 DECL_ARTIFICIAL (DECL_TEMPLATE_RESULT (decl
)) = true;
3993 DECL_TEMPLATE_PARMS (decl
) = tsubst_template_parms
3994 (DECL_TEMPLATE_PARMS (orig_decl
), args
, complain
);
3998 return TEMPLATE_PARM_DESCENDANTS (index
);
4001 /* Process information from new template parameter PARM and append it
4002 to the LIST being built. This new parameter is a non-type
4003 parameter iff IS_NON_TYPE is true. This new parameter is a
4004 parameter pack iff IS_PARAMETER_PACK is true. The location of PARM
4008 process_template_parm (tree list
, location_t parm_loc
, tree parm
,
4009 bool is_non_type
, bool is_parameter_pack
)
4014 gcc_assert (TREE_CODE (parm
) == TREE_LIST
);
4015 tree defval
= TREE_PURPOSE (parm
);
4016 tree constr
= TREE_TYPE (parm
);
4020 tree p
= tree_last (list
);
4022 if (p
&& TREE_VALUE (p
) != error_mark_node
)
4025 if (TREE_CODE (p
) == TYPE_DECL
|| TREE_CODE (p
) == TEMPLATE_DECL
)
4026 idx
= TEMPLATE_TYPE_IDX (TREE_TYPE (p
));
4028 idx
= TEMPLATE_PARM_IDX (DECL_INITIAL (p
));
4036 parm
= TREE_VALUE (parm
);
4038 SET_DECL_TEMPLATE_PARM_P (parm
);
4040 if (TREE_TYPE (parm
) != error_mark_node
)
4044 The top-level cv-qualifiers on the template-parameter are
4045 ignored when determining its type. */
4046 TREE_TYPE (parm
) = TYPE_MAIN_VARIANT (TREE_TYPE (parm
));
4047 if (invalid_nontype_parm_type_p (TREE_TYPE (parm
), 1))
4048 TREE_TYPE (parm
) = error_mark_node
;
4049 else if (uses_parameter_packs (TREE_TYPE (parm
))
4050 && !is_parameter_pack
4051 /* If we're in a nested template parameter list, the template
4052 template parameter could be a parameter pack. */
4053 && processing_template_parmlist
== 1)
4055 /* This template parameter is not a parameter pack, but it
4056 should be. Complain about "bare" parameter packs. */
4057 check_for_bare_parameter_packs (TREE_TYPE (parm
));
4059 /* Recover by calling this a parameter pack. */
4060 is_parameter_pack
= true;
4064 /* A template parameter is not modifiable. */
4065 TREE_CONSTANT (parm
) = 1;
4066 TREE_READONLY (parm
) = 1;
4067 decl
= build_decl (parm_loc
,
4068 CONST_DECL
, DECL_NAME (parm
), TREE_TYPE (parm
));
4069 TREE_CONSTANT (decl
) = 1;
4070 TREE_READONLY (decl
) = 1;
4071 DECL_INITIAL (parm
) = DECL_INITIAL (decl
)
4072 = build_template_parm_index (idx
, processing_template_decl
,
4073 processing_template_decl
,
4074 decl
, TREE_TYPE (parm
));
4076 TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
))
4077 = is_parameter_pack
;
4082 parm
= TREE_VALUE (TREE_VALUE (parm
));
4084 if (parm
&& TREE_CODE (parm
) == TEMPLATE_DECL
)
4086 t
= cxx_make_type (TEMPLATE_TEMPLATE_PARM
);
4087 /* This is for distinguishing between real templates and template
4088 template parameters */
4089 TREE_TYPE (parm
) = t
;
4090 TREE_TYPE (DECL_TEMPLATE_RESULT (parm
)) = t
;
4095 t
= cxx_make_type (TEMPLATE_TYPE_PARM
);
4096 /* parm is either IDENTIFIER_NODE or NULL_TREE. */
4097 decl
= build_decl (parm_loc
,
4098 TYPE_DECL
, parm
, t
);
4101 TYPE_NAME (t
) = decl
;
4102 TYPE_STUB_DECL (t
) = decl
;
4104 TEMPLATE_TYPE_PARM_INDEX (t
)
4105 = build_template_parm_index (idx
, processing_template_decl
,
4106 processing_template_decl
,
4107 decl
, TREE_TYPE (parm
));
4108 TEMPLATE_TYPE_PARAMETER_PACK (t
) = is_parameter_pack
;
4109 TYPE_CANONICAL (t
) = canonical_type_parameter (t
);
4111 DECL_ARTIFICIAL (decl
) = 1;
4112 SET_DECL_TEMPLATE_PARM_P (decl
);
4114 /* Build requirements for the type/template parameter.
4115 This must be done after SET_DECL_TEMPLATE_PARM_P or
4116 process_template_parm could fail. */
4117 tree reqs
= finish_shorthand_constraint (parm
, constr
);
4121 /* Build the parameter node linking the parameter declaration,
4122 its default argument (if any), and its constraints (if any). */
4123 parm
= build_tree_list (defval
, parm
);
4124 TEMPLATE_PARM_CONSTRAINTS (parm
) = reqs
;
4126 return chainon (list
, parm
);
4129 /* The end of a template parameter list has been reached. Process the
4130 tree list into a parameter vector, converting each parameter into a more
4131 useful form. Type parameters are saved as IDENTIFIER_NODEs, and others
4135 end_template_parm_list (tree parms
)
4139 tree saved_parmlist
= make_tree_vec (list_length (parms
));
4141 /* Pop the dummy parameter level and add the real one. */
4142 current_template_parms
= TREE_CHAIN (current_template_parms
);
4144 current_template_parms
4145 = tree_cons (size_int (processing_template_decl
),
4146 saved_parmlist
, current_template_parms
);
4148 for (parm
= parms
, nparms
= 0; parm
; parm
= next
, nparms
++)
4150 next
= TREE_CHAIN (parm
);
4151 TREE_VEC_ELT (saved_parmlist
, nparms
) = parm
;
4152 TREE_CHAIN (parm
) = NULL_TREE
;
4155 --processing_template_parmlist
;
4157 return saved_parmlist
;
4160 // Explicitly indicate the end of the template parameter list. We assume
4161 // that the current template parameters have been constructed and/or
4162 // managed explicitly, as when creating new template template parameters
4163 // from a shorthand constraint.
4165 end_template_parm_list ()
4167 --processing_template_parmlist
;
4170 /* end_template_decl is called after a template declaration is seen. */
4173 end_template_decl (void)
4175 reset_specialization ();
4177 if (! processing_template_decl
)
4180 /* This matches the pushlevel in begin_template_parm_list. */
4183 --processing_template_decl
;
4184 current_template_parms
= TREE_CHAIN (current_template_parms
);
4187 /* Takes a TREE_LIST representing a template parameter and convert it
4188 into an argument suitable to be passed to the type substitution
4189 functions. Note that If the TREE_LIST contains an error_mark
4190 node, the returned argument is error_mark_node. */
4193 template_parm_to_arg (tree t
)
4197 || TREE_CODE (t
) != TREE_LIST
)
4200 if (error_operand_p (TREE_VALUE (t
)))
4201 return error_mark_node
;
4205 if (TREE_CODE (t
) == TYPE_DECL
4206 || TREE_CODE (t
) == TEMPLATE_DECL
)
4210 if (TEMPLATE_TYPE_PARAMETER_PACK (t
))
4212 /* Turn this argument into a TYPE_ARGUMENT_PACK
4213 with a single element, which expands T. */
4214 tree vec
= make_tree_vec (1);
4216 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (vec
, TREE_VEC_LENGTH (vec
));
4218 TREE_VEC_ELT (vec
, 0) = make_pack_expansion (t
);
4220 t
= cxx_make_type (TYPE_ARGUMENT_PACK
);
4221 SET_ARGUMENT_PACK_ARGS (t
, vec
);
4226 t
= DECL_INITIAL (t
);
4228 if (TEMPLATE_PARM_PARAMETER_PACK (t
))
4230 /* Turn this argument into a NONTYPE_ARGUMENT_PACK
4231 with a single element, which expands T. */
4232 tree vec
= make_tree_vec (1);
4233 tree type
= TREE_TYPE (TEMPLATE_PARM_DECL (t
));
4235 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (vec
, TREE_VEC_LENGTH (vec
));
4237 t
= convert_from_reference (t
);
4238 TREE_VEC_ELT (vec
, 0) = make_pack_expansion (t
);
4240 t
= make_node (NONTYPE_ARGUMENT_PACK
);
4241 SET_ARGUMENT_PACK_ARGS (t
, vec
);
4242 TREE_TYPE (t
) = type
;
4245 t
= convert_from_reference (t
);
4250 /* Given a set of template parameters, return them as a set of template
4251 arguments. The template parameters are represented as a TREE_VEC, in
4252 the form documented in cp-tree.h for template arguments. */
4255 template_parms_to_args (tree parms
)
4258 tree args
= NULL_TREE
;
4259 int length
= TMPL_PARMS_DEPTH (parms
);
4262 /* If there is only one level of template parameters, we do not
4263 create a TREE_VEC of TREE_VECs. Instead, we return a single
4264 TREE_VEC containing the arguments. */
4266 args
= make_tree_vec (length
);
4268 for (header
= parms
; header
; header
= TREE_CHAIN (header
))
4270 tree a
= copy_node (TREE_VALUE (header
));
4273 TREE_TYPE (a
) = NULL_TREE
;
4274 for (i
= TREE_VEC_LENGTH (a
) - 1; i
>= 0; --i
)
4275 TREE_VEC_ELT (a
, i
) = template_parm_to_arg (TREE_VEC_ELT (a
, i
));
4278 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (a
, TREE_VEC_LENGTH (a
));
4281 TREE_VEC_ELT (args
, --l
) = a
;
4289 /* Within the declaration of a template, return the currently active
4290 template parameters as an argument TREE_VEC. */
4293 current_template_args (void)
4295 return template_parms_to_args (current_template_parms
);
4298 /* Update the declared TYPE by doing any lookups which were thought to be
4299 dependent, but are not now that we know the SCOPE of the declarator. */
4302 maybe_update_decl_type (tree orig_type
, tree scope
)
4304 tree type
= orig_type
;
4306 if (type
== NULL_TREE
)
4309 if (TREE_CODE (orig_type
) == TYPE_DECL
)
4310 type
= TREE_TYPE (type
);
4312 if (scope
&& TYPE_P (scope
) && dependent_type_p (scope
)
4313 && dependent_type_p (type
)
4314 /* Don't bother building up the args in this case. */
4315 && TREE_CODE (type
) != TEMPLATE_TYPE_PARM
)
4317 /* tsubst in the args corresponding to the template parameters,
4318 including auto if present. Most things will be unchanged, but
4319 make_typename_type and tsubst_qualified_id will resolve
4320 TYPENAME_TYPEs and SCOPE_REFs that were previously dependent. */
4321 tree args
= current_template_args ();
4322 tree auto_node
= type_uses_auto (type
);
4326 tree auto_vec
= make_tree_vec (1);
4327 TREE_VEC_ELT (auto_vec
, 0) = auto_node
;
4328 args
= add_to_template_args (args
, auto_vec
);
4330 pushed
= push_scope (scope
);
4331 type
= tsubst (type
, args
, tf_warning_or_error
, NULL_TREE
);
4336 if (type
== error_mark_node
)
4339 if (TREE_CODE (orig_type
) == TYPE_DECL
)
4341 if (same_type_p (type
, TREE_TYPE (orig_type
)))
4344 type
= TYPE_NAME (type
);
4349 /* Return a TEMPLATE_DECL corresponding to DECL, using the indicated
4350 template PARMS and constraints, CONSTR. If MEMBER_TEMPLATE_P is true,
4351 the new template is a member template. */
4354 build_template_decl (tree decl
, tree parms
, bool member_template_p
)
4356 tree tmpl
= build_lang_decl (TEMPLATE_DECL
, DECL_NAME (decl
), NULL_TREE
);
4357 DECL_TEMPLATE_PARMS (tmpl
) = parms
;
4358 DECL_CONTEXT (tmpl
) = DECL_CONTEXT (decl
);
4359 DECL_SOURCE_LOCATION (tmpl
) = DECL_SOURCE_LOCATION (decl
);
4360 DECL_MEMBER_TEMPLATE_P (tmpl
) = member_template_p
;
4365 struct template_parm_data
4367 /* The level of the template parameters we are currently
4371 /* The index of the specialization argument we are currently
4375 /* An array whose size is the number of template parameters. The
4376 elements are nonzero if the parameter has been used in any one
4377 of the arguments processed so far. */
4380 /* An array whose size is the number of template arguments. The
4381 elements are nonzero if the argument makes use of template
4382 parameters of this level. */
4383 int* arg_uses_template_parms
;
4386 /* Subroutine of push_template_decl used to see if each template
4387 parameter in a partial specialization is used in the explicit
4388 argument list. If T is of the LEVEL given in DATA (which is
4389 treated as a template_parm_data*), then DATA->PARMS is marked
4393 mark_template_parm (tree t
, void* data
)
4397 struct template_parm_data
* tpd
= (struct template_parm_data
*) data
;
4399 template_parm_level_and_index (t
, &level
, &idx
);
4401 if (level
== tpd
->level
)
4403 tpd
->parms
[idx
] = 1;
4404 tpd
->arg_uses_template_parms
[tpd
->current_arg
] = 1;
4407 /* Return zero so that for_each_template_parm will continue the
4408 traversal of the tree; we want to mark *every* template parm. */
4412 /* Process the partial specialization DECL. */
4415 process_partial_specialization (tree decl
)
4417 tree type
= TREE_TYPE (decl
);
4418 tree tinfo
= get_template_info (decl
);
4419 tree maintmpl
= TI_TEMPLATE (tinfo
);
4420 tree specargs
= TI_ARGS (tinfo
);
4421 tree inner_args
= INNERMOST_TEMPLATE_ARGS (specargs
);
4422 tree main_inner_parms
= DECL_INNERMOST_TEMPLATE_PARMS (maintmpl
);
4425 int nargs
= TREE_VEC_LENGTH (inner_args
);
4428 bool did_error_intro
= false;
4429 struct template_parm_data tpd
;
4430 struct template_parm_data tpd2
;
4432 gcc_assert (current_template_parms
);
4434 /* A concept cannot be specialized. */
4435 if (flag_concepts
&& variable_concept_p (maintmpl
))
4437 error ("specialization of variable concept %q#D", maintmpl
);
4438 return error_mark_node
;
4441 inner_parms
= INNERMOST_TEMPLATE_PARMS (current_template_parms
);
4442 ntparms
= TREE_VEC_LENGTH (inner_parms
);
4444 /* We check that each of the template parameters given in the
4445 partial specialization is used in the argument list to the
4446 specialization. For example:
4448 template <class T> struct S;
4449 template <class T> struct S<T*>;
4451 The second declaration is OK because `T*' uses the template
4452 parameter T, whereas
4454 template <class T> struct S<int>;
4456 is no good. Even trickier is:
4467 The S2<T> declaration is actually invalid; it is a
4468 full-specialization. Of course,
4471 struct S2<T (*)(U)>;
4473 or some such would have been OK. */
4474 tpd
.level
= TMPL_PARMS_DEPTH (current_template_parms
);
4475 tpd
.parms
= XALLOCAVEC (int, ntparms
);
4476 memset (tpd
.parms
, 0, sizeof (int) * ntparms
);
4478 tpd
.arg_uses_template_parms
= XALLOCAVEC (int, nargs
);
4479 memset (tpd
.arg_uses_template_parms
, 0, sizeof (int) * nargs
);
4480 for (i
= 0; i
< nargs
; ++i
)
4482 tpd
.current_arg
= i
;
4483 for_each_template_parm (TREE_VEC_ELT (inner_args
, i
),
4484 &mark_template_parm
,
4487 /*include_nondeduced_p=*/false);
4489 for (i
= 0; i
< ntparms
; ++i
)
4490 if (tpd
.parms
[i
] == 0)
4492 /* One of the template parms was not used in a deduced context in the
4494 if (!did_error_intro
)
4496 error ("template parameters not deducible in "
4497 "partial specialization:");
4498 did_error_intro
= true;
4501 inform (input_location
, " %qD",
4502 TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
)));
4505 if (did_error_intro
)
4506 return error_mark_node
;
4508 /* [temp.class.spec]
4510 The argument list of the specialization shall not be identical to
4511 the implicit argument list of the primary template. */
4513 = TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (maintmpl
)));
4514 if (comp_template_args (inner_args
, INNERMOST_TEMPLATE_ARGS (main_args
))
4516 || !subsumes_constraints (current_template_constraints (),
4517 get_constraints (maintmpl
))))
4520 error ("partial specialization %q+D does not specialize "
4521 "any template arguments", decl
);
4523 error ("partial specialization %q+D does not specialize any "
4524 "template arguments and is not more constrained than", decl
);
4525 inform (DECL_SOURCE_LOCATION (maintmpl
), "primary template here");
4528 /* A partial specialization that replaces multiple parameters of the
4529 primary template with a pack expansion is less specialized for those
4531 if (nargs
< DECL_NTPARMS (maintmpl
))
4533 error ("partial specialization is not more specialized than the "
4534 "primary template because it replaces multiple parameters "
4535 "with a pack expansion");
4536 inform (DECL_SOURCE_LOCATION (maintmpl
), "primary template here");
4540 /* [temp.class.spec]
4542 A partially specialized non-type argument expression shall not
4543 involve template parameters of the partial specialization except
4544 when the argument expression is a simple identifier.
4546 The type of a template parameter corresponding to a specialized
4547 non-type argument shall not be dependent on a parameter of the
4550 Also, we verify that pack expansions only occur at the
4551 end of the argument list. */
4552 gcc_assert (nargs
== DECL_NTPARMS (maintmpl
));
4554 for (i
= 0; i
< nargs
; ++i
)
4556 tree parm
= TREE_VALUE (TREE_VEC_ELT (main_inner_parms
, i
));
4557 tree arg
= TREE_VEC_ELT (inner_args
, i
);
4558 tree packed_args
= NULL_TREE
;
4561 if (ARGUMENT_PACK_P (arg
))
4563 /* Extract the arguments from the argument pack. We'll be
4564 iterating over these in the following loop. */
4565 packed_args
= ARGUMENT_PACK_ARGS (arg
);
4566 len
= TREE_VEC_LENGTH (packed_args
);
4569 for (j
= 0; j
< len
; j
++)
4572 /* Get the Jth argument in the parameter pack. */
4573 arg
= TREE_VEC_ELT (packed_args
, j
);
4575 if (PACK_EXPANSION_P (arg
))
4577 /* Pack expansions must come at the end of the
4579 if ((packed_args
&& j
< len
- 1)
4580 || (!packed_args
&& i
< nargs
- 1))
4582 if (TREE_CODE (arg
) == EXPR_PACK_EXPANSION
)
4583 error ("parameter pack argument %qE must be at the "
4584 "end of the template argument list", arg
);
4586 error ("parameter pack argument %qT must be at the "
4587 "end of the template argument list", arg
);
4591 if (TREE_CODE (arg
) == EXPR_PACK_EXPANSION
)
4592 /* We only care about the pattern. */
4593 arg
= PACK_EXPANSION_PATTERN (arg
);
4595 if (/* These first two lines are the `non-type' bit. */
4597 && TREE_CODE (arg
) != TEMPLATE_DECL
4598 /* This next two lines are the `argument expression is not just a
4599 simple identifier' condition and also the `specialized
4600 non-type argument' bit. */
4601 && TREE_CODE (arg
) != TEMPLATE_PARM_INDEX
4602 && !(REFERENCE_REF_P (arg
)
4603 && TREE_CODE (TREE_OPERAND (arg
, 0)) == TEMPLATE_PARM_INDEX
))
4605 if ((!packed_args
&& tpd
.arg_uses_template_parms
[i
])
4606 || (packed_args
&& uses_template_parms (arg
)))
4607 error ("template argument %qE involves template parameter(s)",
4611 /* Look at the corresponding template parameter,
4612 marking which template parameters its type depends
4614 tree type
= TREE_TYPE (parm
);
4618 /* We haven't yet initialized TPD2. Do so now. */
4619 tpd2
.arg_uses_template_parms
= XALLOCAVEC (int, nargs
);
4620 /* The number of parameters here is the number in the
4621 main template, which, as checked in the assertion
4623 tpd2
.parms
= XALLOCAVEC (int, nargs
);
4625 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (maintmpl
));
4628 /* Mark the template parameters. But this time, we're
4629 looking for the template parameters of the main
4630 template, not in the specialization. */
4631 tpd2
.current_arg
= i
;
4632 tpd2
.arg_uses_template_parms
[i
] = 0;
4633 memset (tpd2
.parms
, 0, sizeof (int) * nargs
);
4634 for_each_template_parm (type
,
4635 &mark_template_parm
,
4638 /*include_nondeduced_p=*/false);
4640 if (tpd2
.arg_uses_template_parms
[i
])
4642 /* The type depended on some template parameters.
4643 If they are fully specialized in the
4644 specialization, that's OK. */
4647 for (j
= 0; j
< nargs
; ++j
)
4648 if (tpd2
.parms
[j
] != 0
4649 && tpd
.arg_uses_template_parms
[j
])
4652 error_n (input_location
, count
,
4653 "type %qT of template argument %qE depends "
4654 "on a template parameter",
4655 "type %qT of template argument %qE depends "
4656 "on template parameters",
4665 /* We should only get here once. */
4666 if (TREE_CODE (decl
) == TYPE_DECL
)
4667 gcc_assert (!COMPLETE_TYPE_P (type
));
4669 // Build the template decl.
4670 tree tmpl
= build_template_decl (decl
, current_template_parms
,
4671 DECL_MEMBER_TEMPLATE_P (maintmpl
));
4672 TREE_TYPE (tmpl
) = type
;
4673 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
4674 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
4675 DECL_TEMPLATE_INFO (tmpl
) = build_template_info (maintmpl
, specargs
);
4676 DECL_PRIMARY_TEMPLATE (tmpl
) = maintmpl
;
4679 /* We didn't register this in check_explicit_specialization so we could
4680 wait until the constraints were set. */
4681 decl
= register_specialization (decl
, maintmpl
, specargs
, false, 0);
4683 associate_classtype_constraints (type
);
4685 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)
4686 = tree_cons (specargs
, tmpl
,
4687 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
));
4688 TREE_TYPE (DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)) = type
;
4690 for (inst
= DECL_TEMPLATE_INSTANTIATIONS (maintmpl
); inst
;
4691 inst
= TREE_CHAIN (inst
))
4693 tree instance
= TREE_VALUE (inst
);
4694 if (TYPE_P (instance
)
4695 ? (COMPLETE_TYPE_P (instance
)
4696 && CLASSTYPE_IMPLICIT_INSTANTIATION (instance
))
4697 : DECL_TEMPLATE_INSTANTIATION (instance
))
4699 tree spec
= most_specialized_partial_spec (instance
, tf_none
);
4700 tree inst_decl
= (DECL_P (instance
)
4701 ? instance
: TYPE_NAME (instance
));
4704 else if (spec
== error_mark_node
)
4705 permerror (input_location
,
4706 "declaration of %qD ambiguates earlier template "
4707 "instantiation for %qD", decl
, inst_decl
);
4708 else if (TREE_VALUE (spec
) == tmpl
)
4709 permerror (input_location
,
4710 "partial specialization of %qD after instantiation "
4711 "of %qD", decl
, inst_decl
);
4718 /* PARM is a template parameter of some form; return the corresponding
4719 TEMPLATE_PARM_INDEX. */
4722 get_template_parm_index (tree parm
)
4724 if (TREE_CODE (parm
) == PARM_DECL
4725 || TREE_CODE (parm
) == CONST_DECL
)
4726 parm
= DECL_INITIAL (parm
);
4727 else if (TREE_CODE (parm
) == TYPE_DECL
4728 || TREE_CODE (parm
) == TEMPLATE_DECL
)
4729 parm
= TREE_TYPE (parm
);
4730 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
4731 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
4732 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
)
4733 parm
= TEMPLATE_TYPE_PARM_INDEX (parm
);
4734 gcc_assert (TREE_CODE (parm
) == TEMPLATE_PARM_INDEX
);
4738 /* Subroutine of fixed_parameter_pack_p below. Look for any template
4739 parameter packs used by the template parameter PARM. */
4742 fixed_parameter_pack_p_1 (tree parm
, struct find_parameter_pack_data
*ppd
)
4744 /* A type parm can't refer to another parm. */
4745 if (TREE_CODE (parm
) == TYPE_DECL
)
4747 else if (TREE_CODE (parm
) == PARM_DECL
)
4749 cp_walk_tree (&TREE_TYPE (parm
), &find_parameter_packs_r
,
4754 gcc_assert (TREE_CODE (parm
) == TEMPLATE_DECL
);
4756 tree vec
= INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (parm
));
4757 for (int i
= 0; i
< TREE_VEC_LENGTH (vec
); ++i
)
4758 fixed_parameter_pack_p_1 (TREE_VALUE (TREE_VEC_ELT (vec
, i
)), ppd
);
4761 /* PARM is a template parameter pack. Return any parameter packs used in
4762 its type or the type of any of its template parameters. If there are
4763 any such packs, it will be instantiated into a fixed template parameter
4764 list by partial instantiation rather than be fully deduced. */
4767 fixed_parameter_pack_p (tree parm
)
4769 /* This can only be true in a member template. */
4770 if (TEMPLATE_PARM_ORIG_LEVEL (get_template_parm_index (parm
)) < 2)
4772 /* This can only be true for a parameter pack. */
4773 if (!template_parameter_pack_p (parm
))
4775 /* A type parm can't refer to another parm. */
4776 if (TREE_CODE (parm
) == TYPE_DECL
)
4779 tree parameter_packs
= NULL_TREE
;
4780 struct find_parameter_pack_data ppd
;
4781 ppd
.parameter_packs
= ¶meter_packs
;
4782 ppd
.visited
= new hash_set
<tree
>;
4783 ppd
.type_pack_expansion_p
= false;
4785 fixed_parameter_pack_p_1 (parm
, &ppd
);
4788 return parameter_packs
;
4791 /* Check that a template declaration's use of default arguments and
4792 parameter packs is not invalid. Here, PARMS are the template
4793 parameters. IS_PRIMARY is true if DECL is the thing declared by
4794 a primary template. IS_PARTIAL is true if DECL is a partial
4797 IS_FRIEND_DECL is nonzero if DECL is a friend function template
4798 declaration (but not a definition); 1 indicates a declaration, 2
4799 indicates a redeclaration. When IS_FRIEND_DECL=2, no errors are
4800 emitted for extraneous default arguments.
4802 Returns TRUE if there were no errors found, FALSE otherwise. */
4805 check_default_tmpl_args (tree decl
, tree parms
, bool is_primary
,
4806 bool is_partial
, int is_friend_decl
)
4809 int last_level_to_check
;
4811 bool no_errors
= true;
4815 A default template-argument shall not be specified in a
4816 function template declaration or a function template definition, nor
4817 in the template-parameter-list of the definition of a member of a
4820 if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == FUNCTION_DECL
4821 || (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_LOCAL_FUNCTION_P (decl
)))
4822 /* You can't have a function template declaration in a local
4823 scope, nor you can you define a member of a class template in a
4827 if ((TREE_CODE (decl
) == TYPE_DECL
4829 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
4830 || (TREE_CODE (decl
) == FUNCTION_DECL
4831 && LAMBDA_FUNCTION_P (decl
)))
4832 /* A lambda doesn't have an explicit declaration; don't complain
4833 about the parms of the enclosing class. */
4836 if (current_class_type
4837 && !TYPE_BEING_DEFINED (current_class_type
)
4838 && DECL_LANG_SPECIFIC (decl
)
4839 && DECL_DECLARES_FUNCTION_P (decl
)
4840 /* If this is either a friend defined in the scope of the class
4841 or a member function. */
4842 && (DECL_FUNCTION_MEMBER_P (decl
)
4843 ? same_type_p (DECL_CONTEXT (decl
), current_class_type
)
4844 : DECL_FRIEND_CONTEXT (decl
)
4845 ? same_type_p (DECL_FRIEND_CONTEXT (decl
), current_class_type
)
4847 /* And, if it was a member function, it really was defined in
4848 the scope of the class. */
4849 && (!DECL_FUNCTION_MEMBER_P (decl
)
4850 || DECL_INITIALIZED_IN_CLASS_P (decl
)))
4851 /* We already checked these parameters when the template was
4852 declared, so there's no need to do it again now. This function
4853 was defined in class scope, but we're processing its body now
4854 that the class is complete. */
4857 /* Core issue 226 (C++0x only): the following only applies to class
4860 && ((cxx_dialect
== cxx98
) || TREE_CODE (decl
) != FUNCTION_DECL
))
4864 If a template-parameter has a default template-argument, all
4865 subsequent template-parameters shall have a default
4866 template-argument supplied. */
4867 for (parm_level
= parms
; parm_level
; parm_level
= TREE_CHAIN (parm_level
))
4869 tree inner_parms
= TREE_VALUE (parm_level
);
4870 int ntparms
= TREE_VEC_LENGTH (inner_parms
);
4871 int seen_def_arg_p
= 0;
4874 for (i
= 0; i
< ntparms
; ++i
)
4876 tree parm
= TREE_VEC_ELT (inner_parms
, i
);
4878 if (parm
== error_mark_node
)
4881 if (TREE_PURPOSE (parm
))
4883 else if (seen_def_arg_p
4884 && !template_parameter_pack_p (TREE_VALUE (parm
)))
4886 error ("no default argument for %qD", TREE_VALUE (parm
));
4887 /* For better subsequent error-recovery, we indicate that
4888 there should have been a default argument. */
4889 TREE_PURPOSE (parm
) = error_mark_node
;
4892 else if (!is_partial
4894 /* Don't complain about an enclosing partial
4896 && parm_level
== parms
4897 && TREE_CODE (decl
) == TYPE_DECL
4899 && template_parameter_pack_p (TREE_VALUE (parm
))
4900 /* A fixed parameter pack will be partially
4901 instantiated into a fixed length list. */
4902 && !fixed_parameter_pack_p (TREE_VALUE (parm
)))
4904 /* A primary class template can only have one
4905 parameter pack, at the end of the template
4908 error ("parameter pack %q+D must be at the end of the"
4909 " template parameter list", TREE_VALUE (parm
));
4911 TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
))
4919 if (((cxx_dialect
== cxx98
) && TREE_CODE (decl
) != TYPE_DECL
)
4923 /* For an ordinary class template, default template arguments are
4924 allowed at the innermost level, e.g.:
4925 template <class T = int>
4927 but, in a partial specialization, they're not allowed even
4928 there, as we have in [temp.class.spec]:
4930 The template parameter list of a specialization shall not
4931 contain default template argument values.
4933 So, for a partial specialization, or for a function template
4934 (in C++98/C++03), we look at all of them. */
4937 /* But, for a primary class template that is not a partial
4938 specialization we look at all template parameters except the
4940 parms
= TREE_CHAIN (parms
);
4942 /* Figure out what error message to issue. */
4943 if (is_friend_decl
== 2)
4944 msg
= G_("default template arguments may not be used in function template "
4945 "friend re-declaration");
4946 else if (is_friend_decl
)
4947 msg
= G_("default template arguments may not be used in function template "
4948 "friend declarations");
4949 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& (cxx_dialect
== cxx98
))
4950 msg
= G_("default template arguments may not be used in function templates "
4951 "without -std=c++11 or -std=gnu++11");
4952 else if (is_partial
)
4953 msg
= G_("default template arguments may not be used in "
4954 "partial specializations");
4955 else if (current_class_type
&& CLASSTYPE_IS_TEMPLATE (current_class_type
))
4956 msg
= G_("default argument for template parameter for class enclosing %qD");
4958 /* Per [temp.param]/9, "A default template-argument shall not be
4959 specified in the template-parameter-lists of the definition of
4960 a member of a class template that appears outside of the member's
4961 class.", thus if we aren't handling a member of a class template
4962 there is no need to examine the parameters. */
4965 if (current_class_type
&& TYPE_BEING_DEFINED (current_class_type
))
4966 /* If we're inside a class definition, there's no need to
4967 examine the parameters to the class itself. On the one
4968 hand, they will be checked when the class is defined, and,
4969 on the other, default arguments are valid in things like:
4970 template <class T = double>
4971 struct S { template <class U> void f(U); };
4972 Here the default argument for `S' has no bearing on the
4973 declaration of `f'. */
4974 last_level_to_check
= template_class_depth (current_class_type
) + 1;
4976 /* Check everything. */
4977 last_level_to_check
= 0;
4979 for (parm_level
= parms
;
4980 parm_level
&& TMPL_PARMS_DEPTH (parm_level
) >= last_level_to_check
;
4981 parm_level
= TREE_CHAIN (parm_level
))
4983 tree inner_parms
= TREE_VALUE (parm_level
);
4987 ntparms
= TREE_VEC_LENGTH (inner_parms
);
4988 for (i
= 0; i
< ntparms
; ++i
)
4990 if (TREE_VEC_ELT (inner_parms
, i
) == error_mark_node
)
4993 if (TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)))
4998 if (is_friend_decl
== 2)
5005 /* Clear out the default argument so that we are not
5007 TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)) = NULL_TREE
;
5011 /* At this point, if we're still interested in issuing messages,
5012 they must apply to classes surrounding the object declared. */
5014 msg
= G_("default argument for template parameter for class "
5021 /* Worker for push_template_decl_real, called via
5022 for_each_template_parm. DATA is really an int, indicating the
5023 level of the parameters we are interested in. If T is a template
5024 parameter of that level, return nonzero. */
5027 template_parm_this_level_p (tree t
, void* data
)
5029 int this_level
= *(int *)data
;
5032 if (TREE_CODE (t
) == TEMPLATE_PARM_INDEX
)
5033 level
= TEMPLATE_PARM_LEVEL (t
);
5035 level
= TEMPLATE_TYPE_LEVEL (t
);
5036 return level
== this_level
;
5039 /* Creates a TEMPLATE_DECL for the indicated DECL using the template
5040 parameters given by current_template_args, or reuses a
5041 previously existing one, if appropriate. Returns the DECL, or an
5042 equivalent one, if it is replaced via a call to duplicate_decls.
5044 If IS_FRIEND is true, DECL is a friend declaration. */
5047 push_template_decl_real (tree decl
, bool is_friend
)
5055 int new_template_p
= 0;
5056 /* True if the template is a member template, in the sense of
5058 bool member_template_p
= false;
5060 if (decl
== error_mark_node
|| !current_template_parms
)
5061 return error_mark_node
;
5063 /* See if this is a partial specialization. */
5064 is_partial
= ((DECL_IMPLICIT_TYPEDEF_P (decl
)
5065 && TREE_CODE (TREE_TYPE (decl
)) != ENUMERAL_TYPE
5066 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)))
5068 && DECL_LANG_SPECIFIC (decl
)
5069 && DECL_TEMPLATE_SPECIALIZATION (decl
)
5070 && TINFO_USED_TEMPLATE_ID (DECL_TEMPLATE_INFO (decl
))));
5072 if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_FRIEND_P (decl
))
5076 /* For a friend, we want the context of the friend function, not
5077 the type of which it is a friend. */
5078 ctx
= CP_DECL_CONTEXT (decl
);
5079 else if (CP_DECL_CONTEXT (decl
)
5080 && TREE_CODE (CP_DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
5081 /* In the case of a virtual function, we want the class in which
5083 ctx
= CP_DECL_CONTEXT (decl
);
5085 /* Otherwise, if we're currently defining some class, the DECL
5086 is assumed to be a member of the class. */
5087 ctx
= current_scope ();
5089 if (ctx
&& TREE_CODE (ctx
) == NAMESPACE_DECL
)
5092 if (!DECL_CONTEXT (decl
))
5093 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
5095 /* See if this is a primary template. */
5096 if (is_friend
&& ctx
5097 && uses_template_parms_level (ctx
, processing_template_decl
))
5098 /* A friend template that specifies a class context, i.e.
5099 template <typename T> friend void A<T>::f();
5102 else if (TREE_CODE (decl
) == TYPE_DECL
5103 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
5106 is_primary
= template_parm_scope_p ();
5110 warning (OPT_Wtemplates
, "template %qD declared", decl
);
5112 if (DECL_CLASS_SCOPE_P (decl
))
5113 member_template_p
= true;
5114 if (TREE_CODE (decl
) == TYPE_DECL
5115 && anon_aggrname_p (DECL_NAME (decl
)))
5117 error ("template class without a name");
5118 return error_mark_node
;
5120 else if (TREE_CODE (decl
) == FUNCTION_DECL
)
5122 if (member_template_p
)
5124 if (DECL_OVERRIDE_P (decl
) || DECL_FINAL_P (decl
))
5125 error ("member template %qD may not have virt-specifiers", decl
);
5127 if (DECL_DESTRUCTOR_P (decl
))
5131 A destructor shall not be a member template. */
5132 error ("destructor %qD declared as member template", decl
);
5133 return error_mark_node
;
5135 if (NEW_DELETE_OPNAME_P (DECL_NAME (decl
))
5136 && (!prototype_p (TREE_TYPE (decl
))
5137 || TYPE_ARG_TYPES (TREE_TYPE (decl
)) == void_list_node
5138 || !TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)))
5139 || (TREE_CHAIN (TYPE_ARG_TYPES ((TREE_TYPE (decl
))))
5140 == void_list_node
)))
5142 /* [basic.stc.dynamic.allocation]
5144 An allocation function can be a function
5145 template. ... Template allocation functions shall
5146 have two or more parameters. */
5147 error ("invalid template declaration of %qD", decl
);
5148 return error_mark_node
;
5151 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
5152 && CLASS_TYPE_P (TREE_TYPE (decl
)))
5154 else if (TREE_CODE (decl
) == TYPE_DECL
5155 && TYPE_DECL_ALIAS_P (decl
))
5156 /* alias-declaration */
5157 gcc_assert (!DECL_ARTIFICIAL (decl
));
5158 else if (VAR_P (decl
))
5159 /* C++14 variable template. */;
5162 error ("template declaration of %q#D", decl
);
5163 return error_mark_node
;
5167 /* Check to see that the rules regarding the use of default
5168 arguments are not being violated. */
5169 check_default_tmpl_args (decl
, current_template_parms
,
5170 is_primary
, is_partial
, /*is_friend_decl=*/0);
5172 /* Ensure that there are no parameter packs in the type of this
5173 declaration that have not been expanded. */
5174 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5176 /* Check each of the arguments individually to see if there are
5177 any bare parameter packs. */
5178 tree type
= TREE_TYPE (decl
);
5179 tree arg
= DECL_ARGUMENTS (decl
);
5180 tree argtype
= TYPE_ARG_TYPES (type
);
5182 while (arg
&& argtype
)
5184 if (!DECL_PACK_P (arg
)
5185 && check_for_bare_parameter_packs (TREE_TYPE (arg
)))
5187 /* This is a PARM_DECL that contains unexpanded parameter
5188 packs. We have already complained about this in the
5189 check_for_bare_parameter_packs call, so just replace
5190 these types with ERROR_MARK_NODE. */
5191 TREE_TYPE (arg
) = error_mark_node
;
5192 TREE_VALUE (argtype
) = error_mark_node
;
5195 arg
= DECL_CHAIN (arg
);
5196 argtype
= TREE_CHAIN (argtype
);
5199 /* Check for bare parameter packs in the return type and the
5200 exception specifiers. */
5201 if (check_for_bare_parameter_packs (TREE_TYPE (type
)))
5202 /* Errors were already issued, set return type to int
5203 as the frontend doesn't expect error_mark_node as
5205 TREE_TYPE (type
) = integer_type_node
;
5206 if (check_for_bare_parameter_packs (TYPE_RAISES_EXCEPTIONS (type
)))
5207 TYPE_RAISES_EXCEPTIONS (type
) = NULL_TREE
;
5209 else if (check_for_bare_parameter_packs ((TREE_CODE (decl
) == TYPE_DECL
5210 && TYPE_DECL_ALIAS_P (decl
))
5211 ? DECL_ORIGINAL_TYPE (decl
)
5212 : TREE_TYPE (decl
)))
5214 TREE_TYPE (decl
) = error_mark_node
;
5215 return error_mark_node
;
5219 return process_partial_specialization (decl
);
5221 args
= current_template_args ();
5224 || TREE_CODE (ctx
) == FUNCTION_DECL
5225 || (CLASS_TYPE_P (ctx
) && TYPE_BEING_DEFINED (ctx
))
5226 || (TREE_CODE (decl
) == TYPE_DECL
5227 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
5228 || (is_friend
&& !DECL_TEMPLATE_INFO (decl
)))
5230 if (DECL_LANG_SPECIFIC (decl
)
5231 && DECL_TEMPLATE_INFO (decl
)
5232 && DECL_TI_TEMPLATE (decl
))
5233 tmpl
= DECL_TI_TEMPLATE (decl
);
5234 /* If DECL is a TYPE_DECL for a class-template, then there won't
5235 be DECL_LANG_SPECIFIC. The information equivalent to
5236 DECL_TEMPLATE_INFO is found in TYPE_TEMPLATE_INFO instead. */
5237 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
5238 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl
))
5239 && TYPE_TI_TEMPLATE (TREE_TYPE (decl
)))
5241 /* Since a template declaration already existed for this
5242 class-type, we must be redeclaring it here. Make sure
5243 that the redeclaration is valid. */
5244 redeclare_class_template (TREE_TYPE (decl
),
5245 current_template_parms
,
5246 current_template_constraints ());
5247 /* We don't need to create a new TEMPLATE_DECL; just use the
5248 one we already had. */
5249 tmpl
= TYPE_TI_TEMPLATE (TREE_TYPE (decl
));
5253 tmpl
= build_template_decl (decl
, current_template_parms
,
5257 if (DECL_LANG_SPECIFIC (decl
)
5258 && DECL_TEMPLATE_SPECIALIZATION (decl
))
5260 /* A specialization of a member template of a template
5262 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
5263 DECL_TEMPLATE_INFO (tmpl
) = DECL_TEMPLATE_INFO (decl
);
5264 DECL_TEMPLATE_INFO (decl
) = NULL_TREE
;
5270 tree a
, t
, current
, parms
;
5272 tree tinfo
= get_template_info (decl
);
5276 error ("template definition of non-template %q#D", decl
);
5277 return error_mark_node
;
5280 tmpl
= TI_TEMPLATE (tinfo
);
5282 if (DECL_FUNCTION_TEMPLATE_P (tmpl
)
5283 && DECL_TEMPLATE_INFO (decl
) && DECL_TI_ARGS (decl
)
5284 && DECL_TEMPLATE_SPECIALIZATION (decl
)
5285 && DECL_MEMBER_TEMPLATE_P (tmpl
))
5289 /* The declaration is a specialization of a member
5290 template, declared outside the class. Therefore, the
5291 innermost template arguments will be NULL, so we
5292 replace them with the arguments determined by the
5293 earlier call to check_explicit_specialization. */
5294 args
= DECL_TI_ARGS (decl
);
5297 = build_template_decl (decl
, current_template_parms
,
5299 DECL_TEMPLATE_RESULT (new_tmpl
) = decl
;
5300 TREE_TYPE (new_tmpl
) = TREE_TYPE (decl
);
5301 DECL_TI_TEMPLATE (decl
) = new_tmpl
;
5302 SET_DECL_TEMPLATE_SPECIALIZATION (new_tmpl
);
5303 DECL_TEMPLATE_INFO (new_tmpl
)
5304 = build_template_info (tmpl
, args
);
5306 register_specialization (new_tmpl
,
5307 most_general_template (tmpl
),
5313 /* Make sure the template headers we got make sense. */
5315 parms
= DECL_TEMPLATE_PARMS (tmpl
);
5316 i
= TMPL_PARMS_DEPTH (parms
);
5317 if (TMPL_ARGS_DEPTH (args
) != i
)
5319 error ("expected %d levels of template parms for %q#D, got %d",
5320 i
, decl
, TMPL_ARGS_DEPTH (args
));
5321 DECL_INTERFACE_KNOWN (decl
) = 1;
5322 return error_mark_node
;
5325 for (current
= decl
; i
> 0; --i
, parms
= TREE_CHAIN (parms
))
5327 a
= TMPL_ARGS_LEVEL (args
, i
);
5328 t
= INNERMOST_TEMPLATE_PARMS (parms
);
5330 if (TREE_VEC_LENGTH (t
) != TREE_VEC_LENGTH (a
))
5332 if (current
== decl
)
5333 error ("got %d template parameters for %q#D",
5334 TREE_VEC_LENGTH (a
), decl
);
5336 error ("got %d template parameters for %q#T",
5337 TREE_VEC_LENGTH (a
), current
);
5338 error (" but %d required", TREE_VEC_LENGTH (t
));
5339 /* Avoid crash in import_export_decl. */
5340 DECL_INTERFACE_KNOWN (decl
) = 1;
5341 return error_mark_node
;
5344 if (current
== decl
)
5346 else if (current
== NULL_TREE
)
5347 /* Can happen in erroneous input. */
5350 current
= get_containing_scope (current
);
5353 /* Check that the parms are used in the appropriate qualifying scopes
5354 in the declarator. */
5355 if (!comp_template_args
5357 TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (tmpl
)))))
5360 template arguments to %qD do not match original template %qD",
5361 decl
, DECL_TEMPLATE_RESULT (tmpl
));
5362 if (!uses_template_parms (TI_ARGS (tinfo
)))
5363 inform (input_location
, "use template<> for an explicit specialization");
5364 /* Avoid crash in import_export_decl. */
5365 DECL_INTERFACE_KNOWN (decl
) = 1;
5366 return error_mark_node
;
5370 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
5371 TREE_TYPE (tmpl
) = TREE_TYPE (decl
);
5373 /* Push template declarations for global functions and types. Note
5374 that we do not try to push a global template friend declared in a
5375 template class; such a thing may well depend on the template
5376 parameters of the class. */
5377 if (new_template_p
&& !ctx
5378 && !(is_friend
&& template_class_depth (current_class_type
) > 0))
5380 tmpl
= pushdecl_namespace_level (tmpl
, is_friend
);
5381 if (tmpl
== error_mark_node
)
5382 return error_mark_node
;
5384 /* Hide template friend classes that haven't been declared yet. */
5385 if (is_friend
&& TREE_CODE (decl
) == TYPE_DECL
)
5387 DECL_ANTICIPATED (tmpl
) = 1;
5388 DECL_FRIEND_P (tmpl
) = 1;
5394 tree parms
= DECL_TEMPLATE_PARMS (tmpl
);
5397 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
5398 if (DECL_CONV_FN_P (tmpl
))
5400 int depth
= TMPL_PARMS_DEPTH (parms
);
5402 /* It is a conversion operator. See if the type converted to
5403 depends on innermost template operands. */
5405 if (uses_template_parms_level (TREE_TYPE (TREE_TYPE (tmpl
)),
5407 DECL_TEMPLATE_CONV_FN_P (tmpl
) = 1;
5410 /* Give template template parms a DECL_CONTEXT of the template
5411 for which they are a parameter. */
5412 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
5413 for (i
= TREE_VEC_LENGTH (parms
) - 1; i
>= 0; --i
)
5415 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
5416 if (TREE_CODE (parm
) == TEMPLATE_DECL
)
5417 DECL_CONTEXT (parm
) = tmpl
;
5420 if (TREE_CODE (decl
) == TYPE_DECL
5421 && TYPE_DECL_ALIAS_P (decl
)
5422 && complex_alias_template_p (tmpl
))
5423 TEMPLATE_DECL_COMPLEX_ALIAS_P (tmpl
) = true;
5426 /* The DECL_TI_ARGS of DECL contains full set of arguments referring
5427 back to its most general template. If TMPL is a specialization,
5428 ARGS may only have the innermost set of arguments. Add the missing
5429 argument levels if necessary. */
5430 if (DECL_TEMPLATE_INFO (tmpl
))
5431 args
= add_outermost_template_args (DECL_TI_ARGS (tmpl
), args
);
5433 info
= build_template_info (tmpl
, args
);
5435 if (DECL_IMPLICIT_TYPEDEF_P (decl
))
5436 SET_TYPE_TEMPLATE_INFO (TREE_TYPE (tmpl
), info
);
5439 if (is_primary
&& !DECL_LANG_SPECIFIC (decl
))
5440 retrofit_lang_decl (decl
);
5441 if (DECL_LANG_SPECIFIC (decl
))
5442 DECL_TEMPLATE_INFO (decl
) = info
;
5445 if (flag_implicit_templates
5447 && TREE_PUBLIC (decl
)
5448 && VAR_OR_FUNCTION_DECL_P (decl
))
5449 /* Set DECL_COMDAT on template instantiations; if we force
5450 them to be emitted by explicit instantiation or -frepo,
5451 mark_needed will tell cgraph to do the right thing. */
5452 DECL_COMDAT (decl
) = true;
5454 return DECL_TEMPLATE_RESULT (tmpl
);
5458 push_template_decl (tree decl
)
5460 return push_template_decl_real (decl
, false);
5463 /* FN is an inheriting constructor that inherits from the constructor
5464 template INHERITED; turn FN into a constructor template with a matching
5468 add_inherited_template_parms (tree fn
, tree inherited
)
5471 = INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (inherited
));
5472 inner_parms
= copy_node (inner_parms
);
5474 = tree_cons (size_int (processing_template_decl
+ 1),
5475 inner_parms
, current_template_parms
);
5476 tree tmpl
= build_template_decl (fn
, parms
, /*member*/true);
5477 tree args
= template_parms_to_args (parms
);
5478 DECL_TEMPLATE_INFO (fn
) = build_template_info (tmpl
, args
);
5479 TREE_TYPE (tmpl
) = TREE_TYPE (fn
);
5480 DECL_TEMPLATE_RESULT (tmpl
) = fn
;
5481 DECL_ARTIFICIAL (tmpl
) = true;
5482 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
5486 /* Called when a class template TYPE is redeclared with the indicated
5487 template PARMS, e.g.:
5489 template <class T> struct S;
5490 template <class T> struct S {}; */
5493 redeclare_class_template (tree type
, tree parms
, tree cons
)
5499 if (!TYPE_TEMPLATE_INFO (type
))
5501 error ("%qT is not a template type", type
);
5505 tmpl
= TYPE_TI_TEMPLATE (type
);
5506 if (!PRIMARY_TEMPLATE_P (tmpl
))
5507 /* The type is nested in some template class. Nothing to worry
5508 about here; there are no new template parameters for the nested
5514 error ("template specifiers not specified in declaration of %qD",
5519 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
5520 tmpl_parms
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl
);
5522 if (TREE_VEC_LENGTH (parms
) != TREE_VEC_LENGTH (tmpl_parms
))
5524 error_n (input_location
, TREE_VEC_LENGTH (parms
),
5525 "redeclared with %d template parameter",
5526 "redeclared with %d template parameters",
5527 TREE_VEC_LENGTH (parms
));
5528 inform_n (DECL_SOURCE_LOCATION (tmpl
), TREE_VEC_LENGTH (tmpl_parms
),
5529 "previous declaration %qD used %d template parameter",
5530 "previous declaration %qD used %d template parameters",
5531 tmpl
, TREE_VEC_LENGTH (tmpl_parms
));
5535 for (i
= 0; i
< TREE_VEC_LENGTH (tmpl_parms
); ++i
)
5542 if (TREE_VEC_ELT (tmpl_parms
, i
) == error_mark_node
5543 || TREE_VEC_ELT (parms
, i
) == error_mark_node
)
5546 tmpl_parm
= TREE_VALUE (TREE_VEC_ELT (tmpl_parms
, i
));
5547 if (error_operand_p (tmpl_parm
))
5550 parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
5551 tmpl_default
= TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
));
5552 parm_default
= TREE_PURPOSE (TREE_VEC_ELT (parms
, i
));
5554 /* TMPL_PARM and PARM can be either TYPE_DECL, PARM_DECL, or
5556 if (TREE_CODE (tmpl_parm
) != TREE_CODE (parm
)
5557 || (TREE_CODE (tmpl_parm
) != TYPE_DECL
5558 && !same_type_p (TREE_TYPE (tmpl_parm
), TREE_TYPE (parm
)))
5559 || (TREE_CODE (tmpl_parm
) != PARM_DECL
5560 && (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (tmpl_parm
))
5561 != TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
))))
5562 || (TREE_CODE (tmpl_parm
) == PARM_DECL
5563 && (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (tmpl_parm
))
5564 != TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))))
5566 error ("template parameter %q+#D", tmpl_parm
);
5567 error ("redeclared here as %q#D", parm
);
5571 if (tmpl_default
!= NULL_TREE
&& parm_default
!= NULL_TREE
)
5573 /* We have in [temp.param]:
5575 A template-parameter may not be given default arguments
5576 by two different declarations in the same scope. */
5577 error_at (input_location
, "redefinition of default argument for %q#D", parm
);
5578 inform (DECL_SOURCE_LOCATION (tmpl_parm
),
5579 "original definition appeared here");
5583 if (parm_default
!= NULL_TREE
)
5584 /* Update the previous template parameters (which are the ones
5585 that will really count) with the new default value. */
5586 TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
)) = parm_default
;
5587 else if (tmpl_default
!= NULL_TREE
)
5588 /* Update the new parameters, too; they'll be used as the
5589 parameters for any members. */
5590 TREE_PURPOSE (TREE_VEC_ELT (parms
, i
)) = tmpl_default
;
5592 /* Give each template template parm in this redeclaration a
5593 DECL_CONTEXT of the template for which they are a parameter. */
5594 if (TREE_CODE (parm
) == TEMPLATE_DECL
)
5596 gcc_assert (DECL_CONTEXT (parm
) == NULL_TREE
);
5597 DECL_CONTEXT (parm
) = tmpl
;
5601 // Cannot redeclare a class template with a different set of constraints.
5602 if (!equivalent_constraints (get_constraints (tmpl
), cons
))
5604 error_at (input_location
, "redeclaration %q#D with different "
5605 "constraints", tmpl
);
5606 inform (DECL_SOURCE_LOCATION (tmpl
),
5607 "original declaration appeared here");
5613 /* The actual substitution part of instantiate_non_dependent_expr_sfinae,
5614 to be used when the caller has already checked
5615 (processing_template_decl
5616 && !instantiation_dependent_expression_p (expr)
5617 && potential_constant_expression (expr))
5618 and cleared processing_template_decl. */
5621 instantiate_non_dependent_expr_internal (tree expr
, tsubst_flags_t complain
)
5623 return tsubst_copy_and_build (expr
,
5626 /*in_decl=*/NULL_TREE
,
5627 /*function_p=*/false,
5628 /*integral_constant_expression_p=*/true);
5631 /* Simplify EXPR if it is a non-dependent expression. Returns the
5632 (possibly simplified) expression. */
5635 instantiate_non_dependent_expr_sfinae (tree expr
, tsubst_flags_t complain
)
5637 if (expr
== NULL_TREE
)
5640 /* If we're in a template, but EXPR isn't value dependent, simplify
5641 it. We're supposed to treat:
5643 template <typename T> void f(T[1 + 1]);
5644 template <typename T> void f(T[2]);
5646 as two declarations of the same function, for example. */
5647 if (processing_template_decl
5648 && !instantiation_dependent_expression_p (expr
)
5649 && potential_constant_expression (expr
))
5651 processing_template_decl_sentinel s
;
5652 expr
= instantiate_non_dependent_expr_internal (expr
, complain
);
5658 instantiate_non_dependent_expr (tree expr
)
5660 return instantiate_non_dependent_expr_sfinae (expr
, tf_error
);
5663 /* True iff T is a specialization of a variable template. */
5666 variable_template_specialization_p (tree t
)
5668 if (!VAR_P (t
) || !DECL_LANG_SPECIFIC (t
) || !DECL_TEMPLATE_INFO (t
))
5670 tree tmpl
= DECL_TI_TEMPLATE (t
);
5671 return variable_template_p (tmpl
);
5674 /* Return TRUE iff T is a type alias, a TEMPLATE_DECL for an alias
5675 template declaration, or a TYPE_DECL for an alias declaration. */
5678 alias_type_or_template_p (tree t
)
5682 return ((TREE_CODE (t
) == TYPE_DECL
&& TYPE_DECL_ALIAS_P (t
))
5685 && TYPE_DECL_ALIAS_P (TYPE_NAME (t
)))
5686 || DECL_ALIAS_TEMPLATE_P (t
));
5689 /* Return TRUE iff T is a specialization of an alias template. */
5692 alias_template_specialization_p (const_tree t
)
5694 /* It's an alias template specialization if it's an alias and its
5695 TYPE_NAME is a specialization of a primary template. */
5696 if (TYPE_ALIAS_P (t
))
5698 tree name
= TYPE_NAME (t
);
5699 if (DECL_LANG_SPECIFIC (name
))
5700 if (tree ti
= DECL_TEMPLATE_INFO (name
))
5702 tree tmpl
= TI_TEMPLATE (ti
);
5703 return PRIMARY_TEMPLATE_P (tmpl
);
5709 /* An alias template is complex from a SFINAE perspective if a template-id
5710 using that alias can be ill-formed when the expansion is not, as with
5711 the void_t template. We determine this by checking whether the
5712 expansion for the alias template uses all its template parameters. */
5714 struct uses_all_template_parms_data
5721 uses_all_template_parms_r (tree t
, void *data_
)
5723 struct uses_all_template_parms_data
&data
5724 = *(struct uses_all_template_parms_data
*)data_
;
5725 tree idx
= get_template_parm_index (t
);
5727 if (TEMPLATE_PARM_LEVEL (idx
) == data
.level
)
5728 data
.seen
[TEMPLATE_PARM_IDX (idx
)] = true;
5733 complex_alias_template_p (const_tree tmpl
)
5735 struct uses_all_template_parms_data data
;
5736 tree pat
= DECL_ORIGINAL_TYPE (DECL_TEMPLATE_RESULT (tmpl
));
5737 tree parms
= DECL_TEMPLATE_PARMS (tmpl
);
5738 data
.level
= TMPL_PARMS_DEPTH (parms
);
5739 int len
= TREE_VEC_LENGTH (INNERMOST_TEMPLATE_PARMS (parms
));
5740 data
.seen
= XALLOCAVEC (bool, len
);
5741 for (int i
= 0; i
< len
; ++i
)
5742 data
.seen
[i
] = false;
5744 for_each_template_parm (pat
, uses_all_template_parms_r
, &data
, NULL
, true);
5745 for (int i
= 0; i
< len
; ++i
)
5751 /* Return TRUE iff T is a specialization of a complex alias template with
5752 dependent template-arguments. */
5755 dependent_alias_template_spec_p (const_tree t
)
5757 return (alias_template_specialization_p (t
)
5758 && TEMPLATE_DECL_COMPLEX_ALIAS_P (DECL_TI_TEMPLATE (TYPE_NAME (t
)))
5759 && (any_dependent_template_arguments_p
5760 (INNERMOST_TEMPLATE_ARGS (TYPE_TI_ARGS (t
)))));
5763 /* Return the number of innermost template parameters in TMPL. */
5766 num_innermost_template_parms (tree tmpl
)
5768 tree parms
= INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (tmpl
));
5769 return TREE_VEC_LENGTH (parms
);
5772 /* Return either TMPL or another template that it is equivalent to under DR
5773 1286: An alias that just changes the name of a template is equivalent to
5774 the other template. */
5777 get_underlying_template (tree tmpl
)
5779 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
);
5780 while (DECL_ALIAS_TEMPLATE_P (tmpl
))
5782 tree result
= DECL_ORIGINAL_TYPE (DECL_TEMPLATE_RESULT (tmpl
));
5783 if (TYPE_TEMPLATE_INFO (result
))
5785 tree sub
= TYPE_TI_TEMPLATE (result
);
5786 if (PRIMARY_TEMPLATE_P (sub
)
5787 && (num_innermost_template_parms (tmpl
)
5788 == num_innermost_template_parms (sub
)))
5790 tree alias_args
= INNERMOST_TEMPLATE_ARGS
5791 (template_parms_to_args (DECL_TEMPLATE_PARMS (tmpl
)));
5792 if (!comp_template_args (TYPE_TI_ARGS (result
), alias_args
))
5794 /* The alias type is equivalent to the pattern of the
5795 underlying template, so strip the alias. */
5805 /* Subroutine of convert_nontype_argument. Converts EXPR to TYPE, which
5806 must be a function or a pointer-to-function type, as specified
5807 in [temp.arg.nontype]: disambiguate EXPR if it is an overload set,
5808 and check that the resulting function has external linkage. */
5811 convert_nontype_argument_function (tree type
, tree expr
,
5812 tsubst_flags_t complain
)
5816 linkage_kind linkage
;
5818 fn
= instantiate_type (type
, fns
, tf_none
);
5819 if (fn
== error_mark_node
)
5820 return error_mark_node
;
5823 if (TREE_CODE (fn_no_ptr
) == ADDR_EXPR
)
5824 fn_no_ptr
= TREE_OPERAND (fn_no_ptr
, 0);
5825 if (BASELINK_P (fn_no_ptr
))
5826 fn_no_ptr
= BASELINK_FUNCTIONS (fn_no_ptr
);
5828 /* [temp.arg.nontype]/1
5830 A template-argument for a non-type, non-template template-parameter
5833 -- the address of an object or function with external [C++11: or
5834 internal] linkage. */
5836 if (TREE_CODE (fn_no_ptr
) != FUNCTION_DECL
)
5838 if (complain
& tf_error
)
5840 error ("%qE is not a valid template argument for type %qT",
5842 if (TYPE_PTR_P (type
))
5843 error ("it must be the address of a function with "
5844 "external linkage");
5846 error ("it must be the name of a function with "
5847 "external linkage");
5852 linkage
= decl_linkage (fn_no_ptr
);
5853 if (cxx_dialect
>= cxx11
? linkage
== lk_none
: linkage
!= lk_external
)
5855 if (complain
& tf_error
)
5857 if (cxx_dialect
>= cxx11
)
5858 error ("%qE is not a valid template argument for type %qT "
5859 "because %qD has no linkage",
5860 expr
, type
, fn_no_ptr
);
5862 error ("%qE is not a valid template argument for type %qT "
5863 "because %qD does not have external linkage",
5864 expr
, type
, fn_no_ptr
);
5872 /* Subroutine of convert_nontype_argument.
5873 Check if EXPR of type TYPE is a valid pointer-to-member constant.
5874 Emit an error otherwise. */
5877 check_valid_ptrmem_cst_expr (tree type
, tree expr
,
5878 tsubst_flags_t complain
)
5881 if (expr
&& (null_ptr_cst_p (expr
) || TREE_CODE (expr
) == PTRMEM_CST
))
5883 if (cxx_dialect
>= cxx11
&& null_member_pointer_value_p (expr
))
5885 if (processing_template_decl
5886 && TREE_CODE (expr
) == ADDR_EXPR
5887 && TREE_CODE (TREE_OPERAND (expr
, 0)) == OFFSET_REF
)
5889 if (complain
& tf_error
)
5891 error ("%qE is not a valid template argument for type %qT",
5893 error ("it must be a pointer-to-member of the form %<&X::Y%>");
5898 /* Returns TRUE iff the address of OP is value-dependent.
5900 14.6.2.4 [temp.dep.temp]:
5901 A non-integral non-type template-argument is dependent if its type is
5902 dependent or it has either of the following forms
5905 and contains a nested-name-specifier which specifies a class-name that
5906 names a dependent type.
5908 We generalize this to just say that the address of a member of a
5909 dependent class is value-dependent; the above doesn't cover the
5910 address of a static data member named with an unqualified-id. */
5913 has_value_dependent_address (tree op
)
5915 /* We could use get_inner_reference here, but there's no need;
5916 this is only relevant for template non-type arguments, which
5917 can only be expressed as &id-expression. */
5920 tree ctx
= CP_DECL_CONTEXT (op
);
5921 if (TYPE_P (ctx
) && dependent_type_p (ctx
))
5928 /* The next set of functions are used for providing helpful explanatory
5929 diagnostics for failed overload resolution. Their messages should be
5930 indented by two spaces for consistency with the messages in
5934 unify_success (bool /*explain_p*/)
5940 unify_parameter_deduction_failure (bool explain_p
, tree parm
)
5943 inform (input_location
,
5944 " couldn't deduce template parameter %qD", parm
);
5949 unify_invalid (bool /*explain_p*/)
5955 unify_cv_qual_mismatch (bool explain_p
, tree parm
, tree arg
)
5958 inform (input_location
,
5959 " types %qT and %qT have incompatible cv-qualifiers",
5965 unify_type_mismatch (bool explain_p
, tree parm
, tree arg
)
5968 inform (input_location
, " mismatched types %qT and %qT", parm
, arg
);
5973 unify_parameter_pack_mismatch (bool explain_p
, tree parm
, tree arg
)
5976 inform (input_location
,
5977 " template parameter %qD is not a parameter pack, but "
5984 unify_ptrmem_cst_mismatch (bool explain_p
, tree parm
, tree arg
)
5987 inform (input_location
,
5988 " template argument %qE does not match "
5989 "pointer-to-member constant %qE",
5995 unify_expression_unequal (bool explain_p
, tree parm
, tree arg
)
5998 inform (input_location
, " %qE is not equivalent to %qE", parm
, arg
);
6003 unify_parameter_pack_inconsistent (bool explain_p
, tree old_arg
, tree new_arg
)
6006 inform (input_location
,
6007 " inconsistent parameter pack deduction with %qT and %qT",
6013 unify_inconsistency (bool explain_p
, tree parm
, tree first
, tree second
)
6018 inform (input_location
,
6019 " deduced conflicting types for parameter %qT (%qT and %qT)",
6020 parm
, first
, second
);
6022 inform (input_location
,
6023 " deduced conflicting values for non-type parameter "
6024 "%qE (%qE and %qE)", parm
, first
, second
);
6030 unify_vla_arg (bool explain_p
, tree arg
)
6033 inform (input_location
,
6034 " variable-sized array type %qT is not "
6035 "a valid template argument",
6041 unify_method_type_error (bool explain_p
, tree arg
)
6044 inform (input_location
,
6045 " member function type %qT is not a valid template argument",
6051 unify_arity (bool explain_p
, int have
, int wanted
, bool least_p
= false)
6056 inform_n (input_location
, wanted
,
6057 " candidate expects at least %d argument, %d provided",
6058 " candidate expects at least %d arguments, %d provided",
6061 inform_n (input_location
, wanted
,
6062 " candidate expects %d argument, %d provided",
6063 " candidate expects %d arguments, %d provided",
6070 unify_too_many_arguments (bool explain_p
, int have
, int wanted
)
6072 return unify_arity (explain_p
, have
, wanted
);
6076 unify_too_few_arguments (bool explain_p
, int have
, int wanted
,
6077 bool least_p
= false)
6079 return unify_arity (explain_p
, have
, wanted
, least_p
);
6083 unify_arg_conversion (bool explain_p
, tree to_type
,
6084 tree from_type
, tree arg
)
6087 inform (EXPR_LOC_OR_LOC (arg
, input_location
),
6088 " cannot convert %qE (type %qT) to type %qT",
6089 arg
, from_type
, to_type
);
6094 unify_no_common_base (bool explain_p
, enum template_base_result r
,
6095 tree parm
, tree arg
)
6100 case tbr_ambiguous_baseclass
:
6101 inform (input_location
, " %qT is an ambiguous base class of %qT",
6105 inform (input_location
, " %qT is not derived from %qT", arg
, parm
);
6112 unify_inconsistent_template_template_parameters (bool explain_p
)
6115 inform (input_location
,
6116 " template parameters of a template template argument are "
6117 "inconsistent with other deduced template arguments");
6122 unify_template_deduction_failure (bool explain_p
, tree parm
, tree arg
)
6125 inform (input_location
,
6126 " can't deduce a template for %qT from non-template type %qT",
6132 unify_template_argument_mismatch (bool explain_p
, tree parm
, tree arg
)
6135 inform (input_location
,
6136 " template argument %qE does not match %qD", arg
, parm
);
6141 unify_overload_resolution_failure (bool explain_p
, tree arg
)
6144 inform (input_location
,
6145 " could not resolve address from overloaded function %qE",
6150 /* Attempt to convert the non-type template parameter EXPR to the
6151 indicated TYPE. If the conversion is successful, return the
6152 converted value. If the conversion is unsuccessful, return
6153 NULL_TREE if we issued an error message, or error_mark_node if we
6154 did not. We issue error messages for out-and-out bad template
6155 parameters, but not simply because the conversion failed, since we
6156 might be just trying to do argument deduction. Both TYPE and EXPR
6157 must be non-dependent.
6159 The conversion follows the special rules described in
6160 [temp.arg.nontype], and it is much more strict than an implicit
6163 This function is called twice for each template argument (see
6164 lookup_template_class for a more accurate description of this
6165 problem). This means that we need to handle expressions which
6166 are not valid in a C++ source, but can be created from the
6167 first call (for instance, casts to perform conversions). These
6168 hacks can go away after we fix the double coercion problem. */
6171 convert_nontype_argument (tree type
, tree expr
, tsubst_flags_t complain
)
6175 /* Detect immediately string literals as invalid non-type argument.
6176 This special-case is not needed for correctness (we would easily
6177 catch this later), but only to provide better diagnostic for this
6178 common user mistake. As suggested by DR 100, we do not mention
6179 linkage issues in the diagnostic as this is not the point. */
6180 /* FIXME we're making this OK. */
6181 if (TREE_CODE (expr
) == STRING_CST
)
6183 if (complain
& tf_error
)
6184 error ("%qE is not a valid template argument for type %qT "
6185 "because string literals can never be used in this context",
6190 /* Add the ADDR_EXPR now for the benefit of
6191 value_dependent_expression_p. */
6192 if (TYPE_PTROBV_P (type
)
6193 && TREE_CODE (TREE_TYPE (expr
)) == ARRAY_TYPE
)
6195 expr
= decay_conversion (expr
, complain
);
6196 if (expr
== error_mark_node
)
6197 return error_mark_node
;
6200 /* If we are in a template, EXPR may be non-dependent, but still
6201 have a syntactic, rather than semantic, form. For example, EXPR
6202 might be a SCOPE_REF, rather than the VAR_DECL to which the
6203 SCOPE_REF refers. Preserving the qualifying scope is necessary
6204 so that access checking can be performed when the template is
6205 instantiated -- but here we need the resolved form so that we can
6206 convert the argument. */
6207 bool non_dep
= false;
6208 if (TYPE_REF_OBJ_P (type
)
6209 && has_value_dependent_address (expr
))
6210 /* If we want the address and it's value-dependent, don't fold. */;
6211 else if (!type_unknown_p (expr
)
6212 && processing_template_decl
6213 && !instantiation_dependent_expression_p (expr
)
6214 && potential_constant_expression (expr
))
6216 if (error_operand_p (expr
))
6217 return error_mark_node
;
6218 expr_type
= TREE_TYPE (expr
);
6219 if (TREE_CODE (type
) == REFERENCE_TYPE
)
6220 expr
= mark_lvalue_use (expr
);
6222 expr
= mark_rvalue_use (expr
);
6224 /* If the argument is non-dependent, perform any conversions in
6225 non-dependent context as well. */
6226 processing_template_decl_sentinel
s (non_dep
);
6228 expr
= instantiate_non_dependent_expr_internal (expr
, complain
);
6230 /* 14.3.2/5: The null pointer{,-to-member} conversion is applied
6231 to a non-type argument of "nullptr". */
6232 if (expr
== nullptr_node
&& TYPE_PTR_OR_PTRMEM_P (type
))
6233 expr
= convert (type
, expr
);
6235 /* In C++11, integral or enumeration non-type template arguments can be
6236 arbitrary constant expressions. Pointer and pointer to
6237 member arguments can be general constant expressions that evaluate
6238 to a null value, but otherwise still need to be of a specific form. */
6239 if (cxx_dialect
>= cxx11
)
6241 if (TREE_CODE (expr
) == PTRMEM_CST
)
6242 /* A PTRMEM_CST is already constant, and a valid template
6243 argument for a parameter of pointer to member type, we just want
6244 to leave it in that form rather than lower it to a
6246 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
6247 expr
= maybe_constant_value (expr
);
6248 else if (cxx_dialect
>= cxx1z
)
6250 if (TREE_CODE (type
) != REFERENCE_TYPE
)
6251 expr
= maybe_constant_value (expr
);
6252 else if (REFERENCE_REF_P (expr
))
6254 expr
= TREE_OPERAND (expr
, 0);
6255 expr
= maybe_constant_value (expr
);
6256 expr
= convert_from_reference (expr
);
6259 else if (TYPE_PTR_OR_PTRMEM_P (type
))
6261 tree folded
= maybe_constant_value (expr
);
6262 if (TYPE_PTR_P (type
) ? integer_zerop (folded
)
6263 : null_member_pointer_value_p (folded
))
6268 /* HACK: Due to double coercion, we can get a
6269 NOP_EXPR<REFERENCE_TYPE>(ADDR_EXPR<POINTER_TYPE> (arg)) here,
6270 which is the tree that we built on the first call (see
6271 below when coercing to reference to object or to reference to
6272 function). We just strip everything and get to the arg.
6273 See g++.old-deja/g++.oliva/template4.C and g++.dg/template/nontype9.C
6275 if (TYPE_REF_OBJ_P (type
) || TYPE_REFFN_P (type
))
6277 tree probe_type
, probe
= expr
;
6278 if (REFERENCE_REF_P (probe
))
6279 probe
= TREE_OPERAND (probe
, 0);
6280 probe_type
= TREE_TYPE (probe
);
6281 if (TREE_CODE (probe
) == NOP_EXPR
)
6283 /* ??? Maybe we could use convert_from_reference here, but we
6284 would need to relax its constraints because the NOP_EXPR
6285 could actually change the type to something more cv-qualified,
6286 and this is not folded by convert_from_reference. */
6287 tree addr
= TREE_OPERAND (probe
, 0);
6288 if (TREE_CODE (probe_type
) == REFERENCE_TYPE
6289 && TREE_CODE (addr
) == ADDR_EXPR
6290 && TYPE_PTR_P (TREE_TYPE (addr
))
6291 && (same_type_ignoring_top_level_qualifiers_p
6292 (TREE_TYPE (probe_type
),
6293 TREE_TYPE (TREE_TYPE (addr
)))))
6295 expr
= TREE_OPERAND (addr
, 0);
6296 expr_type
= TREE_TYPE (probe_type
);
6301 /* We could also generate a NOP_EXPR(ADDR_EXPR()) when the
6302 parameter is a pointer to object, through decay and
6303 qualification conversion. Let's strip everything. */
6304 else if (TREE_CODE (expr
) == NOP_EXPR
&& TYPE_PTROBV_P (type
))
6308 if (TREE_CODE (probe
) == ADDR_EXPR
6309 && TYPE_PTR_P (TREE_TYPE (probe
)))
6311 /* Skip the ADDR_EXPR only if it is part of the decay for
6312 an array. Otherwise, it is part of the original argument
6313 in the source code. */
6314 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (probe
, 0))) == ARRAY_TYPE
)
6315 probe
= TREE_OPERAND (probe
, 0);
6317 expr_type
= TREE_TYPE (expr
);
6321 /* [temp.arg.nontype]/5, bullet 1
6323 For a non-type template-parameter of integral or enumeration type,
6324 integral promotions (_conv.prom_) and integral conversions
6325 (_conv.integral_) are applied. */
6326 if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
6328 tree t
= build_integral_nontype_arg_conv (type
, expr
, complain
);
6329 t
= maybe_constant_value (t
);
6330 if (t
!= error_mark_node
)
6333 if (!same_type_ignoring_top_level_qualifiers_p (type
, TREE_TYPE (expr
)))
6334 return error_mark_node
;
6336 /* Notice that there are constant expressions like '4 % 0' which
6337 do not fold into integer constants. */
6338 if (TREE_CODE (expr
) != INTEGER_CST
)
6340 if (complain
& tf_error
)
6342 int errs
= errorcount
, warns
= warningcount
+ werrorcount
;
6343 if (processing_template_decl
6344 && !require_potential_constant_expression (expr
))
6346 expr
= cxx_constant_value (expr
);
6347 if (errorcount
> errs
|| warningcount
+ werrorcount
> warns
)
6348 inform (EXPR_LOC_OR_LOC (expr
, input_location
),
6349 "in template argument for type %qT ", type
);
6350 if (expr
== error_mark_node
)
6352 /* else cxx_constant_value complained but gave us
6353 a real constant, so go ahead. */
6354 gcc_assert (TREE_CODE (expr
) == INTEGER_CST
);
6360 /* Avoid typedef problems. */
6361 if (TREE_TYPE (expr
) != type
)
6362 expr
= fold_convert (type
, expr
);
6364 /* [temp.arg.nontype]/5, bullet 2
6366 For a non-type template-parameter of type pointer to object,
6367 qualification conversions (_conv.qual_) and the array-to-pointer
6368 conversion (_conv.array_) are applied. */
6369 else if (TYPE_PTROBV_P (type
))
6371 /* [temp.arg.nontype]/1 (TC1 version, DR 49):
6373 A template-argument for a non-type, non-template template-parameter
6374 shall be one of: [...]
6376 -- the name of a non-type template-parameter;
6377 -- the address of an object or function with external linkage, [...]
6378 expressed as "& id-expression" where the & is optional if the name
6379 refers to a function or array, or if the corresponding
6380 template-parameter is a reference.
6382 Here, we do not care about functions, as they are invalid anyway
6383 for a parameter of type pointer-to-object. */
6385 if (DECL_P (expr
) && DECL_TEMPLATE_PARM_P (expr
))
6386 /* Non-type template parameters are OK. */
6388 else if (cxx_dialect
>= cxx11
&& integer_zerop (expr
))
6389 /* Null pointer values are OK in C++11. */;
6390 else if (TREE_CODE (expr
) != ADDR_EXPR
6391 && TREE_CODE (expr_type
) != ARRAY_TYPE
)
6395 if (complain
& tf_error
)
6396 error ("%qD is not a valid template argument "
6397 "because %qD is a variable, not the address of "
6398 "a variable", expr
, expr
);
6401 if (POINTER_TYPE_P (expr_type
))
6403 if (complain
& tf_error
)
6404 error ("%qE is not a valid template argument for %qT "
6405 "because it is not the address of a variable",
6409 /* Other values, like integer constants, might be valid
6410 non-type arguments of some other type. */
6411 return error_mark_node
;
6417 decl
= ((TREE_CODE (expr
) == ADDR_EXPR
)
6418 ? TREE_OPERAND (expr
, 0) : expr
);
6421 if (complain
& tf_error
)
6422 error ("%qE is not a valid template argument of type %qT "
6423 "because %qE is not a variable", expr
, type
, decl
);
6426 else if (cxx_dialect
< cxx11
&& !DECL_EXTERNAL_LINKAGE_P (decl
))
6428 if (complain
& tf_error
)
6429 error ("%qE is not a valid template argument of type %qT "
6430 "because %qD does not have external linkage",
6434 else if (cxx_dialect
>= cxx11
&& decl_linkage (decl
) == lk_none
)
6436 if (complain
& tf_error
)
6437 error ("%qE is not a valid template argument of type %qT "
6438 "because %qD has no linkage", expr
, type
, decl
);
6443 expr
= decay_conversion (expr
, complain
);
6444 if (expr
== error_mark_node
)
6445 return error_mark_node
;
6447 expr
= perform_qualification_conversions (type
, expr
);
6448 if (expr
== error_mark_node
)
6449 return error_mark_node
;
6451 /* [temp.arg.nontype]/5, bullet 3
6453 For a non-type template-parameter of type reference to object, no
6454 conversions apply. The type referred to by the reference may be more
6455 cv-qualified than the (otherwise identical) type of the
6456 template-argument. The template-parameter is bound directly to the
6457 template-argument, which must be an lvalue. */
6458 else if (TYPE_REF_OBJ_P (type
))
6460 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type
),
6462 return error_mark_node
;
6464 if (!at_least_as_qualified_p (TREE_TYPE (type
), expr_type
))
6466 if (complain
& tf_error
)
6467 error ("%qE is not a valid template argument for type %qT "
6468 "because of conflicts in cv-qualification", expr
, type
);
6472 if (!real_lvalue_p (expr
))
6474 if (complain
& tf_error
)
6475 error ("%qE is not a valid template argument for type %qT "
6476 "because it is not an lvalue", expr
, type
);
6480 /* [temp.arg.nontype]/1
6482 A template-argument for a non-type, non-template template-parameter
6483 shall be one of: [...]
6485 -- the address of an object or function with external linkage. */
6486 if (INDIRECT_REF_P (expr
)
6487 && TYPE_REF_OBJ_P (TREE_TYPE (TREE_OPERAND (expr
, 0))))
6489 expr
= TREE_OPERAND (expr
, 0);
6492 if (complain
& tf_error
)
6493 error ("%q#D is not a valid template argument for type %qT "
6494 "because a reference variable does not have a constant "
6495 "address", expr
, type
);
6502 if (complain
& tf_error
)
6503 error ("%qE is not a valid template argument for type %qT "
6504 "because it is not an object with linkage",
6509 /* DR 1155 allows internal linkage in C++11 and up. */
6510 linkage_kind linkage
= decl_linkage (expr
);
6511 if (linkage
< (cxx_dialect
>= cxx11
? lk_internal
: lk_external
))
6513 if (complain
& tf_error
)
6514 error ("%qE is not a valid template argument for type %qT "
6515 "because object %qD does not have linkage",
6520 expr
= build_nop (type
, build_address (expr
));
6522 /* [temp.arg.nontype]/5, bullet 4
6524 For a non-type template-parameter of type pointer to function, only
6525 the function-to-pointer conversion (_conv.func_) is applied. If the
6526 template-argument represents a set of overloaded functions (or a
6527 pointer to such), the matching function is selected from the set
6529 else if (TYPE_PTRFN_P (type
))
6531 /* If the argument is a template-id, we might not have enough
6532 context information to decay the pointer. */
6533 if (!type_unknown_p (expr_type
))
6535 expr
= decay_conversion (expr
, complain
);
6536 if (expr
== error_mark_node
)
6537 return error_mark_node
;
6540 if (cxx_dialect
>= cxx11
&& integer_zerop (expr
))
6541 /* Null pointer values are OK in C++11. */
6542 return perform_qualification_conversions (type
, expr
);
6544 expr
= convert_nontype_argument_function (type
, expr
, complain
);
6545 if (!expr
|| expr
== error_mark_node
)
6548 /* [temp.arg.nontype]/5, bullet 5
6550 For a non-type template-parameter of type reference to function, no
6551 conversions apply. If the template-argument represents a set of
6552 overloaded functions, the matching function is selected from the set
6554 else if (TYPE_REFFN_P (type
))
6556 if (TREE_CODE (expr
) == ADDR_EXPR
)
6558 if (complain
& tf_error
)
6560 error ("%qE is not a valid template argument for type %qT "
6561 "because it is a pointer", expr
, type
);
6562 inform (input_location
, "try using %qE instead",
6563 TREE_OPERAND (expr
, 0));
6568 expr
= convert_nontype_argument_function (type
, expr
, complain
);
6569 if (!expr
|| expr
== error_mark_node
)
6572 expr
= build_nop (type
, build_address (expr
));
6574 /* [temp.arg.nontype]/5, bullet 6
6576 For a non-type template-parameter of type pointer to member function,
6577 no conversions apply. If the template-argument represents a set of
6578 overloaded member functions, the matching member function is selected
6579 from the set (_over.over_). */
6580 else if (TYPE_PTRMEMFUNC_P (type
))
6582 expr
= instantiate_type (type
, expr
, tf_none
);
6583 if (expr
== error_mark_node
)
6584 return error_mark_node
;
6586 /* [temp.arg.nontype] bullet 1 says the pointer to member
6587 expression must be a pointer-to-member constant. */
6588 if (!check_valid_ptrmem_cst_expr (type
, expr
, complain
))
6589 return error_mark_node
;
6591 /* There is no way to disable standard conversions in
6592 resolve_address_of_overloaded_function (called by
6593 instantiate_type). It is possible that the call succeeded by
6594 converting &B::I to &D::I (where B is a base of D), so we need
6595 to reject this conversion here.
6597 Actually, even if there was a way to disable standard conversions,
6598 it would still be better to reject them here so that we can
6599 provide a superior diagnostic. */
6600 if (!same_type_p (TREE_TYPE (expr
), type
))
6602 if (complain
& tf_error
)
6604 error ("%qE is not a valid template argument for type %qT "
6605 "because it is of type %qT", expr
, type
,
6607 /* If we are just one standard conversion off, explain. */
6608 if (can_convert_standard (type
, TREE_TYPE (expr
), complain
))
6609 inform (input_location
,
6610 "standard conversions are not allowed in this context");
6615 /* [temp.arg.nontype]/5, bullet 7
6617 For a non-type template-parameter of type pointer to data member,
6618 qualification conversions (_conv.qual_) are applied. */
6619 else if (TYPE_PTRDATAMEM_P (type
))
6621 /* [temp.arg.nontype] bullet 1 says the pointer to member
6622 expression must be a pointer-to-member constant. */
6623 if (!check_valid_ptrmem_cst_expr (type
, expr
, complain
))
6624 return error_mark_node
;
6626 expr
= perform_qualification_conversions (type
, expr
);
6627 if (expr
== error_mark_node
)
6630 else if (NULLPTR_TYPE_P (type
))
6632 if (expr
!= nullptr_node
)
6634 if (complain
& tf_error
)
6635 error ("%qE is not a valid template argument for type %qT "
6636 "because it is of type %qT", expr
, type
, TREE_TYPE (expr
));
6641 /* A template non-type parameter must be one of the above. */
6645 /* Sanity check: did we actually convert the argument to the
6647 gcc_assert (same_type_ignoring_top_level_qualifiers_p
6648 (type
, TREE_TYPE (expr
)));
6649 return convert_from_reference (expr
);
6652 /* Subroutine of coerce_template_template_parms, which returns 1 if
6653 PARM_PARM and ARG_PARM match using the rule for the template
6654 parameters of template template parameters. Both PARM and ARG are
6655 template parameters; the rest of the arguments are the same as for
6656 coerce_template_template_parms.
6659 coerce_template_template_parm (tree parm
,
6661 tsubst_flags_t complain
,
6665 if (arg
== NULL_TREE
|| error_operand_p (arg
)
6666 || parm
== NULL_TREE
|| error_operand_p (parm
))
6669 if (TREE_CODE (arg
) != TREE_CODE (parm
))
6672 switch (TREE_CODE (parm
))
6675 /* We encounter instantiations of templates like
6676 template <template <template <class> class> class TT>
6679 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
6680 tree argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
6682 if (!coerce_template_template_parms
6683 (parmparm
, argparm
, complain
, in_decl
, outer_args
))
6689 if (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (arg
))
6690 && !TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
)))
6691 /* Argument is a parameter pack but parameter is not. */
6696 /* The tsubst call is used to handle cases such as
6698 template <int> class C {};
6699 template <class T, template <T> class TT> class D {};
6702 i.e. the parameter list of TT depends on earlier parameters. */
6703 if (!uses_template_parms (TREE_TYPE (arg
)))
6705 tree t
= tsubst (TREE_TYPE (parm
), outer_args
, complain
, in_decl
);
6706 if (!uses_template_parms (t
)
6707 && !same_type_p (t
, TREE_TYPE (arg
)))
6711 if (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (arg
))
6712 && !TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))
6713 /* Argument is a parameter pack but parameter is not. */
6726 /* Return 1 if PARM_PARMS and ARG_PARMS matches using rule for
6727 template template parameters. Both PARM_PARMS and ARG_PARMS are
6728 vectors of TREE_LIST nodes containing TYPE_DECL, TEMPLATE_DECL
6731 Consider the example:
6732 template <class T> class A;
6733 template<template <class U> class TT> class B;
6735 For B<A>, PARM_PARMS are the parameters to TT, while ARG_PARMS are
6736 the parameters to A, and OUTER_ARGS contains A. */
6739 coerce_template_template_parms (tree parm_parms
,
6741 tsubst_flags_t complain
,
6745 int nparms
, nargs
, i
;
6749 gcc_assert (TREE_CODE (parm_parms
) == TREE_VEC
);
6750 gcc_assert (TREE_CODE (arg_parms
) == TREE_VEC
);
6752 nparms
= TREE_VEC_LENGTH (parm_parms
);
6753 nargs
= TREE_VEC_LENGTH (arg_parms
);
6755 /* Determine whether we have a parameter pack at the end of the
6756 template template parameter's template parameter list. */
6757 if (TREE_VEC_ELT (parm_parms
, nparms
- 1) != error_mark_node
)
6759 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, nparms
- 1));
6761 if (error_operand_p (parm
))
6764 switch (TREE_CODE (parm
))
6768 if (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
)))
6773 if (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))
6783 && !(variadic_p
&& nargs
>= nparms
- 1))
6786 /* Check all of the template parameters except the parameter pack at
6787 the end (if any). */
6788 for (i
= 0; i
< nparms
- variadic_p
; ++i
)
6790 if (TREE_VEC_ELT (parm_parms
, i
) == error_mark_node
6791 || TREE_VEC_ELT (arg_parms
, i
) == error_mark_node
)
6794 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
6795 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
6797 if (!coerce_template_template_parm (parm
, arg
, complain
, in_decl
,
6805 /* Check each of the template parameters in the template
6806 argument against the template parameter pack at the end of
6807 the template template parameter. */
6808 if (TREE_VEC_ELT (parm_parms
, i
) == error_mark_node
)
6811 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
6813 for (; i
< nargs
; ++i
)
6815 if (TREE_VEC_ELT (arg_parms
, i
) == error_mark_node
)
6818 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
6820 if (!coerce_template_template_parm (parm
, arg
, complain
, in_decl
,
6829 /* Verifies that the deduced template arguments (in TARGS) for the
6830 template template parameters (in TPARMS) represent valid bindings,
6831 by comparing the template parameter list of each template argument
6832 to the template parameter list of its corresponding template
6833 template parameter, in accordance with DR150. This
6834 routine can only be called after all template arguments have been
6835 deduced. It will return TRUE if all of the template template
6836 parameter bindings are okay, FALSE otherwise. */
6838 template_template_parm_bindings_ok_p (tree tparms
, tree targs
)
6840 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
6843 /* We're dealing with template parms in this process. */
6844 ++processing_template_decl
;
6846 targs
= INNERMOST_TEMPLATE_ARGS (targs
);
6848 for (i
= 0; i
< ntparms
; ++i
)
6850 tree tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
6851 tree targ
= TREE_VEC_ELT (targs
, i
);
6853 if (TREE_CODE (tparm
) == TEMPLATE_DECL
&& targ
)
6855 tree packed_args
= NULL_TREE
;
6858 if (ARGUMENT_PACK_P (targ
))
6860 /* Look inside the argument pack. */
6861 packed_args
= ARGUMENT_PACK_ARGS (targ
);
6862 len
= TREE_VEC_LENGTH (packed_args
);
6865 for (idx
= 0; idx
< len
; ++idx
)
6867 tree targ_parms
= NULL_TREE
;
6870 /* Extract the next argument from the argument
6872 targ
= TREE_VEC_ELT (packed_args
, idx
);
6874 if (PACK_EXPANSION_P (targ
))
6875 /* Look at the pattern of the pack expansion. */
6876 targ
= PACK_EXPANSION_PATTERN (targ
);
6878 /* Extract the template parameters from the template
6880 if (TREE_CODE (targ
) == TEMPLATE_DECL
)
6881 targ_parms
= DECL_INNERMOST_TEMPLATE_PARMS (targ
);
6882 else if (TREE_CODE (targ
) == TEMPLATE_TEMPLATE_PARM
)
6883 targ_parms
= DECL_INNERMOST_TEMPLATE_PARMS (TYPE_NAME (targ
));
6885 /* Verify that we can coerce the template template
6886 parameters from the template argument to the template
6887 parameter. This requires an exact match. */
6889 && !coerce_template_template_parms
6890 (DECL_INNERMOST_TEMPLATE_PARMS (tparm
),
6905 --processing_template_decl
;
6909 /* Since type attributes aren't mangled, we need to strip them from
6910 template type arguments. */
6913 canonicalize_type_argument (tree arg
, tsubst_flags_t complain
)
6915 if (!arg
|| arg
== error_mark_node
|| arg
== TYPE_CANONICAL (arg
))
6917 bool removed_attributes
= false;
6918 tree canon
= strip_typedefs (arg
, &removed_attributes
);
6919 if (removed_attributes
6920 && (complain
& tf_warning
))
6921 warning (0, "ignoring attributes on template argument %qT", arg
);
6925 // A template declaration can be substituted for a constrained
6926 // template template parameter only when the argument is more
6927 // constrained than the parameter.
6929 is_compatible_template_arg (tree parm
, tree arg
)
6931 tree parm_cons
= get_constraints (parm
);
6933 /* For now, allow constrained template template arguments
6934 and unconstrained template template parameters. */
6935 if (parm_cons
== NULL_TREE
)
6938 tree arg_cons
= get_constraints (arg
);
6940 // If the template parameter is constrained, we need to rewrite its
6941 // constraints in terms of the ARG's template parameters. This ensures
6942 // that all of the template parameter types will have the same depth.
6944 // Note that this is only valid when coerce_template_template_parm is
6945 // true for the innermost template parameters of PARM and ARG. In other
6946 // words, because coercion is successful, this conversion will be valid.
6949 tree args
= template_parms_to_args (DECL_TEMPLATE_PARMS (arg
));
6950 parm_cons
= tsubst_constraint_info (parm_cons
,
6951 INNERMOST_TEMPLATE_ARGS (args
),
6952 tf_none
, NULL_TREE
);
6953 if (parm_cons
== error_mark_node
)
6957 return subsumes (parm_cons
, arg_cons
);
6960 // Convert a placeholder argument into a binding to the original
6961 // parameter. The original parameter is saved as the TREE_TYPE of
6964 convert_wildcard_argument (tree parm
, tree arg
)
6966 TREE_TYPE (arg
) = parm
;
6970 /* Convert the indicated template ARG as necessary to match the
6971 indicated template PARM. Returns the converted ARG, or
6972 error_mark_node if the conversion was unsuccessful. Error and
6973 warning messages are issued under control of COMPLAIN. This
6974 conversion is for the Ith parameter in the parameter list. ARGS is
6975 the full set of template arguments deduced so far. */
6978 convert_template_argument (tree parm
,
6981 tsubst_flags_t complain
,
6987 int is_type
, requires_type
, is_tmpl_type
, requires_tmpl_type
;
6989 if (parm
== error_mark_node
)
6990 return error_mark_node
;
6992 /* Trivially convert placeholders. */
6993 if (TREE_CODE (arg
) == WILDCARD_DECL
)
6994 return convert_wildcard_argument (parm
, arg
);
6996 if (TREE_CODE (arg
) == TREE_LIST
6997 && TREE_CODE (TREE_VALUE (arg
)) == OFFSET_REF
)
6999 /* The template argument was the name of some
7000 member function. That's usually
7001 invalid, but static members are OK. In any
7002 case, grab the underlying fields/functions
7003 and issue an error later if required. */
7004 orig_arg
= TREE_VALUE (arg
);
7005 TREE_TYPE (arg
) = unknown_type_node
;
7010 requires_tmpl_type
= TREE_CODE (parm
) == TEMPLATE_DECL
;
7011 requires_type
= (TREE_CODE (parm
) == TYPE_DECL
7012 || requires_tmpl_type
);
7014 /* When determining whether an argument pack expansion is a template,
7015 look at the pattern. */
7016 if (TREE_CODE (arg
) == TYPE_PACK_EXPANSION
)
7017 arg
= PACK_EXPANSION_PATTERN (arg
);
7019 /* Deal with an injected-class-name used as a template template arg. */
7020 if (requires_tmpl_type
&& CLASS_TYPE_P (arg
))
7022 tree t
= maybe_get_template_decl_from_type_decl (TYPE_NAME (arg
));
7023 if (TREE_CODE (t
) == TEMPLATE_DECL
)
7025 if (cxx_dialect
>= cxx11
)
7026 /* OK under DR 1004. */;
7027 else if (complain
& tf_warning_or_error
)
7028 pedwarn (input_location
, OPT_Wpedantic
, "injected-class-name %qD"
7029 " used as template template argument", TYPE_NAME (arg
));
7030 else if (flag_pedantic_errors
)
7038 ((TREE_CODE (arg
) == TEMPLATE_DECL
7039 && TREE_CODE (DECL_TEMPLATE_RESULT (arg
)) == TYPE_DECL
)
7040 || (requires_tmpl_type
&& TREE_CODE (arg
) == TYPE_ARGUMENT_PACK
)
7041 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
7042 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
);
7045 && (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
7046 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
))
7047 arg
= TYPE_STUB_DECL (arg
);
7049 is_type
= TYPE_P (arg
) || is_tmpl_type
;
7051 if (requires_type
&& ! is_type
&& TREE_CODE (arg
) == SCOPE_REF
7052 && TREE_CODE (TREE_OPERAND (arg
, 0)) == TEMPLATE_TYPE_PARM
)
7054 if (TREE_CODE (TREE_OPERAND (arg
, 1)) == BIT_NOT_EXPR
)
7056 if (complain
& tf_error
)
7057 error ("invalid use of destructor %qE as a type", orig_arg
);
7058 return error_mark_node
;
7061 permerror (input_location
,
7062 "to refer to a type member of a template parameter, "
7063 "use %<typename %E%>", orig_arg
);
7065 orig_arg
= make_typename_type (TREE_OPERAND (arg
, 0),
7066 TREE_OPERAND (arg
, 1),
7072 if (is_type
!= requires_type
)
7076 if (complain
& tf_error
)
7078 error ("type/value mismatch at argument %d in template "
7079 "parameter list for %qD",
7082 inform (input_location
,
7083 " expected a constant of type %qT, got %qT",
7085 (DECL_P (arg
) ? DECL_NAME (arg
) : orig_arg
));
7086 else if (requires_tmpl_type
)
7087 inform (input_location
,
7088 " expected a class template, got %qE", orig_arg
);
7090 inform (input_location
,
7091 " expected a type, got %qE", orig_arg
);
7094 return error_mark_node
;
7096 if (is_tmpl_type
^ requires_tmpl_type
)
7098 if (in_decl
&& (complain
& tf_error
))
7100 error ("type/value mismatch at argument %d in template "
7101 "parameter list for %qD",
7104 inform (input_location
,
7105 " expected a type, got %qT", DECL_NAME (arg
));
7107 inform (input_location
,
7108 " expected a class template, got %qT", orig_arg
);
7110 return error_mark_node
;
7115 if (requires_tmpl_type
)
7117 if (template_parameter_pack_p (parm
) && ARGUMENT_PACK_P (orig_arg
))
7119 else if (TREE_CODE (TREE_TYPE (arg
)) == UNBOUND_CLASS_TEMPLATE
)
7120 /* The number of argument required is not known yet.
7121 Just accept it for now. */
7122 val
= TREE_TYPE (arg
);
7125 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
7128 /* Strip alias templates that are equivalent to another
7130 arg
= get_underlying_template (arg
);
7131 argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
7133 if (coerce_template_template_parms (parmparm
, argparm
,
7139 /* TEMPLATE_TEMPLATE_PARM node is preferred over
7141 if (val
!= error_mark_node
)
7143 if (DECL_TEMPLATE_TEMPLATE_PARM_P (val
))
7144 val
= TREE_TYPE (val
);
7145 if (TREE_CODE (orig_arg
) == TYPE_PACK_EXPANSION
)
7146 val
= make_pack_expansion (val
);
7151 if (in_decl
&& (complain
& tf_error
))
7153 error ("type/value mismatch at argument %d in "
7154 "template parameter list for %qD",
7156 inform (input_location
,
7157 " expected a template of type %qD, got %qT",
7161 val
= error_mark_node
;
7164 // Check that the constraints are compatible before allowing the
7166 if (val
!= error_mark_node
)
7167 if (!is_compatible_template_arg (parm
, arg
))
7169 if (in_decl
&& (complain
& tf_error
))
7171 error ("constraint mismatch at argument %d in "
7172 "template parameter list for %qD",
7174 inform (input_location
, " expected %qD but got %qD",
7177 val
= error_mark_node
;
7183 /* We only form one instance of each template specialization.
7184 Therefore, if we use a non-canonical variant (i.e., a
7185 typedef), any future messages referring to the type will use
7186 the typedef, which is confusing if those future uses do not
7187 themselves also use the typedef. */
7189 val
= canonicalize_type_argument (val
, complain
);
7193 tree t
= tsubst (TREE_TYPE (parm
), args
, complain
, in_decl
);
7195 if (invalid_nontype_parm_type_p (t
, complain
))
7196 return error_mark_node
;
7198 if (template_parameter_pack_p (parm
) && ARGUMENT_PACK_P (orig_arg
))
7200 if (same_type_p (t
, TREE_TYPE (orig_arg
)))
7204 /* Not sure if this is reachable, but it doesn't hurt
7206 error ("type mismatch in nontype parameter pack");
7207 val
= error_mark_node
;
7210 else if (!dependent_template_arg_p (orig_arg
)
7211 && !uses_template_parms (t
))
7212 /* We used to call digest_init here. However, digest_init
7213 will report errors, which we don't want when complain
7214 is zero. More importantly, digest_init will try too
7215 hard to convert things: for example, `0' should not be
7216 converted to pointer type at this point according to
7217 the standard. Accepting this is not merely an
7218 extension, since deciding whether or not these
7219 conversions can occur is part of determining which
7220 function template to call, or whether a given explicit
7221 argument specification is valid. */
7222 val
= convert_nontype_argument (t
, orig_arg
, complain
);
7225 bool removed_attr
= false;
7226 val
= strip_typedefs_expr (orig_arg
, &removed_attr
);
7229 if (val
== NULL_TREE
)
7230 val
= error_mark_node
;
7231 else if (val
== error_mark_node
&& (complain
& tf_error
))
7232 error ("could not convert template argument %qE to %qT", orig_arg
, t
);
7234 if (INDIRECT_REF_P (val
))
7236 /* Reject template arguments that are references to built-in
7237 functions with no library fallbacks. */
7238 const_tree inner
= TREE_OPERAND (val
, 0);
7239 if (TREE_CODE (TREE_TYPE (inner
)) == REFERENCE_TYPE
7240 && TREE_CODE (TREE_TYPE (TREE_TYPE (inner
))) == FUNCTION_TYPE
7241 && TREE_CODE (TREE_TYPE (inner
)) == REFERENCE_TYPE
7242 && reject_gcc_builtin (TREE_OPERAND (inner
, 0)))
7243 return error_mark_node
;
7246 if (TREE_CODE (val
) == SCOPE_REF
)
7248 /* Strip typedefs from the SCOPE_REF. */
7249 tree type
= canonicalize_type_argument (TREE_TYPE (val
), complain
);
7250 tree scope
= canonicalize_type_argument (TREE_OPERAND (val
, 0),
7252 val
= build_qualified_name (type
, scope
, TREE_OPERAND (val
, 1),
7253 QUALIFIED_NAME_IS_TEMPLATE (val
));
7260 /* Coerces the remaining template arguments in INNER_ARGS (from
7261 ARG_IDX to the end) into the parameter pack at PARM_IDX in PARMS.
7262 Returns the coerced argument pack. PARM_IDX is the position of this
7263 parameter in the template parameter list. ARGS is the original
7264 template argument list. */
7266 coerce_template_parameter_pack (tree parms
,
7274 tsubst_flags_t complain
)
7276 tree parm
= TREE_VEC_ELT (parms
, parm_idx
);
7277 int nargs
= inner_args
? NUM_TMPL_ARGS (inner_args
) : 0;
7280 tree packed_parms
= NULL_TREE
;
7282 if (arg_idx
> nargs
)
7285 if (tree packs
= fixed_parameter_pack_p (TREE_VALUE (parm
)))
7287 /* When the template parameter is a non-type template parameter pack
7288 or template template parameter pack whose type or template
7289 parameters use parameter packs, we know exactly how many arguments
7290 we are looking for. Build a vector of the instantiated decls for
7291 these template parameters in PACKED_PARMS. */
7292 /* We can't use make_pack_expansion here because it would interpret a
7293 _DECL as a use rather than a declaration. */
7294 tree decl
= TREE_VALUE (parm
);
7295 tree exp
= cxx_make_type (TYPE_PACK_EXPANSION
);
7296 SET_PACK_EXPANSION_PATTERN (exp
, decl
);
7297 PACK_EXPANSION_PARAMETER_PACKS (exp
) = packs
;
7298 SET_TYPE_STRUCTURAL_EQUALITY (exp
);
7300 TREE_VEC_LENGTH (args
)--;
7301 packed_parms
= tsubst_pack_expansion (exp
, args
, complain
, decl
);
7302 TREE_VEC_LENGTH (args
)++;
7304 if (packed_parms
== error_mark_node
)
7305 return error_mark_node
;
7307 /* If we're doing a partial instantiation of a member template,
7308 verify that all of the types used for the non-type
7309 template parameter pack are, in fact, valid for non-type
7310 template parameters. */
7312 && PACK_EXPANSION_P (TREE_VEC_ELT (inner_args
, arg_idx
)))
7314 int j
, len
= TREE_VEC_LENGTH (packed_parms
);
7315 for (j
= 0; j
< len
; ++j
)
7317 tree t
= TREE_TYPE (TREE_VEC_ELT (packed_parms
, j
));
7318 if (invalid_nontype_parm_type_p (t
, complain
))
7319 return error_mark_node
;
7321 /* We don't know how many args we have yet, just
7322 use the unconverted ones for now. */
7326 packed_args
= make_tree_vec (TREE_VEC_LENGTH (packed_parms
));
7328 /* Check if we have a placeholder pack, which indicates we're
7329 in the context of a introduction list. In that case we want
7330 to match this pack to the single placeholder. */
7331 else if (arg_idx
< nargs
7332 && TREE_CODE (TREE_VEC_ELT (inner_args
, arg_idx
)) == WILDCARD_DECL
7333 && WILDCARD_PACK_P (TREE_VEC_ELT (inner_args
, arg_idx
)))
7335 nargs
= arg_idx
+ 1;
7336 packed_args
= make_tree_vec (1);
7339 packed_args
= make_tree_vec (nargs
- arg_idx
);
7341 /* Convert the remaining arguments, which will be a part of the
7342 parameter pack "parm". */
7343 for (; arg_idx
< nargs
; ++arg_idx
)
7345 tree arg
= TREE_VEC_ELT (inner_args
, arg_idx
);
7346 tree actual_parm
= TREE_VALUE (parm
);
7347 int pack_idx
= arg_idx
- parm_idx
;
7351 /* Once we've packed as many args as we have types, stop. */
7352 if (pack_idx
>= TREE_VEC_LENGTH (packed_parms
))
7354 else if (PACK_EXPANSION_P (arg
))
7355 /* We don't know how many args we have yet, just
7356 use the unconverted ones for now. */
7359 actual_parm
= TREE_VEC_ELT (packed_parms
, pack_idx
);
7362 if (arg
== error_mark_node
)
7364 if (complain
& tf_error
)
7365 error ("template argument %d is invalid", arg_idx
+ 1);
7368 arg
= convert_template_argument (actual_parm
,
7369 arg
, new_args
, complain
, parm_idx
,
7371 if (arg
== error_mark_node
)
7373 TREE_VEC_ELT (packed_args
, pack_idx
) = arg
;
7376 if (arg_idx
- parm_idx
< TREE_VEC_LENGTH (packed_args
)
7377 && TREE_VEC_LENGTH (packed_args
) > 0)
7379 if (complain
& tf_error
)
7380 error ("wrong number of template arguments (%d, should be %d)",
7381 arg_idx
- parm_idx
, TREE_VEC_LENGTH (packed_args
));
7382 return error_mark_node
;
7385 if (TREE_CODE (TREE_VALUE (parm
)) == TYPE_DECL
7386 || TREE_CODE (TREE_VALUE (parm
)) == TEMPLATE_DECL
)
7387 argument_pack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
7390 argument_pack
= make_node (NONTYPE_ARGUMENT_PACK
);
7391 TREE_TYPE (argument_pack
)
7392 = tsubst (TREE_TYPE (TREE_VALUE (parm
)), new_args
, complain
, in_decl
);
7393 TREE_CONSTANT (argument_pack
) = 1;
7396 SET_ARGUMENT_PACK_ARGS (argument_pack
, packed_args
);
7398 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (packed_args
,
7399 TREE_VEC_LENGTH (packed_args
));
7400 return argument_pack
;
7403 /* Returns the number of pack expansions in the template argument vector
7407 pack_expansion_args_count (tree args
)
7412 for (i
= 0; i
< TREE_VEC_LENGTH (args
); ++i
)
7414 tree elt
= TREE_VEC_ELT (args
, i
);
7415 if (elt
&& PACK_EXPANSION_P (elt
))
7421 /* Convert all template arguments to their appropriate types, and
7422 return a vector containing the innermost resulting template
7423 arguments. If any error occurs, return error_mark_node. Error and
7424 warning messages are issued under control of COMPLAIN.
7426 If REQUIRE_ALL_ARGS is false, argument deduction will be performed
7427 for arguments not specified in ARGS. Otherwise, if
7428 USE_DEFAULT_ARGS is true, default arguments will be used to fill in
7429 unspecified arguments. If REQUIRE_ALL_ARGS is true, but
7430 USE_DEFAULT_ARGS is false, then all arguments must be specified in
7434 coerce_template_parms (tree parms
,
7437 tsubst_flags_t complain
,
7438 bool require_all_args
,
7439 bool use_default_args
)
7441 int nparms
, nargs
, parm_idx
, arg_idx
, lost
= 0;
7442 tree orig_inner_args
;
7445 tree new_inner_args
;
7446 int saved_unevaluated_operand
;
7447 int saved_inhibit_evaluation_warnings
;
7449 /* When used as a boolean value, indicates whether this is a
7450 variadic template parameter list. Since it's an int, we can also
7451 subtract it from nparms to get the number of non-variadic
7454 int variadic_args_p
= 0;
7455 int post_variadic_parms
= 0;
7457 /* Likewise for parameters with default arguments. */
7460 if (args
== error_mark_node
)
7461 return error_mark_node
;
7463 nparms
= TREE_VEC_LENGTH (parms
);
7465 /* Determine if there are any parameter packs or default arguments. */
7466 for (parm_idx
= 0; parm_idx
< nparms
; ++parm_idx
)
7468 tree parm
= TREE_VEC_ELT (parms
, parm_idx
);
7470 ++post_variadic_parms
;
7471 if (template_parameter_pack_p (TREE_VALUE (parm
)))
7473 if (TREE_PURPOSE (parm
))
7477 inner_args
= orig_inner_args
= INNERMOST_TEMPLATE_ARGS (args
);
7478 /* If there are no parameters that follow a parameter pack, we need to
7479 expand any argument packs so that we can deduce a parameter pack from
7480 some non-packed args followed by an argument pack, as in variadic85.C.
7481 If there are such parameters, we need to leave argument packs intact
7482 so the arguments are assigned properly. This can happen when dealing
7483 with a nested class inside a partial specialization of a class
7484 template, as in variadic92.C, or when deducing a template parameter pack
7485 from a sub-declarator, as in variadic114.C. */
7486 if (!post_variadic_parms
)
7487 inner_args
= expand_template_argument_pack (inner_args
);
7489 /* Count any pack expansion args. */
7490 variadic_args_p
= pack_expansion_args_count (inner_args
);
7492 nargs
= inner_args
? NUM_TMPL_ARGS (inner_args
) : 0;
7493 if ((nargs
> nparms
&& !variadic_p
)
7494 || (nargs
< nparms
- variadic_p
7497 && (!use_default_args
7498 || (TREE_VEC_ELT (parms
, nargs
) != error_mark_node
7499 && !TREE_PURPOSE (TREE_VEC_ELT (parms
, nargs
))))))
7501 if (complain
& tf_error
)
7503 if (variadic_p
|| default_p
)
7505 nparms
-= variadic_p
+ default_p
;
7506 error ("wrong number of template arguments "
7507 "(%d, should be at least %d)", nargs
, nparms
);
7510 error ("wrong number of template arguments "
7511 "(%d, should be %d)", nargs
, nparms
);
7514 inform (DECL_SOURCE_LOCATION (in_decl
),
7515 "provided for %qD", in_decl
);
7518 return error_mark_node
;
7520 /* We can't pass a pack expansion to a non-pack parameter of an alias
7521 template (DR 1430). */
7523 && (DECL_ALIAS_TEMPLATE_P (in_decl
)
7524 || concept_template_p (in_decl
))
7526 && nargs
- variadic_args_p
< nparms
- variadic_p
)
7528 if (complain
& tf_error
)
7530 for (int i
= 0; i
< TREE_VEC_LENGTH (inner_args
); ++i
)
7532 tree arg
= TREE_VEC_ELT (inner_args
, i
);
7533 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
7535 if (PACK_EXPANSION_P (arg
)
7536 && !template_parameter_pack_p (parm
))
7538 if (DECL_ALIAS_TEMPLATE_P (in_decl
))
7539 error_at (location_of (arg
),
7540 "pack expansion argument for non-pack parameter "
7541 "%qD of alias template %qD", parm
, in_decl
);
7543 error_at (location_of (arg
),
7544 "pack expansion argument for non-pack parameter "
7545 "%qD of concept %qD", parm
, in_decl
);
7546 inform (DECL_SOURCE_LOCATION (parm
), "declared here");
7553 return error_mark_node
;
7556 /* We need to evaluate the template arguments, even though this
7557 template-id may be nested within a "sizeof". */
7558 saved_unevaluated_operand
= cp_unevaluated_operand
;
7559 cp_unevaluated_operand
= 0;
7560 saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
7561 c_inhibit_evaluation_warnings
= 0;
7562 new_inner_args
= make_tree_vec (nparms
);
7563 new_args
= add_outermost_template_args (args
, new_inner_args
);
7564 int pack_adjust
= 0;
7565 for (parm_idx
= 0, arg_idx
= 0; parm_idx
< nparms
; parm_idx
++, arg_idx
++)
7570 /* Get the Ith template parameter. */
7571 parm
= TREE_VEC_ELT (parms
, parm_idx
);
7573 if (parm
== error_mark_node
)
7575 TREE_VEC_ELT (new_inner_args
, arg_idx
) = error_mark_node
;
7579 /* Calculate the next argument. */
7580 if (arg_idx
< nargs
)
7581 arg
= TREE_VEC_ELT (inner_args
, arg_idx
);
7585 if (template_parameter_pack_p (TREE_VALUE (parm
))
7586 && !(arg
&& ARGUMENT_PACK_P (arg
)))
7588 /* Some arguments will be placed in the
7589 template parameter pack PARM. */
7590 arg
= coerce_template_parameter_pack (parms
, parm_idx
, args
,
7591 inner_args
, arg_idx
,
7595 if (arg
== NULL_TREE
)
7597 /* We don't know how many args we have yet, just use the
7598 unconverted (and still packed) ones for now. */
7599 new_inner_args
= orig_inner_args
;
7604 TREE_VEC_ELT (new_inner_args
, parm_idx
) = arg
;
7606 /* Store this argument. */
7607 if (arg
== error_mark_node
)
7610 /* We are done with all of the arguments. */
7615 pack_adjust
= TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg
)) - 1;
7616 arg_idx
+= pack_adjust
;
7623 if (PACK_EXPANSION_P (arg
))
7625 /* "If every valid specialization of a variadic template
7626 requires an empty template parameter pack, the template is
7627 ill-formed, no diagnostic required." So check that the
7628 pattern works with this parameter. */
7629 tree pattern
= PACK_EXPANSION_PATTERN (arg
);
7630 tree conv
= convert_template_argument (TREE_VALUE (parm
),
7634 if (conv
== error_mark_node
)
7636 inform (input_location
, "so any instantiation with a "
7637 "non-empty parameter pack would be ill-formed");
7640 else if (TYPE_P (conv
) && !TYPE_P (pattern
))
7641 /* Recover from missing typename. */
7642 TREE_VEC_ELT (inner_args
, arg_idx
)
7643 = make_pack_expansion (conv
);
7645 /* We don't know how many args we have yet, just
7646 use the unconverted ones for now. */
7647 new_inner_args
= inner_args
;
7652 else if (require_all_args
)
7654 /* There must be a default arg in this case. */
7655 arg
= tsubst_template_arg (TREE_PURPOSE (parm
), new_args
,
7657 /* The position of the first default template argument,
7658 is also the number of non-defaulted arguments in NEW_INNER_ARGS.
7660 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
))
7661 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
,
7662 arg_idx
- pack_adjust
);
7667 if (arg
== error_mark_node
)
7669 if (complain
& tf_error
)
7670 error ("template argument %d is invalid", arg_idx
+ 1);
7673 /* This only occurs if there was an error in the template
7674 parameter list itself (which we would already have
7675 reported) that we are trying to recover from, e.g., a class
7676 template with a parameter list such as
7677 template<typename..., typename>. */
7680 arg
= convert_template_argument (TREE_VALUE (parm
),
7681 arg
, new_args
, complain
,
7684 if (arg
== error_mark_node
)
7686 TREE_VEC_ELT (new_inner_args
, arg_idx
- pack_adjust
) = arg
;
7688 cp_unevaluated_operand
= saved_unevaluated_operand
;
7689 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
7691 if (variadic_p
&& arg_idx
< nargs
)
7693 if (complain
& tf_error
)
7695 error ("wrong number of template arguments "
7696 "(%d, should be %d)", nargs
, arg_idx
);
7698 error ("provided for %q+D", in_decl
);
7700 return error_mark_node
;
7704 return error_mark_node
;
7706 if (CHECKING_P
&& !NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
))
7707 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
,
7708 TREE_VEC_LENGTH (new_inner_args
));
7710 return new_inner_args
;
7713 /* Convert all template arguments to their appropriate types, and
7714 return a vector containing the innermost resulting template
7715 arguments. If any error occurs, return error_mark_node. Error and
7716 warning messages are not issued.
7718 Note that no function argument deduction is performed, and default
7719 arguments are used to fill in unspecified arguments. */
7721 coerce_template_parms (tree parms
, tree args
, tree in_decl
)
7723 return coerce_template_parms (parms
, args
, in_decl
, tf_none
, true, true);
7726 /* Convert all template arguments to their appropriate type, and
7727 instantiate default arguments as needed. This returns a vector
7728 containing the innermost resulting template arguments, or
7729 error_mark_node if unsuccessful. */
7731 coerce_template_parms (tree parms
, tree args
, tree in_decl
,
7732 tsubst_flags_t complain
)
7734 return coerce_template_parms (parms
, args
, in_decl
, complain
, true, true);
7737 /* Like coerce_template_parms. If PARMS represents all template
7738 parameters levels, this function returns a vector of vectors
7739 representing all the resulting argument levels. Note that in this
7740 case, only the innermost arguments are coerced because the
7741 outermost ones are supposed to have been coerced already.
7743 Otherwise, if PARMS represents only (the innermost) vector of
7744 parameters, this function returns a vector containing just the
7745 innermost resulting arguments. */
7748 coerce_innermost_template_parms (tree parms
,
7751 tsubst_flags_t complain
,
7752 bool require_all_args
,
7753 bool use_default_args
)
7755 int parms_depth
= TMPL_PARMS_DEPTH (parms
);
7756 int args_depth
= TMPL_ARGS_DEPTH (args
);
7759 if (parms_depth
> 1)
7761 coerced_args
= make_tree_vec (parms_depth
);
7765 for (level
= parms
, cur_depth
= parms_depth
;
7766 parms_depth
> 0 && level
!= NULL_TREE
;
7767 level
= TREE_CHAIN (level
), --cur_depth
)
7770 if (cur_depth
== args_depth
)
7771 l
= coerce_template_parms (TREE_VALUE (level
),
7772 args
, in_decl
, complain
,
7776 l
= TMPL_ARGS_LEVEL (args
, cur_depth
);
7778 if (l
== error_mark_node
)
7779 return error_mark_node
;
7781 SET_TMPL_ARGS_LEVEL (coerced_args
, cur_depth
, l
);
7785 coerced_args
= coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parms
),
7786 args
, in_decl
, complain
,
7789 return coerced_args
;
7792 /* Returns 1 if template args OT and NT are equivalent. */
7795 template_args_equal (tree ot
, tree nt
)
7799 if (nt
== NULL_TREE
|| ot
== NULL_TREE
)
7802 if (TREE_CODE (nt
) == TREE_VEC
)
7803 /* For member templates */
7804 return TREE_CODE (ot
) == TREE_VEC
&& comp_template_args (ot
, nt
);
7805 else if (PACK_EXPANSION_P (ot
))
7806 return (PACK_EXPANSION_P (nt
)
7807 && template_args_equal (PACK_EXPANSION_PATTERN (ot
),
7808 PACK_EXPANSION_PATTERN (nt
))
7809 && template_args_equal (PACK_EXPANSION_EXTRA_ARGS (ot
),
7810 PACK_EXPANSION_EXTRA_ARGS (nt
)));
7811 else if (ARGUMENT_PACK_P (ot
))
7816 if (!ARGUMENT_PACK_P (nt
))
7819 opack
= ARGUMENT_PACK_ARGS (ot
);
7820 npack
= ARGUMENT_PACK_ARGS (nt
);
7821 len
= TREE_VEC_LENGTH (opack
);
7822 if (TREE_VEC_LENGTH (npack
) != len
)
7824 for (i
= 0; i
< len
; ++i
)
7825 if (!template_args_equal (TREE_VEC_ELT (opack
, i
),
7826 TREE_VEC_ELT (npack
, i
)))
7830 else if (ot
&& TREE_CODE (ot
) == ARGUMENT_PACK_SELECT
)
7832 /* We get here probably because we are in the middle of substituting
7833 into the pattern of a pack expansion. In that case the
7834 ARGUMENT_PACK_SELECT temporarily replaces the pack argument we are
7835 interested in. So we want to use the initial pack argument for
7837 ot
= ARGUMENT_PACK_SELECT_FROM_PACK (ot
);
7838 if (nt
&& TREE_CODE (nt
) == ARGUMENT_PACK_SELECT
)
7839 nt
= ARGUMENT_PACK_SELECT_FROM_PACK (nt
);
7840 return template_args_equal (ot
, nt
);
7842 else if (TYPE_P (nt
))
7846 /* Don't treat an alias template specialization with dependent
7847 arguments as equivalent to its underlying type when used as a
7848 template argument; we need them to be distinct so that we
7849 substitute into the specialization arguments at instantiation
7850 time. And aliases can't be equivalent without being ==, so
7851 we don't need to look any deeper. */
7852 if (TYPE_ALIAS_P (nt
) || TYPE_ALIAS_P (ot
))
7855 return same_type_p (ot
, nt
);
7857 else if (TREE_CODE (ot
) == TREE_VEC
|| TYPE_P (ot
))
7861 /* Try to treat a template non-type argument that has been converted
7862 to the parameter type as equivalent to one that hasn't yet. */
7863 for (enum tree_code code1
= TREE_CODE (ot
);
7864 CONVERT_EXPR_CODE_P (code1
)
7865 || code1
== NON_LVALUE_EXPR
;
7866 code1
= TREE_CODE (ot
))
7867 ot
= TREE_OPERAND (ot
, 0);
7868 for (enum tree_code code2
= TREE_CODE (nt
);
7869 CONVERT_EXPR_CODE_P (code2
)
7870 || code2
== NON_LVALUE_EXPR
;
7871 code2
= TREE_CODE (nt
))
7872 nt
= TREE_OPERAND (nt
, 0);
7874 return cp_tree_equal (ot
, nt
);
7878 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets of
7879 template arguments. Returns 0 otherwise, and updates OLDARG_PTR and
7880 NEWARG_PTR with the offending arguments if they are non-NULL. */
7883 comp_template_args_with_info (tree oldargs
, tree newargs
,
7884 tree
*oldarg_ptr
, tree
*newarg_ptr
)
7888 if (oldargs
== newargs
)
7891 if (!oldargs
|| !newargs
)
7894 if (TREE_VEC_LENGTH (oldargs
) != TREE_VEC_LENGTH (newargs
))
7897 for (i
= 0; i
< TREE_VEC_LENGTH (oldargs
); ++i
)
7899 tree nt
= TREE_VEC_ELT (newargs
, i
);
7900 tree ot
= TREE_VEC_ELT (oldargs
, i
);
7902 if (! template_args_equal (ot
, nt
))
7904 if (oldarg_ptr
!= NULL
)
7906 if (newarg_ptr
!= NULL
)
7914 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets
7915 of template arguments. Returns 0 otherwise. */
7918 comp_template_args (tree oldargs
, tree newargs
)
7920 return comp_template_args_with_info (oldargs
, newargs
, NULL
, NULL
);
7924 add_pending_template (tree d
)
7926 tree ti
= (TYPE_P (d
)
7927 ? CLASSTYPE_TEMPLATE_INFO (d
)
7928 : DECL_TEMPLATE_INFO (d
));
7929 struct pending_template
*pt
;
7932 if (TI_PENDING_TEMPLATE_FLAG (ti
))
7935 /* We are called both from instantiate_decl, where we've already had a
7936 tinst_level pushed, and instantiate_template, where we haven't.
7938 level
= !current_tinst_level
|| current_tinst_level
->decl
!= d
;
7941 push_tinst_level (d
);
7943 pt
= ggc_alloc
<pending_template
> ();
7945 pt
->tinst
= current_tinst_level
;
7946 if (last_pending_template
)
7947 last_pending_template
->next
= pt
;
7949 pending_templates
= pt
;
7951 last_pending_template
= pt
;
7953 TI_PENDING_TEMPLATE_FLAG (ti
) = 1;
7960 /* Return a TEMPLATE_ID_EXPR corresponding to the indicated FNS and
7961 ARGLIST. Valid choices for FNS are given in the cp-tree.def
7962 documentation for TEMPLATE_ID_EXPR. */
7965 lookup_template_function (tree fns
, tree arglist
)
7969 if (fns
== error_mark_node
|| arglist
== error_mark_node
)
7970 return error_mark_node
;
7972 gcc_assert (!arglist
|| TREE_CODE (arglist
) == TREE_VEC
);
7974 if (!is_overloaded_fn (fns
) && !identifier_p (fns
))
7976 error ("%q#D is not a function template", fns
);
7977 return error_mark_node
;
7980 if (BASELINK_P (fns
))
7982 BASELINK_FUNCTIONS (fns
) = build2 (TEMPLATE_ID_EXPR
,
7984 BASELINK_FUNCTIONS (fns
),
7989 type
= TREE_TYPE (fns
);
7990 if (TREE_CODE (fns
) == OVERLOAD
|| !type
)
7991 type
= unknown_type_node
;
7993 return build2 (TEMPLATE_ID_EXPR
, type
, fns
, arglist
);
7996 /* Within the scope of a template class S<T>, the name S gets bound
7997 (in build_self_reference) to a TYPE_DECL for the class, not a
7998 TEMPLATE_DECL. If DECL is a TYPE_DECL for current_class_type,
7999 or one of its enclosing classes, and that type is a template,
8000 return the associated TEMPLATE_DECL. Otherwise, the original
8003 Also handle the case when DECL is a TREE_LIST of ambiguous
8004 injected-class-names from different bases. */
8007 maybe_get_template_decl_from_type_decl (tree decl
)
8009 if (decl
== NULL_TREE
)
8012 /* DR 176: A lookup that finds an injected-class-name (10.2
8013 [class.member.lookup]) can result in an ambiguity in certain cases
8014 (for example, if it is found in more than one base class). If all of
8015 the injected-class-names that are found refer to specializations of
8016 the same class template, and if the name is followed by a
8017 template-argument-list, the reference refers to the class template
8018 itself and not a specialization thereof, and is not ambiguous. */
8019 if (TREE_CODE (decl
) == TREE_LIST
)
8021 tree t
, tmpl
= NULL_TREE
;
8022 for (t
= decl
; t
; t
= TREE_CHAIN (t
))
8024 tree elt
= maybe_get_template_decl_from_type_decl (TREE_VALUE (t
));
8027 else if (tmpl
!= elt
)
8030 if (tmpl
&& t
== NULL_TREE
)
8036 return (decl
!= NULL_TREE
8037 && DECL_SELF_REFERENCE_P (decl
)
8038 && CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (decl
)))
8039 ? CLASSTYPE_TI_TEMPLATE (TREE_TYPE (decl
)) : decl
;
8042 /* Given an IDENTIFIER_NODE (or type TEMPLATE_DECL) and a chain of
8043 parameters, find the desired type.
8045 D1 is the PTYPENAME terminal, and ARGLIST is the list of arguments.
8047 IN_DECL, if non-NULL, is the template declaration we are trying to
8050 If ENTERING_SCOPE is nonzero, we are about to enter the scope of
8051 the class we are looking up.
8053 Issue error and warning messages under control of COMPLAIN.
8055 If the template class is really a local class in a template
8056 function, then the FUNCTION_CONTEXT is the function in which it is
8059 ??? Note that this function is currently called *twice* for each
8060 template-id: the first time from the parser, while creating the
8061 incomplete type (finish_template_type), and the second type during the
8062 real instantiation (instantiate_template_class). This is surely something
8063 that we want to avoid. It also causes some problems with argument
8064 coercion (see convert_nontype_argument for more information on this). */
8067 lookup_template_class_1 (tree d1
, tree arglist
, tree in_decl
, tree context
,
8068 int entering_scope
, tsubst_flags_t complain
)
8070 tree templ
= NULL_TREE
, parmlist
;
8077 if (identifier_p (d1
))
8079 tree value
= innermost_non_namespace_value (d1
);
8080 if (value
&& DECL_TEMPLATE_TEMPLATE_PARM_P (value
))
8085 push_decl_namespace (context
);
8086 templ
= lookup_name (d1
);
8087 templ
= maybe_get_template_decl_from_type_decl (templ
);
8089 pop_decl_namespace ();
8092 context
= DECL_CONTEXT (templ
);
8094 else if (TREE_CODE (d1
) == TYPE_DECL
&& MAYBE_CLASS_TYPE_P (TREE_TYPE (d1
)))
8096 tree type
= TREE_TYPE (d1
);
8098 /* If we are declaring a constructor, say A<T>::A<T>, we will get
8099 an implicit typename for the second A. Deal with it. */
8100 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
8101 type
= TREE_TYPE (type
);
8103 if (CLASSTYPE_TEMPLATE_INFO (type
))
8105 templ
= CLASSTYPE_TI_TEMPLATE (type
);
8106 d1
= DECL_NAME (templ
);
8109 else if (TREE_CODE (d1
) == ENUMERAL_TYPE
8110 || (TYPE_P (d1
) && MAYBE_CLASS_TYPE_P (d1
)))
8112 templ
= TYPE_TI_TEMPLATE (d1
);
8113 d1
= DECL_NAME (templ
);
8115 else if (DECL_TYPE_TEMPLATE_P (d1
))
8118 d1
= DECL_NAME (templ
);
8119 context
= DECL_CONTEXT (templ
);
8121 else if (DECL_TEMPLATE_TEMPLATE_PARM_P (d1
))
8124 d1
= DECL_NAME (templ
);
8127 /* Issue an error message if we didn't find a template. */
8130 if (complain
& tf_error
)
8131 error ("%qT is not a template", d1
);
8132 return error_mark_node
;
8135 if (TREE_CODE (templ
) != TEMPLATE_DECL
8136 /* Make sure it's a user visible template, if it was named by
8138 || ((complain
& tf_user
) && !DECL_TEMPLATE_PARM_P (templ
)
8139 && !PRIMARY_TEMPLATE_P (templ
)))
8141 if (complain
& tf_error
)
8143 error ("non-template type %qT used as a template", d1
);
8145 error ("for template declaration %q+D", in_decl
);
8147 return error_mark_node
;
8150 complain
&= ~tf_user
;
8152 /* An alias that just changes the name of a template is equivalent to the
8153 other template, so if any of the arguments are pack expansions, strip
8154 the alias to avoid problems with a pack expansion passed to a non-pack
8155 alias template parameter (DR 1430). */
8156 if (pack_expansion_args_count (INNERMOST_TEMPLATE_ARGS (arglist
)))
8157 templ
= get_underlying_template (templ
);
8159 if (DECL_TEMPLATE_TEMPLATE_PARM_P (templ
))
8161 /* Create a new TEMPLATE_DECL and TEMPLATE_TEMPLATE_PARM node to store
8162 template arguments */
8168 parmlist
= DECL_INNERMOST_TEMPLATE_PARMS (templ
);
8170 /* Consider an example where a template template parameter declared as
8172 template <class T, class U = std::allocator<T> > class TT
8174 The template parameter level of T and U are one level larger than
8175 of TT. To proper process the default argument of U, say when an
8176 instantiation `TT<int>' is seen, we need to build the full
8177 arguments containing {int} as the innermost level. Outer levels,
8178 available when not appearing as default template argument, can be
8179 obtained from the arguments of the enclosing template.
8181 Suppose that TT is later substituted with std::vector. The above
8182 instantiation is `TT<int, std::allocator<T> >' with TT at
8183 level 1, and T at level 2, while the template arguments at level 1
8184 becomes {std::vector} and the inner level 2 is {int}. */
8186 outer
= DECL_CONTEXT (templ
);
8188 outer
= TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (outer
)));
8189 else if (current_template_parms
)
8191 /* This is an argument of the current template, so we haven't set
8192 DECL_CONTEXT yet. */
8193 tree relevant_template_parms
;
8195 /* Parameter levels that are greater than the level of the given
8196 template template parm are irrelevant. */
8197 relevant_template_parms
= current_template_parms
;
8198 while (TMPL_PARMS_DEPTH (relevant_template_parms
)
8199 != TEMPLATE_TYPE_LEVEL (TREE_TYPE (templ
)))
8200 relevant_template_parms
= TREE_CHAIN (relevant_template_parms
);
8202 outer
= template_parms_to_args (relevant_template_parms
);
8206 arglist
= add_to_template_args (outer
, arglist
);
8208 arglist2
= coerce_template_parms (parmlist
, arglist
, templ
,
8210 /*require_all_args=*/true,
8211 /*use_default_args=*/true);
8212 if (arglist2
== error_mark_node
8213 || (!uses_template_parms (arglist2
)
8214 && check_instantiated_args (templ
, arglist2
, complain
)))
8215 return error_mark_node
;
8217 parm
= bind_template_template_parm (TREE_TYPE (templ
), arglist2
);
8222 tree template_type
= TREE_TYPE (templ
);
8225 tree found
= NULL_TREE
;
8228 int is_dependent_type
;
8229 int use_partial_inst_tmpl
= false;
8231 if (template_type
== error_mark_node
)
8232 /* An error occurred while building the template TEMPL, and a
8233 diagnostic has most certainly been emitted for that
8234 already. Let's propagate that error. */
8235 return error_mark_node
;
8237 gen_tmpl
= most_general_template (templ
);
8238 parmlist
= DECL_TEMPLATE_PARMS (gen_tmpl
);
8239 parm_depth
= TMPL_PARMS_DEPTH (parmlist
);
8240 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
8242 if (arg_depth
== 1 && parm_depth
> 1)
8244 /* We've been given an incomplete set of template arguments.
8247 template <class T> struct S1 {
8248 template <class U> struct S2 {};
8249 template <class U> struct S2<U*> {};
8252 we will be called with an ARGLIST of `U*', but the
8253 TEMPLATE will be `template <class T> template
8254 <class U> struct S1<T>::S2'. We must fill in the missing
8257 = add_outermost_template_args (TYPE_TI_ARGS (TREE_TYPE (templ
)),
8259 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
8262 /* Now we should have enough arguments. */
8263 gcc_assert (parm_depth
== arg_depth
);
8265 /* From here on, we're only interested in the most general
8268 /* Calculate the BOUND_ARGS. These will be the args that are
8269 actually tsubst'd into the definition to create the
8271 arglist
= coerce_innermost_template_parms (parmlist
, arglist
, gen_tmpl
,
8273 /*require_all_args=*/true,
8274 /*use_default_args=*/true);
8276 if (arglist
== error_mark_node
)
8277 /* We were unable to bind the arguments. */
8278 return error_mark_node
;
8280 /* In the scope of a template class, explicit references to the
8281 template class refer to the type of the template, not any
8282 instantiation of it. For example, in:
8284 template <class T> class C { void f(C<T>); }
8286 the `C<T>' is just the same as `C'. Outside of the
8287 class, however, such a reference is an instantiation. */
8289 || !PRIMARY_TEMPLATE_P (gen_tmpl
)
8290 || currently_open_class (template_type
))
8291 /* comp_template_args is expensive, check it last. */
8292 && comp_template_args (TYPE_TI_ARGS (template_type
),
8294 return template_type
;
8296 /* If we already have this specialization, return it. */
8297 elt
.tmpl
= gen_tmpl
;
8299 elt
.spec
= NULL_TREE
;
8300 hash
= spec_hasher::hash (&elt
);
8301 entry
= type_specializations
->find_with_hash (&elt
, hash
);
8306 /* If the the template's constraints are not satisfied,
8307 then we cannot form a valid type.
8309 Note that the check is deferred until after the hash
8310 lookup. This prevents redundant checks on previously
8311 instantiated specializations. */
8312 if (flag_concepts
&& !constraints_satisfied_p (gen_tmpl
, arglist
))
8314 if (complain
& tf_error
)
8316 error ("template constraint failure");
8317 diagnose_constraints (input_location
, gen_tmpl
, arglist
);
8319 return error_mark_node
;
8322 is_dependent_type
= uses_template_parms (arglist
);
8324 /* If the deduced arguments are invalid, then the binding
8326 if (!is_dependent_type
8327 && check_instantiated_args (gen_tmpl
,
8328 INNERMOST_TEMPLATE_ARGS (arglist
),
8330 return error_mark_node
;
8332 if (!is_dependent_type
8333 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
8334 && !LAMBDA_TYPE_P (TREE_TYPE (gen_tmpl
))
8335 && TREE_CODE (CP_DECL_CONTEXT (gen_tmpl
)) == NAMESPACE_DECL
)
8337 found
= xref_tag_from_type (TREE_TYPE (gen_tmpl
),
8338 DECL_NAME (gen_tmpl
),
8339 /*tag_scope=*/ts_global
);
8343 context
= tsubst (DECL_CONTEXT (gen_tmpl
), arglist
,
8345 if (context
== error_mark_node
)
8346 return error_mark_node
;
8349 context
= global_namespace
;
8351 /* Create the type. */
8352 if (DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
8354 /* The user referred to a specialization of an alias
8355 template represented by GEN_TMPL.
8357 [temp.alias]/2 says:
8359 When a template-id refers to the specialization of an
8360 alias template, it is equivalent to the associated
8361 type obtained by substitution of its
8362 template-arguments for the template-parameters in the
8363 type-id of the alias template. */
8365 t
= tsubst (TREE_TYPE (gen_tmpl
), arglist
, complain
, in_decl
);
8366 /* Note that the call above (by indirectly calling
8367 register_specialization in tsubst_decl) registers the
8368 TYPE_DECL representing the specialization of the alias
8369 template. So next time someone substitutes ARGLIST for
8370 the template parms into the alias template (GEN_TMPL),
8371 she'll get that TYPE_DECL back. */
8373 if (t
== error_mark_node
)
8376 else if (TREE_CODE (template_type
) == ENUMERAL_TYPE
)
8378 if (!is_dependent_type
)
8380 set_current_access_from_decl (TYPE_NAME (template_type
));
8381 t
= start_enum (TYPE_IDENTIFIER (template_type
), NULL_TREE
,
8382 tsubst (ENUM_UNDERLYING_TYPE (template_type
),
8383 arglist
, complain
, in_decl
),
8384 SCOPED_ENUM_P (template_type
), NULL
);
8386 if (t
== error_mark_node
)
8391 /* We don't want to call start_enum for this type, since
8392 the values for the enumeration constants may involve
8393 template parameters. And, no one should be interested
8394 in the enumeration constants for such a type. */
8395 t
= cxx_make_type (ENUMERAL_TYPE
);
8396 SET_SCOPED_ENUM_P (t
, SCOPED_ENUM_P (template_type
));
8398 SET_OPAQUE_ENUM_P (t
, OPAQUE_ENUM_P (template_type
));
8399 ENUM_FIXED_UNDERLYING_TYPE_P (t
)
8400 = ENUM_FIXED_UNDERLYING_TYPE_P (template_type
);
8402 else if (CLASS_TYPE_P (template_type
))
8404 t
= make_class_type (TREE_CODE (template_type
));
8405 CLASSTYPE_DECLARED_CLASS (t
)
8406 = CLASSTYPE_DECLARED_CLASS (template_type
);
8407 SET_CLASSTYPE_IMPLICIT_INSTANTIATION (t
);
8408 TYPE_FOR_JAVA (t
) = TYPE_FOR_JAVA (template_type
);
8410 /* A local class. Make sure the decl gets registered properly. */
8411 if (context
== current_function_decl
)
8412 pushtag (DECL_NAME (gen_tmpl
), t
, /*tag_scope=*/ts_current
);
8414 if (comp_template_args (CLASSTYPE_TI_ARGS (template_type
), arglist
))
8415 /* This instantiation is another name for the primary
8416 template type. Set the TYPE_CANONICAL field
8418 TYPE_CANONICAL (t
) = template_type
;
8419 else if (any_template_arguments_need_structural_equality_p (arglist
))
8420 /* Some of the template arguments require structural
8421 equality testing, so this template class requires
8422 structural equality testing. */
8423 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8428 /* If we called start_enum or pushtag above, this information
8429 will already be set up. */
8432 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
8434 type_decl
= create_implicit_typedef (DECL_NAME (gen_tmpl
), t
);
8435 DECL_CONTEXT (type_decl
) = TYPE_CONTEXT (t
);
8436 DECL_SOURCE_LOCATION (type_decl
)
8437 = DECL_SOURCE_LOCATION (TYPE_STUB_DECL (template_type
));
8440 type_decl
= TYPE_NAME (t
);
8442 if (CLASS_TYPE_P (template_type
))
8444 TREE_PRIVATE (type_decl
)
8445 = TREE_PRIVATE (TYPE_MAIN_DECL (template_type
));
8446 TREE_PROTECTED (type_decl
)
8447 = TREE_PROTECTED (TYPE_MAIN_DECL (template_type
));
8448 if (CLASSTYPE_VISIBILITY_SPECIFIED (template_type
))
8450 DECL_VISIBILITY_SPECIFIED (type_decl
) = 1;
8451 DECL_VISIBILITY (type_decl
) = CLASSTYPE_VISIBILITY (template_type
);
8455 if (OVERLOAD_TYPE_P (t
)
8456 && !DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
8458 static const char *tags
[] = {"abi_tag", "may_alias"};
8460 for (unsigned ix
= 0; ix
!= 2; ix
++)
8463 = lookup_attribute (tags
[ix
], TYPE_ATTRIBUTES (template_type
));
8467 else if (!TREE_CHAIN (attributes
) && !TYPE_ATTRIBUTES (t
))
8468 TYPE_ATTRIBUTES (t
) = attributes
;
8471 = tree_cons (TREE_PURPOSE (attributes
),
8472 TREE_VALUE (attributes
),
8473 TYPE_ATTRIBUTES (t
));
8477 /* Let's consider the explicit specialization of a member
8478 of a class template specialization that is implicitly instantiated,
8483 template<class U> struct M {}; //#0
8488 struct S<int>::M<char> //#1
8492 [temp.expl.spec]/4 says this is valid.
8494 In this case, when we write:
8497 M is instantiated from the CLASSTYPE_TI_TEMPLATE of #1, not from
8500 When we encounter #1, we want to store the partial instantiation
8501 of M (template<class T> S<int>::M<T>) in its CLASSTYPE_TI_TEMPLATE.
8503 For all cases other than this "explicit specialization of member of a
8504 class template", we just want to store the most general template into
8505 the CLASSTYPE_TI_TEMPLATE of M.
8507 This case of "explicit specialization of member of a class template"
8509 1/ the enclosing class is an instantiation of, and therefore not
8510 the same as, the context of the most general template, and
8511 2/ we aren't looking at the partial instantiation itself, i.e.
8512 the innermost arguments are not the same as the innermost parms of
8513 the most general template.
8515 So it's only when 1/ and 2/ happens that we want to use the partial
8516 instantiation of the member template in lieu of its most general
8519 if (PRIMARY_TEMPLATE_P (gen_tmpl
)
8520 && TMPL_ARGS_HAVE_MULTIPLE_LEVELS (arglist
)
8521 /* the enclosing class must be an instantiation... */
8522 && CLASS_TYPE_P (context
)
8523 && !same_type_p (context
, DECL_CONTEXT (gen_tmpl
)))
8525 tree partial_inst_args
;
8526 TREE_VEC_LENGTH (arglist
)--;
8527 ++processing_template_decl
;
8529 tsubst (INNERMOST_TEMPLATE_ARGS
8530 (TYPE_TI_ARGS (TREE_TYPE (gen_tmpl
))),
8531 arglist
, complain
, NULL_TREE
);
8532 --processing_template_decl
;
8533 TREE_VEC_LENGTH (arglist
)++;
8534 use_partial_inst_tmpl
=
8535 /*...and we must not be looking at the partial instantiation
8537 !comp_template_args (INNERMOST_TEMPLATE_ARGS (arglist
),
8541 if (!use_partial_inst_tmpl
)
8542 /* This case is easy; there are no member templates involved. */
8546 /* This is a full instantiation of a member template. Find
8547 the partial instantiation of which this is an instance. */
8549 /* Temporarily reduce by one the number of levels in the ARGLIST
8550 so as to avoid comparing the last set of arguments. */
8551 TREE_VEC_LENGTH (arglist
)--;
8552 found
= tsubst (gen_tmpl
, arglist
, complain
, NULL_TREE
);
8553 TREE_VEC_LENGTH (arglist
)++;
8554 /* FOUND is either a proper class type, or an alias
8555 template specialization. In the later case, it's a
8556 TYPE_DECL, resulting from the substituting of arguments
8557 for parameters in the TYPE_DECL of the alias template
8558 done earlier. So be careful while getting the template
8560 found
= TREE_CODE (found
) == TYPE_DECL
8561 ? TYPE_TI_TEMPLATE (TREE_TYPE (found
))
8562 : CLASSTYPE_TI_TEMPLATE (found
);
8565 // Build template info for the new specialization.
8566 SET_TYPE_TEMPLATE_INFO (t
, build_template_info (found
, arglist
));
8569 slot
= type_specializations
->find_slot_with_hash (&elt
, hash
, INSERT
);
8570 entry
= ggc_alloc
<spec_entry
> ();
8574 /* Note this use of the partial instantiation so we can check it
8575 later in maybe_process_partial_specialization. */
8576 DECL_TEMPLATE_INSTANTIATIONS (found
)
8577 = tree_cons (arglist
, t
,
8578 DECL_TEMPLATE_INSTANTIATIONS (found
));
8580 if (TREE_CODE (template_type
) == ENUMERAL_TYPE
&& !is_dependent_type
8581 && !DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
8582 /* Now that the type has been registered on the instantiations
8583 list, we set up the enumerators. Because the enumeration
8584 constants may involve the enumeration type itself, we make
8585 sure to register the type first, and then create the
8586 constants. That way, doing tsubst_expr for the enumeration
8587 constants won't result in recursive calls here; we'll find
8588 the instantiation and exit above. */
8589 tsubst_enum (template_type
, t
, arglist
);
8591 if (CLASS_TYPE_P (template_type
) && is_dependent_type
)
8592 /* If the type makes use of template parameters, the
8593 code that generates debugging information will crash. */
8594 DECL_IGNORED_P (TYPE_MAIN_DECL (t
)) = 1;
8596 /* Possibly limit visibility based on template args. */
8597 TREE_PUBLIC (type_decl
) = 1;
8598 determine_visibility (type_decl
);
8600 inherit_targ_abi_tags (t
);
8606 /* Wrapper for lookup_template_class_1. */
8609 lookup_template_class (tree d1
, tree arglist
, tree in_decl
, tree context
,
8610 int entering_scope
, tsubst_flags_t complain
)
8613 timevar_push (TV_TEMPLATE_INST
);
8614 ret
= lookup_template_class_1 (d1
, arglist
, in_decl
, context
,
8615 entering_scope
, complain
);
8616 timevar_pop (TV_TEMPLATE_INST
);
8620 /* Return a TEMPLATE_ID_EXPR for the given variable template and ARGLIST. */
8623 lookup_template_variable (tree templ
, tree arglist
)
8625 /* The type of the expression is NULL_TREE since the template-id could refer
8626 to an explicit or partial specialization. */
8627 tree type
= NULL_TREE
;
8628 if (flag_concepts
&& variable_concept_p (templ
))
8629 /* Except that concepts are always bool. */
8630 type
= boolean_type_node
;
8631 return build2 (TEMPLATE_ID_EXPR
, type
, templ
, arglist
);
8634 /* Instantiate a variable declaration from a TEMPLATE_ID_EXPR for use. */
8637 finish_template_variable (tree var
, tsubst_flags_t complain
)
8639 tree templ
= TREE_OPERAND (var
, 0);
8640 tree arglist
= TREE_OPERAND (var
, 1);
8642 /* We never want to return a VAR_DECL for a variable concept, since they
8643 aren't instantiated. In a template, leave the TEMPLATE_ID_EXPR alone. */
8644 bool concept_p
= flag_concepts
&& variable_concept_p (templ
);
8645 if (concept_p
&& processing_template_decl
)
8648 tree tmpl_args
= DECL_TI_ARGS (DECL_TEMPLATE_RESULT (templ
));
8649 arglist
= add_outermost_template_args (tmpl_args
, arglist
);
8651 tree parms
= DECL_TEMPLATE_PARMS (templ
);
8652 arglist
= coerce_innermost_template_parms (parms
, arglist
, templ
, complain
,
8654 /*use_default*/true);
8656 if (flag_concepts
&& !constraints_satisfied_p (templ
, arglist
))
8658 if (complain
& tf_error
)
8660 error ("constraints for %qD not satisfied", templ
);
8661 diagnose_constraints (location_of (var
), templ
, arglist
);
8663 return error_mark_node
;
8666 /* If a template-id refers to a specialization of a variable
8667 concept, then the expression is true if and only if the
8668 concept's constraints are satisfied by the given template
8671 NOTE: This is an extension of Concepts Lite TS that
8672 allows constraints to be used in expressions. */
8675 tree decl
= DECL_TEMPLATE_RESULT (templ
);
8676 return evaluate_variable_concept (decl
, arglist
);
8679 return instantiate_template (templ
, arglist
, complain
);
8686 /* True when we should also visit template parameters that occur in
8687 non-deduced contexts. */
8688 bool include_nondeduced_p
;
8689 hash_set
<tree
> *visited
;
8692 /* Called from for_each_template_parm via walk_tree. */
8695 for_each_template_parm_r (tree
*tp
, int *walk_subtrees
, void *d
)
8698 struct pair_fn_data
*pfd
= (struct pair_fn_data
*) d
;
8699 tree_fn_t fn
= pfd
->fn
;
8700 void *data
= pfd
->data
;
8701 tree result
= NULL_TREE
;
8703 #define WALK_SUBTREE(NODE) \
8706 result = for_each_template_parm (NODE, fn, data, pfd->visited, \
8707 pfd->include_nondeduced_p); \
8708 if (result) goto out; \
8713 && (pfd
->include_nondeduced_p
|| TREE_CODE (t
) != TYPENAME_TYPE
))
8714 WALK_SUBTREE (TYPE_CONTEXT (t
));
8716 switch (TREE_CODE (t
))
8719 if (TYPE_PTRMEMFUNC_P (t
))
8725 if (!TYPE_TEMPLATE_INFO (t
))
8728 WALK_SUBTREE (TYPE_TI_ARGS (t
));
8732 WALK_SUBTREE (TYPE_MIN_VALUE (t
));
8733 WALK_SUBTREE (TYPE_MAX_VALUE (t
));
8737 /* Since we're not going to walk subtrees, we have to do this
8739 WALK_SUBTREE (TYPE_METHOD_BASETYPE (t
));
8743 /* Check the return type. */
8744 WALK_SUBTREE (TREE_TYPE (t
));
8746 /* Check the parameter types. Since default arguments are not
8747 instantiated until they are needed, the TYPE_ARG_TYPES may
8748 contain expressions that involve template parameters. But,
8749 no-one should be looking at them yet. And, once they're
8750 instantiated, they don't contain template parameters, so
8751 there's no point in looking at them then, either. */
8755 for (parm
= TYPE_ARG_TYPES (t
); parm
; parm
= TREE_CHAIN (parm
))
8756 WALK_SUBTREE (TREE_VALUE (parm
));
8758 /* Since we've already handled the TYPE_ARG_TYPES, we don't
8759 want walk_tree walking into them itself. */
8765 case UNDERLYING_TYPE
:
8766 if (pfd
->include_nondeduced_p
8767 && for_each_template_parm (TYPE_VALUES_RAW (t
), fn
, data
,
8769 pfd
->include_nondeduced_p
))
8770 return error_mark_node
;
8775 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
))
8776 WALK_SUBTREE (DECL_TI_ARGS (t
));
8781 if (TREE_CODE (t
) == CONST_DECL
&& DECL_TEMPLATE_PARM_P (t
))
8782 WALK_SUBTREE (DECL_INITIAL (t
));
8783 if (DECL_CONTEXT (t
)
8784 && pfd
->include_nondeduced_p
)
8785 WALK_SUBTREE (DECL_CONTEXT (t
));
8788 case BOUND_TEMPLATE_TEMPLATE_PARM
:
8789 /* Record template parameters such as `T' inside `TT<T>'. */
8790 WALK_SUBTREE (TYPE_TI_ARGS (t
));
8793 case TEMPLATE_TEMPLATE_PARM
:
8794 case TEMPLATE_TYPE_PARM
:
8795 case TEMPLATE_PARM_INDEX
:
8796 if (fn
&& (*fn
)(t
, data
))
8803 /* A template template parameter is encountered. */
8804 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
8805 WALK_SUBTREE (TREE_TYPE (t
));
8807 /* Already substituted template template parameter */
8813 WALK_SUBTREE (TYPENAME_TYPE_FULLNAME (t
));
8817 if (TREE_TYPE (t
) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t
))
8818 && pfd
->include_nondeduced_p
)
8819 WALK_SUBTREE (TYPE_PTRMEMFUNC_FN_TYPE (TREE_TYPE (t
)));
8824 /* If there's no type, then this thing must be some expression
8825 involving template parameters. */
8826 if (!fn
&& !TREE_TYPE (t
))
8827 return error_mark_node
;
8832 case IMPLICIT_CONV_EXPR
:
8833 case REINTERPRET_CAST_EXPR
:
8834 case CONST_CAST_EXPR
:
8835 case STATIC_CAST_EXPR
:
8836 case DYNAMIC_CAST_EXPR
:
8840 case PSEUDO_DTOR_EXPR
:
8842 return error_mark_node
;
8851 /* We didn't find any template parameters we liked. */
8856 /* For each TEMPLATE_TYPE_PARM, TEMPLATE_TEMPLATE_PARM,
8857 BOUND_TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX in T,
8858 call FN with the parameter and the DATA.
8859 If FN returns nonzero, the iteration is terminated, and
8860 for_each_template_parm returns 1. Otherwise, the iteration
8861 continues. If FN never returns a nonzero value, the value
8862 returned by for_each_template_parm is 0. If FN is NULL, it is
8863 considered to be the function which always returns 1.
8865 If INCLUDE_NONDEDUCED_P, then this routine will also visit template
8866 parameters that occur in non-deduced contexts. When false, only
8867 visits those template parameters that can be deduced. */
8870 for_each_template_parm (tree t
, tree_fn_t fn
, void* data
,
8871 hash_set
<tree
> *visited
,
8872 bool include_nondeduced_p
)
8874 struct pair_fn_data pfd
;
8880 pfd
.include_nondeduced_p
= include_nondeduced_p
;
8882 /* Walk the tree. (Conceptually, we would like to walk without
8883 duplicates, but for_each_template_parm_r recursively calls
8884 for_each_template_parm, so we would need to reorganize a fair
8885 bit to use walk_tree_without_duplicates, so we keep our own
8888 pfd
.visited
= visited
;
8890 pfd
.visited
= new hash_set
<tree
>;
8891 result
= cp_walk_tree (&t
,
8892 for_each_template_parm_r
,
8906 /* Returns true if T depends on any template parameter. */
8909 uses_template_parms (tree t
)
8915 int saved_processing_template_decl
;
8917 saved_processing_template_decl
= processing_template_decl
;
8918 if (!saved_processing_template_decl
)
8919 processing_template_decl
= 1;
8921 dependent_p
= dependent_type_p (t
);
8922 else if (TREE_CODE (t
) == TREE_VEC
)
8923 dependent_p
= any_dependent_template_arguments_p (t
);
8924 else if (TREE_CODE (t
) == TREE_LIST
)
8925 dependent_p
= (uses_template_parms (TREE_VALUE (t
))
8926 || uses_template_parms (TREE_CHAIN (t
)));
8927 else if (TREE_CODE (t
) == TYPE_DECL
)
8928 dependent_p
= dependent_type_p (TREE_TYPE (t
));
8931 || TREE_CODE (t
) == TEMPLATE_PARM_INDEX
8932 || TREE_CODE (t
) == OVERLOAD
8935 || TREE_CODE (t
) == TRAIT_EXPR
8936 || TREE_CODE (t
) == CONSTRUCTOR
8937 || CONSTANT_CLASS_P (t
))
8938 dependent_p
= (type_dependent_expression_p (t
)
8939 || value_dependent_expression_p (t
));
8942 gcc_assert (t
== error_mark_node
);
8943 dependent_p
= false;
8946 processing_template_decl
= saved_processing_template_decl
;
8951 /* Returns true iff current_function_decl is an incompletely instantiated
8952 template. Useful instead of processing_template_decl because the latter
8953 is set to 0 during instantiate_non_dependent_expr. */
8956 in_template_function (void)
8958 tree fn
= current_function_decl
;
8960 ++processing_template_decl
;
8961 ret
= (fn
&& DECL_LANG_SPECIFIC (fn
)
8962 && DECL_TEMPLATE_INFO (fn
)
8963 && any_dependent_template_arguments_p (DECL_TI_ARGS (fn
)));
8964 --processing_template_decl
;
8968 /* Returns true if T depends on any template parameter with level LEVEL. */
8971 uses_template_parms_level (tree t
, int level
)
8973 return for_each_template_parm (t
, template_parm_this_level_p
, &level
, NULL
,
8974 /*include_nondeduced_p=*/true);
8977 /* Returns TRUE iff INST is an instantiation we don't need to do in an
8978 ill-formed translation unit, i.e. a variable or function that isn't
8979 usable in a constant expression. */
8982 neglectable_inst_p (tree d
)
8985 && !(TREE_CODE (d
) == FUNCTION_DECL
? DECL_DECLARED_CONSTEXPR_P (d
)
8986 : decl_maybe_constant_var_p (d
)));
8989 /* Returns TRUE iff we should refuse to instantiate DECL because it's
8990 neglectable and instantiated from within an erroneous instantiation. */
8993 limit_bad_template_recursion (tree decl
)
8995 struct tinst_level
*lev
= current_tinst_level
;
8996 int errs
= errorcount
+ sorrycount
;
8997 if (lev
== NULL
|| errs
== 0 || !neglectable_inst_p (decl
))
9000 for (; lev
; lev
= lev
->next
)
9001 if (neglectable_inst_p (lev
->decl
))
9004 return (lev
&& errs
> lev
->errors
);
9007 static int tinst_depth
;
9008 extern int max_tinst_depth
;
9011 static GTY(()) struct tinst_level
*last_error_tinst_level
;
9013 /* We're starting to instantiate D; record the template instantiation context
9014 for diagnostics and to restore it later. */
9017 push_tinst_level (tree d
)
9019 return push_tinst_level_loc (d
, input_location
);
9022 /* We're starting to instantiate D; record the template instantiation context
9023 at LOC for diagnostics and to restore it later. */
9026 push_tinst_level_loc (tree d
, location_t loc
)
9028 struct tinst_level
*new_level
;
9030 if (tinst_depth
>= max_tinst_depth
)
9032 fatal_error (input_location
,
9033 "template instantiation depth exceeds maximum of %d"
9034 " (use -ftemplate-depth= to increase the maximum)",
9039 /* If the current instantiation caused problems, don't let it instantiate
9040 anything else. Do allow deduction substitution and decls usable in
9041 constant expressions. */
9042 if (limit_bad_template_recursion (d
))
9045 new_level
= ggc_alloc
<tinst_level
> ();
9046 new_level
->decl
= d
;
9047 new_level
->locus
= loc
;
9048 new_level
->errors
= errorcount
+sorrycount
;
9049 new_level
->in_system_header_p
= in_system_header_at (input_location
);
9050 new_level
->next
= current_tinst_level
;
9051 current_tinst_level
= new_level
;
9054 if (GATHER_STATISTICS
&& (tinst_depth
> depth_reached
))
9055 depth_reached
= tinst_depth
;
9060 /* We're done instantiating this template; return to the instantiation
9064 pop_tinst_level (void)
9066 /* Restore the filename and line number stashed away when we started
9067 this instantiation. */
9068 input_location
= current_tinst_level
->locus
;
9069 current_tinst_level
= current_tinst_level
->next
;
9073 /* We're instantiating a deferred template; restore the template
9074 instantiation context in which the instantiation was requested, which
9075 is one step out from LEVEL. Return the corresponding DECL or TYPE. */
9078 reopen_tinst_level (struct tinst_level
*level
)
9080 struct tinst_level
*t
;
9083 for (t
= level
; t
; t
= t
->next
)
9086 current_tinst_level
= level
;
9088 if (current_tinst_level
)
9089 current_tinst_level
->errors
= errorcount
+sorrycount
;
9093 /* Returns the TINST_LEVEL which gives the original instantiation
9096 struct tinst_level
*
9097 outermost_tinst_level (void)
9099 struct tinst_level
*level
= current_tinst_level
;
9102 level
= level
->next
;
9106 /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the
9107 vector of template arguments, as for tsubst.
9109 Returns an appropriate tsubst'd friend declaration. */
9112 tsubst_friend_function (tree decl
, tree args
)
9116 if (TREE_CODE (decl
) == FUNCTION_DECL
9117 && DECL_TEMPLATE_INSTANTIATION (decl
)
9118 && TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
9119 /* This was a friend declared with an explicit template
9120 argument list, e.g.:
9124 to indicate that f was a template instantiation, not a new
9125 function declaration. Now, we have to figure out what
9126 instantiation of what template. */
9128 tree template_id
, arglist
, fns
;
9131 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (current_class_type
));
9133 /* Friend functions are looked up in the containing namespace scope.
9134 We must enter that scope, to avoid finding member functions of the
9135 current class with same name. */
9136 push_nested_namespace (ns
);
9137 fns
= tsubst_expr (DECL_TI_TEMPLATE (decl
), args
,
9138 tf_warning_or_error
, NULL_TREE
,
9139 /*integral_constant_expression_p=*/false);
9140 pop_nested_namespace (ns
);
9141 arglist
= tsubst (DECL_TI_ARGS (decl
), args
,
9142 tf_warning_or_error
, NULL_TREE
);
9143 template_id
= lookup_template_function (fns
, arglist
);
9145 new_friend
= tsubst (decl
, args
, tf_warning_or_error
, NULL_TREE
);
9146 tmpl
= determine_specialization (template_id
, new_friend
,
9148 /*need_member_template=*/0,
9149 TREE_VEC_LENGTH (args
),
9151 return instantiate_template (tmpl
, new_args
, tf_error
);
9154 new_friend
= tsubst (decl
, args
, tf_warning_or_error
, NULL_TREE
);
9156 /* The NEW_FRIEND will look like an instantiation, to the
9157 compiler, but is not an instantiation from the point of view of
9158 the language. For example, we might have had:
9160 template <class T> struct S {
9161 template <class U> friend void f(T, U);
9164 Then, in S<int>, template <class U> void f(int, U) is not an
9165 instantiation of anything. */
9166 if (new_friend
== error_mark_node
)
9167 return error_mark_node
;
9169 DECL_USE_TEMPLATE (new_friend
) = 0;
9170 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
9172 DECL_USE_TEMPLATE (DECL_TEMPLATE_RESULT (new_friend
)) = 0;
9173 DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (new_friend
))
9174 = DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (decl
));
9177 /* The mangled name for the NEW_FRIEND is incorrect. The function
9178 is not a template instantiation and should not be mangled like
9179 one. Therefore, we forget the mangling here; we'll recompute it
9180 later if we need it. */
9181 if (TREE_CODE (new_friend
) != TEMPLATE_DECL
)
9183 SET_DECL_RTL (new_friend
, NULL
);
9184 SET_DECL_ASSEMBLER_NAME (new_friend
, NULL_TREE
);
9187 if (DECL_NAMESPACE_SCOPE_P (new_friend
))
9190 tree new_friend_template_info
;
9191 tree new_friend_result_template_info
;
9193 int new_friend_is_defn
;
9195 /* We must save some information from NEW_FRIEND before calling
9196 duplicate decls since that function will free NEW_FRIEND if
9198 new_friend_template_info
= DECL_TEMPLATE_INFO (new_friend
);
9199 new_friend_is_defn
=
9200 (DECL_INITIAL (DECL_TEMPLATE_RESULT
9201 (template_for_substitution (new_friend
)))
9203 if (TREE_CODE (new_friend
) == TEMPLATE_DECL
)
9205 /* This declaration is a `primary' template. */
9206 DECL_PRIMARY_TEMPLATE (new_friend
) = new_friend
;
9208 new_friend_result_template_info
9209 = DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (new_friend
));
9212 new_friend_result_template_info
= NULL_TREE
;
9214 /* Make the init_value nonzero so pushdecl knows this is a defn. */
9215 if (new_friend_is_defn
)
9216 DECL_INITIAL (new_friend
) = error_mark_node
;
9218 /* Inside pushdecl_namespace_level, we will push into the
9219 current namespace. However, the friend function should go
9220 into the namespace of the template. */
9221 ns
= decl_namespace_context (new_friend
);
9222 push_nested_namespace (ns
);
9223 old_decl
= pushdecl_namespace_level (new_friend
, /*is_friend=*/true);
9224 pop_nested_namespace (ns
);
9226 if (old_decl
== error_mark_node
)
9227 return error_mark_node
;
9229 if (old_decl
!= new_friend
)
9231 /* This new friend declaration matched an existing
9232 declaration. For example, given:
9234 template <class T> void f(T);
9235 template <class U> class C {
9236 template <class T> friend void f(T) {}
9239 the friend declaration actually provides the definition
9240 of `f', once C has been instantiated for some type. So,
9241 old_decl will be the out-of-class template declaration,
9242 while new_friend is the in-class definition.
9244 But, if `f' was called before this point, the
9245 instantiation of `f' will have DECL_TI_ARGS corresponding
9246 to `T' but not to `U', references to which might appear
9247 in the definition of `f'. Previously, the most general
9248 template for an instantiation of `f' was the out-of-class
9249 version; now it is the in-class version. Therefore, we
9250 run through all specialization of `f', adding to their
9251 DECL_TI_ARGS appropriately. In particular, they need a
9252 new set of outer arguments, corresponding to the
9253 arguments for this class instantiation.
9255 The same situation can arise with something like this:
9258 template <class T> class C {
9262 when `C<int>' is instantiated. Now, `f(int)' is defined
9265 if (!new_friend_is_defn
)
9266 /* On the other hand, if the in-class declaration does
9267 *not* provide a definition, then we don't want to alter
9268 existing definitions. We can just leave everything
9273 tree new_template
= TI_TEMPLATE (new_friend_template_info
);
9274 tree new_args
= TI_ARGS (new_friend_template_info
);
9276 /* Overwrite whatever template info was there before, if
9277 any, with the new template information pertaining to
9279 DECL_TEMPLATE_INFO (old_decl
) = new_friend_template_info
;
9281 if (TREE_CODE (old_decl
) != TEMPLATE_DECL
)
9283 /* We should have called reregister_specialization in
9285 gcc_assert (retrieve_specialization (new_template
,
9289 /* Instantiate it if the global has already been used. */
9290 if (DECL_ODR_USED (old_decl
))
9291 instantiate_decl (old_decl
, /*defer_ok=*/true,
9292 /*expl_inst_class_mem_p=*/false);
9298 /* Indicate that the old function template is a partial
9300 DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (old_decl
))
9301 = new_friend_result_template_info
;
9303 gcc_assert (new_template
9304 == most_general_template (new_template
));
9305 gcc_assert (new_template
!= old_decl
);
9307 /* Reassign any specializations already in the hash table
9308 to the new more general template, and add the
9309 additional template args. */
9310 for (t
= DECL_TEMPLATE_INSTANTIATIONS (old_decl
);
9314 tree spec
= TREE_VALUE (t
);
9317 elt
.tmpl
= old_decl
;
9318 elt
.args
= DECL_TI_ARGS (spec
);
9319 elt
.spec
= NULL_TREE
;
9321 decl_specializations
->remove_elt (&elt
);
9324 = add_outermost_template_args (new_args
,
9325 DECL_TI_ARGS (spec
));
9327 register_specialization
9328 (spec
, new_template
, DECL_TI_ARGS (spec
), true, 0);
9331 DECL_TEMPLATE_INSTANTIATIONS (old_decl
) = NULL_TREE
;
9335 /* The information from NEW_FRIEND has been merged into OLD_DECL
9336 by duplicate_decls. */
9337 new_friend
= old_decl
;
9342 tree context
= DECL_CONTEXT (new_friend
);
9346 template <class T> class C {
9347 template <class U> friend void C1<U>::f (); // case 1
9348 friend void C2<T>::f (); // case 2
9350 we only need to make sure CONTEXT is a complete type for
9351 case 2. To distinguish between the two cases, we note that
9352 CONTEXT of case 1 remains dependent type after tsubst while
9353 this isn't true for case 2. */
9354 ++processing_template_decl
;
9355 dependent_p
= dependent_type_p (context
);
9356 --processing_template_decl
;
9359 && !complete_type_or_else (context
, NULL_TREE
))
9360 return error_mark_node
;
9362 if (COMPLETE_TYPE_P (context
))
9364 tree fn
= new_friend
;
9365 /* do_friend adds the TEMPLATE_DECL for any member friend
9366 template even if it isn't a member template, i.e.
9367 template <class T> friend A<T>::f();
9368 Look through it in that case. */
9369 if (TREE_CODE (fn
) == TEMPLATE_DECL
9370 && !PRIMARY_TEMPLATE_P (fn
))
9371 fn
= DECL_TEMPLATE_RESULT (fn
);
9372 /* Check to see that the declaration is really present, and,
9373 possibly obtain an improved declaration. */
9374 fn
= check_classfn (context
, fn
, NULL_TREE
);
9384 /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of
9385 template arguments, as for tsubst.
9387 Returns an appropriate tsubst'd friend type or error_mark_node on
9391 tsubst_friend_class (tree friend_tmpl
, tree args
)
9397 if (DECL_TEMPLATE_TEMPLATE_PARM_P (friend_tmpl
))
9399 tree t
= tsubst (TREE_TYPE (friend_tmpl
), args
, tf_none
, NULL_TREE
);
9400 return TREE_TYPE (t
);
9403 context
= CP_DECL_CONTEXT (friend_tmpl
);
9405 if (context
!= global_namespace
)
9407 if (TREE_CODE (context
) == NAMESPACE_DECL
)
9408 push_nested_namespace (context
);
9410 push_nested_class (tsubst (context
, args
, tf_none
, NULL_TREE
));
9413 /* Look for a class template declaration. We look for hidden names
9414 because two friend declarations of the same template are the
9415 same. For example, in:
9418 template <typename> friend class F;
9420 template <typename> struct B {
9421 template <typename> friend class F;
9424 both F templates are the same. */
9425 tmpl
= lookup_name_real (DECL_NAME (friend_tmpl
), 0, 0,
9426 /*block_p=*/true, 0, LOOKUP_HIDDEN
);
9428 /* But, if we don't find one, it might be because we're in a
9429 situation like this:
9437 Here, in the scope of (say) S<int>, `S' is bound to a TYPE_DECL
9438 for `S<int>', not the TEMPLATE_DECL. */
9439 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
9441 tmpl
= lookup_name_prefer_type (DECL_NAME (friend_tmpl
), 1);
9442 tmpl
= maybe_get_template_decl_from_type_decl (tmpl
);
9445 if (tmpl
&& DECL_CLASS_TEMPLATE_P (tmpl
))
9447 /* The friend template has already been declared. Just
9448 check to see that the declarations match, and install any new
9449 default parameters. We must tsubst the default parameters,
9450 of course. We only need the innermost template parameters
9451 because that is all that redeclare_class_template will look
9453 if (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (friend_tmpl
))
9454 > TMPL_ARGS_DEPTH (args
))
9457 location_t saved_input_location
;
9458 parms
= tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_tmpl
),
9459 args
, tf_warning_or_error
);
9461 saved_input_location
= input_location
;
9462 input_location
= DECL_SOURCE_LOCATION (friend_tmpl
);
9463 tree cons
= get_constraints (tmpl
);
9464 redeclare_class_template (TREE_TYPE (tmpl
), parms
, cons
);
9465 input_location
= saved_input_location
;
9469 friend_type
= TREE_TYPE (tmpl
);
9473 /* The friend template has not already been declared. In this
9474 case, the instantiation of the template class will cause the
9475 injection of this template into the global scope. */
9476 tmpl
= tsubst (friend_tmpl
, args
, tf_warning_or_error
, NULL_TREE
);
9477 if (tmpl
== error_mark_node
)
9478 return error_mark_node
;
9480 /* The new TMPL is not an instantiation of anything, so we
9481 forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE for
9482 the new type because that is supposed to be the corresponding
9483 template decl, i.e., TMPL. */
9484 DECL_USE_TEMPLATE (tmpl
) = 0;
9485 DECL_TEMPLATE_INFO (tmpl
) = NULL_TREE
;
9486 CLASSTYPE_USE_TEMPLATE (TREE_TYPE (tmpl
)) = 0;
9487 CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl
))
9488 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl
)));
9490 /* Inject this template into the global scope. */
9491 friend_type
= TREE_TYPE (pushdecl_top_level_maybe_friend (tmpl
, true));
9494 if (context
!= global_namespace
)
9496 if (TREE_CODE (context
) == NAMESPACE_DECL
)
9497 pop_nested_namespace (context
);
9499 pop_nested_class ();
9505 /* Returns zero if TYPE cannot be completed later due to circularity.
9506 Otherwise returns one. */
9509 can_complete_type_without_circularity (tree type
)
9511 if (type
== NULL_TREE
|| type
== error_mark_node
)
9513 else if (COMPLETE_TYPE_P (type
))
9515 else if (TREE_CODE (type
) == ARRAY_TYPE
&& TYPE_DOMAIN (type
))
9516 return can_complete_type_without_circularity (TREE_TYPE (type
));
9517 else if (CLASS_TYPE_P (type
)
9518 && TYPE_BEING_DEFINED (TYPE_MAIN_VARIANT (type
)))
9524 static tree
tsubst_omp_clauses (tree
, bool, bool, tree
, tsubst_flags_t
, tree
);
9526 /* Apply any attributes which had to be deferred until instantiation
9527 time. DECL_P, ATTRIBUTES and ATTR_FLAGS are as cplus_decl_attributes;
9528 ARGS, COMPLAIN, IN_DECL are as tsubst. */
9531 apply_late_template_attributes (tree
*decl_p
, tree attributes
, int attr_flags
,
9532 tree args
, tsubst_flags_t complain
, tree in_decl
)
9534 tree last_dep
= NULL_TREE
;
9538 for (t
= attributes
; t
; t
= TREE_CHAIN (t
))
9539 if (ATTR_IS_DEPENDENT (t
))
9542 attributes
= copy_list (attributes
);
9546 if (DECL_P (*decl_p
))
9548 if (TREE_TYPE (*decl_p
) == error_mark_node
)
9550 p
= &DECL_ATTRIBUTES (*decl_p
);
9553 p
= &TYPE_ATTRIBUTES (*decl_p
);
9557 tree late_attrs
= NULL_TREE
;
9558 tree
*q
= &late_attrs
;
9560 for (*p
= attributes
; *p
; )
9563 if (ATTR_IS_DEPENDENT (t
))
9565 *p
= TREE_CHAIN (t
);
9566 TREE_CHAIN (t
) = NULL_TREE
;
9567 if ((flag_openmp
|| flag_openmp_simd
|| flag_cilkplus
)
9568 && is_attribute_p ("omp declare simd",
9569 get_attribute_name (t
))
9572 tree clauses
= TREE_VALUE (TREE_VALUE (t
));
9573 clauses
= tsubst_omp_clauses (clauses
, true, false, args
,
9575 c_omp_declare_simd_clauses_to_decls (*decl_p
, clauses
);
9576 clauses
= finish_omp_clauses (clauses
, false, true);
9577 tree parms
= DECL_ARGUMENTS (*decl_p
);
9579 = c_omp_declare_simd_clauses_to_numbers (parms
, clauses
);
9581 TREE_VALUE (TREE_VALUE (t
)) = clauses
;
9583 TREE_VALUE (t
) = NULL_TREE
;
9585 /* If the first attribute argument is an identifier, don't
9586 pass it through tsubst. Attributes like mode, format,
9587 cleanup and several target specific attributes expect it
9589 else if (attribute_takes_identifier_p (get_attribute_name (t
))
9593 = tsubst_expr (TREE_CHAIN (TREE_VALUE (t
)), args
, complain
,
9595 /*integral_constant_expression_p=*/false);
9596 if (chain
!= TREE_CHAIN (TREE_VALUE (t
)))
9598 = tree_cons (NULL_TREE
, TREE_VALUE (TREE_VALUE (t
)),
9601 else if (TREE_VALUE (t
) && PACK_EXPANSION_P (TREE_VALUE (t
)))
9603 /* An attribute pack expansion. */
9604 tree purp
= TREE_PURPOSE (t
);
9605 tree pack
= (tsubst_pack_expansion
9606 (TREE_VALUE (t
), args
, complain
, in_decl
));
9607 int len
= TREE_VEC_LENGTH (pack
);
9608 for (int i
= 0; i
< len
; ++i
)
9610 tree elt
= TREE_VEC_ELT (pack
, i
);
9611 *q
= build_tree_list (purp
, elt
);
9612 q
= &TREE_CHAIN (*q
);
9618 = tsubst_expr (TREE_VALUE (t
), args
, complain
, in_decl
,
9619 /*integral_constant_expression_p=*/false);
9621 q
= &TREE_CHAIN (t
);
9624 p
= &TREE_CHAIN (t
);
9627 cplus_decl_attributes (decl_p
, late_attrs
, attr_flags
);
9631 /* Perform (or defer) access check for typedefs that were referenced
9632 from within the template TMPL code.
9633 This is a subroutine of instantiate_decl and instantiate_class_template.
9634 TMPL is the template to consider and TARGS is the list of arguments of
9638 perform_typedefs_access_check (tree tmpl
, tree targs
)
9640 location_t saved_location
;
9642 qualified_typedef_usage_t
*iter
;
9645 || (!CLASS_TYPE_P (tmpl
)
9646 && TREE_CODE (tmpl
) != FUNCTION_DECL
))
9649 saved_location
= input_location
;
9650 FOR_EACH_VEC_SAFE_ELT (get_types_needing_access_check (tmpl
), i
, iter
)
9652 tree type_decl
= iter
->typedef_decl
;
9653 tree type_scope
= iter
->context
;
9655 if (!type_decl
|| !type_scope
|| !CLASS_TYPE_P (type_scope
))
9658 if (uses_template_parms (type_decl
))
9659 type_decl
= tsubst (type_decl
, targs
, tf_error
, NULL_TREE
);
9660 if (uses_template_parms (type_scope
))
9661 type_scope
= tsubst (type_scope
, targs
, tf_error
, NULL_TREE
);
9663 /* Make access check error messages point to the location
9664 of the use of the typedef. */
9665 input_location
= iter
->locus
;
9666 perform_or_defer_access_check (TYPE_BINFO (type_scope
),
9667 type_decl
, type_decl
,
9668 tf_warning_or_error
);
9670 input_location
= saved_location
;
9674 instantiate_class_template_1 (tree type
)
9676 tree templ
, args
, pattern
, t
, member
;
9680 unsigned int saved_maximum_field_alignment
;
9683 if (type
== error_mark_node
)
9684 return error_mark_node
;
9686 if (COMPLETE_OR_OPEN_TYPE_P (type
)
9687 || uses_template_parms (type
))
9690 /* Figure out which template is being instantiated. */
9691 templ
= most_general_template (CLASSTYPE_TI_TEMPLATE (type
));
9692 gcc_assert (TREE_CODE (templ
) == TEMPLATE_DECL
);
9694 /* Determine what specialization of the original template to
9696 t
= most_specialized_partial_spec (type
, tf_warning_or_error
);
9697 if (t
== error_mark_node
)
9699 TYPE_BEING_DEFINED (type
) = 1;
9700 return error_mark_node
;
9704 /* This TYPE is actually an instantiation of a partial
9705 specialization. We replace the innermost set of ARGS with
9706 the arguments appropriate for substitution. For example,
9709 template <class T> struct S {};
9710 template <class T> struct S<T*> {};
9712 and supposing that we are instantiating S<int*>, ARGS will
9713 presently be {int*} -- but we need {int}. */
9714 pattern
= TREE_TYPE (t
);
9715 args
= TREE_PURPOSE (t
);
9719 pattern
= TREE_TYPE (templ
);
9720 args
= CLASSTYPE_TI_ARGS (type
);
9723 /* If the template we're instantiating is incomplete, then clearly
9724 there's nothing we can do. */
9725 if (!COMPLETE_TYPE_P (pattern
))
9728 /* If we've recursively instantiated too many templates, stop. */
9729 if (! push_tinst_level (type
))
9732 /* Now we're really doing the instantiation. Mark the type as in
9733 the process of being defined. */
9734 TYPE_BEING_DEFINED (type
) = 1;
9736 /* We may be in the middle of deferred access check. Disable
9738 push_deferring_access_checks (dk_no_deferred
);
9740 int saved_unevaluated_operand
= cp_unevaluated_operand
;
9741 int saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
9743 fn_context
= decl_function_context (TYPE_MAIN_DECL (type
));
9744 /* Also avoid push_to_top_level for a lambda in an NSDMI. */
9745 if (!fn_context
&& LAMBDA_TYPE_P (type
) && TYPE_CLASS_SCOPE_P (type
))
9746 fn_context
= error_mark_node
;
9748 push_to_top_level ();
9751 cp_unevaluated_operand
= 0;
9752 c_inhibit_evaluation_warnings
= 0;
9754 /* Use #pragma pack from the template context. */
9755 saved_maximum_field_alignment
= maximum_field_alignment
;
9756 maximum_field_alignment
= TYPE_PRECISION (pattern
);
9758 SET_CLASSTYPE_INTERFACE_UNKNOWN (type
);
9760 /* Set the input location to the most specialized template definition.
9761 This is needed if tsubsting causes an error. */
9762 typedecl
= TYPE_MAIN_DECL (pattern
);
9763 input_location
= DECL_SOURCE_LOCATION (TYPE_NAME (type
)) =
9764 DECL_SOURCE_LOCATION (typedecl
);
9766 TYPE_PACKED (type
) = TYPE_PACKED (pattern
);
9767 TYPE_ALIGN (type
) = TYPE_ALIGN (pattern
);
9768 TYPE_USER_ALIGN (type
) = TYPE_USER_ALIGN (pattern
);
9769 TYPE_FOR_JAVA (type
) = TYPE_FOR_JAVA (pattern
); /* For libjava's JArray<T> */
9770 if (ANON_AGGR_TYPE_P (pattern
))
9771 SET_ANON_AGGR_TYPE_P (type
);
9772 if (CLASSTYPE_VISIBILITY_SPECIFIED (pattern
))
9774 CLASSTYPE_VISIBILITY_SPECIFIED (type
) = 1;
9775 CLASSTYPE_VISIBILITY (type
) = CLASSTYPE_VISIBILITY (pattern
);
9776 /* Adjust visibility for template arguments. */
9777 determine_visibility (TYPE_MAIN_DECL (type
));
9779 if (CLASS_TYPE_P (type
))
9780 CLASSTYPE_FINAL (type
) = CLASSTYPE_FINAL (pattern
);
9782 pbinfo
= TYPE_BINFO (pattern
);
9784 /* We should never instantiate a nested class before its enclosing
9785 class; we need to look up the nested class by name before we can
9786 instantiate it, and that lookup should instantiate the enclosing
9788 gcc_assert (!DECL_CLASS_SCOPE_P (TYPE_MAIN_DECL (pattern
))
9789 || COMPLETE_OR_OPEN_TYPE_P (TYPE_CONTEXT (type
)));
9791 base_list
= NULL_TREE
;
9792 if (BINFO_N_BASE_BINFOS (pbinfo
))
9798 /* We must enter the scope containing the type, as that is where
9799 the accessibility of types named in dependent bases are
9801 pushed_scope
= push_scope (CP_TYPE_CONTEXT (type
));
9803 /* Substitute into each of the bases to determine the actual
9805 for (i
= 0; BINFO_BASE_ITERATE (pbinfo
, i
, pbase_binfo
); i
++)
9808 tree access
= BINFO_BASE_ACCESS (pbinfo
, i
);
9809 tree expanded_bases
= NULL_TREE
;
9812 if (PACK_EXPANSION_P (BINFO_TYPE (pbase_binfo
)))
9815 tsubst_pack_expansion (BINFO_TYPE (pbase_binfo
),
9816 args
, tf_error
, NULL_TREE
);
9817 if (expanded_bases
== error_mark_node
)
9820 len
= TREE_VEC_LENGTH (expanded_bases
);
9823 for (idx
= 0; idx
< len
; idx
++)
9826 /* Extract the already-expanded base class. */
9827 base
= TREE_VEC_ELT (expanded_bases
, idx
);
9829 /* Substitute to figure out the base class. */
9830 base
= tsubst (BINFO_TYPE (pbase_binfo
), args
, tf_error
,
9833 if (base
== error_mark_node
)
9836 base_list
= tree_cons (access
, base
, base_list
);
9837 if (BINFO_VIRTUAL_P (pbase_binfo
))
9838 TREE_TYPE (base_list
) = integer_type_node
;
9842 /* The list is now in reverse order; correct that. */
9843 base_list
= nreverse (base_list
);
9846 pop_scope (pushed_scope
);
9848 /* Now call xref_basetypes to set up all the base-class
9850 xref_basetypes (type
, base_list
);
9852 apply_late_template_attributes (&type
, TYPE_ATTRIBUTES (pattern
),
9853 (int) ATTR_FLAG_TYPE_IN_PLACE
,
9854 args
, tf_error
, NULL_TREE
);
9855 fixup_attribute_variants (type
);
9857 /* Now that our base classes are set up, enter the scope of the
9858 class, so that name lookups into base classes, etc. will work
9859 correctly. This is precisely analogous to what we do in
9860 begin_class_definition when defining an ordinary non-template
9861 class, except we also need to push the enclosing classes. */
9862 push_nested_class (type
);
9864 /* Now members are processed in the order of declaration. */
9865 for (member
= CLASSTYPE_DECL_LIST (pattern
);
9866 member
; member
= TREE_CHAIN (member
))
9868 tree t
= TREE_VALUE (member
);
9870 if (TREE_PURPOSE (member
))
9874 /* Build new CLASSTYPE_NESTED_UTDS. */
9877 bool class_template_p
;
9879 class_template_p
= (TREE_CODE (t
) != ENUMERAL_TYPE
9880 && TYPE_LANG_SPECIFIC (t
)
9881 && CLASSTYPE_IS_TEMPLATE (t
));
9882 /* If the member is a class template, then -- even after
9883 substitution -- there may be dependent types in the
9884 template argument list for the class. We increment
9885 PROCESSING_TEMPLATE_DECL so that dependent_type_p, as
9886 that function will assume that no types are dependent
9887 when outside of a template. */
9888 if (class_template_p
)
9889 ++processing_template_decl
;
9890 newtag
= tsubst (t
, args
, tf_error
, NULL_TREE
);
9891 if (class_template_p
)
9892 --processing_template_decl
;
9893 if (newtag
== error_mark_node
)
9896 if (TREE_CODE (newtag
) != ENUMERAL_TYPE
)
9898 tree name
= TYPE_IDENTIFIER (t
);
9900 if (class_template_p
)
9901 /* Unfortunately, lookup_template_class sets
9902 CLASSTYPE_IMPLICIT_INSTANTIATION for a partial
9903 instantiation (i.e., for the type of a member
9904 template class nested within a template class.)
9905 This behavior is required for
9906 maybe_process_partial_specialization to work
9907 correctly, but is not accurate in this case;
9908 the TAG is not an instantiation of anything.
9909 (The corresponding TEMPLATE_DECL is an
9910 instantiation, but the TYPE is not.) */
9911 CLASSTYPE_USE_TEMPLATE (newtag
) = 0;
9913 /* Now, we call pushtag to put this NEWTAG into the scope of
9914 TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid
9915 pushtag calling push_template_decl. We don't have to do
9916 this for enums because it will already have been done in
9919 SET_IDENTIFIER_TYPE_VALUE (name
, newtag
);
9920 pushtag (name
, newtag
, /*tag_scope=*/ts_current
);
9923 else if (DECL_DECLARES_FUNCTION_P (t
))
9925 /* Build new TYPE_METHODS. */
9928 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9929 ++processing_template_decl
;
9930 r
= tsubst (t
, args
, tf_error
, NULL_TREE
);
9931 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9932 --processing_template_decl
;
9933 set_current_access_from_decl (r
);
9934 finish_member_declaration (r
);
9935 /* Instantiate members marked with attribute used. */
9936 if (r
!= error_mark_node
&& DECL_PRESERVE_P (r
))
9938 if (TREE_CODE (r
) == FUNCTION_DECL
9939 && DECL_OMP_DECLARE_REDUCTION_P (r
))
9940 cp_check_omp_declare_reduction (r
);
9942 else if (DECL_CLASS_TEMPLATE_P (t
)
9943 && LAMBDA_TYPE_P (TREE_TYPE (t
)))
9944 /* A closure type for a lambda in a default argument for a
9945 member template. Ignore it; it will be instantiated with
9946 the default argument. */;
9949 /* Build new TYPE_FIELDS. */
9950 if (TREE_CODE (t
) == STATIC_ASSERT
)
9954 ++c_inhibit_evaluation_warnings
;
9956 tsubst_expr (STATIC_ASSERT_CONDITION (t
), args
,
9957 tf_warning_or_error
, NULL_TREE
,
9958 /*integral_constant_expression_p=*/true);
9959 --c_inhibit_evaluation_warnings
;
9961 finish_static_assert (condition
,
9962 STATIC_ASSERT_MESSAGE (t
),
9963 STATIC_ASSERT_SOURCE_LOCATION (t
),
9966 else if (TREE_CODE (t
) != CONST_DECL
)
9969 tree vec
= NULL_TREE
;
9972 /* The file and line for this declaration, to
9973 assist in error message reporting. Since we
9974 called push_tinst_level above, we don't need to
9976 input_location
= DECL_SOURCE_LOCATION (t
);
9978 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9979 ++processing_template_decl
;
9980 r
= tsubst (t
, args
, tf_warning_or_error
, NULL_TREE
);
9981 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9982 --processing_template_decl
;
9984 if (TREE_CODE (r
) == TREE_VEC
)
9986 /* A capture pack became multiple fields. */
9988 len
= TREE_VEC_LENGTH (vec
);
9991 for (int i
= 0; i
< len
; ++i
)
9994 r
= TREE_VEC_ELT (vec
, i
);
9999 [t]he initialization (and any associated
10000 side-effects) of a static data member does
10001 not occur unless the static data member is
10002 itself used in a way that requires the
10003 definition of the static data member to
10006 Therefore, we do not substitute into the
10007 initialized for the static data member here. */
10008 finish_static_data_member_decl
10010 /*init=*/NULL_TREE
,
10011 /*init_const_expr_p=*/false,
10012 /*asmspec_tree=*/NULL_TREE
,
10014 /* Instantiate members marked with attribute used. */
10015 if (r
!= error_mark_node
&& DECL_PRESERVE_P (r
))
10018 else if (TREE_CODE (r
) == FIELD_DECL
)
10020 /* Determine whether R has a valid type and can be
10021 completed later. If R is invalid, then its type
10022 is replaced by error_mark_node. */
10023 tree rtype
= TREE_TYPE (r
);
10024 if (can_complete_type_without_circularity (rtype
))
10025 complete_type (rtype
);
10027 if (!COMPLETE_TYPE_P (rtype
))
10029 cxx_incomplete_type_error (r
, rtype
);
10030 TREE_TYPE (r
) = error_mark_node
;
10034 /* If it is a TYPE_DECL for a class-scoped ENUMERAL_TYPE,
10035 such a thing will already have been added to the field
10036 list by tsubst_enum in finish_member_declaration in the
10037 CLASSTYPE_NESTED_UTDS case above. */
10038 if (!(TREE_CODE (r
) == TYPE_DECL
10039 && TREE_CODE (TREE_TYPE (r
)) == ENUMERAL_TYPE
10040 && DECL_ARTIFICIAL (r
)))
10042 set_current_access_from_decl (r
);
10043 finish_member_declaration (r
);
10051 if (TYPE_P (t
) || DECL_CLASS_TEMPLATE_P (t
)
10052 || DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
10054 /* Build new CLASSTYPE_FRIEND_CLASSES. */
10056 tree friend_type
= t
;
10057 bool adjust_processing_template_decl
= false;
10059 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
10061 /* template <class T> friend class C; */
10062 friend_type
= tsubst_friend_class (friend_type
, args
);
10063 adjust_processing_template_decl
= true;
10065 else if (TREE_CODE (friend_type
) == UNBOUND_CLASS_TEMPLATE
)
10067 /* template <class T> friend class C::D; */
10068 friend_type
= tsubst (friend_type
, args
,
10069 tf_warning_or_error
, NULL_TREE
);
10070 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
10071 friend_type
= TREE_TYPE (friend_type
);
10072 adjust_processing_template_decl
= true;
10074 else if (TREE_CODE (friend_type
) == TYPENAME_TYPE
10075 || TREE_CODE (friend_type
) == TEMPLATE_TYPE_PARM
)
10077 /* This could be either
10081 when dependent_type_p is false or
10083 template <class U> friend class T::C;
10086 friend_type
= tsubst (friend_type
, args
,
10087 tf_warning_or_error
, NULL_TREE
);
10088 /* Bump processing_template_decl for correct
10089 dependent_type_p calculation. */
10090 ++processing_template_decl
;
10091 if (dependent_type_p (friend_type
))
10092 adjust_processing_template_decl
= true;
10093 --processing_template_decl
;
10095 else if (!CLASSTYPE_USE_TEMPLATE (friend_type
)
10096 && hidden_name_p (TYPE_NAME (friend_type
)))
10100 where C hasn't been declared yet. Let's lookup name
10101 from namespace scope directly, bypassing any name that
10102 come from dependent base class. */
10103 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (friend_type
));
10105 /* The call to xref_tag_from_type does injection for friend
10107 push_nested_namespace (ns
);
10109 xref_tag_from_type (friend_type
, NULL_TREE
,
10110 /*tag_scope=*/ts_current
);
10111 pop_nested_namespace (ns
);
10113 else if (uses_template_parms (friend_type
))
10114 /* friend class C<T>; */
10115 friend_type
= tsubst (friend_type
, args
,
10116 tf_warning_or_error
, NULL_TREE
);
10121 where C is already declared or
10123 friend class C<int>;
10125 We don't have to do anything in these cases. */
10127 if (adjust_processing_template_decl
)
10128 /* Trick make_friend_class into realizing that the friend
10129 we're adding is a template, not an ordinary class. It's
10130 important that we use make_friend_class since it will
10131 perform some error-checking and output cross-reference
10133 ++processing_template_decl
;
10135 if (friend_type
!= error_mark_node
)
10136 make_friend_class (type
, friend_type
, /*complain=*/false);
10138 if (adjust_processing_template_decl
)
10139 --processing_template_decl
;
10143 /* Build new DECL_FRIENDLIST. */
10146 /* The file and line for this declaration, to
10147 assist in error message reporting. Since we
10148 called push_tinst_level above, we don't need to
10150 input_location
= DECL_SOURCE_LOCATION (t
);
10152 if (TREE_CODE (t
) == TEMPLATE_DECL
)
10154 ++processing_template_decl
;
10155 push_deferring_access_checks (dk_no_check
);
10158 r
= tsubst_friend_function (t
, args
);
10159 add_friend (type
, r
, /*complain=*/false);
10160 if (TREE_CODE (t
) == TEMPLATE_DECL
)
10162 pop_deferring_access_checks ();
10163 --processing_template_decl
;
10171 /* Restore these before substituting into the lambda capture
10173 cp_unevaluated_operand
= saved_unevaluated_operand
;
10174 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
10177 if (tree expr
= CLASSTYPE_LAMBDA_EXPR (type
))
10179 tree decl
= lambda_function (type
);
10182 if (!DECL_TEMPLATE_INFO (decl
)
10183 || DECL_TEMPLATE_RESULT (DECL_TI_TEMPLATE (decl
)) != decl
)
10184 instantiate_decl (decl
, false, false);
10186 /* We need to instantiate the capture list from the template
10187 after we've instantiated the closure members, but before we
10188 consider adding the conversion op. Also keep any captures
10189 that may have been added during instantiation of the op(). */
10190 tree tmpl_expr
= CLASSTYPE_LAMBDA_EXPR (pattern
);
10192 = tsubst_copy_and_build (LAMBDA_EXPR_CAPTURE_LIST (tmpl_expr
),
10193 args
, tf_warning_or_error
, NULL_TREE
,
10196 LAMBDA_EXPR_CAPTURE_LIST (expr
)
10197 = chainon (tmpl_cap
, nreverse (LAMBDA_EXPR_CAPTURE_LIST (expr
)));
10199 maybe_add_lambda_conv_op (type
);
10202 gcc_assert (errorcount
);
10205 /* Set the file and line number information to whatever is given for
10206 the class itself. This puts error messages involving generated
10207 implicit functions at a predictable point, and the same point
10208 that would be used for non-template classes. */
10209 input_location
= DECL_SOURCE_LOCATION (typedecl
);
10211 unreverse_member_declarations (type
);
10212 finish_struct_1 (type
);
10213 TYPE_BEING_DEFINED (type
) = 0;
10215 /* We don't instantiate default arguments for member functions. 14.7.1:
10217 The implicit instantiation of a class template specialization causes
10218 the implicit instantiation of the declarations, but not of the
10219 definitions or default arguments, of the class member functions,
10220 member classes, static data members and member templates.... */
10222 /* Some typedefs referenced from within the template code need to be access
10223 checked at template instantiation time, i.e now. These types were
10224 added to the template at parsing time. Let's get those and perform
10225 the access checks then. */
10226 perform_typedefs_access_check (pattern
, args
);
10227 perform_deferred_access_checks (tf_warning_or_error
);
10228 pop_nested_class ();
10229 maximum_field_alignment
= saved_maximum_field_alignment
;
10231 pop_from_top_level ();
10232 pop_deferring_access_checks ();
10233 pop_tinst_level ();
10235 /* The vtable for a template class can be emitted in any translation
10236 unit in which the class is instantiated. When there is no key
10237 method, however, finish_struct_1 will already have added TYPE to
10238 the keyed_classes list. */
10239 if (TYPE_CONTAINS_VPTR_P (type
) && CLASSTYPE_KEY_METHOD (type
))
10240 keyed_classes
= tree_cons (NULL_TREE
, type
, keyed_classes
);
10245 /* Wrapper for instantiate_class_template_1. */
10248 instantiate_class_template (tree type
)
10251 timevar_push (TV_TEMPLATE_INST
);
10252 ret
= instantiate_class_template_1 (type
);
10253 timevar_pop (TV_TEMPLATE_INST
);
10258 tsubst_template_arg (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
10264 else if (TYPE_P (t
))
10265 r
= tsubst (t
, args
, complain
, in_decl
);
10268 if (!(complain
& tf_warning
))
10269 ++c_inhibit_evaluation_warnings
;
10270 r
= tsubst_expr (t
, args
, complain
, in_decl
,
10271 /*integral_constant_expression_p=*/true);
10272 if (!(complain
& tf_warning
))
10273 --c_inhibit_evaluation_warnings
;
10278 /* Given a function parameter pack TMPL_PARM and some function parameters
10279 instantiated from it at *SPEC_P, return a NONTYPE_ARGUMENT_PACK of them
10280 and set *SPEC_P to point at the next point in the list. */
10283 extract_fnparm_pack (tree tmpl_parm
, tree
*spec_p
)
10285 /* Collect all of the extra "packed" parameters into an
10289 tree argpack
= make_node (NONTYPE_ARGUMENT_PACK
);
10290 tree argtypepack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
10291 tree spec_parm
= *spec_p
;
10294 for (len
= 0; spec_parm
; ++len
, spec_parm
= TREE_CHAIN (spec_parm
))
10296 && !function_parameter_expanded_from_pack_p (spec_parm
, tmpl_parm
))
10299 /* Fill in PARMVEC and PARMTYPEVEC with all of the parameters. */
10300 parmvec
= make_tree_vec (len
);
10301 parmtypevec
= make_tree_vec (len
);
10302 spec_parm
= *spec_p
;
10303 for (i
= 0; i
< len
; i
++, spec_parm
= DECL_CHAIN (spec_parm
))
10305 TREE_VEC_ELT (parmvec
, i
) = spec_parm
;
10306 TREE_VEC_ELT (parmtypevec
, i
) = TREE_TYPE (spec_parm
);
10309 /* Build the argument packs. */
10310 SET_ARGUMENT_PACK_ARGS (argpack
, parmvec
);
10311 SET_ARGUMENT_PACK_ARGS (argtypepack
, parmtypevec
);
10312 TREE_TYPE (argpack
) = argtypepack
;
10313 *spec_p
= spec_parm
;
10318 /* Give a chain SPEC_PARM of PARM_DECLs, pack them into a
10319 NONTYPE_ARGUMENT_PACK. */
10322 make_fnparm_pack (tree spec_parm
)
10324 return extract_fnparm_pack (NULL_TREE
, &spec_parm
);
10327 /* Return 1 if the Ith element of the argument pack ARG_PACK is a
10328 pack expansion with no extra args, 2 if it has extra args, or 0
10329 if it is not a pack expansion. */
10332 argument_pack_element_is_expansion_p (tree arg_pack
, int i
)
10334 tree vec
= ARGUMENT_PACK_ARGS (arg_pack
);
10335 if (i
>= TREE_VEC_LENGTH (vec
))
10337 tree elt
= TREE_VEC_ELT (vec
, i
);
10339 /* A decl pack is itself an expansion. */
10340 elt
= TREE_TYPE (elt
);
10341 if (!PACK_EXPANSION_P (elt
))
10343 if (PACK_EXPANSION_EXTRA_ARGS (elt
))
10349 /* Creates and return an ARGUMENT_PACK_SELECT tree node. */
10352 make_argument_pack_select (tree arg_pack
, unsigned index
)
10354 tree aps
= make_node (ARGUMENT_PACK_SELECT
);
10356 ARGUMENT_PACK_SELECT_FROM_PACK (aps
) = arg_pack
;
10357 ARGUMENT_PACK_SELECT_INDEX (aps
) = index
;
10362 /* This is a subroutine of tsubst_pack_expansion.
10364 It returns TRUE if we need to use the PACK_EXPANSION_EXTRA_ARGS
10365 mechanism to store the (non complete list of) arguments of the
10366 substitution and return a non substituted pack expansion, in order
10367 to wait for when we have enough arguments to really perform the
10371 use_pack_expansion_extra_args_p (tree parm_packs
,
10373 bool has_empty_arg
)
10375 /* If one pack has an expansion and another pack has a normal
10376 argument or if one pack has an empty argument and an another
10377 one hasn't then tsubst_pack_expansion cannot perform the
10378 substitution and need to fall back on the
10379 PACK_EXPANSION_EXTRA mechanism. */
10380 if (parm_packs
== NULL_TREE
)
10382 else if (has_empty_arg
)
10385 bool has_expansion_arg
= false;
10386 for (int i
= 0 ; i
< arg_pack_len
; ++i
)
10388 bool has_non_expansion_arg
= false;
10389 for (tree parm_pack
= parm_packs
;
10391 parm_pack
= TREE_CHAIN (parm_pack
))
10393 tree arg
= TREE_VALUE (parm_pack
);
10395 int exp
= argument_pack_element_is_expansion_p (arg
, i
);
10397 /* We can't substitute a pack expansion with extra args into
10401 has_expansion_arg
= true;
10403 has_non_expansion_arg
= true;
10406 if (has_expansion_arg
&& has_non_expansion_arg
)
10412 /* [temp.variadic]/6 says that:
10414 The instantiation of a pack expansion [...]
10415 produces a list E1,E2, ..., En, where N is the number of elements
10416 in the pack expansion parameters.
10418 This subroutine of tsubst_pack_expansion produces one of these Ei.
10420 PATTERN is the pattern of the pack expansion. PARM_PACKS is a
10421 TREE_LIST in which each TREE_PURPOSE is a parameter pack of
10422 PATTERN, and each TREE_VALUE is its corresponding argument pack.
10423 INDEX is the index 'i' of the element Ei to produce. ARGS,
10424 COMPLAIN, and IN_DECL are the same parameters as for the
10425 tsubst_pack_expansion function.
10427 The function returns the resulting Ei upon successful completion,
10428 or error_mark_node.
10430 Note that this function possibly modifies the ARGS parameter, so
10431 it's the responsibility of the caller to restore it. */
10434 gen_elem_of_pack_expansion_instantiation (tree pattern
,
10437 tree args
/* This parm gets
10439 tsubst_flags_t complain
,
10443 bool ith_elem_is_expansion
= false;
10445 /* For each parameter pack, change the substitution of the parameter
10446 pack to the ith argument in its argument pack, then expand the
10448 for (tree pack
= parm_packs
; pack
; pack
= TREE_CHAIN (pack
))
10450 tree parm
= TREE_PURPOSE (pack
);
10451 tree arg_pack
= TREE_VALUE (pack
);
10452 tree aps
; /* instance of ARGUMENT_PACK_SELECT. */
10454 ith_elem_is_expansion
|=
10455 argument_pack_element_is_expansion_p (arg_pack
, index
);
10457 /* Select the Ith argument from the pack. */
10458 if (TREE_CODE (parm
) == PARM_DECL
10459 || TREE_CODE (parm
) == FIELD_DECL
)
10463 aps
= make_argument_pack_select (arg_pack
, index
);
10464 if (!mark_used (parm
, complain
) && !(complain
& tf_error
))
10465 return error_mark_node
;
10466 register_local_specialization (aps
, parm
);
10469 aps
= retrieve_local_specialization (parm
);
10474 template_parm_level_and_index (parm
, &level
, &idx
);
10478 aps
= make_argument_pack_select (arg_pack
, index
);
10479 /* Update the corresponding argument. */
10480 TMPL_ARG (args
, level
, idx
) = aps
;
10483 /* Re-use the ARGUMENT_PACK_SELECT. */
10484 aps
= TMPL_ARG (args
, level
, idx
);
10486 ARGUMENT_PACK_SELECT_INDEX (aps
) = index
;
10489 /* Substitute into the PATTERN with the (possibly altered)
10491 if (pattern
== in_decl
)
10492 /* Expanding a fixed parameter pack from
10493 coerce_template_parameter_pack. */
10494 t
= tsubst_decl (pattern
, args
, complain
);
10495 else if (pattern
== error_mark_node
)
10496 t
= error_mark_node
;
10497 else if (constraint_p (pattern
))
10499 if (processing_template_decl
)
10500 t
= tsubst_constraint (pattern
, args
, complain
, in_decl
);
10502 t
= (constraints_satisfied_p (pattern
, args
)
10503 ? boolean_true_node
: boolean_false_node
);
10505 else if (!TYPE_P (pattern
))
10506 t
= tsubst_expr (pattern
, args
, complain
, in_decl
,
10507 /*integral_constant_expression_p=*/false);
10509 t
= tsubst (pattern
, args
, complain
, in_decl
);
10511 /* If the Ith argument pack element is a pack expansion, then
10512 the Ith element resulting from the substituting is going to
10513 be a pack expansion as well. */
10514 if (ith_elem_is_expansion
)
10515 t
= make_pack_expansion (t
);
10520 /* When the unexpanded parameter pack in a fold expression expands to an empty
10521 sequence, the value of the expression is as follows; the program is
10522 ill-formed if the operator is not listed in this table.
10533 expand_empty_fold (tree t
, tsubst_flags_t complain
)
10535 tree_code code
= (tree_code
)TREE_INT_CST_LOW (TREE_OPERAND (t
, 0));
10536 if (!FOLD_EXPR_MODIFY_P (t
))
10540 return integer_one_node
;
10542 return integer_zero_node
;
10544 return integer_minus_one_node
;
10546 return integer_zero_node
;
10547 case TRUTH_ANDIF_EXPR
:
10548 return boolean_true_node
;
10549 case TRUTH_ORIF_EXPR
:
10550 return boolean_false_node
;
10551 case COMPOUND_EXPR
:
10557 if (complain
& tf_error
)
10558 error_at (location_of (t
),
10559 "fold of empty expansion over %O", code
);
10560 return error_mark_node
;
10563 /* Given a fold-expression T and a current LEFT and RIGHT operand,
10564 form an expression that combines the two terms using the
10568 fold_expression (tree t
, tree left
, tree right
, tsubst_flags_t complain
)
10570 tree op
= FOLD_EXPR_OP (t
);
10571 tree_code code
= (tree_code
)TREE_INT_CST_LOW (op
);
10573 // Handle compound assignment operators.
10574 if (FOLD_EXPR_MODIFY_P (t
))
10575 return build_x_modify_expr (input_location
, left
, code
, right
, complain
);
10579 case COMPOUND_EXPR
:
10580 return build_x_compound_expr (input_location
, left
, right
, complain
);
10582 return build_m_component_ref (left
, right
, complain
);
10584 return build_x_binary_op (input_location
, code
,
10585 left
, TREE_CODE (left
),
10586 right
, TREE_CODE (right
),
10592 /* Substitute ARGS into the pack of a fold expression T. */
10595 tsubst_fold_expr_pack (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
10597 return tsubst_pack_expansion (FOLD_EXPR_PACK (t
), args
, complain
, in_decl
);
10600 /* Substitute ARGS into the pack of a fold expression T. */
10603 tsubst_fold_expr_init (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
10605 return tsubst_expr (FOLD_EXPR_INIT (t
), args
, complain
, in_decl
, false);
10608 /* Expand a PACK of arguments into a grouped as left fold.
10609 Given a pack containing elements A0, A1, ..., An and an
10610 operator @, this builds the expression:
10612 ((A0 @ A1) @ A2) ... @ An
10614 Note that PACK must not be empty.
10616 The operator is defined by the original fold expression T. */
10619 expand_left_fold (tree t
, tree pack
, tsubst_flags_t complain
)
10621 tree left
= TREE_VEC_ELT (pack
, 0);
10622 for (int i
= 1; i
< TREE_VEC_LENGTH (pack
); ++i
)
10624 tree right
= TREE_VEC_ELT (pack
, i
);
10625 left
= fold_expression (t
, left
, right
, complain
);
10630 /* Substitute into a unary left fold expression. */
10633 tsubst_unary_left_fold (tree t
, tree args
, tsubst_flags_t complain
,
10636 tree pack
= tsubst_fold_expr_pack (t
, args
, complain
, in_decl
);
10637 if (pack
== error_mark_node
)
10638 return error_mark_node
;
10639 if (TREE_VEC_LENGTH (pack
) == 0)
10640 return expand_empty_fold (t
, complain
);
10642 return expand_left_fold (t
, pack
, complain
);
10645 /* Substitute into a binary left fold expression.
10647 Do ths by building a single (non-empty) vector of argumnts and
10648 building the expression from those elements. */
10651 tsubst_binary_left_fold (tree t
, tree args
, tsubst_flags_t complain
,
10654 tree pack
= tsubst_fold_expr_pack (t
, args
, complain
, in_decl
);
10655 if (pack
== error_mark_node
)
10656 return error_mark_node
;
10657 tree init
= tsubst_fold_expr_init (t
, args
, complain
, in_decl
);
10658 if (init
== error_mark_node
)
10659 return error_mark_node
;
10661 tree vec
= make_tree_vec (TREE_VEC_LENGTH (pack
) + 1);
10662 TREE_VEC_ELT (vec
, 0) = init
;
10663 for (int i
= 0; i
< TREE_VEC_LENGTH (pack
); ++i
)
10664 TREE_VEC_ELT (vec
, i
+ 1) = TREE_VEC_ELT (pack
, i
);
10666 return expand_left_fold (t
, vec
, complain
);
10669 /* Expand a PACK of arguments into a grouped as right fold.
10670 Given a pack containing elementns A0, A1, ..., and an
10671 operator @, this builds the expression:
10673 A0@ ... (An-2 @ (An-1 @ An))
10675 Note that PACK must not be empty.
10677 The operator is defined by the original fold expression T. */
10680 expand_right_fold (tree t
, tree pack
, tsubst_flags_t complain
)
10682 // Build the expression.
10683 int n
= TREE_VEC_LENGTH (pack
);
10684 tree right
= TREE_VEC_ELT (pack
, n
- 1);
10685 for (--n
; n
!= 0; --n
)
10687 tree left
= TREE_VEC_ELT (pack
, n
- 1);
10688 right
= fold_expression (t
, left
, right
, complain
);
10693 /* Substitute into a unary right fold expression. */
10696 tsubst_unary_right_fold (tree t
, tree args
, tsubst_flags_t complain
,
10699 tree pack
= tsubst_fold_expr_pack (t
, args
, complain
, in_decl
);
10700 if (pack
== error_mark_node
)
10701 return error_mark_node
;
10702 if (TREE_VEC_LENGTH (pack
) == 0)
10703 return expand_empty_fold (t
, complain
);
10705 return expand_right_fold (t
, pack
, complain
);
10708 /* Substitute into a binary right fold expression.
10710 Do ths by building a single (non-empty) vector of arguments and
10711 building the expression from those elements. */
10714 tsubst_binary_right_fold (tree t
, tree args
, tsubst_flags_t complain
,
10717 tree pack
= tsubst_fold_expr_pack (t
, args
, complain
, in_decl
);
10718 if (pack
== error_mark_node
)
10719 return error_mark_node
;
10720 tree init
= tsubst_fold_expr_init (t
, args
, complain
, in_decl
);
10721 if (init
== error_mark_node
)
10722 return error_mark_node
;
10724 int n
= TREE_VEC_LENGTH (pack
);
10725 tree vec
= make_tree_vec (n
+ 1);
10726 for (int i
= 0; i
< n
; ++i
)
10727 TREE_VEC_ELT (vec
, i
) = TREE_VEC_ELT (pack
, i
);
10728 TREE_VEC_ELT (vec
, n
) = init
;
10730 return expand_right_fold (t
, vec
, complain
);
10734 /* Substitute ARGS into T, which is an pack expansion
10735 (i.e. TYPE_PACK_EXPANSION or EXPR_PACK_EXPANSION). Returns a
10736 TREE_VEC with the substituted arguments, a PACK_EXPANSION_* node
10737 (if only a partial substitution could be performed) or
10738 ERROR_MARK_NODE if there was an error. */
10740 tsubst_pack_expansion (tree t
, tree args
, tsubst_flags_t complain
,
10744 tree pack
, packs
= NULL_TREE
;
10745 bool unsubstituted_packs
= false;
10748 hash_map
<tree
, tree
> *saved_local_specializations
= NULL
;
10749 bool need_local_specializations
= false;
10752 gcc_assert (PACK_EXPANSION_P (t
));
10753 pattern
= PACK_EXPANSION_PATTERN (t
);
10755 /* Add in any args remembered from an earlier partial instantiation. */
10756 args
= add_to_template_args (PACK_EXPANSION_EXTRA_ARGS (t
), args
);
10758 levels
= TMPL_ARGS_DEPTH (args
);
10760 /* Determine the argument packs that will instantiate the parameter
10761 packs used in the expansion expression. While we're at it,
10762 compute the number of arguments to be expanded and make sure it
10764 for (pack
= PACK_EXPANSION_PARAMETER_PACKS (t
); pack
;
10765 pack
= TREE_CHAIN (pack
))
10767 tree parm_pack
= TREE_VALUE (pack
);
10768 tree arg_pack
= NULL_TREE
;
10769 tree orig_arg
= NULL_TREE
;
10772 if (TREE_CODE (parm_pack
) == BASES
)
10774 if (BASES_DIRECT (parm_pack
))
10775 return calculate_direct_bases (tsubst_expr (BASES_TYPE (parm_pack
),
10776 args
, complain
, in_decl
, false));
10778 return calculate_bases (tsubst_expr (BASES_TYPE (parm_pack
),
10779 args
, complain
, in_decl
, false));
10781 if (TREE_CODE (parm_pack
) == PARM_DECL
)
10783 /* We know we have correct local_specializations if this
10784 expansion is at function scope, or if we're dealing with a
10785 local parameter in a requires expression; for the latter,
10786 tsubst_requires_expr set it up appropriately. */
10787 if (PACK_EXPANSION_LOCAL_P (t
) || CONSTRAINT_VAR_P (parm_pack
))
10788 arg_pack
= retrieve_local_specialization (parm_pack
);
10791 /* We can't rely on local_specializations for a parameter
10792 name used later in a function declaration (such as in a
10793 late-specified return type). Even if it exists, it might
10794 have the wrong value for a recursive call. Just make a
10795 dummy decl, since it's only used for its type. */
10796 arg_pack
= tsubst_decl (parm_pack
, args
, complain
);
10797 if (arg_pack
&& DECL_PACK_P (arg_pack
))
10798 /* Partial instantiation of the parm_pack, we can't build
10799 up an argument pack yet. */
10800 arg_pack
= NULL_TREE
;
10802 arg_pack
= make_fnparm_pack (arg_pack
);
10803 need_local_specializations
= true;
10806 else if (TREE_CODE (parm_pack
) == FIELD_DECL
)
10807 arg_pack
= tsubst_copy (parm_pack
, args
, complain
, in_decl
);
10811 template_parm_level_and_index (parm_pack
, &level
, &idx
);
10813 if (level
<= levels
)
10814 arg_pack
= TMPL_ARG (args
, level
, idx
);
10817 orig_arg
= arg_pack
;
10818 if (arg_pack
&& TREE_CODE (arg_pack
) == ARGUMENT_PACK_SELECT
)
10819 arg_pack
= ARGUMENT_PACK_SELECT_FROM_PACK (arg_pack
);
10821 if (arg_pack
&& !ARGUMENT_PACK_P (arg_pack
))
10822 /* This can only happen if we forget to expand an argument
10823 pack somewhere else. Just return an error, silently. */
10825 result
= make_tree_vec (1);
10826 TREE_VEC_ELT (result
, 0) = error_mark_node
;
10833 TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg_pack
));
10835 /* Don't bother trying to do a partial substitution with
10836 incomplete packs; we'll try again after deduction. */
10837 if (ARGUMENT_PACK_INCOMPLETE_P (arg_pack
))
10842 else if (len
!= my_len
)
10844 if (!(complain
& tf_error
))
10845 /* Fail quietly. */;
10846 else if (TREE_CODE (t
) == TYPE_PACK_EXPANSION
)
10847 error ("mismatched argument pack lengths while expanding "
10851 error ("mismatched argument pack lengths while expanding "
10854 return error_mark_node
;
10857 /* Keep track of the parameter packs and their corresponding
10859 packs
= tree_cons (parm_pack
, arg_pack
, packs
);
10860 TREE_TYPE (packs
) = orig_arg
;
10864 /* We can't substitute for this parameter pack. We use a flag as
10865 well as the missing_level counter because function parameter
10866 packs don't have a level. */
10867 unsubstituted_packs
= true;
10871 /* If the expansion is just T..., return the matching argument pack. */
10872 if (!unsubstituted_packs
10873 && TREE_PURPOSE (packs
) == pattern
)
10875 tree args
= ARGUMENT_PACK_ARGS (TREE_VALUE (packs
));
10876 if (TREE_CODE (t
) == TYPE_PACK_EXPANSION
10877 || pack_expansion_args_count (args
))
10879 /* Otherwise use the normal path so we get convert_from_reference. */
10882 /* We cannot expand this expansion expression, because we don't have
10883 all of the argument packs we need. */
10884 if (use_pack_expansion_extra_args_p (packs
, len
, unsubstituted_packs
))
10886 /* We got some full packs, but we can't substitute them in until we
10887 have values for all the packs. So remember these until then. */
10889 t
= make_pack_expansion (pattern
);
10890 PACK_EXPANSION_EXTRA_ARGS (t
) = args
;
10893 else if (unsubstituted_packs
)
10895 /* There were no real arguments, we're just replacing a parameter
10896 pack with another version of itself. Substitute into the
10897 pattern and return a PACK_EXPANSION_*. The caller will need to
10899 if (TREE_CODE (t
) == EXPR_PACK_EXPANSION
)
10900 t
= tsubst_expr (pattern
, args
, complain
, in_decl
,
10901 /*integral_constant_expression_p=*/false);
10903 t
= tsubst (pattern
, args
, complain
, in_decl
);
10904 t
= make_pack_expansion (t
);
10908 gcc_assert (len
>= 0);
10910 if (need_local_specializations
)
10912 /* We're in a late-specified return type, so create our own local
10913 specializations map; the current map is either NULL or (in the
10914 case of recursive unification) might have bindings that we don't
10915 want to use or alter. */
10916 saved_local_specializations
= local_specializations
;
10917 local_specializations
= new hash_map
<tree
, tree
>;
10920 /* For each argument in each argument pack, substitute into the
10922 result
= make_tree_vec (len
);
10923 for (i
= 0; i
< len
; ++i
)
10925 t
= gen_elem_of_pack_expansion_instantiation (pattern
, packs
,
10929 TREE_VEC_ELT (result
, i
) = t
;
10930 if (t
== error_mark_node
)
10932 result
= error_mark_node
;
10937 /* Update ARGS to restore the substitution from parameter packs to
10938 their argument packs. */
10939 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
10941 tree parm
= TREE_PURPOSE (pack
);
10943 if (TREE_CODE (parm
) == PARM_DECL
10944 || TREE_CODE (parm
) == FIELD_DECL
)
10945 register_local_specialization (TREE_TYPE (pack
), parm
);
10950 if (TREE_VALUE (pack
) == NULL_TREE
)
10953 template_parm_level_and_index (parm
, &level
, &idx
);
10955 /* Update the corresponding argument. */
10956 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
10957 TREE_VEC_ELT (TREE_VEC_ELT (args
, level
-1 ), idx
) =
10960 TREE_VEC_ELT (args
, idx
) = TREE_TYPE (pack
);
10964 if (need_local_specializations
)
10966 delete local_specializations
;
10967 local_specializations
= saved_local_specializations
;
10973 /* Given PARM_DECL PARM, find the corresponding PARM_DECL in the template
10974 TMPL. We do this using DECL_PARM_INDEX, which should work even with
10975 parameter packs; all parms generated from a function parameter pack will
10976 have the same DECL_PARM_INDEX. */
10979 get_pattern_parm (tree parm
, tree tmpl
)
10981 tree pattern
= DECL_TEMPLATE_RESULT (tmpl
);
10984 if (DECL_ARTIFICIAL (parm
))
10986 for (patparm
= DECL_ARGUMENTS (pattern
);
10987 patparm
; patparm
= DECL_CHAIN (patparm
))
10988 if (DECL_ARTIFICIAL (patparm
)
10989 && DECL_NAME (parm
) == DECL_NAME (patparm
))
10994 patparm
= FUNCTION_FIRST_USER_PARM (DECL_TEMPLATE_RESULT (tmpl
));
10995 patparm
= chain_index (DECL_PARM_INDEX (parm
)-1, patparm
);
10996 gcc_assert (DECL_PARM_INDEX (patparm
)
10997 == DECL_PARM_INDEX (parm
));
11003 /* Substitute ARGS into the vector or list of template arguments T. */
11006 tsubst_template_args (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
11009 int len
, need_new
= 0, i
, expanded_len_adjust
= 0, out
;
11012 if (t
== error_mark_node
)
11013 return error_mark_node
;
11015 len
= TREE_VEC_LENGTH (t
);
11016 elts
= XALLOCAVEC (tree
, len
);
11018 for (i
= 0; i
< len
; i
++)
11020 tree orig_arg
= TREE_VEC_ELT (t
, i
);
11023 if (TREE_CODE (orig_arg
) == TREE_VEC
)
11024 new_arg
= tsubst_template_args (orig_arg
, args
, complain
, in_decl
);
11025 else if (PACK_EXPANSION_P (orig_arg
))
11027 /* Substitute into an expansion expression. */
11028 new_arg
= tsubst_pack_expansion (orig_arg
, args
, complain
, in_decl
);
11030 if (TREE_CODE (new_arg
) == TREE_VEC
)
11031 /* Add to the expanded length adjustment the number of
11032 expanded arguments. We subtract one from this
11033 measurement, because the argument pack expression
11034 itself is already counted as 1 in
11035 LEN. EXPANDED_LEN_ADJUST can actually be negative, if
11036 the argument pack is empty. */
11037 expanded_len_adjust
+= TREE_VEC_LENGTH (new_arg
) - 1;
11039 else if (ARGUMENT_PACK_P (orig_arg
))
11041 /* Substitute into each of the arguments. */
11042 new_arg
= TYPE_P (orig_arg
)
11043 ? cxx_make_type (TREE_CODE (orig_arg
))
11044 : make_node (TREE_CODE (orig_arg
));
11046 SET_ARGUMENT_PACK_ARGS (
11048 tsubst_template_args (ARGUMENT_PACK_ARGS (orig_arg
),
11049 args
, complain
, in_decl
));
11051 if (ARGUMENT_PACK_ARGS (new_arg
) == error_mark_node
)
11052 new_arg
= error_mark_node
;
11054 if (TREE_CODE (new_arg
) == NONTYPE_ARGUMENT_PACK
) {
11055 TREE_TYPE (new_arg
) = tsubst (TREE_TYPE (orig_arg
), args
,
11056 complain
, in_decl
);
11057 TREE_CONSTANT (new_arg
) = TREE_CONSTANT (orig_arg
);
11059 if (TREE_TYPE (new_arg
) == error_mark_node
)
11060 new_arg
= error_mark_node
;
11064 new_arg
= tsubst_template_arg (orig_arg
, args
, complain
, in_decl
);
11066 if (new_arg
== error_mark_node
)
11067 return error_mark_node
;
11070 if (new_arg
!= orig_arg
)
11077 /* Make space for the expanded arguments coming from template
11079 t
= make_tree_vec (len
+ expanded_len_adjust
);
11080 /* ORIG_T can contain TREE_VECs. That happens if ORIG_T contains the
11081 arguments for a member template.
11082 In that case each TREE_VEC in ORIG_T represents a level of template
11083 arguments, and ORIG_T won't carry any non defaulted argument count.
11084 It will rather be the nested TREE_VECs that will carry one.
11085 In other words, ORIG_T carries a non defaulted argument count only
11086 if it doesn't contain any nested TREE_VEC. */
11087 if (NON_DEFAULT_TEMPLATE_ARGS_COUNT (orig_t
))
11089 int count
= GET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (orig_t
);
11090 count
+= expanded_len_adjust
;
11091 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (t
, count
);
11093 for (i
= 0, out
= 0; i
< len
; i
++)
11095 if ((PACK_EXPANSION_P (TREE_VEC_ELT (orig_t
, i
))
11096 || ARGUMENT_PACK_P (TREE_VEC_ELT (orig_t
, i
)))
11097 && TREE_CODE (elts
[i
]) == TREE_VEC
)
11101 /* Now expand the template argument pack "in place". */
11102 for (idx
= 0; idx
< TREE_VEC_LENGTH (elts
[i
]); idx
++, out
++)
11103 TREE_VEC_ELT (t
, out
) = TREE_VEC_ELT (elts
[i
], idx
);
11107 TREE_VEC_ELT (t
, out
) = elts
[i
];
11115 /* Return the result of substituting ARGS into the template parameters
11116 given by PARMS. If there are m levels of ARGS and m + n levels of
11117 PARMS, then the result will contain n levels of PARMS. For
11118 example, if PARMS is `template <class T> template <class U>
11119 template <T*, U, class V>' and ARGS is {{int}, {double}} then the
11120 result will be `template <int*, double, class V>'. */
11123 tsubst_template_parms (tree parms
, tree args
, tsubst_flags_t complain
)
11125 tree r
= NULL_TREE
;
11128 /* When substituting into a template, we must set
11129 PROCESSING_TEMPLATE_DECL as the template parameters may be
11130 dependent if they are based on one-another, and the dependency
11131 predicates are short-circuit outside of templates. */
11132 ++processing_template_decl
;
11134 for (new_parms
= &r
;
11135 parms
&& TMPL_PARMS_DEPTH (parms
) > TMPL_ARGS_DEPTH (args
);
11136 new_parms
= &(TREE_CHAIN (*new_parms
)),
11137 parms
= TREE_CHAIN (parms
))
11140 make_tree_vec (TREE_VEC_LENGTH (TREE_VALUE (parms
)));
11143 for (i
= 0; i
< TREE_VEC_LENGTH (new_vec
); ++i
)
11147 if (parms
== error_mark_node
)
11150 tuple
= TREE_VEC_ELT (TREE_VALUE (parms
), i
);
11152 if (tuple
== error_mark_node
)
11155 TREE_VEC_ELT (new_vec
, i
) =
11156 tsubst_template_parm (tuple
, args
, complain
);
11160 tree_cons (size_int (TMPL_PARMS_DEPTH (parms
)
11161 - TMPL_ARGS_DEPTH (args
)),
11162 new_vec
, NULL_TREE
);
11165 --processing_template_decl
;
11170 /* Return the result of substituting ARGS into one template parameter
11171 given by T. T Must be a TREE_LIST which TREE_VALUE is the template
11172 parameter and which TREE_PURPOSE is the default argument of the
11173 template parameter. */
11176 tsubst_template_parm (tree t
, tree args
, tsubst_flags_t complain
)
11178 tree default_value
, parm_decl
;
11180 if (args
== NULL_TREE
11182 || t
== error_mark_node
)
11185 gcc_assert (TREE_CODE (t
) == TREE_LIST
);
11187 default_value
= TREE_PURPOSE (t
);
11188 parm_decl
= TREE_VALUE (t
);
11190 parm_decl
= tsubst (parm_decl
, args
, complain
, NULL_TREE
);
11191 if (TREE_CODE (parm_decl
) == PARM_DECL
11192 && invalid_nontype_parm_type_p (TREE_TYPE (parm_decl
), complain
))
11193 parm_decl
= error_mark_node
;
11194 default_value
= tsubst_template_arg (default_value
, args
,
11195 complain
, NULL_TREE
);
11197 return build_tree_list (default_value
, parm_decl
);
11200 /* Substitute the ARGS into the indicated aggregate (or enumeration)
11201 type T. If T is not an aggregate or enumeration type, it is
11202 handled as if by tsubst. IN_DECL is as for tsubst. If
11203 ENTERING_SCOPE is nonzero, T is the context for a template which
11204 we are presently tsubst'ing. Return the substituted value. */
11207 tsubst_aggr_type (tree t
,
11209 tsubst_flags_t complain
,
11211 int entering_scope
)
11213 if (t
== NULL_TREE
)
11216 switch (TREE_CODE (t
))
11219 if (TYPE_PTRMEMFUNC_P (t
))
11220 return tsubst (TYPE_PTRMEMFUNC_FN_TYPE (t
), args
, complain
, in_decl
);
11222 /* Else fall through. */
11223 case ENUMERAL_TYPE
:
11225 if (TYPE_TEMPLATE_INFO (t
) && uses_template_parms (t
))
11230 int saved_unevaluated_operand
;
11231 int saved_inhibit_evaluation_warnings
;
11233 /* In "sizeof(X<I>)" we need to evaluate "I". */
11234 saved_unevaluated_operand
= cp_unevaluated_operand
;
11235 cp_unevaluated_operand
= 0;
11236 saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
11237 c_inhibit_evaluation_warnings
= 0;
11239 /* First, determine the context for the type we are looking
11241 context
= TYPE_CONTEXT (t
);
11242 if (context
&& TYPE_P (context
))
11244 context
= tsubst_aggr_type (context
, args
, complain
,
11245 in_decl
, /*entering_scope=*/1);
11246 /* If context is a nested class inside a class template,
11247 it may still need to be instantiated (c++/33959). */
11248 context
= complete_type (context
);
11251 /* Then, figure out what arguments are appropriate for the
11252 type we are trying to find. For example, given:
11254 template <class T> struct S;
11255 template <class T, class U> void f(T, U) { S<U> su; }
11257 and supposing that we are instantiating f<int, double>,
11258 then our ARGS will be {int, double}, but, when looking up
11259 S we only want {double}. */
11260 argvec
= tsubst_template_args (TYPE_TI_ARGS (t
), args
,
11261 complain
, in_decl
);
11262 if (argvec
== error_mark_node
)
11263 r
= error_mark_node
;
11266 r
= lookup_template_class (t
, argvec
, in_decl
, context
,
11267 entering_scope
, complain
);
11268 r
= cp_build_qualified_type_real (r
, cp_type_quals (t
), complain
);
11271 cp_unevaluated_operand
= saved_unevaluated_operand
;
11272 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
11277 /* This is not a template type, so there's nothing to do. */
11281 return tsubst (t
, args
, complain
, in_decl
);
11285 /* Substitute into the default argument ARG (a default argument for
11286 FN), which has the indicated TYPE. */
11289 tsubst_default_argument (tree fn
, tree type
, tree arg
, tsubst_flags_t complain
)
11291 tree saved_class_ptr
= NULL_TREE
;
11292 tree saved_class_ref
= NULL_TREE
;
11293 int errs
= errorcount
+ sorrycount
;
11295 /* This can happen in invalid code. */
11296 if (TREE_CODE (arg
) == DEFAULT_ARG
)
11299 /* This default argument came from a template. Instantiate the
11300 default argument here, not in tsubst. In the case of
11309 we must be careful to do name lookup in the scope of S<T>,
11310 rather than in the current class. */
11311 push_access_scope (fn
);
11312 /* The "this" pointer is not valid in a default argument. */
11315 saved_class_ptr
= current_class_ptr
;
11316 cp_function_chain
->x_current_class_ptr
= NULL_TREE
;
11317 saved_class_ref
= current_class_ref
;
11318 cp_function_chain
->x_current_class_ref
= NULL_TREE
;
11321 push_deferring_access_checks(dk_no_deferred
);
11322 /* The default argument expression may cause implicitly defined
11323 member functions to be synthesized, which will result in garbage
11324 collection. We must treat this situation as if we were within
11325 the body of function so as to avoid collecting live data on the
11328 arg
= tsubst_expr (arg
, DECL_TI_ARGS (fn
),
11329 complain
, NULL_TREE
,
11330 /*integral_constant_expression_p=*/false);
11332 pop_deferring_access_checks();
11334 /* Restore the "this" pointer. */
11337 cp_function_chain
->x_current_class_ptr
= saved_class_ptr
;
11338 cp_function_chain
->x_current_class_ref
= saved_class_ref
;
11341 if (errorcount
+sorrycount
> errs
11342 && (complain
& tf_warning_or_error
))
11343 inform (input_location
,
11344 " when instantiating default argument for call to %D", fn
);
11346 /* Make sure the default argument is reasonable. */
11347 arg
= check_default_argument (type
, arg
, complain
);
11349 pop_access_scope (fn
);
11354 /* Substitute into all the default arguments for FN. */
11357 tsubst_default_arguments (tree fn
, tsubst_flags_t complain
)
11362 tmpl_args
= DECL_TI_ARGS (fn
);
11364 /* If this function is not yet instantiated, we certainly don't need
11365 its default arguments. */
11366 if (uses_template_parms (tmpl_args
))
11368 /* Don't do this again for clones. */
11369 if (DECL_CLONED_FUNCTION_P (fn
))
11372 for (arg
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
11374 arg
= TREE_CHAIN (arg
))
11375 if (TREE_PURPOSE (arg
))
11376 TREE_PURPOSE (arg
) = tsubst_default_argument (fn
,
11378 TREE_PURPOSE (arg
),
11382 /* Substitute the ARGS into the T, which is a _DECL. Return the
11383 result of the substitution. Issue error and warning messages under
11384 control of COMPLAIN. */
11387 tsubst_decl (tree t
, tree args
, tsubst_flags_t complain
)
11389 #define RETURN(EXP) do { r = (EXP); goto out; } while(0)
11390 location_t saved_loc
;
11391 tree r
= NULL_TREE
;
11393 hashval_t hash
= 0;
11395 /* Set the filename and linenumber to improve error-reporting. */
11396 saved_loc
= input_location
;
11397 input_location
= DECL_SOURCE_LOCATION (t
);
11399 switch (TREE_CODE (t
))
11401 case TEMPLATE_DECL
:
11403 /* We can get here when processing a member function template,
11404 member class template, or template template parameter. */
11405 tree decl
= DECL_TEMPLATE_RESULT (t
);
11410 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
11412 /* Template template parameter is treated here. */
11413 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11414 if (new_type
== error_mark_node
)
11415 r
= error_mark_node
;
11416 /* If we get a real template back, return it. This can happen in
11417 the context of most_specialized_partial_spec. */
11418 else if (TREE_CODE (new_type
) == TEMPLATE_DECL
)
11421 /* The new TEMPLATE_DECL was built in
11422 reduce_template_parm_level. */
11423 r
= TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (new_type
);
11427 /* We might already have an instance of this template.
11428 The ARGS are for the surrounding class type, so the
11429 full args contain the tsubst'd args for the context,
11430 plus the innermost args from the template decl. */
11431 tmpl_args
= DECL_CLASS_TEMPLATE_P (t
)
11432 ? CLASSTYPE_TI_ARGS (TREE_TYPE (t
))
11433 : DECL_TI_ARGS (DECL_TEMPLATE_RESULT (t
));
11434 /* Because this is a template, the arguments will still be
11435 dependent, even after substitution. If
11436 PROCESSING_TEMPLATE_DECL is not set, the dependency
11437 predicates will short-circuit. */
11438 ++processing_template_decl
;
11439 full_args
= tsubst_template_args (tmpl_args
, args
,
11440 complain
, in_decl
);
11441 --processing_template_decl
;
11442 if (full_args
== error_mark_node
)
11443 RETURN (error_mark_node
);
11445 /* If this is a default template template argument,
11446 tsubst might not have changed anything. */
11447 if (full_args
== tmpl_args
)
11450 hash
= hash_tmpl_and_args (t
, full_args
);
11451 spec
= retrieve_specialization (t
, full_args
, hash
);
11452 if (spec
!= NULL_TREE
)
11458 /* Make a new template decl. It will be similar to the
11459 original, but will record the current template arguments.
11460 We also create a new function declaration, which is just
11461 like the old one, but points to this new template, rather
11462 than the old one. */
11464 gcc_assert (DECL_LANG_SPECIFIC (r
) != 0);
11465 DECL_CHAIN (r
) = NULL_TREE
;
11467 // Build new template info linking to the original template decl.
11468 DECL_TEMPLATE_INFO (r
) = build_template_info (t
, args
);
11470 if (TREE_CODE (decl
) == TYPE_DECL
11471 && !TYPE_DECL_ALIAS_P (decl
))
11474 ++processing_template_decl
;
11475 new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11476 --processing_template_decl
;
11477 if (new_type
== error_mark_node
)
11478 RETURN (error_mark_node
);
11480 TREE_TYPE (r
) = new_type
;
11481 /* For a partial specialization, we need to keep pointing to
11482 the primary template. */
11483 if (!DECL_TEMPLATE_SPECIALIZATION (t
))
11484 CLASSTYPE_TI_TEMPLATE (new_type
) = r
;
11485 DECL_TEMPLATE_RESULT (r
) = TYPE_MAIN_DECL (new_type
);
11486 DECL_TI_ARGS (r
) = CLASSTYPE_TI_ARGS (new_type
);
11487 DECL_CONTEXT (r
) = TYPE_CONTEXT (new_type
);
11492 ++processing_template_decl
;
11493 new_decl
= tsubst (decl
, args
, complain
, in_decl
);
11494 --processing_template_decl
;
11495 if (new_decl
== error_mark_node
)
11496 RETURN (error_mark_node
);
11498 DECL_TEMPLATE_RESULT (r
) = new_decl
;
11499 DECL_TI_TEMPLATE (new_decl
) = r
;
11500 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
11501 DECL_TI_ARGS (r
) = DECL_TI_ARGS (new_decl
);
11502 DECL_CONTEXT (r
) = DECL_CONTEXT (new_decl
);
11505 SET_DECL_IMPLICIT_INSTANTIATION (r
);
11506 DECL_TEMPLATE_INSTANTIATIONS (r
) = NULL_TREE
;
11507 DECL_TEMPLATE_SPECIALIZATIONS (r
) = NULL_TREE
;
11509 /* The template parameters for this new template are all the
11510 template parameters for the old template, except the
11511 outermost level of parameters. */
11512 DECL_TEMPLATE_PARMS (r
)
11513 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
,
11516 if (PRIMARY_TEMPLATE_P (t
))
11517 DECL_PRIMARY_TEMPLATE (r
) = r
;
11519 if (TREE_CODE (decl
) != TYPE_DECL
&& !VAR_P (decl
))
11520 /* Record this non-type partial instantiation. */
11521 register_specialization (r
, t
,
11522 DECL_TI_ARGS (DECL_TEMPLATE_RESULT (r
)),
11527 case FUNCTION_DECL
:
11530 tree argvec
= NULL_TREE
;
11538 /* Nobody should be tsubst'ing into non-template functions. */
11539 gcc_assert (DECL_TEMPLATE_INFO (t
) != NULL_TREE
);
11541 if (TREE_CODE (DECL_TI_TEMPLATE (t
)) == TEMPLATE_DECL
)
11546 /* If T is not dependent, just return it. We have to
11547 increment PROCESSING_TEMPLATE_DECL because
11548 value_dependent_expression_p assumes that nothing is
11549 dependent when PROCESSING_TEMPLATE_DECL is zero. */
11550 ++processing_template_decl
;
11551 dependent_p
= value_dependent_expression_p (t
);
11552 --processing_template_decl
;
11556 /* Calculate the most general template of which R is a
11557 specialization, and the complete set of arguments used to
11559 gen_tmpl
= most_general_template (DECL_TI_TEMPLATE (t
));
11560 argvec
= tsubst_template_args (DECL_TI_ARGS
11561 (DECL_TEMPLATE_RESULT
11562 (DECL_TI_TEMPLATE (t
))),
11563 args
, complain
, in_decl
);
11564 if (argvec
== error_mark_node
)
11565 RETURN (error_mark_node
);
11567 /* Check to see if we already have this specialization. */
11568 hash
= hash_tmpl_and_args (gen_tmpl
, argvec
);
11569 spec
= retrieve_specialization (gen_tmpl
, argvec
, hash
);
11577 /* We can see more levels of arguments than parameters if
11578 there was a specialization of a member template, like
11581 template <class T> struct S { template <class U> void f(); }
11582 template <> template <class U> void S<int>::f(U);
11584 Here, we'll be substituting into the specialization,
11585 because that's where we can find the code we actually
11586 want to generate, but we'll have enough arguments for
11587 the most general template.
11589 We also deal with the peculiar case:
11591 template <class T> struct S {
11592 template <class U> friend void f();
11594 template <class U> void f() {}
11596 template void f<double>();
11598 Here, the ARGS for the instantiation of will be {int,
11599 double}. But, we only need as many ARGS as there are
11600 levels of template parameters in CODE_PATTERN. We are
11601 careful not to get fooled into reducing the ARGS in
11604 template <class T> struct S { template <class U> void f(U); }
11605 template <class T> template <> void S<T>::f(int) {}
11607 which we can spot because the pattern will be a
11608 specialization in this case. */
11609 args_depth
= TMPL_ARGS_DEPTH (args
);
11611 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (t
)));
11612 if (args_depth
> parms_depth
11613 && !DECL_TEMPLATE_SPECIALIZATION (t
))
11614 args
= get_innermost_template_args (args
, parms_depth
);
11618 /* This special case arises when we have something like this:
11620 template <class T> struct S {
11621 friend void f<int>(int, double);
11624 Here, the DECL_TI_TEMPLATE for the friend declaration
11625 will be an IDENTIFIER_NODE. We are being called from
11626 tsubst_friend_function, and we want only to create a
11627 new decl (R) with appropriate types so that we can call
11628 determine_specialization. */
11629 gen_tmpl
= NULL_TREE
;
11632 if (DECL_CLASS_SCOPE_P (t
))
11634 if (DECL_NAME (t
) == constructor_name (DECL_CONTEXT (t
)))
11638 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
,
11639 complain
, t
, /*entering_scope=*/1);
11644 ctx
= DECL_CONTEXT (t
);
11646 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11647 if (type
== error_mark_node
)
11648 RETURN (error_mark_node
);
11650 /* If we hit excessive deduction depth, the type is bogus even if
11651 it isn't error_mark_node, so don't build a decl. */
11652 if (excessive_deduction_depth
)
11653 RETURN (error_mark_node
);
11655 /* We do NOT check for matching decls pushed separately at this
11656 point, as they may not represent instantiations of this
11657 template, and in any case are considered separate under the
11660 DECL_USE_TEMPLATE (r
) = 0;
11661 TREE_TYPE (r
) = type
;
11662 /* Clear out the mangled name and RTL for the instantiation. */
11663 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
11664 SET_DECL_RTL (r
, NULL
);
11665 /* Leave DECL_INITIAL set on deleted instantiations. */
11666 if (!DECL_DELETED_FN (r
))
11667 DECL_INITIAL (r
) = NULL_TREE
;
11668 DECL_CONTEXT (r
) = ctx
;
11670 /* OpenMP UDRs have the only argument a reference to the declared
11671 type. We want to diagnose if the declared type is a reference,
11672 which is invalid, but as references to references are usually
11673 quietly merged, diagnose it here. */
11674 if (DECL_OMP_DECLARE_REDUCTION_P (t
))
11677 = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (t
))));
11678 argtype
= tsubst (argtype
, args
, complain
, in_decl
);
11679 if (TREE_CODE (argtype
) == REFERENCE_TYPE
)
11680 error_at (DECL_SOURCE_LOCATION (t
),
11681 "reference type %qT in "
11682 "%<#pragma omp declare reduction%>", argtype
);
11683 if (strchr (IDENTIFIER_POINTER (DECL_NAME (t
)), '~') == NULL
)
11684 DECL_NAME (r
) = omp_reduction_id (ERROR_MARK
, DECL_NAME (t
),
11688 if (member
&& DECL_CONV_FN_P (r
))
11689 /* Type-conversion operator. Reconstruct the name, in
11690 case it's the name of one of the template's parameters. */
11691 DECL_NAME (r
) = mangle_conv_op_name_for_type (TREE_TYPE (type
));
11693 DECL_ARGUMENTS (r
) = tsubst (DECL_ARGUMENTS (t
), args
,
11695 DECL_RESULT (r
) = NULL_TREE
;
11697 TREE_STATIC (r
) = 0;
11698 TREE_PUBLIC (r
) = TREE_PUBLIC (t
);
11699 DECL_EXTERNAL (r
) = 1;
11700 /* If this is an instantiation of a function with internal
11701 linkage, we already know what object file linkage will be
11702 assigned to the instantiation. */
11703 DECL_INTERFACE_KNOWN (r
) = !TREE_PUBLIC (r
);
11704 DECL_DEFER_OUTPUT (r
) = 0;
11705 DECL_CHAIN (r
) = NULL_TREE
;
11706 DECL_PENDING_INLINE_INFO (r
) = 0;
11707 DECL_PENDING_INLINE_P (r
) = 0;
11708 DECL_SAVED_TREE (r
) = NULL_TREE
;
11709 DECL_STRUCT_FUNCTION (r
) = NULL
;
11711 /* We'll re-clone as appropriate in instantiate_template. */
11712 DECL_CLONED_FUNCTION (r
) = NULL_TREE
;
11714 /* If we aren't complaining now, return on error before we register
11715 the specialization so that we'll complain eventually. */
11716 if ((complain
& tf_error
) == 0
11717 && IDENTIFIER_OPNAME_P (DECL_NAME (r
))
11718 && !grok_op_properties (r
, /*complain=*/false))
11719 RETURN (error_mark_node
);
11721 /* When instantiating a constrained member, substitute
11722 into the constraints to create a new constraint. */
11723 if (tree ci
= get_constraints (t
))
11726 ci
= tsubst_constraint_info (ci
, argvec
, complain
, NULL_TREE
);
11727 set_constraints (r
, ci
);
11730 /* Set up the DECL_TEMPLATE_INFO for R. There's no need to do
11731 this in the special friend case mentioned above where
11732 GEN_TMPL is NULL. */
11735 DECL_TEMPLATE_INFO (r
)
11736 = build_template_info (gen_tmpl
, argvec
);
11737 SET_DECL_IMPLICIT_INSTANTIATION (r
);
11740 = register_specialization (r
, gen_tmpl
, argvec
, false, hash
);
11742 /* We instantiated this while substituting into
11743 the type earlier (template/friend54.C). */
11746 /* We're not supposed to instantiate default arguments
11747 until they are called, for a template. But, for a
11750 template <class T> void f ()
11751 { extern void g(int i = T()); }
11753 we should do the substitution when the template is
11754 instantiated. We handle the member function case in
11755 instantiate_class_template since the default arguments
11756 might refer to other members of the class. */
11758 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
11759 && !uses_template_parms (argvec
))
11760 tsubst_default_arguments (r
, complain
);
11763 DECL_TEMPLATE_INFO (r
) = NULL_TREE
;
11765 /* Copy the list of befriending classes. */
11766 for (friends
= &DECL_BEFRIENDING_CLASSES (r
);
11768 friends
= &TREE_CHAIN (*friends
))
11770 *friends
= copy_node (*friends
);
11771 TREE_VALUE (*friends
) = tsubst (TREE_VALUE (*friends
),
11776 if (DECL_CONSTRUCTOR_P (r
) || DECL_DESTRUCTOR_P (r
))
11778 maybe_retrofit_in_chrg (r
);
11779 if (DECL_CONSTRUCTOR_P (r
))
11780 grok_ctor_properties (ctx
, r
);
11781 if (DECL_INHERITED_CTOR_BASE (r
))
11782 deduce_inheriting_ctor (r
);
11783 /* If this is an instantiation of a member template, clone it.
11784 If it isn't, that'll be handled by
11785 clone_constructors_and_destructors. */
11786 if (PRIMARY_TEMPLATE_P (gen_tmpl
))
11787 clone_function_decl (r
, /*update_method_vec_p=*/0);
11789 else if ((complain
& tf_error
) != 0
11790 && IDENTIFIER_OPNAME_P (DECL_NAME (r
))
11791 && !grok_op_properties (r
, /*complain=*/true))
11792 RETURN (error_mark_node
);
11794 if (DECL_FRIEND_P (t
) && DECL_FRIEND_CONTEXT (t
))
11795 SET_DECL_FRIEND_CONTEXT (r
,
11796 tsubst (DECL_FRIEND_CONTEXT (t
),
11797 args
, complain
, in_decl
));
11799 /* Possibly limit visibility based on template args. */
11800 DECL_VISIBILITY (r
) = VISIBILITY_DEFAULT
;
11801 if (DECL_VISIBILITY_SPECIFIED (t
))
11803 DECL_VISIBILITY_SPECIFIED (r
) = 0;
11804 DECL_ATTRIBUTES (r
)
11805 = remove_attribute ("visibility", DECL_ATTRIBUTES (r
));
11807 determine_visibility (r
);
11808 if (DECL_DEFAULTED_OUTSIDE_CLASS_P (r
)
11809 && !processing_template_decl
)
11810 defaulted_late_check (r
);
11812 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
11813 args
, complain
, in_decl
);
11819 tree type
= NULL_TREE
;
11821 tree expanded_types
= NULL_TREE
;
11822 tree prev_r
= NULL_TREE
;
11823 tree first_r
= NULL_TREE
;
11825 if (DECL_PACK_P (t
))
11827 /* If there is a local specialization that isn't a
11828 parameter pack, it means that we're doing a "simple"
11829 substitution from inside tsubst_pack_expansion. Just
11830 return the local specialization (which will be a single
11832 tree spec
= retrieve_local_specialization (t
);
11834 && TREE_CODE (spec
) == PARM_DECL
11835 && TREE_CODE (TREE_TYPE (spec
)) != TYPE_PACK_EXPANSION
)
11838 /* Expand the TYPE_PACK_EXPANSION that provides the types for
11839 the parameters in this function parameter pack. */
11840 expanded_types
= tsubst_pack_expansion (TREE_TYPE (t
), args
,
11841 complain
, in_decl
);
11842 if (TREE_CODE (expanded_types
) == TREE_VEC
)
11844 len
= TREE_VEC_LENGTH (expanded_types
);
11846 /* Zero-length parameter packs are boring. Just substitute
11849 RETURN (tsubst (TREE_CHAIN (t
), args
, complain
,
11854 /* All we did was update the type. Make a note of that. */
11855 type
= expanded_types
;
11856 expanded_types
= NULL_TREE
;
11860 /* Loop through all of the parameters we'll build. When T is
11861 a function parameter pack, LEN is the number of expanded
11862 types in EXPANDED_TYPES; otherwise, LEN is 1. */
11864 for (i
= 0; i
< len
; ++i
)
11868 if (DECL_TEMPLATE_PARM_P (t
))
11869 SET_DECL_TEMPLATE_PARM_P (r
);
11871 if (expanded_types
)
11872 /* We're on the Ith parameter of the function parameter
11875 /* Get the Ith type. */
11876 type
= TREE_VEC_ELT (expanded_types
, i
);
11878 /* Rename the parameter to include the index. */
11880 = make_ith_pack_parameter_name (DECL_NAME (r
), i
);
11883 /* We're dealing with a normal parameter. */
11884 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11886 type
= type_decays_to (type
);
11887 TREE_TYPE (r
) = type
;
11888 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
11890 if (DECL_INITIAL (r
))
11892 if (TREE_CODE (DECL_INITIAL (r
)) != TEMPLATE_PARM_INDEX
)
11893 DECL_INITIAL (r
) = TREE_TYPE (r
);
11895 DECL_INITIAL (r
) = tsubst (DECL_INITIAL (r
), args
,
11896 complain
, in_decl
);
11899 DECL_CONTEXT (r
) = NULL_TREE
;
11901 if (!DECL_TEMPLATE_PARM_P (r
))
11902 DECL_ARG_TYPE (r
) = type_passed_as (type
);
11904 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
11905 args
, complain
, in_decl
);
11907 /* Keep track of the first new parameter we
11908 generate. That's what will be returned to the
11913 /* Build a proper chain of parameters when substituting
11914 into a function parameter pack. */
11916 DECL_CHAIN (prev_r
) = r
;
11919 /* If cp_unevaluated_operand is set, we're just looking for a
11920 single dummy parameter, so don't keep going. */
11921 if (DECL_CHAIN (t
) && !cp_unevaluated_operand
)
11922 DECL_CHAIN (r
) = tsubst (DECL_CHAIN (t
), args
,
11923 complain
, DECL_CHAIN (t
));
11925 /* FIRST_R contains the start of the chain we've built. */
11932 tree type
= NULL_TREE
;
11933 tree vec
= NULL_TREE
;
11934 tree expanded_types
= NULL_TREE
;
11937 if (PACK_EXPANSION_P (TREE_TYPE (t
)))
11939 /* This field is a lambda capture pack. Return a TREE_VEC of
11940 the expanded fields to instantiate_class_template_1 and
11941 store them in the specializations hash table as a
11942 NONTYPE_ARGUMENT_PACK so that tsubst_copy can find them. */
11943 expanded_types
= tsubst_pack_expansion (TREE_TYPE (t
), args
,
11944 complain
, in_decl
);
11945 if (TREE_CODE (expanded_types
) == TREE_VEC
)
11947 len
= TREE_VEC_LENGTH (expanded_types
);
11948 vec
= make_tree_vec (len
);
11952 /* All we did was update the type. Make a note of that. */
11953 type
= expanded_types
;
11954 expanded_types
= NULL_TREE
;
11958 for (int i
= 0; i
< len
; ++i
)
11961 if (expanded_types
)
11963 type
= TREE_VEC_ELT (expanded_types
, i
);
11965 = make_ith_pack_parameter_name (DECL_NAME (r
), i
);
11968 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11970 if (type
== error_mark_node
)
11971 RETURN (error_mark_node
);
11972 TREE_TYPE (r
) = type
;
11973 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
11975 if (DECL_C_BIT_FIELD (r
))
11976 /* For bit-fields, DECL_INITIAL gives the number of bits. For
11977 non-bit-fields DECL_INITIAL is a non-static data member
11978 initializer, which gets deferred instantiation. */
11980 = tsubst_expr (DECL_INITIAL (t
), args
,
11982 /*integral_constant_expression_p=*/true);
11983 else if (DECL_INITIAL (t
))
11985 /* Set up DECL_TEMPLATE_INFO so that we can get at the
11986 NSDMI in perform_member_init. Still set DECL_INITIAL
11987 so that we know there is one. */
11988 DECL_INITIAL (r
) = void_node
;
11989 gcc_assert (DECL_LANG_SPECIFIC (r
) == NULL
);
11990 retrofit_lang_decl (r
);
11991 DECL_TEMPLATE_INFO (r
) = build_template_info (t
, args
);
11993 /* We don't have to set DECL_CONTEXT here; it is set by
11994 finish_member_declaration. */
11995 DECL_CHAIN (r
) = NULL_TREE
;
11997 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
11998 args
, complain
, in_decl
);
12001 TREE_VEC_ELT (vec
, i
) = r
;
12007 tree pack
= make_node (NONTYPE_ARGUMENT_PACK
);
12008 tree tpack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
12009 SET_ARGUMENT_PACK_ARGS (pack
, vec
);
12010 SET_ARGUMENT_PACK_ARGS (tpack
, expanded_types
);
12011 TREE_TYPE (pack
) = tpack
;
12012 register_specialization (pack
, t
, args
, false, 0);
12018 /* We reach here only for member using decls. We also need to check
12019 uses_template_parms because DECL_DEPENDENT_P is not set for a
12020 using-declaration that designates a member of the current
12021 instantiation (c++/53549). */
12022 if (DECL_DEPENDENT_P (t
)
12023 || uses_template_parms (USING_DECL_SCOPE (t
)))
12025 tree inst_scope
= tsubst_copy (USING_DECL_SCOPE (t
), args
,
12026 complain
, in_decl
);
12027 tree name
= tsubst_copy (DECL_NAME (t
), args
, complain
, in_decl
);
12028 r
= do_class_using_decl (inst_scope
, name
);
12030 r
= error_mark_node
;
12033 TREE_PROTECTED (r
) = TREE_PROTECTED (t
);
12034 TREE_PRIVATE (r
) = TREE_PRIVATE (t
);
12040 DECL_CHAIN (r
) = NULL_TREE
;
12047 tree argvec
= NULL_TREE
;
12048 tree gen_tmpl
= NULL_TREE
;
12050 tree tmpl
= NULL_TREE
;
12052 tree type
= NULL_TREE
;
12055 if (TREE_TYPE (t
) == error_mark_node
)
12056 RETURN (error_mark_node
);
12058 if (TREE_CODE (t
) == TYPE_DECL
12059 && t
== TYPE_MAIN_DECL (TREE_TYPE (t
)))
12061 /* If this is the canonical decl, we don't have to
12062 mess with instantiations, and often we can't (for
12063 typename, template type parms and such). Note that
12064 TYPE_NAME is not correct for the above test if
12065 we've copied the type for a typedef. */
12066 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12067 if (type
== error_mark_node
)
12068 RETURN (error_mark_node
);
12069 r
= TYPE_NAME (type
);
12073 /* Check to see if we already have the specialization we
12076 if (DECL_CLASS_SCOPE_P (t
) || DECL_NAMESPACE_SCOPE_P (t
))
12078 /* T is a static data member or namespace-scope entity.
12079 We have to substitute into namespace-scope variables
12080 (not just variable templates) because of cases like:
12082 template <class T> void f() { extern T t; }
12084 where the entity referenced is not known until
12085 instantiation time. */
12087 ctx
= DECL_CONTEXT (t
);
12088 if (DECL_CLASS_SCOPE_P (t
))
12090 ctx
= tsubst_aggr_type (ctx
, args
,
12092 in_decl
, /*entering_scope=*/1);
12093 /* If CTX is unchanged, then T is in fact the
12094 specialization we want. That situation occurs when
12095 referencing a static data member within in its own
12096 class. We can use pointer equality, rather than
12097 same_type_p, because DECL_CONTEXT is always
12099 if (ctx
== DECL_CONTEXT (t
)
12100 /* ... unless T is a member template; in which
12101 case our caller can be willing to create a
12102 specialization of that template represented
12104 && !(DECL_TI_TEMPLATE (t
)
12105 && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (t
))))
12111 tmpl
= DECL_TI_TEMPLATE (t
);
12112 gen_tmpl
= most_general_template (tmpl
);
12113 argvec
= tsubst (DECL_TI_ARGS (t
), args
, complain
, in_decl
);
12114 if (argvec
!= error_mark_node
)
12115 argvec
= (coerce_innermost_template_parms
12116 (DECL_TEMPLATE_PARMS (gen_tmpl
),
12117 argvec
, t
, complain
,
12118 /*all*/true, /*defarg*/true));
12119 if (argvec
== error_mark_node
)
12120 RETURN (error_mark_node
);
12121 hash
= hash_tmpl_and_args (gen_tmpl
, argvec
);
12122 spec
= retrieve_specialization (gen_tmpl
, argvec
, hash
);
12127 /* A local variable. */
12129 /* Subsequent calls to pushdecl will fill this in. */
12131 spec
= retrieve_local_specialization (t
);
12133 /* If we already have the specialization we need, there is
12134 nothing more to do. */
12141 /* Create a new node for the specialization we need. */
12143 if (type
== NULL_TREE
)
12145 if (is_typedef_decl (t
))
12146 type
= DECL_ORIGINAL_TYPE (t
);
12148 type
= TREE_TYPE (t
);
12150 && VAR_HAD_UNKNOWN_BOUND (t
)
12151 && type
!= error_mark_node
)
12152 type
= strip_array_domain (type
);
12153 type
= tsubst (type
, args
, complain
, in_decl
);
12157 /* Even if the original location is out of scope, the
12158 newly substituted one is not. */
12159 DECL_DEAD_FOR_LOCAL (r
) = 0;
12160 DECL_INITIALIZED_P (r
) = 0;
12161 DECL_TEMPLATE_INSTANTIATED (r
) = 0;
12162 if (type
== error_mark_node
)
12163 RETURN (error_mark_node
);
12164 if (TREE_CODE (type
) == FUNCTION_TYPE
)
12166 /* It may seem that this case cannot occur, since:
12171 declares a function, not a variable. However:
12174 template <typename T> void g() { T t; }
12175 template void g<f>();
12177 is an attempt to declare a variable with function
12179 error ("variable %qD has function type",
12180 /* R is not yet sufficiently initialized, so we
12181 just use its name. */
12183 RETURN (error_mark_node
);
12185 type
= complete_type (type
);
12186 /* Wait until cp_finish_decl to set this again, to handle
12187 circular dependency (template/instantiate6.C). */
12188 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r
) = 0;
12189 type
= check_var_type (DECL_NAME (r
), type
);
12191 if (DECL_HAS_VALUE_EXPR_P (t
))
12193 tree ve
= DECL_VALUE_EXPR (t
);
12194 ve
= tsubst_expr (ve
, args
, complain
, in_decl
,
12195 /*constant_expression_p=*/false);
12196 if (REFERENCE_REF_P (ve
))
12198 gcc_assert (TREE_CODE (type
) == REFERENCE_TYPE
);
12199 ve
= TREE_OPERAND (ve
, 0);
12201 SET_DECL_VALUE_EXPR (r
, ve
);
12203 if (CP_DECL_THREAD_LOCAL_P (r
)
12204 && !processing_template_decl
)
12205 set_decl_tls_model (r
, decl_default_tls_model (r
));
12207 else if (DECL_SELF_REFERENCE_P (t
))
12208 SET_DECL_SELF_REFERENCE_P (r
);
12209 TREE_TYPE (r
) = type
;
12210 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
12211 DECL_CONTEXT (r
) = ctx
;
12212 /* Clear out the mangled name and RTL for the instantiation. */
12213 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
12214 if (CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_DECL_WRTL
))
12215 SET_DECL_RTL (r
, NULL
);
12216 /* The initializer must not be expanded until it is required;
12217 see [temp.inst]. */
12218 DECL_INITIAL (r
) = NULL_TREE
;
12219 if (CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_DECL_WRTL
))
12220 SET_DECL_RTL (r
, NULL
);
12221 DECL_SIZE (r
) = DECL_SIZE_UNIT (r
) = 0;
12224 /* Possibly limit visibility based on template args. */
12225 DECL_VISIBILITY (r
) = VISIBILITY_DEFAULT
;
12226 if (DECL_VISIBILITY_SPECIFIED (t
))
12228 DECL_VISIBILITY_SPECIFIED (r
) = 0;
12229 DECL_ATTRIBUTES (r
)
12230 = remove_attribute ("visibility", DECL_ATTRIBUTES (r
));
12232 determine_visibility (r
);
12237 /* A static data member declaration is always marked
12238 external when it is declared in-class, even if an
12239 initializer is present. We mimic the non-template
12240 processing here. */
12241 DECL_EXTERNAL (r
) = 1;
12242 if (DECL_NAMESPACE_SCOPE_P (t
))
12243 DECL_NOT_REALLY_EXTERN (r
) = 1;
12245 DECL_TEMPLATE_INFO (r
) = build_template_info (tmpl
, argvec
);
12246 SET_DECL_IMPLICIT_INSTANTIATION (r
);
12247 register_specialization (r
, gen_tmpl
, argvec
, false, hash
);
12249 else if (!cp_unevaluated_operand
)
12250 register_local_specialization (r
, t
);
12252 DECL_CHAIN (r
) = NULL_TREE
;
12254 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
),
12256 args
, complain
, in_decl
);
12258 /* Preserve a typedef that names a type. */
12259 if (is_typedef_decl (r
))
12261 DECL_ORIGINAL_TYPE (r
) = NULL_TREE
;
12262 set_underlying_type (r
);
12263 if (TYPE_DECL_ALIAS_P (r
) && type
!= error_mark_node
)
12264 /* An alias template specialization can be dependent
12265 even if its underlying type is not. */
12266 TYPE_DEPENDENT_P_VALID (TREE_TYPE (r
)) = false;
12269 layout_decl (r
, 0);
12274 gcc_unreachable ();
12279 /* Restore the file and line information. */
12280 input_location
= saved_loc
;
12285 /* Substitute into the ARG_TYPES of a function type.
12286 If END is a TREE_CHAIN, leave it and any following types
12290 tsubst_arg_types (tree arg_types
,
12293 tsubst_flags_t complain
,
12296 tree remaining_arg_types
;
12297 tree type
= NULL_TREE
;
12299 tree expanded_args
= NULL_TREE
;
12302 if (!arg_types
|| arg_types
== void_list_node
|| arg_types
== end
)
12305 remaining_arg_types
= tsubst_arg_types (TREE_CHAIN (arg_types
),
12306 args
, end
, complain
, in_decl
);
12307 if (remaining_arg_types
== error_mark_node
)
12308 return error_mark_node
;
12310 if (PACK_EXPANSION_P (TREE_VALUE (arg_types
)))
12312 /* For a pack expansion, perform substitution on the
12313 entire expression. Later on, we'll handle the arguments
12315 expanded_args
= tsubst_pack_expansion (TREE_VALUE (arg_types
),
12316 args
, complain
, in_decl
);
12318 if (TREE_CODE (expanded_args
) == TREE_VEC
)
12319 /* So that we'll spin through the parameters, one by one. */
12320 i
= TREE_VEC_LENGTH (expanded_args
);
12323 /* We only partially substituted into the parameter
12324 pack. Our type is TYPE_PACK_EXPANSION. */
12325 type
= expanded_args
;
12326 expanded_args
= NULL_TREE
;
12334 type
= TREE_VEC_ELT (expanded_args
, i
);
12336 type
= tsubst (TREE_VALUE (arg_types
), args
, complain
, in_decl
);
12338 if (type
== error_mark_node
)
12339 return error_mark_node
;
12340 if (VOID_TYPE_P (type
))
12342 if (complain
& tf_error
)
12344 error ("invalid parameter type %qT", type
);
12346 error ("in declaration %q+D", in_decl
);
12348 return error_mark_node
;
12351 if (abstract_virtuals_error_sfinae (ACU_PARM
, type
, complain
))
12352 return error_mark_node
;
12354 /* Do array-to-pointer, function-to-pointer conversion, and ignore
12355 top-level qualifiers as required. */
12356 type
= cv_unqualified (type_decays_to (type
));
12358 /* We do not substitute into default arguments here. The standard
12359 mandates that they be instantiated only when needed, which is
12360 done in build_over_call. */
12361 default_arg
= TREE_PURPOSE (arg_types
);
12363 if (default_arg
&& TREE_CODE (default_arg
) == DEFAULT_ARG
)
12365 /* We've instantiated a template before its default arguments
12366 have been parsed. This can happen for a nested template
12367 class, and is not an error unless we require the default
12368 argument in a call of this function. */
12369 remaining_arg_types
=
12370 tree_cons (default_arg
, type
, remaining_arg_types
);
12371 vec_safe_push (DEFARG_INSTANTIATIONS(default_arg
), remaining_arg_types
);
12374 remaining_arg_types
=
12375 hash_tree_cons (default_arg
, type
, remaining_arg_types
);
12378 return remaining_arg_types
;
12381 /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does
12382 *not* handle the exception-specification for FNTYPE, because the
12383 initial substitution of explicitly provided template parameters
12384 during argument deduction forbids substitution into the
12385 exception-specification:
12389 All references in the function type of the function template to the
12390 corresponding template parameters are replaced by the specified tem-
12391 plate argument values. If a substitution in a template parameter or
12392 in the function type of the function template results in an invalid
12393 type, type deduction fails. [Note: The equivalent substitution in
12394 exception specifications is done only when the function is instanti-
12395 ated, at which point a program is ill-formed if the substitution
12396 results in an invalid type.] */
12399 tsubst_function_type (tree t
,
12401 tsubst_flags_t complain
,
12405 tree arg_types
= NULL_TREE
;
12408 /* The TYPE_CONTEXT is not used for function/method types. */
12409 gcc_assert (TYPE_CONTEXT (t
) == NULL_TREE
);
12411 /* DR 1227: Mixing immediate and non-immediate contexts in deduction
12413 bool late_return_type_p
= TYPE_HAS_LATE_RETURN_TYPE (t
);
12415 if (late_return_type_p
)
12417 /* Substitute the argument types. */
12418 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
, NULL_TREE
,
12419 complain
, in_decl
);
12420 if (arg_types
== error_mark_node
)
12421 return error_mark_node
;
12423 tree save_ccp
= current_class_ptr
;
12424 tree save_ccr
= current_class_ref
;
12425 tree this_type
= (TREE_CODE (t
) == METHOD_TYPE
12426 ? TREE_TYPE (TREE_VALUE (arg_types
)) : NULL_TREE
);
12427 bool do_inject
= this_type
&& CLASS_TYPE_P (this_type
);
12430 /* DR 1207: 'this' is in scope in the trailing return type. */
12431 inject_this_parameter (this_type
, cp_type_quals (this_type
));
12434 /* Substitute the return type. */
12435 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12439 current_class_ptr
= save_ccp
;
12440 current_class_ref
= save_ccr
;
12444 /* Substitute the return type. */
12445 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12447 if (return_type
== error_mark_node
)
12448 return error_mark_node
;
12449 /* DR 486 clarifies that creation of a function type with an
12450 invalid return type is a deduction failure. */
12451 if (TREE_CODE (return_type
) == ARRAY_TYPE
12452 || TREE_CODE (return_type
) == FUNCTION_TYPE
)
12454 if (complain
& tf_error
)
12456 if (TREE_CODE (return_type
) == ARRAY_TYPE
)
12457 error ("function returning an array");
12459 error ("function returning a function");
12461 return error_mark_node
;
12464 if (abstract_virtuals_error_sfinae (ACU_RETURN
, return_type
, complain
))
12465 return error_mark_node
;
12467 if (!late_return_type_p
)
12469 /* Substitute the argument types. */
12470 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
, NULL_TREE
,
12471 complain
, in_decl
);
12472 if (arg_types
== error_mark_node
)
12473 return error_mark_node
;
12476 /* Construct a new type node and return it. */
12477 if (TREE_CODE (t
) == FUNCTION_TYPE
)
12479 fntype
= build_function_type (return_type
, arg_types
);
12480 fntype
= apply_memfn_quals (fntype
,
12481 type_memfn_quals (t
),
12482 type_memfn_rqual (t
));
12486 tree r
= TREE_TYPE (TREE_VALUE (arg_types
));
12487 /* Don't pick up extra function qualifiers from the basetype. */
12488 r
= cp_build_qualified_type_real (r
, type_memfn_quals (t
), complain
);
12489 if (! MAYBE_CLASS_TYPE_P (r
))
12493 Type deduction may fail for any of the following
12496 -- Attempting to create "pointer to member of T" when T
12497 is not a class type. */
12498 if (complain
& tf_error
)
12499 error ("creating pointer to member function of non-class type %qT",
12501 return error_mark_node
;
12504 fntype
= build_method_type_directly (r
, return_type
,
12505 TREE_CHAIN (arg_types
));
12506 fntype
= build_ref_qualified_type (fntype
, type_memfn_rqual (t
));
12508 fntype
= cp_build_type_attribute_variant (fntype
, TYPE_ATTRIBUTES (t
));
12510 if (late_return_type_p
)
12511 TYPE_HAS_LATE_RETURN_TYPE (fntype
) = 1;
12516 /* FNTYPE is a FUNCTION_TYPE or METHOD_TYPE. Substitute the template
12517 ARGS into that specification, and return the substituted
12518 specification. If there is no specification, return NULL_TREE. */
12521 tsubst_exception_specification (tree fntype
,
12523 tsubst_flags_t complain
,
12530 specs
= TYPE_RAISES_EXCEPTIONS (fntype
);
12531 new_specs
= NULL_TREE
;
12532 if (specs
&& TREE_PURPOSE (specs
))
12534 /* A noexcept-specifier. */
12535 tree expr
= TREE_PURPOSE (specs
);
12536 if (TREE_CODE (expr
) == INTEGER_CST
)
12540 /* Defer instantiation of noexcept-specifiers to avoid
12541 excessive instantiations (c++/49107). */
12542 new_specs
= make_node (DEFERRED_NOEXCEPT
);
12543 if (DEFERRED_NOEXCEPT_SPEC_P (specs
))
12545 /* We already partially instantiated this member template,
12546 so combine the new args with the old. */
12547 DEFERRED_NOEXCEPT_PATTERN (new_specs
)
12548 = DEFERRED_NOEXCEPT_PATTERN (expr
);
12549 DEFERRED_NOEXCEPT_ARGS (new_specs
)
12550 = add_to_template_args (DEFERRED_NOEXCEPT_ARGS (expr
), args
);
12554 DEFERRED_NOEXCEPT_PATTERN (new_specs
) = expr
;
12555 DEFERRED_NOEXCEPT_ARGS (new_specs
) = args
;
12559 new_specs
= tsubst_copy_and_build
12560 (expr
, args
, complain
, in_decl
, /*function_p=*/false,
12561 /*integral_constant_expression_p=*/true);
12562 new_specs
= build_noexcept_spec (new_specs
, complain
);
12566 if (! TREE_VALUE (specs
))
12573 tree expanded_specs
= NULL_TREE
;
12575 if (PACK_EXPANSION_P (TREE_VALUE (specs
)))
12577 /* Expand the pack expansion type. */
12578 expanded_specs
= tsubst_pack_expansion (TREE_VALUE (specs
),
12582 if (expanded_specs
== error_mark_node
)
12583 return error_mark_node
;
12584 else if (TREE_CODE (expanded_specs
) == TREE_VEC
)
12585 len
= TREE_VEC_LENGTH (expanded_specs
);
12588 /* We're substituting into a member template, so
12589 we got a TYPE_PACK_EXPANSION back. Add that
12590 expansion and move on. */
12591 gcc_assert (TREE_CODE (expanded_specs
)
12592 == TYPE_PACK_EXPANSION
);
12593 new_specs
= add_exception_specifier (new_specs
,
12596 specs
= TREE_CHAIN (specs
);
12601 for (i
= 0; i
< len
; ++i
)
12603 if (expanded_specs
)
12604 spec
= TREE_VEC_ELT (expanded_specs
, i
);
12606 spec
= tsubst (TREE_VALUE (specs
), args
, complain
, in_decl
);
12607 if (spec
== error_mark_node
)
12609 new_specs
= add_exception_specifier (new_specs
, spec
,
12613 specs
= TREE_CHAIN (specs
);
12619 /* Take the tree structure T and replace template parameters used
12620 therein with the argument vector ARGS. IN_DECL is an associated
12621 decl for diagnostics. If an error occurs, returns ERROR_MARK_NODE.
12622 Issue error and warning messages under control of COMPLAIN. Note
12623 that we must be relatively non-tolerant of extensions here, in
12624 order to preserve conformance; if we allow substitutions that
12625 should not be allowed, we may allow argument deductions that should
12626 not succeed, and therefore report ambiguous overload situations
12627 where there are none. In theory, we could allow the substitution,
12628 but indicate that it should have failed, and allow our caller to
12629 make sure that the right thing happens, but we don't try to do this
12632 This function is used for dealing with types, decls and the like;
12633 for expressions, use tsubst_expr or tsubst_copy. */
12636 tsubst (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
12638 enum tree_code code
;
12639 tree type
, r
= NULL_TREE
;
12641 if (t
== NULL_TREE
|| t
== error_mark_node
12642 || t
== integer_type_node
12643 || t
== void_type_node
12644 || t
== char_type_node
12645 || t
== unknown_type_node
12646 || TREE_CODE (t
) == NAMESPACE_DECL
12647 || TREE_CODE (t
) == TRANSLATION_UNIT_DECL
)
12651 return tsubst_decl (t
, args
, complain
);
12653 if (args
== NULL_TREE
)
12656 code
= TREE_CODE (t
);
12658 if (code
== IDENTIFIER_NODE
)
12659 type
= IDENTIFIER_TYPE_VALUE (t
);
12661 type
= TREE_TYPE (t
);
12663 gcc_assert (type
!= unknown_type_node
);
12665 /* Reuse typedefs. We need to do this to handle dependent attributes,
12666 such as attribute aligned. */
12668 && typedef_variant_p (t
))
12670 tree decl
= TYPE_NAME (t
);
12672 if (alias_template_specialization_p (t
))
12674 /* DECL represents an alias template and we want to
12676 tree tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
12677 tree gen_args
= tsubst (DECL_TI_ARGS (decl
), args
, complain
, in_decl
);
12678 r
= instantiate_alias_template (tmpl
, gen_args
, complain
);
12680 else if (DECL_CLASS_SCOPE_P (decl
)
12681 && CLASSTYPE_TEMPLATE_INFO (DECL_CONTEXT (decl
))
12682 && uses_template_parms (DECL_CONTEXT (decl
)))
12684 tree tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
12685 tree gen_args
= tsubst (DECL_TI_ARGS (decl
), args
, complain
, in_decl
);
12686 r
= retrieve_specialization (tmpl
, gen_args
, 0);
12688 else if (DECL_FUNCTION_SCOPE_P (decl
)
12689 && DECL_TEMPLATE_INFO (DECL_CONTEXT (decl
))
12690 && uses_template_parms (DECL_TI_ARGS (DECL_CONTEXT (decl
))))
12691 r
= retrieve_local_specialization (decl
);
12693 /* The typedef is from a non-template context. */
12699 r
= cp_build_qualified_type_real
12700 (r
, cp_type_quals (t
) | cp_type_quals (r
),
12701 complain
| tf_ignore_bad_quals
);
12706 /* We don't have an instantiation yet, so drop the typedef. */
12707 int quals
= cp_type_quals (t
);
12708 t
= DECL_ORIGINAL_TYPE (decl
);
12709 t
= cp_build_qualified_type_real (t
, quals
,
12710 complain
| tf_ignore_bad_quals
);
12715 && code
!= TYPENAME_TYPE
12716 && code
!= TEMPLATE_TYPE_PARM
12717 && code
!= IDENTIFIER_NODE
12718 && code
!= FUNCTION_TYPE
12719 && code
!= METHOD_TYPE
)
12720 type
= tsubst (type
, args
, complain
, in_decl
);
12721 if (type
== error_mark_node
)
12722 return error_mark_node
;
12728 case ENUMERAL_TYPE
:
12729 return tsubst_aggr_type (t
, args
, complain
, in_decl
,
12730 /*entering_scope=*/0);
12733 case IDENTIFIER_NODE
:
12744 if (t
== integer_type_node
)
12747 if (TREE_CODE (TYPE_MIN_VALUE (t
)) == INTEGER_CST
12748 && TREE_CODE (TYPE_MAX_VALUE (t
)) == INTEGER_CST
)
12752 tree max
, omax
= TREE_OPERAND (TYPE_MAX_VALUE (t
), 0);
12754 max
= tsubst_expr (omax
, args
, complain
, in_decl
,
12755 /*integral_constant_expression_p=*/false);
12757 /* Fix up type of the magic NOP_EXPR with TREE_SIDE_EFFECTS if
12759 if (TREE_CODE (max
) == NOP_EXPR
12760 && TREE_SIDE_EFFECTS (omax
)
12761 && !TREE_TYPE (max
))
12762 TREE_TYPE (max
) = TREE_TYPE (TREE_OPERAND (max
, 0));
12764 /* If we're in a partial instantiation, preserve the magic NOP_EXPR
12765 with TREE_SIDE_EFFECTS that indicates this is not an integral
12766 constant expression. */
12767 if (processing_template_decl
12768 && TREE_SIDE_EFFECTS (omax
) && TREE_CODE (omax
) == NOP_EXPR
)
12770 gcc_assert (TREE_CODE (max
) == NOP_EXPR
);
12771 TREE_SIDE_EFFECTS (max
) = 1;
12774 return compute_array_index_type (NULL_TREE
, max
, complain
);
12777 case TEMPLATE_TYPE_PARM
:
12778 case TEMPLATE_TEMPLATE_PARM
:
12779 case BOUND_TEMPLATE_TEMPLATE_PARM
:
12780 case TEMPLATE_PARM_INDEX
:
12785 tree arg
= NULL_TREE
;
12787 /* Early in template argument deduction substitution, we don't
12788 want to reduce the level of 'auto', or it will be confused
12789 with a normal template parm in subsequent deduction. */
12790 if (is_auto (t
) && (complain
& tf_partial
))
12795 gcc_assert (TREE_VEC_LENGTH (args
) > 0);
12796 template_parm_level_and_index (t
, &level
, &idx
);
12798 levels
= TMPL_ARGS_DEPTH (args
);
12799 if (level
<= levels
12800 && TREE_VEC_LENGTH (TMPL_ARGS_LEVEL (args
, level
)) > 0)
12802 arg
= TMPL_ARG (args
, level
, idx
);
12804 if (arg
&& TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
12806 /* See through ARGUMENT_PACK_SELECT arguments. */
12807 arg
= ARGUMENT_PACK_SELECT_ARG (arg
);
12808 /* If the selected argument is an expansion E, that most
12809 likely means we were called from
12810 gen_elem_of_pack_expansion_instantiation during the
12811 substituting of pack an argument pack (which Ith
12812 element is a pack expansion, where I is
12813 ARGUMENT_PACK_SELECT_INDEX) into a pack expansion.
12814 In this case, the Ith element resulting from this
12815 substituting is going to be a pack expansion, which
12816 pattern is the pattern of E. Let's return the
12818 gen_elem_of_pack_expansion_instantiation will
12819 build the resulting pack expansion from it. */
12820 if (PACK_EXPANSION_P (arg
))
12822 /* Make sure we aren't throwing away arg info. */
12823 gcc_assert (!PACK_EXPANSION_EXTRA_ARGS (arg
));
12824 arg
= PACK_EXPANSION_PATTERN (arg
);
12829 if (arg
== error_mark_node
)
12830 return error_mark_node
;
12831 else if (arg
!= NULL_TREE
)
12833 if (ARGUMENT_PACK_P (arg
))
12834 /* If ARG is an argument pack, we don't actually want to
12835 perform a substitution here, because substitutions
12836 for argument packs are only done
12837 element-by-element. We can get to this point when
12838 substituting the type of a non-type template
12839 parameter pack, when that type actually contains
12840 template parameter packs from an outer template, e.g.,
12842 template<typename... Types> struct A {
12843 template<Types... Values> struct B { };
12847 if (code
== TEMPLATE_TYPE_PARM
)
12850 gcc_assert (TYPE_P (arg
));
12852 quals
= cp_type_quals (arg
) | cp_type_quals (t
);
12854 return cp_build_qualified_type_real
12855 (arg
, quals
, complain
| tf_ignore_bad_quals
);
12857 else if (code
== BOUND_TEMPLATE_TEMPLATE_PARM
)
12859 /* We are processing a type constructed from a
12860 template template parameter. */
12861 tree argvec
= tsubst (TYPE_TI_ARGS (t
),
12862 args
, complain
, in_decl
);
12863 if (argvec
== error_mark_node
)
12864 return error_mark_node
;
12866 gcc_assert (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
12867 || TREE_CODE (arg
) == TEMPLATE_DECL
12868 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
);
12870 if (TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
)
12871 /* Consider this code:
12873 template <template <class> class Template>
12875 template <class Arg> using Bind = Template<Arg>;
12878 template <template <class> class Template, class Arg>
12879 using Instantiate = Template<Arg>; //#0
12881 template <template <class> class Template,
12884 Instantiate<Internal<Template>::template Bind,
12887 When #1 is parsed, the
12888 BOUND_TEMPLATE_TEMPLATE_PARM representing the
12889 parameter `Template' in #0 matches the
12890 UNBOUND_CLASS_TEMPLATE representing the argument
12891 `Internal<Template>::template Bind'; We then want
12892 to assemble the type `Bind<Argument>' that can't
12893 be fully created right now, because
12894 `Internal<Template>' not being complete, the Bind
12895 template cannot be looked up in that context. So
12896 we need to "store" `Bind<Argument>' for later
12897 when the context of Bind becomes complete. Let's
12898 store that in a TYPENAME_TYPE. */
12899 return make_typename_type (TYPE_CONTEXT (arg
),
12900 build_nt (TEMPLATE_ID_EXPR
,
12901 TYPE_IDENTIFIER (arg
),
12906 /* We can get a TEMPLATE_TEMPLATE_PARM here when we
12907 are resolving nested-types in the signature of a
12908 member function templates. Otherwise ARG is a
12909 TEMPLATE_DECL and is the real template to be
12911 if (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
12912 arg
= TYPE_NAME (arg
);
12914 r
= lookup_template_class (arg
,
12916 DECL_CONTEXT (arg
),
12917 /*entering_scope=*/0,
12919 return cp_build_qualified_type_real
12920 (r
, cp_type_quals (t
) | cp_type_quals (r
), complain
);
12923 /* TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX. */
12924 return convert_from_reference (unshare_expr (arg
));
12928 /* This can happen during the attempted tsubst'ing in
12929 unify. This means that we don't yet have any information
12930 about the template parameter in question. */
12933 /* If we get here, we must have been looking at a parm for a
12934 more deeply nested template. Make a new version of this
12935 template parameter, but with a lower level. */
12938 case TEMPLATE_TYPE_PARM
:
12939 case TEMPLATE_TEMPLATE_PARM
:
12940 case BOUND_TEMPLATE_TEMPLATE_PARM
:
12941 if (cp_type_quals (t
))
12943 r
= tsubst (TYPE_MAIN_VARIANT (t
), args
, complain
, in_decl
);
12944 r
= cp_build_qualified_type_real
12945 (r
, cp_type_quals (t
),
12946 complain
| (code
== TEMPLATE_TYPE_PARM
12947 ? tf_ignore_bad_quals
: 0));
12949 else if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
12950 && PLACEHOLDER_TYPE_CONSTRAINTS (t
)
12951 && (r
= (TEMPLATE_PARM_DESCENDANTS
12952 (TEMPLATE_TYPE_PARM_INDEX (t
))))
12953 && (r
= TREE_TYPE (r
))
12954 && !PLACEHOLDER_TYPE_CONSTRAINTS (r
))
12955 /* Break infinite recursion when substituting the constraints
12956 of a constrained placeholder. */;
12960 TEMPLATE_TYPE_PARM_INDEX (r
)
12961 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (t
),
12962 r
, levels
, args
, complain
);
12963 TYPE_STUB_DECL (r
) = TYPE_NAME (r
) = TEMPLATE_TYPE_DECL (r
);
12964 TYPE_MAIN_VARIANT (r
) = r
;
12965 TYPE_POINTER_TO (r
) = NULL_TREE
;
12966 TYPE_REFERENCE_TO (r
) = NULL_TREE
;
12968 if (TREE_CODE (r
) == TEMPLATE_TEMPLATE_PARM
)
12969 /* We have reduced the level of the template
12970 template parameter, but not the levels of its
12971 template parameters, so canonical_type_parameter
12972 will not be able to find the canonical template
12973 template parameter for this level. Thus, we
12974 require structural equality checking to compare
12975 TEMPLATE_TEMPLATE_PARMs. */
12976 SET_TYPE_STRUCTURAL_EQUALITY (r
);
12977 else if (TYPE_STRUCTURAL_EQUALITY_P (t
))
12978 SET_TYPE_STRUCTURAL_EQUALITY (r
);
12980 TYPE_CANONICAL (r
) = canonical_type_parameter (r
);
12982 /* Propagate constraints on placeholders. */
12983 if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
12984 if (tree constr
= PLACEHOLDER_TYPE_CONSTRAINTS (t
))
12985 PLACEHOLDER_TYPE_CONSTRAINTS (r
)
12986 = tsubst_constraint (constr
, args
, complain
, in_decl
);
12988 if (code
== BOUND_TEMPLATE_TEMPLATE_PARM
)
12990 tree argvec
= tsubst (TYPE_TI_ARGS (t
), args
,
12991 complain
, in_decl
);
12992 if (argvec
== error_mark_node
)
12993 return error_mark_node
;
12995 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (r
)
12996 = build_template_info (TYPE_TI_TEMPLATE (t
), argvec
);
13001 case TEMPLATE_PARM_INDEX
:
13002 r
= reduce_template_parm_level (t
, type
, levels
, args
, complain
);
13006 gcc_unreachable ();
13014 tree purpose
, value
, chain
;
13016 if (t
== void_list_node
)
13019 purpose
= TREE_PURPOSE (t
);
13022 purpose
= tsubst (purpose
, args
, complain
, in_decl
);
13023 if (purpose
== error_mark_node
)
13024 return error_mark_node
;
13026 value
= TREE_VALUE (t
);
13029 value
= tsubst (value
, args
, complain
, in_decl
);
13030 if (value
== error_mark_node
)
13031 return error_mark_node
;
13033 chain
= TREE_CHAIN (t
);
13034 if (chain
&& chain
!= void_type_node
)
13036 chain
= tsubst (chain
, args
, complain
, in_decl
);
13037 if (chain
== error_mark_node
)
13038 return error_mark_node
;
13040 if (purpose
== TREE_PURPOSE (t
)
13041 && value
== TREE_VALUE (t
)
13042 && chain
== TREE_CHAIN (t
))
13044 return hash_tree_cons (purpose
, value
, chain
);
13048 /* We should never be tsubsting a binfo. */
13049 gcc_unreachable ();
13052 /* A vector of template arguments. */
13053 gcc_assert (!type
);
13054 return tsubst_template_args (t
, args
, complain
, in_decl
);
13057 case REFERENCE_TYPE
:
13059 if (type
== TREE_TYPE (t
) && TREE_CODE (type
) != METHOD_TYPE
)
13064 Type deduction may fail for any of the following
13067 -- Attempting to create a pointer to reference type.
13068 -- Attempting to create a reference to a reference type or
13069 a reference to void.
13071 Core issue 106 says that creating a reference to a reference
13072 during instantiation is no longer a cause for failure. We
13073 only enforce this check in strict C++98 mode. */
13074 if ((TREE_CODE (type
) == REFERENCE_TYPE
13075 && (((cxx_dialect
== cxx98
) && flag_iso
) || code
!= REFERENCE_TYPE
))
13076 || (code
== REFERENCE_TYPE
&& VOID_TYPE_P (type
)))
13078 static location_t last_loc
;
13080 /* We keep track of the last time we issued this error
13081 message to avoid spewing a ton of messages during a
13082 single bad template instantiation. */
13083 if (complain
& tf_error
13084 && last_loc
!= input_location
)
13086 if (VOID_TYPE_P (type
))
13087 error ("forming reference to void");
13088 else if (code
== POINTER_TYPE
)
13089 error ("forming pointer to reference type %qT", type
);
13091 error ("forming reference to reference type %qT", type
);
13092 last_loc
= input_location
;
13095 return error_mark_node
;
13097 else if (TREE_CODE (type
) == FUNCTION_TYPE
13098 && (type_memfn_quals (type
) != TYPE_UNQUALIFIED
13099 || type_memfn_rqual (type
) != REF_QUAL_NONE
))
13101 if (complain
& tf_error
)
13103 if (code
== POINTER_TYPE
)
13104 error ("forming pointer to qualified function type %qT",
13107 error ("forming reference to qualified function type %qT",
13110 return error_mark_node
;
13112 else if (code
== POINTER_TYPE
)
13114 r
= build_pointer_type (type
);
13115 if (TREE_CODE (type
) == METHOD_TYPE
)
13116 r
= build_ptrmemfunc_type (r
);
13118 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
13119 /* In C++0x, during template argument substitution, when there is an
13120 attempt to create a reference to a reference type, reference
13121 collapsing is applied as described in [14.3.1/4 temp.arg.type]:
13123 "If a template-argument for a template-parameter T names a type
13124 that is a reference to a type A, an attempt to create the type
13125 'lvalue reference to cv T' creates the type 'lvalue reference to
13126 A,' while an attempt to create the type type rvalue reference to
13127 cv T' creates the type T"
13129 r
= cp_build_reference_type
13131 TYPE_REF_IS_RVALUE (t
) && TYPE_REF_IS_RVALUE (type
));
13133 r
= cp_build_reference_type (type
, TYPE_REF_IS_RVALUE (t
));
13134 r
= cp_build_qualified_type_real (r
, cp_type_quals (t
), complain
);
13136 if (r
!= error_mark_node
)
13137 /* Will this ever be needed for TYPE_..._TO values? */
13144 r
= tsubst (TYPE_OFFSET_BASETYPE (t
), args
, complain
, in_decl
);
13145 if (r
== error_mark_node
|| !MAYBE_CLASS_TYPE_P (r
))
13149 Type deduction may fail for any of the following
13152 -- Attempting to create "pointer to member of T" when T
13153 is not a class type. */
13154 if (complain
& tf_error
)
13155 error ("creating pointer to member of non-class type %qT", r
);
13156 return error_mark_node
;
13158 if (TREE_CODE (type
) == REFERENCE_TYPE
)
13160 if (complain
& tf_error
)
13161 error ("creating pointer to member reference type %qT", type
);
13162 return error_mark_node
;
13164 if (VOID_TYPE_P (type
))
13166 if (complain
& tf_error
)
13167 error ("creating pointer to member of type void");
13168 return error_mark_node
;
13170 gcc_assert (TREE_CODE (type
) != METHOD_TYPE
);
13171 if (TREE_CODE (type
) == FUNCTION_TYPE
)
13173 /* The type of the implicit object parameter gets its
13174 cv-qualifiers from the FUNCTION_TYPE. */
13177 = build_memfn_type (type
, r
, type_memfn_quals (type
),
13178 type_memfn_rqual (type
));
13179 memptr
= build_ptrmemfunc_type (build_pointer_type (method_type
));
13180 return cp_build_qualified_type_real (memptr
, cp_type_quals (t
),
13184 return cp_build_qualified_type_real (build_ptrmem_type (r
, type
),
13188 case FUNCTION_TYPE
:
13193 fntype
= tsubst_function_type (t
, args
, complain
, in_decl
);
13194 if (fntype
== error_mark_node
)
13195 return error_mark_node
;
13197 /* Substitute the exception specification. */
13198 specs
= tsubst_exception_specification (t
, args
, complain
,
13199 in_decl
, /*defer_ok*/true);
13200 if (specs
== error_mark_node
)
13201 return error_mark_node
;
13203 fntype
= build_exception_variant (fntype
, specs
);
13208 tree domain
= tsubst (TYPE_DOMAIN (t
), args
, complain
, in_decl
);
13209 if (domain
== error_mark_node
)
13210 return error_mark_node
;
13212 /* As an optimization, we avoid regenerating the array type if
13213 it will obviously be the same as T. */
13214 if (type
== TREE_TYPE (t
) && domain
== TYPE_DOMAIN (t
))
13217 /* These checks should match the ones in create_array_type_for_decl.
13221 The deduction may fail for any of the following reasons:
13223 -- Attempting to create an array with an element type that
13224 is void, a function type, or a reference type, or [DR337]
13225 an abstract class type. */
13226 if (VOID_TYPE_P (type
)
13227 || TREE_CODE (type
) == FUNCTION_TYPE
13228 || (TREE_CODE (type
) == ARRAY_TYPE
13229 && TYPE_DOMAIN (type
) == NULL_TREE
)
13230 || TREE_CODE (type
) == REFERENCE_TYPE
)
13232 if (complain
& tf_error
)
13233 error ("creating array of %qT", type
);
13234 return error_mark_node
;
13237 if (abstract_virtuals_error_sfinae (ACU_ARRAY
, type
, complain
))
13238 return error_mark_node
;
13240 r
= build_cplus_array_type (type
, domain
);
13242 if (TYPE_USER_ALIGN (t
))
13244 TYPE_ALIGN (r
) = TYPE_ALIGN (t
);
13245 TYPE_USER_ALIGN (r
) = 1;
13251 case TYPENAME_TYPE
:
13253 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
13254 in_decl
, /*entering_scope=*/1);
13255 tree f
= tsubst_copy (TYPENAME_TYPE_FULLNAME (t
), args
,
13256 complain
, in_decl
);
13258 if (ctx
== error_mark_node
|| f
== error_mark_node
)
13259 return error_mark_node
;
13261 if (!MAYBE_CLASS_TYPE_P (ctx
))
13263 if (complain
& tf_error
)
13264 error ("%qT is not a class, struct, or union type", ctx
);
13265 return error_mark_node
;
13267 else if (!uses_template_parms (ctx
) && !TYPE_BEING_DEFINED (ctx
))
13269 /* Normally, make_typename_type does not require that the CTX
13270 have complete type in order to allow things like:
13272 template <class T> struct S { typename S<T>::X Y; };
13274 But, such constructs have already been resolved by this
13275 point, so here CTX really should have complete type, unless
13276 it's a partial instantiation. */
13277 ctx
= complete_type (ctx
);
13278 if (!COMPLETE_TYPE_P (ctx
))
13280 if (complain
& tf_error
)
13281 cxx_incomplete_type_error (NULL_TREE
, ctx
);
13282 return error_mark_node
;
13286 f
= make_typename_type (ctx
, f
, typename_type
,
13287 complain
| tf_keep_type_decl
);
13288 if (f
== error_mark_node
)
13290 if (TREE_CODE (f
) == TYPE_DECL
)
13292 complain
|= tf_ignore_bad_quals
;
13296 if (TREE_CODE (f
) != TYPENAME_TYPE
)
13298 if (TYPENAME_IS_ENUM_P (t
) && TREE_CODE (f
) != ENUMERAL_TYPE
)
13300 if (complain
& tf_error
)
13301 error ("%qT resolves to %qT, which is not an enumeration type",
13304 return error_mark_node
;
13306 else if (TYPENAME_IS_CLASS_P (t
) && !CLASS_TYPE_P (f
))
13308 if (complain
& tf_error
)
13309 error ("%qT resolves to %qT, which is is not a class type",
13312 return error_mark_node
;
13316 return cp_build_qualified_type_real
13317 (f
, cp_type_quals (f
) | cp_type_quals (t
), complain
);
13320 case UNBOUND_CLASS_TEMPLATE
:
13322 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
13323 in_decl
, /*entering_scope=*/1);
13324 tree name
= TYPE_IDENTIFIER (t
);
13325 tree parm_list
= DECL_TEMPLATE_PARMS (TYPE_NAME (t
));
13327 if (ctx
== error_mark_node
|| name
== error_mark_node
)
13328 return error_mark_node
;
13331 parm_list
= tsubst_template_parms (parm_list
, args
, complain
);
13332 return make_unbound_class_template (ctx
, name
, parm_list
, complain
);
13339 ++cp_unevaluated_operand
;
13340 ++c_inhibit_evaluation_warnings
;
13342 type
= tsubst_expr (TYPEOF_TYPE_EXPR (t
), args
,
13344 /*integral_constant_expression_p=*/false);
13346 --cp_unevaluated_operand
;
13347 --c_inhibit_evaluation_warnings
;
13349 type
= finish_typeof (type
);
13350 return cp_build_qualified_type_real (type
,
13352 | cp_type_quals (type
),
13356 case DECLTYPE_TYPE
:
13360 ++cp_unevaluated_operand
;
13361 ++c_inhibit_evaluation_warnings
;
13363 type
= tsubst_copy_and_build (DECLTYPE_TYPE_EXPR (t
), args
,
13364 complain
|tf_decltype
, in_decl
,
13365 /*function_p*/false,
13366 /*integral_constant_expression*/false);
13368 --cp_unevaluated_operand
;
13369 --c_inhibit_evaluation_warnings
;
13371 if (DECLTYPE_FOR_LAMBDA_CAPTURE (t
))
13372 type
= lambda_capture_field_type (type
,
13373 DECLTYPE_FOR_INIT_CAPTURE (t
));
13374 else if (DECLTYPE_FOR_LAMBDA_PROXY (t
))
13375 type
= lambda_proxy_type (type
);
13378 bool id
= DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t
);
13379 if (id
&& TREE_CODE (DECLTYPE_TYPE_EXPR (t
)) == BIT_NOT_EXPR
13381 /* In a template ~id could be either a complement expression
13382 or an unqualified-id naming a destructor; if instantiating
13383 it produces an expression, it's not an id-expression or
13386 type
= finish_decltype_type (type
, id
, complain
);
13388 return cp_build_qualified_type_real (type
,
13390 | cp_type_quals (type
),
13391 complain
| tf_ignore_bad_quals
);
13394 case UNDERLYING_TYPE
:
13396 tree type
= tsubst (UNDERLYING_TYPE_TYPE (t
), args
,
13397 complain
, in_decl
);
13398 return finish_underlying_type (type
);
13401 case TYPE_ARGUMENT_PACK
:
13402 case NONTYPE_ARGUMENT_PACK
:
13404 tree r
= TYPE_P (t
) ? cxx_make_type (code
) : make_node (code
);
13406 tsubst_template_args (ARGUMENT_PACK_ARGS (t
),
13410 SET_ARGUMENT_PACK_ARGS (r
, packed_out
);
13412 /* For template nontype argument packs, also substitute into
13414 if (code
== NONTYPE_ARGUMENT_PACK
)
13415 TREE_TYPE (r
) = tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13434 /* We should use one of the expression tsubsts for these codes. */
13435 gcc_unreachable ();
13438 sorry ("use of %qs in template", get_tree_code_name (code
));
13439 return error_mark_node
;
13443 /* Like tsubst_expr for a BASELINK. OBJECT_TYPE, if non-NULL, is the
13444 type of the expression on the left-hand side of the "." or "->"
13448 tsubst_baselink (tree baselink
, tree object_type
,
13449 tree args
, tsubst_flags_t complain
, tree in_decl
)
13452 tree qualifying_scope
;
13455 tree template_args
= 0;
13456 bool template_id_p
= false;
13457 bool qualified
= BASELINK_QUALIFIED_P (baselink
);
13459 /* A baselink indicates a function from a base class. Both the
13460 BASELINK_ACCESS_BINFO and the base class referenced may
13461 indicate bases of the template class, rather than the
13462 instantiated class. In addition, lookups that were not
13463 ambiguous before may be ambiguous now. Therefore, we perform
13464 the lookup again. */
13465 qualifying_scope
= BINFO_TYPE (BASELINK_ACCESS_BINFO (baselink
));
13466 qualifying_scope
= tsubst (qualifying_scope
, args
,
13467 complain
, in_decl
);
13468 fns
= BASELINK_FUNCTIONS (baselink
);
13469 optype
= tsubst (BASELINK_OPTYPE (baselink
), args
, complain
, in_decl
);
13470 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
13472 template_id_p
= true;
13473 template_args
= TREE_OPERAND (fns
, 1);
13474 fns
= TREE_OPERAND (fns
, 0);
13476 template_args
= tsubst_template_args (template_args
, args
,
13477 complain
, in_decl
);
13479 name
= DECL_NAME (get_first_fn (fns
));
13480 if (IDENTIFIER_TYPENAME_P (name
))
13481 name
= mangle_conv_op_name_for_type (optype
);
13482 baselink
= lookup_fnfields (qualifying_scope
, name
, /*protect=*/1);
13484 return error_mark_node
;
13486 /* If lookup found a single function, mark it as used at this
13487 point. (If it lookup found multiple functions the one selected
13488 later by overload resolution will be marked as used at that
13490 if (BASELINK_P (baselink
))
13491 fns
= BASELINK_FUNCTIONS (baselink
);
13492 if (!template_id_p
&& !really_overloaded_fn (fns
)
13493 && !mark_used (OVL_CURRENT (fns
), complain
) && !(complain
& tf_error
))
13494 return error_mark_node
;
13496 /* Add back the template arguments, if present. */
13497 if (BASELINK_P (baselink
) && template_id_p
)
13498 BASELINK_FUNCTIONS (baselink
)
13499 = build_nt (TEMPLATE_ID_EXPR
,
13500 BASELINK_FUNCTIONS (baselink
),
13502 /* Update the conversion operator type. */
13503 BASELINK_OPTYPE (baselink
) = optype
;
13506 object_type
= current_class_type
;
13509 baselink
= adjust_result_of_qualified_name_lookup (baselink
,
13515 /* Like tsubst_expr for a SCOPE_REF, given by QUALIFIED_ID. DONE is
13516 true if the qualified-id will be a postfix-expression in-and-of
13517 itself; false if more of the postfix-expression follows the
13518 QUALIFIED_ID. ADDRESS_P is true if the qualified-id is the operand
13522 tsubst_qualified_id (tree qualified_id
, tree args
,
13523 tsubst_flags_t complain
, tree in_decl
,
13524 bool done
, bool address_p
)
13530 tree template_args
;
13531 location_t loc
= UNKNOWN_LOCATION
;
13533 gcc_assert (TREE_CODE (qualified_id
) == SCOPE_REF
);
13535 /* Figure out what name to look up. */
13536 name
= TREE_OPERAND (qualified_id
, 1);
13537 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
13539 is_template
= true;
13540 loc
= EXPR_LOCATION (name
);
13541 template_args
= TREE_OPERAND (name
, 1);
13543 template_args
= tsubst_template_args (template_args
, args
,
13544 complain
, in_decl
);
13545 name
= TREE_OPERAND (name
, 0);
13549 is_template
= false;
13550 template_args
= NULL_TREE
;
13553 /* Substitute into the qualifying scope. When there are no ARGS, we
13554 are just trying to simplify a non-dependent expression. In that
13555 case the qualifying scope may be dependent, and, in any case,
13556 substituting will not help. */
13557 scope
= TREE_OPERAND (qualified_id
, 0);
13560 scope
= tsubst (scope
, args
, complain
, in_decl
);
13561 expr
= tsubst_copy (name
, args
, complain
, in_decl
);
13566 if (dependent_scope_p (scope
))
13569 expr
= build_min_nt_loc (loc
, TEMPLATE_ID_EXPR
, expr
, template_args
);
13570 return build_qualified_name (NULL_TREE
, scope
, expr
,
13571 QUALIFIED_NAME_IS_TEMPLATE (qualified_id
));
13574 if (!BASELINK_P (name
) && !DECL_P (expr
))
13576 if (TREE_CODE (expr
) == BIT_NOT_EXPR
)
13578 /* A BIT_NOT_EXPR is used to represent a destructor. */
13579 if (!check_dtor_name (scope
, TREE_OPERAND (expr
, 0)))
13581 error ("qualifying type %qT does not match destructor name ~%qT",
13582 scope
, TREE_OPERAND (expr
, 0));
13583 expr
= error_mark_node
;
13586 expr
= lookup_qualified_name (scope
, complete_dtor_identifier
,
13587 /*is_type_p=*/0, false);
13590 expr
= lookup_qualified_name (scope
, expr
, /*is_type_p=*/0, false);
13591 if (TREE_CODE (TREE_CODE (expr
) == TEMPLATE_DECL
13592 ? DECL_TEMPLATE_RESULT (expr
) : expr
) == TYPE_DECL
)
13594 if (complain
& tf_error
)
13596 error ("dependent-name %qE is parsed as a non-type, but "
13597 "instantiation yields a type", qualified_id
);
13598 inform (input_location
, "say %<typename %E%> if a type is meant", qualified_id
);
13600 return error_mark_node
;
13606 check_accessibility_of_qualified_id (expr
, /*object_type=*/NULL_TREE
,
13608 /* Remember that there was a reference to this entity. */
13609 if (!mark_used (expr
, complain
) && !(complain
& tf_error
))
13610 return error_mark_node
;
13613 if (expr
== error_mark_node
|| TREE_CODE (expr
) == TREE_LIST
)
13615 if (complain
& tf_error
)
13616 qualified_name_lookup_error (scope
,
13617 TREE_OPERAND (qualified_id
, 1),
13618 expr
, input_location
);
13619 return error_mark_node
;
13623 expr
= lookup_template_function (expr
, template_args
);
13625 if (expr
== error_mark_node
&& complain
& tf_error
)
13626 qualified_name_lookup_error (scope
, TREE_OPERAND (qualified_id
, 1),
13627 expr
, input_location
);
13628 else if (TYPE_P (scope
))
13630 expr
= (adjust_result_of_qualified_name_lookup
13631 (expr
, scope
, current_nonlambda_class_type ()));
13632 expr
= (finish_qualified_id_expr
13633 (scope
, expr
, done
, address_p
&& PTRMEM_OK_P (qualified_id
),
13634 QUALIFIED_NAME_IS_TEMPLATE (qualified_id
),
13635 /*template_arg_p=*/false, complain
));
13638 /* Expressions do not generally have reference type. */
13639 if (TREE_CODE (expr
) != SCOPE_REF
13640 /* However, if we're about to form a pointer-to-member, we just
13641 want the referenced member referenced. */
13642 && TREE_CODE (expr
) != OFFSET_REF
)
13643 expr
= convert_from_reference (expr
);
13648 /* tsubst the initializer for a VAR_DECL. INIT is the unsubstituted
13649 initializer, DECL is the substituted VAR_DECL. Other arguments are as
13653 tsubst_init (tree init
, tree decl
, tree args
,
13654 tsubst_flags_t complain
, tree in_decl
)
13659 init
= tsubst_expr (init
, args
, complain
, in_decl
, false);
13663 /* If we had an initializer but it
13664 instantiated to nothing,
13665 value-initialize the object. This will
13666 only occur when the initializer was a
13667 pack expansion where the parameter packs
13668 used in that expansion were of length
13670 init
= build_value_init (TREE_TYPE (decl
),
13672 if (TREE_CODE (init
) == AGGR_INIT_EXPR
)
13673 init
= get_target_expr_sfinae (init
, complain
);
13679 /* Like tsubst, but deals with expressions. This function just replaces
13680 template parms; to finish processing the resultant expression, use
13681 tsubst_copy_and_build or tsubst_expr. */
13684 tsubst_copy (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
13686 enum tree_code code
;
13689 if (t
== NULL_TREE
|| t
== error_mark_node
|| args
== NULL_TREE
)
13692 code
= TREE_CODE (t
);
13697 r
= retrieve_local_specialization (t
);
13699 if (r
== NULL_TREE
)
13701 /* We get here for a use of 'this' in an NSDMI. */
13702 if (DECL_NAME (t
) == this_identifier
13703 && current_function_decl
13704 && DECL_CONSTRUCTOR_P (current_function_decl
))
13705 return current_class_ptr
;
13707 /* This can happen for a parameter name used later in a function
13708 declaration (such as in a late-specified return type). Just
13709 make a dummy decl, since it's only used for its type. */
13710 gcc_assert (cp_unevaluated_operand
!= 0);
13711 r
= tsubst_decl (t
, args
, complain
);
13712 /* Give it the template pattern as its context; its true context
13713 hasn't been instantiated yet and this is good enough for
13715 DECL_CONTEXT (r
) = DECL_CONTEXT (t
);
13718 if (TREE_CODE (r
) == ARGUMENT_PACK_SELECT
)
13719 r
= ARGUMENT_PACK_SELECT_ARG (r
);
13720 if (!mark_used (r
, complain
) && !(complain
& tf_error
))
13721 return error_mark_node
;
13729 if (DECL_TEMPLATE_PARM_P (t
))
13730 return tsubst_copy (DECL_INITIAL (t
), args
, complain
, in_decl
);
13731 /* There is no need to substitute into namespace-scope
13733 if (DECL_NAMESPACE_SCOPE_P (t
))
13735 /* If ARGS is NULL, then T is known to be non-dependent. */
13736 if (args
== NULL_TREE
)
13737 return scalar_constant_value (t
);
13739 /* Unfortunately, we cannot just call lookup_name here.
13742 template <int I> int f() {
13744 struct S { void g() { E e = a; } };
13747 When we instantiate f<7>::S::g(), say, lookup_name is not
13748 clever enough to find f<7>::a. */
13750 = tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
13751 /*entering_scope=*/0);
13753 for (v
= TYPE_VALUES (enum_type
);
13755 v
= TREE_CHAIN (v
))
13756 if (TREE_PURPOSE (v
) == DECL_NAME (t
))
13757 return TREE_VALUE (v
);
13759 /* We didn't find the name. That should never happen; if
13760 name-lookup found it during preliminary parsing, we
13761 should find it again here during instantiation. */
13762 gcc_unreachable ();
13767 if (PACK_EXPANSION_P (TREE_TYPE (t
)))
13769 /* Check for a local specialization set up by
13770 tsubst_pack_expansion. */
13771 if (tree r
= retrieve_local_specialization (t
))
13773 if (TREE_CODE (r
) == ARGUMENT_PACK_SELECT
)
13774 r
= ARGUMENT_PACK_SELECT_ARG (r
);
13778 /* When retrieving a capture pack from a generic lambda, remove the
13779 lambda call op's own template argument list from ARGS. Only the
13780 template arguments active for the closure type should be used to
13781 retrieve the pack specialization. */
13782 if (LAMBDA_FUNCTION_P (current_function_decl
)
13783 && (template_class_depth (DECL_CONTEXT (t
))
13784 != TMPL_ARGS_DEPTH (args
)))
13785 args
= strip_innermost_template_args (args
, 1);
13787 /* Otherwise return the full NONTYPE_ARGUMENT_PACK that
13788 tsubst_decl put in the hash table. */
13789 return retrieve_specialization (t
, args
, 0);
13792 if (DECL_CONTEXT (t
))
13796 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
13797 /*entering_scope=*/1);
13798 if (ctx
!= DECL_CONTEXT (t
))
13800 tree r
= lookup_field (ctx
, DECL_NAME (t
), 0, false);
13803 if (complain
& tf_error
)
13804 error ("using invalid field %qD", t
);
13805 return error_mark_node
;
13814 case FUNCTION_DECL
:
13815 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
))
13816 r
= tsubst (t
, args
, complain
, in_decl
);
13817 else if (local_variable_p (t
))
13819 r
= retrieve_local_specialization (t
);
13820 if (r
== NULL_TREE
)
13822 /* First try name lookup to find the instantiation. */
13823 r
= lookup_name (DECL_NAME (t
));
13826 /* Make sure that the one we found is the one we want. */
13827 tree ctx
= DECL_CONTEXT (t
);
13828 if (DECL_LANG_SPECIFIC (ctx
) && DECL_TEMPLATE_INFO (ctx
))
13829 ctx
= tsubst (ctx
, args
, complain
, in_decl
);
13830 if (ctx
!= DECL_CONTEXT (r
))
13838 /* This can happen for a variable used in a
13839 late-specified return type of a local lambda, or for a
13840 local static or constant. Building a new VAR_DECL
13841 should be OK in all those cases. */
13842 r
= tsubst_decl (t
, args
, complain
);
13843 if (decl_maybe_constant_var_p (r
))
13845 /* We can't call cp_finish_decl, so handle the
13846 initializer by hand. */
13847 tree init
= tsubst_init (DECL_INITIAL (t
), r
, args
,
13848 complain
, in_decl
);
13849 if (!processing_template_decl
)
13850 init
= maybe_constant_init (init
);
13851 if (processing_template_decl
13852 ? potential_constant_expression (init
)
13853 : reduced_constant_expression_p (init
))
13854 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r
)
13855 = TREE_CONSTANT (r
) = true;
13856 DECL_INITIAL (r
) = init
;
13858 gcc_assert (cp_unevaluated_operand
|| TREE_STATIC (r
)
13859 || decl_constant_var_p (r
)
13860 || errorcount
|| sorrycount
);
13861 if (!processing_template_decl
)
13863 if (TREE_STATIC (r
))
13864 rest_of_decl_compilation (r
, toplevel_bindings_p (),
13867 r
= process_outer_var_ref (r
, complain
);
13870 /* Remember this for subsequent uses. */
13871 if (local_specializations
)
13872 register_local_specialization (r
, t
);
13877 if (!mark_used (r
, complain
) && !(complain
& tf_error
))
13878 return error_mark_node
;
13881 case NAMESPACE_DECL
:
13885 /* An OVERLOAD will always be a non-dependent overload set; an
13886 overload set from function scope will just be represented with an
13887 IDENTIFIER_NODE, and from class scope with a BASELINK. */
13888 gcc_assert (!uses_template_parms (t
));
13892 return tsubst_baselink (t
, current_nonlambda_class_type (),
13893 args
, complain
, in_decl
);
13895 case TEMPLATE_DECL
:
13896 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
13897 return tsubst (TREE_TYPE (DECL_TEMPLATE_RESULT (t
)),
13898 args
, complain
, in_decl
);
13899 else if (DECL_FUNCTION_TEMPLATE_P (t
) && DECL_MEMBER_TEMPLATE_P (t
))
13900 return tsubst (t
, args
, complain
, in_decl
);
13901 else if (DECL_CLASS_SCOPE_P (t
)
13902 && uses_template_parms (DECL_CONTEXT (t
)))
13904 /* Template template argument like the following example need
13907 template <template <class> class TT> struct C {};
13908 template <class T> struct D {
13909 template <class U> struct E {};
13914 We are processing the template argument `E' in #1 for
13915 the template instantiation #2. Originally, `E' is a
13916 TEMPLATE_DECL with `D<T>' as its DECL_CONTEXT. Now we
13917 have to substitute this with one having context `D<int>'. */
13919 tree context
= tsubst (DECL_CONTEXT (t
), args
, complain
, in_decl
);
13920 return lookup_field (context
, DECL_NAME(t
), 0, false);
13923 /* Ordinary template template argument. */
13927 case REINTERPRET_CAST_EXPR
:
13928 case CONST_CAST_EXPR
:
13929 case STATIC_CAST_EXPR
:
13930 case DYNAMIC_CAST_EXPR
:
13931 case IMPLICIT_CONV_EXPR
:
13935 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13936 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13937 return build1 (code
, type
, op0
);
13941 if (PACK_EXPANSION_P (TREE_OPERAND (t
, 0)))
13944 tree expanded
, op
= TREE_OPERAND (t
, 0);
13947 if (SIZEOF_EXPR_TYPE_P (t
))
13948 op
= TREE_TYPE (op
);
13950 ++cp_unevaluated_operand
;
13951 ++c_inhibit_evaluation_warnings
;
13952 /* We only want to compute the number of arguments. */
13953 expanded
= tsubst_pack_expansion (op
, args
, complain
, in_decl
);
13954 --cp_unevaluated_operand
;
13955 --c_inhibit_evaluation_warnings
;
13957 if (TREE_CODE (expanded
) == TREE_VEC
)
13958 len
= TREE_VEC_LENGTH (expanded
);
13960 if (expanded
== error_mark_node
)
13961 return error_mark_node
;
13962 else if (PACK_EXPANSION_P (expanded
)
13963 || (TREE_CODE (expanded
) == TREE_VEC
13965 && PACK_EXPANSION_P (TREE_VEC_ELT (expanded
, len
-1))))
13967 if (TREE_CODE (expanded
) == TREE_VEC
)
13968 expanded
= TREE_VEC_ELT (expanded
, len
- 1);
13970 if (TYPE_P (expanded
))
13971 return cxx_sizeof_or_alignof_type (expanded
, SIZEOF_EXPR
,
13972 complain
& tf_error
);
13974 return cxx_sizeof_or_alignof_expr (expanded
, SIZEOF_EXPR
,
13975 complain
& tf_error
);
13978 return build_int_cst (size_type_node
, len
);
13980 if (SIZEOF_EXPR_TYPE_P (t
))
13982 r
= tsubst (TREE_TYPE (TREE_OPERAND (t
, 0)),
13983 args
, complain
, in_decl
);
13984 r
= build1 (NOP_EXPR
, r
, error_mark_node
);
13985 r
= build1 (SIZEOF_EXPR
,
13986 tsubst (TREE_TYPE (t
), args
, complain
, in_decl
), r
);
13987 SIZEOF_EXPR_TYPE_P (r
) = 1;
13994 case TRUTH_NOT_EXPR
:
13997 case UNARY_PLUS_EXPR
: /* Unary + */
13999 case AT_ENCODE_EXPR
:
14003 case REALPART_EXPR
:
14004 case IMAGPART_EXPR
:
14007 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14008 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14009 return build1 (code
, type
, op0
);
14012 case COMPONENT_REF
:
14017 object
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14018 name
= TREE_OPERAND (t
, 1);
14019 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
14021 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
14022 complain
, in_decl
);
14023 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
14025 else if (TREE_CODE (name
) == SCOPE_REF
14026 && TREE_CODE (TREE_OPERAND (name
, 1)) == BIT_NOT_EXPR
)
14028 tree base
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
14029 complain
, in_decl
);
14030 name
= TREE_OPERAND (name
, 1);
14031 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
14032 complain
, in_decl
);
14033 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
14034 name
= build_qualified_name (/*type=*/NULL_TREE
,
14036 /*template_p=*/false);
14038 else if (BASELINK_P (name
))
14039 name
= tsubst_baselink (name
,
14040 non_reference (TREE_TYPE (object
)),
14044 name
= tsubst_copy (name
, args
, complain
, in_decl
);
14045 return build_nt (COMPONENT_REF
, object
, name
, NULL_TREE
);
14051 case TRUNC_DIV_EXPR
:
14052 case CEIL_DIV_EXPR
:
14053 case FLOOR_DIV_EXPR
:
14054 case ROUND_DIV_EXPR
:
14055 case EXACT_DIV_EXPR
:
14059 case TRUNC_MOD_EXPR
:
14060 case FLOOR_MOD_EXPR
:
14061 case TRUTH_ANDIF_EXPR
:
14062 case TRUTH_ORIF_EXPR
:
14063 case TRUTH_AND_EXPR
:
14064 case TRUTH_OR_EXPR
:
14077 case COMPOUND_EXPR
:
14080 case PREDECREMENT_EXPR
:
14081 case PREINCREMENT_EXPR
:
14082 case POSTDECREMENT_EXPR
:
14083 case POSTINCREMENT_EXPR
:
14085 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14086 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14087 return build_nt (code
, op0
, op1
);
14092 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14093 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14094 return build_qualified_name (/*type=*/NULL_TREE
, op0
, op1
,
14095 QUALIFIED_NAME_IS_TEMPLATE (t
));
14100 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14101 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14102 return build_nt (ARRAY_REF
, op0
, op1
, NULL_TREE
, NULL_TREE
);
14107 int n
= VL_EXP_OPERAND_LENGTH (t
);
14108 tree result
= build_vl_exp (CALL_EXPR
, n
);
14110 for (i
= 0; i
< n
; i
++)
14111 TREE_OPERAND (t
, i
) = tsubst_copy (TREE_OPERAND (t
, i
), args
,
14112 complain
, in_decl
);
14118 case PSEUDO_DTOR_EXPR
:
14119 case VEC_PERM_EXPR
:
14121 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14122 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14123 tree op2
= tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
14124 r
= build_nt (code
, op0
, op1
, op2
);
14125 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
14131 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14132 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14133 tree op2
= tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
14134 r
= build_nt (code
, op0
, op1
, op2
);
14135 NEW_EXPR_USE_GLOBAL (r
) = NEW_EXPR_USE_GLOBAL (t
);
14141 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14142 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14143 r
= build_nt (code
, op0
, op1
);
14144 DELETE_EXPR_USE_GLOBAL (r
) = DELETE_EXPR_USE_GLOBAL (t
);
14145 DELETE_EXPR_USE_VEC (r
) = DELETE_EXPR_USE_VEC (t
);
14149 case TEMPLATE_ID_EXPR
:
14151 /* Substituted template arguments */
14152 tree fn
= TREE_OPERAND (t
, 0);
14153 tree targs
= TREE_OPERAND (t
, 1);
14155 fn
= tsubst_copy (fn
, args
, complain
, in_decl
);
14157 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
14159 return lookup_template_function (fn
, targs
);
14164 tree purpose
, value
, chain
;
14166 if (t
== void_list_node
)
14169 purpose
= TREE_PURPOSE (t
);
14171 purpose
= tsubst_copy (purpose
, args
, complain
, in_decl
);
14172 value
= TREE_VALUE (t
);
14174 value
= tsubst_copy (value
, args
, complain
, in_decl
);
14175 chain
= TREE_CHAIN (t
);
14176 if (chain
&& chain
!= void_type_node
)
14177 chain
= tsubst_copy (chain
, args
, complain
, in_decl
);
14178 if (purpose
== TREE_PURPOSE (t
)
14179 && value
== TREE_VALUE (t
)
14180 && chain
== TREE_CHAIN (t
))
14182 return tree_cons (purpose
, value
, chain
);
14187 case ENUMERAL_TYPE
:
14189 case TEMPLATE_TYPE_PARM
:
14190 case TEMPLATE_TEMPLATE_PARM
:
14191 case BOUND_TEMPLATE_TEMPLATE_PARM
:
14192 case TEMPLATE_PARM_INDEX
:
14194 case REFERENCE_TYPE
:
14196 case FUNCTION_TYPE
:
14199 case TYPENAME_TYPE
:
14200 case UNBOUND_CLASS_TEMPLATE
:
14202 case DECLTYPE_TYPE
:
14204 return tsubst (t
, args
, complain
, in_decl
);
14208 /* Fall through. */
14209 case IDENTIFIER_NODE
:
14210 if (IDENTIFIER_TYPENAME_P (t
))
14212 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14213 return mangle_conv_op_name_for_type (new_type
);
14219 /* This is handled by tsubst_copy_and_build. */
14220 gcc_unreachable ();
14224 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14225 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14226 return build_x_va_arg (EXPR_LOCATION (t
), op0
, type
);
14229 case CLEANUP_POINT_EXPR
:
14230 /* We shouldn't have built any of these during initial template
14231 generation. Instead, they should be built during instantiation
14232 in response to the saved STMT_IS_FULL_EXPR_P setting. */
14233 gcc_unreachable ();
14237 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14238 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14239 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14240 r
= build2 (code
, type
, op0
, op1
);
14241 PTRMEM_OK_P (r
) = PTRMEM_OK_P (t
);
14242 if (!mark_used (TREE_OPERAND (r
, 1), complain
)
14243 && !(complain
& tf_error
))
14244 return error_mark_node
;
14248 case EXPR_PACK_EXPANSION
:
14249 error ("invalid use of pack expansion expression");
14250 return error_mark_node
;
14252 case NONTYPE_ARGUMENT_PACK
:
14253 error ("use %<...%> to expand argument pack");
14254 return error_mark_node
;
14257 gcc_checking_assert (t
== void_node
&& VOID_TYPE_P (TREE_TYPE (t
)));
14265 /* Instantiate any typedefs in the type. */
14266 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14267 r
= fold_convert (type
, t
);
14268 gcc_assert (TREE_CODE (r
) == code
);
14273 /* These can sometimes show up in a partial instantiation, but never
14274 involve template parms. */
14275 gcc_assert (!uses_template_parms (t
));
14278 case UNARY_LEFT_FOLD_EXPR
:
14279 return tsubst_unary_left_fold (t
, args
, complain
, in_decl
);
14280 case UNARY_RIGHT_FOLD_EXPR
:
14281 return tsubst_unary_right_fold (t
, args
, complain
, in_decl
);
14282 case BINARY_LEFT_FOLD_EXPR
:
14283 return tsubst_binary_left_fold (t
, args
, complain
, in_decl
);
14284 case BINARY_RIGHT_FOLD_EXPR
:
14285 return tsubst_binary_right_fold (t
, args
, complain
, in_decl
);
14288 /* We shouldn't get here, but keep going if !flag_checking. */
14290 gcc_unreachable ();
14295 /* Helper function for tsubst_omp_clauses, used for instantiation of
14296 OMP_CLAUSE_DECL of clauses. */
14299 tsubst_omp_clause_decl (tree decl
, tree args
, tsubst_flags_t complain
,
14302 if (decl
== NULL_TREE
)
14305 /* Handle an OpenMP array section represented as a TREE_LIST (or
14306 OMP_CLAUSE_DEPEND_KIND). An OMP_CLAUSE_DEPEND (with a depend
14307 kind of OMP_CLAUSE_DEPEND_SINK) can also be represented as a
14308 TREE_LIST. We can handle it exactly the same as an array section
14309 (purpose, value, and a chain), even though the nomenclature
14310 (low_bound, length, etc) is different. */
14311 if (TREE_CODE (decl
) == TREE_LIST
)
14314 = tsubst_expr (TREE_PURPOSE (decl
), args
, complain
, in_decl
,
14315 /*integral_constant_expression_p=*/false);
14316 tree length
= tsubst_expr (TREE_VALUE (decl
), args
, complain
, in_decl
,
14317 /*integral_constant_expression_p=*/false);
14318 tree chain
= tsubst_omp_clause_decl (TREE_CHAIN (decl
), args
, complain
,
14320 if (TREE_PURPOSE (decl
) == low_bound
14321 && TREE_VALUE (decl
) == length
14322 && TREE_CHAIN (decl
) == chain
)
14324 tree ret
= tree_cons (low_bound
, length
, chain
);
14325 OMP_CLAUSE_DEPEND_SINK_NEGATIVE (ret
)
14326 = OMP_CLAUSE_DEPEND_SINK_NEGATIVE (decl
);
14329 tree ret
= tsubst_expr (decl
, args
, complain
, in_decl
,
14330 /*integral_constant_expression_p=*/false);
14331 /* Undo convert_from_reference tsubst_expr could have called. */
14333 && REFERENCE_REF_P (ret
)
14334 && !REFERENCE_REF_P (decl
))
14335 ret
= TREE_OPERAND (ret
, 0);
14339 /* Like tsubst_copy, but specifically for OpenMP clauses. */
14342 tsubst_omp_clauses (tree clauses
, bool declare_simd
, bool allow_fields
,
14343 tree args
, tsubst_flags_t complain
, tree in_decl
)
14345 tree new_clauses
= NULL_TREE
, nc
, oc
;
14346 tree linear_no_step
= NULL_TREE
;
14348 for (oc
= clauses
; oc
; oc
= OMP_CLAUSE_CHAIN (oc
))
14350 nc
= copy_node (oc
);
14351 OMP_CLAUSE_CHAIN (nc
) = new_clauses
;
14354 switch (OMP_CLAUSE_CODE (nc
))
14356 case OMP_CLAUSE_LASTPRIVATE
:
14357 if (OMP_CLAUSE_LASTPRIVATE_STMT (oc
))
14359 OMP_CLAUSE_LASTPRIVATE_STMT (nc
) = push_stmt_list ();
14360 tsubst_expr (OMP_CLAUSE_LASTPRIVATE_STMT (oc
), args
, complain
,
14361 in_decl
, /*integral_constant_expression_p=*/false);
14362 OMP_CLAUSE_LASTPRIVATE_STMT (nc
)
14363 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (nc
));
14366 case OMP_CLAUSE_PRIVATE
:
14367 case OMP_CLAUSE_SHARED
:
14368 case OMP_CLAUSE_FIRSTPRIVATE
:
14369 case OMP_CLAUSE_COPYIN
:
14370 case OMP_CLAUSE_COPYPRIVATE
:
14371 case OMP_CLAUSE_UNIFORM
:
14372 case OMP_CLAUSE_DEPEND
:
14373 case OMP_CLAUSE_FROM
:
14374 case OMP_CLAUSE_TO
:
14375 case OMP_CLAUSE_MAP
:
14376 case OMP_CLAUSE_USE_DEVICE_PTR
:
14377 case OMP_CLAUSE_IS_DEVICE_PTR
:
14378 OMP_CLAUSE_DECL (nc
)
14379 = tsubst_omp_clause_decl (OMP_CLAUSE_DECL (oc
), args
, complain
,
14382 case OMP_CLAUSE_IF
:
14383 case OMP_CLAUSE_NUM_THREADS
:
14384 case OMP_CLAUSE_SCHEDULE
:
14385 case OMP_CLAUSE_COLLAPSE
:
14386 case OMP_CLAUSE_FINAL
:
14387 case OMP_CLAUSE_DEVICE
:
14388 case OMP_CLAUSE_DIST_SCHEDULE
:
14389 case OMP_CLAUSE_NUM_TEAMS
:
14390 case OMP_CLAUSE_THREAD_LIMIT
:
14391 case OMP_CLAUSE_SAFELEN
:
14392 case OMP_CLAUSE_SIMDLEN
:
14393 case OMP_CLAUSE_NUM_TASKS
:
14394 case OMP_CLAUSE_GRAINSIZE
:
14395 case OMP_CLAUSE_PRIORITY
:
14396 case OMP_CLAUSE_ORDERED
:
14397 case OMP_CLAUSE_HINT
:
14398 OMP_CLAUSE_OPERAND (nc
, 0)
14399 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 0), args
, complain
,
14400 in_decl
, /*integral_constant_expression_p=*/false);
14402 case OMP_CLAUSE_REDUCTION
:
14403 if (OMP_CLAUSE_REDUCTION_PLACEHOLDER (oc
))
14405 tree placeholder
= OMP_CLAUSE_REDUCTION_PLACEHOLDER (oc
);
14406 if (TREE_CODE (placeholder
) == SCOPE_REF
)
14408 tree scope
= tsubst (TREE_OPERAND (placeholder
, 0), args
,
14409 complain
, in_decl
);
14410 OMP_CLAUSE_REDUCTION_PLACEHOLDER (nc
)
14411 = build_qualified_name (NULL_TREE
, scope
,
14412 TREE_OPERAND (placeholder
, 1),
14416 gcc_assert (identifier_p (placeholder
));
14418 OMP_CLAUSE_DECL (nc
)
14419 = tsubst_omp_clause_decl (OMP_CLAUSE_DECL (oc
), args
, complain
,
14422 case OMP_CLAUSE_LINEAR
:
14423 case OMP_CLAUSE_ALIGNED
:
14424 OMP_CLAUSE_DECL (nc
)
14425 = tsubst_omp_clause_decl (OMP_CLAUSE_DECL (oc
), args
, complain
,
14427 OMP_CLAUSE_OPERAND (nc
, 1)
14428 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 1), args
, complain
,
14429 in_decl
, /*integral_constant_expression_p=*/false);
14430 if (OMP_CLAUSE_CODE (oc
) == OMP_CLAUSE_LINEAR
14431 && OMP_CLAUSE_LINEAR_STEP (oc
) == NULL_TREE
)
14433 gcc_assert (!linear_no_step
);
14434 linear_no_step
= nc
;
14437 case OMP_CLAUSE_NOWAIT
:
14438 case OMP_CLAUSE_DEFAULT
:
14439 case OMP_CLAUSE_UNTIED
:
14440 case OMP_CLAUSE_MERGEABLE
:
14441 case OMP_CLAUSE_INBRANCH
:
14442 case OMP_CLAUSE_NOTINBRANCH
:
14443 case OMP_CLAUSE_PROC_BIND
:
14444 case OMP_CLAUSE_FOR
:
14445 case OMP_CLAUSE_PARALLEL
:
14446 case OMP_CLAUSE_SECTIONS
:
14447 case OMP_CLAUSE_TASKGROUP
:
14448 case OMP_CLAUSE_NOGROUP
:
14449 case OMP_CLAUSE_THREADS
:
14450 case OMP_CLAUSE_SIMD
:
14451 case OMP_CLAUSE_DEFAULTMAP
:
14454 gcc_unreachable ();
14457 switch (OMP_CLAUSE_CODE (nc
))
14459 case OMP_CLAUSE_PRIVATE
:
14460 case OMP_CLAUSE_FIRSTPRIVATE
:
14461 case OMP_CLAUSE_LASTPRIVATE
:
14462 case OMP_CLAUSE_COPYPRIVATE
:
14463 case OMP_CLAUSE_LINEAR
:
14464 case OMP_CLAUSE_REDUCTION
:
14465 case OMP_CLAUSE_USE_DEVICE_PTR
:
14466 case OMP_CLAUSE_IS_DEVICE_PTR
:
14467 /* tsubst_expr on SCOPE_REF results in returning
14468 finish_non_static_data_member result. Undo that here. */
14469 if (TREE_CODE (OMP_CLAUSE_DECL (oc
)) == SCOPE_REF
14470 && (TREE_CODE (TREE_OPERAND (OMP_CLAUSE_DECL (oc
), 1))
14471 == IDENTIFIER_NODE
))
14473 tree t
= OMP_CLAUSE_DECL (nc
);
14476 switch (TREE_CODE (v
))
14478 case COMPONENT_REF
:
14482 case POINTER_PLUS_EXPR
:
14483 v
= TREE_OPERAND (v
, 0);
14486 if (DECL_CONTEXT (v
) == current_function_decl
14487 && DECL_ARTIFICIAL (v
)
14488 && DECL_NAME (v
) == this_identifier
)
14489 OMP_CLAUSE_DECL (nc
) = TREE_OPERAND (t
, 1);
14496 else if (VAR_P (OMP_CLAUSE_DECL (oc
))
14497 && DECL_HAS_VALUE_EXPR_P (OMP_CLAUSE_DECL (oc
))
14498 && DECL_ARTIFICIAL (OMP_CLAUSE_DECL (oc
))
14499 && DECL_LANG_SPECIFIC (OMP_CLAUSE_DECL (oc
))
14500 && DECL_OMP_PRIVATIZED_MEMBER (OMP_CLAUSE_DECL (oc
)))
14502 tree decl
= OMP_CLAUSE_DECL (nc
);
14505 if (!DECL_LANG_SPECIFIC (decl
))
14506 retrofit_lang_decl (decl
);
14507 DECL_OMP_PRIVATIZED_MEMBER (decl
) = 1;
14516 new_clauses
= nreverse (new_clauses
);
14519 new_clauses
= finish_omp_clauses (new_clauses
, allow_fields
);
14520 if (linear_no_step
)
14521 for (nc
= new_clauses
; nc
; nc
= OMP_CLAUSE_CHAIN (nc
))
14522 if (nc
== linear_no_step
)
14524 OMP_CLAUSE_LINEAR_STEP (nc
) = NULL_TREE
;
14528 return new_clauses
;
14531 /* Like tsubst_copy_and_build, but unshare TREE_LIST nodes. */
14534 tsubst_copy_asm_operands (tree t
, tree args
, tsubst_flags_t complain
,
14537 #define RECUR(t) tsubst_copy_asm_operands (t, args, complain, in_decl)
14539 tree purpose
, value
, chain
;
14544 if (TREE_CODE (t
) != TREE_LIST
)
14545 return tsubst_copy_and_build (t
, args
, complain
, in_decl
,
14546 /*function_p=*/false,
14547 /*integral_constant_expression_p=*/false);
14549 if (t
== void_list_node
)
14552 purpose
= TREE_PURPOSE (t
);
14554 purpose
= RECUR (purpose
);
14555 value
= TREE_VALUE (t
);
14558 if (TREE_CODE (value
) != LABEL_DECL
)
14559 value
= RECUR (value
);
14562 value
= lookup_label (DECL_NAME (value
));
14563 gcc_assert (TREE_CODE (value
) == LABEL_DECL
);
14564 TREE_USED (value
) = 1;
14567 chain
= TREE_CHAIN (t
);
14568 if (chain
&& chain
!= void_type_node
)
14569 chain
= RECUR (chain
);
14570 return tree_cons (purpose
, value
, chain
);
14574 /* Used to temporarily communicate the list of #pragma omp parallel
14575 clauses to #pragma omp for instantiation if they are combined
14578 static tree
*omp_parallel_combined_clauses
;
14580 /* Substitute one OMP_FOR iterator. */
14583 tsubst_omp_for_iterator (tree t
, int i
, tree declv
, tree orig_declv
,
14584 tree initv
, tree condv
, tree incrv
, tree
*clauses
,
14585 tree args
, tsubst_flags_t complain
, tree in_decl
,
14586 bool integral_constant_expression_p
)
14588 #define RECUR(NODE) \
14589 tsubst_expr ((NODE), args, complain, in_decl, \
14590 integral_constant_expression_p)
14591 tree decl
, init
, cond
, incr
;
14593 init
= TREE_VEC_ELT (OMP_FOR_INIT (t
), i
);
14594 gcc_assert (TREE_CODE (init
) == MODIFY_EXPR
);
14596 if (orig_declv
&& OMP_FOR_ORIG_DECLS (t
))
14598 tree o
= TREE_VEC_ELT (OMP_FOR_ORIG_DECLS (t
), i
);
14599 TREE_VEC_ELT (orig_declv
, i
) = RECUR (o
);
14602 decl
= TREE_OPERAND (init
, 0);
14603 init
= TREE_OPERAND (init
, 1);
14604 tree decl_expr
= NULL_TREE
;
14605 if (init
&& TREE_CODE (init
) == DECL_EXPR
)
14607 /* We need to jump through some hoops to handle declarations in the
14608 for-init-statement, since we might need to handle auto deduction,
14609 but we need to keep control of initialization. */
14611 init
= DECL_INITIAL (DECL_EXPR_DECL (init
));
14612 decl
= tsubst_decl (decl
, args
, complain
);
14616 if (TREE_CODE (decl
) == SCOPE_REF
)
14618 decl
= RECUR (decl
);
14619 if (TREE_CODE (decl
) == COMPONENT_REF
)
14623 switch (TREE_CODE (v
))
14625 case COMPONENT_REF
:
14629 case POINTER_PLUS_EXPR
:
14630 v
= TREE_OPERAND (v
, 0);
14633 if (DECL_CONTEXT (v
) == current_function_decl
14634 && DECL_ARTIFICIAL (v
)
14635 && DECL_NAME (v
) == this_identifier
)
14637 decl
= TREE_OPERAND (decl
, 1);
14638 decl
= omp_privatize_field (decl
);
14648 decl
= RECUR (decl
);
14650 init
= RECUR (init
);
14652 tree auto_node
= type_uses_auto (TREE_TYPE (decl
));
14653 if (auto_node
&& init
)
14655 = do_auto_deduction (TREE_TYPE (decl
), init
, auto_node
);
14657 gcc_assert (!type_dependent_expression_p (decl
));
14659 if (!CLASS_TYPE_P (TREE_TYPE (decl
)))
14663 /* Declare the variable, but don't let that initialize it. */
14664 tree init_sav
= DECL_INITIAL (DECL_EXPR_DECL (decl_expr
));
14665 DECL_INITIAL (DECL_EXPR_DECL (decl_expr
)) = NULL_TREE
;
14667 DECL_INITIAL (DECL_EXPR_DECL (decl_expr
)) = init_sav
;
14670 cond
= RECUR (TREE_VEC_ELT (OMP_FOR_COND (t
), i
));
14671 incr
= TREE_VEC_ELT (OMP_FOR_INCR (t
), i
);
14672 if (TREE_CODE (incr
) == MODIFY_EXPR
)
14674 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
14675 tree rhs
= RECUR (TREE_OPERAND (incr
, 1));
14676 incr
= build_x_modify_expr (EXPR_LOCATION (incr
), lhs
,
14677 NOP_EXPR
, rhs
, complain
);
14680 incr
= RECUR (incr
);
14681 TREE_VEC_ELT (declv
, i
) = decl
;
14682 TREE_VEC_ELT (initv
, i
) = init
;
14683 TREE_VEC_ELT (condv
, i
) = cond
;
14684 TREE_VEC_ELT (incrv
, i
) = incr
;
14690 /* Declare and initialize the variable. */
14698 for (j
= (omp_parallel_combined_clauses
== NULL
? 1 : 0); j
< 2; j
++)
14700 for (pc
= j
? clauses
: omp_parallel_combined_clauses
; *pc
; )
14702 if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_PRIVATE
14703 && OMP_CLAUSE_DECL (*pc
) == decl
)
14705 else if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_LASTPRIVATE
14706 && OMP_CLAUSE_DECL (*pc
) == decl
)
14710 /* Move lastprivate (decl) clause to OMP_FOR_CLAUSES. */
14712 *pc
= OMP_CLAUSE_CHAIN (c
);
14713 OMP_CLAUSE_CHAIN (c
) = *clauses
;
14716 else if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_FIRSTPRIVATE
14717 && OMP_CLAUSE_DECL (*pc
) == decl
)
14719 error ("iteration variable %qD should not be firstprivate",
14721 *pc
= OMP_CLAUSE_CHAIN (*pc
);
14723 else if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_REDUCTION
14724 && OMP_CLAUSE_DECL (*pc
) == decl
)
14726 error ("iteration variable %qD should not be reduction",
14728 *pc
= OMP_CLAUSE_CHAIN (*pc
);
14731 pc
= &OMP_CLAUSE_CHAIN (*pc
);
14736 if (*pc
== NULL_TREE
)
14738 tree c
= build_omp_clause (input_location
, OMP_CLAUSE_PRIVATE
);
14739 OMP_CLAUSE_DECL (c
) = decl
;
14740 c
= finish_omp_clauses (c
, true);
14743 OMP_CLAUSE_CHAIN (c
) = *clauses
;
14748 cond
= TREE_VEC_ELT (OMP_FOR_COND (t
), i
);
14749 if (COMPARISON_CLASS_P (cond
))
14751 tree op0
= RECUR (TREE_OPERAND (cond
, 0));
14752 tree op1
= RECUR (TREE_OPERAND (cond
, 1));
14753 cond
= build2 (TREE_CODE (cond
), boolean_type_node
, op0
, op1
);
14756 cond
= RECUR (cond
);
14757 incr
= TREE_VEC_ELT (OMP_FOR_INCR (t
), i
);
14758 switch (TREE_CODE (incr
))
14760 case PREINCREMENT_EXPR
:
14761 case PREDECREMENT_EXPR
:
14762 case POSTINCREMENT_EXPR
:
14763 case POSTDECREMENT_EXPR
:
14764 incr
= build2 (TREE_CODE (incr
), TREE_TYPE (decl
),
14765 RECUR (TREE_OPERAND (incr
, 0)), NULL_TREE
);
14768 if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
14769 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
14771 tree rhs
= TREE_OPERAND (incr
, 1);
14772 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
14773 tree rhs0
= RECUR (TREE_OPERAND (rhs
, 0));
14774 tree rhs1
= RECUR (TREE_OPERAND (rhs
, 1));
14775 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
14776 build2 (TREE_CODE (rhs
), TREE_TYPE (decl
),
14780 incr
= RECUR (incr
);
14783 if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
14784 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
14786 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
14787 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
14788 build2 (TREE_CODE (TREE_OPERAND (incr
, 1)),
14789 TREE_TYPE (decl
), lhs
,
14790 RECUR (TREE_OPERAND (incr
, 2))));
14792 else if (TREE_CODE (TREE_OPERAND (incr
, 1)) == NOP_EXPR
14793 && (TREE_CODE (TREE_OPERAND (incr
, 2)) == PLUS_EXPR
14794 || (TREE_CODE (TREE_OPERAND (incr
, 2)) == MINUS_EXPR
)))
14796 tree rhs
= TREE_OPERAND (incr
, 2);
14797 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
14798 tree rhs0
= RECUR (TREE_OPERAND (rhs
, 0));
14799 tree rhs1
= RECUR (TREE_OPERAND (rhs
, 1));
14800 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
14801 build2 (TREE_CODE (rhs
), TREE_TYPE (decl
),
14805 incr
= RECUR (incr
);
14808 incr
= RECUR (incr
);
14812 TREE_VEC_ELT (declv
, i
) = decl
;
14813 TREE_VEC_ELT (initv
, i
) = init
;
14814 TREE_VEC_ELT (condv
, i
) = cond
;
14815 TREE_VEC_ELT (incrv
, i
) = incr
;
14819 /* Like tsubst_copy for expressions, etc. but also does semantic
14823 tsubst_expr (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
,
14824 bool integral_constant_expression_p
)
14826 #define RETURN(EXP) do { r = (EXP); goto out; } while(0)
14827 #define RECUR(NODE) \
14828 tsubst_expr ((NODE), args, complain, in_decl, \
14829 integral_constant_expression_p)
14835 if (t
== NULL_TREE
|| t
== error_mark_node
)
14838 loc
= input_location
;
14839 if (EXPR_HAS_LOCATION (t
))
14840 input_location
= EXPR_LOCATION (t
);
14841 if (STATEMENT_CODE_P (TREE_CODE (t
)))
14842 current_stmt_tree ()->stmts_are_full_exprs_p
= STMT_IS_FULL_EXPR_P (t
);
14844 switch (TREE_CODE (t
))
14846 case STATEMENT_LIST
:
14848 tree_stmt_iterator i
;
14849 for (i
= tsi_start (t
); !tsi_end_p (i
); tsi_next (&i
))
14850 RECUR (tsi_stmt (i
));
14854 case CTOR_INITIALIZER
:
14855 finish_mem_initializers (tsubst_initializer_list
14856 (TREE_OPERAND (t
, 0), args
));
14860 finish_return_stmt (RECUR (TREE_OPERAND (t
, 0)));
14864 tmp
= RECUR (EXPR_STMT_EXPR (t
));
14865 if (EXPR_STMT_STMT_EXPR_RESULT (t
))
14866 finish_stmt_expr_expr (tmp
, cur_stmt_expr
);
14868 finish_expr_stmt (tmp
);
14872 do_using_directive (USING_STMT_NAMESPACE (t
));
14877 tree decl
, pattern_decl
;
14880 pattern_decl
= decl
= DECL_EXPR_DECL (t
);
14881 if (TREE_CODE (decl
) == LABEL_DECL
)
14882 finish_label_decl (DECL_NAME (decl
));
14883 else if (TREE_CODE (decl
) == USING_DECL
)
14885 tree scope
= USING_DECL_SCOPE (decl
);
14886 tree name
= DECL_NAME (decl
);
14889 scope
= tsubst (scope
, args
, complain
, in_decl
);
14890 decl
= lookup_qualified_name (scope
, name
,
14891 /*is_type_p=*/false,
14892 /*complain=*/false);
14893 if (decl
== error_mark_node
|| TREE_CODE (decl
) == TREE_LIST
)
14894 qualified_name_lookup_error (scope
, name
, decl
, input_location
);
14896 do_local_using_decl (decl
, scope
, name
);
14898 else if (DECL_PACK_P (decl
))
14900 /* Don't build up decls for a variadic capture proxy, we'll
14901 instantiate the elements directly as needed. */
14906 init
= DECL_INITIAL (decl
);
14907 decl
= tsubst (decl
, args
, complain
, in_decl
);
14908 if (decl
!= error_mark_node
)
14910 /* By marking the declaration as instantiated, we avoid
14911 trying to instantiate it. Since instantiate_decl can't
14912 handle local variables, and since we've already done
14913 all that needs to be done, that's the right thing to
14916 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
14918 && ANON_AGGR_TYPE_P (TREE_TYPE (decl
)))
14919 /* Anonymous aggregates are a special case. */
14920 finish_anon_union (decl
);
14921 else if (is_capture_proxy (DECL_EXPR_DECL (t
)))
14923 DECL_CONTEXT (decl
) = current_function_decl
;
14924 if (DECL_NAME (decl
) == this_identifier
)
14926 tree lam
= DECL_CONTEXT (current_function_decl
);
14927 lam
= CLASSTYPE_LAMBDA_EXPR (lam
);
14928 LAMBDA_EXPR_THIS_CAPTURE (lam
) = decl
;
14930 insert_capture_proxy (decl
);
14932 else if (DECL_IMPLICIT_TYPEDEF_P (t
))
14933 /* We already did a pushtag. */;
14934 else if (TREE_CODE (decl
) == FUNCTION_DECL
14935 && DECL_OMP_DECLARE_REDUCTION_P (decl
)
14936 && DECL_FUNCTION_SCOPE_P (pattern_decl
))
14938 DECL_CONTEXT (decl
) = NULL_TREE
;
14940 DECL_CONTEXT (decl
) = current_function_decl
;
14941 cp_check_omp_declare_reduction (decl
);
14945 int const_init
= false;
14946 maybe_push_decl (decl
);
14948 && DECL_PRETTY_FUNCTION_P (decl
))
14950 /* For __PRETTY_FUNCTION__ we have to adjust the
14952 const char *const name
14953 = cxx_printable_name (current_function_decl
, 2);
14954 init
= cp_fname_init (name
, &TREE_TYPE (decl
));
14957 init
= tsubst_init (init
, decl
, args
, complain
, in_decl
);
14960 const_init
= (DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P
14962 cp_finish_decl (decl
, init
, const_init
, NULL_TREE
, 0);
14971 stmt
= begin_for_stmt (NULL_TREE
, NULL_TREE
);
14972 RECUR (FOR_INIT_STMT (t
));
14973 finish_for_init_stmt (stmt
);
14974 tmp
= RECUR (FOR_COND (t
));
14975 finish_for_cond (tmp
, stmt
, false);
14976 tmp
= RECUR (FOR_EXPR (t
));
14977 finish_for_expr (tmp
, stmt
);
14978 RECUR (FOR_BODY (t
));
14979 finish_for_stmt (stmt
);
14982 case RANGE_FOR_STMT
:
14985 stmt
= begin_for_stmt (NULL_TREE
, NULL_TREE
);
14986 decl
= RANGE_FOR_DECL (t
);
14987 decl
= tsubst (decl
, args
, complain
, in_decl
);
14988 maybe_push_decl (decl
);
14989 expr
= RECUR (RANGE_FOR_EXPR (t
));
14990 stmt
= cp_convert_range_for (stmt
, decl
, expr
, RANGE_FOR_IVDEP (t
));
14991 RECUR (RANGE_FOR_BODY (t
));
14992 finish_for_stmt (stmt
);
14997 stmt
= begin_while_stmt ();
14998 tmp
= RECUR (WHILE_COND (t
));
14999 finish_while_stmt_cond (tmp
, stmt
, false);
15000 RECUR (WHILE_BODY (t
));
15001 finish_while_stmt (stmt
);
15005 stmt
= begin_do_stmt ();
15006 RECUR (DO_BODY (t
));
15007 finish_do_body (stmt
);
15008 tmp
= RECUR (DO_COND (t
));
15009 finish_do_stmt (tmp
, stmt
, false);
15013 stmt
= begin_if_stmt ();
15014 tmp
= RECUR (IF_COND (t
));
15015 finish_if_stmt_cond (tmp
, stmt
);
15016 RECUR (THEN_CLAUSE (t
));
15017 finish_then_clause (stmt
);
15019 if (ELSE_CLAUSE (t
))
15021 begin_else_clause (stmt
);
15022 RECUR (ELSE_CLAUSE (t
));
15023 finish_else_clause (stmt
);
15026 finish_if_stmt (stmt
);
15030 if (BIND_EXPR_BODY_BLOCK (t
))
15031 stmt
= begin_function_body ();
15033 stmt
= begin_compound_stmt (BIND_EXPR_TRY_BLOCK (t
)
15034 ? BCS_TRY_BLOCK
: 0);
15036 RECUR (BIND_EXPR_BODY (t
));
15038 if (BIND_EXPR_BODY_BLOCK (t
))
15039 finish_function_body (stmt
);
15041 finish_compound_stmt (stmt
);
15045 finish_break_stmt ();
15048 case CONTINUE_STMT
:
15049 finish_continue_stmt ();
15053 stmt
= begin_switch_stmt ();
15054 tmp
= RECUR (SWITCH_STMT_COND (t
));
15055 finish_switch_cond (tmp
, stmt
);
15056 RECUR (SWITCH_STMT_BODY (t
));
15057 finish_switch_stmt (stmt
);
15060 case CASE_LABEL_EXPR
:
15062 tree low
= RECUR (CASE_LOW (t
));
15063 tree high
= RECUR (CASE_HIGH (t
));
15064 finish_case_label (EXPR_LOCATION (t
), low
, high
);
15070 tree decl
= LABEL_EXPR_LABEL (t
);
15073 label
= finish_label_stmt (DECL_NAME (decl
));
15074 if (DECL_ATTRIBUTES (decl
) != NULL_TREE
)
15075 cplus_decl_attributes (&label
, DECL_ATTRIBUTES (decl
), 0);
15080 tmp
= GOTO_DESTINATION (t
);
15081 if (TREE_CODE (tmp
) != LABEL_DECL
)
15082 /* Computed goto's must be tsubst'd into. On the other hand,
15083 non-computed gotos must not be; the identifier in question
15084 will have no binding. */
15087 tmp
= DECL_NAME (tmp
);
15088 finish_goto_stmt (tmp
);
15093 tree string
= RECUR (ASM_STRING (t
));
15094 tree outputs
= tsubst_copy_asm_operands (ASM_OUTPUTS (t
), args
,
15095 complain
, in_decl
);
15096 tree inputs
= tsubst_copy_asm_operands (ASM_INPUTS (t
), args
,
15097 complain
, in_decl
);
15098 tree clobbers
= tsubst_copy_asm_operands (ASM_CLOBBERS (t
), args
,
15099 complain
, in_decl
);
15100 tree labels
= tsubst_copy_asm_operands (ASM_LABELS (t
), args
,
15101 complain
, in_decl
);
15102 tmp
= finish_asm_stmt (ASM_VOLATILE_P (t
), string
, outputs
, inputs
,
15104 tree asm_expr
= tmp
;
15105 if (TREE_CODE (asm_expr
) == CLEANUP_POINT_EXPR
)
15106 asm_expr
= TREE_OPERAND (asm_expr
, 0);
15107 ASM_INPUT_P (asm_expr
) = ASM_INPUT_P (t
);
15114 stmt
= begin_try_block ();
15115 RECUR (TRY_STMTS (t
));
15116 finish_cleanup_try_block (stmt
);
15117 finish_cleanup (RECUR (TRY_HANDLERS (t
)), stmt
);
15121 tree compound_stmt
= NULL_TREE
;
15123 if (FN_TRY_BLOCK_P (t
))
15124 stmt
= begin_function_try_block (&compound_stmt
);
15126 stmt
= begin_try_block ();
15128 RECUR (TRY_STMTS (t
));
15130 if (FN_TRY_BLOCK_P (t
))
15131 finish_function_try_block (stmt
);
15133 finish_try_block (stmt
);
15135 RECUR (TRY_HANDLERS (t
));
15136 if (FN_TRY_BLOCK_P (t
))
15137 finish_function_handler_sequence (stmt
, compound_stmt
);
15139 finish_handler_sequence (stmt
);
15145 tree decl
= HANDLER_PARMS (t
);
15149 decl
= tsubst (decl
, args
, complain
, in_decl
);
15150 /* Prevent instantiate_decl from trying to instantiate
15151 this variable. We've already done all that needs to be
15153 if (decl
!= error_mark_node
)
15154 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
15156 stmt
= begin_handler ();
15157 finish_handler_parms (decl
, stmt
);
15158 RECUR (HANDLER_BODY (t
));
15159 finish_handler (stmt
);
15164 tmp
= tsubst (TREE_TYPE (t
), args
, complain
, NULL_TREE
);
15165 if (CLASS_TYPE_P (tmp
))
15167 /* Local classes are not independent templates; they are
15168 instantiated along with their containing function. And this
15169 way we don't have to deal with pushing out of one local class
15170 to instantiate a member of another local class. */
15172 /* Closures are handled by the LAMBDA_EXPR. */
15173 gcc_assert (!LAMBDA_TYPE_P (TREE_TYPE (t
)));
15174 complete_type (tmp
);
15175 for (fn
= TYPE_METHODS (tmp
); fn
; fn
= DECL_CHAIN (fn
))
15176 if (!DECL_ARTIFICIAL (fn
))
15177 instantiate_decl (fn
, /*defer_ok*/0, /*expl_inst_class*/false);
15181 case STATIC_ASSERT
:
15185 ++c_inhibit_evaluation_warnings
;
15187 tsubst_expr (STATIC_ASSERT_CONDITION (t
),
15190 /*integral_constant_expression_p=*/true);
15191 --c_inhibit_evaluation_warnings
;
15193 finish_static_assert (condition
,
15194 STATIC_ASSERT_MESSAGE (t
),
15195 STATIC_ASSERT_SOURCE_LOCATION (t
),
15196 /*member_p=*/false);
15201 r
= push_omp_privatization_clauses (OMP_PARALLEL_COMBINED (t
));
15202 tmp
= tsubst_omp_clauses (OMP_PARALLEL_CLAUSES (t
), false, true,
15203 args
, complain
, in_decl
);
15204 if (OMP_PARALLEL_COMBINED (t
))
15205 omp_parallel_combined_clauses
= &tmp
;
15206 stmt
= begin_omp_parallel ();
15207 RECUR (OMP_PARALLEL_BODY (t
));
15208 gcc_assert (omp_parallel_combined_clauses
== NULL
);
15209 OMP_PARALLEL_COMBINED (finish_omp_parallel (tmp
, stmt
))
15210 = OMP_PARALLEL_COMBINED (t
);
15211 pop_omp_privatization_clauses (r
);
15215 r
= push_omp_privatization_clauses (false);
15216 tmp
= tsubst_omp_clauses (OMP_TASK_CLAUSES (t
), false, true,
15217 args
, complain
, in_decl
);
15218 stmt
= begin_omp_task ();
15219 RECUR (OMP_TASK_BODY (t
));
15220 finish_omp_task (tmp
, stmt
);
15221 pop_omp_privatization_clauses (r
);
15228 case OMP_DISTRIBUTE
:
15231 tree clauses
, body
, pre_body
;
15232 tree declv
= NULL_TREE
, initv
= NULL_TREE
, condv
= NULL_TREE
;
15233 tree orig_declv
= NULL_TREE
;
15234 tree incrv
= NULL_TREE
;
15237 r
= push_omp_privatization_clauses (OMP_FOR_INIT (t
) == NULL_TREE
);
15238 clauses
= tsubst_omp_clauses (OMP_FOR_CLAUSES (t
), false, true,
15239 args
, complain
, in_decl
);
15240 if (OMP_FOR_INIT (t
) != NULL_TREE
)
15242 declv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
15243 if (TREE_CODE (t
) == OMP_FOR
&& OMP_FOR_ORIG_DECLS (t
))
15244 orig_declv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
15245 initv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
15246 condv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
15247 incrv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
15250 stmt
= begin_omp_structured_block ();
15252 pre_body
= push_stmt_list ();
15253 RECUR (OMP_FOR_PRE_BODY (t
));
15254 pre_body
= pop_stmt_list (pre_body
);
15256 if (OMP_FOR_INIT (t
) != NULL_TREE
)
15257 for (i
= 0; i
< TREE_VEC_LENGTH (OMP_FOR_INIT (t
)); i
++)
15258 tsubst_omp_for_iterator (t
, i
, declv
, orig_declv
, initv
, condv
,
15259 incrv
, &clauses
, args
, complain
, in_decl
,
15260 integral_constant_expression_p
);
15261 omp_parallel_combined_clauses
= NULL
;
15263 body
= push_stmt_list ();
15264 RECUR (OMP_FOR_BODY (t
));
15265 body
= pop_stmt_list (body
);
15267 if (OMP_FOR_INIT (t
) != NULL_TREE
)
15268 t
= finish_omp_for (EXPR_LOCATION (t
), TREE_CODE (t
), declv
,
15269 orig_declv
, initv
, condv
, incrv
, body
, pre_body
,
15273 t
= make_node (TREE_CODE (t
));
15274 TREE_TYPE (t
) = void_type_node
;
15275 OMP_FOR_BODY (t
) = body
;
15276 OMP_FOR_PRE_BODY (t
) = pre_body
;
15277 OMP_FOR_CLAUSES (t
) = clauses
;
15278 SET_EXPR_LOCATION (t
, EXPR_LOCATION (t
));
15282 add_stmt (finish_omp_structured_block (stmt
));
15283 pop_omp_privatization_clauses (r
);
15288 omp_parallel_combined_clauses
= NULL
;
15293 r
= push_omp_privatization_clauses (TREE_CODE (t
) == OMP_TEAMS
15294 && OMP_TEAMS_COMBINED (t
));
15295 tmp
= tsubst_omp_clauses (OMP_CLAUSES (t
), false, true,
15296 args
, complain
, in_decl
);
15297 stmt
= push_stmt_list ();
15298 RECUR (OMP_BODY (t
));
15299 stmt
= pop_stmt_list (stmt
);
15302 OMP_BODY (t
) = stmt
;
15303 OMP_CLAUSES (t
) = tmp
;
15305 pop_omp_privatization_clauses (r
);
15308 case OMP_TARGET_DATA
:
15310 tmp
= tsubst_omp_clauses (OMP_CLAUSES (t
), false, true,
15311 args
, complain
, in_decl
);
15312 keep_next_level (true);
15313 stmt
= begin_omp_structured_block ();
15315 RECUR (OMP_BODY (t
));
15316 stmt
= finish_omp_structured_block (stmt
);
15319 OMP_BODY (t
) = stmt
;
15320 OMP_CLAUSES (t
) = tmp
;
15324 case OMP_TARGET_UPDATE
:
15325 case OMP_TARGET_ENTER_DATA
:
15326 case OMP_TARGET_EXIT_DATA
:
15327 tmp
= tsubst_omp_clauses (OMP_STANDALONE_CLAUSES (t
), false, true,
15328 args
, complain
, in_decl
);
15330 OMP_STANDALONE_CLAUSES (t
) = tmp
;
15335 tmp
= tsubst_omp_clauses (OMP_ORDERED_CLAUSES (t
), false, true,
15336 args
, complain
, in_decl
);
15337 stmt
= push_stmt_list ();
15338 RECUR (OMP_BODY (t
));
15339 stmt
= pop_stmt_list (stmt
);
15342 OMP_BODY (t
) = stmt
;
15343 OMP_ORDERED_CLAUSES (t
) = tmp
;
15349 case OMP_TASKGROUP
:
15350 stmt
= push_stmt_list ();
15351 RECUR (OMP_BODY (t
));
15352 stmt
= pop_stmt_list (stmt
);
15355 OMP_BODY (t
) = stmt
;
15360 gcc_assert (OMP_ATOMIC_DEPENDENT_P (t
));
15361 if (TREE_CODE (TREE_OPERAND (t
, 1)) != MODIFY_EXPR
)
15363 tree op1
= TREE_OPERAND (t
, 1);
15364 tree rhs1
= NULL_TREE
;
15366 if (TREE_CODE (op1
) == COMPOUND_EXPR
)
15368 rhs1
= RECUR (TREE_OPERAND (op1
, 0));
15369 op1
= TREE_OPERAND (op1
, 1);
15371 lhs
= RECUR (TREE_OPERAND (op1
, 0));
15372 rhs
= RECUR (TREE_OPERAND (op1
, 1));
15373 finish_omp_atomic (OMP_ATOMIC
, TREE_CODE (op1
), lhs
, rhs
,
15374 NULL_TREE
, NULL_TREE
, rhs1
,
15375 OMP_ATOMIC_SEQ_CST (t
));
15379 tree op1
= TREE_OPERAND (t
, 1);
15380 tree v
= NULL_TREE
, lhs
, rhs
= NULL_TREE
, lhs1
= NULL_TREE
;
15381 tree rhs1
= NULL_TREE
;
15382 enum tree_code code
= TREE_CODE (TREE_OPERAND (op1
, 1));
15383 enum tree_code opcode
= NOP_EXPR
;
15384 if (code
== OMP_ATOMIC_READ
)
15386 v
= RECUR (TREE_OPERAND (op1
, 0));
15387 lhs
= RECUR (TREE_OPERAND (TREE_OPERAND (op1
, 1), 0));
15389 else if (code
== OMP_ATOMIC_CAPTURE_OLD
15390 || code
== OMP_ATOMIC_CAPTURE_NEW
)
15392 tree op11
= TREE_OPERAND (TREE_OPERAND (op1
, 1), 1);
15393 v
= RECUR (TREE_OPERAND (op1
, 0));
15394 lhs1
= RECUR (TREE_OPERAND (TREE_OPERAND (op1
, 1), 0));
15395 if (TREE_CODE (op11
) == COMPOUND_EXPR
)
15397 rhs1
= RECUR (TREE_OPERAND (op11
, 0));
15398 op11
= TREE_OPERAND (op11
, 1);
15400 lhs
= RECUR (TREE_OPERAND (op11
, 0));
15401 rhs
= RECUR (TREE_OPERAND (op11
, 1));
15402 opcode
= TREE_CODE (op11
);
15403 if (opcode
== MODIFY_EXPR
)
15409 lhs
= RECUR (TREE_OPERAND (op1
, 0));
15410 rhs
= RECUR (TREE_OPERAND (op1
, 1));
15412 finish_omp_atomic (code
, opcode
, lhs
, rhs
, v
, lhs1
, rhs1
,
15413 OMP_ATOMIC_SEQ_CST (t
));
15417 case TRANSACTION_EXPR
:
15420 flags
|= (TRANSACTION_EXPR_OUTER (t
) ? TM_STMT_ATTR_OUTER
: 0);
15421 flags
|= (TRANSACTION_EXPR_RELAXED (t
) ? TM_STMT_ATTR_RELAXED
: 0);
15423 if (TRANSACTION_EXPR_IS_STMT (t
))
15425 tree body
= TRANSACTION_EXPR_BODY (t
);
15426 tree noex
= NULL_TREE
;
15427 if (TREE_CODE (body
) == MUST_NOT_THROW_EXPR
)
15429 noex
= MUST_NOT_THROW_COND (body
);
15430 if (noex
== NULL_TREE
)
15431 noex
= boolean_true_node
;
15432 body
= TREE_OPERAND (body
, 0);
15434 stmt
= begin_transaction_stmt (input_location
, NULL
, flags
);
15436 finish_transaction_stmt (stmt
, NULL
, flags
, RECUR (noex
));
15440 stmt
= build_transaction_expr (EXPR_LOCATION (t
),
15441 RECUR (TRANSACTION_EXPR_BODY (t
)),
15448 case MUST_NOT_THROW_EXPR
:
15450 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15451 tree cond
= RECUR (MUST_NOT_THROW_COND (t
));
15452 RETURN (build_must_not_throw_expr (op0
, cond
));
15455 case EXPR_PACK_EXPANSION
:
15456 error ("invalid use of pack expansion expression");
15457 RETURN (error_mark_node
);
15459 case NONTYPE_ARGUMENT_PACK
:
15460 error ("use %<...%> to expand argument pack");
15461 RETURN (error_mark_node
);
15463 case CILK_SPAWN_STMT
:
15464 cfun
->calls_cilk_spawn
= 1;
15465 RETURN (build_cilk_spawn (EXPR_LOCATION (t
), RECUR (CILK_SPAWN_FN (t
))));
15467 case CILK_SYNC_STMT
:
15468 RETURN (build_cilk_sync ());
15470 case COMPOUND_EXPR
:
15471 tmp
= RECUR (TREE_OPERAND (t
, 0));
15472 if (tmp
== NULL_TREE
)
15473 /* If the first operand was a statement, we're done with it. */
15474 RETURN (RECUR (TREE_OPERAND (t
, 1)));
15475 RETURN (build_x_compound_expr (EXPR_LOCATION (t
), tmp
,
15476 RECUR (TREE_OPERAND (t
, 1)),
15479 case ANNOTATE_EXPR
:
15480 tmp
= RECUR (TREE_OPERAND (t
, 0));
15481 RETURN (build2_loc (EXPR_LOCATION (t
), ANNOTATE_EXPR
,
15482 TREE_TYPE (tmp
), tmp
, RECUR (TREE_OPERAND (t
, 1))));
15485 gcc_assert (!STATEMENT_CODE_P (TREE_CODE (t
)));
15487 RETURN (tsubst_copy_and_build (t
, args
, complain
, in_decl
,
15488 /*function_p=*/false,
15489 integral_constant_expression_p
));
15492 RETURN (NULL_TREE
);
15494 input_location
= loc
;
15500 /* Instantiate the special body of the artificial DECL_OMP_DECLARE_REDUCTION
15501 function. For description of the body see comment above
15502 cp_parser_omp_declare_reduction_exprs. */
15505 tsubst_omp_udr (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
15507 if (t
== NULL_TREE
|| t
== error_mark_node
)
15510 gcc_assert (TREE_CODE (t
) == STATEMENT_LIST
);
15512 tree_stmt_iterator tsi
;
15515 memset (stmts
, 0, sizeof stmts
);
15516 for (i
= 0, tsi
= tsi_start (t
);
15517 i
< 7 && !tsi_end_p (tsi
);
15518 i
++, tsi_next (&tsi
))
15519 stmts
[i
] = tsi_stmt (tsi
);
15520 gcc_assert (tsi_end_p (tsi
));
15524 gcc_assert (TREE_CODE (stmts
[0]) == DECL_EXPR
15525 && TREE_CODE (stmts
[1]) == DECL_EXPR
);
15526 tree omp_out
= tsubst (DECL_EXPR_DECL (stmts
[0]),
15527 args
, complain
, in_decl
);
15528 tree omp_in
= tsubst (DECL_EXPR_DECL (stmts
[1]),
15529 args
, complain
, in_decl
);
15530 DECL_CONTEXT (omp_out
) = current_function_decl
;
15531 DECL_CONTEXT (omp_in
) = current_function_decl
;
15532 keep_next_level (true);
15533 tree block
= begin_omp_structured_block ();
15534 tsubst_expr (stmts
[2], args
, complain
, in_decl
, false);
15535 block
= finish_omp_structured_block (block
);
15536 block
= maybe_cleanup_point_expr_void (block
);
15537 add_decl_expr (omp_out
);
15538 if (TREE_NO_WARNING (DECL_EXPR_DECL (stmts
[0])))
15539 TREE_NO_WARNING (omp_out
) = 1;
15540 add_decl_expr (omp_in
);
15541 finish_expr_stmt (block
);
15545 gcc_assert (TREE_CODE (stmts
[3]) == DECL_EXPR
15546 && TREE_CODE (stmts
[4]) == DECL_EXPR
);
15547 tree omp_priv
= tsubst (DECL_EXPR_DECL (stmts
[3]),
15548 args
, complain
, in_decl
);
15549 tree omp_orig
= tsubst (DECL_EXPR_DECL (stmts
[4]),
15550 args
, complain
, in_decl
);
15551 DECL_CONTEXT (omp_priv
) = current_function_decl
;
15552 DECL_CONTEXT (omp_orig
) = current_function_decl
;
15553 keep_next_level (true);
15554 tree block
= begin_omp_structured_block ();
15555 tsubst_expr (stmts
[5], args
, complain
, in_decl
, false);
15556 block
= finish_omp_structured_block (block
);
15557 block
= maybe_cleanup_point_expr_void (block
);
15558 cp_walk_tree (&block
, cp_remove_omp_priv_cleanup_stmt
, omp_priv
, NULL
);
15559 add_decl_expr (omp_priv
);
15560 add_decl_expr (omp_orig
);
15561 finish_expr_stmt (block
);
15563 add_decl_expr (omp_orig
);
15567 /* T is a postfix-expression that is not being used in a function
15568 call. Return the substituted version of T. */
15571 tsubst_non_call_postfix_expression (tree t
, tree args
,
15572 tsubst_flags_t complain
,
15575 if (TREE_CODE (t
) == SCOPE_REF
)
15576 t
= tsubst_qualified_id (t
, args
, complain
, in_decl
,
15577 /*done=*/false, /*address_p=*/false);
15579 t
= tsubst_copy_and_build (t
, args
, complain
, in_decl
,
15580 /*function_p=*/false,
15581 /*integral_constant_expression_p=*/false);
15586 /* Like tsubst but deals with expressions and performs semantic
15587 analysis. FUNCTION_P is true if T is the "F" in "F (ARGS)". */
15590 tsubst_copy_and_build (tree t
,
15592 tsubst_flags_t complain
,
15595 bool integral_constant_expression_p
)
15597 #define RETURN(EXP) do { retval = (EXP); goto out; } while(0)
15598 #define RECUR(NODE) \
15599 tsubst_copy_and_build (NODE, args, complain, in_decl, \
15600 /*function_p=*/false, \
15601 integral_constant_expression_p)
15606 if (t
== NULL_TREE
|| t
== error_mark_node
)
15609 loc
= input_location
;
15610 if (EXPR_HAS_LOCATION (t
))
15611 input_location
= EXPR_LOCATION (t
);
15613 /* N3276 decltype magic only applies to calls at the top level or on the
15614 right side of a comma. */
15615 tsubst_flags_t decltype_flag
= (complain
& tf_decltype
);
15616 complain
&= ~tf_decltype
;
15618 switch (TREE_CODE (t
))
15622 /* Fall through. */
15623 case IDENTIFIER_NODE
:
15627 bool non_integral_constant_expression_p
;
15628 const char *error_msg
;
15630 if (IDENTIFIER_TYPENAME_P (t
))
15632 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15633 t
= mangle_conv_op_name_for_type (new_type
);
15636 /* Look up the name. */
15637 decl
= lookup_name (t
);
15639 /* By convention, expressions use ERROR_MARK_NODE to indicate
15640 failure, not NULL_TREE. */
15641 if (decl
== NULL_TREE
)
15642 decl
= error_mark_node
;
15644 decl
= finish_id_expression (t
, decl
, NULL_TREE
,
15646 integral_constant_expression_p
,
15647 /*allow_non_integral_constant_expression_p=*/(cxx_dialect
>= cxx11
),
15648 &non_integral_constant_expression_p
,
15649 /*template_p=*/false,
15651 /*address_p=*/false,
15652 /*template_arg_p=*/false,
15657 if (!function_p
&& identifier_p (decl
))
15659 if (complain
& tf_error
)
15660 unqualified_name_lookup_error (decl
);
15661 decl
= error_mark_node
;
15666 case TEMPLATE_ID_EXPR
:
15669 tree templ
= RECUR (TREE_OPERAND (t
, 0));
15670 tree targs
= TREE_OPERAND (t
, 1);
15673 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
15674 if (targs
== error_mark_node
)
15675 return error_mark_node
;
15677 if (variable_template_p (templ
))
15679 templ
= lookup_template_variable (templ
, targs
);
15680 if (!any_dependent_template_arguments_p (targs
))
15682 templ
= finish_template_variable (templ
, complain
);
15685 RETURN (convert_from_reference (templ
));
15688 if (TREE_CODE (templ
) == COMPONENT_REF
)
15690 object
= TREE_OPERAND (templ
, 0);
15691 templ
= TREE_OPERAND (templ
, 1);
15694 object
= NULL_TREE
;
15695 templ
= lookup_template_function (templ
, targs
);
15698 RETURN (build3 (COMPONENT_REF
, TREE_TYPE (templ
),
15699 object
, templ
, NULL_TREE
));
15701 RETURN (baselink_for_fns (templ
));
15706 tree r
= RECUR (TREE_OPERAND (t
, 0));
15708 if (REFERENCE_REF_P (t
))
15710 /* A type conversion to reference type will be enclosed in
15711 such an indirect ref, but the substitution of the cast
15712 will have also added such an indirect ref. */
15713 if (TREE_CODE (TREE_TYPE (r
)) == REFERENCE_TYPE
)
15714 r
= convert_from_reference (r
);
15717 r
= build_x_indirect_ref (input_location
, r
, RO_UNARY_STAR
,
15718 complain
|decltype_flag
);
15724 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15725 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15726 RETURN (build_nop (type
, op0
));
15729 case IMPLICIT_CONV_EXPR
:
15731 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15732 tree expr
= RECUR (TREE_OPERAND (t
, 0));
15733 int flags
= LOOKUP_IMPLICIT
;
15734 if (IMPLICIT_CONV_EXPR_DIRECT_INIT (t
))
15735 flags
= LOOKUP_NORMAL
;
15736 RETURN (perform_implicit_conversion_flags (type
, expr
, complain
,
15742 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15743 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15744 RETURN (build1 (CONVERT_EXPR
, type
, op0
));
15748 case REINTERPRET_CAST_EXPR
:
15749 case CONST_CAST_EXPR
:
15750 case DYNAMIC_CAST_EXPR
:
15751 case STATIC_CAST_EXPR
:
15754 tree op
, r
= NULL_TREE
;
15756 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15757 if (integral_constant_expression_p
15758 && !cast_valid_in_integral_constant_expression_p (type
))
15760 if (complain
& tf_error
)
15761 error ("a cast to a type other than an integral or "
15762 "enumeration type cannot appear in a constant-expression");
15763 RETURN (error_mark_node
);
15766 op
= RECUR (TREE_OPERAND (t
, 0));
15768 warning_sentinel
s(warn_useless_cast
);
15769 switch (TREE_CODE (t
))
15772 r
= build_functional_cast (type
, op
, complain
);
15774 case REINTERPRET_CAST_EXPR
:
15775 r
= build_reinterpret_cast (type
, op
, complain
);
15777 case CONST_CAST_EXPR
:
15778 r
= build_const_cast (type
, op
, complain
);
15780 case DYNAMIC_CAST_EXPR
:
15781 r
= build_dynamic_cast (type
, op
, complain
);
15783 case STATIC_CAST_EXPR
:
15784 r
= build_static_cast (type
, op
, complain
);
15787 gcc_unreachable ();
15793 case POSTDECREMENT_EXPR
:
15794 case POSTINCREMENT_EXPR
:
15795 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
15796 args
, complain
, in_decl
);
15797 RETURN (build_x_unary_op (input_location
, TREE_CODE (t
), op1
,
15798 complain
|decltype_flag
));
15800 case PREDECREMENT_EXPR
:
15801 case PREINCREMENT_EXPR
:
15805 case TRUTH_NOT_EXPR
:
15806 case UNARY_PLUS_EXPR
: /* Unary + */
15807 case REALPART_EXPR
:
15808 case IMAGPART_EXPR
:
15809 RETURN (build_x_unary_op (input_location
, TREE_CODE (t
),
15810 RECUR (TREE_OPERAND (t
, 0)),
15811 complain
|decltype_flag
));
15813 case FIX_TRUNC_EXPR
:
15814 RETURN (cp_build_unary_op (FIX_TRUNC_EXPR
, RECUR (TREE_OPERAND (t
, 0)),
15818 op1
= TREE_OPERAND (t
, 0);
15819 if (TREE_CODE (op1
) == LABEL_DECL
)
15820 RETURN (finish_label_address_expr (DECL_NAME (op1
),
15821 EXPR_LOCATION (op1
)));
15822 if (TREE_CODE (op1
) == SCOPE_REF
)
15823 op1
= tsubst_qualified_id (op1
, args
, complain
, in_decl
,
15824 /*done=*/true, /*address_p=*/true);
15826 op1
= tsubst_non_call_postfix_expression (op1
, args
, complain
,
15828 RETURN (build_x_unary_op (input_location
, ADDR_EXPR
, op1
,
15829 complain
|decltype_flag
));
15834 case TRUNC_DIV_EXPR
:
15835 case CEIL_DIV_EXPR
:
15836 case FLOOR_DIV_EXPR
:
15837 case ROUND_DIV_EXPR
:
15838 case EXACT_DIV_EXPR
:
15842 case TRUNC_MOD_EXPR
:
15843 case FLOOR_MOD_EXPR
:
15844 case TRUTH_ANDIF_EXPR
:
15845 case TRUTH_ORIF_EXPR
:
15846 case TRUTH_AND_EXPR
:
15847 case TRUTH_OR_EXPR
:
15863 warning_sentinel
s1(warn_type_limits
);
15864 warning_sentinel
s2(warn_div_by_zero
);
15865 warning_sentinel
s3(warn_logical_op
);
15866 warning_sentinel
s4(warn_tautological_compare
);
15867 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15868 tree op1
= RECUR (TREE_OPERAND (t
, 1));
15869 tree r
= build_x_binary_op
15870 (input_location
, TREE_CODE (t
),
15872 (TREE_NO_WARNING (TREE_OPERAND (t
, 0))
15874 : TREE_CODE (TREE_OPERAND (t
, 0))),
15876 (TREE_NO_WARNING (TREE_OPERAND (t
, 1))
15878 : TREE_CODE (TREE_OPERAND (t
, 1))),
15880 complain
|decltype_flag
);
15881 if (EXPR_P (r
) && TREE_NO_WARNING (t
))
15882 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
15887 case POINTER_PLUS_EXPR
:
15889 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15890 tree op1
= RECUR (TREE_OPERAND (t
, 1));
15891 return fold_build_pointer_plus (op0
, op1
);
15895 RETURN (tsubst_qualified_id (t
, args
, complain
, in_decl
, /*done=*/true,
15896 /*address_p=*/false));
15898 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
15899 args
, complain
, in_decl
);
15900 RETURN (build_x_array_ref (EXPR_LOCATION (t
), op1
,
15901 RECUR (TREE_OPERAND (t
, 1)),
15902 complain
|decltype_flag
));
15904 case ARRAY_NOTATION_REF
:
15906 tree start_index
, length
, stride
;
15907 op1
= tsubst_non_call_postfix_expression (ARRAY_NOTATION_ARRAY (t
),
15908 args
, complain
, in_decl
);
15909 start_index
= RECUR (ARRAY_NOTATION_START (t
));
15910 length
= RECUR (ARRAY_NOTATION_LENGTH (t
));
15911 stride
= RECUR (ARRAY_NOTATION_STRIDE (t
));
15912 RETURN (build_array_notation_ref (EXPR_LOCATION (t
), op1
, start_index
,
15913 length
, stride
, TREE_TYPE (op1
)));
15916 if (PACK_EXPANSION_P (TREE_OPERAND (t
, 0)))
15917 RETURN (tsubst_copy (t
, args
, complain
, in_decl
));
15924 op1
= TREE_OPERAND (t
, 0);
15925 if (TREE_CODE (t
) == SIZEOF_EXPR
&& SIZEOF_EXPR_TYPE_P (t
))
15926 op1
= TREE_TYPE (op1
);
15929 /* When there are no ARGS, we are trying to evaluate a
15930 non-dependent expression from the parser. Trying to do
15931 the substitutions may not work. */
15933 op1
= TREE_TYPE (op1
);
15937 ++cp_unevaluated_operand
;
15938 ++c_inhibit_evaluation_warnings
;
15940 op1
= tsubst (op1
, args
, complain
, in_decl
);
15942 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
15943 /*function_p=*/false,
15944 /*integral_constant_expression_p=*/
15946 --cp_unevaluated_operand
;
15947 --c_inhibit_evaluation_warnings
;
15950 r
= cxx_sizeof_or_alignof_type (op1
, TREE_CODE (t
),
15951 complain
& tf_error
);
15953 r
= cxx_sizeof_or_alignof_expr (op1
, TREE_CODE (t
),
15954 complain
& tf_error
);
15955 if (TREE_CODE (t
) == SIZEOF_EXPR
&& r
!= error_mark_node
)
15957 if (TREE_CODE (r
) != SIZEOF_EXPR
|| TYPE_P (op1
))
15959 if (!processing_template_decl
&& TYPE_P (op1
))
15961 r
= build_min (SIZEOF_EXPR
, size_type_node
,
15962 build1 (NOP_EXPR
, op1
, error_mark_node
));
15963 SIZEOF_EXPR_TYPE_P (r
) = 1;
15966 r
= build_min (SIZEOF_EXPR
, size_type_node
, op1
);
15967 TREE_SIDE_EFFECTS (r
) = 0;
15968 TREE_READONLY (r
) = 1;
15970 SET_EXPR_LOCATION (r
, EXPR_LOCATION (t
));
15975 case AT_ENCODE_EXPR
:
15977 op1
= TREE_OPERAND (t
, 0);
15978 ++cp_unevaluated_operand
;
15979 ++c_inhibit_evaluation_warnings
;
15980 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
15981 /*function_p=*/false,
15982 /*integral_constant_expression_p=*/false);
15983 --cp_unevaluated_operand
;
15984 --c_inhibit_evaluation_warnings
;
15985 RETURN (objc_build_encode_expr (op1
));
15988 case NOEXCEPT_EXPR
:
15989 op1
= TREE_OPERAND (t
, 0);
15990 ++cp_unevaluated_operand
;
15991 ++c_inhibit_evaluation_warnings
;
15992 ++cp_noexcept_operand
;
15993 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
15994 /*function_p=*/false,
15995 /*integral_constant_expression_p=*/false);
15996 --cp_unevaluated_operand
;
15997 --c_inhibit_evaluation_warnings
;
15998 --cp_noexcept_operand
;
15999 RETURN (finish_noexcept_expr (op1
, complain
));
16003 warning_sentinel
s(warn_div_by_zero
);
16004 tree lhs
= RECUR (TREE_OPERAND (t
, 0));
16005 tree rhs
= RECUR (TREE_OPERAND (t
, 2));
16006 tree r
= build_x_modify_expr
16007 (EXPR_LOCATION (t
), lhs
, TREE_CODE (TREE_OPERAND (t
, 1)), rhs
,
16008 complain
|decltype_flag
);
16009 /* TREE_NO_WARNING must be set if either the expression was
16010 parenthesized or it uses an operator such as >>= rather
16011 than plain assignment. In the former case, it was already
16012 set and must be copied. In the latter case,
16013 build_x_modify_expr sets it and it must not be reset
16015 if (TREE_NO_WARNING (t
))
16016 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
16022 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
16023 args
, complain
, in_decl
);
16024 /* Remember that there was a reference to this entity. */
16026 && !mark_used (op1
, complain
) && !(complain
& tf_error
))
16027 RETURN (error_mark_node
);
16028 RETURN (build_x_arrow (input_location
, op1
, complain
));
16032 tree placement
= RECUR (TREE_OPERAND (t
, 0));
16033 tree init
= RECUR (TREE_OPERAND (t
, 3));
16034 vec
<tree
, va_gc
> *placement_vec
;
16035 vec
<tree
, va_gc
> *init_vec
;
16038 if (placement
== NULL_TREE
)
16039 placement_vec
= NULL
;
16042 placement_vec
= make_tree_vector ();
16043 for (; placement
!= NULL_TREE
; placement
= TREE_CHAIN (placement
))
16044 vec_safe_push (placement_vec
, TREE_VALUE (placement
));
16047 /* If there was an initializer in the original tree, but it
16048 instantiated to an empty list, then we should pass a
16049 non-NULL empty vector to tell build_new that it was an
16050 empty initializer() rather than no initializer. This can
16051 only happen when the initializer is a pack expansion whose
16052 parameter packs are of length zero. */
16053 if (init
== NULL_TREE
&& TREE_OPERAND (t
, 3) == NULL_TREE
)
16057 init_vec
= make_tree_vector ();
16058 if (init
== void_node
)
16059 gcc_assert (init_vec
!= NULL
);
16062 for (; init
!= NULL_TREE
; init
= TREE_CHAIN (init
))
16063 vec_safe_push (init_vec
, TREE_VALUE (init
));
16067 tree op1
= tsubst (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
16068 tree op2
= RECUR (TREE_OPERAND (t
, 2));
16069 ret
= build_new (&placement_vec
, op1
, op2
, &init_vec
,
16070 NEW_EXPR_USE_GLOBAL (t
),
16073 if (placement_vec
!= NULL
)
16074 release_tree_vector (placement_vec
);
16075 if (init_vec
!= NULL
)
16076 release_tree_vector (init_vec
);
16083 tree op0
= RECUR (TREE_OPERAND (t
, 0));
16084 tree op1
= RECUR (TREE_OPERAND (t
, 1));
16085 RETURN (delete_sanity (op0
, op1
,
16086 DELETE_EXPR_USE_VEC (t
),
16087 DELETE_EXPR_USE_GLOBAL (t
),
16091 case COMPOUND_EXPR
:
16093 tree op0
= tsubst_copy_and_build (TREE_OPERAND (t
, 0), args
,
16094 complain
& ~tf_decltype
, in_decl
,
16095 /*function_p=*/false,
16096 integral_constant_expression_p
);
16097 RETURN (build_x_compound_expr (EXPR_LOCATION (t
),
16099 RECUR (TREE_OPERAND (t
, 1)),
16100 complain
|decltype_flag
));
16106 vec
<tree
, va_gc
> *call_args
;
16107 unsigned int nargs
, i
;
16112 function
= CALL_EXPR_FN (t
);
16113 /* When we parsed the expression, we determined whether or
16114 not Koenig lookup should be performed. */
16115 koenig_p
= KOENIG_LOOKUP_P (t
);
16116 if (TREE_CODE (function
) == SCOPE_REF
)
16118 qualified_p
= true;
16119 function
= tsubst_qualified_id (function
, args
, complain
, in_decl
,
16121 /*address_p=*/false);
16123 else if (koenig_p
&& identifier_p (function
))
16125 /* Do nothing; calling tsubst_copy_and_build on an identifier
16126 would incorrectly perform unqualified lookup again.
16128 Note that we can also have an IDENTIFIER_NODE if the earlier
16129 unqualified lookup found a member function; in that case
16130 koenig_p will be false and we do want to do the lookup
16131 again to find the instantiated member function.
16133 FIXME but doing that causes c++/15272, so we need to stop
16134 using IDENTIFIER_NODE in that situation. */
16135 qualified_p
= false;
16139 if (TREE_CODE (function
) == COMPONENT_REF
)
16141 tree op
= TREE_OPERAND (function
, 1);
16143 qualified_p
= (TREE_CODE (op
) == SCOPE_REF
16144 || (BASELINK_P (op
)
16145 && BASELINK_QUALIFIED_P (op
)));
16148 qualified_p
= false;
16150 if (TREE_CODE (function
) == ADDR_EXPR
16151 && TREE_CODE (TREE_OPERAND (function
, 0)) == FUNCTION_DECL
)
16152 /* Avoid error about taking the address of a constructor. */
16153 function
= TREE_OPERAND (function
, 0);
16155 function
= tsubst_copy_and_build (function
, args
, complain
,
16158 integral_constant_expression_p
);
16160 if (BASELINK_P (function
))
16161 qualified_p
= true;
16164 nargs
= call_expr_nargs (t
);
16165 call_args
= make_tree_vector ();
16166 for (i
= 0; i
< nargs
; ++i
)
16168 tree arg
= CALL_EXPR_ARG (t
, i
);
16170 if (!PACK_EXPANSION_P (arg
))
16171 vec_safe_push (call_args
, RECUR (CALL_EXPR_ARG (t
, i
)));
16174 /* Expand the pack expansion and push each entry onto
16176 arg
= tsubst_pack_expansion (arg
, args
, complain
, in_decl
);
16177 if (TREE_CODE (arg
) == TREE_VEC
)
16179 unsigned int len
, j
;
16181 len
= TREE_VEC_LENGTH (arg
);
16182 for (j
= 0; j
< len
; ++j
)
16184 tree value
= TREE_VEC_ELT (arg
, j
);
16185 if (value
!= NULL_TREE
)
16186 value
= convert_from_reference (value
);
16187 vec_safe_push (call_args
, value
);
16192 /* A partial substitution. Add one entry. */
16193 vec_safe_push (call_args
, arg
);
16198 /* We do not perform argument-dependent lookup if normal
16199 lookup finds a non-function, in accordance with the
16200 expected resolution of DR 218. */
16202 && ((is_overloaded_fn (function
)
16203 /* If lookup found a member function, the Koenig lookup is
16204 not appropriate, even if an unqualified-name was used
16205 to denote the function. */
16206 && !DECL_FUNCTION_MEMBER_P (get_first_fn (function
)))
16207 || identifier_p (function
))
16208 /* Only do this when substitution turns a dependent call
16209 into a non-dependent call. */
16210 && type_dependent_expression_p_push (t
)
16211 && !any_type_dependent_arguments_p (call_args
))
16212 function
= perform_koenig_lookup (function
, call_args
, tf_none
);
16214 if (identifier_p (function
)
16215 && !any_type_dependent_arguments_p (call_args
))
16217 if (koenig_p
&& (complain
& tf_warning_or_error
))
16219 /* For backwards compatibility and good diagnostics, try
16220 the unqualified lookup again if we aren't in SFINAE
16222 tree unq
= (tsubst_copy_and_build
16223 (function
, args
, complain
, in_decl
, true,
16224 integral_constant_expression_p
));
16225 if (unq
== error_mark_node
)
16226 RETURN (error_mark_node
);
16228 if (unq
!= function
)
16231 if (INDIRECT_REF_P (fn
))
16232 fn
= TREE_OPERAND (fn
, 0);
16233 if (TREE_CODE (fn
) == COMPONENT_REF
)
16234 fn
= TREE_OPERAND (fn
, 1);
16235 if (is_overloaded_fn (fn
))
16236 fn
= get_first_fn (fn
);
16237 if (permerror (EXPR_LOC_OR_LOC (t
, input_location
),
16238 "%qD was not declared in this scope, "
16239 "and no declarations were found by "
16240 "argument-dependent lookup at the point "
16241 "of instantiation", function
))
16244 /* Can't say anything more. */;
16245 else if (DECL_CLASS_SCOPE_P (fn
))
16247 location_t loc
= EXPR_LOC_OR_LOC (t
,
16250 "declarations in dependent base %qT are "
16251 "not found by unqualified lookup",
16252 DECL_CLASS_CONTEXT (fn
));
16253 if (current_class_ptr
)
16255 "use %<this->%D%> instead", function
);
16258 "use %<%T::%D%> instead",
16259 current_class_name
, function
);
16262 inform (DECL_SOURCE_LOCATION (fn
),
16263 "%qD declared here, later in the "
16264 "translation unit", fn
);
16269 if (identifier_p (function
))
16271 if (complain
& tf_error
)
16272 unqualified_name_lookup_error (function
);
16273 release_tree_vector (call_args
);
16274 RETURN (error_mark_node
);
16278 /* Remember that there was a reference to this entity. */
16279 if (DECL_P (function
)
16280 && !mark_used (function
, complain
) && !(complain
& tf_error
))
16281 RETURN (error_mark_node
);
16283 /* Put back tf_decltype for the actual call. */
16284 complain
|= decltype_flag
;
16286 if (TREE_CODE (function
) == OFFSET_REF
)
16287 ret
= build_offset_ref_call_from_tree (function
, &call_args
,
16289 else if (TREE_CODE (function
) == COMPONENT_REF
)
16291 tree instance
= TREE_OPERAND (function
, 0);
16292 tree fn
= TREE_OPERAND (function
, 1);
16294 if (processing_template_decl
16295 && (type_dependent_expression_p (instance
)
16296 || (!BASELINK_P (fn
)
16297 && TREE_CODE (fn
) != FIELD_DECL
)
16298 || type_dependent_expression_p (fn
)
16299 || any_type_dependent_arguments_p (call_args
)))
16300 ret
= build_nt_call_vec (function
, call_args
);
16301 else if (!BASELINK_P (fn
))
16302 ret
= finish_call_expr (function
, &call_args
,
16303 /*disallow_virtual=*/false,
16304 /*koenig_p=*/false,
16307 ret
= (build_new_method_call
16309 &call_args
, NULL_TREE
,
16310 qualified_p
? LOOKUP_NONVIRTUAL
: LOOKUP_NORMAL
,
16315 ret
= finish_call_expr (function
, &call_args
,
16316 /*disallow_virtual=*/qualified_p
,
16320 release_tree_vector (call_args
);
16327 tree cond
= RECUR (TREE_OPERAND (t
, 0));
16328 tree folded_cond
= fold_non_dependent_expr (cond
);
16331 if (TREE_CODE (folded_cond
) == INTEGER_CST
)
16333 if (integer_zerop (folded_cond
))
16335 ++c_inhibit_evaluation_warnings
;
16336 exp1
= RECUR (TREE_OPERAND (t
, 1));
16337 --c_inhibit_evaluation_warnings
;
16338 exp2
= RECUR (TREE_OPERAND (t
, 2));
16342 exp1
= RECUR (TREE_OPERAND (t
, 1));
16343 ++c_inhibit_evaluation_warnings
;
16344 exp2
= RECUR (TREE_OPERAND (t
, 2));
16345 --c_inhibit_evaluation_warnings
;
16347 cond
= folded_cond
;
16351 exp1
= RECUR (TREE_OPERAND (t
, 1));
16352 exp2
= RECUR (TREE_OPERAND (t
, 2));
16355 RETURN (build_x_conditional_expr (EXPR_LOCATION (t
),
16356 cond
, exp1
, exp2
, complain
));
16359 case PSEUDO_DTOR_EXPR
:
16361 tree op0
= RECUR (TREE_OPERAND (t
, 0));
16362 tree op1
= RECUR (TREE_OPERAND (t
, 1));
16363 tree op2
= tsubst (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
16364 RETURN (finish_pseudo_destructor_expr (op0
, op1
, op2
,
16370 tree purpose
, value
, chain
;
16372 if (t
== void_list_node
)
16375 if ((TREE_PURPOSE (t
) && PACK_EXPANSION_P (TREE_PURPOSE (t
)))
16376 || (TREE_VALUE (t
) && PACK_EXPANSION_P (TREE_VALUE (t
))))
16378 /* We have pack expansions, so expand those and
16379 create a new list out of it. */
16380 tree purposevec
= NULL_TREE
;
16381 tree valuevec
= NULL_TREE
;
16385 /* Expand the argument expressions. */
16386 if (TREE_PURPOSE (t
))
16387 purposevec
= tsubst_pack_expansion (TREE_PURPOSE (t
), args
,
16388 complain
, in_decl
);
16389 if (TREE_VALUE (t
))
16390 valuevec
= tsubst_pack_expansion (TREE_VALUE (t
), args
,
16391 complain
, in_decl
);
16393 /* Build the rest of the list. */
16394 chain
= TREE_CHAIN (t
);
16395 if (chain
&& chain
!= void_type_node
)
16396 chain
= RECUR (chain
);
16398 /* Determine the number of arguments. */
16399 if (purposevec
&& TREE_CODE (purposevec
) == TREE_VEC
)
16401 len
= TREE_VEC_LENGTH (purposevec
);
16402 gcc_assert (!valuevec
|| len
== TREE_VEC_LENGTH (valuevec
));
16404 else if (TREE_CODE (valuevec
) == TREE_VEC
)
16405 len
= TREE_VEC_LENGTH (valuevec
);
16408 /* Since we only performed a partial substitution into
16409 the argument pack, we only RETURN (a single list
16411 if (purposevec
== TREE_PURPOSE (t
)
16412 && valuevec
== TREE_VALUE (t
)
16413 && chain
== TREE_CHAIN (t
))
16416 RETURN (tree_cons (purposevec
, valuevec
, chain
));
16419 /* Convert the argument vectors into a TREE_LIST */
16423 /* Grab the Ith values. */
16425 purpose
= purposevec
? TREE_VEC_ELT (purposevec
, i
)
16428 = valuevec
? convert_from_reference (TREE_VEC_ELT (valuevec
, i
))
16431 /* Build the list (backwards). */
16432 chain
= tree_cons (purpose
, value
, chain
);
16438 purpose
= TREE_PURPOSE (t
);
16440 purpose
= RECUR (purpose
);
16441 value
= TREE_VALUE (t
);
16443 value
= RECUR (value
);
16444 chain
= TREE_CHAIN (t
);
16445 if (chain
&& chain
!= void_type_node
)
16446 chain
= RECUR (chain
);
16447 if (purpose
== TREE_PURPOSE (t
)
16448 && value
== TREE_VALUE (t
)
16449 && chain
== TREE_CHAIN (t
))
16451 RETURN (tree_cons (purpose
, value
, chain
));
16454 case COMPONENT_REF
:
16461 object
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
16462 args
, complain
, in_decl
);
16463 /* Remember that there was a reference to this entity. */
16464 if (DECL_P (object
)
16465 && !mark_used (object
, complain
) && !(complain
& tf_error
))
16466 RETURN (error_mark_node
);
16467 object_type
= TREE_TYPE (object
);
16469 member
= TREE_OPERAND (t
, 1);
16470 if (BASELINK_P (member
))
16471 member
= tsubst_baselink (member
,
16472 non_reference (TREE_TYPE (object
)),
16473 args
, complain
, in_decl
);
16475 member
= tsubst_copy (member
, args
, complain
, in_decl
);
16476 if (member
== error_mark_node
)
16477 RETURN (error_mark_node
);
16479 if (type_dependent_expression_p (object
))
16480 /* We can't do much here. */;
16481 else if (!CLASS_TYPE_P (object_type
))
16483 if (scalarish_type_p (object_type
))
16485 tree s
= NULL_TREE
;
16486 tree dtor
= member
;
16488 if (TREE_CODE (dtor
) == SCOPE_REF
)
16490 s
= TREE_OPERAND (dtor
, 0);
16491 dtor
= TREE_OPERAND (dtor
, 1);
16493 if (TREE_CODE (dtor
) == BIT_NOT_EXPR
)
16495 dtor
= TREE_OPERAND (dtor
, 0);
16497 RETURN (finish_pseudo_destructor_expr
16498 (object
, s
, dtor
, input_location
));
16502 else if (TREE_CODE (member
) == SCOPE_REF
16503 && TREE_CODE (TREE_OPERAND (member
, 1)) == TEMPLATE_ID_EXPR
)
16505 /* Lookup the template functions now that we know what the
16507 tree scope
= TREE_OPERAND (member
, 0);
16508 tree tmpl
= TREE_OPERAND (TREE_OPERAND (member
, 1), 0);
16509 tree args
= TREE_OPERAND (TREE_OPERAND (member
, 1), 1);
16510 member
= lookup_qualified_name (scope
, tmpl
,
16511 /*is_type_p=*/false,
16512 /*complain=*/false);
16513 if (BASELINK_P (member
))
16515 BASELINK_FUNCTIONS (member
)
16516 = build_nt (TEMPLATE_ID_EXPR
, BASELINK_FUNCTIONS (member
),
16518 member
= (adjust_result_of_qualified_name_lookup
16519 (member
, BINFO_TYPE (BASELINK_BINFO (member
)),
16524 qualified_name_lookup_error (scope
, tmpl
, member
,
16526 RETURN (error_mark_node
);
16529 else if (TREE_CODE (member
) == SCOPE_REF
16530 && !CLASS_TYPE_P (TREE_OPERAND (member
, 0))
16531 && TREE_CODE (TREE_OPERAND (member
, 0)) != NAMESPACE_DECL
)
16533 if (complain
& tf_error
)
16535 if (TYPE_P (TREE_OPERAND (member
, 0)))
16536 error ("%qT is not a class or namespace",
16537 TREE_OPERAND (member
, 0));
16539 error ("%qD is not a class or namespace",
16540 TREE_OPERAND (member
, 0));
16542 RETURN (error_mark_node
);
16544 else if (TREE_CODE (member
) == FIELD_DECL
)
16546 r
= finish_non_static_data_member (member
, object
, NULL_TREE
);
16547 if (TREE_CODE (r
) == COMPONENT_REF
)
16548 REF_PARENTHESIZED_P (r
) = REF_PARENTHESIZED_P (t
);
16552 r
= finish_class_member_access_expr (object
, member
,
16553 /*template_p=*/false,
16555 if (TREE_CODE (r
) == COMPONENT_REF
)
16556 REF_PARENTHESIZED_P (r
) = REF_PARENTHESIZED_P (t
);
16561 RETURN (build_throw
16562 (RECUR (TREE_OPERAND (t
, 0))));
16566 vec
<constructor_elt
, va_gc
> *n
;
16567 constructor_elt
*ce
;
16568 unsigned HOST_WIDE_INT idx
;
16569 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
16570 bool process_index_p
;
16572 bool need_copy_p
= false;
16575 if (type
== error_mark_node
)
16576 RETURN (error_mark_node
);
16578 /* digest_init will do the wrong thing if we let it. */
16579 if (type
&& TYPE_PTRMEMFUNC_P (type
))
16582 /* We do not want to process the index of aggregate
16583 initializers as they are identifier nodes which will be
16584 looked up by digest_init. */
16585 process_index_p
= !(type
&& MAYBE_CLASS_TYPE_P (type
));
16587 n
= vec_safe_copy (CONSTRUCTOR_ELTS (t
));
16588 newlen
= vec_safe_length (n
);
16589 FOR_EACH_VEC_SAFE_ELT (n
, idx
, ce
)
16591 if (ce
->index
&& process_index_p
16592 /* An identifier index is looked up in the type
16593 being initialized, not the current scope. */
16594 && TREE_CODE (ce
->index
) != IDENTIFIER_NODE
)
16595 ce
->index
= RECUR (ce
->index
);
16597 if (PACK_EXPANSION_P (ce
->value
))
16599 /* Substitute into the pack expansion. */
16600 ce
->value
= tsubst_pack_expansion (ce
->value
, args
, complain
,
16603 if (ce
->value
== error_mark_node
16604 || PACK_EXPANSION_P (ce
->value
))
16606 else if (TREE_VEC_LENGTH (ce
->value
) == 1)
16607 /* Just move the argument into place. */
16608 ce
->value
= TREE_VEC_ELT (ce
->value
, 0);
16611 /* Update the length of the final CONSTRUCTOR
16612 arguments vector, and note that we will need to
16614 newlen
= newlen
+ TREE_VEC_LENGTH (ce
->value
) - 1;
16615 need_copy_p
= true;
16619 ce
->value
= RECUR (ce
->value
);
16624 vec
<constructor_elt
, va_gc
> *old_n
= n
;
16626 vec_alloc (n
, newlen
);
16627 FOR_EACH_VEC_ELT (*old_n
, idx
, ce
)
16629 if (TREE_CODE (ce
->value
) == TREE_VEC
)
16631 int i
, len
= TREE_VEC_LENGTH (ce
->value
);
16632 for (i
= 0; i
< len
; ++i
)
16633 CONSTRUCTOR_APPEND_ELT (n
, 0,
16634 TREE_VEC_ELT (ce
->value
, i
));
16637 CONSTRUCTOR_APPEND_ELT (n
, 0, ce
->value
);
16641 r
= build_constructor (init_list_type_node
, n
);
16642 CONSTRUCTOR_IS_DIRECT_INIT (r
) = CONSTRUCTOR_IS_DIRECT_INIT (t
);
16644 if (TREE_HAS_CONSTRUCTOR (t
))
16645 RETURN (finish_compound_literal (type
, r
, complain
));
16647 TREE_TYPE (r
) = type
;
16653 tree operand_0
= TREE_OPERAND (t
, 0);
16654 if (TYPE_P (operand_0
))
16656 operand_0
= tsubst (operand_0
, args
, complain
, in_decl
);
16657 RETURN (get_typeid (operand_0
, complain
));
16661 operand_0
= RECUR (operand_0
);
16662 RETURN (build_typeid (operand_0
, complain
));
16669 else if (DECL_PACK_P (t
))
16671 /* We don't build decls for an instantiation of a
16672 variadic capture proxy, we instantiate the elements
16674 gcc_assert (DECL_HAS_VALUE_EXPR_P (t
));
16675 return RECUR (DECL_VALUE_EXPR (t
));
16681 tree r
= tsubst_copy (t
, args
, complain
, in_decl
);
16682 /* ??? We're doing a subset of finish_id_expression here. */
16684 && !processing_template_decl
16685 && !cp_unevaluated_operand
16686 && (TREE_STATIC (r
) || DECL_EXTERNAL (r
))
16687 && CP_DECL_THREAD_LOCAL_P (r
))
16689 if (tree wrap
= get_tls_wrapper_fn (r
))
16690 /* Replace an evaluated use of the thread_local variable with
16691 a call to its wrapper. */
16692 r
= build_cxx_call (wrap
, 0, NULL
, tf_warning_or_error
);
16694 else if (outer_automatic_var_p (r
))
16696 r
= process_outer_var_ref (r
, complain
);
16697 if (is_capture_proxy (r
))
16698 register_local_specialization (r
, t
);
16701 if (TREE_CODE (TREE_TYPE (t
)) != REFERENCE_TYPE
)
16702 /* If the original type was a reference, we'll be wrapped in
16703 the appropriate INDIRECT_REF. */
16704 r
= convert_from_reference (r
);
16710 tree op0
= RECUR (TREE_OPERAND (t
, 0));
16711 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
16712 RETURN (build_x_va_arg (EXPR_LOCATION (t
), op0
, type
));
16715 case OFFSETOF_EXPR
:
16716 RETURN (finish_offsetof (RECUR (TREE_OPERAND (t
, 0)),
16717 EXPR_LOCATION (t
)));
16721 tree type1
= tsubst (TRAIT_EXPR_TYPE1 (t
), args
,
16722 complain
, in_decl
);
16724 tree type2
= TRAIT_EXPR_TYPE2 (t
);
16725 if (type2
&& TREE_CODE (type2
) == TREE_LIST
)
16726 type2
= RECUR (type2
);
16728 type2
= tsubst (type2
, args
, complain
, in_decl
);
16730 RETURN (finish_trait_expr (TRAIT_EXPR_KIND (t
), type1
, type2
));
16735 tree old_stmt_expr
= cur_stmt_expr
;
16736 tree stmt_expr
= begin_stmt_expr ();
16738 cur_stmt_expr
= stmt_expr
;
16739 tsubst_expr (STMT_EXPR_STMT (t
), args
, complain
, in_decl
,
16740 integral_constant_expression_p
);
16741 stmt_expr
= finish_stmt_expr (stmt_expr
, false);
16742 cur_stmt_expr
= old_stmt_expr
;
16744 /* If the resulting list of expression statement is empty,
16745 fold it further into void_node. */
16746 if (empty_expr_stmt_p (stmt_expr
))
16747 stmt_expr
= void_node
;
16749 RETURN (stmt_expr
);
16754 tree r
= build_lambda_expr ();
16756 tree type
= tsubst (LAMBDA_EXPR_CLOSURE (t
), args
, complain
, NULL_TREE
);
16757 LAMBDA_EXPR_CLOSURE (r
) = type
;
16758 CLASSTYPE_LAMBDA_EXPR (type
) = r
;
16760 LAMBDA_EXPR_LOCATION (r
)
16761 = LAMBDA_EXPR_LOCATION (t
);
16762 LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (r
)
16763 = LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (t
);
16764 LAMBDA_EXPR_MUTABLE_P (r
) = LAMBDA_EXPR_MUTABLE_P (t
);
16765 LAMBDA_EXPR_DISCRIMINATOR (r
)
16766 = (LAMBDA_EXPR_DISCRIMINATOR (t
));
16767 tree scope
= LAMBDA_EXPR_EXTRA_SCOPE (t
);
16769 /* No substitution needed. */;
16770 else if (VAR_OR_FUNCTION_DECL_P (scope
))
16771 /* For a function or variable scope, we want to use tsubst so that we
16772 don't complain about referring to an auto before deduction. */
16773 scope
= tsubst (scope
, args
, complain
, in_decl
);
16774 else if (TREE_CODE (scope
) == PARM_DECL
)
16776 /* Look up the parameter we want directly, as tsubst_copy
16777 doesn't do what we need. */
16778 tree fn
= tsubst (DECL_CONTEXT (scope
), args
, complain
, in_decl
);
16779 tree parm
= FUNCTION_FIRST_USER_PARM (fn
);
16780 while (DECL_PARM_INDEX (parm
) != DECL_PARM_INDEX (scope
))
16781 parm
= DECL_CHAIN (parm
);
16783 /* FIXME Work around the parm not having DECL_CONTEXT set. */
16784 if (DECL_CONTEXT (scope
) == NULL_TREE
)
16785 DECL_CONTEXT (scope
) = fn
;
16787 else if (TREE_CODE (scope
) == FIELD_DECL
)
16788 /* For a field, use tsubst_copy so that we look up the existing field
16789 rather than build a new one. */
16790 scope
= RECUR (scope
);
16792 gcc_unreachable ();
16793 LAMBDA_EXPR_EXTRA_SCOPE (r
) = scope
;
16794 LAMBDA_EXPR_RETURN_TYPE (r
)
16795 = tsubst (LAMBDA_EXPR_RETURN_TYPE (t
), args
, complain
, in_decl
);
16797 gcc_assert (LAMBDA_EXPR_THIS_CAPTURE (t
) == NULL_TREE
16798 && LAMBDA_EXPR_PENDING_PROXIES (t
) == NULL
);
16800 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
16801 determine_visibility (TYPE_NAME (type
));
16802 /* Now that we know visibility, instantiate the type so we have a
16803 declaration of the op() for later calls to lambda_function. */
16804 complete_type (type
);
16806 LAMBDA_EXPR_THIS_CAPTURE (r
) = NULL_TREE
;
16808 insert_pending_capture_proxies ();
16810 RETURN (build_lambda_object (r
));
16814 /* We can get here for a constant initializer of non-dependent type.
16815 FIXME stop folding in cp_parser_initializer_clause. */
16817 tree r
= get_target_expr_sfinae (RECUR (TARGET_EXPR_INITIAL (t
)),
16822 case TRANSACTION_EXPR
:
16823 RETURN (tsubst_expr(t
, args
, complain
, in_decl
,
16824 integral_constant_expression_p
));
16827 RETURN (finish_parenthesized_expr (RECUR (TREE_OPERAND (t
, 0))));
16829 case VEC_PERM_EXPR
:
16831 tree op0
= RECUR (TREE_OPERAND (t
, 0));
16832 tree op1
= RECUR (TREE_OPERAND (t
, 1));
16833 tree op2
= RECUR (TREE_OPERAND (t
, 2));
16834 RETURN (build_x_vec_perm_expr (input_location
, op0
, op1
, op2
,
16838 case REQUIRES_EXPR
:
16839 RETURN (tsubst_requires_expr (t
, args
, complain
, in_decl
));
16842 /* Handle Objective-C++ constructs, if appropriate. */
16845 = objcp_tsubst_copy_and_build (t
, args
, complain
,
16846 in_decl
, /*function_p=*/false);
16850 RETURN (tsubst_copy (t
, args
, complain
, in_decl
));
16856 input_location
= loc
;
16860 /* Verify that the instantiated ARGS are valid. For type arguments,
16861 make sure that the type's linkage is ok. For non-type arguments,
16862 make sure they are constants if they are integral or enumerations.
16863 Emit an error under control of COMPLAIN, and return TRUE on error. */
16866 check_instantiated_arg (tree tmpl
, tree t
, tsubst_flags_t complain
)
16868 if (dependent_template_arg_p (t
))
16870 if (ARGUMENT_PACK_P (t
))
16872 tree vec
= ARGUMENT_PACK_ARGS (t
);
16873 int len
= TREE_VEC_LENGTH (vec
);
16874 bool result
= false;
16877 for (i
= 0; i
< len
; ++i
)
16878 if (check_instantiated_arg (tmpl
, TREE_VEC_ELT (vec
, i
), complain
))
16882 else if (TYPE_P (t
))
16884 /* [basic.link]: A name with no linkage (notably, the name
16885 of a class or enumeration declared in a local scope)
16886 shall not be used to declare an entity with linkage.
16887 This implies that names with no linkage cannot be used as
16890 DR 757 relaxes this restriction for C++0x. */
16891 tree nt
= (cxx_dialect
> cxx98
? NULL_TREE
16892 : no_linkage_check (t
, /*relaxed_p=*/false));
16896 /* DR 488 makes use of a type with no linkage cause
16897 type deduction to fail. */
16898 if (complain
& tf_error
)
16900 if (TYPE_ANONYMOUS_P (nt
))
16901 error ("%qT is/uses anonymous type", t
);
16903 error ("template argument for %qD uses local type %qT",
16908 /* In order to avoid all sorts of complications, we do not
16909 allow variably-modified types as template arguments. */
16910 else if (variably_modified_type_p (t
, NULL_TREE
))
16912 if (complain
& tf_error
)
16913 error ("%qT is a variably modified type", t
);
16917 /* Class template and alias template arguments should be OK. */
16918 else if (DECL_TYPE_TEMPLATE_P (t
))
16920 /* A non-type argument of integral or enumerated type must be a
16922 else if (TREE_TYPE (t
)
16923 && INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (t
))
16924 && !REFERENCE_REF_P (t
)
16925 && !TREE_CONSTANT (t
))
16927 if (complain
& tf_error
)
16928 error ("integral expression %qE is not constant", t
);
16935 check_instantiated_args (tree tmpl
, tree args
, tsubst_flags_t complain
)
16937 int ix
, len
= DECL_NTPARMS (tmpl
);
16938 bool result
= false;
16940 for (ix
= 0; ix
!= len
; ix
++)
16942 if (check_instantiated_arg (tmpl
, TREE_VEC_ELT (args
, ix
), complain
))
16945 if (result
&& (complain
& tf_error
))
16946 error (" trying to instantiate %qD", tmpl
);
16950 /* We're out of SFINAE context now, so generate diagnostics for the access
16951 errors we saw earlier when instantiating D from TMPL and ARGS. */
16954 recheck_decl_substitution (tree d
, tree tmpl
, tree args
)
16956 tree pattern
= DECL_TEMPLATE_RESULT (tmpl
);
16957 tree type
= TREE_TYPE (pattern
);
16958 location_t loc
= input_location
;
16960 push_access_scope (d
);
16961 push_deferring_access_checks (dk_no_deferred
);
16962 input_location
= DECL_SOURCE_LOCATION (pattern
);
16963 tsubst (type
, args
, tf_warning_or_error
, d
);
16964 input_location
= loc
;
16965 pop_deferring_access_checks ();
16966 pop_access_scope (d
);
16969 /* Instantiate the indicated variable, function, or alias template TMPL with
16970 the template arguments in TARG_PTR. */
16973 instantiate_template_1 (tree tmpl
, tree orig_args
, tsubst_flags_t complain
)
16975 tree targ_ptr
= orig_args
;
16979 bool access_ok
= true;
16981 if (tmpl
== error_mark_node
)
16982 return error_mark_node
;
16984 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
);
16986 /* If this function is a clone, handle it specially. */
16987 if (DECL_CLONED_FUNCTION_P (tmpl
))
16992 /* Use DECL_ABSTRACT_ORIGIN because only FUNCTION_DECLs have
16993 DECL_CLONED_FUNCTION. */
16994 spec
= instantiate_template (DECL_ABSTRACT_ORIGIN (tmpl
),
16995 targ_ptr
, complain
);
16996 if (spec
== error_mark_node
)
16997 return error_mark_node
;
16999 /* Look for the clone. */
17000 FOR_EACH_CLONE (clone
, spec
)
17001 if (DECL_NAME (clone
) == DECL_NAME (tmpl
))
17003 /* We should always have found the clone by now. */
17004 gcc_unreachable ();
17008 if (targ_ptr
== error_mark_node
)
17009 return error_mark_node
;
17011 /* Check to see if we already have this specialization. */
17012 gen_tmpl
= most_general_template (tmpl
);
17013 if (tmpl
!= gen_tmpl
)
17014 /* The TMPL is a partial instantiation. To get a full set of
17015 arguments we must add the arguments used to perform the
17016 partial instantiation. */
17017 targ_ptr
= add_outermost_template_args (DECL_TI_ARGS (tmpl
),
17020 /* It would be nice to avoid hashing here and then again in tsubst_decl,
17021 but it doesn't seem to be on the hot path. */
17022 spec
= retrieve_specialization (gen_tmpl
, targ_ptr
, 0);
17024 gcc_assert (tmpl
== gen_tmpl
17025 || ((fndecl
= retrieve_specialization (tmpl
, orig_args
, 0))
17027 || fndecl
== NULL_TREE
);
17029 if (spec
!= NULL_TREE
)
17031 if (FNDECL_HAS_ACCESS_ERRORS (spec
))
17033 if (complain
& tf_error
)
17034 recheck_decl_substitution (spec
, gen_tmpl
, targ_ptr
);
17035 return error_mark_node
;
17040 if (check_instantiated_args (gen_tmpl
, INNERMOST_TEMPLATE_ARGS (targ_ptr
),
17042 return error_mark_node
;
17044 /* We are building a FUNCTION_DECL, during which the access of its
17045 parameters and return types have to be checked. However this
17046 FUNCTION_DECL which is the desired context for access checking
17047 is not built yet. We solve this chicken-and-egg problem by
17048 deferring all checks until we have the FUNCTION_DECL. */
17049 push_deferring_access_checks (dk_deferred
);
17051 /* Instantiation of the function happens in the context of the function
17052 template, not the context of the overload resolution we're doing. */
17053 push_to_top_level ();
17054 /* If there are dependent arguments, e.g. because we're doing partial
17055 ordering, make sure processing_template_decl stays set. */
17056 if (uses_template_parms (targ_ptr
))
17057 ++processing_template_decl
;
17058 if (DECL_CLASS_SCOPE_P (gen_tmpl
))
17060 tree ctx
= tsubst_aggr_type (DECL_CONTEXT (gen_tmpl
), targ_ptr
,
17061 complain
, gen_tmpl
, true);
17062 push_nested_class (ctx
);
17065 tree pattern
= DECL_TEMPLATE_RESULT (gen_tmpl
);
17067 if (VAR_P (pattern
))
17069 /* We need to determine if we're using a partial or explicit
17070 specialization now, because the type of the variable could be
17072 tree tid
= lookup_template_variable (gen_tmpl
, targ_ptr
);
17073 tree elt
= most_specialized_partial_spec (tid
, complain
);
17074 if (elt
== error_mark_node
)
17075 pattern
= error_mark_node
;
17078 tmpl
= TREE_VALUE (elt
);
17079 pattern
= DECL_TEMPLATE_RESULT (tmpl
);
17080 targ_ptr
= TREE_PURPOSE (elt
);
17084 /* Substitute template parameters to obtain the specialization. */
17085 fndecl
= tsubst (pattern
, targ_ptr
, complain
, gen_tmpl
);
17086 if (DECL_CLASS_SCOPE_P (gen_tmpl
))
17087 pop_nested_class ();
17088 pop_from_top_level ();
17090 if (fndecl
== error_mark_node
)
17092 pop_deferring_access_checks ();
17093 return error_mark_node
;
17096 /* The DECL_TI_TEMPLATE should always be the immediate parent
17097 template, not the most general template. */
17098 DECL_TI_TEMPLATE (fndecl
) = tmpl
;
17099 DECL_TI_ARGS (fndecl
) = targ_ptr
;
17101 /* Now we know the specialization, compute access previously
17103 push_access_scope (fndecl
);
17104 if (!perform_deferred_access_checks (complain
))
17106 pop_access_scope (fndecl
);
17107 pop_deferring_access_checks ();
17109 /* If we've just instantiated the main entry point for a function,
17110 instantiate all the alternate entry points as well. We do this
17111 by cloning the instantiation of the main entry point, not by
17112 instantiating the template clones. */
17113 if (DECL_CHAIN (gen_tmpl
) && DECL_CLONED_FUNCTION_P (DECL_CHAIN (gen_tmpl
)))
17114 clone_function_decl (fndecl
, /*update_method_vec_p=*/0);
17118 if (!(complain
& tf_error
))
17120 /* Remember to reinstantiate when we're out of SFINAE so the user
17121 can see the errors. */
17122 FNDECL_HAS_ACCESS_ERRORS (fndecl
) = true;
17124 return error_mark_node
;
17129 /* Wrapper for instantiate_template_1. */
17132 instantiate_template (tree tmpl
, tree orig_args
, tsubst_flags_t complain
)
17135 timevar_push (TV_TEMPLATE_INST
);
17136 ret
= instantiate_template_1 (tmpl
, orig_args
, complain
);
17137 timevar_pop (TV_TEMPLATE_INST
);
17141 /* Instantiate the alias template TMPL with ARGS. Also push a template
17142 instantiation level, which instantiate_template doesn't do because
17143 functions and variables have sufficient context established by the
17147 instantiate_alias_template (tree tmpl
, tree args
, tsubst_flags_t complain
)
17149 struct pending_template
*old_last_pend
= last_pending_template
;
17150 struct tinst_level
*old_error_tinst
= last_error_tinst_level
;
17151 if (tmpl
== error_mark_node
|| args
== error_mark_node
)
17152 return error_mark_node
;
17153 tree tinst
= build_tree_list (tmpl
, args
);
17154 if (!push_tinst_level (tinst
))
17157 return error_mark_node
;
17161 coerce_innermost_template_parms (DECL_TEMPLATE_PARMS (tmpl
),
17162 args
, tmpl
, complain
,
17163 /*require_all_args=*/true,
17164 /*use_default_args=*/true);
17166 tree r
= instantiate_template (tmpl
, args
, complain
);
17167 pop_tinst_level ();
17168 /* We can't free this if a pending_template entry or last_error_tinst_level
17169 is pointing at it. */
17170 if (last_pending_template
== old_last_pend
17171 && last_error_tinst_level
== old_error_tinst
)
17177 /* PARM is a template parameter pack for FN. Returns true iff
17178 PARM is used in a deducible way in the argument list of FN. */
17181 pack_deducible_p (tree parm
, tree fn
)
17183 tree t
= FUNCTION_FIRST_USER_PARMTYPE (fn
);
17184 for (; t
; t
= TREE_CHAIN (t
))
17186 tree type
= TREE_VALUE (t
);
17188 if (!PACK_EXPANSION_P (type
))
17190 for (packs
= PACK_EXPANSION_PARAMETER_PACKS (type
);
17191 packs
; packs
= TREE_CHAIN (packs
))
17192 if (template_args_equal (TREE_VALUE (packs
), parm
))
17194 /* The template parameter pack is used in a function parameter
17195 pack. If this is the end of the parameter list, the
17196 template parameter pack is deducible. */
17197 if (TREE_CHAIN (t
) == void_list_node
)
17200 /* Otherwise, not. Well, it could be deduced from
17201 a non-pack parameter, but doing so would end up with
17202 a deduction mismatch, so don't bother. */
17206 /* The template parameter pack isn't used in any function parameter
17207 packs, but it might be used deeper, e.g. tuple<Args...>. */
17211 /* The FN is a TEMPLATE_DECL for a function. ARGS is an array with
17212 NARGS elements of the arguments that are being used when calling
17213 it. TARGS is a vector into which the deduced template arguments
17216 Returns either a FUNCTION_DECL for the matching specialization of FN or
17217 NULL_TREE if no suitable specialization can be found. If EXPLAIN_P is
17218 true, diagnostics will be printed to explain why it failed.
17220 If FN is a conversion operator, or we are trying to produce a specific
17221 specialization, RETURN_TYPE is the return type desired.
17223 The EXPLICIT_TARGS are explicit template arguments provided via a
17226 The parameter STRICT is one of:
17229 We are deducing arguments for a function call, as in
17230 [temp.deduct.call]. If RETURN_TYPE is non-null, we are
17231 deducing arguments for a call to the result of a conversion
17232 function template, as in [over.call.object].
17235 We are deducing arguments for a conversion function, as in
17236 [temp.deduct.conv].
17239 We are deducing arguments when doing an explicit instantiation
17240 as in [temp.explicit], when determining an explicit specialization
17241 as in [temp.expl.spec], or when taking the address of a function
17242 template, as in [temp.deduct.funcaddr]. */
17245 fn_type_unification (tree fn
,
17246 tree explicit_targs
,
17249 unsigned int nargs
,
17251 unification_kind_t strict
,
17258 tree decl
= NULL_TREE
;
17259 tsubst_flags_t complain
= (explain_p
? tf_warning_or_error
: tf_none
);
17261 static int deduction_depth
;
17262 struct pending_template
*old_last_pend
= last_pending_template
;
17263 struct tinst_level
*old_error_tinst
= last_error_tinst_level
;
17264 tree tparms
= DECL_INNERMOST_TEMPLATE_PARMS (fn
);
17266 tree r
= error_mark_node
;
17269 complain
|= tf_decltype
;
17271 /* In C++0x, it's possible to have a function template whose type depends
17272 on itself recursively. This is most obvious with decltype, but can also
17273 occur with enumeration scope (c++/48969). So we need to catch infinite
17274 recursion and reject the substitution at deduction time; this function
17275 will return error_mark_node for any repeated substitution.
17277 This also catches excessive recursion such as when f<N> depends on
17278 f<N-1> across all integers, and returns error_mark_node for all the
17279 substitutions back up to the initial one.
17281 This is, of course, not reentrant. */
17282 if (excessive_deduction_depth
)
17283 return error_mark_node
;
17284 tinst
= build_tree_list (fn
, NULL_TREE
);
17287 gcc_assert (TREE_CODE (fn
) == TEMPLATE_DECL
);
17289 fntype
= TREE_TYPE (fn
);
17290 if (explicit_targs
)
17294 The specified template arguments must match the template
17295 parameters in kind (i.e., type, nontype, template), and there
17296 must not be more arguments than there are parameters;
17297 otherwise type deduction fails.
17299 Nontype arguments must match the types of the corresponding
17300 nontype template parameters, or must be convertible to the
17301 types of the corresponding nontype parameters as specified in
17302 _temp.arg.nontype_, otherwise type deduction fails.
17304 All references in the function type of the function template
17305 to the corresponding template parameters are replaced by the
17306 specified template argument values. If a substitution in a
17307 template parameter or in the function type of the function
17308 template results in an invalid type, type deduction fails. */
17309 int i
, len
= TREE_VEC_LENGTH (tparms
);
17310 location_t loc
= input_location
;
17311 bool incomplete
= false;
17313 /* Adjust any explicit template arguments before entering the
17314 substitution context. */
17316 = (coerce_template_parms (tparms
, explicit_targs
, NULL_TREE
,
17318 /*require_all_args=*/false,
17319 /*use_default_args=*/false));
17320 if (explicit_targs
== error_mark_node
)
17323 /* Substitute the explicit args into the function type. This is
17324 necessary so that, for instance, explicitly declared function
17325 arguments can match null pointed constants. If we were given
17326 an incomplete set of explicit args, we must not do semantic
17327 processing during substitution as we could create partial
17329 for (i
= 0; i
< len
; i
++)
17331 tree parm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
17332 bool parameter_pack
= false;
17333 tree targ
= TREE_VEC_ELT (explicit_targs
, i
);
17335 /* Dig out the actual parm. */
17336 if (TREE_CODE (parm
) == TYPE_DECL
17337 || TREE_CODE (parm
) == TEMPLATE_DECL
)
17339 parm
= TREE_TYPE (parm
);
17340 parameter_pack
= TEMPLATE_TYPE_PARAMETER_PACK (parm
);
17342 else if (TREE_CODE (parm
) == PARM_DECL
)
17344 parm
= DECL_INITIAL (parm
);
17345 parameter_pack
= TEMPLATE_PARM_PARAMETER_PACK (parm
);
17348 if (!parameter_pack
&& targ
== NULL_TREE
)
17349 /* No explicit argument for this template parameter. */
17352 if (parameter_pack
&& pack_deducible_p (parm
, fn
))
17354 /* Mark the argument pack as "incomplete". We could
17355 still deduce more arguments during unification.
17356 We remove this mark in type_unification_real. */
17359 ARGUMENT_PACK_INCOMPLETE_P(targ
) = 1;
17360 ARGUMENT_PACK_EXPLICIT_ARGS (targ
)
17361 = ARGUMENT_PACK_ARGS (targ
);
17364 /* We have some incomplete argument packs. */
17369 TREE_VALUE (tinst
) = explicit_targs
;
17370 if (!push_tinst_level (tinst
))
17372 excessive_deduction_depth
= true;
17375 processing_template_decl
+= incomplete
;
17376 input_location
= DECL_SOURCE_LOCATION (fn
);
17377 /* Ignore any access checks; we'll see them again in
17378 instantiate_template and they might have the wrong
17379 access path at this point. */
17380 push_deferring_access_checks (dk_deferred
);
17381 fntype
= tsubst (TREE_TYPE (fn
), explicit_targs
,
17382 complain
| tf_partial
, NULL_TREE
);
17383 pop_deferring_access_checks ();
17384 input_location
= loc
;
17385 processing_template_decl
-= incomplete
;
17386 pop_tinst_level ();
17388 if (fntype
== error_mark_node
)
17391 /* Place the explicitly specified arguments in TARGS. */
17392 for (i
= NUM_TMPL_ARGS (explicit_targs
); i
--;)
17393 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (explicit_targs
, i
);
17396 /* Never do unification on the 'this' parameter. */
17397 parms
= skip_artificial_parms_for (fn
, TYPE_ARG_TYPES (fntype
));
17399 if (return_type
&& strict
== DEDUCE_CALL
)
17401 /* We're deducing for a call to the result of a template conversion
17402 function. The parms we really want are in return_type. */
17403 if (POINTER_TYPE_P (return_type
))
17404 return_type
= TREE_TYPE (return_type
);
17405 parms
= TYPE_ARG_TYPES (return_type
);
17407 else if (return_type
)
17411 parms
= tree_cons (NULL_TREE
, TREE_TYPE (fntype
), parms
);
17412 new_args
= XALLOCAVEC (tree
, nargs
+ 1);
17413 new_args
[0] = return_type
;
17414 memcpy (new_args
+ 1, args
, nargs
* sizeof (tree
));
17419 /* We allow incomplete unification without an error message here
17420 because the standard doesn't seem to explicitly prohibit it. Our
17421 callers must be ready to deal with unification failures in any
17424 TREE_VALUE (tinst
) = targs
;
17425 /* If we aren't explaining yet, push tinst context so we can see where
17426 any errors (e.g. from class instantiations triggered by instantiation
17427 of default template arguments) come from. If we are explaining, this
17428 context is redundant. */
17429 if (!explain_p
&& !push_tinst_level (tinst
))
17431 excessive_deduction_depth
= true;
17435 /* type_unification_real will pass back any access checks from default
17436 template argument substitution. */
17437 vec
<deferred_access_check
, va_gc
> *checks
;
17440 ok
= !type_unification_real (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
17441 targs
, parms
, args
, nargs
, /*subr=*/0,
17442 strict
, flags
, &checks
, explain_p
);
17444 pop_tinst_level ();
17448 /* Now that we have bindings for all of the template arguments,
17449 ensure that the arguments deduced for the template template
17450 parameters have compatible template parameter lists. We cannot
17451 check this property before we have deduced all template
17452 arguments, because the template parameter types of a template
17453 template parameter might depend on prior template parameters
17454 deduced after the template template parameter. The following
17455 ill-formed example illustrates this issue:
17457 template<typename T, template<T> class C> void f(C<5>, T);
17459 template<int N> struct X {};
17462 f(X<5>(), 5l); // error: template argument deduction fails
17465 The template parameter list of 'C' depends on the template type
17466 parameter 'T', but 'C' is deduced to 'X' before 'T' is deduced to
17467 'long'. Thus, we can't check that 'C' cannot bind to 'X' at the
17468 time that we deduce 'C'. */
17469 if (!template_template_parm_bindings_ok_p
17470 (DECL_INNERMOST_TEMPLATE_PARMS (fn
), targs
))
17472 unify_inconsistent_template_template_parameters (explain_p
);
17476 /* All is well so far. Now, check:
17480 When all template arguments have been deduced, all uses of
17481 template parameters in nondeduced contexts are replaced with
17482 the corresponding deduced argument values. If the
17483 substitution results in an invalid type, as described above,
17484 type deduction fails. */
17485 TREE_VALUE (tinst
) = targs
;
17486 if (!push_tinst_level (tinst
))
17488 excessive_deduction_depth
= true;
17492 /* Also collect access checks from the instantiation. */
17493 reopen_deferring_access_checks (checks
);
17495 decl
= instantiate_template (fn
, targs
, complain
);
17497 checks
= get_deferred_access_checks ();
17498 pop_deferring_access_checks ();
17500 pop_tinst_level ();
17502 if (decl
== error_mark_node
)
17505 /* Now perform any access checks encountered during substitution. */
17506 push_access_scope (decl
);
17507 ok
= perform_access_checks (checks
, complain
);
17508 pop_access_scope (decl
);
17512 /* If we're looking for an exact match, check that what we got
17513 is indeed an exact match. It might not be if some template
17514 parameters are used in non-deduced contexts. But don't check
17515 for an exact match if we have dependent template arguments;
17516 in that case we're doing partial ordering, and we already know
17517 that we have two candidates that will provide the actual type. */
17518 if (strict
== DEDUCE_EXACT
&& !any_dependent_template_arguments_p (targs
))
17520 tree substed
= TREE_TYPE (decl
);
17524 = skip_artificial_parms_for (decl
, TYPE_ARG_TYPES (substed
));
17526 sarg
= tree_cons (NULL_TREE
, TREE_TYPE (substed
), sarg
);
17527 for (i
= 0; i
< nargs
&& sarg
; ++i
, sarg
= TREE_CHAIN (sarg
))
17528 if (!same_type_p (args
[i
], TREE_VALUE (sarg
)))
17530 unify_type_mismatch (explain_p
, args
[i
],
17531 TREE_VALUE (sarg
));
17540 if (excessive_deduction_depth
)
17542 if (deduction_depth
== 0)
17543 /* Reset once we're all the way out. */
17544 excessive_deduction_depth
= false;
17547 /* We can't free this if a pending_template entry or last_error_tinst_level
17548 is pointing at it. */
17549 if (last_pending_template
== old_last_pend
17550 && last_error_tinst_level
== old_error_tinst
)
17556 /* Adjust types before performing type deduction, as described in
17557 [temp.deduct.call] and [temp.deduct.conv]. The rules in these two
17558 sections are symmetric. PARM is the type of a function parameter
17559 or the return type of the conversion function. ARG is the type of
17560 the argument passed to the call, or the type of the value
17561 initialized with the result of the conversion function.
17562 ARG_EXPR is the original argument expression, which may be null. */
17565 maybe_adjust_types_for_deduction (unification_kind_t strict
,
17578 /* Swap PARM and ARG throughout the remainder of this
17579 function; the handling is precisely symmetric since PARM
17580 will initialize ARG rather than vice versa. */
17581 std::swap (parm
, arg
);
17585 /* Core issue #873: Do the DR606 thing (see below) for these cases,
17586 too, but here handle it by stripping the reference from PARM
17587 rather than by adding it to ARG. */
17588 if (TREE_CODE (*parm
) == REFERENCE_TYPE
17589 && TYPE_REF_IS_RVALUE (*parm
)
17590 && TREE_CODE (TREE_TYPE (*parm
)) == TEMPLATE_TYPE_PARM
17591 && cp_type_quals (TREE_TYPE (*parm
)) == TYPE_UNQUALIFIED
17592 && TREE_CODE (*arg
) == REFERENCE_TYPE
17593 && !TYPE_REF_IS_RVALUE (*arg
))
17594 *parm
= TREE_TYPE (*parm
);
17595 /* Nothing else to do in this case. */
17599 gcc_unreachable ();
17602 if (TREE_CODE (*parm
) != REFERENCE_TYPE
)
17604 /* [temp.deduct.call]
17606 If P is not a reference type:
17608 --If A is an array type, the pointer type produced by the
17609 array-to-pointer standard conversion (_conv.array_) is
17610 used in place of A for type deduction; otherwise,
17612 --If A is a function type, the pointer type produced by
17613 the function-to-pointer standard conversion
17614 (_conv.func_) is used in place of A for type deduction;
17617 --If A is a cv-qualified type, the top level
17618 cv-qualifiers of A's type are ignored for type
17620 if (TREE_CODE (*arg
) == ARRAY_TYPE
)
17621 *arg
= build_pointer_type (TREE_TYPE (*arg
));
17622 else if (TREE_CODE (*arg
) == FUNCTION_TYPE
)
17623 *arg
= build_pointer_type (*arg
);
17625 *arg
= TYPE_MAIN_VARIANT (*arg
);
17628 /* From C++0x [14.8.2.1/3 temp.deduct.call] (after DR606), "If P is
17629 of the form T&&, where T is a template parameter, and the argument
17630 is an lvalue, T is deduced as A& */
17631 if (TREE_CODE (*parm
) == REFERENCE_TYPE
17632 && TYPE_REF_IS_RVALUE (*parm
)
17633 && TREE_CODE (TREE_TYPE (*parm
)) == TEMPLATE_TYPE_PARM
17634 && cp_type_quals (TREE_TYPE (*parm
)) == TYPE_UNQUALIFIED
17635 && (arg_expr
? real_lvalue_p (arg_expr
)
17636 /* try_one_overload doesn't provide an arg_expr, but
17637 functions are always lvalues. */
17638 : TREE_CODE (*arg
) == FUNCTION_TYPE
))
17639 *arg
= build_reference_type (*arg
);
17641 /* [temp.deduct.call]
17643 If P is a cv-qualified type, the top level cv-qualifiers
17644 of P's type are ignored for type deduction. If P is a
17645 reference type, the type referred to by P is used for
17647 *parm
= TYPE_MAIN_VARIANT (*parm
);
17648 if (TREE_CODE (*parm
) == REFERENCE_TYPE
)
17650 *parm
= TREE_TYPE (*parm
);
17651 result
|= UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
17654 /* DR 322. For conversion deduction, remove a reference type on parm
17655 too (which has been swapped into ARG). */
17656 if (strict
== DEDUCE_CONV
&& TREE_CODE (*arg
) == REFERENCE_TYPE
)
17657 *arg
= TREE_TYPE (*arg
);
17662 /* Subroutine of unify_one_argument. PARM is a function parameter of a
17663 template which does contain any deducible template parameters; check if
17664 ARG is a suitable match for it. STRICT, FLAGS and EXPLAIN_P are as in
17665 unify_one_argument. */
17668 check_non_deducible_conversion (tree parm
, tree arg
, int strict
,
17669 int flags
, bool explain_p
)
17674 type
= TREE_TYPE (arg
);
17678 if (same_type_p (parm
, type
))
17679 return unify_success (explain_p
);
17681 if (strict
== DEDUCE_CONV
)
17683 if (can_convert_arg (type
, parm
, NULL_TREE
, flags
,
17684 explain_p
? tf_warning_or_error
: tf_none
))
17685 return unify_success (explain_p
);
17687 else if (strict
!= DEDUCE_EXACT
)
17689 if (can_convert_arg (parm
, type
,
17690 TYPE_P (arg
) ? NULL_TREE
: arg
,
17691 flags
, explain_p
? tf_warning_or_error
: tf_none
))
17692 return unify_success (explain_p
);
17695 if (strict
== DEDUCE_EXACT
)
17696 return unify_type_mismatch (explain_p
, parm
, arg
);
17698 return unify_arg_conversion (explain_p
, parm
, type
, arg
);
17701 static bool uses_deducible_template_parms (tree type
);
17703 /* Returns true iff the expression EXPR is one from which a template
17704 argument can be deduced. In other words, if it's an undecorated
17705 use of a template non-type parameter. */
17708 deducible_expression (tree expr
)
17710 return (TREE_CODE (expr
) == TEMPLATE_PARM_INDEX
);
17713 /* Returns true iff the array domain DOMAIN uses a template parameter in a
17714 deducible way; that is, if it has a max value of <PARM> - 1. */
17717 deducible_array_bound (tree domain
)
17719 if (domain
== NULL_TREE
)
17722 tree max
= TYPE_MAX_VALUE (domain
);
17723 if (TREE_CODE (max
) != MINUS_EXPR
)
17726 return deducible_expression (TREE_OPERAND (max
, 0));
17729 /* Returns true iff the template arguments ARGS use a template parameter
17730 in a deducible way. */
17733 deducible_template_args (tree args
)
17735 for (int i
= 0; i
< TREE_VEC_LENGTH (args
); ++i
)
17738 tree elt
= TREE_VEC_ELT (args
, i
);
17739 if (ARGUMENT_PACK_P (elt
))
17740 deducible
= deducible_template_args (ARGUMENT_PACK_ARGS (elt
));
17743 if (PACK_EXPANSION_P (elt
))
17744 elt
= PACK_EXPANSION_PATTERN (elt
);
17745 if (TREE_CODE (elt
) == TEMPLATE_TEMPLATE_PARM
)
17747 else if (TYPE_P (elt
))
17748 deducible
= uses_deducible_template_parms (elt
);
17750 deducible
= deducible_expression (elt
);
17758 /* Returns true iff TYPE contains any deducible references to template
17759 parameters, as per 14.8.2.5. */
17762 uses_deducible_template_parms (tree type
)
17764 if (PACK_EXPANSION_P (type
))
17765 type
= PACK_EXPANSION_PATTERN (type
);
17772 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
17773 || TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
17779 if (POINTER_TYPE_P (type
))
17780 return uses_deducible_template_parms (TREE_TYPE (type
));
17782 /* T[integer-constant ]
17784 if (TREE_CODE (type
) == ARRAY_TYPE
)
17785 return (uses_deducible_template_parms (TREE_TYPE (type
))
17786 || deducible_array_bound (TYPE_DOMAIN (type
)));
17798 if (TYPE_PTRMEM_P (type
))
17799 return (uses_deducible_template_parms (TYPE_PTRMEM_CLASS_TYPE (type
))
17800 || (uses_deducible_template_parms
17801 (TYPE_PTRMEM_POINTED_TO_TYPE (type
))));
17803 /* template-name <T> (where template-name refers to a class template)
17804 template-name <i> (where template-name refers to a class template) */
17805 if (CLASS_TYPE_P (type
)
17806 && CLASSTYPE_TEMPLATE_INFO (type
)
17807 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (type
)))
17808 return deducible_template_args (INNERMOST_TEMPLATE_ARGS
17809 (CLASSTYPE_TI_ARGS (type
)));
17814 if (TREE_CODE (type
) == FUNCTION_TYPE
17815 || TREE_CODE (type
) == METHOD_TYPE
)
17817 if (uses_deducible_template_parms (TREE_TYPE (type
)))
17819 tree parm
= TYPE_ARG_TYPES (type
);
17820 if (TREE_CODE (type
) == METHOD_TYPE
)
17821 parm
= TREE_CHAIN (parm
);
17822 for (; parm
; parm
= TREE_CHAIN (parm
))
17823 if (uses_deducible_template_parms (TREE_VALUE (parm
)))
17830 /* Subroutine of type_unification_real and unify_pack_expansion to
17831 handle unification of a single P/A pair. Parameters are as
17832 for those functions. */
17835 unify_one_argument (tree tparms
, tree targs
, tree parm
, tree arg
,
17836 int subr
, unification_kind_t strict
,
17839 tree arg_expr
= NULL_TREE
;
17842 if (arg
== error_mark_node
|| parm
== error_mark_node
)
17843 return unify_invalid (explain_p
);
17844 if (arg
== unknown_type_node
)
17845 /* We can't deduce anything from this, but we might get all the
17846 template args from other function args. */
17847 return unify_success (explain_p
);
17849 /* Implicit conversions (Clause 4) will be performed on a function
17850 argument to convert it to the type of the corresponding function
17851 parameter if the parameter type contains no template-parameters that
17852 participate in template argument deduction. */
17853 if (strict
!= DEDUCE_EXACT
17854 && TYPE_P (parm
) && !uses_deducible_template_parms (parm
))
17855 /* For function parameters with no deducible template parameters,
17856 just return. We'll check non-dependent conversions later. */
17857 return unify_success (explain_p
);
17862 arg_strict
= (UNIFY_ALLOW_OUTER_LEVEL
17863 | UNIFY_ALLOW_MORE_CV_QUAL
17864 | UNIFY_ALLOW_DERIVED
);
17868 arg_strict
= UNIFY_ALLOW_LESS_CV_QUAL
;
17872 arg_strict
= UNIFY_ALLOW_NONE
;
17876 gcc_unreachable ();
17879 /* We only do these transformations if this is the top-level
17880 parameter_type_list in a call or declaration matching; in other
17881 situations (nested function declarators, template argument lists) we
17882 won't be comparing a type to an expression, and we don't do any type
17888 gcc_assert (TREE_TYPE (arg
) != NULL_TREE
);
17889 if (type_unknown_p (arg
))
17891 /* [temp.deduct.type] A template-argument can be
17892 deduced from a pointer to function or pointer
17893 to member function argument if the set of
17894 overloaded functions does not contain function
17895 templates and at most one of a set of
17896 overloaded functions provides a unique
17899 if (resolve_overloaded_unification
17900 (tparms
, targs
, parm
, arg
, strict
,
17901 arg_strict
, explain_p
))
17902 return unify_success (explain_p
);
17903 return unify_overload_resolution_failure (explain_p
, arg
);
17907 arg
= unlowered_expr_type (arg
);
17908 if (arg
== error_mark_node
)
17909 return unify_invalid (explain_p
);
17913 maybe_adjust_types_for_deduction (strict
, &parm
, &arg
, arg_expr
);
17916 if ((TYPE_P (parm
) || TREE_CODE (parm
) == TEMPLATE_DECL
)
17917 != (TYPE_P (arg
) || TREE_CODE (arg
) == TEMPLATE_DECL
))
17918 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
17920 /* For deduction from an init-list we need the actual list. */
17921 if (arg_expr
&& BRACE_ENCLOSED_INITIALIZER_P (arg_expr
))
17923 return unify (tparms
, targs
, parm
, arg
, arg_strict
, explain_p
);
17926 /* Most parms like fn_type_unification.
17928 If SUBR is 1, we're being called recursively (to unify the
17929 arguments of a function or method parameter of a function
17932 CHECKS is a pointer to a vector of access checks encountered while
17933 substituting default template arguments. */
17936 type_unification_real (tree tparms
,
17940 unsigned int xnargs
,
17942 unification_kind_t strict
,
17944 vec
<deferred_access_check
, va_gc
> **checks
,
17949 int ntparms
= TREE_VEC_LENGTH (tparms
);
17950 int saw_undeduced
= 0;
17953 unsigned int nargs
;
17956 gcc_assert (TREE_CODE (tparms
) == TREE_VEC
);
17957 gcc_assert (xparms
== NULL_TREE
|| TREE_CODE (xparms
) == TREE_LIST
);
17958 gcc_assert (ntparms
> 0);
17960 /* Reset the number of non-defaulted template arguments contained
17962 NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
) = NULL_TREE
;
17970 while (parms
&& parms
!= void_list_node
17973 parm
= TREE_VALUE (parms
);
17975 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
17976 && (!TREE_CHAIN (parms
) || TREE_CHAIN (parms
) == void_list_node
))
17977 /* For a function parameter pack that occurs at the end of the
17978 parameter-declaration-list, the type A of each remaining
17979 argument of the call is compared with the type P of the
17980 declarator-id of the function parameter pack. */
17983 parms
= TREE_CHAIN (parms
);
17985 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
)
17986 /* For a function parameter pack that does not occur at the
17987 end of the parameter-declaration-list, the type of the
17988 parameter pack is a non-deduced context. */
17994 if (unify_one_argument (tparms
, targs
, parm
, arg
, subr
, strict
,
18000 && parms
!= void_list_node
18001 && TREE_CODE (TREE_VALUE (parms
)) == TYPE_PACK_EXPANSION
)
18003 /* Unify the remaining arguments with the pack expansion type. */
18005 tree parmvec
= make_tree_vec (1);
18007 /* Allocate a TREE_VEC and copy in all of the arguments */
18008 argvec
= make_tree_vec (nargs
- ia
);
18009 for (i
= 0; ia
< nargs
; ++ia
, ++i
)
18010 TREE_VEC_ELT (argvec
, i
) = args
[ia
];
18012 /* Copy the parameter into parmvec. */
18013 TREE_VEC_ELT (parmvec
, 0) = TREE_VALUE (parms
);
18014 if (unify_pack_expansion (tparms
, targs
, parmvec
, argvec
, strict
,
18015 /*subr=*/subr
, explain_p
))
18018 /* Advance to the end of the list of parameters. */
18019 parms
= TREE_CHAIN (parms
);
18022 /* Fail if we've reached the end of the parm list, and more args
18023 are present, and the parm list isn't variadic. */
18024 if (ia
< nargs
&& parms
== void_list_node
)
18025 return unify_too_many_arguments (explain_p
, nargs
, ia
);
18026 /* Fail if parms are left and they don't have default values and
18027 they aren't all deduced as empty packs (c++/57397). This is
18028 consistent with sufficient_parms_p. */
18029 if (parms
&& parms
!= void_list_node
18030 && TREE_PURPOSE (parms
) == NULL_TREE
)
18032 unsigned int count
= nargs
;
18037 type_pack_p
= TREE_CODE (TREE_VALUE (p
)) == TYPE_PACK_EXPANSION
;
18040 p
= TREE_CHAIN (p
);
18042 while (p
&& p
!= void_list_node
);
18043 if (count
!= nargs
)
18044 return unify_too_few_arguments (explain_p
, ia
, count
,
18050 tsubst_flags_t complain
= (explain_p
18051 ? tf_warning_or_error
18054 for (i
= 0; i
< ntparms
; i
++)
18056 tree targ
= TREE_VEC_ELT (targs
, i
);
18057 tree tparm
= TREE_VEC_ELT (tparms
, i
);
18059 /* Clear the "incomplete" flags on all argument packs now so that
18060 substituting them into later default arguments works. */
18061 if (targ
&& ARGUMENT_PACK_P (targ
))
18063 ARGUMENT_PACK_INCOMPLETE_P (targ
) = 0;
18064 ARGUMENT_PACK_EXPLICIT_ARGS (targ
) = NULL_TREE
;
18067 if (targ
|| tparm
== error_mark_node
)
18069 tparm
= TREE_VALUE (tparm
);
18071 /* If this is an undeduced nontype parameter that depends on
18072 a type parameter, try another pass; its type may have been
18073 deduced from a later argument than the one from which
18074 this parameter can be deduced. */
18075 if (TREE_CODE (tparm
) == PARM_DECL
18076 && uses_template_parms (TREE_TYPE (tparm
))
18077 && saw_undeduced
< 2)
18083 /* Core issue #226 (C++0x) [temp.deduct]:
18085 If a template argument has not been deduced, its
18086 default template argument, if any, is used.
18088 When we are in C++98 mode, TREE_PURPOSE will either
18089 be NULL_TREE or ERROR_MARK_NODE, so we do not need
18090 to explicitly check cxx_dialect here. */
18091 if (TREE_PURPOSE (TREE_VEC_ELT (tparms
, i
)))
18092 /* OK, there is a default argument. Wait until after the
18093 conversion check to do substitution. */
18096 /* If the type parameter is a parameter pack, then it will
18097 be deduced to an empty parameter pack. */
18098 if (template_parameter_pack_p (tparm
))
18102 if (TREE_CODE (tparm
) == TEMPLATE_PARM_INDEX
)
18104 arg
= make_node (NONTYPE_ARGUMENT_PACK
);
18105 TREE_TYPE (arg
) = TREE_TYPE (TEMPLATE_PARM_DECL (tparm
));
18106 TREE_CONSTANT (arg
) = 1;
18109 arg
= cxx_make_type (TYPE_ARGUMENT_PACK
);
18111 SET_ARGUMENT_PACK_ARGS (arg
, make_tree_vec (0));
18113 TREE_VEC_ELT (targs
, i
) = arg
;
18117 return unify_parameter_deduction_failure (explain_p
, tparm
);
18120 /* DR 1391: All parameters have args, now check non-dependent parms for
18122 if (saw_undeduced
< 2)
18123 for (ia
= 0, parms
= xparms
, args
= xargs
, nargs
= xnargs
;
18124 parms
&& parms
!= void_list_node
&& ia
< nargs
; )
18126 parm
= TREE_VALUE (parms
);
18128 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
18129 && (!TREE_CHAIN (parms
)
18130 || TREE_CHAIN (parms
) == void_list_node
))
18131 /* For a function parameter pack that occurs at the end of the
18132 parameter-declaration-list, the type A of each remaining
18133 argument of the call is compared with the type P of the
18134 declarator-id of the function parameter pack. */
18137 parms
= TREE_CHAIN (parms
);
18139 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
)
18140 /* For a function parameter pack that does not occur at the
18141 end of the parameter-declaration-list, the type of the
18142 parameter pack is a non-deduced context. */
18148 if (uses_template_parms (parm
))
18150 if (check_non_deducible_conversion (parm
, arg
, strict
, flags
,
18155 /* Now substitute into the default template arguments. */
18156 for (i
= 0; i
< ntparms
; i
++)
18158 tree targ
= TREE_VEC_ELT (targs
, i
);
18159 tree tparm
= TREE_VEC_ELT (tparms
, i
);
18161 if (targ
|| tparm
== error_mark_node
)
18163 tree parm
= TREE_VALUE (tparm
);
18165 if (TREE_CODE (parm
) == PARM_DECL
18166 && uses_template_parms (TREE_TYPE (parm
))
18167 && saw_undeduced
< 2)
18170 tree arg
= TREE_PURPOSE (tparm
);
18171 reopen_deferring_access_checks (*checks
);
18172 location_t save_loc
= input_location
;
18174 input_location
= DECL_SOURCE_LOCATION (parm
);
18175 arg
= tsubst_template_arg (arg
, targs
, complain
, NULL_TREE
);
18176 arg
= convert_template_argument (parm
, arg
, targs
, complain
,
18178 input_location
= save_loc
;
18179 *checks
= get_deferred_access_checks ();
18180 pop_deferring_access_checks ();
18181 if (arg
== error_mark_node
)
18185 TREE_VEC_ELT (targs
, i
) = arg
;
18186 /* The position of the first default template argument,
18187 is also the number of non-defaulted arguments in TARGS.
18189 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
))
18190 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
, i
);
18195 if (saw_undeduced
++ == 1)
18199 if (CHECKING_P
&& !NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
))
18200 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
, TREE_VEC_LENGTH (targs
));
18202 return unify_success (explain_p
);
18205 /* Subroutine of type_unification_real. Args are like the variables
18206 at the call site. ARG is an overloaded function (or template-id);
18207 we try deducing template args from each of the overloads, and if
18208 only one succeeds, we go with that. Modifies TARGS and returns
18209 true on success. */
18212 resolve_overloaded_unification (tree tparms
,
18216 unification_kind_t strict
,
18220 tree tempargs
= copy_node (targs
);
18222 tree goodfn
= NULL_TREE
;
18225 if (TREE_CODE (arg
) == ADDR_EXPR
)
18227 arg
= TREE_OPERAND (arg
, 0);
18233 if (TREE_CODE (arg
) == COMPONENT_REF
)
18234 /* Handle `&x' where `x' is some static or non-static member
18236 arg
= TREE_OPERAND (arg
, 1);
18238 if (TREE_CODE (arg
) == OFFSET_REF
)
18239 arg
= TREE_OPERAND (arg
, 1);
18241 /* Strip baselink information. */
18242 if (BASELINK_P (arg
))
18243 arg
= BASELINK_FUNCTIONS (arg
);
18245 if (TREE_CODE (arg
) == TEMPLATE_ID_EXPR
)
18247 /* If we got some explicit template args, we need to plug them into
18248 the affected templates before we try to unify, in case the
18249 explicit args will completely resolve the templates in question. */
18252 tree expl_subargs
= TREE_OPERAND (arg
, 1);
18253 arg
= TREE_OPERAND (arg
, 0);
18255 for (; arg
; arg
= OVL_NEXT (arg
))
18257 tree fn
= OVL_CURRENT (arg
);
18258 tree subargs
, elem
;
18260 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
18263 subargs
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
18264 expl_subargs
, NULL_TREE
, tf_none
,
18265 /*require_all_args=*/true,
18266 /*use_default_args=*/true);
18267 if (subargs
!= error_mark_node
18268 && !any_dependent_template_arguments_p (subargs
))
18270 elem
= TREE_TYPE (instantiate_template (fn
, subargs
, tf_none
));
18271 if (try_one_overload (tparms
, targs
, tempargs
, parm
,
18272 elem
, strict
, sub_strict
, addr_p
, explain_p
)
18273 && (!goodfn
|| !same_type_p (goodfn
, elem
)))
18282 /* If no templates (or more than one) are fully resolved by the
18283 explicit arguments, this template-id is a non-deduced context; it
18284 could still be OK if we deduce all template arguments for the
18285 enclosing call through other arguments. */
18289 else if (TREE_CODE (arg
) != OVERLOAD
18290 && TREE_CODE (arg
) != FUNCTION_DECL
)
18291 /* If ARG is, for example, "(0, &f)" then its type will be unknown
18292 -- but the deduction does not succeed because the expression is
18293 not just the function on its own. */
18296 for (; arg
; arg
= OVL_NEXT (arg
))
18297 if (try_one_overload (tparms
, targs
, tempargs
, parm
,
18298 TREE_TYPE (OVL_CURRENT (arg
)),
18299 strict
, sub_strict
, addr_p
, explain_p
)
18300 && (!goodfn
|| !decls_match (goodfn
, OVL_CURRENT (arg
))))
18302 goodfn
= OVL_CURRENT (arg
);
18306 /* [temp.deduct.type] A template-argument can be deduced from a pointer
18307 to function or pointer to member function argument if the set of
18308 overloaded functions does not contain function templates and at most
18309 one of a set of overloaded functions provides a unique match.
18311 So if we found multiple possibilities, we return success but don't
18312 deduce anything. */
18316 int i
= TREE_VEC_LENGTH (targs
);
18318 if (TREE_VEC_ELT (tempargs
, i
))
18320 tree old
= TREE_VEC_ELT (targs
, i
);
18321 tree new_
= TREE_VEC_ELT (tempargs
, i
);
18322 if (new_
&& old
&& ARGUMENT_PACK_P (old
)
18323 && ARGUMENT_PACK_EXPLICIT_ARGS (old
))
18324 /* Don't forget explicit template arguments in a pack. */
18325 ARGUMENT_PACK_EXPLICIT_ARGS (new_
)
18326 = ARGUMENT_PACK_EXPLICIT_ARGS (old
);
18327 TREE_VEC_ELT (targs
, i
) = new_
;
18336 /* Core DR 115: In contexts where deduction is done and fails, or in
18337 contexts where deduction is not done, if a template argument list is
18338 specified and it, along with any default template arguments, identifies
18339 a single function template specialization, then the template-id is an
18340 lvalue for the function template specialization. */
18343 resolve_nondeduced_context (tree orig_expr
)
18345 tree expr
, offset
, baselink
;
18348 if (!type_unknown_p (orig_expr
))
18353 offset
= NULL_TREE
;
18354 baselink
= NULL_TREE
;
18356 if (TREE_CODE (expr
) == ADDR_EXPR
)
18358 expr
= TREE_OPERAND (expr
, 0);
18361 if (TREE_CODE (expr
) == OFFSET_REF
)
18364 expr
= TREE_OPERAND (expr
, 1);
18366 if (BASELINK_P (expr
))
18369 expr
= BASELINK_FUNCTIONS (expr
);
18372 if (TREE_CODE (expr
) == TEMPLATE_ID_EXPR
)
18375 tree goodfn
= NULL_TREE
;
18377 /* If we got some explicit template args, we need to plug them into
18378 the affected templates before we try to unify, in case the
18379 explicit args will completely resolve the templates in question. */
18381 tree expl_subargs
= TREE_OPERAND (expr
, 1);
18382 tree arg
= TREE_OPERAND (expr
, 0);
18383 tree badfn
= NULL_TREE
;
18384 tree badargs
= NULL_TREE
;
18386 for (; arg
; arg
= OVL_NEXT (arg
))
18388 tree fn
= OVL_CURRENT (arg
);
18389 tree subargs
, elem
;
18391 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
18394 subargs
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
18395 expl_subargs
, NULL_TREE
, tf_none
,
18396 /*require_all_args=*/true,
18397 /*use_default_args=*/true);
18398 if (subargs
!= error_mark_node
18399 && !any_dependent_template_arguments_p (subargs
))
18401 elem
= instantiate_template (fn
, subargs
, tf_none
);
18402 if (elem
== error_mark_node
)
18407 else if (elem
&& (!goodfn
|| !decls_match (goodfn
, elem
)))
18416 mark_used (goodfn
);
18419 expr
= build_baselink (BASELINK_BINFO (baselink
),
18420 BASELINK_ACCESS_BINFO (baselink
),
18421 expr
, BASELINK_OPTYPE (baselink
));
18425 = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (offset
, 0)));
18426 expr
= build_offset_ref (base
, expr
, addr
, tf_warning_or_error
);
18429 expr
= cp_build_addr_expr (expr
, tf_warning_or_error
);
18432 else if (good
== 0 && badargs
)
18433 /* There were no good options and at least one bad one, so let the
18434 user know what the problem is. */
18435 instantiate_template (badfn
, badargs
, tf_warning_or_error
);
18440 /* Subroutine of resolve_overloaded_unification; does deduction for a single
18441 overload. Fills TARGS with any deduced arguments, or error_mark_node if
18442 different overloads deduce different arguments for a given parm.
18443 ADDR_P is true if the expression for which deduction is being
18444 performed was of the form "& fn" rather than simply "fn".
18446 Returns 1 on success. */
18449 try_one_overload (tree tparms
,
18454 unification_kind_t strict
,
18463 if (arg
== error_mark_node
)
18466 /* [temp.deduct.type] A template-argument can be deduced from a pointer
18467 to function or pointer to member function argument if the set of
18468 overloaded functions does not contain function templates and at most
18469 one of a set of overloaded functions provides a unique match.
18471 So if this is a template, just return success. */
18473 if (uses_template_parms (arg
))
18476 if (TREE_CODE (arg
) == METHOD_TYPE
)
18477 arg
= build_ptrmemfunc_type (build_pointer_type (arg
));
18479 arg
= build_pointer_type (arg
);
18481 sub_strict
|= maybe_adjust_types_for_deduction (strict
, &parm
, &arg
, NULL
);
18483 /* We don't copy orig_targs for this because if we have already deduced
18484 some template args from previous args, unify would complain when we
18485 try to deduce a template parameter for the same argument, even though
18486 there isn't really a conflict. */
18487 nargs
= TREE_VEC_LENGTH (targs
);
18488 tempargs
= make_tree_vec (nargs
);
18490 if (unify (tparms
, tempargs
, parm
, arg
, sub_strict
, explain_p
))
18493 /* First make sure we didn't deduce anything that conflicts with
18494 explicitly specified args. */
18495 for (i
= nargs
; i
--; )
18497 tree elt
= TREE_VEC_ELT (tempargs
, i
);
18498 tree oldelt
= TREE_VEC_ELT (orig_targs
, i
);
18502 else if (uses_template_parms (elt
))
18503 /* Since we're unifying against ourselves, we will fill in
18504 template args used in the function parm list with our own
18505 template parms. Discard them. */
18506 TREE_VEC_ELT (tempargs
, i
) = NULL_TREE
;
18507 else if (oldelt
&& !template_args_equal (oldelt
, elt
))
18511 for (i
= nargs
; i
--; )
18513 tree elt
= TREE_VEC_ELT (tempargs
, i
);
18516 TREE_VEC_ELT (targs
, i
) = elt
;
18522 /* PARM is a template class (perhaps with unbound template
18523 parameters). ARG is a fully instantiated type. If ARG can be
18524 bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and
18525 TARGS are as for unify. */
18528 try_class_unification (tree tparms
, tree targs
, tree parm
, tree arg
,
18531 tree copy_of_targs
;
18533 if (!CLASSTYPE_TEMPLATE_INFO (arg
)
18534 || (most_general_template (CLASSTYPE_TI_TEMPLATE (arg
))
18535 != most_general_template (CLASSTYPE_TI_TEMPLATE (parm
))))
18538 /* We need to make a new template argument vector for the call to
18539 unify. If we used TARGS, we'd clutter it up with the result of
18540 the attempted unification, even if this class didn't work out.
18541 We also don't want to commit ourselves to all the unifications
18542 we've already done, since unification is supposed to be done on
18543 an argument-by-argument basis. In other words, consider the
18544 following pathological case:
18546 template <int I, int J, int K>
18549 template <int I, int J>
18550 struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {};
18552 template <int I, int J, int K>
18553 void f(S<I, J, K>, S<I, I, I>);
18562 Now, by the time we consider the unification involving `s2', we
18563 already know that we must have `f<0, 0, 0>'. But, even though
18564 `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is invalid
18565 because there are two ways to unify base classes of S<0, 1, 2>
18566 with S<I, I, I>. If we kept the already deduced knowledge, we
18567 would reject the possibility I=1. */
18568 copy_of_targs
= make_tree_vec (TREE_VEC_LENGTH (targs
));
18570 /* If unification failed, we're done. */
18571 if (unify (tparms
, copy_of_targs
, CLASSTYPE_TI_ARGS (parm
),
18572 CLASSTYPE_TI_ARGS (arg
), UNIFY_ALLOW_NONE
, explain_p
))
18578 /* Given a template type PARM and a class type ARG, find the unique
18579 base type in ARG that is an instance of PARM. We do not examine
18580 ARG itself; only its base-classes. If there is not exactly one
18581 appropriate base class, return NULL_TREE. PARM may be the type of
18582 a partial specialization, as well as a plain template type. Used
18585 static enum template_base_result
18586 get_template_base (tree tparms
, tree targs
, tree parm
, tree arg
,
18587 bool explain_p
, tree
*result
)
18589 tree rval
= NULL_TREE
;
18592 gcc_assert (RECORD_OR_UNION_CODE_P (TREE_CODE (arg
)));
18594 binfo
= TYPE_BINFO (complete_type (arg
));
18597 /* The type could not be completed. */
18598 *result
= NULL_TREE
;
18599 return tbr_incomplete_type
;
18602 /* Walk in inheritance graph order. The search order is not
18603 important, and this avoids multiple walks of virtual bases. */
18604 for (binfo
= TREE_CHAIN (binfo
); binfo
; binfo
= TREE_CHAIN (binfo
))
18606 tree r
= try_class_unification (tparms
, targs
, parm
,
18607 BINFO_TYPE (binfo
), explain_p
);
18611 /* If there is more than one satisfactory baseclass, then:
18615 If they yield more than one possible deduced A, the type
18619 if (rval
&& !same_type_p (r
, rval
))
18621 *result
= NULL_TREE
;
18622 return tbr_ambiguous_baseclass
;
18630 return tbr_success
;
18633 /* Returns the level of DECL, which declares a template parameter. */
18636 template_decl_level (tree decl
)
18638 switch (TREE_CODE (decl
))
18641 case TEMPLATE_DECL
:
18642 return TEMPLATE_TYPE_LEVEL (TREE_TYPE (decl
));
18645 return TEMPLATE_PARM_LEVEL (DECL_INITIAL (decl
));
18648 gcc_unreachable ();
18653 /* Decide whether ARG can be unified with PARM, considering only the
18654 cv-qualifiers of each type, given STRICT as documented for unify.
18655 Returns nonzero iff the unification is OK on that basis. */
18658 check_cv_quals_for_unify (int strict
, tree arg
, tree parm
)
18660 int arg_quals
= cp_type_quals (arg
);
18661 int parm_quals
= cp_type_quals (parm
);
18663 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
18664 && !(strict
& UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
18666 /* Although a CVR qualifier is ignored when being applied to a
18667 substituted template parameter ([8.3.2]/1 for example), that
18668 does not allow us to unify "const T" with "int&" because both
18669 types are not of the form "cv-list T" [14.8.2.5 temp.deduct.type].
18670 It is ok when we're allowing additional CV qualifiers
18671 at the outer level [14.8.2.1]/3,1st bullet. */
18672 if ((TREE_CODE (arg
) == REFERENCE_TYPE
18673 || TREE_CODE (arg
) == FUNCTION_TYPE
18674 || TREE_CODE (arg
) == METHOD_TYPE
)
18675 && (parm_quals
& (TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
)))
18678 if ((!POINTER_TYPE_P (arg
) && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
)
18679 && (parm_quals
& TYPE_QUAL_RESTRICT
))
18683 if (!(strict
& (UNIFY_ALLOW_MORE_CV_QUAL
| UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
18684 && (arg_quals
& parm_quals
) != parm_quals
)
18687 if (!(strict
& (UNIFY_ALLOW_LESS_CV_QUAL
| UNIFY_ALLOW_OUTER_LESS_CV_QUAL
))
18688 && (parm_quals
& arg_quals
) != arg_quals
)
18694 /* Determines the LEVEL and INDEX for the template parameter PARM. */
18696 template_parm_level_and_index (tree parm
, int* level
, int* index
)
18698 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
18699 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
18700 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
18702 *index
= TEMPLATE_TYPE_IDX (parm
);
18703 *level
= TEMPLATE_TYPE_LEVEL (parm
);
18707 *index
= TEMPLATE_PARM_IDX (parm
);
18708 *level
= TEMPLATE_PARM_LEVEL (parm
);
18712 #define RECUR_AND_CHECK_FAILURE(TP, TA, P, A, S, EP) \
18714 if (unify (TP, TA, P, A, S, EP)) \
18718 /* Unifies the remaining arguments in PACKED_ARGS with the pack
18719 expansion at the end of PACKED_PARMS. Returns 0 if the type
18720 deduction succeeds, 1 otherwise. STRICT is the same as in
18721 unify. CALL_ARGS_P is true iff PACKED_ARGS is actually a function
18722 call argument list. We'll need to adjust the arguments to make them
18723 types. SUBR tells us if this is from a recursive call to
18724 type_unification_real, or for comparing two template argument
18728 unify_pack_expansion (tree tparms
, tree targs
, tree packed_parms
,
18729 tree packed_args
, unification_kind_t strict
,
18730 bool subr
, bool explain_p
)
18733 = TREE_VEC_ELT (packed_parms
, TREE_VEC_LENGTH (packed_parms
) - 1);
18734 tree pattern
= PACK_EXPANSION_PATTERN (parm
);
18735 tree pack
, packs
= NULL_TREE
;
18736 int i
, start
= TREE_VEC_LENGTH (packed_parms
) - 1;
18738 packed_args
= expand_template_argument_pack (packed_args
);
18740 int len
= TREE_VEC_LENGTH (packed_args
);
18742 /* Determine the parameter packs we will be deducing from the
18743 pattern, and record their current deductions. */
18744 for (pack
= PACK_EXPANSION_PARAMETER_PACKS (parm
);
18745 pack
; pack
= TREE_CHAIN (pack
))
18747 tree parm_pack
= TREE_VALUE (pack
);
18750 /* Determine the index and level of this parameter pack. */
18751 template_parm_level_and_index (parm_pack
, &level
, &idx
);
18753 /* Keep track of the parameter packs and their corresponding
18755 packs
= tree_cons (parm_pack
, TMPL_ARG (targs
, level
, idx
), packs
);
18756 TREE_TYPE (packs
) = make_tree_vec (len
- start
);
18759 /* Loop through all of the arguments that have not yet been
18760 unified and unify each with the pattern. */
18761 for (i
= start
; i
< len
; i
++)
18764 bool any_explicit
= false;
18765 tree arg
= TREE_VEC_ELT (packed_args
, i
);
18767 /* For each parameter pack, set its TMPL_ARG to either NULL_TREE
18768 or the element of its argument pack at the current index if
18769 this argument was explicitly specified. */
18770 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
18774 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
18777 if (TREE_VALUE (pack
)
18778 && (pargs
= ARGUMENT_PACK_EXPLICIT_ARGS (TREE_VALUE (pack
)))
18779 && (i
- start
< TREE_VEC_LENGTH (pargs
)))
18781 any_explicit
= true;
18782 arg
= TREE_VEC_ELT (pargs
, i
- start
);
18784 TMPL_ARG (targs
, level
, idx
) = arg
;
18787 /* If we had explicit template arguments, substitute them into the
18788 pattern before deduction. */
18791 /* Some arguments might still be unspecified or dependent. */
18793 ++processing_template_decl
;
18794 dependent
= any_dependent_template_arguments_p (targs
);
18796 --processing_template_decl
;
18797 parm
= tsubst (pattern
, targs
,
18798 explain_p
? tf_warning_or_error
: tf_none
,
18801 --processing_template_decl
;
18802 if (parm
== error_mark_node
)
18808 /* Unify the pattern with the current argument. */
18809 if (unify_one_argument (tparms
, targs
, parm
, arg
, subr
, strict
,
18813 /* For each parameter pack, collect the deduced value. */
18814 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
18817 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
18819 TREE_VEC_ELT (TREE_TYPE (pack
), i
- start
) =
18820 TMPL_ARG (targs
, level
, idx
);
18824 /* Verify that the results of unification with the parameter packs
18825 produce results consistent with what we've seen before, and make
18826 the deduced argument packs available. */
18827 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
18829 tree old_pack
= TREE_VALUE (pack
);
18830 tree new_args
= TREE_TYPE (pack
);
18831 int i
, len
= TREE_VEC_LENGTH (new_args
);
18833 bool nondeduced_p
= false;
18835 /* By default keep the original deduced argument pack.
18836 If necessary, more specific code is going to update the
18837 resulting deduced argument later down in this function. */
18838 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
18839 TMPL_ARG (targs
, level
, idx
) = old_pack
;
18841 /* If NEW_ARGS contains any NULL_TREE entries, we didn't
18842 actually deduce anything. */
18843 for (i
= 0; i
< len
&& !nondeduced_p
; ++i
)
18844 if (TREE_VEC_ELT (new_args
, i
) == NULL_TREE
)
18845 nondeduced_p
= true;
18849 if (old_pack
&& ARGUMENT_PACK_INCOMPLETE_P (old_pack
))
18851 /* If we had fewer function args than explicit template args,
18852 just use the explicits. */
18853 tree explicit_args
= ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
);
18854 int explicit_len
= TREE_VEC_LENGTH (explicit_args
);
18855 if (len
< explicit_len
)
18856 new_args
= explicit_args
;
18862 /* Build the deduced *_ARGUMENT_PACK. */
18863 if (TREE_CODE (TREE_PURPOSE (pack
)) == TEMPLATE_PARM_INDEX
)
18865 result
= make_node (NONTYPE_ARGUMENT_PACK
);
18866 TREE_TYPE (result
) =
18867 TREE_TYPE (TEMPLATE_PARM_DECL (TREE_PURPOSE (pack
)));
18868 TREE_CONSTANT (result
) = 1;
18871 result
= cxx_make_type (TYPE_ARGUMENT_PACK
);
18873 SET_ARGUMENT_PACK_ARGS (result
, new_args
);
18875 /* Note the deduced argument packs for this parameter
18877 TMPL_ARG (targs
, level
, idx
) = result
;
18879 else if (ARGUMENT_PACK_INCOMPLETE_P (old_pack
)
18880 && (ARGUMENT_PACK_ARGS (old_pack
)
18881 == ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
)))
18883 /* We only had the explicitly-provided arguments before, but
18884 now we have a complete set of arguments. */
18885 tree explicit_args
= ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
);
18887 SET_ARGUMENT_PACK_ARGS (old_pack
, new_args
);
18888 ARGUMENT_PACK_INCOMPLETE_P (old_pack
) = 1;
18889 ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
) = explicit_args
;
18893 tree bad_old_arg
= NULL_TREE
, bad_new_arg
= NULL_TREE
;
18894 tree old_args
= ARGUMENT_PACK_ARGS (old_pack
);
18896 if (!comp_template_args_with_info (old_args
, new_args
,
18897 &bad_old_arg
, &bad_new_arg
))
18898 /* Inconsistent unification of this parameter pack. */
18899 return unify_parameter_pack_inconsistent (explain_p
,
18905 return unify_success (explain_p
);
18908 /* Handle unification of the domain of an array. PARM_DOM and ARG_DOM are
18909 INTEGER_TYPEs representing the TYPE_DOMAIN of ARRAY_TYPEs. The other
18910 parameters and return value are as for unify. */
18913 unify_array_domain (tree tparms
, tree targs
,
18914 tree parm_dom
, tree arg_dom
,
18922 /* Our representation of array types uses "N - 1" as the
18923 TYPE_MAX_VALUE for an array with "N" elements, if "N" is
18924 not an integer constant. We cannot unify arbitrarily
18925 complex expressions, so we eliminate the MINUS_EXPRs
18927 parm_max
= TYPE_MAX_VALUE (parm_dom
);
18928 parm_cst
= TREE_CODE (parm_max
) == INTEGER_CST
;
18931 gcc_assert (TREE_CODE (parm_max
) == MINUS_EXPR
);
18932 parm_max
= TREE_OPERAND (parm_max
, 0);
18934 arg_max
= TYPE_MAX_VALUE (arg_dom
);
18935 arg_cst
= TREE_CODE (arg_max
) == INTEGER_CST
;
18938 /* The ARG_MAX may not be a simple MINUS_EXPR, if we are
18939 trying to unify the type of a variable with the type
18940 of a template parameter. For example:
18942 template <unsigned int N>
18943 void f (char (&) [N]);
18950 Here, the type of the ARG will be "int [g(i)]", and
18951 may be a SAVE_EXPR, etc. */
18952 if (TREE_CODE (arg_max
) != MINUS_EXPR
)
18953 return unify_vla_arg (explain_p
, arg_dom
);
18954 arg_max
= TREE_OPERAND (arg_max
, 0);
18957 /* If only one of the bounds used a MINUS_EXPR, compensate
18958 by adding one to the other bound. */
18959 if (parm_cst
&& !arg_cst
)
18960 parm_max
= fold_build2_loc (input_location
, PLUS_EXPR
,
18964 else if (arg_cst
&& !parm_cst
)
18965 arg_max
= fold_build2_loc (input_location
, PLUS_EXPR
,
18970 return unify (tparms
, targs
, parm_max
, arg_max
,
18971 UNIFY_ALLOW_INTEGER
, explain_p
);
18974 /* Deduce the value of template parameters. TPARMS is the (innermost)
18975 set of template parameters to a template. TARGS is the bindings
18976 for those template parameters, as determined thus far; TARGS may
18977 include template arguments for outer levels of template parameters
18978 as well. PARM is a parameter to a template function, or a
18979 subcomponent of that parameter; ARG is the corresponding argument.
18980 This function attempts to match PARM with ARG in a manner
18981 consistent with the existing assignments in TARGS. If more values
18982 are deduced, then TARGS is updated.
18984 Returns 0 if the type deduction succeeds, 1 otherwise. The
18985 parameter STRICT is a bitwise or of the following flags:
18988 Require an exact match between PARM and ARG.
18989 UNIFY_ALLOW_MORE_CV_QUAL:
18990 Allow the deduced ARG to be more cv-qualified (by qualification
18991 conversion) than ARG.
18992 UNIFY_ALLOW_LESS_CV_QUAL:
18993 Allow the deduced ARG to be less cv-qualified than ARG.
18994 UNIFY_ALLOW_DERIVED:
18995 Allow the deduced ARG to be a template base class of ARG,
18996 or a pointer to a template base class of the type pointed to by
18998 UNIFY_ALLOW_INTEGER:
18999 Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX
19000 case for more information.
19001 UNIFY_ALLOW_OUTER_LEVEL:
19002 This is the outermost level of a deduction. Used to determine validity
19003 of qualification conversions. A valid qualification conversion must
19004 have const qualified pointers leading up to the inner type which
19005 requires additional CV quals, except at the outer level, where const
19006 is not required [conv.qual]. It would be normal to set this flag in
19007 addition to setting UNIFY_ALLOW_MORE_CV_QUAL.
19008 UNIFY_ALLOW_OUTER_MORE_CV_QUAL:
19009 This is the outermost level of a deduction, and PARM can be more CV
19010 qualified at this point.
19011 UNIFY_ALLOW_OUTER_LESS_CV_QUAL:
19012 This is the outermost level of a deduction, and PARM can be less CV
19013 qualified at this point. */
19016 unify (tree tparms
, tree targs
, tree parm
, tree arg
, int strict
,
19022 int strict_in
= strict
;
19024 /* I don't think this will do the right thing with respect to types.
19025 But the only case I've seen it in so far has been array bounds, where
19026 signedness is the only information lost, and I think that will be
19028 while (TREE_CODE (parm
) == NOP_EXPR
)
19029 parm
= TREE_OPERAND (parm
, 0);
19031 if (arg
== error_mark_node
)
19032 return unify_invalid (explain_p
);
19033 if (arg
== unknown_type_node
19034 || arg
== init_list_type_node
)
19035 /* We can't deduce anything from this, but we might get all the
19036 template args from other function args. */
19037 return unify_success (explain_p
);
19039 /* If PARM uses template parameters, then we can't bail out here,
19040 even if ARG == PARM, since we won't record unifications for the
19041 template parameters. We might need them if we're trying to
19042 figure out which of two things is more specialized. */
19043 if (arg
== parm
&& !uses_template_parms (parm
))
19044 return unify_success (explain_p
);
19046 /* Handle init lists early, so the rest of the function can assume
19047 we're dealing with a type. */
19048 if (BRACE_ENCLOSED_INITIALIZER_P (arg
))
19052 tree orig_parm
= parm
;
19054 /* Replace T with std::initializer_list<T> for deduction. */
19055 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
19056 && flag_deduce_init_list
)
19057 parm
= listify (parm
);
19059 if (!is_std_init_list (parm
)
19060 && TREE_CODE (parm
) != ARRAY_TYPE
)
19061 /* We can only deduce from an initializer list argument if the
19062 parameter is std::initializer_list or an array; otherwise this
19063 is a non-deduced context. */
19064 return unify_success (explain_p
);
19066 if (TREE_CODE (parm
) == ARRAY_TYPE
)
19067 elttype
= TREE_TYPE (parm
);
19070 elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (parm
), 0);
19071 /* Deduction is defined in terms of a single type, so just punt
19072 on the (bizarre) std::initializer_list<T...>. */
19073 if (PACK_EXPANSION_P (elttype
))
19074 return unify_success (explain_p
);
19077 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (arg
), i
, elt
)
19079 int elt_strict
= strict
;
19081 if (elt
== error_mark_node
)
19082 return unify_invalid (explain_p
);
19084 if (!BRACE_ENCLOSED_INITIALIZER_P (elt
))
19086 tree type
= TREE_TYPE (elt
);
19087 if (type
== error_mark_node
)
19088 return unify_invalid (explain_p
);
19089 /* It should only be possible to get here for a call. */
19090 gcc_assert (elt_strict
& UNIFY_ALLOW_OUTER_LEVEL
);
19091 elt_strict
|= maybe_adjust_types_for_deduction
19092 (DEDUCE_CALL
, &elttype
, &type
, elt
);
19096 RECUR_AND_CHECK_FAILURE (tparms
, targs
, elttype
, elt
, elt_strict
,
19100 if (TREE_CODE (parm
) == ARRAY_TYPE
19101 && deducible_array_bound (TYPE_DOMAIN (parm
)))
19103 /* Also deduce from the length of the initializer list. */
19104 tree max
= size_int (CONSTRUCTOR_NELTS (arg
));
19105 tree idx
= compute_array_index_type (NULL_TREE
, max
, tf_none
);
19106 if (idx
== error_mark_node
)
19107 return unify_invalid (explain_p
);
19108 return unify_array_domain (tparms
, targs
, TYPE_DOMAIN (parm
),
19112 /* If the std::initializer_list<T> deduction worked, replace the
19113 deduced A with std::initializer_list<A>. */
19114 if (orig_parm
!= parm
)
19116 idx
= TEMPLATE_TYPE_IDX (orig_parm
);
19117 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
19118 targ
= listify (targ
);
19119 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = targ
;
19121 return unify_success (explain_p
);
19124 /* Immediately reject some pairs that won't unify because of
19125 cv-qualification mismatches. */
19126 if (TREE_CODE (arg
) == TREE_CODE (parm
)
19128 /* It is the elements of the array which hold the cv quals of an array
19129 type, and the elements might be template type parms. We'll check
19130 when we recurse. */
19131 && TREE_CODE (arg
) != ARRAY_TYPE
19132 /* We check the cv-qualifiers when unifying with template type
19133 parameters below. We want to allow ARG `const T' to unify with
19134 PARM `T' for example, when computing which of two templates
19135 is more specialized, for example. */
19136 && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
19137 && !check_cv_quals_for_unify (strict_in
, arg
, parm
))
19138 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
19140 if (!(strict
& UNIFY_ALLOW_OUTER_LEVEL
)
19141 && TYPE_P (parm
) && !CP_TYPE_CONST_P (parm
))
19142 strict
&= ~UNIFY_ALLOW_MORE_CV_QUAL
;
19143 strict
&= ~UNIFY_ALLOW_OUTER_LEVEL
;
19144 strict
&= ~UNIFY_ALLOW_DERIVED
;
19145 strict
&= ~UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
19146 strict
&= ~UNIFY_ALLOW_OUTER_LESS_CV_QUAL
;
19148 switch (TREE_CODE (parm
))
19150 case TYPENAME_TYPE
:
19152 case UNBOUND_CLASS_TEMPLATE
:
19153 /* In a type which contains a nested-name-specifier, template
19154 argument values cannot be deduced for template parameters used
19155 within the nested-name-specifier. */
19156 return unify_success (explain_p
);
19158 case TEMPLATE_TYPE_PARM
:
19159 case TEMPLATE_TEMPLATE_PARM
:
19160 case BOUND_TEMPLATE_TEMPLATE_PARM
:
19161 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
19162 if (error_operand_p (tparm
))
19163 return unify_invalid (explain_p
);
19165 if (TEMPLATE_TYPE_LEVEL (parm
)
19166 != template_decl_level (tparm
))
19167 /* The PARM is not one we're trying to unify. Just check
19168 to see if it matches ARG. */
19170 if (TREE_CODE (arg
) == TREE_CODE (parm
)
19171 && (is_auto (parm
) ? is_auto (arg
)
19172 : same_type_p (parm
, arg
)))
19173 return unify_success (explain_p
);
19175 return unify_type_mismatch (explain_p
, parm
, arg
);
19177 idx
= TEMPLATE_TYPE_IDX (parm
);
19178 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
19179 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, idx
));
19180 if (error_operand_p (tparm
))
19181 return unify_invalid (explain_p
);
19183 /* Check for mixed types and values. */
19184 if ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
19185 && TREE_CODE (tparm
) != TYPE_DECL
)
19186 || (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
19187 && TREE_CODE (tparm
) != TEMPLATE_DECL
))
19188 gcc_unreachable ();
19190 if (TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
19192 /* ARG must be constructed from a template class or a template
19193 template parameter. */
19194 if (TREE_CODE (arg
) != BOUND_TEMPLATE_TEMPLATE_PARM
19195 && !CLASSTYPE_SPECIALIZATION_OF_PRIMARY_TEMPLATE_P (arg
))
19196 return unify_template_deduction_failure (explain_p
, parm
, arg
);
19198 tree parmvec
= TYPE_TI_ARGS (parm
);
19199 /* An alias template name is never deduced. */
19200 if (TYPE_ALIAS_P (arg
))
19201 arg
= strip_typedefs (arg
);
19202 tree argvec
= INNERMOST_TEMPLATE_ARGS (TYPE_TI_ARGS (arg
));
19203 tree full_argvec
= add_to_template_args (targs
, argvec
);
19205 = DECL_INNERMOST_TEMPLATE_PARMS
19206 (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (parm
));
19208 int parm_variadic_p
= 0;
19210 /* The resolution to DR150 makes clear that default
19211 arguments for an N-argument may not be used to bind T
19212 to a template template parameter with fewer than N
19213 parameters. It is not safe to permit the binding of
19214 default arguments as an extension, as that may change
19215 the meaning of a conforming program. Consider:
19217 struct Dense { static const unsigned int dim = 1; };
19219 template <template <typename> class View,
19221 void operator+(float, View<Block> const&);
19223 template <typename Block,
19224 unsigned int Dim = Block::dim>
19225 struct Lvalue_proxy { operator float() const; };
19229 Lvalue_proxy<Dense> p;
19234 Here, if Lvalue_proxy is permitted to bind to View, then
19235 the global operator+ will be used; if they are not, the
19236 Lvalue_proxy will be converted to float. */
19237 if (coerce_template_parms (parm_parms
,
19239 TYPE_TI_TEMPLATE (parm
),
19241 ? tf_warning_or_error
19243 /*require_all_args=*/true,
19244 /*use_default_args=*/false)
19245 == error_mark_node
)
19248 /* Deduce arguments T, i from TT<T> or TT<i>.
19249 We check each element of PARMVEC and ARGVEC individually
19250 rather than the whole TREE_VEC since they can have
19251 different number of elements. */
19253 parmvec
= expand_template_argument_pack (parmvec
);
19254 argvec
= expand_template_argument_pack (argvec
);
19256 len
= TREE_VEC_LENGTH (parmvec
);
19258 /* Check if the parameters end in a pack, making them
19261 && PACK_EXPANSION_P (TREE_VEC_ELT (parmvec
, len
- 1)))
19262 parm_variadic_p
= 1;
19264 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
19265 /* If the template argument list of P contains a pack
19266 expansion that is not the last template argument, the
19267 entire template argument list is a non-deduced
19269 if (PACK_EXPANSION_P (TREE_VEC_ELT (parmvec
, i
)))
19270 return unify_success (explain_p
);
19272 if (TREE_VEC_LENGTH (argvec
) < len
- parm_variadic_p
)
19273 return unify_too_few_arguments (explain_p
,
19274 TREE_VEC_LENGTH (argvec
), len
);
19276 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
19278 RECUR_AND_CHECK_FAILURE (tparms
, targs
,
19279 TREE_VEC_ELT (parmvec
, i
),
19280 TREE_VEC_ELT (argvec
, i
),
19281 UNIFY_ALLOW_NONE
, explain_p
);
19284 if (parm_variadic_p
19285 && unify_pack_expansion (tparms
, targs
,
19288 /*subr=*/true, explain_p
))
19291 arg
= TYPE_TI_TEMPLATE (arg
);
19293 /* Fall through to deduce template name. */
19296 if (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
19297 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
19299 /* Deduce template name TT from TT, TT<>, TT<T> and TT<i>. */
19301 /* Simple cases: Value already set, does match or doesn't. */
19302 if (targ
!= NULL_TREE
&& template_args_equal (targ
, arg
))
19303 return unify_success (explain_p
);
19305 return unify_inconsistency (explain_p
, parm
, targ
, arg
);
19309 /* If PARM is `const T' and ARG is only `int', we don't have
19310 a match unless we are allowing additional qualification.
19311 If ARG is `const int' and PARM is just `T' that's OK;
19312 that binds `const int' to `T'. */
19313 if (!check_cv_quals_for_unify (strict_in
| UNIFY_ALLOW_LESS_CV_QUAL
,
19315 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
19317 /* Consider the case where ARG is `const volatile int' and
19318 PARM is `const T'. Then, T should be `volatile int'. */
19319 arg
= cp_build_qualified_type_real
19320 (arg
, cp_type_quals (arg
) & ~cp_type_quals (parm
), tf_none
);
19321 if (arg
== error_mark_node
)
19322 return unify_invalid (explain_p
);
19324 /* Simple cases: Value already set, does match or doesn't. */
19325 if (targ
!= NULL_TREE
&& same_type_p (targ
, arg
))
19326 return unify_success (explain_p
);
19328 return unify_inconsistency (explain_p
, parm
, targ
, arg
);
19330 /* Make sure that ARG is not a variable-sized array. (Note
19331 that were talking about variable-sized arrays (like
19332 `int[n]'), rather than arrays of unknown size (like
19333 `int[]').) We'll get very confused by such a type since
19334 the bound of the array is not constant, and therefore
19335 not mangleable. Besides, such types are not allowed in
19336 ISO C++, so we can do as we please here. We do allow
19337 them for 'auto' deduction, since that isn't ABI-exposed. */
19338 if (!is_auto (parm
) && variably_modified_type_p (arg
, NULL_TREE
))
19339 return unify_vla_arg (explain_p
, arg
);
19341 /* Strip typedefs as in convert_template_argument. */
19342 arg
= canonicalize_type_argument (arg
, tf_none
);
19345 /* If ARG is a parameter pack or an expansion, we cannot unify
19346 against it unless PARM is also a parameter pack. */
19347 if ((template_parameter_pack_p (arg
) || PACK_EXPANSION_P (arg
))
19348 && !template_parameter_pack_p (parm
))
19349 return unify_parameter_pack_mismatch (explain_p
, parm
, arg
);
19351 /* If the argument deduction results is a METHOD_TYPE,
19352 then there is a problem.
19353 METHOD_TYPE doesn't map to any real C++ type the result of
19354 the deduction can not be of that type. */
19355 if (TREE_CODE (arg
) == METHOD_TYPE
)
19356 return unify_method_type_error (explain_p
, arg
);
19358 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = arg
;
19359 return unify_success (explain_p
);
19361 case TEMPLATE_PARM_INDEX
:
19362 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
19363 if (error_operand_p (tparm
))
19364 return unify_invalid (explain_p
);
19366 if (TEMPLATE_PARM_LEVEL (parm
)
19367 != template_decl_level (tparm
))
19369 /* The PARM is not one we're trying to unify. Just check
19370 to see if it matches ARG. */
19371 int result
= !(TREE_CODE (arg
) == TREE_CODE (parm
)
19372 && cp_tree_equal (parm
, arg
));
19374 unify_expression_unequal (explain_p
, parm
, arg
);
19378 idx
= TEMPLATE_PARM_IDX (parm
);
19379 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
19383 int x
= !cp_tree_equal (targ
, arg
);
19385 unify_inconsistency (explain_p
, parm
, targ
, arg
);
19389 /* [temp.deduct.type] If, in the declaration of a function template
19390 with a non-type template-parameter, the non-type
19391 template-parameter is used in an expression in the function
19392 parameter-list and, if the corresponding template-argument is
19393 deduced, the template-argument type shall match the type of the
19394 template-parameter exactly, except that a template-argument
19395 deduced from an array bound may be of any integral type.
19396 The non-type parameter might use already deduced type parameters. */
19397 tparm
= tsubst (TREE_TYPE (parm
), targs
, 0, NULL_TREE
);
19398 if (!TREE_TYPE (arg
))
19399 /* Template-parameter dependent expression. Just accept it for now.
19400 It will later be processed in convert_template_argument. */
19402 else if (same_type_p (TREE_TYPE (arg
), tparm
))
19404 else if ((strict
& UNIFY_ALLOW_INTEGER
)
19405 && CP_INTEGRAL_TYPE_P (tparm
))
19406 /* Convert the ARG to the type of PARM; the deduced non-type
19407 template argument must exactly match the types of the
19408 corresponding parameter. */
19409 arg
= fold (build_nop (tparm
, arg
));
19410 else if (uses_template_parms (tparm
))
19411 /* We haven't deduced the type of this parameter yet. Try again
19413 return unify_success (explain_p
);
19415 return unify_type_mismatch (explain_p
, tparm
, TREE_TYPE (arg
));
19417 /* If ARG is a parameter pack or an expansion, we cannot unify
19418 against it unless PARM is also a parameter pack. */
19419 if ((template_parameter_pack_p (arg
) || PACK_EXPANSION_P (arg
))
19420 && !TEMPLATE_PARM_PARAMETER_PACK (parm
))
19421 return unify_parameter_pack_mismatch (explain_p
, parm
, arg
);
19424 bool removed_attr
= false;
19425 arg
= strip_typedefs_expr (arg
, &removed_attr
);
19427 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = arg
;
19428 return unify_success (explain_p
);
19432 /* A pointer-to-member constant can be unified only with
19433 another constant. */
19434 if (TREE_CODE (arg
) != PTRMEM_CST
)
19435 return unify_ptrmem_cst_mismatch (explain_p
, parm
, arg
);
19437 /* Just unify the class member. It would be useless (and possibly
19438 wrong, depending on the strict flags) to unify also
19439 PTRMEM_CST_CLASS, because we want to be sure that both parm and
19440 arg refer to the same variable, even if through different
19441 classes. For instance:
19443 struct A { int x; };
19446 Unification of &A::x and &B::x must succeed. */
19447 return unify (tparms
, targs
, PTRMEM_CST_MEMBER (parm
),
19448 PTRMEM_CST_MEMBER (arg
), strict
, explain_p
);
19453 if (!TYPE_PTR_P (arg
))
19454 return unify_type_mismatch (explain_p
, parm
, arg
);
19456 /* [temp.deduct.call]
19458 A can be another pointer or pointer to member type that can
19459 be converted to the deduced A via a qualification
19460 conversion (_conv.qual_).
19462 We pass down STRICT here rather than UNIFY_ALLOW_NONE.
19463 This will allow for additional cv-qualification of the
19464 pointed-to types if appropriate. */
19466 if (TREE_CODE (TREE_TYPE (arg
)) == RECORD_TYPE
)
19467 /* The derived-to-base conversion only persists through one
19468 level of pointers. */
19469 strict
|= (strict_in
& UNIFY_ALLOW_DERIVED
);
19471 return unify (tparms
, targs
, TREE_TYPE (parm
),
19472 TREE_TYPE (arg
), strict
, explain_p
);
19475 case REFERENCE_TYPE
:
19476 if (TREE_CODE (arg
) != REFERENCE_TYPE
)
19477 return unify_type_mismatch (explain_p
, parm
, arg
);
19478 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
19479 strict
& UNIFY_ALLOW_MORE_CV_QUAL
, explain_p
);
19482 if (TREE_CODE (arg
) != ARRAY_TYPE
)
19483 return unify_type_mismatch (explain_p
, parm
, arg
);
19484 if ((TYPE_DOMAIN (parm
) == NULL_TREE
)
19485 != (TYPE_DOMAIN (arg
) == NULL_TREE
))
19486 return unify_type_mismatch (explain_p
, parm
, arg
);
19487 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
19488 strict
& UNIFY_ALLOW_MORE_CV_QUAL
, explain_p
);
19489 if (TYPE_DOMAIN (parm
) != NULL_TREE
)
19490 return unify_array_domain (tparms
, targs
, TYPE_DOMAIN (parm
),
19491 TYPE_DOMAIN (arg
), explain_p
);
19492 return unify_success (explain_p
);
19499 case ENUMERAL_TYPE
:
19502 if (TREE_CODE (arg
) != TREE_CODE (parm
))
19503 return unify_type_mismatch (explain_p
, parm
, arg
);
19505 /* We have already checked cv-qualification at the top of the
19507 if (!same_type_ignoring_top_level_qualifiers_p (arg
, parm
))
19508 return unify_type_mismatch (explain_p
, parm
, arg
);
19510 /* As far as unification is concerned, this wins. Later checks
19511 will invalidate it if necessary. */
19512 return unify_success (explain_p
);
19514 /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */
19515 /* Type INTEGER_CST can come from ordinary constant template args. */
19517 while (TREE_CODE (arg
) == NOP_EXPR
)
19518 arg
= TREE_OPERAND (arg
, 0);
19520 if (TREE_CODE (arg
) != INTEGER_CST
)
19521 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
19522 return (tree_int_cst_equal (parm
, arg
)
19523 ? unify_success (explain_p
)
19524 : unify_template_argument_mismatch (explain_p
, parm
, arg
));
19528 int i
, len
, argslen
;
19529 int parm_variadic_p
= 0;
19531 if (TREE_CODE (arg
) != TREE_VEC
)
19532 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
19534 len
= TREE_VEC_LENGTH (parm
);
19535 argslen
= TREE_VEC_LENGTH (arg
);
19537 /* Check for pack expansions in the parameters. */
19538 for (i
= 0; i
< len
; ++i
)
19540 if (PACK_EXPANSION_P (TREE_VEC_ELT (parm
, i
)))
19543 /* We can unify against something with a trailing
19545 parm_variadic_p
= 1;
19547 /* [temp.deduct.type]/9: If the template argument list of
19548 P contains a pack expansion that is not the last
19549 template argument, the entire template argument list
19550 is a non-deduced context. */
19551 return unify_success (explain_p
);
19555 /* If we don't have enough arguments to satisfy the parameters
19556 (not counting the pack expression at the end), or we have
19557 too many arguments for a parameter list that doesn't end in
19558 a pack expression, we can't unify. */
19559 if (parm_variadic_p
19560 ? argslen
< len
- parm_variadic_p
19562 return unify_arity (explain_p
, TREE_VEC_LENGTH (arg
), len
);
19564 /* Unify all of the parameters that precede the (optional)
19565 pack expression. */
19566 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
19568 RECUR_AND_CHECK_FAILURE (tparms
, targs
,
19569 TREE_VEC_ELT (parm
, i
),
19570 TREE_VEC_ELT (arg
, i
),
19571 UNIFY_ALLOW_NONE
, explain_p
);
19573 if (parm_variadic_p
)
19574 return unify_pack_expansion (tparms
, targs
, parm
, arg
,
19576 /*subr=*/true, explain_p
);
19577 return unify_success (explain_p
);
19582 if (TREE_CODE (arg
) != TREE_CODE (parm
))
19583 return unify_type_mismatch (explain_p
, parm
, arg
);
19585 if (TYPE_PTRMEMFUNC_P (parm
))
19587 if (!TYPE_PTRMEMFUNC_P (arg
))
19588 return unify_type_mismatch (explain_p
, parm
, arg
);
19590 return unify (tparms
, targs
,
19591 TYPE_PTRMEMFUNC_FN_TYPE (parm
),
19592 TYPE_PTRMEMFUNC_FN_TYPE (arg
),
19593 strict
, explain_p
);
19595 else if (TYPE_PTRMEMFUNC_P (arg
))
19596 return unify_type_mismatch (explain_p
, parm
, arg
);
19598 if (CLASSTYPE_TEMPLATE_INFO (parm
))
19600 tree t
= NULL_TREE
;
19602 if (strict_in
& UNIFY_ALLOW_DERIVED
)
19604 /* First, we try to unify the PARM and ARG directly. */
19605 t
= try_class_unification (tparms
, targs
,
19606 parm
, arg
, explain_p
);
19610 /* Fallback to the special case allowed in
19611 [temp.deduct.call]:
19613 If P is a class, and P has the form
19614 template-id, then A can be a derived class of
19615 the deduced A. Likewise, if P is a pointer to
19616 a class of the form template-id, A can be a
19617 pointer to a derived class pointed to by the
19619 enum template_base_result r
;
19620 r
= get_template_base (tparms
, targs
, parm
, arg
,
19625 /* Don't give the derived diagnostic if we're
19626 already dealing with the same template. */
19628 = (CLASSTYPE_TEMPLATE_INFO (arg
)
19629 && (CLASSTYPE_TI_TEMPLATE (parm
)
19630 == CLASSTYPE_TI_TEMPLATE (arg
)));
19631 return unify_no_common_base (explain_p
&& !same_template
,
19636 else if (CLASSTYPE_TEMPLATE_INFO (arg
)
19637 && (CLASSTYPE_TI_TEMPLATE (parm
)
19638 == CLASSTYPE_TI_TEMPLATE (arg
)))
19639 /* Perhaps PARM is something like S<U> and ARG is S<int>.
19640 Then, we should unify `int' and `U'. */
19643 /* There's no chance of unification succeeding. */
19644 return unify_type_mismatch (explain_p
, parm
, arg
);
19646 return unify (tparms
, targs
, CLASSTYPE_TI_ARGS (parm
),
19647 CLASSTYPE_TI_ARGS (t
), UNIFY_ALLOW_NONE
, explain_p
);
19649 else if (!same_type_ignoring_top_level_qualifiers_p (parm
, arg
))
19650 return unify_type_mismatch (explain_p
, parm
, arg
);
19651 return unify_success (explain_p
);
19654 case FUNCTION_TYPE
:
19656 unsigned int nargs
;
19661 if (TREE_CODE (arg
) != TREE_CODE (parm
))
19662 return unify_type_mismatch (explain_p
, parm
, arg
);
19664 /* CV qualifications for methods can never be deduced, they must
19665 match exactly. We need to check them explicitly here,
19666 because type_unification_real treats them as any other
19667 cv-qualified parameter. */
19668 if (TREE_CODE (parm
) == METHOD_TYPE
19669 && (!check_cv_quals_for_unify
19671 class_of_this_parm (arg
),
19672 class_of_this_parm (parm
))))
19673 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
19675 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TREE_TYPE (parm
),
19676 TREE_TYPE (arg
), UNIFY_ALLOW_NONE
, explain_p
);
19678 nargs
= list_length (TYPE_ARG_TYPES (arg
));
19679 args
= XALLOCAVEC (tree
, nargs
);
19680 for (a
= TYPE_ARG_TYPES (arg
), i
= 0;
19681 a
!= NULL_TREE
&& a
!= void_list_node
;
19682 a
= TREE_CHAIN (a
), ++i
)
19683 args
[i
] = TREE_VALUE (a
);
19686 return type_unification_real (tparms
, targs
, TYPE_ARG_TYPES (parm
),
19687 args
, nargs
, 1, DEDUCE_EXACT
,
19688 LOOKUP_NORMAL
, NULL
, explain_p
);
19692 /* Unify a pointer to member with a pointer to member function, which
19693 deduces the type of the member as a function type. */
19694 if (TYPE_PTRMEMFUNC_P (arg
))
19696 /* Check top-level cv qualifiers */
19697 if (!check_cv_quals_for_unify (UNIFY_ALLOW_NONE
, arg
, parm
))
19698 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
19700 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
19701 TYPE_PTRMEMFUNC_OBJECT_TYPE (arg
),
19702 UNIFY_ALLOW_NONE
, explain_p
);
19704 /* Determine the type of the function we are unifying against. */
19705 tree fntype
= static_fn_type (arg
);
19707 return unify (tparms
, targs
, TREE_TYPE (parm
), fntype
, strict
, explain_p
);
19710 if (TREE_CODE (arg
) != OFFSET_TYPE
)
19711 return unify_type_mismatch (explain_p
, parm
, arg
);
19712 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
19713 TYPE_OFFSET_BASETYPE (arg
),
19714 UNIFY_ALLOW_NONE
, explain_p
);
19715 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
19716 strict
, explain_p
);
19719 if (DECL_TEMPLATE_PARM_P (parm
))
19720 return unify (tparms
, targs
, DECL_INITIAL (parm
), arg
, strict
, explain_p
);
19721 if (arg
!= scalar_constant_value (parm
))
19722 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
19723 return unify_success (explain_p
);
19726 case TEMPLATE_DECL
:
19727 /* Matched cases are handled by the ARG == PARM test above. */
19728 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
19731 /* A non-type template parameter that is a variable should be a
19732 an integral constant, in which case, it whould have been
19733 folded into its (constant) value. So we should not be getting
19734 a variable here. */
19735 gcc_unreachable ();
19737 case TYPE_ARGUMENT_PACK
:
19738 case NONTYPE_ARGUMENT_PACK
:
19739 return unify (tparms
, targs
, ARGUMENT_PACK_ARGS (parm
),
19740 ARGUMENT_PACK_ARGS (arg
), strict
, explain_p
);
19743 case DECLTYPE_TYPE
:
19744 case UNDERLYING_TYPE
:
19745 /* Cannot deduce anything from TYPEOF_TYPE, DECLTYPE_TYPE,
19746 or UNDERLYING_TYPE nodes. */
19747 return unify_success (explain_p
);
19750 /* Unification fails if we hit an error node. */
19751 return unify_invalid (explain_p
);
19754 if (REFERENCE_REF_P (parm
))
19756 if (REFERENCE_REF_P (arg
))
19757 arg
= TREE_OPERAND (arg
, 0);
19758 return unify (tparms
, targs
, TREE_OPERAND (parm
, 0), arg
,
19759 strict
, explain_p
);
19764 /* An unresolved overload is a nondeduced context. */
19765 if (is_overloaded_fn (parm
) || type_unknown_p (parm
))
19766 return unify_success (explain_p
);
19767 gcc_assert (EXPR_P (parm
));
19769 /* We must be looking at an expression. This can happen with
19773 void foo(S<I>, S<I + 2>);
19775 This is a "nondeduced context":
19779 The nondeduced contexts are:
19781 --A type that is a template-id in which one or more of
19782 the template-arguments is an expression that references
19783 a template-parameter.
19785 In these cases, we assume deduction succeeded, but don't
19786 actually infer any unifications. */
19788 if (!uses_template_parms (parm
)
19789 && !template_args_equal (parm
, arg
))
19790 return unify_expression_unequal (explain_p
, parm
, arg
);
19792 return unify_success (explain_p
);
19795 #undef RECUR_AND_CHECK_FAILURE
19797 /* Note that DECL can be defined in this translation unit, if
19801 mark_definable (tree decl
)
19804 DECL_NOT_REALLY_EXTERN (decl
) = 1;
19805 FOR_EACH_CLONE (clone
, decl
)
19806 DECL_NOT_REALLY_EXTERN (clone
) = 1;
19809 /* Called if RESULT is explicitly instantiated, or is a member of an
19810 explicitly instantiated class. */
19813 mark_decl_instantiated (tree result
, int extern_p
)
19815 SET_DECL_EXPLICIT_INSTANTIATION (result
);
19817 /* If this entity has already been written out, it's too late to
19818 make any modifications. */
19819 if (TREE_ASM_WRITTEN (result
))
19822 /* For anonymous namespace we don't need to do anything. */
19823 if (decl_anon_ns_mem_p (result
))
19825 gcc_assert (!TREE_PUBLIC (result
));
19829 if (TREE_CODE (result
) != FUNCTION_DECL
)
19830 /* The TREE_PUBLIC flag for function declarations will have been
19831 set correctly by tsubst. */
19832 TREE_PUBLIC (result
) = 1;
19834 /* This might have been set by an earlier implicit instantiation. */
19835 DECL_COMDAT (result
) = 0;
19838 DECL_NOT_REALLY_EXTERN (result
) = 0;
19841 mark_definable (result
);
19842 mark_needed (result
);
19843 /* Always make artificials weak. */
19844 if (DECL_ARTIFICIAL (result
) && flag_weak
)
19845 comdat_linkage (result
);
19846 /* For WIN32 we also want to put explicit instantiations in
19847 linkonce sections. */
19848 else if (TREE_PUBLIC (result
))
19849 maybe_make_one_only (result
);
19852 /* If EXTERN_P, then this function will not be emitted -- unless
19853 followed by an explicit instantiation, at which point its linkage
19854 will be adjusted. If !EXTERN_P, then this function will be
19855 emitted here. In neither circumstance do we want
19856 import_export_decl to adjust the linkage. */
19857 DECL_INTERFACE_KNOWN (result
) = 1;
19860 /* Subroutine of more_specialized_fn: check whether TARGS is missing any
19861 important template arguments. If any are missing, we check whether
19862 they're important by using error_mark_node for substituting into any
19863 args that were used for partial ordering (the ones between ARGS and END)
19864 and seeing if it bubbles up. */
19867 check_undeduced_parms (tree targs
, tree args
, tree end
)
19869 bool found
= false;
19871 for (i
= TREE_VEC_LENGTH (targs
) - 1; i
>= 0; --i
)
19872 if (TREE_VEC_ELT (targs
, i
) == NULL_TREE
)
19875 TREE_VEC_ELT (targs
, i
) = error_mark_node
;
19879 tree substed
= tsubst_arg_types (args
, targs
, end
, tf_none
, NULL_TREE
);
19880 if (substed
== error_mark_node
)
19886 /* Given two function templates PAT1 and PAT2, return:
19888 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order].
19889 -1 if PAT2 is more specialized than PAT1.
19890 0 if neither is more specialized.
19892 LEN indicates the number of parameters we should consider
19893 (defaulted parameters should not be considered).
19895 The 1998 std underspecified function template partial ordering, and
19896 DR214 addresses the issue. We take pairs of arguments, one from
19897 each of the templates, and deduce them against each other. One of
19898 the templates will be more specialized if all the *other*
19899 template's arguments deduce against its arguments and at least one
19900 of its arguments *does* *not* deduce against the other template's
19901 corresponding argument. Deduction is done as for class templates.
19902 The arguments used in deduction have reference and top level cv
19903 qualifiers removed. Iff both arguments were originally reference
19904 types *and* deduction succeeds in both directions, an lvalue reference
19905 wins against an rvalue reference and otherwise the template
19906 with the more cv-qualified argument wins for that pairing (if
19907 neither is more cv-qualified, they both are equal). Unlike regular
19908 deduction, after all the arguments have been deduced in this way,
19909 we do *not* verify the deduced template argument values can be
19910 substituted into non-deduced contexts.
19912 The logic can be a bit confusing here, because we look at deduce1 and
19913 targs1 to see if pat2 is at least as specialized, and vice versa; if we
19914 can find template arguments for pat1 to make arg1 look like arg2, that
19915 means that arg2 is at least as specialized as arg1. */
19918 more_specialized_fn (tree pat1
, tree pat2
, int len
)
19920 tree decl1
= DECL_TEMPLATE_RESULT (pat1
);
19921 tree decl2
= DECL_TEMPLATE_RESULT (pat2
);
19922 tree targs1
= make_tree_vec (DECL_NTPARMS (pat1
));
19923 tree targs2
= make_tree_vec (DECL_NTPARMS (pat2
));
19924 tree tparms1
= DECL_INNERMOST_TEMPLATE_PARMS (pat1
);
19925 tree tparms2
= DECL_INNERMOST_TEMPLATE_PARMS (pat2
);
19926 tree args1
= TYPE_ARG_TYPES (TREE_TYPE (decl1
));
19927 tree args2
= TYPE_ARG_TYPES (TREE_TYPE (decl2
));
19928 tree origs1
, origs2
;
19929 bool lose1
= false;
19930 bool lose2
= false;
19932 /* Remove the this parameter from non-static member functions. If
19933 one is a non-static member function and the other is not a static
19934 member function, remove the first parameter from that function
19935 also. This situation occurs for operator functions where we
19936 locate both a member function (with this pointer) and non-member
19937 operator (with explicit first operand). */
19938 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl1
))
19940 len
--; /* LEN is the number of significant arguments for DECL1 */
19941 args1
= TREE_CHAIN (args1
);
19942 if (!DECL_STATIC_FUNCTION_P (decl2
))
19943 args2
= TREE_CHAIN (args2
);
19945 else if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl2
))
19947 args2
= TREE_CHAIN (args2
);
19948 if (!DECL_STATIC_FUNCTION_P (decl1
))
19951 args1
= TREE_CHAIN (args1
);
19955 /* If only one is a conversion operator, they are unordered. */
19956 if (DECL_CONV_FN_P (decl1
) != DECL_CONV_FN_P (decl2
))
19959 /* Consider the return type for a conversion function */
19960 if (DECL_CONV_FN_P (decl1
))
19962 args1
= tree_cons (NULL_TREE
, TREE_TYPE (TREE_TYPE (decl1
)), args1
);
19963 args2
= tree_cons (NULL_TREE
, TREE_TYPE (TREE_TYPE (decl2
)), args2
);
19967 processing_template_decl
++;
19973 /* Stop when an ellipsis is seen. */
19974 && args1
!= NULL_TREE
&& args2
!= NULL_TREE
)
19976 tree arg1
= TREE_VALUE (args1
);
19977 tree arg2
= TREE_VALUE (args2
);
19978 int deduce1
, deduce2
;
19984 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
19985 && TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
19987 /* When both arguments are pack expansions, we need only
19988 unify the patterns themselves. */
19989 arg1
= PACK_EXPANSION_PATTERN (arg1
);
19990 arg2
= PACK_EXPANSION_PATTERN (arg2
);
19992 /* This is the last comparison we need to do. */
19996 if (TREE_CODE (arg1
) == REFERENCE_TYPE
)
19998 ref1
= TYPE_REF_IS_RVALUE (arg1
) + 1;
19999 arg1
= TREE_TYPE (arg1
);
20000 quals1
= cp_type_quals (arg1
);
20003 if (TREE_CODE (arg2
) == REFERENCE_TYPE
)
20005 ref2
= TYPE_REF_IS_RVALUE (arg2
) + 1;
20006 arg2
= TREE_TYPE (arg2
);
20007 quals2
= cp_type_quals (arg2
);
20010 arg1
= TYPE_MAIN_VARIANT (arg1
);
20011 arg2
= TYPE_MAIN_VARIANT (arg2
);
20013 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
)
20015 int i
, len2
= list_length (args2
);
20016 tree parmvec
= make_tree_vec (1);
20017 tree argvec
= make_tree_vec (len2
);
20020 /* Setup the parameter vector, which contains only ARG1. */
20021 TREE_VEC_ELT (parmvec
, 0) = arg1
;
20023 /* Setup the argument vector, which contains the remaining
20025 for (i
= 0; i
< len2
; i
++, ta
= TREE_CHAIN (ta
))
20026 TREE_VEC_ELT (argvec
, i
) = TREE_VALUE (ta
);
20028 deduce1
= (unify_pack_expansion (tparms1
, targs1
, parmvec
,
20029 argvec
, DEDUCE_EXACT
,
20030 /*subr=*/true, /*explain_p=*/false)
20033 /* We cannot deduce in the other direction, because ARG1 is
20034 a pack expansion but ARG2 is not. */
20037 else if (TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
20039 int i
, len1
= list_length (args1
);
20040 tree parmvec
= make_tree_vec (1);
20041 tree argvec
= make_tree_vec (len1
);
20044 /* Setup the parameter vector, which contains only ARG1. */
20045 TREE_VEC_ELT (parmvec
, 0) = arg2
;
20047 /* Setup the argument vector, which contains the remaining
20049 for (i
= 0; i
< len1
; i
++, ta
= TREE_CHAIN (ta
))
20050 TREE_VEC_ELT (argvec
, i
) = TREE_VALUE (ta
);
20052 deduce2
= (unify_pack_expansion (tparms2
, targs2
, parmvec
,
20053 argvec
, DEDUCE_EXACT
,
20054 /*subr=*/true, /*explain_p=*/false)
20057 /* We cannot deduce in the other direction, because ARG2 is
20058 a pack expansion but ARG1 is not.*/
20064 /* The normal case, where neither argument is a pack
20066 deduce1
= (unify (tparms1
, targs1
, arg1
, arg2
,
20067 UNIFY_ALLOW_NONE
, /*explain_p=*/false)
20069 deduce2
= (unify (tparms2
, targs2
, arg2
, arg1
,
20070 UNIFY_ALLOW_NONE
, /*explain_p=*/false)
20074 /* If we couldn't deduce arguments for tparms1 to make arg1 match
20075 arg2, then arg2 is not as specialized as arg1. */
20081 /* "If, for a given type, deduction succeeds in both directions
20082 (i.e., the types are identical after the transformations above)
20083 and both P and A were reference types (before being replaced with
20084 the type referred to above):
20085 - if the type from the argument template was an lvalue reference and
20086 the type from the parameter template was not, the argument type is
20087 considered to be more specialized than the other; otherwise,
20088 - if the type from the argument template is more cv-qualified
20089 than the type from the parameter template (as described above),
20090 the argument type is considered to be more specialized than the other;
20092 - neither type is more specialized than the other." */
20094 if (deduce1
&& deduce2
)
20096 if (ref1
&& ref2
&& ref1
!= ref2
)
20103 else if (quals1
!= quals2
&& quals1
>= 0 && quals2
>= 0)
20105 if ((quals1
& quals2
) == quals2
)
20107 if ((quals1
& quals2
) == quals1
)
20112 if (lose1
&& lose2
)
20113 /* We've failed to deduce something in either direction.
20114 These must be unordered. */
20117 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
20118 || TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
20119 /* We have already processed all of the arguments in our
20120 handing of the pack expansion type. */
20123 args1
= TREE_CHAIN (args1
);
20124 args2
= TREE_CHAIN (args2
);
20127 /* "In most cases, all template parameters must have values in order for
20128 deduction to succeed, but for partial ordering purposes a template
20129 parameter may remain without a value provided it is not used in the
20130 types being used for partial ordering."
20132 Thus, if we are missing any of the targs1 we need to substitute into
20133 origs1, then pat2 is not as specialized as pat1. This can happen when
20134 there is a nondeduced context. */
20135 if (!lose2
&& check_undeduced_parms (targs1
, origs1
, args1
))
20137 if (!lose1
&& check_undeduced_parms (targs2
, origs2
, args2
))
20140 processing_template_decl
--;
20142 /* If both deductions succeed, the partial ordering selects the more
20143 constrained template. */
20144 if (!lose1
&& !lose2
)
20146 tree c1
= get_constraints (DECL_TEMPLATE_RESULT (pat1
));
20147 tree c2
= get_constraints (DECL_TEMPLATE_RESULT (pat2
));
20148 lose1
= !subsumes_constraints (c1
, c2
);
20149 lose2
= !subsumes_constraints (c2
, c1
);
20152 /* All things being equal, if the next argument is a pack expansion
20153 for one function but not for the other, prefer the
20154 non-variadic function. FIXME this is bogus; see c++/41958. */
20156 && args1
&& TREE_VALUE (args1
)
20157 && args2
&& TREE_VALUE (args2
))
20159 lose1
= TREE_CODE (TREE_VALUE (args1
)) == TYPE_PACK_EXPANSION
;
20160 lose2
= TREE_CODE (TREE_VALUE (args2
)) == TYPE_PACK_EXPANSION
;
20163 if (lose1
== lose2
)
20171 /* Determine which of two partial specializations of TMPL is more
20174 PAT1 is a TREE_LIST whose TREE_VALUE is the TEMPLATE_DECL corresponding
20175 to the first partial specialization. The TREE_PURPOSE is the
20176 innermost set of template parameters for the partial
20177 specialization. PAT2 is similar, but for the second template.
20179 Return 1 if the first partial specialization is more specialized;
20180 -1 if the second is more specialized; 0 if neither is more
20183 See [temp.class.order] for information about determining which of
20184 two templates is more specialized. */
20187 more_specialized_partial_spec (tree tmpl
, tree pat1
, tree pat2
)
20191 bool any_deductions
= false;
20193 tree tmpl1
= TREE_VALUE (pat1
);
20194 tree tmpl2
= TREE_VALUE (pat2
);
20195 tree parms1
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl1
);
20196 tree parms2
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl2
);
20197 tree specargs1
= TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (tmpl1
)));
20198 tree specargs2
= TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (tmpl2
)));
20200 /* Just like what happens for functions, if we are ordering between
20201 different template specializations, we may encounter dependent
20202 types in the arguments, and we need our dependency check functions
20203 to behave correctly. */
20204 ++processing_template_decl
;
20205 targs
= get_partial_spec_bindings (tmpl
, parms1
, specargs1
, specargs2
);
20209 any_deductions
= true;
20212 targs
= get_partial_spec_bindings (tmpl
, parms2
, specargs2
, specargs1
);
20216 any_deductions
= true;
20218 --processing_template_decl
;
20220 /* If both deductions succeed, the partial ordering selects the more
20221 constrained template. */
20222 if (!winner
&& any_deductions
)
20223 return more_constrained (tmpl1
, tmpl2
);
20225 /* In the case of a tie where at least one of the templates
20226 has a parameter pack at the end, the template with the most
20227 non-packed parameters wins. */
20230 && (template_args_variadic_p (TREE_PURPOSE (pat1
))
20231 || template_args_variadic_p (TREE_PURPOSE (pat2
))))
20233 tree args1
= INNERMOST_TEMPLATE_ARGS (TREE_PURPOSE (pat1
));
20234 tree args2
= INNERMOST_TEMPLATE_ARGS (TREE_PURPOSE (pat2
));
20235 int len1
= TREE_VEC_LENGTH (args1
);
20236 int len2
= TREE_VEC_LENGTH (args2
);
20238 /* We don't count the pack expansion at the end. */
20239 if (template_args_variadic_p (TREE_PURPOSE (pat1
)))
20241 if (template_args_variadic_p (TREE_PURPOSE (pat2
)))
20246 else if (len1
< len2
)
20253 /* Return the template arguments that will produce the function signature
20254 DECL from the function template FN, with the explicit template
20255 arguments EXPLICIT_ARGS. If CHECK_RETTYPE is true, the return type must
20256 also match. Return NULL_TREE if no satisfactory arguments could be
20260 get_bindings (tree fn
, tree decl
, tree explicit_args
, bool check_rettype
)
20262 int ntparms
= DECL_NTPARMS (fn
);
20263 tree targs
= make_tree_vec (ntparms
);
20264 tree decl_type
= TREE_TYPE (decl
);
20265 tree decl_arg_types
;
20267 unsigned int nargs
, ix
;
20270 gcc_assert (decl
!= DECL_TEMPLATE_RESULT (fn
));
20272 /* Never do unification on the 'this' parameter. */
20273 decl_arg_types
= skip_artificial_parms_for (decl
,
20274 TYPE_ARG_TYPES (decl_type
));
20276 nargs
= list_length (decl_arg_types
);
20277 args
= XALLOCAVEC (tree
, nargs
);
20278 for (arg
= decl_arg_types
, ix
= 0;
20279 arg
!= NULL_TREE
&& arg
!= void_list_node
;
20280 arg
= TREE_CHAIN (arg
), ++ix
)
20281 args
[ix
] = TREE_VALUE (arg
);
20283 if (fn_type_unification (fn
, explicit_args
, targs
,
20285 (check_rettype
|| DECL_CONV_FN_P (fn
)
20286 ? TREE_TYPE (decl_type
) : NULL_TREE
),
20287 DEDUCE_EXACT
, LOOKUP_NORMAL
, /*explain_p=*/false,
20289 == error_mark_node
)
20295 /* Return the innermost template arguments that, when applied to a partial
20296 specialization of TMPL whose innermost template parameters are
20297 TPARMS, and whose specialization arguments are SPEC_ARGS, yield the
20300 For example, suppose we have:
20302 template <class T, class U> struct S {};
20303 template <class T> struct S<T*, int> {};
20305 Then, suppose we want to get `S<double*, int>'. The TPARMS will be
20306 {T}, the SPEC_ARGS will be {T*, int} and the ARGS will be {double*,
20307 int}. The resulting vector will be {double}, indicating that `T'
20308 is bound to `double'. */
20311 get_partial_spec_bindings (tree tmpl
, tree tparms
, tree spec_args
, tree args
)
20313 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
20315 tree innermost_deduced_args
;
20317 innermost_deduced_args
= make_tree_vec (ntparms
);
20318 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
20320 deduced_args
= copy_node (args
);
20321 SET_TMPL_ARGS_LEVEL (deduced_args
,
20322 TMPL_ARGS_DEPTH (deduced_args
),
20323 innermost_deduced_args
);
20326 deduced_args
= innermost_deduced_args
;
20328 if (unify (tparms
, deduced_args
,
20329 INNERMOST_TEMPLATE_ARGS (spec_args
),
20330 INNERMOST_TEMPLATE_ARGS (args
),
20331 UNIFY_ALLOW_NONE
, /*explain_p=*/false))
20334 for (i
= 0; i
< ntparms
; ++i
)
20335 if (! TREE_VEC_ELT (innermost_deduced_args
, i
))
20338 /* Verify that nondeduced template arguments agree with the type
20339 obtained from argument deduction.
20343 struct A { typedef int X; };
20344 template <class T, class U> struct C {};
20345 template <class T> struct C<T, typename T::X> {};
20347 Then with the instantiation `C<A, int>', we can deduce that
20348 `T' is `A' but unify () does not check whether `typename T::X'
20350 spec_args
= tsubst (spec_args
, deduced_args
, tf_none
, NULL_TREE
);
20351 spec_args
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
20353 tf_none
, false, false);
20354 if (spec_args
== error_mark_node
20355 /* We only need to check the innermost arguments; the other
20356 arguments will always agree. */
20357 || !comp_template_args (INNERMOST_TEMPLATE_ARGS (spec_args
),
20358 INNERMOST_TEMPLATE_ARGS (args
)))
20361 /* Now that we have bindings for all of the template arguments,
20362 ensure that the arguments deduced for the template template
20363 parameters have compatible template parameter lists. See the use
20364 of template_template_parm_bindings_ok_p in fn_type_unification
20365 for more information. */
20366 if (!template_template_parm_bindings_ok_p (tparms
, deduced_args
))
20369 return deduced_args
;
20372 // Compare two function templates T1 and T2 by deducing bindings
20373 // from one against the other. If both deductions succeed, compare
20374 // constraints to see which is more constrained.
20376 more_specialized_inst (tree t1
, tree t2
)
20381 if (get_bindings (t1
, DECL_TEMPLATE_RESULT (t2
), NULL_TREE
, true))
20387 if (get_bindings (t2
, DECL_TEMPLATE_RESULT (t1
), NULL_TREE
, true))
20393 // If both deductions succeed, then one may be more constrained.
20394 if (count
== 2 && fate
== 0)
20395 fate
= more_constrained (t1
, t2
);
20400 /* TEMPLATES is a TREE_LIST. Each TREE_VALUE is a TEMPLATE_DECL.
20401 Return the TREE_LIST node with the most specialized template, if
20402 any. If there is no most specialized template, the error_mark_node
20405 Note that this function does not look at, or modify, the
20406 TREE_PURPOSE or TREE_TYPE of any of the nodes. Since the node
20407 returned is one of the elements of INSTANTIATIONS, callers may
20408 store information in the TREE_PURPOSE or TREE_TYPE of the nodes,
20409 and retrieve it from the value returned. */
20412 most_specialized_instantiation (tree templates
)
20416 ++processing_template_decl
;
20419 for (fn
= TREE_CHAIN (templates
); fn
; fn
= TREE_CHAIN (fn
))
20421 int fate
= more_specialized_inst (TREE_VALUE (champ
), TREE_VALUE (fn
));
20426 /* Equally specialized, move to next function. If there
20427 is no next function, nothing's most specialized. */
20428 fn
= TREE_CHAIN (fn
);
20436 /* Now verify that champ is better than everything earlier in the
20437 instantiation list. */
20438 for (fn
= templates
; fn
!= champ
; fn
= TREE_CHAIN (fn
)) {
20439 if (more_specialized_inst (TREE_VALUE (champ
), TREE_VALUE (fn
)) != 1)
20446 processing_template_decl
--;
20449 return error_mark_node
;
20454 /* If DECL is a specialization of some template, return the most
20455 general such template. Otherwise, returns NULL_TREE.
20457 For example, given:
20459 template <class T> struct S { template <class U> void f(U); };
20461 if TMPL is `template <class U> void S<int>::f(U)' this will return
20462 the full template. This function will not trace past partial
20463 specializations, however. For example, given in addition:
20465 template <class T> struct S<T*> { template <class U> void f(U); };
20467 if TMPL is `template <class U> void S<int*>::f(U)' this will return
20468 `template <class T> template <class U> S<T*>::f(U)'. */
20471 most_general_template (tree decl
)
20473 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
20475 if (tree tinfo
= get_template_info (decl
))
20476 decl
= TI_TEMPLATE (tinfo
);
20477 /* The TI_TEMPLATE can be an IDENTIFIER_NODE for a
20478 template friend, or a FIELD_DECL for a capture pack. */
20479 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
20483 /* Look for more and more general templates. */
20484 while (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
))
20486 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE in some cases.
20487 (See cp-tree.h for details.) */
20488 if (TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
20491 if (CLASS_TYPE_P (TREE_TYPE (decl
))
20492 && !TYPE_DECL_ALIAS_P (TYPE_NAME (TREE_TYPE (decl
)))
20493 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)))
20496 /* Stop if we run into an explicitly specialized class template. */
20497 if (!DECL_NAMESPACE_SCOPE_P (decl
)
20498 && DECL_CONTEXT (decl
)
20499 && CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (decl
)))
20502 decl
= DECL_TI_TEMPLATE (decl
);
20508 /* Return the most specialized of the template partial specializations
20509 which can produce TARGET, a specialization of some class or variable
20510 template. The value returned is actually a TREE_LIST; the TREE_VALUE is
20511 a TEMPLATE_DECL node corresponding to the partial specialization, while
20512 the TREE_PURPOSE is the set of template arguments that must be
20513 substituted into the template pattern in order to generate TARGET.
20515 If the choice of partial specialization is ambiguous, a diagnostic
20516 is issued, and the error_mark_node is returned. If there are no
20517 partial specializations matching TARGET, then NULL_TREE is
20518 returned, indicating that the primary template should be used. */
20521 most_specialized_partial_spec (tree target
, tsubst_flags_t complain
)
20523 tree list
= NULL_TREE
;
20528 tree outer_args
= NULL_TREE
;
20531 if (TYPE_P (target
))
20533 tree tinfo
= CLASSTYPE_TEMPLATE_INFO (target
);
20534 tmpl
= TI_TEMPLATE (tinfo
);
20535 args
= TI_ARGS (tinfo
);
20537 else if (TREE_CODE (target
) == TEMPLATE_ID_EXPR
)
20539 tmpl
= TREE_OPERAND (target
, 0);
20540 args
= TREE_OPERAND (target
, 1);
20542 else if (VAR_P (target
))
20544 tree tinfo
= DECL_TEMPLATE_INFO (target
);
20545 tmpl
= TI_TEMPLATE (tinfo
);
20546 args
= TI_ARGS (tinfo
);
20549 gcc_unreachable ();
20551 tree main_tmpl
= most_general_template (tmpl
);
20553 /* For determining which partial specialization to use, only the
20554 innermost args are interesting. */
20555 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
20557 outer_args
= strip_innermost_template_args (args
, 1);
20558 args
= INNERMOST_TEMPLATE_ARGS (args
);
20561 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (main_tmpl
); t
; t
= TREE_CHAIN (t
))
20563 tree partial_spec_args
;
20565 tree spec_tmpl
= TREE_VALUE (t
);
20567 partial_spec_args
= TREE_PURPOSE (t
);
20569 ++processing_template_decl
;
20573 /* Discard the outer levels of args, and then substitute in the
20574 template args from the enclosing class. */
20575 partial_spec_args
= INNERMOST_TEMPLATE_ARGS (partial_spec_args
);
20576 partial_spec_args
= tsubst_template_args
20577 (partial_spec_args
, outer_args
, tf_none
, NULL_TREE
);
20579 /* And the same for the partial specialization TEMPLATE_DECL. */
20580 spec_tmpl
= tsubst (spec_tmpl
, outer_args
, tf_none
, NULL_TREE
);
20583 partial_spec_args
=
20584 coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
20587 /*require_all_args=*/true,
20588 /*use_default_args=*/true);
20590 --processing_template_decl
;
20592 if (partial_spec_args
== error_mark_node
)
20593 return error_mark_node
;
20594 if (spec_tmpl
== error_mark_node
)
20595 return error_mark_node
;
20597 tree parms
= DECL_INNERMOST_TEMPLATE_PARMS (spec_tmpl
);
20598 spec_args
= get_partial_spec_bindings (tmpl
, parms
,
20604 spec_args
= add_to_template_args (outer_args
, spec_args
);
20606 /* Keep the candidate only if the constraints are satisfied,
20607 or if we're not compiling with concepts. */
20609 || constraints_satisfied_p (spec_tmpl
, spec_args
))
20611 list
= tree_cons (spec_args
, TREE_VALUE (t
), list
);
20612 TREE_TYPE (list
) = TREE_TYPE (t
);
20620 ambiguous_p
= false;
20623 t
= TREE_CHAIN (t
);
20624 for (; t
; t
= TREE_CHAIN (t
))
20626 fate
= more_specialized_partial_spec (tmpl
, champ
, t
);
20633 t
= TREE_CHAIN (t
);
20636 ambiguous_p
= true;
20645 for (t
= list
; t
&& t
!= champ
; t
= TREE_CHAIN (t
))
20647 fate
= more_specialized_partial_spec (tmpl
, champ
, t
);
20650 ambiguous_p
= true;
20658 char *spaces
= NULL
;
20659 if (!(complain
& tf_error
))
20660 return error_mark_node
;
20661 if (TYPE_P (target
))
20662 error ("ambiguous template instantiation for %q#T", target
);
20664 error ("ambiguous template instantiation for %q#D", target
);
20665 str
= ngettext ("candidate is:", "candidates are:", list_length (list
));
20666 for (t
= list
; t
; t
= TREE_CHAIN (t
))
20668 tree subst
= build_tree_list (TREE_VALUE (t
), TREE_PURPOSE (t
));
20669 inform (DECL_SOURCE_LOCATION (TREE_VALUE (t
)),
20670 "%s %#S", spaces
? spaces
: str
, subst
);
20671 spaces
= spaces
? spaces
: get_spaces (str
);
20674 return error_mark_node
;
20680 /* Explicitly instantiate DECL. */
20683 do_decl_instantiation (tree decl
, tree storage
)
20685 tree result
= NULL_TREE
;
20688 if (!decl
|| decl
== error_mark_node
)
20689 /* An error occurred, for which grokdeclarator has already issued
20690 an appropriate message. */
20692 else if (! DECL_LANG_SPECIFIC (decl
))
20694 error ("explicit instantiation of non-template %q#D", decl
);
20698 bool var_templ
= (DECL_TEMPLATE_INFO (decl
)
20699 && variable_template_p (DECL_TI_TEMPLATE (decl
)));
20701 if (VAR_P (decl
) && !var_templ
)
20703 /* There is an asymmetry here in the way VAR_DECLs and
20704 FUNCTION_DECLs are handled by grokdeclarator. In the case of
20705 the latter, the DECL we get back will be marked as a
20706 template instantiation, and the appropriate
20707 DECL_TEMPLATE_INFO will be set up. This does not happen for
20708 VAR_DECLs so we do the lookup here. Probably, grokdeclarator
20709 should handle VAR_DECLs as it currently handles
20711 if (!DECL_CLASS_SCOPE_P (decl
))
20713 error ("%qD is not a static data member of a class template", decl
);
20716 result
= lookup_field (DECL_CONTEXT (decl
), DECL_NAME (decl
), 0, false);
20717 if (!result
|| !VAR_P (result
))
20719 error ("no matching template for %qD found", decl
);
20722 if (!same_type_p (TREE_TYPE (result
), TREE_TYPE (decl
)))
20724 error ("type %qT for explicit instantiation %qD does not match "
20725 "declared type %qT", TREE_TYPE (result
), decl
,
20730 else if (TREE_CODE (decl
) != FUNCTION_DECL
&& !var_templ
)
20732 error ("explicit instantiation of %q#D", decl
);
20738 /* Check for various error cases. Note that if the explicit
20739 instantiation is valid the RESULT will currently be marked as an
20740 *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set
20741 until we get here. */
20743 if (DECL_TEMPLATE_SPECIALIZATION (result
))
20745 /* DR 259 [temp.spec].
20747 Both an explicit instantiation and a declaration of an explicit
20748 specialization shall not appear in a program unless the explicit
20749 instantiation follows a declaration of the explicit specialization.
20751 For a given set of template parameters, if an explicit
20752 instantiation of a template appears after a declaration of an
20753 explicit specialization for that template, the explicit
20754 instantiation has no effect. */
20757 else if (DECL_EXPLICIT_INSTANTIATION (result
))
20761 No program shall explicitly instantiate any template more
20764 We check DECL_NOT_REALLY_EXTERN so as not to complain when
20765 the first instantiation was `extern' and the second is not,
20766 and EXTERN_P for the opposite case. */
20767 if (DECL_NOT_REALLY_EXTERN (result
) && !extern_p
)
20768 permerror (input_location
, "duplicate explicit instantiation of %q#D", result
);
20769 /* If an "extern" explicit instantiation follows an ordinary
20770 explicit instantiation, the template is instantiated. */
20774 else if (!DECL_IMPLICIT_INSTANTIATION (result
))
20776 error ("no matching template for %qD found", result
);
20779 else if (!DECL_TEMPLATE_INFO (result
))
20781 permerror (input_location
, "explicit instantiation of non-template %q#D", result
);
20785 if (storage
== NULL_TREE
)
20787 else if (storage
== ridpointers
[(int) RID_EXTERN
])
20789 if (!in_system_header_at (input_location
) && (cxx_dialect
== cxx98
))
20790 pedwarn (input_location
, OPT_Wpedantic
,
20791 "ISO C++ 1998 forbids the use of %<extern%> on explicit "
20796 error ("storage class %qD applied to template instantiation", storage
);
20798 check_explicit_instantiation_namespace (result
);
20799 mark_decl_instantiated (result
, extern_p
);
20801 instantiate_decl (result
, /*defer_ok=*/1,
20802 /*expl_inst_class_mem_p=*/false);
20806 mark_class_instantiated (tree t
, int extern_p
)
20808 SET_CLASSTYPE_EXPLICIT_INSTANTIATION (t
);
20809 SET_CLASSTYPE_INTERFACE_KNOWN (t
);
20810 CLASSTYPE_INTERFACE_ONLY (t
) = extern_p
;
20811 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (t
)) = extern_p
;
20814 CLASSTYPE_DEBUG_REQUESTED (t
) = 1;
20815 rest_of_type_compilation (t
, 1);
20819 /* Called from do_type_instantiation through binding_table_foreach to
20820 do recursive instantiation for the type bound in ENTRY. */
20822 bt_instantiate_type_proc (binding_entry entry
, void *data
)
20824 tree storage
= *(tree
*) data
;
20826 if (MAYBE_CLASS_TYPE_P (entry
->type
)
20827 && !uses_template_parms (CLASSTYPE_TI_ARGS (entry
->type
)))
20828 do_type_instantiation (TYPE_MAIN_DECL (entry
->type
), storage
, 0);
20831 /* Called from do_type_instantiation to instantiate a member
20832 (a member function or a static member variable) of an
20833 explicitly instantiated class template. */
20835 instantiate_class_member (tree decl
, int extern_p
)
20837 mark_decl_instantiated (decl
, extern_p
);
20839 instantiate_decl (decl
, /*defer_ok=*/1,
20840 /*expl_inst_class_mem_p=*/true);
20843 /* Perform an explicit instantiation of template class T. STORAGE, if
20844 non-null, is the RID for extern, inline or static. COMPLAIN is
20845 nonzero if this is called from the parser, zero if called recursively,
20846 since the standard is unclear (as detailed below). */
20849 do_type_instantiation (tree t
, tree storage
, tsubst_flags_t complain
)
20854 int previous_instantiation_extern_p
= 0;
20856 if (TREE_CODE (t
) == TYPE_DECL
)
20859 if (! CLASS_TYPE_P (t
) || ! CLASSTYPE_TEMPLATE_INFO (t
))
20862 (TYPE_TEMPLATE_INFO (t
)) ? TYPE_TI_TEMPLATE (t
) : NULL
;
20864 error ("explicit instantiation of non-class template %qD", tmpl
);
20866 error ("explicit instantiation of non-template type %qT", t
);
20872 if (!COMPLETE_TYPE_P (t
))
20874 if (complain
& tf_error
)
20875 error ("explicit instantiation of %q#T before definition of template",
20880 if (storage
!= NULL_TREE
)
20882 if (!in_system_header_at (input_location
))
20884 if (storage
== ridpointers
[(int) RID_EXTERN
])
20886 if (cxx_dialect
== cxx98
)
20887 pedwarn (input_location
, OPT_Wpedantic
,
20888 "ISO C++ 1998 forbids the use of %<extern%> on "
20889 "explicit instantiations");
20892 pedwarn (input_location
, OPT_Wpedantic
,
20893 "ISO C++ forbids the use of %qE"
20894 " on explicit instantiations", storage
);
20897 if (storage
== ridpointers
[(int) RID_INLINE
])
20899 else if (storage
== ridpointers
[(int) RID_EXTERN
])
20901 else if (storage
== ridpointers
[(int) RID_STATIC
])
20905 error ("storage class %qD applied to template instantiation",
20911 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
20913 /* DR 259 [temp.spec].
20915 Both an explicit instantiation and a declaration of an explicit
20916 specialization shall not appear in a program unless the explicit
20917 instantiation follows a declaration of the explicit specialization.
20919 For a given set of template parameters, if an explicit
20920 instantiation of a template appears after a declaration of an
20921 explicit specialization for that template, the explicit
20922 instantiation has no effect. */
20925 else if (CLASSTYPE_EXPLICIT_INSTANTIATION (t
))
20929 No program shall explicitly instantiate any template more
20932 If PREVIOUS_INSTANTIATION_EXTERN_P, then the first explicit
20933 instantiation was `extern'. If EXTERN_P then the second is.
20934 These cases are OK. */
20935 previous_instantiation_extern_p
= CLASSTYPE_INTERFACE_ONLY (t
);
20937 if (!previous_instantiation_extern_p
&& !extern_p
20938 && (complain
& tf_error
))
20939 permerror (input_location
, "duplicate explicit instantiation of %q#T", t
);
20941 /* If we've already instantiated the template, just return now. */
20942 if (!CLASSTYPE_INTERFACE_ONLY (t
))
20946 check_explicit_instantiation_namespace (TYPE_NAME (t
));
20947 mark_class_instantiated (t
, extern_p
);
20955 /* In contrast to implicit instantiation, where only the
20956 declarations, and not the definitions, of members are
20957 instantiated, we have here:
20961 The explicit instantiation of a class template specialization
20962 implies the instantiation of all of its members not
20963 previously explicitly specialized in the translation unit
20964 containing the explicit instantiation.
20966 Of course, we can't instantiate member template classes, since
20967 we don't have any arguments for them. Note that the standard
20968 is unclear on whether the instantiation of the members are
20969 *explicit* instantiations or not. However, the most natural
20970 interpretation is that it should be an explicit instantiation. */
20973 for (tmp
= TYPE_METHODS (t
); tmp
; tmp
= DECL_CHAIN (tmp
))
20974 if (TREE_CODE (tmp
) == FUNCTION_DECL
20975 && DECL_TEMPLATE_INSTANTIATION (tmp
))
20976 instantiate_class_member (tmp
, extern_p
);
20978 for (tmp
= TYPE_FIELDS (t
); tmp
; tmp
= DECL_CHAIN (tmp
))
20979 if (VAR_P (tmp
) && DECL_TEMPLATE_INSTANTIATION (tmp
))
20980 instantiate_class_member (tmp
, extern_p
);
20982 if (CLASSTYPE_NESTED_UTDS (t
))
20983 binding_table_foreach (CLASSTYPE_NESTED_UTDS (t
),
20984 bt_instantiate_type_proc
, &storage
);
20988 /* Given a function DECL, which is a specialization of TMPL, modify
20989 DECL to be a re-instantiation of TMPL with the same template
20990 arguments. TMPL should be the template into which tsubst'ing
20991 should occur for DECL, not the most general template.
20993 One reason for doing this is a scenario like this:
20996 void f(const T&, int i);
20998 void g() { f(3, 7); }
21001 void f(const T& t, const int i) { }
21003 Note that when the template is first instantiated, with
21004 instantiate_template, the resulting DECL will have no name for the
21005 first parameter, and the wrong type for the second. So, when we go
21006 to instantiate the DECL, we regenerate it. */
21009 regenerate_decl_from_template (tree decl
, tree tmpl
)
21011 /* The arguments used to instantiate DECL, from the most general
21016 args
= DECL_TI_ARGS (decl
);
21017 code_pattern
= DECL_TEMPLATE_RESULT (tmpl
);
21019 /* Make sure that we can see identifiers, and compute access
21021 push_access_scope (decl
);
21023 if (TREE_CODE (decl
) == FUNCTION_DECL
)
21031 args_depth
= TMPL_ARGS_DEPTH (args
);
21032 parms_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
21033 if (args_depth
> parms_depth
)
21034 args
= get_innermost_template_args (args
, parms_depth
);
21036 specs
= tsubst_exception_specification (TREE_TYPE (code_pattern
),
21037 args
, tf_error
, NULL_TREE
,
21038 /*defer_ok*/false);
21039 if (specs
&& specs
!= error_mark_node
)
21040 TREE_TYPE (decl
) = build_exception_variant (TREE_TYPE (decl
),
21043 /* Merge parameter declarations. */
21044 decl_parm
= skip_artificial_parms_for (decl
,
21045 DECL_ARGUMENTS (decl
));
21047 = skip_artificial_parms_for (code_pattern
,
21048 DECL_ARGUMENTS (code_pattern
));
21049 while (decl_parm
&& !DECL_PACK_P (pattern_parm
))
21054 if (DECL_NAME (decl_parm
) != DECL_NAME (pattern_parm
))
21055 DECL_NAME (decl_parm
) = DECL_NAME (pattern_parm
);
21056 parm_type
= tsubst (TREE_TYPE (pattern_parm
), args
, tf_error
,
21058 parm_type
= type_decays_to (parm_type
);
21059 if (!same_type_p (TREE_TYPE (decl_parm
), parm_type
))
21060 TREE_TYPE (decl_parm
) = parm_type
;
21061 attributes
= DECL_ATTRIBUTES (pattern_parm
);
21062 if (DECL_ATTRIBUTES (decl_parm
) != attributes
)
21064 DECL_ATTRIBUTES (decl_parm
) = attributes
;
21065 cplus_decl_attributes (&decl_parm
, attributes
, /*flags=*/0);
21067 decl_parm
= DECL_CHAIN (decl_parm
);
21068 pattern_parm
= DECL_CHAIN (pattern_parm
);
21070 /* Merge any parameters that match with the function parameter
21072 if (pattern_parm
&& DECL_PACK_P (pattern_parm
))
21075 tree expanded_types
;
21076 /* Expand the TYPE_PACK_EXPANSION that provides the types for
21077 the parameters in this function parameter pack. */
21078 expanded_types
= tsubst_pack_expansion (TREE_TYPE (pattern_parm
),
21079 args
, tf_error
, NULL_TREE
);
21080 len
= TREE_VEC_LENGTH (expanded_types
);
21081 for (i
= 0; i
< len
; i
++)
21086 if (DECL_NAME (decl_parm
) != DECL_NAME (pattern_parm
))
21087 /* Rename the parameter to include the index. */
21088 DECL_NAME (decl_parm
) =
21089 make_ith_pack_parameter_name (DECL_NAME (pattern_parm
), i
);
21090 parm_type
= TREE_VEC_ELT (expanded_types
, i
);
21091 parm_type
= type_decays_to (parm_type
);
21092 if (!same_type_p (TREE_TYPE (decl_parm
), parm_type
))
21093 TREE_TYPE (decl_parm
) = parm_type
;
21094 attributes
= DECL_ATTRIBUTES (pattern_parm
);
21095 if (DECL_ATTRIBUTES (decl_parm
) != attributes
)
21097 DECL_ATTRIBUTES (decl_parm
) = attributes
;
21098 cplus_decl_attributes (&decl_parm
, attributes
, /*flags=*/0);
21100 decl_parm
= DECL_CHAIN (decl_parm
);
21103 /* Merge additional specifiers from the CODE_PATTERN. */
21104 if (DECL_DECLARED_INLINE_P (code_pattern
)
21105 && !DECL_DECLARED_INLINE_P (decl
))
21106 DECL_DECLARED_INLINE_P (decl
) = 1;
21108 else if (VAR_P (decl
))
21110 DECL_INITIAL (decl
) =
21111 tsubst_expr (DECL_INITIAL (code_pattern
), args
,
21112 tf_error
, DECL_TI_TEMPLATE (decl
),
21113 /*integral_constant_expression_p=*/false);
21114 if (VAR_HAD_UNKNOWN_BOUND (decl
))
21115 TREE_TYPE (decl
) = tsubst (TREE_TYPE (code_pattern
), args
,
21116 tf_error
, DECL_TI_TEMPLATE (decl
));
21119 gcc_unreachable ();
21121 pop_access_scope (decl
);
21124 /* Return the TEMPLATE_DECL into which DECL_TI_ARGS(DECL) should be
21125 substituted to get DECL. */
21128 template_for_substitution (tree decl
)
21130 tree tmpl
= DECL_TI_TEMPLATE (decl
);
21132 /* Set TMPL to the template whose DECL_TEMPLATE_RESULT is the pattern
21133 for the instantiation. This is not always the most general
21134 template. Consider, for example:
21137 struct S { template <class U> void f();
21138 template <> void f<int>(); };
21140 and an instantiation of S<double>::f<int>. We want TD to be the
21141 specialization S<T>::f<int>, not the more general S<T>::f<U>. */
21142 while (/* An instantiation cannot have a definition, so we need a
21143 more general template. */
21144 DECL_TEMPLATE_INSTANTIATION (tmpl
)
21145 /* We must also deal with friend templates. Given:
21147 template <class T> struct S {
21148 template <class U> friend void f() {};
21151 S<int>::f<U> say, is not an instantiation of S<T>::f<U>,
21152 so far as the language is concerned, but that's still
21153 where we get the pattern for the instantiation from. On
21154 other hand, if the definition comes outside the class, say:
21156 template <class T> struct S {
21157 template <class U> friend void f();
21159 template <class U> friend void f() {}
21161 we don't need to look any further. That's what the check for
21162 DECL_INITIAL is for. */
21163 || (TREE_CODE (decl
) == FUNCTION_DECL
21164 && DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (tmpl
)
21165 && !DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl
))))
21167 /* The present template, TD, should not be a definition. If it
21168 were a definition, we should be using it! Note that we
21169 cannot restructure the loop to just keep going until we find
21170 a template with a definition, since that might go too far if
21171 a specialization was declared, but not defined. */
21173 /* Fetch the more general template. */
21174 tmpl
= DECL_TI_TEMPLATE (tmpl
);
21180 /* Returns true if we need to instantiate this template instance even if we
21181 know we aren't going to emit it. */
21184 always_instantiate_p (tree decl
)
21186 /* We always instantiate inline functions so that we can inline them. An
21187 explicit instantiation declaration prohibits implicit instantiation of
21188 non-inline functions. With high levels of optimization, we would
21189 normally inline non-inline functions -- but we're not allowed to do
21190 that for "extern template" functions. Therefore, we check
21191 DECL_DECLARED_INLINE_P, rather than possibly_inlined_p. */
21192 return ((TREE_CODE (decl
) == FUNCTION_DECL
21193 && (DECL_DECLARED_INLINE_P (decl
)
21194 || type_uses_auto (TREE_TYPE (TREE_TYPE (decl
)))))
21195 /* And we need to instantiate static data members so that
21196 their initializers are available in integral constant
21199 && decl_maybe_constant_var_p (decl
)));
21202 /* If FN has a noexcept-specifier that hasn't been instantiated yet,
21203 instantiate it now, modifying TREE_TYPE (fn). */
21206 maybe_instantiate_noexcept (tree fn
)
21208 tree fntype
, spec
, noex
, clone
;
21210 /* Don't instantiate a noexcept-specification from template context. */
21211 if (processing_template_decl
)
21214 if (DECL_CLONED_FUNCTION_P (fn
))
21215 fn
= DECL_CLONED_FUNCTION (fn
);
21216 fntype
= TREE_TYPE (fn
);
21217 spec
= TYPE_RAISES_EXCEPTIONS (fntype
);
21219 if (!spec
|| !TREE_PURPOSE (spec
))
21222 noex
= TREE_PURPOSE (spec
);
21224 if (TREE_CODE (noex
) == DEFERRED_NOEXCEPT
)
21226 if (DEFERRED_NOEXCEPT_PATTERN (noex
) == NULL_TREE
)
21227 spec
= get_defaulted_eh_spec (fn
);
21228 else if (push_tinst_level (fn
))
21230 push_access_scope (fn
);
21231 push_deferring_access_checks (dk_no_deferred
);
21232 input_location
= DECL_SOURCE_LOCATION (fn
);
21233 noex
= tsubst_copy_and_build (DEFERRED_NOEXCEPT_PATTERN (noex
),
21234 DEFERRED_NOEXCEPT_ARGS (noex
),
21235 tf_warning_or_error
, fn
,
21236 /*function_p=*/false,
21237 /*integral_constant_expression_p=*/true);
21238 pop_deferring_access_checks ();
21239 pop_access_scope (fn
);
21240 pop_tinst_level ();
21241 spec
= build_noexcept_spec (noex
, tf_warning_or_error
);
21242 if (spec
== error_mark_node
)
21243 spec
= noexcept_false_spec
;
21246 spec
= noexcept_false_spec
;
21248 TREE_TYPE (fn
) = build_exception_variant (fntype
, spec
);
21251 FOR_EACH_CLONE (clone
, fn
)
21253 if (TREE_TYPE (clone
) == fntype
)
21254 TREE_TYPE (clone
) = TREE_TYPE (fn
);
21256 TREE_TYPE (clone
) = build_exception_variant (TREE_TYPE (clone
), spec
);
21260 /* Produce the definition of D, a _DECL generated from a template. If
21261 DEFER_OK is nonzero, then we don't have to actually do the
21262 instantiation now; we just have to do it sometime. Normally it is
21263 an error if this is an explicit instantiation but D is undefined.
21264 EXPL_INST_CLASS_MEM_P is true iff D is a member of an
21265 explicitly instantiated class template. */
21268 instantiate_decl (tree d
, int defer_ok
,
21269 bool expl_inst_class_mem_p
)
21271 tree tmpl
= DECL_TI_TEMPLATE (d
);
21278 bool pattern_defined
;
21279 location_t saved_loc
= input_location
;
21280 int saved_unevaluated_operand
= cp_unevaluated_operand
;
21281 int saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
21285 bool nested
= false;
21287 /* This function should only be used to instantiate templates for
21288 functions and static member variables. */
21289 gcc_assert (VAR_OR_FUNCTION_DECL_P (d
));
21291 /* A concept is never instantiated. */
21292 gcc_assert (!DECL_DECLARED_CONCEPT_P (d
));
21294 /* Variables are never deferred; if instantiation is required, they
21295 are instantiated right away. That allows for better code in the
21296 case that an expression refers to the value of the variable --
21297 if the variable has a constant value the referring expression can
21298 take advantage of that fact. */
21300 || DECL_DECLARED_CONSTEXPR_P (d
))
21303 /* Don't instantiate cloned functions. Instead, instantiate the
21304 functions they cloned. */
21305 if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_CLONED_FUNCTION_P (d
))
21306 d
= DECL_CLONED_FUNCTION (d
);
21308 if (DECL_TEMPLATE_INSTANTIATED (d
)
21309 || (TREE_CODE (d
) == FUNCTION_DECL
21310 && DECL_DEFAULTED_FN (d
) && DECL_INITIAL (d
))
21311 || DECL_TEMPLATE_SPECIALIZATION (d
))
21312 /* D has already been instantiated or explicitly specialized, so
21313 there's nothing for us to do here.
21315 It might seem reasonable to check whether or not D is an explicit
21316 instantiation, and, if so, stop here. But when an explicit
21317 instantiation is deferred until the end of the compilation,
21318 DECL_EXPLICIT_INSTANTIATION is set, even though we still need to do
21319 the instantiation. */
21322 /* Check to see whether we know that this template will be
21323 instantiated in some other file, as with "extern template"
21325 external_p
= (DECL_INTERFACE_KNOWN (d
) && DECL_REALLY_EXTERN (d
));
21327 /* In general, we do not instantiate such templates. */
21328 if (external_p
&& !always_instantiate_p (d
))
21331 gen_tmpl
= most_general_template (tmpl
);
21332 gen_args
= DECL_TI_ARGS (d
);
21334 if (tmpl
!= gen_tmpl
)
21335 /* We should already have the extra args. */
21336 gcc_assert (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (gen_tmpl
))
21337 == TMPL_ARGS_DEPTH (gen_args
));
21338 /* And what's in the hash table should match D. */
21339 gcc_assert ((spec
= retrieve_specialization (gen_tmpl
, gen_args
, 0)) == d
21340 || spec
== NULL_TREE
);
21342 /* This needs to happen before any tsubsting. */
21343 if (! push_tinst_level (d
))
21346 timevar_push (TV_TEMPLATE_INST
);
21348 /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern
21349 for the instantiation. */
21350 td
= template_for_substitution (d
);
21351 code_pattern
= DECL_TEMPLATE_RESULT (td
);
21353 /* We should never be trying to instantiate a member of a class
21354 template or partial specialization. */
21355 gcc_assert (d
!= code_pattern
);
21357 if ((DECL_NAMESPACE_SCOPE_P (d
) && !DECL_INITIALIZED_IN_CLASS_P (d
))
21358 || DECL_TEMPLATE_SPECIALIZATION (td
))
21359 /* In the case of a friend template whose definition is provided
21360 outside the class, we may have too many arguments. Drop the
21361 ones we don't need. The same is true for specializations. */
21362 args
= get_innermost_template_args
21363 (gen_args
, TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (td
)));
21367 if (TREE_CODE (d
) == FUNCTION_DECL
)
21369 deleted_p
= DECL_DELETED_FN (code_pattern
);
21370 pattern_defined
= (DECL_SAVED_TREE (code_pattern
) != NULL_TREE
21371 || DECL_DEFAULTED_OUTSIDE_CLASS_P (code_pattern
)
21377 pattern_defined
= ! DECL_IN_AGGR_P (code_pattern
);
21380 /* We may be in the middle of deferred access check. Disable it now. */
21381 push_deferring_access_checks (dk_no_deferred
);
21383 /* Unless an explicit instantiation directive has already determined
21384 the linkage of D, remember that a definition is available for
21386 if (pattern_defined
21387 && !DECL_INTERFACE_KNOWN (d
)
21388 && !DECL_NOT_REALLY_EXTERN (d
))
21389 mark_definable (d
);
21391 DECL_SOURCE_LOCATION (td
) = DECL_SOURCE_LOCATION (code_pattern
);
21392 DECL_SOURCE_LOCATION (d
) = DECL_SOURCE_LOCATION (code_pattern
);
21393 input_location
= DECL_SOURCE_LOCATION (d
);
21395 /* If D is a member of an explicitly instantiated class template,
21396 and no definition is available, treat it like an implicit
21398 if (!pattern_defined
&& expl_inst_class_mem_p
21399 && DECL_EXPLICIT_INSTANTIATION (d
))
21401 /* Leave linkage flags alone on instantiations with anonymous
21403 if (TREE_PUBLIC (d
))
21405 DECL_NOT_REALLY_EXTERN (d
) = 0;
21406 DECL_INTERFACE_KNOWN (d
) = 0;
21408 SET_DECL_IMPLICIT_INSTANTIATION (d
);
21411 /* Defer all other templates, unless we have been explicitly
21412 forbidden from doing so. */
21413 if (/* If there is no definition, we cannot instantiate the
21416 /* If it's OK to postpone instantiation, do so. */
21418 /* If this is a static data member that will be defined
21419 elsewhere, we don't want to instantiate the entire data
21420 member, but we do want to instantiate the initializer so that
21421 we can substitute that elsewhere. */
21422 || (external_p
&& VAR_P (d
))
21423 /* Handle here a deleted function too, avoid generating
21424 its body (c++/61080). */
21427 /* The definition of the static data member is now required so
21428 we must substitute the initializer. */
21430 && !DECL_INITIAL (d
)
21431 && DECL_INITIAL (code_pattern
))
21435 bool const_init
= false;
21436 bool enter_context
= DECL_CLASS_SCOPE_P (d
);
21438 ns
= decl_namespace_context (d
);
21439 push_nested_namespace (ns
);
21441 push_nested_class (DECL_CONTEXT (d
));
21442 init
= tsubst_expr (DECL_INITIAL (code_pattern
),
21444 tf_warning_or_error
, NULL_TREE
,
21445 /*integral_constant_expression_p=*/false);
21446 /* If instantiating the initializer involved instantiating this
21447 again, don't call cp_finish_decl twice. */
21448 if (!DECL_INITIAL (d
))
21450 /* Make sure the initializer is still constant, in case of
21451 circular dependency (template/instantiate6.C). */
21453 = DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (code_pattern
);
21454 cp_finish_decl (d
, init
, /*init_const_expr_p=*/const_init
,
21455 /*asmspec_tree=*/NULL_TREE
,
21456 LOOKUP_ONLYCONVERTING
);
21459 pop_nested_class ();
21460 pop_nested_namespace (ns
);
21463 /* We restore the source position here because it's used by
21464 add_pending_template. */
21465 input_location
= saved_loc
;
21467 if (at_eof
&& !pattern_defined
21468 && DECL_EXPLICIT_INSTANTIATION (d
)
21469 && DECL_NOT_REALLY_EXTERN (d
))
21472 The definition of a non-exported function template, a
21473 non-exported member function template, or a non-exported
21474 member function or static data member of a class template
21475 shall be present in every translation unit in which it is
21476 explicitly instantiated. */
21477 permerror (input_location
, "explicit instantiation of %qD "
21478 "but no definition available", d
);
21480 /* If we're in unevaluated context, we just wanted to get the
21481 constant value; this isn't an odr use, so don't queue
21482 a full instantiation. */
21483 if (cp_unevaluated_operand
!= 0)
21485 /* ??? Historically, we have instantiated inline functions, even
21486 when marked as "extern template". */
21487 if (!(external_p
&& VAR_P (d
)))
21488 add_pending_template (d
);
21491 /* Tell the repository that D is available in this translation unit
21492 -- and see if it is supposed to be instantiated here. */
21493 if (TREE_PUBLIC (d
) && !DECL_REALLY_EXTERN (d
) && !repo_emit_p (d
))
21495 /* In a PCH file, despite the fact that the repository hasn't
21496 requested instantiation in the PCH it is still possible that
21497 an instantiation will be required in a file that includes the
21500 add_pending_template (d
);
21501 /* Instantiate inline functions so that the inliner can do its
21502 job, even though we'll not be emitting a copy of this
21504 if (!(TREE_CODE (d
) == FUNCTION_DECL
&& possibly_inlined_p (d
)))
21508 fn_context
= decl_function_context (d
);
21509 nested
= (current_function_decl
!= NULL_TREE
);
21510 vec
<tree
> omp_privatization_save
;
21512 save_omp_privatization_clauses (omp_privatization_save
);
21515 push_to_top_level ();
21519 push_function_context ();
21520 cp_unevaluated_operand
= 0;
21521 c_inhibit_evaluation_warnings
= 0;
21524 /* Mark D as instantiated so that recursive calls to
21525 instantiate_decl do not try to instantiate it again. */
21526 DECL_TEMPLATE_INSTANTIATED (d
) = 1;
21528 /* Regenerate the declaration in case the template has been modified
21529 by a subsequent redeclaration. */
21530 regenerate_decl_from_template (d
, td
);
21532 /* We already set the file and line above. Reset them now in case
21533 they changed as a result of calling regenerate_decl_from_template. */
21534 input_location
= DECL_SOURCE_LOCATION (d
);
21539 bool const_init
= false;
21541 /* Clear out DECL_RTL; whatever was there before may not be right
21542 since we've reset the type of the declaration. */
21543 SET_DECL_RTL (d
, NULL
);
21544 DECL_IN_AGGR_P (d
) = 0;
21546 /* The initializer is placed in DECL_INITIAL by
21547 regenerate_decl_from_template so we don't need to
21548 push/pop_access_scope again here. Pull it out so that
21549 cp_finish_decl can process it. */
21550 init
= DECL_INITIAL (d
);
21551 DECL_INITIAL (d
) = NULL_TREE
;
21552 DECL_INITIALIZED_P (d
) = 0;
21554 /* Clear DECL_EXTERNAL so that cp_finish_decl will process the
21555 initializer. That function will defer actual emission until
21556 we have a chance to determine linkage. */
21557 DECL_EXTERNAL (d
) = 0;
21559 /* Enter the scope of D so that access-checking works correctly. */
21560 bool enter_context
= DECL_CLASS_SCOPE_P (d
);
21562 push_nested_class (DECL_CONTEXT (d
));
21564 const_init
= DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (code_pattern
);
21565 cp_finish_decl (d
, init
, const_init
, NULL_TREE
, 0);
21568 pop_nested_class ();
21570 if (variable_template_p (td
))
21571 note_variable_template_instantiation (d
);
21573 else if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_DEFAULTED_FN (code_pattern
))
21574 synthesize_method (d
);
21575 else if (TREE_CODE (d
) == FUNCTION_DECL
)
21577 hash_map
<tree
, tree
> *saved_local_specializations
;
21581 tree block
= NULL_TREE
;
21583 /* Save away the current list, in case we are instantiating one
21584 template from within the body of another. */
21585 saved_local_specializations
= local_specializations
;
21587 /* Set up the list of local specializations. */
21588 local_specializations
= new hash_map
<tree
, tree
>;
21590 /* Set up context. */
21591 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
)
21592 && TREE_CODE (DECL_CONTEXT (code_pattern
)) == FUNCTION_DECL
)
21593 block
= push_stmt_list ();
21595 start_preparsed_function (d
, NULL_TREE
, SF_PRE_PARSED
);
21597 /* Some typedefs referenced from within the template code need to be
21598 access checked at template instantiation time, i.e now. These
21599 types were added to the template at parsing time. Let's get those
21600 and perform the access checks then. */
21601 perform_typedefs_access_check (DECL_TEMPLATE_RESULT (gen_tmpl
),
21604 /* Create substitution entries for the parameters. */
21605 subst_decl
= DECL_TEMPLATE_RESULT (template_for_substitution (d
));
21606 tmpl_parm
= DECL_ARGUMENTS (subst_decl
);
21607 spec_parm
= DECL_ARGUMENTS (d
);
21608 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (d
))
21610 register_local_specialization (spec_parm
, tmpl_parm
);
21611 spec_parm
= skip_artificial_parms_for (d
, spec_parm
);
21612 tmpl_parm
= skip_artificial_parms_for (subst_decl
, tmpl_parm
);
21614 for (; tmpl_parm
; tmpl_parm
= DECL_CHAIN (tmpl_parm
))
21616 if (!DECL_PACK_P (tmpl_parm
))
21618 register_local_specialization (spec_parm
, tmpl_parm
);
21619 spec_parm
= DECL_CHAIN (spec_parm
);
21623 /* Register the (value) argument pack as a specialization of
21624 TMPL_PARM, then move on. */
21625 tree argpack
= extract_fnparm_pack (tmpl_parm
, &spec_parm
);
21626 register_local_specialization (argpack
, tmpl_parm
);
21629 gcc_assert (!spec_parm
);
21631 /* Substitute into the body of the function. */
21632 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
))
21633 tsubst_omp_udr (DECL_SAVED_TREE (code_pattern
), args
,
21634 tf_warning_or_error
, tmpl
);
21637 tsubst_expr (DECL_SAVED_TREE (code_pattern
), args
,
21638 tf_warning_or_error
, tmpl
,
21639 /*integral_constant_expression_p=*/false);
21641 /* Set the current input_location to the end of the function
21642 so that finish_function knows where we are. */
21644 = DECL_STRUCT_FUNCTION (code_pattern
)->function_end_locus
;
21646 /* Remember if we saw an infinite loop in the template. */
21647 current_function_infinite_loop
21648 = DECL_STRUCT_FUNCTION (code_pattern
)->language
->infinite_loop
;
21651 /* We don't need the local specializations any more. */
21652 delete local_specializations
;
21653 local_specializations
= saved_local_specializations
;
21655 /* Finish the function. */
21656 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
)
21657 && TREE_CODE (DECL_CONTEXT (code_pattern
)) == FUNCTION_DECL
)
21658 DECL_SAVED_TREE (d
) = pop_stmt_list (block
);
21661 d
= finish_function (0);
21662 expand_or_defer_fn (d
);
21665 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
))
21666 cp_check_omp_declare_reduction (d
);
21669 /* We're not deferring instantiation any more. */
21670 TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (d
)) = 0;
21673 pop_from_top_level ();
21675 pop_function_context ();
21678 input_location
= saved_loc
;
21679 cp_unevaluated_operand
= saved_unevaluated_operand
;
21680 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
21681 pop_deferring_access_checks ();
21682 pop_tinst_level ();
21684 restore_omp_privatization_clauses (omp_privatization_save
);
21686 timevar_pop (TV_TEMPLATE_INST
);
21691 /* Run through the list of templates that we wish we could
21692 instantiate, and instantiate any we can. RETRIES is the
21693 number of times we retry pending template instantiation. */
21696 instantiate_pending_templates (int retries
)
21699 location_t saved_loc
= input_location
;
21701 /* Instantiating templates may trigger vtable generation. This in turn
21702 may require further template instantiations. We place a limit here
21703 to avoid infinite loop. */
21704 if (pending_templates
&& retries
>= max_tinst_depth
)
21706 tree decl
= pending_templates
->tinst
->decl
;
21708 fatal_error (input_location
,
21709 "template instantiation depth exceeds maximum of %d"
21710 " instantiating %q+D, possibly from virtual table generation"
21711 " (use -ftemplate-depth= to increase the maximum)",
21712 max_tinst_depth
, decl
);
21713 if (TREE_CODE (decl
) == FUNCTION_DECL
)
21714 /* Pretend that we defined it. */
21715 DECL_INITIAL (decl
) = error_mark_node
;
21721 struct pending_template
**t
= &pending_templates
;
21722 struct pending_template
*last
= NULL
;
21726 tree instantiation
= reopen_tinst_level ((*t
)->tinst
);
21727 bool complete
= false;
21729 if (TYPE_P (instantiation
))
21733 if (!COMPLETE_TYPE_P (instantiation
))
21735 instantiate_class_template (instantiation
);
21736 if (CLASSTYPE_TEMPLATE_INSTANTIATION (instantiation
))
21737 for (fn
= TYPE_METHODS (instantiation
);
21739 fn
= TREE_CHAIN (fn
))
21740 if (! DECL_ARTIFICIAL (fn
))
21741 instantiate_decl (fn
,
21743 /*expl_inst_class_mem_p=*/false);
21744 if (COMPLETE_TYPE_P (instantiation
))
21748 complete
= COMPLETE_TYPE_P (instantiation
);
21752 if (!DECL_TEMPLATE_SPECIALIZATION (instantiation
)
21753 && !DECL_TEMPLATE_INSTANTIATED (instantiation
))
21756 = instantiate_decl (instantiation
,
21758 /*expl_inst_class_mem_p=*/false);
21759 if (DECL_TEMPLATE_INSTANTIATED (instantiation
))
21763 complete
= (DECL_TEMPLATE_SPECIALIZATION (instantiation
)
21764 || DECL_TEMPLATE_INSTANTIATED (instantiation
));
21768 /* If INSTANTIATION has been instantiated, then we don't
21769 need to consider it again in the future. */
21777 current_tinst_level
= NULL
;
21779 last_pending_template
= last
;
21781 while (reconsider
);
21783 input_location
= saved_loc
;
21786 /* Substitute ARGVEC into T, which is a list of initializers for
21787 either base class or a non-static data member. The TREE_PURPOSEs
21788 are DECLs, and the TREE_VALUEs are the initializer values. Used by
21789 instantiate_decl. */
21792 tsubst_initializer_list (tree t
, tree argvec
)
21794 tree inits
= NULL_TREE
;
21796 for (; t
; t
= TREE_CHAIN (t
))
21800 tree expanded_bases
= NULL_TREE
;
21801 tree expanded_arguments
= NULL_TREE
;
21804 if (TREE_CODE (TREE_PURPOSE (t
)) == TYPE_PACK_EXPANSION
)
21809 /* Expand the base class expansion type into separate base
21811 expanded_bases
= tsubst_pack_expansion (TREE_PURPOSE (t
), argvec
,
21812 tf_warning_or_error
,
21814 if (expanded_bases
== error_mark_node
)
21817 /* We'll be building separate TREE_LISTs of arguments for
21819 len
= TREE_VEC_LENGTH (expanded_bases
);
21820 expanded_arguments
= make_tree_vec (len
);
21821 for (i
= 0; i
< len
; i
++)
21822 TREE_VEC_ELT (expanded_arguments
, i
) = NULL_TREE
;
21824 /* Build a dummy EXPR_PACK_EXPANSION that will be used to
21825 expand each argument in the TREE_VALUE of t. */
21826 expr
= make_node (EXPR_PACK_EXPANSION
);
21827 PACK_EXPANSION_LOCAL_P (expr
) = true;
21828 PACK_EXPANSION_PARAMETER_PACKS (expr
) =
21829 PACK_EXPANSION_PARAMETER_PACKS (TREE_PURPOSE (t
));
21831 if (TREE_VALUE (t
) == void_type_node
)
21832 /* VOID_TYPE_NODE is used to indicate
21833 value-initialization. */
21835 for (i
= 0; i
< len
; i
++)
21836 TREE_VEC_ELT (expanded_arguments
, i
) = void_type_node
;
21840 /* Substitute parameter packs into each argument in the
21842 in_base_initializer
= 1;
21843 for (arg
= TREE_VALUE (t
); arg
; arg
= TREE_CHAIN (arg
))
21845 tree expanded_exprs
;
21847 /* Expand the argument. */
21848 SET_PACK_EXPANSION_PATTERN (expr
, TREE_VALUE (arg
));
21850 = tsubst_pack_expansion (expr
, argvec
,
21851 tf_warning_or_error
,
21853 if (expanded_exprs
== error_mark_node
)
21856 /* Prepend each of the expanded expressions to the
21857 corresponding TREE_LIST in EXPANDED_ARGUMENTS. */
21858 for (i
= 0; i
< len
; i
++)
21860 TREE_VEC_ELT (expanded_arguments
, i
) =
21861 tree_cons (NULL_TREE
,
21862 TREE_VEC_ELT (expanded_exprs
, i
),
21863 TREE_VEC_ELT (expanded_arguments
, i
));
21866 in_base_initializer
= 0;
21868 /* Reverse all of the TREE_LISTs in EXPANDED_ARGUMENTS,
21869 since we built them backwards. */
21870 for (i
= 0; i
< len
; i
++)
21872 TREE_VEC_ELT (expanded_arguments
, i
) =
21873 nreverse (TREE_VEC_ELT (expanded_arguments
, i
));
21878 for (i
= 0; i
< len
; ++i
)
21880 if (expanded_bases
)
21882 decl
= TREE_VEC_ELT (expanded_bases
, i
);
21883 decl
= expand_member_init (decl
);
21884 init
= TREE_VEC_ELT (expanded_arguments
, i
);
21889 decl
= tsubst_copy (TREE_PURPOSE (t
), argvec
,
21890 tf_warning_or_error
, NULL_TREE
);
21892 decl
= expand_member_init (decl
);
21893 if (decl
&& !DECL_P (decl
))
21894 in_base_initializer
= 1;
21896 init
= TREE_VALUE (t
);
21898 if (init
!= void_type_node
)
21899 init
= tsubst_expr (init
, argvec
,
21900 tf_warning_or_error
, NULL_TREE
,
21901 /*integral_constant_expression_p=*/false);
21902 if (init
== NULL_TREE
&& tmp
!= NULL_TREE
)
21903 /* If we had an initializer but it instantiated to nothing,
21904 value-initialize the object. This will only occur when
21905 the initializer was a pack expansion where the parameter
21906 packs used in that expansion were of length zero. */
21907 init
= void_type_node
;
21908 in_base_initializer
= 0;
21913 init
= build_tree_list (decl
, init
);
21914 TREE_CHAIN (init
) = inits
;
21922 /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */
21925 set_current_access_from_decl (tree decl
)
21927 if (TREE_PRIVATE (decl
))
21928 current_access_specifier
= access_private_node
;
21929 else if (TREE_PROTECTED (decl
))
21930 current_access_specifier
= access_protected_node
;
21932 current_access_specifier
= access_public_node
;
21935 /* Instantiate an enumerated type. TAG is the template type, NEWTAG
21936 is the instantiation (which should have been created with
21937 start_enum) and ARGS are the template arguments to use. */
21940 tsubst_enum (tree tag
, tree newtag
, tree args
)
21944 if (SCOPED_ENUM_P (newtag
))
21945 begin_scope (sk_scoped_enum
, newtag
);
21947 for (e
= TYPE_VALUES (tag
); e
; e
= TREE_CHAIN (e
))
21952 decl
= TREE_VALUE (e
);
21953 /* Note that in a template enum, the TREE_VALUE is the
21954 CONST_DECL, not the corresponding INTEGER_CST. */
21955 value
= tsubst_expr (DECL_INITIAL (decl
),
21956 args
, tf_warning_or_error
, NULL_TREE
,
21957 /*integral_constant_expression_p=*/true);
21959 /* Give this enumeration constant the correct access. */
21960 set_current_access_from_decl (decl
);
21962 /* Actually build the enumerator itself. Here we're assuming that
21963 enumerators can't have dependent attributes. */
21964 build_enumerator (DECL_NAME (decl
), value
, newtag
,
21965 DECL_ATTRIBUTES (decl
), DECL_SOURCE_LOCATION (decl
));
21968 if (SCOPED_ENUM_P (newtag
))
21971 finish_enum_value_list (newtag
);
21972 finish_enum (newtag
);
21974 DECL_SOURCE_LOCATION (TYPE_NAME (newtag
))
21975 = DECL_SOURCE_LOCATION (TYPE_NAME (tag
));
21978 /* DECL is a FUNCTION_DECL that is a template specialization. Return
21979 its type -- but without substituting the innermost set of template
21980 arguments. So, innermost set of template parameters will appear in
21984 get_mostly_instantiated_function_type (tree decl
)
21986 /* For a function, DECL_TI_TEMPLATE is partially instantiated. */
21987 return TREE_TYPE (DECL_TI_TEMPLATE (decl
));
21990 /* Return truthvalue if we're processing a template different from
21991 the last one involved in diagnostics. */
21993 problematic_instantiation_changed (void)
21995 return current_tinst_level
!= last_error_tinst_level
;
21998 /* Remember current template involved in diagnostics. */
22000 record_last_problematic_instantiation (void)
22002 last_error_tinst_level
= current_tinst_level
;
22005 struct tinst_level
*
22006 current_instantiation (void)
22008 return current_tinst_level
;
22011 /* Return TRUE if current_function_decl is being instantiated, false
22015 instantiating_current_function_p (void)
22017 return (current_instantiation ()
22018 && current_instantiation ()->decl
== current_function_decl
);
22021 /* [temp.param] Check that template non-type parm TYPE is of an allowable
22022 type. Return zero for ok, nonzero for disallowed. Issue error and
22023 warning messages under control of COMPLAIN. */
22026 invalid_nontype_parm_type_p (tree type
, tsubst_flags_t complain
)
22028 if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
22030 else if (POINTER_TYPE_P (type
))
22032 else if (TYPE_PTRMEM_P (type
))
22034 else if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
)
22036 else if (TREE_CODE (type
) == TYPENAME_TYPE
)
22038 else if (TREE_CODE (type
) == DECLTYPE_TYPE
)
22040 else if (TREE_CODE (type
) == NULLPTR_TYPE
)
22042 /* A bound template template parm could later be instantiated to have a valid
22043 nontype parm type via an alias template. */
22044 else if (cxx_dialect
>= cxx11
22045 && TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
22048 if (complain
& tf_error
)
22050 if (type
== error_mark_node
)
22051 inform (input_location
, "invalid template non-type parameter");
22053 error ("%q#T is not a valid type for a template non-type parameter",
22059 /* Returns TRUE if TYPE is dependent, in the sense of [temp.dep.type].
22060 Assumes that TYPE really is a type, and not the ERROR_MARK_NODE.*/
22063 dependent_type_p_r (tree type
)
22069 A type is dependent if it is:
22071 -- a template parameter. Template template parameters are types
22072 for us (since TYPE_P holds true for them) so we handle
22074 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
22075 || TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
)
22077 /* -- a qualified-id with a nested-name-specifier which contains a
22078 class-name that names a dependent type or whose unqualified-id
22079 names a dependent type. */
22080 if (TREE_CODE (type
) == TYPENAME_TYPE
)
22083 /* An alias template specialization can be dependent even if the
22084 resulting type is not. */
22085 if (dependent_alias_template_spec_p (type
))
22088 /* -- a cv-qualified type where the cv-unqualified type is
22090 No code is necessary for this bullet; the code below handles
22091 cv-qualified types, and we don't want to strip aliases with
22092 TYPE_MAIN_VARIANT because of DR 1558. */
22093 /* -- a compound type constructed from any dependent type. */
22094 if (TYPE_PTRMEM_P (type
))
22095 return (dependent_type_p (TYPE_PTRMEM_CLASS_TYPE (type
))
22096 || dependent_type_p (TYPE_PTRMEM_POINTED_TO_TYPE
22098 else if (TYPE_PTR_P (type
)
22099 || TREE_CODE (type
) == REFERENCE_TYPE
)
22100 return dependent_type_p (TREE_TYPE (type
));
22101 else if (TREE_CODE (type
) == FUNCTION_TYPE
22102 || TREE_CODE (type
) == METHOD_TYPE
)
22106 if (dependent_type_p (TREE_TYPE (type
)))
22108 for (arg_type
= TYPE_ARG_TYPES (type
);
22110 arg_type
= TREE_CHAIN (arg_type
))
22111 if (dependent_type_p (TREE_VALUE (arg_type
)))
22115 /* -- an array type constructed from any dependent type or whose
22116 size is specified by a constant expression that is
22119 We checked for type- and value-dependence of the bounds in
22120 compute_array_index_type, so TYPE_DEPENDENT_P is already set. */
22121 if (TREE_CODE (type
) == ARRAY_TYPE
)
22123 if (TYPE_DOMAIN (type
)
22124 && dependent_type_p (TYPE_DOMAIN (type
)))
22126 return dependent_type_p (TREE_TYPE (type
));
22129 /* -- a template-id in which either the template name is a template
22131 if (TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
22133 /* ... or any of the template arguments is a dependent type or
22134 an expression that is type-dependent or value-dependent. */
22135 else if (CLASS_TYPE_P (type
) && CLASSTYPE_TEMPLATE_INFO (type
)
22136 && (any_dependent_template_arguments_p
22137 (INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type
)))))
22140 /* All TYPEOF_TYPEs, DECLTYPE_TYPEs, and UNDERLYING_TYPEs are
22141 dependent; if the argument of the `typeof' expression is not
22142 type-dependent, then it should already been have resolved. */
22143 if (TREE_CODE (type
) == TYPEOF_TYPE
22144 || TREE_CODE (type
) == DECLTYPE_TYPE
22145 || TREE_CODE (type
) == UNDERLYING_TYPE
)
22148 /* A template argument pack is dependent if any of its packed
22150 if (TREE_CODE (type
) == TYPE_ARGUMENT_PACK
)
22152 tree args
= ARGUMENT_PACK_ARGS (type
);
22153 int i
, len
= TREE_VEC_LENGTH (args
);
22154 for (i
= 0; i
< len
; ++i
)
22155 if (dependent_template_arg_p (TREE_VEC_ELT (args
, i
)))
22159 /* All TYPE_PACK_EXPANSIONs are dependent, because parameter packs must
22160 be template parameters. */
22161 if (TREE_CODE (type
) == TYPE_PACK_EXPANSION
)
22164 /* The standard does not specifically mention types that are local
22165 to template functions or local classes, but they should be
22166 considered dependent too. For example:
22168 template <int I> void f() {
22173 The size of `E' cannot be known until the value of `I' has been
22174 determined. Therefore, `E' must be considered dependent. */
22175 scope
= TYPE_CONTEXT (type
);
22176 if (scope
&& TYPE_P (scope
))
22177 return dependent_type_p (scope
);
22178 /* Don't use type_dependent_expression_p here, as it can lead
22179 to infinite recursion trying to determine whether a lambda
22180 nested in a lambda is dependent (c++/47687). */
22181 else if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
22182 && DECL_LANG_SPECIFIC (scope
)
22183 && DECL_TEMPLATE_INFO (scope
)
22184 && (any_dependent_template_arguments_p
22185 (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (scope
)))))
22188 /* Other types are non-dependent. */
22192 /* Returns TRUE if TYPE is dependent, in the sense of
22193 [temp.dep.type]. Note that a NULL type is considered dependent. */
22196 dependent_type_p (tree type
)
22198 /* If there are no template parameters in scope, then there can't be
22199 any dependent types. */
22200 if (!processing_template_decl
)
22202 /* If we are not processing a template, then nobody should be
22203 providing us with a dependent type. */
22205 gcc_assert (TREE_CODE (type
) != TEMPLATE_TYPE_PARM
|| is_auto (type
));
22209 /* If the type is NULL, we have not computed a type for the entity
22210 in question; in that case, the type is dependent. */
22214 /* Erroneous types can be considered non-dependent. */
22215 if (type
== error_mark_node
)
22218 /* If we have not already computed the appropriate value for TYPE,
22220 if (!TYPE_DEPENDENT_P_VALID (type
))
22222 TYPE_DEPENDENT_P (type
) = dependent_type_p_r (type
);
22223 TYPE_DEPENDENT_P_VALID (type
) = 1;
22226 return TYPE_DEPENDENT_P (type
);
22229 /* Returns TRUE if SCOPE is a dependent scope, in which we can't do any
22230 lookup. In other words, a dependent type that is not the current
22234 dependent_scope_p (tree scope
)
22236 return (scope
&& TYPE_P (scope
) && dependent_type_p (scope
)
22237 && !currently_open_class (scope
));
22240 /* T is a SCOPE_REF; return whether we need to consider it
22241 instantiation-dependent so that we can check access at instantiation
22242 time even though we know which member it resolves to. */
22245 instantiation_dependent_scope_ref_p (tree t
)
22247 if (DECL_P (TREE_OPERAND (t
, 1))
22248 && CLASS_TYPE_P (TREE_OPERAND (t
, 0))
22249 && accessible_in_template_p (TREE_OPERAND (t
, 0),
22250 TREE_OPERAND (t
, 1)))
22256 /* Returns TRUE if the EXPRESSION is value-dependent, in the sense of
22257 [temp.dep.constexpr]. EXPRESSION is already known to be a constant
22260 /* Note that this predicate is not appropriate for general expressions;
22261 only constant expressions (that satisfy potential_constant_expression)
22262 can be tested for value dependence. */
22265 value_dependent_expression_p (tree expression
)
22267 if (!processing_template_decl
)
22270 /* A name declared with a dependent type. */
22271 if (DECL_P (expression
) && type_dependent_expression_p (expression
))
22274 switch (TREE_CODE (expression
))
22276 case IDENTIFIER_NODE
:
22277 /* A name that has not been looked up -- must be dependent. */
22280 case TEMPLATE_PARM_INDEX
:
22281 /* A non-type template parm. */
22285 /* A non-type template parm. */
22286 if (DECL_TEMPLATE_PARM_P (expression
))
22288 return value_dependent_expression_p (DECL_INITIAL (expression
));
22291 /* A constant with literal type and is initialized
22292 with an expression that is value-dependent.
22294 Note that a non-dependent parenthesized initializer will have
22295 already been replaced with its constant value, so if we see
22296 a TREE_LIST it must be dependent. */
22297 if (DECL_INITIAL (expression
)
22298 && decl_constant_var_p (expression
)
22299 && (TREE_CODE (DECL_INITIAL (expression
)) == TREE_LIST
22300 /* cp_finish_decl doesn't fold reference initializers. */
22301 || TREE_CODE (TREE_TYPE (expression
)) == REFERENCE_TYPE
22302 || value_dependent_expression_p (DECL_INITIAL (expression
))))
22306 case DYNAMIC_CAST_EXPR
:
22307 case STATIC_CAST_EXPR
:
22308 case CONST_CAST_EXPR
:
22309 case REINTERPRET_CAST_EXPR
:
22311 /* These expressions are value-dependent if the type to which
22312 the cast occurs is dependent or the expression being casted
22313 is value-dependent. */
22315 tree type
= TREE_TYPE (expression
);
22317 if (dependent_type_p (type
))
22320 /* A functional cast has a list of operands. */
22321 expression
= TREE_OPERAND (expression
, 0);
22324 /* If there are no operands, it must be an expression such
22325 as "int()". This should not happen for aggregate types
22326 because it would form non-constant expressions. */
22327 gcc_assert (cxx_dialect
>= cxx11
22328 || INTEGRAL_OR_ENUMERATION_TYPE_P (type
));
22333 if (TREE_CODE (expression
) == TREE_LIST
)
22334 return any_value_dependent_elements_p (expression
);
22336 return value_dependent_expression_p (expression
);
22340 if (SIZEOF_EXPR_TYPE_P (expression
))
22341 return dependent_type_p (TREE_TYPE (TREE_OPERAND (expression
, 0)));
22345 /* A `sizeof' expression is value-dependent if the operand is
22346 type-dependent or is a pack expansion. */
22347 expression
= TREE_OPERAND (expression
, 0);
22348 if (PACK_EXPANSION_P (expression
))
22350 else if (TYPE_P (expression
))
22351 return dependent_type_p (expression
);
22352 return instantiation_dependent_expression_p (expression
);
22354 case AT_ENCODE_EXPR
:
22355 /* An 'encode' expression is value-dependent if the operand is
22357 expression
= TREE_OPERAND (expression
, 0);
22358 return dependent_type_p (expression
);
22360 case NOEXCEPT_EXPR
:
22361 expression
= TREE_OPERAND (expression
, 0);
22362 return instantiation_dependent_expression_p (expression
);
22365 /* All instantiation-dependent expressions should also be considered
22366 value-dependent. */
22367 return instantiation_dependent_scope_ref_p (expression
);
22369 case COMPONENT_REF
:
22370 return (value_dependent_expression_p (TREE_OPERAND (expression
, 0))
22371 || value_dependent_expression_p (TREE_OPERAND (expression
, 1)));
22373 case NONTYPE_ARGUMENT_PACK
:
22374 /* A NONTYPE_ARGUMENT_PACK is value-dependent if any packed argument
22375 is value-dependent. */
22377 tree values
= ARGUMENT_PACK_ARGS (expression
);
22378 int i
, len
= TREE_VEC_LENGTH (values
);
22380 for (i
= 0; i
< len
; ++i
)
22381 if (value_dependent_expression_p (TREE_VEC_ELT (values
, i
)))
22389 tree type2
= TRAIT_EXPR_TYPE2 (expression
);
22390 return (dependent_type_p (TRAIT_EXPR_TYPE1 (expression
))
22391 || (type2
? dependent_type_p (type2
) : false));
22395 return ((value_dependent_expression_p (TREE_OPERAND (expression
, 0)))
22396 || (value_dependent_expression_p (TREE_OPERAND (expression
, 2))));
22399 return ((value_dependent_expression_p (TREE_OPERAND (expression
, 0)))
22400 || (value_dependent_expression_p (TREE_OPERAND (expression
, 1))));
22404 tree op
= TREE_OPERAND (expression
, 0);
22405 return (value_dependent_expression_p (op
)
22406 || has_value_dependent_address (op
));
22409 case REQUIRES_EXPR
:
22410 /* Treat all requires-expressions as value-dependent so
22411 we don't try to fold them. */
22415 return dependent_type_p (TREE_OPERAND (expression
, 0));
22419 tree fn
= get_callee_fndecl (expression
);
22421 if (!fn
&& value_dependent_expression_p (CALL_EXPR_FN (expression
)))
22423 nargs
= call_expr_nargs (expression
);
22424 for (i
= 0; i
< nargs
; ++i
)
22426 tree op
= CALL_EXPR_ARG (expression
, i
);
22427 /* In a call to a constexpr member function, look through the
22428 implicit ADDR_EXPR on the object argument so that it doesn't
22429 cause the call to be considered value-dependent. We also
22430 look through it in potential_constant_expression. */
22431 if (i
== 0 && fn
&& DECL_DECLARED_CONSTEXPR_P (fn
)
22432 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
22433 && TREE_CODE (op
) == ADDR_EXPR
)
22434 op
= TREE_OPERAND (op
, 0);
22435 if (value_dependent_expression_p (op
))
22441 case TEMPLATE_ID_EXPR
:
22442 /* If a TEMPLATE_ID_EXPR involves a dependent name, it will be
22444 return type_dependent_expression_p (expression
)
22445 || variable_concept_p (TREE_OPERAND (expression
, 0));
22451 if (dependent_type_p (TREE_TYPE (expression
)))
22453 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expression
), ix
, val
)
22454 if (value_dependent_expression_p (val
))
22460 /* Treat a GNU statement expression as dependent to avoid crashing
22461 under instantiate_non_dependent_expr; it can't be constant. */
22465 /* A constant expression is value-dependent if any subexpression is
22466 value-dependent. */
22467 switch (TREE_CODE_CLASS (TREE_CODE (expression
)))
22469 case tcc_reference
:
22471 case tcc_comparison
:
22473 case tcc_expression
:
22476 int i
, len
= cp_tree_operand_length (expression
);
22478 for (i
= 0; i
< len
; i
++)
22480 tree t
= TREE_OPERAND (expression
, i
);
22482 /* In some cases, some of the operands may be missing.l
22483 (For example, in the case of PREDECREMENT_EXPR, the
22484 amount to increment by may be missing.) That doesn't
22485 make the expression dependent. */
22486 if (t
&& value_dependent_expression_p (t
))
22497 /* The expression is not value-dependent. */
22501 /* Returns TRUE if the EXPRESSION is type-dependent, in the sense of
22502 [temp.dep.expr]. Note that an expression with no type is
22503 considered dependent. Other parts of the compiler arrange for an
22504 expression with type-dependent subexpressions to have no type, so
22505 this function doesn't have to be fully recursive. */
22508 type_dependent_expression_p (tree expression
)
22510 if (!processing_template_decl
)
22513 if (expression
== NULL_TREE
|| expression
== error_mark_node
)
22516 /* An unresolved name is always dependent. */
22517 if (identifier_p (expression
)
22518 || TREE_CODE (expression
) == USING_DECL
22519 || TREE_CODE (expression
) == WILDCARD_DECL
)
22522 /* A fold expression is type-dependent. */
22523 if (TREE_CODE (expression
) == UNARY_LEFT_FOLD_EXPR
22524 || TREE_CODE (expression
) == UNARY_RIGHT_FOLD_EXPR
22525 || TREE_CODE (expression
) == BINARY_LEFT_FOLD_EXPR
22526 || TREE_CODE (expression
) == BINARY_RIGHT_FOLD_EXPR
)
22529 /* Some expression forms are never type-dependent. */
22530 if (TREE_CODE (expression
) == PSEUDO_DTOR_EXPR
22531 || TREE_CODE (expression
) == SIZEOF_EXPR
22532 || TREE_CODE (expression
) == ALIGNOF_EXPR
22533 || TREE_CODE (expression
) == AT_ENCODE_EXPR
22534 || TREE_CODE (expression
) == NOEXCEPT_EXPR
22535 || TREE_CODE (expression
) == TRAIT_EXPR
22536 || TREE_CODE (expression
) == TYPEID_EXPR
22537 || TREE_CODE (expression
) == DELETE_EXPR
22538 || TREE_CODE (expression
) == VEC_DELETE_EXPR
22539 || TREE_CODE (expression
) == THROW_EXPR
22540 || TREE_CODE (expression
) == REQUIRES_EXPR
)
22543 /* The types of these expressions depends only on the type to which
22544 the cast occurs. */
22545 if (TREE_CODE (expression
) == DYNAMIC_CAST_EXPR
22546 || TREE_CODE (expression
) == STATIC_CAST_EXPR
22547 || TREE_CODE (expression
) == CONST_CAST_EXPR
22548 || TREE_CODE (expression
) == REINTERPRET_CAST_EXPR
22549 || TREE_CODE (expression
) == IMPLICIT_CONV_EXPR
22550 || TREE_CODE (expression
) == CAST_EXPR
)
22551 return dependent_type_p (TREE_TYPE (expression
));
22553 /* The types of these expressions depends only on the type created
22554 by the expression. */
22555 if (TREE_CODE (expression
) == NEW_EXPR
22556 || TREE_CODE (expression
) == VEC_NEW_EXPR
)
22558 /* For NEW_EXPR tree nodes created inside a template, either
22559 the object type itself or a TREE_LIST may appear as the
22561 tree type
= TREE_OPERAND (expression
, 1);
22562 if (TREE_CODE (type
) == TREE_LIST
)
22563 /* This is an array type. We need to check array dimensions
22565 return dependent_type_p (TREE_VALUE (TREE_PURPOSE (type
)))
22566 || value_dependent_expression_p
22567 (TREE_OPERAND (TREE_VALUE (type
), 1));
22569 return dependent_type_p (type
);
22572 if (TREE_CODE (expression
) == SCOPE_REF
)
22574 tree scope
= TREE_OPERAND (expression
, 0);
22575 tree name
= TREE_OPERAND (expression
, 1);
22577 /* 14.6.2.2 [temp.dep.expr]: An id-expression is type-dependent if it
22578 contains an identifier associated by name lookup with one or more
22579 declarations declared with a dependent type, or...a
22580 nested-name-specifier or qualified-id that names a member of an
22581 unknown specialization. */
22582 return (type_dependent_expression_p (name
)
22583 || dependent_scope_p (scope
));
22586 if (TREE_CODE (expression
) == FUNCTION_DECL
22587 && DECL_LANG_SPECIFIC (expression
)
22588 && DECL_TEMPLATE_INFO (expression
)
22589 && (any_dependent_template_arguments_p
22590 (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (expression
)))))
22593 if (TREE_CODE (expression
) == TEMPLATE_DECL
22594 && !DECL_TEMPLATE_TEMPLATE_PARM_P (expression
))
22597 if (TREE_CODE (expression
) == STMT_EXPR
)
22598 expression
= stmt_expr_value_expr (expression
);
22600 if (BRACE_ENCLOSED_INITIALIZER_P (expression
))
22605 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expression
), i
, elt
)
22607 if (type_dependent_expression_p (elt
))
22613 /* A static data member of the current instantiation with incomplete
22614 array type is type-dependent, as the definition and specializations
22615 can have different bounds. */
22616 if (VAR_P (expression
)
22617 && DECL_CLASS_SCOPE_P (expression
)
22618 && dependent_type_p (DECL_CONTEXT (expression
))
22619 && VAR_HAD_UNKNOWN_BOUND (expression
))
22622 /* An array of unknown bound depending on a variadic parameter, eg:
22624 template<typename... Args>
22625 void foo (Args... args)
22627 int arr[] = { args... };
22630 template<int... vals>
22633 int arr[] = { vals... };
22636 If the array has no length and has an initializer, it must be that
22637 we couldn't determine its length in cp_complete_array_type because
22638 it is dependent. */
22639 if (VAR_P (expression
)
22640 && TREE_CODE (TREE_TYPE (expression
)) == ARRAY_TYPE
22641 && !TYPE_DOMAIN (TREE_TYPE (expression
))
22642 && DECL_INITIAL (expression
))
22645 /* A variable template specialization is type-dependent if it has any
22646 dependent template arguments. */
22647 if (VAR_P (expression
)
22648 && DECL_LANG_SPECIFIC (expression
)
22649 && DECL_TEMPLATE_INFO (expression
)
22650 && variable_template_p (DECL_TI_TEMPLATE (expression
)))
22651 return any_dependent_template_arguments_p (DECL_TI_ARGS (expression
));
22653 /* Always dependent, on the number of arguments if nothing else. */
22654 if (TREE_CODE (expression
) == EXPR_PACK_EXPANSION
)
22657 if (TREE_TYPE (expression
) == unknown_type_node
)
22659 if (TREE_CODE (expression
) == ADDR_EXPR
)
22660 return type_dependent_expression_p (TREE_OPERAND (expression
, 0));
22661 if (TREE_CODE (expression
) == COMPONENT_REF
22662 || TREE_CODE (expression
) == OFFSET_REF
)
22664 if (type_dependent_expression_p (TREE_OPERAND (expression
, 0)))
22666 expression
= TREE_OPERAND (expression
, 1);
22667 if (identifier_p (expression
))
22670 /* SCOPE_REF with non-null TREE_TYPE is always non-dependent. */
22671 if (TREE_CODE (expression
) == SCOPE_REF
)
22674 if (BASELINK_P (expression
))
22676 if (BASELINK_OPTYPE (expression
)
22677 && dependent_type_p (BASELINK_OPTYPE (expression
)))
22679 expression
= BASELINK_FUNCTIONS (expression
);
22682 if (TREE_CODE (expression
) == TEMPLATE_ID_EXPR
)
22684 if (any_dependent_template_arguments_p
22685 (TREE_OPERAND (expression
, 1)))
22687 expression
= TREE_OPERAND (expression
, 0);
22688 if (identifier_p (expression
))
22692 gcc_assert (TREE_CODE (expression
) == OVERLOAD
22693 || TREE_CODE (expression
) == FUNCTION_DECL
);
22697 if (type_dependent_expression_p (OVL_CURRENT (expression
)))
22699 expression
= OVL_NEXT (expression
);
22704 gcc_assert (TREE_CODE (expression
) != TYPE_DECL
);
22706 return (dependent_type_p (TREE_TYPE (expression
)));
22709 /* walk_tree callback function for instantiation_dependent_expression_p,
22710 below. Returns non-zero if a dependent subexpression is found. */
22713 instantiation_dependent_r (tree
*tp
, int *walk_subtrees
,
22718 /* We don't have to worry about decltype currently because decltype
22719 of an instantiation-dependent expr is a dependent type. This
22720 might change depending on the resolution of DR 1172. */
22721 *walk_subtrees
= false;
22724 enum tree_code code
= TREE_CODE (*tp
);
22727 /* Don't treat an argument list as dependent just because it has no
22735 /* A constant with a dependent initializer is dependent. */
22736 if (value_dependent_expression_p (*tp
))
22740 case TEMPLATE_PARM_INDEX
:
22743 /* Handle expressions with type operands. */
22747 case AT_ENCODE_EXPR
:
22749 tree op
= TREE_OPERAND (*tp
, 0);
22750 if (code
== SIZEOF_EXPR
&& SIZEOF_EXPR_TYPE_P (*tp
))
22751 op
= TREE_TYPE (op
);
22754 if (dependent_type_p (op
))
22758 *walk_subtrees
= false;
22766 if (value_dependent_expression_p (*tp
))
22768 *walk_subtrees
= false;
22771 case COMPONENT_REF
:
22772 if (identifier_p (TREE_OPERAND (*tp
, 1)))
22773 /* In a template, finish_class_member_access_expr creates a
22774 COMPONENT_REF with an IDENTIFIER_NODE for op1 even if it isn't
22775 type-dependent, so that we can check access control at
22776 instantiation time (PR 42277). See also Core issue 1273. */
22781 if (instantiation_dependent_scope_ref_p (*tp
))
22786 /* Treat statement-expressions as dependent. */
22790 /* Treat requires-expressions as dependent. */
22791 case REQUIRES_EXPR
:
22795 /* Treat calls to function concepts as dependent. */
22796 if (function_concept_check_p (*tp
))
22800 case TEMPLATE_ID_EXPR
:
22801 /* And variable concepts. */
22802 if (variable_concept_p (TREE_OPERAND (*tp
, 0)))
22810 if (type_dependent_expression_p (*tp
))
22816 /* Returns TRUE if the EXPRESSION is instantiation-dependent, in the
22817 sense defined by the ABI:
22819 "An expression is instantiation-dependent if it is type-dependent
22820 or value-dependent, or it has a subexpression that is type-dependent
22821 or value-dependent." */
22824 instantiation_dependent_expression_p (tree expression
)
22828 if (!processing_template_decl
)
22831 if (expression
== error_mark_node
)
22834 result
= cp_walk_tree_without_duplicates (&expression
,
22835 instantiation_dependent_r
, NULL
);
22836 return result
!= NULL_TREE
;
22839 /* Like type_dependent_expression_p, but it also works while not processing
22840 a template definition, i.e. during substitution or mangling. */
22843 type_dependent_expression_p_push (tree expr
)
22846 ++processing_template_decl
;
22847 b
= type_dependent_expression_p (expr
);
22848 --processing_template_decl
;
22852 /* Returns TRUE if ARGS contains a type-dependent expression. */
22855 any_type_dependent_arguments_p (const vec
<tree
, va_gc
> *args
)
22860 FOR_EACH_VEC_SAFE_ELT (args
, i
, arg
)
22862 if (type_dependent_expression_p (arg
))
22868 /* Returns TRUE if LIST (a TREE_LIST whose TREE_VALUEs are
22869 expressions) contains any type-dependent expressions. */
22872 any_type_dependent_elements_p (const_tree list
)
22874 for (; list
; list
= TREE_CHAIN (list
))
22875 if (type_dependent_expression_p (TREE_VALUE (list
)))
22881 /* Returns TRUE if LIST (a TREE_LIST whose TREE_VALUEs are
22882 expressions) contains any value-dependent expressions. */
22885 any_value_dependent_elements_p (const_tree list
)
22887 for (; list
; list
= TREE_CHAIN (list
))
22888 if (value_dependent_expression_p (TREE_VALUE (list
)))
22894 /* Returns TRUE if the ARG (a template argument) is dependent. */
22897 dependent_template_arg_p (tree arg
)
22899 if (!processing_template_decl
)
22902 /* Assume a template argument that was wrongly written by the user
22903 is dependent. This is consistent with what
22904 any_dependent_template_arguments_p [that calls this function]
22906 if (!arg
|| arg
== error_mark_node
)
22909 if (TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
22910 arg
= ARGUMENT_PACK_SELECT_ARG (arg
);
22912 if (TREE_CODE (arg
) == TEMPLATE_DECL
22913 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
22914 return dependent_template_p (arg
);
22915 else if (ARGUMENT_PACK_P (arg
))
22917 tree args
= ARGUMENT_PACK_ARGS (arg
);
22918 int i
, len
= TREE_VEC_LENGTH (args
);
22919 for (i
= 0; i
< len
; ++i
)
22921 if (dependent_template_arg_p (TREE_VEC_ELT (args
, i
)))
22927 else if (TYPE_P (arg
))
22928 return dependent_type_p (arg
);
22930 return (type_dependent_expression_p (arg
)
22931 || value_dependent_expression_p (arg
));
22934 /* Returns true if ARGS (a collection of template arguments) contains
22935 any types that require structural equality testing. */
22938 any_template_arguments_need_structural_equality_p (tree args
)
22945 if (args
== error_mark_node
)
22948 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
22950 tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
22951 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
22953 tree arg
= TREE_VEC_ELT (level
, j
);
22954 tree packed_args
= NULL_TREE
;
22957 if (ARGUMENT_PACK_P (arg
))
22959 /* Look inside the argument pack. */
22960 packed_args
= ARGUMENT_PACK_ARGS (arg
);
22961 len
= TREE_VEC_LENGTH (packed_args
);
22964 for (k
= 0; k
< len
; ++k
)
22967 arg
= TREE_VEC_ELT (packed_args
, k
);
22969 if (error_operand_p (arg
))
22971 else if (TREE_CODE (arg
) == TEMPLATE_DECL
)
22973 else if (TYPE_P (arg
) && TYPE_STRUCTURAL_EQUALITY_P (arg
))
22975 else if (!TYPE_P (arg
) && TREE_TYPE (arg
)
22976 && TYPE_STRUCTURAL_EQUALITY_P (TREE_TYPE (arg
)))
22985 /* Returns true if ARGS (a collection of template arguments) contains
22986 any dependent arguments. */
22989 any_dependent_template_arguments_p (const_tree args
)
22996 if (args
== error_mark_node
)
22999 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
23001 const_tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
23002 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
23003 if (dependent_template_arg_p (TREE_VEC_ELT (level
, j
)))
23010 /* Returns TRUE if the template TMPL is dependent. */
23013 dependent_template_p (tree tmpl
)
23015 if (TREE_CODE (tmpl
) == OVERLOAD
)
23019 if (dependent_template_p (OVL_CURRENT (tmpl
)))
23021 tmpl
= OVL_NEXT (tmpl
);
23026 /* Template template parameters are dependent. */
23027 if (DECL_TEMPLATE_TEMPLATE_PARM_P (tmpl
)
23028 || TREE_CODE (tmpl
) == TEMPLATE_TEMPLATE_PARM
)
23030 /* So are names that have not been looked up. */
23031 if (TREE_CODE (tmpl
) == SCOPE_REF
|| identifier_p (tmpl
))
23033 /* So are member templates of dependent classes. */
23034 if (TYPE_P (CP_DECL_CONTEXT (tmpl
)))
23035 return dependent_type_p (DECL_CONTEXT (tmpl
));
23039 /* Returns TRUE if the specialization TMPL<ARGS> is dependent. */
23042 dependent_template_id_p (tree tmpl
, tree args
)
23044 return (dependent_template_p (tmpl
)
23045 || any_dependent_template_arguments_p (args
));
23048 /* Returns TRUE if OMP_FOR with DECLV, INITV, CONDV and INCRV vectors
23052 dependent_omp_for_p (tree declv
, tree initv
, tree condv
, tree incrv
)
23056 if (!processing_template_decl
)
23059 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
23061 tree decl
= TREE_VEC_ELT (declv
, i
);
23062 tree init
= TREE_VEC_ELT (initv
, i
);
23063 tree cond
= TREE_VEC_ELT (condv
, i
);
23064 tree incr
= TREE_VEC_ELT (incrv
, i
);
23066 if (type_dependent_expression_p (decl
)
23067 || TREE_CODE (decl
) == SCOPE_REF
)
23070 if (init
&& type_dependent_expression_p (init
))
23073 if (type_dependent_expression_p (cond
))
23076 if (COMPARISON_CLASS_P (cond
)
23077 && (type_dependent_expression_p (TREE_OPERAND (cond
, 0))
23078 || type_dependent_expression_p (TREE_OPERAND (cond
, 1))))
23081 if (TREE_CODE (incr
) == MODOP_EXPR
)
23083 if (type_dependent_expression_p (TREE_OPERAND (incr
, 0))
23084 || type_dependent_expression_p (TREE_OPERAND (incr
, 2)))
23087 else if (type_dependent_expression_p (incr
))
23089 else if (TREE_CODE (incr
) == MODIFY_EXPR
)
23091 if (type_dependent_expression_p (TREE_OPERAND (incr
, 0)))
23093 else if (BINARY_CLASS_P (TREE_OPERAND (incr
, 1)))
23095 tree t
= TREE_OPERAND (incr
, 1);
23096 if (type_dependent_expression_p (TREE_OPERAND (t
, 0))
23097 || type_dependent_expression_p (TREE_OPERAND (t
, 1)))
23106 /* TYPE is a TYPENAME_TYPE. Returns the ordinary TYPE to which the
23107 TYPENAME_TYPE corresponds. Returns the original TYPENAME_TYPE if
23108 no such TYPE can be found. Note that this function peers inside
23109 uninstantiated templates and therefore should be used only in
23110 extremely limited situations. ONLY_CURRENT_P restricts this
23111 peering to the currently open classes hierarchy (which is required
23112 when comparing types). */
23115 resolve_typename_type (tree type
, bool only_current_p
)
23124 gcc_assert (TREE_CODE (type
) == TYPENAME_TYPE
);
23126 scope
= TYPE_CONTEXT (type
);
23127 /* Usually the non-qualified identifier of a TYPENAME_TYPE is
23128 TYPE_IDENTIFIER (type). But when 'type' is a typedef variant of
23129 a TYPENAME_TYPE node, then TYPE_NAME (type) is set to the TYPE_DECL representing
23130 the typedef. In that case TYPE_IDENTIFIER (type) is not the non-qualified
23131 identifier of the TYPENAME_TYPE anymore.
23132 So by getting the TYPE_IDENTIFIER of the _main declaration_ of the
23133 TYPENAME_TYPE instead, we avoid messing up with a possible
23134 typedef variant case. */
23135 name
= TYPE_IDENTIFIER (TYPE_MAIN_VARIANT (type
));
23137 /* If the SCOPE is itself a TYPENAME_TYPE, then we need to resolve
23138 it first before we can figure out what NAME refers to. */
23139 if (TREE_CODE (scope
) == TYPENAME_TYPE
)
23141 if (TYPENAME_IS_RESOLVING_P (scope
))
23142 /* Given a class template A with a dependent base with nested type C,
23143 typedef typename A::C::C C will land us here, as trying to resolve
23144 the initial A::C leads to the local C typedef, which leads back to
23145 A::C::C. So we break the recursion now. */
23148 scope
= resolve_typename_type (scope
, only_current_p
);
23150 /* If we don't know what SCOPE refers to, then we cannot resolve the
23152 if (TREE_CODE (scope
) == TYPENAME_TYPE
)
23154 /* If the SCOPE is a template type parameter, we have no way of
23155 resolving the name. */
23156 if (TREE_CODE (scope
) == TEMPLATE_TYPE_PARM
)
23158 /* If the SCOPE is not the current instantiation, there's no reason
23159 to look inside it. */
23160 if (only_current_p
&& !currently_open_class (scope
))
23162 /* If this is a typedef, we don't want to look inside (c++/11987). */
23163 if (typedef_variant_p (type
))
23165 /* If SCOPE isn't the template itself, it will not have a valid
23166 TYPE_FIELDS list. */
23167 if (CLASS_TYPE_P (scope
)
23168 && same_type_p (scope
, CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope
)))
23169 /* scope is either the template itself or a compatible instantiation
23170 like X<T>, so look up the name in the original template. */
23171 scope
= CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope
);
23173 /* scope is a partial instantiation, so we can't do the lookup or we
23174 will lose the template arguments. */
23176 /* Enter the SCOPE so that name lookup will be resolved as if we
23177 were in the class definition. In particular, SCOPE will no
23178 longer be considered a dependent type. */
23179 pushed_scope
= push_scope (scope
);
23180 /* Look up the declaration. */
23181 decl
= lookup_member (scope
, name
, /*protect=*/0, /*want_type=*/true,
23182 tf_warning_or_error
);
23184 result
= NULL_TREE
;
23186 /* For a TYPENAME_TYPE like "typename X::template Y<T>", we want to
23187 find a TEMPLATE_DECL. Otherwise, we want to find a TYPE_DECL. */
23190 else if (identifier_p (TYPENAME_TYPE_FULLNAME (type
))
23191 && TREE_CODE (decl
) == TYPE_DECL
)
23193 result
= TREE_TYPE (decl
);
23194 if (result
== error_mark_node
)
23195 result
= NULL_TREE
;
23197 else if (TREE_CODE (TYPENAME_TYPE_FULLNAME (type
)) == TEMPLATE_ID_EXPR
23198 && DECL_CLASS_TEMPLATE_P (decl
))
23202 /* Obtain the template and the arguments. */
23203 tmpl
= TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type
), 0);
23204 args
= TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type
), 1);
23205 /* Instantiate the template. */
23206 result
= lookup_template_class (tmpl
, args
, NULL_TREE
, NULL_TREE
,
23207 /*entering_scope=*/0,
23208 tf_error
| tf_user
);
23209 if (result
== error_mark_node
)
23210 result
= NULL_TREE
;
23213 /* Leave the SCOPE. */
23215 pop_scope (pushed_scope
);
23217 /* If we failed to resolve it, return the original typename. */
23221 /* If lookup found a typename type, resolve that too. */
23222 if (TREE_CODE (result
) == TYPENAME_TYPE
&& !TYPENAME_IS_RESOLVING_P (result
))
23224 /* Ill-formed programs can cause infinite recursion here, so we
23225 must catch that. */
23226 TYPENAME_IS_RESOLVING_P (type
) = 1;
23227 result
= resolve_typename_type (result
, only_current_p
);
23228 TYPENAME_IS_RESOLVING_P (type
) = 0;
23231 /* Qualify the resulting type. */
23232 quals
= cp_type_quals (type
);
23234 result
= cp_build_qualified_type (result
, cp_type_quals (result
) | quals
);
23239 /* EXPR is an expression which is not type-dependent. Return a proxy
23240 for EXPR that can be used to compute the types of larger
23241 expressions containing EXPR. */
23244 build_non_dependent_expr (tree expr
)
23248 /* Try to get a constant value for all non-dependent expressions in
23249 order to expose bugs in *_dependent_expression_p and constexpr. */
23250 if (flag_checking
&& cxx_dialect
>= cxx11
)
23251 fold_non_dependent_expr (expr
);
23253 /* Preserve OVERLOADs; the functions must be available to resolve
23256 if (TREE_CODE (inner_expr
) == STMT_EXPR
)
23257 inner_expr
= stmt_expr_value_expr (inner_expr
);
23258 if (TREE_CODE (inner_expr
) == ADDR_EXPR
)
23259 inner_expr
= TREE_OPERAND (inner_expr
, 0);
23260 if (TREE_CODE (inner_expr
) == COMPONENT_REF
)
23261 inner_expr
= TREE_OPERAND (inner_expr
, 1);
23262 if (is_overloaded_fn (inner_expr
)
23263 || TREE_CODE (inner_expr
) == OFFSET_REF
)
23265 /* There is no need to return a proxy for a variable. */
23268 /* Preserve string constants; conversions from string constants to
23269 "char *" are allowed, even though normally a "const char *"
23270 cannot be used to initialize a "char *". */
23271 if (TREE_CODE (expr
) == STRING_CST
)
23273 /* Preserve void and arithmetic constants, as an optimization -- there is no
23274 reason to create a new node. */
23275 if (TREE_CODE (expr
) == VOID_CST
23276 || TREE_CODE (expr
) == INTEGER_CST
23277 || TREE_CODE (expr
) == REAL_CST
)
23279 /* Preserve THROW_EXPRs -- all throw-expressions have type "void".
23280 There is at least one place where we want to know that a
23281 particular expression is a throw-expression: when checking a ?:
23282 expression, there are special rules if the second or third
23283 argument is a throw-expression. */
23284 if (TREE_CODE (expr
) == THROW_EXPR
)
23287 /* Don't wrap an initializer list, we need to be able to look inside. */
23288 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
23291 /* Don't wrap a dummy object, we need to be able to test for it. */
23292 if (is_dummy_object (expr
))
23295 if (TREE_CODE (expr
) == COND_EXPR
)
23296 return build3 (COND_EXPR
,
23298 TREE_OPERAND (expr
, 0),
23299 (TREE_OPERAND (expr
, 1)
23300 ? build_non_dependent_expr (TREE_OPERAND (expr
, 1))
23301 : build_non_dependent_expr (TREE_OPERAND (expr
, 0))),
23302 build_non_dependent_expr (TREE_OPERAND (expr
, 2)));
23303 if (TREE_CODE (expr
) == COMPOUND_EXPR
23304 && !COMPOUND_EXPR_OVERLOADED (expr
))
23305 return build2 (COMPOUND_EXPR
,
23307 TREE_OPERAND (expr
, 0),
23308 build_non_dependent_expr (TREE_OPERAND (expr
, 1)));
23310 /* If the type is unknown, it can't really be non-dependent */
23311 gcc_assert (TREE_TYPE (expr
) != unknown_type_node
);
23313 /* Otherwise, build a NON_DEPENDENT_EXPR. */
23314 return build1 (NON_DEPENDENT_EXPR
, TREE_TYPE (expr
), expr
);
23317 /* ARGS is a vector of expressions as arguments to a function call.
23318 Replace the arguments with equivalent non-dependent expressions.
23319 This modifies ARGS in place. */
23322 make_args_non_dependent (vec
<tree
, va_gc
> *args
)
23327 FOR_EACH_VEC_SAFE_ELT (args
, ix
, arg
)
23329 tree newarg
= build_non_dependent_expr (arg
);
23331 (*args
)[ix
] = newarg
;
23335 /* Returns a type which represents 'auto' or 'decltype(auto)'. We use a
23336 TEMPLATE_TYPE_PARM with a level one deeper than the actual template
23340 make_auto_1 (tree name
)
23342 tree au
= cxx_make_type (TEMPLATE_TYPE_PARM
);
23343 TYPE_NAME (au
) = build_decl (input_location
,
23344 TYPE_DECL
, name
, au
);
23345 TYPE_STUB_DECL (au
) = TYPE_NAME (au
);
23346 TEMPLATE_TYPE_PARM_INDEX (au
) = build_template_parm_index
23347 (0, processing_template_decl
+ 1, processing_template_decl
+ 1,
23348 TYPE_NAME (au
), NULL_TREE
);
23349 TYPE_CANONICAL (au
) = canonical_type_parameter (au
);
23350 DECL_ARTIFICIAL (TYPE_NAME (au
)) = 1;
23351 SET_DECL_TEMPLATE_PARM_P (TYPE_NAME (au
));
23357 make_decltype_auto (void)
23359 return make_auto_1 (get_identifier ("decltype(auto)"));
23365 return make_auto_1 (get_identifier ("auto"));
23368 /* Given type ARG, return std::initializer_list<ARG>. */
23373 tree std_init_list
= namespace_binding
23374 (get_identifier ("initializer_list"), std_node
);
23376 if (!std_init_list
|| !DECL_CLASS_TEMPLATE_P (std_init_list
))
23378 error ("deducing from brace-enclosed initializer list requires "
23379 "#include <initializer_list>");
23380 return error_mark_node
;
23382 argvec
= make_tree_vec (1);
23383 TREE_VEC_ELT (argvec
, 0) = arg
;
23384 return lookup_template_class (std_init_list
, argvec
, NULL_TREE
,
23385 NULL_TREE
, 0, tf_warning_or_error
);
23388 /* Replace auto in TYPE with std::initializer_list<auto>. */
23391 listify_autos (tree type
, tree auto_node
)
23393 tree init_auto
= listify (auto_node
);
23394 tree argvec
= make_tree_vec (1);
23395 TREE_VEC_ELT (argvec
, 0) = init_auto
;
23396 if (processing_template_decl
)
23397 argvec
= add_to_template_args (current_template_args (), argvec
);
23398 return tsubst (type
, argvec
, tf_warning_or_error
, NULL_TREE
);
23401 /* Hash traits for hashing possibly constrained 'auto'
23402 TEMPLATE_TYPE_PARMs for use by do_auto_deduction. */
23404 struct auto_hash
: default_hash_traits
<tree
>
23406 static inline hashval_t
hash (tree
);
23407 static inline bool equal (tree
, tree
);
23410 /* Hash the 'auto' T. */
23413 auto_hash::hash (tree t
)
23415 if (tree c
= PLACEHOLDER_TYPE_CONSTRAINTS (t
))
23416 /* Matching constrained-type-specifiers denote the same template
23417 parameter, so hash the constraint. */
23418 return hash_placeholder_constraint (c
);
23420 /* But unconstrained autos are all separate, so just hash the pointer. */
23421 return iterative_hash_object (t
, 0);
23424 /* Compare two 'auto's. */
23427 auto_hash::equal (tree t1
, tree t2
)
23432 tree c1
= PLACEHOLDER_TYPE_CONSTRAINTS (t1
);
23433 tree c2
= PLACEHOLDER_TYPE_CONSTRAINTS (t2
);
23435 /* Two unconstrained autos are distinct. */
23439 return equivalent_placeholder_constraints (c1
, c2
);
23442 /* for_each_template_parm callback for extract_autos: if t is a (possibly
23443 constrained) auto, add it to the vector. */
23446 extract_autos_r (tree t
, void *data
)
23448 hash_table
<auto_hash
> &hash
= *(hash_table
<auto_hash
>*)data
;
23449 if (is_auto_or_concept (t
))
23451 /* All the autos were built with index 0; fix that up now. */
23452 tree
*p
= hash
.find_slot (t
, INSERT
);
23455 /* If this is a repeated constrained-type-specifier, use the index we
23457 idx
= TEMPLATE_PARM_IDX (TEMPLATE_TYPE_PARM_INDEX (*p
));
23460 /* Otherwise this is new, so use the current count. */
23462 idx
= hash
.elements () - 1;
23464 TEMPLATE_PARM_IDX (TEMPLATE_TYPE_PARM_INDEX (t
)) = idx
;
23467 /* Always keep walking. */
23471 /* Return a TREE_VEC of the 'auto's used in type under the Concepts TS, which
23472 says they can appear anywhere in the type. */
23475 extract_autos (tree type
)
23477 hash_set
<tree
> visited
;
23478 hash_table
<auto_hash
> hash (2);
23480 for_each_template_parm (type
, extract_autos_r
, &hash
, &visited
, true);
23482 tree tree_vec
= make_tree_vec (hash
.elements());
23483 for (hash_table
<auto_hash
>::iterator iter
= hash
.begin();
23484 iter
!= hash
.end(); ++iter
)
23487 unsigned i
= TEMPLATE_PARM_IDX (TEMPLATE_TYPE_PARM_INDEX (elt
));
23488 TREE_VEC_ELT (tree_vec
, i
)
23489 = build_tree_list (NULL_TREE
, TYPE_NAME (elt
));
23495 /* Replace occurrences of 'auto' in TYPE with the appropriate type deduced
23496 from INIT. AUTO_NODE is the TEMPLATE_TYPE_PARM used for 'auto' in TYPE. */
23499 do_auto_deduction (tree type
, tree init
, tree auto_node
)
23501 return do_auto_deduction (type
, init
, auto_node
,
23502 tf_warning_or_error
,
23506 /* Replace occurrences of 'auto' in TYPE with the appropriate type deduced
23507 from INIT. AUTO_NODE is the TEMPLATE_TYPE_PARM used for 'auto' in TYPE.
23508 The CONTEXT determines the context in which auto deduction is performed
23509 and is used to control error diagnostics. */
23512 do_auto_deduction (tree type
, tree init
, tree auto_node
,
23513 tsubst_flags_t complain
, auto_deduction_context context
)
23517 if (init
== error_mark_node
)
23518 return error_mark_node
;
23520 if (type_dependent_expression_p (init
))
23521 /* Defining a subset of type-dependent expressions that we can deduce
23522 from ahead of time isn't worth the trouble. */
23525 /* [dcl.spec.auto]: Obtain P from T by replacing the occurrences of auto
23526 with either a new invented type template parameter U or, if the
23527 initializer is a braced-init-list (8.5.4), with
23528 std::initializer_list<U>. */
23529 if (BRACE_ENCLOSED_INITIALIZER_P (init
))
23531 if (!DIRECT_LIST_INIT_P (init
))
23532 type
= listify_autos (type
, auto_node
);
23533 else if (CONSTRUCTOR_NELTS (init
) == 1)
23534 init
= CONSTRUCTOR_ELT (init
, 0)->value
;
23537 if (complain
& tf_warning_or_error
)
23539 if (permerror (input_location
, "direct-list-initialization of "
23540 "%<auto%> requires exactly one element"))
23541 inform (input_location
,
23542 "for deduction to %<std::initializer_list%>, use copy-"
23543 "list-initialization (i.e. add %<=%> before the %<{%>)");
23545 type
= listify_autos (type
, auto_node
);
23549 init
= resolve_nondeduced_context (init
);
23551 if (AUTO_IS_DECLTYPE (auto_node
))
23553 bool id
= (DECL_P (init
) || (TREE_CODE (init
) == COMPONENT_REF
23554 && !REF_PARENTHESIZED_P (init
)));
23555 targs
= make_tree_vec (1);
23556 TREE_VEC_ELT (targs
, 0)
23557 = finish_decltype_type (init
, id
, tf_warning_or_error
);
23558 if (type
!= auto_node
)
23560 if (complain
& tf_error
)
23561 error ("%qT as type rather than plain %<decltype(auto)%>", type
);
23562 return error_mark_node
;
23567 tree parms
= build_tree_list (NULL_TREE
, type
);
23571 tparms
= extract_autos (type
);
23574 tparms
= make_tree_vec (1);
23575 TREE_VEC_ELT (tparms
, 0)
23576 = build_tree_list (NULL_TREE
, TYPE_NAME (auto_node
));
23579 targs
= make_tree_vec (TREE_VEC_LENGTH (tparms
));
23580 int val
= type_unification_real (tparms
, targs
, parms
, &init
, 1, 0,
23581 DEDUCE_CALL
, LOOKUP_NORMAL
,
23582 NULL
, /*explain_p=*/false);
23585 if (processing_template_decl
)
23586 /* Try again at instantiation time. */
23588 if (type
&& type
!= error_mark_node
23589 && (complain
& tf_error
))
23590 /* If type is error_mark_node a diagnostic must have been
23591 emitted by now. Also, having a mention to '<type error>'
23592 in the diagnostic is not really useful to the user. */
23594 if (cfun
&& auto_node
== current_function_auto_return_pattern
23595 && LAMBDA_FUNCTION_P (current_function_decl
))
23596 error ("unable to deduce lambda return type from %qE", init
);
23598 error ("unable to deduce %qT from %qE", type
, init
);
23599 type_unification_real (tparms
, targs
, parms
, &init
, 1, 0,
23600 DEDUCE_CALL
, LOOKUP_NORMAL
,
23601 NULL
, /*explain_p=*/true);
23603 return error_mark_node
;
23607 /* If the list of declarators contains more than one declarator, the type
23608 of each declared variable is determined as described above. If the
23609 type deduced for the template parameter U is not the same in each
23610 deduction, the program is ill-formed. */
23611 if (!flag_concepts
&& TREE_TYPE (auto_node
)
23612 && !same_type_p (TREE_TYPE (auto_node
), TREE_VEC_ELT (targs
, 0)))
23614 if (cfun
&& auto_node
== current_function_auto_return_pattern
23615 && LAMBDA_FUNCTION_P (current_function_decl
))
23616 error ("inconsistent types %qT and %qT deduced for "
23617 "lambda return type", TREE_TYPE (auto_node
),
23618 TREE_VEC_ELT (targs
, 0));
23620 error ("inconsistent deduction for %qT: %qT and then %qT",
23621 auto_node
, TREE_TYPE (auto_node
), TREE_VEC_ELT (targs
, 0));
23622 return error_mark_node
;
23624 if (!flag_concepts
)
23625 TREE_TYPE (auto_node
) = TREE_VEC_ELT (targs
, 0);
23627 /* Check any placeholder constraints against the deduced type. */
23628 if (flag_concepts
&& !processing_template_decl
)
23629 if (tree constr
= PLACEHOLDER_TYPE_CONSTRAINTS (auto_node
))
23631 /* Use the deduced type to check the associated constraints. */
23632 if (!constraints_satisfied_p (constr
, targs
))
23634 if (complain
& tf_warning_or_error
)
23638 case adc_unspecified
:
23639 error("placeholder constraints not satisfied");
23641 case adc_variable_type
:
23642 error ("deduced initializer does not satisfy "
23643 "placeholder constraints");
23645 case adc_return_type
:
23646 error ("deduced return type does not satisfy "
23647 "placeholder constraints");
23649 case adc_requirement
:
23650 error ("deduced expression type does not saatisy "
23651 "placeholder constraints");
23654 diagnose_constraints (input_location
, constr
, targs
);
23656 return error_mark_node
;
23660 if (processing_template_decl
)
23661 targs
= add_to_template_args (current_template_args (), targs
);
23662 return tsubst (type
, targs
, complain
, NULL_TREE
);
23665 /* Substitutes LATE_RETURN_TYPE for 'auto' in TYPE and returns the
23669 splice_late_return_type (tree type
, tree late_return_type
)
23671 if (is_auto (type
))
23673 if (late_return_type
)
23674 return late_return_type
;
23676 tree idx
= get_template_parm_index (type
);
23677 if (TEMPLATE_PARM_LEVEL (idx
) <= processing_template_decl
)
23678 /* In an abbreviated function template we didn't know we were dealing
23679 with a function template when we saw the auto return type, so update
23680 it to have the correct level. */
23681 return make_auto_1 (TYPE_IDENTIFIER (type
));
23686 /* Returns true iff TYPE is a TEMPLATE_TYPE_PARM representing 'auto' or
23687 'decltype(auto)'. */
23690 is_auto (const_tree type
)
23692 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
23693 && (TYPE_IDENTIFIER (type
) == get_identifier ("auto")
23694 || TYPE_IDENTIFIER (type
) == get_identifier ("decltype(auto)")))
23700 /* for_each_template_parm callback for type_uses_auto. */
23703 is_auto_r (tree tp
, void */
*data*/
)
23705 return is_auto_or_concept (tp
);
23708 /* Returns the TEMPLATE_TYPE_PARM in TYPE representing `auto' iff TYPE contains
23709 a use of `auto'. Returns NULL_TREE otherwise. */
23712 type_uses_auto (tree type
)
23716 /* The Concepts TS allows multiple autos in one type-specifier; just
23717 return the first one we find, do_auto_deduction will collect all of
23719 if (uses_template_parms (type
))
23720 return for_each_template_parm (type
, is_auto_r
, /*data*/NULL
,
23721 /*visited*/NULL
, /*nondeduced*/true);
23726 return find_type_usage (type
, is_auto
);
23729 /* Returns true iff TYPE is a TEMPLATE_TYPE_PARM representing 'auto',
23730 'decltype(auto)' or a concept. */
23733 is_auto_or_concept (const_tree type
)
23735 return is_auto (type
); // or concept
23738 /* Returns the TEMPLATE_TYPE_PARM in TYPE representing a generic type (`auto' or
23739 a concept identifier) iff TYPE contains a use of a generic type. Returns
23740 NULL_TREE otherwise. */
23743 type_uses_auto_or_concept (tree type
)
23745 return find_type_usage (type
, is_auto_or_concept
);
23749 /* For a given template T, return the vector of typedefs referenced
23750 in T for which access check is needed at T instantiation time.
23751 T is either a FUNCTION_DECL or a RECORD_TYPE.
23752 Those typedefs were added to T by the function
23753 append_type_to_template_for_access_check. */
23755 vec
<qualified_typedef_usage_t
, va_gc
> *
23756 get_types_needing_access_check (tree t
)
23759 vec
<qualified_typedef_usage_t
, va_gc
> *result
= NULL
;
23761 if (!t
|| t
== error_mark_node
)
23764 if (!(ti
= get_template_info (t
)))
23767 if (CLASS_TYPE_P (t
)
23768 || TREE_CODE (t
) == FUNCTION_DECL
)
23770 if (!TI_TEMPLATE (ti
))
23773 result
= TI_TYPEDEFS_NEEDING_ACCESS_CHECKING (ti
);
23779 /* Append the typedef TYPE_DECL used in template T to a list of typedefs
23780 tied to T. That list of typedefs will be access checked at
23781 T instantiation time.
23782 T is either a FUNCTION_DECL or a RECORD_TYPE.
23783 TYPE_DECL is a TYPE_DECL node representing a typedef.
23784 SCOPE is the scope through which TYPE_DECL is accessed.
23785 LOCATION is the location of the usage point of TYPE_DECL.
23787 This function is a subroutine of
23788 append_type_to_template_for_access_check. */
23791 append_type_to_template_for_access_check_1 (tree t
,
23794 location_t location
)
23796 qualified_typedef_usage_t typedef_usage
;
23799 if (!t
|| t
== error_mark_node
)
23802 gcc_assert ((TREE_CODE (t
) == FUNCTION_DECL
23803 || CLASS_TYPE_P (t
))
23805 && TREE_CODE (type_decl
) == TYPE_DECL
23808 if (!(ti
= get_template_info (t
)))
23811 gcc_assert (TI_TEMPLATE (ti
));
23813 typedef_usage
.typedef_decl
= type_decl
;
23814 typedef_usage
.context
= scope
;
23815 typedef_usage
.locus
= location
;
23817 vec_safe_push (TI_TYPEDEFS_NEEDING_ACCESS_CHECKING (ti
), typedef_usage
);
23820 /* Append TYPE_DECL to the template TEMPL.
23821 TEMPL is either a class type, a FUNCTION_DECL or a a TEMPLATE_DECL.
23822 At TEMPL instanciation time, TYPE_DECL will be checked to see
23823 if it can be accessed through SCOPE.
23824 LOCATION is the location of the usage point of TYPE_DECL.
23826 e.g. consider the following code snippet:
23833 template<class U> struct S
23835 C::myint mi; // <-- usage point of the typedef C::myint
23840 At S<char> instantiation time, we need to check the access of C::myint
23841 In other words, we need to check the access of the myint typedef through
23842 the C scope. For that purpose, this function will add the myint typedef
23843 and the scope C through which its being accessed to a list of typedefs
23844 tied to the template S. That list will be walked at template instantiation
23845 time and access check performed on each typedefs it contains.
23846 Note that this particular code snippet should yield an error because
23847 myint is private to C. */
23850 append_type_to_template_for_access_check (tree templ
,
23853 location_t location
)
23855 qualified_typedef_usage_t
*iter
;
23858 gcc_assert (type_decl
&& (TREE_CODE (type_decl
) == TYPE_DECL
));
23860 /* Make sure we don't append the type to the template twice. */
23861 FOR_EACH_VEC_SAFE_ELT (get_types_needing_access_check (templ
), i
, iter
)
23862 if (iter
->typedef_decl
== type_decl
&& scope
== iter
->context
)
23865 append_type_to_template_for_access_check_1 (templ
, type_decl
,
23869 /* Convert the generic type parameters in PARM that match the types given in the
23870 range [START_IDX, END_IDX) from the current_template_parms into generic type
23874 convert_generic_types_to_packs (tree parm
, int start_idx
, int end_idx
)
23876 tree current
= current_template_parms
;
23877 int depth
= TMPL_PARMS_DEPTH (current
);
23878 current
= INNERMOST_TEMPLATE_PARMS (current
);
23879 tree replacement
= make_tree_vec (TREE_VEC_LENGTH (current
));
23881 for (int i
= 0; i
< start_idx
; ++i
)
23882 TREE_VEC_ELT (replacement
, i
)
23883 = TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (current
, i
)));
23885 for (int i
= start_idx
; i
< end_idx
; ++i
)
23887 /* Create a distinct parameter pack type from the current parm and add it
23888 to the replacement args to tsubst below into the generic function
23891 tree o
= TREE_TYPE (TREE_VALUE
23892 (TREE_VEC_ELT (current
, i
)));
23893 tree t
= copy_type (o
);
23894 TEMPLATE_TYPE_PARM_INDEX (t
)
23895 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (o
),
23897 TREE_TYPE (TEMPLATE_TYPE_DECL (t
)) = t
;
23898 TYPE_STUB_DECL (t
) = TYPE_NAME (t
) = TEMPLATE_TYPE_DECL (t
);
23899 TYPE_MAIN_VARIANT (t
) = t
;
23900 TEMPLATE_TYPE_PARAMETER_PACK (t
) = true;
23901 TYPE_CANONICAL (t
) = canonical_type_parameter (t
);
23902 TREE_VEC_ELT (replacement
, i
) = t
;
23903 TREE_VALUE (TREE_VEC_ELT (current
, i
)) = TREE_CHAIN (t
);
23906 for (int i
= end_idx
, e
= TREE_VEC_LENGTH (current
); i
< e
; ++i
)
23907 TREE_VEC_ELT (replacement
, i
)
23908 = TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (current
, i
)));
23910 /* If there are more levels then build up the replacement with the outer
23913 replacement
= add_to_template_args (template_parms_to_args
23914 (TREE_CHAIN (current_template_parms
)),
23917 return tsubst (parm
, replacement
, tf_none
, NULL_TREE
);
23920 /* Entries in the decl_constraint hash table. */
23921 struct GTY((for_user
)) constr_entry
23927 /* Hashing function and equality for constraint entries. */
23928 struct constr_hasher
: ggc_ptr_hash
<constr_entry
>
23930 static hashval_t
hash (constr_entry
*e
)
23932 return (hashval_t
)DECL_UID (e
->decl
);
23935 static bool equal (constr_entry
*e1
, constr_entry
*e2
)
23937 return e1
->decl
== e2
->decl
;
23941 /* A mapping from declarations to constraint information. Note that
23942 both templates and their underlying declarations are mapped to the
23943 same constraint information.
23945 FIXME: This is defined in pt.c because garbage collection
23946 code is not being generated for constraint.cc. */
23948 static GTY (()) hash_table
<constr_hasher
> *decl_constraints
;
23950 /* Returns true iff cinfo contains a valid set of constraints.
23951 This is the case when the associated requirements have been
23952 successfully decomposed into lists of atomic constraints.
23953 That is, when the saved assumptions are not error_mark_node. */
23956 valid_constraints_p (tree cinfo
)
23958 gcc_assert (cinfo
);
23959 return CI_ASSUMPTIONS (cinfo
) != error_mark_node
;
23962 /* Returns the template constraints of declaration T. If T is not
23963 constrained, return NULL_TREE. Note that T must be non-null. */
23966 get_constraints (tree t
)
23968 gcc_assert (DECL_P (t
));
23969 if (TREE_CODE (t
) == TEMPLATE_DECL
)
23970 t
= DECL_TEMPLATE_RESULT (t
);
23971 constr_entry elt
= { t
, NULL_TREE
};
23972 constr_entry
* found
= decl_constraints
->find (&elt
);
23979 /* Associate the given constraint information CI with the declaration
23980 T. If T is a template, then the constraints are associated with
23981 its underlying declaration. Don't build associations if CI is
23985 set_constraints (tree t
, tree ci
)
23990 if (TREE_CODE (t
) == TEMPLATE_DECL
)
23991 t
= DECL_TEMPLATE_RESULT (t
);
23992 gcc_assert (!get_constraints (t
));
23993 constr_entry elt
= {t
, ci
};
23994 constr_entry
** slot
= decl_constraints
->find_slot (&elt
, INSERT
);
23995 constr_entry
* entry
= ggc_alloc
<constr_entry
> ();
24000 /* Remove the associated constraints of the declaration T. */
24003 remove_constraints (tree t
)
24005 gcc_assert (DECL_P (t
));
24006 if (TREE_CODE (t
) == TEMPLATE_DECL
)
24007 t
= DECL_TEMPLATE_RESULT (t
);
24009 constr_entry elt
= {t
, NULL_TREE
};
24010 constr_entry
** slot
= decl_constraints
->find_slot (&elt
, NO_INSERT
);
24012 decl_constraints
->clear_slot (slot
);
24015 /* Set up the hash table for constraint association. */
24018 init_constraint_processing (void)
24020 decl_constraints
= hash_table
<constr_hasher
>::create_ggc(37);
24023 /* Set up the hash tables for template instantiations. */
24026 init_template_processing (void)
24028 decl_specializations
= hash_table
<spec_hasher
>::create_ggc (37);
24029 type_specializations
= hash_table
<spec_hasher
>::create_ggc (37);
24032 /* Print stats about the template hash tables for -fstats. */
24035 print_template_statistics (void)
24037 fprintf (stderr
, "decl_specializations: size %ld, %ld elements, "
24038 "%f collisions\n", (long) decl_specializations
->size (),
24039 (long) decl_specializations
->elements (),
24040 decl_specializations
->collisions ());
24041 fprintf (stderr
, "type_specializations: size %ld, %ld elements, "
24042 "%f collisions\n", (long) type_specializations
->size (),
24043 (long) type_specializations
->elements (),
24044 type_specializations
->collisions ());
24047 #include "gt-cp-pt.h"