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
))
863 if (tree main_constr
= get_constraints (tmpl
))
864 if (equivalent_constraints (type_constr
, main_constr
))
867 // Also, if there's a pre-existing specialization with matching
868 // constraints, then this also isn't new.
869 tree specs
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
872 tree spec_tmpl
= TREE_VALUE (specs
);
873 tree spec_args
= TREE_PURPOSE (specs
);
874 tree spec_constr
= get_constraints (spec_tmpl
);
875 if (comp_template_args (args
, spec_args
)
876 && equivalent_constraints (type_constr
, spec_constr
))
878 specs
= TREE_CHAIN (specs
);
881 // Create a new type node (and corresponding type decl)
882 // for the newly declared specialization.
883 tree t
= make_class_type (TREE_CODE (type
));
884 CLASSTYPE_DECLARED_CLASS (t
) = CLASSTYPE_DECLARED_CLASS (type
);
885 TYPE_FOR_JAVA (t
) = TYPE_FOR_JAVA (type
);
886 SET_TYPE_TEMPLATE_INFO (t
, build_template_info (tmpl
, args
));
888 /* We only need a separate type node for storing the definition of this
889 partial specialization; uses of S<T*> are unconstrained, so all are
890 equivalent. So keep TYPE_CANONICAL the same. */
891 TYPE_CANONICAL (t
) = TYPE_CANONICAL (type
);
893 // Build the corresponding type decl.
894 tree d
= create_implicit_typedef (DECL_NAME (tmpl
), t
);
895 DECL_CONTEXT (d
) = TYPE_CONTEXT (t
);
896 DECL_SOURCE_LOCATION (d
) = input_location
;
904 /* The TYPE is being declared. If it is a template type, that means it
905 is a partial specialization. Do appropriate error-checking. */
908 maybe_process_partial_specialization (tree type
)
912 if (type
== error_mark_node
)
913 return error_mark_node
;
915 /* A lambda that appears in specialization context is not itself a
917 if (CLASS_TYPE_P (type
) && CLASSTYPE_LAMBDA_EXPR (type
))
920 if (TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
922 error ("name of class shadows template template parameter %qD",
924 return error_mark_node
;
927 context
= TYPE_CONTEXT (type
);
929 if (TYPE_ALIAS_P (type
))
931 if (TYPE_TEMPLATE_INFO (type
)
932 && DECL_ALIAS_TEMPLATE_P (TYPE_TI_TEMPLATE (type
)))
933 error ("specialization of alias template %qD",
934 TYPE_TI_TEMPLATE (type
));
936 error ("explicit specialization of non-template %qT", type
);
937 return error_mark_node
;
939 else if (CLASS_TYPE_P (type
) && CLASSTYPE_USE_TEMPLATE (type
))
941 /* This is for ordinary explicit specialization and partial
942 specialization of a template class such as:
944 template <> class C<int>;
948 template <class T> class C<T*>;
950 Make sure that `C<int>' and `C<T*>' are implicit instantiations. */
952 if (tree t
= maybe_new_partial_specialization (type
))
954 if (!check_specialization_namespace (CLASSTYPE_TI_TEMPLATE (t
))
955 && !at_namespace_scope_p ())
956 return error_mark_node
;
957 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (t
);
958 DECL_SOURCE_LOCATION (TYPE_MAIN_DECL (t
)) = input_location
;
959 if (processing_template_decl
)
961 tree decl
= push_template_decl (TYPE_MAIN_DECL (t
));
962 if (decl
== error_mark_node
)
963 return error_mark_node
;
964 return TREE_TYPE (decl
);
967 else if (CLASSTYPE_TEMPLATE_INSTANTIATION (type
))
968 error ("specialization of %qT after instantiation", type
);
969 else if (errorcount
&& !processing_specialization
970 && CLASSTYPE_TEMPLATE_SPECIALIZATION (type
)
971 && !uses_template_parms (CLASSTYPE_TI_ARGS (type
)))
972 /* Trying to define a specialization either without a template<> header
973 or in an inappropriate place. We've already given an error, so just
974 bail now so we don't actually define the specialization. */
975 return error_mark_node
;
977 else if (CLASS_TYPE_P (type
)
978 && !CLASSTYPE_USE_TEMPLATE (type
)
979 && CLASSTYPE_TEMPLATE_INFO (type
)
980 && context
&& CLASS_TYPE_P (context
)
981 && CLASSTYPE_TEMPLATE_INFO (context
))
983 /* This is for an explicit specialization of member class
984 template according to [temp.expl.spec/18]:
986 template <> template <class U> class C<int>::D;
988 The context `C<int>' must be an implicit instantiation.
989 Otherwise this is just a member class template declared
992 template <> class C<int> { template <class U> class D; };
993 template <> template <class U> class C<int>::D;
995 In the first case, `C<int>::D' is a specialization of `C<T>::D'
996 while in the second case, `C<int>::D' is a primary template
997 and `C<T>::D' may not exist. */
999 if (CLASSTYPE_IMPLICIT_INSTANTIATION (context
)
1000 && !COMPLETE_TYPE_P (type
))
1003 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
1005 if (current_namespace
1006 != decl_namespace_context (tmpl
))
1008 permerror (input_location
,
1009 "specializing %q#T in different namespace", type
);
1010 permerror (DECL_SOURCE_LOCATION (tmpl
),
1011 " from definition of %q#D", tmpl
);
1014 /* Check for invalid specialization after instantiation:
1016 template <> template <> class C<int>::D<int>;
1017 template <> template <class U> class C<int>::D; */
1019 for (t
= DECL_TEMPLATE_INSTANTIATIONS (tmpl
);
1020 t
; t
= TREE_CHAIN (t
))
1022 tree inst
= TREE_VALUE (t
);
1023 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (inst
)
1024 || !COMPLETE_OR_OPEN_TYPE_P (inst
))
1026 /* We already have a full specialization of this partial
1027 instantiation, or a full specialization has been
1028 looked up but not instantiated. Reassign it to the
1029 new member specialization template. */
1033 elt
.tmpl
= most_general_template (tmpl
);
1034 elt
.args
= CLASSTYPE_TI_ARGS (inst
);
1037 type_specializations
->remove_elt (&elt
);
1040 elt
.args
= INNERMOST_TEMPLATE_ARGS (elt
.args
);
1043 = type_specializations
->find_slot (&elt
, INSERT
);
1044 entry
= ggc_alloc
<spec_entry
> ();
1049 /* But if we've had an implicit instantiation, that's a
1050 problem ([temp.expl.spec]/6). */
1051 error ("specialization %qT after instantiation %qT",
1055 /* Mark TYPE as a specialization. And as a result, we only
1056 have one level of template argument for the innermost
1058 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type
);
1059 DECL_SOURCE_LOCATION (TYPE_MAIN_DECL (type
)) = input_location
;
1060 CLASSTYPE_TI_ARGS (type
)
1061 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type
));
1064 else if (processing_specialization
)
1066 /* Someday C++0x may allow for enum template specialization. */
1067 if (cxx_dialect
> cxx98
&& TREE_CODE (type
) == ENUMERAL_TYPE
1068 && CLASS_TYPE_P (context
) && CLASSTYPE_USE_TEMPLATE (context
))
1069 pedwarn (input_location
, OPT_Wpedantic
, "template specialization "
1070 "of %qD not allowed by ISO C++", type
);
1073 error ("explicit specialization of non-template %qT", type
);
1074 return error_mark_node
;
1081 /* Returns nonzero if we can optimize the retrieval of specializations
1082 for TMPL, a TEMPLATE_DECL. In particular, for such a template, we
1083 do not use DECL_TEMPLATE_SPECIALIZATIONS at all. */
1086 optimize_specialization_lookup_p (tree tmpl
)
1088 return (DECL_FUNCTION_TEMPLATE_P (tmpl
)
1089 && DECL_CLASS_SCOPE_P (tmpl
)
1090 /* DECL_CLASS_SCOPE_P holds of T::f even if T is a template
1092 && CLASS_TYPE_P (DECL_CONTEXT (tmpl
))
1093 /* The optimized lookup depends on the fact that the
1094 template arguments for the member function template apply
1095 purely to the containing class, which is not true if the
1096 containing class is an explicit or partial
1098 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (tmpl
))
1099 && !DECL_MEMBER_TEMPLATE_P (tmpl
)
1100 && !DECL_CONV_FN_P (tmpl
)
1101 /* It is possible to have a template that is not a member
1102 template and is not a member of a template class:
1104 template <typename T>
1105 struct S { friend A::f(); };
1107 Here, the friend function is a template, but the context does
1108 not have template information. The optimized lookup relies
1109 on having ARGS be the template arguments for both the class
1110 and the function template. */
1111 && !DECL_FRIEND_P (DECL_TEMPLATE_RESULT (tmpl
)));
1114 /* Make sure ARGS doesn't use any inappropriate typedefs; we should have
1115 gone through coerce_template_parms by now. */
1118 verify_unstripped_args (tree args
)
1120 ++processing_template_decl
;
1121 if (!any_dependent_template_arguments_p (args
))
1123 tree inner
= INNERMOST_TEMPLATE_ARGS (args
);
1124 for (int i
= 0; i
< TREE_VEC_LENGTH (inner
); ++i
)
1126 tree arg
= TREE_VEC_ELT (inner
, i
);
1127 if (TREE_CODE (arg
) == TEMPLATE_DECL
)
1129 else if (TYPE_P (arg
))
1130 gcc_assert (strip_typedefs (arg
, NULL
) == arg
);
1131 else if (strip_typedefs (TREE_TYPE (arg
), NULL
) != TREE_TYPE (arg
))
1132 /* Allow typedefs on the type of a non-type argument, since a
1133 parameter can have them. */;
1135 gcc_assert (strip_typedefs_expr (arg
, NULL
) == arg
);
1138 --processing_template_decl
;
1141 /* Retrieve the specialization (in the sense of [temp.spec] - a
1142 specialization is either an instantiation or an explicit
1143 specialization) of TMPL for the given template ARGS. If there is
1144 no such specialization, return NULL_TREE. The ARGS are a vector of
1145 arguments, or a vector of vectors of arguments, in the case of
1146 templates with more than one level of parameters.
1148 If TMPL is a type template and CLASS_SPECIALIZATIONS_P is true,
1149 then we search for a partial specialization matching ARGS. This
1150 parameter is ignored if TMPL is not a class template.
1152 We can also look up a FIELD_DECL, if it is a lambda capture pack; the
1153 result is a NONTYPE_ARGUMENT_PACK. */
1156 retrieve_specialization (tree tmpl
, tree args
, hashval_t hash
)
1158 if (tmpl
== NULL_TREE
)
1161 if (args
== error_mark_node
)
1164 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
1165 || TREE_CODE (tmpl
) == FIELD_DECL
);
1167 /* There should be as many levels of arguments as there are
1168 levels of parameters. */
1169 gcc_assert (TMPL_ARGS_DEPTH (args
)
1170 == (TREE_CODE (tmpl
) == TEMPLATE_DECL
1171 ? TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
))
1172 : template_class_depth (DECL_CONTEXT (tmpl
))));
1175 verify_unstripped_args (args
);
1177 if (optimize_specialization_lookup_p (tmpl
))
1179 tree class_template
;
1180 tree class_specialization
;
1181 vec
<tree
, va_gc
> *methods
;
1185 /* The template arguments actually apply to the containing
1186 class. Find the class specialization with those
1188 class_template
= CLASSTYPE_TI_TEMPLATE (DECL_CONTEXT (tmpl
));
1189 class_specialization
1190 = retrieve_specialization (class_template
, args
, 0);
1191 if (!class_specialization
)
1193 /* Now, find the appropriate entry in the CLASSTYPE_METHOD_VEC
1194 for the specialization. */
1195 idx
= class_method_index_for_fn (class_specialization
, tmpl
);
1198 /* Iterate through the methods with the indicated name, looking
1199 for the one that has an instance of TMPL. */
1200 methods
= CLASSTYPE_METHOD_VEC (class_specialization
);
1201 for (fns
= (*methods
)[idx
]; fns
; fns
= OVL_NEXT (fns
))
1203 tree fn
= OVL_CURRENT (fns
);
1204 if (DECL_TEMPLATE_INFO (fn
) && DECL_TI_TEMPLATE (fn
) == tmpl
1205 /* using-declarations can add base methods to the method vec,
1206 and we don't want those here. */
1207 && DECL_CONTEXT (fn
) == class_specialization
)
1216 hash_table
<spec_hasher
> *specializations
;
1220 elt
.spec
= NULL_TREE
;
1222 if (DECL_CLASS_TEMPLATE_P (tmpl
))
1223 specializations
= type_specializations
;
1225 specializations
= decl_specializations
;
1228 hash
= spec_hasher::hash (&elt
);
1229 found
= specializations
->find_with_hash (&elt
, hash
);
1237 /* Like retrieve_specialization, but for local declarations. */
1240 retrieve_local_specialization (tree tmpl
)
1242 if (local_specializations
== NULL
)
1245 tree
*slot
= local_specializations
->get (tmpl
);
1246 return slot
? *slot
: NULL_TREE
;
1249 /* Returns nonzero iff DECL is a specialization of TMPL. */
1252 is_specialization_of (tree decl
, tree tmpl
)
1256 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1260 t
= DECL_TEMPLATE_INFO (t
) ? DECL_TI_TEMPLATE (t
) : NULL_TREE
)
1266 gcc_assert (TREE_CODE (decl
) == TYPE_DECL
);
1268 for (t
= TREE_TYPE (decl
);
1270 t
= CLASSTYPE_USE_TEMPLATE (t
)
1271 ? TREE_TYPE (CLASSTYPE_TI_TEMPLATE (t
)) : NULL_TREE
)
1272 if (same_type_ignoring_top_level_qualifiers_p (t
, TREE_TYPE (tmpl
)))
1279 /* Returns nonzero iff DECL is a specialization of friend declaration
1280 FRIEND_DECL according to [temp.friend]. */
1283 is_specialization_of_friend (tree decl
, tree friend_decl
)
1285 bool need_template
= true;
1288 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
1289 || TREE_CODE (decl
) == TYPE_DECL
);
1291 /* For [temp.friend/6] when FRIEND_DECL is an ordinary member function
1292 of a template class, we want to check if DECL is a specialization
1294 if (TREE_CODE (friend_decl
) == FUNCTION_DECL
1295 && DECL_TEMPLATE_INFO (friend_decl
)
1296 && !DECL_USE_TEMPLATE (friend_decl
))
1298 /* We want a TEMPLATE_DECL for `is_specialization_of'. */
1299 friend_decl
= DECL_TI_TEMPLATE (friend_decl
);
1300 need_template
= false;
1302 else if (TREE_CODE (friend_decl
) == TEMPLATE_DECL
1303 && !PRIMARY_TEMPLATE_P (friend_decl
))
1304 need_template
= false;
1306 /* There is nothing to do if this is not a template friend. */
1307 if (TREE_CODE (friend_decl
) != TEMPLATE_DECL
)
1310 if (is_specialization_of (decl
, friend_decl
))
1314 A member of a class template may be declared to be a friend of a
1315 non-template class. In this case, the corresponding member of
1316 every specialization of the class template is a friend of the
1317 class granting friendship.
1319 For example, given a template friend declaration
1321 template <class T> friend void A<T>::f();
1323 the member function below is considered a friend
1325 template <> struct A<int> {
1329 For this type of template friend, TEMPLATE_DEPTH below will be
1330 nonzero. To determine if DECL is a friend of FRIEND, we first
1331 check if the enclosing class is a specialization of another. */
1333 template_depth
= template_class_depth (CP_DECL_CONTEXT (friend_decl
));
1335 && DECL_CLASS_SCOPE_P (decl
)
1336 && is_specialization_of (TYPE_NAME (DECL_CONTEXT (decl
)),
1337 CLASSTYPE_TI_TEMPLATE (DECL_CONTEXT (friend_decl
))))
1339 /* Next, we check the members themselves. In order to handle
1340 a few tricky cases, such as when FRIEND_DECL's are
1342 template <class T> friend void A<T>::g(T t);
1343 template <class T> template <T t> friend void A<T>::h();
1347 void A<int>::g(int);
1348 template <int> void A<int>::h();
1350 we need to figure out ARGS, the template arguments from
1351 the context of DECL. This is required for template substitution
1352 of `T' in the function parameter of `g' and template parameter
1353 of `h' in the above examples. Here ARGS corresponds to `int'. */
1355 tree context
= DECL_CONTEXT (decl
);
1356 tree args
= NULL_TREE
;
1357 int current_depth
= 0;
1359 while (current_depth
< template_depth
)
1361 if (CLASSTYPE_TEMPLATE_INFO (context
))
1363 if (current_depth
== 0)
1364 args
= TYPE_TI_ARGS (context
);
1366 args
= add_to_template_args (TYPE_TI_ARGS (context
), args
);
1369 context
= TYPE_CONTEXT (context
);
1372 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1377 tree friend_args_type
;
1378 tree decl_args_type
;
1380 /* Make sure that both DECL and FRIEND_DECL are templates or
1382 is_template
= DECL_TEMPLATE_INFO (decl
)
1383 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl
));
1384 if (need_template
^ is_template
)
1386 else if (is_template
)
1388 /* If both are templates, check template parameter list. */
1390 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_decl
),
1392 if (!comp_template_parms
1393 (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (decl
)),
1397 decl_type
= TREE_TYPE (DECL_TI_TEMPLATE (decl
));
1400 decl_type
= TREE_TYPE (decl
);
1402 friend_type
= tsubst_function_type (TREE_TYPE (friend_decl
), args
,
1403 tf_none
, NULL_TREE
);
1404 if (friend_type
== error_mark_node
)
1407 /* Check if return types match. */
1408 if (!same_type_p (TREE_TYPE (decl_type
), TREE_TYPE (friend_type
)))
1411 /* Check if function parameter types match, ignoring the
1412 `this' parameter. */
1413 friend_args_type
= TYPE_ARG_TYPES (friend_type
);
1414 decl_args_type
= TYPE_ARG_TYPES (decl_type
);
1415 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (friend_decl
))
1416 friend_args_type
= TREE_CHAIN (friend_args_type
);
1417 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1418 decl_args_type
= TREE_CHAIN (decl_args_type
);
1420 return compparms (decl_args_type
, friend_args_type
);
1424 /* DECL is a TYPE_DECL */
1426 tree decl_type
= TREE_TYPE (decl
);
1428 /* Make sure that both DECL and FRIEND_DECL are templates or
1431 = CLASSTYPE_TEMPLATE_INFO (decl_type
)
1432 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (decl_type
));
1434 if (need_template
^ is_template
)
1436 else if (is_template
)
1439 /* If both are templates, check the name of the two
1440 TEMPLATE_DECL's first because is_friend didn't. */
1441 if (DECL_NAME (CLASSTYPE_TI_TEMPLATE (decl_type
))
1442 != DECL_NAME (friend_decl
))
1445 /* Now check template parameter list. */
1447 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_decl
),
1449 return comp_template_parms
1450 (DECL_TEMPLATE_PARMS (CLASSTYPE_TI_TEMPLATE (decl_type
)),
1454 return (DECL_NAME (decl
)
1455 == DECL_NAME (friend_decl
));
1461 /* Register the specialization SPEC as a specialization of TMPL with
1462 the indicated ARGS. IS_FRIEND indicates whether the specialization
1463 is actually just a friend declaration. Returns SPEC, or an
1464 equivalent prior declaration, if available.
1466 We also store instantiations of field packs in the hash table, even
1467 though they are not themselves templates, to make lookup easier. */
1470 register_specialization (tree spec
, tree tmpl
, tree args
, bool is_friend
,
1474 spec_entry
**slot
= NULL
;
1477 gcc_assert ((TREE_CODE (tmpl
) == TEMPLATE_DECL
&& DECL_P (spec
))
1478 || (TREE_CODE (tmpl
) == FIELD_DECL
1479 && TREE_CODE (spec
) == NONTYPE_ARGUMENT_PACK
));
1481 if (TREE_CODE (spec
) == FUNCTION_DECL
1482 && uses_template_parms (DECL_TI_ARGS (spec
)))
1483 /* This is the FUNCTION_DECL for a partial instantiation. Don't
1484 register it; we want the corresponding TEMPLATE_DECL instead.
1485 We use `uses_template_parms (DECL_TI_ARGS (spec))' rather than
1486 the more obvious `uses_template_parms (spec)' to avoid problems
1487 with default function arguments. In particular, given
1488 something like this:
1490 template <class T> void f(T t1, T t = T())
1492 the default argument expression is not substituted for in an
1493 instantiation unless and until it is actually needed. */
1496 if (optimize_specialization_lookup_p (tmpl
))
1497 /* We don't put these specializations in the hash table, but we might
1498 want to give an error about a mismatch. */
1499 fn
= retrieve_specialization (tmpl
, args
, 0);
1507 hash
= spec_hasher::hash (&elt
);
1510 decl_specializations
->find_slot_with_hash (&elt
, hash
, INSERT
);
1512 fn
= ((spec_entry
*) *slot
)->spec
;
1517 /* We can sometimes try to re-register a specialization that we've
1518 already got. In particular, regenerate_decl_from_template calls
1519 duplicate_decls which will update the specialization list. But,
1520 we'll still get called again here anyhow. It's more convenient
1521 to simply allow this than to try to prevent it. */
1524 else if (fn
&& DECL_TEMPLATE_SPECIALIZATION (spec
))
1526 if (DECL_TEMPLATE_INSTANTIATION (fn
))
1528 if (DECL_ODR_USED (fn
)
1529 || DECL_EXPLICIT_INSTANTIATION (fn
))
1531 error ("specialization of %qD after instantiation",
1533 return error_mark_node
;
1538 /* This situation should occur only if the first
1539 specialization is an implicit instantiation, the
1540 second is an explicit specialization, and the
1541 implicit instantiation has not yet been used. That
1542 situation can occur if we have implicitly
1543 instantiated a member function and then specialized
1546 We can also wind up here if a friend declaration that
1547 looked like an instantiation turns out to be a
1550 template <class T> void foo(T);
1551 class S { friend void foo<>(int) };
1552 template <> void foo(int);
1554 We transform the existing DECL in place so that any
1555 pointers to it become pointers to the updated
1558 If there was a definition for the template, but not
1559 for the specialization, we want this to look as if
1560 there were no definition, and vice versa. */
1561 DECL_INITIAL (fn
) = NULL_TREE
;
1562 duplicate_decls (spec
, fn
, is_friend
);
1563 /* The call to duplicate_decls will have applied
1566 An explicit specialization of a function template
1567 is inline only if it is explicitly declared to be,
1568 and independently of whether its function template
1571 to the primary function; now copy the inline bits to
1572 the various clones. */
1573 FOR_EACH_CLONE (clone
, fn
)
1575 DECL_DECLARED_INLINE_P (clone
)
1576 = DECL_DECLARED_INLINE_P (fn
);
1577 DECL_SOURCE_LOCATION (clone
)
1578 = DECL_SOURCE_LOCATION (fn
);
1579 DECL_DELETED_FN (clone
)
1580 = DECL_DELETED_FN (fn
);
1582 check_specialization_namespace (tmpl
);
1587 else if (DECL_TEMPLATE_SPECIALIZATION (fn
))
1589 if (!duplicate_decls (spec
, fn
, is_friend
) && DECL_INITIAL (spec
))
1590 /* Dup decl failed, but this is a new definition. Set the
1591 line number so any errors match this new
1593 DECL_SOURCE_LOCATION (fn
) = DECL_SOURCE_LOCATION (spec
);
1599 return duplicate_decls (spec
, fn
, is_friend
);
1601 /* A specialization must be declared in the same namespace as the
1602 template it is specializing. */
1603 if (DECL_P (spec
) && DECL_TEMPLATE_SPECIALIZATION (spec
)
1604 && !check_specialization_namespace (tmpl
))
1605 DECL_CONTEXT (spec
) = DECL_CONTEXT (tmpl
);
1607 if (slot
!= NULL
/* !optimize_specialization_lookup_p (tmpl) */)
1609 spec_entry
*entry
= ggc_alloc
<spec_entry
> ();
1610 gcc_assert (tmpl
&& args
&& spec
);
1613 if ((TREE_CODE (spec
) == FUNCTION_DECL
&& DECL_NAMESPACE_SCOPE_P (spec
)
1614 && PRIMARY_TEMPLATE_P (tmpl
)
1615 && DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (tmpl
)) == NULL_TREE
)
1616 || variable_template_p (tmpl
))
1617 /* If TMPL is a forward declaration of a template function, keep a list
1618 of all specializations in case we need to reassign them to a friend
1619 template later in tsubst_friend_function.
1621 Also keep a list of all variable template instantiations so that
1622 process_partial_specialization can check whether a later partial
1623 specialization would have used it. */
1624 DECL_TEMPLATE_INSTANTIATIONS (tmpl
)
1625 = tree_cons (args
, spec
, DECL_TEMPLATE_INSTANTIATIONS (tmpl
));
1631 /* Returns true iff two spec_entry nodes are equivalent. */
1633 int comparing_specializations
;
1636 spec_hasher::equal (spec_entry
*e1
, spec_entry
*e2
)
1640 ++comparing_specializations
;
1641 equal
= (e1
->tmpl
== e2
->tmpl
1642 && comp_template_args (e1
->args
, e2
->args
));
1643 if (equal
&& flag_concepts
1644 /* tmpl could be a FIELD_DECL for a capture pack. */
1645 && TREE_CODE (e1
->tmpl
) == TEMPLATE_DECL
1646 && VAR_P (DECL_TEMPLATE_RESULT (e1
->tmpl
))
1647 && uses_template_parms (e1
->args
))
1649 /* Partial specializations of a variable template can be distinguished by
1651 tree c1
= e1
->spec
? get_constraints (e1
->spec
) : NULL_TREE
;
1652 tree c2
= e2
->spec
? get_constraints (e2
->spec
) : NULL_TREE
;
1653 equal
= equivalent_constraints (c1
, c2
);
1655 --comparing_specializations
;
1660 /* Returns a hash for a template TMPL and template arguments ARGS. */
1663 hash_tmpl_and_args (tree tmpl
, tree args
)
1665 hashval_t val
= iterative_hash_object (DECL_UID (tmpl
), 0);
1666 return iterative_hash_template_arg (args
, val
);
1669 /* Returns a hash for a spec_entry node based on the TMPL and ARGS members,
1673 spec_hasher::hash (spec_entry
*e
)
1675 return hash_tmpl_and_args (e
->tmpl
, e
->args
);
1678 /* Recursively calculate a hash value for a template argument ARG, for use
1679 in the hash tables of template specializations. */
1682 iterative_hash_template_arg (tree arg
, hashval_t val
)
1684 unsigned HOST_WIDE_INT i
;
1685 enum tree_code code
;
1688 if (arg
== NULL_TREE
)
1689 return iterative_hash_object (arg
, val
);
1694 if (TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
1695 /* We can get one of these when re-hashing a previous entry in the middle
1696 of substituting into a pack expansion. Just look through it. */
1697 arg
= ARGUMENT_PACK_SELECT_FROM_PACK (arg
);
1699 code
= TREE_CODE (arg
);
1700 tclass
= TREE_CODE_CLASS (code
);
1702 val
= iterative_hash_object (code
, val
);
1709 case IDENTIFIER_NODE
:
1710 return iterative_hash_object (IDENTIFIER_HASH_VALUE (arg
), val
);
1714 int i
, len
= TREE_VEC_LENGTH (arg
);
1715 for (i
= 0; i
< len
; ++i
)
1716 val
= iterative_hash_template_arg (TREE_VEC_ELT (arg
, i
), val
);
1720 case TYPE_PACK_EXPANSION
:
1721 case EXPR_PACK_EXPANSION
:
1722 val
= iterative_hash_template_arg (PACK_EXPANSION_PATTERN (arg
), val
);
1723 return iterative_hash_template_arg (PACK_EXPANSION_EXTRA_ARGS (arg
), val
);
1725 case TYPE_ARGUMENT_PACK
:
1726 case NONTYPE_ARGUMENT_PACK
:
1727 return iterative_hash_template_arg (ARGUMENT_PACK_ARGS (arg
), val
);
1730 for (; arg
; arg
= TREE_CHAIN (arg
))
1731 val
= iterative_hash_template_arg (TREE_VALUE (arg
), val
);
1735 for (; arg
; arg
= OVL_NEXT (arg
))
1736 val
= iterative_hash_template_arg (OVL_CURRENT (arg
), val
);
1742 iterative_hash_template_arg (TREE_TYPE (arg
), val
);
1743 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (arg
), i
, field
, value
)
1745 val
= iterative_hash_template_arg (field
, val
);
1746 val
= iterative_hash_template_arg (value
, val
);
1752 if (!DECL_ARTIFICIAL (arg
))
1754 val
= iterative_hash_object (DECL_PARM_INDEX (arg
), val
);
1755 val
= iterative_hash_object (DECL_PARM_LEVEL (arg
), val
);
1757 return iterative_hash_template_arg (TREE_TYPE (arg
), val
);
1760 return iterative_hash_template_arg (TARGET_EXPR_INITIAL (arg
), val
);
1763 val
= iterative_hash_template_arg (PTRMEM_CST_CLASS (arg
), val
);
1764 return iterative_hash_template_arg (PTRMEM_CST_MEMBER (arg
), val
);
1766 case TEMPLATE_PARM_INDEX
:
1767 val
= iterative_hash_template_arg
1768 (TREE_TYPE (TEMPLATE_PARM_DECL (arg
)), val
);
1769 val
= iterative_hash_object (TEMPLATE_PARM_LEVEL (arg
), val
);
1770 return iterative_hash_object (TEMPLATE_PARM_IDX (arg
), val
);
1773 val
= iterative_hash_object (TRAIT_EXPR_KIND (arg
), val
);
1774 val
= iterative_hash_template_arg (TRAIT_EXPR_TYPE1 (arg
), val
);
1775 return iterative_hash_template_arg (TRAIT_EXPR_TYPE2 (arg
), val
);
1778 val
= iterative_hash_template_arg (BINFO_TYPE (BASELINK_BINFO (arg
)),
1780 return iterative_hash_template_arg (DECL_NAME (get_first_fn (arg
)),
1784 val
= iterative_hash_template_arg (TREE_OPERAND (arg
, 0), val
);
1785 code
= TREE_CODE (TREE_OPERAND (arg
, 1));
1786 val
= iterative_hash_object (code
, val
);
1787 return iterative_hash_template_arg (TREE_OPERAND (arg
, 2), val
);
1790 /* A lambda can't appear in a template arg, but don't crash on
1792 gcc_assert (seen_error ());
1796 case IMPLICIT_CONV_EXPR
:
1797 case STATIC_CAST_EXPR
:
1798 case REINTERPRET_CAST_EXPR
:
1799 case CONST_CAST_EXPR
:
1800 case DYNAMIC_CAST_EXPR
:
1802 val
= iterative_hash_template_arg (TREE_TYPE (arg
), val
);
1803 /* Now hash operands as usual. */
1813 if (alias_template_specialization_p (arg
))
1815 // We want an alias specialization that survived strip_typedefs
1816 // to hash differently from its TYPE_CANONICAL, to avoid hash
1817 // collisions that compare as different in template_args_equal.
1818 // These could be dependent specializations that strip_typedefs
1819 // left alone, or untouched specializations because
1820 // coerce_template_parms returns the unconverted template
1821 // arguments if it sees incomplete argument packs.
1822 tree ti
= TYPE_TEMPLATE_INFO (arg
);
1823 return hash_tmpl_and_args (TI_TEMPLATE (ti
), TI_ARGS (ti
));
1825 if (TYPE_CANONICAL (arg
))
1826 return iterative_hash_object (TYPE_HASH (TYPE_CANONICAL (arg
)),
1828 else if (TREE_CODE (arg
) == DECLTYPE_TYPE
)
1829 return iterative_hash_template_arg (DECLTYPE_TYPE_EXPR (arg
), val
);
1830 /* Otherwise just compare the types during lookup. */
1833 case tcc_declaration
:
1835 return iterative_hash_expr (arg
, val
);
1838 gcc_assert (IS_EXPR_CODE_CLASS (tclass
));
1840 unsigned n
= cp_tree_operand_length (arg
);
1841 for (i
= 0; i
< n
; ++i
)
1842 val
= iterative_hash_template_arg (TREE_OPERAND (arg
, i
), val
);
1850 /* Unregister the specialization SPEC as a specialization of TMPL.
1851 Replace it with NEW_SPEC, if NEW_SPEC is non-NULL. Returns true
1852 if the SPEC was listed as a specialization of TMPL.
1854 Note that SPEC has been ggc_freed, so we can't look inside it. */
1857 reregister_specialization (tree spec
, tree tinfo
, tree new_spec
)
1862 elt
.tmpl
= most_general_template (TI_TEMPLATE (tinfo
));
1863 elt
.args
= TI_ARGS (tinfo
);
1864 elt
.spec
= NULL_TREE
;
1866 entry
= decl_specializations
->find (&elt
);
1869 gcc_assert (entry
->spec
== spec
|| entry
->spec
== new_spec
);
1870 gcc_assert (new_spec
!= NULL_TREE
);
1871 entry
->spec
= new_spec
;
1878 /* Like register_specialization, but for local declarations. We are
1879 registering SPEC, an instantiation of TMPL. */
1882 register_local_specialization (tree spec
, tree tmpl
)
1884 local_specializations
->put (tmpl
, spec
);
1887 /* TYPE is a class type. Returns true if TYPE is an explicitly
1888 specialized class. */
1891 explicit_class_specialization_p (tree type
)
1893 if (!CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
1895 return !uses_template_parms (CLASSTYPE_TI_ARGS (type
));
1898 /* Print the list of functions at FNS, going through all the overloads
1899 for each element of the list. Alternatively, FNS can not be a
1900 TREE_LIST, in which case it will be printed together with all the
1903 MORE and *STR should respectively be FALSE and NULL when the function
1904 is called from the outside. They are used internally on recursive
1905 calls. print_candidates manages the two parameters and leaves NULL
1906 in *STR when it ends. */
1909 print_candidates_1 (tree fns
, bool more
, const char **str
)
1912 char *spaces
= NULL
;
1914 for (fn
= fns
; fn
; fn
= OVL_NEXT (fn
))
1915 if (TREE_CODE (fn
) == TREE_LIST
)
1917 for (fn2
= fn
; fn2
!= NULL_TREE
; fn2
= TREE_CHAIN (fn2
))
1918 print_candidates_1 (TREE_VALUE (fn2
),
1919 TREE_CHAIN (fn2
) || more
, str
);
1923 tree cand
= OVL_CURRENT (fn
);
1926 /* Pick the prefix string. */
1927 if (!more
&& !OVL_NEXT (fns
))
1929 inform (DECL_SOURCE_LOCATION (cand
),
1930 "candidate is: %#D", cand
);
1934 *str
= _("candidates are:");
1935 spaces
= get_spaces (*str
);
1937 inform (DECL_SOURCE_LOCATION (cand
), "%s %#D", *str
, cand
);
1938 *str
= spaces
? spaces
: *str
;
1948 /* Print the list of candidate FNS in an error message. FNS can also
1949 be a TREE_LIST of non-functions in the case of an ambiguous lookup. */
1952 print_candidates (tree fns
)
1954 const char *str
= NULL
;
1955 print_candidates_1 (fns
, false, &str
);
1956 gcc_assert (str
== NULL
);
1959 /* Get a (possibly) constrained template declaration for the
1960 purpose of ordering candidates. */
1962 get_template_for_ordering (tree list
)
1964 gcc_assert (TREE_CODE (list
) == TREE_LIST
);
1965 tree f
= TREE_VALUE (list
);
1966 if (tree ti
= DECL_TEMPLATE_INFO (f
))
1967 return TI_TEMPLATE (ti
);
1971 /* Among candidates having the same signature, return the
1972 most constrained or NULL_TREE if there is no best candidate.
1973 If the signatures of candidates vary (e.g., template
1974 specialization vs. member function), then there can be no
1977 Note that we don't compare constraints on the functions
1978 themselves, but rather those of their templates. */
1980 most_constrained_function (tree candidates
)
1982 // Try to find the best candidate in a first pass.
1983 tree champ
= candidates
;
1984 for (tree c
= TREE_CHAIN (champ
); c
; c
= TREE_CHAIN (c
))
1986 int winner
= more_constrained (get_template_for_ordering (champ
),
1987 get_template_for_ordering (c
));
1989 champ
= c
; // The candidate is more constrained
1990 else if (winner
== 0)
1991 return NULL_TREE
; // Neither is more constrained
1994 // Verify that the champ is better than previous candidates.
1995 for (tree c
= candidates
; c
!= champ
; c
= TREE_CHAIN (c
)) {
1996 if (!more_constrained (get_template_for_ordering (champ
),
1997 get_template_for_ordering (c
)))
2005 /* Returns the template (one of the functions given by TEMPLATE_ID)
2006 which can be specialized to match the indicated DECL with the
2007 explicit template args given in TEMPLATE_ID. The DECL may be
2008 NULL_TREE if none is available. In that case, the functions in
2009 TEMPLATE_ID are non-members.
2011 If NEED_MEMBER_TEMPLATE is nonzero the function is known to be a
2012 specialization of a member template.
2014 The TEMPLATE_COUNT is the number of references to qualifying
2015 template classes that appeared in the name of the function. See
2016 check_explicit_specialization for a more accurate description.
2018 TSK indicates what kind of template declaration (if any) is being
2019 declared. TSK_TEMPLATE indicates that the declaration given by
2020 DECL, though a FUNCTION_DECL, has template parameters, and is
2021 therefore a template function.
2023 The template args (those explicitly specified and those deduced)
2024 are output in a newly created vector *TARGS_OUT.
2026 If it is impossible to determine the result, an error message is
2027 issued. The error_mark_node is returned to indicate failure. */
2030 determine_specialization (tree template_id
,
2033 int need_member_template
,
2039 tree explicit_targs
;
2040 tree candidates
= NULL_TREE
;
2042 /* A TREE_LIST of templates of which DECL may be a specialization.
2043 The TREE_VALUE of each node is a TEMPLATE_DECL. The
2044 corresponding TREE_PURPOSE is the set of template arguments that,
2045 when used to instantiate the template, would produce a function
2046 with the signature of DECL. */
2047 tree templates
= NULL_TREE
;
2049 cp_binding_level
*b
;
2051 *targs_out
= NULL_TREE
;
2053 if (template_id
== error_mark_node
|| decl
== error_mark_node
)
2054 return error_mark_node
;
2056 /* We shouldn't be specializing a member template of an
2057 unspecialized class template; we already gave an error in
2058 check_specialization_scope, now avoid crashing. */
2059 if (template_count
&& DECL_CLASS_SCOPE_P (decl
)
2060 && template_class_depth (DECL_CONTEXT (decl
)) > 0)
2062 gcc_assert (errorcount
);
2063 return error_mark_node
;
2066 fns
= TREE_OPERAND (template_id
, 0);
2067 explicit_targs
= TREE_OPERAND (template_id
, 1);
2069 if (fns
== error_mark_node
)
2070 return error_mark_node
;
2072 /* Check for baselinks. */
2073 if (BASELINK_P (fns
))
2074 fns
= BASELINK_FUNCTIONS (fns
);
2076 if (TREE_CODE (decl
) == FUNCTION_DECL
&& !is_overloaded_fn (fns
))
2078 error ("%qD is not a function template", fns
);
2079 return error_mark_node
;
2081 else if (VAR_P (decl
) && !variable_template_p (fns
))
2083 error ("%qD is not a variable template", fns
);
2084 return error_mark_node
;
2087 /* Count the number of template headers specified for this
2090 for (b
= current_binding_level
;
2091 b
->kind
== sk_template_parms
;
2095 tree orig_fns
= fns
;
2097 if (variable_template_p (fns
))
2099 tree parms
= INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (fns
));
2100 targs
= coerce_template_parms (parms
, explicit_targs
, fns
,
2101 tf_warning_or_error
,
2102 /*req_all*/true, /*use_defarg*/true);
2103 if (targs
!= error_mark_node
)
2104 templates
= tree_cons (targs
, fns
, templates
);
2106 else for (; fns
; fns
= OVL_NEXT (fns
))
2108 tree fn
= OVL_CURRENT (fns
);
2110 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
2112 tree decl_arg_types
;
2116 /* In case of explicit specialization, we need to check if
2117 the number of template headers appearing in the specialization
2118 is correct. This is usually done in check_explicit_specialization,
2119 but the check done there cannot be exhaustive when specializing
2120 member functions. Consider the following code:
2122 template <> void A<int>::f(int);
2123 template <> template <> void A<int>::f(int);
2125 Assuming that A<int> is not itself an explicit specialization
2126 already, the first line specializes "f" which is a non-template
2127 member function, whilst the second line specializes "f" which
2128 is a template member function. So both lines are syntactically
2129 correct, and check_explicit_specialization does not reject
2132 Here, we can do better, as we are matching the specialization
2133 against the declarations. We count the number of template
2134 headers, and we check if they match TEMPLATE_COUNT + 1
2135 (TEMPLATE_COUNT is the number of qualifying template classes,
2136 plus there must be another header for the member template
2139 Notice that if header_count is zero, this is not a
2140 specialization but rather a template instantiation, so there
2141 is no check we can perform here. */
2142 if (header_count
&& header_count
!= template_count
+ 1)
2145 /* Check that the number of template arguments at the
2146 innermost level for DECL is the same as for FN. */
2147 if (current_binding_level
->kind
== sk_template_parms
2148 && !current_binding_level
->explicit_spec_p
2149 && (TREE_VEC_LENGTH (DECL_INNERMOST_TEMPLATE_PARMS (fn
))
2150 != TREE_VEC_LENGTH (INNERMOST_TEMPLATE_PARMS
2151 (current_template_parms
))))
2154 /* DECL might be a specialization of FN. */
2155 decl_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
2156 fn_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
2158 /* For a non-static member function, we need to make sure
2159 that the const qualification is the same. Since
2160 get_bindings does not try to merge the "this" parameter,
2161 we must do the comparison explicitly. */
2162 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
2163 && !same_type_p (TREE_VALUE (fn_arg_types
),
2164 TREE_VALUE (decl_arg_types
)))
2167 /* Skip the "this" parameter and, for constructors of
2168 classes with virtual bases, the VTT parameter. A
2169 full specialization of a constructor will have a VTT
2170 parameter, but a template never will. */
2172 = skip_artificial_parms_for (decl
, decl_arg_types
);
2174 = skip_artificial_parms_for (fn
, fn_arg_types
);
2176 /* Function templates cannot be specializations; there are
2177 no partial specializations of functions. Therefore, if
2178 the type of DECL does not match FN, there is no
2181 Note that it should never be the case that we have both
2182 candidates added here, and for regular member functions
2184 if (tsk
== tsk_template
)
2186 if (compparms (fn_arg_types
, decl_arg_types
))
2187 candidates
= tree_cons (NULL_TREE
, fn
, candidates
);
2191 /* See whether this function might be a specialization of this
2192 template. Suppress access control because we might be trying
2193 to make this specialization a friend, and we have already done
2194 access control for the declaration of the specialization. */
2195 push_deferring_access_checks (dk_no_check
);
2196 targs
= get_bindings (fn
, decl
, explicit_targs
, /*check_ret=*/true);
2197 pop_deferring_access_checks ();
2200 /* We cannot deduce template arguments that when used to
2201 specialize TMPL will produce DECL. */
2204 /* Remove, from the set of candidates, all those functions
2205 whose constraints are not satisfied. */
2206 if (flag_concepts
&& !constraints_satisfied_p (fn
, targs
))
2209 // Then, try to form the new function type.
2210 insttype
= tsubst (TREE_TYPE (fn
), targs
, tf_none
, NULL_TREE
);
2211 if (insttype
== error_mark_node
)
2214 = skip_artificial_parms_for (fn
, TYPE_ARG_TYPES (insttype
));
2215 if (!compparms (fn_arg_types
, decl_arg_types
))
2218 /* Save this template, and the arguments deduced. */
2219 templates
= tree_cons (targs
, fn
, templates
);
2221 else if (need_member_template
)
2222 /* FN is an ordinary member function, and we need a
2223 specialization of a member template. */
2225 else if (TREE_CODE (fn
) != FUNCTION_DECL
)
2226 /* We can get IDENTIFIER_NODEs here in certain erroneous
2229 else if (!DECL_FUNCTION_MEMBER_P (fn
))
2230 /* This is just an ordinary non-member function. Nothing can
2231 be a specialization of that. */
2233 else if (DECL_ARTIFICIAL (fn
))
2234 /* Cannot specialize functions that are created implicitly. */
2238 tree decl_arg_types
;
2240 /* This is an ordinary member function. However, since
2241 we're here, we can assume its enclosing class is a
2242 template class. For example,
2244 template <typename T> struct S { void f(); };
2245 template <> void S<int>::f() {}
2247 Here, S<int>::f is a non-template, but S<int> is a
2248 template class. If FN has the same type as DECL, we
2249 might be in business. */
2251 if (!DECL_TEMPLATE_INFO (fn
))
2252 /* Its enclosing class is an explicit specialization
2253 of a template class. This is not a candidate. */
2256 if (!same_type_p (TREE_TYPE (TREE_TYPE (decl
)),
2257 TREE_TYPE (TREE_TYPE (fn
))))
2258 /* The return types differ. */
2261 /* Adjust the type of DECL in case FN is a static member. */
2262 decl_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
2263 if (DECL_STATIC_FUNCTION_P (fn
)
2264 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
2265 decl_arg_types
= TREE_CHAIN (decl_arg_types
);
2267 if (!compparms (TYPE_ARG_TYPES (TREE_TYPE (fn
)),
2271 // If the deduced arguments do not satisfy the constraints,
2272 // this is not a candidate.
2273 if (flag_concepts
&& !constraints_satisfied_p (fn
))
2276 // Add the candidate.
2277 candidates
= tree_cons (NULL_TREE
, fn
, candidates
);
2281 if (templates
&& TREE_CHAIN (templates
))
2287 It is possible for a specialization with a given function
2288 signature to be instantiated from more than one function
2289 template. In such cases, explicit specification of the
2290 template arguments must be used to uniquely identify the
2291 function template specialization being specialized.
2293 Note that here, there's no suggestion that we're supposed to
2294 determine which of the candidate templates is most
2295 specialized. However, we, also have:
2299 Partial ordering of overloaded function template
2300 declarations is used in the following contexts to select
2301 the function template to which a function template
2302 specialization refers:
2304 -- when an explicit specialization refers to a function
2307 So, we do use the partial ordering rules, at least for now.
2308 This extension can only serve to make invalid programs valid,
2309 so it's safe. And, there is strong anecdotal evidence that
2310 the committee intended the partial ordering rules to apply;
2311 the EDG front end has that behavior, and John Spicer claims
2312 that the committee simply forgot to delete the wording in
2313 [temp.expl.spec]. */
2314 tree tmpl
= most_specialized_instantiation (templates
);
2315 if (tmpl
!= error_mark_node
)
2318 TREE_CHAIN (templates
) = NULL_TREE
;
2322 // Concepts allows multiple declarations of member functions
2323 // with the same signature. Like above, we need to rely on
2324 // on the partial ordering of those candidates to determine which
2326 if (flag_concepts
&& candidates
&& TREE_CHAIN (candidates
))
2328 if (tree cand
= most_constrained_function (candidates
))
2331 TREE_CHAIN (cand
) = NULL_TREE
;
2335 if (templates
== NULL_TREE
&& candidates
== NULL_TREE
)
2337 error ("template-id %qD for %q+D does not match any template "
2338 "declaration", template_id
, decl
);
2339 if (header_count
&& header_count
!= template_count
+ 1)
2340 inform (input_location
, "saw %d %<template<>%>, need %d for "
2341 "specializing a member function template",
2342 header_count
, template_count
+ 1);
2344 print_candidates (orig_fns
);
2345 return error_mark_node
;
2347 else if ((templates
&& TREE_CHAIN (templates
))
2348 || (candidates
&& TREE_CHAIN (candidates
))
2349 || (templates
&& candidates
))
2351 error ("ambiguous template specialization %qD for %q+D",
2353 candidates
= chainon (candidates
, templates
);
2354 print_candidates (candidates
);
2355 return error_mark_node
;
2358 /* We have one, and exactly one, match. */
2361 tree fn
= TREE_VALUE (candidates
);
2362 *targs_out
= copy_node (DECL_TI_ARGS (fn
));
2364 // Propagate the candidate's constraints to the declaration.
2365 set_constraints (decl
, get_constraints (fn
));
2367 /* DECL is a re-declaration or partial instantiation of a template
2369 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
2371 /* It was a specialization of an ordinary member function in a
2373 return DECL_TI_TEMPLATE (fn
);
2376 /* It was a specialization of a template. */
2377 targs
= DECL_TI_ARGS (DECL_TEMPLATE_RESULT (TREE_VALUE (templates
)));
2378 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (targs
))
2380 *targs_out
= copy_node (targs
);
2381 SET_TMPL_ARGS_LEVEL (*targs_out
,
2382 TMPL_ARGS_DEPTH (*targs_out
),
2383 TREE_PURPOSE (templates
));
2386 *targs_out
= TREE_PURPOSE (templates
);
2387 return TREE_VALUE (templates
);
2390 /* Returns a chain of parameter types, exactly like the SPEC_TYPES,
2391 but with the default argument values filled in from those in the
2395 copy_default_args_to_explicit_spec_1 (tree spec_types
,
2398 tree new_spec_types
;
2403 if (spec_types
== void_list_node
)
2404 return void_list_node
;
2406 /* Substitute into the rest of the list. */
2408 copy_default_args_to_explicit_spec_1 (TREE_CHAIN (spec_types
),
2409 TREE_CHAIN (tmpl_types
));
2411 /* Add the default argument for this parameter. */
2412 return hash_tree_cons (TREE_PURPOSE (tmpl_types
),
2413 TREE_VALUE (spec_types
),
2417 /* DECL is an explicit specialization. Replicate default arguments
2418 from the template it specializes. (That way, code like:
2420 template <class T> void f(T = 3);
2421 template <> void f(double);
2424 works, as required.) An alternative approach would be to look up
2425 the correct default arguments at the call-site, but this approach
2426 is consistent with how implicit instantiations are handled. */
2429 copy_default_args_to_explicit_spec (tree decl
)
2434 tree new_spec_types
;
2438 tree object_type
= NULL_TREE
;
2439 tree in_charge
= NULL_TREE
;
2440 tree vtt
= NULL_TREE
;
2442 /* See if there's anything we need to do. */
2443 tmpl
= DECL_TI_TEMPLATE (decl
);
2444 tmpl_types
= TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (tmpl
)));
2445 for (t
= tmpl_types
; t
; t
= TREE_CHAIN (t
))
2446 if (TREE_PURPOSE (t
))
2451 old_type
= TREE_TYPE (decl
);
2452 spec_types
= TYPE_ARG_TYPES (old_type
);
2454 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
2456 /* Remove the this pointer, but remember the object's type for
2458 object_type
= TREE_TYPE (TREE_VALUE (spec_types
));
2459 spec_types
= TREE_CHAIN (spec_types
);
2460 tmpl_types
= TREE_CHAIN (tmpl_types
);
2462 if (DECL_HAS_IN_CHARGE_PARM_P (decl
))
2464 /* DECL may contain more parameters than TMPL due to the extra
2465 in-charge parameter in constructors and destructors. */
2466 in_charge
= spec_types
;
2467 spec_types
= TREE_CHAIN (spec_types
);
2469 if (DECL_HAS_VTT_PARM_P (decl
))
2472 spec_types
= TREE_CHAIN (spec_types
);
2476 /* Compute the merged default arguments. */
2478 copy_default_args_to_explicit_spec_1 (spec_types
, tmpl_types
);
2480 /* Compute the new FUNCTION_TYPE. */
2484 new_spec_types
= hash_tree_cons (TREE_PURPOSE (vtt
),
2489 /* Put the in-charge parameter back. */
2490 new_spec_types
= hash_tree_cons (TREE_PURPOSE (in_charge
),
2491 TREE_VALUE (in_charge
),
2494 new_type
= build_method_type_directly (object_type
,
2495 TREE_TYPE (old_type
),
2499 new_type
= build_function_type (TREE_TYPE (old_type
),
2501 new_type
= cp_build_type_attribute_variant (new_type
,
2502 TYPE_ATTRIBUTES (old_type
));
2503 new_type
= build_exception_variant (new_type
,
2504 TYPE_RAISES_EXCEPTIONS (old_type
));
2506 if (TYPE_HAS_LATE_RETURN_TYPE (old_type
))
2507 TYPE_HAS_LATE_RETURN_TYPE (new_type
) = 1;
2509 TREE_TYPE (decl
) = new_type
;
2512 /* Return the number of template headers we expect to see for a definition
2513 or specialization of CTYPE or one of its non-template members. */
2516 num_template_headers_for_class (tree ctype
)
2518 int num_templates
= 0;
2520 while (ctype
&& CLASS_TYPE_P (ctype
))
2522 /* You're supposed to have one `template <...>' for every
2523 template class, but you don't need one for a full
2524 specialization. For example:
2526 template <class T> struct S{};
2527 template <> struct S<int> { void f(); };
2528 void S<int>::f () {}
2530 is correct; there shouldn't be a `template <>' for the
2531 definition of `S<int>::f'. */
2532 if (!CLASSTYPE_TEMPLATE_INFO (ctype
))
2533 /* If CTYPE does not have template information of any
2534 kind, then it is not a template, nor is it nested
2535 within a template. */
2537 if (explicit_class_specialization_p (ctype
))
2539 if (PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (ctype
)))
2542 ctype
= TYPE_CONTEXT (ctype
);
2545 return num_templates
;
2548 /* Do a simple sanity check on the template headers that precede the
2549 variable declaration DECL. */
2552 check_template_variable (tree decl
)
2554 tree ctx
= CP_DECL_CONTEXT (decl
);
2555 int wanted
= num_template_headers_for_class (ctx
);
2556 if (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
)
2557 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl
)))
2559 if (cxx_dialect
< cxx14
)
2560 pedwarn (DECL_SOURCE_LOCATION (decl
), 0,
2561 "variable templates only available with "
2562 "-std=c++14 or -std=gnu++14");
2564 // Namespace-scope variable templates should have a template header.
2567 if (template_header_count
> wanted
)
2569 bool warned
= pedwarn (DECL_SOURCE_LOCATION (decl
), 0,
2570 "too many template headers for %D (should be %d)",
2572 if (warned
&& CLASS_TYPE_P (ctx
)
2573 && CLASSTYPE_TEMPLATE_SPECIALIZATION (ctx
))
2574 inform (DECL_SOURCE_LOCATION (decl
),
2575 "members of an explicitly specialized class are defined "
2576 "without a template header");
2580 /* Check to see if the function just declared, as indicated in
2581 DECLARATOR, and in DECL, is a specialization of a function
2582 template. We may also discover that the declaration is an explicit
2583 instantiation at this point.
2585 Returns DECL, or an equivalent declaration that should be used
2586 instead if all goes well. Issues an error message if something is
2587 amiss. Returns error_mark_node if the error is not easily
2590 FLAGS is a bitmask consisting of the following flags:
2592 2: The function has a definition.
2593 4: The function is a friend.
2595 The TEMPLATE_COUNT is the number of references to qualifying
2596 template classes that appeared in the name of the function. For
2599 template <class T> struct S { void f(); };
2602 the TEMPLATE_COUNT would be 1. However, explicitly specialized
2603 classes are not counted in the TEMPLATE_COUNT, so that in
2605 template <class T> struct S {};
2606 template <> struct S<int> { void f(); }
2607 template <> void S<int>::f();
2609 the TEMPLATE_COUNT would be 0. (Note that this declaration is
2610 invalid; there should be no template <>.)
2612 If the function is a specialization, it is marked as such via
2613 DECL_TEMPLATE_SPECIALIZATION. Furthermore, its DECL_TEMPLATE_INFO
2614 is set up correctly, and it is added to the list of specializations
2615 for that template. */
2618 check_explicit_specialization (tree declarator
,
2623 int have_def
= flags
& 2;
2624 int is_friend
= flags
& 4;
2625 bool is_concept
= flags
& 8;
2626 int specialization
= 0;
2627 int explicit_instantiation
= 0;
2628 int member_specialization
= 0;
2629 tree ctype
= DECL_CLASS_CONTEXT (decl
);
2630 tree dname
= DECL_NAME (decl
);
2635 if (!processing_specialization
)
2638 tsk
= tsk_excessive_parms
;
2641 tsk
= current_tmpl_spec_kind (template_count
);
2646 if (processing_specialization
&& !VAR_P (decl
))
2649 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
2651 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
2654 /* This could be something like:
2656 template <class T> void f(T);
2657 class S { friend void f<>(int); } */
2661 /* This case handles bogus declarations like template <>
2662 template <class T> void f<int>(); */
2664 error ("template-id %qD in declaration of primary template",
2671 case tsk_invalid_member_spec
:
2672 /* The error has already been reported in
2673 check_specialization_scope. */
2674 return error_mark_node
;
2676 case tsk_invalid_expl_inst
:
2677 error ("template parameter list used in explicit instantiation");
2683 error ("definition provided for explicit instantiation");
2685 explicit_instantiation
= 1;
2688 case tsk_excessive_parms
:
2689 case tsk_insufficient_parms
:
2690 if (tsk
== tsk_excessive_parms
)
2691 error ("too many template parameter lists in declaration of %qD",
2693 else if (template_header_count
)
2694 error("too few template parameter lists in declaration of %qD", decl
);
2696 error("explicit specialization of %qD must be introduced by "
2697 "%<template <>%>", decl
);
2702 error ("explicit specialization declared %<concept%>");
2704 if (VAR_P (decl
) && TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
2705 /* In cases like template<> constexpr bool v = true;
2706 We'll give an error in check_template_variable. */
2709 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
2711 member_specialization
= 1;
2717 if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
2719 /* This case handles bogus declarations like template <>
2720 template <class T> void f<int>(); */
2722 if (!uses_template_parms (declarator
))
2723 error ("template-id %qD in declaration of primary template",
2725 else if (variable_template_p (TREE_OPERAND (declarator
, 0)))
2727 /* Partial specialization of variable template. */
2728 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
2732 else if (cxx_dialect
< cxx14
)
2733 error ("non-type partial specialization %qD "
2734 "is not allowed", declarator
);
2736 error ("non-class, non-variable partial specialization %qD "
2737 "is not allowed", declarator
);
2742 if (ctype
&& CLASSTYPE_TEMPLATE_INSTANTIATION (ctype
))
2743 /* This is a specialization of a member template, without
2744 specialization the containing class. Something like:
2746 template <class T> struct S {
2747 template <class U> void f (U);
2749 template <> template <class U> void S<int>::f(U) {}
2751 That's a specialization -- but of the entire template. */
2759 if ((specialization
|| member_specialization
)
2760 /* This doesn't apply to variable templates. */
2761 && (TREE_CODE (TREE_TYPE (decl
)) == FUNCTION_TYPE
2762 || TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
))
2764 tree t
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
2765 for (; t
; t
= TREE_CHAIN (t
))
2766 if (TREE_PURPOSE (t
))
2768 permerror (input_location
,
2769 "default argument specified in explicit specialization");
2774 if (specialization
|| member_specialization
|| explicit_instantiation
)
2776 tree tmpl
= NULL_TREE
;
2777 tree targs
= NULL_TREE
;
2778 bool was_template_id
= (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
);
2780 /* Make sure that the declarator is a TEMPLATE_ID_EXPR. */
2781 if (!was_template_id
)
2785 gcc_assert (identifier_p (declarator
));
2790 /* If there is no class context, the explicit instantiation
2791 must be at namespace scope. */
2792 gcc_assert (DECL_NAMESPACE_SCOPE_P (decl
));
2794 /* Find the namespace binding, using the declaration
2796 fns
= lookup_qualified_name (CP_DECL_CONTEXT (decl
), dname
,
2798 if (fns
== error_mark_node
|| !is_overloaded_fn (fns
))
2800 error ("%qD is not a template function", dname
);
2801 fns
= error_mark_node
;
2805 declarator
= lookup_template_function (fns
, NULL_TREE
);
2808 if (declarator
== error_mark_node
)
2809 return error_mark_node
;
2811 if (ctype
!= NULL_TREE
&& TYPE_BEING_DEFINED (ctype
))
2813 if (!explicit_instantiation
)
2814 /* A specialization in class scope. This is invalid,
2815 but the error will already have been flagged by
2816 check_specialization_scope. */
2817 return error_mark_node
;
2820 /* It's not valid to write an explicit instantiation in
2823 class C { template void f(); }
2825 This case is caught by the parser. However, on
2828 template class C { void f(); };
2830 (which is invalid) we can get here. The error will be
2837 else if (ctype
!= NULL_TREE
2838 && (identifier_p (TREE_OPERAND (declarator
, 0))))
2840 // We'll match variable templates in start_decl.
2844 /* Find the list of functions in ctype that have the same
2845 name as the declared function. */
2846 tree name
= TREE_OPERAND (declarator
, 0);
2847 tree fns
= NULL_TREE
;
2850 if (constructor_name_p (name
, ctype
))
2852 int is_constructor
= DECL_CONSTRUCTOR_P (decl
);
2854 if (is_constructor
? !TYPE_HAS_USER_CONSTRUCTOR (ctype
)
2855 : !CLASSTYPE_DESTRUCTORS (ctype
))
2857 /* From [temp.expl.spec]:
2859 If such an explicit specialization for the member
2860 of a class template names an implicitly-declared
2861 special member function (clause _special_), the
2862 program is ill-formed.
2864 Similar language is found in [temp.explicit]. */
2865 error ("specialization of implicitly-declared special member function");
2866 return error_mark_node
;
2869 name
= is_constructor
? ctor_identifier
: dtor_identifier
;
2872 if (!DECL_CONV_FN_P (decl
))
2874 idx
= lookup_fnfields_1 (ctype
, name
);
2876 fns
= (*CLASSTYPE_METHOD_VEC (ctype
))[idx
];
2880 vec
<tree
, va_gc
> *methods
;
2883 /* For a type-conversion operator, we cannot do a
2884 name-based lookup. We might be looking for `operator
2885 int' which will be a specialization of `operator T'.
2886 So, we find *all* the conversion operators, and then
2887 select from them. */
2890 methods
= CLASSTYPE_METHOD_VEC (ctype
);
2892 for (idx
= CLASSTYPE_FIRST_CONVERSION_SLOT
;
2893 methods
->iterate (idx
, &ovl
);
2896 if (!DECL_CONV_FN_P (OVL_CURRENT (ovl
)))
2897 /* There are no more conversion functions. */
2900 /* Glue all these conversion functions together
2901 with those we already have. */
2902 for (; ovl
; ovl
= OVL_NEXT (ovl
))
2903 fns
= ovl_cons (OVL_CURRENT (ovl
), fns
);
2907 if (fns
== NULL_TREE
)
2909 error ("no member function %qD declared in %qT", name
, ctype
);
2910 return error_mark_node
;
2913 TREE_OPERAND (declarator
, 0) = fns
;
2916 /* Figure out what exactly is being specialized at this point.
2917 Note that for an explicit instantiation, even one for a
2918 member function, we cannot tell apriori whether the
2919 instantiation is for a member template, or just a member
2920 function of a template class. Even if a member template is
2921 being instantiated, the member template arguments may be
2922 elided if they can be deduced from the rest of the
2924 tmpl
= determine_specialization (declarator
, decl
,
2926 member_specialization
,
2930 if (!tmpl
|| tmpl
== error_mark_node
)
2931 /* We couldn't figure out what this declaration was
2933 return error_mark_node
;
2936 if (!ctype
&& !was_template_id
2937 && (specialization
|| member_specialization
2938 || explicit_instantiation
)
2939 && !is_associated_namespace (CP_DECL_CONTEXT (decl
),
2940 CP_DECL_CONTEXT (tmpl
)))
2941 error ("%qD is not declared in %qD",
2942 tmpl
, current_namespace
);
2944 tree gen_tmpl
= most_general_template (tmpl
);
2946 if (explicit_instantiation
)
2948 /* We don't set DECL_EXPLICIT_INSTANTIATION here; that
2949 is done by do_decl_instantiation later. */
2951 int arg_depth
= TMPL_ARGS_DEPTH (targs
);
2952 int parm_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
2954 if (arg_depth
> parm_depth
)
2956 /* If TMPL is not the most general template (for
2957 example, if TMPL is a friend template that is
2958 injected into namespace scope), then there will
2959 be too many levels of TARGS. Remove some of them
2964 new_targs
= make_tree_vec (parm_depth
);
2965 for (i
= arg_depth
- parm_depth
; i
< arg_depth
; ++i
)
2966 TREE_VEC_ELT (new_targs
, i
- (arg_depth
- parm_depth
))
2967 = TREE_VEC_ELT (targs
, i
);
2971 return instantiate_template (tmpl
, targs
, tf_error
);
2974 /* If we thought that the DECL was a member function, but it
2975 turns out to be specializing a static member function,
2976 make DECL a static member function as well. */
2977 if (DECL_FUNCTION_TEMPLATE_P (tmpl
)
2978 && DECL_STATIC_FUNCTION_P (tmpl
)
2979 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
2980 revert_static_member_fn (decl
);
2982 /* If this is a specialization of a member template of a
2983 template class, we want to return the TEMPLATE_DECL, not
2984 the specialization of it. */
2985 if (tsk
== tsk_template
&& !was_template_id
)
2987 tree result
= DECL_TEMPLATE_RESULT (tmpl
);
2988 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
2989 DECL_INITIAL (result
) = NULL_TREE
;
2993 DECL_SOURCE_LOCATION (tmpl
) = DECL_SOURCE_LOCATION (decl
);
2994 DECL_SOURCE_LOCATION (result
)
2995 = DECL_SOURCE_LOCATION (decl
);
2996 /* We want to use the argument list specified in the
2997 definition, not in the original declaration. */
2998 DECL_ARGUMENTS (result
) = DECL_ARGUMENTS (decl
);
2999 for (parm
= DECL_ARGUMENTS (result
); parm
;
3000 parm
= DECL_CHAIN (parm
))
3001 DECL_CONTEXT (parm
) = result
;
3003 return register_specialization (tmpl
, gen_tmpl
, targs
,
3007 /* Set up the DECL_TEMPLATE_INFO for DECL. */
3008 DECL_TEMPLATE_INFO (decl
) = build_template_info (tmpl
, targs
);
3010 if (was_template_id
)
3011 TINFO_USED_TEMPLATE_ID (DECL_TEMPLATE_INFO (decl
)) = true;
3013 /* Inherit default function arguments from the template
3014 DECL is specializing. */
3015 if (DECL_FUNCTION_TEMPLATE_P (tmpl
))
3016 copy_default_args_to_explicit_spec (decl
);
3018 /* This specialization has the same protection as the
3019 template it specializes. */
3020 TREE_PRIVATE (decl
) = TREE_PRIVATE (gen_tmpl
);
3021 TREE_PROTECTED (decl
) = TREE_PROTECTED (gen_tmpl
);
3023 /* 7.1.1-1 [dcl.stc]
3025 A storage-class-specifier shall not be specified in an
3026 explicit specialization...
3028 The parser rejects these, so unless action is taken here,
3029 explicit function specializations will always appear with
3032 The action recommended by the C++ CWG in response to C++
3033 defect report 605 is to make the storage class and linkage
3034 of the explicit specialization match the templated function:
3036 http://www.open-std.org/jtc1/sc22/wg21/docs/cwg_active.html#605
3038 if (tsk
== tsk_expl_spec
&& DECL_FUNCTION_TEMPLATE_P (gen_tmpl
))
3040 tree tmpl_func
= DECL_TEMPLATE_RESULT (gen_tmpl
);
3041 gcc_assert (TREE_CODE (tmpl_func
) == FUNCTION_DECL
);
3043 /* A concept cannot be specialized. */
3044 if (DECL_DECLARED_CONCEPT_P (tmpl_func
))
3046 error ("explicit specialization of function concept %qD",
3048 return error_mark_node
;
3051 /* This specialization has the same linkage and visibility as
3052 the function template it specializes. */
3053 TREE_PUBLIC (decl
) = TREE_PUBLIC (tmpl_func
);
3054 if (! TREE_PUBLIC (decl
))
3056 DECL_INTERFACE_KNOWN (decl
) = 1;
3057 DECL_NOT_REALLY_EXTERN (decl
) = 1;
3059 DECL_THIS_STATIC (decl
) = DECL_THIS_STATIC (tmpl_func
);
3060 if (DECL_VISIBILITY_SPECIFIED (tmpl_func
))
3062 DECL_VISIBILITY_SPECIFIED (decl
) = 1;
3063 DECL_VISIBILITY (decl
) = DECL_VISIBILITY (tmpl_func
);
3067 /* If DECL is a friend declaration, declared using an
3068 unqualified name, the namespace associated with DECL may
3069 have been set incorrectly. For example, in:
3071 template <typename T> void f(T);
3073 struct S { friend void f<int>(int); }
3076 we will have set the DECL_CONTEXT for the friend
3077 declaration to N, rather than to the global namespace. */
3078 if (DECL_NAMESPACE_SCOPE_P (decl
))
3079 DECL_CONTEXT (decl
) = DECL_CONTEXT (tmpl
);
3081 if (is_friend
&& !have_def
)
3082 /* This is not really a declaration of a specialization.
3083 It's just the name of an instantiation. But, it's not
3084 a request for an instantiation, either. */
3085 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
3086 else if (TREE_CODE (decl
) == FUNCTION_DECL
)
3087 /* A specialization is not necessarily COMDAT. */
3088 DECL_COMDAT (decl
) = (TREE_PUBLIC (decl
)
3089 && DECL_DECLARED_INLINE_P (decl
));
3090 else if (VAR_P (decl
))
3091 DECL_COMDAT (decl
) = false;
3093 /* If this is a full specialization, register it so that we can find
3094 it again. Partial specializations will be registered in
3095 process_partial_specialization. */
3096 if (!processing_template_decl
)
3097 decl
= register_specialization (decl
, gen_tmpl
, targs
,
3100 /* A 'structor should already have clones. */
3101 gcc_assert (decl
== error_mark_node
3102 || variable_template_p (tmpl
)
3103 || !(DECL_CONSTRUCTOR_P (decl
)
3104 || DECL_DESTRUCTOR_P (decl
))
3105 || DECL_CLONED_FUNCTION_P (DECL_CHAIN (decl
)));
3112 /* Returns 1 iff PARMS1 and PARMS2 are identical sets of template
3113 parameters. These are represented in the same format used for
3114 DECL_TEMPLATE_PARMS. */
3117 comp_template_parms (const_tree parms1
, const_tree parms2
)
3122 if (parms1
== parms2
)
3125 for (p1
= parms1
, p2
= parms2
;
3126 p1
!= NULL_TREE
&& p2
!= NULL_TREE
;
3127 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
))
3129 tree t1
= TREE_VALUE (p1
);
3130 tree t2
= TREE_VALUE (p2
);
3133 gcc_assert (TREE_CODE (t1
) == TREE_VEC
);
3134 gcc_assert (TREE_CODE (t2
) == TREE_VEC
);
3136 if (TREE_VEC_LENGTH (t1
) != TREE_VEC_LENGTH (t2
))
3139 for (i
= 0; i
< TREE_VEC_LENGTH (t2
); ++i
)
3141 tree parm1
= TREE_VALUE (TREE_VEC_ELT (t1
, i
));
3142 tree parm2
= TREE_VALUE (TREE_VEC_ELT (t2
, i
));
3144 /* If either of the template parameters are invalid, assume
3145 they match for the sake of error recovery. */
3146 if (error_operand_p (parm1
) || error_operand_p (parm2
))
3149 if (TREE_CODE (parm1
) != TREE_CODE (parm2
))
3152 if (TREE_CODE (parm1
) == TEMPLATE_TYPE_PARM
3153 && (TEMPLATE_TYPE_PARAMETER_PACK (parm1
)
3154 == TEMPLATE_TYPE_PARAMETER_PACK (parm2
)))
3156 else if (!same_type_p (TREE_TYPE (parm1
), TREE_TYPE (parm2
)))
3161 if ((p1
!= NULL_TREE
) != (p2
!= NULL_TREE
))
3162 /* One set of parameters has more parameters lists than the
3169 /* Determine whether PARM is a parameter pack. */
3172 template_parameter_pack_p (const_tree parm
)
3174 /* Determine if we have a non-type template parameter pack. */
3175 if (TREE_CODE (parm
) == PARM_DECL
)
3176 return (DECL_TEMPLATE_PARM_P (parm
)
3177 && TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)));
3178 if (TREE_CODE (parm
) == TEMPLATE_PARM_INDEX
)
3179 return TEMPLATE_PARM_PARAMETER_PACK (parm
);
3181 /* If this is a list of template parameters, we could get a
3182 TYPE_DECL or a TEMPLATE_DECL. */
3183 if (TREE_CODE (parm
) == TYPE_DECL
|| TREE_CODE (parm
) == TEMPLATE_DECL
)
3184 parm
= TREE_TYPE (parm
);
3186 /* Otherwise it must be a type template parameter. */
3187 return ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
3188 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
)
3189 && TEMPLATE_TYPE_PARAMETER_PACK (parm
));
3192 /* Determine if T is a function parameter pack. */
3195 function_parameter_pack_p (const_tree t
)
3197 if (t
&& TREE_CODE (t
) == PARM_DECL
)
3198 return DECL_PACK_P (t
);
3202 /* Return the function template declaration of PRIMARY_FUNC_TMPL_INST.
3203 PRIMARY_FUNC_TMPL_INST is a primary function template instantiation. */
3206 get_function_template_decl (const_tree primary_func_tmpl_inst
)
3208 if (! primary_func_tmpl_inst
3209 || TREE_CODE (primary_func_tmpl_inst
) != FUNCTION_DECL
3210 || ! primary_template_instantiation_p (primary_func_tmpl_inst
))
3213 return DECL_TEMPLATE_RESULT (DECL_TI_TEMPLATE (primary_func_tmpl_inst
));
3216 /* Return true iff the function parameter PARAM_DECL was expanded
3217 from the function parameter pack PACK. */
3220 function_parameter_expanded_from_pack_p (tree param_decl
, tree pack
)
3222 if (DECL_ARTIFICIAL (param_decl
)
3223 || !function_parameter_pack_p (pack
))
3226 /* The parameter pack and its pack arguments have the same
3228 return DECL_PARM_INDEX (pack
) == DECL_PARM_INDEX (param_decl
);
3231 /* Determine whether ARGS describes a variadic template args list,
3232 i.e., one that is terminated by a template argument pack. */
3235 template_args_variadic_p (tree args
)
3240 if (args
== NULL_TREE
)
3243 args
= INNERMOST_TEMPLATE_ARGS (args
);
3244 nargs
= TREE_VEC_LENGTH (args
);
3249 last_parm
= TREE_VEC_ELT (args
, nargs
- 1);
3251 return ARGUMENT_PACK_P (last_parm
);
3254 /* Generate a new name for the parameter pack name NAME (an
3255 IDENTIFIER_NODE) that incorporates its */
3258 make_ith_pack_parameter_name (tree name
, int i
)
3260 /* Munge the name to include the parameter index. */
3261 #define NUMBUF_LEN 128
3262 char numbuf
[NUMBUF_LEN
];
3266 if (name
== NULL_TREE
)
3268 snprintf (numbuf
, NUMBUF_LEN
, "%i", i
);
3269 newname_len
= IDENTIFIER_LENGTH (name
)
3270 + strlen (numbuf
) + 2;
3271 newname
= (char*)alloca (newname_len
);
3272 snprintf (newname
, newname_len
,
3273 "%s#%i", IDENTIFIER_POINTER (name
), i
);
3274 return get_identifier (newname
);
3277 /* Return true if T is a primary function, class or alias template
3281 primary_template_instantiation_p (const_tree t
)
3286 if (TREE_CODE (t
) == FUNCTION_DECL
)
3287 return DECL_LANG_SPECIFIC (t
)
3288 && DECL_TEMPLATE_INSTANTIATION (t
)
3289 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (t
));
3290 else if (CLASS_TYPE_P (t
) && !TYPE_DECL_ALIAS_P (TYPE_NAME (t
)))
3291 return CLASSTYPE_TEMPLATE_INSTANTIATION (t
)
3292 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (t
));
3293 else if (alias_template_specialization_p (t
))
3298 /* Return true if PARM is a template template parameter. */
3301 template_template_parameter_p (const_tree parm
)
3303 return DECL_TEMPLATE_TEMPLATE_PARM_P (parm
);
3306 /* Return true iff PARM is a DECL representing a type template
3310 template_type_parameter_p (const_tree parm
)
3313 && (TREE_CODE (parm
) == TYPE_DECL
3314 || TREE_CODE (parm
) == TEMPLATE_DECL
)
3315 && DECL_TEMPLATE_PARM_P (parm
));
3318 /* Return the template parameters of T if T is a
3319 primary template instantiation, NULL otherwise. */
3322 get_primary_template_innermost_parameters (const_tree t
)
3324 tree parms
= NULL
, template_info
= NULL
;
3326 if ((template_info
= get_template_info (t
))
3327 && primary_template_instantiation_p (t
))
3328 parms
= INNERMOST_TEMPLATE_PARMS
3329 (DECL_TEMPLATE_PARMS (TI_TEMPLATE (template_info
)));
3334 /* Return the template parameters of the LEVELth level from the full list
3335 of template parameters PARMS. */
3338 get_template_parms_at_level (tree parms
, int level
)
3342 || TREE_CODE (parms
) != TREE_LIST
3343 || level
> TMPL_PARMS_DEPTH (parms
))
3346 for (p
= parms
; p
; p
= TREE_CHAIN (p
))
3347 if (TMPL_PARMS_DEPTH (p
) == level
)
3353 /* Returns the template arguments of T if T is a template instantiation,
3357 get_template_innermost_arguments (const_tree t
)
3359 tree args
= NULL
, template_info
= NULL
;
3361 if ((template_info
= get_template_info (t
))
3362 && TI_ARGS (template_info
))
3363 args
= INNERMOST_TEMPLATE_ARGS (TI_ARGS (template_info
));
3368 /* Return the argument pack elements of T if T is a template argument pack,
3372 get_template_argument_pack_elems (const_tree t
)
3374 if (TREE_CODE (t
) != TYPE_ARGUMENT_PACK
3375 && TREE_CODE (t
) != NONTYPE_ARGUMENT_PACK
)
3378 return ARGUMENT_PACK_ARGS (t
);
3381 /* Structure used to track the progress of find_parameter_packs_r. */
3382 struct find_parameter_pack_data
3384 /* TREE_LIST that will contain all of the parameter packs found by
3386 tree
* parameter_packs
;
3388 /* Set of AST nodes that have been visited by the traversal. */
3389 hash_set
<tree
> *visited
;
3391 /* True iff we're making a type pack expansion. */
3392 bool type_pack_expansion_p
;
3395 /* Identifies all of the argument packs that occur in a template
3396 argument and appends them to the TREE_LIST inside DATA, which is a
3397 find_parameter_pack_data structure. This is a subroutine of
3398 make_pack_expansion and uses_parameter_packs. */
3400 find_parameter_packs_r (tree
*tp
, int *walk_subtrees
, void* data
)
3403 struct find_parameter_pack_data
* ppd
=
3404 (struct find_parameter_pack_data
*)data
;
3405 bool parameter_pack_p
= false;
3407 /* Handle type aliases/typedefs. */
3408 if (TYPE_ALIAS_P (t
))
3410 if (TYPE_TEMPLATE_INFO (t
))
3411 cp_walk_tree (&TYPE_TI_ARGS (t
),
3412 &find_parameter_packs_r
,
3418 /* Identify whether this is a parameter pack or not. */
3419 switch (TREE_CODE (t
))
3421 case TEMPLATE_PARM_INDEX
:
3422 if (TEMPLATE_PARM_PARAMETER_PACK (t
))
3423 parameter_pack_p
= true;
3426 case TEMPLATE_TYPE_PARM
:
3427 t
= TYPE_MAIN_VARIANT (t
);
3428 case TEMPLATE_TEMPLATE_PARM
:
3429 /* If the placeholder appears in the decl-specifier-seq of a function
3430 parameter pack (14.6.3), or the type-specifier-seq of a type-id that
3431 is a pack expansion, the invented template parameter is a template
3433 if (ppd
->type_pack_expansion_p
&& is_auto_or_concept (t
))
3434 TEMPLATE_TYPE_PARAMETER_PACK (t
) = true;
3435 if (TEMPLATE_TYPE_PARAMETER_PACK (t
))
3436 parameter_pack_p
= true;
3441 if (DECL_PACK_P (t
))
3443 /* We don't want to walk into the type of a PARM_DECL,
3444 because we don't want to see the type parameter pack. */
3446 parameter_pack_p
= true;
3450 /* Look through a lambda capture proxy to the field pack. */
3452 if (DECL_HAS_VALUE_EXPR_P (t
))
3454 tree v
= DECL_VALUE_EXPR (t
);
3456 &find_parameter_packs_r
,
3460 else if (variable_template_specialization_p (t
))
3462 cp_walk_tree (&DECL_TI_ARGS (t
),
3463 find_parameter_packs_r
,
3470 parameter_pack_p
= true;
3473 /* Not a parameter pack. */
3477 if (parameter_pack_p
)
3479 /* Add this parameter pack to the list. */
3480 *ppd
->parameter_packs
= tree_cons (NULL_TREE
, t
, *ppd
->parameter_packs
);
3484 cp_walk_tree (&TYPE_CONTEXT (t
),
3485 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3487 /* This switch statement will return immediately if we don't find a
3489 switch (TREE_CODE (t
))
3491 case TEMPLATE_PARM_INDEX
:
3494 case BOUND_TEMPLATE_TEMPLATE_PARM
:
3495 /* Check the template itself. */
3496 cp_walk_tree (&TREE_TYPE (TYPE_TI_TEMPLATE (t
)),
3497 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3498 /* Check the template arguments. */
3499 cp_walk_tree (&TYPE_TI_ARGS (t
), &find_parameter_packs_r
, ppd
,
3504 case TEMPLATE_TYPE_PARM
:
3505 case TEMPLATE_TEMPLATE_PARM
:
3512 if (TYPE_PTRMEMFUNC_P (t
))
3518 if (TYPE_TEMPLATE_INFO (t
))
3519 cp_walk_tree (&TYPE_TI_ARGS (t
),
3520 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3527 cp_walk_tree (&TREE_TYPE (t
),
3528 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3532 cp_walk_tree (&TYPENAME_TYPE_FULLNAME (t
), &find_parameter_packs_r
,
3537 case TYPE_PACK_EXPANSION
:
3538 case EXPR_PACK_EXPANSION
:
3543 cp_walk_tree (&TYPE_MAX_VALUE (t
), &find_parameter_packs_r
,
3548 case IDENTIFIER_NODE
:
3549 cp_walk_tree (&TREE_TYPE (t
), &find_parameter_packs_r
, ppd
,
3561 /* Determines if the expression or type T uses any parameter packs. */
3563 uses_parameter_packs (tree t
)
3565 tree parameter_packs
= NULL_TREE
;
3566 struct find_parameter_pack_data ppd
;
3567 ppd
.parameter_packs
= ¶meter_packs
;
3568 ppd
.visited
= new hash_set
<tree
>;
3569 ppd
.type_pack_expansion_p
= false;
3570 cp_walk_tree (&t
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
3572 return parameter_packs
!= NULL_TREE
;
3575 /* Turn ARG, which may be an expression, type, or a TREE_LIST
3576 representation a base-class initializer into a parameter pack
3577 expansion. If all goes well, the resulting node will be an
3578 EXPR_PACK_EXPANSION, TYPE_PACK_EXPANSION, or TREE_LIST,
3581 make_pack_expansion (tree arg
)
3584 tree parameter_packs
= NULL_TREE
;
3585 bool for_types
= false;
3586 struct find_parameter_pack_data ppd
;
3588 if (!arg
|| arg
== error_mark_node
)
3591 if (TREE_CODE (arg
) == TREE_LIST
&& TREE_PURPOSE (arg
))
3593 /* A TREE_LIST with a non-null TREE_PURPOSE is for a base
3594 class initializer. In this case, the TREE_PURPOSE will be a
3595 _TYPE node (representing the base class expansion we're
3596 initializing) and the TREE_VALUE will be a TREE_LIST
3597 containing the initialization arguments.
3599 The resulting expansion looks somewhat different from most
3600 expansions. Rather than returning just one _EXPANSION, we
3601 return a TREE_LIST whose TREE_PURPOSE is a
3602 TYPE_PACK_EXPANSION containing the bases that will be
3603 initialized. The TREE_VALUE will be identical to the
3604 original TREE_VALUE, which is a list of arguments that will
3605 be passed to each base. We do not introduce any new pack
3606 expansion nodes into the TREE_VALUE (although it is possible
3607 that some already exist), because the TREE_PURPOSE and
3608 TREE_VALUE all need to be expanded together with the same
3609 _EXPANSION node. Note that the TYPE_PACK_EXPANSION in the
3610 resulting TREE_PURPOSE will mention the parameter packs in
3611 both the bases and the arguments to the bases. */
3614 tree parameter_packs
= NULL_TREE
;
3616 /* Determine which parameter packs will be used by the base
3618 ppd
.visited
= new hash_set
<tree
>;
3619 ppd
.parameter_packs
= ¶meter_packs
;
3620 cp_walk_tree (&TREE_PURPOSE (arg
), &find_parameter_packs_r
,
3623 if (parameter_packs
== NULL_TREE
)
3625 error ("base initializer expansion %<%T%> contains no parameter packs", arg
);
3627 return error_mark_node
;
3630 if (TREE_VALUE (arg
) != void_type_node
)
3632 /* Collect the sets of parameter packs used in each of the
3633 initialization arguments. */
3634 for (value
= TREE_VALUE (arg
); value
; value
= TREE_CHAIN (value
))
3636 /* Determine which parameter packs will be expanded in this
3638 cp_walk_tree (&TREE_VALUE (value
), &find_parameter_packs_r
,
3645 /* Create the pack expansion type for the base type. */
3646 purpose
= cxx_make_type (TYPE_PACK_EXPANSION
);
3647 SET_PACK_EXPANSION_PATTERN (purpose
, TREE_PURPOSE (arg
));
3648 PACK_EXPANSION_PARAMETER_PACKS (purpose
) = parameter_packs
;
3650 /* Just use structural equality for these TYPE_PACK_EXPANSIONS;
3651 they will rarely be compared to anything. */
3652 SET_TYPE_STRUCTURAL_EQUALITY (purpose
);
3654 return tree_cons (purpose
, TREE_VALUE (arg
), NULL_TREE
);
3657 if (TYPE_P (arg
) || TREE_CODE (arg
) == TEMPLATE_DECL
)
3660 /* Build the PACK_EXPANSION_* node. */
3662 ? cxx_make_type (TYPE_PACK_EXPANSION
)
3663 : make_node (EXPR_PACK_EXPANSION
);
3664 SET_PACK_EXPANSION_PATTERN (result
, arg
);
3665 if (TREE_CODE (result
) == EXPR_PACK_EXPANSION
)
3667 /* Propagate type and const-expression information. */
3668 TREE_TYPE (result
) = TREE_TYPE (arg
);
3669 TREE_CONSTANT (result
) = TREE_CONSTANT (arg
);
3672 /* Just use structural equality for these TYPE_PACK_EXPANSIONS;
3673 they will rarely be compared to anything. */
3674 SET_TYPE_STRUCTURAL_EQUALITY (result
);
3676 /* Determine which parameter packs will be expanded. */
3677 ppd
.parameter_packs
= ¶meter_packs
;
3678 ppd
.visited
= new hash_set
<tree
>;
3679 ppd
.type_pack_expansion_p
= TYPE_P (arg
);
3680 cp_walk_tree (&arg
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
3683 /* Make sure we found some parameter packs. */
3684 if (parameter_packs
== NULL_TREE
)
3687 error ("expansion pattern %<%T%> contains no argument packs", arg
);
3689 error ("expansion pattern %<%E%> contains no argument packs", arg
);
3690 return error_mark_node
;
3692 PACK_EXPANSION_PARAMETER_PACKS (result
) = parameter_packs
;
3694 PACK_EXPANSION_LOCAL_P (result
) = at_function_scope_p ();
3699 /* Checks T for any "bare" parameter packs, which have not yet been
3700 expanded, and issues an error if any are found. This operation can
3701 only be done on full expressions or types (e.g., an expression
3702 statement, "if" condition, etc.), because we could have expressions like:
3704 foo(f(g(h(args)))...)
3706 where "args" is a parameter pack. check_for_bare_parameter_packs
3707 should not be called for the subexpressions args, h(args),
3708 g(h(args)), or f(g(h(args))), because we would produce erroneous
3711 Returns TRUE and emits an error if there were bare parameter packs,
3712 returns FALSE otherwise. */
3714 check_for_bare_parameter_packs (tree t
)
3716 tree parameter_packs
= NULL_TREE
;
3717 struct find_parameter_pack_data ppd
;
3719 if (!processing_template_decl
|| !t
|| t
== error_mark_node
)
3722 if (TREE_CODE (t
) == TYPE_DECL
)
3725 ppd
.parameter_packs
= ¶meter_packs
;
3726 ppd
.visited
= new hash_set
<tree
>;
3727 ppd
.type_pack_expansion_p
= false;
3728 cp_walk_tree (&t
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
3731 if (parameter_packs
)
3733 error ("parameter packs not expanded with %<...%>:");
3734 while (parameter_packs
)
3736 tree pack
= TREE_VALUE (parameter_packs
);
3737 tree name
= NULL_TREE
;
3739 if (TREE_CODE (pack
) == TEMPLATE_TYPE_PARM
3740 || TREE_CODE (pack
) == TEMPLATE_TEMPLATE_PARM
)
3741 name
= TYPE_NAME (pack
);
3742 else if (TREE_CODE (pack
) == TEMPLATE_PARM_INDEX
)
3743 name
= DECL_NAME (TEMPLATE_PARM_DECL (pack
));
3745 name
= DECL_NAME (pack
);
3748 inform (input_location
, " %qD", name
);
3750 inform (input_location
, " <anonymous>");
3752 parameter_packs
= TREE_CHAIN (parameter_packs
);
3761 /* Expand any parameter packs that occur in the template arguments in
3764 expand_template_argument_pack (tree args
)
3766 tree result_args
= NULL_TREE
;
3767 int in_arg
, out_arg
= 0, nargs
= args
? TREE_VEC_LENGTH (args
) : 0;
3768 int num_result_args
= -1;
3769 int non_default_args_count
= -1;
3771 /* First, determine if we need to expand anything, and the number of
3772 slots we'll need. */
3773 for (in_arg
= 0; in_arg
< nargs
; ++in_arg
)
3775 tree arg
= TREE_VEC_ELT (args
, in_arg
);
3776 if (arg
== NULL_TREE
)
3778 if (ARGUMENT_PACK_P (arg
))
3780 int num_packed
= TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg
));
3781 if (num_result_args
< 0)
3782 num_result_args
= in_arg
+ num_packed
;
3784 num_result_args
+= num_packed
;
3788 if (num_result_args
>= 0)
3793 /* If no expansion is necessary, we're done. */
3794 if (num_result_args
< 0)
3797 /* Expand arguments. */
3798 result_args
= make_tree_vec (num_result_args
);
3799 if (NON_DEFAULT_TEMPLATE_ARGS_COUNT (args
))
3800 non_default_args_count
=
3801 GET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (args
);
3802 for (in_arg
= 0; in_arg
< nargs
; ++in_arg
)
3804 tree arg
= TREE_VEC_ELT (args
, in_arg
);
3805 if (ARGUMENT_PACK_P (arg
))
3807 tree packed
= ARGUMENT_PACK_ARGS (arg
);
3808 int i
, num_packed
= TREE_VEC_LENGTH (packed
);
3809 for (i
= 0; i
< num_packed
; ++i
, ++out_arg
)
3810 TREE_VEC_ELT (result_args
, out_arg
) = TREE_VEC_ELT(packed
, i
);
3811 if (non_default_args_count
> 0)
3812 non_default_args_count
+= num_packed
- 1;
3816 TREE_VEC_ELT (result_args
, out_arg
) = arg
;
3820 if (non_default_args_count
>= 0)
3821 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (result_args
, non_default_args_count
);
3825 /* Checks if DECL shadows a template parameter.
3827 [temp.local]: A template-parameter shall not be redeclared within its
3828 scope (including nested scopes).
3830 Emits an error and returns TRUE if the DECL shadows a parameter,
3831 returns FALSE otherwise. */
3834 check_template_shadow (tree decl
)
3838 /* If we're not in a template, we can't possibly shadow a template
3840 if (!current_template_parms
)
3843 /* Figure out what we're shadowing. */
3844 if (TREE_CODE (decl
) == OVERLOAD
)
3845 decl
= OVL_CURRENT (decl
);
3846 olddecl
= innermost_non_namespace_value (DECL_NAME (decl
));
3848 /* If there's no previous binding for this name, we're not shadowing
3849 anything, let alone a template parameter. */
3853 /* If we're not shadowing a template parameter, we're done. Note
3854 that OLDDECL might be an OVERLOAD (or perhaps even an
3855 ERROR_MARK), so we can't just blithely assume it to be a _DECL
3857 if (!DECL_P (olddecl
) || !DECL_TEMPLATE_PARM_P (olddecl
))
3860 /* We check for decl != olddecl to avoid bogus errors for using a
3861 name inside a class. We check TPFI to avoid duplicate errors for
3862 inline member templates. */
3864 || (DECL_TEMPLATE_PARM_P (decl
)
3865 && TEMPLATE_PARMS_FOR_INLINE (current_template_parms
)))
3868 /* Don't complain about the injected class name, as we've already
3869 complained about the class itself. */
3870 if (DECL_SELF_REFERENCE_P (decl
))
3873 if (DECL_TEMPLATE_PARM_P (decl
))
3874 error ("declaration of template parameter %q+D shadows "
3875 "template parameter", decl
);
3877 error ("declaration of %q+#D shadows template parameter", decl
);
3878 inform (DECL_SOURCE_LOCATION (olddecl
),
3879 "template parameter %qD declared here", olddecl
);
3883 /* Return a new TEMPLATE_PARM_INDEX with the indicated INDEX, LEVEL,
3884 ORIG_LEVEL, DECL, and TYPE. */
3887 build_template_parm_index (int index
,
3893 tree t
= make_node (TEMPLATE_PARM_INDEX
);
3894 TEMPLATE_PARM_IDX (t
) = index
;
3895 TEMPLATE_PARM_LEVEL (t
) = level
;
3896 TEMPLATE_PARM_ORIG_LEVEL (t
) = orig_level
;
3897 TEMPLATE_PARM_DECL (t
) = decl
;
3898 TREE_TYPE (t
) = type
;
3899 TREE_CONSTANT (t
) = TREE_CONSTANT (decl
);
3900 TREE_READONLY (t
) = TREE_READONLY (decl
);
3905 /* Find the canonical type parameter for the given template type
3906 parameter. Returns the canonical type parameter, which may be TYPE
3907 if no such parameter existed. */
3910 canonical_type_parameter (tree type
)
3913 int idx
= TEMPLATE_TYPE_IDX (type
);
3914 if (!canonical_template_parms
)
3915 vec_alloc (canonical_template_parms
, idx
+1);
3917 while (canonical_template_parms
->length () <= (unsigned)idx
)
3918 vec_safe_push (canonical_template_parms
, NULL_TREE
);
3920 list
= (*canonical_template_parms
)[idx
];
3921 while (list
&& !comptypes (type
, TREE_VALUE (list
), COMPARE_STRUCTURAL
))
3922 list
= TREE_CHAIN (list
);
3925 return TREE_VALUE (list
);
3928 (*canonical_template_parms
)[idx
]
3929 = tree_cons (NULL_TREE
, type
,
3930 (*canonical_template_parms
)[idx
]);
3935 /* Return a TEMPLATE_PARM_INDEX, similar to INDEX, but whose
3936 TEMPLATE_PARM_LEVEL has been decreased by LEVELS. If such a
3937 TEMPLATE_PARM_INDEX already exists, it is returned; otherwise, a
3938 new one is created. */
3941 reduce_template_parm_level (tree index
, tree type
, int levels
, tree args
,
3942 tsubst_flags_t complain
)
3944 if (TEMPLATE_PARM_DESCENDANTS (index
) == NULL_TREE
3945 || (TEMPLATE_PARM_LEVEL (TEMPLATE_PARM_DESCENDANTS (index
))
3946 != TEMPLATE_PARM_LEVEL (index
) - levels
)
3947 || !same_type_p (type
, TREE_TYPE (TEMPLATE_PARM_DESCENDANTS (index
))))
3949 tree orig_decl
= TEMPLATE_PARM_DECL (index
);
3952 decl
= build_decl (DECL_SOURCE_LOCATION (orig_decl
),
3953 TREE_CODE (orig_decl
), DECL_NAME (orig_decl
), type
);
3954 TREE_CONSTANT (decl
) = TREE_CONSTANT (orig_decl
);
3955 TREE_READONLY (decl
) = TREE_READONLY (orig_decl
);
3956 DECL_ARTIFICIAL (decl
) = 1;
3957 SET_DECL_TEMPLATE_PARM_P (decl
);
3959 t
= build_template_parm_index (TEMPLATE_PARM_IDX (index
),
3960 TEMPLATE_PARM_LEVEL (index
) - levels
,
3961 TEMPLATE_PARM_ORIG_LEVEL (index
),
3963 TEMPLATE_PARM_DESCENDANTS (index
) = t
;
3964 TEMPLATE_PARM_PARAMETER_PACK (t
)
3965 = TEMPLATE_PARM_PARAMETER_PACK (index
);
3967 /* Template template parameters need this. */
3968 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
3970 DECL_TEMPLATE_RESULT (decl
)
3971 = build_decl (DECL_SOURCE_LOCATION (decl
),
3972 TYPE_DECL
, DECL_NAME (decl
), type
);
3973 DECL_ARTIFICIAL (DECL_TEMPLATE_RESULT (decl
)) = true;
3974 DECL_TEMPLATE_PARMS (decl
) = tsubst_template_parms
3975 (DECL_TEMPLATE_PARMS (orig_decl
), args
, complain
);
3979 return TEMPLATE_PARM_DESCENDANTS (index
);
3982 /* Process information from new template parameter PARM and append it
3983 to the LIST being built. This new parameter is a non-type
3984 parameter iff IS_NON_TYPE is true. This new parameter is a
3985 parameter pack iff IS_PARAMETER_PACK is true. The location of PARM
3989 process_template_parm (tree list
, location_t parm_loc
, tree parm
,
3990 bool is_non_type
, bool is_parameter_pack
)
3995 gcc_assert (TREE_CODE (parm
) == TREE_LIST
);
3996 tree defval
= TREE_PURPOSE (parm
);
3997 tree constr
= TREE_TYPE (parm
);
4001 tree p
= tree_last (list
);
4003 if (p
&& TREE_VALUE (p
) != error_mark_node
)
4006 if (TREE_CODE (p
) == TYPE_DECL
|| TREE_CODE (p
) == TEMPLATE_DECL
)
4007 idx
= TEMPLATE_TYPE_IDX (TREE_TYPE (p
));
4009 idx
= TEMPLATE_PARM_IDX (DECL_INITIAL (p
));
4017 parm
= TREE_VALUE (parm
);
4019 SET_DECL_TEMPLATE_PARM_P (parm
);
4021 if (TREE_TYPE (parm
) != error_mark_node
)
4025 The top-level cv-qualifiers on the template-parameter are
4026 ignored when determining its type. */
4027 TREE_TYPE (parm
) = TYPE_MAIN_VARIANT (TREE_TYPE (parm
));
4028 if (invalid_nontype_parm_type_p (TREE_TYPE (parm
), 1))
4029 TREE_TYPE (parm
) = error_mark_node
;
4030 else if (uses_parameter_packs (TREE_TYPE (parm
))
4031 && !is_parameter_pack
4032 /* If we're in a nested template parameter list, the template
4033 template parameter could be a parameter pack. */
4034 && processing_template_parmlist
== 1)
4036 /* This template parameter is not a parameter pack, but it
4037 should be. Complain about "bare" parameter packs. */
4038 check_for_bare_parameter_packs (TREE_TYPE (parm
));
4040 /* Recover by calling this a parameter pack. */
4041 is_parameter_pack
= true;
4045 /* A template parameter is not modifiable. */
4046 TREE_CONSTANT (parm
) = 1;
4047 TREE_READONLY (parm
) = 1;
4048 decl
= build_decl (parm_loc
,
4049 CONST_DECL
, DECL_NAME (parm
), TREE_TYPE (parm
));
4050 TREE_CONSTANT (decl
) = 1;
4051 TREE_READONLY (decl
) = 1;
4052 DECL_INITIAL (parm
) = DECL_INITIAL (decl
)
4053 = build_template_parm_index (idx
, processing_template_decl
,
4054 processing_template_decl
,
4055 decl
, TREE_TYPE (parm
));
4057 TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
))
4058 = is_parameter_pack
;
4063 parm
= TREE_VALUE (TREE_VALUE (parm
));
4065 if (parm
&& TREE_CODE (parm
) == TEMPLATE_DECL
)
4067 t
= cxx_make_type (TEMPLATE_TEMPLATE_PARM
);
4068 /* This is for distinguishing between real templates and template
4069 template parameters */
4070 TREE_TYPE (parm
) = t
;
4071 TREE_TYPE (DECL_TEMPLATE_RESULT (parm
)) = t
;
4076 t
= cxx_make_type (TEMPLATE_TYPE_PARM
);
4077 /* parm is either IDENTIFIER_NODE or NULL_TREE. */
4078 decl
= build_decl (parm_loc
,
4079 TYPE_DECL
, parm
, t
);
4082 TYPE_NAME (t
) = decl
;
4083 TYPE_STUB_DECL (t
) = decl
;
4085 TEMPLATE_TYPE_PARM_INDEX (t
)
4086 = build_template_parm_index (idx
, processing_template_decl
,
4087 processing_template_decl
,
4088 decl
, TREE_TYPE (parm
));
4089 TEMPLATE_TYPE_PARAMETER_PACK (t
) = is_parameter_pack
;
4090 TYPE_CANONICAL (t
) = canonical_type_parameter (t
);
4092 DECL_ARTIFICIAL (decl
) = 1;
4093 SET_DECL_TEMPLATE_PARM_P (decl
);
4095 /* Build requirements for the type/template parameter.
4096 This must be done after SET_DECL_TEMPLATE_PARM_P or
4097 process_template_parm could fail. */
4098 tree reqs
= finish_shorthand_constraint (parm
, constr
);
4102 /* Build the parameter node linking the parameter declaration,
4103 its default argument (if any), and its constraints (if any). */
4104 parm
= build_tree_list (defval
, parm
);
4105 TEMPLATE_PARM_CONSTRAINTS (parm
) = reqs
;
4107 return chainon (list
, parm
);
4110 /* The end of a template parameter list has been reached. Process the
4111 tree list into a parameter vector, converting each parameter into a more
4112 useful form. Type parameters are saved as IDENTIFIER_NODEs, and others
4116 end_template_parm_list (tree parms
)
4120 tree saved_parmlist
= make_tree_vec (list_length (parms
));
4122 /* Pop the dummy parameter level and add the real one. */
4123 current_template_parms
= TREE_CHAIN (current_template_parms
);
4125 current_template_parms
4126 = tree_cons (size_int (processing_template_decl
),
4127 saved_parmlist
, current_template_parms
);
4129 for (parm
= parms
, nparms
= 0; parm
; parm
= next
, nparms
++)
4131 next
= TREE_CHAIN (parm
);
4132 TREE_VEC_ELT (saved_parmlist
, nparms
) = parm
;
4133 TREE_CHAIN (parm
) = NULL_TREE
;
4136 --processing_template_parmlist
;
4138 return saved_parmlist
;
4141 // Explicitly indicate the end of the template parameter list. We assume
4142 // that the current template parameters have been constructed and/or
4143 // managed explicitly, as when creating new template template parameters
4144 // from a shorthand constraint.
4146 end_template_parm_list ()
4148 --processing_template_parmlist
;
4151 /* end_template_decl is called after a template declaration is seen. */
4154 end_template_decl (void)
4156 reset_specialization ();
4158 if (! processing_template_decl
)
4161 /* This matches the pushlevel in begin_template_parm_list. */
4164 --processing_template_decl
;
4165 current_template_parms
= TREE_CHAIN (current_template_parms
);
4168 /* Takes a TREE_LIST representing a template parameter and convert it
4169 into an argument suitable to be passed to the type substitution
4170 functions. Note that If the TREE_LIST contains an error_mark
4171 node, the returned argument is error_mark_node. */
4174 template_parm_to_arg (tree t
)
4178 || TREE_CODE (t
) != TREE_LIST
)
4181 if (error_operand_p (TREE_VALUE (t
)))
4182 return error_mark_node
;
4186 if (TREE_CODE (t
) == TYPE_DECL
4187 || TREE_CODE (t
) == TEMPLATE_DECL
)
4191 if (TEMPLATE_TYPE_PARAMETER_PACK (t
))
4193 /* Turn this argument into a TYPE_ARGUMENT_PACK
4194 with a single element, which expands T. */
4195 tree vec
= make_tree_vec (1);
4197 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (vec
, TREE_VEC_LENGTH (vec
));
4199 TREE_VEC_ELT (vec
, 0) = make_pack_expansion (t
);
4201 t
= cxx_make_type (TYPE_ARGUMENT_PACK
);
4202 SET_ARGUMENT_PACK_ARGS (t
, vec
);
4207 t
= DECL_INITIAL (t
);
4209 if (TEMPLATE_PARM_PARAMETER_PACK (t
))
4211 /* Turn this argument into a NONTYPE_ARGUMENT_PACK
4212 with a single element, which expands T. */
4213 tree vec
= make_tree_vec (1);
4214 tree type
= TREE_TYPE (TEMPLATE_PARM_DECL (t
));
4216 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (vec
, TREE_VEC_LENGTH (vec
));
4218 t
= convert_from_reference (t
);
4219 TREE_VEC_ELT (vec
, 0) = make_pack_expansion (t
);
4221 t
= make_node (NONTYPE_ARGUMENT_PACK
);
4222 SET_ARGUMENT_PACK_ARGS (t
, vec
);
4223 TREE_TYPE (t
) = type
;
4226 t
= convert_from_reference (t
);
4231 /* Given a set of template parameters, return them as a set of template
4232 arguments. The template parameters are represented as a TREE_VEC, in
4233 the form documented in cp-tree.h for template arguments. */
4236 template_parms_to_args (tree parms
)
4239 tree args
= NULL_TREE
;
4240 int length
= TMPL_PARMS_DEPTH (parms
);
4243 /* If there is only one level of template parameters, we do not
4244 create a TREE_VEC of TREE_VECs. Instead, we return a single
4245 TREE_VEC containing the arguments. */
4247 args
= make_tree_vec (length
);
4249 for (header
= parms
; header
; header
= TREE_CHAIN (header
))
4251 tree a
= copy_node (TREE_VALUE (header
));
4254 TREE_TYPE (a
) = NULL_TREE
;
4255 for (i
= TREE_VEC_LENGTH (a
) - 1; i
>= 0; --i
)
4256 TREE_VEC_ELT (a
, i
) = template_parm_to_arg (TREE_VEC_ELT (a
, i
));
4259 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (a
, TREE_VEC_LENGTH (a
));
4262 TREE_VEC_ELT (args
, --l
) = a
;
4270 /* Within the declaration of a template, return the currently active
4271 template parameters as an argument TREE_VEC. */
4274 current_template_args (void)
4276 return template_parms_to_args (current_template_parms
);
4279 /* Update the declared TYPE by doing any lookups which were thought to be
4280 dependent, but are not now that we know the SCOPE of the declarator. */
4283 maybe_update_decl_type (tree orig_type
, tree scope
)
4285 tree type
= orig_type
;
4287 if (type
== NULL_TREE
)
4290 if (TREE_CODE (orig_type
) == TYPE_DECL
)
4291 type
= TREE_TYPE (type
);
4293 if (scope
&& TYPE_P (scope
) && dependent_type_p (scope
)
4294 && dependent_type_p (type
)
4295 /* Don't bother building up the args in this case. */
4296 && TREE_CODE (type
) != TEMPLATE_TYPE_PARM
)
4298 /* tsubst in the args corresponding to the template parameters,
4299 including auto if present. Most things will be unchanged, but
4300 make_typename_type and tsubst_qualified_id will resolve
4301 TYPENAME_TYPEs and SCOPE_REFs that were previously dependent. */
4302 tree args
= current_template_args ();
4303 tree auto_node
= type_uses_auto (type
);
4307 tree auto_vec
= make_tree_vec (1);
4308 TREE_VEC_ELT (auto_vec
, 0) = auto_node
;
4309 args
= add_to_template_args (args
, auto_vec
);
4311 pushed
= push_scope (scope
);
4312 type
= tsubst (type
, args
, tf_warning_or_error
, NULL_TREE
);
4317 if (type
== error_mark_node
)
4320 if (TREE_CODE (orig_type
) == TYPE_DECL
)
4322 if (same_type_p (type
, TREE_TYPE (orig_type
)))
4325 type
= TYPE_NAME (type
);
4330 /* Return a TEMPLATE_DECL corresponding to DECL, using the indicated
4331 template PARMS and constraints, CONSTR. If MEMBER_TEMPLATE_P is true,
4332 the new template is a member template. */
4335 build_template_decl (tree decl
, tree parms
, bool member_template_p
)
4337 tree tmpl
= build_lang_decl (TEMPLATE_DECL
, DECL_NAME (decl
), NULL_TREE
);
4338 DECL_TEMPLATE_PARMS (tmpl
) = parms
;
4339 DECL_CONTEXT (tmpl
) = DECL_CONTEXT (decl
);
4340 DECL_SOURCE_LOCATION (tmpl
) = DECL_SOURCE_LOCATION (decl
);
4341 DECL_MEMBER_TEMPLATE_P (tmpl
) = member_template_p
;
4346 struct template_parm_data
4348 /* The level of the template parameters we are currently
4352 /* The index of the specialization argument we are currently
4356 /* An array whose size is the number of template parameters. The
4357 elements are nonzero if the parameter has been used in any one
4358 of the arguments processed so far. */
4361 /* An array whose size is the number of template arguments. The
4362 elements are nonzero if the argument makes use of template
4363 parameters of this level. */
4364 int* arg_uses_template_parms
;
4367 /* Subroutine of push_template_decl used to see if each template
4368 parameter in a partial specialization is used in the explicit
4369 argument list. If T is of the LEVEL given in DATA (which is
4370 treated as a template_parm_data*), then DATA->PARMS is marked
4374 mark_template_parm (tree t
, void* data
)
4378 struct template_parm_data
* tpd
= (struct template_parm_data
*) data
;
4380 template_parm_level_and_index (t
, &level
, &idx
);
4382 if (level
== tpd
->level
)
4384 tpd
->parms
[idx
] = 1;
4385 tpd
->arg_uses_template_parms
[tpd
->current_arg
] = 1;
4388 /* Return zero so that for_each_template_parm will continue the
4389 traversal of the tree; we want to mark *every* template parm. */
4393 /* Process the partial specialization DECL. */
4396 process_partial_specialization (tree decl
)
4398 tree type
= TREE_TYPE (decl
);
4399 tree tinfo
= get_template_info (decl
);
4400 tree maintmpl
= TI_TEMPLATE (tinfo
);
4401 tree specargs
= TI_ARGS (tinfo
);
4402 tree inner_args
= INNERMOST_TEMPLATE_ARGS (specargs
);
4403 tree main_inner_parms
= DECL_INNERMOST_TEMPLATE_PARMS (maintmpl
);
4406 int nargs
= TREE_VEC_LENGTH (inner_args
);
4409 bool did_error_intro
= false;
4410 struct template_parm_data tpd
;
4411 struct template_parm_data tpd2
;
4413 gcc_assert (current_template_parms
);
4415 /* A concept cannot be specialized. */
4416 if (flag_concepts
&& variable_concept_p (maintmpl
))
4418 error ("specialization of variable concept %q#D", maintmpl
);
4419 return error_mark_node
;
4422 inner_parms
= INNERMOST_TEMPLATE_PARMS (current_template_parms
);
4423 ntparms
= TREE_VEC_LENGTH (inner_parms
);
4425 /* We check that each of the template parameters given in the
4426 partial specialization is used in the argument list to the
4427 specialization. For example:
4429 template <class T> struct S;
4430 template <class T> struct S<T*>;
4432 The second declaration is OK because `T*' uses the template
4433 parameter T, whereas
4435 template <class T> struct S<int>;
4437 is no good. Even trickier is:
4448 The S2<T> declaration is actually invalid; it is a
4449 full-specialization. Of course,
4452 struct S2<T (*)(U)>;
4454 or some such would have been OK. */
4455 tpd
.level
= TMPL_PARMS_DEPTH (current_template_parms
);
4456 tpd
.parms
= XALLOCAVEC (int, ntparms
);
4457 memset (tpd
.parms
, 0, sizeof (int) * ntparms
);
4459 tpd
.arg_uses_template_parms
= XALLOCAVEC (int, nargs
);
4460 memset (tpd
.arg_uses_template_parms
, 0, sizeof (int) * nargs
);
4461 for (i
= 0; i
< nargs
; ++i
)
4463 tpd
.current_arg
= i
;
4464 for_each_template_parm (TREE_VEC_ELT (inner_args
, i
),
4465 &mark_template_parm
,
4468 /*include_nondeduced_p=*/false);
4470 for (i
= 0; i
< ntparms
; ++i
)
4471 if (tpd
.parms
[i
] == 0)
4473 /* One of the template parms was not used in a deduced context in the
4475 if (!did_error_intro
)
4477 error ("template parameters not deducible in "
4478 "partial specialization:");
4479 did_error_intro
= true;
4482 inform (input_location
, " %qD",
4483 TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
)));
4486 if (did_error_intro
)
4487 return error_mark_node
;
4489 /* [temp.class.spec]
4491 The argument list of the specialization shall not be identical to
4492 the implicit argument list of the primary template. */
4494 = TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (maintmpl
)));
4495 if (comp_template_args (inner_args
, INNERMOST_TEMPLATE_ARGS (main_args
))
4497 || !subsumes_constraints (current_template_constraints (),
4498 get_constraints (maintmpl
))))
4501 error ("partial specialization %q+D does not specialize "
4502 "any template arguments", decl
);
4504 error ("partial specialization %q+D does not specialize any "
4505 "template arguments and is not more constrained than", decl
);
4506 inform (DECL_SOURCE_LOCATION (maintmpl
), "primary template here");
4509 /* A partial specialization that replaces multiple parameters of the
4510 primary template with a pack expansion is less specialized for those
4512 if (nargs
< DECL_NTPARMS (maintmpl
))
4514 error ("partial specialization is not more specialized than the "
4515 "primary template because it replaces multiple parameters "
4516 "with a pack expansion");
4517 inform (DECL_SOURCE_LOCATION (maintmpl
), "primary template here");
4521 /* [temp.class.spec]
4523 A partially specialized non-type argument expression shall not
4524 involve template parameters of the partial specialization except
4525 when the argument expression is a simple identifier.
4527 The type of a template parameter corresponding to a specialized
4528 non-type argument shall not be dependent on a parameter of the
4531 Also, we verify that pack expansions only occur at the
4532 end of the argument list. */
4533 gcc_assert (nargs
== DECL_NTPARMS (maintmpl
));
4535 for (i
= 0; i
< nargs
; ++i
)
4537 tree parm
= TREE_VALUE (TREE_VEC_ELT (main_inner_parms
, i
));
4538 tree arg
= TREE_VEC_ELT (inner_args
, i
);
4539 tree packed_args
= NULL_TREE
;
4542 if (ARGUMENT_PACK_P (arg
))
4544 /* Extract the arguments from the argument pack. We'll be
4545 iterating over these in the following loop. */
4546 packed_args
= ARGUMENT_PACK_ARGS (arg
);
4547 len
= TREE_VEC_LENGTH (packed_args
);
4550 for (j
= 0; j
< len
; j
++)
4553 /* Get the Jth argument in the parameter pack. */
4554 arg
= TREE_VEC_ELT (packed_args
, j
);
4556 if (PACK_EXPANSION_P (arg
))
4558 /* Pack expansions must come at the end of the
4560 if ((packed_args
&& j
< len
- 1)
4561 || (!packed_args
&& i
< nargs
- 1))
4563 if (TREE_CODE (arg
) == EXPR_PACK_EXPANSION
)
4564 error ("parameter pack argument %qE must be at the "
4565 "end of the template argument list", arg
);
4567 error ("parameter pack argument %qT must be at the "
4568 "end of the template argument list", arg
);
4572 if (TREE_CODE (arg
) == EXPR_PACK_EXPANSION
)
4573 /* We only care about the pattern. */
4574 arg
= PACK_EXPANSION_PATTERN (arg
);
4576 if (/* These first two lines are the `non-type' bit. */
4578 && TREE_CODE (arg
) != TEMPLATE_DECL
4579 /* This next two lines are the `argument expression is not just a
4580 simple identifier' condition and also the `specialized
4581 non-type argument' bit. */
4582 && TREE_CODE (arg
) != TEMPLATE_PARM_INDEX
4583 && !(REFERENCE_REF_P (arg
)
4584 && TREE_CODE (TREE_OPERAND (arg
, 0)) == TEMPLATE_PARM_INDEX
))
4586 if ((!packed_args
&& tpd
.arg_uses_template_parms
[i
])
4587 || (packed_args
&& uses_template_parms (arg
)))
4588 error ("template argument %qE involves template parameter(s)",
4592 /* Look at the corresponding template parameter,
4593 marking which template parameters its type depends
4595 tree type
= TREE_TYPE (parm
);
4599 /* We haven't yet initialized TPD2. Do so now. */
4600 tpd2
.arg_uses_template_parms
= XALLOCAVEC (int, nargs
);
4601 /* The number of parameters here is the number in the
4602 main template, which, as checked in the assertion
4604 tpd2
.parms
= XALLOCAVEC (int, nargs
);
4606 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (maintmpl
));
4609 /* Mark the template parameters. But this time, we're
4610 looking for the template parameters of the main
4611 template, not in the specialization. */
4612 tpd2
.current_arg
= i
;
4613 tpd2
.arg_uses_template_parms
[i
] = 0;
4614 memset (tpd2
.parms
, 0, sizeof (int) * nargs
);
4615 for_each_template_parm (type
,
4616 &mark_template_parm
,
4619 /*include_nondeduced_p=*/false);
4621 if (tpd2
.arg_uses_template_parms
[i
])
4623 /* The type depended on some template parameters.
4624 If they are fully specialized in the
4625 specialization, that's OK. */
4628 for (j
= 0; j
< nargs
; ++j
)
4629 if (tpd2
.parms
[j
] != 0
4630 && tpd
.arg_uses_template_parms
[j
])
4633 error_n (input_location
, count
,
4634 "type %qT of template argument %qE depends "
4635 "on a template parameter",
4636 "type %qT of template argument %qE depends "
4637 "on template parameters",
4646 /* We should only get here once. */
4647 if (TREE_CODE (decl
) == TYPE_DECL
)
4648 gcc_assert (!COMPLETE_TYPE_P (type
));
4650 // Build the template decl.
4651 tree tmpl
= build_template_decl (decl
, current_template_parms
,
4652 DECL_MEMBER_TEMPLATE_P (maintmpl
));
4653 TREE_TYPE (tmpl
) = type
;
4654 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
4655 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
4656 DECL_TEMPLATE_INFO (tmpl
) = build_template_info (maintmpl
, specargs
);
4657 DECL_PRIMARY_TEMPLATE (tmpl
) = maintmpl
;
4660 /* We didn't register this in check_explicit_specialization so we could
4661 wait until the constraints were set. */
4662 decl
= register_specialization (decl
, maintmpl
, specargs
, false, 0);
4664 associate_classtype_constraints (type
);
4666 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)
4667 = tree_cons (specargs
, tmpl
,
4668 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
));
4669 TREE_TYPE (DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)) = type
;
4671 for (inst
= DECL_TEMPLATE_INSTANTIATIONS (maintmpl
); inst
;
4672 inst
= TREE_CHAIN (inst
))
4674 tree instance
= TREE_VALUE (inst
);
4675 if (TYPE_P (instance
)
4676 ? (COMPLETE_TYPE_P (instance
)
4677 && CLASSTYPE_IMPLICIT_INSTANTIATION (instance
))
4678 : DECL_TEMPLATE_INSTANTIATION (instance
))
4680 tree spec
= most_specialized_partial_spec (instance
, tf_none
);
4681 tree inst_decl
= (DECL_P (instance
)
4682 ? instance
: TYPE_NAME (instance
));
4685 else if (spec
== error_mark_node
)
4686 permerror (input_location
,
4687 "declaration of %qD ambiguates earlier template "
4688 "instantiation for %qD", decl
, inst_decl
);
4689 else if (TREE_VALUE (spec
) == tmpl
)
4690 permerror (input_location
,
4691 "partial specialization of %qD after instantiation "
4692 "of %qD", decl
, inst_decl
);
4699 /* PARM is a template parameter of some form; return the corresponding
4700 TEMPLATE_PARM_INDEX. */
4703 get_template_parm_index (tree parm
)
4705 if (TREE_CODE (parm
) == PARM_DECL
4706 || TREE_CODE (parm
) == CONST_DECL
)
4707 parm
= DECL_INITIAL (parm
);
4708 else if (TREE_CODE (parm
) == TYPE_DECL
4709 || TREE_CODE (parm
) == TEMPLATE_DECL
)
4710 parm
= TREE_TYPE (parm
);
4711 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
4712 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
4713 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
)
4714 parm
= TEMPLATE_TYPE_PARM_INDEX (parm
);
4715 gcc_assert (TREE_CODE (parm
) == TEMPLATE_PARM_INDEX
);
4719 /* Subroutine of fixed_parameter_pack_p below. Look for any template
4720 parameter packs used by the template parameter PARM. */
4723 fixed_parameter_pack_p_1 (tree parm
, struct find_parameter_pack_data
*ppd
)
4725 /* A type parm can't refer to another parm. */
4726 if (TREE_CODE (parm
) == TYPE_DECL
)
4728 else if (TREE_CODE (parm
) == PARM_DECL
)
4730 cp_walk_tree (&TREE_TYPE (parm
), &find_parameter_packs_r
,
4735 gcc_assert (TREE_CODE (parm
) == TEMPLATE_DECL
);
4737 tree vec
= INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (parm
));
4738 for (int i
= 0; i
< TREE_VEC_LENGTH (vec
); ++i
)
4739 fixed_parameter_pack_p_1 (TREE_VALUE (TREE_VEC_ELT (vec
, i
)), ppd
);
4742 /* PARM is a template parameter pack. Return any parameter packs used in
4743 its type or the type of any of its template parameters. If there are
4744 any such packs, it will be instantiated into a fixed template parameter
4745 list by partial instantiation rather than be fully deduced. */
4748 fixed_parameter_pack_p (tree parm
)
4750 /* This can only be true in a member template. */
4751 if (TEMPLATE_PARM_ORIG_LEVEL (get_template_parm_index (parm
)) < 2)
4753 /* This can only be true for a parameter pack. */
4754 if (!template_parameter_pack_p (parm
))
4756 /* A type parm can't refer to another parm. */
4757 if (TREE_CODE (parm
) == TYPE_DECL
)
4760 tree parameter_packs
= NULL_TREE
;
4761 struct find_parameter_pack_data ppd
;
4762 ppd
.parameter_packs
= ¶meter_packs
;
4763 ppd
.visited
= new hash_set
<tree
>;
4764 ppd
.type_pack_expansion_p
= false;
4766 fixed_parameter_pack_p_1 (parm
, &ppd
);
4769 return parameter_packs
;
4772 /* Check that a template declaration's use of default arguments and
4773 parameter packs is not invalid. Here, PARMS are the template
4774 parameters. IS_PRIMARY is true if DECL is the thing declared by
4775 a primary template. IS_PARTIAL is true if DECL is a partial
4778 IS_FRIEND_DECL is nonzero if DECL is a friend function template
4779 declaration (but not a definition); 1 indicates a declaration, 2
4780 indicates a redeclaration. When IS_FRIEND_DECL=2, no errors are
4781 emitted for extraneous default arguments.
4783 Returns TRUE if there were no errors found, FALSE otherwise. */
4786 check_default_tmpl_args (tree decl
, tree parms
, bool is_primary
,
4787 bool is_partial
, int is_friend_decl
)
4790 int last_level_to_check
;
4792 bool no_errors
= true;
4796 A default template-argument shall not be specified in a
4797 function template declaration or a function template definition, nor
4798 in the template-parameter-list of the definition of a member of a
4801 if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == FUNCTION_DECL
4802 || (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_LOCAL_FUNCTION_P (decl
)))
4803 /* You can't have a function template declaration in a local
4804 scope, nor you can you define a member of a class template in a
4808 if ((TREE_CODE (decl
) == TYPE_DECL
4810 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
4811 || (TREE_CODE (decl
) == FUNCTION_DECL
4812 && LAMBDA_FUNCTION_P (decl
)))
4813 /* A lambda doesn't have an explicit declaration; don't complain
4814 about the parms of the enclosing class. */
4817 if (current_class_type
4818 && !TYPE_BEING_DEFINED (current_class_type
)
4819 && DECL_LANG_SPECIFIC (decl
)
4820 && DECL_DECLARES_FUNCTION_P (decl
)
4821 /* If this is either a friend defined in the scope of the class
4822 or a member function. */
4823 && (DECL_FUNCTION_MEMBER_P (decl
)
4824 ? same_type_p (DECL_CONTEXT (decl
), current_class_type
)
4825 : DECL_FRIEND_CONTEXT (decl
)
4826 ? same_type_p (DECL_FRIEND_CONTEXT (decl
), current_class_type
)
4828 /* And, if it was a member function, it really was defined in
4829 the scope of the class. */
4830 && (!DECL_FUNCTION_MEMBER_P (decl
)
4831 || DECL_INITIALIZED_IN_CLASS_P (decl
)))
4832 /* We already checked these parameters when the template was
4833 declared, so there's no need to do it again now. This function
4834 was defined in class scope, but we're processing its body now
4835 that the class is complete. */
4838 /* Core issue 226 (C++0x only): the following only applies to class
4841 && ((cxx_dialect
== cxx98
) || TREE_CODE (decl
) != FUNCTION_DECL
))
4845 If a template-parameter has a default template-argument, all
4846 subsequent template-parameters shall have a default
4847 template-argument supplied. */
4848 for (parm_level
= parms
; parm_level
; parm_level
= TREE_CHAIN (parm_level
))
4850 tree inner_parms
= TREE_VALUE (parm_level
);
4851 int ntparms
= TREE_VEC_LENGTH (inner_parms
);
4852 int seen_def_arg_p
= 0;
4855 for (i
= 0; i
< ntparms
; ++i
)
4857 tree parm
= TREE_VEC_ELT (inner_parms
, i
);
4859 if (parm
== error_mark_node
)
4862 if (TREE_PURPOSE (parm
))
4864 else if (seen_def_arg_p
4865 && !template_parameter_pack_p (TREE_VALUE (parm
)))
4867 error ("no default argument for %qD", TREE_VALUE (parm
));
4868 /* For better subsequent error-recovery, we indicate that
4869 there should have been a default argument. */
4870 TREE_PURPOSE (parm
) = error_mark_node
;
4873 else if (!is_partial
4875 /* Don't complain about an enclosing partial
4877 && parm_level
== parms
4878 && TREE_CODE (decl
) == TYPE_DECL
4880 && template_parameter_pack_p (TREE_VALUE (parm
))
4881 /* A fixed parameter pack will be partially
4882 instantiated into a fixed length list. */
4883 && !fixed_parameter_pack_p (TREE_VALUE (parm
)))
4885 /* A primary class template can only have one
4886 parameter pack, at the end of the template
4889 error ("parameter pack %q+D must be at the end of the"
4890 " template parameter list", TREE_VALUE (parm
));
4892 TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
))
4900 if (((cxx_dialect
== cxx98
) && TREE_CODE (decl
) != TYPE_DECL
)
4904 /* For an ordinary class template, default template arguments are
4905 allowed at the innermost level, e.g.:
4906 template <class T = int>
4908 but, in a partial specialization, they're not allowed even
4909 there, as we have in [temp.class.spec]:
4911 The template parameter list of a specialization shall not
4912 contain default template argument values.
4914 So, for a partial specialization, or for a function template
4915 (in C++98/C++03), we look at all of them. */
4918 /* But, for a primary class template that is not a partial
4919 specialization we look at all template parameters except the
4921 parms
= TREE_CHAIN (parms
);
4923 /* Figure out what error message to issue. */
4924 if (is_friend_decl
== 2)
4925 msg
= G_("default template arguments may not be used in function template "
4926 "friend re-declaration");
4927 else if (is_friend_decl
)
4928 msg
= G_("default template arguments may not be used in function template "
4929 "friend declarations");
4930 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& (cxx_dialect
== cxx98
))
4931 msg
= G_("default template arguments may not be used in function templates "
4932 "without -std=c++11 or -std=gnu++11");
4933 else if (is_partial
)
4934 msg
= G_("default template arguments may not be used in "
4935 "partial specializations");
4936 else if (current_class_type
&& CLASSTYPE_IS_TEMPLATE (current_class_type
))
4937 msg
= G_("default argument for template parameter for class enclosing %qD");
4939 /* Per [temp.param]/9, "A default template-argument shall not be
4940 specified in the template-parameter-lists of the definition of
4941 a member of a class template that appears outside of the member's
4942 class.", thus if we aren't handling a member of a class template
4943 there is no need to examine the parameters. */
4946 if (current_class_type
&& TYPE_BEING_DEFINED (current_class_type
))
4947 /* If we're inside a class definition, there's no need to
4948 examine the parameters to the class itself. On the one
4949 hand, they will be checked when the class is defined, and,
4950 on the other, default arguments are valid in things like:
4951 template <class T = double>
4952 struct S { template <class U> void f(U); };
4953 Here the default argument for `S' has no bearing on the
4954 declaration of `f'. */
4955 last_level_to_check
= template_class_depth (current_class_type
) + 1;
4957 /* Check everything. */
4958 last_level_to_check
= 0;
4960 for (parm_level
= parms
;
4961 parm_level
&& TMPL_PARMS_DEPTH (parm_level
) >= last_level_to_check
;
4962 parm_level
= TREE_CHAIN (parm_level
))
4964 tree inner_parms
= TREE_VALUE (parm_level
);
4968 ntparms
= TREE_VEC_LENGTH (inner_parms
);
4969 for (i
= 0; i
< ntparms
; ++i
)
4971 if (TREE_VEC_ELT (inner_parms
, i
) == error_mark_node
)
4974 if (TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)))
4979 if (is_friend_decl
== 2)
4986 /* Clear out the default argument so that we are not
4988 TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)) = NULL_TREE
;
4992 /* At this point, if we're still interested in issuing messages,
4993 they must apply to classes surrounding the object declared. */
4995 msg
= G_("default argument for template parameter for class "
5002 /* Worker for push_template_decl_real, called via
5003 for_each_template_parm. DATA is really an int, indicating the
5004 level of the parameters we are interested in. If T is a template
5005 parameter of that level, return nonzero. */
5008 template_parm_this_level_p (tree t
, void* data
)
5010 int this_level
= *(int *)data
;
5013 if (TREE_CODE (t
) == TEMPLATE_PARM_INDEX
)
5014 level
= TEMPLATE_PARM_LEVEL (t
);
5016 level
= TEMPLATE_TYPE_LEVEL (t
);
5017 return level
== this_level
;
5020 /* Creates a TEMPLATE_DECL for the indicated DECL using the template
5021 parameters given by current_template_args, or reuses a
5022 previously existing one, if appropriate. Returns the DECL, or an
5023 equivalent one, if it is replaced via a call to duplicate_decls.
5025 If IS_FRIEND is true, DECL is a friend declaration. */
5028 push_template_decl_real (tree decl
, bool is_friend
)
5036 int new_template_p
= 0;
5037 /* True if the template is a member template, in the sense of
5039 bool member_template_p
= false;
5041 if (decl
== error_mark_node
|| !current_template_parms
)
5042 return error_mark_node
;
5044 /* See if this is a partial specialization. */
5045 is_partial
= ((DECL_IMPLICIT_TYPEDEF_P (decl
)
5046 && TREE_CODE (TREE_TYPE (decl
)) != ENUMERAL_TYPE
5047 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)))
5049 && DECL_LANG_SPECIFIC (decl
)
5050 && DECL_TEMPLATE_SPECIALIZATION (decl
)
5051 && TINFO_USED_TEMPLATE_ID (DECL_TEMPLATE_INFO (decl
))));
5053 if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_FRIEND_P (decl
))
5057 /* For a friend, we want the context of the friend function, not
5058 the type of which it is a friend. */
5059 ctx
= CP_DECL_CONTEXT (decl
);
5060 else if (CP_DECL_CONTEXT (decl
)
5061 && TREE_CODE (CP_DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
5062 /* In the case of a virtual function, we want the class in which
5064 ctx
= CP_DECL_CONTEXT (decl
);
5066 /* Otherwise, if we're currently defining some class, the DECL
5067 is assumed to be a member of the class. */
5068 ctx
= current_scope ();
5070 if (ctx
&& TREE_CODE (ctx
) == NAMESPACE_DECL
)
5073 if (!DECL_CONTEXT (decl
))
5074 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
5076 /* See if this is a primary template. */
5077 if (is_friend
&& ctx
5078 && uses_template_parms_level (ctx
, processing_template_decl
))
5079 /* A friend template that specifies a class context, i.e.
5080 template <typename T> friend void A<T>::f();
5083 else if (TREE_CODE (decl
) == TYPE_DECL
5084 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
5087 is_primary
= template_parm_scope_p ();
5091 warning (OPT_Wtemplates
, "template %qD declared", decl
);
5093 if (DECL_CLASS_SCOPE_P (decl
))
5094 member_template_p
= true;
5095 if (TREE_CODE (decl
) == TYPE_DECL
5096 && anon_aggrname_p (DECL_NAME (decl
)))
5098 error ("template class without a name");
5099 return error_mark_node
;
5101 else if (TREE_CODE (decl
) == FUNCTION_DECL
)
5103 if (member_template_p
)
5105 if (DECL_OVERRIDE_P (decl
) || DECL_FINAL_P (decl
))
5106 error ("member template %qD may not have virt-specifiers", decl
);
5108 if (DECL_DESTRUCTOR_P (decl
))
5112 A destructor shall not be a member template. */
5113 error ("destructor %qD declared as member template", decl
);
5114 return error_mark_node
;
5116 if (NEW_DELETE_OPNAME_P (DECL_NAME (decl
))
5117 && (!prototype_p (TREE_TYPE (decl
))
5118 || TYPE_ARG_TYPES (TREE_TYPE (decl
)) == void_list_node
5119 || !TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)))
5120 || (TREE_CHAIN (TYPE_ARG_TYPES ((TREE_TYPE (decl
))))
5121 == void_list_node
)))
5123 /* [basic.stc.dynamic.allocation]
5125 An allocation function can be a function
5126 template. ... Template allocation functions shall
5127 have two or more parameters. */
5128 error ("invalid template declaration of %qD", decl
);
5129 return error_mark_node
;
5132 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
5133 && CLASS_TYPE_P (TREE_TYPE (decl
)))
5135 else if (TREE_CODE (decl
) == TYPE_DECL
5136 && TYPE_DECL_ALIAS_P (decl
))
5137 /* alias-declaration */
5138 gcc_assert (!DECL_ARTIFICIAL (decl
));
5139 else if (VAR_P (decl
))
5140 /* C++14 variable template. */;
5143 error ("template declaration of %q#D", decl
);
5144 return error_mark_node
;
5148 /* Check to see that the rules regarding the use of default
5149 arguments are not being violated. */
5150 check_default_tmpl_args (decl
, current_template_parms
,
5151 is_primary
, is_partial
, /*is_friend_decl=*/0);
5153 /* Ensure that there are no parameter packs in the type of this
5154 declaration that have not been expanded. */
5155 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5157 /* Check each of the arguments individually to see if there are
5158 any bare parameter packs. */
5159 tree type
= TREE_TYPE (decl
);
5160 tree arg
= DECL_ARGUMENTS (decl
);
5161 tree argtype
= TYPE_ARG_TYPES (type
);
5163 while (arg
&& argtype
)
5165 if (!DECL_PACK_P (arg
)
5166 && check_for_bare_parameter_packs (TREE_TYPE (arg
)))
5168 /* This is a PARM_DECL that contains unexpanded parameter
5169 packs. We have already complained about this in the
5170 check_for_bare_parameter_packs call, so just replace
5171 these types with ERROR_MARK_NODE. */
5172 TREE_TYPE (arg
) = error_mark_node
;
5173 TREE_VALUE (argtype
) = error_mark_node
;
5176 arg
= DECL_CHAIN (arg
);
5177 argtype
= TREE_CHAIN (argtype
);
5180 /* Check for bare parameter packs in the return type and the
5181 exception specifiers. */
5182 if (check_for_bare_parameter_packs (TREE_TYPE (type
)))
5183 /* Errors were already issued, set return type to int
5184 as the frontend doesn't expect error_mark_node as
5186 TREE_TYPE (type
) = integer_type_node
;
5187 if (check_for_bare_parameter_packs (TYPE_RAISES_EXCEPTIONS (type
)))
5188 TYPE_RAISES_EXCEPTIONS (type
) = NULL_TREE
;
5190 else if (check_for_bare_parameter_packs ((TREE_CODE (decl
) == TYPE_DECL
5191 && TYPE_DECL_ALIAS_P (decl
))
5192 ? DECL_ORIGINAL_TYPE (decl
)
5193 : TREE_TYPE (decl
)))
5195 TREE_TYPE (decl
) = error_mark_node
;
5196 return error_mark_node
;
5200 return process_partial_specialization (decl
);
5202 args
= current_template_args ();
5205 || TREE_CODE (ctx
) == FUNCTION_DECL
5206 || (CLASS_TYPE_P (ctx
) && TYPE_BEING_DEFINED (ctx
))
5207 || (TREE_CODE (decl
) == TYPE_DECL
5208 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
5209 || (is_friend
&& !DECL_TEMPLATE_INFO (decl
)))
5211 if (DECL_LANG_SPECIFIC (decl
)
5212 && DECL_TEMPLATE_INFO (decl
)
5213 && DECL_TI_TEMPLATE (decl
))
5214 tmpl
= DECL_TI_TEMPLATE (decl
);
5215 /* If DECL is a TYPE_DECL for a class-template, then there won't
5216 be DECL_LANG_SPECIFIC. The information equivalent to
5217 DECL_TEMPLATE_INFO is found in TYPE_TEMPLATE_INFO instead. */
5218 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
5219 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl
))
5220 && TYPE_TI_TEMPLATE (TREE_TYPE (decl
)))
5222 /* Since a template declaration already existed for this
5223 class-type, we must be redeclaring it here. Make sure
5224 that the redeclaration is valid. */
5225 redeclare_class_template (TREE_TYPE (decl
),
5226 current_template_parms
,
5227 current_template_constraints ());
5228 /* We don't need to create a new TEMPLATE_DECL; just use the
5229 one we already had. */
5230 tmpl
= TYPE_TI_TEMPLATE (TREE_TYPE (decl
));
5234 tmpl
= build_template_decl (decl
, current_template_parms
,
5238 if (DECL_LANG_SPECIFIC (decl
)
5239 && DECL_TEMPLATE_SPECIALIZATION (decl
))
5241 /* A specialization of a member template of a template
5243 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
5244 DECL_TEMPLATE_INFO (tmpl
) = DECL_TEMPLATE_INFO (decl
);
5245 DECL_TEMPLATE_INFO (decl
) = NULL_TREE
;
5251 tree a
, t
, current
, parms
;
5253 tree tinfo
= get_template_info (decl
);
5257 error ("template definition of non-template %q#D", decl
);
5258 return error_mark_node
;
5261 tmpl
= TI_TEMPLATE (tinfo
);
5263 if (DECL_FUNCTION_TEMPLATE_P (tmpl
)
5264 && DECL_TEMPLATE_INFO (decl
) && DECL_TI_ARGS (decl
)
5265 && DECL_TEMPLATE_SPECIALIZATION (decl
)
5266 && DECL_MEMBER_TEMPLATE_P (tmpl
))
5270 /* The declaration is a specialization of a member
5271 template, declared outside the class. Therefore, the
5272 innermost template arguments will be NULL, so we
5273 replace them with the arguments determined by the
5274 earlier call to check_explicit_specialization. */
5275 args
= DECL_TI_ARGS (decl
);
5278 = build_template_decl (decl
, current_template_parms
,
5280 DECL_TEMPLATE_RESULT (new_tmpl
) = decl
;
5281 TREE_TYPE (new_tmpl
) = TREE_TYPE (decl
);
5282 DECL_TI_TEMPLATE (decl
) = new_tmpl
;
5283 SET_DECL_TEMPLATE_SPECIALIZATION (new_tmpl
);
5284 DECL_TEMPLATE_INFO (new_tmpl
)
5285 = build_template_info (tmpl
, args
);
5287 register_specialization (new_tmpl
,
5288 most_general_template (tmpl
),
5294 /* Make sure the template headers we got make sense. */
5296 parms
= DECL_TEMPLATE_PARMS (tmpl
);
5297 i
= TMPL_PARMS_DEPTH (parms
);
5298 if (TMPL_ARGS_DEPTH (args
) != i
)
5300 error ("expected %d levels of template parms for %q#D, got %d",
5301 i
, decl
, TMPL_ARGS_DEPTH (args
));
5302 DECL_INTERFACE_KNOWN (decl
) = 1;
5303 return error_mark_node
;
5306 for (current
= decl
; i
> 0; --i
, parms
= TREE_CHAIN (parms
))
5308 a
= TMPL_ARGS_LEVEL (args
, i
);
5309 t
= INNERMOST_TEMPLATE_PARMS (parms
);
5311 if (TREE_VEC_LENGTH (t
) != TREE_VEC_LENGTH (a
))
5313 if (current
== decl
)
5314 error ("got %d template parameters for %q#D",
5315 TREE_VEC_LENGTH (a
), decl
);
5317 error ("got %d template parameters for %q#T",
5318 TREE_VEC_LENGTH (a
), current
);
5319 error (" but %d required", TREE_VEC_LENGTH (t
));
5320 /* Avoid crash in import_export_decl. */
5321 DECL_INTERFACE_KNOWN (decl
) = 1;
5322 return error_mark_node
;
5325 if (current
== decl
)
5327 else if (current
== NULL_TREE
)
5328 /* Can happen in erroneous input. */
5331 current
= get_containing_scope (current
);
5334 /* Check that the parms are used in the appropriate qualifying scopes
5335 in the declarator. */
5336 if (!comp_template_args
5338 TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (tmpl
)))))
5341 template arguments to %qD do not match original template %qD",
5342 decl
, DECL_TEMPLATE_RESULT (tmpl
));
5343 if (!uses_template_parms (TI_ARGS (tinfo
)))
5344 inform (input_location
, "use template<> for an explicit specialization");
5345 /* Avoid crash in import_export_decl. */
5346 DECL_INTERFACE_KNOWN (decl
) = 1;
5347 return error_mark_node
;
5351 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
5352 TREE_TYPE (tmpl
) = TREE_TYPE (decl
);
5354 /* Push template declarations for global functions and types. Note
5355 that we do not try to push a global template friend declared in a
5356 template class; such a thing may well depend on the template
5357 parameters of the class. */
5358 if (new_template_p
&& !ctx
5359 && !(is_friend
&& template_class_depth (current_class_type
) > 0))
5361 tmpl
= pushdecl_namespace_level (tmpl
, is_friend
);
5362 if (tmpl
== error_mark_node
)
5363 return error_mark_node
;
5365 /* Hide template friend classes that haven't been declared yet. */
5366 if (is_friend
&& TREE_CODE (decl
) == TYPE_DECL
)
5368 DECL_ANTICIPATED (tmpl
) = 1;
5369 DECL_FRIEND_P (tmpl
) = 1;
5375 tree parms
= DECL_TEMPLATE_PARMS (tmpl
);
5378 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
5379 if (DECL_CONV_FN_P (tmpl
))
5381 int depth
= TMPL_PARMS_DEPTH (parms
);
5383 /* It is a conversion operator. See if the type converted to
5384 depends on innermost template operands. */
5386 if (uses_template_parms_level (TREE_TYPE (TREE_TYPE (tmpl
)),
5388 DECL_TEMPLATE_CONV_FN_P (tmpl
) = 1;
5391 /* Give template template parms a DECL_CONTEXT of the template
5392 for which they are a parameter. */
5393 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
5394 for (i
= TREE_VEC_LENGTH (parms
) - 1; i
>= 0; --i
)
5396 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
5397 if (TREE_CODE (parm
) == TEMPLATE_DECL
)
5398 DECL_CONTEXT (parm
) = tmpl
;
5401 if (TREE_CODE (decl
) == TYPE_DECL
5402 && TYPE_DECL_ALIAS_P (decl
)
5403 && complex_alias_template_p (tmpl
))
5404 TEMPLATE_DECL_COMPLEX_ALIAS_P (tmpl
) = true;
5407 /* The DECL_TI_ARGS of DECL contains full set of arguments referring
5408 back to its most general template. If TMPL is a specialization,
5409 ARGS may only have the innermost set of arguments. Add the missing
5410 argument levels if necessary. */
5411 if (DECL_TEMPLATE_INFO (tmpl
))
5412 args
= add_outermost_template_args (DECL_TI_ARGS (tmpl
), args
);
5414 info
= build_template_info (tmpl
, args
);
5416 if (DECL_IMPLICIT_TYPEDEF_P (decl
))
5417 SET_TYPE_TEMPLATE_INFO (TREE_TYPE (tmpl
), info
);
5420 if (is_primary
&& !DECL_LANG_SPECIFIC (decl
))
5421 retrofit_lang_decl (decl
);
5422 if (DECL_LANG_SPECIFIC (decl
))
5423 DECL_TEMPLATE_INFO (decl
) = info
;
5426 if (flag_implicit_templates
5428 && TREE_PUBLIC (decl
)
5429 && VAR_OR_FUNCTION_DECL_P (decl
))
5430 /* Set DECL_COMDAT on template instantiations; if we force
5431 them to be emitted by explicit instantiation or -frepo,
5432 mark_needed will tell cgraph to do the right thing. */
5433 DECL_COMDAT (decl
) = true;
5435 return DECL_TEMPLATE_RESULT (tmpl
);
5439 push_template_decl (tree decl
)
5441 return push_template_decl_real (decl
, false);
5444 /* FN is an inheriting constructor that inherits from the constructor
5445 template INHERITED; turn FN into a constructor template with a matching
5449 add_inherited_template_parms (tree fn
, tree inherited
)
5452 = INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (inherited
));
5453 inner_parms
= copy_node (inner_parms
);
5455 = tree_cons (size_int (processing_template_decl
+ 1),
5456 inner_parms
, current_template_parms
);
5457 tree tmpl
= build_template_decl (fn
, parms
, /*member*/true);
5458 tree args
= template_parms_to_args (parms
);
5459 DECL_TEMPLATE_INFO (fn
) = build_template_info (tmpl
, args
);
5460 TREE_TYPE (tmpl
) = TREE_TYPE (fn
);
5461 DECL_TEMPLATE_RESULT (tmpl
) = fn
;
5462 DECL_ARTIFICIAL (tmpl
) = true;
5463 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
5467 /* Called when a class template TYPE is redeclared with the indicated
5468 template PARMS, e.g.:
5470 template <class T> struct S;
5471 template <class T> struct S {}; */
5474 redeclare_class_template (tree type
, tree parms
, tree cons
)
5480 if (!TYPE_TEMPLATE_INFO (type
))
5482 error ("%qT is not a template type", type
);
5486 tmpl
= TYPE_TI_TEMPLATE (type
);
5487 if (!PRIMARY_TEMPLATE_P (tmpl
))
5488 /* The type is nested in some template class. Nothing to worry
5489 about here; there are no new template parameters for the nested
5495 error ("template specifiers not specified in declaration of %qD",
5500 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
5501 tmpl_parms
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl
);
5503 if (TREE_VEC_LENGTH (parms
) != TREE_VEC_LENGTH (tmpl_parms
))
5505 error_n (input_location
, TREE_VEC_LENGTH (parms
),
5506 "redeclared with %d template parameter",
5507 "redeclared with %d template parameters",
5508 TREE_VEC_LENGTH (parms
));
5509 inform_n (DECL_SOURCE_LOCATION (tmpl
), TREE_VEC_LENGTH (tmpl_parms
),
5510 "previous declaration %qD used %d template parameter",
5511 "previous declaration %qD used %d template parameters",
5512 tmpl
, TREE_VEC_LENGTH (tmpl_parms
));
5516 for (i
= 0; i
< TREE_VEC_LENGTH (tmpl_parms
); ++i
)
5523 if (TREE_VEC_ELT (tmpl_parms
, i
) == error_mark_node
5524 || TREE_VEC_ELT (parms
, i
) == error_mark_node
)
5527 tmpl_parm
= TREE_VALUE (TREE_VEC_ELT (tmpl_parms
, i
));
5528 if (error_operand_p (tmpl_parm
))
5531 parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
5532 tmpl_default
= TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
));
5533 parm_default
= TREE_PURPOSE (TREE_VEC_ELT (parms
, i
));
5535 /* TMPL_PARM and PARM can be either TYPE_DECL, PARM_DECL, or
5537 if (TREE_CODE (tmpl_parm
) != TREE_CODE (parm
)
5538 || (TREE_CODE (tmpl_parm
) != TYPE_DECL
5539 && !same_type_p (TREE_TYPE (tmpl_parm
), TREE_TYPE (parm
)))
5540 || (TREE_CODE (tmpl_parm
) != PARM_DECL
5541 && (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (tmpl_parm
))
5542 != TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
))))
5543 || (TREE_CODE (tmpl_parm
) == PARM_DECL
5544 && (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (tmpl_parm
))
5545 != TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))))
5547 error ("template parameter %q+#D", tmpl_parm
);
5548 error ("redeclared here as %q#D", parm
);
5552 if (tmpl_default
!= NULL_TREE
&& parm_default
!= NULL_TREE
)
5554 /* We have in [temp.param]:
5556 A template-parameter may not be given default arguments
5557 by two different declarations in the same scope. */
5558 error_at (input_location
, "redefinition of default argument for %q#D", parm
);
5559 inform (DECL_SOURCE_LOCATION (tmpl_parm
),
5560 "original definition appeared here");
5564 if (parm_default
!= NULL_TREE
)
5565 /* Update the previous template parameters (which are the ones
5566 that will really count) with the new default value. */
5567 TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
)) = parm_default
;
5568 else if (tmpl_default
!= NULL_TREE
)
5569 /* Update the new parameters, too; they'll be used as the
5570 parameters for any members. */
5571 TREE_PURPOSE (TREE_VEC_ELT (parms
, i
)) = tmpl_default
;
5573 /* Give each template template parm in this redeclaration a
5574 DECL_CONTEXT of the template for which they are a parameter. */
5575 if (TREE_CODE (parm
) == TEMPLATE_DECL
)
5577 gcc_assert (DECL_CONTEXT (parm
) == NULL_TREE
);
5578 DECL_CONTEXT (parm
) = tmpl
;
5582 // Cannot redeclare a class template with a different set of constraints.
5583 if (!equivalent_constraints (get_constraints (tmpl
), cons
))
5585 error_at (input_location
, "redeclaration %q#D with different "
5586 "constraints", tmpl
);
5587 inform (DECL_SOURCE_LOCATION (tmpl
),
5588 "original declaration appeared here");
5594 /* The actual substitution part of instantiate_non_dependent_expr_sfinae,
5595 to be used when the caller has already checked
5596 (processing_template_decl
5597 && !instantiation_dependent_expression_p (expr)
5598 && potential_constant_expression (expr))
5599 and cleared processing_template_decl. */
5602 instantiate_non_dependent_expr_internal (tree expr
, tsubst_flags_t complain
)
5604 return tsubst_copy_and_build (expr
,
5607 /*in_decl=*/NULL_TREE
,
5608 /*function_p=*/false,
5609 /*integral_constant_expression_p=*/true);
5612 /* Simplify EXPR if it is a non-dependent expression. Returns the
5613 (possibly simplified) expression. */
5616 instantiate_non_dependent_expr_sfinae (tree expr
, tsubst_flags_t complain
)
5618 if (expr
== NULL_TREE
)
5621 /* If we're in a template, but EXPR isn't value dependent, simplify
5622 it. We're supposed to treat:
5624 template <typename T> void f(T[1 + 1]);
5625 template <typename T> void f(T[2]);
5627 as two declarations of the same function, for example. */
5628 if (processing_template_decl
5629 && !instantiation_dependent_expression_p (expr
)
5630 && potential_constant_expression (expr
))
5632 processing_template_decl_sentinel s
;
5633 expr
= instantiate_non_dependent_expr_internal (expr
, complain
);
5639 instantiate_non_dependent_expr (tree expr
)
5641 return instantiate_non_dependent_expr_sfinae (expr
, tf_error
);
5644 /* True iff T is a specialization of a variable template. */
5647 variable_template_specialization_p (tree t
)
5649 if (!VAR_P (t
) || !DECL_LANG_SPECIFIC (t
) || !DECL_TEMPLATE_INFO (t
))
5651 tree tmpl
= DECL_TI_TEMPLATE (t
);
5652 return variable_template_p (tmpl
);
5655 /* Return TRUE iff T is a type alias, a TEMPLATE_DECL for an alias
5656 template declaration, or a TYPE_DECL for an alias declaration. */
5659 alias_type_or_template_p (tree t
)
5663 return ((TREE_CODE (t
) == TYPE_DECL
&& TYPE_DECL_ALIAS_P (t
))
5666 && TYPE_DECL_ALIAS_P (TYPE_NAME (t
)))
5667 || DECL_ALIAS_TEMPLATE_P (t
));
5670 /* Return TRUE iff T is a specialization of an alias template. */
5673 alias_template_specialization_p (const_tree t
)
5675 /* It's an alias template specialization if it's an alias and its
5676 TYPE_NAME is a specialization of a primary template. */
5677 if (TYPE_ALIAS_P (t
))
5679 tree name
= TYPE_NAME (t
);
5680 if (DECL_LANG_SPECIFIC (name
))
5681 if (tree ti
= DECL_TEMPLATE_INFO (name
))
5683 tree tmpl
= TI_TEMPLATE (ti
);
5684 return PRIMARY_TEMPLATE_P (tmpl
);
5690 /* An alias template is complex from a SFINAE perspective if a template-id
5691 using that alias can be ill-formed when the expansion is not, as with
5692 the void_t template. We determine this by checking whether the
5693 expansion for the alias template uses all its template parameters. */
5695 struct uses_all_template_parms_data
5702 uses_all_template_parms_r (tree t
, void *data_
)
5704 struct uses_all_template_parms_data
&data
5705 = *(struct uses_all_template_parms_data
*)data_
;
5706 tree idx
= get_template_parm_index (t
);
5708 if (TEMPLATE_PARM_LEVEL (idx
) == data
.level
)
5709 data
.seen
[TEMPLATE_PARM_IDX (idx
)] = true;
5714 complex_alias_template_p (const_tree tmpl
)
5716 struct uses_all_template_parms_data data
;
5717 tree pat
= DECL_ORIGINAL_TYPE (DECL_TEMPLATE_RESULT (tmpl
));
5718 tree parms
= DECL_TEMPLATE_PARMS (tmpl
);
5719 data
.level
= TMPL_PARMS_DEPTH (parms
);
5720 int len
= TREE_VEC_LENGTH (INNERMOST_TEMPLATE_PARMS (parms
));
5721 data
.seen
= XALLOCAVEC (bool, len
);
5722 for (int i
= 0; i
< len
; ++i
)
5723 data
.seen
[i
] = false;
5725 for_each_template_parm (pat
, uses_all_template_parms_r
, &data
, NULL
, true);
5726 for (int i
= 0; i
< len
; ++i
)
5732 /* Return TRUE iff T is a specialization of a complex alias template with
5733 dependent template-arguments. */
5736 dependent_alias_template_spec_p (const_tree t
)
5738 return (alias_template_specialization_p (t
)
5739 && TEMPLATE_DECL_COMPLEX_ALIAS_P (DECL_TI_TEMPLATE (TYPE_NAME (t
)))
5740 && (any_dependent_template_arguments_p
5741 (INNERMOST_TEMPLATE_ARGS (TYPE_TI_ARGS (t
)))));
5744 /* Return the number of innermost template parameters in TMPL. */
5747 num_innermost_template_parms (tree tmpl
)
5749 tree parms
= INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (tmpl
));
5750 return TREE_VEC_LENGTH (parms
);
5753 /* Return either TMPL or another template that it is equivalent to under DR
5754 1286: An alias that just changes the name of a template is equivalent to
5755 the other template. */
5758 get_underlying_template (tree tmpl
)
5760 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
);
5761 while (DECL_ALIAS_TEMPLATE_P (tmpl
))
5763 tree result
= DECL_ORIGINAL_TYPE (DECL_TEMPLATE_RESULT (tmpl
));
5764 if (TYPE_TEMPLATE_INFO (result
))
5766 tree sub
= TYPE_TI_TEMPLATE (result
);
5767 if (PRIMARY_TEMPLATE_P (sub
)
5768 && (num_innermost_template_parms (tmpl
)
5769 == num_innermost_template_parms (sub
)))
5771 tree alias_args
= INNERMOST_TEMPLATE_ARGS
5772 (template_parms_to_args (DECL_TEMPLATE_PARMS (tmpl
)));
5773 if (!comp_template_args (TYPE_TI_ARGS (result
), alias_args
))
5775 /* The alias type is equivalent to the pattern of the
5776 underlying template, so strip the alias. */
5786 /* Subroutine of convert_nontype_argument. Converts EXPR to TYPE, which
5787 must be a function or a pointer-to-function type, as specified
5788 in [temp.arg.nontype]: disambiguate EXPR if it is an overload set,
5789 and check that the resulting function has external linkage. */
5792 convert_nontype_argument_function (tree type
, tree expr
,
5793 tsubst_flags_t complain
)
5797 linkage_kind linkage
;
5799 fn
= instantiate_type (type
, fns
, tf_none
);
5800 if (fn
== error_mark_node
)
5801 return error_mark_node
;
5804 if (TREE_CODE (fn_no_ptr
) == ADDR_EXPR
)
5805 fn_no_ptr
= TREE_OPERAND (fn_no_ptr
, 0);
5806 if (BASELINK_P (fn_no_ptr
))
5807 fn_no_ptr
= BASELINK_FUNCTIONS (fn_no_ptr
);
5809 /* [temp.arg.nontype]/1
5811 A template-argument for a non-type, non-template template-parameter
5814 -- the address of an object or function with external [C++11: or
5815 internal] linkage. */
5817 if (TREE_CODE (fn_no_ptr
) != FUNCTION_DECL
)
5819 if (complain
& tf_error
)
5821 error ("%qE is not a valid template argument for type %qT",
5823 if (TYPE_PTR_P (type
))
5824 error ("it must be the address of a function with "
5825 "external linkage");
5827 error ("it must be the name of a function with "
5828 "external linkage");
5833 linkage
= decl_linkage (fn_no_ptr
);
5834 if (cxx_dialect
>= cxx11
? linkage
== lk_none
: linkage
!= lk_external
)
5836 if (complain
& tf_error
)
5838 if (cxx_dialect
>= cxx11
)
5839 error ("%qE is not a valid template argument for type %qT "
5840 "because %qD has no linkage",
5841 expr
, type
, fn_no_ptr
);
5843 error ("%qE is not a valid template argument for type %qT "
5844 "because %qD does not have external linkage",
5845 expr
, type
, fn_no_ptr
);
5853 /* Subroutine of convert_nontype_argument.
5854 Check if EXPR of type TYPE is a valid pointer-to-member constant.
5855 Emit an error otherwise. */
5858 check_valid_ptrmem_cst_expr (tree type
, tree expr
,
5859 tsubst_flags_t complain
)
5862 if (expr
&& (null_ptr_cst_p (expr
) || TREE_CODE (expr
) == PTRMEM_CST
))
5864 if (cxx_dialect
>= cxx11
&& null_member_pointer_value_p (expr
))
5866 if (processing_template_decl
5867 && TREE_CODE (expr
) == ADDR_EXPR
5868 && TREE_CODE (TREE_OPERAND (expr
, 0)) == OFFSET_REF
)
5870 if (complain
& tf_error
)
5872 error ("%qE is not a valid template argument for type %qT",
5874 error ("it must be a pointer-to-member of the form %<&X::Y%>");
5879 /* Returns TRUE iff the address of OP is value-dependent.
5881 14.6.2.4 [temp.dep.temp]:
5882 A non-integral non-type template-argument is dependent if its type is
5883 dependent or it has either of the following forms
5886 and contains a nested-name-specifier which specifies a class-name that
5887 names a dependent type.
5889 We generalize this to just say that the address of a member of a
5890 dependent class is value-dependent; the above doesn't cover the
5891 address of a static data member named with an unqualified-id. */
5894 has_value_dependent_address (tree op
)
5896 /* We could use get_inner_reference here, but there's no need;
5897 this is only relevant for template non-type arguments, which
5898 can only be expressed as &id-expression. */
5901 tree ctx
= CP_DECL_CONTEXT (op
);
5902 if (TYPE_P (ctx
) && dependent_type_p (ctx
))
5909 /* The next set of functions are used for providing helpful explanatory
5910 diagnostics for failed overload resolution. Their messages should be
5911 indented by two spaces for consistency with the messages in
5915 unify_success (bool /*explain_p*/)
5921 unify_parameter_deduction_failure (bool explain_p
, tree parm
)
5924 inform (input_location
,
5925 " couldn't deduce template parameter %qD", parm
);
5930 unify_invalid (bool /*explain_p*/)
5936 unify_cv_qual_mismatch (bool explain_p
, tree parm
, tree arg
)
5939 inform (input_location
,
5940 " types %qT and %qT have incompatible cv-qualifiers",
5946 unify_type_mismatch (bool explain_p
, tree parm
, tree arg
)
5949 inform (input_location
, " mismatched types %qT and %qT", parm
, arg
);
5954 unify_parameter_pack_mismatch (bool explain_p
, tree parm
, tree arg
)
5957 inform (input_location
,
5958 " template parameter %qD is not a parameter pack, but "
5965 unify_ptrmem_cst_mismatch (bool explain_p
, tree parm
, tree arg
)
5968 inform (input_location
,
5969 " template argument %qE does not match "
5970 "pointer-to-member constant %qE",
5976 unify_expression_unequal (bool explain_p
, tree parm
, tree arg
)
5979 inform (input_location
, " %qE is not equivalent to %qE", parm
, arg
);
5984 unify_parameter_pack_inconsistent (bool explain_p
, tree old_arg
, tree new_arg
)
5987 inform (input_location
,
5988 " inconsistent parameter pack deduction with %qT and %qT",
5994 unify_inconsistency (bool explain_p
, tree parm
, tree first
, tree second
)
5999 inform (input_location
,
6000 " deduced conflicting types for parameter %qT (%qT and %qT)",
6001 parm
, first
, second
);
6003 inform (input_location
,
6004 " deduced conflicting values for non-type parameter "
6005 "%qE (%qE and %qE)", parm
, first
, second
);
6011 unify_vla_arg (bool explain_p
, tree arg
)
6014 inform (input_location
,
6015 " variable-sized array type %qT is not "
6016 "a valid template argument",
6022 unify_method_type_error (bool explain_p
, tree arg
)
6025 inform (input_location
,
6026 " member function type %qT is not a valid template argument",
6032 unify_arity (bool explain_p
, int have
, int wanted
, bool least_p
= false)
6037 inform_n (input_location
, wanted
,
6038 " candidate expects at least %d argument, %d provided",
6039 " candidate expects at least %d arguments, %d provided",
6042 inform_n (input_location
, wanted
,
6043 " candidate expects %d argument, %d provided",
6044 " candidate expects %d arguments, %d provided",
6051 unify_too_many_arguments (bool explain_p
, int have
, int wanted
)
6053 return unify_arity (explain_p
, have
, wanted
);
6057 unify_too_few_arguments (bool explain_p
, int have
, int wanted
,
6058 bool least_p
= false)
6060 return unify_arity (explain_p
, have
, wanted
, least_p
);
6064 unify_arg_conversion (bool explain_p
, tree to_type
,
6065 tree from_type
, tree arg
)
6068 inform (EXPR_LOC_OR_LOC (arg
, input_location
),
6069 " cannot convert %qE (type %qT) to type %qT",
6070 arg
, from_type
, to_type
);
6075 unify_no_common_base (bool explain_p
, enum template_base_result r
,
6076 tree parm
, tree arg
)
6081 case tbr_ambiguous_baseclass
:
6082 inform (input_location
, " %qT is an ambiguous base class of %qT",
6086 inform (input_location
, " %qT is not derived from %qT", arg
, parm
);
6093 unify_inconsistent_template_template_parameters (bool explain_p
)
6096 inform (input_location
,
6097 " template parameters of a template template argument are "
6098 "inconsistent with other deduced template arguments");
6103 unify_template_deduction_failure (bool explain_p
, tree parm
, tree arg
)
6106 inform (input_location
,
6107 " can't deduce a template for %qT from non-template type %qT",
6113 unify_template_argument_mismatch (bool explain_p
, tree parm
, tree arg
)
6116 inform (input_location
,
6117 " template argument %qE does not match %qD", arg
, parm
);
6122 unify_overload_resolution_failure (bool explain_p
, tree arg
)
6125 inform (input_location
,
6126 " could not resolve address from overloaded function %qE",
6131 /* Attempt to convert the non-type template parameter EXPR to the
6132 indicated TYPE. If the conversion is successful, return the
6133 converted value. If the conversion is unsuccessful, return
6134 NULL_TREE if we issued an error message, or error_mark_node if we
6135 did not. We issue error messages for out-and-out bad template
6136 parameters, but not simply because the conversion failed, since we
6137 might be just trying to do argument deduction. Both TYPE and EXPR
6138 must be non-dependent.
6140 The conversion follows the special rules described in
6141 [temp.arg.nontype], and it is much more strict than an implicit
6144 This function is called twice for each template argument (see
6145 lookup_template_class for a more accurate description of this
6146 problem). This means that we need to handle expressions which
6147 are not valid in a C++ source, but can be created from the
6148 first call (for instance, casts to perform conversions). These
6149 hacks can go away after we fix the double coercion problem. */
6152 convert_nontype_argument (tree type
, tree expr
, tsubst_flags_t complain
)
6156 /* Detect immediately string literals as invalid non-type argument.
6157 This special-case is not needed for correctness (we would easily
6158 catch this later), but only to provide better diagnostic for this
6159 common user mistake. As suggested by DR 100, we do not mention
6160 linkage issues in the diagnostic as this is not the point. */
6161 /* FIXME we're making this OK. */
6162 if (TREE_CODE (expr
) == STRING_CST
)
6164 if (complain
& tf_error
)
6165 error ("%qE is not a valid template argument for type %qT "
6166 "because string literals can never be used in this context",
6171 /* Add the ADDR_EXPR now for the benefit of
6172 value_dependent_expression_p. */
6173 if (TYPE_PTROBV_P (type
)
6174 && TREE_CODE (TREE_TYPE (expr
)) == ARRAY_TYPE
)
6176 expr
= decay_conversion (expr
, complain
);
6177 if (expr
== error_mark_node
)
6178 return error_mark_node
;
6181 /* If we are in a template, EXPR may be non-dependent, but still
6182 have a syntactic, rather than semantic, form. For example, EXPR
6183 might be a SCOPE_REF, rather than the VAR_DECL to which the
6184 SCOPE_REF refers. Preserving the qualifying scope is necessary
6185 so that access checking can be performed when the template is
6186 instantiated -- but here we need the resolved form so that we can
6187 convert the argument. */
6188 bool non_dep
= false;
6189 if (TYPE_REF_OBJ_P (type
)
6190 && has_value_dependent_address (expr
))
6191 /* If we want the address and it's value-dependent, don't fold. */;
6192 else if (!type_unknown_p (expr
)
6193 && processing_template_decl
6194 && !instantiation_dependent_expression_p (expr
)
6195 && potential_constant_expression (expr
))
6197 if (error_operand_p (expr
))
6198 return error_mark_node
;
6199 expr_type
= TREE_TYPE (expr
);
6200 if (TREE_CODE (type
) == REFERENCE_TYPE
)
6201 expr
= mark_lvalue_use (expr
);
6203 expr
= mark_rvalue_use (expr
);
6205 /* If the argument is non-dependent, perform any conversions in
6206 non-dependent context as well. */
6207 processing_template_decl_sentinel
s (non_dep
);
6209 expr
= instantiate_non_dependent_expr_internal (expr
, complain
);
6211 /* 14.3.2/5: The null pointer{,-to-member} conversion is applied
6212 to a non-type argument of "nullptr". */
6213 if (expr
== nullptr_node
&& TYPE_PTR_OR_PTRMEM_P (type
))
6214 expr
= fold_simple (convert (type
, expr
));
6216 /* In C++11, integral or enumeration non-type template arguments can be
6217 arbitrary constant expressions. Pointer and pointer to
6218 member arguments can be general constant expressions that evaluate
6219 to a null value, but otherwise still need to be of a specific form. */
6220 if (cxx_dialect
>= cxx11
)
6222 if (TREE_CODE (expr
) == PTRMEM_CST
)
6223 /* A PTRMEM_CST is already constant, and a valid template
6224 argument for a parameter of pointer to member type, we just want
6225 to leave it in that form rather than lower it to a
6227 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
6228 expr
= maybe_constant_value (expr
);
6229 else if (cxx_dialect
>= cxx1z
)
6231 if (TREE_CODE (type
) != REFERENCE_TYPE
)
6232 expr
= maybe_constant_value (expr
);
6233 else if (REFERENCE_REF_P (expr
))
6235 expr
= TREE_OPERAND (expr
, 0);
6236 expr
= maybe_constant_value (expr
);
6237 expr
= convert_from_reference (expr
);
6240 else if (TYPE_PTR_OR_PTRMEM_P (type
))
6242 tree folded
= maybe_constant_value (expr
);
6243 if (TYPE_PTR_P (type
) ? integer_zerop (folded
)
6244 : null_member_pointer_value_p (folded
))
6249 /* HACK: Due to double coercion, we can get a
6250 NOP_EXPR<REFERENCE_TYPE>(ADDR_EXPR<POINTER_TYPE> (arg)) here,
6251 which is the tree that we built on the first call (see
6252 below when coercing to reference to object or to reference to
6253 function). We just strip everything and get to the arg.
6254 See g++.old-deja/g++.oliva/template4.C and g++.dg/template/nontype9.C
6256 if (TYPE_REF_OBJ_P (type
) || TYPE_REFFN_P (type
))
6258 tree probe_type
, probe
= expr
;
6259 if (REFERENCE_REF_P (probe
))
6260 probe
= TREE_OPERAND (probe
, 0);
6261 probe_type
= TREE_TYPE (probe
);
6262 if (TREE_CODE (probe
) == NOP_EXPR
)
6264 /* ??? Maybe we could use convert_from_reference here, but we
6265 would need to relax its constraints because the NOP_EXPR
6266 could actually change the type to something more cv-qualified,
6267 and this is not folded by convert_from_reference. */
6268 tree addr
= TREE_OPERAND (probe
, 0);
6269 if (TREE_CODE (probe_type
) == REFERENCE_TYPE
6270 && TREE_CODE (addr
) == ADDR_EXPR
6271 && TYPE_PTR_P (TREE_TYPE (addr
))
6272 && (same_type_ignoring_top_level_qualifiers_p
6273 (TREE_TYPE (probe_type
),
6274 TREE_TYPE (TREE_TYPE (addr
)))))
6276 expr
= TREE_OPERAND (addr
, 0);
6277 expr_type
= TREE_TYPE (probe_type
);
6282 /* We could also generate a NOP_EXPR(ADDR_EXPR()) when the
6283 parameter is a pointer to object, through decay and
6284 qualification conversion. Let's strip everything. */
6285 else if (TREE_CODE (expr
) == NOP_EXPR
&& TYPE_PTROBV_P (type
))
6289 if (TREE_CODE (probe
) == ADDR_EXPR
6290 && TYPE_PTR_P (TREE_TYPE (probe
)))
6292 /* Skip the ADDR_EXPR only if it is part of the decay for
6293 an array. Otherwise, it is part of the original argument
6294 in the source code. */
6295 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (probe
, 0))) == ARRAY_TYPE
)
6296 probe
= TREE_OPERAND (probe
, 0);
6298 expr_type
= TREE_TYPE (expr
);
6302 /* [temp.arg.nontype]/5, bullet 1
6304 For a non-type template-parameter of integral or enumeration type,
6305 integral promotions (_conv.prom_) and integral conversions
6306 (_conv.integral_) are applied. */
6307 if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
6309 tree t
= build_integral_nontype_arg_conv (type
, expr
, complain
);
6310 t
= maybe_constant_value (t
);
6311 if (t
!= error_mark_node
)
6314 if (!same_type_ignoring_top_level_qualifiers_p (type
, TREE_TYPE (expr
)))
6315 return error_mark_node
;
6317 /* Notice that there are constant expressions like '4 % 0' which
6318 do not fold into integer constants. */
6319 if (TREE_CODE (expr
) != INTEGER_CST
)
6321 if (complain
& tf_error
)
6323 int errs
= errorcount
, warns
= warningcount
+ werrorcount
;
6324 if (processing_template_decl
6325 && !require_potential_constant_expression (expr
))
6327 expr
= cxx_constant_value (expr
);
6328 if (errorcount
> errs
|| warningcount
+ werrorcount
> warns
)
6329 inform (EXPR_LOC_OR_LOC (expr
, input_location
),
6330 "in template argument for type %qT ", type
);
6331 if (expr
== error_mark_node
)
6333 /* else cxx_constant_value complained but gave us
6334 a real constant, so go ahead. */
6335 gcc_assert (TREE_CODE (expr
) == INTEGER_CST
);
6341 /* Avoid typedef problems. */
6342 if (TREE_TYPE (expr
) != type
)
6343 expr
= fold_convert (type
, expr
);
6345 /* [temp.arg.nontype]/5, bullet 2
6347 For a non-type template-parameter of type pointer to object,
6348 qualification conversions (_conv.qual_) and the array-to-pointer
6349 conversion (_conv.array_) are applied. */
6350 else if (TYPE_PTROBV_P (type
))
6352 /* [temp.arg.nontype]/1 (TC1 version, DR 49):
6354 A template-argument for a non-type, non-template template-parameter
6355 shall be one of: [...]
6357 -- the name of a non-type template-parameter;
6358 -- the address of an object or function with external linkage, [...]
6359 expressed as "& id-expression" where the & is optional if the name
6360 refers to a function or array, or if the corresponding
6361 template-parameter is a reference.
6363 Here, we do not care about functions, as they are invalid anyway
6364 for a parameter of type pointer-to-object. */
6366 if (DECL_P (expr
) && DECL_TEMPLATE_PARM_P (expr
))
6367 /* Non-type template parameters are OK. */
6369 else if (cxx_dialect
>= cxx11
&& integer_zerop (expr
))
6370 /* Null pointer values are OK in C++11. */;
6371 else if (TREE_CODE (expr
) != ADDR_EXPR
6372 && TREE_CODE (expr_type
) != ARRAY_TYPE
)
6376 if (complain
& tf_error
)
6377 error ("%qD is not a valid template argument "
6378 "because %qD is a variable, not the address of "
6379 "a variable", expr
, expr
);
6382 if (POINTER_TYPE_P (expr_type
))
6384 if (complain
& tf_error
)
6385 error ("%qE is not a valid template argument for %qT "
6386 "because it is not the address of a variable",
6390 /* Other values, like integer constants, might be valid
6391 non-type arguments of some other type. */
6392 return error_mark_node
;
6398 decl
= ((TREE_CODE (expr
) == ADDR_EXPR
)
6399 ? TREE_OPERAND (expr
, 0) : expr
);
6402 if (complain
& tf_error
)
6403 error ("%qE is not a valid template argument of type %qT "
6404 "because %qE is not a variable", expr
, type
, decl
);
6407 else if (cxx_dialect
< cxx11
&& !DECL_EXTERNAL_LINKAGE_P (decl
))
6409 if (complain
& tf_error
)
6410 error ("%qE is not a valid template argument of type %qT "
6411 "because %qD does not have external linkage",
6415 else if (cxx_dialect
>= cxx11
&& decl_linkage (decl
) == lk_none
)
6417 if (complain
& tf_error
)
6418 error ("%qE is not a valid template argument of type %qT "
6419 "because %qD has no linkage", expr
, type
, decl
);
6424 expr
= decay_conversion (expr
, complain
);
6425 if (expr
== error_mark_node
)
6426 return error_mark_node
;
6428 expr
= perform_qualification_conversions (type
, expr
);
6429 if (expr
== error_mark_node
)
6430 return error_mark_node
;
6432 /* [temp.arg.nontype]/5, bullet 3
6434 For a non-type template-parameter of type reference to object, no
6435 conversions apply. The type referred to by the reference may be more
6436 cv-qualified than the (otherwise identical) type of the
6437 template-argument. The template-parameter is bound directly to the
6438 template-argument, which must be an lvalue. */
6439 else if (TYPE_REF_OBJ_P (type
))
6441 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type
),
6443 return error_mark_node
;
6445 if (!at_least_as_qualified_p (TREE_TYPE (type
), expr_type
))
6447 if (complain
& tf_error
)
6448 error ("%qE is not a valid template argument for type %qT "
6449 "because of conflicts in cv-qualification", expr
, type
);
6453 if (!real_lvalue_p (expr
))
6455 if (complain
& tf_error
)
6456 error ("%qE is not a valid template argument for type %qT "
6457 "because it is not an lvalue", expr
, type
);
6461 /* [temp.arg.nontype]/1
6463 A template-argument for a non-type, non-template template-parameter
6464 shall be one of: [...]
6466 -- the address of an object or function with external linkage. */
6467 if (INDIRECT_REF_P (expr
)
6468 && TYPE_REF_OBJ_P (TREE_TYPE (TREE_OPERAND (expr
, 0))))
6470 expr
= TREE_OPERAND (expr
, 0);
6473 if (complain
& tf_error
)
6474 error ("%q#D is not a valid template argument for type %qT "
6475 "because a reference variable does not have a constant "
6476 "address", expr
, type
);
6483 if (complain
& tf_error
)
6484 error ("%qE is not a valid template argument for type %qT "
6485 "because it is not an object with linkage",
6490 /* DR 1155 allows internal linkage in C++11 and up. */
6491 linkage_kind linkage
= decl_linkage (expr
);
6492 if (linkage
< (cxx_dialect
>= cxx11
? lk_internal
: lk_external
))
6494 if (complain
& tf_error
)
6495 error ("%qE is not a valid template argument for type %qT "
6496 "because object %qD does not have linkage",
6501 expr
= build_nop (type
, build_address (expr
));
6503 /* [temp.arg.nontype]/5, bullet 4
6505 For a non-type template-parameter of type pointer to function, only
6506 the function-to-pointer conversion (_conv.func_) is applied. If the
6507 template-argument represents a set of overloaded functions (or a
6508 pointer to such), the matching function is selected from the set
6510 else if (TYPE_PTRFN_P (type
))
6512 /* If the argument is a template-id, we might not have enough
6513 context information to decay the pointer. */
6514 if (!type_unknown_p (expr_type
))
6516 expr
= decay_conversion (expr
, complain
);
6517 if (expr
== error_mark_node
)
6518 return error_mark_node
;
6521 if (cxx_dialect
>= cxx11
&& integer_zerop (expr
))
6522 /* Null pointer values are OK in C++11. */
6523 return perform_qualification_conversions (type
, expr
);
6525 expr
= convert_nontype_argument_function (type
, expr
, complain
);
6526 if (!expr
|| expr
== error_mark_node
)
6529 /* [temp.arg.nontype]/5, bullet 5
6531 For a non-type template-parameter of type reference to function, no
6532 conversions apply. If the template-argument represents a set of
6533 overloaded functions, the matching function is selected from the set
6535 else if (TYPE_REFFN_P (type
))
6537 if (TREE_CODE (expr
) == ADDR_EXPR
)
6539 if (complain
& tf_error
)
6541 error ("%qE is not a valid template argument for type %qT "
6542 "because it is a pointer", expr
, type
);
6543 inform (input_location
, "try using %qE instead",
6544 TREE_OPERAND (expr
, 0));
6549 expr
= convert_nontype_argument_function (type
, expr
, complain
);
6550 if (!expr
|| expr
== error_mark_node
)
6553 expr
= build_nop (type
, build_address (expr
));
6555 /* [temp.arg.nontype]/5, bullet 6
6557 For a non-type template-parameter of type pointer to member function,
6558 no conversions apply. If the template-argument represents a set of
6559 overloaded member functions, the matching member function is selected
6560 from the set (_over.over_). */
6561 else if (TYPE_PTRMEMFUNC_P (type
))
6563 expr
= instantiate_type (type
, expr
, tf_none
);
6564 if (expr
== error_mark_node
)
6565 return error_mark_node
;
6567 /* [temp.arg.nontype] bullet 1 says the pointer to member
6568 expression must be a pointer-to-member constant. */
6569 if (!check_valid_ptrmem_cst_expr (type
, expr
, complain
))
6570 return error_mark_node
;
6572 /* There is no way to disable standard conversions in
6573 resolve_address_of_overloaded_function (called by
6574 instantiate_type). It is possible that the call succeeded by
6575 converting &B::I to &D::I (where B is a base of D), so we need
6576 to reject this conversion here.
6578 Actually, even if there was a way to disable standard conversions,
6579 it would still be better to reject them here so that we can
6580 provide a superior diagnostic. */
6581 if (!same_type_p (TREE_TYPE (expr
), type
))
6583 if (complain
& tf_error
)
6585 error ("%qE is not a valid template argument for type %qT "
6586 "because it is of type %qT", expr
, type
,
6588 /* If we are just one standard conversion off, explain. */
6589 if (can_convert_standard (type
, TREE_TYPE (expr
), complain
))
6590 inform (input_location
,
6591 "standard conversions are not allowed in this context");
6596 /* [temp.arg.nontype]/5, bullet 7
6598 For a non-type template-parameter of type pointer to data member,
6599 qualification conversions (_conv.qual_) are applied. */
6600 else if (TYPE_PTRDATAMEM_P (type
))
6602 /* [temp.arg.nontype] bullet 1 says the pointer to member
6603 expression must be a pointer-to-member constant. */
6604 if (!check_valid_ptrmem_cst_expr (type
, expr
, complain
))
6605 return error_mark_node
;
6607 expr
= perform_qualification_conversions (type
, expr
);
6608 if (expr
== error_mark_node
)
6611 else if (NULLPTR_TYPE_P (type
))
6613 if (expr
!= nullptr_node
)
6615 if (complain
& tf_error
)
6616 error ("%qE is not a valid template argument for type %qT "
6617 "because it is of type %qT", expr
, type
, TREE_TYPE (expr
));
6622 /* A template non-type parameter must be one of the above. */
6626 /* Sanity check: did we actually convert the argument to the
6628 gcc_assert (same_type_ignoring_top_level_qualifiers_p
6629 (type
, TREE_TYPE (expr
)));
6630 return convert_from_reference (expr
);
6633 /* Subroutine of coerce_template_template_parms, which returns 1 if
6634 PARM_PARM and ARG_PARM match using the rule for the template
6635 parameters of template template parameters. Both PARM and ARG are
6636 template parameters; the rest of the arguments are the same as for
6637 coerce_template_template_parms.
6640 coerce_template_template_parm (tree parm
,
6642 tsubst_flags_t complain
,
6646 if (arg
== NULL_TREE
|| error_operand_p (arg
)
6647 || parm
== NULL_TREE
|| error_operand_p (parm
))
6650 if (TREE_CODE (arg
) != TREE_CODE (parm
))
6653 switch (TREE_CODE (parm
))
6656 /* We encounter instantiations of templates like
6657 template <template <template <class> class> class TT>
6660 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
6661 tree argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
6663 if (!coerce_template_template_parms
6664 (parmparm
, argparm
, complain
, in_decl
, outer_args
))
6670 if (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (arg
))
6671 && !TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
)))
6672 /* Argument is a parameter pack but parameter is not. */
6677 /* The tsubst call is used to handle cases such as
6679 template <int> class C {};
6680 template <class T, template <T> class TT> class D {};
6683 i.e. the parameter list of TT depends on earlier parameters. */
6684 if (!uses_template_parms (TREE_TYPE (arg
)))
6686 tree t
= tsubst (TREE_TYPE (parm
), outer_args
, complain
, in_decl
);
6687 if (!uses_template_parms (t
)
6688 && !same_type_p (t
, TREE_TYPE (arg
)))
6692 if (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (arg
))
6693 && !TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))
6694 /* Argument is a parameter pack but parameter is not. */
6707 /* Return 1 if PARM_PARMS and ARG_PARMS matches using rule for
6708 template template parameters. Both PARM_PARMS and ARG_PARMS are
6709 vectors of TREE_LIST nodes containing TYPE_DECL, TEMPLATE_DECL
6712 Consider the example:
6713 template <class T> class A;
6714 template<template <class U> class TT> class B;
6716 For B<A>, PARM_PARMS are the parameters to TT, while ARG_PARMS are
6717 the parameters to A, and OUTER_ARGS contains A. */
6720 coerce_template_template_parms (tree parm_parms
,
6722 tsubst_flags_t complain
,
6726 int nparms
, nargs
, i
;
6730 gcc_assert (TREE_CODE (parm_parms
) == TREE_VEC
);
6731 gcc_assert (TREE_CODE (arg_parms
) == TREE_VEC
);
6733 nparms
= TREE_VEC_LENGTH (parm_parms
);
6734 nargs
= TREE_VEC_LENGTH (arg_parms
);
6736 /* Determine whether we have a parameter pack at the end of the
6737 template template parameter's template parameter list. */
6738 if (TREE_VEC_ELT (parm_parms
, nparms
- 1) != error_mark_node
)
6740 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, nparms
- 1));
6742 if (error_operand_p (parm
))
6745 switch (TREE_CODE (parm
))
6749 if (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
)))
6754 if (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))
6764 && !(variadic_p
&& nargs
>= nparms
- 1))
6767 /* Check all of the template parameters except the parameter pack at
6768 the end (if any). */
6769 for (i
= 0; i
< nparms
- variadic_p
; ++i
)
6771 if (TREE_VEC_ELT (parm_parms
, i
) == error_mark_node
6772 || TREE_VEC_ELT (arg_parms
, i
) == error_mark_node
)
6775 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
6776 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
6778 if (!coerce_template_template_parm (parm
, arg
, complain
, in_decl
,
6786 /* Check each of the template parameters in the template
6787 argument against the template parameter pack at the end of
6788 the template template parameter. */
6789 if (TREE_VEC_ELT (parm_parms
, i
) == error_mark_node
)
6792 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
6794 for (; i
< nargs
; ++i
)
6796 if (TREE_VEC_ELT (arg_parms
, i
) == error_mark_node
)
6799 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
6801 if (!coerce_template_template_parm (parm
, arg
, complain
, in_decl
,
6810 /* Verifies that the deduced template arguments (in TARGS) for the
6811 template template parameters (in TPARMS) represent valid bindings,
6812 by comparing the template parameter list of each template argument
6813 to the template parameter list of its corresponding template
6814 template parameter, in accordance with DR150. This
6815 routine can only be called after all template arguments have been
6816 deduced. It will return TRUE if all of the template template
6817 parameter bindings are okay, FALSE otherwise. */
6819 template_template_parm_bindings_ok_p (tree tparms
, tree targs
)
6821 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
6824 /* We're dealing with template parms in this process. */
6825 ++processing_template_decl
;
6827 targs
= INNERMOST_TEMPLATE_ARGS (targs
);
6829 for (i
= 0; i
< ntparms
; ++i
)
6831 tree tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
6832 tree targ
= TREE_VEC_ELT (targs
, i
);
6834 if (TREE_CODE (tparm
) == TEMPLATE_DECL
&& targ
)
6836 tree packed_args
= NULL_TREE
;
6839 if (ARGUMENT_PACK_P (targ
))
6841 /* Look inside the argument pack. */
6842 packed_args
= ARGUMENT_PACK_ARGS (targ
);
6843 len
= TREE_VEC_LENGTH (packed_args
);
6846 for (idx
= 0; idx
< len
; ++idx
)
6848 tree targ_parms
= NULL_TREE
;
6851 /* Extract the next argument from the argument
6853 targ
= TREE_VEC_ELT (packed_args
, idx
);
6855 if (PACK_EXPANSION_P (targ
))
6856 /* Look at the pattern of the pack expansion. */
6857 targ
= PACK_EXPANSION_PATTERN (targ
);
6859 /* Extract the template parameters from the template
6861 if (TREE_CODE (targ
) == TEMPLATE_DECL
)
6862 targ_parms
= DECL_INNERMOST_TEMPLATE_PARMS (targ
);
6863 else if (TREE_CODE (targ
) == TEMPLATE_TEMPLATE_PARM
)
6864 targ_parms
= DECL_INNERMOST_TEMPLATE_PARMS (TYPE_NAME (targ
));
6866 /* Verify that we can coerce the template template
6867 parameters from the template argument to the template
6868 parameter. This requires an exact match. */
6870 && !coerce_template_template_parms
6871 (DECL_INNERMOST_TEMPLATE_PARMS (tparm
),
6886 --processing_template_decl
;
6890 /* Since type attributes aren't mangled, we need to strip them from
6891 template type arguments. */
6894 canonicalize_type_argument (tree arg
, tsubst_flags_t complain
)
6896 if (!arg
|| arg
== error_mark_node
|| arg
== TYPE_CANONICAL (arg
))
6898 bool removed_attributes
= false;
6899 tree canon
= strip_typedefs (arg
, &removed_attributes
);
6900 if (removed_attributes
6901 && (complain
& tf_warning
))
6902 warning (0, "ignoring attributes on template argument %qT", arg
);
6906 // A template declaration can be substituted for a constrained
6907 // template template parameter only when the argument is more
6908 // constrained than the parameter.
6910 is_compatible_template_arg (tree parm
, tree arg
)
6912 tree parm_cons
= get_constraints (parm
);
6914 /* For now, allow constrained template template arguments
6915 and unconstrained template template parameters. */
6916 if (parm_cons
== NULL_TREE
)
6919 tree arg_cons
= get_constraints (arg
);
6921 // If the template parameter is constrained, we need to rewrite its
6922 // constraints in terms of the ARG's template parameters. This ensures
6923 // that all of the template parameter types will have the same depth.
6925 // Note that this is only valid when coerce_template_template_parm is
6926 // true for the innermost template parameters of PARM and ARG. In other
6927 // words, because coercion is successful, this conversion will be valid.
6930 tree args
= template_parms_to_args (DECL_TEMPLATE_PARMS (arg
));
6931 parm_cons
= tsubst_constraint_info (parm_cons
,
6932 INNERMOST_TEMPLATE_ARGS (args
),
6933 tf_none
, NULL_TREE
);
6934 if (parm_cons
== error_mark_node
)
6938 return subsumes (parm_cons
, arg_cons
);
6941 // Convert a placeholder argument into a binding to the original
6942 // parameter. The original parameter is saved as the TREE_TYPE of
6945 convert_wildcard_argument (tree parm
, tree arg
)
6947 TREE_TYPE (arg
) = parm
;
6951 /* Convert the indicated template ARG as necessary to match the
6952 indicated template PARM. Returns the converted ARG, or
6953 error_mark_node if the conversion was unsuccessful. Error and
6954 warning messages are issued under control of COMPLAIN. This
6955 conversion is for the Ith parameter in the parameter list. ARGS is
6956 the full set of template arguments deduced so far. */
6959 convert_template_argument (tree parm
,
6962 tsubst_flags_t complain
,
6968 int is_type
, requires_type
, is_tmpl_type
, requires_tmpl_type
;
6970 if (parm
== error_mark_node
)
6971 return error_mark_node
;
6973 /* Trivially convert placeholders. */
6974 if (TREE_CODE (arg
) == WILDCARD_DECL
)
6975 return convert_wildcard_argument (parm
, arg
);
6977 if (TREE_CODE (arg
) == TREE_LIST
6978 && TREE_CODE (TREE_VALUE (arg
)) == OFFSET_REF
)
6980 /* The template argument was the name of some
6981 member function. That's usually
6982 invalid, but static members are OK. In any
6983 case, grab the underlying fields/functions
6984 and issue an error later if required. */
6985 orig_arg
= TREE_VALUE (arg
);
6986 TREE_TYPE (arg
) = unknown_type_node
;
6991 requires_tmpl_type
= TREE_CODE (parm
) == TEMPLATE_DECL
;
6992 requires_type
= (TREE_CODE (parm
) == TYPE_DECL
6993 || requires_tmpl_type
);
6995 /* When determining whether an argument pack expansion is a template,
6996 look at the pattern. */
6997 if (TREE_CODE (arg
) == TYPE_PACK_EXPANSION
)
6998 arg
= PACK_EXPANSION_PATTERN (arg
);
7000 /* Deal with an injected-class-name used as a template template arg. */
7001 if (requires_tmpl_type
&& CLASS_TYPE_P (arg
))
7003 tree t
= maybe_get_template_decl_from_type_decl (TYPE_NAME (arg
));
7004 if (TREE_CODE (t
) == TEMPLATE_DECL
)
7006 if (cxx_dialect
>= cxx11
)
7007 /* OK under DR 1004. */;
7008 else if (complain
& tf_warning_or_error
)
7009 pedwarn (input_location
, OPT_Wpedantic
, "injected-class-name %qD"
7010 " used as template template argument", TYPE_NAME (arg
));
7011 else if (flag_pedantic_errors
)
7019 ((TREE_CODE (arg
) == TEMPLATE_DECL
7020 && TREE_CODE (DECL_TEMPLATE_RESULT (arg
)) == TYPE_DECL
)
7021 || (requires_tmpl_type
&& TREE_CODE (arg
) == TYPE_ARGUMENT_PACK
)
7022 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
7023 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
);
7026 && (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
7027 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
))
7028 arg
= TYPE_STUB_DECL (arg
);
7030 is_type
= TYPE_P (arg
) || is_tmpl_type
;
7032 if (requires_type
&& ! is_type
&& TREE_CODE (arg
) == SCOPE_REF
7033 && TREE_CODE (TREE_OPERAND (arg
, 0)) == TEMPLATE_TYPE_PARM
)
7035 if (TREE_CODE (TREE_OPERAND (arg
, 1)) == BIT_NOT_EXPR
)
7037 if (complain
& tf_error
)
7038 error ("invalid use of destructor %qE as a type", orig_arg
);
7039 return error_mark_node
;
7042 permerror (input_location
,
7043 "to refer to a type member of a template parameter, "
7044 "use %<typename %E%>", orig_arg
);
7046 orig_arg
= make_typename_type (TREE_OPERAND (arg
, 0),
7047 TREE_OPERAND (arg
, 1),
7053 if (is_type
!= requires_type
)
7057 if (complain
& tf_error
)
7059 error ("type/value mismatch at argument %d in template "
7060 "parameter list for %qD",
7063 inform (input_location
,
7064 " expected a constant of type %qT, got %qT",
7066 (DECL_P (arg
) ? DECL_NAME (arg
) : orig_arg
));
7067 else if (requires_tmpl_type
)
7068 inform (input_location
,
7069 " expected a class template, got %qE", orig_arg
);
7071 inform (input_location
,
7072 " expected a type, got %qE", orig_arg
);
7075 return error_mark_node
;
7077 if (is_tmpl_type
^ requires_tmpl_type
)
7079 if (in_decl
&& (complain
& tf_error
))
7081 error ("type/value mismatch at argument %d in template "
7082 "parameter list for %qD",
7085 inform (input_location
,
7086 " expected a type, got %qT", DECL_NAME (arg
));
7088 inform (input_location
,
7089 " expected a class template, got %qT", orig_arg
);
7091 return error_mark_node
;
7096 if (requires_tmpl_type
)
7098 if (template_parameter_pack_p (parm
) && ARGUMENT_PACK_P (orig_arg
))
7100 else if (TREE_CODE (TREE_TYPE (arg
)) == UNBOUND_CLASS_TEMPLATE
)
7101 /* The number of argument required is not known yet.
7102 Just accept it for now. */
7103 val
= TREE_TYPE (arg
);
7106 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
7109 /* Strip alias templates that are equivalent to another
7111 arg
= get_underlying_template (arg
);
7112 argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
7114 if (coerce_template_template_parms (parmparm
, argparm
,
7120 /* TEMPLATE_TEMPLATE_PARM node is preferred over
7122 if (val
!= error_mark_node
)
7124 if (DECL_TEMPLATE_TEMPLATE_PARM_P (val
))
7125 val
= TREE_TYPE (val
);
7126 if (TREE_CODE (orig_arg
) == TYPE_PACK_EXPANSION
)
7127 val
= make_pack_expansion (val
);
7132 if (in_decl
&& (complain
& tf_error
))
7134 error ("type/value mismatch at argument %d in "
7135 "template parameter list for %qD",
7137 inform (input_location
,
7138 " expected a template of type %qD, got %qT",
7142 val
= error_mark_node
;
7145 // Check that the constraints are compatible before allowing the
7147 if (val
!= error_mark_node
)
7148 if (!is_compatible_template_arg (parm
, arg
))
7150 if (in_decl
&& (complain
& tf_error
))
7152 error ("constraint mismatch at argument %d in "
7153 "template parameter list for %qD",
7155 inform (input_location
, " expected %qD but got %qD",
7158 val
= error_mark_node
;
7164 /* We only form one instance of each template specialization.
7165 Therefore, if we use a non-canonical variant (i.e., a
7166 typedef), any future messages referring to the type will use
7167 the typedef, which is confusing if those future uses do not
7168 themselves also use the typedef. */
7170 val
= canonicalize_type_argument (val
, complain
);
7174 tree t
= tsubst (TREE_TYPE (parm
), args
, complain
, in_decl
);
7176 if (invalid_nontype_parm_type_p (t
, complain
))
7177 return error_mark_node
;
7179 if (template_parameter_pack_p (parm
) && ARGUMENT_PACK_P (orig_arg
))
7181 if (same_type_p (t
, TREE_TYPE (orig_arg
)))
7185 /* Not sure if this is reachable, but it doesn't hurt
7187 error ("type mismatch in nontype parameter pack");
7188 val
= error_mark_node
;
7191 else if (!dependent_template_arg_p (orig_arg
)
7192 && !uses_template_parms (t
))
7193 /* We used to call digest_init here. However, digest_init
7194 will report errors, which we don't want when complain
7195 is zero. More importantly, digest_init will try too
7196 hard to convert things: for example, `0' should not be
7197 converted to pointer type at this point according to
7198 the standard. Accepting this is not merely an
7199 extension, since deciding whether or not these
7200 conversions can occur is part of determining which
7201 function template to call, or whether a given explicit
7202 argument specification is valid. */
7203 val
= convert_nontype_argument (t
, orig_arg
, complain
);
7206 bool removed_attr
= false;
7207 val
= strip_typedefs_expr (orig_arg
, &removed_attr
);
7210 if (val
== NULL_TREE
)
7211 val
= error_mark_node
;
7212 else if (val
== error_mark_node
&& (complain
& tf_error
))
7213 error ("could not convert template argument %qE to %qT", orig_arg
, t
);
7215 if (INDIRECT_REF_P (val
))
7217 /* Reject template arguments that are references to built-in
7218 functions with no library fallbacks. */
7219 const_tree inner
= TREE_OPERAND (val
, 0);
7220 if (TREE_CODE (TREE_TYPE (inner
)) == REFERENCE_TYPE
7221 && TREE_CODE (TREE_TYPE (TREE_TYPE (inner
))) == FUNCTION_TYPE
7222 && TREE_CODE (TREE_TYPE (inner
)) == REFERENCE_TYPE
7223 && reject_gcc_builtin (TREE_OPERAND (inner
, 0)))
7224 return error_mark_node
;
7227 if (TREE_CODE (val
) == SCOPE_REF
)
7229 /* Strip typedefs from the SCOPE_REF. */
7230 tree type
= canonicalize_type_argument (TREE_TYPE (val
), complain
);
7231 tree scope
= canonicalize_type_argument (TREE_OPERAND (val
, 0),
7233 val
= build_qualified_name (type
, scope
, TREE_OPERAND (val
, 1),
7234 QUALIFIED_NAME_IS_TEMPLATE (val
));
7241 /* Coerces the remaining template arguments in INNER_ARGS (from
7242 ARG_IDX to the end) into the parameter pack at PARM_IDX in PARMS.
7243 Returns the coerced argument pack. PARM_IDX is the position of this
7244 parameter in the template parameter list. ARGS is the original
7245 template argument list. */
7247 coerce_template_parameter_pack (tree parms
,
7255 tsubst_flags_t complain
)
7257 tree parm
= TREE_VEC_ELT (parms
, parm_idx
);
7258 int nargs
= inner_args
? NUM_TMPL_ARGS (inner_args
) : 0;
7261 tree packed_parms
= NULL_TREE
;
7263 if (arg_idx
> nargs
)
7266 if (tree packs
= fixed_parameter_pack_p (TREE_VALUE (parm
)))
7268 /* When the template parameter is a non-type template parameter pack
7269 or template template parameter pack whose type or template
7270 parameters use parameter packs, we know exactly how many arguments
7271 we are looking for. Build a vector of the instantiated decls for
7272 these template parameters in PACKED_PARMS. */
7273 /* We can't use make_pack_expansion here because it would interpret a
7274 _DECL as a use rather than a declaration. */
7275 tree decl
= TREE_VALUE (parm
);
7276 tree exp
= cxx_make_type (TYPE_PACK_EXPANSION
);
7277 SET_PACK_EXPANSION_PATTERN (exp
, decl
);
7278 PACK_EXPANSION_PARAMETER_PACKS (exp
) = packs
;
7279 SET_TYPE_STRUCTURAL_EQUALITY (exp
);
7281 TREE_VEC_LENGTH (args
)--;
7282 packed_parms
= tsubst_pack_expansion (exp
, args
, complain
, decl
);
7283 TREE_VEC_LENGTH (args
)++;
7285 if (packed_parms
== error_mark_node
)
7286 return error_mark_node
;
7288 /* If we're doing a partial instantiation of a member template,
7289 verify that all of the types used for the non-type
7290 template parameter pack are, in fact, valid for non-type
7291 template parameters. */
7293 && PACK_EXPANSION_P (TREE_VEC_ELT (inner_args
, arg_idx
)))
7295 int j
, len
= TREE_VEC_LENGTH (packed_parms
);
7296 for (j
= 0; j
< len
; ++j
)
7298 tree t
= TREE_TYPE (TREE_VEC_ELT (packed_parms
, j
));
7299 if (invalid_nontype_parm_type_p (t
, complain
))
7300 return error_mark_node
;
7302 /* We don't know how many args we have yet, just
7303 use the unconverted ones for now. */
7307 packed_args
= make_tree_vec (TREE_VEC_LENGTH (packed_parms
));
7309 /* Check if we have a placeholder pack, which indicates we're
7310 in the context of a introduction list. In that case we want
7311 to match this pack to the single placeholder. */
7312 else if (arg_idx
< nargs
7313 && TREE_CODE (TREE_VEC_ELT (inner_args
, arg_idx
)) == WILDCARD_DECL
7314 && WILDCARD_PACK_P (TREE_VEC_ELT (inner_args
, arg_idx
)))
7316 nargs
= arg_idx
+ 1;
7317 packed_args
= make_tree_vec (1);
7320 packed_args
= make_tree_vec (nargs
- arg_idx
);
7322 /* Convert the remaining arguments, which will be a part of the
7323 parameter pack "parm". */
7324 for (; arg_idx
< nargs
; ++arg_idx
)
7326 tree arg
= TREE_VEC_ELT (inner_args
, arg_idx
);
7327 tree actual_parm
= TREE_VALUE (parm
);
7328 int pack_idx
= arg_idx
- parm_idx
;
7332 /* Once we've packed as many args as we have types, stop. */
7333 if (pack_idx
>= TREE_VEC_LENGTH (packed_parms
))
7335 else if (PACK_EXPANSION_P (arg
))
7336 /* We don't know how many args we have yet, just
7337 use the unconverted ones for now. */
7340 actual_parm
= TREE_VEC_ELT (packed_parms
, pack_idx
);
7343 if (arg
== error_mark_node
)
7345 if (complain
& tf_error
)
7346 error ("template argument %d is invalid", arg_idx
+ 1);
7349 arg
= convert_template_argument (actual_parm
,
7350 arg
, new_args
, complain
, parm_idx
,
7352 if (arg
== error_mark_node
)
7354 TREE_VEC_ELT (packed_args
, pack_idx
) = arg
;
7357 if (arg_idx
- parm_idx
< TREE_VEC_LENGTH (packed_args
)
7358 && TREE_VEC_LENGTH (packed_args
) > 0)
7360 if (complain
& tf_error
)
7361 error ("wrong number of template arguments (%d, should be %d)",
7362 arg_idx
- parm_idx
, TREE_VEC_LENGTH (packed_args
));
7363 return error_mark_node
;
7366 if (TREE_CODE (TREE_VALUE (parm
)) == TYPE_DECL
7367 || TREE_CODE (TREE_VALUE (parm
)) == TEMPLATE_DECL
)
7368 argument_pack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
7371 argument_pack
= make_node (NONTYPE_ARGUMENT_PACK
);
7372 TREE_TYPE (argument_pack
)
7373 = tsubst (TREE_TYPE (TREE_VALUE (parm
)), new_args
, complain
, in_decl
);
7374 TREE_CONSTANT (argument_pack
) = 1;
7377 SET_ARGUMENT_PACK_ARGS (argument_pack
, packed_args
);
7379 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (packed_args
,
7380 TREE_VEC_LENGTH (packed_args
));
7381 return argument_pack
;
7384 /* Returns the number of pack expansions in the template argument vector
7388 pack_expansion_args_count (tree args
)
7393 for (i
= 0; i
< TREE_VEC_LENGTH (args
); ++i
)
7395 tree elt
= TREE_VEC_ELT (args
, i
);
7396 if (elt
&& PACK_EXPANSION_P (elt
))
7402 /* Convert all template arguments to their appropriate types, and
7403 return a vector containing the innermost resulting template
7404 arguments. If any error occurs, return error_mark_node. Error and
7405 warning messages are issued under control of COMPLAIN.
7407 If REQUIRE_ALL_ARGS is false, argument deduction will be performed
7408 for arguments not specified in ARGS. Otherwise, if
7409 USE_DEFAULT_ARGS is true, default arguments will be used to fill in
7410 unspecified arguments. If REQUIRE_ALL_ARGS is true, but
7411 USE_DEFAULT_ARGS is false, then all arguments must be specified in
7415 coerce_template_parms (tree parms
,
7418 tsubst_flags_t complain
,
7419 bool require_all_args
,
7420 bool use_default_args
)
7422 int nparms
, nargs
, parm_idx
, arg_idx
, lost
= 0;
7423 tree orig_inner_args
;
7426 tree new_inner_args
;
7427 int saved_unevaluated_operand
;
7428 int saved_inhibit_evaluation_warnings
;
7430 /* When used as a boolean value, indicates whether this is a
7431 variadic template parameter list. Since it's an int, we can also
7432 subtract it from nparms to get the number of non-variadic
7435 int variadic_args_p
= 0;
7436 int post_variadic_parms
= 0;
7438 /* Likewise for parameters with default arguments. */
7441 if (args
== error_mark_node
)
7442 return error_mark_node
;
7444 nparms
= TREE_VEC_LENGTH (parms
);
7446 /* Determine if there are any parameter packs or default arguments. */
7447 for (parm_idx
= 0; parm_idx
< nparms
; ++parm_idx
)
7449 tree parm
= TREE_VEC_ELT (parms
, parm_idx
);
7451 ++post_variadic_parms
;
7452 if (template_parameter_pack_p (TREE_VALUE (parm
)))
7454 if (TREE_PURPOSE (parm
))
7458 inner_args
= orig_inner_args
= INNERMOST_TEMPLATE_ARGS (args
);
7459 /* If there are no parameters that follow a parameter pack, we need to
7460 expand any argument packs so that we can deduce a parameter pack from
7461 some non-packed args followed by an argument pack, as in variadic85.C.
7462 If there are such parameters, we need to leave argument packs intact
7463 so the arguments are assigned properly. This can happen when dealing
7464 with a nested class inside a partial specialization of a class
7465 template, as in variadic92.C, or when deducing a template parameter pack
7466 from a sub-declarator, as in variadic114.C. */
7467 if (!post_variadic_parms
)
7468 inner_args
= expand_template_argument_pack (inner_args
);
7470 /* Count any pack expansion args. */
7471 variadic_args_p
= pack_expansion_args_count (inner_args
);
7473 nargs
= inner_args
? NUM_TMPL_ARGS (inner_args
) : 0;
7474 if ((nargs
> nparms
&& !variadic_p
)
7475 || (nargs
< nparms
- variadic_p
7478 && (!use_default_args
7479 || (TREE_VEC_ELT (parms
, nargs
) != error_mark_node
7480 && !TREE_PURPOSE (TREE_VEC_ELT (parms
, nargs
))))))
7482 if (complain
& tf_error
)
7484 if (variadic_p
|| default_p
)
7486 nparms
-= variadic_p
+ default_p
;
7487 error ("wrong number of template arguments "
7488 "(%d, should be at least %d)", nargs
, nparms
);
7491 error ("wrong number of template arguments "
7492 "(%d, should be %d)", nargs
, nparms
);
7495 inform (DECL_SOURCE_LOCATION (in_decl
),
7496 "provided for %qD", in_decl
);
7499 return error_mark_node
;
7501 /* We can't pass a pack expansion to a non-pack parameter of an alias
7502 template (DR 1430). */
7504 && (DECL_ALIAS_TEMPLATE_P (in_decl
)
7505 || concept_template_p (in_decl
))
7507 && nargs
- variadic_args_p
< nparms
- variadic_p
)
7509 if (complain
& tf_error
)
7511 for (int i
= 0; i
< TREE_VEC_LENGTH (inner_args
); ++i
)
7513 tree arg
= TREE_VEC_ELT (inner_args
, i
);
7514 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
7516 if (PACK_EXPANSION_P (arg
)
7517 && !template_parameter_pack_p (parm
))
7519 if (DECL_ALIAS_TEMPLATE_P (in_decl
))
7520 error_at (location_of (arg
),
7521 "pack expansion argument for non-pack parameter "
7522 "%qD of alias template %qD", parm
, in_decl
);
7524 error_at (location_of (arg
),
7525 "pack expansion argument for non-pack parameter "
7526 "%qD of concept %qD", parm
, in_decl
);
7527 inform (DECL_SOURCE_LOCATION (parm
), "declared here");
7534 return error_mark_node
;
7537 /* We need to evaluate the template arguments, even though this
7538 template-id may be nested within a "sizeof". */
7539 saved_unevaluated_operand
= cp_unevaluated_operand
;
7540 cp_unevaluated_operand
= 0;
7541 saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
7542 c_inhibit_evaluation_warnings
= 0;
7543 new_inner_args
= make_tree_vec (nparms
);
7544 new_args
= add_outermost_template_args (args
, new_inner_args
);
7545 int pack_adjust
= 0;
7546 for (parm_idx
= 0, arg_idx
= 0; parm_idx
< nparms
; parm_idx
++, arg_idx
++)
7551 /* Get the Ith template parameter. */
7552 parm
= TREE_VEC_ELT (parms
, parm_idx
);
7554 if (parm
== error_mark_node
)
7556 TREE_VEC_ELT (new_inner_args
, arg_idx
) = error_mark_node
;
7560 /* Calculate the next argument. */
7561 if (arg_idx
< nargs
)
7562 arg
= TREE_VEC_ELT (inner_args
, arg_idx
);
7566 if (template_parameter_pack_p (TREE_VALUE (parm
))
7567 && !(arg
&& ARGUMENT_PACK_P (arg
)))
7569 /* Some arguments will be placed in the
7570 template parameter pack PARM. */
7571 arg
= coerce_template_parameter_pack (parms
, parm_idx
, args
,
7572 inner_args
, arg_idx
,
7576 if (arg
== NULL_TREE
)
7578 /* We don't know how many args we have yet, just use the
7579 unconverted (and still packed) ones for now. */
7580 new_inner_args
= orig_inner_args
;
7585 TREE_VEC_ELT (new_inner_args
, parm_idx
) = arg
;
7587 /* Store this argument. */
7588 if (arg
== error_mark_node
)
7591 /* We are done with all of the arguments. */
7596 pack_adjust
= TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg
)) - 1;
7597 arg_idx
+= pack_adjust
;
7604 if (PACK_EXPANSION_P (arg
))
7606 /* "If every valid specialization of a variadic template
7607 requires an empty template parameter pack, the template is
7608 ill-formed, no diagnostic required." So check that the
7609 pattern works with this parameter. */
7610 tree pattern
= PACK_EXPANSION_PATTERN (arg
);
7611 tree conv
= convert_template_argument (TREE_VALUE (parm
),
7615 if (conv
== error_mark_node
)
7617 inform (input_location
, "so any instantiation with a "
7618 "non-empty parameter pack would be ill-formed");
7621 else if (TYPE_P (conv
) && !TYPE_P (pattern
))
7622 /* Recover from missing typename. */
7623 TREE_VEC_ELT (inner_args
, arg_idx
)
7624 = make_pack_expansion (conv
);
7626 /* We don't know how many args we have yet, just
7627 use the unconverted ones for now. */
7628 new_inner_args
= inner_args
;
7633 else if (require_all_args
)
7635 /* There must be a default arg in this case. */
7636 arg
= tsubst_template_arg (TREE_PURPOSE (parm
), new_args
,
7638 /* The position of the first default template argument,
7639 is also the number of non-defaulted arguments in NEW_INNER_ARGS.
7641 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
))
7642 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
,
7643 arg_idx
- pack_adjust
);
7648 if (arg
== error_mark_node
)
7650 if (complain
& tf_error
)
7651 error ("template argument %d is invalid", arg_idx
+ 1);
7654 /* This only occurs if there was an error in the template
7655 parameter list itself (which we would already have
7656 reported) that we are trying to recover from, e.g., a class
7657 template with a parameter list such as
7658 template<typename..., typename>. */
7661 arg
= convert_template_argument (TREE_VALUE (parm
),
7662 arg
, new_args
, complain
,
7665 if (arg
== error_mark_node
)
7667 TREE_VEC_ELT (new_inner_args
, arg_idx
- pack_adjust
) = arg
;
7669 cp_unevaluated_operand
= saved_unevaluated_operand
;
7670 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
7672 if (variadic_p
&& arg_idx
< nargs
)
7674 if (complain
& tf_error
)
7676 error ("wrong number of template arguments "
7677 "(%d, should be %d)", nargs
, arg_idx
);
7679 error ("provided for %q+D", in_decl
);
7681 return error_mark_node
;
7685 return error_mark_node
;
7687 if (CHECKING_P
&& !NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
))
7688 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
,
7689 TREE_VEC_LENGTH (new_inner_args
));
7691 return new_inner_args
;
7694 /* Convert all template arguments to their appropriate types, and
7695 return a vector containing the innermost resulting template
7696 arguments. If any error occurs, return error_mark_node. Error and
7697 warning messages are not issued.
7699 Note that no function argument deduction is performed, and default
7700 arguments are used to fill in unspecified arguments. */
7702 coerce_template_parms (tree parms
, tree args
, tree in_decl
)
7704 return coerce_template_parms (parms
, args
, in_decl
, tf_none
, true, true);
7707 /* Convert all template arguments to their appropriate type, and
7708 instantiate default arguments as needed. This returns a vector
7709 containing the innermost resulting template arguments, or
7710 error_mark_node if unsuccessful. */
7712 coerce_template_parms (tree parms
, tree args
, tree in_decl
,
7713 tsubst_flags_t complain
)
7715 return coerce_template_parms (parms
, args
, in_decl
, complain
, true, true);
7718 /* Like coerce_template_parms. If PARMS represents all template
7719 parameters levels, this function returns a vector of vectors
7720 representing all the resulting argument levels. Note that in this
7721 case, only the innermost arguments are coerced because the
7722 outermost ones are supposed to have been coerced already.
7724 Otherwise, if PARMS represents only (the innermost) vector of
7725 parameters, this function returns a vector containing just the
7726 innermost resulting arguments. */
7729 coerce_innermost_template_parms (tree parms
,
7732 tsubst_flags_t complain
,
7733 bool require_all_args
,
7734 bool use_default_args
)
7736 int parms_depth
= TMPL_PARMS_DEPTH (parms
);
7737 int args_depth
= TMPL_ARGS_DEPTH (args
);
7740 if (parms_depth
> 1)
7742 coerced_args
= make_tree_vec (parms_depth
);
7746 for (level
= parms
, cur_depth
= parms_depth
;
7747 parms_depth
> 0 && level
!= NULL_TREE
;
7748 level
= TREE_CHAIN (level
), --cur_depth
)
7751 if (cur_depth
== args_depth
)
7752 l
= coerce_template_parms (TREE_VALUE (level
),
7753 args
, in_decl
, complain
,
7757 l
= TMPL_ARGS_LEVEL (args
, cur_depth
);
7759 if (l
== error_mark_node
)
7760 return error_mark_node
;
7762 SET_TMPL_ARGS_LEVEL (coerced_args
, cur_depth
, l
);
7766 coerced_args
= coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parms
),
7767 args
, in_decl
, complain
,
7770 return coerced_args
;
7773 /* Returns 1 if template args OT and NT are equivalent. */
7776 template_args_equal (tree ot
, tree nt
)
7780 if (nt
== NULL_TREE
|| ot
== NULL_TREE
)
7783 if (TREE_CODE (nt
) == TREE_VEC
)
7784 /* For member templates */
7785 return TREE_CODE (ot
) == TREE_VEC
&& comp_template_args (ot
, nt
);
7786 else if (PACK_EXPANSION_P (ot
))
7787 return (PACK_EXPANSION_P (nt
)
7788 && template_args_equal (PACK_EXPANSION_PATTERN (ot
),
7789 PACK_EXPANSION_PATTERN (nt
))
7790 && template_args_equal (PACK_EXPANSION_EXTRA_ARGS (ot
),
7791 PACK_EXPANSION_EXTRA_ARGS (nt
)));
7792 else if (ARGUMENT_PACK_P (ot
))
7797 if (!ARGUMENT_PACK_P (nt
))
7800 opack
= ARGUMENT_PACK_ARGS (ot
);
7801 npack
= ARGUMENT_PACK_ARGS (nt
);
7802 len
= TREE_VEC_LENGTH (opack
);
7803 if (TREE_VEC_LENGTH (npack
) != len
)
7805 for (i
= 0; i
< len
; ++i
)
7806 if (!template_args_equal (TREE_VEC_ELT (opack
, i
),
7807 TREE_VEC_ELT (npack
, i
)))
7811 else if (ot
&& TREE_CODE (ot
) == ARGUMENT_PACK_SELECT
)
7813 /* We get here probably because we are in the middle of substituting
7814 into the pattern of a pack expansion. In that case the
7815 ARGUMENT_PACK_SELECT temporarily replaces the pack argument we are
7816 interested in. So we want to use the initial pack argument for
7818 ot
= ARGUMENT_PACK_SELECT_FROM_PACK (ot
);
7819 if (nt
&& TREE_CODE (nt
) == ARGUMENT_PACK_SELECT
)
7820 nt
= ARGUMENT_PACK_SELECT_FROM_PACK (nt
);
7821 return template_args_equal (ot
, nt
);
7823 else if (TYPE_P (nt
))
7827 /* Don't treat an alias template specialization with dependent
7828 arguments as equivalent to its underlying type when used as a
7829 template argument; we need them to be distinct so that we
7830 substitute into the specialization arguments at instantiation
7831 time. And aliases can't be equivalent without being ==, so
7832 we don't need to look any deeper. */
7833 if (TYPE_ALIAS_P (nt
) || TYPE_ALIAS_P (ot
))
7836 return same_type_p (ot
, nt
);
7838 else if (TREE_CODE (ot
) == TREE_VEC
|| TYPE_P (ot
))
7842 /* Try to treat a template non-type argument that has been converted
7843 to the parameter type as equivalent to one that hasn't yet. */
7844 for (enum tree_code code1
= TREE_CODE (ot
);
7845 CONVERT_EXPR_CODE_P (code1
)
7846 || code1
== NON_LVALUE_EXPR
;
7847 code1
= TREE_CODE (ot
))
7848 ot
= TREE_OPERAND (ot
, 0);
7849 for (enum tree_code code2
= TREE_CODE (nt
);
7850 CONVERT_EXPR_CODE_P (code2
)
7851 || code2
== NON_LVALUE_EXPR
;
7852 code2
= TREE_CODE (nt
))
7853 nt
= TREE_OPERAND (nt
, 0);
7855 return cp_tree_equal (ot
, nt
);
7859 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets of
7860 template arguments. Returns 0 otherwise, and updates OLDARG_PTR and
7861 NEWARG_PTR with the offending arguments if they are non-NULL. */
7864 comp_template_args_with_info (tree oldargs
, tree newargs
,
7865 tree
*oldarg_ptr
, tree
*newarg_ptr
)
7869 if (oldargs
== newargs
)
7872 if (!oldargs
|| !newargs
)
7875 if (TREE_VEC_LENGTH (oldargs
) != TREE_VEC_LENGTH (newargs
))
7878 for (i
= 0; i
< TREE_VEC_LENGTH (oldargs
); ++i
)
7880 tree nt
= TREE_VEC_ELT (newargs
, i
);
7881 tree ot
= TREE_VEC_ELT (oldargs
, i
);
7883 if (! template_args_equal (ot
, nt
))
7885 if (oldarg_ptr
!= NULL
)
7887 if (newarg_ptr
!= NULL
)
7895 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets
7896 of template arguments. Returns 0 otherwise. */
7899 comp_template_args (tree oldargs
, tree newargs
)
7901 return comp_template_args_with_info (oldargs
, newargs
, NULL
, NULL
);
7905 add_pending_template (tree d
)
7907 tree ti
= (TYPE_P (d
)
7908 ? CLASSTYPE_TEMPLATE_INFO (d
)
7909 : DECL_TEMPLATE_INFO (d
));
7910 struct pending_template
*pt
;
7913 if (TI_PENDING_TEMPLATE_FLAG (ti
))
7916 /* We are called both from instantiate_decl, where we've already had a
7917 tinst_level pushed, and instantiate_template, where we haven't.
7919 level
= !current_tinst_level
|| current_tinst_level
->decl
!= d
;
7922 push_tinst_level (d
);
7924 pt
= ggc_alloc
<pending_template
> ();
7926 pt
->tinst
= current_tinst_level
;
7927 if (last_pending_template
)
7928 last_pending_template
->next
= pt
;
7930 pending_templates
= pt
;
7932 last_pending_template
= pt
;
7934 TI_PENDING_TEMPLATE_FLAG (ti
) = 1;
7941 /* Return a TEMPLATE_ID_EXPR corresponding to the indicated FNS and
7942 ARGLIST. Valid choices for FNS are given in the cp-tree.def
7943 documentation for TEMPLATE_ID_EXPR. */
7946 lookup_template_function (tree fns
, tree arglist
)
7950 if (fns
== error_mark_node
|| arglist
== error_mark_node
)
7951 return error_mark_node
;
7953 gcc_assert (!arglist
|| TREE_CODE (arglist
) == TREE_VEC
);
7955 if (!is_overloaded_fn (fns
) && !identifier_p (fns
))
7957 error ("%q#D is not a function template", fns
);
7958 return error_mark_node
;
7961 if (BASELINK_P (fns
))
7963 BASELINK_FUNCTIONS (fns
) = build2 (TEMPLATE_ID_EXPR
,
7965 BASELINK_FUNCTIONS (fns
),
7970 type
= TREE_TYPE (fns
);
7971 if (TREE_CODE (fns
) == OVERLOAD
|| !type
)
7972 type
= unknown_type_node
;
7974 return build2 (TEMPLATE_ID_EXPR
, type
, fns
, arglist
);
7977 /* Within the scope of a template class S<T>, the name S gets bound
7978 (in build_self_reference) to a TYPE_DECL for the class, not a
7979 TEMPLATE_DECL. If DECL is a TYPE_DECL for current_class_type,
7980 or one of its enclosing classes, and that type is a template,
7981 return the associated TEMPLATE_DECL. Otherwise, the original
7984 Also handle the case when DECL is a TREE_LIST of ambiguous
7985 injected-class-names from different bases. */
7988 maybe_get_template_decl_from_type_decl (tree decl
)
7990 if (decl
== NULL_TREE
)
7993 /* DR 176: A lookup that finds an injected-class-name (10.2
7994 [class.member.lookup]) can result in an ambiguity in certain cases
7995 (for example, if it is found in more than one base class). If all of
7996 the injected-class-names that are found refer to specializations of
7997 the same class template, and if the name is followed by a
7998 template-argument-list, the reference refers to the class template
7999 itself and not a specialization thereof, and is not ambiguous. */
8000 if (TREE_CODE (decl
) == TREE_LIST
)
8002 tree t
, tmpl
= NULL_TREE
;
8003 for (t
= decl
; t
; t
= TREE_CHAIN (t
))
8005 tree elt
= maybe_get_template_decl_from_type_decl (TREE_VALUE (t
));
8008 else if (tmpl
!= elt
)
8011 if (tmpl
&& t
== NULL_TREE
)
8017 return (decl
!= NULL_TREE
8018 && DECL_SELF_REFERENCE_P (decl
)
8019 && CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (decl
)))
8020 ? CLASSTYPE_TI_TEMPLATE (TREE_TYPE (decl
)) : decl
;
8023 /* Given an IDENTIFIER_NODE (or type TEMPLATE_DECL) and a chain of
8024 parameters, find the desired type.
8026 D1 is the PTYPENAME terminal, and ARGLIST is the list of arguments.
8028 IN_DECL, if non-NULL, is the template declaration we are trying to
8031 If ENTERING_SCOPE is nonzero, we are about to enter the scope of
8032 the class we are looking up.
8034 Issue error and warning messages under control of COMPLAIN.
8036 If the template class is really a local class in a template
8037 function, then the FUNCTION_CONTEXT is the function in which it is
8040 ??? Note that this function is currently called *twice* for each
8041 template-id: the first time from the parser, while creating the
8042 incomplete type (finish_template_type), and the second type during the
8043 real instantiation (instantiate_template_class). This is surely something
8044 that we want to avoid. It also causes some problems with argument
8045 coercion (see convert_nontype_argument for more information on this). */
8048 lookup_template_class_1 (tree d1
, tree arglist
, tree in_decl
, tree context
,
8049 int entering_scope
, tsubst_flags_t complain
)
8051 tree templ
= NULL_TREE
, parmlist
;
8058 if (identifier_p (d1
))
8060 tree value
= innermost_non_namespace_value (d1
);
8061 if (value
&& DECL_TEMPLATE_TEMPLATE_PARM_P (value
))
8066 push_decl_namespace (context
);
8067 templ
= lookup_name (d1
);
8068 templ
= maybe_get_template_decl_from_type_decl (templ
);
8070 pop_decl_namespace ();
8073 context
= DECL_CONTEXT (templ
);
8075 else if (TREE_CODE (d1
) == TYPE_DECL
&& MAYBE_CLASS_TYPE_P (TREE_TYPE (d1
)))
8077 tree type
= TREE_TYPE (d1
);
8079 /* If we are declaring a constructor, say A<T>::A<T>, we will get
8080 an implicit typename for the second A. Deal with it. */
8081 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
8082 type
= TREE_TYPE (type
);
8084 if (CLASSTYPE_TEMPLATE_INFO (type
))
8086 templ
= CLASSTYPE_TI_TEMPLATE (type
);
8087 d1
= DECL_NAME (templ
);
8090 else if (TREE_CODE (d1
) == ENUMERAL_TYPE
8091 || (TYPE_P (d1
) && MAYBE_CLASS_TYPE_P (d1
)))
8093 templ
= TYPE_TI_TEMPLATE (d1
);
8094 d1
= DECL_NAME (templ
);
8096 else if (DECL_TYPE_TEMPLATE_P (d1
))
8099 d1
= DECL_NAME (templ
);
8100 context
= DECL_CONTEXT (templ
);
8102 else if (DECL_TEMPLATE_TEMPLATE_PARM_P (d1
))
8105 d1
= DECL_NAME (templ
);
8108 /* Issue an error message if we didn't find a template. */
8111 if (complain
& tf_error
)
8112 error ("%qT is not a template", d1
);
8113 return error_mark_node
;
8116 if (TREE_CODE (templ
) != TEMPLATE_DECL
8117 /* Make sure it's a user visible template, if it was named by
8119 || ((complain
& tf_user
) && !DECL_TEMPLATE_PARM_P (templ
)
8120 && !PRIMARY_TEMPLATE_P (templ
)))
8122 if (complain
& tf_error
)
8124 error ("non-template type %qT used as a template", d1
);
8126 error ("for template declaration %q+D", in_decl
);
8128 return error_mark_node
;
8131 complain
&= ~tf_user
;
8133 /* An alias that just changes the name of a template is equivalent to the
8134 other template, so if any of the arguments are pack expansions, strip
8135 the alias to avoid problems with a pack expansion passed to a non-pack
8136 alias template parameter (DR 1430). */
8137 if (pack_expansion_args_count (INNERMOST_TEMPLATE_ARGS (arglist
)))
8138 templ
= get_underlying_template (templ
);
8140 if (DECL_TEMPLATE_TEMPLATE_PARM_P (templ
))
8142 /* Create a new TEMPLATE_DECL and TEMPLATE_TEMPLATE_PARM node to store
8143 template arguments */
8149 parmlist
= DECL_INNERMOST_TEMPLATE_PARMS (templ
);
8151 /* Consider an example where a template template parameter declared as
8153 template <class T, class U = std::allocator<T> > class TT
8155 The template parameter level of T and U are one level larger than
8156 of TT. To proper process the default argument of U, say when an
8157 instantiation `TT<int>' is seen, we need to build the full
8158 arguments containing {int} as the innermost level. Outer levels,
8159 available when not appearing as default template argument, can be
8160 obtained from the arguments of the enclosing template.
8162 Suppose that TT is later substituted with std::vector. The above
8163 instantiation is `TT<int, std::allocator<T> >' with TT at
8164 level 1, and T at level 2, while the template arguments at level 1
8165 becomes {std::vector} and the inner level 2 is {int}. */
8167 outer
= DECL_CONTEXT (templ
);
8169 outer
= TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (outer
)));
8170 else if (current_template_parms
)
8172 /* This is an argument of the current template, so we haven't set
8173 DECL_CONTEXT yet. */
8174 tree relevant_template_parms
;
8176 /* Parameter levels that are greater than the level of the given
8177 template template parm are irrelevant. */
8178 relevant_template_parms
= current_template_parms
;
8179 while (TMPL_PARMS_DEPTH (relevant_template_parms
)
8180 != TEMPLATE_TYPE_LEVEL (TREE_TYPE (templ
)))
8181 relevant_template_parms
= TREE_CHAIN (relevant_template_parms
);
8183 outer
= template_parms_to_args (relevant_template_parms
);
8187 arglist
= add_to_template_args (outer
, arglist
);
8189 arglist2
= coerce_template_parms (parmlist
, arglist
, templ
,
8191 /*require_all_args=*/true,
8192 /*use_default_args=*/true);
8193 if (arglist2
== error_mark_node
8194 || (!uses_template_parms (arglist2
)
8195 && check_instantiated_args (templ
, arglist2
, complain
)))
8196 return error_mark_node
;
8198 parm
= bind_template_template_parm (TREE_TYPE (templ
), arglist2
);
8203 tree template_type
= TREE_TYPE (templ
);
8206 tree found
= NULL_TREE
;
8209 int is_dependent_type
;
8210 int use_partial_inst_tmpl
= false;
8212 if (template_type
== error_mark_node
)
8213 /* An error occurred while building the template TEMPL, and a
8214 diagnostic has most certainly been emitted for that
8215 already. Let's propagate that error. */
8216 return error_mark_node
;
8218 gen_tmpl
= most_general_template (templ
);
8219 parmlist
= DECL_TEMPLATE_PARMS (gen_tmpl
);
8220 parm_depth
= TMPL_PARMS_DEPTH (parmlist
);
8221 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
8223 if (arg_depth
== 1 && parm_depth
> 1)
8225 /* We've been given an incomplete set of template arguments.
8228 template <class T> struct S1 {
8229 template <class U> struct S2 {};
8230 template <class U> struct S2<U*> {};
8233 we will be called with an ARGLIST of `U*', but the
8234 TEMPLATE will be `template <class T> template
8235 <class U> struct S1<T>::S2'. We must fill in the missing
8238 = add_outermost_template_args (TYPE_TI_ARGS (TREE_TYPE (templ
)),
8240 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
8243 /* Now we should have enough arguments. */
8244 gcc_assert (parm_depth
== arg_depth
);
8246 /* From here on, we're only interested in the most general
8249 /* Calculate the BOUND_ARGS. These will be the args that are
8250 actually tsubst'd into the definition to create the
8252 arglist
= coerce_innermost_template_parms (parmlist
, arglist
, gen_tmpl
,
8254 /*require_all_args=*/true,
8255 /*use_default_args=*/true);
8257 if (arglist
== error_mark_node
)
8258 /* We were unable to bind the arguments. */
8259 return error_mark_node
;
8261 /* In the scope of a template class, explicit references to the
8262 template class refer to the type of the template, not any
8263 instantiation of it. For example, in:
8265 template <class T> class C { void f(C<T>); }
8267 the `C<T>' is just the same as `C'. Outside of the
8268 class, however, such a reference is an instantiation. */
8270 || !PRIMARY_TEMPLATE_P (gen_tmpl
)
8271 || currently_open_class (template_type
))
8272 /* comp_template_args is expensive, check it last. */
8273 && comp_template_args (TYPE_TI_ARGS (template_type
),
8275 return template_type
;
8277 /* If we already have this specialization, return it. */
8278 elt
.tmpl
= gen_tmpl
;
8280 elt
.spec
= NULL_TREE
;
8281 hash
= spec_hasher::hash (&elt
);
8282 entry
= type_specializations
->find_with_hash (&elt
, hash
);
8287 /* If the the template's constraints are not satisfied,
8288 then we cannot form a valid type.
8290 Note that the check is deferred until after the hash
8291 lookup. This prevents redundant checks on previously
8292 instantiated specializations. */
8293 if (flag_concepts
&& !constraints_satisfied_p (gen_tmpl
, arglist
))
8295 if (complain
& tf_error
)
8297 error ("template constraint failure");
8298 diagnose_constraints (input_location
, gen_tmpl
, arglist
);
8300 return error_mark_node
;
8303 is_dependent_type
= uses_template_parms (arglist
);
8305 /* If the deduced arguments are invalid, then the binding
8307 if (!is_dependent_type
8308 && check_instantiated_args (gen_tmpl
,
8309 INNERMOST_TEMPLATE_ARGS (arglist
),
8311 return error_mark_node
;
8313 if (!is_dependent_type
8314 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
8315 && !LAMBDA_TYPE_P (TREE_TYPE (gen_tmpl
))
8316 && TREE_CODE (CP_DECL_CONTEXT (gen_tmpl
)) == NAMESPACE_DECL
)
8318 found
= xref_tag_from_type (TREE_TYPE (gen_tmpl
),
8319 DECL_NAME (gen_tmpl
),
8320 /*tag_scope=*/ts_global
);
8324 context
= tsubst (DECL_CONTEXT (gen_tmpl
), arglist
,
8326 if (context
== error_mark_node
)
8327 return error_mark_node
;
8330 context
= global_namespace
;
8332 /* Create the type. */
8333 if (DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
8335 /* The user referred to a specialization of an alias
8336 template represented by GEN_TMPL.
8338 [temp.alias]/2 says:
8340 When a template-id refers to the specialization of an
8341 alias template, it is equivalent to the associated
8342 type obtained by substitution of its
8343 template-arguments for the template-parameters in the
8344 type-id of the alias template. */
8346 t
= tsubst (TREE_TYPE (gen_tmpl
), arglist
, complain
, in_decl
);
8347 /* Note that the call above (by indirectly calling
8348 register_specialization in tsubst_decl) registers the
8349 TYPE_DECL representing the specialization of the alias
8350 template. So next time someone substitutes ARGLIST for
8351 the template parms into the alias template (GEN_TMPL),
8352 she'll get that TYPE_DECL back. */
8354 if (t
== error_mark_node
)
8357 else if (TREE_CODE (template_type
) == ENUMERAL_TYPE
)
8359 if (!is_dependent_type
)
8361 set_current_access_from_decl (TYPE_NAME (template_type
));
8362 t
= start_enum (TYPE_IDENTIFIER (template_type
), NULL_TREE
,
8363 tsubst (ENUM_UNDERLYING_TYPE (template_type
),
8364 arglist
, complain
, in_decl
),
8365 SCOPED_ENUM_P (template_type
), NULL
);
8367 if (t
== error_mark_node
)
8372 /* We don't want to call start_enum for this type, since
8373 the values for the enumeration constants may involve
8374 template parameters. And, no one should be interested
8375 in the enumeration constants for such a type. */
8376 t
= cxx_make_type (ENUMERAL_TYPE
);
8377 SET_SCOPED_ENUM_P (t
, SCOPED_ENUM_P (template_type
));
8379 SET_OPAQUE_ENUM_P (t
, OPAQUE_ENUM_P (template_type
));
8380 ENUM_FIXED_UNDERLYING_TYPE_P (t
)
8381 = ENUM_FIXED_UNDERLYING_TYPE_P (template_type
);
8383 else if (CLASS_TYPE_P (template_type
))
8385 t
= make_class_type (TREE_CODE (template_type
));
8386 CLASSTYPE_DECLARED_CLASS (t
)
8387 = CLASSTYPE_DECLARED_CLASS (template_type
);
8388 SET_CLASSTYPE_IMPLICIT_INSTANTIATION (t
);
8389 TYPE_FOR_JAVA (t
) = TYPE_FOR_JAVA (template_type
);
8391 /* A local class. Make sure the decl gets registered properly. */
8392 if (context
== current_function_decl
)
8393 pushtag (DECL_NAME (gen_tmpl
), t
, /*tag_scope=*/ts_current
);
8395 if (comp_template_args (CLASSTYPE_TI_ARGS (template_type
), arglist
))
8396 /* This instantiation is another name for the primary
8397 template type. Set the TYPE_CANONICAL field
8399 TYPE_CANONICAL (t
) = template_type
;
8400 else if (any_template_arguments_need_structural_equality_p (arglist
))
8401 /* Some of the template arguments require structural
8402 equality testing, so this template class requires
8403 structural equality testing. */
8404 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8409 /* If we called start_enum or pushtag above, this information
8410 will already be set up. */
8413 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
8415 type_decl
= create_implicit_typedef (DECL_NAME (gen_tmpl
), t
);
8416 DECL_CONTEXT (type_decl
) = TYPE_CONTEXT (t
);
8417 DECL_SOURCE_LOCATION (type_decl
)
8418 = DECL_SOURCE_LOCATION (TYPE_STUB_DECL (template_type
));
8421 type_decl
= TYPE_NAME (t
);
8423 if (CLASS_TYPE_P (template_type
))
8425 TREE_PRIVATE (type_decl
)
8426 = TREE_PRIVATE (TYPE_MAIN_DECL (template_type
));
8427 TREE_PROTECTED (type_decl
)
8428 = TREE_PROTECTED (TYPE_MAIN_DECL (template_type
));
8429 if (CLASSTYPE_VISIBILITY_SPECIFIED (template_type
))
8431 DECL_VISIBILITY_SPECIFIED (type_decl
) = 1;
8432 DECL_VISIBILITY (type_decl
) = CLASSTYPE_VISIBILITY (template_type
);
8436 if (OVERLOAD_TYPE_P (t
)
8437 && !DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
8439 static const char *tags
[] = {"abi_tag", "may_alias"};
8441 for (unsigned ix
= 0; ix
!= 2; ix
++)
8444 = lookup_attribute (tags
[ix
], TYPE_ATTRIBUTES (template_type
));
8448 else if (!TREE_CHAIN (attributes
) && !TYPE_ATTRIBUTES (t
))
8449 TYPE_ATTRIBUTES (t
) = attributes
;
8452 = tree_cons (TREE_PURPOSE (attributes
),
8453 TREE_VALUE (attributes
),
8454 TYPE_ATTRIBUTES (t
));
8458 /* Let's consider the explicit specialization of a member
8459 of a class template specialization that is implicitly instantiated,
8464 template<class U> struct M {}; //#0
8469 struct S<int>::M<char> //#1
8473 [temp.expl.spec]/4 says this is valid.
8475 In this case, when we write:
8478 M is instantiated from the CLASSTYPE_TI_TEMPLATE of #1, not from
8481 When we encounter #1, we want to store the partial instantiation
8482 of M (template<class T> S<int>::M<T>) in its CLASSTYPE_TI_TEMPLATE.
8484 For all cases other than this "explicit specialization of member of a
8485 class template", we just want to store the most general template into
8486 the CLASSTYPE_TI_TEMPLATE of M.
8488 This case of "explicit specialization of member of a class template"
8490 1/ the enclosing class is an instantiation of, and therefore not
8491 the same as, the context of the most general template, and
8492 2/ we aren't looking at the partial instantiation itself, i.e.
8493 the innermost arguments are not the same as the innermost parms of
8494 the most general template.
8496 So it's only when 1/ and 2/ happens that we want to use the partial
8497 instantiation of the member template in lieu of its most general
8500 if (PRIMARY_TEMPLATE_P (gen_tmpl
)
8501 && TMPL_ARGS_HAVE_MULTIPLE_LEVELS (arglist
)
8502 /* the enclosing class must be an instantiation... */
8503 && CLASS_TYPE_P (context
)
8504 && !same_type_p (context
, DECL_CONTEXT (gen_tmpl
)))
8506 tree partial_inst_args
;
8507 TREE_VEC_LENGTH (arglist
)--;
8508 ++processing_template_decl
;
8510 tsubst (INNERMOST_TEMPLATE_ARGS
8511 (TYPE_TI_ARGS (TREE_TYPE (gen_tmpl
))),
8512 arglist
, complain
, NULL_TREE
);
8513 --processing_template_decl
;
8514 TREE_VEC_LENGTH (arglist
)++;
8515 use_partial_inst_tmpl
=
8516 /*...and we must not be looking at the partial instantiation
8518 !comp_template_args (INNERMOST_TEMPLATE_ARGS (arglist
),
8522 if (!use_partial_inst_tmpl
)
8523 /* This case is easy; there are no member templates involved. */
8527 /* This is a full instantiation of a member template. Find
8528 the partial instantiation of which this is an instance. */
8530 /* Temporarily reduce by one the number of levels in the ARGLIST
8531 so as to avoid comparing the last set of arguments. */
8532 TREE_VEC_LENGTH (arglist
)--;
8533 found
= tsubst (gen_tmpl
, arglist
, complain
, NULL_TREE
);
8534 TREE_VEC_LENGTH (arglist
)++;
8535 /* FOUND is either a proper class type, or an alias
8536 template specialization. In the later case, it's a
8537 TYPE_DECL, resulting from the substituting of arguments
8538 for parameters in the TYPE_DECL of the alias template
8539 done earlier. So be careful while getting the template
8541 found
= TREE_CODE (found
) == TYPE_DECL
8542 ? TYPE_TI_TEMPLATE (TREE_TYPE (found
))
8543 : CLASSTYPE_TI_TEMPLATE (found
);
8546 // Build template info for the new specialization.
8547 SET_TYPE_TEMPLATE_INFO (t
, build_template_info (found
, arglist
));
8550 slot
= type_specializations
->find_slot_with_hash (&elt
, hash
, INSERT
);
8551 entry
= ggc_alloc
<spec_entry
> ();
8555 /* Note this use of the partial instantiation so we can check it
8556 later in maybe_process_partial_specialization. */
8557 DECL_TEMPLATE_INSTANTIATIONS (found
)
8558 = tree_cons (arglist
, t
,
8559 DECL_TEMPLATE_INSTANTIATIONS (found
));
8561 if (TREE_CODE (template_type
) == ENUMERAL_TYPE
&& !is_dependent_type
8562 && !DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
8563 /* Now that the type has been registered on the instantiations
8564 list, we set up the enumerators. Because the enumeration
8565 constants may involve the enumeration type itself, we make
8566 sure to register the type first, and then create the
8567 constants. That way, doing tsubst_expr for the enumeration
8568 constants won't result in recursive calls here; we'll find
8569 the instantiation and exit above. */
8570 tsubst_enum (template_type
, t
, arglist
);
8572 if (CLASS_TYPE_P (template_type
) && is_dependent_type
)
8573 /* If the type makes use of template parameters, the
8574 code that generates debugging information will crash. */
8575 DECL_IGNORED_P (TYPE_MAIN_DECL (t
)) = 1;
8577 /* Possibly limit visibility based on template args. */
8578 TREE_PUBLIC (type_decl
) = 1;
8579 determine_visibility (type_decl
);
8581 inherit_targ_abi_tags (t
);
8587 /* Wrapper for lookup_template_class_1. */
8590 lookup_template_class (tree d1
, tree arglist
, tree in_decl
, tree context
,
8591 int entering_scope
, tsubst_flags_t complain
)
8594 timevar_push (TV_TEMPLATE_INST
);
8595 ret
= lookup_template_class_1 (d1
, arglist
, in_decl
, context
,
8596 entering_scope
, complain
);
8597 timevar_pop (TV_TEMPLATE_INST
);
8601 /* Return a TEMPLATE_ID_EXPR for the given variable template and ARGLIST. */
8604 lookup_template_variable (tree templ
, tree arglist
)
8606 /* The type of the expression is NULL_TREE since the template-id could refer
8607 to an explicit or partial specialization. */
8608 tree type
= NULL_TREE
;
8609 if (flag_concepts
&& variable_concept_p (templ
))
8610 /* Except that concepts are always bool. */
8611 type
= boolean_type_node
;
8612 return build2 (TEMPLATE_ID_EXPR
, type
, templ
, arglist
);
8615 /* Instantiate a variable declaration from a TEMPLATE_ID_EXPR for use. */
8618 finish_template_variable (tree var
, tsubst_flags_t complain
)
8620 tree templ
= TREE_OPERAND (var
, 0);
8621 tree arglist
= TREE_OPERAND (var
, 1);
8623 /* We never want to return a VAR_DECL for a variable concept, since they
8624 aren't instantiated. In a template, leave the TEMPLATE_ID_EXPR alone. */
8625 bool concept_p
= flag_concepts
&& variable_concept_p (templ
);
8626 if (concept_p
&& processing_template_decl
)
8629 tree tmpl_args
= DECL_TI_ARGS (DECL_TEMPLATE_RESULT (templ
));
8630 arglist
= add_outermost_template_args (tmpl_args
, arglist
);
8632 tree parms
= DECL_TEMPLATE_PARMS (templ
);
8633 arglist
= coerce_innermost_template_parms (parms
, arglist
, templ
, complain
,
8635 /*use_default*/true);
8637 if (flag_concepts
&& !constraints_satisfied_p (templ
, arglist
))
8639 if (complain
& tf_error
)
8641 error ("constraints for %qD not satisfied", templ
);
8642 diagnose_constraints (location_of (var
), templ
, arglist
);
8644 return error_mark_node
;
8647 /* If a template-id refers to a specialization of a variable
8648 concept, then the expression is true if and only if the
8649 concept's constraints are satisfied by the given template
8652 NOTE: This is an extension of Concepts Lite TS that
8653 allows constraints to be used in expressions. */
8656 tree decl
= DECL_TEMPLATE_RESULT (templ
);
8657 return evaluate_variable_concept (decl
, arglist
);
8660 return instantiate_template (templ
, arglist
, complain
);
8667 /* True when we should also visit template parameters that occur in
8668 non-deduced contexts. */
8669 bool include_nondeduced_p
;
8670 hash_set
<tree
> *visited
;
8673 /* Called from for_each_template_parm via walk_tree. */
8676 for_each_template_parm_r (tree
*tp
, int *walk_subtrees
, void *d
)
8679 struct pair_fn_data
*pfd
= (struct pair_fn_data
*) d
;
8680 tree_fn_t fn
= pfd
->fn
;
8681 void *data
= pfd
->data
;
8682 tree result
= NULL_TREE
;
8684 #define WALK_SUBTREE(NODE) \
8687 result = for_each_template_parm (NODE, fn, data, pfd->visited, \
8688 pfd->include_nondeduced_p); \
8689 if (result) goto out; \
8694 && (pfd
->include_nondeduced_p
|| TREE_CODE (t
) != TYPENAME_TYPE
))
8695 WALK_SUBTREE (TYPE_CONTEXT (t
));
8697 switch (TREE_CODE (t
))
8700 if (TYPE_PTRMEMFUNC_P (t
))
8706 if (!TYPE_TEMPLATE_INFO (t
))
8709 WALK_SUBTREE (TYPE_TI_ARGS (t
));
8713 WALK_SUBTREE (TYPE_MIN_VALUE (t
));
8714 WALK_SUBTREE (TYPE_MAX_VALUE (t
));
8718 /* Since we're not going to walk subtrees, we have to do this
8720 WALK_SUBTREE (TYPE_METHOD_BASETYPE (t
));
8724 /* Check the return type. */
8725 WALK_SUBTREE (TREE_TYPE (t
));
8727 /* Check the parameter types. Since default arguments are not
8728 instantiated until they are needed, the TYPE_ARG_TYPES may
8729 contain expressions that involve template parameters. But,
8730 no-one should be looking at them yet. And, once they're
8731 instantiated, they don't contain template parameters, so
8732 there's no point in looking at them then, either. */
8736 for (parm
= TYPE_ARG_TYPES (t
); parm
; parm
= TREE_CHAIN (parm
))
8737 WALK_SUBTREE (TREE_VALUE (parm
));
8739 /* Since we've already handled the TYPE_ARG_TYPES, we don't
8740 want walk_tree walking into them itself. */
8746 case UNDERLYING_TYPE
:
8747 if (pfd
->include_nondeduced_p
8748 && for_each_template_parm (TYPE_VALUES_RAW (t
), fn
, data
,
8750 pfd
->include_nondeduced_p
))
8751 return error_mark_node
;
8756 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
))
8757 WALK_SUBTREE (DECL_TI_ARGS (t
));
8762 if (TREE_CODE (t
) == CONST_DECL
&& DECL_TEMPLATE_PARM_P (t
))
8763 WALK_SUBTREE (DECL_INITIAL (t
));
8764 if (DECL_CONTEXT (t
)
8765 && pfd
->include_nondeduced_p
)
8766 WALK_SUBTREE (DECL_CONTEXT (t
));
8769 case BOUND_TEMPLATE_TEMPLATE_PARM
:
8770 /* Record template parameters such as `T' inside `TT<T>'. */
8771 WALK_SUBTREE (TYPE_TI_ARGS (t
));
8774 case TEMPLATE_TEMPLATE_PARM
:
8775 case TEMPLATE_TYPE_PARM
:
8776 case TEMPLATE_PARM_INDEX
:
8777 if (fn
&& (*fn
)(t
, data
))
8784 /* A template template parameter is encountered. */
8785 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
8786 WALK_SUBTREE (TREE_TYPE (t
));
8788 /* Already substituted template template parameter */
8794 WALK_SUBTREE (TYPENAME_TYPE_FULLNAME (t
));
8798 if (TREE_TYPE (t
) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t
))
8799 && pfd
->include_nondeduced_p
)
8800 WALK_SUBTREE (TYPE_PTRMEMFUNC_FN_TYPE (TREE_TYPE (t
)));
8805 /* If there's no type, then this thing must be some expression
8806 involving template parameters. */
8807 if (!fn
&& !TREE_TYPE (t
))
8808 return error_mark_node
;
8813 case IMPLICIT_CONV_EXPR
:
8814 case REINTERPRET_CAST_EXPR
:
8815 case CONST_CAST_EXPR
:
8816 case STATIC_CAST_EXPR
:
8817 case DYNAMIC_CAST_EXPR
:
8821 case PSEUDO_DTOR_EXPR
:
8823 return error_mark_node
;
8832 /* We didn't find any template parameters we liked. */
8837 /* For each TEMPLATE_TYPE_PARM, TEMPLATE_TEMPLATE_PARM,
8838 BOUND_TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX in T,
8839 call FN with the parameter and the DATA.
8840 If FN returns nonzero, the iteration is terminated, and
8841 for_each_template_parm returns 1. Otherwise, the iteration
8842 continues. If FN never returns a nonzero value, the value
8843 returned by for_each_template_parm is 0. If FN is NULL, it is
8844 considered to be the function which always returns 1.
8846 If INCLUDE_NONDEDUCED_P, then this routine will also visit template
8847 parameters that occur in non-deduced contexts. When false, only
8848 visits those template parameters that can be deduced. */
8851 for_each_template_parm (tree t
, tree_fn_t fn
, void* data
,
8852 hash_set
<tree
> *visited
,
8853 bool include_nondeduced_p
)
8855 struct pair_fn_data pfd
;
8861 pfd
.include_nondeduced_p
= include_nondeduced_p
;
8863 /* Walk the tree. (Conceptually, we would like to walk without
8864 duplicates, but for_each_template_parm_r recursively calls
8865 for_each_template_parm, so we would need to reorganize a fair
8866 bit to use walk_tree_without_duplicates, so we keep our own
8869 pfd
.visited
= visited
;
8871 pfd
.visited
= new hash_set
<tree
>;
8872 result
= cp_walk_tree (&t
,
8873 for_each_template_parm_r
,
8887 /* Returns true if T depends on any template parameter. */
8890 uses_template_parms (tree t
)
8896 int saved_processing_template_decl
;
8898 saved_processing_template_decl
= processing_template_decl
;
8899 if (!saved_processing_template_decl
)
8900 processing_template_decl
= 1;
8902 dependent_p
= dependent_type_p (t
);
8903 else if (TREE_CODE (t
) == TREE_VEC
)
8904 dependent_p
= any_dependent_template_arguments_p (t
);
8905 else if (TREE_CODE (t
) == TREE_LIST
)
8906 dependent_p
= (uses_template_parms (TREE_VALUE (t
))
8907 || uses_template_parms (TREE_CHAIN (t
)));
8908 else if (TREE_CODE (t
) == TYPE_DECL
)
8909 dependent_p
= dependent_type_p (TREE_TYPE (t
));
8912 || TREE_CODE (t
) == TEMPLATE_PARM_INDEX
8913 || TREE_CODE (t
) == OVERLOAD
8916 || TREE_CODE (t
) == TRAIT_EXPR
8917 || TREE_CODE (t
) == CONSTRUCTOR
8918 || CONSTANT_CLASS_P (t
))
8919 dependent_p
= (type_dependent_expression_p (t
)
8920 || value_dependent_expression_p (t
));
8923 gcc_assert (t
== error_mark_node
);
8924 dependent_p
= false;
8927 processing_template_decl
= saved_processing_template_decl
;
8932 /* Returns true iff current_function_decl is an incompletely instantiated
8933 template. Useful instead of processing_template_decl because the latter
8934 is set to 0 during instantiate_non_dependent_expr. */
8937 in_template_function (void)
8939 tree fn
= current_function_decl
;
8941 ++processing_template_decl
;
8942 ret
= (fn
&& DECL_LANG_SPECIFIC (fn
)
8943 && DECL_TEMPLATE_INFO (fn
)
8944 && any_dependent_template_arguments_p (DECL_TI_ARGS (fn
)));
8945 --processing_template_decl
;
8949 /* Returns true if T depends on any template parameter with level LEVEL. */
8952 uses_template_parms_level (tree t
, int level
)
8954 return for_each_template_parm (t
, template_parm_this_level_p
, &level
, NULL
,
8955 /*include_nondeduced_p=*/true);
8958 /* Returns TRUE iff INST is an instantiation we don't need to do in an
8959 ill-formed translation unit, i.e. a variable or function that isn't
8960 usable in a constant expression. */
8963 neglectable_inst_p (tree d
)
8966 && !(TREE_CODE (d
) == FUNCTION_DECL
? DECL_DECLARED_CONSTEXPR_P (d
)
8967 : decl_maybe_constant_var_p (d
)));
8970 /* Returns TRUE iff we should refuse to instantiate DECL because it's
8971 neglectable and instantiated from within an erroneous instantiation. */
8974 limit_bad_template_recursion (tree decl
)
8976 struct tinst_level
*lev
= current_tinst_level
;
8977 int errs
= errorcount
+ sorrycount
;
8978 if (lev
== NULL
|| errs
== 0 || !neglectable_inst_p (decl
))
8981 for (; lev
; lev
= lev
->next
)
8982 if (neglectable_inst_p (lev
->decl
))
8985 return (lev
&& errs
> lev
->errors
);
8988 static int tinst_depth
;
8989 extern int max_tinst_depth
;
8992 static GTY(()) struct tinst_level
*last_error_tinst_level
;
8994 /* We're starting to instantiate D; record the template instantiation context
8995 for diagnostics and to restore it later. */
8998 push_tinst_level (tree d
)
9000 return push_tinst_level_loc (d
, input_location
);
9003 /* We're starting to instantiate D; record the template instantiation context
9004 at LOC for diagnostics and to restore it later. */
9007 push_tinst_level_loc (tree d
, location_t loc
)
9009 struct tinst_level
*new_level
;
9011 if (tinst_depth
>= max_tinst_depth
)
9013 fatal_error (input_location
,
9014 "template instantiation depth exceeds maximum of %d"
9015 " (use -ftemplate-depth= to increase the maximum)",
9020 /* If the current instantiation caused problems, don't let it instantiate
9021 anything else. Do allow deduction substitution and decls usable in
9022 constant expressions. */
9023 if (limit_bad_template_recursion (d
))
9026 new_level
= ggc_alloc
<tinst_level
> ();
9027 new_level
->decl
= d
;
9028 new_level
->locus
= loc
;
9029 new_level
->errors
= errorcount
+sorrycount
;
9030 new_level
->in_system_header_p
= in_system_header_at (input_location
);
9031 new_level
->next
= current_tinst_level
;
9032 current_tinst_level
= new_level
;
9035 if (GATHER_STATISTICS
&& (tinst_depth
> depth_reached
))
9036 depth_reached
= tinst_depth
;
9041 /* We're done instantiating this template; return to the instantiation
9045 pop_tinst_level (void)
9047 /* Restore the filename and line number stashed away when we started
9048 this instantiation. */
9049 input_location
= current_tinst_level
->locus
;
9050 current_tinst_level
= current_tinst_level
->next
;
9054 /* We're instantiating a deferred template; restore the template
9055 instantiation context in which the instantiation was requested, which
9056 is one step out from LEVEL. Return the corresponding DECL or TYPE. */
9059 reopen_tinst_level (struct tinst_level
*level
)
9061 struct tinst_level
*t
;
9064 for (t
= level
; t
; t
= t
->next
)
9067 current_tinst_level
= level
;
9069 if (current_tinst_level
)
9070 current_tinst_level
->errors
= errorcount
+sorrycount
;
9074 /* Returns the TINST_LEVEL which gives the original instantiation
9077 struct tinst_level
*
9078 outermost_tinst_level (void)
9080 struct tinst_level
*level
= current_tinst_level
;
9083 level
= level
->next
;
9087 /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the
9088 vector of template arguments, as for tsubst.
9090 Returns an appropriate tsubst'd friend declaration. */
9093 tsubst_friend_function (tree decl
, tree args
)
9097 if (TREE_CODE (decl
) == FUNCTION_DECL
9098 && DECL_TEMPLATE_INSTANTIATION (decl
)
9099 && TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
9100 /* This was a friend declared with an explicit template
9101 argument list, e.g.:
9105 to indicate that f was a template instantiation, not a new
9106 function declaration. Now, we have to figure out what
9107 instantiation of what template. */
9109 tree template_id
, arglist
, fns
;
9112 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (current_class_type
));
9114 /* Friend functions are looked up in the containing namespace scope.
9115 We must enter that scope, to avoid finding member functions of the
9116 current class with same name. */
9117 push_nested_namespace (ns
);
9118 fns
= tsubst_expr (DECL_TI_TEMPLATE (decl
), args
,
9119 tf_warning_or_error
, NULL_TREE
,
9120 /*integral_constant_expression_p=*/false);
9121 pop_nested_namespace (ns
);
9122 arglist
= tsubst (DECL_TI_ARGS (decl
), args
,
9123 tf_warning_or_error
, NULL_TREE
);
9124 template_id
= lookup_template_function (fns
, arglist
);
9126 new_friend
= tsubst (decl
, args
, tf_warning_or_error
, NULL_TREE
);
9127 tmpl
= determine_specialization (template_id
, new_friend
,
9129 /*need_member_template=*/0,
9130 TREE_VEC_LENGTH (args
),
9132 return instantiate_template (tmpl
, new_args
, tf_error
);
9135 new_friend
= tsubst (decl
, args
, tf_warning_or_error
, NULL_TREE
);
9137 /* The NEW_FRIEND will look like an instantiation, to the
9138 compiler, but is not an instantiation from the point of view of
9139 the language. For example, we might have had:
9141 template <class T> struct S {
9142 template <class U> friend void f(T, U);
9145 Then, in S<int>, template <class U> void f(int, U) is not an
9146 instantiation of anything. */
9147 if (new_friend
== error_mark_node
)
9148 return error_mark_node
;
9150 DECL_USE_TEMPLATE (new_friend
) = 0;
9151 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
9153 DECL_USE_TEMPLATE (DECL_TEMPLATE_RESULT (new_friend
)) = 0;
9154 DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (new_friend
))
9155 = DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (decl
));
9158 /* The mangled name for the NEW_FRIEND is incorrect. The function
9159 is not a template instantiation and should not be mangled like
9160 one. Therefore, we forget the mangling here; we'll recompute it
9161 later if we need it. */
9162 if (TREE_CODE (new_friend
) != TEMPLATE_DECL
)
9164 SET_DECL_RTL (new_friend
, NULL
);
9165 SET_DECL_ASSEMBLER_NAME (new_friend
, NULL_TREE
);
9168 if (DECL_NAMESPACE_SCOPE_P (new_friend
))
9171 tree new_friend_template_info
;
9172 tree new_friend_result_template_info
;
9174 int new_friend_is_defn
;
9176 /* We must save some information from NEW_FRIEND before calling
9177 duplicate decls since that function will free NEW_FRIEND if
9179 new_friend_template_info
= DECL_TEMPLATE_INFO (new_friend
);
9180 new_friend_is_defn
=
9181 (DECL_INITIAL (DECL_TEMPLATE_RESULT
9182 (template_for_substitution (new_friend
)))
9184 if (TREE_CODE (new_friend
) == TEMPLATE_DECL
)
9186 /* This declaration is a `primary' template. */
9187 DECL_PRIMARY_TEMPLATE (new_friend
) = new_friend
;
9189 new_friend_result_template_info
9190 = DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (new_friend
));
9193 new_friend_result_template_info
= NULL_TREE
;
9195 /* Make the init_value nonzero so pushdecl knows this is a defn. */
9196 if (new_friend_is_defn
)
9197 DECL_INITIAL (new_friend
) = error_mark_node
;
9199 /* Inside pushdecl_namespace_level, we will push into the
9200 current namespace. However, the friend function should go
9201 into the namespace of the template. */
9202 ns
= decl_namespace_context (new_friend
);
9203 push_nested_namespace (ns
);
9204 old_decl
= pushdecl_namespace_level (new_friend
, /*is_friend=*/true);
9205 pop_nested_namespace (ns
);
9207 if (old_decl
== error_mark_node
)
9208 return error_mark_node
;
9210 if (old_decl
!= new_friend
)
9212 /* This new friend declaration matched an existing
9213 declaration. For example, given:
9215 template <class T> void f(T);
9216 template <class U> class C {
9217 template <class T> friend void f(T) {}
9220 the friend declaration actually provides the definition
9221 of `f', once C has been instantiated for some type. So,
9222 old_decl will be the out-of-class template declaration,
9223 while new_friend is the in-class definition.
9225 But, if `f' was called before this point, the
9226 instantiation of `f' will have DECL_TI_ARGS corresponding
9227 to `T' but not to `U', references to which might appear
9228 in the definition of `f'. Previously, the most general
9229 template for an instantiation of `f' was the out-of-class
9230 version; now it is the in-class version. Therefore, we
9231 run through all specialization of `f', adding to their
9232 DECL_TI_ARGS appropriately. In particular, they need a
9233 new set of outer arguments, corresponding to the
9234 arguments for this class instantiation.
9236 The same situation can arise with something like this:
9239 template <class T> class C {
9243 when `C<int>' is instantiated. Now, `f(int)' is defined
9246 if (!new_friend_is_defn
)
9247 /* On the other hand, if the in-class declaration does
9248 *not* provide a definition, then we don't want to alter
9249 existing definitions. We can just leave everything
9254 tree new_template
= TI_TEMPLATE (new_friend_template_info
);
9255 tree new_args
= TI_ARGS (new_friend_template_info
);
9257 /* Overwrite whatever template info was there before, if
9258 any, with the new template information pertaining to
9260 DECL_TEMPLATE_INFO (old_decl
) = new_friend_template_info
;
9262 if (TREE_CODE (old_decl
) != TEMPLATE_DECL
)
9264 /* We should have called reregister_specialization in
9266 gcc_assert (retrieve_specialization (new_template
,
9270 /* Instantiate it if the global has already been used. */
9271 if (DECL_ODR_USED (old_decl
))
9272 instantiate_decl (old_decl
, /*defer_ok=*/true,
9273 /*expl_inst_class_mem_p=*/false);
9279 /* Indicate that the old function template is a partial
9281 DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (old_decl
))
9282 = new_friend_result_template_info
;
9284 gcc_assert (new_template
9285 == most_general_template (new_template
));
9286 gcc_assert (new_template
!= old_decl
);
9288 /* Reassign any specializations already in the hash table
9289 to the new more general template, and add the
9290 additional template args. */
9291 for (t
= DECL_TEMPLATE_INSTANTIATIONS (old_decl
);
9295 tree spec
= TREE_VALUE (t
);
9298 elt
.tmpl
= old_decl
;
9299 elt
.args
= DECL_TI_ARGS (spec
);
9300 elt
.spec
= NULL_TREE
;
9302 decl_specializations
->remove_elt (&elt
);
9305 = add_outermost_template_args (new_args
,
9306 DECL_TI_ARGS (spec
));
9308 register_specialization
9309 (spec
, new_template
, DECL_TI_ARGS (spec
), true, 0);
9312 DECL_TEMPLATE_INSTANTIATIONS (old_decl
) = NULL_TREE
;
9316 /* The information from NEW_FRIEND has been merged into OLD_DECL
9317 by duplicate_decls. */
9318 new_friend
= old_decl
;
9323 tree context
= DECL_CONTEXT (new_friend
);
9327 template <class T> class C {
9328 template <class U> friend void C1<U>::f (); // case 1
9329 friend void C2<T>::f (); // case 2
9331 we only need to make sure CONTEXT is a complete type for
9332 case 2. To distinguish between the two cases, we note that
9333 CONTEXT of case 1 remains dependent type after tsubst while
9334 this isn't true for case 2. */
9335 ++processing_template_decl
;
9336 dependent_p
= dependent_type_p (context
);
9337 --processing_template_decl
;
9340 && !complete_type_or_else (context
, NULL_TREE
))
9341 return error_mark_node
;
9343 if (COMPLETE_TYPE_P (context
))
9345 tree fn
= new_friend
;
9346 /* do_friend adds the TEMPLATE_DECL for any member friend
9347 template even if it isn't a member template, i.e.
9348 template <class T> friend A<T>::f();
9349 Look through it in that case. */
9350 if (TREE_CODE (fn
) == TEMPLATE_DECL
9351 && !PRIMARY_TEMPLATE_P (fn
))
9352 fn
= DECL_TEMPLATE_RESULT (fn
);
9353 /* Check to see that the declaration is really present, and,
9354 possibly obtain an improved declaration. */
9355 fn
= check_classfn (context
, fn
, NULL_TREE
);
9365 /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of
9366 template arguments, as for tsubst.
9368 Returns an appropriate tsubst'd friend type or error_mark_node on
9372 tsubst_friend_class (tree friend_tmpl
, tree args
)
9378 if (DECL_TEMPLATE_TEMPLATE_PARM_P (friend_tmpl
))
9380 tree t
= tsubst (TREE_TYPE (friend_tmpl
), args
, tf_none
, NULL_TREE
);
9381 return TREE_TYPE (t
);
9384 context
= CP_DECL_CONTEXT (friend_tmpl
);
9386 if (context
!= global_namespace
)
9388 if (TREE_CODE (context
) == NAMESPACE_DECL
)
9389 push_nested_namespace (context
);
9391 push_nested_class (tsubst (context
, args
, tf_none
, NULL_TREE
));
9394 /* Look for a class template declaration. We look for hidden names
9395 because two friend declarations of the same template are the
9396 same. For example, in:
9399 template <typename> friend class F;
9401 template <typename> struct B {
9402 template <typename> friend class F;
9405 both F templates are the same. */
9406 tmpl
= lookup_name_real (DECL_NAME (friend_tmpl
), 0, 0,
9407 /*block_p=*/true, 0, LOOKUP_HIDDEN
);
9409 /* But, if we don't find one, it might be because we're in a
9410 situation like this:
9418 Here, in the scope of (say) S<int>, `S' is bound to a TYPE_DECL
9419 for `S<int>', not the TEMPLATE_DECL. */
9420 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
9422 tmpl
= lookup_name_prefer_type (DECL_NAME (friend_tmpl
), 1);
9423 tmpl
= maybe_get_template_decl_from_type_decl (tmpl
);
9426 if (tmpl
&& DECL_CLASS_TEMPLATE_P (tmpl
))
9428 /* The friend template has already been declared. Just
9429 check to see that the declarations match, and install any new
9430 default parameters. We must tsubst the default parameters,
9431 of course. We only need the innermost template parameters
9432 because that is all that redeclare_class_template will look
9434 if (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (friend_tmpl
))
9435 > TMPL_ARGS_DEPTH (args
))
9438 location_t saved_input_location
;
9439 parms
= tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_tmpl
),
9440 args
, tf_warning_or_error
);
9442 saved_input_location
= input_location
;
9443 input_location
= DECL_SOURCE_LOCATION (friend_tmpl
);
9444 tree cons
= get_constraints (tmpl
);
9445 redeclare_class_template (TREE_TYPE (tmpl
), parms
, cons
);
9446 input_location
= saved_input_location
;
9450 friend_type
= TREE_TYPE (tmpl
);
9454 /* The friend template has not already been declared. In this
9455 case, the instantiation of the template class will cause the
9456 injection of this template into the global scope. */
9457 tmpl
= tsubst (friend_tmpl
, args
, tf_warning_or_error
, NULL_TREE
);
9458 if (tmpl
== error_mark_node
)
9459 return error_mark_node
;
9461 /* The new TMPL is not an instantiation of anything, so we
9462 forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE for
9463 the new type because that is supposed to be the corresponding
9464 template decl, i.e., TMPL. */
9465 DECL_USE_TEMPLATE (tmpl
) = 0;
9466 DECL_TEMPLATE_INFO (tmpl
) = NULL_TREE
;
9467 CLASSTYPE_USE_TEMPLATE (TREE_TYPE (tmpl
)) = 0;
9468 CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl
))
9469 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl
)));
9471 /* Inject this template into the global scope. */
9472 friend_type
= TREE_TYPE (pushdecl_top_level_maybe_friend (tmpl
, true));
9475 if (context
!= global_namespace
)
9477 if (TREE_CODE (context
) == NAMESPACE_DECL
)
9478 pop_nested_namespace (context
);
9480 pop_nested_class ();
9486 /* Returns zero if TYPE cannot be completed later due to circularity.
9487 Otherwise returns one. */
9490 can_complete_type_without_circularity (tree type
)
9492 if (type
== NULL_TREE
|| type
== error_mark_node
)
9494 else if (COMPLETE_TYPE_P (type
))
9496 else if (TREE_CODE (type
) == ARRAY_TYPE
&& TYPE_DOMAIN (type
))
9497 return can_complete_type_without_circularity (TREE_TYPE (type
));
9498 else if (CLASS_TYPE_P (type
)
9499 && TYPE_BEING_DEFINED (TYPE_MAIN_VARIANT (type
)))
9505 static tree
tsubst_omp_clauses (tree
, bool, bool, tree
, tsubst_flags_t
, tree
);
9507 /* Apply any attributes which had to be deferred until instantiation
9508 time. DECL_P, ATTRIBUTES and ATTR_FLAGS are as cplus_decl_attributes;
9509 ARGS, COMPLAIN, IN_DECL are as tsubst. */
9512 apply_late_template_attributes (tree
*decl_p
, tree attributes
, int attr_flags
,
9513 tree args
, tsubst_flags_t complain
, tree in_decl
)
9515 tree last_dep
= NULL_TREE
;
9519 for (t
= attributes
; t
; t
= TREE_CHAIN (t
))
9520 if (ATTR_IS_DEPENDENT (t
))
9523 attributes
= copy_list (attributes
);
9527 if (DECL_P (*decl_p
))
9529 if (TREE_TYPE (*decl_p
) == error_mark_node
)
9531 p
= &DECL_ATTRIBUTES (*decl_p
);
9534 p
= &TYPE_ATTRIBUTES (*decl_p
);
9538 tree late_attrs
= NULL_TREE
;
9539 tree
*q
= &late_attrs
;
9541 for (*p
= attributes
; *p
; )
9544 if (ATTR_IS_DEPENDENT (t
))
9546 *p
= TREE_CHAIN (t
);
9547 TREE_CHAIN (t
) = NULL_TREE
;
9548 if ((flag_openmp
|| flag_openmp_simd
|| flag_cilkplus
)
9549 && is_attribute_p ("omp declare simd",
9550 get_attribute_name (t
))
9553 tree clauses
= TREE_VALUE (TREE_VALUE (t
));
9554 clauses
= tsubst_omp_clauses (clauses
, true, false, args
,
9556 c_omp_declare_simd_clauses_to_decls (*decl_p
, clauses
);
9557 clauses
= finish_omp_clauses (clauses
, false, true);
9558 tree parms
= DECL_ARGUMENTS (*decl_p
);
9560 = c_omp_declare_simd_clauses_to_numbers (parms
, clauses
);
9562 TREE_VALUE (TREE_VALUE (t
)) = clauses
;
9564 TREE_VALUE (t
) = NULL_TREE
;
9566 /* If the first attribute argument is an identifier, don't
9567 pass it through tsubst. Attributes like mode, format,
9568 cleanup and several target specific attributes expect it
9570 else if (attribute_takes_identifier_p (get_attribute_name (t
))
9574 = tsubst_expr (TREE_CHAIN (TREE_VALUE (t
)), args
, complain
,
9576 /*integral_constant_expression_p=*/false);
9577 if (chain
!= TREE_CHAIN (TREE_VALUE (t
)))
9579 = tree_cons (NULL_TREE
, TREE_VALUE (TREE_VALUE (t
)),
9582 else if (TREE_VALUE (t
) && PACK_EXPANSION_P (TREE_VALUE (t
)))
9584 /* An attribute pack expansion. */
9585 tree purp
= TREE_PURPOSE (t
);
9586 tree pack
= (tsubst_pack_expansion
9587 (TREE_VALUE (t
), args
, complain
, in_decl
));
9588 int len
= TREE_VEC_LENGTH (pack
);
9589 for (int i
= 0; i
< len
; ++i
)
9591 tree elt
= TREE_VEC_ELT (pack
, i
);
9592 *q
= build_tree_list (purp
, elt
);
9593 q
= &TREE_CHAIN (*q
);
9599 = tsubst_expr (TREE_VALUE (t
), args
, complain
, in_decl
,
9600 /*integral_constant_expression_p=*/false);
9602 q
= &TREE_CHAIN (t
);
9605 p
= &TREE_CHAIN (t
);
9608 cplus_decl_attributes (decl_p
, late_attrs
, attr_flags
);
9612 /* Perform (or defer) access check for typedefs that were referenced
9613 from within the template TMPL code.
9614 This is a subroutine of instantiate_decl and instantiate_class_template.
9615 TMPL is the template to consider and TARGS is the list of arguments of
9619 perform_typedefs_access_check (tree tmpl
, tree targs
)
9621 location_t saved_location
;
9623 qualified_typedef_usage_t
*iter
;
9626 || (!CLASS_TYPE_P (tmpl
)
9627 && TREE_CODE (tmpl
) != FUNCTION_DECL
))
9630 saved_location
= input_location
;
9631 FOR_EACH_VEC_SAFE_ELT (get_types_needing_access_check (tmpl
), i
, iter
)
9633 tree type_decl
= iter
->typedef_decl
;
9634 tree type_scope
= iter
->context
;
9636 if (!type_decl
|| !type_scope
|| !CLASS_TYPE_P (type_scope
))
9639 if (uses_template_parms (type_decl
))
9640 type_decl
= tsubst (type_decl
, targs
, tf_error
, NULL_TREE
);
9641 if (uses_template_parms (type_scope
))
9642 type_scope
= tsubst (type_scope
, targs
, tf_error
, NULL_TREE
);
9644 /* Make access check error messages point to the location
9645 of the use of the typedef. */
9646 input_location
= iter
->locus
;
9647 perform_or_defer_access_check (TYPE_BINFO (type_scope
),
9648 type_decl
, type_decl
,
9649 tf_warning_or_error
);
9651 input_location
= saved_location
;
9655 instantiate_class_template_1 (tree type
)
9657 tree templ
, args
, pattern
, t
, member
;
9661 unsigned int saved_maximum_field_alignment
;
9664 if (type
== error_mark_node
)
9665 return error_mark_node
;
9667 if (COMPLETE_OR_OPEN_TYPE_P (type
)
9668 || uses_template_parms (type
))
9671 /* Figure out which template is being instantiated. */
9672 templ
= most_general_template (CLASSTYPE_TI_TEMPLATE (type
));
9673 gcc_assert (TREE_CODE (templ
) == TEMPLATE_DECL
);
9675 /* Determine what specialization of the original template to
9677 t
= most_specialized_partial_spec (type
, tf_warning_or_error
);
9678 if (t
== error_mark_node
)
9680 TYPE_BEING_DEFINED (type
) = 1;
9681 return error_mark_node
;
9685 /* This TYPE is actually an instantiation of a partial
9686 specialization. We replace the innermost set of ARGS with
9687 the arguments appropriate for substitution. For example,
9690 template <class T> struct S {};
9691 template <class T> struct S<T*> {};
9693 and supposing that we are instantiating S<int*>, ARGS will
9694 presently be {int*} -- but we need {int}. */
9695 pattern
= TREE_TYPE (t
);
9696 args
= TREE_PURPOSE (t
);
9700 pattern
= TREE_TYPE (templ
);
9701 args
= CLASSTYPE_TI_ARGS (type
);
9704 /* If the template we're instantiating is incomplete, then clearly
9705 there's nothing we can do. */
9706 if (!COMPLETE_TYPE_P (pattern
))
9709 /* If we've recursively instantiated too many templates, stop. */
9710 if (! push_tinst_level (type
))
9713 /* Now we're really doing the instantiation. Mark the type as in
9714 the process of being defined. */
9715 TYPE_BEING_DEFINED (type
) = 1;
9717 /* We may be in the middle of deferred access check. Disable
9719 push_deferring_access_checks (dk_no_deferred
);
9721 int saved_unevaluated_operand
= cp_unevaluated_operand
;
9722 int saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
9724 fn_context
= decl_function_context (TYPE_MAIN_DECL (type
));
9725 /* Also avoid push_to_top_level for a lambda in an NSDMI. */
9726 if (!fn_context
&& LAMBDA_TYPE_P (type
) && TYPE_CLASS_SCOPE_P (type
))
9727 fn_context
= error_mark_node
;
9729 push_to_top_level ();
9732 cp_unevaluated_operand
= 0;
9733 c_inhibit_evaluation_warnings
= 0;
9735 /* Use #pragma pack from the template context. */
9736 saved_maximum_field_alignment
= maximum_field_alignment
;
9737 maximum_field_alignment
= TYPE_PRECISION (pattern
);
9739 SET_CLASSTYPE_INTERFACE_UNKNOWN (type
);
9741 /* Set the input location to the most specialized template definition.
9742 This is needed if tsubsting causes an error. */
9743 typedecl
= TYPE_MAIN_DECL (pattern
);
9744 input_location
= DECL_SOURCE_LOCATION (TYPE_NAME (type
)) =
9745 DECL_SOURCE_LOCATION (typedecl
);
9747 TYPE_PACKED (type
) = TYPE_PACKED (pattern
);
9748 TYPE_ALIGN (type
) = TYPE_ALIGN (pattern
);
9749 TYPE_USER_ALIGN (type
) = TYPE_USER_ALIGN (pattern
);
9750 TYPE_FOR_JAVA (type
) = TYPE_FOR_JAVA (pattern
); /* For libjava's JArray<T> */
9751 if (ANON_AGGR_TYPE_P (pattern
))
9752 SET_ANON_AGGR_TYPE_P (type
);
9753 if (CLASSTYPE_VISIBILITY_SPECIFIED (pattern
))
9755 CLASSTYPE_VISIBILITY_SPECIFIED (type
) = 1;
9756 CLASSTYPE_VISIBILITY (type
) = CLASSTYPE_VISIBILITY (pattern
);
9757 /* Adjust visibility for template arguments. */
9758 determine_visibility (TYPE_MAIN_DECL (type
));
9760 if (CLASS_TYPE_P (type
))
9761 CLASSTYPE_FINAL (type
) = CLASSTYPE_FINAL (pattern
);
9763 pbinfo
= TYPE_BINFO (pattern
);
9765 /* We should never instantiate a nested class before its enclosing
9766 class; we need to look up the nested class by name before we can
9767 instantiate it, and that lookup should instantiate the enclosing
9769 gcc_assert (!DECL_CLASS_SCOPE_P (TYPE_MAIN_DECL (pattern
))
9770 || COMPLETE_OR_OPEN_TYPE_P (TYPE_CONTEXT (type
)));
9772 base_list
= NULL_TREE
;
9773 if (BINFO_N_BASE_BINFOS (pbinfo
))
9779 /* We must enter the scope containing the type, as that is where
9780 the accessibility of types named in dependent bases are
9782 pushed_scope
= push_scope (CP_TYPE_CONTEXT (type
));
9784 /* Substitute into each of the bases to determine the actual
9786 for (i
= 0; BINFO_BASE_ITERATE (pbinfo
, i
, pbase_binfo
); i
++)
9789 tree access
= BINFO_BASE_ACCESS (pbinfo
, i
);
9790 tree expanded_bases
= NULL_TREE
;
9793 if (PACK_EXPANSION_P (BINFO_TYPE (pbase_binfo
)))
9796 tsubst_pack_expansion (BINFO_TYPE (pbase_binfo
),
9797 args
, tf_error
, NULL_TREE
);
9798 if (expanded_bases
== error_mark_node
)
9801 len
= TREE_VEC_LENGTH (expanded_bases
);
9804 for (idx
= 0; idx
< len
; idx
++)
9807 /* Extract the already-expanded base class. */
9808 base
= TREE_VEC_ELT (expanded_bases
, idx
);
9810 /* Substitute to figure out the base class. */
9811 base
= tsubst (BINFO_TYPE (pbase_binfo
), args
, tf_error
,
9814 if (base
== error_mark_node
)
9817 base_list
= tree_cons (access
, base
, base_list
);
9818 if (BINFO_VIRTUAL_P (pbase_binfo
))
9819 TREE_TYPE (base_list
) = integer_type_node
;
9823 /* The list is now in reverse order; correct that. */
9824 base_list
= nreverse (base_list
);
9827 pop_scope (pushed_scope
);
9829 /* Now call xref_basetypes to set up all the base-class
9831 xref_basetypes (type
, base_list
);
9833 apply_late_template_attributes (&type
, TYPE_ATTRIBUTES (pattern
),
9834 (int) ATTR_FLAG_TYPE_IN_PLACE
,
9835 args
, tf_error
, NULL_TREE
);
9836 fixup_attribute_variants (type
);
9838 /* Now that our base classes are set up, enter the scope of the
9839 class, so that name lookups into base classes, etc. will work
9840 correctly. This is precisely analogous to what we do in
9841 begin_class_definition when defining an ordinary non-template
9842 class, except we also need to push the enclosing classes. */
9843 push_nested_class (type
);
9845 /* Now members are processed in the order of declaration. */
9846 for (member
= CLASSTYPE_DECL_LIST (pattern
);
9847 member
; member
= TREE_CHAIN (member
))
9849 tree t
= TREE_VALUE (member
);
9851 if (TREE_PURPOSE (member
))
9855 /* Build new CLASSTYPE_NESTED_UTDS. */
9858 bool class_template_p
;
9860 class_template_p
= (TREE_CODE (t
) != ENUMERAL_TYPE
9861 && TYPE_LANG_SPECIFIC (t
)
9862 && CLASSTYPE_IS_TEMPLATE (t
));
9863 /* If the member is a class template, then -- even after
9864 substitution -- there may be dependent types in the
9865 template argument list for the class. We increment
9866 PROCESSING_TEMPLATE_DECL so that dependent_type_p, as
9867 that function will assume that no types are dependent
9868 when outside of a template. */
9869 if (class_template_p
)
9870 ++processing_template_decl
;
9871 newtag
= tsubst (t
, args
, tf_error
, NULL_TREE
);
9872 if (class_template_p
)
9873 --processing_template_decl
;
9874 if (newtag
== error_mark_node
)
9877 if (TREE_CODE (newtag
) != ENUMERAL_TYPE
)
9879 tree name
= TYPE_IDENTIFIER (t
);
9881 if (class_template_p
)
9882 /* Unfortunately, lookup_template_class sets
9883 CLASSTYPE_IMPLICIT_INSTANTIATION for a partial
9884 instantiation (i.e., for the type of a member
9885 template class nested within a template class.)
9886 This behavior is required for
9887 maybe_process_partial_specialization to work
9888 correctly, but is not accurate in this case;
9889 the TAG is not an instantiation of anything.
9890 (The corresponding TEMPLATE_DECL is an
9891 instantiation, but the TYPE is not.) */
9892 CLASSTYPE_USE_TEMPLATE (newtag
) = 0;
9894 /* Now, we call pushtag to put this NEWTAG into the scope of
9895 TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid
9896 pushtag calling push_template_decl. We don't have to do
9897 this for enums because it will already have been done in
9900 SET_IDENTIFIER_TYPE_VALUE (name
, newtag
);
9901 pushtag (name
, newtag
, /*tag_scope=*/ts_current
);
9904 else if (DECL_DECLARES_FUNCTION_P (t
))
9906 /* Build new TYPE_METHODS. */
9909 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9910 ++processing_template_decl
;
9911 r
= tsubst (t
, args
, tf_error
, NULL_TREE
);
9912 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9913 --processing_template_decl
;
9914 set_current_access_from_decl (r
);
9915 finish_member_declaration (r
);
9916 /* Instantiate members marked with attribute used. */
9917 if (r
!= error_mark_node
&& DECL_PRESERVE_P (r
))
9919 if (TREE_CODE (r
) == FUNCTION_DECL
9920 && DECL_OMP_DECLARE_REDUCTION_P (r
))
9921 cp_check_omp_declare_reduction (r
);
9923 else if (DECL_CLASS_TEMPLATE_P (t
)
9924 && LAMBDA_TYPE_P (TREE_TYPE (t
)))
9925 /* A closure type for a lambda in a default argument for a
9926 member template. Ignore it; it will be instantiated with
9927 the default argument. */;
9930 /* Build new TYPE_FIELDS. */
9931 if (TREE_CODE (t
) == STATIC_ASSERT
)
9935 ++c_inhibit_evaluation_warnings
;
9937 tsubst_expr (STATIC_ASSERT_CONDITION (t
), args
,
9938 tf_warning_or_error
, NULL_TREE
,
9939 /*integral_constant_expression_p=*/true);
9940 --c_inhibit_evaluation_warnings
;
9942 finish_static_assert (condition
,
9943 STATIC_ASSERT_MESSAGE (t
),
9944 STATIC_ASSERT_SOURCE_LOCATION (t
),
9947 else if (TREE_CODE (t
) != CONST_DECL
)
9950 tree vec
= NULL_TREE
;
9953 /* The file and line for this declaration, to
9954 assist in error message reporting. Since we
9955 called push_tinst_level above, we don't need to
9957 input_location
= DECL_SOURCE_LOCATION (t
);
9959 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9960 ++processing_template_decl
;
9961 r
= tsubst (t
, args
, tf_warning_or_error
, NULL_TREE
);
9962 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9963 --processing_template_decl
;
9965 if (TREE_CODE (r
) == TREE_VEC
)
9967 /* A capture pack became multiple fields. */
9969 len
= TREE_VEC_LENGTH (vec
);
9972 for (int i
= 0; i
< len
; ++i
)
9975 r
= TREE_VEC_ELT (vec
, i
);
9980 [t]he initialization (and any associated
9981 side-effects) of a static data member does
9982 not occur unless the static data member is
9983 itself used in a way that requires the
9984 definition of the static data member to
9987 Therefore, we do not substitute into the
9988 initialized for the static data member here. */
9989 finish_static_data_member_decl
9992 /*init_const_expr_p=*/false,
9993 /*asmspec_tree=*/NULL_TREE
,
9995 /* Instantiate members marked with attribute used. */
9996 if (r
!= error_mark_node
&& DECL_PRESERVE_P (r
))
9999 else if (TREE_CODE (r
) == FIELD_DECL
)
10001 /* Determine whether R has a valid type and can be
10002 completed later. If R is invalid, then its type
10003 is replaced by error_mark_node. */
10004 tree rtype
= TREE_TYPE (r
);
10005 if (can_complete_type_without_circularity (rtype
))
10006 complete_type (rtype
);
10008 if (!COMPLETE_TYPE_P (rtype
))
10010 cxx_incomplete_type_error (r
, rtype
);
10011 TREE_TYPE (r
) = error_mark_node
;
10015 /* If it is a TYPE_DECL for a class-scoped ENUMERAL_TYPE,
10016 such a thing will already have been added to the field
10017 list by tsubst_enum in finish_member_declaration in the
10018 CLASSTYPE_NESTED_UTDS case above. */
10019 if (!(TREE_CODE (r
) == TYPE_DECL
10020 && TREE_CODE (TREE_TYPE (r
)) == ENUMERAL_TYPE
10021 && DECL_ARTIFICIAL (r
)))
10023 set_current_access_from_decl (r
);
10024 finish_member_declaration (r
);
10032 if (TYPE_P (t
) || DECL_CLASS_TEMPLATE_P (t
)
10033 || DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
10035 /* Build new CLASSTYPE_FRIEND_CLASSES. */
10037 tree friend_type
= t
;
10038 bool adjust_processing_template_decl
= false;
10040 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
10042 /* template <class T> friend class C; */
10043 friend_type
= tsubst_friend_class (friend_type
, args
);
10044 adjust_processing_template_decl
= true;
10046 else if (TREE_CODE (friend_type
) == UNBOUND_CLASS_TEMPLATE
)
10048 /* template <class T> friend class C::D; */
10049 friend_type
= tsubst (friend_type
, args
,
10050 tf_warning_or_error
, NULL_TREE
);
10051 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
10052 friend_type
= TREE_TYPE (friend_type
);
10053 adjust_processing_template_decl
= true;
10055 else if (TREE_CODE (friend_type
) == TYPENAME_TYPE
10056 || TREE_CODE (friend_type
) == TEMPLATE_TYPE_PARM
)
10058 /* This could be either
10062 when dependent_type_p is false or
10064 template <class U> friend class T::C;
10067 friend_type
= tsubst (friend_type
, args
,
10068 tf_warning_or_error
, NULL_TREE
);
10069 /* Bump processing_template_decl for correct
10070 dependent_type_p calculation. */
10071 ++processing_template_decl
;
10072 if (dependent_type_p (friend_type
))
10073 adjust_processing_template_decl
= true;
10074 --processing_template_decl
;
10076 else if (!CLASSTYPE_USE_TEMPLATE (friend_type
)
10077 && hidden_name_p (TYPE_NAME (friend_type
)))
10081 where C hasn't been declared yet. Let's lookup name
10082 from namespace scope directly, bypassing any name that
10083 come from dependent base class. */
10084 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (friend_type
));
10086 /* The call to xref_tag_from_type does injection for friend
10088 push_nested_namespace (ns
);
10090 xref_tag_from_type (friend_type
, NULL_TREE
,
10091 /*tag_scope=*/ts_current
);
10092 pop_nested_namespace (ns
);
10094 else if (uses_template_parms (friend_type
))
10095 /* friend class C<T>; */
10096 friend_type
= tsubst (friend_type
, args
,
10097 tf_warning_or_error
, NULL_TREE
);
10102 where C is already declared or
10104 friend class C<int>;
10106 We don't have to do anything in these cases. */
10108 if (adjust_processing_template_decl
)
10109 /* Trick make_friend_class into realizing that the friend
10110 we're adding is a template, not an ordinary class. It's
10111 important that we use make_friend_class since it will
10112 perform some error-checking and output cross-reference
10114 ++processing_template_decl
;
10116 if (friend_type
!= error_mark_node
)
10117 make_friend_class (type
, friend_type
, /*complain=*/false);
10119 if (adjust_processing_template_decl
)
10120 --processing_template_decl
;
10124 /* Build new DECL_FRIENDLIST. */
10127 /* The file and line for this declaration, to
10128 assist in error message reporting. Since we
10129 called push_tinst_level above, we don't need to
10131 input_location
= DECL_SOURCE_LOCATION (t
);
10133 if (TREE_CODE (t
) == TEMPLATE_DECL
)
10135 ++processing_template_decl
;
10136 push_deferring_access_checks (dk_no_check
);
10139 r
= tsubst_friend_function (t
, args
);
10140 add_friend (type
, r
, /*complain=*/false);
10141 if (TREE_CODE (t
) == TEMPLATE_DECL
)
10143 pop_deferring_access_checks ();
10144 --processing_template_decl
;
10152 /* Restore these before substituting into the lambda capture
10154 cp_unevaluated_operand
= saved_unevaluated_operand
;
10155 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
10158 if (tree expr
= CLASSTYPE_LAMBDA_EXPR (type
))
10160 tree decl
= lambda_function (type
);
10163 if (!DECL_TEMPLATE_INFO (decl
)
10164 || DECL_TEMPLATE_RESULT (DECL_TI_TEMPLATE (decl
)) != decl
)
10166 /* Set function_depth to avoid garbage collection. */
10168 instantiate_decl (decl
, false, false);
10172 /* We need to instantiate the capture list from the template
10173 after we've instantiated the closure members, but before we
10174 consider adding the conversion op. Also keep any captures
10175 that may have been added during instantiation of the op(). */
10176 tree tmpl_expr
= CLASSTYPE_LAMBDA_EXPR (pattern
);
10178 = tsubst_copy_and_build (LAMBDA_EXPR_CAPTURE_LIST (tmpl_expr
),
10179 args
, tf_warning_or_error
, NULL_TREE
,
10182 LAMBDA_EXPR_CAPTURE_LIST (expr
)
10183 = chainon (tmpl_cap
, nreverse (LAMBDA_EXPR_CAPTURE_LIST (expr
)));
10185 maybe_add_lambda_conv_op (type
);
10188 gcc_assert (errorcount
);
10191 /* Set the file and line number information to whatever is given for
10192 the class itself. This puts error messages involving generated
10193 implicit functions at a predictable point, and the same point
10194 that would be used for non-template classes. */
10195 input_location
= DECL_SOURCE_LOCATION (typedecl
);
10197 unreverse_member_declarations (type
);
10198 finish_struct_1 (type
);
10199 TYPE_BEING_DEFINED (type
) = 0;
10201 /* We don't instantiate default arguments for member functions. 14.7.1:
10203 The implicit instantiation of a class template specialization causes
10204 the implicit instantiation of the declarations, but not of the
10205 definitions or default arguments, of the class member functions,
10206 member classes, static data members and member templates.... */
10208 /* Some typedefs referenced from within the template code need to be access
10209 checked at template instantiation time, i.e now. These types were
10210 added to the template at parsing time. Let's get those and perform
10211 the access checks then. */
10212 perform_typedefs_access_check (pattern
, args
);
10213 perform_deferred_access_checks (tf_warning_or_error
);
10214 pop_nested_class ();
10215 maximum_field_alignment
= saved_maximum_field_alignment
;
10217 pop_from_top_level ();
10218 pop_deferring_access_checks ();
10219 pop_tinst_level ();
10221 /* The vtable for a template class can be emitted in any translation
10222 unit in which the class is instantiated. When there is no key
10223 method, however, finish_struct_1 will already have added TYPE to
10224 the keyed_classes list. */
10225 if (TYPE_CONTAINS_VPTR_P (type
) && CLASSTYPE_KEY_METHOD (type
))
10226 keyed_classes
= tree_cons (NULL_TREE
, type
, keyed_classes
);
10231 /* Wrapper for instantiate_class_template_1. */
10234 instantiate_class_template (tree type
)
10237 timevar_push (TV_TEMPLATE_INST
);
10238 ret
= instantiate_class_template_1 (type
);
10239 timevar_pop (TV_TEMPLATE_INST
);
10244 tsubst_template_arg (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
10250 else if (TYPE_P (t
))
10251 r
= tsubst (t
, args
, complain
, in_decl
);
10254 if (!(complain
& tf_warning
))
10255 ++c_inhibit_evaluation_warnings
;
10256 r
= tsubst_expr (t
, args
, complain
, in_decl
,
10257 /*integral_constant_expression_p=*/true);
10258 if (!(complain
& tf_warning
))
10259 --c_inhibit_evaluation_warnings
;
10264 /* Given a function parameter pack TMPL_PARM and some function parameters
10265 instantiated from it at *SPEC_P, return a NONTYPE_ARGUMENT_PACK of them
10266 and set *SPEC_P to point at the next point in the list. */
10269 extract_fnparm_pack (tree tmpl_parm
, tree
*spec_p
)
10271 /* Collect all of the extra "packed" parameters into an
10275 tree argpack
= make_node (NONTYPE_ARGUMENT_PACK
);
10276 tree argtypepack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
10277 tree spec_parm
= *spec_p
;
10280 for (len
= 0; spec_parm
; ++len
, spec_parm
= TREE_CHAIN (spec_parm
))
10282 && !function_parameter_expanded_from_pack_p (spec_parm
, tmpl_parm
))
10285 /* Fill in PARMVEC and PARMTYPEVEC with all of the parameters. */
10286 parmvec
= make_tree_vec (len
);
10287 parmtypevec
= make_tree_vec (len
);
10288 spec_parm
= *spec_p
;
10289 for (i
= 0; i
< len
; i
++, spec_parm
= DECL_CHAIN (spec_parm
))
10291 TREE_VEC_ELT (parmvec
, i
) = spec_parm
;
10292 TREE_VEC_ELT (parmtypevec
, i
) = TREE_TYPE (spec_parm
);
10295 /* Build the argument packs. */
10296 SET_ARGUMENT_PACK_ARGS (argpack
, parmvec
);
10297 SET_ARGUMENT_PACK_ARGS (argtypepack
, parmtypevec
);
10298 TREE_TYPE (argpack
) = argtypepack
;
10299 *spec_p
= spec_parm
;
10304 /* Give a chain SPEC_PARM of PARM_DECLs, pack them into a
10305 NONTYPE_ARGUMENT_PACK. */
10308 make_fnparm_pack (tree spec_parm
)
10310 return extract_fnparm_pack (NULL_TREE
, &spec_parm
);
10313 /* Return 1 if the Ith element of the argument pack ARG_PACK is a
10314 pack expansion with no extra args, 2 if it has extra args, or 0
10315 if it is not a pack expansion. */
10318 argument_pack_element_is_expansion_p (tree arg_pack
, int i
)
10320 tree vec
= ARGUMENT_PACK_ARGS (arg_pack
);
10321 if (i
>= TREE_VEC_LENGTH (vec
))
10323 tree elt
= TREE_VEC_ELT (vec
, i
);
10325 /* A decl pack is itself an expansion. */
10326 elt
= TREE_TYPE (elt
);
10327 if (!PACK_EXPANSION_P (elt
))
10329 if (PACK_EXPANSION_EXTRA_ARGS (elt
))
10335 /* Creates and return an ARGUMENT_PACK_SELECT tree node. */
10338 make_argument_pack_select (tree arg_pack
, unsigned index
)
10340 tree aps
= make_node (ARGUMENT_PACK_SELECT
);
10342 ARGUMENT_PACK_SELECT_FROM_PACK (aps
) = arg_pack
;
10343 ARGUMENT_PACK_SELECT_INDEX (aps
) = index
;
10348 /* This is a subroutine of tsubst_pack_expansion.
10350 It returns TRUE if we need to use the PACK_EXPANSION_EXTRA_ARGS
10351 mechanism to store the (non complete list of) arguments of the
10352 substitution and return a non substituted pack expansion, in order
10353 to wait for when we have enough arguments to really perform the
10357 use_pack_expansion_extra_args_p (tree parm_packs
,
10359 bool has_empty_arg
)
10361 /* If one pack has an expansion and another pack has a normal
10362 argument or if one pack has an empty argument and an another
10363 one hasn't then tsubst_pack_expansion cannot perform the
10364 substitution and need to fall back on the
10365 PACK_EXPANSION_EXTRA mechanism. */
10366 if (parm_packs
== NULL_TREE
)
10368 else if (has_empty_arg
)
10371 bool has_expansion_arg
= false;
10372 for (int i
= 0 ; i
< arg_pack_len
; ++i
)
10374 bool has_non_expansion_arg
= false;
10375 for (tree parm_pack
= parm_packs
;
10377 parm_pack
= TREE_CHAIN (parm_pack
))
10379 tree arg
= TREE_VALUE (parm_pack
);
10381 int exp
= argument_pack_element_is_expansion_p (arg
, i
);
10383 /* We can't substitute a pack expansion with extra args into
10387 has_expansion_arg
= true;
10389 has_non_expansion_arg
= true;
10392 if (has_expansion_arg
&& has_non_expansion_arg
)
10398 /* [temp.variadic]/6 says that:
10400 The instantiation of a pack expansion [...]
10401 produces a list E1,E2, ..., En, where N is the number of elements
10402 in the pack expansion parameters.
10404 This subroutine of tsubst_pack_expansion produces one of these Ei.
10406 PATTERN is the pattern of the pack expansion. PARM_PACKS is a
10407 TREE_LIST in which each TREE_PURPOSE is a parameter pack of
10408 PATTERN, and each TREE_VALUE is its corresponding argument pack.
10409 INDEX is the index 'i' of the element Ei to produce. ARGS,
10410 COMPLAIN, and IN_DECL are the same parameters as for the
10411 tsubst_pack_expansion function.
10413 The function returns the resulting Ei upon successful completion,
10414 or error_mark_node.
10416 Note that this function possibly modifies the ARGS parameter, so
10417 it's the responsibility of the caller to restore it. */
10420 gen_elem_of_pack_expansion_instantiation (tree pattern
,
10423 tree args
/* This parm gets
10425 tsubst_flags_t complain
,
10429 bool ith_elem_is_expansion
= false;
10431 /* For each parameter pack, change the substitution of the parameter
10432 pack to the ith argument in its argument pack, then expand the
10434 for (tree pack
= parm_packs
; pack
; pack
= TREE_CHAIN (pack
))
10436 tree parm
= TREE_PURPOSE (pack
);
10437 tree arg_pack
= TREE_VALUE (pack
);
10438 tree aps
; /* instance of ARGUMENT_PACK_SELECT. */
10440 ith_elem_is_expansion
|=
10441 argument_pack_element_is_expansion_p (arg_pack
, index
);
10443 /* Select the Ith argument from the pack. */
10444 if (TREE_CODE (parm
) == PARM_DECL
10445 || TREE_CODE (parm
) == FIELD_DECL
)
10449 aps
= make_argument_pack_select (arg_pack
, index
);
10450 if (!mark_used (parm
, complain
) && !(complain
& tf_error
))
10451 return error_mark_node
;
10452 register_local_specialization (aps
, parm
);
10455 aps
= retrieve_local_specialization (parm
);
10460 template_parm_level_and_index (parm
, &level
, &idx
);
10464 aps
= make_argument_pack_select (arg_pack
, index
);
10465 /* Update the corresponding argument. */
10466 TMPL_ARG (args
, level
, idx
) = aps
;
10469 /* Re-use the ARGUMENT_PACK_SELECT. */
10470 aps
= TMPL_ARG (args
, level
, idx
);
10472 ARGUMENT_PACK_SELECT_INDEX (aps
) = index
;
10475 /* Substitute into the PATTERN with the (possibly altered)
10477 if (pattern
== in_decl
)
10478 /* Expanding a fixed parameter pack from
10479 coerce_template_parameter_pack. */
10480 t
= tsubst_decl (pattern
, args
, complain
);
10481 else if (pattern
== error_mark_node
)
10482 t
= error_mark_node
;
10483 else if (constraint_p (pattern
))
10485 if (processing_template_decl
)
10486 t
= tsubst_constraint (pattern
, args
, complain
, in_decl
);
10488 t
= (constraints_satisfied_p (pattern
, args
)
10489 ? boolean_true_node
: boolean_false_node
);
10491 else if (!TYPE_P (pattern
))
10492 t
= tsubst_expr (pattern
, args
, complain
, in_decl
,
10493 /*integral_constant_expression_p=*/false);
10495 t
= tsubst (pattern
, args
, complain
, in_decl
);
10497 /* If the Ith argument pack element is a pack expansion, then
10498 the Ith element resulting from the substituting is going to
10499 be a pack expansion as well. */
10500 if (ith_elem_is_expansion
)
10501 t
= make_pack_expansion (t
);
10506 /* When the unexpanded parameter pack in a fold expression expands to an empty
10507 sequence, the value of the expression is as follows; the program is
10508 ill-formed if the operator is not listed in this table.
10519 expand_empty_fold (tree t
, tsubst_flags_t complain
)
10521 tree_code code
= (tree_code
)TREE_INT_CST_LOW (TREE_OPERAND (t
, 0));
10522 if (!FOLD_EXPR_MODIFY_P (t
))
10526 return integer_one_node
;
10528 return integer_zero_node
;
10530 return integer_minus_one_node
;
10532 return integer_zero_node
;
10533 case TRUTH_ANDIF_EXPR
:
10534 return boolean_true_node
;
10535 case TRUTH_ORIF_EXPR
:
10536 return boolean_false_node
;
10537 case COMPOUND_EXPR
:
10543 if (complain
& tf_error
)
10544 error_at (location_of (t
),
10545 "fold of empty expansion over %O", code
);
10546 return error_mark_node
;
10549 /* Given a fold-expression T and a current LEFT and RIGHT operand,
10550 form an expression that combines the two terms using the
10554 fold_expression (tree t
, tree left
, tree right
, tsubst_flags_t complain
)
10556 tree op
= FOLD_EXPR_OP (t
);
10557 tree_code code
= (tree_code
)TREE_INT_CST_LOW (op
);
10559 // Handle compound assignment operators.
10560 if (FOLD_EXPR_MODIFY_P (t
))
10561 return build_x_modify_expr (input_location
, left
, code
, right
, complain
);
10565 case COMPOUND_EXPR
:
10566 return build_x_compound_expr (input_location
, left
, right
, complain
);
10568 return build_m_component_ref (left
, right
, complain
);
10570 return build_x_binary_op (input_location
, code
,
10571 left
, TREE_CODE (left
),
10572 right
, TREE_CODE (right
),
10578 /* Substitute ARGS into the pack of a fold expression T. */
10581 tsubst_fold_expr_pack (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
10583 return tsubst_pack_expansion (FOLD_EXPR_PACK (t
), args
, complain
, in_decl
);
10586 /* Substitute ARGS into the pack of a fold expression T. */
10589 tsubst_fold_expr_init (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
10591 return tsubst_expr (FOLD_EXPR_INIT (t
), args
, complain
, in_decl
, false);
10594 /* Expand a PACK of arguments into a grouped as left fold.
10595 Given a pack containing elements A0, A1, ..., An and an
10596 operator @, this builds the expression:
10598 ((A0 @ A1) @ A2) ... @ An
10600 Note that PACK must not be empty.
10602 The operator is defined by the original fold expression T. */
10605 expand_left_fold (tree t
, tree pack
, tsubst_flags_t complain
)
10607 tree left
= TREE_VEC_ELT (pack
, 0);
10608 for (int i
= 1; i
< TREE_VEC_LENGTH (pack
); ++i
)
10610 tree right
= TREE_VEC_ELT (pack
, i
);
10611 left
= fold_expression (t
, left
, right
, complain
);
10616 /* Substitute into a unary left fold expression. */
10619 tsubst_unary_left_fold (tree t
, tree args
, tsubst_flags_t complain
,
10622 tree pack
= tsubst_fold_expr_pack (t
, args
, complain
, in_decl
);
10623 if (pack
== error_mark_node
)
10624 return error_mark_node
;
10625 if (TREE_VEC_LENGTH (pack
) == 0)
10626 return expand_empty_fold (t
, complain
);
10628 return expand_left_fold (t
, pack
, complain
);
10631 /* Substitute into a binary left fold expression.
10633 Do ths by building a single (non-empty) vector of argumnts and
10634 building the expression from those elements. */
10637 tsubst_binary_left_fold (tree t
, tree args
, tsubst_flags_t complain
,
10640 tree pack
= tsubst_fold_expr_pack (t
, args
, complain
, in_decl
);
10641 if (pack
== error_mark_node
)
10642 return error_mark_node
;
10643 tree init
= tsubst_fold_expr_init (t
, args
, complain
, in_decl
);
10644 if (init
== error_mark_node
)
10645 return error_mark_node
;
10647 tree vec
= make_tree_vec (TREE_VEC_LENGTH (pack
) + 1);
10648 TREE_VEC_ELT (vec
, 0) = init
;
10649 for (int i
= 0; i
< TREE_VEC_LENGTH (pack
); ++i
)
10650 TREE_VEC_ELT (vec
, i
+ 1) = TREE_VEC_ELT (pack
, i
);
10652 return expand_left_fold (t
, vec
, complain
);
10655 /* Expand a PACK of arguments into a grouped as right fold.
10656 Given a pack containing elementns A0, A1, ..., and an
10657 operator @, this builds the expression:
10659 A0@ ... (An-2 @ (An-1 @ An))
10661 Note that PACK must not be empty.
10663 The operator is defined by the original fold expression T. */
10666 expand_right_fold (tree t
, tree pack
, tsubst_flags_t complain
)
10668 // Build the expression.
10669 int n
= TREE_VEC_LENGTH (pack
);
10670 tree right
= TREE_VEC_ELT (pack
, n
- 1);
10671 for (--n
; n
!= 0; --n
)
10673 tree left
= TREE_VEC_ELT (pack
, n
- 1);
10674 right
= fold_expression (t
, left
, right
, complain
);
10679 /* Substitute into a unary right fold expression. */
10682 tsubst_unary_right_fold (tree t
, tree args
, tsubst_flags_t complain
,
10685 tree pack
= tsubst_fold_expr_pack (t
, args
, complain
, in_decl
);
10686 if (pack
== error_mark_node
)
10687 return error_mark_node
;
10688 if (TREE_VEC_LENGTH (pack
) == 0)
10689 return expand_empty_fold (t
, complain
);
10691 return expand_right_fold (t
, pack
, complain
);
10694 /* Substitute into a binary right fold expression.
10696 Do ths by building a single (non-empty) vector of arguments and
10697 building the expression from those elements. */
10700 tsubst_binary_right_fold (tree t
, tree args
, tsubst_flags_t complain
,
10703 tree pack
= tsubst_fold_expr_pack (t
, args
, complain
, in_decl
);
10704 if (pack
== error_mark_node
)
10705 return error_mark_node
;
10706 tree init
= tsubst_fold_expr_init (t
, args
, complain
, in_decl
);
10707 if (init
== error_mark_node
)
10708 return error_mark_node
;
10710 int n
= TREE_VEC_LENGTH (pack
);
10711 tree vec
= make_tree_vec (n
+ 1);
10712 for (int i
= 0; i
< n
; ++i
)
10713 TREE_VEC_ELT (vec
, i
) = TREE_VEC_ELT (pack
, i
);
10714 TREE_VEC_ELT (vec
, n
) = init
;
10716 return expand_right_fold (t
, vec
, complain
);
10720 /* Substitute ARGS into T, which is an pack expansion
10721 (i.e. TYPE_PACK_EXPANSION or EXPR_PACK_EXPANSION). Returns a
10722 TREE_VEC with the substituted arguments, a PACK_EXPANSION_* node
10723 (if only a partial substitution could be performed) or
10724 ERROR_MARK_NODE if there was an error. */
10726 tsubst_pack_expansion (tree t
, tree args
, tsubst_flags_t complain
,
10730 tree pack
, packs
= NULL_TREE
;
10731 bool unsubstituted_packs
= false;
10734 hash_map
<tree
, tree
> *saved_local_specializations
= NULL
;
10735 bool need_local_specializations
= false;
10738 gcc_assert (PACK_EXPANSION_P (t
));
10739 pattern
= PACK_EXPANSION_PATTERN (t
);
10741 /* Add in any args remembered from an earlier partial instantiation. */
10742 args
= add_to_template_args (PACK_EXPANSION_EXTRA_ARGS (t
), args
);
10744 levels
= TMPL_ARGS_DEPTH (args
);
10746 /* Determine the argument packs that will instantiate the parameter
10747 packs used in the expansion expression. While we're at it,
10748 compute the number of arguments to be expanded and make sure it
10750 for (pack
= PACK_EXPANSION_PARAMETER_PACKS (t
); pack
;
10751 pack
= TREE_CHAIN (pack
))
10753 tree parm_pack
= TREE_VALUE (pack
);
10754 tree arg_pack
= NULL_TREE
;
10755 tree orig_arg
= NULL_TREE
;
10758 if (TREE_CODE (parm_pack
) == BASES
)
10760 if (BASES_DIRECT (parm_pack
))
10761 return calculate_direct_bases (tsubst_expr (BASES_TYPE (parm_pack
),
10762 args
, complain
, in_decl
, false));
10764 return calculate_bases (tsubst_expr (BASES_TYPE (parm_pack
),
10765 args
, complain
, in_decl
, false));
10767 if (TREE_CODE (parm_pack
) == PARM_DECL
)
10769 /* We know we have correct local_specializations if this
10770 expansion is at function scope, or if we're dealing with a
10771 local parameter in a requires expression; for the latter,
10772 tsubst_requires_expr set it up appropriately. */
10773 if (PACK_EXPANSION_LOCAL_P (t
) || CONSTRAINT_VAR_P (parm_pack
))
10774 arg_pack
= retrieve_local_specialization (parm_pack
);
10777 /* We can't rely on local_specializations for a parameter
10778 name used later in a function declaration (such as in a
10779 late-specified return type). Even if it exists, it might
10780 have the wrong value for a recursive call. Just make a
10781 dummy decl, since it's only used for its type. */
10782 arg_pack
= tsubst_decl (parm_pack
, args
, complain
);
10783 if (arg_pack
&& DECL_PACK_P (arg_pack
))
10784 /* Partial instantiation of the parm_pack, we can't build
10785 up an argument pack yet. */
10786 arg_pack
= NULL_TREE
;
10788 arg_pack
= make_fnparm_pack (arg_pack
);
10789 need_local_specializations
= true;
10792 else if (TREE_CODE (parm_pack
) == FIELD_DECL
)
10793 arg_pack
= tsubst_copy (parm_pack
, args
, complain
, in_decl
);
10797 template_parm_level_and_index (parm_pack
, &level
, &idx
);
10799 if (level
<= levels
)
10800 arg_pack
= TMPL_ARG (args
, level
, idx
);
10803 orig_arg
= arg_pack
;
10804 if (arg_pack
&& TREE_CODE (arg_pack
) == ARGUMENT_PACK_SELECT
)
10805 arg_pack
= ARGUMENT_PACK_SELECT_FROM_PACK (arg_pack
);
10807 if (arg_pack
&& !ARGUMENT_PACK_P (arg_pack
))
10808 /* This can only happen if we forget to expand an argument
10809 pack somewhere else. Just return an error, silently. */
10811 result
= make_tree_vec (1);
10812 TREE_VEC_ELT (result
, 0) = error_mark_node
;
10819 TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg_pack
));
10821 /* Don't bother trying to do a partial substitution with
10822 incomplete packs; we'll try again after deduction. */
10823 if (ARGUMENT_PACK_INCOMPLETE_P (arg_pack
))
10828 else if (len
!= my_len
)
10830 if (!(complain
& tf_error
))
10831 /* Fail quietly. */;
10832 else if (TREE_CODE (t
) == TYPE_PACK_EXPANSION
)
10833 error ("mismatched argument pack lengths while expanding "
10837 error ("mismatched argument pack lengths while expanding "
10840 return error_mark_node
;
10843 /* Keep track of the parameter packs and their corresponding
10845 packs
= tree_cons (parm_pack
, arg_pack
, packs
);
10846 TREE_TYPE (packs
) = orig_arg
;
10850 /* We can't substitute for this parameter pack. We use a flag as
10851 well as the missing_level counter because function parameter
10852 packs don't have a level. */
10853 unsubstituted_packs
= true;
10857 /* If the expansion is just T..., return the matching argument pack. */
10858 if (!unsubstituted_packs
10859 && TREE_PURPOSE (packs
) == pattern
)
10861 tree args
= ARGUMENT_PACK_ARGS (TREE_VALUE (packs
));
10862 if (TREE_CODE (t
) == TYPE_PACK_EXPANSION
10863 || pack_expansion_args_count (args
))
10865 /* Otherwise use the normal path so we get convert_from_reference. */
10868 /* We cannot expand this expansion expression, because we don't have
10869 all of the argument packs we need. */
10870 if (use_pack_expansion_extra_args_p (packs
, len
, unsubstituted_packs
))
10872 /* We got some full packs, but we can't substitute them in until we
10873 have values for all the packs. So remember these until then. */
10875 t
= make_pack_expansion (pattern
);
10876 PACK_EXPANSION_EXTRA_ARGS (t
) = args
;
10879 else if (unsubstituted_packs
)
10881 /* There were no real arguments, we're just replacing a parameter
10882 pack with another version of itself. Substitute into the
10883 pattern and return a PACK_EXPANSION_*. The caller will need to
10885 if (TREE_CODE (t
) == EXPR_PACK_EXPANSION
)
10886 t
= tsubst_expr (pattern
, args
, complain
, in_decl
,
10887 /*integral_constant_expression_p=*/false);
10889 t
= tsubst (pattern
, args
, complain
, in_decl
);
10890 t
= make_pack_expansion (t
);
10894 gcc_assert (len
>= 0);
10896 if (need_local_specializations
)
10898 /* We're in a late-specified return type, so create our own local
10899 specializations map; the current map is either NULL or (in the
10900 case of recursive unification) might have bindings that we don't
10901 want to use or alter. */
10902 saved_local_specializations
= local_specializations
;
10903 local_specializations
= new hash_map
<tree
, tree
>;
10906 /* For each argument in each argument pack, substitute into the
10908 result
= make_tree_vec (len
);
10909 for (i
= 0; i
< len
; ++i
)
10911 t
= gen_elem_of_pack_expansion_instantiation (pattern
, packs
,
10915 TREE_VEC_ELT (result
, i
) = t
;
10916 if (t
== error_mark_node
)
10918 result
= error_mark_node
;
10923 /* Update ARGS to restore the substitution from parameter packs to
10924 their argument packs. */
10925 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
10927 tree parm
= TREE_PURPOSE (pack
);
10929 if (TREE_CODE (parm
) == PARM_DECL
10930 || TREE_CODE (parm
) == FIELD_DECL
)
10931 register_local_specialization (TREE_TYPE (pack
), parm
);
10936 if (TREE_VALUE (pack
) == NULL_TREE
)
10939 template_parm_level_and_index (parm
, &level
, &idx
);
10941 /* Update the corresponding argument. */
10942 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
10943 TREE_VEC_ELT (TREE_VEC_ELT (args
, level
-1 ), idx
) =
10946 TREE_VEC_ELT (args
, idx
) = TREE_TYPE (pack
);
10950 if (need_local_specializations
)
10952 delete local_specializations
;
10953 local_specializations
= saved_local_specializations
;
10959 /* Given PARM_DECL PARM, find the corresponding PARM_DECL in the template
10960 TMPL. We do this using DECL_PARM_INDEX, which should work even with
10961 parameter packs; all parms generated from a function parameter pack will
10962 have the same DECL_PARM_INDEX. */
10965 get_pattern_parm (tree parm
, tree tmpl
)
10967 tree pattern
= DECL_TEMPLATE_RESULT (tmpl
);
10970 if (DECL_ARTIFICIAL (parm
))
10972 for (patparm
= DECL_ARGUMENTS (pattern
);
10973 patparm
; patparm
= DECL_CHAIN (patparm
))
10974 if (DECL_ARTIFICIAL (patparm
)
10975 && DECL_NAME (parm
) == DECL_NAME (patparm
))
10980 patparm
= FUNCTION_FIRST_USER_PARM (DECL_TEMPLATE_RESULT (tmpl
));
10981 patparm
= chain_index (DECL_PARM_INDEX (parm
)-1, patparm
);
10982 gcc_assert (DECL_PARM_INDEX (patparm
)
10983 == DECL_PARM_INDEX (parm
));
10989 /* Substitute ARGS into the vector or list of template arguments T. */
10992 tsubst_template_args (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
10995 int len
, need_new
= 0, i
, expanded_len_adjust
= 0, out
;
10998 if (t
== error_mark_node
)
10999 return error_mark_node
;
11001 len
= TREE_VEC_LENGTH (t
);
11002 elts
= XALLOCAVEC (tree
, len
);
11004 for (i
= 0; i
< len
; i
++)
11006 tree orig_arg
= TREE_VEC_ELT (t
, i
);
11009 if (TREE_CODE (orig_arg
) == TREE_VEC
)
11010 new_arg
= tsubst_template_args (orig_arg
, args
, complain
, in_decl
);
11011 else if (PACK_EXPANSION_P (orig_arg
))
11013 /* Substitute into an expansion expression. */
11014 new_arg
= tsubst_pack_expansion (orig_arg
, args
, complain
, in_decl
);
11016 if (TREE_CODE (new_arg
) == TREE_VEC
)
11017 /* Add to the expanded length adjustment the number of
11018 expanded arguments. We subtract one from this
11019 measurement, because the argument pack expression
11020 itself is already counted as 1 in
11021 LEN. EXPANDED_LEN_ADJUST can actually be negative, if
11022 the argument pack is empty. */
11023 expanded_len_adjust
+= TREE_VEC_LENGTH (new_arg
) - 1;
11025 else if (ARGUMENT_PACK_P (orig_arg
))
11027 /* Substitute into each of the arguments. */
11028 new_arg
= TYPE_P (orig_arg
)
11029 ? cxx_make_type (TREE_CODE (orig_arg
))
11030 : make_node (TREE_CODE (orig_arg
));
11032 SET_ARGUMENT_PACK_ARGS (
11034 tsubst_template_args (ARGUMENT_PACK_ARGS (orig_arg
),
11035 args
, complain
, in_decl
));
11037 if (ARGUMENT_PACK_ARGS (new_arg
) == error_mark_node
)
11038 new_arg
= error_mark_node
;
11040 if (TREE_CODE (new_arg
) == NONTYPE_ARGUMENT_PACK
) {
11041 TREE_TYPE (new_arg
) = tsubst (TREE_TYPE (orig_arg
), args
,
11042 complain
, in_decl
);
11043 TREE_CONSTANT (new_arg
) = TREE_CONSTANT (orig_arg
);
11045 if (TREE_TYPE (new_arg
) == error_mark_node
)
11046 new_arg
= error_mark_node
;
11050 new_arg
= tsubst_template_arg (orig_arg
, args
, complain
, in_decl
);
11052 if (new_arg
== error_mark_node
)
11053 return error_mark_node
;
11056 if (new_arg
!= orig_arg
)
11063 /* Make space for the expanded arguments coming from template
11065 t
= make_tree_vec (len
+ expanded_len_adjust
);
11066 /* ORIG_T can contain TREE_VECs. That happens if ORIG_T contains the
11067 arguments for a member template.
11068 In that case each TREE_VEC in ORIG_T represents a level of template
11069 arguments, and ORIG_T won't carry any non defaulted argument count.
11070 It will rather be the nested TREE_VECs that will carry one.
11071 In other words, ORIG_T carries a non defaulted argument count only
11072 if it doesn't contain any nested TREE_VEC. */
11073 if (NON_DEFAULT_TEMPLATE_ARGS_COUNT (orig_t
))
11075 int count
= GET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (orig_t
);
11076 count
+= expanded_len_adjust
;
11077 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (t
, count
);
11079 for (i
= 0, out
= 0; i
< len
; i
++)
11081 if ((PACK_EXPANSION_P (TREE_VEC_ELT (orig_t
, i
))
11082 || ARGUMENT_PACK_P (TREE_VEC_ELT (orig_t
, i
)))
11083 && TREE_CODE (elts
[i
]) == TREE_VEC
)
11087 /* Now expand the template argument pack "in place". */
11088 for (idx
= 0; idx
< TREE_VEC_LENGTH (elts
[i
]); idx
++, out
++)
11089 TREE_VEC_ELT (t
, out
) = TREE_VEC_ELT (elts
[i
], idx
);
11093 TREE_VEC_ELT (t
, out
) = elts
[i
];
11101 /* Return the result of substituting ARGS into the template parameters
11102 given by PARMS. If there are m levels of ARGS and m + n levels of
11103 PARMS, then the result will contain n levels of PARMS. For
11104 example, if PARMS is `template <class T> template <class U>
11105 template <T*, U, class V>' and ARGS is {{int}, {double}} then the
11106 result will be `template <int*, double, class V>'. */
11109 tsubst_template_parms (tree parms
, tree args
, tsubst_flags_t complain
)
11111 tree r
= NULL_TREE
;
11114 /* When substituting into a template, we must set
11115 PROCESSING_TEMPLATE_DECL as the template parameters may be
11116 dependent if they are based on one-another, and the dependency
11117 predicates are short-circuit outside of templates. */
11118 ++processing_template_decl
;
11120 for (new_parms
= &r
;
11121 parms
&& TMPL_PARMS_DEPTH (parms
) > TMPL_ARGS_DEPTH (args
);
11122 new_parms
= &(TREE_CHAIN (*new_parms
)),
11123 parms
= TREE_CHAIN (parms
))
11126 make_tree_vec (TREE_VEC_LENGTH (TREE_VALUE (parms
)));
11129 for (i
= 0; i
< TREE_VEC_LENGTH (new_vec
); ++i
)
11133 if (parms
== error_mark_node
)
11136 tuple
= TREE_VEC_ELT (TREE_VALUE (parms
), i
);
11138 if (tuple
== error_mark_node
)
11141 TREE_VEC_ELT (new_vec
, i
) =
11142 tsubst_template_parm (tuple
, args
, complain
);
11146 tree_cons (size_int (TMPL_PARMS_DEPTH (parms
)
11147 - TMPL_ARGS_DEPTH (args
)),
11148 new_vec
, NULL_TREE
);
11151 --processing_template_decl
;
11156 /* Return the result of substituting ARGS into one template parameter
11157 given by T. T Must be a TREE_LIST which TREE_VALUE is the template
11158 parameter and which TREE_PURPOSE is the default argument of the
11159 template parameter. */
11162 tsubst_template_parm (tree t
, tree args
, tsubst_flags_t complain
)
11164 tree default_value
, parm_decl
;
11166 if (args
== NULL_TREE
11168 || t
== error_mark_node
)
11171 gcc_assert (TREE_CODE (t
) == TREE_LIST
);
11173 default_value
= TREE_PURPOSE (t
);
11174 parm_decl
= TREE_VALUE (t
);
11176 parm_decl
= tsubst (parm_decl
, args
, complain
, NULL_TREE
);
11177 if (TREE_CODE (parm_decl
) == PARM_DECL
11178 && invalid_nontype_parm_type_p (TREE_TYPE (parm_decl
), complain
))
11179 parm_decl
= error_mark_node
;
11180 default_value
= tsubst_template_arg (default_value
, args
,
11181 complain
, NULL_TREE
);
11183 return build_tree_list (default_value
, parm_decl
);
11186 /* Substitute the ARGS into the indicated aggregate (or enumeration)
11187 type T. If T is not an aggregate or enumeration type, it is
11188 handled as if by tsubst. IN_DECL is as for tsubst. If
11189 ENTERING_SCOPE is nonzero, T is the context for a template which
11190 we are presently tsubst'ing. Return the substituted value. */
11193 tsubst_aggr_type (tree t
,
11195 tsubst_flags_t complain
,
11197 int entering_scope
)
11199 if (t
== NULL_TREE
)
11202 switch (TREE_CODE (t
))
11205 if (TYPE_PTRMEMFUNC_P (t
))
11206 return tsubst (TYPE_PTRMEMFUNC_FN_TYPE (t
), args
, complain
, in_decl
);
11208 /* Else fall through. */
11209 case ENUMERAL_TYPE
:
11211 if (TYPE_TEMPLATE_INFO (t
) && uses_template_parms (t
))
11216 int saved_unevaluated_operand
;
11217 int saved_inhibit_evaluation_warnings
;
11219 /* In "sizeof(X<I>)" we need to evaluate "I". */
11220 saved_unevaluated_operand
= cp_unevaluated_operand
;
11221 cp_unevaluated_operand
= 0;
11222 saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
11223 c_inhibit_evaluation_warnings
= 0;
11225 /* First, determine the context for the type we are looking
11227 context
= TYPE_CONTEXT (t
);
11228 if (context
&& TYPE_P (context
))
11230 context
= tsubst_aggr_type (context
, args
, complain
,
11231 in_decl
, /*entering_scope=*/1);
11232 /* If context is a nested class inside a class template,
11233 it may still need to be instantiated (c++/33959). */
11234 context
= complete_type (context
);
11237 /* Then, figure out what arguments are appropriate for the
11238 type we are trying to find. For example, given:
11240 template <class T> struct S;
11241 template <class T, class U> void f(T, U) { S<U> su; }
11243 and supposing that we are instantiating f<int, double>,
11244 then our ARGS will be {int, double}, but, when looking up
11245 S we only want {double}. */
11246 argvec
= tsubst_template_args (TYPE_TI_ARGS (t
), args
,
11247 complain
, in_decl
);
11248 if (argvec
== error_mark_node
)
11249 r
= error_mark_node
;
11252 r
= lookup_template_class (t
, argvec
, in_decl
, context
,
11253 entering_scope
, complain
);
11254 r
= cp_build_qualified_type_real (r
, cp_type_quals (t
), complain
);
11257 cp_unevaluated_operand
= saved_unevaluated_operand
;
11258 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
11263 /* This is not a template type, so there's nothing to do. */
11267 return tsubst (t
, args
, complain
, in_decl
);
11271 /* Substitute into the default argument ARG (a default argument for
11272 FN), which has the indicated TYPE. */
11275 tsubst_default_argument (tree fn
, tree type
, tree arg
, tsubst_flags_t complain
)
11277 tree saved_class_ptr
= NULL_TREE
;
11278 tree saved_class_ref
= NULL_TREE
;
11279 int errs
= errorcount
+ sorrycount
;
11281 /* This can happen in invalid code. */
11282 if (TREE_CODE (arg
) == DEFAULT_ARG
)
11285 /* This default argument came from a template. Instantiate the
11286 default argument here, not in tsubst. In the case of
11295 we must be careful to do name lookup in the scope of S<T>,
11296 rather than in the current class. */
11297 push_access_scope (fn
);
11298 /* The "this" pointer is not valid in a default argument. */
11301 saved_class_ptr
= current_class_ptr
;
11302 cp_function_chain
->x_current_class_ptr
= NULL_TREE
;
11303 saved_class_ref
= current_class_ref
;
11304 cp_function_chain
->x_current_class_ref
= NULL_TREE
;
11307 push_deferring_access_checks(dk_no_deferred
);
11308 /* The default argument expression may cause implicitly defined
11309 member functions to be synthesized, which will result in garbage
11310 collection. We must treat this situation as if we were within
11311 the body of function so as to avoid collecting live data on the
11314 arg
= tsubst_expr (arg
, DECL_TI_ARGS (fn
),
11315 complain
, NULL_TREE
,
11316 /*integral_constant_expression_p=*/false);
11318 pop_deferring_access_checks();
11320 /* Restore the "this" pointer. */
11323 cp_function_chain
->x_current_class_ptr
= saved_class_ptr
;
11324 cp_function_chain
->x_current_class_ref
= saved_class_ref
;
11327 if (errorcount
+sorrycount
> errs
11328 && (complain
& tf_warning_or_error
))
11329 inform (input_location
,
11330 " when instantiating default argument for call to %D", fn
);
11332 /* Make sure the default argument is reasonable. */
11333 arg
= check_default_argument (type
, arg
, complain
);
11335 pop_access_scope (fn
);
11340 /* Substitute into all the default arguments for FN. */
11343 tsubst_default_arguments (tree fn
, tsubst_flags_t complain
)
11348 tmpl_args
= DECL_TI_ARGS (fn
);
11350 /* If this function is not yet instantiated, we certainly don't need
11351 its default arguments. */
11352 if (uses_template_parms (tmpl_args
))
11354 /* Don't do this again for clones. */
11355 if (DECL_CLONED_FUNCTION_P (fn
))
11358 for (arg
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
11360 arg
= TREE_CHAIN (arg
))
11361 if (TREE_PURPOSE (arg
))
11362 TREE_PURPOSE (arg
) = tsubst_default_argument (fn
,
11364 TREE_PURPOSE (arg
),
11368 /* Substitute the ARGS into the T, which is a _DECL. Return the
11369 result of the substitution. Issue error and warning messages under
11370 control of COMPLAIN. */
11373 tsubst_decl (tree t
, tree args
, tsubst_flags_t complain
)
11375 #define RETURN(EXP) do { r = (EXP); goto out; } while(0)
11376 location_t saved_loc
;
11377 tree r
= NULL_TREE
;
11379 hashval_t hash
= 0;
11381 /* Set the filename and linenumber to improve error-reporting. */
11382 saved_loc
= input_location
;
11383 input_location
= DECL_SOURCE_LOCATION (t
);
11385 switch (TREE_CODE (t
))
11387 case TEMPLATE_DECL
:
11389 /* We can get here when processing a member function template,
11390 member class template, or template template parameter. */
11391 tree decl
= DECL_TEMPLATE_RESULT (t
);
11396 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
11398 /* Template template parameter is treated here. */
11399 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11400 if (new_type
== error_mark_node
)
11401 r
= error_mark_node
;
11402 /* If we get a real template back, return it. This can happen in
11403 the context of most_specialized_partial_spec. */
11404 else if (TREE_CODE (new_type
) == TEMPLATE_DECL
)
11407 /* The new TEMPLATE_DECL was built in
11408 reduce_template_parm_level. */
11409 r
= TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (new_type
);
11413 /* We might already have an instance of this template.
11414 The ARGS are for the surrounding class type, so the
11415 full args contain the tsubst'd args for the context,
11416 plus the innermost args from the template decl. */
11417 tmpl_args
= DECL_CLASS_TEMPLATE_P (t
)
11418 ? CLASSTYPE_TI_ARGS (TREE_TYPE (t
))
11419 : DECL_TI_ARGS (DECL_TEMPLATE_RESULT (t
));
11420 /* Because this is a template, the arguments will still be
11421 dependent, even after substitution. If
11422 PROCESSING_TEMPLATE_DECL is not set, the dependency
11423 predicates will short-circuit. */
11424 ++processing_template_decl
;
11425 full_args
= tsubst_template_args (tmpl_args
, args
,
11426 complain
, in_decl
);
11427 --processing_template_decl
;
11428 if (full_args
== error_mark_node
)
11429 RETURN (error_mark_node
);
11431 /* If this is a default template template argument,
11432 tsubst might not have changed anything. */
11433 if (full_args
== tmpl_args
)
11436 hash
= hash_tmpl_and_args (t
, full_args
);
11437 spec
= retrieve_specialization (t
, full_args
, hash
);
11438 if (spec
!= NULL_TREE
)
11444 /* Make a new template decl. It will be similar to the
11445 original, but will record the current template arguments.
11446 We also create a new function declaration, which is just
11447 like the old one, but points to this new template, rather
11448 than the old one. */
11450 gcc_assert (DECL_LANG_SPECIFIC (r
) != 0);
11451 DECL_CHAIN (r
) = NULL_TREE
;
11453 // Build new template info linking to the original template decl.
11454 DECL_TEMPLATE_INFO (r
) = build_template_info (t
, args
);
11456 if (TREE_CODE (decl
) == TYPE_DECL
11457 && !TYPE_DECL_ALIAS_P (decl
))
11460 ++processing_template_decl
;
11461 new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11462 --processing_template_decl
;
11463 if (new_type
== error_mark_node
)
11464 RETURN (error_mark_node
);
11466 TREE_TYPE (r
) = new_type
;
11467 /* For a partial specialization, we need to keep pointing to
11468 the primary template. */
11469 if (!DECL_TEMPLATE_SPECIALIZATION (t
))
11470 CLASSTYPE_TI_TEMPLATE (new_type
) = r
;
11471 DECL_TEMPLATE_RESULT (r
) = TYPE_MAIN_DECL (new_type
);
11472 DECL_TI_ARGS (r
) = CLASSTYPE_TI_ARGS (new_type
);
11473 DECL_CONTEXT (r
) = TYPE_CONTEXT (new_type
);
11478 ++processing_template_decl
;
11479 new_decl
= tsubst (decl
, args
, complain
, in_decl
);
11480 --processing_template_decl
;
11481 if (new_decl
== error_mark_node
)
11482 RETURN (error_mark_node
);
11484 DECL_TEMPLATE_RESULT (r
) = new_decl
;
11485 DECL_TI_TEMPLATE (new_decl
) = r
;
11486 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
11487 DECL_TI_ARGS (r
) = DECL_TI_ARGS (new_decl
);
11488 DECL_CONTEXT (r
) = DECL_CONTEXT (new_decl
);
11491 SET_DECL_IMPLICIT_INSTANTIATION (r
);
11492 DECL_TEMPLATE_INSTANTIATIONS (r
) = NULL_TREE
;
11493 DECL_TEMPLATE_SPECIALIZATIONS (r
) = NULL_TREE
;
11495 /* The template parameters for this new template are all the
11496 template parameters for the old template, except the
11497 outermost level of parameters. */
11498 DECL_TEMPLATE_PARMS (r
)
11499 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
,
11502 if (PRIMARY_TEMPLATE_P (t
))
11503 DECL_PRIMARY_TEMPLATE (r
) = r
;
11505 if (TREE_CODE (decl
) != TYPE_DECL
&& !VAR_P (decl
))
11506 /* Record this non-type partial instantiation. */
11507 register_specialization (r
, t
,
11508 DECL_TI_ARGS (DECL_TEMPLATE_RESULT (r
)),
11513 case FUNCTION_DECL
:
11516 tree argvec
= NULL_TREE
;
11524 /* Nobody should be tsubst'ing into non-template functions. */
11525 gcc_assert (DECL_TEMPLATE_INFO (t
) != NULL_TREE
);
11527 if (TREE_CODE (DECL_TI_TEMPLATE (t
)) == TEMPLATE_DECL
)
11532 /* If T is not dependent, just return it. We have to
11533 increment PROCESSING_TEMPLATE_DECL because
11534 value_dependent_expression_p assumes that nothing is
11535 dependent when PROCESSING_TEMPLATE_DECL is zero. */
11536 ++processing_template_decl
;
11537 dependent_p
= value_dependent_expression_p (t
);
11538 --processing_template_decl
;
11542 /* Calculate the most general template of which R is a
11543 specialization, and the complete set of arguments used to
11545 gen_tmpl
= most_general_template (DECL_TI_TEMPLATE (t
));
11546 argvec
= tsubst_template_args (DECL_TI_ARGS
11547 (DECL_TEMPLATE_RESULT
11548 (DECL_TI_TEMPLATE (t
))),
11549 args
, complain
, in_decl
);
11550 if (argvec
== error_mark_node
)
11551 RETURN (error_mark_node
);
11553 /* Check to see if we already have this specialization. */
11554 hash
= hash_tmpl_and_args (gen_tmpl
, argvec
);
11555 spec
= retrieve_specialization (gen_tmpl
, argvec
, hash
);
11563 /* We can see more levels of arguments than parameters if
11564 there was a specialization of a member template, like
11567 template <class T> struct S { template <class U> void f(); }
11568 template <> template <class U> void S<int>::f(U);
11570 Here, we'll be substituting into the specialization,
11571 because that's where we can find the code we actually
11572 want to generate, but we'll have enough arguments for
11573 the most general template.
11575 We also deal with the peculiar case:
11577 template <class T> struct S {
11578 template <class U> friend void f();
11580 template <class U> void f() {}
11582 template void f<double>();
11584 Here, the ARGS for the instantiation of will be {int,
11585 double}. But, we only need as many ARGS as there are
11586 levels of template parameters in CODE_PATTERN. We are
11587 careful not to get fooled into reducing the ARGS in
11590 template <class T> struct S { template <class U> void f(U); }
11591 template <class T> template <> void S<T>::f(int) {}
11593 which we can spot because the pattern will be a
11594 specialization in this case. */
11595 args_depth
= TMPL_ARGS_DEPTH (args
);
11597 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (t
)));
11598 if (args_depth
> parms_depth
11599 && !DECL_TEMPLATE_SPECIALIZATION (t
))
11600 args
= get_innermost_template_args (args
, parms_depth
);
11604 /* This special case arises when we have something like this:
11606 template <class T> struct S {
11607 friend void f<int>(int, double);
11610 Here, the DECL_TI_TEMPLATE for the friend declaration
11611 will be an IDENTIFIER_NODE. We are being called from
11612 tsubst_friend_function, and we want only to create a
11613 new decl (R) with appropriate types so that we can call
11614 determine_specialization. */
11615 gen_tmpl
= NULL_TREE
;
11618 if (DECL_CLASS_SCOPE_P (t
))
11620 if (DECL_NAME (t
) == constructor_name (DECL_CONTEXT (t
)))
11624 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
,
11625 complain
, t
, /*entering_scope=*/1);
11630 ctx
= DECL_CONTEXT (t
);
11632 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11633 if (type
== error_mark_node
)
11634 RETURN (error_mark_node
);
11636 /* If we hit excessive deduction depth, the type is bogus even if
11637 it isn't error_mark_node, so don't build a decl. */
11638 if (excessive_deduction_depth
)
11639 RETURN (error_mark_node
);
11641 /* We do NOT check for matching decls pushed separately at this
11642 point, as they may not represent instantiations of this
11643 template, and in any case are considered separate under the
11646 DECL_USE_TEMPLATE (r
) = 0;
11647 TREE_TYPE (r
) = type
;
11648 /* Clear out the mangled name and RTL for the instantiation. */
11649 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
11650 SET_DECL_RTL (r
, NULL
);
11651 /* Leave DECL_INITIAL set on deleted instantiations. */
11652 if (!DECL_DELETED_FN (r
))
11653 DECL_INITIAL (r
) = NULL_TREE
;
11654 DECL_CONTEXT (r
) = ctx
;
11656 /* OpenMP UDRs have the only argument a reference to the declared
11657 type. We want to diagnose if the declared type is a reference,
11658 which is invalid, but as references to references are usually
11659 quietly merged, diagnose it here. */
11660 if (DECL_OMP_DECLARE_REDUCTION_P (t
))
11663 = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (t
))));
11664 argtype
= tsubst (argtype
, args
, complain
, in_decl
);
11665 if (TREE_CODE (argtype
) == REFERENCE_TYPE
)
11666 error_at (DECL_SOURCE_LOCATION (t
),
11667 "reference type %qT in "
11668 "%<#pragma omp declare reduction%>", argtype
);
11669 if (strchr (IDENTIFIER_POINTER (DECL_NAME (t
)), '~') == NULL
)
11670 DECL_NAME (r
) = omp_reduction_id (ERROR_MARK
, DECL_NAME (t
),
11674 if (member
&& DECL_CONV_FN_P (r
))
11675 /* Type-conversion operator. Reconstruct the name, in
11676 case it's the name of one of the template's parameters. */
11677 DECL_NAME (r
) = mangle_conv_op_name_for_type (TREE_TYPE (type
));
11679 DECL_ARGUMENTS (r
) = tsubst (DECL_ARGUMENTS (t
), args
,
11681 DECL_RESULT (r
) = NULL_TREE
;
11683 TREE_STATIC (r
) = 0;
11684 TREE_PUBLIC (r
) = TREE_PUBLIC (t
);
11685 DECL_EXTERNAL (r
) = 1;
11686 /* If this is an instantiation of a function with internal
11687 linkage, we already know what object file linkage will be
11688 assigned to the instantiation. */
11689 DECL_INTERFACE_KNOWN (r
) = !TREE_PUBLIC (r
);
11690 DECL_DEFER_OUTPUT (r
) = 0;
11691 DECL_CHAIN (r
) = NULL_TREE
;
11692 DECL_PENDING_INLINE_INFO (r
) = 0;
11693 DECL_PENDING_INLINE_P (r
) = 0;
11694 DECL_SAVED_TREE (r
) = NULL_TREE
;
11695 DECL_STRUCT_FUNCTION (r
) = NULL
;
11697 /* We'll re-clone as appropriate in instantiate_template. */
11698 DECL_CLONED_FUNCTION (r
) = NULL_TREE
;
11700 /* If we aren't complaining now, return on error before we register
11701 the specialization so that we'll complain eventually. */
11702 if ((complain
& tf_error
) == 0
11703 && IDENTIFIER_OPNAME_P (DECL_NAME (r
))
11704 && !grok_op_properties (r
, /*complain=*/false))
11705 RETURN (error_mark_node
);
11707 /* When instantiating a constrained member, substitute
11708 into the constraints to create a new constraint. */
11709 if (tree ci
= get_constraints (t
))
11712 ci
= tsubst_constraint_info (ci
, argvec
, complain
, NULL_TREE
);
11713 set_constraints (r
, ci
);
11716 /* Set up the DECL_TEMPLATE_INFO for R. There's no need to do
11717 this in the special friend case mentioned above where
11718 GEN_TMPL is NULL. */
11721 DECL_TEMPLATE_INFO (r
)
11722 = build_template_info (gen_tmpl
, argvec
);
11723 SET_DECL_IMPLICIT_INSTANTIATION (r
);
11726 = register_specialization (r
, gen_tmpl
, argvec
, false, hash
);
11728 /* We instantiated this while substituting into
11729 the type earlier (template/friend54.C). */
11732 /* We're not supposed to instantiate default arguments
11733 until they are called, for a template. But, for a
11736 template <class T> void f ()
11737 { extern void g(int i = T()); }
11739 we should do the substitution when the template is
11740 instantiated. We handle the member function case in
11741 instantiate_class_template since the default arguments
11742 might refer to other members of the class. */
11744 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
11745 && !uses_template_parms (argvec
))
11746 tsubst_default_arguments (r
, complain
);
11749 DECL_TEMPLATE_INFO (r
) = NULL_TREE
;
11751 /* Copy the list of befriending classes. */
11752 for (friends
= &DECL_BEFRIENDING_CLASSES (r
);
11754 friends
= &TREE_CHAIN (*friends
))
11756 *friends
= copy_node (*friends
);
11757 TREE_VALUE (*friends
) = tsubst (TREE_VALUE (*friends
),
11762 if (DECL_CONSTRUCTOR_P (r
) || DECL_DESTRUCTOR_P (r
))
11764 maybe_retrofit_in_chrg (r
);
11765 if (DECL_CONSTRUCTOR_P (r
))
11766 grok_ctor_properties (ctx
, r
);
11767 if (DECL_INHERITED_CTOR_BASE (r
))
11768 deduce_inheriting_ctor (r
);
11769 /* If this is an instantiation of a member template, clone it.
11770 If it isn't, that'll be handled by
11771 clone_constructors_and_destructors. */
11772 if (PRIMARY_TEMPLATE_P (gen_tmpl
))
11773 clone_function_decl (r
, /*update_method_vec_p=*/0);
11775 else if ((complain
& tf_error
) != 0
11776 && IDENTIFIER_OPNAME_P (DECL_NAME (r
))
11777 && !grok_op_properties (r
, /*complain=*/true))
11778 RETURN (error_mark_node
);
11780 if (DECL_FRIEND_P (t
) && DECL_FRIEND_CONTEXT (t
))
11781 SET_DECL_FRIEND_CONTEXT (r
,
11782 tsubst (DECL_FRIEND_CONTEXT (t
),
11783 args
, complain
, in_decl
));
11785 /* Possibly limit visibility based on template args. */
11786 DECL_VISIBILITY (r
) = VISIBILITY_DEFAULT
;
11787 if (DECL_VISIBILITY_SPECIFIED (t
))
11789 DECL_VISIBILITY_SPECIFIED (r
) = 0;
11790 DECL_ATTRIBUTES (r
)
11791 = remove_attribute ("visibility", DECL_ATTRIBUTES (r
));
11793 determine_visibility (r
);
11794 if (DECL_DEFAULTED_OUTSIDE_CLASS_P (r
)
11795 && !processing_template_decl
)
11796 defaulted_late_check (r
);
11798 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
11799 args
, complain
, in_decl
);
11805 tree type
= NULL_TREE
;
11807 tree expanded_types
= NULL_TREE
;
11808 tree prev_r
= NULL_TREE
;
11809 tree first_r
= NULL_TREE
;
11811 if (DECL_PACK_P (t
))
11813 /* If there is a local specialization that isn't a
11814 parameter pack, it means that we're doing a "simple"
11815 substitution from inside tsubst_pack_expansion. Just
11816 return the local specialization (which will be a single
11818 tree spec
= retrieve_local_specialization (t
);
11820 && TREE_CODE (spec
) == PARM_DECL
11821 && TREE_CODE (TREE_TYPE (spec
)) != TYPE_PACK_EXPANSION
)
11824 /* Expand the TYPE_PACK_EXPANSION that provides the types for
11825 the parameters in this function parameter pack. */
11826 expanded_types
= tsubst_pack_expansion (TREE_TYPE (t
), args
,
11827 complain
, in_decl
);
11828 if (TREE_CODE (expanded_types
) == TREE_VEC
)
11830 len
= TREE_VEC_LENGTH (expanded_types
);
11832 /* Zero-length parameter packs are boring. Just substitute
11835 RETURN (tsubst (TREE_CHAIN (t
), args
, complain
,
11840 /* All we did was update the type. Make a note of that. */
11841 type
= expanded_types
;
11842 expanded_types
= NULL_TREE
;
11846 /* Loop through all of the parameters we'll build. When T is
11847 a function parameter pack, LEN is the number of expanded
11848 types in EXPANDED_TYPES; otherwise, LEN is 1. */
11850 for (i
= 0; i
< len
; ++i
)
11854 if (DECL_TEMPLATE_PARM_P (t
))
11855 SET_DECL_TEMPLATE_PARM_P (r
);
11857 if (expanded_types
)
11858 /* We're on the Ith parameter of the function parameter
11861 /* Get the Ith type. */
11862 type
= TREE_VEC_ELT (expanded_types
, i
);
11864 /* Rename the parameter to include the index. */
11866 = make_ith_pack_parameter_name (DECL_NAME (r
), i
);
11869 /* We're dealing with a normal parameter. */
11870 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11872 type
= type_decays_to (type
);
11873 TREE_TYPE (r
) = type
;
11874 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
11876 if (DECL_INITIAL (r
))
11878 if (TREE_CODE (DECL_INITIAL (r
)) != TEMPLATE_PARM_INDEX
)
11879 DECL_INITIAL (r
) = TREE_TYPE (r
);
11881 DECL_INITIAL (r
) = tsubst (DECL_INITIAL (r
), args
,
11882 complain
, in_decl
);
11885 DECL_CONTEXT (r
) = NULL_TREE
;
11887 if (!DECL_TEMPLATE_PARM_P (r
))
11888 DECL_ARG_TYPE (r
) = type_passed_as (type
);
11890 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
11891 args
, complain
, in_decl
);
11893 /* Keep track of the first new parameter we
11894 generate. That's what will be returned to the
11899 /* Build a proper chain of parameters when substituting
11900 into a function parameter pack. */
11902 DECL_CHAIN (prev_r
) = r
;
11905 /* If cp_unevaluated_operand is set, we're just looking for a
11906 single dummy parameter, so don't keep going. */
11907 if (DECL_CHAIN (t
) && !cp_unevaluated_operand
)
11908 DECL_CHAIN (r
) = tsubst (DECL_CHAIN (t
), args
,
11909 complain
, DECL_CHAIN (t
));
11911 /* FIRST_R contains the start of the chain we've built. */
11918 tree type
= NULL_TREE
;
11919 tree vec
= NULL_TREE
;
11920 tree expanded_types
= NULL_TREE
;
11923 if (PACK_EXPANSION_P (TREE_TYPE (t
)))
11925 /* This field is a lambda capture pack. Return a TREE_VEC of
11926 the expanded fields to instantiate_class_template_1 and
11927 store them in the specializations hash table as a
11928 NONTYPE_ARGUMENT_PACK so that tsubst_copy can find them. */
11929 expanded_types
= tsubst_pack_expansion (TREE_TYPE (t
), args
,
11930 complain
, in_decl
);
11931 if (TREE_CODE (expanded_types
) == TREE_VEC
)
11933 len
= TREE_VEC_LENGTH (expanded_types
);
11934 vec
= make_tree_vec (len
);
11938 /* All we did was update the type. Make a note of that. */
11939 type
= expanded_types
;
11940 expanded_types
= NULL_TREE
;
11944 for (int i
= 0; i
< len
; ++i
)
11947 if (expanded_types
)
11949 type
= TREE_VEC_ELT (expanded_types
, i
);
11951 = make_ith_pack_parameter_name (DECL_NAME (r
), i
);
11954 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11956 if (type
== error_mark_node
)
11957 RETURN (error_mark_node
);
11958 TREE_TYPE (r
) = type
;
11959 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
11961 if (DECL_C_BIT_FIELD (r
))
11962 /* For bit-fields, DECL_INITIAL gives the number of bits. For
11963 non-bit-fields DECL_INITIAL is a non-static data member
11964 initializer, which gets deferred instantiation. */
11966 = tsubst_expr (DECL_INITIAL (t
), args
,
11968 /*integral_constant_expression_p=*/true);
11969 else if (DECL_INITIAL (t
))
11971 /* Set up DECL_TEMPLATE_INFO so that we can get at the
11972 NSDMI in perform_member_init. Still set DECL_INITIAL
11973 so that we know there is one. */
11974 DECL_INITIAL (r
) = void_node
;
11975 gcc_assert (DECL_LANG_SPECIFIC (r
) == NULL
);
11976 retrofit_lang_decl (r
);
11977 DECL_TEMPLATE_INFO (r
) = build_template_info (t
, args
);
11979 /* We don't have to set DECL_CONTEXT here; it is set by
11980 finish_member_declaration. */
11981 DECL_CHAIN (r
) = NULL_TREE
;
11983 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
11984 args
, complain
, in_decl
);
11987 TREE_VEC_ELT (vec
, i
) = r
;
11993 tree pack
= make_node (NONTYPE_ARGUMENT_PACK
);
11994 tree tpack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
11995 SET_ARGUMENT_PACK_ARGS (pack
, vec
);
11996 SET_ARGUMENT_PACK_ARGS (tpack
, expanded_types
);
11997 TREE_TYPE (pack
) = tpack
;
11998 register_specialization (pack
, t
, args
, false, 0);
12004 /* We reach here only for member using decls. We also need to check
12005 uses_template_parms because DECL_DEPENDENT_P is not set for a
12006 using-declaration that designates a member of the current
12007 instantiation (c++/53549). */
12008 if (DECL_DEPENDENT_P (t
)
12009 || uses_template_parms (USING_DECL_SCOPE (t
)))
12011 tree inst_scope
= tsubst_copy (USING_DECL_SCOPE (t
), args
,
12012 complain
, in_decl
);
12013 tree name
= tsubst_copy (DECL_NAME (t
), args
, complain
, in_decl
);
12014 r
= do_class_using_decl (inst_scope
, name
);
12016 r
= error_mark_node
;
12019 TREE_PROTECTED (r
) = TREE_PROTECTED (t
);
12020 TREE_PRIVATE (r
) = TREE_PRIVATE (t
);
12026 DECL_CHAIN (r
) = NULL_TREE
;
12033 tree argvec
= NULL_TREE
;
12034 tree gen_tmpl
= NULL_TREE
;
12036 tree tmpl
= NULL_TREE
;
12038 tree type
= NULL_TREE
;
12041 if (TREE_TYPE (t
) == error_mark_node
)
12042 RETURN (error_mark_node
);
12044 if (TREE_CODE (t
) == TYPE_DECL
12045 && t
== TYPE_MAIN_DECL (TREE_TYPE (t
)))
12047 /* If this is the canonical decl, we don't have to
12048 mess with instantiations, and often we can't (for
12049 typename, template type parms and such). Note that
12050 TYPE_NAME is not correct for the above test if
12051 we've copied the type for a typedef. */
12052 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12053 if (type
== error_mark_node
)
12054 RETURN (error_mark_node
);
12055 r
= TYPE_NAME (type
);
12059 /* Check to see if we already have the specialization we
12062 if (DECL_CLASS_SCOPE_P (t
) || DECL_NAMESPACE_SCOPE_P (t
))
12064 /* T is a static data member or namespace-scope entity.
12065 We have to substitute into namespace-scope variables
12066 (not just variable templates) because of cases like:
12068 template <class T> void f() { extern T t; }
12070 where the entity referenced is not known until
12071 instantiation time. */
12073 ctx
= DECL_CONTEXT (t
);
12074 if (DECL_CLASS_SCOPE_P (t
))
12076 ctx
= tsubst_aggr_type (ctx
, args
,
12078 in_decl
, /*entering_scope=*/1);
12079 /* If CTX is unchanged, then T is in fact the
12080 specialization we want. That situation occurs when
12081 referencing a static data member within in its own
12082 class. We can use pointer equality, rather than
12083 same_type_p, because DECL_CONTEXT is always
12085 if (ctx
== DECL_CONTEXT (t
)
12086 /* ... unless T is a member template; in which
12087 case our caller can be willing to create a
12088 specialization of that template represented
12090 && !(DECL_TI_TEMPLATE (t
)
12091 && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (t
))))
12097 tmpl
= DECL_TI_TEMPLATE (t
);
12098 gen_tmpl
= most_general_template (tmpl
);
12099 argvec
= tsubst (DECL_TI_ARGS (t
), args
, complain
, in_decl
);
12100 if (argvec
!= error_mark_node
)
12101 argvec
= (coerce_innermost_template_parms
12102 (DECL_TEMPLATE_PARMS (gen_tmpl
),
12103 argvec
, t
, complain
,
12104 /*all*/true, /*defarg*/true));
12105 if (argvec
== error_mark_node
)
12106 RETURN (error_mark_node
);
12107 hash
= hash_tmpl_and_args (gen_tmpl
, argvec
);
12108 spec
= retrieve_specialization (gen_tmpl
, argvec
, hash
);
12113 /* A local variable. */
12115 /* Subsequent calls to pushdecl will fill this in. */
12117 spec
= retrieve_local_specialization (t
);
12119 /* If we already have the specialization we need, there is
12120 nothing more to do. */
12127 /* Create a new node for the specialization we need. */
12129 if (type
== NULL_TREE
)
12131 if (is_typedef_decl (t
))
12132 type
= DECL_ORIGINAL_TYPE (t
);
12134 type
= TREE_TYPE (t
);
12136 && VAR_HAD_UNKNOWN_BOUND (t
)
12137 && type
!= error_mark_node
)
12138 type
= strip_array_domain (type
);
12139 type
= tsubst (type
, args
, complain
, in_decl
);
12143 /* Even if the original location is out of scope, the
12144 newly substituted one is not. */
12145 DECL_DEAD_FOR_LOCAL (r
) = 0;
12146 DECL_INITIALIZED_P (r
) = 0;
12147 DECL_TEMPLATE_INSTANTIATED (r
) = 0;
12148 if (type
== error_mark_node
)
12149 RETURN (error_mark_node
);
12150 if (TREE_CODE (type
) == FUNCTION_TYPE
)
12152 /* It may seem that this case cannot occur, since:
12157 declares a function, not a variable. However:
12160 template <typename T> void g() { T t; }
12161 template void g<f>();
12163 is an attempt to declare a variable with function
12165 error ("variable %qD has function type",
12166 /* R is not yet sufficiently initialized, so we
12167 just use its name. */
12169 RETURN (error_mark_node
);
12171 type
= complete_type (type
);
12172 /* Wait until cp_finish_decl to set this again, to handle
12173 circular dependency (template/instantiate6.C). */
12174 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r
) = 0;
12175 type
= check_var_type (DECL_NAME (r
), type
);
12177 if (DECL_HAS_VALUE_EXPR_P (t
))
12179 tree ve
= DECL_VALUE_EXPR (t
);
12180 ve
= tsubst_expr (ve
, args
, complain
, in_decl
,
12181 /*constant_expression_p=*/false);
12182 if (REFERENCE_REF_P (ve
))
12184 gcc_assert (TREE_CODE (type
) == REFERENCE_TYPE
);
12185 ve
= TREE_OPERAND (ve
, 0);
12187 SET_DECL_VALUE_EXPR (r
, ve
);
12189 if (CP_DECL_THREAD_LOCAL_P (r
)
12190 && !processing_template_decl
)
12191 set_decl_tls_model (r
, decl_default_tls_model (r
));
12193 else if (DECL_SELF_REFERENCE_P (t
))
12194 SET_DECL_SELF_REFERENCE_P (r
);
12195 TREE_TYPE (r
) = type
;
12196 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
12197 DECL_CONTEXT (r
) = ctx
;
12198 /* Clear out the mangled name and RTL for the instantiation. */
12199 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
12200 if (CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_DECL_WRTL
))
12201 SET_DECL_RTL (r
, NULL
);
12202 /* The initializer must not be expanded until it is required;
12203 see [temp.inst]. */
12204 DECL_INITIAL (r
) = NULL_TREE
;
12205 if (CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_DECL_WRTL
))
12206 SET_DECL_RTL (r
, NULL
);
12207 DECL_SIZE (r
) = DECL_SIZE_UNIT (r
) = 0;
12210 /* Possibly limit visibility based on template args. */
12211 DECL_VISIBILITY (r
) = VISIBILITY_DEFAULT
;
12212 if (DECL_VISIBILITY_SPECIFIED (t
))
12214 DECL_VISIBILITY_SPECIFIED (r
) = 0;
12215 DECL_ATTRIBUTES (r
)
12216 = remove_attribute ("visibility", DECL_ATTRIBUTES (r
));
12218 determine_visibility (r
);
12223 /* A static data member declaration is always marked
12224 external when it is declared in-class, even if an
12225 initializer is present. We mimic the non-template
12226 processing here. */
12227 DECL_EXTERNAL (r
) = 1;
12228 if (DECL_NAMESPACE_SCOPE_P (t
))
12229 DECL_NOT_REALLY_EXTERN (r
) = 1;
12231 DECL_TEMPLATE_INFO (r
) = build_template_info (tmpl
, argvec
);
12232 SET_DECL_IMPLICIT_INSTANTIATION (r
);
12233 register_specialization (r
, gen_tmpl
, argvec
, false, hash
);
12235 else if (!cp_unevaluated_operand
)
12236 register_local_specialization (r
, t
);
12238 DECL_CHAIN (r
) = NULL_TREE
;
12240 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
),
12242 args
, complain
, in_decl
);
12244 /* Preserve a typedef that names a type. */
12245 if (is_typedef_decl (r
))
12247 DECL_ORIGINAL_TYPE (r
) = NULL_TREE
;
12248 set_underlying_type (r
);
12249 if (TYPE_DECL_ALIAS_P (r
) && type
!= error_mark_node
)
12250 /* An alias template specialization can be dependent
12251 even if its underlying type is not. */
12252 TYPE_DEPENDENT_P_VALID (TREE_TYPE (r
)) = false;
12255 layout_decl (r
, 0);
12260 gcc_unreachable ();
12265 /* Restore the file and line information. */
12266 input_location
= saved_loc
;
12271 /* Substitute into the ARG_TYPES of a function type.
12272 If END is a TREE_CHAIN, leave it and any following types
12276 tsubst_arg_types (tree arg_types
,
12279 tsubst_flags_t complain
,
12282 tree remaining_arg_types
;
12283 tree type
= NULL_TREE
;
12285 tree expanded_args
= NULL_TREE
;
12288 if (!arg_types
|| arg_types
== void_list_node
|| arg_types
== end
)
12291 remaining_arg_types
= tsubst_arg_types (TREE_CHAIN (arg_types
),
12292 args
, end
, complain
, in_decl
);
12293 if (remaining_arg_types
== error_mark_node
)
12294 return error_mark_node
;
12296 if (PACK_EXPANSION_P (TREE_VALUE (arg_types
)))
12298 /* For a pack expansion, perform substitution on the
12299 entire expression. Later on, we'll handle the arguments
12301 expanded_args
= tsubst_pack_expansion (TREE_VALUE (arg_types
),
12302 args
, complain
, in_decl
);
12304 if (TREE_CODE (expanded_args
) == TREE_VEC
)
12305 /* So that we'll spin through the parameters, one by one. */
12306 i
= TREE_VEC_LENGTH (expanded_args
);
12309 /* We only partially substituted into the parameter
12310 pack. Our type is TYPE_PACK_EXPANSION. */
12311 type
= expanded_args
;
12312 expanded_args
= NULL_TREE
;
12320 type
= TREE_VEC_ELT (expanded_args
, i
);
12322 type
= tsubst (TREE_VALUE (arg_types
), args
, complain
, in_decl
);
12324 if (type
== error_mark_node
)
12325 return error_mark_node
;
12326 if (VOID_TYPE_P (type
))
12328 if (complain
& tf_error
)
12330 error ("invalid parameter type %qT", type
);
12332 error ("in declaration %q+D", in_decl
);
12334 return error_mark_node
;
12337 if (abstract_virtuals_error_sfinae (ACU_PARM
, type
, complain
))
12338 return error_mark_node
;
12340 /* Do array-to-pointer, function-to-pointer conversion, and ignore
12341 top-level qualifiers as required. */
12342 type
= cv_unqualified (type_decays_to (type
));
12344 /* We do not substitute into default arguments here. The standard
12345 mandates that they be instantiated only when needed, which is
12346 done in build_over_call. */
12347 default_arg
= TREE_PURPOSE (arg_types
);
12349 if (default_arg
&& TREE_CODE (default_arg
) == DEFAULT_ARG
)
12351 /* We've instantiated a template before its default arguments
12352 have been parsed. This can happen for a nested template
12353 class, and is not an error unless we require the default
12354 argument in a call of this function. */
12355 remaining_arg_types
=
12356 tree_cons (default_arg
, type
, remaining_arg_types
);
12357 vec_safe_push (DEFARG_INSTANTIATIONS(default_arg
), remaining_arg_types
);
12360 remaining_arg_types
=
12361 hash_tree_cons (default_arg
, type
, remaining_arg_types
);
12364 return remaining_arg_types
;
12367 /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does
12368 *not* handle the exception-specification for FNTYPE, because the
12369 initial substitution of explicitly provided template parameters
12370 during argument deduction forbids substitution into the
12371 exception-specification:
12375 All references in the function type of the function template to the
12376 corresponding template parameters are replaced by the specified tem-
12377 plate argument values. If a substitution in a template parameter or
12378 in the function type of the function template results in an invalid
12379 type, type deduction fails. [Note: The equivalent substitution in
12380 exception specifications is done only when the function is instanti-
12381 ated, at which point a program is ill-formed if the substitution
12382 results in an invalid type.] */
12385 tsubst_function_type (tree t
,
12387 tsubst_flags_t complain
,
12391 tree arg_types
= NULL_TREE
;
12394 /* The TYPE_CONTEXT is not used for function/method types. */
12395 gcc_assert (TYPE_CONTEXT (t
) == NULL_TREE
);
12397 /* DR 1227: Mixing immediate and non-immediate contexts in deduction
12399 bool late_return_type_p
= TYPE_HAS_LATE_RETURN_TYPE (t
);
12401 if (late_return_type_p
)
12403 /* Substitute the argument types. */
12404 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
, NULL_TREE
,
12405 complain
, in_decl
);
12406 if (arg_types
== error_mark_node
)
12407 return error_mark_node
;
12409 tree save_ccp
= current_class_ptr
;
12410 tree save_ccr
= current_class_ref
;
12411 tree this_type
= (TREE_CODE (t
) == METHOD_TYPE
12412 ? TREE_TYPE (TREE_VALUE (arg_types
)) : NULL_TREE
);
12413 bool do_inject
= this_type
&& CLASS_TYPE_P (this_type
);
12416 /* DR 1207: 'this' is in scope in the trailing return type. */
12417 inject_this_parameter (this_type
, cp_type_quals (this_type
));
12420 /* Substitute the return type. */
12421 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12425 current_class_ptr
= save_ccp
;
12426 current_class_ref
= save_ccr
;
12430 /* Substitute the return type. */
12431 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12433 if (return_type
== error_mark_node
)
12434 return error_mark_node
;
12435 /* DR 486 clarifies that creation of a function type with an
12436 invalid return type is a deduction failure. */
12437 if (TREE_CODE (return_type
) == ARRAY_TYPE
12438 || TREE_CODE (return_type
) == FUNCTION_TYPE
)
12440 if (complain
& tf_error
)
12442 if (TREE_CODE (return_type
) == ARRAY_TYPE
)
12443 error ("function returning an array");
12445 error ("function returning a function");
12447 return error_mark_node
;
12450 if (abstract_virtuals_error_sfinae (ACU_RETURN
, return_type
, complain
))
12451 return error_mark_node
;
12453 if (!late_return_type_p
)
12455 /* Substitute the argument types. */
12456 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
, NULL_TREE
,
12457 complain
, in_decl
);
12458 if (arg_types
== error_mark_node
)
12459 return error_mark_node
;
12462 /* Construct a new type node and return it. */
12463 if (TREE_CODE (t
) == FUNCTION_TYPE
)
12465 fntype
= build_function_type (return_type
, arg_types
);
12466 fntype
= apply_memfn_quals (fntype
,
12467 type_memfn_quals (t
),
12468 type_memfn_rqual (t
));
12472 tree r
= TREE_TYPE (TREE_VALUE (arg_types
));
12473 /* Don't pick up extra function qualifiers from the basetype. */
12474 r
= cp_build_qualified_type_real (r
, type_memfn_quals (t
), complain
);
12475 if (! MAYBE_CLASS_TYPE_P (r
))
12479 Type deduction may fail for any of the following
12482 -- Attempting to create "pointer to member of T" when T
12483 is not a class type. */
12484 if (complain
& tf_error
)
12485 error ("creating pointer to member function of non-class type %qT",
12487 return error_mark_node
;
12490 fntype
= build_method_type_directly (r
, return_type
,
12491 TREE_CHAIN (arg_types
));
12492 fntype
= build_ref_qualified_type (fntype
, type_memfn_rqual (t
));
12494 fntype
= cp_build_type_attribute_variant (fntype
, TYPE_ATTRIBUTES (t
));
12496 if (late_return_type_p
)
12497 TYPE_HAS_LATE_RETURN_TYPE (fntype
) = 1;
12502 /* FNTYPE is a FUNCTION_TYPE or METHOD_TYPE. Substitute the template
12503 ARGS into that specification, and return the substituted
12504 specification. If there is no specification, return NULL_TREE. */
12507 tsubst_exception_specification (tree fntype
,
12509 tsubst_flags_t complain
,
12516 specs
= TYPE_RAISES_EXCEPTIONS (fntype
);
12517 new_specs
= NULL_TREE
;
12518 if (specs
&& TREE_PURPOSE (specs
))
12520 /* A noexcept-specifier. */
12521 tree expr
= TREE_PURPOSE (specs
);
12522 if (TREE_CODE (expr
) == INTEGER_CST
)
12526 /* Defer instantiation of noexcept-specifiers to avoid
12527 excessive instantiations (c++/49107). */
12528 new_specs
= make_node (DEFERRED_NOEXCEPT
);
12529 if (DEFERRED_NOEXCEPT_SPEC_P (specs
))
12531 /* We already partially instantiated this member template,
12532 so combine the new args with the old. */
12533 DEFERRED_NOEXCEPT_PATTERN (new_specs
)
12534 = DEFERRED_NOEXCEPT_PATTERN (expr
);
12535 DEFERRED_NOEXCEPT_ARGS (new_specs
)
12536 = add_to_template_args (DEFERRED_NOEXCEPT_ARGS (expr
), args
);
12540 DEFERRED_NOEXCEPT_PATTERN (new_specs
) = expr
;
12541 DEFERRED_NOEXCEPT_ARGS (new_specs
) = args
;
12545 new_specs
= tsubst_copy_and_build
12546 (expr
, args
, complain
, in_decl
, /*function_p=*/false,
12547 /*integral_constant_expression_p=*/true);
12548 new_specs
= build_noexcept_spec (new_specs
, complain
);
12552 if (! TREE_VALUE (specs
))
12559 tree expanded_specs
= NULL_TREE
;
12561 if (PACK_EXPANSION_P (TREE_VALUE (specs
)))
12563 /* Expand the pack expansion type. */
12564 expanded_specs
= tsubst_pack_expansion (TREE_VALUE (specs
),
12568 if (expanded_specs
== error_mark_node
)
12569 return error_mark_node
;
12570 else if (TREE_CODE (expanded_specs
) == TREE_VEC
)
12571 len
= TREE_VEC_LENGTH (expanded_specs
);
12574 /* We're substituting into a member template, so
12575 we got a TYPE_PACK_EXPANSION back. Add that
12576 expansion and move on. */
12577 gcc_assert (TREE_CODE (expanded_specs
)
12578 == TYPE_PACK_EXPANSION
);
12579 new_specs
= add_exception_specifier (new_specs
,
12582 specs
= TREE_CHAIN (specs
);
12587 for (i
= 0; i
< len
; ++i
)
12589 if (expanded_specs
)
12590 spec
= TREE_VEC_ELT (expanded_specs
, i
);
12592 spec
= tsubst (TREE_VALUE (specs
), args
, complain
, in_decl
);
12593 if (spec
== error_mark_node
)
12595 new_specs
= add_exception_specifier (new_specs
, spec
,
12599 specs
= TREE_CHAIN (specs
);
12605 /* Take the tree structure T and replace template parameters used
12606 therein with the argument vector ARGS. IN_DECL is an associated
12607 decl for diagnostics. If an error occurs, returns ERROR_MARK_NODE.
12608 Issue error and warning messages under control of COMPLAIN. Note
12609 that we must be relatively non-tolerant of extensions here, in
12610 order to preserve conformance; if we allow substitutions that
12611 should not be allowed, we may allow argument deductions that should
12612 not succeed, and therefore report ambiguous overload situations
12613 where there are none. In theory, we could allow the substitution,
12614 but indicate that it should have failed, and allow our caller to
12615 make sure that the right thing happens, but we don't try to do this
12618 This function is used for dealing with types, decls and the like;
12619 for expressions, use tsubst_expr or tsubst_copy. */
12622 tsubst (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
12624 enum tree_code code
;
12625 tree type
, r
= NULL_TREE
;
12627 if (t
== NULL_TREE
|| t
== error_mark_node
12628 || t
== integer_type_node
12629 || t
== void_type_node
12630 || t
== char_type_node
12631 || t
== unknown_type_node
12632 || TREE_CODE (t
) == NAMESPACE_DECL
12633 || TREE_CODE (t
) == TRANSLATION_UNIT_DECL
)
12637 return tsubst_decl (t
, args
, complain
);
12639 if (args
== NULL_TREE
)
12642 code
= TREE_CODE (t
);
12644 if (code
== IDENTIFIER_NODE
)
12645 type
= IDENTIFIER_TYPE_VALUE (t
);
12647 type
= TREE_TYPE (t
);
12649 gcc_assert (type
!= unknown_type_node
);
12651 /* Reuse typedefs. We need to do this to handle dependent attributes,
12652 such as attribute aligned. */
12654 && typedef_variant_p (t
))
12656 tree decl
= TYPE_NAME (t
);
12658 if (alias_template_specialization_p (t
))
12660 /* DECL represents an alias template and we want to
12662 tree tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
12663 tree gen_args
= tsubst (DECL_TI_ARGS (decl
), args
, complain
, in_decl
);
12664 r
= instantiate_alias_template (tmpl
, gen_args
, complain
);
12666 else if (DECL_CLASS_SCOPE_P (decl
)
12667 && CLASSTYPE_TEMPLATE_INFO (DECL_CONTEXT (decl
))
12668 && uses_template_parms (DECL_CONTEXT (decl
)))
12670 tree tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
12671 tree gen_args
= tsubst (DECL_TI_ARGS (decl
), args
, complain
, in_decl
);
12672 r
= retrieve_specialization (tmpl
, gen_args
, 0);
12674 else if (DECL_FUNCTION_SCOPE_P (decl
)
12675 && DECL_TEMPLATE_INFO (DECL_CONTEXT (decl
))
12676 && uses_template_parms (DECL_TI_ARGS (DECL_CONTEXT (decl
))))
12677 r
= retrieve_local_specialization (decl
);
12679 /* The typedef is from a non-template context. */
12685 r
= cp_build_qualified_type_real
12686 (r
, cp_type_quals (t
) | cp_type_quals (r
),
12687 complain
| tf_ignore_bad_quals
);
12692 /* We don't have an instantiation yet, so drop the typedef. */
12693 int quals
= cp_type_quals (t
);
12694 t
= DECL_ORIGINAL_TYPE (decl
);
12695 t
= cp_build_qualified_type_real (t
, quals
,
12696 complain
| tf_ignore_bad_quals
);
12701 && code
!= TYPENAME_TYPE
12702 && code
!= TEMPLATE_TYPE_PARM
12703 && code
!= IDENTIFIER_NODE
12704 && code
!= FUNCTION_TYPE
12705 && code
!= METHOD_TYPE
)
12706 type
= tsubst (type
, args
, complain
, in_decl
);
12707 if (type
== error_mark_node
)
12708 return error_mark_node
;
12714 case ENUMERAL_TYPE
:
12715 return tsubst_aggr_type (t
, args
, complain
, in_decl
,
12716 /*entering_scope=*/0);
12719 case IDENTIFIER_NODE
:
12730 if (t
== integer_type_node
)
12733 if (TREE_CODE (TYPE_MIN_VALUE (t
)) == INTEGER_CST
12734 && TREE_CODE (TYPE_MAX_VALUE (t
)) == INTEGER_CST
)
12738 tree max
, omax
= TREE_OPERAND (TYPE_MAX_VALUE (t
), 0);
12740 max
= tsubst_expr (omax
, args
, complain
, in_decl
,
12741 /*integral_constant_expression_p=*/false);
12743 /* Fix up type of the magic NOP_EXPR with TREE_SIDE_EFFECTS if
12745 if (TREE_CODE (max
) == NOP_EXPR
12746 && TREE_SIDE_EFFECTS (omax
)
12747 && !TREE_TYPE (max
))
12748 TREE_TYPE (max
) = TREE_TYPE (TREE_OPERAND (max
, 0));
12750 /* If we're in a partial instantiation, preserve the magic NOP_EXPR
12751 with TREE_SIDE_EFFECTS that indicates this is not an integral
12752 constant expression. */
12753 if (processing_template_decl
12754 && TREE_SIDE_EFFECTS (omax
) && TREE_CODE (omax
) == NOP_EXPR
)
12756 gcc_assert (TREE_CODE (max
) == NOP_EXPR
);
12757 TREE_SIDE_EFFECTS (max
) = 1;
12760 return compute_array_index_type (NULL_TREE
, max
, complain
);
12763 case TEMPLATE_TYPE_PARM
:
12764 case TEMPLATE_TEMPLATE_PARM
:
12765 case BOUND_TEMPLATE_TEMPLATE_PARM
:
12766 case TEMPLATE_PARM_INDEX
:
12771 tree arg
= NULL_TREE
;
12773 /* Early in template argument deduction substitution, we don't
12774 want to reduce the level of 'auto', or it will be confused
12775 with a normal template parm in subsequent deduction. */
12776 if (is_auto (t
) && (complain
& tf_partial
))
12781 gcc_assert (TREE_VEC_LENGTH (args
) > 0);
12782 template_parm_level_and_index (t
, &level
, &idx
);
12784 levels
= TMPL_ARGS_DEPTH (args
);
12785 if (level
<= levels
12786 && TREE_VEC_LENGTH (TMPL_ARGS_LEVEL (args
, level
)) > 0)
12788 arg
= TMPL_ARG (args
, level
, idx
);
12790 if (arg
&& TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
12792 /* See through ARGUMENT_PACK_SELECT arguments. */
12793 arg
= ARGUMENT_PACK_SELECT_ARG (arg
);
12794 /* If the selected argument is an expansion E, that most
12795 likely means we were called from
12796 gen_elem_of_pack_expansion_instantiation during the
12797 substituting of pack an argument pack (which Ith
12798 element is a pack expansion, where I is
12799 ARGUMENT_PACK_SELECT_INDEX) into a pack expansion.
12800 In this case, the Ith element resulting from this
12801 substituting is going to be a pack expansion, which
12802 pattern is the pattern of E. Let's return the
12804 gen_elem_of_pack_expansion_instantiation will
12805 build the resulting pack expansion from it. */
12806 if (PACK_EXPANSION_P (arg
))
12808 /* Make sure we aren't throwing away arg info. */
12809 gcc_assert (!PACK_EXPANSION_EXTRA_ARGS (arg
));
12810 arg
= PACK_EXPANSION_PATTERN (arg
);
12815 if (arg
== error_mark_node
)
12816 return error_mark_node
;
12817 else if (arg
!= NULL_TREE
)
12819 if (ARGUMENT_PACK_P (arg
))
12820 /* If ARG is an argument pack, we don't actually want to
12821 perform a substitution here, because substitutions
12822 for argument packs are only done
12823 element-by-element. We can get to this point when
12824 substituting the type of a non-type template
12825 parameter pack, when that type actually contains
12826 template parameter packs from an outer template, e.g.,
12828 template<typename... Types> struct A {
12829 template<Types... Values> struct B { };
12833 if (code
== TEMPLATE_TYPE_PARM
)
12836 gcc_assert (TYPE_P (arg
));
12838 quals
= cp_type_quals (arg
) | cp_type_quals (t
);
12840 return cp_build_qualified_type_real
12841 (arg
, quals
, complain
| tf_ignore_bad_quals
);
12843 else if (code
== BOUND_TEMPLATE_TEMPLATE_PARM
)
12845 /* We are processing a type constructed from a
12846 template template parameter. */
12847 tree argvec
= tsubst (TYPE_TI_ARGS (t
),
12848 args
, complain
, in_decl
);
12849 if (argvec
== error_mark_node
)
12850 return error_mark_node
;
12852 gcc_assert (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
12853 || TREE_CODE (arg
) == TEMPLATE_DECL
12854 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
);
12856 if (TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
)
12857 /* Consider this code:
12859 template <template <class> class Template>
12861 template <class Arg> using Bind = Template<Arg>;
12864 template <template <class> class Template, class Arg>
12865 using Instantiate = Template<Arg>; //#0
12867 template <template <class> class Template,
12870 Instantiate<Internal<Template>::template Bind,
12873 When #1 is parsed, the
12874 BOUND_TEMPLATE_TEMPLATE_PARM representing the
12875 parameter `Template' in #0 matches the
12876 UNBOUND_CLASS_TEMPLATE representing the argument
12877 `Internal<Template>::template Bind'; We then want
12878 to assemble the type `Bind<Argument>' that can't
12879 be fully created right now, because
12880 `Internal<Template>' not being complete, the Bind
12881 template cannot be looked up in that context. So
12882 we need to "store" `Bind<Argument>' for later
12883 when the context of Bind becomes complete. Let's
12884 store that in a TYPENAME_TYPE. */
12885 return make_typename_type (TYPE_CONTEXT (arg
),
12886 build_nt (TEMPLATE_ID_EXPR
,
12887 TYPE_IDENTIFIER (arg
),
12892 /* We can get a TEMPLATE_TEMPLATE_PARM here when we
12893 are resolving nested-types in the signature of a
12894 member function templates. Otherwise ARG is a
12895 TEMPLATE_DECL and is the real template to be
12897 if (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
12898 arg
= TYPE_NAME (arg
);
12900 r
= lookup_template_class (arg
,
12902 DECL_CONTEXT (arg
),
12903 /*entering_scope=*/0,
12905 return cp_build_qualified_type_real
12906 (r
, cp_type_quals (t
) | cp_type_quals (r
), complain
);
12909 /* TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX. */
12910 return convert_from_reference (unshare_expr (arg
));
12914 /* This can happen during the attempted tsubst'ing in
12915 unify. This means that we don't yet have any information
12916 about the template parameter in question. */
12919 /* If we get here, we must have been looking at a parm for a
12920 more deeply nested template. Make a new version of this
12921 template parameter, but with a lower level. */
12924 case TEMPLATE_TYPE_PARM
:
12925 case TEMPLATE_TEMPLATE_PARM
:
12926 case BOUND_TEMPLATE_TEMPLATE_PARM
:
12927 if (cp_type_quals (t
))
12929 r
= tsubst (TYPE_MAIN_VARIANT (t
), args
, complain
, in_decl
);
12930 r
= cp_build_qualified_type_real
12931 (r
, cp_type_quals (t
),
12932 complain
| (code
== TEMPLATE_TYPE_PARM
12933 ? tf_ignore_bad_quals
: 0));
12935 else if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
12936 && PLACEHOLDER_TYPE_CONSTRAINTS (t
)
12937 && (r
= (TEMPLATE_PARM_DESCENDANTS
12938 (TEMPLATE_TYPE_PARM_INDEX (t
))))
12939 && (r
= TREE_TYPE (r
))
12940 && !PLACEHOLDER_TYPE_CONSTRAINTS (r
))
12941 /* Break infinite recursion when substituting the constraints
12942 of a constrained placeholder. */;
12946 TEMPLATE_TYPE_PARM_INDEX (r
)
12947 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (t
),
12948 r
, levels
, args
, complain
);
12949 TYPE_STUB_DECL (r
) = TYPE_NAME (r
) = TEMPLATE_TYPE_DECL (r
);
12950 TYPE_MAIN_VARIANT (r
) = r
;
12951 TYPE_POINTER_TO (r
) = NULL_TREE
;
12952 TYPE_REFERENCE_TO (r
) = NULL_TREE
;
12954 if (TREE_CODE (r
) == TEMPLATE_TEMPLATE_PARM
)
12955 /* We have reduced the level of the template
12956 template parameter, but not the levels of its
12957 template parameters, so canonical_type_parameter
12958 will not be able to find the canonical template
12959 template parameter for this level. Thus, we
12960 require structural equality checking to compare
12961 TEMPLATE_TEMPLATE_PARMs. */
12962 SET_TYPE_STRUCTURAL_EQUALITY (r
);
12963 else if (TYPE_STRUCTURAL_EQUALITY_P (t
))
12964 SET_TYPE_STRUCTURAL_EQUALITY (r
);
12966 TYPE_CANONICAL (r
) = canonical_type_parameter (r
);
12968 /* Propagate constraints on placeholders. */
12969 if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
12970 if (tree constr
= PLACEHOLDER_TYPE_CONSTRAINTS (t
))
12971 PLACEHOLDER_TYPE_CONSTRAINTS (r
)
12972 = tsubst_constraint (constr
, args
, complain
, in_decl
);
12974 if (code
== BOUND_TEMPLATE_TEMPLATE_PARM
)
12976 tree argvec
= tsubst (TYPE_TI_ARGS (t
), args
,
12977 complain
, in_decl
);
12978 if (argvec
== error_mark_node
)
12979 return error_mark_node
;
12981 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (r
)
12982 = build_template_info (TYPE_TI_TEMPLATE (t
), argvec
);
12987 case TEMPLATE_PARM_INDEX
:
12988 r
= reduce_template_parm_level (t
, type
, levels
, args
, complain
);
12992 gcc_unreachable ();
13000 tree purpose
, value
, chain
;
13002 if (t
== void_list_node
)
13005 purpose
= TREE_PURPOSE (t
);
13008 purpose
= tsubst (purpose
, args
, complain
, in_decl
);
13009 if (purpose
== error_mark_node
)
13010 return error_mark_node
;
13012 value
= TREE_VALUE (t
);
13015 value
= tsubst (value
, args
, complain
, in_decl
);
13016 if (value
== error_mark_node
)
13017 return error_mark_node
;
13019 chain
= TREE_CHAIN (t
);
13020 if (chain
&& chain
!= void_type_node
)
13022 chain
= tsubst (chain
, args
, complain
, in_decl
);
13023 if (chain
== error_mark_node
)
13024 return error_mark_node
;
13026 if (purpose
== TREE_PURPOSE (t
)
13027 && value
== TREE_VALUE (t
)
13028 && chain
== TREE_CHAIN (t
))
13030 return hash_tree_cons (purpose
, value
, chain
);
13034 /* We should never be tsubsting a binfo. */
13035 gcc_unreachable ();
13038 /* A vector of template arguments. */
13039 gcc_assert (!type
);
13040 return tsubst_template_args (t
, args
, complain
, in_decl
);
13043 case REFERENCE_TYPE
:
13045 if (type
== TREE_TYPE (t
) && TREE_CODE (type
) != METHOD_TYPE
)
13050 Type deduction may fail for any of the following
13053 -- Attempting to create a pointer to reference type.
13054 -- Attempting to create a reference to a reference type or
13055 a reference to void.
13057 Core issue 106 says that creating a reference to a reference
13058 during instantiation is no longer a cause for failure. We
13059 only enforce this check in strict C++98 mode. */
13060 if ((TREE_CODE (type
) == REFERENCE_TYPE
13061 && (((cxx_dialect
== cxx98
) && flag_iso
) || code
!= REFERENCE_TYPE
))
13062 || (code
== REFERENCE_TYPE
&& VOID_TYPE_P (type
)))
13064 static location_t last_loc
;
13066 /* We keep track of the last time we issued this error
13067 message to avoid spewing a ton of messages during a
13068 single bad template instantiation. */
13069 if (complain
& tf_error
13070 && last_loc
!= input_location
)
13072 if (VOID_TYPE_P (type
))
13073 error ("forming reference to void");
13074 else if (code
== POINTER_TYPE
)
13075 error ("forming pointer to reference type %qT", type
);
13077 error ("forming reference to reference type %qT", type
);
13078 last_loc
= input_location
;
13081 return error_mark_node
;
13083 else if (TREE_CODE (type
) == FUNCTION_TYPE
13084 && (type_memfn_quals (type
) != TYPE_UNQUALIFIED
13085 || type_memfn_rqual (type
) != REF_QUAL_NONE
))
13087 if (complain
& tf_error
)
13089 if (code
== POINTER_TYPE
)
13090 error ("forming pointer to qualified function type %qT",
13093 error ("forming reference to qualified function type %qT",
13096 return error_mark_node
;
13098 else if (code
== POINTER_TYPE
)
13100 r
= build_pointer_type (type
);
13101 if (TREE_CODE (type
) == METHOD_TYPE
)
13102 r
= build_ptrmemfunc_type (r
);
13104 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
13105 /* In C++0x, during template argument substitution, when there is an
13106 attempt to create a reference to a reference type, reference
13107 collapsing is applied as described in [14.3.1/4 temp.arg.type]:
13109 "If a template-argument for a template-parameter T names a type
13110 that is a reference to a type A, an attempt to create the type
13111 'lvalue reference to cv T' creates the type 'lvalue reference to
13112 A,' while an attempt to create the type type rvalue reference to
13113 cv T' creates the type T"
13115 r
= cp_build_reference_type
13117 TYPE_REF_IS_RVALUE (t
) && TYPE_REF_IS_RVALUE (type
));
13119 r
= cp_build_reference_type (type
, TYPE_REF_IS_RVALUE (t
));
13120 r
= cp_build_qualified_type_real (r
, cp_type_quals (t
), complain
);
13122 if (r
!= error_mark_node
)
13123 /* Will this ever be needed for TYPE_..._TO values? */
13130 r
= tsubst (TYPE_OFFSET_BASETYPE (t
), args
, complain
, in_decl
);
13131 if (r
== error_mark_node
|| !MAYBE_CLASS_TYPE_P (r
))
13135 Type deduction may fail for any of the following
13138 -- Attempting to create "pointer to member of T" when T
13139 is not a class type. */
13140 if (complain
& tf_error
)
13141 error ("creating pointer to member of non-class type %qT", r
);
13142 return error_mark_node
;
13144 if (TREE_CODE (type
) == REFERENCE_TYPE
)
13146 if (complain
& tf_error
)
13147 error ("creating pointer to member reference type %qT", type
);
13148 return error_mark_node
;
13150 if (VOID_TYPE_P (type
))
13152 if (complain
& tf_error
)
13153 error ("creating pointer to member of type void");
13154 return error_mark_node
;
13156 gcc_assert (TREE_CODE (type
) != METHOD_TYPE
);
13157 if (TREE_CODE (type
) == FUNCTION_TYPE
)
13159 /* The type of the implicit object parameter gets its
13160 cv-qualifiers from the FUNCTION_TYPE. */
13163 = build_memfn_type (type
, r
, type_memfn_quals (type
),
13164 type_memfn_rqual (type
));
13165 memptr
= build_ptrmemfunc_type (build_pointer_type (method_type
));
13166 return cp_build_qualified_type_real (memptr
, cp_type_quals (t
),
13170 return cp_build_qualified_type_real (build_ptrmem_type (r
, type
),
13174 case FUNCTION_TYPE
:
13179 fntype
= tsubst_function_type (t
, args
, complain
, in_decl
);
13180 if (fntype
== error_mark_node
)
13181 return error_mark_node
;
13183 /* Substitute the exception specification. */
13184 specs
= tsubst_exception_specification (t
, args
, complain
,
13185 in_decl
, /*defer_ok*/true);
13186 if (specs
== error_mark_node
)
13187 return error_mark_node
;
13189 fntype
= build_exception_variant (fntype
, specs
);
13194 tree domain
= tsubst (TYPE_DOMAIN (t
), args
, complain
, in_decl
);
13195 if (domain
== error_mark_node
)
13196 return error_mark_node
;
13198 /* As an optimization, we avoid regenerating the array type if
13199 it will obviously be the same as T. */
13200 if (type
== TREE_TYPE (t
) && domain
== TYPE_DOMAIN (t
))
13203 /* These checks should match the ones in create_array_type_for_decl.
13207 The deduction may fail for any of the following reasons:
13209 -- Attempting to create an array with an element type that
13210 is void, a function type, or a reference type, or [DR337]
13211 an abstract class type. */
13212 if (VOID_TYPE_P (type
)
13213 || TREE_CODE (type
) == FUNCTION_TYPE
13214 || (TREE_CODE (type
) == ARRAY_TYPE
13215 && TYPE_DOMAIN (type
) == NULL_TREE
)
13216 || TREE_CODE (type
) == REFERENCE_TYPE
)
13218 if (complain
& tf_error
)
13219 error ("creating array of %qT", type
);
13220 return error_mark_node
;
13223 if (abstract_virtuals_error_sfinae (ACU_ARRAY
, type
, complain
))
13224 return error_mark_node
;
13226 r
= build_cplus_array_type (type
, domain
);
13228 if (TYPE_USER_ALIGN (t
))
13230 TYPE_ALIGN (r
) = TYPE_ALIGN (t
);
13231 TYPE_USER_ALIGN (r
) = 1;
13237 case TYPENAME_TYPE
:
13239 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
13240 in_decl
, /*entering_scope=*/1);
13241 tree f
= tsubst_copy (TYPENAME_TYPE_FULLNAME (t
), args
,
13242 complain
, in_decl
);
13244 if (ctx
== error_mark_node
|| f
== error_mark_node
)
13245 return error_mark_node
;
13247 if (!MAYBE_CLASS_TYPE_P (ctx
))
13249 if (complain
& tf_error
)
13250 error ("%qT is not a class, struct, or union type", ctx
);
13251 return error_mark_node
;
13253 else if (!uses_template_parms (ctx
) && !TYPE_BEING_DEFINED (ctx
))
13255 /* Normally, make_typename_type does not require that the CTX
13256 have complete type in order to allow things like:
13258 template <class T> struct S { typename S<T>::X Y; };
13260 But, such constructs have already been resolved by this
13261 point, so here CTX really should have complete type, unless
13262 it's a partial instantiation. */
13263 ctx
= complete_type (ctx
);
13264 if (!COMPLETE_TYPE_P (ctx
))
13266 if (complain
& tf_error
)
13267 cxx_incomplete_type_error (NULL_TREE
, ctx
);
13268 return error_mark_node
;
13272 f
= make_typename_type (ctx
, f
, typename_type
,
13273 complain
| tf_keep_type_decl
);
13274 if (f
== error_mark_node
)
13276 if (TREE_CODE (f
) == TYPE_DECL
)
13278 complain
|= tf_ignore_bad_quals
;
13282 if (TREE_CODE (f
) != TYPENAME_TYPE
)
13284 if (TYPENAME_IS_ENUM_P (t
) && TREE_CODE (f
) != ENUMERAL_TYPE
)
13286 if (complain
& tf_error
)
13287 error ("%qT resolves to %qT, which is not an enumeration type",
13290 return error_mark_node
;
13292 else if (TYPENAME_IS_CLASS_P (t
) && !CLASS_TYPE_P (f
))
13294 if (complain
& tf_error
)
13295 error ("%qT resolves to %qT, which is is not a class type",
13298 return error_mark_node
;
13302 return cp_build_qualified_type_real
13303 (f
, cp_type_quals (f
) | cp_type_quals (t
), complain
);
13306 case UNBOUND_CLASS_TEMPLATE
:
13308 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
13309 in_decl
, /*entering_scope=*/1);
13310 tree name
= TYPE_IDENTIFIER (t
);
13311 tree parm_list
= DECL_TEMPLATE_PARMS (TYPE_NAME (t
));
13313 if (ctx
== error_mark_node
|| name
== error_mark_node
)
13314 return error_mark_node
;
13317 parm_list
= tsubst_template_parms (parm_list
, args
, complain
);
13318 return make_unbound_class_template (ctx
, name
, parm_list
, complain
);
13325 ++cp_unevaluated_operand
;
13326 ++c_inhibit_evaluation_warnings
;
13328 type
= tsubst_expr (TYPEOF_TYPE_EXPR (t
), args
,
13330 /*integral_constant_expression_p=*/false);
13332 --cp_unevaluated_operand
;
13333 --c_inhibit_evaluation_warnings
;
13335 type
= finish_typeof (type
);
13336 return cp_build_qualified_type_real (type
,
13338 | cp_type_quals (type
),
13342 case DECLTYPE_TYPE
:
13346 ++cp_unevaluated_operand
;
13347 ++c_inhibit_evaluation_warnings
;
13349 type
= tsubst_copy_and_build (DECLTYPE_TYPE_EXPR (t
), args
,
13350 complain
|tf_decltype
, in_decl
,
13351 /*function_p*/false,
13352 /*integral_constant_expression*/false);
13354 --cp_unevaluated_operand
;
13355 --c_inhibit_evaluation_warnings
;
13357 if (DECLTYPE_FOR_LAMBDA_CAPTURE (t
))
13358 type
= lambda_capture_field_type (type
,
13359 DECLTYPE_FOR_INIT_CAPTURE (t
));
13360 else if (DECLTYPE_FOR_LAMBDA_PROXY (t
))
13361 type
= lambda_proxy_type (type
);
13364 bool id
= DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t
);
13365 if (id
&& TREE_CODE (DECLTYPE_TYPE_EXPR (t
)) == BIT_NOT_EXPR
13367 /* In a template ~id could be either a complement expression
13368 or an unqualified-id naming a destructor; if instantiating
13369 it produces an expression, it's not an id-expression or
13372 type
= finish_decltype_type (type
, id
, complain
);
13374 return cp_build_qualified_type_real (type
,
13376 | cp_type_quals (type
),
13377 complain
| tf_ignore_bad_quals
);
13380 case UNDERLYING_TYPE
:
13382 tree type
= tsubst (UNDERLYING_TYPE_TYPE (t
), args
,
13383 complain
, in_decl
);
13384 return finish_underlying_type (type
);
13387 case TYPE_ARGUMENT_PACK
:
13388 case NONTYPE_ARGUMENT_PACK
:
13390 tree r
= TYPE_P (t
) ? cxx_make_type (code
) : make_node (code
);
13392 tsubst_template_args (ARGUMENT_PACK_ARGS (t
),
13396 SET_ARGUMENT_PACK_ARGS (r
, packed_out
);
13398 /* For template nontype argument packs, also substitute into
13400 if (code
== NONTYPE_ARGUMENT_PACK
)
13401 TREE_TYPE (r
) = tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13420 /* We should use one of the expression tsubsts for these codes. */
13421 gcc_unreachable ();
13424 sorry ("use of %qs in template", get_tree_code_name (code
));
13425 return error_mark_node
;
13429 /* Like tsubst_expr for a BASELINK. OBJECT_TYPE, if non-NULL, is the
13430 type of the expression on the left-hand side of the "." or "->"
13434 tsubst_baselink (tree baselink
, tree object_type
,
13435 tree args
, tsubst_flags_t complain
, tree in_decl
)
13438 tree qualifying_scope
;
13441 tree template_args
= 0;
13442 bool template_id_p
= false;
13443 bool qualified
= BASELINK_QUALIFIED_P (baselink
);
13445 /* A baselink indicates a function from a base class. Both the
13446 BASELINK_ACCESS_BINFO and the base class referenced may
13447 indicate bases of the template class, rather than the
13448 instantiated class. In addition, lookups that were not
13449 ambiguous before may be ambiguous now. Therefore, we perform
13450 the lookup again. */
13451 qualifying_scope
= BINFO_TYPE (BASELINK_ACCESS_BINFO (baselink
));
13452 qualifying_scope
= tsubst (qualifying_scope
, args
,
13453 complain
, in_decl
);
13454 fns
= BASELINK_FUNCTIONS (baselink
);
13455 optype
= tsubst (BASELINK_OPTYPE (baselink
), args
, complain
, in_decl
);
13456 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
13458 template_id_p
= true;
13459 template_args
= TREE_OPERAND (fns
, 1);
13460 fns
= TREE_OPERAND (fns
, 0);
13462 template_args
= tsubst_template_args (template_args
, args
,
13463 complain
, in_decl
);
13465 name
= DECL_NAME (get_first_fn (fns
));
13466 if (IDENTIFIER_TYPENAME_P (name
))
13467 name
= mangle_conv_op_name_for_type (optype
);
13468 baselink
= lookup_fnfields (qualifying_scope
, name
, /*protect=*/1);
13470 return error_mark_node
;
13472 /* If lookup found a single function, mark it as used at this
13473 point. (If it lookup found multiple functions the one selected
13474 later by overload resolution will be marked as used at that
13476 if (BASELINK_P (baselink
))
13477 fns
= BASELINK_FUNCTIONS (baselink
);
13478 if (!template_id_p
&& !really_overloaded_fn (fns
)
13479 && !mark_used (OVL_CURRENT (fns
), complain
) && !(complain
& tf_error
))
13480 return error_mark_node
;
13482 /* Add back the template arguments, if present. */
13483 if (BASELINK_P (baselink
) && template_id_p
)
13484 BASELINK_FUNCTIONS (baselink
)
13485 = build_nt (TEMPLATE_ID_EXPR
,
13486 BASELINK_FUNCTIONS (baselink
),
13488 /* Update the conversion operator type. */
13489 BASELINK_OPTYPE (baselink
) = optype
;
13492 object_type
= current_class_type
;
13495 baselink
= adjust_result_of_qualified_name_lookup (baselink
,
13501 /* Like tsubst_expr for a SCOPE_REF, given by QUALIFIED_ID. DONE is
13502 true if the qualified-id will be a postfix-expression in-and-of
13503 itself; false if more of the postfix-expression follows the
13504 QUALIFIED_ID. ADDRESS_P is true if the qualified-id is the operand
13508 tsubst_qualified_id (tree qualified_id
, tree args
,
13509 tsubst_flags_t complain
, tree in_decl
,
13510 bool done
, bool address_p
)
13516 tree template_args
;
13517 location_t loc
= UNKNOWN_LOCATION
;
13519 gcc_assert (TREE_CODE (qualified_id
) == SCOPE_REF
);
13521 /* Figure out what name to look up. */
13522 name
= TREE_OPERAND (qualified_id
, 1);
13523 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
13525 is_template
= true;
13526 loc
= EXPR_LOCATION (name
);
13527 template_args
= TREE_OPERAND (name
, 1);
13529 template_args
= tsubst_template_args (template_args
, args
,
13530 complain
, in_decl
);
13531 name
= TREE_OPERAND (name
, 0);
13535 is_template
= false;
13536 template_args
= NULL_TREE
;
13539 /* Substitute into the qualifying scope. When there are no ARGS, we
13540 are just trying to simplify a non-dependent expression. In that
13541 case the qualifying scope may be dependent, and, in any case,
13542 substituting will not help. */
13543 scope
= TREE_OPERAND (qualified_id
, 0);
13546 scope
= tsubst (scope
, args
, complain
, in_decl
);
13547 expr
= tsubst_copy (name
, args
, complain
, in_decl
);
13552 if (dependent_scope_p (scope
))
13555 expr
= build_min_nt_loc (loc
, TEMPLATE_ID_EXPR
, expr
, template_args
);
13556 return build_qualified_name (NULL_TREE
, scope
, expr
,
13557 QUALIFIED_NAME_IS_TEMPLATE (qualified_id
));
13560 if (!BASELINK_P (name
) && !DECL_P (expr
))
13562 if (TREE_CODE (expr
) == BIT_NOT_EXPR
)
13564 /* A BIT_NOT_EXPR is used to represent a destructor. */
13565 if (!check_dtor_name (scope
, TREE_OPERAND (expr
, 0)))
13567 error ("qualifying type %qT does not match destructor name ~%qT",
13568 scope
, TREE_OPERAND (expr
, 0));
13569 expr
= error_mark_node
;
13572 expr
= lookup_qualified_name (scope
, complete_dtor_identifier
,
13573 /*is_type_p=*/0, false);
13576 expr
= lookup_qualified_name (scope
, expr
, /*is_type_p=*/0, false);
13577 if (TREE_CODE (TREE_CODE (expr
) == TEMPLATE_DECL
13578 ? DECL_TEMPLATE_RESULT (expr
) : expr
) == TYPE_DECL
)
13580 if (complain
& tf_error
)
13582 error ("dependent-name %qE is parsed as a non-type, but "
13583 "instantiation yields a type", qualified_id
);
13584 inform (input_location
, "say %<typename %E%> if a type is meant", qualified_id
);
13586 return error_mark_node
;
13592 check_accessibility_of_qualified_id (expr
, /*object_type=*/NULL_TREE
,
13594 /* Remember that there was a reference to this entity. */
13595 if (!mark_used (expr
, complain
) && !(complain
& tf_error
))
13596 return error_mark_node
;
13599 if (expr
== error_mark_node
|| TREE_CODE (expr
) == TREE_LIST
)
13601 if (complain
& tf_error
)
13602 qualified_name_lookup_error (scope
,
13603 TREE_OPERAND (qualified_id
, 1),
13604 expr
, input_location
);
13605 return error_mark_node
;
13609 expr
= lookup_template_function (expr
, template_args
);
13611 if (expr
== error_mark_node
&& complain
& tf_error
)
13612 qualified_name_lookup_error (scope
, TREE_OPERAND (qualified_id
, 1),
13613 expr
, input_location
);
13614 else if (TYPE_P (scope
))
13616 expr
= (adjust_result_of_qualified_name_lookup
13617 (expr
, scope
, current_nonlambda_class_type ()));
13618 expr
= (finish_qualified_id_expr
13619 (scope
, expr
, done
, address_p
&& PTRMEM_OK_P (qualified_id
),
13620 QUALIFIED_NAME_IS_TEMPLATE (qualified_id
),
13621 /*template_arg_p=*/false, complain
));
13624 /* Expressions do not generally have reference type. */
13625 if (TREE_CODE (expr
) != SCOPE_REF
13626 /* However, if we're about to form a pointer-to-member, we just
13627 want the referenced member referenced. */
13628 && TREE_CODE (expr
) != OFFSET_REF
)
13629 expr
= convert_from_reference (expr
);
13634 /* tsubst the initializer for a VAR_DECL. INIT is the unsubstituted
13635 initializer, DECL is the substituted VAR_DECL. Other arguments are as
13639 tsubst_init (tree init
, tree decl
, tree args
,
13640 tsubst_flags_t complain
, tree in_decl
)
13645 init
= tsubst_expr (init
, args
, complain
, in_decl
, false);
13649 /* If we had an initializer but it
13650 instantiated to nothing,
13651 value-initialize the object. This will
13652 only occur when the initializer was a
13653 pack expansion where the parameter packs
13654 used in that expansion were of length
13656 init
= build_value_init (TREE_TYPE (decl
),
13658 if (TREE_CODE (init
) == AGGR_INIT_EXPR
)
13659 init
= get_target_expr_sfinae (init
, complain
);
13665 /* Like tsubst, but deals with expressions. This function just replaces
13666 template parms; to finish processing the resultant expression, use
13667 tsubst_copy_and_build or tsubst_expr. */
13670 tsubst_copy (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
13672 enum tree_code code
;
13675 if (t
== NULL_TREE
|| t
== error_mark_node
|| args
== NULL_TREE
)
13678 code
= TREE_CODE (t
);
13683 r
= retrieve_local_specialization (t
);
13685 if (r
== NULL_TREE
)
13687 /* We get here for a use of 'this' in an NSDMI. */
13688 if (DECL_NAME (t
) == this_identifier
13689 && current_function_decl
13690 && DECL_CONSTRUCTOR_P (current_function_decl
))
13691 return current_class_ptr
;
13693 /* This can happen for a parameter name used later in a function
13694 declaration (such as in a late-specified return type). Just
13695 make a dummy decl, since it's only used for its type. */
13696 gcc_assert (cp_unevaluated_operand
!= 0);
13697 r
= tsubst_decl (t
, args
, complain
);
13698 /* Give it the template pattern as its context; its true context
13699 hasn't been instantiated yet and this is good enough for
13701 DECL_CONTEXT (r
) = DECL_CONTEXT (t
);
13704 if (TREE_CODE (r
) == ARGUMENT_PACK_SELECT
)
13705 r
= ARGUMENT_PACK_SELECT_ARG (r
);
13706 if (!mark_used (r
, complain
) && !(complain
& tf_error
))
13707 return error_mark_node
;
13715 if (DECL_TEMPLATE_PARM_P (t
))
13716 return tsubst_copy (DECL_INITIAL (t
), args
, complain
, in_decl
);
13717 /* There is no need to substitute into namespace-scope
13719 if (DECL_NAMESPACE_SCOPE_P (t
))
13721 /* If ARGS is NULL, then T is known to be non-dependent. */
13722 if (args
== NULL_TREE
)
13723 return scalar_constant_value (t
);
13725 /* Unfortunately, we cannot just call lookup_name here.
13728 template <int I> int f() {
13730 struct S { void g() { E e = a; } };
13733 When we instantiate f<7>::S::g(), say, lookup_name is not
13734 clever enough to find f<7>::a. */
13736 = tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
13737 /*entering_scope=*/0);
13739 for (v
= TYPE_VALUES (enum_type
);
13741 v
= TREE_CHAIN (v
))
13742 if (TREE_PURPOSE (v
) == DECL_NAME (t
))
13743 return TREE_VALUE (v
);
13745 /* We didn't find the name. That should never happen; if
13746 name-lookup found it during preliminary parsing, we
13747 should find it again here during instantiation. */
13748 gcc_unreachable ();
13753 if (PACK_EXPANSION_P (TREE_TYPE (t
)))
13755 /* Check for a local specialization set up by
13756 tsubst_pack_expansion. */
13757 if (tree r
= retrieve_local_specialization (t
))
13759 if (TREE_CODE (r
) == ARGUMENT_PACK_SELECT
)
13760 r
= ARGUMENT_PACK_SELECT_ARG (r
);
13764 /* When retrieving a capture pack from a generic lambda, remove the
13765 lambda call op's own template argument list from ARGS. Only the
13766 template arguments active for the closure type should be used to
13767 retrieve the pack specialization. */
13768 if (LAMBDA_FUNCTION_P (current_function_decl
)
13769 && (template_class_depth (DECL_CONTEXT (t
))
13770 != TMPL_ARGS_DEPTH (args
)))
13771 args
= strip_innermost_template_args (args
, 1);
13773 /* Otherwise return the full NONTYPE_ARGUMENT_PACK that
13774 tsubst_decl put in the hash table. */
13775 return retrieve_specialization (t
, args
, 0);
13778 if (DECL_CONTEXT (t
))
13782 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
13783 /*entering_scope=*/1);
13784 if (ctx
!= DECL_CONTEXT (t
))
13786 tree r
= lookup_field (ctx
, DECL_NAME (t
), 0, false);
13789 if (complain
& tf_error
)
13790 error ("using invalid field %qD", t
);
13791 return error_mark_node
;
13800 case FUNCTION_DECL
:
13801 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
))
13802 r
= tsubst (t
, args
, complain
, in_decl
);
13803 else if (local_variable_p (t
))
13805 r
= retrieve_local_specialization (t
);
13806 if (r
== NULL_TREE
)
13808 /* First try name lookup to find the instantiation. */
13809 r
= lookup_name (DECL_NAME (t
));
13812 /* Make sure that the one we found is the one we want. */
13813 tree ctx
= DECL_CONTEXT (t
);
13814 if (DECL_LANG_SPECIFIC (ctx
) && DECL_TEMPLATE_INFO (ctx
))
13815 ctx
= tsubst (ctx
, args
, complain
, in_decl
);
13816 if (ctx
!= DECL_CONTEXT (r
))
13824 /* This can happen for a variable used in a
13825 late-specified return type of a local lambda, or for a
13826 local static or constant. Building a new VAR_DECL
13827 should be OK in all those cases. */
13828 r
= tsubst_decl (t
, args
, complain
);
13829 if (decl_maybe_constant_var_p (r
))
13831 /* We can't call cp_finish_decl, so handle the
13832 initializer by hand. */
13833 tree init
= tsubst_init (DECL_INITIAL (t
), r
, args
,
13834 complain
, in_decl
);
13835 if (!processing_template_decl
)
13836 init
= maybe_constant_init (init
);
13837 if (processing_template_decl
13838 ? potential_constant_expression (init
)
13839 : reduced_constant_expression_p (init
))
13840 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r
)
13841 = TREE_CONSTANT (r
) = true;
13842 DECL_INITIAL (r
) = init
;
13844 gcc_assert (cp_unevaluated_operand
|| TREE_STATIC (r
)
13845 || decl_constant_var_p (r
)
13846 || errorcount
|| sorrycount
);
13847 if (!processing_template_decl
)
13849 if (TREE_STATIC (r
))
13850 rest_of_decl_compilation (r
, toplevel_bindings_p (),
13853 r
= process_outer_var_ref (r
, complain
);
13856 /* Remember this for subsequent uses. */
13857 if (local_specializations
)
13858 register_local_specialization (r
, t
);
13863 if (!mark_used (r
, complain
) && !(complain
& tf_error
))
13864 return error_mark_node
;
13867 case NAMESPACE_DECL
:
13871 /* An OVERLOAD will always be a non-dependent overload set; an
13872 overload set from function scope will just be represented with an
13873 IDENTIFIER_NODE, and from class scope with a BASELINK. */
13874 gcc_assert (!uses_template_parms (t
));
13878 return tsubst_baselink (t
, current_nonlambda_class_type (),
13879 args
, complain
, in_decl
);
13881 case TEMPLATE_DECL
:
13882 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
13883 return tsubst (TREE_TYPE (DECL_TEMPLATE_RESULT (t
)),
13884 args
, complain
, in_decl
);
13885 else if (DECL_FUNCTION_TEMPLATE_P (t
) && DECL_MEMBER_TEMPLATE_P (t
))
13886 return tsubst (t
, args
, complain
, in_decl
);
13887 else if (DECL_CLASS_SCOPE_P (t
)
13888 && uses_template_parms (DECL_CONTEXT (t
)))
13890 /* Template template argument like the following example need
13893 template <template <class> class TT> struct C {};
13894 template <class T> struct D {
13895 template <class U> struct E {};
13900 We are processing the template argument `E' in #1 for
13901 the template instantiation #2. Originally, `E' is a
13902 TEMPLATE_DECL with `D<T>' as its DECL_CONTEXT. Now we
13903 have to substitute this with one having context `D<int>'. */
13905 tree context
= tsubst (DECL_CONTEXT (t
), args
, complain
, in_decl
);
13906 return lookup_field (context
, DECL_NAME(t
), 0, false);
13909 /* Ordinary template template argument. */
13913 case REINTERPRET_CAST_EXPR
:
13914 case CONST_CAST_EXPR
:
13915 case STATIC_CAST_EXPR
:
13916 case DYNAMIC_CAST_EXPR
:
13917 case IMPLICIT_CONV_EXPR
:
13921 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13922 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13923 return build1 (code
, type
, op0
);
13927 if (PACK_EXPANSION_P (TREE_OPERAND (t
, 0)))
13930 tree expanded
, op
= TREE_OPERAND (t
, 0);
13933 if (SIZEOF_EXPR_TYPE_P (t
))
13934 op
= TREE_TYPE (op
);
13936 ++cp_unevaluated_operand
;
13937 ++c_inhibit_evaluation_warnings
;
13938 /* We only want to compute the number of arguments. */
13939 expanded
= tsubst_pack_expansion (op
, args
, complain
, in_decl
);
13940 --cp_unevaluated_operand
;
13941 --c_inhibit_evaluation_warnings
;
13943 if (TREE_CODE (expanded
) == TREE_VEC
)
13944 len
= TREE_VEC_LENGTH (expanded
);
13946 if (expanded
== error_mark_node
)
13947 return error_mark_node
;
13948 else if (PACK_EXPANSION_P (expanded
)
13949 || (TREE_CODE (expanded
) == TREE_VEC
13951 && PACK_EXPANSION_P (TREE_VEC_ELT (expanded
, len
-1))))
13953 if (TREE_CODE (expanded
) == TREE_VEC
)
13954 expanded
= TREE_VEC_ELT (expanded
, len
- 1);
13956 if (TYPE_P (expanded
))
13957 return cxx_sizeof_or_alignof_type (expanded
, SIZEOF_EXPR
,
13958 complain
& tf_error
);
13960 return cxx_sizeof_or_alignof_expr (expanded
, SIZEOF_EXPR
,
13961 complain
& tf_error
);
13964 return build_int_cst (size_type_node
, len
);
13966 if (SIZEOF_EXPR_TYPE_P (t
))
13968 r
= tsubst (TREE_TYPE (TREE_OPERAND (t
, 0)),
13969 args
, complain
, in_decl
);
13970 r
= build1 (NOP_EXPR
, r
, error_mark_node
);
13971 r
= build1 (SIZEOF_EXPR
,
13972 tsubst (TREE_TYPE (t
), args
, complain
, in_decl
), r
);
13973 SIZEOF_EXPR_TYPE_P (r
) = 1;
13980 case TRUTH_NOT_EXPR
:
13983 case UNARY_PLUS_EXPR
: /* Unary + */
13985 case AT_ENCODE_EXPR
:
13989 case REALPART_EXPR
:
13990 case IMAGPART_EXPR
:
13993 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13994 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13995 return build1 (code
, type
, op0
);
13998 case COMPONENT_REF
:
14003 object
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14004 name
= TREE_OPERAND (t
, 1);
14005 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
14007 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
14008 complain
, in_decl
);
14009 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
14011 else if (TREE_CODE (name
) == SCOPE_REF
14012 && TREE_CODE (TREE_OPERAND (name
, 1)) == BIT_NOT_EXPR
)
14014 tree base
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
14015 complain
, in_decl
);
14016 name
= TREE_OPERAND (name
, 1);
14017 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
14018 complain
, in_decl
);
14019 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
14020 name
= build_qualified_name (/*type=*/NULL_TREE
,
14022 /*template_p=*/false);
14024 else if (BASELINK_P (name
))
14025 name
= tsubst_baselink (name
,
14026 non_reference (TREE_TYPE (object
)),
14030 name
= tsubst_copy (name
, args
, complain
, in_decl
);
14031 return build_nt (COMPONENT_REF
, object
, name
, NULL_TREE
);
14037 case TRUNC_DIV_EXPR
:
14038 case CEIL_DIV_EXPR
:
14039 case FLOOR_DIV_EXPR
:
14040 case ROUND_DIV_EXPR
:
14041 case EXACT_DIV_EXPR
:
14045 case TRUNC_MOD_EXPR
:
14046 case FLOOR_MOD_EXPR
:
14047 case TRUTH_ANDIF_EXPR
:
14048 case TRUTH_ORIF_EXPR
:
14049 case TRUTH_AND_EXPR
:
14050 case TRUTH_OR_EXPR
:
14063 case COMPOUND_EXPR
:
14066 case PREDECREMENT_EXPR
:
14067 case PREINCREMENT_EXPR
:
14068 case POSTDECREMENT_EXPR
:
14069 case POSTINCREMENT_EXPR
:
14071 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14072 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14073 return build_nt (code
, op0
, op1
);
14078 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14079 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14080 return build_qualified_name (/*type=*/NULL_TREE
, op0
, op1
,
14081 QUALIFIED_NAME_IS_TEMPLATE (t
));
14086 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14087 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14088 return build_nt (ARRAY_REF
, op0
, op1
, NULL_TREE
, NULL_TREE
);
14093 int n
= VL_EXP_OPERAND_LENGTH (t
);
14094 tree result
= build_vl_exp (CALL_EXPR
, n
);
14096 for (i
= 0; i
< n
; i
++)
14097 TREE_OPERAND (t
, i
) = tsubst_copy (TREE_OPERAND (t
, i
), args
,
14098 complain
, in_decl
);
14104 case PSEUDO_DTOR_EXPR
:
14105 case VEC_PERM_EXPR
:
14107 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14108 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14109 tree op2
= tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
14110 r
= build_nt (code
, op0
, op1
, op2
);
14111 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
14117 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14118 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14119 tree op2
= tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
14120 r
= build_nt (code
, op0
, op1
, op2
);
14121 NEW_EXPR_USE_GLOBAL (r
) = NEW_EXPR_USE_GLOBAL (t
);
14127 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14128 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14129 r
= build_nt (code
, op0
, op1
);
14130 DELETE_EXPR_USE_GLOBAL (r
) = DELETE_EXPR_USE_GLOBAL (t
);
14131 DELETE_EXPR_USE_VEC (r
) = DELETE_EXPR_USE_VEC (t
);
14135 case TEMPLATE_ID_EXPR
:
14137 /* Substituted template arguments */
14138 tree fn
= TREE_OPERAND (t
, 0);
14139 tree targs
= TREE_OPERAND (t
, 1);
14141 fn
= tsubst_copy (fn
, args
, complain
, in_decl
);
14143 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
14145 return lookup_template_function (fn
, targs
);
14150 tree purpose
, value
, chain
;
14152 if (t
== void_list_node
)
14155 purpose
= TREE_PURPOSE (t
);
14157 purpose
= tsubst_copy (purpose
, args
, complain
, in_decl
);
14158 value
= TREE_VALUE (t
);
14160 value
= tsubst_copy (value
, args
, complain
, in_decl
);
14161 chain
= TREE_CHAIN (t
);
14162 if (chain
&& chain
!= void_type_node
)
14163 chain
= tsubst_copy (chain
, args
, complain
, in_decl
);
14164 if (purpose
== TREE_PURPOSE (t
)
14165 && value
== TREE_VALUE (t
)
14166 && chain
== TREE_CHAIN (t
))
14168 return tree_cons (purpose
, value
, chain
);
14173 case ENUMERAL_TYPE
:
14175 case TEMPLATE_TYPE_PARM
:
14176 case TEMPLATE_TEMPLATE_PARM
:
14177 case BOUND_TEMPLATE_TEMPLATE_PARM
:
14178 case TEMPLATE_PARM_INDEX
:
14180 case REFERENCE_TYPE
:
14182 case FUNCTION_TYPE
:
14185 case TYPENAME_TYPE
:
14186 case UNBOUND_CLASS_TEMPLATE
:
14188 case DECLTYPE_TYPE
:
14190 return tsubst (t
, args
, complain
, in_decl
);
14194 /* Fall through. */
14195 case IDENTIFIER_NODE
:
14196 if (IDENTIFIER_TYPENAME_P (t
))
14198 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14199 return mangle_conv_op_name_for_type (new_type
);
14205 /* This is handled by tsubst_copy_and_build. */
14206 gcc_unreachable ();
14210 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14211 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14212 return build_x_va_arg (EXPR_LOCATION (t
), op0
, type
);
14215 case CLEANUP_POINT_EXPR
:
14216 /* We shouldn't have built any of these during initial template
14217 generation. Instead, they should be built during instantiation
14218 in response to the saved STMT_IS_FULL_EXPR_P setting. */
14219 gcc_unreachable ();
14223 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14224 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14225 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14226 r
= build2 (code
, type
, op0
, op1
);
14227 PTRMEM_OK_P (r
) = PTRMEM_OK_P (t
);
14228 if (!mark_used (TREE_OPERAND (r
, 1), complain
)
14229 && !(complain
& tf_error
))
14230 return error_mark_node
;
14234 case EXPR_PACK_EXPANSION
:
14235 error ("invalid use of pack expansion expression");
14236 return error_mark_node
;
14238 case NONTYPE_ARGUMENT_PACK
:
14239 error ("use %<...%> to expand argument pack");
14240 return error_mark_node
;
14243 gcc_checking_assert (t
== void_node
&& VOID_TYPE_P (TREE_TYPE (t
)));
14251 /* Instantiate any typedefs in the type. */
14252 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14253 r
= fold_convert (type
, t
);
14254 gcc_assert (TREE_CODE (r
) == code
);
14259 /* These can sometimes show up in a partial instantiation, but never
14260 involve template parms. */
14261 gcc_assert (!uses_template_parms (t
));
14264 case UNARY_LEFT_FOLD_EXPR
:
14265 return tsubst_unary_left_fold (t
, args
, complain
, in_decl
);
14266 case UNARY_RIGHT_FOLD_EXPR
:
14267 return tsubst_unary_right_fold (t
, args
, complain
, in_decl
);
14268 case BINARY_LEFT_FOLD_EXPR
:
14269 return tsubst_binary_left_fold (t
, args
, complain
, in_decl
);
14270 case BINARY_RIGHT_FOLD_EXPR
:
14271 return tsubst_binary_right_fold (t
, args
, complain
, in_decl
);
14274 /* We shouldn't get here, but keep going if !flag_checking. */
14276 gcc_unreachable ();
14281 /* Helper function for tsubst_omp_clauses, used for instantiation of
14282 OMP_CLAUSE_DECL of clauses. */
14285 tsubst_omp_clause_decl (tree decl
, tree args
, tsubst_flags_t complain
,
14288 if (decl
== NULL_TREE
)
14291 /* Handle an OpenMP array section represented as a TREE_LIST (or
14292 OMP_CLAUSE_DEPEND_KIND). An OMP_CLAUSE_DEPEND (with a depend
14293 kind of OMP_CLAUSE_DEPEND_SINK) can also be represented as a
14294 TREE_LIST. We can handle it exactly the same as an array section
14295 (purpose, value, and a chain), even though the nomenclature
14296 (low_bound, length, etc) is different. */
14297 if (TREE_CODE (decl
) == TREE_LIST
)
14300 = tsubst_expr (TREE_PURPOSE (decl
), args
, complain
, in_decl
,
14301 /*integral_constant_expression_p=*/false);
14302 tree length
= tsubst_expr (TREE_VALUE (decl
), args
, complain
, in_decl
,
14303 /*integral_constant_expression_p=*/false);
14304 tree chain
= tsubst_omp_clause_decl (TREE_CHAIN (decl
), args
, complain
,
14306 if (TREE_PURPOSE (decl
) == low_bound
14307 && TREE_VALUE (decl
) == length
14308 && TREE_CHAIN (decl
) == chain
)
14310 tree ret
= tree_cons (low_bound
, length
, chain
);
14311 OMP_CLAUSE_DEPEND_SINK_NEGATIVE (ret
)
14312 = OMP_CLAUSE_DEPEND_SINK_NEGATIVE (decl
);
14315 tree ret
= tsubst_expr (decl
, args
, complain
, in_decl
,
14316 /*integral_constant_expression_p=*/false);
14317 /* Undo convert_from_reference tsubst_expr could have called. */
14319 && REFERENCE_REF_P (ret
)
14320 && !REFERENCE_REF_P (decl
))
14321 ret
= TREE_OPERAND (ret
, 0);
14325 /* Like tsubst_copy, but specifically for OpenMP clauses. */
14328 tsubst_omp_clauses (tree clauses
, bool declare_simd
, bool allow_fields
,
14329 tree args
, tsubst_flags_t complain
, tree in_decl
)
14331 tree new_clauses
= NULL_TREE
, nc
, oc
;
14332 tree linear_no_step
= NULL_TREE
;
14334 for (oc
= clauses
; oc
; oc
= OMP_CLAUSE_CHAIN (oc
))
14336 nc
= copy_node (oc
);
14337 OMP_CLAUSE_CHAIN (nc
) = new_clauses
;
14340 switch (OMP_CLAUSE_CODE (nc
))
14342 case OMP_CLAUSE_LASTPRIVATE
:
14343 if (OMP_CLAUSE_LASTPRIVATE_STMT (oc
))
14345 OMP_CLAUSE_LASTPRIVATE_STMT (nc
) = push_stmt_list ();
14346 tsubst_expr (OMP_CLAUSE_LASTPRIVATE_STMT (oc
), args
, complain
,
14347 in_decl
, /*integral_constant_expression_p=*/false);
14348 OMP_CLAUSE_LASTPRIVATE_STMT (nc
)
14349 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (nc
));
14352 case OMP_CLAUSE_PRIVATE
:
14353 case OMP_CLAUSE_SHARED
:
14354 case OMP_CLAUSE_FIRSTPRIVATE
:
14355 case OMP_CLAUSE_COPYIN
:
14356 case OMP_CLAUSE_COPYPRIVATE
:
14357 case OMP_CLAUSE_UNIFORM
:
14358 case OMP_CLAUSE_DEPEND
:
14359 case OMP_CLAUSE_FROM
:
14360 case OMP_CLAUSE_TO
:
14361 case OMP_CLAUSE_MAP
:
14362 case OMP_CLAUSE_USE_DEVICE_PTR
:
14363 case OMP_CLAUSE_IS_DEVICE_PTR
:
14364 OMP_CLAUSE_DECL (nc
)
14365 = tsubst_omp_clause_decl (OMP_CLAUSE_DECL (oc
), args
, complain
,
14368 case OMP_CLAUSE_IF
:
14369 case OMP_CLAUSE_NUM_THREADS
:
14370 case OMP_CLAUSE_SCHEDULE
:
14371 case OMP_CLAUSE_COLLAPSE
:
14372 case OMP_CLAUSE_FINAL
:
14373 case OMP_CLAUSE_DEVICE
:
14374 case OMP_CLAUSE_DIST_SCHEDULE
:
14375 case OMP_CLAUSE_NUM_TEAMS
:
14376 case OMP_CLAUSE_THREAD_LIMIT
:
14377 case OMP_CLAUSE_SAFELEN
:
14378 case OMP_CLAUSE_SIMDLEN
:
14379 case OMP_CLAUSE_NUM_TASKS
:
14380 case OMP_CLAUSE_GRAINSIZE
:
14381 case OMP_CLAUSE_PRIORITY
:
14382 case OMP_CLAUSE_ORDERED
:
14383 case OMP_CLAUSE_HINT
:
14384 case OMP_CLAUSE_NUM_GANGS
:
14385 case OMP_CLAUSE_NUM_WORKERS
:
14386 case OMP_CLAUSE_VECTOR_LENGTH
:
14387 case OMP_CLAUSE_WORKER
:
14388 case OMP_CLAUSE_VECTOR
:
14389 case OMP_CLAUSE_ASYNC
:
14390 case OMP_CLAUSE_WAIT
:
14391 OMP_CLAUSE_OPERAND (nc
, 0)
14392 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 0), args
, complain
,
14393 in_decl
, /*integral_constant_expression_p=*/false);
14395 case OMP_CLAUSE_REDUCTION
:
14396 if (OMP_CLAUSE_REDUCTION_PLACEHOLDER (oc
))
14398 tree placeholder
= OMP_CLAUSE_REDUCTION_PLACEHOLDER (oc
);
14399 if (TREE_CODE (placeholder
) == SCOPE_REF
)
14401 tree scope
= tsubst (TREE_OPERAND (placeholder
, 0), args
,
14402 complain
, in_decl
);
14403 OMP_CLAUSE_REDUCTION_PLACEHOLDER (nc
)
14404 = build_qualified_name (NULL_TREE
, scope
,
14405 TREE_OPERAND (placeholder
, 1),
14409 gcc_assert (identifier_p (placeholder
));
14411 OMP_CLAUSE_DECL (nc
)
14412 = tsubst_omp_clause_decl (OMP_CLAUSE_DECL (oc
), args
, complain
,
14415 case OMP_CLAUSE_GANG
:
14416 case OMP_CLAUSE_ALIGNED
:
14417 OMP_CLAUSE_DECL (nc
)
14418 = tsubst_omp_clause_decl (OMP_CLAUSE_DECL (oc
), args
, complain
,
14420 OMP_CLAUSE_OPERAND (nc
, 1)
14421 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 1), args
, complain
,
14422 in_decl
, /*integral_constant_expression_p=*/false);
14424 case OMP_CLAUSE_LINEAR
:
14425 OMP_CLAUSE_DECL (nc
)
14426 = tsubst_omp_clause_decl (OMP_CLAUSE_DECL (oc
), args
, complain
,
14428 if (OMP_CLAUSE_LINEAR_STEP (oc
) == NULL_TREE
)
14430 gcc_assert (!linear_no_step
);
14431 linear_no_step
= nc
;
14433 else if (OMP_CLAUSE_LINEAR_VARIABLE_STRIDE (oc
))
14434 OMP_CLAUSE_LINEAR_STEP (nc
)
14435 = tsubst_omp_clause_decl (OMP_CLAUSE_LINEAR_STEP (oc
), args
,
14436 complain
, in_decl
);
14438 OMP_CLAUSE_LINEAR_STEP (nc
)
14439 = tsubst_expr (OMP_CLAUSE_LINEAR_STEP (oc
), args
, complain
,
14441 /*integral_constant_expression_p=*/false);
14443 case OMP_CLAUSE_NOWAIT
:
14444 case OMP_CLAUSE_DEFAULT
:
14445 case OMP_CLAUSE_UNTIED
:
14446 case OMP_CLAUSE_MERGEABLE
:
14447 case OMP_CLAUSE_INBRANCH
:
14448 case OMP_CLAUSE_NOTINBRANCH
:
14449 case OMP_CLAUSE_PROC_BIND
:
14450 case OMP_CLAUSE_FOR
:
14451 case OMP_CLAUSE_PARALLEL
:
14452 case OMP_CLAUSE_SECTIONS
:
14453 case OMP_CLAUSE_TASKGROUP
:
14454 case OMP_CLAUSE_NOGROUP
:
14455 case OMP_CLAUSE_THREADS
:
14456 case OMP_CLAUSE_SIMD
:
14457 case OMP_CLAUSE_DEFAULTMAP
:
14458 case OMP_CLAUSE_INDEPENDENT
:
14459 case OMP_CLAUSE_AUTO
:
14460 case OMP_CLAUSE_SEQ
:
14462 case OMP_CLAUSE_TILE
:
14465 for (lnc
= OMP_CLAUSE_TILE_LIST (nc
),
14466 loc
= OMP_CLAUSE_TILE_LIST (oc
);
14468 loc
= TREE_CHAIN (loc
), lnc
= TREE_CHAIN (lnc
))
14470 TREE_VALUE (lnc
) = tsubst_expr (TREE_VALUE (loc
), args
,
14471 complain
, in_decl
, false);
14476 gcc_unreachable ();
14479 switch (OMP_CLAUSE_CODE (nc
))
14481 case OMP_CLAUSE_SHARED
:
14482 case OMP_CLAUSE_PRIVATE
:
14483 case OMP_CLAUSE_FIRSTPRIVATE
:
14484 case OMP_CLAUSE_LASTPRIVATE
:
14485 case OMP_CLAUSE_COPYPRIVATE
:
14486 case OMP_CLAUSE_LINEAR
:
14487 case OMP_CLAUSE_REDUCTION
:
14488 case OMP_CLAUSE_USE_DEVICE_PTR
:
14489 case OMP_CLAUSE_IS_DEVICE_PTR
:
14490 /* tsubst_expr on SCOPE_REF results in returning
14491 finish_non_static_data_member result. Undo that here. */
14492 if (TREE_CODE (OMP_CLAUSE_DECL (oc
)) == SCOPE_REF
14493 && (TREE_CODE (TREE_OPERAND (OMP_CLAUSE_DECL (oc
), 1))
14494 == IDENTIFIER_NODE
))
14496 tree t
= OMP_CLAUSE_DECL (nc
);
14499 switch (TREE_CODE (v
))
14501 case COMPONENT_REF
:
14505 case POINTER_PLUS_EXPR
:
14506 v
= TREE_OPERAND (v
, 0);
14509 if (DECL_CONTEXT (v
) == current_function_decl
14510 && DECL_ARTIFICIAL (v
)
14511 && DECL_NAME (v
) == this_identifier
)
14512 OMP_CLAUSE_DECL (nc
) = TREE_OPERAND (t
, 1);
14519 else if (VAR_P (OMP_CLAUSE_DECL (oc
))
14520 && DECL_HAS_VALUE_EXPR_P (OMP_CLAUSE_DECL (oc
))
14521 && DECL_ARTIFICIAL (OMP_CLAUSE_DECL (oc
))
14522 && DECL_LANG_SPECIFIC (OMP_CLAUSE_DECL (oc
))
14523 && DECL_OMP_PRIVATIZED_MEMBER (OMP_CLAUSE_DECL (oc
)))
14525 tree decl
= OMP_CLAUSE_DECL (nc
);
14528 if (!DECL_LANG_SPECIFIC (decl
))
14529 retrofit_lang_decl (decl
);
14530 DECL_OMP_PRIVATIZED_MEMBER (decl
) = 1;
14539 new_clauses
= nreverse (new_clauses
);
14542 new_clauses
= finish_omp_clauses (new_clauses
, allow_fields
);
14543 if (linear_no_step
)
14544 for (nc
= new_clauses
; nc
; nc
= OMP_CLAUSE_CHAIN (nc
))
14545 if (nc
== linear_no_step
)
14547 OMP_CLAUSE_LINEAR_STEP (nc
) = NULL_TREE
;
14551 return new_clauses
;
14554 /* Like tsubst_copy_and_build, but unshare TREE_LIST nodes. */
14557 tsubst_copy_asm_operands (tree t
, tree args
, tsubst_flags_t complain
,
14560 #define RECUR(t) tsubst_copy_asm_operands (t, args, complain, in_decl)
14562 tree purpose
, value
, chain
;
14567 if (TREE_CODE (t
) != TREE_LIST
)
14568 return tsubst_copy_and_build (t
, args
, complain
, in_decl
,
14569 /*function_p=*/false,
14570 /*integral_constant_expression_p=*/false);
14572 if (t
== void_list_node
)
14575 purpose
= TREE_PURPOSE (t
);
14577 purpose
= RECUR (purpose
);
14578 value
= TREE_VALUE (t
);
14581 if (TREE_CODE (value
) != LABEL_DECL
)
14582 value
= RECUR (value
);
14585 value
= lookup_label (DECL_NAME (value
));
14586 gcc_assert (TREE_CODE (value
) == LABEL_DECL
);
14587 TREE_USED (value
) = 1;
14590 chain
= TREE_CHAIN (t
);
14591 if (chain
&& chain
!= void_type_node
)
14592 chain
= RECUR (chain
);
14593 return tree_cons (purpose
, value
, chain
);
14597 /* Used to temporarily communicate the list of #pragma omp parallel
14598 clauses to #pragma omp for instantiation if they are combined
14601 static tree
*omp_parallel_combined_clauses
;
14603 /* Substitute one OMP_FOR iterator. */
14606 tsubst_omp_for_iterator (tree t
, int i
, tree declv
, tree orig_declv
,
14607 tree initv
, tree condv
, tree incrv
, tree
*clauses
,
14608 tree args
, tsubst_flags_t complain
, tree in_decl
,
14609 bool integral_constant_expression_p
)
14611 #define RECUR(NODE) \
14612 tsubst_expr ((NODE), args, complain, in_decl, \
14613 integral_constant_expression_p)
14614 tree decl
, init
, cond
, incr
;
14616 init
= TREE_VEC_ELT (OMP_FOR_INIT (t
), i
);
14617 gcc_assert (TREE_CODE (init
) == MODIFY_EXPR
);
14619 if (orig_declv
&& OMP_FOR_ORIG_DECLS (t
))
14621 tree o
= TREE_VEC_ELT (OMP_FOR_ORIG_DECLS (t
), i
);
14622 TREE_VEC_ELT (orig_declv
, i
) = RECUR (o
);
14625 decl
= TREE_OPERAND (init
, 0);
14626 init
= TREE_OPERAND (init
, 1);
14627 tree decl_expr
= NULL_TREE
;
14628 if (init
&& TREE_CODE (init
) == DECL_EXPR
)
14630 /* We need to jump through some hoops to handle declarations in the
14631 for-init-statement, since we might need to handle auto deduction,
14632 but we need to keep control of initialization. */
14634 init
= DECL_INITIAL (DECL_EXPR_DECL (init
));
14635 decl
= tsubst_decl (decl
, args
, complain
);
14639 if (TREE_CODE (decl
) == SCOPE_REF
)
14641 decl
= RECUR (decl
);
14642 if (TREE_CODE (decl
) == COMPONENT_REF
)
14646 switch (TREE_CODE (v
))
14648 case COMPONENT_REF
:
14652 case POINTER_PLUS_EXPR
:
14653 v
= TREE_OPERAND (v
, 0);
14656 if (DECL_CONTEXT (v
) == current_function_decl
14657 && DECL_ARTIFICIAL (v
)
14658 && DECL_NAME (v
) == this_identifier
)
14660 decl
= TREE_OPERAND (decl
, 1);
14661 decl
= omp_privatize_field (decl
, false);
14671 decl
= RECUR (decl
);
14673 init
= RECUR (init
);
14675 tree auto_node
= type_uses_auto (TREE_TYPE (decl
));
14676 if (auto_node
&& init
)
14678 = do_auto_deduction (TREE_TYPE (decl
), init
, auto_node
);
14680 gcc_assert (!type_dependent_expression_p (decl
));
14682 if (!CLASS_TYPE_P (TREE_TYPE (decl
)))
14686 /* Declare the variable, but don't let that initialize it. */
14687 tree init_sav
= DECL_INITIAL (DECL_EXPR_DECL (decl_expr
));
14688 DECL_INITIAL (DECL_EXPR_DECL (decl_expr
)) = NULL_TREE
;
14690 DECL_INITIAL (DECL_EXPR_DECL (decl_expr
)) = init_sav
;
14693 cond
= RECUR (TREE_VEC_ELT (OMP_FOR_COND (t
), i
));
14694 incr
= TREE_VEC_ELT (OMP_FOR_INCR (t
), i
);
14695 if (TREE_CODE (incr
) == MODIFY_EXPR
)
14697 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
14698 tree rhs
= RECUR (TREE_OPERAND (incr
, 1));
14699 incr
= build_x_modify_expr (EXPR_LOCATION (incr
), lhs
,
14700 NOP_EXPR
, rhs
, complain
);
14703 incr
= RECUR (incr
);
14704 TREE_VEC_ELT (declv
, i
) = decl
;
14705 TREE_VEC_ELT (initv
, i
) = init
;
14706 TREE_VEC_ELT (condv
, i
) = cond
;
14707 TREE_VEC_ELT (incrv
, i
) = incr
;
14713 /* Declare and initialize the variable. */
14721 for (j
= (omp_parallel_combined_clauses
== NULL
? 1 : 0); j
< 2; j
++)
14723 for (pc
= j
? clauses
: omp_parallel_combined_clauses
; *pc
; )
14725 if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_PRIVATE
14726 && OMP_CLAUSE_DECL (*pc
) == decl
)
14728 else if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_LASTPRIVATE
14729 && OMP_CLAUSE_DECL (*pc
) == decl
)
14733 /* Move lastprivate (decl) clause to OMP_FOR_CLAUSES. */
14735 *pc
= OMP_CLAUSE_CHAIN (c
);
14736 OMP_CLAUSE_CHAIN (c
) = *clauses
;
14739 else if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_FIRSTPRIVATE
14740 && OMP_CLAUSE_DECL (*pc
) == decl
)
14742 error ("iteration variable %qD should not be firstprivate",
14744 *pc
= OMP_CLAUSE_CHAIN (*pc
);
14746 else if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_REDUCTION
14747 && OMP_CLAUSE_DECL (*pc
) == decl
)
14749 error ("iteration variable %qD should not be reduction",
14751 *pc
= OMP_CLAUSE_CHAIN (*pc
);
14754 pc
= &OMP_CLAUSE_CHAIN (*pc
);
14759 if (*pc
== NULL_TREE
)
14761 tree c
= build_omp_clause (input_location
, OMP_CLAUSE_PRIVATE
);
14762 OMP_CLAUSE_DECL (c
) = decl
;
14763 c
= finish_omp_clauses (c
, true);
14766 OMP_CLAUSE_CHAIN (c
) = *clauses
;
14771 cond
= TREE_VEC_ELT (OMP_FOR_COND (t
), i
);
14772 if (COMPARISON_CLASS_P (cond
))
14774 tree op0
= RECUR (TREE_OPERAND (cond
, 0));
14775 tree op1
= RECUR (TREE_OPERAND (cond
, 1));
14776 cond
= build2 (TREE_CODE (cond
), boolean_type_node
, op0
, op1
);
14779 cond
= RECUR (cond
);
14780 incr
= TREE_VEC_ELT (OMP_FOR_INCR (t
), i
);
14781 switch (TREE_CODE (incr
))
14783 case PREINCREMENT_EXPR
:
14784 case PREDECREMENT_EXPR
:
14785 case POSTINCREMENT_EXPR
:
14786 case POSTDECREMENT_EXPR
:
14787 incr
= build2 (TREE_CODE (incr
), TREE_TYPE (decl
),
14788 RECUR (TREE_OPERAND (incr
, 0)), NULL_TREE
);
14791 if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
14792 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
14794 tree rhs
= TREE_OPERAND (incr
, 1);
14795 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
14796 tree rhs0
= RECUR (TREE_OPERAND (rhs
, 0));
14797 tree rhs1
= RECUR (TREE_OPERAND (rhs
, 1));
14798 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
14799 build2 (TREE_CODE (rhs
), TREE_TYPE (decl
),
14803 incr
= RECUR (incr
);
14806 if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
14807 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
14809 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
14810 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
14811 build2 (TREE_CODE (TREE_OPERAND (incr
, 1)),
14812 TREE_TYPE (decl
), lhs
,
14813 RECUR (TREE_OPERAND (incr
, 2))));
14815 else if (TREE_CODE (TREE_OPERAND (incr
, 1)) == NOP_EXPR
14816 && (TREE_CODE (TREE_OPERAND (incr
, 2)) == PLUS_EXPR
14817 || (TREE_CODE (TREE_OPERAND (incr
, 2)) == MINUS_EXPR
)))
14819 tree rhs
= TREE_OPERAND (incr
, 2);
14820 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
14821 tree rhs0
= RECUR (TREE_OPERAND (rhs
, 0));
14822 tree rhs1
= RECUR (TREE_OPERAND (rhs
, 1));
14823 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
14824 build2 (TREE_CODE (rhs
), TREE_TYPE (decl
),
14828 incr
= RECUR (incr
);
14831 incr
= RECUR (incr
);
14835 TREE_VEC_ELT (declv
, i
) = decl
;
14836 TREE_VEC_ELT (initv
, i
) = init
;
14837 TREE_VEC_ELT (condv
, i
) = cond
;
14838 TREE_VEC_ELT (incrv
, i
) = incr
;
14842 /* Helper function of tsubst_expr, find OMP_TEAMS inside
14843 of OMP_TARGET's body. */
14846 tsubst_find_omp_teams (tree
*tp
, int *walk_subtrees
, void *)
14848 *walk_subtrees
= 0;
14849 switch (TREE_CODE (*tp
))
14854 case STATEMENT_LIST
:
14855 *walk_subtrees
= 1;
14863 /* Like tsubst_copy for expressions, etc. but also does semantic
14867 tsubst_expr (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
,
14868 bool integral_constant_expression_p
)
14870 #define RETURN(EXP) do { r = (EXP); goto out; } while(0)
14871 #define RECUR(NODE) \
14872 tsubst_expr ((NODE), args, complain, in_decl, \
14873 integral_constant_expression_p)
14879 if (t
== NULL_TREE
|| t
== error_mark_node
)
14882 loc
= input_location
;
14883 if (EXPR_HAS_LOCATION (t
))
14884 input_location
= EXPR_LOCATION (t
);
14885 if (STATEMENT_CODE_P (TREE_CODE (t
)))
14886 current_stmt_tree ()->stmts_are_full_exprs_p
= STMT_IS_FULL_EXPR_P (t
);
14888 switch (TREE_CODE (t
))
14890 case STATEMENT_LIST
:
14892 tree_stmt_iterator i
;
14893 for (i
= tsi_start (t
); !tsi_end_p (i
); tsi_next (&i
))
14894 RECUR (tsi_stmt (i
));
14898 case CTOR_INITIALIZER
:
14899 finish_mem_initializers (tsubst_initializer_list
14900 (TREE_OPERAND (t
, 0), args
));
14904 finish_return_stmt (RECUR (TREE_OPERAND (t
, 0)));
14908 tmp
= RECUR (EXPR_STMT_EXPR (t
));
14909 if (EXPR_STMT_STMT_EXPR_RESULT (t
))
14910 finish_stmt_expr_expr (tmp
, cur_stmt_expr
);
14912 finish_expr_stmt (tmp
);
14916 do_using_directive (USING_STMT_NAMESPACE (t
));
14921 tree decl
, pattern_decl
;
14924 pattern_decl
= decl
= DECL_EXPR_DECL (t
);
14925 if (TREE_CODE (decl
) == LABEL_DECL
)
14926 finish_label_decl (DECL_NAME (decl
));
14927 else if (TREE_CODE (decl
) == USING_DECL
)
14929 tree scope
= USING_DECL_SCOPE (decl
);
14930 tree name
= DECL_NAME (decl
);
14933 scope
= tsubst (scope
, args
, complain
, in_decl
);
14934 decl
= lookup_qualified_name (scope
, name
,
14935 /*is_type_p=*/false,
14936 /*complain=*/false);
14937 if (decl
== error_mark_node
|| TREE_CODE (decl
) == TREE_LIST
)
14938 qualified_name_lookup_error (scope
, name
, decl
, input_location
);
14940 do_local_using_decl (decl
, scope
, name
);
14942 else if (DECL_PACK_P (decl
))
14944 /* Don't build up decls for a variadic capture proxy, we'll
14945 instantiate the elements directly as needed. */
14950 init
= DECL_INITIAL (decl
);
14951 decl
= tsubst (decl
, args
, complain
, in_decl
);
14952 if (decl
!= error_mark_node
)
14954 /* By marking the declaration as instantiated, we avoid
14955 trying to instantiate it. Since instantiate_decl can't
14956 handle local variables, and since we've already done
14957 all that needs to be done, that's the right thing to
14960 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
14962 && ANON_AGGR_TYPE_P (TREE_TYPE (decl
)))
14963 /* Anonymous aggregates are a special case. */
14964 finish_anon_union (decl
);
14965 else if (is_capture_proxy (DECL_EXPR_DECL (t
)))
14967 DECL_CONTEXT (decl
) = current_function_decl
;
14968 if (DECL_NAME (decl
) == this_identifier
)
14970 tree lam
= DECL_CONTEXT (current_function_decl
);
14971 lam
= CLASSTYPE_LAMBDA_EXPR (lam
);
14972 LAMBDA_EXPR_THIS_CAPTURE (lam
) = decl
;
14974 insert_capture_proxy (decl
);
14976 else if (DECL_IMPLICIT_TYPEDEF_P (t
))
14977 /* We already did a pushtag. */;
14978 else if (TREE_CODE (decl
) == FUNCTION_DECL
14979 && DECL_OMP_DECLARE_REDUCTION_P (decl
)
14980 && DECL_FUNCTION_SCOPE_P (pattern_decl
))
14982 DECL_CONTEXT (decl
) = NULL_TREE
;
14984 DECL_CONTEXT (decl
) = current_function_decl
;
14985 cp_check_omp_declare_reduction (decl
);
14989 int const_init
= false;
14990 maybe_push_decl (decl
);
14992 && DECL_PRETTY_FUNCTION_P (decl
))
14994 /* For __PRETTY_FUNCTION__ we have to adjust the
14996 const char *const name
14997 = cxx_printable_name (current_function_decl
, 2);
14998 init
= cp_fname_init (name
, &TREE_TYPE (decl
));
15001 init
= tsubst_init (init
, decl
, args
, complain
, in_decl
);
15004 const_init
= (DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P
15006 cp_finish_decl (decl
, init
, const_init
, NULL_TREE
, 0);
15015 stmt
= begin_for_stmt (NULL_TREE
, NULL_TREE
);
15016 RECUR (FOR_INIT_STMT (t
));
15017 finish_for_init_stmt (stmt
);
15018 tmp
= RECUR (FOR_COND (t
));
15019 finish_for_cond (tmp
, stmt
, false);
15020 tmp
= RECUR (FOR_EXPR (t
));
15021 finish_for_expr (tmp
, stmt
);
15022 RECUR (FOR_BODY (t
));
15023 finish_for_stmt (stmt
);
15026 case RANGE_FOR_STMT
:
15029 stmt
= begin_for_stmt (NULL_TREE
, NULL_TREE
);
15030 decl
= RANGE_FOR_DECL (t
);
15031 decl
= tsubst (decl
, args
, complain
, in_decl
);
15032 maybe_push_decl (decl
);
15033 expr
= RECUR (RANGE_FOR_EXPR (t
));
15034 stmt
= cp_convert_range_for (stmt
, decl
, expr
, RANGE_FOR_IVDEP (t
));
15035 RECUR (RANGE_FOR_BODY (t
));
15036 finish_for_stmt (stmt
);
15041 stmt
= begin_while_stmt ();
15042 tmp
= RECUR (WHILE_COND (t
));
15043 finish_while_stmt_cond (tmp
, stmt
, false);
15044 RECUR (WHILE_BODY (t
));
15045 finish_while_stmt (stmt
);
15049 stmt
= begin_do_stmt ();
15050 RECUR (DO_BODY (t
));
15051 finish_do_body (stmt
);
15052 tmp
= RECUR (DO_COND (t
));
15053 finish_do_stmt (tmp
, stmt
, false);
15057 stmt
= begin_if_stmt ();
15058 tmp
= RECUR (IF_COND (t
));
15059 finish_if_stmt_cond (tmp
, stmt
);
15060 RECUR (THEN_CLAUSE (t
));
15061 finish_then_clause (stmt
);
15063 if (ELSE_CLAUSE (t
))
15065 begin_else_clause (stmt
);
15066 RECUR (ELSE_CLAUSE (t
));
15067 finish_else_clause (stmt
);
15070 finish_if_stmt (stmt
);
15074 if (BIND_EXPR_BODY_BLOCK (t
))
15075 stmt
= begin_function_body ();
15077 stmt
= begin_compound_stmt (BIND_EXPR_TRY_BLOCK (t
)
15078 ? BCS_TRY_BLOCK
: 0);
15080 RECUR (BIND_EXPR_BODY (t
));
15082 if (BIND_EXPR_BODY_BLOCK (t
))
15083 finish_function_body (stmt
);
15085 finish_compound_stmt (stmt
);
15089 finish_break_stmt ();
15092 case CONTINUE_STMT
:
15093 finish_continue_stmt ();
15097 stmt
= begin_switch_stmt ();
15098 tmp
= RECUR (SWITCH_STMT_COND (t
));
15099 finish_switch_cond (tmp
, stmt
);
15100 RECUR (SWITCH_STMT_BODY (t
));
15101 finish_switch_stmt (stmt
);
15104 case CASE_LABEL_EXPR
:
15106 tree low
= RECUR (CASE_LOW (t
));
15107 tree high
= RECUR (CASE_HIGH (t
));
15108 finish_case_label (EXPR_LOCATION (t
), low
, high
);
15114 tree decl
= LABEL_EXPR_LABEL (t
);
15117 label
= finish_label_stmt (DECL_NAME (decl
));
15118 if (DECL_ATTRIBUTES (decl
) != NULL_TREE
)
15119 cplus_decl_attributes (&label
, DECL_ATTRIBUTES (decl
), 0);
15124 tmp
= GOTO_DESTINATION (t
);
15125 if (TREE_CODE (tmp
) != LABEL_DECL
)
15126 /* Computed goto's must be tsubst'd into. On the other hand,
15127 non-computed gotos must not be; the identifier in question
15128 will have no binding. */
15131 tmp
= DECL_NAME (tmp
);
15132 finish_goto_stmt (tmp
);
15137 tree string
= RECUR (ASM_STRING (t
));
15138 tree outputs
= tsubst_copy_asm_operands (ASM_OUTPUTS (t
), args
,
15139 complain
, in_decl
);
15140 tree inputs
= tsubst_copy_asm_operands (ASM_INPUTS (t
), args
,
15141 complain
, in_decl
);
15142 tree clobbers
= tsubst_copy_asm_operands (ASM_CLOBBERS (t
), args
,
15143 complain
, in_decl
);
15144 tree labels
= tsubst_copy_asm_operands (ASM_LABELS (t
), args
,
15145 complain
, in_decl
);
15146 tmp
= finish_asm_stmt (ASM_VOLATILE_P (t
), string
, outputs
, inputs
,
15148 tree asm_expr
= tmp
;
15149 if (TREE_CODE (asm_expr
) == CLEANUP_POINT_EXPR
)
15150 asm_expr
= TREE_OPERAND (asm_expr
, 0);
15151 ASM_INPUT_P (asm_expr
) = ASM_INPUT_P (t
);
15158 stmt
= begin_try_block ();
15159 RECUR (TRY_STMTS (t
));
15160 finish_cleanup_try_block (stmt
);
15161 finish_cleanup (RECUR (TRY_HANDLERS (t
)), stmt
);
15165 tree compound_stmt
= NULL_TREE
;
15167 if (FN_TRY_BLOCK_P (t
))
15168 stmt
= begin_function_try_block (&compound_stmt
);
15170 stmt
= begin_try_block ();
15172 RECUR (TRY_STMTS (t
));
15174 if (FN_TRY_BLOCK_P (t
))
15175 finish_function_try_block (stmt
);
15177 finish_try_block (stmt
);
15179 RECUR (TRY_HANDLERS (t
));
15180 if (FN_TRY_BLOCK_P (t
))
15181 finish_function_handler_sequence (stmt
, compound_stmt
);
15183 finish_handler_sequence (stmt
);
15189 tree decl
= HANDLER_PARMS (t
);
15193 decl
= tsubst (decl
, args
, complain
, in_decl
);
15194 /* Prevent instantiate_decl from trying to instantiate
15195 this variable. We've already done all that needs to be
15197 if (decl
!= error_mark_node
)
15198 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
15200 stmt
= begin_handler ();
15201 finish_handler_parms (decl
, stmt
);
15202 RECUR (HANDLER_BODY (t
));
15203 finish_handler (stmt
);
15208 tmp
= tsubst (TREE_TYPE (t
), args
, complain
, NULL_TREE
);
15209 if (CLASS_TYPE_P (tmp
))
15211 /* Local classes are not independent templates; they are
15212 instantiated along with their containing function. And this
15213 way we don't have to deal with pushing out of one local class
15214 to instantiate a member of another local class. */
15216 /* Closures are handled by the LAMBDA_EXPR. */
15217 gcc_assert (!LAMBDA_TYPE_P (TREE_TYPE (t
)));
15218 complete_type (tmp
);
15219 for (fn
= TYPE_METHODS (tmp
); fn
; fn
= DECL_CHAIN (fn
))
15220 if (!DECL_ARTIFICIAL (fn
))
15221 instantiate_decl (fn
, /*defer_ok*/0, /*expl_inst_class*/false);
15225 case STATIC_ASSERT
:
15229 ++c_inhibit_evaluation_warnings
;
15231 tsubst_expr (STATIC_ASSERT_CONDITION (t
),
15234 /*integral_constant_expression_p=*/true);
15235 --c_inhibit_evaluation_warnings
;
15237 finish_static_assert (condition
,
15238 STATIC_ASSERT_MESSAGE (t
),
15239 STATIC_ASSERT_SOURCE_LOCATION (t
),
15240 /*member_p=*/false);
15245 case OACC_PARALLEL
:
15246 tmp
= tsubst_omp_clauses (OMP_CLAUSES (t
), false, false, args
, complain
,
15248 stmt
= begin_omp_parallel ();
15249 RECUR (OMP_BODY (t
));
15250 finish_omp_construct (TREE_CODE (t
), stmt
, tmp
);
15254 r
= push_omp_privatization_clauses (OMP_PARALLEL_COMBINED (t
));
15255 tmp
= tsubst_omp_clauses (OMP_PARALLEL_CLAUSES (t
), false, true,
15256 args
, complain
, in_decl
);
15257 if (OMP_PARALLEL_COMBINED (t
))
15258 omp_parallel_combined_clauses
= &tmp
;
15259 stmt
= begin_omp_parallel ();
15260 RECUR (OMP_PARALLEL_BODY (t
));
15261 gcc_assert (omp_parallel_combined_clauses
== NULL
);
15262 OMP_PARALLEL_COMBINED (finish_omp_parallel (tmp
, stmt
))
15263 = OMP_PARALLEL_COMBINED (t
);
15264 pop_omp_privatization_clauses (r
);
15268 r
= push_omp_privatization_clauses (false);
15269 tmp
= tsubst_omp_clauses (OMP_TASK_CLAUSES (t
), false, true,
15270 args
, complain
, in_decl
);
15271 stmt
= begin_omp_task ();
15272 RECUR (OMP_TASK_BODY (t
));
15273 finish_omp_task (tmp
, stmt
);
15274 pop_omp_privatization_clauses (r
);
15281 case OMP_DISTRIBUTE
:
15285 tree clauses
, body
, pre_body
;
15286 tree declv
= NULL_TREE
, initv
= NULL_TREE
, condv
= NULL_TREE
;
15287 tree orig_declv
= NULL_TREE
;
15288 tree incrv
= NULL_TREE
;
15291 r
= push_omp_privatization_clauses (OMP_FOR_INIT (t
) == NULL_TREE
);
15292 clauses
= tsubst_omp_clauses (OMP_FOR_CLAUSES (t
), false,
15293 TREE_CODE (t
) != OACC_LOOP
,
15294 args
, complain
, in_decl
);
15295 if (OMP_FOR_INIT (t
) != NULL_TREE
)
15297 declv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
15298 if (OMP_FOR_ORIG_DECLS (t
))
15299 orig_declv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
15300 initv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
15301 condv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
15302 incrv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
15305 stmt
= begin_omp_structured_block ();
15307 pre_body
= push_stmt_list ();
15308 RECUR (OMP_FOR_PRE_BODY (t
));
15309 pre_body
= pop_stmt_list (pre_body
);
15311 if (OMP_FOR_INIT (t
) != NULL_TREE
)
15312 for (i
= 0; i
< TREE_VEC_LENGTH (OMP_FOR_INIT (t
)); i
++)
15313 tsubst_omp_for_iterator (t
, i
, declv
, orig_declv
, initv
, condv
,
15314 incrv
, &clauses
, args
, complain
, in_decl
,
15315 integral_constant_expression_p
);
15316 omp_parallel_combined_clauses
= NULL
;
15318 body
= push_stmt_list ();
15319 RECUR (OMP_FOR_BODY (t
));
15320 body
= pop_stmt_list (body
);
15322 if (OMP_FOR_INIT (t
) != NULL_TREE
)
15323 t
= finish_omp_for (EXPR_LOCATION (t
), TREE_CODE (t
), declv
,
15324 orig_declv
, initv
, condv
, incrv
, body
, pre_body
,
15328 t
= make_node (TREE_CODE (t
));
15329 TREE_TYPE (t
) = void_type_node
;
15330 OMP_FOR_BODY (t
) = body
;
15331 OMP_FOR_PRE_BODY (t
) = pre_body
;
15332 OMP_FOR_CLAUSES (t
) = clauses
;
15333 SET_EXPR_LOCATION (t
, EXPR_LOCATION (t
));
15337 add_stmt (finish_omp_structured_block (stmt
));
15338 pop_omp_privatization_clauses (r
);
15343 omp_parallel_combined_clauses
= NULL
;
15348 r
= push_omp_privatization_clauses (TREE_CODE (t
) == OMP_TEAMS
15349 && OMP_TEAMS_COMBINED (t
));
15350 tmp
= tsubst_omp_clauses (OMP_CLAUSES (t
), false, true,
15351 args
, complain
, in_decl
);
15352 stmt
= push_stmt_list ();
15353 RECUR (OMP_BODY (t
));
15354 stmt
= pop_stmt_list (stmt
);
15357 OMP_BODY (t
) = stmt
;
15358 OMP_CLAUSES (t
) = tmp
;
15360 pop_omp_privatization_clauses (r
);
15364 case OMP_TARGET_DATA
:
15366 tmp
= tsubst_omp_clauses (OMP_CLAUSES (t
), false,
15367 TREE_CODE (t
) != OACC_DATA
,
15368 args
, complain
, in_decl
);
15369 keep_next_level (true);
15370 stmt
= begin_omp_structured_block ();
15372 RECUR (OMP_BODY (t
));
15373 stmt
= finish_omp_structured_block (stmt
);
15376 OMP_BODY (t
) = stmt
;
15377 OMP_CLAUSES (t
) = tmp
;
15378 if (TREE_CODE (t
) == OMP_TARGET
&& OMP_TARGET_COMBINED (t
))
15380 tree teams
= cp_walk_tree (&stmt
, tsubst_find_omp_teams
, NULL
, NULL
);
15383 /* For combined target teams, ensure the num_teams and
15384 thread_limit clause expressions are evaluated on the host,
15385 before entering the target construct. */
15387 for (c
= OMP_TEAMS_CLAUSES (teams
);
15388 c
; c
= OMP_CLAUSE_CHAIN (c
))
15389 if ((OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_NUM_TEAMS
15390 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_THREAD_LIMIT
)
15391 && TREE_CODE (OMP_CLAUSE_OPERAND (c
, 0)) != INTEGER_CST
)
15393 tree expr
= OMP_CLAUSE_OPERAND (c
, 0);
15394 expr
= force_target_expr (TREE_TYPE (expr
), expr
, tf_none
);
15395 if (expr
== error_mark_node
)
15397 tmp
= TARGET_EXPR_SLOT (expr
);
15399 OMP_CLAUSE_OPERAND (c
, 0) = expr
;
15400 tree tc
= build_omp_clause (OMP_CLAUSE_LOCATION (c
),
15401 OMP_CLAUSE_FIRSTPRIVATE
);
15402 OMP_CLAUSE_DECL (tc
) = tmp
;
15403 OMP_CLAUSE_CHAIN (tc
) = OMP_TARGET_CLAUSES (t
);
15404 OMP_TARGET_CLAUSES (t
) = tc
;
15413 tmp
= tsubst_omp_clauses (OACC_DECLARE_CLAUSES (t
), false, false,
15414 args
, complain
, in_decl
);
15415 OACC_DECLARE_CLAUSES (t
) = tmp
;
15419 case OMP_TARGET_UPDATE
:
15420 case OMP_TARGET_ENTER_DATA
:
15421 case OMP_TARGET_EXIT_DATA
:
15422 tmp
= tsubst_omp_clauses (OMP_STANDALONE_CLAUSES (t
), false, true,
15423 args
, complain
, in_decl
);
15425 OMP_STANDALONE_CLAUSES (t
) = tmp
;
15429 case OACC_ENTER_DATA
:
15430 case OACC_EXIT_DATA
:
15432 tmp
= tsubst_omp_clauses (OMP_STANDALONE_CLAUSES (t
), false, false,
15433 args
, complain
, in_decl
);
15435 OMP_STANDALONE_CLAUSES (t
) = tmp
;
15440 tmp
= tsubst_omp_clauses (OMP_ORDERED_CLAUSES (t
), false, true,
15441 args
, complain
, in_decl
);
15442 stmt
= push_stmt_list ();
15443 RECUR (OMP_BODY (t
));
15444 stmt
= pop_stmt_list (stmt
);
15447 OMP_BODY (t
) = stmt
;
15448 OMP_ORDERED_CLAUSES (t
) = tmp
;
15454 case OMP_TASKGROUP
:
15455 stmt
= push_stmt_list ();
15456 RECUR (OMP_BODY (t
));
15457 stmt
= pop_stmt_list (stmt
);
15460 OMP_BODY (t
) = stmt
;
15465 gcc_assert (OMP_ATOMIC_DEPENDENT_P (t
));
15466 if (TREE_CODE (TREE_OPERAND (t
, 1)) != MODIFY_EXPR
)
15468 tree op1
= TREE_OPERAND (t
, 1);
15469 tree rhs1
= NULL_TREE
;
15471 if (TREE_CODE (op1
) == COMPOUND_EXPR
)
15473 rhs1
= RECUR (TREE_OPERAND (op1
, 0));
15474 op1
= TREE_OPERAND (op1
, 1);
15476 lhs
= RECUR (TREE_OPERAND (op1
, 0));
15477 rhs
= RECUR (TREE_OPERAND (op1
, 1));
15478 finish_omp_atomic (OMP_ATOMIC
, TREE_CODE (op1
), lhs
, rhs
,
15479 NULL_TREE
, NULL_TREE
, rhs1
,
15480 OMP_ATOMIC_SEQ_CST (t
));
15484 tree op1
= TREE_OPERAND (t
, 1);
15485 tree v
= NULL_TREE
, lhs
, rhs
= NULL_TREE
, lhs1
= NULL_TREE
;
15486 tree rhs1
= NULL_TREE
;
15487 enum tree_code code
= TREE_CODE (TREE_OPERAND (op1
, 1));
15488 enum tree_code opcode
= NOP_EXPR
;
15489 if (code
== OMP_ATOMIC_READ
)
15491 v
= RECUR (TREE_OPERAND (op1
, 0));
15492 lhs
= RECUR (TREE_OPERAND (TREE_OPERAND (op1
, 1), 0));
15494 else if (code
== OMP_ATOMIC_CAPTURE_OLD
15495 || code
== OMP_ATOMIC_CAPTURE_NEW
)
15497 tree op11
= TREE_OPERAND (TREE_OPERAND (op1
, 1), 1);
15498 v
= RECUR (TREE_OPERAND (op1
, 0));
15499 lhs1
= RECUR (TREE_OPERAND (TREE_OPERAND (op1
, 1), 0));
15500 if (TREE_CODE (op11
) == COMPOUND_EXPR
)
15502 rhs1
= RECUR (TREE_OPERAND (op11
, 0));
15503 op11
= TREE_OPERAND (op11
, 1);
15505 lhs
= RECUR (TREE_OPERAND (op11
, 0));
15506 rhs
= RECUR (TREE_OPERAND (op11
, 1));
15507 opcode
= TREE_CODE (op11
);
15508 if (opcode
== MODIFY_EXPR
)
15514 lhs
= RECUR (TREE_OPERAND (op1
, 0));
15515 rhs
= RECUR (TREE_OPERAND (op1
, 1));
15517 finish_omp_atomic (code
, opcode
, lhs
, rhs
, v
, lhs1
, rhs1
,
15518 OMP_ATOMIC_SEQ_CST (t
));
15522 case TRANSACTION_EXPR
:
15525 flags
|= (TRANSACTION_EXPR_OUTER (t
) ? TM_STMT_ATTR_OUTER
: 0);
15526 flags
|= (TRANSACTION_EXPR_RELAXED (t
) ? TM_STMT_ATTR_RELAXED
: 0);
15528 if (TRANSACTION_EXPR_IS_STMT (t
))
15530 tree body
= TRANSACTION_EXPR_BODY (t
);
15531 tree noex
= NULL_TREE
;
15532 if (TREE_CODE (body
) == MUST_NOT_THROW_EXPR
)
15534 noex
= MUST_NOT_THROW_COND (body
);
15535 if (noex
== NULL_TREE
)
15536 noex
= boolean_true_node
;
15537 body
= TREE_OPERAND (body
, 0);
15539 stmt
= begin_transaction_stmt (input_location
, NULL
, flags
);
15541 finish_transaction_stmt (stmt
, NULL
, flags
, RECUR (noex
));
15545 stmt
= build_transaction_expr (EXPR_LOCATION (t
),
15546 RECUR (TRANSACTION_EXPR_BODY (t
)),
15553 case MUST_NOT_THROW_EXPR
:
15555 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15556 tree cond
= RECUR (MUST_NOT_THROW_COND (t
));
15557 RETURN (build_must_not_throw_expr (op0
, cond
));
15560 case EXPR_PACK_EXPANSION
:
15561 error ("invalid use of pack expansion expression");
15562 RETURN (error_mark_node
);
15564 case NONTYPE_ARGUMENT_PACK
:
15565 error ("use %<...%> to expand argument pack");
15566 RETURN (error_mark_node
);
15568 case CILK_SPAWN_STMT
:
15569 cfun
->calls_cilk_spawn
= 1;
15570 RETURN (build_cilk_spawn (EXPR_LOCATION (t
), RECUR (CILK_SPAWN_FN (t
))));
15572 case CILK_SYNC_STMT
:
15573 RETURN (build_cilk_sync ());
15575 case COMPOUND_EXPR
:
15576 tmp
= RECUR (TREE_OPERAND (t
, 0));
15577 if (tmp
== NULL_TREE
)
15578 /* If the first operand was a statement, we're done with it. */
15579 RETURN (RECUR (TREE_OPERAND (t
, 1)));
15580 RETURN (build_x_compound_expr (EXPR_LOCATION (t
), tmp
,
15581 RECUR (TREE_OPERAND (t
, 1)),
15584 case ANNOTATE_EXPR
:
15585 tmp
= RECUR (TREE_OPERAND (t
, 0));
15586 RETURN (build2_loc (EXPR_LOCATION (t
), ANNOTATE_EXPR
,
15587 TREE_TYPE (tmp
), tmp
, RECUR (TREE_OPERAND (t
, 1))));
15590 gcc_assert (!STATEMENT_CODE_P (TREE_CODE (t
)));
15592 RETURN (tsubst_copy_and_build (t
, args
, complain
, in_decl
,
15593 /*function_p=*/false,
15594 integral_constant_expression_p
));
15597 RETURN (NULL_TREE
);
15599 input_location
= loc
;
15605 /* Instantiate the special body of the artificial DECL_OMP_DECLARE_REDUCTION
15606 function. For description of the body see comment above
15607 cp_parser_omp_declare_reduction_exprs. */
15610 tsubst_omp_udr (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
15612 if (t
== NULL_TREE
|| t
== error_mark_node
)
15615 gcc_assert (TREE_CODE (t
) == STATEMENT_LIST
);
15617 tree_stmt_iterator tsi
;
15620 memset (stmts
, 0, sizeof stmts
);
15621 for (i
= 0, tsi
= tsi_start (t
);
15622 i
< 7 && !tsi_end_p (tsi
);
15623 i
++, tsi_next (&tsi
))
15624 stmts
[i
] = tsi_stmt (tsi
);
15625 gcc_assert (tsi_end_p (tsi
));
15629 gcc_assert (TREE_CODE (stmts
[0]) == DECL_EXPR
15630 && TREE_CODE (stmts
[1]) == DECL_EXPR
);
15631 tree omp_out
= tsubst (DECL_EXPR_DECL (stmts
[0]),
15632 args
, complain
, in_decl
);
15633 tree omp_in
= tsubst (DECL_EXPR_DECL (stmts
[1]),
15634 args
, complain
, in_decl
);
15635 DECL_CONTEXT (omp_out
) = current_function_decl
;
15636 DECL_CONTEXT (omp_in
) = current_function_decl
;
15637 keep_next_level (true);
15638 tree block
= begin_omp_structured_block ();
15639 tsubst_expr (stmts
[2], args
, complain
, in_decl
, false);
15640 block
= finish_omp_structured_block (block
);
15641 block
= maybe_cleanup_point_expr_void (block
);
15642 add_decl_expr (omp_out
);
15643 if (TREE_NO_WARNING (DECL_EXPR_DECL (stmts
[0])))
15644 TREE_NO_WARNING (omp_out
) = 1;
15645 add_decl_expr (omp_in
);
15646 finish_expr_stmt (block
);
15650 gcc_assert (TREE_CODE (stmts
[3]) == DECL_EXPR
15651 && TREE_CODE (stmts
[4]) == DECL_EXPR
);
15652 tree omp_priv
= tsubst (DECL_EXPR_DECL (stmts
[3]),
15653 args
, complain
, in_decl
);
15654 tree omp_orig
= tsubst (DECL_EXPR_DECL (stmts
[4]),
15655 args
, complain
, in_decl
);
15656 DECL_CONTEXT (omp_priv
) = current_function_decl
;
15657 DECL_CONTEXT (omp_orig
) = current_function_decl
;
15658 keep_next_level (true);
15659 tree block
= begin_omp_structured_block ();
15660 tsubst_expr (stmts
[5], args
, complain
, in_decl
, false);
15661 block
= finish_omp_structured_block (block
);
15662 block
= maybe_cleanup_point_expr_void (block
);
15663 cp_walk_tree (&block
, cp_remove_omp_priv_cleanup_stmt
, omp_priv
, NULL
);
15664 add_decl_expr (omp_priv
);
15665 add_decl_expr (omp_orig
);
15666 finish_expr_stmt (block
);
15668 add_decl_expr (omp_orig
);
15672 /* T is a postfix-expression that is not being used in a function
15673 call. Return the substituted version of T. */
15676 tsubst_non_call_postfix_expression (tree t
, tree args
,
15677 tsubst_flags_t complain
,
15680 if (TREE_CODE (t
) == SCOPE_REF
)
15681 t
= tsubst_qualified_id (t
, args
, complain
, in_decl
,
15682 /*done=*/false, /*address_p=*/false);
15684 t
= tsubst_copy_and_build (t
, args
, complain
, in_decl
,
15685 /*function_p=*/false,
15686 /*integral_constant_expression_p=*/false);
15691 /* Like tsubst but deals with expressions and performs semantic
15692 analysis. FUNCTION_P is true if T is the "F" in "F (ARGS)". */
15695 tsubst_copy_and_build (tree t
,
15697 tsubst_flags_t complain
,
15700 bool integral_constant_expression_p
)
15702 #define RETURN(EXP) do { retval = (EXP); goto out; } while(0)
15703 #define RECUR(NODE) \
15704 tsubst_copy_and_build (NODE, args, complain, in_decl, \
15705 /*function_p=*/false, \
15706 integral_constant_expression_p)
15711 if (t
== NULL_TREE
|| t
== error_mark_node
)
15714 loc
= input_location
;
15715 if (EXPR_HAS_LOCATION (t
))
15716 input_location
= EXPR_LOCATION (t
);
15718 /* N3276 decltype magic only applies to calls at the top level or on the
15719 right side of a comma. */
15720 tsubst_flags_t decltype_flag
= (complain
& tf_decltype
);
15721 complain
&= ~tf_decltype
;
15723 switch (TREE_CODE (t
))
15727 /* Fall through. */
15728 case IDENTIFIER_NODE
:
15732 bool non_integral_constant_expression_p
;
15733 const char *error_msg
;
15735 if (IDENTIFIER_TYPENAME_P (t
))
15737 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15738 t
= mangle_conv_op_name_for_type (new_type
);
15741 /* Look up the name. */
15742 decl
= lookup_name (t
);
15744 /* By convention, expressions use ERROR_MARK_NODE to indicate
15745 failure, not NULL_TREE. */
15746 if (decl
== NULL_TREE
)
15747 decl
= error_mark_node
;
15749 decl
= finish_id_expression (t
, decl
, NULL_TREE
,
15751 integral_constant_expression_p
,
15752 /*allow_non_integral_constant_expression_p=*/(cxx_dialect
>= cxx11
),
15753 &non_integral_constant_expression_p
,
15754 /*template_p=*/false,
15756 /*address_p=*/false,
15757 /*template_arg_p=*/false,
15762 if (!function_p
&& identifier_p (decl
))
15764 if (complain
& tf_error
)
15765 unqualified_name_lookup_error (decl
);
15766 decl
= error_mark_node
;
15771 case TEMPLATE_ID_EXPR
:
15774 tree templ
= RECUR (TREE_OPERAND (t
, 0));
15775 tree targs
= TREE_OPERAND (t
, 1);
15778 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
15779 if (targs
== error_mark_node
)
15780 return error_mark_node
;
15782 if (variable_template_p (templ
))
15784 templ
= lookup_template_variable (templ
, targs
);
15785 if (!any_dependent_template_arguments_p (targs
))
15787 templ
= finish_template_variable (templ
, complain
);
15790 RETURN (convert_from_reference (templ
));
15793 if (TREE_CODE (templ
) == COMPONENT_REF
)
15795 object
= TREE_OPERAND (templ
, 0);
15796 templ
= TREE_OPERAND (templ
, 1);
15799 object
= NULL_TREE
;
15800 templ
= lookup_template_function (templ
, targs
);
15803 RETURN (build3 (COMPONENT_REF
, TREE_TYPE (templ
),
15804 object
, templ
, NULL_TREE
));
15806 RETURN (baselink_for_fns (templ
));
15811 tree r
= RECUR (TREE_OPERAND (t
, 0));
15813 if (REFERENCE_REF_P (t
))
15815 /* A type conversion to reference type will be enclosed in
15816 such an indirect ref, but the substitution of the cast
15817 will have also added such an indirect ref. */
15818 if (TREE_CODE (TREE_TYPE (r
)) == REFERENCE_TYPE
)
15819 r
= convert_from_reference (r
);
15822 r
= build_x_indirect_ref (input_location
, r
, RO_UNARY_STAR
,
15823 complain
|decltype_flag
);
15829 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15830 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15831 RETURN (build_nop (type
, op0
));
15834 case IMPLICIT_CONV_EXPR
:
15836 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15837 tree expr
= RECUR (TREE_OPERAND (t
, 0));
15838 int flags
= LOOKUP_IMPLICIT
;
15839 if (IMPLICIT_CONV_EXPR_DIRECT_INIT (t
))
15840 flags
= LOOKUP_NORMAL
;
15841 RETURN (perform_implicit_conversion_flags (type
, expr
, complain
,
15847 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15848 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15849 RETURN (build1 (CONVERT_EXPR
, type
, op0
));
15853 case REINTERPRET_CAST_EXPR
:
15854 case CONST_CAST_EXPR
:
15855 case DYNAMIC_CAST_EXPR
:
15856 case STATIC_CAST_EXPR
:
15859 tree op
, r
= NULL_TREE
;
15861 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15862 if (integral_constant_expression_p
15863 && !cast_valid_in_integral_constant_expression_p (type
))
15865 if (complain
& tf_error
)
15866 error ("a cast to a type other than an integral or "
15867 "enumeration type cannot appear in a constant-expression");
15868 RETURN (error_mark_node
);
15871 op
= RECUR (TREE_OPERAND (t
, 0));
15873 warning_sentinel
s(warn_useless_cast
);
15874 switch (TREE_CODE (t
))
15877 r
= build_functional_cast (type
, op
, complain
);
15879 case REINTERPRET_CAST_EXPR
:
15880 r
= build_reinterpret_cast (type
, op
, complain
);
15882 case CONST_CAST_EXPR
:
15883 r
= build_const_cast (type
, op
, complain
);
15885 case DYNAMIC_CAST_EXPR
:
15886 r
= build_dynamic_cast (type
, op
, complain
);
15888 case STATIC_CAST_EXPR
:
15889 r
= build_static_cast (type
, op
, complain
);
15892 gcc_unreachable ();
15898 case POSTDECREMENT_EXPR
:
15899 case POSTINCREMENT_EXPR
:
15900 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
15901 args
, complain
, in_decl
);
15902 RETURN (build_x_unary_op (input_location
, TREE_CODE (t
), op1
,
15903 complain
|decltype_flag
));
15905 case PREDECREMENT_EXPR
:
15906 case PREINCREMENT_EXPR
:
15910 case TRUTH_NOT_EXPR
:
15911 case UNARY_PLUS_EXPR
: /* Unary + */
15912 case REALPART_EXPR
:
15913 case IMAGPART_EXPR
:
15914 RETURN (build_x_unary_op (input_location
, TREE_CODE (t
),
15915 RECUR (TREE_OPERAND (t
, 0)),
15916 complain
|decltype_flag
));
15918 case FIX_TRUNC_EXPR
:
15919 RETURN (cp_build_unary_op (FIX_TRUNC_EXPR
, RECUR (TREE_OPERAND (t
, 0)),
15923 op1
= TREE_OPERAND (t
, 0);
15924 if (TREE_CODE (op1
) == LABEL_DECL
)
15925 RETURN (finish_label_address_expr (DECL_NAME (op1
),
15926 EXPR_LOCATION (op1
)));
15927 if (TREE_CODE (op1
) == SCOPE_REF
)
15928 op1
= tsubst_qualified_id (op1
, args
, complain
, in_decl
,
15929 /*done=*/true, /*address_p=*/true);
15931 op1
= tsubst_non_call_postfix_expression (op1
, args
, complain
,
15933 RETURN (build_x_unary_op (input_location
, ADDR_EXPR
, op1
,
15934 complain
|decltype_flag
));
15939 case TRUNC_DIV_EXPR
:
15940 case CEIL_DIV_EXPR
:
15941 case FLOOR_DIV_EXPR
:
15942 case ROUND_DIV_EXPR
:
15943 case EXACT_DIV_EXPR
:
15947 case TRUNC_MOD_EXPR
:
15948 case FLOOR_MOD_EXPR
:
15949 case TRUTH_ANDIF_EXPR
:
15950 case TRUTH_ORIF_EXPR
:
15951 case TRUTH_AND_EXPR
:
15952 case TRUTH_OR_EXPR
:
15968 warning_sentinel
s1(warn_type_limits
);
15969 warning_sentinel
s2(warn_div_by_zero
);
15970 warning_sentinel
s3(warn_logical_op
);
15971 warning_sentinel
s4(warn_tautological_compare
);
15972 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15973 tree op1
= RECUR (TREE_OPERAND (t
, 1));
15974 tree r
= build_x_binary_op
15975 (input_location
, TREE_CODE (t
),
15977 (TREE_NO_WARNING (TREE_OPERAND (t
, 0))
15979 : TREE_CODE (TREE_OPERAND (t
, 0))),
15981 (TREE_NO_WARNING (TREE_OPERAND (t
, 1))
15983 : TREE_CODE (TREE_OPERAND (t
, 1))),
15985 complain
|decltype_flag
);
15986 if (EXPR_P (r
) && TREE_NO_WARNING (t
))
15987 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
15992 case POINTER_PLUS_EXPR
:
15994 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15995 tree op1
= RECUR (TREE_OPERAND (t
, 1));
15996 return fold_build_pointer_plus (op0
, op1
);
16000 RETURN (tsubst_qualified_id (t
, args
, complain
, in_decl
, /*done=*/true,
16001 /*address_p=*/false));
16003 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
16004 args
, complain
, in_decl
);
16005 RETURN (build_x_array_ref (EXPR_LOCATION (t
), op1
,
16006 RECUR (TREE_OPERAND (t
, 1)),
16007 complain
|decltype_flag
));
16009 case ARRAY_NOTATION_REF
:
16011 tree start_index
, length
, stride
;
16012 op1
= tsubst_non_call_postfix_expression (ARRAY_NOTATION_ARRAY (t
),
16013 args
, complain
, in_decl
);
16014 start_index
= RECUR (ARRAY_NOTATION_START (t
));
16015 length
= RECUR (ARRAY_NOTATION_LENGTH (t
));
16016 stride
= RECUR (ARRAY_NOTATION_STRIDE (t
));
16017 RETURN (build_array_notation_ref (EXPR_LOCATION (t
), op1
, start_index
,
16018 length
, stride
, TREE_TYPE (op1
)));
16021 if (PACK_EXPANSION_P (TREE_OPERAND (t
, 0)))
16022 RETURN (tsubst_copy (t
, args
, complain
, in_decl
));
16029 op1
= TREE_OPERAND (t
, 0);
16030 if (TREE_CODE (t
) == SIZEOF_EXPR
&& SIZEOF_EXPR_TYPE_P (t
))
16031 op1
= TREE_TYPE (op1
);
16034 /* When there are no ARGS, we are trying to evaluate a
16035 non-dependent expression from the parser. Trying to do
16036 the substitutions may not work. */
16038 op1
= TREE_TYPE (op1
);
16042 ++cp_unevaluated_operand
;
16043 ++c_inhibit_evaluation_warnings
;
16045 op1
= tsubst (op1
, args
, complain
, in_decl
);
16047 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
16048 /*function_p=*/false,
16049 /*integral_constant_expression_p=*/
16051 --cp_unevaluated_operand
;
16052 --c_inhibit_evaluation_warnings
;
16055 r
= cxx_sizeof_or_alignof_type (op1
, TREE_CODE (t
),
16056 complain
& tf_error
);
16058 r
= cxx_sizeof_or_alignof_expr (op1
, TREE_CODE (t
),
16059 complain
& tf_error
);
16060 if (TREE_CODE (t
) == SIZEOF_EXPR
&& r
!= error_mark_node
)
16062 if (TREE_CODE (r
) != SIZEOF_EXPR
|| TYPE_P (op1
))
16064 if (!processing_template_decl
&& TYPE_P (op1
))
16066 r
= build_min (SIZEOF_EXPR
, size_type_node
,
16067 build1 (NOP_EXPR
, op1
, error_mark_node
));
16068 SIZEOF_EXPR_TYPE_P (r
) = 1;
16071 r
= build_min (SIZEOF_EXPR
, size_type_node
, op1
);
16072 TREE_SIDE_EFFECTS (r
) = 0;
16073 TREE_READONLY (r
) = 1;
16075 SET_EXPR_LOCATION (r
, EXPR_LOCATION (t
));
16080 case AT_ENCODE_EXPR
:
16082 op1
= TREE_OPERAND (t
, 0);
16083 ++cp_unevaluated_operand
;
16084 ++c_inhibit_evaluation_warnings
;
16085 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
16086 /*function_p=*/false,
16087 /*integral_constant_expression_p=*/false);
16088 --cp_unevaluated_operand
;
16089 --c_inhibit_evaluation_warnings
;
16090 RETURN (objc_build_encode_expr (op1
));
16093 case NOEXCEPT_EXPR
:
16094 op1
= TREE_OPERAND (t
, 0);
16095 ++cp_unevaluated_operand
;
16096 ++c_inhibit_evaluation_warnings
;
16097 ++cp_noexcept_operand
;
16098 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
16099 /*function_p=*/false,
16100 /*integral_constant_expression_p=*/false);
16101 --cp_unevaluated_operand
;
16102 --c_inhibit_evaluation_warnings
;
16103 --cp_noexcept_operand
;
16104 RETURN (finish_noexcept_expr (op1
, complain
));
16108 warning_sentinel
s(warn_div_by_zero
);
16109 tree lhs
= RECUR (TREE_OPERAND (t
, 0));
16110 tree rhs
= RECUR (TREE_OPERAND (t
, 2));
16111 tree r
= build_x_modify_expr
16112 (EXPR_LOCATION (t
), lhs
, TREE_CODE (TREE_OPERAND (t
, 1)), rhs
,
16113 complain
|decltype_flag
);
16114 /* TREE_NO_WARNING must be set if either the expression was
16115 parenthesized or it uses an operator such as >>= rather
16116 than plain assignment. In the former case, it was already
16117 set and must be copied. In the latter case,
16118 build_x_modify_expr sets it and it must not be reset
16120 if (TREE_NO_WARNING (t
))
16121 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
16127 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
16128 args
, complain
, in_decl
);
16129 /* Remember that there was a reference to this entity. */
16131 && !mark_used (op1
, complain
) && !(complain
& tf_error
))
16132 RETURN (error_mark_node
);
16133 RETURN (build_x_arrow (input_location
, op1
, complain
));
16137 tree placement
= RECUR (TREE_OPERAND (t
, 0));
16138 tree init
= RECUR (TREE_OPERAND (t
, 3));
16139 vec
<tree
, va_gc
> *placement_vec
;
16140 vec
<tree
, va_gc
> *init_vec
;
16143 if (placement
== NULL_TREE
)
16144 placement_vec
= NULL
;
16147 placement_vec
= make_tree_vector ();
16148 for (; placement
!= NULL_TREE
; placement
= TREE_CHAIN (placement
))
16149 vec_safe_push (placement_vec
, TREE_VALUE (placement
));
16152 /* If there was an initializer in the original tree, but it
16153 instantiated to an empty list, then we should pass a
16154 non-NULL empty vector to tell build_new that it was an
16155 empty initializer() rather than no initializer. This can
16156 only happen when the initializer is a pack expansion whose
16157 parameter packs are of length zero. */
16158 if (init
== NULL_TREE
&& TREE_OPERAND (t
, 3) == NULL_TREE
)
16162 init_vec
= make_tree_vector ();
16163 if (init
== void_node
)
16164 gcc_assert (init_vec
!= NULL
);
16167 for (; init
!= NULL_TREE
; init
= TREE_CHAIN (init
))
16168 vec_safe_push (init_vec
, TREE_VALUE (init
));
16172 tree op1
= tsubst (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
16173 tree op2
= RECUR (TREE_OPERAND (t
, 2));
16174 ret
= build_new (&placement_vec
, op1
, op2
, &init_vec
,
16175 NEW_EXPR_USE_GLOBAL (t
),
16178 if (placement_vec
!= NULL
)
16179 release_tree_vector (placement_vec
);
16180 if (init_vec
!= NULL
)
16181 release_tree_vector (init_vec
);
16188 tree op0
= RECUR (TREE_OPERAND (t
, 0));
16189 tree op1
= RECUR (TREE_OPERAND (t
, 1));
16190 RETURN (delete_sanity (op0
, op1
,
16191 DELETE_EXPR_USE_VEC (t
),
16192 DELETE_EXPR_USE_GLOBAL (t
),
16196 case COMPOUND_EXPR
:
16198 tree op0
= tsubst_copy_and_build (TREE_OPERAND (t
, 0), args
,
16199 complain
& ~tf_decltype
, in_decl
,
16200 /*function_p=*/false,
16201 integral_constant_expression_p
);
16202 RETURN (build_x_compound_expr (EXPR_LOCATION (t
),
16204 RECUR (TREE_OPERAND (t
, 1)),
16205 complain
|decltype_flag
));
16211 vec
<tree
, va_gc
> *call_args
;
16212 unsigned int nargs
, i
;
16217 function
= CALL_EXPR_FN (t
);
16218 /* When we parsed the expression, we determined whether or
16219 not Koenig lookup should be performed. */
16220 koenig_p
= KOENIG_LOOKUP_P (t
);
16221 if (TREE_CODE (function
) == SCOPE_REF
)
16223 qualified_p
= true;
16224 function
= tsubst_qualified_id (function
, args
, complain
, in_decl
,
16226 /*address_p=*/false);
16228 else if (koenig_p
&& identifier_p (function
))
16230 /* Do nothing; calling tsubst_copy_and_build on an identifier
16231 would incorrectly perform unqualified lookup again.
16233 Note that we can also have an IDENTIFIER_NODE if the earlier
16234 unqualified lookup found a member function; in that case
16235 koenig_p will be false and we do want to do the lookup
16236 again to find the instantiated member function.
16238 FIXME but doing that causes c++/15272, so we need to stop
16239 using IDENTIFIER_NODE in that situation. */
16240 qualified_p
= false;
16244 if (TREE_CODE (function
) == COMPONENT_REF
)
16246 tree op
= TREE_OPERAND (function
, 1);
16248 qualified_p
= (TREE_CODE (op
) == SCOPE_REF
16249 || (BASELINK_P (op
)
16250 && BASELINK_QUALIFIED_P (op
)));
16253 qualified_p
= false;
16255 if (TREE_CODE (function
) == ADDR_EXPR
16256 && TREE_CODE (TREE_OPERAND (function
, 0)) == FUNCTION_DECL
)
16257 /* Avoid error about taking the address of a constructor. */
16258 function
= TREE_OPERAND (function
, 0);
16260 function
= tsubst_copy_and_build (function
, args
, complain
,
16263 integral_constant_expression_p
);
16265 if (BASELINK_P (function
))
16266 qualified_p
= true;
16269 nargs
= call_expr_nargs (t
);
16270 call_args
= make_tree_vector ();
16271 for (i
= 0; i
< nargs
; ++i
)
16273 tree arg
= CALL_EXPR_ARG (t
, i
);
16275 if (!PACK_EXPANSION_P (arg
))
16276 vec_safe_push (call_args
, RECUR (CALL_EXPR_ARG (t
, i
)));
16279 /* Expand the pack expansion and push each entry onto
16281 arg
= tsubst_pack_expansion (arg
, args
, complain
, in_decl
);
16282 if (TREE_CODE (arg
) == TREE_VEC
)
16284 unsigned int len
, j
;
16286 len
= TREE_VEC_LENGTH (arg
);
16287 for (j
= 0; j
< len
; ++j
)
16289 tree value
= TREE_VEC_ELT (arg
, j
);
16290 if (value
!= NULL_TREE
)
16291 value
= convert_from_reference (value
);
16292 vec_safe_push (call_args
, value
);
16297 /* A partial substitution. Add one entry. */
16298 vec_safe_push (call_args
, arg
);
16303 /* We do not perform argument-dependent lookup if normal
16304 lookup finds a non-function, in accordance with the
16305 expected resolution of DR 218. */
16307 && ((is_overloaded_fn (function
)
16308 /* If lookup found a member function, the Koenig lookup is
16309 not appropriate, even if an unqualified-name was used
16310 to denote the function. */
16311 && !DECL_FUNCTION_MEMBER_P (get_first_fn (function
)))
16312 || identifier_p (function
))
16313 /* Only do this when substitution turns a dependent call
16314 into a non-dependent call. */
16315 && type_dependent_expression_p_push (t
)
16316 && !any_type_dependent_arguments_p (call_args
))
16317 function
= perform_koenig_lookup (function
, call_args
, tf_none
);
16319 if (identifier_p (function
)
16320 && !any_type_dependent_arguments_p (call_args
))
16322 if (koenig_p
&& (complain
& tf_warning_or_error
))
16324 /* For backwards compatibility and good diagnostics, try
16325 the unqualified lookup again if we aren't in SFINAE
16327 tree unq
= (tsubst_copy_and_build
16328 (function
, args
, complain
, in_decl
, true,
16329 integral_constant_expression_p
));
16330 if (unq
== error_mark_node
)
16331 RETURN (error_mark_node
);
16333 if (unq
!= function
)
16336 if (INDIRECT_REF_P (fn
))
16337 fn
= TREE_OPERAND (fn
, 0);
16338 if (TREE_CODE (fn
) == COMPONENT_REF
)
16339 fn
= TREE_OPERAND (fn
, 1);
16340 if (is_overloaded_fn (fn
))
16341 fn
= get_first_fn (fn
);
16342 if (permerror (EXPR_LOC_OR_LOC (t
, input_location
),
16343 "%qD was not declared in this scope, "
16344 "and no declarations were found by "
16345 "argument-dependent lookup at the point "
16346 "of instantiation", function
))
16349 /* Can't say anything more. */;
16350 else if (DECL_CLASS_SCOPE_P (fn
))
16352 location_t loc
= EXPR_LOC_OR_LOC (t
,
16355 "declarations in dependent base %qT are "
16356 "not found by unqualified lookup",
16357 DECL_CLASS_CONTEXT (fn
));
16358 if (current_class_ptr
)
16360 "use %<this->%D%> instead", function
);
16363 "use %<%T::%D%> instead",
16364 current_class_name
, function
);
16367 inform (DECL_SOURCE_LOCATION (fn
),
16368 "%qD declared here, later in the "
16369 "translation unit", fn
);
16374 if (identifier_p (function
))
16376 if (complain
& tf_error
)
16377 unqualified_name_lookup_error (function
);
16378 release_tree_vector (call_args
);
16379 RETURN (error_mark_node
);
16383 /* Remember that there was a reference to this entity. */
16384 if (DECL_P (function
)
16385 && !mark_used (function
, complain
) && !(complain
& tf_error
))
16386 RETURN (error_mark_node
);
16388 /* Put back tf_decltype for the actual call. */
16389 complain
|= decltype_flag
;
16391 if (TREE_CODE (function
) == OFFSET_REF
)
16392 ret
= build_offset_ref_call_from_tree (function
, &call_args
,
16394 else if (TREE_CODE (function
) == COMPONENT_REF
)
16396 tree instance
= TREE_OPERAND (function
, 0);
16397 tree fn
= TREE_OPERAND (function
, 1);
16399 if (processing_template_decl
16400 && (type_dependent_expression_p (instance
)
16401 || (!BASELINK_P (fn
)
16402 && TREE_CODE (fn
) != FIELD_DECL
)
16403 || type_dependent_expression_p (fn
)
16404 || any_type_dependent_arguments_p (call_args
)))
16405 ret
= build_nt_call_vec (function
, call_args
);
16406 else if (!BASELINK_P (fn
))
16407 ret
= finish_call_expr (function
, &call_args
,
16408 /*disallow_virtual=*/false,
16409 /*koenig_p=*/false,
16412 ret
= (build_new_method_call
16414 &call_args
, NULL_TREE
,
16415 qualified_p
? LOOKUP_NONVIRTUAL
: LOOKUP_NORMAL
,
16420 ret
= finish_call_expr (function
, &call_args
,
16421 /*disallow_virtual=*/qualified_p
,
16425 release_tree_vector (call_args
);
16432 tree cond
= RECUR (TREE_OPERAND (t
, 0));
16433 tree folded_cond
= fold_non_dependent_expr (cond
);
16436 if (TREE_CODE (folded_cond
) == INTEGER_CST
)
16438 if (integer_zerop (folded_cond
))
16440 ++c_inhibit_evaluation_warnings
;
16441 exp1
= RECUR (TREE_OPERAND (t
, 1));
16442 --c_inhibit_evaluation_warnings
;
16443 exp2
= RECUR (TREE_OPERAND (t
, 2));
16447 exp1
= RECUR (TREE_OPERAND (t
, 1));
16448 ++c_inhibit_evaluation_warnings
;
16449 exp2
= RECUR (TREE_OPERAND (t
, 2));
16450 --c_inhibit_evaluation_warnings
;
16452 cond
= folded_cond
;
16456 exp1
= RECUR (TREE_OPERAND (t
, 1));
16457 exp2
= RECUR (TREE_OPERAND (t
, 2));
16460 RETURN (build_x_conditional_expr (EXPR_LOCATION (t
),
16461 cond
, exp1
, exp2
, complain
));
16464 case PSEUDO_DTOR_EXPR
:
16466 tree op0
= RECUR (TREE_OPERAND (t
, 0));
16467 tree op1
= RECUR (TREE_OPERAND (t
, 1));
16468 tree op2
= tsubst (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
16469 RETURN (finish_pseudo_destructor_expr (op0
, op1
, op2
,
16475 tree purpose
, value
, chain
;
16477 if (t
== void_list_node
)
16480 if ((TREE_PURPOSE (t
) && PACK_EXPANSION_P (TREE_PURPOSE (t
)))
16481 || (TREE_VALUE (t
) && PACK_EXPANSION_P (TREE_VALUE (t
))))
16483 /* We have pack expansions, so expand those and
16484 create a new list out of it. */
16485 tree purposevec
= NULL_TREE
;
16486 tree valuevec
= NULL_TREE
;
16490 /* Expand the argument expressions. */
16491 if (TREE_PURPOSE (t
))
16492 purposevec
= tsubst_pack_expansion (TREE_PURPOSE (t
), args
,
16493 complain
, in_decl
);
16494 if (TREE_VALUE (t
))
16495 valuevec
= tsubst_pack_expansion (TREE_VALUE (t
), args
,
16496 complain
, in_decl
);
16498 /* Build the rest of the list. */
16499 chain
= TREE_CHAIN (t
);
16500 if (chain
&& chain
!= void_type_node
)
16501 chain
= RECUR (chain
);
16503 /* Determine the number of arguments. */
16504 if (purposevec
&& TREE_CODE (purposevec
) == TREE_VEC
)
16506 len
= TREE_VEC_LENGTH (purposevec
);
16507 gcc_assert (!valuevec
|| len
== TREE_VEC_LENGTH (valuevec
));
16509 else if (TREE_CODE (valuevec
) == TREE_VEC
)
16510 len
= TREE_VEC_LENGTH (valuevec
);
16513 /* Since we only performed a partial substitution into
16514 the argument pack, we only RETURN (a single list
16516 if (purposevec
== TREE_PURPOSE (t
)
16517 && valuevec
== TREE_VALUE (t
)
16518 && chain
== TREE_CHAIN (t
))
16521 RETURN (tree_cons (purposevec
, valuevec
, chain
));
16524 /* Convert the argument vectors into a TREE_LIST */
16528 /* Grab the Ith values. */
16530 purpose
= purposevec
? TREE_VEC_ELT (purposevec
, i
)
16533 = valuevec
? convert_from_reference (TREE_VEC_ELT (valuevec
, i
))
16536 /* Build the list (backwards). */
16537 chain
= tree_cons (purpose
, value
, chain
);
16543 purpose
= TREE_PURPOSE (t
);
16545 purpose
= RECUR (purpose
);
16546 value
= TREE_VALUE (t
);
16548 value
= RECUR (value
);
16549 chain
= TREE_CHAIN (t
);
16550 if (chain
&& chain
!= void_type_node
)
16551 chain
= RECUR (chain
);
16552 if (purpose
== TREE_PURPOSE (t
)
16553 && value
== TREE_VALUE (t
)
16554 && chain
== TREE_CHAIN (t
))
16556 RETURN (tree_cons (purpose
, value
, chain
));
16559 case COMPONENT_REF
:
16566 object
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
16567 args
, complain
, in_decl
);
16568 /* Remember that there was a reference to this entity. */
16569 if (DECL_P (object
)
16570 && !mark_used (object
, complain
) && !(complain
& tf_error
))
16571 RETURN (error_mark_node
);
16572 object_type
= TREE_TYPE (object
);
16574 member
= TREE_OPERAND (t
, 1);
16575 if (BASELINK_P (member
))
16576 member
= tsubst_baselink (member
,
16577 non_reference (TREE_TYPE (object
)),
16578 args
, complain
, in_decl
);
16580 member
= tsubst_copy (member
, args
, complain
, in_decl
);
16581 if (member
== error_mark_node
)
16582 RETURN (error_mark_node
);
16584 if (type_dependent_expression_p (object
))
16585 /* We can't do much here. */;
16586 else if (!CLASS_TYPE_P (object_type
))
16588 if (scalarish_type_p (object_type
))
16590 tree s
= NULL_TREE
;
16591 tree dtor
= member
;
16593 if (TREE_CODE (dtor
) == SCOPE_REF
)
16595 s
= TREE_OPERAND (dtor
, 0);
16596 dtor
= TREE_OPERAND (dtor
, 1);
16598 if (TREE_CODE (dtor
) == BIT_NOT_EXPR
)
16600 dtor
= TREE_OPERAND (dtor
, 0);
16602 RETURN (finish_pseudo_destructor_expr
16603 (object
, s
, dtor
, input_location
));
16607 else if (TREE_CODE (member
) == SCOPE_REF
16608 && TREE_CODE (TREE_OPERAND (member
, 1)) == TEMPLATE_ID_EXPR
)
16610 /* Lookup the template functions now that we know what the
16612 tree scope
= TREE_OPERAND (member
, 0);
16613 tree tmpl
= TREE_OPERAND (TREE_OPERAND (member
, 1), 0);
16614 tree args
= TREE_OPERAND (TREE_OPERAND (member
, 1), 1);
16615 member
= lookup_qualified_name (scope
, tmpl
,
16616 /*is_type_p=*/false,
16617 /*complain=*/false);
16618 if (BASELINK_P (member
))
16620 BASELINK_FUNCTIONS (member
)
16621 = build_nt (TEMPLATE_ID_EXPR
, BASELINK_FUNCTIONS (member
),
16623 member
= (adjust_result_of_qualified_name_lookup
16624 (member
, BINFO_TYPE (BASELINK_BINFO (member
)),
16629 qualified_name_lookup_error (scope
, tmpl
, member
,
16631 RETURN (error_mark_node
);
16634 else if (TREE_CODE (member
) == SCOPE_REF
16635 && !CLASS_TYPE_P (TREE_OPERAND (member
, 0))
16636 && TREE_CODE (TREE_OPERAND (member
, 0)) != NAMESPACE_DECL
)
16638 if (complain
& tf_error
)
16640 if (TYPE_P (TREE_OPERAND (member
, 0)))
16641 error ("%qT is not a class or namespace",
16642 TREE_OPERAND (member
, 0));
16644 error ("%qD is not a class or namespace",
16645 TREE_OPERAND (member
, 0));
16647 RETURN (error_mark_node
);
16649 else if (TREE_CODE (member
) == FIELD_DECL
)
16651 r
= finish_non_static_data_member (member
, object
, NULL_TREE
);
16652 if (TREE_CODE (r
) == COMPONENT_REF
)
16653 REF_PARENTHESIZED_P (r
) = REF_PARENTHESIZED_P (t
);
16657 r
= finish_class_member_access_expr (object
, member
,
16658 /*template_p=*/false,
16660 if (TREE_CODE (r
) == COMPONENT_REF
)
16661 REF_PARENTHESIZED_P (r
) = REF_PARENTHESIZED_P (t
);
16666 RETURN (build_throw
16667 (RECUR (TREE_OPERAND (t
, 0))));
16671 vec
<constructor_elt
, va_gc
> *n
;
16672 constructor_elt
*ce
;
16673 unsigned HOST_WIDE_INT idx
;
16674 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
16675 bool process_index_p
;
16677 bool need_copy_p
= false;
16680 if (type
== error_mark_node
)
16681 RETURN (error_mark_node
);
16683 /* digest_init will do the wrong thing if we let it. */
16684 if (type
&& TYPE_PTRMEMFUNC_P (type
))
16687 /* We do not want to process the index of aggregate
16688 initializers as they are identifier nodes which will be
16689 looked up by digest_init. */
16690 process_index_p
= !(type
&& MAYBE_CLASS_TYPE_P (type
));
16692 n
= vec_safe_copy (CONSTRUCTOR_ELTS (t
));
16693 newlen
= vec_safe_length (n
);
16694 FOR_EACH_VEC_SAFE_ELT (n
, idx
, ce
)
16696 if (ce
->index
&& process_index_p
16697 /* An identifier index is looked up in the type
16698 being initialized, not the current scope. */
16699 && TREE_CODE (ce
->index
) != IDENTIFIER_NODE
)
16700 ce
->index
= RECUR (ce
->index
);
16702 if (PACK_EXPANSION_P (ce
->value
))
16704 /* Substitute into the pack expansion. */
16705 ce
->value
= tsubst_pack_expansion (ce
->value
, args
, complain
,
16708 if (ce
->value
== error_mark_node
16709 || PACK_EXPANSION_P (ce
->value
))
16711 else if (TREE_VEC_LENGTH (ce
->value
) == 1)
16712 /* Just move the argument into place. */
16713 ce
->value
= TREE_VEC_ELT (ce
->value
, 0);
16716 /* Update the length of the final CONSTRUCTOR
16717 arguments vector, and note that we will need to
16719 newlen
= newlen
+ TREE_VEC_LENGTH (ce
->value
) - 1;
16720 need_copy_p
= true;
16724 ce
->value
= RECUR (ce
->value
);
16729 vec
<constructor_elt
, va_gc
> *old_n
= n
;
16731 vec_alloc (n
, newlen
);
16732 FOR_EACH_VEC_ELT (*old_n
, idx
, ce
)
16734 if (TREE_CODE (ce
->value
) == TREE_VEC
)
16736 int i
, len
= TREE_VEC_LENGTH (ce
->value
);
16737 for (i
= 0; i
< len
; ++i
)
16738 CONSTRUCTOR_APPEND_ELT (n
, 0,
16739 TREE_VEC_ELT (ce
->value
, i
));
16742 CONSTRUCTOR_APPEND_ELT (n
, 0, ce
->value
);
16746 r
= build_constructor (init_list_type_node
, n
);
16747 CONSTRUCTOR_IS_DIRECT_INIT (r
) = CONSTRUCTOR_IS_DIRECT_INIT (t
);
16749 if (TREE_HAS_CONSTRUCTOR (t
))
16750 RETURN (finish_compound_literal (type
, r
, complain
));
16752 TREE_TYPE (r
) = type
;
16758 tree operand_0
= TREE_OPERAND (t
, 0);
16759 if (TYPE_P (operand_0
))
16761 operand_0
= tsubst (operand_0
, args
, complain
, in_decl
);
16762 RETURN (get_typeid (operand_0
, complain
));
16766 operand_0
= RECUR (operand_0
);
16767 RETURN (build_typeid (operand_0
, complain
));
16774 else if (DECL_PACK_P (t
))
16776 /* We don't build decls for an instantiation of a
16777 variadic capture proxy, we instantiate the elements
16779 gcc_assert (DECL_HAS_VALUE_EXPR_P (t
));
16780 return RECUR (DECL_VALUE_EXPR (t
));
16786 tree r
= tsubst_copy (t
, args
, complain
, in_decl
);
16787 /* ??? We're doing a subset of finish_id_expression here. */
16789 && !processing_template_decl
16790 && !cp_unevaluated_operand
16791 && (TREE_STATIC (r
) || DECL_EXTERNAL (r
))
16792 && CP_DECL_THREAD_LOCAL_P (r
))
16794 if (tree wrap
= get_tls_wrapper_fn (r
))
16795 /* Replace an evaluated use of the thread_local variable with
16796 a call to its wrapper. */
16797 r
= build_cxx_call (wrap
, 0, NULL
, tf_warning_or_error
);
16799 else if (outer_automatic_var_p (r
))
16801 r
= process_outer_var_ref (r
, complain
);
16802 if (is_capture_proxy (r
))
16803 register_local_specialization (r
, t
);
16806 if (TREE_CODE (TREE_TYPE (t
)) != REFERENCE_TYPE
)
16807 /* If the original type was a reference, we'll be wrapped in
16808 the appropriate INDIRECT_REF. */
16809 r
= convert_from_reference (r
);
16815 tree op0
= RECUR (TREE_OPERAND (t
, 0));
16816 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
16817 RETURN (build_x_va_arg (EXPR_LOCATION (t
), op0
, type
));
16820 case OFFSETOF_EXPR
:
16821 RETURN (finish_offsetof (RECUR (TREE_OPERAND (t
, 0)),
16822 EXPR_LOCATION (t
)));
16826 tree type1
= tsubst (TRAIT_EXPR_TYPE1 (t
), args
,
16827 complain
, in_decl
);
16829 tree type2
= TRAIT_EXPR_TYPE2 (t
);
16830 if (type2
&& TREE_CODE (type2
) == TREE_LIST
)
16831 type2
= RECUR (type2
);
16833 type2
= tsubst (type2
, args
, complain
, in_decl
);
16835 RETURN (finish_trait_expr (TRAIT_EXPR_KIND (t
), type1
, type2
));
16840 tree old_stmt_expr
= cur_stmt_expr
;
16841 tree stmt_expr
= begin_stmt_expr ();
16843 cur_stmt_expr
= stmt_expr
;
16844 tsubst_expr (STMT_EXPR_STMT (t
), args
, complain
, in_decl
,
16845 integral_constant_expression_p
);
16846 stmt_expr
= finish_stmt_expr (stmt_expr
, false);
16847 cur_stmt_expr
= old_stmt_expr
;
16849 /* If the resulting list of expression statement is empty,
16850 fold it further into void_node. */
16851 if (empty_expr_stmt_p (stmt_expr
))
16852 stmt_expr
= void_node
;
16854 RETURN (stmt_expr
);
16859 tree r
= build_lambda_expr ();
16861 tree type
= tsubst (LAMBDA_EXPR_CLOSURE (t
), args
, complain
, NULL_TREE
);
16862 LAMBDA_EXPR_CLOSURE (r
) = type
;
16863 CLASSTYPE_LAMBDA_EXPR (type
) = r
;
16865 LAMBDA_EXPR_LOCATION (r
)
16866 = LAMBDA_EXPR_LOCATION (t
);
16867 LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (r
)
16868 = LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (t
);
16869 LAMBDA_EXPR_MUTABLE_P (r
) = LAMBDA_EXPR_MUTABLE_P (t
);
16870 LAMBDA_EXPR_DISCRIMINATOR (r
)
16871 = (LAMBDA_EXPR_DISCRIMINATOR (t
));
16872 tree scope
= LAMBDA_EXPR_EXTRA_SCOPE (t
);
16874 /* No substitution needed. */;
16875 else if (VAR_OR_FUNCTION_DECL_P (scope
))
16876 /* For a function or variable scope, we want to use tsubst so that we
16877 don't complain about referring to an auto before deduction. */
16878 scope
= tsubst (scope
, args
, complain
, in_decl
);
16879 else if (TREE_CODE (scope
) == PARM_DECL
)
16881 /* Look up the parameter we want directly, as tsubst_copy
16882 doesn't do what we need. */
16883 tree fn
= tsubst (DECL_CONTEXT (scope
), args
, complain
, in_decl
);
16884 tree parm
= FUNCTION_FIRST_USER_PARM (fn
);
16885 while (DECL_PARM_INDEX (parm
) != DECL_PARM_INDEX (scope
))
16886 parm
= DECL_CHAIN (parm
);
16888 /* FIXME Work around the parm not having DECL_CONTEXT set. */
16889 if (DECL_CONTEXT (scope
) == NULL_TREE
)
16890 DECL_CONTEXT (scope
) = fn
;
16892 else if (TREE_CODE (scope
) == FIELD_DECL
)
16893 /* For a field, use tsubst_copy so that we look up the existing field
16894 rather than build a new one. */
16895 scope
= RECUR (scope
);
16897 gcc_unreachable ();
16898 LAMBDA_EXPR_EXTRA_SCOPE (r
) = scope
;
16899 LAMBDA_EXPR_RETURN_TYPE (r
)
16900 = tsubst (LAMBDA_EXPR_RETURN_TYPE (t
), args
, complain
, in_decl
);
16902 gcc_assert (LAMBDA_EXPR_THIS_CAPTURE (t
) == NULL_TREE
16903 && LAMBDA_EXPR_PENDING_PROXIES (t
) == NULL
);
16905 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
16906 determine_visibility (TYPE_NAME (type
));
16907 /* Now that we know visibility, instantiate the type so we have a
16908 declaration of the op() for later calls to lambda_function. */
16909 complete_type (type
);
16911 LAMBDA_EXPR_THIS_CAPTURE (r
) = NULL_TREE
;
16913 insert_pending_capture_proxies ();
16915 RETURN (build_lambda_object (r
));
16919 /* We can get here for a constant initializer of non-dependent type.
16920 FIXME stop folding in cp_parser_initializer_clause. */
16922 tree r
= get_target_expr_sfinae (RECUR (TARGET_EXPR_INITIAL (t
)),
16927 case TRANSACTION_EXPR
:
16928 RETURN (tsubst_expr(t
, args
, complain
, in_decl
,
16929 integral_constant_expression_p
));
16932 RETURN (finish_parenthesized_expr (RECUR (TREE_OPERAND (t
, 0))));
16934 case VEC_PERM_EXPR
:
16936 tree op0
= RECUR (TREE_OPERAND (t
, 0));
16937 tree op1
= RECUR (TREE_OPERAND (t
, 1));
16938 tree op2
= RECUR (TREE_OPERAND (t
, 2));
16939 RETURN (build_x_vec_perm_expr (input_location
, op0
, op1
, op2
,
16943 case REQUIRES_EXPR
:
16944 RETURN (tsubst_requires_expr (t
, args
, complain
, in_decl
));
16947 /* Handle Objective-C++ constructs, if appropriate. */
16950 = objcp_tsubst_copy_and_build (t
, args
, complain
,
16951 in_decl
, /*function_p=*/false);
16955 RETURN (tsubst_copy (t
, args
, complain
, in_decl
));
16961 input_location
= loc
;
16965 /* Verify that the instantiated ARGS are valid. For type arguments,
16966 make sure that the type's linkage is ok. For non-type arguments,
16967 make sure they are constants if they are integral or enumerations.
16968 Emit an error under control of COMPLAIN, and return TRUE on error. */
16971 check_instantiated_arg (tree tmpl
, tree t
, tsubst_flags_t complain
)
16973 if (dependent_template_arg_p (t
))
16975 if (ARGUMENT_PACK_P (t
))
16977 tree vec
= ARGUMENT_PACK_ARGS (t
);
16978 int len
= TREE_VEC_LENGTH (vec
);
16979 bool result
= false;
16982 for (i
= 0; i
< len
; ++i
)
16983 if (check_instantiated_arg (tmpl
, TREE_VEC_ELT (vec
, i
), complain
))
16987 else if (TYPE_P (t
))
16989 /* [basic.link]: A name with no linkage (notably, the name
16990 of a class or enumeration declared in a local scope)
16991 shall not be used to declare an entity with linkage.
16992 This implies that names with no linkage cannot be used as
16995 DR 757 relaxes this restriction for C++0x. */
16996 tree nt
= (cxx_dialect
> cxx98
? NULL_TREE
16997 : no_linkage_check (t
, /*relaxed_p=*/false));
17001 /* DR 488 makes use of a type with no linkage cause
17002 type deduction to fail. */
17003 if (complain
& tf_error
)
17005 if (TYPE_ANONYMOUS_P (nt
))
17006 error ("%qT is/uses anonymous type", t
);
17008 error ("template argument for %qD uses local type %qT",
17013 /* In order to avoid all sorts of complications, we do not
17014 allow variably-modified types as template arguments. */
17015 else if (variably_modified_type_p (t
, NULL_TREE
))
17017 if (complain
& tf_error
)
17018 error ("%qT is a variably modified type", t
);
17022 /* Class template and alias template arguments should be OK. */
17023 else if (DECL_TYPE_TEMPLATE_P (t
))
17025 /* A non-type argument of integral or enumerated type must be a
17027 else if (TREE_TYPE (t
)
17028 && INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (t
))
17029 && !REFERENCE_REF_P (t
)
17030 && !TREE_CONSTANT (t
))
17032 if (complain
& tf_error
)
17033 error ("integral expression %qE is not constant", t
);
17040 check_instantiated_args (tree tmpl
, tree args
, tsubst_flags_t complain
)
17042 int ix
, len
= DECL_NTPARMS (tmpl
);
17043 bool result
= false;
17045 for (ix
= 0; ix
!= len
; ix
++)
17047 if (check_instantiated_arg (tmpl
, TREE_VEC_ELT (args
, ix
), complain
))
17050 if (result
&& (complain
& tf_error
))
17051 error (" trying to instantiate %qD", tmpl
);
17055 /* We're out of SFINAE context now, so generate diagnostics for the access
17056 errors we saw earlier when instantiating D from TMPL and ARGS. */
17059 recheck_decl_substitution (tree d
, tree tmpl
, tree args
)
17061 tree pattern
= DECL_TEMPLATE_RESULT (tmpl
);
17062 tree type
= TREE_TYPE (pattern
);
17063 location_t loc
= input_location
;
17065 push_access_scope (d
);
17066 push_deferring_access_checks (dk_no_deferred
);
17067 input_location
= DECL_SOURCE_LOCATION (pattern
);
17068 tsubst (type
, args
, tf_warning_or_error
, d
);
17069 input_location
= loc
;
17070 pop_deferring_access_checks ();
17071 pop_access_scope (d
);
17074 /* Instantiate the indicated variable, function, or alias template TMPL with
17075 the template arguments in TARG_PTR. */
17078 instantiate_template_1 (tree tmpl
, tree orig_args
, tsubst_flags_t complain
)
17080 tree targ_ptr
= orig_args
;
17084 bool access_ok
= true;
17086 if (tmpl
== error_mark_node
)
17087 return error_mark_node
;
17089 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
);
17091 /* If this function is a clone, handle it specially. */
17092 if (DECL_CLONED_FUNCTION_P (tmpl
))
17097 /* Use DECL_ABSTRACT_ORIGIN because only FUNCTION_DECLs have
17098 DECL_CLONED_FUNCTION. */
17099 spec
= instantiate_template (DECL_ABSTRACT_ORIGIN (tmpl
),
17100 targ_ptr
, complain
);
17101 if (spec
== error_mark_node
)
17102 return error_mark_node
;
17104 /* Look for the clone. */
17105 FOR_EACH_CLONE (clone
, spec
)
17106 if (DECL_NAME (clone
) == DECL_NAME (tmpl
))
17108 /* We should always have found the clone by now. */
17109 gcc_unreachable ();
17113 if (targ_ptr
== error_mark_node
)
17114 return error_mark_node
;
17116 /* Check to see if we already have this specialization. */
17117 gen_tmpl
= most_general_template (tmpl
);
17118 if (tmpl
!= gen_tmpl
)
17119 /* The TMPL is a partial instantiation. To get a full set of
17120 arguments we must add the arguments used to perform the
17121 partial instantiation. */
17122 targ_ptr
= add_outermost_template_args (DECL_TI_ARGS (tmpl
),
17125 /* It would be nice to avoid hashing here and then again in tsubst_decl,
17126 but it doesn't seem to be on the hot path. */
17127 spec
= retrieve_specialization (gen_tmpl
, targ_ptr
, 0);
17129 gcc_assert (tmpl
== gen_tmpl
17130 || ((fndecl
= retrieve_specialization (tmpl
, orig_args
, 0))
17132 || fndecl
== NULL_TREE
);
17134 if (spec
!= NULL_TREE
)
17136 if (FNDECL_HAS_ACCESS_ERRORS (spec
))
17138 if (complain
& tf_error
)
17139 recheck_decl_substitution (spec
, gen_tmpl
, targ_ptr
);
17140 return error_mark_node
;
17145 if (check_instantiated_args (gen_tmpl
, INNERMOST_TEMPLATE_ARGS (targ_ptr
),
17147 return error_mark_node
;
17149 /* We are building a FUNCTION_DECL, during which the access of its
17150 parameters and return types have to be checked. However this
17151 FUNCTION_DECL which is the desired context for access checking
17152 is not built yet. We solve this chicken-and-egg problem by
17153 deferring all checks until we have the FUNCTION_DECL. */
17154 push_deferring_access_checks (dk_deferred
);
17156 /* Instantiation of the function happens in the context of the function
17157 template, not the context of the overload resolution we're doing. */
17158 push_to_top_level ();
17159 /* If there are dependent arguments, e.g. because we're doing partial
17160 ordering, make sure processing_template_decl stays set. */
17161 if (uses_template_parms (targ_ptr
))
17162 ++processing_template_decl
;
17163 if (DECL_CLASS_SCOPE_P (gen_tmpl
))
17165 tree ctx
= tsubst_aggr_type (DECL_CONTEXT (gen_tmpl
), targ_ptr
,
17166 complain
, gen_tmpl
, true);
17167 push_nested_class (ctx
);
17170 tree pattern
= DECL_TEMPLATE_RESULT (gen_tmpl
);
17172 if (VAR_P (pattern
))
17174 /* We need to determine if we're using a partial or explicit
17175 specialization now, because the type of the variable could be
17177 tree tid
= lookup_template_variable (gen_tmpl
, targ_ptr
);
17178 tree elt
= most_specialized_partial_spec (tid
, complain
);
17179 if (elt
== error_mark_node
)
17180 pattern
= error_mark_node
;
17183 tmpl
= TREE_VALUE (elt
);
17184 pattern
= DECL_TEMPLATE_RESULT (tmpl
);
17185 targ_ptr
= TREE_PURPOSE (elt
);
17189 /* Substitute template parameters to obtain the specialization. */
17190 fndecl
= tsubst (pattern
, targ_ptr
, complain
, gen_tmpl
);
17191 if (DECL_CLASS_SCOPE_P (gen_tmpl
))
17192 pop_nested_class ();
17193 pop_from_top_level ();
17195 if (fndecl
== error_mark_node
)
17197 pop_deferring_access_checks ();
17198 return error_mark_node
;
17201 /* The DECL_TI_TEMPLATE should always be the immediate parent
17202 template, not the most general template. */
17203 DECL_TI_TEMPLATE (fndecl
) = tmpl
;
17204 DECL_TI_ARGS (fndecl
) = targ_ptr
;
17206 /* Now we know the specialization, compute access previously
17208 push_access_scope (fndecl
);
17209 if (!perform_deferred_access_checks (complain
))
17211 pop_access_scope (fndecl
);
17212 pop_deferring_access_checks ();
17214 /* If we've just instantiated the main entry point for a function,
17215 instantiate all the alternate entry points as well. We do this
17216 by cloning the instantiation of the main entry point, not by
17217 instantiating the template clones. */
17218 if (DECL_CHAIN (gen_tmpl
) && DECL_CLONED_FUNCTION_P (DECL_CHAIN (gen_tmpl
)))
17219 clone_function_decl (fndecl
, /*update_method_vec_p=*/0);
17223 if (!(complain
& tf_error
))
17225 /* Remember to reinstantiate when we're out of SFINAE so the user
17226 can see the errors. */
17227 FNDECL_HAS_ACCESS_ERRORS (fndecl
) = true;
17229 return error_mark_node
;
17234 /* Wrapper for instantiate_template_1. */
17237 instantiate_template (tree tmpl
, tree orig_args
, tsubst_flags_t complain
)
17240 timevar_push (TV_TEMPLATE_INST
);
17241 ret
= instantiate_template_1 (tmpl
, orig_args
, complain
);
17242 timevar_pop (TV_TEMPLATE_INST
);
17246 /* Instantiate the alias template TMPL with ARGS. Also push a template
17247 instantiation level, which instantiate_template doesn't do because
17248 functions and variables have sufficient context established by the
17252 instantiate_alias_template (tree tmpl
, tree args
, tsubst_flags_t complain
)
17254 struct pending_template
*old_last_pend
= last_pending_template
;
17255 struct tinst_level
*old_error_tinst
= last_error_tinst_level
;
17256 if (tmpl
== error_mark_node
|| args
== error_mark_node
)
17257 return error_mark_node
;
17258 tree tinst
= build_tree_list (tmpl
, args
);
17259 if (!push_tinst_level (tinst
))
17262 return error_mark_node
;
17266 coerce_innermost_template_parms (DECL_TEMPLATE_PARMS (tmpl
),
17267 args
, tmpl
, complain
,
17268 /*require_all_args=*/true,
17269 /*use_default_args=*/true);
17271 tree r
= instantiate_template (tmpl
, args
, complain
);
17272 pop_tinst_level ();
17273 /* We can't free this if a pending_template entry or last_error_tinst_level
17274 is pointing at it. */
17275 if (last_pending_template
== old_last_pend
17276 && last_error_tinst_level
== old_error_tinst
)
17282 /* PARM is a template parameter pack for FN. Returns true iff
17283 PARM is used in a deducible way in the argument list of FN. */
17286 pack_deducible_p (tree parm
, tree fn
)
17288 tree t
= FUNCTION_FIRST_USER_PARMTYPE (fn
);
17289 for (; t
; t
= TREE_CHAIN (t
))
17291 tree type
= TREE_VALUE (t
);
17293 if (!PACK_EXPANSION_P (type
))
17295 for (packs
= PACK_EXPANSION_PARAMETER_PACKS (type
);
17296 packs
; packs
= TREE_CHAIN (packs
))
17297 if (template_args_equal (TREE_VALUE (packs
), parm
))
17299 /* The template parameter pack is used in a function parameter
17300 pack. If this is the end of the parameter list, the
17301 template parameter pack is deducible. */
17302 if (TREE_CHAIN (t
) == void_list_node
)
17305 /* Otherwise, not. Well, it could be deduced from
17306 a non-pack parameter, but doing so would end up with
17307 a deduction mismatch, so don't bother. */
17311 /* The template parameter pack isn't used in any function parameter
17312 packs, but it might be used deeper, e.g. tuple<Args...>. */
17316 /* The FN is a TEMPLATE_DECL for a function. ARGS is an array with
17317 NARGS elements of the arguments that are being used when calling
17318 it. TARGS is a vector into which the deduced template arguments
17321 Returns either a FUNCTION_DECL for the matching specialization of FN or
17322 NULL_TREE if no suitable specialization can be found. If EXPLAIN_P is
17323 true, diagnostics will be printed to explain why it failed.
17325 If FN is a conversion operator, or we are trying to produce a specific
17326 specialization, RETURN_TYPE is the return type desired.
17328 The EXPLICIT_TARGS are explicit template arguments provided via a
17331 The parameter STRICT is one of:
17334 We are deducing arguments for a function call, as in
17335 [temp.deduct.call]. If RETURN_TYPE is non-null, we are
17336 deducing arguments for a call to the result of a conversion
17337 function template, as in [over.call.object].
17340 We are deducing arguments for a conversion function, as in
17341 [temp.deduct.conv].
17344 We are deducing arguments when doing an explicit instantiation
17345 as in [temp.explicit], when determining an explicit specialization
17346 as in [temp.expl.spec], or when taking the address of a function
17347 template, as in [temp.deduct.funcaddr]. */
17350 fn_type_unification (tree fn
,
17351 tree explicit_targs
,
17354 unsigned int nargs
,
17356 unification_kind_t strict
,
17363 tree decl
= NULL_TREE
;
17364 tsubst_flags_t complain
= (explain_p
? tf_warning_or_error
: tf_none
);
17366 static int deduction_depth
;
17367 struct pending_template
*old_last_pend
= last_pending_template
;
17368 struct tinst_level
*old_error_tinst
= last_error_tinst_level
;
17369 tree tparms
= DECL_INNERMOST_TEMPLATE_PARMS (fn
);
17371 tree r
= error_mark_node
;
17374 complain
|= tf_decltype
;
17376 /* In C++0x, it's possible to have a function template whose type depends
17377 on itself recursively. This is most obvious with decltype, but can also
17378 occur with enumeration scope (c++/48969). So we need to catch infinite
17379 recursion and reject the substitution at deduction time; this function
17380 will return error_mark_node for any repeated substitution.
17382 This also catches excessive recursion such as when f<N> depends on
17383 f<N-1> across all integers, and returns error_mark_node for all the
17384 substitutions back up to the initial one.
17386 This is, of course, not reentrant. */
17387 if (excessive_deduction_depth
)
17388 return error_mark_node
;
17389 tinst
= build_tree_list (fn
, NULL_TREE
);
17392 gcc_assert (TREE_CODE (fn
) == TEMPLATE_DECL
);
17394 fntype
= TREE_TYPE (fn
);
17395 if (explicit_targs
)
17399 The specified template arguments must match the template
17400 parameters in kind (i.e., type, nontype, template), and there
17401 must not be more arguments than there are parameters;
17402 otherwise type deduction fails.
17404 Nontype arguments must match the types of the corresponding
17405 nontype template parameters, or must be convertible to the
17406 types of the corresponding nontype parameters as specified in
17407 _temp.arg.nontype_, otherwise type deduction fails.
17409 All references in the function type of the function template
17410 to the corresponding template parameters are replaced by the
17411 specified template argument values. If a substitution in a
17412 template parameter or in the function type of the function
17413 template results in an invalid type, type deduction fails. */
17414 int i
, len
= TREE_VEC_LENGTH (tparms
);
17415 location_t loc
= input_location
;
17416 bool incomplete
= false;
17418 /* Adjust any explicit template arguments before entering the
17419 substitution context. */
17421 = (coerce_template_parms (tparms
, explicit_targs
, NULL_TREE
,
17423 /*require_all_args=*/false,
17424 /*use_default_args=*/false));
17425 if (explicit_targs
== error_mark_node
)
17428 /* Substitute the explicit args into the function type. This is
17429 necessary so that, for instance, explicitly declared function
17430 arguments can match null pointed constants. If we were given
17431 an incomplete set of explicit args, we must not do semantic
17432 processing during substitution as we could create partial
17434 for (i
= 0; i
< len
; i
++)
17436 tree parm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
17437 bool parameter_pack
= false;
17438 tree targ
= TREE_VEC_ELT (explicit_targs
, i
);
17440 /* Dig out the actual parm. */
17441 if (TREE_CODE (parm
) == TYPE_DECL
17442 || TREE_CODE (parm
) == TEMPLATE_DECL
)
17444 parm
= TREE_TYPE (parm
);
17445 parameter_pack
= TEMPLATE_TYPE_PARAMETER_PACK (parm
);
17447 else if (TREE_CODE (parm
) == PARM_DECL
)
17449 parm
= DECL_INITIAL (parm
);
17450 parameter_pack
= TEMPLATE_PARM_PARAMETER_PACK (parm
);
17453 if (!parameter_pack
&& targ
== NULL_TREE
)
17454 /* No explicit argument for this template parameter. */
17457 if (parameter_pack
&& pack_deducible_p (parm
, fn
))
17459 /* Mark the argument pack as "incomplete". We could
17460 still deduce more arguments during unification.
17461 We remove this mark in type_unification_real. */
17464 ARGUMENT_PACK_INCOMPLETE_P(targ
) = 1;
17465 ARGUMENT_PACK_EXPLICIT_ARGS (targ
)
17466 = ARGUMENT_PACK_ARGS (targ
);
17469 /* We have some incomplete argument packs. */
17474 TREE_VALUE (tinst
) = explicit_targs
;
17475 if (!push_tinst_level (tinst
))
17477 excessive_deduction_depth
= true;
17480 processing_template_decl
+= incomplete
;
17481 input_location
= DECL_SOURCE_LOCATION (fn
);
17482 /* Ignore any access checks; we'll see them again in
17483 instantiate_template and they might have the wrong
17484 access path at this point. */
17485 push_deferring_access_checks (dk_deferred
);
17486 fntype
= tsubst (TREE_TYPE (fn
), explicit_targs
,
17487 complain
| tf_partial
, NULL_TREE
);
17488 pop_deferring_access_checks ();
17489 input_location
= loc
;
17490 processing_template_decl
-= incomplete
;
17491 pop_tinst_level ();
17493 if (fntype
== error_mark_node
)
17496 /* Place the explicitly specified arguments in TARGS. */
17497 for (i
= NUM_TMPL_ARGS (explicit_targs
); i
--;)
17498 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (explicit_targs
, i
);
17501 /* Never do unification on the 'this' parameter. */
17502 parms
= skip_artificial_parms_for (fn
, TYPE_ARG_TYPES (fntype
));
17504 if (return_type
&& strict
== DEDUCE_CALL
)
17506 /* We're deducing for a call to the result of a template conversion
17507 function. The parms we really want are in return_type. */
17508 if (POINTER_TYPE_P (return_type
))
17509 return_type
= TREE_TYPE (return_type
);
17510 parms
= TYPE_ARG_TYPES (return_type
);
17512 else if (return_type
)
17516 parms
= tree_cons (NULL_TREE
, TREE_TYPE (fntype
), parms
);
17517 new_args
= XALLOCAVEC (tree
, nargs
+ 1);
17518 new_args
[0] = return_type
;
17519 memcpy (new_args
+ 1, args
, nargs
* sizeof (tree
));
17524 /* We allow incomplete unification without an error message here
17525 because the standard doesn't seem to explicitly prohibit it. Our
17526 callers must be ready to deal with unification failures in any
17529 TREE_VALUE (tinst
) = targs
;
17530 /* If we aren't explaining yet, push tinst context so we can see where
17531 any errors (e.g. from class instantiations triggered by instantiation
17532 of default template arguments) come from. If we are explaining, this
17533 context is redundant. */
17534 if (!explain_p
&& !push_tinst_level (tinst
))
17536 excessive_deduction_depth
= true;
17540 /* type_unification_real will pass back any access checks from default
17541 template argument substitution. */
17542 vec
<deferred_access_check
, va_gc
> *checks
;
17545 ok
= !type_unification_real (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
17546 targs
, parms
, args
, nargs
, /*subr=*/0,
17547 strict
, flags
, &checks
, explain_p
);
17549 pop_tinst_level ();
17553 /* Now that we have bindings for all of the template arguments,
17554 ensure that the arguments deduced for the template template
17555 parameters have compatible template parameter lists. We cannot
17556 check this property before we have deduced all template
17557 arguments, because the template parameter types of a template
17558 template parameter might depend on prior template parameters
17559 deduced after the template template parameter. The following
17560 ill-formed example illustrates this issue:
17562 template<typename T, template<T> class C> void f(C<5>, T);
17564 template<int N> struct X {};
17567 f(X<5>(), 5l); // error: template argument deduction fails
17570 The template parameter list of 'C' depends on the template type
17571 parameter 'T', but 'C' is deduced to 'X' before 'T' is deduced to
17572 'long'. Thus, we can't check that 'C' cannot bind to 'X' at the
17573 time that we deduce 'C'. */
17574 if (!template_template_parm_bindings_ok_p
17575 (DECL_INNERMOST_TEMPLATE_PARMS (fn
), targs
))
17577 unify_inconsistent_template_template_parameters (explain_p
);
17581 /* All is well so far. Now, check:
17585 When all template arguments have been deduced, all uses of
17586 template parameters in nondeduced contexts are replaced with
17587 the corresponding deduced argument values. If the
17588 substitution results in an invalid type, as described above,
17589 type deduction fails. */
17590 TREE_VALUE (tinst
) = targs
;
17591 if (!push_tinst_level (tinst
))
17593 excessive_deduction_depth
= true;
17597 /* Also collect access checks from the instantiation. */
17598 reopen_deferring_access_checks (checks
);
17600 decl
= instantiate_template (fn
, targs
, complain
);
17602 checks
= get_deferred_access_checks ();
17603 pop_deferring_access_checks ();
17605 pop_tinst_level ();
17607 if (decl
== error_mark_node
)
17610 /* Now perform any access checks encountered during substitution. */
17611 push_access_scope (decl
);
17612 ok
= perform_access_checks (checks
, complain
);
17613 pop_access_scope (decl
);
17617 /* If we're looking for an exact match, check that what we got
17618 is indeed an exact match. It might not be if some template
17619 parameters are used in non-deduced contexts. But don't check
17620 for an exact match if we have dependent template arguments;
17621 in that case we're doing partial ordering, and we already know
17622 that we have two candidates that will provide the actual type. */
17623 if (strict
== DEDUCE_EXACT
&& !any_dependent_template_arguments_p (targs
))
17625 tree substed
= TREE_TYPE (decl
);
17629 = skip_artificial_parms_for (decl
, TYPE_ARG_TYPES (substed
));
17631 sarg
= tree_cons (NULL_TREE
, TREE_TYPE (substed
), sarg
);
17632 for (i
= 0; i
< nargs
&& sarg
; ++i
, sarg
= TREE_CHAIN (sarg
))
17633 if (!same_type_p (args
[i
], TREE_VALUE (sarg
)))
17635 unify_type_mismatch (explain_p
, args
[i
],
17636 TREE_VALUE (sarg
));
17645 if (excessive_deduction_depth
)
17647 if (deduction_depth
== 0)
17648 /* Reset once we're all the way out. */
17649 excessive_deduction_depth
= false;
17652 /* We can't free this if a pending_template entry or last_error_tinst_level
17653 is pointing at it. */
17654 if (last_pending_template
== old_last_pend
17655 && last_error_tinst_level
== old_error_tinst
)
17661 /* Adjust types before performing type deduction, as described in
17662 [temp.deduct.call] and [temp.deduct.conv]. The rules in these two
17663 sections are symmetric. PARM is the type of a function parameter
17664 or the return type of the conversion function. ARG is the type of
17665 the argument passed to the call, or the type of the value
17666 initialized with the result of the conversion function.
17667 ARG_EXPR is the original argument expression, which may be null. */
17670 maybe_adjust_types_for_deduction (unification_kind_t strict
,
17683 /* Swap PARM and ARG throughout the remainder of this
17684 function; the handling is precisely symmetric since PARM
17685 will initialize ARG rather than vice versa. */
17686 std::swap (parm
, arg
);
17690 /* Core issue #873: Do the DR606 thing (see below) for these cases,
17691 too, but here handle it by stripping the reference from PARM
17692 rather than by adding it to ARG. */
17693 if (TREE_CODE (*parm
) == REFERENCE_TYPE
17694 && TYPE_REF_IS_RVALUE (*parm
)
17695 && TREE_CODE (TREE_TYPE (*parm
)) == TEMPLATE_TYPE_PARM
17696 && cp_type_quals (TREE_TYPE (*parm
)) == TYPE_UNQUALIFIED
17697 && TREE_CODE (*arg
) == REFERENCE_TYPE
17698 && !TYPE_REF_IS_RVALUE (*arg
))
17699 *parm
= TREE_TYPE (*parm
);
17700 /* Nothing else to do in this case. */
17704 gcc_unreachable ();
17707 if (TREE_CODE (*parm
) != REFERENCE_TYPE
)
17709 /* [temp.deduct.call]
17711 If P is not a reference type:
17713 --If A is an array type, the pointer type produced by the
17714 array-to-pointer standard conversion (_conv.array_) is
17715 used in place of A for type deduction; otherwise,
17717 --If A is a function type, the pointer type produced by
17718 the function-to-pointer standard conversion
17719 (_conv.func_) is used in place of A for type deduction;
17722 --If A is a cv-qualified type, the top level
17723 cv-qualifiers of A's type are ignored for type
17725 if (TREE_CODE (*arg
) == ARRAY_TYPE
)
17726 *arg
= build_pointer_type (TREE_TYPE (*arg
));
17727 else if (TREE_CODE (*arg
) == FUNCTION_TYPE
)
17728 *arg
= build_pointer_type (*arg
);
17730 *arg
= TYPE_MAIN_VARIANT (*arg
);
17733 /* From C++0x [14.8.2.1/3 temp.deduct.call] (after DR606), "If P is
17734 of the form T&&, where T is a template parameter, and the argument
17735 is an lvalue, T is deduced as A& */
17736 if (TREE_CODE (*parm
) == REFERENCE_TYPE
17737 && TYPE_REF_IS_RVALUE (*parm
)
17738 && TREE_CODE (TREE_TYPE (*parm
)) == TEMPLATE_TYPE_PARM
17739 && cp_type_quals (TREE_TYPE (*parm
)) == TYPE_UNQUALIFIED
17740 && (arg_expr
? real_lvalue_p (arg_expr
)
17741 /* try_one_overload doesn't provide an arg_expr, but
17742 functions are always lvalues. */
17743 : TREE_CODE (*arg
) == FUNCTION_TYPE
))
17744 *arg
= build_reference_type (*arg
);
17746 /* [temp.deduct.call]
17748 If P is a cv-qualified type, the top level cv-qualifiers
17749 of P's type are ignored for type deduction. If P is a
17750 reference type, the type referred to by P is used for
17752 *parm
= TYPE_MAIN_VARIANT (*parm
);
17753 if (TREE_CODE (*parm
) == REFERENCE_TYPE
)
17755 *parm
= TREE_TYPE (*parm
);
17756 result
|= UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
17759 /* DR 322. For conversion deduction, remove a reference type on parm
17760 too (which has been swapped into ARG). */
17761 if (strict
== DEDUCE_CONV
&& TREE_CODE (*arg
) == REFERENCE_TYPE
)
17762 *arg
= TREE_TYPE (*arg
);
17767 /* Subroutine of unify_one_argument. PARM is a function parameter of a
17768 template which does contain any deducible template parameters; check if
17769 ARG is a suitable match for it. STRICT, FLAGS and EXPLAIN_P are as in
17770 unify_one_argument. */
17773 check_non_deducible_conversion (tree parm
, tree arg
, int strict
,
17774 int flags
, bool explain_p
)
17779 type
= TREE_TYPE (arg
);
17783 if (same_type_p (parm
, type
))
17784 return unify_success (explain_p
);
17786 if (strict
== DEDUCE_CONV
)
17788 if (can_convert_arg (type
, parm
, NULL_TREE
, flags
,
17789 explain_p
? tf_warning_or_error
: tf_none
))
17790 return unify_success (explain_p
);
17792 else if (strict
!= DEDUCE_EXACT
)
17794 if (can_convert_arg (parm
, type
,
17795 TYPE_P (arg
) ? NULL_TREE
: arg
,
17796 flags
, explain_p
? tf_warning_or_error
: tf_none
))
17797 return unify_success (explain_p
);
17800 if (strict
== DEDUCE_EXACT
)
17801 return unify_type_mismatch (explain_p
, parm
, arg
);
17803 return unify_arg_conversion (explain_p
, parm
, type
, arg
);
17806 static bool uses_deducible_template_parms (tree type
);
17808 /* Returns true iff the expression EXPR is one from which a template
17809 argument can be deduced. In other words, if it's an undecorated
17810 use of a template non-type parameter. */
17813 deducible_expression (tree expr
)
17815 return (TREE_CODE (expr
) == TEMPLATE_PARM_INDEX
);
17818 /* Returns true iff the array domain DOMAIN uses a template parameter in a
17819 deducible way; that is, if it has a max value of <PARM> - 1. */
17822 deducible_array_bound (tree domain
)
17824 if (domain
== NULL_TREE
)
17827 tree max
= TYPE_MAX_VALUE (domain
);
17828 if (TREE_CODE (max
) != MINUS_EXPR
)
17831 return deducible_expression (TREE_OPERAND (max
, 0));
17834 /* Returns true iff the template arguments ARGS use a template parameter
17835 in a deducible way. */
17838 deducible_template_args (tree args
)
17840 for (int i
= 0; i
< TREE_VEC_LENGTH (args
); ++i
)
17843 tree elt
= TREE_VEC_ELT (args
, i
);
17844 if (ARGUMENT_PACK_P (elt
))
17845 deducible
= deducible_template_args (ARGUMENT_PACK_ARGS (elt
));
17848 if (PACK_EXPANSION_P (elt
))
17849 elt
= PACK_EXPANSION_PATTERN (elt
);
17850 if (TREE_CODE (elt
) == TEMPLATE_TEMPLATE_PARM
)
17852 else if (TYPE_P (elt
))
17853 deducible
= uses_deducible_template_parms (elt
);
17855 deducible
= deducible_expression (elt
);
17863 /* Returns true iff TYPE contains any deducible references to template
17864 parameters, as per 14.8.2.5. */
17867 uses_deducible_template_parms (tree type
)
17869 if (PACK_EXPANSION_P (type
))
17870 type
= PACK_EXPANSION_PATTERN (type
);
17877 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
17878 || TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
17884 if (POINTER_TYPE_P (type
))
17885 return uses_deducible_template_parms (TREE_TYPE (type
));
17887 /* T[integer-constant ]
17889 if (TREE_CODE (type
) == ARRAY_TYPE
)
17890 return (uses_deducible_template_parms (TREE_TYPE (type
))
17891 || deducible_array_bound (TYPE_DOMAIN (type
)));
17903 if (TYPE_PTRMEM_P (type
))
17904 return (uses_deducible_template_parms (TYPE_PTRMEM_CLASS_TYPE (type
))
17905 || (uses_deducible_template_parms
17906 (TYPE_PTRMEM_POINTED_TO_TYPE (type
))));
17908 /* template-name <T> (where template-name refers to a class template)
17909 template-name <i> (where template-name refers to a class template) */
17910 if (CLASS_TYPE_P (type
)
17911 && CLASSTYPE_TEMPLATE_INFO (type
)
17912 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (type
)))
17913 return deducible_template_args (INNERMOST_TEMPLATE_ARGS
17914 (CLASSTYPE_TI_ARGS (type
)));
17919 if (TREE_CODE (type
) == FUNCTION_TYPE
17920 || TREE_CODE (type
) == METHOD_TYPE
)
17922 if (uses_deducible_template_parms (TREE_TYPE (type
)))
17924 tree parm
= TYPE_ARG_TYPES (type
);
17925 if (TREE_CODE (type
) == METHOD_TYPE
)
17926 parm
= TREE_CHAIN (parm
);
17927 for (; parm
; parm
= TREE_CHAIN (parm
))
17928 if (uses_deducible_template_parms (TREE_VALUE (parm
)))
17935 /* Subroutine of type_unification_real and unify_pack_expansion to
17936 handle unification of a single P/A pair. Parameters are as
17937 for those functions. */
17940 unify_one_argument (tree tparms
, tree targs
, tree parm
, tree arg
,
17941 int subr
, unification_kind_t strict
,
17944 tree arg_expr
= NULL_TREE
;
17947 if (arg
== error_mark_node
|| parm
== error_mark_node
)
17948 return unify_invalid (explain_p
);
17949 if (arg
== unknown_type_node
)
17950 /* We can't deduce anything from this, but we might get all the
17951 template args from other function args. */
17952 return unify_success (explain_p
);
17954 /* Implicit conversions (Clause 4) will be performed on a function
17955 argument to convert it to the type of the corresponding function
17956 parameter if the parameter type contains no template-parameters that
17957 participate in template argument deduction. */
17958 if (strict
!= DEDUCE_EXACT
17959 && TYPE_P (parm
) && !uses_deducible_template_parms (parm
))
17960 /* For function parameters with no deducible template parameters,
17961 just return. We'll check non-dependent conversions later. */
17962 return unify_success (explain_p
);
17967 arg_strict
= (UNIFY_ALLOW_OUTER_LEVEL
17968 | UNIFY_ALLOW_MORE_CV_QUAL
17969 | UNIFY_ALLOW_DERIVED
);
17973 arg_strict
= UNIFY_ALLOW_LESS_CV_QUAL
;
17977 arg_strict
= UNIFY_ALLOW_NONE
;
17981 gcc_unreachable ();
17984 /* We only do these transformations if this is the top-level
17985 parameter_type_list in a call or declaration matching; in other
17986 situations (nested function declarators, template argument lists) we
17987 won't be comparing a type to an expression, and we don't do any type
17993 gcc_assert (TREE_TYPE (arg
) != NULL_TREE
);
17994 if (type_unknown_p (arg
))
17996 /* [temp.deduct.type] A template-argument can be
17997 deduced from a pointer to function or pointer
17998 to member function argument if the set of
17999 overloaded functions does not contain function
18000 templates and at most one of a set of
18001 overloaded functions provides a unique
18004 if (resolve_overloaded_unification
18005 (tparms
, targs
, parm
, arg
, strict
,
18006 arg_strict
, explain_p
))
18007 return unify_success (explain_p
);
18008 return unify_overload_resolution_failure (explain_p
, arg
);
18012 arg
= unlowered_expr_type (arg
);
18013 if (arg
== error_mark_node
)
18014 return unify_invalid (explain_p
);
18018 maybe_adjust_types_for_deduction (strict
, &parm
, &arg
, arg_expr
);
18021 if ((TYPE_P (parm
) || TREE_CODE (parm
) == TEMPLATE_DECL
)
18022 != (TYPE_P (arg
) || TREE_CODE (arg
) == TEMPLATE_DECL
))
18023 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
18025 /* For deduction from an init-list we need the actual list. */
18026 if (arg_expr
&& BRACE_ENCLOSED_INITIALIZER_P (arg_expr
))
18028 return unify (tparms
, targs
, parm
, arg
, arg_strict
, explain_p
);
18031 /* Most parms like fn_type_unification.
18033 If SUBR is 1, we're being called recursively (to unify the
18034 arguments of a function or method parameter of a function
18037 CHECKS is a pointer to a vector of access checks encountered while
18038 substituting default template arguments. */
18041 type_unification_real (tree tparms
,
18045 unsigned int xnargs
,
18047 unification_kind_t strict
,
18049 vec
<deferred_access_check
, va_gc
> **checks
,
18054 int ntparms
= TREE_VEC_LENGTH (tparms
);
18055 int saw_undeduced
= 0;
18058 unsigned int nargs
;
18061 gcc_assert (TREE_CODE (tparms
) == TREE_VEC
);
18062 gcc_assert (xparms
== NULL_TREE
|| TREE_CODE (xparms
) == TREE_LIST
);
18063 gcc_assert (ntparms
> 0);
18065 /* Reset the number of non-defaulted template arguments contained
18067 NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
) = NULL_TREE
;
18075 while (parms
&& parms
!= void_list_node
18078 parm
= TREE_VALUE (parms
);
18080 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
18081 && (!TREE_CHAIN (parms
) || TREE_CHAIN (parms
) == void_list_node
))
18082 /* For a function parameter pack that occurs at the end of the
18083 parameter-declaration-list, the type A of each remaining
18084 argument of the call is compared with the type P of the
18085 declarator-id of the function parameter pack. */
18088 parms
= TREE_CHAIN (parms
);
18090 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
)
18091 /* For a function parameter pack that does not occur at the
18092 end of the parameter-declaration-list, the type of the
18093 parameter pack is a non-deduced context. */
18099 if (unify_one_argument (tparms
, targs
, parm
, arg
, subr
, strict
,
18105 && parms
!= void_list_node
18106 && TREE_CODE (TREE_VALUE (parms
)) == TYPE_PACK_EXPANSION
)
18108 /* Unify the remaining arguments with the pack expansion type. */
18110 tree parmvec
= make_tree_vec (1);
18112 /* Allocate a TREE_VEC and copy in all of the arguments */
18113 argvec
= make_tree_vec (nargs
- ia
);
18114 for (i
= 0; ia
< nargs
; ++ia
, ++i
)
18115 TREE_VEC_ELT (argvec
, i
) = args
[ia
];
18117 /* Copy the parameter into parmvec. */
18118 TREE_VEC_ELT (parmvec
, 0) = TREE_VALUE (parms
);
18119 if (unify_pack_expansion (tparms
, targs
, parmvec
, argvec
, strict
,
18120 /*subr=*/subr
, explain_p
))
18123 /* Advance to the end of the list of parameters. */
18124 parms
= TREE_CHAIN (parms
);
18127 /* Fail if we've reached the end of the parm list, and more args
18128 are present, and the parm list isn't variadic. */
18129 if (ia
< nargs
&& parms
== void_list_node
)
18130 return unify_too_many_arguments (explain_p
, nargs
, ia
);
18131 /* Fail if parms are left and they don't have default values and
18132 they aren't all deduced as empty packs (c++/57397). This is
18133 consistent with sufficient_parms_p. */
18134 if (parms
&& parms
!= void_list_node
18135 && TREE_PURPOSE (parms
) == NULL_TREE
)
18137 unsigned int count
= nargs
;
18142 type_pack_p
= TREE_CODE (TREE_VALUE (p
)) == TYPE_PACK_EXPANSION
;
18145 p
= TREE_CHAIN (p
);
18147 while (p
&& p
!= void_list_node
);
18148 if (count
!= nargs
)
18149 return unify_too_few_arguments (explain_p
, ia
, count
,
18155 tsubst_flags_t complain
= (explain_p
18156 ? tf_warning_or_error
18159 for (i
= 0; i
< ntparms
; i
++)
18161 tree targ
= TREE_VEC_ELT (targs
, i
);
18162 tree tparm
= TREE_VEC_ELT (tparms
, i
);
18164 /* Clear the "incomplete" flags on all argument packs now so that
18165 substituting them into later default arguments works. */
18166 if (targ
&& ARGUMENT_PACK_P (targ
))
18168 ARGUMENT_PACK_INCOMPLETE_P (targ
) = 0;
18169 ARGUMENT_PACK_EXPLICIT_ARGS (targ
) = NULL_TREE
;
18172 if (targ
|| tparm
== error_mark_node
)
18174 tparm
= TREE_VALUE (tparm
);
18176 /* If this is an undeduced nontype parameter that depends on
18177 a type parameter, try another pass; its type may have been
18178 deduced from a later argument than the one from which
18179 this parameter can be deduced. */
18180 if (TREE_CODE (tparm
) == PARM_DECL
18181 && uses_template_parms (TREE_TYPE (tparm
))
18182 && saw_undeduced
< 2)
18188 /* Core issue #226 (C++0x) [temp.deduct]:
18190 If a template argument has not been deduced, its
18191 default template argument, if any, is used.
18193 When we are in C++98 mode, TREE_PURPOSE will either
18194 be NULL_TREE or ERROR_MARK_NODE, so we do not need
18195 to explicitly check cxx_dialect here. */
18196 if (TREE_PURPOSE (TREE_VEC_ELT (tparms
, i
)))
18197 /* OK, there is a default argument. Wait until after the
18198 conversion check to do substitution. */
18201 /* If the type parameter is a parameter pack, then it will
18202 be deduced to an empty parameter pack. */
18203 if (template_parameter_pack_p (tparm
))
18207 if (TREE_CODE (tparm
) == TEMPLATE_PARM_INDEX
)
18209 arg
= make_node (NONTYPE_ARGUMENT_PACK
);
18210 TREE_TYPE (arg
) = TREE_TYPE (TEMPLATE_PARM_DECL (tparm
));
18211 TREE_CONSTANT (arg
) = 1;
18214 arg
= cxx_make_type (TYPE_ARGUMENT_PACK
);
18216 SET_ARGUMENT_PACK_ARGS (arg
, make_tree_vec (0));
18218 TREE_VEC_ELT (targs
, i
) = arg
;
18222 return unify_parameter_deduction_failure (explain_p
, tparm
);
18225 /* DR 1391: All parameters have args, now check non-dependent parms for
18227 if (saw_undeduced
< 2)
18228 for (ia
= 0, parms
= xparms
, args
= xargs
, nargs
= xnargs
;
18229 parms
&& parms
!= void_list_node
&& ia
< nargs
; )
18231 parm
= TREE_VALUE (parms
);
18233 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
18234 && (!TREE_CHAIN (parms
)
18235 || TREE_CHAIN (parms
) == void_list_node
))
18236 /* For a function parameter pack that occurs at the end of the
18237 parameter-declaration-list, the type A of each remaining
18238 argument of the call is compared with the type P of the
18239 declarator-id of the function parameter pack. */
18242 parms
= TREE_CHAIN (parms
);
18244 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
)
18245 /* For a function parameter pack that does not occur at the
18246 end of the parameter-declaration-list, the type of the
18247 parameter pack is a non-deduced context. */
18253 if (uses_template_parms (parm
))
18255 if (check_non_deducible_conversion (parm
, arg
, strict
, flags
,
18260 /* Now substitute into the default template arguments. */
18261 for (i
= 0; i
< ntparms
; i
++)
18263 tree targ
= TREE_VEC_ELT (targs
, i
);
18264 tree tparm
= TREE_VEC_ELT (tparms
, i
);
18266 if (targ
|| tparm
== error_mark_node
)
18268 tree parm
= TREE_VALUE (tparm
);
18270 if (TREE_CODE (parm
) == PARM_DECL
18271 && uses_template_parms (TREE_TYPE (parm
))
18272 && saw_undeduced
< 2)
18275 tree arg
= TREE_PURPOSE (tparm
);
18276 reopen_deferring_access_checks (*checks
);
18277 location_t save_loc
= input_location
;
18279 input_location
= DECL_SOURCE_LOCATION (parm
);
18280 arg
= tsubst_template_arg (arg
, targs
, complain
, NULL_TREE
);
18281 arg
= convert_template_argument (parm
, arg
, targs
, complain
,
18283 input_location
= save_loc
;
18284 *checks
= get_deferred_access_checks ();
18285 pop_deferring_access_checks ();
18286 if (arg
== error_mark_node
)
18290 TREE_VEC_ELT (targs
, i
) = arg
;
18291 /* The position of the first default template argument,
18292 is also the number of non-defaulted arguments in TARGS.
18294 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
))
18295 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
, i
);
18300 if (saw_undeduced
++ == 1)
18304 if (CHECKING_P
&& !NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
))
18305 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
, TREE_VEC_LENGTH (targs
));
18307 return unify_success (explain_p
);
18310 /* Subroutine of type_unification_real. Args are like the variables
18311 at the call site. ARG is an overloaded function (or template-id);
18312 we try deducing template args from each of the overloads, and if
18313 only one succeeds, we go with that. Modifies TARGS and returns
18314 true on success. */
18317 resolve_overloaded_unification (tree tparms
,
18321 unification_kind_t strict
,
18325 tree tempargs
= copy_node (targs
);
18327 tree goodfn
= NULL_TREE
;
18330 if (TREE_CODE (arg
) == ADDR_EXPR
)
18332 arg
= TREE_OPERAND (arg
, 0);
18338 if (TREE_CODE (arg
) == COMPONENT_REF
)
18339 /* Handle `&x' where `x' is some static or non-static member
18341 arg
= TREE_OPERAND (arg
, 1);
18343 if (TREE_CODE (arg
) == OFFSET_REF
)
18344 arg
= TREE_OPERAND (arg
, 1);
18346 /* Strip baselink information. */
18347 if (BASELINK_P (arg
))
18348 arg
= BASELINK_FUNCTIONS (arg
);
18350 if (TREE_CODE (arg
) == TEMPLATE_ID_EXPR
)
18352 /* If we got some explicit template args, we need to plug them into
18353 the affected templates before we try to unify, in case the
18354 explicit args will completely resolve the templates in question. */
18357 tree expl_subargs
= TREE_OPERAND (arg
, 1);
18358 arg
= TREE_OPERAND (arg
, 0);
18360 for (; arg
; arg
= OVL_NEXT (arg
))
18362 tree fn
= OVL_CURRENT (arg
);
18363 tree subargs
, elem
;
18365 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
18368 subargs
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
18369 expl_subargs
, NULL_TREE
, tf_none
,
18370 /*require_all_args=*/true,
18371 /*use_default_args=*/true);
18372 if (subargs
!= error_mark_node
18373 && !any_dependent_template_arguments_p (subargs
))
18375 elem
= TREE_TYPE (instantiate_template (fn
, subargs
, tf_none
));
18376 if (try_one_overload (tparms
, targs
, tempargs
, parm
,
18377 elem
, strict
, sub_strict
, addr_p
, explain_p
)
18378 && (!goodfn
|| !same_type_p (goodfn
, elem
)))
18387 /* If no templates (or more than one) are fully resolved by the
18388 explicit arguments, this template-id is a non-deduced context; it
18389 could still be OK if we deduce all template arguments for the
18390 enclosing call through other arguments. */
18394 else if (TREE_CODE (arg
) != OVERLOAD
18395 && TREE_CODE (arg
) != FUNCTION_DECL
)
18396 /* If ARG is, for example, "(0, &f)" then its type will be unknown
18397 -- but the deduction does not succeed because the expression is
18398 not just the function on its own. */
18401 for (; arg
; arg
= OVL_NEXT (arg
))
18402 if (try_one_overload (tparms
, targs
, tempargs
, parm
,
18403 TREE_TYPE (OVL_CURRENT (arg
)),
18404 strict
, sub_strict
, addr_p
, explain_p
)
18405 && (!goodfn
|| !decls_match (goodfn
, OVL_CURRENT (arg
))))
18407 goodfn
= OVL_CURRENT (arg
);
18411 /* [temp.deduct.type] A template-argument can be deduced from a pointer
18412 to function or pointer to member function argument if the set of
18413 overloaded functions does not contain function templates and at most
18414 one of a set of overloaded functions provides a unique match.
18416 So if we found multiple possibilities, we return success but don't
18417 deduce anything. */
18421 int i
= TREE_VEC_LENGTH (targs
);
18423 if (TREE_VEC_ELT (tempargs
, i
))
18425 tree old
= TREE_VEC_ELT (targs
, i
);
18426 tree new_
= TREE_VEC_ELT (tempargs
, i
);
18427 if (new_
&& old
&& ARGUMENT_PACK_P (old
)
18428 && ARGUMENT_PACK_EXPLICIT_ARGS (old
))
18429 /* Don't forget explicit template arguments in a pack. */
18430 ARGUMENT_PACK_EXPLICIT_ARGS (new_
)
18431 = ARGUMENT_PACK_EXPLICIT_ARGS (old
);
18432 TREE_VEC_ELT (targs
, i
) = new_
;
18441 /* Core DR 115: In contexts where deduction is done and fails, or in
18442 contexts where deduction is not done, if a template argument list is
18443 specified and it, along with any default template arguments, identifies
18444 a single function template specialization, then the template-id is an
18445 lvalue for the function template specialization. */
18448 resolve_nondeduced_context (tree orig_expr
)
18450 tree expr
, offset
, baselink
;
18453 if (!type_unknown_p (orig_expr
))
18458 offset
= NULL_TREE
;
18459 baselink
= NULL_TREE
;
18461 if (TREE_CODE (expr
) == ADDR_EXPR
)
18463 expr
= TREE_OPERAND (expr
, 0);
18466 if (TREE_CODE (expr
) == OFFSET_REF
)
18469 expr
= TREE_OPERAND (expr
, 1);
18471 if (BASELINK_P (expr
))
18474 expr
= BASELINK_FUNCTIONS (expr
);
18477 if (TREE_CODE (expr
) == TEMPLATE_ID_EXPR
)
18480 tree goodfn
= NULL_TREE
;
18482 /* If we got some explicit template args, we need to plug them into
18483 the affected templates before we try to unify, in case the
18484 explicit args will completely resolve the templates in question. */
18486 tree expl_subargs
= TREE_OPERAND (expr
, 1);
18487 tree arg
= TREE_OPERAND (expr
, 0);
18488 tree badfn
= NULL_TREE
;
18489 tree badargs
= NULL_TREE
;
18491 for (; arg
; arg
= OVL_NEXT (arg
))
18493 tree fn
= OVL_CURRENT (arg
);
18494 tree subargs
, elem
;
18496 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
18499 subargs
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
18500 expl_subargs
, NULL_TREE
, tf_none
,
18501 /*require_all_args=*/true,
18502 /*use_default_args=*/true);
18503 if (subargs
!= error_mark_node
18504 && !any_dependent_template_arguments_p (subargs
))
18506 elem
= instantiate_template (fn
, subargs
, tf_none
);
18507 if (elem
== error_mark_node
)
18512 else if (elem
&& (!goodfn
|| !decls_match (goodfn
, elem
)))
18521 mark_used (goodfn
);
18524 expr
= build_baselink (BASELINK_BINFO (baselink
),
18525 BASELINK_ACCESS_BINFO (baselink
),
18526 expr
, BASELINK_OPTYPE (baselink
));
18530 = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (offset
, 0)));
18531 expr
= build_offset_ref (base
, expr
, addr
, tf_warning_or_error
);
18534 expr
= cp_build_addr_expr (expr
, tf_warning_or_error
);
18537 else if (good
== 0 && badargs
)
18538 /* There were no good options and at least one bad one, so let the
18539 user know what the problem is. */
18540 instantiate_template (badfn
, badargs
, tf_warning_or_error
);
18545 /* Subroutine of resolve_overloaded_unification; does deduction for a single
18546 overload. Fills TARGS with any deduced arguments, or error_mark_node if
18547 different overloads deduce different arguments for a given parm.
18548 ADDR_P is true if the expression for which deduction is being
18549 performed was of the form "& fn" rather than simply "fn".
18551 Returns 1 on success. */
18554 try_one_overload (tree tparms
,
18559 unification_kind_t strict
,
18568 if (arg
== error_mark_node
)
18571 /* [temp.deduct.type] A template-argument can be deduced from a pointer
18572 to function or pointer to member function argument if the set of
18573 overloaded functions does not contain function templates and at most
18574 one of a set of overloaded functions provides a unique match.
18576 So if this is a template, just return success. */
18578 if (uses_template_parms (arg
))
18581 if (TREE_CODE (arg
) == METHOD_TYPE
)
18582 arg
= build_ptrmemfunc_type (build_pointer_type (arg
));
18584 arg
= build_pointer_type (arg
);
18586 sub_strict
|= maybe_adjust_types_for_deduction (strict
, &parm
, &arg
, NULL
);
18588 /* We don't copy orig_targs for this because if we have already deduced
18589 some template args from previous args, unify would complain when we
18590 try to deduce a template parameter for the same argument, even though
18591 there isn't really a conflict. */
18592 nargs
= TREE_VEC_LENGTH (targs
);
18593 tempargs
= make_tree_vec (nargs
);
18595 if (unify (tparms
, tempargs
, parm
, arg
, sub_strict
, explain_p
))
18598 /* First make sure we didn't deduce anything that conflicts with
18599 explicitly specified args. */
18600 for (i
= nargs
; i
--; )
18602 tree elt
= TREE_VEC_ELT (tempargs
, i
);
18603 tree oldelt
= TREE_VEC_ELT (orig_targs
, i
);
18607 else if (uses_template_parms (elt
))
18608 /* Since we're unifying against ourselves, we will fill in
18609 template args used in the function parm list with our own
18610 template parms. Discard them. */
18611 TREE_VEC_ELT (tempargs
, i
) = NULL_TREE
;
18612 else if (oldelt
&& !template_args_equal (oldelt
, elt
))
18616 for (i
= nargs
; i
--; )
18618 tree elt
= TREE_VEC_ELT (tempargs
, i
);
18621 TREE_VEC_ELT (targs
, i
) = elt
;
18627 /* PARM is a template class (perhaps with unbound template
18628 parameters). ARG is a fully instantiated type. If ARG can be
18629 bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and
18630 TARGS are as for unify. */
18633 try_class_unification (tree tparms
, tree targs
, tree parm
, tree arg
,
18636 tree copy_of_targs
;
18638 if (!CLASSTYPE_TEMPLATE_INFO (arg
)
18639 || (most_general_template (CLASSTYPE_TI_TEMPLATE (arg
))
18640 != most_general_template (CLASSTYPE_TI_TEMPLATE (parm
))))
18643 /* We need to make a new template argument vector for the call to
18644 unify. If we used TARGS, we'd clutter it up with the result of
18645 the attempted unification, even if this class didn't work out.
18646 We also don't want to commit ourselves to all the unifications
18647 we've already done, since unification is supposed to be done on
18648 an argument-by-argument basis. In other words, consider the
18649 following pathological case:
18651 template <int I, int J, int K>
18654 template <int I, int J>
18655 struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {};
18657 template <int I, int J, int K>
18658 void f(S<I, J, K>, S<I, I, I>);
18667 Now, by the time we consider the unification involving `s2', we
18668 already know that we must have `f<0, 0, 0>'. But, even though
18669 `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is invalid
18670 because there are two ways to unify base classes of S<0, 1, 2>
18671 with S<I, I, I>. If we kept the already deduced knowledge, we
18672 would reject the possibility I=1. */
18673 copy_of_targs
= make_tree_vec (TREE_VEC_LENGTH (targs
));
18675 /* If unification failed, we're done. */
18676 if (unify (tparms
, copy_of_targs
, CLASSTYPE_TI_ARGS (parm
),
18677 CLASSTYPE_TI_ARGS (arg
), UNIFY_ALLOW_NONE
, explain_p
))
18683 /* Given a template type PARM and a class type ARG, find the unique
18684 base type in ARG that is an instance of PARM. We do not examine
18685 ARG itself; only its base-classes. If there is not exactly one
18686 appropriate base class, return NULL_TREE. PARM may be the type of
18687 a partial specialization, as well as a plain template type. Used
18690 static enum template_base_result
18691 get_template_base (tree tparms
, tree targs
, tree parm
, tree arg
,
18692 bool explain_p
, tree
*result
)
18694 tree rval
= NULL_TREE
;
18697 gcc_assert (RECORD_OR_UNION_CODE_P (TREE_CODE (arg
)));
18699 binfo
= TYPE_BINFO (complete_type (arg
));
18702 /* The type could not be completed. */
18703 *result
= NULL_TREE
;
18704 return tbr_incomplete_type
;
18707 /* Walk in inheritance graph order. The search order is not
18708 important, and this avoids multiple walks of virtual bases. */
18709 for (binfo
= TREE_CHAIN (binfo
); binfo
; binfo
= TREE_CHAIN (binfo
))
18711 tree r
= try_class_unification (tparms
, targs
, parm
,
18712 BINFO_TYPE (binfo
), explain_p
);
18716 /* If there is more than one satisfactory baseclass, then:
18720 If they yield more than one possible deduced A, the type
18724 if (rval
&& !same_type_p (r
, rval
))
18726 *result
= NULL_TREE
;
18727 return tbr_ambiguous_baseclass
;
18735 return tbr_success
;
18738 /* Returns the level of DECL, which declares a template parameter. */
18741 template_decl_level (tree decl
)
18743 switch (TREE_CODE (decl
))
18746 case TEMPLATE_DECL
:
18747 return TEMPLATE_TYPE_LEVEL (TREE_TYPE (decl
));
18750 return TEMPLATE_PARM_LEVEL (DECL_INITIAL (decl
));
18753 gcc_unreachable ();
18758 /* Decide whether ARG can be unified with PARM, considering only the
18759 cv-qualifiers of each type, given STRICT as documented for unify.
18760 Returns nonzero iff the unification is OK on that basis. */
18763 check_cv_quals_for_unify (int strict
, tree arg
, tree parm
)
18765 int arg_quals
= cp_type_quals (arg
);
18766 int parm_quals
= cp_type_quals (parm
);
18768 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
18769 && !(strict
& UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
18771 /* Although a CVR qualifier is ignored when being applied to a
18772 substituted template parameter ([8.3.2]/1 for example), that
18773 does not allow us to unify "const T" with "int&" because both
18774 types are not of the form "cv-list T" [14.8.2.5 temp.deduct.type].
18775 It is ok when we're allowing additional CV qualifiers
18776 at the outer level [14.8.2.1]/3,1st bullet. */
18777 if ((TREE_CODE (arg
) == REFERENCE_TYPE
18778 || TREE_CODE (arg
) == FUNCTION_TYPE
18779 || TREE_CODE (arg
) == METHOD_TYPE
)
18780 && (parm_quals
& (TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
)))
18783 if ((!POINTER_TYPE_P (arg
) && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
)
18784 && (parm_quals
& TYPE_QUAL_RESTRICT
))
18788 if (!(strict
& (UNIFY_ALLOW_MORE_CV_QUAL
| UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
18789 && (arg_quals
& parm_quals
) != parm_quals
)
18792 if (!(strict
& (UNIFY_ALLOW_LESS_CV_QUAL
| UNIFY_ALLOW_OUTER_LESS_CV_QUAL
))
18793 && (parm_quals
& arg_quals
) != arg_quals
)
18799 /* Determines the LEVEL and INDEX for the template parameter PARM. */
18801 template_parm_level_and_index (tree parm
, int* level
, int* index
)
18803 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
18804 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
18805 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
18807 *index
= TEMPLATE_TYPE_IDX (parm
);
18808 *level
= TEMPLATE_TYPE_LEVEL (parm
);
18812 *index
= TEMPLATE_PARM_IDX (parm
);
18813 *level
= TEMPLATE_PARM_LEVEL (parm
);
18817 #define RECUR_AND_CHECK_FAILURE(TP, TA, P, A, S, EP) \
18819 if (unify (TP, TA, P, A, S, EP)) \
18823 /* Unifies the remaining arguments in PACKED_ARGS with the pack
18824 expansion at the end of PACKED_PARMS. Returns 0 if the type
18825 deduction succeeds, 1 otherwise. STRICT is the same as in
18826 unify. CALL_ARGS_P is true iff PACKED_ARGS is actually a function
18827 call argument list. We'll need to adjust the arguments to make them
18828 types. SUBR tells us if this is from a recursive call to
18829 type_unification_real, or for comparing two template argument
18833 unify_pack_expansion (tree tparms
, tree targs
, tree packed_parms
,
18834 tree packed_args
, unification_kind_t strict
,
18835 bool subr
, bool explain_p
)
18838 = TREE_VEC_ELT (packed_parms
, TREE_VEC_LENGTH (packed_parms
) - 1);
18839 tree pattern
= PACK_EXPANSION_PATTERN (parm
);
18840 tree pack
, packs
= NULL_TREE
;
18841 int i
, start
= TREE_VEC_LENGTH (packed_parms
) - 1;
18843 packed_args
= expand_template_argument_pack (packed_args
);
18845 int len
= TREE_VEC_LENGTH (packed_args
);
18847 /* Determine the parameter packs we will be deducing from the
18848 pattern, and record their current deductions. */
18849 for (pack
= PACK_EXPANSION_PARAMETER_PACKS (parm
);
18850 pack
; pack
= TREE_CHAIN (pack
))
18852 tree parm_pack
= TREE_VALUE (pack
);
18855 /* Determine the index and level of this parameter pack. */
18856 template_parm_level_and_index (parm_pack
, &level
, &idx
);
18858 /* Keep track of the parameter packs and their corresponding
18860 packs
= tree_cons (parm_pack
, TMPL_ARG (targs
, level
, idx
), packs
);
18861 TREE_TYPE (packs
) = make_tree_vec (len
- start
);
18864 /* Loop through all of the arguments that have not yet been
18865 unified and unify each with the pattern. */
18866 for (i
= start
; i
< len
; i
++)
18869 bool any_explicit
= false;
18870 tree arg
= TREE_VEC_ELT (packed_args
, i
);
18872 /* For each parameter pack, set its TMPL_ARG to either NULL_TREE
18873 or the element of its argument pack at the current index if
18874 this argument was explicitly specified. */
18875 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
18879 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
18882 if (TREE_VALUE (pack
)
18883 && (pargs
= ARGUMENT_PACK_EXPLICIT_ARGS (TREE_VALUE (pack
)))
18884 && (i
- start
< TREE_VEC_LENGTH (pargs
)))
18886 any_explicit
= true;
18887 arg
= TREE_VEC_ELT (pargs
, i
- start
);
18889 TMPL_ARG (targs
, level
, idx
) = arg
;
18892 /* If we had explicit template arguments, substitute them into the
18893 pattern before deduction. */
18896 /* Some arguments might still be unspecified or dependent. */
18898 ++processing_template_decl
;
18899 dependent
= any_dependent_template_arguments_p (targs
);
18901 --processing_template_decl
;
18902 parm
= tsubst (pattern
, targs
,
18903 explain_p
? tf_warning_or_error
: tf_none
,
18906 --processing_template_decl
;
18907 if (parm
== error_mark_node
)
18913 /* Unify the pattern with the current argument. */
18914 if (unify_one_argument (tparms
, targs
, parm
, arg
, subr
, strict
,
18918 /* For each parameter pack, collect the deduced value. */
18919 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
18922 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
18924 TREE_VEC_ELT (TREE_TYPE (pack
), i
- start
) =
18925 TMPL_ARG (targs
, level
, idx
);
18929 /* Verify that the results of unification with the parameter packs
18930 produce results consistent with what we've seen before, and make
18931 the deduced argument packs available. */
18932 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
18934 tree old_pack
= TREE_VALUE (pack
);
18935 tree new_args
= TREE_TYPE (pack
);
18936 int i
, len
= TREE_VEC_LENGTH (new_args
);
18938 bool nondeduced_p
= false;
18940 /* By default keep the original deduced argument pack.
18941 If necessary, more specific code is going to update the
18942 resulting deduced argument later down in this function. */
18943 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
18944 TMPL_ARG (targs
, level
, idx
) = old_pack
;
18946 /* If NEW_ARGS contains any NULL_TREE entries, we didn't
18947 actually deduce anything. */
18948 for (i
= 0; i
< len
&& !nondeduced_p
; ++i
)
18949 if (TREE_VEC_ELT (new_args
, i
) == NULL_TREE
)
18950 nondeduced_p
= true;
18954 if (old_pack
&& ARGUMENT_PACK_INCOMPLETE_P (old_pack
))
18956 /* If we had fewer function args than explicit template args,
18957 just use the explicits. */
18958 tree explicit_args
= ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
);
18959 int explicit_len
= TREE_VEC_LENGTH (explicit_args
);
18960 if (len
< explicit_len
)
18961 new_args
= explicit_args
;
18967 /* Build the deduced *_ARGUMENT_PACK. */
18968 if (TREE_CODE (TREE_PURPOSE (pack
)) == TEMPLATE_PARM_INDEX
)
18970 result
= make_node (NONTYPE_ARGUMENT_PACK
);
18971 TREE_TYPE (result
) =
18972 TREE_TYPE (TEMPLATE_PARM_DECL (TREE_PURPOSE (pack
)));
18973 TREE_CONSTANT (result
) = 1;
18976 result
= cxx_make_type (TYPE_ARGUMENT_PACK
);
18978 SET_ARGUMENT_PACK_ARGS (result
, new_args
);
18980 /* Note the deduced argument packs for this parameter
18982 TMPL_ARG (targs
, level
, idx
) = result
;
18984 else if (ARGUMENT_PACK_INCOMPLETE_P (old_pack
)
18985 && (ARGUMENT_PACK_ARGS (old_pack
)
18986 == ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
)))
18988 /* We only had the explicitly-provided arguments before, but
18989 now we have a complete set of arguments. */
18990 tree explicit_args
= ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
);
18992 SET_ARGUMENT_PACK_ARGS (old_pack
, new_args
);
18993 ARGUMENT_PACK_INCOMPLETE_P (old_pack
) = 1;
18994 ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
) = explicit_args
;
18998 tree bad_old_arg
= NULL_TREE
, bad_new_arg
= NULL_TREE
;
18999 tree old_args
= ARGUMENT_PACK_ARGS (old_pack
);
19001 if (!comp_template_args_with_info (old_args
, new_args
,
19002 &bad_old_arg
, &bad_new_arg
))
19003 /* Inconsistent unification of this parameter pack. */
19004 return unify_parameter_pack_inconsistent (explain_p
,
19010 return unify_success (explain_p
);
19013 /* Handle unification of the domain of an array. PARM_DOM and ARG_DOM are
19014 INTEGER_TYPEs representing the TYPE_DOMAIN of ARRAY_TYPEs. The other
19015 parameters and return value are as for unify. */
19018 unify_array_domain (tree tparms
, tree targs
,
19019 tree parm_dom
, tree arg_dom
,
19027 /* Our representation of array types uses "N - 1" as the
19028 TYPE_MAX_VALUE for an array with "N" elements, if "N" is
19029 not an integer constant. We cannot unify arbitrarily
19030 complex expressions, so we eliminate the MINUS_EXPRs
19032 parm_max
= TYPE_MAX_VALUE (parm_dom
);
19033 parm_cst
= TREE_CODE (parm_max
) == INTEGER_CST
;
19036 gcc_assert (TREE_CODE (parm_max
) == MINUS_EXPR
);
19037 parm_max
= TREE_OPERAND (parm_max
, 0);
19039 arg_max
= TYPE_MAX_VALUE (arg_dom
);
19040 arg_cst
= TREE_CODE (arg_max
) == INTEGER_CST
;
19043 /* The ARG_MAX may not be a simple MINUS_EXPR, if we are
19044 trying to unify the type of a variable with the type
19045 of a template parameter. For example:
19047 template <unsigned int N>
19048 void f (char (&) [N]);
19055 Here, the type of the ARG will be "int [g(i)]", and
19056 may be a SAVE_EXPR, etc. */
19057 if (TREE_CODE (arg_max
) != MINUS_EXPR
)
19058 return unify_vla_arg (explain_p
, arg_dom
);
19059 arg_max
= TREE_OPERAND (arg_max
, 0);
19062 /* If only one of the bounds used a MINUS_EXPR, compensate
19063 by adding one to the other bound. */
19064 if (parm_cst
&& !arg_cst
)
19065 parm_max
= fold_build2_loc (input_location
, PLUS_EXPR
,
19069 else if (arg_cst
&& !parm_cst
)
19070 arg_max
= fold_build2_loc (input_location
, PLUS_EXPR
,
19075 return unify (tparms
, targs
, parm_max
, arg_max
,
19076 UNIFY_ALLOW_INTEGER
, explain_p
);
19079 /* Deduce the value of template parameters. TPARMS is the (innermost)
19080 set of template parameters to a template. TARGS is the bindings
19081 for those template parameters, as determined thus far; TARGS may
19082 include template arguments for outer levels of template parameters
19083 as well. PARM is a parameter to a template function, or a
19084 subcomponent of that parameter; ARG is the corresponding argument.
19085 This function attempts to match PARM with ARG in a manner
19086 consistent with the existing assignments in TARGS. If more values
19087 are deduced, then TARGS is updated.
19089 Returns 0 if the type deduction succeeds, 1 otherwise. The
19090 parameter STRICT is a bitwise or of the following flags:
19093 Require an exact match between PARM and ARG.
19094 UNIFY_ALLOW_MORE_CV_QUAL:
19095 Allow the deduced ARG to be more cv-qualified (by qualification
19096 conversion) than ARG.
19097 UNIFY_ALLOW_LESS_CV_QUAL:
19098 Allow the deduced ARG to be less cv-qualified than ARG.
19099 UNIFY_ALLOW_DERIVED:
19100 Allow the deduced ARG to be a template base class of ARG,
19101 or a pointer to a template base class of the type pointed to by
19103 UNIFY_ALLOW_INTEGER:
19104 Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX
19105 case for more information.
19106 UNIFY_ALLOW_OUTER_LEVEL:
19107 This is the outermost level of a deduction. Used to determine validity
19108 of qualification conversions. A valid qualification conversion must
19109 have const qualified pointers leading up to the inner type which
19110 requires additional CV quals, except at the outer level, where const
19111 is not required [conv.qual]. It would be normal to set this flag in
19112 addition to setting UNIFY_ALLOW_MORE_CV_QUAL.
19113 UNIFY_ALLOW_OUTER_MORE_CV_QUAL:
19114 This is the outermost level of a deduction, and PARM can be more CV
19115 qualified at this point.
19116 UNIFY_ALLOW_OUTER_LESS_CV_QUAL:
19117 This is the outermost level of a deduction, and PARM can be less CV
19118 qualified at this point. */
19121 unify (tree tparms
, tree targs
, tree parm
, tree arg
, int strict
,
19127 int strict_in
= strict
;
19129 /* I don't think this will do the right thing with respect to types.
19130 But the only case I've seen it in so far has been array bounds, where
19131 signedness is the only information lost, and I think that will be
19133 while (TREE_CODE (parm
) == NOP_EXPR
)
19134 parm
= TREE_OPERAND (parm
, 0);
19136 if (arg
== error_mark_node
)
19137 return unify_invalid (explain_p
);
19138 if (arg
== unknown_type_node
19139 || arg
== init_list_type_node
)
19140 /* We can't deduce anything from this, but we might get all the
19141 template args from other function args. */
19142 return unify_success (explain_p
);
19144 /* If PARM uses template parameters, then we can't bail out here,
19145 even if ARG == PARM, since we won't record unifications for the
19146 template parameters. We might need them if we're trying to
19147 figure out which of two things is more specialized. */
19148 if (arg
== parm
&& !uses_template_parms (parm
))
19149 return unify_success (explain_p
);
19151 /* Handle init lists early, so the rest of the function can assume
19152 we're dealing with a type. */
19153 if (BRACE_ENCLOSED_INITIALIZER_P (arg
))
19157 tree orig_parm
= parm
;
19159 /* Replace T with std::initializer_list<T> for deduction. */
19160 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
19161 && flag_deduce_init_list
)
19162 parm
= listify (parm
);
19164 if (!is_std_init_list (parm
)
19165 && TREE_CODE (parm
) != ARRAY_TYPE
)
19166 /* We can only deduce from an initializer list argument if the
19167 parameter is std::initializer_list or an array; otherwise this
19168 is a non-deduced context. */
19169 return unify_success (explain_p
);
19171 if (TREE_CODE (parm
) == ARRAY_TYPE
)
19172 elttype
= TREE_TYPE (parm
);
19175 elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (parm
), 0);
19176 /* Deduction is defined in terms of a single type, so just punt
19177 on the (bizarre) std::initializer_list<T...>. */
19178 if (PACK_EXPANSION_P (elttype
))
19179 return unify_success (explain_p
);
19182 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (arg
), i
, elt
)
19184 int elt_strict
= strict
;
19186 if (elt
== error_mark_node
)
19187 return unify_invalid (explain_p
);
19189 if (!BRACE_ENCLOSED_INITIALIZER_P (elt
))
19191 tree type
= TREE_TYPE (elt
);
19192 if (type
== error_mark_node
)
19193 return unify_invalid (explain_p
);
19194 /* It should only be possible to get here for a call. */
19195 gcc_assert (elt_strict
& UNIFY_ALLOW_OUTER_LEVEL
);
19196 elt_strict
|= maybe_adjust_types_for_deduction
19197 (DEDUCE_CALL
, &elttype
, &type
, elt
);
19201 RECUR_AND_CHECK_FAILURE (tparms
, targs
, elttype
, elt
, elt_strict
,
19205 if (TREE_CODE (parm
) == ARRAY_TYPE
19206 && deducible_array_bound (TYPE_DOMAIN (parm
)))
19208 /* Also deduce from the length of the initializer list. */
19209 tree max
= size_int (CONSTRUCTOR_NELTS (arg
));
19210 tree idx
= compute_array_index_type (NULL_TREE
, max
, tf_none
);
19211 if (idx
== error_mark_node
)
19212 return unify_invalid (explain_p
);
19213 return unify_array_domain (tparms
, targs
, TYPE_DOMAIN (parm
),
19217 /* If the std::initializer_list<T> deduction worked, replace the
19218 deduced A with std::initializer_list<A>. */
19219 if (orig_parm
!= parm
)
19221 idx
= TEMPLATE_TYPE_IDX (orig_parm
);
19222 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
19223 targ
= listify (targ
);
19224 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = targ
;
19226 return unify_success (explain_p
);
19229 /* Immediately reject some pairs that won't unify because of
19230 cv-qualification mismatches. */
19231 if (TREE_CODE (arg
) == TREE_CODE (parm
)
19233 /* It is the elements of the array which hold the cv quals of an array
19234 type, and the elements might be template type parms. We'll check
19235 when we recurse. */
19236 && TREE_CODE (arg
) != ARRAY_TYPE
19237 /* We check the cv-qualifiers when unifying with template type
19238 parameters below. We want to allow ARG `const T' to unify with
19239 PARM `T' for example, when computing which of two templates
19240 is more specialized, for example. */
19241 && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
19242 && !check_cv_quals_for_unify (strict_in
, arg
, parm
))
19243 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
19245 if (!(strict
& UNIFY_ALLOW_OUTER_LEVEL
)
19246 && TYPE_P (parm
) && !CP_TYPE_CONST_P (parm
))
19247 strict
&= ~UNIFY_ALLOW_MORE_CV_QUAL
;
19248 strict
&= ~UNIFY_ALLOW_OUTER_LEVEL
;
19249 strict
&= ~UNIFY_ALLOW_DERIVED
;
19250 strict
&= ~UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
19251 strict
&= ~UNIFY_ALLOW_OUTER_LESS_CV_QUAL
;
19253 switch (TREE_CODE (parm
))
19255 case TYPENAME_TYPE
:
19257 case UNBOUND_CLASS_TEMPLATE
:
19258 /* In a type which contains a nested-name-specifier, template
19259 argument values cannot be deduced for template parameters used
19260 within the nested-name-specifier. */
19261 return unify_success (explain_p
);
19263 case TEMPLATE_TYPE_PARM
:
19264 case TEMPLATE_TEMPLATE_PARM
:
19265 case BOUND_TEMPLATE_TEMPLATE_PARM
:
19266 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
19267 if (error_operand_p (tparm
))
19268 return unify_invalid (explain_p
);
19270 if (TEMPLATE_TYPE_LEVEL (parm
)
19271 != template_decl_level (tparm
))
19272 /* The PARM is not one we're trying to unify. Just check
19273 to see if it matches ARG. */
19275 if (TREE_CODE (arg
) == TREE_CODE (parm
)
19276 && (is_auto (parm
) ? is_auto (arg
)
19277 : same_type_p (parm
, arg
)))
19278 return unify_success (explain_p
);
19280 return unify_type_mismatch (explain_p
, parm
, arg
);
19282 idx
= TEMPLATE_TYPE_IDX (parm
);
19283 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
19284 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, idx
));
19285 if (error_operand_p (tparm
))
19286 return unify_invalid (explain_p
);
19288 /* Check for mixed types and values. */
19289 if ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
19290 && TREE_CODE (tparm
) != TYPE_DECL
)
19291 || (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
19292 && TREE_CODE (tparm
) != TEMPLATE_DECL
))
19293 gcc_unreachable ();
19295 if (TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
19297 /* ARG must be constructed from a template class or a template
19298 template parameter. */
19299 if (TREE_CODE (arg
) != BOUND_TEMPLATE_TEMPLATE_PARM
19300 && !CLASSTYPE_SPECIALIZATION_OF_PRIMARY_TEMPLATE_P (arg
))
19301 return unify_template_deduction_failure (explain_p
, parm
, arg
);
19303 tree parmvec
= TYPE_TI_ARGS (parm
);
19304 /* An alias template name is never deduced. */
19305 if (TYPE_ALIAS_P (arg
))
19306 arg
= strip_typedefs (arg
);
19307 tree argvec
= INNERMOST_TEMPLATE_ARGS (TYPE_TI_ARGS (arg
));
19308 tree full_argvec
= add_to_template_args (targs
, argvec
);
19310 = DECL_INNERMOST_TEMPLATE_PARMS
19311 (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (parm
));
19313 int parm_variadic_p
= 0;
19315 /* The resolution to DR150 makes clear that default
19316 arguments for an N-argument may not be used to bind T
19317 to a template template parameter with fewer than N
19318 parameters. It is not safe to permit the binding of
19319 default arguments as an extension, as that may change
19320 the meaning of a conforming program. Consider:
19322 struct Dense { static const unsigned int dim = 1; };
19324 template <template <typename> class View,
19326 void operator+(float, View<Block> const&);
19328 template <typename Block,
19329 unsigned int Dim = Block::dim>
19330 struct Lvalue_proxy { operator float() const; };
19334 Lvalue_proxy<Dense> p;
19339 Here, if Lvalue_proxy is permitted to bind to View, then
19340 the global operator+ will be used; if they are not, the
19341 Lvalue_proxy will be converted to float. */
19342 if (coerce_template_parms (parm_parms
,
19344 TYPE_TI_TEMPLATE (parm
),
19346 ? tf_warning_or_error
19348 /*require_all_args=*/true,
19349 /*use_default_args=*/false)
19350 == error_mark_node
)
19353 /* Deduce arguments T, i from TT<T> or TT<i>.
19354 We check each element of PARMVEC and ARGVEC individually
19355 rather than the whole TREE_VEC since they can have
19356 different number of elements. */
19358 parmvec
= expand_template_argument_pack (parmvec
);
19359 argvec
= expand_template_argument_pack (argvec
);
19361 len
= TREE_VEC_LENGTH (parmvec
);
19363 /* Check if the parameters end in a pack, making them
19366 && PACK_EXPANSION_P (TREE_VEC_ELT (parmvec
, len
- 1)))
19367 parm_variadic_p
= 1;
19369 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
19370 /* If the template argument list of P contains a pack
19371 expansion that is not the last template argument, the
19372 entire template argument list is a non-deduced
19374 if (PACK_EXPANSION_P (TREE_VEC_ELT (parmvec
, i
)))
19375 return unify_success (explain_p
);
19377 if (TREE_VEC_LENGTH (argvec
) < len
- parm_variadic_p
)
19378 return unify_too_few_arguments (explain_p
,
19379 TREE_VEC_LENGTH (argvec
), len
);
19381 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
19383 RECUR_AND_CHECK_FAILURE (tparms
, targs
,
19384 TREE_VEC_ELT (parmvec
, i
),
19385 TREE_VEC_ELT (argvec
, i
),
19386 UNIFY_ALLOW_NONE
, explain_p
);
19389 if (parm_variadic_p
19390 && unify_pack_expansion (tparms
, targs
,
19393 /*subr=*/true, explain_p
))
19396 arg
= TYPE_TI_TEMPLATE (arg
);
19398 /* Fall through to deduce template name. */
19401 if (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
19402 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
19404 /* Deduce template name TT from TT, TT<>, TT<T> and TT<i>. */
19406 /* Simple cases: Value already set, does match or doesn't. */
19407 if (targ
!= NULL_TREE
&& template_args_equal (targ
, arg
))
19408 return unify_success (explain_p
);
19410 return unify_inconsistency (explain_p
, parm
, targ
, arg
);
19414 /* If PARM is `const T' and ARG is only `int', we don't have
19415 a match unless we are allowing additional qualification.
19416 If ARG is `const int' and PARM is just `T' that's OK;
19417 that binds `const int' to `T'. */
19418 if (!check_cv_quals_for_unify (strict_in
| UNIFY_ALLOW_LESS_CV_QUAL
,
19420 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
19422 /* Consider the case where ARG is `const volatile int' and
19423 PARM is `const T'. Then, T should be `volatile int'. */
19424 arg
= cp_build_qualified_type_real
19425 (arg
, cp_type_quals (arg
) & ~cp_type_quals (parm
), tf_none
);
19426 if (arg
== error_mark_node
)
19427 return unify_invalid (explain_p
);
19429 /* Simple cases: Value already set, does match or doesn't. */
19430 if (targ
!= NULL_TREE
&& same_type_p (targ
, arg
))
19431 return unify_success (explain_p
);
19433 return unify_inconsistency (explain_p
, parm
, targ
, arg
);
19435 /* Make sure that ARG is not a variable-sized array. (Note
19436 that were talking about variable-sized arrays (like
19437 `int[n]'), rather than arrays of unknown size (like
19438 `int[]').) We'll get very confused by such a type since
19439 the bound of the array is not constant, and therefore
19440 not mangleable. Besides, such types are not allowed in
19441 ISO C++, so we can do as we please here. We do allow
19442 them for 'auto' deduction, since that isn't ABI-exposed. */
19443 if (!is_auto (parm
) && variably_modified_type_p (arg
, NULL_TREE
))
19444 return unify_vla_arg (explain_p
, arg
);
19446 /* Strip typedefs as in convert_template_argument. */
19447 arg
= canonicalize_type_argument (arg
, tf_none
);
19450 /* If ARG is a parameter pack or an expansion, we cannot unify
19451 against it unless PARM is also a parameter pack. */
19452 if ((template_parameter_pack_p (arg
) || PACK_EXPANSION_P (arg
))
19453 && !template_parameter_pack_p (parm
))
19454 return unify_parameter_pack_mismatch (explain_p
, parm
, arg
);
19456 /* If the argument deduction results is a METHOD_TYPE,
19457 then there is a problem.
19458 METHOD_TYPE doesn't map to any real C++ type the result of
19459 the deduction can not be of that type. */
19460 if (TREE_CODE (arg
) == METHOD_TYPE
)
19461 return unify_method_type_error (explain_p
, arg
);
19463 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = arg
;
19464 return unify_success (explain_p
);
19466 case TEMPLATE_PARM_INDEX
:
19467 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
19468 if (error_operand_p (tparm
))
19469 return unify_invalid (explain_p
);
19471 if (TEMPLATE_PARM_LEVEL (parm
)
19472 != template_decl_level (tparm
))
19474 /* The PARM is not one we're trying to unify. Just check
19475 to see if it matches ARG. */
19476 int result
= !(TREE_CODE (arg
) == TREE_CODE (parm
)
19477 && cp_tree_equal (parm
, arg
));
19479 unify_expression_unequal (explain_p
, parm
, arg
);
19483 idx
= TEMPLATE_PARM_IDX (parm
);
19484 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
19488 int x
= !cp_tree_equal (targ
, arg
);
19490 unify_inconsistency (explain_p
, parm
, targ
, arg
);
19494 /* [temp.deduct.type] If, in the declaration of a function template
19495 with a non-type template-parameter, the non-type
19496 template-parameter is used in an expression in the function
19497 parameter-list and, if the corresponding template-argument is
19498 deduced, the template-argument type shall match the type of the
19499 template-parameter exactly, except that a template-argument
19500 deduced from an array bound may be of any integral type.
19501 The non-type parameter might use already deduced type parameters. */
19502 tparm
= tsubst (TREE_TYPE (parm
), targs
, 0, NULL_TREE
);
19503 if (!TREE_TYPE (arg
))
19504 /* Template-parameter dependent expression. Just accept it for now.
19505 It will later be processed in convert_template_argument. */
19507 else if (same_type_p (TREE_TYPE (arg
), tparm
))
19509 else if ((strict
& UNIFY_ALLOW_INTEGER
)
19510 && CP_INTEGRAL_TYPE_P (tparm
))
19511 /* Convert the ARG to the type of PARM; the deduced non-type
19512 template argument must exactly match the types of the
19513 corresponding parameter. */
19514 arg
= fold (build_nop (tparm
, arg
));
19515 else if (uses_template_parms (tparm
))
19516 /* We haven't deduced the type of this parameter yet. Try again
19518 return unify_success (explain_p
);
19520 return unify_type_mismatch (explain_p
, tparm
, TREE_TYPE (arg
));
19522 /* If ARG is a parameter pack or an expansion, we cannot unify
19523 against it unless PARM is also a parameter pack. */
19524 if ((template_parameter_pack_p (arg
) || PACK_EXPANSION_P (arg
))
19525 && !TEMPLATE_PARM_PARAMETER_PACK (parm
))
19526 return unify_parameter_pack_mismatch (explain_p
, parm
, arg
);
19529 bool removed_attr
= false;
19530 arg
= strip_typedefs_expr (arg
, &removed_attr
);
19532 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = arg
;
19533 return unify_success (explain_p
);
19537 /* A pointer-to-member constant can be unified only with
19538 another constant. */
19539 if (TREE_CODE (arg
) != PTRMEM_CST
)
19540 return unify_ptrmem_cst_mismatch (explain_p
, parm
, arg
);
19542 /* Just unify the class member. It would be useless (and possibly
19543 wrong, depending on the strict flags) to unify also
19544 PTRMEM_CST_CLASS, because we want to be sure that both parm and
19545 arg refer to the same variable, even if through different
19546 classes. For instance:
19548 struct A { int x; };
19551 Unification of &A::x and &B::x must succeed. */
19552 return unify (tparms
, targs
, PTRMEM_CST_MEMBER (parm
),
19553 PTRMEM_CST_MEMBER (arg
), strict
, explain_p
);
19558 if (!TYPE_PTR_P (arg
))
19559 return unify_type_mismatch (explain_p
, parm
, arg
);
19561 /* [temp.deduct.call]
19563 A can be another pointer or pointer to member type that can
19564 be converted to the deduced A via a qualification
19565 conversion (_conv.qual_).
19567 We pass down STRICT here rather than UNIFY_ALLOW_NONE.
19568 This will allow for additional cv-qualification of the
19569 pointed-to types if appropriate. */
19571 if (TREE_CODE (TREE_TYPE (arg
)) == RECORD_TYPE
)
19572 /* The derived-to-base conversion only persists through one
19573 level of pointers. */
19574 strict
|= (strict_in
& UNIFY_ALLOW_DERIVED
);
19576 return unify (tparms
, targs
, TREE_TYPE (parm
),
19577 TREE_TYPE (arg
), strict
, explain_p
);
19580 case REFERENCE_TYPE
:
19581 if (TREE_CODE (arg
) != REFERENCE_TYPE
)
19582 return unify_type_mismatch (explain_p
, parm
, arg
);
19583 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
19584 strict
& UNIFY_ALLOW_MORE_CV_QUAL
, explain_p
);
19587 if (TREE_CODE (arg
) != ARRAY_TYPE
)
19588 return unify_type_mismatch (explain_p
, parm
, arg
);
19589 if ((TYPE_DOMAIN (parm
) == NULL_TREE
)
19590 != (TYPE_DOMAIN (arg
) == NULL_TREE
))
19591 return unify_type_mismatch (explain_p
, parm
, arg
);
19592 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
19593 strict
& UNIFY_ALLOW_MORE_CV_QUAL
, explain_p
);
19594 if (TYPE_DOMAIN (parm
) != NULL_TREE
)
19595 return unify_array_domain (tparms
, targs
, TYPE_DOMAIN (parm
),
19596 TYPE_DOMAIN (arg
), explain_p
);
19597 return unify_success (explain_p
);
19604 case ENUMERAL_TYPE
:
19607 if (TREE_CODE (arg
) != TREE_CODE (parm
))
19608 return unify_type_mismatch (explain_p
, parm
, arg
);
19610 /* We have already checked cv-qualification at the top of the
19612 if (!same_type_ignoring_top_level_qualifiers_p (arg
, parm
))
19613 return unify_type_mismatch (explain_p
, parm
, arg
);
19615 /* As far as unification is concerned, this wins. Later checks
19616 will invalidate it if necessary. */
19617 return unify_success (explain_p
);
19619 /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */
19620 /* Type INTEGER_CST can come from ordinary constant template args. */
19622 while (TREE_CODE (arg
) == NOP_EXPR
)
19623 arg
= TREE_OPERAND (arg
, 0);
19625 if (TREE_CODE (arg
) != INTEGER_CST
)
19626 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
19627 return (tree_int_cst_equal (parm
, arg
)
19628 ? unify_success (explain_p
)
19629 : unify_template_argument_mismatch (explain_p
, parm
, arg
));
19633 int i
, len
, argslen
;
19634 int parm_variadic_p
= 0;
19636 if (TREE_CODE (arg
) != TREE_VEC
)
19637 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
19639 len
= TREE_VEC_LENGTH (parm
);
19640 argslen
= TREE_VEC_LENGTH (arg
);
19642 /* Check for pack expansions in the parameters. */
19643 for (i
= 0; i
< len
; ++i
)
19645 if (PACK_EXPANSION_P (TREE_VEC_ELT (parm
, i
)))
19648 /* We can unify against something with a trailing
19650 parm_variadic_p
= 1;
19652 /* [temp.deduct.type]/9: If the template argument list of
19653 P contains a pack expansion that is not the last
19654 template argument, the entire template argument list
19655 is a non-deduced context. */
19656 return unify_success (explain_p
);
19660 /* If we don't have enough arguments to satisfy the parameters
19661 (not counting the pack expression at the end), or we have
19662 too many arguments for a parameter list that doesn't end in
19663 a pack expression, we can't unify. */
19664 if (parm_variadic_p
19665 ? argslen
< len
- parm_variadic_p
19667 return unify_arity (explain_p
, TREE_VEC_LENGTH (arg
), len
);
19669 /* Unify all of the parameters that precede the (optional)
19670 pack expression. */
19671 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
19673 RECUR_AND_CHECK_FAILURE (tparms
, targs
,
19674 TREE_VEC_ELT (parm
, i
),
19675 TREE_VEC_ELT (arg
, i
),
19676 UNIFY_ALLOW_NONE
, explain_p
);
19678 if (parm_variadic_p
)
19679 return unify_pack_expansion (tparms
, targs
, parm
, arg
,
19681 /*subr=*/true, explain_p
);
19682 return unify_success (explain_p
);
19687 if (TREE_CODE (arg
) != TREE_CODE (parm
))
19688 return unify_type_mismatch (explain_p
, parm
, arg
);
19690 if (TYPE_PTRMEMFUNC_P (parm
))
19692 if (!TYPE_PTRMEMFUNC_P (arg
))
19693 return unify_type_mismatch (explain_p
, parm
, arg
);
19695 return unify (tparms
, targs
,
19696 TYPE_PTRMEMFUNC_FN_TYPE (parm
),
19697 TYPE_PTRMEMFUNC_FN_TYPE (arg
),
19698 strict
, explain_p
);
19700 else if (TYPE_PTRMEMFUNC_P (arg
))
19701 return unify_type_mismatch (explain_p
, parm
, arg
);
19703 if (CLASSTYPE_TEMPLATE_INFO (parm
))
19705 tree t
= NULL_TREE
;
19707 if (strict_in
& UNIFY_ALLOW_DERIVED
)
19709 /* First, we try to unify the PARM and ARG directly. */
19710 t
= try_class_unification (tparms
, targs
,
19711 parm
, arg
, explain_p
);
19715 /* Fallback to the special case allowed in
19716 [temp.deduct.call]:
19718 If P is a class, and P has the form
19719 template-id, then A can be a derived class of
19720 the deduced A. Likewise, if P is a pointer to
19721 a class of the form template-id, A can be a
19722 pointer to a derived class pointed to by the
19724 enum template_base_result r
;
19725 r
= get_template_base (tparms
, targs
, parm
, arg
,
19730 /* Don't give the derived diagnostic if we're
19731 already dealing with the same template. */
19733 = (CLASSTYPE_TEMPLATE_INFO (arg
)
19734 && (CLASSTYPE_TI_TEMPLATE (parm
)
19735 == CLASSTYPE_TI_TEMPLATE (arg
)));
19736 return unify_no_common_base (explain_p
&& !same_template
,
19741 else if (CLASSTYPE_TEMPLATE_INFO (arg
)
19742 && (CLASSTYPE_TI_TEMPLATE (parm
)
19743 == CLASSTYPE_TI_TEMPLATE (arg
)))
19744 /* Perhaps PARM is something like S<U> and ARG is S<int>.
19745 Then, we should unify `int' and `U'. */
19748 /* There's no chance of unification succeeding. */
19749 return unify_type_mismatch (explain_p
, parm
, arg
);
19751 return unify (tparms
, targs
, CLASSTYPE_TI_ARGS (parm
),
19752 CLASSTYPE_TI_ARGS (t
), UNIFY_ALLOW_NONE
, explain_p
);
19754 else if (!same_type_ignoring_top_level_qualifiers_p (parm
, arg
))
19755 return unify_type_mismatch (explain_p
, parm
, arg
);
19756 return unify_success (explain_p
);
19759 case FUNCTION_TYPE
:
19761 unsigned int nargs
;
19766 if (TREE_CODE (arg
) != TREE_CODE (parm
))
19767 return unify_type_mismatch (explain_p
, parm
, arg
);
19769 /* CV qualifications for methods can never be deduced, they must
19770 match exactly. We need to check them explicitly here,
19771 because type_unification_real treats them as any other
19772 cv-qualified parameter. */
19773 if (TREE_CODE (parm
) == METHOD_TYPE
19774 && (!check_cv_quals_for_unify
19776 class_of_this_parm (arg
),
19777 class_of_this_parm (parm
))))
19778 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
19780 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TREE_TYPE (parm
),
19781 TREE_TYPE (arg
), UNIFY_ALLOW_NONE
, explain_p
);
19783 nargs
= list_length (TYPE_ARG_TYPES (arg
));
19784 args
= XALLOCAVEC (tree
, nargs
);
19785 for (a
= TYPE_ARG_TYPES (arg
), i
= 0;
19786 a
!= NULL_TREE
&& a
!= void_list_node
;
19787 a
= TREE_CHAIN (a
), ++i
)
19788 args
[i
] = TREE_VALUE (a
);
19791 return type_unification_real (tparms
, targs
, TYPE_ARG_TYPES (parm
),
19792 args
, nargs
, 1, DEDUCE_EXACT
,
19793 LOOKUP_NORMAL
, NULL
, explain_p
);
19797 /* Unify a pointer to member with a pointer to member function, which
19798 deduces the type of the member as a function type. */
19799 if (TYPE_PTRMEMFUNC_P (arg
))
19801 /* Check top-level cv qualifiers */
19802 if (!check_cv_quals_for_unify (UNIFY_ALLOW_NONE
, arg
, parm
))
19803 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
19805 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
19806 TYPE_PTRMEMFUNC_OBJECT_TYPE (arg
),
19807 UNIFY_ALLOW_NONE
, explain_p
);
19809 /* Determine the type of the function we are unifying against. */
19810 tree fntype
= static_fn_type (arg
);
19812 return unify (tparms
, targs
, TREE_TYPE (parm
), fntype
, strict
, explain_p
);
19815 if (TREE_CODE (arg
) != OFFSET_TYPE
)
19816 return unify_type_mismatch (explain_p
, parm
, arg
);
19817 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
19818 TYPE_OFFSET_BASETYPE (arg
),
19819 UNIFY_ALLOW_NONE
, explain_p
);
19820 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
19821 strict
, explain_p
);
19824 if (DECL_TEMPLATE_PARM_P (parm
))
19825 return unify (tparms
, targs
, DECL_INITIAL (parm
), arg
, strict
, explain_p
);
19826 if (arg
!= scalar_constant_value (parm
))
19827 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
19828 return unify_success (explain_p
);
19831 case TEMPLATE_DECL
:
19832 /* Matched cases are handled by the ARG == PARM test above. */
19833 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
19836 /* A non-type template parameter that is a variable should be a
19837 an integral constant, in which case, it whould have been
19838 folded into its (constant) value. So we should not be getting
19839 a variable here. */
19840 gcc_unreachable ();
19842 case TYPE_ARGUMENT_PACK
:
19843 case NONTYPE_ARGUMENT_PACK
:
19844 return unify (tparms
, targs
, ARGUMENT_PACK_ARGS (parm
),
19845 ARGUMENT_PACK_ARGS (arg
), strict
, explain_p
);
19848 case DECLTYPE_TYPE
:
19849 case UNDERLYING_TYPE
:
19850 /* Cannot deduce anything from TYPEOF_TYPE, DECLTYPE_TYPE,
19851 or UNDERLYING_TYPE nodes. */
19852 return unify_success (explain_p
);
19855 /* Unification fails if we hit an error node. */
19856 return unify_invalid (explain_p
);
19859 if (REFERENCE_REF_P (parm
))
19861 if (REFERENCE_REF_P (arg
))
19862 arg
= TREE_OPERAND (arg
, 0);
19863 return unify (tparms
, targs
, TREE_OPERAND (parm
, 0), arg
,
19864 strict
, explain_p
);
19869 /* An unresolved overload is a nondeduced context. */
19870 if (is_overloaded_fn (parm
) || type_unknown_p (parm
))
19871 return unify_success (explain_p
);
19872 gcc_assert (EXPR_P (parm
));
19874 /* We must be looking at an expression. This can happen with
19878 void foo(S<I>, S<I + 2>);
19880 This is a "nondeduced context":
19884 The nondeduced contexts are:
19886 --A type that is a template-id in which one or more of
19887 the template-arguments is an expression that references
19888 a template-parameter.
19890 In these cases, we assume deduction succeeded, but don't
19891 actually infer any unifications. */
19893 if (!uses_template_parms (parm
)
19894 && !template_args_equal (parm
, arg
))
19895 return unify_expression_unequal (explain_p
, parm
, arg
);
19897 return unify_success (explain_p
);
19900 #undef RECUR_AND_CHECK_FAILURE
19902 /* Note that DECL can be defined in this translation unit, if
19906 mark_definable (tree decl
)
19909 DECL_NOT_REALLY_EXTERN (decl
) = 1;
19910 FOR_EACH_CLONE (clone
, decl
)
19911 DECL_NOT_REALLY_EXTERN (clone
) = 1;
19914 /* Called if RESULT is explicitly instantiated, or is a member of an
19915 explicitly instantiated class. */
19918 mark_decl_instantiated (tree result
, int extern_p
)
19920 SET_DECL_EXPLICIT_INSTANTIATION (result
);
19922 /* If this entity has already been written out, it's too late to
19923 make any modifications. */
19924 if (TREE_ASM_WRITTEN (result
))
19927 /* For anonymous namespace we don't need to do anything. */
19928 if (decl_anon_ns_mem_p (result
))
19930 gcc_assert (!TREE_PUBLIC (result
));
19934 if (TREE_CODE (result
) != FUNCTION_DECL
)
19935 /* The TREE_PUBLIC flag for function declarations will have been
19936 set correctly by tsubst. */
19937 TREE_PUBLIC (result
) = 1;
19939 /* This might have been set by an earlier implicit instantiation. */
19940 DECL_COMDAT (result
) = 0;
19943 DECL_NOT_REALLY_EXTERN (result
) = 0;
19946 mark_definable (result
);
19947 mark_needed (result
);
19948 /* Always make artificials weak. */
19949 if (DECL_ARTIFICIAL (result
) && flag_weak
)
19950 comdat_linkage (result
);
19951 /* For WIN32 we also want to put explicit instantiations in
19952 linkonce sections. */
19953 else if (TREE_PUBLIC (result
))
19954 maybe_make_one_only (result
);
19957 /* If EXTERN_P, then this function will not be emitted -- unless
19958 followed by an explicit instantiation, at which point its linkage
19959 will be adjusted. If !EXTERN_P, then this function will be
19960 emitted here. In neither circumstance do we want
19961 import_export_decl to adjust the linkage. */
19962 DECL_INTERFACE_KNOWN (result
) = 1;
19965 /* Subroutine of more_specialized_fn: check whether TARGS is missing any
19966 important template arguments. If any are missing, we check whether
19967 they're important by using error_mark_node for substituting into any
19968 args that were used for partial ordering (the ones between ARGS and END)
19969 and seeing if it bubbles up. */
19972 check_undeduced_parms (tree targs
, tree args
, tree end
)
19974 bool found
= false;
19976 for (i
= TREE_VEC_LENGTH (targs
) - 1; i
>= 0; --i
)
19977 if (TREE_VEC_ELT (targs
, i
) == NULL_TREE
)
19980 TREE_VEC_ELT (targs
, i
) = error_mark_node
;
19984 tree substed
= tsubst_arg_types (args
, targs
, end
, tf_none
, NULL_TREE
);
19985 if (substed
== error_mark_node
)
19991 /* Given two function templates PAT1 and PAT2, return:
19993 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order].
19994 -1 if PAT2 is more specialized than PAT1.
19995 0 if neither is more specialized.
19997 LEN indicates the number of parameters we should consider
19998 (defaulted parameters should not be considered).
20000 The 1998 std underspecified function template partial ordering, and
20001 DR214 addresses the issue. We take pairs of arguments, one from
20002 each of the templates, and deduce them against each other. One of
20003 the templates will be more specialized if all the *other*
20004 template's arguments deduce against its arguments and at least one
20005 of its arguments *does* *not* deduce against the other template's
20006 corresponding argument. Deduction is done as for class templates.
20007 The arguments used in deduction have reference and top level cv
20008 qualifiers removed. Iff both arguments were originally reference
20009 types *and* deduction succeeds in both directions, an lvalue reference
20010 wins against an rvalue reference and otherwise the template
20011 with the more cv-qualified argument wins for that pairing (if
20012 neither is more cv-qualified, they both are equal). Unlike regular
20013 deduction, after all the arguments have been deduced in this way,
20014 we do *not* verify the deduced template argument values can be
20015 substituted into non-deduced contexts.
20017 The logic can be a bit confusing here, because we look at deduce1 and
20018 targs1 to see if pat2 is at least as specialized, and vice versa; if we
20019 can find template arguments for pat1 to make arg1 look like arg2, that
20020 means that arg2 is at least as specialized as arg1. */
20023 more_specialized_fn (tree pat1
, tree pat2
, int len
)
20025 tree decl1
= DECL_TEMPLATE_RESULT (pat1
);
20026 tree decl2
= DECL_TEMPLATE_RESULT (pat2
);
20027 tree targs1
= make_tree_vec (DECL_NTPARMS (pat1
));
20028 tree targs2
= make_tree_vec (DECL_NTPARMS (pat2
));
20029 tree tparms1
= DECL_INNERMOST_TEMPLATE_PARMS (pat1
);
20030 tree tparms2
= DECL_INNERMOST_TEMPLATE_PARMS (pat2
);
20031 tree args1
= TYPE_ARG_TYPES (TREE_TYPE (decl1
));
20032 tree args2
= TYPE_ARG_TYPES (TREE_TYPE (decl2
));
20033 tree origs1
, origs2
;
20034 bool lose1
= false;
20035 bool lose2
= false;
20037 /* Remove the this parameter from non-static member functions. If
20038 one is a non-static member function and the other is not a static
20039 member function, remove the first parameter from that function
20040 also. This situation occurs for operator functions where we
20041 locate both a member function (with this pointer) and non-member
20042 operator (with explicit first operand). */
20043 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl1
))
20045 len
--; /* LEN is the number of significant arguments for DECL1 */
20046 args1
= TREE_CHAIN (args1
);
20047 if (!DECL_STATIC_FUNCTION_P (decl2
))
20048 args2
= TREE_CHAIN (args2
);
20050 else if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl2
))
20052 args2
= TREE_CHAIN (args2
);
20053 if (!DECL_STATIC_FUNCTION_P (decl1
))
20056 args1
= TREE_CHAIN (args1
);
20060 /* If only one is a conversion operator, they are unordered. */
20061 if (DECL_CONV_FN_P (decl1
) != DECL_CONV_FN_P (decl2
))
20064 /* Consider the return type for a conversion function */
20065 if (DECL_CONV_FN_P (decl1
))
20067 args1
= tree_cons (NULL_TREE
, TREE_TYPE (TREE_TYPE (decl1
)), args1
);
20068 args2
= tree_cons (NULL_TREE
, TREE_TYPE (TREE_TYPE (decl2
)), args2
);
20072 processing_template_decl
++;
20078 /* Stop when an ellipsis is seen. */
20079 && args1
!= NULL_TREE
&& args2
!= NULL_TREE
)
20081 tree arg1
= TREE_VALUE (args1
);
20082 tree arg2
= TREE_VALUE (args2
);
20083 int deduce1
, deduce2
;
20089 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
20090 && TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
20092 /* When both arguments are pack expansions, we need only
20093 unify the patterns themselves. */
20094 arg1
= PACK_EXPANSION_PATTERN (arg1
);
20095 arg2
= PACK_EXPANSION_PATTERN (arg2
);
20097 /* This is the last comparison we need to do. */
20101 if (TREE_CODE (arg1
) == REFERENCE_TYPE
)
20103 ref1
= TYPE_REF_IS_RVALUE (arg1
) + 1;
20104 arg1
= TREE_TYPE (arg1
);
20105 quals1
= cp_type_quals (arg1
);
20108 if (TREE_CODE (arg2
) == REFERENCE_TYPE
)
20110 ref2
= TYPE_REF_IS_RVALUE (arg2
) + 1;
20111 arg2
= TREE_TYPE (arg2
);
20112 quals2
= cp_type_quals (arg2
);
20115 arg1
= TYPE_MAIN_VARIANT (arg1
);
20116 arg2
= TYPE_MAIN_VARIANT (arg2
);
20118 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
)
20120 int i
, len2
= list_length (args2
);
20121 tree parmvec
= make_tree_vec (1);
20122 tree argvec
= make_tree_vec (len2
);
20125 /* Setup the parameter vector, which contains only ARG1. */
20126 TREE_VEC_ELT (parmvec
, 0) = arg1
;
20128 /* Setup the argument vector, which contains the remaining
20130 for (i
= 0; i
< len2
; i
++, ta
= TREE_CHAIN (ta
))
20131 TREE_VEC_ELT (argvec
, i
) = TREE_VALUE (ta
);
20133 deduce1
= (unify_pack_expansion (tparms1
, targs1
, parmvec
,
20134 argvec
, DEDUCE_EXACT
,
20135 /*subr=*/true, /*explain_p=*/false)
20138 /* We cannot deduce in the other direction, because ARG1 is
20139 a pack expansion but ARG2 is not. */
20142 else if (TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
20144 int i
, len1
= list_length (args1
);
20145 tree parmvec
= make_tree_vec (1);
20146 tree argvec
= make_tree_vec (len1
);
20149 /* Setup the parameter vector, which contains only ARG1. */
20150 TREE_VEC_ELT (parmvec
, 0) = arg2
;
20152 /* Setup the argument vector, which contains the remaining
20154 for (i
= 0; i
< len1
; i
++, ta
= TREE_CHAIN (ta
))
20155 TREE_VEC_ELT (argvec
, i
) = TREE_VALUE (ta
);
20157 deduce2
= (unify_pack_expansion (tparms2
, targs2
, parmvec
,
20158 argvec
, DEDUCE_EXACT
,
20159 /*subr=*/true, /*explain_p=*/false)
20162 /* We cannot deduce in the other direction, because ARG2 is
20163 a pack expansion but ARG1 is not.*/
20169 /* The normal case, where neither argument is a pack
20171 deduce1
= (unify (tparms1
, targs1
, arg1
, arg2
,
20172 UNIFY_ALLOW_NONE
, /*explain_p=*/false)
20174 deduce2
= (unify (tparms2
, targs2
, arg2
, arg1
,
20175 UNIFY_ALLOW_NONE
, /*explain_p=*/false)
20179 /* If we couldn't deduce arguments for tparms1 to make arg1 match
20180 arg2, then arg2 is not as specialized as arg1. */
20186 /* "If, for a given type, deduction succeeds in both directions
20187 (i.e., the types are identical after the transformations above)
20188 and both P and A were reference types (before being replaced with
20189 the type referred to above):
20190 - if the type from the argument template was an lvalue reference and
20191 the type from the parameter template was not, the argument type is
20192 considered to be more specialized than the other; otherwise,
20193 - if the type from the argument template is more cv-qualified
20194 than the type from the parameter template (as described above),
20195 the argument type is considered to be more specialized than the other;
20197 - neither type is more specialized than the other." */
20199 if (deduce1
&& deduce2
)
20201 if (ref1
&& ref2
&& ref1
!= ref2
)
20208 else if (quals1
!= quals2
&& quals1
>= 0 && quals2
>= 0)
20210 if ((quals1
& quals2
) == quals2
)
20212 if ((quals1
& quals2
) == quals1
)
20217 if (lose1
&& lose2
)
20218 /* We've failed to deduce something in either direction.
20219 These must be unordered. */
20222 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
20223 || TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
20224 /* We have already processed all of the arguments in our
20225 handing of the pack expansion type. */
20228 args1
= TREE_CHAIN (args1
);
20229 args2
= TREE_CHAIN (args2
);
20232 /* "In most cases, all template parameters must have values in order for
20233 deduction to succeed, but for partial ordering purposes a template
20234 parameter may remain without a value provided it is not used in the
20235 types being used for partial ordering."
20237 Thus, if we are missing any of the targs1 we need to substitute into
20238 origs1, then pat2 is not as specialized as pat1. This can happen when
20239 there is a nondeduced context. */
20240 if (!lose2
&& check_undeduced_parms (targs1
, origs1
, args1
))
20242 if (!lose1
&& check_undeduced_parms (targs2
, origs2
, args2
))
20245 processing_template_decl
--;
20247 /* If both deductions succeed, the partial ordering selects the more
20248 constrained template. */
20249 if (!lose1
&& !lose2
)
20251 tree c1
= get_constraints (DECL_TEMPLATE_RESULT (pat1
));
20252 tree c2
= get_constraints (DECL_TEMPLATE_RESULT (pat2
));
20253 lose1
= !subsumes_constraints (c1
, c2
);
20254 lose2
= !subsumes_constraints (c2
, c1
);
20257 /* All things being equal, if the next argument is a pack expansion
20258 for one function but not for the other, prefer the
20259 non-variadic function. FIXME this is bogus; see c++/41958. */
20261 && args1
&& TREE_VALUE (args1
)
20262 && args2
&& TREE_VALUE (args2
))
20264 lose1
= TREE_CODE (TREE_VALUE (args1
)) == TYPE_PACK_EXPANSION
;
20265 lose2
= TREE_CODE (TREE_VALUE (args2
)) == TYPE_PACK_EXPANSION
;
20268 if (lose1
== lose2
)
20276 /* Determine which of two partial specializations of TMPL is more
20279 PAT1 is a TREE_LIST whose TREE_VALUE is the TEMPLATE_DECL corresponding
20280 to the first partial specialization. The TREE_PURPOSE is the
20281 innermost set of template parameters for the partial
20282 specialization. PAT2 is similar, but for the second template.
20284 Return 1 if the first partial specialization is more specialized;
20285 -1 if the second is more specialized; 0 if neither is more
20288 See [temp.class.order] for information about determining which of
20289 two templates is more specialized. */
20292 more_specialized_partial_spec (tree tmpl
, tree pat1
, tree pat2
)
20296 bool any_deductions
= false;
20298 tree tmpl1
= TREE_VALUE (pat1
);
20299 tree tmpl2
= TREE_VALUE (pat2
);
20300 tree parms1
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl1
);
20301 tree parms2
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl2
);
20302 tree specargs1
= TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (tmpl1
)));
20303 tree specargs2
= TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (tmpl2
)));
20305 /* Just like what happens for functions, if we are ordering between
20306 different template specializations, we may encounter dependent
20307 types in the arguments, and we need our dependency check functions
20308 to behave correctly. */
20309 ++processing_template_decl
;
20310 targs
= get_partial_spec_bindings (tmpl
, parms1
, specargs1
, specargs2
);
20314 any_deductions
= true;
20317 targs
= get_partial_spec_bindings (tmpl
, parms2
, specargs2
, specargs1
);
20321 any_deductions
= true;
20323 --processing_template_decl
;
20325 /* If both deductions succeed, the partial ordering selects the more
20326 constrained template. */
20327 if (!winner
&& any_deductions
)
20328 return more_constrained (tmpl1
, tmpl2
);
20330 /* In the case of a tie where at least one of the templates
20331 has a parameter pack at the end, the template with the most
20332 non-packed parameters wins. */
20335 && (template_args_variadic_p (TREE_PURPOSE (pat1
))
20336 || template_args_variadic_p (TREE_PURPOSE (pat2
))))
20338 tree args1
= INNERMOST_TEMPLATE_ARGS (TREE_PURPOSE (pat1
));
20339 tree args2
= INNERMOST_TEMPLATE_ARGS (TREE_PURPOSE (pat2
));
20340 int len1
= TREE_VEC_LENGTH (args1
);
20341 int len2
= TREE_VEC_LENGTH (args2
);
20343 /* We don't count the pack expansion at the end. */
20344 if (template_args_variadic_p (TREE_PURPOSE (pat1
)))
20346 if (template_args_variadic_p (TREE_PURPOSE (pat2
)))
20351 else if (len1
< len2
)
20358 /* Return the template arguments that will produce the function signature
20359 DECL from the function template FN, with the explicit template
20360 arguments EXPLICIT_ARGS. If CHECK_RETTYPE is true, the return type must
20361 also match. Return NULL_TREE if no satisfactory arguments could be
20365 get_bindings (tree fn
, tree decl
, tree explicit_args
, bool check_rettype
)
20367 int ntparms
= DECL_NTPARMS (fn
);
20368 tree targs
= make_tree_vec (ntparms
);
20369 tree decl_type
= TREE_TYPE (decl
);
20370 tree decl_arg_types
;
20372 unsigned int nargs
, ix
;
20375 gcc_assert (decl
!= DECL_TEMPLATE_RESULT (fn
));
20377 /* Never do unification on the 'this' parameter. */
20378 decl_arg_types
= skip_artificial_parms_for (decl
,
20379 TYPE_ARG_TYPES (decl_type
));
20381 nargs
= list_length (decl_arg_types
);
20382 args
= XALLOCAVEC (tree
, nargs
);
20383 for (arg
= decl_arg_types
, ix
= 0;
20384 arg
!= NULL_TREE
&& arg
!= void_list_node
;
20385 arg
= TREE_CHAIN (arg
), ++ix
)
20386 args
[ix
] = TREE_VALUE (arg
);
20388 if (fn_type_unification (fn
, explicit_args
, targs
,
20390 (check_rettype
|| DECL_CONV_FN_P (fn
)
20391 ? TREE_TYPE (decl_type
) : NULL_TREE
),
20392 DEDUCE_EXACT
, LOOKUP_NORMAL
, /*explain_p=*/false,
20394 == error_mark_node
)
20400 /* Return the innermost template arguments that, when applied to a partial
20401 specialization of TMPL whose innermost template parameters are
20402 TPARMS, and whose specialization arguments are SPEC_ARGS, yield the
20405 For example, suppose we have:
20407 template <class T, class U> struct S {};
20408 template <class T> struct S<T*, int> {};
20410 Then, suppose we want to get `S<double*, int>'. The TPARMS will be
20411 {T}, the SPEC_ARGS will be {T*, int} and the ARGS will be {double*,
20412 int}. The resulting vector will be {double}, indicating that `T'
20413 is bound to `double'. */
20416 get_partial_spec_bindings (tree tmpl
, tree tparms
, tree spec_args
, tree args
)
20418 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
20420 tree innermost_deduced_args
;
20422 innermost_deduced_args
= make_tree_vec (ntparms
);
20423 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
20425 deduced_args
= copy_node (args
);
20426 SET_TMPL_ARGS_LEVEL (deduced_args
,
20427 TMPL_ARGS_DEPTH (deduced_args
),
20428 innermost_deduced_args
);
20431 deduced_args
= innermost_deduced_args
;
20433 if (unify (tparms
, deduced_args
,
20434 INNERMOST_TEMPLATE_ARGS (spec_args
),
20435 INNERMOST_TEMPLATE_ARGS (args
),
20436 UNIFY_ALLOW_NONE
, /*explain_p=*/false))
20439 for (i
= 0; i
< ntparms
; ++i
)
20440 if (! TREE_VEC_ELT (innermost_deduced_args
, i
))
20443 /* Verify that nondeduced template arguments agree with the type
20444 obtained from argument deduction.
20448 struct A { typedef int X; };
20449 template <class T, class U> struct C {};
20450 template <class T> struct C<T, typename T::X> {};
20452 Then with the instantiation `C<A, int>', we can deduce that
20453 `T' is `A' but unify () does not check whether `typename T::X'
20455 spec_args
= tsubst (spec_args
, deduced_args
, tf_none
, NULL_TREE
);
20456 spec_args
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
20458 tf_none
, false, false);
20459 if (spec_args
== error_mark_node
20460 /* We only need to check the innermost arguments; the other
20461 arguments will always agree. */
20462 || !comp_template_args (INNERMOST_TEMPLATE_ARGS (spec_args
),
20463 INNERMOST_TEMPLATE_ARGS (args
)))
20466 /* Now that we have bindings for all of the template arguments,
20467 ensure that the arguments deduced for the template template
20468 parameters have compatible template parameter lists. See the use
20469 of template_template_parm_bindings_ok_p in fn_type_unification
20470 for more information. */
20471 if (!template_template_parm_bindings_ok_p (tparms
, deduced_args
))
20474 return deduced_args
;
20477 // Compare two function templates T1 and T2 by deducing bindings
20478 // from one against the other. If both deductions succeed, compare
20479 // constraints to see which is more constrained.
20481 more_specialized_inst (tree t1
, tree t2
)
20486 if (get_bindings (t1
, DECL_TEMPLATE_RESULT (t2
), NULL_TREE
, true))
20492 if (get_bindings (t2
, DECL_TEMPLATE_RESULT (t1
), NULL_TREE
, true))
20498 // If both deductions succeed, then one may be more constrained.
20499 if (count
== 2 && fate
== 0)
20500 fate
= more_constrained (t1
, t2
);
20505 /* TEMPLATES is a TREE_LIST. Each TREE_VALUE is a TEMPLATE_DECL.
20506 Return the TREE_LIST node with the most specialized template, if
20507 any. If there is no most specialized template, the error_mark_node
20510 Note that this function does not look at, or modify, the
20511 TREE_PURPOSE or TREE_TYPE of any of the nodes. Since the node
20512 returned is one of the elements of INSTANTIATIONS, callers may
20513 store information in the TREE_PURPOSE or TREE_TYPE of the nodes,
20514 and retrieve it from the value returned. */
20517 most_specialized_instantiation (tree templates
)
20521 ++processing_template_decl
;
20524 for (fn
= TREE_CHAIN (templates
); fn
; fn
= TREE_CHAIN (fn
))
20526 int fate
= more_specialized_inst (TREE_VALUE (champ
), TREE_VALUE (fn
));
20531 /* Equally specialized, move to next function. If there
20532 is no next function, nothing's most specialized. */
20533 fn
= TREE_CHAIN (fn
);
20541 /* Now verify that champ is better than everything earlier in the
20542 instantiation list. */
20543 for (fn
= templates
; fn
!= champ
; fn
= TREE_CHAIN (fn
)) {
20544 if (more_specialized_inst (TREE_VALUE (champ
), TREE_VALUE (fn
)) != 1)
20551 processing_template_decl
--;
20554 return error_mark_node
;
20559 /* If DECL is a specialization of some template, return the most
20560 general such template. Otherwise, returns NULL_TREE.
20562 For example, given:
20564 template <class T> struct S { template <class U> void f(U); };
20566 if TMPL is `template <class U> void S<int>::f(U)' this will return
20567 the full template. This function will not trace past partial
20568 specializations, however. For example, given in addition:
20570 template <class T> struct S<T*> { template <class U> void f(U); };
20572 if TMPL is `template <class U> void S<int*>::f(U)' this will return
20573 `template <class T> template <class U> S<T*>::f(U)'. */
20576 most_general_template (tree decl
)
20578 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
20580 if (tree tinfo
= get_template_info (decl
))
20581 decl
= TI_TEMPLATE (tinfo
);
20582 /* The TI_TEMPLATE can be an IDENTIFIER_NODE for a
20583 template friend, or a FIELD_DECL for a capture pack. */
20584 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
20588 /* Look for more and more general templates. */
20589 while (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
))
20591 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE in some cases.
20592 (See cp-tree.h for details.) */
20593 if (TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
20596 if (CLASS_TYPE_P (TREE_TYPE (decl
))
20597 && !TYPE_DECL_ALIAS_P (TYPE_NAME (TREE_TYPE (decl
)))
20598 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)))
20601 /* Stop if we run into an explicitly specialized class template. */
20602 if (!DECL_NAMESPACE_SCOPE_P (decl
)
20603 && DECL_CONTEXT (decl
)
20604 && CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (decl
)))
20607 decl
= DECL_TI_TEMPLATE (decl
);
20613 /* Return the most specialized of the template partial specializations
20614 which can produce TARGET, a specialization of some class or variable
20615 template. The value returned is actually a TREE_LIST; the TREE_VALUE is
20616 a TEMPLATE_DECL node corresponding to the partial specialization, while
20617 the TREE_PURPOSE is the set of template arguments that must be
20618 substituted into the template pattern in order to generate TARGET.
20620 If the choice of partial specialization is ambiguous, a diagnostic
20621 is issued, and the error_mark_node is returned. If there are no
20622 partial specializations matching TARGET, then NULL_TREE is
20623 returned, indicating that the primary template should be used. */
20626 most_specialized_partial_spec (tree target
, tsubst_flags_t complain
)
20628 tree list
= NULL_TREE
;
20633 tree outer_args
= NULL_TREE
;
20636 if (TYPE_P (target
))
20638 tree tinfo
= CLASSTYPE_TEMPLATE_INFO (target
);
20639 tmpl
= TI_TEMPLATE (tinfo
);
20640 args
= TI_ARGS (tinfo
);
20642 else if (TREE_CODE (target
) == TEMPLATE_ID_EXPR
)
20644 tmpl
= TREE_OPERAND (target
, 0);
20645 args
= TREE_OPERAND (target
, 1);
20647 else if (VAR_P (target
))
20649 tree tinfo
= DECL_TEMPLATE_INFO (target
);
20650 tmpl
= TI_TEMPLATE (tinfo
);
20651 args
= TI_ARGS (tinfo
);
20654 gcc_unreachable ();
20656 tree main_tmpl
= most_general_template (tmpl
);
20658 /* For determining which partial specialization to use, only the
20659 innermost args are interesting. */
20660 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
20662 outer_args
= strip_innermost_template_args (args
, 1);
20663 args
= INNERMOST_TEMPLATE_ARGS (args
);
20666 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (main_tmpl
); t
; t
= TREE_CHAIN (t
))
20668 tree partial_spec_args
;
20670 tree spec_tmpl
= TREE_VALUE (t
);
20672 partial_spec_args
= TREE_PURPOSE (t
);
20674 ++processing_template_decl
;
20678 /* Discard the outer levels of args, and then substitute in the
20679 template args from the enclosing class. */
20680 partial_spec_args
= INNERMOST_TEMPLATE_ARGS (partial_spec_args
);
20681 partial_spec_args
= tsubst_template_args
20682 (partial_spec_args
, outer_args
, tf_none
, NULL_TREE
);
20684 /* And the same for the partial specialization TEMPLATE_DECL. */
20685 spec_tmpl
= tsubst (spec_tmpl
, outer_args
, tf_none
, NULL_TREE
);
20688 partial_spec_args
=
20689 coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
20692 /*require_all_args=*/true,
20693 /*use_default_args=*/true);
20695 --processing_template_decl
;
20697 if (partial_spec_args
== error_mark_node
)
20698 return error_mark_node
;
20699 if (spec_tmpl
== error_mark_node
)
20700 return error_mark_node
;
20702 tree parms
= DECL_INNERMOST_TEMPLATE_PARMS (spec_tmpl
);
20703 spec_args
= get_partial_spec_bindings (tmpl
, parms
,
20709 spec_args
= add_to_template_args (outer_args
, spec_args
);
20711 /* Keep the candidate only if the constraints are satisfied,
20712 or if we're not compiling with concepts. */
20714 || constraints_satisfied_p (spec_tmpl
, spec_args
))
20716 list
= tree_cons (spec_args
, TREE_VALUE (t
), list
);
20717 TREE_TYPE (list
) = TREE_TYPE (t
);
20725 ambiguous_p
= false;
20728 t
= TREE_CHAIN (t
);
20729 for (; t
; t
= TREE_CHAIN (t
))
20731 fate
= more_specialized_partial_spec (tmpl
, champ
, t
);
20738 t
= TREE_CHAIN (t
);
20741 ambiguous_p
= true;
20750 for (t
= list
; t
&& t
!= champ
; t
= TREE_CHAIN (t
))
20752 fate
= more_specialized_partial_spec (tmpl
, champ
, t
);
20755 ambiguous_p
= true;
20763 char *spaces
= NULL
;
20764 if (!(complain
& tf_error
))
20765 return error_mark_node
;
20766 if (TYPE_P (target
))
20767 error ("ambiguous template instantiation for %q#T", target
);
20769 error ("ambiguous template instantiation for %q#D", target
);
20770 str
= ngettext ("candidate is:", "candidates are:", list_length (list
));
20771 for (t
= list
; t
; t
= TREE_CHAIN (t
))
20773 tree subst
= build_tree_list (TREE_VALUE (t
), TREE_PURPOSE (t
));
20774 inform (DECL_SOURCE_LOCATION (TREE_VALUE (t
)),
20775 "%s %#S", spaces
? spaces
: str
, subst
);
20776 spaces
= spaces
? spaces
: get_spaces (str
);
20779 return error_mark_node
;
20785 /* Explicitly instantiate DECL. */
20788 do_decl_instantiation (tree decl
, tree storage
)
20790 tree result
= NULL_TREE
;
20793 if (!decl
|| decl
== error_mark_node
)
20794 /* An error occurred, for which grokdeclarator has already issued
20795 an appropriate message. */
20797 else if (! DECL_LANG_SPECIFIC (decl
))
20799 error ("explicit instantiation of non-template %q#D", decl
);
20803 bool var_templ
= (DECL_TEMPLATE_INFO (decl
)
20804 && variable_template_p (DECL_TI_TEMPLATE (decl
)));
20806 if (VAR_P (decl
) && !var_templ
)
20808 /* There is an asymmetry here in the way VAR_DECLs and
20809 FUNCTION_DECLs are handled by grokdeclarator. In the case of
20810 the latter, the DECL we get back will be marked as a
20811 template instantiation, and the appropriate
20812 DECL_TEMPLATE_INFO will be set up. This does not happen for
20813 VAR_DECLs so we do the lookup here. Probably, grokdeclarator
20814 should handle VAR_DECLs as it currently handles
20816 if (!DECL_CLASS_SCOPE_P (decl
))
20818 error ("%qD is not a static data member of a class template", decl
);
20821 result
= lookup_field (DECL_CONTEXT (decl
), DECL_NAME (decl
), 0, false);
20822 if (!result
|| !VAR_P (result
))
20824 error ("no matching template for %qD found", decl
);
20827 if (!same_type_p (TREE_TYPE (result
), TREE_TYPE (decl
)))
20829 error ("type %qT for explicit instantiation %qD does not match "
20830 "declared type %qT", TREE_TYPE (result
), decl
,
20835 else if (TREE_CODE (decl
) != FUNCTION_DECL
&& !var_templ
)
20837 error ("explicit instantiation of %q#D", decl
);
20843 /* Check for various error cases. Note that if the explicit
20844 instantiation is valid the RESULT will currently be marked as an
20845 *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set
20846 until we get here. */
20848 if (DECL_TEMPLATE_SPECIALIZATION (result
))
20850 /* DR 259 [temp.spec].
20852 Both an explicit instantiation and a declaration of an explicit
20853 specialization shall not appear in a program unless the explicit
20854 instantiation follows a declaration of the explicit specialization.
20856 For a given set of template parameters, if an explicit
20857 instantiation of a template appears after a declaration of an
20858 explicit specialization for that template, the explicit
20859 instantiation has no effect. */
20862 else if (DECL_EXPLICIT_INSTANTIATION (result
))
20866 No program shall explicitly instantiate any template more
20869 We check DECL_NOT_REALLY_EXTERN so as not to complain when
20870 the first instantiation was `extern' and the second is not,
20871 and EXTERN_P for the opposite case. */
20872 if (DECL_NOT_REALLY_EXTERN (result
) && !extern_p
)
20873 permerror (input_location
, "duplicate explicit instantiation of %q#D", result
);
20874 /* If an "extern" explicit instantiation follows an ordinary
20875 explicit instantiation, the template is instantiated. */
20879 else if (!DECL_IMPLICIT_INSTANTIATION (result
))
20881 error ("no matching template for %qD found", result
);
20884 else if (!DECL_TEMPLATE_INFO (result
))
20886 permerror (input_location
, "explicit instantiation of non-template %q#D", result
);
20890 if (storage
== NULL_TREE
)
20892 else if (storage
== ridpointers
[(int) RID_EXTERN
])
20894 if (!in_system_header_at (input_location
) && (cxx_dialect
== cxx98
))
20895 pedwarn (input_location
, OPT_Wpedantic
,
20896 "ISO C++ 1998 forbids the use of %<extern%> on explicit "
20901 error ("storage class %qD applied to template instantiation", storage
);
20903 check_explicit_instantiation_namespace (result
);
20904 mark_decl_instantiated (result
, extern_p
);
20906 instantiate_decl (result
, /*defer_ok=*/1,
20907 /*expl_inst_class_mem_p=*/false);
20911 mark_class_instantiated (tree t
, int extern_p
)
20913 SET_CLASSTYPE_EXPLICIT_INSTANTIATION (t
);
20914 SET_CLASSTYPE_INTERFACE_KNOWN (t
);
20915 CLASSTYPE_INTERFACE_ONLY (t
) = extern_p
;
20916 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (t
)) = extern_p
;
20919 CLASSTYPE_DEBUG_REQUESTED (t
) = 1;
20920 rest_of_type_compilation (t
, 1);
20924 /* Called from do_type_instantiation through binding_table_foreach to
20925 do recursive instantiation for the type bound in ENTRY. */
20927 bt_instantiate_type_proc (binding_entry entry
, void *data
)
20929 tree storage
= *(tree
*) data
;
20931 if (MAYBE_CLASS_TYPE_P (entry
->type
)
20932 && !uses_template_parms (CLASSTYPE_TI_ARGS (entry
->type
)))
20933 do_type_instantiation (TYPE_MAIN_DECL (entry
->type
), storage
, 0);
20936 /* Called from do_type_instantiation to instantiate a member
20937 (a member function or a static member variable) of an
20938 explicitly instantiated class template. */
20940 instantiate_class_member (tree decl
, int extern_p
)
20942 mark_decl_instantiated (decl
, extern_p
);
20944 instantiate_decl (decl
, /*defer_ok=*/1,
20945 /*expl_inst_class_mem_p=*/true);
20948 /* Perform an explicit instantiation of template class T. STORAGE, if
20949 non-null, is the RID for extern, inline or static. COMPLAIN is
20950 nonzero if this is called from the parser, zero if called recursively,
20951 since the standard is unclear (as detailed below). */
20954 do_type_instantiation (tree t
, tree storage
, tsubst_flags_t complain
)
20959 int previous_instantiation_extern_p
= 0;
20961 if (TREE_CODE (t
) == TYPE_DECL
)
20964 if (! CLASS_TYPE_P (t
) || ! CLASSTYPE_TEMPLATE_INFO (t
))
20967 (TYPE_TEMPLATE_INFO (t
)) ? TYPE_TI_TEMPLATE (t
) : NULL
;
20969 error ("explicit instantiation of non-class template %qD", tmpl
);
20971 error ("explicit instantiation of non-template type %qT", t
);
20977 if (!COMPLETE_TYPE_P (t
))
20979 if (complain
& tf_error
)
20980 error ("explicit instantiation of %q#T before definition of template",
20985 if (storage
!= NULL_TREE
)
20987 if (!in_system_header_at (input_location
))
20989 if (storage
== ridpointers
[(int) RID_EXTERN
])
20991 if (cxx_dialect
== cxx98
)
20992 pedwarn (input_location
, OPT_Wpedantic
,
20993 "ISO C++ 1998 forbids the use of %<extern%> on "
20994 "explicit instantiations");
20997 pedwarn (input_location
, OPT_Wpedantic
,
20998 "ISO C++ forbids the use of %qE"
20999 " on explicit instantiations", storage
);
21002 if (storage
== ridpointers
[(int) RID_INLINE
])
21004 else if (storage
== ridpointers
[(int) RID_EXTERN
])
21006 else if (storage
== ridpointers
[(int) RID_STATIC
])
21010 error ("storage class %qD applied to template instantiation",
21016 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
21018 /* DR 259 [temp.spec].
21020 Both an explicit instantiation and a declaration of an explicit
21021 specialization shall not appear in a program unless the explicit
21022 instantiation follows a declaration of the explicit specialization.
21024 For a given set of template parameters, if an explicit
21025 instantiation of a template appears after a declaration of an
21026 explicit specialization for that template, the explicit
21027 instantiation has no effect. */
21030 else if (CLASSTYPE_EXPLICIT_INSTANTIATION (t
))
21034 No program shall explicitly instantiate any template more
21037 If PREVIOUS_INSTANTIATION_EXTERN_P, then the first explicit
21038 instantiation was `extern'. If EXTERN_P then the second is.
21039 These cases are OK. */
21040 previous_instantiation_extern_p
= CLASSTYPE_INTERFACE_ONLY (t
);
21042 if (!previous_instantiation_extern_p
&& !extern_p
21043 && (complain
& tf_error
))
21044 permerror (input_location
, "duplicate explicit instantiation of %q#T", t
);
21046 /* If we've already instantiated the template, just return now. */
21047 if (!CLASSTYPE_INTERFACE_ONLY (t
))
21051 check_explicit_instantiation_namespace (TYPE_NAME (t
));
21052 mark_class_instantiated (t
, extern_p
);
21060 /* In contrast to implicit instantiation, where only the
21061 declarations, and not the definitions, of members are
21062 instantiated, we have here:
21066 The explicit instantiation of a class template specialization
21067 implies the instantiation of all of its members not
21068 previously explicitly specialized in the translation unit
21069 containing the explicit instantiation.
21071 Of course, we can't instantiate member template classes, since
21072 we don't have any arguments for them. Note that the standard
21073 is unclear on whether the instantiation of the members are
21074 *explicit* instantiations or not. However, the most natural
21075 interpretation is that it should be an explicit instantiation. */
21078 for (tmp
= TYPE_METHODS (t
); tmp
; tmp
= DECL_CHAIN (tmp
))
21079 if (TREE_CODE (tmp
) == FUNCTION_DECL
21080 && DECL_TEMPLATE_INSTANTIATION (tmp
))
21081 instantiate_class_member (tmp
, extern_p
);
21083 for (tmp
= TYPE_FIELDS (t
); tmp
; tmp
= DECL_CHAIN (tmp
))
21084 if (VAR_P (tmp
) && DECL_TEMPLATE_INSTANTIATION (tmp
))
21085 instantiate_class_member (tmp
, extern_p
);
21087 if (CLASSTYPE_NESTED_UTDS (t
))
21088 binding_table_foreach (CLASSTYPE_NESTED_UTDS (t
),
21089 bt_instantiate_type_proc
, &storage
);
21093 /* Given a function DECL, which is a specialization of TMPL, modify
21094 DECL to be a re-instantiation of TMPL with the same template
21095 arguments. TMPL should be the template into which tsubst'ing
21096 should occur for DECL, not the most general template.
21098 One reason for doing this is a scenario like this:
21101 void f(const T&, int i);
21103 void g() { f(3, 7); }
21106 void f(const T& t, const int i) { }
21108 Note that when the template is first instantiated, with
21109 instantiate_template, the resulting DECL will have no name for the
21110 first parameter, and the wrong type for the second. So, when we go
21111 to instantiate the DECL, we regenerate it. */
21114 regenerate_decl_from_template (tree decl
, tree tmpl
)
21116 /* The arguments used to instantiate DECL, from the most general
21121 args
= DECL_TI_ARGS (decl
);
21122 code_pattern
= DECL_TEMPLATE_RESULT (tmpl
);
21124 /* Make sure that we can see identifiers, and compute access
21126 push_access_scope (decl
);
21128 if (TREE_CODE (decl
) == FUNCTION_DECL
)
21136 args_depth
= TMPL_ARGS_DEPTH (args
);
21137 parms_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
21138 if (args_depth
> parms_depth
)
21139 args
= get_innermost_template_args (args
, parms_depth
);
21141 specs
= tsubst_exception_specification (TREE_TYPE (code_pattern
),
21142 args
, tf_error
, NULL_TREE
,
21143 /*defer_ok*/false);
21144 if (specs
&& specs
!= error_mark_node
)
21145 TREE_TYPE (decl
) = build_exception_variant (TREE_TYPE (decl
),
21148 /* Merge parameter declarations. */
21149 decl_parm
= skip_artificial_parms_for (decl
,
21150 DECL_ARGUMENTS (decl
));
21152 = skip_artificial_parms_for (code_pattern
,
21153 DECL_ARGUMENTS (code_pattern
));
21154 while (decl_parm
&& !DECL_PACK_P (pattern_parm
))
21159 if (DECL_NAME (decl_parm
) != DECL_NAME (pattern_parm
))
21160 DECL_NAME (decl_parm
) = DECL_NAME (pattern_parm
);
21161 parm_type
= tsubst (TREE_TYPE (pattern_parm
), args
, tf_error
,
21163 parm_type
= type_decays_to (parm_type
);
21164 if (!same_type_p (TREE_TYPE (decl_parm
), parm_type
))
21165 TREE_TYPE (decl_parm
) = parm_type
;
21166 attributes
= DECL_ATTRIBUTES (pattern_parm
);
21167 if (DECL_ATTRIBUTES (decl_parm
) != attributes
)
21169 DECL_ATTRIBUTES (decl_parm
) = attributes
;
21170 cplus_decl_attributes (&decl_parm
, attributes
, /*flags=*/0);
21172 decl_parm
= DECL_CHAIN (decl_parm
);
21173 pattern_parm
= DECL_CHAIN (pattern_parm
);
21175 /* Merge any parameters that match with the function parameter
21177 if (pattern_parm
&& DECL_PACK_P (pattern_parm
))
21180 tree expanded_types
;
21181 /* Expand the TYPE_PACK_EXPANSION that provides the types for
21182 the parameters in this function parameter pack. */
21183 expanded_types
= tsubst_pack_expansion (TREE_TYPE (pattern_parm
),
21184 args
, tf_error
, NULL_TREE
);
21185 len
= TREE_VEC_LENGTH (expanded_types
);
21186 for (i
= 0; i
< len
; i
++)
21191 if (DECL_NAME (decl_parm
) != DECL_NAME (pattern_parm
))
21192 /* Rename the parameter to include the index. */
21193 DECL_NAME (decl_parm
) =
21194 make_ith_pack_parameter_name (DECL_NAME (pattern_parm
), i
);
21195 parm_type
= TREE_VEC_ELT (expanded_types
, i
);
21196 parm_type
= type_decays_to (parm_type
);
21197 if (!same_type_p (TREE_TYPE (decl_parm
), parm_type
))
21198 TREE_TYPE (decl_parm
) = parm_type
;
21199 attributes
= DECL_ATTRIBUTES (pattern_parm
);
21200 if (DECL_ATTRIBUTES (decl_parm
) != attributes
)
21202 DECL_ATTRIBUTES (decl_parm
) = attributes
;
21203 cplus_decl_attributes (&decl_parm
, attributes
, /*flags=*/0);
21205 decl_parm
= DECL_CHAIN (decl_parm
);
21208 /* Merge additional specifiers from the CODE_PATTERN. */
21209 if (DECL_DECLARED_INLINE_P (code_pattern
)
21210 && !DECL_DECLARED_INLINE_P (decl
))
21211 DECL_DECLARED_INLINE_P (decl
) = 1;
21213 else if (VAR_P (decl
))
21215 DECL_INITIAL (decl
) =
21216 tsubst_expr (DECL_INITIAL (code_pattern
), args
,
21217 tf_error
, DECL_TI_TEMPLATE (decl
),
21218 /*integral_constant_expression_p=*/false);
21219 if (VAR_HAD_UNKNOWN_BOUND (decl
))
21220 TREE_TYPE (decl
) = tsubst (TREE_TYPE (code_pattern
), args
,
21221 tf_error
, DECL_TI_TEMPLATE (decl
));
21224 gcc_unreachable ();
21226 pop_access_scope (decl
);
21229 /* Return the TEMPLATE_DECL into which DECL_TI_ARGS(DECL) should be
21230 substituted to get DECL. */
21233 template_for_substitution (tree decl
)
21235 tree tmpl
= DECL_TI_TEMPLATE (decl
);
21237 /* Set TMPL to the template whose DECL_TEMPLATE_RESULT is the pattern
21238 for the instantiation. This is not always the most general
21239 template. Consider, for example:
21242 struct S { template <class U> void f();
21243 template <> void f<int>(); };
21245 and an instantiation of S<double>::f<int>. We want TD to be the
21246 specialization S<T>::f<int>, not the more general S<T>::f<U>. */
21247 while (/* An instantiation cannot have a definition, so we need a
21248 more general template. */
21249 DECL_TEMPLATE_INSTANTIATION (tmpl
)
21250 /* We must also deal with friend templates. Given:
21252 template <class T> struct S {
21253 template <class U> friend void f() {};
21256 S<int>::f<U> say, is not an instantiation of S<T>::f<U>,
21257 so far as the language is concerned, but that's still
21258 where we get the pattern for the instantiation from. On
21259 other hand, if the definition comes outside the class, say:
21261 template <class T> struct S {
21262 template <class U> friend void f();
21264 template <class U> friend void f() {}
21266 we don't need to look any further. That's what the check for
21267 DECL_INITIAL is for. */
21268 || (TREE_CODE (decl
) == FUNCTION_DECL
21269 && DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (tmpl
)
21270 && !DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl
))))
21272 /* The present template, TD, should not be a definition. If it
21273 were a definition, we should be using it! Note that we
21274 cannot restructure the loop to just keep going until we find
21275 a template with a definition, since that might go too far if
21276 a specialization was declared, but not defined. */
21278 /* Fetch the more general template. */
21279 tmpl
= DECL_TI_TEMPLATE (tmpl
);
21285 /* Returns true if we need to instantiate this template instance even if we
21286 know we aren't going to emit it. */
21289 always_instantiate_p (tree decl
)
21291 /* We always instantiate inline functions so that we can inline them. An
21292 explicit instantiation declaration prohibits implicit instantiation of
21293 non-inline functions. With high levels of optimization, we would
21294 normally inline non-inline functions -- but we're not allowed to do
21295 that for "extern template" functions. Therefore, we check
21296 DECL_DECLARED_INLINE_P, rather than possibly_inlined_p. */
21297 return ((TREE_CODE (decl
) == FUNCTION_DECL
21298 && (DECL_DECLARED_INLINE_P (decl
)
21299 || type_uses_auto (TREE_TYPE (TREE_TYPE (decl
)))))
21300 /* And we need to instantiate static data members so that
21301 their initializers are available in integral constant
21304 && decl_maybe_constant_var_p (decl
)));
21307 /* If FN has a noexcept-specifier that hasn't been instantiated yet,
21308 instantiate it now, modifying TREE_TYPE (fn). */
21311 maybe_instantiate_noexcept (tree fn
)
21313 tree fntype
, spec
, noex
, clone
;
21315 /* Don't instantiate a noexcept-specification from template context. */
21316 if (processing_template_decl
)
21319 if (DECL_CLONED_FUNCTION_P (fn
))
21320 fn
= DECL_CLONED_FUNCTION (fn
);
21321 fntype
= TREE_TYPE (fn
);
21322 spec
= TYPE_RAISES_EXCEPTIONS (fntype
);
21324 if (!spec
|| !TREE_PURPOSE (spec
))
21327 noex
= TREE_PURPOSE (spec
);
21329 if (TREE_CODE (noex
) == DEFERRED_NOEXCEPT
)
21331 if (DEFERRED_NOEXCEPT_PATTERN (noex
) == NULL_TREE
)
21332 spec
= get_defaulted_eh_spec (fn
);
21333 else if (push_tinst_level (fn
))
21335 push_access_scope (fn
);
21336 push_deferring_access_checks (dk_no_deferred
);
21337 input_location
= DECL_SOURCE_LOCATION (fn
);
21338 noex
= tsubst_copy_and_build (DEFERRED_NOEXCEPT_PATTERN (noex
),
21339 DEFERRED_NOEXCEPT_ARGS (noex
),
21340 tf_warning_or_error
, fn
,
21341 /*function_p=*/false,
21342 /*integral_constant_expression_p=*/true);
21343 pop_deferring_access_checks ();
21344 pop_access_scope (fn
);
21345 pop_tinst_level ();
21346 spec
= build_noexcept_spec (noex
, tf_warning_or_error
);
21347 if (spec
== error_mark_node
)
21348 spec
= noexcept_false_spec
;
21351 spec
= noexcept_false_spec
;
21353 TREE_TYPE (fn
) = build_exception_variant (fntype
, spec
);
21356 FOR_EACH_CLONE (clone
, fn
)
21358 if (TREE_TYPE (clone
) == fntype
)
21359 TREE_TYPE (clone
) = TREE_TYPE (fn
);
21361 TREE_TYPE (clone
) = build_exception_variant (TREE_TYPE (clone
), spec
);
21365 /* Produce the definition of D, a _DECL generated from a template. If
21366 DEFER_OK is nonzero, then we don't have to actually do the
21367 instantiation now; we just have to do it sometime. Normally it is
21368 an error if this is an explicit instantiation but D is undefined.
21369 EXPL_INST_CLASS_MEM_P is true iff D is a member of an
21370 explicitly instantiated class template. */
21373 instantiate_decl (tree d
, int defer_ok
,
21374 bool expl_inst_class_mem_p
)
21376 tree tmpl
= DECL_TI_TEMPLATE (d
);
21383 bool pattern_defined
;
21384 location_t saved_loc
= input_location
;
21385 int saved_unevaluated_operand
= cp_unevaluated_operand
;
21386 int saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
21390 bool nested
= false;
21392 /* This function should only be used to instantiate templates for
21393 functions and static member variables. */
21394 gcc_assert (VAR_OR_FUNCTION_DECL_P (d
));
21396 /* A concept is never instantiated. */
21397 gcc_assert (!DECL_DECLARED_CONCEPT_P (d
));
21399 /* Variables are never deferred; if instantiation is required, they
21400 are instantiated right away. That allows for better code in the
21401 case that an expression refers to the value of the variable --
21402 if the variable has a constant value the referring expression can
21403 take advantage of that fact. */
21405 || DECL_DECLARED_CONSTEXPR_P (d
))
21408 /* Don't instantiate cloned functions. Instead, instantiate the
21409 functions they cloned. */
21410 if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_CLONED_FUNCTION_P (d
))
21411 d
= DECL_CLONED_FUNCTION (d
);
21413 if (DECL_TEMPLATE_INSTANTIATED (d
)
21414 || (TREE_CODE (d
) == FUNCTION_DECL
21415 && DECL_DEFAULTED_FN (d
) && DECL_INITIAL (d
))
21416 || DECL_TEMPLATE_SPECIALIZATION (d
))
21417 /* D has already been instantiated or explicitly specialized, so
21418 there's nothing for us to do here.
21420 It might seem reasonable to check whether or not D is an explicit
21421 instantiation, and, if so, stop here. But when an explicit
21422 instantiation is deferred until the end of the compilation,
21423 DECL_EXPLICIT_INSTANTIATION is set, even though we still need to do
21424 the instantiation. */
21427 /* Check to see whether we know that this template will be
21428 instantiated in some other file, as with "extern template"
21430 external_p
= (DECL_INTERFACE_KNOWN (d
) && DECL_REALLY_EXTERN (d
));
21432 /* In general, we do not instantiate such templates. */
21433 if (external_p
&& !always_instantiate_p (d
))
21436 gen_tmpl
= most_general_template (tmpl
);
21437 gen_args
= DECL_TI_ARGS (d
);
21439 if (tmpl
!= gen_tmpl
)
21440 /* We should already have the extra args. */
21441 gcc_assert (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (gen_tmpl
))
21442 == TMPL_ARGS_DEPTH (gen_args
));
21443 /* And what's in the hash table should match D. */
21444 gcc_assert ((spec
= retrieve_specialization (gen_tmpl
, gen_args
, 0)) == d
21445 || spec
== NULL_TREE
);
21447 /* This needs to happen before any tsubsting. */
21448 if (! push_tinst_level (d
))
21451 timevar_push (TV_TEMPLATE_INST
);
21453 /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern
21454 for the instantiation. */
21455 td
= template_for_substitution (d
);
21456 code_pattern
= DECL_TEMPLATE_RESULT (td
);
21458 /* We should never be trying to instantiate a member of a class
21459 template or partial specialization. */
21460 gcc_assert (d
!= code_pattern
);
21462 if ((DECL_NAMESPACE_SCOPE_P (d
) && !DECL_INITIALIZED_IN_CLASS_P (d
))
21463 || DECL_TEMPLATE_SPECIALIZATION (td
))
21464 /* In the case of a friend template whose definition is provided
21465 outside the class, we may have too many arguments. Drop the
21466 ones we don't need. The same is true for specializations. */
21467 args
= get_innermost_template_args
21468 (gen_args
, TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (td
)));
21472 if (TREE_CODE (d
) == FUNCTION_DECL
)
21474 deleted_p
= DECL_DELETED_FN (code_pattern
);
21475 pattern_defined
= (DECL_SAVED_TREE (code_pattern
) != NULL_TREE
21476 || DECL_DEFAULTED_OUTSIDE_CLASS_P (code_pattern
)
21482 pattern_defined
= ! DECL_IN_AGGR_P (code_pattern
);
21485 /* We may be in the middle of deferred access check. Disable it now. */
21486 push_deferring_access_checks (dk_no_deferred
);
21488 /* Unless an explicit instantiation directive has already determined
21489 the linkage of D, remember that a definition is available for
21491 if (pattern_defined
21492 && !DECL_INTERFACE_KNOWN (d
)
21493 && !DECL_NOT_REALLY_EXTERN (d
))
21494 mark_definable (d
);
21496 DECL_SOURCE_LOCATION (td
) = DECL_SOURCE_LOCATION (code_pattern
);
21497 DECL_SOURCE_LOCATION (d
) = DECL_SOURCE_LOCATION (code_pattern
);
21498 input_location
= DECL_SOURCE_LOCATION (d
);
21500 /* If D is a member of an explicitly instantiated class template,
21501 and no definition is available, treat it like an implicit
21503 if (!pattern_defined
&& expl_inst_class_mem_p
21504 && DECL_EXPLICIT_INSTANTIATION (d
))
21506 /* Leave linkage flags alone on instantiations with anonymous
21508 if (TREE_PUBLIC (d
))
21510 DECL_NOT_REALLY_EXTERN (d
) = 0;
21511 DECL_INTERFACE_KNOWN (d
) = 0;
21513 SET_DECL_IMPLICIT_INSTANTIATION (d
);
21516 /* Defer all other templates, unless we have been explicitly
21517 forbidden from doing so. */
21518 if (/* If there is no definition, we cannot instantiate the
21521 /* If it's OK to postpone instantiation, do so. */
21523 /* If this is a static data member that will be defined
21524 elsewhere, we don't want to instantiate the entire data
21525 member, but we do want to instantiate the initializer so that
21526 we can substitute that elsewhere. */
21527 || (external_p
&& VAR_P (d
))
21528 /* Handle here a deleted function too, avoid generating
21529 its body (c++/61080). */
21532 /* The definition of the static data member is now required so
21533 we must substitute the initializer. */
21535 && !DECL_INITIAL (d
)
21536 && DECL_INITIAL (code_pattern
))
21540 bool const_init
= false;
21541 bool enter_context
= DECL_CLASS_SCOPE_P (d
);
21543 ns
= decl_namespace_context (d
);
21544 push_nested_namespace (ns
);
21546 push_nested_class (DECL_CONTEXT (d
));
21547 init
= tsubst_expr (DECL_INITIAL (code_pattern
),
21549 tf_warning_or_error
, NULL_TREE
,
21550 /*integral_constant_expression_p=*/false);
21551 /* If instantiating the initializer involved instantiating this
21552 again, don't call cp_finish_decl twice. */
21553 if (!DECL_INITIAL (d
))
21555 /* Make sure the initializer is still constant, in case of
21556 circular dependency (template/instantiate6.C). */
21558 = DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (code_pattern
);
21559 cp_finish_decl (d
, init
, /*init_const_expr_p=*/const_init
,
21560 /*asmspec_tree=*/NULL_TREE
,
21561 LOOKUP_ONLYCONVERTING
);
21564 pop_nested_class ();
21565 pop_nested_namespace (ns
);
21568 /* We restore the source position here because it's used by
21569 add_pending_template. */
21570 input_location
= saved_loc
;
21572 if (at_eof
&& !pattern_defined
21573 && DECL_EXPLICIT_INSTANTIATION (d
)
21574 && DECL_NOT_REALLY_EXTERN (d
))
21577 The definition of a non-exported function template, a
21578 non-exported member function template, or a non-exported
21579 member function or static data member of a class template
21580 shall be present in every translation unit in which it is
21581 explicitly instantiated. */
21582 permerror (input_location
, "explicit instantiation of %qD "
21583 "but no definition available", d
);
21585 /* If we're in unevaluated context, we just wanted to get the
21586 constant value; this isn't an odr use, so don't queue
21587 a full instantiation. */
21588 if (cp_unevaluated_operand
!= 0)
21590 /* ??? Historically, we have instantiated inline functions, even
21591 when marked as "extern template". */
21592 if (!(external_p
&& VAR_P (d
)))
21593 add_pending_template (d
);
21596 /* Tell the repository that D is available in this translation unit
21597 -- and see if it is supposed to be instantiated here. */
21598 if (TREE_PUBLIC (d
) && !DECL_REALLY_EXTERN (d
) && !repo_emit_p (d
))
21600 /* In a PCH file, despite the fact that the repository hasn't
21601 requested instantiation in the PCH it is still possible that
21602 an instantiation will be required in a file that includes the
21605 add_pending_template (d
);
21606 /* Instantiate inline functions so that the inliner can do its
21607 job, even though we'll not be emitting a copy of this
21609 if (!(TREE_CODE (d
) == FUNCTION_DECL
&& possibly_inlined_p (d
)))
21613 fn_context
= decl_function_context (d
);
21614 nested
= (current_function_decl
!= NULL_TREE
);
21615 vec
<tree
> omp_privatization_save
;
21617 save_omp_privatization_clauses (omp_privatization_save
);
21620 push_to_top_level ();
21624 push_function_context ();
21625 cp_unevaluated_operand
= 0;
21626 c_inhibit_evaluation_warnings
= 0;
21629 /* Mark D as instantiated so that recursive calls to
21630 instantiate_decl do not try to instantiate it again. */
21631 DECL_TEMPLATE_INSTANTIATED (d
) = 1;
21633 /* Regenerate the declaration in case the template has been modified
21634 by a subsequent redeclaration. */
21635 regenerate_decl_from_template (d
, td
);
21637 /* We already set the file and line above. Reset them now in case
21638 they changed as a result of calling regenerate_decl_from_template. */
21639 input_location
= DECL_SOURCE_LOCATION (d
);
21644 bool const_init
= false;
21646 /* Clear out DECL_RTL; whatever was there before may not be right
21647 since we've reset the type of the declaration. */
21648 SET_DECL_RTL (d
, NULL
);
21649 DECL_IN_AGGR_P (d
) = 0;
21651 /* The initializer is placed in DECL_INITIAL by
21652 regenerate_decl_from_template so we don't need to
21653 push/pop_access_scope again here. Pull it out so that
21654 cp_finish_decl can process it. */
21655 init
= DECL_INITIAL (d
);
21656 DECL_INITIAL (d
) = NULL_TREE
;
21657 DECL_INITIALIZED_P (d
) = 0;
21659 /* Clear DECL_EXTERNAL so that cp_finish_decl will process the
21660 initializer. That function will defer actual emission until
21661 we have a chance to determine linkage. */
21662 DECL_EXTERNAL (d
) = 0;
21664 /* Enter the scope of D so that access-checking works correctly. */
21665 bool enter_context
= DECL_CLASS_SCOPE_P (d
);
21667 push_nested_class (DECL_CONTEXT (d
));
21669 const_init
= DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (code_pattern
);
21670 cp_finish_decl (d
, init
, const_init
, NULL_TREE
, 0);
21673 pop_nested_class ();
21675 if (variable_template_p (td
))
21676 note_variable_template_instantiation (d
);
21678 else if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_DEFAULTED_FN (code_pattern
))
21679 synthesize_method (d
);
21680 else if (TREE_CODE (d
) == FUNCTION_DECL
)
21682 hash_map
<tree
, tree
> *saved_local_specializations
;
21686 tree block
= NULL_TREE
;
21688 /* Save away the current list, in case we are instantiating one
21689 template from within the body of another. */
21690 saved_local_specializations
= local_specializations
;
21692 /* Set up the list of local specializations. */
21693 local_specializations
= new hash_map
<tree
, tree
>;
21695 /* Set up context. */
21696 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
)
21697 && TREE_CODE (DECL_CONTEXT (code_pattern
)) == FUNCTION_DECL
)
21698 block
= push_stmt_list ();
21700 start_preparsed_function (d
, NULL_TREE
, SF_PRE_PARSED
);
21702 /* Some typedefs referenced from within the template code need to be
21703 access checked at template instantiation time, i.e now. These
21704 types were added to the template at parsing time. Let's get those
21705 and perform the access checks then. */
21706 perform_typedefs_access_check (DECL_TEMPLATE_RESULT (gen_tmpl
),
21709 /* Create substitution entries for the parameters. */
21710 subst_decl
= DECL_TEMPLATE_RESULT (template_for_substitution (d
));
21711 tmpl_parm
= DECL_ARGUMENTS (subst_decl
);
21712 spec_parm
= DECL_ARGUMENTS (d
);
21713 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (d
))
21715 register_local_specialization (spec_parm
, tmpl_parm
);
21716 spec_parm
= skip_artificial_parms_for (d
, spec_parm
);
21717 tmpl_parm
= skip_artificial_parms_for (subst_decl
, tmpl_parm
);
21719 for (; tmpl_parm
; tmpl_parm
= DECL_CHAIN (tmpl_parm
))
21721 if (!DECL_PACK_P (tmpl_parm
))
21723 register_local_specialization (spec_parm
, tmpl_parm
);
21724 spec_parm
= DECL_CHAIN (spec_parm
);
21728 /* Register the (value) argument pack as a specialization of
21729 TMPL_PARM, then move on. */
21730 tree argpack
= extract_fnparm_pack (tmpl_parm
, &spec_parm
);
21731 register_local_specialization (argpack
, tmpl_parm
);
21734 gcc_assert (!spec_parm
);
21736 /* Substitute into the body of the function. */
21737 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
))
21738 tsubst_omp_udr (DECL_SAVED_TREE (code_pattern
), args
,
21739 tf_warning_or_error
, tmpl
);
21742 tsubst_expr (DECL_SAVED_TREE (code_pattern
), args
,
21743 tf_warning_or_error
, tmpl
,
21744 /*integral_constant_expression_p=*/false);
21746 /* Set the current input_location to the end of the function
21747 so that finish_function knows where we are. */
21749 = DECL_STRUCT_FUNCTION (code_pattern
)->function_end_locus
;
21751 /* Remember if we saw an infinite loop in the template. */
21752 current_function_infinite_loop
21753 = DECL_STRUCT_FUNCTION (code_pattern
)->language
->infinite_loop
;
21756 /* We don't need the local specializations any more. */
21757 delete local_specializations
;
21758 local_specializations
= saved_local_specializations
;
21760 /* Finish the function. */
21761 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
)
21762 && TREE_CODE (DECL_CONTEXT (code_pattern
)) == FUNCTION_DECL
)
21763 DECL_SAVED_TREE (d
) = pop_stmt_list (block
);
21766 d
= finish_function (0);
21767 expand_or_defer_fn (d
);
21770 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
))
21771 cp_check_omp_declare_reduction (d
);
21774 /* We're not deferring instantiation any more. */
21775 TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (d
)) = 0;
21778 pop_from_top_level ();
21780 pop_function_context ();
21783 input_location
= saved_loc
;
21784 cp_unevaluated_operand
= saved_unevaluated_operand
;
21785 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
21786 pop_deferring_access_checks ();
21787 pop_tinst_level ();
21789 restore_omp_privatization_clauses (omp_privatization_save
);
21791 timevar_pop (TV_TEMPLATE_INST
);
21796 /* Run through the list of templates that we wish we could
21797 instantiate, and instantiate any we can. RETRIES is the
21798 number of times we retry pending template instantiation. */
21801 instantiate_pending_templates (int retries
)
21804 location_t saved_loc
= input_location
;
21806 /* Instantiating templates may trigger vtable generation. This in turn
21807 may require further template instantiations. We place a limit here
21808 to avoid infinite loop. */
21809 if (pending_templates
&& retries
>= max_tinst_depth
)
21811 tree decl
= pending_templates
->tinst
->decl
;
21813 fatal_error (input_location
,
21814 "template instantiation depth exceeds maximum of %d"
21815 " instantiating %q+D, possibly from virtual table generation"
21816 " (use -ftemplate-depth= to increase the maximum)",
21817 max_tinst_depth
, decl
);
21818 if (TREE_CODE (decl
) == FUNCTION_DECL
)
21819 /* Pretend that we defined it. */
21820 DECL_INITIAL (decl
) = error_mark_node
;
21826 struct pending_template
**t
= &pending_templates
;
21827 struct pending_template
*last
= NULL
;
21831 tree instantiation
= reopen_tinst_level ((*t
)->tinst
);
21832 bool complete
= false;
21834 if (TYPE_P (instantiation
))
21838 if (!COMPLETE_TYPE_P (instantiation
))
21840 instantiate_class_template (instantiation
);
21841 if (CLASSTYPE_TEMPLATE_INSTANTIATION (instantiation
))
21842 for (fn
= TYPE_METHODS (instantiation
);
21844 fn
= TREE_CHAIN (fn
))
21845 if (! DECL_ARTIFICIAL (fn
))
21846 instantiate_decl (fn
,
21848 /*expl_inst_class_mem_p=*/false);
21849 if (COMPLETE_TYPE_P (instantiation
))
21853 complete
= COMPLETE_TYPE_P (instantiation
);
21857 if (!DECL_TEMPLATE_SPECIALIZATION (instantiation
)
21858 && !DECL_TEMPLATE_INSTANTIATED (instantiation
))
21861 = instantiate_decl (instantiation
,
21863 /*expl_inst_class_mem_p=*/false);
21864 if (DECL_TEMPLATE_INSTANTIATED (instantiation
))
21868 complete
= (DECL_TEMPLATE_SPECIALIZATION (instantiation
)
21869 || DECL_TEMPLATE_INSTANTIATED (instantiation
));
21873 /* If INSTANTIATION has been instantiated, then we don't
21874 need to consider it again in the future. */
21882 current_tinst_level
= NULL
;
21884 last_pending_template
= last
;
21886 while (reconsider
);
21888 input_location
= saved_loc
;
21891 /* Substitute ARGVEC into T, which is a list of initializers for
21892 either base class or a non-static data member. The TREE_PURPOSEs
21893 are DECLs, and the TREE_VALUEs are the initializer values. Used by
21894 instantiate_decl. */
21897 tsubst_initializer_list (tree t
, tree argvec
)
21899 tree inits
= NULL_TREE
;
21901 for (; t
; t
= TREE_CHAIN (t
))
21905 tree expanded_bases
= NULL_TREE
;
21906 tree expanded_arguments
= NULL_TREE
;
21909 if (TREE_CODE (TREE_PURPOSE (t
)) == TYPE_PACK_EXPANSION
)
21914 /* Expand the base class expansion type into separate base
21916 expanded_bases
= tsubst_pack_expansion (TREE_PURPOSE (t
), argvec
,
21917 tf_warning_or_error
,
21919 if (expanded_bases
== error_mark_node
)
21922 /* We'll be building separate TREE_LISTs of arguments for
21924 len
= TREE_VEC_LENGTH (expanded_bases
);
21925 expanded_arguments
= make_tree_vec (len
);
21926 for (i
= 0; i
< len
; i
++)
21927 TREE_VEC_ELT (expanded_arguments
, i
) = NULL_TREE
;
21929 /* Build a dummy EXPR_PACK_EXPANSION that will be used to
21930 expand each argument in the TREE_VALUE of t. */
21931 expr
= make_node (EXPR_PACK_EXPANSION
);
21932 PACK_EXPANSION_LOCAL_P (expr
) = true;
21933 PACK_EXPANSION_PARAMETER_PACKS (expr
) =
21934 PACK_EXPANSION_PARAMETER_PACKS (TREE_PURPOSE (t
));
21936 if (TREE_VALUE (t
) == void_type_node
)
21937 /* VOID_TYPE_NODE is used to indicate
21938 value-initialization. */
21940 for (i
= 0; i
< len
; i
++)
21941 TREE_VEC_ELT (expanded_arguments
, i
) = void_type_node
;
21945 /* Substitute parameter packs into each argument in the
21947 in_base_initializer
= 1;
21948 for (arg
= TREE_VALUE (t
); arg
; arg
= TREE_CHAIN (arg
))
21950 tree expanded_exprs
;
21952 /* Expand the argument. */
21953 SET_PACK_EXPANSION_PATTERN (expr
, TREE_VALUE (arg
));
21955 = tsubst_pack_expansion (expr
, argvec
,
21956 tf_warning_or_error
,
21958 if (expanded_exprs
== error_mark_node
)
21961 /* Prepend each of the expanded expressions to the
21962 corresponding TREE_LIST in EXPANDED_ARGUMENTS. */
21963 for (i
= 0; i
< len
; i
++)
21965 TREE_VEC_ELT (expanded_arguments
, i
) =
21966 tree_cons (NULL_TREE
,
21967 TREE_VEC_ELT (expanded_exprs
, i
),
21968 TREE_VEC_ELT (expanded_arguments
, i
));
21971 in_base_initializer
= 0;
21973 /* Reverse all of the TREE_LISTs in EXPANDED_ARGUMENTS,
21974 since we built them backwards. */
21975 for (i
= 0; i
< len
; i
++)
21977 TREE_VEC_ELT (expanded_arguments
, i
) =
21978 nreverse (TREE_VEC_ELT (expanded_arguments
, i
));
21983 for (i
= 0; i
< len
; ++i
)
21985 if (expanded_bases
)
21987 decl
= TREE_VEC_ELT (expanded_bases
, i
);
21988 decl
= expand_member_init (decl
);
21989 init
= TREE_VEC_ELT (expanded_arguments
, i
);
21994 decl
= tsubst_copy (TREE_PURPOSE (t
), argvec
,
21995 tf_warning_or_error
, NULL_TREE
);
21997 decl
= expand_member_init (decl
);
21998 if (decl
&& !DECL_P (decl
))
21999 in_base_initializer
= 1;
22001 init
= TREE_VALUE (t
);
22003 if (init
!= void_type_node
)
22004 init
= tsubst_expr (init
, argvec
,
22005 tf_warning_or_error
, NULL_TREE
,
22006 /*integral_constant_expression_p=*/false);
22007 if (init
== NULL_TREE
&& tmp
!= NULL_TREE
)
22008 /* If we had an initializer but it instantiated to nothing,
22009 value-initialize the object. This will only occur when
22010 the initializer was a pack expansion where the parameter
22011 packs used in that expansion were of length zero. */
22012 init
= void_type_node
;
22013 in_base_initializer
= 0;
22018 init
= build_tree_list (decl
, init
);
22019 TREE_CHAIN (init
) = inits
;
22027 /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */
22030 set_current_access_from_decl (tree decl
)
22032 if (TREE_PRIVATE (decl
))
22033 current_access_specifier
= access_private_node
;
22034 else if (TREE_PROTECTED (decl
))
22035 current_access_specifier
= access_protected_node
;
22037 current_access_specifier
= access_public_node
;
22040 /* Instantiate an enumerated type. TAG is the template type, NEWTAG
22041 is the instantiation (which should have been created with
22042 start_enum) and ARGS are the template arguments to use. */
22045 tsubst_enum (tree tag
, tree newtag
, tree args
)
22049 if (SCOPED_ENUM_P (newtag
))
22050 begin_scope (sk_scoped_enum
, newtag
);
22052 for (e
= TYPE_VALUES (tag
); e
; e
= TREE_CHAIN (e
))
22057 decl
= TREE_VALUE (e
);
22058 /* Note that in a template enum, the TREE_VALUE is the
22059 CONST_DECL, not the corresponding INTEGER_CST. */
22060 value
= tsubst_expr (DECL_INITIAL (decl
),
22061 args
, tf_warning_or_error
, NULL_TREE
,
22062 /*integral_constant_expression_p=*/true);
22064 /* Give this enumeration constant the correct access. */
22065 set_current_access_from_decl (decl
);
22067 /* Actually build the enumerator itself. Here we're assuming that
22068 enumerators can't have dependent attributes. */
22069 build_enumerator (DECL_NAME (decl
), value
, newtag
,
22070 DECL_ATTRIBUTES (decl
), DECL_SOURCE_LOCATION (decl
));
22073 if (SCOPED_ENUM_P (newtag
))
22076 finish_enum_value_list (newtag
);
22077 finish_enum (newtag
);
22079 DECL_SOURCE_LOCATION (TYPE_NAME (newtag
))
22080 = DECL_SOURCE_LOCATION (TYPE_NAME (tag
));
22083 /* DECL is a FUNCTION_DECL that is a template specialization. Return
22084 its type -- but without substituting the innermost set of template
22085 arguments. So, innermost set of template parameters will appear in
22089 get_mostly_instantiated_function_type (tree decl
)
22091 /* For a function, DECL_TI_TEMPLATE is partially instantiated. */
22092 return TREE_TYPE (DECL_TI_TEMPLATE (decl
));
22095 /* Return truthvalue if we're processing a template different from
22096 the last one involved in diagnostics. */
22098 problematic_instantiation_changed (void)
22100 return current_tinst_level
!= last_error_tinst_level
;
22103 /* Remember current template involved in diagnostics. */
22105 record_last_problematic_instantiation (void)
22107 last_error_tinst_level
= current_tinst_level
;
22110 struct tinst_level
*
22111 current_instantiation (void)
22113 return current_tinst_level
;
22116 /* Return TRUE if current_function_decl is being instantiated, false
22120 instantiating_current_function_p (void)
22122 return (current_instantiation ()
22123 && current_instantiation ()->decl
== current_function_decl
);
22126 /* [temp.param] Check that template non-type parm TYPE is of an allowable
22127 type. Return zero for ok, nonzero for disallowed. Issue error and
22128 warning messages under control of COMPLAIN. */
22131 invalid_nontype_parm_type_p (tree type
, tsubst_flags_t complain
)
22133 if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
22135 else if (POINTER_TYPE_P (type
))
22137 else if (TYPE_PTRMEM_P (type
))
22139 else if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
)
22141 else if (TREE_CODE (type
) == TYPENAME_TYPE
)
22143 else if (TREE_CODE (type
) == DECLTYPE_TYPE
)
22145 else if (TREE_CODE (type
) == NULLPTR_TYPE
)
22147 /* A bound template template parm could later be instantiated to have a valid
22148 nontype parm type via an alias template. */
22149 else if (cxx_dialect
>= cxx11
22150 && TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
22153 if (complain
& tf_error
)
22155 if (type
== error_mark_node
)
22156 inform (input_location
, "invalid template non-type parameter");
22158 error ("%q#T is not a valid type for a template non-type parameter",
22164 /* Returns TRUE if TYPE is dependent, in the sense of [temp.dep.type].
22165 Assumes that TYPE really is a type, and not the ERROR_MARK_NODE.*/
22168 dependent_type_p_r (tree type
)
22174 A type is dependent if it is:
22176 -- a template parameter. Template template parameters are types
22177 for us (since TYPE_P holds true for them) so we handle
22179 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
22180 || TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
)
22182 /* -- a qualified-id with a nested-name-specifier which contains a
22183 class-name that names a dependent type or whose unqualified-id
22184 names a dependent type. */
22185 if (TREE_CODE (type
) == TYPENAME_TYPE
)
22188 /* An alias template specialization can be dependent even if the
22189 resulting type is not. */
22190 if (dependent_alias_template_spec_p (type
))
22193 /* -- a cv-qualified type where the cv-unqualified type is
22195 No code is necessary for this bullet; the code below handles
22196 cv-qualified types, and we don't want to strip aliases with
22197 TYPE_MAIN_VARIANT because of DR 1558. */
22198 /* -- a compound type constructed from any dependent type. */
22199 if (TYPE_PTRMEM_P (type
))
22200 return (dependent_type_p (TYPE_PTRMEM_CLASS_TYPE (type
))
22201 || dependent_type_p (TYPE_PTRMEM_POINTED_TO_TYPE
22203 else if (TYPE_PTR_P (type
)
22204 || TREE_CODE (type
) == REFERENCE_TYPE
)
22205 return dependent_type_p (TREE_TYPE (type
));
22206 else if (TREE_CODE (type
) == FUNCTION_TYPE
22207 || TREE_CODE (type
) == METHOD_TYPE
)
22211 if (dependent_type_p (TREE_TYPE (type
)))
22213 for (arg_type
= TYPE_ARG_TYPES (type
);
22215 arg_type
= TREE_CHAIN (arg_type
))
22216 if (dependent_type_p (TREE_VALUE (arg_type
)))
22220 /* -- an array type constructed from any dependent type or whose
22221 size is specified by a constant expression that is
22224 We checked for type- and value-dependence of the bounds in
22225 compute_array_index_type, so TYPE_DEPENDENT_P is already set. */
22226 if (TREE_CODE (type
) == ARRAY_TYPE
)
22228 if (TYPE_DOMAIN (type
)
22229 && dependent_type_p (TYPE_DOMAIN (type
)))
22231 return dependent_type_p (TREE_TYPE (type
));
22234 /* -- a template-id in which either the template name is a template
22236 if (TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
22238 /* ... or any of the template arguments is a dependent type or
22239 an expression that is type-dependent or value-dependent. */
22240 else if (CLASS_TYPE_P (type
) && CLASSTYPE_TEMPLATE_INFO (type
)
22241 && (any_dependent_template_arguments_p
22242 (INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type
)))))
22245 /* All TYPEOF_TYPEs, DECLTYPE_TYPEs, and UNDERLYING_TYPEs are
22246 dependent; if the argument of the `typeof' expression is not
22247 type-dependent, then it should already been have resolved. */
22248 if (TREE_CODE (type
) == TYPEOF_TYPE
22249 || TREE_CODE (type
) == DECLTYPE_TYPE
22250 || TREE_CODE (type
) == UNDERLYING_TYPE
)
22253 /* A template argument pack is dependent if any of its packed
22255 if (TREE_CODE (type
) == TYPE_ARGUMENT_PACK
)
22257 tree args
= ARGUMENT_PACK_ARGS (type
);
22258 int i
, len
= TREE_VEC_LENGTH (args
);
22259 for (i
= 0; i
< len
; ++i
)
22260 if (dependent_template_arg_p (TREE_VEC_ELT (args
, i
)))
22264 /* All TYPE_PACK_EXPANSIONs are dependent, because parameter packs must
22265 be template parameters. */
22266 if (TREE_CODE (type
) == TYPE_PACK_EXPANSION
)
22269 /* The standard does not specifically mention types that are local
22270 to template functions or local classes, but they should be
22271 considered dependent too. For example:
22273 template <int I> void f() {
22278 The size of `E' cannot be known until the value of `I' has been
22279 determined. Therefore, `E' must be considered dependent. */
22280 scope
= TYPE_CONTEXT (type
);
22281 if (scope
&& TYPE_P (scope
))
22282 return dependent_type_p (scope
);
22283 /* Don't use type_dependent_expression_p here, as it can lead
22284 to infinite recursion trying to determine whether a lambda
22285 nested in a lambda is dependent (c++/47687). */
22286 else if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
22287 && DECL_LANG_SPECIFIC (scope
)
22288 && DECL_TEMPLATE_INFO (scope
)
22289 && (any_dependent_template_arguments_p
22290 (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (scope
)))))
22293 /* Other types are non-dependent. */
22297 /* Returns TRUE if TYPE is dependent, in the sense of
22298 [temp.dep.type]. Note that a NULL type is considered dependent. */
22301 dependent_type_p (tree type
)
22303 /* If there are no template parameters in scope, then there can't be
22304 any dependent types. */
22305 if (!processing_template_decl
)
22307 /* If we are not processing a template, then nobody should be
22308 providing us with a dependent type. */
22310 gcc_assert (TREE_CODE (type
) != TEMPLATE_TYPE_PARM
|| is_auto (type
));
22314 /* If the type is NULL, we have not computed a type for the entity
22315 in question; in that case, the type is dependent. */
22319 /* Erroneous types can be considered non-dependent. */
22320 if (type
== error_mark_node
)
22323 /* If we have not already computed the appropriate value for TYPE,
22325 if (!TYPE_DEPENDENT_P_VALID (type
))
22327 TYPE_DEPENDENT_P (type
) = dependent_type_p_r (type
);
22328 TYPE_DEPENDENT_P_VALID (type
) = 1;
22331 return TYPE_DEPENDENT_P (type
);
22334 /* Returns TRUE if SCOPE is a dependent scope, in which we can't do any
22335 lookup. In other words, a dependent type that is not the current
22339 dependent_scope_p (tree scope
)
22341 return (scope
&& TYPE_P (scope
) && dependent_type_p (scope
)
22342 && !currently_open_class (scope
));
22345 /* T is a SCOPE_REF; return whether we need to consider it
22346 instantiation-dependent so that we can check access at instantiation
22347 time even though we know which member it resolves to. */
22350 instantiation_dependent_scope_ref_p (tree t
)
22352 if (DECL_P (TREE_OPERAND (t
, 1))
22353 && CLASS_TYPE_P (TREE_OPERAND (t
, 0))
22354 && accessible_in_template_p (TREE_OPERAND (t
, 0),
22355 TREE_OPERAND (t
, 1)))
22361 /* Returns TRUE if the EXPRESSION is value-dependent, in the sense of
22362 [temp.dep.constexpr]. EXPRESSION is already known to be a constant
22365 /* Note that this predicate is not appropriate for general expressions;
22366 only constant expressions (that satisfy potential_constant_expression)
22367 can be tested for value dependence. */
22370 value_dependent_expression_p (tree expression
)
22372 if (!processing_template_decl
)
22375 /* A name declared with a dependent type. */
22376 if (DECL_P (expression
) && type_dependent_expression_p (expression
))
22379 switch (TREE_CODE (expression
))
22381 case IDENTIFIER_NODE
:
22382 /* A name that has not been looked up -- must be dependent. */
22385 case TEMPLATE_PARM_INDEX
:
22386 /* A non-type template parm. */
22390 /* A non-type template parm. */
22391 if (DECL_TEMPLATE_PARM_P (expression
))
22393 return value_dependent_expression_p (DECL_INITIAL (expression
));
22396 /* A constant with literal type and is initialized
22397 with an expression that is value-dependent.
22399 Note that a non-dependent parenthesized initializer will have
22400 already been replaced with its constant value, so if we see
22401 a TREE_LIST it must be dependent. */
22402 if (DECL_INITIAL (expression
)
22403 && decl_constant_var_p (expression
)
22404 && (TREE_CODE (DECL_INITIAL (expression
)) == TREE_LIST
22405 /* cp_finish_decl doesn't fold reference initializers. */
22406 || TREE_CODE (TREE_TYPE (expression
)) == REFERENCE_TYPE
22407 || value_dependent_expression_p (DECL_INITIAL (expression
))))
22411 case DYNAMIC_CAST_EXPR
:
22412 case STATIC_CAST_EXPR
:
22413 case CONST_CAST_EXPR
:
22414 case REINTERPRET_CAST_EXPR
:
22416 /* These expressions are value-dependent if the type to which
22417 the cast occurs is dependent or the expression being casted
22418 is value-dependent. */
22420 tree type
= TREE_TYPE (expression
);
22422 if (dependent_type_p (type
))
22425 /* A functional cast has a list of operands. */
22426 expression
= TREE_OPERAND (expression
, 0);
22429 /* If there are no operands, it must be an expression such
22430 as "int()". This should not happen for aggregate types
22431 because it would form non-constant expressions. */
22432 gcc_assert (cxx_dialect
>= cxx11
22433 || INTEGRAL_OR_ENUMERATION_TYPE_P (type
));
22438 if (TREE_CODE (expression
) == TREE_LIST
)
22439 return any_value_dependent_elements_p (expression
);
22441 return value_dependent_expression_p (expression
);
22445 if (SIZEOF_EXPR_TYPE_P (expression
))
22446 return dependent_type_p (TREE_TYPE (TREE_OPERAND (expression
, 0)));
22450 /* A `sizeof' expression is value-dependent if the operand is
22451 type-dependent or is a pack expansion. */
22452 expression
= TREE_OPERAND (expression
, 0);
22453 if (PACK_EXPANSION_P (expression
))
22455 else if (TYPE_P (expression
))
22456 return dependent_type_p (expression
);
22457 return instantiation_dependent_expression_p (expression
);
22459 case AT_ENCODE_EXPR
:
22460 /* An 'encode' expression is value-dependent if the operand is
22462 expression
= TREE_OPERAND (expression
, 0);
22463 return dependent_type_p (expression
);
22465 case NOEXCEPT_EXPR
:
22466 expression
= TREE_OPERAND (expression
, 0);
22467 return instantiation_dependent_expression_p (expression
);
22470 /* All instantiation-dependent expressions should also be considered
22471 value-dependent. */
22472 return instantiation_dependent_scope_ref_p (expression
);
22474 case COMPONENT_REF
:
22475 return (value_dependent_expression_p (TREE_OPERAND (expression
, 0))
22476 || value_dependent_expression_p (TREE_OPERAND (expression
, 1)));
22478 case NONTYPE_ARGUMENT_PACK
:
22479 /* A NONTYPE_ARGUMENT_PACK is value-dependent if any packed argument
22480 is value-dependent. */
22482 tree values
= ARGUMENT_PACK_ARGS (expression
);
22483 int i
, len
= TREE_VEC_LENGTH (values
);
22485 for (i
= 0; i
< len
; ++i
)
22486 if (value_dependent_expression_p (TREE_VEC_ELT (values
, i
)))
22494 tree type2
= TRAIT_EXPR_TYPE2 (expression
);
22495 return (dependent_type_p (TRAIT_EXPR_TYPE1 (expression
))
22496 || (type2
? dependent_type_p (type2
) : false));
22500 return ((value_dependent_expression_p (TREE_OPERAND (expression
, 0)))
22501 || (value_dependent_expression_p (TREE_OPERAND (expression
, 2))));
22504 return ((value_dependent_expression_p (TREE_OPERAND (expression
, 0)))
22505 || (value_dependent_expression_p (TREE_OPERAND (expression
, 1))));
22509 tree op
= TREE_OPERAND (expression
, 0);
22510 return (value_dependent_expression_p (op
)
22511 || has_value_dependent_address (op
));
22514 case REQUIRES_EXPR
:
22515 /* Treat all requires-expressions as value-dependent so
22516 we don't try to fold them. */
22520 return dependent_type_p (TREE_OPERAND (expression
, 0));
22524 tree fn
= get_callee_fndecl (expression
);
22526 if (!fn
&& value_dependent_expression_p (CALL_EXPR_FN (expression
)))
22528 nargs
= call_expr_nargs (expression
);
22529 for (i
= 0; i
< nargs
; ++i
)
22531 tree op
= CALL_EXPR_ARG (expression
, i
);
22532 /* In a call to a constexpr member function, look through the
22533 implicit ADDR_EXPR on the object argument so that it doesn't
22534 cause the call to be considered value-dependent. We also
22535 look through it in potential_constant_expression. */
22536 if (i
== 0 && fn
&& DECL_DECLARED_CONSTEXPR_P (fn
)
22537 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
22538 && TREE_CODE (op
) == ADDR_EXPR
)
22539 op
= TREE_OPERAND (op
, 0);
22540 if (value_dependent_expression_p (op
))
22546 case TEMPLATE_ID_EXPR
:
22547 /* If a TEMPLATE_ID_EXPR involves a dependent name, it will be
22549 return type_dependent_expression_p (expression
)
22550 || variable_concept_p (TREE_OPERAND (expression
, 0));
22556 if (dependent_type_p (TREE_TYPE (expression
)))
22558 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expression
), ix
, val
)
22559 if (value_dependent_expression_p (val
))
22565 /* Treat a GNU statement expression as dependent to avoid crashing
22566 under instantiate_non_dependent_expr; it can't be constant. */
22570 /* A constant expression is value-dependent if any subexpression is
22571 value-dependent. */
22572 switch (TREE_CODE_CLASS (TREE_CODE (expression
)))
22574 case tcc_reference
:
22576 case tcc_comparison
:
22578 case tcc_expression
:
22581 int i
, len
= cp_tree_operand_length (expression
);
22583 for (i
= 0; i
< len
; i
++)
22585 tree t
= TREE_OPERAND (expression
, i
);
22587 /* In some cases, some of the operands may be missing.l
22588 (For example, in the case of PREDECREMENT_EXPR, the
22589 amount to increment by may be missing.) That doesn't
22590 make the expression dependent. */
22591 if (t
&& value_dependent_expression_p (t
))
22602 /* The expression is not value-dependent. */
22606 /* Returns TRUE if the EXPRESSION is type-dependent, in the sense of
22607 [temp.dep.expr]. Note that an expression with no type is
22608 considered dependent. Other parts of the compiler arrange for an
22609 expression with type-dependent subexpressions to have no type, so
22610 this function doesn't have to be fully recursive. */
22613 type_dependent_expression_p (tree expression
)
22615 if (!processing_template_decl
)
22618 if (expression
== NULL_TREE
|| expression
== error_mark_node
)
22621 /* An unresolved name is always dependent. */
22622 if (identifier_p (expression
)
22623 || TREE_CODE (expression
) == USING_DECL
22624 || TREE_CODE (expression
) == WILDCARD_DECL
)
22627 /* A fold expression is type-dependent. */
22628 if (TREE_CODE (expression
) == UNARY_LEFT_FOLD_EXPR
22629 || TREE_CODE (expression
) == UNARY_RIGHT_FOLD_EXPR
22630 || TREE_CODE (expression
) == BINARY_LEFT_FOLD_EXPR
22631 || TREE_CODE (expression
) == BINARY_RIGHT_FOLD_EXPR
)
22634 /* Some expression forms are never type-dependent. */
22635 if (TREE_CODE (expression
) == PSEUDO_DTOR_EXPR
22636 || TREE_CODE (expression
) == SIZEOF_EXPR
22637 || TREE_CODE (expression
) == ALIGNOF_EXPR
22638 || TREE_CODE (expression
) == AT_ENCODE_EXPR
22639 || TREE_CODE (expression
) == NOEXCEPT_EXPR
22640 || TREE_CODE (expression
) == TRAIT_EXPR
22641 || TREE_CODE (expression
) == TYPEID_EXPR
22642 || TREE_CODE (expression
) == DELETE_EXPR
22643 || TREE_CODE (expression
) == VEC_DELETE_EXPR
22644 || TREE_CODE (expression
) == THROW_EXPR
22645 || TREE_CODE (expression
) == REQUIRES_EXPR
)
22648 /* The types of these expressions depends only on the type to which
22649 the cast occurs. */
22650 if (TREE_CODE (expression
) == DYNAMIC_CAST_EXPR
22651 || TREE_CODE (expression
) == STATIC_CAST_EXPR
22652 || TREE_CODE (expression
) == CONST_CAST_EXPR
22653 || TREE_CODE (expression
) == REINTERPRET_CAST_EXPR
22654 || TREE_CODE (expression
) == IMPLICIT_CONV_EXPR
22655 || TREE_CODE (expression
) == CAST_EXPR
)
22656 return dependent_type_p (TREE_TYPE (expression
));
22658 /* The types of these expressions depends only on the type created
22659 by the expression. */
22660 if (TREE_CODE (expression
) == NEW_EXPR
22661 || TREE_CODE (expression
) == VEC_NEW_EXPR
)
22663 /* For NEW_EXPR tree nodes created inside a template, either
22664 the object type itself or a TREE_LIST may appear as the
22666 tree type
= TREE_OPERAND (expression
, 1);
22667 if (TREE_CODE (type
) == TREE_LIST
)
22668 /* This is an array type. We need to check array dimensions
22670 return dependent_type_p (TREE_VALUE (TREE_PURPOSE (type
)))
22671 || value_dependent_expression_p
22672 (TREE_OPERAND (TREE_VALUE (type
), 1));
22674 return dependent_type_p (type
);
22677 if (TREE_CODE (expression
) == SCOPE_REF
)
22679 tree scope
= TREE_OPERAND (expression
, 0);
22680 tree name
= TREE_OPERAND (expression
, 1);
22682 /* 14.6.2.2 [temp.dep.expr]: An id-expression is type-dependent if it
22683 contains an identifier associated by name lookup with one or more
22684 declarations declared with a dependent type, or...a
22685 nested-name-specifier or qualified-id that names a member of an
22686 unknown specialization. */
22687 return (type_dependent_expression_p (name
)
22688 || dependent_scope_p (scope
));
22691 if (TREE_CODE (expression
) == FUNCTION_DECL
22692 && DECL_LANG_SPECIFIC (expression
)
22693 && DECL_TEMPLATE_INFO (expression
)
22694 && (any_dependent_template_arguments_p
22695 (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (expression
)))))
22698 if (TREE_CODE (expression
) == TEMPLATE_DECL
22699 && !DECL_TEMPLATE_TEMPLATE_PARM_P (expression
))
22702 if (TREE_CODE (expression
) == STMT_EXPR
)
22703 expression
= stmt_expr_value_expr (expression
);
22705 if (BRACE_ENCLOSED_INITIALIZER_P (expression
))
22710 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expression
), i
, elt
)
22712 if (type_dependent_expression_p (elt
))
22718 /* A static data member of the current instantiation with incomplete
22719 array type is type-dependent, as the definition and specializations
22720 can have different bounds. */
22721 if (VAR_P (expression
)
22722 && DECL_CLASS_SCOPE_P (expression
)
22723 && dependent_type_p (DECL_CONTEXT (expression
))
22724 && VAR_HAD_UNKNOWN_BOUND (expression
))
22727 /* An array of unknown bound depending on a variadic parameter, eg:
22729 template<typename... Args>
22730 void foo (Args... args)
22732 int arr[] = { args... };
22735 template<int... vals>
22738 int arr[] = { vals... };
22741 If the array has no length and has an initializer, it must be that
22742 we couldn't determine its length in cp_complete_array_type because
22743 it is dependent. */
22744 if (VAR_P (expression
)
22745 && TREE_CODE (TREE_TYPE (expression
)) == ARRAY_TYPE
22746 && !TYPE_DOMAIN (TREE_TYPE (expression
))
22747 && DECL_INITIAL (expression
))
22750 /* A variable template specialization is type-dependent if it has any
22751 dependent template arguments. */
22752 if (VAR_P (expression
)
22753 && DECL_LANG_SPECIFIC (expression
)
22754 && DECL_TEMPLATE_INFO (expression
)
22755 && variable_template_p (DECL_TI_TEMPLATE (expression
)))
22756 return any_dependent_template_arguments_p (DECL_TI_ARGS (expression
));
22758 /* Always dependent, on the number of arguments if nothing else. */
22759 if (TREE_CODE (expression
) == EXPR_PACK_EXPANSION
)
22762 if (TREE_TYPE (expression
) == unknown_type_node
)
22764 if (TREE_CODE (expression
) == ADDR_EXPR
)
22765 return type_dependent_expression_p (TREE_OPERAND (expression
, 0));
22766 if (TREE_CODE (expression
) == COMPONENT_REF
22767 || TREE_CODE (expression
) == OFFSET_REF
)
22769 if (type_dependent_expression_p (TREE_OPERAND (expression
, 0)))
22771 expression
= TREE_OPERAND (expression
, 1);
22772 if (identifier_p (expression
))
22775 /* SCOPE_REF with non-null TREE_TYPE is always non-dependent. */
22776 if (TREE_CODE (expression
) == SCOPE_REF
)
22779 if (BASELINK_P (expression
))
22781 if (BASELINK_OPTYPE (expression
)
22782 && dependent_type_p (BASELINK_OPTYPE (expression
)))
22784 expression
= BASELINK_FUNCTIONS (expression
);
22787 if (TREE_CODE (expression
) == TEMPLATE_ID_EXPR
)
22789 if (any_dependent_template_arguments_p
22790 (TREE_OPERAND (expression
, 1)))
22792 expression
= TREE_OPERAND (expression
, 0);
22793 if (identifier_p (expression
))
22797 gcc_assert (TREE_CODE (expression
) == OVERLOAD
22798 || TREE_CODE (expression
) == FUNCTION_DECL
);
22802 if (type_dependent_expression_p (OVL_CURRENT (expression
)))
22804 expression
= OVL_NEXT (expression
);
22809 gcc_assert (TREE_CODE (expression
) != TYPE_DECL
);
22811 return (dependent_type_p (TREE_TYPE (expression
)));
22814 /* walk_tree callback function for instantiation_dependent_expression_p,
22815 below. Returns non-zero if a dependent subexpression is found. */
22818 instantiation_dependent_r (tree
*tp
, int *walk_subtrees
,
22823 /* We don't have to worry about decltype currently because decltype
22824 of an instantiation-dependent expr is a dependent type. This
22825 might change depending on the resolution of DR 1172. */
22826 *walk_subtrees
= false;
22829 enum tree_code code
= TREE_CODE (*tp
);
22832 /* Don't treat an argument list as dependent just because it has no
22840 /* A constant with a dependent initializer is dependent. */
22841 if (value_dependent_expression_p (*tp
))
22845 case TEMPLATE_PARM_INDEX
:
22848 /* Handle expressions with type operands. */
22852 case AT_ENCODE_EXPR
:
22854 tree op
= TREE_OPERAND (*tp
, 0);
22855 if (code
== SIZEOF_EXPR
&& SIZEOF_EXPR_TYPE_P (*tp
))
22856 op
= TREE_TYPE (op
);
22859 if (dependent_type_p (op
))
22863 *walk_subtrees
= false;
22871 if (value_dependent_expression_p (*tp
))
22873 *walk_subtrees
= false;
22876 case COMPONENT_REF
:
22877 if (identifier_p (TREE_OPERAND (*tp
, 1)))
22878 /* In a template, finish_class_member_access_expr creates a
22879 COMPONENT_REF with an IDENTIFIER_NODE for op1 even if it isn't
22880 type-dependent, so that we can check access control at
22881 instantiation time (PR 42277). See also Core issue 1273. */
22886 if (instantiation_dependent_scope_ref_p (*tp
))
22891 /* Treat statement-expressions as dependent. */
22895 /* Treat requires-expressions as dependent. */
22896 case REQUIRES_EXPR
:
22900 /* Treat calls to function concepts as dependent. */
22901 if (function_concept_check_p (*tp
))
22905 case TEMPLATE_ID_EXPR
:
22906 /* And variable concepts. */
22907 if (variable_concept_p (TREE_OPERAND (*tp
, 0)))
22915 if (type_dependent_expression_p (*tp
))
22921 /* Returns TRUE if the EXPRESSION is instantiation-dependent, in the
22922 sense defined by the ABI:
22924 "An expression is instantiation-dependent if it is type-dependent
22925 or value-dependent, or it has a subexpression that is type-dependent
22926 or value-dependent." */
22929 instantiation_dependent_expression_p (tree expression
)
22933 if (!processing_template_decl
)
22936 if (expression
== error_mark_node
)
22939 result
= cp_walk_tree_without_duplicates (&expression
,
22940 instantiation_dependent_r
, NULL
);
22941 return result
!= NULL_TREE
;
22944 /* Like type_dependent_expression_p, but it also works while not processing
22945 a template definition, i.e. during substitution or mangling. */
22948 type_dependent_expression_p_push (tree expr
)
22951 ++processing_template_decl
;
22952 b
= type_dependent_expression_p (expr
);
22953 --processing_template_decl
;
22957 /* Returns TRUE if ARGS contains a type-dependent expression. */
22960 any_type_dependent_arguments_p (const vec
<tree
, va_gc
> *args
)
22965 FOR_EACH_VEC_SAFE_ELT (args
, i
, arg
)
22967 if (type_dependent_expression_p (arg
))
22973 /* Returns TRUE if LIST (a TREE_LIST whose TREE_VALUEs are
22974 expressions) contains any type-dependent expressions. */
22977 any_type_dependent_elements_p (const_tree list
)
22979 for (; list
; list
= TREE_CHAIN (list
))
22980 if (type_dependent_expression_p (TREE_VALUE (list
)))
22986 /* Returns TRUE if LIST (a TREE_LIST whose TREE_VALUEs are
22987 expressions) contains any value-dependent expressions. */
22990 any_value_dependent_elements_p (const_tree list
)
22992 for (; list
; list
= TREE_CHAIN (list
))
22993 if (value_dependent_expression_p (TREE_VALUE (list
)))
22999 /* Returns TRUE if the ARG (a template argument) is dependent. */
23002 dependent_template_arg_p (tree arg
)
23004 if (!processing_template_decl
)
23007 /* Assume a template argument that was wrongly written by the user
23008 is dependent. This is consistent with what
23009 any_dependent_template_arguments_p [that calls this function]
23011 if (!arg
|| arg
== error_mark_node
)
23014 if (TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
23015 arg
= ARGUMENT_PACK_SELECT_ARG (arg
);
23017 if (TREE_CODE (arg
) == TEMPLATE_DECL
23018 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
23019 return dependent_template_p (arg
);
23020 else if (ARGUMENT_PACK_P (arg
))
23022 tree args
= ARGUMENT_PACK_ARGS (arg
);
23023 int i
, len
= TREE_VEC_LENGTH (args
);
23024 for (i
= 0; i
< len
; ++i
)
23026 if (dependent_template_arg_p (TREE_VEC_ELT (args
, i
)))
23032 else if (TYPE_P (arg
))
23033 return dependent_type_p (arg
);
23035 return (type_dependent_expression_p (arg
)
23036 || value_dependent_expression_p (arg
));
23039 /* Returns true if ARGS (a collection of template arguments) contains
23040 any types that require structural equality testing. */
23043 any_template_arguments_need_structural_equality_p (tree args
)
23050 if (args
== error_mark_node
)
23053 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
23055 tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
23056 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
23058 tree arg
= TREE_VEC_ELT (level
, j
);
23059 tree packed_args
= NULL_TREE
;
23062 if (ARGUMENT_PACK_P (arg
))
23064 /* Look inside the argument pack. */
23065 packed_args
= ARGUMENT_PACK_ARGS (arg
);
23066 len
= TREE_VEC_LENGTH (packed_args
);
23069 for (k
= 0; k
< len
; ++k
)
23072 arg
= TREE_VEC_ELT (packed_args
, k
);
23074 if (error_operand_p (arg
))
23076 else if (TREE_CODE (arg
) == TEMPLATE_DECL
)
23078 else if (TYPE_P (arg
) && TYPE_STRUCTURAL_EQUALITY_P (arg
))
23080 else if (!TYPE_P (arg
) && TREE_TYPE (arg
)
23081 && TYPE_STRUCTURAL_EQUALITY_P (TREE_TYPE (arg
)))
23090 /* Returns true if ARGS (a collection of template arguments) contains
23091 any dependent arguments. */
23094 any_dependent_template_arguments_p (const_tree args
)
23101 if (args
== error_mark_node
)
23104 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
23106 const_tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
23107 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
23108 if (dependent_template_arg_p (TREE_VEC_ELT (level
, j
)))
23115 /* Returns TRUE if the template TMPL is dependent. */
23118 dependent_template_p (tree tmpl
)
23120 if (TREE_CODE (tmpl
) == OVERLOAD
)
23124 if (dependent_template_p (OVL_CURRENT (tmpl
)))
23126 tmpl
= OVL_NEXT (tmpl
);
23131 /* Template template parameters are dependent. */
23132 if (DECL_TEMPLATE_TEMPLATE_PARM_P (tmpl
)
23133 || TREE_CODE (tmpl
) == TEMPLATE_TEMPLATE_PARM
)
23135 /* So are names that have not been looked up. */
23136 if (TREE_CODE (tmpl
) == SCOPE_REF
|| identifier_p (tmpl
))
23138 /* So are member templates of dependent classes. */
23139 if (TYPE_P (CP_DECL_CONTEXT (tmpl
)))
23140 return dependent_type_p (DECL_CONTEXT (tmpl
));
23144 /* Returns TRUE if the specialization TMPL<ARGS> is dependent. */
23147 dependent_template_id_p (tree tmpl
, tree args
)
23149 return (dependent_template_p (tmpl
)
23150 || any_dependent_template_arguments_p (args
));
23153 /* Returns TRUE if OMP_FOR with DECLV, INITV, CONDV and INCRV vectors
23157 dependent_omp_for_p (tree declv
, tree initv
, tree condv
, tree incrv
)
23161 if (!processing_template_decl
)
23164 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
23166 tree decl
= TREE_VEC_ELT (declv
, i
);
23167 tree init
= TREE_VEC_ELT (initv
, i
);
23168 tree cond
= TREE_VEC_ELT (condv
, i
);
23169 tree incr
= TREE_VEC_ELT (incrv
, i
);
23171 if (type_dependent_expression_p (decl
)
23172 || TREE_CODE (decl
) == SCOPE_REF
)
23175 if (init
&& type_dependent_expression_p (init
))
23178 if (type_dependent_expression_p (cond
))
23181 if (COMPARISON_CLASS_P (cond
)
23182 && (type_dependent_expression_p (TREE_OPERAND (cond
, 0))
23183 || type_dependent_expression_p (TREE_OPERAND (cond
, 1))))
23186 if (TREE_CODE (incr
) == MODOP_EXPR
)
23188 if (type_dependent_expression_p (TREE_OPERAND (incr
, 0))
23189 || type_dependent_expression_p (TREE_OPERAND (incr
, 2)))
23192 else if (type_dependent_expression_p (incr
))
23194 else if (TREE_CODE (incr
) == MODIFY_EXPR
)
23196 if (type_dependent_expression_p (TREE_OPERAND (incr
, 0)))
23198 else if (BINARY_CLASS_P (TREE_OPERAND (incr
, 1)))
23200 tree t
= TREE_OPERAND (incr
, 1);
23201 if (type_dependent_expression_p (TREE_OPERAND (t
, 0))
23202 || type_dependent_expression_p (TREE_OPERAND (t
, 1)))
23211 /* TYPE is a TYPENAME_TYPE. Returns the ordinary TYPE to which the
23212 TYPENAME_TYPE corresponds. Returns the original TYPENAME_TYPE if
23213 no such TYPE can be found. Note that this function peers inside
23214 uninstantiated templates and therefore should be used only in
23215 extremely limited situations. ONLY_CURRENT_P restricts this
23216 peering to the currently open classes hierarchy (which is required
23217 when comparing types). */
23220 resolve_typename_type (tree type
, bool only_current_p
)
23229 gcc_assert (TREE_CODE (type
) == TYPENAME_TYPE
);
23231 scope
= TYPE_CONTEXT (type
);
23232 /* Usually the non-qualified identifier of a TYPENAME_TYPE is
23233 TYPE_IDENTIFIER (type). But when 'type' is a typedef variant of
23234 a TYPENAME_TYPE node, then TYPE_NAME (type) is set to the TYPE_DECL representing
23235 the typedef. In that case TYPE_IDENTIFIER (type) is not the non-qualified
23236 identifier of the TYPENAME_TYPE anymore.
23237 So by getting the TYPE_IDENTIFIER of the _main declaration_ of the
23238 TYPENAME_TYPE instead, we avoid messing up with a possible
23239 typedef variant case. */
23240 name
= TYPE_IDENTIFIER (TYPE_MAIN_VARIANT (type
));
23242 /* If the SCOPE is itself a TYPENAME_TYPE, then we need to resolve
23243 it first before we can figure out what NAME refers to. */
23244 if (TREE_CODE (scope
) == TYPENAME_TYPE
)
23246 if (TYPENAME_IS_RESOLVING_P (scope
))
23247 /* Given a class template A with a dependent base with nested type C,
23248 typedef typename A::C::C C will land us here, as trying to resolve
23249 the initial A::C leads to the local C typedef, which leads back to
23250 A::C::C. So we break the recursion now. */
23253 scope
= resolve_typename_type (scope
, only_current_p
);
23255 /* If we don't know what SCOPE refers to, then we cannot resolve the
23257 if (TREE_CODE (scope
) == TYPENAME_TYPE
)
23259 /* If the SCOPE is a template type parameter, we have no way of
23260 resolving the name. */
23261 if (TREE_CODE (scope
) == TEMPLATE_TYPE_PARM
)
23263 /* If the SCOPE is not the current instantiation, there's no reason
23264 to look inside it. */
23265 if (only_current_p
&& !currently_open_class (scope
))
23267 /* If this is a typedef, we don't want to look inside (c++/11987). */
23268 if (typedef_variant_p (type
))
23270 /* If SCOPE isn't the template itself, it will not have a valid
23271 TYPE_FIELDS list. */
23272 if (CLASS_TYPE_P (scope
)
23273 && same_type_p (scope
, CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope
)))
23274 /* scope is either the template itself or a compatible instantiation
23275 like X<T>, so look up the name in the original template. */
23276 scope
= CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope
);
23278 /* scope is a partial instantiation, so we can't do the lookup or we
23279 will lose the template arguments. */
23281 /* Enter the SCOPE so that name lookup will be resolved as if we
23282 were in the class definition. In particular, SCOPE will no
23283 longer be considered a dependent type. */
23284 pushed_scope
= push_scope (scope
);
23285 /* Look up the declaration. */
23286 decl
= lookup_member (scope
, name
, /*protect=*/0, /*want_type=*/true,
23287 tf_warning_or_error
);
23289 result
= NULL_TREE
;
23291 /* For a TYPENAME_TYPE like "typename X::template Y<T>", we want to
23292 find a TEMPLATE_DECL. Otherwise, we want to find a TYPE_DECL. */
23295 else if (identifier_p (TYPENAME_TYPE_FULLNAME (type
))
23296 && TREE_CODE (decl
) == TYPE_DECL
)
23298 result
= TREE_TYPE (decl
);
23299 if (result
== error_mark_node
)
23300 result
= NULL_TREE
;
23302 else if (TREE_CODE (TYPENAME_TYPE_FULLNAME (type
)) == TEMPLATE_ID_EXPR
23303 && DECL_CLASS_TEMPLATE_P (decl
))
23307 /* Obtain the template and the arguments. */
23308 tmpl
= TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type
), 0);
23309 args
= TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type
), 1);
23310 /* Instantiate the template. */
23311 result
= lookup_template_class (tmpl
, args
, NULL_TREE
, NULL_TREE
,
23312 /*entering_scope=*/0,
23313 tf_error
| tf_user
);
23314 if (result
== error_mark_node
)
23315 result
= NULL_TREE
;
23318 /* Leave the SCOPE. */
23320 pop_scope (pushed_scope
);
23322 /* If we failed to resolve it, return the original typename. */
23326 /* If lookup found a typename type, resolve that too. */
23327 if (TREE_CODE (result
) == TYPENAME_TYPE
&& !TYPENAME_IS_RESOLVING_P (result
))
23329 /* Ill-formed programs can cause infinite recursion here, so we
23330 must catch that. */
23331 TYPENAME_IS_RESOLVING_P (type
) = 1;
23332 result
= resolve_typename_type (result
, only_current_p
);
23333 TYPENAME_IS_RESOLVING_P (type
) = 0;
23336 /* Qualify the resulting type. */
23337 quals
= cp_type_quals (type
);
23339 result
= cp_build_qualified_type (result
, cp_type_quals (result
) | quals
);
23344 /* EXPR is an expression which is not type-dependent. Return a proxy
23345 for EXPR that can be used to compute the types of larger
23346 expressions containing EXPR. */
23349 build_non_dependent_expr (tree expr
)
23353 /* Try to get a constant value for all non-dependent expressions in
23354 order to expose bugs in *_dependent_expression_p and constexpr. */
23355 if (flag_checking
&& cxx_dialect
>= cxx11
)
23356 fold_non_dependent_expr (expr
);
23358 /* Preserve OVERLOADs; the functions must be available to resolve
23361 if (TREE_CODE (inner_expr
) == STMT_EXPR
)
23362 inner_expr
= stmt_expr_value_expr (inner_expr
);
23363 if (TREE_CODE (inner_expr
) == ADDR_EXPR
)
23364 inner_expr
= TREE_OPERAND (inner_expr
, 0);
23365 if (TREE_CODE (inner_expr
) == COMPONENT_REF
)
23366 inner_expr
= TREE_OPERAND (inner_expr
, 1);
23367 if (is_overloaded_fn (inner_expr
)
23368 || TREE_CODE (inner_expr
) == OFFSET_REF
)
23370 /* There is no need to return a proxy for a variable. */
23373 /* Preserve string constants; conversions from string constants to
23374 "char *" are allowed, even though normally a "const char *"
23375 cannot be used to initialize a "char *". */
23376 if (TREE_CODE (expr
) == STRING_CST
)
23378 /* Preserve void and arithmetic constants, as an optimization -- there is no
23379 reason to create a new node. */
23380 if (TREE_CODE (expr
) == VOID_CST
23381 || TREE_CODE (expr
) == INTEGER_CST
23382 || TREE_CODE (expr
) == REAL_CST
)
23384 /* Preserve THROW_EXPRs -- all throw-expressions have type "void".
23385 There is at least one place where we want to know that a
23386 particular expression is a throw-expression: when checking a ?:
23387 expression, there are special rules if the second or third
23388 argument is a throw-expression. */
23389 if (TREE_CODE (expr
) == THROW_EXPR
)
23392 /* Don't wrap an initializer list, we need to be able to look inside. */
23393 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
23396 /* Don't wrap a dummy object, we need to be able to test for it. */
23397 if (is_dummy_object (expr
))
23400 if (TREE_CODE (expr
) == COND_EXPR
)
23401 return build3 (COND_EXPR
,
23403 TREE_OPERAND (expr
, 0),
23404 (TREE_OPERAND (expr
, 1)
23405 ? build_non_dependent_expr (TREE_OPERAND (expr
, 1))
23406 : build_non_dependent_expr (TREE_OPERAND (expr
, 0))),
23407 build_non_dependent_expr (TREE_OPERAND (expr
, 2)));
23408 if (TREE_CODE (expr
) == COMPOUND_EXPR
23409 && !COMPOUND_EXPR_OVERLOADED (expr
))
23410 return build2 (COMPOUND_EXPR
,
23412 TREE_OPERAND (expr
, 0),
23413 build_non_dependent_expr (TREE_OPERAND (expr
, 1)));
23415 /* If the type is unknown, it can't really be non-dependent */
23416 gcc_assert (TREE_TYPE (expr
) != unknown_type_node
);
23418 /* Otherwise, build a NON_DEPENDENT_EXPR. */
23419 return build1 (NON_DEPENDENT_EXPR
, TREE_TYPE (expr
), expr
);
23422 /* ARGS is a vector of expressions as arguments to a function call.
23423 Replace the arguments with equivalent non-dependent expressions.
23424 This modifies ARGS in place. */
23427 make_args_non_dependent (vec
<tree
, va_gc
> *args
)
23432 FOR_EACH_VEC_SAFE_ELT (args
, ix
, arg
)
23434 tree newarg
= build_non_dependent_expr (arg
);
23436 (*args
)[ix
] = newarg
;
23440 /* Returns a type which represents 'auto' or 'decltype(auto)'. We use a
23441 TEMPLATE_TYPE_PARM with a level one deeper than the actual template
23445 make_auto_1 (tree name
)
23447 tree au
= cxx_make_type (TEMPLATE_TYPE_PARM
);
23448 TYPE_NAME (au
) = build_decl (input_location
,
23449 TYPE_DECL
, name
, au
);
23450 TYPE_STUB_DECL (au
) = TYPE_NAME (au
);
23451 TEMPLATE_TYPE_PARM_INDEX (au
) = build_template_parm_index
23452 (0, processing_template_decl
+ 1, processing_template_decl
+ 1,
23453 TYPE_NAME (au
), NULL_TREE
);
23454 TYPE_CANONICAL (au
) = canonical_type_parameter (au
);
23455 DECL_ARTIFICIAL (TYPE_NAME (au
)) = 1;
23456 SET_DECL_TEMPLATE_PARM_P (TYPE_NAME (au
));
23462 make_decltype_auto (void)
23464 return make_auto_1 (get_identifier ("decltype(auto)"));
23470 return make_auto_1 (get_identifier ("auto"));
23473 /* Given type ARG, return std::initializer_list<ARG>. */
23478 tree std_init_list
= namespace_binding
23479 (get_identifier ("initializer_list"), std_node
);
23481 if (!std_init_list
|| !DECL_CLASS_TEMPLATE_P (std_init_list
))
23483 error ("deducing from brace-enclosed initializer list requires "
23484 "#include <initializer_list>");
23485 return error_mark_node
;
23487 argvec
= make_tree_vec (1);
23488 TREE_VEC_ELT (argvec
, 0) = arg
;
23489 return lookup_template_class (std_init_list
, argvec
, NULL_TREE
,
23490 NULL_TREE
, 0, tf_warning_or_error
);
23493 /* Replace auto in TYPE with std::initializer_list<auto>. */
23496 listify_autos (tree type
, tree auto_node
)
23498 tree init_auto
= listify (auto_node
);
23499 tree argvec
= make_tree_vec (1);
23500 TREE_VEC_ELT (argvec
, 0) = init_auto
;
23501 if (processing_template_decl
)
23502 argvec
= add_to_template_args (current_template_args (), argvec
);
23503 return tsubst (type
, argvec
, tf_warning_or_error
, NULL_TREE
);
23506 /* Hash traits for hashing possibly constrained 'auto'
23507 TEMPLATE_TYPE_PARMs for use by do_auto_deduction. */
23509 struct auto_hash
: default_hash_traits
<tree
>
23511 static inline hashval_t
hash (tree
);
23512 static inline bool equal (tree
, tree
);
23515 /* Hash the 'auto' T. */
23518 auto_hash::hash (tree t
)
23520 if (tree c
= PLACEHOLDER_TYPE_CONSTRAINTS (t
))
23521 /* Matching constrained-type-specifiers denote the same template
23522 parameter, so hash the constraint. */
23523 return hash_placeholder_constraint (c
);
23525 /* But unconstrained autos are all separate, so just hash the pointer. */
23526 return iterative_hash_object (t
, 0);
23529 /* Compare two 'auto's. */
23532 auto_hash::equal (tree t1
, tree t2
)
23537 tree c1
= PLACEHOLDER_TYPE_CONSTRAINTS (t1
);
23538 tree c2
= PLACEHOLDER_TYPE_CONSTRAINTS (t2
);
23540 /* Two unconstrained autos are distinct. */
23544 return equivalent_placeholder_constraints (c1
, c2
);
23547 /* for_each_template_parm callback for extract_autos: if t is a (possibly
23548 constrained) auto, add it to the vector. */
23551 extract_autos_r (tree t
, void *data
)
23553 hash_table
<auto_hash
> &hash
= *(hash_table
<auto_hash
>*)data
;
23554 if (is_auto_or_concept (t
))
23556 /* All the autos were built with index 0; fix that up now. */
23557 tree
*p
= hash
.find_slot (t
, INSERT
);
23560 /* If this is a repeated constrained-type-specifier, use the index we
23562 idx
= TEMPLATE_PARM_IDX (TEMPLATE_TYPE_PARM_INDEX (*p
));
23565 /* Otherwise this is new, so use the current count. */
23567 idx
= hash
.elements () - 1;
23569 TEMPLATE_PARM_IDX (TEMPLATE_TYPE_PARM_INDEX (t
)) = idx
;
23572 /* Always keep walking. */
23576 /* Return a TREE_VEC of the 'auto's used in type under the Concepts TS, which
23577 says they can appear anywhere in the type. */
23580 extract_autos (tree type
)
23582 hash_set
<tree
> visited
;
23583 hash_table
<auto_hash
> hash (2);
23585 for_each_template_parm (type
, extract_autos_r
, &hash
, &visited
, true);
23587 tree tree_vec
= make_tree_vec (hash
.elements());
23588 for (hash_table
<auto_hash
>::iterator iter
= hash
.begin();
23589 iter
!= hash
.end(); ++iter
)
23592 unsigned i
= TEMPLATE_PARM_IDX (TEMPLATE_TYPE_PARM_INDEX (elt
));
23593 TREE_VEC_ELT (tree_vec
, i
)
23594 = build_tree_list (NULL_TREE
, TYPE_NAME (elt
));
23600 /* Replace occurrences of 'auto' in TYPE with the appropriate type deduced
23601 from INIT. AUTO_NODE is the TEMPLATE_TYPE_PARM used for 'auto' in TYPE. */
23604 do_auto_deduction (tree type
, tree init
, tree auto_node
)
23606 return do_auto_deduction (type
, init
, auto_node
,
23607 tf_warning_or_error
,
23611 /* Replace occurrences of 'auto' in TYPE with the appropriate type deduced
23612 from INIT. AUTO_NODE is the TEMPLATE_TYPE_PARM used for 'auto' in TYPE.
23613 The CONTEXT determines the context in which auto deduction is performed
23614 and is used to control error diagnostics. */
23617 do_auto_deduction (tree type
, tree init
, tree auto_node
,
23618 tsubst_flags_t complain
, auto_deduction_context context
)
23622 if (init
== error_mark_node
)
23623 return error_mark_node
;
23625 if (type_dependent_expression_p (init
))
23626 /* Defining a subset of type-dependent expressions that we can deduce
23627 from ahead of time isn't worth the trouble. */
23630 /* [dcl.spec.auto]: Obtain P from T by replacing the occurrences of auto
23631 with either a new invented type template parameter U or, if the
23632 initializer is a braced-init-list (8.5.4), with
23633 std::initializer_list<U>. */
23634 if (BRACE_ENCLOSED_INITIALIZER_P (init
))
23636 if (!DIRECT_LIST_INIT_P (init
))
23637 type
= listify_autos (type
, auto_node
);
23638 else if (CONSTRUCTOR_NELTS (init
) == 1)
23639 init
= CONSTRUCTOR_ELT (init
, 0)->value
;
23642 if (complain
& tf_warning_or_error
)
23644 if (permerror (input_location
, "direct-list-initialization of "
23645 "%<auto%> requires exactly one element"))
23646 inform (input_location
,
23647 "for deduction to %<std::initializer_list%>, use copy-"
23648 "list-initialization (i.e. add %<=%> before the %<{%>)");
23650 type
= listify_autos (type
, auto_node
);
23654 init
= resolve_nondeduced_context (init
);
23656 if (AUTO_IS_DECLTYPE (auto_node
))
23658 bool id
= (DECL_P (init
) || (TREE_CODE (init
) == COMPONENT_REF
23659 && !REF_PARENTHESIZED_P (init
)));
23660 targs
= make_tree_vec (1);
23661 TREE_VEC_ELT (targs
, 0)
23662 = finish_decltype_type (init
, id
, tf_warning_or_error
);
23663 if (type
!= auto_node
)
23665 if (complain
& tf_error
)
23666 error ("%qT as type rather than plain %<decltype(auto)%>", type
);
23667 return error_mark_node
;
23672 tree parms
= build_tree_list (NULL_TREE
, type
);
23676 tparms
= extract_autos (type
);
23679 tparms
= make_tree_vec (1);
23680 TREE_VEC_ELT (tparms
, 0)
23681 = build_tree_list (NULL_TREE
, TYPE_NAME (auto_node
));
23684 targs
= make_tree_vec (TREE_VEC_LENGTH (tparms
));
23685 int val
= type_unification_real (tparms
, targs
, parms
, &init
, 1, 0,
23686 DEDUCE_CALL
, LOOKUP_NORMAL
,
23687 NULL
, /*explain_p=*/false);
23690 if (processing_template_decl
)
23691 /* Try again at instantiation time. */
23693 if (type
&& type
!= error_mark_node
23694 && (complain
& tf_error
))
23695 /* If type is error_mark_node a diagnostic must have been
23696 emitted by now. Also, having a mention to '<type error>'
23697 in the diagnostic is not really useful to the user. */
23699 if (cfun
&& auto_node
== current_function_auto_return_pattern
23700 && LAMBDA_FUNCTION_P (current_function_decl
))
23701 error ("unable to deduce lambda return type from %qE", init
);
23703 error ("unable to deduce %qT from %qE", type
, init
);
23704 type_unification_real (tparms
, targs
, parms
, &init
, 1, 0,
23705 DEDUCE_CALL
, LOOKUP_NORMAL
,
23706 NULL
, /*explain_p=*/true);
23708 return error_mark_node
;
23712 /* If the list of declarators contains more than one declarator, the type
23713 of each declared variable is determined as described above. If the
23714 type deduced for the template parameter U is not the same in each
23715 deduction, the program is ill-formed. */
23716 if (!flag_concepts
&& TREE_TYPE (auto_node
)
23717 && !same_type_p (TREE_TYPE (auto_node
), TREE_VEC_ELT (targs
, 0)))
23719 if (cfun
&& auto_node
== current_function_auto_return_pattern
23720 && LAMBDA_FUNCTION_P (current_function_decl
))
23721 error ("inconsistent types %qT and %qT deduced for "
23722 "lambda return type", TREE_TYPE (auto_node
),
23723 TREE_VEC_ELT (targs
, 0));
23725 error ("inconsistent deduction for %qT: %qT and then %qT",
23726 auto_node
, TREE_TYPE (auto_node
), TREE_VEC_ELT (targs
, 0));
23727 return error_mark_node
;
23729 if (!flag_concepts
)
23730 TREE_TYPE (auto_node
) = TREE_VEC_ELT (targs
, 0);
23732 /* Check any placeholder constraints against the deduced type. */
23733 if (flag_concepts
&& !processing_template_decl
)
23734 if (tree constr
= PLACEHOLDER_TYPE_CONSTRAINTS (auto_node
))
23736 /* Use the deduced type to check the associated constraints. */
23737 if (!constraints_satisfied_p (constr
, targs
))
23739 if (complain
& tf_warning_or_error
)
23743 case adc_unspecified
:
23744 error("placeholder constraints not satisfied");
23746 case adc_variable_type
:
23747 error ("deduced initializer does not satisfy "
23748 "placeholder constraints");
23750 case adc_return_type
:
23751 error ("deduced return type does not satisfy "
23752 "placeholder constraints");
23754 case adc_requirement
:
23755 error ("deduced expression type does not saatisy "
23756 "placeholder constraints");
23759 diagnose_constraints (input_location
, constr
, targs
);
23761 return error_mark_node
;
23765 if (processing_template_decl
)
23766 targs
= add_to_template_args (current_template_args (), targs
);
23767 return tsubst (type
, targs
, complain
, NULL_TREE
);
23770 /* Substitutes LATE_RETURN_TYPE for 'auto' in TYPE and returns the
23774 splice_late_return_type (tree type
, tree late_return_type
)
23776 if (is_auto (type
))
23778 if (late_return_type
)
23779 return late_return_type
;
23781 tree idx
= get_template_parm_index (type
);
23782 if (TEMPLATE_PARM_LEVEL (idx
) <= processing_template_decl
)
23783 /* In an abbreviated function template we didn't know we were dealing
23784 with a function template when we saw the auto return type, so update
23785 it to have the correct level. */
23786 return make_auto_1 (TYPE_IDENTIFIER (type
));
23791 /* Returns true iff TYPE is a TEMPLATE_TYPE_PARM representing 'auto' or
23792 'decltype(auto)'. */
23795 is_auto (const_tree type
)
23797 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
23798 && (TYPE_IDENTIFIER (type
) == get_identifier ("auto")
23799 || TYPE_IDENTIFIER (type
) == get_identifier ("decltype(auto)")))
23805 /* for_each_template_parm callback for type_uses_auto. */
23808 is_auto_r (tree tp
, void */
*data*/
)
23810 return is_auto_or_concept (tp
);
23813 /* Returns the TEMPLATE_TYPE_PARM in TYPE representing `auto' iff TYPE contains
23814 a use of `auto'. Returns NULL_TREE otherwise. */
23817 type_uses_auto (tree type
)
23821 /* The Concepts TS allows multiple autos in one type-specifier; just
23822 return the first one we find, do_auto_deduction will collect all of
23824 if (uses_template_parms (type
))
23825 return for_each_template_parm (type
, is_auto_r
, /*data*/NULL
,
23826 /*visited*/NULL
, /*nondeduced*/true);
23831 return find_type_usage (type
, is_auto
);
23834 /* Returns true iff TYPE is a TEMPLATE_TYPE_PARM representing 'auto',
23835 'decltype(auto)' or a concept. */
23838 is_auto_or_concept (const_tree type
)
23840 return is_auto (type
); // or concept
23843 /* Returns the TEMPLATE_TYPE_PARM in TYPE representing a generic type (`auto' or
23844 a concept identifier) iff TYPE contains a use of a generic type. Returns
23845 NULL_TREE otherwise. */
23848 type_uses_auto_or_concept (tree type
)
23850 return find_type_usage (type
, is_auto_or_concept
);
23854 /* For a given template T, return the vector of typedefs referenced
23855 in T for which access check is needed at T instantiation time.
23856 T is either a FUNCTION_DECL or a RECORD_TYPE.
23857 Those typedefs were added to T by the function
23858 append_type_to_template_for_access_check. */
23860 vec
<qualified_typedef_usage_t
, va_gc
> *
23861 get_types_needing_access_check (tree t
)
23864 vec
<qualified_typedef_usage_t
, va_gc
> *result
= NULL
;
23866 if (!t
|| t
== error_mark_node
)
23869 if (!(ti
= get_template_info (t
)))
23872 if (CLASS_TYPE_P (t
)
23873 || TREE_CODE (t
) == FUNCTION_DECL
)
23875 if (!TI_TEMPLATE (ti
))
23878 result
= TI_TYPEDEFS_NEEDING_ACCESS_CHECKING (ti
);
23884 /* Append the typedef TYPE_DECL used in template T to a list of typedefs
23885 tied to T. That list of typedefs will be access checked at
23886 T instantiation time.
23887 T is either a FUNCTION_DECL or a RECORD_TYPE.
23888 TYPE_DECL is a TYPE_DECL node representing a typedef.
23889 SCOPE is the scope through which TYPE_DECL is accessed.
23890 LOCATION is the location of the usage point of TYPE_DECL.
23892 This function is a subroutine of
23893 append_type_to_template_for_access_check. */
23896 append_type_to_template_for_access_check_1 (tree t
,
23899 location_t location
)
23901 qualified_typedef_usage_t typedef_usage
;
23904 if (!t
|| t
== error_mark_node
)
23907 gcc_assert ((TREE_CODE (t
) == FUNCTION_DECL
23908 || CLASS_TYPE_P (t
))
23910 && TREE_CODE (type_decl
) == TYPE_DECL
23913 if (!(ti
= get_template_info (t
)))
23916 gcc_assert (TI_TEMPLATE (ti
));
23918 typedef_usage
.typedef_decl
= type_decl
;
23919 typedef_usage
.context
= scope
;
23920 typedef_usage
.locus
= location
;
23922 vec_safe_push (TI_TYPEDEFS_NEEDING_ACCESS_CHECKING (ti
), typedef_usage
);
23925 /* Append TYPE_DECL to the template TEMPL.
23926 TEMPL is either a class type, a FUNCTION_DECL or a a TEMPLATE_DECL.
23927 At TEMPL instanciation time, TYPE_DECL will be checked to see
23928 if it can be accessed through SCOPE.
23929 LOCATION is the location of the usage point of TYPE_DECL.
23931 e.g. consider the following code snippet:
23938 template<class U> struct S
23940 C::myint mi; // <-- usage point of the typedef C::myint
23945 At S<char> instantiation time, we need to check the access of C::myint
23946 In other words, we need to check the access of the myint typedef through
23947 the C scope. For that purpose, this function will add the myint typedef
23948 and the scope C through which its being accessed to a list of typedefs
23949 tied to the template S. That list will be walked at template instantiation
23950 time and access check performed on each typedefs it contains.
23951 Note that this particular code snippet should yield an error because
23952 myint is private to C. */
23955 append_type_to_template_for_access_check (tree templ
,
23958 location_t location
)
23960 qualified_typedef_usage_t
*iter
;
23963 gcc_assert (type_decl
&& (TREE_CODE (type_decl
) == TYPE_DECL
));
23965 /* Make sure we don't append the type to the template twice. */
23966 FOR_EACH_VEC_SAFE_ELT (get_types_needing_access_check (templ
), i
, iter
)
23967 if (iter
->typedef_decl
== type_decl
&& scope
== iter
->context
)
23970 append_type_to_template_for_access_check_1 (templ
, type_decl
,
23974 /* Convert the generic type parameters in PARM that match the types given in the
23975 range [START_IDX, END_IDX) from the current_template_parms into generic type
23979 convert_generic_types_to_packs (tree parm
, int start_idx
, int end_idx
)
23981 tree current
= current_template_parms
;
23982 int depth
= TMPL_PARMS_DEPTH (current
);
23983 current
= INNERMOST_TEMPLATE_PARMS (current
);
23984 tree replacement
= make_tree_vec (TREE_VEC_LENGTH (current
));
23986 for (int i
= 0; i
< start_idx
; ++i
)
23987 TREE_VEC_ELT (replacement
, i
)
23988 = TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (current
, i
)));
23990 for (int i
= start_idx
; i
< end_idx
; ++i
)
23992 /* Create a distinct parameter pack type from the current parm and add it
23993 to the replacement args to tsubst below into the generic function
23996 tree o
= TREE_TYPE (TREE_VALUE
23997 (TREE_VEC_ELT (current
, i
)));
23998 tree t
= copy_type (o
);
23999 TEMPLATE_TYPE_PARM_INDEX (t
)
24000 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (o
),
24002 TREE_TYPE (TEMPLATE_TYPE_DECL (t
)) = t
;
24003 TYPE_STUB_DECL (t
) = TYPE_NAME (t
) = TEMPLATE_TYPE_DECL (t
);
24004 TYPE_MAIN_VARIANT (t
) = t
;
24005 TEMPLATE_TYPE_PARAMETER_PACK (t
) = true;
24006 TYPE_CANONICAL (t
) = canonical_type_parameter (t
);
24007 TREE_VEC_ELT (replacement
, i
) = t
;
24008 TREE_VALUE (TREE_VEC_ELT (current
, i
)) = TREE_CHAIN (t
);
24011 for (int i
= end_idx
, e
= TREE_VEC_LENGTH (current
); i
< e
; ++i
)
24012 TREE_VEC_ELT (replacement
, i
)
24013 = TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (current
, i
)));
24015 /* If there are more levels then build up the replacement with the outer
24018 replacement
= add_to_template_args (template_parms_to_args
24019 (TREE_CHAIN (current_template_parms
)),
24022 return tsubst (parm
, replacement
, tf_none
, NULL_TREE
);
24025 /* Entries in the decl_constraint hash table. */
24026 struct GTY((for_user
)) constr_entry
24032 /* Hashing function and equality for constraint entries. */
24033 struct constr_hasher
: ggc_ptr_hash
<constr_entry
>
24035 static hashval_t
hash (constr_entry
*e
)
24037 return (hashval_t
)DECL_UID (e
->decl
);
24040 static bool equal (constr_entry
*e1
, constr_entry
*e2
)
24042 return e1
->decl
== e2
->decl
;
24046 /* A mapping from declarations to constraint information. Note that
24047 both templates and their underlying declarations are mapped to the
24048 same constraint information.
24050 FIXME: This is defined in pt.c because garbage collection
24051 code is not being generated for constraint.cc. */
24053 static GTY (()) hash_table
<constr_hasher
> *decl_constraints
;
24055 /* Returns true iff cinfo contains a valid set of constraints.
24056 This is the case when the associated requirements have been
24057 successfully decomposed into lists of atomic constraints.
24058 That is, when the saved assumptions are not error_mark_node. */
24061 valid_constraints_p (tree cinfo
)
24063 gcc_assert (cinfo
);
24064 return CI_ASSUMPTIONS (cinfo
) != error_mark_node
;
24067 /* Returns the template constraints of declaration T. If T is not
24068 constrained, return NULL_TREE. Note that T must be non-null. */
24071 get_constraints (tree t
)
24073 gcc_assert (DECL_P (t
));
24074 if (TREE_CODE (t
) == TEMPLATE_DECL
)
24075 t
= DECL_TEMPLATE_RESULT (t
);
24076 constr_entry elt
= { t
, NULL_TREE
};
24077 constr_entry
* found
= decl_constraints
->find (&elt
);
24084 /* Associate the given constraint information CI with the declaration
24085 T. If T is a template, then the constraints are associated with
24086 its underlying declaration. Don't build associations if CI is
24090 set_constraints (tree t
, tree ci
)
24095 if (TREE_CODE (t
) == TEMPLATE_DECL
)
24096 t
= DECL_TEMPLATE_RESULT (t
);
24097 gcc_assert (!get_constraints (t
));
24098 constr_entry elt
= {t
, ci
};
24099 constr_entry
** slot
= decl_constraints
->find_slot (&elt
, INSERT
);
24100 constr_entry
* entry
= ggc_alloc
<constr_entry
> ();
24105 /* Remove the associated constraints of the declaration T. */
24108 remove_constraints (tree t
)
24110 gcc_assert (DECL_P (t
));
24111 if (TREE_CODE (t
) == TEMPLATE_DECL
)
24112 t
= DECL_TEMPLATE_RESULT (t
);
24114 constr_entry elt
= {t
, NULL_TREE
};
24115 constr_entry
** slot
= decl_constraints
->find_slot (&elt
, NO_INSERT
);
24117 decl_constraints
->clear_slot (slot
);
24120 /* Set up the hash table for constraint association. */
24123 init_constraint_processing (void)
24125 decl_constraints
= hash_table
<constr_hasher
>::create_ggc(37);
24128 /* Set up the hash tables for template instantiations. */
24131 init_template_processing (void)
24133 decl_specializations
= hash_table
<spec_hasher
>::create_ggc (37);
24134 type_specializations
= hash_table
<spec_hasher
>::create_ggc (37);
24137 /* Print stats about the template hash tables for -fstats. */
24140 print_template_statistics (void)
24142 fprintf (stderr
, "decl_specializations: size %ld, %ld elements, "
24143 "%f collisions\n", (long) decl_specializations
->size (),
24144 (long) decl_specializations
->elements (),
24145 decl_specializations
->collisions ());
24146 fprintf (stderr
, "type_specializations: size %ld, %ld elements, "
24147 "%f collisions\n", (long) type_specializations
->size (),
24148 (long) type_specializations
->elements (),
24149 type_specializations
->collisions ());
24152 #include "gt-cp-pt.h"