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"
32 #include "stringpool.h"
35 #include "stor-layout.h"
37 #include "c-family/c-objc.h"
38 #include "cp-objcp-common.h"
40 #include "tree-iterator.h"
41 #include "type-utils.h"
44 /* The type of functions taking a tree, and some additional data, and
46 typedef int (*tree_fn_t
) (tree
, void*);
48 /* The PENDING_TEMPLATES is a TREE_LIST of templates whose
49 instantiations have been deferred, either because their definitions
50 were not yet available, or because we were putting off doing the work. */
51 struct GTY ((chain_next ("%h.next"))) pending_template
{
52 struct pending_template
*next
;
53 struct tinst_level
*tinst
;
56 static GTY(()) struct pending_template
*pending_templates
;
57 static GTY(()) struct pending_template
*last_pending_template
;
59 int processing_template_parmlist
;
60 static int template_header_count
;
62 static GTY(()) tree saved_trees
;
63 static vec
<int> inline_parm_levels
;
65 static GTY(()) struct tinst_level
*current_tinst_level
;
67 static GTY(()) tree saved_access_scope
;
69 /* Live only within one (recursive) call to tsubst_expr. We use
70 this to pass the statement expression node from the STMT_EXPR
71 to the EXPR_STMT that is its result. */
72 static tree cur_stmt_expr
;
74 // -------------------------------------------------------------------------- //
75 // Local Specialization Stack
77 // Implementation of the RAII helper for creating new local
79 local_specialization_stack::local_specialization_stack ()
80 : saved (local_specializations
)
82 local_specializations
= new hash_map
<tree
, tree
>;
85 local_specialization_stack::~local_specialization_stack ()
87 delete local_specializations
;
88 local_specializations
= saved
;
91 /* True if we've recursed into fn_type_unification too many times. */
92 static bool excessive_deduction_depth
;
94 struct GTY((for_user
)) spec_entry
101 struct spec_hasher
: ggc_ptr_hash
<spec_entry
>
103 static hashval_t
hash (spec_entry
*);
104 static bool equal (spec_entry
*, spec_entry
*);
107 static GTY (()) hash_table
<spec_hasher
> *decl_specializations
;
109 static GTY (()) hash_table
<spec_hasher
> *type_specializations
;
111 /* Contains canonical template parameter types. The vector is indexed by
112 the TEMPLATE_TYPE_IDX of the template parameter. Each element is a
113 TREE_LIST, whose TREE_VALUEs contain the canonical template
114 parameters of various types and levels. */
115 static GTY(()) vec
<tree
, va_gc
> *canonical_template_parms
;
117 #define UNIFY_ALLOW_NONE 0
118 #define UNIFY_ALLOW_MORE_CV_QUAL 1
119 #define UNIFY_ALLOW_LESS_CV_QUAL 2
120 #define UNIFY_ALLOW_DERIVED 4
121 #define UNIFY_ALLOW_INTEGER 8
122 #define UNIFY_ALLOW_OUTER_LEVEL 16
123 #define UNIFY_ALLOW_OUTER_MORE_CV_QUAL 32
124 #define UNIFY_ALLOW_OUTER_LESS_CV_QUAL 64
126 enum template_base_result
{
128 tbr_ambiguous_baseclass
,
132 static void push_access_scope (tree
);
133 static void pop_access_scope (tree
);
134 static bool resolve_overloaded_unification (tree
, tree
, tree
, tree
,
135 unification_kind_t
, int,
137 static int try_one_overload (tree
, tree
, tree
, tree
, tree
,
138 unification_kind_t
, int, bool, bool);
139 static int unify (tree
, tree
, tree
, tree
, int, bool);
140 static void add_pending_template (tree
);
141 static tree
reopen_tinst_level (struct tinst_level
*);
142 static tree
tsubst_initializer_list (tree
, tree
);
143 static tree
get_partial_spec_bindings (tree
, tree
, tree
, tree
);
144 static tree
coerce_template_parms (tree
, tree
, tree
, tsubst_flags_t
,
146 static tree
coerce_innermost_template_parms (tree
, tree
, tree
, tsubst_flags_t
,
148 static void tsubst_enum (tree
, tree
, tree
);
149 static tree
add_to_template_args (tree
, tree
);
150 static tree
add_outermost_template_args (tree
, tree
);
151 static bool check_instantiated_args (tree
, tree
, tsubst_flags_t
);
152 static int maybe_adjust_types_for_deduction (unification_kind_t
, tree
*, tree
*,
154 static int type_unification_real (tree
, tree
, tree
, const tree
*,
155 unsigned int, int, unification_kind_t
, int,
156 vec
<deferred_access_check
, va_gc
> **,
158 static void note_template_header (int);
159 static tree
convert_nontype_argument_function (tree
, tree
, tsubst_flags_t
);
160 static tree
convert_nontype_argument (tree
, tree
, tsubst_flags_t
);
161 static tree
convert_template_argument (tree
, tree
, tree
,
162 tsubst_flags_t
, int, tree
);
163 static tree
for_each_template_parm (tree
, tree_fn_t
, void*,
164 hash_set
<tree
> *, bool);
165 static tree
expand_template_argument_pack (tree
);
166 static tree
build_template_parm_index (int, int, int, tree
, tree
);
167 static bool inline_needs_template_parms (tree
, bool);
168 static void push_inline_template_parms_recursive (tree
, int);
169 static tree
reduce_template_parm_level (tree
, tree
, int, tree
, tsubst_flags_t
);
170 static int mark_template_parm (tree
, void *);
171 static int template_parm_this_level_p (tree
, void *);
172 static tree
tsubst_friend_function (tree
, tree
);
173 static tree
tsubst_friend_class (tree
, tree
);
174 static int can_complete_type_without_circularity (tree
);
175 static tree
get_bindings (tree
, tree
, tree
, bool);
176 static int template_decl_level (tree
);
177 static int check_cv_quals_for_unify (int, tree
, tree
);
178 static void template_parm_level_and_index (tree
, int*, int*);
179 static int unify_pack_expansion (tree
, tree
, tree
,
180 tree
, unification_kind_t
, bool, bool);
181 static tree
tsubst_template_arg (tree
, tree
, tsubst_flags_t
, tree
);
182 static tree
tsubst_template_args (tree
, tree
, tsubst_flags_t
, tree
);
183 static tree
tsubst_template_parms (tree
, tree
, tsubst_flags_t
);
184 static void regenerate_decl_from_template (tree
, tree
);
185 static tree
most_specialized_partial_spec (tree
, tsubst_flags_t
);
186 static tree
tsubst_aggr_type (tree
, tree
, tsubst_flags_t
, tree
, int);
187 static tree
tsubst_arg_types (tree
, tree
, tree
, tsubst_flags_t
, tree
);
188 static tree
tsubst_function_type (tree
, tree
, tsubst_flags_t
, tree
);
189 static bool check_specialization_scope (void);
190 static tree
process_partial_specialization (tree
);
191 static void set_current_access_from_decl (tree
);
192 static enum template_base_result
get_template_base (tree
, tree
, tree
, tree
,
194 static tree
try_class_unification (tree
, tree
, tree
, tree
, bool);
195 static int coerce_template_template_parms (tree
, tree
, tsubst_flags_t
,
197 static bool template_template_parm_bindings_ok_p (tree
, tree
);
198 static int template_args_equal (tree
, tree
);
199 static void tsubst_default_arguments (tree
, tsubst_flags_t
);
200 static tree
for_each_template_parm_r (tree
*, int *, void *);
201 static tree
copy_default_args_to_explicit_spec_1 (tree
, tree
);
202 static void copy_default_args_to_explicit_spec (tree
);
203 static int invalid_nontype_parm_type_p (tree
, tsubst_flags_t
);
204 static bool dependent_template_arg_p (tree
);
205 static bool any_template_arguments_need_structural_equality_p (tree
);
206 static bool dependent_type_p_r (tree
);
207 static tree
tsubst_copy (tree
, tree
, tsubst_flags_t
, tree
);
208 static tree
tsubst_decl (tree
, tree
, tsubst_flags_t
);
209 static void perform_typedefs_access_check (tree tmpl
, tree targs
);
210 static void append_type_to_template_for_access_check_1 (tree
, tree
, tree
,
212 static tree
listify (tree
);
213 static tree
listify_autos (tree
, tree
);
214 static tree
tsubst_template_parm (tree
, tree
, tsubst_flags_t
);
215 static tree
instantiate_alias_template (tree
, tree
, tsubst_flags_t
);
216 static bool complex_alias_template_p (const_tree tmpl
);
218 /* Make the current scope suitable for access checking when we are
219 processing T. T can be FUNCTION_DECL for instantiated function
220 template, VAR_DECL for static member variable, or TYPE_DECL for
221 alias template (needed by instantiate_decl). */
224 push_access_scope (tree t
)
226 gcc_assert (VAR_OR_FUNCTION_DECL_P (t
)
227 || TREE_CODE (t
) == TYPE_DECL
);
229 if (DECL_FRIEND_CONTEXT (t
))
230 push_nested_class (DECL_FRIEND_CONTEXT (t
));
231 else if (DECL_CLASS_SCOPE_P (t
))
232 push_nested_class (DECL_CONTEXT (t
));
234 push_to_top_level ();
236 if (TREE_CODE (t
) == FUNCTION_DECL
)
238 saved_access_scope
= tree_cons
239 (NULL_TREE
, current_function_decl
, saved_access_scope
);
240 current_function_decl
= t
;
244 /* Restore the scope set up by push_access_scope. T is the node we
248 pop_access_scope (tree t
)
250 if (TREE_CODE (t
) == FUNCTION_DECL
)
252 current_function_decl
= TREE_VALUE (saved_access_scope
);
253 saved_access_scope
= TREE_CHAIN (saved_access_scope
);
256 if (DECL_FRIEND_CONTEXT (t
) || DECL_CLASS_SCOPE_P (t
))
259 pop_from_top_level ();
262 /* Do any processing required when DECL (a member template
263 declaration) is finished. Returns the TEMPLATE_DECL corresponding
264 to DECL, unless it is a specialization, in which case the DECL
265 itself is returned. */
268 finish_member_template_decl (tree decl
)
270 if (decl
== error_mark_node
)
271 return error_mark_node
;
273 gcc_assert (DECL_P (decl
));
275 if (TREE_CODE (decl
) == TYPE_DECL
)
279 type
= TREE_TYPE (decl
);
280 if (type
== error_mark_node
)
281 return error_mark_node
;
282 if (MAYBE_CLASS_TYPE_P (type
)
283 && CLASSTYPE_TEMPLATE_INFO (type
)
284 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
286 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
287 check_member_template (tmpl
);
292 else if (TREE_CODE (decl
) == FIELD_DECL
)
293 error ("data member %qD cannot be a member template", decl
);
294 else if (DECL_TEMPLATE_INFO (decl
))
296 if (!DECL_TEMPLATE_SPECIALIZATION (decl
))
298 check_member_template (DECL_TI_TEMPLATE (decl
));
299 return DECL_TI_TEMPLATE (decl
);
305 error ("invalid member template declaration %qD", decl
);
307 return error_mark_node
;
310 /* Create a template info node. */
313 build_template_info (tree template_decl
, tree template_args
)
315 tree result
= make_node (TEMPLATE_INFO
);
316 TI_TEMPLATE (result
) = template_decl
;
317 TI_ARGS (result
) = template_args
;
321 /* Return the template info node corresponding to T, whatever T is. */
324 get_template_info (const_tree t
)
326 tree tinfo
= NULL_TREE
;
328 if (!t
|| t
== error_mark_node
)
331 if (TREE_CODE (t
) == NAMESPACE_DECL
)
334 if (DECL_P (t
) && DECL_LANG_SPECIFIC (t
))
335 tinfo
= DECL_TEMPLATE_INFO (t
);
337 if (!tinfo
&& DECL_IMPLICIT_TYPEDEF_P (t
))
340 if (OVERLOAD_TYPE_P (t
))
341 tinfo
= TYPE_TEMPLATE_INFO (t
);
342 else if (TREE_CODE (t
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
343 tinfo
= TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t
);
348 /* Returns the template nesting level of the indicated class TYPE.
358 A<T>::B<U> has depth two, while A<T> has depth one.
359 Both A<T>::B<int> and A<int>::B<U> have depth one, if
360 they are instantiations, not specializations.
362 This function is guaranteed to return 0 if passed NULL_TREE so
363 that, for example, `template_class_depth (current_class_type)' is
367 template_class_depth (tree type
)
372 type
&& TREE_CODE (type
) != NAMESPACE_DECL
;
373 type
= (TREE_CODE (type
) == FUNCTION_DECL
)
374 ? CP_DECL_CONTEXT (type
) : CP_TYPE_CONTEXT (type
))
376 tree tinfo
= get_template_info (type
);
378 if (tinfo
&& PRIMARY_TEMPLATE_P (TI_TEMPLATE (tinfo
))
379 && uses_template_parms (INNERMOST_TEMPLATE_ARGS (TI_ARGS (tinfo
))))
386 /* Subroutine of maybe_begin_member_template_processing.
387 Returns true if processing DECL needs us to push template parms. */
390 inline_needs_template_parms (tree decl
, bool nsdmi
)
392 if (!decl
|| (!nsdmi
&& ! DECL_TEMPLATE_INFO (decl
)))
395 return (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (most_general_template (decl
)))
396 > (processing_template_decl
+ DECL_TEMPLATE_SPECIALIZATION (decl
)));
399 /* Subroutine of maybe_begin_member_template_processing.
400 Push the template parms in PARMS, starting from LEVELS steps into the
401 chain, and ending at the beginning, since template parms are listed
405 push_inline_template_parms_recursive (tree parmlist
, int levels
)
407 tree parms
= TREE_VALUE (parmlist
);
411 push_inline_template_parms_recursive (TREE_CHAIN (parmlist
), levels
- 1);
413 ++processing_template_decl
;
414 current_template_parms
415 = tree_cons (size_int (processing_template_decl
),
416 parms
, current_template_parms
);
417 TEMPLATE_PARMS_FOR_INLINE (current_template_parms
) = 1;
419 begin_scope (TREE_VEC_LENGTH (parms
) ? sk_template_parms
: sk_template_spec
,
421 for (i
= 0; i
< TREE_VEC_LENGTH (parms
); ++i
)
423 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
425 if (error_operand_p (parm
))
428 gcc_assert (DECL_P (parm
));
430 switch (TREE_CODE (parm
))
438 /* Push the CONST_DECL. */
439 pushdecl (TEMPLATE_PARM_DECL (DECL_INITIAL (parm
)));
448 /* Restore the template parameter context for a member template, a
449 friend template defined in a class definition, or a non-template
450 member of template class. */
453 maybe_begin_member_template_processing (tree decl
)
457 bool nsdmi
= TREE_CODE (decl
) == FIELD_DECL
;
461 tree ctx
= DECL_CONTEXT (decl
);
462 decl
= (CLASSTYPE_TEMPLATE_INFO (ctx
)
463 /* Disregard full specializations (c++/60999). */
464 && uses_template_parms (ctx
)
465 ? CLASSTYPE_TI_TEMPLATE (ctx
) : NULL_TREE
);
468 if (inline_needs_template_parms (decl
, nsdmi
))
470 parms
= DECL_TEMPLATE_PARMS (most_general_template (decl
));
471 levels
= TMPL_PARMS_DEPTH (parms
) - processing_template_decl
;
473 if (DECL_TEMPLATE_SPECIALIZATION (decl
))
476 parms
= TREE_CHAIN (parms
);
479 push_inline_template_parms_recursive (parms
, levels
);
482 /* Remember how many levels of template parameters we pushed so that
483 we can pop them later. */
484 inline_parm_levels
.safe_push (levels
);
487 /* Undo the effects of maybe_begin_member_template_processing. */
490 maybe_end_member_template_processing (void)
495 if (inline_parm_levels
.length () == 0)
498 last
= inline_parm_levels
.pop ();
499 for (i
= 0; i
< last
; ++i
)
501 --processing_template_decl
;
502 current_template_parms
= TREE_CHAIN (current_template_parms
);
507 /* Return a new template argument vector which contains all of ARGS,
508 but has as its innermost set of arguments the EXTRA_ARGS. */
511 add_to_template_args (tree args
, tree extra_args
)
518 if (args
== NULL_TREE
|| extra_args
== error_mark_node
)
521 extra_depth
= TMPL_ARGS_DEPTH (extra_args
);
522 new_args
= make_tree_vec (TMPL_ARGS_DEPTH (args
) + extra_depth
);
524 for (i
= 1; i
<= TMPL_ARGS_DEPTH (args
); ++i
)
525 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (args
, i
));
527 for (j
= 1; j
<= extra_depth
; ++j
, ++i
)
528 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (extra_args
, j
));
533 /* Like add_to_template_args, but only the outermost ARGS are added to
534 the EXTRA_ARGS. In particular, all but TMPL_ARGS_DEPTH
535 (EXTRA_ARGS) levels are added. This function is used to combine
536 the template arguments from a partial instantiation with the
537 template arguments used to attain the full instantiation from the
538 partial instantiation. */
541 add_outermost_template_args (tree args
, tree extra_args
)
545 /* If there are more levels of EXTRA_ARGS than there are ARGS,
546 something very fishy is going on. */
547 gcc_assert (TMPL_ARGS_DEPTH (args
) >= TMPL_ARGS_DEPTH (extra_args
));
549 /* If *all* the new arguments will be the EXTRA_ARGS, just return
551 if (TMPL_ARGS_DEPTH (args
) == TMPL_ARGS_DEPTH (extra_args
))
554 /* For the moment, we make ARGS look like it contains fewer levels. */
555 TREE_VEC_LENGTH (args
) -= TMPL_ARGS_DEPTH (extra_args
);
557 new_args
= add_to_template_args (args
, extra_args
);
559 /* Now, we restore ARGS to its full dimensions. */
560 TREE_VEC_LENGTH (args
) += TMPL_ARGS_DEPTH (extra_args
);
565 /* Return the N levels of innermost template arguments from the ARGS. */
568 get_innermost_template_args (tree args
, int n
)
576 /* If N is 1, just return the innermost set of template arguments. */
578 return TMPL_ARGS_LEVEL (args
, TMPL_ARGS_DEPTH (args
));
580 /* If we're not removing anything, just return the arguments we were
582 extra_levels
= TMPL_ARGS_DEPTH (args
) - n
;
583 gcc_assert (extra_levels
>= 0);
584 if (extra_levels
== 0)
587 /* Make a new set of arguments, not containing the outer arguments. */
588 new_args
= make_tree_vec (n
);
589 for (i
= 1; i
<= n
; ++i
)
590 SET_TMPL_ARGS_LEVEL (new_args
, i
,
591 TMPL_ARGS_LEVEL (args
, i
+ extra_levels
));
596 /* The inverse of get_innermost_template_args: Return all but the innermost
597 EXTRA_LEVELS levels of template arguments from the ARGS. */
600 strip_innermost_template_args (tree args
, int extra_levels
)
603 int n
= TMPL_ARGS_DEPTH (args
) - extra_levels
;
608 /* If N is 1, just return the outermost set of template arguments. */
610 return TMPL_ARGS_LEVEL (args
, 1);
612 /* If we're not removing anything, just return the arguments we were
614 gcc_assert (extra_levels
>= 0);
615 if (extra_levels
== 0)
618 /* Make a new set of arguments, not containing the inner arguments. */
619 new_args
= make_tree_vec (n
);
620 for (i
= 1; i
<= n
; ++i
)
621 SET_TMPL_ARGS_LEVEL (new_args
, i
,
622 TMPL_ARGS_LEVEL (args
, i
));
627 /* We've got a template header coming up; push to a new level for storing
631 begin_template_parm_list (void)
633 /* We use a non-tag-transparent scope here, which causes pushtag to
634 put tags in this scope, rather than in the enclosing class or
635 namespace scope. This is the right thing, since we want
636 TEMPLATE_DECLS, and not TYPE_DECLS for template classes. For a
637 global template class, push_template_decl handles putting the
638 TEMPLATE_DECL into top-level scope. For a nested template class,
641 template <class T> struct S1 {
642 template <class T> struct S2 {};
645 pushtag contains special code to call pushdecl_with_scope on the
646 TEMPLATE_DECL for S2. */
647 begin_scope (sk_template_parms
, NULL
);
648 ++processing_template_decl
;
649 ++processing_template_parmlist
;
650 note_template_header (0);
652 /* Add a dummy parameter level while we process the parameter list. */
653 current_template_parms
654 = tree_cons (size_int (processing_template_decl
),
656 current_template_parms
);
659 /* This routine is called when a specialization is declared. If it is
660 invalid to declare a specialization here, an error is reported and
661 false is returned, otherwise this routine will return true. */
664 check_specialization_scope (void)
666 tree scope
= current_scope ();
670 An explicit specialization shall be declared in the namespace of
671 which the template is a member, or, for member templates, in the
672 namespace of which the enclosing class or enclosing class
673 template is a member. An explicit specialization of a member
674 function, member class or static data member of a class template
675 shall be declared in the namespace of which the class template
677 if (scope
&& TREE_CODE (scope
) != NAMESPACE_DECL
)
679 error ("explicit specialization in non-namespace scope %qD", scope
);
685 In an explicit specialization declaration for a member of a class
686 template or a member template that appears in namespace scope,
687 the member template and some of its enclosing class templates may
688 remain unspecialized, except that the declaration shall not
689 explicitly specialize a class member template if its enclosing
690 class templates are not explicitly specialized as well. */
691 if (current_template_parms
)
693 error ("enclosing class templates are not explicitly specialized");
700 /* We've just seen template <>. */
703 begin_specialization (void)
705 begin_scope (sk_template_spec
, NULL
);
706 note_template_header (1);
707 return check_specialization_scope ();
710 /* Called at then end of processing a declaration preceded by
714 end_specialization (void)
717 reset_specialization ();
720 /* Any template <>'s that we have seen thus far are not referring to a
721 function specialization. */
724 reset_specialization (void)
726 processing_specialization
= 0;
727 template_header_count
= 0;
730 /* We've just seen a template header. If SPECIALIZATION is nonzero,
731 it was of the form template <>. */
734 note_template_header (int specialization
)
736 processing_specialization
= specialization
;
737 template_header_count
++;
740 /* We're beginning an explicit instantiation. */
743 begin_explicit_instantiation (void)
745 gcc_assert (!processing_explicit_instantiation
);
746 processing_explicit_instantiation
= true;
751 end_explicit_instantiation (void)
753 gcc_assert (processing_explicit_instantiation
);
754 processing_explicit_instantiation
= false;
757 /* An explicit specialization or partial specialization of TMPL is being
758 declared. Check that the namespace in which the specialization is
759 occurring is permissible. Returns false iff it is invalid to
760 specialize TMPL in the current namespace. */
763 check_specialization_namespace (tree tmpl
)
765 tree tpl_ns
= decl_namespace_context (tmpl
);
769 An explicit specialization shall be declared in the namespace of
770 which the template is a member, or, for member templates, in the
771 namespace of which the enclosing class or enclosing class
772 template is a member. An explicit specialization of a member
773 function, member class or static data member of a class template
774 shall be declared in the namespace of which the class template is
776 if (current_scope() != DECL_CONTEXT (tmpl
)
777 && !at_namespace_scope_p ())
779 error ("specialization of %qD must appear at namespace scope", tmpl
);
782 if (is_associated_namespace (current_namespace
, tpl_ns
))
783 /* Same or super-using namespace. */
787 permerror (input_location
,
788 "specialization of %qD in different namespace", tmpl
);
789 permerror (DECL_SOURCE_LOCATION (tmpl
),
790 " from definition of %q#D", tmpl
);
795 /* SPEC is an explicit instantiation. Check that it is valid to
796 perform this explicit instantiation in the current namespace. */
799 check_explicit_instantiation_namespace (tree spec
)
803 /* DR 275: An explicit instantiation shall appear in an enclosing
804 namespace of its template. */
805 ns
= decl_namespace_context (spec
);
806 if (!is_ancestor (current_namespace
, ns
))
807 permerror (input_location
, "explicit instantiation of %qD in namespace %qD "
808 "(which does not enclose namespace %qD)",
809 spec
, current_namespace
, ns
);
812 // Returns the type of a template specialization only if that
813 // specialization needs to be defined. Otherwise (e.g., if the type has
814 // already been defined), the function returns NULL_TREE.
816 maybe_new_partial_specialization (tree type
)
818 // An implicit instantiation of an incomplete type implies
819 // the definition of a new class template.
821 // template<typename T>
824 // template<typename T>
827 // Here, S<T*> is an implicit instantiation of S whose type
829 if (CLASSTYPE_IMPLICIT_INSTANTIATION (type
) && !COMPLETE_TYPE_P (type
))
832 // It can also be the case that TYPE is a completed specialization.
833 // Continuing the previous example, suppose we also declare:
835 // template<typename T>
836 // requires Integral<T>
839 // Here, S<T*> refers to the specialization S<T*> defined
840 // above. However, we need to differentiate definitions because
841 // we intend to define a new partial specialization. In this case,
842 // we rely on the fact that the constraints are different for
843 // this declaration than that above.
845 // Note that we also get here for injected class names and
846 // late-parsed template definitions. We must ensure that we
847 // do not create new type declarations for those cases.
848 if (flag_concepts
&& CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
850 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
851 tree args
= CLASSTYPE_TI_ARGS (type
);
853 // If there are no template parameters, this cannot be a new
854 // partial template specializtion?
855 if (!current_template_parms
)
858 // If the constraints are not the same as those of the primary
859 // then, we can probably create a new specialization.
860 tree type_constr
= current_template_constraints ();
862 if (type
== TREE_TYPE (tmpl
))
864 tree main_constr
= get_constraints (tmpl
);
865 if (equivalent_constraints (type_constr
, main_constr
))
869 // Also, if there's a pre-existing specialization with matching
870 // constraints, then this also isn't new.
871 tree specs
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
874 tree spec_tmpl
= TREE_VALUE (specs
);
875 tree spec_args
= TREE_PURPOSE (specs
);
876 tree spec_constr
= get_constraints (spec_tmpl
);
877 if (comp_template_args (args
, spec_args
)
878 && equivalent_constraints (type_constr
, spec_constr
))
880 specs
= TREE_CHAIN (specs
);
883 // Create a new type node (and corresponding type decl)
884 // for the newly declared specialization.
885 tree t
= make_class_type (TREE_CODE (type
));
886 CLASSTYPE_DECLARED_CLASS (t
) = CLASSTYPE_DECLARED_CLASS (type
);
887 TYPE_FOR_JAVA (t
) = TYPE_FOR_JAVA (type
);
888 SET_TYPE_TEMPLATE_INFO (t
, build_template_info (tmpl
, args
));
890 /* We only need a separate type node for storing the definition of this
891 partial specialization; uses of S<T*> are unconstrained, so all are
892 equivalent. So keep TYPE_CANONICAL the same. */
893 TYPE_CANONICAL (t
) = TYPE_CANONICAL (type
);
895 // Build the corresponding type decl.
896 tree d
= create_implicit_typedef (DECL_NAME (tmpl
), t
);
897 DECL_CONTEXT (d
) = TYPE_CONTEXT (t
);
898 DECL_SOURCE_LOCATION (d
) = input_location
;
906 /* The TYPE is being declared. If it is a template type, that means it
907 is a partial specialization. Do appropriate error-checking. */
910 maybe_process_partial_specialization (tree type
)
914 if (type
== error_mark_node
)
915 return error_mark_node
;
917 /* A lambda that appears in specialization context is not itself a
919 if (CLASS_TYPE_P (type
) && CLASSTYPE_LAMBDA_EXPR (type
))
922 if (TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
924 error ("name of class shadows template template parameter %qD",
926 return error_mark_node
;
929 context
= TYPE_CONTEXT (type
);
931 if (TYPE_ALIAS_P (type
))
933 if (TYPE_TEMPLATE_INFO (type
)
934 && DECL_ALIAS_TEMPLATE_P (TYPE_TI_TEMPLATE (type
)))
935 error ("specialization of alias template %qD",
936 TYPE_TI_TEMPLATE (type
));
938 error ("explicit specialization of non-template %qT", type
);
939 return error_mark_node
;
941 else if (CLASS_TYPE_P (type
) && CLASSTYPE_USE_TEMPLATE (type
))
943 /* This is for ordinary explicit specialization and partial
944 specialization of a template class such as:
946 template <> class C<int>;
950 template <class T> class C<T*>;
952 Make sure that `C<int>' and `C<T*>' are implicit instantiations. */
954 if (tree t
= maybe_new_partial_specialization (type
))
956 if (!check_specialization_namespace (CLASSTYPE_TI_TEMPLATE (t
))
957 && !at_namespace_scope_p ())
958 return error_mark_node
;
959 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (t
);
960 DECL_SOURCE_LOCATION (TYPE_MAIN_DECL (t
)) = input_location
;
961 if (processing_template_decl
)
963 tree decl
= push_template_decl (TYPE_MAIN_DECL (t
));
964 if (decl
== error_mark_node
)
965 return error_mark_node
;
966 return TREE_TYPE (decl
);
969 else if (CLASSTYPE_TEMPLATE_INSTANTIATION (type
))
970 error ("specialization of %qT after instantiation", type
);
971 else if (errorcount
&& !processing_specialization
972 && CLASSTYPE_TEMPLATE_SPECIALIZATION (type
)
973 && !uses_template_parms (CLASSTYPE_TI_ARGS (type
)))
974 /* Trying to define a specialization either without a template<> header
975 or in an inappropriate place. We've already given an error, so just
976 bail now so we don't actually define the specialization. */
977 return error_mark_node
;
979 else if (CLASS_TYPE_P (type
)
980 && !CLASSTYPE_USE_TEMPLATE (type
)
981 && CLASSTYPE_TEMPLATE_INFO (type
)
982 && context
&& CLASS_TYPE_P (context
)
983 && CLASSTYPE_TEMPLATE_INFO (context
))
985 /* This is for an explicit specialization of member class
986 template according to [temp.expl.spec/18]:
988 template <> template <class U> class C<int>::D;
990 The context `C<int>' must be an implicit instantiation.
991 Otherwise this is just a member class template declared
994 template <> class C<int> { template <class U> class D; };
995 template <> template <class U> class C<int>::D;
997 In the first case, `C<int>::D' is a specialization of `C<T>::D'
998 while in the second case, `C<int>::D' is a primary template
999 and `C<T>::D' may not exist. */
1001 if (CLASSTYPE_IMPLICIT_INSTANTIATION (context
)
1002 && !COMPLETE_TYPE_P (type
))
1005 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
1007 if (current_namespace
1008 != decl_namespace_context (tmpl
))
1010 permerror (input_location
,
1011 "specializing %q#T in different namespace", type
);
1012 permerror (DECL_SOURCE_LOCATION (tmpl
),
1013 " from definition of %q#D", tmpl
);
1016 /* Check for invalid specialization after instantiation:
1018 template <> template <> class C<int>::D<int>;
1019 template <> template <class U> class C<int>::D; */
1021 for (t
= DECL_TEMPLATE_INSTANTIATIONS (tmpl
);
1022 t
; t
= TREE_CHAIN (t
))
1024 tree inst
= TREE_VALUE (t
);
1025 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (inst
)
1026 || !COMPLETE_OR_OPEN_TYPE_P (inst
))
1028 /* We already have a full specialization of this partial
1029 instantiation, or a full specialization has been
1030 looked up but not instantiated. Reassign it to the
1031 new member specialization template. */
1035 elt
.tmpl
= most_general_template (tmpl
);
1036 elt
.args
= CLASSTYPE_TI_ARGS (inst
);
1039 type_specializations
->remove_elt (&elt
);
1042 elt
.args
= INNERMOST_TEMPLATE_ARGS (elt
.args
);
1045 = type_specializations
->find_slot (&elt
, INSERT
);
1046 entry
= ggc_alloc
<spec_entry
> ();
1051 /* But if we've had an implicit instantiation, that's a
1052 problem ([temp.expl.spec]/6). */
1053 error ("specialization %qT after instantiation %qT",
1057 /* Mark TYPE as a specialization. And as a result, we only
1058 have one level of template argument for the innermost
1060 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type
);
1061 DECL_SOURCE_LOCATION (TYPE_MAIN_DECL (type
)) = input_location
;
1062 CLASSTYPE_TI_ARGS (type
)
1063 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type
));
1066 else if (processing_specialization
)
1068 /* Someday C++0x may allow for enum template specialization. */
1069 if (cxx_dialect
> cxx98
&& TREE_CODE (type
) == ENUMERAL_TYPE
1070 && CLASS_TYPE_P (context
) && CLASSTYPE_USE_TEMPLATE (context
))
1071 pedwarn (input_location
, OPT_Wpedantic
, "template specialization "
1072 "of %qD not allowed by ISO C++", type
);
1075 error ("explicit specialization of non-template %qT", type
);
1076 return error_mark_node
;
1083 /* Returns nonzero if we can optimize the retrieval of specializations
1084 for TMPL, a TEMPLATE_DECL. In particular, for such a template, we
1085 do not use DECL_TEMPLATE_SPECIALIZATIONS at all. */
1088 optimize_specialization_lookup_p (tree tmpl
)
1090 return (DECL_FUNCTION_TEMPLATE_P (tmpl
)
1091 && DECL_CLASS_SCOPE_P (tmpl
)
1092 /* DECL_CLASS_SCOPE_P holds of T::f even if T is a template
1094 && CLASS_TYPE_P (DECL_CONTEXT (tmpl
))
1095 /* The optimized lookup depends on the fact that the
1096 template arguments for the member function template apply
1097 purely to the containing class, which is not true if the
1098 containing class is an explicit or partial
1100 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (tmpl
))
1101 && !DECL_MEMBER_TEMPLATE_P (tmpl
)
1102 && !DECL_CONV_FN_P (tmpl
)
1103 /* It is possible to have a template that is not a member
1104 template and is not a member of a template class:
1106 template <typename T>
1107 struct S { friend A::f(); };
1109 Here, the friend function is a template, but the context does
1110 not have template information. The optimized lookup relies
1111 on having ARGS be the template arguments for both the class
1112 and the function template. */
1113 && !DECL_FRIEND_P (DECL_TEMPLATE_RESULT (tmpl
)));
1116 /* Make sure ARGS doesn't use any inappropriate typedefs; we should have
1117 gone through coerce_template_parms by now. */
1120 verify_unstripped_args (tree args
)
1122 ++processing_template_decl
;
1123 if (!any_dependent_template_arguments_p (args
))
1125 tree inner
= INNERMOST_TEMPLATE_ARGS (args
);
1126 for (int i
= 0; i
< TREE_VEC_LENGTH (inner
); ++i
)
1128 tree arg
= TREE_VEC_ELT (inner
, i
);
1129 if (TREE_CODE (arg
) == TEMPLATE_DECL
)
1131 else if (TYPE_P (arg
))
1132 gcc_assert (strip_typedefs (arg
, NULL
) == arg
);
1133 else if (strip_typedefs (TREE_TYPE (arg
), NULL
) != TREE_TYPE (arg
))
1134 /* Allow typedefs on the type of a non-type argument, since a
1135 parameter can have them. */;
1137 gcc_assert (strip_typedefs_expr (arg
, NULL
) == arg
);
1140 --processing_template_decl
;
1143 /* Retrieve the specialization (in the sense of [temp.spec] - a
1144 specialization is either an instantiation or an explicit
1145 specialization) of TMPL for the given template ARGS. If there is
1146 no such specialization, return NULL_TREE. The ARGS are a vector of
1147 arguments, or a vector of vectors of arguments, in the case of
1148 templates with more than one level of parameters.
1150 If TMPL is a type template and CLASS_SPECIALIZATIONS_P is true,
1151 then we search for a partial specialization matching ARGS. This
1152 parameter is ignored if TMPL is not a class template.
1154 We can also look up a FIELD_DECL, if it is a lambda capture pack; the
1155 result is a NONTYPE_ARGUMENT_PACK. */
1158 retrieve_specialization (tree tmpl
, tree args
, hashval_t hash
)
1160 if (tmpl
== NULL_TREE
)
1163 if (args
== error_mark_node
)
1166 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
1167 || TREE_CODE (tmpl
) == FIELD_DECL
);
1169 /* There should be as many levels of arguments as there are
1170 levels of parameters. */
1171 gcc_assert (TMPL_ARGS_DEPTH (args
)
1172 == (TREE_CODE (tmpl
) == TEMPLATE_DECL
1173 ? TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
))
1174 : template_class_depth (DECL_CONTEXT (tmpl
))));
1177 verify_unstripped_args (args
);
1179 if (optimize_specialization_lookup_p (tmpl
))
1181 tree class_template
;
1182 tree class_specialization
;
1183 vec
<tree
, va_gc
> *methods
;
1187 /* The template arguments actually apply to the containing
1188 class. Find the class specialization with those
1190 class_template
= CLASSTYPE_TI_TEMPLATE (DECL_CONTEXT (tmpl
));
1191 class_specialization
1192 = retrieve_specialization (class_template
, args
, 0);
1193 if (!class_specialization
)
1195 /* Now, find the appropriate entry in the CLASSTYPE_METHOD_VEC
1196 for the specialization. */
1197 idx
= class_method_index_for_fn (class_specialization
, tmpl
);
1200 /* Iterate through the methods with the indicated name, looking
1201 for the one that has an instance of TMPL. */
1202 methods
= CLASSTYPE_METHOD_VEC (class_specialization
);
1203 for (fns
= (*methods
)[idx
]; fns
; fns
= OVL_NEXT (fns
))
1205 tree fn
= OVL_CURRENT (fns
);
1206 if (DECL_TEMPLATE_INFO (fn
) && DECL_TI_TEMPLATE (fn
) == tmpl
1207 /* using-declarations can add base methods to the method vec,
1208 and we don't want those here. */
1209 && DECL_CONTEXT (fn
) == class_specialization
)
1218 hash_table
<spec_hasher
> *specializations
;
1222 elt
.spec
= NULL_TREE
;
1224 if (DECL_CLASS_TEMPLATE_P (tmpl
))
1225 specializations
= type_specializations
;
1227 specializations
= decl_specializations
;
1230 hash
= spec_hasher::hash (&elt
);
1231 found
= specializations
->find_with_hash (&elt
, hash
);
1239 /* Like retrieve_specialization, but for local declarations. */
1242 retrieve_local_specialization (tree tmpl
)
1244 if (local_specializations
== NULL
)
1247 tree
*slot
= local_specializations
->get (tmpl
);
1248 return slot
? *slot
: NULL_TREE
;
1251 /* Returns nonzero iff DECL is a specialization of TMPL. */
1254 is_specialization_of (tree decl
, tree tmpl
)
1258 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1262 t
= DECL_TEMPLATE_INFO (t
) ? DECL_TI_TEMPLATE (t
) : NULL_TREE
)
1268 gcc_assert (TREE_CODE (decl
) == TYPE_DECL
);
1270 for (t
= TREE_TYPE (decl
);
1272 t
= CLASSTYPE_USE_TEMPLATE (t
)
1273 ? TREE_TYPE (CLASSTYPE_TI_TEMPLATE (t
)) : NULL_TREE
)
1274 if (same_type_ignoring_top_level_qualifiers_p (t
, TREE_TYPE (tmpl
)))
1281 /* Returns nonzero iff DECL is a specialization of friend declaration
1282 FRIEND_DECL according to [temp.friend]. */
1285 is_specialization_of_friend (tree decl
, tree friend_decl
)
1287 bool need_template
= true;
1290 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
1291 || TREE_CODE (decl
) == TYPE_DECL
);
1293 /* For [temp.friend/6] when FRIEND_DECL is an ordinary member function
1294 of a template class, we want to check if DECL is a specialization
1296 if (TREE_CODE (friend_decl
) == FUNCTION_DECL
1297 && DECL_TEMPLATE_INFO (friend_decl
)
1298 && !DECL_USE_TEMPLATE (friend_decl
))
1300 /* We want a TEMPLATE_DECL for `is_specialization_of'. */
1301 friend_decl
= DECL_TI_TEMPLATE (friend_decl
);
1302 need_template
= false;
1304 else if (TREE_CODE (friend_decl
) == TEMPLATE_DECL
1305 && !PRIMARY_TEMPLATE_P (friend_decl
))
1306 need_template
= false;
1308 /* There is nothing to do if this is not a template friend. */
1309 if (TREE_CODE (friend_decl
) != TEMPLATE_DECL
)
1312 if (is_specialization_of (decl
, friend_decl
))
1316 A member of a class template may be declared to be a friend of a
1317 non-template class. In this case, the corresponding member of
1318 every specialization of the class template is a friend of the
1319 class granting friendship.
1321 For example, given a template friend declaration
1323 template <class T> friend void A<T>::f();
1325 the member function below is considered a friend
1327 template <> struct A<int> {
1331 For this type of template friend, TEMPLATE_DEPTH below will be
1332 nonzero. To determine if DECL is a friend of FRIEND, we first
1333 check if the enclosing class is a specialization of another. */
1335 template_depth
= template_class_depth (CP_DECL_CONTEXT (friend_decl
));
1337 && DECL_CLASS_SCOPE_P (decl
)
1338 && is_specialization_of (TYPE_NAME (DECL_CONTEXT (decl
)),
1339 CLASSTYPE_TI_TEMPLATE (DECL_CONTEXT (friend_decl
))))
1341 /* Next, we check the members themselves. In order to handle
1342 a few tricky cases, such as when FRIEND_DECL's are
1344 template <class T> friend void A<T>::g(T t);
1345 template <class T> template <T t> friend void A<T>::h();
1349 void A<int>::g(int);
1350 template <int> void A<int>::h();
1352 we need to figure out ARGS, the template arguments from
1353 the context of DECL. This is required for template substitution
1354 of `T' in the function parameter of `g' and template parameter
1355 of `h' in the above examples. Here ARGS corresponds to `int'. */
1357 tree context
= DECL_CONTEXT (decl
);
1358 tree args
= NULL_TREE
;
1359 int current_depth
= 0;
1361 while (current_depth
< template_depth
)
1363 if (CLASSTYPE_TEMPLATE_INFO (context
))
1365 if (current_depth
== 0)
1366 args
= TYPE_TI_ARGS (context
);
1368 args
= add_to_template_args (TYPE_TI_ARGS (context
), args
);
1371 context
= TYPE_CONTEXT (context
);
1374 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1379 tree friend_args_type
;
1380 tree decl_args_type
;
1382 /* Make sure that both DECL and FRIEND_DECL are templates or
1384 is_template
= DECL_TEMPLATE_INFO (decl
)
1385 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl
));
1386 if (need_template
^ is_template
)
1388 else if (is_template
)
1390 /* If both are templates, check template parameter list. */
1392 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_decl
),
1394 if (!comp_template_parms
1395 (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (decl
)),
1399 decl_type
= TREE_TYPE (DECL_TI_TEMPLATE (decl
));
1402 decl_type
= TREE_TYPE (decl
);
1404 friend_type
= tsubst_function_type (TREE_TYPE (friend_decl
), args
,
1405 tf_none
, NULL_TREE
);
1406 if (friend_type
== error_mark_node
)
1409 /* Check if return types match. */
1410 if (!same_type_p (TREE_TYPE (decl_type
), TREE_TYPE (friend_type
)))
1413 /* Check if function parameter types match, ignoring the
1414 `this' parameter. */
1415 friend_args_type
= TYPE_ARG_TYPES (friend_type
);
1416 decl_args_type
= TYPE_ARG_TYPES (decl_type
);
1417 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (friend_decl
))
1418 friend_args_type
= TREE_CHAIN (friend_args_type
);
1419 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1420 decl_args_type
= TREE_CHAIN (decl_args_type
);
1422 return compparms (decl_args_type
, friend_args_type
);
1426 /* DECL is a TYPE_DECL */
1428 tree decl_type
= TREE_TYPE (decl
);
1430 /* Make sure that both DECL and FRIEND_DECL are templates or
1433 = CLASSTYPE_TEMPLATE_INFO (decl_type
)
1434 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (decl_type
));
1436 if (need_template
^ is_template
)
1438 else if (is_template
)
1441 /* If both are templates, check the name of the two
1442 TEMPLATE_DECL's first because is_friend didn't. */
1443 if (DECL_NAME (CLASSTYPE_TI_TEMPLATE (decl_type
))
1444 != DECL_NAME (friend_decl
))
1447 /* Now check template parameter list. */
1449 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_decl
),
1451 return comp_template_parms
1452 (DECL_TEMPLATE_PARMS (CLASSTYPE_TI_TEMPLATE (decl_type
)),
1456 return (DECL_NAME (decl
)
1457 == DECL_NAME (friend_decl
));
1463 /* Register the specialization SPEC as a specialization of TMPL with
1464 the indicated ARGS. IS_FRIEND indicates whether the specialization
1465 is actually just a friend declaration. Returns SPEC, or an
1466 equivalent prior declaration, if available.
1468 We also store instantiations of field packs in the hash table, even
1469 though they are not themselves templates, to make lookup easier. */
1472 register_specialization (tree spec
, tree tmpl
, tree args
, bool is_friend
,
1476 spec_entry
**slot
= NULL
;
1479 gcc_assert ((TREE_CODE (tmpl
) == TEMPLATE_DECL
&& DECL_P (spec
))
1480 || (TREE_CODE (tmpl
) == FIELD_DECL
1481 && TREE_CODE (spec
) == NONTYPE_ARGUMENT_PACK
));
1483 if (TREE_CODE (spec
) == FUNCTION_DECL
1484 && uses_template_parms (DECL_TI_ARGS (spec
)))
1485 /* This is the FUNCTION_DECL for a partial instantiation. Don't
1486 register it; we want the corresponding TEMPLATE_DECL instead.
1487 We use `uses_template_parms (DECL_TI_ARGS (spec))' rather than
1488 the more obvious `uses_template_parms (spec)' to avoid problems
1489 with default function arguments. In particular, given
1490 something like this:
1492 template <class T> void f(T t1, T t = T())
1494 the default argument expression is not substituted for in an
1495 instantiation unless and until it is actually needed. */
1498 if (optimize_specialization_lookup_p (tmpl
))
1499 /* We don't put these specializations in the hash table, but we might
1500 want to give an error about a mismatch. */
1501 fn
= retrieve_specialization (tmpl
, args
, 0);
1509 hash
= spec_hasher::hash (&elt
);
1512 decl_specializations
->find_slot_with_hash (&elt
, hash
, INSERT
);
1514 fn
= ((spec_entry
*) *slot
)->spec
;
1519 /* We can sometimes try to re-register a specialization that we've
1520 already got. In particular, regenerate_decl_from_template calls
1521 duplicate_decls which will update the specialization list. But,
1522 we'll still get called again here anyhow. It's more convenient
1523 to simply allow this than to try to prevent it. */
1526 else if (fn
&& DECL_TEMPLATE_SPECIALIZATION (spec
))
1528 if (DECL_TEMPLATE_INSTANTIATION (fn
))
1530 if (DECL_ODR_USED (fn
)
1531 || DECL_EXPLICIT_INSTANTIATION (fn
))
1533 error ("specialization of %qD after instantiation",
1535 return error_mark_node
;
1540 /* This situation should occur only if the first
1541 specialization is an implicit instantiation, the
1542 second is an explicit specialization, and the
1543 implicit instantiation has not yet been used. That
1544 situation can occur if we have implicitly
1545 instantiated a member function and then specialized
1548 We can also wind up here if a friend declaration that
1549 looked like an instantiation turns out to be a
1552 template <class T> void foo(T);
1553 class S { friend void foo<>(int) };
1554 template <> void foo(int);
1556 We transform the existing DECL in place so that any
1557 pointers to it become pointers to the updated
1560 If there was a definition for the template, but not
1561 for the specialization, we want this to look as if
1562 there were no definition, and vice versa. */
1563 DECL_INITIAL (fn
) = NULL_TREE
;
1564 duplicate_decls (spec
, fn
, is_friend
);
1565 /* The call to duplicate_decls will have applied
1568 An explicit specialization of a function template
1569 is inline only if it is explicitly declared to be,
1570 and independently of whether its function template
1573 to the primary function; now copy the inline bits to
1574 the various clones. */
1575 FOR_EACH_CLONE (clone
, fn
)
1577 DECL_DECLARED_INLINE_P (clone
)
1578 = DECL_DECLARED_INLINE_P (fn
);
1579 DECL_SOURCE_LOCATION (clone
)
1580 = DECL_SOURCE_LOCATION (fn
);
1581 DECL_DELETED_FN (clone
)
1582 = DECL_DELETED_FN (fn
);
1584 check_specialization_namespace (tmpl
);
1589 else if (DECL_TEMPLATE_SPECIALIZATION (fn
))
1591 if (!duplicate_decls (spec
, fn
, is_friend
) && DECL_INITIAL (spec
))
1592 /* Dup decl failed, but this is a new definition. Set the
1593 line number so any errors match this new
1595 DECL_SOURCE_LOCATION (fn
) = DECL_SOURCE_LOCATION (spec
);
1601 return duplicate_decls (spec
, fn
, is_friend
);
1603 /* A specialization must be declared in the same namespace as the
1604 template it is specializing. */
1605 if (DECL_P (spec
) && DECL_TEMPLATE_SPECIALIZATION (spec
)
1606 && !check_specialization_namespace (tmpl
))
1607 DECL_CONTEXT (spec
) = DECL_CONTEXT (tmpl
);
1609 if (slot
!= NULL
/* !optimize_specialization_lookup_p (tmpl) */)
1611 spec_entry
*entry
= ggc_alloc
<spec_entry
> ();
1612 gcc_assert (tmpl
&& args
&& spec
);
1615 if ((TREE_CODE (spec
) == FUNCTION_DECL
&& DECL_NAMESPACE_SCOPE_P (spec
)
1616 && PRIMARY_TEMPLATE_P (tmpl
)
1617 && DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (tmpl
)) == NULL_TREE
)
1618 || variable_template_p (tmpl
))
1619 /* If TMPL is a forward declaration of a template function, keep a list
1620 of all specializations in case we need to reassign them to a friend
1621 template later in tsubst_friend_function.
1623 Also keep a list of all variable template instantiations so that
1624 process_partial_specialization can check whether a later partial
1625 specialization would have used it. */
1626 DECL_TEMPLATE_INSTANTIATIONS (tmpl
)
1627 = tree_cons (args
, spec
, DECL_TEMPLATE_INSTANTIATIONS (tmpl
));
1633 /* Returns true iff two spec_entry nodes are equivalent. */
1635 int comparing_specializations
;
1638 spec_hasher::equal (spec_entry
*e1
, spec_entry
*e2
)
1642 ++comparing_specializations
;
1643 equal
= (e1
->tmpl
== e2
->tmpl
1644 && comp_template_args (e1
->args
, e2
->args
));
1645 if (equal
&& flag_concepts
1646 /* tmpl could be a FIELD_DECL for a capture pack. */
1647 && TREE_CODE (e1
->tmpl
) == TEMPLATE_DECL
1648 && VAR_P (DECL_TEMPLATE_RESULT (e1
->tmpl
))
1649 && uses_template_parms (e1
->args
))
1651 /* Partial specializations of a variable template can be distinguished by
1653 tree c1
= e1
->spec
? get_constraints (e1
->spec
) : NULL_TREE
;
1654 tree c2
= e2
->spec
? get_constraints (e2
->spec
) : NULL_TREE
;
1655 equal
= equivalent_constraints (c1
, c2
);
1657 --comparing_specializations
;
1662 /* Returns a hash for a template TMPL and template arguments ARGS. */
1665 hash_tmpl_and_args (tree tmpl
, tree args
)
1667 hashval_t val
= iterative_hash_object (DECL_UID (tmpl
), 0);
1668 return iterative_hash_template_arg (args
, val
);
1671 /* Returns a hash for a spec_entry node based on the TMPL and ARGS members,
1675 spec_hasher::hash (spec_entry
*e
)
1677 return hash_tmpl_and_args (e
->tmpl
, e
->args
);
1680 /* Recursively calculate a hash value for a template argument ARG, for use
1681 in the hash tables of template specializations. */
1684 iterative_hash_template_arg (tree arg
, hashval_t val
)
1686 unsigned HOST_WIDE_INT i
;
1687 enum tree_code code
;
1690 if (arg
== NULL_TREE
)
1691 return iterative_hash_object (arg
, val
);
1696 if (TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
1697 /* We can get one of these when re-hashing a previous entry in the middle
1698 of substituting into a pack expansion. Just look through it. */
1699 arg
= ARGUMENT_PACK_SELECT_FROM_PACK (arg
);
1701 code
= TREE_CODE (arg
);
1702 tclass
= TREE_CODE_CLASS (code
);
1704 val
= iterative_hash_object (code
, val
);
1711 case IDENTIFIER_NODE
:
1712 return iterative_hash_object (IDENTIFIER_HASH_VALUE (arg
), val
);
1716 int i
, len
= TREE_VEC_LENGTH (arg
);
1717 for (i
= 0; i
< len
; ++i
)
1718 val
= iterative_hash_template_arg (TREE_VEC_ELT (arg
, i
), val
);
1722 case TYPE_PACK_EXPANSION
:
1723 case EXPR_PACK_EXPANSION
:
1724 val
= iterative_hash_template_arg (PACK_EXPANSION_PATTERN (arg
), val
);
1725 return iterative_hash_template_arg (PACK_EXPANSION_EXTRA_ARGS (arg
), val
);
1727 case TYPE_ARGUMENT_PACK
:
1728 case NONTYPE_ARGUMENT_PACK
:
1729 return iterative_hash_template_arg (ARGUMENT_PACK_ARGS (arg
), val
);
1732 for (; arg
; arg
= TREE_CHAIN (arg
))
1733 val
= iterative_hash_template_arg (TREE_VALUE (arg
), val
);
1737 for (; arg
; arg
= OVL_NEXT (arg
))
1738 val
= iterative_hash_template_arg (OVL_CURRENT (arg
), val
);
1744 iterative_hash_template_arg (TREE_TYPE (arg
), val
);
1745 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (arg
), i
, field
, value
)
1747 val
= iterative_hash_template_arg (field
, val
);
1748 val
= iterative_hash_template_arg (value
, val
);
1754 if (!DECL_ARTIFICIAL (arg
))
1756 val
= iterative_hash_object (DECL_PARM_INDEX (arg
), val
);
1757 val
= iterative_hash_object (DECL_PARM_LEVEL (arg
), val
);
1759 return iterative_hash_template_arg (TREE_TYPE (arg
), val
);
1762 return iterative_hash_template_arg (TARGET_EXPR_INITIAL (arg
), val
);
1765 val
= iterative_hash_template_arg (PTRMEM_CST_CLASS (arg
), val
);
1766 return iterative_hash_template_arg (PTRMEM_CST_MEMBER (arg
), val
);
1768 case TEMPLATE_PARM_INDEX
:
1769 val
= iterative_hash_template_arg
1770 (TREE_TYPE (TEMPLATE_PARM_DECL (arg
)), val
);
1771 val
= iterative_hash_object (TEMPLATE_PARM_LEVEL (arg
), val
);
1772 return iterative_hash_object (TEMPLATE_PARM_IDX (arg
), val
);
1775 val
= iterative_hash_object (TRAIT_EXPR_KIND (arg
), val
);
1776 val
= iterative_hash_template_arg (TRAIT_EXPR_TYPE1 (arg
), val
);
1777 return iterative_hash_template_arg (TRAIT_EXPR_TYPE2 (arg
), val
);
1780 val
= iterative_hash_template_arg (BINFO_TYPE (BASELINK_BINFO (arg
)),
1782 return iterative_hash_template_arg (DECL_NAME (get_first_fn (arg
)),
1786 val
= iterative_hash_template_arg (TREE_OPERAND (arg
, 0), val
);
1787 code
= TREE_CODE (TREE_OPERAND (arg
, 1));
1788 val
= iterative_hash_object (code
, val
);
1789 return iterative_hash_template_arg (TREE_OPERAND (arg
, 2), val
);
1792 /* A lambda can't appear in a template arg, but don't crash on
1794 gcc_assert (seen_error ());
1798 case IMPLICIT_CONV_EXPR
:
1799 case STATIC_CAST_EXPR
:
1800 case REINTERPRET_CAST_EXPR
:
1801 case CONST_CAST_EXPR
:
1802 case DYNAMIC_CAST_EXPR
:
1804 val
= iterative_hash_template_arg (TREE_TYPE (arg
), val
);
1805 /* Now hash operands as usual. */
1815 if (alias_template_specialization_p (arg
))
1817 // We want an alias specialization that survived strip_typedefs
1818 // to hash differently from its TYPE_CANONICAL, to avoid hash
1819 // collisions that compare as different in template_args_equal.
1820 // These could be dependent specializations that strip_typedefs
1821 // left alone, or untouched specializations because
1822 // coerce_template_parms returns the unconverted template
1823 // arguments if it sees incomplete argument packs.
1824 tree ti
= TYPE_TEMPLATE_INFO (arg
);
1825 return hash_tmpl_and_args (TI_TEMPLATE (ti
), TI_ARGS (ti
));
1827 if (TYPE_CANONICAL (arg
))
1828 return iterative_hash_object (TYPE_HASH (TYPE_CANONICAL (arg
)),
1830 else if (TREE_CODE (arg
) == DECLTYPE_TYPE
)
1831 return iterative_hash_template_arg (DECLTYPE_TYPE_EXPR (arg
), val
);
1832 /* Otherwise just compare the types during lookup. */
1835 case tcc_declaration
:
1837 return iterative_hash_expr (arg
, val
);
1840 gcc_assert (IS_EXPR_CODE_CLASS (tclass
));
1842 unsigned n
= cp_tree_operand_length (arg
);
1843 for (i
= 0; i
< n
; ++i
)
1844 val
= iterative_hash_template_arg (TREE_OPERAND (arg
, i
), val
);
1852 /* Unregister the specialization SPEC as a specialization of TMPL.
1853 Replace it with NEW_SPEC, if NEW_SPEC is non-NULL. Returns true
1854 if the SPEC was listed as a specialization of TMPL.
1856 Note that SPEC has been ggc_freed, so we can't look inside it. */
1859 reregister_specialization (tree spec
, tree tinfo
, tree new_spec
)
1864 elt
.tmpl
= most_general_template (TI_TEMPLATE (tinfo
));
1865 elt
.args
= TI_ARGS (tinfo
);
1866 elt
.spec
= NULL_TREE
;
1868 entry
= decl_specializations
->find (&elt
);
1871 gcc_assert (entry
->spec
== spec
|| entry
->spec
== new_spec
);
1872 gcc_assert (new_spec
!= NULL_TREE
);
1873 entry
->spec
= new_spec
;
1880 /* Like register_specialization, but for local declarations. We are
1881 registering SPEC, an instantiation of TMPL. */
1884 register_local_specialization (tree spec
, tree tmpl
)
1886 local_specializations
->put (tmpl
, spec
);
1889 /* TYPE is a class type. Returns true if TYPE is an explicitly
1890 specialized class. */
1893 explicit_class_specialization_p (tree type
)
1895 if (!CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
1897 return !uses_template_parms (CLASSTYPE_TI_ARGS (type
));
1900 /* Print the list of functions at FNS, going through all the overloads
1901 for each element of the list. Alternatively, FNS can not be a
1902 TREE_LIST, in which case it will be printed together with all the
1905 MORE and *STR should respectively be FALSE and NULL when the function
1906 is called from the outside. They are used internally on recursive
1907 calls. print_candidates manages the two parameters and leaves NULL
1908 in *STR when it ends. */
1911 print_candidates_1 (tree fns
, bool more
, const char **str
)
1914 char *spaces
= NULL
;
1916 for (fn
= fns
; fn
; fn
= OVL_NEXT (fn
))
1917 if (TREE_CODE (fn
) == TREE_LIST
)
1919 for (fn2
= fn
; fn2
!= NULL_TREE
; fn2
= TREE_CHAIN (fn2
))
1920 print_candidates_1 (TREE_VALUE (fn2
),
1921 TREE_CHAIN (fn2
) || more
, str
);
1925 tree cand
= OVL_CURRENT (fn
);
1928 /* Pick the prefix string. */
1929 if (!more
&& !OVL_NEXT (fns
))
1931 inform (DECL_SOURCE_LOCATION (cand
),
1932 "candidate is: %#D", cand
);
1936 *str
= _("candidates are:");
1937 spaces
= get_spaces (*str
);
1939 inform (DECL_SOURCE_LOCATION (cand
), "%s %#D", *str
, cand
);
1940 *str
= spaces
? spaces
: *str
;
1950 /* Print the list of candidate FNS in an error message. FNS can also
1951 be a TREE_LIST of non-functions in the case of an ambiguous lookup. */
1954 print_candidates (tree fns
)
1956 const char *str
= NULL
;
1957 print_candidates_1 (fns
, false, &str
);
1958 gcc_assert (str
== NULL
);
1961 /* Get a (possibly) constrained template declaration for the
1962 purpose of ordering candidates. */
1964 get_template_for_ordering (tree list
)
1966 gcc_assert (TREE_CODE (list
) == TREE_LIST
);
1967 tree f
= TREE_VALUE (list
);
1968 if (tree ti
= DECL_TEMPLATE_INFO (f
))
1969 return TI_TEMPLATE (ti
);
1973 /* Among candidates having the same signature, return the
1974 most constrained or NULL_TREE if there is no best candidate.
1975 If the signatures of candidates vary (e.g., template
1976 specialization vs. member function), then there can be no
1979 Note that we don't compare constraints on the functions
1980 themselves, but rather those of their templates. */
1982 most_constrained_function (tree candidates
)
1984 // Try to find the best candidate in a first pass.
1985 tree champ
= candidates
;
1986 for (tree c
= TREE_CHAIN (champ
); c
; c
= TREE_CHAIN (c
))
1988 int winner
= more_constrained (get_template_for_ordering (champ
),
1989 get_template_for_ordering (c
));
1991 champ
= c
; // The candidate is more constrained
1992 else if (winner
== 0)
1993 return NULL_TREE
; // Neither is more constrained
1996 // Verify that the champ is better than previous candidates.
1997 for (tree c
= candidates
; c
!= champ
; c
= TREE_CHAIN (c
)) {
1998 if (!more_constrained (get_template_for_ordering (champ
),
1999 get_template_for_ordering (c
)))
2007 /* Returns the template (one of the functions given by TEMPLATE_ID)
2008 which can be specialized to match the indicated DECL with the
2009 explicit template args given in TEMPLATE_ID. The DECL may be
2010 NULL_TREE if none is available. In that case, the functions in
2011 TEMPLATE_ID are non-members.
2013 If NEED_MEMBER_TEMPLATE is nonzero the function is known to be a
2014 specialization of a member template.
2016 The TEMPLATE_COUNT is the number of references to qualifying
2017 template classes that appeared in the name of the function. See
2018 check_explicit_specialization for a more accurate description.
2020 TSK indicates what kind of template declaration (if any) is being
2021 declared. TSK_TEMPLATE indicates that the declaration given by
2022 DECL, though a FUNCTION_DECL, has template parameters, and is
2023 therefore a template function.
2025 The template args (those explicitly specified and those deduced)
2026 are output in a newly created vector *TARGS_OUT.
2028 If it is impossible to determine the result, an error message is
2029 issued. The error_mark_node is returned to indicate failure. */
2032 determine_specialization (tree template_id
,
2035 int need_member_template
,
2041 tree explicit_targs
;
2042 tree candidates
= NULL_TREE
;
2044 /* A TREE_LIST of templates of which DECL may be a specialization.
2045 The TREE_VALUE of each node is a TEMPLATE_DECL. The
2046 corresponding TREE_PURPOSE is the set of template arguments that,
2047 when used to instantiate the template, would produce a function
2048 with the signature of DECL. */
2049 tree templates
= NULL_TREE
;
2051 cp_binding_level
*b
;
2053 *targs_out
= NULL_TREE
;
2055 if (template_id
== error_mark_node
|| decl
== error_mark_node
)
2056 return error_mark_node
;
2058 /* We shouldn't be specializing a member template of an
2059 unspecialized class template; we already gave an error in
2060 check_specialization_scope, now avoid crashing. */
2061 if (template_count
&& DECL_CLASS_SCOPE_P (decl
)
2062 && template_class_depth (DECL_CONTEXT (decl
)) > 0)
2064 gcc_assert (errorcount
);
2065 return error_mark_node
;
2068 fns
= TREE_OPERAND (template_id
, 0);
2069 explicit_targs
= TREE_OPERAND (template_id
, 1);
2071 if (fns
== error_mark_node
)
2072 return error_mark_node
;
2074 /* Check for baselinks. */
2075 if (BASELINK_P (fns
))
2076 fns
= BASELINK_FUNCTIONS (fns
);
2078 if (TREE_CODE (decl
) == FUNCTION_DECL
&& !is_overloaded_fn (fns
))
2080 error ("%qD is not a function template", fns
);
2081 return error_mark_node
;
2083 else if (VAR_P (decl
) && !variable_template_p (fns
))
2085 error ("%qD is not a variable template", fns
);
2086 return error_mark_node
;
2089 /* Count the number of template headers specified for this
2092 for (b
= current_binding_level
;
2093 b
->kind
== sk_template_parms
;
2097 tree orig_fns
= fns
;
2099 if (variable_template_p (fns
))
2101 tree parms
= INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (fns
));
2102 targs
= coerce_template_parms (parms
, explicit_targs
, fns
,
2103 tf_warning_or_error
,
2104 /*req_all*/true, /*use_defarg*/true);
2105 if (targs
!= error_mark_node
)
2106 templates
= tree_cons (targs
, fns
, templates
);
2108 else for (; fns
; fns
= OVL_NEXT (fns
))
2110 tree fn
= OVL_CURRENT (fns
);
2112 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
2114 tree decl_arg_types
;
2118 /* In case of explicit specialization, we need to check if
2119 the number of template headers appearing in the specialization
2120 is correct. This is usually done in check_explicit_specialization,
2121 but the check done there cannot be exhaustive when specializing
2122 member functions. Consider the following code:
2124 template <> void A<int>::f(int);
2125 template <> template <> void A<int>::f(int);
2127 Assuming that A<int> is not itself an explicit specialization
2128 already, the first line specializes "f" which is a non-template
2129 member function, whilst the second line specializes "f" which
2130 is a template member function. So both lines are syntactically
2131 correct, and check_explicit_specialization does not reject
2134 Here, we can do better, as we are matching the specialization
2135 against the declarations. We count the number of template
2136 headers, and we check if they match TEMPLATE_COUNT + 1
2137 (TEMPLATE_COUNT is the number of qualifying template classes,
2138 plus there must be another header for the member template
2141 Notice that if header_count is zero, this is not a
2142 specialization but rather a template instantiation, so there
2143 is no check we can perform here. */
2144 if (header_count
&& header_count
!= template_count
+ 1)
2147 /* Check that the number of template arguments at the
2148 innermost level for DECL is the same as for FN. */
2149 if (current_binding_level
->kind
== sk_template_parms
2150 && !current_binding_level
->explicit_spec_p
2151 && (TREE_VEC_LENGTH (DECL_INNERMOST_TEMPLATE_PARMS (fn
))
2152 != TREE_VEC_LENGTH (INNERMOST_TEMPLATE_PARMS
2153 (current_template_parms
))))
2156 /* DECL might be a specialization of FN. */
2157 decl_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
2158 fn_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
2160 /* For a non-static member function, we need to make sure
2161 that the const qualification is the same. Since
2162 get_bindings does not try to merge the "this" parameter,
2163 we must do the comparison explicitly. */
2164 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
2165 && !same_type_p (TREE_VALUE (fn_arg_types
),
2166 TREE_VALUE (decl_arg_types
)))
2169 /* Skip the "this" parameter and, for constructors of
2170 classes with virtual bases, the VTT parameter. A
2171 full specialization of a constructor will have a VTT
2172 parameter, but a template never will. */
2174 = skip_artificial_parms_for (decl
, decl_arg_types
);
2176 = skip_artificial_parms_for (fn
, fn_arg_types
);
2178 /* Function templates cannot be specializations; there are
2179 no partial specializations of functions. Therefore, if
2180 the type of DECL does not match FN, there is no
2183 Note that it should never be the case that we have both
2184 candidates added here, and for regular member functions
2186 if (tsk
== tsk_template
)
2188 if (compparms (fn_arg_types
, decl_arg_types
))
2189 candidates
= tree_cons (NULL_TREE
, fn
, candidates
);
2193 /* See whether this function might be a specialization of this
2194 template. Suppress access control because we might be trying
2195 to make this specialization a friend, and we have already done
2196 access control for the declaration of the specialization. */
2197 push_deferring_access_checks (dk_no_check
);
2198 targs
= get_bindings (fn
, decl
, explicit_targs
, /*check_ret=*/true);
2199 pop_deferring_access_checks ();
2202 /* We cannot deduce template arguments that when used to
2203 specialize TMPL will produce DECL. */
2206 /* Remove, from the set of candidates, all those functions
2207 whose constraints are not satisfied. */
2208 if (flag_concepts
&& !constraints_satisfied_p (fn
, targs
))
2211 // Then, try to form the new function type.
2212 insttype
= tsubst (TREE_TYPE (fn
), targs
, tf_none
, NULL_TREE
);
2213 if (insttype
== error_mark_node
)
2216 = skip_artificial_parms_for (fn
, TYPE_ARG_TYPES (insttype
));
2217 if (!compparms (fn_arg_types
, decl_arg_types
))
2220 /* Save this template, and the arguments deduced. */
2221 templates
= tree_cons (targs
, fn
, templates
);
2223 else if (need_member_template
)
2224 /* FN is an ordinary member function, and we need a
2225 specialization of a member template. */
2227 else if (TREE_CODE (fn
) != FUNCTION_DECL
)
2228 /* We can get IDENTIFIER_NODEs here in certain erroneous
2231 else if (!DECL_FUNCTION_MEMBER_P (fn
))
2232 /* This is just an ordinary non-member function. Nothing can
2233 be a specialization of that. */
2235 else if (DECL_ARTIFICIAL (fn
))
2236 /* Cannot specialize functions that are created implicitly. */
2240 tree decl_arg_types
;
2242 /* This is an ordinary member function. However, since
2243 we're here, we can assume its enclosing class is a
2244 template class. For example,
2246 template <typename T> struct S { void f(); };
2247 template <> void S<int>::f() {}
2249 Here, S<int>::f is a non-template, but S<int> is a
2250 template class. If FN has the same type as DECL, we
2251 might be in business. */
2253 if (!DECL_TEMPLATE_INFO (fn
))
2254 /* Its enclosing class is an explicit specialization
2255 of a template class. This is not a candidate. */
2258 if (!same_type_p (TREE_TYPE (TREE_TYPE (decl
)),
2259 TREE_TYPE (TREE_TYPE (fn
))))
2260 /* The return types differ. */
2263 /* Adjust the type of DECL in case FN is a static member. */
2264 decl_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
2265 if (DECL_STATIC_FUNCTION_P (fn
)
2266 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
2267 decl_arg_types
= TREE_CHAIN (decl_arg_types
);
2269 if (!compparms (TYPE_ARG_TYPES (TREE_TYPE (fn
)),
2273 // If the deduced arguments do not satisfy the constraints,
2274 // this is not a candidate.
2275 if (flag_concepts
&& !constraints_satisfied_p (fn
))
2278 // Add the candidate.
2279 candidates
= tree_cons (NULL_TREE
, fn
, candidates
);
2283 if (templates
&& TREE_CHAIN (templates
))
2289 It is possible for a specialization with a given function
2290 signature to be instantiated from more than one function
2291 template. In such cases, explicit specification of the
2292 template arguments must be used to uniquely identify the
2293 function template specialization being specialized.
2295 Note that here, there's no suggestion that we're supposed to
2296 determine which of the candidate templates is most
2297 specialized. However, we, also have:
2301 Partial ordering of overloaded function template
2302 declarations is used in the following contexts to select
2303 the function template to which a function template
2304 specialization refers:
2306 -- when an explicit specialization refers to a function
2309 So, we do use the partial ordering rules, at least for now.
2310 This extension can only serve to make invalid programs valid,
2311 so it's safe. And, there is strong anecdotal evidence that
2312 the committee intended the partial ordering rules to apply;
2313 the EDG front end has that behavior, and John Spicer claims
2314 that the committee simply forgot to delete the wording in
2315 [temp.expl.spec]. */
2316 tree tmpl
= most_specialized_instantiation (templates
);
2317 if (tmpl
!= error_mark_node
)
2320 TREE_CHAIN (templates
) = NULL_TREE
;
2324 // Concepts allows multiple declarations of member functions
2325 // with the same signature. Like above, we need to rely on
2326 // on the partial ordering of those candidates to determine which
2328 if (flag_concepts
&& candidates
&& TREE_CHAIN (candidates
))
2330 if (tree cand
= most_constrained_function (candidates
))
2333 TREE_CHAIN (cand
) = NULL_TREE
;
2337 if (templates
== NULL_TREE
&& candidates
== NULL_TREE
)
2339 error ("template-id %qD for %q+D does not match any template "
2340 "declaration", template_id
, decl
);
2341 if (header_count
&& header_count
!= template_count
+ 1)
2342 inform (input_location
, "saw %d %<template<>%>, need %d for "
2343 "specializing a member function template",
2344 header_count
, template_count
+ 1);
2346 print_candidates (orig_fns
);
2347 return error_mark_node
;
2349 else if ((templates
&& TREE_CHAIN (templates
))
2350 || (candidates
&& TREE_CHAIN (candidates
))
2351 || (templates
&& candidates
))
2353 error ("ambiguous template specialization %qD for %q+D",
2355 candidates
= chainon (candidates
, templates
);
2356 print_candidates (candidates
);
2357 return error_mark_node
;
2360 /* We have one, and exactly one, match. */
2363 tree fn
= TREE_VALUE (candidates
);
2364 *targs_out
= copy_node (DECL_TI_ARGS (fn
));
2366 // Propagate the candidate's constraints to the declaration.
2367 set_constraints (decl
, get_constraints (fn
));
2369 /* DECL is a re-declaration or partial instantiation of a template
2371 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
2373 /* It was a specialization of an ordinary member function in a
2375 return DECL_TI_TEMPLATE (fn
);
2378 /* It was a specialization of a template. */
2379 targs
= DECL_TI_ARGS (DECL_TEMPLATE_RESULT (TREE_VALUE (templates
)));
2380 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (targs
))
2382 *targs_out
= copy_node (targs
);
2383 SET_TMPL_ARGS_LEVEL (*targs_out
,
2384 TMPL_ARGS_DEPTH (*targs_out
),
2385 TREE_PURPOSE (templates
));
2388 *targs_out
= TREE_PURPOSE (templates
);
2389 return TREE_VALUE (templates
);
2392 /* Returns a chain of parameter types, exactly like the SPEC_TYPES,
2393 but with the default argument values filled in from those in the
2397 copy_default_args_to_explicit_spec_1 (tree spec_types
,
2400 tree new_spec_types
;
2405 if (spec_types
== void_list_node
)
2406 return void_list_node
;
2408 /* Substitute into the rest of the list. */
2410 copy_default_args_to_explicit_spec_1 (TREE_CHAIN (spec_types
),
2411 TREE_CHAIN (tmpl_types
));
2413 /* Add the default argument for this parameter. */
2414 return hash_tree_cons (TREE_PURPOSE (tmpl_types
),
2415 TREE_VALUE (spec_types
),
2419 /* DECL is an explicit specialization. Replicate default arguments
2420 from the template it specializes. (That way, code like:
2422 template <class T> void f(T = 3);
2423 template <> void f(double);
2426 works, as required.) An alternative approach would be to look up
2427 the correct default arguments at the call-site, but this approach
2428 is consistent with how implicit instantiations are handled. */
2431 copy_default_args_to_explicit_spec (tree decl
)
2436 tree new_spec_types
;
2440 tree object_type
= NULL_TREE
;
2441 tree in_charge
= NULL_TREE
;
2442 tree vtt
= NULL_TREE
;
2444 /* See if there's anything we need to do. */
2445 tmpl
= DECL_TI_TEMPLATE (decl
);
2446 tmpl_types
= TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (tmpl
)));
2447 for (t
= tmpl_types
; t
; t
= TREE_CHAIN (t
))
2448 if (TREE_PURPOSE (t
))
2453 old_type
= TREE_TYPE (decl
);
2454 spec_types
= TYPE_ARG_TYPES (old_type
);
2456 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
2458 /* Remove the this pointer, but remember the object's type for
2460 object_type
= TREE_TYPE (TREE_VALUE (spec_types
));
2461 spec_types
= TREE_CHAIN (spec_types
);
2462 tmpl_types
= TREE_CHAIN (tmpl_types
);
2464 if (DECL_HAS_IN_CHARGE_PARM_P (decl
))
2466 /* DECL may contain more parameters than TMPL due to the extra
2467 in-charge parameter in constructors and destructors. */
2468 in_charge
= spec_types
;
2469 spec_types
= TREE_CHAIN (spec_types
);
2471 if (DECL_HAS_VTT_PARM_P (decl
))
2474 spec_types
= TREE_CHAIN (spec_types
);
2478 /* Compute the merged default arguments. */
2480 copy_default_args_to_explicit_spec_1 (spec_types
, tmpl_types
);
2482 /* Compute the new FUNCTION_TYPE. */
2486 new_spec_types
= hash_tree_cons (TREE_PURPOSE (vtt
),
2491 /* Put the in-charge parameter back. */
2492 new_spec_types
= hash_tree_cons (TREE_PURPOSE (in_charge
),
2493 TREE_VALUE (in_charge
),
2496 new_type
= build_method_type_directly (object_type
,
2497 TREE_TYPE (old_type
),
2501 new_type
= build_function_type (TREE_TYPE (old_type
),
2503 new_type
= cp_build_type_attribute_variant (new_type
,
2504 TYPE_ATTRIBUTES (old_type
));
2505 new_type
= build_exception_variant (new_type
,
2506 TYPE_RAISES_EXCEPTIONS (old_type
));
2508 if (TYPE_HAS_LATE_RETURN_TYPE (old_type
))
2509 TYPE_HAS_LATE_RETURN_TYPE (new_type
) = 1;
2511 TREE_TYPE (decl
) = new_type
;
2514 /* Return the number of template headers we expect to see for a definition
2515 or specialization of CTYPE or one of its non-template members. */
2518 num_template_headers_for_class (tree ctype
)
2520 int num_templates
= 0;
2522 while (ctype
&& CLASS_TYPE_P (ctype
))
2524 /* You're supposed to have one `template <...>' for every
2525 template class, but you don't need one for a full
2526 specialization. For example:
2528 template <class T> struct S{};
2529 template <> struct S<int> { void f(); };
2530 void S<int>::f () {}
2532 is correct; there shouldn't be a `template <>' for the
2533 definition of `S<int>::f'. */
2534 if (!CLASSTYPE_TEMPLATE_INFO (ctype
))
2535 /* If CTYPE does not have template information of any
2536 kind, then it is not a template, nor is it nested
2537 within a template. */
2539 if (explicit_class_specialization_p (ctype
))
2541 if (PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (ctype
)))
2544 ctype
= TYPE_CONTEXT (ctype
);
2547 return num_templates
;
2550 /* Do a simple sanity check on the template headers that precede the
2551 variable declaration DECL. */
2554 check_template_variable (tree decl
)
2556 tree ctx
= CP_DECL_CONTEXT (decl
);
2557 int wanted
= num_template_headers_for_class (ctx
);
2558 if (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
)
2559 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl
)))
2561 if (cxx_dialect
< cxx14
)
2562 pedwarn (DECL_SOURCE_LOCATION (decl
), 0,
2563 "variable templates only available with "
2564 "-std=c++14 or -std=gnu++14");
2566 // Namespace-scope variable templates should have a template header.
2569 if (template_header_count
> wanted
)
2571 bool warned
= pedwarn (DECL_SOURCE_LOCATION (decl
), 0,
2572 "too many template headers for %D (should be %d)",
2574 if (warned
&& CLASS_TYPE_P (ctx
)
2575 && CLASSTYPE_TEMPLATE_SPECIALIZATION (ctx
))
2576 inform (DECL_SOURCE_LOCATION (decl
),
2577 "members of an explicitly specialized class are defined "
2578 "without a template header");
2582 /* Check to see if the function just declared, as indicated in
2583 DECLARATOR, and in DECL, is a specialization of a function
2584 template. We may also discover that the declaration is an explicit
2585 instantiation at this point.
2587 Returns DECL, or an equivalent declaration that should be used
2588 instead if all goes well. Issues an error message if something is
2589 amiss. Returns error_mark_node if the error is not easily
2592 FLAGS is a bitmask consisting of the following flags:
2594 2: The function has a definition.
2595 4: The function is a friend.
2597 The TEMPLATE_COUNT is the number of references to qualifying
2598 template classes that appeared in the name of the function. For
2601 template <class T> struct S { void f(); };
2604 the TEMPLATE_COUNT would be 1. However, explicitly specialized
2605 classes are not counted in the TEMPLATE_COUNT, so that in
2607 template <class T> struct S {};
2608 template <> struct S<int> { void f(); }
2609 template <> void S<int>::f();
2611 the TEMPLATE_COUNT would be 0. (Note that this declaration is
2612 invalid; there should be no template <>.)
2614 If the function is a specialization, it is marked as such via
2615 DECL_TEMPLATE_SPECIALIZATION. Furthermore, its DECL_TEMPLATE_INFO
2616 is set up correctly, and it is added to the list of specializations
2617 for that template. */
2620 check_explicit_specialization (tree declarator
,
2625 int have_def
= flags
& 2;
2626 int is_friend
= flags
& 4;
2627 bool is_concept
= flags
& 8;
2628 int specialization
= 0;
2629 int explicit_instantiation
= 0;
2630 int member_specialization
= 0;
2631 tree ctype
= DECL_CLASS_CONTEXT (decl
);
2632 tree dname
= DECL_NAME (decl
);
2637 if (!processing_specialization
)
2640 tsk
= tsk_excessive_parms
;
2643 tsk
= current_tmpl_spec_kind (template_count
);
2648 if (processing_specialization
&& !VAR_P (decl
))
2651 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
2653 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
2656 /* This could be something like:
2658 template <class T> void f(T);
2659 class S { friend void f<>(int); } */
2663 /* This case handles bogus declarations like template <>
2664 template <class T> void f<int>(); */
2666 error ("template-id %qD in declaration of primary template",
2673 case tsk_invalid_member_spec
:
2674 /* The error has already been reported in
2675 check_specialization_scope. */
2676 return error_mark_node
;
2678 case tsk_invalid_expl_inst
:
2679 error ("template parameter list used in explicit instantiation");
2685 error ("definition provided for explicit instantiation");
2687 explicit_instantiation
= 1;
2690 case tsk_excessive_parms
:
2691 case tsk_insufficient_parms
:
2692 if (tsk
== tsk_excessive_parms
)
2693 error ("too many template parameter lists in declaration of %qD",
2695 else if (template_header_count
)
2696 error("too few template parameter lists in declaration of %qD", decl
);
2698 error("explicit specialization of %qD must be introduced by "
2699 "%<template <>%>", decl
);
2704 error ("explicit specialization declared %<concept%>");
2706 if (VAR_P (decl
) && TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
2707 /* In cases like template<> constexpr bool v = true;
2708 We'll give an error in check_template_variable. */
2711 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
2713 member_specialization
= 1;
2719 if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
2721 /* This case handles bogus declarations like template <>
2722 template <class T> void f<int>(); */
2724 if (!uses_template_parms (declarator
))
2725 error ("template-id %qD in declaration of primary template",
2727 else if (variable_template_p (TREE_OPERAND (declarator
, 0)))
2729 /* Partial specialization of variable template. */
2730 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
2734 else if (cxx_dialect
< cxx14
)
2735 error ("non-type partial specialization %qD "
2736 "is not allowed", declarator
);
2738 error ("non-class, non-variable partial specialization %qD "
2739 "is not allowed", declarator
);
2744 if (ctype
&& CLASSTYPE_TEMPLATE_INSTANTIATION (ctype
))
2745 /* This is a specialization of a member template, without
2746 specialization the containing class. Something like:
2748 template <class T> struct S {
2749 template <class U> void f (U);
2751 template <> template <class U> void S<int>::f(U) {}
2753 That's a specialization -- but of the entire template. */
2761 if ((specialization
|| member_specialization
)
2762 /* This doesn't apply to variable templates. */
2763 && (TREE_CODE (TREE_TYPE (decl
)) == FUNCTION_TYPE
2764 || TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
))
2766 tree t
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
2767 for (; t
; t
= TREE_CHAIN (t
))
2768 if (TREE_PURPOSE (t
))
2770 permerror (input_location
,
2771 "default argument specified in explicit specialization");
2776 if (specialization
|| member_specialization
|| explicit_instantiation
)
2778 tree tmpl
= NULL_TREE
;
2779 tree targs
= NULL_TREE
;
2780 bool was_template_id
= (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
);
2782 /* Make sure that the declarator is a TEMPLATE_ID_EXPR. */
2783 if (!was_template_id
)
2787 gcc_assert (identifier_p (declarator
));
2792 /* If there is no class context, the explicit instantiation
2793 must be at namespace scope. */
2794 gcc_assert (DECL_NAMESPACE_SCOPE_P (decl
));
2796 /* Find the namespace binding, using the declaration
2798 fns
= lookup_qualified_name (CP_DECL_CONTEXT (decl
), dname
,
2800 if (fns
== error_mark_node
|| !is_overloaded_fn (fns
))
2802 error ("%qD is not a template function", dname
);
2803 fns
= error_mark_node
;
2807 declarator
= lookup_template_function (fns
, NULL_TREE
);
2810 if (declarator
== error_mark_node
)
2811 return error_mark_node
;
2813 if (ctype
!= NULL_TREE
&& TYPE_BEING_DEFINED (ctype
))
2815 if (!explicit_instantiation
)
2816 /* A specialization in class scope. This is invalid,
2817 but the error will already have been flagged by
2818 check_specialization_scope. */
2819 return error_mark_node
;
2822 /* It's not valid to write an explicit instantiation in
2825 class C { template void f(); }
2827 This case is caught by the parser. However, on
2830 template class C { void f(); };
2832 (which is invalid) we can get here. The error will be
2839 else if (ctype
!= NULL_TREE
2840 && (identifier_p (TREE_OPERAND (declarator
, 0))))
2842 // We'll match variable templates in start_decl.
2846 /* Find the list of functions in ctype that have the same
2847 name as the declared function. */
2848 tree name
= TREE_OPERAND (declarator
, 0);
2849 tree fns
= NULL_TREE
;
2852 if (constructor_name_p (name
, ctype
))
2854 int is_constructor
= DECL_CONSTRUCTOR_P (decl
);
2856 if (is_constructor
? !TYPE_HAS_USER_CONSTRUCTOR (ctype
)
2857 : !CLASSTYPE_DESTRUCTORS (ctype
))
2859 /* From [temp.expl.spec]:
2861 If such an explicit specialization for the member
2862 of a class template names an implicitly-declared
2863 special member function (clause _special_), the
2864 program is ill-formed.
2866 Similar language is found in [temp.explicit]. */
2867 error ("specialization of implicitly-declared special member function");
2868 return error_mark_node
;
2871 name
= is_constructor
? ctor_identifier
: dtor_identifier
;
2874 if (!DECL_CONV_FN_P (decl
))
2876 idx
= lookup_fnfields_1 (ctype
, name
);
2878 fns
= (*CLASSTYPE_METHOD_VEC (ctype
))[idx
];
2882 vec
<tree
, va_gc
> *methods
;
2885 /* For a type-conversion operator, we cannot do a
2886 name-based lookup. We might be looking for `operator
2887 int' which will be a specialization of `operator T'.
2888 So, we find *all* the conversion operators, and then
2889 select from them. */
2892 methods
= CLASSTYPE_METHOD_VEC (ctype
);
2894 for (idx
= CLASSTYPE_FIRST_CONVERSION_SLOT
;
2895 methods
->iterate (idx
, &ovl
);
2898 if (!DECL_CONV_FN_P (OVL_CURRENT (ovl
)))
2899 /* There are no more conversion functions. */
2902 /* Glue all these conversion functions together
2903 with those we already have. */
2904 for (; ovl
; ovl
= OVL_NEXT (ovl
))
2905 fns
= ovl_cons (OVL_CURRENT (ovl
), fns
);
2909 if (fns
== NULL_TREE
)
2911 error ("no member function %qD declared in %qT", name
, ctype
);
2912 return error_mark_node
;
2915 TREE_OPERAND (declarator
, 0) = fns
;
2918 /* Figure out what exactly is being specialized at this point.
2919 Note that for an explicit instantiation, even one for a
2920 member function, we cannot tell apriori whether the
2921 instantiation is for a member template, or just a member
2922 function of a template class. Even if a member template is
2923 being instantiated, the member template arguments may be
2924 elided if they can be deduced from the rest of the
2926 tmpl
= determine_specialization (declarator
, decl
,
2928 member_specialization
,
2932 if (!tmpl
|| tmpl
== error_mark_node
)
2933 /* We couldn't figure out what this declaration was
2935 return error_mark_node
;
2938 if (!ctype
&& !was_template_id
2939 && (specialization
|| member_specialization
2940 || explicit_instantiation
)
2941 && !is_associated_namespace (CP_DECL_CONTEXT (decl
),
2942 CP_DECL_CONTEXT (tmpl
)))
2943 error ("%qD is not declared in %qD",
2944 tmpl
, current_namespace
);
2946 tree gen_tmpl
= most_general_template (tmpl
);
2948 if (explicit_instantiation
)
2950 /* We don't set DECL_EXPLICIT_INSTANTIATION here; that
2951 is done by do_decl_instantiation later. */
2953 int arg_depth
= TMPL_ARGS_DEPTH (targs
);
2954 int parm_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
2956 if (arg_depth
> parm_depth
)
2958 /* If TMPL is not the most general template (for
2959 example, if TMPL is a friend template that is
2960 injected into namespace scope), then there will
2961 be too many levels of TARGS. Remove some of them
2966 new_targs
= make_tree_vec (parm_depth
);
2967 for (i
= arg_depth
- parm_depth
; i
< arg_depth
; ++i
)
2968 TREE_VEC_ELT (new_targs
, i
- (arg_depth
- parm_depth
))
2969 = TREE_VEC_ELT (targs
, i
);
2973 return instantiate_template (tmpl
, targs
, tf_error
);
2976 /* If we thought that the DECL was a member function, but it
2977 turns out to be specializing a static member function,
2978 make DECL a static member function as well. */
2979 if (DECL_FUNCTION_TEMPLATE_P (tmpl
)
2980 && DECL_STATIC_FUNCTION_P (tmpl
)
2981 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
2982 revert_static_member_fn (decl
);
2984 /* If this is a specialization of a member template of a
2985 template class, we want to return the TEMPLATE_DECL, not
2986 the specialization of it. */
2987 if (tsk
== tsk_template
&& !was_template_id
)
2989 tree result
= DECL_TEMPLATE_RESULT (tmpl
);
2990 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
2991 DECL_INITIAL (result
) = NULL_TREE
;
2995 DECL_SOURCE_LOCATION (tmpl
) = DECL_SOURCE_LOCATION (decl
);
2996 DECL_SOURCE_LOCATION (result
)
2997 = DECL_SOURCE_LOCATION (decl
);
2998 /* We want to use the argument list specified in the
2999 definition, not in the original declaration. */
3000 DECL_ARGUMENTS (result
) = DECL_ARGUMENTS (decl
);
3001 for (parm
= DECL_ARGUMENTS (result
); parm
;
3002 parm
= DECL_CHAIN (parm
))
3003 DECL_CONTEXT (parm
) = result
;
3005 return register_specialization (tmpl
, gen_tmpl
, targs
,
3009 /* Set up the DECL_TEMPLATE_INFO for DECL. */
3010 DECL_TEMPLATE_INFO (decl
) = build_template_info (tmpl
, targs
);
3012 if (was_template_id
)
3013 TINFO_USED_TEMPLATE_ID (DECL_TEMPLATE_INFO (decl
)) = true;
3015 /* Inherit default function arguments from the template
3016 DECL is specializing. */
3017 if (DECL_FUNCTION_TEMPLATE_P (tmpl
))
3018 copy_default_args_to_explicit_spec (decl
);
3020 /* This specialization has the same protection as the
3021 template it specializes. */
3022 TREE_PRIVATE (decl
) = TREE_PRIVATE (gen_tmpl
);
3023 TREE_PROTECTED (decl
) = TREE_PROTECTED (gen_tmpl
);
3025 /* 7.1.1-1 [dcl.stc]
3027 A storage-class-specifier shall not be specified in an
3028 explicit specialization...
3030 The parser rejects these, so unless action is taken here,
3031 explicit function specializations will always appear with
3034 The action recommended by the C++ CWG in response to C++
3035 defect report 605 is to make the storage class and linkage
3036 of the explicit specialization match the templated function:
3038 http://www.open-std.org/jtc1/sc22/wg21/docs/cwg_active.html#605
3040 if (tsk
== tsk_expl_spec
&& DECL_FUNCTION_TEMPLATE_P (gen_tmpl
))
3042 tree tmpl_func
= DECL_TEMPLATE_RESULT (gen_tmpl
);
3043 gcc_assert (TREE_CODE (tmpl_func
) == FUNCTION_DECL
);
3045 /* A concept cannot be specialized. */
3046 if (DECL_DECLARED_CONCEPT_P (tmpl_func
))
3048 error ("explicit specialization of function concept %qD",
3050 return error_mark_node
;
3053 /* This specialization has the same linkage and visibility as
3054 the function template it specializes. */
3055 TREE_PUBLIC (decl
) = TREE_PUBLIC (tmpl_func
);
3056 if (! TREE_PUBLIC (decl
))
3058 DECL_INTERFACE_KNOWN (decl
) = 1;
3059 DECL_NOT_REALLY_EXTERN (decl
) = 1;
3061 DECL_THIS_STATIC (decl
) = DECL_THIS_STATIC (tmpl_func
);
3062 if (DECL_VISIBILITY_SPECIFIED (tmpl_func
))
3064 DECL_VISIBILITY_SPECIFIED (decl
) = 1;
3065 DECL_VISIBILITY (decl
) = DECL_VISIBILITY (tmpl_func
);
3069 /* If DECL is a friend declaration, declared using an
3070 unqualified name, the namespace associated with DECL may
3071 have been set incorrectly. For example, in:
3073 template <typename T> void f(T);
3075 struct S { friend void f<int>(int); }
3078 we will have set the DECL_CONTEXT for the friend
3079 declaration to N, rather than to the global namespace. */
3080 if (DECL_NAMESPACE_SCOPE_P (decl
))
3081 DECL_CONTEXT (decl
) = DECL_CONTEXT (tmpl
);
3083 if (is_friend
&& !have_def
)
3084 /* This is not really a declaration of a specialization.
3085 It's just the name of an instantiation. But, it's not
3086 a request for an instantiation, either. */
3087 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
3088 else if (TREE_CODE (decl
) == FUNCTION_DECL
)
3089 /* A specialization is not necessarily COMDAT. */
3090 DECL_COMDAT (decl
) = (TREE_PUBLIC (decl
)
3091 && DECL_DECLARED_INLINE_P (decl
));
3092 else if (VAR_P (decl
))
3093 DECL_COMDAT (decl
) = false;
3095 /* If this is a full specialization, register it so that we can find
3096 it again. Partial specializations will be registered in
3097 process_partial_specialization. */
3098 if (!processing_template_decl
)
3099 decl
= register_specialization (decl
, gen_tmpl
, targs
,
3102 /* A 'structor should already have clones. */
3103 gcc_assert (decl
== error_mark_node
3104 || variable_template_p (tmpl
)
3105 || !(DECL_CONSTRUCTOR_P (decl
)
3106 || DECL_DESTRUCTOR_P (decl
))
3107 || DECL_CLONED_FUNCTION_P (DECL_CHAIN (decl
)));
3114 /* Returns 1 iff PARMS1 and PARMS2 are identical sets of template
3115 parameters. These are represented in the same format used for
3116 DECL_TEMPLATE_PARMS. */
3119 comp_template_parms (const_tree parms1
, const_tree parms2
)
3124 if (parms1
== parms2
)
3127 for (p1
= parms1
, p2
= parms2
;
3128 p1
!= NULL_TREE
&& p2
!= NULL_TREE
;
3129 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
))
3131 tree t1
= TREE_VALUE (p1
);
3132 tree t2
= TREE_VALUE (p2
);
3135 gcc_assert (TREE_CODE (t1
) == TREE_VEC
);
3136 gcc_assert (TREE_CODE (t2
) == TREE_VEC
);
3138 if (TREE_VEC_LENGTH (t1
) != TREE_VEC_LENGTH (t2
))
3141 for (i
= 0; i
< TREE_VEC_LENGTH (t2
); ++i
)
3143 tree parm1
= TREE_VALUE (TREE_VEC_ELT (t1
, i
));
3144 tree parm2
= TREE_VALUE (TREE_VEC_ELT (t2
, i
));
3146 /* If either of the template parameters are invalid, assume
3147 they match for the sake of error recovery. */
3148 if (error_operand_p (parm1
) || error_operand_p (parm2
))
3151 if (TREE_CODE (parm1
) != TREE_CODE (parm2
))
3154 if (TREE_CODE (parm1
) == TEMPLATE_TYPE_PARM
3155 && (TEMPLATE_TYPE_PARAMETER_PACK (parm1
)
3156 == TEMPLATE_TYPE_PARAMETER_PACK (parm2
)))
3158 else if (!same_type_p (TREE_TYPE (parm1
), TREE_TYPE (parm2
)))
3163 if ((p1
!= NULL_TREE
) != (p2
!= NULL_TREE
))
3164 /* One set of parameters has more parameters lists than the
3171 /* Determine whether PARM is a parameter pack. */
3174 template_parameter_pack_p (const_tree parm
)
3176 /* Determine if we have a non-type template parameter pack. */
3177 if (TREE_CODE (parm
) == PARM_DECL
)
3178 return (DECL_TEMPLATE_PARM_P (parm
)
3179 && TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)));
3180 if (TREE_CODE (parm
) == TEMPLATE_PARM_INDEX
)
3181 return TEMPLATE_PARM_PARAMETER_PACK (parm
);
3183 /* If this is a list of template parameters, we could get a
3184 TYPE_DECL or a TEMPLATE_DECL. */
3185 if (TREE_CODE (parm
) == TYPE_DECL
|| TREE_CODE (parm
) == TEMPLATE_DECL
)
3186 parm
= TREE_TYPE (parm
);
3188 /* Otherwise it must be a type template parameter. */
3189 return ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
3190 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
)
3191 && TEMPLATE_TYPE_PARAMETER_PACK (parm
));
3194 /* Determine if T is a function parameter pack. */
3197 function_parameter_pack_p (const_tree t
)
3199 if (t
&& TREE_CODE (t
) == PARM_DECL
)
3200 return DECL_PACK_P (t
);
3204 /* Return the function template declaration of PRIMARY_FUNC_TMPL_INST.
3205 PRIMARY_FUNC_TMPL_INST is a primary function template instantiation. */
3208 get_function_template_decl (const_tree primary_func_tmpl_inst
)
3210 if (! primary_func_tmpl_inst
3211 || TREE_CODE (primary_func_tmpl_inst
) != FUNCTION_DECL
3212 || ! primary_template_instantiation_p (primary_func_tmpl_inst
))
3215 return DECL_TEMPLATE_RESULT (DECL_TI_TEMPLATE (primary_func_tmpl_inst
));
3218 /* Return true iff the function parameter PARAM_DECL was expanded
3219 from the function parameter pack PACK. */
3222 function_parameter_expanded_from_pack_p (tree param_decl
, tree pack
)
3224 if (DECL_ARTIFICIAL (param_decl
)
3225 || !function_parameter_pack_p (pack
))
3228 /* The parameter pack and its pack arguments have the same
3230 return DECL_PARM_INDEX (pack
) == DECL_PARM_INDEX (param_decl
);
3233 /* Determine whether ARGS describes a variadic template args list,
3234 i.e., one that is terminated by a template argument pack. */
3237 template_args_variadic_p (tree args
)
3242 if (args
== NULL_TREE
)
3245 args
= INNERMOST_TEMPLATE_ARGS (args
);
3246 nargs
= TREE_VEC_LENGTH (args
);
3251 last_parm
= TREE_VEC_ELT (args
, nargs
- 1);
3253 return ARGUMENT_PACK_P (last_parm
);
3256 /* Generate a new name for the parameter pack name NAME (an
3257 IDENTIFIER_NODE) that incorporates its */
3260 make_ith_pack_parameter_name (tree name
, int i
)
3262 /* Munge the name to include the parameter index. */
3263 #define NUMBUF_LEN 128
3264 char numbuf
[NUMBUF_LEN
];
3268 if (name
== NULL_TREE
)
3270 snprintf (numbuf
, NUMBUF_LEN
, "%i", i
);
3271 newname_len
= IDENTIFIER_LENGTH (name
)
3272 + strlen (numbuf
) + 2;
3273 newname
= (char*)alloca (newname_len
);
3274 snprintf (newname
, newname_len
,
3275 "%s#%i", IDENTIFIER_POINTER (name
), i
);
3276 return get_identifier (newname
);
3279 /* Return true if T is a primary function, class or alias template
3283 primary_template_instantiation_p (const_tree t
)
3288 if (TREE_CODE (t
) == FUNCTION_DECL
)
3289 return DECL_LANG_SPECIFIC (t
)
3290 && DECL_TEMPLATE_INSTANTIATION (t
)
3291 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (t
));
3292 else if (CLASS_TYPE_P (t
) && !TYPE_DECL_ALIAS_P (TYPE_NAME (t
)))
3293 return CLASSTYPE_TEMPLATE_INSTANTIATION (t
)
3294 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (t
));
3295 else if (alias_template_specialization_p (t
))
3300 /* Return true if PARM is a template template parameter. */
3303 template_template_parameter_p (const_tree parm
)
3305 return DECL_TEMPLATE_TEMPLATE_PARM_P (parm
);
3308 /* Return true iff PARM is a DECL representing a type template
3312 template_type_parameter_p (const_tree parm
)
3315 && (TREE_CODE (parm
) == TYPE_DECL
3316 || TREE_CODE (parm
) == TEMPLATE_DECL
)
3317 && DECL_TEMPLATE_PARM_P (parm
));
3320 /* Return the template parameters of T if T is a
3321 primary template instantiation, NULL otherwise. */
3324 get_primary_template_innermost_parameters (const_tree t
)
3326 tree parms
= NULL
, template_info
= NULL
;
3328 if ((template_info
= get_template_info (t
))
3329 && primary_template_instantiation_p (t
))
3330 parms
= INNERMOST_TEMPLATE_PARMS
3331 (DECL_TEMPLATE_PARMS (TI_TEMPLATE (template_info
)));
3336 /* Return the template parameters of the LEVELth level from the full list
3337 of template parameters PARMS. */
3340 get_template_parms_at_level (tree parms
, int level
)
3344 || TREE_CODE (parms
) != TREE_LIST
3345 || level
> TMPL_PARMS_DEPTH (parms
))
3348 for (p
= parms
; p
; p
= TREE_CHAIN (p
))
3349 if (TMPL_PARMS_DEPTH (p
) == level
)
3355 /* Returns the template arguments of T if T is a template instantiation,
3359 get_template_innermost_arguments (const_tree t
)
3361 tree args
= NULL
, template_info
= NULL
;
3363 if ((template_info
= get_template_info (t
))
3364 && TI_ARGS (template_info
))
3365 args
= INNERMOST_TEMPLATE_ARGS (TI_ARGS (template_info
));
3370 /* Return the argument pack elements of T if T is a template argument pack,
3374 get_template_argument_pack_elems (const_tree t
)
3376 if (TREE_CODE (t
) != TYPE_ARGUMENT_PACK
3377 && TREE_CODE (t
) != NONTYPE_ARGUMENT_PACK
)
3380 return ARGUMENT_PACK_ARGS (t
);
3383 /* Structure used to track the progress of find_parameter_packs_r. */
3384 struct find_parameter_pack_data
3386 /* TREE_LIST that will contain all of the parameter packs found by
3388 tree
* parameter_packs
;
3390 /* Set of AST nodes that have been visited by the traversal. */
3391 hash_set
<tree
> *visited
;
3393 /* True iff we're making a type pack expansion. */
3394 bool type_pack_expansion_p
;
3397 /* Identifies all of the argument packs that occur in a template
3398 argument and appends them to the TREE_LIST inside DATA, which is a
3399 find_parameter_pack_data structure. This is a subroutine of
3400 make_pack_expansion and uses_parameter_packs. */
3402 find_parameter_packs_r (tree
*tp
, int *walk_subtrees
, void* data
)
3405 struct find_parameter_pack_data
* ppd
=
3406 (struct find_parameter_pack_data
*)data
;
3407 bool parameter_pack_p
= false;
3409 /* Handle type aliases/typedefs. */
3410 if (TYPE_ALIAS_P (t
))
3412 if (TYPE_TEMPLATE_INFO (t
))
3413 cp_walk_tree (&TYPE_TI_ARGS (t
),
3414 &find_parameter_packs_r
,
3420 /* Identify whether this is a parameter pack or not. */
3421 switch (TREE_CODE (t
))
3423 case TEMPLATE_PARM_INDEX
:
3424 if (TEMPLATE_PARM_PARAMETER_PACK (t
))
3425 parameter_pack_p
= true;
3428 case TEMPLATE_TYPE_PARM
:
3429 t
= TYPE_MAIN_VARIANT (t
);
3430 case TEMPLATE_TEMPLATE_PARM
:
3431 /* If the placeholder appears in the decl-specifier-seq of a function
3432 parameter pack (14.6.3), or the type-specifier-seq of a type-id that
3433 is a pack expansion, the invented template parameter is a template
3435 if (ppd
->type_pack_expansion_p
&& is_auto_or_concept (t
))
3436 TEMPLATE_TYPE_PARAMETER_PACK (t
) = true;
3437 if (TEMPLATE_TYPE_PARAMETER_PACK (t
))
3438 parameter_pack_p
= true;
3443 if (DECL_PACK_P (t
))
3445 /* We don't want to walk into the type of a PARM_DECL,
3446 because we don't want to see the type parameter pack. */
3448 parameter_pack_p
= true;
3452 /* Look through a lambda capture proxy to the field pack. */
3454 if (DECL_HAS_VALUE_EXPR_P (t
))
3456 tree v
= DECL_VALUE_EXPR (t
);
3458 &find_parameter_packs_r
,
3462 else if (variable_template_specialization_p (t
))
3464 cp_walk_tree (&DECL_TI_ARGS (t
),
3465 find_parameter_packs_r
,
3472 parameter_pack_p
= true;
3475 /* Not a parameter pack. */
3479 if (parameter_pack_p
)
3481 /* Add this parameter pack to the list. */
3482 *ppd
->parameter_packs
= tree_cons (NULL_TREE
, t
, *ppd
->parameter_packs
);
3486 cp_walk_tree (&TYPE_CONTEXT (t
),
3487 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3489 /* This switch statement will return immediately if we don't find a
3491 switch (TREE_CODE (t
))
3493 case TEMPLATE_PARM_INDEX
:
3496 case BOUND_TEMPLATE_TEMPLATE_PARM
:
3497 /* Check the template itself. */
3498 cp_walk_tree (&TREE_TYPE (TYPE_TI_TEMPLATE (t
)),
3499 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3500 /* Check the template arguments. */
3501 cp_walk_tree (&TYPE_TI_ARGS (t
), &find_parameter_packs_r
, ppd
,
3506 case TEMPLATE_TYPE_PARM
:
3507 case TEMPLATE_TEMPLATE_PARM
:
3514 if (TYPE_PTRMEMFUNC_P (t
))
3520 if (TYPE_TEMPLATE_INFO (t
))
3521 cp_walk_tree (&TYPE_TI_ARGS (t
),
3522 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3529 cp_walk_tree (&TREE_TYPE (t
),
3530 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3534 cp_walk_tree (&TYPENAME_TYPE_FULLNAME (t
), &find_parameter_packs_r
,
3539 case TYPE_PACK_EXPANSION
:
3540 case EXPR_PACK_EXPANSION
:
3545 cp_walk_tree (&TYPE_MAX_VALUE (t
), &find_parameter_packs_r
,
3550 case IDENTIFIER_NODE
:
3551 cp_walk_tree (&TREE_TYPE (t
), &find_parameter_packs_r
, ppd
,
3558 /* When traversing a DECLTYPE_TYPE_EXPR, we need to set
3559 type_pack_expansion_p to false so that any placeholders
3560 within the expression don't get marked as parameter packs. */
3561 bool type_pack_expansion_p
= ppd
->type_pack_expansion_p
;
3562 ppd
->type_pack_expansion_p
= false;
3563 cp_walk_tree (&DECLTYPE_TYPE_EXPR (t
), &find_parameter_packs_r
,
3565 ppd
->type_pack_expansion_p
= type_pack_expansion_p
;
3577 /* Determines if the expression or type T uses any parameter packs. */
3579 uses_parameter_packs (tree t
)
3581 tree parameter_packs
= NULL_TREE
;
3582 struct find_parameter_pack_data ppd
;
3583 ppd
.parameter_packs
= ¶meter_packs
;
3584 ppd
.visited
= new hash_set
<tree
>;
3585 ppd
.type_pack_expansion_p
= false;
3586 cp_walk_tree (&t
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
3588 return parameter_packs
!= NULL_TREE
;
3591 /* Turn ARG, which may be an expression, type, or a TREE_LIST
3592 representation a base-class initializer into a parameter pack
3593 expansion. If all goes well, the resulting node will be an
3594 EXPR_PACK_EXPANSION, TYPE_PACK_EXPANSION, or TREE_LIST,
3597 make_pack_expansion (tree arg
)
3600 tree parameter_packs
= NULL_TREE
;
3601 bool for_types
= false;
3602 struct find_parameter_pack_data ppd
;
3604 if (!arg
|| arg
== error_mark_node
)
3607 if (TREE_CODE (arg
) == TREE_LIST
&& TREE_PURPOSE (arg
))
3609 /* A TREE_LIST with a non-null TREE_PURPOSE is for a base
3610 class initializer. In this case, the TREE_PURPOSE will be a
3611 _TYPE node (representing the base class expansion we're
3612 initializing) and the TREE_VALUE will be a TREE_LIST
3613 containing the initialization arguments.
3615 The resulting expansion looks somewhat different from most
3616 expansions. Rather than returning just one _EXPANSION, we
3617 return a TREE_LIST whose TREE_PURPOSE is a
3618 TYPE_PACK_EXPANSION containing the bases that will be
3619 initialized. The TREE_VALUE will be identical to the
3620 original TREE_VALUE, which is a list of arguments that will
3621 be passed to each base. We do not introduce any new pack
3622 expansion nodes into the TREE_VALUE (although it is possible
3623 that some already exist), because the TREE_PURPOSE and
3624 TREE_VALUE all need to be expanded together with the same
3625 _EXPANSION node. Note that the TYPE_PACK_EXPANSION in the
3626 resulting TREE_PURPOSE will mention the parameter packs in
3627 both the bases and the arguments to the bases. */
3630 tree parameter_packs
= NULL_TREE
;
3632 /* Determine which parameter packs will be used by the base
3634 ppd
.visited
= new hash_set
<tree
>;
3635 ppd
.parameter_packs
= ¶meter_packs
;
3636 cp_walk_tree (&TREE_PURPOSE (arg
), &find_parameter_packs_r
,
3639 if (parameter_packs
== NULL_TREE
)
3641 error ("base initializer expansion %<%T%> contains no parameter packs", arg
);
3643 return error_mark_node
;
3646 if (TREE_VALUE (arg
) != void_type_node
)
3648 /* Collect the sets of parameter packs used in each of the
3649 initialization arguments. */
3650 for (value
= TREE_VALUE (arg
); value
; value
= TREE_CHAIN (value
))
3652 /* Determine which parameter packs will be expanded in this
3654 cp_walk_tree (&TREE_VALUE (value
), &find_parameter_packs_r
,
3661 /* Create the pack expansion type for the base type. */
3662 purpose
= cxx_make_type (TYPE_PACK_EXPANSION
);
3663 SET_PACK_EXPANSION_PATTERN (purpose
, TREE_PURPOSE (arg
));
3664 PACK_EXPANSION_PARAMETER_PACKS (purpose
) = parameter_packs
;
3666 /* Just use structural equality for these TYPE_PACK_EXPANSIONS;
3667 they will rarely be compared to anything. */
3668 SET_TYPE_STRUCTURAL_EQUALITY (purpose
);
3670 return tree_cons (purpose
, TREE_VALUE (arg
), NULL_TREE
);
3673 if (TYPE_P (arg
) || TREE_CODE (arg
) == TEMPLATE_DECL
)
3676 /* Build the PACK_EXPANSION_* node. */
3678 ? cxx_make_type (TYPE_PACK_EXPANSION
)
3679 : make_node (EXPR_PACK_EXPANSION
);
3680 SET_PACK_EXPANSION_PATTERN (result
, arg
);
3681 if (TREE_CODE (result
) == EXPR_PACK_EXPANSION
)
3683 /* Propagate type and const-expression information. */
3684 TREE_TYPE (result
) = TREE_TYPE (arg
);
3685 TREE_CONSTANT (result
) = TREE_CONSTANT (arg
);
3688 /* Just use structural equality for these TYPE_PACK_EXPANSIONS;
3689 they will rarely be compared to anything. */
3690 SET_TYPE_STRUCTURAL_EQUALITY (result
);
3692 /* Determine which parameter packs will be expanded. */
3693 ppd
.parameter_packs
= ¶meter_packs
;
3694 ppd
.visited
= new hash_set
<tree
>;
3695 ppd
.type_pack_expansion_p
= TYPE_P (arg
);
3696 cp_walk_tree (&arg
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
3699 /* Make sure we found some parameter packs. */
3700 if (parameter_packs
== NULL_TREE
)
3703 error ("expansion pattern %<%T%> contains no argument packs", arg
);
3705 error ("expansion pattern %<%E%> contains no argument packs", arg
);
3706 return error_mark_node
;
3708 PACK_EXPANSION_PARAMETER_PACKS (result
) = parameter_packs
;
3710 PACK_EXPANSION_LOCAL_P (result
) = at_function_scope_p ();
3715 /* Checks T for any "bare" parameter packs, which have not yet been
3716 expanded, and issues an error if any are found. This operation can
3717 only be done on full expressions or types (e.g., an expression
3718 statement, "if" condition, etc.), because we could have expressions like:
3720 foo(f(g(h(args)))...)
3722 where "args" is a parameter pack. check_for_bare_parameter_packs
3723 should not be called for the subexpressions args, h(args),
3724 g(h(args)), or f(g(h(args))), because we would produce erroneous
3727 Returns TRUE and emits an error if there were bare parameter packs,
3728 returns FALSE otherwise. */
3730 check_for_bare_parameter_packs (tree t
)
3732 tree parameter_packs
= NULL_TREE
;
3733 struct find_parameter_pack_data ppd
;
3735 if (!processing_template_decl
|| !t
|| t
== error_mark_node
)
3738 if (TREE_CODE (t
) == TYPE_DECL
)
3741 ppd
.parameter_packs
= ¶meter_packs
;
3742 ppd
.visited
= new hash_set
<tree
>;
3743 ppd
.type_pack_expansion_p
= false;
3744 cp_walk_tree (&t
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
3747 if (parameter_packs
)
3749 error ("parameter packs not expanded with %<...%>:");
3750 while (parameter_packs
)
3752 tree pack
= TREE_VALUE (parameter_packs
);
3753 tree name
= NULL_TREE
;
3755 if (TREE_CODE (pack
) == TEMPLATE_TYPE_PARM
3756 || TREE_CODE (pack
) == TEMPLATE_TEMPLATE_PARM
)
3757 name
= TYPE_NAME (pack
);
3758 else if (TREE_CODE (pack
) == TEMPLATE_PARM_INDEX
)
3759 name
= DECL_NAME (TEMPLATE_PARM_DECL (pack
));
3761 name
= DECL_NAME (pack
);
3764 inform (input_location
, " %qD", name
);
3766 inform (input_location
, " <anonymous>");
3768 parameter_packs
= TREE_CHAIN (parameter_packs
);
3777 /* Expand any parameter packs that occur in the template arguments in
3780 expand_template_argument_pack (tree args
)
3782 tree result_args
= NULL_TREE
;
3783 int in_arg
, out_arg
= 0, nargs
= args
? TREE_VEC_LENGTH (args
) : 0;
3784 int num_result_args
= -1;
3785 int non_default_args_count
= -1;
3787 /* First, determine if we need to expand anything, and the number of
3788 slots we'll need. */
3789 for (in_arg
= 0; in_arg
< nargs
; ++in_arg
)
3791 tree arg
= TREE_VEC_ELT (args
, in_arg
);
3792 if (arg
== NULL_TREE
)
3794 if (ARGUMENT_PACK_P (arg
))
3796 int num_packed
= TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg
));
3797 if (num_result_args
< 0)
3798 num_result_args
= in_arg
+ num_packed
;
3800 num_result_args
+= num_packed
;
3804 if (num_result_args
>= 0)
3809 /* If no expansion is necessary, we're done. */
3810 if (num_result_args
< 0)
3813 /* Expand arguments. */
3814 result_args
= make_tree_vec (num_result_args
);
3815 if (NON_DEFAULT_TEMPLATE_ARGS_COUNT (args
))
3816 non_default_args_count
=
3817 GET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (args
);
3818 for (in_arg
= 0; in_arg
< nargs
; ++in_arg
)
3820 tree arg
= TREE_VEC_ELT (args
, in_arg
);
3821 if (ARGUMENT_PACK_P (arg
))
3823 tree packed
= ARGUMENT_PACK_ARGS (arg
);
3824 int i
, num_packed
= TREE_VEC_LENGTH (packed
);
3825 for (i
= 0; i
< num_packed
; ++i
, ++out_arg
)
3826 TREE_VEC_ELT (result_args
, out_arg
) = TREE_VEC_ELT(packed
, i
);
3827 if (non_default_args_count
> 0)
3828 non_default_args_count
+= num_packed
- 1;
3832 TREE_VEC_ELT (result_args
, out_arg
) = arg
;
3836 if (non_default_args_count
>= 0)
3837 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (result_args
, non_default_args_count
);
3841 /* Checks if DECL shadows a template parameter.
3843 [temp.local]: A template-parameter shall not be redeclared within its
3844 scope (including nested scopes).
3846 Emits an error and returns TRUE if the DECL shadows a parameter,
3847 returns FALSE otherwise. */
3850 check_template_shadow (tree decl
)
3854 /* If we're not in a template, we can't possibly shadow a template
3856 if (!current_template_parms
)
3859 /* Figure out what we're shadowing. */
3860 if (TREE_CODE (decl
) == OVERLOAD
)
3861 decl
= OVL_CURRENT (decl
);
3862 olddecl
= innermost_non_namespace_value (DECL_NAME (decl
));
3864 /* If there's no previous binding for this name, we're not shadowing
3865 anything, let alone a template parameter. */
3869 /* If we're not shadowing a template parameter, we're done. Note
3870 that OLDDECL might be an OVERLOAD (or perhaps even an
3871 ERROR_MARK), so we can't just blithely assume it to be a _DECL
3873 if (!DECL_P (olddecl
) || !DECL_TEMPLATE_PARM_P (olddecl
))
3876 /* We check for decl != olddecl to avoid bogus errors for using a
3877 name inside a class. We check TPFI to avoid duplicate errors for
3878 inline member templates. */
3880 || (DECL_TEMPLATE_PARM_P (decl
)
3881 && TEMPLATE_PARMS_FOR_INLINE (current_template_parms
)))
3884 /* Don't complain about the injected class name, as we've already
3885 complained about the class itself. */
3886 if (DECL_SELF_REFERENCE_P (decl
))
3889 if (DECL_TEMPLATE_PARM_P (decl
))
3890 error ("declaration of template parameter %q+D shadows "
3891 "template parameter", decl
);
3893 error ("declaration of %q+#D shadows template parameter", decl
);
3894 inform (DECL_SOURCE_LOCATION (olddecl
),
3895 "template parameter %qD declared here", olddecl
);
3899 /* Return a new TEMPLATE_PARM_INDEX with the indicated INDEX, LEVEL,
3900 ORIG_LEVEL, DECL, and TYPE. */
3903 build_template_parm_index (int index
,
3909 tree t
= make_node (TEMPLATE_PARM_INDEX
);
3910 TEMPLATE_PARM_IDX (t
) = index
;
3911 TEMPLATE_PARM_LEVEL (t
) = level
;
3912 TEMPLATE_PARM_ORIG_LEVEL (t
) = orig_level
;
3913 TEMPLATE_PARM_DECL (t
) = decl
;
3914 TREE_TYPE (t
) = type
;
3915 TREE_CONSTANT (t
) = TREE_CONSTANT (decl
);
3916 TREE_READONLY (t
) = TREE_READONLY (decl
);
3921 /* Find the canonical type parameter for the given template type
3922 parameter. Returns the canonical type parameter, which may be TYPE
3923 if no such parameter existed. */
3926 canonical_type_parameter (tree type
)
3929 int idx
= TEMPLATE_TYPE_IDX (type
);
3930 if (!canonical_template_parms
)
3931 vec_alloc (canonical_template_parms
, idx
+1);
3933 while (canonical_template_parms
->length () <= (unsigned)idx
)
3934 vec_safe_push (canonical_template_parms
, NULL_TREE
);
3936 list
= (*canonical_template_parms
)[idx
];
3937 while (list
&& !comptypes (type
, TREE_VALUE (list
), COMPARE_STRUCTURAL
))
3938 list
= TREE_CHAIN (list
);
3941 return TREE_VALUE (list
);
3944 (*canonical_template_parms
)[idx
]
3945 = tree_cons (NULL_TREE
, type
,
3946 (*canonical_template_parms
)[idx
]);
3951 /* Return a TEMPLATE_PARM_INDEX, similar to INDEX, but whose
3952 TEMPLATE_PARM_LEVEL has been decreased by LEVELS. If such a
3953 TEMPLATE_PARM_INDEX already exists, it is returned; otherwise, a
3954 new one is created. */
3957 reduce_template_parm_level (tree index
, tree type
, int levels
, tree args
,
3958 tsubst_flags_t complain
)
3960 if (TEMPLATE_PARM_DESCENDANTS (index
) == NULL_TREE
3961 || (TEMPLATE_PARM_LEVEL (TEMPLATE_PARM_DESCENDANTS (index
))
3962 != TEMPLATE_PARM_LEVEL (index
) - levels
)
3963 || !same_type_p (type
, TREE_TYPE (TEMPLATE_PARM_DESCENDANTS (index
))))
3965 tree orig_decl
= TEMPLATE_PARM_DECL (index
);
3968 decl
= build_decl (DECL_SOURCE_LOCATION (orig_decl
),
3969 TREE_CODE (orig_decl
), DECL_NAME (orig_decl
), type
);
3970 TREE_CONSTANT (decl
) = TREE_CONSTANT (orig_decl
);
3971 TREE_READONLY (decl
) = TREE_READONLY (orig_decl
);
3972 DECL_ARTIFICIAL (decl
) = 1;
3973 SET_DECL_TEMPLATE_PARM_P (decl
);
3975 t
= build_template_parm_index (TEMPLATE_PARM_IDX (index
),
3976 TEMPLATE_PARM_LEVEL (index
) - levels
,
3977 TEMPLATE_PARM_ORIG_LEVEL (index
),
3979 TEMPLATE_PARM_DESCENDANTS (index
) = t
;
3980 TEMPLATE_PARM_PARAMETER_PACK (t
)
3981 = TEMPLATE_PARM_PARAMETER_PACK (index
);
3983 /* Template template parameters need this. */
3984 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
3986 DECL_TEMPLATE_RESULT (decl
)
3987 = build_decl (DECL_SOURCE_LOCATION (decl
),
3988 TYPE_DECL
, DECL_NAME (decl
), type
);
3989 DECL_ARTIFICIAL (DECL_TEMPLATE_RESULT (decl
)) = true;
3990 DECL_TEMPLATE_PARMS (decl
) = tsubst_template_parms
3991 (DECL_TEMPLATE_PARMS (orig_decl
), args
, complain
);
3995 return TEMPLATE_PARM_DESCENDANTS (index
);
3998 /* Process information from new template parameter PARM and append it
3999 to the LIST being built. This new parameter is a non-type
4000 parameter iff IS_NON_TYPE is true. This new parameter is a
4001 parameter pack iff IS_PARAMETER_PACK is true. The location of PARM
4005 process_template_parm (tree list
, location_t parm_loc
, tree parm
,
4006 bool is_non_type
, bool is_parameter_pack
)
4011 gcc_assert (TREE_CODE (parm
) == TREE_LIST
);
4012 tree defval
= TREE_PURPOSE (parm
);
4013 tree constr
= TREE_TYPE (parm
);
4017 tree p
= tree_last (list
);
4019 if (p
&& TREE_VALUE (p
) != error_mark_node
)
4022 if (TREE_CODE (p
) == TYPE_DECL
|| TREE_CODE (p
) == TEMPLATE_DECL
)
4023 idx
= TEMPLATE_TYPE_IDX (TREE_TYPE (p
));
4025 idx
= TEMPLATE_PARM_IDX (DECL_INITIAL (p
));
4033 parm
= TREE_VALUE (parm
);
4035 SET_DECL_TEMPLATE_PARM_P (parm
);
4037 if (TREE_TYPE (parm
) != error_mark_node
)
4041 The top-level cv-qualifiers on the template-parameter are
4042 ignored when determining its type. */
4043 TREE_TYPE (parm
) = TYPE_MAIN_VARIANT (TREE_TYPE (parm
));
4044 if (invalid_nontype_parm_type_p (TREE_TYPE (parm
), 1))
4045 TREE_TYPE (parm
) = error_mark_node
;
4046 else if (uses_parameter_packs (TREE_TYPE (parm
))
4047 && !is_parameter_pack
4048 /* If we're in a nested template parameter list, the template
4049 template parameter could be a parameter pack. */
4050 && processing_template_parmlist
== 1)
4052 /* This template parameter is not a parameter pack, but it
4053 should be. Complain about "bare" parameter packs. */
4054 check_for_bare_parameter_packs (TREE_TYPE (parm
));
4056 /* Recover by calling this a parameter pack. */
4057 is_parameter_pack
= true;
4061 /* A template parameter is not modifiable. */
4062 TREE_CONSTANT (parm
) = 1;
4063 TREE_READONLY (parm
) = 1;
4064 decl
= build_decl (parm_loc
,
4065 CONST_DECL
, DECL_NAME (parm
), TREE_TYPE (parm
));
4066 TREE_CONSTANT (decl
) = 1;
4067 TREE_READONLY (decl
) = 1;
4068 DECL_INITIAL (parm
) = DECL_INITIAL (decl
)
4069 = build_template_parm_index (idx
, processing_template_decl
,
4070 processing_template_decl
,
4071 decl
, TREE_TYPE (parm
));
4073 TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
))
4074 = is_parameter_pack
;
4079 parm
= TREE_VALUE (TREE_VALUE (parm
));
4081 if (parm
&& TREE_CODE (parm
) == TEMPLATE_DECL
)
4083 t
= cxx_make_type (TEMPLATE_TEMPLATE_PARM
);
4084 /* This is for distinguishing between real templates and template
4085 template parameters */
4086 TREE_TYPE (parm
) = t
;
4087 TREE_TYPE (DECL_TEMPLATE_RESULT (parm
)) = t
;
4092 t
= cxx_make_type (TEMPLATE_TYPE_PARM
);
4093 /* parm is either IDENTIFIER_NODE or NULL_TREE. */
4094 decl
= build_decl (parm_loc
,
4095 TYPE_DECL
, parm
, t
);
4098 TYPE_NAME (t
) = decl
;
4099 TYPE_STUB_DECL (t
) = decl
;
4101 TEMPLATE_TYPE_PARM_INDEX (t
)
4102 = build_template_parm_index (idx
, processing_template_decl
,
4103 processing_template_decl
,
4104 decl
, TREE_TYPE (parm
));
4105 TEMPLATE_TYPE_PARAMETER_PACK (t
) = is_parameter_pack
;
4106 TYPE_CANONICAL (t
) = canonical_type_parameter (t
);
4108 DECL_ARTIFICIAL (decl
) = 1;
4109 SET_DECL_TEMPLATE_PARM_P (decl
);
4111 /* Build requirements for the type/template parameter.
4112 This must be done after SET_DECL_TEMPLATE_PARM_P or
4113 process_template_parm could fail. */
4114 tree reqs
= finish_shorthand_constraint (parm
, constr
);
4118 /* Build the parameter node linking the parameter declaration,
4119 its default argument (if any), and its constraints (if any). */
4120 parm
= build_tree_list (defval
, parm
);
4121 TEMPLATE_PARM_CONSTRAINTS (parm
) = reqs
;
4123 return chainon (list
, parm
);
4126 /* The end of a template parameter list has been reached. Process the
4127 tree list into a parameter vector, converting each parameter into a more
4128 useful form. Type parameters are saved as IDENTIFIER_NODEs, and others
4132 end_template_parm_list (tree parms
)
4136 tree saved_parmlist
= make_tree_vec (list_length (parms
));
4138 /* Pop the dummy parameter level and add the real one. */
4139 current_template_parms
= TREE_CHAIN (current_template_parms
);
4141 current_template_parms
4142 = tree_cons (size_int (processing_template_decl
),
4143 saved_parmlist
, current_template_parms
);
4145 for (parm
= parms
, nparms
= 0; parm
; parm
= next
, nparms
++)
4147 next
= TREE_CHAIN (parm
);
4148 TREE_VEC_ELT (saved_parmlist
, nparms
) = parm
;
4149 TREE_CHAIN (parm
) = NULL_TREE
;
4152 --processing_template_parmlist
;
4154 return saved_parmlist
;
4157 // Explicitly indicate the end of the template parameter list. We assume
4158 // that the current template parameters have been constructed and/or
4159 // managed explicitly, as when creating new template template parameters
4160 // from a shorthand constraint.
4162 end_template_parm_list ()
4164 --processing_template_parmlist
;
4167 /* end_template_decl is called after a template declaration is seen. */
4170 end_template_decl (void)
4172 reset_specialization ();
4174 if (! processing_template_decl
)
4177 /* This matches the pushlevel in begin_template_parm_list. */
4180 --processing_template_decl
;
4181 current_template_parms
= TREE_CHAIN (current_template_parms
);
4184 /* Takes a TREE_LIST representing a template parameter and convert it
4185 into an argument suitable to be passed to the type substitution
4186 functions. Note that If the TREE_LIST contains an error_mark
4187 node, the returned argument is error_mark_node. */
4190 template_parm_to_arg (tree t
)
4194 || TREE_CODE (t
) != TREE_LIST
)
4197 if (error_operand_p (TREE_VALUE (t
)))
4198 return error_mark_node
;
4202 if (TREE_CODE (t
) == TYPE_DECL
4203 || TREE_CODE (t
) == TEMPLATE_DECL
)
4207 if (TEMPLATE_TYPE_PARAMETER_PACK (t
))
4209 /* Turn this argument into a TYPE_ARGUMENT_PACK
4210 with a single element, which expands T. */
4211 tree vec
= make_tree_vec (1);
4213 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (vec
, TREE_VEC_LENGTH (vec
));
4215 TREE_VEC_ELT (vec
, 0) = make_pack_expansion (t
);
4217 t
= cxx_make_type (TYPE_ARGUMENT_PACK
);
4218 SET_ARGUMENT_PACK_ARGS (t
, vec
);
4223 t
= DECL_INITIAL (t
);
4225 if (TEMPLATE_PARM_PARAMETER_PACK (t
))
4227 /* Turn this argument into a NONTYPE_ARGUMENT_PACK
4228 with a single element, which expands T. */
4229 tree vec
= make_tree_vec (1);
4230 tree type
= TREE_TYPE (TEMPLATE_PARM_DECL (t
));
4232 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (vec
, TREE_VEC_LENGTH (vec
));
4234 t
= convert_from_reference (t
);
4235 TREE_VEC_ELT (vec
, 0) = make_pack_expansion (t
);
4237 t
= make_node (NONTYPE_ARGUMENT_PACK
);
4238 SET_ARGUMENT_PACK_ARGS (t
, vec
);
4239 TREE_TYPE (t
) = type
;
4242 t
= convert_from_reference (t
);
4247 /* Given a set of template parameters, return them as a set of template
4248 arguments. The template parameters are represented as a TREE_VEC, in
4249 the form documented in cp-tree.h for template arguments. */
4252 template_parms_to_args (tree parms
)
4255 tree args
= NULL_TREE
;
4256 int length
= TMPL_PARMS_DEPTH (parms
);
4259 /* If there is only one level of template parameters, we do not
4260 create a TREE_VEC of TREE_VECs. Instead, we return a single
4261 TREE_VEC containing the arguments. */
4263 args
= make_tree_vec (length
);
4265 for (header
= parms
; header
; header
= TREE_CHAIN (header
))
4267 tree a
= copy_node (TREE_VALUE (header
));
4270 TREE_TYPE (a
) = NULL_TREE
;
4271 for (i
= TREE_VEC_LENGTH (a
) - 1; i
>= 0; --i
)
4272 TREE_VEC_ELT (a
, i
) = template_parm_to_arg (TREE_VEC_ELT (a
, i
));
4275 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (a
, TREE_VEC_LENGTH (a
));
4278 TREE_VEC_ELT (args
, --l
) = a
;
4286 /* Within the declaration of a template, return the currently active
4287 template parameters as an argument TREE_VEC. */
4290 current_template_args (void)
4292 return template_parms_to_args (current_template_parms
);
4295 /* Update the declared TYPE by doing any lookups which were thought to be
4296 dependent, but are not now that we know the SCOPE of the declarator. */
4299 maybe_update_decl_type (tree orig_type
, tree scope
)
4301 tree type
= orig_type
;
4303 if (type
== NULL_TREE
)
4306 if (TREE_CODE (orig_type
) == TYPE_DECL
)
4307 type
= TREE_TYPE (type
);
4309 if (scope
&& TYPE_P (scope
) && dependent_type_p (scope
)
4310 && dependent_type_p (type
)
4311 /* Don't bother building up the args in this case. */
4312 && TREE_CODE (type
) != TEMPLATE_TYPE_PARM
)
4314 /* tsubst in the args corresponding to the template parameters,
4315 including auto if present. Most things will be unchanged, but
4316 make_typename_type and tsubst_qualified_id will resolve
4317 TYPENAME_TYPEs and SCOPE_REFs that were previously dependent. */
4318 tree args
= current_template_args ();
4319 tree auto_node
= type_uses_auto (type
);
4323 tree auto_vec
= make_tree_vec (1);
4324 TREE_VEC_ELT (auto_vec
, 0) = auto_node
;
4325 args
= add_to_template_args (args
, auto_vec
);
4327 pushed
= push_scope (scope
);
4328 type
= tsubst (type
, args
, tf_warning_or_error
, NULL_TREE
);
4333 if (type
== error_mark_node
)
4336 if (TREE_CODE (orig_type
) == TYPE_DECL
)
4338 if (same_type_p (type
, TREE_TYPE (orig_type
)))
4341 type
= TYPE_NAME (type
);
4346 /* Return a TEMPLATE_DECL corresponding to DECL, using the indicated
4347 template PARMS and constraints, CONSTR. If MEMBER_TEMPLATE_P is true,
4348 the new template is a member template. */
4351 build_template_decl (tree decl
, tree parms
, bool member_template_p
)
4353 tree tmpl
= build_lang_decl (TEMPLATE_DECL
, DECL_NAME (decl
), NULL_TREE
);
4354 DECL_TEMPLATE_PARMS (tmpl
) = parms
;
4355 DECL_CONTEXT (tmpl
) = DECL_CONTEXT (decl
);
4356 DECL_SOURCE_LOCATION (tmpl
) = DECL_SOURCE_LOCATION (decl
);
4357 DECL_MEMBER_TEMPLATE_P (tmpl
) = member_template_p
;
4362 struct template_parm_data
4364 /* The level of the template parameters we are currently
4368 /* The index of the specialization argument we are currently
4372 /* An array whose size is the number of template parameters. The
4373 elements are nonzero if the parameter has been used in any one
4374 of the arguments processed so far. */
4377 /* An array whose size is the number of template arguments. The
4378 elements are nonzero if the argument makes use of template
4379 parameters of this level. */
4380 int* arg_uses_template_parms
;
4383 /* Subroutine of push_template_decl used to see if each template
4384 parameter in a partial specialization is used in the explicit
4385 argument list. If T is of the LEVEL given in DATA (which is
4386 treated as a template_parm_data*), then DATA->PARMS is marked
4390 mark_template_parm (tree t
, void* data
)
4394 struct template_parm_data
* tpd
= (struct template_parm_data
*) data
;
4396 template_parm_level_and_index (t
, &level
, &idx
);
4398 if (level
== tpd
->level
)
4400 tpd
->parms
[idx
] = 1;
4401 tpd
->arg_uses_template_parms
[tpd
->current_arg
] = 1;
4404 /* Return zero so that for_each_template_parm will continue the
4405 traversal of the tree; we want to mark *every* template parm. */
4409 /* Process the partial specialization DECL. */
4412 process_partial_specialization (tree decl
)
4414 tree type
= TREE_TYPE (decl
);
4415 tree tinfo
= get_template_info (decl
);
4416 tree maintmpl
= TI_TEMPLATE (tinfo
);
4417 tree specargs
= TI_ARGS (tinfo
);
4418 tree inner_args
= INNERMOST_TEMPLATE_ARGS (specargs
);
4419 tree main_inner_parms
= DECL_INNERMOST_TEMPLATE_PARMS (maintmpl
);
4422 int nargs
= TREE_VEC_LENGTH (inner_args
);
4425 bool did_error_intro
= false;
4426 struct template_parm_data tpd
;
4427 struct template_parm_data tpd2
;
4429 gcc_assert (current_template_parms
);
4431 /* A concept cannot be specialized. */
4432 if (flag_concepts
&& variable_concept_p (maintmpl
))
4434 error ("specialization of variable concept %q#D", maintmpl
);
4435 return error_mark_node
;
4438 inner_parms
= INNERMOST_TEMPLATE_PARMS (current_template_parms
);
4439 ntparms
= TREE_VEC_LENGTH (inner_parms
);
4441 /* We check that each of the template parameters given in the
4442 partial specialization is used in the argument list to the
4443 specialization. For example:
4445 template <class T> struct S;
4446 template <class T> struct S<T*>;
4448 The second declaration is OK because `T*' uses the template
4449 parameter T, whereas
4451 template <class T> struct S<int>;
4453 is no good. Even trickier is:
4464 The S2<T> declaration is actually invalid; it is a
4465 full-specialization. Of course,
4468 struct S2<T (*)(U)>;
4470 or some such would have been OK. */
4471 tpd
.level
= TMPL_PARMS_DEPTH (current_template_parms
);
4472 tpd
.parms
= XALLOCAVEC (int, ntparms
);
4473 memset (tpd
.parms
, 0, sizeof (int) * ntparms
);
4475 tpd
.arg_uses_template_parms
= XALLOCAVEC (int, nargs
);
4476 memset (tpd
.arg_uses_template_parms
, 0, sizeof (int) * nargs
);
4477 for (i
= 0; i
< nargs
; ++i
)
4479 tpd
.current_arg
= i
;
4480 for_each_template_parm (TREE_VEC_ELT (inner_args
, i
),
4481 &mark_template_parm
,
4484 /*include_nondeduced_p=*/false);
4486 for (i
= 0; i
< ntparms
; ++i
)
4487 if (tpd
.parms
[i
] == 0)
4489 /* One of the template parms was not used in a deduced context in the
4491 if (!did_error_intro
)
4493 error ("template parameters not deducible in "
4494 "partial specialization:");
4495 did_error_intro
= true;
4498 inform (input_location
, " %qD",
4499 TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
)));
4502 if (did_error_intro
)
4503 return error_mark_node
;
4505 /* [temp.class.spec]
4507 The argument list of the specialization shall not be identical to
4508 the implicit argument list of the primary template. */
4510 = TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (maintmpl
)));
4511 if (comp_template_args (inner_args
, INNERMOST_TEMPLATE_ARGS (main_args
))
4513 || !strictly_subsumes (current_template_constraints (),
4514 get_constraints (maintmpl
))))
4517 error ("partial specialization %q+D does not specialize "
4518 "any template arguments", decl
);
4520 error ("partial specialization %q+D does not specialize any "
4521 "template arguments and is not more constrained than", decl
);
4522 inform (DECL_SOURCE_LOCATION (maintmpl
), "primary template here");
4525 /* A partial specialization that replaces multiple parameters of the
4526 primary template with a pack expansion is less specialized for those
4528 if (nargs
< DECL_NTPARMS (maintmpl
))
4530 error ("partial specialization is not more specialized than the "
4531 "primary template because it replaces multiple parameters "
4532 "with a pack expansion");
4533 inform (DECL_SOURCE_LOCATION (maintmpl
), "primary template here");
4537 /* [temp.class.spec]
4539 A partially specialized non-type argument expression shall not
4540 involve template parameters of the partial specialization except
4541 when the argument expression is a simple identifier.
4543 The type of a template parameter corresponding to a specialized
4544 non-type argument shall not be dependent on a parameter of the
4547 Also, we verify that pack expansions only occur at the
4548 end of the argument list. */
4549 gcc_assert (nargs
== DECL_NTPARMS (maintmpl
));
4551 for (i
= 0; i
< nargs
; ++i
)
4553 tree parm
= TREE_VALUE (TREE_VEC_ELT (main_inner_parms
, i
));
4554 tree arg
= TREE_VEC_ELT (inner_args
, i
);
4555 tree packed_args
= NULL_TREE
;
4558 if (ARGUMENT_PACK_P (arg
))
4560 /* Extract the arguments from the argument pack. We'll be
4561 iterating over these in the following loop. */
4562 packed_args
= ARGUMENT_PACK_ARGS (arg
);
4563 len
= TREE_VEC_LENGTH (packed_args
);
4566 for (j
= 0; j
< len
; j
++)
4569 /* Get the Jth argument in the parameter pack. */
4570 arg
= TREE_VEC_ELT (packed_args
, j
);
4572 if (PACK_EXPANSION_P (arg
))
4574 /* Pack expansions must come at the end of the
4576 if ((packed_args
&& j
< len
- 1)
4577 || (!packed_args
&& i
< nargs
- 1))
4579 if (TREE_CODE (arg
) == EXPR_PACK_EXPANSION
)
4580 error ("parameter pack argument %qE must be at the "
4581 "end of the template argument list", arg
);
4583 error ("parameter pack argument %qT must be at the "
4584 "end of the template argument list", arg
);
4588 if (TREE_CODE (arg
) == EXPR_PACK_EXPANSION
)
4589 /* We only care about the pattern. */
4590 arg
= PACK_EXPANSION_PATTERN (arg
);
4592 if (/* These first two lines are the `non-type' bit. */
4594 && TREE_CODE (arg
) != TEMPLATE_DECL
4595 /* This next two lines are the `argument expression is not just a
4596 simple identifier' condition and also the `specialized
4597 non-type argument' bit. */
4598 && TREE_CODE (arg
) != TEMPLATE_PARM_INDEX
4599 && !(REFERENCE_REF_P (arg
)
4600 && TREE_CODE (TREE_OPERAND (arg
, 0)) == TEMPLATE_PARM_INDEX
))
4602 if ((!packed_args
&& tpd
.arg_uses_template_parms
[i
])
4603 || (packed_args
&& uses_template_parms (arg
)))
4604 error ("template argument %qE involves template parameter(s)",
4608 /* Look at the corresponding template parameter,
4609 marking which template parameters its type depends
4611 tree type
= TREE_TYPE (parm
);
4615 /* We haven't yet initialized TPD2. Do so now. */
4616 tpd2
.arg_uses_template_parms
= XALLOCAVEC (int, nargs
);
4617 /* The number of parameters here is the number in the
4618 main template, which, as checked in the assertion
4620 tpd2
.parms
= XALLOCAVEC (int, nargs
);
4622 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (maintmpl
));
4625 /* Mark the template parameters. But this time, we're
4626 looking for the template parameters of the main
4627 template, not in the specialization. */
4628 tpd2
.current_arg
= i
;
4629 tpd2
.arg_uses_template_parms
[i
] = 0;
4630 memset (tpd2
.parms
, 0, sizeof (int) * nargs
);
4631 for_each_template_parm (type
,
4632 &mark_template_parm
,
4635 /*include_nondeduced_p=*/false);
4637 if (tpd2
.arg_uses_template_parms
[i
])
4639 /* The type depended on some template parameters.
4640 If they are fully specialized in the
4641 specialization, that's OK. */
4644 for (j
= 0; j
< nargs
; ++j
)
4645 if (tpd2
.parms
[j
] != 0
4646 && tpd
.arg_uses_template_parms
[j
])
4649 error_n (input_location
, count
,
4650 "type %qT of template argument %qE depends "
4651 "on a template parameter",
4652 "type %qT of template argument %qE depends "
4653 "on template parameters",
4662 /* We should only get here once. */
4663 if (TREE_CODE (decl
) == TYPE_DECL
)
4664 gcc_assert (!COMPLETE_TYPE_P (type
));
4666 // Build the template decl.
4667 tree tmpl
= build_template_decl (decl
, current_template_parms
,
4668 DECL_MEMBER_TEMPLATE_P (maintmpl
));
4669 TREE_TYPE (tmpl
) = type
;
4670 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
4671 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
4672 DECL_TEMPLATE_INFO (tmpl
) = build_template_info (maintmpl
, specargs
);
4673 DECL_PRIMARY_TEMPLATE (tmpl
) = maintmpl
;
4676 /* We didn't register this in check_explicit_specialization so we could
4677 wait until the constraints were set. */
4678 decl
= register_specialization (decl
, maintmpl
, specargs
, false, 0);
4680 associate_classtype_constraints (type
);
4682 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)
4683 = tree_cons (specargs
, tmpl
,
4684 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
));
4685 TREE_TYPE (DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)) = type
;
4687 for (inst
= DECL_TEMPLATE_INSTANTIATIONS (maintmpl
); inst
;
4688 inst
= TREE_CHAIN (inst
))
4690 tree instance
= TREE_VALUE (inst
);
4691 if (TYPE_P (instance
)
4692 ? (COMPLETE_TYPE_P (instance
)
4693 && CLASSTYPE_IMPLICIT_INSTANTIATION (instance
))
4694 : DECL_TEMPLATE_INSTANTIATION (instance
))
4696 tree spec
= most_specialized_partial_spec (instance
, tf_none
);
4697 tree inst_decl
= (DECL_P (instance
)
4698 ? instance
: TYPE_NAME (instance
));
4701 else if (spec
== error_mark_node
)
4702 permerror (input_location
,
4703 "declaration of %qD ambiguates earlier template "
4704 "instantiation for %qD", decl
, inst_decl
);
4705 else if (TREE_VALUE (spec
) == tmpl
)
4706 permerror (input_location
,
4707 "partial specialization of %qD after instantiation "
4708 "of %qD", decl
, inst_decl
);
4715 /* PARM is a template parameter of some form; return the corresponding
4716 TEMPLATE_PARM_INDEX. */
4719 get_template_parm_index (tree parm
)
4721 if (TREE_CODE (parm
) == PARM_DECL
4722 || TREE_CODE (parm
) == CONST_DECL
)
4723 parm
= DECL_INITIAL (parm
);
4724 else if (TREE_CODE (parm
) == TYPE_DECL
4725 || TREE_CODE (parm
) == TEMPLATE_DECL
)
4726 parm
= TREE_TYPE (parm
);
4727 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
4728 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
4729 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
)
4730 parm
= TEMPLATE_TYPE_PARM_INDEX (parm
);
4731 gcc_assert (TREE_CODE (parm
) == TEMPLATE_PARM_INDEX
);
4735 /* Subroutine of fixed_parameter_pack_p below. Look for any template
4736 parameter packs used by the template parameter PARM. */
4739 fixed_parameter_pack_p_1 (tree parm
, struct find_parameter_pack_data
*ppd
)
4741 /* A type parm can't refer to another parm. */
4742 if (TREE_CODE (parm
) == TYPE_DECL
)
4744 else if (TREE_CODE (parm
) == PARM_DECL
)
4746 cp_walk_tree (&TREE_TYPE (parm
), &find_parameter_packs_r
,
4751 gcc_assert (TREE_CODE (parm
) == TEMPLATE_DECL
);
4753 tree vec
= INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (parm
));
4754 for (int i
= 0; i
< TREE_VEC_LENGTH (vec
); ++i
)
4755 fixed_parameter_pack_p_1 (TREE_VALUE (TREE_VEC_ELT (vec
, i
)), ppd
);
4758 /* PARM is a template parameter pack. Return any parameter packs used in
4759 its type or the type of any of its template parameters. If there are
4760 any such packs, it will be instantiated into a fixed template parameter
4761 list by partial instantiation rather than be fully deduced. */
4764 fixed_parameter_pack_p (tree parm
)
4766 /* This can only be true in a member template. */
4767 if (TEMPLATE_PARM_ORIG_LEVEL (get_template_parm_index (parm
)) < 2)
4769 /* This can only be true for a parameter pack. */
4770 if (!template_parameter_pack_p (parm
))
4772 /* A type parm can't refer to another parm. */
4773 if (TREE_CODE (parm
) == TYPE_DECL
)
4776 tree parameter_packs
= NULL_TREE
;
4777 struct find_parameter_pack_data ppd
;
4778 ppd
.parameter_packs
= ¶meter_packs
;
4779 ppd
.visited
= new hash_set
<tree
>;
4780 ppd
.type_pack_expansion_p
= false;
4782 fixed_parameter_pack_p_1 (parm
, &ppd
);
4785 return parameter_packs
;
4788 /* Check that a template declaration's use of default arguments and
4789 parameter packs is not invalid. Here, PARMS are the template
4790 parameters. IS_PRIMARY is true if DECL is the thing declared by
4791 a primary template. IS_PARTIAL is true if DECL is a partial
4794 IS_FRIEND_DECL is nonzero if DECL is a friend function template
4795 declaration (but not a definition); 1 indicates a declaration, 2
4796 indicates a redeclaration. When IS_FRIEND_DECL=2, no errors are
4797 emitted for extraneous default arguments.
4799 Returns TRUE if there were no errors found, FALSE otherwise. */
4802 check_default_tmpl_args (tree decl
, tree parms
, bool is_primary
,
4803 bool is_partial
, int is_friend_decl
)
4806 int last_level_to_check
;
4808 bool no_errors
= true;
4812 A default template-argument shall not be specified in a
4813 function template declaration or a function template definition, nor
4814 in the template-parameter-list of the definition of a member of a
4817 if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == FUNCTION_DECL
4818 || (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_LOCAL_FUNCTION_P (decl
)))
4819 /* You can't have a function template declaration in a local
4820 scope, nor you can you define a member of a class template in a
4824 if ((TREE_CODE (decl
) == TYPE_DECL
4826 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
4827 || (TREE_CODE (decl
) == FUNCTION_DECL
4828 && LAMBDA_FUNCTION_P (decl
)))
4829 /* A lambda doesn't have an explicit declaration; don't complain
4830 about the parms of the enclosing class. */
4833 if (current_class_type
4834 && !TYPE_BEING_DEFINED (current_class_type
)
4835 && DECL_LANG_SPECIFIC (decl
)
4836 && DECL_DECLARES_FUNCTION_P (decl
)
4837 /* If this is either a friend defined in the scope of the class
4838 or a member function. */
4839 && (DECL_FUNCTION_MEMBER_P (decl
)
4840 ? same_type_p (DECL_CONTEXT (decl
), current_class_type
)
4841 : DECL_FRIEND_CONTEXT (decl
)
4842 ? same_type_p (DECL_FRIEND_CONTEXT (decl
), current_class_type
)
4844 /* And, if it was a member function, it really was defined in
4845 the scope of the class. */
4846 && (!DECL_FUNCTION_MEMBER_P (decl
)
4847 || DECL_INITIALIZED_IN_CLASS_P (decl
)))
4848 /* We already checked these parameters when the template was
4849 declared, so there's no need to do it again now. This function
4850 was defined in class scope, but we're processing its body now
4851 that the class is complete. */
4854 /* Core issue 226 (C++0x only): the following only applies to class
4857 && ((cxx_dialect
== cxx98
) || TREE_CODE (decl
) != FUNCTION_DECL
))
4861 If a template-parameter has a default template-argument, all
4862 subsequent template-parameters shall have a default
4863 template-argument supplied. */
4864 for (parm_level
= parms
; parm_level
; parm_level
= TREE_CHAIN (parm_level
))
4866 tree inner_parms
= TREE_VALUE (parm_level
);
4867 int ntparms
= TREE_VEC_LENGTH (inner_parms
);
4868 int seen_def_arg_p
= 0;
4871 for (i
= 0; i
< ntparms
; ++i
)
4873 tree parm
= TREE_VEC_ELT (inner_parms
, i
);
4875 if (parm
== error_mark_node
)
4878 if (TREE_PURPOSE (parm
))
4880 else if (seen_def_arg_p
4881 && !template_parameter_pack_p (TREE_VALUE (parm
)))
4883 error ("no default argument for %qD", TREE_VALUE (parm
));
4884 /* For better subsequent error-recovery, we indicate that
4885 there should have been a default argument. */
4886 TREE_PURPOSE (parm
) = error_mark_node
;
4889 else if (!is_partial
4891 /* Don't complain about an enclosing partial
4893 && parm_level
== parms
4894 && TREE_CODE (decl
) == TYPE_DECL
4896 && template_parameter_pack_p (TREE_VALUE (parm
))
4897 /* A fixed parameter pack will be partially
4898 instantiated into a fixed length list. */
4899 && !fixed_parameter_pack_p (TREE_VALUE (parm
)))
4901 /* A primary class template can only have one
4902 parameter pack, at the end of the template
4905 error ("parameter pack %q+D must be at the end of the"
4906 " template parameter list", TREE_VALUE (parm
));
4908 TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
))
4916 if (((cxx_dialect
== cxx98
) && TREE_CODE (decl
) != TYPE_DECL
)
4920 /* For an ordinary class template, default template arguments are
4921 allowed at the innermost level, e.g.:
4922 template <class T = int>
4924 but, in a partial specialization, they're not allowed even
4925 there, as we have in [temp.class.spec]:
4927 The template parameter list of a specialization shall not
4928 contain default template argument values.
4930 So, for a partial specialization, or for a function template
4931 (in C++98/C++03), we look at all of them. */
4934 /* But, for a primary class template that is not a partial
4935 specialization we look at all template parameters except the
4937 parms
= TREE_CHAIN (parms
);
4939 /* Figure out what error message to issue. */
4940 if (is_friend_decl
== 2)
4941 msg
= G_("default template arguments may not be used in function template "
4942 "friend re-declaration");
4943 else if (is_friend_decl
)
4944 msg
= G_("default template arguments may not be used in function template "
4945 "friend declarations");
4946 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& (cxx_dialect
== cxx98
))
4947 msg
= G_("default template arguments may not be used in function templates "
4948 "without -std=c++11 or -std=gnu++11");
4949 else if (is_partial
)
4950 msg
= G_("default template arguments may not be used in "
4951 "partial specializations");
4952 else if (current_class_type
&& CLASSTYPE_IS_TEMPLATE (current_class_type
))
4953 msg
= G_("default argument for template parameter for class enclosing %qD");
4955 /* Per [temp.param]/9, "A default template-argument shall not be
4956 specified in the template-parameter-lists of the definition of
4957 a member of a class template that appears outside of the member's
4958 class.", thus if we aren't handling a member of a class template
4959 there is no need to examine the parameters. */
4962 if (current_class_type
&& TYPE_BEING_DEFINED (current_class_type
))
4963 /* If we're inside a class definition, there's no need to
4964 examine the parameters to the class itself. On the one
4965 hand, they will be checked when the class is defined, and,
4966 on the other, default arguments are valid in things like:
4967 template <class T = double>
4968 struct S { template <class U> void f(U); };
4969 Here the default argument for `S' has no bearing on the
4970 declaration of `f'. */
4971 last_level_to_check
= template_class_depth (current_class_type
) + 1;
4973 /* Check everything. */
4974 last_level_to_check
= 0;
4976 for (parm_level
= parms
;
4977 parm_level
&& TMPL_PARMS_DEPTH (parm_level
) >= last_level_to_check
;
4978 parm_level
= TREE_CHAIN (parm_level
))
4980 tree inner_parms
= TREE_VALUE (parm_level
);
4984 ntparms
= TREE_VEC_LENGTH (inner_parms
);
4985 for (i
= 0; i
< ntparms
; ++i
)
4987 if (TREE_VEC_ELT (inner_parms
, i
) == error_mark_node
)
4990 if (TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)))
4995 if (is_friend_decl
== 2)
5002 /* Clear out the default argument so that we are not
5004 TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)) = NULL_TREE
;
5008 /* At this point, if we're still interested in issuing messages,
5009 they must apply to classes surrounding the object declared. */
5011 msg
= G_("default argument for template parameter for class "
5018 /* Worker for push_template_decl_real, called via
5019 for_each_template_parm. DATA is really an int, indicating the
5020 level of the parameters we are interested in. If T is a template
5021 parameter of that level, return nonzero. */
5024 template_parm_this_level_p (tree t
, void* data
)
5026 int this_level
= *(int *)data
;
5029 if (TREE_CODE (t
) == TEMPLATE_PARM_INDEX
)
5030 level
= TEMPLATE_PARM_LEVEL (t
);
5032 level
= TEMPLATE_TYPE_LEVEL (t
);
5033 return level
== this_level
;
5036 /* Creates a TEMPLATE_DECL for the indicated DECL using the template
5037 parameters given by current_template_args, or reuses a
5038 previously existing one, if appropriate. Returns the DECL, or an
5039 equivalent one, if it is replaced via a call to duplicate_decls.
5041 If IS_FRIEND is true, DECL is a friend declaration. */
5044 push_template_decl_real (tree decl
, bool is_friend
)
5052 int new_template_p
= 0;
5053 /* True if the template is a member template, in the sense of
5055 bool member_template_p
= false;
5057 if (decl
== error_mark_node
|| !current_template_parms
)
5058 return error_mark_node
;
5060 /* See if this is a partial specialization. */
5061 is_partial
= ((DECL_IMPLICIT_TYPEDEF_P (decl
)
5062 && TREE_CODE (TREE_TYPE (decl
)) != ENUMERAL_TYPE
5063 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)))
5065 && DECL_LANG_SPECIFIC (decl
)
5066 && DECL_TEMPLATE_SPECIALIZATION (decl
)
5067 && TINFO_USED_TEMPLATE_ID (DECL_TEMPLATE_INFO (decl
))));
5069 if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_FRIEND_P (decl
))
5073 /* For a friend, we want the context of the friend function, not
5074 the type of which it is a friend. */
5075 ctx
= CP_DECL_CONTEXT (decl
);
5076 else if (CP_DECL_CONTEXT (decl
)
5077 && TREE_CODE (CP_DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
5078 /* In the case of a virtual function, we want the class in which
5080 ctx
= CP_DECL_CONTEXT (decl
);
5082 /* Otherwise, if we're currently defining some class, the DECL
5083 is assumed to be a member of the class. */
5084 ctx
= current_scope ();
5086 if (ctx
&& TREE_CODE (ctx
) == NAMESPACE_DECL
)
5089 if (!DECL_CONTEXT (decl
))
5090 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
5092 /* See if this is a primary template. */
5093 if (is_friend
&& ctx
5094 && uses_template_parms_level (ctx
, processing_template_decl
))
5095 /* A friend template that specifies a class context, i.e.
5096 template <typename T> friend void A<T>::f();
5099 else if (TREE_CODE (decl
) == TYPE_DECL
5100 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
5103 is_primary
= template_parm_scope_p ();
5107 warning (OPT_Wtemplates
, "template %qD declared", decl
);
5109 if (DECL_CLASS_SCOPE_P (decl
))
5110 member_template_p
= true;
5111 if (TREE_CODE (decl
) == TYPE_DECL
5112 && anon_aggrname_p (DECL_NAME (decl
)))
5114 error ("template class without a name");
5115 return error_mark_node
;
5117 else if (TREE_CODE (decl
) == FUNCTION_DECL
)
5119 if (member_template_p
)
5121 if (DECL_OVERRIDE_P (decl
) || DECL_FINAL_P (decl
))
5122 error ("member template %qD may not have virt-specifiers", decl
);
5124 if (DECL_DESTRUCTOR_P (decl
))
5128 A destructor shall not be a member template. */
5129 error ("destructor %qD declared as member template", decl
);
5130 return error_mark_node
;
5132 if (NEW_DELETE_OPNAME_P (DECL_NAME (decl
))
5133 && (!prototype_p (TREE_TYPE (decl
))
5134 || TYPE_ARG_TYPES (TREE_TYPE (decl
)) == void_list_node
5135 || !TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)))
5136 || (TREE_CHAIN (TYPE_ARG_TYPES ((TREE_TYPE (decl
))))
5137 == void_list_node
)))
5139 /* [basic.stc.dynamic.allocation]
5141 An allocation function can be a function
5142 template. ... Template allocation functions shall
5143 have two or more parameters. */
5144 error ("invalid template declaration of %qD", decl
);
5145 return error_mark_node
;
5148 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
5149 && CLASS_TYPE_P (TREE_TYPE (decl
)))
5151 else if (TREE_CODE (decl
) == TYPE_DECL
5152 && TYPE_DECL_ALIAS_P (decl
))
5153 /* alias-declaration */
5154 gcc_assert (!DECL_ARTIFICIAL (decl
));
5155 else if (VAR_P (decl
))
5156 /* C++14 variable template. */;
5159 error ("template declaration of %q#D", decl
);
5160 return error_mark_node
;
5164 /* Check to see that the rules regarding the use of default
5165 arguments are not being violated. */
5166 check_default_tmpl_args (decl
, current_template_parms
,
5167 is_primary
, is_partial
, /*is_friend_decl=*/0);
5169 /* Ensure that there are no parameter packs in the type of this
5170 declaration that have not been expanded. */
5171 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5173 /* Check each of the arguments individually to see if there are
5174 any bare parameter packs. */
5175 tree type
= TREE_TYPE (decl
);
5176 tree arg
= DECL_ARGUMENTS (decl
);
5177 tree argtype
= TYPE_ARG_TYPES (type
);
5179 while (arg
&& argtype
)
5181 if (!DECL_PACK_P (arg
)
5182 && check_for_bare_parameter_packs (TREE_TYPE (arg
)))
5184 /* This is a PARM_DECL that contains unexpanded parameter
5185 packs. We have already complained about this in the
5186 check_for_bare_parameter_packs call, so just replace
5187 these types with ERROR_MARK_NODE. */
5188 TREE_TYPE (arg
) = error_mark_node
;
5189 TREE_VALUE (argtype
) = error_mark_node
;
5192 arg
= DECL_CHAIN (arg
);
5193 argtype
= TREE_CHAIN (argtype
);
5196 /* Check for bare parameter packs in the return type and the
5197 exception specifiers. */
5198 if (check_for_bare_parameter_packs (TREE_TYPE (type
)))
5199 /* Errors were already issued, set return type to int
5200 as the frontend doesn't expect error_mark_node as
5202 TREE_TYPE (type
) = integer_type_node
;
5203 if (check_for_bare_parameter_packs (TYPE_RAISES_EXCEPTIONS (type
)))
5204 TYPE_RAISES_EXCEPTIONS (type
) = NULL_TREE
;
5206 else if (check_for_bare_parameter_packs ((TREE_CODE (decl
) == TYPE_DECL
5207 && TYPE_DECL_ALIAS_P (decl
))
5208 ? DECL_ORIGINAL_TYPE (decl
)
5209 : TREE_TYPE (decl
)))
5211 TREE_TYPE (decl
) = error_mark_node
;
5212 return error_mark_node
;
5216 return process_partial_specialization (decl
);
5218 args
= current_template_args ();
5221 || TREE_CODE (ctx
) == FUNCTION_DECL
5222 || (CLASS_TYPE_P (ctx
) && TYPE_BEING_DEFINED (ctx
))
5223 || (TREE_CODE (decl
) == TYPE_DECL
5224 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
5225 || (is_friend
&& !DECL_TEMPLATE_INFO (decl
)))
5227 if (DECL_LANG_SPECIFIC (decl
)
5228 && DECL_TEMPLATE_INFO (decl
)
5229 && DECL_TI_TEMPLATE (decl
))
5230 tmpl
= DECL_TI_TEMPLATE (decl
);
5231 /* If DECL is a TYPE_DECL for a class-template, then there won't
5232 be DECL_LANG_SPECIFIC. The information equivalent to
5233 DECL_TEMPLATE_INFO is found in TYPE_TEMPLATE_INFO instead. */
5234 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
5235 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl
))
5236 && TYPE_TI_TEMPLATE (TREE_TYPE (decl
)))
5238 /* Since a template declaration already existed for this
5239 class-type, we must be redeclaring it here. Make sure
5240 that the redeclaration is valid. */
5241 redeclare_class_template (TREE_TYPE (decl
),
5242 current_template_parms
,
5243 current_template_constraints ());
5244 /* We don't need to create a new TEMPLATE_DECL; just use the
5245 one we already had. */
5246 tmpl
= TYPE_TI_TEMPLATE (TREE_TYPE (decl
));
5250 tmpl
= build_template_decl (decl
, current_template_parms
,
5254 if (DECL_LANG_SPECIFIC (decl
)
5255 && DECL_TEMPLATE_SPECIALIZATION (decl
))
5257 /* A specialization of a member template of a template
5259 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
5260 DECL_TEMPLATE_INFO (tmpl
) = DECL_TEMPLATE_INFO (decl
);
5261 DECL_TEMPLATE_INFO (decl
) = NULL_TREE
;
5267 tree a
, t
, current
, parms
;
5269 tree tinfo
= get_template_info (decl
);
5273 error ("template definition of non-template %q#D", decl
);
5274 return error_mark_node
;
5277 tmpl
= TI_TEMPLATE (tinfo
);
5279 if (DECL_FUNCTION_TEMPLATE_P (tmpl
)
5280 && DECL_TEMPLATE_INFO (decl
) && DECL_TI_ARGS (decl
)
5281 && DECL_TEMPLATE_SPECIALIZATION (decl
)
5282 && DECL_MEMBER_TEMPLATE_P (tmpl
))
5286 /* The declaration is a specialization of a member
5287 template, declared outside the class. Therefore, the
5288 innermost template arguments will be NULL, so we
5289 replace them with the arguments determined by the
5290 earlier call to check_explicit_specialization. */
5291 args
= DECL_TI_ARGS (decl
);
5294 = build_template_decl (decl
, current_template_parms
,
5296 DECL_TEMPLATE_RESULT (new_tmpl
) = decl
;
5297 TREE_TYPE (new_tmpl
) = TREE_TYPE (decl
);
5298 DECL_TI_TEMPLATE (decl
) = new_tmpl
;
5299 SET_DECL_TEMPLATE_SPECIALIZATION (new_tmpl
);
5300 DECL_TEMPLATE_INFO (new_tmpl
)
5301 = build_template_info (tmpl
, args
);
5303 register_specialization (new_tmpl
,
5304 most_general_template (tmpl
),
5310 /* Make sure the template headers we got make sense. */
5312 parms
= DECL_TEMPLATE_PARMS (tmpl
);
5313 i
= TMPL_PARMS_DEPTH (parms
);
5314 if (TMPL_ARGS_DEPTH (args
) != i
)
5316 error ("expected %d levels of template parms for %q#D, got %d",
5317 i
, decl
, TMPL_ARGS_DEPTH (args
));
5318 DECL_INTERFACE_KNOWN (decl
) = 1;
5319 return error_mark_node
;
5322 for (current
= decl
; i
> 0; --i
, parms
= TREE_CHAIN (parms
))
5324 a
= TMPL_ARGS_LEVEL (args
, i
);
5325 t
= INNERMOST_TEMPLATE_PARMS (parms
);
5327 if (TREE_VEC_LENGTH (t
) != TREE_VEC_LENGTH (a
))
5329 if (current
== decl
)
5330 error ("got %d template parameters for %q#D",
5331 TREE_VEC_LENGTH (a
), decl
);
5333 error ("got %d template parameters for %q#T",
5334 TREE_VEC_LENGTH (a
), current
);
5335 error (" but %d required", TREE_VEC_LENGTH (t
));
5336 /* Avoid crash in import_export_decl. */
5337 DECL_INTERFACE_KNOWN (decl
) = 1;
5338 return error_mark_node
;
5341 if (current
== decl
)
5343 else if (current
== NULL_TREE
)
5344 /* Can happen in erroneous input. */
5347 current
= get_containing_scope (current
);
5350 /* Check that the parms are used in the appropriate qualifying scopes
5351 in the declarator. */
5352 if (!comp_template_args
5354 TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (tmpl
)))))
5357 template arguments to %qD do not match original template %qD",
5358 decl
, DECL_TEMPLATE_RESULT (tmpl
));
5359 if (!uses_template_parms (TI_ARGS (tinfo
)))
5360 inform (input_location
, "use template<> for an explicit specialization");
5361 /* Avoid crash in import_export_decl. */
5362 DECL_INTERFACE_KNOWN (decl
) = 1;
5363 return error_mark_node
;
5367 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
5368 TREE_TYPE (tmpl
) = TREE_TYPE (decl
);
5370 /* Push template declarations for global functions and types. Note
5371 that we do not try to push a global template friend declared in a
5372 template class; such a thing may well depend on the template
5373 parameters of the class. */
5374 if (new_template_p
&& !ctx
5375 && !(is_friend
&& template_class_depth (current_class_type
) > 0))
5377 tmpl
= pushdecl_namespace_level (tmpl
, is_friend
);
5378 if (tmpl
== error_mark_node
)
5379 return error_mark_node
;
5381 /* Hide template friend classes that haven't been declared yet. */
5382 if (is_friend
&& TREE_CODE (decl
) == TYPE_DECL
)
5384 DECL_ANTICIPATED (tmpl
) = 1;
5385 DECL_FRIEND_P (tmpl
) = 1;
5391 tree parms
= DECL_TEMPLATE_PARMS (tmpl
);
5394 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
5395 if (DECL_CONV_FN_P (tmpl
))
5397 int depth
= TMPL_PARMS_DEPTH (parms
);
5399 /* It is a conversion operator. See if the type converted to
5400 depends on innermost template operands. */
5402 if (uses_template_parms_level (TREE_TYPE (TREE_TYPE (tmpl
)),
5404 DECL_TEMPLATE_CONV_FN_P (tmpl
) = 1;
5407 /* Give template template parms a DECL_CONTEXT of the template
5408 for which they are a parameter. */
5409 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
5410 for (i
= TREE_VEC_LENGTH (parms
) - 1; i
>= 0; --i
)
5412 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
5413 if (TREE_CODE (parm
) == TEMPLATE_DECL
)
5414 DECL_CONTEXT (parm
) = tmpl
;
5417 if (TREE_CODE (decl
) == TYPE_DECL
5418 && TYPE_DECL_ALIAS_P (decl
)
5419 && complex_alias_template_p (tmpl
))
5420 TEMPLATE_DECL_COMPLEX_ALIAS_P (tmpl
) = true;
5423 /* The DECL_TI_ARGS of DECL contains full set of arguments referring
5424 back to its most general template. If TMPL is a specialization,
5425 ARGS may only have the innermost set of arguments. Add the missing
5426 argument levels if necessary. */
5427 if (DECL_TEMPLATE_INFO (tmpl
))
5428 args
= add_outermost_template_args (DECL_TI_ARGS (tmpl
), args
);
5430 info
= build_template_info (tmpl
, args
);
5432 if (DECL_IMPLICIT_TYPEDEF_P (decl
))
5433 SET_TYPE_TEMPLATE_INFO (TREE_TYPE (tmpl
), info
);
5436 if (is_primary
&& !DECL_LANG_SPECIFIC (decl
))
5437 retrofit_lang_decl (decl
);
5438 if (DECL_LANG_SPECIFIC (decl
))
5439 DECL_TEMPLATE_INFO (decl
) = info
;
5442 if (flag_implicit_templates
5444 && TREE_PUBLIC (decl
)
5445 && VAR_OR_FUNCTION_DECL_P (decl
))
5446 /* Set DECL_COMDAT on template instantiations; if we force
5447 them to be emitted by explicit instantiation or -frepo,
5448 mark_needed will tell cgraph to do the right thing. */
5449 DECL_COMDAT (decl
) = true;
5451 return DECL_TEMPLATE_RESULT (tmpl
);
5455 push_template_decl (tree decl
)
5457 return push_template_decl_real (decl
, false);
5460 /* FN is an inheriting constructor that inherits from the constructor
5461 template INHERITED; turn FN into a constructor template with a matching
5465 add_inherited_template_parms (tree fn
, tree inherited
)
5468 = INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (inherited
));
5469 inner_parms
= copy_node (inner_parms
);
5471 = tree_cons (size_int (processing_template_decl
+ 1),
5472 inner_parms
, current_template_parms
);
5473 tree tmpl
= build_template_decl (fn
, parms
, /*member*/true);
5474 tree args
= template_parms_to_args (parms
);
5475 DECL_TEMPLATE_INFO (fn
) = build_template_info (tmpl
, args
);
5476 TREE_TYPE (tmpl
) = TREE_TYPE (fn
);
5477 DECL_TEMPLATE_RESULT (tmpl
) = fn
;
5478 DECL_ARTIFICIAL (tmpl
) = true;
5479 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
5483 /* Called when a class template TYPE is redeclared with the indicated
5484 template PARMS, e.g.:
5486 template <class T> struct S;
5487 template <class T> struct S {}; */
5490 redeclare_class_template (tree type
, tree parms
, tree cons
)
5496 if (!TYPE_TEMPLATE_INFO (type
))
5498 error ("%qT is not a template type", type
);
5502 tmpl
= TYPE_TI_TEMPLATE (type
);
5503 if (!PRIMARY_TEMPLATE_P (tmpl
))
5504 /* The type is nested in some template class. Nothing to worry
5505 about here; there are no new template parameters for the nested
5511 error ("template specifiers not specified in declaration of %qD",
5516 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
5517 tmpl_parms
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl
);
5519 if (TREE_VEC_LENGTH (parms
) != TREE_VEC_LENGTH (tmpl_parms
))
5521 error_n (input_location
, TREE_VEC_LENGTH (parms
),
5522 "redeclared with %d template parameter",
5523 "redeclared with %d template parameters",
5524 TREE_VEC_LENGTH (parms
));
5525 inform_n (DECL_SOURCE_LOCATION (tmpl
), TREE_VEC_LENGTH (tmpl_parms
),
5526 "previous declaration %qD used %d template parameter",
5527 "previous declaration %qD used %d template parameters",
5528 tmpl
, TREE_VEC_LENGTH (tmpl_parms
));
5532 for (i
= 0; i
< TREE_VEC_LENGTH (tmpl_parms
); ++i
)
5539 if (TREE_VEC_ELT (tmpl_parms
, i
) == error_mark_node
5540 || TREE_VEC_ELT (parms
, i
) == error_mark_node
)
5543 tmpl_parm
= TREE_VALUE (TREE_VEC_ELT (tmpl_parms
, i
));
5544 if (error_operand_p (tmpl_parm
))
5547 parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
5548 tmpl_default
= TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
));
5549 parm_default
= TREE_PURPOSE (TREE_VEC_ELT (parms
, i
));
5551 /* TMPL_PARM and PARM can be either TYPE_DECL, PARM_DECL, or
5553 if (TREE_CODE (tmpl_parm
) != TREE_CODE (parm
)
5554 || (TREE_CODE (tmpl_parm
) != TYPE_DECL
5555 && !same_type_p (TREE_TYPE (tmpl_parm
), TREE_TYPE (parm
)))
5556 || (TREE_CODE (tmpl_parm
) != PARM_DECL
5557 && (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (tmpl_parm
))
5558 != TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
))))
5559 || (TREE_CODE (tmpl_parm
) == PARM_DECL
5560 && (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (tmpl_parm
))
5561 != TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))))
5563 error ("template parameter %q+#D", tmpl_parm
);
5564 error ("redeclared here as %q#D", parm
);
5568 if (tmpl_default
!= NULL_TREE
&& parm_default
!= NULL_TREE
)
5570 /* We have in [temp.param]:
5572 A template-parameter may not be given default arguments
5573 by two different declarations in the same scope. */
5574 error_at (input_location
, "redefinition of default argument for %q#D", parm
);
5575 inform (DECL_SOURCE_LOCATION (tmpl_parm
),
5576 "original definition appeared here");
5580 if (parm_default
!= NULL_TREE
)
5581 /* Update the previous template parameters (which are the ones
5582 that will really count) with the new default value. */
5583 TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
)) = parm_default
;
5584 else if (tmpl_default
!= NULL_TREE
)
5585 /* Update the new parameters, too; they'll be used as the
5586 parameters for any members. */
5587 TREE_PURPOSE (TREE_VEC_ELT (parms
, i
)) = tmpl_default
;
5589 /* Give each template template parm in this redeclaration a
5590 DECL_CONTEXT of the template for which they are a parameter. */
5591 if (TREE_CODE (parm
) == TEMPLATE_DECL
)
5593 gcc_assert (DECL_CONTEXT (parm
) == NULL_TREE
);
5594 DECL_CONTEXT (parm
) = tmpl
;
5598 // Cannot redeclare a class template with a different set of constraints.
5599 if (!equivalent_constraints (get_constraints (tmpl
), cons
))
5601 error_at (input_location
, "redeclaration %q#D with different "
5602 "constraints", tmpl
);
5603 inform (DECL_SOURCE_LOCATION (tmpl
),
5604 "original declaration appeared here");
5610 /* The actual substitution part of instantiate_non_dependent_expr_sfinae,
5611 to be used when the caller has already checked
5612 (processing_template_decl
5613 && !instantiation_dependent_expression_p (expr)
5614 && potential_constant_expression (expr))
5615 and cleared processing_template_decl. */
5618 instantiate_non_dependent_expr_internal (tree expr
, tsubst_flags_t complain
)
5620 return tsubst_copy_and_build (expr
,
5623 /*in_decl=*/NULL_TREE
,
5624 /*function_p=*/false,
5625 /*integral_constant_expression_p=*/true);
5628 /* Simplify EXPR if it is a non-dependent expression. Returns the
5629 (possibly simplified) expression. */
5632 instantiate_non_dependent_expr_sfinae (tree expr
, tsubst_flags_t complain
)
5634 if (expr
== NULL_TREE
)
5637 /* If we're in a template, but EXPR isn't value dependent, simplify
5638 it. We're supposed to treat:
5640 template <typename T> void f(T[1 + 1]);
5641 template <typename T> void f(T[2]);
5643 as two declarations of the same function, for example. */
5644 if (processing_template_decl
5645 && !instantiation_dependent_expression_p (expr
)
5646 && potential_constant_expression (expr
))
5648 processing_template_decl_sentinel s
;
5649 expr
= instantiate_non_dependent_expr_internal (expr
, complain
);
5655 instantiate_non_dependent_expr (tree expr
)
5657 return instantiate_non_dependent_expr_sfinae (expr
, tf_error
);
5660 /* True iff T is a specialization of a variable template. */
5663 variable_template_specialization_p (tree t
)
5665 if (!VAR_P (t
) || !DECL_LANG_SPECIFIC (t
) || !DECL_TEMPLATE_INFO (t
))
5667 tree tmpl
= DECL_TI_TEMPLATE (t
);
5668 return variable_template_p (tmpl
);
5671 /* Return TRUE iff T is a type alias, a TEMPLATE_DECL for an alias
5672 template declaration, or a TYPE_DECL for an alias declaration. */
5675 alias_type_or_template_p (tree t
)
5679 return ((TREE_CODE (t
) == TYPE_DECL
&& TYPE_DECL_ALIAS_P (t
))
5682 && TYPE_DECL_ALIAS_P (TYPE_NAME (t
)))
5683 || DECL_ALIAS_TEMPLATE_P (t
));
5686 /* Return TRUE iff T is a specialization of an alias template. */
5689 alias_template_specialization_p (const_tree t
)
5691 /* It's an alias template specialization if it's an alias and its
5692 TYPE_NAME is a specialization of a primary template. */
5693 if (TYPE_ALIAS_P (t
))
5695 tree name
= TYPE_NAME (t
);
5696 if (DECL_LANG_SPECIFIC (name
))
5697 if (tree ti
= DECL_TEMPLATE_INFO (name
))
5699 tree tmpl
= TI_TEMPLATE (ti
);
5700 return PRIMARY_TEMPLATE_P (tmpl
);
5706 /* An alias template is complex from a SFINAE perspective if a template-id
5707 using that alias can be ill-formed when the expansion is not, as with
5708 the void_t template. We determine this by checking whether the
5709 expansion for the alias template uses all its template parameters. */
5711 struct uses_all_template_parms_data
5718 uses_all_template_parms_r (tree t
, void *data_
)
5720 struct uses_all_template_parms_data
&data
5721 = *(struct uses_all_template_parms_data
*)data_
;
5722 tree idx
= get_template_parm_index (t
);
5724 if (TEMPLATE_PARM_LEVEL (idx
) == data
.level
)
5725 data
.seen
[TEMPLATE_PARM_IDX (idx
)] = true;
5730 complex_alias_template_p (const_tree tmpl
)
5732 struct uses_all_template_parms_data data
;
5733 tree pat
= DECL_ORIGINAL_TYPE (DECL_TEMPLATE_RESULT (tmpl
));
5734 tree parms
= DECL_TEMPLATE_PARMS (tmpl
);
5735 data
.level
= TMPL_PARMS_DEPTH (parms
);
5736 int len
= TREE_VEC_LENGTH (INNERMOST_TEMPLATE_PARMS (parms
));
5737 data
.seen
= XALLOCAVEC (bool, len
);
5738 for (int i
= 0; i
< len
; ++i
)
5739 data
.seen
[i
] = false;
5741 for_each_template_parm (pat
, uses_all_template_parms_r
, &data
, NULL
, true);
5742 for (int i
= 0; i
< len
; ++i
)
5748 /* Return TRUE iff T is a specialization of a complex alias template with
5749 dependent template-arguments. */
5752 dependent_alias_template_spec_p (const_tree t
)
5754 return (alias_template_specialization_p (t
)
5755 && TEMPLATE_DECL_COMPLEX_ALIAS_P (DECL_TI_TEMPLATE (TYPE_NAME (t
)))
5756 && (any_dependent_template_arguments_p
5757 (INNERMOST_TEMPLATE_ARGS (TYPE_TI_ARGS (t
)))));
5760 /* Return the number of innermost template parameters in TMPL. */
5763 num_innermost_template_parms (tree tmpl
)
5765 tree parms
= INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (tmpl
));
5766 return TREE_VEC_LENGTH (parms
);
5769 /* Return either TMPL or another template that it is equivalent to under DR
5770 1286: An alias that just changes the name of a template is equivalent to
5771 the other template. */
5774 get_underlying_template (tree tmpl
)
5776 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
);
5777 while (DECL_ALIAS_TEMPLATE_P (tmpl
))
5779 tree result
= DECL_ORIGINAL_TYPE (DECL_TEMPLATE_RESULT (tmpl
));
5780 if (TYPE_TEMPLATE_INFO (result
))
5782 tree sub
= TYPE_TI_TEMPLATE (result
);
5783 if (PRIMARY_TEMPLATE_P (sub
)
5784 && (num_innermost_template_parms (tmpl
)
5785 == num_innermost_template_parms (sub
)))
5787 tree alias_args
= INNERMOST_TEMPLATE_ARGS
5788 (template_parms_to_args (DECL_TEMPLATE_PARMS (tmpl
)));
5789 if (!comp_template_args (TYPE_TI_ARGS (result
), alias_args
))
5791 /* The alias type is equivalent to the pattern of the
5792 underlying template, so strip the alias. */
5802 /* Subroutine of convert_nontype_argument. Converts EXPR to TYPE, which
5803 must be a function or a pointer-to-function type, as specified
5804 in [temp.arg.nontype]: disambiguate EXPR if it is an overload set,
5805 and check that the resulting function has external linkage. */
5808 convert_nontype_argument_function (tree type
, tree expr
,
5809 tsubst_flags_t complain
)
5813 linkage_kind linkage
;
5815 fn
= instantiate_type (type
, fns
, tf_none
);
5816 if (fn
== error_mark_node
)
5817 return error_mark_node
;
5820 if (TREE_CODE (fn_no_ptr
) == ADDR_EXPR
)
5821 fn_no_ptr
= TREE_OPERAND (fn_no_ptr
, 0);
5822 if (BASELINK_P (fn_no_ptr
))
5823 fn_no_ptr
= BASELINK_FUNCTIONS (fn_no_ptr
);
5825 /* [temp.arg.nontype]/1
5827 A template-argument for a non-type, non-template template-parameter
5830 -- the address of an object or function with external [C++11: or
5831 internal] linkage. */
5833 if (TREE_CODE (fn_no_ptr
) != FUNCTION_DECL
)
5835 if (complain
& tf_error
)
5837 error ("%qE is not a valid template argument for type %qT",
5839 if (TYPE_PTR_P (type
))
5840 error ("it must be the address of a function with "
5841 "external linkage");
5843 error ("it must be the name of a function with "
5844 "external linkage");
5849 linkage
= decl_linkage (fn_no_ptr
);
5850 if (cxx_dialect
>= cxx11
? linkage
== lk_none
: linkage
!= lk_external
)
5852 if (complain
& tf_error
)
5854 if (cxx_dialect
>= cxx11
)
5855 error ("%qE is not a valid template argument for type %qT "
5856 "because %qD has no linkage",
5857 expr
, type
, fn_no_ptr
);
5859 error ("%qE is not a valid template argument for type %qT "
5860 "because %qD does not have external linkage",
5861 expr
, type
, fn_no_ptr
);
5869 /* Subroutine of convert_nontype_argument.
5870 Check if EXPR of type TYPE is a valid pointer-to-member constant.
5871 Emit an error otherwise. */
5874 check_valid_ptrmem_cst_expr (tree type
, tree expr
,
5875 tsubst_flags_t complain
)
5878 if (expr
&& (null_ptr_cst_p (expr
) || TREE_CODE (expr
) == PTRMEM_CST
))
5880 if (cxx_dialect
>= cxx11
&& null_member_pointer_value_p (expr
))
5882 if (processing_template_decl
5883 && TREE_CODE (expr
) == ADDR_EXPR
5884 && TREE_CODE (TREE_OPERAND (expr
, 0)) == OFFSET_REF
)
5886 if (complain
& tf_error
)
5888 error ("%qE is not a valid template argument for type %qT",
5890 error ("it must be a pointer-to-member of the form %<&X::Y%>");
5895 /* Returns TRUE iff the address of OP is value-dependent.
5897 14.6.2.4 [temp.dep.temp]:
5898 A non-integral non-type template-argument is dependent if its type is
5899 dependent or it has either of the following forms
5902 and contains a nested-name-specifier which specifies a class-name that
5903 names a dependent type.
5905 We generalize this to just say that the address of a member of a
5906 dependent class is value-dependent; the above doesn't cover the
5907 address of a static data member named with an unqualified-id. */
5910 has_value_dependent_address (tree op
)
5912 /* We could use get_inner_reference here, but there's no need;
5913 this is only relevant for template non-type arguments, which
5914 can only be expressed as &id-expression. */
5917 tree ctx
= CP_DECL_CONTEXT (op
);
5918 if (TYPE_P (ctx
) && dependent_type_p (ctx
))
5925 /* The next set of functions are used for providing helpful explanatory
5926 diagnostics for failed overload resolution. Their messages should be
5927 indented by two spaces for consistency with the messages in
5931 unify_success (bool /*explain_p*/)
5937 unify_parameter_deduction_failure (bool explain_p
, tree parm
)
5940 inform (input_location
,
5941 " couldn't deduce template parameter %qD", parm
);
5946 unify_invalid (bool /*explain_p*/)
5952 unify_cv_qual_mismatch (bool explain_p
, tree parm
, tree arg
)
5955 inform (input_location
,
5956 " types %qT and %qT have incompatible cv-qualifiers",
5962 unify_type_mismatch (bool explain_p
, tree parm
, tree arg
)
5965 inform (input_location
, " mismatched types %qT and %qT", parm
, arg
);
5970 unify_parameter_pack_mismatch (bool explain_p
, tree parm
, tree arg
)
5973 inform (input_location
,
5974 " template parameter %qD is not a parameter pack, but "
5981 unify_ptrmem_cst_mismatch (bool explain_p
, tree parm
, tree arg
)
5984 inform (input_location
,
5985 " template argument %qE does not match "
5986 "pointer-to-member constant %qE",
5992 unify_expression_unequal (bool explain_p
, tree parm
, tree arg
)
5995 inform (input_location
, " %qE is not equivalent to %qE", parm
, arg
);
6000 unify_parameter_pack_inconsistent (bool explain_p
, tree old_arg
, tree new_arg
)
6003 inform (input_location
,
6004 " inconsistent parameter pack deduction with %qT and %qT",
6010 unify_inconsistency (bool explain_p
, tree parm
, tree first
, tree second
)
6015 inform (input_location
,
6016 " deduced conflicting types for parameter %qT (%qT and %qT)",
6017 parm
, first
, second
);
6019 inform (input_location
,
6020 " deduced conflicting values for non-type parameter "
6021 "%qE (%qE and %qE)", parm
, first
, second
);
6027 unify_vla_arg (bool explain_p
, tree arg
)
6030 inform (input_location
,
6031 " variable-sized array type %qT is not "
6032 "a valid template argument",
6038 unify_method_type_error (bool explain_p
, tree arg
)
6041 inform (input_location
,
6042 " member function type %qT is not a valid template argument",
6048 unify_arity (bool explain_p
, int have
, int wanted
, bool least_p
= false)
6053 inform_n (input_location
, wanted
,
6054 " candidate expects at least %d argument, %d provided",
6055 " candidate expects at least %d arguments, %d provided",
6058 inform_n (input_location
, wanted
,
6059 " candidate expects %d argument, %d provided",
6060 " candidate expects %d arguments, %d provided",
6067 unify_too_many_arguments (bool explain_p
, int have
, int wanted
)
6069 return unify_arity (explain_p
, have
, wanted
);
6073 unify_too_few_arguments (bool explain_p
, int have
, int wanted
,
6074 bool least_p
= false)
6076 return unify_arity (explain_p
, have
, wanted
, least_p
);
6080 unify_arg_conversion (bool explain_p
, tree to_type
,
6081 tree from_type
, tree arg
)
6084 inform (EXPR_LOC_OR_LOC (arg
, input_location
),
6085 " cannot convert %qE (type %qT) to type %qT",
6086 arg
, from_type
, to_type
);
6091 unify_no_common_base (bool explain_p
, enum template_base_result r
,
6092 tree parm
, tree arg
)
6097 case tbr_ambiguous_baseclass
:
6098 inform (input_location
, " %qT is an ambiguous base class of %qT",
6102 inform (input_location
, " %qT is not derived from %qT", arg
, parm
);
6109 unify_inconsistent_template_template_parameters (bool explain_p
)
6112 inform (input_location
,
6113 " template parameters of a template template argument are "
6114 "inconsistent with other deduced template arguments");
6119 unify_template_deduction_failure (bool explain_p
, tree parm
, tree arg
)
6122 inform (input_location
,
6123 " can't deduce a template for %qT from non-template type %qT",
6129 unify_template_argument_mismatch (bool explain_p
, tree parm
, tree arg
)
6132 inform (input_location
,
6133 " template argument %qE does not match %qD", arg
, parm
);
6138 unify_overload_resolution_failure (bool explain_p
, tree arg
)
6141 inform (input_location
,
6142 " could not resolve address from overloaded function %qE",
6147 /* Attempt to convert the non-type template parameter EXPR to the
6148 indicated TYPE. If the conversion is successful, return the
6149 converted value. If the conversion is unsuccessful, return
6150 NULL_TREE if we issued an error message, or error_mark_node if we
6151 did not. We issue error messages for out-and-out bad template
6152 parameters, but not simply because the conversion failed, since we
6153 might be just trying to do argument deduction. Both TYPE and EXPR
6154 must be non-dependent.
6156 The conversion follows the special rules described in
6157 [temp.arg.nontype], and it is much more strict than an implicit
6160 This function is called twice for each template argument (see
6161 lookup_template_class for a more accurate description of this
6162 problem). This means that we need to handle expressions which
6163 are not valid in a C++ source, but can be created from the
6164 first call (for instance, casts to perform conversions). These
6165 hacks can go away after we fix the double coercion problem. */
6168 convert_nontype_argument (tree type
, tree expr
, tsubst_flags_t complain
)
6172 /* Detect immediately string literals as invalid non-type argument.
6173 This special-case is not needed for correctness (we would easily
6174 catch this later), but only to provide better diagnostic for this
6175 common user mistake. As suggested by DR 100, we do not mention
6176 linkage issues in the diagnostic as this is not the point. */
6177 /* FIXME we're making this OK. */
6178 if (TREE_CODE (expr
) == STRING_CST
)
6180 if (complain
& tf_error
)
6181 error ("%qE is not a valid template argument for type %qT "
6182 "because string literals can never be used in this context",
6187 /* Add the ADDR_EXPR now for the benefit of
6188 value_dependent_expression_p. */
6189 if (TYPE_PTROBV_P (type
)
6190 && TREE_CODE (TREE_TYPE (expr
)) == ARRAY_TYPE
)
6192 expr
= decay_conversion (expr
, complain
);
6193 if (expr
== error_mark_node
)
6194 return error_mark_node
;
6197 /* If we are in a template, EXPR may be non-dependent, but still
6198 have a syntactic, rather than semantic, form. For example, EXPR
6199 might be a SCOPE_REF, rather than the VAR_DECL to which the
6200 SCOPE_REF refers. Preserving the qualifying scope is necessary
6201 so that access checking can be performed when the template is
6202 instantiated -- but here we need the resolved form so that we can
6203 convert the argument. */
6204 bool non_dep
= false;
6205 if (TYPE_REF_OBJ_P (type
)
6206 && has_value_dependent_address (expr
))
6207 /* If we want the address and it's value-dependent, don't fold. */;
6208 else if (!type_unknown_p (expr
)
6209 && processing_template_decl
6210 && !instantiation_dependent_expression_p (expr
)
6211 && potential_constant_expression (expr
))
6213 if (error_operand_p (expr
))
6214 return error_mark_node
;
6215 expr_type
= TREE_TYPE (expr
);
6216 if (TREE_CODE (type
) == REFERENCE_TYPE
)
6217 expr
= mark_lvalue_use (expr
);
6219 expr
= mark_rvalue_use (expr
);
6221 /* If the argument is non-dependent, perform any conversions in
6222 non-dependent context as well. */
6223 processing_template_decl_sentinel
s (non_dep
);
6225 expr
= instantiate_non_dependent_expr_internal (expr
, complain
);
6227 /* 14.3.2/5: The null pointer{,-to-member} conversion is applied
6228 to a non-type argument of "nullptr". */
6229 if (expr
== nullptr_node
&& TYPE_PTR_OR_PTRMEM_P (type
))
6230 expr
= fold_simple (convert (type
, expr
));
6232 /* In C++11, integral or enumeration non-type template arguments can be
6233 arbitrary constant expressions. Pointer and pointer to
6234 member arguments can be general constant expressions that evaluate
6235 to a null value, but otherwise still need to be of a specific form. */
6236 if (cxx_dialect
>= cxx11
)
6238 if (TREE_CODE (expr
) == PTRMEM_CST
)
6239 /* A PTRMEM_CST is already constant, and a valid template
6240 argument for a parameter of pointer to member type, we just want
6241 to leave it in that form rather than lower it to a
6243 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
6244 expr
= maybe_constant_value (expr
);
6245 else if (cxx_dialect
>= cxx1z
)
6247 if (TREE_CODE (type
) != REFERENCE_TYPE
)
6248 expr
= maybe_constant_value (expr
);
6249 else if (REFERENCE_REF_P (expr
))
6251 expr
= TREE_OPERAND (expr
, 0);
6252 expr
= maybe_constant_value (expr
);
6253 expr
= convert_from_reference (expr
);
6256 else if (TYPE_PTR_OR_PTRMEM_P (type
))
6258 tree folded
= maybe_constant_value (expr
);
6259 if (TYPE_PTR_P (type
) ? integer_zerop (folded
)
6260 : null_member_pointer_value_p (folded
))
6265 /* HACK: Due to double coercion, we can get a
6266 NOP_EXPR<REFERENCE_TYPE>(ADDR_EXPR<POINTER_TYPE> (arg)) here,
6267 which is the tree that we built on the first call (see
6268 below when coercing to reference to object or to reference to
6269 function). We just strip everything and get to the arg.
6270 See g++.old-deja/g++.oliva/template4.C and g++.dg/template/nontype9.C
6272 if (TYPE_REF_OBJ_P (type
) || TYPE_REFFN_P (type
))
6274 tree probe_type
, probe
= expr
;
6275 if (REFERENCE_REF_P (probe
))
6276 probe
= TREE_OPERAND (probe
, 0);
6277 probe_type
= TREE_TYPE (probe
);
6278 if (TREE_CODE (probe
) == NOP_EXPR
)
6280 /* ??? Maybe we could use convert_from_reference here, but we
6281 would need to relax its constraints because the NOP_EXPR
6282 could actually change the type to something more cv-qualified,
6283 and this is not folded by convert_from_reference. */
6284 tree addr
= TREE_OPERAND (probe
, 0);
6285 if (TREE_CODE (probe_type
) == REFERENCE_TYPE
6286 && TREE_CODE (addr
) == ADDR_EXPR
6287 && TYPE_PTR_P (TREE_TYPE (addr
))
6288 && (same_type_ignoring_top_level_qualifiers_p
6289 (TREE_TYPE (probe_type
),
6290 TREE_TYPE (TREE_TYPE (addr
)))))
6292 expr
= TREE_OPERAND (addr
, 0);
6293 expr_type
= TREE_TYPE (probe_type
);
6298 /* We could also generate a NOP_EXPR(ADDR_EXPR()) when the
6299 parameter is a pointer to object, through decay and
6300 qualification conversion. Let's strip everything. */
6301 else if (TREE_CODE (expr
) == NOP_EXPR
&& TYPE_PTROBV_P (type
))
6305 if (TREE_CODE (probe
) == ADDR_EXPR
6306 && TYPE_PTR_P (TREE_TYPE (probe
)))
6308 /* Skip the ADDR_EXPR only if it is part of the decay for
6309 an array. Otherwise, it is part of the original argument
6310 in the source code. */
6311 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (probe
, 0))) == ARRAY_TYPE
)
6312 probe
= TREE_OPERAND (probe
, 0);
6314 expr_type
= TREE_TYPE (expr
);
6318 /* [temp.arg.nontype]/5, bullet 1
6320 For a non-type template-parameter of integral or enumeration type,
6321 integral promotions (_conv.prom_) and integral conversions
6322 (_conv.integral_) are applied. */
6323 if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
6325 tree t
= build_integral_nontype_arg_conv (type
, expr
, complain
);
6326 t
= maybe_constant_value (t
);
6327 if (t
!= error_mark_node
)
6330 if (!same_type_ignoring_top_level_qualifiers_p (type
, TREE_TYPE (expr
)))
6331 return error_mark_node
;
6333 /* Notice that there are constant expressions like '4 % 0' which
6334 do not fold into integer constants. */
6335 if (TREE_CODE (expr
) != INTEGER_CST
)
6337 if (complain
& tf_error
)
6339 int errs
= errorcount
, warns
= warningcount
+ werrorcount
;
6340 if (processing_template_decl
6341 && !require_potential_constant_expression (expr
))
6343 expr
= cxx_constant_value (expr
);
6344 if (errorcount
> errs
|| warningcount
+ werrorcount
> warns
)
6345 inform (EXPR_LOC_OR_LOC (expr
, input_location
),
6346 "in template argument for type %qT ", type
);
6347 if (expr
== error_mark_node
)
6349 /* else cxx_constant_value complained but gave us
6350 a real constant, so go ahead. */
6351 gcc_assert (TREE_CODE (expr
) == INTEGER_CST
);
6357 /* Avoid typedef problems. */
6358 if (TREE_TYPE (expr
) != type
)
6359 expr
= fold_convert (type
, expr
);
6361 /* [temp.arg.nontype]/5, bullet 2
6363 For a non-type template-parameter of type pointer to object,
6364 qualification conversions (_conv.qual_) and the array-to-pointer
6365 conversion (_conv.array_) are applied. */
6366 else if (TYPE_PTROBV_P (type
))
6368 /* [temp.arg.nontype]/1 (TC1 version, DR 49):
6370 A template-argument for a non-type, non-template template-parameter
6371 shall be one of: [...]
6373 -- the name of a non-type template-parameter;
6374 -- the address of an object or function with external linkage, [...]
6375 expressed as "& id-expression" where the & is optional if the name
6376 refers to a function or array, or if the corresponding
6377 template-parameter is a reference.
6379 Here, we do not care about functions, as they are invalid anyway
6380 for a parameter of type pointer-to-object. */
6382 if (DECL_P (expr
) && DECL_TEMPLATE_PARM_P (expr
))
6383 /* Non-type template parameters are OK. */
6385 else if (cxx_dialect
>= cxx11
&& integer_zerop (expr
))
6386 /* Null pointer values are OK in C++11. */;
6387 else if (TREE_CODE (expr
) != ADDR_EXPR
6388 && TREE_CODE (expr_type
) != ARRAY_TYPE
)
6392 if (complain
& tf_error
)
6393 error ("%qD is not a valid template argument "
6394 "because %qD is a variable, not the address of "
6395 "a variable", expr
, expr
);
6398 if (POINTER_TYPE_P (expr_type
))
6400 if (complain
& tf_error
)
6401 error ("%qE is not a valid template argument for %qT "
6402 "because it is not the address of a variable",
6406 /* Other values, like integer constants, might be valid
6407 non-type arguments of some other type. */
6408 return error_mark_node
;
6414 decl
= ((TREE_CODE (expr
) == ADDR_EXPR
)
6415 ? TREE_OPERAND (expr
, 0) : expr
);
6418 if (complain
& tf_error
)
6419 error ("%qE is not a valid template argument of type %qT "
6420 "because %qE is not a variable", expr
, type
, decl
);
6423 else if (cxx_dialect
< cxx11
&& !DECL_EXTERNAL_LINKAGE_P (decl
))
6425 if (complain
& tf_error
)
6426 error ("%qE is not a valid template argument of type %qT "
6427 "because %qD does not have external linkage",
6431 else if (cxx_dialect
>= cxx11
&& decl_linkage (decl
) == lk_none
)
6433 if (complain
& tf_error
)
6434 error ("%qE is not a valid template argument of type %qT "
6435 "because %qD has no linkage", expr
, type
, decl
);
6440 expr
= decay_conversion (expr
, complain
);
6441 if (expr
== error_mark_node
)
6442 return error_mark_node
;
6444 expr
= perform_qualification_conversions (type
, expr
);
6445 if (expr
== error_mark_node
)
6446 return error_mark_node
;
6448 /* [temp.arg.nontype]/5, bullet 3
6450 For a non-type template-parameter of type reference to object, no
6451 conversions apply. The type referred to by the reference may be more
6452 cv-qualified than the (otherwise identical) type of the
6453 template-argument. The template-parameter is bound directly to the
6454 template-argument, which must be an lvalue. */
6455 else if (TYPE_REF_OBJ_P (type
))
6457 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type
),
6459 return error_mark_node
;
6461 if (!at_least_as_qualified_p (TREE_TYPE (type
), expr_type
))
6463 if (complain
& tf_error
)
6464 error ("%qE is not a valid template argument for type %qT "
6465 "because of conflicts in cv-qualification", expr
, type
);
6469 if (!real_lvalue_p (expr
))
6471 if (complain
& tf_error
)
6472 error ("%qE is not a valid template argument for type %qT "
6473 "because it is not an lvalue", expr
, type
);
6477 /* [temp.arg.nontype]/1
6479 A template-argument for a non-type, non-template template-parameter
6480 shall be one of: [...]
6482 -- the address of an object or function with external linkage. */
6483 if (INDIRECT_REF_P (expr
)
6484 && TYPE_REF_OBJ_P (TREE_TYPE (TREE_OPERAND (expr
, 0))))
6486 expr
= TREE_OPERAND (expr
, 0);
6489 if (complain
& tf_error
)
6490 error ("%q#D is not a valid template argument for type %qT "
6491 "because a reference variable does not have a constant "
6492 "address", expr
, type
);
6499 if (complain
& tf_error
)
6500 error ("%qE is not a valid template argument for type %qT "
6501 "because it is not an object with linkage",
6506 /* DR 1155 allows internal linkage in C++11 and up. */
6507 linkage_kind linkage
= decl_linkage (expr
);
6508 if (linkage
< (cxx_dialect
>= cxx11
? lk_internal
: lk_external
))
6510 if (complain
& tf_error
)
6511 error ("%qE is not a valid template argument for type %qT "
6512 "because object %qD does not have linkage",
6517 expr
= build_nop (type
, build_address (expr
));
6519 /* [temp.arg.nontype]/5, bullet 4
6521 For a non-type template-parameter of type pointer to function, only
6522 the function-to-pointer conversion (_conv.func_) is applied. If the
6523 template-argument represents a set of overloaded functions (or a
6524 pointer to such), the matching function is selected from the set
6526 else if (TYPE_PTRFN_P (type
))
6528 /* If the argument is a template-id, we might not have enough
6529 context information to decay the pointer. */
6530 if (!type_unknown_p (expr_type
))
6532 expr
= decay_conversion (expr
, complain
);
6533 if (expr
== error_mark_node
)
6534 return error_mark_node
;
6537 if (cxx_dialect
>= cxx11
&& integer_zerop (expr
))
6538 /* Null pointer values are OK in C++11. */
6539 return perform_qualification_conversions (type
, expr
);
6541 expr
= convert_nontype_argument_function (type
, expr
, complain
);
6542 if (!expr
|| expr
== error_mark_node
)
6545 /* [temp.arg.nontype]/5, bullet 5
6547 For a non-type template-parameter of type reference to function, no
6548 conversions apply. If the template-argument represents a set of
6549 overloaded functions, the matching function is selected from the set
6551 else if (TYPE_REFFN_P (type
))
6553 if (TREE_CODE (expr
) == ADDR_EXPR
)
6555 if (complain
& tf_error
)
6557 error ("%qE is not a valid template argument for type %qT "
6558 "because it is a pointer", expr
, type
);
6559 inform (input_location
, "try using %qE instead",
6560 TREE_OPERAND (expr
, 0));
6565 expr
= convert_nontype_argument_function (type
, expr
, complain
);
6566 if (!expr
|| expr
== error_mark_node
)
6569 expr
= build_nop (type
, build_address (expr
));
6571 /* [temp.arg.nontype]/5, bullet 6
6573 For a non-type template-parameter of type pointer to member function,
6574 no conversions apply. If the template-argument represents a set of
6575 overloaded member functions, the matching member function is selected
6576 from the set (_over.over_). */
6577 else if (TYPE_PTRMEMFUNC_P (type
))
6579 expr
= instantiate_type (type
, expr
, tf_none
);
6580 if (expr
== error_mark_node
)
6581 return error_mark_node
;
6583 /* [temp.arg.nontype] bullet 1 says the pointer to member
6584 expression must be a pointer-to-member constant. */
6585 if (!check_valid_ptrmem_cst_expr (type
, expr
, complain
))
6586 return error_mark_node
;
6588 /* There is no way to disable standard conversions in
6589 resolve_address_of_overloaded_function (called by
6590 instantiate_type). It is possible that the call succeeded by
6591 converting &B::I to &D::I (where B is a base of D), so we need
6592 to reject this conversion here.
6594 Actually, even if there was a way to disable standard conversions,
6595 it would still be better to reject them here so that we can
6596 provide a superior diagnostic. */
6597 if (!same_type_p (TREE_TYPE (expr
), type
))
6599 if (complain
& tf_error
)
6601 error ("%qE is not a valid template argument for type %qT "
6602 "because it is of type %qT", expr
, type
,
6604 /* If we are just one standard conversion off, explain. */
6605 if (can_convert_standard (type
, TREE_TYPE (expr
), complain
))
6606 inform (input_location
,
6607 "standard conversions are not allowed in this context");
6612 /* [temp.arg.nontype]/5, bullet 7
6614 For a non-type template-parameter of type pointer to data member,
6615 qualification conversions (_conv.qual_) are applied. */
6616 else if (TYPE_PTRDATAMEM_P (type
))
6618 /* [temp.arg.nontype] bullet 1 says the pointer to member
6619 expression must be a pointer-to-member constant. */
6620 if (!check_valid_ptrmem_cst_expr (type
, expr
, complain
))
6621 return error_mark_node
;
6623 expr
= perform_qualification_conversions (type
, expr
);
6624 if (expr
== error_mark_node
)
6627 else if (NULLPTR_TYPE_P (type
))
6629 if (expr
!= nullptr_node
)
6631 if (complain
& tf_error
)
6632 error ("%qE is not a valid template argument for type %qT "
6633 "because it is of type %qT", expr
, type
, TREE_TYPE (expr
));
6638 /* A template non-type parameter must be one of the above. */
6642 /* Sanity check: did we actually convert the argument to the
6644 gcc_assert (same_type_ignoring_top_level_qualifiers_p
6645 (type
, TREE_TYPE (expr
)));
6646 return convert_from_reference (expr
);
6649 /* Subroutine of coerce_template_template_parms, which returns 1 if
6650 PARM_PARM and ARG_PARM match using the rule for the template
6651 parameters of template template parameters. Both PARM and ARG are
6652 template parameters; the rest of the arguments are the same as for
6653 coerce_template_template_parms.
6656 coerce_template_template_parm (tree parm
,
6658 tsubst_flags_t complain
,
6662 if (arg
== NULL_TREE
|| error_operand_p (arg
)
6663 || parm
== NULL_TREE
|| error_operand_p (parm
))
6666 if (TREE_CODE (arg
) != TREE_CODE (parm
))
6669 switch (TREE_CODE (parm
))
6672 /* We encounter instantiations of templates like
6673 template <template <template <class> class> class TT>
6676 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
6677 tree argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
6679 if (!coerce_template_template_parms
6680 (parmparm
, argparm
, complain
, in_decl
, outer_args
))
6686 if (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (arg
))
6687 && !TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
)))
6688 /* Argument is a parameter pack but parameter is not. */
6693 /* The tsubst call is used to handle cases such as
6695 template <int> class C {};
6696 template <class T, template <T> class TT> class D {};
6699 i.e. the parameter list of TT depends on earlier parameters. */
6700 if (!uses_template_parms (TREE_TYPE (arg
)))
6702 tree t
= tsubst (TREE_TYPE (parm
), outer_args
, complain
, in_decl
);
6703 if (!uses_template_parms (t
)
6704 && !same_type_p (t
, TREE_TYPE (arg
)))
6708 if (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (arg
))
6709 && !TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))
6710 /* Argument is a parameter pack but parameter is not. */
6723 /* Return 1 if PARM_PARMS and ARG_PARMS matches using rule for
6724 template template parameters. Both PARM_PARMS and ARG_PARMS are
6725 vectors of TREE_LIST nodes containing TYPE_DECL, TEMPLATE_DECL
6728 Consider the example:
6729 template <class T> class A;
6730 template<template <class U> class TT> class B;
6732 For B<A>, PARM_PARMS are the parameters to TT, while ARG_PARMS are
6733 the parameters to A, and OUTER_ARGS contains A. */
6736 coerce_template_template_parms (tree parm_parms
,
6738 tsubst_flags_t complain
,
6742 int nparms
, nargs
, i
;
6746 gcc_assert (TREE_CODE (parm_parms
) == TREE_VEC
);
6747 gcc_assert (TREE_CODE (arg_parms
) == TREE_VEC
);
6749 nparms
= TREE_VEC_LENGTH (parm_parms
);
6750 nargs
= TREE_VEC_LENGTH (arg_parms
);
6752 /* Determine whether we have a parameter pack at the end of the
6753 template template parameter's template parameter list. */
6754 if (TREE_VEC_ELT (parm_parms
, nparms
- 1) != error_mark_node
)
6756 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, nparms
- 1));
6758 if (error_operand_p (parm
))
6761 switch (TREE_CODE (parm
))
6765 if (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
)))
6770 if (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))
6780 && !(variadic_p
&& nargs
>= nparms
- 1))
6783 /* Check all of the template parameters except the parameter pack at
6784 the end (if any). */
6785 for (i
= 0; i
< nparms
- variadic_p
; ++i
)
6787 if (TREE_VEC_ELT (parm_parms
, i
) == error_mark_node
6788 || TREE_VEC_ELT (arg_parms
, i
) == error_mark_node
)
6791 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
6792 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
6794 if (!coerce_template_template_parm (parm
, arg
, complain
, in_decl
,
6802 /* Check each of the template parameters in the template
6803 argument against the template parameter pack at the end of
6804 the template template parameter. */
6805 if (TREE_VEC_ELT (parm_parms
, i
) == error_mark_node
)
6808 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
6810 for (; i
< nargs
; ++i
)
6812 if (TREE_VEC_ELT (arg_parms
, i
) == error_mark_node
)
6815 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
6817 if (!coerce_template_template_parm (parm
, arg
, complain
, in_decl
,
6826 /* Verifies that the deduced template arguments (in TARGS) for the
6827 template template parameters (in TPARMS) represent valid bindings,
6828 by comparing the template parameter list of each template argument
6829 to the template parameter list of its corresponding template
6830 template parameter, in accordance with DR150. This
6831 routine can only be called after all template arguments have been
6832 deduced. It will return TRUE if all of the template template
6833 parameter bindings are okay, FALSE otherwise. */
6835 template_template_parm_bindings_ok_p (tree tparms
, tree targs
)
6837 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
6840 /* We're dealing with template parms in this process. */
6841 ++processing_template_decl
;
6843 targs
= INNERMOST_TEMPLATE_ARGS (targs
);
6845 for (i
= 0; i
< ntparms
; ++i
)
6847 tree tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
6848 tree targ
= TREE_VEC_ELT (targs
, i
);
6850 if (TREE_CODE (tparm
) == TEMPLATE_DECL
&& targ
)
6852 tree packed_args
= NULL_TREE
;
6855 if (ARGUMENT_PACK_P (targ
))
6857 /* Look inside the argument pack. */
6858 packed_args
= ARGUMENT_PACK_ARGS (targ
);
6859 len
= TREE_VEC_LENGTH (packed_args
);
6862 for (idx
= 0; idx
< len
; ++idx
)
6864 tree targ_parms
= NULL_TREE
;
6867 /* Extract the next argument from the argument
6869 targ
= TREE_VEC_ELT (packed_args
, idx
);
6871 if (PACK_EXPANSION_P (targ
))
6872 /* Look at the pattern of the pack expansion. */
6873 targ
= PACK_EXPANSION_PATTERN (targ
);
6875 /* Extract the template parameters from the template
6877 if (TREE_CODE (targ
) == TEMPLATE_DECL
)
6878 targ_parms
= DECL_INNERMOST_TEMPLATE_PARMS (targ
);
6879 else if (TREE_CODE (targ
) == TEMPLATE_TEMPLATE_PARM
)
6880 targ_parms
= DECL_INNERMOST_TEMPLATE_PARMS (TYPE_NAME (targ
));
6882 /* Verify that we can coerce the template template
6883 parameters from the template argument to the template
6884 parameter. This requires an exact match. */
6886 && !coerce_template_template_parms
6887 (DECL_INNERMOST_TEMPLATE_PARMS (tparm
),
6902 --processing_template_decl
;
6906 /* Since type attributes aren't mangled, we need to strip them from
6907 template type arguments. */
6910 canonicalize_type_argument (tree arg
, tsubst_flags_t complain
)
6912 if (!arg
|| arg
== error_mark_node
|| arg
== TYPE_CANONICAL (arg
))
6914 bool removed_attributes
= false;
6915 tree canon
= strip_typedefs (arg
, &removed_attributes
);
6916 if (removed_attributes
6917 && (complain
& tf_warning
))
6918 warning (0, "ignoring attributes on template argument %qT", arg
);
6922 // A template declaration can be substituted for a constrained
6923 // template template parameter only when the argument is more
6924 // constrained than the parameter.
6926 is_compatible_template_arg (tree parm
, tree arg
)
6928 tree parm_cons
= get_constraints (parm
);
6930 /* For now, allow constrained template template arguments
6931 and unconstrained template template parameters. */
6932 if (parm_cons
== NULL_TREE
)
6935 tree arg_cons
= get_constraints (arg
);
6937 // If the template parameter is constrained, we need to rewrite its
6938 // constraints in terms of the ARG's template parameters. This ensures
6939 // that all of the template parameter types will have the same depth.
6941 // Note that this is only valid when coerce_template_template_parm is
6942 // true for the innermost template parameters of PARM and ARG. In other
6943 // words, because coercion is successful, this conversion will be valid.
6946 tree args
= template_parms_to_args (DECL_TEMPLATE_PARMS (arg
));
6947 parm_cons
= tsubst_constraint_info (parm_cons
,
6948 INNERMOST_TEMPLATE_ARGS (args
),
6949 tf_none
, NULL_TREE
);
6950 if (parm_cons
== error_mark_node
)
6954 return subsumes (parm_cons
, arg_cons
);
6957 // Convert a placeholder argument into a binding to the original
6958 // parameter. The original parameter is saved as the TREE_TYPE of
6961 convert_wildcard_argument (tree parm
, tree arg
)
6963 TREE_TYPE (arg
) = parm
;
6967 /* Convert the indicated template ARG as necessary to match the
6968 indicated template PARM. Returns the converted ARG, or
6969 error_mark_node if the conversion was unsuccessful. Error and
6970 warning messages are issued under control of COMPLAIN. This
6971 conversion is for the Ith parameter in the parameter list. ARGS is
6972 the full set of template arguments deduced so far. */
6975 convert_template_argument (tree parm
,
6978 tsubst_flags_t complain
,
6984 int is_type
, requires_type
, is_tmpl_type
, requires_tmpl_type
;
6986 if (parm
== error_mark_node
)
6987 return error_mark_node
;
6989 /* Trivially convert placeholders. */
6990 if (TREE_CODE (arg
) == WILDCARD_DECL
)
6991 return convert_wildcard_argument (parm
, arg
);
6993 if (TREE_CODE (arg
) == TREE_LIST
6994 && TREE_CODE (TREE_VALUE (arg
)) == OFFSET_REF
)
6996 /* The template argument was the name of some
6997 member function. That's usually
6998 invalid, but static members are OK. In any
6999 case, grab the underlying fields/functions
7000 and issue an error later if required. */
7001 orig_arg
= TREE_VALUE (arg
);
7002 TREE_TYPE (arg
) = unknown_type_node
;
7007 requires_tmpl_type
= TREE_CODE (parm
) == TEMPLATE_DECL
;
7008 requires_type
= (TREE_CODE (parm
) == TYPE_DECL
7009 || requires_tmpl_type
);
7011 /* When determining whether an argument pack expansion is a template,
7012 look at the pattern. */
7013 if (TREE_CODE (arg
) == TYPE_PACK_EXPANSION
)
7014 arg
= PACK_EXPANSION_PATTERN (arg
);
7016 /* Deal with an injected-class-name used as a template template arg. */
7017 if (requires_tmpl_type
&& CLASS_TYPE_P (arg
))
7019 tree t
= maybe_get_template_decl_from_type_decl (TYPE_NAME (arg
));
7020 if (TREE_CODE (t
) == TEMPLATE_DECL
)
7022 if (cxx_dialect
>= cxx11
)
7023 /* OK under DR 1004. */;
7024 else if (complain
& tf_warning_or_error
)
7025 pedwarn (input_location
, OPT_Wpedantic
, "injected-class-name %qD"
7026 " used as template template argument", TYPE_NAME (arg
));
7027 else if (flag_pedantic_errors
)
7035 ((TREE_CODE (arg
) == TEMPLATE_DECL
7036 && TREE_CODE (DECL_TEMPLATE_RESULT (arg
)) == TYPE_DECL
)
7037 || (requires_tmpl_type
&& TREE_CODE (arg
) == TYPE_ARGUMENT_PACK
)
7038 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
7039 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
);
7042 && (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
7043 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
))
7044 arg
= TYPE_STUB_DECL (arg
);
7046 is_type
= TYPE_P (arg
) || is_tmpl_type
;
7048 if (requires_type
&& ! is_type
&& TREE_CODE (arg
) == SCOPE_REF
7049 && TREE_CODE (TREE_OPERAND (arg
, 0)) == TEMPLATE_TYPE_PARM
)
7051 if (TREE_CODE (TREE_OPERAND (arg
, 1)) == BIT_NOT_EXPR
)
7053 if (complain
& tf_error
)
7054 error ("invalid use of destructor %qE as a type", orig_arg
);
7055 return error_mark_node
;
7058 permerror (input_location
,
7059 "to refer to a type member of a template parameter, "
7060 "use %<typename %E%>", orig_arg
);
7062 orig_arg
= make_typename_type (TREE_OPERAND (arg
, 0),
7063 TREE_OPERAND (arg
, 1),
7069 if (is_type
!= requires_type
)
7073 if (complain
& tf_error
)
7075 error ("type/value mismatch at argument %d in template "
7076 "parameter list for %qD",
7079 inform (input_location
,
7080 " expected a constant of type %qT, got %qT",
7082 (DECL_P (arg
) ? DECL_NAME (arg
) : orig_arg
));
7083 else if (requires_tmpl_type
)
7084 inform (input_location
,
7085 " expected a class template, got %qE", orig_arg
);
7087 inform (input_location
,
7088 " expected a type, got %qE", orig_arg
);
7091 return error_mark_node
;
7093 if (is_tmpl_type
^ requires_tmpl_type
)
7095 if (in_decl
&& (complain
& tf_error
))
7097 error ("type/value mismatch at argument %d in template "
7098 "parameter list for %qD",
7101 inform (input_location
,
7102 " expected a type, got %qT", DECL_NAME (arg
));
7104 inform (input_location
,
7105 " expected a class template, got %qT", orig_arg
);
7107 return error_mark_node
;
7112 if (requires_tmpl_type
)
7114 if (template_parameter_pack_p (parm
) && ARGUMENT_PACK_P (orig_arg
))
7116 else if (TREE_CODE (TREE_TYPE (arg
)) == UNBOUND_CLASS_TEMPLATE
)
7117 /* The number of argument required is not known yet.
7118 Just accept it for now. */
7119 val
= TREE_TYPE (arg
);
7122 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
7125 /* Strip alias templates that are equivalent to another
7127 arg
= get_underlying_template (arg
);
7128 argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
7130 if (coerce_template_template_parms (parmparm
, argparm
,
7136 /* TEMPLATE_TEMPLATE_PARM node is preferred over
7138 if (val
!= error_mark_node
)
7140 if (DECL_TEMPLATE_TEMPLATE_PARM_P (val
))
7141 val
= TREE_TYPE (val
);
7142 if (TREE_CODE (orig_arg
) == TYPE_PACK_EXPANSION
)
7143 val
= make_pack_expansion (val
);
7148 if (in_decl
&& (complain
& tf_error
))
7150 error ("type/value mismatch at argument %d in "
7151 "template parameter list for %qD",
7153 inform (input_location
,
7154 " expected a template of type %qD, got %qT",
7158 val
= error_mark_node
;
7161 // Check that the constraints are compatible before allowing the
7163 if (val
!= error_mark_node
)
7164 if (!is_compatible_template_arg (parm
, arg
))
7166 if (in_decl
&& (complain
& tf_error
))
7168 error ("constraint mismatch at argument %d in "
7169 "template parameter list for %qD",
7171 inform (input_location
, " expected %qD but got %qD",
7174 val
= error_mark_node
;
7180 /* We only form one instance of each template specialization.
7181 Therefore, if we use a non-canonical variant (i.e., a
7182 typedef), any future messages referring to the type will use
7183 the typedef, which is confusing if those future uses do not
7184 themselves also use the typedef. */
7186 val
= canonicalize_type_argument (val
, complain
);
7190 tree t
= tsubst (TREE_TYPE (parm
), args
, complain
, in_decl
);
7192 if (invalid_nontype_parm_type_p (t
, complain
))
7193 return error_mark_node
;
7195 if (template_parameter_pack_p (parm
) && ARGUMENT_PACK_P (orig_arg
))
7197 if (same_type_p (t
, TREE_TYPE (orig_arg
)))
7201 /* Not sure if this is reachable, but it doesn't hurt
7203 error ("type mismatch in nontype parameter pack");
7204 val
= error_mark_node
;
7207 else if (!dependent_template_arg_p (orig_arg
)
7208 && !uses_template_parms (t
))
7209 /* We used to call digest_init here. However, digest_init
7210 will report errors, which we don't want when complain
7211 is zero. More importantly, digest_init will try too
7212 hard to convert things: for example, `0' should not be
7213 converted to pointer type at this point according to
7214 the standard. Accepting this is not merely an
7215 extension, since deciding whether or not these
7216 conversions can occur is part of determining which
7217 function template to call, or whether a given explicit
7218 argument specification is valid. */
7219 val
= convert_nontype_argument (t
, orig_arg
, complain
);
7222 bool removed_attr
= false;
7223 val
= strip_typedefs_expr (orig_arg
, &removed_attr
);
7226 if (val
== NULL_TREE
)
7227 val
= error_mark_node
;
7228 else if (val
== error_mark_node
&& (complain
& tf_error
))
7229 error ("could not convert template argument %qE to %qT", orig_arg
, t
);
7231 if (INDIRECT_REF_P (val
))
7233 /* Reject template arguments that are references to built-in
7234 functions with no library fallbacks. */
7235 const_tree inner
= TREE_OPERAND (val
, 0);
7236 if (TREE_CODE (TREE_TYPE (inner
)) == REFERENCE_TYPE
7237 && TREE_CODE (TREE_TYPE (TREE_TYPE (inner
))) == FUNCTION_TYPE
7238 && TREE_CODE (TREE_TYPE (inner
)) == REFERENCE_TYPE
7239 && 0 < TREE_OPERAND_LENGTH (inner
)
7240 && reject_gcc_builtin (TREE_OPERAND (inner
, 0)))
7241 return error_mark_node
;
7244 if (TREE_CODE (val
) == SCOPE_REF
)
7246 /* Strip typedefs from the SCOPE_REF. */
7247 tree type
= canonicalize_type_argument (TREE_TYPE (val
), complain
);
7248 tree scope
= canonicalize_type_argument (TREE_OPERAND (val
, 0),
7250 val
= build_qualified_name (type
, scope
, TREE_OPERAND (val
, 1),
7251 QUALIFIED_NAME_IS_TEMPLATE (val
));
7258 /* Coerces the remaining template arguments in INNER_ARGS (from
7259 ARG_IDX to the end) into the parameter pack at PARM_IDX in PARMS.
7260 Returns the coerced argument pack. PARM_IDX is the position of this
7261 parameter in the template parameter list. ARGS is the original
7262 template argument list. */
7264 coerce_template_parameter_pack (tree parms
,
7272 tsubst_flags_t complain
)
7274 tree parm
= TREE_VEC_ELT (parms
, parm_idx
);
7275 int nargs
= inner_args
? NUM_TMPL_ARGS (inner_args
) : 0;
7278 tree packed_parms
= NULL_TREE
;
7280 if (arg_idx
> nargs
)
7283 if (tree packs
= fixed_parameter_pack_p (TREE_VALUE (parm
)))
7285 /* When the template parameter is a non-type template parameter pack
7286 or template template parameter pack whose type or template
7287 parameters use parameter packs, we know exactly how many arguments
7288 we are looking for. Build a vector of the instantiated decls for
7289 these template parameters in PACKED_PARMS. */
7290 /* We can't use make_pack_expansion here because it would interpret a
7291 _DECL as a use rather than a declaration. */
7292 tree decl
= TREE_VALUE (parm
);
7293 tree exp
= cxx_make_type (TYPE_PACK_EXPANSION
);
7294 SET_PACK_EXPANSION_PATTERN (exp
, decl
);
7295 PACK_EXPANSION_PARAMETER_PACKS (exp
) = packs
;
7296 SET_TYPE_STRUCTURAL_EQUALITY (exp
);
7298 TREE_VEC_LENGTH (args
)--;
7299 packed_parms
= tsubst_pack_expansion (exp
, args
, complain
, decl
);
7300 TREE_VEC_LENGTH (args
)++;
7302 if (packed_parms
== error_mark_node
)
7303 return error_mark_node
;
7305 /* If we're doing a partial instantiation of a member template,
7306 verify that all of the types used for the non-type
7307 template parameter pack are, in fact, valid for non-type
7308 template parameters. */
7310 && PACK_EXPANSION_P (TREE_VEC_ELT (inner_args
, arg_idx
)))
7312 int j
, len
= TREE_VEC_LENGTH (packed_parms
);
7313 for (j
= 0; j
< len
; ++j
)
7315 tree t
= TREE_TYPE (TREE_VEC_ELT (packed_parms
, j
));
7316 if (invalid_nontype_parm_type_p (t
, complain
))
7317 return error_mark_node
;
7319 /* We don't know how many args we have yet, just
7320 use the unconverted ones for now. */
7324 packed_args
= make_tree_vec (TREE_VEC_LENGTH (packed_parms
));
7326 /* Check if we have a placeholder pack, which indicates we're
7327 in the context of a introduction list. In that case we want
7328 to match this pack to the single placeholder. */
7329 else if (arg_idx
< nargs
7330 && TREE_CODE (TREE_VEC_ELT (inner_args
, arg_idx
)) == WILDCARD_DECL
7331 && WILDCARD_PACK_P (TREE_VEC_ELT (inner_args
, arg_idx
)))
7333 nargs
= arg_idx
+ 1;
7334 packed_args
= make_tree_vec (1);
7337 packed_args
= make_tree_vec (nargs
- arg_idx
);
7339 /* Convert the remaining arguments, which will be a part of the
7340 parameter pack "parm". */
7341 for (; arg_idx
< nargs
; ++arg_idx
)
7343 tree arg
= TREE_VEC_ELT (inner_args
, arg_idx
);
7344 tree actual_parm
= TREE_VALUE (parm
);
7345 int pack_idx
= arg_idx
- parm_idx
;
7349 /* Once we've packed as many args as we have types, stop. */
7350 if (pack_idx
>= TREE_VEC_LENGTH (packed_parms
))
7352 else if (PACK_EXPANSION_P (arg
))
7353 /* We don't know how many args we have yet, just
7354 use the unconverted ones for now. */
7357 actual_parm
= TREE_VEC_ELT (packed_parms
, pack_idx
);
7360 if (arg
== error_mark_node
)
7362 if (complain
& tf_error
)
7363 error ("template argument %d is invalid", arg_idx
+ 1);
7366 arg
= convert_template_argument (actual_parm
,
7367 arg
, new_args
, complain
, parm_idx
,
7369 if (arg
== error_mark_node
)
7371 TREE_VEC_ELT (packed_args
, pack_idx
) = arg
;
7374 if (arg_idx
- parm_idx
< TREE_VEC_LENGTH (packed_args
)
7375 && TREE_VEC_LENGTH (packed_args
) > 0)
7377 if (complain
& tf_error
)
7378 error ("wrong number of template arguments (%d, should be %d)",
7379 arg_idx
- parm_idx
, TREE_VEC_LENGTH (packed_args
));
7380 return error_mark_node
;
7383 if (TREE_CODE (TREE_VALUE (parm
)) == TYPE_DECL
7384 || TREE_CODE (TREE_VALUE (parm
)) == TEMPLATE_DECL
)
7385 argument_pack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
7388 argument_pack
= make_node (NONTYPE_ARGUMENT_PACK
);
7389 TREE_TYPE (argument_pack
)
7390 = tsubst (TREE_TYPE (TREE_VALUE (parm
)), new_args
, complain
, in_decl
);
7391 TREE_CONSTANT (argument_pack
) = 1;
7394 SET_ARGUMENT_PACK_ARGS (argument_pack
, packed_args
);
7396 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (packed_args
,
7397 TREE_VEC_LENGTH (packed_args
));
7398 return argument_pack
;
7401 /* Returns the number of pack expansions in the template argument vector
7405 pack_expansion_args_count (tree args
)
7410 for (i
= 0; i
< TREE_VEC_LENGTH (args
); ++i
)
7412 tree elt
= TREE_VEC_ELT (args
, i
);
7413 if (elt
&& PACK_EXPANSION_P (elt
))
7419 /* Convert all template arguments to their appropriate types, and
7420 return a vector containing the innermost resulting template
7421 arguments. If any error occurs, return error_mark_node. Error and
7422 warning messages are issued under control of COMPLAIN.
7424 If REQUIRE_ALL_ARGS is false, argument deduction will be performed
7425 for arguments not specified in ARGS. Otherwise, if
7426 USE_DEFAULT_ARGS is true, default arguments will be used to fill in
7427 unspecified arguments. If REQUIRE_ALL_ARGS is true, but
7428 USE_DEFAULT_ARGS is false, then all arguments must be specified in
7432 coerce_template_parms (tree parms
,
7435 tsubst_flags_t complain
,
7436 bool require_all_args
,
7437 bool use_default_args
)
7439 int nparms
, nargs
, parm_idx
, arg_idx
, lost
= 0;
7440 tree orig_inner_args
;
7443 tree new_inner_args
;
7444 int saved_unevaluated_operand
;
7445 int saved_inhibit_evaluation_warnings
;
7447 /* When used as a boolean value, indicates whether this is a
7448 variadic template parameter list. Since it's an int, we can also
7449 subtract it from nparms to get the number of non-variadic
7452 int variadic_args_p
= 0;
7453 int post_variadic_parms
= 0;
7455 /* Likewise for parameters with default arguments. */
7458 if (args
== error_mark_node
)
7459 return error_mark_node
;
7461 nparms
= TREE_VEC_LENGTH (parms
);
7463 /* Determine if there are any parameter packs or default arguments. */
7464 for (parm_idx
= 0; parm_idx
< nparms
; ++parm_idx
)
7466 tree parm
= TREE_VEC_ELT (parms
, parm_idx
);
7468 ++post_variadic_parms
;
7469 if (template_parameter_pack_p (TREE_VALUE (parm
)))
7471 if (TREE_PURPOSE (parm
))
7475 inner_args
= orig_inner_args
= INNERMOST_TEMPLATE_ARGS (args
);
7476 /* If there are no parameters that follow a parameter pack, we need to
7477 expand any argument packs so that we can deduce a parameter pack from
7478 some non-packed args followed by an argument pack, as in variadic85.C.
7479 If there are such parameters, we need to leave argument packs intact
7480 so the arguments are assigned properly. This can happen when dealing
7481 with a nested class inside a partial specialization of a class
7482 template, as in variadic92.C, or when deducing a template parameter pack
7483 from a sub-declarator, as in variadic114.C. */
7484 if (!post_variadic_parms
)
7485 inner_args
= expand_template_argument_pack (inner_args
);
7487 /* Count any pack expansion args. */
7488 variadic_args_p
= pack_expansion_args_count (inner_args
);
7490 nargs
= inner_args
? NUM_TMPL_ARGS (inner_args
) : 0;
7491 if ((nargs
> nparms
&& !variadic_p
)
7492 || (nargs
< nparms
- variadic_p
7495 && (!use_default_args
7496 || (TREE_VEC_ELT (parms
, nargs
) != error_mark_node
7497 && !TREE_PURPOSE (TREE_VEC_ELT (parms
, nargs
))))))
7499 if (complain
& tf_error
)
7501 if (variadic_p
|| default_p
)
7503 nparms
-= variadic_p
+ default_p
;
7504 error ("wrong number of template arguments "
7505 "(%d, should be at least %d)", nargs
, nparms
);
7508 error ("wrong number of template arguments "
7509 "(%d, should be %d)", nargs
, nparms
);
7512 inform (DECL_SOURCE_LOCATION (in_decl
),
7513 "provided for %qD", in_decl
);
7516 return error_mark_node
;
7518 /* We can't pass a pack expansion to a non-pack parameter of an alias
7519 template (DR 1430). */
7521 && (DECL_ALIAS_TEMPLATE_P (in_decl
)
7522 || concept_template_p (in_decl
))
7524 && nargs
- variadic_args_p
< nparms
- variadic_p
)
7526 if (complain
& tf_error
)
7528 for (int i
= 0; i
< TREE_VEC_LENGTH (inner_args
); ++i
)
7530 tree arg
= TREE_VEC_ELT (inner_args
, i
);
7531 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
7533 if (PACK_EXPANSION_P (arg
)
7534 && !template_parameter_pack_p (parm
))
7536 if (DECL_ALIAS_TEMPLATE_P (in_decl
))
7537 error_at (location_of (arg
),
7538 "pack expansion argument for non-pack parameter "
7539 "%qD of alias template %qD", parm
, in_decl
);
7541 error_at (location_of (arg
),
7542 "pack expansion argument for non-pack parameter "
7543 "%qD of concept %qD", parm
, in_decl
);
7544 inform (DECL_SOURCE_LOCATION (parm
), "declared here");
7551 return error_mark_node
;
7554 /* We need to evaluate the template arguments, even though this
7555 template-id may be nested within a "sizeof". */
7556 saved_unevaluated_operand
= cp_unevaluated_operand
;
7557 cp_unevaluated_operand
= 0;
7558 saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
7559 c_inhibit_evaluation_warnings
= 0;
7560 new_inner_args
= make_tree_vec (nparms
);
7561 new_args
= add_outermost_template_args (args
, new_inner_args
);
7562 int pack_adjust
= 0;
7563 for (parm_idx
= 0, arg_idx
= 0; parm_idx
< nparms
; parm_idx
++, arg_idx
++)
7568 /* Get the Ith template parameter. */
7569 parm
= TREE_VEC_ELT (parms
, parm_idx
);
7571 if (parm
== error_mark_node
)
7573 TREE_VEC_ELT (new_inner_args
, arg_idx
) = error_mark_node
;
7577 /* Calculate the next argument. */
7578 if (arg_idx
< nargs
)
7579 arg
= TREE_VEC_ELT (inner_args
, arg_idx
);
7583 if (template_parameter_pack_p (TREE_VALUE (parm
))
7584 && !(arg
&& ARGUMENT_PACK_P (arg
)))
7586 /* Some arguments will be placed in the
7587 template parameter pack PARM. */
7588 arg
= coerce_template_parameter_pack (parms
, parm_idx
, args
,
7589 inner_args
, arg_idx
,
7593 if (arg
== NULL_TREE
)
7595 /* We don't know how many args we have yet, just use the
7596 unconverted (and still packed) ones for now. */
7597 new_inner_args
= orig_inner_args
;
7602 TREE_VEC_ELT (new_inner_args
, parm_idx
) = arg
;
7604 /* Store this argument. */
7605 if (arg
== error_mark_node
)
7608 /* We are done with all of the arguments. */
7613 pack_adjust
= TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg
)) - 1;
7614 arg_idx
+= pack_adjust
;
7621 if (PACK_EXPANSION_P (arg
))
7623 /* "If every valid specialization of a variadic template
7624 requires an empty template parameter pack, the template is
7625 ill-formed, no diagnostic required." So check that the
7626 pattern works with this parameter. */
7627 tree pattern
= PACK_EXPANSION_PATTERN (arg
);
7628 tree conv
= convert_template_argument (TREE_VALUE (parm
),
7632 if (conv
== error_mark_node
)
7634 inform (input_location
, "so any instantiation with a "
7635 "non-empty parameter pack would be ill-formed");
7638 else if (TYPE_P (conv
) && !TYPE_P (pattern
))
7639 /* Recover from missing typename. */
7640 TREE_VEC_ELT (inner_args
, arg_idx
)
7641 = make_pack_expansion (conv
);
7643 /* We don't know how many args we have yet, just
7644 use the unconverted ones for now. */
7645 new_inner_args
= inner_args
;
7650 else if (require_all_args
)
7652 /* There must be a default arg in this case. */
7653 arg
= tsubst_template_arg (TREE_PURPOSE (parm
), new_args
,
7655 /* The position of the first default template argument,
7656 is also the number of non-defaulted arguments in NEW_INNER_ARGS.
7658 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
))
7659 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
,
7660 arg_idx
- pack_adjust
);
7665 if (arg
== error_mark_node
)
7667 if (complain
& tf_error
)
7668 error ("template argument %d is invalid", arg_idx
+ 1);
7671 /* This only occurs if there was an error in the template
7672 parameter list itself (which we would already have
7673 reported) that we are trying to recover from, e.g., a class
7674 template with a parameter list such as
7675 template<typename..., typename>. */
7678 arg
= convert_template_argument (TREE_VALUE (parm
),
7679 arg
, new_args
, complain
,
7682 if (arg
== error_mark_node
)
7684 TREE_VEC_ELT (new_inner_args
, arg_idx
- pack_adjust
) = arg
;
7686 cp_unevaluated_operand
= saved_unevaluated_operand
;
7687 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
7689 if (variadic_p
&& arg_idx
< nargs
)
7691 if (complain
& tf_error
)
7693 error ("wrong number of template arguments "
7694 "(%d, should be %d)", nargs
, arg_idx
);
7696 error ("provided for %q+D", in_decl
);
7698 return error_mark_node
;
7702 return error_mark_node
;
7704 if (CHECKING_P
&& !NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
))
7705 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
,
7706 TREE_VEC_LENGTH (new_inner_args
));
7708 return new_inner_args
;
7711 /* Convert all template arguments to their appropriate types, and
7712 return a vector containing the innermost resulting template
7713 arguments. If any error occurs, return error_mark_node. Error and
7714 warning messages are not issued.
7716 Note that no function argument deduction is performed, and default
7717 arguments are used to fill in unspecified arguments. */
7719 coerce_template_parms (tree parms
, tree args
, tree in_decl
)
7721 return coerce_template_parms (parms
, args
, in_decl
, tf_none
, true, true);
7724 /* Convert all template arguments to their appropriate type, and
7725 instantiate default arguments as needed. This returns a vector
7726 containing the innermost resulting template arguments, or
7727 error_mark_node if unsuccessful. */
7729 coerce_template_parms (tree parms
, tree args
, tree in_decl
,
7730 tsubst_flags_t complain
)
7732 return coerce_template_parms (parms
, args
, in_decl
, complain
, true, true);
7735 /* Like coerce_template_parms. If PARMS represents all template
7736 parameters levels, this function returns a vector of vectors
7737 representing all the resulting argument levels. Note that in this
7738 case, only the innermost arguments are coerced because the
7739 outermost ones are supposed to have been coerced already.
7741 Otherwise, if PARMS represents only (the innermost) vector of
7742 parameters, this function returns a vector containing just the
7743 innermost resulting arguments. */
7746 coerce_innermost_template_parms (tree parms
,
7749 tsubst_flags_t complain
,
7750 bool require_all_args
,
7751 bool use_default_args
)
7753 int parms_depth
= TMPL_PARMS_DEPTH (parms
);
7754 int args_depth
= TMPL_ARGS_DEPTH (args
);
7757 if (parms_depth
> 1)
7759 coerced_args
= make_tree_vec (parms_depth
);
7763 for (level
= parms
, cur_depth
= parms_depth
;
7764 parms_depth
> 0 && level
!= NULL_TREE
;
7765 level
= TREE_CHAIN (level
), --cur_depth
)
7768 if (cur_depth
== args_depth
)
7769 l
= coerce_template_parms (TREE_VALUE (level
),
7770 args
, in_decl
, complain
,
7774 l
= TMPL_ARGS_LEVEL (args
, cur_depth
);
7776 if (l
== error_mark_node
)
7777 return error_mark_node
;
7779 SET_TMPL_ARGS_LEVEL (coerced_args
, cur_depth
, l
);
7783 coerced_args
= coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parms
),
7784 args
, in_decl
, complain
,
7787 return coerced_args
;
7790 /* Returns 1 if template args OT and NT are equivalent. */
7793 template_args_equal (tree ot
, tree nt
)
7797 if (nt
== NULL_TREE
|| ot
== NULL_TREE
)
7800 if (TREE_CODE (nt
) == TREE_VEC
)
7801 /* For member templates */
7802 return TREE_CODE (ot
) == TREE_VEC
&& comp_template_args (ot
, nt
);
7803 else if (PACK_EXPANSION_P (ot
))
7804 return (PACK_EXPANSION_P (nt
)
7805 && template_args_equal (PACK_EXPANSION_PATTERN (ot
),
7806 PACK_EXPANSION_PATTERN (nt
))
7807 && template_args_equal (PACK_EXPANSION_EXTRA_ARGS (ot
),
7808 PACK_EXPANSION_EXTRA_ARGS (nt
)));
7809 else if (ARGUMENT_PACK_P (ot
))
7814 if (!ARGUMENT_PACK_P (nt
))
7817 opack
= ARGUMENT_PACK_ARGS (ot
);
7818 npack
= ARGUMENT_PACK_ARGS (nt
);
7819 len
= TREE_VEC_LENGTH (opack
);
7820 if (TREE_VEC_LENGTH (npack
) != len
)
7822 for (i
= 0; i
< len
; ++i
)
7823 if (!template_args_equal (TREE_VEC_ELT (opack
, i
),
7824 TREE_VEC_ELT (npack
, i
)))
7828 else if (ot
&& TREE_CODE (ot
) == ARGUMENT_PACK_SELECT
)
7830 /* We get here probably because we are in the middle of substituting
7831 into the pattern of a pack expansion. In that case the
7832 ARGUMENT_PACK_SELECT temporarily replaces the pack argument we are
7833 interested in. So we want to use the initial pack argument for
7835 ot
= ARGUMENT_PACK_SELECT_FROM_PACK (ot
);
7836 if (nt
&& TREE_CODE (nt
) == ARGUMENT_PACK_SELECT
)
7837 nt
= ARGUMENT_PACK_SELECT_FROM_PACK (nt
);
7838 return template_args_equal (ot
, nt
);
7840 else if (TYPE_P (nt
))
7844 /* Don't treat an alias template specialization with dependent
7845 arguments as equivalent to its underlying type when used as a
7846 template argument; we need them to be distinct so that we
7847 substitute into the specialization arguments at instantiation
7848 time. And aliases can't be equivalent without being ==, so
7849 we don't need to look any deeper. */
7850 if (TYPE_ALIAS_P (nt
) || TYPE_ALIAS_P (ot
))
7853 return same_type_p (ot
, nt
);
7855 else if (TREE_CODE (ot
) == TREE_VEC
|| TYPE_P (ot
))
7859 /* Try to treat a template non-type argument that has been converted
7860 to the parameter type as equivalent to one that hasn't yet. */
7861 for (enum tree_code code1
= TREE_CODE (ot
);
7862 CONVERT_EXPR_CODE_P (code1
)
7863 || code1
== NON_LVALUE_EXPR
;
7864 code1
= TREE_CODE (ot
))
7865 ot
= TREE_OPERAND (ot
, 0);
7866 for (enum tree_code code2
= TREE_CODE (nt
);
7867 CONVERT_EXPR_CODE_P (code2
)
7868 || code2
== NON_LVALUE_EXPR
;
7869 code2
= TREE_CODE (nt
))
7870 nt
= TREE_OPERAND (nt
, 0);
7872 return cp_tree_equal (ot
, nt
);
7876 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets of
7877 template arguments. Returns 0 otherwise, and updates OLDARG_PTR and
7878 NEWARG_PTR with the offending arguments if they are non-NULL. */
7881 comp_template_args_with_info (tree oldargs
, tree newargs
,
7882 tree
*oldarg_ptr
, tree
*newarg_ptr
)
7886 if (oldargs
== newargs
)
7889 if (!oldargs
|| !newargs
)
7892 if (TREE_VEC_LENGTH (oldargs
) != TREE_VEC_LENGTH (newargs
))
7895 for (i
= 0; i
< TREE_VEC_LENGTH (oldargs
); ++i
)
7897 tree nt
= TREE_VEC_ELT (newargs
, i
);
7898 tree ot
= TREE_VEC_ELT (oldargs
, i
);
7900 if (! template_args_equal (ot
, nt
))
7902 if (oldarg_ptr
!= NULL
)
7904 if (newarg_ptr
!= NULL
)
7912 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets
7913 of template arguments. Returns 0 otherwise. */
7916 comp_template_args (tree oldargs
, tree newargs
)
7918 return comp_template_args_with_info (oldargs
, newargs
, NULL
, NULL
);
7922 add_pending_template (tree d
)
7924 tree ti
= (TYPE_P (d
)
7925 ? CLASSTYPE_TEMPLATE_INFO (d
)
7926 : DECL_TEMPLATE_INFO (d
));
7927 struct pending_template
*pt
;
7930 if (TI_PENDING_TEMPLATE_FLAG (ti
))
7933 /* We are called both from instantiate_decl, where we've already had a
7934 tinst_level pushed, and instantiate_template, where we haven't.
7936 level
= !current_tinst_level
|| current_tinst_level
->decl
!= d
;
7939 push_tinst_level (d
);
7941 pt
= ggc_alloc
<pending_template
> ();
7943 pt
->tinst
= current_tinst_level
;
7944 if (last_pending_template
)
7945 last_pending_template
->next
= pt
;
7947 pending_templates
= pt
;
7949 last_pending_template
= pt
;
7951 TI_PENDING_TEMPLATE_FLAG (ti
) = 1;
7958 /* Return a TEMPLATE_ID_EXPR corresponding to the indicated FNS and
7959 ARGLIST. Valid choices for FNS are given in the cp-tree.def
7960 documentation for TEMPLATE_ID_EXPR. */
7963 lookup_template_function (tree fns
, tree arglist
)
7967 if (fns
== error_mark_node
|| arglist
== error_mark_node
)
7968 return error_mark_node
;
7970 gcc_assert (!arglist
|| TREE_CODE (arglist
) == TREE_VEC
);
7972 if (!is_overloaded_fn (fns
) && !identifier_p (fns
))
7974 error ("%q#D is not a function template", fns
);
7975 return error_mark_node
;
7978 if (BASELINK_P (fns
))
7980 BASELINK_FUNCTIONS (fns
) = build2 (TEMPLATE_ID_EXPR
,
7982 BASELINK_FUNCTIONS (fns
),
7987 type
= TREE_TYPE (fns
);
7988 if (TREE_CODE (fns
) == OVERLOAD
|| !type
)
7989 type
= unknown_type_node
;
7991 return build2 (TEMPLATE_ID_EXPR
, type
, fns
, arglist
);
7994 /* Within the scope of a template class S<T>, the name S gets bound
7995 (in build_self_reference) to a TYPE_DECL for the class, not a
7996 TEMPLATE_DECL. If DECL is a TYPE_DECL for current_class_type,
7997 or one of its enclosing classes, and that type is a template,
7998 return the associated TEMPLATE_DECL. Otherwise, the original
8001 Also handle the case when DECL is a TREE_LIST of ambiguous
8002 injected-class-names from different bases. */
8005 maybe_get_template_decl_from_type_decl (tree decl
)
8007 if (decl
== NULL_TREE
)
8010 /* DR 176: A lookup that finds an injected-class-name (10.2
8011 [class.member.lookup]) can result in an ambiguity in certain cases
8012 (for example, if it is found in more than one base class). If all of
8013 the injected-class-names that are found refer to specializations of
8014 the same class template, and if the name is followed by a
8015 template-argument-list, the reference refers to the class template
8016 itself and not a specialization thereof, and is not ambiguous. */
8017 if (TREE_CODE (decl
) == TREE_LIST
)
8019 tree t
, tmpl
= NULL_TREE
;
8020 for (t
= decl
; t
; t
= TREE_CHAIN (t
))
8022 tree elt
= maybe_get_template_decl_from_type_decl (TREE_VALUE (t
));
8025 else if (tmpl
!= elt
)
8028 if (tmpl
&& t
== NULL_TREE
)
8034 return (decl
!= NULL_TREE
8035 && DECL_SELF_REFERENCE_P (decl
)
8036 && CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (decl
)))
8037 ? CLASSTYPE_TI_TEMPLATE (TREE_TYPE (decl
)) : decl
;
8040 /* Given an IDENTIFIER_NODE (or type TEMPLATE_DECL) and a chain of
8041 parameters, find the desired type.
8043 D1 is the PTYPENAME terminal, and ARGLIST is the list of arguments.
8045 IN_DECL, if non-NULL, is the template declaration we are trying to
8048 If ENTERING_SCOPE is nonzero, we are about to enter the scope of
8049 the class we are looking up.
8051 Issue error and warning messages under control of COMPLAIN.
8053 If the template class is really a local class in a template
8054 function, then the FUNCTION_CONTEXT is the function in which it is
8057 ??? Note that this function is currently called *twice* for each
8058 template-id: the first time from the parser, while creating the
8059 incomplete type (finish_template_type), and the second type during the
8060 real instantiation (instantiate_template_class). This is surely something
8061 that we want to avoid. It also causes some problems with argument
8062 coercion (see convert_nontype_argument for more information on this). */
8065 lookup_template_class_1 (tree d1
, tree arglist
, tree in_decl
, tree context
,
8066 int entering_scope
, tsubst_flags_t complain
)
8068 tree templ
= NULL_TREE
, parmlist
;
8075 if (identifier_p (d1
))
8077 tree value
= innermost_non_namespace_value (d1
);
8078 if (value
&& DECL_TEMPLATE_TEMPLATE_PARM_P (value
))
8083 push_decl_namespace (context
);
8084 templ
= lookup_name (d1
);
8085 templ
= maybe_get_template_decl_from_type_decl (templ
);
8087 pop_decl_namespace ();
8090 context
= DECL_CONTEXT (templ
);
8092 else if (TREE_CODE (d1
) == TYPE_DECL
&& MAYBE_CLASS_TYPE_P (TREE_TYPE (d1
)))
8094 tree type
= TREE_TYPE (d1
);
8096 /* If we are declaring a constructor, say A<T>::A<T>, we will get
8097 an implicit typename for the second A. Deal with it. */
8098 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
8099 type
= TREE_TYPE (type
);
8101 if (CLASSTYPE_TEMPLATE_INFO (type
))
8103 templ
= CLASSTYPE_TI_TEMPLATE (type
);
8104 d1
= DECL_NAME (templ
);
8107 else if (TREE_CODE (d1
) == ENUMERAL_TYPE
8108 || (TYPE_P (d1
) && MAYBE_CLASS_TYPE_P (d1
)))
8110 templ
= TYPE_TI_TEMPLATE (d1
);
8111 d1
= DECL_NAME (templ
);
8113 else if (DECL_TYPE_TEMPLATE_P (d1
))
8116 d1
= DECL_NAME (templ
);
8117 context
= DECL_CONTEXT (templ
);
8119 else if (DECL_TEMPLATE_TEMPLATE_PARM_P (d1
))
8122 d1
= DECL_NAME (templ
);
8125 /* Issue an error message if we didn't find a template. */
8128 if (complain
& tf_error
)
8129 error ("%qT is not a template", d1
);
8130 return error_mark_node
;
8133 if (TREE_CODE (templ
) != TEMPLATE_DECL
8134 /* Make sure it's a user visible template, if it was named by
8136 || ((complain
& tf_user
) && !DECL_TEMPLATE_PARM_P (templ
)
8137 && !PRIMARY_TEMPLATE_P (templ
)))
8139 if (complain
& tf_error
)
8141 error ("non-template type %qT used as a template", d1
);
8143 error ("for template declaration %q+D", in_decl
);
8145 return error_mark_node
;
8148 complain
&= ~tf_user
;
8150 /* An alias that just changes the name of a template is equivalent to the
8151 other template, so if any of the arguments are pack expansions, strip
8152 the alias to avoid problems with a pack expansion passed to a non-pack
8153 alias template parameter (DR 1430). */
8154 if (pack_expansion_args_count (INNERMOST_TEMPLATE_ARGS (arglist
)))
8155 templ
= get_underlying_template (templ
);
8157 if (DECL_TEMPLATE_TEMPLATE_PARM_P (templ
))
8159 /* Create a new TEMPLATE_DECL and TEMPLATE_TEMPLATE_PARM node to store
8160 template arguments */
8166 parmlist
= DECL_INNERMOST_TEMPLATE_PARMS (templ
);
8168 /* Consider an example where a template template parameter declared as
8170 template <class T, class U = std::allocator<T> > class TT
8172 The template parameter level of T and U are one level larger than
8173 of TT. To proper process the default argument of U, say when an
8174 instantiation `TT<int>' is seen, we need to build the full
8175 arguments containing {int} as the innermost level. Outer levels,
8176 available when not appearing as default template argument, can be
8177 obtained from the arguments of the enclosing template.
8179 Suppose that TT is later substituted with std::vector. The above
8180 instantiation is `TT<int, std::allocator<T> >' with TT at
8181 level 1, and T at level 2, while the template arguments at level 1
8182 becomes {std::vector} and the inner level 2 is {int}. */
8184 outer
= DECL_CONTEXT (templ
);
8186 outer
= TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (outer
)));
8187 else if (current_template_parms
)
8189 /* This is an argument of the current template, so we haven't set
8190 DECL_CONTEXT yet. */
8191 tree relevant_template_parms
;
8193 /* Parameter levels that are greater than the level of the given
8194 template template parm are irrelevant. */
8195 relevant_template_parms
= current_template_parms
;
8196 while (TMPL_PARMS_DEPTH (relevant_template_parms
)
8197 != TEMPLATE_TYPE_LEVEL (TREE_TYPE (templ
)))
8198 relevant_template_parms
= TREE_CHAIN (relevant_template_parms
);
8200 outer
= template_parms_to_args (relevant_template_parms
);
8204 arglist
= add_to_template_args (outer
, arglist
);
8206 arglist2
= coerce_template_parms (parmlist
, arglist
, templ
,
8208 /*require_all_args=*/true,
8209 /*use_default_args=*/true);
8210 if (arglist2
== error_mark_node
8211 || (!uses_template_parms (arglist2
)
8212 && check_instantiated_args (templ
, arglist2
, complain
)))
8213 return error_mark_node
;
8215 parm
= bind_template_template_parm (TREE_TYPE (templ
), arglist2
);
8220 tree template_type
= TREE_TYPE (templ
);
8223 tree found
= NULL_TREE
;
8226 int is_dependent_type
;
8227 int use_partial_inst_tmpl
= false;
8229 if (template_type
== error_mark_node
)
8230 /* An error occurred while building the template TEMPL, and a
8231 diagnostic has most certainly been emitted for that
8232 already. Let's propagate that error. */
8233 return error_mark_node
;
8235 gen_tmpl
= most_general_template (templ
);
8236 parmlist
= DECL_TEMPLATE_PARMS (gen_tmpl
);
8237 parm_depth
= TMPL_PARMS_DEPTH (parmlist
);
8238 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
8240 if (arg_depth
== 1 && parm_depth
> 1)
8242 /* We've been given an incomplete set of template arguments.
8245 template <class T> struct S1 {
8246 template <class U> struct S2 {};
8247 template <class U> struct S2<U*> {};
8250 we will be called with an ARGLIST of `U*', but the
8251 TEMPLATE will be `template <class T> template
8252 <class U> struct S1<T>::S2'. We must fill in the missing
8255 = add_outermost_template_args (TYPE_TI_ARGS (TREE_TYPE (templ
)),
8257 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
8260 /* Now we should have enough arguments. */
8261 gcc_assert (parm_depth
== arg_depth
);
8263 /* From here on, we're only interested in the most general
8266 /* Calculate the BOUND_ARGS. These will be the args that are
8267 actually tsubst'd into the definition to create the
8269 arglist
= coerce_innermost_template_parms (parmlist
, arglist
, gen_tmpl
,
8271 /*require_all_args=*/true,
8272 /*use_default_args=*/true);
8274 if (arglist
== error_mark_node
)
8275 /* We were unable to bind the arguments. */
8276 return error_mark_node
;
8278 /* In the scope of a template class, explicit references to the
8279 template class refer to the type of the template, not any
8280 instantiation of it. For example, in:
8282 template <class T> class C { void f(C<T>); }
8284 the `C<T>' is just the same as `C'. Outside of the
8285 class, however, such a reference is an instantiation. */
8287 || !PRIMARY_TEMPLATE_P (gen_tmpl
)
8288 || currently_open_class (template_type
))
8289 /* comp_template_args is expensive, check it last. */
8290 && comp_template_args (TYPE_TI_ARGS (template_type
),
8292 return template_type
;
8294 /* If we already have this specialization, return it. */
8295 elt
.tmpl
= gen_tmpl
;
8297 elt
.spec
= NULL_TREE
;
8298 hash
= spec_hasher::hash (&elt
);
8299 entry
= type_specializations
->find_with_hash (&elt
, hash
);
8304 /* If the the template's constraints are not satisfied,
8305 then we cannot form a valid type.
8307 Note that the check is deferred until after the hash
8308 lookup. This prevents redundant checks on previously
8309 instantiated specializations. */
8310 if (flag_concepts
&& !constraints_satisfied_p (gen_tmpl
, arglist
))
8312 if (complain
& tf_error
)
8314 error ("template constraint failure");
8315 diagnose_constraints (input_location
, gen_tmpl
, arglist
);
8317 return error_mark_node
;
8320 is_dependent_type
= uses_template_parms (arglist
);
8322 /* If the deduced arguments are invalid, then the binding
8324 if (!is_dependent_type
8325 && check_instantiated_args (gen_tmpl
,
8326 INNERMOST_TEMPLATE_ARGS (arglist
),
8328 return error_mark_node
;
8330 if (!is_dependent_type
8331 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
8332 && !LAMBDA_TYPE_P (TREE_TYPE (gen_tmpl
))
8333 && TREE_CODE (CP_DECL_CONTEXT (gen_tmpl
)) == NAMESPACE_DECL
)
8335 found
= xref_tag_from_type (TREE_TYPE (gen_tmpl
),
8336 DECL_NAME (gen_tmpl
),
8337 /*tag_scope=*/ts_global
);
8341 context
= tsubst (DECL_CONTEXT (gen_tmpl
), arglist
,
8343 if (context
== error_mark_node
)
8344 return error_mark_node
;
8347 context
= global_namespace
;
8349 /* Create the type. */
8350 if (DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
8352 /* The user referred to a specialization of an alias
8353 template represented by GEN_TMPL.
8355 [temp.alias]/2 says:
8357 When a template-id refers to the specialization of an
8358 alias template, it is equivalent to the associated
8359 type obtained by substitution of its
8360 template-arguments for the template-parameters in the
8361 type-id of the alias template. */
8363 t
= tsubst (TREE_TYPE (gen_tmpl
), arglist
, complain
, in_decl
);
8364 /* Note that the call above (by indirectly calling
8365 register_specialization in tsubst_decl) registers the
8366 TYPE_DECL representing the specialization of the alias
8367 template. So next time someone substitutes ARGLIST for
8368 the template parms into the alias template (GEN_TMPL),
8369 she'll get that TYPE_DECL back. */
8371 if (t
== error_mark_node
)
8374 else if (TREE_CODE (template_type
) == ENUMERAL_TYPE
)
8376 if (!is_dependent_type
)
8378 set_current_access_from_decl (TYPE_NAME (template_type
));
8379 t
= start_enum (TYPE_IDENTIFIER (template_type
), NULL_TREE
,
8380 tsubst (ENUM_UNDERLYING_TYPE (template_type
),
8381 arglist
, complain
, in_decl
),
8382 SCOPED_ENUM_P (template_type
), NULL
);
8384 if (t
== error_mark_node
)
8389 /* We don't want to call start_enum for this type, since
8390 the values for the enumeration constants may involve
8391 template parameters. And, no one should be interested
8392 in the enumeration constants for such a type. */
8393 t
= cxx_make_type (ENUMERAL_TYPE
);
8394 SET_SCOPED_ENUM_P (t
, SCOPED_ENUM_P (template_type
));
8396 SET_OPAQUE_ENUM_P (t
, OPAQUE_ENUM_P (template_type
));
8397 ENUM_FIXED_UNDERLYING_TYPE_P (t
)
8398 = ENUM_FIXED_UNDERLYING_TYPE_P (template_type
);
8400 else if (CLASS_TYPE_P (template_type
))
8402 t
= make_class_type (TREE_CODE (template_type
));
8403 CLASSTYPE_DECLARED_CLASS (t
)
8404 = CLASSTYPE_DECLARED_CLASS (template_type
);
8405 SET_CLASSTYPE_IMPLICIT_INSTANTIATION (t
);
8406 TYPE_FOR_JAVA (t
) = TYPE_FOR_JAVA (template_type
);
8408 /* A local class. Make sure the decl gets registered properly. */
8409 if (context
== current_function_decl
)
8410 pushtag (DECL_NAME (gen_tmpl
), t
, /*tag_scope=*/ts_current
);
8412 if (comp_template_args (CLASSTYPE_TI_ARGS (template_type
), arglist
))
8413 /* This instantiation is another name for the primary
8414 template type. Set the TYPE_CANONICAL field
8416 TYPE_CANONICAL (t
) = template_type
;
8417 else if (any_template_arguments_need_structural_equality_p (arglist
))
8418 /* Some of the template arguments require structural
8419 equality testing, so this template class requires
8420 structural equality testing. */
8421 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8426 /* If we called start_enum or pushtag above, this information
8427 will already be set up. */
8430 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
8432 type_decl
= create_implicit_typedef (DECL_NAME (gen_tmpl
), t
);
8433 DECL_CONTEXT (type_decl
) = TYPE_CONTEXT (t
);
8434 DECL_SOURCE_LOCATION (type_decl
)
8435 = DECL_SOURCE_LOCATION (TYPE_STUB_DECL (template_type
));
8438 type_decl
= TYPE_NAME (t
);
8440 if (CLASS_TYPE_P (template_type
))
8442 TREE_PRIVATE (type_decl
)
8443 = TREE_PRIVATE (TYPE_MAIN_DECL (template_type
));
8444 TREE_PROTECTED (type_decl
)
8445 = TREE_PROTECTED (TYPE_MAIN_DECL (template_type
));
8446 if (CLASSTYPE_VISIBILITY_SPECIFIED (template_type
))
8448 DECL_VISIBILITY_SPECIFIED (type_decl
) = 1;
8449 DECL_VISIBILITY (type_decl
) = CLASSTYPE_VISIBILITY (template_type
);
8453 if (OVERLOAD_TYPE_P (t
)
8454 && !DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
8456 static const char *tags
[] = {"abi_tag", "may_alias"};
8458 for (unsigned ix
= 0; ix
!= 2; ix
++)
8461 = lookup_attribute (tags
[ix
], TYPE_ATTRIBUTES (template_type
));
8465 else if (!TREE_CHAIN (attributes
) && !TYPE_ATTRIBUTES (t
))
8466 TYPE_ATTRIBUTES (t
) = attributes
;
8469 = tree_cons (TREE_PURPOSE (attributes
),
8470 TREE_VALUE (attributes
),
8471 TYPE_ATTRIBUTES (t
));
8475 /* Let's consider the explicit specialization of a member
8476 of a class template specialization that is implicitly instantiated,
8481 template<class U> struct M {}; //#0
8486 struct S<int>::M<char> //#1
8490 [temp.expl.spec]/4 says this is valid.
8492 In this case, when we write:
8495 M is instantiated from the CLASSTYPE_TI_TEMPLATE of #1, not from
8498 When we encounter #1, we want to store the partial instantiation
8499 of M (template<class T> S<int>::M<T>) in its CLASSTYPE_TI_TEMPLATE.
8501 For all cases other than this "explicit specialization of member of a
8502 class template", we just want to store the most general template into
8503 the CLASSTYPE_TI_TEMPLATE of M.
8505 This case of "explicit specialization of member of a class template"
8507 1/ the enclosing class is an instantiation of, and therefore not
8508 the same as, the context of the most general template, and
8509 2/ we aren't looking at the partial instantiation itself, i.e.
8510 the innermost arguments are not the same as the innermost parms of
8511 the most general template.
8513 So it's only when 1/ and 2/ happens that we want to use the partial
8514 instantiation of the member template in lieu of its most general
8517 if (PRIMARY_TEMPLATE_P (gen_tmpl
)
8518 && TMPL_ARGS_HAVE_MULTIPLE_LEVELS (arglist
)
8519 /* the enclosing class must be an instantiation... */
8520 && CLASS_TYPE_P (context
)
8521 && !same_type_p (context
, DECL_CONTEXT (gen_tmpl
)))
8523 tree partial_inst_args
;
8524 TREE_VEC_LENGTH (arglist
)--;
8525 ++processing_template_decl
;
8527 tsubst (INNERMOST_TEMPLATE_ARGS
8528 (TYPE_TI_ARGS (TREE_TYPE (gen_tmpl
))),
8529 arglist
, complain
, NULL_TREE
);
8530 --processing_template_decl
;
8531 TREE_VEC_LENGTH (arglist
)++;
8532 use_partial_inst_tmpl
=
8533 /*...and we must not be looking at the partial instantiation
8535 !comp_template_args (INNERMOST_TEMPLATE_ARGS (arglist
),
8539 if (!use_partial_inst_tmpl
)
8540 /* This case is easy; there are no member templates involved. */
8544 /* This is a full instantiation of a member template. Find
8545 the partial instantiation of which this is an instance. */
8547 /* Temporarily reduce by one the number of levels in the ARGLIST
8548 so as to avoid comparing the last set of arguments. */
8549 TREE_VEC_LENGTH (arglist
)--;
8550 found
= tsubst (gen_tmpl
, arglist
, complain
, NULL_TREE
);
8551 TREE_VEC_LENGTH (arglist
)++;
8552 /* FOUND is either a proper class type, or an alias
8553 template specialization. In the later case, it's a
8554 TYPE_DECL, resulting from the substituting of arguments
8555 for parameters in the TYPE_DECL of the alias template
8556 done earlier. So be careful while getting the template
8558 found
= TREE_CODE (found
) == TYPE_DECL
8559 ? TYPE_TI_TEMPLATE (TREE_TYPE (found
))
8560 : CLASSTYPE_TI_TEMPLATE (found
);
8563 // Build template info for the new specialization.
8564 SET_TYPE_TEMPLATE_INFO (t
, build_template_info (found
, arglist
));
8567 slot
= type_specializations
->find_slot_with_hash (&elt
, hash
, INSERT
);
8568 entry
= ggc_alloc
<spec_entry
> ();
8572 /* Note this use of the partial instantiation so we can check it
8573 later in maybe_process_partial_specialization. */
8574 DECL_TEMPLATE_INSTANTIATIONS (found
)
8575 = tree_cons (arglist
, t
,
8576 DECL_TEMPLATE_INSTANTIATIONS (found
));
8578 if (TREE_CODE (template_type
) == ENUMERAL_TYPE
&& !is_dependent_type
8579 && !DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
8580 /* Now that the type has been registered on the instantiations
8581 list, we set up the enumerators. Because the enumeration
8582 constants may involve the enumeration type itself, we make
8583 sure to register the type first, and then create the
8584 constants. That way, doing tsubst_expr for the enumeration
8585 constants won't result in recursive calls here; we'll find
8586 the instantiation and exit above. */
8587 tsubst_enum (template_type
, t
, arglist
);
8589 if (CLASS_TYPE_P (template_type
) && is_dependent_type
)
8590 /* If the type makes use of template parameters, the
8591 code that generates debugging information will crash. */
8592 DECL_IGNORED_P (TYPE_MAIN_DECL (t
)) = 1;
8594 /* Possibly limit visibility based on template args. */
8595 TREE_PUBLIC (type_decl
) = 1;
8596 determine_visibility (type_decl
);
8598 inherit_targ_abi_tags (t
);
8604 /* Wrapper for lookup_template_class_1. */
8607 lookup_template_class (tree d1
, tree arglist
, tree in_decl
, tree context
,
8608 int entering_scope
, tsubst_flags_t complain
)
8611 timevar_push (TV_TEMPLATE_INST
);
8612 ret
= lookup_template_class_1 (d1
, arglist
, in_decl
, context
,
8613 entering_scope
, complain
);
8614 timevar_pop (TV_TEMPLATE_INST
);
8618 /* Return a TEMPLATE_ID_EXPR for the given variable template and ARGLIST. */
8621 lookup_template_variable (tree templ
, tree arglist
)
8623 /* The type of the expression is NULL_TREE since the template-id could refer
8624 to an explicit or partial specialization. */
8625 tree type
= NULL_TREE
;
8626 if (flag_concepts
&& variable_concept_p (templ
))
8627 /* Except that concepts are always bool. */
8628 type
= boolean_type_node
;
8629 return build2 (TEMPLATE_ID_EXPR
, type
, templ
, arglist
);
8632 /* Instantiate a variable declaration from a TEMPLATE_ID_EXPR for use. */
8635 finish_template_variable (tree var
, tsubst_flags_t complain
)
8637 tree templ
= TREE_OPERAND (var
, 0);
8638 tree arglist
= TREE_OPERAND (var
, 1);
8640 /* We never want to return a VAR_DECL for a variable concept, since they
8641 aren't instantiated. In a template, leave the TEMPLATE_ID_EXPR alone. */
8642 bool concept_p
= flag_concepts
&& variable_concept_p (templ
);
8643 if (concept_p
&& processing_template_decl
)
8646 tree tmpl_args
= DECL_TI_ARGS (DECL_TEMPLATE_RESULT (templ
));
8647 arglist
= add_outermost_template_args (tmpl_args
, arglist
);
8649 tree parms
= DECL_TEMPLATE_PARMS (templ
);
8650 arglist
= coerce_innermost_template_parms (parms
, arglist
, templ
, complain
,
8652 /*use_default*/true);
8654 if (flag_concepts
&& !constraints_satisfied_p (templ
, arglist
))
8656 if (complain
& tf_error
)
8658 error ("constraints for %qD not satisfied", templ
);
8659 diagnose_constraints (location_of (var
), templ
, arglist
);
8661 return error_mark_node
;
8664 /* If a template-id refers to a specialization of a variable
8665 concept, then the expression is true if and only if the
8666 concept's constraints are satisfied by the given template
8669 NOTE: This is an extension of Concepts Lite TS that
8670 allows constraints to be used in expressions. */
8673 tree decl
= DECL_TEMPLATE_RESULT (templ
);
8674 return evaluate_variable_concept (decl
, arglist
);
8677 return instantiate_template (templ
, arglist
, complain
);
8684 /* True when we should also visit template parameters that occur in
8685 non-deduced contexts. */
8686 bool include_nondeduced_p
;
8687 hash_set
<tree
> *visited
;
8690 /* Called from for_each_template_parm via walk_tree. */
8693 for_each_template_parm_r (tree
*tp
, int *walk_subtrees
, void *d
)
8696 struct pair_fn_data
*pfd
= (struct pair_fn_data
*) d
;
8697 tree_fn_t fn
= pfd
->fn
;
8698 void *data
= pfd
->data
;
8699 tree result
= NULL_TREE
;
8701 #define WALK_SUBTREE(NODE) \
8704 result = for_each_template_parm (NODE, fn, data, pfd->visited, \
8705 pfd->include_nondeduced_p); \
8706 if (result) goto out; \
8711 && (pfd
->include_nondeduced_p
|| TREE_CODE (t
) != TYPENAME_TYPE
))
8712 WALK_SUBTREE (TYPE_CONTEXT (t
));
8714 switch (TREE_CODE (t
))
8717 if (TYPE_PTRMEMFUNC_P (t
))
8723 if (!TYPE_TEMPLATE_INFO (t
))
8726 WALK_SUBTREE (TYPE_TI_ARGS (t
));
8730 WALK_SUBTREE (TYPE_MIN_VALUE (t
));
8731 WALK_SUBTREE (TYPE_MAX_VALUE (t
));
8735 /* Since we're not going to walk subtrees, we have to do this
8737 WALK_SUBTREE (TYPE_METHOD_BASETYPE (t
));
8741 /* Check the return type. */
8742 WALK_SUBTREE (TREE_TYPE (t
));
8744 /* Check the parameter types. Since default arguments are not
8745 instantiated until they are needed, the TYPE_ARG_TYPES may
8746 contain expressions that involve template parameters. But,
8747 no-one should be looking at them yet. And, once they're
8748 instantiated, they don't contain template parameters, so
8749 there's no point in looking at them then, either. */
8753 for (parm
= TYPE_ARG_TYPES (t
); parm
; parm
= TREE_CHAIN (parm
))
8754 WALK_SUBTREE (TREE_VALUE (parm
));
8756 /* Since we've already handled the TYPE_ARG_TYPES, we don't
8757 want walk_tree walking into them itself. */
8763 case UNDERLYING_TYPE
:
8764 if (pfd
->include_nondeduced_p
8765 && for_each_template_parm (TYPE_VALUES_RAW (t
), fn
, data
,
8767 pfd
->include_nondeduced_p
))
8768 return error_mark_node
;
8773 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
))
8774 WALK_SUBTREE (DECL_TI_ARGS (t
));
8779 if (TREE_CODE (t
) == CONST_DECL
&& DECL_TEMPLATE_PARM_P (t
))
8780 WALK_SUBTREE (DECL_INITIAL (t
));
8781 if (DECL_CONTEXT (t
)
8782 && pfd
->include_nondeduced_p
)
8783 WALK_SUBTREE (DECL_CONTEXT (t
));
8786 case BOUND_TEMPLATE_TEMPLATE_PARM
:
8787 /* Record template parameters such as `T' inside `TT<T>'. */
8788 WALK_SUBTREE (TYPE_TI_ARGS (t
));
8791 case TEMPLATE_TEMPLATE_PARM
:
8792 case TEMPLATE_TYPE_PARM
:
8793 case TEMPLATE_PARM_INDEX
:
8794 if (fn
&& (*fn
)(t
, data
))
8801 /* A template template parameter is encountered. */
8802 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
8803 WALK_SUBTREE (TREE_TYPE (t
));
8805 /* Already substituted template template parameter */
8811 WALK_SUBTREE (TYPENAME_TYPE_FULLNAME (t
));
8815 if (TREE_TYPE (t
) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t
))
8816 && pfd
->include_nondeduced_p
)
8817 WALK_SUBTREE (TYPE_PTRMEMFUNC_FN_TYPE (TREE_TYPE (t
)));
8822 /* If there's no type, then this thing must be some expression
8823 involving template parameters. */
8824 if (!fn
&& !TREE_TYPE (t
))
8825 return error_mark_node
;
8830 case IMPLICIT_CONV_EXPR
:
8831 case REINTERPRET_CAST_EXPR
:
8832 case CONST_CAST_EXPR
:
8833 case STATIC_CAST_EXPR
:
8834 case DYNAMIC_CAST_EXPR
:
8838 case PSEUDO_DTOR_EXPR
:
8840 return error_mark_node
;
8849 /* We didn't find any template parameters we liked. */
8854 /* For each TEMPLATE_TYPE_PARM, TEMPLATE_TEMPLATE_PARM,
8855 BOUND_TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX in T,
8856 call FN with the parameter and the DATA.
8857 If FN returns nonzero, the iteration is terminated, and
8858 for_each_template_parm returns 1. Otherwise, the iteration
8859 continues. If FN never returns a nonzero value, the value
8860 returned by for_each_template_parm is 0. If FN is NULL, it is
8861 considered to be the function which always returns 1.
8863 If INCLUDE_NONDEDUCED_P, then this routine will also visit template
8864 parameters that occur in non-deduced contexts. When false, only
8865 visits those template parameters that can be deduced. */
8868 for_each_template_parm (tree t
, tree_fn_t fn
, void* data
,
8869 hash_set
<tree
> *visited
,
8870 bool include_nondeduced_p
)
8872 struct pair_fn_data pfd
;
8878 pfd
.include_nondeduced_p
= include_nondeduced_p
;
8880 /* Walk the tree. (Conceptually, we would like to walk without
8881 duplicates, but for_each_template_parm_r recursively calls
8882 for_each_template_parm, so we would need to reorganize a fair
8883 bit to use walk_tree_without_duplicates, so we keep our own
8886 pfd
.visited
= visited
;
8888 pfd
.visited
= new hash_set
<tree
>;
8889 result
= cp_walk_tree (&t
,
8890 for_each_template_parm_r
,
8904 /* Returns true if T depends on any template parameter. */
8907 uses_template_parms (tree t
)
8913 int saved_processing_template_decl
;
8915 saved_processing_template_decl
= processing_template_decl
;
8916 if (!saved_processing_template_decl
)
8917 processing_template_decl
= 1;
8919 dependent_p
= dependent_type_p (t
);
8920 else if (TREE_CODE (t
) == TREE_VEC
)
8921 dependent_p
= any_dependent_template_arguments_p (t
);
8922 else if (TREE_CODE (t
) == TREE_LIST
)
8923 dependent_p
= (uses_template_parms (TREE_VALUE (t
))
8924 || uses_template_parms (TREE_CHAIN (t
)));
8925 else if (TREE_CODE (t
) == TYPE_DECL
)
8926 dependent_p
= dependent_type_p (TREE_TYPE (t
));
8929 || TREE_CODE (t
) == TEMPLATE_PARM_INDEX
8930 || TREE_CODE (t
) == OVERLOAD
8933 || TREE_CODE (t
) == TRAIT_EXPR
8934 || TREE_CODE (t
) == CONSTRUCTOR
8935 || CONSTANT_CLASS_P (t
))
8936 dependent_p
= (type_dependent_expression_p (t
)
8937 || value_dependent_expression_p (t
));
8940 gcc_assert (t
== error_mark_node
);
8941 dependent_p
= false;
8944 processing_template_decl
= saved_processing_template_decl
;
8949 /* Returns true iff current_function_decl is an incompletely instantiated
8950 template. Useful instead of processing_template_decl because the latter
8951 is set to 0 during instantiate_non_dependent_expr. */
8954 in_template_function (void)
8956 tree fn
= current_function_decl
;
8958 ++processing_template_decl
;
8959 ret
= (fn
&& DECL_LANG_SPECIFIC (fn
)
8960 && DECL_TEMPLATE_INFO (fn
)
8961 && any_dependent_template_arguments_p (DECL_TI_ARGS (fn
)));
8962 --processing_template_decl
;
8966 /* Returns true if T depends on any template parameter with level LEVEL. */
8969 uses_template_parms_level (tree t
, int level
)
8971 return for_each_template_parm (t
, template_parm_this_level_p
, &level
, NULL
,
8972 /*include_nondeduced_p=*/true);
8975 /* Returns TRUE iff INST is an instantiation we don't need to do in an
8976 ill-formed translation unit, i.e. a variable or function that isn't
8977 usable in a constant expression. */
8980 neglectable_inst_p (tree d
)
8983 && !(TREE_CODE (d
) == FUNCTION_DECL
? DECL_DECLARED_CONSTEXPR_P (d
)
8984 : decl_maybe_constant_var_p (d
)));
8987 /* Returns TRUE iff we should refuse to instantiate DECL because it's
8988 neglectable and instantiated from within an erroneous instantiation. */
8991 limit_bad_template_recursion (tree decl
)
8993 struct tinst_level
*lev
= current_tinst_level
;
8994 int errs
= errorcount
+ sorrycount
;
8995 if (lev
== NULL
|| errs
== 0 || !neglectable_inst_p (decl
))
8998 for (; lev
; lev
= lev
->next
)
8999 if (neglectable_inst_p (lev
->decl
))
9002 return (lev
&& errs
> lev
->errors
);
9005 static int tinst_depth
;
9006 extern int max_tinst_depth
;
9009 static GTY(()) struct tinst_level
*last_error_tinst_level
;
9011 /* We're starting to instantiate D; record the template instantiation context
9012 for diagnostics and to restore it later. */
9015 push_tinst_level (tree d
)
9017 return push_tinst_level_loc (d
, input_location
);
9020 /* We're starting to instantiate D; record the template instantiation context
9021 at LOC for diagnostics and to restore it later. */
9024 push_tinst_level_loc (tree d
, location_t loc
)
9026 struct tinst_level
*new_level
;
9028 if (tinst_depth
>= max_tinst_depth
)
9030 fatal_error (input_location
,
9031 "template instantiation depth exceeds maximum of %d"
9032 " (use -ftemplate-depth= to increase the maximum)",
9037 /* If the current instantiation caused problems, don't let it instantiate
9038 anything else. Do allow deduction substitution and decls usable in
9039 constant expressions. */
9040 if (limit_bad_template_recursion (d
))
9043 new_level
= ggc_alloc
<tinst_level
> ();
9044 new_level
->decl
= d
;
9045 new_level
->locus
= loc
;
9046 new_level
->errors
= errorcount
+sorrycount
;
9047 new_level
->in_system_header_p
= in_system_header_at (input_location
);
9048 new_level
->next
= current_tinst_level
;
9049 current_tinst_level
= new_level
;
9052 if (GATHER_STATISTICS
&& (tinst_depth
> depth_reached
))
9053 depth_reached
= tinst_depth
;
9058 /* We're done instantiating this template; return to the instantiation
9062 pop_tinst_level (void)
9064 /* Restore the filename and line number stashed away when we started
9065 this instantiation. */
9066 input_location
= current_tinst_level
->locus
;
9067 current_tinst_level
= current_tinst_level
->next
;
9071 /* We're instantiating a deferred template; restore the template
9072 instantiation context in which the instantiation was requested, which
9073 is one step out from LEVEL. Return the corresponding DECL or TYPE. */
9076 reopen_tinst_level (struct tinst_level
*level
)
9078 struct tinst_level
*t
;
9081 for (t
= level
; t
; t
= t
->next
)
9084 current_tinst_level
= level
;
9086 if (current_tinst_level
)
9087 current_tinst_level
->errors
= errorcount
+sorrycount
;
9091 /* Returns the TINST_LEVEL which gives the original instantiation
9094 struct tinst_level
*
9095 outermost_tinst_level (void)
9097 struct tinst_level
*level
= current_tinst_level
;
9100 level
= level
->next
;
9104 /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the
9105 vector of template arguments, as for tsubst.
9107 Returns an appropriate tsubst'd friend declaration. */
9110 tsubst_friend_function (tree decl
, tree args
)
9114 if (TREE_CODE (decl
) == FUNCTION_DECL
9115 && DECL_TEMPLATE_INSTANTIATION (decl
)
9116 && TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
9117 /* This was a friend declared with an explicit template
9118 argument list, e.g.:
9122 to indicate that f was a template instantiation, not a new
9123 function declaration. Now, we have to figure out what
9124 instantiation of what template. */
9126 tree template_id
, arglist
, fns
;
9129 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (current_class_type
));
9131 /* Friend functions are looked up in the containing namespace scope.
9132 We must enter that scope, to avoid finding member functions of the
9133 current class with same name. */
9134 push_nested_namespace (ns
);
9135 fns
= tsubst_expr (DECL_TI_TEMPLATE (decl
), args
,
9136 tf_warning_or_error
, NULL_TREE
,
9137 /*integral_constant_expression_p=*/false);
9138 pop_nested_namespace (ns
);
9139 arglist
= tsubst (DECL_TI_ARGS (decl
), args
,
9140 tf_warning_or_error
, NULL_TREE
);
9141 template_id
= lookup_template_function (fns
, arglist
);
9143 new_friend
= tsubst (decl
, args
, tf_warning_or_error
, NULL_TREE
);
9144 tmpl
= determine_specialization (template_id
, new_friend
,
9146 /*need_member_template=*/0,
9147 TREE_VEC_LENGTH (args
),
9149 return instantiate_template (tmpl
, new_args
, tf_error
);
9152 new_friend
= tsubst (decl
, args
, tf_warning_or_error
, NULL_TREE
);
9154 /* The NEW_FRIEND will look like an instantiation, to the
9155 compiler, but is not an instantiation from the point of view of
9156 the language. For example, we might have had:
9158 template <class T> struct S {
9159 template <class U> friend void f(T, U);
9162 Then, in S<int>, template <class U> void f(int, U) is not an
9163 instantiation of anything. */
9164 if (new_friend
== error_mark_node
)
9165 return error_mark_node
;
9167 DECL_USE_TEMPLATE (new_friend
) = 0;
9168 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
9170 DECL_USE_TEMPLATE (DECL_TEMPLATE_RESULT (new_friend
)) = 0;
9171 DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (new_friend
))
9172 = DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (decl
));
9175 /* The mangled name for the NEW_FRIEND is incorrect. The function
9176 is not a template instantiation and should not be mangled like
9177 one. Therefore, we forget the mangling here; we'll recompute it
9178 later if we need it. */
9179 if (TREE_CODE (new_friend
) != TEMPLATE_DECL
)
9181 SET_DECL_RTL (new_friend
, NULL
);
9182 SET_DECL_ASSEMBLER_NAME (new_friend
, NULL_TREE
);
9185 if (DECL_NAMESPACE_SCOPE_P (new_friend
))
9188 tree new_friend_template_info
;
9189 tree new_friend_result_template_info
;
9191 int new_friend_is_defn
;
9193 /* We must save some information from NEW_FRIEND before calling
9194 duplicate decls since that function will free NEW_FRIEND if
9196 new_friend_template_info
= DECL_TEMPLATE_INFO (new_friend
);
9197 new_friend_is_defn
=
9198 (DECL_INITIAL (DECL_TEMPLATE_RESULT
9199 (template_for_substitution (new_friend
)))
9201 if (TREE_CODE (new_friend
) == TEMPLATE_DECL
)
9203 /* This declaration is a `primary' template. */
9204 DECL_PRIMARY_TEMPLATE (new_friend
) = new_friend
;
9206 new_friend_result_template_info
9207 = DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (new_friend
));
9210 new_friend_result_template_info
= NULL_TREE
;
9212 /* Make the init_value nonzero so pushdecl knows this is a defn. */
9213 if (new_friend_is_defn
)
9214 DECL_INITIAL (new_friend
) = error_mark_node
;
9216 /* Inside pushdecl_namespace_level, we will push into the
9217 current namespace. However, the friend function should go
9218 into the namespace of the template. */
9219 ns
= decl_namespace_context (new_friend
);
9220 push_nested_namespace (ns
);
9221 old_decl
= pushdecl_namespace_level (new_friend
, /*is_friend=*/true);
9222 pop_nested_namespace (ns
);
9224 if (old_decl
== error_mark_node
)
9225 return error_mark_node
;
9227 if (old_decl
!= new_friend
)
9229 /* This new friend declaration matched an existing
9230 declaration. For example, given:
9232 template <class T> void f(T);
9233 template <class U> class C {
9234 template <class T> friend void f(T) {}
9237 the friend declaration actually provides the definition
9238 of `f', once C has been instantiated for some type. So,
9239 old_decl will be the out-of-class template declaration,
9240 while new_friend is the in-class definition.
9242 But, if `f' was called before this point, the
9243 instantiation of `f' will have DECL_TI_ARGS corresponding
9244 to `T' but not to `U', references to which might appear
9245 in the definition of `f'. Previously, the most general
9246 template for an instantiation of `f' was the out-of-class
9247 version; now it is the in-class version. Therefore, we
9248 run through all specialization of `f', adding to their
9249 DECL_TI_ARGS appropriately. In particular, they need a
9250 new set of outer arguments, corresponding to the
9251 arguments for this class instantiation.
9253 The same situation can arise with something like this:
9256 template <class T> class C {
9260 when `C<int>' is instantiated. Now, `f(int)' is defined
9263 if (!new_friend_is_defn
)
9264 /* On the other hand, if the in-class declaration does
9265 *not* provide a definition, then we don't want to alter
9266 existing definitions. We can just leave everything
9271 tree new_template
= TI_TEMPLATE (new_friend_template_info
);
9272 tree new_args
= TI_ARGS (new_friend_template_info
);
9274 /* Overwrite whatever template info was there before, if
9275 any, with the new template information pertaining to
9277 DECL_TEMPLATE_INFO (old_decl
) = new_friend_template_info
;
9279 if (TREE_CODE (old_decl
) != TEMPLATE_DECL
)
9281 /* We should have called reregister_specialization in
9283 gcc_assert (retrieve_specialization (new_template
,
9287 /* Instantiate it if the global has already been used. */
9288 if (DECL_ODR_USED (old_decl
))
9289 instantiate_decl (old_decl
, /*defer_ok=*/true,
9290 /*expl_inst_class_mem_p=*/false);
9296 /* Indicate that the old function template is a partial
9298 DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (old_decl
))
9299 = new_friend_result_template_info
;
9301 gcc_assert (new_template
9302 == most_general_template (new_template
));
9303 gcc_assert (new_template
!= old_decl
);
9305 /* Reassign any specializations already in the hash table
9306 to the new more general template, and add the
9307 additional template args. */
9308 for (t
= DECL_TEMPLATE_INSTANTIATIONS (old_decl
);
9312 tree spec
= TREE_VALUE (t
);
9315 elt
.tmpl
= old_decl
;
9316 elt
.args
= DECL_TI_ARGS (spec
);
9317 elt
.spec
= NULL_TREE
;
9319 decl_specializations
->remove_elt (&elt
);
9322 = add_outermost_template_args (new_args
,
9323 DECL_TI_ARGS (spec
));
9325 register_specialization
9326 (spec
, new_template
, DECL_TI_ARGS (spec
), true, 0);
9329 DECL_TEMPLATE_INSTANTIATIONS (old_decl
) = NULL_TREE
;
9333 /* The information from NEW_FRIEND has been merged into OLD_DECL
9334 by duplicate_decls. */
9335 new_friend
= old_decl
;
9340 tree context
= DECL_CONTEXT (new_friend
);
9344 template <class T> class C {
9345 template <class U> friend void C1<U>::f (); // case 1
9346 friend void C2<T>::f (); // case 2
9348 we only need to make sure CONTEXT is a complete type for
9349 case 2. To distinguish between the two cases, we note that
9350 CONTEXT of case 1 remains dependent type after tsubst while
9351 this isn't true for case 2. */
9352 ++processing_template_decl
;
9353 dependent_p
= dependent_type_p (context
);
9354 --processing_template_decl
;
9357 && !complete_type_or_else (context
, NULL_TREE
))
9358 return error_mark_node
;
9360 if (COMPLETE_TYPE_P (context
))
9362 tree fn
= new_friend
;
9363 /* do_friend adds the TEMPLATE_DECL for any member friend
9364 template even if it isn't a member template, i.e.
9365 template <class T> friend A<T>::f();
9366 Look through it in that case. */
9367 if (TREE_CODE (fn
) == TEMPLATE_DECL
9368 && !PRIMARY_TEMPLATE_P (fn
))
9369 fn
= DECL_TEMPLATE_RESULT (fn
);
9370 /* Check to see that the declaration is really present, and,
9371 possibly obtain an improved declaration. */
9372 fn
= check_classfn (context
, fn
, NULL_TREE
);
9382 /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of
9383 template arguments, as for tsubst.
9385 Returns an appropriate tsubst'd friend type or error_mark_node on
9389 tsubst_friend_class (tree friend_tmpl
, tree args
)
9395 if (DECL_TEMPLATE_TEMPLATE_PARM_P (friend_tmpl
))
9397 tree t
= tsubst (TREE_TYPE (friend_tmpl
), args
, tf_none
, NULL_TREE
);
9398 return TREE_TYPE (t
);
9401 context
= CP_DECL_CONTEXT (friend_tmpl
);
9403 if (context
!= global_namespace
)
9405 if (TREE_CODE (context
) == NAMESPACE_DECL
)
9406 push_nested_namespace (context
);
9408 push_nested_class (tsubst (context
, args
, tf_none
, NULL_TREE
));
9411 /* Look for a class template declaration. We look for hidden names
9412 because two friend declarations of the same template are the
9413 same. For example, in:
9416 template <typename> friend class F;
9418 template <typename> struct B {
9419 template <typename> friend class F;
9422 both F templates are the same. */
9423 tmpl
= lookup_name_real (DECL_NAME (friend_tmpl
), 0, 0,
9424 /*block_p=*/true, 0, LOOKUP_HIDDEN
);
9426 /* But, if we don't find one, it might be because we're in a
9427 situation like this:
9435 Here, in the scope of (say) S<int>, `S' is bound to a TYPE_DECL
9436 for `S<int>', not the TEMPLATE_DECL. */
9437 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
9439 tmpl
= lookup_name_prefer_type (DECL_NAME (friend_tmpl
), 1);
9440 tmpl
= maybe_get_template_decl_from_type_decl (tmpl
);
9443 if (tmpl
&& DECL_CLASS_TEMPLATE_P (tmpl
))
9445 /* The friend template has already been declared. Just
9446 check to see that the declarations match, and install any new
9447 default parameters. We must tsubst the default parameters,
9448 of course. We only need the innermost template parameters
9449 because that is all that redeclare_class_template will look
9451 if (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (friend_tmpl
))
9452 > TMPL_ARGS_DEPTH (args
))
9455 location_t saved_input_location
;
9456 parms
= tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_tmpl
),
9457 args
, tf_warning_or_error
);
9459 saved_input_location
= input_location
;
9460 input_location
= DECL_SOURCE_LOCATION (friend_tmpl
);
9461 tree cons
= get_constraints (tmpl
);
9462 redeclare_class_template (TREE_TYPE (tmpl
), parms
, cons
);
9463 input_location
= saved_input_location
;
9467 friend_type
= TREE_TYPE (tmpl
);
9471 /* The friend template has not already been declared. In this
9472 case, the instantiation of the template class will cause the
9473 injection of this template into the global scope. */
9474 tmpl
= tsubst (friend_tmpl
, args
, tf_warning_or_error
, NULL_TREE
);
9475 if (tmpl
== error_mark_node
)
9476 return error_mark_node
;
9478 /* The new TMPL is not an instantiation of anything, so we
9479 forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE for
9480 the new type because that is supposed to be the corresponding
9481 template decl, i.e., TMPL. */
9482 DECL_USE_TEMPLATE (tmpl
) = 0;
9483 DECL_TEMPLATE_INFO (tmpl
) = NULL_TREE
;
9484 CLASSTYPE_USE_TEMPLATE (TREE_TYPE (tmpl
)) = 0;
9485 CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl
))
9486 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl
)));
9488 /* Inject this template into the global scope. */
9489 friend_type
= TREE_TYPE (pushdecl_top_level_maybe_friend (tmpl
, true));
9492 if (context
!= global_namespace
)
9494 if (TREE_CODE (context
) == NAMESPACE_DECL
)
9495 pop_nested_namespace (context
);
9497 pop_nested_class ();
9503 /* Returns zero if TYPE cannot be completed later due to circularity.
9504 Otherwise returns one. */
9507 can_complete_type_without_circularity (tree type
)
9509 if (type
== NULL_TREE
|| type
== error_mark_node
)
9511 else if (COMPLETE_TYPE_P (type
))
9513 else if (TREE_CODE (type
) == ARRAY_TYPE
&& TYPE_DOMAIN (type
))
9514 return can_complete_type_without_circularity (TREE_TYPE (type
));
9515 else if (CLASS_TYPE_P (type
)
9516 && TYPE_BEING_DEFINED (TYPE_MAIN_VARIANT (type
)))
9522 static tree
tsubst_omp_clauses (tree
, bool, bool, tree
, tsubst_flags_t
, tree
);
9524 /* Apply any attributes which had to be deferred until instantiation
9525 time. DECL_P, ATTRIBUTES and ATTR_FLAGS are as cplus_decl_attributes;
9526 ARGS, COMPLAIN, IN_DECL are as tsubst. */
9529 apply_late_template_attributes (tree
*decl_p
, tree attributes
, int attr_flags
,
9530 tree args
, tsubst_flags_t complain
, tree in_decl
)
9532 tree last_dep
= NULL_TREE
;
9536 for (t
= attributes
; t
; t
= TREE_CHAIN (t
))
9537 if (ATTR_IS_DEPENDENT (t
))
9540 attributes
= copy_list (attributes
);
9544 if (DECL_P (*decl_p
))
9546 if (TREE_TYPE (*decl_p
) == error_mark_node
)
9548 p
= &DECL_ATTRIBUTES (*decl_p
);
9551 p
= &TYPE_ATTRIBUTES (*decl_p
);
9555 tree late_attrs
= NULL_TREE
;
9556 tree
*q
= &late_attrs
;
9558 for (*p
= attributes
; *p
; )
9561 if (ATTR_IS_DEPENDENT (t
))
9563 *p
= TREE_CHAIN (t
);
9564 TREE_CHAIN (t
) = NULL_TREE
;
9565 if ((flag_openmp
|| flag_openmp_simd
|| flag_cilkplus
)
9566 && is_attribute_p ("omp declare simd",
9567 get_attribute_name (t
))
9570 tree clauses
= TREE_VALUE (TREE_VALUE (t
));
9571 clauses
= tsubst_omp_clauses (clauses
, true, false, args
,
9573 c_omp_declare_simd_clauses_to_decls (*decl_p
, clauses
);
9574 clauses
= finish_omp_clauses (clauses
, false, true);
9575 tree parms
= DECL_ARGUMENTS (*decl_p
);
9577 = c_omp_declare_simd_clauses_to_numbers (parms
, clauses
);
9579 TREE_VALUE (TREE_VALUE (t
)) = clauses
;
9581 TREE_VALUE (t
) = NULL_TREE
;
9583 /* If the first attribute argument is an identifier, don't
9584 pass it through tsubst. Attributes like mode, format,
9585 cleanup and several target specific attributes expect it
9587 else if (attribute_takes_identifier_p (get_attribute_name (t
))
9591 = tsubst_expr (TREE_CHAIN (TREE_VALUE (t
)), args
, complain
,
9593 /*integral_constant_expression_p=*/false);
9594 if (chain
!= TREE_CHAIN (TREE_VALUE (t
)))
9596 = tree_cons (NULL_TREE
, TREE_VALUE (TREE_VALUE (t
)),
9599 else if (TREE_VALUE (t
) && PACK_EXPANSION_P (TREE_VALUE (t
)))
9601 /* An attribute pack expansion. */
9602 tree purp
= TREE_PURPOSE (t
);
9603 tree pack
= (tsubst_pack_expansion
9604 (TREE_VALUE (t
), args
, complain
, in_decl
));
9605 int len
= TREE_VEC_LENGTH (pack
);
9606 for (int i
= 0; i
< len
; ++i
)
9608 tree elt
= TREE_VEC_ELT (pack
, i
);
9609 *q
= build_tree_list (purp
, elt
);
9610 q
= &TREE_CHAIN (*q
);
9616 = tsubst_expr (TREE_VALUE (t
), args
, complain
, in_decl
,
9617 /*integral_constant_expression_p=*/false);
9619 q
= &TREE_CHAIN (t
);
9622 p
= &TREE_CHAIN (t
);
9625 cplus_decl_attributes (decl_p
, late_attrs
, attr_flags
);
9629 /* Perform (or defer) access check for typedefs that were referenced
9630 from within the template TMPL code.
9631 This is a subroutine of instantiate_decl and instantiate_class_template.
9632 TMPL is the template to consider and TARGS is the list of arguments of
9636 perform_typedefs_access_check (tree tmpl
, tree targs
)
9638 location_t saved_location
;
9640 qualified_typedef_usage_t
*iter
;
9643 || (!CLASS_TYPE_P (tmpl
)
9644 && TREE_CODE (tmpl
) != FUNCTION_DECL
))
9647 saved_location
= input_location
;
9648 FOR_EACH_VEC_SAFE_ELT (get_types_needing_access_check (tmpl
), i
, iter
)
9650 tree type_decl
= iter
->typedef_decl
;
9651 tree type_scope
= iter
->context
;
9653 if (!type_decl
|| !type_scope
|| !CLASS_TYPE_P (type_scope
))
9656 if (uses_template_parms (type_decl
))
9657 type_decl
= tsubst (type_decl
, targs
, tf_error
, NULL_TREE
);
9658 if (uses_template_parms (type_scope
))
9659 type_scope
= tsubst (type_scope
, targs
, tf_error
, NULL_TREE
);
9661 /* Make access check error messages point to the location
9662 of the use of the typedef. */
9663 input_location
= iter
->locus
;
9664 perform_or_defer_access_check (TYPE_BINFO (type_scope
),
9665 type_decl
, type_decl
,
9666 tf_warning_or_error
);
9668 input_location
= saved_location
;
9672 instantiate_class_template_1 (tree type
)
9674 tree templ
, args
, pattern
, t
, member
;
9678 unsigned int saved_maximum_field_alignment
;
9681 if (type
== error_mark_node
)
9682 return error_mark_node
;
9684 if (COMPLETE_OR_OPEN_TYPE_P (type
)
9685 || uses_template_parms (type
))
9688 /* Figure out which template is being instantiated. */
9689 templ
= most_general_template (CLASSTYPE_TI_TEMPLATE (type
));
9690 gcc_assert (TREE_CODE (templ
) == TEMPLATE_DECL
);
9692 /* Determine what specialization of the original template to
9694 t
= most_specialized_partial_spec (type
, tf_warning_or_error
);
9695 if (t
== error_mark_node
)
9697 TYPE_BEING_DEFINED (type
) = 1;
9698 return error_mark_node
;
9702 /* This TYPE is actually an instantiation of a partial
9703 specialization. We replace the innermost set of ARGS with
9704 the arguments appropriate for substitution. For example,
9707 template <class T> struct S {};
9708 template <class T> struct S<T*> {};
9710 and supposing that we are instantiating S<int*>, ARGS will
9711 presently be {int*} -- but we need {int}. */
9712 pattern
= TREE_TYPE (t
);
9713 args
= TREE_PURPOSE (t
);
9717 pattern
= TREE_TYPE (templ
);
9718 args
= CLASSTYPE_TI_ARGS (type
);
9721 /* If the template we're instantiating is incomplete, then clearly
9722 there's nothing we can do. */
9723 if (!COMPLETE_TYPE_P (pattern
))
9726 /* If we've recursively instantiated too many templates, stop. */
9727 if (! push_tinst_level (type
))
9730 /* Now we're really doing the instantiation. Mark the type as in
9731 the process of being defined. */
9732 TYPE_BEING_DEFINED (type
) = 1;
9734 /* We may be in the middle of deferred access check. Disable
9736 push_deferring_access_checks (dk_no_deferred
);
9738 int saved_unevaluated_operand
= cp_unevaluated_operand
;
9739 int saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
9741 fn_context
= decl_function_context (TYPE_MAIN_DECL (type
));
9742 /* Also avoid push_to_top_level for a lambda in an NSDMI. */
9743 if (!fn_context
&& LAMBDA_TYPE_P (type
) && TYPE_CLASS_SCOPE_P (type
))
9744 fn_context
= error_mark_node
;
9746 push_to_top_level ();
9749 cp_unevaluated_operand
= 0;
9750 c_inhibit_evaluation_warnings
= 0;
9752 /* Use #pragma pack from the template context. */
9753 saved_maximum_field_alignment
= maximum_field_alignment
;
9754 maximum_field_alignment
= TYPE_PRECISION (pattern
);
9756 SET_CLASSTYPE_INTERFACE_UNKNOWN (type
);
9758 /* Set the input location to the most specialized template definition.
9759 This is needed if tsubsting causes an error. */
9760 typedecl
= TYPE_MAIN_DECL (pattern
);
9761 input_location
= DECL_SOURCE_LOCATION (TYPE_NAME (type
)) =
9762 DECL_SOURCE_LOCATION (typedecl
);
9764 TYPE_PACKED (type
) = TYPE_PACKED (pattern
);
9765 TYPE_ALIGN (type
) = TYPE_ALIGN (pattern
);
9766 TYPE_USER_ALIGN (type
) = TYPE_USER_ALIGN (pattern
);
9767 TYPE_FOR_JAVA (type
) = TYPE_FOR_JAVA (pattern
); /* For libjava's JArray<T> */
9768 if (ANON_AGGR_TYPE_P (pattern
))
9769 SET_ANON_AGGR_TYPE_P (type
);
9770 if (CLASSTYPE_VISIBILITY_SPECIFIED (pattern
))
9772 CLASSTYPE_VISIBILITY_SPECIFIED (type
) = 1;
9773 CLASSTYPE_VISIBILITY (type
) = CLASSTYPE_VISIBILITY (pattern
);
9774 /* Adjust visibility for template arguments. */
9775 determine_visibility (TYPE_MAIN_DECL (type
));
9777 if (CLASS_TYPE_P (type
))
9778 CLASSTYPE_FINAL (type
) = CLASSTYPE_FINAL (pattern
);
9780 pbinfo
= TYPE_BINFO (pattern
);
9782 /* We should never instantiate a nested class before its enclosing
9783 class; we need to look up the nested class by name before we can
9784 instantiate it, and that lookup should instantiate the enclosing
9786 gcc_assert (!DECL_CLASS_SCOPE_P (TYPE_MAIN_DECL (pattern
))
9787 || COMPLETE_OR_OPEN_TYPE_P (TYPE_CONTEXT (type
)));
9789 base_list
= NULL_TREE
;
9790 if (BINFO_N_BASE_BINFOS (pbinfo
))
9796 /* We must enter the scope containing the type, as that is where
9797 the accessibility of types named in dependent bases are
9799 pushed_scope
= push_scope (CP_TYPE_CONTEXT (type
));
9801 /* Substitute into each of the bases to determine the actual
9803 for (i
= 0; BINFO_BASE_ITERATE (pbinfo
, i
, pbase_binfo
); i
++)
9806 tree access
= BINFO_BASE_ACCESS (pbinfo
, i
);
9807 tree expanded_bases
= NULL_TREE
;
9810 if (PACK_EXPANSION_P (BINFO_TYPE (pbase_binfo
)))
9813 tsubst_pack_expansion (BINFO_TYPE (pbase_binfo
),
9814 args
, tf_error
, NULL_TREE
);
9815 if (expanded_bases
== error_mark_node
)
9818 len
= TREE_VEC_LENGTH (expanded_bases
);
9821 for (idx
= 0; idx
< len
; idx
++)
9824 /* Extract the already-expanded base class. */
9825 base
= TREE_VEC_ELT (expanded_bases
, idx
);
9827 /* Substitute to figure out the base class. */
9828 base
= tsubst (BINFO_TYPE (pbase_binfo
), args
, tf_error
,
9831 if (base
== error_mark_node
)
9834 base_list
= tree_cons (access
, base
, base_list
);
9835 if (BINFO_VIRTUAL_P (pbase_binfo
))
9836 TREE_TYPE (base_list
) = integer_type_node
;
9840 /* The list is now in reverse order; correct that. */
9841 base_list
= nreverse (base_list
);
9844 pop_scope (pushed_scope
);
9846 /* Now call xref_basetypes to set up all the base-class
9848 xref_basetypes (type
, base_list
);
9850 apply_late_template_attributes (&type
, TYPE_ATTRIBUTES (pattern
),
9851 (int) ATTR_FLAG_TYPE_IN_PLACE
,
9852 args
, tf_error
, NULL_TREE
);
9853 fixup_attribute_variants (type
);
9855 /* Now that our base classes are set up, enter the scope of the
9856 class, so that name lookups into base classes, etc. will work
9857 correctly. This is precisely analogous to what we do in
9858 begin_class_definition when defining an ordinary non-template
9859 class, except we also need to push the enclosing classes. */
9860 push_nested_class (type
);
9862 /* Now members are processed in the order of declaration. */
9863 for (member
= CLASSTYPE_DECL_LIST (pattern
);
9864 member
; member
= TREE_CHAIN (member
))
9866 tree t
= TREE_VALUE (member
);
9868 if (TREE_PURPOSE (member
))
9872 /* Build new CLASSTYPE_NESTED_UTDS. */
9875 bool class_template_p
;
9877 class_template_p
= (TREE_CODE (t
) != ENUMERAL_TYPE
9878 && TYPE_LANG_SPECIFIC (t
)
9879 && CLASSTYPE_IS_TEMPLATE (t
));
9880 /* If the member is a class template, then -- even after
9881 substitution -- there may be dependent types in the
9882 template argument list for the class. We increment
9883 PROCESSING_TEMPLATE_DECL so that dependent_type_p, as
9884 that function will assume that no types are dependent
9885 when outside of a template. */
9886 if (class_template_p
)
9887 ++processing_template_decl
;
9888 newtag
= tsubst (t
, args
, tf_error
, NULL_TREE
);
9889 if (class_template_p
)
9890 --processing_template_decl
;
9891 if (newtag
== error_mark_node
)
9894 if (TREE_CODE (newtag
) != ENUMERAL_TYPE
)
9896 tree name
= TYPE_IDENTIFIER (t
);
9898 if (class_template_p
)
9899 /* Unfortunately, lookup_template_class sets
9900 CLASSTYPE_IMPLICIT_INSTANTIATION for a partial
9901 instantiation (i.e., for the type of a member
9902 template class nested within a template class.)
9903 This behavior is required for
9904 maybe_process_partial_specialization to work
9905 correctly, but is not accurate in this case;
9906 the TAG is not an instantiation of anything.
9907 (The corresponding TEMPLATE_DECL is an
9908 instantiation, but the TYPE is not.) */
9909 CLASSTYPE_USE_TEMPLATE (newtag
) = 0;
9911 /* Now, we call pushtag to put this NEWTAG into the scope of
9912 TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid
9913 pushtag calling push_template_decl. We don't have to do
9914 this for enums because it will already have been done in
9917 SET_IDENTIFIER_TYPE_VALUE (name
, newtag
);
9918 pushtag (name
, newtag
, /*tag_scope=*/ts_current
);
9921 else if (DECL_DECLARES_FUNCTION_P (t
))
9923 /* Build new TYPE_METHODS. */
9926 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9927 ++processing_template_decl
;
9928 r
= tsubst (t
, args
, tf_error
, NULL_TREE
);
9929 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9930 --processing_template_decl
;
9931 set_current_access_from_decl (r
);
9932 finish_member_declaration (r
);
9933 /* Instantiate members marked with attribute used. */
9934 if (r
!= error_mark_node
&& DECL_PRESERVE_P (r
))
9936 if (TREE_CODE (r
) == FUNCTION_DECL
9937 && DECL_OMP_DECLARE_REDUCTION_P (r
))
9938 cp_check_omp_declare_reduction (r
);
9940 else if (DECL_CLASS_TEMPLATE_P (t
)
9941 && LAMBDA_TYPE_P (TREE_TYPE (t
)))
9942 /* A closure type for a lambda in a default argument for a
9943 member template. Ignore it; it will be instantiated with
9944 the default argument. */;
9947 /* Build new TYPE_FIELDS. */
9948 if (TREE_CODE (t
) == STATIC_ASSERT
)
9952 ++c_inhibit_evaluation_warnings
;
9954 tsubst_expr (STATIC_ASSERT_CONDITION (t
), args
,
9955 tf_warning_or_error
, NULL_TREE
,
9956 /*integral_constant_expression_p=*/true);
9957 --c_inhibit_evaluation_warnings
;
9959 finish_static_assert (condition
,
9960 STATIC_ASSERT_MESSAGE (t
),
9961 STATIC_ASSERT_SOURCE_LOCATION (t
),
9964 else if (TREE_CODE (t
) != CONST_DECL
)
9967 tree vec
= NULL_TREE
;
9970 /* The file and line for this declaration, to
9971 assist in error message reporting. Since we
9972 called push_tinst_level above, we don't need to
9974 input_location
= DECL_SOURCE_LOCATION (t
);
9976 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9977 ++processing_template_decl
;
9978 r
= tsubst (t
, args
, tf_warning_or_error
, NULL_TREE
);
9979 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9980 --processing_template_decl
;
9982 if (TREE_CODE (r
) == TREE_VEC
)
9984 /* A capture pack became multiple fields. */
9986 len
= TREE_VEC_LENGTH (vec
);
9989 for (int i
= 0; i
< len
; ++i
)
9992 r
= TREE_VEC_ELT (vec
, i
);
9997 [t]he initialization (and any associated
9998 side-effects) of a static data member does
9999 not occur unless the static data member is
10000 itself used in a way that requires the
10001 definition of the static data member to
10004 Therefore, we do not substitute into the
10005 initialized for the static data member here. */
10006 finish_static_data_member_decl
10008 /*init=*/NULL_TREE
,
10009 /*init_const_expr_p=*/false,
10010 /*asmspec_tree=*/NULL_TREE
,
10012 /* Instantiate members marked with attribute used. */
10013 if (r
!= error_mark_node
&& DECL_PRESERVE_P (r
))
10016 else if (TREE_CODE (r
) == FIELD_DECL
)
10018 /* Determine whether R has a valid type and can be
10019 completed later. If R is invalid, then its type
10020 is replaced by error_mark_node. */
10021 tree rtype
= TREE_TYPE (r
);
10022 if (can_complete_type_without_circularity (rtype
))
10023 complete_type (rtype
);
10025 if (!COMPLETE_TYPE_P (rtype
))
10027 cxx_incomplete_type_error (r
, rtype
);
10028 TREE_TYPE (r
) = error_mark_node
;
10032 /* If it is a TYPE_DECL for a class-scoped ENUMERAL_TYPE,
10033 such a thing will already have been added to the field
10034 list by tsubst_enum in finish_member_declaration in the
10035 CLASSTYPE_NESTED_UTDS case above. */
10036 if (!(TREE_CODE (r
) == TYPE_DECL
10037 && TREE_CODE (TREE_TYPE (r
)) == ENUMERAL_TYPE
10038 && DECL_ARTIFICIAL (r
)))
10040 set_current_access_from_decl (r
);
10041 finish_member_declaration (r
);
10049 if (TYPE_P (t
) || DECL_CLASS_TEMPLATE_P (t
)
10050 || DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
10052 /* Build new CLASSTYPE_FRIEND_CLASSES. */
10054 tree friend_type
= t
;
10055 bool adjust_processing_template_decl
= false;
10057 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
10059 /* template <class T> friend class C; */
10060 friend_type
= tsubst_friend_class (friend_type
, args
);
10061 adjust_processing_template_decl
= true;
10063 else if (TREE_CODE (friend_type
) == UNBOUND_CLASS_TEMPLATE
)
10065 /* template <class T> friend class C::D; */
10066 friend_type
= tsubst (friend_type
, args
,
10067 tf_warning_or_error
, NULL_TREE
);
10068 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
10069 friend_type
= TREE_TYPE (friend_type
);
10070 adjust_processing_template_decl
= true;
10072 else if (TREE_CODE (friend_type
) == TYPENAME_TYPE
10073 || TREE_CODE (friend_type
) == TEMPLATE_TYPE_PARM
)
10075 /* This could be either
10079 when dependent_type_p is false or
10081 template <class U> friend class T::C;
10084 friend_type
= tsubst (friend_type
, args
,
10085 tf_warning_or_error
, NULL_TREE
);
10086 /* Bump processing_template_decl for correct
10087 dependent_type_p calculation. */
10088 ++processing_template_decl
;
10089 if (dependent_type_p (friend_type
))
10090 adjust_processing_template_decl
= true;
10091 --processing_template_decl
;
10093 else if (!CLASSTYPE_USE_TEMPLATE (friend_type
)
10094 && hidden_name_p (TYPE_NAME (friend_type
)))
10098 where C hasn't been declared yet. Let's lookup name
10099 from namespace scope directly, bypassing any name that
10100 come from dependent base class. */
10101 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (friend_type
));
10103 /* The call to xref_tag_from_type does injection for friend
10105 push_nested_namespace (ns
);
10107 xref_tag_from_type (friend_type
, NULL_TREE
,
10108 /*tag_scope=*/ts_current
);
10109 pop_nested_namespace (ns
);
10111 else if (uses_template_parms (friend_type
))
10112 /* friend class C<T>; */
10113 friend_type
= tsubst (friend_type
, args
,
10114 tf_warning_or_error
, NULL_TREE
);
10119 where C is already declared or
10121 friend class C<int>;
10123 We don't have to do anything in these cases. */
10125 if (adjust_processing_template_decl
)
10126 /* Trick make_friend_class into realizing that the friend
10127 we're adding is a template, not an ordinary class. It's
10128 important that we use make_friend_class since it will
10129 perform some error-checking and output cross-reference
10131 ++processing_template_decl
;
10133 if (friend_type
!= error_mark_node
)
10134 make_friend_class (type
, friend_type
, /*complain=*/false);
10136 if (adjust_processing_template_decl
)
10137 --processing_template_decl
;
10141 /* Build new DECL_FRIENDLIST. */
10144 /* The file and line for this declaration, to
10145 assist in error message reporting. Since we
10146 called push_tinst_level above, we don't need to
10148 input_location
= DECL_SOURCE_LOCATION (t
);
10150 if (TREE_CODE (t
) == TEMPLATE_DECL
)
10152 ++processing_template_decl
;
10153 push_deferring_access_checks (dk_no_check
);
10156 r
= tsubst_friend_function (t
, args
);
10157 add_friend (type
, r
, /*complain=*/false);
10158 if (TREE_CODE (t
) == TEMPLATE_DECL
)
10160 pop_deferring_access_checks ();
10161 --processing_template_decl
;
10169 /* Restore these before substituting into the lambda capture
10171 cp_unevaluated_operand
= saved_unevaluated_operand
;
10172 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
10175 if (tree expr
= CLASSTYPE_LAMBDA_EXPR (type
))
10177 tree decl
= lambda_function (type
);
10180 if (!DECL_TEMPLATE_INFO (decl
)
10181 || DECL_TEMPLATE_RESULT (DECL_TI_TEMPLATE (decl
)) != decl
)
10183 /* Set function_depth to avoid garbage collection. */
10185 instantiate_decl (decl
, false, false);
10189 /* We need to instantiate the capture list from the template
10190 after we've instantiated the closure members, but before we
10191 consider adding the conversion op. Also keep any captures
10192 that may have been added during instantiation of the op(). */
10193 tree tmpl_expr
= CLASSTYPE_LAMBDA_EXPR (pattern
);
10195 = tsubst_copy_and_build (LAMBDA_EXPR_CAPTURE_LIST (tmpl_expr
),
10196 args
, tf_warning_or_error
, NULL_TREE
,
10199 LAMBDA_EXPR_CAPTURE_LIST (expr
)
10200 = chainon (tmpl_cap
, nreverse (LAMBDA_EXPR_CAPTURE_LIST (expr
)));
10202 maybe_add_lambda_conv_op (type
);
10205 gcc_assert (errorcount
);
10208 /* Set the file and line number information to whatever is given for
10209 the class itself. This puts error messages involving generated
10210 implicit functions at a predictable point, and the same point
10211 that would be used for non-template classes. */
10212 input_location
= DECL_SOURCE_LOCATION (typedecl
);
10214 unreverse_member_declarations (type
);
10215 finish_struct_1 (type
);
10216 TYPE_BEING_DEFINED (type
) = 0;
10218 /* We don't instantiate default arguments for member functions. 14.7.1:
10220 The implicit instantiation of a class template specialization causes
10221 the implicit instantiation of the declarations, but not of the
10222 definitions or default arguments, of the class member functions,
10223 member classes, static data members and member templates.... */
10225 /* Some typedefs referenced from within the template code need to be access
10226 checked at template instantiation time, i.e now. These types were
10227 added to the template at parsing time. Let's get those and perform
10228 the access checks then. */
10229 perform_typedefs_access_check (pattern
, args
);
10230 perform_deferred_access_checks (tf_warning_or_error
);
10231 pop_nested_class ();
10232 maximum_field_alignment
= saved_maximum_field_alignment
;
10234 pop_from_top_level ();
10235 pop_deferring_access_checks ();
10236 pop_tinst_level ();
10238 /* The vtable for a template class can be emitted in any translation
10239 unit in which the class is instantiated. When there is no key
10240 method, however, finish_struct_1 will already have added TYPE to
10241 the keyed_classes list. */
10242 if (TYPE_CONTAINS_VPTR_P (type
) && CLASSTYPE_KEY_METHOD (type
))
10243 keyed_classes
= tree_cons (NULL_TREE
, type
, keyed_classes
);
10248 /* Wrapper for instantiate_class_template_1. */
10251 instantiate_class_template (tree type
)
10254 timevar_push (TV_TEMPLATE_INST
);
10255 ret
= instantiate_class_template_1 (type
);
10256 timevar_pop (TV_TEMPLATE_INST
);
10261 tsubst_template_arg (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
10267 else if (TYPE_P (t
))
10268 r
= tsubst (t
, args
, complain
, in_decl
);
10271 if (!(complain
& tf_warning
))
10272 ++c_inhibit_evaluation_warnings
;
10273 r
= tsubst_expr (t
, args
, complain
, in_decl
,
10274 /*integral_constant_expression_p=*/true);
10275 if (!(complain
& tf_warning
))
10276 --c_inhibit_evaluation_warnings
;
10281 /* Given a function parameter pack TMPL_PARM and some function parameters
10282 instantiated from it at *SPEC_P, return a NONTYPE_ARGUMENT_PACK of them
10283 and set *SPEC_P to point at the next point in the list. */
10286 extract_fnparm_pack (tree tmpl_parm
, tree
*spec_p
)
10288 /* Collect all of the extra "packed" parameters into an
10292 tree argpack
= make_node (NONTYPE_ARGUMENT_PACK
);
10293 tree argtypepack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
10294 tree spec_parm
= *spec_p
;
10297 for (len
= 0; spec_parm
; ++len
, spec_parm
= TREE_CHAIN (spec_parm
))
10299 && !function_parameter_expanded_from_pack_p (spec_parm
, tmpl_parm
))
10302 /* Fill in PARMVEC and PARMTYPEVEC with all of the parameters. */
10303 parmvec
= make_tree_vec (len
);
10304 parmtypevec
= make_tree_vec (len
);
10305 spec_parm
= *spec_p
;
10306 for (i
= 0; i
< len
; i
++, spec_parm
= DECL_CHAIN (spec_parm
))
10308 TREE_VEC_ELT (parmvec
, i
) = spec_parm
;
10309 TREE_VEC_ELT (parmtypevec
, i
) = TREE_TYPE (spec_parm
);
10312 /* Build the argument packs. */
10313 SET_ARGUMENT_PACK_ARGS (argpack
, parmvec
);
10314 SET_ARGUMENT_PACK_ARGS (argtypepack
, parmtypevec
);
10315 TREE_TYPE (argpack
) = argtypepack
;
10316 *spec_p
= spec_parm
;
10321 /* Give a chain SPEC_PARM of PARM_DECLs, pack them into a
10322 NONTYPE_ARGUMENT_PACK. */
10325 make_fnparm_pack (tree spec_parm
)
10327 return extract_fnparm_pack (NULL_TREE
, &spec_parm
);
10330 /* Return 1 if the Ith element of the argument pack ARG_PACK is a
10331 pack expansion with no extra args, 2 if it has extra args, or 0
10332 if it is not a pack expansion. */
10335 argument_pack_element_is_expansion_p (tree arg_pack
, int i
)
10337 tree vec
= ARGUMENT_PACK_ARGS (arg_pack
);
10338 if (i
>= TREE_VEC_LENGTH (vec
))
10340 tree elt
= TREE_VEC_ELT (vec
, i
);
10342 /* A decl pack is itself an expansion. */
10343 elt
= TREE_TYPE (elt
);
10344 if (!PACK_EXPANSION_P (elt
))
10346 if (PACK_EXPANSION_EXTRA_ARGS (elt
))
10352 /* Creates and return an ARGUMENT_PACK_SELECT tree node. */
10355 make_argument_pack_select (tree arg_pack
, unsigned index
)
10357 tree aps
= make_node (ARGUMENT_PACK_SELECT
);
10359 ARGUMENT_PACK_SELECT_FROM_PACK (aps
) = arg_pack
;
10360 ARGUMENT_PACK_SELECT_INDEX (aps
) = index
;
10365 /* This is a subroutine of tsubst_pack_expansion.
10367 It returns TRUE if we need to use the PACK_EXPANSION_EXTRA_ARGS
10368 mechanism to store the (non complete list of) arguments of the
10369 substitution and return a non substituted pack expansion, in order
10370 to wait for when we have enough arguments to really perform the
10374 use_pack_expansion_extra_args_p (tree parm_packs
,
10376 bool has_empty_arg
)
10378 /* If one pack has an expansion and another pack has a normal
10379 argument or if one pack has an empty argument and an another
10380 one hasn't then tsubst_pack_expansion cannot perform the
10381 substitution and need to fall back on the
10382 PACK_EXPANSION_EXTRA mechanism. */
10383 if (parm_packs
== NULL_TREE
)
10385 else if (has_empty_arg
)
10388 bool has_expansion_arg
= false;
10389 for (int i
= 0 ; i
< arg_pack_len
; ++i
)
10391 bool has_non_expansion_arg
= false;
10392 for (tree parm_pack
= parm_packs
;
10394 parm_pack
= TREE_CHAIN (parm_pack
))
10396 tree arg
= TREE_VALUE (parm_pack
);
10398 int exp
= argument_pack_element_is_expansion_p (arg
, i
);
10400 /* We can't substitute a pack expansion with extra args into
10404 has_expansion_arg
= true;
10406 has_non_expansion_arg
= true;
10409 if (has_expansion_arg
&& has_non_expansion_arg
)
10415 /* [temp.variadic]/6 says that:
10417 The instantiation of a pack expansion [...]
10418 produces a list E1,E2, ..., En, where N is the number of elements
10419 in the pack expansion parameters.
10421 This subroutine of tsubst_pack_expansion produces one of these Ei.
10423 PATTERN is the pattern of the pack expansion. PARM_PACKS is a
10424 TREE_LIST in which each TREE_PURPOSE is a parameter pack of
10425 PATTERN, and each TREE_VALUE is its corresponding argument pack.
10426 INDEX is the index 'i' of the element Ei to produce. ARGS,
10427 COMPLAIN, and IN_DECL are the same parameters as for the
10428 tsubst_pack_expansion function.
10430 The function returns the resulting Ei upon successful completion,
10431 or error_mark_node.
10433 Note that this function possibly modifies the ARGS parameter, so
10434 it's the responsibility of the caller to restore it. */
10437 gen_elem_of_pack_expansion_instantiation (tree pattern
,
10440 tree args
/* This parm gets
10442 tsubst_flags_t complain
,
10446 bool ith_elem_is_expansion
= false;
10448 /* For each parameter pack, change the substitution of the parameter
10449 pack to the ith argument in its argument pack, then expand the
10451 for (tree pack
= parm_packs
; pack
; pack
= TREE_CHAIN (pack
))
10453 tree parm
= TREE_PURPOSE (pack
);
10454 tree arg_pack
= TREE_VALUE (pack
);
10455 tree aps
; /* instance of ARGUMENT_PACK_SELECT. */
10457 ith_elem_is_expansion
|=
10458 argument_pack_element_is_expansion_p (arg_pack
, index
);
10460 /* Select the Ith argument from the pack. */
10461 if (TREE_CODE (parm
) == PARM_DECL
10462 || TREE_CODE (parm
) == FIELD_DECL
)
10466 aps
= make_argument_pack_select (arg_pack
, index
);
10467 if (!mark_used (parm
, complain
) && !(complain
& tf_error
))
10468 return error_mark_node
;
10469 register_local_specialization (aps
, parm
);
10472 aps
= retrieve_local_specialization (parm
);
10477 template_parm_level_and_index (parm
, &level
, &idx
);
10481 aps
= make_argument_pack_select (arg_pack
, index
);
10482 /* Update the corresponding argument. */
10483 TMPL_ARG (args
, level
, idx
) = aps
;
10486 /* Re-use the ARGUMENT_PACK_SELECT. */
10487 aps
= TMPL_ARG (args
, level
, idx
);
10489 ARGUMENT_PACK_SELECT_INDEX (aps
) = index
;
10492 /* Substitute into the PATTERN with the (possibly altered)
10494 if (pattern
== in_decl
)
10495 /* Expanding a fixed parameter pack from
10496 coerce_template_parameter_pack. */
10497 t
= tsubst_decl (pattern
, args
, complain
);
10498 else if (pattern
== error_mark_node
)
10499 t
= error_mark_node
;
10500 else if (constraint_p (pattern
))
10502 if (processing_template_decl
)
10503 t
= tsubst_constraint (pattern
, args
, complain
, in_decl
);
10505 t
= (constraints_satisfied_p (pattern
, args
)
10506 ? boolean_true_node
: boolean_false_node
);
10508 else if (!TYPE_P (pattern
))
10509 t
= tsubst_expr (pattern
, args
, complain
, in_decl
,
10510 /*integral_constant_expression_p=*/false);
10512 t
= tsubst (pattern
, args
, complain
, in_decl
);
10514 /* If the Ith argument pack element is a pack expansion, then
10515 the Ith element resulting from the substituting is going to
10516 be a pack expansion as well. */
10517 if (ith_elem_is_expansion
)
10518 t
= make_pack_expansion (t
);
10523 /* When the unexpanded parameter pack in a fold expression expands to an empty
10524 sequence, the value of the expression is as follows; the program is
10525 ill-formed if the operator is not listed in this table.
10536 expand_empty_fold (tree t
, tsubst_flags_t complain
)
10538 tree_code code
= (tree_code
)TREE_INT_CST_LOW (TREE_OPERAND (t
, 0));
10539 if (!FOLD_EXPR_MODIFY_P (t
))
10543 return integer_one_node
;
10545 return integer_zero_node
;
10547 return integer_minus_one_node
;
10549 return integer_zero_node
;
10550 case TRUTH_ANDIF_EXPR
:
10551 return boolean_true_node
;
10552 case TRUTH_ORIF_EXPR
:
10553 return boolean_false_node
;
10554 case COMPOUND_EXPR
:
10560 if (complain
& tf_error
)
10561 error_at (location_of (t
),
10562 "fold of empty expansion over %O", code
);
10563 return error_mark_node
;
10566 /* Given a fold-expression T and a current LEFT and RIGHT operand,
10567 form an expression that combines the two terms using the
10571 fold_expression (tree t
, tree left
, tree right
, tsubst_flags_t complain
)
10573 tree op
= FOLD_EXPR_OP (t
);
10574 tree_code code
= (tree_code
)TREE_INT_CST_LOW (op
);
10576 // Handle compound assignment operators.
10577 if (FOLD_EXPR_MODIFY_P (t
))
10578 return build_x_modify_expr (input_location
, left
, code
, right
, complain
);
10582 case COMPOUND_EXPR
:
10583 return build_x_compound_expr (input_location
, left
, right
, complain
);
10585 return build_m_component_ref (left
, right
, complain
);
10587 return build_x_binary_op (input_location
, code
,
10588 left
, TREE_CODE (left
),
10589 right
, TREE_CODE (right
),
10595 /* Substitute ARGS into the pack of a fold expression T. */
10598 tsubst_fold_expr_pack (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
10600 return tsubst_pack_expansion (FOLD_EXPR_PACK (t
), args
, complain
, in_decl
);
10603 /* Substitute ARGS into the pack of a fold expression T. */
10606 tsubst_fold_expr_init (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
10608 return tsubst_expr (FOLD_EXPR_INIT (t
), args
, complain
, in_decl
, false);
10611 /* Expand a PACK of arguments into a grouped as left fold.
10612 Given a pack containing elements A0, A1, ..., An and an
10613 operator @, this builds the expression:
10615 ((A0 @ A1) @ A2) ... @ An
10617 Note that PACK must not be empty.
10619 The operator is defined by the original fold expression T. */
10622 expand_left_fold (tree t
, tree pack
, tsubst_flags_t complain
)
10624 tree left
= TREE_VEC_ELT (pack
, 0);
10625 for (int i
= 1; i
< TREE_VEC_LENGTH (pack
); ++i
)
10627 tree right
= TREE_VEC_ELT (pack
, i
);
10628 left
= fold_expression (t
, left
, right
, complain
);
10633 /* Substitute into a unary left fold expression. */
10636 tsubst_unary_left_fold (tree t
, tree args
, tsubst_flags_t complain
,
10639 tree pack
= tsubst_fold_expr_pack (t
, args
, complain
, in_decl
);
10640 if (pack
== error_mark_node
)
10641 return error_mark_node
;
10642 if (TREE_VEC_LENGTH (pack
) == 0)
10643 return expand_empty_fold (t
, complain
);
10645 return expand_left_fold (t
, pack
, complain
);
10648 /* Substitute into a binary left fold expression.
10650 Do ths by building a single (non-empty) vector of argumnts and
10651 building the expression from those elements. */
10654 tsubst_binary_left_fold (tree t
, tree args
, tsubst_flags_t complain
,
10657 tree pack
= tsubst_fold_expr_pack (t
, args
, complain
, in_decl
);
10658 if (pack
== error_mark_node
)
10659 return error_mark_node
;
10660 tree init
= tsubst_fold_expr_init (t
, args
, complain
, in_decl
);
10661 if (init
== error_mark_node
)
10662 return error_mark_node
;
10664 tree vec
= make_tree_vec (TREE_VEC_LENGTH (pack
) + 1);
10665 TREE_VEC_ELT (vec
, 0) = init
;
10666 for (int i
= 0; i
< TREE_VEC_LENGTH (pack
); ++i
)
10667 TREE_VEC_ELT (vec
, i
+ 1) = TREE_VEC_ELT (pack
, i
);
10669 return expand_left_fold (t
, vec
, complain
);
10672 /* Expand a PACK of arguments into a grouped as right fold.
10673 Given a pack containing elementns A0, A1, ..., and an
10674 operator @, this builds the expression:
10676 A0@ ... (An-2 @ (An-1 @ An))
10678 Note that PACK must not be empty.
10680 The operator is defined by the original fold expression T. */
10683 expand_right_fold (tree t
, tree pack
, tsubst_flags_t complain
)
10685 // Build the expression.
10686 int n
= TREE_VEC_LENGTH (pack
);
10687 tree right
= TREE_VEC_ELT (pack
, n
- 1);
10688 for (--n
; n
!= 0; --n
)
10690 tree left
= TREE_VEC_ELT (pack
, n
- 1);
10691 right
= fold_expression (t
, left
, right
, complain
);
10696 /* Substitute into a unary right fold expression. */
10699 tsubst_unary_right_fold (tree t
, tree args
, tsubst_flags_t complain
,
10702 tree pack
= tsubst_fold_expr_pack (t
, args
, complain
, in_decl
);
10703 if (pack
== error_mark_node
)
10704 return error_mark_node
;
10705 if (TREE_VEC_LENGTH (pack
) == 0)
10706 return expand_empty_fold (t
, complain
);
10708 return expand_right_fold (t
, pack
, complain
);
10711 /* Substitute into a binary right fold expression.
10713 Do ths by building a single (non-empty) vector of arguments and
10714 building the expression from those elements. */
10717 tsubst_binary_right_fold (tree t
, tree args
, tsubst_flags_t complain
,
10720 tree pack
= tsubst_fold_expr_pack (t
, args
, complain
, in_decl
);
10721 if (pack
== error_mark_node
)
10722 return error_mark_node
;
10723 tree init
= tsubst_fold_expr_init (t
, args
, complain
, in_decl
);
10724 if (init
== error_mark_node
)
10725 return error_mark_node
;
10727 int n
= TREE_VEC_LENGTH (pack
);
10728 tree vec
= make_tree_vec (n
+ 1);
10729 for (int i
= 0; i
< n
; ++i
)
10730 TREE_VEC_ELT (vec
, i
) = TREE_VEC_ELT (pack
, i
);
10731 TREE_VEC_ELT (vec
, n
) = init
;
10733 return expand_right_fold (t
, vec
, complain
);
10737 /* Substitute ARGS into T, which is an pack expansion
10738 (i.e. TYPE_PACK_EXPANSION or EXPR_PACK_EXPANSION). Returns a
10739 TREE_VEC with the substituted arguments, a PACK_EXPANSION_* node
10740 (if only a partial substitution could be performed) or
10741 ERROR_MARK_NODE if there was an error. */
10743 tsubst_pack_expansion (tree t
, tree args
, tsubst_flags_t complain
,
10747 tree pack
, packs
= NULL_TREE
;
10748 bool unsubstituted_packs
= false;
10751 hash_map
<tree
, tree
> *saved_local_specializations
= NULL
;
10752 bool need_local_specializations
= false;
10755 gcc_assert (PACK_EXPANSION_P (t
));
10756 pattern
= PACK_EXPANSION_PATTERN (t
);
10758 /* Add in any args remembered from an earlier partial instantiation. */
10759 args
= add_to_template_args (PACK_EXPANSION_EXTRA_ARGS (t
), args
);
10761 levels
= TMPL_ARGS_DEPTH (args
);
10763 /* Determine the argument packs that will instantiate the parameter
10764 packs used in the expansion expression. While we're at it,
10765 compute the number of arguments to be expanded and make sure it
10767 for (pack
= PACK_EXPANSION_PARAMETER_PACKS (t
); pack
;
10768 pack
= TREE_CHAIN (pack
))
10770 tree parm_pack
= TREE_VALUE (pack
);
10771 tree arg_pack
= NULL_TREE
;
10772 tree orig_arg
= NULL_TREE
;
10775 if (TREE_CODE (parm_pack
) == BASES
)
10777 if (BASES_DIRECT (parm_pack
))
10778 return calculate_direct_bases (tsubst_expr (BASES_TYPE (parm_pack
),
10779 args
, complain
, in_decl
, false));
10781 return calculate_bases (tsubst_expr (BASES_TYPE (parm_pack
),
10782 args
, complain
, in_decl
, false));
10784 if (TREE_CODE (parm_pack
) == PARM_DECL
)
10786 /* We know we have correct local_specializations if this
10787 expansion is at function scope, or if we're dealing with a
10788 local parameter in a requires expression; for the latter,
10789 tsubst_requires_expr set it up appropriately. */
10790 if (PACK_EXPANSION_LOCAL_P (t
) || CONSTRAINT_VAR_P (parm_pack
))
10791 arg_pack
= retrieve_local_specialization (parm_pack
);
10794 /* We can't rely on local_specializations for a parameter
10795 name used later in a function declaration (such as in a
10796 late-specified return type). Even if it exists, it might
10797 have the wrong value for a recursive call. Just make a
10798 dummy decl, since it's only used for its type. */
10799 arg_pack
= tsubst_decl (parm_pack
, args
, complain
);
10800 if (arg_pack
&& DECL_PACK_P (arg_pack
))
10801 /* Partial instantiation of the parm_pack, we can't build
10802 up an argument pack yet. */
10803 arg_pack
= NULL_TREE
;
10805 arg_pack
= make_fnparm_pack (arg_pack
);
10806 need_local_specializations
= true;
10809 else if (TREE_CODE (parm_pack
) == FIELD_DECL
)
10810 arg_pack
= tsubst_copy (parm_pack
, args
, complain
, in_decl
);
10814 template_parm_level_and_index (parm_pack
, &level
, &idx
);
10816 if (level
<= levels
)
10817 arg_pack
= TMPL_ARG (args
, level
, idx
);
10820 orig_arg
= arg_pack
;
10821 if (arg_pack
&& TREE_CODE (arg_pack
) == ARGUMENT_PACK_SELECT
)
10822 arg_pack
= ARGUMENT_PACK_SELECT_FROM_PACK (arg_pack
);
10824 if (arg_pack
&& !ARGUMENT_PACK_P (arg_pack
))
10825 /* This can only happen if we forget to expand an argument
10826 pack somewhere else. Just return an error, silently. */
10828 result
= make_tree_vec (1);
10829 TREE_VEC_ELT (result
, 0) = error_mark_node
;
10836 TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg_pack
));
10838 /* Don't bother trying to do a partial substitution with
10839 incomplete packs; we'll try again after deduction. */
10840 if (ARGUMENT_PACK_INCOMPLETE_P (arg_pack
))
10845 else if (len
!= my_len
)
10847 if (!(complain
& tf_error
))
10848 /* Fail quietly. */;
10849 else if (TREE_CODE (t
) == TYPE_PACK_EXPANSION
)
10850 error ("mismatched argument pack lengths while expanding "
10854 error ("mismatched argument pack lengths while expanding "
10857 return error_mark_node
;
10860 /* Keep track of the parameter packs and their corresponding
10862 packs
= tree_cons (parm_pack
, arg_pack
, packs
);
10863 TREE_TYPE (packs
) = orig_arg
;
10867 /* We can't substitute for this parameter pack. We use a flag as
10868 well as the missing_level counter because function parameter
10869 packs don't have a level. */
10870 unsubstituted_packs
= true;
10874 /* If the expansion is just T..., return the matching argument pack, unless
10875 we need to call convert_from_reference on all the elements. This is an
10876 important optimization; see c++/68422. */
10877 if (!unsubstituted_packs
10878 && TREE_PURPOSE (packs
) == pattern
)
10880 tree args
= ARGUMENT_PACK_ARGS (TREE_VALUE (packs
));
10881 /* Types need no adjustment, nor does sizeof..., and if we still have
10882 some pack expansion args we won't do anything yet. */
10883 if (TREE_CODE (t
) == TYPE_PACK_EXPANSION
10884 || PACK_EXPANSION_SIZEOF_P (t
)
10885 || pack_expansion_args_count (args
))
10887 /* Also optimize expression pack expansions if we can tell that the
10888 elements won't have reference type. */
10889 tree type
= TREE_TYPE (pattern
);
10890 if (type
&& TREE_CODE (type
) != REFERENCE_TYPE
10891 && !PACK_EXPANSION_P (type
)
10892 && !WILDCARD_TYPE_P (type
))
10894 /* Otherwise use the normal path so we get convert_from_reference. */
10897 /* We cannot expand this expansion expression, because we don't have
10898 all of the argument packs we need. */
10899 if (use_pack_expansion_extra_args_p (packs
, len
, unsubstituted_packs
))
10901 /* We got some full packs, but we can't substitute them in until we
10902 have values for all the packs. So remember these until then. */
10904 t
= make_pack_expansion (pattern
);
10905 PACK_EXPANSION_EXTRA_ARGS (t
) = args
;
10908 else if (unsubstituted_packs
)
10910 /* There were no real arguments, we're just replacing a parameter
10911 pack with another version of itself. Substitute into the
10912 pattern and return a PACK_EXPANSION_*. The caller will need to
10914 if (TREE_CODE (t
) == EXPR_PACK_EXPANSION
)
10915 t
= tsubst_expr (pattern
, args
, complain
, in_decl
,
10916 /*integral_constant_expression_p=*/false);
10918 t
= tsubst (pattern
, args
, complain
, in_decl
);
10919 t
= make_pack_expansion (t
);
10923 gcc_assert (len
>= 0);
10925 if (need_local_specializations
)
10927 /* We're in a late-specified return type, so create our own local
10928 specializations map; the current map is either NULL or (in the
10929 case of recursive unification) might have bindings that we don't
10930 want to use or alter. */
10931 saved_local_specializations
= local_specializations
;
10932 local_specializations
= new hash_map
<tree
, tree
>;
10935 /* For each argument in each argument pack, substitute into the
10937 result
= make_tree_vec (len
);
10938 for (i
= 0; i
< len
; ++i
)
10940 t
= gen_elem_of_pack_expansion_instantiation (pattern
, packs
,
10944 TREE_VEC_ELT (result
, i
) = t
;
10945 if (t
== error_mark_node
)
10947 result
= error_mark_node
;
10952 /* Update ARGS to restore the substitution from parameter packs to
10953 their argument packs. */
10954 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
10956 tree parm
= TREE_PURPOSE (pack
);
10958 if (TREE_CODE (parm
) == PARM_DECL
10959 || TREE_CODE (parm
) == FIELD_DECL
)
10960 register_local_specialization (TREE_TYPE (pack
), parm
);
10965 if (TREE_VALUE (pack
) == NULL_TREE
)
10968 template_parm_level_and_index (parm
, &level
, &idx
);
10970 /* Update the corresponding argument. */
10971 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
10972 TREE_VEC_ELT (TREE_VEC_ELT (args
, level
-1 ), idx
) =
10975 TREE_VEC_ELT (args
, idx
) = TREE_TYPE (pack
);
10979 if (need_local_specializations
)
10981 delete local_specializations
;
10982 local_specializations
= saved_local_specializations
;
10988 /* Given PARM_DECL PARM, find the corresponding PARM_DECL in the template
10989 TMPL. We do this using DECL_PARM_INDEX, which should work even with
10990 parameter packs; all parms generated from a function parameter pack will
10991 have the same DECL_PARM_INDEX. */
10994 get_pattern_parm (tree parm
, tree tmpl
)
10996 tree pattern
= DECL_TEMPLATE_RESULT (tmpl
);
10999 if (DECL_ARTIFICIAL (parm
))
11001 for (patparm
= DECL_ARGUMENTS (pattern
);
11002 patparm
; patparm
= DECL_CHAIN (patparm
))
11003 if (DECL_ARTIFICIAL (patparm
)
11004 && DECL_NAME (parm
) == DECL_NAME (patparm
))
11009 patparm
= FUNCTION_FIRST_USER_PARM (DECL_TEMPLATE_RESULT (tmpl
));
11010 patparm
= chain_index (DECL_PARM_INDEX (parm
)-1, patparm
);
11011 gcc_assert (DECL_PARM_INDEX (patparm
)
11012 == DECL_PARM_INDEX (parm
));
11018 /* Substitute ARGS into the vector or list of template arguments T. */
11021 tsubst_template_args (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
11024 int len
, need_new
= 0, i
, expanded_len_adjust
= 0, out
;
11027 if (t
== error_mark_node
)
11028 return error_mark_node
;
11030 len
= TREE_VEC_LENGTH (t
);
11031 elts
= XALLOCAVEC (tree
, len
);
11033 for (i
= 0; i
< len
; i
++)
11035 tree orig_arg
= TREE_VEC_ELT (t
, i
);
11038 if (TREE_CODE (orig_arg
) == TREE_VEC
)
11039 new_arg
= tsubst_template_args (orig_arg
, args
, complain
, in_decl
);
11040 else if (PACK_EXPANSION_P (orig_arg
))
11042 /* Substitute into an expansion expression. */
11043 new_arg
= tsubst_pack_expansion (orig_arg
, args
, complain
, in_decl
);
11045 if (TREE_CODE (new_arg
) == TREE_VEC
)
11046 /* Add to the expanded length adjustment the number of
11047 expanded arguments. We subtract one from this
11048 measurement, because the argument pack expression
11049 itself is already counted as 1 in
11050 LEN. EXPANDED_LEN_ADJUST can actually be negative, if
11051 the argument pack is empty. */
11052 expanded_len_adjust
+= TREE_VEC_LENGTH (new_arg
) - 1;
11054 else if (ARGUMENT_PACK_P (orig_arg
))
11056 /* Substitute into each of the arguments. */
11057 new_arg
= TYPE_P (orig_arg
)
11058 ? cxx_make_type (TREE_CODE (orig_arg
))
11059 : make_node (TREE_CODE (orig_arg
));
11061 SET_ARGUMENT_PACK_ARGS (
11063 tsubst_template_args (ARGUMENT_PACK_ARGS (orig_arg
),
11064 args
, complain
, in_decl
));
11066 if (ARGUMENT_PACK_ARGS (new_arg
) == error_mark_node
)
11067 new_arg
= error_mark_node
;
11069 if (TREE_CODE (new_arg
) == NONTYPE_ARGUMENT_PACK
) {
11070 TREE_TYPE (new_arg
) = tsubst (TREE_TYPE (orig_arg
), args
,
11071 complain
, in_decl
);
11072 TREE_CONSTANT (new_arg
) = TREE_CONSTANT (orig_arg
);
11074 if (TREE_TYPE (new_arg
) == error_mark_node
)
11075 new_arg
= error_mark_node
;
11079 new_arg
= tsubst_template_arg (orig_arg
, args
, complain
, in_decl
);
11081 if (new_arg
== error_mark_node
)
11082 return error_mark_node
;
11085 if (new_arg
!= orig_arg
)
11092 /* Make space for the expanded arguments coming from template
11094 t
= make_tree_vec (len
+ expanded_len_adjust
);
11095 /* ORIG_T can contain TREE_VECs. That happens if ORIG_T contains the
11096 arguments for a member template.
11097 In that case each TREE_VEC in ORIG_T represents a level of template
11098 arguments, and ORIG_T won't carry any non defaulted argument count.
11099 It will rather be the nested TREE_VECs that will carry one.
11100 In other words, ORIG_T carries a non defaulted argument count only
11101 if it doesn't contain any nested TREE_VEC. */
11102 if (NON_DEFAULT_TEMPLATE_ARGS_COUNT (orig_t
))
11104 int count
= GET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (orig_t
);
11105 count
+= expanded_len_adjust
;
11106 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (t
, count
);
11108 for (i
= 0, out
= 0; i
< len
; i
++)
11110 if ((PACK_EXPANSION_P (TREE_VEC_ELT (orig_t
, i
))
11111 || ARGUMENT_PACK_P (TREE_VEC_ELT (orig_t
, i
)))
11112 && TREE_CODE (elts
[i
]) == TREE_VEC
)
11116 /* Now expand the template argument pack "in place". */
11117 for (idx
= 0; idx
< TREE_VEC_LENGTH (elts
[i
]); idx
++, out
++)
11118 TREE_VEC_ELT (t
, out
) = TREE_VEC_ELT (elts
[i
], idx
);
11122 TREE_VEC_ELT (t
, out
) = elts
[i
];
11130 /* Return the result of substituting ARGS into the template parameters
11131 given by PARMS. If there are m levels of ARGS and m + n levels of
11132 PARMS, then the result will contain n levels of PARMS. For
11133 example, if PARMS is `template <class T> template <class U>
11134 template <T*, U, class V>' and ARGS is {{int}, {double}} then the
11135 result will be `template <int*, double, class V>'. */
11138 tsubst_template_parms (tree parms
, tree args
, tsubst_flags_t complain
)
11140 tree r
= NULL_TREE
;
11143 /* When substituting into a template, we must set
11144 PROCESSING_TEMPLATE_DECL as the template parameters may be
11145 dependent if they are based on one-another, and the dependency
11146 predicates are short-circuit outside of templates. */
11147 ++processing_template_decl
;
11149 for (new_parms
= &r
;
11150 parms
&& TMPL_PARMS_DEPTH (parms
) > TMPL_ARGS_DEPTH (args
);
11151 new_parms
= &(TREE_CHAIN (*new_parms
)),
11152 parms
= TREE_CHAIN (parms
))
11155 make_tree_vec (TREE_VEC_LENGTH (TREE_VALUE (parms
)));
11158 for (i
= 0; i
< TREE_VEC_LENGTH (new_vec
); ++i
)
11162 if (parms
== error_mark_node
)
11165 tuple
= TREE_VEC_ELT (TREE_VALUE (parms
), i
);
11167 if (tuple
== error_mark_node
)
11170 TREE_VEC_ELT (new_vec
, i
) =
11171 tsubst_template_parm (tuple
, args
, complain
);
11175 tree_cons (size_int (TMPL_PARMS_DEPTH (parms
)
11176 - TMPL_ARGS_DEPTH (args
)),
11177 new_vec
, NULL_TREE
);
11180 --processing_template_decl
;
11185 /* Return the result of substituting ARGS into one template parameter
11186 given by T. T Must be a TREE_LIST which TREE_VALUE is the template
11187 parameter and which TREE_PURPOSE is the default argument of the
11188 template parameter. */
11191 tsubst_template_parm (tree t
, tree args
, tsubst_flags_t complain
)
11193 tree default_value
, parm_decl
;
11195 if (args
== NULL_TREE
11197 || t
== error_mark_node
)
11200 gcc_assert (TREE_CODE (t
) == TREE_LIST
);
11202 default_value
= TREE_PURPOSE (t
);
11203 parm_decl
= TREE_VALUE (t
);
11205 parm_decl
= tsubst (parm_decl
, args
, complain
, NULL_TREE
);
11206 if (TREE_CODE (parm_decl
) == PARM_DECL
11207 && invalid_nontype_parm_type_p (TREE_TYPE (parm_decl
), complain
))
11208 parm_decl
= error_mark_node
;
11209 default_value
= tsubst_template_arg (default_value
, args
,
11210 complain
, NULL_TREE
);
11212 return build_tree_list (default_value
, parm_decl
);
11215 /* Substitute the ARGS into the indicated aggregate (or enumeration)
11216 type T. If T is not an aggregate or enumeration type, it is
11217 handled as if by tsubst. IN_DECL is as for tsubst. If
11218 ENTERING_SCOPE is nonzero, T is the context for a template which
11219 we are presently tsubst'ing. Return the substituted value. */
11222 tsubst_aggr_type (tree t
,
11224 tsubst_flags_t complain
,
11226 int entering_scope
)
11228 if (t
== NULL_TREE
)
11231 switch (TREE_CODE (t
))
11234 if (TYPE_PTRMEMFUNC_P (t
))
11235 return tsubst (TYPE_PTRMEMFUNC_FN_TYPE (t
), args
, complain
, in_decl
);
11237 /* Else fall through. */
11238 case ENUMERAL_TYPE
:
11240 if (TYPE_TEMPLATE_INFO (t
) && uses_template_parms (t
))
11245 int saved_unevaluated_operand
;
11246 int saved_inhibit_evaluation_warnings
;
11248 /* In "sizeof(X<I>)" we need to evaluate "I". */
11249 saved_unevaluated_operand
= cp_unevaluated_operand
;
11250 cp_unevaluated_operand
= 0;
11251 saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
11252 c_inhibit_evaluation_warnings
= 0;
11254 /* First, determine the context for the type we are looking
11256 context
= TYPE_CONTEXT (t
);
11257 if (context
&& TYPE_P (context
))
11259 context
= tsubst_aggr_type (context
, args
, complain
,
11260 in_decl
, /*entering_scope=*/1);
11261 /* If context is a nested class inside a class template,
11262 it may still need to be instantiated (c++/33959). */
11263 context
= complete_type (context
);
11266 /* Then, figure out what arguments are appropriate for the
11267 type we are trying to find. For example, given:
11269 template <class T> struct S;
11270 template <class T, class U> void f(T, U) { S<U> su; }
11272 and supposing that we are instantiating f<int, double>,
11273 then our ARGS will be {int, double}, but, when looking up
11274 S we only want {double}. */
11275 argvec
= tsubst_template_args (TYPE_TI_ARGS (t
), args
,
11276 complain
, in_decl
);
11277 if (argvec
== error_mark_node
)
11278 r
= error_mark_node
;
11281 r
= lookup_template_class (t
, argvec
, in_decl
, context
,
11282 entering_scope
, complain
);
11283 r
= cp_build_qualified_type_real (r
, cp_type_quals (t
), complain
);
11286 cp_unevaluated_operand
= saved_unevaluated_operand
;
11287 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
11292 /* This is not a template type, so there's nothing to do. */
11296 return tsubst (t
, args
, complain
, in_decl
);
11300 /* Substitute into the default argument ARG (a default argument for
11301 FN), which has the indicated TYPE. */
11304 tsubst_default_argument (tree fn
, tree type
, tree arg
, tsubst_flags_t complain
)
11306 tree saved_class_ptr
= NULL_TREE
;
11307 tree saved_class_ref
= NULL_TREE
;
11308 int errs
= errorcount
+ sorrycount
;
11310 /* This can happen in invalid code. */
11311 if (TREE_CODE (arg
) == DEFAULT_ARG
)
11314 /* This default argument came from a template. Instantiate the
11315 default argument here, not in tsubst. In the case of
11324 we must be careful to do name lookup in the scope of S<T>,
11325 rather than in the current class. */
11326 push_access_scope (fn
);
11327 /* The "this" pointer is not valid in a default argument. */
11330 saved_class_ptr
= current_class_ptr
;
11331 cp_function_chain
->x_current_class_ptr
= NULL_TREE
;
11332 saved_class_ref
= current_class_ref
;
11333 cp_function_chain
->x_current_class_ref
= NULL_TREE
;
11336 push_deferring_access_checks(dk_no_deferred
);
11337 /* The default argument expression may cause implicitly defined
11338 member functions to be synthesized, which will result in garbage
11339 collection. We must treat this situation as if we were within
11340 the body of function so as to avoid collecting live data on the
11343 arg
= tsubst_expr (arg
, DECL_TI_ARGS (fn
),
11344 complain
, NULL_TREE
,
11345 /*integral_constant_expression_p=*/false);
11347 pop_deferring_access_checks();
11349 /* Restore the "this" pointer. */
11352 cp_function_chain
->x_current_class_ptr
= saved_class_ptr
;
11353 cp_function_chain
->x_current_class_ref
= saved_class_ref
;
11356 if (errorcount
+sorrycount
> errs
11357 && (complain
& tf_warning_or_error
))
11358 inform (input_location
,
11359 " when instantiating default argument for call to %D", fn
);
11361 /* Make sure the default argument is reasonable. */
11362 arg
= check_default_argument (type
, arg
, complain
);
11364 pop_access_scope (fn
);
11369 /* Substitute into all the default arguments for FN. */
11372 tsubst_default_arguments (tree fn
, tsubst_flags_t complain
)
11377 tmpl_args
= DECL_TI_ARGS (fn
);
11379 /* If this function is not yet instantiated, we certainly don't need
11380 its default arguments. */
11381 if (uses_template_parms (tmpl_args
))
11383 /* Don't do this again for clones. */
11384 if (DECL_CLONED_FUNCTION_P (fn
))
11387 for (arg
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
11389 arg
= TREE_CHAIN (arg
))
11390 if (TREE_PURPOSE (arg
))
11391 TREE_PURPOSE (arg
) = tsubst_default_argument (fn
,
11393 TREE_PURPOSE (arg
),
11397 /* Substitute the ARGS into the T, which is a _DECL. Return the
11398 result of the substitution. Issue error and warning messages under
11399 control of COMPLAIN. */
11402 tsubst_decl (tree t
, tree args
, tsubst_flags_t complain
)
11404 #define RETURN(EXP) do { r = (EXP); goto out; } while(0)
11405 location_t saved_loc
;
11406 tree r
= NULL_TREE
;
11408 hashval_t hash
= 0;
11410 /* Set the filename and linenumber to improve error-reporting. */
11411 saved_loc
= input_location
;
11412 input_location
= DECL_SOURCE_LOCATION (t
);
11414 switch (TREE_CODE (t
))
11416 case TEMPLATE_DECL
:
11418 /* We can get here when processing a member function template,
11419 member class template, or template template parameter. */
11420 tree decl
= DECL_TEMPLATE_RESULT (t
);
11425 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
11427 /* Template template parameter is treated here. */
11428 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11429 if (new_type
== error_mark_node
)
11430 r
= error_mark_node
;
11431 /* If we get a real template back, return it. This can happen in
11432 the context of most_specialized_partial_spec. */
11433 else if (TREE_CODE (new_type
) == TEMPLATE_DECL
)
11436 /* The new TEMPLATE_DECL was built in
11437 reduce_template_parm_level. */
11438 r
= TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (new_type
);
11442 /* We might already have an instance of this template.
11443 The ARGS are for the surrounding class type, so the
11444 full args contain the tsubst'd args for the context,
11445 plus the innermost args from the template decl. */
11446 tmpl_args
= DECL_CLASS_TEMPLATE_P (t
)
11447 ? CLASSTYPE_TI_ARGS (TREE_TYPE (t
))
11448 : DECL_TI_ARGS (DECL_TEMPLATE_RESULT (t
));
11449 /* Because this is a template, the arguments will still be
11450 dependent, even after substitution. If
11451 PROCESSING_TEMPLATE_DECL is not set, the dependency
11452 predicates will short-circuit. */
11453 ++processing_template_decl
;
11454 full_args
= tsubst_template_args (tmpl_args
, args
,
11455 complain
, in_decl
);
11456 --processing_template_decl
;
11457 if (full_args
== error_mark_node
)
11458 RETURN (error_mark_node
);
11460 /* If this is a default template template argument,
11461 tsubst might not have changed anything. */
11462 if (full_args
== tmpl_args
)
11465 hash
= hash_tmpl_and_args (t
, full_args
);
11466 spec
= retrieve_specialization (t
, full_args
, hash
);
11467 if (spec
!= NULL_TREE
)
11473 /* Make a new template decl. It will be similar to the
11474 original, but will record the current template arguments.
11475 We also create a new function declaration, which is just
11476 like the old one, but points to this new template, rather
11477 than the old one. */
11479 gcc_assert (DECL_LANG_SPECIFIC (r
) != 0);
11480 DECL_CHAIN (r
) = NULL_TREE
;
11482 // Build new template info linking to the original template decl.
11483 DECL_TEMPLATE_INFO (r
) = build_template_info (t
, args
);
11485 if (TREE_CODE (decl
) == TYPE_DECL
11486 && !TYPE_DECL_ALIAS_P (decl
))
11489 ++processing_template_decl
;
11490 new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11491 --processing_template_decl
;
11492 if (new_type
== error_mark_node
)
11493 RETURN (error_mark_node
);
11495 TREE_TYPE (r
) = new_type
;
11496 /* For a partial specialization, we need to keep pointing to
11497 the primary template. */
11498 if (!DECL_TEMPLATE_SPECIALIZATION (t
))
11499 CLASSTYPE_TI_TEMPLATE (new_type
) = r
;
11500 DECL_TEMPLATE_RESULT (r
) = TYPE_MAIN_DECL (new_type
);
11501 DECL_TI_ARGS (r
) = CLASSTYPE_TI_ARGS (new_type
);
11502 DECL_CONTEXT (r
) = TYPE_CONTEXT (new_type
);
11507 ++processing_template_decl
;
11508 new_decl
= tsubst (decl
, args
, complain
, in_decl
);
11509 --processing_template_decl
;
11510 if (new_decl
== error_mark_node
)
11511 RETURN (error_mark_node
);
11513 DECL_TEMPLATE_RESULT (r
) = new_decl
;
11514 DECL_TI_TEMPLATE (new_decl
) = r
;
11515 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
11516 DECL_TI_ARGS (r
) = DECL_TI_ARGS (new_decl
);
11517 DECL_CONTEXT (r
) = DECL_CONTEXT (new_decl
);
11520 SET_DECL_IMPLICIT_INSTANTIATION (r
);
11521 DECL_TEMPLATE_INSTANTIATIONS (r
) = NULL_TREE
;
11522 DECL_TEMPLATE_SPECIALIZATIONS (r
) = NULL_TREE
;
11524 /* The template parameters for this new template are all the
11525 template parameters for the old template, except the
11526 outermost level of parameters. */
11527 DECL_TEMPLATE_PARMS (r
)
11528 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
,
11531 if (PRIMARY_TEMPLATE_P (t
))
11532 DECL_PRIMARY_TEMPLATE (r
) = r
;
11534 if (TREE_CODE (decl
) != TYPE_DECL
&& !VAR_P (decl
))
11535 /* Record this non-type partial instantiation. */
11536 register_specialization (r
, t
,
11537 DECL_TI_ARGS (DECL_TEMPLATE_RESULT (r
)),
11542 case FUNCTION_DECL
:
11545 tree argvec
= NULL_TREE
;
11553 /* Nobody should be tsubst'ing into non-template functions. */
11554 gcc_assert (DECL_TEMPLATE_INFO (t
) != NULL_TREE
);
11556 if (TREE_CODE (DECL_TI_TEMPLATE (t
)) == TEMPLATE_DECL
)
11561 /* If T is not dependent, just return it. We have to
11562 increment PROCESSING_TEMPLATE_DECL because
11563 value_dependent_expression_p assumes that nothing is
11564 dependent when PROCESSING_TEMPLATE_DECL is zero. */
11565 ++processing_template_decl
;
11566 dependent_p
= value_dependent_expression_p (t
);
11567 --processing_template_decl
;
11571 /* Calculate the most general template of which R is a
11572 specialization, and the complete set of arguments used to
11574 gen_tmpl
= most_general_template (DECL_TI_TEMPLATE (t
));
11575 argvec
= tsubst_template_args (DECL_TI_ARGS
11576 (DECL_TEMPLATE_RESULT
11577 (DECL_TI_TEMPLATE (t
))),
11578 args
, complain
, in_decl
);
11579 if (argvec
== error_mark_node
)
11580 RETURN (error_mark_node
);
11582 /* Check to see if we already have this specialization. */
11583 hash
= hash_tmpl_and_args (gen_tmpl
, argvec
);
11584 spec
= retrieve_specialization (gen_tmpl
, argvec
, hash
);
11592 /* We can see more levels of arguments than parameters if
11593 there was a specialization of a member template, like
11596 template <class T> struct S { template <class U> void f(); }
11597 template <> template <class U> void S<int>::f(U);
11599 Here, we'll be substituting into the specialization,
11600 because that's where we can find the code we actually
11601 want to generate, but we'll have enough arguments for
11602 the most general template.
11604 We also deal with the peculiar case:
11606 template <class T> struct S {
11607 template <class U> friend void f();
11609 template <class U> void f() {}
11611 template void f<double>();
11613 Here, the ARGS for the instantiation of will be {int,
11614 double}. But, we only need as many ARGS as there are
11615 levels of template parameters in CODE_PATTERN. We are
11616 careful not to get fooled into reducing the ARGS in
11619 template <class T> struct S { template <class U> void f(U); }
11620 template <class T> template <> void S<T>::f(int) {}
11622 which we can spot because the pattern will be a
11623 specialization in this case. */
11624 args_depth
= TMPL_ARGS_DEPTH (args
);
11626 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (t
)));
11627 if (args_depth
> parms_depth
11628 && !DECL_TEMPLATE_SPECIALIZATION (t
))
11629 args
= get_innermost_template_args (args
, parms_depth
);
11633 /* This special case arises when we have something like this:
11635 template <class T> struct S {
11636 friend void f<int>(int, double);
11639 Here, the DECL_TI_TEMPLATE for the friend declaration
11640 will be an IDENTIFIER_NODE. We are being called from
11641 tsubst_friend_function, and we want only to create a
11642 new decl (R) with appropriate types so that we can call
11643 determine_specialization. */
11644 gen_tmpl
= NULL_TREE
;
11647 if (DECL_CLASS_SCOPE_P (t
))
11649 if (DECL_NAME (t
) == constructor_name (DECL_CONTEXT (t
)))
11653 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
,
11654 complain
, t
, /*entering_scope=*/1);
11659 ctx
= DECL_CONTEXT (t
);
11661 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11662 if (type
== error_mark_node
)
11663 RETURN (error_mark_node
);
11665 /* If we hit excessive deduction depth, the type is bogus even if
11666 it isn't error_mark_node, so don't build a decl. */
11667 if (excessive_deduction_depth
)
11668 RETURN (error_mark_node
);
11670 /* We do NOT check for matching decls pushed separately at this
11671 point, as they may not represent instantiations of this
11672 template, and in any case are considered separate under the
11675 DECL_USE_TEMPLATE (r
) = 0;
11676 TREE_TYPE (r
) = type
;
11677 /* Clear out the mangled name and RTL for the instantiation. */
11678 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
11679 SET_DECL_RTL (r
, NULL
);
11680 /* Leave DECL_INITIAL set on deleted instantiations. */
11681 if (!DECL_DELETED_FN (r
))
11682 DECL_INITIAL (r
) = NULL_TREE
;
11683 DECL_CONTEXT (r
) = ctx
;
11685 /* OpenMP UDRs have the only argument a reference to the declared
11686 type. We want to diagnose if the declared type is a reference,
11687 which is invalid, but as references to references are usually
11688 quietly merged, diagnose it here. */
11689 if (DECL_OMP_DECLARE_REDUCTION_P (t
))
11692 = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (t
))));
11693 argtype
= tsubst (argtype
, args
, complain
, in_decl
);
11694 if (TREE_CODE (argtype
) == REFERENCE_TYPE
)
11695 error_at (DECL_SOURCE_LOCATION (t
),
11696 "reference type %qT in "
11697 "%<#pragma omp declare reduction%>", argtype
);
11698 if (strchr (IDENTIFIER_POINTER (DECL_NAME (t
)), '~') == NULL
)
11699 DECL_NAME (r
) = omp_reduction_id (ERROR_MARK
, DECL_NAME (t
),
11703 if (member
&& DECL_CONV_FN_P (r
))
11704 /* Type-conversion operator. Reconstruct the name, in
11705 case it's the name of one of the template's parameters. */
11706 DECL_NAME (r
) = mangle_conv_op_name_for_type (TREE_TYPE (type
));
11708 DECL_ARGUMENTS (r
) = tsubst (DECL_ARGUMENTS (t
), args
,
11710 DECL_RESULT (r
) = NULL_TREE
;
11712 TREE_STATIC (r
) = 0;
11713 TREE_PUBLIC (r
) = TREE_PUBLIC (t
);
11714 DECL_EXTERNAL (r
) = 1;
11715 /* If this is an instantiation of a function with internal
11716 linkage, we already know what object file linkage will be
11717 assigned to the instantiation. */
11718 DECL_INTERFACE_KNOWN (r
) = !TREE_PUBLIC (r
);
11719 DECL_DEFER_OUTPUT (r
) = 0;
11720 DECL_CHAIN (r
) = NULL_TREE
;
11721 DECL_PENDING_INLINE_INFO (r
) = 0;
11722 DECL_PENDING_INLINE_P (r
) = 0;
11723 DECL_SAVED_TREE (r
) = NULL_TREE
;
11724 DECL_STRUCT_FUNCTION (r
) = NULL
;
11726 /* We'll re-clone as appropriate in instantiate_template. */
11727 DECL_CLONED_FUNCTION (r
) = NULL_TREE
;
11729 /* If we aren't complaining now, return on error before we register
11730 the specialization so that we'll complain eventually. */
11731 if ((complain
& tf_error
) == 0
11732 && IDENTIFIER_OPNAME_P (DECL_NAME (r
))
11733 && !grok_op_properties (r
, /*complain=*/false))
11734 RETURN (error_mark_node
);
11736 /* When instantiating a constrained member, substitute
11737 into the constraints to create a new constraint. */
11738 if (tree ci
= get_constraints (t
))
11741 ci
= tsubst_constraint_info (ci
, argvec
, complain
, NULL_TREE
);
11742 set_constraints (r
, ci
);
11745 /* Set up the DECL_TEMPLATE_INFO for R. There's no need to do
11746 this in the special friend case mentioned above where
11747 GEN_TMPL is NULL. */
11750 DECL_TEMPLATE_INFO (r
)
11751 = build_template_info (gen_tmpl
, argvec
);
11752 SET_DECL_IMPLICIT_INSTANTIATION (r
);
11755 = register_specialization (r
, gen_tmpl
, argvec
, false, hash
);
11757 /* We instantiated this while substituting into
11758 the type earlier (template/friend54.C). */
11761 /* We're not supposed to instantiate default arguments
11762 until they are called, for a template. But, for a
11765 template <class T> void f ()
11766 { extern void g(int i = T()); }
11768 we should do the substitution when the template is
11769 instantiated. We handle the member function case in
11770 instantiate_class_template since the default arguments
11771 might refer to other members of the class. */
11773 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
11774 && !uses_template_parms (argvec
))
11775 tsubst_default_arguments (r
, complain
);
11778 DECL_TEMPLATE_INFO (r
) = NULL_TREE
;
11780 /* Copy the list of befriending classes. */
11781 for (friends
= &DECL_BEFRIENDING_CLASSES (r
);
11783 friends
= &TREE_CHAIN (*friends
))
11785 *friends
= copy_node (*friends
);
11786 TREE_VALUE (*friends
) = tsubst (TREE_VALUE (*friends
),
11791 if (DECL_CONSTRUCTOR_P (r
) || DECL_DESTRUCTOR_P (r
))
11793 maybe_retrofit_in_chrg (r
);
11794 if (DECL_CONSTRUCTOR_P (r
))
11795 grok_ctor_properties (ctx
, r
);
11796 if (DECL_INHERITED_CTOR_BASE (r
))
11797 deduce_inheriting_ctor (r
);
11798 /* If this is an instantiation of a member template, clone it.
11799 If it isn't, that'll be handled by
11800 clone_constructors_and_destructors. */
11801 if (PRIMARY_TEMPLATE_P (gen_tmpl
))
11802 clone_function_decl (r
, /*update_method_vec_p=*/0);
11804 else if ((complain
& tf_error
) != 0
11805 && IDENTIFIER_OPNAME_P (DECL_NAME (r
))
11806 && !grok_op_properties (r
, /*complain=*/true))
11807 RETURN (error_mark_node
);
11809 if (DECL_FRIEND_P (t
) && DECL_FRIEND_CONTEXT (t
))
11810 SET_DECL_FRIEND_CONTEXT (r
,
11811 tsubst (DECL_FRIEND_CONTEXT (t
),
11812 args
, complain
, in_decl
));
11814 /* Possibly limit visibility based on template args. */
11815 DECL_VISIBILITY (r
) = VISIBILITY_DEFAULT
;
11816 if (DECL_VISIBILITY_SPECIFIED (t
))
11818 DECL_VISIBILITY_SPECIFIED (r
) = 0;
11819 DECL_ATTRIBUTES (r
)
11820 = remove_attribute ("visibility", DECL_ATTRIBUTES (r
));
11822 determine_visibility (r
);
11823 if (DECL_DEFAULTED_OUTSIDE_CLASS_P (r
)
11824 && !processing_template_decl
)
11825 defaulted_late_check (r
);
11827 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
11828 args
, complain
, in_decl
);
11834 tree type
= NULL_TREE
;
11836 tree expanded_types
= NULL_TREE
;
11837 tree prev_r
= NULL_TREE
;
11838 tree first_r
= NULL_TREE
;
11840 if (DECL_PACK_P (t
))
11842 /* If there is a local specialization that isn't a
11843 parameter pack, it means that we're doing a "simple"
11844 substitution from inside tsubst_pack_expansion. Just
11845 return the local specialization (which will be a single
11847 tree spec
= retrieve_local_specialization (t
);
11849 && TREE_CODE (spec
) == PARM_DECL
11850 && TREE_CODE (TREE_TYPE (spec
)) != TYPE_PACK_EXPANSION
)
11853 /* Expand the TYPE_PACK_EXPANSION that provides the types for
11854 the parameters in this function parameter pack. */
11855 expanded_types
= tsubst_pack_expansion (TREE_TYPE (t
), args
,
11856 complain
, in_decl
);
11857 if (TREE_CODE (expanded_types
) == TREE_VEC
)
11859 len
= TREE_VEC_LENGTH (expanded_types
);
11861 /* Zero-length parameter packs are boring. Just substitute
11864 RETURN (tsubst (TREE_CHAIN (t
), args
, complain
,
11869 /* All we did was update the type. Make a note of that. */
11870 type
= expanded_types
;
11871 expanded_types
= NULL_TREE
;
11875 /* Loop through all of the parameters we'll build. When T is
11876 a function parameter pack, LEN is the number of expanded
11877 types in EXPANDED_TYPES; otherwise, LEN is 1. */
11879 for (i
= 0; i
< len
; ++i
)
11883 if (DECL_TEMPLATE_PARM_P (t
))
11884 SET_DECL_TEMPLATE_PARM_P (r
);
11886 if (expanded_types
)
11887 /* We're on the Ith parameter of the function parameter
11890 /* Get the Ith type. */
11891 type
= TREE_VEC_ELT (expanded_types
, i
);
11893 /* Rename the parameter to include the index. */
11895 = make_ith_pack_parameter_name (DECL_NAME (r
), i
);
11898 /* We're dealing with a normal parameter. */
11899 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11901 type
= type_decays_to (type
);
11902 TREE_TYPE (r
) = type
;
11903 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
11905 if (DECL_INITIAL (r
))
11907 if (TREE_CODE (DECL_INITIAL (r
)) != TEMPLATE_PARM_INDEX
)
11908 DECL_INITIAL (r
) = TREE_TYPE (r
);
11910 DECL_INITIAL (r
) = tsubst (DECL_INITIAL (r
), args
,
11911 complain
, in_decl
);
11914 DECL_CONTEXT (r
) = NULL_TREE
;
11916 if (!DECL_TEMPLATE_PARM_P (r
))
11917 DECL_ARG_TYPE (r
) = type_passed_as (type
);
11919 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
11920 args
, complain
, in_decl
);
11922 /* Keep track of the first new parameter we
11923 generate. That's what will be returned to the
11928 /* Build a proper chain of parameters when substituting
11929 into a function parameter pack. */
11931 DECL_CHAIN (prev_r
) = r
;
11934 /* If cp_unevaluated_operand is set, we're just looking for a
11935 single dummy parameter, so don't keep going. */
11936 if (DECL_CHAIN (t
) && !cp_unevaluated_operand
)
11937 DECL_CHAIN (r
) = tsubst (DECL_CHAIN (t
), args
,
11938 complain
, DECL_CHAIN (t
));
11940 /* FIRST_R contains the start of the chain we've built. */
11947 tree type
= NULL_TREE
;
11948 tree vec
= NULL_TREE
;
11949 tree expanded_types
= NULL_TREE
;
11952 if (PACK_EXPANSION_P (TREE_TYPE (t
)))
11954 /* This field is a lambda capture pack. Return a TREE_VEC of
11955 the expanded fields to instantiate_class_template_1 and
11956 store them in the specializations hash table as a
11957 NONTYPE_ARGUMENT_PACK so that tsubst_copy can find them. */
11958 expanded_types
= tsubst_pack_expansion (TREE_TYPE (t
), args
,
11959 complain
, in_decl
);
11960 if (TREE_CODE (expanded_types
) == TREE_VEC
)
11962 len
= TREE_VEC_LENGTH (expanded_types
);
11963 vec
= make_tree_vec (len
);
11967 /* All we did was update the type. Make a note of that. */
11968 type
= expanded_types
;
11969 expanded_types
= NULL_TREE
;
11973 for (int i
= 0; i
< len
; ++i
)
11976 if (expanded_types
)
11978 type
= TREE_VEC_ELT (expanded_types
, i
);
11980 = make_ith_pack_parameter_name (DECL_NAME (r
), i
);
11983 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11985 if (type
== error_mark_node
)
11986 RETURN (error_mark_node
);
11987 TREE_TYPE (r
) = type
;
11988 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
11990 if (DECL_C_BIT_FIELD (r
))
11991 /* For bit-fields, DECL_INITIAL gives the number of bits. For
11992 non-bit-fields DECL_INITIAL is a non-static data member
11993 initializer, which gets deferred instantiation. */
11995 = tsubst_expr (DECL_INITIAL (t
), args
,
11997 /*integral_constant_expression_p=*/true);
11998 else if (DECL_INITIAL (t
))
12000 /* Set up DECL_TEMPLATE_INFO so that we can get at the
12001 NSDMI in perform_member_init. Still set DECL_INITIAL
12002 so that we know there is one. */
12003 DECL_INITIAL (r
) = void_node
;
12004 gcc_assert (DECL_LANG_SPECIFIC (r
) == NULL
);
12005 retrofit_lang_decl (r
);
12006 DECL_TEMPLATE_INFO (r
) = build_template_info (t
, args
);
12008 /* We don't have to set DECL_CONTEXT here; it is set by
12009 finish_member_declaration. */
12010 DECL_CHAIN (r
) = NULL_TREE
;
12012 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
12013 args
, complain
, in_decl
);
12016 TREE_VEC_ELT (vec
, i
) = r
;
12022 tree pack
= make_node (NONTYPE_ARGUMENT_PACK
);
12023 tree tpack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
12024 SET_ARGUMENT_PACK_ARGS (pack
, vec
);
12025 SET_ARGUMENT_PACK_ARGS (tpack
, expanded_types
);
12026 TREE_TYPE (pack
) = tpack
;
12027 register_specialization (pack
, t
, args
, false, 0);
12033 /* We reach here only for member using decls. We also need to check
12034 uses_template_parms because DECL_DEPENDENT_P is not set for a
12035 using-declaration that designates a member of the current
12036 instantiation (c++/53549). */
12037 if (DECL_DEPENDENT_P (t
)
12038 || uses_template_parms (USING_DECL_SCOPE (t
)))
12040 tree inst_scope
= tsubst_copy (USING_DECL_SCOPE (t
), args
,
12041 complain
, in_decl
);
12042 tree name
= tsubst_copy (DECL_NAME (t
), args
, complain
, in_decl
);
12043 r
= do_class_using_decl (inst_scope
, name
);
12045 r
= error_mark_node
;
12048 TREE_PROTECTED (r
) = TREE_PROTECTED (t
);
12049 TREE_PRIVATE (r
) = TREE_PRIVATE (t
);
12055 DECL_CHAIN (r
) = NULL_TREE
;
12062 tree argvec
= NULL_TREE
;
12063 tree gen_tmpl
= NULL_TREE
;
12065 tree tmpl
= NULL_TREE
;
12067 tree type
= NULL_TREE
;
12070 if (TREE_TYPE (t
) == error_mark_node
)
12071 RETURN (error_mark_node
);
12073 if (TREE_CODE (t
) == TYPE_DECL
12074 && t
== TYPE_MAIN_DECL (TREE_TYPE (t
)))
12076 /* If this is the canonical decl, we don't have to
12077 mess with instantiations, and often we can't (for
12078 typename, template type parms and such). Note that
12079 TYPE_NAME is not correct for the above test if
12080 we've copied the type for a typedef. */
12081 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12082 if (type
== error_mark_node
)
12083 RETURN (error_mark_node
);
12084 r
= TYPE_NAME (type
);
12088 /* Check to see if we already have the specialization we
12091 if (DECL_CLASS_SCOPE_P (t
) || DECL_NAMESPACE_SCOPE_P (t
))
12093 /* T is a static data member or namespace-scope entity.
12094 We have to substitute into namespace-scope variables
12095 (not just variable templates) because of cases like:
12097 template <class T> void f() { extern T t; }
12099 where the entity referenced is not known until
12100 instantiation time. */
12102 ctx
= DECL_CONTEXT (t
);
12103 if (DECL_CLASS_SCOPE_P (t
))
12105 ctx
= tsubst_aggr_type (ctx
, args
,
12107 in_decl
, /*entering_scope=*/1);
12108 /* If CTX is unchanged, then T is in fact the
12109 specialization we want. That situation occurs when
12110 referencing a static data member within in its own
12111 class. We can use pointer equality, rather than
12112 same_type_p, because DECL_CONTEXT is always
12114 if (ctx
== DECL_CONTEXT (t
)
12115 /* ... unless T is a member template; in which
12116 case our caller can be willing to create a
12117 specialization of that template represented
12119 && !(DECL_TI_TEMPLATE (t
)
12120 && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (t
))))
12126 tmpl
= DECL_TI_TEMPLATE (t
);
12127 gen_tmpl
= most_general_template (tmpl
);
12128 argvec
= tsubst (DECL_TI_ARGS (t
), args
, complain
, in_decl
);
12129 if (argvec
!= error_mark_node
)
12130 argvec
= (coerce_innermost_template_parms
12131 (DECL_TEMPLATE_PARMS (gen_tmpl
),
12132 argvec
, t
, complain
,
12133 /*all*/true, /*defarg*/true));
12134 if (argvec
== error_mark_node
)
12135 RETURN (error_mark_node
);
12136 hash
= hash_tmpl_and_args (gen_tmpl
, argvec
);
12137 spec
= retrieve_specialization (gen_tmpl
, argvec
, hash
);
12142 /* A local variable. */
12144 /* Subsequent calls to pushdecl will fill this in. */
12146 spec
= retrieve_local_specialization (t
);
12148 /* If we already have the specialization we need, there is
12149 nothing more to do. */
12156 /* Create a new node for the specialization we need. */
12158 if (type
== NULL_TREE
)
12160 if (is_typedef_decl (t
))
12161 type
= DECL_ORIGINAL_TYPE (t
);
12163 type
= TREE_TYPE (t
);
12165 && VAR_HAD_UNKNOWN_BOUND (t
)
12166 && type
!= error_mark_node
)
12167 type
= strip_array_domain (type
);
12168 type
= tsubst (type
, args
, complain
, in_decl
);
12172 /* Even if the original location is out of scope, the
12173 newly substituted one is not. */
12174 DECL_DEAD_FOR_LOCAL (r
) = 0;
12175 DECL_INITIALIZED_P (r
) = 0;
12176 DECL_TEMPLATE_INSTANTIATED (r
) = 0;
12177 if (type
== error_mark_node
)
12178 RETURN (error_mark_node
);
12179 if (TREE_CODE (type
) == FUNCTION_TYPE
)
12181 /* It may seem that this case cannot occur, since:
12186 declares a function, not a variable. However:
12189 template <typename T> void g() { T t; }
12190 template void g<f>();
12192 is an attempt to declare a variable with function
12194 error ("variable %qD has function type",
12195 /* R is not yet sufficiently initialized, so we
12196 just use its name. */
12198 RETURN (error_mark_node
);
12200 type
= complete_type (type
);
12201 /* Wait until cp_finish_decl to set this again, to handle
12202 circular dependency (template/instantiate6.C). */
12203 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r
) = 0;
12204 type
= check_var_type (DECL_NAME (r
), type
);
12206 if (DECL_HAS_VALUE_EXPR_P (t
))
12208 tree ve
= DECL_VALUE_EXPR (t
);
12209 ve
= tsubst_expr (ve
, args
, complain
, in_decl
,
12210 /*constant_expression_p=*/false);
12211 if (REFERENCE_REF_P (ve
))
12213 gcc_assert (TREE_CODE (type
) == REFERENCE_TYPE
);
12214 ve
= TREE_OPERAND (ve
, 0);
12216 SET_DECL_VALUE_EXPR (r
, ve
);
12218 if (CP_DECL_THREAD_LOCAL_P (r
)
12219 && !processing_template_decl
)
12220 set_decl_tls_model (r
, decl_default_tls_model (r
));
12222 else if (DECL_SELF_REFERENCE_P (t
))
12223 SET_DECL_SELF_REFERENCE_P (r
);
12224 TREE_TYPE (r
) = type
;
12225 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
12226 DECL_CONTEXT (r
) = ctx
;
12227 /* Clear out the mangled name and RTL for the instantiation. */
12228 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
12229 if (CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_DECL_WRTL
))
12230 SET_DECL_RTL (r
, NULL
);
12231 /* The initializer must not be expanded until it is required;
12232 see [temp.inst]. */
12233 DECL_INITIAL (r
) = NULL_TREE
;
12234 if (CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_DECL_WRTL
))
12235 SET_DECL_RTL (r
, NULL
);
12236 DECL_SIZE (r
) = DECL_SIZE_UNIT (r
) = 0;
12239 /* Possibly limit visibility based on template args. */
12240 DECL_VISIBILITY (r
) = VISIBILITY_DEFAULT
;
12241 if (DECL_VISIBILITY_SPECIFIED (t
))
12243 DECL_VISIBILITY_SPECIFIED (r
) = 0;
12244 DECL_ATTRIBUTES (r
)
12245 = remove_attribute ("visibility", DECL_ATTRIBUTES (r
));
12247 determine_visibility (r
);
12252 /* A static data member declaration is always marked
12253 external when it is declared in-class, even if an
12254 initializer is present. We mimic the non-template
12255 processing here. */
12256 DECL_EXTERNAL (r
) = 1;
12257 if (DECL_NAMESPACE_SCOPE_P (t
))
12258 DECL_NOT_REALLY_EXTERN (r
) = 1;
12260 DECL_TEMPLATE_INFO (r
) = build_template_info (tmpl
, argvec
);
12261 SET_DECL_IMPLICIT_INSTANTIATION (r
);
12262 register_specialization (r
, gen_tmpl
, argvec
, false, hash
);
12264 else if (!cp_unevaluated_operand
)
12265 register_local_specialization (r
, t
);
12267 DECL_CHAIN (r
) = NULL_TREE
;
12269 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
),
12271 args
, complain
, in_decl
);
12273 /* Preserve a typedef that names a type. */
12274 if (is_typedef_decl (r
))
12276 DECL_ORIGINAL_TYPE (r
) = NULL_TREE
;
12277 set_underlying_type (r
);
12278 if (TYPE_DECL_ALIAS_P (r
) && type
!= error_mark_node
)
12279 /* An alias template specialization can be dependent
12280 even if its underlying type is not. */
12281 TYPE_DEPENDENT_P_VALID (TREE_TYPE (r
)) = false;
12284 layout_decl (r
, 0);
12289 gcc_unreachable ();
12294 /* Restore the file and line information. */
12295 input_location
= saved_loc
;
12300 /* Substitute into the ARG_TYPES of a function type.
12301 If END is a TREE_CHAIN, leave it and any following types
12305 tsubst_arg_types (tree arg_types
,
12308 tsubst_flags_t complain
,
12311 tree remaining_arg_types
;
12312 tree type
= NULL_TREE
;
12314 tree expanded_args
= NULL_TREE
;
12317 if (!arg_types
|| arg_types
== void_list_node
|| arg_types
== end
)
12320 remaining_arg_types
= tsubst_arg_types (TREE_CHAIN (arg_types
),
12321 args
, end
, complain
, in_decl
);
12322 if (remaining_arg_types
== error_mark_node
)
12323 return error_mark_node
;
12325 if (PACK_EXPANSION_P (TREE_VALUE (arg_types
)))
12327 /* For a pack expansion, perform substitution on the
12328 entire expression. Later on, we'll handle the arguments
12330 expanded_args
= tsubst_pack_expansion (TREE_VALUE (arg_types
),
12331 args
, complain
, in_decl
);
12333 if (TREE_CODE (expanded_args
) == TREE_VEC
)
12334 /* So that we'll spin through the parameters, one by one. */
12335 i
= TREE_VEC_LENGTH (expanded_args
);
12338 /* We only partially substituted into the parameter
12339 pack. Our type is TYPE_PACK_EXPANSION. */
12340 type
= expanded_args
;
12341 expanded_args
= NULL_TREE
;
12349 type
= TREE_VEC_ELT (expanded_args
, i
);
12351 type
= tsubst (TREE_VALUE (arg_types
), args
, complain
, in_decl
);
12353 if (type
== error_mark_node
)
12354 return error_mark_node
;
12355 if (VOID_TYPE_P (type
))
12357 if (complain
& tf_error
)
12359 error ("invalid parameter type %qT", type
);
12361 error ("in declaration %q+D", in_decl
);
12363 return error_mark_node
;
12366 if (abstract_virtuals_error_sfinae (ACU_PARM
, type
, complain
))
12367 return error_mark_node
;
12369 /* Do array-to-pointer, function-to-pointer conversion, and ignore
12370 top-level qualifiers as required. */
12371 type
= cv_unqualified (type_decays_to (type
));
12373 /* We do not substitute into default arguments here. The standard
12374 mandates that they be instantiated only when needed, which is
12375 done in build_over_call. */
12376 default_arg
= TREE_PURPOSE (arg_types
);
12378 if (default_arg
&& TREE_CODE (default_arg
) == DEFAULT_ARG
)
12380 /* We've instantiated a template before its default arguments
12381 have been parsed. This can happen for a nested template
12382 class, and is not an error unless we require the default
12383 argument in a call of this function. */
12384 remaining_arg_types
=
12385 tree_cons (default_arg
, type
, remaining_arg_types
);
12386 vec_safe_push (DEFARG_INSTANTIATIONS(default_arg
), remaining_arg_types
);
12389 remaining_arg_types
=
12390 hash_tree_cons (default_arg
, type
, remaining_arg_types
);
12393 return remaining_arg_types
;
12396 /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does
12397 *not* handle the exception-specification for FNTYPE, because the
12398 initial substitution of explicitly provided template parameters
12399 during argument deduction forbids substitution into the
12400 exception-specification:
12404 All references in the function type of the function template to the
12405 corresponding template parameters are replaced by the specified tem-
12406 plate argument values. If a substitution in a template parameter or
12407 in the function type of the function template results in an invalid
12408 type, type deduction fails. [Note: The equivalent substitution in
12409 exception specifications is done only when the function is instanti-
12410 ated, at which point a program is ill-formed if the substitution
12411 results in an invalid type.] */
12414 tsubst_function_type (tree t
,
12416 tsubst_flags_t complain
,
12420 tree arg_types
= NULL_TREE
;
12423 /* The TYPE_CONTEXT is not used for function/method types. */
12424 gcc_assert (TYPE_CONTEXT (t
) == NULL_TREE
);
12426 /* DR 1227: Mixing immediate and non-immediate contexts in deduction
12428 bool late_return_type_p
= TYPE_HAS_LATE_RETURN_TYPE (t
);
12430 if (late_return_type_p
)
12432 /* Substitute the argument types. */
12433 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
, NULL_TREE
,
12434 complain
, in_decl
);
12435 if (arg_types
== error_mark_node
)
12436 return error_mark_node
;
12438 tree save_ccp
= current_class_ptr
;
12439 tree save_ccr
= current_class_ref
;
12440 tree this_type
= (TREE_CODE (t
) == METHOD_TYPE
12441 ? TREE_TYPE (TREE_VALUE (arg_types
)) : NULL_TREE
);
12442 bool do_inject
= this_type
&& CLASS_TYPE_P (this_type
);
12445 /* DR 1207: 'this' is in scope in the trailing return type. */
12446 inject_this_parameter (this_type
, cp_type_quals (this_type
));
12449 /* Substitute the return type. */
12450 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12454 current_class_ptr
= save_ccp
;
12455 current_class_ref
= save_ccr
;
12459 /* Substitute the return type. */
12460 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12462 if (return_type
== error_mark_node
)
12463 return error_mark_node
;
12464 /* DR 486 clarifies that creation of a function type with an
12465 invalid return type is a deduction failure. */
12466 if (TREE_CODE (return_type
) == ARRAY_TYPE
12467 || TREE_CODE (return_type
) == FUNCTION_TYPE
)
12469 if (complain
& tf_error
)
12471 if (TREE_CODE (return_type
) == ARRAY_TYPE
)
12472 error ("function returning an array");
12474 error ("function returning a function");
12476 return error_mark_node
;
12479 if (abstract_virtuals_error_sfinae (ACU_RETURN
, return_type
, complain
))
12480 return error_mark_node
;
12482 if (!late_return_type_p
)
12484 /* Substitute the argument types. */
12485 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
, NULL_TREE
,
12486 complain
, in_decl
);
12487 if (arg_types
== error_mark_node
)
12488 return error_mark_node
;
12491 /* Construct a new type node and return it. */
12492 if (TREE_CODE (t
) == FUNCTION_TYPE
)
12494 fntype
= build_function_type (return_type
, arg_types
);
12495 fntype
= apply_memfn_quals (fntype
,
12496 type_memfn_quals (t
),
12497 type_memfn_rqual (t
));
12501 tree r
= TREE_TYPE (TREE_VALUE (arg_types
));
12502 /* Don't pick up extra function qualifiers from the basetype. */
12503 r
= cp_build_qualified_type_real (r
, type_memfn_quals (t
), complain
);
12504 if (! MAYBE_CLASS_TYPE_P (r
))
12508 Type deduction may fail for any of the following
12511 -- Attempting to create "pointer to member of T" when T
12512 is not a class type. */
12513 if (complain
& tf_error
)
12514 error ("creating pointer to member function of non-class type %qT",
12516 return error_mark_node
;
12519 fntype
= build_method_type_directly (r
, return_type
,
12520 TREE_CHAIN (arg_types
));
12521 fntype
= build_ref_qualified_type (fntype
, type_memfn_rqual (t
));
12523 fntype
= cp_build_type_attribute_variant (fntype
, TYPE_ATTRIBUTES (t
));
12525 if (late_return_type_p
)
12526 TYPE_HAS_LATE_RETURN_TYPE (fntype
) = 1;
12531 /* FNTYPE is a FUNCTION_TYPE or METHOD_TYPE. Substitute the template
12532 ARGS into that specification, and return the substituted
12533 specification. If there is no specification, return NULL_TREE. */
12536 tsubst_exception_specification (tree fntype
,
12538 tsubst_flags_t complain
,
12545 specs
= TYPE_RAISES_EXCEPTIONS (fntype
);
12546 new_specs
= NULL_TREE
;
12547 if (specs
&& TREE_PURPOSE (specs
))
12549 /* A noexcept-specifier. */
12550 tree expr
= TREE_PURPOSE (specs
);
12551 if (TREE_CODE (expr
) == INTEGER_CST
)
12555 /* Defer instantiation of noexcept-specifiers to avoid
12556 excessive instantiations (c++/49107). */
12557 new_specs
= make_node (DEFERRED_NOEXCEPT
);
12558 if (DEFERRED_NOEXCEPT_SPEC_P (specs
))
12560 /* We already partially instantiated this member template,
12561 so combine the new args with the old. */
12562 DEFERRED_NOEXCEPT_PATTERN (new_specs
)
12563 = DEFERRED_NOEXCEPT_PATTERN (expr
);
12564 DEFERRED_NOEXCEPT_ARGS (new_specs
)
12565 = add_to_template_args (DEFERRED_NOEXCEPT_ARGS (expr
), args
);
12569 DEFERRED_NOEXCEPT_PATTERN (new_specs
) = expr
;
12570 DEFERRED_NOEXCEPT_ARGS (new_specs
) = args
;
12574 new_specs
= tsubst_copy_and_build
12575 (expr
, args
, complain
, in_decl
, /*function_p=*/false,
12576 /*integral_constant_expression_p=*/true);
12577 new_specs
= build_noexcept_spec (new_specs
, complain
);
12581 if (! TREE_VALUE (specs
))
12588 tree expanded_specs
= NULL_TREE
;
12590 if (PACK_EXPANSION_P (TREE_VALUE (specs
)))
12592 /* Expand the pack expansion type. */
12593 expanded_specs
= tsubst_pack_expansion (TREE_VALUE (specs
),
12597 if (expanded_specs
== error_mark_node
)
12598 return error_mark_node
;
12599 else if (TREE_CODE (expanded_specs
) == TREE_VEC
)
12600 len
= TREE_VEC_LENGTH (expanded_specs
);
12603 /* We're substituting into a member template, so
12604 we got a TYPE_PACK_EXPANSION back. Add that
12605 expansion and move on. */
12606 gcc_assert (TREE_CODE (expanded_specs
)
12607 == TYPE_PACK_EXPANSION
);
12608 new_specs
= add_exception_specifier (new_specs
,
12611 specs
= TREE_CHAIN (specs
);
12616 for (i
= 0; i
< len
; ++i
)
12618 if (expanded_specs
)
12619 spec
= TREE_VEC_ELT (expanded_specs
, i
);
12621 spec
= tsubst (TREE_VALUE (specs
), args
, complain
, in_decl
);
12622 if (spec
== error_mark_node
)
12624 new_specs
= add_exception_specifier (new_specs
, spec
,
12628 specs
= TREE_CHAIN (specs
);
12634 /* Take the tree structure T and replace template parameters used
12635 therein with the argument vector ARGS. IN_DECL is an associated
12636 decl for diagnostics. If an error occurs, returns ERROR_MARK_NODE.
12637 Issue error and warning messages under control of COMPLAIN. Note
12638 that we must be relatively non-tolerant of extensions here, in
12639 order to preserve conformance; if we allow substitutions that
12640 should not be allowed, we may allow argument deductions that should
12641 not succeed, and therefore report ambiguous overload situations
12642 where there are none. In theory, we could allow the substitution,
12643 but indicate that it should have failed, and allow our caller to
12644 make sure that the right thing happens, but we don't try to do this
12647 This function is used for dealing with types, decls and the like;
12648 for expressions, use tsubst_expr or tsubst_copy. */
12651 tsubst (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
12653 enum tree_code code
;
12654 tree type
, r
= NULL_TREE
;
12656 if (t
== NULL_TREE
|| t
== error_mark_node
12657 || t
== integer_type_node
12658 || t
== void_type_node
12659 || t
== char_type_node
12660 || t
== unknown_type_node
12661 || TREE_CODE (t
) == NAMESPACE_DECL
12662 || TREE_CODE (t
) == TRANSLATION_UNIT_DECL
)
12666 return tsubst_decl (t
, args
, complain
);
12668 if (args
== NULL_TREE
)
12671 code
= TREE_CODE (t
);
12673 if (code
== IDENTIFIER_NODE
)
12674 type
= IDENTIFIER_TYPE_VALUE (t
);
12676 type
= TREE_TYPE (t
);
12678 gcc_assert (type
!= unknown_type_node
);
12680 /* Reuse typedefs. We need to do this to handle dependent attributes,
12681 such as attribute aligned. */
12683 && typedef_variant_p (t
))
12685 tree decl
= TYPE_NAME (t
);
12687 if (alias_template_specialization_p (t
))
12689 /* DECL represents an alias template and we want to
12691 tree tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
12692 tree gen_args
= tsubst (DECL_TI_ARGS (decl
), args
, complain
, in_decl
);
12693 r
= instantiate_alias_template (tmpl
, gen_args
, complain
);
12695 else if (DECL_CLASS_SCOPE_P (decl
)
12696 && CLASSTYPE_TEMPLATE_INFO (DECL_CONTEXT (decl
))
12697 && uses_template_parms (DECL_CONTEXT (decl
)))
12699 tree tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
12700 tree gen_args
= tsubst (DECL_TI_ARGS (decl
), args
, complain
, in_decl
);
12701 r
= retrieve_specialization (tmpl
, gen_args
, 0);
12703 else if (DECL_FUNCTION_SCOPE_P (decl
)
12704 && DECL_TEMPLATE_INFO (DECL_CONTEXT (decl
))
12705 && uses_template_parms (DECL_TI_ARGS (DECL_CONTEXT (decl
))))
12706 r
= retrieve_local_specialization (decl
);
12708 /* The typedef is from a non-template context. */
12714 r
= cp_build_qualified_type_real
12715 (r
, cp_type_quals (t
) | cp_type_quals (r
),
12716 complain
| tf_ignore_bad_quals
);
12721 /* We don't have an instantiation yet, so drop the typedef. */
12722 int quals
= cp_type_quals (t
);
12723 t
= DECL_ORIGINAL_TYPE (decl
);
12724 t
= cp_build_qualified_type_real (t
, quals
,
12725 complain
| tf_ignore_bad_quals
);
12730 && code
!= TYPENAME_TYPE
12731 && code
!= TEMPLATE_TYPE_PARM
12732 && code
!= IDENTIFIER_NODE
12733 && code
!= FUNCTION_TYPE
12734 && code
!= METHOD_TYPE
)
12735 type
= tsubst (type
, args
, complain
, in_decl
);
12736 if (type
== error_mark_node
)
12737 return error_mark_node
;
12743 case ENUMERAL_TYPE
:
12744 return tsubst_aggr_type (t
, args
, complain
, in_decl
,
12745 /*entering_scope=*/0);
12748 case IDENTIFIER_NODE
:
12759 if (t
== integer_type_node
)
12762 if (TREE_CODE (TYPE_MIN_VALUE (t
)) == INTEGER_CST
12763 && TREE_CODE (TYPE_MAX_VALUE (t
)) == INTEGER_CST
)
12767 tree max
, omax
= TREE_OPERAND (TYPE_MAX_VALUE (t
), 0);
12769 max
= tsubst_expr (omax
, args
, complain
, in_decl
,
12770 /*integral_constant_expression_p=*/false);
12772 /* Fix up type of the magic NOP_EXPR with TREE_SIDE_EFFECTS if
12774 if (TREE_CODE (max
) == NOP_EXPR
12775 && TREE_SIDE_EFFECTS (omax
)
12776 && !TREE_TYPE (max
))
12777 TREE_TYPE (max
) = TREE_TYPE (TREE_OPERAND (max
, 0));
12779 /* If we're in a partial instantiation, preserve the magic NOP_EXPR
12780 with TREE_SIDE_EFFECTS that indicates this is not an integral
12781 constant expression. */
12782 if (processing_template_decl
12783 && TREE_SIDE_EFFECTS (omax
) && TREE_CODE (omax
) == NOP_EXPR
)
12785 gcc_assert (TREE_CODE (max
) == NOP_EXPR
);
12786 TREE_SIDE_EFFECTS (max
) = 1;
12789 return compute_array_index_type (NULL_TREE
, max
, complain
);
12792 case TEMPLATE_TYPE_PARM
:
12793 case TEMPLATE_TEMPLATE_PARM
:
12794 case BOUND_TEMPLATE_TEMPLATE_PARM
:
12795 case TEMPLATE_PARM_INDEX
:
12800 tree arg
= NULL_TREE
;
12802 /* Early in template argument deduction substitution, we don't
12803 want to reduce the level of 'auto', or it will be confused
12804 with a normal template parm in subsequent deduction. */
12805 if (is_auto (t
) && (complain
& tf_partial
))
12810 gcc_assert (TREE_VEC_LENGTH (args
) > 0);
12811 template_parm_level_and_index (t
, &level
, &idx
);
12813 levels
= TMPL_ARGS_DEPTH (args
);
12814 if (level
<= levels
12815 && TREE_VEC_LENGTH (TMPL_ARGS_LEVEL (args
, level
)) > 0)
12817 arg
= TMPL_ARG (args
, level
, idx
);
12819 if (arg
&& TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
12821 /* See through ARGUMENT_PACK_SELECT arguments. */
12822 arg
= ARGUMENT_PACK_SELECT_ARG (arg
);
12823 /* If the selected argument is an expansion E, that most
12824 likely means we were called from
12825 gen_elem_of_pack_expansion_instantiation during the
12826 substituting of pack an argument pack (which Ith
12827 element is a pack expansion, where I is
12828 ARGUMENT_PACK_SELECT_INDEX) into a pack expansion.
12829 In this case, the Ith element resulting from this
12830 substituting is going to be a pack expansion, which
12831 pattern is the pattern of E. Let's return the
12833 gen_elem_of_pack_expansion_instantiation will
12834 build the resulting pack expansion from it. */
12835 if (PACK_EXPANSION_P (arg
))
12837 /* Make sure we aren't throwing away arg info. */
12838 gcc_assert (!PACK_EXPANSION_EXTRA_ARGS (arg
));
12839 arg
= PACK_EXPANSION_PATTERN (arg
);
12844 if (arg
== error_mark_node
)
12845 return error_mark_node
;
12846 else if (arg
!= NULL_TREE
)
12848 if (ARGUMENT_PACK_P (arg
))
12849 /* If ARG is an argument pack, we don't actually want to
12850 perform a substitution here, because substitutions
12851 for argument packs are only done
12852 element-by-element. We can get to this point when
12853 substituting the type of a non-type template
12854 parameter pack, when that type actually contains
12855 template parameter packs from an outer template, e.g.,
12857 template<typename... Types> struct A {
12858 template<Types... Values> struct B { };
12862 if (code
== TEMPLATE_TYPE_PARM
)
12865 gcc_assert (TYPE_P (arg
));
12867 quals
= cp_type_quals (arg
) | cp_type_quals (t
);
12869 return cp_build_qualified_type_real
12870 (arg
, quals
, complain
| tf_ignore_bad_quals
);
12872 else if (code
== BOUND_TEMPLATE_TEMPLATE_PARM
)
12874 /* We are processing a type constructed from a
12875 template template parameter. */
12876 tree argvec
= tsubst (TYPE_TI_ARGS (t
),
12877 args
, complain
, in_decl
);
12878 if (argvec
== error_mark_node
)
12879 return error_mark_node
;
12881 gcc_assert (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
12882 || TREE_CODE (arg
) == TEMPLATE_DECL
12883 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
);
12885 if (TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
)
12886 /* Consider this code:
12888 template <template <class> class Template>
12890 template <class Arg> using Bind = Template<Arg>;
12893 template <template <class> class Template, class Arg>
12894 using Instantiate = Template<Arg>; //#0
12896 template <template <class> class Template,
12899 Instantiate<Internal<Template>::template Bind,
12902 When #1 is parsed, the
12903 BOUND_TEMPLATE_TEMPLATE_PARM representing the
12904 parameter `Template' in #0 matches the
12905 UNBOUND_CLASS_TEMPLATE representing the argument
12906 `Internal<Template>::template Bind'; We then want
12907 to assemble the type `Bind<Argument>' that can't
12908 be fully created right now, because
12909 `Internal<Template>' not being complete, the Bind
12910 template cannot be looked up in that context. So
12911 we need to "store" `Bind<Argument>' for later
12912 when the context of Bind becomes complete. Let's
12913 store that in a TYPENAME_TYPE. */
12914 return make_typename_type (TYPE_CONTEXT (arg
),
12915 build_nt (TEMPLATE_ID_EXPR
,
12916 TYPE_IDENTIFIER (arg
),
12921 /* We can get a TEMPLATE_TEMPLATE_PARM here when we
12922 are resolving nested-types in the signature of a
12923 member function templates. Otherwise ARG is a
12924 TEMPLATE_DECL and is the real template to be
12926 if (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
12927 arg
= TYPE_NAME (arg
);
12929 r
= lookup_template_class (arg
,
12931 DECL_CONTEXT (arg
),
12932 /*entering_scope=*/0,
12934 return cp_build_qualified_type_real
12935 (r
, cp_type_quals (t
) | cp_type_quals (r
), complain
);
12938 /* TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX. */
12939 return convert_from_reference (unshare_expr (arg
));
12943 /* This can happen during the attempted tsubst'ing in
12944 unify. This means that we don't yet have any information
12945 about the template parameter in question. */
12948 /* If we get here, we must have been looking at a parm for a
12949 more deeply nested template. Make a new version of this
12950 template parameter, but with a lower level. */
12953 case TEMPLATE_TYPE_PARM
:
12954 case TEMPLATE_TEMPLATE_PARM
:
12955 case BOUND_TEMPLATE_TEMPLATE_PARM
:
12956 if (cp_type_quals (t
))
12958 r
= tsubst (TYPE_MAIN_VARIANT (t
), args
, complain
, in_decl
);
12959 r
= cp_build_qualified_type_real
12960 (r
, cp_type_quals (t
),
12961 complain
| (code
== TEMPLATE_TYPE_PARM
12962 ? tf_ignore_bad_quals
: 0));
12964 else if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
12965 && PLACEHOLDER_TYPE_CONSTRAINTS (t
)
12966 && (r
= (TEMPLATE_PARM_DESCENDANTS
12967 (TEMPLATE_TYPE_PARM_INDEX (t
))))
12968 && (r
= TREE_TYPE (r
))
12969 && !PLACEHOLDER_TYPE_CONSTRAINTS (r
))
12970 /* Break infinite recursion when substituting the constraints
12971 of a constrained placeholder. */;
12975 TEMPLATE_TYPE_PARM_INDEX (r
)
12976 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (t
),
12977 r
, levels
, args
, complain
);
12978 TYPE_STUB_DECL (r
) = TYPE_NAME (r
) = TEMPLATE_TYPE_DECL (r
);
12979 TYPE_MAIN_VARIANT (r
) = r
;
12980 TYPE_POINTER_TO (r
) = NULL_TREE
;
12981 TYPE_REFERENCE_TO (r
) = NULL_TREE
;
12983 /* Propagate constraints on placeholders. */
12984 if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
12985 if (tree constr
= PLACEHOLDER_TYPE_CONSTRAINTS (t
))
12986 PLACEHOLDER_TYPE_CONSTRAINTS (r
)
12987 = tsubst_constraint (constr
, args
, complain
, in_decl
);
12989 if (TREE_CODE (r
) == TEMPLATE_TEMPLATE_PARM
)
12990 /* We have reduced the level of the template
12991 template parameter, but not the levels of its
12992 template parameters, so canonical_type_parameter
12993 will not be able to find the canonical template
12994 template parameter for this level. Thus, we
12995 require structural equality checking to compare
12996 TEMPLATE_TEMPLATE_PARMs. */
12997 SET_TYPE_STRUCTURAL_EQUALITY (r
);
12998 else if (TYPE_STRUCTURAL_EQUALITY_P (t
))
12999 SET_TYPE_STRUCTURAL_EQUALITY (r
);
13001 TYPE_CANONICAL (r
) = canonical_type_parameter (r
);
13003 if (code
== BOUND_TEMPLATE_TEMPLATE_PARM
)
13005 tree argvec
= tsubst (TYPE_TI_ARGS (t
), args
,
13006 complain
, in_decl
);
13007 if (argvec
== error_mark_node
)
13008 return error_mark_node
;
13010 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (r
)
13011 = build_template_info (TYPE_TI_TEMPLATE (t
), argvec
);
13016 case TEMPLATE_PARM_INDEX
:
13017 r
= reduce_template_parm_level (t
, type
, levels
, args
, complain
);
13021 gcc_unreachable ();
13029 tree purpose
, value
, chain
;
13031 if (t
== void_list_node
)
13034 purpose
= TREE_PURPOSE (t
);
13037 purpose
= tsubst (purpose
, args
, complain
, in_decl
);
13038 if (purpose
== error_mark_node
)
13039 return error_mark_node
;
13041 value
= TREE_VALUE (t
);
13044 value
= tsubst (value
, args
, complain
, in_decl
);
13045 if (value
== error_mark_node
)
13046 return error_mark_node
;
13048 chain
= TREE_CHAIN (t
);
13049 if (chain
&& chain
!= void_type_node
)
13051 chain
= tsubst (chain
, args
, complain
, in_decl
);
13052 if (chain
== error_mark_node
)
13053 return error_mark_node
;
13055 if (purpose
== TREE_PURPOSE (t
)
13056 && value
== TREE_VALUE (t
)
13057 && chain
== TREE_CHAIN (t
))
13059 return hash_tree_cons (purpose
, value
, chain
);
13063 /* We should never be tsubsting a binfo. */
13064 gcc_unreachable ();
13067 /* A vector of template arguments. */
13068 gcc_assert (!type
);
13069 return tsubst_template_args (t
, args
, complain
, in_decl
);
13072 case REFERENCE_TYPE
:
13074 if (type
== TREE_TYPE (t
) && TREE_CODE (type
) != METHOD_TYPE
)
13079 Type deduction may fail for any of the following
13082 -- Attempting to create a pointer to reference type.
13083 -- Attempting to create a reference to a reference type or
13084 a reference to void.
13086 Core issue 106 says that creating a reference to a reference
13087 during instantiation is no longer a cause for failure. We
13088 only enforce this check in strict C++98 mode. */
13089 if ((TREE_CODE (type
) == REFERENCE_TYPE
13090 && (((cxx_dialect
== cxx98
) && flag_iso
) || code
!= REFERENCE_TYPE
))
13091 || (code
== REFERENCE_TYPE
&& VOID_TYPE_P (type
)))
13093 static location_t last_loc
;
13095 /* We keep track of the last time we issued this error
13096 message to avoid spewing a ton of messages during a
13097 single bad template instantiation. */
13098 if (complain
& tf_error
13099 && last_loc
!= input_location
)
13101 if (VOID_TYPE_P (type
))
13102 error ("forming reference to void");
13103 else if (code
== POINTER_TYPE
)
13104 error ("forming pointer to reference type %qT", type
);
13106 error ("forming reference to reference type %qT", type
);
13107 last_loc
= input_location
;
13110 return error_mark_node
;
13112 else if (TREE_CODE (type
) == FUNCTION_TYPE
13113 && (type_memfn_quals (type
) != TYPE_UNQUALIFIED
13114 || type_memfn_rqual (type
) != REF_QUAL_NONE
))
13116 if (complain
& tf_error
)
13118 if (code
== POINTER_TYPE
)
13119 error ("forming pointer to qualified function type %qT",
13122 error ("forming reference to qualified function type %qT",
13125 return error_mark_node
;
13127 else if (code
== POINTER_TYPE
)
13129 r
= build_pointer_type (type
);
13130 if (TREE_CODE (type
) == METHOD_TYPE
)
13131 r
= build_ptrmemfunc_type (r
);
13133 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
13134 /* In C++0x, during template argument substitution, when there is an
13135 attempt to create a reference to a reference type, reference
13136 collapsing is applied as described in [14.3.1/4 temp.arg.type]:
13138 "If a template-argument for a template-parameter T names a type
13139 that is a reference to a type A, an attempt to create the type
13140 'lvalue reference to cv T' creates the type 'lvalue reference to
13141 A,' while an attempt to create the type type rvalue reference to
13142 cv T' creates the type T"
13144 r
= cp_build_reference_type
13146 TYPE_REF_IS_RVALUE (t
) && TYPE_REF_IS_RVALUE (type
));
13148 r
= cp_build_reference_type (type
, TYPE_REF_IS_RVALUE (t
));
13149 r
= cp_build_qualified_type_real (r
, cp_type_quals (t
), complain
);
13151 if (r
!= error_mark_node
)
13152 /* Will this ever be needed for TYPE_..._TO values? */
13159 r
= tsubst (TYPE_OFFSET_BASETYPE (t
), args
, complain
, in_decl
);
13160 if (r
== error_mark_node
|| !MAYBE_CLASS_TYPE_P (r
))
13164 Type deduction may fail for any of the following
13167 -- Attempting to create "pointer to member of T" when T
13168 is not a class type. */
13169 if (complain
& tf_error
)
13170 error ("creating pointer to member of non-class type %qT", r
);
13171 return error_mark_node
;
13173 if (TREE_CODE (type
) == REFERENCE_TYPE
)
13175 if (complain
& tf_error
)
13176 error ("creating pointer to member reference type %qT", type
);
13177 return error_mark_node
;
13179 if (VOID_TYPE_P (type
))
13181 if (complain
& tf_error
)
13182 error ("creating pointer to member of type void");
13183 return error_mark_node
;
13185 gcc_assert (TREE_CODE (type
) != METHOD_TYPE
);
13186 if (TREE_CODE (type
) == FUNCTION_TYPE
)
13188 /* The type of the implicit object parameter gets its
13189 cv-qualifiers from the FUNCTION_TYPE. */
13192 = build_memfn_type (type
, r
, type_memfn_quals (type
),
13193 type_memfn_rqual (type
));
13194 memptr
= build_ptrmemfunc_type (build_pointer_type (method_type
));
13195 return cp_build_qualified_type_real (memptr
, cp_type_quals (t
),
13199 return cp_build_qualified_type_real (build_ptrmem_type (r
, type
),
13203 case FUNCTION_TYPE
:
13208 fntype
= tsubst_function_type (t
, args
, complain
, in_decl
);
13209 if (fntype
== error_mark_node
)
13210 return error_mark_node
;
13212 /* Substitute the exception specification. */
13213 specs
= tsubst_exception_specification (t
, args
, complain
,
13214 in_decl
, /*defer_ok*/true);
13215 if (specs
== error_mark_node
)
13216 return error_mark_node
;
13218 fntype
= build_exception_variant (fntype
, specs
);
13223 tree domain
= tsubst (TYPE_DOMAIN (t
), args
, complain
, in_decl
);
13224 if (domain
== error_mark_node
)
13225 return error_mark_node
;
13227 /* As an optimization, we avoid regenerating the array type if
13228 it will obviously be the same as T. */
13229 if (type
== TREE_TYPE (t
) && domain
== TYPE_DOMAIN (t
))
13232 /* These checks should match the ones in create_array_type_for_decl.
13236 The deduction may fail for any of the following reasons:
13238 -- Attempting to create an array with an element type that
13239 is void, a function type, or a reference type, or [DR337]
13240 an abstract class type. */
13241 if (VOID_TYPE_P (type
)
13242 || TREE_CODE (type
) == FUNCTION_TYPE
13243 || (TREE_CODE (type
) == ARRAY_TYPE
13244 && TYPE_DOMAIN (type
) == NULL_TREE
)
13245 || TREE_CODE (type
) == REFERENCE_TYPE
)
13247 if (complain
& tf_error
)
13248 error ("creating array of %qT", type
);
13249 return error_mark_node
;
13252 if (abstract_virtuals_error_sfinae (ACU_ARRAY
, type
, complain
))
13253 return error_mark_node
;
13255 r
= build_cplus_array_type (type
, domain
);
13257 if (TYPE_USER_ALIGN (t
))
13259 TYPE_ALIGN (r
) = TYPE_ALIGN (t
);
13260 TYPE_USER_ALIGN (r
) = 1;
13266 case TYPENAME_TYPE
:
13268 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
13269 in_decl
, /*entering_scope=*/1);
13270 tree f
= tsubst_copy (TYPENAME_TYPE_FULLNAME (t
), args
,
13271 complain
, in_decl
);
13273 if (ctx
== error_mark_node
|| f
== error_mark_node
)
13274 return error_mark_node
;
13276 if (!MAYBE_CLASS_TYPE_P (ctx
))
13278 if (complain
& tf_error
)
13279 error ("%qT is not a class, struct, or union type", ctx
);
13280 return error_mark_node
;
13282 else if (!uses_template_parms (ctx
) && !TYPE_BEING_DEFINED (ctx
))
13284 /* Normally, make_typename_type does not require that the CTX
13285 have complete type in order to allow things like:
13287 template <class T> struct S { typename S<T>::X Y; };
13289 But, such constructs have already been resolved by this
13290 point, so here CTX really should have complete type, unless
13291 it's a partial instantiation. */
13292 ctx
= complete_type (ctx
);
13293 if (!COMPLETE_TYPE_P (ctx
))
13295 if (complain
& tf_error
)
13296 cxx_incomplete_type_error (NULL_TREE
, ctx
);
13297 return error_mark_node
;
13301 f
= make_typename_type (ctx
, f
, typename_type
,
13302 complain
| tf_keep_type_decl
);
13303 if (f
== error_mark_node
)
13305 if (TREE_CODE (f
) == TYPE_DECL
)
13307 complain
|= tf_ignore_bad_quals
;
13311 if (TREE_CODE (f
) != TYPENAME_TYPE
)
13313 if (TYPENAME_IS_ENUM_P (t
) && TREE_CODE (f
) != ENUMERAL_TYPE
)
13315 if (complain
& tf_error
)
13316 error ("%qT resolves to %qT, which is not an enumeration type",
13319 return error_mark_node
;
13321 else if (TYPENAME_IS_CLASS_P (t
) && !CLASS_TYPE_P (f
))
13323 if (complain
& tf_error
)
13324 error ("%qT resolves to %qT, which is is not a class type",
13327 return error_mark_node
;
13331 return cp_build_qualified_type_real
13332 (f
, cp_type_quals (f
) | cp_type_quals (t
), complain
);
13335 case UNBOUND_CLASS_TEMPLATE
:
13337 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
13338 in_decl
, /*entering_scope=*/1);
13339 tree name
= TYPE_IDENTIFIER (t
);
13340 tree parm_list
= DECL_TEMPLATE_PARMS (TYPE_NAME (t
));
13342 if (ctx
== error_mark_node
|| name
== error_mark_node
)
13343 return error_mark_node
;
13346 parm_list
= tsubst_template_parms (parm_list
, args
, complain
);
13347 return make_unbound_class_template (ctx
, name
, parm_list
, complain
);
13354 ++cp_unevaluated_operand
;
13355 ++c_inhibit_evaluation_warnings
;
13357 type
= tsubst_expr (TYPEOF_TYPE_EXPR (t
), args
,
13359 /*integral_constant_expression_p=*/false);
13361 --cp_unevaluated_operand
;
13362 --c_inhibit_evaluation_warnings
;
13364 type
= finish_typeof (type
);
13365 return cp_build_qualified_type_real (type
,
13367 | cp_type_quals (type
),
13371 case DECLTYPE_TYPE
:
13375 ++cp_unevaluated_operand
;
13376 ++c_inhibit_evaluation_warnings
;
13378 type
= tsubst_copy_and_build (DECLTYPE_TYPE_EXPR (t
), args
,
13379 complain
|tf_decltype
, in_decl
,
13380 /*function_p*/false,
13381 /*integral_constant_expression*/false);
13383 --cp_unevaluated_operand
;
13384 --c_inhibit_evaluation_warnings
;
13386 if (DECLTYPE_FOR_LAMBDA_CAPTURE (t
))
13387 type
= lambda_capture_field_type (type
,
13388 DECLTYPE_FOR_INIT_CAPTURE (t
));
13389 else if (DECLTYPE_FOR_LAMBDA_PROXY (t
))
13390 type
= lambda_proxy_type (type
);
13393 bool id
= DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t
);
13394 if (id
&& TREE_CODE (DECLTYPE_TYPE_EXPR (t
)) == BIT_NOT_EXPR
13396 /* In a template ~id could be either a complement expression
13397 or an unqualified-id naming a destructor; if instantiating
13398 it produces an expression, it's not an id-expression or
13401 type
= finish_decltype_type (type
, id
, complain
);
13403 return cp_build_qualified_type_real (type
,
13405 | cp_type_quals (type
),
13406 complain
| tf_ignore_bad_quals
);
13409 case UNDERLYING_TYPE
:
13411 tree type
= tsubst (UNDERLYING_TYPE_TYPE (t
), args
,
13412 complain
, in_decl
);
13413 return finish_underlying_type (type
);
13416 case TYPE_ARGUMENT_PACK
:
13417 case NONTYPE_ARGUMENT_PACK
:
13419 tree r
= TYPE_P (t
) ? cxx_make_type (code
) : make_node (code
);
13421 tsubst_template_args (ARGUMENT_PACK_ARGS (t
),
13425 SET_ARGUMENT_PACK_ARGS (r
, packed_out
);
13427 /* For template nontype argument packs, also substitute into
13429 if (code
== NONTYPE_ARGUMENT_PACK
)
13430 TREE_TYPE (r
) = tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13449 /* We should use one of the expression tsubsts for these codes. */
13450 gcc_unreachable ();
13453 sorry ("use of %qs in template", get_tree_code_name (code
));
13454 return error_mark_node
;
13458 /* Like tsubst_expr for a BASELINK. OBJECT_TYPE, if non-NULL, is the
13459 type of the expression on the left-hand side of the "." or "->"
13463 tsubst_baselink (tree baselink
, tree object_type
,
13464 tree args
, tsubst_flags_t complain
, tree in_decl
)
13467 tree qualifying_scope
;
13470 tree template_args
= 0;
13471 bool template_id_p
= false;
13472 bool qualified
= BASELINK_QUALIFIED_P (baselink
);
13474 /* A baselink indicates a function from a base class. Both the
13475 BASELINK_ACCESS_BINFO and the base class referenced may
13476 indicate bases of the template class, rather than the
13477 instantiated class. In addition, lookups that were not
13478 ambiguous before may be ambiguous now. Therefore, we perform
13479 the lookup again. */
13480 qualifying_scope
= BINFO_TYPE (BASELINK_ACCESS_BINFO (baselink
));
13481 qualifying_scope
= tsubst (qualifying_scope
, args
,
13482 complain
, in_decl
);
13483 fns
= BASELINK_FUNCTIONS (baselink
);
13484 optype
= tsubst (BASELINK_OPTYPE (baselink
), args
, complain
, in_decl
);
13485 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
13487 template_id_p
= true;
13488 template_args
= TREE_OPERAND (fns
, 1);
13489 fns
= TREE_OPERAND (fns
, 0);
13491 template_args
= tsubst_template_args (template_args
, args
,
13492 complain
, in_decl
);
13494 name
= DECL_NAME (get_first_fn (fns
));
13495 if (IDENTIFIER_TYPENAME_P (name
))
13496 name
= mangle_conv_op_name_for_type (optype
);
13497 baselink
= lookup_fnfields (qualifying_scope
, name
, /*protect=*/1);
13499 return error_mark_node
;
13501 /* If lookup found a single function, mark it as used at this
13502 point. (If it lookup found multiple functions the one selected
13503 later by overload resolution will be marked as used at that
13505 if (BASELINK_P (baselink
))
13506 fns
= BASELINK_FUNCTIONS (baselink
);
13507 if (!template_id_p
&& !really_overloaded_fn (fns
)
13508 && !mark_used (OVL_CURRENT (fns
), complain
) && !(complain
& tf_error
))
13509 return error_mark_node
;
13511 /* Add back the template arguments, if present. */
13512 if (BASELINK_P (baselink
) && template_id_p
)
13513 BASELINK_FUNCTIONS (baselink
)
13514 = build_nt (TEMPLATE_ID_EXPR
,
13515 BASELINK_FUNCTIONS (baselink
),
13517 /* Update the conversion operator type. */
13518 BASELINK_OPTYPE (baselink
) = optype
;
13521 object_type
= current_class_type
;
13524 baselink
= adjust_result_of_qualified_name_lookup (baselink
,
13530 /* Like tsubst_expr for a SCOPE_REF, given by QUALIFIED_ID. DONE is
13531 true if the qualified-id will be a postfix-expression in-and-of
13532 itself; false if more of the postfix-expression follows the
13533 QUALIFIED_ID. ADDRESS_P is true if the qualified-id is the operand
13537 tsubst_qualified_id (tree qualified_id
, tree args
,
13538 tsubst_flags_t complain
, tree in_decl
,
13539 bool done
, bool address_p
)
13545 tree template_args
;
13546 location_t loc
= UNKNOWN_LOCATION
;
13548 gcc_assert (TREE_CODE (qualified_id
) == SCOPE_REF
);
13550 /* Figure out what name to look up. */
13551 name
= TREE_OPERAND (qualified_id
, 1);
13552 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
13554 is_template
= true;
13555 loc
= EXPR_LOCATION (name
);
13556 template_args
= TREE_OPERAND (name
, 1);
13558 template_args
= tsubst_template_args (template_args
, args
,
13559 complain
, in_decl
);
13560 name
= TREE_OPERAND (name
, 0);
13564 is_template
= false;
13565 template_args
= NULL_TREE
;
13568 /* Substitute into the qualifying scope. When there are no ARGS, we
13569 are just trying to simplify a non-dependent expression. In that
13570 case the qualifying scope may be dependent, and, in any case,
13571 substituting will not help. */
13572 scope
= TREE_OPERAND (qualified_id
, 0);
13575 scope
= tsubst (scope
, args
, complain
, in_decl
);
13576 expr
= tsubst_copy (name
, args
, complain
, in_decl
);
13581 if (dependent_scope_p (scope
))
13584 expr
= build_min_nt_loc (loc
, TEMPLATE_ID_EXPR
, expr
, template_args
);
13585 return build_qualified_name (NULL_TREE
, scope
, expr
,
13586 QUALIFIED_NAME_IS_TEMPLATE (qualified_id
));
13589 if (!BASELINK_P (name
) && !DECL_P (expr
))
13591 if (TREE_CODE (expr
) == BIT_NOT_EXPR
)
13593 /* A BIT_NOT_EXPR is used to represent a destructor. */
13594 if (!check_dtor_name (scope
, TREE_OPERAND (expr
, 0)))
13596 error ("qualifying type %qT does not match destructor name ~%qT",
13597 scope
, TREE_OPERAND (expr
, 0));
13598 expr
= error_mark_node
;
13601 expr
= lookup_qualified_name (scope
, complete_dtor_identifier
,
13602 /*is_type_p=*/0, false);
13605 expr
= lookup_qualified_name (scope
, expr
, /*is_type_p=*/0, false);
13606 if (TREE_CODE (TREE_CODE (expr
) == TEMPLATE_DECL
13607 ? DECL_TEMPLATE_RESULT (expr
) : expr
) == TYPE_DECL
)
13609 if (complain
& tf_error
)
13611 error ("dependent-name %qE is parsed as a non-type, but "
13612 "instantiation yields a type", qualified_id
);
13613 inform (input_location
, "say %<typename %E%> if a type is meant", qualified_id
);
13615 return error_mark_node
;
13621 check_accessibility_of_qualified_id (expr
, /*object_type=*/NULL_TREE
,
13623 /* Remember that there was a reference to this entity. */
13624 if (!mark_used (expr
, complain
) && !(complain
& tf_error
))
13625 return error_mark_node
;
13628 if (expr
== error_mark_node
|| TREE_CODE (expr
) == TREE_LIST
)
13630 if (complain
& tf_error
)
13631 qualified_name_lookup_error (scope
,
13632 TREE_OPERAND (qualified_id
, 1),
13633 expr
, input_location
);
13634 return error_mark_node
;
13638 expr
= lookup_template_function (expr
, template_args
);
13640 if (expr
== error_mark_node
&& complain
& tf_error
)
13641 qualified_name_lookup_error (scope
, TREE_OPERAND (qualified_id
, 1),
13642 expr
, input_location
);
13643 else if (TYPE_P (scope
))
13645 expr
= (adjust_result_of_qualified_name_lookup
13646 (expr
, scope
, current_nonlambda_class_type ()));
13647 expr
= (finish_qualified_id_expr
13648 (scope
, expr
, done
, address_p
&& PTRMEM_OK_P (qualified_id
),
13649 QUALIFIED_NAME_IS_TEMPLATE (qualified_id
),
13650 /*template_arg_p=*/false, complain
));
13653 /* Expressions do not generally have reference type. */
13654 if (TREE_CODE (expr
) != SCOPE_REF
13655 /* However, if we're about to form a pointer-to-member, we just
13656 want the referenced member referenced. */
13657 && TREE_CODE (expr
) != OFFSET_REF
)
13658 expr
= convert_from_reference (expr
);
13663 /* tsubst the initializer for a VAR_DECL. INIT is the unsubstituted
13664 initializer, DECL is the substituted VAR_DECL. Other arguments are as
13668 tsubst_init (tree init
, tree decl
, tree args
,
13669 tsubst_flags_t complain
, tree in_decl
)
13674 init
= tsubst_expr (init
, args
, complain
, in_decl
, false);
13678 /* If we had an initializer but it
13679 instantiated to nothing,
13680 value-initialize the object. This will
13681 only occur when the initializer was a
13682 pack expansion where the parameter packs
13683 used in that expansion were of length
13685 init
= build_value_init (TREE_TYPE (decl
),
13687 if (TREE_CODE (init
) == AGGR_INIT_EXPR
)
13688 init
= get_target_expr_sfinae (init
, complain
);
13694 /* Like tsubst, but deals with expressions. This function just replaces
13695 template parms; to finish processing the resultant expression, use
13696 tsubst_copy_and_build or tsubst_expr. */
13699 tsubst_copy (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
13701 enum tree_code code
;
13704 if (t
== NULL_TREE
|| t
== error_mark_node
|| args
== NULL_TREE
)
13707 code
= TREE_CODE (t
);
13712 r
= retrieve_local_specialization (t
);
13714 if (r
== NULL_TREE
)
13716 /* We get here for a use of 'this' in an NSDMI. */
13717 if (DECL_NAME (t
) == this_identifier
13718 && current_function_decl
13719 && DECL_CONSTRUCTOR_P (current_function_decl
))
13720 return current_class_ptr
;
13722 /* This can happen for a parameter name used later in a function
13723 declaration (such as in a late-specified return type). Just
13724 make a dummy decl, since it's only used for its type. */
13725 gcc_assert (cp_unevaluated_operand
!= 0);
13726 r
= tsubst_decl (t
, args
, complain
);
13727 /* Give it the template pattern as its context; its true context
13728 hasn't been instantiated yet and this is good enough for
13730 DECL_CONTEXT (r
) = DECL_CONTEXT (t
);
13733 if (TREE_CODE (r
) == ARGUMENT_PACK_SELECT
)
13734 r
= ARGUMENT_PACK_SELECT_ARG (r
);
13735 if (!mark_used (r
, complain
) && !(complain
& tf_error
))
13736 return error_mark_node
;
13744 if (DECL_TEMPLATE_PARM_P (t
))
13745 return tsubst_copy (DECL_INITIAL (t
), args
, complain
, in_decl
);
13746 /* There is no need to substitute into namespace-scope
13748 if (DECL_NAMESPACE_SCOPE_P (t
))
13750 /* If ARGS is NULL, then T is known to be non-dependent. */
13751 if (args
== NULL_TREE
)
13752 return scalar_constant_value (t
);
13754 /* Unfortunately, we cannot just call lookup_name here.
13757 template <int I> int f() {
13759 struct S { void g() { E e = a; } };
13762 When we instantiate f<7>::S::g(), say, lookup_name is not
13763 clever enough to find f<7>::a. */
13765 = tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
13766 /*entering_scope=*/0);
13768 for (v
= TYPE_VALUES (enum_type
);
13770 v
= TREE_CHAIN (v
))
13771 if (TREE_PURPOSE (v
) == DECL_NAME (t
))
13772 return TREE_VALUE (v
);
13774 /* We didn't find the name. That should never happen; if
13775 name-lookup found it during preliminary parsing, we
13776 should find it again here during instantiation. */
13777 gcc_unreachable ();
13782 if (PACK_EXPANSION_P (TREE_TYPE (t
)))
13784 /* Check for a local specialization set up by
13785 tsubst_pack_expansion. */
13786 if (tree r
= retrieve_local_specialization (t
))
13788 if (TREE_CODE (r
) == ARGUMENT_PACK_SELECT
)
13789 r
= ARGUMENT_PACK_SELECT_ARG (r
);
13793 /* When retrieving a capture pack from a generic lambda, remove the
13794 lambda call op's own template argument list from ARGS. Only the
13795 template arguments active for the closure type should be used to
13796 retrieve the pack specialization. */
13797 if (LAMBDA_FUNCTION_P (current_function_decl
)
13798 && (template_class_depth (DECL_CONTEXT (t
))
13799 != TMPL_ARGS_DEPTH (args
)))
13800 args
= strip_innermost_template_args (args
, 1);
13802 /* Otherwise return the full NONTYPE_ARGUMENT_PACK that
13803 tsubst_decl put in the hash table. */
13804 return retrieve_specialization (t
, args
, 0);
13807 if (DECL_CONTEXT (t
))
13811 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
13812 /*entering_scope=*/1);
13813 if (ctx
!= DECL_CONTEXT (t
))
13815 tree r
= lookup_field (ctx
, DECL_NAME (t
), 0, false);
13818 if (complain
& tf_error
)
13819 error ("using invalid field %qD", t
);
13820 return error_mark_node
;
13829 case FUNCTION_DECL
:
13830 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
))
13831 r
= tsubst (t
, args
, complain
, in_decl
);
13832 else if (local_variable_p (t
))
13834 r
= retrieve_local_specialization (t
);
13835 if (r
== NULL_TREE
)
13837 /* First try name lookup to find the instantiation. */
13838 r
= lookup_name (DECL_NAME (t
));
13841 /* Make sure that the one we found is the one we want. */
13842 tree ctx
= DECL_CONTEXT (t
);
13843 if (DECL_LANG_SPECIFIC (ctx
) && DECL_TEMPLATE_INFO (ctx
))
13844 ctx
= tsubst (ctx
, args
, complain
, in_decl
);
13845 if (ctx
!= DECL_CONTEXT (r
))
13853 /* This can happen for a variable used in a
13854 late-specified return type of a local lambda, or for a
13855 local static or constant. Building a new VAR_DECL
13856 should be OK in all those cases. */
13857 r
= tsubst_decl (t
, args
, complain
);
13858 if (decl_maybe_constant_var_p (r
))
13860 /* We can't call cp_finish_decl, so handle the
13861 initializer by hand. */
13862 tree init
= tsubst_init (DECL_INITIAL (t
), r
, args
,
13863 complain
, in_decl
);
13864 if (!processing_template_decl
)
13865 init
= maybe_constant_init (init
);
13866 if (processing_template_decl
13867 ? potential_constant_expression (init
)
13868 : reduced_constant_expression_p (init
))
13869 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r
)
13870 = TREE_CONSTANT (r
) = true;
13871 DECL_INITIAL (r
) = init
;
13873 gcc_assert (cp_unevaluated_operand
|| TREE_STATIC (r
)
13874 || decl_constant_var_p (r
)
13875 || errorcount
|| sorrycount
);
13876 if (!processing_template_decl
)
13878 if (TREE_STATIC (r
))
13879 rest_of_decl_compilation (r
, toplevel_bindings_p (),
13882 r
= process_outer_var_ref (r
, complain
);
13885 /* Remember this for subsequent uses. */
13886 if (local_specializations
)
13887 register_local_specialization (r
, t
);
13892 if (!mark_used (r
, complain
) && !(complain
& tf_error
))
13893 return error_mark_node
;
13896 case NAMESPACE_DECL
:
13900 /* An OVERLOAD will always be a non-dependent overload set; an
13901 overload set from function scope will just be represented with an
13902 IDENTIFIER_NODE, and from class scope with a BASELINK. */
13903 gcc_assert (!uses_template_parms (t
));
13907 return tsubst_baselink (t
, current_nonlambda_class_type (),
13908 args
, complain
, in_decl
);
13910 case TEMPLATE_DECL
:
13911 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
13912 return tsubst (TREE_TYPE (DECL_TEMPLATE_RESULT (t
)),
13913 args
, complain
, in_decl
);
13914 else if (DECL_FUNCTION_TEMPLATE_P (t
) && DECL_MEMBER_TEMPLATE_P (t
))
13915 return tsubst (t
, args
, complain
, in_decl
);
13916 else if (DECL_CLASS_SCOPE_P (t
)
13917 && uses_template_parms (DECL_CONTEXT (t
)))
13919 /* Template template argument like the following example need
13922 template <template <class> class TT> struct C {};
13923 template <class T> struct D {
13924 template <class U> struct E {};
13929 We are processing the template argument `E' in #1 for
13930 the template instantiation #2. Originally, `E' is a
13931 TEMPLATE_DECL with `D<T>' as its DECL_CONTEXT. Now we
13932 have to substitute this with one having context `D<int>'. */
13934 tree context
= tsubst (DECL_CONTEXT (t
), args
, complain
, in_decl
);
13935 return lookup_field (context
, DECL_NAME(t
), 0, false);
13938 /* Ordinary template template argument. */
13942 case REINTERPRET_CAST_EXPR
:
13943 case CONST_CAST_EXPR
:
13944 case STATIC_CAST_EXPR
:
13945 case DYNAMIC_CAST_EXPR
:
13946 case IMPLICIT_CONV_EXPR
:
13950 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13951 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13952 return build1 (code
, type
, op0
);
13956 if (PACK_EXPANSION_P (TREE_OPERAND (t
, 0)))
13958 tree expanded
, op
= TREE_OPERAND (t
, 0);
13961 if (SIZEOF_EXPR_TYPE_P (t
))
13962 op
= TREE_TYPE (op
);
13964 ++cp_unevaluated_operand
;
13965 ++c_inhibit_evaluation_warnings
;
13966 /* We only want to compute the number of arguments. */
13967 expanded
= tsubst_pack_expansion (op
, args
, complain
, in_decl
);
13968 --cp_unevaluated_operand
;
13969 --c_inhibit_evaluation_warnings
;
13971 if (TREE_CODE (expanded
) == TREE_VEC
)
13972 len
= TREE_VEC_LENGTH (expanded
);
13974 if (expanded
== error_mark_node
)
13975 return error_mark_node
;
13976 else if (PACK_EXPANSION_P (expanded
)
13977 || (TREE_CODE (expanded
) == TREE_VEC
13979 && PACK_EXPANSION_P (TREE_VEC_ELT (expanded
, len
-1))))
13981 if (TREE_CODE (expanded
) == TREE_VEC
)
13982 expanded
= TREE_VEC_ELT (expanded
, len
- 1);
13984 PACK_EXPANSION_SIZEOF_P (expanded
) = true;
13986 if (TYPE_P (expanded
))
13987 return cxx_sizeof_or_alignof_type (expanded
, SIZEOF_EXPR
,
13988 complain
& tf_error
);
13990 return cxx_sizeof_or_alignof_expr (expanded
, SIZEOF_EXPR
,
13991 complain
& tf_error
);
13994 return build_int_cst (size_type_node
, len
);
13996 if (SIZEOF_EXPR_TYPE_P (t
))
13998 r
= tsubst (TREE_TYPE (TREE_OPERAND (t
, 0)),
13999 args
, complain
, in_decl
);
14000 r
= build1 (NOP_EXPR
, r
, error_mark_node
);
14001 r
= build1 (SIZEOF_EXPR
,
14002 tsubst (TREE_TYPE (t
), args
, complain
, in_decl
), r
);
14003 SIZEOF_EXPR_TYPE_P (r
) = 1;
14010 case TRUTH_NOT_EXPR
:
14013 case UNARY_PLUS_EXPR
: /* Unary + */
14015 case AT_ENCODE_EXPR
:
14019 case REALPART_EXPR
:
14020 case IMAGPART_EXPR
:
14023 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14024 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14025 return build1 (code
, type
, op0
);
14028 case COMPONENT_REF
:
14033 object
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14034 name
= TREE_OPERAND (t
, 1);
14035 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
14037 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
14038 complain
, in_decl
);
14039 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
14041 else if (TREE_CODE (name
) == SCOPE_REF
14042 && TREE_CODE (TREE_OPERAND (name
, 1)) == BIT_NOT_EXPR
)
14044 tree base
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
14045 complain
, in_decl
);
14046 name
= TREE_OPERAND (name
, 1);
14047 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
14048 complain
, in_decl
);
14049 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
14050 name
= build_qualified_name (/*type=*/NULL_TREE
,
14052 /*template_p=*/false);
14054 else if (BASELINK_P (name
))
14055 name
= tsubst_baselink (name
,
14056 non_reference (TREE_TYPE (object
)),
14060 name
= tsubst_copy (name
, args
, complain
, in_decl
);
14061 return build_nt (COMPONENT_REF
, object
, name
, NULL_TREE
);
14067 case TRUNC_DIV_EXPR
:
14068 case CEIL_DIV_EXPR
:
14069 case FLOOR_DIV_EXPR
:
14070 case ROUND_DIV_EXPR
:
14071 case EXACT_DIV_EXPR
:
14075 case TRUNC_MOD_EXPR
:
14076 case FLOOR_MOD_EXPR
:
14077 case TRUTH_ANDIF_EXPR
:
14078 case TRUTH_ORIF_EXPR
:
14079 case TRUTH_AND_EXPR
:
14080 case TRUTH_OR_EXPR
:
14093 case COMPOUND_EXPR
:
14096 case PREDECREMENT_EXPR
:
14097 case PREINCREMENT_EXPR
:
14098 case POSTDECREMENT_EXPR
:
14099 case POSTINCREMENT_EXPR
:
14101 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14102 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14103 return build_nt (code
, op0
, op1
);
14108 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14109 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14110 return build_qualified_name (/*type=*/NULL_TREE
, op0
, op1
,
14111 QUALIFIED_NAME_IS_TEMPLATE (t
));
14116 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14117 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14118 return build_nt (ARRAY_REF
, op0
, op1
, NULL_TREE
, NULL_TREE
);
14123 int n
= VL_EXP_OPERAND_LENGTH (t
);
14124 tree result
= build_vl_exp (CALL_EXPR
, n
);
14126 for (i
= 0; i
< n
; i
++)
14127 TREE_OPERAND (t
, i
) = tsubst_copy (TREE_OPERAND (t
, i
), args
,
14128 complain
, in_decl
);
14134 case PSEUDO_DTOR_EXPR
:
14135 case VEC_PERM_EXPR
:
14137 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14138 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14139 tree op2
= tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
14140 r
= build_nt (code
, op0
, op1
, op2
);
14141 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
14147 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14148 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14149 tree op2
= tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
14150 r
= build_nt (code
, op0
, op1
, op2
);
14151 NEW_EXPR_USE_GLOBAL (r
) = NEW_EXPR_USE_GLOBAL (t
);
14157 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14158 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14159 r
= build_nt (code
, op0
, op1
);
14160 DELETE_EXPR_USE_GLOBAL (r
) = DELETE_EXPR_USE_GLOBAL (t
);
14161 DELETE_EXPR_USE_VEC (r
) = DELETE_EXPR_USE_VEC (t
);
14165 case TEMPLATE_ID_EXPR
:
14167 /* Substituted template arguments */
14168 tree fn
= TREE_OPERAND (t
, 0);
14169 tree targs
= TREE_OPERAND (t
, 1);
14171 fn
= tsubst_copy (fn
, args
, complain
, in_decl
);
14173 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
14175 return lookup_template_function (fn
, targs
);
14180 tree purpose
, value
, chain
;
14182 if (t
== void_list_node
)
14185 purpose
= TREE_PURPOSE (t
);
14187 purpose
= tsubst_copy (purpose
, args
, complain
, in_decl
);
14188 value
= TREE_VALUE (t
);
14190 value
= tsubst_copy (value
, args
, complain
, in_decl
);
14191 chain
= TREE_CHAIN (t
);
14192 if (chain
&& chain
!= void_type_node
)
14193 chain
= tsubst_copy (chain
, args
, complain
, in_decl
);
14194 if (purpose
== TREE_PURPOSE (t
)
14195 && value
== TREE_VALUE (t
)
14196 && chain
== TREE_CHAIN (t
))
14198 return tree_cons (purpose
, value
, chain
);
14203 case ENUMERAL_TYPE
:
14205 case TEMPLATE_TYPE_PARM
:
14206 case TEMPLATE_TEMPLATE_PARM
:
14207 case BOUND_TEMPLATE_TEMPLATE_PARM
:
14208 case TEMPLATE_PARM_INDEX
:
14210 case REFERENCE_TYPE
:
14212 case FUNCTION_TYPE
:
14215 case TYPENAME_TYPE
:
14216 case UNBOUND_CLASS_TEMPLATE
:
14218 case DECLTYPE_TYPE
:
14220 return tsubst (t
, args
, complain
, in_decl
);
14224 /* Fall through. */
14225 case IDENTIFIER_NODE
:
14226 if (IDENTIFIER_TYPENAME_P (t
))
14228 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14229 return mangle_conv_op_name_for_type (new_type
);
14235 /* This is handled by tsubst_copy_and_build. */
14236 gcc_unreachable ();
14240 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14241 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14242 return build_x_va_arg (EXPR_LOCATION (t
), op0
, type
);
14245 case CLEANUP_POINT_EXPR
:
14246 /* We shouldn't have built any of these during initial template
14247 generation. Instead, they should be built during instantiation
14248 in response to the saved STMT_IS_FULL_EXPR_P setting. */
14249 gcc_unreachable ();
14253 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14254 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14255 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14256 r
= build2 (code
, type
, op0
, op1
);
14257 PTRMEM_OK_P (r
) = PTRMEM_OK_P (t
);
14258 if (!mark_used (TREE_OPERAND (r
, 1), complain
)
14259 && !(complain
& tf_error
))
14260 return error_mark_node
;
14264 case EXPR_PACK_EXPANSION
:
14265 error ("invalid use of pack expansion expression");
14266 return error_mark_node
;
14268 case NONTYPE_ARGUMENT_PACK
:
14269 error ("use %<...%> to expand argument pack");
14270 return error_mark_node
;
14273 gcc_checking_assert (t
== void_node
&& VOID_TYPE_P (TREE_TYPE (t
)));
14281 /* Instantiate any typedefs in the type. */
14282 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14283 r
= fold_convert (type
, t
);
14284 gcc_assert (TREE_CODE (r
) == code
);
14289 /* These can sometimes show up in a partial instantiation, but never
14290 involve template parms. */
14291 gcc_assert (!uses_template_parms (t
));
14294 case UNARY_LEFT_FOLD_EXPR
:
14295 return tsubst_unary_left_fold (t
, args
, complain
, in_decl
);
14296 case UNARY_RIGHT_FOLD_EXPR
:
14297 return tsubst_unary_right_fold (t
, args
, complain
, in_decl
);
14298 case BINARY_LEFT_FOLD_EXPR
:
14299 return tsubst_binary_left_fold (t
, args
, complain
, in_decl
);
14300 case BINARY_RIGHT_FOLD_EXPR
:
14301 return tsubst_binary_right_fold (t
, args
, complain
, in_decl
);
14304 /* We shouldn't get here, but keep going if !flag_checking. */
14306 gcc_unreachable ();
14311 /* Helper function for tsubst_omp_clauses, used for instantiation of
14312 OMP_CLAUSE_DECL of clauses. */
14315 tsubst_omp_clause_decl (tree decl
, tree args
, tsubst_flags_t complain
,
14318 if (decl
== NULL_TREE
)
14321 /* Handle an OpenMP array section represented as a TREE_LIST (or
14322 OMP_CLAUSE_DEPEND_KIND). An OMP_CLAUSE_DEPEND (with a depend
14323 kind of OMP_CLAUSE_DEPEND_SINK) can also be represented as a
14324 TREE_LIST. We can handle it exactly the same as an array section
14325 (purpose, value, and a chain), even though the nomenclature
14326 (low_bound, length, etc) is different. */
14327 if (TREE_CODE (decl
) == TREE_LIST
)
14330 = tsubst_expr (TREE_PURPOSE (decl
), args
, complain
, in_decl
,
14331 /*integral_constant_expression_p=*/false);
14332 tree length
= tsubst_expr (TREE_VALUE (decl
), args
, complain
, in_decl
,
14333 /*integral_constant_expression_p=*/false);
14334 tree chain
= tsubst_omp_clause_decl (TREE_CHAIN (decl
), args
, complain
,
14336 if (TREE_PURPOSE (decl
) == low_bound
14337 && TREE_VALUE (decl
) == length
14338 && TREE_CHAIN (decl
) == chain
)
14340 tree ret
= tree_cons (low_bound
, length
, chain
);
14341 OMP_CLAUSE_DEPEND_SINK_NEGATIVE (ret
)
14342 = OMP_CLAUSE_DEPEND_SINK_NEGATIVE (decl
);
14345 tree ret
= tsubst_expr (decl
, args
, complain
, in_decl
,
14346 /*integral_constant_expression_p=*/false);
14347 /* Undo convert_from_reference tsubst_expr could have called. */
14349 && REFERENCE_REF_P (ret
)
14350 && !REFERENCE_REF_P (decl
))
14351 ret
= TREE_OPERAND (ret
, 0);
14355 /* Like tsubst_copy, but specifically for OpenMP clauses. */
14358 tsubst_omp_clauses (tree clauses
, bool declare_simd
, bool allow_fields
,
14359 tree args
, tsubst_flags_t complain
, tree in_decl
)
14361 tree new_clauses
= NULL_TREE
, nc
, oc
;
14362 tree linear_no_step
= NULL_TREE
;
14364 for (oc
= clauses
; oc
; oc
= OMP_CLAUSE_CHAIN (oc
))
14366 nc
= copy_node (oc
);
14367 OMP_CLAUSE_CHAIN (nc
) = new_clauses
;
14370 switch (OMP_CLAUSE_CODE (nc
))
14372 case OMP_CLAUSE_LASTPRIVATE
:
14373 if (OMP_CLAUSE_LASTPRIVATE_STMT (oc
))
14375 OMP_CLAUSE_LASTPRIVATE_STMT (nc
) = push_stmt_list ();
14376 tsubst_expr (OMP_CLAUSE_LASTPRIVATE_STMT (oc
), args
, complain
,
14377 in_decl
, /*integral_constant_expression_p=*/false);
14378 OMP_CLAUSE_LASTPRIVATE_STMT (nc
)
14379 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (nc
));
14382 case OMP_CLAUSE_PRIVATE
:
14383 case OMP_CLAUSE_SHARED
:
14384 case OMP_CLAUSE_FIRSTPRIVATE
:
14385 case OMP_CLAUSE_COPYIN
:
14386 case OMP_CLAUSE_COPYPRIVATE
:
14387 case OMP_CLAUSE_UNIFORM
:
14388 case OMP_CLAUSE_DEPEND
:
14389 case OMP_CLAUSE_FROM
:
14390 case OMP_CLAUSE_TO
:
14391 case OMP_CLAUSE_MAP
:
14392 case OMP_CLAUSE_USE_DEVICE
:
14393 case OMP_CLAUSE_USE_DEVICE_PTR
:
14394 case OMP_CLAUSE_IS_DEVICE_PTR
:
14395 OMP_CLAUSE_DECL (nc
)
14396 = tsubst_omp_clause_decl (OMP_CLAUSE_DECL (oc
), args
, complain
,
14399 case OMP_CLAUSE_IF
:
14400 case OMP_CLAUSE_NUM_THREADS
:
14401 case OMP_CLAUSE_SCHEDULE
:
14402 case OMP_CLAUSE_COLLAPSE
:
14403 case OMP_CLAUSE_FINAL
:
14404 case OMP_CLAUSE_DEVICE
:
14405 case OMP_CLAUSE_DIST_SCHEDULE
:
14406 case OMP_CLAUSE_NUM_TEAMS
:
14407 case OMP_CLAUSE_THREAD_LIMIT
:
14408 case OMP_CLAUSE_SAFELEN
:
14409 case OMP_CLAUSE_SIMDLEN
:
14410 case OMP_CLAUSE_NUM_TASKS
:
14411 case OMP_CLAUSE_GRAINSIZE
:
14412 case OMP_CLAUSE_PRIORITY
:
14413 case OMP_CLAUSE_ORDERED
:
14414 case OMP_CLAUSE_HINT
:
14415 case OMP_CLAUSE_NUM_GANGS
:
14416 case OMP_CLAUSE_NUM_WORKERS
:
14417 case OMP_CLAUSE_VECTOR_LENGTH
:
14418 case OMP_CLAUSE_WORKER
:
14419 case OMP_CLAUSE_VECTOR
:
14420 case OMP_CLAUSE_ASYNC
:
14421 case OMP_CLAUSE_WAIT
:
14422 OMP_CLAUSE_OPERAND (nc
, 0)
14423 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 0), args
, complain
,
14424 in_decl
, /*integral_constant_expression_p=*/false);
14426 case OMP_CLAUSE_REDUCTION
:
14427 if (OMP_CLAUSE_REDUCTION_PLACEHOLDER (oc
))
14429 tree placeholder
= OMP_CLAUSE_REDUCTION_PLACEHOLDER (oc
);
14430 if (TREE_CODE (placeholder
) == SCOPE_REF
)
14432 tree scope
= tsubst (TREE_OPERAND (placeholder
, 0), args
,
14433 complain
, in_decl
);
14434 OMP_CLAUSE_REDUCTION_PLACEHOLDER (nc
)
14435 = build_qualified_name (NULL_TREE
, scope
,
14436 TREE_OPERAND (placeholder
, 1),
14440 gcc_assert (identifier_p (placeholder
));
14442 OMP_CLAUSE_DECL (nc
)
14443 = tsubst_omp_clause_decl (OMP_CLAUSE_DECL (oc
), args
, complain
,
14446 case OMP_CLAUSE_GANG
:
14447 case OMP_CLAUSE_ALIGNED
:
14448 OMP_CLAUSE_DECL (nc
)
14449 = tsubst_omp_clause_decl (OMP_CLAUSE_DECL (oc
), args
, complain
,
14451 OMP_CLAUSE_OPERAND (nc
, 1)
14452 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 1), args
, complain
,
14453 in_decl
, /*integral_constant_expression_p=*/false);
14455 case OMP_CLAUSE_LINEAR
:
14456 OMP_CLAUSE_DECL (nc
)
14457 = tsubst_omp_clause_decl (OMP_CLAUSE_DECL (oc
), args
, complain
,
14459 if (OMP_CLAUSE_LINEAR_STEP (oc
) == NULL_TREE
)
14461 gcc_assert (!linear_no_step
);
14462 linear_no_step
= nc
;
14464 else if (OMP_CLAUSE_LINEAR_VARIABLE_STRIDE (oc
))
14465 OMP_CLAUSE_LINEAR_STEP (nc
)
14466 = tsubst_omp_clause_decl (OMP_CLAUSE_LINEAR_STEP (oc
), args
,
14467 complain
, in_decl
);
14469 OMP_CLAUSE_LINEAR_STEP (nc
)
14470 = tsubst_expr (OMP_CLAUSE_LINEAR_STEP (oc
), args
, complain
,
14472 /*integral_constant_expression_p=*/false);
14474 case OMP_CLAUSE_NOWAIT
:
14475 case OMP_CLAUSE_DEFAULT
:
14476 case OMP_CLAUSE_UNTIED
:
14477 case OMP_CLAUSE_MERGEABLE
:
14478 case OMP_CLAUSE_INBRANCH
:
14479 case OMP_CLAUSE_NOTINBRANCH
:
14480 case OMP_CLAUSE_PROC_BIND
:
14481 case OMP_CLAUSE_FOR
:
14482 case OMP_CLAUSE_PARALLEL
:
14483 case OMP_CLAUSE_SECTIONS
:
14484 case OMP_CLAUSE_TASKGROUP
:
14485 case OMP_CLAUSE_NOGROUP
:
14486 case OMP_CLAUSE_THREADS
:
14487 case OMP_CLAUSE_SIMD
:
14488 case OMP_CLAUSE_DEFAULTMAP
:
14489 case OMP_CLAUSE_INDEPENDENT
:
14490 case OMP_CLAUSE_AUTO
:
14491 case OMP_CLAUSE_SEQ
:
14493 case OMP_CLAUSE_TILE
:
14496 for (lnc
= OMP_CLAUSE_TILE_LIST (nc
),
14497 loc
= OMP_CLAUSE_TILE_LIST (oc
);
14499 loc
= TREE_CHAIN (loc
), lnc
= TREE_CHAIN (lnc
))
14501 TREE_VALUE (lnc
) = tsubst_expr (TREE_VALUE (loc
), args
,
14502 complain
, in_decl
, false);
14507 gcc_unreachable ();
14510 switch (OMP_CLAUSE_CODE (nc
))
14512 case OMP_CLAUSE_SHARED
:
14513 case OMP_CLAUSE_PRIVATE
:
14514 case OMP_CLAUSE_FIRSTPRIVATE
:
14515 case OMP_CLAUSE_LASTPRIVATE
:
14516 case OMP_CLAUSE_COPYPRIVATE
:
14517 case OMP_CLAUSE_LINEAR
:
14518 case OMP_CLAUSE_REDUCTION
:
14519 case OMP_CLAUSE_USE_DEVICE
:
14520 case OMP_CLAUSE_USE_DEVICE_PTR
:
14521 case OMP_CLAUSE_IS_DEVICE_PTR
:
14522 /* tsubst_expr on SCOPE_REF results in returning
14523 finish_non_static_data_member result. Undo that here. */
14524 if (TREE_CODE (OMP_CLAUSE_DECL (oc
)) == SCOPE_REF
14525 && (TREE_CODE (TREE_OPERAND (OMP_CLAUSE_DECL (oc
), 1))
14526 == IDENTIFIER_NODE
))
14528 tree t
= OMP_CLAUSE_DECL (nc
);
14531 switch (TREE_CODE (v
))
14533 case COMPONENT_REF
:
14537 case POINTER_PLUS_EXPR
:
14538 v
= TREE_OPERAND (v
, 0);
14541 if (DECL_CONTEXT (v
) == current_function_decl
14542 && DECL_ARTIFICIAL (v
)
14543 && DECL_NAME (v
) == this_identifier
)
14544 OMP_CLAUSE_DECL (nc
) = TREE_OPERAND (t
, 1);
14551 else if (VAR_P (OMP_CLAUSE_DECL (oc
))
14552 && DECL_HAS_VALUE_EXPR_P (OMP_CLAUSE_DECL (oc
))
14553 && DECL_ARTIFICIAL (OMP_CLAUSE_DECL (oc
))
14554 && DECL_LANG_SPECIFIC (OMP_CLAUSE_DECL (oc
))
14555 && DECL_OMP_PRIVATIZED_MEMBER (OMP_CLAUSE_DECL (oc
)))
14557 tree decl
= OMP_CLAUSE_DECL (nc
);
14560 if (!DECL_LANG_SPECIFIC (decl
))
14561 retrofit_lang_decl (decl
);
14562 DECL_OMP_PRIVATIZED_MEMBER (decl
) = 1;
14571 new_clauses
= nreverse (new_clauses
);
14574 new_clauses
= finish_omp_clauses (new_clauses
, allow_fields
);
14575 if (linear_no_step
)
14576 for (nc
= new_clauses
; nc
; nc
= OMP_CLAUSE_CHAIN (nc
))
14577 if (nc
== linear_no_step
)
14579 OMP_CLAUSE_LINEAR_STEP (nc
) = NULL_TREE
;
14583 return new_clauses
;
14586 /* Like tsubst_copy_and_build, but unshare TREE_LIST nodes. */
14589 tsubst_copy_asm_operands (tree t
, tree args
, tsubst_flags_t complain
,
14592 #define RECUR(t) tsubst_copy_asm_operands (t, args, complain, in_decl)
14594 tree purpose
, value
, chain
;
14599 if (TREE_CODE (t
) != TREE_LIST
)
14600 return tsubst_copy_and_build (t
, args
, complain
, in_decl
,
14601 /*function_p=*/false,
14602 /*integral_constant_expression_p=*/false);
14604 if (t
== void_list_node
)
14607 purpose
= TREE_PURPOSE (t
);
14609 purpose
= RECUR (purpose
);
14610 value
= TREE_VALUE (t
);
14613 if (TREE_CODE (value
) != LABEL_DECL
)
14614 value
= RECUR (value
);
14617 value
= lookup_label (DECL_NAME (value
));
14618 gcc_assert (TREE_CODE (value
) == LABEL_DECL
);
14619 TREE_USED (value
) = 1;
14622 chain
= TREE_CHAIN (t
);
14623 if (chain
&& chain
!= void_type_node
)
14624 chain
= RECUR (chain
);
14625 return tree_cons (purpose
, value
, chain
);
14629 /* Used to temporarily communicate the list of #pragma omp parallel
14630 clauses to #pragma omp for instantiation if they are combined
14633 static tree
*omp_parallel_combined_clauses
;
14635 /* Substitute one OMP_FOR iterator. */
14638 tsubst_omp_for_iterator (tree t
, int i
, tree declv
, tree orig_declv
,
14639 tree initv
, tree condv
, tree incrv
, tree
*clauses
,
14640 tree args
, tsubst_flags_t complain
, tree in_decl
,
14641 bool integral_constant_expression_p
)
14643 #define RECUR(NODE) \
14644 tsubst_expr ((NODE), args, complain, in_decl, \
14645 integral_constant_expression_p)
14646 tree decl
, init
, cond
, incr
;
14648 init
= TREE_VEC_ELT (OMP_FOR_INIT (t
), i
);
14649 gcc_assert (TREE_CODE (init
) == MODIFY_EXPR
);
14651 if (orig_declv
&& OMP_FOR_ORIG_DECLS (t
))
14653 tree o
= TREE_VEC_ELT (OMP_FOR_ORIG_DECLS (t
), i
);
14654 TREE_VEC_ELT (orig_declv
, i
) = RECUR (o
);
14657 decl
= TREE_OPERAND (init
, 0);
14658 init
= TREE_OPERAND (init
, 1);
14659 tree decl_expr
= NULL_TREE
;
14660 if (init
&& TREE_CODE (init
) == DECL_EXPR
)
14662 /* We need to jump through some hoops to handle declarations in the
14663 for-init-statement, since we might need to handle auto deduction,
14664 but we need to keep control of initialization. */
14666 init
= DECL_INITIAL (DECL_EXPR_DECL (init
));
14667 decl
= tsubst_decl (decl
, args
, complain
);
14671 if (TREE_CODE (decl
) == SCOPE_REF
)
14673 decl
= RECUR (decl
);
14674 if (TREE_CODE (decl
) == COMPONENT_REF
)
14678 switch (TREE_CODE (v
))
14680 case COMPONENT_REF
:
14684 case POINTER_PLUS_EXPR
:
14685 v
= TREE_OPERAND (v
, 0);
14688 if (DECL_CONTEXT (v
) == current_function_decl
14689 && DECL_ARTIFICIAL (v
)
14690 && DECL_NAME (v
) == this_identifier
)
14692 decl
= TREE_OPERAND (decl
, 1);
14693 decl
= omp_privatize_field (decl
, false);
14703 decl
= RECUR (decl
);
14705 init
= RECUR (init
);
14707 tree auto_node
= type_uses_auto (TREE_TYPE (decl
));
14708 if (auto_node
&& init
)
14710 = do_auto_deduction (TREE_TYPE (decl
), init
, auto_node
);
14712 gcc_assert (!type_dependent_expression_p (decl
));
14714 if (!CLASS_TYPE_P (TREE_TYPE (decl
)))
14718 /* Declare the variable, but don't let that initialize it. */
14719 tree init_sav
= DECL_INITIAL (DECL_EXPR_DECL (decl_expr
));
14720 DECL_INITIAL (DECL_EXPR_DECL (decl_expr
)) = NULL_TREE
;
14722 DECL_INITIAL (DECL_EXPR_DECL (decl_expr
)) = init_sav
;
14725 cond
= RECUR (TREE_VEC_ELT (OMP_FOR_COND (t
), i
));
14726 incr
= TREE_VEC_ELT (OMP_FOR_INCR (t
), i
);
14727 if (TREE_CODE (incr
) == MODIFY_EXPR
)
14729 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
14730 tree rhs
= RECUR (TREE_OPERAND (incr
, 1));
14731 incr
= build_x_modify_expr (EXPR_LOCATION (incr
), lhs
,
14732 NOP_EXPR
, rhs
, complain
);
14735 incr
= RECUR (incr
);
14736 TREE_VEC_ELT (declv
, i
) = decl
;
14737 TREE_VEC_ELT (initv
, i
) = init
;
14738 TREE_VEC_ELT (condv
, i
) = cond
;
14739 TREE_VEC_ELT (incrv
, i
) = incr
;
14745 /* Declare and initialize the variable. */
14753 for (j
= (omp_parallel_combined_clauses
== NULL
? 1 : 0); j
< 2; j
++)
14755 for (pc
= j
? clauses
: omp_parallel_combined_clauses
; *pc
; )
14757 if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_PRIVATE
14758 && OMP_CLAUSE_DECL (*pc
) == decl
)
14760 else if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_LASTPRIVATE
14761 && OMP_CLAUSE_DECL (*pc
) == decl
)
14765 /* Move lastprivate (decl) clause to OMP_FOR_CLAUSES. */
14767 *pc
= OMP_CLAUSE_CHAIN (c
);
14768 OMP_CLAUSE_CHAIN (c
) = *clauses
;
14771 else if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_FIRSTPRIVATE
14772 && OMP_CLAUSE_DECL (*pc
) == decl
)
14774 error ("iteration variable %qD should not be firstprivate",
14776 *pc
= OMP_CLAUSE_CHAIN (*pc
);
14778 else if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_REDUCTION
14779 && OMP_CLAUSE_DECL (*pc
) == decl
)
14781 error ("iteration variable %qD should not be reduction",
14783 *pc
= OMP_CLAUSE_CHAIN (*pc
);
14786 pc
= &OMP_CLAUSE_CHAIN (*pc
);
14791 if (*pc
== NULL_TREE
)
14793 tree c
= build_omp_clause (input_location
, OMP_CLAUSE_PRIVATE
);
14794 OMP_CLAUSE_DECL (c
) = decl
;
14795 c
= finish_omp_clauses (c
, true);
14798 OMP_CLAUSE_CHAIN (c
) = *clauses
;
14803 cond
= TREE_VEC_ELT (OMP_FOR_COND (t
), i
);
14804 if (COMPARISON_CLASS_P (cond
))
14806 tree op0
= RECUR (TREE_OPERAND (cond
, 0));
14807 tree op1
= RECUR (TREE_OPERAND (cond
, 1));
14808 cond
= build2 (TREE_CODE (cond
), boolean_type_node
, op0
, op1
);
14811 cond
= RECUR (cond
);
14812 incr
= TREE_VEC_ELT (OMP_FOR_INCR (t
), i
);
14813 switch (TREE_CODE (incr
))
14815 case PREINCREMENT_EXPR
:
14816 case PREDECREMENT_EXPR
:
14817 case POSTINCREMENT_EXPR
:
14818 case POSTDECREMENT_EXPR
:
14819 incr
= build2 (TREE_CODE (incr
), TREE_TYPE (decl
),
14820 RECUR (TREE_OPERAND (incr
, 0)), NULL_TREE
);
14823 if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
14824 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
14826 tree rhs
= TREE_OPERAND (incr
, 1);
14827 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
14828 tree rhs0
= RECUR (TREE_OPERAND (rhs
, 0));
14829 tree rhs1
= RECUR (TREE_OPERAND (rhs
, 1));
14830 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
14831 build2 (TREE_CODE (rhs
), TREE_TYPE (decl
),
14835 incr
= RECUR (incr
);
14838 if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
14839 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
14841 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
14842 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
14843 build2 (TREE_CODE (TREE_OPERAND (incr
, 1)),
14844 TREE_TYPE (decl
), lhs
,
14845 RECUR (TREE_OPERAND (incr
, 2))));
14847 else if (TREE_CODE (TREE_OPERAND (incr
, 1)) == NOP_EXPR
14848 && (TREE_CODE (TREE_OPERAND (incr
, 2)) == PLUS_EXPR
14849 || (TREE_CODE (TREE_OPERAND (incr
, 2)) == MINUS_EXPR
)))
14851 tree rhs
= TREE_OPERAND (incr
, 2);
14852 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
14853 tree rhs0
= RECUR (TREE_OPERAND (rhs
, 0));
14854 tree rhs1
= RECUR (TREE_OPERAND (rhs
, 1));
14855 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
14856 build2 (TREE_CODE (rhs
), TREE_TYPE (decl
),
14860 incr
= RECUR (incr
);
14863 incr
= RECUR (incr
);
14867 TREE_VEC_ELT (declv
, i
) = decl
;
14868 TREE_VEC_ELT (initv
, i
) = init
;
14869 TREE_VEC_ELT (condv
, i
) = cond
;
14870 TREE_VEC_ELT (incrv
, i
) = incr
;
14874 /* Helper function of tsubst_expr, find OMP_TEAMS inside
14875 of OMP_TARGET's body. */
14878 tsubst_find_omp_teams (tree
*tp
, int *walk_subtrees
, void *)
14880 *walk_subtrees
= 0;
14881 switch (TREE_CODE (*tp
))
14886 case STATEMENT_LIST
:
14887 *walk_subtrees
= 1;
14895 /* Like tsubst_copy for expressions, etc. but also does semantic
14899 tsubst_expr (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
,
14900 bool integral_constant_expression_p
)
14902 #define RETURN(EXP) do { r = (EXP); goto out; } while(0)
14903 #define RECUR(NODE) \
14904 tsubst_expr ((NODE), args, complain, in_decl, \
14905 integral_constant_expression_p)
14911 if (t
== NULL_TREE
|| t
== error_mark_node
)
14914 loc
= input_location
;
14915 if (EXPR_HAS_LOCATION (t
))
14916 input_location
= EXPR_LOCATION (t
);
14917 if (STATEMENT_CODE_P (TREE_CODE (t
)))
14918 current_stmt_tree ()->stmts_are_full_exprs_p
= STMT_IS_FULL_EXPR_P (t
);
14920 switch (TREE_CODE (t
))
14922 case STATEMENT_LIST
:
14924 tree_stmt_iterator i
;
14925 for (i
= tsi_start (t
); !tsi_end_p (i
); tsi_next (&i
))
14926 RECUR (tsi_stmt (i
));
14930 case CTOR_INITIALIZER
:
14931 finish_mem_initializers (tsubst_initializer_list
14932 (TREE_OPERAND (t
, 0), args
));
14936 finish_return_stmt (RECUR (TREE_OPERAND (t
, 0)));
14940 tmp
= RECUR (EXPR_STMT_EXPR (t
));
14941 if (EXPR_STMT_STMT_EXPR_RESULT (t
))
14942 finish_stmt_expr_expr (tmp
, cur_stmt_expr
);
14944 finish_expr_stmt (tmp
);
14948 do_using_directive (USING_STMT_NAMESPACE (t
));
14953 tree decl
, pattern_decl
;
14956 pattern_decl
= decl
= DECL_EXPR_DECL (t
);
14957 if (TREE_CODE (decl
) == LABEL_DECL
)
14958 finish_label_decl (DECL_NAME (decl
));
14959 else if (TREE_CODE (decl
) == USING_DECL
)
14961 tree scope
= USING_DECL_SCOPE (decl
);
14962 tree name
= DECL_NAME (decl
);
14965 scope
= tsubst (scope
, args
, complain
, in_decl
);
14966 decl
= lookup_qualified_name (scope
, name
,
14967 /*is_type_p=*/false,
14968 /*complain=*/false);
14969 if (decl
== error_mark_node
|| TREE_CODE (decl
) == TREE_LIST
)
14970 qualified_name_lookup_error (scope
, name
, decl
, input_location
);
14972 do_local_using_decl (decl
, scope
, name
);
14974 else if (DECL_PACK_P (decl
))
14976 /* Don't build up decls for a variadic capture proxy, we'll
14977 instantiate the elements directly as needed. */
14982 init
= DECL_INITIAL (decl
);
14983 decl
= tsubst (decl
, args
, complain
, in_decl
);
14984 if (decl
!= error_mark_node
)
14986 /* By marking the declaration as instantiated, we avoid
14987 trying to instantiate it. Since instantiate_decl can't
14988 handle local variables, and since we've already done
14989 all that needs to be done, that's the right thing to
14992 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
14994 && ANON_AGGR_TYPE_P (TREE_TYPE (decl
)))
14995 /* Anonymous aggregates are a special case. */
14996 finish_anon_union (decl
);
14997 else if (is_capture_proxy (DECL_EXPR_DECL (t
)))
14999 DECL_CONTEXT (decl
) = current_function_decl
;
15000 if (DECL_NAME (decl
) == this_identifier
)
15002 tree lam
= DECL_CONTEXT (current_function_decl
);
15003 lam
= CLASSTYPE_LAMBDA_EXPR (lam
);
15004 LAMBDA_EXPR_THIS_CAPTURE (lam
) = decl
;
15006 insert_capture_proxy (decl
);
15008 else if (DECL_IMPLICIT_TYPEDEF_P (t
))
15009 /* We already did a pushtag. */;
15010 else if (TREE_CODE (decl
) == FUNCTION_DECL
15011 && DECL_OMP_DECLARE_REDUCTION_P (decl
)
15012 && DECL_FUNCTION_SCOPE_P (pattern_decl
))
15014 DECL_CONTEXT (decl
) = NULL_TREE
;
15016 DECL_CONTEXT (decl
) = current_function_decl
;
15017 cp_check_omp_declare_reduction (decl
);
15021 int const_init
= false;
15022 maybe_push_decl (decl
);
15024 && DECL_PRETTY_FUNCTION_P (decl
))
15026 /* For __PRETTY_FUNCTION__ we have to adjust the
15028 const char *const name
15029 = cxx_printable_name (current_function_decl
, 2);
15030 init
= cp_fname_init (name
, &TREE_TYPE (decl
));
15033 init
= tsubst_init (init
, decl
, args
, complain
, in_decl
);
15036 const_init
= (DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P
15038 cp_finish_decl (decl
, init
, const_init
, NULL_TREE
, 0);
15047 stmt
= begin_for_stmt (NULL_TREE
, NULL_TREE
);
15048 RECUR (FOR_INIT_STMT (t
));
15049 finish_for_init_stmt (stmt
);
15050 tmp
= RECUR (FOR_COND (t
));
15051 finish_for_cond (tmp
, stmt
, false);
15052 tmp
= RECUR (FOR_EXPR (t
));
15053 finish_for_expr (tmp
, stmt
);
15054 RECUR (FOR_BODY (t
));
15055 finish_for_stmt (stmt
);
15058 case RANGE_FOR_STMT
:
15061 stmt
= begin_for_stmt (NULL_TREE
, NULL_TREE
);
15062 decl
= RANGE_FOR_DECL (t
);
15063 decl
= tsubst (decl
, args
, complain
, in_decl
);
15064 maybe_push_decl (decl
);
15065 expr
= RECUR (RANGE_FOR_EXPR (t
));
15066 stmt
= cp_convert_range_for (stmt
, decl
, expr
, RANGE_FOR_IVDEP (t
));
15067 RECUR (RANGE_FOR_BODY (t
));
15068 finish_for_stmt (stmt
);
15073 stmt
= begin_while_stmt ();
15074 tmp
= RECUR (WHILE_COND (t
));
15075 finish_while_stmt_cond (tmp
, stmt
, false);
15076 RECUR (WHILE_BODY (t
));
15077 finish_while_stmt (stmt
);
15081 stmt
= begin_do_stmt ();
15082 RECUR (DO_BODY (t
));
15083 finish_do_body (stmt
);
15084 tmp
= RECUR (DO_COND (t
));
15085 finish_do_stmt (tmp
, stmt
, false);
15089 stmt
= begin_if_stmt ();
15090 tmp
= RECUR (IF_COND (t
));
15091 finish_if_stmt_cond (tmp
, stmt
);
15092 RECUR (THEN_CLAUSE (t
));
15093 finish_then_clause (stmt
);
15095 if (ELSE_CLAUSE (t
))
15097 begin_else_clause (stmt
);
15098 RECUR (ELSE_CLAUSE (t
));
15099 finish_else_clause (stmt
);
15102 finish_if_stmt (stmt
);
15106 if (BIND_EXPR_BODY_BLOCK (t
))
15107 stmt
= begin_function_body ();
15109 stmt
= begin_compound_stmt (BIND_EXPR_TRY_BLOCK (t
)
15110 ? BCS_TRY_BLOCK
: 0);
15112 RECUR (BIND_EXPR_BODY (t
));
15114 if (BIND_EXPR_BODY_BLOCK (t
))
15115 finish_function_body (stmt
);
15117 finish_compound_stmt (stmt
);
15121 finish_break_stmt ();
15124 case CONTINUE_STMT
:
15125 finish_continue_stmt ();
15129 stmt
= begin_switch_stmt ();
15130 tmp
= RECUR (SWITCH_STMT_COND (t
));
15131 finish_switch_cond (tmp
, stmt
);
15132 RECUR (SWITCH_STMT_BODY (t
));
15133 finish_switch_stmt (stmt
);
15136 case CASE_LABEL_EXPR
:
15138 tree low
= RECUR (CASE_LOW (t
));
15139 tree high
= RECUR (CASE_HIGH (t
));
15140 finish_case_label (EXPR_LOCATION (t
), low
, high
);
15146 tree decl
= LABEL_EXPR_LABEL (t
);
15149 label
= finish_label_stmt (DECL_NAME (decl
));
15150 if (DECL_ATTRIBUTES (decl
) != NULL_TREE
)
15151 cplus_decl_attributes (&label
, DECL_ATTRIBUTES (decl
), 0);
15156 tmp
= GOTO_DESTINATION (t
);
15157 if (TREE_CODE (tmp
) != LABEL_DECL
)
15158 /* Computed goto's must be tsubst'd into. On the other hand,
15159 non-computed gotos must not be; the identifier in question
15160 will have no binding. */
15163 tmp
= DECL_NAME (tmp
);
15164 finish_goto_stmt (tmp
);
15169 tree string
= RECUR (ASM_STRING (t
));
15170 tree outputs
= tsubst_copy_asm_operands (ASM_OUTPUTS (t
), args
,
15171 complain
, in_decl
);
15172 tree inputs
= tsubst_copy_asm_operands (ASM_INPUTS (t
), args
,
15173 complain
, in_decl
);
15174 tree clobbers
= tsubst_copy_asm_operands (ASM_CLOBBERS (t
), args
,
15175 complain
, in_decl
);
15176 tree labels
= tsubst_copy_asm_operands (ASM_LABELS (t
), args
,
15177 complain
, in_decl
);
15178 tmp
= finish_asm_stmt (ASM_VOLATILE_P (t
), string
, outputs
, inputs
,
15180 tree asm_expr
= tmp
;
15181 if (TREE_CODE (asm_expr
) == CLEANUP_POINT_EXPR
)
15182 asm_expr
= TREE_OPERAND (asm_expr
, 0);
15183 ASM_INPUT_P (asm_expr
) = ASM_INPUT_P (t
);
15190 stmt
= begin_try_block ();
15191 RECUR (TRY_STMTS (t
));
15192 finish_cleanup_try_block (stmt
);
15193 finish_cleanup (RECUR (TRY_HANDLERS (t
)), stmt
);
15197 tree compound_stmt
= NULL_TREE
;
15199 if (FN_TRY_BLOCK_P (t
))
15200 stmt
= begin_function_try_block (&compound_stmt
);
15202 stmt
= begin_try_block ();
15204 RECUR (TRY_STMTS (t
));
15206 if (FN_TRY_BLOCK_P (t
))
15207 finish_function_try_block (stmt
);
15209 finish_try_block (stmt
);
15211 RECUR (TRY_HANDLERS (t
));
15212 if (FN_TRY_BLOCK_P (t
))
15213 finish_function_handler_sequence (stmt
, compound_stmt
);
15215 finish_handler_sequence (stmt
);
15221 tree decl
= HANDLER_PARMS (t
);
15225 decl
= tsubst (decl
, args
, complain
, in_decl
);
15226 /* Prevent instantiate_decl from trying to instantiate
15227 this variable. We've already done all that needs to be
15229 if (decl
!= error_mark_node
)
15230 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
15232 stmt
= begin_handler ();
15233 finish_handler_parms (decl
, stmt
);
15234 RECUR (HANDLER_BODY (t
));
15235 finish_handler (stmt
);
15240 tmp
= tsubst (TREE_TYPE (t
), args
, complain
, NULL_TREE
);
15241 if (CLASS_TYPE_P (tmp
))
15243 /* Local classes are not independent templates; they are
15244 instantiated along with their containing function. And this
15245 way we don't have to deal with pushing out of one local class
15246 to instantiate a member of another local class. */
15248 /* Closures are handled by the LAMBDA_EXPR. */
15249 gcc_assert (!LAMBDA_TYPE_P (TREE_TYPE (t
)));
15250 complete_type (tmp
);
15251 for (fn
= TYPE_METHODS (tmp
); fn
; fn
= DECL_CHAIN (fn
))
15252 if (!DECL_ARTIFICIAL (fn
))
15253 instantiate_decl (fn
, /*defer_ok*/0, /*expl_inst_class*/false);
15257 case STATIC_ASSERT
:
15261 ++c_inhibit_evaluation_warnings
;
15263 tsubst_expr (STATIC_ASSERT_CONDITION (t
),
15266 /*integral_constant_expression_p=*/true);
15267 --c_inhibit_evaluation_warnings
;
15269 finish_static_assert (condition
,
15270 STATIC_ASSERT_MESSAGE (t
),
15271 STATIC_ASSERT_SOURCE_LOCATION (t
),
15272 /*member_p=*/false);
15277 case OACC_PARALLEL
:
15278 tmp
= tsubst_omp_clauses (OMP_CLAUSES (t
), false, false, args
, complain
,
15280 stmt
= begin_omp_parallel ();
15281 RECUR (OMP_BODY (t
));
15282 finish_omp_construct (TREE_CODE (t
), stmt
, tmp
);
15286 r
= push_omp_privatization_clauses (OMP_PARALLEL_COMBINED (t
));
15287 tmp
= tsubst_omp_clauses (OMP_PARALLEL_CLAUSES (t
), false, true,
15288 args
, complain
, in_decl
);
15289 if (OMP_PARALLEL_COMBINED (t
))
15290 omp_parallel_combined_clauses
= &tmp
;
15291 stmt
= begin_omp_parallel ();
15292 RECUR (OMP_PARALLEL_BODY (t
));
15293 gcc_assert (omp_parallel_combined_clauses
== NULL
);
15294 OMP_PARALLEL_COMBINED (finish_omp_parallel (tmp
, stmt
))
15295 = OMP_PARALLEL_COMBINED (t
);
15296 pop_omp_privatization_clauses (r
);
15300 r
= push_omp_privatization_clauses (false);
15301 tmp
= tsubst_omp_clauses (OMP_TASK_CLAUSES (t
), false, true,
15302 args
, complain
, in_decl
);
15303 stmt
= begin_omp_task ();
15304 RECUR (OMP_TASK_BODY (t
));
15305 finish_omp_task (tmp
, stmt
);
15306 pop_omp_privatization_clauses (r
);
15313 case OMP_DISTRIBUTE
:
15317 tree clauses
, body
, pre_body
;
15318 tree declv
= NULL_TREE
, initv
= NULL_TREE
, condv
= NULL_TREE
;
15319 tree orig_declv
= NULL_TREE
;
15320 tree incrv
= NULL_TREE
;
15323 r
= push_omp_privatization_clauses (OMP_FOR_INIT (t
) == NULL_TREE
);
15324 clauses
= tsubst_omp_clauses (OMP_FOR_CLAUSES (t
), false,
15325 TREE_CODE (t
) != OACC_LOOP
,
15326 args
, complain
, in_decl
);
15327 if (OMP_FOR_INIT (t
) != NULL_TREE
)
15329 declv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
15330 if (OMP_FOR_ORIG_DECLS (t
))
15331 orig_declv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
15332 initv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
15333 condv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
15334 incrv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
15337 stmt
= begin_omp_structured_block ();
15339 pre_body
= push_stmt_list ();
15340 RECUR (OMP_FOR_PRE_BODY (t
));
15341 pre_body
= pop_stmt_list (pre_body
);
15343 if (OMP_FOR_INIT (t
) != NULL_TREE
)
15344 for (i
= 0; i
< TREE_VEC_LENGTH (OMP_FOR_INIT (t
)); i
++)
15345 tsubst_omp_for_iterator (t
, i
, declv
, orig_declv
, initv
, condv
,
15346 incrv
, &clauses
, args
, complain
, in_decl
,
15347 integral_constant_expression_p
);
15348 omp_parallel_combined_clauses
= NULL
;
15350 body
= push_stmt_list ();
15351 RECUR (OMP_FOR_BODY (t
));
15352 body
= pop_stmt_list (body
);
15354 if (OMP_FOR_INIT (t
) != NULL_TREE
)
15355 t
= finish_omp_for (EXPR_LOCATION (t
), TREE_CODE (t
), declv
,
15356 orig_declv
, initv
, condv
, incrv
, body
, pre_body
,
15360 t
= make_node (TREE_CODE (t
));
15361 TREE_TYPE (t
) = void_type_node
;
15362 OMP_FOR_BODY (t
) = body
;
15363 OMP_FOR_PRE_BODY (t
) = pre_body
;
15364 OMP_FOR_CLAUSES (t
) = clauses
;
15365 SET_EXPR_LOCATION (t
, EXPR_LOCATION (t
));
15369 add_stmt (finish_omp_structured_block (stmt
));
15370 pop_omp_privatization_clauses (r
);
15375 omp_parallel_combined_clauses
= NULL
;
15380 r
= push_omp_privatization_clauses (TREE_CODE (t
) == OMP_TEAMS
15381 && OMP_TEAMS_COMBINED (t
));
15382 tmp
= tsubst_omp_clauses (OMP_CLAUSES (t
), false, true,
15383 args
, complain
, in_decl
);
15384 stmt
= push_stmt_list ();
15385 RECUR (OMP_BODY (t
));
15386 stmt
= pop_stmt_list (stmt
);
15389 OMP_BODY (t
) = stmt
;
15390 OMP_CLAUSES (t
) = tmp
;
15392 pop_omp_privatization_clauses (r
);
15396 case OMP_TARGET_DATA
:
15398 tmp
= tsubst_omp_clauses (OMP_CLAUSES (t
), false,
15399 TREE_CODE (t
) != OACC_DATA
,
15400 args
, complain
, in_decl
);
15401 keep_next_level (true);
15402 stmt
= begin_omp_structured_block ();
15404 RECUR (OMP_BODY (t
));
15405 stmt
= finish_omp_structured_block (stmt
);
15408 OMP_BODY (t
) = stmt
;
15409 OMP_CLAUSES (t
) = tmp
;
15410 if (TREE_CODE (t
) == OMP_TARGET
&& OMP_TARGET_COMBINED (t
))
15412 tree teams
= cp_walk_tree (&stmt
, tsubst_find_omp_teams
, NULL
, NULL
);
15415 /* For combined target teams, ensure the num_teams and
15416 thread_limit clause expressions are evaluated on the host,
15417 before entering the target construct. */
15419 for (c
= OMP_TEAMS_CLAUSES (teams
);
15420 c
; c
= OMP_CLAUSE_CHAIN (c
))
15421 if ((OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_NUM_TEAMS
15422 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_THREAD_LIMIT
)
15423 && TREE_CODE (OMP_CLAUSE_OPERAND (c
, 0)) != INTEGER_CST
)
15425 tree expr
= OMP_CLAUSE_OPERAND (c
, 0);
15426 expr
= force_target_expr (TREE_TYPE (expr
), expr
, tf_none
);
15427 if (expr
== error_mark_node
)
15429 tmp
= TARGET_EXPR_SLOT (expr
);
15431 OMP_CLAUSE_OPERAND (c
, 0) = expr
;
15432 tree tc
= build_omp_clause (OMP_CLAUSE_LOCATION (c
),
15433 OMP_CLAUSE_FIRSTPRIVATE
);
15434 OMP_CLAUSE_DECL (tc
) = tmp
;
15435 OMP_CLAUSE_CHAIN (tc
) = OMP_TARGET_CLAUSES (t
);
15436 OMP_TARGET_CLAUSES (t
) = tc
;
15445 tmp
= tsubst_omp_clauses (OACC_DECLARE_CLAUSES (t
), false, false,
15446 args
, complain
, in_decl
);
15447 OACC_DECLARE_CLAUSES (t
) = tmp
;
15451 case OMP_TARGET_UPDATE
:
15452 case OMP_TARGET_ENTER_DATA
:
15453 case OMP_TARGET_EXIT_DATA
:
15454 tmp
= tsubst_omp_clauses (OMP_STANDALONE_CLAUSES (t
), false, true,
15455 args
, complain
, in_decl
);
15457 OMP_STANDALONE_CLAUSES (t
) = tmp
;
15461 case OACC_ENTER_DATA
:
15462 case OACC_EXIT_DATA
:
15464 tmp
= tsubst_omp_clauses (OMP_STANDALONE_CLAUSES (t
), false, false,
15465 args
, complain
, in_decl
);
15467 OMP_STANDALONE_CLAUSES (t
) = tmp
;
15472 tmp
= tsubst_omp_clauses (OMP_ORDERED_CLAUSES (t
), false, true,
15473 args
, complain
, in_decl
);
15474 stmt
= push_stmt_list ();
15475 RECUR (OMP_BODY (t
));
15476 stmt
= pop_stmt_list (stmt
);
15479 OMP_BODY (t
) = stmt
;
15480 OMP_ORDERED_CLAUSES (t
) = tmp
;
15486 case OMP_TASKGROUP
:
15487 stmt
= push_stmt_list ();
15488 RECUR (OMP_BODY (t
));
15489 stmt
= pop_stmt_list (stmt
);
15492 OMP_BODY (t
) = stmt
;
15497 gcc_assert (OMP_ATOMIC_DEPENDENT_P (t
));
15498 if (TREE_CODE (TREE_OPERAND (t
, 1)) != MODIFY_EXPR
)
15500 tree op1
= TREE_OPERAND (t
, 1);
15501 tree rhs1
= NULL_TREE
;
15503 if (TREE_CODE (op1
) == COMPOUND_EXPR
)
15505 rhs1
= RECUR (TREE_OPERAND (op1
, 0));
15506 op1
= TREE_OPERAND (op1
, 1);
15508 lhs
= RECUR (TREE_OPERAND (op1
, 0));
15509 rhs
= RECUR (TREE_OPERAND (op1
, 1));
15510 finish_omp_atomic (OMP_ATOMIC
, TREE_CODE (op1
), lhs
, rhs
,
15511 NULL_TREE
, NULL_TREE
, rhs1
,
15512 OMP_ATOMIC_SEQ_CST (t
));
15516 tree op1
= TREE_OPERAND (t
, 1);
15517 tree v
= NULL_TREE
, lhs
, rhs
= NULL_TREE
, lhs1
= NULL_TREE
;
15518 tree rhs1
= NULL_TREE
;
15519 enum tree_code code
= TREE_CODE (TREE_OPERAND (op1
, 1));
15520 enum tree_code opcode
= NOP_EXPR
;
15521 if (code
== OMP_ATOMIC_READ
)
15523 v
= RECUR (TREE_OPERAND (op1
, 0));
15524 lhs
= RECUR (TREE_OPERAND (TREE_OPERAND (op1
, 1), 0));
15526 else if (code
== OMP_ATOMIC_CAPTURE_OLD
15527 || code
== OMP_ATOMIC_CAPTURE_NEW
)
15529 tree op11
= TREE_OPERAND (TREE_OPERAND (op1
, 1), 1);
15530 v
= RECUR (TREE_OPERAND (op1
, 0));
15531 lhs1
= RECUR (TREE_OPERAND (TREE_OPERAND (op1
, 1), 0));
15532 if (TREE_CODE (op11
) == COMPOUND_EXPR
)
15534 rhs1
= RECUR (TREE_OPERAND (op11
, 0));
15535 op11
= TREE_OPERAND (op11
, 1);
15537 lhs
= RECUR (TREE_OPERAND (op11
, 0));
15538 rhs
= RECUR (TREE_OPERAND (op11
, 1));
15539 opcode
= TREE_CODE (op11
);
15540 if (opcode
== MODIFY_EXPR
)
15546 lhs
= RECUR (TREE_OPERAND (op1
, 0));
15547 rhs
= RECUR (TREE_OPERAND (op1
, 1));
15549 finish_omp_atomic (code
, opcode
, lhs
, rhs
, v
, lhs1
, rhs1
,
15550 OMP_ATOMIC_SEQ_CST (t
));
15554 case TRANSACTION_EXPR
:
15557 flags
|= (TRANSACTION_EXPR_OUTER (t
) ? TM_STMT_ATTR_OUTER
: 0);
15558 flags
|= (TRANSACTION_EXPR_RELAXED (t
) ? TM_STMT_ATTR_RELAXED
: 0);
15560 if (TRANSACTION_EXPR_IS_STMT (t
))
15562 tree body
= TRANSACTION_EXPR_BODY (t
);
15563 tree noex
= NULL_TREE
;
15564 if (TREE_CODE (body
) == MUST_NOT_THROW_EXPR
)
15566 noex
= MUST_NOT_THROW_COND (body
);
15567 if (noex
== NULL_TREE
)
15568 noex
= boolean_true_node
;
15569 body
= TREE_OPERAND (body
, 0);
15571 stmt
= begin_transaction_stmt (input_location
, NULL
, flags
);
15573 finish_transaction_stmt (stmt
, NULL
, flags
, RECUR (noex
));
15577 stmt
= build_transaction_expr (EXPR_LOCATION (t
),
15578 RECUR (TRANSACTION_EXPR_BODY (t
)),
15585 case MUST_NOT_THROW_EXPR
:
15587 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15588 tree cond
= RECUR (MUST_NOT_THROW_COND (t
));
15589 RETURN (build_must_not_throw_expr (op0
, cond
));
15592 case EXPR_PACK_EXPANSION
:
15593 error ("invalid use of pack expansion expression");
15594 RETURN (error_mark_node
);
15596 case NONTYPE_ARGUMENT_PACK
:
15597 error ("use %<...%> to expand argument pack");
15598 RETURN (error_mark_node
);
15600 case CILK_SPAWN_STMT
:
15601 cfun
->calls_cilk_spawn
= 1;
15602 RETURN (build_cilk_spawn (EXPR_LOCATION (t
), RECUR (CILK_SPAWN_FN (t
))));
15604 case CILK_SYNC_STMT
:
15605 RETURN (build_cilk_sync ());
15607 case COMPOUND_EXPR
:
15608 tmp
= RECUR (TREE_OPERAND (t
, 0));
15609 if (tmp
== NULL_TREE
)
15610 /* If the first operand was a statement, we're done with it. */
15611 RETURN (RECUR (TREE_OPERAND (t
, 1)));
15612 RETURN (build_x_compound_expr (EXPR_LOCATION (t
), tmp
,
15613 RECUR (TREE_OPERAND (t
, 1)),
15616 case ANNOTATE_EXPR
:
15617 tmp
= RECUR (TREE_OPERAND (t
, 0));
15618 RETURN (build2_loc (EXPR_LOCATION (t
), ANNOTATE_EXPR
,
15619 TREE_TYPE (tmp
), tmp
, RECUR (TREE_OPERAND (t
, 1))));
15622 gcc_assert (!STATEMENT_CODE_P (TREE_CODE (t
)));
15624 RETURN (tsubst_copy_and_build (t
, args
, complain
, in_decl
,
15625 /*function_p=*/false,
15626 integral_constant_expression_p
));
15629 RETURN (NULL_TREE
);
15631 input_location
= loc
;
15637 /* Instantiate the special body of the artificial DECL_OMP_DECLARE_REDUCTION
15638 function. For description of the body see comment above
15639 cp_parser_omp_declare_reduction_exprs. */
15642 tsubst_omp_udr (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
15644 if (t
== NULL_TREE
|| t
== error_mark_node
)
15647 gcc_assert (TREE_CODE (t
) == STATEMENT_LIST
);
15649 tree_stmt_iterator tsi
;
15652 memset (stmts
, 0, sizeof stmts
);
15653 for (i
= 0, tsi
= tsi_start (t
);
15654 i
< 7 && !tsi_end_p (tsi
);
15655 i
++, tsi_next (&tsi
))
15656 stmts
[i
] = tsi_stmt (tsi
);
15657 gcc_assert (tsi_end_p (tsi
));
15661 gcc_assert (TREE_CODE (stmts
[0]) == DECL_EXPR
15662 && TREE_CODE (stmts
[1]) == DECL_EXPR
);
15663 tree omp_out
= tsubst (DECL_EXPR_DECL (stmts
[0]),
15664 args
, complain
, in_decl
);
15665 tree omp_in
= tsubst (DECL_EXPR_DECL (stmts
[1]),
15666 args
, complain
, in_decl
);
15667 DECL_CONTEXT (omp_out
) = current_function_decl
;
15668 DECL_CONTEXT (omp_in
) = current_function_decl
;
15669 keep_next_level (true);
15670 tree block
= begin_omp_structured_block ();
15671 tsubst_expr (stmts
[2], args
, complain
, in_decl
, false);
15672 block
= finish_omp_structured_block (block
);
15673 block
= maybe_cleanup_point_expr_void (block
);
15674 add_decl_expr (omp_out
);
15675 if (TREE_NO_WARNING (DECL_EXPR_DECL (stmts
[0])))
15676 TREE_NO_WARNING (omp_out
) = 1;
15677 add_decl_expr (omp_in
);
15678 finish_expr_stmt (block
);
15682 gcc_assert (TREE_CODE (stmts
[3]) == DECL_EXPR
15683 && TREE_CODE (stmts
[4]) == DECL_EXPR
);
15684 tree omp_priv
= tsubst (DECL_EXPR_DECL (stmts
[3]),
15685 args
, complain
, in_decl
);
15686 tree omp_orig
= tsubst (DECL_EXPR_DECL (stmts
[4]),
15687 args
, complain
, in_decl
);
15688 DECL_CONTEXT (omp_priv
) = current_function_decl
;
15689 DECL_CONTEXT (omp_orig
) = current_function_decl
;
15690 keep_next_level (true);
15691 tree block
= begin_omp_structured_block ();
15692 tsubst_expr (stmts
[5], args
, complain
, in_decl
, false);
15693 block
= finish_omp_structured_block (block
);
15694 block
= maybe_cleanup_point_expr_void (block
);
15695 cp_walk_tree (&block
, cp_remove_omp_priv_cleanup_stmt
, omp_priv
, NULL
);
15696 add_decl_expr (omp_priv
);
15697 add_decl_expr (omp_orig
);
15698 finish_expr_stmt (block
);
15700 add_decl_expr (omp_orig
);
15704 /* T is a postfix-expression that is not being used in a function
15705 call. Return the substituted version of T. */
15708 tsubst_non_call_postfix_expression (tree t
, tree args
,
15709 tsubst_flags_t complain
,
15712 if (TREE_CODE (t
) == SCOPE_REF
)
15713 t
= tsubst_qualified_id (t
, args
, complain
, in_decl
,
15714 /*done=*/false, /*address_p=*/false);
15716 t
= tsubst_copy_and_build (t
, args
, complain
, in_decl
,
15717 /*function_p=*/false,
15718 /*integral_constant_expression_p=*/false);
15723 /* Like tsubst but deals with expressions and performs semantic
15724 analysis. FUNCTION_P is true if T is the "F" in "F (ARGS)". */
15727 tsubst_copy_and_build (tree t
,
15729 tsubst_flags_t complain
,
15732 bool integral_constant_expression_p
)
15734 #define RETURN(EXP) do { retval = (EXP); goto out; } while(0)
15735 #define RECUR(NODE) \
15736 tsubst_copy_and_build (NODE, args, complain, in_decl, \
15737 /*function_p=*/false, \
15738 integral_constant_expression_p)
15743 if (t
== NULL_TREE
|| t
== error_mark_node
)
15746 loc
= input_location
;
15747 if (EXPR_HAS_LOCATION (t
))
15748 input_location
= EXPR_LOCATION (t
);
15750 /* N3276 decltype magic only applies to calls at the top level or on the
15751 right side of a comma. */
15752 tsubst_flags_t decltype_flag
= (complain
& tf_decltype
);
15753 complain
&= ~tf_decltype
;
15755 switch (TREE_CODE (t
))
15759 /* Fall through. */
15760 case IDENTIFIER_NODE
:
15764 bool non_integral_constant_expression_p
;
15765 const char *error_msg
;
15767 if (IDENTIFIER_TYPENAME_P (t
))
15769 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15770 t
= mangle_conv_op_name_for_type (new_type
);
15773 /* Look up the name. */
15774 decl
= lookup_name (t
);
15776 /* By convention, expressions use ERROR_MARK_NODE to indicate
15777 failure, not NULL_TREE. */
15778 if (decl
== NULL_TREE
)
15779 decl
= error_mark_node
;
15781 decl
= finish_id_expression (t
, decl
, NULL_TREE
,
15783 integral_constant_expression_p
,
15784 /*allow_non_integral_constant_expression_p=*/(cxx_dialect
>= cxx11
),
15785 &non_integral_constant_expression_p
,
15786 /*template_p=*/false,
15788 /*address_p=*/false,
15789 /*template_arg_p=*/false,
15794 if (!function_p
&& identifier_p (decl
))
15796 if (complain
& tf_error
)
15797 unqualified_name_lookup_error (decl
);
15798 decl
= error_mark_node
;
15803 case TEMPLATE_ID_EXPR
:
15806 tree templ
= RECUR (TREE_OPERAND (t
, 0));
15807 tree targs
= TREE_OPERAND (t
, 1);
15810 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
15811 if (targs
== error_mark_node
)
15812 return error_mark_node
;
15814 if (variable_template_p (templ
))
15816 templ
= lookup_template_variable (templ
, targs
);
15817 if (!any_dependent_template_arguments_p (targs
))
15819 templ
= finish_template_variable (templ
, complain
);
15822 RETURN (convert_from_reference (templ
));
15825 if (TREE_CODE (templ
) == COMPONENT_REF
)
15827 object
= TREE_OPERAND (templ
, 0);
15828 templ
= TREE_OPERAND (templ
, 1);
15831 object
= NULL_TREE
;
15832 templ
= lookup_template_function (templ
, targs
);
15835 RETURN (build3 (COMPONENT_REF
, TREE_TYPE (templ
),
15836 object
, templ
, NULL_TREE
));
15838 RETURN (baselink_for_fns (templ
));
15843 tree r
= RECUR (TREE_OPERAND (t
, 0));
15845 if (REFERENCE_REF_P (t
))
15847 /* A type conversion to reference type will be enclosed in
15848 such an indirect ref, but the substitution of the cast
15849 will have also added such an indirect ref. */
15850 if (TREE_CODE (TREE_TYPE (r
)) == REFERENCE_TYPE
)
15851 r
= convert_from_reference (r
);
15854 r
= build_x_indirect_ref (input_location
, r
, RO_UNARY_STAR
,
15855 complain
|decltype_flag
);
15861 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15862 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15863 RETURN (build_nop (type
, op0
));
15866 case IMPLICIT_CONV_EXPR
:
15868 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15869 tree expr
= RECUR (TREE_OPERAND (t
, 0));
15870 int flags
= LOOKUP_IMPLICIT
;
15871 if (IMPLICIT_CONV_EXPR_DIRECT_INIT (t
))
15872 flags
= LOOKUP_NORMAL
;
15873 RETURN (perform_implicit_conversion_flags (type
, expr
, complain
,
15879 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15880 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15881 RETURN (build1 (CONVERT_EXPR
, type
, op0
));
15885 case REINTERPRET_CAST_EXPR
:
15886 case CONST_CAST_EXPR
:
15887 case DYNAMIC_CAST_EXPR
:
15888 case STATIC_CAST_EXPR
:
15891 tree op
, r
= NULL_TREE
;
15893 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15894 if (integral_constant_expression_p
15895 && !cast_valid_in_integral_constant_expression_p (type
))
15897 if (complain
& tf_error
)
15898 error ("a cast to a type other than an integral or "
15899 "enumeration type cannot appear in a constant-expression");
15900 RETURN (error_mark_node
);
15903 op
= RECUR (TREE_OPERAND (t
, 0));
15905 warning_sentinel
s(warn_useless_cast
);
15906 switch (TREE_CODE (t
))
15909 r
= build_functional_cast (type
, op
, complain
);
15911 case REINTERPRET_CAST_EXPR
:
15912 r
= build_reinterpret_cast (type
, op
, complain
);
15914 case CONST_CAST_EXPR
:
15915 r
= build_const_cast (type
, op
, complain
);
15917 case DYNAMIC_CAST_EXPR
:
15918 r
= build_dynamic_cast (type
, op
, complain
);
15920 case STATIC_CAST_EXPR
:
15921 r
= build_static_cast (type
, op
, complain
);
15924 gcc_unreachable ();
15930 case POSTDECREMENT_EXPR
:
15931 case POSTINCREMENT_EXPR
:
15932 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
15933 args
, complain
, in_decl
);
15934 RETURN (build_x_unary_op (input_location
, TREE_CODE (t
), op1
,
15935 complain
|decltype_flag
));
15937 case PREDECREMENT_EXPR
:
15938 case PREINCREMENT_EXPR
:
15942 case TRUTH_NOT_EXPR
:
15943 case UNARY_PLUS_EXPR
: /* Unary + */
15944 case REALPART_EXPR
:
15945 case IMAGPART_EXPR
:
15946 RETURN (build_x_unary_op (input_location
, TREE_CODE (t
),
15947 RECUR (TREE_OPERAND (t
, 0)),
15948 complain
|decltype_flag
));
15950 case FIX_TRUNC_EXPR
:
15951 RETURN (cp_build_unary_op (FIX_TRUNC_EXPR
, RECUR (TREE_OPERAND (t
, 0)),
15955 op1
= TREE_OPERAND (t
, 0);
15956 if (TREE_CODE (op1
) == LABEL_DECL
)
15957 RETURN (finish_label_address_expr (DECL_NAME (op1
),
15958 EXPR_LOCATION (op1
)));
15959 if (TREE_CODE (op1
) == SCOPE_REF
)
15960 op1
= tsubst_qualified_id (op1
, args
, complain
, in_decl
,
15961 /*done=*/true, /*address_p=*/true);
15963 op1
= tsubst_non_call_postfix_expression (op1
, args
, complain
,
15965 RETURN (build_x_unary_op (input_location
, ADDR_EXPR
, op1
,
15966 complain
|decltype_flag
));
15971 case TRUNC_DIV_EXPR
:
15972 case CEIL_DIV_EXPR
:
15973 case FLOOR_DIV_EXPR
:
15974 case ROUND_DIV_EXPR
:
15975 case EXACT_DIV_EXPR
:
15979 case TRUNC_MOD_EXPR
:
15980 case FLOOR_MOD_EXPR
:
15981 case TRUTH_ANDIF_EXPR
:
15982 case TRUTH_ORIF_EXPR
:
15983 case TRUTH_AND_EXPR
:
15984 case TRUTH_OR_EXPR
:
16000 warning_sentinel
s1(warn_type_limits
);
16001 warning_sentinel
s2(warn_div_by_zero
);
16002 warning_sentinel
s3(warn_logical_op
);
16003 warning_sentinel
s4(warn_tautological_compare
);
16004 tree op0
= RECUR (TREE_OPERAND (t
, 0));
16005 tree op1
= RECUR (TREE_OPERAND (t
, 1));
16006 tree r
= build_x_binary_op
16007 (input_location
, TREE_CODE (t
),
16009 (TREE_NO_WARNING (TREE_OPERAND (t
, 0))
16011 : TREE_CODE (TREE_OPERAND (t
, 0))),
16013 (TREE_NO_WARNING (TREE_OPERAND (t
, 1))
16015 : TREE_CODE (TREE_OPERAND (t
, 1))),
16017 complain
|decltype_flag
);
16018 if (EXPR_P (r
) && TREE_NO_WARNING (t
))
16019 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
16024 case POINTER_PLUS_EXPR
:
16026 tree op0
= RECUR (TREE_OPERAND (t
, 0));
16027 tree op1
= RECUR (TREE_OPERAND (t
, 1));
16028 return fold_build_pointer_plus (op0
, op1
);
16032 RETURN (tsubst_qualified_id (t
, args
, complain
, in_decl
, /*done=*/true,
16033 /*address_p=*/false));
16035 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
16036 args
, complain
, in_decl
);
16037 RETURN (build_x_array_ref (EXPR_LOCATION (t
), op1
,
16038 RECUR (TREE_OPERAND (t
, 1)),
16039 complain
|decltype_flag
));
16041 case ARRAY_NOTATION_REF
:
16043 tree start_index
, length
, stride
;
16044 op1
= tsubst_non_call_postfix_expression (ARRAY_NOTATION_ARRAY (t
),
16045 args
, complain
, in_decl
);
16046 start_index
= RECUR (ARRAY_NOTATION_START (t
));
16047 length
= RECUR (ARRAY_NOTATION_LENGTH (t
));
16048 stride
= RECUR (ARRAY_NOTATION_STRIDE (t
));
16049 RETURN (build_array_notation_ref (EXPR_LOCATION (t
), op1
, start_index
,
16050 length
, stride
, TREE_TYPE (op1
)));
16053 if (PACK_EXPANSION_P (TREE_OPERAND (t
, 0)))
16054 RETURN (tsubst_copy (t
, args
, complain
, in_decl
));
16061 op1
= TREE_OPERAND (t
, 0);
16062 if (TREE_CODE (t
) == SIZEOF_EXPR
&& SIZEOF_EXPR_TYPE_P (t
))
16063 op1
= TREE_TYPE (op1
);
16066 /* When there are no ARGS, we are trying to evaluate a
16067 non-dependent expression from the parser. Trying to do
16068 the substitutions may not work. */
16070 op1
= TREE_TYPE (op1
);
16074 ++cp_unevaluated_operand
;
16075 ++c_inhibit_evaluation_warnings
;
16077 op1
= tsubst (op1
, args
, complain
, in_decl
);
16079 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
16080 /*function_p=*/false,
16081 /*integral_constant_expression_p=*/
16083 --cp_unevaluated_operand
;
16084 --c_inhibit_evaluation_warnings
;
16087 r
= cxx_sizeof_or_alignof_type (op1
, TREE_CODE (t
),
16088 complain
& tf_error
);
16090 r
= cxx_sizeof_or_alignof_expr (op1
, TREE_CODE (t
),
16091 complain
& tf_error
);
16092 if (TREE_CODE (t
) == SIZEOF_EXPR
&& r
!= error_mark_node
)
16094 if (TREE_CODE (r
) != SIZEOF_EXPR
|| TYPE_P (op1
))
16096 if (!processing_template_decl
&& TYPE_P (op1
))
16098 r
= build_min (SIZEOF_EXPR
, size_type_node
,
16099 build1 (NOP_EXPR
, op1
, error_mark_node
));
16100 SIZEOF_EXPR_TYPE_P (r
) = 1;
16103 r
= build_min (SIZEOF_EXPR
, size_type_node
, op1
);
16104 TREE_SIDE_EFFECTS (r
) = 0;
16105 TREE_READONLY (r
) = 1;
16107 SET_EXPR_LOCATION (r
, EXPR_LOCATION (t
));
16112 case AT_ENCODE_EXPR
:
16114 op1
= TREE_OPERAND (t
, 0);
16115 ++cp_unevaluated_operand
;
16116 ++c_inhibit_evaluation_warnings
;
16117 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
16118 /*function_p=*/false,
16119 /*integral_constant_expression_p=*/false);
16120 --cp_unevaluated_operand
;
16121 --c_inhibit_evaluation_warnings
;
16122 RETURN (objc_build_encode_expr (op1
));
16125 case NOEXCEPT_EXPR
:
16126 op1
= TREE_OPERAND (t
, 0);
16127 ++cp_unevaluated_operand
;
16128 ++c_inhibit_evaluation_warnings
;
16129 ++cp_noexcept_operand
;
16130 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
16131 /*function_p=*/false,
16132 /*integral_constant_expression_p=*/false);
16133 --cp_unevaluated_operand
;
16134 --c_inhibit_evaluation_warnings
;
16135 --cp_noexcept_operand
;
16136 RETURN (finish_noexcept_expr (op1
, complain
));
16140 warning_sentinel
s(warn_div_by_zero
);
16141 tree lhs
= RECUR (TREE_OPERAND (t
, 0));
16142 tree rhs
= RECUR (TREE_OPERAND (t
, 2));
16143 tree r
= build_x_modify_expr
16144 (EXPR_LOCATION (t
), lhs
, TREE_CODE (TREE_OPERAND (t
, 1)), rhs
,
16145 complain
|decltype_flag
);
16146 /* TREE_NO_WARNING must be set if either the expression was
16147 parenthesized or it uses an operator such as >>= rather
16148 than plain assignment. In the former case, it was already
16149 set and must be copied. In the latter case,
16150 build_x_modify_expr sets it and it must not be reset
16152 if (TREE_NO_WARNING (t
))
16153 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
16159 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
16160 args
, complain
, in_decl
);
16161 /* Remember that there was a reference to this entity. */
16163 && !mark_used (op1
, complain
) && !(complain
& tf_error
))
16164 RETURN (error_mark_node
);
16165 RETURN (build_x_arrow (input_location
, op1
, complain
));
16169 tree placement
= RECUR (TREE_OPERAND (t
, 0));
16170 tree init
= RECUR (TREE_OPERAND (t
, 3));
16171 vec
<tree
, va_gc
> *placement_vec
;
16172 vec
<tree
, va_gc
> *init_vec
;
16175 if (placement
== NULL_TREE
)
16176 placement_vec
= NULL
;
16179 placement_vec
= make_tree_vector ();
16180 for (; placement
!= NULL_TREE
; placement
= TREE_CHAIN (placement
))
16181 vec_safe_push (placement_vec
, TREE_VALUE (placement
));
16184 /* If there was an initializer in the original tree, but it
16185 instantiated to an empty list, then we should pass a
16186 non-NULL empty vector to tell build_new that it was an
16187 empty initializer() rather than no initializer. This can
16188 only happen when the initializer is a pack expansion whose
16189 parameter packs are of length zero. */
16190 if (init
== NULL_TREE
&& TREE_OPERAND (t
, 3) == NULL_TREE
)
16194 init_vec
= make_tree_vector ();
16195 if (init
== void_node
)
16196 gcc_assert (init_vec
!= NULL
);
16199 for (; init
!= NULL_TREE
; init
= TREE_CHAIN (init
))
16200 vec_safe_push (init_vec
, TREE_VALUE (init
));
16204 tree op1
= tsubst (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
16205 tree op2
= RECUR (TREE_OPERAND (t
, 2));
16206 ret
= build_new (&placement_vec
, op1
, op2
, &init_vec
,
16207 NEW_EXPR_USE_GLOBAL (t
),
16210 if (placement_vec
!= NULL
)
16211 release_tree_vector (placement_vec
);
16212 if (init_vec
!= NULL
)
16213 release_tree_vector (init_vec
);
16220 tree op0
= RECUR (TREE_OPERAND (t
, 0));
16221 tree op1
= RECUR (TREE_OPERAND (t
, 1));
16222 RETURN (delete_sanity (op0
, op1
,
16223 DELETE_EXPR_USE_VEC (t
),
16224 DELETE_EXPR_USE_GLOBAL (t
),
16228 case COMPOUND_EXPR
:
16230 tree op0
= tsubst_copy_and_build (TREE_OPERAND (t
, 0), args
,
16231 complain
& ~tf_decltype
, in_decl
,
16232 /*function_p=*/false,
16233 integral_constant_expression_p
);
16234 RETURN (build_x_compound_expr (EXPR_LOCATION (t
),
16236 RECUR (TREE_OPERAND (t
, 1)),
16237 complain
|decltype_flag
));
16243 vec
<tree
, va_gc
> *call_args
;
16244 unsigned int nargs
, i
;
16249 function
= CALL_EXPR_FN (t
);
16250 /* When we parsed the expression, we determined whether or
16251 not Koenig lookup should be performed. */
16252 koenig_p
= KOENIG_LOOKUP_P (t
);
16253 if (TREE_CODE (function
) == SCOPE_REF
)
16255 qualified_p
= true;
16256 function
= tsubst_qualified_id (function
, args
, complain
, in_decl
,
16258 /*address_p=*/false);
16260 else if (koenig_p
&& identifier_p (function
))
16262 /* Do nothing; calling tsubst_copy_and_build on an identifier
16263 would incorrectly perform unqualified lookup again.
16265 Note that we can also have an IDENTIFIER_NODE if the earlier
16266 unqualified lookup found a member function; in that case
16267 koenig_p will be false and we do want to do the lookup
16268 again to find the instantiated member function.
16270 FIXME but doing that causes c++/15272, so we need to stop
16271 using IDENTIFIER_NODE in that situation. */
16272 qualified_p
= false;
16276 if (TREE_CODE (function
) == COMPONENT_REF
)
16278 tree op
= TREE_OPERAND (function
, 1);
16280 qualified_p
= (TREE_CODE (op
) == SCOPE_REF
16281 || (BASELINK_P (op
)
16282 && BASELINK_QUALIFIED_P (op
)));
16285 qualified_p
= false;
16287 if (TREE_CODE (function
) == ADDR_EXPR
16288 && TREE_CODE (TREE_OPERAND (function
, 0)) == FUNCTION_DECL
)
16289 /* Avoid error about taking the address of a constructor. */
16290 function
= TREE_OPERAND (function
, 0);
16292 function
= tsubst_copy_and_build (function
, args
, complain
,
16295 integral_constant_expression_p
);
16297 if (BASELINK_P (function
))
16298 qualified_p
= true;
16301 nargs
= call_expr_nargs (t
);
16302 call_args
= make_tree_vector ();
16303 for (i
= 0; i
< nargs
; ++i
)
16305 tree arg
= CALL_EXPR_ARG (t
, i
);
16307 if (!PACK_EXPANSION_P (arg
))
16308 vec_safe_push (call_args
, RECUR (CALL_EXPR_ARG (t
, i
)));
16311 /* Expand the pack expansion and push each entry onto
16313 arg
= tsubst_pack_expansion (arg
, args
, complain
, in_decl
);
16314 if (TREE_CODE (arg
) == TREE_VEC
)
16316 unsigned int len
, j
;
16318 len
= TREE_VEC_LENGTH (arg
);
16319 for (j
= 0; j
< len
; ++j
)
16321 tree value
= TREE_VEC_ELT (arg
, j
);
16322 if (value
!= NULL_TREE
)
16323 value
= convert_from_reference (value
);
16324 vec_safe_push (call_args
, value
);
16329 /* A partial substitution. Add one entry. */
16330 vec_safe_push (call_args
, arg
);
16335 /* We do not perform argument-dependent lookup if normal
16336 lookup finds a non-function, in accordance with the
16337 expected resolution of DR 218. */
16339 && ((is_overloaded_fn (function
)
16340 /* If lookup found a member function, the Koenig lookup is
16341 not appropriate, even if an unqualified-name was used
16342 to denote the function. */
16343 && !DECL_FUNCTION_MEMBER_P (get_first_fn (function
)))
16344 || identifier_p (function
))
16345 /* Only do this when substitution turns a dependent call
16346 into a non-dependent call. */
16347 && type_dependent_expression_p_push (t
)
16348 && !any_type_dependent_arguments_p (call_args
))
16349 function
= perform_koenig_lookup (function
, call_args
, tf_none
);
16351 if (identifier_p (function
)
16352 && !any_type_dependent_arguments_p (call_args
))
16354 if (koenig_p
&& (complain
& tf_warning_or_error
))
16356 /* For backwards compatibility and good diagnostics, try
16357 the unqualified lookup again if we aren't in SFINAE
16359 tree unq
= (tsubst_copy_and_build
16360 (function
, args
, complain
, in_decl
, true,
16361 integral_constant_expression_p
));
16362 if (unq
== error_mark_node
)
16363 RETURN (error_mark_node
);
16365 if (unq
!= function
)
16368 if (INDIRECT_REF_P (fn
))
16369 fn
= TREE_OPERAND (fn
, 0);
16370 if (TREE_CODE (fn
) == COMPONENT_REF
)
16371 fn
= TREE_OPERAND (fn
, 1);
16372 if (is_overloaded_fn (fn
))
16373 fn
= get_first_fn (fn
);
16374 if (permerror (EXPR_LOC_OR_LOC (t
, input_location
),
16375 "%qD was not declared in this scope, "
16376 "and no declarations were found by "
16377 "argument-dependent lookup at the point "
16378 "of instantiation", function
))
16381 /* Can't say anything more. */;
16382 else if (DECL_CLASS_SCOPE_P (fn
))
16384 location_t loc
= EXPR_LOC_OR_LOC (t
,
16387 "declarations in dependent base %qT are "
16388 "not found by unqualified lookup",
16389 DECL_CLASS_CONTEXT (fn
));
16390 if (current_class_ptr
)
16392 "use %<this->%D%> instead", function
);
16395 "use %<%T::%D%> instead",
16396 current_class_name
, function
);
16399 inform (DECL_SOURCE_LOCATION (fn
),
16400 "%qD declared here, later in the "
16401 "translation unit", fn
);
16406 if (identifier_p (function
))
16408 if (complain
& tf_error
)
16409 unqualified_name_lookup_error (function
);
16410 release_tree_vector (call_args
);
16411 RETURN (error_mark_node
);
16415 /* Remember that there was a reference to this entity. */
16416 if (DECL_P (function
)
16417 && !mark_used (function
, complain
) && !(complain
& tf_error
))
16418 RETURN (error_mark_node
);
16420 /* Put back tf_decltype for the actual call. */
16421 complain
|= decltype_flag
;
16423 if (TREE_CODE (function
) == OFFSET_REF
)
16424 ret
= build_offset_ref_call_from_tree (function
, &call_args
,
16426 else if (TREE_CODE (function
) == COMPONENT_REF
)
16428 tree instance
= TREE_OPERAND (function
, 0);
16429 tree fn
= TREE_OPERAND (function
, 1);
16431 if (processing_template_decl
16432 && (type_dependent_expression_p (instance
)
16433 || (!BASELINK_P (fn
)
16434 && TREE_CODE (fn
) != FIELD_DECL
)
16435 || type_dependent_expression_p (fn
)
16436 || any_type_dependent_arguments_p (call_args
)))
16437 ret
= build_nt_call_vec (function
, call_args
);
16438 else if (!BASELINK_P (fn
))
16439 ret
= finish_call_expr (function
, &call_args
,
16440 /*disallow_virtual=*/false,
16441 /*koenig_p=*/false,
16444 ret
= (build_new_method_call
16446 &call_args
, NULL_TREE
,
16447 qualified_p
? LOOKUP_NONVIRTUAL
: LOOKUP_NORMAL
,
16452 ret
= finish_call_expr (function
, &call_args
,
16453 /*disallow_virtual=*/qualified_p
,
16457 release_tree_vector (call_args
);
16464 tree cond
= RECUR (TREE_OPERAND (t
, 0));
16465 tree folded_cond
= fold_non_dependent_expr (cond
);
16468 if (TREE_CODE (folded_cond
) == INTEGER_CST
)
16470 if (integer_zerop (folded_cond
))
16472 ++c_inhibit_evaluation_warnings
;
16473 exp1
= RECUR (TREE_OPERAND (t
, 1));
16474 --c_inhibit_evaluation_warnings
;
16475 exp2
= RECUR (TREE_OPERAND (t
, 2));
16479 exp1
= RECUR (TREE_OPERAND (t
, 1));
16480 ++c_inhibit_evaluation_warnings
;
16481 exp2
= RECUR (TREE_OPERAND (t
, 2));
16482 --c_inhibit_evaluation_warnings
;
16484 cond
= folded_cond
;
16488 exp1
= RECUR (TREE_OPERAND (t
, 1));
16489 exp2
= RECUR (TREE_OPERAND (t
, 2));
16492 RETURN (build_x_conditional_expr (EXPR_LOCATION (t
),
16493 cond
, exp1
, exp2
, complain
));
16496 case PSEUDO_DTOR_EXPR
:
16498 tree op0
= RECUR (TREE_OPERAND (t
, 0));
16499 tree op1
= RECUR (TREE_OPERAND (t
, 1));
16500 tree op2
= tsubst (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
16501 RETURN (finish_pseudo_destructor_expr (op0
, op1
, op2
,
16507 tree purpose
, value
, chain
;
16509 if (t
== void_list_node
)
16512 if ((TREE_PURPOSE (t
) && PACK_EXPANSION_P (TREE_PURPOSE (t
)))
16513 || (TREE_VALUE (t
) && PACK_EXPANSION_P (TREE_VALUE (t
))))
16515 /* We have pack expansions, so expand those and
16516 create a new list out of it. */
16517 tree purposevec
= NULL_TREE
;
16518 tree valuevec
= NULL_TREE
;
16522 /* Expand the argument expressions. */
16523 if (TREE_PURPOSE (t
))
16524 purposevec
= tsubst_pack_expansion (TREE_PURPOSE (t
), args
,
16525 complain
, in_decl
);
16526 if (TREE_VALUE (t
))
16527 valuevec
= tsubst_pack_expansion (TREE_VALUE (t
), args
,
16528 complain
, in_decl
);
16530 /* Build the rest of the list. */
16531 chain
= TREE_CHAIN (t
);
16532 if (chain
&& chain
!= void_type_node
)
16533 chain
= RECUR (chain
);
16535 /* Determine the number of arguments. */
16536 if (purposevec
&& TREE_CODE (purposevec
) == TREE_VEC
)
16538 len
= TREE_VEC_LENGTH (purposevec
);
16539 gcc_assert (!valuevec
|| len
== TREE_VEC_LENGTH (valuevec
));
16541 else if (TREE_CODE (valuevec
) == TREE_VEC
)
16542 len
= TREE_VEC_LENGTH (valuevec
);
16545 /* Since we only performed a partial substitution into
16546 the argument pack, we only RETURN (a single list
16548 if (purposevec
== TREE_PURPOSE (t
)
16549 && valuevec
== TREE_VALUE (t
)
16550 && chain
== TREE_CHAIN (t
))
16553 RETURN (tree_cons (purposevec
, valuevec
, chain
));
16556 /* Convert the argument vectors into a TREE_LIST */
16560 /* Grab the Ith values. */
16562 purpose
= purposevec
? TREE_VEC_ELT (purposevec
, i
)
16565 = valuevec
? convert_from_reference (TREE_VEC_ELT (valuevec
, i
))
16568 /* Build the list (backwards). */
16569 chain
= tree_cons (purpose
, value
, chain
);
16575 purpose
= TREE_PURPOSE (t
);
16577 purpose
= RECUR (purpose
);
16578 value
= TREE_VALUE (t
);
16580 value
= RECUR (value
);
16581 chain
= TREE_CHAIN (t
);
16582 if (chain
&& chain
!= void_type_node
)
16583 chain
= RECUR (chain
);
16584 if (purpose
== TREE_PURPOSE (t
)
16585 && value
== TREE_VALUE (t
)
16586 && chain
== TREE_CHAIN (t
))
16588 RETURN (tree_cons (purpose
, value
, chain
));
16591 case COMPONENT_REF
:
16598 object
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
16599 args
, complain
, in_decl
);
16600 /* Remember that there was a reference to this entity. */
16601 if (DECL_P (object
)
16602 && !mark_used (object
, complain
) && !(complain
& tf_error
))
16603 RETURN (error_mark_node
);
16604 object_type
= TREE_TYPE (object
);
16606 member
= TREE_OPERAND (t
, 1);
16607 if (BASELINK_P (member
))
16608 member
= tsubst_baselink (member
,
16609 non_reference (TREE_TYPE (object
)),
16610 args
, complain
, in_decl
);
16612 member
= tsubst_copy (member
, args
, complain
, in_decl
);
16613 if (member
== error_mark_node
)
16614 RETURN (error_mark_node
);
16616 if (type_dependent_expression_p (object
))
16617 /* We can't do much here. */;
16618 else if (!CLASS_TYPE_P (object_type
))
16620 if (scalarish_type_p (object_type
))
16622 tree s
= NULL_TREE
;
16623 tree dtor
= member
;
16625 if (TREE_CODE (dtor
) == SCOPE_REF
)
16627 s
= TREE_OPERAND (dtor
, 0);
16628 dtor
= TREE_OPERAND (dtor
, 1);
16630 if (TREE_CODE (dtor
) == BIT_NOT_EXPR
)
16632 dtor
= TREE_OPERAND (dtor
, 0);
16634 RETURN (finish_pseudo_destructor_expr
16635 (object
, s
, dtor
, input_location
));
16639 else if (TREE_CODE (member
) == SCOPE_REF
16640 && TREE_CODE (TREE_OPERAND (member
, 1)) == TEMPLATE_ID_EXPR
)
16642 /* Lookup the template functions now that we know what the
16644 tree scope
= TREE_OPERAND (member
, 0);
16645 tree tmpl
= TREE_OPERAND (TREE_OPERAND (member
, 1), 0);
16646 tree args
= TREE_OPERAND (TREE_OPERAND (member
, 1), 1);
16647 member
= lookup_qualified_name (scope
, tmpl
,
16648 /*is_type_p=*/false,
16649 /*complain=*/false);
16650 if (BASELINK_P (member
))
16652 BASELINK_FUNCTIONS (member
)
16653 = build_nt (TEMPLATE_ID_EXPR
, BASELINK_FUNCTIONS (member
),
16655 member
= (adjust_result_of_qualified_name_lookup
16656 (member
, BINFO_TYPE (BASELINK_BINFO (member
)),
16661 qualified_name_lookup_error (scope
, tmpl
, member
,
16663 RETURN (error_mark_node
);
16666 else if (TREE_CODE (member
) == SCOPE_REF
16667 && !CLASS_TYPE_P (TREE_OPERAND (member
, 0))
16668 && TREE_CODE (TREE_OPERAND (member
, 0)) != NAMESPACE_DECL
)
16670 if (complain
& tf_error
)
16672 if (TYPE_P (TREE_OPERAND (member
, 0)))
16673 error ("%qT is not a class or namespace",
16674 TREE_OPERAND (member
, 0));
16676 error ("%qD is not a class or namespace",
16677 TREE_OPERAND (member
, 0));
16679 RETURN (error_mark_node
);
16681 else if (TREE_CODE (member
) == FIELD_DECL
)
16683 r
= finish_non_static_data_member (member
, object
, NULL_TREE
);
16684 if (TREE_CODE (r
) == COMPONENT_REF
)
16685 REF_PARENTHESIZED_P (r
) = REF_PARENTHESIZED_P (t
);
16689 r
= finish_class_member_access_expr (object
, member
,
16690 /*template_p=*/false,
16692 if (TREE_CODE (r
) == COMPONENT_REF
)
16693 REF_PARENTHESIZED_P (r
) = REF_PARENTHESIZED_P (t
);
16698 RETURN (build_throw
16699 (RECUR (TREE_OPERAND (t
, 0))));
16703 vec
<constructor_elt
, va_gc
> *n
;
16704 constructor_elt
*ce
;
16705 unsigned HOST_WIDE_INT idx
;
16706 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
16707 bool process_index_p
;
16709 bool need_copy_p
= false;
16712 if (type
== error_mark_node
)
16713 RETURN (error_mark_node
);
16715 /* digest_init will do the wrong thing if we let it. */
16716 if (type
&& TYPE_PTRMEMFUNC_P (type
))
16719 /* We do not want to process the index of aggregate
16720 initializers as they are identifier nodes which will be
16721 looked up by digest_init. */
16722 process_index_p
= !(type
&& MAYBE_CLASS_TYPE_P (type
));
16724 n
= vec_safe_copy (CONSTRUCTOR_ELTS (t
));
16725 newlen
= vec_safe_length (n
);
16726 FOR_EACH_VEC_SAFE_ELT (n
, idx
, ce
)
16728 if (ce
->index
&& process_index_p
16729 /* An identifier index is looked up in the type
16730 being initialized, not the current scope. */
16731 && TREE_CODE (ce
->index
) != IDENTIFIER_NODE
)
16732 ce
->index
= RECUR (ce
->index
);
16734 if (PACK_EXPANSION_P (ce
->value
))
16736 /* Substitute into the pack expansion. */
16737 ce
->value
= tsubst_pack_expansion (ce
->value
, args
, complain
,
16740 if (ce
->value
== error_mark_node
16741 || PACK_EXPANSION_P (ce
->value
))
16743 else if (TREE_VEC_LENGTH (ce
->value
) == 1)
16744 /* Just move the argument into place. */
16745 ce
->value
= TREE_VEC_ELT (ce
->value
, 0);
16748 /* Update the length of the final CONSTRUCTOR
16749 arguments vector, and note that we will need to
16751 newlen
= newlen
+ TREE_VEC_LENGTH (ce
->value
) - 1;
16752 need_copy_p
= true;
16756 ce
->value
= RECUR (ce
->value
);
16761 vec
<constructor_elt
, va_gc
> *old_n
= n
;
16763 vec_alloc (n
, newlen
);
16764 FOR_EACH_VEC_ELT (*old_n
, idx
, ce
)
16766 if (TREE_CODE (ce
->value
) == TREE_VEC
)
16768 int i
, len
= TREE_VEC_LENGTH (ce
->value
);
16769 for (i
= 0; i
< len
; ++i
)
16770 CONSTRUCTOR_APPEND_ELT (n
, 0,
16771 TREE_VEC_ELT (ce
->value
, i
));
16774 CONSTRUCTOR_APPEND_ELT (n
, 0, ce
->value
);
16778 r
= build_constructor (init_list_type_node
, n
);
16779 CONSTRUCTOR_IS_DIRECT_INIT (r
) = CONSTRUCTOR_IS_DIRECT_INIT (t
);
16781 if (TREE_HAS_CONSTRUCTOR (t
))
16782 RETURN (finish_compound_literal (type
, r
, complain
));
16784 TREE_TYPE (r
) = type
;
16790 tree operand_0
= TREE_OPERAND (t
, 0);
16791 if (TYPE_P (operand_0
))
16793 operand_0
= tsubst (operand_0
, args
, complain
, in_decl
);
16794 RETURN (get_typeid (operand_0
, complain
));
16798 operand_0
= RECUR (operand_0
);
16799 RETURN (build_typeid (operand_0
, complain
));
16806 else if (DECL_PACK_P (t
))
16808 /* We don't build decls for an instantiation of a
16809 variadic capture proxy, we instantiate the elements
16811 gcc_assert (DECL_HAS_VALUE_EXPR_P (t
));
16812 return RECUR (DECL_VALUE_EXPR (t
));
16818 tree r
= tsubst_copy (t
, args
, complain
, in_decl
);
16819 /* ??? We're doing a subset of finish_id_expression here. */
16821 && !processing_template_decl
16822 && !cp_unevaluated_operand
16823 && (TREE_STATIC (r
) || DECL_EXTERNAL (r
))
16824 && CP_DECL_THREAD_LOCAL_P (r
))
16826 if (tree wrap
= get_tls_wrapper_fn (r
))
16827 /* Replace an evaluated use of the thread_local variable with
16828 a call to its wrapper. */
16829 r
= build_cxx_call (wrap
, 0, NULL
, tf_warning_or_error
);
16831 else if (outer_automatic_var_p (r
))
16833 r
= process_outer_var_ref (r
, complain
);
16834 if (is_capture_proxy (r
))
16835 register_local_specialization (r
, t
);
16838 if (TREE_CODE (TREE_TYPE (t
)) != REFERENCE_TYPE
)
16839 /* If the original type was a reference, we'll be wrapped in
16840 the appropriate INDIRECT_REF. */
16841 r
= convert_from_reference (r
);
16847 tree op0
= RECUR (TREE_OPERAND (t
, 0));
16848 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
16849 RETURN (build_x_va_arg (EXPR_LOCATION (t
), op0
, type
));
16852 case OFFSETOF_EXPR
:
16853 RETURN (finish_offsetof (RECUR (TREE_OPERAND (t
, 0)),
16854 EXPR_LOCATION (t
)));
16858 tree type1
= tsubst (TRAIT_EXPR_TYPE1 (t
), args
,
16859 complain
, in_decl
);
16861 tree type2
= TRAIT_EXPR_TYPE2 (t
);
16862 if (type2
&& TREE_CODE (type2
) == TREE_LIST
)
16863 type2
= RECUR (type2
);
16865 type2
= tsubst (type2
, args
, complain
, in_decl
);
16867 RETURN (finish_trait_expr (TRAIT_EXPR_KIND (t
), type1
, type2
));
16872 tree old_stmt_expr
= cur_stmt_expr
;
16873 tree stmt_expr
= begin_stmt_expr ();
16875 cur_stmt_expr
= stmt_expr
;
16876 tsubst_expr (STMT_EXPR_STMT (t
), args
, complain
, in_decl
,
16877 integral_constant_expression_p
);
16878 stmt_expr
= finish_stmt_expr (stmt_expr
, false);
16879 cur_stmt_expr
= old_stmt_expr
;
16881 /* If the resulting list of expression statement is empty,
16882 fold it further into void_node. */
16883 if (empty_expr_stmt_p (stmt_expr
))
16884 stmt_expr
= void_node
;
16886 RETURN (stmt_expr
);
16891 tree r
= build_lambda_expr ();
16893 tree type
= tsubst (LAMBDA_EXPR_CLOSURE (t
), args
, complain
, NULL_TREE
);
16894 LAMBDA_EXPR_CLOSURE (r
) = type
;
16895 CLASSTYPE_LAMBDA_EXPR (type
) = r
;
16897 LAMBDA_EXPR_LOCATION (r
)
16898 = LAMBDA_EXPR_LOCATION (t
);
16899 LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (r
)
16900 = LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (t
);
16901 LAMBDA_EXPR_MUTABLE_P (r
) = LAMBDA_EXPR_MUTABLE_P (t
);
16902 LAMBDA_EXPR_DISCRIMINATOR (r
)
16903 = (LAMBDA_EXPR_DISCRIMINATOR (t
));
16904 tree scope
= LAMBDA_EXPR_EXTRA_SCOPE (t
);
16906 /* No substitution needed. */;
16907 else if (VAR_OR_FUNCTION_DECL_P (scope
))
16908 /* For a function or variable scope, we want to use tsubst so that we
16909 don't complain about referring to an auto before deduction. */
16910 scope
= tsubst (scope
, args
, complain
, in_decl
);
16911 else if (TREE_CODE (scope
) == PARM_DECL
)
16913 /* Look up the parameter we want directly, as tsubst_copy
16914 doesn't do what we need. */
16915 tree fn
= tsubst (DECL_CONTEXT (scope
), args
, complain
, in_decl
);
16916 tree parm
= FUNCTION_FIRST_USER_PARM (fn
);
16917 while (DECL_PARM_INDEX (parm
) != DECL_PARM_INDEX (scope
))
16918 parm
= DECL_CHAIN (parm
);
16920 /* FIXME Work around the parm not having DECL_CONTEXT set. */
16921 if (DECL_CONTEXT (scope
) == NULL_TREE
)
16922 DECL_CONTEXT (scope
) = fn
;
16924 else if (TREE_CODE (scope
) == FIELD_DECL
)
16925 /* For a field, use tsubst_copy so that we look up the existing field
16926 rather than build a new one. */
16927 scope
= RECUR (scope
);
16929 gcc_unreachable ();
16930 LAMBDA_EXPR_EXTRA_SCOPE (r
) = scope
;
16931 LAMBDA_EXPR_RETURN_TYPE (r
)
16932 = tsubst (LAMBDA_EXPR_RETURN_TYPE (t
), args
, complain
, in_decl
);
16934 gcc_assert (LAMBDA_EXPR_THIS_CAPTURE (t
) == NULL_TREE
16935 && LAMBDA_EXPR_PENDING_PROXIES (t
) == NULL
);
16937 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
16938 determine_visibility (TYPE_NAME (type
));
16939 /* Now that we know visibility, instantiate the type so we have a
16940 declaration of the op() for later calls to lambda_function. */
16941 complete_type (type
);
16943 LAMBDA_EXPR_THIS_CAPTURE (r
) = NULL_TREE
;
16945 insert_pending_capture_proxies ();
16947 RETURN (build_lambda_object (r
));
16951 /* We can get here for a constant initializer of non-dependent type.
16952 FIXME stop folding in cp_parser_initializer_clause. */
16954 tree r
= get_target_expr_sfinae (RECUR (TARGET_EXPR_INITIAL (t
)),
16959 case TRANSACTION_EXPR
:
16960 RETURN (tsubst_expr(t
, args
, complain
, in_decl
,
16961 integral_constant_expression_p
));
16964 RETURN (finish_parenthesized_expr (RECUR (TREE_OPERAND (t
, 0))));
16966 case VEC_PERM_EXPR
:
16968 tree op0
= RECUR (TREE_OPERAND (t
, 0));
16969 tree op1
= RECUR (TREE_OPERAND (t
, 1));
16970 tree op2
= RECUR (TREE_OPERAND (t
, 2));
16971 RETURN (build_x_vec_perm_expr (input_location
, op0
, op1
, op2
,
16975 case REQUIRES_EXPR
:
16976 RETURN (tsubst_requires_expr (t
, args
, complain
, in_decl
));
16979 /* Handle Objective-C++ constructs, if appropriate. */
16982 = objcp_tsubst_copy_and_build (t
, args
, complain
,
16983 in_decl
, /*function_p=*/false);
16987 RETURN (tsubst_copy (t
, args
, complain
, in_decl
));
16993 input_location
= loc
;
16997 /* Verify that the instantiated ARGS are valid. For type arguments,
16998 make sure that the type's linkage is ok. For non-type arguments,
16999 make sure they are constants if they are integral or enumerations.
17000 Emit an error under control of COMPLAIN, and return TRUE on error. */
17003 check_instantiated_arg (tree tmpl
, tree t
, tsubst_flags_t complain
)
17005 if (dependent_template_arg_p (t
))
17007 if (ARGUMENT_PACK_P (t
))
17009 tree vec
= ARGUMENT_PACK_ARGS (t
);
17010 int len
= TREE_VEC_LENGTH (vec
);
17011 bool result
= false;
17014 for (i
= 0; i
< len
; ++i
)
17015 if (check_instantiated_arg (tmpl
, TREE_VEC_ELT (vec
, i
), complain
))
17019 else if (TYPE_P (t
))
17021 /* [basic.link]: A name with no linkage (notably, the name
17022 of a class or enumeration declared in a local scope)
17023 shall not be used to declare an entity with linkage.
17024 This implies that names with no linkage cannot be used as
17027 DR 757 relaxes this restriction for C++0x. */
17028 tree nt
= (cxx_dialect
> cxx98
? NULL_TREE
17029 : no_linkage_check (t
, /*relaxed_p=*/false));
17033 /* DR 488 makes use of a type with no linkage cause
17034 type deduction to fail. */
17035 if (complain
& tf_error
)
17037 if (TYPE_ANONYMOUS_P (nt
))
17038 error ("%qT is/uses anonymous type", t
);
17040 error ("template argument for %qD uses local type %qT",
17045 /* In order to avoid all sorts of complications, we do not
17046 allow variably-modified types as template arguments. */
17047 else if (variably_modified_type_p (t
, NULL_TREE
))
17049 if (complain
& tf_error
)
17050 error ("%qT is a variably modified type", t
);
17054 /* Class template and alias template arguments should be OK. */
17055 else if (DECL_TYPE_TEMPLATE_P (t
))
17057 /* A non-type argument of integral or enumerated type must be a
17059 else if (TREE_TYPE (t
)
17060 && INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (t
))
17061 && !REFERENCE_REF_P (t
)
17062 && !TREE_CONSTANT (t
))
17064 if (complain
& tf_error
)
17065 error ("integral expression %qE is not constant", t
);
17072 check_instantiated_args (tree tmpl
, tree args
, tsubst_flags_t complain
)
17074 int ix
, len
= DECL_NTPARMS (tmpl
);
17075 bool result
= false;
17077 for (ix
= 0; ix
!= len
; ix
++)
17079 if (check_instantiated_arg (tmpl
, TREE_VEC_ELT (args
, ix
), complain
))
17082 if (result
&& (complain
& tf_error
))
17083 error (" trying to instantiate %qD", tmpl
);
17087 /* We're out of SFINAE context now, so generate diagnostics for the access
17088 errors we saw earlier when instantiating D from TMPL and ARGS. */
17091 recheck_decl_substitution (tree d
, tree tmpl
, tree args
)
17093 tree pattern
= DECL_TEMPLATE_RESULT (tmpl
);
17094 tree type
= TREE_TYPE (pattern
);
17095 location_t loc
= input_location
;
17097 push_access_scope (d
);
17098 push_deferring_access_checks (dk_no_deferred
);
17099 input_location
= DECL_SOURCE_LOCATION (pattern
);
17100 tsubst (type
, args
, tf_warning_or_error
, d
);
17101 input_location
= loc
;
17102 pop_deferring_access_checks ();
17103 pop_access_scope (d
);
17106 /* Instantiate the indicated variable, function, or alias template TMPL with
17107 the template arguments in TARG_PTR. */
17110 instantiate_template_1 (tree tmpl
, tree orig_args
, tsubst_flags_t complain
)
17112 tree targ_ptr
= orig_args
;
17116 bool access_ok
= true;
17118 if (tmpl
== error_mark_node
)
17119 return error_mark_node
;
17121 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
);
17123 /* If this function is a clone, handle it specially. */
17124 if (DECL_CLONED_FUNCTION_P (tmpl
))
17129 /* Use DECL_ABSTRACT_ORIGIN because only FUNCTION_DECLs have
17130 DECL_CLONED_FUNCTION. */
17131 spec
= instantiate_template (DECL_ABSTRACT_ORIGIN (tmpl
),
17132 targ_ptr
, complain
);
17133 if (spec
== error_mark_node
)
17134 return error_mark_node
;
17136 /* Look for the clone. */
17137 FOR_EACH_CLONE (clone
, spec
)
17138 if (DECL_NAME (clone
) == DECL_NAME (tmpl
))
17140 /* We should always have found the clone by now. */
17141 gcc_unreachable ();
17145 if (targ_ptr
== error_mark_node
)
17146 return error_mark_node
;
17148 /* Check to see if we already have this specialization. */
17149 gen_tmpl
= most_general_template (tmpl
);
17150 if (tmpl
!= gen_tmpl
)
17151 /* The TMPL is a partial instantiation. To get a full set of
17152 arguments we must add the arguments used to perform the
17153 partial instantiation. */
17154 targ_ptr
= add_outermost_template_args (DECL_TI_ARGS (tmpl
),
17157 /* It would be nice to avoid hashing here and then again in tsubst_decl,
17158 but it doesn't seem to be on the hot path. */
17159 spec
= retrieve_specialization (gen_tmpl
, targ_ptr
, 0);
17161 gcc_assert (tmpl
== gen_tmpl
17162 || ((fndecl
= retrieve_specialization (tmpl
, orig_args
, 0))
17164 || fndecl
== NULL_TREE
);
17166 if (spec
!= NULL_TREE
)
17168 if (FNDECL_HAS_ACCESS_ERRORS (spec
))
17170 if (complain
& tf_error
)
17171 recheck_decl_substitution (spec
, gen_tmpl
, targ_ptr
);
17172 return error_mark_node
;
17177 if (check_instantiated_args (gen_tmpl
, INNERMOST_TEMPLATE_ARGS (targ_ptr
),
17179 return error_mark_node
;
17181 /* We are building a FUNCTION_DECL, during which the access of its
17182 parameters and return types have to be checked. However this
17183 FUNCTION_DECL which is the desired context for access checking
17184 is not built yet. We solve this chicken-and-egg problem by
17185 deferring all checks until we have the FUNCTION_DECL. */
17186 push_deferring_access_checks (dk_deferred
);
17188 /* Instantiation of the function happens in the context of the function
17189 template, not the context of the overload resolution we're doing. */
17190 push_to_top_level ();
17191 /* If there are dependent arguments, e.g. because we're doing partial
17192 ordering, make sure processing_template_decl stays set. */
17193 if (uses_template_parms (targ_ptr
))
17194 ++processing_template_decl
;
17195 if (DECL_CLASS_SCOPE_P (gen_tmpl
))
17197 tree ctx
= tsubst_aggr_type (DECL_CONTEXT (gen_tmpl
), targ_ptr
,
17198 complain
, gen_tmpl
, true);
17199 push_nested_class (ctx
);
17202 tree pattern
= DECL_TEMPLATE_RESULT (gen_tmpl
);
17204 if (VAR_P (pattern
))
17206 /* We need to determine if we're using a partial or explicit
17207 specialization now, because the type of the variable could be
17209 tree tid
= lookup_template_variable (gen_tmpl
, targ_ptr
);
17210 tree elt
= most_specialized_partial_spec (tid
, complain
);
17211 if (elt
== error_mark_node
)
17212 pattern
= error_mark_node
;
17215 tmpl
= TREE_VALUE (elt
);
17216 pattern
= DECL_TEMPLATE_RESULT (tmpl
);
17217 targ_ptr
= TREE_PURPOSE (elt
);
17221 /* Substitute template parameters to obtain the specialization. */
17222 fndecl
= tsubst (pattern
, targ_ptr
, complain
, gen_tmpl
);
17223 if (DECL_CLASS_SCOPE_P (gen_tmpl
))
17224 pop_nested_class ();
17225 pop_from_top_level ();
17227 if (fndecl
== error_mark_node
)
17229 pop_deferring_access_checks ();
17230 return error_mark_node
;
17233 /* The DECL_TI_TEMPLATE should always be the immediate parent
17234 template, not the most general template. */
17235 DECL_TI_TEMPLATE (fndecl
) = tmpl
;
17236 DECL_TI_ARGS (fndecl
) = targ_ptr
;
17238 /* Now we know the specialization, compute access previously
17240 push_access_scope (fndecl
);
17241 if (!perform_deferred_access_checks (complain
))
17243 pop_access_scope (fndecl
);
17244 pop_deferring_access_checks ();
17246 /* If we've just instantiated the main entry point for a function,
17247 instantiate all the alternate entry points as well. We do this
17248 by cloning the instantiation of the main entry point, not by
17249 instantiating the template clones. */
17250 if (DECL_CHAIN (gen_tmpl
) && DECL_CLONED_FUNCTION_P (DECL_CHAIN (gen_tmpl
)))
17251 clone_function_decl (fndecl
, /*update_method_vec_p=*/0);
17255 if (!(complain
& tf_error
))
17257 /* Remember to reinstantiate when we're out of SFINAE so the user
17258 can see the errors. */
17259 FNDECL_HAS_ACCESS_ERRORS (fndecl
) = true;
17261 return error_mark_node
;
17266 /* Wrapper for instantiate_template_1. */
17269 instantiate_template (tree tmpl
, tree orig_args
, tsubst_flags_t complain
)
17272 timevar_push (TV_TEMPLATE_INST
);
17273 ret
= instantiate_template_1 (tmpl
, orig_args
, complain
);
17274 timevar_pop (TV_TEMPLATE_INST
);
17278 /* Instantiate the alias template TMPL with ARGS. Also push a template
17279 instantiation level, which instantiate_template doesn't do because
17280 functions and variables have sufficient context established by the
17284 instantiate_alias_template (tree tmpl
, tree args
, tsubst_flags_t complain
)
17286 struct pending_template
*old_last_pend
= last_pending_template
;
17287 struct tinst_level
*old_error_tinst
= last_error_tinst_level
;
17288 if (tmpl
== error_mark_node
|| args
== error_mark_node
)
17289 return error_mark_node
;
17290 tree tinst
= build_tree_list (tmpl
, args
);
17291 if (!push_tinst_level (tinst
))
17294 return error_mark_node
;
17298 coerce_innermost_template_parms (DECL_TEMPLATE_PARMS (tmpl
),
17299 args
, tmpl
, complain
,
17300 /*require_all_args=*/true,
17301 /*use_default_args=*/true);
17303 tree r
= instantiate_template (tmpl
, args
, complain
);
17304 pop_tinst_level ();
17305 /* We can't free this if a pending_template entry or last_error_tinst_level
17306 is pointing at it. */
17307 if (last_pending_template
== old_last_pend
17308 && last_error_tinst_level
== old_error_tinst
)
17314 /* PARM is a template parameter pack for FN. Returns true iff
17315 PARM is used in a deducible way in the argument list of FN. */
17318 pack_deducible_p (tree parm
, tree fn
)
17320 tree t
= FUNCTION_FIRST_USER_PARMTYPE (fn
);
17321 for (; t
; t
= TREE_CHAIN (t
))
17323 tree type
= TREE_VALUE (t
);
17325 if (!PACK_EXPANSION_P (type
))
17327 for (packs
= PACK_EXPANSION_PARAMETER_PACKS (type
);
17328 packs
; packs
= TREE_CHAIN (packs
))
17329 if (template_args_equal (TREE_VALUE (packs
), parm
))
17331 /* The template parameter pack is used in a function parameter
17332 pack. If this is the end of the parameter list, the
17333 template parameter pack is deducible. */
17334 if (TREE_CHAIN (t
) == void_list_node
)
17337 /* Otherwise, not. Well, it could be deduced from
17338 a non-pack parameter, but doing so would end up with
17339 a deduction mismatch, so don't bother. */
17343 /* The template parameter pack isn't used in any function parameter
17344 packs, but it might be used deeper, e.g. tuple<Args...>. */
17348 /* The FN is a TEMPLATE_DECL for a function. ARGS is an array with
17349 NARGS elements of the arguments that are being used when calling
17350 it. TARGS is a vector into which the deduced template arguments
17353 Returns either a FUNCTION_DECL for the matching specialization of FN or
17354 NULL_TREE if no suitable specialization can be found. If EXPLAIN_P is
17355 true, diagnostics will be printed to explain why it failed.
17357 If FN is a conversion operator, or we are trying to produce a specific
17358 specialization, RETURN_TYPE is the return type desired.
17360 The EXPLICIT_TARGS are explicit template arguments provided via a
17363 The parameter STRICT is one of:
17366 We are deducing arguments for a function call, as in
17367 [temp.deduct.call]. If RETURN_TYPE is non-null, we are
17368 deducing arguments for a call to the result of a conversion
17369 function template, as in [over.call.object].
17372 We are deducing arguments for a conversion function, as in
17373 [temp.deduct.conv].
17376 We are deducing arguments when doing an explicit instantiation
17377 as in [temp.explicit], when determining an explicit specialization
17378 as in [temp.expl.spec], or when taking the address of a function
17379 template, as in [temp.deduct.funcaddr]. */
17382 fn_type_unification (tree fn
,
17383 tree explicit_targs
,
17386 unsigned int nargs
,
17388 unification_kind_t strict
,
17395 tree decl
= NULL_TREE
;
17396 tsubst_flags_t complain
= (explain_p
? tf_warning_or_error
: tf_none
);
17398 static int deduction_depth
;
17399 struct pending_template
*old_last_pend
= last_pending_template
;
17400 struct tinst_level
*old_error_tinst
= last_error_tinst_level
;
17401 tree tparms
= DECL_INNERMOST_TEMPLATE_PARMS (fn
);
17403 tree r
= error_mark_node
;
17406 complain
|= tf_decltype
;
17408 /* In C++0x, it's possible to have a function template whose type depends
17409 on itself recursively. This is most obvious with decltype, but can also
17410 occur with enumeration scope (c++/48969). So we need to catch infinite
17411 recursion and reject the substitution at deduction time; this function
17412 will return error_mark_node for any repeated substitution.
17414 This also catches excessive recursion such as when f<N> depends on
17415 f<N-1> across all integers, and returns error_mark_node for all the
17416 substitutions back up to the initial one.
17418 This is, of course, not reentrant. */
17419 if (excessive_deduction_depth
)
17420 return error_mark_node
;
17421 tinst
= build_tree_list (fn
, NULL_TREE
);
17424 gcc_assert (TREE_CODE (fn
) == TEMPLATE_DECL
);
17426 fntype
= TREE_TYPE (fn
);
17427 if (explicit_targs
)
17431 The specified template arguments must match the template
17432 parameters in kind (i.e., type, nontype, template), and there
17433 must not be more arguments than there are parameters;
17434 otherwise type deduction fails.
17436 Nontype arguments must match the types of the corresponding
17437 nontype template parameters, or must be convertible to the
17438 types of the corresponding nontype parameters as specified in
17439 _temp.arg.nontype_, otherwise type deduction fails.
17441 All references in the function type of the function template
17442 to the corresponding template parameters are replaced by the
17443 specified template argument values. If a substitution in a
17444 template parameter or in the function type of the function
17445 template results in an invalid type, type deduction fails. */
17446 int i
, len
= TREE_VEC_LENGTH (tparms
);
17447 location_t loc
= input_location
;
17448 bool incomplete
= false;
17450 /* Adjust any explicit template arguments before entering the
17451 substitution context. */
17453 = (coerce_template_parms (tparms
, explicit_targs
, NULL_TREE
,
17455 /*require_all_args=*/false,
17456 /*use_default_args=*/false));
17457 if (explicit_targs
== error_mark_node
)
17460 /* Substitute the explicit args into the function type. This is
17461 necessary so that, for instance, explicitly declared function
17462 arguments can match null pointed constants. If we were given
17463 an incomplete set of explicit args, we must not do semantic
17464 processing during substitution as we could create partial
17466 for (i
= 0; i
< len
; i
++)
17468 tree parm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
17469 bool parameter_pack
= false;
17470 tree targ
= TREE_VEC_ELT (explicit_targs
, i
);
17472 /* Dig out the actual parm. */
17473 if (TREE_CODE (parm
) == TYPE_DECL
17474 || TREE_CODE (parm
) == TEMPLATE_DECL
)
17476 parm
= TREE_TYPE (parm
);
17477 parameter_pack
= TEMPLATE_TYPE_PARAMETER_PACK (parm
);
17479 else if (TREE_CODE (parm
) == PARM_DECL
)
17481 parm
= DECL_INITIAL (parm
);
17482 parameter_pack
= TEMPLATE_PARM_PARAMETER_PACK (parm
);
17485 if (!parameter_pack
&& targ
== NULL_TREE
)
17486 /* No explicit argument for this template parameter. */
17489 if (parameter_pack
&& pack_deducible_p (parm
, fn
))
17491 /* Mark the argument pack as "incomplete". We could
17492 still deduce more arguments during unification.
17493 We remove this mark in type_unification_real. */
17496 ARGUMENT_PACK_INCOMPLETE_P(targ
) = 1;
17497 ARGUMENT_PACK_EXPLICIT_ARGS (targ
)
17498 = ARGUMENT_PACK_ARGS (targ
);
17501 /* We have some incomplete argument packs. */
17506 TREE_VALUE (tinst
) = explicit_targs
;
17507 if (!push_tinst_level (tinst
))
17509 excessive_deduction_depth
= true;
17512 processing_template_decl
+= incomplete
;
17513 input_location
= DECL_SOURCE_LOCATION (fn
);
17514 /* Ignore any access checks; we'll see them again in
17515 instantiate_template and they might have the wrong
17516 access path at this point. */
17517 push_deferring_access_checks (dk_deferred
);
17518 fntype
= tsubst (TREE_TYPE (fn
), explicit_targs
,
17519 complain
| tf_partial
, NULL_TREE
);
17520 pop_deferring_access_checks ();
17521 input_location
= loc
;
17522 processing_template_decl
-= incomplete
;
17523 pop_tinst_level ();
17525 if (fntype
== error_mark_node
)
17528 /* Place the explicitly specified arguments in TARGS. */
17529 for (i
= NUM_TMPL_ARGS (explicit_targs
); i
--;)
17530 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (explicit_targs
, i
);
17533 /* Never do unification on the 'this' parameter. */
17534 parms
= skip_artificial_parms_for (fn
, TYPE_ARG_TYPES (fntype
));
17536 if (return_type
&& strict
== DEDUCE_CALL
)
17538 /* We're deducing for a call to the result of a template conversion
17539 function. The parms we really want are in return_type. */
17540 if (POINTER_TYPE_P (return_type
))
17541 return_type
= TREE_TYPE (return_type
);
17542 parms
= TYPE_ARG_TYPES (return_type
);
17544 else if (return_type
)
17548 parms
= tree_cons (NULL_TREE
, TREE_TYPE (fntype
), parms
);
17549 new_args
= XALLOCAVEC (tree
, nargs
+ 1);
17550 new_args
[0] = return_type
;
17551 memcpy (new_args
+ 1, args
, nargs
* sizeof (tree
));
17556 /* We allow incomplete unification without an error message here
17557 because the standard doesn't seem to explicitly prohibit it. Our
17558 callers must be ready to deal with unification failures in any
17561 TREE_VALUE (tinst
) = targs
;
17562 /* If we aren't explaining yet, push tinst context so we can see where
17563 any errors (e.g. from class instantiations triggered by instantiation
17564 of default template arguments) come from. If we are explaining, this
17565 context is redundant. */
17566 if (!explain_p
&& !push_tinst_level (tinst
))
17568 excessive_deduction_depth
= true;
17572 /* type_unification_real will pass back any access checks from default
17573 template argument substitution. */
17574 vec
<deferred_access_check
, va_gc
> *checks
;
17577 ok
= !type_unification_real (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
17578 targs
, parms
, args
, nargs
, /*subr=*/0,
17579 strict
, flags
, &checks
, explain_p
);
17581 pop_tinst_level ();
17585 /* Now that we have bindings for all of the template arguments,
17586 ensure that the arguments deduced for the template template
17587 parameters have compatible template parameter lists. We cannot
17588 check this property before we have deduced all template
17589 arguments, because the template parameter types of a template
17590 template parameter might depend on prior template parameters
17591 deduced after the template template parameter. The following
17592 ill-formed example illustrates this issue:
17594 template<typename T, template<T> class C> void f(C<5>, T);
17596 template<int N> struct X {};
17599 f(X<5>(), 5l); // error: template argument deduction fails
17602 The template parameter list of 'C' depends on the template type
17603 parameter 'T', but 'C' is deduced to 'X' before 'T' is deduced to
17604 'long'. Thus, we can't check that 'C' cannot bind to 'X' at the
17605 time that we deduce 'C'. */
17606 if (!template_template_parm_bindings_ok_p
17607 (DECL_INNERMOST_TEMPLATE_PARMS (fn
), targs
))
17609 unify_inconsistent_template_template_parameters (explain_p
);
17613 /* All is well so far. Now, check:
17617 When all template arguments have been deduced, all uses of
17618 template parameters in nondeduced contexts are replaced with
17619 the corresponding deduced argument values. If the
17620 substitution results in an invalid type, as described above,
17621 type deduction fails. */
17622 TREE_VALUE (tinst
) = targs
;
17623 if (!push_tinst_level (tinst
))
17625 excessive_deduction_depth
= true;
17629 /* Also collect access checks from the instantiation. */
17630 reopen_deferring_access_checks (checks
);
17632 decl
= instantiate_template (fn
, targs
, complain
);
17634 checks
= get_deferred_access_checks ();
17635 pop_deferring_access_checks ();
17637 pop_tinst_level ();
17639 if (decl
== error_mark_node
)
17642 /* Now perform any access checks encountered during substitution. */
17643 push_access_scope (decl
);
17644 ok
= perform_access_checks (checks
, complain
);
17645 pop_access_scope (decl
);
17649 /* If we're looking for an exact match, check that what we got
17650 is indeed an exact match. It might not be if some template
17651 parameters are used in non-deduced contexts. But don't check
17652 for an exact match if we have dependent template arguments;
17653 in that case we're doing partial ordering, and we already know
17654 that we have two candidates that will provide the actual type. */
17655 if (strict
== DEDUCE_EXACT
&& !any_dependent_template_arguments_p (targs
))
17657 tree substed
= TREE_TYPE (decl
);
17661 = skip_artificial_parms_for (decl
, TYPE_ARG_TYPES (substed
));
17663 sarg
= tree_cons (NULL_TREE
, TREE_TYPE (substed
), sarg
);
17664 for (i
= 0; i
< nargs
&& sarg
; ++i
, sarg
= TREE_CHAIN (sarg
))
17665 if (!same_type_p (args
[i
], TREE_VALUE (sarg
)))
17667 unify_type_mismatch (explain_p
, args
[i
],
17668 TREE_VALUE (sarg
));
17677 if (excessive_deduction_depth
)
17679 if (deduction_depth
== 0)
17680 /* Reset once we're all the way out. */
17681 excessive_deduction_depth
= false;
17684 /* We can't free this if a pending_template entry or last_error_tinst_level
17685 is pointing at it. */
17686 if (last_pending_template
== old_last_pend
17687 && last_error_tinst_level
== old_error_tinst
)
17693 /* Adjust types before performing type deduction, as described in
17694 [temp.deduct.call] and [temp.deduct.conv]. The rules in these two
17695 sections are symmetric. PARM is the type of a function parameter
17696 or the return type of the conversion function. ARG is the type of
17697 the argument passed to the call, or the type of the value
17698 initialized with the result of the conversion function.
17699 ARG_EXPR is the original argument expression, which may be null. */
17702 maybe_adjust_types_for_deduction (unification_kind_t strict
,
17715 /* Swap PARM and ARG throughout the remainder of this
17716 function; the handling is precisely symmetric since PARM
17717 will initialize ARG rather than vice versa. */
17718 std::swap (parm
, arg
);
17722 /* Core issue #873: Do the DR606 thing (see below) for these cases,
17723 too, but here handle it by stripping the reference from PARM
17724 rather than by adding it to ARG. */
17725 if (TREE_CODE (*parm
) == REFERENCE_TYPE
17726 && TYPE_REF_IS_RVALUE (*parm
)
17727 && TREE_CODE (TREE_TYPE (*parm
)) == TEMPLATE_TYPE_PARM
17728 && cp_type_quals (TREE_TYPE (*parm
)) == TYPE_UNQUALIFIED
17729 && TREE_CODE (*arg
) == REFERENCE_TYPE
17730 && !TYPE_REF_IS_RVALUE (*arg
))
17731 *parm
= TREE_TYPE (*parm
);
17732 /* Nothing else to do in this case. */
17736 gcc_unreachable ();
17739 if (TREE_CODE (*parm
) != REFERENCE_TYPE
)
17741 /* [temp.deduct.call]
17743 If P is not a reference type:
17745 --If A is an array type, the pointer type produced by the
17746 array-to-pointer standard conversion (_conv.array_) is
17747 used in place of A for type deduction; otherwise,
17749 --If A is a function type, the pointer type produced by
17750 the function-to-pointer standard conversion
17751 (_conv.func_) is used in place of A for type deduction;
17754 --If A is a cv-qualified type, the top level
17755 cv-qualifiers of A's type are ignored for type
17757 if (TREE_CODE (*arg
) == ARRAY_TYPE
)
17758 *arg
= build_pointer_type (TREE_TYPE (*arg
));
17759 else if (TREE_CODE (*arg
) == FUNCTION_TYPE
)
17760 *arg
= build_pointer_type (*arg
);
17762 *arg
= TYPE_MAIN_VARIANT (*arg
);
17765 /* From C++0x [14.8.2.1/3 temp.deduct.call] (after DR606), "If P is
17766 of the form T&&, where T is a template parameter, and the argument
17767 is an lvalue, T is deduced as A& */
17768 if (TREE_CODE (*parm
) == REFERENCE_TYPE
17769 && TYPE_REF_IS_RVALUE (*parm
)
17770 && TREE_CODE (TREE_TYPE (*parm
)) == TEMPLATE_TYPE_PARM
17771 && cp_type_quals (TREE_TYPE (*parm
)) == TYPE_UNQUALIFIED
17772 && (arg_expr
? real_lvalue_p (arg_expr
)
17773 /* try_one_overload doesn't provide an arg_expr, but
17774 functions are always lvalues. */
17775 : TREE_CODE (*arg
) == FUNCTION_TYPE
))
17776 *arg
= build_reference_type (*arg
);
17778 /* [temp.deduct.call]
17780 If P is a cv-qualified type, the top level cv-qualifiers
17781 of P's type are ignored for type deduction. If P is a
17782 reference type, the type referred to by P is used for
17784 *parm
= TYPE_MAIN_VARIANT (*parm
);
17785 if (TREE_CODE (*parm
) == REFERENCE_TYPE
)
17787 *parm
= TREE_TYPE (*parm
);
17788 result
|= UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
17791 /* DR 322. For conversion deduction, remove a reference type on parm
17792 too (which has been swapped into ARG). */
17793 if (strict
== DEDUCE_CONV
&& TREE_CODE (*arg
) == REFERENCE_TYPE
)
17794 *arg
= TREE_TYPE (*arg
);
17799 /* Subroutine of unify_one_argument. PARM is a function parameter of a
17800 template which does contain any deducible template parameters; check if
17801 ARG is a suitable match for it. STRICT, FLAGS and EXPLAIN_P are as in
17802 unify_one_argument. */
17805 check_non_deducible_conversion (tree parm
, tree arg
, int strict
,
17806 int flags
, bool explain_p
)
17811 type
= TREE_TYPE (arg
);
17815 if (same_type_p (parm
, type
))
17816 return unify_success (explain_p
);
17818 if (strict
== DEDUCE_CONV
)
17820 if (can_convert_arg (type
, parm
, NULL_TREE
, flags
,
17821 explain_p
? tf_warning_or_error
: tf_none
))
17822 return unify_success (explain_p
);
17824 else if (strict
!= DEDUCE_EXACT
)
17826 if (can_convert_arg (parm
, type
,
17827 TYPE_P (arg
) ? NULL_TREE
: arg
,
17828 flags
, explain_p
? tf_warning_or_error
: tf_none
))
17829 return unify_success (explain_p
);
17832 if (strict
== DEDUCE_EXACT
)
17833 return unify_type_mismatch (explain_p
, parm
, arg
);
17835 return unify_arg_conversion (explain_p
, parm
, type
, arg
);
17838 static bool uses_deducible_template_parms (tree type
);
17840 /* Returns true iff the expression EXPR is one from which a template
17841 argument can be deduced. In other words, if it's an undecorated
17842 use of a template non-type parameter. */
17845 deducible_expression (tree expr
)
17847 return (TREE_CODE (expr
) == TEMPLATE_PARM_INDEX
);
17850 /* Returns true iff the array domain DOMAIN uses a template parameter in a
17851 deducible way; that is, if it has a max value of <PARM> - 1. */
17854 deducible_array_bound (tree domain
)
17856 if (domain
== NULL_TREE
)
17859 tree max
= TYPE_MAX_VALUE (domain
);
17860 if (TREE_CODE (max
) != MINUS_EXPR
)
17863 return deducible_expression (TREE_OPERAND (max
, 0));
17866 /* Returns true iff the template arguments ARGS use a template parameter
17867 in a deducible way. */
17870 deducible_template_args (tree args
)
17872 for (int i
= 0; i
< TREE_VEC_LENGTH (args
); ++i
)
17875 tree elt
= TREE_VEC_ELT (args
, i
);
17876 if (ARGUMENT_PACK_P (elt
))
17877 deducible
= deducible_template_args (ARGUMENT_PACK_ARGS (elt
));
17880 if (PACK_EXPANSION_P (elt
))
17881 elt
= PACK_EXPANSION_PATTERN (elt
);
17882 if (TREE_CODE (elt
) == TEMPLATE_TEMPLATE_PARM
)
17884 else if (TYPE_P (elt
))
17885 deducible
= uses_deducible_template_parms (elt
);
17887 deducible
= deducible_expression (elt
);
17895 /* Returns true iff TYPE contains any deducible references to template
17896 parameters, as per 14.8.2.5. */
17899 uses_deducible_template_parms (tree type
)
17901 if (PACK_EXPANSION_P (type
))
17902 type
= PACK_EXPANSION_PATTERN (type
);
17909 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
17910 || TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
17916 if (POINTER_TYPE_P (type
))
17917 return uses_deducible_template_parms (TREE_TYPE (type
));
17919 /* T[integer-constant ]
17921 if (TREE_CODE (type
) == ARRAY_TYPE
)
17922 return (uses_deducible_template_parms (TREE_TYPE (type
))
17923 || deducible_array_bound (TYPE_DOMAIN (type
)));
17935 if (TYPE_PTRMEM_P (type
))
17936 return (uses_deducible_template_parms (TYPE_PTRMEM_CLASS_TYPE (type
))
17937 || (uses_deducible_template_parms
17938 (TYPE_PTRMEM_POINTED_TO_TYPE (type
))));
17940 /* template-name <T> (where template-name refers to a class template)
17941 template-name <i> (where template-name refers to a class template) */
17942 if (CLASS_TYPE_P (type
)
17943 && CLASSTYPE_TEMPLATE_INFO (type
)
17944 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (type
)))
17945 return deducible_template_args (INNERMOST_TEMPLATE_ARGS
17946 (CLASSTYPE_TI_ARGS (type
)));
17951 if (TREE_CODE (type
) == FUNCTION_TYPE
17952 || TREE_CODE (type
) == METHOD_TYPE
)
17954 if (uses_deducible_template_parms (TREE_TYPE (type
)))
17956 tree parm
= TYPE_ARG_TYPES (type
);
17957 if (TREE_CODE (type
) == METHOD_TYPE
)
17958 parm
= TREE_CHAIN (parm
);
17959 for (; parm
; parm
= TREE_CHAIN (parm
))
17960 if (uses_deducible_template_parms (TREE_VALUE (parm
)))
17967 /* Subroutine of type_unification_real and unify_pack_expansion to
17968 handle unification of a single P/A pair. Parameters are as
17969 for those functions. */
17972 unify_one_argument (tree tparms
, tree targs
, tree parm
, tree arg
,
17973 int subr
, unification_kind_t strict
,
17976 tree arg_expr
= NULL_TREE
;
17979 if (arg
== error_mark_node
|| parm
== error_mark_node
)
17980 return unify_invalid (explain_p
);
17981 if (arg
== unknown_type_node
)
17982 /* We can't deduce anything from this, but we might get all the
17983 template args from other function args. */
17984 return unify_success (explain_p
);
17986 /* Implicit conversions (Clause 4) will be performed on a function
17987 argument to convert it to the type of the corresponding function
17988 parameter if the parameter type contains no template-parameters that
17989 participate in template argument deduction. */
17990 if (strict
!= DEDUCE_EXACT
17991 && TYPE_P (parm
) && !uses_deducible_template_parms (parm
))
17992 /* For function parameters with no deducible template parameters,
17993 just return. We'll check non-dependent conversions later. */
17994 return unify_success (explain_p
);
17999 arg_strict
= (UNIFY_ALLOW_OUTER_LEVEL
18000 | UNIFY_ALLOW_MORE_CV_QUAL
18001 | UNIFY_ALLOW_DERIVED
);
18005 arg_strict
= UNIFY_ALLOW_LESS_CV_QUAL
;
18009 arg_strict
= UNIFY_ALLOW_NONE
;
18013 gcc_unreachable ();
18016 /* We only do these transformations if this is the top-level
18017 parameter_type_list in a call or declaration matching; in other
18018 situations (nested function declarators, template argument lists) we
18019 won't be comparing a type to an expression, and we don't do any type
18025 gcc_assert (TREE_TYPE (arg
) != NULL_TREE
);
18026 if (type_unknown_p (arg
))
18028 /* [temp.deduct.type] A template-argument can be
18029 deduced from a pointer to function or pointer
18030 to member function argument if the set of
18031 overloaded functions does not contain function
18032 templates and at most one of a set of
18033 overloaded functions provides a unique
18036 if (resolve_overloaded_unification
18037 (tparms
, targs
, parm
, arg
, strict
,
18038 arg_strict
, explain_p
))
18039 return unify_success (explain_p
);
18040 return unify_overload_resolution_failure (explain_p
, arg
);
18044 arg
= unlowered_expr_type (arg
);
18045 if (arg
== error_mark_node
)
18046 return unify_invalid (explain_p
);
18050 maybe_adjust_types_for_deduction (strict
, &parm
, &arg
, arg_expr
);
18053 if ((TYPE_P (parm
) || TREE_CODE (parm
) == TEMPLATE_DECL
)
18054 != (TYPE_P (arg
) || TREE_CODE (arg
) == TEMPLATE_DECL
))
18055 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
18057 /* For deduction from an init-list we need the actual list. */
18058 if (arg_expr
&& BRACE_ENCLOSED_INITIALIZER_P (arg_expr
))
18060 return unify (tparms
, targs
, parm
, arg
, arg_strict
, explain_p
);
18063 /* Most parms like fn_type_unification.
18065 If SUBR is 1, we're being called recursively (to unify the
18066 arguments of a function or method parameter of a function
18069 CHECKS is a pointer to a vector of access checks encountered while
18070 substituting default template arguments. */
18073 type_unification_real (tree tparms
,
18077 unsigned int xnargs
,
18079 unification_kind_t strict
,
18081 vec
<deferred_access_check
, va_gc
> **checks
,
18086 int ntparms
= TREE_VEC_LENGTH (tparms
);
18087 int saw_undeduced
= 0;
18090 unsigned int nargs
;
18093 gcc_assert (TREE_CODE (tparms
) == TREE_VEC
);
18094 gcc_assert (xparms
== NULL_TREE
|| TREE_CODE (xparms
) == TREE_LIST
);
18095 gcc_assert (ntparms
> 0);
18097 /* Reset the number of non-defaulted template arguments contained
18099 NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
) = NULL_TREE
;
18107 while (parms
&& parms
!= void_list_node
18110 parm
= TREE_VALUE (parms
);
18112 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
18113 && (!TREE_CHAIN (parms
) || TREE_CHAIN (parms
) == void_list_node
))
18114 /* For a function parameter pack that occurs at the end of the
18115 parameter-declaration-list, the type A of each remaining
18116 argument of the call is compared with the type P of the
18117 declarator-id of the function parameter pack. */
18120 parms
= TREE_CHAIN (parms
);
18122 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
)
18123 /* For a function parameter pack that does not occur at the
18124 end of the parameter-declaration-list, the type of the
18125 parameter pack is a non-deduced context. */
18131 if (unify_one_argument (tparms
, targs
, parm
, arg
, subr
, strict
,
18137 && parms
!= void_list_node
18138 && TREE_CODE (TREE_VALUE (parms
)) == TYPE_PACK_EXPANSION
)
18140 /* Unify the remaining arguments with the pack expansion type. */
18142 tree parmvec
= make_tree_vec (1);
18144 /* Allocate a TREE_VEC and copy in all of the arguments */
18145 argvec
= make_tree_vec (nargs
- ia
);
18146 for (i
= 0; ia
< nargs
; ++ia
, ++i
)
18147 TREE_VEC_ELT (argvec
, i
) = args
[ia
];
18149 /* Copy the parameter into parmvec. */
18150 TREE_VEC_ELT (parmvec
, 0) = TREE_VALUE (parms
);
18151 if (unify_pack_expansion (tparms
, targs
, parmvec
, argvec
, strict
,
18152 /*subr=*/subr
, explain_p
))
18155 /* Advance to the end of the list of parameters. */
18156 parms
= TREE_CHAIN (parms
);
18159 /* Fail if we've reached the end of the parm list, and more args
18160 are present, and the parm list isn't variadic. */
18161 if (ia
< nargs
&& parms
== void_list_node
)
18162 return unify_too_many_arguments (explain_p
, nargs
, ia
);
18163 /* Fail if parms are left and they don't have default values and
18164 they aren't all deduced as empty packs (c++/57397). This is
18165 consistent with sufficient_parms_p. */
18166 if (parms
&& parms
!= void_list_node
18167 && TREE_PURPOSE (parms
) == NULL_TREE
)
18169 unsigned int count
= nargs
;
18174 type_pack_p
= TREE_CODE (TREE_VALUE (p
)) == TYPE_PACK_EXPANSION
;
18177 p
= TREE_CHAIN (p
);
18179 while (p
&& p
!= void_list_node
);
18180 if (count
!= nargs
)
18181 return unify_too_few_arguments (explain_p
, ia
, count
,
18187 tsubst_flags_t complain
= (explain_p
18188 ? tf_warning_or_error
18191 for (i
= 0; i
< ntparms
; i
++)
18193 tree targ
= TREE_VEC_ELT (targs
, i
);
18194 tree tparm
= TREE_VEC_ELT (tparms
, i
);
18196 /* Clear the "incomplete" flags on all argument packs now so that
18197 substituting them into later default arguments works. */
18198 if (targ
&& ARGUMENT_PACK_P (targ
))
18200 ARGUMENT_PACK_INCOMPLETE_P (targ
) = 0;
18201 ARGUMENT_PACK_EXPLICIT_ARGS (targ
) = NULL_TREE
;
18204 if (targ
|| tparm
== error_mark_node
)
18206 tparm
= TREE_VALUE (tparm
);
18208 /* If this is an undeduced nontype parameter that depends on
18209 a type parameter, try another pass; its type may have been
18210 deduced from a later argument than the one from which
18211 this parameter can be deduced. */
18212 if (TREE_CODE (tparm
) == PARM_DECL
18213 && uses_template_parms (TREE_TYPE (tparm
))
18214 && saw_undeduced
< 2)
18220 /* Core issue #226 (C++0x) [temp.deduct]:
18222 If a template argument has not been deduced, its
18223 default template argument, if any, is used.
18225 When we are in C++98 mode, TREE_PURPOSE will either
18226 be NULL_TREE or ERROR_MARK_NODE, so we do not need
18227 to explicitly check cxx_dialect here. */
18228 if (TREE_PURPOSE (TREE_VEC_ELT (tparms
, i
)))
18229 /* OK, there is a default argument. Wait until after the
18230 conversion check to do substitution. */
18233 /* If the type parameter is a parameter pack, then it will
18234 be deduced to an empty parameter pack. */
18235 if (template_parameter_pack_p (tparm
))
18239 if (TREE_CODE (tparm
) == TEMPLATE_PARM_INDEX
)
18241 arg
= make_node (NONTYPE_ARGUMENT_PACK
);
18242 TREE_TYPE (arg
) = TREE_TYPE (TEMPLATE_PARM_DECL (tparm
));
18243 TREE_CONSTANT (arg
) = 1;
18246 arg
= cxx_make_type (TYPE_ARGUMENT_PACK
);
18248 SET_ARGUMENT_PACK_ARGS (arg
, make_tree_vec (0));
18250 TREE_VEC_ELT (targs
, i
) = arg
;
18254 return unify_parameter_deduction_failure (explain_p
, tparm
);
18257 /* DR 1391: All parameters have args, now check non-dependent parms for
18259 if (saw_undeduced
< 2)
18260 for (ia
= 0, parms
= xparms
, args
= xargs
, nargs
= xnargs
;
18261 parms
&& parms
!= void_list_node
&& ia
< nargs
; )
18263 parm
= TREE_VALUE (parms
);
18265 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
18266 && (!TREE_CHAIN (parms
)
18267 || TREE_CHAIN (parms
) == void_list_node
))
18268 /* For a function parameter pack that occurs at the end of the
18269 parameter-declaration-list, the type A of each remaining
18270 argument of the call is compared with the type P of the
18271 declarator-id of the function parameter pack. */
18274 parms
= TREE_CHAIN (parms
);
18276 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
)
18277 /* For a function parameter pack that does not occur at the
18278 end of the parameter-declaration-list, the type of the
18279 parameter pack is a non-deduced context. */
18285 if (uses_template_parms (parm
))
18287 if (check_non_deducible_conversion (parm
, arg
, strict
, flags
,
18292 /* Now substitute into the default template arguments. */
18293 for (i
= 0; i
< ntparms
; i
++)
18295 tree targ
= TREE_VEC_ELT (targs
, i
);
18296 tree tparm
= TREE_VEC_ELT (tparms
, i
);
18298 if (targ
|| tparm
== error_mark_node
)
18300 tree parm
= TREE_VALUE (tparm
);
18302 if (TREE_CODE (parm
) == PARM_DECL
18303 && uses_template_parms (TREE_TYPE (parm
))
18304 && saw_undeduced
< 2)
18307 tree arg
= TREE_PURPOSE (tparm
);
18308 reopen_deferring_access_checks (*checks
);
18309 location_t save_loc
= input_location
;
18311 input_location
= DECL_SOURCE_LOCATION (parm
);
18312 arg
= tsubst_template_arg (arg
, targs
, complain
, NULL_TREE
);
18313 arg
= convert_template_argument (parm
, arg
, targs
, complain
,
18315 input_location
= save_loc
;
18316 *checks
= get_deferred_access_checks ();
18317 pop_deferring_access_checks ();
18318 if (arg
== error_mark_node
)
18322 TREE_VEC_ELT (targs
, i
) = arg
;
18323 /* The position of the first default template argument,
18324 is also the number of non-defaulted arguments in TARGS.
18326 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
))
18327 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
, i
);
18332 if (saw_undeduced
++ == 1)
18336 if (CHECKING_P
&& !NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
))
18337 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
, TREE_VEC_LENGTH (targs
));
18339 return unify_success (explain_p
);
18342 /* Subroutine of type_unification_real. Args are like the variables
18343 at the call site. ARG is an overloaded function (or template-id);
18344 we try deducing template args from each of the overloads, and if
18345 only one succeeds, we go with that. Modifies TARGS and returns
18346 true on success. */
18349 resolve_overloaded_unification (tree tparms
,
18353 unification_kind_t strict
,
18357 tree tempargs
= copy_node (targs
);
18359 tree goodfn
= NULL_TREE
;
18362 if (TREE_CODE (arg
) == ADDR_EXPR
)
18364 arg
= TREE_OPERAND (arg
, 0);
18370 if (TREE_CODE (arg
) == COMPONENT_REF
)
18371 /* Handle `&x' where `x' is some static or non-static member
18373 arg
= TREE_OPERAND (arg
, 1);
18375 if (TREE_CODE (arg
) == OFFSET_REF
)
18376 arg
= TREE_OPERAND (arg
, 1);
18378 /* Strip baselink information. */
18379 if (BASELINK_P (arg
))
18380 arg
= BASELINK_FUNCTIONS (arg
);
18382 if (TREE_CODE (arg
) == TEMPLATE_ID_EXPR
)
18384 /* If we got some explicit template args, we need to plug them into
18385 the affected templates before we try to unify, in case the
18386 explicit args will completely resolve the templates in question. */
18389 tree expl_subargs
= TREE_OPERAND (arg
, 1);
18390 arg
= TREE_OPERAND (arg
, 0);
18392 for (; arg
; arg
= OVL_NEXT (arg
))
18394 tree fn
= OVL_CURRENT (arg
);
18395 tree subargs
, elem
;
18397 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
18400 subargs
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
18401 expl_subargs
, NULL_TREE
, tf_none
,
18402 /*require_all_args=*/true,
18403 /*use_default_args=*/true);
18404 if (subargs
!= error_mark_node
18405 && !any_dependent_template_arguments_p (subargs
))
18407 elem
= TREE_TYPE (instantiate_template (fn
, subargs
, tf_none
));
18408 if (try_one_overload (tparms
, targs
, tempargs
, parm
,
18409 elem
, strict
, sub_strict
, addr_p
, explain_p
)
18410 && (!goodfn
|| !same_type_p (goodfn
, elem
)))
18419 /* If no templates (or more than one) are fully resolved by the
18420 explicit arguments, this template-id is a non-deduced context; it
18421 could still be OK if we deduce all template arguments for the
18422 enclosing call through other arguments. */
18426 else if (TREE_CODE (arg
) != OVERLOAD
18427 && TREE_CODE (arg
) != FUNCTION_DECL
)
18428 /* If ARG is, for example, "(0, &f)" then its type will be unknown
18429 -- but the deduction does not succeed because the expression is
18430 not just the function on its own. */
18433 for (; arg
; arg
= OVL_NEXT (arg
))
18434 if (try_one_overload (tparms
, targs
, tempargs
, parm
,
18435 TREE_TYPE (OVL_CURRENT (arg
)),
18436 strict
, sub_strict
, addr_p
, explain_p
)
18437 && (!goodfn
|| !decls_match (goodfn
, OVL_CURRENT (arg
))))
18439 goodfn
= OVL_CURRENT (arg
);
18443 /* [temp.deduct.type] A template-argument can be deduced from a pointer
18444 to function or pointer to member function argument if the set of
18445 overloaded functions does not contain function templates and at most
18446 one of a set of overloaded functions provides a unique match.
18448 So if we found multiple possibilities, we return success but don't
18449 deduce anything. */
18453 int i
= TREE_VEC_LENGTH (targs
);
18455 if (TREE_VEC_ELT (tempargs
, i
))
18457 tree old
= TREE_VEC_ELT (targs
, i
);
18458 tree new_
= TREE_VEC_ELT (tempargs
, i
);
18459 if (new_
&& old
&& ARGUMENT_PACK_P (old
)
18460 && ARGUMENT_PACK_EXPLICIT_ARGS (old
))
18461 /* Don't forget explicit template arguments in a pack. */
18462 ARGUMENT_PACK_EXPLICIT_ARGS (new_
)
18463 = ARGUMENT_PACK_EXPLICIT_ARGS (old
);
18464 TREE_VEC_ELT (targs
, i
) = new_
;
18473 /* Core DR 115: In contexts where deduction is done and fails, or in
18474 contexts where deduction is not done, if a template argument list is
18475 specified and it, along with any default template arguments, identifies
18476 a single function template specialization, then the template-id is an
18477 lvalue for the function template specialization. */
18480 resolve_nondeduced_context (tree orig_expr
)
18482 tree expr
, offset
, baselink
;
18485 if (!type_unknown_p (orig_expr
))
18490 offset
= NULL_TREE
;
18491 baselink
= NULL_TREE
;
18493 if (TREE_CODE (expr
) == ADDR_EXPR
)
18495 expr
= TREE_OPERAND (expr
, 0);
18498 if (TREE_CODE (expr
) == OFFSET_REF
)
18501 expr
= TREE_OPERAND (expr
, 1);
18503 if (BASELINK_P (expr
))
18506 expr
= BASELINK_FUNCTIONS (expr
);
18509 if (TREE_CODE (expr
) == TEMPLATE_ID_EXPR
)
18512 tree goodfn
= NULL_TREE
;
18514 /* If we got some explicit template args, we need to plug them into
18515 the affected templates before we try to unify, in case the
18516 explicit args will completely resolve the templates in question. */
18518 tree expl_subargs
= TREE_OPERAND (expr
, 1);
18519 tree arg
= TREE_OPERAND (expr
, 0);
18520 tree badfn
= NULL_TREE
;
18521 tree badargs
= NULL_TREE
;
18523 for (; arg
; arg
= OVL_NEXT (arg
))
18525 tree fn
= OVL_CURRENT (arg
);
18526 tree subargs
, elem
;
18528 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
18531 subargs
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
18532 expl_subargs
, NULL_TREE
, tf_none
,
18533 /*require_all_args=*/true,
18534 /*use_default_args=*/true);
18535 if (subargs
!= error_mark_node
18536 && !any_dependent_template_arguments_p (subargs
))
18538 elem
= instantiate_template (fn
, subargs
, tf_none
);
18539 if (elem
== error_mark_node
)
18544 else if (elem
&& (!goodfn
|| !decls_match (goodfn
, elem
)))
18553 mark_used (goodfn
);
18556 expr
= build_baselink (BASELINK_BINFO (baselink
),
18557 BASELINK_ACCESS_BINFO (baselink
),
18558 expr
, BASELINK_OPTYPE (baselink
));
18562 = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (offset
, 0)));
18563 expr
= build_offset_ref (base
, expr
, addr
, tf_warning_or_error
);
18566 expr
= cp_build_addr_expr (expr
, tf_warning_or_error
);
18569 else if (good
== 0 && badargs
)
18570 /* There were no good options and at least one bad one, so let the
18571 user know what the problem is. */
18572 instantiate_template (badfn
, badargs
, tf_warning_or_error
);
18577 /* Subroutine of resolve_overloaded_unification; does deduction for a single
18578 overload. Fills TARGS with any deduced arguments, or error_mark_node if
18579 different overloads deduce different arguments for a given parm.
18580 ADDR_P is true if the expression for which deduction is being
18581 performed was of the form "& fn" rather than simply "fn".
18583 Returns 1 on success. */
18586 try_one_overload (tree tparms
,
18591 unification_kind_t strict
,
18600 if (arg
== error_mark_node
)
18603 /* [temp.deduct.type] A template-argument can be deduced from a pointer
18604 to function or pointer to member function argument if the set of
18605 overloaded functions does not contain function templates and at most
18606 one of a set of overloaded functions provides a unique match.
18608 So if this is a template, just return success. */
18610 if (uses_template_parms (arg
))
18613 if (TREE_CODE (arg
) == METHOD_TYPE
)
18614 arg
= build_ptrmemfunc_type (build_pointer_type (arg
));
18616 arg
= build_pointer_type (arg
);
18618 sub_strict
|= maybe_adjust_types_for_deduction (strict
, &parm
, &arg
, NULL
);
18620 /* We don't copy orig_targs for this because if we have already deduced
18621 some template args from previous args, unify would complain when we
18622 try to deduce a template parameter for the same argument, even though
18623 there isn't really a conflict. */
18624 nargs
= TREE_VEC_LENGTH (targs
);
18625 tempargs
= make_tree_vec (nargs
);
18627 if (unify (tparms
, tempargs
, parm
, arg
, sub_strict
, explain_p
))
18630 /* First make sure we didn't deduce anything that conflicts with
18631 explicitly specified args. */
18632 for (i
= nargs
; i
--; )
18634 tree elt
= TREE_VEC_ELT (tempargs
, i
);
18635 tree oldelt
= TREE_VEC_ELT (orig_targs
, i
);
18639 else if (uses_template_parms (elt
))
18640 /* Since we're unifying against ourselves, we will fill in
18641 template args used in the function parm list with our own
18642 template parms. Discard them. */
18643 TREE_VEC_ELT (tempargs
, i
) = NULL_TREE
;
18644 else if (oldelt
&& !template_args_equal (oldelt
, elt
))
18648 for (i
= nargs
; i
--; )
18650 tree elt
= TREE_VEC_ELT (tempargs
, i
);
18653 TREE_VEC_ELT (targs
, i
) = elt
;
18659 /* PARM is a template class (perhaps with unbound template
18660 parameters). ARG is a fully instantiated type. If ARG can be
18661 bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and
18662 TARGS are as for unify. */
18665 try_class_unification (tree tparms
, tree targs
, tree parm
, tree arg
,
18668 tree copy_of_targs
;
18670 if (!CLASSTYPE_TEMPLATE_INFO (arg
)
18671 || (most_general_template (CLASSTYPE_TI_TEMPLATE (arg
))
18672 != most_general_template (CLASSTYPE_TI_TEMPLATE (parm
))))
18675 /* We need to make a new template argument vector for the call to
18676 unify. If we used TARGS, we'd clutter it up with the result of
18677 the attempted unification, even if this class didn't work out.
18678 We also don't want to commit ourselves to all the unifications
18679 we've already done, since unification is supposed to be done on
18680 an argument-by-argument basis. In other words, consider the
18681 following pathological case:
18683 template <int I, int J, int K>
18686 template <int I, int J>
18687 struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {};
18689 template <int I, int J, int K>
18690 void f(S<I, J, K>, S<I, I, I>);
18699 Now, by the time we consider the unification involving `s2', we
18700 already know that we must have `f<0, 0, 0>'. But, even though
18701 `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is invalid
18702 because there are two ways to unify base classes of S<0, 1, 2>
18703 with S<I, I, I>. If we kept the already deduced knowledge, we
18704 would reject the possibility I=1. */
18705 copy_of_targs
= make_tree_vec (TREE_VEC_LENGTH (targs
));
18707 /* If unification failed, we're done. */
18708 if (unify (tparms
, copy_of_targs
, CLASSTYPE_TI_ARGS (parm
),
18709 CLASSTYPE_TI_ARGS (arg
), UNIFY_ALLOW_NONE
, explain_p
))
18715 /* Given a template type PARM and a class type ARG, find the unique
18716 base type in ARG that is an instance of PARM. We do not examine
18717 ARG itself; only its base-classes. If there is not exactly one
18718 appropriate base class, return NULL_TREE. PARM may be the type of
18719 a partial specialization, as well as a plain template type. Used
18722 static enum template_base_result
18723 get_template_base (tree tparms
, tree targs
, tree parm
, tree arg
,
18724 bool explain_p
, tree
*result
)
18726 tree rval
= NULL_TREE
;
18729 gcc_assert (RECORD_OR_UNION_CODE_P (TREE_CODE (arg
)));
18731 binfo
= TYPE_BINFO (complete_type (arg
));
18734 /* The type could not be completed. */
18735 *result
= NULL_TREE
;
18736 return tbr_incomplete_type
;
18739 /* Walk in inheritance graph order. The search order is not
18740 important, and this avoids multiple walks of virtual bases. */
18741 for (binfo
= TREE_CHAIN (binfo
); binfo
; binfo
= TREE_CHAIN (binfo
))
18743 tree r
= try_class_unification (tparms
, targs
, parm
,
18744 BINFO_TYPE (binfo
), explain_p
);
18748 /* If there is more than one satisfactory baseclass, then:
18752 If they yield more than one possible deduced A, the type
18756 if (rval
&& !same_type_p (r
, rval
))
18758 *result
= NULL_TREE
;
18759 return tbr_ambiguous_baseclass
;
18767 return tbr_success
;
18770 /* Returns the level of DECL, which declares a template parameter. */
18773 template_decl_level (tree decl
)
18775 switch (TREE_CODE (decl
))
18778 case TEMPLATE_DECL
:
18779 return TEMPLATE_TYPE_LEVEL (TREE_TYPE (decl
));
18782 return TEMPLATE_PARM_LEVEL (DECL_INITIAL (decl
));
18785 gcc_unreachable ();
18790 /* Decide whether ARG can be unified with PARM, considering only the
18791 cv-qualifiers of each type, given STRICT as documented for unify.
18792 Returns nonzero iff the unification is OK on that basis. */
18795 check_cv_quals_for_unify (int strict
, tree arg
, tree parm
)
18797 int arg_quals
= cp_type_quals (arg
);
18798 int parm_quals
= cp_type_quals (parm
);
18800 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
18801 && !(strict
& UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
18803 /* Although a CVR qualifier is ignored when being applied to a
18804 substituted template parameter ([8.3.2]/1 for example), that
18805 does not allow us to unify "const T" with "int&" because both
18806 types are not of the form "cv-list T" [14.8.2.5 temp.deduct.type].
18807 It is ok when we're allowing additional CV qualifiers
18808 at the outer level [14.8.2.1]/3,1st bullet. */
18809 if ((TREE_CODE (arg
) == REFERENCE_TYPE
18810 || TREE_CODE (arg
) == FUNCTION_TYPE
18811 || TREE_CODE (arg
) == METHOD_TYPE
)
18812 && (parm_quals
& (TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
)))
18815 if ((!POINTER_TYPE_P (arg
) && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
)
18816 && (parm_quals
& TYPE_QUAL_RESTRICT
))
18820 if (!(strict
& (UNIFY_ALLOW_MORE_CV_QUAL
| UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
18821 && (arg_quals
& parm_quals
) != parm_quals
)
18824 if (!(strict
& (UNIFY_ALLOW_LESS_CV_QUAL
| UNIFY_ALLOW_OUTER_LESS_CV_QUAL
))
18825 && (parm_quals
& arg_quals
) != arg_quals
)
18831 /* Determines the LEVEL and INDEX for the template parameter PARM. */
18833 template_parm_level_and_index (tree parm
, int* level
, int* index
)
18835 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
18836 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
18837 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
18839 *index
= TEMPLATE_TYPE_IDX (parm
);
18840 *level
= TEMPLATE_TYPE_LEVEL (parm
);
18844 *index
= TEMPLATE_PARM_IDX (parm
);
18845 *level
= TEMPLATE_PARM_LEVEL (parm
);
18849 #define RECUR_AND_CHECK_FAILURE(TP, TA, P, A, S, EP) \
18851 if (unify (TP, TA, P, A, S, EP)) \
18855 /* Unifies the remaining arguments in PACKED_ARGS with the pack
18856 expansion at the end of PACKED_PARMS. Returns 0 if the type
18857 deduction succeeds, 1 otherwise. STRICT is the same as in
18858 unify. CALL_ARGS_P is true iff PACKED_ARGS is actually a function
18859 call argument list. We'll need to adjust the arguments to make them
18860 types. SUBR tells us if this is from a recursive call to
18861 type_unification_real, or for comparing two template argument
18865 unify_pack_expansion (tree tparms
, tree targs
, tree packed_parms
,
18866 tree packed_args
, unification_kind_t strict
,
18867 bool subr
, bool explain_p
)
18870 = TREE_VEC_ELT (packed_parms
, TREE_VEC_LENGTH (packed_parms
) - 1);
18871 tree pattern
= PACK_EXPANSION_PATTERN (parm
);
18872 tree pack
, packs
= NULL_TREE
;
18873 int i
, start
= TREE_VEC_LENGTH (packed_parms
) - 1;
18875 packed_args
= expand_template_argument_pack (packed_args
);
18877 int len
= TREE_VEC_LENGTH (packed_args
);
18879 /* Determine the parameter packs we will be deducing from the
18880 pattern, and record their current deductions. */
18881 for (pack
= PACK_EXPANSION_PARAMETER_PACKS (parm
);
18882 pack
; pack
= TREE_CHAIN (pack
))
18884 tree parm_pack
= TREE_VALUE (pack
);
18887 /* Determine the index and level of this parameter pack. */
18888 template_parm_level_and_index (parm_pack
, &level
, &idx
);
18890 /* Keep track of the parameter packs and their corresponding
18892 packs
= tree_cons (parm_pack
, TMPL_ARG (targs
, level
, idx
), packs
);
18893 TREE_TYPE (packs
) = make_tree_vec (len
- start
);
18896 /* Loop through all of the arguments that have not yet been
18897 unified and unify each with the pattern. */
18898 for (i
= start
; i
< len
; i
++)
18901 bool any_explicit
= false;
18902 tree arg
= TREE_VEC_ELT (packed_args
, i
);
18904 /* For each parameter pack, set its TMPL_ARG to either NULL_TREE
18905 or the element of its argument pack at the current index if
18906 this argument was explicitly specified. */
18907 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
18911 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
18914 if (TREE_VALUE (pack
)
18915 && (pargs
= ARGUMENT_PACK_EXPLICIT_ARGS (TREE_VALUE (pack
)))
18916 && (i
- start
< TREE_VEC_LENGTH (pargs
)))
18918 any_explicit
= true;
18919 arg
= TREE_VEC_ELT (pargs
, i
- start
);
18921 TMPL_ARG (targs
, level
, idx
) = arg
;
18924 /* If we had explicit template arguments, substitute them into the
18925 pattern before deduction. */
18928 /* Some arguments might still be unspecified or dependent. */
18930 ++processing_template_decl
;
18931 dependent
= any_dependent_template_arguments_p (targs
);
18933 --processing_template_decl
;
18934 parm
= tsubst (pattern
, targs
,
18935 explain_p
? tf_warning_or_error
: tf_none
,
18938 --processing_template_decl
;
18939 if (parm
== error_mark_node
)
18945 /* Unify the pattern with the current argument. */
18946 if (unify_one_argument (tparms
, targs
, parm
, arg
, subr
, strict
,
18950 /* For each parameter pack, collect the deduced value. */
18951 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
18954 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
18956 TREE_VEC_ELT (TREE_TYPE (pack
), i
- start
) =
18957 TMPL_ARG (targs
, level
, idx
);
18961 /* Verify that the results of unification with the parameter packs
18962 produce results consistent with what we've seen before, and make
18963 the deduced argument packs available. */
18964 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
18966 tree old_pack
= TREE_VALUE (pack
);
18967 tree new_args
= TREE_TYPE (pack
);
18968 int i
, len
= TREE_VEC_LENGTH (new_args
);
18970 bool nondeduced_p
= false;
18972 /* By default keep the original deduced argument pack.
18973 If necessary, more specific code is going to update the
18974 resulting deduced argument later down in this function. */
18975 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
18976 TMPL_ARG (targs
, level
, idx
) = old_pack
;
18978 /* If NEW_ARGS contains any NULL_TREE entries, we didn't
18979 actually deduce anything. */
18980 for (i
= 0; i
< len
&& !nondeduced_p
; ++i
)
18981 if (TREE_VEC_ELT (new_args
, i
) == NULL_TREE
)
18982 nondeduced_p
= true;
18986 if (old_pack
&& ARGUMENT_PACK_INCOMPLETE_P (old_pack
))
18988 /* If we had fewer function args than explicit template args,
18989 just use the explicits. */
18990 tree explicit_args
= ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
);
18991 int explicit_len
= TREE_VEC_LENGTH (explicit_args
);
18992 if (len
< explicit_len
)
18993 new_args
= explicit_args
;
18999 /* Build the deduced *_ARGUMENT_PACK. */
19000 if (TREE_CODE (TREE_PURPOSE (pack
)) == TEMPLATE_PARM_INDEX
)
19002 result
= make_node (NONTYPE_ARGUMENT_PACK
);
19003 TREE_TYPE (result
) =
19004 TREE_TYPE (TEMPLATE_PARM_DECL (TREE_PURPOSE (pack
)));
19005 TREE_CONSTANT (result
) = 1;
19008 result
= cxx_make_type (TYPE_ARGUMENT_PACK
);
19010 SET_ARGUMENT_PACK_ARGS (result
, new_args
);
19012 /* Note the deduced argument packs for this parameter
19014 TMPL_ARG (targs
, level
, idx
) = result
;
19016 else if (ARGUMENT_PACK_INCOMPLETE_P (old_pack
)
19017 && (ARGUMENT_PACK_ARGS (old_pack
)
19018 == ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
)))
19020 /* We only had the explicitly-provided arguments before, but
19021 now we have a complete set of arguments. */
19022 tree explicit_args
= ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
);
19024 SET_ARGUMENT_PACK_ARGS (old_pack
, new_args
);
19025 ARGUMENT_PACK_INCOMPLETE_P (old_pack
) = 1;
19026 ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
) = explicit_args
;
19030 tree bad_old_arg
= NULL_TREE
, bad_new_arg
= NULL_TREE
;
19031 tree old_args
= ARGUMENT_PACK_ARGS (old_pack
);
19033 if (!comp_template_args_with_info (old_args
, new_args
,
19034 &bad_old_arg
, &bad_new_arg
))
19035 /* Inconsistent unification of this parameter pack. */
19036 return unify_parameter_pack_inconsistent (explain_p
,
19042 return unify_success (explain_p
);
19045 /* Handle unification of the domain of an array. PARM_DOM and ARG_DOM are
19046 INTEGER_TYPEs representing the TYPE_DOMAIN of ARRAY_TYPEs. The other
19047 parameters and return value are as for unify. */
19050 unify_array_domain (tree tparms
, tree targs
,
19051 tree parm_dom
, tree arg_dom
,
19059 /* Our representation of array types uses "N - 1" as the
19060 TYPE_MAX_VALUE for an array with "N" elements, if "N" is
19061 not an integer constant. We cannot unify arbitrarily
19062 complex expressions, so we eliminate the MINUS_EXPRs
19064 parm_max
= TYPE_MAX_VALUE (parm_dom
);
19065 parm_cst
= TREE_CODE (parm_max
) == INTEGER_CST
;
19068 gcc_assert (TREE_CODE (parm_max
) == MINUS_EXPR
);
19069 parm_max
= TREE_OPERAND (parm_max
, 0);
19071 arg_max
= TYPE_MAX_VALUE (arg_dom
);
19072 arg_cst
= TREE_CODE (arg_max
) == INTEGER_CST
;
19075 /* The ARG_MAX may not be a simple MINUS_EXPR, if we are
19076 trying to unify the type of a variable with the type
19077 of a template parameter. For example:
19079 template <unsigned int N>
19080 void f (char (&) [N]);
19087 Here, the type of the ARG will be "int [g(i)]", and
19088 may be a SAVE_EXPR, etc. */
19089 if (TREE_CODE (arg_max
) != MINUS_EXPR
)
19090 return unify_vla_arg (explain_p
, arg_dom
);
19091 arg_max
= TREE_OPERAND (arg_max
, 0);
19094 /* If only one of the bounds used a MINUS_EXPR, compensate
19095 by adding one to the other bound. */
19096 if (parm_cst
&& !arg_cst
)
19097 parm_max
= fold_build2_loc (input_location
, PLUS_EXPR
,
19101 else if (arg_cst
&& !parm_cst
)
19102 arg_max
= fold_build2_loc (input_location
, PLUS_EXPR
,
19107 return unify (tparms
, targs
, parm_max
, arg_max
,
19108 UNIFY_ALLOW_INTEGER
, explain_p
);
19111 /* Deduce the value of template parameters. TPARMS is the (innermost)
19112 set of template parameters to a template. TARGS is the bindings
19113 for those template parameters, as determined thus far; TARGS may
19114 include template arguments for outer levels of template parameters
19115 as well. PARM is a parameter to a template function, or a
19116 subcomponent of that parameter; ARG is the corresponding argument.
19117 This function attempts to match PARM with ARG in a manner
19118 consistent with the existing assignments in TARGS. If more values
19119 are deduced, then TARGS is updated.
19121 Returns 0 if the type deduction succeeds, 1 otherwise. The
19122 parameter STRICT is a bitwise or of the following flags:
19125 Require an exact match between PARM and ARG.
19126 UNIFY_ALLOW_MORE_CV_QUAL:
19127 Allow the deduced ARG to be more cv-qualified (by qualification
19128 conversion) than ARG.
19129 UNIFY_ALLOW_LESS_CV_QUAL:
19130 Allow the deduced ARG to be less cv-qualified than ARG.
19131 UNIFY_ALLOW_DERIVED:
19132 Allow the deduced ARG to be a template base class of ARG,
19133 or a pointer to a template base class of the type pointed to by
19135 UNIFY_ALLOW_INTEGER:
19136 Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX
19137 case for more information.
19138 UNIFY_ALLOW_OUTER_LEVEL:
19139 This is the outermost level of a deduction. Used to determine validity
19140 of qualification conversions. A valid qualification conversion must
19141 have const qualified pointers leading up to the inner type which
19142 requires additional CV quals, except at the outer level, where const
19143 is not required [conv.qual]. It would be normal to set this flag in
19144 addition to setting UNIFY_ALLOW_MORE_CV_QUAL.
19145 UNIFY_ALLOW_OUTER_MORE_CV_QUAL:
19146 This is the outermost level of a deduction, and PARM can be more CV
19147 qualified at this point.
19148 UNIFY_ALLOW_OUTER_LESS_CV_QUAL:
19149 This is the outermost level of a deduction, and PARM can be less CV
19150 qualified at this point. */
19153 unify (tree tparms
, tree targs
, tree parm
, tree arg
, int strict
,
19159 int strict_in
= strict
;
19161 /* I don't think this will do the right thing with respect to types.
19162 But the only case I've seen it in so far has been array bounds, where
19163 signedness is the only information lost, and I think that will be
19165 while (TREE_CODE (parm
) == NOP_EXPR
)
19166 parm
= TREE_OPERAND (parm
, 0);
19168 if (arg
== error_mark_node
)
19169 return unify_invalid (explain_p
);
19170 if (arg
== unknown_type_node
19171 || arg
== init_list_type_node
)
19172 /* We can't deduce anything from this, but we might get all the
19173 template args from other function args. */
19174 return unify_success (explain_p
);
19176 /* If PARM uses template parameters, then we can't bail out here,
19177 even if ARG == PARM, since we won't record unifications for the
19178 template parameters. We might need them if we're trying to
19179 figure out which of two things is more specialized. */
19180 if (arg
== parm
&& !uses_template_parms (parm
))
19181 return unify_success (explain_p
);
19183 /* Handle init lists early, so the rest of the function can assume
19184 we're dealing with a type. */
19185 if (BRACE_ENCLOSED_INITIALIZER_P (arg
))
19189 tree orig_parm
= parm
;
19191 /* Replace T with std::initializer_list<T> for deduction. */
19192 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
19193 && flag_deduce_init_list
)
19194 parm
= listify (parm
);
19196 if (!is_std_init_list (parm
)
19197 && TREE_CODE (parm
) != ARRAY_TYPE
)
19198 /* We can only deduce from an initializer list argument if the
19199 parameter is std::initializer_list or an array; otherwise this
19200 is a non-deduced context. */
19201 return unify_success (explain_p
);
19203 if (TREE_CODE (parm
) == ARRAY_TYPE
)
19204 elttype
= TREE_TYPE (parm
);
19207 elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (parm
), 0);
19208 /* Deduction is defined in terms of a single type, so just punt
19209 on the (bizarre) std::initializer_list<T...>. */
19210 if (PACK_EXPANSION_P (elttype
))
19211 return unify_success (explain_p
);
19214 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (arg
), i
, elt
)
19216 int elt_strict
= strict
;
19218 if (elt
== error_mark_node
)
19219 return unify_invalid (explain_p
);
19221 if (!BRACE_ENCLOSED_INITIALIZER_P (elt
))
19223 tree type
= TREE_TYPE (elt
);
19224 if (type
== error_mark_node
)
19225 return unify_invalid (explain_p
);
19226 /* It should only be possible to get here for a call. */
19227 gcc_assert (elt_strict
& UNIFY_ALLOW_OUTER_LEVEL
);
19228 elt_strict
|= maybe_adjust_types_for_deduction
19229 (DEDUCE_CALL
, &elttype
, &type
, elt
);
19233 RECUR_AND_CHECK_FAILURE (tparms
, targs
, elttype
, elt
, elt_strict
,
19237 if (TREE_CODE (parm
) == ARRAY_TYPE
19238 && deducible_array_bound (TYPE_DOMAIN (parm
)))
19240 /* Also deduce from the length of the initializer list. */
19241 tree max
= size_int (CONSTRUCTOR_NELTS (arg
));
19242 tree idx
= compute_array_index_type (NULL_TREE
, max
, tf_none
);
19243 if (idx
== error_mark_node
)
19244 return unify_invalid (explain_p
);
19245 return unify_array_domain (tparms
, targs
, TYPE_DOMAIN (parm
),
19249 /* If the std::initializer_list<T> deduction worked, replace the
19250 deduced A with std::initializer_list<A>. */
19251 if (orig_parm
!= parm
)
19253 idx
= TEMPLATE_TYPE_IDX (orig_parm
);
19254 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
19255 targ
= listify (targ
);
19256 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = targ
;
19258 return unify_success (explain_p
);
19261 /* Immediately reject some pairs that won't unify because of
19262 cv-qualification mismatches. */
19263 if (TREE_CODE (arg
) == TREE_CODE (parm
)
19265 /* It is the elements of the array which hold the cv quals of an array
19266 type, and the elements might be template type parms. We'll check
19267 when we recurse. */
19268 && TREE_CODE (arg
) != ARRAY_TYPE
19269 /* We check the cv-qualifiers when unifying with template type
19270 parameters below. We want to allow ARG `const T' to unify with
19271 PARM `T' for example, when computing which of two templates
19272 is more specialized, for example. */
19273 && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
19274 && !check_cv_quals_for_unify (strict_in
, arg
, parm
))
19275 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
19277 if (!(strict
& UNIFY_ALLOW_OUTER_LEVEL
)
19278 && TYPE_P (parm
) && !CP_TYPE_CONST_P (parm
))
19279 strict
&= ~UNIFY_ALLOW_MORE_CV_QUAL
;
19280 strict
&= ~UNIFY_ALLOW_OUTER_LEVEL
;
19281 strict
&= ~UNIFY_ALLOW_DERIVED
;
19282 strict
&= ~UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
19283 strict
&= ~UNIFY_ALLOW_OUTER_LESS_CV_QUAL
;
19285 switch (TREE_CODE (parm
))
19287 case TYPENAME_TYPE
:
19289 case UNBOUND_CLASS_TEMPLATE
:
19290 /* In a type which contains a nested-name-specifier, template
19291 argument values cannot be deduced for template parameters used
19292 within the nested-name-specifier. */
19293 return unify_success (explain_p
);
19295 case TEMPLATE_TYPE_PARM
:
19296 case TEMPLATE_TEMPLATE_PARM
:
19297 case BOUND_TEMPLATE_TEMPLATE_PARM
:
19298 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
19299 if (error_operand_p (tparm
))
19300 return unify_invalid (explain_p
);
19302 if (TEMPLATE_TYPE_LEVEL (parm
)
19303 != template_decl_level (tparm
))
19304 /* The PARM is not one we're trying to unify. Just check
19305 to see if it matches ARG. */
19307 if (TREE_CODE (arg
) == TREE_CODE (parm
)
19308 && (is_auto (parm
) ? is_auto (arg
)
19309 : same_type_p (parm
, arg
)))
19310 return unify_success (explain_p
);
19312 return unify_type_mismatch (explain_p
, parm
, arg
);
19314 idx
= TEMPLATE_TYPE_IDX (parm
);
19315 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
19316 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, idx
));
19317 if (error_operand_p (tparm
))
19318 return unify_invalid (explain_p
);
19320 /* Check for mixed types and values. */
19321 if ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
19322 && TREE_CODE (tparm
) != TYPE_DECL
)
19323 || (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
19324 && TREE_CODE (tparm
) != TEMPLATE_DECL
))
19325 gcc_unreachable ();
19327 if (TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
19329 /* ARG must be constructed from a template class or a template
19330 template parameter. */
19331 if (TREE_CODE (arg
) != BOUND_TEMPLATE_TEMPLATE_PARM
19332 && !CLASSTYPE_SPECIALIZATION_OF_PRIMARY_TEMPLATE_P (arg
))
19333 return unify_template_deduction_failure (explain_p
, parm
, arg
);
19335 tree parmvec
= TYPE_TI_ARGS (parm
);
19336 /* An alias template name is never deduced. */
19337 if (TYPE_ALIAS_P (arg
))
19338 arg
= strip_typedefs (arg
);
19339 tree argvec
= INNERMOST_TEMPLATE_ARGS (TYPE_TI_ARGS (arg
));
19340 tree full_argvec
= add_to_template_args (targs
, argvec
);
19342 = DECL_INNERMOST_TEMPLATE_PARMS
19343 (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (parm
));
19345 int parm_variadic_p
= 0;
19347 /* The resolution to DR150 makes clear that default
19348 arguments for an N-argument may not be used to bind T
19349 to a template template parameter with fewer than N
19350 parameters. It is not safe to permit the binding of
19351 default arguments as an extension, as that may change
19352 the meaning of a conforming program. Consider:
19354 struct Dense { static const unsigned int dim = 1; };
19356 template <template <typename> class View,
19358 void operator+(float, View<Block> const&);
19360 template <typename Block,
19361 unsigned int Dim = Block::dim>
19362 struct Lvalue_proxy { operator float() const; };
19366 Lvalue_proxy<Dense> p;
19371 Here, if Lvalue_proxy is permitted to bind to View, then
19372 the global operator+ will be used; if they are not, the
19373 Lvalue_proxy will be converted to float. */
19374 if (coerce_template_parms (parm_parms
,
19376 TYPE_TI_TEMPLATE (parm
),
19378 ? tf_warning_or_error
19380 /*require_all_args=*/true,
19381 /*use_default_args=*/false)
19382 == error_mark_node
)
19385 /* Deduce arguments T, i from TT<T> or TT<i>.
19386 We check each element of PARMVEC and ARGVEC individually
19387 rather than the whole TREE_VEC since they can have
19388 different number of elements. */
19390 parmvec
= expand_template_argument_pack (parmvec
);
19391 argvec
= expand_template_argument_pack (argvec
);
19393 len
= TREE_VEC_LENGTH (parmvec
);
19395 /* Check if the parameters end in a pack, making them
19398 && PACK_EXPANSION_P (TREE_VEC_ELT (parmvec
, len
- 1)))
19399 parm_variadic_p
= 1;
19401 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
19402 /* If the template argument list of P contains a pack
19403 expansion that is not the last template argument, the
19404 entire template argument list is a non-deduced
19406 if (PACK_EXPANSION_P (TREE_VEC_ELT (parmvec
, i
)))
19407 return unify_success (explain_p
);
19409 if (TREE_VEC_LENGTH (argvec
) < len
- parm_variadic_p
)
19410 return unify_too_few_arguments (explain_p
,
19411 TREE_VEC_LENGTH (argvec
), len
);
19413 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
19415 RECUR_AND_CHECK_FAILURE (tparms
, targs
,
19416 TREE_VEC_ELT (parmvec
, i
),
19417 TREE_VEC_ELT (argvec
, i
),
19418 UNIFY_ALLOW_NONE
, explain_p
);
19421 if (parm_variadic_p
19422 && unify_pack_expansion (tparms
, targs
,
19425 /*subr=*/true, explain_p
))
19428 arg
= TYPE_TI_TEMPLATE (arg
);
19430 /* Fall through to deduce template name. */
19433 if (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
19434 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
19436 /* Deduce template name TT from TT, TT<>, TT<T> and TT<i>. */
19438 /* Simple cases: Value already set, does match or doesn't. */
19439 if (targ
!= NULL_TREE
&& template_args_equal (targ
, arg
))
19440 return unify_success (explain_p
);
19442 return unify_inconsistency (explain_p
, parm
, targ
, arg
);
19446 /* If PARM is `const T' and ARG is only `int', we don't have
19447 a match unless we are allowing additional qualification.
19448 If ARG is `const int' and PARM is just `T' that's OK;
19449 that binds `const int' to `T'. */
19450 if (!check_cv_quals_for_unify (strict_in
| UNIFY_ALLOW_LESS_CV_QUAL
,
19452 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
19454 /* Consider the case where ARG is `const volatile int' and
19455 PARM is `const T'. Then, T should be `volatile int'. */
19456 arg
= cp_build_qualified_type_real
19457 (arg
, cp_type_quals (arg
) & ~cp_type_quals (parm
), tf_none
);
19458 if (arg
== error_mark_node
)
19459 return unify_invalid (explain_p
);
19461 /* Simple cases: Value already set, does match or doesn't. */
19462 if (targ
!= NULL_TREE
&& same_type_p (targ
, arg
))
19463 return unify_success (explain_p
);
19465 return unify_inconsistency (explain_p
, parm
, targ
, arg
);
19467 /* Make sure that ARG is not a variable-sized array. (Note
19468 that were talking about variable-sized arrays (like
19469 `int[n]'), rather than arrays of unknown size (like
19470 `int[]').) We'll get very confused by such a type since
19471 the bound of the array is not constant, and therefore
19472 not mangleable. Besides, such types are not allowed in
19473 ISO C++, so we can do as we please here. We do allow
19474 them for 'auto' deduction, since that isn't ABI-exposed. */
19475 if (!is_auto (parm
) && variably_modified_type_p (arg
, NULL_TREE
))
19476 return unify_vla_arg (explain_p
, arg
);
19478 /* Strip typedefs as in convert_template_argument. */
19479 arg
= canonicalize_type_argument (arg
, tf_none
);
19482 /* If ARG is a parameter pack or an expansion, we cannot unify
19483 against it unless PARM is also a parameter pack. */
19484 if ((template_parameter_pack_p (arg
) || PACK_EXPANSION_P (arg
))
19485 && !template_parameter_pack_p (parm
))
19486 return unify_parameter_pack_mismatch (explain_p
, parm
, arg
);
19488 /* If the argument deduction results is a METHOD_TYPE,
19489 then there is a problem.
19490 METHOD_TYPE doesn't map to any real C++ type the result of
19491 the deduction can not be of that type. */
19492 if (TREE_CODE (arg
) == METHOD_TYPE
)
19493 return unify_method_type_error (explain_p
, arg
);
19495 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = arg
;
19496 return unify_success (explain_p
);
19498 case TEMPLATE_PARM_INDEX
:
19499 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
19500 if (error_operand_p (tparm
))
19501 return unify_invalid (explain_p
);
19503 if (TEMPLATE_PARM_LEVEL (parm
)
19504 != template_decl_level (tparm
))
19506 /* The PARM is not one we're trying to unify. Just check
19507 to see if it matches ARG. */
19508 int result
= !(TREE_CODE (arg
) == TREE_CODE (parm
)
19509 && cp_tree_equal (parm
, arg
));
19511 unify_expression_unequal (explain_p
, parm
, arg
);
19515 idx
= TEMPLATE_PARM_IDX (parm
);
19516 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
19520 int x
= !cp_tree_equal (targ
, arg
);
19522 unify_inconsistency (explain_p
, parm
, targ
, arg
);
19526 /* [temp.deduct.type] If, in the declaration of a function template
19527 with a non-type template-parameter, the non-type
19528 template-parameter is used in an expression in the function
19529 parameter-list and, if the corresponding template-argument is
19530 deduced, the template-argument type shall match the type of the
19531 template-parameter exactly, except that a template-argument
19532 deduced from an array bound may be of any integral type.
19533 The non-type parameter might use already deduced type parameters. */
19534 tparm
= tsubst (TREE_TYPE (parm
), targs
, 0, NULL_TREE
);
19535 if (!TREE_TYPE (arg
))
19536 /* Template-parameter dependent expression. Just accept it for now.
19537 It will later be processed in convert_template_argument. */
19539 else if (same_type_p (TREE_TYPE (arg
), tparm
))
19541 else if ((strict
& UNIFY_ALLOW_INTEGER
)
19542 && CP_INTEGRAL_TYPE_P (tparm
))
19543 /* Convert the ARG to the type of PARM; the deduced non-type
19544 template argument must exactly match the types of the
19545 corresponding parameter. */
19546 arg
= fold (build_nop (tparm
, arg
));
19547 else if (uses_template_parms (tparm
))
19548 /* We haven't deduced the type of this parameter yet. Try again
19550 return unify_success (explain_p
);
19552 return unify_type_mismatch (explain_p
, tparm
, TREE_TYPE (arg
));
19554 /* If ARG is a parameter pack or an expansion, we cannot unify
19555 against it unless PARM is also a parameter pack. */
19556 if ((template_parameter_pack_p (arg
) || PACK_EXPANSION_P (arg
))
19557 && !TEMPLATE_PARM_PARAMETER_PACK (parm
))
19558 return unify_parameter_pack_mismatch (explain_p
, parm
, arg
);
19561 bool removed_attr
= false;
19562 arg
= strip_typedefs_expr (arg
, &removed_attr
);
19564 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = arg
;
19565 return unify_success (explain_p
);
19569 /* A pointer-to-member constant can be unified only with
19570 another constant. */
19571 if (TREE_CODE (arg
) != PTRMEM_CST
)
19572 return unify_ptrmem_cst_mismatch (explain_p
, parm
, arg
);
19574 /* Just unify the class member. It would be useless (and possibly
19575 wrong, depending on the strict flags) to unify also
19576 PTRMEM_CST_CLASS, because we want to be sure that both parm and
19577 arg refer to the same variable, even if through different
19578 classes. For instance:
19580 struct A { int x; };
19583 Unification of &A::x and &B::x must succeed. */
19584 return unify (tparms
, targs
, PTRMEM_CST_MEMBER (parm
),
19585 PTRMEM_CST_MEMBER (arg
), strict
, explain_p
);
19590 if (!TYPE_PTR_P (arg
))
19591 return unify_type_mismatch (explain_p
, parm
, arg
);
19593 /* [temp.deduct.call]
19595 A can be another pointer or pointer to member type that can
19596 be converted to the deduced A via a qualification
19597 conversion (_conv.qual_).
19599 We pass down STRICT here rather than UNIFY_ALLOW_NONE.
19600 This will allow for additional cv-qualification of the
19601 pointed-to types if appropriate. */
19603 if (TREE_CODE (TREE_TYPE (arg
)) == RECORD_TYPE
)
19604 /* The derived-to-base conversion only persists through one
19605 level of pointers. */
19606 strict
|= (strict_in
& UNIFY_ALLOW_DERIVED
);
19608 return unify (tparms
, targs
, TREE_TYPE (parm
),
19609 TREE_TYPE (arg
), strict
, explain_p
);
19612 case REFERENCE_TYPE
:
19613 if (TREE_CODE (arg
) != REFERENCE_TYPE
)
19614 return unify_type_mismatch (explain_p
, parm
, arg
);
19615 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
19616 strict
& UNIFY_ALLOW_MORE_CV_QUAL
, explain_p
);
19619 if (TREE_CODE (arg
) != ARRAY_TYPE
)
19620 return unify_type_mismatch (explain_p
, parm
, arg
);
19621 if ((TYPE_DOMAIN (parm
) == NULL_TREE
)
19622 != (TYPE_DOMAIN (arg
) == NULL_TREE
))
19623 return unify_type_mismatch (explain_p
, parm
, arg
);
19624 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
19625 strict
& UNIFY_ALLOW_MORE_CV_QUAL
, explain_p
);
19626 if (TYPE_DOMAIN (parm
) != NULL_TREE
)
19627 return unify_array_domain (tparms
, targs
, TYPE_DOMAIN (parm
),
19628 TYPE_DOMAIN (arg
), explain_p
);
19629 return unify_success (explain_p
);
19636 case ENUMERAL_TYPE
:
19639 if (TREE_CODE (arg
) != TREE_CODE (parm
))
19640 return unify_type_mismatch (explain_p
, parm
, arg
);
19642 /* We have already checked cv-qualification at the top of the
19644 if (!same_type_ignoring_top_level_qualifiers_p (arg
, parm
))
19645 return unify_type_mismatch (explain_p
, parm
, arg
);
19647 /* As far as unification is concerned, this wins. Later checks
19648 will invalidate it if necessary. */
19649 return unify_success (explain_p
);
19651 /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */
19652 /* Type INTEGER_CST can come from ordinary constant template args. */
19654 while (TREE_CODE (arg
) == NOP_EXPR
)
19655 arg
= TREE_OPERAND (arg
, 0);
19657 if (TREE_CODE (arg
) != INTEGER_CST
)
19658 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
19659 return (tree_int_cst_equal (parm
, arg
)
19660 ? unify_success (explain_p
)
19661 : unify_template_argument_mismatch (explain_p
, parm
, arg
));
19665 int i
, len
, argslen
;
19666 int parm_variadic_p
= 0;
19668 if (TREE_CODE (arg
) != TREE_VEC
)
19669 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
19671 len
= TREE_VEC_LENGTH (parm
);
19672 argslen
= TREE_VEC_LENGTH (arg
);
19674 /* Check for pack expansions in the parameters. */
19675 for (i
= 0; i
< len
; ++i
)
19677 if (PACK_EXPANSION_P (TREE_VEC_ELT (parm
, i
)))
19680 /* We can unify against something with a trailing
19682 parm_variadic_p
= 1;
19684 /* [temp.deduct.type]/9: If the template argument list of
19685 P contains a pack expansion that is not the last
19686 template argument, the entire template argument list
19687 is a non-deduced context. */
19688 return unify_success (explain_p
);
19692 /* If we don't have enough arguments to satisfy the parameters
19693 (not counting the pack expression at the end), or we have
19694 too many arguments for a parameter list that doesn't end in
19695 a pack expression, we can't unify. */
19696 if (parm_variadic_p
19697 ? argslen
< len
- parm_variadic_p
19699 return unify_arity (explain_p
, TREE_VEC_LENGTH (arg
), len
);
19701 /* Unify all of the parameters that precede the (optional)
19702 pack expression. */
19703 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
19705 RECUR_AND_CHECK_FAILURE (tparms
, targs
,
19706 TREE_VEC_ELT (parm
, i
),
19707 TREE_VEC_ELT (arg
, i
),
19708 UNIFY_ALLOW_NONE
, explain_p
);
19710 if (parm_variadic_p
)
19711 return unify_pack_expansion (tparms
, targs
, parm
, arg
,
19713 /*subr=*/true, explain_p
);
19714 return unify_success (explain_p
);
19719 if (TREE_CODE (arg
) != TREE_CODE (parm
))
19720 return unify_type_mismatch (explain_p
, parm
, arg
);
19722 if (TYPE_PTRMEMFUNC_P (parm
))
19724 if (!TYPE_PTRMEMFUNC_P (arg
))
19725 return unify_type_mismatch (explain_p
, parm
, arg
);
19727 return unify (tparms
, targs
,
19728 TYPE_PTRMEMFUNC_FN_TYPE (parm
),
19729 TYPE_PTRMEMFUNC_FN_TYPE (arg
),
19730 strict
, explain_p
);
19732 else if (TYPE_PTRMEMFUNC_P (arg
))
19733 return unify_type_mismatch (explain_p
, parm
, arg
);
19735 if (CLASSTYPE_TEMPLATE_INFO (parm
))
19737 tree t
= NULL_TREE
;
19739 if (strict_in
& UNIFY_ALLOW_DERIVED
)
19741 /* First, we try to unify the PARM and ARG directly. */
19742 t
= try_class_unification (tparms
, targs
,
19743 parm
, arg
, explain_p
);
19747 /* Fallback to the special case allowed in
19748 [temp.deduct.call]:
19750 If P is a class, and P has the form
19751 template-id, then A can be a derived class of
19752 the deduced A. Likewise, if P is a pointer to
19753 a class of the form template-id, A can be a
19754 pointer to a derived class pointed to by the
19756 enum template_base_result r
;
19757 r
= get_template_base (tparms
, targs
, parm
, arg
,
19762 /* Don't give the derived diagnostic if we're
19763 already dealing with the same template. */
19765 = (CLASSTYPE_TEMPLATE_INFO (arg
)
19766 && (CLASSTYPE_TI_TEMPLATE (parm
)
19767 == CLASSTYPE_TI_TEMPLATE (arg
)));
19768 return unify_no_common_base (explain_p
&& !same_template
,
19773 else if (CLASSTYPE_TEMPLATE_INFO (arg
)
19774 && (CLASSTYPE_TI_TEMPLATE (parm
)
19775 == CLASSTYPE_TI_TEMPLATE (arg
)))
19776 /* Perhaps PARM is something like S<U> and ARG is S<int>.
19777 Then, we should unify `int' and `U'. */
19780 /* There's no chance of unification succeeding. */
19781 return unify_type_mismatch (explain_p
, parm
, arg
);
19783 return unify (tparms
, targs
, CLASSTYPE_TI_ARGS (parm
),
19784 CLASSTYPE_TI_ARGS (t
), UNIFY_ALLOW_NONE
, explain_p
);
19786 else if (!same_type_ignoring_top_level_qualifiers_p (parm
, arg
))
19787 return unify_type_mismatch (explain_p
, parm
, arg
);
19788 return unify_success (explain_p
);
19791 case FUNCTION_TYPE
:
19793 unsigned int nargs
;
19798 if (TREE_CODE (arg
) != TREE_CODE (parm
))
19799 return unify_type_mismatch (explain_p
, parm
, arg
);
19801 /* CV qualifications for methods can never be deduced, they must
19802 match exactly. We need to check them explicitly here,
19803 because type_unification_real treats them as any other
19804 cv-qualified parameter. */
19805 if (TREE_CODE (parm
) == METHOD_TYPE
19806 && (!check_cv_quals_for_unify
19808 class_of_this_parm (arg
),
19809 class_of_this_parm (parm
))))
19810 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
19812 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TREE_TYPE (parm
),
19813 TREE_TYPE (arg
), UNIFY_ALLOW_NONE
, explain_p
);
19815 nargs
= list_length (TYPE_ARG_TYPES (arg
));
19816 args
= XALLOCAVEC (tree
, nargs
);
19817 for (a
= TYPE_ARG_TYPES (arg
), i
= 0;
19818 a
!= NULL_TREE
&& a
!= void_list_node
;
19819 a
= TREE_CHAIN (a
), ++i
)
19820 args
[i
] = TREE_VALUE (a
);
19823 return type_unification_real (tparms
, targs
, TYPE_ARG_TYPES (parm
),
19824 args
, nargs
, 1, DEDUCE_EXACT
,
19825 LOOKUP_NORMAL
, NULL
, explain_p
);
19829 /* Unify a pointer to member with a pointer to member function, which
19830 deduces the type of the member as a function type. */
19831 if (TYPE_PTRMEMFUNC_P (arg
))
19833 /* Check top-level cv qualifiers */
19834 if (!check_cv_quals_for_unify (UNIFY_ALLOW_NONE
, arg
, parm
))
19835 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
19837 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
19838 TYPE_PTRMEMFUNC_OBJECT_TYPE (arg
),
19839 UNIFY_ALLOW_NONE
, explain_p
);
19841 /* Determine the type of the function we are unifying against. */
19842 tree fntype
= static_fn_type (arg
);
19844 return unify (tparms
, targs
, TREE_TYPE (parm
), fntype
, strict
, explain_p
);
19847 if (TREE_CODE (arg
) != OFFSET_TYPE
)
19848 return unify_type_mismatch (explain_p
, parm
, arg
);
19849 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
19850 TYPE_OFFSET_BASETYPE (arg
),
19851 UNIFY_ALLOW_NONE
, explain_p
);
19852 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
19853 strict
, explain_p
);
19856 if (DECL_TEMPLATE_PARM_P (parm
))
19857 return unify (tparms
, targs
, DECL_INITIAL (parm
), arg
, strict
, explain_p
);
19858 if (arg
!= scalar_constant_value (parm
))
19859 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
19860 return unify_success (explain_p
);
19863 case TEMPLATE_DECL
:
19864 /* Matched cases are handled by the ARG == PARM test above. */
19865 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
19868 /* A non-type template parameter that is a variable should be a
19869 an integral constant, in which case, it whould have been
19870 folded into its (constant) value. So we should not be getting
19871 a variable here. */
19872 gcc_unreachable ();
19874 case TYPE_ARGUMENT_PACK
:
19875 case NONTYPE_ARGUMENT_PACK
:
19876 return unify (tparms
, targs
, ARGUMENT_PACK_ARGS (parm
),
19877 ARGUMENT_PACK_ARGS (arg
), strict
, explain_p
);
19880 case DECLTYPE_TYPE
:
19881 case UNDERLYING_TYPE
:
19882 /* Cannot deduce anything from TYPEOF_TYPE, DECLTYPE_TYPE,
19883 or UNDERLYING_TYPE nodes. */
19884 return unify_success (explain_p
);
19887 /* Unification fails if we hit an error node. */
19888 return unify_invalid (explain_p
);
19891 if (REFERENCE_REF_P (parm
))
19893 if (REFERENCE_REF_P (arg
))
19894 arg
= TREE_OPERAND (arg
, 0);
19895 return unify (tparms
, targs
, TREE_OPERAND (parm
, 0), arg
,
19896 strict
, explain_p
);
19901 /* An unresolved overload is a nondeduced context. */
19902 if (is_overloaded_fn (parm
) || type_unknown_p (parm
))
19903 return unify_success (explain_p
);
19904 gcc_assert (EXPR_P (parm
));
19906 /* We must be looking at an expression. This can happen with
19910 void foo(S<I>, S<I + 2>);
19912 This is a "nondeduced context":
19916 The nondeduced contexts are:
19918 --A type that is a template-id in which one or more of
19919 the template-arguments is an expression that references
19920 a template-parameter.
19922 In these cases, we assume deduction succeeded, but don't
19923 actually infer any unifications. */
19925 if (!uses_template_parms (parm
)
19926 && !template_args_equal (parm
, arg
))
19927 return unify_expression_unequal (explain_p
, parm
, arg
);
19929 return unify_success (explain_p
);
19932 #undef RECUR_AND_CHECK_FAILURE
19934 /* Note that DECL can be defined in this translation unit, if
19938 mark_definable (tree decl
)
19941 DECL_NOT_REALLY_EXTERN (decl
) = 1;
19942 FOR_EACH_CLONE (clone
, decl
)
19943 DECL_NOT_REALLY_EXTERN (clone
) = 1;
19946 /* Called if RESULT is explicitly instantiated, or is a member of an
19947 explicitly instantiated class. */
19950 mark_decl_instantiated (tree result
, int extern_p
)
19952 SET_DECL_EXPLICIT_INSTANTIATION (result
);
19954 /* If this entity has already been written out, it's too late to
19955 make any modifications. */
19956 if (TREE_ASM_WRITTEN (result
))
19959 /* For anonymous namespace we don't need to do anything. */
19960 if (decl_anon_ns_mem_p (result
))
19962 gcc_assert (!TREE_PUBLIC (result
));
19966 if (TREE_CODE (result
) != FUNCTION_DECL
)
19967 /* The TREE_PUBLIC flag for function declarations will have been
19968 set correctly by tsubst. */
19969 TREE_PUBLIC (result
) = 1;
19971 /* This might have been set by an earlier implicit instantiation. */
19972 DECL_COMDAT (result
) = 0;
19975 DECL_NOT_REALLY_EXTERN (result
) = 0;
19978 mark_definable (result
);
19979 mark_needed (result
);
19980 /* Always make artificials weak. */
19981 if (DECL_ARTIFICIAL (result
) && flag_weak
)
19982 comdat_linkage (result
);
19983 /* For WIN32 we also want to put explicit instantiations in
19984 linkonce sections. */
19985 else if (TREE_PUBLIC (result
))
19986 maybe_make_one_only (result
);
19989 /* If EXTERN_P, then this function will not be emitted -- unless
19990 followed by an explicit instantiation, at which point its linkage
19991 will be adjusted. If !EXTERN_P, then this function will be
19992 emitted here. In neither circumstance do we want
19993 import_export_decl to adjust the linkage. */
19994 DECL_INTERFACE_KNOWN (result
) = 1;
19997 /* Subroutine of more_specialized_fn: check whether TARGS is missing any
19998 important template arguments. If any are missing, we check whether
19999 they're important by using error_mark_node for substituting into any
20000 args that were used for partial ordering (the ones between ARGS and END)
20001 and seeing if it bubbles up. */
20004 check_undeduced_parms (tree targs
, tree args
, tree end
)
20006 bool found
= false;
20008 for (i
= TREE_VEC_LENGTH (targs
) - 1; i
>= 0; --i
)
20009 if (TREE_VEC_ELT (targs
, i
) == NULL_TREE
)
20012 TREE_VEC_ELT (targs
, i
) = error_mark_node
;
20016 tree substed
= tsubst_arg_types (args
, targs
, end
, tf_none
, NULL_TREE
);
20017 if (substed
== error_mark_node
)
20023 /* Given two function templates PAT1 and PAT2, return:
20025 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order].
20026 -1 if PAT2 is more specialized than PAT1.
20027 0 if neither is more specialized.
20029 LEN indicates the number of parameters we should consider
20030 (defaulted parameters should not be considered).
20032 The 1998 std underspecified function template partial ordering, and
20033 DR214 addresses the issue. We take pairs of arguments, one from
20034 each of the templates, and deduce them against each other. One of
20035 the templates will be more specialized if all the *other*
20036 template's arguments deduce against its arguments and at least one
20037 of its arguments *does* *not* deduce against the other template's
20038 corresponding argument. Deduction is done as for class templates.
20039 The arguments used in deduction have reference and top level cv
20040 qualifiers removed. Iff both arguments were originally reference
20041 types *and* deduction succeeds in both directions, an lvalue reference
20042 wins against an rvalue reference and otherwise the template
20043 with the more cv-qualified argument wins for that pairing (if
20044 neither is more cv-qualified, they both are equal). Unlike regular
20045 deduction, after all the arguments have been deduced in this way,
20046 we do *not* verify the deduced template argument values can be
20047 substituted into non-deduced contexts.
20049 The logic can be a bit confusing here, because we look at deduce1 and
20050 targs1 to see if pat2 is at least as specialized, and vice versa; if we
20051 can find template arguments for pat1 to make arg1 look like arg2, that
20052 means that arg2 is at least as specialized as arg1. */
20055 more_specialized_fn (tree pat1
, tree pat2
, int len
)
20057 tree decl1
= DECL_TEMPLATE_RESULT (pat1
);
20058 tree decl2
= DECL_TEMPLATE_RESULT (pat2
);
20059 tree targs1
= make_tree_vec (DECL_NTPARMS (pat1
));
20060 tree targs2
= make_tree_vec (DECL_NTPARMS (pat2
));
20061 tree tparms1
= DECL_INNERMOST_TEMPLATE_PARMS (pat1
);
20062 tree tparms2
= DECL_INNERMOST_TEMPLATE_PARMS (pat2
);
20063 tree args1
= TYPE_ARG_TYPES (TREE_TYPE (decl1
));
20064 tree args2
= TYPE_ARG_TYPES (TREE_TYPE (decl2
));
20065 tree origs1
, origs2
;
20066 bool lose1
= false;
20067 bool lose2
= false;
20069 /* Remove the this parameter from non-static member functions. If
20070 one is a non-static member function and the other is not a static
20071 member function, remove the first parameter from that function
20072 also. This situation occurs for operator functions where we
20073 locate both a member function (with this pointer) and non-member
20074 operator (with explicit first operand). */
20075 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl1
))
20077 len
--; /* LEN is the number of significant arguments for DECL1 */
20078 args1
= TREE_CHAIN (args1
);
20079 if (!DECL_STATIC_FUNCTION_P (decl2
))
20080 args2
= TREE_CHAIN (args2
);
20082 else if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl2
))
20084 args2
= TREE_CHAIN (args2
);
20085 if (!DECL_STATIC_FUNCTION_P (decl1
))
20088 args1
= TREE_CHAIN (args1
);
20092 /* If only one is a conversion operator, they are unordered. */
20093 if (DECL_CONV_FN_P (decl1
) != DECL_CONV_FN_P (decl2
))
20096 /* Consider the return type for a conversion function */
20097 if (DECL_CONV_FN_P (decl1
))
20099 args1
= tree_cons (NULL_TREE
, TREE_TYPE (TREE_TYPE (decl1
)), args1
);
20100 args2
= tree_cons (NULL_TREE
, TREE_TYPE (TREE_TYPE (decl2
)), args2
);
20104 processing_template_decl
++;
20110 /* Stop when an ellipsis is seen. */
20111 && args1
!= NULL_TREE
&& args2
!= NULL_TREE
)
20113 tree arg1
= TREE_VALUE (args1
);
20114 tree arg2
= TREE_VALUE (args2
);
20115 int deduce1
, deduce2
;
20121 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
20122 && TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
20124 /* When both arguments are pack expansions, we need only
20125 unify the patterns themselves. */
20126 arg1
= PACK_EXPANSION_PATTERN (arg1
);
20127 arg2
= PACK_EXPANSION_PATTERN (arg2
);
20129 /* This is the last comparison we need to do. */
20133 if (TREE_CODE (arg1
) == REFERENCE_TYPE
)
20135 ref1
= TYPE_REF_IS_RVALUE (arg1
) + 1;
20136 arg1
= TREE_TYPE (arg1
);
20137 quals1
= cp_type_quals (arg1
);
20140 if (TREE_CODE (arg2
) == REFERENCE_TYPE
)
20142 ref2
= TYPE_REF_IS_RVALUE (arg2
) + 1;
20143 arg2
= TREE_TYPE (arg2
);
20144 quals2
= cp_type_quals (arg2
);
20147 arg1
= TYPE_MAIN_VARIANT (arg1
);
20148 arg2
= TYPE_MAIN_VARIANT (arg2
);
20150 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
)
20152 int i
, len2
= list_length (args2
);
20153 tree parmvec
= make_tree_vec (1);
20154 tree argvec
= make_tree_vec (len2
);
20157 /* Setup the parameter vector, which contains only ARG1. */
20158 TREE_VEC_ELT (parmvec
, 0) = arg1
;
20160 /* Setup the argument vector, which contains the remaining
20162 for (i
= 0; i
< len2
; i
++, ta
= TREE_CHAIN (ta
))
20163 TREE_VEC_ELT (argvec
, i
) = TREE_VALUE (ta
);
20165 deduce1
= (unify_pack_expansion (tparms1
, targs1
, parmvec
,
20166 argvec
, DEDUCE_EXACT
,
20167 /*subr=*/true, /*explain_p=*/false)
20170 /* We cannot deduce in the other direction, because ARG1 is
20171 a pack expansion but ARG2 is not. */
20174 else if (TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
20176 int i
, len1
= list_length (args1
);
20177 tree parmvec
= make_tree_vec (1);
20178 tree argvec
= make_tree_vec (len1
);
20181 /* Setup the parameter vector, which contains only ARG1. */
20182 TREE_VEC_ELT (parmvec
, 0) = arg2
;
20184 /* Setup the argument vector, which contains the remaining
20186 for (i
= 0; i
< len1
; i
++, ta
= TREE_CHAIN (ta
))
20187 TREE_VEC_ELT (argvec
, i
) = TREE_VALUE (ta
);
20189 deduce2
= (unify_pack_expansion (tparms2
, targs2
, parmvec
,
20190 argvec
, DEDUCE_EXACT
,
20191 /*subr=*/true, /*explain_p=*/false)
20194 /* We cannot deduce in the other direction, because ARG2 is
20195 a pack expansion but ARG1 is not.*/
20201 /* The normal case, where neither argument is a pack
20203 deduce1
= (unify (tparms1
, targs1
, arg1
, arg2
,
20204 UNIFY_ALLOW_NONE
, /*explain_p=*/false)
20206 deduce2
= (unify (tparms2
, targs2
, arg2
, arg1
,
20207 UNIFY_ALLOW_NONE
, /*explain_p=*/false)
20211 /* If we couldn't deduce arguments for tparms1 to make arg1 match
20212 arg2, then arg2 is not as specialized as arg1. */
20218 /* "If, for a given type, deduction succeeds in both directions
20219 (i.e., the types are identical after the transformations above)
20220 and both P and A were reference types (before being replaced with
20221 the type referred to above):
20222 - if the type from the argument template was an lvalue reference and
20223 the type from the parameter template was not, the argument type is
20224 considered to be more specialized than the other; otherwise,
20225 - if the type from the argument template is more cv-qualified
20226 than the type from the parameter template (as described above),
20227 the argument type is considered to be more specialized than the other;
20229 - neither type is more specialized than the other." */
20231 if (deduce1
&& deduce2
)
20233 if (ref1
&& ref2
&& ref1
!= ref2
)
20240 else if (quals1
!= quals2
&& quals1
>= 0 && quals2
>= 0)
20242 if ((quals1
& quals2
) == quals2
)
20244 if ((quals1
& quals2
) == quals1
)
20249 if (lose1
&& lose2
)
20250 /* We've failed to deduce something in either direction.
20251 These must be unordered. */
20254 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
20255 || TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
20256 /* We have already processed all of the arguments in our
20257 handing of the pack expansion type. */
20260 args1
= TREE_CHAIN (args1
);
20261 args2
= TREE_CHAIN (args2
);
20264 /* "In most cases, all template parameters must have values in order for
20265 deduction to succeed, but for partial ordering purposes a template
20266 parameter may remain without a value provided it is not used in the
20267 types being used for partial ordering."
20269 Thus, if we are missing any of the targs1 we need to substitute into
20270 origs1, then pat2 is not as specialized as pat1. This can happen when
20271 there is a nondeduced context. */
20272 if (!lose2
&& check_undeduced_parms (targs1
, origs1
, args1
))
20274 if (!lose1
&& check_undeduced_parms (targs2
, origs2
, args2
))
20277 processing_template_decl
--;
20279 /* If both deductions succeed, the partial ordering selects the more
20280 constrained template. */
20281 if (!lose1
&& !lose2
)
20283 tree c1
= get_constraints (DECL_TEMPLATE_RESULT (pat1
));
20284 tree c2
= get_constraints (DECL_TEMPLATE_RESULT (pat2
));
20285 lose1
= !subsumes_constraints (c1
, c2
);
20286 lose2
= !subsumes_constraints (c2
, c1
);
20289 /* All things being equal, if the next argument is a pack expansion
20290 for one function but not for the other, prefer the
20291 non-variadic function. FIXME this is bogus; see c++/41958. */
20293 && args1
&& TREE_VALUE (args1
)
20294 && args2
&& TREE_VALUE (args2
))
20296 lose1
= TREE_CODE (TREE_VALUE (args1
)) == TYPE_PACK_EXPANSION
;
20297 lose2
= TREE_CODE (TREE_VALUE (args2
)) == TYPE_PACK_EXPANSION
;
20300 if (lose1
== lose2
)
20308 /* Determine which of two partial specializations of TMPL is more
20311 PAT1 is a TREE_LIST whose TREE_VALUE is the TEMPLATE_DECL corresponding
20312 to the first partial specialization. The TREE_PURPOSE is the
20313 innermost set of template parameters for the partial
20314 specialization. PAT2 is similar, but for the second template.
20316 Return 1 if the first partial specialization is more specialized;
20317 -1 if the second is more specialized; 0 if neither is more
20320 See [temp.class.order] for information about determining which of
20321 two templates is more specialized. */
20324 more_specialized_partial_spec (tree tmpl
, tree pat1
, tree pat2
)
20328 bool any_deductions
= false;
20330 tree tmpl1
= TREE_VALUE (pat1
);
20331 tree tmpl2
= TREE_VALUE (pat2
);
20332 tree parms1
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl1
);
20333 tree parms2
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl2
);
20334 tree specargs1
= TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (tmpl1
)));
20335 tree specargs2
= TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (tmpl2
)));
20337 /* Just like what happens for functions, if we are ordering between
20338 different template specializations, we may encounter dependent
20339 types in the arguments, and we need our dependency check functions
20340 to behave correctly. */
20341 ++processing_template_decl
;
20342 targs
= get_partial_spec_bindings (tmpl
, parms1
, specargs1
, specargs2
);
20346 any_deductions
= true;
20349 targs
= get_partial_spec_bindings (tmpl
, parms2
, specargs2
, specargs1
);
20353 any_deductions
= true;
20355 --processing_template_decl
;
20357 /* If both deductions succeed, the partial ordering selects the more
20358 constrained template. */
20359 if (!winner
&& any_deductions
)
20360 return more_constrained (tmpl1
, tmpl2
);
20362 /* In the case of a tie where at least one of the templates
20363 has a parameter pack at the end, the template with the most
20364 non-packed parameters wins. */
20367 && (template_args_variadic_p (TREE_PURPOSE (pat1
))
20368 || template_args_variadic_p (TREE_PURPOSE (pat2
))))
20370 tree args1
= INNERMOST_TEMPLATE_ARGS (TREE_PURPOSE (pat1
));
20371 tree args2
= INNERMOST_TEMPLATE_ARGS (TREE_PURPOSE (pat2
));
20372 int len1
= TREE_VEC_LENGTH (args1
);
20373 int len2
= TREE_VEC_LENGTH (args2
);
20375 /* We don't count the pack expansion at the end. */
20376 if (template_args_variadic_p (TREE_PURPOSE (pat1
)))
20378 if (template_args_variadic_p (TREE_PURPOSE (pat2
)))
20383 else if (len1
< len2
)
20390 /* Return the template arguments that will produce the function signature
20391 DECL from the function template FN, with the explicit template
20392 arguments EXPLICIT_ARGS. If CHECK_RETTYPE is true, the return type must
20393 also match. Return NULL_TREE if no satisfactory arguments could be
20397 get_bindings (tree fn
, tree decl
, tree explicit_args
, bool check_rettype
)
20399 int ntparms
= DECL_NTPARMS (fn
);
20400 tree targs
= make_tree_vec (ntparms
);
20401 tree decl_type
= TREE_TYPE (decl
);
20402 tree decl_arg_types
;
20404 unsigned int nargs
, ix
;
20407 gcc_assert (decl
!= DECL_TEMPLATE_RESULT (fn
));
20409 /* Never do unification on the 'this' parameter. */
20410 decl_arg_types
= skip_artificial_parms_for (decl
,
20411 TYPE_ARG_TYPES (decl_type
));
20413 nargs
= list_length (decl_arg_types
);
20414 args
= XALLOCAVEC (tree
, nargs
);
20415 for (arg
= decl_arg_types
, ix
= 0;
20416 arg
!= NULL_TREE
&& arg
!= void_list_node
;
20417 arg
= TREE_CHAIN (arg
), ++ix
)
20418 args
[ix
] = TREE_VALUE (arg
);
20420 if (fn_type_unification (fn
, explicit_args
, targs
,
20422 (check_rettype
|| DECL_CONV_FN_P (fn
)
20423 ? TREE_TYPE (decl_type
) : NULL_TREE
),
20424 DEDUCE_EXACT
, LOOKUP_NORMAL
, /*explain_p=*/false,
20426 == error_mark_node
)
20432 /* Return the innermost template arguments that, when applied to a partial
20433 specialization of TMPL whose innermost template parameters are
20434 TPARMS, and whose specialization arguments are SPEC_ARGS, yield the
20437 For example, suppose we have:
20439 template <class T, class U> struct S {};
20440 template <class T> struct S<T*, int> {};
20442 Then, suppose we want to get `S<double*, int>'. The TPARMS will be
20443 {T}, the SPEC_ARGS will be {T*, int} and the ARGS will be {double*,
20444 int}. The resulting vector will be {double}, indicating that `T'
20445 is bound to `double'. */
20448 get_partial_spec_bindings (tree tmpl
, tree tparms
, tree spec_args
, tree args
)
20450 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
20452 tree innermost_deduced_args
;
20454 innermost_deduced_args
= make_tree_vec (ntparms
);
20455 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
20457 deduced_args
= copy_node (args
);
20458 SET_TMPL_ARGS_LEVEL (deduced_args
,
20459 TMPL_ARGS_DEPTH (deduced_args
),
20460 innermost_deduced_args
);
20463 deduced_args
= innermost_deduced_args
;
20465 if (unify (tparms
, deduced_args
,
20466 INNERMOST_TEMPLATE_ARGS (spec_args
),
20467 INNERMOST_TEMPLATE_ARGS (args
),
20468 UNIFY_ALLOW_NONE
, /*explain_p=*/false))
20471 for (i
= 0; i
< ntparms
; ++i
)
20472 if (! TREE_VEC_ELT (innermost_deduced_args
, i
))
20475 /* Verify that nondeduced template arguments agree with the type
20476 obtained from argument deduction.
20480 struct A { typedef int X; };
20481 template <class T, class U> struct C {};
20482 template <class T> struct C<T, typename T::X> {};
20484 Then with the instantiation `C<A, int>', we can deduce that
20485 `T' is `A' but unify () does not check whether `typename T::X'
20487 spec_args
= tsubst (spec_args
, deduced_args
, tf_none
, NULL_TREE
);
20488 spec_args
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
20490 tf_none
, false, false);
20491 if (spec_args
== error_mark_node
20492 /* We only need to check the innermost arguments; the other
20493 arguments will always agree. */
20494 || !comp_template_args (INNERMOST_TEMPLATE_ARGS (spec_args
),
20495 INNERMOST_TEMPLATE_ARGS (args
)))
20498 /* Now that we have bindings for all of the template arguments,
20499 ensure that the arguments deduced for the template template
20500 parameters have compatible template parameter lists. See the use
20501 of template_template_parm_bindings_ok_p in fn_type_unification
20502 for more information. */
20503 if (!template_template_parm_bindings_ok_p (tparms
, deduced_args
))
20506 return deduced_args
;
20509 // Compare two function templates T1 and T2 by deducing bindings
20510 // from one against the other. If both deductions succeed, compare
20511 // constraints to see which is more constrained.
20513 more_specialized_inst (tree t1
, tree t2
)
20518 if (get_bindings (t1
, DECL_TEMPLATE_RESULT (t2
), NULL_TREE
, true))
20524 if (get_bindings (t2
, DECL_TEMPLATE_RESULT (t1
), NULL_TREE
, true))
20530 // If both deductions succeed, then one may be more constrained.
20531 if (count
== 2 && fate
== 0)
20532 fate
= more_constrained (t1
, t2
);
20537 /* TEMPLATES is a TREE_LIST. Each TREE_VALUE is a TEMPLATE_DECL.
20538 Return the TREE_LIST node with the most specialized template, if
20539 any. If there is no most specialized template, the error_mark_node
20542 Note that this function does not look at, or modify, the
20543 TREE_PURPOSE or TREE_TYPE of any of the nodes. Since the node
20544 returned is one of the elements of INSTANTIATIONS, callers may
20545 store information in the TREE_PURPOSE or TREE_TYPE of the nodes,
20546 and retrieve it from the value returned. */
20549 most_specialized_instantiation (tree templates
)
20553 ++processing_template_decl
;
20556 for (fn
= TREE_CHAIN (templates
); fn
; fn
= TREE_CHAIN (fn
))
20558 int fate
= more_specialized_inst (TREE_VALUE (champ
), TREE_VALUE (fn
));
20563 /* Equally specialized, move to next function. If there
20564 is no next function, nothing's most specialized. */
20565 fn
= TREE_CHAIN (fn
);
20573 /* Now verify that champ is better than everything earlier in the
20574 instantiation list. */
20575 for (fn
= templates
; fn
!= champ
; fn
= TREE_CHAIN (fn
)) {
20576 if (more_specialized_inst (TREE_VALUE (champ
), TREE_VALUE (fn
)) != 1)
20583 processing_template_decl
--;
20586 return error_mark_node
;
20591 /* If DECL is a specialization of some template, return the most
20592 general such template. Otherwise, returns NULL_TREE.
20594 For example, given:
20596 template <class T> struct S { template <class U> void f(U); };
20598 if TMPL is `template <class U> void S<int>::f(U)' this will return
20599 the full template. This function will not trace past partial
20600 specializations, however. For example, given in addition:
20602 template <class T> struct S<T*> { template <class U> void f(U); };
20604 if TMPL is `template <class U> void S<int*>::f(U)' this will return
20605 `template <class T> template <class U> S<T*>::f(U)'. */
20608 most_general_template (tree decl
)
20610 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
20612 if (tree tinfo
= get_template_info (decl
))
20613 decl
= TI_TEMPLATE (tinfo
);
20614 /* The TI_TEMPLATE can be an IDENTIFIER_NODE for a
20615 template friend, or a FIELD_DECL for a capture pack. */
20616 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
20620 /* Look for more and more general templates. */
20621 while (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
))
20623 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE in some cases.
20624 (See cp-tree.h for details.) */
20625 if (TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
20628 if (CLASS_TYPE_P (TREE_TYPE (decl
))
20629 && !TYPE_DECL_ALIAS_P (TYPE_NAME (TREE_TYPE (decl
)))
20630 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)))
20633 /* Stop if we run into an explicitly specialized class template. */
20634 if (!DECL_NAMESPACE_SCOPE_P (decl
)
20635 && DECL_CONTEXT (decl
)
20636 && CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (decl
)))
20639 decl
= DECL_TI_TEMPLATE (decl
);
20645 /* Return the most specialized of the template partial specializations
20646 which can produce TARGET, a specialization of some class or variable
20647 template. The value returned is actually a TREE_LIST; the TREE_VALUE is
20648 a TEMPLATE_DECL node corresponding to the partial specialization, while
20649 the TREE_PURPOSE is the set of template arguments that must be
20650 substituted into the template pattern in order to generate TARGET.
20652 If the choice of partial specialization is ambiguous, a diagnostic
20653 is issued, and the error_mark_node is returned. If there are no
20654 partial specializations matching TARGET, then NULL_TREE is
20655 returned, indicating that the primary template should be used. */
20658 most_specialized_partial_spec (tree target
, tsubst_flags_t complain
)
20660 tree list
= NULL_TREE
;
20665 tree outer_args
= NULL_TREE
;
20668 if (TYPE_P (target
))
20670 tree tinfo
= CLASSTYPE_TEMPLATE_INFO (target
);
20671 tmpl
= TI_TEMPLATE (tinfo
);
20672 args
= TI_ARGS (tinfo
);
20674 else if (TREE_CODE (target
) == TEMPLATE_ID_EXPR
)
20676 tmpl
= TREE_OPERAND (target
, 0);
20677 args
= TREE_OPERAND (target
, 1);
20679 else if (VAR_P (target
))
20681 tree tinfo
= DECL_TEMPLATE_INFO (target
);
20682 tmpl
= TI_TEMPLATE (tinfo
);
20683 args
= TI_ARGS (tinfo
);
20686 gcc_unreachable ();
20688 tree main_tmpl
= most_general_template (tmpl
);
20690 /* For determining which partial specialization to use, only the
20691 innermost args are interesting. */
20692 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
20694 outer_args
= strip_innermost_template_args (args
, 1);
20695 args
= INNERMOST_TEMPLATE_ARGS (args
);
20698 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (main_tmpl
); t
; t
= TREE_CHAIN (t
))
20700 tree partial_spec_args
;
20702 tree spec_tmpl
= TREE_VALUE (t
);
20704 partial_spec_args
= TREE_PURPOSE (t
);
20706 ++processing_template_decl
;
20710 /* Discard the outer levels of args, and then substitute in the
20711 template args from the enclosing class. */
20712 partial_spec_args
= INNERMOST_TEMPLATE_ARGS (partial_spec_args
);
20713 partial_spec_args
= tsubst_template_args
20714 (partial_spec_args
, outer_args
, tf_none
, NULL_TREE
);
20716 /* And the same for the partial specialization TEMPLATE_DECL. */
20717 spec_tmpl
= tsubst (spec_tmpl
, outer_args
, tf_none
, NULL_TREE
);
20720 partial_spec_args
=
20721 coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
20724 /*require_all_args=*/true,
20725 /*use_default_args=*/true);
20727 --processing_template_decl
;
20729 if (partial_spec_args
== error_mark_node
)
20730 return error_mark_node
;
20731 if (spec_tmpl
== error_mark_node
)
20732 return error_mark_node
;
20734 tree parms
= DECL_INNERMOST_TEMPLATE_PARMS (spec_tmpl
);
20735 spec_args
= get_partial_spec_bindings (tmpl
, parms
,
20741 spec_args
= add_to_template_args (outer_args
, spec_args
);
20743 /* Keep the candidate only if the constraints are satisfied,
20744 or if we're not compiling with concepts. */
20746 || constraints_satisfied_p (spec_tmpl
, spec_args
))
20748 list
= tree_cons (spec_args
, TREE_VALUE (t
), list
);
20749 TREE_TYPE (list
) = TREE_TYPE (t
);
20757 ambiguous_p
= false;
20760 t
= TREE_CHAIN (t
);
20761 for (; t
; t
= TREE_CHAIN (t
))
20763 fate
= more_specialized_partial_spec (tmpl
, champ
, t
);
20770 t
= TREE_CHAIN (t
);
20773 ambiguous_p
= true;
20782 for (t
= list
; t
&& t
!= champ
; t
= TREE_CHAIN (t
))
20784 fate
= more_specialized_partial_spec (tmpl
, champ
, t
);
20787 ambiguous_p
= true;
20795 char *spaces
= NULL
;
20796 if (!(complain
& tf_error
))
20797 return error_mark_node
;
20798 if (TYPE_P (target
))
20799 error ("ambiguous template instantiation for %q#T", target
);
20801 error ("ambiguous template instantiation for %q#D", target
);
20802 str
= ngettext ("candidate is:", "candidates are:", list_length (list
));
20803 for (t
= list
; t
; t
= TREE_CHAIN (t
))
20805 tree subst
= build_tree_list (TREE_VALUE (t
), TREE_PURPOSE (t
));
20806 inform (DECL_SOURCE_LOCATION (TREE_VALUE (t
)),
20807 "%s %#S", spaces
? spaces
: str
, subst
);
20808 spaces
= spaces
? spaces
: get_spaces (str
);
20811 return error_mark_node
;
20817 /* Explicitly instantiate DECL. */
20820 do_decl_instantiation (tree decl
, tree storage
)
20822 tree result
= NULL_TREE
;
20825 if (!decl
|| decl
== error_mark_node
)
20826 /* An error occurred, for which grokdeclarator has already issued
20827 an appropriate message. */
20829 else if (! DECL_LANG_SPECIFIC (decl
))
20831 error ("explicit instantiation of non-template %q#D", decl
);
20835 bool var_templ
= (DECL_TEMPLATE_INFO (decl
)
20836 && variable_template_p (DECL_TI_TEMPLATE (decl
)));
20838 if (VAR_P (decl
) && !var_templ
)
20840 /* There is an asymmetry here in the way VAR_DECLs and
20841 FUNCTION_DECLs are handled by grokdeclarator. In the case of
20842 the latter, the DECL we get back will be marked as a
20843 template instantiation, and the appropriate
20844 DECL_TEMPLATE_INFO will be set up. This does not happen for
20845 VAR_DECLs so we do the lookup here. Probably, grokdeclarator
20846 should handle VAR_DECLs as it currently handles
20848 if (!DECL_CLASS_SCOPE_P (decl
))
20850 error ("%qD is not a static data member of a class template", decl
);
20853 result
= lookup_field (DECL_CONTEXT (decl
), DECL_NAME (decl
), 0, false);
20854 if (!result
|| !VAR_P (result
))
20856 error ("no matching template for %qD found", decl
);
20859 if (!same_type_p (TREE_TYPE (result
), TREE_TYPE (decl
)))
20861 error ("type %qT for explicit instantiation %qD does not match "
20862 "declared type %qT", TREE_TYPE (result
), decl
,
20867 else if (TREE_CODE (decl
) != FUNCTION_DECL
&& !var_templ
)
20869 error ("explicit instantiation of %q#D", decl
);
20875 /* Check for various error cases. Note that if the explicit
20876 instantiation is valid the RESULT will currently be marked as an
20877 *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set
20878 until we get here. */
20880 if (DECL_TEMPLATE_SPECIALIZATION (result
))
20882 /* DR 259 [temp.spec].
20884 Both an explicit instantiation and a declaration of an explicit
20885 specialization shall not appear in a program unless the explicit
20886 instantiation follows a declaration of the explicit specialization.
20888 For a given set of template parameters, if an explicit
20889 instantiation of a template appears after a declaration of an
20890 explicit specialization for that template, the explicit
20891 instantiation has no effect. */
20894 else if (DECL_EXPLICIT_INSTANTIATION (result
))
20898 No program shall explicitly instantiate any template more
20901 We check DECL_NOT_REALLY_EXTERN so as not to complain when
20902 the first instantiation was `extern' and the second is not,
20903 and EXTERN_P for the opposite case. */
20904 if (DECL_NOT_REALLY_EXTERN (result
) && !extern_p
)
20905 permerror (input_location
, "duplicate explicit instantiation of %q#D", result
);
20906 /* If an "extern" explicit instantiation follows an ordinary
20907 explicit instantiation, the template is instantiated. */
20911 else if (!DECL_IMPLICIT_INSTANTIATION (result
))
20913 error ("no matching template for %qD found", result
);
20916 else if (!DECL_TEMPLATE_INFO (result
))
20918 permerror (input_location
, "explicit instantiation of non-template %q#D", result
);
20922 if (storage
== NULL_TREE
)
20924 else if (storage
== ridpointers
[(int) RID_EXTERN
])
20926 if (!in_system_header_at (input_location
) && (cxx_dialect
== cxx98
))
20927 pedwarn (input_location
, OPT_Wpedantic
,
20928 "ISO C++ 1998 forbids the use of %<extern%> on explicit "
20933 error ("storage class %qD applied to template instantiation", storage
);
20935 check_explicit_instantiation_namespace (result
);
20936 mark_decl_instantiated (result
, extern_p
);
20938 instantiate_decl (result
, /*defer_ok=*/1,
20939 /*expl_inst_class_mem_p=*/false);
20943 mark_class_instantiated (tree t
, int extern_p
)
20945 SET_CLASSTYPE_EXPLICIT_INSTANTIATION (t
);
20946 SET_CLASSTYPE_INTERFACE_KNOWN (t
);
20947 CLASSTYPE_INTERFACE_ONLY (t
) = extern_p
;
20948 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (t
)) = extern_p
;
20951 CLASSTYPE_DEBUG_REQUESTED (t
) = 1;
20952 rest_of_type_compilation (t
, 1);
20956 /* Called from do_type_instantiation through binding_table_foreach to
20957 do recursive instantiation for the type bound in ENTRY. */
20959 bt_instantiate_type_proc (binding_entry entry
, void *data
)
20961 tree storage
= *(tree
*) data
;
20963 if (MAYBE_CLASS_TYPE_P (entry
->type
)
20964 && !uses_template_parms (CLASSTYPE_TI_ARGS (entry
->type
)))
20965 do_type_instantiation (TYPE_MAIN_DECL (entry
->type
), storage
, 0);
20968 /* Called from do_type_instantiation to instantiate a member
20969 (a member function or a static member variable) of an
20970 explicitly instantiated class template. */
20972 instantiate_class_member (tree decl
, int extern_p
)
20974 mark_decl_instantiated (decl
, extern_p
);
20976 instantiate_decl (decl
, /*defer_ok=*/1,
20977 /*expl_inst_class_mem_p=*/true);
20980 /* Perform an explicit instantiation of template class T. STORAGE, if
20981 non-null, is the RID for extern, inline or static. COMPLAIN is
20982 nonzero if this is called from the parser, zero if called recursively,
20983 since the standard is unclear (as detailed below). */
20986 do_type_instantiation (tree t
, tree storage
, tsubst_flags_t complain
)
20991 int previous_instantiation_extern_p
= 0;
20993 if (TREE_CODE (t
) == TYPE_DECL
)
20996 if (! CLASS_TYPE_P (t
) || ! CLASSTYPE_TEMPLATE_INFO (t
))
20999 (TYPE_TEMPLATE_INFO (t
)) ? TYPE_TI_TEMPLATE (t
) : NULL
;
21001 error ("explicit instantiation of non-class template %qD", tmpl
);
21003 error ("explicit instantiation of non-template type %qT", t
);
21009 if (!COMPLETE_TYPE_P (t
))
21011 if (complain
& tf_error
)
21012 error ("explicit instantiation of %q#T before definition of template",
21017 if (storage
!= NULL_TREE
)
21019 if (!in_system_header_at (input_location
))
21021 if (storage
== ridpointers
[(int) RID_EXTERN
])
21023 if (cxx_dialect
== cxx98
)
21024 pedwarn (input_location
, OPT_Wpedantic
,
21025 "ISO C++ 1998 forbids the use of %<extern%> on "
21026 "explicit instantiations");
21029 pedwarn (input_location
, OPT_Wpedantic
,
21030 "ISO C++ forbids the use of %qE"
21031 " on explicit instantiations", storage
);
21034 if (storage
== ridpointers
[(int) RID_INLINE
])
21036 else if (storage
== ridpointers
[(int) RID_EXTERN
])
21038 else if (storage
== ridpointers
[(int) RID_STATIC
])
21042 error ("storage class %qD applied to template instantiation",
21048 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
21050 /* DR 259 [temp.spec].
21052 Both an explicit instantiation and a declaration of an explicit
21053 specialization shall not appear in a program unless the explicit
21054 instantiation follows a declaration of the explicit specialization.
21056 For a given set of template parameters, if an explicit
21057 instantiation of a template appears after a declaration of an
21058 explicit specialization for that template, the explicit
21059 instantiation has no effect. */
21062 else if (CLASSTYPE_EXPLICIT_INSTANTIATION (t
))
21066 No program shall explicitly instantiate any template more
21069 If PREVIOUS_INSTANTIATION_EXTERN_P, then the first explicit
21070 instantiation was `extern'. If EXTERN_P then the second is.
21071 These cases are OK. */
21072 previous_instantiation_extern_p
= CLASSTYPE_INTERFACE_ONLY (t
);
21074 if (!previous_instantiation_extern_p
&& !extern_p
21075 && (complain
& tf_error
))
21076 permerror (input_location
, "duplicate explicit instantiation of %q#T", t
);
21078 /* If we've already instantiated the template, just return now. */
21079 if (!CLASSTYPE_INTERFACE_ONLY (t
))
21083 check_explicit_instantiation_namespace (TYPE_NAME (t
));
21084 mark_class_instantiated (t
, extern_p
);
21092 /* In contrast to implicit instantiation, where only the
21093 declarations, and not the definitions, of members are
21094 instantiated, we have here:
21098 The explicit instantiation of a class template specialization
21099 implies the instantiation of all of its members not
21100 previously explicitly specialized in the translation unit
21101 containing the explicit instantiation.
21103 Of course, we can't instantiate member template classes, since
21104 we don't have any arguments for them. Note that the standard
21105 is unclear on whether the instantiation of the members are
21106 *explicit* instantiations or not. However, the most natural
21107 interpretation is that it should be an explicit instantiation. */
21110 for (tmp
= TYPE_METHODS (t
); tmp
; tmp
= DECL_CHAIN (tmp
))
21111 if (TREE_CODE (tmp
) == FUNCTION_DECL
21112 && DECL_TEMPLATE_INSTANTIATION (tmp
))
21113 instantiate_class_member (tmp
, extern_p
);
21115 for (tmp
= TYPE_FIELDS (t
); tmp
; tmp
= DECL_CHAIN (tmp
))
21116 if (VAR_P (tmp
) && DECL_TEMPLATE_INSTANTIATION (tmp
))
21117 instantiate_class_member (tmp
, extern_p
);
21119 if (CLASSTYPE_NESTED_UTDS (t
))
21120 binding_table_foreach (CLASSTYPE_NESTED_UTDS (t
),
21121 bt_instantiate_type_proc
, &storage
);
21125 /* Given a function DECL, which is a specialization of TMPL, modify
21126 DECL to be a re-instantiation of TMPL with the same template
21127 arguments. TMPL should be the template into which tsubst'ing
21128 should occur for DECL, not the most general template.
21130 One reason for doing this is a scenario like this:
21133 void f(const T&, int i);
21135 void g() { f(3, 7); }
21138 void f(const T& t, const int i) { }
21140 Note that when the template is first instantiated, with
21141 instantiate_template, the resulting DECL will have no name for the
21142 first parameter, and the wrong type for the second. So, when we go
21143 to instantiate the DECL, we regenerate it. */
21146 regenerate_decl_from_template (tree decl
, tree tmpl
)
21148 /* The arguments used to instantiate DECL, from the most general
21153 args
= DECL_TI_ARGS (decl
);
21154 code_pattern
= DECL_TEMPLATE_RESULT (tmpl
);
21156 /* Make sure that we can see identifiers, and compute access
21158 push_access_scope (decl
);
21160 if (TREE_CODE (decl
) == FUNCTION_DECL
)
21168 args_depth
= TMPL_ARGS_DEPTH (args
);
21169 parms_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
21170 if (args_depth
> parms_depth
)
21171 args
= get_innermost_template_args (args
, parms_depth
);
21173 specs
= tsubst_exception_specification (TREE_TYPE (code_pattern
),
21174 args
, tf_error
, NULL_TREE
,
21175 /*defer_ok*/false);
21176 if (specs
&& specs
!= error_mark_node
)
21177 TREE_TYPE (decl
) = build_exception_variant (TREE_TYPE (decl
),
21180 /* Merge parameter declarations. */
21181 decl_parm
= skip_artificial_parms_for (decl
,
21182 DECL_ARGUMENTS (decl
));
21184 = skip_artificial_parms_for (code_pattern
,
21185 DECL_ARGUMENTS (code_pattern
));
21186 while (decl_parm
&& !DECL_PACK_P (pattern_parm
))
21191 if (DECL_NAME (decl_parm
) != DECL_NAME (pattern_parm
))
21192 DECL_NAME (decl_parm
) = DECL_NAME (pattern_parm
);
21193 parm_type
= tsubst (TREE_TYPE (pattern_parm
), args
, tf_error
,
21195 parm_type
= type_decays_to (parm_type
);
21196 if (!same_type_p (TREE_TYPE (decl_parm
), parm_type
))
21197 TREE_TYPE (decl_parm
) = parm_type
;
21198 attributes
= DECL_ATTRIBUTES (pattern_parm
);
21199 if (DECL_ATTRIBUTES (decl_parm
) != attributes
)
21201 DECL_ATTRIBUTES (decl_parm
) = attributes
;
21202 cplus_decl_attributes (&decl_parm
, attributes
, /*flags=*/0);
21204 decl_parm
= DECL_CHAIN (decl_parm
);
21205 pattern_parm
= DECL_CHAIN (pattern_parm
);
21207 /* Merge any parameters that match with the function parameter
21209 if (pattern_parm
&& DECL_PACK_P (pattern_parm
))
21212 tree expanded_types
;
21213 /* Expand the TYPE_PACK_EXPANSION that provides the types for
21214 the parameters in this function parameter pack. */
21215 expanded_types
= tsubst_pack_expansion (TREE_TYPE (pattern_parm
),
21216 args
, tf_error
, NULL_TREE
);
21217 len
= TREE_VEC_LENGTH (expanded_types
);
21218 for (i
= 0; i
< len
; i
++)
21223 if (DECL_NAME (decl_parm
) != DECL_NAME (pattern_parm
))
21224 /* Rename the parameter to include the index. */
21225 DECL_NAME (decl_parm
) =
21226 make_ith_pack_parameter_name (DECL_NAME (pattern_parm
), i
);
21227 parm_type
= TREE_VEC_ELT (expanded_types
, i
);
21228 parm_type
= type_decays_to (parm_type
);
21229 if (!same_type_p (TREE_TYPE (decl_parm
), parm_type
))
21230 TREE_TYPE (decl_parm
) = parm_type
;
21231 attributes
= DECL_ATTRIBUTES (pattern_parm
);
21232 if (DECL_ATTRIBUTES (decl_parm
) != attributes
)
21234 DECL_ATTRIBUTES (decl_parm
) = attributes
;
21235 cplus_decl_attributes (&decl_parm
, attributes
, /*flags=*/0);
21237 decl_parm
= DECL_CHAIN (decl_parm
);
21240 /* Merge additional specifiers from the CODE_PATTERN. */
21241 if (DECL_DECLARED_INLINE_P (code_pattern
)
21242 && !DECL_DECLARED_INLINE_P (decl
))
21243 DECL_DECLARED_INLINE_P (decl
) = 1;
21245 else if (VAR_P (decl
))
21247 DECL_INITIAL (decl
) =
21248 tsubst_expr (DECL_INITIAL (code_pattern
), args
,
21249 tf_error
, DECL_TI_TEMPLATE (decl
),
21250 /*integral_constant_expression_p=*/false);
21251 if (VAR_HAD_UNKNOWN_BOUND (decl
))
21252 TREE_TYPE (decl
) = tsubst (TREE_TYPE (code_pattern
), args
,
21253 tf_error
, DECL_TI_TEMPLATE (decl
));
21256 gcc_unreachable ();
21258 pop_access_scope (decl
);
21261 /* Return the TEMPLATE_DECL into which DECL_TI_ARGS(DECL) should be
21262 substituted to get DECL. */
21265 template_for_substitution (tree decl
)
21267 tree tmpl
= DECL_TI_TEMPLATE (decl
);
21269 /* Set TMPL to the template whose DECL_TEMPLATE_RESULT is the pattern
21270 for the instantiation. This is not always the most general
21271 template. Consider, for example:
21274 struct S { template <class U> void f();
21275 template <> void f<int>(); };
21277 and an instantiation of S<double>::f<int>. We want TD to be the
21278 specialization S<T>::f<int>, not the more general S<T>::f<U>. */
21279 while (/* An instantiation cannot have a definition, so we need a
21280 more general template. */
21281 DECL_TEMPLATE_INSTANTIATION (tmpl
)
21282 /* We must also deal with friend templates. Given:
21284 template <class T> struct S {
21285 template <class U> friend void f() {};
21288 S<int>::f<U> say, is not an instantiation of S<T>::f<U>,
21289 so far as the language is concerned, but that's still
21290 where we get the pattern for the instantiation from. On
21291 other hand, if the definition comes outside the class, say:
21293 template <class T> struct S {
21294 template <class U> friend void f();
21296 template <class U> friend void f() {}
21298 we don't need to look any further. That's what the check for
21299 DECL_INITIAL is for. */
21300 || (TREE_CODE (decl
) == FUNCTION_DECL
21301 && DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (tmpl
)
21302 && !DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl
))))
21304 /* The present template, TD, should not be a definition. If it
21305 were a definition, we should be using it! Note that we
21306 cannot restructure the loop to just keep going until we find
21307 a template with a definition, since that might go too far if
21308 a specialization was declared, but not defined. */
21310 /* Fetch the more general template. */
21311 tmpl
= DECL_TI_TEMPLATE (tmpl
);
21317 /* Returns true if we need to instantiate this template instance even if we
21318 know we aren't going to emit it. */
21321 always_instantiate_p (tree decl
)
21323 /* We always instantiate inline functions so that we can inline them. An
21324 explicit instantiation declaration prohibits implicit instantiation of
21325 non-inline functions. With high levels of optimization, we would
21326 normally inline non-inline functions -- but we're not allowed to do
21327 that for "extern template" functions. Therefore, we check
21328 DECL_DECLARED_INLINE_P, rather than possibly_inlined_p. */
21329 return ((TREE_CODE (decl
) == FUNCTION_DECL
21330 && (DECL_DECLARED_INLINE_P (decl
)
21331 || type_uses_auto (TREE_TYPE (TREE_TYPE (decl
)))))
21332 /* And we need to instantiate static data members so that
21333 their initializers are available in integral constant
21336 && decl_maybe_constant_var_p (decl
)));
21339 /* If FN has a noexcept-specifier that hasn't been instantiated yet,
21340 instantiate it now, modifying TREE_TYPE (fn). */
21343 maybe_instantiate_noexcept (tree fn
)
21345 tree fntype
, spec
, noex
, clone
;
21347 /* Don't instantiate a noexcept-specification from template context. */
21348 if (processing_template_decl
)
21351 if (DECL_CLONED_FUNCTION_P (fn
))
21352 fn
= DECL_CLONED_FUNCTION (fn
);
21353 fntype
= TREE_TYPE (fn
);
21354 spec
= TYPE_RAISES_EXCEPTIONS (fntype
);
21356 if (!spec
|| !TREE_PURPOSE (spec
))
21359 noex
= TREE_PURPOSE (spec
);
21361 if (TREE_CODE (noex
) == DEFERRED_NOEXCEPT
)
21363 if (DEFERRED_NOEXCEPT_PATTERN (noex
) == NULL_TREE
)
21364 spec
= get_defaulted_eh_spec (fn
);
21365 else if (push_tinst_level (fn
))
21367 push_access_scope (fn
);
21368 push_deferring_access_checks (dk_no_deferred
);
21369 input_location
= DECL_SOURCE_LOCATION (fn
);
21370 noex
= tsubst_copy_and_build (DEFERRED_NOEXCEPT_PATTERN (noex
),
21371 DEFERRED_NOEXCEPT_ARGS (noex
),
21372 tf_warning_or_error
, fn
,
21373 /*function_p=*/false,
21374 /*integral_constant_expression_p=*/true);
21375 pop_deferring_access_checks ();
21376 pop_access_scope (fn
);
21377 pop_tinst_level ();
21378 spec
= build_noexcept_spec (noex
, tf_warning_or_error
);
21379 if (spec
== error_mark_node
)
21380 spec
= noexcept_false_spec
;
21383 spec
= noexcept_false_spec
;
21385 TREE_TYPE (fn
) = build_exception_variant (fntype
, spec
);
21388 FOR_EACH_CLONE (clone
, fn
)
21390 if (TREE_TYPE (clone
) == fntype
)
21391 TREE_TYPE (clone
) = TREE_TYPE (fn
);
21393 TREE_TYPE (clone
) = build_exception_variant (TREE_TYPE (clone
), spec
);
21397 /* Produce the definition of D, a _DECL generated from a template. If
21398 DEFER_OK is nonzero, then we don't have to actually do the
21399 instantiation now; we just have to do it sometime. Normally it is
21400 an error if this is an explicit instantiation but D is undefined.
21401 EXPL_INST_CLASS_MEM_P is true iff D is a member of an
21402 explicitly instantiated class template. */
21405 instantiate_decl (tree d
, int defer_ok
,
21406 bool expl_inst_class_mem_p
)
21408 tree tmpl
= DECL_TI_TEMPLATE (d
);
21415 bool pattern_defined
;
21416 location_t saved_loc
= input_location
;
21417 int saved_unevaluated_operand
= cp_unevaluated_operand
;
21418 int saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
21422 bool nested
= false;
21424 /* This function should only be used to instantiate templates for
21425 functions and static member variables. */
21426 gcc_assert (VAR_OR_FUNCTION_DECL_P (d
));
21428 /* A concept is never instantiated. */
21429 gcc_assert (!DECL_DECLARED_CONCEPT_P (d
));
21431 /* Variables are never deferred; if instantiation is required, they
21432 are instantiated right away. That allows for better code in the
21433 case that an expression refers to the value of the variable --
21434 if the variable has a constant value the referring expression can
21435 take advantage of that fact. */
21437 || DECL_DECLARED_CONSTEXPR_P (d
))
21440 /* Don't instantiate cloned functions. Instead, instantiate the
21441 functions they cloned. */
21442 if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_CLONED_FUNCTION_P (d
))
21443 d
= DECL_CLONED_FUNCTION (d
);
21445 if (DECL_TEMPLATE_INSTANTIATED (d
)
21446 || (TREE_CODE (d
) == FUNCTION_DECL
21447 && DECL_DEFAULTED_FN (d
) && DECL_INITIAL (d
))
21448 || DECL_TEMPLATE_SPECIALIZATION (d
))
21449 /* D has already been instantiated or explicitly specialized, so
21450 there's nothing for us to do here.
21452 It might seem reasonable to check whether or not D is an explicit
21453 instantiation, and, if so, stop here. But when an explicit
21454 instantiation is deferred until the end of the compilation,
21455 DECL_EXPLICIT_INSTANTIATION is set, even though we still need to do
21456 the instantiation. */
21459 /* Check to see whether we know that this template will be
21460 instantiated in some other file, as with "extern template"
21462 external_p
= (DECL_INTERFACE_KNOWN (d
) && DECL_REALLY_EXTERN (d
));
21464 /* In general, we do not instantiate such templates. */
21465 if (external_p
&& !always_instantiate_p (d
))
21468 gen_tmpl
= most_general_template (tmpl
);
21469 gen_args
= DECL_TI_ARGS (d
);
21471 if (tmpl
!= gen_tmpl
)
21472 /* We should already have the extra args. */
21473 gcc_assert (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (gen_tmpl
))
21474 == TMPL_ARGS_DEPTH (gen_args
));
21475 /* And what's in the hash table should match D. */
21476 gcc_assert ((spec
= retrieve_specialization (gen_tmpl
, gen_args
, 0)) == d
21477 || spec
== NULL_TREE
);
21479 /* This needs to happen before any tsubsting. */
21480 if (! push_tinst_level (d
))
21483 timevar_push (TV_TEMPLATE_INST
);
21485 /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern
21486 for the instantiation. */
21487 td
= template_for_substitution (d
);
21488 code_pattern
= DECL_TEMPLATE_RESULT (td
);
21490 /* We should never be trying to instantiate a member of a class
21491 template or partial specialization. */
21492 gcc_assert (d
!= code_pattern
);
21494 if ((DECL_NAMESPACE_SCOPE_P (d
) && !DECL_INITIALIZED_IN_CLASS_P (d
))
21495 || DECL_TEMPLATE_SPECIALIZATION (td
))
21496 /* In the case of a friend template whose definition is provided
21497 outside the class, we may have too many arguments. Drop the
21498 ones we don't need. The same is true for specializations. */
21499 args
= get_innermost_template_args
21500 (gen_args
, TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (td
)));
21504 if (TREE_CODE (d
) == FUNCTION_DECL
)
21506 deleted_p
= DECL_DELETED_FN (code_pattern
);
21507 pattern_defined
= (DECL_SAVED_TREE (code_pattern
) != NULL_TREE
21508 || DECL_DEFAULTED_OUTSIDE_CLASS_P (code_pattern
)
21514 pattern_defined
= ! DECL_IN_AGGR_P (code_pattern
);
21517 /* We may be in the middle of deferred access check. Disable it now. */
21518 push_deferring_access_checks (dk_no_deferred
);
21520 /* Unless an explicit instantiation directive has already determined
21521 the linkage of D, remember that a definition is available for
21523 if (pattern_defined
21524 && !DECL_INTERFACE_KNOWN (d
)
21525 && !DECL_NOT_REALLY_EXTERN (d
))
21526 mark_definable (d
);
21528 DECL_SOURCE_LOCATION (td
) = DECL_SOURCE_LOCATION (code_pattern
);
21529 DECL_SOURCE_LOCATION (d
) = DECL_SOURCE_LOCATION (code_pattern
);
21530 input_location
= DECL_SOURCE_LOCATION (d
);
21532 /* If D is a member of an explicitly instantiated class template,
21533 and no definition is available, treat it like an implicit
21535 if (!pattern_defined
&& expl_inst_class_mem_p
21536 && DECL_EXPLICIT_INSTANTIATION (d
))
21538 /* Leave linkage flags alone on instantiations with anonymous
21540 if (TREE_PUBLIC (d
))
21542 DECL_NOT_REALLY_EXTERN (d
) = 0;
21543 DECL_INTERFACE_KNOWN (d
) = 0;
21545 SET_DECL_IMPLICIT_INSTANTIATION (d
);
21548 /* Defer all other templates, unless we have been explicitly
21549 forbidden from doing so. */
21550 if (/* If there is no definition, we cannot instantiate the
21553 /* If it's OK to postpone instantiation, do so. */
21555 /* If this is a static data member that will be defined
21556 elsewhere, we don't want to instantiate the entire data
21557 member, but we do want to instantiate the initializer so that
21558 we can substitute that elsewhere. */
21559 || (external_p
&& VAR_P (d
))
21560 /* Handle here a deleted function too, avoid generating
21561 its body (c++/61080). */
21564 /* The definition of the static data member is now required so
21565 we must substitute the initializer. */
21567 && !DECL_INITIAL (d
)
21568 && DECL_INITIAL (code_pattern
))
21572 bool const_init
= false;
21573 bool enter_context
= DECL_CLASS_SCOPE_P (d
);
21575 ns
= decl_namespace_context (d
);
21576 push_nested_namespace (ns
);
21578 push_nested_class (DECL_CONTEXT (d
));
21579 init
= tsubst_expr (DECL_INITIAL (code_pattern
),
21581 tf_warning_or_error
, NULL_TREE
,
21582 /*integral_constant_expression_p=*/false);
21583 /* If instantiating the initializer involved instantiating this
21584 again, don't call cp_finish_decl twice. */
21585 if (!DECL_INITIAL (d
))
21587 /* Make sure the initializer is still constant, in case of
21588 circular dependency (template/instantiate6.C). */
21590 = DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (code_pattern
);
21591 cp_finish_decl (d
, init
, /*init_const_expr_p=*/const_init
,
21592 /*asmspec_tree=*/NULL_TREE
,
21593 LOOKUP_ONLYCONVERTING
);
21596 pop_nested_class ();
21597 pop_nested_namespace (ns
);
21600 /* We restore the source position here because it's used by
21601 add_pending_template. */
21602 input_location
= saved_loc
;
21604 if (at_eof
&& !pattern_defined
21605 && DECL_EXPLICIT_INSTANTIATION (d
)
21606 && DECL_NOT_REALLY_EXTERN (d
))
21609 The definition of a non-exported function template, a
21610 non-exported member function template, or a non-exported
21611 member function or static data member of a class template
21612 shall be present in every translation unit in which it is
21613 explicitly instantiated. */
21614 permerror (input_location
, "explicit instantiation of %qD "
21615 "but no definition available", d
);
21617 /* If we're in unevaluated context, we just wanted to get the
21618 constant value; this isn't an odr use, so don't queue
21619 a full instantiation. */
21620 if (cp_unevaluated_operand
!= 0)
21622 /* ??? Historically, we have instantiated inline functions, even
21623 when marked as "extern template". */
21624 if (!(external_p
&& VAR_P (d
)))
21625 add_pending_template (d
);
21628 /* Tell the repository that D is available in this translation unit
21629 -- and see if it is supposed to be instantiated here. */
21630 if (TREE_PUBLIC (d
) && !DECL_REALLY_EXTERN (d
) && !repo_emit_p (d
))
21632 /* In a PCH file, despite the fact that the repository hasn't
21633 requested instantiation in the PCH it is still possible that
21634 an instantiation will be required in a file that includes the
21637 add_pending_template (d
);
21638 /* Instantiate inline functions so that the inliner can do its
21639 job, even though we'll not be emitting a copy of this
21641 if (!(TREE_CODE (d
) == FUNCTION_DECL
&& possibly_inlined_p (d
)))
21645 fn_context
= decl_function_context (d
);
21646 nested
= (current_function_decl
!= NULL_TREE
);
21647 vec
<tree
> omp_privatization_save
;
21649 save_omp_privatization_clauses (omp_privatization_save
);
21652 push_to_top_level ();
21656 push_function_context ();
21657 cp_unevaluated_operand
= 0;
21658 c_inhibit_evaluation_warnings
= 0;
21661 /* Mark D as instantiated so that recursive calls to
21662 instantiate_decl do not try to instantiate it again. */
21663 DECL_TEMPLATE_INSTANTIATED (d
) = 1;
21665 /* Regenerate the declaration in case the template has been modified
21666 by a subsequent redeclaration. */
21667 regenerate_decl_from_template (d
, td
);
21669 /* We already set the file and line above. Reset them now in case
21670 they changed as a result of calling regenerate_decl_from_template. */
21671 input_location
= DECL_SOURCE_LOCATION (d
);
21676 bool const_init
= false;
21678 /* Clear out DECL_RTL; whatever was there before may not be right
21679 since we've reset the type of the declaration. */
21680 SET_DECL_RTL (d
, NULL
);
21681 DECL_IN_AGGR_P (d
) = 0;
21683 /* The initializer is placed in DECL_INITIAL by
21684 regenerate_decl_from_template so we don't need to
21685 push/pop_access_scope again here. Pull it out so that
21686 cp_finish_decl can process it. */
21687 init
= DECL_INITIAL (d
);
21688 DECL_INITIAL (d
) = NULL_TREE
;
21689 DECL_INITIALIZED_P (d
) = 0;
21691 /* Clear DECL_EXTERNAL so that cp_finish_decl will process the
21692 initializer. That function will defer actual emission until
21693 we have a chance to determine linkage. */
21694 DECL_EXTERNAL (d
) = 0;
21696 /* Enter the scope of D so that access-checking works correctly. */
21697 bool enter_context
= DECL_CLASS_SCOPE_P (d
);
21699 push_nested_class (DECL_CONTEXT (d
));
21701 const_init
= DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (code_pattern
);
21702 cp_finish_decl (d
, init
, const_init
, NULL_TREE
, 0);
21705 pop_nested_class ();
21707 if (variable_template_p (td
))
21708 note_variable_template_instantiation (d
);
21710 else if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_DEFAULTED_FN (code_pattern
))
21711 synthesize_method (d
);
21712 else if (TREE_CODE (d
) == FUNCTION_DECL
)
21714 hash_map
<tree
, tree
> *saved_local_specializations
;
21718 tree block
= NULL_TREE
;
21720 /* Save away the current list, in case we are instantiating one
21721 template from within the body of another. */
21722 saved_local_specializations
= local_specializations
;
21724 /* Set up the list of local specializations. */
21725 local_specializations
= new hash_map
<tree
, tree
>;
21727 /* Set up context. */
21728 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
)
21729 && TREE_CODE (DECL_CONTEXT (code_pattern
)) == FUNCTION_DECL
)
21730 block
= push_stmt_list ();
21732 start_preparsed_function (d
, NULL_TREE
, SF_PRE_PARSED
);
21734 /* Some typedefs referenced from within the template code need to be
21735 access checked at template instantiation time, i.e now. These
21736 types were added to the template at parsing time. Let's get those
21737 and perform the access checks then. */
21738 perform_typedefs_access_check (DECL_TEMPLATE_RESULT (gen_tmpl
),
21741 /* Create substitution entries for the parameters. */
21742 subst_decl
= DECL_TEMPLATE_RESULT (template_for_substitution (d
));
21743 tmpl_parm
= DECL_ARGUMENTS (subst_decl
);
21744 spec_parm
= DECL_ARGUMENTS (d
);
21745 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (d
))
21747 register_local_specialization (spec_parm
, tmpl_parm
);
21748 spec_parm
= skip_artificial_parms_for (d
, spec_parm
);
21749 tmpl_parm
= skip_artificial_parms_for (subst_decl
, tmpl_parm
);
21751 for (; tmpl_parm
; tmpl_parm
= DECL_CHAIN (tmpl_parm
))
21753 if (!DECL_PACK_P (tmpl_parm
))
21755 register_local_specialization (spec_parm
, tmpl_parm
);
21756 spec_parm
= DECL_CHAIN (spec_parm
);
21760 /* Register the (value) argument pack as a specialization of
21761 TMPL_PARM, then move on. */
21762 tree argpack
= extract_fnparm_pack (tmpl_parm
, &spec_parm
);
21763 register_local_specialization (argpack
, tmpl_parm
);
21766 gcc_assert (!spec_parm
);
21768 /* Substitute into the body of the function. */
21769 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
))
21770 tsubst_omp_udr (DECL_SAVED_TREE (code_pattern
), args
,
21771 tf_warning_or_error
, tmpl
);
21774 tsubst_expr (DECL_SAVED_TREE (code_pattern
), args
,
21775 tf_warning_or_error
, tmpl
,
21776 /*integral_constant_expression_p=*/false);
21778 /* Set the current input_location to the end of the function
21779 so that finish_function knows where we are. */
21781 = DECL_STRUCT_FUNCTION (code_pattern
)->function_end_locus
;
21783 /* Remember if we saw an infinite loop in the template. */
21784 current_function_infinite_loop
21785 = DECL_STRUCT_FUNCTION (code_pattern
)->language
->infinite_loop
;
21788 /* We don't need the local specializations any more. */
21789 delete local_specializations
;
21790 local_specializations
= saved_local_specializations
;
21792 /* Finish the function. */
21793 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
)
21794 && TREE_CODE (DECL_CONTEXT (code_pattern
)) == FUNCTION_DECL
)
21795 DECL_SAVED_TREE (d
) = pop_stmt_list (block
);
21798 d
= finish_function (0);
21799 expand_or_defer_fn (d
);
21802 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
))
21803 cp_check_omp_declare_reduction (d
);
21806 /* We're not deferring instantiation any more. */
21807 TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (d
)) = 0;
21810 pop_from_top_level ();
21812 pop_function_context ();
21815 input_location
= saved_loc
;
21816 cp_unevaluated_operand
= saved_unevaluated_operand
;
21817 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
21818 pop_deferring_access_checks ();
21819 pop_tinst_level ();
21821 restore_omp_privatization_clauses (omp_privatization_save
);
21823 timevar_pop (TV_TEMPLATE_INST
);
21828 /* Run through the list of templates that we wish we could
21829 instantiate, and instantiate any we can. RETRIES is the
21830 number of times we retry pending template instantiation. */
21833 instantiate_pending_templates (int retries
)
21836 location_t saved_loc
= input_location
;
21838 /* Instantiating templates may trigger vtable generation. This in turn
21839 may require further template instantiations. We place a limit here
21840 to avoid infinite loop. */
21841 if (pending_templates
&& retries
>= max_tinst_depth
)
21843 tree decl
= pending_templates
->tinst
->decl
;
21845 fatal_error (input_location
,
21846 "template instantiation depth exceeds maximum of %d"
21847 " instantiating %q+D, possibly from virtual table generation"
21848 " (use -ftemplate-depth= to increase the maximum)",
21849 max_tinst_depth
, decl
);
21850 if (TREE_CODE (decl
) == FUNCTION_DECL
)
21851 /* Pretend that we defined it. */
21852 DECL_INITIAL (decl
) = error_mark_node
;
21858 struct pending_template
**t
= &pending_templates
;
21859 struct pending_template
*last
= NULL
;
21863 tree instantiation
= reopen_tinst_level ((*t
)->tinst
);
21864 bool complete
= false;
21866 if (TYPE_P (instantiation
))
21870 if (!COMPLETE_TYPE_P (instantiation
))
21872 instantiate_class_template (instantiation
);
21873 if (CLASSTYPE_TEMPLATE_INSTANTIATION (instantiation
))
21874 for (fn
= TYPE_METHODS (instantiation
);
21876 fn
= TREE_CHAIN (fn
))
21877 if (! DECL_ARTIFICIAL (fn
))
21878 instantiate_decl (fn
,
21880 /*expl_inst_class_mem_p=*/false);
21881 if (COMPLETE_TYPE_P (instantiation
))
21885 complete
= COMPLETE_TYPE_P (instantiation
);
21889 if (!DECL_TEMPLATE_SPECIALIZATION (instantiation
)
21890 && !DECL_TEMPLATE_INSTANTIATED (instantiation
))
21893 = instantiate_decl (instantiation
,
21895 /*expl_inst_class_mem_p=*/false);
21896 if (DECL_TEMPLATE_INSTANTIATED (instantiation
))
21900 complete
= (DECL_TEMPLATE_SPECIALIZATION (instantiation
)
21901 || DECL_TEMPLATE_INSTANTIATED (instantiation
));
21905 /* If INSTANTIATION has been instantiated, then we don't
21906 need to consider it again in the future. */
21914 current_tinst_level
= NULL
;
21916 last_pending_template
= last
;
21918 while (reconsider
);
21920 input_location
= saved_loc
;
21923 /* Substitute ARGVEC into T, which is a list of initializers for
21924 either base class or a non-static data member. The TREE_PURPOSEs
21925 are DECLs, and the TREE_VALUEs are the initializer values. Used by
21926 instantiate_decl. */
21929 tsubst_initializer_list (tree t
, tree argvec
)
21931 tree inits
= NULL_TREE
;
21933 for (; t
; t
= TREE_CHAIN (t
))
21937 tree expanded_bases
= NULL_TREE
;
21938 tree expanded_arguments
= NULL_TREE
;
21941 if (TREE_CODE (TREE_PURPOSE (t
)) == TYPE_PACK_EXPANSION
)
21946 /* Expand the base class expansion type into separate base
21948 expanded_bases
= tsubst_pack_expansion (TREE_PURPOSE (t
), argvec
,
21949 tf_warning_or_error
,
21951 if (expanded_bases
== error_mark_node
)
21954 /* We'll be building separate TREE_LISTs of arguments for
21956 len
= TREE_VEC_LENGTH (expanded_bases
);
21957 expanded_arguments
= make_tree_vec (len
);
21958 for (i
= 0; i
< len
; i
++)
21959 TREE_VEC_ELT (expanded_arguments
, i
) = NULL_TREE
;
21961 /* Build a dummy EXPR_PACK_EXPANSION that will be used to
21962 expand each argument in the TREE_VALUE of t. */
21963 expr
= make_node (EXPR_PACK_EXPANSION
);
21964 PACK_EXPANSION_LOCAL_P (expr
) = true;
21965 PACK_EXPANSION_PARAMETER_PACKS (expr
) =
21966 PACK_EXPANSION_PARAMETER_PACKS (TREE_PURPOSE (t
));
21968 if (TREE_VALUE (t
) == void_type_node
)
21969 /* VOID_TYPE_NODE is used to indicate
21970 value-initialization. */
21972 for (i
= 0; i
< len
; i
++)
21973 TREE_VEC_ELT (expanded_arguments
, i
) = void_type_node
;
21977 /* Substitute parameter packs into each argument in the
21979 in_base_initializer
= 1;
21980 for (arg
= TREE_VALUE (t
); arg
; arg
= TREE_CHAIN (arg
))
21982 tree expanded_exprs
;
21984 /* Expand the argument. */
21985 SET_PACK_EXPANSION_PATTERN (expr
, TREE_VALUE (arg
));
21987 = tsubst_pack_expansion (expr
, argvec
,
21988 tf_warning_or_error
,
21990 if (expanded_exprs
== error_mark_node
)
21993 /* Prepend each of the expanded expressions to the
21994 corresponding TREE_LIST in EXPANDED_ARGUMENTS. */
21995 for (i
= 0; i
< len
; i
++)
21997 TREE_VEC_ELT (expanded_arguments
, i
) =
21998 tree_cons (NULL_TREE
,
21999 TREE_VEC_ELT (expanded_exprs
, i
),
22000 TREE_VEC_ELT (expanded_arguments
, i
));
22003 in_base_initializer
= 0;
22005 /* Reverse all of the TREE_LISTs in EXPANDED_ARGUMENTS,
22006 since we built them backwards. */
22007 for (i
= 0; i
< len
; i
++)
22009 TREE_VEC_ELT (expanded_arguments
, i
) =
22010 nreverse (TREE_VEC_ELT (expanded_arguments
, i
));
22015 for (i
= 0; i
< len
; ++i
)
22017 if (expanded_bases
)
22019 decl
= TREE_VEC_ELT (expanded_bases
, i
);
22020 decl
= expand_member_init (decl
);
22021 init
= TREE_VEC_ELT (expanded_arguments
, i
);
22026 decl
= tsubst_copy (TREE_PURPOSE (t
), argvec
,
22027 tf_warning_or_error
, NULL_TREE
);
22029 decl
= expand_member_init (decl
);
22030 if (decl
&& !DECL_P (decl
))
22031 in_base_initializer
= 1;
22033 init
= TREE_VALUE (t
);
22035 if (init
!= void_type_node
)
22036 init
= tsubst_expr (init
, argvec
,
22037 tf_warning_or_error
, NULL_TREE
,
22038 /*integral_constant_expression_p=*/false);
22039 if (init
== NULL_TREE
&& tmp
!= NULL_TREE
)
22040 /* If we had an initializer but it instantiated to nothing,
22041 value-initialize the object. This will only occur when
22042 the initializer was a pack expansion where the parameter
22043 packs used in that expansion were of length zero. */
22044 init
= void_type_node
;
22045 in_base_initializer
= 0;
22050 init
= build_tree_list (decl
, init
);
22051 TREE_CHAIN (init
) = inits
;
22059 /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */
22062 set_current_access_from_decl (tree decl
)
22064 if (TREE_PRIVATE (decl
))
22065 current_access_specifier
= access_private_node
;
22066 else if (TREE_PROTECTED (decl
))
22067 current_access_specifier
= access_protected_node
;
22069 current_access_specifier
= access_public_node
;
22072 /* Instantiate an enumerated type. TAG is the template type, NEWTAG
22073 is the instantiation (which should have been created with
22074 start_enum) and ARGS are the template arguments to use. */
22077 tsubst_enum (tree tag
, tree newtag
, tree args
)
22081 if (SCOPED_ENUM_P (newtag
))
22082 begin_scope (sk_scoped_enum
, newtag
);
22084 for (e
= TYPE_VALUES (tag
); e
; e
= TREE_CHAIN (e
))
22089 decl
= TREE_VALUE (e
);
22090 /* Note that in a template enum, the TREE_VALUE is the
22091 CONST_DECL, not the corresponding INTEGER_CST. */
22092 value
= tsubst_expr (DECL_INITIAL (decl
),
22093 args
, tf_warning_or_error
, NULL_TREE
,
22094 /*integral_constant_expression_p=*/true);
22096 /* Give this enumeration constant the correct access. */
22097 set_current_access_from_decl (decl
);
22099 /* Actually build the enumerator itself. Here we're assuming that
22100 enumerators can't have dependent attributes. */
22101 build_enumerator (DECL_NAME (decl
), value
, newtag
,
22102 DECL_ATTRIBUTES (decl
), DECL_SOURCE_LOCATION (decl
));
22105 if (SCOPED_ENUM_P (newtag
))
22108 finish_enum_value_list (newtag
);
22109 finish_enum (newtag
);
22111 DECL_SOURCE_LOCATION (TYPE_NAME (newtag
))
22112 = DECL_SOURCE_LOCATION (TYPE_NAME (tag
));
22115 /* DECL is a FUNCTION_DECL that is a template specialization. Return
22116 its type -- but without substituting the innermost set of template
22117 arguments. So, innermost set of template parameters will appear in
22121 get_mostly_instantiated_function_type (tree decl
)
22123 /* For a function, DECL_TI_TEMPLATE is partially instantiated. */
22124 return TREE_TYPE (DECL_TI_TEMPLATE (decl
));
22127 /* Return truthvalue if we're processing a template different from
22128 the last one involved in diagnostics. */
22130 problematic_instantiation_changed (void)
22132 return current_tinst_level
!= last_error_tinst_level
;
22135 /* Remember current template involved in diagnostics. */
22137 record_last_problematic_instantiation (void)
22139 last_error_tinst_level
= current_tinst_level
;
22142 struct tinst_level
*
22143 current_instantiation (void)
22145 return current_tinst_level
;
22148 /* Return TRUE if current_function_decl is being instantiated, false
22152 instantiating_current_function_p (void)
22154 return (current_instantiation ()
22155 && current_instantiation ()->decl
== current_function_decl
);
22158 /* [temp.param] Check that template non-type parm TYPE is of an allowable
22159 type. Return zero for ok, nonzero for disallowed. Issue error and
22160 warning messages under control of COMPLAIN. */
22163 invalid_nontype_parm_type_p (tree type
, tsubst_flags_t complain
)
22165 if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
22167 else if (POINTER_TYPE_P (type
))
22169 else if (TYPE_PTRMEM_P (type
))
22171 else if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
)
22173 else if (TREE_CODE (type
) == TYPENAME_TYPE
)
22175 else if (TREE_CODE (type
) == DECLTYPE_TYPE
)
22177 else if (TREE_CODE (type
) == NULLPTR_TYPE
)
22179 /* A bound template template parm could later be instantiated to have a valid
22180 nontype parm type via an alias template. */
22181 else if (cxx_dialect
>= cxx11
22182 && TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
22185 if (complain
& tf_error
)
22187 if (type
== error_mark_node
)
22188 inform (input_location
, "invalid template non-type parameter");
22190 error ("%q#T is not a valid type for a template non-type parameter",
22196 /* Returns TRUE if TYPE is dependent, in the sense of [temp.dep.type].
22197 Assumes that TYPE really is a type, and not the ERROR_MARK_NODE.*/
22200 dependent_type_p_r (tree type
)
22206 A type is dependent if it is:
22208 -- a template parameter. Template template parameters are types
22209 for us (since TYPE_P holds true for them) so we handle
22211 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
22212 || TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
)
22214 /* -- a qualified-id with a nested-name-specifier which contains a
22215 class-name that names a dependent type or whose unqualified-id
22216 names a dependent type. */
22217 if (TREE_CODE (type
) == TYPENAME_TYPE
)
22220 /* An alias template specialization can be dependent even if the
22221 resulting type is not. */
22222 if (dependent_alias_template_spec_p (type
))
22225 /* -- a cv-qualified type where the cv-unqualified type is
22227 No code is necessary for this bullet; the code below handles
22228 cv-qualified types, and we don't want to strip aliases with
22229 TYPE_MAIN_VARIANT because of DR 1558. */
22230 /* -- a compound type constructed from any dependent type. */
22231 if (TYPE_PTRMEM_P (type
))
22232 return (dependent_type_p (TYPE_PTRMEM_CLASS_TYPE (type
))
22233 || dependent_type_p (TYPE_PTRMEM_POINTED_TO_TYPE
22235 else if (TYPE_PTR_P (type
)
22236 || TREE_CODE (type
) == REFERENCE_TYPE
)
22237 return dependent_type_p (TREE_TYPE (type
));
22238 else if (TREE_CODE (type
) == FUNCTION_TYPE
22239 || TREE_CODE (type
) == METHOD_TYPE
)
22243 if (dependent_type_p (TREE_TYPE (type
)))
22245 for (arg_type
= TYPE_ARG_TYPES (type
);
22247 arg_type
= TREE_CHAIN (arg_type
))
22248 if (dependent_type_p (TREE_VALUE (arg_type
)))
22252 /* -- an array type constructed from any dependent type or whose
22253 size is specified by a constant expression that is
22256 We checked for type- and value-dependence of the bounds in
22257 compute_array_index_type, so TYPE_DEPENDENT_P is already set. */
22258 if (TREE_CODE (type
) == ARRAY_TYPE
)
22260 if (TYPE_DOMAIN (type
)
22261 && dependent_type_p (TYPE_DOMAIN (type
)))
22263 return dependent_type_p (TREE_TYPE (type
));
22266 /* -- a template-id in which either the template name is a template
22268 if (TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
22270 /* ... or any of the template arguments is a dependent type or
22271 an expression that is type-dependent or value-dependent. */
22272 else if (CLASS_TYPE_P (type
) && CLASSTYPE_TEMPLATE_INFO (type
)
22273 && (any_dependent_template_arguments_p
22274 (INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type
)))))
22277 /* All TYPEOF_TYPEs, DECLTYPE_TYPEs, and UNDERLYING_TYPEs are
22278 dependent; if the argument of the `typeof' expression is not
22279 type-dependent, then it should already been have resolved. */
22280 if (TREE_CODE (type
) == TYPEOF_TYPE
22281 || TREE_CODE (type
) == DECLTYPE_TYPE
22282 || TREE_CODE (type
) == UNDERLYING_TYPE
)
22285 /* A template argument pack is dependent if any of its packed
22287 if (TREE_CODE (type
) == TYPE_ARGUMENT_PACK
)
22289 tree args
= ARGUMENT_PACK_ARGS (type
);
22290 int i
, len
= TREE_VEC_LENGTH (args
);
22291 for (i
= 0; i
< len
; ++i
)
22292 if (dependent_template_arg_p (TREE_VEC_ELT (args
, i
)))
22296 /* All TYPE_PACK_EXPANSIONs are dependent, because parameter packs must
22297 be template parameters. */
22298 if (TREE_CODE (type
) == TYPE_PACK_EXPANSION
)
22301 /* The standard does not specifically mention types that are local
22302 to template functions or local classes, but they should be
22303 considered dependent too. For example:
22305 template <int I> void f() {
22310 The size of `E' cannot be known until the value of `I' has been
22311 determined. Therefore, `E' must be considered dependent. */
22312 scope
= TYPE_CONTEXT (type
);
22313 if (scope
&& TYPE_P (scope
))
22314 return dependent_type_p (scope
);
22315 /* Don't use type_dependent_expression_p here, as it can lead
22316 to infinite recursion trying to determine whether a lambda
22317 nested in a lambda is dependent (c++/47687). */
22318 else if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
22319 && DECL_LANG_SPECIFIC (scope
)
22320 && DECL_TEMPLATE_INFO (scope
)
22321 && (any_dependent_template_arguments_p
22322 (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (scope
)))))
22325 /* Other types are non-dependent. */
22329 /* Returns TRUE if TYPE is dependent, in the sense of
22330 [temp.dep.type]. Note that a NULL type is considered dependent. */
22333 dependent_type_p (tree type
)
22335 /* If there are no template parameters in scope, then there can't be
22336 any dependent types. */
22337 if (!processing_template_decl
)
22339 /* If we are not processing a template, then nobody should be
22340 providing us with a dependent type. */
22342 gcc_assert (TREE_CODE (type
) != TEMPLATE_TYPE_PARM
|| is_auto (type
));
22346 /* If the type is NULL, we have not computed a type for the entity
22347 in question; in that case, the type is dependent. */
22351 /* Erroneous types can be considered non-dependent. */
22352 if (type
== error_mark_node
)
22355 /* If we have not already computed the appropriate value for TYPE,
22357 if (!TYPE_DEPENDENT_P_VALID (type
))
22359 TYPE_DEPENDENT_P (type
) = dependent_type_p_r (type
);
22360 TYPE_DEPENDENT_P_VALID (type
) = 1;
22363 return TYPE_DEPENDENT_P (type
);
22366 /* Returns TRUE if SCOPE is a dependent scope, in which we can't do any
22367 lookup. In other words, a dependent type that is not the current
22371 dependent_scope_p (tree scope
)
22373 return (scope
&& TYPE_P (scope
) && dependent_type_p (scope
)
22374 && !currently_open_class (scope
));
22377 /* T is a SCOPE_REF; return whether we need to consider it
22378 instantiation-dependent so that we can check access at instantiation
22379 time even though we know which member it resolves to. */
22382 instantiation_dependent_scope_ref_p (tree t
)
22384 if (DECL_P (TREE_OPERAND (t
, 1))
22385 && CLASS_TYPE_P (TREE_OPERAND (t
, 0))
22386 && accessible_in_template_p (TREE_OPERAND (t
, 0),
22387 TREE_OPERAND (t
, 1)))
22393 /* Returns TRUE if the EXPRESSION is value-dependent, in the sense of
22394 [temp.dep.constexpr]. EXPRESSION is already known to be a constant
22397 /* Note that this predicate is not appropriate for general expressions;
22398 only constant expressions (that satisfy potential_constant_expression)
22399 can be tested for value dependence. */
22402 value_dependent_expression_p (tree expression
)
22404 if (!processing_template_decl
)
22407 /* A name declared with a dependent type. */
22408 if (DECL_P (expression
) && type_dependent_expression_p (expression
))
22411 switch (TREE_CODE (expression
))
22413 case IDENTIFIER_NODE
:
22414 /* A name that has not been looked up -- must be dependent. */
22417 case TEMPLATE_PARM_INDEX
:
22418 /* A non-type template parm. */
22422 /* A non-type template parm. */
22423 if (DECL_TEMPLATE_PARM_P (expression
))
22425 return value_dependent_expression_p (DECL_INITIAL (expression
));
22428 /* A constant with literal type and is initialized
22429 with an expression that is value-dependent.
22431 Note that a non-dependent parenthesized initializer will have
22432 already been replaced with its constant value, so if we see
22433 a TREE_LIST it must be dependent. */
22434 if (DECL_INITIAL (expression
)
22435 && decl_constant_var_p (expression
)
22436 && (TREE_CODE (DECL_INITIAL (expression
)) == TREE_LIST
22437 /* cp_finish_decl doesn't fold reference initializers. */
22438 || TREE_CODE (TREE_TYPE (expression
)) == REFERENCE_TYPE
22439 || value_dependent_expression_p (DECL_INITIAL (expression
))))
22443 case DYNAMIC_CAST_EXPR
:
22444 case STATIC_CAST_EXPR
:
22445 case CONST_CAST_EXPR
:
22446 case REINTERPRET_CAST_EXPR
:
22448 /* These expressions are value-dependent if the type to which
22449 the cast occurs is dependent or the expression being casted
22450 is value-dependent. */
22452 tree type
= TREE_TYPE (expression
);
22454 if (dependent_type_p (type
))
22457 /* A functional cast has a list of operands. */
22458 expression
= TREE_OPERAND (expression
, 0);
22461 /* If there are no operands, it must be an expression such
22462 as "int()". This should not happen for aggregate types
22463 because it would form non-constant expressions. */
22464 gcc_assert (cxx_dialect
>= cxx11
22465 || INTEGRAL_OR_ENUMERATION_TYPE_P (type
));
22470 if (TREE_CODE (expression
) == TREE_LIST
)
22471 return any_value_dependent_elements_p (expression
);
22473 return value_dependent_expression_p (expression
);
22477 if (SIZEOF_EXPR_TYPE_P (expression
))
22478 return dependent_type_p (TREE_TYPE (TREE_OPERAND (expression
, 0)));
22482 /* A `sizeof' expression is value-dependent if the operand is
22483 type-dependent or is a pack expansion. */
22484 expression
= TREE_OPERAND (expression
, 0);
22485 if (PACK_EXPANSION_P (expression
))
22487 else if (TYPE_P (expression
))
22488 return dependent_type_p (expression
);
22489 return instantiation_dependent_expression_p (expression
);
22491 case AT_ENCODE_EXPR
:
22492 /* An 'encode' expression is value-dependent if the operand is
22494 expression
= TREE_OPERAND (expression
, 0);
22495 return dependent_type_p (expression
);
22497 case NOEXCEPT_EXPR
:
22498 expression
= TREE_OPERAND (expression
, 0);
22499 return instantiation_dependent_expression_p (expression
);
22502 /* All instantiation-dependent expressions should also be considered
22503 value-dependent. */
22504 return instantiation_dependent_scope_ref_p (expression
);
22506 case COMPONENT_REF
:
22507 return (value_dependent_expression_p (TREE_OPERAND (expression
, 0))
22508 || value_dependent_expression_p (TREE_OPERAND (expression
, 1)));
22510 case NONTYPE_ARGUMENT_PACK
:
22511 /* A NONTYPE_ARGUMENT_PACK is value-dependent if any packed argument
22512 is value-dependent. */
22514 tree values
= ARGUMENT_PACK_ARGS (expression
);
22515 int i
, len
= TREE_VEC_LENGTH (values
);
22517 for (i
= 0; i
< len
; ++i
)
22518 if (value_dependent_expression_p (TREE_VEC_ELT (values
, i
)))
22526 tree type2
= TRAIT_EXPR_TYPE2 (expression
);
22527 return (dependent_type_p (TRAIT_EXPR_TYPE1 (expression
))
22528 || (type2
? dependent_type_p (type2
) : false));
22532 return ((value_dependent_expression_p (TREE_OPERAND (expression
, 0)))
22533 || (value_dependent_expression_p (TREE_OPERAND (expression
, 2))));
22536 return ((value_dependent_expression_p (TREE_OPERAND (expression
, 0)))
22537 || (value_dependent_expression_p (TREE_OPERAND (expression
, 1))));
22541 tree op
= TREE_OPERAND (expression
, 0);
22542 return (value_dependent_expression_p (op
)
22543 || has_value_dependent_address (op
));
22546 case REQUIRES_EXPR
:
22547 /* Treat all requires-expressions as value-dependent so
22548 we don't try to fold them. */
22552 return dependent_type_p (TREE_OPERAND (expression
, 0));
22556 tree fn
= get_callee_fndecl (expression
);
22558 if (!fn
&& value_dependent_expression_p (CALL_EXPR_FN (expression
)))
22560 nargs
= call_expr_nargs (expression
);
22561 for (i
= 0; i
< nargs
; ++i
)
22563 tree op
= CALL_EXPR_ARG (expression
, i
);
22564 /* In a call to a constexpr member function, look through the
22565 implicit ADDR_EXPR on the object argument so that it doesn't
22566 cause the call to be considered value-dependent. We also
22567 look through it in potential_constant_expression. */
22568 if (i
== 0 && fn
&& DECL_DECLARED_CONSTEXPR_P (fn
)
22569 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
22570 && TREE_CODE (op
) == ADDR_EXPR
)
22571 op
= TREE_OPERAND (op
, 0);
22572 if (value_dependent_expression_p (op
))
22578 case TEMPLATE_ID_EXPR
:
22579 /* If a TEMPLATE_ID_EXPR involves a dependent name, it will be
22581 return type_dependent_expression_p (expression
)
22582 || variable_concept_p (TREE_OPERAND (expression
, 0));
22588 if (dependent_type_p (TREE_TYPE (expression
)))
22590 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expression
), ix
, val
)
22591 if (value_dependent_expression_p (val
))
22597 /* Treat a GNU statement expression as dependent to avoid crashing
22598 under instantiate_non_dependent_expr; it can't be constant. */
22602 /* A constant expression is value-dependent if any subexpression is
22603 value-dependent. */
22604 switch (TREE_CODE_CLASS (TREE_CODE (expression
)))
22606 case tcc_reference
:
22608 case tcc_comparison
:
22610 case tcc_expression
:
22613 int i
, len
= cp_tree_operand_length (expression
);
22615 for (i
= 0; i
< len
; i
++)
22617 tree t
= TREE_OPERAND (expression
, i
);
22619 /* In some cases, some of the operands may be missing.l
22620 (For example, in the case of PREDECREMENT_EXPR, the
22621 amount to increment by may be missing.) That doesn't
22622 make the expression dependent. */
22623 if (t
&& value_dependent_expression_p (t
))
22634 /* The expression is not value-dependent. */
22638 /* Returns TRUE if the EXPRESSION is type-dependent, in the sense of
22639 [temp.dep.expr]. Note that an expression with no type is
22640 considered dependent. Other parts of the compiler arrange for an
22641 expression with type-dependent subexpressions to have no type, so
22642 this function doesn't have to be fully recursive. */
22645 type_dependent_expression_p (tree expression
)
22647 if (!processing_template_decl
)
22650 if (expression
== NULL_TREE
|| expression
== error_mark_node
)
22653 /* An unresolved name is always dependent. */
22654 if (identifier_p (expression
)
22655 || TREE_CODE (expression
) == USING_DECL
22656 || TREE_CODE (expression
) == WILDCARD_DECL
)
22659 /* A fold expression is type-dependent. */
22660 if (TREE_CODE (expression
) == UNARY_LEFT_FOLD_EXPR
22661 || TREE_CODE (expression
) == UNARY_RIGHT_FOLD_EXPR
22662 || TREE_CODE (expression
) == BINARY_LEFT_FOLD_EXPR
22663 || TREE_CODE (expression
) == BINARY_RIGHT_FOLD_EXPR
)
22666 /* Some expression forms are never type-dependent. */
22667 if (TREE_CODE (expression
) == PSEUDO_DTOR_EXPR
22668 || TREE_CODE (expression
) == SIZEOF_EXPR
22669 || TREE_CODE (expression
) == ALIGNOF_EXPR
22670 || TREE_CODE (expression
) == AT_ENCODE_EXPR
22671 || TREE_CODE (expression
) == NOEXCEPT_EXPR
22672 || TREE_CODE (expression
) == TRAIT_EXPR
22673 || TREE_CODE (expression
) == TYPEID_EXPR
22674 || TREE_CODE (expression
) == DELETE_EXPR
22675 || TREE_CODE (expression
) == VEC_DELETE_EXPR
22676 || TREE_CODE (expression
) == THROW_EXPR
22677 || TREE_CODE (expression
) == REQUIRES_EXPR
)
22680 /* The types of these expressions depends only on the type to which
22681 the cast occurs. */
22682 if (TREE_CODE (expression
) == DYNAMIC_CAST_EXPR
22683 || TREE_CODE (expression
) == STATIC_CAST_EXPR
22684 || TREE_CODE (expression
) == CONST_CAST_EXPR
22685 || TREE_CODE (expression
) == REINTERPRET_CAST_EXPR
22686 || TREE_CODE (expression
) == IMPLICIT_CONV_EXPR
22687 || TREE_CODE (expression
) == CAST_EXPR
)
22688 return dependent_type_p (TREE_TYPE (expression
));
22690 /* The types of these expressions depends only on the type created
22691 by the expression. */
22692 if (TREE_CODE (expression
) == NEW_EXPR
22693 || TREE_CODE (expression
) == VEC_NEW_EXPR
)
22695 /* For NEW_EXPR tree nodes created inside a template, either
22696 the object type itself or a TREE_LIST may appear as the
22698 tree type
= TREE_OPERAND (expression
, 1);
22699 if (TREE_CODE (type
) == TREE_LIST
)
22700 /* This is an array type. We need to check array dimensions
22702 return dependent_type_p (TREE_VALUE (TREE_PURPOSE (type
)))
22703 || value_dependent_expression_p
22704 (TREE_OPERAND (TREE_VALUE (type
), 1));
22706 return dependent_type_p (type
);
22709 if (TREE_CODE (expression
) == SCOPE_REF
)
22711 tree scope
= TREE_OPERAND (expression
, 0);
22712 tree name
= TREE_OPERAND (expression
, 1);
22714 /* 14.6.2.2 [temp.dep.expr]: An id-expression is type-dependent if it
22715 contains an identifier associated by name lookup with one or more
22716 declarations declared with a dependent type, or...a
22717 nested-name-specifier or qualified-id that names a member of an
22718 unknown specialization. */
22719 return (type_dependent_expression_p (name
)
22720 || dependent_scope_p (scope
));
22723 if (TREE_CODE (expression
) == FUNCTION_DECL
22724 && DECL_LANG_SPECIFIC (expression
)
22725 && DECL_TEMPLATE_INFO (expression
)
22726 && (any_dependent_template_arguments_p
22727 (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (expression
)))))
22730 if (TREE_CODE (expression
) == TEMPLATE_DECL
22731 && !DECL_TEMPLATE_TEMPLATE_PARM_P (expression
))
22734 if (TREE_CODE (expression
) == STMT_EXPR
)
22735 expression
= stmt_expr_value_expr (expression
);
22737 if (BRACE_ENCLOSED_INITIALIZER_P (expression
))
22742 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expression
), i
, elt
)
22744 if (type_dependent_expression_p (elt
))
22750 /* A static data member of the current instantiation with incomplete
22751 array type is type-dependent, as the definition and specializations
22752 can have different bounds. */
22753 if (VAR_P (expression
)
22754 && DECL_CLASS_SCOPE_P (expression
)
22755 && dependent_type_p (DECL_CONTEXT (expression
))
22756 && VAR_HAD_UNKNOWN_BOUND (expression
))
22759 /* An array of unknown bound depending on a variadic parameter, eg:
22761 template<typename... Args>
22762 void foo (Args... args)
22764 int arr[] = { args... };
22767 template<int... vals>
22770 int arr[] = { vals... };
22773 If the array has no length and has an initializer, it must be that
22774 we couldn't determine its length in cp_complete_array_type because
22775 it is dependent. */
22776 if (VAR_P (expression
)
22777 && TREE_CODE (TREE_TYPE (expression
)) == ARRAY_TYPE
22778 && !TYPE_DOMAIN (TREE_TYPE (expression
))
22779 && DECL_INITIAL (expression
))
22782 /* A variable template specialization is type-dependent if it has any
22783 dependent template arguments. */
22784 if (VAR_P (expression
)
22785 && DECL_LANG_SPECIFIC (expression
)
22786 && DECL_TEMPLATE_INFO (expression
)
22787 && variable_template_p (DECL_TI_TEMPLATE (expression
)))
22788 return any_dependent_template_arguments_p (DECL_TI_ARGS (expression
));
22790 /* Always dependent, on the number of arguments if nothing else. */
22791 if (TREE_CODE (expression
) == EXPR_PACK_EXPANSION
)
22794 if (TREE_TYPE (expression
) == unknown_type_node
)
22796 if (TREE_CODE (expression
) == ADDR_EXPR
)
22797 return type_dependent_expression_p (TREE_OPERAND (expression
, 0));
22798 if (TREE_CODE (expression
) == COMPONENT_REF
22799 || TREE_CODE (expression
) == OFFSET_REF
)
22801 if (type_dependent_expression_p (TREE_OPERAND (expression
, 0)))
22803 expression
= TREE_OPERAND (expression
, 1);
22804 if (identifier_p (expression
))
22807 /* SCOPE_REF with non-null TREE_TYPE is always non-dependent. */
22808 if (TREE_CODE (expression
) == SCOPE_REF
)
22811 if (BASELINK_P (expression
))
22813 if (BASELINK_OPTYPE (expression
)
22814 && dependent_type_p (BASELINK_OPTYPE (expression
)))
22816 expression
= BASELINK_FUNCTIONS (expression
);
22819 if (TREE_CODE (expression
) == TEMPLATE_ID_EXPR
)
22821 if (any_dependent_template_arguments_p
22822 (TREE_OPERAND (expression
, 1)))
22824 expression
= TREE_OPERAND (expression
, 0);
22825 if (identifier_p (expression
))
22829 gcc_assert (TREE_CODE (expression
) == OVERLOAD
22830 || TREE_CODE (expression
) == FUNCTION_DECL
);
22834 if (type_dependent_expression_p (OVL_CURRENT (expression
)))
22836 expression
= OVL_NEXT (expression
);
22841 gcc_assert (TREE_CODE (expression
) != TYPE_DECL
);
22843 return (dependent_type_p (TREE_TYPE (expression
)));
22846 /* walk_tree callback function for instantiation_dependent_expression_p,
22847 below. Returns non-zero if a dependent subexpression is found. */
22850 instantiation_dependent_r (tree
*tp
, int *walk_subtrees
,
22855 /* We don't have to worry about decltype currently because decltype
22856 of an instantiation-dependent expr is a dependent type. This
22857 might change depending on the resolution of DR 1172. */
22858 *walk_subtrees
= false;
22861 enum tree_code code
= TREE_CODE (*tp
);
22864 /* Don't treat an argument list as dependent just because it has no
22872 /* A constant with a dependent initializer is dependent. */
22873 if (value_dependent_expression_p (*tp
))
22877 case TEMPLATE_PARM_INDEX
:
22880 /* Handle expressions with type operands. */
22884 case AT_ENCODE_EXPR
:
22886 tree op
= TREE_OPERAND (*tp
, 0);
22887 if (code
== SIZEOF_EXPR
&& SIZEOF_EXPR_TYPE_P (*tp
))
22888 op
= TREE_TYPE (op
);
22891 if (dependent_type_p (op
))
22895 *walk_subtrees
= false;
22903 if (value_dependent_expression_p (*tp
))
22905 *walk_subtrees
= false;
22908 case COMPONENT_REF
:
22909 if (identifier_p (TREE_OPERAND (*tp
, 1)))
22910 /* In a template, finish_class_member_access_expr creates a
22911 COMPONENT_REF with an IDENTIFIER_NODE for op1 even if it isn't
22912 type-dependent, so that we can check access control at
22913 instantiation time (PR 42277). See also Core issue 1273. */
22918 if (instantiation_dependent_scope_ref_p (*tp
))
22923 /* Treat statement-expressions as dependent. */
22927 /* Treat requires-expressions as dependent. */
22928 case REQUIRES_EXPR
:
22932 /* Treat calls to function concepts as dependent. */
22933 if (function_concept_check_p (*tp
))
22937 case TEMPLATE_ID_EXPR
:
22938 /* And variable concepts. */
22939 if (variable_concept_p (TREE_OPERAND (*tp
, 0)))
22947 if (type_dependent_expression_p (*tp
))
22953 /* Returns TRUE if the EXPRESSION is instantiation-dependent, in the
22954 sense defined by the ABI:
22956 "An expression is instantiation-dependent if it is type-dependent
22957 or value-dependent, or it has a subexpression that is type-dependent
22958 or value-dependent." */
22961 instantiation_dependent_expression_p (tree expression
)
22965 if (!processing_template_decl
)
22968 if (expression
== error_mark_node
)
22971 result
= cp_walk_tree_without_duplicates (&expression
,
22972 instantiation_dependent_r
, NULL
);
22973 return result
!= NULL_TREE
;
22976 /* Like type_dependent_expression_p, but it also works while not processing
22977 a template definition, i.e. during substitution or mangling. */
22980 type_dependent_expression_p_push (tree expr
)
22983 ++processing_template_decl
;
22984 b
= type_dependent_expression_p (expr
);
22985 --processing_template_decl
;
22989 /* Returns TRUE if ARGS contains a type-dependent expression. */
22992 any_type_dependent_arguments_p (const vec
<tree
, va_gc
> *args
)
22997 FOR_EACH_VEC_SAFE_ELT (args
, i
, arg
)
22999 if (type_dependent_expression_p (arg
))
23005 /* Returns TRUE if LIST (a TREE_LIST whose TREE_VALUEs are
23006 expressions) contains any type-dependent expressions. */
23009 any_type_dependent_elements_p (const_tree list
)
23011 for (; list
; list
= TREE_CHAIN (list
))
23012 if (type_dependent_expression_p (TREE_VALUE (list
)))
23018 /* Returns TRUE if LIST (a TREE_LIST whose TREE_VALUEs are
23019 expressions) contains any value-dependent expressions. */
23022 any_value_dependent_elements_p (const_tree list
)
23024 for (; list
; list
= TREE_CHAIN (list
))
23025 if (value_dependent_expression_p (TREE_VALUE (list
)))
23031 /* Returns TRUE if the ARG (a template argument) is dependent. */
23034 dependent_template_arg_p (tree arg
)
23036 if (!processing_template_decl
)
23039 /* Assume a template argument that was wrongly written by the user
23040 is dependent. This is consistent with what
23041 any_dependent_template_arguments_p [that calls this function]
23043 if (!arg
|| arg
== error_mark_node
)
23046 if (TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
23047 arg
= ARGUMENT_PACK_SELECT_ARG (arg
);
23049 if (TREE_CODE (arg
) == TEMPLATE_DECL
23050 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
23051 return dependent_template_p (arg
);
23052 else if (ARGUMENT_PACK_P (arg
))
23054 tree args
= ARGUMENT_PACK_ARGS (arg
);
23055 int i
, len
= TREE_VEC_LENGTH (args
);
23056 for (i
= 0; i
< len
; ++i
)
23058 if (dependent_template_arg_p (TREE_VEC_ELT (args
, i
)))
23064 else if (TYPE_P (arg
))
23065 return dependent_type_p (arg
);
23067 return (type_dependent_expression_p (arg
)
23068 || value_dependent_expression_p (arg
));
23071 /* Returns true if ARGS (a collection of template arguments) contains
23072 any types that require structural equality testing. */
23075 any_template_arguments_need_structural_equality_p (tree args
)
23082 if (args
== error_mark_node
)
23085 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
23087 tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
23088 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
23090 tree arg
= TREE_VEC_ELT (level
, j
);
23091 tree packed_args
= NULL_TREE
;
23094 if (ARGUMENT_PACK_P (arg
))
23096 /* Look inside the argument pack. */
23097 packed_args
= ARGUMENT_PACK_ARGS (arg
);
23098 len
= TREE_VEC_LENGTH (packed_args
);
23101 for (k
= 0; k
< len
; ++k
)
23104 arg
= TREE_VEC_ELT (packed_args
, k
);
23106 if (error_operand_p (arg
))
23108 else if (TREE_CODE (arg
) == TEMPLATE_DECL
)
23110 else if (TYPE_P (arg
) && TYPE_STRUCTURAL_EQUALITY_P (arg
))
23112 else if (!TYPE_P (arg
) && TREE_TYPE (arg
)
23113 && TYPE_STRUCTURAL_EQUALITY_P (TREE_TYPE (arg
)))
23122 /* Returns true if ARGS (a collection of template arguments) contains
23123 any dependent arguments. */
23126 any_dependent_template_arguments_p (const_tree args
)
23133 if (args
== error_mark_node
)
23136 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
23138 const_tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
23139 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
23140 if (dependent_template_arg_p (TREE_VEC_ELT (level
, j
)))
23147 /* Returns TRUE if the template TMPL is dependent. */
23150 dependent_template_p (tree tmpl
)
23152 if (TREE_CODE (tmpl
) == OVERLOAD
)
23156 if (dependent_template_p (OVL_CURRENT (tmpl
)))
23158 tmpl
= OVL_NEXT (tmpl
);
23163 /* Template template parameters are dependent. */
23164 if (DECL_TEMPLATE_TEMPLATE_PARM_P (tmpl
)
23165 || TREE_CODE (tmpl
) == TEMPLATE_TEMPLATE_PARM
)
23167 /* So are names that have not been looked up. */
23168 if (TREE_CODE (tmpl
) == SCOPE_REF
|| identifier_p (tmpl
))
23170 /* So are member templates of dependent classes. */
23171 if (TYPE_P (CP_DECL_CONTEXT (tmpl
)))
23172 return dependent_type_p (DECL_CONTEXT (tmpl
));
23176 /* Returns TRUE if the specialization TMPL<ARGS> is dependent. */
23179 dependent_template_id_p (tree tmpl
, tree args
)
23181 return (dependent_template_p (tmpl
)
23182 || any_dependent_template_arguments_p (args
));
23185 /* Returns TRUE if OMP_FOR with DECLV, INITV, CONDV and INCRV vectors
23189 dependent_omp_for_p (tree declv
, tree initv
, tree condv
, tree incrv
)
23193 if (!processing_template_decl
)
23196 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
23198 tree decl
= TREE_VEC_ELT (declv
, i
);
23199 tree init
= TREE_VEC_ELT (initv
, i
);
23200 tree cond
= TREE_VEC_ELT (condv
, i
);
23201 tree incr
= TREE_VEC_ELT (incrv
, i
);
23203 if (type_dependent_expression_p (decl
)
23204 || TREE_CODE (decl
) == SCOPE_REF
)
23207 if (init
&& type_dependent_expression_p (init
))
23210 if (type_dependent_expression_p (cond
))
23213 if (COMPARISON_CLASS_P (cond
)
23214 && (type_dependent_expression_p (TREE_OPERAND (cond
, 0))
23215 || type_dependent_expression_p (TREE_OPERAND (cond
, 1))))
23218 if (TREE_CODE (incr
) == MODOP_EXPR
)
23220 if (type_dependent_expression_p (TREE_OPERAND (incr
, 0))
23221 || type_dependent_expression_p (TREE_OPERAND (incr
, 2)))
23224 else if (type_dependent_expression_p (incr
))
23226 else if (TREE_CODE (incr
) == MODIFY_EXPR
)
23228 if (type_dependent_expression_p (TREE_OPERAND (incr
, 0)))
23230 else if (BINARY_CLASS_P (TREE_OPERAND (incr
, 1)))
23232 tree t
= TREE_OPERAND (incr
, 1);
23233 if (type_dependent_expression_p (TREE_OPERAND (t
, 0))
23234 || type_dependent_expression_p (TREE_OPERAND (t
, 1)))
23243 /* TYPE is a TYPENAME_TYPE. Returns the ordinary TYPE to which the
23244 TYPENAME_TYPE corresponds. Returns the original TYPENAME_TYPE if
23245 no such TYPE can be found. Note that this function peers inside
23246 uninstantiated templates and therefore should be used only in
23247 extremely limited situations. ONLY_CURRENT_P restricts this
23248 peering to the currently open classes hierarchy (which is required
23249 when comparing types). */
23252 resolve_typename_type (tree type
, bool only_current_p
)
23261 gcc_assert (TREE_CODE (type
) == TYPENAME_TYPE
);
23263 scope
= TYPE_CONTEXT (type
);
23264 /* Usually the non-qualified identifier of a TYPENAME_TYPE is
23265 TYPE_IDENTIFIER (type). But when 'type' is a typedef variant of
23266 a TYPENAME_TYPE node, then TYPE_NAME (type) is set to the TYPE_DECL representing
23267 the typedef. In that case TYPE_IDENTIFIER (type) is not the non-qualified
23268 identifier of the TYPENAME_TYPE anymore.
23269 So by getting the TYPE_IDENTIFIER of the _main declaration_ of the
23270 TYPENAME_TYPE instead, we avoid messing up with a possible
23271 typedef variant case. */
23272 name
= TYPE_IDENTIFIER (TYPE_MAIN_VARIANT (type
));
23274 /* If the SCOPE is itself a TYPENAME_TYPE, then we need to resolve
23275 it first before we can figure out what NAME refers to. */
23276 if (TREE_CODE (scope
) == TYPENAME_TYPE
)
23278 if (TYPENAME_IS_RESOLVING_P (scope
))
23279 /* Given a class template A with a dependent base with nested type C,
23280 typedef typename A::C::C C will land us here, as trying to resolve
23281 the initial A::C leads to the local C typedef, which leads back to
23282 A::C::C. So we break the recursion now. */
23285 scope
= resolve_typename_type (scope
, only_current_p
);
23287 /* If we don't know what SCOPE refers to, then we cannot resolve the
23289 if (TREE_CODE (scope
) == TYPENAME_TYPE
)
23291 /* If the SCOPE is a template type parameter, we have no way of
23292 resolving the name. */
23293 if (TREE_CODE (scope
) == TEMPLATE_TYPE_PARM
)
23295 /* If the SCOPE is not the current instantiation, there's no reason
23296 to look inside it. */
23297 if (only_current_p
&& !currently_open_class (scope
))
23299 /* If this is a typedef, we don't want to look inside (c++/11987). */
23300 if (typedef_variant_p (type
))
23302 /* If SCOPE isn't the template itself, it will not have a valid
23303 TYPE_FIELDS list. */
23304 if (CLASS_TYPE_P (scope
)
23305 && same_type_p (scope
, CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope
)))
23306 /* scope is either the template itself or a compatible instantiation
23307 like X<T>, so look up the name in the original template. */
23308 scope
= CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope
);
23310 /* scope is a partial instantiation, so we can't do the lookup or we
23311 will lose the template arguments. */
23313 /* Enter the SCOPE so that name lookup will be resolved as if we
23314 were in the class definition. In particular, SCOPE will no
23315 longer be considered a dependent type. */
23316 pushed_scope
= push_scope (scope
);
23317 /* Look up the declaration. */
23318 decl
= lookup_member (scope
, name
, /*protect=*/0, /*want_type=*/true,
23319 tf_warning_or_error
);
23321 result
= NULL_TREE
;
23323 /* For a TYPENAME_TYPE like "typename X::template Y<T>", we want to
23324 find a TEMPLATE_DECL. Otherwise, we want to find a TYPE_DECL. */
23327 else if (identifier_p (TYPENAME_TYPE_FULLNAME (type
))
23328 && TREE_CODE (decl
) == TYPE_DECL
)
23330 result
= TREE_TYPE (decl
);
23331 if (result
== error_mark_node
)
23332 result
= NULL_TREE
;
23334 else if (TREE_CODE (TYPENAME_TYPE_FULLNAME (type
)) == TEMPLATE_ID_EXPR
23335 && DECL_CLASS_TEMPLATE_P (decl
))
23339 /* Obtain the template and the arguments. */
23340 tmpl
= TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type
), 0);
23341 args
= TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type
), 1);
23342 /* Instantiate the template. */
23343 result
= lookup_template_class (tmpl
, args
, NULL_TREE
, NULL_TREE
,
23344 /*entering_scope=*/0,
23345 tf_error
| tf_user
);
23346 if (result
== error_mark_node
)
23347 result
= NULL_TREE
;
23350 /* Leave the SCOPE. */
23352 pop_scope (pushed_scope
);
23354 /* If we failed to resolve it, return the original typename. */
23358 /* If lookup found a typename type, resolve that too. */
23359 if (TREE_CODE (result
) == TYPENAME_TYPE
&& !TYPENAME_IS_RESOLVING_P (result
))
23361 /* Ill-formed programs can cause infinite recursion here, so we
23362 must catch that. */
23363 TYPENAME_IS_RESOLVING_P (type
) = 1;
23364 result
= resolve_typename_type (result
, only_current_p
);
23365 TYPENAME_IS_RESOLVING_P (type
) = 0;
23368 /* Qualify the resulting type. */
23369 quals
= cp_type_quals (type
);
23371 result
= cp_build_qualified_type (result
, cp_type_quals (result
) | quals
);
23376 /* EXPR is an expression which is not type-dependent. Return a proxy
23377 for EXPR that can be used to compute the types of larger
23378 expressions containing EXPR. */
23381 build_non_dependent_expr (tree expr
)
23385 /* Try to get a constant value for all non-dependent expressions in
23386 order to expose bugs in *_dependent_expression_p and constexpr. */
23387 if (flag_checking
&& cxx_dialect
>= cxx11
)
23388 fold_non_dependent_expr (expr
);
23390 /* Preserve OVERLOADs; the functions must be available to resolve
23393 if (TREE_CODE (inner_expr
) == STMT_EXPR
)
23394 inner_expr
= stmt_expr_value_expr (inner_expr
);
23395 if (TREE_CODE (inner_expr
) == ADDR_EXPR
)
23396 inner_expr
= TREE_OPERAND (inner_expr
, 0);
23397 if (TREE_CODE (inner_expr
) == COMPONENT_REF
)
23398 inner_expr
= TREE_OPERAND (inner_expr
, 1);
23399 if (is_overloaded_fn (inner_expr
)
23400 || TREE_CODE (inner_expr
) == OFFSET_REF
)
23402 /* There is no need to return a proxy for a variable. */
23405 /* Preserve string constants; conversions from string constants to
23406 "char *" are allowed, even though normally a "const char *"
23407 cannot be used to initialize a "char *". */
23408 if (TREE_CODE (expr
) == STRING_CST
)
23410 /* Preserve void and arithmetic constants, as an optimization -- there is no
23411 reason to create a new node. */
23412 if (TREE_CODE (expr
) == VOID_CST
23413 || TREE_CODE (expr
) == INTEGER_CST
23414 || TREE_CODE (expr
) == REAL_CST
)
23416 /* Preserve THROW_EXPRs -- all throw-expressions have type "void".
23417 There is at least one place where we want to know that a
23418 particular expression is a throw-expression: when checking a ?:
23419 expression, there are special rules if the second or third
23420 argument is a throw-expression. */
23421 if (TREE_CODE (expr
) == THROW_EXPR
)
23424 /* Don't wrap an initializer list, we need to be able to look inside. */
23425 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
23428 /* Don't wrap a dummy object, we need to be able to test for it. */
23429 if (is_dummy_object (expr
))
23432 if (TREE_CODE (expr
) == COND_EXPR
)
23433 return build3 (COND_EXPR
,
23435 TREE_OPERAND (expr
, 0),
23436 (TREE_OPERAND (expr
, 1)
23437 ? build_non_dependent_expr (TREE_OPERAND (expr
, 1))
23438 : build_non_dependent_expr (TREE_OPERAND (expr
, 0))),
23439 build_non_dependent_expr (TREE_OPERAND (expr
, 2)));
23440 if (TREE_CODE (expr
) == COMPOUND_EXPR
23441 && !COMPOUND_EXPR_OVERLOADED (expr
))
23442 return build2 (COMPOUND_EXPR
,
23444 TREE_OPERAND (expr
, 0),
23445 build_non_dependent_expr (TREE_OPERAND (expr
, 1)));
23447 /* If the type is unknown, it can't really be non-dependent */
23448 gcc_assert (TREE_TYPE (expr
) != unknown_type_node
);
23450 /* Otherwise, build a NON_DEPENDENT_EXPR. */
23451 return build1 (NON_DEPENDENT_EXPR
, TREE_TYPE (expr
), expr
);
23454 /* ARGS is a vector of expressions as arguments to a function call.
23455 Replace the arguments with equivalent non-dependent expressions.
23456 This modifies ARGS in place. */
23459 make_args_non_dependent (vec
<tree
, va_gc
> *args
)
23464 FOR_EACH_VEC_SAFE_ELT (args
, ix
, arg
)
23466 tree newarg
= build_non_dependent_expr (arg
);
23468 (*args
)[ix
] = newarg
;
23472 /* Returns a type which represents 'auto' or 'decltype(auto)'. We use a
23473 TEMPLATE_TYPE_PARM with a level one deeper than the actual template
23474 parms. If set_canonical is true, we set TYPE_CANONICAL on it. */
23477 make_auto_1 (tree name
, bool set_canonical
)
23479 tree au
= cxx_make_type (TEMPLATE_TYPE_PARM
);
23480 TYPE_NAME (au
) = build_decl (input_location
,
23481 TYPE_DECL
, name
, au
);
23482 TYPE_STUB_DECL (au
) = TYPE_NAME (au
);
23483 TEMPLATE_TYPE_PARM_INDEX (au
) = build_template_parm_index
23484 (0, processing_template_decl
+ 1, processing_template_decl
+ 1,
23485 TYPE_NAME (au
), NULL_TREE
);
23487 TYPE_CANONICAL (au
) = canonical_type_parameter (au
);
23488 DECL_ARTIFICIAL (TYPE_NAME (au
)) = 1;
23489 SET_DECL_TEMPLATE_PARM_P (TYPE_NAME (au
));
23495 make_decltype_auto (void)
23497 return make_auto_1 (get_identifier ("decltype(auto)"), true);
23503 return make_auto_1 (get_identifier ("auto"), true);
23506 /* Make a "constrained auto" type-specifier. This is an
23507 auto type with constraints that must be associated after
23508 deduction. The constraint is formed from the given
23509 CONC and its optional sequence of arguments, which are
23510 non-null if written as partial-concept-id. */
23513 make_constrained_auto (tree con
, tree args
)
23515 tree type
= make_auto_1 (get_identifier ("auto"), false);
23517 /* Build the constraint. */
23518 tree tmpl
= DECL_TI_TEMPLATE (con
);
23521 expr
= build_concept_check (tmpl
, type
, args
);
23523 expr
= build_concept_check (build_overload (tmpl
, NULL_TREE
), type
, args
);
23525 tree constr
= make_predicate_constraint (expr
);
23526 PLACEHOLDER_TYPE_CONSTRAINTS (type
) = constr
;
23528 /* Our canonical type depends on the constraint. */
23529 TYPE_CANONICAL (type
) = canonical_type_parameter (type
);
23531 /* Attach the constraint to the type declaration. */
23532 tree decl
= TYPE_NAME (type
);
23536 /* Given type ARG, return std::initializer_list<ARG>. */
23541 tree std_init_list
= namespace_binding
23542 (get_identifier ("initializer_list"), std_node
);
23544 if (!std_init_list
|| !DECL_CLASS_TEMPLATE_P (std_init_list
))
23546 error ("deducing from brace-enclosed initializer list requires "
23547 "#include <initializer_list>");
23548 return error_mark_node
;
23550 argvec
= make_tree_vec (1);
23551 TREE_VEC_ELT (argvec
, 0) = arg
;
23552 return lookup_template_class (std_init_list
, argvec
, NULL_TREE
,
23553 NULL_TREE
, 0, tf_warning_or_error
);
23556 /* Replace auto in TYPE with std::initializer_list<auto>. */
23559 listify_autos (tree type
, tree auto_node
)
23561 tree init_auto
= listify (auto_node
);
23562 tree argvec
= make_tree_vec (1);
23563 TREE_VEC_ELT (argvec
, 0) = init_auto
;
23564 if (processing_template_decl
)
23565 argvec
= add_to_template_args (current_template_args (), argvec
);
23566 return tsubst (type
, argvec
, tf_warning_or_error
, NULL_TREE
);
23569 /* Hash traits for hashing possibly constrained 'auto'
23570 TEMPLATE_TYPE_PARMs for use by do_auto_deduction. */
23572 struct auto_hash
: default_hash_traits
<tree
>
23574 static inline hashval_t
hash (tree
);
23575 static inline bool equal (tree
, tree
);
23578 /* Hash the 'auto' T. */
23581 auto_hash::hash (tree t
)
23583 if (tree c
= PLACEHOLDER_TYPE_CONSTRAINTS (t
))
23584 /* Matching constrained-type-specifiers denote the same template
23585 parameter, so hash the constraint. */
23586 return hash_placeholder_constraint (c
);
23588 /* But unconstrained autos are all separate, so just hash the pointer. */
23589 return iterative_hash_object (t
, 0);
23592 /* Compare two 'auto's. */
23595 auto_hash::equal (tree t1
, tree t2
)
23600 tree c1
= PLACEHOLDER_TYPE_CONSTRAINTS (t1
);
23601 tree c2
= PLACEHOLDER_TYPE_CONSTRAINTS (t2
);
23603 /* Two unconstrained autos are distinct. */
23607 return equivalent_placeholder_constraints (c1
, c2
);
23610 /* for_each_template_parm callback for extract_autos: if t is a (possibly
23611 constrained) auto, add it to the vector. */
23614 extract_autos_r (tree t
, void *data
)
23616 hash_table
<auto_hash
> &hash
= *(hash_table
<auto_hash
>*)data
;
23617 if (is_auto_or_concept (t
))
23619 /* All the autos were built with index 0; fix that up now. */
23620 tree
*p
= hash
.find_slot (t
, INSERT
);
23623 /* If this is a repeated constrained-type-specifier, use the index we
23625 idx
= TEMPLATE_PARM_IDX (TEMPLATE_TYPE_PARM_INDEX (*p
));
23628 /* Otherwise this is new, so use the current count. */
23630 idx
= hash
.elements () - 1;
23632 TEMPLATE_PARM_IDX (TEMPLATE_TYPE_PARM_INDEX (t
)) = idx
;
23635 /* Always keep walking. */
23639 /* Return a TREE_VEC of the 'auto's used in type under the Concepts TS, which
23640 says they can appear anywhere in the type. */
23643 extract_autos (tree type
)
23645 hash_set
<tree
> visited
;
23646 hash_table
<auto_hash
> hash (2);
23648 for_each_template_parm (type
, extract_autos_r
, &hash
, &visited
, true);
23650 tree tree_vec
= make_tree_vec (hash
.elements());
23651 for (hash_table
<auto_hash
>::iterator iter
= hash
.begin();
23652 iter
!= hash
.end(); ++iter
)
23655 unsigned i
= TEMPLATE_PARM_IDX (TEMPLATE_TYPE_PARM_INDEX (elt
));
23656 TREE_VEC_ELT (tree_vec
, i
)
23657 = build_tree_list (NULL_TREE
, TYPE_NAME (elt
));
23663 /* Replace occurrences of 'auto' in TYPE with the appropriate type deduced
23664 from INIT. AUTO_NODE is the TEMPLATE_TYPE_PARM used for 'auto' in TYPE. */
23667 do_auto_deduction (tree type
, tree init
, tree auto_node
)
23669 return do_auto_deduction (type
, init
, auto_node
,
23670 tf_warning_or_error
,
23674 /* Replace occurrences of 'auto' in TYPE with the appropriate type deduced
23675 from INIT. AUTO_NODE is the TEMPLATE_TYPE_PARM used for 'auto' in TYPE.
23676 The CONTEXT determines the context in which auto deduction is performed
23677 and is used to control error diagnostics. */
23680 do_auto_deduction (tree type
, tree init
, tree auto_node
,
23681 tsubst_flags_t complain
, auto_deduction_context context
)
23685 if (init
== error_mark_node
)
23686 return error_mark_node
;
23688 if (type_dependent_expression_p (init
))
23689 /* Defining a subset of type-dependent expressions that we can deduce
23690 from ahead of time isn't worth the trouble. */
23693 /* [dcl.spec.auto]: Obtain P from T by replacing the occurrences of auto
23694 with either a new invented type template parameter U or, if the
23695 initializer is a braced-init-list (8.5.4), with
23696 std::initializer_list<U>. */
23697 if (BRACE_ENCLOSED_INITIALIZER_P (init
))
23699 if (!DIRECT_LIST_INIT_P (init
))
23700 type
= listify_autos (type
, auto_node
);
23701 else if (CONSTRUCTOR_NELTS (init
) == 1)
23702 init
= CONSTRUCTOR_ELT (init
, 0)->value
;
23705 if (complain
& tf_warning_or_error
)
23707 if (permerror (input_location
, "direct-list-initialization of "
23708 "%<auto%> requires exactly one element"))
23709 inform (input_location
,
23710 "for deduction to %<std::initializer_list%>, use copy-"
23711 "list-initialization (i.e. add %<=%> before the %<{%>)");
23713 type
= listify_autos (type
, auto_node
);
23717 if (type
== error_mark_node
)
23718 return error_mark_node
;
23720 init
= resolve_nondeduced_context (init
);
23722 if (AUTO_IS_DECLTYPE (auto_node
))
23724 bool id
= (DECL_P (init
) || (TREE_CODE (init
) == COMPONENT_REF
23725 && !REF_PARENTHESIZED_P (init
)));
23726 targs
= make_tree_vec (1);
23727 TREE_VEC_ELT (targs
, 0)
23728 = finish_decltype_type (init
, id
, tf_warning_or_error
);
23729 if (type
!= auto_node
)
23731 if (complain
& tf_error
)
23732 error ("%qT as type rather than plain %<decltype(auto)%>", type
);
23733 return error_mark_node
;
23738 tree parms
= build_tree_list (NULL_TREE
, type
);
23742 tparms
= extract_autos (type
);
23745 tparms
= make_tree_vec (1);
23746 TREE_VEC_ELT (tparms
, 0)
23747 = build_tree_list (NULL_TREE
, TYPE_NAME (auto_node
));
23750 targs
= make_tree_vec (TREE_VEC_LENGTH (tparms
));
23751 int val
= type_unification_real (tparms
, targs
, parms
, &init
, 1, 0,
23752 DEDUCE_CALL
, LOOKUP_NORMAL
,
23753 NULL
, /*explain_p=*/false);
23756 if (processing_template_decl
)
23757 /* Try again at instantiation time. */
23759 if (type
&& type
!= error_mark_node
23760 && (complain
& tf_error
))
23761 /* If type is error_mark_node a diagnostic must have been
23762 emitted by now. Also, having a mention to '<type error>'
23763 in the diagnostic is not really useful to the user. */
23765 if (cfun
&& auto_node
== current_function_auto_return_pattern
23766 && LAMBDA_FUNCTION_P (current_function_decl
))
23767 error ("unable to deduce lambda return type from %qE", init
);
23769 error ("unable to deduce %qT from %qE", type
, init
);
23770 type_unification_real (tparms
, targs
, parms
, &init
, 1, 0,
23771 DEDUCE_CALL
, LOOKUP_NORMAL
,
23772 NULL
, /*explain_p=*/true);
23774 return error_mark_node
;
23778 /* Check any placeholder constraints against the deduced type. */
23779 if (flag_concepts
&& !processing_template_decl
)
23780 if (tree constr
= PLACEHOLDER_TYPE_CONSTRAINTS (auto_node
))
23782 /* Use the deduced type to check the associated constraints. */
23783 if (!constraints_satisfied_p (constr
, targs
))
23785 if (complain
& tf_warning_or_error
)
23789 case adc_unspecified
:
23790 error("placeholder constraints not satisfied");
23792 case adc_variable_type
:
23793 error ("deduced initializer does not satisfy "
23794 "placeholder constraints");
23796 case adc_return_type
:
23797 error ("deduced return type does not satisfy "
23798 "placeholder constraints");
23800 case adc_requirement
:
23801 error ("deduced expression type does not saatisy "
23802 "placeholder constraints");
23805 diagnose_constraints (input_location
, constr
, targs
);
23807 return error_mark_node
;
23811 if (processing_template_decl
)
23812 targs
= add_to_template_args (current_template_args (), targs
);
23813 return tsubst (type
, targs
, complain
, NULL_TREE
);
23816 /* Substitutes LATE_RETURN_TYPE for 'auto' in TYPE and returns the
23820 splice_late_return_type (tree type
, tree late_return_type
)
23822 if (is_auto (type
))
23824 if (late_return_type
)
23825 return late_return_type
;
23827 tree idx
= get_template_parm_index (type
);
23828 if (TEMPLATE_PARM_LEVEL (idx
) <= processing_template_decl
)
23829 /* In an abbreviated function template we didn't know we were dealing
23830 with a function template when we saw the auto return type, so update
23831 it to have the correct level. */
23832 return make_auto_1 (TYPE_IDENTIFIER (type
), true);
23837 /* Returns true iff TYPE is a TEMPLATE_TYPE_PARM representing 'auto' or
23838 'decltype(auto)'. */
23841 is_auto (const_tree type
)
23843 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
23844 && (TYPE_IDENTIFIER (type
) == get_identifier ("auto")
23845 || TYPE_IDENTIFIER (type
) == get_identifier ("decltype(auto)")))
23851 /* for_each_template_parm callback for type_uses_auto. */
23854 is_auto_r (tree tp
, void */
*data*/
)
23856 return is_auto_or_concept (tp
);
23859 /* Returns the TEMPLATE_TYPE_PARM in TYPE representing `auto' iff TYPE contains
23860 a use of `auto'. Returns NULL_TREE otherwise. */
23863 type_uses_auto (tree type
)
23865 if (type
== NULL_TREE
)
23867 else if (flag_concepts
)
23869 /* The Concepts TS allows multiple autos in one type-specifier; just
23870 return the first one we find, do_auto_deduction will collect all of
23872 if (uses_template_parms (type
))
23873 return for_each_template_parm (type
, is_auto_r
, /*data*/NULL
,
23874 /*visited*/NULL
, /*nondeduced*/true);
23879 return find_type_usage (type
, is_auto
);
23882 /* Returns true iff TYPE is a TEMPLATE_TYPE_PARM representing 'auto',
23883 'decltype(auto)' or a concept. */
23886 is_auto_or_concept (const_tree type
)
23888 return is_auto (type
); // or concept
23891 /* Returns the TEMPLATE_TYPE_PARM in TYPE representing a generic type (`auto' or
23892 a concept identifier) iff TYPE contains a use of a generic type. Returns
23893 NULL_TREE otherwise. */
23896 type_uses_auto_or_concept (tree type
)
23898 return find_type_usage (type
, is_auto_or_concept
);
23902 /* For a given template T, return the vector of typedefs referenced
23903 in T for which access check is needed at T instantiation time.
23904 T is either a FUNCTION_DECL or a RECORD_TYPE.
23905 Those typedefs were added to T by the function
23906 append_type_to_template_for_access_check. */
23908 vec
<qualified_typedef_usage_t
, va_gc
> *
23909 get_types_needing_access_check (tree t
)
23912 vec
<qualified_typedef_usage_t
, va_gc
> *result
= NULL
;
23914 if (!t
|| t
== error_mark_node
)
23917 if (!(ti
= get_template_info (t
)))
23920 if (CLASS_TYPE_P (t
)
23921 || TREE_CODE (t
) == FUNCTION_DECL
)
23923 if (!TI_TEMPLATE (ti
))
23926 result
= TI_TYPEDEFS_NEEDING_ACCESS_CHECKING (ti
);
23932 /* Append the typedef TYPE_DECL used in template T to a list of typedefs
23933 tied to T. That list of typedefs will be access checked at
23934 T instantiation time.
23935 T is either a FUNCTION_DECL or a RECORD_TYPE.
23936 TYPE_DECL is a TYPE_DECL node representing a typedef.
23937 SCOPE is the scope through which TYPE_DECL is accessed.
23938 LOCATION is the location of the usage point of TYPE_DECL.
23940 This function is a subroutine of
23941 append_type_to_template_for_access_check. */
23944 append_type_to_template_for_access_check_1 (tree t
,
23947 location_t location
)
23949 qualified_typedef_usage_t typedef_usage
;
23952 if (!t
|| t
== error_mark_node
)
23955 gcc_assert ((TREE_CODE (t
) == FUNCTION_DECL
23956 || CLASS_TYPE_P (t
))
23958 && TREE_CODE (type_decl
) == TYPE_DECL
23961 if (!(ti
= get_template_info (t
)))
23964 gcc_assert (TI_TEMPLATE (ti
));
23966 typedef_usage
.typedef_decl
= type_decl
;
23967 typedef_usage
.context
= scope
;
23968 typedef_usage
.locus
= location
;
23970 vec_safe_push (TI_TYPEDEFS_NEEDING_ACCESS_CHECKING (ti
), typedef_usage
);
23973 /* Append TYPE_DECL to the template TEMPL.
23974 TEMPL is either a class type, a FUNCTION_DECL or a a TEMPLATE_DECL.
23975 At TEMPL instanciation time, TYPE_DECL will be checked to see
23976 if it can be accessed through SCOPE.
23977 LOCATION is the location of the usage point of TYPE_DECL.
23979 e.g. consider the following code snippet:
23986 template<class U> struct S
23988 C::myint mi; // <-- usage point of the typedef C::myint
23993 At S<char> instantiation time, we need to check the access of C::myint
23994 In other words, we need to check the access of the myint typedef through
23995 the C scope. For that purpose, this function will add the myint typedef
23996 and the scope C through which its being accessed to a list of typedefs
23997 tied to the template S. That list will be walked at template instantiation
23998 time and access check performed on each typedefs it contains.
23999 Note that this particular code snippet should yield an error because
24000 myint is private to C. */
24003 append_type_to_template_for_access_check (tree templ
,
24006 location_t location
)
24008 qualified_typedef_usage_t
*iter
;
24011 gcc_assert (type_decl
&& (TREE_CODE (type_decl
) == TYPE_DECL
));
24013 /* Make sure we don't append the type to the template twice. */
24014 FOR_EACH_VEC_SAFE_ELT (get_types_needing_access_check (templ
), i
, iter
)
24015 if (iter
->typedef_decl
== type_decl
&& scope
== iter
->context
)
24018 append_type_to_template_for_access_check_1 (templ
, type_decl
,
24022 /* Convert the generic type parameters in PARM that match the types given in the
24023 range [START_IDX, END_IDX) from the current_template_parms into generic type
24027 convert_generic_types_to_packs (tree parm
, int start_idx
, int end_idx
)
24029 tree current
= current_template_parms
;
24030 int depth
= TMPL_PARMS_DEPTH (current
);
24031 current
= INNERMOST_TEMPLATE_PARMS (current
);
24032 tree replacement
= make_tree_vec (TREE_VEC_LENGTH (current
));
24034 for (int i
= 0; i
< start_idx
; ++i
)
24035 TREE_VEC_ELT (replacement
, i
)
24036 = TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (current
, i
)));
24038 for (int i
= start_idx
; i
< end_idx
; ++i
)
24040 /* Create a distinct parameter pack type from the current parm and add it
24041 to the replacement args to tsubst below into the generic function
24044 tree o
= TREE_TYPE (TREE_VALUE
24045 (TREE_VEC_ELT (current
, i
)));
24046 tree t
= copy_type (o
);
24047 TEMPLATE_TYPE_PARM_INDEX (t
)
24048 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (o
),
24050 TREE_TYPE (TEMPLATE_TYPE_DECL (t
)) = t
;
24051 TYPE_STUB_DECL (t
) = TYPE_NAME (t
) = TEMPLATE_TYPE_DECL (t
);
24052 TYPE_MAIN_VARIANT (t
) = t
;
24053 TEMPLATE_TYPE_PARAMETER_PACK (t
) = true;
24054 TYPE_CANONICAL (t
) = canonical_type_parameter (t
);
24055 TREE_VEC_ELT (replacement
, i
) = t
;
24056 TREE_VALUE (TREE_VEC_ELT (current
, i
)) = TREE_CHAIN (t
);
24059 for (int i
= end_idx
, e
= TREE_VEC_LENGTH (current
); i
< e
; ++i
)
24060 TREE_VEC_ELT (replacement
, i
)
24061 = TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (current
, i
)));
24063 /* If there are more levels then build up the replacement with the outer
24066 replacement
= add_to_template_args (template_parms_to_args
24067 (TREE_CHAIN (current_template_parms
)),
24070 return tsubst (parm
, replacement
, tf_none
, NULL_TREE
);
24073 /* Entries in the decl_constraint hash table. */
24074 struct GTY((for_user
)) constr_entry
24080 /* Hashing function and equality for constraint entries. */
24081 struct constr_hasher
: ggc_ptr_hash
<constr_entry
>
24083 static hashval_t
hash (constr_entry
*e
)
24085 return (hashval_t
)DECL_UID (e
->decl
);
24088 static bool equal (constr_entry
*e1
, constr_entry
*e2
)
24090 return e1
->decl
== e2
->decl
;
24094 /* A mapping from declarations to constraint information. Note that
24095 both templates and their underlying declarations are mapped to the
24096 same constraint information.
24098 FIXME: This is defined in pt.c because garbage collection
24099 code is not being generated for constraint.cc. */
24101 static GTY (()) hash_table
<constr_hasher
> *decl_constraints
;
24103 /* Returns true iff cinfo contains a valid set of constraints.
24104 This is the case when the associated requirements have been
24105 successfully decomposed into lists of atomic constraints.
24106 That is, when the saved assumptions are not error_mark_node. */
24109 valid_constraints_p (tree cinfo
)
24111 gcc_assert (cinfo
);
24112 return CI_ASSUMPTIONS (cinfo
) != error_mark_node
;
24115 /* Returns the template constraints of declaration T. If T is not
24116 constrained, return NULL_TREE. Note that T must be non-null. */
24119 get_constraints (tree t
)
24121 gcc_assert (DECL_P (t
));
24122 if (TREE_CODE (t
) == TEMPLATE_DECL
)
24123 t
= DECL_TEMPLATE_RESULT (t
);
24124 constr_entry elt
= { t
, NULL_TREE
};
24125 constr_entry
* found
= decl_constraints
->find (&elt
);
24132 /* Associate the given constraint information CI with the declaration
24133 T. If T is a template, then the constraints are associated with
24134 its underlying declaration. Don't build associations if CI is
24138 set_constraints (tree t
, tree ci
)
24143 if (TREE_CODE (t
) == TEMPLATE_DECL
)
24144 t
= DECL_TEMPLATE_RESULT (t
);
24145 gcc_assert (!get_constraints (t
));
24146 constr_entry elt
= {t
, ci
};
24147 constr_entry
** slot
= decl_constraints
->find_slot (&elt
, INSERT
);
24148 constr_entry
* entry
= ggc_alloc
<constr_entry
> ();
24153 /* Remove the associated constraints of the declaration T. */
24156 remove_constraints (tree t
)
24158 gcc_assert (DECL_P (t
));
24159 if (TREE_CODE (t
) == TEMPLATE_DECL
)
24160 t
= DECL_TEMPLATE_RESULT (t
);
24162 constr_entry elt
= {t
, NULL_TREE
};
24163 constr_entry
** slot
= decl_constraints
->find_slot (&elt
, NO_INSERT
);
24165 decl_constraints
->clear_slot (slot
);
24168 /* Set up the hash table for constraint association. */
24171 init_constraint_processing (void)
24173 decl_constraints
= hash_table
<constr_hasher
>::create_ggc(37);
24176 /* Set up the hash tables for template instantiations. */
24179 init_template_processing (void)
24181 decl_specializations
= hash_table
<spec_hasher
>::create_ggc (37);
24182 type_specializations
= hash_table
<spec_hasher
>::create_ggc (37);
24185 /* Print stats about the template hash tables for -fstats. */
24188 print_template_statistics (void)
24190 fprintf (stderr
, "decl_specializations: size %ld, %ld elements, "
24191 "%f collisions\n", (long) decl_specializations
->size (),
24192 (long) decl_specializations
->elements (),
24193 decl_specializations
->collisions ());
24194 fprintf (stderr
, "type_specializations: size %ld, %ld elements, "
24195 "%f collisions\n", (long) type_specializations
->size (),
24196 (long) type_specializations
->elements (),
24197 type_specializations
->collisions ());
24200 #include "gt-cp-pt.h"